Cross Reference: /external/v8/src/profiler/heap-snapshot-generator.cc

Lines Matching defs:entries_
232   DCHECK(entries_.is_empty());  // Root entry must be the first one.
272   entries_.Add(entry);
273   return &entries_.last();
326     sorted_entries_.Allocate(entries_.length());
327     for (int i = 0; i < entries_.length(); ++i) {
328       sorted_entries_[i] = &entries_[i];
343   return sizeof(*this) + GetMemoryUsedByList(entries_) +
370   entries_.Add(EntryInfo(0, NULL, 0));
387       entries_.at(to_entry_info_index).addr = NULL;
400       entries_.at(to_entry_info_index).addr = NULL;
404     entries_.at(from_entry_info_index).addr = to;
406     // about the object in entries_ consistent, we have to adjust size when the
411              entries_.at(from_entry_info_index).size, object_size);
413     entries_.at(from_entry_info_index).size = object_size;
430   EntryInfo& entry_info = entries_.at(entry_index);
431   DCHECK(static_cast<uint32_t>(entries_.length()) > entries_map_.occupancy());
439   DCHECK(static_cast<uint32_t>(entries_.length()) > entries_map_.occupancy());
445     EntryInfo& entry_info = entries_.at(entry_index);
454   entry->value = reinterpret_cast<void*>(entries_.length());
457   entries_.Add(EntryInfo(id, addr, size, accessed));
458   DCHECK(static_cast<uint32_t>(entries_.length()) > entries_map_.occupancy());
554       EntryInfo& entry_info = entries_.at(entry_index);
607   DCHECK(!entries_.is_empty());
608   EntryInfo* entry_info = &entries_.first();
609   EntryInfo* end_entry_info = &entries_.last() + 1;
653   DCHECK(entries_.length() > 0 &&
654          entries_.at(0).id == 0 &&
655          entries_.at(0).addr == NULL);
657   for (int i = 1; i < entries_.length(); ++i) {
658     EntryInfo& entry_info = entries_.at(i);
661         entries_.at(first_free_entry) = entry_info;
663       entries_.at(first_free_entry).accessed = false;
676   entries_.Rewind(first_free_entry);
677   DCHECK(static_cast<uint32_t>(entries_.length()) - 1 ==
699          GetMemoryUsedByList(entries_) + GetMemoryUsedByList(time_intervals_);
702 HeapEntriesMap::HeapEntriesMap() : entries_() {}
705   base::HashMap::Entry* cache_entry = entries_.Lookup(thing, Hash(thing));
713       entries_.LookupOrInsert(thing, Hash(thing));
718 HeapObjectsSet::HeapObjectsSet() : entries_() {}
721   entries_.Clear();
728   return entries_.Lookup(object, HeapEntriesMap::Hash(object)) != NULL;
735   entries_.LookupOrInsert(object, HeapEntriesMap::Hash(object));
742       entries_.Lookup(object, HeapEntriesMap::Hash(object));
753       entries_.LookupOrInsert(object, HeapEntriesMap::Hash(object));
878         entries_(entries) { }
881     entries_->Pair(ptr, entry->index());
885     int index = entries_->Map(ptr);
927   HeapEntriesMap* entries_;
2576   SnapshotFiller filler(snapshot_, &entries_);