24 changes: 12 additions & 12 deletions llvm/test/Analysis/ScalarEvolution/trip-count-implied-addrec.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -17,7 +17,7 @@ define void @nw_implies_nuw(i16 %n) mustprogress {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is %n
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is %n
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1
; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
Expand Down Expand Up @@ -63,7 +63,7 @@ define void @nw_implies_nsw(i16 %n) mustprogress {
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (128 + (-128 smax %n))
; CHECK-NEXT: Predicates:
; CHECK-NEXT: {-128,+,1}<%for.body> Added Flags: <nssw>
; CHECK-NEXT: {-128,+,1}<%for.body> Added Flags: <nssw>
;
entry:
br label %for.body
Expand Down Expand Up @@ -110,7 +110,7 @@ define void @actually_infinite() {
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 257
; CHECK-NEXT: Predicates:
; CHECK-NEXT: {0,+,1}<%for.body> Added Flags: <nusw>
; CHECK-NEXT: {0,+,1}<%for.body> Added Flags: <nusw>
;
entry:
br label %for.body
Expand All @@ -135,7 +135,7 @@ define void @rhs_mustexit_1(i16 %n.raw) mustprogress {
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (1 umax (-1 + (zext i8 (trunc i16 %n.raw to i8) to i16))<nsw>))
; CHECK-NEXT: Predicates:
; CHECK-NEXT: {1,+,1}<nw><%for.body> Added Flags: <nusw>
; CHECK-NEXT: {1,+,1}<nw><%for.body> Added Flags: <nusw>
;
entry:
%n.and = and i16 %n.raw, 255
Expand Down Expand Up @@ -239,7 +239,7 @@ define void @neg_rhs_wrong_range(i16 %n.raw) mustprogress {
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is ((-1 + (2 umax (-1 + (zext i8 (trunc i16 %n.raw to i8) to i16))<nsw>)) /u 2)
; CHECK-NEXT: Predicates:
; CHECK-NEXT: {2,+,2}<nw><%for.body> Added Flags: <nusw>
; CHECK-NEXT: {2,+,2}<nw><%for.body> Added Flags: <nusw>
;
entry:
%n.and = and i16 %n.raw, 255
Expand All @@ -266,7 +266,7 @@ define void @neg_rhs_maybe_infinite(i16 %n.raw) {
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (1 umax (-1 + (zext i8 (trunc i16 %n.raw to i8) to i16))<nsw>))
; CHECK-NEXT: Predicates:
; CHECK-NEXT: {1,+,1}<%for.body> Added Flags: <nusw>
; CHECK-NEXT: {1,+,1}<%for.body> Added Flags: <nusw>
;
entry:
%n.and = and i16 %n.raw, 255
Expand Down Expand Up @@ -295,7 +295,7 @@ define void @rhs_narrow_range(i16 %n.raw) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (1 umax (2 * (zext i7 (trunc i16 (%n.raw /u 2) to i7) to i16))<nuw><nsw>))<nsw>
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (1 umax (2 * (zext i7 (trunc i16 (%n.raw /u 2) to i7) to i16))<nuw><nsw>))<nsw>
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1
; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
%n = and i16 %n.raw, 254
Expand Down Expand Up @@ -345,7 +345,7 @@ define void @ult_constant_rhs(i16 %n.raw, i8 %start) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (255 + (-1 * (zext i8 (1 + %start) to i16))<nsw>)<nsw>
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (255 + (-1 * (zext i8 (1 + %start) to i16))<nsw>)<nsw>
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1
; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
Expand All @@ -370,7 +370,7 @@ define void @ult_constant_rhs_stride2(i16 %n.raw, i8 %start) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is ((1 + (-1 * (zext i8 (2 + %start) to i16))<nsw> + (254 umax (zext i8 (2 + %start) to i16))) /u 2)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is ((1 + (-1 * (zext i8 (2 + %start) to i16))<nsw> + (254 umax (zext i8 (2 + %start) to i16))) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1
; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
br label %for.body
Expand All @@ -395,7 +395,7 @@ define void @ult_constant_rhs_stride2_neg(i16 %n.raw, i8 %start) {
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is ((256 + (-1 * (zext i8 (2 + %start) to i16))<nsw>)<nsw> /u 2)
; CHECK-NEXT: Predicates:
; CHECK-NEXT: {(2 + %start),+,2}<%for.body> Added Flags: <nusw>
; CHECK-NEXT: {(2 + %start),+,2}<%for.body> Added Flags: <nusw>
;
entry:
br label %for.body
Expand All @@ -420,7 +420,7 @@ define void @ult_restricted_rhs(i16 %n.raw) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (1 umax (zext i8 (trunc i16 %n.raw to i8) to i16)))<nsw>
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (1 umax (zext i8 (trunc i16 %n.raw to i8) to i16)))<nsw>
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1
; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
%n = and i16 %n.raw, 255
Expand All @@ -445,7 +445,7 @@ define void @ult_guarded_rhs(i16 %n) {;
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (1 umax %n))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (1 umax %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1
; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
%in_range = icmp ult i16 %n, 256
Expand Down
14 changes: 7 additions & 7 deletions llvm/test/Analysis/ScalarEvolution/trip-count-minmax.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,7 @@ define void @nomulitply(i32 noundef %a, i32 noundef %b) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (%a umin %b))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (%a umin %b))
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1
; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
; No information about a or b. Trip multiple is 1.
; void nomulitple(unsigned a, unsigned b) {
Expand Down Expand Up @@ -65,7 +65,7 @@ define void @umin(i32 noundef %a, i32 noundef %b) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + ((2 * %a) umin (4 * %b)))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + ((2 * %a) umin (4 * %b)))
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1
; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
; void umin(unsigned a, unsigned b) {
; a *= 2;
Expand Down Expand Up @@ -115,7 +115,7 @@ define void @umax(i32 noundef %a, i32 noundef %b) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + ((2 * %a) umax (4 * %b)))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + ((2 * %a) umax (4 * %b)))
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 2
; CHECK-NEXT: Loop %for.body: Trip multiple is 2
;

