[llvm] da11c1d - [GVN] Generate test checks (NFC)

Nikita Popov via llvm-commits llvm-commits at lists.llvm.org
Mon Aug 4 05:27:07 PDT 2025


Author: Nikita Popov
Date: 2025-08-04T14:26:59+02:00
New Revision: da11c1d59433a2813ca0333f81d4faca443a8a77

URL: https://github.com/llvm/llvm-project/commit/da11c1d59433a2813ca0333f81d4faca443a8a77
DIFF: https://github.com/llvm/llvm-project/commit/da11c1d59433a2813ca0333f81d4faca443a8a77.diff

LOG: [GVN] Generate test checks (NFC)

Added: 
    

Modified: 
    llvm/test/Transforms/GVN/assume-equal.ll

Removed: 
    


################################################################################
diff  --git a/llvm/test/Transforms/GVN/assume-equal.ll b/llvm/test/Transforms/GVN/assume-equal.ll
index 2ca8f3384e813..a27b0e45bf9e1 100644
--- a/llvm/test/Transforms/GVN/assume-equal.ll
+++ b/llvm/test/Transforms/GVN/assume-equal.ll
@@ -1,3 +1,4 @@
+; NOTE: Assertions have been autogenerated by utils/update_test_checks.py UTC_ARGS: --version 5
 ; RUN: opt < %s -passes=gvn -S | FileCheck %s
 
 %struct.A = type { ptr }
@@ -7,9 +8,26 @@
 ; Checks if indirect calls can be replaced with direct
 ; assuming that %vtable == @_ZTV1A (with alignment).
 ; Checking const propagation across other BBs
