Lines Matching defs:roots
75 #include "src/roots/roots.h"
1973 ReadOnlyRoots roots = GetReadOnlyRoots();
1975 if (map() == roots.no_closures_cell_map()) {
1977 } else if (map() == roots.one_closure_cell_map()) {
1979 } else if (map() == roots.many_closures_cell_map()) {
5344 ReadOnlyRoots roots = GetReadOnlyRoots();
5346 if (*this == roots.name()) return #name;
5747 ReadOnlyRoots roots = GetReadOnlyRoots(cage_base);
5751 if (!IsKey(roots, k)) continue;
5752 uint32_t hash = Shape::HashForObject(roots, k);
5754 EntryToIndex(new_table.FindInsertionEntry(cage_base, roots, hash));
5765 InternalIndex HashTable<Derived, Shape>::EntryForProbe(ReadOnlyRoots roots,
5768 uint32_t hash = Shape::HashForObject(roots, k);
5802 ReadOnlyRoots roots = GetReadOnlyRoots(cage_base);
5812 if (!IsKey(roots, current_key)) {
5816 InternalIndex target = EntryForProbe(roots, current_key, probe, current);
5822 if (!IsKey(roots, target_key) ||
5823 EntryForProbe(roots, target_key, probe, target) != target) {
5837 Object the_hole = roots.the_hole_value();
5838 HeapObject undefined = roots.undefined_value();
5933 PtrComprCageBase cage_base, ReadOnlyRoots roots, uint32_t hash) {
5939 if (!IsKey(roots, KeyAt(cage_base, entry))) return entry;
5954 ReadOnlyRoots roots(isolate);
5955 const int32_t hash = ShapeT::Hash(roots, name);
5958 Object undefined = roots.undefined_value();
5959 Object the_hole = roots.the_hole_value();
6131 ReadOnlyRoots roots(isolate);
6132 uint32_t hash = Shape::Hash(roots, key);
6141 InternalIndex entry = dictionary->FindInsertionEntry(isolate, roots, hash);
6201 ReadOnlyRoots roots = GetReadOnlyRoots();
6207 if (this->ToKey(roots, i, &k)) {
6216 ReadOnlyRoots roots = this->GetReadOnlyRoots();
6220 if (!this->ToKey(roots, i, &k)) continue;
6234 ReadOnlyRoots roots(isolate);
6241 if (!raw_dictionary.ToKey(roots, i, &k)) continue;
6266 ReadOnlyRoots roots = dictionary.GetReadOnlyRoots();
6269 if (!dictionary.ToKey(roots, i, &k)) continue;
6273 return roots.undefined_value();
6290 ReadOnlyRoots roots = this->GetReadOnlyRoots(cage_base);
6291 DCHECK(this->IsKey(roots, *key));
6293 InternalIndex entry = this->FindEntry(cage_base, roots, key, hash);
6294 if (entry.is_not_found()) return roots.the_hole_value();
6303 ReadOnlyRoots roots = this->GetReadOnlyRoots(cage_base);
6305 InternalIndex entry = this->FindEntry(cage_base, roots, key, key->hash());
6315 ReadOnlyRoots roots = this->GetReadOnlyRoots(cage_base);
6316 DCHECK(this->IsKey(roots, *key));
6320 if (hash.IsUndefined(roots)) {
6321 return roots.the_hole_value();
6376 ReadOnlyRoots roots(isolate);
6377 DCHECK(table->IsKey(roots, *key));
6378 DCHECK(!value->IsTheHole(roots));
6380 InternalIndex entry = table->FindEntry(isolate, roots, key, hash);
6432 ReadOnlyRoots roots = table->GetReadOnlyRoots();
6433 DCHECK(table->IsKey(roots, *key));
6435 InternalIndex entry = table->FindEntry(isolate, roots, key, hash);
6557 ReadOnlyRoots roots = ReadOnlyRoots(isolate);
6562 if (table->ToKey(roots, InternalIndex(i), &key)) {
6575 void PropertyCell::ClearAndInvalidate(ReadOnlyRoots roots) {
6576 DCHECK(!value().IsTheHole(roots));
6579 Transition(details, roots.the_hole_value_handle());