| /art/compiler/optimizing/ |
| D | graph_test.cc | 165 ASSERT_EQ(if_block->GetPredecessors().size(), 2u); in TEST_F()
166 ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor()); in TEST_F()
167 ASSERT_NE(if_block->GetPredecessors()[1], if_block); in TEST_F()
170 ASSERT_EQ(if_block->GetPredecessors()[1], in TEST_F()
197 ASSERT_EQ(if_block->GetPredecessors().size(), 2u); in TEST_F()
198 ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor()); in TEST_F()
199 ASSERT_NE(if_block->GetPredecessors()[1], if_block); in TEST_F()
202 ASSERT_EQ(if_block->GetPredecessors()[1], in TEST_F()
234 ASSERT_EQ(loop_block->GetPredecessors().size(), 2u); in TEST_F()
269 ASSERT_EQ(loop_block->GetPredecessors().size(), 2u); in TEST_F()
|
| D | loop_optimization_test.cc | 232 EXPECT_EQ(header->GetPredecessors()[0]->GetSinglePredecessor(), entry_block_); in TEST_F()
238 EXPECT_TRUE(input->GetBlock()->Dominates(header->GetPredecessors()[i])); in TEST_F()
290 DCHECK(header->GetPredecessors()[0] == body); in TEST_F()
291 DCHECK(header->GetPredecessors()[1] == preheader0); in TEST_F()
292 DCHECK(header->GetPredecessors()[2] == preheader1); in TEST_F()
302 EXPECT_EQ(header->GetPredecessors().size(), 2u); in TEST_F()
303 EXPECT_EQ(header->GetPredecessors()[1], body); in TEST_F()
|
| D | graph_checker.cc | 56 return block->GetPredecessors().size() == 1u && in IsExitTryBoundaryIntoExitBlock()
95 sorted_predecessors.assign(block->GetPredecessors().begin(), block->GetPredecessors().end()); in VisitBasicBlock()
127 std::count(s->GetPredecessors().begin(), s->GetPredecessors().end(), block); in VisitBasicBlock()
149 for (HBasicBlock* predecessor : block->GetPredecessors()) { in VisitBasicBlock()
230 if (successor->GetPredecessors().size() > 1) { in VisitBasicBlock()
255 for (HBasicBlock* predecessor : block->GetPredecessors()) { in VisitBasicBlock()
685 size_t num_preds = loop_header->GetPredecessors().size(); in HandleLoop()
692 HBasicBlock* first_predecessor = loop_header->GetPredecessors()[0]; in HandleLoop()
698 for (size_t i = 1, e = loop_header->GetPredecessors().size(); i < e; ++i) { in HandleLoop()
699 HBasicBlock* predecessor = loop_header->GetPredecessors()[i]; in HandleLoop()
[all …]
|
| D | dead_code_elimination.cc | 250 block->GetPredecessors().size() == 1u) { in SimplifyAlwaysThrows()
260 succ->GetPredecessors().size() > 1u && in SimplifyAlwaysThrows()
368 HBasicBlock* predecessor_to_update = block->GetPredecessors()[i]; in SimplifyIfs()
390 if (block->GetPredecessors().size() == 1) { in SimplifyIfs()
434 if (successor->IsExitBlock() || successor->GetPredecessors().size() != 1u) { in ConnectSuccessiveBlocks()
|
| D | nodes.cc | 298 successor->GetPredecessors().size() - successor->NumberOfBackEdges()) { in ComputeDominanceInformation()
389 if (info->IsBackEdge(*header->GetPredecessors()[0])) { in OrderLoopHeaderPredecessors()
390 HBasicBlock* to_swap = header->GetPredecessors()[0]; in OrderLoopHeaderPredecessors()
391 for (size_t pred = 1, e = header->GetPredecessors().size(); pred < e; ++pred) { in OrderLoopHeaderPredecessors()
392 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in OrderLoopHeaderPredecessors()
408 for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) { in FixControlForNewSinglePreheader()
409 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in FixControlForNewSinglePreheader()
463 for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) { in TransformLoopToSinglePreheaderFormat()
464 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in TransformLoopToSinglePreheaderFormat()
495 HBasicBlock* pred_block = header->GetPredecessors()[input_pos]; in TransformLoopToSinglePreheaderFormat()
[all …]
|
| D | select_generator.cc | 38 if (block->GetPredecessors().size() != 1u) { in IsSimpleBlock()
182 bool only_two_predecessors = (merge_block->GetPredecessors().size() == 2u); in Run()
|
| D | ssa_liveness_analysis.cc | 361 for (HBasicBlock* predecessor : block->GetPredecessors()) { in FindFirstRegisterHint()
399 if (end == user->GetBlock()->GetPredecessors()[input_index]->GetLifetimeEnd()) { in FindFirstRegisterHint()
406 user->GetBlock()->GetPredecessors()[i]->GetLifetimeEnd() - 1); in FindFirstRegisterHint()
439 const ArenaVector<HBasicBlock*>& predecessors = defined_by_->GetBlock()->GetPredecessors(); in FindHintAtDefinition()
|
| D | block_builder.cc | 252 for (HBasicBlock* predecessor : catch_block->GetPredecessors()) { in MightHaveLiveNormalPredecessors()
263 } else if (catch_block->GetPredecessors().empty()) { in MightHaveLiveNormalPredecessors()
361 for (HBasicBlock* predecessor : try_block->GetPredecessors()) { in InsertTryBoundaryBlocks()
|
| D | pretty_printer.h | 76 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); in VisitBasicBlock()
|
| D | linear_order.cc | 101 size_t number_of_forward_predecessors = block->GetPredecessors().size(); in LinearizeGraphInternal()
|
| D | code_sinking.cc | 36 for (HBasicBlock* exit_predecessor : exit->GetPredecessors()) { in Run()
193 : block->GetPredecessors()[use.GetIndex()]; in FindIdealPosition()
|
| D | register_allocation_resolver.cc | 174 for (HBasicBlock* predecessor : block->GetPredecessors()) { in Resolve()
188 for (size_t i = 0, e = block->GetPredecessors().size(); i < e; ++i) { in Resolve()
189 HBasicBlock* predecessor = block->GetPredecessors()[i]; in Resolve()
491 DCHECK_EQ(to->GetPredecessors().size(), 1u); in ConnectSplitSiblings()
|
| D | superblock_cloner.cc | 196 DCHECK(!first_phi_met || copy_succ->GetPredecessors().size() == phi_input_count); in RemapOrigInternalOrIncomingEdge()
402 HBasicBlock* corresponding_block = phi_block->GetPredecessors()[i]; in ResolvePhi()
582 DCHECK_EQ(exit_block->GetPredecessors().size(), 1u); in ConstructSubgraphClosedSSA()
651 for (HBasicBlock* pred : bb->GetPredecessors()) { in DumpBB()
1056 for (HBasicBlock* pred : block->GetPredecessors()) { in IsSubgraphConnected()
|
| D | instruction_builder.cc | 172 } else if (current_block_->GetPredecessors().size() > 0) { in InitializeBlockLocals()
178 HInstruction* value = ValueOfLocalAt(current_block_->GetPredecessors()[0], local); in InitializeBlockLocals()
180 for (HBasicBlock* predecessor : current_block_->GetPredecessors()) { in InitializeBlockLocals()
197 HInstruction* first_input = ValueOfLocalAt(current_block_->GetPredecessors()[0], local); in InitializeBlockLocals()
201 current_block_->GetPredecessors().size(), in InitializeBlockLocals()
203 for (size_t i = 0; i < current_block_->GetPredecessors().size(); i++) { in InitializeBlockLocals()
204 HInstruction* pred_value = ValueOfLocalAt(current_block_->GetPredecessors()[i], local); in InitializeBlockLocals()
288 for (HBasicBlock* predecessor : block->GetPredecessors()) { in SetLoopHeaderPhiInputs()
|
| D | loop_optimization.cc | 64 if (block->GetPredecessors().size() == 1 && in IsGotoBlock()
409 DCHECK_EQ(true_succ->GetPredecessors().size(), 1u); in TryToEvaluateIfCondition()
410 DCHECK_EQ(false_succ->GetPredecessors().size(), 1u); in TryToEvaluateIfCondition()
678 if (block->GetPredecessors().size() == 1 && in SimplifyBlocks()
680 block->GetSingleSuccessor()->GetPredecessors().size() == 1) { in SimplifyBlocks()
734 if (exit->GetPredecessors().size() != 1) { in TryOptimizeInnerLoopFinite()
|
| D | bounds_check_elimination.cc | 697 DCHECK_EQ(true_successor->GetPredecessors().size(), 1u); in HandleIf()
701 DCHECK_EQ(false_successor->GetPredecessors().size(), 1u); in HandleIf()
939 *phi->GetBlock()->GetPredecessors()[1])); in HasSameInputAtBackEdges()
942 *phi->GetBlock()->GetPredecessors()[i])); in HasSameInputAtBackEdges()
|
| D | gvn.cc | 412 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); in VisitBasicBlock()
|
| D | load_store_elimination.cc | 385 ArrayRef<HBasicBlock* const> predecessors(block->GetPredecessors()); in MergePredecessorValues()
|
| D | graph_visualizer.cc | 252 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PrintPredecessors()
|
| D | superblock_cloner_test.cc | 445 EXPECT_EQ(header->GetPredecessors().size(), 3u); in TEST_F()
|
| D | register_allocator_graph_color.cc | 1340 for (HBasicBlock* predecessor : block->GetPredecessors()) { in FindCoalesceOpportunities()
1359 ArrayRef<HBasicBlock* const> predecessors(defined_by->GetBlock()->GetPredecessors()); in FindCoalesceOpportunities()
|
| D | nodes.h | 988 const ArenaVector<HBasicBlock*>& GetPredecessors() const { in GetPredecessors() function
1149 DCHECK_EQ(GetPredecessors().size(), 1u); in GetSinglePredecessor()
1150 return GetPredecessors()[0]; in GetSinglePredecessor()
1161 DCHECK_EQ(GetPredecessors()[idx], predecessor); in IsFirstIndexOfPredecessor()
1241 return GetPredecessors()[0] == GetLoopInformation()->GetPreHeader(); in IsLoopPreHeaderFirstPredecessor()
1246 return GetLoopInformation()->IsBackEdge(*GetPredecessors()[0]); in IsFirstPredecessorBackEdge()
|
| D | induction_var_analysis.cc | 114 while (guard->GetPredecessors().size() == 1 && in IsGuardedBy()
|
| D | inliner.cc | 1912 for (HBasicBlock* predecessor : exit_block->GetPredecessors()) { in TryBuildAndInlineHelper()
|