Benjamin Kramer
|
6844c8ea5a
|
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).
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113651 91177308-0d34-0410-b5e6-96231b3b80d8
|
2010-09-10 22:39:55 +00:00 |
|
Chris Lattner
|
2e1cdbf92d
|
convert to filecheck.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@95854 91177308-0d34-0410-b5e6-96231b3b80d8
|
2010-02-11 06:24:37 +00:00 |
|
Dan Gohman
|
3e054fe9ef
|
Use opt -S instead of piping bitcode output through llvm-dis.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@81257 91177308-0d34-0410-b5e6-96231b3b80d8
|
2009-09-08 22:34:10 +00:00 |
|
Dan Gohman
|
b1e1e82c54
|
Change these tests to feed the assembly files to opt directly, instead
of using llvm-as, now that opt supports this.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@81226 91177308-0d34-0410-b5e6-96231b3b80d8
|
2009-09-08 16:50:01 +00:00 |
|
Chris Lattner
|
99c65745a2
|
Implement a couple of foldings for ordered and unordered comparisons,
implementing cases related to PR1738.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43289 91177308-0d34-0410-b5e6-96231b3b80d8
|
2007-10-24 05:38:08 +00:00 |
|