Cross Reference: /art/compiler/optimizing/find_loops

Lines Matching defs:block
41   for (HBasicBlock* block : graph->GetBlocks()) {
42     ASSERT_EQ(block->GetLoopInformation(), nullptr);
54   for (HBasicBlock* block : graph->GetBlocks()) {
55     ASSERT_EQ(block->GetLoopInformation(), nullptr);
70   for (HBasicBlock* block : graph->GetBlocks()) {
71     ASSERT_EQ(block->GetLoopInformation(), nullptr);
87   for (HBasicBlock* block : graph->GetBlocks()) {
88     ASSERT_EQ(block->GetLoopInformation(), nullptr);
102   for (HBasicBlock* block : graph->GetBlocks()) {
103     ASSERT_EQ(block->GetLoopInformation(), nullptr);
113   HBasicBlock* block = graph->GetBlocks()[block_id];
114   ASSERT_EQ(block->IsLoopHeader(), is_loop_header);
116     ASSERT_EQ(block->GetLoopInformation(), nullptr);
118     ASSERT_EQ(block->GetLoopInformation()->GetHeader()->GetBlockId(), parent_loop_header_id);
122     HLoopInformation* info = block->GetLoopInformation();
129     ASSERT_FALSE(block->IsLoopHeader());
149   TestBlock(graph, 0, false, kInvalidBlockId);  // entry block
153   TestBlock(graph, 3, false, 2);                // block in loop
154   TestBlock(graph, 4, false, kInvalidBlockId);  // return block
155   TestBlock(graph, 5, false, kInvalidBlockId);  // exit block
177   TestBlock(graph, 0, false, kInvalidBlockId);  // entry block
178   TestBlock(graph, 1, false, kInvalidBlockId);  // goto block
181   TestBlock(graph, 3, false, 2);                // block in loop
183   TestBlock(graph, 5, false, kInvalidBlockId);  // return block
184   TestBlock(graph, 6, false, kInvalidBlockId);  // exit block
202   TestBlock(graph, 0, false, kInvalidBlockId);  // entry block
203   TestBlock(graph, 1, false, kInvalidBlockId);  // goto block
207   TestBlock(graph, 4, false, 3);                // block in loop
209   TestBlock(graph, 6, false, kInvalidBlockId);  // return block
210   TestBlock(graph, 7, false, kInvalidBlockId);  // exit block
228   TestBlock(graph, 0, false, kInvalidBlockId);  // entry block
232   TestBlock(graph, 3, false, 2);                // block in loop
235   TestBlock(graph, 6, false, kInvalidBlockId);  // return block
236   TestBlock(graph, 7, false, kInvalidBlockId);  // exit block
254   TestBlock(graph, 0, false, kInvalidBlockId);  // entry block
258   TestBlock(graph, 3, false, 2);                // block in loop
261   TestBlock(graph, 6, false, kInvalidBlockId);  // return block
262   TestBlock(graph, 7, false, kInvalidBlockId);  // exit block
263   TestBlock(graph, 8, false, kInvalidBlockId);  // synthesized block at the loop exit
279   TestBlock(graph, 0, false, kInvalidBlockId);  // entry block
287   TestBlock(graph, 6, false, kInvalidBlockId);  // return block
288   TestBlock(graph, 7, false, kInvalidBlockId);  // exit block
289   TestBlock(graph, 8, false, 2);                // synthesized block as pre header of inner loop
310   TestBlock(graph, 0, false, kInvalidBlockId);  // entry block
318   TestBlock(graph, 6, false, kInvalidBlockId);  // return block
319   TestBlock(graph, 7, false, kInvalidBlockId);  // exit block
356   TestBlock(graph, 0, false, kInvalidBlockId);  // entry block
361   TestBlock(graph, 4, false, kInvalidBlockId);  // return block
362   TestBlock(graph, 5, false, kInvalidBlockId);  // exit block
363   TestBlock(graph, 6, false, 2);                // synthesized block to avoid a critical edge