Lines Matching refs:entry
2984 Handle<AccessorInfo> entry(AccessorInfo::cast(callbacks->get(i)), isolate);
2985 Handle<Name> key(Name::cast(entry->name()), isolate);
2988 if (!T::Contains(key, entry, valid_descriptors, array)) {
2989 T::Insert(key, entry, valid_descriptors, array);
2999 static bool Contains(Handle<Name> key, Handle<AccessorInfo> entry,
3006 static void Insert(Handle<Name> key, Handle<AccessorInfo> entry,
3009 array->set(valid_descriptors, *entry);
4095 // Do not copy the first entry, i.e., the length.
5770 InternalIndex entry = FirstProbe(hash, capacity);
5772 if (entry == expected) return expected;
5773 entry = NextProbe(entry, i, capacity);
5775 return entry;
5813 ++current; // Advance to next entry.
5818 ++current; // Advance to next entry.
5832 ++current; // Advance to next entry.
5937 for (InternalIndex entry = FirstProbe(hash, capacity);;
5938 entry = NextProbe(entry, count++, capacity)) {
5939 if (!IsKey(roots, KeyAt(cage_base, entry))) return entry;
5961 for (InternalIndex entry = FirstProbe(hash, capacity);;
5962 entry = NextProbe(entry, count++, capacity)) {
5963 Object element = KeyAt(cage_base, entry, kRelaxedLoad);
5982 InternalIndex entry = stringset->FindInsertionEntry(isolate, hash);
5983 stringset->set(EntryToIndex(entry), *name);
6001 InternalIndex entry = table->FindInsertionEntry(isolate, hash);
6002 table->set(EntryToIndex(entry), *key);
6003 table->set(EntryToValueIndex(entry), *symbol);
6014 InternalIndex entry = set->FindInsertionEntry(isolate, hash);
6015 set->set(EntryToIndex(entry), *key);
6069 Isolate* isolate, Handle<Derived> dictionary, InternalIndex entry) {
6071 dictionary->DetailsAt(entry).IsConfigurable());
6072 dictionary->ClearEntry(entry);
6082 InternalIndex entry = dictionary->FindEntry(isolate, key);
6084 // If the entry is present set the value;
6085 if (entry.is_not_found()) {
6090 dictionary->ValueAtPut(entry, *value);
6091 if (Shape::kEntrySize == 3) dictionary->DetailsAtPut(entry, details);
6101 // Insert element at empty or deleted entry.
6110 // Insert element at empty or deleted entry
6141 InternalIndex entry = dictionary->FindInsertionEntry(isolate, roots, hash);
6142 dictionary->SetEntry(entry, *k, *value, details);
6143 DCHECK(dictionary->KeyAt(isolate, entry).IsNumber() ||
6144 Shape::Unwrap(dictionary->KeyAt(isolate, entry)).IsUniqueName());
6146 if (entry_out) *entry_out = entry;
6293 InternalIndex entry = this->FindEntry(cage_base, roots, key, hash);
6294 if (entry.is_not_found()) return roots.the_hole_value();
6295 return this->get(Derived::EntryToIndex(entry) + 1);
6305 InternalIndex entry = this->FindEntry(cage_base, roots, key, key->hash());
6306 if (entry.is_not_found()) return -1;
6307 return Smi::cast(this->get(EntryToValueIndex(entry))).value();
6333 Object ObjectHashTableBase<Derived, Shape>::ValueAt(InternalIndex entry) {
6334 return this->get(EntryToValueIndex(entry));
6337 Object RegisteredSymbolTable::ValueAt(InternalIndex entry) {
6338 return this->get(EntryToValueIndex(entry));
6341 Object NameToIndexHashTable::ValueAt(InternalIndex entry) {
6342 return this->get(EntryToValueIndex(entry));
6345 int NameToIndexHashTable::IndexAt(InternalIndex entry) {
6346 Object value = ValueAt(entry);
6380 InternalIndex entry = table->FindEntry(isolate, roots, key, hash);
6383 if (entry.is_found()) {
6384 table->set(Derived::EntryToValueIndex(entry), *value);
6435 InternalIndex entry = table->FindEntry(isolate, roots, key, hash);
6436 if (entry.is_not_found()) {
6442 table->RemoveEntry(entry);
6447 void ObjectHashTableBase<Derived, Shape>::AddEntry(InternalIndex entry,
6450 self->set_key(Derived::EntryToIndex(entry), key);
6451 self->set(Derived::EntryToValueIndex(entry), value);
6456 void ObjectHashTableBase<Derived, Shape>::RemoveEntry(InternalIndex entry) {
6457 this->set_the_hole(Derived::EntryToIndex(entry));
6458 this->set_the_hole(Derived::EntryToValueIndex(entry));
6588 Isolate* isolate, Handle<GlobalDictionary> dictionary, InternalIndex entry,
6590 Handle<PropertyCell> cell(dictionary->CellAt(entry), isolate);
6598 dictionary->ValueAtPut(entry, *new_cell);
6648 Isolate* isolate, Handle<GlobalDictionary> dictionary, InternalIndex entry,
6651 PropertyCell raw_cell = dictionary->CellAt(entry);
6668 cell = PropertyCell::InvalidateAndReplaceEntry(isolate, dictionary, entry,
6965 InternalIndex entry = key_map.FindEntry(isolate, key);
6966 DCHECK(entry.is_found());
6971 key_map.ClearEntry(entry);
6979 key_map.ValueAtPut(entry, next);