227   DCHECK(entries_.is_empty());  // Root entry must be the first one.  in AddRootEntry()
267   entries_.Add(entry);  in AddEntry()
268   return &entries_.last();  in AddEntry()
321     sorted_entries_.Allocate(entries_.length());  in GetSortedEntriesList()
322     for (int i = 0; i < entries_.length(); ++i) {  in GetSortedEntriesList()
323       sorted_entries_[i] = &entries_[i];  in GetSortedEntriesList()
340       GetMemoryUsedByList(entries_) +  in RawSnapshotSize()
375   entries_.Add(EntryInfo(0, NULL, 0));  in HeapObjectsMap()
392       entries_.at(to_entry_info_index).addr = NULL;  in MoveObject()
405       entries_.at(to_entry_info_index).addr = NULL;  in MoveObject()
409     entries_.at(from_entry_info_index).addr = to;  in MoveObject()
416              entries_.at(from_entry_info_index).size, object_size);  in MoveObject()
418     entries_.at(from_entry_info_index).size = object_size;  in MoveObject()
435   EntryInfo& entry_info = entries_.at(entry_index);  in FindEntry()
436   DCHECK(static_cast<uint32_t>(entries_.length()) > entries_map_.occupancy());  in FindEntry()
444   DCHECK(static_cast<uint32_t>(entries_.length()) > entries_map_.occupancy());  in FindOrAddEntry()
450     EntryInfo& entry_info = entries_.at(entry_index);  in FindOrAddEntry()
459   entry->value = reinterpret_cast<void*>(entries_.length());  in FindOrAddEntry()
462   entries_.Add(EntryInfo(id, addr, size, accessed));  in FindOrAddEntry()
463   DCHECK(static_cast<uint32_t>(entries_.length()) > entries_map_.occupancy());  in FindOrAddEntry()
559       EntryInfo& entry_info = entries_.at(entry_index);  in FindUntrackedObjects()
612   DCHECK(!entries_.is_empty());  in PushHeapObjectsStats()
613   EntryInfo* entry_info = &entries_.first();  in PushHeapObjectsStats()
614   EntryInfo* end_entry_info = &entries_.last() + 1;  in PushHeapObjectsStats()
658   DCHECK(entries_.length() > 0 &&  in RemoveDeadEntries()
659          entries_.at(0).id == 0 &&  in RemoveDeadEntries()
660          entries_.at(0).addr == NULL);  in RemoveDeadEntries()
662   for (int i = 1; i < entries_.length(); ++i) {  in RemoveDeadEntries()
663     EntryInfo& entry_info = entries_.at(i);  in RemoveDeadEntries()
666         entries_.at(first_free_entry) = entry_info;  in RemoveDeadEntries()
668       entries_.at(first_free_entry).accessed = false;  in RemoveDeadEntries()
681   entries_.Rewind(first_free_entry);  in RemoveDeadEntries()
682   DCHECK(static_cast<uint32_t>(entries_.length()) - 1 ==  in RemoveDeadEntries()
704          GetMemoryUsedByList(entries_) + GetMemoryUsedByList(time_intervals_);  in GetUsedMemorySize()
707 HeapEntriesMap::HeapEntriesMap() : entries_(base::HashMap::PointersMatch) {}  in HeapEntriesMap()
710   base::HashMap::Entry* cache_entry = entries_.Lookup(thing, Hash(thing));  in Map()
718       entries_.LookupOrInsert(thing, Hash(thing));  in Pair()
723 HeapObjectsSet::HeapObjectsSet() : entries_(base::HashMap::PointersMatch) {}  in HeapObjectsSet()
726   entries_.Clear();  in Clear()
733   return entries_.Lookup(object, HeapEntriesMap::Hash(object)) != NULL;  in Contains()
740   entries_.LookupOrInsert(object, HeapEntriesMap::Hash(object));  in Insert()
747       entries_.Lookup(object, HeapEntriesMap::Hash(object));  in GetTag()
758       entries_.LookupOrInsert(object, HeapEntriesMap::Hash(object));  in SetTag()
885         entries_(entries) { }  in SnapshotFiller()
888     entries_->Pair(ptr, entry->index());  in AddEntry()
892     int index = entries_->Map(ptr);  in FindEntry()
934   HeapEntriesMap* entries_;  member in v8::internal::SnapshotFiller
2553   SnapshotFiller filler(snapshot_, &entries_);  in FillReferences()