llvm-6502/test/Transforms/InstCombine/rem.ll
Chris Lattner 5640f33331 test for a variety of new transformations:
* 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


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@5588 91177308-0d34-0410-b5e6-96231b3b80d8
2003-02-18 19:28:47 +00:00

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
}