; void umax(unsigned a, unsigned b) {
Expand Down Expand Up @@ -165,7 +165,7 @@ define void @smin(i32 noundef %a, i32 noundef %b) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + ((2 * %a)<nsw> smin (4 * %b)<nsw>))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + ((2 * %a)<nsw> smin (4 * %b)<nsw>))
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1
; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
; void smin(signed a, signed b) {
; a *= 2;
Expand Down Expand Up @@ -214,7 +214,7 @@ define void @smax(i32 noundef %a, i32 noundef %b) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + ((2 * %a)<nsw> smax (4 * %b)<nsw>))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + ((2 * %a)<nsw> smax (4 * %b)<nsw>))
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 2
; CHECK-NEXT: Loop %for.body: Trip multiple is 2
;
; void smax(signed a, signed b) {
; a *= 2;
Expand Down Expand Up @@ -263,7 +263,7 @@ define void @umin_seq2(i32 %n, i32 %m) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + (1 umax (2 * %n))) umin_seq (-1 + (1 umax (16 * %m))))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (1 umax (2 * %n))) umin_seq (-1 + (1 umax (16 * %m))))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
; Can't find that trip multiple is 2 for this case of umin_seq
entry:
Expand Down Expand Up @@ -301,7 +301,7 @@ define void @umin-3and6(i32 noundef %a, i32 noundef %b) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + ((3 * %a) umin (6 * %b)))
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + ((3 * %a) umin (6 * %b)))
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1
; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
; Trip multiple is 1 because we use GetMinTrailingZeros() to compute trip multiples.
; SCEV cannot compute that the trip multiple is 3.
Expand Down
6 changes: 3 additions & 3 deletions llvm/test/Analysis/ScalarEvolution/trip-count.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@ define void @PR1101(i32 %N) {
; CHECK-NEXT: Loop %bb3: symbolic max backedge-taken count is 10000
; CHECK-NEXT: Loop %bb3: Predicated backedge-taken count is 10000
; CHECK-NEXT: Predicates:
; CHECK: Loop %bb3: Trip multiple is 10001
; CHECK-NEXT: Loop %bb3: Trip multiple is 10001
;
entry:
br label %bb3
Expand Down Expand Up @@ -45,7 +45,7 @@ define i32 @PR22795() {
; CHECK-NEXT: Loop %preheader: symbolic max backedge-taken count is 7
; CHECK-NEXT: Loop %preheader: Predicated backedge-taken count is 7
; CHECK-NEXT: Predicates:
; CHECK: Loop %preheader: Trip multiple is 8
; CHECK-NEXT: Loop %preheader: Trip multiple is 8
;
entry:
%bins = alloca [16 x i64], align 16
Expand Down Expand Up @@ -108,7 +108,7 @@ define void @pr28012(i32 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is -1431655751
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is -1431655751
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 2863311546
; CHECK-NEXT: Loop %loop: Trip multiple is 2863311546
;
entry:
br label %loop
Expand Down
6 changes: 3 additions & 3 deletions llvm/test/Analysis/ScalarEvolution/trip-count10.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -32,7 +32,7 @@ define void @b(i64 %n) nounwind {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is false
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%t0 = icmp sgt i64 %n, 0
Expand All @@ -55,7 +55,7 @@ define void @c(i64 %n) nounwind {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is false
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is false
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%t0 = icmp sgt i64 %n, 0
Expand Down Expand Up @@ -136,7 +136,7 @@ define void @constant_phi_operands() nounwind {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 1
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 1
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 2
; CHECK-NEXT: Loop %loop: Trip multiple is 2
;
entry:
br label %loop
Expand Down
16 changes: 8 additions & 8 deletions llvm/test/Analysis/ScalarEvolution/trip-count14.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ define void @s32_max1(i32 %n, ptr %p) {
; CHECK-NEXT: Loop %do.body: symbolic max backedge-taken count is ((-1 * %n) + ((1 + %n) smax %n)), actual taken count either this or zero.
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is ((-1 * %n) + ((1 + %n) smax %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %do.body: Trip multiple is 1
; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %n, 1
Expand All @@ -35,7 +35,7 @@ define void @s32_max2(i32 %n, ptr %p) {
; CHECK-NEXT: Loop %do.body: symbolic max backedge-taken count is ((-1 * %n) + ((2 + %n) smax %n)), actual taken count either this or zero.
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is ((-1 * %n) + ((2 + %n) smax %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %do.body: Trip multiple is 1
; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %n, 2
Expand All @@ -61,7 +61,7 @@ define void @s32_maxx(i32 %n, i32 %x, ptr %p) {
; CHECK-NEXT: Loop %do.body: symbolic max backedge-taken count is ((-1 * %n) + ((%n + %x) smax %n))
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is ((-1 * %n) + ((%n + %x) smax %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %do.body: Trip multiple is 1
; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %x, %n
Expand Down Expand Up @@ -91,7 +91,7 @@ define void @s32_max2_unpredictable_exit(i32 %n, i32 %x, ptr %p) {
; CHECK-NEXT: symbolic max exit count for if.end: ((-1 * %n) + ((2 + %n) smax %n))
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is (((-1 * %n) + ((2 + %n) smax %n)) umin ((-1 * %n) + %x))
; CHECK-NEXT: Predicates:
; CHECK: Loop %do.body: Trip multiple is 1
; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %n, 2
Expand Down Expand Up @@ -121,7 +121,7 @@ define void @u32_max1(i32 %n, ptr %p) {
; CHECK-NEXT: Loop %do.body: symbolic max backedge-taken count is ((-1 * %n) + ((1 + %n) umax %n)), actual taken count either this or zero.
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is ((-1 * %n) + ((1 + %n) umax %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %do.body: Trip multiple is 1
; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %n, 1
Expand All @@ -147,7 +147,7 @@ define void @u32_max2(i32 %n, ptr %p) {
; CHECK-NEXT: Loop %do.body: symbolic max backedge-taken count is ((-1 * %n) + ((2 + %n) umax %n)), actual taken count either this or zero.
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is ((-1 * %n) + ((2 + %n) umax %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %do.body: Trip multiple is 1
; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %n, 2
Expand All @@ -173,7 +173,7 @@ define void @u32_maxx(i32 %n, i32 %x, ptr %p) {
; CHECK-NEXT: Loop %do.body: symbolic max backedge-taken count is ((-1 * %n) + ((%n + %x) umax %n))
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is ((-1 * %n) + ((%n + %x) umax %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %do.body: Trip multiple is 1
; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %x, %n
Expand Down Expand Up @@ -203,7 +203,7 @@ define void @u32_max2_unpredictable_exit(i32 %n, i32 %x, ptr %p) {
; CHECK-NEXT: symbolic max exit count for if.end: ((-1 * %n) + ((2 + %n) umax %n))
; CHECK-NEXT: Loop %do.body: Predicated backedge-taken count is (((-1 * %n) + ((2 + %n) umax %n)) umin ((-1 * %n) + %x))
; CHECK-NEXT: Predicates:
; CHECK: Loop %do.body: Trip multiple is 1
; CHECK-NEXT: Loop %do.body: Trip multiple is 1
;
entry:
%add = add i32 %n, 2
Expand Down
6 changes: 3 additions & 3 deletions llvm/test/Analysis/ScalarEvolution/trip-count15.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,7 @@ define void @umin_unsigned_check(i64 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (1 + (4096 umin %n))<nuw><nsw>
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (1 + (4096 umin %n))<nuw><nsw>
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%min.cmp = icmp ult i64 4096, %n
Expand Down Expand Up @@ -47,7 +47,7 @@ define void @umin_signed_check(i64 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (1 + (4096 umin %n))<nuw><nsw>
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (1 + (4096 umin %n))<nuw><nsw>
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%min.cmp = icmp ult i64 4096, %n
Expand Down Expand Up @@ -78,7 +78,7 @@ define void @smin_signed_check(i64 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (0 smax (1 + (4096 smin %n))<nsw>)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (0 smax (1 + (4096 smin %n))<nsw>)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%min.cmp = icmp slt i64 4096, %n
Expand Down
2 changes: 1 addition & 1 deletion llvm/test/Analysis/ScalarEvolution/trip-count2.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@ define void @PR1101(i32 %N) {
; CHECK-NEXT: Loop %bb3: symbolic max backedge-taken count is 4
; CHECK-NEXT: Loop %bb3: Predicated backedge-taken count is 4
; CHECK-NEXT: Predicates:
; CHECK: Loop %bb3: Trip multiple is 5
; CHECK-NEXT: Loop %bb3: Trip multiple is 5
;
entry:
br label %bb3
Expand Down
2 changes: 1 addition & 1 deletion llvm/test/Analysis/ScalarEvolution/trip-count3.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -44,7 +44,7 @@ define void @sha_stream_bb3_2E_i(ptr %sha_info, ptr %data1, i32, ptr %buffer_add
; CHECK-NEXT: Loop %bb3.i: symbolic max backedge-taken count is ((63 + (-1 * (63 smin %0)) + %0) /u 64)
; CHECK-NEXT: Loop %bb3.i: Predicated backedge-taken count is ((63 + (-1 * (63 smin %0)) + %0) /u 64)
; CHECK-NEXT: Predicates:
; CHECK: Loop %bb3.i: Trip multiple is 1
; CHECK-NEXT: Loop %bb3.i: Trip multiple is 1
;
newFuncRoot:
br label %bb3.i
Expand Down
2 changes: 1 addition & 1 deletion llvm/test/Analysis/ScalarEvolution/trip-count4.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@ define void @another_count_down_signed(ptr %d, i64 %n) nounwind {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-11 + %n)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-11 + %n)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
br label %loop
Expand Down
2 changes: 1 addition & 1 deletion llvm/test/Analysis/ScalarEvolution/trip-count8.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -12,7 +12,7 @@ define i32 @foo(i32 %ecx) nounwind {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %ecx)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %ecx)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1
; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
%cmp2 = icmp eq i32 %ecx, 0 ; <i1> [#uses=1]
Expand Down
42 changes: 21 additions & 21 deletions llvm/test/Analysis/ScalarEvolution/trip-count9.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -17,7 +17,7 @@ define void @foo(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %n)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %n)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
Expand Down Expand Up @@ -59,7 +59,7 @@ define void @start1(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-2 + (2 smax %n))<nsw>
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-2 + (2 smax %n))<nsw>
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
Expand Down Expand Up @@ -101,7 +101,7 @@ define void @startx(i4 %n, i4 %x) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
Expand Down Expand Up @@ -143,7 +143,7 @@ define void @nsw(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + %n)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %n)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
Expand Down Expand Up @@ -173,7 +173,7 @@ define void @nsw_step2(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + %n) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + %n) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
Expand All @@ -195,7 +195,7 @@ define void @nsw_start1(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-2 + (2 smax %n))<nsw>
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-2 + (2 smax %n))<nsw>
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
Expand All @@ -217,7 +217,7 @@ define void @nsw_start1_step2(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-2 + (3 smax %n))<nsw> /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-2 + (3 smax %n))<nsw> /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
Expand All @@ -239,7 +239,7 @@ define void @nsw_startx(i4 %n, i4 %x) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
Expand All @@ -261,7 +261,7 @@ define void @nsw_startx_step2(i4 %n, i4 %x) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax %n)) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax %n)) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
Expand All @@ -283,7 +283,7 @@ define void @even(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (2 * %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (2 * %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 2
; CHECK-NEXT: Loop %loop: Trip multiple is 2
;
entry:
%m = shl i4 %n, 1
Expand All @@ -306,7 +306,7 @@ define void @even_step2(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + (2 * %n)) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (2 * %n)) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
Expand All @@ -329,7 +329,7 @@ define void @even_start1(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-2 + (2 * %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-2 + (2 * %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
Expand All @@ -352,7 +352,7 @@ define void @even_start1_step2(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-2 + (2 * %n)) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-2 + (2 * %n)) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
Expand All @@ -375,7 +375,7 @@ define void @even_startx(i4 %n, i4 %x) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax (2 * %n)))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax (2 * %n)))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
Expand All @@ -398,7 +398,7 @@ define void @even_startx_step2(i4 %n, i4 %x) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax (2 * %n))) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax (2 * %n))) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
Expand All @@ -421,7 +421,7 @@ define void @even_nsw(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (2 * %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (2 * %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 2
; CHECK-NEXT: Loop %loop: Trip multiple is 2
;
entry:
%m = shl i4 %n, 1
Expand All @@ -444,7 +444,7 @@ define void @even_nsw_step2(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + (2 * %n)) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (2 * %n)) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
Expand All @@ -467,7 +467,7 @@ define void @even_nsw_start1(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-2 + (2 * %n))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-2 + (2 * %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
Expand All @@ -490,7 +490,7 @@ define void @even_nsw_start1_step2(i4 %n) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-2 + (2 * %n)) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-2 + (2 * %n)) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
Expand All @@ -513,7 +513,7 @@ define void @even_nsw_startx(i4 %n, i4 %x) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax (2 * %n)))
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax (2 * %n)))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
Expand All @@ -536,7 +536,7 @@ define void @even_nsw_startx_step2(i4 %n, i4 %x) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax (2 * %n))) /u 2)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax (2 * %n))) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
Expand Down
32 changes: 16 additions & 16 deletions llvm/test/Analysis/ScalarEvolution/trip-multiple-guard-info.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,7 @@ define void @test_trip_multiple_4(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
Expand Down Expand Up @@ -53,7 +53,7 @@ define void @test_trip_multiple_4_guard(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
Expand Down Expand Up @@ -89,7 +89,7 @@ define void @test_trip_multiple_4_ugt_5(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
Expand Down Expand Up @@ -125,7 +125,7 @@ define void @test_trip_multiple_4_ugt_5_order_swapped(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
Expand Down Expand Up @@ -160,7 +160,7 @@ define void @test_trip_multiple_4_sgt_5(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
Expand Down Expand Up @@ -196,7 +196,7 @@ define void @test_trip_multiple_4_sgt_5_order_swapped(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
Expand Down Expand Up @@ -231,7 +231,7 @@ define void @test_trip_multiple_4_uge_5(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
Expand Down Expand Up @@ -267,7 +267,7 @@ define void @test_trip_multiple_4_uge_5_order_swapped(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
Expand Down Expand Up @@ -303,7 +303,7 @@ define void @test_trip_multiple_4_sge_5(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
Expand Down Expand Up @@ -338,7 +338,7 @@ define void @test_trip_multiple_4_sge_5_order_swapped(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
Expand Down Expand Up @@ -374,7 +374,7 @@ define void @test_trip_multiple_4_icmp_ops_swapped(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%u = urem i32 %num, 4
Expand Down Expand Up @@ -409,7 +409,7 @@ define void @test_trip_multiple_4_upper_lower_bounds(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%cmp.1 = icmp uge i32 %num, 5
Expand Down Expand Up @@ -446,7 +446,7 @@ define void @test_trip_multiple_4_upper_lower_bounds_swapped1(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%cmp.1 = icmp uge i32 %num, 5
Expand Down Expand Up @@ -483,7 +483,7 @@ define void @test_trip_multiple_4_upper_lower_bounds_swapped2(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%cmp.1 = icmp uge i32 %num, 5
Expand Down Expand Up @@ -520,7 +520,7 @@ define void @test_trip_multiple_5(i32 %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 5
; CHECK-NEXT: Loop %for.body: Trip multiple is 5
;
entry:
%u = urem i32 %num, 5
Expand Down Expand Up @@ -557,7 +557,7 @@ define void @test_trunc_operand_larger_than_urem_expr(i64 %N) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %N)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %N)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 1
; CHECK-NEXT: Loop %for.body: Trip multiple is 1
;
entry:
%conv = trunc i64 %N to i32
Expand Down
16 changes: 8 additions & 8 deletions llvm/test/Analysis/ScalarEvolution/trip-multiple.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -29,7 +29,7 @@ define void @trip_multiple_3(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 3
; CHECK-NEXT: Loop %for.body: Trip multiple is 3
;
entry:
%rem = urem i32 %num, 3
Expand Down Expand Up @@ -65,7 +65,7 @@ define void @trip_multiple_4(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 4
; CHECK-NEXT: Loop %for.body: Trip multiple is 4
;
entry:
%rem = urem i32 %num, 4
Expand Down Expand Up @@ -102,7 +102,7 @@ define void @trip_multiple_5(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 5
; CHECK-NEXT: Loop %for.body: Trip multiple is 5
;
entry:
%rem = urem i32 %num, 5
Expand Down Expand Up @@ -139,7 +139,7 @@ define void @trip_multiple_6(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 6
; CHECK-NEXT: Loop %for.body: Trip multiple is 6
;
entry:
%rem = urem i32 %num, 6
Expand Down Expand Up @@ -176,7 +176,7 @@ define void @trip_multiple_7(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 7
; CHECK-NEXT: Loop %for.body: Trip multiple is 7
;
entry:
%rem = urem i32 %num, 7
Expand Down Expand Up @@ -213,7 +213,7 @@ define void @trip_multiple_8(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 8
; CHECK-NEXT: Loop %for.body: Trip multiple is 8
;
entry:
%rem = urem i32 %num, 8
Expand Down Expand Up @@ -249,7 +249,7 @@ define void @trip_multiple_9(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 9
; CHECK-NEXT: Loop %for.body: Trip multiple is 9
;
entry:
%rem = urem i32 %num, 9
Expand Down Expand Up @@ -285,7 +285,7 @@ define void @trip_multiple_10(i32 noundef %num) {
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + %num)
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + %num)
; CHECK-NEXT: Predicates:
; CHECK: Loop %for.body: Trip multiple is 10
; CHECK-NEXT: Loop %for.body: Trip multiple is 10
;
entry:
%rem = urem i32 %num, 10
Expand Down
18 changes: 9 additions & 9 deletions llvm/test/Analysis/ScalarEvolution/umin-umax-folds.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -20,7 +20,7 @@ define void @umin_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
Expand Down Expand Up @@ -56,7 +56,7 @@ define void @ule_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
Expand Down Expand Up @@ -92,7 +92,7 @@ define void @uge_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (sext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (sext i32 %len to i64)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
Expand Down Expand Up @@ -128,7 +128,7 @@ define void @ult_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
Expand Down Expand Up @@ -164,7 +164,7 @@ define void @ugt_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (sext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (sext i32 %len to i64)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
Expand Down Expand Up @@ -200,7 +200,7 @@ define void @sle_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
Expand Down Expand Up @@ -236,7 +236,7 @@ define void @sge_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
Expand Down Expand Up @@ -272,7 +272,7 @@ define void @slt_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (sext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (sext i32 %len to i64)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
Expand Down Expand Up @@ -308,7 +308,7 @@ define void @sgt_sext_x_zext_x(i32 %len) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (zext i32 %len to i64)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
; CHECK-NEXT: Loop %loop: Trip multiple is 1
;
entry:
%len.zext = zext i32 %len to i64
Expand Down
2 changes: 1 addition & 1 deletion llvm/test/Analysis/ScalarEvolution/unknown_phis.ll
View file
Original file line number Diff line number Diff line change
Expand Up @@ -52,7 +52,7 @@ define void @merge_values_with_ranges_looped(ptr %a_len_ptr, ptr %b_len_ptr) {
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is 99
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is 99
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 100
; CHECK-NEXT: Loop %loop: Trip multiple is 100
;

entry:
Expand Down