[llvm] b9f571f - [SCEV] Cover more multipler/divisor combinations in folding test.
Florian Hahn via llvm-commits
llvm-commits at lists.llvm.org
Mon Sep 8 06:19:01 PDT 2025
Author: Florian Hahn
Date: 2025-09-08T14:18:00+01:00
New Revision: b9f571f834742e05d4edca67e4733bc1d40ec58c
URL: https://github.com/llvm/llvm-project/commit/b9f571f834742e05d4edca67e4733bc1d40ec58c
DIFF: https://github.com/llvm/llvm-project/commit/b9f571f834742e05d4edca67e4733bc1d40ec58c.diff
LOG: [SCEV] Cover more multipler/divisor combinations in folding test.
Consolidate tests for multiple divisors in a single loop, add multiplies
by 1, 2, 5, 6.
Extends test coverage for
https://github.com/llvm/llvm-project/pull/157159.
Added:
Modified:
llvm/test/Analysis/ScalarEvolution/mul-udiv-folds.ll
Removed:
################################################################################
diff --git a/llvm/test/Analysis/ScalarEvolution/mul-udiv-folds.ll b/llvm/test/Analysis/ScalarEvolution/mul-udiv-folds.ll
index 9f4360d2ae383..b5d976ba3acda 100644
--- a/llvm/test/Analysis/ScalarEvolution/mul-udiv-folds.ll
+++ b/llvm/test/Analysis/ScalarEvolution/mul-udiv-folds.ll
@@ -3,9 +3,9 @@
declare void @use(ptr)
-define void @udiv4_and_udiv2_mul_4(i1 %c, ptr %A) {
-; CHECK-LABEL: 'udiv4_and_udiv2_mul_4'
-; CHECK-NEXT: Classifying expressions for: @udiv4_and_udiv2_mul_4
+define void @udiv4_and_udiv2(i1 %c, ptr %A) {
+; CHECK-LABEL: 'udiv4_and_udiv2'
+; CHECK-NEXT: Classifying expressions for: @udiv4_and_udiv2
; CHECK-NEXT: %start = select i1 %c, i32 512, i32 0
; CHECK-NEXT: --> %start U: [0,513) S: [0,513)
; CHECK-NEXT: %div.2 = lshr i32 %start, 1
@@ -18,56 +18,19 @@ define void @udiv4_and_udiv2_mul_4(i1 %c, ptr %A) {
; CHECK-NEXT: --> ((zext i32 %start to i64) /u 2) U: [0,257) S: [0,257)
; CHECK-NEXT: %iv = phi i64 [ %iv.start, %entry ], [ %iv.next, %loop ]
; CHECK-NEXT: --> {((zext i32 %start to i64) /u 4),+,1}<%loop> U: full-set S: full-set Exits: ((zext i32 %start to i64) /u 2) LoopDispositions: { %loop: Computable }
-; CHECK-NEXT: %gep = getelementptr i32, ptr %A, i64 %iv
-; CHECK-NEXT: --> {((zext i32 %start to i64) + %A),+,4}<%loop> U: full-set S: full-set Exits: ((zext i32 %start to i64) + (4 * ((zext i32 %start to i64) /u 2))<nuw><nsw> + (-4 * ((zext i32 %start to i64) /u 4))<nsw> + %A) LoopDispositions: { %loop: Computable }
-; CHECK-NEXT: %iv.next = add i64 %iv, 1
-; CHECK-NEXT: --> {(1 + ((zext i32 %start to i64) /u 4))<nuw><nsw>,+,1}<%loop> U: full-set S: full-set Exits: (1 + ((zext i32 %start to i64) /u 2))<nuw><nsw> LoopDispositions: { %loop: Computable }
-; CHECK-NEXT: Determining loop execution counts for: @udiv4_and_udiv2_mul_4
-; CHECK-NEXT: Loop %loop: backedge-taken count is ((-1 * ((zext i32 %start to i64) /u 4))<nsw> + ((zext i32 %start to i64) /u 2))
-; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i64 -1
-; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 * ((zext i32 %start to i64) /u 4))<nsw> + ((zext i32 %start to i64) /u 2))
-; CHECK-NEXT: Loop %loop: Trip multiple is 1
-;
-entry:
- %start = select i1 %c, i32 512, i32 0
- %div.2 = lshr i32 %start, 1
- %div.4 = lshr i32 %start, 2
- %iv.start = zext i32 %div.4 to i64
- %wide.trip.count = zext i32 %div.2 to i64
- br label %loop
-
-loop:
- %iv = phi i64 [ %iv.start, %entry ], [ %iv.next, %loop ]
- %gep = getelementptr i32, ptr %A, i64 %iv
- call void @use(ptr %gep)
- %iv.next = add i64 %iv, 1
- %ec = icmp eq i64 %iv, %wide.trip.count
- br i1 %ec, label %exit, label %loop
-
-exit:
- ret void
-}
-
-define void @udiv4_and_udiv2_mul_1(i1 %c, ptr %A) {
-; CHECK-LABEL: 'udiv4_and_udiv2_mul_1'
-; CHECK-NEXT: Classifying expressions for: @udiv4_and_udiv2_mul_1
-; CHECK-NEXT: %start = select i1 %c, i32 512, i32 0
-; CHECK-NEXT: --> %start U: [0,513) S: [0,513)
-; CHECK-NEXT: %div.2 = lshr i32 %start, 1
-; CHECK-NEXT: --> (%start /u 2) U: [0,257) S: [0,257)
-; CHECK-NEXT: %div.4 = lshr i32 %start, 2
-; CHECK-NEXT: --> (%start /u 4) U: [0,129) S: [0,129)
-; CHECK-NEXT: %iv.start = zext i32 %div.4 to i64
-; CHECK-NEXT: --> ((zext i32 %start to i64) /u 4) U: [0,129) S: [0,129)
-; CHECK-NEXT: %wide.trip.count = zext i32 %div.2 to i64
-; CHECK-NEXT: --> ((zext i32 %start to i64) /u 2) U: [0,257) S: [0,257)
-; CHECK-NEXT: %iv = phi i64 [ %iv.start, %entry ], [ %iv.next, %loop ]
-; CHECK-NEXT: --> {((zext i32 %start to i64) /u 4),+,1}<%loop> U: full-set S: full-set Exits: ((zext i32 %start to i64) /u 2) LoopDispositions: { %loop: Computable }
-; CHECK-NEXT: %gep = getelementptr i8, ptr %A, i64 %iv
+; CHECK-NEXT: %gep.8 = getelementptr i8, ptr %A, i64 %iv
; CHECK-NEXT: --> {(((zext i32 %start to i64) /u 4) + %A),+,1}<%loop> U: full-set S: full-set Exits: (((zext i32 %start to i64) /u 2) + %A) LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %gep.16 = getelementptr i16, ptr %A, i64 %iv
+; CHECK-NEXT: --> {((2 * ((zext i32 %start to i64) /u 4))<nuw><nsw> + %A),+,2}<%loop> U: full-set S: full-set Exits: ((zext i32 %start to i64) + %A) LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %gep.32 = getelementptr i32, ptr %A, i64 %iv
+; CHECK-NEXT: --> {((zext i32 %start to i64) + %A),+,4}<%loop> U: full-set S: full-set Exits: ((zext i32 %start to i64) + (4 * ((zext i32 %start to i64) /u 2))<nuw><nsw> + (-4 * ((zext i32 %start to i64) /u 4))<nsw> + %A) LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %gep.40 = getelementptr <{ i32, i8 }>, ptr %A, i64 %iv
+; CHECK-NEXT: --> {((5 * ((zext i32 %start to i64) /u 4))<nuw><nsw> + %A),+,5}<%loop> U: full-set S: full-set Exits: ((5 * ((zext i32 %start to i64) /u 2))<nuw><nsw> + %A) LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %gep.48 = getelementptr <{ i32, i16 }>, ptr %A, i64 %iv
+; CHECK-NEXT: --> {((6 * ((zext i32 %start to i64) /u 4))<nuw><nsw> + %A),+,6}<%loop> U: full-set S: full-set Exits: ((6 * ((zext i32 %start to i64) /u 2))<nuw><nsw> + %A) LoopDispositions: { %loop: Computable }
; CHECK-NEXT: %iv.next = add i64 %iv, 1
; CHECK-NEXT: --> {(1 + ((zext i32 %start to i64) /u 4))<nuw><nsw>,+,1}<%loop> U: full-set S: full-set Exits: (1 + ((zext i32 %start to i64) /u 2))<nuw><nsw> LoopDispositions: { %loop: Computable }
-; CHECK-NEXT: Determining loop execution counts for: @udiv4_and_udiv2_mul_1
+; CHECK-NEXT: Determining loop execution counts for: @udiv4_and_udiv2
; CHECK-NEXT: Loop %loop: backedge-taken count is ((-1 * ((zext i32 %start to i64) /u 4))<nsw> + ((zext i32 %start to i64) /u 2))
; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i64 -1
; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 * ((zext i32 %start to i64) /u 4))<nsw> + ((zext i32 %start to i64) /u 2))
@@ -83,8 +46,16 @@ entry:
loop:
%iv = phi i64 [ %iv.start, %entry ], [ %iv.next, %loop ]
- %gep = getelementptr i8, ptr %A, i64 %iv
- call void @use(ptr %gep)
+ %gep.8 = getelementptr i8, ptr %A, i64 %iv
+ call void @use(ptr %gep.8)
+ %gep.16 = getelementptr i16, ptr %A, i64 %iv
+ call void @use(ptr %gep.16)
+ %gep.32 = getelementptr i32, ptr %A, i64 %iv
+ call void @use(ptr %gep.32)
+ %gep.40 = getelementptr <{i32, i8}>, ptr %A, i64 %iv
+ call void @use(ptr %gep.40)
+ %gep.48 = getelementptr <{i32, i16}>, ptr %A, i64 %iv
+ call void @use(ptr %gep.48)
%iv.next = add i64 %iv, 1
%ec = icmp eq i64 %iv, %wide.trip.count
br i1 %ec, label %exit, label %loop
@@ -92,8 +63,6 @@ loop:
exit:
ret void
}
-
-
define void @udiv3_and_udiv5_mul_4(i1 %c, ptr %A) {
; CHECK-LABEL: 'udiv3_and_udiv5_mul_4'
; CHECK-NEXT: Classifying expressions for: @udiv3_and_udiv5_mul_4
@@ -109,8 +78,16 @@ define void @udiv3_and_udiv5_mul_4(i1 %c, ptr %A) {
; CHECK-NEXT: --> ((zext i32 %start to i64) /u 3) U: [0,171) S: [0,171)
; CHECK-NEXT: %iv = phi i64 [ %iv.start, %entry ], [ %iv.next, %loop ]
; CHECK-NEXT: --> {((zext i32 %start to i64) /u 5),+,1}<%loop> U: full-set S: full-set Exits: ((zext i32 %start to i64) /u 3) LoopDispositions: { %loop: Computable }
-; CHECK-NEXT: %gep = getelementptr i8, ptr %A, i64 %iv
+; CHECK-NEXT: %gep.8 = getelementptr i8, ptr %A, i64 %iv
; CHECK-NEXT: --> {(((zext i32 %start to i64) /u 5) + %A),+,1}<%loop> U: full-set S: full-set Exits: (((zext i32 %start to i64) /u 3) + %A) LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %gep.16 = getelementptr i16, ptr %A, i64 %iv
+; CHECK-NEXT: --> {((2 * ((zext i32 %start to i64) /u 5))<nuw><nsw> + %A),+,2}<%loop> U: full-set S: full-set Exits: ((2 * ((zext i32 %start to i64) /u 3))<nuw><nsw> + %A) LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %gep.32 = getelementptr i32, ptr %A, i64 %iv
+; CHECK-NEXT: --> {((4 * ((zext i32 %start to i64) /u 5))<nuw><nsw> + %A),+,4}<%loop> U: full-set S: full-set Exits: ((4 * ((zext i32 %start to i64) /u 3))<nuw><nsw> + %A) LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %gep.40 = getelementptr <{ i32, i8 }>, ptr %A, i64 %iv
+; CHECK-NEXT: --> {((5 * ((zext i32 %start to i64) /u 5))<nuw><nsw> + %A),+,5}<%loop> U: full-set S: full-set Exits: ((5 * ((zext i32 %start to i64) /u 3))<nuw><nsw> + %A) LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %gep.48 = getelementptr <{ i32, i16 }>, ptr %A, i64 %iv
+; CHECK-NEXT: --> {((6 * ((zext i32 %start to i64) /u 5))<nuw><nsw> + %A),+,6}<%loop> U: full-set S: full-set Exits: ((6 * ((zext i32 %start to i64) /u 3))<nuw><nsw> + %A) LoopDispositions: { %loop: Computable }
; CHECK-NEXT: %iv.next = add i64 %iv, 1
; CHECK-NEXT: --> {(1 + ((zext i32 %start to i64) /u 5))<nuw><nsw>,+,1}<%loop> U: full-set S: full-set Exits: (1 + ((zext i32 %start to i64) /u 3))<nuw><nsw> LoopDispositions: { %loop: Computable }
; CHECK-NEXT: Determining loop execution counts for: @udiv3_and_udiv5_mul_4
@@ -129,8 +106,16 @@ entry:
loop:
%iv = phi i64 [ %iv.start, %entry ], [ %iv.next, %loop ]
- %gep = getelementptr i8, ptr %A, i64 %iv
- call void @use(ptr %gep)
+ %gep.8 = getelementptr i8, ptr %A, i64 %iv
+ call void @use(ptr %gep.8)
+ %gep.16 = getelementptr i16, ptr %A, i64 %iv
+ call void @use(ptr %gep.16)
+ %gep.32 = getelementptr i32, ptr %A, i64 %iv
+ call void @use(ptr %gep.32)
+ %gep.40 = getelementptr <{i32, i8}>, ptr %A, i64 %iv
+ call void @use(ptr %gep.40)
+ %gep.48 = getelementptr <{i32, i16}>, ptr %A, i64 %iv
+ call void @use(ptr %gep.48)
%iv.next = add i64 %iv, 1
%ec = icmp eq i64 %iv, %wide.trip.count
br i1 %ec, label %exit, label %loop
@@ -138,50 +123,3 @@ loop:
exit:
ret void
}
-
-define void @udiv4_and_udiv2_mul_4_dividend_multiple_of_2(i1 %c, ptr %A) {
-; CHECK-LABEL: 'udiv4_and_udiv2_mul_4_dividend_multiple_of_2'
-; CHECK-NEXT: Classifying expressions for: @udiv4_and_udiv2_mul_4_dividend_multiple_of_2
-; CHECK-NEXT: %start = select i1 %c, i32 514, i32 0
-; CHECK-NEXT: --> %start U: [0,515) S: [0,515)
-; CHECK-NEXT: %div.2 = lshr i32 %start, 1
-; CHECK-NEXT: --> (%start /u 2) U: [0,258) S: [0,258)
-; CHECK-NEXT: %div.4 = lshr i32 %start, 2
-; CHECK-NEXT: --> (%start /u 4) U: [0,129) S: [0,129)
-; CHECK-NEXT: %iv.start = zext i32 %div.4 to i64
-; CHECK-NEXT: --> ((zext i32 %start to i64) /u 4) U: [0,129) S: [0,129)
-; CHECK-NEXT: %wide.trip.count = zext i32 %div.2 to i64
-; CHECK-NEXT: --> ((zext i32 %start to i64) /u 2) U: [0,258) S: [0,258)
-; CHECK-NEXT: %iv = phi i64 [ %iv.start, %entry ], [ %iv.next, %loop ]
-; CHECK-NEXT: --> {((zext i32 %start to i64) /u 4),+,1}<%loop> U: full-set S: full-set Exits: ((zext i32 %start to i64) /u 2) LoopDispositions: { %loop: Computable }
-; CHECK-NEXT: %gep = getelementptr i32, ptr %A, i64 %iv
-; CHECK-NEXT: --> {((4 * ((zext i32 %start to i64) /u 4))<nuw><nsw> + %A),+,4}<%loop> U: full-set S: full-set Exits: ((4 * ((zext i32 %start to i64) /u 2))<nuw><nsw> + %A) LoopDispositions: { %loop: Computable }
-; CHECK-NEXT: %iv.next = add i64 %iv, 1
-; CHECK-NEXT: --> {(1 + ((zext i32 %start to i64) /u 4))<nuw><nsw>,+,1}<%loop> U: full-set S: full-set Exits: (1 + ((zext i32 %start to i64) /u 2))<nuw><nsw> LoopDispositions: { %loop: Computable }
-; CHECK-NEXT: Determining loop execution counts for: @udiv4_and_udiv2_mul_4_dividend_multiple_of_2
-; CHECK-NEXT: Loop %loop: backedge-taken count is ((-1 * ((zext i32 %start to i64) /u 4))<nsw> + ((zext i32 %start to i64) /u 2))
-; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i64 -1
-; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is ((-1 * ((zext i32 %start to i64) /u 4))<nsw> + ((zext i32 %start to i64) /u 2))
-; CHECK-NEXT: Loop %loop: Trip multiple is 1
-;
-entry:
- %start = select i1 %c, i32 514, i32 0
- %div.2 = lshr i32 %start, 1
- %div.4 = lshr i32 %start, 2
- %iv.start = zext i32 %div.4 to i64
- %wide.trip.count = zext i32 %div.2 to i64
- br label %loop
-
-loop:
- %iv = phi i64 [ %iv.start, %entry ], [ %iv.next, %loop ]
- %gep = getelementptr i32, ptr %A, i64 %iv
- call void @use(ptr %gep)
- %iv.next = add i64 %iv, 1
- %ec = icmp eq i64 %iv, %wide.trip.count
- br i1 %ec, label %exit, label %loop
-
-exit:
- ret void
-}
-
-
More information about the llvm-commits
mailing list