[llvm] r315752 - [Reassociate] auto-generate better checks; NFC

Sanjay Patel via llvm-commits llvm-commits at lists.llvm.org
Fri Oct 13 13:56:35 PDT 2017


Author: spatel
Date: Fri Oct 13 13:56:35 2017
New Revision: 315752

URL: http://llvm.org/viewvc/llvm-project?rev=315752&view=rev
Log:
[Reassociate] auto-generate better checks; NFC

These would fail if the created variable names changed.

Modified:
    llvm/trunk/test/Transforms/Reassociate/2002-05-15-SubReassociate.ll
    llvm/trunk/test/Transforms/Reassociate/subtest.ll

Modified: llvm/trunk/test/Transforms/Reassociate/2002-05-15-SubReassociate.ll
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/Reassociate/2002-05-15-SubReassociate.ll?rev=315752&r1=315751&r2=315752&view=diff
==============================================================================
--- llvm/trunk/test/Transforms/Reassociate/2002-05-15-SubReassociate.ll (original)
+++ llvm/trunk/test/Transforms/Reassociate/2002-05-15-SubReassociate.ll Fri Oct 13 13:56:35 2017
@@ -2,25 +2,25 @@
 
 ; With sub reassociation, constant folding can eliminate all of the constants.
 define i32 @test1(i32 %A, i32 %B) {
-; CHECK-LABEL: test1
-; CHECK-NEXT: %Z = sub i32 %A, %B
-; CHECK-NEXT: ret i32 %Z
-
+; CHECK-LABEL: @test1(
+; CHECK-NEXT:    [[Z:%.*]] = sub i32 %A, %B
+; CHECK-NEXT:    ret i32 [[Z]]
+;
   %W = add i32 5, %B
   %X = add i32 -7, %A
   %Y = sub i32 %X, %W
   %Z = add i32 %Y, 12
   ret i32 %Z
 }
- 
+
 ; With sub reassociation, constant folding can eliminate the two 12 constants.
 define i32 @test2(i32 %A, i32 %B, i32 %C, i32 %D) {
-; CHECK-LABEL: test2
-; CHECK-NEXT: %sum = add i32 %B, %A
-; CHECK-NEXT: %sum1 = add i32 %sum, %C
-; CHECK-NEXT: %Q = sub i32 %D, %sum1
-; CHECK-NEXT: ret i32 %Q
-
+; CHECK-LABEL: @test2(
+; CHECK-NEXT:    [[SUM:%.*]] = add i32 %B, %A
+; CHECK-NEXT:    [[SUM1:%.*]] = add i32 [[SUM]], %C
+; CHECK-NEXT:    [[Q:%.*]] = sub i32 %D, [[SUM1]]
+; CHECK-NEXT:    ret i32 [[Q]]
+;
   %M = add i32 %A, 12
   %N = add i32 %M, %B
   %O = add i32 %N, %C
@@ -28,3 +28,4 @@ define i32 @test2(i32 %A, i32 %B, i32 %C
   %Q = add i32 %P, 12
   ret i32 %Q
 }
+

Modified: llvm/trunk/test/Transforms/Reassociate/subtest.ll
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/Reassociate/subtest.ll?rev=315752&r1=315751&r2=315752&view=diff
==============================================================================
--- llvm/trunk/test/Transforms/Reassociate/subtest.ll (original)
+++ llvm/trunk/test/Transforms/Reassociate/subtest.ll Fri Oct 13 13:56:35 2017
@@ -2,9 +2,10 @@
 
 ; With sub reassociation, constant folding can eliminate the 12 and -12 constants.
 define i32 @test1(i32 %A, i32 %B) {
-; CHECK-LABEL: @test1
-; CHECK-NEXT: %Z = sub i32 %A, %B
-; CHECK-NEXT: ret i32 %Z
+; CHECK-LABEL: @test1(
+; CHECK-NEXT:    [[Z:%.*]] = sub i32 %A, %B
+; CHECK-NEXT:    ret i32 [[Z]]
+;
   %X = add i32 -12, %A
   %Y = sub i32 %X, %B
   %Z = add i32 %Y, 12
@@ -13,14 +14,15 @@ define i32 @test1(i32 %A, i32 %B) {
 
 ; PR2047
 ; With sub reassociation, constant folding can eliminate the uses of %a.
-define i32 @test2(i32 %a, i32 %b, i32 %c) nounwind  {
-; CHECK-LABEL: @test2
-; CHECK-NEXT: %sum = add i32 %c, %b
-; CHECK-NEXT: %tmp7 = sub i32 0, %sum
-; CHECK-NEXT: ret i32 %tmp7
-
+define i32 @test2(i32 %a, i32 %b, i32 %c) {
+; CHECK-LABEL: @test2(
+; CHECK-NEXT:    [[SUM:%.*]] = add i32 %c, %b
+; CHECK-NEXT:    [[TMP7:%.*]] = sub i32 0, [[SUM]]
+; CHECK-NEXT:    ret i32 [[TMP7]]
+;
   %tmp3 = sub i32 %a, %b
   %tmp5 = sub i32 %tmp3, %c
   %tmp7 = sub i32 %tmp5, %a
   ret i32 %tmp7
 }
+




More information about the llvm-commits mailing list