Home
last modified time | relevance | path

Searched refs:GetUses (Results 1 – 18 of 18) sorted by relevance

/art/compiler/optimizing/
Dnodes_test.cc94 ASSERT_TRUE(parameter1->GetUses().HasExactlyOneElement()); in TEST()
118 ASSERT_TRUE(parameter->GetUses().HasExactlyOneElement()); in TEST()
137 ASSERT_TRUE(parameter1->GetUses().HasExactlyOneElement()); in TEST()
Dprepare_for_register_allocation.cc66 for (const HUseListNode<HInstruction*>& use : check->GetUses()) { in VisitClinitCheck()
88 const HUseList<HInstruction*>& uses = check->GetUses(); in VisitClinitCheck()
167 HInstruction* user = condition->GetUses().front().GetUser(); in VisitCondition()
Dssa_phi_elimination.cc47 for (const HUseListNode<HInstruction*>& use : phi->GetUses()) { in MarkDeadPhis()
98 for (const HUseListNode<HInstruction*>& use : phi->GetUses()) { in EliminateDeadPhis()
238 for (const HUseListNode<HInstruction*>& use : current->GetUses()) { in Run()
Dinstruction_simplifier_arm64.cc143 if (bitfield_op->GetUses().empty()) { in TryMergeIntoShifterOperand()
160 const HUseList<HInstruction*>& uses = bitfield_op->GetUses(); in TryMergeIntoUsersShifterOperand()
Dpretty_printer.h58 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in PrintPostInstruction()
Dgraph_checker.cc354 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in VisitInstruction()
393 if ((input_record.GetBeforeUseNode() == input->GetUses().end()) || in VisitInstruction()
394 (input_record.GetUseNode() == input->GetUses().end()) || in VisitInstruction()
395 !input->GetUses().ContainsNode(*input_record.GetUseNode()) || in VisitInstruction()
408 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in VisitInstruction()
Dinstruction_simplifier_shared.cc109 HInstruction* use = mul->GetUses().front().GetUser(); in TryCombineMultiplyAccumulate()
Dreference_type_propagation.cc214 for (const HUseListNode<HInstruction*>& use : obj->GetUses()) { in ShouldCreateBoundType()
269 const HUseList<HInstruction*>& uses = obj->GetUses(); in BoundTypeForIfNotNull()
409 const HUseList<HInstruction*>& uses = obj->GetUses(); in BoundTypeForIfInstanceOf()
915 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in AddDependentInstructionsToWorklist()
Dlive_ranges_test.cc444 ASSERT_TRUE(phi->GetUses().HasExactlyOneElement()); in TEST_F()
Dcommon_arm64.h202 if (constant->GetUses().HasExactlyOneElement()) { in CanEncodeConstantAsImmediate()
Dnodes.cc777 DCHECK(initial->GetUses().empty()); in ReplaceAndRemoveInstructionWith()
870 DCHECK(instruction->GetUses().empty()); in Remove()
1385 auto uses_it = GetUses().begin(); in MoveBeforeFirstUserAndOutOfLoops()
1386 auto uses_end = GetUses().end(); in MoveBeforeFirstUserAndOutOfLoops()
1409 for (const HUseListNode<HInstruction*>& use : GetUses()) { in MoveBeforeFirstUserAndOutOfLoops()
1692 const HUseListNode<HInstruction*>& use = insn->GetUses().front(); in RemoveUsesOfDeadInstruction()
Dssa_liveness_analysis.cc286 for (const HUseListNode<HInstruction*>& use : current->GetUses()) { in ComputeLiveRanges()
Dssa_builder.cc111 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in AddDependentInstructionsToWorklist()
Dgraph_visualizer.cc609 size_t num_uses = instruction->GetUses().SizeSlow(); in PrintInstructions()
Dbounds_check_elimination.cc1217 for (const HUseListNode<HInstruction*>& use : array_length->GetUses()) { in AddComparesWithDeoptimization()
1645 const HUseList<HInstruction*>& uses = instruction->GetUses(); in InsertPhiNodes()
Dinstruction_simplifier.cc412 for (const HUseListNode<HInstruction*>& use : input->GetUses()) { in CanEnsureNotNullAt()
1073 if (!left->GetUses().HasExactlyOneElement()) { in VisitCondition()
Dload_store_elimination.cc46 for (const HUseListNode<HInstruction*>& use : reference_->GetUses()) { in ReferenceInfo()
Dnodes.h1875 const HUseList<HInstruction*>& GetUses() const { return uses_; } in GetUses() function
1882 return !HasEnvironmentUses() && GetUses().HasExactlyOneElement(); in HasOnlyOneNonEnvironmentUse()