llvm-6502/test/Transforms/InstCombine/or.ll
Chris Lattner c2a2e73c7f Renumber tests sequentially
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@7280 91177308-0d34-0410-b5e6-96231b3b80d8
2003-07-23 21:11:56 +00:00

89 lines
1.5 KiB
LLVM

; This test makes sure that these instructions are properly eliminated.
;
; RUN: as < %s | opt -instcombine | dis | grep -v xor | not grep 'or '
implementation
int %test1(int %A) {
%B = or int %A, 0
ret int %B
}
int %test2(int %A) {
%B = or int %A, -1
ret int %B
}
ubyte %test2a(ubyte %A) {
%B = or ubyte %A, 255
ret ubyte %B
}
bool %test3(bool %A) {
%B = or bool %A, false
ret bool %B
}
bool %test4(bool %A) {
%B = or bool %A, true
ret bool %B
}
bool %test5(bool %A) {
%B = or bool %A, %A
ret bool %B
}
int %test6(int %A) {
%B = or int %A, %A
ret int %B
}
int %test7(int %A) { ; A | ~A == -1
%NotA = xor int -1, %A
%B = or int %A, %NotA
ret int %B
}
ubyte %test8(ubyte %A) {
%B = or ubyte %A, 254
%C = or ubyte %B, 1
ret ubyte %C
}
ubyte %test9(ubyte %A, ubyte %B) { ; Test that (A|c1)|(B|c2) == (A|B)|(c1|c2)
%C = or ubyte %A, 1
%D = or ubyte %B, 254
%E = or ubyte %C, %D
ret ubyte %E
}
ubyte %test10(ubyte %A) {
%B = or ubyte %A, 1
%C = and ubyte %B, 254
%D = or ubyte %C, 254 ; (X & C1) | C2 --> (X | C2) & (C1|C2)
ret ubyte %D
}
ubyte %test11(ubyte %A) {
%B = or ubyte %A, 254
%C = xor ubyte %B, 13
%D = or ubyte %C, 1 ; (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2)
%E = xor ubyte %D, 12
ret ubyte %E
}
uint %test12(uint %A) {
%B = or uint %A, 4 ; Should be eliminated
%C = and uint %B, 8
ret uint %C
}
uint %test13(uint %A) {
%B = or uint %A, 12
%C = and uint %B, 8 ; Always equal to 8
ret uint %C
}