1*0ab368c5SRamkumar Ramachandra; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 5 2*0ab368c5SRamkumar Ramachandra; RUN: opt < %s -disable-output -passes="print<scalar-evolution>" \ 3*0ab368c5SRamkumar Ramachandra; RUN: -scalar-evolution-classify-expressions=0 2>&1 | FileCheck %s 4*0ab368c5SRamkumar Ramachandra 5*0ab368c5SRamkumar Ramachandradefine void @implied1(i32 %n) { 6*0ab368c5SRamkumar Ramachandra; Prove that (n s> 1) ===> (n - 1 s> 0). 7*0ab368c5SRamkumar Ramachandra; CHECK-LABEL: 'implied1' 8*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Determining loop execution counts for: @implied1 9*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: backedge-taken count is (-2 + %n) 10*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: constant max backedge-taken count is i32 2147483645 11*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: symbolic max backedge-taken count is (-2 + %n) 12*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: Trip multiple is 1 13*0ab368c5SRamkumar Ramachandra; 14*0ab368c5SRamkumar Ramachandraentry: 15*0ab368c5SRamkumar Ramachandra %cmp1 = icmp sgt i32 %n, 1 16*0ab368c5SRamkumar Ramachandra %n.minus.1 = sub nsw i32 %n, 1 17*0ab368c5SRamkumar Ramachandra call void @llvm.assume(i1 %cmp1) 18*0ab368c5SRamkumar Ramachandra br label %header 19*0ab368c5SRamkumar Ramachandra 20*0ab368c5SRamkumar Ramachandraheader: 21*0ab368c5SRamkumar Ramachandra %indvar = phi i32 [ %indvar.next, %header ], [ 0, %entry ] 22*0ab368c5SRamkumar Ramachandra %indvar.next = add i32 %indvar, 1 23*0ab368c5SRamkumar Ramachandra %exitcond = icmp sgt i32 %n.minus.1, %indvar.next 24*0ab368c5SRamkumar Ramachandra br i1 %exitcond, label %header, label %exit 25*0ab368c5SRamkumar Ramachandra 26*0ab368c5SRamkumar Ramachandraexit: 27*0ab368c5SRamkumar Ramachandra ret void 28*0ab368c5SRamkumar Ramachandra} 29*0ab368c5SRamkumar Ramachandra 30*0ab368c5SRamkumar Ramachandradefine void @implied1_neg(i32 %n) { 31*0ab368c5SRamkumar Ramachandra; Prove that (n s> 0) =\=> (n - 1 s> 0). 32*0ab368c5SRamkumar Ramachandra; CHECK-LABEL: 'implied1_neg' 33*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Determining loop execution counts for: @implied1_neg 34*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: backedge-taken count is (-1 + (1 smax (-1 + %n)<nsw>))<nsw> 35*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: constant max backedge-taken count is i32 2147483645 36*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: symbolic max backedge-taken count is (-1 + (1 smax (-1 + %n)<nsw>))<nsw> 37*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: Trip multiple is 1 38*0ab368c5SRamkumar Ramachandra; 39*0ab368c5SRamkumar Ramachandraentry: 40*0ab368c5SRamkumar Ramachandra %cmp1 = icmp sgt i32 %n, 0 41*0ab368c5SRamkumar Ramachandra %n.minus.1 = sub nsw i32 %n, 1 42*0ab368c5SRamkumar Ramachandra call void @llvm.assume(i1 %cmp1) 43*0ab368c5SRamkumar Ramachandra br label %header 44*0ab368c5SRamkumar Ramachandra 45*0ab368c5SRamkumar Ramachandraheader: 46*0ab368c5SRamkumar Ramachandra %indvar = phi i32 [ %indvar.next, %header ], [ 0, %entry ] 47*0ab368c5SRamkumar Ramachandra %indvar.next = add i32 %indvar, 1 48*0ab368c5SRamkumar Ramachandra %exitcond = icmp sgt i32 %n.minus.1, %indvar.next 49*0ab368c5SRamkumar Ramachandra br i1 %exitcond, label %header, label %exit 50*0ab368c5SRamkumar Ramachandra 51*0ab368c5SRamkumar Ramachandraexit: 52*0ab368c5SRamkumar Ramachandra ret void 53*0ab368c5SRamkumar Ramachandra} 54*0ab368c5SRamkumar Ramachandra 55*0ab368c5SRamkumar Ramachandradefine void @implied2(i32 %n) { 56*0ab368c5SRamkumar Ramachandra; Prove that (n u>= -1) ===> (n + 1 u>= 0). 57*0ab368c5SRamkumar Ramachandra; CHECK-LABEL: 'implied2' 58*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Determining loop execution counts for: @implied2 59*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: Unpredictable backedge-taken count. 60*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: Unpredictable constant max backedge-taken count. 61*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: Unpredictable symbolic max backedge-taken count. 62*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: Predicated backedge-taken count is (1 + (zext i32 %n to i64))<nuw><nsw> 63*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Predicates: 64*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: {1,+,1}<%header> Added Flags: <nusw> 65*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: Predicated constant max backedge-taken count is i64 4294967296 66*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Predicates: 67*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: {1,+,1}<%header> Added Flags: <nusw> 68*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: Predicated symbolic max backedge-taken count is (1 + (zext i32 %n to i64))<nuw><nsw> 69*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Predicates: 70*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: {1,+,1}<%header> Added Flags: <nusw> 71*0ab368c5SRamkumar Ramachandra; 72*0ab368c5SRamkumar Ramachandraentry: 73*0ab368c5SRamkumar Ramachandra %cmp1 = icmp uge i32 %n, -1 74*0ab368c5SRamkumar Ramachandra %n.1 = add nuw i32 %n, 1 75*0ab368c5SRamkumar Ramachandra call void @llvm.assume(i1 %cmp1) 76*0ab368c5SRamkumar Ramachandra br label %header 77*0ab368c5SRamkumar Ramachandra 78*0ab368c5SRamkumar Ramachandraheader: 79*0ab368c5SRamkumar Ramachandra %indvar = phi i32 [ %indvar.next, %header ], [ 0, %entry ] 80*0ab368c5SRamkumar Ramachandra %indvar.next = add i32 %indvar, 1 81*0ab368c5SRamkumar Ramachandra %exitcond = icmp uge i32 %n.1, %indvar.next 82*0ab368c5SRamkumar Ramachandra br i1 %exitcond, label %header, label %exit 83*0ab368c5SRamkumar Ramachandra 84*0ab368c5SRamkumar Ramachandraexit: 85*0ab368c5SRamkumar Ramachandra ret void 86*0ab368c5SRamkumar Ramachandra} 87*0ab368c5SRamkumar Ramachandra 88*0ab368c5SRamkumar Ramachandradefine void @implied2_neg(i32 %n) { 89*0ab368c5SRamkumar Ramachandra; Prove that (n u>= -1) =\=> (n - 1 s>= 0). 90*0ab368c5SRamkumar Ramachandra; CHECK-LABEL: 'implied2_neg' 91*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Determining loop execution counts for: @implied2_neg 92*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: backedge-taken count is (-1 + (1 smax %n))<nsw> 93*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: constant max backedge-taken count is i32 2147483646 94*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: symbolic max backedge-taken count is (-1 + (1 smax %n))<nsw> 95*0ab368c5SRamkumar Ramachandra; CHECK-NEXT: Loop %header: Trip multiple is 1 96*0ab368c5SRamkumar Ramachandra; 97*0ab368c5SRamkumar Ramachandraentry: 98*0ab368c5SRamkumar Ramachandra %cmp1 = icmp uge i32 %n, -1 99*0ab368c5SRamkumar Ramachandra %n.minus.1 = sub nuw nsw i32 %n, 1 100*0ab368c5SRamkumar Ramachandra call void @llvm.assume(i1 %cmp1) 101*0ab368c5SRamkumar Ramachandra br label %header 102*0ab368c5SRamkumar Ramachandra 103*0ab368c5SRamkumar Ramachandraheader: 104*0ab368c5SRamkumar Ramachandra %indvar = phi i32 [ %indvar.next, %header ], [ 0, %entry ] 105*0ab368c5SRamkumar Ramachandra %indvar.next = add i32 %indvar, 1 106*0ab368c5SRamkumar Ramachandra %exitcond = icmp sge i32 %n.minus.1, %indvar.next 107*0ab368c5SRamkumar Ramachandra br i1 %exitcond, label %header, label %exit 108*0ab368c5SRamkumar Ramachandra 109*0ab368c5SRamkumar Ramachandraexit: 110*0ab368c5SRamkumar Ramachandra ret void 111*0ab368c5SRamkumar Ramachandra} 112