Home
last modified time | relevance | path

Searched refs:ValueInputCount (Results 1 - 25 of 31) sorted by relevance

12

/third_party/node/deps/v8/src/compiler/
H A Ddecompression-optimizer.cc71 DCHECK_EQ(node->op()->ValueInputCount(), 1); in MarkNodeInputs()
76 DCHECK_EQ(node->op()->ValueInputCount(), 1); in MarkNodeInputs()
88 DCHECK_EQ(node->op()->ValueInputCount(), 2); in MarkNodeInputs()
99 DCHECK_EQ(node->op()->ValueInputCount(), 3); in MarkNodeInputs()
124 for (int i = 0; i < node->op()->ValueInputCount(); ++i) { in MarkNodeInputs()
132 for (int i = 0; i < node->op()->ValueInputCount(); ++i) { in MarkNodeInputs()
140 for (int i = 0; i < node->op()->ValueInputCount(); ++i) { in MarkNodeInputs()
150 for (int i = node->op()->ValueInputCount(); i < node->InputCount(); ++i) { in MarkNodeInputs()
190 node, common()->Phi(mach_rep, node->op()->ValueInputCount())); in ChangePhi()
H A Dnode-properties.cc29 node->op()->ValueInputCount()); in IsValueEdge()
94 CHECK_LT(index, node->op()->ValueInputCount()); in ReplaceValueInput()
101 int value_input_count = node->op()->ValueInputCount(); in ReplaceValueInputs()
141 node->TrimInputCount(node->op()->ValueInputCount()); in RemoveNonValueInputs()
147 int value_input_count = node->op()->ValueInputCount(); in RemoveValueInputs()
597 int input_count = node->op()->ValueInputCount(); in AllValueInputsAreTyped()
H A Dnode-properties.h39 return FirstValueIndex(node) + node->op()->ValueInputCount(); in PastValueIndex()
65 CHECK_LT(index, node->op()->ValueInputCount()); in GetValueInput()
71 CHECK_LT(index, node->op()->ValueInputCount()); in GetValueInput()
H A Dmachine-graph-verifier.cc642 for (int j = 0; j < node->op()->ValueInputCount(); ++j) { in Run()
647 for (int j = 0; j < node->op()->ValueInputCount(); ++j) { in Run()
657 for (int j = 0; j < node->op()->ValueInputCount(); ++j) { in Run()
662 for (int j = 0; j < node->op()->ValueInputCount(); ++j) { in Run()
667 for (int j = 0; j < node->op()->ValueInputCount(); ++j) { in Run()
715 if (node->op()->ValueInputCount() != 0) { in Run()
H A Dsimplified-lowering.cc380 int arity = node->op()->ValueInputCount(); in TypePhi()
400 for (int i = 0; i < node->op()->ValueInputCount(); i++) { in UpdateFeedbackType()
825 DCHECK_EQ(1, node->op()->ValueInputCount()); in InputCannotBe()
830 DCHECK_EQ(1, node->op()->ValueInputCount()); in InputIs()
843 DCHECK_EQ(2, node->op()->ValueInputCount()); in BothInputsAre()
854 DCHECK_EQ(2, node->op()->ValueInputCount()); in OneInputCannotBe()
870 node->TrimInputCount(dead_value->ValueInputCount()); in ChangeToDeadValue()
897 DCHECK_EQ(new_op->ValueInputCount(), node->op()->ValueInputCount()); in ChangeToPureOp()
907 node->TrimInputCount(new_op->ValueInputCount()); in ChangeToPureOp()
[all...]
H A Doperator.h102 int ValueInputCount() const { return value_in_; } in ValueInputCount() function in v8::internal::compiler::Operator
H A Dloop-unrolling.cc192 ? use->op()->ValueInputCount() in UnrollLoop()
H A Doperator-properties.cc266 return op->ValueInputCount() + GetContextInputCount(op) + in GetTotalInputCount()
H A Dcsa-load-elimination.cc20 if (node->op()->ValueInputCount() > 0) { in Reduce()
22 for (int i = 0; i < node->op()->ValueInputCount(); ++i) { in Reduce()
H A Djs-inlining-heuristic.cc107 int const value_input_count = m.node()->op()->ValueInputCount(); in CollectFunctions()
506 int const num_calls = callee->op()->ValueInputCount(); in TryReuseDispatch()
H A Dloop-variable-optimizer.cc224 DCHECK_EQ(2, phi->op()->ValueInputCount()); in TryGetInductionVariable()
H A Dredundancy-elimination.cc207 for (int i = a->op()->ValueInputCount(); --i >= 0;) { in CheckSubsumes()
H A Descape-analysis-reducer.cc177 for (int i = 0; i < node->op()->ValueInputCount(); ++i) { in ReduceDeoptState()
H A Ddead-code-elimination.cc223 int input_count = node->op()->ValueInputCount(); in ReducePhi()
H A Dgraph-visualizer.cc350 os_ << ",\"opinfo\":\"" << node->op()->ValueInputCount() << " v " in PrintNode()
546 PrintInputs(&i, node->op()->ValueInputCount(), " "); in PrintInputs()
H A Draw-machine-assembler.cc178 DCHECK_EQ(phi->op()->ValueInputCount(), block->PredecessorCount()); in OptimizeControlFlow()
399 int value_count = phi->op()->ValueInputCount(); in MakePhiBinary()
H A Dtyped-optimization.cc230 for (int i = 1; i < node->op()->ValueInputCount(); ++i) { in ReduceCheckMaps()
384 int arity = node->op()->ValueInputCount(); in ReducePhi()
H A Djs-generic-lowering.cc140 DCHECK_EQ(node->op()->ValueInputCount(), 2); in ReplaceUnaryOpWithBuiltinCall()
172 DCHECK_EQ(node->op()->ValueInputCount(), 3); in ReplaceBinaryOpWithBuiltinCall()
223 DCHECK_EQ(node->op()->ValueInputCount(), 3); in LowerJSStrictEqual()
H A Djs-type-hint-lowering.cc189 DCHECK_EQ(2, op->ValueInputCount()); in BuildSpeculativeOperation()
H A Dwasm-inlining.cc481 int const return_arity = return_nodes[0]->op()->ValueInputCount() - 1; in InlineCall()
H A Dverifier.cc140 int value_count = node->op()->ValueInputCount(); in Check()
1935 for (int j = node->op()->ValueInputCount() - 1; j >= 0; j--) { in CheckInputsDominate()
2102 if (phi->InputCount() > phi->op()->ValueInputCount()) { in Run()
H A Dint64-lowering.cc892 for (int i = 0; i < node->op()->ValueInputCount(); i++) { in LowerNode()
1140 int value_count = phi->op()->ValueInputCount(); in PreparePhiReplacement()
H A Dload-elimination.cc78 if (node->op()->ValueInputCount() > 0) { in Reduce()
80 for (int i = 0; i < node->op()->ValueInputCount(); ++i) { in Reduce()
H A Descape-analysis.cc834 int value_input_count = op->ValueInputCount(); in ReduceNode()
/third_party/node/deps/v8/src/compiler/backend/
H A Dinstruction-selector.cc626 int const input_count = input->op()->ValueInputCount(); in AddOperandToStateValueDescriptor()
953 call->op()->ValueInputCount(), in InitializeCallBuffer()
2868 const int input_count = node->op()->ValueInputCount(); in VisitPhi()
3094 : ret->op()->ValueInputCount(); in VisitReturn()
3258 int input_count = node->op()->ValueInputCount(); in ZeroExtendsWord32ToWord64()

Completed in 36 milliseconds

12