/external/qemu/android/utils/ |
vector.c | 5 _avector_ensure( void** items, size_t itemSize, unsigned* pMaxItems, unsigned newCount ) 9 if (newCount > oldMax) { 14 AASSERT_FAIL("trying to reallocate array of 0-size items (count=%d)\n", newCount); 17 if (newCount > bigMax) { 19 itemSize, newCount, bigMax); 22 while (newMax < newCount) {
|
vector.h | 64 #define AVECTOR_ENSURE(obj,name,newCount) \ 66 unsigned _newCount = (newCount); \ 74 unsigned* pMaxItems, unsigned newCount );
|
/libcore/luni/src/main/java/java/lang/ |
AbstractStringBuilder.java | 94 int newCount = ((value.length >> 1) + value.length) + 2; 95 char[] newData = new char[min > newCount ? min : newCount]; 102 int newCount = count + 4; 103 if (newCount > value.length) { 104 enlargeBuffer(newCount); 113 int newCount = count + chars.length; 114 if (newCount > value.length) { 115 enlargeBuffer(newCount); 118 count = newCount; [all...] |
CaseMapper.java | 56 int newCount = 0; 70 newCount = i - offset; 71 System.arraycopy(value, offset, newValue, 0, newCount); 74 newValue[newCount++] = newCh; 77 return newValue != null ? new String(0, newCount, newValue) : s;
|
/external/chromium_org/third_party/skia/tests/ |
TDStackNesterTest.cpp | 38 const int newCount = nester->count(); 39 REPORTER_ASSERT(reporter, newCount == count - 1); 42 REPORTER_ASSERT(reporter, newCount == value);
|
/external/skia/tests/ |
TDStackNesterTest.cpp | 38 const int newCount = nester->count(); 39 REPORTER_ASSERT(reporter, newCount == count - 1); 42 REPORTER_ASSERT(reporter, newCount == value);
|
/external/chromium_org/third_party/skia/include/core/ |
SkTArray.h | 156 int newCount = fCount - 1; 157 fCount = newCount; 159 if (n != newCount) { 160 SkTArrayExt::copy(this, n, newCount); 161 fItemArray[newCount].~T(); 263 void resize_back(int newCount) { 264 SkASSERT(newCount >= 0); 266 if (newCount > fCount) { 267 this->push_back_n(newCount - fCount); 268 } else if (newCount < fCount) [all...] |
/external/skia/include/core/ |
SkTArray.h | 156 int newCount = fCount - 1; 157 fCount = newCount; 159 if (n != newCount) { 160 SkTArrayExt::copy(this, n, newCount); 161 fItemArray[newCount].~T(); 263 void resize_back(int newCount) { 264 SkASSERT(newCount >= 0); 266 if (newCount > fCount) { 267 this->push_back_n(newCount - fCount); 268 } else if (newCount < fCount) [all...] |
/external/chromium_org/third_party/WebKit/Source/core/css/ |
CSSImageGeneratorValue.h | 41 SizeAndCount(IntSize newSize = IntSize(), int newCount = 0) 43 , count(newCount)
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
TreeMultiset.java | 231 public boolean setCount(E element, int oldCount, int newCount) { 234 return mutate(element, new ConditionalSetCountModifier(oldCount, newCount)) 454 abstract int newCount(int oldCount); 460 int newCount = newCount(oldCount); 461 if (oldCount == newCount) { 463 } else if (newCount == 0) { 466 return BstModificationResult.rebalancingChange(null, new Node<E>(key, newCount)); 469 new Node<E>(originalEntry.getKey(), newCount)); 483 int newCount(int oldCount) [all...] |
/external/deqp/framework/delibs/depool/ |
dePoolMultiSet.h | 74 deBool TYPENAME##_setKeyCount (TYPENAME* set, KEYTYPE key, int newCount); \ 147 deBool TYPENAME##_setKeyCount (TYPENAME* set, KEYTYPE key, int newCount) \ 153 DE_ASSERT(newCount >= 0); \ 154 set->numElements += (newCount - oldCount); \ 156 if (newCount == 0 && countPtr) \ 158 else if (newCount > 0 && countPtr) \ 159 *countPtr = newCount; \ 160 else if (newCount > 0) \ 161 return TYPENAME##Hash_insert(set->hash, key, newCount); \
|
/external/chromium_org/third_party/skia/src/gpu/gl/ |
GrGLVertexArray.h | 56 void resize(int newCount) { 57 fAttribArrayStates.resize_back(newCount); 58 for (int i = 0; i < newCount; ++i) {
|
/external/skia/src/gpu/gl/ |
GrGLVertexArray.h | 56 void resize(int newCount) { 57 fAttribArrayStates.resize_back(newCount); 58 for (int i = 0; i < newCount; ++i) {
|
/frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/ |
Frame.java | 188 int newCount = newDims == null ? 0 : newDims.length; 189 if (oldCount != newCount) { 191 + "Frame to " + newCount + "-dimensional Frame!");
|
/external/guava/guava/src/com/google/common/collect/ |
ForwardingMultiset.java | 99 public boolean setCount(E element, int oldCount, int newCount) { 100 return delegate().setCount(element, oldCount, newCount); 230 E element, int oldCount, int newCount) { 231 return Multisets.setCountImpl(this, element, oldCount, newCount);
|
TreeMultiset.java | 235 public boolean setCount(E element, int oldCount, int newCount) { 238 return mutate(element, new ConditionalSetCountModifier(oldCount, newCount)) 458 abstract int newCount(int oldCount); 464 int newCount = newCount(oldCount); 465 if (oldCount == newCount) { 467 } else if (newCount == 0) { 470 return BstModificationResult.rebalancingChange(null, new Node<E>(key, newCount)); 473 new Node<E>(originalEntry.getKey(), newCount)); 487 int newCount(int oldCount) [all...] |
ConcurrentHashMultiset.java | 392 * Sets the number of occurrences of {@code element} to {@code newCount}, but only if 398 * {@code expectedOldCount == newCount}, the method will return {@code true} if 400 * @throws IllegalArgumentException if {@code expectedOldCount} or {@code newCount} is negative 402 @Override public boolean setCount(E element, int expectedOldCount, int newCount) { 404 checkNonnegative(newCount, "newCount"); 410 } else if (newCount == 0) { 414 return countMap.putIfAbsent(element, new AtomicInteger(newCount)) == null; 420 if (newCount == 0) { 425 AtomicInteger newCounter = new AtomicInteger(newCount); [all...] |
Multiset.java | 166 * @param newCount the desired count of the element in this multiset 169 * {@code oldCount == newCount}. 170 * @throws IllegalArgumentException if {@code oldCount} or {@code newCount} is 174 * oldCount} and {@code newCount} are both zero, the implementor may 177 boolean setCount(E element, int oldCount, int newCount);
|
/frameworks/base/libs/hwui/ |
VertexBuffer.h | 132 void updateIndexCount(unsigned int newCount) { 133 mIndexCount = MathUtils::min(newCount, mAllocatedIndexCount); 135 void updateVertexCount(unsigned int newCount) { 136 mVertexCount = MathUtils::min(newCount, mAllocatedVertexCount);
|
/external/webrtc/src/system_wrappers/source/ |
trace_impl.h | 104 const WebRtc_UWord32 newCount) const; 109 const WebRtc_UWord32 newCount) const;
|
/art/runtime/jdwp/ |
jdwp_expand_buf.cc | 86 static void ensureSpace(ExpandBuf* pBuf, int newCount) { 87 if (pBuf->curLen + newCount <= pBuf->maxLen) { 91 while (pBuf->curLen + newCount > pBuf->maxLen) {
|
/frameworks/opt/telephony/src/java/com/android/internal/telephony/ |
SmsBroadcastUndelivered.java | 134 int newCount = receivedCount + 1; 135 if (newCount == tracker.getMessageCount()) { 143 multiPartReceivedCount.put(reference, newCount);
|
/packages/apps/UnifiedEmail/src/com/android/mail/browse/ |
MergedAdapter.java | 113 int newCount = count + a.getCount(); 114 if (position < newCount) { 117 count = newCount;
|
/external/javassist/src/main/javassist/bytecode/ |
ByteStream.java | 185 int newCount = count + delta; 186 if (newCount > buf.length) { 188 byte[] newBuf = new byte[newLen > newCount ? newLen : newCount];
|
/external/chromium_org/third_party/skia/src/animator/ |
SkAnimateActive.cpp | 60 int newCount = animates.count(); 62 int total = oldCount + newCount; 66 memset(&fInterpolators.begin()[oldCount], 0, newCount * sizeof(SkOperandInterpolator*)); 71 newCount); 75 for (index = 0; index < newCount; index++) { 110 // total = oldCount + newCount; 118 int newCount = fAnimators.count(); 122 int newTotal = records * newCount; 126 newTotal -= newCount; 131 sizeof(fSaveRestore[0]) * (newCount - oldCount)) [all...] |