104 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_test_checks.py2; RUN: opt -passes=instcombine -S < %s | FileCheck %s3 4; Check that we can turn the icmp sle into icmp ult, regardless of the5; 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]], 119; 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]], 10024; CHECK-NEXT: [[STEP]] = add nuw nsw i32 [[I_1]], 125; 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 void30;31entry:32 br label %while.cond33 34while.cond: ; preds = %entry, %for.cond2635 %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.end38 39if.then: ; preds = %while.cond40 %start = add nsw i32 %cell.0, 141 %cond.v2 = call i1 @cond()42 br i1 %cond.v2, label %for.cond11, label %for.cond2643 44for.cond11: ; preds = %for.cond11, %if.then45 %i.1 = phi i32 [ %start, %if.then ], [ %step, %for.cond11 ]46 %cmp13 = icmp sle i32 %i.1, 9947 %step = add nsw i32 %i.1, 148 br i1 %cmp13, label %for.cond11, label %while.end49 50for.cond26: ; preds = %if.then51 br label %while.cond52 53while.end: ; preds = %while.cond, %for.cond1154 ret void55}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]], 167; 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]], 10072; CHECK-NEXT: [[STEP]] = add nuw nsw i32 [[I_1]], 173; 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 void78;79entry:80 br label %while.cond81 82while.cond: ; preds = %entry, %for.cond2683 %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.end86 87if.then: ; preds = %while.cond88 %start = add nsw i32 %cell.0, 189 %cond.v2 = call i1 @cond()90 br i1 %cond.v2, label %for.cond11, label %for.cond2691 92for.cond11: ; preds = %for.cond11, %if.then93 %i.1 = phi i32 [ %step, %for.cond11 ], [ %start, %if.then]94 %cmp13 = icmp sle i32 %i.1, 9995 %step = add nsw i32 %i.1, 196 br i1 %cmp13, label %for.cond11, label %while.end97 98for.cond26: ; preds = %if.then99 br label %while.cond100 101while.end: ; preds = %while.cond, %for.cond11102 ret void103}104