Lines Matching refs:graph
23 GraphTrimmer trimmer(zone(), graph()); in TrimGraph()
27 GraphTrimmer trimmer(zone(), graph()); in TrimGraph()
44 Node* const start = graph()->NewNode(common()->Start(0)); in TEST_F()
45 Node* const end = graph()->NewNode(common()->End(1), start); in TEST_F()
46 graph()->SetStart(start); in TEST_F()
47 graph()->SetEnd(end); in TEST_F()
49 EXPECT_EQ(end, graph()->end()); in TEST_F()
50 EXPECT_EQ(start, graph()->start()); in TEST_F()
56 Node* const dead0 = graph()->NewNode(&kDead0, graph()->start()); in TEST_F()
57 graph()->SetEnd(graph()->NewNode(common()->End(1), graph()->start())); in TEST_F()
60 EXPECT_THAT(graph()->start()->uses(), ElementsAre(graph()->end())); in TEST_F()
65 Node* const dead0 = graph()->NewNode(&kDead0, graph()->start()); in TEST_F()
66 Node* const live0 = graph()->NewNode(&kLive0, graph()->start()); in TEST_F()
67 graph()->SetEnd(graph()->NewNode(common()->End(1), live0)); in TEST_F()
70 EXPECT_THAT(graph()->start()->uses(), ElementsAre(live0)); in TEST_F()
71 EXPECT_THAT(live0->uses(), ElementsAre(graph()->end())); in TEST_F()
76 Node* const live0 = graph()->NewNode(&kLive0, graph()->start()); in TEST_F()
77 Node* const live1 = graph()->NewNode(&kLive0, graph()->start()); in TEST_F()
78 graph()->SetEnd(graph()->NewNode(common()->End(1), live0)); in TEST_F()
80 EXPECT_THAT(graph()->start()->uses(), UnorderedElementsAre(live0, live1)); in TEST_F()