mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-30 15:32:52 +01:00
4cb08f39e9
to run the die pass after it. llvm-svn: 11942
46 lines
874 B
LLVM
46 lines
874 B
LLVM
; This test makes sure that these instructions are properly eliminated.
|
|
;
|
|
|
|
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | not grep xor
|
|
|
|
implementation
|
|
|
|
int %test1(int %A) {
|
|
%B = xor int %A, -1
|
|
%C = xor int %B, -1
|
|
ret int %C
|
|
}
|
|
|
|
bool %test2(int %A, int %B) {
|
|
%cond = setle int %A, %B ; Can change into setge
|
|
%Ret = xor bool %cond, true
|
|
ret bool %Ret
|
|
}
|
|
|
|
|
|
; Test that demorgans law can be instcombined
|
|
int %test3(int %A, int %B) {
|
|
%a = xor int %A, -1
|
|
%b = xor int %B, -1
|
|
%c = and int %a, %b
|
|
%d = xor int %c, -1
|
|
ret int %d
|
|
}
|
|
|
|
; Test that demorgens law can work with constants
|
|
int %test4(int %A, int %B) {
|
|
%a = xor int %A, -1
|
|
%c = and int %a, 5 ; 5 = ~c2
|
|
%d = xor int %c, -1
|
|
ret int %d
|
|
}
|
|
|
|
; test the mirror of demorgans law...
|
|
int %test5(int %A, int %B) {
|
|
%a = xor int %A, -1
|
|
%b = xor int %B, -1
|
|
%c = or int %a, %b
|
|
%d = xor int %c, -1
|
|
ret int %d
|
|
}
|