| /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/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/icu4c/common/ |
| 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) {
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) {
176 if(newCapacity>0)
[all...] |
| unistr.cpp | [all...] |
| /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/text/ |
| 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);
|
| StringBuilder.h | 102 void reserveCapacity(unsigned 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/webkit/Source/WebCore/xml/ |
| XPathNodeSet.h | 48 void reserveCapacity(size_t newCapacity) { m_nodes.reserveCapacity(newCapacity); }
|
| /external/icu4c/tools/toolutil/ |
| toolutil.cpp | 265 int32_t newCapacity;
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/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;
|
| /packages/apps/Contacts/src/com/android/contacts/widget/ |
| CompositeListAdapter.java | 72 int newCapacity = mSize + 2;
73 ListAdapter[] newAdapters = new ListAdapter[newCapacity];
77 int[] newCounts = new int[newCapacity];
81 int[] newViewTypeCounts = new int[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/JavaScriptCore/wtf/ |
| Vector.h | 277 void allocateBuffer(size_t newCapacity)
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)
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;
[all...] |
| /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/webkit/Source/JavaScriptCore/runtime/ |
| 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)
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)
493 m_indexSize = sizeForCapacity(newCapacity);
|
| /libcore/luni/src/main/java/java/util/ |
| ArrayList.java | 150 Object[] newArray = new Object[newCapacity(s)];
169 private static int newCapacity(int currentCapacity) {
193 int newCapacity = newCapacity(newSize - 1); // ~33% growth room
194 Object[] newArray = new Object[newCapacity];
234 int newCapacity = newCapacity(newSize - 1); // ~33% growth room
235 Object[] newArray = new Object[newCapacity];
|
| HashMap.java | 522 int newCapacity = roundUpToPowerOfTwo(capacityForInitSize(numMappings));
525 if (newCapacity <= oldCapacity) {
528 if (newCapacity == oldCapacity * 2) {
534 HashMapEntry<K, V>[] newTable = makeTable(newCapacity);
536 int newMask = newCapacity - 1;
552 * @param newCapacity must be a power of two
554 private HashMapEntry<K, V>[] makeTable(int newCapacity) {
556 = (HashMapEntry<K, V>[]) new HashMapEntry[newCapacity];
558 threshold = (newCapacity >> 1) + (newCapacity >> 2); // 3/4 capacit
[all...] |
| Hashtable.java | 441 int newCapacity = roundUpToPowerOfTwo(capacityForInitSize(numMappings));
444 if (newCapacity <= oldCapacity) {
450 if (newCapacity == oldCapacity * 2) {
456 HashtableEntry<K, V>[] newTable = makeTable(newCapacity);
458 int newMask = newCapacity - 1;
485 * @param newCapacity must be a power of two
487 private HashtableEntry<K, V>[] makeTable(int newCapacity) {
489 = (HashtableEntry<K, V>[]) new HashtableEntry[newCapacity];
491 threshold = (newCapacity >> 1) + (newCapacity >> 2); // 3/4 capacit
[all...] |
| ArrayDeque.java | 124 int newCapacity = n << 1;
125 if (newCapacity < 0)
127 Object[] a = new Object[newCapacity];
|
| Vector.java | 445 private void grow(int newCapacity) {
446 E[] newData = newElementArray(newCapacity);
447 // Assumes elementCount is <= newCapacity
448 assert elementCount <= newCapacity;
[all...] |
| /external/icu4c/layoutex/ |
| RunArrays.cpp | 55 void RunArray::grow(le_int32 newCapacity)
57 fLimits = (le_int32 *) LE_GROW_ARRAY(fLimits, newCapacity);
|
| /external/collada/include/dae/ |
| daeArray.h | 161 size_t newCapacity = _capacity == 0 ? 1 : _capacity;
162 while(newCapacity < minCapacity)
163 newCapacity *= 2;
165 T* newData = (T*)malloc(newCapacity*_elementSize);
175 _capacity = newCapacity;
|
| /libcore/luni/src/main/java/java/lang/ |
| ThreadLocal.java | 314 int newCapacity = capacity;
319 newCapacity = capacity * 2;
325 initializeTable(newCapacity);
|
