Searched refs:KeyAt (Results 1 – 19 of 19) sorted by relevance
99 Object* candidate_key = table->KeyAt(entry); in Add()172 Object* key = table->KeyAt(old_entry); in Rehash()244 Object* candidate_key = table->KeyAt(entry); in Add()479 Object* key = table->KeyAt(old_entry); in Rehash()615 Handle<Object> key = handle(table->KeyAt(entry), isolate); in AdjustRepresentation()636 Handle<Object> key = handle(table->KeyAt(entry), isolate); in AdjustRepresentation()727 while (index < used_capacity && table->KeyAt(index)->IsTheHole(ro_roots)) { in HasMore()
86 Object* element = KeyAt(entry); in FindEntry()106 Object* k = KeyAt(entry); in ToKey()
161 Object* candidate_key = KeyAt(entry); in FindEntry()175 Object* KeyAt(int entry) { in KeyAt() function454 Object* KeyAt(int entry) const { in KeyAt() function490 Object* candidate_key = KeyAt(entry); in FindEntry()
160 Object* KeyAt(int entry) { return get(EntryToIndex(entry) + kEntryKeyIndex); } in KeyAt() function
1447 Object* index = dict->KeyAt(entry); in SetLengthImpl()1465 Object* index = dict->KeyAt(entry); in SetLengthImpl()1509 Object* key = source_dict->KeyAt(i); in SliceImpl()1541 Object* key = dict->KeyAt(i); in HasAccessorsImpl()1604 Object* index = dict->KeyAt(entry); in HasEntryImpl()1612 CHECK(dict->KeyAt(entry)->ToArrayIndex(&result)); in GetIndexForEntryImpl()1654 Object* raw_key = dictionary->KeyAt(entry); in GetKeyForEntryImpl()1673 Object* raw_key = dictionary->KeyAt(i); in CollectElementIndicesImpl()1720 Object* k = dictionary->KeyAt(i); in AddElementsToKeyAccumulatorImpl()1743 Object* k = dictionary->KeyAt(i); in IncludesValueFastPath()
2943 Name* NameDictionary::NameAt(int entry) { return Name::cast(KeyAt(entry)); } in NameAt()2950 DCHECK(KeyAt(entry)->IsPropertyCell()); in CellAt()2951 return PropertyCell::cast(KeyAt(entry)); in CellAt()3135 Object* key = table->KeyAt(index); in CurrentKey()
892 Object* element = string_table->KeyAt(entry); in ScanJsonString()
761 Object* key = table->KeyAt(i); in WriteJSMap()792 Object* key = table->KeyAt(i); in WriteJSSet()
6466 DCHECK(dictionary->IsKey(roots, dictionary->KeyAt(index))); in MigrateSlowToFast()15702 Object* key = dictionary->KeyAt(i); in BestFittingFastElementsKind()16074 Object* k = dictionary->KeyAt(i); in Print()16842 Object* current_key = KeyAt(current); in Rehash()16846 Object* target_key = KeyAt(target); in Rehash()16864 if (KeyAt(current) == the_hole) { in Rehash()16947 if (!Shape::IsLive(roots, KeyAt(entry))) break; in FindInsertionEntry()17063 Handle<String> result(String::cast(string_table->KeyAt(entry)), isolate); in LookupTwoCharsStringIfExists()17178 return handle(String::cast(table->KeyAt(entry)), isolate); in LookupKey()17383 String* internalized = String::cast(table->KeyAt(entry)); in LookupStringIfExists_NoAllocate()[all …]
890 << std::setw(12) << i << ": " << Brief(table->KeyAt(i)) << " -> " in PrintHashTableWithHeader()
5591 Object* raw_key = properties->KeyAt(key_index); in TransferNamedProperties()
7137 i::Object* key = table->KeyAt(i); in MapAsArray()7244 i::Object* key = table->KeyAt(i); in SetAsArray()
826 Object* key = dictionary->KeyAt(i); in EstimateElementCount()894 Object* k = dict->KeyAt(j); in CollectElementIndices()
98 HeapObject* key = HeapObject::cast(table->KeyAt(i)); in VisitEphemeronHashTable()
346 HeapObject* key = HeapObject::cast(table->KeyAt(i)); in VisitEphemeronHashTable()
2072 HeapObject* key = HeapObject::cast(table->KeyAt(i)); in ClearWeakCollections()
140 DCHECK(dict->KeyAt(i)->IsName()); in StructureWalk()
233 Object* maybe_key = dictionary->KeyAt(i); in SubstituteValues()
1467 if (dictionary->IsKey(roots, dictionary->KeyAt(i))) { in ExtractPropertyReferences()1481 Object* k = dictionary->KeyAt(i); in ExtractPropertyReferences()1527 Object* k = dictionary->KeyAt(i); in ExtractElementReferences()