Lines Matching defs:capacity
21 IsolateT* isolate, int capacity, AllocationType allocation) {
23 // to divide and multiple by 2 (kLoadFactor) to derive capacity
25 // to something other than 2, capacity should be stored as another
27 capacity =
28 base::bits::RoundUpToPowerOfTwo32(std::max({kInitialCapacity, capacity}));
29 if (capacity > MaxCapacity()) {
32 int num_buckets = capacity / kLoadFactor;
35 HashTableStartIndex() + num_buckets + (capacity * kEntrySize),
73 int capacity = table->Capacity();
74 if ((nof + nod) < capacity) return table;
77 if (capacity == 0) {
80 } else if (nod >= (capacity >> 1)) {
84 new_capacity = capacity;
86 new_capacity = capacity << 1;
98 int capacity = table->Capacity();
99 if (nof >= (capacity >> 2)) return table;
100 return Derived::Rehash(isolate, table, capacity / 2).ToHandleChecked();
515 IsolateT* isolate, int capacity, AllocationType allocation) {
516 return Base::Allocate(isolate, capacity, allocation);
521 IsolateT* isolate, int capacity, AllocationType allocation) {
522 return Base::Allocate(isolate, capacity, allocation);
527 IsolateT* isolate, int capacity, AllocationType allocation) {
529 Base::Allocate(isolate, capacity, allocation);
575 Isolate* isolate, int capacity, AllocationType allocation);
599 Isolate* isolate, int capacity, AllocationType allocation);
619 OrderedNameDictionary::Allocate(Isolate* isolate, int capacity,
623 OrderedNameDictionary::Allocate(LocalIsolate* isolate, int capacity,
652 Isolate* isolate, int capacity, AllocationType allocation) {
653 return isolate->factory()->NewSmallOrderedHashSet(capacity, allocation);
659 Isolate* isolate, int capacity, AllocationType allocation) {
660 return isolate->factory()->NewSmallOrderedHashMap(capacity, allocation);
666 Isolate* isolate, int capacity, AllocationType allocation) {
667 return isolate->factory()->NewSmallOrderedNameDictionary(capacity,
673 int capacity) {
675 int num_buckets = capacity / kLoadFactor;
676 int num_chains = capacity;
684 Address hashtable_start = GetHashTableStartAddress(capacity);
690 capacity * Derived::kEntrySize);
701 for (int i = 0; i < capacity; ++i) {
982 int capacity = table->Capacity();
983 if (nof >= (capacity >> 2)) return table;
984 return Derived::Rehash(isolate, table, capacity / 2);
990 int capacity = table->Capacity();
991 int new_capacity = capacity;
995 if (table->NumberOfDeletedElements() < (capacity >> 1)) {
996 new_capacity = capacity << 1;
998 // The max capacity of our table is 254. We special case for 256 to
1047 int capacity);
1066 int capacity);
1075 int capacity);
1083 int capacity) {
1084 if (capacity < SmallTable::kMaxCapacity) {
1085 return SmallTable::Allocate(isolate, capacity);
1088 return LargeTable::Allocate(isolate, capacity);
1093 Isolate* isolate, int capacity);
1096 Isolate* isolate, int capacity);
1100 int capacity);
1156 // the proper capacity.
1183 // the proper capacity.
1208 // the proper capacity.