Home
last modified time | relevance | path

Searched refs:kMinCapacity (Results 1 – 12 of 12) sorted by relevance

/external/v8/src/
Dcollector.h28 explicit Collector(int initial_capacity = kMinCapacity)
126 static const int kMinCapacity = 16;
137 if (current_length < kMinCapacity) { in Grow()
140 if (new_capacity < kMinCapacity) new_capacity = kMinCapacity; in Grow()
Dobjects-debug.cc1340 CHECK_GE(capacity, kMinCapacity); in SmallOrderedHashTableVerify()
Dcode-stub-assembler.cc3421 static const int kCapacity = CollectionType::kMinCapacity; in AllocateOrderedHashTable()
7592 return IntPtrMax(capacity, IntPtrConstant(HashTableBase::kMinCapacity)); in HashTableComputeCapacity()
Dobjects.cc17214 if (capacity <= StringTable::kMinCapacity) return table; in CautiousShrink()
/external/v8/src/objects/
Dstring-table.h85 static const int kMinCapacity = 2048; variable
86 static const int kMinShrinkCapacity = kMinCapacity;
Dordered-hash-table.h22 static const int kMinCapacity = 4; variable
335 DCHECK_GE(capacity, kMinCapacity); in SizeFor()
350 DCHECK_GE(capacity, kMinCapacity); in Capacity()
375 static const int kMinCapacity = 4;
Dhash-table-inl.h49 return Max(capacity, kMinCapacity); in ComputeCapacity()
Dhash-table.h103 static const int kMinCapacity = 4; in NON_EXPORTED_BASE() local
Dordered-hash-table.cc23 capacity = base::bits::RoundUpToPowerOfTwo32(Max(kMinCapacity, capacity)); in Allocate()
74 isolate, kMinCapacity, Heap::InNewSpace(*table) ? NOT_TENURED : TENURED); in Clear()
/external/v8/src/heap/
Dfactory.h180 int capacity = SmallOrderedHashSet::kMinCapacity,
183 int capacity = SmallOrderedHashMap::kMinCapacity,
Dheap.h1568 static const int kInitialStringTableSize = StringTable::kMinCapacity;
Dfactory.cc552 return OrderedHashSet::Allocate(isolate(), OrderedHashSet::kMinCapacity); in NewOrderedHashSet()
556 return OrderedHashMap::Allocate(isolate(), OrderedHashMap::kMinCapacity); in NewOrderedHashMap()