| /external/v8/test/unittests/compiler/ |
| D | common-operator-unittest.cc | 83 EXPECT_EQ(sop.control_input_count, op->ControlInputCount()); in TEST_P()
180 EXPECT_EQ(input_count, static_cast<uint32_t>(op->ControlInputCount())); in TEST_F()
197 EXPECT_EQ(1, op->ControlInputCount()); in TEST_F()
214 EXPECT_EQ(1, op->ControlInputCount()); in TEST_F()
232 EXPECT_EQ(1, op->ControlInputCount()); in TEST_F()
248 EXPECT_EQ(1, op->ControlInputCount()); in TEST_F()
265 EXPECT_EQ(1, op->ControlInputCount()); in TEST_F()
291 EXPECT_EQ(0, op->ControlInputCount()); in TEST_F()
400 EXPECT_EQ(1, op->ControlInputCount()); in TEST_F()
|
| D | simplified-operator-unittest.cc | 97 EXPECT_EQ(0, op->ControlInputCount()); in TEST_P()
165 EXPECT_EQ(1, op->ControlInputCount()); in TEST_P()
186 EXPECT_EQ(1, op->ControlInputCount()); in TEST_P()
269 EXPECT_EQ(1, op->ControlInputCount()); in TEST_P()
290 EXPECT_EQ(1, op->ControlInputCount()); in TEST_P()
|
| D | machine-operator-unittest.cc | 77 EXPECT_EQ(1, op->ControlInputCount()); in TEST_P()
138 EXPECT_EQ(1, op->ControlInputCount()); in TEST_P()
288 EXPECT_EQ(pop.control_input_count, op1->ControlInputCount()); in TEST_F()
354 EXPECT_EQ(pop.control_input_count, op1->ControlInputCount()); in TEST_F()
|
| D | js-operator-unittest.cc | 86 EXPECT_EQ(sop.control_input_count, op->ControlInputCount()); in TEST_P()
|
| D | typer-unittest.cc | 77 for (int i = 0; i < op->ControlInputCount(); i++) { in TypeBinaryOp()
|
| /external/v8/src/compiler/ |
| D | node-properties.cc | 46 return FirstControlIndex(node) + node->op()->ControlInputCount(); in PastControlIndex()
80 DCHECK(0 <= index && index < node->op()->ControlInputCount()); in GetControlInput()
121 node->op()->ControlInputCount()); in IsControlEdge()
162 DCHECK(index < node->op()->ControlInputCount()); in ReplaceControlInput()
|
| D | graph-replay.cc | 74 PrintF("%d", op->ControlInputCount()); in PrintReplayOpCreator()
|
| D | control-flow-optimizer.cc | 148 if (edge.from()->op()->ControlInputCount() != 1) return false; in TryCloneBranch()
159 int const input_count = merge->op()->ControlInputCount(); in TryCloneBranch()
|
| D | operator-properties.cc | 118 op->ControlInputCount(); in GetTotalInputCount()
|
| D | dead-code-elimination.cc | 128 int const control_input_count = node->op()->ControlInputCount(); in ReduceNode()
|
| D | verifier.cc | 116 int control_count = node->op()->ControlInputCount(); in Check()
400 CHECK_EQ(value_count, control->op()->ControlInputCount()); in Check()
416 CHECK_EQ(effect_count, control->op()->ControlInputCount()); in Check()
1252 if (node->op()->ControlInputCount() == 1 && in CheckInputsDominate()
1474 for (int i = 0; i < node->op()->ControlInputCount(); i++) { in VerifyNode()
|
| D | operator.h | 95 int ControlInputCount() const { return control_in_; } in ControlInputCount() function
|
| D | graph-reducer.cc | 209 if (control == nullptr && node->op()->ControlInputCount() > 0) { in ReplaceWithValue()
|
| D | branch-elimination.cc | 192 DCHECK_EQ(1, node->op()->ControlInputCount()); in ReduceOtherControl()
|
| D | bytecode-graph-builder.cc | 1600 bool has_control = op->ControlInputCount() == 1; in MakeNode()
1603 DCHECK_LT(op->ControlInputCount(), 2); in MakeNode()
1696 int inputs = control->op()->ControlInputCount() + 1; in MergeControl()
1719 int inputs = control->op()->ControlInputCount(); in MergeEffect()
1736 int inputs = control->op()->ControlInputCount(); in MergeValue()
|
| D | representation-change.cc | 459 if (op->ControlInputCount() > 0) { in InsertConversion()
567 if (op->ControlInputCount() > 0) { in GetCheckedWord32RepresentationFor()
|
| D | osr.cc | 139 for (int j = 0; j < control->op()->ControlInputCount(); j++) { in PeelOuterLoopsForOsr()
|
| D | graph-visualizer.cc | 377 PrintInputs(&i, node->op()->ControlInputCount(), " Ctrl:"); in PrintInputs()
|
| D | effect-control-linearizer.cc | 78 DCHECK_EQ(control->op()->ControlInputCount(), block->PredecessorCount()); in UpdateBlockControl()
79 for (int i = 0; i < control->op()->ControlInputCount(); i++) { in UpdateBlockControl()
379 for (int i = 0; i < node->op()->ControlInputCount(); i++) { in ProcessNode()
|
| D | js-typed-lowering.cc | 117 DCHECK_EQ(0, op->ControlInputCount()); in ChangeToPureOperator()
149 DCHECK_EQ(1, op->ControlInputCount()); in ChangeToSpeculativeOperator()
156 DCHECK_EQ(1, node_->op()->ControlInputCount()); in ChangeToSpeculativeOperator()
|
| D | simplified-lowering.cc | 1082 DCHECK_LT(0, node->op()->ControlInputCount()); in ChangeToPureOp()
1089 DCHECK_EQ(0, node->op()->ControlInputCount()); in ChangeToPureOp()
2080 DCHECK_LT(0, node->op()->ControlInputCount()); in DeferReplacement()
2086 DCHECK_EQ(0, node->op()->ControlInputCount()); in DeferReplacement()
|
| D | ast-graph-builder.cc | 4114 bool has_control = op->ControlInputCount() == 1; in MakeNode()
4117 DCHECK(op->ControlInputCount() < 2); in MakeNode()
4345 int inputs = control->op()->ControlInputCount() + 1; in MergeControl()
4367 int inputs = control->op()->ControlInputCount(); in MergeEffect()
4383 int inputs = control->op()->ControlInputCount(); in MergeValue()
|
| /external/v8/test/cctest/compiler/ |
| D | graph-builder-tester.h | 242 bool has_control = op->ControlInputCount() == 1; in MakeNode()
245 CHECK_LT(op->ControlInputCount(), 2); in MakeNode()
|
| D | test-operator.cc | 277 CHECK_EQ(33, op.ControlInputCount()); in TEST()
|
| D | test-machine-operator-reducer.cc | 214 if (binop->ControlInputCount() > 0) { in CreateBinopNode()
|