Home
last modified time | relevance | path

Searched refs:process_1 (Results 1 – 2 of 2) sorted by relevance

/external/perfetto/src/trace_processor/importers/memory_tracker/
Dgraph_unittest.cc62 Process* process_1 = graph.CreateGraphForProcess(1); in TEST() local
65 Node* c1 = process_1->CreateNode(kEmptyId, "c1", false); in TEST()
66 Node* c2 = process_1->CreateNode(kEmptyId, "c2", false); in TEST()
67 Node* c2_c1 = process_1->CreateNode(kEmptyId, "c2/c1", false); in TEST()
68 Node* c2_c2 = process_1->CreateNode(kEmptyId, "c2/c2", false); in TEST()
86 ASSERT_EQ(iterator.next(), process_1->root()); in TEST()
95 Process* process_1 = graph.CreateGraphForProcess(1); in TEST() local
98 Node* c1 = process_1->CreateNode(kEmptyId, "c1", false); in TEST()
99 Node* c2 = process_1->CreateNode(kEmptyId, "c2", false); in TEST()
100 Node* c2_c1 = process_1->CreateNode(kEmptyId, "c2/c1", false); in TEST()
[all …]
Dgraph_processor_unittest.cc532 Process* process_1 = graph.CreateGraphForProcess(1); in TEST_F() local
535 Node* parent_1 = process_1->CreateNode(kEmptyId, "parent", false); in TEST_F()
536 Node* child_1 = process_1->CreateNode(kEmptyId, "parent/child", false); in TEST_F()
543 process_1->root()->AddEntry("size", Node::Entry::ScalarUnits::kBytes, 4); in TEST_F()
567 CalculateNodeSubSizes(process_1->root()); in TEST_F()
568 ASSERT_EQ(process_1->root()->not_owned_sub_size(), 4ul); in TEST_F()
569 ASSERT_EQ(process_1->root()->not_owning_sub_size(), 0ul); in TEST_F()