/system/core/libcutils/ |
array.c | 50 int newCapacity = (oldCapacity == 0) ? INITIAL_CAPACITY : oldCapacity; 57 while (newCapacity < capacity) { 58 int newCap = newCapacity*2; 60 if (newCap < newCapacity || newCap > MAX_CAPACITY) { 63 newCapacity = newCap; 67 if (newCapacity < 0 || newCapacity > MAX_CAPACITY) 73 newContents = malloc(newCapacity * sizeof(void*)); 79 newContents = realloc(array->contents, sizeof(void*) * newCapacity); 85 array->capacity = newCapacity; [all...] |
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
ResizableIntArray.java | 70 final int newCapacity = calculateCapacity(minimumCapacity); 71 if (newCapacity > 0) { 73 mArray = Arrays.copyOf(mArray, newCapacity); 103 final int newCapacity = calculateCapacity(ip.mLength); 104 if (newCapacity > 0) { 106 mArray = new int[newCapacity];
|
/external/webkit/Source/JavaScriptCore/heap/ |
ConservativeRoots.cpp | 38 size_t newCapacity = m_capacity == inlineCapacity ? nonInlineCapacity : m_capacity * 2; 39 JSCell** newRoots = static_cast<JSCell**>(OSAllocator::reserveAndCommit(newCapacity * sizeof(JSCell*))); 43 m_capacity = newCapacity;
|
/external/clang/lib/Sema/ |
TypeLocBuilder.h | 141 size_t NewCapacity = Capacity * 2; 142 while (RequiredCapacity > NewCapacity) 143 NewCapacity *= 2; 144 grow(NewCapacity); 153 void grow(size_t NewCapacity) { 154 assert(NewCapacity > Capacity); 157 char *NewBuffer = new char[NewCapacity]; 158 unsigned NewIndex = Index + NewCapacity - Capacity; 167 Capacity = NewCapacity;
|
/external/icu4c/common/ |
cmemory.h | 180 * @param newCapacity must be >0 183 inline T *allocateInsteadAndReset(int32_t newCapacity=1); 189 * @param newCapacity must be >0 195 inline T *allocateInsteadAndCopy(int32_t newCapacity=1, int32_t length=0); 206 inline T *LocalMemory<T>::allocateInsteadAndReset(int32_t newCapacity) { 207 if(newCapacity>0) { 208 T *p=(T *)uprv_malloc(newCapacity*sizeof(T)); 210 uprv_memset(p, 0, newCapacity*sizeof(T)); 222 inline T *LocalMemory<T>::allocateInsteadAndCopy(int32_t newCapacity, int32_t length) { 223 if(newCapacity>0) [all...] |
ucharstriebuilder.cpp | 106 int32_t newCapacity; 108 newCapacity=1024; 110 newCapacity=4*elementsCapacity; 112 UCharsTrieElement *newElements=new UCharsTrieElement[newCapacity]; 122 elementsCapacity=newCapacity; 326 int32_t newCapacity=ucharsCapacity; 328 newCapacity*=2; 329 } while(newCapacity<=length); 330 UChar *newUChars=static_cast<UChar *>(uprv_malloc(newCapacity*2)); 338 u_memcpy(newUChars+(newCapacity-ucharsLength) [all...] |
bytestriebuilder.cpp | 156 int32_t newCapacity; 158 newCapacity=1024; 160 newCapacity=4*elementsCapacity; 162 BytesTrieElement *newElements=new BytesTrieElement[newCapacity]; 172 elementsCapacity=newCapacity; 378 int32_t newCapacity=bytesCapacity; 380 newCapacity*=2; 381 } while(newCapacity<=length); 382 char *newBytes=static_cast<char *>(uprv_malloc(newCapacity)); 390 uprv_memcpy(newBytes+(newCapacity-bytesLength) [all...] |
/external/webkit/Source/WebKit2/Platform/CoreIPC/ |
ArgumentEncoder.cpp | 71 size_t newCapacity = std::max(alignedSize + size, std::max(static_cast<size_t>(32), m_bufferCapacity + m_bufferCapacity / 4 + 1)); 73 m_buffer = static_cast<uint8_t*>(fastMalloc(newCapacity)); 75 m_buffer = static_cast<uint8_t*>(fastRealloc(m_buffer, newCapacity)); 79 m_bufferCapacity = newCapacity;
|
/external/qemu/android/utils/ |
intmap.c | 100 int newCapacity; 111 newCapacity = oldCapacity*2; 113 newCapacity = oldCapacity + (oldCapacity >> 2); 115 AARRAY_RENEW(keys, newCapacity); 116 AARRAY_RENEW(values, newCapacity); 120 map->capacity = newCapacity;
|
/external/srec/portable/src/ |
ArrayListImpl.c | 81 size_t newCapacity = impl->capacity * 2; 82 void** temp = REALLOC(impl->contents, newCapacity * sizeof(void*)); 86 impl->capacity = newCapacity; 126 size_t newCapacity = impl->capacity / 2; 129 if ((temp = REALLOC(impl->contents, newCapacity * sizeof(void*))) == NULL) 132 impl->capacity = newCapacity;
|
/external/webkit/Source/JavaScriptCore/wtf/ |
Vector.h | 277 void allocateBuffer(size_t newCapacity) 279 ASSERT(newCapacity); 280 m_capacity = newCapacity; 281 if (newCapacity > std::numeric_limits<size_t>::max() / sizeof(T)) 283 m_buffer = static_cast<T*>(fastMalloc(newCapacity * sizeof(T))); 286 bool tryAllocateBuffer(size_t newCapacity) 288 ASSERT(newCapacity); 289 if (newCapacity > std::numeric_limits<size_t>::max() / sizeof(T)) 293 if (tryFastMalloc(newCapacity * sizeof(T)).getValue(newBuffer)) { 294 m_capacity = newCapacity; [all...] |
/external/icu4c/tools/toolutil/ |
toolutil.cpp | 269 int32_t newCapacity; 279 newCapacity=capacity; 281 newCapacity=2*mem->capacity; 283 newCapacity=mem->maxCapacity; 287 mem->array=uprv_malloc(newCapacity*mem->size); 292 mem->array=uprv_realloc(mem->array, newCapacity*mem->size); 299 mem->capacity=newCapacity;
|
/external/clang/test/SemaTemplate/ |
example-dynarray.cpp | 97 unsigned NewCapacity = capacity() * 2; 98 if (NewCapacity == 0) 99 NewCapacity = 4; 101 T* NewStart = (T*)malloc(sizeof(T) * NewCapacity); 113 End = Start + NewCapacity;
|
/external/webkit/Source/JavaScriptCore/wtf/text/ |
StringBuilder.cpp | 79 void StringBuilder::reserveCapacity(unsigned newCapacity) 83 if (newCapacity > m_buffer->length()) 84 allocateBuffer(m_buffer->characters(), newCapacity); 87 if (newCapacity > m_length) 88 allocateBuffer(m_string.characters(), newCapacity);
|
/external/webkit/Source/JavaScriptCore/wtf/url/src/ |
URLBuffer.h | 119 int newCapacity = m_capacity ? m_capacity : minimumCapacity; 121 if (newCapacity >= (1 << 30)) // Prevent overflow below. 123 newCapacity *= 2; 124 } while (newCapacity < m_capacity + minimumAdditionalCapacity); 125 resize(newCapacity);
|
/frameworks/av/media/libstagefright/ |
SkipCutBuffer.cpp | 108 int32_t newcapacity = mCapacity + (num - available); local 109 char * newbuffer = new char[newcapacity]; 112 mCapacity = newcapacity; 114 ALOGV("reallocated buffer at size %d", newcapacity);
|
/packages/apps/Contacts/src/com/android/contacts/widget/ |
CompositeListAdapter.java | 77 int newCapacity = mSize + 2; 78 ListAdapter[] newAdapters = new ListAdapter[newCapacity]; 82 int[] newCounts = new int[newCapacity]; 86 int[] newViewTypeCounts = new int[newCapacity];
|
/external/clang/include/clang/Analysis/Support/ |
BumpVector.h | 218 size_t NewCapacity = 2*CurCapacity; 219 if (NewCapacity < MinSize) 220 NewCapacity = MinSize; 223 T *NewElts = C.getAllocator().template Allocate<T>(NewCapacity); 240 Capacity = Begin+NewCapacity;
|
/external/jmonkeyengine/engine/src/core/com/jme3/util/ |
IntMap.java | 142 int newCapacity = 2 * capacity; 143 Entry[] newTable = new Entry[newCapacity]; 145 int bucketmask = newCapacity - 1; 160 capacity = newCapacity; 161 threshold = (int) (newCapacity * loadFactor);
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
IntArrayList.java | 89 public void ensureCapacity(int newCapacity) { 93 elements = new int[newCapacity];
|
/external/icu4c/layoutex/ |
RunArrays.cpp | 55 void RunArray::grow(le_int32 newCapacity) 57 fLimits = (le_int32 *) LE_GROW_ARRAY(fLimits, newCapacity);
|
/external/webkit/Source/JavaScriptCore/runtime/ |
PropertyMapHashTable.h | 180 PassOwnPtr<PropertyTable> copy(JSGlobalData&, JSCell* owner, unsigned newCapacity); 193 void rehash(unsigned newCapacity); 451 inline PassOwnPtr<PropertyTable> PropertyTable::copy(JSGlobalData& globalData, JSCell* owner, unsigned newCapacity) 453 ASSERT(newCapacity >= m_keyCount); 457 if (sizeForCapacity(newCapacity) == m_indexSize) 459 return new PropertyTable(globalData, owner, newCapacity, *this); 487 inline void PropertyTable::rehash(unsigned newCapacity) 493 m_indexSize = sizeForCapacity(newCapacity);
|
/external/webkit/Source/WebCore/xml/ |
XPathNodeSet.h | 48 void reserveCapacity(size_t newCapacity) { m_nodes.reserveCapacity(newCapacity); }
|
/frameworks/native/libs/utils/ |
BasicHashtable.cpp | 202 size_t newBucketCount, newCapacity; 203 determineCapacity(minimumCapacity, loadFactor, &newBucketCount, &newCapacity); 205 if (newBucketCount != mBucketCount || newCapacity != mCapacity) { 236 mCapacity = newCapacity;
|
/frameworks/native/include/utils/ |
LruCache.h | 87 void rehash(size_t newCapacity); 216 void LruCache<TKey, TValue>::rehash(size_t newCapacity) { 222 mTable.reset(new BasicHashtable<TKey, Entry>(newCapacity));
|