/external/webkit/Source/JavaScriptCore/wtf/url/src/ |
H A D | URLBuffer.h | 119 int newCapacity = m_capacity ? m_capacity : minimumCapacity; local 121 if (newCapacity >= (1 << 30)) // Prevent overflow below. 123 newCapacity *= 2; 124 } while (newCapacity < m_capacity + minimumAdditionalCapacity); 125 resize(newCapacity);
|
/external/icu4c/common/ |
H A D | cmemory.h | 133 * @param newCapacity must be >0 136 inline T *allocateInsteadAndReset(int32_t newCapacity=1); 142 * @param newCapacity must be >0 148 inline T *allocateInsteadAndCopy(int32_t newCapacity=1, int32_t length=0); 159 inline T *LocalMemory<T>::allocateInsteadAndReset(int32_t newCapacity) { argument 160 if(newCapacity>0) { 161 T *p=(T *)uprv_malloc(newCapacity*sizeof(T)); 163 uprv_memset(p, 0, newCapacity*sizeof(T)); 175 inline T *LocalMemory<T>::allocateInsteadAndCopy(int32_t newCapacity, int32_t length) { argument 176 if(newCapacity> 313 resize(int32_t newCapacity, int32_t length) argument 482 resize(int32_t newCapacity, int32_t length) argument [all...] |
H A D | bytestriebuilder.cpp | 155 int32_t newCapacity; local 157 newCapacity=1024; 159 newCapacity=4*elementsCapacity; 161 BytesTrieElement *newElements=new BytesTrieElement[newCapacity]; 170 elementsCapacity=newCapacity; 376 int32_t newCapacity=bytesCapacity; local 378 newCapacity*=2; 379 } while(newCapacity<=length); 380 char *newBytes=reinterpret_cast<char *>(uprv_malloc(newCapacity)); 388 uprv_memcpy(newBytes+(newCapacity [all...] |
H A D | ucharstriebuilder.cpp | 105 int32_t newCapacity; local 107 newCapacity=1024; 109 newCapacity=4*elementsCapacity; 111 UCharsTrieElement *newElements=new UCharsTrieElement[newCapacity]; 120 elementsCapacity=newCapacity; 324 int32_t newCapacity=ucharsCapacity; local 326 newCapacity*=2; 327 } while(newCapacity<=length); 328 UChar *newUChars=reinterpret_cast<UChar *>(uprv_malloc(newCapacity*2)); 336 u_memcpy(newUChars+(newCapacity [all...] |
H A D | unistr.cpp | 1531 UnicodeString::cloneArrayIfNeeded(int32_t newCapacity, argument 1538 if(newCapacity == -1) { 1539 newCapacity = getCapacity(); 1559 newCapacity > getCapacity() 1563 growCapacity = newCapacity; 1564 } else if(newCapacity <= US_STACKBUF_SIZE && growCapacity > US_STACKBUF_SIZE) { 1588 (newCapacity < growCapacity && allocate(newCapacity)) 1594 newCapacity = getCapacity(); 1595 if(newCapacity < minLengt [all...] |
H A D | normalizer2impl.cpp | 182 int32_t newCapacity=length+appendLength; local 184 if(newCapacity<doubleCapacity) { 185 newCapacity=doubleCapacity; 187 if(newCapacity<256) { 188 newCapacity=256; 190 start=str.getBuffer(newCapacity);
|
/external/webkit/Source/JavaScriptCore/heap/ |
H A D | ConservativeRoots.cpp | 38 size_t newCapacity = m_capacity == inlineCapacity ? nonInlineCapacity : m_capacity * 2; local 39 JSCell** newRoots = static_cast<JSCell**>(OSAllocator::reserveAndCommit(newCapacity * sizeof(JSCell*))); 43 m_capacity = newCapacity;
|
/external/webkit/Source/JavaScriptCore/wtf/text/ |
H A D | 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);
|
H A D | StringBuilder.h | 102 void reserveCapacity(unsigned newCapacity);
|
/external/qemu/android/utils/ |
H A D | intmap.c | 100 int newCapacity; local 111 newCapacity = oldCapacity*2; 113 newCapacity = oldCapacity + (oldCapacity >> 2); 115 AARRAY_RENEW(keys, newCapacity); 116 AARRAY_RENEW(values, newCapacity); 120 map->capacity = newCapacity;
|
/external/webkit/Source/WebKit2/Platform/CoreIPC/ |
H A D | ArgumentEncoder.cpp | 71 size_t newCapacity = std::max(alignedSize + size, std::max(static_cast<size_t>(32), m_bufferCapacity + m_bufferCapacity / 4 + 1)); local 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/webkit/Source/WebCore/xml/ |
H A D | XPathNodeSet.h | 48 void reserveCapacity(size_t newCapacity) { m_nodes.reserveCapacity(newCapacity); } argument
|
/external/icu4c/tools/toolutil/ |
H A D | toolutil.cpp | 265 int32_t newCapacity; local 275 newCapacity=capacity; 277 newCapacity=2*mem->capacity; 279 newCapacity=mem->maxCapacity; 283 mem->array=uprv_malloc(newCapacity*mem->size); 288 mem->array=uprv_realloc(mem->array, newCapacity*mem->size); 295 mem->capacity=newCapacity;
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | IntArrayList.java | 89 public void ensureCapacity(int newCapacity) { argument 93 elements = new int[newCapacity];
|
/external/srec/portable/src/ |
H A D | ArrayListImpl.c | 81 size_t newCapacity = impl->capacity * 2; local 82 void** temp = REALLOC(impl->contents, newCapacity * sizeof(void*)); 86 impl->capacity = newCapacity; 126 size_t newCapacity = impl->capacity / 2; local 129 if ((temp = REALLOC(impl->contents, newCapacity * sizeof(void*))) == NULL) 132 impl->capacity = newCapacity;
|
H A D | phashtable.c | 278 unsigned int newCapacity = ((oldCapacity << 1) | 0x01); local 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/JavaScriptCore/wtf/ |
H A D | Vector.h | 277 void allocateBuffer(size_t newCapacity) argument 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) argument 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; 415 allocateBuffer(size_t newCapacity) argument 426 tryAllocateBuffer(size_t newCapacity) argument 876 reserveCapacity(size_t newCapacity) argument 889 tryReserveCapacity(size_t newCapacity) argument 913 shrinkCapacity(size_t newCapacity) argument [all...] |
H A D | Deque.h | 423 size_t newCapacity = max(static_cast<size_t>(16), oldCapacity + oldCapacity / 4 + 1); 425 m_buffer.allocateBuffer(newCapacity); 430 size_t newStart = newCapacity - (oldCapacity - m_start);
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
H A D | 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/jmonkeyengine/engine/src/core/com/jme3/util/ |
H A D | 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/webkit/Source/JavaScriptCore/runtime/ |
H A D | 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) argument 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) argument 493 m_indexSize = sizeForCapacity(newCapacity);
|
/external/icu4c/layoutex/ |
H A D | RunArrays.cpp | 55 void RunArray::grow(le_int32 newCapacity) argument 57 fLimits = (le_int32 *) LE_GROW_ARRAY(fLimits, newCapacity);
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | MinMaxPriorityQueue.java | 920 int newCapacity = calculateNewCapacity(); 921 Object[] newQueue = new Object[newCapacity]; 930 int newCapacity = (oldCapacity < 64) 933 return capAtMaximumSize(newCapacity, maximumSize);
|
/external/icu4c/i18n/ |
H A D | tznames_impl.cpp | 209 int32_t newCapacity = fNodesCapacity + 1000; local 210 if (newCapacity > 0xffff) { 211 newCapacity = 0xffff; 213 CharacterNode *newNodes = (CharacterNode *)uprv_malloc(newCapacity * sizeof(CharacterNode)); 220 fNodesCapacity = newCapacity;
|
H A D | ucol.cpp | 255 reallocCEs(collIterate *data, int32_t newCapacity) { argument 261 uint32_t *newCEs = (uint32_t *)uprv_malloc(newCapacity * 4); 268 data->extendCEsSize = newCapacity; 305 int32_t newCapacity = 2 * offsetBufferSize + UCOL_EXPAND_CE_BUFFER_SIZE; local 306 int32_t *newBuffer = reinterpret_cast<int32_t *>(uprv_malloc(newCapacity * 4)); 317 offsetBufferSize = newCapacity; 4424 int32_t newCapacity = 2 * capacity_; local 4426 if (newCapacity < altCapacity) { 4427 newCapacity = altCapacity; 4429 if (newCapacity < 102 [all...] |