Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dgraph_test.cc220 HBasicBlock* loop_block = createGotoBlock(graph, &allocator); in TEST() local
225 first_if_block->AddSuccessor(loop_block); in TEST()
226 loop_block->AddSuccessor(loop_block); in TEST()
227 if_block->AddSuccessor(loop_block); in TEST()
231 ASSERT_EQ(if_block->GetLastInstruction()->AsIf()->IfTrueSuccessor(), loop_block); in TEST()
241 ASSERT_EQ(loop_block->GetPredecessors().size(), 2u); in TEST()
246 loop_block->GetLoopInformation()->GetPreHeader()); in TEST()
259 HBasicBlock* loop_block = createGotoBlock(graph, &allocator); in TEST() local
264 first_if_block->AddSuccessor(loop_block); in TEST()
265 loop_block->AddSuccessor(loop_block); in TEST()
[all …]
Dinduction_var_analysis.cc121 HBasicBlock* loop_block = it_loop.Current(); in VisitLoop() local
122 DCHECK(loop_block->IsInLoop()); in VisitLoop()
123 if (loop_block->GetLoopInformation() != loop) { in VisitLoop()
127 for (HInstructionIterator it(loop_block->GetPhis()); !it.Done(); it.Advance()) { in VisitLoop()
133 for (HInstructionIterator it(loop_block->GetInstructions()); !it.Done(); it.Advance()) { in VisitLoop()
Dgraph_checker.cc655 HBasicBlock* loop_block = GetGraph()->GetBlocks()[i]; in HandleLoop() local
656 if (loop_block == nullptr) { in HandleLoop()
660 } else if (!loop_information->IsIrreducible() && !loop_header->Dominates(loop_block)) { in HandleLoop()