Lines Matching defs:if_false
80 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
83 EXPECT_CALL(editor, Replace(if_false, control));
97 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
100 EXPECT_CALL(editor, Replace(if_false, IsDead()));
114 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
117 EXPECT_CALL(editor, Replace(if_false, control));
131 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
134 EXPECT_CALL(editor, Replace(if_false, IsDead()));
150 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
155 EXPECT_THAT(if_false, IsIfTrue(branch));
171 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
173 Reduce(graph()->NewNode(common()->Merge(2), if_true, if_false));
185 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
187 Reduce(graph()->NewNode(common()->Merge(2), if_false, if_true));
294 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
296 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
314 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
316 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
333 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
334 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
351 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
352 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
369 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
370 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
387 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
388 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
409 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
412 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
424 IsReturn(vfalse, efalse, if_false)));
