llvm/lib/Transforms/Utils, branch release_31http://llvm.orghttps://git.amat.us/llvm/atom/lib/Transforms/Utils?h=release_312012-04-30T17:58:59ZRename to match coding conventions.2012-04-30T17:58:59ZBill Wendlingisanbard@gmail.com2012-04-30T17:58:59Zurn:sha1:c70ebff18a5cbb863576a525ba3a5fe0cf9216a4
git-svn-id: https://llvm.org/svn/llvm-project/llvm/branches/release_31@155834 91177308-0d34-0410-b5e6-96231b3b80d8
Merging r155817:2012-04-30T17:48:14ZBill Wendlingisanbard@gmail.com2012-04-30T17:48:14Zurn:sha1:458cf3ee70dea5a733a5b16286c5d7eb98a108d3
------------------------------------------------------------------------
r155817 | void | 2012-04-30 03:44:54 -0700 (Mon, 30 Apr 2012) | 9 lines
Second attempt at PR12573:
Allow the "SplitCriticalEdge" function to split the edge to a landing pad. If
the pass is *sure* that it thinks it knows what it's doing, then it may go ahead
and specify that the landing pad can have its critical edge split. The loop
unswitch pass is one of these passes. It will split the critical edges of all
edges coming from a loop to a landing pad not within the loop. Doing so will
retain important loop analysis information, such as loop simplify.
------------------------------------------------------------------------
git-svn-id: https://llvm.org/svn/llvm-project/llvm/branches/release_31@155833 91177308-0d34-0410-b5e6-96231b3b80d8
Fix 12513: Loop unrolling breaks with indirect branches.2012-04-10T05:14:42ZAndrew Trickatrick@apple.com2012-04-10T05:14:42Zurn:sha1:d9fc1ce8096f7138c60edc3a6655583bf209780e
Take this opportunity to generalize the indirectbr bailout logic for
loop transformations. CFG transformations will never get indirectbr
right, and there's no point trying.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@154386 91177308-0d34-0410-b5e6-96231b3b80d8
Sink the collection of return instructions until after *all*2012-04-06T17:21:31ZChandler Carruthchandlerc@gmail.com2012-04-06T17:21:31Zurn:sha1:9ceebb7e92e980340d199b550e3a2110c80ea871
simplification has been performed. This is a bit less efficient
(requires another ilist walk of the basic blocks) but shouldn't matter
in practice. More importantly, it's just too much work to keep track of
all the various ways the return instructions can be mutated while
simplifying them. This fixes yet another crasher, reported by Daniel
Dunbar.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@154179 91177308-0d34-0410-b5e6-96231b3b80d8
Sink the return instruction collection until after we're done deleting2012-04-06T01:11:52ZChandler Carruthchandlerc@gmail.com2012-04-06T01:11:52Zurn:sha1:6bbab86af959a8819ddadfe8909bcfa5aa53ce9f
dead code, including dead return instructions in some cases. Otherwise,
we end up having a bogus poniter to a return instruction that blows up
much further down the road.
It turns out that this pattern is both simpler to code, easier to update
in the face of enhancements to the inliner cleanup, and likely cheaper
given that it won't add dead instructions to the list.
Thanks to John Regehr's numerous test cases for teasing this out.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@154157 91177308-0d34-0410-b5e6-96231b3b80d8
Always compute all the bits in ComputeMaskedBits.2012-04-04T12:51:34ZRafael Espindolarafael.espindola@gmail.com2012-04-04T12:51:34Zurn:sha1:26c8dcc692fb2addd475446cfff24d6a4e958bca
This allows us to keep passing reduced masks to SimplifyDemandedBits, but
know about all the bits if SimplifyDemandedBits fails. This allows instcombine
to simplify cases like the one in the included testcase.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@154011 91177308-0d34-0410-b5e6-96231b3b80d8
Switch to WeakVHs in the value mapper, and aggressively prune dead basic2012-03-28T08:38:27ZChandler Carruthchandlerc@gmail.com2012-03-28T08:38:27Zurn:sha1:afff33001a4fd3049d97cb40eea459d5c87ae5cc
blocks in the function cloner. This removes the last case of trivially
dead code that I've been seeing in the wild getting inlined, analyzed,
re-inlined, optimized, only to be deleted. Nukes a FIXME from the
cleanup tests.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@153572 91177308-0d34-0410-b5e6-96231b3b80d8
Tidy.2012-03-26T19:09:40ZEric Christopherechristo@apple.com2012-03-26T19:09:40Zurn:sha1:7d8eb711e4608dcca9366141be22941af8d1eff8
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@153456 91177308-0d34-0410-b5e6-96231b3b80d8
Tidy.2012-03-26T19:09:38ZEric Christopherechristo@apple.com2012-03-26T19:09:38Zurn:sha1:373c2d37072026e82f9b307eb40cf12baafd5f93
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@153455 91177308-0d34-0410-b5e6-96231b3b80d8
Teach the function cloner (and thus the inliner) to simplify PHINodes2012-03-25T10:34:54ZChandler Carruthchandlerc@gmail.com2012-03-25T10:34:54Zurn:sha1:f8c8a9cbb40972b07432d6b25d1a351556485b1e
aggressively. There are lots of dire warnings about this being expensive
that seem to predate switching to the TrackingVH-based value remapper
that is automatically updated on RAUW. This makes it easy to not just
prune single-entry PHIs, but to fully simplify PHIs, and to recursively
simplify the newly inlined code to propagate PHINode simplifications.
This introduces a bit of a thorny problem though. We may end up
simplifying a branch condition to a constant when we fold PHINodes, and
we would like to nuke any dead blocks resulting from this so that time
isn't wasted continually analyzing them, but this isn't easy. Deleting
basic blocks *after* they are fully cloned and mapped into the new
function currently requires manually updating the value map. The last
piece of the simplification-during-inlining puzzle will require either
switching to WeakVH mappings or some other piece of refactoring. I've
left a FIXME in the testcase about this.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@153410 91177308-0d34-0410-b5e6-96231b3b80d8