HomeSort by relevance Sort by last modified time
    Searched defs:newCapacity (Results 1 - 25 of 27) sorted by null

1 2

  /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/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/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/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/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;
  /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...]
  /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/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/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;
  /libcore/luni/src/main/java/java/lang/
ThreadLocal.java 314 int newCapacity = capacity;
319 newCapacity = capacity * 2;
325 initializeTable(newCapacity);
  /frameworks/base/media/libstagefright/mpeg2ts/
MPEG2PSExtractor.cpp 166 size_t newCapacity = mBuffer->capacity() + kChunkSize;
167 sp<ABuffer> newBuffer = new ABuffer(newCapacity);
  /frameworks/ex/common/java/com/android/common/widget/
CompositeCursorAdapter.java 89 int newCapacity = mSize + 2;
90 Partition[] newAdapters = new Partition[newCapacity];
  /libcore/luni/src/main/java/java/util/
ArrayDeque.java 124 int newCapacity = n << 1;
125 if (newCapacity < 0)
127 Object[] a = new Object[newCapacity];
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...]