HomeSort by relevance Sort by last modified time
    Searched refs:GetUses (Results 1 - 25 of 27) sorted by null

1 2

  /art/compiler/optimizing/
escape.cc 41 for (const HUseListNode<HInstruction*>& use : reference->GetUses()) {
instruction_simplifier_arm.cc 97 if (bitfield_op->GetUses().empty()) {
114 const HUseList<HInstruction*>& uses = bitfield_op->GetUses();
instruction_simplifier_arm64.cc 94 if (bitfield_op->GetUses().empty()) {
111 const HUseList<HInstruction*>& uses = bitfield_op->GetUses();
code_sinking.cc 172 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) {
209 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) {
306 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) {
371 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) {
nodes_test.cc 94 ASSERT_TRUE(parameter1->GetUses().HasExactlyOneElement());
118 ASSERT_TRUE(parameter->GetUses().HasExactlyOneElement());
137 ASSERT_TRUE(parameter1->GetUses().HasExactlyOneElement());
prepare_for_register_allocation.cc 88 for (const HUseListNode<HInstruction*>& use : check->GetUses()) {
110 const HUseList<HInstruction*>& uses = check->GetUses();
163 HInstruction* user = condition->GetUses().front().GetUser();
ssa_phi_elimination.cc 46 for (const HUseListNode<HInstruction*>& use : phi->GetUses()) {
96 for (const HUseListNode<HInstruction*>& use : phi->GetUses()) {
231 for (const HUseListNode<HInstruction*>& use : current->GetUses()) {
instruction_simplifier_shared.cc 111 HInstruction* use = mul->GetUses().front().GetUser();
302 HInstruction* use = mul->GetUses().front().GetUser();
367 for (const HUseListNode<HInstruction*>& use : index->GetUses()) {
pretty_printer.h 60 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) {
ssa_liveness_analysis.h 285 DCHECK(GetUses().empty()) << "A temporary can only have one user";
554 for (const UsePosition& use : GetUses()) {
591 for (const UsePosition& use : GetUses()) {
603 const UsePositionList& GetUses() const {
743 for (const UsePosition& use : GetUses()) {
    [all...]
graph_checker.cc 361 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) {
402 if ((input_record.GetBeforeUseNode() == input->GetUses().end()) ||
403 (input_record.GetUseNode() == input->GetUses().end()) ||
404 !input->GetUses().ContainsNode(*input_record.GetUseNode()) ||
417 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) {
    [all...]
register_allocator_graph_color.cc 183 auto matching_use_range = FindMatchingUseRange(interval->GetUses().begin(),
184 interval->GetUses().end(),
    [all...]
ssa_liveness_analysis.cc 214 for (const HUseListNode<HInstruction*>& use : current->GetUses()) {
361 for (const UsePosition& use : GetUses()) {
reference_type_propagation.cc 187 for (const HUseListNode<HInstruction*>& use : obj->GetUses()) {
219 const HUseList<HInstruction*>& uses = receiver->GetUses();
    [all...]
loop_optimization.cc     [all...]
common_arm64.h 254 if (constant->GetUses().HasExactlyOneElement()) {
live_ranges_test.cc 444 ASSERT_TRUE(phi->GetUses().HasExactlyOneElement());
nodes.cc 796 DCHECK(initial->GetUses().empty());
    [all...]
graph_visualizer.cc 603 StartAttributeStream("uses") << StringList(interval->GetUses());
684 size_t num_uses = instruction->GetUses().SizeSlow();
    [all...]
register_allocation_resolver.cc 311 UsePositionList::const_iterator use_it = current->GetUses().begin();
312 const UsePositionList::const_iterator use_end = current->GetUses().end();
bounds_check_elimination.cc     [all...]
instruction_simplifier.cc 461 for (const HUseListNode<HInstruction*>& use : input->GetUses()) {
639 } else if (cmp->GetUses().HasExactlyOneElement()) {
642 HInstruction* user = cmp->GetUses().front().GetUser();
    [all...]
scheduler.cc 288 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) {
ssa_builder.cc 112 for (const HUseListNode<HInstruction*>& use : instruction->GetUses()) {
nodes.h     [all...]

Completed in 164 milliseconds

1 2