80     Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
83     EXPECT_CALL(editor, Replace(if_false, control));  in TEST_F()
97     Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
100     EXPECT_CALL(editor, Replace(if_false, IsDead()));  in TEST_F()
114     Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
117     EXPECT_CALL(editor, Replace(if_false, control));  in TEST_F()
131     Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
134     EXPECT_CALL(editor, Replace(if_false, IsDead()));  in TEST_F()
148     Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
151     EXPECT_CALL(editor, Replace(if_false, control));  in TEST_F()
165     Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
168     EXPECT_CALL(editor, Replace(if_false, IsDead()));  in TEST_F()
184     Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
189     EXPECT_THAT(if_false, IsIfTrue(branch));  in TEST_F()
205   Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
207       Reduce(graph()->NewNode(common()->Merge(2), if_true, if_false));  in TEST_F()
219   Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
221       Reduce(graph()->NewNode(common()->Merge(2), if_false, if_true));  in TEST_F()
328   Node* if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
330   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);  in TEST_F()
348   Node* if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
350   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);  in TEST_F()
367   Node* if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
368   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);  in TEST_F()
385   Node* if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
386   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);  in TEST_F()
403   Node* if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
404   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);  in TEST_F()
421   Node* if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
422   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);  in TEST_F()
443   Node* if_false = graph()->NewNode(common()->IfFalse(), branch);  in TEST_F()  local
446   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);  in TEST_F()
458                                     IsReturn(vfalse, efalse, if_false)));  in TEST_F()