| /external/v8/test/unittests/compiler/ |
| simplified-operator-unittest.cc | 26 int value_input_count; member in struct:v8::internal::compiler::__anon24041::PureOperator
95 EXPECT_EQ(pop.value_input_count, op->ValueInputCount());
98 EXPECT_EQ(pop.value_input_count, OperatorProperties::GetTotalInputCount(op));
|
| js-operator-unittest.cc | 24 int value_input_count; member in struct:v8::internal::compiler::__anon24018::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 +
|
| common-operator-unittest.cc | 28 int value_input_count; member in struct:v8::internal::compiler::__anon24004::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,
|
| machine-operator-unittest.cc | 177 int value_input_count; member in struct:v8::internal::compiler::__anon24023::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::__anon24024::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());
|
| 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...] |
| /external/v8/src/compiler/ |
| 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);
|
| 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
[all...] |
| 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
[all...] |
| bytecode-graph-builder.cc | 1427 int value_input_count = 3 + register_count; local
1438 MakeNode(javascript()->GeneratorStore(register_count), value_input_count, local
[all...] |
