Lines Matching defs:entry
226 // Put a dummy entry in the remembered pages so we can find the list the
1286 // An entry in the storage does not imply that the count is > 0 because
1830 // CppHeap needs a stack marker at the top of all entry points to allow
2990 // String is still in new space. Update the table entry.
4760 InternalIndex entry = EphemeronHashTable::IndexToEntry(slot_index);
4761 CHECK(it->second.find(entry.as_int()) != it->second.end());
5144 // The entry table doesn't need to be updated since all builtins are embedded.
6789 StrongRootsEntry* entry = new StrongRootsEntry(label);
6790 entry->start = start;
6791 entry->end = end;
6792 entry->prev = nullptr;
6793 entry->next = strong_roots_head_;
6797 strong_roots_head_->prev = entry;
6799 strong_roots_head_ = entry;
6801 return entry;
6804 void Heap::UpdateStrongRoots(StrongRootsEntry* entry, FullObjectSlot start,
6806 entry->start = start;
6807 entry->end = end;
6810 void Heap::UnregisterStrongRoots(StrongRootsEntry* entry) {
6813 StrongRootsEntry* prev = entry->prev;
6814 StrongRootsEntry* next = entry->next;
6819 if (strong_roots_head_ == entry) {
6824 delete entry;
7293 InternalIndex entry = EphemeronHashTable::IndexToEntry(slot_index);
7296 it.first->second.insert(entry.as_int());
7477 // heap as a strong root array, saves that entry in StrongRootsEntry*, and