Home
last modified time | relevance | path

Searched refs:Dominates (Results 1 – 16 of 16) sorted by relevance

/art/compiler/optimizing/
Dcode_generator_utils.cc197 return successor->Dominates(target_block); in IsComparedValueNonNegativeInBlock()
229 if (user->GetBlock()->Dominates(target_user->GetBlock()) && in IsNonNegativeUse()
Ddead_code_elimination.cc191 block->Dominates(user_block)) { in RemoveNonNullControlDependences()
280 !block->Dominates(pred) && in SimplifyAlwaysThrows()
281 pred->Dominates(succ) && in SimplifyAlwaysThrows()
Dcode_sinking.cc408 !user->GetBlock()->Dominates(common_dominator)) { in SinkCodeToUncommonBranch()
491 if (position == nullptr || !instruction->GetBlock()->Dominates(position->GetBlock())) { in SinkCodeToUncommonBranch()
Dfind_loops_test.cc316 ASSERT_FALSE(info->GetHeader()->Dominates(info->GetBackEdges()[0])); in TEST_F()
Dsuperblock_cloner.cc717 DCHECK(orig_input->GetBlock()->Dominates(orig_instr->GetBlock())); in CheckInstructionInputsRemapping()
725 DCHECK(copy_input->GetBlock()->Dominates(copy_instr->GetBlock())); in CheckInstructionInputsRemapping()
742 DCHECK(copy_input->GetBlock()->Dominates(copy_instr->GetBlock())); in CheckInstructionInputsRemapping()
Dloop_optimization_test.cc257 EXPECT_TRUE(input->GetBlock()->Dominates(header->GetPredecessors()[i])); in TEST_F()
Dsuperblock_cloner_test.cc257 EXPECT_TRUE(entry_block_->Dominates(header)); in TEST_F()
258 EXPECT_TRUE(entry_block_->Dominates(exit_block_)); in TEST_F()
Dreference_type_propagation.cc227 DCHECK(!dominator_block->Dominates(user->GetBlock()) in ShouldCreateBoundType()
260 : start_block->Dominates(user->GetBlock()); in BoundTypeIn()
Dgraph_checker.cc768 } else if (!loop_information->IsIrreducible() && !loop_header->Dominates(loop_block)) { in HandleLoop()
884 || input->GetBlock()->Dominates(predecessor))) { in VisitPhi()
Dbounds_check_elimination.cc1424 if (user->IsBoundsCheck() && block->Dominates(other_block)) { in AddComparesWithDeoptimization()
1442 (block->Dominates(exit) && other_block->Dominates(exit))) { in AddComparesWithDeoptimization()
Dnodes.cc1083 if (!header_->Dominates(back_edge)) { in HasBackEdgeNotDominatedByHeader()
1092 if (!block->Dominates(back_edge)) { in DominatesAllBackEdges()
1113 bool HBasicBlock::Dominates(const HBasicBlock* other) const { in Dominates() function in art::HBasicBlock
1470 return GetBlock()->Dominates(other_instruction->GetBlock()); in StrictlyDominates()
1536 if (dominator->GetBlock()->Dominates(predecessor)) { in ReplaceUsesDominatedBy()
Dload_store_elimination.cc728 use.GetUser()->GetBlock()->Dominates(instruction->GetBlock()) && in FindOrAddTypeConversionIfNecessary()
1598 CHECK(ref->GetBlock() != block && ref->GetBlock()->Dominates(block)) in PrepareLoopValue()
1721 CHECK(GetGraph()->GetBlocks()[block_id]->Dominates(block)); in MergePredecessorRecords()
1723 CHECK(merged_value.GetInstruction()->GetBlock()->Dominates(block)); in MergePredecessorRecords()
3716 if (UNLIKELY(!new_inst->GetBlock()->Dominates(entry))) { in SetupPartialMaterialization()
Dloop_optimization.cc419 if (true_succ->Dominates(user_block)) { in TryToEvaluateIfCondition()
421 } else if (false_succ->Dominates(user_block)) { in TryToEvaluateIfCondition()
741 if (block->Dominates(meet0)) { in SimplifyBlocks()
Dinduction_var_range.cc187 return loop_exit_block->Dominates(context); in UseFullTripCount()
Dregister_allocator_graph_color.cc83 if (block->Dominates(block->GetGraph()->GetExitBlock())) { in CostForMoveAt()
Dnodes.h1420 bool Dominates(const HBasicBlock* block) const;