| /external/v8/src/compiler/ |
| node-properties.cc | 148 int value_input_count = node->op()->ValueInputCount(); local
149 DCHECK_LE(1, value_input_count);
151 while (--value_input_count > 0) {
152 node->RemoveInput(value_input_count);
192 int value_input_count = node->op()->ValueInputCount(); local
193 while (--value_input_count >= 0) {
194 node->RemoveInput(value_input_count);
|
| js-inlining-heuristic.cc | 33 int const value_input_count = m.node()->op()->ValueInputCount(); local
34 if (value_input_count > functions_size) return 0;
35 for (int n = 0; n < value_input_count; ++n) {
40 return value_input_count;
|
| common-operator.cc | 499 #define CACHED(Name, properties, value_input_count, effect_input_count, \
504 : Operator(IrOpcode::k##Name, properties, #Name, value_input_count, \
534 #define CACHED_RETURN(value_input_count) \
535 ReturnOperator<value_input_count> kReturn##value_input_count##Operator;
770 #define CACHED(Name, properties, value_input_count, effect_input_count, \
797 const Operator* CommonOperatorBuilder::Return(int value_input_count) {
798 switch (value_input_count) {
811 value_input_count + 1, 1, 1, 0, 0, 1); // counts
[all...] |
| common-operator-reducer.cc | 224 int const value_input_count = inputs.count() - 1; local
225 DCHECK_LE(1, value_input_count);
226 Node* const merge = inputs[value_input_count];
228 DCHECK_EQ(value_input_count, merge->InputCount());
229 if (value_input_count == 2) {
273 for (int i = 1; i < value_input_count; ++i) {
|
| common-operator.h | 324 const Operator* Return(int value_input_count = 1);
353 int value_input_count);
355 const Operator* InductionVariablePhi(int value_input_count);
|
| simplified-operator.cc | 527 #define PURE(Name, properties, value_input_count, control_input_count) \
531 value_input_count, 0, control_input_count, 1, 0, 0) {} \
537 #define CHECKED(Name, value_input_count, value_output_count) \
542 value_input_count, 1, 1, value_output_count, 1, 0) {} \
[all...] |
| ast-graph-builder.h | 202 Node* NewNode(const Operator* op, int value_input_count, Node** value_inputs,
204 return MakeNode(op, value_input_count, value_inputs, incomplete);
218 Node* MakeNode(const Operator* op, int value_input_count, Node** value_inputs,
|
| js-operator.cc | 608 #define CACHED_OP(Name, properties, value_input_count, value_output_count) \
612 value_input_count, Operator::ZeroIfPure(properties), \
669 #define CACHED_OP(Name, properties, value_input_count, value_output_count) \
981 int const value_input_count = static_cast<int>(arity) + 2; local
[all...] |
| bytecode-graph-builder.cc | 1988 int value_input_count = 3 + register_count; local
1999 MakeNode(javascript()->GeneratorStore(register_count), value_input_count, local
[all...] |
| escape-analysis.cc | 446 int value_input_count = static_cast<int>(cache->fields().size()); local
459 common->Phi(MachineRepresentation::kTagged, value_input_count),
460 value_input_count + 1, &cache->fields().front());
467 for (int i = 0; i < value_input_count; i++) {
477 for (int n = 0; n < value_input_count; ++n) {
1455 int value_input_count = static_cast<int>(cache_->fields().size()); local
[all...] |
| bytecode-graph-builder.h | 107 Node* MakeNode(const Operator* op, int value_input_count, Node** value_inputs,
|
| machine-operator.cc | 434 #define PURE(Name, properties, value_input_count, control_input_count, \
439 value_input_count, 0, control_input_count, output_count, 0, \
[all...] |
| ast-graph-builder.cc | [all...] |
| simplified-lowering.cc | 966 int value_input_count = node->op()->ValueInputCount(); local
[all...] |
