RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-11-29 06:30:30 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

upgrade and simplify this test.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@47240 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2008-02-17 20:48:43 +00:00
parent 9bc5ed78c8
commit f06c3c29ac
1 changed files with 7 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1,10 +1,11 @@
; With sub reassociation, constant folding can eliminate the 12 and -12 constants.
;
; RUN: llvm-upgrade < %s | llvm-as | opt -reassociate -constprop -instcombine -die | llvm-dis | not grep 12
; RUN: llvm-as < %s | opt -reassociate -instcombine | llvm-dis | not grep 12
int "test"(int %A, int %B) {
%X = add int -12, %A
%Y = sub int %X, %B
%Z = add int %Y, 12
ret int %Z
define i32 @test(i32 %A, i32 %B) {
%X = add i32 -12, %A ; <i32> [#uses=1]
%Y = sub i32 %X, %B ; <i32> [#uses=1]
%Z = add i32 %Y, 12 ; <i32> [#uses=1]
ret i32 %Z
}