Home
last modified time | relevance | path

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

1234

/external/v8/src/compiler/
Dsimplified-operator-reducer.cc47 HeapObjectMatcher m(node->InputAt(0)); in Reduce()
50 if (m.IsBooleanNot()) return Replace(m.InputAt(0)); in Reduce()
54 Int32Matcher m(node->InputAt(0)); in Reduce()
57 if (m.IsChangeTaggedToBit()) return Replace(m.InputAt(0)); in Reduce()
61 HeapObjectMatcher m(node->InputAt(0)); in Reduce()
65 if (m.IsChangeBitToTagged()) return Replace(m.InputAt(0)); in Reduce()
69 Float64Matcher m(node->InputAt(0)); in Reduce()
71 if (m.IsChangeTaggedToFloat64()) return Replace(m.node()->InputAt(0)); in Reduce()
76 Int32Matcher m(node->InputAt(0)); in Reduce()
79 return Replace(m.InputAt(0)); in Reduce()
[all …]
Dint64-lowering.cc62 Node* input = top.node->InputAt(top.input_index++); in LowerGraph()
129 Node* value = node->InputAt(2); in LowerWord64AtomicBinop()
187 Node* base = node->InputAt(0); in LowerNode()
188 Node* index = node->InputAt(1); in LowerNode()
203 Node* effect_high = node->InputAt(2); in LowerNode()
204 Node* control_high = node->InputAt(3); in LowerNode()
237 Node* base = node->InputAt(0); in LowerNode()
238 Node* index = node->InputAt(1); in LowerNode()
242 Node* value = node->InputAt(2); in LowerNode()
259 Node* effect_high = node->InputAt(3); in LowerNode()
[all …]
Dcommon-operator-reducer.cc86 Node* const cond = node->InputAt(0); in ReduceBranch()
94 DecideCondition(broker(), cond->InputAt(1)) == Decision::kFalse && in ReduceBranch()
95 DecideCondition(broker(), cond->InputAt(2)) == Decision::kTrue)) { in ReduceBranch()
111 node->ReplaceInput(0, cond->InputAt(0)); in ReduceBranch()
119 Node* const control = node->InputAt(1); in ReduceBranch()
149 NodeProperties::ReplaceValueInput(node, condition->InputAt(0), 0); in ReduceDeoptimizeConditional()
187 Node* if_true = node->InputAt(0); in ReduceMerge()
188 Node* if_false = node->InputAt(1); in ReduceMerge()
192 if_true->InputAt(0) == if_false->InputAt(0) && if_true->OwnedBy(node) && in ReduceMerge()
194 Node* const branch = if_true->InputAt(0); in ReduceMerge()
[all …]
Ddecompression-optimizer.cc72 MaybeMarkAndQueueForRevisit(node->InputAt(0), in MarkNodeInputs()
77 MaybeMarkAndQueueForRevisit(node->InputAt(0), in MarkNodeInputs()
89 MaybeMarkAndQueueForRevisit(node->InputAt(0), in MarkNodeInputs()
91 MaybeMarkAndQueueForRevisit(node->InputAt(1), in MarkNodeInputs()
100 MaybeMarkAndQueueForRevisit(node->InputAt(0), in MarkNodeInputs()
102 MaybeMarkAndQueueForRevisit(node->InputAt(1), in MarkNodeInputs()
108 node->InputAt(2), in MarkNodeInputs()
122 MaybeMarkAndQueueForRevisit(node->InputAt(i), in MarkNodeInputs()
130 MaybeMarkAndQueueForRevisit(node->InputAt(i), curr_state); in MarkNodeInputs()
138 MaybeMarkAndQueueForRevisit(node->InputAt(i), in MarkNodeInputs()
[all …]
Dloop-peeling.cc150 copy->ReplaceInput(i, map(original->InputAt(i))); in CopyNodes()
186 unmarked_exit = (node->InputAt(1) != loop_node); in CanPeel()
190 unmarked_exit = (node->InputAt(1)->InputAt(1) != loop_node); in CanPeel()
227 peeling.Insert(node, node->InputAt(kAssumedLoopEntryIndex)); in Peel()
245 inputs.push_back(peeling.map(loop_node->InputAt(i))); in Peel()
255 inputs.push_back(peeling.map(node->InputAt(1 + i))); in Peel()
272 node->ReplaceInput(0, peeling.map(node->InputAt(1))); in Peel()
274 new_entry = peeling.map(loop_node->InputAt(1)); in Peel()
285 exit->ReplaceInput(1, peeling.map(exit->InputAt(0))); in Peel()
290 exit->InsertInput(graph_->zone(), 1, peeling.map(exit->InputAt(0))); in Peel()
[all …]
Dtype-narrowing-reducer.cc28 Type left_type = NodeProperties::GetType(node->InputAt(0)); in Reduce()
29 Type right_type = NodeProperties::GetType(node->InputAt(1)); in Reduce()
43 node->op(), NodeProperties::GetType(node->InputAt(0))); in Reduce()
49 new_type = op_typer_.Name(NodeProperties::GetType(node->InputAt(0)), \ in Reduce()
50 NodeProperties::GetType(node->InputAt(1))); \ in Reduce()
59 new_type = op_typer_.Name(NodeProperties::GetType(node->InputAt(0))); \ in Reduce()
Dsimplified-lowering.cc336 Type type = FeedbackTypeOf(node->InputAt(0)); in TypePhi()
338 type = op_typer_.Merge(type, FeedbackTypeOf(node->InputAt(i))); in TypePhi()
344 return op_typer_.Merge(FeedbackTypeOf(node->InputAt(1)), in TypeSelect()
345 FeedbackTypeOf(node->InputAt(2))); in TypeSelect()
356 if (GetInfo(node->InputAt(i))->feedback_type().IsInvalid()) { in UpdateFeedbackType()
369 if (node->InputCount() > 0) input0_type = FeedbackTypeOf(node->InputAt(0)); in UpdateFeedbackType()
371 if (node->InputCount() > 1) input1_type = FeedbackTypeOf(node->InputAt(1)); in UpdateFeedbackType()
444 FeedbackTypeOf(node->InputAt(0))); in UpdateFeedbackType()
449 FeedbackTypeOf(node->InputAt(0))); in UpdateFeedbackType()
547 Node* input = node->InputAt(current.input_index); in GenerateTraversal()
[all …]
Dloop-variable-optimizer.cc141 VariableLimits merged = limits_.Get(node->InputAt(0)); in VisitMerge()
143 merged.ResetToCommonAncestor(limits_.Get(node->InputAt(i))); in VisitMerge()
155 Node* branch = node->InputAt(0); in VisitIf()
156 Node* cond = branch->InputAt(0); in VisitIf()
185 Node* left = node->InputAt(0); in AddCmpToLimits()
186 Node* right = node->InputAt(1); in AddCmpToLimits()
227 Node* initial = phi->InputAt(0); in TryGetInductionVariable()
228 Node* arith = phi->InputAt(1); in TryGetInductionVariable()
245 Node* input = arith->InputAt(0); in TryGetInductionVariable()
249 input = input->InputAt(0); in TryGetInductionVariable()
[all …]
Deffect-control-linearizer.cc373 Node* input = node->InputAt(i); in UpdateEffectPhi()
425 edge.UpdateTo(node->InputAt(0)); in RemoveRenameNode()
554 inputs[index] = phi->InputAt(index); in TryCloneBranch()
1387 Node* value = node->InputAt(0); in LowerChangeFloat64ToTagged()
1438 Node* value = node->InputAt(0); in LowerChangeFloat64ToTaggedPointer()
1443 Node* value = node->InputAt(0); in LowerChangeBitToTagged()
1459 Node* value = node->InputAt(0); in LowerChangeInt31ToTaggedSigned()
1464 Node* value = node->InputAt(0); in LowerChangeInt32ToTagged()
1485 Node* value = node->InputAt(0); in LowerChangeInt64ToTagged()
1510 Node* value = node->InputAt(0); in LowerChangeUint32ToTagged()
[all …]
Dsimd-scalar-lowering.cc92 Node* input = top.node->InputAt(top.input_index++); in LowerGraph()
550 Node* base = node->InputAt(0); in LowerLoadOp()
551 Node* index = node->InputAt(1); in LowerLoadOp()
561 Node* effect_input = node->InputAt(2); in LowerLoadOp()
562 Node* control_input = node->InputAt(3); in LowerLoadOp()
638 Node* base = node->InputAt(0); in LowerLoadTransformOp()
639 Node* index = node->InputAt(1); in LowerLoadTransformOp()
642 Node* effect_input = node->InputAt(2); in LowerLoadTransformOp()
643 Node* control_input = node->InputAt(3); in LowerLoadTransformOp()
712 SimdType rep_type = ReplacementType(node->InputAt(2)); in LowerStoreOp()
[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()
Dmachine-operator-reducer.cc279 return ReduceProjection(ProjectionIndexOf(node->op()), node->InputAt(0)); in Reduce()
485 if (m.right().InputAt(0)->opcode() == IrOpcode::kFloat32Sub) { in Reduce()
486 Float32BinopMatcher mright0(m.right().InputAt(0)); in Reduce()
532 if (m.right().InputAt(0)->opcode() == IrOpcode::kFloat64Sub) { in Reduce()
533 Float64BinopMatcher mright0(m.right().InputAt(0)); in Reduce()
625 Float64Matcher m(node->InputAt(0)); in Reduce()
631 Float64Matcher m(node->InputAt(0)); in Reduce()
637 Float64Matcher m(node->InputAt(0)); in Reduce()
643 Float64Matcher m(node->InputAt(0)); in Reduce()
649 Float64Matcher m(node->InputAt(0)); in Reduce()
[all …]
Dnode-matchers.h37 Node* InputAt(int index) const { return node()->InputAt(index); } in InputAt() function
261 : NodeMatcher(node), object_(InputAt(0)), index_(InputAt(1)) {} in LoadMatcher()
280 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) { in BinopMatcher()
284 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) { in BinopMatcher()
424 return this->left().node()->InputAt(0); in IndexInput()
743 if (from->InputAt(2) == node) return false; in OwnedByAddressingOperand()
791 DCHECK_EQ(Merge(), phi->InputAt(2)); in TrueInputOf()
792 return phi->InputAt(if_true_ == Merge()->InputAt(0) ? 0 : 1); in TrueInputOf()
798 DCHECK_EQ(Merge(), phi->InputAt(2)); in FalseInputOf()
799 return phi->InputAt(if_true_ == Merge()->InputAt(0) ? 1 : 0); in FalseInputOf()
Dselect-lowering.cc33 Node* condition = node->InputAt(0); in LowerSelect()
34 Node* vtrue = node->InputAt(1); in LowerSelect()
35 Node* vfalse = node->InputAt(2); in LowerSelect()
Dnode.cc207 AppendInput(zone, InputAt(InputCount() - 1)); in InsertInput()
209 ReplaceInput(i, InputAt(i - 1)); in InsertInput()
221 AppendInput(zone, InputAt(std::max(InputCount() - count, 0))); in InsertInputs()
224 ReplaceInput(i, InputAt(i - count)); in InsertInputs()
235 Node* result = InputAt(index); in RemoveInput()
237 ReplaceInput(index, InputAt(index + 1)); in RemoveInput()
280 Node* dummy = InputAt(current_count - 1); in EnsureInputCount()
377 if (n.InputAt(i)) { in operator <<()
378 os << n.InputAt(i)->id(); in operator <<()
446 DCHECK_EQ(this->InputAt(index), input); in Verify()
[all …]
/external/v8/src/compiler/backend/ia32/
Dinstruction-selector-ia32.cc187 UseRegisterWithMode(node->InputAt(0), register_mode); in GetEffectiveAddressMemoryOperand()
189 UseRegisterWithMode(node->InputAt(1), register_mode); in GetEffectiveAddressMemoryOperand()
214 Node* input = node->InputAt(0); in VisitRO()
225 selector->Emit(opcode, g.DefineAsRegister(node), g.Use(node->InputAt(0)), in VisitROWithTemp()
234 g.UseUniqueRegister(node->InputAt(0)), arraysize(temps), in VisitROWithTempSimd()
242 g.UseRegister(node->InputAt(0))); in VisitRR()
248 InstructionOperand operand0 = g.UseRegister(node->InputAt(0)); in VisitRROFloat()
249 InstructionOperand operand1 = g.Use(node->InputAt(1)); in VisitRROFloat()
273 InstructionOperand operand0 = g.UseRegister(node->InputAt(0)); in VisitRRSimd()
288 InstructionOperand operand0 = g.UseRegister(node->InputAt(0)); in VisitRROSimd()
[all …]
/external/v8/src/compiler/backend/mips/
Dinstruction-selector-mips.cc112 g.UseRegister(node->InputAt(0)), in VisitRRR()
113 g.UseRegister(node->InputAt(1))); in VisitRRR()
120 g.UseUniqueRegister(node->InputAt(0)), in VisitUniqueRRR()
121 g.UseUniqueRegister(node->InputAt(1))); in VisitUniqueRRR()
127 opcode, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(0)), in VisitRRRR()
128 g.UseRegister(node->InputAt(1)), g.UseRegister(node->InputAt(2))); in VisitRRRR()
135 g.UseRegister(node->InputAt(0))); in VisitRR()
143 g.UseRegister(node->InputAt(0)), g.UseImmediate(imm)); in VisitRRI()
151 g.UseRegister(node->InputAt(0)), g.UseImmediate(imm), in VisitRRIR()
152 g.UseRegister(node->InputAt(1))); in VisitRRIR()
[all …]
Dinstruction-scheduler-mips.cc1453 return AdduLatency(instr->InputAt(1)->IsRegister()); in GetInstructionLatency()
1455 return AndLatency(instr->InputAt(1)->IsRegister()); in GetInstructionLatency()
1457 return OrLatency(instr->InputAt(1)->IsRegister()); in GetInstructionLatency()
1459 return XorLatency(instr->InputAt(1)->IsRegister()); in GetInstructionLatency()
1461 return SubuLatency(instr->InputAt(1)->IsRegister()); in GetInstructionLatency()
1463 return NorLatency(instr->InputAt(1)->IsRegister()); in GetInstructionLatency()
1471 return MulhLatency(instr->InputAt(1)->IsRegister()); in GetInstructionLatency()
1473 return MulhuLatency(instr->InputAt(1)->IsRegister()); in GetInstructionLatency()
1477 return ModLatency(instr->InputAt(1)->IsRegister()); in GetInstructionLatency()
1479 return ModuLatency(instr->InputAt(1)->IsRegister()); in GetInstructionLatency()
[all …]
/external/v8/src/compiler/backend/x64/
Dinstruction-selector-x64.cc222 inputs[(*input_count)++] = UseRegister(operand->InputAt(0)); in GetEffectiveAddressMemoryOperand()
223 inputs[(*input_count)++] = UseRegister(operand->InputAt(1)); in GetEffectiveAddressMemoryOperand()
346 Emit(kArchAbortCSAAssert, g.NoOutput(), g.UseFixed(node->InputAt(0), rdx)); in VisitAbortCSAAssert()
372 inputs[input_count++] = g.UseRegister(node->InputAt(2)); in VisitLoadLane()
470 Node* base = node->InputAt(0); in VisitStore()
471 Node* index = node->InputAt(1); in VisitStore()
472 Node* value = node->InputAt(2); in VisitStore()
508 value = value->InputAt(0); in VisitStore()
520 Node* value = node->InputAt(2); in VisitProtectedStore()
570 InstructionOperand value_operand = g.UseRegister(node->InputAt(2)); in VisitStoreLane()
[all …]
/external/v8/src/compiler/backend/
Dcode-generator-impl.h30 return ToRegister(instr_->InputAt(index)); in InputRegister()
34 return ToFloatRegister(instr_->InputAt(index)); in InputFloatRegister()
38 return ToDoubleRegister(instr_->InputAt(index)); in InputDoubleRegister()
42 return ToSimd128Register(instr_->InputAt(index)); in InputSimd128Register()
45 double InputDouble(size_t index) { return ToDouble(instr_->InputAt(index)); } in InputDouble()
47 float InputFloat32(size_t index) { return ToFloat32(instr_->InputAt(index)); } in InputFloat32()
50 return ToConstant(instr_->InputAt(index)).ToInt32(); in InputInt32()
58 return ToConstant(instr_->InputAt(index)).ToInt64(); in InputInt64()
90 return ToExternalReference(instr_->InputAt(index)); in InputExternalReference()
94 return ToCode(instr_->InputAt(index)); in InputCode()
[all …]
/external/v8/src/compiler/backend/arm/
Dinstruction-selector-arm.cc84 g.UseRegister(node->InputAt(0))); in VisitRR()
90 g.UseRegister(node->InputAt(0)), in VisitRRR()
91 g.UseRegister(node->InputAt(1))); in VisitRRR()
97 Int32Matcher m(node->InputAt(1)); in VisitSimdShiftRRR()
103 g.UseRegister(node->InputAt(0)), in VisitSimdShiftRRR()
104 g.UseImmediate(node->InputAt(1))); in VisitSimdShiftRRR()
109 g.UseUniqueRegister(node->InputAt(0)), in VisitSimdShiftRRR()
110 g.UseRegister(node->InputAt(1)), arraysize(temps), temps); in VisitSimdShiftRRR()
123 Node* in0 = node->InputAt(0); in VisitRRRShuffle()
124 Node* in1 = node->InputAt(1); in VisitRRRShuffle()
[all …]
/external/v8/src/compiler/backend/mips64/
Dinstruction-selector-mips64.cc124 g.UseRegister(node->InputAt(0))); in VisitRR()
132 g.UseRegister(node->InputAt(0)), g.UseImmediate(imm)); in VisitRRI()
138 if (g.IsIntegerConstant(node->InputAt(1))) { in VisitSimdShift()
140 g.UseRegister(node->InputAt(0)), in VisitSimdShift()
141 g.UseImmediate(node->InputAt(1))); in VisitSimdShift()
144 g.UseRegister(node->InputAt(0)), in VisitSimdShift()
145 g.UseRegister(node->InputAt(1))); in VisitSimdShift()
154 g.UseRegister(node->InputAt(0)), g.UseImmediate(imm), in VisitRRIR()
155 g.UseRegister(node->InputAt(1))); in VisitRRIR()
162 g.UseRegister(node->InputAt(0)), in VisitRRR()
[all …]
/external/v8/src/compiler/backend/ppc/
Dinstruction-selector-ppc.cc76 g.UseRegister(node->InputAt(0))); in VisitRR()
83 g.UseRegister(node->InputAt(0)), in VisitRRR()
84 g.UseRegister(node->InputAt(1))); in VisitRRR()
91 g.UseRegister(node->InputAt(0)), in VisitRRO()
92 g.UseOperand(node->InputAt(1), operand_mode)); in VisitRRO()
99 InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; in VisitTryTruncateDouble()
167 Emit(kArchAbortCSAAssert, g.NoOutput(), g.UseFixed(node->InputAt(0), r4)); in VisitAbortCSAAssert()
173 Node* base = node->InputAt(0); in VisitLoad()
174 Node* offset = node->InputAt(1); in VisitLoad()
263 Node* base = node->InputAt(0); in VisitStore()
[all …]
/external/v8/src/compiler/backend/arm64/
Dinstruction-selector-arm64.cc144 g.UseRegister(node->InputAt(0))); in VisitRR()
151 g.UseRegister(node->InputAt(0))); in VisitRR()
157 g.UseRegister(node->InputAt(0)), in VisitRRR()
158 g.UseRegister(node->InputAt(1))); in VisitRRR()
165 g.UseRegister(node->InputAt(0)), in VisitRRR()
166 g.UseRegister(node->InputAt(1))); in VisitRRR()
172 if (g.IsIntegerConstant(node->InputAt(1))) { in VisitSimdShiftRRR()
173 if (g.GetIntegerConstantValue(node->InputAt(1)) % width == 0) { in VisitSimdShiftRRR()
177 g.UseRegister(node->InputAt(0)), in VisitSimdShiftRRR()
178 g.UseImmediate(node->InputAt(1))); in VisitSimdShiftRRR()
[all …]
/external/v8/src/compiler/backend/s390/
Dinstruction-selector-s390.cc230 inputs[(*input_count)++] = UseRegister(operand->InputAt(0)); in GetEffectiveAddressMemoryOperand()
231 inputs[(*input_count)++] = UseRegister(operand->InputAt(1)); in GetEffectiveAddressMemoryOperand()
435 InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))}; in VisitTryTruncateDouble()
583 Node* input = node->InputAt(0); in VISIT_OP_LIST()
691 Emit(kArchAbortCSAAssert, g.NoOutput(), g.UseFixed(node->InputAt(0), r3)); in VisitAbortCSAAssert()
721 Node* base = node->InputAt(0); in VisitGeneralStore()
722 Node* offset = node->InputAt(1); in VisitGeneralStore()
723 Node* value = node->InputAt(2); in VisitGeneralStore()
770 value = value->InputAt(0); in VisitGeneralStore()
790 value = value->InputAt(0); in VisitGeneralStore()
[all …]

1234