mirror of
https://github.com/RPCSX/llvm.git
synced 2024-11-28 14:10:41 +00:00
fa59079c3c
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@5591 91177308-0d34-0410-b5e6-96231b3b80d8
54 lines
1.1 KiB
LLVM
54 lines
1.1 KiB
LLVM
; This test makes sure that add instructions are properly eliminated.
|
|
;
|
|
; This also tests that a subtract with a constant is properly converted
|
|
; to a add w/negative constant
|
|
|
|
; RUN: if as < %s | opt -instcombine -die | dis | grep add
|
|
; RUN: then exit 1
|
|
; RUN: else exit 0
|
|
; RUN: fi
|
|
|
|
implementation
|
|
|
|
int %test1(int %A) {
|
|
%B = add int %A, 0
|
|
ret int %B
|
|
}
|
|
|
|
int %test2(int %A) {
|
|
%B = add int %A, 5
|
|
%C = add int %B, -5
|
|
ret int %C
|
|
}
|
|
|
|
int %test3(int %A) {
|
|
%B = add int %A, 5
|
|
%C = sub int %B, 5 ;; This should get converted to an add
|
|
ret int %C
|
|
}
|
|
|
|
int %test4(int %A, int %B) {
|
|
%C = sub int 0, %A
|
|
%D = add int %B, %C ; D = B + -A = B - A
|
|
ret int %D
|
|
}
|
|
|
|
int %test5(int %A, int %B) {
|
|
%C = sub int 0, %A
|
|
%D = add int %C, %B ; D = -A + B = B - A
|
|
ret int %D
|
|
}
|
|
|
|
int %test6(int %A) {
|
|
%B = mul int 7, %A
|
|
%C = add int %B, %A ; C = 7*A+A == 8*A == A << 3
|
|
ret int %C
|
|
}
|
|
|
|
int %test7(int %A) {
|
|
%B = mul int 7, %A
|
|
%C = add int %A, %B ; C = A+7*A == 8*A == A << 3
|
|
ret int %C
|
|
}
|
|
|