HomeSort by relevance Sort by last modified time
    Searched refs:HAnd (Results 1 - 18 of 18) sorted by null

  /art/compiler/optimizing/
instruction_simplifier_arm.h 64 void VisitAnd(HAnd* instruction) OVERRIDE;
instruction_simplifier_arm64.h 67 void VisitAnd(HAnd* instruction) OVERRIDE;
instruction_simplifier_arm.cc 139 void InstructionSimplifierArmVisitor::VisitAnd(HAnd* instruction) {
instruction_simplifier_arm64.cc 136 void InstructionSimplifierArm64Visitor::VisitAnd(HAnd* instruction) {
constant_folding.cc 58 void VisitAnd(HAnd* instruction) OVERRIDE;
218 void InstructionWithAbsorbingInputSimplifier::VisitAnd(HAnd* instruction) {
instruction_simplifier.cc 62 // `op` should be either HOr or HAnd.
82 void VisitAnd(HAnd* instruction) OVERRIDE;
228 // Replace the `HAnd` or `HOr`.
233 hbin = new (GetGraph()->GetArena()) HAnd(type, src_left, src_right, dex_pc);
295 HAnd* and_insn = shift_amount->AsAnd();
    [all...]
scheduler_arm.cc 88 void SchedulingLatencyVisitorARM::VisitAnd(HAnd* instr) {
instruction_builder.cc     [all...]
loop_optimization.cc 585 // Scan the loop-body, starting a right-hand-side tree traversal at each left-hand-side
589 return false; // failure to vectorize a left-hand-side
693 preheader, new (global_allocator_) HAnd(induc_type,
830 // TODO: accept reductions at left-hand-side, mixed-type store idioms, etc.
834 // Accept a left-hand-side array base[index] for
838 // (4) vectorizable right-hand-side value.
    [all...]
bounds_check_elimination.cc 720 // for the left hand side.
    [all...]
induction_var_range.cc     [all...]
nodes.h     [all...]
code_generator_arm64.cc     [all...]
code_generator_mips64.cc     [all...]
code_generator_arm_vixl.cc     [all...]
code_generator_mips.cc     [all...]
code_generator_x86.cc     [all...]
code_generator_x86_64.cc     [all...]

Completed in 298 milliseconds