mirror of
https://github.com/RPCSX/llvm.git
synced 2024-12-03 09:21:13 +00:00
2241b7bfbb
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2633 91177308-0d34-0410-b5e6-96231b3b80d8
16 lines
363 B
LLVM
16 lines
363 B
LLVM
; 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
|
|
}
|