Lines Matching full:start
88 EXPECT_NE(nullptr, schedule.start()); in TEST_F()
89 EXPECT_EQ(schedule.start(), in TEST_F()
93 EXPECT_NE(schedule.start(), schedule.end()); in TEST_F()
99 BasicBlock* start = schedule.start(); in TEST_F() local
103 schedule.AddNode(start, node0); in TEST_F()
104 EXPECT_EQ(start, schedule.block(node0)); in TEST_F()
105 EXPECT_THAT(*start, ElementsAre(node0)); in TEST_F()
109 schedule.AddNode(start, node1); in TEST_F()
110 EXPECT_EQ(start, schedule.block(node1)); in TEST_F()
111 EXPECT_THAT(*start, ElementsAre(node0, node1)); in TEST_F()
119 BasicBlock* start = schedule.start(); in TEST_F() local
123 schedule.AddGoto(start, block); in TEST_F()
125 EXPECT_EQ(0u, start->PredecessorCount()); in TEST_F()
126 EXPECT_EQ(1u, start->SuccessorCount()); in TEST_F()
127 EXPECT_EQ(block, start->SuccessorAt(0)); in TEST_F()
128 EXPECT_THAT(start->successors(), ElementsAre(block)); in TEST_F()
132 EXPECT_EQ(start, block->PredecessorAt(0)); in TEST_F()
133 EXPECT_THAT(block->predecessors(), ElementsAre(start)); in TEST_F()
142 BasicBlock* start = schedule.start(); in TEST_F() local
147 schedule.AddCall(start, call, sblock, eblock); in TEST_F()
149 EXPECT_EQ(start, schedule.block(call)); in TEST_F()
151 EXPECT_EQ(0u, start->PredecessorCount()); in TEST_F()
152 EXPECT_EQ(2u, start->SuccessorCount()); in TEST_F()
153 EXPECT_EQ(sblock, start->SuccessorAt(0)); in TEST_F()
154 EXPECT_EQ(eblock, start->SuccessorAt(1)); in TEST_F()
155 EXPECT_THAT(start->successors(), ElementsAre(sblock, eblock)); in TEST_F()
159 EXPECT_EQ(start, sblock->PredecessorAt(0)); in TEST_F()
160 EXPECT_THAT(sblock->predecessors(), ElementsAre(start)); in TEST_F()
164 EXPECT_EQ(start, eblock->PredecessorAt(0)); in TEST_F()
165 EXPECT_THAT(eblock->predecessors(), ElementsAre(start)); in TEST_F()
171 BasicBlock* start = schedule.start(); in TEST_F() local
176 schedule.AddBranch(start, branch, tblock, fblock); in TEST_F()
178 EXPECT_EQ(start, schedule.block(branch)); in TEST_F()
180 EXPECT_EQ(0u, start->PredecessorCount()); in TEST_F()
181 EXPECT_EQ(2u, start->SuccessorCount()); in TEST_F()
182 EXPECT_EQ(tblock, start->SuccessorAt(0)); in TEST_F()
183 EXPECT_EQ(fblock, start->SuccessorAt(1)); in TEST_F()
184 EXPECT_THAT(start->successors(), ElementsAre(tblock, fblock)); in TEST_F()
188 EXPECT_EQ(start, tblock->PredecessorAt(0)); in TEST_F()
189 EXPECT_THAT(tblock->predecessors(), ElementsAre(start)); in TEST_F()
193 EXPECT_EQ(start, fblock->PredecessorAt(0)); in TEST_F()
194 EXPECT_THAT(fblock->predecessors(), ElementsAre(start)); in TEST_F()
200 BasicBlock* start = schedule.start(); in TEST_F() local
204 schedule.AddReturn(start, node); in TEST_F()
206 EXPECT_EQ(0u, start->PredecessorCount()); in TEST_F()
207 EXPECT_EQ(1u, start->SuccessorCount()); in TEST_F()
208 EXPECT_EQ(end, start->SuccessorAt(0)); in TEST_F()
209 EXPECT_THAT(start->successors(), ElementsAre(end)); in TEST_F()
215 BasicBlock* start = schedule.start(); in TEST_F() local
224 schedule.AddReturn(start, node); in TEST_F()
227 schedule.InsertBranch(start, mblock, branch, tblock, fblock); in TEST_F()
229 EXPECT_EQ(0u, start->PredecessorCount()); in TEST_F()
230 EXPECT_EQ(2u, start->SuccessorCount()); in TEST_F()
231 EXPECT_EQ(tblock, start->SuccessorAt(0)); in TEST_F()
232 EXPECT_EQ(fblock, start->SuccessorAt(1)); in TEST_F()
233 EXPECT_THAT(start->successors(), ElementsAre(tblock, fblock)); in TEST_F()