Lines Matching refs:HeapGraphEdge
192 HeapGraphEdge::HeapGraphEdge(Type type, const char* name, HeapEntry* from,
205 HeapGraphEdge::HeapGraphEdge(Type type, int index, HeapEntry* from,
228 void HeapEntry::VerifyReference(HeapGraphEdge::Type type, HeapEntry* entry,
242 CHECK_EQ(type, HeapGraphEdge::kWeak);
269 } else if (type == HeapGraphEdge::kWeak) {
277 void HeapEntry::SetNamedReference(HeapGraphEdge::Type type, const char* name,
286 void HeapEntry::SetIndexedReference(HeapGraphEdge::Type type, int index,
295 void HeapEntry::SetNamedAutoIndexReference(HeapGraphEdge::Type type,
329 HeapGraphEdge& edge = **i;
334 case HeapGraphEdge::kContextVariable:
338 case HeapGraphEdge::kElement:
341 case HeapGraphEdge::kInternal:
345 case HeapGraphEdge::kProperty:
348 case HeapGraphEdge::kHidden:
352 case HeapGraphEdge::kShortcut:
356 case HeapGraphEdge::kWeak:
395 STATIC_ASSERT(kSystemPointerSize != 4 || sizeof(HeapGraphEdge) == 12);
396 STATIC_ASSERT(kSystemPointerSize != 8 || sizeof(HeapGraphEdge) == 24);
470 for (HeapGraphEdge& edge : edges()) {
1274 key_entry->SetNamedAutoIndexReference(HeapGraphEdge::kInternal, edge_name,
1278 HeapGraphEdge::kInternal, edge_name, value_entry, names_, generator_,
1614 entry->SetNamedReference(HeapGraphEdge::kInternal, "backing_store",
1667 entry->SetNamedReference(HeapGraphEdge::kInternal, "value", child_entry,
2075 parent_entry->SetNamedReference(HeapGraphEdge::kContextVariable,
2093 parent_entry->SetNamedReference(HeapGraphEdge::kShortcut, reference_name,
2101 parent_entry->SetIndexedReference(HeapGraphEdge::kElement, index, child_entry,
2113 parent_entry->SetNamedReference(HeapGraphEdge::kInternal, reference_name,
2125 parent_entry->SetNamedReference(HeapGraphEdge::kInternal,
2142 parent_entry->SetIndexedReference(HeapGraphEdge::kHidden, index,
2155 parent_entry->SetNamedReference(HeapGraphEdge::kWeak, reference_name,
2168 parent_entry->SetNamedReference(HeapGraphEdge::kWeak,
2194 HeapGraphEdge::Type type =
2196 ? HeapGraphEdge::kProperty
2197 : HeapGraphEdge::kInternal;
2213 HeapGraphEdge::kElement, snapshot_->gc_roots(), generator_);
2220 HeapGraphEdge::kShortcut, nullptr, child_entry, names_, generator_);
2225 HeapGraphEdge::kElement, snapshot_->gc_subroot(root), generator_);
2240 HeapGraphEdge::Type edge_type =
2241 is_weak ? HeapGraphEdge::kWeak : HeapGraphEdge::kInternal;
2565 HeapGraphEdge::kElement, entry, generator_,
2582 from->SetIndexedAutoIndexReference(HeapGraphEdge::kElement, to,
2586 from->SetNamedReference(HeapGraphEdge::kInternal,
2812 void HeapSnapshotJSONSerializer::SerializeEdge(HeapGraphEdge* edge,
2818 int edge_name_or_index = edge->type() == HeapGraphEdge::kElement
2819 || edge->type() == HeapGraphEdge::kHidden
2836 std::vector<HeapGraphEdge*>& edges = snapshot_->children();