Lines Matching defs:b1
315 Branch b1 = NewBranch(p0, loop);
316 Branch b2 = NewBranch(p0, b1.if_true);
321 Node* r = InsertReturn(p0, start(), b1.if_false);
325 Node* b1b = ExpectPeeled(b1.branch, peeled);
326 Node* b1t = ExpectPeeled(b1.if_true, peeled);
327 Node* b1f = ExpectPeeled(b1.if_false, peeled);
330 EXPECT_THAT(ExpectPeeled(b1.if_true, peeled), IsIfTrue(b1b));
342 EXPECT_THAT(r, IsReturn(p0, start(), IsMerge(b1.if_false, b1f)));
349 Branch b1 = NewBranch(p0, loop);
350 Branch b2 = NewBranch(p0, b1.if_true);
358 Node* r = InsertReturn(phi, start(), b1.if_false);
362 Node* b1b = ExpectPeeled(b1.branch, peeled);
363 Node* b1t = ExpectPeeled(b1.if_true, peeled);
364 Node* b1f = ExpectPeeled(b1.if_false, peeled);
367 EXPECT_THAT(ExpectPeeled(b1.if_true, peeled), IsIfTrue(b1b));
389 AllOf(CaptureEq(&merge), IsMerge(b1.if_false, b1f))),
397 Branch b1 = NewBranch(p0, loop);
398 Branch b2 = NewBranch(p0, b1.if_true);
411 Node* r = InsertReturn(phi, start(), b1.if_false);
415 Node* b1b = ExpectPeeled(b1.branch, peeled);
416 Node* b1t = ExpectPeeled(b1.if_true, peeled);
417 Node* b1f = ExpectPeeled(b1.if_false, peeled);
420 EXPECT_THAT(ExpectPeeled(b1.if_true, peeled), IsIfTrue(b1b));
449 AllOf(CaptureEq(&merge), IsMerge(b1.if_false, b1f))),
457 Branch b1 = NewBranch(p0, loop);
458 Branch b2 = NewBranch(p0, b1.if_true);
461 Node* merge = graph()->NewNode(common()->Merge(2), b1.if_false, b2.if_false);
479 Branch b1 = NewBranch(p0, loop);
481 Node* call = graph()->NewNode(&kMockCall, b1.if_true);
487 Node* merge = graph()->NewNode(common()->Merge(2), b1.if_false, if_exception);
