Home
last modified time | relevance | path

Searched refs:value_input_count (Results 1 - 13 of 13) sorted by relevance

/third_party/node/deps/v8/src/compiler/
H A Dnode-properties.cc101 int value_input_count = node->op()->ValueInputCount(); in ReplaceValueInputs() local
102 CHECK_GT(value_input_count, 0); in ReplaceValueInputs()
104 while (--value_input_count > 0) { in ReplaceValueInputs()
105 node->RemoveInput(value_input_count); in ReplaceValueInputs()
147 int value_input_count = node->op()->ValueInputCount(); in RemoveValueInputs() local
148 while (--value_input_count >= 0) { in RemoveValueInputs()
149 node->RemoveInput(value_input_count); in RemoveValueInputs()
H A Dcommon-operator-reducer.cc242 int const value_input_count = inputs.count() - 1; in ReducePhi() local
243 DCHECK_LE(1, value_input_count); in ReducePhi()
244 Node* const merge = inputs[value_input_count]; in ReducePhi()
246 DCHECK_EQ(value_input_count, merge->InputCount()); in ReducePhi()
247 if (value_input_count == 2) { in ReducePhi()
291 for (int i = 1; i < value_input_count; ++i) { in ReducePhi()
H A Dcommon-operator.cc595 #define CACHED(Name, properties, value_input_count, effect_input_count, \
600 : Operator(IrOpcode::k##Name, properties, #Name, value_input_count, \
630 #define CACHED_RETURN(value_input_count) \
631 ReturnOperator<value_input_count> kReturn##value_input_count##Operator;
875 #define CACHED(Name, properties, value_input_count, effect_input_count, \
902 const Operator* CommonOperatorBuilder::Return(int value_input_count) { in Return() argument
903 switch (value_input_count) { in Return()
916 value_input_count + 1, 1, 1, 0, 0, 1); // counts in Return()
1291 int value_input_count) { in Phi()
1290 Phi(MachineRepresentation rep, int value_input_count) Phi() argument
[all...]
H A Dsimplified-operator.cc853 #define PURE(Name, properties, value_input_count, control_input_count) \
857 value_input_count, 0, control_input_count, 1, 0, 0) {} \
863 #define EFFECT_DEPENDENT(Name, properties, value_input_count, \
868 #Name, value_input_count, 1, control_input_count, 1, 1, \
875 #define CHECKED(Name, value_input_count, value_output_count) \
880 value_input_count, 1, 1, value_output_count, 1, 0) {} \
886 #define CHECKED_WITH_FEEDBACK(Name, value_input_count, value_output_count) \
891 #Name, value_input_count, 1, 1, value_output_count, 1, 0, \
1200 #define GET_FROM_CACHE_WITH_FEEDBACK(Name, value_input_count, \
1209 value_input_count,
1927 int value_input_count = FastApiCall() local
[all...]
H A Djs-inlining-heuristic.cc107 int const value_input_count = m.node()->op()->ValueInputCount(); in CollectFunctions() local
108 if (value_input_count > functions_size) { in CollectFunctions()
112 for (int n = 0; n < value_input_count; ++n) { in CollectFunctions()
125 out.num_functions = value_input_count; in CollectFunctions()
H A Dcommon-operator.h497 const Operator* Return(int value_input_count = 1);
526 int value_input_count);
528 const Operator* InductionVariablePhi(int value_input_count);
H A Djs-operator.cc777 #define CACHED_OP(Name, properties, value_input_count, value_output_count) \
781 value_input_count, Operator::ZeroIfPure(properties), \
798 #define CACHED_OP(Name, properties, value_input_count, value_output_count) \
1262 int const value_input_count = static_cast<int>(arity) + 2; in CreateArray() local
1267 value_input_count, 1, 1, 1, 1, 2, // counts in CreateArray()
1302 int const value_input_count = static_cast<int>(arity) + 2; in CreateBoundFunction() local
1307 value_input_count, 1, 1, 1, 1, 0, // counts in CreateBoundFunction()
H A Dbytecode-graph-builder.cc150 Node* MakeNode(const Operator* op, int value_input_count,
3684 int value_input_count = 3 + parameter_count_without_receiver + register_count; in VisitSuspendGenerator() local
3686 Node** value_inputs = local_zone()->NewArray<Node*>(value_input_count); in VisitSuspendGenerator()
4233 Node* BytecodeGraphBuilder::MakeNode(const Operator* op, int value_input_count, in MakeNode() argument
4236 DCHECK_EQ(op->ValueInputCount(), value_input_count); in MakeNode()
4253 result = graph()->NewNode(op, value_input_count, value_inputs, incomplete); in MakeNode()
4256 int input_count_with_deps = value_input_count; in MakeNode()
4262 if (value_input_count > 0) { in MakeNode()
4263 memcpy(buffer, value_inputs, kSystemPointerSize * value_input_count); in MakeNode()
4265 Node** current_input = buffer + value_input_count; in MakeNode()
[all...]
H A Dmachine-operator.cc260 // V(Name, properties, value_input_count, control_input_count, output_count)
284 // V(Name, properties, value_input_count, control_input_count, output_count)
307 // V(Name, properties, value_input_count, control_input_count, output_count)
615 // V(Name, properties, value_input_count, control_input_count, output_count)
644 // V(Name, properties, value_input_count, control_input_count, output_count)
810 #define PURE(Name, properties, value_input_count, control_input_count, \
815 value_input_count, 0, control_input_count, output_count, 0, \
1362 #define PURE(Name, properties, value_input_count, control_input_count, \
1416 #define PURE(Name, properties, value_input_count, control_input_count, \
H A Descape-analysis.cc834 int value_input_count = op->ValueInputCount(); in ReduceNode() local
835 for (int i = 0; i < value_input_count; ++i) { in ReduceNode()
H A Dsimplified-lowering.cc1241 int value_input_count = node->op()->ValueInputCount(); in VisitCall() local
1243 DCHECK_GT(value_input_count, 0); in VisitCall()
1244 DCHECK_GE(value_input_count, params); in VisitCall()
1258 for (int i = params + 1; i < value_input_count; i++) { in VisitCall()
1263 ProcessRemainingInputs<T>(node, value_input_count); in VisitCall()
1935 const int value_input_count = node->op()->ValueInputCount(); in VisitFastApiCall() local
1937 value_input_count); in VisitFastApiCall() local
1955 for (int i = c_arg_count + js_arg_count; i < value_input_count; ++i) { in VisitFastApiCall()
1958 ProcessRemainingInputs<T>(node, value_input_count); in VisitFastApiCall()
H A Djs-call-reducer.cc3981 int const value_input_count = m.node()->op()->ValueInputCount();
3982 for (int n = 0; n < value_input_count; ++n) {
H A Deffect-control-linearizer.cc5173 const int value_input_count = node->op()->ValueInputCount(); in LowerFastApiCall() local
5175 value_input_count); in LowerFastApiCall() local

Completed in 54 milliseconds