Home
last modified time | relevance | path

Searched refs:GetPredecessors (Results 1 – 13 of 13) sorted by relevance

/art/compiler/optimizing/
Dgraph_test.cc166 ASSERT_EQ(if_block->GetPredecessors().Size(), 2u); in TEST()
167 ASSERT_EQ(if_block->GetPredecessors().Get(0), entry_block); in TEST()
168 ASSERT_NE(if_block->GetPredecessors().Get(1), if_block); in TEST()
171 ASSERT_EQ(if_block->GetPredecessors().Get(1), in TEST()
201 ASSERT_EQ(if_block->GetPredecessors().Size(), 2u); in TEST()
202 ASSERT_EQ(if_block->GetPredecessors().Get(0), entry_block); in TEST()
203 ASSERT_NE(if_block->GetPredecessors().Get(1), if_block); in TEST()
206 ASSERT_EQ(if_block->GetPredecessors().Get(1), in TEST()
241 ASSERT_EQ(loop_block->GetPredecessors().Size(), 2u); in TEST()
279 ASSERT_EQ(loop_block->GetPredecessors().Size(), 2u); in TEST()
Dssa_builder.cc244 for (size_t pred = 0; pred < block->GetPredecessors().Size(); pred++) { in BuildSsa()
245 HInstruction* input = ValueOfLocal(block->GetPredecessors().Get(pred), phi->GetRegNumber()); in BuildSsa()
370 } else if (block->GetPredecessors().Size() > 0) { in VisitBasicBlock()
376 HInstruction* value = ValueOfLocal(block->GetPredecessors().Get(0), local); in VisitBasicBlock()
378 for (size_t i = 0, e = block->GetPredecessors().Size(); i < e; ++i) { in VisitBasicBlock()
379 HInstruction* current = ValueOfLocal(block->GetPredecessors().Get(i), local); in VisitBasicBlock()
396 GetGraph()->GetArena(), local, block->GetPredecessors().Size(), Primitive::kPrimVoid); in VisitBasicBlock()
397 for (size_t i = 0; i < block->GetPredecessors().Size(); i++) { in VisitBasicBlock()
398 HInstruction* pred_value = ValueOfLocal(block->GetPredecessors().Get(i), local); in VisitBasicBlock()
Dnodes.cc176 block->GetPredecessors().Size() - block->NumberOfBackEdges()) { in VisitBlockForDominatorTree()
216 size_t number_of_incomings = header->GetPredecessors().Size() - info->NumberOfBackEdges(); in SimplifyLoop()
222 for (size_t pred = 0; pred < header->GetPredecessors().Size(); ++pred) { in SimplifyLoop()
223 HBasicBlock* predecessor = header->GetPredecessors().Get(pred); in SimplifyLoop()
233 if (info->IsBackEdge(*header->GetPredecessors().Get(0))) { in SimplifyLoop()
234 HBasicBlock* to_swap = header->GetPredecessors().Get(0); in SimplifyLoop()
235 for (size_t pred = 1, e = header->GetPredecessors().Size(); pred < e; ++pred) { in SimplifyLoop()
236 HBasicBlock* predecessor = header->GetPredecessors().Get(pred); in SimplifyLoop()
268 if (successor->GetPredecessors().Size() > 1) { in SimplifyCFG()
364 for (size_t i = 0, e = block->GetPredecessors().Size(); i < e; ++i) { in PopulateRecursive()
[all …]
Dgraph_checker.cc32 const GrowableArray<HBasicBlock*>& predecessors = block->GetPredecessors(); in VisitBasicBlock()
67 const GrowableArray<HBasicBlock*>& s_predecessors = s->GetPredecessors(); in VisitBasicBlock()
289 if (successor->GetPredecessors().Size() > 1) { in VisitBasicBlock()
327 size_t num_preds = loop_header->GetPredecessors().Size(); in CheckLoop()
334 HBasicBlock* first_predecessor = loop_header->GetPredecessors().Get(0); in CheckLoop()
340 for (size_t i = 1, e = loop_header->GetPredecessors().Size(); i < e; ++i) { in CheckLoop()
341 HBasicBlock* predecessor = loop_header->GetPredecessors().Get(i); in CheckLoop()
457 phi->GetBlock()->GetPredecessors(); in VisitPhi()
Dssa_liveness_analysis.cc76 size_t number_of_forward_predecessors = block->GetPredecessors().Size(); in LinearizeGraph()
344 for (size_t i = 0; i < block->GetPredecessors().Size(); ++i) { in FindFirstRegisterHint()
345 size_t position = block->GetPredecessors().Get(i)->GetLifetimeEnd() - 1; in FindFirstRegisterHint()
376 const GrowableArray<HBasicBlock*>& predecessors = user->GetBlock()->GetPredecessors(); in FindFirstRegisterHint()
420 const GrowableArray<HBasicBlock*>& predecessors = defined_by_->GetBlock()->GetPredecessors(); in FindHintAtDefinition()
Dpretty_printer.h74 const GrowableArray<HBasicBlock*>& predecessors = block->GetPredecessors(); in VisitBasicBlock()
Ddead_code_elimination.cc106 if (successor->IsExitBlock() || successor->GetPredecessors().Size() != 1u) { in RemoveDeadBlocks()
Dgraph_visualizer.cc111 for (size_t i = 0, e = block->GetPredecessors().Size(); i < e; ++i) { in PrintPredecessors()
112 HBasicBlock* predecessor = block->GetPredecessors().Get(i); in PrintPredecessors()
Dboolean_simplifier.cc47 return succ1 == succ2 && succ1->GetPredecessors().Size() == 2u; in BlocksDoMergeTogether()
Dregister_allocator.cc1651 DCHECK_EQ(to->GetPredecessors().Size(), 1u); in ConnectSplitSiblings()
1750 for (size_t i = 0, e = block->GetPredecessors().Size(); i < e; ++i) { in Resolve()
1751 ConnectSplitSiblings(interval, block->GetPredecessors().Get(i), block); in Resolve()
1761 for (size_t i = 0, e = current->GetPredecessors().Size(); i < e; ++i) { in Resolve()
1762 HBasicBlock* predecessor = current->GetPredecessors().Get(i); in Resolve()
Dgvn.cc343 const GrowableArray<HBasicBlock*>& predecessors = block->GetPredecessors(); in VisitBasicBlock()
Dbounds_check_elimination.cc1259 DCHECK_EQ(true_successor->GetPredecessors().Size(), 1u); in HandleIf()
1263 DCHECK_EQ(false_successor->GetPredecessors().Size(), 1u); in HandleIf()
1471 *phi->GetBlock()->GetPredecessors().Get(1))); in HasSameInputAtBackEdges()
1474 *phi->GetBlock()->GetPredecessors().Get(i))); in HasSameInputAtBackEdges()
Dnodes.h503 const GrowableArray<HBasicBlock*>& GetPredecessors() const { in GetPredecessors() function
705 DCHECK(!GetPredecessors().IsEmpty()); in IsLoopPreHeaderFirstPredecessor()
706 return GetPredecessors().Get(0) == GetLoopInformation()->GetPreHeader(); in IsLoopPreHeaderFirstPredecessor()