Searched defs:newCapacity (Results 1 - 25 of 56) sorted by relevance

123

/external/deqp/framework/delibs/depool/
H A DdePoolArray.c72 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 DIntArrayList.java89 public void ensureCapacity(int newCapacity) { argument
93 elements = new int[newCapacity];
/external/chromium_org/third_party/WebKit/Source/core/xml/
H A DXPathNodeSet.h47 void reserveCapacity(size_t newCapacity) { m_nodes.reserveCapacity(newCapacity); } argument
/external/lzma/CPP/Common/
H A DBuffer.h27 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 DMyVector.cpp36 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 Dintmap.c100 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 DPurgeableVector.cpp250 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/chromium_org/third_party/icu/source/i18n/
H A Dsortkey.cpp99 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;
/external/icu/icu4c/source/i18n/
H A Dsortkey.cpp99 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;
/external/icu/icu4c/source/layoutex/
H A DRunArrays.cpp55 void RunArray::grow(le_int32 newCapacity) argument
57 fLimits = (le_int32 *) LE_GROW_ARRAY(fLimits, newCapacity);
/external/qemu/android/base/containers/
H A DPodVector.cpp84 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 DArrayListImpl.c81 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 Dphashtable.c278 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 DStringBuilder.cpp193 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 Dcmemory.h180 * @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 Dustr_wcs.cpp108 int32_t newCapacity = 2 * srcLength; local
109 if(newCapacity <= tempBufCapacity) {
110 newCapacity = _BUFFER_CAPACITY_MULTIPLIER * tempBufCapacity;
113 newCapacity, count, 1)) {
H A Ducharstriebuilder.cpp106 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/chromium_org/third_party/icu/source/tools/toolutil/
H A Dtoolutil.cpp291 int32_t newCapacity; local
301 newCapacity=capacity;
303 newCapacity=2*mem->capacity;
305 newCapacity=mem->maxCapacity;
309 mem->array=uprv_malloc(newCapacity*mem->size);
314 mem->array=uprv_realloc(mem->array, newCapacity*mem->size);
321 mem->capacity=newCapacity;
/external/chromium_org/third_party/skia/src/core/
H A DSkTDynamicHash.h249 void resize(int newCapacity) { argument
255 fCapacity = newCapacity;
/external/icu/icu4c/source/common/
H A Dcmemory.h180 * @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 Dsimplepatternformatter.cpp307 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 Dustr_wcs.cpp108 int32_t newCapacity = 2 * srcLength; local
109 if(newCapacity <= tempBufCapacity) {
110 newCapacity = _BUFFER_CAPACITY_MULTIPLIER * tempBufCapacity;
113 newCapacity, count, 1)) {
/external/icu/icu4c/source/tools/toolutil/
H A Dtoolutil.cpp292 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 DLog.cpp200 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 DSkTDynamicHash.h202 void resize(int newCapacity) { argument
208 fCapacity = newCapacity;

Completed in 537 milliseconds

123