Skip to content

[SCEV] Regen a test with UTC #147361

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Merged
merged 2 commits into from
Jul 8, 2025
Merged

[SCEV] Regen a test with UTC #147361

merged 2 commits into from
Jul 8, 2025

Conversation

@artagnon
Copy link
Contributor

@artagnon artagnon commented Jul 7, 2025

No description provided.

@artagnon artagnon requested review from fhahn and nikic July 7, 2025 18:03
@llvmbot llvmbot added the llvm:analysis Includes value tracking, cost tables and constant folding label Jul 7, 2025
@llvmbot
Copy link
Member

llvmbot commented Jul 7, 2025

@llvm/pr-subscribers-llvm-analysis

Author: Ramkumar Ramachandra (artagnon)

Changes

Full diff: https://github.com/llvm/llvm-project/pull/147361.diff

1 Files Affected:

  • (modified) llvm/test/Analysis/ScalarEvolution/no-wrap-unknown-becount.ll (+149-28)
diff --git a/llvm/test/Analysis/ScalarEvolution/no-wrap-unknown-becount.ll b/llvm/test/Analysis/ScalarEvolution/no-wrap-unknown-becount.ll
index a46063527b7b8..b6a4c5b95959d 100644
--- a/llvm/test/Analysis/ScalarEvolution/no-wrap-unknown-becount.ll
+++ b/llvm/test/Analysis/ScalarEvolution/no-wrap-unknown-becount.ll
@@ -1,10 +1,25 @@
-; RUN: opt -disable-output "-passes=print<scalar-evolution>" < %s 2>&1 | FileCheck %s
+; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 5
+; RUN: opt -disable-output -passes='print<scalar-evolution>' %s 2>&1 | FileCheck %s
 
 declare void @llvm.experimental.guard(i1, ...)
 declare void @llvm.assume(i1)
 
 define void @s_0(i32 %n, ptr %cond) {
-; CHECK-LABEL: Classifying expressions for: @s_0
+; CHECK-LABEL: 's_0'
+; CHECK-NEXT:  Classifying expressions for: @s_0
+; CHECK-NEXT:    %iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
+; CHECK-NEXT:    --> {0,+,1}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.inc = add i32 %iv, 1
+; CHECK-NEXT:    --> {1,+,1}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.sext = sext i32 %iv to i64
+; CHECK-NEXT:    --> {0,+,1}<nuw><nsw><%loop> U: [0,-9223372036854775808) S: [0,-9223372036854775808) Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %c = load volatile i1, ptr %cond, align 1
+; CHECK-NEXT:    --> %c U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
+; CHECK-NEXT:  Determining loop execution counts for: @s_0
+; 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
 
@@ -12,8 +27,6 @@ loop:
   %iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
   %iv.inc = add i32 %iv, 1
   %iv.sext = sext i32 %iv to i64
-; CHECK:    %iv.sext = sext i32 %iv to i64
-; CHECK-NEXT:  -->  {0,+,1}<nuw><nsw><%loop>
   %cmp = icmp slt i32 %iv, %n
   call void(i1, ...) @llvm.experimental.guard(i1 %cmp) [ "deopt"() ]
   %c = load volatile i1, ptr %cond
@@ -24,7 +37,21 @@ leave:
 }
 
 define void @s_1(ptr %cond) {
-; CHECK-LABEL: Classifying expressions for: @s_1
+; CHECK-LABEL: 's_1'
+; CHECK-NEXT:  Classifying expressions for: @s_1
+; CHECK-NEXT:    %iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
+; CHECK-NEXT:    --> {0,+,3}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.inc = add i32 %iv, 3
+; CHECK-NEXT:    --> {3,+,3}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.sext = sext i32 %iv to i64
+; CHECK-NEXT:    --> {0,+,3}<nuw><nsw><%loop> U: [0,-9223372036854775808) S: [0,-9223372036854775808) Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %c = load volatile i1, ptr %cond, align 1
+; CHECK-NEXT:    --> %c U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
+; CHECK-NEXT:  Determining loop execution counts for: @s_1
+; 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
 
@@ -32,8 +59,6 @@ loop:
   %iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
   %iv.inc = add i32 %iv, 3
   %iv.sext = sext i32 %iv to i64
-; CHECK:  %iv.sext = sext i32 %iv to i64
-; CHECK-NEXT:  -->  {0,+,3}<nuw><nsw><%loop>
   %cmp = icmp slt i32 %iv, 10000
   call void(i1, ...) @llvm.experimental.guard(i1 %cmp) [ "deopt"() ]
   %c = load volatile i1, ptr %cond
@@ -44,7 +69,21 @@ leave:
 }
 
 define void @s_2(ptr %cond) {
-; CHECK-LABEL: Classifying expressions for: @s_2
+; CHECK-LABEL: 's_2'
+; CHECK-NEXT:  Classifying expressions for: @s_2
+; CHECK-NEXT:    %iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
+; CHECK-NEXT:    --> {0,+,3}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.inc = add i32 %iv, 3
+; CHECK-NEXT:    --> {3,+,3}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.sext = sext i32 %iv to i64
+; CHECK-NEXT:    --> {0,+,3}<nuw><nsw><%loop> U: [0,-9223372036854775808) S: [0,-9223372036854775808) Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %c = load volatile i1, ptr %cond, align 1
+; CHECK-NEXT:    --> %c U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
+; CHECK-NEXT:  Determining loop execution counts for: @s_2
+; 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
 
@@ -53,8 +92,6 @@ loop:
   %iv.inc = add i32 %iv, 3
   %iv.sext = sext i32 %iv to i64
   %cmp = icmp slt i32 %iv, 10000
-; CHECK:  %iv.sext = sext i32 %iv to i64
-; CHECK-NEXT:  -->  {0,+,3}<nuw><nsw><%loop>
   call void @llvm.assume(i1 %cmp)
   %c = load volatile i1, ptr %cond
   br i1 %c, label %loop, label %leave
@@ -64,7 +101,25 @@ leave:
 }
 
 define void @s_3(i32 %start, ptr %cond) {
-; CHECK-LABEL: Classifying expressions for: @s_3
+; CHECK-LABEL: 's_3'
+; CHECK-NEXT:  Classifying expressions for: @s_3
+; CHECK-NEXT:    %iv = phi i32 [ %start, %entry ], [ %iv.inc, %be ]
+; CHECK-NEXT:    --> {%start,+,3}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.inc = add i32 %iv, 3
+; CHECK-NEXT:    --> {(3 + %start),+,3}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.inc.sext = sext i32 %iv.inc to i64
+; CHECK-NEXT:    --> {(sext i32 (3 + %start) to i64),+,3}<nsw><%loop> U: [-2147483648,4294977296) S: [-2147483648,4294977296) Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %c = load volatile i1, ptr %cond, align 1
+; CHECK-NEXT:    --> %c U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
+; CHECK-NEXT:  Determining loop execution counts for: @s_3
+; CHECK-NEXT:  Loop %loop: <multiple exits> Unpredictable backedge-taken count.
+; CHECK-NEXT:    exit count for loop: ((((-1 * (1 umin ((-1 * %start) + (10000 smax %start))))<nuw><nsw> + (-1 * %start) + (10000 smax %start)) /u 3) + (1 umin ((-1 * %start) + (10000 smax %start))))
+; CHECK-NEXT:    exit count for be: ***COULDNOTCOMPUTE***
+; CHECK-NEXT:  Loop %loop: constant max backedge-taken count is i32 715831216
+; CHECK-NEXT:  Loop %loop: symbolic max backedge-taken count is ((((-1 * (1 umin ((-1 * %start) + (10000 smax %start))))<nuw><nsw> + (-1 * %start) + (10000 smax %start)) /u 3) + (1 umin ((-1 * %start) + (10000 smax %start))))
+; CHECK-NEXT:    symbolic max exit count for loop: ((((-1 * (1 umin ((-1 * %start) + (10000 smax %start))))<nuw><nsw> + (-1 * %start) + (10000 smax %start)) /u 3) + (1 umin ((-1 * %start) + (10000 smax %start))))
+; CHECK-NEXT:    symbolic max exit count for be: ***COULDNOTCOMPUTE***
+;
 entry:
   br label %loop
 
@@ -76,8 +131,6 @@ loop:
 be:
   %iv.inc = add i32 %iv, 3
   %iv.inc.sext = sext i32 %iv.inc to i64
-; CHECK:  %iv.inc.sext = sext i32 %iv.inc to i64
-; CHECK-NEXT:  -->  {(sext i32 (3 + %start) to i64),+,3}<nsw><%loop>
   %c = load volatile i1, ptr %cond
   br i1 %c, label %loop, label %leave
 
@@ -86,7 +139,25 @@ leave:
 }
 
 define void @s_4(i32 %start, ptr %cond) {
-; CHECK-LABEL: Classifying expressions for: @s_4
+; CHECK-LABEL: 's_4'
+; CHECK-NEXT:  Classifying expressions for: @s_4
+; CHECK-NEXT:    %iv = phi i32 [ %start, %entry ], [ %iv.inc, %be ]
+; CHECK-NEXT:    --> {%start,+,-3}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.inc = add i32 %iv, -3
+; CHECK-NEXT:    --> {(-3 + %start),+,-3}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.inc.sext = sext i32 %iv.inc to i64
+; CHECK-NEXT:    --> {(sext i32 (-3 + %start) to i64),+,-3}<nsw><%loop> U: [-4294968296,2147483648) S: [-4294968296,2147483648) Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %c = load volatile i1, ptr %cond, align 1
+; CHECK-NEXT:    --> %c U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
+; CHECK-NEXT:  Determining loop execution counts for: @s_4
+; CHECK-NEXT:  Loop %loop: <multiple exits> Unpredictable backedge-taken count.
+; CHECK-NEXT:    exit count for loop: ((2 + (-1 * (-1000 smin %start)) + %start) /u 3)
+; CHECK-NEXT:    exit count for be: ***COULDNOTCOMPUTE***
+; CHECK-NEXT:  Loop %loop: constant max backedge-taken count is i32 715828216
+; CHECK-NEXT:  Loop %loop: symbolic max backedge-taken count is ((2 + (-1 * (-1000 smin %start)) + %start) /u 3)
+; CHECK-NEXT:    symbolic max exit count for loop: ((2 + (-1 * (-1000 smin %start)) + %start) /u 3)
+; CHECK-NEXT:    symbolic max exit count for be: ***COULDNOTCOMPUTE***
+;
 entry:
   br label %loop
 
@@ -98,8 +169,6 @@ loop:
 be:
   %iv.inc = add i32 %iv, -3
   %iv.inc.sext = sext i32 %iv.inc to i64
-; CHECK:  %iv.inc.sext = sext i32 %iv.inc to i64
-; CHECK-NEXT:  -->  {(sext i32 (-3 + %start) to i64),+,-3}<nsw><%loop>
   %c = load volatile i1, ptr %cond
   br i1 %c, label %loop, label %leave
 
@@ -108,7 +177,21 @@ leave:
 }
 
 define void @u_0(i32 %n, ptr %cond) {
-; CHECK-LABEL: Classifying expressions for: @u_0
+; CHECK-LABEL: 'u_0'
+; CHECK-NEXT:  Classifying expressions for: @u_0
+; CHECK-NEXT:    %iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
+; CHECK-NEXT:    --> {0,+,1}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.inc = add i32 %iv, 1
+; CHECK-NEXT:    --> {1,+,1}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.zext = zext i32 %iv to i64
+; CHECK-NEXT:    --> {0,+,1}<nuw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %c = load volatile i1, ptr %cond, align 1
+; CHECK-NEXT:    --> %c U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
+; CHECK-NEXT:  Determining loop execution counts for: @u_0
+; 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
 
@@ -116,8 +199,6 @@ loop:
   %iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
   %iv.inc = add i32 %iv, 1
   %iv.zext = zext i32 %iv to i64
-; CHECK:    %iv.zext = zext i32 %iv to i64
-; CHECK-NEXT:  -->  {0,+,1}<nuw><%loop>
   %cmp = icmp ult i32 %iv, %n
   call void(i1, ...) @llvm.experimental.guard(i1 %cmp) [ "deopt"() ]
   %c = load volatile i1, ptr %cond
@@ -128,7 +209,21 @@ leave:
 }
 
 define void @u_1(ptr %cond) {
-; CHECK-LABEL: Classifying expressions for: @u_1
+; CHECK-LABEL: 'u_1'
+; CHECK-NEXT:  Classifying expressions for: @u_1
+; CHECK-NEXT:    %iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
+; CHECK-NEXT:    --> {0,+,3}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.inc = add i32 %iv, 3
+; CHECK-NEXT:    --> {3,+,3}<%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.zext = zext i32 %iv to i64
+; CHECK-NEXT:    --> {0,+,3}<nuw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %c = load volatile i1, ptr %cond, align 1
+; CHECK-NEXT:    --> %c U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
+; CHECK-NEXT:  Determining loop execution counts for: @u_1
+; 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
 
@@ -136,8 +231,6 @@ loop:
   %iv = phi i32 [ 0, %entry ], [ %iv.inc, %loop ]
   %iv.inc = add i32 %iv, 3
   %iv.zext = zext i32 %iv to i64
-; CHECK:  %iv.zext = zext i32 %iv to i64
-; CHECK-NEXT:  -->  {0,+,3}<nuw><%loop>
   %cmp = icmp ult i32 %iv, 10000
   call void(i1, ...) @llvm.experimental.guard(i1 %cmp) [ "deopt"() ]
   %c = load volatile i1, ptr %cond
@@ -148,7 +241,21 @@ leave:
 }
 
 define void @u_2(ptr %cond) {
-; CHECK-LABEL: Classifying expressions for: @u_2
+; CHECK-LABEL: 'u_2'
+; CHECK-NEXT:  Classifying expressions for: @u_2
+; CHECK-NEXT:    %iv = phi i32 [ 30000, %entry ], [ %iv.inc, %loop ]
+; CHECK-NEXT:    --> {30000,+,-2}<%loop> U: [0,-1) S: [-2147483648,2147483647) Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.inc = add i32 %iv, -2
+; CHECK-NEXT:    --> {29998,+,-2}<%loop> U: [0,-1) S: [-2147483648,2147483647) Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.zext = zext i32 %iv to i64
+; CHECK-NEXT:    --> {30000,+,-2}<nw><%loop> U: [0,-1) S: [-9223372036854775808,9223372036854775807) Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %c = load volatile i1, ptr %cond, align 1
+; CHECK-NEXT:    --> %c U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
+; CHECK-NEXT:  Determining loop execution counts for: @u_2
+; 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
 
@@ -157,8 +264,6 @@ loop:
   %iv.inc = add i32 %iv, -2
   %iv.zext = zext i32 %iv to i64
   %cmp = icmp ugt i32 %iv.inc, -10000
-; CHECK:  %iv.zext = zext i32 %iv to i64
-; CHECK-NEXT:  -->  {30000,+,-2}<nw><%loop>
   call void @llvm.assume(i1 %cmp)
   %c = load volatile i1, ptr %cond
   br i1 %c, label %loop, label %leave
@@ -168,7 +273,25 @@ leave:
 }
 
 define void @u_3(i32 %start, ptr %cond) {
-; CHECK-LABEL: Classifying expressions for: @u_3
+; CHECK-LABEL: 'u_3'
+; CHECK-NEXT:  Classifying expressions for: @u_3
+; CHECK-NEXT:    %iv = phi i32 [ %start, %entry ], [ %iv.inc, %be ]
+; CHECK-NEXT:    --> {%start,+,3}<nw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.inc = add i32 %iv, 3
+; CHECK-NEXT:    --> {(3 + %start),+,3}<nw><%loop> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %iv.inc.zext = zext i32 %iv.inc to i64
+; CHECK-NEXT:    --> {(zext i32 (3 + %start) to i64),+,3}<nuw><%loop> U: [0,4294977298) S: [0,4294977298) Exits: <<Unknown>> LoopDispositions: { %loop: Computable }
+; CHECK-NEXT:    %c = load volatile i1, ptr %cond, align 1
+; CHECK-NEXT:    --> %c U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop: Variant }
+; CHECK-NEXT:  Determining loop execution counts for: @u_3
+; CHECK-NEXT:  Loop %loop: <multiple exits> Unpredictable backedge-taken count.
+; CHECK-NEXT:    exit count for loop: ((((-1 * (1 umin ((-1 * %start) + (10000 umax %start))))<nuw><nsw> + (-1 * %start) + (10000 umax %start)) /u 3) + (1 umin ((-1 * %start) + (10000 umax %start))))
+; CHECK-NEXT:    exit count for be: ***COULDNOTCOMPUTE***
+; CHECK-NEXT:  Loop %loop: constant max backedge-taken count is i32 3334
+; CHECK-NEXT:  Loop %loop: symbolic max backedge-taken count is ((((-1 * (1 umin ((-1 * %start) + (10000 umax %start))))<nuw><nsw> + (-1 * %start) + (10000 umax %start)) /u 3) + (1 umin ((-1 * %start) + (10000 umax %start))))
+; CHECK-NEXT:    symbolic max exit count for loop: ((((-1 * (1 umin ((-1 * %start) + (10000 umax %start))))<nuw><nsw> + (-1 * %start) + (10000 umax %start)) /u 3) + (1 umin ((-1 * %start) + (10000 umax %start))))
+; CHECK-NEXT:    symbolic max exit count for be: ***COULDNOTCOMPUTE***
+;
 entry:
   br label %loop
 
@@ -180,8 +303,6 @@ loop:
 be:
   %iv.inc = add i32 %iv, 3
   %iv.inc.zext = zext i32 %iv.inc to i64
-; CHECK:  %iv.inc.zext = zext i32 %iv.inc to i64
-; CHECK-NEXT:  -->  {(zext i32 (3 + %start) to i64),+,3}<nuw><%loop>
   %c = load volatile i1, ptr %cond
   br i1 %c, label %loop, label %leave

nikic
nikic approved these changes Jul 7, 2025
View reviewed changes
Copy link
Contributor

@nikic nikic left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM

fhahn
fhahn approved these changes Jul 7, 2025
View reviewed changes
Copy link
Contributor

@fhahn fhahn left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM, thanks

@artagnon artagnon merged commit a73daf4 into llvm:main Jul 8, 2025
9 checks passed
@artagnon artagnon deleted the scev-utc branch July 8, 2025 10:54
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

@nikic nikic nikic approved these changes

@fhahn fhahn fhahn approved these changes

Assignees

No one assigned

Labels

llvm:analysis Includes value tracking, cost tables and constant folding

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

4 participants

@artagnon @llvmbot @nikic @fhahn