Home
last modified time | relevance | path

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

123

/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.cc52 if (top.input_index == top.node->InputCount()) { in LowerGraph()
121 DCHECK_EQ(5, node->InputCount()); in LowerWord64AtomicBinop()
197 if (node->InputCount() > 2) { in LowerNode()
252 if (node->InputCount() > 3) { in LowerNode()
286 DCHECK_EQ(1, node->InputCount()); in LowerNode()
317 int input_count = node->InputCount(); in LowerNode()
319 if (input_count != node->InputCount()) { in LowerNode()
386 DCHECK_EQ(2, node->InputCount()); in LowerNode()
400 DCHECK_EQ(1, node->InputCount()); in LowerNode()
407 DCHECK_EQ(2, node->InputCount()); in LowerNode()
[all …]
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()
Dsimd-scalar-lowering.cc51 if (top.input_index == top.node->InputCount()) { in LowerGraph()
383 if (node->InputCount() > 2) { in LowerLoadOp()
384 DCHECK_LT(3, node->InputCount()); in LowerLoadOp()
407 DCHECK_LT(2, node->InputCount()); in LowerStoreOp()
450 if (node->InputCount() > 3) { in LowerStoreOp()
451 DCHECK_LT(4, node->InputCount()); in LowerStoreOp()
476 DCHECK_EQ(2, node->InputCount()); in LowerBinaryOp()
498 DCHECK_EQ(2, node->InputCount()); in LowerCompareOp()
534 DCHECK_EQ(2, node->InputCount()); in LowerBinaryOpForSmallInt()
570 DCHECK_EQ(2, node->InputCount()); in LowerSaturateBinaryOp()
[all …]
Dloop-variable-optimizer.cc142 for (int i = 1; i < node->InputCount(); i++) { in VisitMerge()
293 induction_var->phi()->InputCount() - 1, in ChangeToInductionVariablePhis()
298 graph()->zone(), induction_var->phi()->InputCount() - 1, bound.bound); in ChangeToInductionVariablePhis()
302 graph()->zone(), induction_var->phi()->InputCount() - 1, bound.bound); in ChangeToInductionVariablePhis()
306 common()->InductionVariablePhi(induction_var->phi()->InputCount() - 1)); in ChangeToInductionVariablePhis()
Dloop-peeling.cc139 Node* copy = graph->NewNode(node->op(), node->InputCount(), &inputs[0]); in CopyNodes()
149 for (int i = 0; i < copy->InputCount(); i++) { in CopyNodes()
239 int backedges = loop_node->InputCount() - 1; in Peel()
244 for (int i = 1; i < loop_node->InputCount(); i++) { in Peel()
Descape-analysis-reducer.cc154 for (int i = 0; i < node->InputCount(); ++i) { in ReduceFrameStateInputs()
375 int tmp_input_count = tmp_->InputCount(); in Constructor()
420 int from_input_count = from_->InputCount(); in MutableNode()
421 int tmp_input_count = tmp_->InputCount(); in MutableNode()
Dregister-allocator-verifier.cc18 return instr->InputCount() + instr->OutputCount() + instr->TempCount(); in OperandCount()
69 for (size_t i = 0; i < instr->InputCount(); ++i, ++count) { in RegisterAllocatorVerifier()
80 CHECK_LT(0, instr->InputCount()); in RegisterAllocatorVerifier()
131 for (size_t i = 0; i < instr->InputCount(); ++i, ++count) { in VerifyAssignment()
508 for (size_t i = 0; i < instr->InputCount(); ++i, ++count) { in VerifyGapMoves()
Dcommon-operator-reducer.cc183 if (node->InputCount() == 2) { in ReduceMerge()
215 DCHECK_EQ(effect_input_count, merge->InputCount()); in ReduceEffectPhi()
240 DCHECK_EQ(value_input_count, merge->InputCount()); in ReducePhi()
349 DCHECK_NE(0, graph()->end()->InputCount()); in ReduceReturn()
Dnode-properties.cc219 graph->end()->set_op(common->End(graph->end()->InputCount())); in MergeControlToEnd()
658 size_t h = base::hash_combine(node->op()->HashCode(), node->InputCount()); in HashCode()
672 if (a->InputCount() != b->InputCount()) return false; in Equals()
Dlinkage.cc51 << "s" << d.StackParameterCount() << "i" << d.InputCount() << "f" in operator <<()
80 for (size_t i = 0; i < InputCount(); ++i) { in GetFirstUnusedStackSlot()
203 for (size_t i = 0; i < InputCount(); ++i) { in UsesOnlyRegisters()
Dsimplified-operator-reducer.cc231 DCHECK_EQ(node->InputCount(), OperatorProperties::GetTotalInputCount(op)); in Change()
232 DCHECK_LE(1, node->InputCount()); in Change()
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()
Dnode-matchers.h294 if (node->InputCount() < 2) return;
487 if (node->InputCount() < 2) return; in Initialize()
734 DCHECK_EQ(3, phi->InputCount()); in TrueInputOf()
741 DCHECK_EQ(3, phi->InputCount()); in FalseInputOf()
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()
Dnode.h61 int InputCount() const { in InputCount() function
70 if (index < 0 || index >= InputCount()) { \
365 DCHECK_LT(index, use_->from()->InputCount()); in index()
Djs-inlining-heuristic.cc229 for (int i = 0; i < state_values->InputCount(); i++) { in CollectStateValuesOwnedUses()
254 for (int i = 0; i < state_values->InputCount(); i++) { in DuplicateStateValuesAndRename()
626 int const input_count = node->InputCount(); in InlineCandidate()
Dcommon-operator.cc258 parent->InputCount()); in InputIterator()
285 real_index_ >= parent_->InputCount()); in IsEnd()
295 DCHECK(IsDense() || CountReal() == node->InputCount()); in IterateOverInputs()
1425 call_descriptor->InputCount() + in Call()
1449 call_descriptor->InputCount() + in CallWithCallerSavedRegisters()
1473 call_descriptor->InputCount() + in TailCall()
Dinstruction.h818 size_t InputCount() const { return InputCountField::decode(bit_field_); } in InputCount() function
820 DCHECK(i < InputCount()); in InputAt()
824 DCHECK(i < InputCount()); in InputAt()
831 return &operands_[OutputCount() + InputCount() + i]; in TempAt()
835 return &operands_[OutputCount() + InputCount() + i]; in TempAt()
Dsimplified-lowering.cc197 input_use_infos_.resize(node->InputCount(), UseInfo::None()); in SetAndCheckInput()
327 while (current.input_index < current.node->InputCount()) { in RunTypePropagationPhase()
823 for (int i = tagged_count; i < node->InputCount(); i++) { in VisitInputs()
840 for (int i = tagged_limit; i < node->InputCount(); i++) { in VisitReturn()
873 for (int i = 2; i < node->InputCount(); i++) { in VisitBinop()
907 DCHECK_EQ(0, node->InputCount()); in VisitLeaf()
997 for (int i = 0; i < node->InputCount(); i++) { in VisitPhi()
1091 for (int i = 0; i < node->InputCount(); i++) { in VisitStateValues()
1098 ZoneVector<MachineType>(node->InputCount(), zone); in VisitStateValues()
1099 for (int i = 0; i < node->InputCount(); i++) { in VisitStateValues()
[all …]
Dcode-generator.cc610 RpoNumber true_rpo = i.InputRpo(instr->InputCount() - 2); in ComputeBranchInfo()
611 RpoNumber false_rpo = i.InputRpo(instr->InputCount() - 1); in ComputeBranchInfo()
752 *slot = g.InputInt32(instr->InputCount() - 1); in GetSlotAboveSPBeforeTailCall()
874 RpoNumber handler_rpo = i.InputRpo(instr->InputCount() - 1); in RecordCallPosition()
Dinstruction-scheduler.cc179 for (size_t i = 0; i < instr->InputCount(); ++i) { in AddInstruction()
/external/freetype/src/otvalid/
Dotvcommn.c797 FT_UInt BacktrackCount, InputCount, LookaheadCount; in otv_x_ux_y_uy_z_uz_p_sp() local
811 InputCount = FT_NEXT_USHORT( p ); in otv_x_ux_y_uy_z_uz_p_sp()
812 if ( InputCount == 0 ) in otv_x_ux_y_uy_z_uz_p_sp()
815 OTV_TRACE(( " (InputCount = %d)\n", InputCount )); in otv_x_ux_y_uy_z_uz_p_sp()
817 OTV_LIMIT_CHECK( InputCount * 2 ); in otv_x_ux_y_uy_z_uz_p_sp()
818 p += ( InputCount - 1 ) * 2; in otv_x_ux_y_uy_z_uz_p_sp()
835 if ( FT_NEXT_USHORT( p ) >= InputCount ) in otv_x_ux_y_uy_z_uz_p_sp()
/external/v8/src/compiler/x64/
Dinstruction-scheduler-x64.cc238 DCHECK_LE(1, instr->InputCount()); in GetTargetInstructionFlags()
248 DCHECK_LE(1, instr->InputCount()); in GetTargetInstructionFlags()
/external/v8/src/compiler/ia32/
Dcode-generator-ia32.cc461 Operand src1 = i.InputOperand(instr->InputCount() == 2 ? 1 : 0); \
3249 if (instr->InputCount() == 5) { // only one input operand in AssembleArchInstruction()
3257 DCHECK_EQ(6, instr->InputCount()); in AssembleArchInstruction()
3287 DCHECK_EQ(2, instr->InputCount()); in AssembleArchInstruction()
3292 DCHECK_EQ(4, instr->InputCount()); // Swizzles should be handled above. in AssembleArchInstruction()
3396 if (instr->InputCount() == 2) { in AssembleArchInstruction()
3409 if (instr->InputCount() == 2) { in AssembleArchInstruction()
3423 if (instr->InputCount() == 2) { in AssembleArchInstruction()
3436 if (instr->InputCount() == 2) { in AssembleArchInstruction()
3449 if (instr->InputCount() == 2) { in AssembleArchInstruction()
[all …]

123