| /external/v8/src/compiler/ |
| D | node-properties.cc | 164 int value_input_count = node->op()->ValueInputCount(); in ReplaceValueInputs() local
165 DCHECK_LE(1, value_input_count); in ReplaceValueInputs()
167 while (--value_input_count > 0) { in ReplaceValueInputs()
168 node->RemoveInput(value_input_count); in ReplaceValueInputs()
208 int value_input_count = node->op()->ValueInputCount(); in RemoveValueInputs() local
209 while (--value_input_count >= 0) { in RemoveValueInputs()
210 node->RemoveInput(value_input_count); in RemoveValueInputs()
|
| D | common-operator-reducer.cc | 236 int const value_input_count = inputs.count() - 1; in ReducePhi() local
237 DCHECK_LE(1, value_input_count); in ReducePhi()
238 Node* const merge = inputs[value_input_count]; in ReducePhi()
240 DCHECK_EQ(value_input_count, merge->InputCount()); in ReducePhi()
241 if (value_input_count == 2) { in ReducePhi()
285 for (int i = 1; i < value_input_count; ++i) { in ReducePhi()
|
| D | common-operator.cc | 599 #define CACHED(Name, properties, value_input_count, effect_input_count, \ argument
604 : Operator(IrOpcode::k##Name, properties, #Name, value_input_count, \
634 #define CACHED_RETURN(value_input_count) \ argument
635 ReturnOperator<value_input_count> kReturn##value_input_count##Operator;
874 #define CACHED(Name, properties, value_input_count, effect_input_count, \ argument
901 const Operator* CommonOperatorBuilder::Return(int value_input_count) { in Return() argument
902 switch (value_input_count) { in Return()
915 value_input_count + 1, 1, 1, 0, 0, 1); // counts in Return()
1234 int value_input_count) { in Phi() argument
1235 DCHECK_LT(0, value_input_count); // Disallow empty phis. in Phi()
[all …]
|
| D | simplified-operator.cc | 808 #define PURE(Name, properties, value_input_count, control_input_count) \ argument
812 value_input_count, 0, control_input_count, 1, 0, 0) {} \
818 #define EFFECT_DEPENDENT(Name, properties, value_input_count, \ argument
825 #Name, value_input_count, 1, control_input_count, 1, 1, \
832 #define CHECKED(Name, value_input_count, value_output_count) \ argument
837 value_input_count, 1, 1, value_output_count, 1, 0) {} \
843 #define CHECKED_WITH_FEEDBACK(Name, value_input_count, value_output_count) \ argument
848 #Name, value_input_count, 1, 1, value_output_count, 1, 0, \
1134 #define GET_FROM_CACHE_WITH_FEEDBACK(Name, value_input_count, \ in EFFECT_DEPENDENT_OP_LIST() argument
1143 value_input_count, 1, 1, value_output_count, 1, 0, \ in EFFECT_DEPENDENT_OP_LIST()
[all …]
|
| D | js-inlining-heuristic.cc | 34 int const value_input_count = m.node()->op()->ValueInputCount(); in CollectFunctions() local
35 if (value_input_count > functions_size) return 0; in CollectFunctions()
36 for (int n = 0; n < value_input_count; ++n) { in CollectFunctions()
41 return value_input_count; in CollectFunctions()
|
| D | common-operator.h | 469 const Operator* Return(int value_input_count = 1); in NON_EXPORTED_BASE()
498 int value_input_count); in NON_EXPORTED_BASE()
500 const Operator* InductionVariablePhi(int value_input_count); in NON_EXPORTED_BASE()
|
| D | js-operator.cc | 659 #define CACHED_OP(Name, properties, value_input_count, value_output_count) \ argument
663 value_input_count, Operator::ZeroIfPure(properties), \
726 #define CACHED_OP(Name, properties, value_input_count, value_output_count) \ argument
1119 int const value_input_count = static_cast<int>(arity) + 2; in CreateArray() local
1124 value_input_count, 1, 1, 1, 1, 2, // counts in CreateArray()
1149 int const value_input_count = static_cast<int>(arity) + 2; in CreateBoundFunction() local
1154 value_input_count, 1, 1, 1, 1, 0, // counts in CreateBoundFunction()
|
| D | machine-operator.cc | 450 #define PURE(Name, properties, value_input_count, control_input_count, \ argument
455 value_input_count, 0, control_input_count, output_count, 0, \
890 #define PURE(Name, properties, value_input_count, control_input_count, \ argument
896 #define PURE(Name, properties, value_input_count, control_input_count, \ argument
|
| D | escape-analysis.cc | 736 int value_input_count = op->ValueInputCount(); in ReduceNode() local
737 for (int i = 0; i < value_input_count; ++i) { in ReduceNode()
|
| D | bytecode-graph-builder.cc | 2839 int value_input_count = 3 + parameter_count_without_receiver + register_count; in VisitSuspendGenerator() local
2841 Node** value_inputs = local_zone()->NewArray<Node*>(value_input_count); in VisitSuspendGenerator()
3379 Node* BytecodeGraphBuilder::MakeNode(const Operator* op, int value_input_count, in MakeNode() argument
3382 DCHECK_EQ(op->ValueInputCount(), value_input_count); in MakeNode()
3394 result = graph()->NewNode(op, value_input_count, value_inputs, incomplete); in MakeNode()
3397 int input_count_with_deps = value_input_count; in MakeNode()
3403 memcpy(buffer, value_inputs, kPointerSize * value_input_count); in MakeNode()
3404 Node** current_input = buffer + value_input_count; in MakeNode()
|
| D | bytecode-graph-builder.h | 128 Node* MakeNode(const Operator* op, int value_input_count,
|
| D | simplified-lowering.cc | 1032 int value_input_count = node->op()->ValueInputCount(); in VisitCall() local
1034 for (int i = 0; i < value_input_count; i++) { in VisitCall()
1046 ProcessRemainingInputs(node, value_input_count); in VisitCall()
|
| D | js-call-reducer.cc | 3212 int const value_input_count = m.node()->op()->ValueInputCount(); in ShouldUseCallICFeedback() local
3213 for (int n = 0; n < value_input_count; ++n) { in ShouldUseCallICFeedback()
|