Lines Matching refs:TestBlock
97 static void TestBlock(HGraph* graph, in TestBlock() function
137 TestBlock(graph, 0, false, kInvalidBlockId); // entry block in TEST_F()
138 TestBlock(graph, 1, false, kInvalidBlockId); // pre header in TEST_F()
140 TestBlock(graph, 2, true, 2, blocks2, 2); // loop header in TEST_F()
141 TestBlock(graph, 3, false, 2); // block in loop in TEST_F()
142 TestBlock(graph, 4, false, kInvalidBlockId); // return block in TEST_F()
143 TestBlock(graph, 5, false, kInvalidBlockId); // exit block in TEST_F()
163 TestBlock(graph, 0, false, kInvalidBlockId); // entry block in TEST_F()
164 TestBlock(graph, 1, false, kInvalidBlockId); // goto block in TEST_F()
166 TestBlock(graph, 2, true, 2, blocks2, 2); // loop header in TEST_F()
167 TestBlock(graph, 3, false, 2); // block in loop in TEST_F()
168 TestBlock(graph, 4, false, kInvalidBlockId); // pre header in TEST_F()
169 TestBlock(graph, 5, false, kInvalidBlockId); // return block in TEST_F()
170 TestBlock(graph, 6, false, kInvalidBlockId); // exit block in TEST_F()
186 TestBlock(graph, 0, false, kInvalidBlockId); // entry block in TEST_F()
187 TestBlock(graph, 1, false, kInvalidBlockId); // goto block in TEST_F()
188 TestBlock(graph, 2, false, kInvalidBlockId); in TEST_F()
190 TestBlock(graph, 3, true, 3, blocks2, 2); // loop header in TEST_F()
191 TestBlock(graph, 4, false, 3); // block in loop in TEST_F()
192 TestBlock(graph, 5, false, kInvalidBlockId); // pre header in TEST_F()
193 TestBlock(graph, 6, false, kInvalidBlockId); // return block in TEST_F()
194 TestBlock(graph, 7, false, kInvalidBlockId); // exit block in TEST_F()
195 TestBlock(graph, 8, false, kInvalidBlockId); // synthesized pre header in TEST_F()
210 TestBlock(graph, 0, false, kInvalidBlockId); // entry block in TEST_F()
211 TestBlock(graph, 1, false, kInvalidBlockId); // pre header in TEST_F()
213 TestBlock(graph, 2, true, 2, blocks2, arraysize(blocks2)); // loop header in TEST_F()
214 TestBlock(graph, 3, false, 2); // block in loop in TEST_F()
215 TestBlock(graph, 4, false, 2); // back edge in TEST_F()
216 TestBlock(graph, 5, false, 2); // back edge in TEST_F()
217 TestBlock(graph, 6, false, kInvalidBlockId); // return block in TEST_F()
218 TestBlock(graph, 7, false, kInvalidBlockId); // exit block in TEST_F()
234 TestBlock(graph, 0, false, kInvalidBlockId); // entry block in TEST_F()
235 TestBlock(graph, 1, false, kInvalidBlockId); // pre header in TEST_F()
237 TestBlock(graph, 2, true, 2, blocks2, 3); // loop header in TEST_F()
238 TestBlock(graph, 3, false, 2); // block in loop in TEST_F()
239 TestBlock(graph, 4, false, kInvalidBlockId); // loop exit in TEST_F()
240 TestBlock(graph, 5, false, 2); // back edge in TEST_F()
241 TestBlock(graph, 6, false, kInvalidBlockId); // return block in TEST_F()
242 TestBlock(graph, 7, false, kInvalidBlockId); // exit block in TEST_F()
243 TestBlock(graph, 8, false, kInvalidBlockId); // synthesized block at the loop exit in TEST_F()
257 TestBlock(graph, 0, false, kInvalidBlockId); // entry block in TEST_F()
258 TestBlock(graph, 1, false, kInvalidBlockId); // pre header of outer loop in TEST_F()
260 TestBlock(graph, 2, true, 2, blocks2, 5); // outer loop header in TEST_F()
262 TestBlock(graph, 3, true, 3, blocks3, 2); // inner loop header in TEST_F()
263 TestBlock(graph, 4, false, 3); // back edge on inner loop in TEST_F()
264 TestBlock(graph, 5, false, 2); // back edge on outer loop in TEST_F()
265 TestBlock(graph, 6, false, kInvalidBlockId); // return block in TEST_F()
266 TestBlock(graph, 7, false, kInvalidBlockId); // exit block in TEST_F()
267 TestBlock(graph, 8, false, 2); // synthesized block as pre header of inner loop in TEST_F()
286 TestBlock(graph, 0, false, kInvalidBlockId); // entry block in TEST_F()
287 TestBlock(graph, 1, false, kInvalidBlockId); // pre header of first loop in TEST_F()
289 TestBlock(graph, 2, true, 2, blocks2, 2); // first loop header in TEST_F()
290 TestBlock(graph, 3, false, 2); // back edge of first loop in TEST_F()
292 TestBlock(graph, 4, true, 4, blocks4, 2); // second loop header in TEST_F()
293 TestBlock(graph, 5, false, 4); // back edge of second loop in TEST_F()
294 TestBlock(graph, 6, false, kInvalidBlockId); // return block in TEST_F()
295 TestBlock(graph, 7, false, kInvalidBlockId); // exit block in TEST_F()
328 TestBlock(graph, 0, false, kInvalidBlockId); // entry block in TEST_F()
329 TestBlock(graph, 1, false, kInvalidBlockId); // pre header of first loop in TEST_F()
331 TestBlock(graph, 2, true, 2, blocks2, 3); // loop header in TEST_F()
332 TestBlock(graph, 3, false, 2); // back edge of first loop in TEST_F()
333 TestBlock(graph, 4, false, kInvalidBlockId); // return block in TEST_F()
334 TestBlock(graph, 5, false, kInvalidBlockId); // exit block in TEST_F()
335 TestBlock(graph, 6, false, 2); // synthesized block to avoid a critical edge in TEST_F()