Home
last modified time | relevance | path

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

12

/art/compiler/optimizing/
Dssa_phi_elimination.cc55 for (const HUseListNode<HInstruction*>& use : phi->GetUses()) { in MarkDeadPhis()
105 for (const HUseListNode<HInstruction*>& use : phi->GetUses()) { in EliminateDeadPhis()
248 for (const HUseListNode<HInstruction*>& use : current->GetUses()) { in Run()
Dprepare_for_register_allocation.cc120 for (const HUseListNode<HInstruction*>& use : check->GetUses()) { in VisitClinitCheck()
142 const HUseList<HInstruction*>& uses = check->GetUses(); in VisitClinitCheck()
196 HInstruction* user = condition->GetUses().front().GetUser(); in VisitCondition()
Dload_store_analysis.cc105 for (const HUseListNode<HInstruction*>& use : reference_->GetUses()) { in PrunePartialEscapeWrites()
139 std::all_of(inst->GetUses().cbegin(), in InstructionEligibleForLSERemoval()
140 inst->GetUses().cend(), in InstructionEligibleForLSERemoval()
Dnodes_test.cc204 ASSERT_TRUE(parameter1->GetUses().HasExactlyOneElement()); in TEST_F()
225 ASSERT_TRUE(parameter->GetUses().HasExactlyOneElement()); in TEST_F()
241 ASSERT_TRUE(parameter1->GetUses().HasExactlyOneElement()); in TEST_F()
Dinstruction_simplifier_shared.cc111 HInstruction* use = mul->GetUses().front().GetUser(); in TryCombineMultiplyAccumulate()
300 for (const HUseListNode<HInstruction*>& use : index->GetUses()) { in TryExtractVecArrayAccessAddress()
345 if (last_sub_right->GetUses().HasExactlyOneElement()) { in TryReplaceSubSubWithSubAdd()
Dcode_sinking.cc211 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in FindIdealPosition()
287 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in FindIdealPosition()
425 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in SinkCodeToUncommonBranch()
490 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in SinkCodeToUncommonBranch()
Dssa_liveness_analysis.h303 DCHECK(GetUses().empty()) << "A temporary can only have one user"; in AddTempUse()
565 for (const UsePosition& use : GetUses()) { in FirstRegisterUseAfter()
602 for (const UsePosition& use : GetUses()) { in FirstUseAfter()
614 const UsePositionList& GetUses() const { in GetUses() function
754 for (const UsePosition& use : GetUses()) { in Dump()
1039 for (const UsePosition& use : GetUses()) { in HasSynthesizeUseAt()
1227 DCHECK_EQ(user, temp->GetUses().front().GetUser()); in GetTempUser()
1234 return temp->GetUses().front().GetInputIndex(); in GetTempIndex()
Descape.cc35 for (const HUseListNode<HInstruction*>& use : reference->GetUses()) { in VisitEscapes()
Dinstruction_simplifier_arm.cc147 if (bitfield_op->GetUses().empty()) { in TryMergeIntoShifterOperand()
164 const HUseList<HInstruction*>& uses = bitfield_op->GetUses(); in TryMergeIntoUsersShifterOperand()
Dinstruction_simplifier_arm64.cc151 if (bitfield_op->GetUses().empty()) { in TryMergeIntoShifterOperand()
168 const HUseList<HInstruction*>& uses = bitfield_op->GetUses(); in TryMergeIntoUsersShifterOperand()
Dpretty_printer.h61 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in PrintPostInstruction()
Dconstant_folding.cc148 uses_before = variable->GetUses().SizeSlow(); in PropagateValue()
151 if (variable->GetUses().HasExactlyOneElement()) { in PropagateValue()
160 uses_after = variable->GetUses().SizeSlow(); in PropagateValue()
Dcode_generator_utils.cc214 for (const HUseListNode<HInstruction*>& use : value->GetUses()) { in IsNonNegativeUse()
Dloop_optimization.cc382 !instr->GetUses().empty() || in CheckInductionSetFullyRemoved()
412 const HUseList<HInstruction*>& uses = cond->GetUses(); in TryToEvaluateIfCondition()
1283 for (const HUseListNode<HInstruction*>& use : phi->GetUses()) { in Vectorize()
2464 for (const HUseListNode<HInstruction*>& use : i->GetUses()) { in TrySetPhiInduction()
2493 reduction->GetUses().HasExactlyOneElement() && in TrySetPhiReduction()
2496 std::none_of(phi->GetUses().begin(), in TrySetPhiReduction()
2497 phi->GetUses().end(), in TrySetPhiReduction()
2544 c->GetUses().HasExactlyOneElement() && // only used for termination in TrySetSimpleLoopHeader()
2575 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in IsUsedOutsideLoop()
2588 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in IsOnlyUsedAfterLoop()
[all …]
Dload_store_elimination.cc723 for (const HUseListNode<HInstruction*>& use : value->GetUses()) { in FindOrAddTypeConversionIfNecessary()
3185 CHECK(OriginalNewInstance()->GetUses().empty()) in FixupUses()
3186 << OriginalNewInstance()->GetUses() << ", " << OriginalNewInstance()->GetEnvUses(); in FixupUses()
3304 ins->IsInstanceFieldGet() && (!ins->GetUses().empty() || !ins->GetEnvUses().empty()); in RemoveAndReplaceInputs()
3311 while (!ins->GetUses().empty()) { in RemoveAndReplaceInputs()
3312 const HUseListNode<HInstruction*>& use = ins->GetUses().front(); in RemoveAndReplaceInputs()
3320 DCHECK(ins->GetUses().empty()) in RemoveAndReplaceInputs()
3322 << ins->DumpWithArgs() << "\nUsers are " << ins->GetUses(); in RemoveAndReplaceInputs()
3402 CHECK(ins->GetEnvUses().empty() && ins->GetUses().empty()) in PredicateInstructions()
3403 << "Instruction: " << *ins << " uses: " << ins->GetUses() in PredicateInstructions()
[all …]
Dcommon_arm64.h274 if (constant->GetUses().HasExactlyOneElement()) { in Arm64CanEncodeConstantAsImmediate()
286 if (constant->GetUses().HasExactlyOneElement()) { in Arm64CanEncodeConstantAsImmediate()
Dgraph_checker.cc553 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in VisitInstruction()
594 if ((input_record.GetBeforeUseNode() == input->GetUses().end()) || in VisitInstruction()
595 (input_record.GetUseNode() == input->GetUses().end()) || in VisitInstruction()
596 !input->GetUses().ContainsNode(*input_record.GetUseNode()) || in VisitInstruction()
609 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in VisitInstruction()
Dssa_liveness_analysis.cc222 for (const HUseListNode<HInstruction*>& use : current->GetUses()) { in ComputeLiveRanges()
379 for (const UsePosition& use : GetUses()) { in FindFirstRegisterHint()
Dregister_allocator_graph_color.cc183 auto matching_use_range = FindMatchingUseRange(interval->GetUses().begin(), in ComputeSpillWeight()
184 interval->GetUses().end(), in ComputeSpillWeight()
1026 auto matching_use_range = FindMatchingUseRange(interval->GetUses().begin(), in SplitAtRegisterUses()
1027 interval->GetUses().end(), in SplitAtRegisterUses()
1435 auto matching_use_range = FindMatchingUseRange(interval->GetUses().begin(), in FindCoalesceOpportunities()
1436 interval->GetUses().end(), in FindCoalesceOpportunities()
Dnodes.cc180 const HUseListNode<HInstruction*>& use = insn->GetUses().front(); in RemoveCatchPhiUsesOfDeadInstruction()
1192 DCHECK(initial->GetUses().empty()); in ReplaceAndRemoveInstructionWith()
1269 DCHECK(instruction->GetUses().empty()); in Remove()
1568 const HUseList<HInstruction*>& uses = GetUses(); in ReplaceUsesDominatedBy()
1674 const HUseList<HInstruction*>& uses = instruction->GetUses(); in RemoveConstructorFences()
1724 for (const HUseListNode<HInstruction*>& use_node : instruction->GetUses()) { in RemoveConstructorFences()
2115 auto uses_it = GetUses().begin(); in MoveBeforeFirstUserAndOutOfLoops()
2116 auto uses_end = GetUses().end(); in MoveBeforeFirstUserAndOutOfLoops()
2139 for (const HUseListNode<HInstruction*>& use : GetUses()) { in MoveBeforeFirstUserAndOutOfLoops()
2578 DCHECK(insn->GetUses().empty()); in RemoveCatchPhiUsesAndInstruction()
[all …]
Dreference_type_propagation.cc170 for (const HUseListNode<HInstruction*>& use : obj->GetUses()) { in ShouldCreateBoundType()
202 const HUseList<HInstruction*>& uses = receiver->GetUses(); in BoundTypeIn()
1005 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in AddDependentInstructionsToWorklist()
Dscheduler.cc299 if (def_node != nullptr && def_node != node && phi_input->GetUses().HasExactlyOneElement()) { in AddCrossIterationDependencies()
314 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in AddDependencies()
Dlive_ranges_test.cc425 ASSERT_TRUE(phi->GetUses().HasExactlyOneElement()); in TEST_F()
/art/tools/veridex/
Dprecise_hidden_api_finder.cc70 AddUsesAt(collector.GetUses(), method.GetReference()); in Run()
88 AddUsesAt(substitutor.GetUses(), method.GetReference()); in Run()
Dflow_analysis.h192 const std::vector<ReflectAccessInfo>& GetUses() const { in GetUses() function
212 const std::vector<ReflectAccessInfo>& GetUses() const { in GetUses() function

12