[llvm] 55531e3 - [LICM] Add test reassociating ADD nuw nsw.
Florian Hahn via llvm-commits
llvm-commits at lists.llvm.org
Sat May 17 14:14:46 PDT 2025
Author: Florian Hahn
Date: 2025-05-17T22:12:00+01:00
New Revision: 55531e33d3114e63ef7d2079896fb80243061395
URL: https://github.com/llvm/llvm-project/commit/55531e33d3114e63ef7d2079896fb80243061395
DIFF: https://github.com/llvm/llvm-project/commit/55531e33d3114e63ef7d2079896fb80243061395.diff
LOG: [LICM] Add test reassociating ADD nuw nsw.
Added:
Modified:
llvm/test/Transforms/LICM/hoist-binop.ll
Removed:
################################################################################
diff --git a/llvm/test/Transforms/LICM/hoist-binop.ll b/llvm/test/Transforms/LICM/hoist-binop.ll
index 000b1fc1c5ce6..33161090a8ccf 100644
--- a/llvm/test/Transforms/LICM/hoist-binop.ll
+++ b/llvm/test/Transforms/LICM/hoist-binop.ll
@@ -367,6 +367,77 @@ loop:
br label %loop
}
+; FIXME: Hoist ADD and copy NUW NSW if both ops have it.
+define void @add_nuw_nsw(i64 %c1, i64 %c2) {
+; CHECK-LABEL: @add_nuw_nsw(
+; CHECK-NEXT: entry:
+; CHECK-NEXT: [[INVARIANT_OP:%.*]] = add nuw i64 [[C1:%.*]], [[C2:%.*]]
+; CHECK-NEXT: br label [[LOOP:%.*]]
+; CHECK: loop:
+; CHECK-NEXT: [[INDEX:%.*]] = phi i64 [ 0, [[ENTRY:%.*]] ], [ [[INDEX_NEXT_REASS:%.*]], [[LOOP]] ]
+; CHECK-NEXT: [[STEP_ADD:%.*]] = add nuw nsw i64 [[INDEX]], [[C1]]
+; CHECK-NEXT: call void @use(i64 [[STEP_ADD]])
+; CHECK-NEXT: [[INDEX_NEXT_REASS]] = add nuw i64 [[INDEX]], [[INVARIANT_OP]]
+; CHECK-NEXT: br label [[LOOP]]
+;
+entry:
+ br label %loop
+
+loop:
+ %index = phi i64 [ 0, %entry ], [ %index.next, %loop ]
+ %step.add = add nuw nsw i64 %index, %c1
+ call void @use(i64 %step.add)
+ %index.next = add nuw nsw i64 %step.add, %c2
+ br label %loop
+}
+
+define void @add_both_nsw_first_nuw(i64 %c1, i64 %c2) {
+; CHECK-LABEL: @add_both_nsw_first_nuw(
+; CHECK-NEXT: entry:
+; CHECK-NEXT: [[INVARIANT_OP:%.*]] = add i64 [[C1:%.*]], [[C2:%.*]]
+; CHECK-NEXT: br label [[LOOP:%.*]]
+; CHECK: loop:
+; CHECK-NEXT: [[INDEX:%.*]] = phi i64 [ 0, [[ENTRY:%.*]] ], [ [[INDEX_NEXT_REASS:%.*]], [[LOOP]] ]
+; CHECK-NEXT: [[STEP_ADD:%.*]] = add nuw nsw i64 [[INDEX]], [[C1]]
+; CHECK-NEXT: call void @use(i64 [[STEP_ADD]])
+; CHECK-NEXT: [[INDEX_NEXT_REASS]] = add i64 [[INDEX]], [[INVARIANT_OP]]
+; CHECK-NEXT: br label [[LOOP]]
+;
+entry:
+ br label %loop
+
+loop:
+ %index = phi i64 [ 0, %entry ], [ %index.next, %loop ]
+ %step.add = add nuw nsw i64 %index, %c1
+ call void @use(i64 %step.add)
+ %index.next = add nsw i64 %step.add, %c2
+ br label %loop
+}
+
+define void @add_both_nsw_second_nuw(i64 %c1, i64 %c2) {
+; CHECK-LABEL: @add_both_nsw_second_nuw(
+; CHECK-NEXT: entry:
+; CHECK-NEXT: [[INVARIANT_OP:%.*]] = add i64 [[C1:%.*]], [[C2:%.*]]
+; CHECK-NEXT: br label [[LOOP:%.*]]
+; CHECK: loop:
+; CHECK-NEXT: [[INDEX:%.*]] = phi i64 [ 0, [[ENTRY:%.*]] ], [ [[INDEX_NEXT_REASS:%.*]], [[LOOP]] ]
+; CHECK-NEXT: [[STEP_ADD:%.*]] = add nsw i64 [[INDEX]], [[C1]]
+; CHECK-NEXT: call void @use(i64 [[STEP_ADD]])
+; CHECK-NEXT: [[INDEX_NEXT_REASS]] = add i64 [[INDEX]], [[INVARIANT_OP]]
+; CHECK-NEXT: br label [[LOOP]]
+;
+entry:
+ br label %loop
+
+loop:
+ %index = phi i64 [ 0, %entry ], [ %index.next, %loop ]
+ %step.add = add nsw i64 %index, %c1
+ call void @use(i64 %step.add)
+ %index.next = add nuw nsw i64 %step.add, %c2
+ br label %loop
+}
+
+;
; Hoist MUL and drop NSW even if both ops have it.
define void @mul_no_nsw_2(i64 %c1, i64 %c2) {
; CHECK-LABEL: @mul_no_nsw_2(
More information about the llvm-commits
mailing list