| /external/v8/src/compiler/ |
| D | node-properties.cc | 101 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()
|
| 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 | 620 #define CACHED(Name, properties, value_input_count, effect_input_count, \ argument
625 : Operator(IrOpcode::k##Name, properties, #Name, value_input_count, \
655 #define CACHED_RETURN(value_input_count) \ argument
656 ReturnOperator<value_input_count> kReturn##value_input_count##Operator;
897 #define CACHED(Name, properties, value_input_count, effect_input_count, \ argument
924 const Operator* CommonOperatorBuilder::Return(int value_input_count) { in Return() argument
925 switch (value_input_count) { in Return()
938 value_input_count + 1, 1, 1, 0, 0, 1); // counts in Return()
1298 int value_input_count) { in Phi() argument
1299 DCHECK_LT(0, value_input_count); // Disallow empty phis. in Phi()
[all …]
|
| D | simplified-operator.cc | 881 #define PURE(Name, properties, value_input_count, control_input_count) \ argument
885 value_input_count, 0, control_input_count, 1, 0, 0) {} \
891 #define EFFECT_DEPENDENT(Name, properties, value_input_count, \ argument
896 #Name, value_input_count, 1, control_input_count, 1, 1, \
903 #define CHECKED(Name, value_input_count, value_output_count) \ argument
908 value_input_count, 1, 1, value_output_count, 1, 0) {} \
914 #define CHECKED_WITH_FEEDBACK(Name, value_input_count, value_output_count) \ argument
919 #Name, value_input_count, 1, 1, value_output_count, 1, 0, \
1239 #define GET_FROM_CACHE_WITH_FEEDBACK(Name, value_input_count, \ in EFFECT_DEPENDENT_OP_LIST() argument
1248 value_input_count, 1, 1, value_output_count, 1, 0, \ in EFFECT_DEPENDENT_OP_LIST()
[all …]
|
| D | js-inlining-heuristic.cc | 90 int const value_input_count = m.node()->op()->ValueInputCount(); in CollectFunctions() local
91 if (value_input_count > functions_size) { in CollectFunctions()
95 for (int n = 0; n < value_input_count; ++n) { in CollectFunctions()
108 out.num_functions = value_input_count; in CollectFunctions()
|
| D | common-operator.h | 493 const Operator* Return(int value_input_count = 1); in NON_EXPORTED_BASE()
522 int value_input_count); in NON_EXPORTED_BASE()
524 const Operator* InductionVariablePhi(int value_input_count); in NON_EXPORTED_BASE()
|
| D | js-operator.cc | 717 #define CACHED_OP(Name, properties, value_input_count, value_output_count) \ argument
721 value_input_count, Operator::ZeroIfPure(properties), \
738 #define CACHED_OP(Name, properties, value_input_count, value_output_count) \ argument
1179 int const value_input_count = static_cast<int>(arity) + 2; in CreateArray() local
1184 value_input_count, 1, 1, 1, 1, 2, // counts in CreateArray()
1219 int const value_input_count = static_cast<int>(arity) + 2; in CreateBoundFunction() local
1224 value_input_count, 1, 1, 1, 1, 0, // counts in CreateBoundFunction()
|
| D | machine-operator.cc | 677 template <IrOpcode::Value op, int value_input_count, int effect_input_count,
682 : Operator(op, properties, mnemonic, value_input_count, in CachedOperator()
687 template <IrOpcode::Value op, int value_input_count, int control_input_count,
691 : Operator(op, Operator::kPure | properties, mnemonic, value_input_count, in CachedPureOperator()
728 #define PURE(Name, properties, value_input_count, control_input_count, \ argument
734 CachedPureOperator<IrOpcode::k##Name, value_input_count, \
1152 #define PURE(Name, properties, value_input_count, control_input_count, \ argument
1156 CachedPureOperator<IrOpcode::k##Name, value_input_count, \
|
| D | bytecode-graph-builder.cc | 183 Node* MakeNode(const Operator* op, int value_input_count,
3761 int value_input_count = 3 + parameter_count_without_receiver + register_count; in VisitSuspendGenerator() local
3763 Node** value_inputs = local_zone()->NewArray<Node*>(value_input_count); in VisitSuspendGenerator()
4343 Node* BytecodeGraphBuilder::MakeNode(const Operator* op, int value_input_count, in MakeNode() argument
4346 DCHECK_EQ(op->ValueInputCount(), value_input_count); in MakeNode()
4358 result = graph()->NewNode(op, value_input_count, value_inputs, incomplete); in MakeNode()
4361 int input_count_with_deps = value_input_count; in MakeNode()
4367 if (value_input_count > 0) { in MakeNode()
4368 memcpy(buffer, value_inputs, kSystemPointerSize * value_input_count); in MakeNode()
4370 Node** current_input = buffer + value_input_count; in MakeNode()
|
| D | escape-analysis.cc | 804 int value_input_count = op->ValueInputCount(); in ReduceNode() local
805 for (int i = 0; i < value_input_count; ++i) { in ReduceNode()
|
| D | simplified-lowering.cc | 1114 int value_input_count = node->op()->ValueInputCount(); in VisitCall() local
1116 DCHECK_GT(value_input_count, 0); in VisitCall()
1117 DCHECK_GE(value_input_count, params); in VisitCall()
1131 for (int i = params + 1; i < value_input_count; i++) { in VisitCall()
1136 ProcessRemainingInputs<T>(node, value_input_count); in VisitCall()
1780 const int value_input_count = node->op()->ValueInputCount(); in VisitFastApiCall() local
1782 value_input_count); in VisitFastApiCall()
1807 i < value_input_count; ++i) { in VisitFastApiCall()
1810 ProcessRemainingInputs<T>(node, value_input_count); in VisitFastApiCall()
|
| D | effect-control-linearizer.cc | 5052 const int value_input_count = node->op()->ValueInputCount(); in LowerFastApiCall() local
5054 value_input_count); in LowerFastApiCall()
5132 CHECK_EQ(value_input_count - fast_call_params, n.SlowCallArgumentCount()); in LowerFastApiCall()
|
| D | js-call-reducer.cc | 3992 int const value_input_count = m.node()->op()->ValueInputCount(); in ShouldUseCallICFeedback() local
3993 for (int n = 0; n < value_input_count; ++n) { in ShouldUseCallICFeedback()
|