HomeSort by relevance Sort by last modified time
    Searched full:newcount (Results 1 - 25 of 116) sorted by null

1 2 3 4 5

  /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 );
  /external/llvm/test/CodeGen/ARM/
a15-partial-update.ll 28 %oldcount = phi i32 [0, %entry], [%newcount, %loop]
29 %newcount = add i32 %oldcount, 1
30 %p1 = getelementptr <4 x i8> *%in, i32 %newcount
31 %p2 = getelementptr <4 x i8> *%out, i32 %newcount
34 %cmp = icmp eq i32 %newcount, %n
  /external/e2fsprogs/lib/ext2fs/
ext_attr.c 115 __u32 *newcount)
138 if (newcount)
139 *newcount = header->h_refcount;
153 __u32 *newcount)
155 return ext2fs_adjust_ea_refcount(fs, blk, block_buf, adjust, 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...]
  /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...]
  /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/guava/guava/src/com/google/common/collect/
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...]
  /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/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/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/tests/
TDStackNesterTest.cpp 38 const int newCount = nester->count();
39 REPORTER_ASSERT(reporter, newCount == count - 1);
42 REPORTER_ASSERT(reporter, newCount == value);
  /packages/apps/UnifiedEmail/src/com/android/mail/browse/
MergedAdapter.java 113 int newCount = count + a.getCount();
114 if (position < newCount) {
117 count = newCount;
  /external/chromium_org/third_party/WebKit/Source/core/css/
CSSImageGeneratorValue.h 41 SizeAndCount(IntSize newSize = IntSize(), int newCount = 0)
43 , count(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...]
  /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/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];
  /packages/apps/UnifiedEmail/src/org/apache/commons/io/output/
ByteArrayOutputStream.java 105 * @param newcount the size of the buffer if one is created
107 private void needNewBuffer(int newcount) {
118 newBufferSize = newcount;
123 newcount - filledBufferSum);
151 int newcount = count + len; local
159 needNewBuffer(newcount);
163 count = newcount;
  /external/chromium_org/third_party/skia/src/ports/
SkFontMgr_win_dw.cpp 70 ULONG newCount = InterlockedDecrement(&fRefCount);
71 if (0 == newCount) {
74 return newCount;
146 ULONG newCount = InterlockedDecrement(&fRefCount);
147 if (0 == newCount) {
150 return newCount;
233 ULONG newCount = InterlockedDecrement(&fRefCount);
234 if (0 == newCount) {
237 return newCount;
  /external/skia/src/ports/
SkFontMgr_win_dw.cpp 70 ULONG newCount = InterlockedDecrement(&fRefCount);
71 if (0 == newCount) {
74 return newCount;
146 ULONG newCount = InterlockedDecrement(&fRefCount);
147 if (0 == newCount) {
150 return newCount;
233 ULONG newCount = InterlockedDecrement(&fRefCount);
234 if (0 == newCount) {
237 return newCount;
  /external/pdfium/core/src/fxge/win32/
fx_win32_dwrite.cpp 302 ULONG newCount = InterlockedDecrement((long*)(&refCount_));
303 if (newCount == 0) {
306 return newCount;
361 ULONG newCount = InterlockedDecrement((long*)(&refCount_));
362 if (newCount == 0) {
366 return newCount;
  /external/webrtc/src/system_wrappers/source/
trace_impl.h 104 const WebRtc_UWord32 newCount) const;
109 const WebRtc_UWord32 newCount) const;

Completed in 2108 milliseconds

1 2 3 4 5