/external/deqp/framework/delibs/depool/ |
H A D | dePoolArray.c | 72 int newCapacity = deAlign32(size, 1 << DE_ARRAY_ELEMENTS_PER_PAGE_LOG2); local 73 int reqPageTableCapacity = newCapacity >> DE_ARRAY_ELEMENTS_PER_PAGE_LOG2; 127 DE_ASSERT(arr->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/chromium_org/third_party/WebKit/Source/core/xml/ |
H A D | XPathNodeSet.h | 47 void reserveCapacity(size_t newCapacity) { m_nodes.reserveCapacity(newCapacity); } argument
|
/external/lzma/CPP/Common/ |
H A D | Buffer.h | 27 void SetCapacity(size_t newCapacity)
argument 29 if (newCapacity == _capacity)
32 if (newCapacity > 0)
34 newBuffer = new T[newCapacity];
36 memmove(newBuffer, _items, MyMin(_capacity, newCapacity) * sizeof(T));
42 _capacity = newCapacity;
|
H A D | MyVector.cpp | 36 void CBaseRecordVector::Reserve(int newCapacity)
argument 38 // if (newCapacity <= _capacity)
39 if (newCapacity == _capacity)
41 if ((unsigned)newCapacity >= ((unsigned)1 << (sizeof(unsigned) * 8 - 1)))
43 size_t newSize = (size_t)(unsigned)newCapacity * _itemSize;
44 if (newSize / _itemSize != (size_t)(unsigned)newCapacity)
52 int numRecordsToMove = (_size < newCapacity ? _size : newCapacity);
57 _capacity = 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/chromium_org/third_party/WebKit/Source/platform/ |
H A D | PurgeableVector.cpp | 250 size_t newCapacity = std::max(capacity, static_cast<size_t>(m_discardableCapacity * growthFactor)); local 257 newCapacity = (newCapacity + kPageSize - 1) & ~(kPageSize - 1); 259 return std::max(capacity, newCapacity); // Overflow check.
|
/external/icu/icu4c/source/i18n/ |
H A D | sortkey.cpp | 99 uint8_t *CollationKey::reallocate(int32_t newCapacity, int32_t length) { argument 100 uint8_t *newBytes = static_cast<uint8_t *>(uprv_malloc(newCapacity)); 107 fUnion.fFields.fCapacity = newCapacity;
|
H A D | collationkeys.cpp | 185 int32_t newCapacity = 2 * buffer.getCapacity(); local 187 if (newCapacity < altCapacity) { 188 newCapacity = altCapacity; 190 if (newCapacity < 200) { 191 newCapacity = 200; 193 if(buffer.resize(newCapacity, len)==NULL) {
|
/external/icu/icu4c/source/layoutex/ |
H A D | RunArrays.cpp | 55 void RunArray::grow(le_int32 newCapacity) argument 57 fLimits = (le_int32 *) LE_GROW_ARRAY(fLimits, newCapacity);
|
/external/qemu/android/base/containers/ |
H A D | PodVector.cpp | 84 size_t newCapacity = oldCapacity; local 85 while (newCapacity < newSize) { 86 size_t newCapacity2 = newCapacity + (newCapacity >> 2) + 8; 87 if (newCapacity2 < newCapacity || newCapacity > kMaxSize) { 88 newCapacity = kMaxSize; 90 newCapacity = newCapacity2; 93 reserve(newCapacity, itemSize);
|
/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/chromium_org/third_party/WebKit/Source/wtf/text/ |
H A D | StringBuilder.cpp | 193 void StringBuilder::reserveCapacity(unsigned newCapacity) argument 197 if (newCapacity > m_buffer->length()) { 199 reallocateBuffer<LChar>(newCapacity); 201 reallocateBuffer<UChar>(newCapacity); 205 if (newCapacity > m_length) { 208 allocateBuffer(nullPlaceholder, newCapacity); 210 allocateBuffer(m_string.characters8(), newCapacity); 212 allocateBuffer(m_string.characters16(), newCapacity);
|
/external/chromium_org/third_party/icu/source/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> 314 resize(int32_t newCapacity, int32_t length) argument 484 resize(int32_t newCapacity, int32_t length) argument [all...] |
/external/chromium_org/third_party/icu/source/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/chromium_org/third_party/skia/src/core/ |
H A D | SkTDynamicHash.h | 202 void resize(int newCapacity) { argument 208 fCapacity = newCapacity;
|
/external/icu/icu4c/source/common/ |
H A D | 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) { argument 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) { argument 223 if(newCapacity> 363 resize(int32_t newCapacity, int32_t length) argument 538 resize(int32_t newCapacity, int32_t length) argument [all...] |
H A D | simplepatternformatter.cpp | 307 int32_t newCapacity = 2*atLeast - 2; local 310 int32_t *newBuffer = (int32_t *) uprv_malloc(2 * newCapacity * sizeof(int32_t)); 325 placeholderCapacity = newCapacity;
|
H A D | ustr_wcs.cpp | 108 int32_t newCapacity = 2 * srcLength; local 109 if(newCapacity <= tempBufCapacity) { 110 newCapacity = _BUFFER_CAPACITY_MULTIPLIER * tempBufCapacity; 113 newCapacity, count, 1)) {
|
H A D | ucharstriebuilder.cpp | 106 int32_t newCapacity; local 108 newCapacity=1024; 110 newCapacity=4*elementsCapacity; 112 UCharsTrieElement *newElements=new UCharsTrieElement[newCapacity]; 122 elementsCapacity=newCapacity; 326 int32_t newCapacity=ucharsCapacity; local 328 newCapacity*=2; 329 } while(newCapacity<=length); 330 UChar *newUChars=static_cast<UChar *>(uprv_malloc(newCapacity*2)); 338 u_memcpy(newUChars+(newCapacity [all...] |
/external/icu/icu4c/source/tools/toolutil/ |
H A D | toolutil.cpp | 292 int32_t newCapacity; local 302 newCapacity=capacity; 304 newCapacity=2*mem->capacity; 306 newCapacity=mem->maxCapacity; 310 mem->array=uprv_malloc(newCapacity*mem->size); 315 mem->array=uprv_realloc(mem->array, newCapacity*mem->size); 322 mem->capacity=newCapacity;
|
/external/qemu/android/base/ |
H A D | Log.cpp | 200 size_t newCapacity = mCapacity; local 201 while (newCapacity < newSize) 202 newCapacity += (newCapacity >> 2) + 32; 204 ::realloc(mString, newCapacity + 1)); 205 mCapacity = newCapacity;
|
/external/skia/src/core/ |
H A D | SkTDynamicHash.h | 202 void resize(int newCapacity) { argument 208 fCapacity = newCapacity;
|
/external/deqp/framework/delibs/decpp/ |
H A D | dePoolArray.hpp | 290 deUintptr newCapacity = (deUintptr)deAlignPtr((void*)capacity, 1 << ELEMENTS_PER_PAGE_LOG2); local 291 deUintptr reqPageTableCapacity = newCapacity >> ELEMENTS_PER_PAGE_LOG2; 344 DE_ASSERT(m_capacity >= newCapacity);
|