6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-12 17:32:19 +00:00
Code Issues Projects Releases Wiki Activity

New testcases to ensure sub's are maximally reassociable

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2633 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2002-05-15 21:59:31 +00:00
parent b064baf851
commit 2241b7bfbb
2 changed files with 29 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
test/Transforms/Reassociate/2002-05-15-SubReassociate.ll Normal file
View File

@ -0,0 +1,14 @@
; With sub reassociation, constant folding can eliminate all of the constants.
;
; RUN: if as < %s | opt -reassociate -constprop -instcombine -dce | dis | grep add
; RUN: then exit 1
; RUN: else exit 0
; RUN: fi
int "test"(int %A, int %B) {
%W = add int -5, %B
%X = add int -7, %A
%Y = sub int %X, %W
%Z = add int %Y, 12
ret int %Z
}

15
test/Transforms/Reassociate/2002-05-15-SubReassociate2.ll Normal file
View File

@ -0,0 +1,15 @@
; With sub reassociation, constant folding can eliminate the two 12 constants.
;
; RUN: if as < %s | opt -reassociate -constprop -dce | dis | grep 12
; RUN: then exit 1
; RUN: else exit 0
; RUN: fi
int "test"(int %A, int %B, int %C, int %D) {
%M = add int %A, 12
%N = add int %M, %B
%O = add int %N, %C
%P = sub int %D, %O
%Q = add int %P, 12
ret int %Q
}