Lines Matching full:start
26 Store(graph()->start()); in ControlEquivalenceTest()
107 Node* start = graph()->start(); in TEST_F() local
108 ComputeEquivalence(start); in TEST_F()
110 ASSERT_EQUIVALENCE(start); in TEST_F()
115 Node* start = graph()->start(); in TEST_F() local
116 Node* merge1 = Merge1(start); in TEST_F()
119 ASSERT_EQUIVALENCE(start, merge1); in TEST_F()
124 Node* start = graph()->start(); in TEST_F() local
125 Node* b = Branch(start); in TEST_F()
131 ASSERT_EQUIVALENCE(b, m, start); in TEST_F()
138 Node* start = graph()->start(); in TEST_F() local
139 Node* b1 = Branch(start); in TEST_F()
149 ASSERT_EQUIVALENCE(b1, m1, start); in TEST_F()
158 Node* start = graph()->start(); in TEST_F() local
159 Node* b1 = Branch(start); in TEST_F()
169 ASSERT_EQUIVALENCE(b1, m1, b2, m2, start); in TEST_F()
178 Node* start = graph()->start(); in TEST_F() local
179 Node* b1 = Branch(start); in TEST_F()
193 ASSERT_EQUIVALENCE(b1, m3, start); in TEST_F()
206 Node* start = graph()->start(); in TEST_F() local
207 Node* l = Loop2(start); in TEST_F()
211 ASSERT_EQUIVALENCE(start); in TEST_F()
217 Node* start = graph()->start(); in TEST_F() local
218 Node* l = Loop2(start); in TEST_F()
225 ASSERT_EQUIVALENCE(f, start); in TEST_F()
232 Node* start = graph()->start(); in TEST_F() local
233 Node* b1 = Branch(start); in TEST_F()
248 ASSERT_EQUIVALENCE(b1, t3, start); in TEST_F()