Lines Matching refs:capacity
46 void SwissNameDictionary::SetCapacity(int capacity) {
47 DCHECK(IsValidCapacity(capacity));
49 WriteField<int32_t>(CapacityOffset(), capacity);
73 constexpr bool SwissNameDictionary::IsValidCapacity(int capacity) {
74 return capacity == 0 || (capacity >= kInitialCapacity &&
76 ((capacity & (capacity - 1)) == 0));
80 constexpr int SwissNameDictionary::DataTableSize(int capacity) {
81 return capacity * kTaggedSize * kDataTableEntryCount;
85 constexpr int SwissNameDictionary::CtrlTableSize(int capacity) {
88 return (capacity + kGroupWidth) * kOneByteSize;
92 constexpr int SwissNameDictionary::SizeFor(int capacity) {
93 DCHECK(IsValidCapacity(capacity));
94 return PropertyDetailsTableStartOffset(capacity) + capacity;
101 constexpr int SwissNameDictionary::MaxUsableCapacity(int capacity) {
102 DCHECK(IsValidCapacity(capacity));
104 if (Group::kWidth == 8 && capacity == 4) {
105 // If the group size is 16 we can fully utilize capacity 4: There will be
109 return capacity - capacity / 8;
340 int capacity = table->Capacity();
342 if (table->UsedCapacity() < MaxUsableCapacity(capacity)) {
347 int new_capacity = capacity == 0 ? kInitialCapacity : capacity * 2;
358 int capacity = Capacity();
359 DCHECK_LT(static_cast<unsigned>(entry), static_cast<unsigned>(capacity));
365 // at entry 0) after the first |capacity| entries of the ctrl table. This
366 // means that the ctrl table always has size |capacity| + |kGroupWidth|.
367 // However, note that we may have |capacity| < |kGroupWidth|. For example, if
377 int mask = capacity - 1;
381 copy_entry == capacity + entry);
409 int capacity = Capacity();
411 if (capacity <= kMax1ByteMetaTableCapacity) {
413 } else if (capacity <= kMax2ByteMetaTableCapacity) {
424 int capacity = Capacity();
426 if (capacity <= kMax1ByteMetaTableCapacity) {
428 } else if (capacity <= kMax2ByteMetaTableCapacity) {
462 constexpr int SwissNameDictionary::MetaTableSizePerEntryFor(int capacity) {
463 DCHECK(IsValidCapacity(capacity));
468 if (capacity <= kMax1ByteMetaTableCapacity) {
470 } else if (capacity <= kMax2ByteMetaTableCapacity) {
477 constexpr int SwissNameDictionary::MetaTableSizeFor(int capacity) {
478 DCHECK(IsValidCapacity(capacity));
480 int per_entry_size = MetaTableSizePerEntryFor(capacity);
486 return per_entry_size * (MaxUsableCapacity(capacity) + 2);
559 int capacity) {
560 DCHECK(IsValidCapacity(capacity));
564 SetCapacity(capacity);
567 memset(CtrlTable(), Ctrl::kEmpty, CtrlTableSize(capacity));
570 capacity * kDataTableEntryCount);
667 // Size for present and deleted element count at max capacity:
676 // Enumeration table entry size at maximum capacity:
706 constexpr int SwissNameDictionary::DataTableEndOffset(int capacity) {
707 return CtrlTableStartOffset(capacity);
711 constexpr int SwissNameDictionary::CtrlTableStartOffset(int capacity) {
712 return DataTableStartOffset() + DataTableSize(capacity);
717 int capacity) {
718 return CtrlTableStartOffset(capacity) + CtrlTableSize(capacity);
745 SwissNameDictionary::probe(uint32_t hash, int capacity) {
746 // If |capacity| is 0, we must produce 1 here, such that the - 1 below
747 // yields 0, which is the correct modulo mask for a table of capacity 0.
748 int non_zero_capacity = capacity | (capacity == 0);