Home
last modified time | relevance | path

Searched refs:HAdd (Results 1 – 11 of 11) sorted by relevance

/art/compiler/optimizing/
Dinstruction_simplifier.cc53 void VisitAdd(HAdd* instruction) OVERRIDE;
153 HAdd *add = new(GetGraph()->GetArena()) HAdd(instruction->GetType(), in VisitShift()
309 void InstructionSimplifierVisitor::VisitAdd(HAdd* instruction) { in VisitAdd()
480 new (allocator) HAdd(type, input_other, input_other)); in VisitMul()
665 HAdd* add = new(GetGraph()->GetArena()) HAdd(type, left, right->AsNeg()->GetInput()); in VisitSub()
681 HAdd* add = new(GetGraph()->GetArena()) HAdd(type, left->AsNeg()->GetInput(), right); in VisitSub()
Dbounds_check_elimination_test.cc177 HInstruction* add = new (&allocator) HAdd(Primitive::kPrimInt, parameter2, constant_max_int); in TEST()
421 HInstruction* add = new (allocator) HAdd(Primitive::kPrimInt, phi, constant_increment); in BuildSSAGraph1()
551 HInstruction* add = new (allocator) HAdd(Primitive::kPrimInt, phi, constant_minus_1); in BuildSSAGraph2()
557 HInstruction* add_phi = new (allocator) HAdd(Primitive::kPrimInt, phi, constant_increment); in BuildSSAGraph2()
680 HInstruction* add = new (allocator) HAdd(Primitive::kPrimInt, phi, constant_increment); in BuildSSAGraph3()
797 HAdd(Primitive::kPrimInt, sub, constant_minus_1); in BuildSSAGraph4()
801 HInstruction* add = new (allocator) HAdd(Primitive::kPrimInt, phi, constant_1); in BuildSSAGraph4()
892 HAdd* add = new (&allocator) HAdd(Primitive::kPrimInt, array_length, constant_minus_1); in TEST()
909 add = new (&allocator) HAdd(Primitive::kPrimInt, sub, constant_minus_1); in TEST()
932 HInstruction* j_plus_1 = new (&allocator) HAdd(Primitive::kPrimInt, phi_j, constant_1); in TEST()
[all …]
Dlive_ranges_test.cc355 HAdd* add = liveness.GetInstructionFromSsaIndex(2)->AsAdd(); in TEST()
433 HAdd* add = liveness.GetInstructionFromSsaIndex(2)->AsAdd(); in TEST()
Dbuilder.cc1594 Binop_23x<HAdd>(instruction, Primitive::kPrimInt); in AnalyzeDexInstruction()
1599 Binop_23x<HAdd>(instruction, Primitive::kPrimLong); in AnalyzeDexInstruction()
1604 Binop_23x<HAdd>(instruction, Primitive::kPrimDouble); in AnalyzeDexInstruction()
1609 Binop_23x<HAdd>(instruction, Primitive::kPrimFloat); in AnalyzeDexInstruction()
1634 Binop_12x<HAdd>(instruction, Primitive::kPrimInt); in AnalyzeDexInstruction()
1763 Binop_12x<HAdd>(instruction, Primitive::kPrimLong); in AnalyzeDexInstruction()
1768 Binop_12x<HAdd>(instruction, Primitive::kPrimDouble); in AnalyzeDexInstruction()
1773 Binop_12x<HAdd>(instruction, Primitive::kPrimFloat); in AnalyzeDexInstruction()
1922 Binop_22s<HAdd>(instruction, false); in AnalyzeDexInstruction()
1952 Binop_22b<HAdd>(instruction, false); in AnalyzeDexInstruction()
Dbounds_check_elimination.cc1004 added = new (graph->GetArena()) HAdd(Primitive::kPrimInt, array_length, offset_instr); in AddDeoptimizationArrayLength()
1573 void VisitAdd(HAdd* add) { in VisitAdd()
Dnodes.h2688 class HAdd : public HBinaryOperation {
2690 HAdd(Primitive::Type result_type, HInstruction* left, HInstruction* right) in HAdd() function
2705 DISALLOW_COPY_AND_ASSIGN(HAdd);
Dcode_generator_arm64.cc1301 void LocationsBuilderARM64::VisitAdd(HAdd* instruction) { in VisitAdd()
1305 void InstructionCodeGeneratorARM64::VisitAdd(HAdd* instruction) { in VisitAdd()
Dcode_generator_mips64.cc1236 void LocationsBuilderMIPS64::VisitAdd(HAdd* instruction) { in VisitAdd()
1240 void InstructionCodeGeneratorMIPS64::VisitAdd(HAdd* instruction) { in VisitAdd()
Dcode_generator_arm.cc1940 void LocationsBuilderARM::VisitAdd(HAdd* add) { in VisitAdd()
1971 void InstructionCodeGeneratorARM::VisitAdd(HAdd* add) { in VisitAdd()
Dcode_generator_x86.cc1919 void LocationsBuilderX86::VisitAdd(HAdd* add) { in VisitAdd()
1951 void InstructionCodeGeneratorX86::VisitAdd(HAdd* add) { in VisitAdd()
Dcode_generator_x86_64.cc2078 void LocationsBuilderX86_64::VisitAdd(HAdd* add) { in VisitAdd()
2110 void InstructionCodeGeneratorX86_64::VisitAdd(HAdd* add) { in VisitAdd()