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));
149 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
156 EXPECT_THAT(if_true, IsIfFalse(branch));
170 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
173 Reduce(graph()->NewNode(common()->Merge(2), if_true, if_false));
184 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
187 Reduce(graph()->NewNode(common()->Merge(2), if_false, if_true));
292 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
296 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
312 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
316 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
332 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
334 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
350 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
352 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
368 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
370 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
386 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
388 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
406 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
412 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
423 EXPECT_THAT(graph()->end(), IsEnd(ret, IsReturn(vtrue, etrue, if_true),
