Home
last modified time | relevance | path

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

12

/art/compiler/optimizing/
Dnodes_test.cc91 ASSERT_TRUE(parameter1->GetUses().HasExactlyOneElement()); in TEST_F()
112 ASSERT_TRUE(parameter->GetUses().HasExactlyOneElement()); in TEST_F()
128 ASSERT_TRUE(parameter1->GetUses().HasExactlyOneElement()); in TEST_F()
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()
Dcode_sinking.cc184 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in FindIdealPosition()
226 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in FindIdealPosition()
325 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in SinkCodeToUncommonBranch()
390 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in SinkCodeToUncommonBranch()
Dprepare_for_register_allocation.cc120 for (const HUseListNode<HInstruction*>& use : check->GetUses()) { in VisitClinitCheck()
142 const HUseList<HInstruction*>& uses = check->GetUses(); in VisitClinitCheck()
197 HInstruction* user = condition->GetUses().front().GetUser(); in VisitCondition()
Descape.cc47 for (const HUseListNode<HInstruction*>& use : reference->GetUses()) { in CalculateEscape()
Dssa_liveness_analysis.h302 DCHECK(GetUses().empty()) << "A temporary can only have one user"; in AddTempUse()
564 for (const UsePosition& use : GetUses()) { in FirstRegisterUseAfter()
601 for (const UsePosition& use : GetUses()) { in FirstUseAfter()
613 const UsePositionList& GetUses() const { in GetUses() function
753 for (const UsePosition& use : GetUses()) { in Dump()
1038 for (const UsePosition& use : GetUses()) { in HasSynthesizeUseAt()
1226 DCHECK_EQ(user, temp->GetUses().front().GetUser()); in GetTempUser()
1233 return temp->GetUses().front().GetInputIndex(); in GetTempIndex()
Dinstruction_simplifier_arm.cc145 if (bitfield_op->GetUses().empty()) { in TryMergeIntoShifterOperand()
162 const HUseList<HInstruction*>& uses = bitfield_op->GetUses(); in TryMergeIntoUsersShifterOperand()
Dinstruction_simplifier_arm64.cc149 if (bitfield_op->GetUses().empty()) { in TryMergeIntoShifterOperand()
166 const HUseList<HInstruction*>& uses = bitfield_op->GetUses(); in TryMergeIntoUsersShifterOperand()
Dpretty_printer.h60 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in PrintPostInstruction()
Dinstruction_simplifier_shared.cc111 HInstruction* use = mul->GetUses().front().GetUser(); in TryCombineMultiplyAccumulate()
300 for (const HUseListNode<HInstruction*>& use : index->GetUses()) { in TryExtractVecArrayAccessAddress()
Dinstruction_simplifier_mips.cc80 for (const HUseListNode<HInstruction*>& use : index->GetUses()) { in TryExtractArrayAccessIndex()
Dgraph_checker.cc402 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in VisitInstruction()
443 if ((input_record.GetBeforeUseNode() == input->GetUses().end()) || in VisitInstruction()
444 (input_record.GetUseNode() == input->GetUses().end()) || in VisitInstruction()
445 !input->GetUses().ContainsNode(*input_record.GetUseNode()) || in VisitInstruction()
458 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in VisitInstruction()
Dcommon_arm64.h255 if (constant->GetUses().HasExactlyOneElement()) { in Arm64CanEncodeConstantAsImmediate()
267 if (constant->GetUses().HasExactlyOneElement()) { in Arm64CanEncodeConstantAsImmediate()
Dssa_liveness_analysis.cc222 for (const HUseListNode<HInstruction*>& use : current->GetUses()) { in ComputeLiveRanges()
379 for (const UsePosition& use : GetUses()) { in FindFirstRegisterHint()
Dloop_optimization.cc382 !instr->GetUses().empty() || in CheckInductionSetFullyRemoved()
412 const HUseList<HInstruction*>& uses = cond->GetUses(); in TryToEvaluateIfCondition()
1189 for (const HUseListNode<HInstruction*>& use : phi->GetUses()) { in Vectorize()
2305 for (const HUseListNode<HInstruction*>& use : i->GetUses()) { in TrySetPhiInduction()
2334 reduction->GetUses().HasExactlyOneElement() && in TrySetPhiReduction()
2382 c->GetUses().HasExactlyOneElement() && // only used for termination in TrySetSimpleLoopHeader()
2413 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in IsUsedOutsideLoop()
2426 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in IsOnlyUsedAfterLoop()
2452 const HUseList<HInstruction*>& uses = instruction->GetUses(); in TryReplaceWithLastValue()
Dregister_allocator_graph_color.cc183 auto matching_use_range = FindMatchingUseRange(interval->GetUses().begin(), in ComputeSpillWeight()
184 interval->GetUses().end(), in ComputeSpillWeight()
1017 auto matching_use_range = FindMatchingUseRange(interval->GetUses().begin(), in SplitAtRegisterUses()
1018 interval->GetUses().end(), in SplitAtRegisterUses()
1426 auto matching_use_range = FindMatchingUseRange(interval->GetUses().begin(), in FindCoalesceOpportunities()
1427 interval->GetUses().end(), in FindCoalesceOpportunities()
Dnodes.cc978 DCHECK(initial->GetUses().empty()); in ReplaceAndRemoveInstructionWith()
1055 DCHECK(instruction->GetUses().empty()); in Remove()
1299 const HUseList<HInstruction*>& uses = GetUses(); in ReplaceUsesDominatedBy()
1402 const HUseList<HInstruction*>& uses = instruction->GetUses(); in RemoveConstructorFences()
1452 for (const HUseListNode<HInstruction*>& use_node : instruction->GetUses()) { in RemoveConstructorFences()
1792 auto uses_it = GetUses().begin(); in MoveBeforeFirstUserAndOutOfLoops()
1793 auto uses_end = GetUses().end(); in MoveBeforeFirstUserAndOutOfLoops()
1816 for (const HUseListNode<HInstruction*>& use : GetUses()) { in MoveBeforeFirstUserAndOutOfLoops()
2113 const HUseListNode<HInstruction*>& use = insn->GetUses().front(); in RemoveUsesOfDeadInstruction()
Dreference_type_propagation.cc229 for (const HUseListNode<HInstruction*>& use : obj->GetUses()) { in ShouldCreateBoundType()
261 const HUseList<HInstruction*>& uses = receiver->GetUses(); in BoundTypeIn()
1049 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) { in AddDependentInstructionsToWorklist()
Dlive_ranges_test.cc421 ASSERT_TRUE(phi->GetUses().HasExactlyOneElement()); in TEST_F()
Dregister_allocation_resolver.cc314 UsePositionList::const_iterator use_it = current->GetUses().begin(); in ConnectSiblings()
315 const UsePositionList::const_iterator use_end = current->GetUses().end(); in ConnectSiblings()
Dgraph_visualizer.cc637 StartAttributeStream("uses") << StringList(interval->GetUses()); in PrintInstruction()
730 size_t num_uses = instruction->GetUses().SizeSlow(); in PrintInstructions()
Ddead_code_elimination.cc183 const HUseList<HInstruction*>& uses = obj->GetUses(); in RemoveNonNullControlDependences()
Dsuperblock_cloner.cc43 auto& uses = instr->GetUses(); in IsUsedOutsideRegion()
602 const HUseList<HInstruction*>& uses = value->GetUses(); in ConstructSubgraphClosedSSA()
/art/tools/veridex/
Dprecise_hidden_api_finder.cc63 AddUsesAt(collector.GetUses(), method.GetReference()); in Run()
80 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