/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/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);
|
/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;
|
phashtable.c | 278 unsigned int newCapacity = ((oldCapacity << 1) | 0x01); 284 sizeof(PHashTableEntry *) * newCapacity); 290 table->args.capacity = newCapacity; 291 table->threshold = (unsigned int)(newCapacity * table->args.maxLoadFactor); 293 for (i = oldCapacity; i < newCapacity; ++i) 302 idx = entry->hashCode % newCapacity;
|
/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;
|
/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...] |
/external/icu4c/common/ |
ustr_wcs.cpp | 108 int32_t newCapacity = 2 * srcLength; 109 if(newCapacity <= tempBufCapacity) { 110 newCapacity = _BUFFER_CAPACITY_MULTIPLIER * tempBufCapacity; 113 newCapacity, count, 1)) {
|
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...] |
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...] |
normalizer2impl.cpp | 183 int32_t newCapacity=length+appendLength; 185 if(newCapacity<doubleCapacity) { 186 newCapacity=doubleCapacity; 188 if(newCapacity<256) { 189 newCapacity=256; 191 start=str.getBuffer(newCapacity); [all...] |
/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;
|
/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];
|
/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/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
ExpandedNameTable.java | 250 int newCapacity = 2 * oldCapacity + 1; 251 m_capacity = newCapacity; 252 m_threshold = (int)(newCapacity * m_loadFactor); 254 m_table = new HashEntry[newCapacity]; 262 int newIndex = e.hash % newCapacity;
|
/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/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);
|
/libcore/luni/src/main/java/java/lang/ |
ThreadLocal.java | 314 int newCapacity = capacity; 319 newCapacity = capacity * 2; 325 initializeTable(newCapacity);
|
/frameworks/av/media/libstagefright/mpeg2ts/ |
MPEG2PSExtractor.cpp | 166 size_t newCapacity = mBuffer->capacity() + kChunkSize; 167 sp<ABuffer> newBuffer = new ABuffer(newCapacity);
|
/frameworks/ex/common/java/com/android/common/widget/ |
CompositeCursorAdapter.java | 89 int newCapacity = mSize + 2; 90 Partition[] newAdapters = new Partition[newCapacity];
|
/libcore/luni/src/main/java/java/util/ |
ArrayDeque.java | 122 int newCapacity = n << 1; 123 if (newCapacity < 0) 125 Object[] a = new Object[newCapacity];
|
ArrayList.java | 154 Object[] newArray = new Object[newCapacity(s)]; 173 private static int newCapacity(int currentCapacity) { 197 int newCapacity = newCapacity(newSize - 1); // ~33% growth room 198 Object[] newArray = new Object[newCapacity]; 238 int newCapacity = newCapacity(newSize - 1); // ~33% growth room 239 Object[] newArray = new Object[newCapacity];
|
/external/icu4c/i18n/ |
plurrule.cpp | 611 int32_t newCapacity = sampleCount < 20 ? 128 : sampleCount * 2; 612 if (NULL == newSamples.resize(newCapacity, sampleCount)) { [all...] |
tznames_impl.cpp | 208 int32_t newCapacity = fNodesCapacity + 1000; 209 if (newCapacity > 0xffff) { 210 newCapacity = 0xffff; 212 CharacterNode *newNodes = (CharacterNode *)uprv_malloc(newCapacity * sizeof(CharacterNode)); 219 fNodesCapacity = newCapacity; [all...] |
/external/guava/guava/src/com/google/common/collect/ |
MinMaxPriorityQueue.java | 920 int newCapacity = calculateNewCapacity(); 921 Object[] newQueue = new Object[newCapacity]; 930 int newCapacity = (oldCapacity < 64) 933 return capAtMaximumSize(newCapacity, maximumSize);
|