-; CHECK-LABEL: define void @_Z1gb(
 
 define void @_Z1gb(i1 zeroext %p) {
+; CHECK-LABEL: define void @_Z1gb(
+; CHECK-SAME: i1 zeroext [[P:%.*]]) {
+; CHECK-NEXT:  [[ENTRY:.*:]]
+; CHECK-NEXT:    [[CALL:%.*]] = tail call noalias ptr @_Znwm(i64 8)
+; CHECK-NEXT:    tail call void @_ZN1AC1Ev(ptr [[CALL]])
+; CHECK-NEXT:    [[VTABLE:%.*]] = load ptr, ptr [[CALL]], align 8
+; CHECK-NEXT:    [[CMP_VTABLES:%.*]] = icmp eq ptr [[VTABLE]], getelementptr inbounds ([4 x ptr], ptr @_ZTV1A, i64 0, i64 2)
+; CHECK-NEXT:    tail call void @llvm.assume(i1 [[CMP_VTABLES]])
+; CHECK-NEXT:    br i1 [[P]], label %[[IF_THEN:.*]], label %[[IF_ELSE:.*]]
+; CHECK:       [[IF_THEN]]:
+; CHECK-NEXT:    [[CALL2:%.*]] = tail call i32 @_ZN1A3fooEv(ptr [[CALL]])
+; CHECK-NEXT:    br label %[[IF_END:.*]]
+; CHECK:       [[IF_ELSE]]:
+; CHECK-NEXT:    [[CALL5:%.*]] = tail call i32 @_ZN1A3barEv(ptr [[CALL]])
+; CHECK-NEXT:    br label %[[IF_END]]
+; CHECK:       [[IF_END]]:
+; CHECK-NEXT:    ret void
+;
 entry:
   %call = tail call noalias ptr @_Znwm(i64 8) #4
   tail call void @_ZN1AC1Ev(ptr %call) #1
@@ -20,18 +38,16 @@ entry:
 
 if.then:                                          ; preds = %entry
   %0 = load ptr, ptr %vtable, align 8
-  
-  ; CHECK: call i32 @_ZN1A3fooEv(
+
   %call2 = tail call i32 %0(ptr %call) #1
-  
+
   br label %if.end
 
 if.else:                                          ; preds = %entry
   %vfn47 = getelementptr inbounds ptr, ptr %vtable, i64 1
-  
-  ; CHECK: call i32 @_ZN1A3barEv(
+
   %1 = load ptr, ptr %vfn47, align 8
-  
+
   %call5 = tail call i32 %1(ptr %call) #1
   br label %if.end
 
@@ -40,8 +56,28 @@ if.end:                                           ; preds = %if.else, %if.then
 }
 
 ; Check integration with invariant.group handling
-; CHECK-LABEL: define void @invariantGroupHandling(i1 zeroext %p) {
 define void @invariantGroupHandling(i1 zeroext %p) {
+; CHECK-LABEL: define void @invariantGroupHandling(
+; CHECK-SAME: i1 zeroext [[P:%.*]]) {
+; CHECK-NEXT:  [[ENTRY:.*:]]
+; CHECK-NEXT:    [[CALL:%.*]] = tail call noalias ptr @_Znwm(i64 8)
+; CHECK-NEXT:    tail call void @_ZN1AC1Ev(ptr [[CALL]])
+; CHECK-NEXT:    [[VTABLE:%.*]] = load ptr, ptr [[CALL]], align 8, !invariant.group [[META0:![0-9]+]]
+; CHECK-NEXT:    [[CMP_VTABLES:%.*]] = icmp eq ptr [[VTABLE]], getelementptr inbounds ([4 x ptr], ptr @_ZTV1A, i64 0, i64 2)
+; CHECK-NEXT:    tail call void @llvm.assume(i1 [[CMP_VTABLES]])
+; CHECK-NEXT:    br i1 [[P]], label %[[IF_THEN:.*]], label %[[IF_ELSE:.*]]
+; CHECK:       [[IF_THEN]]:
+; CHECK-NEXT:    [[CALL2:%.*]] = tail call i32 @_ZN1A3fooEv(ptr [[CALL]])
+; CHECK-NEXT:    [[CALLX:%.*]] = tail call i32 @_ZN1A3fooEv(ptr [[CALL]])
+; CHECK-NEXT:    [[CALLY:%.*]] = tail call i32 @_ZN1A3fooEv(ptr [[CALL]])
+; CHECK-NEXT:    [[UNKNOWN:%.*]] = tail call i32 @_ZN1A3fooEv(ptr [[CALL]])
+; CHECK-NEXT:    br label %[[IF_END:.*]]
+; CHECK:       [[IF_ELSE]]:
+; CHECK-NEXT:    [[CALL5:%.*]] = tail call i32 @_ZN1A3barEv(ptr [[CALL]])
+; CHECK-NEXT:    br label %[[IF_END]]
+; CHECK:       [[IF_END]]:
+; CHECK-NEXT:    ret void
+;
 entry:
   %call = tail call noalias ptr @_Znwm(i64 8) #4
   tail call void @_ZN1AC1Ev(ptr %call) #1
@@ -52,32 +88,27 @@ entry:
 
 if.then:                                          ; preds = %entry
   %0 = load ptr, ptr %vtable, align 8
-  
-; CHECK: call i32 @_ZN1A3fooEv(
+
   %call2 = tail call i32 %0(ptr %call) #1
   %vtable1 = load ptr, ptr %call, align 8, !invariant.group !0
   %call1 = load ptr, ptr %vtable1, align 8
-; CHECK: call i32 @_ZN1A3fooEv(
   %callx = tail call i32 %call1(ptr %call) #1
-  
+
   %vtable2 = load ptr, ptr %call, align 8, !invariant.group !0
   %call4 = load ptr, ptr %vtable2, align 8
-; CHECK: call i32 @_ZN1A3fooEv(
   %cally = tail call i32 %call4(ptr %call) #1
-  
+
   %vtable3 = load ptr, ptr %call, align 8, !invariant.group !0
   %vfun = load ptr, ptr %vtable3, align 8
-; CHECK: call i32 @_ZN1A3fooEv(
   %unknown = tail call i32 %vfun(ptr %call) #1
-  
+
   br label %if.end
 
 if.else:                                          ; preds = %entry
   %vfn47 = getelementptr inbounds ptr, ptr %vtable, i64 1
-  
-  ; CHECK: call i32 @_ZN1A3barEv(
+
   %1 = load ptr, ptr %vfn47, align 8
-  
+
   %call5 = tail call i32 %1(ptr %call) #1
   br label %if.end
 
@@ -87,122 +118,173 @@ if.end:                                           ; preds = %if.else, %if.then
 
 
 ; Checking const propagation in the same BB
-; CHECK-LABEL: define i32 @main()
 
 define i32 @main() {
+; CHECK-LABEL: define i32 @main() {
+; CHECK-NEXT:  [[ENTRY:.*:]]
+; CHECK-NEXT:    [[CALL:%.*]] = tail call noalias ptr @_Znwm(i64 8)
+; CHECK-NEXT:    tail call void @_ZN1AC1Ev(ptr [[CALL]])
+; CHECK-NEXT:    [[VTABLE:%.*]] = load ptr, ptr [[CALL]], align 8
+; CHECK-NEXT:    [[CMP_VTABLES:%.*]] = icmp eq ptr [[VTABLE]], getelementptr inbounds ([4 x ptr], ptr @_ZTV1A, i64 0, i64 2)
+; CHECK-NEXT:    tail call void @llvm.assume(i1 [[CMP_VTABLES]])
+; CHECK-NEXT:    [[CALL2:%.*]] = tail call i32 @_ZN1A3fooEv(ptr [[CALL]])
+; CHECK-NEXT:    ret i32 0
+;
 entry:
-  %call = tail call noalias ptr @_Znwm(i64 8) 
-  tail call void @_ZN1AC1Ev(ptr %call) 
+  %call = tail call noalias ptr @_Znwm(i64 8)
+  tail call void @_ZN1AC1Ev(ptr %call)
   %vtable = load ptr, ptr %call, align 8
   %cmp.vtables = icmp eq ptr %vtable, getelementptr inbounds ([4 x ptr], ptr @_ZTV1A, i64 0, i64 2)
   tail call void @llvm.assume(i1 %cmp.vtables)
-  
-  ; CHECK: call i32 @_ZN1A3fooEv(
+
   %0 = load ptr, ptr %vtable, align 8
-  
+
   %call2 = tail call i32 %0(ptr %call)
   ret i32 0
 }
 
 ; This tests checks const propatation with fcmp instruction.
-; CHECK-LABEL: define float @_Z1gf(float %p)
 
 define float @_Z1gf(float %p) {
+; CHECK-LABEL: define float @_Z1gf(
+; CHECK-SAME: float [[P:%.*]]) {
+; CHECK-NEXT:  [[ENTRY:.*:]]
+; CHECK-NEXT:    [[P_ADDR:%.*]] = alloca float, align 4
+; CHECK-NEXT:    [[F:%.*]] = alloca float, align 4
+; CHECK-NEXT:    store float [[P]], ptr [[P_ADDR]], align 4
+; CHECK-NEXT:    store float 3.000000e+00, ptr [[F]], align 4
+; CHECK-NEXT:    [[CMP:%.*]] = fcmp oeq float 3.000000e+00, [[P]]
+; CHECK-NEXT:    call void @llvm.assume(i1 [[CMP]])
+; CHECK-NEXT:    ret float 3.000000e+00
+;
 entry:
   %p.addr = alloca float, align 4
   %f = alloca float, align 4
   store float %p, ptr %p.addr, align 4
-  
+
   store float 3.000000e+00, ptr %f, align 4
   %0 = load float, ptr %p.addr, align 4
   %1 = load float, ptr %f, align 4
   %cmp = fcmp oeq float %1, %0 ; note const on lhs
   call void @llvm.assume(i1 %cmp)
-  
-  ; CHECK: ret float 3.000000e+00
+
   ret float %0
 }
 
-; CHECK-LABEL: define float @_Z1hf(float %p)
 
 define float @_Z1hf(float %p) {
+; CHECK-LABEL: define float @_Z1hf(
+; CHECK-SAME: float [[P:%.*]]) {
+; CHECK-NEXT:  [[ENTRY:.*:]]
+; CHECK-NEXT:    [[P_ADDR:%.*]] = alloca float, align 4
+; CHECK-NEXT:    store float [[P]], ptr [[P_ADDR]], align 4
+; CHECK-NEXT:    [[CMP:%.*]] = fcmp nnan ueq float [[P]], 3.000000e+00
+; CHECK-NEXT:    call void @llvm.assume(i1 [[CMP]])
+; CHECK-NEXT:    ret float 3.000000e+00
+;
 entry:
   %p.addr = alloca float, align 4
   store float %p, ptr %p.addr, align 4
-  
+
   %0 = load float, ptr %p.addr, align 4
   %cmp = fcmp nnan ueq float %0, 3.000000e+00
   call void @llvm.assume(i1 %cmp)
-  
-  ; CHECK: ret float 3.000000e+00
+
   ret float %0
 }
 
-; CHECK-LABEL: define float @_Z1if(float %p)
 define float @_Z1if(float %p) {
+; CHECK-LABEL: define float @_Z1if(
+; CHECK-SAME: float [[P:%.*]]) {
+; CHECK-NEXT:  [[ENTRY:.*:]]
+; CHECK-NEXT:    [[P_ADDR:%.*]] = alloca float, align 4
+; CHECK-NEXT:    store float [[P]], ptr [[P_ADDR]], align 4
+; CHECK-NEXT:    [[CMP:%.*]] = fcmp ueq float [[P]], 3.000000e+00
+; CHECK-NEXT:    call void @llvm.assume(i1 [[CMP]])
+; CHECK-NEXT:    ret float [[P]]
+;
 entry:
   %p.addr = alloca float, align 4
   store float %p, ptr %p.addr, align 4
-  
+
   %0 = load float, ptr %p.addr, align 4
   %cmp = fcmp ueq float %0, 3.000000e+00 ; no nnan flag - can't propagate
   call void @llvm.assume(i1 %cmp)
-  
-  ; CHECK-NOT: ret float 3.000000e+00
+
   ret float %0
 }
 
 ; This test checks if constant propagation works for multiple node edges
-; CHECK-LABEL: define i32 @_Z1ii(i32 %p)
 define i32 @_Z1ii(i32 %p) {
+; CHECK-LABEL: define i32 @_Z1ii(
+; CHECK-SAME: i32 [[P:%.*]]) {
+; CHECK-NEXT:  [[ENTRY:.*:]]
+; CHECK-NEXT:    [[CMP:%.*]] = icmp eq i32 [[P]], 42
+; CHECK-NEXT:    call void @llvm.assume(i1 [[CMP]])
+; CHECK-NEXT:    br i1 true, label %[[BB2:.*]], label %[[BB2]]
+; CHECK:       [[BB2]]:
+; CHECK-NEXT:    br i1 true, label %[[BB2]], label %[[BB2]]
+; CHECK:       [[BB0:.*:]]
+; CHECK-NEXT:    ret i32 42
+;
 entry:
   %cmp = icmp eq i32 %p, 42
   call void @llvm.assume(i1 %cmp)
-  
-  ; CHECK: br i1 true, label %bb2, label %bb2
+
   br i1 %cmp, label %bb2, label %bb2
 bb2:
   call void @llvm.assume(i1 true)
-  ; CHECK: br i1 true, label %bb2, label %bb2
   br i1 %cmp, label %bb2, label %bb2
-  
-  ; CHECK: ret i32 42
+
   ret i32 %p
 }
 
-; CHECK-LABEL: define i32 @_Z1ij(i32 %p)
 define i32 @_Z1ij(i32 %p) {
+; CHECK-LABEL: define i32 @_Z1ij(
+; CHECK-SAME: i32 [[P:%.*]]) {
+; CHECK-NEXT:  [[ENTRY:.*:]]
+; CHECK-NEXT:    [[CMP:%.*]] = icmp eq i32 [[P]], 42
+; CHECK-NEXT:    call void @llvm.assume(i1 [[CMP]])
+; CHECK-NEXT:    br i1 true, label %[[BB2:.*]], label %[[BB2]]
+; CHECK:       [[BB2]]:
+; CHECK-NEXT:    br i1 true, label %[[BB2]], label %[[BB2]]
+; CHECK:       [[BB0:.*:]]
+; CHECK-NEXT:    ret i32 42
+;
 entry:
   %cmp = icmp eq i32 %p, 42
   call void @llvm.assume(i1 %cmp)
-  
-  ; CHECK: br i1 true, label %bb2, label %bb2
+
   br i1 %cmp, label %bb2, label %bb2
 bb2:
-   ; CHECK-NOT: %cmp2 = 
   %cmp2 = icmp eq i32 %p, 42
-  ; CHECK-NOT: call void @llvm.assume(
   call void @llvm.assume(i1 %cmp2)
-  
-  ; CHECK: br i1 true, label %bb2, label %bb2
+
   br i1 %cmp, label %bb2, label %bb2
-  
-  ; CHECK: ret i32 42
+
   ret i32 %p
 }
 
-; CHECK-LABEL: define i32 @_Z1ik(i32 %p)
 define i32 @_Z1ik(i32 %p) {
+; CHECK-LABEL: define i32 @_Z1ik(
+; CHECK-SAME: i32 [[P:%.*]]) {
+; CHECK-NEXT:  [[ENTRY:.*:]]
+; CHECK-NEXT:    [[CMP:%.*]] = icmp eq i32 [[P]], 42
+; CHECK-NEXT:    call void @llvm.assume(i1 [[CMP]])
+; CHECK-NEXT:    br i1 true, label %[[BB2:.*]], label %[[BB3:.*]]
+; CHECK:       [[BB2]]:
+; CHECK-NEXT:    store i8 poison, ptr null, align 1
+; CHECK-NEXT:    ret i32 15
+; CHECK:       [[BB3]]:
+; CHECK-NEXT:    ret i32 17
+;
 entry:
   %cmp = icmp eq i32 %p, 42
   call void @llvm.assume(i1 %cmp)
-  
-  ; CHECK: br i1 true, label %bb2, label %bb3
+
   br i1 %cmp, label %bb2, label %bb3
 bb2:
-  ; CHECK-NOT: %cmp3 = 
   %cmp3 = icmp eq i32 %p, 43
-  ; CHECK: store i8 poison, ptr null
   call void @llvm.assume(i1 %cmp3)
   ret i32 15
 bb3:
@@ -210,42 +292,54 @@ bb3:
 }
 
 ; This test checks if GVN can do the constant propagation correctly
-; when there are multiple uses of the same assume value in the 
+; when there are multiple uses of the same assume value in the
 ; basic block that has a loop back-edge pointing to itself.
 ;
-; CHECK-LABEL: define i32 @_Z1il(i32 %val, i1 %k)
 define i32 @_Z1il(i32 %val, i1 %k) {
+; CHECK-LABEL: define i32 @_Z1il(
+; CHECK-SAME: i32 [[VAL:%.*]], i1 [[K:%.*]]) {
+; CHECK-NEXT:    br label %[[NEXT:.*]]
+; CHECK:       [[NEXT]]:
+; CHECK-NEXT:    tail call void @llvm.assume(i1 [[K]])
+; CHECK-NEXT:    [[CMP:%.*]] = icmp eq i32 [[VAL]], 50
+; CHECK-NEXT:    br i1 [[CMP]], label %[[NEXT]], label %[[MEH:.*]]
+; CHECK:       [[MEH]]:
+; CHECK-NEXT:    ret i32 0
+;
   br label %next
 
 next:
-; CHECK: tail call void @llvm.assume(i1 %k)
-; CHECK-NEXT: %cmp = icmp eq i32 %val, 50
   tail call void @llvm.assume(i1 %k)
   tail call void @llvm.assume(i1 %k)
   %cmp = icmp eq i32 %val, 50
   br i1 %cmp, label %next, label %meh
 
 meh:
-  ret i32 0 
+  ret i32 0
 }
 
 ; This test checks if GVN can prevent the constant propagation correctly
 ; in the successor blocks that are not dominated by the basic block
 ; with the assume instruction.
 ;
-; CHECK-LABEL: define i1 @_z1im(i32 %val, i1 %k, i1 %j)
 define i1 @_z1im(i32 %val, i1 %k, i1 %j) {
+; CHECK-LABEL: define i1 @_z1im(
+; CHECK-SAME: i32 [[VAL:%.*]], i1 [[K:%.*]], i1 [[J:%.*]]) {
+; CHECK-NEXT:    br i1 [[J]], label %[[NEXT:.*]], label %[[MEH:.*]]
+; CHECK:       [[NEXT]]:
+; CHECK-NEXT:    tail call void @llvm.assume(i1 [[K]])
+; CHECK-NEXT:    br label %[[MEH]]
+; CHECK:       [[MEH]]:
+; CHECK-NEXT:    ret i1 [[K]]
+;
   br i1 %j, label %next, label %meh
 
 next:
-; CHECK: tail call void @llvm.assume(i1 %k)
-; CHECK-NEXT: br label %meh
   tail call void @llvm.assume(i1 %k)
   tail call void @llvm.assume(i1 %k)
   br label %meh
 
 meh:
-; CHECK: ret i1 %k
   ret i1 %k
 }
 
@@ -256,3 +350,6 @@ declare i32 @_ZN1A3fooEv(ptr)
 declare i32 @_ZN1A3barEv(ptr)
 
 !0 = !{!"struct A"}
+;.
+; CHECK: [[META0]] = !{!"struct A"}
+;.


        


More information about the llvm-commits mailing list