llvm/test/Transforms/InstSimplify, branch release_32http://llvm.orghttps://git.amat.us/llvm/atom/test/Transforms/InstSimplify?h=release_322012-11-26T16:49:56ZMerging r168186: into the 3.2 release branch.2012-11-26T16:49:56ZPawel Wodnickipawel@32bitmicro.com2012-11-26T16:49:56Zurn:sha1:077cee586eda8b0edcca1ff07e823104eff718e7
InstructionSimplify should be able to simplify A+B==B+A to 'true'
but wasn't due to the same logic bug that caused PR14361.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/branches/release_32@168593 91177308-0d34-0410-b5e6-96231b3b80d8
Revert r153521 as it's causing large regressions on the nightly testers.2012-03-28T18:42:50ZChad Rosiermcrosier@apple.com2012-03-28T18:42:50Zurn:sha1:89e2b318e2266a7e3fe44151642c1850ec9bd275
Original commit message for r153521 (aka r153423):
Use the new range metadata in computeMaskedBits and add a new optimization to
instruction simplify that lets us remove an and when loding a boolean value.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@153587 91177308-0d34-0410-b5e6-96231b3b80d8
Reapply r153423; the original commit was fine. The failing test, distray, had 2012-03-27T17:44:52ZChad Rosiermcrosier@apple.com2012-03-27T17:44:52Zurn:sha1:d23a64cc164529739adaedb397e6279269f78efb
undefined behavior, which Rafael was kind enough to fix.
Original commit message for r153423:
Use the new range metadata in computeMaskedBits and add a new optimization to
instruction simplify that lets us remove an and when loding a boolean value.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@153521 91177308-0d34-0410-b5e6-96231b3b80d8
Revert r153423 as this is causing failures on our internal nightly testers.2012-03-26T18:07:14ZChad Rosiermcrosier@apple.com2012-03-26T18:07:14Zurn:sha1:cde6650bd05a745e78920e1cd508c3899ebbd644
Original commit message:
Use the new range metadata in computeMaskedBits and add a new optimization to
instruction simplify that lets us remove an and when loading a boolean value.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@153452 91177308-0d34-0410-b5e6-96231b3b80d8
Use the new range metadata in computeMaskedBits and add a new optimization to2012-03-26T01:44:11ZRafael Espindolarafael.espindola@gmail.com2012-03-26T01:44:11Zurn:sha1:7ddcd35d6beb99118f0b960329b304f9e9a2bf58
instruction simplify that lets us remove an and when loding a boolean value.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@153423 91177308-0d34-0410-b5e6-96231b3b80d8
Teach instsimplify how to simplify comparisons of pointers which are2012-03-25T21:28:14ZChandler Carruthchandlerc@gmail.com2012-03-25T21:28:14Zurn:sha1:58725a66c02865686c70132e8b9bd231eb66da63
constant-offsets of a common base using the generic GEP-walking logic
I added for computing pointer differences in the same situation.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@153419 91177308-0d34-0410-b5e6-96231b3b80d8
Switch the pointer-difference simplification logic to only work with2012-03-25T20:43:07ZChandler Carruthchandlerc@gmail.com2012-03-25T20:43:07Zurn:sha1:9d9e29b4a83818b066c09c8f832cec7641aa2115
inbounds GEPs. This isn't really necessary for simplifying pointer
differences, but I'm planning to re-use the same code to simplify
pointer comparisons where it is necessary. Since real code almost
exclusively uses inbounds GEPs, it doesn't seem worth it to support the
extra complexity of turning it on and off. If anyone would like that
back, feel free to shout. Note that instcombine will still catch any of
these patterns.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@153418 91177308-0d34-0410-b5e6-96231b3b80d8
Generalize the "trunc(ptrtoint(x)) - trunc(ptrtoint(y)) ->2012-03-13T14:07:05ZDuncan Sandsbaldrick@free.fr2012-03-13T14:07:05Zurn:sha1:bd0fe5642544d4ec3aee1ede7af60c006bae5cbf
trunc(ptrtoint(x-y))" optimization introduced by Chandler.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@152626 91177308-0d34-0410-b5e6-96231b3b80d8
Teach instsimplify how to constant fold pointer differences.2012-03-12T11:19:31ZChandler Carruthchandlerc@gmail.com2012-03-12T11:19:31Zurn:sha1:fc72ae613afd7ca2526bb66156bafe8b0054cb3b
Typically instcombine has handled this, but pointer differences show up
in several contexts where we would like to get constant folding, and
cannot afford to run instcombine. Specifically, I'm working on improving
the constant folding of arguments used in inline cost analysis with
instsimplify.
Doing this in instsimplify implies some algorithm changes. We have to
handle multiple layers of all-constant GEPs because instsimplify cannot
fold them into a single GEP the way instcombine can. Also, we're only
interested in all-constant GEPs. The result is that this doesn't really
replace the instcombine logic, it's just complimentary and focused on
constant folding.
Reviewed on IRC by Benjamin Kramer.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@152555 91177308-0d34-0410-b5e6-96231b3b80d8
Make sure we don't return bits outside the mask in ComputeMaskedBits. PR12189.2012-03-05T23:09:40ZEli Friedmaneli.friedman@gmail.com2012-03-05T23:09:40Zurn:sha1:049d08f5c9e4f9f5c71d8f8d08d846ba15f2ae99
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@152066 91177308-0d34-0410-b5e6-96231b3b80d8