llvm-6502/test/Transforms/InstCombine/and.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

45 lines
731 B
LLVM

; This test makes sure that these instructions are properly eliminated.
;
; RUN: if as < %s | opt -instcombine | dis | grep and
; RUN: then exit 1
; RUN: else exit 0
; RUN: fi
implementation
int %test1(int %A) {
%B = and int %A, 0 ; zero result
ret int %B
}
int %test2(int %A) {
%B = and int %A, -1 ; noop
ret int %B
}
bool %test3(bool %A) {
%B = and bool %A, false ; always = false
ret bool %B
}
bool %test4(bool %A) {
%B = and bool %A, true ; noop
ret bool %B
}
int %test5(int %A) {
%B = and int %A, %A
ret int %B
}
bool %test6(bool %A) {
%B = and bool %A, %A
ret bool %B
}
int %test7(int %A) { ; A & ~A == 0
%NotA = xor int %A, -1
%B = and int %A, %NotA
ret int %B
}