/external/smack/src/org/xbill/DNS/ |
DNSOutput.java | 60 int newsize = array.length * 2; local 61 if (newsize < pos + n) { 62 newsize = pos + n; 64 byte [] newarray = new byte[newsize];
|
/frameworks/base/core/java/android/util/ |
StateSet.java | 143 public static int[] trimStateSet(int[] states, int newSize) { 144 if (states.length == newSize) { 148 int[] trimmedStates = new int[newSize]; 149 System.arraycopy(states, 0, trimmedStates, 0, newSize);
|
/sdk/emulator/opengl/shared/emugl/common/ |
id_to_object_map.cpp | 183 void IdToObjectMapBase::resize(size_t newSize) { 184 int ret = capacityCompare(mShift, newSize); 197 } while (capacityCompare(newShift, newSize) < 0); 204 } while (capacityCompare(newShift, newSize) > 0);
|
/dalvik/dexgen/src/com/android/dexgen/util/ |
IntList.java | 322 * @param newSize {@code >= 0;} the new size 324 public void shrink(int newSize) { 325 if (newSize < 0) { 326 throw new IllegalArgumentException("newSize < 0"); 329 if (newSize > size) { 330 throw new IllegalArgumentException("newSize > size"); 335 size = newSize;
|
/dalvik/dx/src/com/android/dx/util/ |
IntList.java | 322 * @param newSize {@code >= 0;} the new size 324 public void shrink(int newSize) { 325 if (newSize < 0) { 326 throw new IllegalArgumentException("newSize < 0"); 329 if (newSize > size) { 330 throw new IllegalArgumentException("newSize > size"); 335 size = newSize;
|
/external/chromium_org/third_party/WebKit/Source/wtf/text/ |
StringBuilder.cpp | 77 void StringBuilder::resize(unsigned newSize) 79 // Check newSize < m_length, hence m_length > 0. 80 ASSERT(newSize <= m_length); 81 if (newSize == m_length) 94 m_length = newSize; 101 ASSERT(newSize < m_string.length()); 102 m_length = newSize;
|
/external/dexmaker/src/dx/java/com/android/dx/util/ |
IntList.java | 322 * @param newSize {@code >= 0;} the new size 324 public void shrink(int newSize) { 325 if (newSize < 0) { 326 throw new IllegalArgumentException("newSize < 0"); 329 if (newSize > size) { 330 throw new IllegalArgumentException("newSize > size"); 335 size = newSize;
|
/external/srec/portable/include/ |
pmemory.h | 127 #define REALLOC(ptr, newSize) (prealloc(ptr, newSize, L(__FILE__), __LINE__)) 132 #define REALLOC(ptr, newSize) (prealloc(ptr, newSize)) 208 * @param newSize The new size required. 218 PORTABLE_API void *prealloc(void* ptr, size_t newSize, const LCHAR* file, int line); 220 PORTABLE_API void *prealloc(void* ptr, size_t newSize);
|
/external/chromium_org/third_party/icu/source/common/ |
uvector.cpp | 361 * Change the size of this vector as follows: If newSize is smaller, 363 * newSize. If newSize is larger, grow the array, filling in new 366 void UVector::setSize(int32_t newSize, UErrorCode &status) { 368 if (newSize < 0) { 371 if (newSize > count) { 372 if (!ensureCapacity(newSize, status)) { 378 for (i=count; i<newSize; ++i) { 383 for (i=count-1; i>=newSize; --i) { 387 count = newSize; [all...] |
/external/icu/icu4c/source/common/ |
uvector.cpp | 361 * Change the size of this vector as follows: If newSize is smaller, 363 * newSize. If newSize is larger, grow the array, filling in new 366 void UVector::setSize(int32_t newSize, UErrorCode &status) { 368 if (newSize < 0) { 371 if (newSize > count) { 372 if (!ensureCapacity(newSize, status)) { 378 for (i=count; i<newSize; ++i) { 383 for (i=count-1; i>=newSize; --i) { 387 count = newSize; [all...] |
/external/chromium_org/third_party/WebKit/Source/wtf/ |
PartitionAlloc.cpp | [all...] |
Vector.h | 852 void Vector<T, inlineCapacity, Allocator>::fill(const T& val, size_t newSize) 854 if (size() > newSize) 855 shrink(newSize); 856 else if (newSize > capacity()) { 858 reserveCapacity(newSize); 863 TypeOperations::uninitializedFill(end(), begin() + newSize, val); 864 m_size = newSize; [all...] |
/external/chromium_org/courgette/third_party/ |
bsdiff_create.cc | 154 matchlen(const unsigned char *old,int oldsize,const unsigned char *newbuf,int newsize) 158 for(i=0;(i<oldsize)&&(i<newsize);i++) 166 const unsigned char *newbuf,int newsize,int st,int en,int *pos) 171 x=matchlen(old+I[st],oldsize-I[st],newbuf,newsize); 172 y=matchlen(old+I[en],oldsize-I[en],newbuf,newsize); 184 if(memcmp(old+I[x],newbuf,std::min(oldsize-I[x],newsize))<0) { 185 return search(I,old,oldsize,newbuf,newsize,x,en,pos); 187 return search(I,old,oldsize,newbuf,newsize,st,x,pos); 245 const int newsize = static_cast<int>(new_stream->Remaining()); local 296 while (scan < newsize) { [all...] |
/external/chromium_org/third_party/opus/src/src/ |
opus_demo.c | 258 int random_framesize=0, newsize=0, delayed_celt=0; local 626 frame_size = newsize; 630 newsize = rand()%6; 631 switch(newsize) 633 case 0: newsize=sampling_rate/400; break; 634 case 1: newsize=sampling_rate/200; break; 635 case 2: newsize=sampling_rate/100; break; 636 case 3: newsize=sampling_rate/50; break; 637 case 4: newsize=sampling_rate/25; break; 638 case 5: newsize=3*sampling_rate/50; break [all...] |
/external/libopus/src/ |
opus_demo.c | 258 int random_framesize=0, newsize=0, delayed_celt=0; local 626 frame_size = newsize; 630 newsize = rand()%6; 631 switch(newsize) 633 case 0: newsize=sampling_rate/400; break; 634 case 1: newsize=sampling_rate/200; break; 635 case 2: newsize=sampling_rate/100; break; 636 case 3: newsize=sampling_rate/50; break; 637 case 4: newsize=sampling_rate/25; break; 638 case 5: newsize=3*sampling_rate/50; break [all...] |
/external/chromium_org/third_party/mesa/src/src/mesa/main/ |
imports.c | 193 _mesa_align_realloc(void *oldBuffer, size_t oldSize, size_t newSize, 198 return _aligned_realloc(oldBuffer, newSize, alignment); 200 const size_t copySize = (oldSize < newSize) ? oldSize : newSize; 201 void *newBuf = _mesa_align_malloc(newSize, alignment); 215 _mesa_realloc(void *oldBuffer, size_t oldSize, size_t newSize) 217 const size_t copySize = (oldSize < newSize) ? oldSize : newSize; 218 void *newBuffer = malloc(newSize);
|
/external/mesa3d/src/mesa/main/ |
imports.c | 193 _mesa_align_realloc(void *oldBuffer, size_t oldSize, size_t newSize, 198 return _aligned_realloc(oldBuffer, newSize, alignment); 200 const size_t copySize = (oldSize < newSize) ? oldSize : newSize; 201 void *newBuf = _mesa_align_malloc(newSize, alignment); 215 _mesa_realloc(void *oldBuffer, size_t oldSize, size_t newSize) 217 const size_t copySize = (oldSize < newSize) ? oldSize : newSize; 218 void *newBuffer = malloc(newSize);
|
/external/chromium_org/third_party/skia/third_party/lua/src/ |
ldo.c | 161 void luaD_reallocstack (lua_State *L, int newsize) { 164 lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE); 166 luaM_reallocvector(L, L->stack, L->stacksize, newsize, TValue); 167 for (; lim < newsize; lim++) 169 L->stacksize = newsize; 170 L->stack_last = L->stack + newsize - EXTRA_STACK; 181 int newsize = 2 * size; local 182 if (newsize > LUAI_MAXSTACK) newsize = LUAI_MAXSTACK [all...] |
/external/libxml2/ |
buf.c | 733 unsigned int newSize; 752 newSize = (buf->size ? buf->size*2 : size + 10); 753 while (size > newSize) { 754 if (newSize > UINT_MAX / 2) { 758 newSize *= 2; 762 newSize = size+10; 766 newSize = size; 768 newSize = buf->size * 2; 769 while (size > newSize) { 770 if (newSize > UINT_MAX / 2) [all...] |
/libcore/luni/src/main/java/java/util/ |
ComparableTimSort.java | [all...] |
/external/bison/lib/ |
vbitset.c | 59 bitset_windex newsize; local 65 newsize = VBITSET_N_WORDS (n_bits); 67 if (oldsize < newsize) 73 if (newsize > VBITSET_ASIZE (src)) 81 size = newsize; 83 size = newsize + newsize / 4; 91 (newsize - oldsize) * sizeof (bitset_word)); 92 VBITSET_SIZE (src) = newsize; 98 if ((oldsize - newsize) >= oldsize / 2 [all...] |
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
SuballocatedIntVector.java | 166 int newsize=index+m_numblocks; local 167 int[][] newMap=new int[newsize][]; 206 int newsize=index+m_numblocks; local 207 int[][] newMap=new int[newsize][]; 264 int newsize=index+m_numblocks; local 265 int[][] newMap=new int[newsize][]; 398 int newsize=index+m_numblocks; local 399 int[][] newMap=new int[newsize][];
|
/external/chromium_org/third_party/cython/src/Cython/Includes/cpython/ |
tuple.pxd | 58 int _PyTuple_Resize(PyObject **p, Py_ssize_t newsize) except -1 59 # Can be used to resize a tuple. newsize will be the new length of
|
/external/chromium_org/third_party/skia/src/core/ |
SkFont.cpp | 50 SkFont* SkFont::cloneWithSize(SkScalar newSize) const { 51 return SkFont::Create(this->getTypeface(), newSize, this->getScaleX(), this->getSkewX(),
|
/external/libcxx/src/ |
ios.cpp | 178 size_t newsize = newcap * sizeof(long); local 179 long* iarray = static_cast<long*>(realloc(__iarray_, newsize)); 207 size_t newsize = newcap * sizeof(void*); local 208 void** parray = static_cast<void**>(realloc(__parray_, newsize)); 331 size_t newsize = sizeof(long) * rhs.__iarray_size_; local 332 new_longs.reset(static_cast<long*>(malloc(newsize))); 340 size_t newsize = sizeof(void*) * rhs.__parray_size_; local 341 new_pointers.reset(static_cast<void**>(malloc(newsize)));
|