Searched refs:uses (Results 1 - 7 of 7) sorted by relevance
/art/compiler/optimizing/ |
H A D | instruction_simplifier_arm.cc | 106 // Merge a bitfield move instruction into its uses if it can be merged in all of them. 114 const HUseList<HInstruction*>& uses = bitfield_op->GetUses(); local 117 for (const HUseListNode<HInstruction*>& use : uses) { 127 // Merge the instruction into its uses. 128 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) {
|
H A D | instruction_simplifier_arm64.cc | 103 // Merge a bitfield move instruction into its uses if it can be merged in all of them. 111 const HUseList<HInstruction*>& uses = bitfield_op->GetUses(); local 114 for (const HUseListNode<HInstruction*>& use : uses) { 124 // Merge the instruction into its uses. 125 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) {
|
H A D | prepare_for_register_allocation.cc | 45 // Replace the uses with the actual guarded instruction. 110 const HUseList<HInstruction*>& uses = check->GetUses(); local 111 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) { 113 // All other uses must be dominated.
|
H A D | reference_type_propagation.cc | 169 // In this case we also assert that there are no other uses of the object (except 186 // Check that the existing HBoundType dominates all the uses. 215 // We only need to bound the type if we have uses in the relevant block. 219 const HUseList<HInstruction*>& uses = receiver->GetUses(); local 220 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) { 387 // We only need to bound the type if we have uses in the relevant block.
|
H A D | loop_optimization.cc | 350 // uses when we compile 'debuggable'. 368 // cycle that is only used outside the loop. Replace these uses, if any, with 377 // Note that it's ok to have replaced uses after the loop with the last value, without 378 // being able to remove the cycle. Environment uses (which are the reason we may not be 458 // a trivial loop (just iterating once). Replace subsequent index uses, if any, 732 // Note that actual uses are inspected during right-hand-side tree traversal. 1238 // Accept recognized halving add for vectorizable operands. Vectorized code uses the 1239 // shorthand idiomatic operation. Sequential code uses the original scalar expressions. 1279 // each instruction is removable and, when restrict uses are requested, other than for phi, 1280 // all uses ar 1381 const HUseList<HInstruction*>& uses = instruction->GetUses(); local [all...] |
H A D | bounds_check_elimination.cc | 1723 * All uses of instructions in the deoptimization block that reach the loop need 1745 // Scan all uses of an instruction and replace each later use with a phi node. 1746 const HUseList<HInstruction*>& uses = instruction->GetUses(); local 1747 for (auto it2 = uses.begin(), end2 = uses.end(); it2 != end2; /* ++it2 below */) { 1760 // Scan all environment uses of an instruction and replace each later use with a phi node. 1858 // be bounded by a range at one instruction, it must be true that all uses of
|
H A D | nodes.cc | 153 // users can be safely removed before uses later. 1094 const HUseList<HInstruction*>& uses = GetUses(); local 1095 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) { 1422 // This instruction has uses in two or more blocks. Find the common dominator. 1716 // instruction from catch phi uses, together with inputs of other catch phis in 1786 // (3) Remove instructions and phis. Instructions should have no remaining uses
|
Completed in 92 milliseconds