Home
last modified time | relevance | path

Searched refs:loop_block (Results 1 – 3 of 3) sorted by relevance

/art/compiler/optimizing/
Dgraph_test.cc213 HBasicBlock* loop_block = CreateGotoBlock(graph); in TEST_F() local
218 first_if_block->AddSuccessor(loop_block); in TEST_F()
219 loop_block->AddSuccessor(loop_block); in TEST_F()
220 if_block->AddSuccessor(loop_block); in TEST_F()
224 ASSERT_EQ(if_block->GetLastInstruction()->AsIf()->IfTrueSuccessor(), loop_block); in TEST_F()
234 ASSERT_EQ(loop_block->GetPredecessors().size(), 2u); in TEST_F()
239 loop_block->GetLoopInformation()->GetPreHeader()); in TEST_F()
249 HBasicBlock* loop_block = CreateGotoBlock(graph); in TEST_F() local
254 first_if_block->AddSuccessor(loop_block); in TEST_F()
255 loop_block->AddSuccessor(loop_block); in TEST_F()
[all …]
Dgraph_checker.cc673 HBasicBlock* loop_block = GetGraph()->GetBlocks()[i]; in HandleLoop() local
674 if (loop_block == nullptr) { in HandleLoop()
678 } else if (!loop_information->IsIrreducible() && !loop_header->Dominates(loop_block)) { in HandleLoop()
Dinduction_var_analysis.cc266 HBasicBlock* loop_block = it_loop.Current(); in VisitLoop() local
267 DCHECK(loop_block->IsInLoop()); in VisitLoop()
268 if (loop_block->GetLoopInformation() != loop) { in VisitLoop()
272 for (HInstructionIterator it(loop_block->GetPhis()); !it.Done(); it.Advance()) { in VisitLoop()
278 for (HInstructionIterator it(loop_block->GetInstructions()); !it.Done(); it.Advance()) { in VisitLoop()