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

/external/webkit/Source/JavaScriptCore/heap/
H A DConservativeRoots.cpp38 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/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/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/webkit/Source/JavaScriptCore/wtf/url/src/
H A DURLBuffer.h119 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/webkit/Source/WebCore/xml/
H A DXPathNodeSet.h48 void reserveCapacity(size_t newCapacity) { m_nodes.reserveCapacity(newCapacity); } argument
/external/icu4c/layoutex/
H A DRunArrays.cpp55 void RunArray::grow(le_int32 newCapacity) argument
57 fLimits = (le_int32 *) LE_GROW_ARRAY(fLimits, newCapacity);
/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/webkit/Source/WebKit2/Platform/CoreIPC/
H A DArgumentEncoder.cpp71 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/icu4c/common/
H A Dcmemory.h133 * @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 Ducharstriebuilder.cpp105 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 Dbytestriebuilder.cpp155 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 Dunistr.cpp1531 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 Dnormalizer2impl.cpp182 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/icu4c/tools/toolutil/
H A Dtoolutil.cpp265 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/webkit/Source/JavaScriptCore/runtime/
H A DPropertyMapHashTable.h180 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/webkit/Source/JavaScriptCore/wtf/
H A DVector.h277 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...]
/external/icu4c/i18n/
H A Dplurrule.cpp600 int32_t newCapacity = sampleCount < 20 ? 128 : sampleCount * 2; local
601 if (NULL == newSamples.resize(newCapacity, sampleCount)) {
H A Dtznames_impl.cpp209 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 Ducol.cpp255 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...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.equinox.ds_1.2.1.R36x_v20100803.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.jface_3.6.1.M20100825-0800.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
H A DFlexAntTasks.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ...
/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...

Completed in 554 milliseconds