1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-28 14:32:51 +01:00
Commit Graph

8 Commits

Author SHA1 Message Date
Chris Lattner
1759ccff2b 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

llvm-svn: 5588
2003-02-18 19:28:47 +00:00
Chris Lattner
ecbab08e9d Modernize testcase
llvm-svn: 5585
2003-02-18 18:06:44 +00:00
Chris Lattner
717bd8eb0b This test was mistakenly matching 'predecessors' that the new asmwriter
spits out

llvm-svn: 4068
2002-10-08 16:09:47 +00:00
Chris Lattner
ce6d033e05 Remove illegal test now that not instruction does not exist.
llvm-svn: 3312
2002-08-14 17:44:00 +00:00
Chris Lattner
e74955adc5 xor x, ALLONES should -> not x
llvm-svn: 3285
2002-08-09 23:34:39 +00:00
Chris Lattner
cdb6a7e022 These tests should not run -dce pass to cleanup instcombine.
If instcombine is making dead instructions, ALL that should be used is -die

llvm-svn: 3221
2002-08-02 19:27:58 +00:00
Chris Lattner
4e94e9328e More testcases I don't want to forget about
llvm-svn: 2480
2002-05-06 05:51:26 +00:00
Chris Lattner
c019944886 New testcases so I don't forget about these algebraic simplifications
llvm-svn: 2479
2002-05-06 05:43:36 +00:00