| /external/v8/test/unittests/compiler/ |
| H A D | js-operator-unittest.cc | 24 int value_input_count; member in struct:v8::internal::compiler::__anon18946::SharedOperator
34 #define SHARED(Name, properties, value_input_count, frame_state_input_count, \
39 value_input_count, frame_state_input_count, effect_input_count, \
81 EXPECT_EQ(sop.value_input_count, op->ValueInputCount());
87 EXPECT_EQ(sop.value_input_count + context_input_count +
|
| H A D | simplified-operator-unittest.cc | 26 int value_input_count; member in struct:v8::internal::compiler::__anon18969::PureOperator
95 EXPECT_EQ(pop.value_input_count, op->ValueInputCount());
98 EXPECT_EQ(pop.value_input_count, OperatorProperties::GetTotalInputCount(op));
|
| H A D | common-operator-unittest.cc | 28 int value_input_count; member in struct:v8::internal::compiler::__anon18932::SharedOperator
43 #define SHARED(Name, properties, value_input_count, effect_input_count, \
48 value_input_count, effect_input_count, control_input_count, \
81 EXPECT_EQ(sop.value_input_count, op->ValueInputCount());
85 sop.value_input_count + sop.effect_input_count + sop.control_input_count,
|
| H A D | common-operator-reducer-unittest.cc | 203 int const value_input_count = input_count - 1; local
204 for (int i = 0; i < value_input_count; ++i) {
207 Node* const merge = graph()->NewNode(common()->Merge(value_input_count),
208 value_input_count, inputs);
209 for (int i = 0; i < value_input_count; ++i) {
212 inputs[value_input_count] = merge;
216 Reduce(&editor, graph()->NewNode(common()->EffectPhi(value_input_count),
248 int const value_input_count = input_count - 1; local
250 for (int i = 0; i < value_input_count; ++i) {
253 Node* const merge = graph()->NewNode(common()->Merge(value_input_count),
[all...] |
| H A D | machine-operator-unittest.cc | 177 int value_input_count; member in struct:v8::internal::compiler::__anon18951::PureOperator
188 #define PURE(Name, value_input_count, control_input_count, value_output_count) \
190 &MachineOperatorBuilder::Name, #Name, value_input_count, \
287 EXPECT_EQ(pop.value_input_count, op1->ValueInputCount());
304 int value_input_count; member in struct:v8::internal::compiler::__anon18952::OptionalOperatorEntry
315 #define OPTIONAL_ENTRY(Name, value_input_count, control_input_count, \
319 value_input_count, control_input_count, value_output_count \
353 EXPECT_EQ(pop.value_input_count, op1->ValueInputCount());
|
| /external/v8/src/compiler/ |
| H A D | node-properties.cc | 145 int value_input_count = node->op()->ValueInputCount(); local
146 DCHECK_LE(1, value_input_count);
148 while (--value_input_count > 0) {
149 node->RemoveInput(value_input_count);
190 int value_input_count = node->op()->ValueInputCount(); local
191 while (--value_input_count >= 0) {
192 node->RemoveInput(value_input_count);
|
| H A D | js-operator.cc | 430 #define CACHED(Name, properties, value_input_count, value_output_count) \
434 value_input_count, Operator::ZeroIfPure(properties), \
453 #define CACHED(Name, properties, value_input_count, value_output_count) \
828 int const value_input_count = static_cast<int>(arity) + 2; local
833 value_input_count, 1, 1, 1, 1, 2, // counts
|
| H A D | ast-graph-builder.h | 212 Node* NewNode(const Operator* op, int value_input_count, Node** value_inputs, argument
214 return MakeNode(op, value_input_count, value_inputs, incomplete);
228 Node* MakeNode(const Operator* op, int value_input_count, Node** value_inputs,
|
| H A D | common-operator.cc | 306 #define CACHED(Name, properties, value_input_count, effect_input_count, \
311 : Operator(IrOpcode::k##Name, properties, #Name, value_input_count, \
504 #define CACHED(Name, properties, value_input_count, effect_input_count, \
532 const Operator* CommonOperatorBuilder::Return(int value_input_count) { argument
533 switch (value_input_count) {
546 value_input_count, 1, 1, 0, 0, 1); // counts
773 int value_input_count) {
774 DCHECK(value_input_count > 0); // Disallow empty phis.
777 kValueInputCount == value_input_count) { \
786 value_input_count,
772 Phi(MachineRepresentation rep, int value_input_count) argument
[all...] |
| H A D | escape-analysis.cc | 440 int value_input_count = static_cast<int>(cache->fields().size()); local
446 common->Phi(MachineRepresentation::kTagged, value_input_count),
447 value_input_count + 1, &cache->fields().front());
452 for (int i = 0; i < value_input_count; i++) {
462 for (int n = 0; n < value_input_count; ++n) {
1366 int value_input_count = static_cast<int>(cache_->fields().size()); local
1369 common()->Phi(MachineRepresentation::kTagged, value_input_count),
1370 value_input_count + 1, &cache_->fields().front());
|
| H A D | bytecode-graph-builder.cc | 1427 int value_input_count = 3 + register_count; local
1429 Node** value_inputs = local_zone()->NewArray<Node*>(value_input_count);
1438 MakeNode(javascript()->GeneratorStore(register_count), value_input_count, local
1594 Node* BytecodeGraphBuilder::MakeNode(const Operator* op, int value_input_count, argument
1596 DCHECK_EQ(op->ValueInputCount(), value_input_count);
1608 result = graph()->NewNode(op, value_input_count, value_inputs, incomplete);
1611 int input_count_with_deps = value_input_count;
1617 memcpy(buffer, value_inputs, kPointerSize * value_input_count);
1618 Node** current_input = buffer + value_input_count;
|
| H A D | ast-graph-builder.cc | 4108 Node* AstGraphBuilder::MakeNode(const Operator* op, int value_input_count, argument
4110 DCHECK_EQ(op->ValueInputCount(), value_input_count);
4122 result = graph()->NewNode(op, value_input_count, value_inputs, incomplete);
4125 int input_count_with_deps = value_input_count;
4131 memcpy(buffer, value_inputs, kPointerSize * value_input_count);
4132 Node** current_input = buffer + value_input_count;
|
| /external/v8/test/cctest/compiler/ |
| H A D | graph-builder-tester.h | 225 Node* NewNode(const Operator* op, int value_input_count, argument
227 return MakeNode(op, value_input_count, value_inputs);
236 Node* MakeNode(const Operator* op, int value_input_count, argument
238 CHECK_EQ(op->ValueInputCount(), value_input_count);
250 result = graph()->NewNode(op, value_input_count, value_inputs);
252 int input_count_with_deps = value_input_count;
256 memcpy(buffer, value_inputs, kPointerSize * value_input_count);
257 Node** current_input = buffer + value_input_count;
|