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.cc202 block->Dominates(user_block)) { in RemoveNonNullControlDependences()
511 dominator->GetLastInstruction()->AsIf()->IfTrueSuccessor()->Dominates(pred); in MaybeAddPhi()
513 dominator->GetLastInstruction()->AsIf()->IfFalseSuccessor()->Dominates(pred); in MaybeAddPhi()
Dcode_sinking.cc440 !user->GetBlock()->Dominates(common_dominator)) { in SinkCodeToUncommonBranch()
559 if (position == nullptr || !instruction->GetBlock()->Dominates(position->GetBlock())) { in SinkCodeToUncommonBranch()
Dgraph_checker.cc663 : !instruction->GetBlock()->Dominates(user->GetBlock()))) { in VisitInstruction()
698 : !instruction->GetBlock()->Dominates(user->GetBlock())) { in VisitInstruction()
1005 } else if (!loop_information->IsIrreducible() && !loop_header->Dominates(loop_block)) { in HandleLoop()
1120 || input->GetBlock()->Dominates(predecessor))) { in VisitPhi()
Dfind_loops_test.cc317 ASSERT_FALSE(info->GetHeader()->Dominates(info->GetBackEdges()[0])); in TEST_F()
Dsuperblock_cloner.cc715 DCHECK(orig_input->GetBlock()->Dominates(orig_instr->GetBlock())); in CheckInstructionInputsRemapping()
723 DCHECK(copy_input->GetBlock()->Dominates(copy_instr->GetBlock())); in CheckInstructionInputsRemapping()
740 DCHECK(copy_input->GetBlock()->Dominates(copy_instr->GetBlock())); in CheckInstructionInputsRemapping()
Dloop_optimization_test.cc255 EXPECT_TRUE(input->GetBlock()->Dominates(header->GetPredecessors()[i])); in TEST_F()
Dsuperblock_cloner_test.cc258 EXPECT_TRUE(entry_block_->Dominates(header)); in TEST_F()
259 EXPECT_TRUE(entry_block_->Dominates(exit_block_)); in TEST_F()
Dreference_type_propagation.cc176 DCHECK(!dominator_block->Dominates(user->GetBlock()) in ShouldCreateBoundType()
209 : start_block->Dominates(user->GetBlock()); in BoundTypeIn()
Dconstant_folding.cc244 DCHECK(!inst->IfTrueSuccessor()->Dominates(inst->IfFalseSuccessor()) && in VisitIf()
245 !inst->IfFalseSuccessor()->Dominates(inst->IfTrueSuccessor())); in VisitIf()
Dnodes.cc966 if (!header_->Dominates(back_edge)) { in HasBackEdgeNotDominatedByHeader()
975 if (!block->Dominates(back_edge)) { in DominatesAllBackEdges()
996 bool HBasicBlock::Dominates(const HBasicBlock* other) const { in Dominates() function in art::HBasicBlock
1344 bool HInstruction::Dominates(HInstruction* other_instruction) const { in Dominates() function in art::HInstruction
1356 return GetBlock()->Dominates(other_instruction->GetBlock()); in StrictlyDominates()
1451 strictly_dominated ? dominator->StrictlyDominates(user) : dominator->Dominates(user); in ReplaceUsesDominatedBy()
Dbounds_check_elimination.cc1436 if (user->IsBoundsCheck() && block->Dominates(other_block)) { in AddComparesWithDeoptimization()
1454 (block->Dominates(exit) && other_block->Dominates(exit))) { in AddComparesWithDeoptimization()
Dload_store_elimination.cc598 use.GetUser()->GetBlock()->Dominates(instruction->GetBlock()) && in FindOrAddTypeConversionIfNecessary()
1466 CHECK(ref->GetBlock() != block && ref->GetBlock()->Dominates(block)) in PrepareLoopValue()
1588 CHECK(GetGraph()->GetBlocks()[block_id]->Dominates(block)); in MergePredecessorRecords()
1590 CHECK(merged_value.GetInstruction()->GetBlock()->Dominates(block)); in MergePredecessorRecords()
Dloop_optimization.cc419 if (true_succ->Dominates(user_block)) { in TryToEvaluateIfCondition()
421 } else if (false_succ->Dominates(user_block)) { in TryToEvaluateIfCondition()
837 if (block->Dominates(meet0)) { in SimplifyBlocks()
Dinduction_var_range.cc188 return loop_exit_block->Dominates(context); in UseFullTripCount()
Dnodes.h1456 bool Dominates(const HBasicBlock* block) const;
2482 bool Dominates(HInstruction* other_instruction) const;