| /external/v8/test/unittests/compiler/ |
| D | common-operator-unittest.cc | 82 EXPECT_EQ(sop.effect_input_count, op->EffectInputCount()); in TEST_P()
179 EXPECT_EQ(0, op->EffectInputCount()); in TEST_F()
196 EXPECT_EQ(1, op->EffectInputCount()); in TEST_F()
213 EXPECT_EQ(0, op->EffectInputCount()); in TEST_F()
231 EXPECT_EQ(1, op->EffectInputCount()); in TEST_F()
247 EXPECT_EQ(0, op->EffectInputCount()); in TEST_F()
264 EXPECT_EQ(0, op->EffectInputCount()); in TEST_F()
290 EXPECT_EQ(0, op->EffectInputCount()); in TEST_F()
368 EXPECT_EQ(1, op->EffectInputCount()); in TEST_F()
377 EXPECT_EQ(1, op->EffectInputCount()); in TEST_F()
[all …]
|
| D | simplified-operator-unittest.cc | 96 EXPECT_EQ(0, op->EffectInputCount()); in TEST_P()
164 EXPECT_EQ(1, op->EffectInputCount()); in TEST_P()
185 EXPECT_EQ(1, op->EffectInputCount()); in TEST_P()
268 EXPECT_EQ(1, op->EffectInputCount()); in TEST_P()
289 EXPECT_EQ(1, op->EffectInputCount()); in TEST_P()
|
| D | js-operator-unittest.cc | 85 EXPECT_EQ(sop.effect_input_count, op->EffectInputCount()); in TEST_P()
|
| D | machine-operator-unittest.cc | 76 EXPECT_EQ(1, op->EffectInputCount()); in TEST_P()
137 EXPECT_EQ(1, op->EffectInputCount()); in TEST_P()
|
| D | typer-unittest.cc | 74 for (int i = 0; i < op->EffectInputCount(); i++) { in TypeBinaryOp()
|
| /external/v8/src/compiler/ |
| D | node-properties.cc | 40 return FirstEffectIndex(node) + node->op()->EffectInputCount(); in PastEffectIndex()
73 DCHECK(0 <= index && index < node->op()->EffectInputCount()); in GetEffectInput()
113 node->op()->EffectInputCount()); in IsEffectEdge()
169 DCHECK(index < node->op()->EffectInputCount()); in ReplaceEffectInput()
244 DCHECK_EQ(1, effect->op()->EffectInputCount()); in FindFrameStateBefore()
|
| D | redundancy-elimination.cc | 155 int const input_count = node->op()->EffectInputCount(); in ReduceEffectPhi()
177 if (node->op()->EffectInputCount() == 1) { in ReduceOtherNode()
185 DCHECK_EQ(0, node->op()->EffectInputCount()); in ReduceOtherNode()
|
| D | checkpoint-elimination.cc | 24 effect->op()->EffectInputCount() == 1) { in IsRedundantCheckpoint()
|
| D | graph-replay.cc | 70 PrintF("%d", op->EffectInputCount()); in PrintReplayOpCreator()
|
| D | load-elimination.cc | 91 effect->op()->EffectInputCount() != 1) { in ReduceLoadField()
|
| D | operator-properties.cc | 117 GetFrameStateInputCount(op) + op->EffectInputCount() + in GetTotalInputCount()
|
| D | escape-analysis-reducer.cc | 92 if (exists_virtual_allocate_ && node->op()->EffectInputCount() > 0) { in Reduce()
215 DCHECK_GE(node->op()->EffectInputCount(), 1); in ReduceFrameStateUses()
|
| D | escape-analysis.cc | 485 ? at->op()->EffectInputCount() in MergeFrom()
811 if (use->op()->EffectInputCount() == 0 && in CheckUsesForEscape()
812 uses->op()->EffectInputCount() > 0 && in CheckUsesForEscape()
992 if (node->op()->EffectInputCount() == 0 || in IsDanglingEffectNode()
994 (node->op()->EffectInputCount() == 1 && in IsDanglingEffectNode()
1068 if (node->op()->EffectInputCount() > 0) { in Process()
1135 DCHECK_EQ(node->op()->EffectInputCount(), 1); in ForwardVirtualState()
1192 for (int i = 0; i < node->op()->EffectInputCount(); ++i) { in ProcessEffectPhi()
|
| D | store-store-elimination.cc | 165 DCHECK_EQ(node->op()->EffectInputCount(), 1); in PreviousEffectBeforeStoreField()
|
| D | operator.h | 94 int EffectInputCount() const { return effect_in_; } in EffectInputCount() function
|
| D | graph-reducer.cc | 206 if (effect == nullptr && node->op()->EffectInputCount() > 0) { in ReplaceWithValue()
|
| D | js-typed-lowering.cc | 115 DCHECK_EQ(0, op->EffectInputCount()); in ChangeToPureOperator()
121 if (node_->op()->EffectInputCount() > 0) { in ChangeToPureOperator()
146 DCHECK_EQ(1, op->EffectInputCount()); in ChangeToSpeculativeOperator()
154 DCHECK_EQ(1, node_->op()->EffectInputCount()); in ChangeToSpeculativeOperator()
635 if (comparison->EffectInputCount() > 0) { in ReduceJSComparison()
|
| D | effect-control-linearizer.cc | 57 DCHECK_EQ(node->op()->EffectInputCount(), block->PredecessorCount()); in UpdateEffectPhi()
58 for (int i = 0; i < node->op()->EffectInputCount(); i++) { in UpdateEffectPhi()
358 if (node->op()->EffectInputCount() > 0) { in ProcessNode()
359 DCHECK_EQ(1, node->op()->EffectInputCount()); in ProcessNode()
|
| D | graph-visualizer.cc | 376 PrintInputs(&i, node->op()->EffectInputCount(), " Eff:"); in PrintInputs()
|
| D | memory-optimizer.cc | 74 DCHECK_LT(0, node->op()->EffectInputCount()); in VisitNode()
|
| D | verifier.cc | 115 int effect_count = node->op()->EffectInputCount(); in Check()
1468 for (int i = 0; i < node->op()->EffectInputCount(); i++) { in VerifyNode()
|
| D | bytecode-graph-builder.cc | 1601 bool has_effect = op->EffectInputCount() == 1; in MakeNode()
1604 DCHECK_LT(op->EffectInputCount(), 2); in MakeNode()
|
| /external/v8/test/cctest/compiler/ |
| D | graph-builder-tester.h | 243 bool has_effect = op->EffectInputCount() == 1; in MakeNode()
246 CHECK_LT(op->EffectInputCount(), 2); in MakeNode()
|
| D | test-operator.cc | 276 CHECK_EQ(22, op.EffectInputCount()); in TEST()
|
| D | test-js-typed-lowering.cc | 132 if (op->EffectInputCount() > 0) { in Binop()
791 CHECK_LT(0, node->op()->EffectInputCount()); in CheckConverted()
793 CHECK_EQ(0, node->op()->EffectInputCount()); in CheckConverted()
|