/art/compiler/optimizing/ |
escape.cc | 55 (user->IsInstanceFieldSet() && (reference == user->InputAt(1))) || 56 (user->IsUnresolvedInstanceFieldSet() && (reference == user->InputAt(1))) || 57 (user->IsStaticFieldSet() && (reference == user->InputAt(1))) || 58 (user->IsUnresolvedStaticFieldSet() && (reference == user->InputAt(0))) || 59 (user->IsArraySet() && (reference == user->InputAt(2)))) { 66 } else if ((user->IsUnresolvedInstanceFieldGet() && (reference == user->InputAt(0))) || 67 (user->IsUnresolvedInstanceFieldSet() && (reference == user->InputAt(0)))) {
|
x86_memory_gen.cc | 36 HArrayLength* array_len = check->InputAt(1)->AsArrayLength(); 43 HInstruction* array = array_len->InputAt(0); 47 if (array->IsConstant() || (array->IsNullCheck() && array->InputAt(0)->IsConstant())) {
|
nodes_x86.h | 48 return InputAt(0)->AsX86ComputeBaseMethodAddress(); 52 return InputAt(1)->AsConstant(); 75 return InputAt(1)->AsX86ComputeBaseMethodAddress(); 106 return InputAt(1)->AsX86ComputeBaseMethodAddress();
|
instruction_simplifier_shared.h | 35 return (instruction->IsShl() && instruction->AsShl()->InputAt(1)->IsIntConstant()) || 36 (instruction->IsShr() && instruction->AsShr()->InputAt(1)->IsIntConstant()) || 37 (instruction->IsUShr() && instruction->AsUShr()->InputAt(1)->IsIntConstant());
|
instruction_simplifier_arm64.cc | 49 left = use->InputAt(0); 50 right = use->InputAt(1); 53 right = use->AsNeg()->InputAt(0); 89 bitfield_op->InputAt(0), 176 if (instruction->InputAt(1)->IsConstant()) { 182 if (instruction->InputAt(1)->IsConstant()) { 202 if (instruction->InputAt(1)->IsConstant()) {
|
instruction_simplifier_arm.cc | 47 HInstruction* left = use->InputAt(0); 48 HInstruction* right = use->InputAt(1); 92 bitfield_op->InputAt(0), 207 if (instruction->InputAt(1)->IsConstant()) { 213 if (instruction->InputAt(1)->IsConstant()) { 233 if (instruction->InputAt(1)->IsConstant()) {
|
dead_code_elimination.cc | 43 HInstruction* condition = if_instruction->InputAt(0); 56 HInstruction* switch_input = switch_instruction->InputAt(0); 99 return (instruction->InputAt(0) == input) || 100 (instruction->InputAt(1) == input); 192 bool has_only_phi_and_if = (last == first) && (last->InputAt(0) == block->GetFirstPhi()); 198 (last->InputAt(0) == first) && 204 bool phi_input_is_left = (first->InputAt(0) == phi); 210 HInstruction* input = phi->InputAt(i); 219 value_to_check = Evaluate(first->AsCondition(), input, first->InputAt(1)); 221 value_to_check = Evaluate(first->AsCondition(), first->InputAt(0), input) [all...] |
select_generator.cc | 62 if (phi->InputAt(index1) != phi->InputAt(index2)) { 115 HInstruction* true_value = phi->InputAt(predecessor_index_true); 116 HInstruction* false_value = phi->InputAt(predecessor_index_false); 119 HSelect* select = new (graph_->GetArena()) HSelect(if_instruction->InputAt(0),
|
reference_type_propagation.cc | 146 DCHECK(instr->GetReferenceTypeInfo().IsEqual(instr->InputAt(0)->GetReferenceTypeInfo())) 148 << "Input(0) " << instr->InputAt(0)->GetReferenceTypeInfo(); 255 BoundTypeIn(receiver->InputAt(0), start_block, start_instruction, class_rti); 266 HInstruction* compare = check->InputAt(0); 270 HInstruction* input_one = compare->InputAt(0); 271 HInstruction* input_two = compare->InputAt(1); 291 HInstruction* receiver = field_get->InputAt(0); 365 HInstruction* ifInput = ifInstruction->InputAt(0); 369 HInstruction* input0 = ifInput->InputAt(0); 370 HInstruction* input1 = ifInput->InputAt(1) [all...] |
/external/v8/src/compiler/ |
simplified-operator-reducer.cc | 45 HeapObjectMatcher m(node->InputAt(0)); 48 if (m.IsBooleanNot()) return Replace(m.InputAt(0)); 52 Int32Matcher m(node->InputAt(0)); 55 if (m.IsChangeTaggedToBit()) return Replace(m.InputAt(0)); 59 HeapObjectMatcher m(node->InputAt(0)); 61 if (m.IsChangeBitToTagged()) return Replace(m.InputAt(0)); 65 Float64Matcher m(node->InputAt(0)); 67 if (m.IsChangeTaggedToFloat64()) return Replace(m.node()->InputAt(0)); 72 Int32Matcher m(node->InputAt(0)); 75 return Replace(m.InputAt(0)) [all...] |
select-lowering.cc | 27 Node* cond = node->InputAt(0); 28 Node* vthen = node->InputAt(1); 29 Node* velse = node->InputAt(2);
|
node-matchers.cc | 38 Node* input0 = merge->InputAt(0); 40 Node* input1 = merge->InputAt(1); 42 Node* branch = input0->InputAt(0); 43 if (branch != input1->InputAt(0)) return;
|
code-generator-impl.h | 31 return ToRegister(instr_->InputAt(index)); 35 return ToFloatRegister(instr_->InputAt(index)); 39 return ToDoubleRegister(instr_->InputAt(index)); 43 return ToSimd128Register(instr_->InputAt(index)); 46 double InputDouble(size_t index) { return ToDouble(instr_->InputAt(index)); } 48 float InputFloat32(size_t index) { return ToFloat32(instr_->InputAt(index)); } 51 return ToConstant(instr_->InputAt(index)).ToInt32(); 59 return ToConstant(instr_->InputAt(index)).ToInt64(); 87 return ToExternalReference(instr_->InputAt(index)); 91 return ToHeapObject(instr_->InputAt(index)) [all...] |
loop-peeling.cc | 143 copy->ReplaceInput(i, map(original->InputAt(i))); 179 unmarked_exit = (node->InputAt(1) != loop_node); 183 unmarked_exit = (node->InputAt(1)->InputAt(1) != loop_node); 223 peeling.Insert(node, node->InputAt(kAssumedLoopEntryIndex)); 240 inputs.push_back(peeling.map(loop_node->InputAt(i))); 250 inputs.push_back(peeling.map(node->InputAt(1 + i))); 267 node->ReplaceInput(0, peeling.map(node->InputAt(1))); 269 new_entry = peeling.map(loop_node->InputAt(1)); 280 exit->ReplaceInput(1, peeling.map(exit->InputAt(0))) [all...] |
int64-lowering.cc | 58 Node* input = top.node->InputAt(top.input_index++); 153 Node* base = node->InputAt(0); 154 Node* index = node->InputAt(1); 169 Node* effect_high = node->InputAt(2); 170 Node* control_high = node->InputAt(3); 202 Node* base = node->InputAt(0); 203 Node* index = node->InputAt(1); 207 Node* value = node->InputAt(2); 224 Node* effect_high = node->InputAt(3); 225 Node* control_high = node->InputAt(4) [all...] |
loop-variable-optimizer.cc | 217 VariableLimits* merged = limits_[node->InputAt(0)->id()]->Copy(zone()); 219 merged->Merge(limits_[node->InputAt(i)->id()]); 231 Node* branch = node->InputAt(0); 232 Node* cond = branch->InputAt(0); 257 Node* left = node->InputAt(0); 258 Node* right = node->InputAt(1); 303 Node* initial = phi->InputAt(0); 304 Node* arith = phi->InputAt(1); 317 if (arith->InputAt(0) != phi) { 318 if (arith->InputAt(0)->opcode() != IrOpcode::kJSToNumber | [all...] |
simplified-lowering.cc | 323 Node* input = current.node->InputAt(current.input_index); 398 Type* type = FeedbackTypeOf(node->InputAt(0)); 400 type = op_typer_.Merge(type, FeedbackTypeOf(node->InputAt(i))); 406 return op_typer_.Merge(FeedbackTypeOf(node->InputAt(1)), 407 FeedbackTypeOf(node->InputAt(2))); 422 if (GetInfo(node->InputAt(i))->feedback_type() == nullptr) { 431 new_type = op_typer_.Name(FeedbackTypeOf(node->InputAt(0)), \ 432 FeedbackTypeOf(node->InputAt(1))); \ 441 Type::Intersect(op_typer_.Name(FeedbackTypeOf(node->InputAt(0)), \ 442 FeedbackTypeOf(node->InputAt(1))), [all...] |
simd-scalar-lowering.cc | 54 Node* input = top.node->InputAt(top.input_index++); 152 Node* base = node->InputAt(0); 153 Node* index = node->InputAt(1); 161 Node* effect_input = node->InputAt(2); 162 Node* control_input = node->InputAt(3); 185 Node* base = node->InputAt(0); 186 Node* index = node->InputAt(1); 190 Node* value = node->InputAt(2); 199 Node* effect_input = node->InputAt(3); 200 Node* control_input = node->InputAt(4) [all...] |
common-operator-reducer.cc | 76 Node* const cond = node->InputAt(0); 84 DecideCondition(cond->InputAt(1)) == Decision::kFalse && 85 DecideCondition(cond->InputAt(2)) == Decision::kTrue)) { 101 node->ReplaceInput(0, cond->InputAt(0)); 109 Node* const control = node->InputAt(1); 139 NodeProperties::ReplaceValueInput(node, condition->InputAt(0), 0); 175 Node* if_true = node->InputAt(0); 176 Node* if_false = node->InputAt(1); 180 if_true->InputAt(0) == if_false->InputAt(0) && if_true->OwnedBy(node) & [all...] |
/external/v8/src/compiler/x87/ |
instruction-selector-x87.cc | 160 inputs[(*input_count)++] = UseRegister(node->InputAt(0)); 161 inputs[(*input_count)++] = UseRegister(node->InputAt(1)); 224 Node* base = node->InputAt(0); 225 Node* index = node->InputAt(1); 226 Node* value = node->InputAt(2); 335 Node* const buffer = node->InputAt(0); 336 Node* const offset = node->InputAt(1); 337 Node* const length = node->InputAt(2); 386 Node* const buffer = node->InputAt(0); 387 Node* const offset = node->InputAt(1) [all...] |
/external/v8/src/crankshaft/ |
lithium-inl.h | 72 DCHECK(instr_->InputAt(current_) != NULL); 73 return instr_->InputAt(current_); 85 LOperand* current = instr_->InputAt(current_);
|
/external/v8/src/compiler/ia32/ |
instruction-selector-ia32.cc | 156 inputs[(*input_count)++] = UseRegister(node->InputAt(0)); 157 inputs[(*input_count)++] = UseRegister(node->InputAt(1)); 172 selector->Emit(opcode, g.DefineAsRegister(node), g.Use(node->InputAt(0))); 180 g.UseRegister(node->InputAt(0))); 187 InstructionOperand operand0 = g.UseRegister(node->InputAt(0)); 188 InstructionOperand operand1 = g.Use(node->InputAt(1)); 263 Node* base = node->InputAt(0); 264 Node* index = node->InputAt(1); 265 Node* value = node->InputAt(2); 374 Node* const buffer = node->InputAt(0) [all...] |
/external/v8/src/compiler/mips/ |
instruction-selector-mips.cc | 127 g.UseRegister(node->InputAt(0)), 128 g.UseRegister(node->InputAt(1))); 136 g.UseRegister(node->InputAt(0))); 144 g.UseRegister(node->InputAt(0)), 145 g.UseOperand(node->InputAt(1), opcode)); 241 Node* base = node->InputAt(0); 242 Node* index = node->InputAt(1); 295 Node* base = node->InputAt(0); 296 Node* index = node->InputAt(1); 297 Node* value = node->InputAt(2) [all...] |
/external/v8/src/compiler/ppc/ |
instruction-selector-ppc.cc | 78 g.UseRegister(node->InputAt(0))); 85 g.UseRegister(node->InputAt(0)), 86 g.UseRegister(node->InputAt(1))); 93 g.UseRegister(node->InputAt(0)), 94 g.UseOperand(node->InputAt(1), operand_mode)); 102 InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; 181 Node* base = node->InputAt(0); 182 Node* offset = node->InputAt(1); 245 Node* base = node->InputAt(0); 246 Node* offset = node->InputAt(1) [all...] |
/external/v8/src/compiler/mips64/ |
instruction-selector-mips64.cc | 141 g.UseRegister(node->InputAt(0))); 149 g.UseRegister(node->InputAt(0)), 150 g.UseRegister(node->InputAt(1))); 158 g.UseRegister(node->InputAt(0)), 159 g.UseOperand(node->InputAt(1), opcode)); 210 Node* offset = load->InputAt(1); 211 base_ = load->InputAt(0); 336 Node* base = node->InputAt(0); 337 Node* index = node->InputAt(1); 400 Node* base = node->InputAt(0) [all...] |