1; NOTE: Assertions have been autogenerated by utils/update_test_checks.py 2; RUN: opt -passes=instcombine -S < %s | FileCheck %s 3 4; Check that we can turn the icmp sle into icmp ult, regardless of the 5; order of the incoming values of the PHI node. 6 7declare i1 @cond() 8 9define void @phi_recurrence_start_first() { 10; CHECK-LABEL: @phi_recurrence_start_first( 11; CHECK-NEXT: entry: 12; CHECK-NEXT: br label [[WHILE_COND:%.*]] 13; CHECK: while.cond: 14; CHECK-NEXT: [[CELL_0:%.*]] = phi i32 [ 0, [[ENTRY:%.*]] ], [ [[START:%.*]], [[FOR_COND26:%.*]] ] 15; CHECK-NEXT: [[COND_V:%.*]] = call i1 @cond() 16; CHECK-NEXT: br i1 [[COND_V]], label [[IF_THEN:%.*]], label [[WHILE_END:%.*]] 17; CHECK: if.then: 18; CHECK-NEXT: [[START]] = add nuw nsw i32 [[CELL_0]], 1 19; CHECK-NEXT: [[COND_V2:%.*]] = call i1 @cond() 20; CHECK-NEXT: br i1 [[COND_V2]], label [[FOR_COND11:%.*]], label [[FOR_COND26]] 21; CHECK: for.cond11: 22; CHECK-NEXT: [[I_1:%.*]] = phi i32 [ [[START]], [[IF_THEN]] ], [ [[STEP:%.*]], [[FOR_COND11]] ] 23; CHECK-NEXT: [[CMP13:%.*]] = icmp samesign ult i32 [[I_1]], 100 24; CHECK-NEXT: [[STEP]] = add nuw nsw i32 [[I_1]], 1 25; CHECK-NEXT: br i1 [[CMP13]], label [[FOR_COND11]], label [[WHILE_END]] 26; CHECK: for.cond26: 27; CHECK-NEXT: br label [[WHILE_COND]] 28; CHECK: while.end: 29; CHECK-NEXT: ret void 30; 31entry: 32 br label %while.cond 33 34while.cond: ; preds = %entry, %for.cond26 35 %cell.0 = phi i32 [ 0, %entry ], [ %start, %for.cond26 ] 36 %cond.v = call i1 @cond() 37 br i1 %cond.v, label %if.then, label %while.end 38 39if.then: ; preds = %while.cond 40 %start = add nsw i32 %cell.0, 1 41 %cond.v2 = call i1 @cond() 42 br i1 %cond.v2, label %for.cond11, label %for.cond26 43 44for.cond11: ; preds = %for.cond11, %if.then 45 %i.1 = phi i32 [ %start, %if.then ], [ %step, %for.cond11 ] 46 %cmp13 = icmp sle i32 %i.1, 99 47 %step = add nsw i32 %i.1, 1 48 br i1 %cmp13, label %for.cond11, label %while.end 49 50for.cond26: ; preds = %if.then 51 br label %while.cond 52 53while.end: ; preds = %while.cond, %for.cond11 54 ret void 55} 56 57define void @phi_recurrence_step_first() { 58; CHECK-LABEL: @phi_recurrence_step_first( 59; CHECK-NEXT: entry: 60; CHECK-NEXT: br label [[WHILE_COND:%.*]] 61; CHECK: while.cond: 62; CHECK-NEXT: [[CELL_0:%.*]] = phi i32 [ 0, [[ENTRY:%.*]] ], [ [[START:%.*]], [[FOR_COND26:%.*]] ] 63; CHECK-NEXT: [[COND_V:%.*]] = call i1 @cond() 64; CHECK-NEXT: br i1 [[COND_V]], label [[IF_THEN:%.*]], label [[WHILE_END:%.*]] 65; CHECK: if.then: 66; CHECK-NEXT: [[START]] = add nuw nsw i32 [[CELL_0]], 1 67; CHECK-NEXT: [[COND_V2:%.*]] = call i1 @cond() 68; CHECK-NEXT: br i1 [[COND_V2]], label [[FOR_COND11:%.*]], label [[FOR_COND26]] 69; CHECK: for.cond11: 70; CHECK-NEXT: [[I_1:%.*]] = phi i32 [ [[STEP:%.*]], [[FOR_COND11]] ], [ [[START]], [[IF_THEN]] ] 71; CHECK-NEXT: [[CMP13:%.*]] = icmp samesign ult i32 [[I_1]], 100 72; CHECK-NEXT: [[STEP]] = add nuw nsw i32 [[I_1]], 1 73; CHECK-NEXT: br i1 [[CMP13]], label [[FOR_COND11]], label [[WHILE_END]] 74; CHECK: for.cond26: 75; CHECK-NEXT: br label [[WHILE_COND]] 76; CHECK: while.end: 77; CHECK-NEXT: ret void 78; 79entry: 80 br label %while.cond 81 82while.cond: ; preds = %entry, %for.cond26 83 %cell.0 = phi i32 [ 0, %entry ], [ %start, %for.cond26 ] 84 %cond.v = call i1 @cond() 85 br i1 %cond.v, label %if.then, label %while.end 86 87if.then: ; preds = %while.cond 88 %start = add nsw i32 %cell.0, 1 89 %cond.v2 = call i1 @cond() 90 br i1 %cond.v2, label %for.cond11, label %for.cond26 91 92for.cond11: ; preds = %for.cond11, %if.then 93 %i.1 = phi i32 [ %step, %for.cond11 ], [ %start, %if.then] 94 %cmp13 = icmp sle i32 %i.1, 99 95 %step = add nsw i32 %i.1, 1 96 br i1 %cmp13, label %for.cond11, label %while.end 97 98for.cond26: ; preds = %if.then 99 br label %while.cond 100 101while.end: ; preds = %while.cond, %for.cond11 102 ret void 103} 104