mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-27 22:12:47 +01:00
1759ccff2b
* A & ~A == 0 * A / (2^c) == A >> c if unsigned * 0 / A == 0 * 1.0 * A == A * A * (2^c) == A << c * A ^ ~A == -1 * A | ~A == -1 * 0 % X = 0 * A % (2^c) == A & (c-1) if unsigned * A - (A & B) == A & ~B * -1 - A == ~A llvm-svn: 5588
25 lines
447 B
LLVM
25 lines
447 B
LLVM
; This test makes sure that these instructions are properly eliminated.
|
|
;
|
|
|
|
; RUN: if as < %s | opt -instcombine | dis | grep rem
|
|
; RUN: then exit 1
|
|
; RUN: else exit 0
|
|
; RUN: fi
|
|
|
|
implementation
|
|
|
|
int %test1(int %A) {
|
|
%B = rem int %A, 1 ; ISA constant 0
|
|
ret int %B
|
|
}
|
|
|
|
int %test2(int %A) { ; 0 % X = 0, we don't need ot preserve traps
|
|
%B = rem int 0, %A
|
|
ret int %B
|
|
}
|
|
|
|
uint %test3(uint %A) {
|
|
%B = rem uint %A, 8 ; & 7
|
|
ret uint %B
|
|
}
|