| /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 | 61 #define AVECTOR_ENSURE(obj,name,newCount) \
63 unsigned _newCount = (newCount); \
71 unsigned* pMaxItems, unsigned newCount );
|
| /libcore/luni/src/main/java/java/lang/ |
| AbstractStringBuilder.java | 93 int newCount = ((value.length >> 1) + value.length) + 2;
94 char[] newData = new char[min > newCount ? min : newCount];
101 int newCount = count + 4;
102 if (newCount > value.length) {
103 enlargeBuffer(newCount);
112 int newCount = count + chars.length;
113 if (newCount > value.length) {
114 enlargeBuffer(newCount);
117 count = newCount;
[all...] |
| CaseMapper.java | 54 int newCount = 0;
68 newCount = i - offset;
69 System.arraycopy(value, offset, newValue, 0, newCount);
72 newValue[newCount++] = newCh;
75 return newValue != null ? new String(0, newCount, newValue) : s;
|
| /external/skia/include/core/ |
| SkTArray.h | 216 void resize_back(int newCount) {
217 SkASSERT(newCount >= 0);
219 if (newCount > fCount) {
220 push_back_n(newCount - fCount);
221 } else if (newCount < fCount) {
222 pop_back_n(fCount - newCount);
331 int newCount = fCount + delta;
334 if (newCount > fAllocCount || newCount < (fAllocCount / 3)) {
337 newAllocCount = SkMax32(newCount + ((newCount + 1) >> 1), fReserveCount)
[all...] |
| SkTDArray.h | 204 size_t newCount = fCount - 1;
205 fCount = newCount;
206 if (index != newCount) {
207 memcpy(fArray + index, fArray + newCount, sizeof(T));
|
| /external/skia/legacy/include/core/ |
| SkTArray.h | 216 void resize_back(int newCount) {
217 SkASSERT(newCount >= 0);
219 if (newCount > fCount) {
220 push_back_n(newCount - fCount);
221 } else if (newCount < fCount) {
222 pop_back_n(fCount - newCount);
331 int newCount = fCount + delta;
334 if (newCount > fAllocCount) {
335 newAllocCount = SkMax32(newCount + ((newCount + 1) >> 1)
[all...] |
| SkTDArray.h | 200 unsigned newCount = fCount - 1;
201 fCount = newCount;
202 if (index != newCount) {
203 memcpy(fArray + index, fArray + newCount, sizeof(T));
|
| /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...] |
| /dalvik/vm/jdwp/ |
| ExpandBuf.cpp | 86 static void ensureSpace(ExpandBuf* pBuf, int newCount)
90 if (pBuf->curLen + newCount <= pBuf->maxLen)
93 while (pBuf->curLen + newCount > pBuf->maxLen)
|
| /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);
|
| AbstractMultiset.java | 104 public boolean setCount(E element, int oldCount, int newCount) {
105 return setCountImpl(this, element, oldCount, newCount);
|
| /external/webrtc/src/system_wrappers/source/ |
| trace_impl.h | 104 const WebRtc_UWord32 newCount) const;
109 const WebRtc_UWord32 newCount) const;
|
| /external/skia/src/utils/win/ |
| SkDWriteFontFileStream.cpp | 139 ULONG newCount = InterlockedDecrement(&fRefCount);
140 if (0 == newCount) {
143 return newCount;
|
| /frameworks/opt/mailcommon/java/com/android/mailcommon/ |
| MergedAdapter.java | 114 int newCount = count + a.getCount();
115 if (position < newCount) {
118 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/skia/legacy/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...] |
| /external/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...] |
| /external/srec/portable/src/ |
| pmemory_ext.c | 359 void PortMemGetCount(int *newCount, int *deleteCount)
361 *newCount = portNewCount;
|
| /external/webkit/Source/WebCore/rendering/ |
| CounterNode.cpp | 184 int newCount = node->computeCountInParent();
185 if (oldCount == newCount)
187 node->m_countInParent = newCount;
|
| /tools/external/fat32lib/src/main/java/de/waldheinz/fs/fat/ |
| AbstractDirectory.java | 131 final long newCount = newSize / FatDirectoryEntry.SIZE;
132 if (newCount > Integer.MAX_VALUE)
135 this.capacity = (int) newCount;
|
| /external/guava/guava/src/com/google/common/cache/ |
| LocalCache.java | [all...] |
