[llvm] ce27ca4 - [SCEV] Add test coverage for ext-nusw/nsuw inference (#218943)
via llvm-commits
llvm-commits at lists.llvm.org
Mon Sep 7 08:50:48 PDT 2026
Author: Ramkumar Ramachandra
Date: 2026-09-07T15:50:42Z
New Revision: ce27ca449c564f8b38a60ea8db28e10a76cfb4ef
URL: https://github.com/llvm/llvm-project/commit/ce27ca449c564f8b38a60ea8db28e10a76cfb4ef
DIFF: https://github.com/llvm/llvm-project/commit/ce27ca449c564f8b38a60ea8db28e10a76cfb4ef.diff
LOG: [SCEV] Add test coverage for ext-nusw/nsuw inference (#218943)
Complete the existing incorrect-nsw test, showing that zext-addrec nusw
is not implied by nw on the pre-inc AR, and that sext-addrec nsuw is not
implied by nw on the pre-inc AR. See also: #217405 and #217362.
Assisted-by: AI
Added:
llvm/test/Analysis/ScalarEvolution/ext-addrec-wrap-flags.ll
Modified:
Removed:
llvm/test/Analysis/ScalarEvolution/incorrect-nsw.ll
################################################################################
diff --git a/llvm/test/Analysis/ScalarEvolution/ext-addrec-wrap-flags.ll b/llvm/test/Analysis/ScalarEvolution/ext-addrec-wrap-flags.ll
new file mode 100644
index 0000000000000..60a1f19439dd2
--- /dev/null
+++ b/llvm/test/Analysis/ScalarEvolution/ext-addrec-wrap-flags.ll
@@ -0,0 +1,389 @@
+; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 6
+; RUN: opt -disable-output "-passes=print<scalar-evolution>" %s 2>&1 | FileCheck %s
+
+; The sext expression should be {-1,+,-128}<nw>.
+; nw should be inferred correctly.
+define void @sext.nw.pre.inc() {
+; CHECK-LABEL: 'sext.nw.pre.inc'
+; CHECK-NEXT: Classifying expressions for: @sext.nw.pre.inc
+; CHECK-NEXT: %i = phi i8 [ -1, %entry ], [ %i.inc, %loop ]
+; CHECK-NEXT: --> {-1,+,-128}<%loop> U: [-1,-128) S: [-1,-128) Exits: 127 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %counter = phi i8 [ 0, %entry ], [ %counter.inc, %loop ]
+; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop> U: [0,2) S: [0,2) Exits: 1 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %i.inc = add i8 %i, -128
+; CHECK-NEXT: --> {127,+,-128}<%loop> U: [127,0) S: [127,0) Exits: -1 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %i.sext = sext i8 %i to i16
+; CHECK-NEXT: --> {-1,+,128}<nw><%loop> U: [-1,128) S: [-1,128) Exits: 127 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %counter.inc = add i8 %counter, 1
+; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%loop> U: [1,3) S: [1,3) Exits: 2 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: Determining loop execution counts for: @sext.nw.pre.inc
+; CHECK-NEXT: Loop %loop: backedge-taken count is i8 1
+; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i8 1
+; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i8 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 2
+;
+ entry:
+ br label %loop
+
+ loop:
+ %i = phi i8 [ -1, %entry ], [ %i.inc, %loop ]
+ %counter = phi i8 [ 0, %entry ], [ %counter.inc, %loop ]
+ %i.inc = add i8 %i, -128
+ %i.sext = sext i8 %i to i16
+ %counter.inc = add i8 %counter, 1
+ %continue = icmp eq i8 %counter, 1
+ br i1 %continue, label %exit, label %loop
+
+ exit:
+ ret void
+}
+
+; The zext expression should be {255,+,-128}<nw>.
+; nw should be inferred correctly.
+define void @zext.nw.pre.inc() {
+; CHECK-LABEL: 'zext.nw.pre.inc'
+; CHECK-NEXT: Classifying expressions for: @zext.nw.pre.inc
+; CHECK-NEXT: %i = phi i8 [ -1, %entry ], [ %i.inc, %loop ]
+; CHECK-NEXT: --> {-1,+,-128}<%loop> U: [-1,-128) S: [-1,-128) Exits: 127 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %counter = phi i8 [ 0, %entry ], [ %counter.inc, %loop ]
+; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop> U: [0,2) S: [0,2) Exits: 1 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %i.inc = add i8 %i, -128
+; CHECK-NEXT: --> {127,+,-128}<%loop> U: [127,0) S: [127,0) Exits: -1 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %i.sext = zext i8 %i to i16
+; CHECK-NEXT: --> {255,+,-128}<nw><%loop> U: [127,256) S: [127,256) Exits: 127 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %counter.inc = add i8 %counter, 1
+; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%loop> U: [1,3) S: [1,3) Exits: 2 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: Determining loop execution counts for: @zext.nw.pre.inc
+; CHECK-NEXT: Loop %loop: backedge-taken count is i8 1
+; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i8 1
+; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i8 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 2
+;
+ entry:
+ br label %loop
+
+ loop:
+ %i = phi i8 [ -1, %entry ], [ %i.inc, %loop ]
+ %counter = phi i8 [ 0, %entry ], [ %counter.inc, %loop ]
+ %i.inc = add i8 %i, -128
+ %i.sext = zext i8 %i to i16
+ %counter.inc = add i8 %counter, 1
+ %continue = icmp eq i8 %counter, 1
+ br i1 %continue, label %exit, label %loop
+
+ exit:
+ ret void
+}
+
+; nw on the pre-inc does not imply nsuw on the sext.
+; The sext-addrec should not fold.
+define void @sext.nsuw.nw.pre.inc(ptr %buf, i32 %n) mustprogress {
+; CHECK-LABEL: 'sext.nsuw.nw.pre.inc'
+; CHECK-NEXT: Classifying expressions for: @sext.nsuw.nw.pre.inc
+; CHECK-NEXT: %i = phi i32 [ -1, %entry ], [ %i.next, %loop ]
+; CHECK-NEXT: --> {-1,+,-2}<nw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %i.next = add i32 %i, -2
+; CHECK-NEXT: --> {-3,+,-2}<nw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %j = add i32 %i, 2
+; CHECK-NEXT: --> {1,+,-2}<nw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %idx = sext i32 %j to i64
+; CHECK-NEXT: --> (1 + (sext i32 {0,+,-2}<nw><%loop> to i64))<nuw><nsw> U: [1,0) S: [-2147483647,2147483648) Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %gep = getelementptr inbounds i64, ptr %buf, i64 %idx
+; CHECK-NEXT: --> (8 + (8 * (sext i32 {0,+,-2}<nw><%loop> to i64))<nsw> + %buf) U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: Determining loop execution counts for: @sext.nsuw.nw.pre.inc
+; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
+; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count.
+; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count.
+;
+ entry:
+ br label %loop
+
+ loop:
+ %i = phi i32 [ -1, %entry ], [ %i.next, %loop ]
+ %i.next = add i32 %i, -2
+ %j = add i32 %i, 2
+ %idx = sext i32 %j to i64
+ %gep = getelementptr inbounds i64, ptr %buf, i64 %idx
+ store i64 7, ptr %gep
+ %cmp = icmp sgt i32 %i, %n
+ br i1 %cmp, label %loop, label %exit
+
+ exit:
+ ret void
+}
+
+; nw on the pre-inc does not imply nusw on the zext.
+; The zext-addrec should not fold.
+define void @zext.nusw.nw.pre.inc(i8 %n) mustprogress willreturn {
+; CHECK-LABEL: 'zext.nusw.nw.pre.inc'
+; CHECK-NEXT: Classifying expressions for: @zext.nusw.nw.pre.inc
+; CHECK-NEXT: %vs = call i8 @llvm.vscale.i8()
+; CHECK-NEXT: --> vscale U: [1,0) S: [1,0)
+; CHECK-NEXT: %step = sub i8 0, %vs
+; CHECK-NEXT: --> (-1 * vscale) U: [1,0) S: [1,0)
+; CHECK-NEXT: %i = phi i8 [ 98, %entry ], [ %i.next, %loop ]
+; CHECK-NEXT: --> {98,+,(-1 * vscale)}<nw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %i.next = add i8 %i, %step
+; CHECK-NEXT: --> {(98 + (-1 * vscale)),+,(-1 * vscale)}<nw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %j = add i8 %i, 1
+; CHECK-NEXT: --> {99,+,(-1 * vscale)}<nw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %idx = zext i8 %j to i16
+; CHECK-NEXT: --> (zext i8 {99,+,(-1 * vscale)}<nw><%loop> to i16) U: [0,256) S: [0,256) Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: Determining loop execution counts for: @zext.nusw.nw.pre.inc
+; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
+; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count.
+; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count.
+;
+entry:
+ %vs = call i8 @llvm.vscale.i8()
+ %step = sub i8 0, %vs
+ br label %loop
+
+loop:
+ %i = phi i8 [ 98, %entry ], [ %i.next, %loop ]
+ %i.next = add i8 %i, %step
+ %j = add i8 %i, 1
+ %idx = zext i8 %j to i16
+ %in.bounds = icmp ult i8 %i.next, -2
+ call void @llvm.assume(i1 %in.bounds)
+ %exitcond = icmp eq i8 %i, %n
+ br i1 %exitcond, label %exit, label %loop
+
+exit:
+ ret void
+}
+
+; nuw on the pre-inc does not imply nsuw on the sext.
+; The sext-addrec should not fold.
+define void @sext.nuw.pre.inc.start127.crossing.smax() {
+; CHECK-LABEL: 'sext.nuw.pre.inc.start127.crossing.smax'
+; CHECK-NEXT: Classifying expressions for: @sext.nuw.pre.inc.start127.crossing.smax
+; CHECK-NEXT: %i = phi i8 [ 127, %entry ], [ %i.next, %loop ]
+; CHECK-NEXT: --> {127,+,2}<nuw><%loop> U: [127,-126) S: [127,-126) Exits: -127 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %counter = phi i8 [ 0, %entry ], [ %counter.next, %loop ]
+; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop> U: [0,2) S: [0,2) Exits: 1 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %i.next = add i8 %i, 2
+; CHECK-NEXT: --> {-127,+,2}<nuw><%loop> U: [-127,-124) S: [-127,-124) Exits: -125 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %ext = sext i8 %i to i32
+; CHECK-NEXT: --> (1 + (sext i8 {126,+,2}<nuw><%loop> to i32))<nuw><nsw> U: [1,0) S: [-127,128) Exits: -127 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %counter.next = add i8 %counter, 1
+; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%loop> U: [1,3) S: [1,3) Exits: 2 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: Determining loop execution counts for: @sext.nuw.pre.inc.start127.crossing.smax
+; CHECK-NEXT: Loop %loop: backedge-taken count is i8 1
+; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i8 1
+; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i8 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 2
+;
+entry:
+ br label %loop
+
+loop:
+ %i = phi i8 [ 127, %entry ], [ %i.next, %loop ]
+ %counter = phi i8 [ 0, %entry ], [ %counter.next, %loop ]
+ %i.next = add i8 %i, 2
+ %ext = sext i8 %i to i32
+ %counter.next = add i8 %counter, 1
+ %cmp = icmp eq i8 %counter, 1
+ br i1 %cmp, label %exit, label %loop
+
+exit:
+ ret void
+}
+
+; nuw on the pre-inc does not imply nsuw on the sext.
+; The sext-addrec should not fold.
+define void @sext.nuw.pre.inc.step127.crossing.smax() {
+; CHECK-LABEL: 'sext.nuw.pre.inc.step127.crossing.smax'
+; CHECK-NEXT: Classifying expressions for: @sext.nuw.pre.inc.step127.crossing.smax
+; CHECK-NEXT: %i = phi i8 [ 1, %entry ], [ %i.next, %loop ]
+; CHECK-NEXT: --> {1,+,127}<nuw><%loop> U: [1,-127) S: [1,-127) Exits: -128 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %counter = phi i8 [ 0, %entry ], [ %counter.next, %loop ]
+; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop> U: [0,2) S: [0,2) Exits: 1 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %i.next = add i8 %i, 127
+; CHECK-NEXT: --> {-128,+,127}<nuw><%loop> U: [-128,0) S: [-128,0) Exits: -1 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %j = add i8 %i, 1
+; CHECK-NEXT: --> {2,+,127}<nuw><%loop> U: [2,-126) S: [2,-126) Exits: -127 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %ext = sext i8 %j to i32
+; CHECK-NEXT: --> (sext i8 {2,+,127}<nuw><%loop> to i32) U: [-128,128) S: [-128,128) Exits: -127 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %counter.next = add i8 %counter, 1
+; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%loop> U: [1,3) S: [1,3) Exits: 2 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: Determining loop execution counts for: @sext.nuw.pre.inc.step127.crossing.smax
+; CHECK-NEXT: Loop %loop: backedge-taken count is i8 1
+; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i8 1
+; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i8 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 2
+;
+entry:
+ br label %loop
+
+loop:
+ %i = phi i8 [ 1, %entry ], [ %i.next, %loop ]
+ %counter = phi i8 [ 0, %entry ], [ %counter.next, %loop ]
+ %i.next = add i8 %i, 127
+ %j = add i8 %i, 1
+ %ext = sext i8 %j to i32
+ %counter.next = add i8 %counter, 1
+ %cmp = icmp eq i8 %counter, 1
+ br i1 %cmp, label %exit, label %loop
+
+exit:
+ ret void
+}
+
+; nsw on the pre-inc does not imply nusw on the zext.
+; The zext-addrec should not fold.
+define void @zext.nsw.pre.inc() {
+; CHECK-LABEL: 'zext.nsw.pre.inc'
+; CHECK-NEXT: Classifying expressions for: @zext.nsw.pre.inc
+; CHECK-NEXT: %i = phi i8 [ 0, %entry ], [ %i.next, %loop ]
+; CHECK-NEXT: --> {0,+,-3}<nsw><%loop> U: [-21,1) S: [-21,1) Exits: -21 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %counter = phi i8 [ 0, %entry ], [ %counter.next, %loop ]
+; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%loop> U: [0,8) S: [0,8) Exits: 7 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %i.next = add i8 %i, -3
+; CHECK-NEXT: --> {-3,+,-3}<nsw><%loop> U: [-24,-2) S: [-24,-2) Exits: -24 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %j = add i8 %i, 1
+; CHECK-NEXT: --> {1,+,-3}<nsw><%loop> U: [-20,2) S: [-20,2) Exits: -20 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %ext = zext i8 %j to i32
+; CHECK-NEXT: --> (zext i8 {1,+,-3}<nsw><%loop> to i32) U: [0,256) S: [0,256) Exits: 236 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %counter.next = add i8 %counter, 1
+; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%loop> U: [1,9) S: [1,9) Exits: 8 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: Determining loop execution counts for: @zext.nsw.pre.inc
+; CHECK-NEXT: Loop %loop: backedge-taken count is i8 7
+; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i8 7
+; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i8 7
+; CHECK-NEXT: Loop %loop: Trip multiple is 8
+;
+entry:
+ br label %loop
+
+loop:
+ %i = phi i8 [ 0, %entry ], [ %i.next, %loop ]
+ %counter = phi i8 [ 0, %entry ], [ %counter.next, %loop ]
+ %i.next = add i8 %i, -3
+ %j = add i8 %i, 1
+ %ext = zext i8 %j to i32
+ %counter.next = add i8 %counter, 1
+ %cmp = icmp ult i8 %counter, 7
+ br i1 %cmp, label %loop, label %exit
+
+exit:
+ ret void
+}
+
+define void @zext.nusw.backedge.guard(i8 %start) {
+; CHECK-LABEL: 'zext.nusw.backedge.guard'
+; CHECK-NEXT: Classifying expressions for: @zext.nusw.backedge.guard
+; CHECK-NEXT: %i = phi i8 [ %start, %entry ], [ %i.next, %loop ]
+; CHECK-NEXT: --> {%start,+,-1}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %i.next = add i8 %i, -1
+; CHECK-NEXT: --> {(-1 + %start),+,-1}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %ext = zext i8 %i to i32
+; CHECK-NEXT: --> (zext i8 {%start,+,-1}<%loop> to i32) U: [0,256) S: [0,256) Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: Determining loop execution counts for: @zext.nusw.backedge.guard
+; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
+; CHECK-NEXT: Loop %loop: Unpredictable constant max backedge-taken count.
+; CHECK-NEXT: Loop %loop: Unpredictable symbolic max backedge-taken count.
+;
+entry:
+ br label %loop
+
+loop:
+ %i = phi i8 [ %start, %entry ], [ %i.next, %loop ]
+ %i.next = add i8 %i, -1
+ %ext = zext i8 %i to i32
+ %cmp = icmp ult i8 %i.next, 100
+ br i1 %cmp, label %loop, label %exit
+
+exit:
+ ret void
+}
+
+define void @zext.count.down(i8 %n) mustprogress {
+; CHECK-LABEL: 'zext.count.down'
+; CHECK-NEXT: Classifying expressions for: @zext.count.down
+; CHECK-NEXT: %i = phi i8 [ -1, %entry ], [ %i.next, %loop ]
+; CHECK-NEXT: --> {-1,+,-1}<nw><%loop> U: full-set S: full-set Exits: %n LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %i.next = add i8 %i, -1
+; CHECK-NEXT: --> {-2,+,-1}<nw><%loop> U: full-set S: full-set Exits: (-1 + %n) LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %ext = zext i8 %i to i32
+; CHECK-NEXT: --> {255,+,-1}<nw><%loop> U: [0,256) S: [0,256) Exits: (255 + (-1 * (zext i8 (-1 + (-1 * %n)) to i32))<nsw>)<nsw> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: Determining loop execution counts for: @zext.count.down
+; CHECK-NEXT: Loop %loop: backedge-taken count is (-1 + (-1 * %n))
+; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i8 -1
+; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (-1 + (-1 * %n))
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
+;
+entry:
+ br label %loop
+
+loop:
+ %i = phi i8 [ -1, %entry ], [ %i.next, %loop ]
+ %i.next = add i8 %i, -1
+ %ext = zext i8 %i to i32
+ %cmp = icmp eq i8 %i, %n
+ br i1 %cmp, label %exit, label %loop
+
+exit:
+ ret void
+}
+
+define void @zext.nuw.increment(i8 %n) mustprogress {
+; CHECK-LABEL: 'zext.nuw.increment'
+; CHECK-NEXT: Classifying expressions for: @zext.nuw.increment
+; CHECK-NEXT: %i = phi i8 [ 100, %entry ], [ %i.next, %loop ]
+; CHECK-NEXT: --> {100,+,-1}<nuw><%loop> U: [100,0) S: [100,0) Exits: %n LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %i.next = add nuw i8 %i, -1
+; CHECK-NEXT: --> {99,+,-1}<nw><%loop> U: full-set S: full-set Exits: (-1 + %n) LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %j = add i8 %i, 1
+; CHECK-NEXT: --> {101,+,-1}<nw><%loop> U: full-set S: full-set Exits: (1 + %n) LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %ext = zext i8 %j to i32
+; CHECK-NEXT: --> {101,+,-1}<nw><%loop> U: [-154,102) S: [-154,102) Exits: (101 + (-1 * (zext i8 (100 + (-1 * %n)) to i32))<nsw>)<nsw> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: Determining loop execution counts for: @zext.nuw.increment
+; CHECK-NEXT: Loop %loop: backedge-taken count is (100 + (-1 * %n))
+; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i8 -1
+; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is (100 + (-1 * %n))
+; CHECK-NEXT: Loop %loop: Trip multiple is 1
+;
+entry:
+ br label %loop
+
+loop:
+ %i = phi i8 [ 100, %entry ], [ %i.next, %loop ]
+ %i.next = add nuw i8 %i, -1
+ %j = add i8 %i, 1
+ %ext = zext i8 %j to i32
+ %cmp = icmp eq i8 %i, %n
+ br i1 %cmp, label %exit, label %loop
+
+exit:
+ ret void
+}
+
+define void @zext.no.nuw.pre.inc() {
+; CHECK-LABEL: 'zext.no.nuw.pre.inc'
+; CHECK-NEXT: Classifying expressions for: @zext.no.nuw.pre.inc
+; CHECK-NEXT: %i = phi i8 [ -1, %entry ], [ %i.next, %loop ]
+; CHECK-NEXT: --> {-1,+,-128}<%loop> U: [-1,-128) S: [-1,-128) Exits: 127 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %i.next = add i8 %i, -128
+; CHECK-NEXT: --> {127,+,-128}<%loop> U: [127,0) S: [127,0) Exits: -1 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: %ext = zext i8 %i to i32
+; CHECK-NEXT: --> {255,+,-128}<nw><%loop> U: [127,256) S: [127,256) Exits: 127 LoopDispositions: { %loop: Computable }
+; CHECK-NEXT: Determining loop execution counts for: @zext.no.nuw.pre.inc
+; CHECK-NEXT: Loop %loop: backedge-taken count is i32 1
+; CHECK-NEXT: Loop %loop: constant max backedge-taken count is i32 1
+; CHECK-NEXT: Loop %loop: symbolic max backedge-taken count is i32 1
+; CHECK-NEXT: Loop %loop: Trip multiple is 2
+;
+entry:
+ br label %loop
+
+loop:
+ %i = phi i8 [ -1, %entry ], [ %i.next, %loop ]
+ %i.next = add i8 %i, -128
+ %ext = zext i8 %i to i32
+ %cmp = icmp sgt i8 %i.next, 3
+ br i1 %cmp, label %loop, label %exit
+
+exit:
+ ret void
+}
diff --git a/llvm/test/Analysis/ScalarEvolution/incorrect-nsw.ll b/llvm/test/Analysis/ScalarEvolution/incorrect-nsw.ll
deleted file mode 100644
index f7edf493c64c4..0000000000000
--- a/llvm/test/Analysis/ScalarEvolution/incorrect-nsw.ll
+++ /dev/null
@@ -1,26 +0,0 @@
-; RUN: opt -disable-output "-passes=print<scalar-evolution>,print<scalar-evolution>" < %s 2>&1 | FileCheck %s
-
-define void @bad.nsw() {
-; CHECK-LABEL: Classifying expressions for: @bad.nsw
-; CHECK-LABEL: Classifying expressions for: @bad.nsw
- entry:
- br label %loop
-
- loop:
- %i = phi i8 [ -1, %entry ], [ %i.inc, %loop ]
-; CHECK: %i = phi i8 [ -1, %entry ], [ %i.inc, %loop ]
-; CHECK-NEXT: --> {-1,+,-128}<nw><%loop>
-; CHECK-NOT: --> {-1,+,-128}<nsw><%loop>
-
- %counter = phi i8 [ 0, %entry ], [ %counter.inc, %loop ]
-
- %i.inc = add i8 %i, -128
- %i.sext = sext i8 %i to i16
-
- %counter.inc = add i8 %counter, 1
- %continue = icmp eq i8 %counter, 1
- br i1 %continue, label %exit, label %loop
-
- exit:
- ret void
-}
More information about the llvm-commits
mailing list