Home
last modified time | relevance | path

Searched refs:InputCount (Results 1 - 25 of 65) sorted by relevance

123

/third_party/node/deps/v8/src/compiler/
H A Dnode.cc137 int const input_count = node->InputCount(); in Clone()
171 int const input_count = InputCount(); in AppendInput()
206 DCHECK_LT(index, InputCount()); in InsertInput()
207 AppendInput(zone, InputAt(InputCount() - 1)); in InsertInput()
208 for (int i = InputCount() - 1; i > index; --i) { in InsertInput()
219 DCHECK_LT(index, InputCount()); in InsertInputs()
221 AppendInput(zone, InputAt(std::max(InputCount() - count, 0))); in InsertInputs()
223 for (int i = InputCount() - count - 1; i >= std::max(index, count); --i) { in InsertInputs()
234 DCHECK_LT(index, InputCount()); in RemoveInput()
236 for (; index < InputCount() in RemoveInput()
[all...]
H A Dint64-lowering.cc55 if (top.input_index == top.node->InputCount()) { in LowerGraph()
127 DCHECK_EQ(5, node->InputCount()); in LowerWord64AtomicBinop()
174 if (node->InputCount() > 2) { in LowerLoadOperator()
211 if (node->InputCount() > 3) { in LowerStoreOperator()
320 DCHECK_EQ(1, node->InputCount()); in LowerNode()
351 int input_count = node->InputCount(); in LowerNode()
353 if (input_count != node->InputCount()) { in LowerNode()
419 DCHECK_EQ(2, node->InputCount()); in LowerNode()
433 DCHECK_EQ(1, node->InputCount()); in LowerNode()
440 DCHECK_EQ(2, node->InputCount()); in LowerNode()
[all...]
H A 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()
H A Dwasm-loop-peeling.cc24 if (loop_node->InputCount() < 2) return; in PeelWasmLoop()
110 common->Merge(peeled_iteration_header->InputCount())); in PeelWasmLoop()
118 use_edge.from()->InputCount() - /* control input */ 1); in PeelWasmLoop()
H A Dloop-unrolling.cc24 if (loop_node->InputCount() < 2) return; in UnrollLoop()
166 for (int input_index = 1; input_index < loop_node->InputCount(); in UnrollLoop()
185 common->Merge(loop_node->InputCount() - 1)); in UnrollLoop()
H A Dloop-variable-optimizer.cc142 for (int i = 1; i < node->InputCount(); i++) { in VisitMerge()
297 induction_var->phi()->InputCount() - 1, in ChangeToInductionVariablePhis()
302 graph()->zone(), induction_var->phi()->InputCount() - 1, bound.bound); in ChangeToInductionVariablePhis()
306 graph()->zone(), induction_var->phi()->InputCount() - 1, bound.bound); in ChangeToInductionVariablePhis()
310 common()->InductionVariablePhi(induction_var->phi()->InputCount() - 1)); in ChangeToInductionVariablePhis()
H A Dnode-properties.cc158 graph->end()->set_op(common->End(graph->end()->InputCount())); in MergeControlToEnd()
174 graph->end()->set_op(common->End(graph->end()->InputCount())); in RemoveControlFromEnd()
644 size_t h = base::hash_combine(node->op()->HashCode(), node->InputCount()); in HashCode()
658 if (a->InputCount() != b->InputCount()) return false; in Equals()
H A Descape-analysis-reducer.cc146 for (int i = 0; i < node->InputCount(); ++i) { in ReduceFrameStateInputs()
379 int tmp_input_count = tmp_->InputCount(); in Constructor()
424 int from_input_count = from_->InputCount(); in MutableNode()
425 int tmp_input_count = tmp_->InputCount(); in MutableNode()
H A Dloop-peeling.cc151 int backedges = loop_node->InputCount() - 1; in Peel()
156 for (int i = 1; i < loop_node->InputCount(); i++) { in Peel()
H A Dcommon-operator-reducer.cc189 if (node->InputCount() == 2) { in ReduceMerge()
221 DCHECK_EQ(effect_input_count, merge->InputCount()); in ReduceEffectPhi()
246 DCHECK_EQ(value_input_count, merge->InputCount()); in ReducePhi()
354 DCHECK_NE(0, graph()->end()->InputCount()); in ReduceReturn()
H A Dnode.h60 int InputCount() const { in InputCount() function in v8::internal::compiler::final
73 DCHECK_LT(index, InputCount()); in InputAt()
79 DCHECK_LT(index, InputCount()); in ReplaceInput()
428 DCHECK_LT(index, use_->from()->InputCount()); in index()
H A Dsimplified-operator-reducer.cc277 DCHECK_EQ(node->InputCount(), OperatorProperties::GetTotalInputCount(op)); in Change()
278 DCHECK_LE(1, node->InputCount()); in Change()
H A Dnode-matchers.h360 if (node->InputCount() < 2) return; in ScaleMatcher()
553 if (node->InputCount() < 2) return; in Initialize()
816 DCHECK_EQ(3, phi->InputCount()); in TrueInputOf()
823 DCHECK_EQ(3, phi->InputCount()); in FalseInputOf()
H A Dlinkage.cc68 << "s" << d.ParameterSlotCount() << "i" << d.InputCount() << "f" in operator <<()
105 for (size_t i = 0; i < InputCount(); ++i) { in GetOffsetToFirstUnusedStackSlot()
144 for (size_t i = 0; i < InputCount(); ++i) { in GetTaggedParameterSlots()
H A Dmemory-optimizer.cc126 for (int i = 1; i < control->InputCount(); ++i) { in CanLoopAllocate()
418 int const input_count = node->InputCount() - 1; in EnqueueMerge()
H A Djs-inlining-heuristic.cc323 for (int i = 0; i < state_values->InputCount(); i++) { in CollectStateValuesOwnedUses()
348 for (int i = 0; i < state_values->InputCount(); i++) { in DuplicateStateValuesAndRename()
724 int const input_count = node->InputCount(); in InlineCandidate()
H A Dloop-analysis.cc213 Node* merge = node->InputAt(node->InputCount() - 1); in PropagateBackward()
230 for (int i = 0; i < node->InputCount(); i++) { in PropagateBackward()
282 if (node->InputCount() <= 1) continue; in SetLoopMarkForLoopHeader()
H A Ddecompression-optimizer.cc150 for (int i = node->op()->ValueInputCount(); i < node->InputCount(); ++i) { in MarkNodeInputs()
H A Dloop-analysis.h244 for (int i = 0; i < copy->InputCount(); i++) { in CopyNodes()
/third_party/skia/third_party/externals/freetype/src/otvalid/
H A Dotvcommn.c800 FT_UInt BacktrackCount, InputCount, LookaheadCount; in otv_x_ux_y_uy_z_uz_p_sp() local
814 InputCount = FT_NEXT_USHORT( p ); in otv_x_ux_y_uy_z_uz_p_sp()
815 if ( InputCount == 0 ) in otv_x_ux_y_uy_z_uz_p_sp()
818 OTV_TRACE(( " (InputCount = %d)\n", InputCount )); in otv_x_ux_y_uy_z_uz_p_sp()
820 OTV_LIMIT_CHECK( InputCount * 2 ); in otv_x_ux_y_uy_z_uz_p_sp()
821 p += ( InputCount - 1 ) * 2; in otv_x_ux_y_uy_z_uz_p_sp()
838 if ( FT_NEXT_USHORT( p ) >= InputCount ) in otv_x_ux_y_uy_z_uz_p_sp()
/third_party/node/deps/v8/src/compiler/backend/ia32/
H A Dcode-generator-ia32.cc487 Operand src1 = i.InputOperand(instr->InputCount() == 2 ? 1 : 0); \
3042 if (instr->InputCount() == 5) { // only one input operand in AssembleArchInstruction()
3050 DCHECK_EQ(6, instr->InputCount()); in AssembleArchInstruction()
3134 DCHECK_EQ(2, instr->InputCount()); in AssembleArchInstruction()
3139 DCHECK_EQ(4, instr->InputCount()); // Swizzles should be handled above. in AssembleArchInstruction()
3243 if (instr->InputCount() == 2) { in AssembleArchInstruction()
3256 if (instr->InputCount() == 2) { in AssembleArchInstruction()
3270 if (instr->InputCount() == 2) { in AssembleArchInstruction()
3283 if (instr->InputCount() == 2) { in AssembleArchInstruction()
3296 if (instr->InputCount() in AssembleArchInstruction()
[all...]
/third_party/node/deps/v8/src/compiler/backend/
H A Dregister-allocator-verifier.cc18 return instr->InputCount() + instr->OutputCount() + instr->TempCount(); in OperandCount()
83 for (size_t i = 0; i < instr->InputCount(); ++i, ++count) { in RegisterAllocatorVerifier()
95 CHECK_LT(input_index, instr->InputCount()); in RegisterAllocatorVerifier()
144 for (size_t i = 0; i < instr->InputCount(); ++i, ++count) { in VerifyAssignment()
567 for (size_t i = 0; i < instr->InputCount(); ++i, ++count) { in VerifyGapMoves()
H A Dmove-optimizer.cc186 for (size_t i = 0; i < instruction->InputCount(); ++i) { in RemoveClobberedDestinations()
220 for (size_t i = 0; i < from->InputCount(); ++i) { in MigrateMoves()
390 for (size_t i = 0; i < last_instr->InputCount(); ++i) { in OptimizeMerge()
/third_party/node/deps/v8/src/compiler/backend/x64/
H A Dinstruction-scheduler-x64.cc374 DCHECK_LE(1, instr->InputCount()); in GetTargetInstructionFlags()
388 DCHECK_LE(1, instr->InputCount()); in GetTargetInstructionFlags()
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-ir.h833 template <size_t InputCount, class Derived>
835 static constexpr size_t kInputCount = InputCount;
865 template <size_t InputCount, class Derived>
867 static constexpr size_t kInputCount = InputCount;
1501 template <size_t InputCount, class Derived>
1504 static constexpr size_t kInputCount = InputCount;

Completed in 28 milliseconds

123