| /external/v8/test/unittests/compiler/ |
| js-operator-unittest.cc | 50 int value_input_count; member in struct:v8::internal::compiler::__anon24493::SharedOperator
61 #define SHARED(Name, properties, value_input_count, frame_state_input_count, \
66 value_input_count, frame_state_input_count, effect_input_count, \
115 EXPECT_EQ(sop.value_input_count, op->ValueInputCount());
121 EXPECT_EQ(sop.value_input_count + context_input_count +
164 int value_input_count; member in struct:v8::internal::compiler::__anon24494::SharedOperatorWithLanguageMode
175 #define SHARED(Name, properties, value_input_count, frame_state_input_count, \
180 value_input_count, frame_state_input_count, effect_input_count, \
220 EXPECT_EQ(sop.value_input_count, op->ValueInputCount());
226 EXPECT_EQ(sop.value_input_count + context_input_count
[all...] |
| machine-operator-unittest.cc | 177 int value_input_count; member in struct:v8::internal::compiler::__anon24499::PureOperator
188 #define PURE(Name, value_input_count, control_input_count, value_output_count) \
190 &MachineOperatorBuilder::Name, #Name, value_input_count, \
289 EXPECT_EQ(pop.value_input_count, op1->ValueInputCount());
306 int value_input_count; member in struct:v8::internal::compiler::__anon24500::OptionalOperatorEntry
317 #define OPTIONAL_ENTRY(Name, value_input_count, control_input_count, \
321 value_input_count, control_input_count, value_output_count \
353 EXPECT_EQ(pop.value_input_count, op1->ValueInputCount());
|
| common-operator-reducer-unittest.cc | 237 int const value_input_count = input_count - 1; local
238 for (int i = 0; i < value_input_count; ++i) {
241 Node* const merge = graph()->NewNode(common()->Merge(value_input_count),
242 value_input_count, inputs);
243 for (int i = 0; i < value_input_count; ++i) {
246 inputs[value_input_count] = merge;
250 Reduce(&editor, graph()->NewNode(common()->EffectPhi(value_input_count),
282 int const value_input_count = input_count - 1; local
284 for (int i = 0; i < value_input_count; ++i) {
287 Node* const merge = graph()->NewNode(common()->Merge(value_input_count),
[all...] |
| common-operator-unittest.cc | 28 int value_input_count; member in struct:v8::internal::compiler::__anon24479::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,
|
| simplified-operator-unittest.cc | 26 int value_input_count; member in struct:v8::internal::compiler::__anon24517::PureOperator
93 EXPECT_EQ(pop.value_input_count, op->ValueInputCount());
96 EXPECT_EQ(pop.value_input_count, OperatorProperties::GetTotalInputCount(op));
|
| /external/v8/test/cctest/compiler/ |
| graph-builder-tester.h | 225 Node* NewNode(const Operator* op, int value_input_count,
227 return MakeNode(op, value_input_count, value_inputs);
236 Node* MakeNode(const Operator* op, int value_input_count,
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;
|
| /external/v8/src/compiler/ |
| node-properties.cc | 143 int value_input_count = node->op()->ValueInputCount(); local
144 DCHECK_LE(1, value_input_count);
146 while (--value_input_count > 0) {
147 node->RemoveInput(value_input_count);
194 int value_input_count = node->op()->ValueInputCount(); local
195 while (--value_input_count >= 0) {
196 node->RemoveInput(value_input_count);
|
| common-operator.h | 140 const Operator* Return(int value_input_count = 1);
162 int value_input_count);
|
| common-operator.cc | 247 #define CACHED(Name, properties, value_input_count, effect_input_count, \
252 : Operator(IrOpcode::k##Name, properties, #Name, value_input_count, \
431 #define CACHED(Name, properties, value_input_count, effect_input_count, \
459 const Operator* CommonOperatorBuilder::Return(int value_input_count) {
460 switch (value_input_count) {
473 value_input_count, 1, 1, 0, 0, 1); // counts
683 int value_input_count) {
684 DCHECK(value_input_count > 0); // Disallow empty phis.
687 kValueInputCount == value_input_count) { \
696 value_input_count, 0, 1, 1, 0, 0, // count
[all...] |
| js-operator.cc | 524 #define CACHED(Name, properties, value_input_count, value_output_count) \
528 value_input_count, Operator::ZeroIfPure(properties), \
538 #define CACHED_WITH_LANGUAGE_MODE(Name, properties, value_input_count, \
544 IrOpcode::kJS##Name, properties, "JS" #Name, value_input_count, \
566 #define CACHED(Name, properties, value_input_count, value_output_count) \
574 #define CACHED_WITH_LANGUAGE_MODE(Name, properties, value_input_count, \
911 int const value_input_count = static_cast<int>(arity) + 2; local
[all...] |
| machine-operator.cc | 237 #define PURE(Name, properties, value_input_count, control_input_count, \
242 value_input_count, 0, control_input_count, output_count, 0, \
343 #define PURE(Name, properties, value_input_count, control_input_count, \
349 #define PURE(Name, properties, value_input_count, control_input_count, \
|
| escape-analysis.cc | 368 int value_input_count = static_cast<int>(cache->fields().size()); local
375 value_input_count),
376 value_input_count + 1, &cache->fields().front());
380 for (int i = 0; i < value_input_count; i++) {
389 for (int n = 0; n < value_input_count; ++n) {
402 if (rep->op()->ValueInputCount() != value_input_count) {
405 rep->op()->ValueInputCount(), value_input_count);
409 value_input_count));
1228 int value_input_count = static_cast<int>(cache_->fields().size()); local
[all...] |
| ast-graph-builder.h | 206 Node* NewNode(const Operator* op, int value_input_count, Node** value_inputs,
208 return MakeNode(op, value_input_count, value_inputs, incomplete);
222 Node* MakeNode(const Operator* op, int value_input_count, Node** value_inputs,
|
| simplified-operator.cc | 303 #define ACCESS(Name, Type, properties, value_input_count, control_input_count, \
308 #Name, value_input_count, 1, control_input_count, \
|
| bytecode-graph-builder.h | 111 Node* MakeNode(const Operator* op, int value_input_count, Node** value_inputs,
|
| bytecode-graph-builder.cc | [all...] |
| machine-operator-reducer.cc | 660 const int value_input_count = phi->InputCount() - 1; local
661 for (int i = 0; i < value_input_count; ++i) {
671 common()->Phi(MachineRepresentation::kWord32, value_input_count));
[all...] |
| ast-graph-builder.cc | [all...] |
