Home
last modified time | relevance | path

Searched refs:ValueInputCount (Results 1 – 25 of 27) sorted by relevance

12

/external/v8/test/unittests/compiler/
Dcommon-operator-unittest.cc81 EXPECT_EQ(sop.value_input_count, op->ValueInputCount()); in TEST_P()
178 EXPECT_EQ(0, op->ValueInputCount()); in TEST_F()
195 EXPECT_EQ(input_count, op->ValueInputCount()); in TEST_F()
212 EXPECT_EQ(1, op->ValueInputCount()); in TEST_F()
230 EXPECT_EQ(0, op->ValueInputCount()); in TEST_F()
246 EXPECT_EQ(1, op->ValueInputCount()); in TEST_F()
263 EXPECT_EQ(0, op->ValueInputCount()); in TEST_F()
289 EXPECT_EQ(3, op->ValueInputCount()); in TEST_F()
305 EXPECT_EQ(0, op->ValueInputCount()); in TEST_F()
326 EXPECT_EQ(0, op->ValueInputCount()); in TEST_F()
[all …]
Dsimplified-operator-unittest.cc95 EXPECT_EQ(pop.value_input_count, op->ValueInputCount()); in TEST_P()
163 EXPECT_EQ(3, op->ValueInputCount()); in TEST_P()
184 EXPECT_EQ(4, op->ValueInputCount()); in TEST_P()
267 EXPECT_EQ(2, op->ValueInputCount()); in TEST_P()
288 EXPECT_EQ(3, op->ValueInputCount()); in TEST_P()
Dmachine-operator-unittest.cc75 EXPECT_EQ(2, op->ValueInputCount()); in TEST_P()
136 EXPECT_EQ(3, op->ValueInputCount()); in TEST_P()
287 EXPECT_EQ(pop.value_input_count, op1->ValueInputCount()); in TEST_F()
353 EXPECT_EQ(pop.value_input_count, op1->ValueInputCount()); in TEST_F()
Djs-operator-unittest.cc81 EXPECT_EQ(sop.value_input_count, op->ValueInputCount()); in TEST_P()
Descape-analysis-unittest.cc466 ASSERT_EQ(1, object_state->op()->ValueInputCount()); in TEST_F()
507 ASSERT_EQ(2, object_state->op()->ValueInputCount()); in TEST_F()
/external/v8/src/compiler/
Dnode-properties.cc20 return FirstValueIndex(node) + node->op()->ValueInputCount(); in PastValueIndex()
52 DCHECK(0 <= index && index < node->op()->ValueInputCount()); in GetValueInput()
89 node->op()->ValueInputCount()); in IsValueEdge()
138 DCHECK(index < node->op()->ValueInputCount()); in ReplaceValueInput()
145 int value_input_count = node->op()->ValueInputCount(); in ReplaceValueInputs()
184 node->TrimInputCount(node->op()->ValueInputCount()); in RemoveNonValueInputs()
190 int value_input_count = node->op()->ValueInputCount(); in RemoveValueInputs()
418 int input_count = node->op()->ValueInputCount(); in AllValueInputsAreTyped()
Dgraph-replay.cc64 PrintF("kMachAnyTagged, %d", op->ValueInputCount()); in PrintReplayOpCreator()
67 PrintF("%d", op->ValueInputCount()); in PrintReplayOpCreator()
Dtail-call-optimization.cc69 for (int index = 0; index < call->op()->ValueInputCount(); ++index) { in Reduce()
Doperator-properties.cc116 return op->ValueInputCount() + GetContextInputCount(op) + in GetTotalInputCount()
Descape-analysis.cc408 node1->op()->ValueInputCount() != node2->op()->ValueInputCount()) { in IsEquivalentPhi()
411 for (int i = 0; i < node1->op()->ValueInputCount(); ++i) { in IsEquivalentPhi()
423 if (phi->op()->ValueInputCount() != inputs.size()) { in IsEquivalentPhi()
486 : at->op()->ValueInputCount(); in MergeFrom()
756 if (edge.index() >= use->op()->ValueInputCount() + in CheckUsesForEscape()
1081 if (edge.index() >= use->op()->ValueInputCount() + in ProcessAllocationUsers()
1354 for (int i = 0; i < load->op()->ValueInputCount(); ++i) { in ProcessLoadFromPhi()
Doperator.h93 int ValueInputCount() const { return value_in_; } in ValueInputCount() function
Djs-inlining.cc67 return call_->op()->ValueInputCount() - 2; in formal_arguments()
92 int inliner_inputs = call->op()->ValueInputCount(); in InlineCall()
Dredundancy-elimination.cc97 for (int i = a->op()->ValueInputCount(); --i >= 0;) { in IsCompatibleCheck()
Dsimplified-lowering.cc323 int arity = node->op()->ValueInputCount(); in TypePhi()
675 DCHECK_EQ(1, node->op()->ValueInputCount()); in InputIs()
688 DCHECK_EQ(2, node->op()->ValueInputCount()); in BothInputsAre()
743 int tagged_count = node->op()->ValueInputCount() + in VisitInputs()
759 DCHECK_EQ(2, node->op()->ValueInputCount()); in VisitBinop()
776 DCHECK_EQ(1, node->op()->ValueInputCount()); in VisitUnop()
859 for (int i = 1; i < node->op()->ValueInputCount(); i++) { in GetOutputInfoForPhi()
901 int values = node->op()->ValueInputCount(); in VisitPhi()
1087 node->TrimInputCount(new_op->ValueInputCount()); in ChangeToPureOp()
Descape-analysis-reducer.cc249 for (int i = 0; i < node->op()->ValueInputCount(); ++i) { in ReduceDeoptState()
Dverifier.cc111 int value_count = node->op()->ValueInputCount(); in Check()
1234 for (int j = node->op()->ValueInputCount() - 1; j >= 0; j--) { in CheckInputsDominate()
1405 if (phi->InputCount() > phi->op()->ValueInputCount()) { in Run()
Dint64-lowering.cc743 for (int i = 0; i < node->op()->ValueInputCount(); i++) { in LowerNode()
826 int value_count = phi->op()->ValueInputCount(); in PreparePhiReplacement()
Djs-builtin-reducer.cc75 return node_->op()->ValueInputCount() - 2; in GetJSCallArity()
Dgraph-visualizer.cc371 PrintInputs(&i, node->op()->ValueInputCount(), " "); in PrintInputs()
Dinstruction-selector.cc535 call->op()->ValueInputCount(), in InitializeCallBuffer()
1575 const int input_count = node->op()->ValueInputCount(); in VisitPhi()
1818 const int ret_count = ret->op()->ValueInputCount(); in VisitReturn()
Djs-typed-lowering.cc118 DCHECK_EQ(2, op->ValueInputCount()); in ChangeToPureOperator()
152 DCHECK_EQ(2, op->ValueInputCount()); in ChangeToSpeculativeOperator()
159 DCHECK_EQ(2, node_->op()->ValueInputCount()); in ChangeToSpeculativeOperator()
Dbytecode-graph-builder.cc1596 DCHECK_EQ(op->ValueInputCount(), value_input_count); in MakeNode()
/external/v8/test/cctest/compiler/
Dtest-operator.cc275 CHECK_EQ(11, op.ValueInputCount()); in TEST()
Dgraph-builder-tester.h238 CHECK_EQ(op->ValueInputCount(), value_input_count); in MakeNode()
Dtest-js-typed-lowering.cc739 for (int i = 0; i < effect_use->op()->ValueInputCount(); i++) { in TEST()

12