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

1 2 3 4 5 6 7

  /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>, <4 x i8> *%in, i32 %newcount
31 %p2 = getelementptr <4 x i8>, <4 x i8> *%out, i32 %newcount
34 %cmp = icmp eq i32 %newcount, %n
  /libcore/ojluni/src/main/java/java/io/
CharArrayWriter.java 80 int newcount = count + 1; local
81 if (newcount > buf.length) {
82 buf = Arrays.copyOf(buf, Math.max(buf.length << 1, newcount));
85 count = newcount;
103 int newcount = count + len; local
104 if (newcount > buf.length) {
105 buf = Arrays.copyOf(buf, Math.max(buf.length << 1, newcount));
108 count = newcount;
120 int newcount = count + len; local
121 if (newcount > buf.length)
    [all...]
  /frameworks/base/services/core/java/com/android/server/pm/
KeySetHandle.java 49 protected void setRefCountLPw(int newCount) {
50 mRefCount = newCount;
  /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);
  /frameworks/base/libs/hwui/
VertexBuffer.h 131 void updateIndexCount(unsigned int newCount) {
132 mIndexCount = std::min(newCount, mAllocatedIndexCount);
134 void updateVertexCount(unsigned int newCount) {
135 mVertexCount = std::min(newCount, mAllocatedVertexCount);
  /external/icu/android_icu4j/src/main/java/android/icu/impl/
Differ.java 145 int newCount = aCount-aTop;
146 System.arraycopy(a, aTop, a, 0, newCount);
147 aCount = newCount;
153 int newCount = bCount-bTop;
154 System.arraycopy(b, bTop, b, 0, newCount);
155 bCount = newCount;
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
Differ.java 143 int newCount = aCount-aTop;
144 System.arraycopy(a, aTop, a, 0, newCount);
145 aCount = newCount;
151 int newCount = bCount-bTop;
152 System.arraycopy(b, bTop, b, 0, newCount);
153 bCount = newCount;
  /external/skia/include/private/
SkTArray.h 120 int newCount = fCount - 1;
121 fCount = newCount;
123 if (n != newCount) {
124 this->move(n, newCount);
234 void resize_back(int newCount) {
235 SkASSERT(newCount >= 0);
237 if (newCount > fCount) {
238 this->push_back_n(newCount - fCount);
239 } else if (newCount < fCount) {
240 this->pop_back_n(fCount - newCount);
    [all...]
SkTDArray.h 208 int newCount = fCount - 1;
209 fCount = newCount;
210 if (index != newCount) {
211 memcpy(fArray + index, fArray + newCount, sizeof(T));
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
TreeMultiset.java 308 public boolean setCount(@Nullable E element, int oldCount, int newCount) {
309 checkNonnegative(newCount, "newCount");
316 if (newCount > 0) {
317 add(element, newCount);
325 AvlNode<E> newRoot = root.setCount(comparator(), element, oldCount, newCount, result);
717 int newCount,
724 if (expectedCount == 0 && newCount > 0) {
725 return addLeftChild(e, newCount);
730 left = initLeft.setCount(comparator, e, expectedCount, newCount, result)
    [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/skia/src/gpu/gl/
GrGLVertexArray.h 30 void resize(int newCount) {
31 fAttribArrayStates.resize_back(newCount);
32 for (int i = 0; i < newCount; ++i) {
  /packages/apps/UnifiedEmail/src/com/android/mail/browse/
MergedAdapter.java 113 int newCount = count + a.getCount();
114 if (position < newCount) {
117 count = newCount;
  /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/guava/guava/src/com/google/common/collect/
TreeMultiset.java 312 public boolean setCount(@Nullable E element, int oldCount, int newCount) {
313 checkNonnegative(newCount, "newCount");
320 if (newCount > 0) {
321 add(element, newCount);
329 AvlNode<E> newRoot = root.setCount(comparator(), element, oldCount, newCount, result);
721 int newCount,
728 if (expectedCount == 0 && newCount > 0) {
729 return addLeftChild(e, newCount);
734 left = initLeft.setCount(comparator, e, expectedCount, newCount, result)
    [all...]
ConcurrentHashMultiset.java 394 * Sets the number of occurrences of {@code element} to {@code newCount}, but only if
400 * {@code expectedOldCount == newCount}, the method will return {@code true} if
402 * @throws IllegalArgumentException if {@code expectedOldCount} or {@code newCount} is negative
404 @Override public boolean setCount(E element, int expectedOldCount, int newCount) {
407 checkNonnegative(newCount, "newCount");
413 } else if (newCount == 0) {
417 return countMap.putIfAbsent(element, new AtomicInteger(newCount)) == null;
423 if (newCount == 0) {
428 AtomicInteger newCounter = new AtomicInteger(newCount);
    [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/skia/src/ports/
SkFontMgr_win_dw.cpp 79 ULONG newCount = InterlockedDecrement(&fRefCount);
80 if (0 == newCount) {
83 return newCount;
155 ULONG newCount = InterlockedDecrement(&fRefCount);
156 if (0 == newCount) {
159 return newCount;
242 ULONG newCount = InterlockedDecrement(&fRefCount);
243 if (0 == newCount) {
246 return newCount;
606 ULONG newCount = InterlockedDecrement(&fRefCount)
    [all...]
  /external/guava/guava-tests/benchmark/com/google/common/collect/
ConcurrentHashMultisetBenchmark.java 382 * Sets the number of occurrences of {@code element} to {@code newCount}, but
389 * {@code oldCount == newCount}, the method will return {@code true} if
391 * @throws IllegalArgumentException if {@code oldCount} or {@code newCount} is
394 @Override public boolean setCount(E element, int oldCount, int newCount) {
396 checkNonnegative(newCount, "newCount");
397 if (newCount == 0) {
406 return countMap.putIfAbsent(element, newCount) == null;
408 return countMap.replace(element, oldCount, newCount);
  /external/pdfium/core/src/fxge/win32/
fx_win32_dwrite.cpp 276 ULONG newCount = InterlockedDecrement((long*)(&refCount_));
277 if (newCount == 0) {
280 return newCount;
325 ULONG newCount = InterlockedDecrement((long*)(&refCount_));
326 if (newCount == 0) {
330 return newCount;
  /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) {
  /external/skia/src/utils/win/
SkDWriteFontFileStream.cpp 168 ULONG newCount = InterlockedDecrement(&fRefCount);
169 if (0 == newCount) {
172 return newCount;
  /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!");
  /prebuilts/gdb/darwin-x86/lib/python2.7/
collections.py 595 newcount = count + other[elem]
596 if newcount > 0:
597 result[elem] = newcount
614 newcount = count - other[elem]
615 if newcount > 0:
616 result[elem] = newcount
634 newcount = other_count if count < other_count else count
635 if newcount > 0:
636 result[elem] = newcount
654 newcount = count if count < other_count else other_coun
    [all...]

Completed in 675 milliseconds

1 2 3 4 5 6 7