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