Lines Matching refs:capacity
34 bool StringTableHasSufficientCapacityToAdd(int capacity, int number_of_elements,
41 if ((nof < capacity) &&
42 ((number_of_deleted_elements <= (capacity - nof) / 2))) {
44 if (nof + needed_free <= capacity) return true;
53 int capacity = base::bits::RoundUpToPowerOfTwo32(raw_capacity);
54 return std::max(capacity, kStringTableMinCapacity);
64 // Recalculate the smaller capacity actually needed.
81 // Data holds the actual data of the string table, including capacity and number
93 static std::unique_ptr<Data> New(int capacity);
95 std::unique_ptr<Data> data, int capacity);
110 DCHECK_LT(number_of_elements_ + 1, capacity());
112 capacity(), number_of_elements(), number_of_deleted_elements(), 1));
117 DCHECK_LT(number_of_elements_ + 1, capacity());
119 capacity(), number_of_elements(), number_of_deleted_elements() - 1, 1));
130 void* operator new(size_t size, int capacity);
134 int capacity() const { return capacity_; }
165 explicit Data(int capacity);
185 void* StringTable::Data::operator new(size_t size, int capacity) {
198 // Subtract 1 from capacity, as the member elements_ already supplies the
200 return AlignedAlloc(size + (capacity - 1) * sizeof(Tagged_t),
214 StringTable::Data::Data(int capacity)
218 capacity_(capacity) {
220 MemsetTagged(first_slot, empty_element(), capacity);
223 std::unique_ptr<StringTable::Data> StringTable::Data::New(int capacity) {
224 return std::unique_ptr<Data>(new (capacity) Data(capacity));
228 PtrComprCageBase cage_base, std::unique_ptr<Data> data, int capacity) {
229 std::unique_ptr<Data> new_data(new (capacity) Data(capacity));
231 DCHECK_LT(data->number_of_elements(), new_data->capacity());
233 new_data->capacity(), new_data->number_of_elements(),
237 for (InternalIndex i : InternalIndex::Range(data->capacity())) {
335 return data_.load(std::memory_order_acquire)->capacity();
596 int current_capacity = data->capacity();