Benjamin Kramer
|
6110efbf8c
|
Teach InstructionSimplify to fold (A & B) & A -> A & B and (A | B) | A -> A | B.
Reassociate does this but it doesn't catch all cases (e.g. if the operands are i1).
llvm-svn: 113651
|
2010-09-10 22:39:55 +00:00 |
|
Chris Lattner
|
ef91e752a6
|
convert to filecheck.
llvm-svn: 95854
|
2010-02-11 06:24:37 +00:00 |
|
Dan Gohman
|
c95df8b6d8
|
Use opt -S instead of piping bitcode output through llvm-dis.
llvm-svn: 81257
|
2009-09-08 22:34:10 +00:00 |
|
Dan Gohman
|
8d84372836
|
Change these tests to feed the assembly files to opt directly, instead
of using llvm-as, now that opt supports this.
llvm-svn: 81226
|
2009-09-08 16:50:01 +00:00 |
|
Chris Lattner
|
483c471daa
|
Implement a couple of foldings for ordered and unordered comparisons,
implementing cases related to PR1738.
llvm-svn: 43289
|
2007-10-24 05:38:08 +00:00 |
|