Home
last modified time | relevance | path

Searched refs:owns_edge (Results 1 – 3 of 3) sorted by relevance

/external/perfetto/src/trace_processor/importers/memory_tracker/
Dgraph_processor.cc378 if (node->owns_edge() && visited->count(node->owns_edge()->target()) == 0) in MarkWeakOwnersAndChildrenRecursively()
387 if ((node->owns_edge() && node->owns_edge()->target()->is_weak()) || in MarkWeakOwnersAndChildrenRecursively()
424 PERFETTO_DCHECK(!child->owns_edge() || in RemoveWeakNodesRecursively()
425 !child->owns_edge()->target()->is_weak()); in RemoveWeakNodesRecursively()
454 PERFETTO_DCHECK(!tracing_node->owns_edge()); in AssignTracingOverhead()
536 Edge* owns_edge = descendant->owns_edge(); in AggregateSizeForDescendantNode() local
537 if (owns_edge && owns_edge->target()->IsDescendentOf(*root)) in AggregateSizeForDescendantNode()
642 if (path_to_child.second->owns_edge()) in CalculateNodeSubSizes()
758 if (node->owns_edge()) { in CalculateNodeCumulativeOwnershipCoefficient()
761 node->owns_edge()->target()->cumulative_owning_coefficient()); in CalculateNodeCumulativeOwnershipCoefficient()
Dgraph.cc163 void Node::SetOwnsEdge(Edge* owns_edge) { in SetOwnsEdge() argument
164 owns_edge_ = owns_edge; in SetOwnsEdge()
206 if (node->owns_edge() && visited_.count(node->owns_edge()->target()) == 0) in next()
/external/perfetto/include/perfetto/ext/trace_processor/importers/memory_tracker/
Dgraph.h176 GlobalNodeGraph::Edge* owns_edge() const { return owns_edge_; } in owns_edge() function