Cross Reference: /external/v8/test/unittests/compiler/common-operator-reducer-unittest.cc

Lines Matching defs:if_true
79     Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
82     EXPECT_CALL(editor, Replace(if_true, IsDead()));
96     Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
99     EXPECT_CALL(editor, Replace(if_true, control));
113     Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
116     EXPECT_CALL(editor, Replace(if_true, IsDead()));
130     Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
133     EXPECT_CALL(editor, Replace(if_true, control));
147     Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
150     EXPECT_CALL(editor, Replace(if_true, IsDead()));
164     Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
167     EXPECT_CALL(editor, Replace(if_true, control));
183     Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
190     EXPECT_THAT(if_true, IsIfFalse(branch));
204   Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
207       Reduce(graph()->NewNode(common()->Merge(2), if_true, if_false));
218   Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
221       Reduce(graph()->NewNode(common()->Merge(2), if_false, if_true));
326   Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
330   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
346   Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
350   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
366   Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
368   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
384   Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
386   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
402   Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
404   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
420   Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
422   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
440   Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
446   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
457   EXPECT_THAT(graph()->end(), IsEnd(ret, IsReturn(vtrue, etrue, if_true),