/art/compiler/optimizing/ |
induction_var_analysis_test.cc | 117 increment_[d] = new (&allocator_) HAdd(Primitive::kPrimInt, basic_[d], constant1_); 289 new (&allocator_) HAdd(Primitive::kPrimInt, constant100_, basic_[0]), 0); 321 new (&allocator_) HAdd(Primitive::kPrimInt, k_header, constant100_), 0); 354 HInstruction* inc1 = new (&allocator_) HAdd(Primitive::kPrimInt, k_header, constant1_); 358 HInstruction* inc2 = new (&allocator_) HAdd(Primitive::kPrimInt, k_header, constant1_); 387 HInstruction* inc1 = new (&allocator_) HAdd(Primitive::kPrimInt, basic_[0], constant1_); 391 HInstruction* inc2 = new (&allocator_) HAdd(Primitive::kPrimInt, basic_[0], constant1_); 415 new (&allocator_) HAdd(Primitive::kPrimInt, basic_[0], basic_[0]), 0); 417 new (&allocator_) HAdd(Primitive::kPrimInt, constant7_, basic_[0]), 0); 419 new (&allocator_) HAdd(Primitive::kPrimInt, add1, add2), 0) [all...] |
bounds_check_elimination_test.cc | 190 HInstruction* add = new (&allocator_) HAdd(Primitive::kPrimInt, parameter2, constant_max_int); 415 HInstruction* add = new (allocator) HAdd(Primitive::kPrimInt, phi, constant_increment); 525 HInstruction* add = new (allocator) HAdd(Primitive::kPrimInt, phi, constant_minus_1); 531 HInstruction* add_phi = new (allocator) HAdd(Primitive::kPrimInt, phi, constant_increment); 638 HInstruction* add = new (allocator) HAdd(Primitive::kPrimInt, phi, constant_increment); 739 HAdd(Primitive::kPrimInt, sub, constant_minus_1); 743 HInstruction* add = new (allocator) HAdd(Primitive::kPrimInt, phi, constant_1); [all...] |
load_store_analysis_test.cc | 200 HInstruction* add0 = new (&allocator_) HAdd(Primitive::kPrimInt, index, c0); 201 HInstruction* add1 = new (&allocator_) HAdd(Primitive::kPrimInt, index, c1); 290 HInstruction* add_0x80000000 = new (&allocator_) HAdd(Primitive::kPrimInt, index, c_0x80000000); 298 HInstruction* add_0x10 = new (&allocator_) HAdd(Primitive::kPrimInt, index, c_0x10); 306 HInstruction* add_0x7FFFFFFF = new (&allocator_) HAdd(Primitive::kPrimInt, index, c_0x7FFFFFFF); 314 HInstruction* add_0 = new (&allocator_) HAdd(Primitive::kPrimInt, index, c0);
|
scheduler_test.cc | 108 HInstruction* add1 = new (&allocator_) HAdd(Primitive::kPrimInt, c1, c2); 109 HInstruction* add2 = new (&allocator_) HAdd(Primitive::kPrimInt, add1, c2); 221 HInstruction* add0 = new (&allocator_) HAdd(Primitive::kPrimInt, i, c0); 222 HInstruction* add1 = new (&allocator_) HAdd(Primitive::kPrimInt, i, c1);
|
instruction_simplifier.cc | 81 void VisitAdd(HAdd* instruction) OVERRIDE; [all...] |
live_ranges_test.cc | 350 HAdd* add = liveness.GetInstructionFromSsaIndex(2)->AsAdd(); 428 HAdd* add = liveness.GetInstructionFromSsaIndex(2)->AsAdd();
|
pc_relative_fixups_x86.cc | 44 void VisitAdd(HAdd* add) OVERRIDE {
|
induction_var_range.cc | [all...] |
instruction_builder.cc | [all...] |
bounds_check_elimination.cc | [all...] |
loop_optimization.cc | 821 vector_index_ = new (global_allocator_) HAdd(induc_type, vector_index_, step); [all...] |
scheduler_arm.cc | 32 // HAdd and HSub long operations translate to ADDS+ADC or SUBS+SBC pairs, 48 void SchedulingLatencyVisitorARM::VisitAdd(HAdd* instr) {
|
induction_var_range_test.cc | 113 increment_ = new (&allocator_) HAdd(Primitive::kPrimInt, phi, graph_->GetIntConstant(stride)); [all...] |
nodes.h | [all...] |
code_generator_arm64.cc | [all...] |
code_generator_mips64.cc | [all...] |
/external/v8/src/crankshaft/ |
hydrogen-bce.cc | 40 HAdd* index = HAdd::cast(check->index()); 227 // index_raw can be HAdd(index_base, offset), HSub(index_base, offset),
|
hydrogen.cc | [all...] |
hydrogen-instructions.cc | [all...] |
/external/v8/src/ |
code-stubs-hydrogen.cc | 156 stack_pop_count = AddUncasted<HAdd>(stack_parameter_count, constant_one);
|
/external/v8/src/crankshaft/mips/ |
lithium-mips.cc | [all...] |
/external/v8/src/crankshaft/mips64/ |
lithium-mips64.cc | [all...] |
/external/v8/src/crankshaft/ia32/ |
lithium-ia32.h | [all...] |
/external/v8/src/crankshaft/x64/ |
lithium-x64.h | [all...] |
/external/v8/src/crankshaft/x87/ |
lithium-x87.h | [all...] |