Home
last modified time | relevance | path

Searched refs:KeyAt (Results 1 - 25 of 25) sorted by relevance

/third_party/node/deps/v8/src/objects/
H A Dhash-table-inl.h174 Object element = KeyAt(cage_base, entry); in FindEntry()
200 Object k = KeyAt(entry); in ToKey()
209 Object k = KeyAt(cage_base, entry); in ToKey()
216 Object HashTable<Derived, Shape>::KeyAt(InternalIndex entry) { in KeyAt() function in v8::internal::HashTable
218 return KeyAt(cage_base, entry); in KeyAt()
222 Object HashTable<Derived, Shape>::KeyAt(PtrComprCageBase cage_base, in KeyAt() function in v8::internal::HashTable
228 Object HashTable<Derived, Shape>::KeyAt(InternalIndex entry, in KeyAt() function in v8::internal::HashTable
231 return KeyAt(cage_base, entry, tag); in KeyAt()
235 Object HashTable<Derived, Shape>::KeyAt(PtrComprCageBase cage_base, in KeyAt() function in v8::internal::HashTable
H A Dordered-hash-table-inl.h62 Object SmallOrderedHashTable<Derived>::KeyAt(InternalIndex entry) const { in KeyAt() function in v8::internal::SmallOrderedHashTable
119 return Name::cast(KeyAt(entry)); in NameAt()
127 Object k = KeyAt(entry); in ToKey()
219 Object key = table.KeyAt(entry); in CurrentKey()
H A Dswiss-name-dictionary-inl.h183 Object candidate_key = KeyAt(candidate_entry); in FindEntry()
286 Object SwissNameDictionary::KeyAt(int entry) { in KeyAt() function in v8::internal::SwissNameDictionary
290 Object SwissNameDictionary::KeyAt(InternalIndex entry) { in KeyAt() function in v8::internal::SwissNameDictionary
291 return KeyAt(entry.as_int()); in KeyAt()
295 return Name::cast(KeyAt(entry)); in NameAt()
495 Object k = KeyAt(entry); in ToKey()
H A Dscope-info-inl.h73 return String::cast(table().KeyAt(cage_base, index_)); in name()
104 Object key = table().KeyAt(index_); in advance_hashtable_index()
H A Dordered-hash-table.cc159 Object candidate_key = KeyAt(InternalIndex(raw_entry)); in FindEntry()
175 Object candidate_key = table->KeyAt(InternalIndex(raw_entry)); in Add()
270 Object key = table->KeyAt(old_entry); in Rehash()
380 Object candidate_key = table->KeyAt(InternalIndex(raw_entry)); in Add()
432 Object candidate_key = KeyAt(entry); in FindEntry()
808 Object candidate_key = KeyAt(entry); in FindEntry()
933 Object key = table->KeyAt(old_entry); in Rehash()
1026 Object candidate_key = KeyAt(entry); in FindEntry()
1158 Handle<Object> key = handle(table->KeyAt(entry), isolate); in AdjustRepresentation()
1185 Handle<Object> key = handle(table->KeyAt(entr in AdjustRepresentation()
1384 Name OrderedNameDictionaryHandler::KeyAt(HeapObject table, KeyAt() function in v8::internal::OrderedNameDictionaryHandler
[all...]
H A Dswiss-name-dictionary.cc94 if (KeyAt(i) != other.KeyAt(i) || ValueAtRaw(i) != other.ValueAtRaw(i)) { in EqualsForTesting()
148 Object key = table->KeyAt(i); in ShallowCopy()
H A Dhash-table.h162 inline Object KeyAt(InternalIndex entry);
163 inline Object KeyAt(PtrComprCageBase cage_base, InternalIndex entry);
164 inline Object KeyAt(InternalIndex entry, RelaxedLoadTag tag);
165 inline Object KeyAt(PtrComprCageBase cage_base, InternalIndex entry,
H A Ddictionary-inl.h208 return Name::cast(KeyAt(cage_base, entry)); in NameAt()
222 DCHECK(KeyAt(cage_base, entry).IsPropertyCell(cage_base)); in CellAt()
223 return PropertyCell::cast(KeyAt(cage_base, entry)); in CellAt()
H A Dswiss-name-dictionary.h102 inline Object KeyAt(InternalIndex entry);
286 inline Object KeyAt(int entry);
H A Dordered-hash-table.h86 // Returns whether a potential key |k| returned by KeyAt is a real
121 Object KeyAt(InternalIndex entry) { in KeyAt() function in v8::internal::OrderedHashTable
126 // Similar to KeyAt, but indicates whether the given entry is valid
475 V8_INLINE Object KeyAt(InternalIndex entry) const;
807 // Like KeyAt, but casts to Name
870 static Name KeyAt(HeapObject table, InternalIndex entry);
H A Delements.cc1428 Object index = dict->KeyAt(isolate, entry);
1446 Object index = dict->KeyAt(isolate, entry);
1490 Object key = dict.KeyAt(cage_base, i); in HasAccessorsImpl()
1557 Object index = dict.KeyAt(isolate, entry); in HasEntryImpl()
1604 Object raw_key = dictionary->KeyAt(isolate, entry); in GetKeyForEntryImpl()
1623 Object raw_key = dictionary->KeyAt(isolate, i); in CollectElementIndicesImpl()
1670 Object k = dictionary->KeyAt(isolate, i); in AddElementsToKeyAccumulatorImpl()
1693 Object k = dictionary.KeyAt(isolate, i); in IncludesValueFastPath()
H A Dobjects.cc5811 Object current_key = KeyAt(cage_base, current); in Rehash()
5821 Object target_key = KeyAt(cage_base, target); in Rehash()
5841 if (KeyAt(cage_base, current) == the_hole) { in Rehash()
5939 if (!IsKey(roots, KeyAt(cage_base, entry))) return entry; in FindInsertionEntry()
5963 Object element = KeyAt(cage_base, entry, kRelaxedLoad); in TryFindPropertyCellForConcurrentLookupIterator()
6050 dictionary->KeyAt(isolate, internal_index))); in NextEnumerationIndex()
6143 DCHECK(dictionary->KeyAt(isolate, entry).IsNumber() || in Add()
6144 Shape::Unwrap(dictionary->KeyAt(isolate, entry)).IsUniqueName()); in Add()
H A Dvalue-serializer.cc853 Object key = raw_table.KeyAt(entry); in WriteJSMap()
885 Object key = raw_table.KeyAt(entry); in WriteJSSet()
H A Dscope-info.cc996 Object name = table.KeyAt(entry); in SavedClassVariable()
H A Djs-objects.cc3714 Object key = swiss_dictionary->KeyAt(index); in MigrateSlowToFast()
3722 DCHECK(dictionary->IsKey(roots, dictionary->KeyAt(isolate, index))); in MigrateSlowToFast()
3789 Object key_obj = swiss_dictionary->KeyAt(index); in MigrateSlowToFast()
5143 Object key = dictionary.KeyAt(i); in BestFittingFastElementsKind()
/third_party/node/deps/v8/src/runtime/
H A Druntime-classes.cc216 Object maybe_key = dictionary->KeyAt(i); in SubstituteValues()
263 Object maybe_key = properties_dictionary->KeyAt(i); in UpdateProtectors()
H A Druntime-literals.cc138 DCHECK(dict->KeyAt(i).IsName()); in StructureWalk()
150 DCHECK(dict->KeyAt(isolate, i).IsName()); in StructureWalk()
H A Druntime-object.cc1625 return table.KeyAt(index); in RUNTIME_FUNCTION()
/third_party/node/deps/v8/src/builtins/
H A Dbuiltins-array.cc886 Object key = dictionary.KeyAt(i); in EstimateElementCount()
963 Object k = dict.KeyAt(InternalIndex(j)); in CollectElementIndices()
1760 Handle<Name> key = Handle<Name>(Name::cast(groups->KeyAt(entry)), isolate); in BUILTIN()
1822 Handle<Object> key = Handle<Object>(groups->KeyAt(entry), isolate); in BUILTIN()
/third_party/node/deps/v8/src/heap/
H A Dmarking-visitor-inl.h350 HeapObject key = HeapObject::cast(table.KeyAt(i)); in VisitEphemeronHashTable()
H A Dmark-compact.cc2952 HeapObject key = HeapObject::cast(table.KeyAt(i)); in ClearWeakCollections()
/third_party/node/deps/v8/src/profiler/
H A Dheap-snapshot-generator.cc1778 if (!dictionary.IsKey(roots, dictionary.KeyAt(i))) continue; in ExtractPropertyReferences()
1793 Object k = dictionary.KeyAt(i); in ExtractPropertyReferences()
1804 Object k = dictionary.KeyAt(i); in ExtractPropertyReferences()
1845 Object k = dictionary.KeyAt(i); in ExtractElementReferences()
/third_party/node/deps/v8/src/diagnostics/
H A Dobjects-debug.cc1427 Object key = KeyAt(i); in SwissNameDictionaryVerify()
/third_party/node/deps/v8/src/api/
H A Dapi.cc7503 i::Object key = table->KeyAt(entry); in MapAsArray()
7607 i::Object key = table->KeyAt(entry); in SetAsArray()
/third_party/node/deps/v8/src/init/
H A Dbootstrapper.cc6205 Object raw_key = properties->KeyAt(key_index); in TransferNamedProperties()

Completed in 103 milliseconds