228   DCHECK(entries_.is_empty());  // Root entry must be the first one.  in AddRootEntry()
268   entries_.Add(entry);  in AddEntry()
269   return &entries_.last();  in AddEntry()
322     sorted_entries_.Allocate(entries_.length());  in GetSortedEntriesList()
323     for (int i = 0; i < entries_.length(); ++i) {  in GetSortedEntriesList()
324       sorted_entries_[i] = &entries_[i];  in GetSortedEntriesList()
341       GetMemoryUsedByList(entries_) +  in RawSnapshotSize()
376   entries_.Add(EntryInfo(0, NULL, 0));  in HeapObjectsMap()
393       entries_.at(to_entry_info_index).addr = NULL;  in MoveObject()
406       entries_.at(to_entry_info_index).addr = NULL;  in MoveObject()
410     entries_.at(from_entry_info_index).addr = to;  in MoveObject()
418              entries_.at(from_entry_info_index).size,  in MoveObject()
421     entries_.at(from_entry_info_index).size = object_size;  in MoveObject()
437   EntryInfo& entry_info = entries_.at(entry_index);  in FindEntry()
438   DCHECK(static_cast<uint32_t>(entries_.length()) > entries_map_.occupancy());  in FindEntry()
446   DCHECK(static_cast<uint32_t>(entries_.length()) > entries_map_.occupancy());  in FindOrAddEntry()
452     EntryInfo& entry_info = entries_.at(entry_index);  in FindOrAddEntry()
463   entry->value = reinterpret_cast<void*>(entries_.length());  in FindOrAddEntry()
466   entries_.Add(EntryInfo(id, addr, size, accessed));  in FindOrAddEntry()
467   DCHECK(static_cast<uint32_t>(entries_.length()) > entries_map_.occupancy());  in FindOrAddEntry()
568       EntryInfo& entry_info = entries_.at(entry_index);  in FindUntrackedObjects()
621   DCHECK(!entries_.is_empty());  in PushHeapObjectsStats()
622   EntryInfo* entry_info = &entries_.first();  in PushHeapObjectsStats()
623   EntryInfo* end_entry_info = &entries_.last() + 1;  in PushHeapObjectsStats()
667   DCHECK(entries_.length() > 0 &&  in RemoveDeadEntries()
668          entries_.at(0).id == 0 &&  in RemoveDeadEntries()
669          entries_.at(0).addr == NULL);  in RemoveDeadEntries()
671   for (int i = 1; i < entries_.length(); ++i) {  in RemoveDeadEntries()
672     EntryInfo& entry_info = entries_.at(i);  in RemoveDeadEntries()
675         entries_.at(first_free_entry) = entry_info;  in RemoveDeadEntries()
677       entries_.at(first_free_entry).accessed = false;  in RemoveDeadEntries()
690   entries_.Rewind(first_free_entry);  in RemoveDeadEntries()
691   DCHECK(static_cast<uint32_t>(entries_.length()) - 1 ==  in RemoveDeadEntries()
714       GetMemoryUsedByList(entries_) +  in GetUsedMemorySize()
720     : entries_(HashMap::PointersMatch) {  in HeapEntriesMap()
725   HashMap::Entry* cache_entry = entries_.Lookup(thing, Hash(thing));  in Map()
732   HashMap::Entry* cache_entry = entries_.LookupOrInsert(thing, Hash(thing));  in Pair()
739     : entries_(HashMap::PointersMatch) {  in HeapObjectsSet()
744   entries_.Clear();  in Clear()
751   return entries_.Lookup(object, HeapEntriesMap::Hash(object)) != NULL;  in Contains()
758   entries_.LookupOrInsert(object, HeapEntriesMap::Hash(object));  in Insert()
765       entries_.Lookup(object, HeapEntriesMap::Hash(object));  in GetTag()
776       entries_.LookupOrInsert(object, HeapEntriesMap::Hash(object));  in SetTag()
903         entries_(entries) { }  in SnapshotFiller()
906     entries_->Pair(ptr, entry->index());  in AddEntry()
910     int index = entries_->Map(ptr);  in FindEntry()
952   HeapEntriesMap* entries_;  member in v8::internal::SnapshotFiller
2609   SnapshotFiller filler(snapshot_, &entries_);  in FillReferences()