Lines Matching refs:from
65 // All references should be from the current primary object.
70 // Check whether there is a direct strong reference from host to target.
76 // There is no direct reference from host to target, but sometimes heap
95 // All references should be from the current primary object.
117 // visitor which were omitted from the heap snapshot.
192 HeapGraphEdge::HeapGraphEdge(Type type, const char* name, HeapEntry* from,
195 FromIndexField::encode(from->index())),
205 HeapGraphEdge::HeapGraphEdge(Type type, int index, HeapEntry* from,
208 FromIndexField::encode(from->index())),
261 // read-only space, so ignoring these objects is safe from the perspective
471 edge.from()->add_child(&edge);
511 bool HeapObjectsMap::MoveObject(Address from, Address to, int object_size) {
513 DCHECK_NE(kNullAddress, from);
514 if (from == to) return false;
515 void* from_value = entries_map_.Remove(reinterpret_cast<void*>(from),
516 ComputeAddressHash(from));
548 PrintF("Move object from %p to %p old size %6d new size %6d\n",
549 reinterpret_cast<void*>(from), reinterpret_cast<void*>(to),
2377 Node* from;
2414 void AddEdge(Node* from, Node* to, const char* name) final {
2415 edges_.push_back({from, to, name});
2575 // |from| and |to| can be nullptr if the corresponding node is a V8 node
2577 HeapEntry* from = EntryForEmbedderGraphNode(edge.from);
2578 if (!from) continue;
2582 from->SetIndexedAutoIndexReference(HeapGraphEdge::kElement, to,
2586 from->SetNamedReference(HeapGraphEdge::kInternal,
2839 edges[i - 1]->from()->index() <= edges[i]->from()->index());