Home
last modified time | relevance | path

Searched refs:value_input_count (Results 1 – 17 of 17) sorted by relevance

/external/v8/test/unittests/compiler/
Djs-operator-unittest.cc24 int value_input_count; member
34 #define SHARED(Name, properties, value_input_count, frame_state_input_count, \ argument
39 value_input_count, frame_state_input_count, effect_input_count, \
81 EXPECT_EQ(sop.value_input_count, op->ValueInputCount()); in TEST_P()
87 EXPECT_EQ(sop.value_input_count + context_input_count + in TEST_P()
Dmachine-operator-unittest.cc177 int value_input_count; member
188 #define PURE(Name, value_input_count, control_input_count, value_output_count) \ argument
190 &MachineOperatorBuilder::Name, #Name, value_input_count, \
287 EXPECT_EQ(pop.value_input_count, op1->ValueInputCount()); in TEST_F()
304 int value_input_count; member
315 #define OPTIONAL_ENTRY(Name, value_input_count, control_input_count, \ argument
319 value_input_count, control_input_count, value_output_count \
353 EXPECT_EQ(pop.value_input_count, op1->ValueInputCount()); in TEST_F()
Dcommon-operator-reducer-unittest.cc203 int const value_input_count = input_count - 1; in TEST_F() local
204 for (int i = 0; i < value_input_count; ++i) { in TEST_F()
207 Node* const merge = graph()->NewNode(common()->Merge(value_input_count), in TEST_F()
208 value_input_count, inputs); in TEST_F()
209 for (int i = 0; i < value_input_count; ++i) { in TEST_F()
212 inputs[value_input_count] = merge; in TEST_F()
216 Reduce(&editor, graph()->NewNode(common()->EffectPhi(value_input_count), in TEST_F()
248 int const value_input_count = input_count - 1; in TEST_F() local
250 for (int i = 0; i < value_input_count; ++i) { in TEST_F()
253 Node* const merge = graph()->NewNode(common()->Merge(value_input_count), in TEST_F()
[all …]
Dcommon-operator-unittest.cc28 int value_input_count; member
43 #define SHARED(Name, properties, value_input_count, effect_input_count, \ argument
48 value_input_count, effect_input_count, control_input_count, \
81 EXPECT_EQ(sop.value_input_count, op->ValueInputCount()); in TEST_P()
85 sop.value_input_count + sop.effect_input_count + sop.control_input_count, in TEST_P()
Dsimplified-operator-unittest.cc26 int value_input_count; member
95 EXPECT_EQ(pop.value_input_count, op->ValueInputCount()); in TEST_P()
98 EXPECT_EQ(pop.value_input_count, OperatorProperties::GetTotalInputCount(op)); in TEST_P()
/external/v8/test/cctest/compiler/
Dgraph-builder-tester.h225 Node* NewNode(const Operator* op, int value_input_count, in NewNode() argument
227 return MakeNode(op, value_input_count, value_inputs); in NewNode()
236 Node* MakeNode(const Operator* op, int value_input_count, in MakeNode() argument
238 CHECK_EQ(op->ValueInputCount(), value_input_count); in MakeNode()
250 result = graph()->NewNode(op, value_input_count, value_inputs); in MakeNode()
252 int input_count_with_deps = value_input_count; in MakeNode()
256 memcpy(buffer, value_inputs, kPointerSize * value_input_count); in MakeNode()
257 Node** current_input = buffer + value_input_count; in MakeNode()
/external/v8/src/compiler/
Dnode-properties.cc145 int value_input_count = node->op()->ValueInputCount(); in ReplaceValueInputs() local
146 DCHECK_LE(1, value_input_count); in ReplaceValueInputs()
148 while (--value_input_count > 0) { in ReplaceValueInputs()
149 node->RemoveInput(value_input_count); in ReplaceValueInputs()
190 int value_input_count = node->op()->ValueInputCount(); in RemoveValueInputs() local
191 while (--value_input_count >= 0) { in RemoveValueInputs()
192 node->RemoveInput(value_input_count); in RemoveValueInputs()
Dcommon-operator.cc306 #define CACHED(Name, properties, value_input_count, effect_input_count, \ argument
311 : Operator(IrOpcode::k##Name, properties, #Name, value_input_count, \
504 #define CACHED(Name, properties, value_input_count, effect_input_count, \ argument
532 const Operator* CommonOperatorBuilder::Return(int value_input_count) { in Return() argument
533 switch (value_input_count) { in Return()
546 value_input_count, 1, 1, 0, 0, 1); // counts in Return()
773 int value_input_count) { in Phi() argument
774 DCHECK(value_input_count > 0); // Disallow empty phis. in Phi()
777 kValueInputCount == value_input_count) { \ in Phi()
786 value_input_count, 0, 1, 1, 0, 0, // counts in Phi()
Dsimplified-operator.cc333 #define CHECKED(Name, value_input_count) \ argument
338 value_input_count, 1, 1, 1, 1, 0) {} \
418 #define GET_FROM_CACHE(Name, value_input_count) \ argument
554 #define ACCESS(Name, Type, properties, value_input_count, control_input_count, \ argument
560 #Name, value_input_count, 1, control_input_count, \
Dcommon-operator.h176 const Operator* Return(int value_input_count = 1);
203 int value_input_count);
Djs-operator.cc430 #define CACHED(Name, properties, value_input_count, value_output_count) \ argument
434 value_input_count, Operator::ZeroIfPure(properties), \
453 #define CACHED(Name, properties, value_input_count, value_output_count) \ argument
828 int const value_input_count = static_cast<int>(arity) + 2; in CreateArray() local
833 value_input_count, 1, 1, 1, 1, 2, // counts in CreateArray()
Dbytecode-graph-builder.cc1427 int value_input_count = 3 + register_count; in VisitSuspendGenerator() local
1429 Node** value_inputs = local_zone()->NewArray<Node*>(value_input_count); in VisitSuspendGenerator()
1438 MakeNode(javascript()->GeneratorStore(register_count), value_input_count, in VisitSuspendGenerator()
1594 Node* BytecodeGraphBuilder::MakeNode(const Operator* op, int value_input_count, in MakeNode() argument
1596 DCHECK_EQ(op->ValueInputCount(), value_input_count); in MakeNode()
1608 result = graph()->NewNode(op, value_input_count, value_inputs, incomplete); in MakeNode()
1611 int input_count_with_deps = value_input_count; in MakeNode()
1617 memcpy(buffer, value_inputs, kPointerSize * value_input_count); in MakeNode()
1618 Node** current_input = buffer + value_input_count; in MakeNode()
Descape-analysis.cc440 int value_input_count = static_cast<int>(cache->fields().size()); in MergeFields() local
446 common->Phi(MachineRepresentation::kTagged, value_input_count), in MergeFields()
447 value_input_count + 1, &cache->fields().front()); in MergeFields()
452 for (int i = 0; i < value_input_count; i++) { in MergeFields()
462 for (int n = 0; n < value_input_count; ++n) { in MergeFields()
1366 int value_input_count = static_cast<int>(cache_->fields().size()); in ProcessLoadFromPhi() local
1369 common()->Phi(MachineRepresentation::kTagged, value_input_count), in ProcessLoadFromPhi()
1370 value_input_count + 1, &cache_->fields().front()); in ProcessLoadFromPhi()
Dast-graph-builder.h212 Node* NewNode(const Operator* op, int value_input_count, Node** value_inputs,
214 return MakeNode(op, value_input_count, value_inputs, incomplete);
228 Node* MakeNode(const Operator* op, int value_input_count, Node** value_inputs,
Dmachine-operator.cc432 #define PURE(Name, properties, value_input_count, control_input_count, \ argument
437 value_input_count, 0, control_input_count, output_count, 0, \
594 #define PURE(Name, properties, value_input_count, control_input_count, \ argument
600 #define PURE(Name, properties, value_input_count, control_input_count, \ argument
Dbytecode-graph-builder.h99 Node* MakeNode(const Operator* op, int value_input_count, Node** value_inputs,
Dast-graph-builder.cc4108 Node* AstGraphBuilder::MakeNode(const Operator* op, int value_input_count, in MakeNode() argument
4110 DCHECK_EQ(op->ValueInputCount(), value_input_count); in MakeNode()
4122 result = graph()->NewNode(op, value_input_count, value_inputs, incomplete); in MakeNode()
4125 int input_count_with_deps = value_input_count; in MakeNode()
4131 memcpy(buffer, value_inputs, kPointerSize * value_input_count); in MakeNode()
4132 Node** current_input = buffer + value_input_count; in MakeNode()