221   DCHECK(entries_.empty());  // Root entry must be the first one.  in AddRootEntry()
262   entries_.emplace_back(this, type, name, id, size, trace_node_id);  in AddEntry()
263   return &entries_.back();  in AddEntry()
300     sorted_entries_.reserve(entries_.size());  in GetSortedEntriesList()
301     for (HeapEntry& entry : entries_) {  in GetSortedEntriesList()
330   entries_.emplace_back(0, kNullAddress, 0, true);  in HeapObjectsMap()
348       entries_.at(to_entry_info_index).addr = kNullAddress;  in MoveObject()
361       entries_.at(to_entry_info_index).addr = kNullAddress;  in MoveObject()
365     entries_.at(from_entry_info_index).addr = to;  in MoveObject()
372              entries_.at(from_entry_info_index).size, object_size);  in MoveObject()
374     entries_.at(from_entry_info_index).size = object_size;  in MoveObject()
391   EntryInfo& entry_info = entries_.at(entry_index);  in FindEntry()
392   DCHECK(static_cast<uint32_t>(entries_.size()) > entries_map_.occupancy());  in FindEntry()
400   DCHECK(static_cast<uint32_t>(entries_.size()) > entries_map_.occupancy());  in FindOrAddEntry()
406     EntryInfo& entry_info = entries_.at(entry_index);  in FindOrAddEntry()
415   entry->value = reinterpret_cast<void*>(entries_.size());  in FindOrAddEntry()
418   entries_.push_back(EntryInfo(id, addr, size, accessed));  in FindOrAddEntry()
419   DCHECK(static_cast<uint32_t>(entries_.size()) > entries_map_.occupancy());  in FindOrAddEntry()
455   DCHECK(!entries_.empty());  in PushHeapObjectsStats()
456   EntryInfo* entry_info = &entries_.front();  in PushHeapObjectsStats()
457   EntryInfo* end_entry_info = &entries_.back() + 1;  in PushHeapObjectsStats()
500   DCHECK(entries_.size() > 0 && entries_.at(0).id == 0 &&  in RemoveDeadEntries()
501          entries_.at(0).addr == kNullAddress);  in RemoveDeadEntries()
503   for (size_t i = 1; i < entries_.size(); ++i) {  in RemoveDeadEntries()
504     EntryInfo& entry_info = entries_.at(i);  in RemoveDeadEntries()
507         entries_.at(first_free_entry) = entry_info;  in RemoveDeadEntries()
509       entries_.at(first_free_entry).accessed = false;  in RemoveDeadEntries()
523   entries_.erase(entries_.begin() + first_free_entry, entries_.end());  in RemoveDeadEntries()
525   DCHECK(static_cast<uint32_t>(entries_.size()) - 1 ==  in RemoveDeadEntries()
543 HeapEntriesMap::HeapEntriesMap() : entries_() {}  in HeapEntriesMap()
546   base::HashMap::Entry* cache_entry = entries_.Lookup(thing, Hash(thing));  in Map()
554       entries_.LookupOrInsert(thing, Hash(thing));  in Pair()
559 HeapObjectsSet::HeapObjectsSet() : entries_() {}  in HeapObjectsSet()
562   entries_.Clear();  in Clear()
569   return entries_.Lookup(object, HeapEntriesMap::Hash(object)) != nullptr;  in Contains()
576   entries_.LookupOrInsert(object, HeapEntriesMap::Hash(object));  in Insert()
583       entries_.Lookup(object, HeapEntriesMap::Hash(object));  in GetTag()
594       entries_.LookupOrInsert(object, HeapEntriesMap::Hash(object));  in SetTag()
744         entries_(entries) { }  in SnapshotFiller()
747     entries_->Pair(ptr, entry->index());  in AddEntry()
751     int index = entries_->Map(ptr);  in FindEntry()
794   HeapEntriesMap* entries_;  member in v8::internal::SnapshotFiller
2528   SnapshotFiller filler(snapshot_, &entries_);  in FillReferences()