Home
last modified time | relevance | path

Searched refs:owned_by_edges (Results 1 – 4 of 4) sorted by relevance

/external/perfetto/src/trace_processor/importers/memory_tracker/
Dgraph_processor.cc214 for (auto* edge : *global_node->owned_by_edges()) { in ComputeSharedFootprintFromGraph()
394 for (auto* owned_by_edge : *node->owned_by_edges()) { in MarkWeakOwnersAndChildrenRecursively()
431 std::vector<Edge*>* owned_by_edges = child->owned_by_edges(); in RemoveWeakNodesRecursively() local
433 std::remove_if(owned_by_edges->begin(), owned_by_edges->end(), in RemoveWeakNodesRecursively()
435 owned_by_edges->erase(new_end, owned_by_edges->end()); in RemoveWeakNodesRecursively()
523 for (auto* edge : *node->owned_by_edges()) { in PropagateNumericsAndDiagnosticsRecursively()
582 for (auto* edge : *node->owned_by_edges()) { in CalculateSizeForNode()
652 if (child->owned_by_edges()->empty()) { in CalculateNodeSubSizes()
660 for (Edge* edge : *child->owned_by_edges()) { in CalculateNodeSubSizes()
677 if (node->owned_by_edges()->empty()) in CalculateNodeOwnershipCoefficient()
[all …]
Dgraph.cc220 for (auto it = node->owned_by_edges()->rbegin(); in next()
221 it != node->owned_by_edges()->rend(); it++) { in next()
274 for (auto it = node->owned_by_edges()->rbegin(); in next()
275 it != node->owned_by_edges()->rend(); it++) { in next()
Dgraph_processor_unittest.cc346 ASSERT_TRUE(owned->owned_by_edges()->empty()); in TEST_F()
368 ASSERT_FALSE(owned->owned_by_edges()->empty()); in TEST_F()
373 ASSERT_TRUE(owned->owned_by_edges()->empty()); in TEST_F()
/external/perfetto/include/perfetto/ext/trace_processor/importers/memory_tracker/
Dgraph.h181 std::vector<GlobalNodeGraph::Edge*>* owned_by_edges() { in owned_by_edges() function