RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-31 20:51:52 +01:00
Code Issues Projects Releases Wiki Activity

[Reassociate] auto-generate better checks; NFC

Browse Source 
These would fail if the created variable names changed.

llvm-svn: 315752
This commit is contained in:
Sanjay Patel 2017-10-13 20:56:35 +00:00
parent e781fe102e
commit 0209a3929b
2 changed files with 23 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
test/Transforms/Reassociate/2002-05-15-SubReassociate.ll
View File

@ -2,25 +2,25 @@
; With sub reassociation, constant folding can eliminate all of the constants. ; With sub reassociation, constant folding can eliminate all of the constants.
define i32 @test1(i32 %A, i32 %B) { define i32 @test1(i32 %A, i32 %B) {
; CHECK-LABEL: test1 ; CHECK-LABEL: @test1(
; CHECK-NEXT: %Z = sub i32 %A, %B ; CHECK-NEXT: [[Z:%.*]] = sub i32 %A, %B
; CHECK-NEXT: ret i32 %Z ; CHECK-NEXT: ret i32 [[Z]]
;
%W = add i32 5, %B %W = add i32 5, %B
%X = add i32 -7, %A %X = add i32 -7, %A
%Y = sub i32 %X, %W %Y = sub i32 %X, %W
%Z = add i32 %Y, 12 %Z = add i32 %Y, 12
ret i32 %Z ret i32 %Z
} }
; With sub reassociation, constant folding can eliminate the two 12 constants. ; With sub reassociation, constant folding can eliminate the two 12 constants.
define i32 @test2(i32 %A, i32 %B, i32 %C, i32 %D) { define i32 @test2(i32 %A, i32 %B, i32 %C, i32 %D) {
; CHECK-LABEL: test2 ; CHECK-LABEL: @test2(
; CHECK-NEXT: %sum = add i32 %B, %A ; CHECK-NEXT: [[SUM:%.*]] = add i32 %B, %A
; CHECK-NEXT: %sum1 = add i32 %sum, %C ; CHECK-NEXT: [[SUM1:%.*]] = add i32 [[SUM]], %C
; CHECK-NEXT: %Q = sub i32 %D, %sum1 ; CHECK-NEXT: [[Q:%.*]] = sub i32 %D, [[SUM1]]
; CHECK-NEXT: ret i32 %Q ; CHECK-NEXT: ret i32 [[Q]]
;
%M = add i32 %A, 12 %M = add i32 %A, 12
%N = add i32 %M, %B %N = add i32 %M, %B
%O = add i32 %N, %C %O = add i32 %N, %C
@ -28,3 +28,4 @@ define i32 @test2(i32 %A, i32 %B, i32 %C, i32 %D) {
%Q = add i32 %P, 12 %Q = add i32 %P, 12
ret i32 %Q ret i32 %Q
} }

20
test/Transforms/Reassociate/subtest.ll
View File

@ -2,9 +2,10 @@
; With sub reassociation, constant folding can eliminate the 12 and -12 constants. ; With sub reassociation, constant folding can eliminate the 12 and -12 constants.
define i32 @test1(i32 %A, i32 %B) { define i32 @test1(i32 %A, i32 %B) {
; CHECK-LABEL: @test1 ; CHECK-LABEL: @test1(
; CHECK-NEXT: %Z = sub i32 %A, %B ; CHECK-NEXT: [[Z:%.*]] = sub i32 %A, %B
; CHECK-NEXT: ret i32 %Z ; CHECK-NEXT: ret i32 [[Z]]
;
%X = add i32 -12, %A %X = add i32 -12, %A
%Y = sub i32 %X, %B %Y = sub i32 %X, %B
%Z = add i32 %Y, 12 %Z = add i32 %Y, 12
@ -13,14 +14,15 @@ define i32 @test1(i32 %A, i32 %B) {
; PR2047 ; PR2047
; With sub reassociation, constant folding can eliminate the uses of %a. ; With sub reassociation, constant folding can eliminate the uses of %a.
define i32 @test2(i32 %a, i32 %b, i32 %c) nounwind { define i32 @test2(i32 %a, i32 %b, i32 %c) {
; CHECK-LABEL: @test2 ; CHECK-LABEL: @test2(
; CHECK-NEXT: %sum = add i32 %c, %b ; CHECK-NEXT: [[SUM:%.*]] = add i32 %c, %b
; CHECK-NEXT: %tmp7 = sub i32 0, %sum ; CHECK-NEXT: [[TMP7:%.*]] = sub i32 0, [[SUM]]
; CHECK-NEXT: ret i32 %tmp7 ; CHECK-NEXT: ret i32 [[TMP7]]
;
%tmp3 = sub i32 %a, %b %tmp3 = sub i32 %a, %b
%tmp5 = sub i32 %tmp3, %c %tmp5 = sub i32 %tmp3, %c
%tmp7 = sub i32 %tmp5, %a %tmp7 = sub i32 %tmp5, %a
ret i32 %tmp7 ret i32 %tmp7
} }