Searched refs:value_inputs (Results 1 – 5 of 5) sorted by relevance
| /external/v8/src/compiler/ |
| D | common-operator-reducer.cc | 333 Node::Inputs value_inputs = value->inputs(); in ReduceReturn() local
335 DCHECK_EQ(control_inputs.count(), value_inputs.count() - 1); in ReduceReturn()
344 Node* ret = graph()->NewNode(node->op(), pop_count, value_inputs[i], in ReduceReturn()
360 Node* ret = graph()->NewNode(node->op(), pop_count, value_inputs[i], in ReduceReturn()
|
| D | 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,
|
| D | bytecode-graph-builder.cc | 1990 Node** value_inputs = local_zone()->NewArray<Node*>(value_input_count); in VisitSuspendGenerator() local
1991 value_inputs[0] = generator; in VisitSuspendGenerator()
1992 value_inputs[1] = state; in VisitSuspendGenerator()
1993 value_inputs[2] = offset; in VisitSuspendGenerator()
1995 value_inputs[3 + i] = in VisitSuspendGenerator()
2000 value_inputs, false); in VisitSuspendGenerator()
2250 Node** value_inputs, bool incomplete) { in MakeNode() argument
2263 result = graph()->NewNode(op, value_input_count, value_inputs, incomplete); in MakeNode()
2272 memcpy(buffer, value_inputs, kPointerSize * value_input_count); in MakeNode()
|
| D | bytecode-graph-builder.h | 107 Node* MakeNode(const Operator* op, int value_input_count, Node** value_inputs,
|
| D | ast-graph-builder.cc | 2893 Node** value_inputs, bool incomplete) { in MakeNode() argument
2906 result = graph()->NewNode(op, value_input_count, value_inputs, incomplete); in MakeNode()
2914 memcpy(buffer, value_inputs, kPointerSize * value_input_count); in MakeNode()
|