Lines Matching defs:data
81 // Data holds the actual data of the string table, including capacity and number
95 std::unique_ptr<Data> data, int capacity);
228 PtrComprCageBase cage_base, std::unique_ptr<Data> data, int capacity) {
231 DCHECK_LT(data->number_of_elements(), new_data->capacity());
234 new_data->number_of_deleted_elements(), data->number_of_elements()));
237 for (InternalIndex i : InternalIndex::Range(data->capacity())) {
238 Object element = data->Get(cage_base, i);
246 new_data->number_of_elements_ = data->number_of_elements();
248 new_data->previous_data_ = std::move(data);
513 // Load the current string table data, in case another thread updates the
514 // data while we're reading.
535 Data* data = EnsureCapacity(isolate, 1);
539 entry = data->FindEntryOrInsertionEntry(isolate, key, key->hash());
541 Object element = data->Get(isolate, entry);
547 data->Set(entry, *new_string);
548 data->ElementAdded();
555 data->Set(entry, *new_string);
556 data->DeletedElementOverwritten();
591 Data* data = data_.load(std::memory_order_relaxed);
596 int current_capacity = data->capacity();
597 int current_nof = data->number_of_elements();
608 data->number_of_deleted_elements(), 1)) {
614 Data::Resize(cage_base, std::unique_ptr<Data>(data), new_capacity);
615 // `new_data` is the new owner of `data`.
616 DCHECK_EQ(new_data->PreviousData(), data);
617 // Release-store the new data pointer as `data_`, so that it can be
620 data = new_data.release();
621 data_.store(data, std::memory_order_release);
624 return data;