Home
last modified time | relevance | path

Searched refs:InputCount (Results 1 – 25 of 77) sorted by relevance

1234

/external/v8/src/compiler/
Dnode.cc120 int const input_count = node->InputCount(); in Clone()
153 int input_count = InputCount(); in AppendInput()
187 DCHECK_LT(index, InputCount()); in InsertInput()
188 AppendInput(zone, InputAt(InputCount() - 1)); in InsertInput()
189 for (int i = InputCount() - 1; i > index; --i) { in InsertInput()
200 DCHECK_LT(index, InputCount()); in InsertInputs()
202 AppendInput(zone, InputAt(Max(InputCount() - count, 0))); in InsertInputs()
204 for (int i = InputCount() - count - 1; i >= Max(index, count); --i) { in InsertInputs()
215 DCHECK_LT(index, InputCount()); in RemoveInput()
216 for (; index < InputCount() - 1; ++index) { in RemoveInput()
[all …]
Dint64-lowering.cc50 if (top.input_index == top.node->InputCount()) { in LowerGraph()
163 if (node->InputCount() > 2) { in LowerNode()
218 if (node->InputCount() > 3) { in LowerNode()
254 DCHECK(node->InputCount() == 1); in LowerNode()
307 DCHECK(node->InputCount() == 2); in LowerNode()
321 DCHECK(node->InputCount() == 1); in LowerNode()
328 DCHECK(node->InputCount() == 2); in LowerNode()
348 DCHECK(node->InputCount() == 2); in LowerNode()
368 DCHECK(node->InputCount() == 2); in LowerNode()
388 DCHECK(node->InputCount() == 2); in LowerNode()
[all …]
Dvalue-numbering-reducer.cc20 size_t h = base::hash_combine(node->op()->HashCode(), node->InputCount()); in HashCode()
21 for (int j = 0; j < node->InputCount(); ++j) { in HashCode()
34 if (a->InputCount() != b->InputCount()) return false; in Equals()
35 for (int j = 0; j < a->InputCount(); ++j) { in Equals()
Dnode-matchers.cc36 if (merge->InputCount() != 2) return; in DiamondMatcher()
39 if (input0->InputCount() != 1) return; in DiamondMatcher()
41 if (input1->InputCount() != 1) return; in DiamondMatcher()
Dcommon-operator-reducer.cc171 if (node->InputCount() == 2) { in ReduceMerge()
198 int const input_count = node->InputCount() - 1; in ReduceEffectPhi()
202 DCHECK_EQ(input_count, merge->InputCount()); in ReduceEffectPhi()
222 int const input_count = node->InputCount() - 1; in ReducePhi()
226 DCHECK_EQ(input_count, merge->InputCount()); in ReducePhi()
303 int const control_input_count = control->InputCount(); in ReduceReturn()
305 DCHECK_EQ(control_input_count, value->InputCount() - 1); in ReduceReturn()
306 DCHECK_EQ(control_input_count, effect->InputCount() - 1); in ReduceReturn()
308 DCHECK_NE(0, graph()->end()->InputCount()); in ReduceReturn()
Dosr.cc96 if (orig->InputCount() == 0 || orig->opcode() == IrOpcode::kParameter || in PeelOuterLoopsForOsr()
109 copy = graph->NewNode(orig->op(), orig->InputCount(), &tmp_inputs[0]); in PeelOuterLoopsForOsr()
121 for (int j = 0; j < copy->InputCount(); j++) { in PeelOuterLoopsForOsr()
144 for (int i = 1; i < loop_header->InputCount(); i++) { in PeelOuterLoopsForOsr()
244 int const input_count = end->InputCount(); in PeelOuterLoopsForOsr()
249 NodeProperties::ChangeOp(end, common->End(end->InputCount())); in PeelOuterLoopsForOsr()
348 int const live_input_count = osr_loop->InputCount() - 1; in Deconstruct()
Ddead-code-elimination.cc43 int const input_count = node->InputCount(); in ReduceEnd()
68 int const input_count = node->InputCount(); in ReduceLoopOrMerge()
86 DCHECK_EQ(input_count + 1, use->InputCount()); in ReduceLoopOrMerge()
Dgraph-replay.cc30 for (int i = 0; i < node->InputCount(); ++i) { in PrintReplay()
38 for (int i = 0; i < node->InputCount(); i++) { in PrintReplay()
Dnode.h49 bool IsDead() const { return InputCount() > 0 && !InputAt(0); } in IsDead()
61 int InputCount() const { in InputCount() function
70 if (index < 0 || index >= InputCount()) { \
358 DCHECK_LT(index, use_->from()->InputCount()); in index()
431 return Node::InputEdges::iterator(this->node_, this->node_->InputCount()); in end()
474 return const_iterator(this->node_, this->node_->InputCount()); in end()
Dloop-peeling.cc132 Node* copy = graph->NewNode(node->op(), node->InputCount(), &inputs[0]); in CopyNodes()
142 for (int i = 0; i < copy->InputCount(); i++) { in CopyNodes()
234 int backedges = loop_node->InputCount() - 1; in Peel()
239 for (int i = 1; i < loop_node->InputCount(); i++) { in Peel()
Dloop-variable-optimizer.cc218 for (int i = 1; i < node->InputCount(); i++) { in VisitMerge()
356 induction_var->phi()->InputCount() - 1, in ChangeToInductionVariablePhis()
361 graph()->zone(), induction_var->phi()->InputCount() - 1, bound.bound); in ChangeToInductionVariablePhis()
365 graph()->zone(), induction_var->phi()->InputCount() - 1, bound.bound); in ChangeToInductionVariablePhis()
369 common()->InductionVariablePhi(induction_var->phi()->InputCount() - 1)); in ChangeToInductionVariablePhis()
Dgraph-reducer.cc117 int start = entry.input_index < node->InputCount() ? entry.input_index : 0; in ReduceTop()
118 for (int i = start; i < node->InputCount(); i++) { in ReduceTop()
142 for (int i = 0; i < node->InputCount(); ++i) { in ReduceTop()
Dstate-values-utils.cc47 if (key->count != static_cast<size_t>(node->InputCount())) { in IsKeysEqualToNode()
246 if (index >= node->InputCount()) { in Advance()
303 for (int i = 0; i < node_->InputCount(); i++) { in size()
Dlinkage.cc49 << "s" << d.StackParameterCount() << "i" << d.InputCount() << "f" in operator <<()
80 for (size_t i = 0; i < InputCount(); ++i) { in GetStackParameterDelta()
92 for (size_t i = 0; i < tail_caller->InputCount(); ++i) { in GetStackParameterDelta()
200 for (size_t i = 0; i < InputCount(); ++i) { in UsesOnlyRegisters()
Dsimd-scalar-lowering.cc46 if (top.input_index == top.node->InputCount()) { in LowerGraph()
149 DCHECK(node->InputCount() == 1); in LowerNode()
231 DCHECK(node->InputCount() == 2); in LowerNode()
265 DCHECK(node->InputCount() == 2); in LowerNode()
Dregister-allocator-verifier.cc16 return instr->InputCount() + instr->OutputCount() + instr->TempCount(); in OperandCount()
67 for (size_t i = 0; i < instr->InputCount(); ++i, ++count) { in RegisterAllocatorVerifier()
78 CHECK(instr->InputCount() > 0); in RegisterAllocatorVerifier()
128 for (size_t i = 0; i < instr->InputCount(); ++i, ++count) { in VerifyAssignment()
496 for (size_t i = 0; i < instr->InputCount(); ++i, ++count) { in VerifyGapMoves()
Dtail-call-optimization.cc69 DCHECK_EQ(4, node->InputCount()); in Reduce()
Dsimplified-operator-reducer.cc216 DCHECK_EQ(node->InputCount(), OperatorProperties::GetTotalInputCount(op)); in Change()
217 DCHECK_LE(1, node->InputCount()); in Change()
Dnode-matchers.h287 if (node->InputCount() < 2) return;
481 if (node->InputCount() < 2) return; in Initialize()
689 DCHECK_EQ(3, phi->InputCount()); in TrueInputOf()
696 DCHECK_EQ(3, phi->InputCount()); in FalseInputOf()
Dbranch-elimination.cc146 for (int i = 0; i < node->InputCount(); i++) { in ReduceMerge()
158 for (int i = 1; i < node->InputCount(); i++) { in ReduceMerge()
Dmove-optimizer.cc189 for (size_t i = 0; i < instruction->InputCount(); ++i) { in RemoveClobberedDestinations()
223 for (size_t i = 0; i < from->InputCount(); ++i) { in MigrateMoves()
395 for (size_t i = 0; i < last_instr->InputCount(); ++i) { in OptimizeMerge()
Dloop-analysis.cc198 Node* merge = node->InputAt(node->InputCount() - 1); in PropagateBackward()
215 for (int i = 0; i < node->InputCount(); i++) { in PropagateBackward()
259 if (node->InputCount() <= 1) continue; in SetLoopMarkForLoopHeader()
Descape-analysis-reducer.cc64 for (int i = 0; i < node->InputCount(); i++) { in Reduce()
239 for (int i = 0; i < node->InputCount(); ++i) { in ReduceFrameStateUses()
/external/v8/src/compiler/x64/
Dinstruction-scheduler-x64.cc149 DCHECK(instr->InputCount() >= 1); in GetTargetInstructionFlags()
160 DCHECK(instr->InputCount() >= 1); in GetTargetInstructionFlags()
/external/v8/src/crankshaft/
Dlithium-inl.h62 : instr_(instr), limit_(instr->InputCount()), current_(0) { in InputIterator()

1234