39   Node* if_false;  member
130     Node* if_false = graph()->NewNode(common()->IfFalse(), branch);  in NewBranch()  local
131     return {branch, if_true, if_false};  in NewBranch()
319   loop->ReplaceInput(2, b2.if_false);  in TEST_F()
321   Node* r = InsertReturn(p0, start(), b1.if_false);  in TEST_F()
327   Node* b1f = ExpectPeeled(b1.if_false, peeled);  in TEST_F()
335   Node* b2f = ExpectPeeled(b2.if_false, peeled);  in TEST_F()
341   EXPECT_THAT(loop, IsLoop(IsMerge(b2t, b2f), b2.if_true, b2.if_false));  in TEST_F()
342   EXPECT_THAT(r, IsReturn(p0, start(), IsMerge(b1.if_false, b1f)));  in TEST_F()
356   loop->ReplaceInput(2, b2.if_false);  in TEST_F()
358   Node* r = InsertReturn(phi, start(), b1.if_false);  in TEST_F()
364   Node* b1f = ExpectPeeled(b1.if_false, peeled);  in TEST_F()
372   Node* b2f = ExpectPeeled(b2.if_false, peeled);  in TEST_F()
378   EXPECT_THAT(loop, IsLoop(IsMerge(b2t, b2f), b2.if_true, b2.if_false));  in TEST_F()
389                         AllOf(CaptureEq(&merge), IsMerge(b1.if_false, b1f))),  in TEST_F()
409   loop->ReplaceInput(2, b2.if_false);  in TEST_F()
411   Node* r = InsertReturn(phi, start(), b1.if_false);  in TEST_F()
417   Node* b1f = ExpectPeeled(b1.if_false, peeled);  in TEST_F()
425   Node* b2f = ExpectPeeled(b2.if_false, peeled);  in TEST_F()
433                            b2.if_true, b2.if_false));  in TEST_F()
449                         AllOf(CaptureEq(&merge), IsMerge(b1.if_false, b1f))),  in TEST_F()
461   Node* merge = graph()->NewNode(common()->Merge(2), b1.if_false, b2.if_false);  in TEST_F()
487   Node* merge = graph()->NewNode(common()->Merge(2), b1.if_false, if_exception);  in TEST_F()