Home
last modified time | relevance | path

Searched refs:InputAt (Results 1 – 25 of 99) sorted by relevance

1234

/external/v8/src/compiler/
Dsimplified-operator-reducer.cc45 HeapObjectMatcher m(node->InputAt(0)); in Reduce()
48 if (m.IsBooleanNot()) return Replace(m.InputAt(0)); in Reduce()
52 Int32Matcher m(node->InputAt(0)); in Reduce()
55 if (m.IsChangeTaggedToBit()) return Replace(m.InputAt(0)); in Reduce()
59 HeapObjectMatcher m(node->InputAt(0)); in Reduce()
61 if (m.IsChangeBitToTagged()) return Replace(m.InputAt(0)); in Reduce()
65 Float64Matcher m(node->InputAt(0)); in Reduce()
67 if (m.IsChangeTaggedToFloat64()) return Replace(m.node()->InputAt(0)); in Reduce()
72 Int32Matcher m(node->InputAt(0)); in Reduce()
75 return Replace(m.InputAt(0)); in Reduce()
[all …]
Dcommon-operator-reducer.cc76 Node* const cond = node->InputAt(0); in ReduceBranch()
84 DecideCondition(cond->InputAt(1)) == Decision::kFalse && in ReduceBranch()
85 DecideCondition(cond->InputAt(2)) == Decision::kTrue)) { in ReduceBranch()
101 node->ReplaceInput(0, cond->InputAt(0)); in ReduceBranch()
109 Node* const control = node->InputAt(1); in ReduceBranch()
139 NodeProperties::ReplaceValueInput(node, condition->InputAt(0), 0); in ReduceDeoptimizeConditional()
175 Node* if_true = node->InputAt(0); in ReduceMerge()
176 Node* if_false = node->InputAt(1); in ReduceMerge()
180 if_true->InputAt(0) == if_false->InputAt(0) && if_true->OwnedBy(node) && in ReduceMerge()
182 Node* const branch = if_true->InputAt(0); in ReduceMerge()
[all …]
Dint64-lowering.cc57 Node* input = top.node->InputAt(top.input_index++); in LowerGraph()
148 Node* base = node->InputAt(0); in LowerNode()
149 Node* index = node->InputAt(1); in LowerNode()
164 Node* effect_high = node->InputAt(2); in LowerNode()
165 Node* control_high = node->InputAt(3); in LowerNode()
197 Node* base = node->InputAt(0); in LowerNode()
198 Node* index = node->InputAt(1); in LowerNode()
202 Node* value = node->InputAt(2); in LowerNode()
219 Node* effect_high = node->InputAt(3); in LowerNode()
220 Node* control_high = node->InputAt(4); in LowerNode()
[all …]
Dcode-generator-impl.h31 return ToRegister(instr_->InputAt(index)); in InputRegister()
35 return ToFloatRegister(instr_->InputAt(index)); in InputFloatRegister()
39 return ToDoubleRegister(instr_->InputAt(index)); in InputDoubleRegister()
43 return ToSimd128Register(instr_->InputAt(index)); in InputSimd128Register()
46 double InputDouble(size_t index) { return ToDouble(instr_->InputAt(index)); } in InputDouble()
48 float InputFloat32(size_t index) { return ToFloat32(instr_->InputAt(index)); } in InputFloat32()
51 return ToConstant(instr_->InputAt(index)).ToInt32(); in InputInt32()
59 return ToConstant(instr_->InputAt(index)).ToInt64(); in InputInt64()
79 return ToExternalReference(instr_->InputAt(index)); in InputExternalReference()
83 return ToHeapObject(instr_->InputAt(index)); in InputHeapObject()
[all …]
Dsimplified-lowering.cc297 Node* input = current.node->InputAt(current.input_index); in RunTypePropagationPhase()
372 Type* type = FeedbackTypeOf(node->InputAt(0)); in TypePhi()
374 type = op_typer_.Merge(type, FeedbackTypeOf(node->InputAt(i))); in TypePhi()
380 return op_typer_.Merge(FeedbackTypeOf(node->InputAt(1)), in TypeSelect()
381 FeedbackTypeOf(node->InputAt(2))); in TypeSelect()
396 if (GetInfo(node->InputAt(i))->feedback_type() == nullptr) { in UpdateFeedbackType()
405 new_type = op_typer_.Name(FeedbackTypeOf(node->InputAt(0)), \ in UpdateFeedbackType()
406 FeedbackTypeOf(node->InputAt(1))); \ in UpdateFeedbackType()
415 Type::Intersect(op_typer_.Name(FeedbackTypeOf(node->InputAt(0)), \ in UpdateFeedbackType()
416 FeedbackTypeOf(node->InputAt(1))), \ in UpdateFeedbackType()
[all …]
Dloop-peeling.cc143 copy->ReplaceInput(i, map(original->InputAt(i))); in CopyNodes()
179 unmarked_exit = (node->InputAt(1) != loop_node); in CanPeel()
183 unmarked_exit = (node->InputAt(1)->InputAt(1) != loop_node); in CanPeel()
223 peeling.Insert(node, node->InputAt(kAssumedLoopEntryIndex)); in Peel()
240 inputs.push_back(peeling.map(loop_node->InputAt(i))); in Peel()
250 inputs.push_back(peeling.map(node->InputAt(1 + i))); in Peel()
267 node->ReplaceInput(0, peeling.map(node->InputAt(1))); in Peel()
269 new_entry = peeling.map(loop_node->InputAt(1)); in Peel()
280 exit->ReplaceInput(1, peeling.map(exit->InputAt(0))); in Peel()
285 exit->InsertInput(graph->zone(), 1, peeling.map(exit->InputAt(0))); in Peel()
[all …]
Ddead-code-elimination.cc47 Node* const input = node->InputAt(i); in ReduceEnd()
76 node->InputAt(0)->opcode() != IrOpcode::kDead) { in ReduceLoopOrMerge()
78 Node* const input = node->InputAt(i); in ReduceLoopOrMerge()
87 use->ReplaceInput(live_input_count, use->InputAt(i)); in ReduceLoopOrMerge()
100 Replace(use, use->InputAt(0)); in ReduceLoopOrMerge()
102 use->InputAt(1) == node) { in ReduceLoopOrMerge()
109 return Replace(node->InputAt(0)); in ReduceLoopOrMerge()
134 Replace(use, use->InputAt(0)); in RemoveLoopExit()
Dloop-variable-optimizer.cc217 VariableLimits* merged = limits_[node->InputAt(0)->id()]->Copy(zone()); in VisitMerge()
219 merged->Merge(limits_[node->InputAt(i)->id()]); in VisitMerge()
231 Node* branch = node->InputAt(0); in VisitIf()
232 Node* cond = branch->InputAt(0); in VisitIf()
257 Node* left = node->InputAt(0); in AddCmpToLimits()
258 Node* right = node->InputAt(1); in AddCmpToLimits()
303 Node* initial = phi->InputAt(0); in TryGetInductionVariable()
304 Node* arith = phi->InputAt(1); in TryGetInductionVariable()
315 if (arith->InputAt(0) != phi) { in TryGetInductionVariable()
316 if (arith->InputAt(0)->opcode() != IrOpcode::kJSToNumber || in TryGetInductionVariable()
[all …]
Dsimd-scalar-lowering.cc53 Node* input = top.node->InputAt(top.input_index++); in LowerGraph()
219 GetReplacementsWithType(node->InputAt(i), rep_type); in LowerNode()
232 Node** rep_left = GetReplacementsWithType(node->InputAt(0), rep_type); in LowerNode()
233 Node** rep_right = GetReplacementsWithType(node->InputAt(1), rep_type); in LowerNode()
246 DCHECK(!HasReplacement(1, node->InputAt(i))); in LowerNode()
247 rep_node[i] = node->InputAt(i); in LowerNode()
254 Node* laneNode = node->InputAt(1); in LowerNode()
258 GetReplacementsWithType(node->InputAt(0), rep_type)[lane], nullptr, in LowerNode()
266 Node** rep_left = GetReplacementsWithType(node->InputAt(0), rep_type); in LowerNode()
267 Node** rep_right = GetReplacementsWithType(node->InputAt(1), rep_type); in LowerNode()
[all …]
Dmachine-operator-reducer.cc148 return ReduceProjection(ProjectionIndexOf(node->op()), node->InputAt(0)); in Reduce()
335 if (m.right().InputAt(0)->opcode() == IrOpcode::kFloat32Sub) { in Reduce()
336 Float32BinopMatcher mright0(m.right().InputAt(0)); in Reduce()
378 if (m.right().InputAt(0)->opcode() == IrOpcode::kFloat64Sub) { in Reduce()
379 Float64BinopMatcher mright0(m.right().InputAt(0)); in Reduce()
459 Float64Matcher m(node->InputAt(0)); in Reduce()
464 Float64Matcher m(node->InputAt(0)); in Reduce()
469 Float64Matcher m(node->InputAt(0)); in Reduce()
474 Float64Matcher m(node->InputAt(0)); in Reduce()
479 Float64Matcher m(node->InputAt(0)); in Reduce()
[all …]
Dnode-matchers.cc38 Node* input0 = merge->InputAt(0); in DiamondMatcher()
40 Node* input1 = merge->InputAt(1); in DiamondMatcher()
42 Node* branch = input0->InputAt(0); in DiamondMatcher()
43 if (branch != input1->InputAt(0)) return; in DiamondMatcher()
Dstate-values-utils.cc51 if (key->values[i] != node->InputAt(static_cast<int>(i))) { in IsKeysEqualToNode()
254 } else if (node->InputAt(index)->opcode() == IrOpcode::kStateValues || in Advance()
255 node->InputAt(index)->opcode() == IrOpcode::kTypedStateValues) { in Advance()
257 Push(node->InputAt(index)); in Advance()
267 return Top()->node->InputAt(Top()->index); in node()
304 if (node_->InputAt(i)->opcode() == IrOpcode::kStateValues || in size()
305 node_->InputAt(i)->opcode() == IrOpcode::kTypedStateValues) { in size()
306 count += StateValuesAccess(node_->InputAt(i)).size(); in size()
Dnode-matchers.h33 Node* InputAt(int index) const { return node()->InputAt(index); } in InputAt() function
216 : NodeMatcher(node), object_(InputAt(0)), index_(InputAt(1)) {} in LoadMatcher()
235 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) { in BinopMatcher()
239 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) { in BinopMatcher()
363 return this->left().node()->InputAt(0); in IndexInput()
690 DCHECK_EQ(Merge(), phi->InputAt(2)); in TrueInputOf()
691 return phi->InputAt(if_true_ == Merge()->InputAt(0) ? 0 : 1); in TrueInputOf()
697 DCHECK_EQ(Merge(), phi->InputAt(2)); in FalseInputOf()
698 return phi->InputAt(if_true_ == Merge()->InputAt(0) ? 1 : 0); in FalseInputOf()
Dselect-lowering.cc27 Node* cond = node->InputAt(0); in Reduce()
28 Node* vthen = node->InputAt(1); in Reduce()
29 Node* velse = node->InputAt(2); in Reduce()
Deffect-control-linearizer.cc84 Node* input = node->InputAt(i); in UpdateEffectPhi()
143 edge.UpdateTo(node->InputAt(0)); in RemoveRegionNode()
270 inputs[index] = phi->InputAt(index); in TryCloneBranch()
552 DCHECK_EQ(IrOpcode::kCall, node->InputAt(0)->opcode()); in ProcessNode()
556 DCHECK(!NodeProperties::IsExceptionalCall(node->InputAt(0))); in ProcessNode()
811 Node* value = node->InputAt(0); in LowerChangeFloat64ToTagged()
819 Node* value = node->InputAt(0); in LowerChangeFloat64ToTaggedPointer()
826 Node* value = node->InputAt(0); in LowerChangeBitToTagged()
847 Node* value = node->InputAt(0); in LowerChangeInt31ToTaggedSigned()
855 Node* value = node->InputAt(0); in LowerChangeInt32ToTagged()
[all …]
/external/v8/src/compiler/x87/
Dinstruction-selector-x87.cc160 inputs[(*input_count)++] = UseRegister(node->InputAt(0)); in GetEffectiveAddressMemoryOperand()
161 inputs[(*input_count)++] = UseRegister(node->InputAt(1)); in GetEffectiveAddressMemoryOperand()
221 Node* base = node->InputAt(0); in VisitStore()
222 Node* index = node->InputAt(1); in VisitStore()
223 Node* value = node->InputAt(2); in VisitStore()
324 Node* const buffer = node->InputAt(0); in VisitCheckedLoad()
325 Node* const offset = node->InputAt(1); in VisitCheckedLoad()
326 Node* const length = node->InputAt(2); in VisitCheckedLoad()
372 Node* const buffer = node->InputAt(0); in VisitCheckedStore()
373 Node* const offset = node->InputAt(1); in VisitCheckedStore()
[all …]
/external/v8/src/compiler/ia32/
Dinstruction-selector-ia32.cc156 inputs[(*input_count)++] = UseRegister(node->InputAt(0)); in GetEffectiveAddressMemoryOperand()
157 inputs[(*input_count)++] = UseRegister(node->InputAt(1)); in GetEffectiveAddressMemoryOperand()
172 selector->Emit(opcode, g.DefineAsRegister(node), g.Use(node->InputAt(0))); in VisitRO()
180 g.UseRegister(node->InputAt(0))); in VisitRR()
187 InstructionOperand operand0 = g.UseRegister(node->InputAt(0)); in VisitRROFloat()
188 InstructionOperand operand1 = g.Use(node->InputAt(1)); in VisitRROFloat()
260 Node* base = node->InputAt(0); in VisitStore()
261 Node* index = node->InputAt(1); in VisitStore()
262 Node* value = node->InputAt(2); in VisitStore()
363 Node* const buffer = node->InputAt(0); in VisitCheckedLoad()
[all …]
/external/v8/src/compiler/mips/
Dinstruction-selector-mips.cc127 g.UseRegister(node->InputAt(0)), in VisitRRR()
128 g.UseRegister(node->InputAt(1))); in VisitRRR()
136 g.UseRegister(node->InputAt(0))); in VisitRR()
144 g.UseRegister(node->InputAt(0)), in VisitRRO()
145 g.UseOperand(node->InputAt(1), opcode)); in VisitRRO()
240 Node* base = node->InputAt(0); in VisitLoad()
241 Node* index = node->InputAt(1); in VisitLoad()
291 Node* base = node->InputAt(0); in VisitStore()
292 Node* index = node->InputAt(1); in VisitStore()
293 Node* value = node->InputAt(2); in VisitStore()
[all …]
/external/v8/src/compiler/x64/
Dinstruction-selector-x64.cc162 inputs[(*input_count)++] = UseRegister(operand->InputAt(0)); in GetEffectiveAddressMemoryOperand()
163 inputs[(*input_count)++] = UseRegister(operand->InputAt(1)); in GetEffectiveAddressMemoryOperand()
237 inputs[input_count++] = g.UseUniqueRegister(node->InputAt(2)); in VisitProtectedLoad()
239 inputs[input_count++] = g.UseImmediate(node->InputAt(3)); in VisitProtectedLoad()
246 Node* base = node->InputAt(0); in VisitStore()
247 Node* index = node->InputAt(1); in VisitStore()
248 Node* value = node->InputAt(2); in VisitStore()
342 Node* const buffer = node->InputAt(0); in VisitCheckedLoad()
343 Node* const offset = node->InputAt(1); in VisitCheckedLoad()
344 Node* const length = node->InputAt(2); in VisitCheckedLoad()
[all …]
Dcode-generator-x64.cc31 return ToImmediate(instr_->InputAt(index)); in InputImmediate()
35 return ToOperand(instr_->InputAt(index), extra); in InputOperand()
160 return instr->InputAt(index)->IsImmediate(); in HasImmediateInput()
321 if (instr->InputAt(0)->IsRegister()) { \
327 if (instr->InputAt(1)->IsRegister()) { \
347 if (instr->InputAt(0)->IsRegister()) { \
353 if (instr->InputAt(1)->IsRegister()) { \
365 if (instr->InputAt(0)->IsRegister()) { \
373 if (instr->InputAt(1)->IsRegister()) { \
404 } else if (instr->InputAt(0)->IsRegister()) { \
[all …]
/external/v8/src/compiler/s390/
Dinstruction-selector-s390.cc140 inputs[(*input_count)++] = UseRegister(operand->InputAt(0)); in GetEffectiveAddressMemoryOperand()
141 inputs[(*input_count)++] = UseRegister(operand->InputAt(1)); in GetEffectiveAddressMemoryOperand()
164 g.UseRegister(node->InputAt(0))); in VisitRR()
170 g.UseRegister(node->InputAt(0)), in VisitRRR()
171 g.UseRegister(node->InputAt(1))); in VisitRRR()
178 g.UseRegister(node->InputAt(0)), in VisitRRO()
179 g.UseOperand(node->InputAt(1), operand_mode)); in VisitRRO()
186 InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; in VisitTryTruncateDouble()
337 Node* base = node->InputAt(0); in VisitStore()
338 Node* offset = node->InputAt(1); in VisitStore()
[all …]
/external/v8/src/compiler/ppc/
Dinstruction-selector-ppc.cc78 g.UseRegister(node->InputAt(0))); in VisitRR()
85 g.UseRegister(node->InputAt(0)), in VisitRRR()
86 g.UseRegister(node->InputAt(1))); in VisitRRR()
93 g.UseRegister(node->InputAt(0)), in VisitRRO()
94 g.UseOperand(node->InputAt(1), operand_mode)); in VisitRRO()
102 InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; in VisitTryTruncateDouble()
178 Node* base = node->InputAt(0); in VisitLoad()
179 Node* offset = node->InputAt(1); in VisitLoad()
239 Node* base = node->InputAt(0); in VisitStore()
240 Node* offset = node->InputAt(1); in VisitStore()
[all …]
/external/v8/src/compiler/mips64/
Dinstruction-selector-mips64.cc115 g.UseRegister(node->InputAt(0))); in VisitRR()
123 g.UseRegister(node->InputAt(0)), in VisitRRR()
124 g.UseRegister(node->InputAt(1))); in VisitRRR()
132 g.UseRegister(node->InputAt(0)), in VisitRRO()
133 g.UseOperand(node->InputAt(1), opcode)); in VisitRRO()
174 Node* offset = load->InputAt(1); in Initialize()
175 base_ = load->InputAt(0); in Initialize()
298 Node* base = node->InputAt(0); in EmitLoad()
299 Node* index = node->InputAt(1); in EmitLoad()
359 Node* base = node->InputAt(0); in VisitStore()
[all …]
/external/v8/src/compiler/arm/
Dinstruction-selector-arm.cc84 g.UseRegister(node->InputAt(0))); in VisitRR()
91 g.UseRegister(node->InputAt(0)), in VisitRRR()
92 g.UseRegister(node->InputAt(1))); in VisitRRR()
380 Node* base = node->InputAt(0); in VisitLoad()
381 Node* index = node->InputAt(1); in VisitLoad()
422 Node* base = node->InputAt(0); in VisitStore()
423 Node* index = node->InputAt(1); in VisitStore()
424 Node* value = node->InputAt(2); in VisitStore()
508 Node* base = node->InputAt(0); in VisitUnalignedLoad()
509 Node* index = node->InputAt(1); in VisitUnalignedLoad()
[all …]
/external/v8/src/compiler/arm64/
Dinstruction-selector-arm64.cc144 g.UseRegister(node->InputAt(0))); in VisitRR()
151 g.UseRegister(node->InputAt(0)), in VisitRRR()
152 g.UseRegister(node->InputAt(1))); in VisitRRR()
160 g.UseRegister(node->InputAt(0)), in VisitRRO()
161 g.UseOperand(node->InputAt(1), operand_mode)); in VisitRRO()
202 Node* offset = load->InputAt(1); in Initialize()
203 base_ = load->InputAt(0); in Initialize()
242 if (!g.IsIntegerConstant(input_node->InputAt(1))) return false; in TryMatchAnyShift()
317 Node* left = index->InputAt(0); in TryMatchLoadStoreShift()
318 Node* right = index->InputAt(1); in TryMatchLoadStoreShift()
[all …]

1234