aboutsummaryrefslogtreecommitdiffstats
path: root/lib/Transforms/Utils/PromoteMemoryToRegister.cpp
Commit message (Expand)AuthorAgeFilesLines
* Let AnalyzeAlloca() remove debug intrinsics.Devang Patel2008-11-171-20/+11
* Rework r58829, allowing removal of dbg info intrinsics during allocaDaniel Dunbar2008-11-081-20/+24
* BCUI + 1 doesn't work. Use next instead.Bill Wendling2008-11-071-1/+2
* Handle (delete) dbg intrinsics while promoting alloca.Devang Patel2008-11-071-3/+22
* Rewrite all the 'PromoteLocallyUsedAlloca[s]' logic. With the power ofChris Lattner2008-10-271-175/+97
* Add a new LargeBlockInfo helper, which is just a wrapper aroundChris Lattner2008-10-271-57/+123
* API changes for class Use size reduction, wave 1.Gabor Greif2008-04-061-3/+3
* Update -mem2reg to use succ_iterator instead of iterating across TerminatorInstNick Lewycky2008-03-131-13/+10
* Make RenamePass faster by making the 'is this a new phi node'Chris Lattner2008-02-051-11/+11
* Remove attribution from file headers, per discussion on llvmdev.Chris Lattner2007-12-291-2/+2
* Finishing initial docs for all transformations in Passes.html.Gordon Henriksen2007-11-041-1/+1
* Merge DenseMapKeyInfo & DenseMapValueInfo into DenseMapInfoChris Lattner2007-09-171-7/+11
* Don't promote volatile loads/stores. This is needed (for example) to handle s...Anton Korobeynikov2007-08-261-3/+6
* rewrite the code used to construct pruned SSA form with the IDF method.Chris Lattner2007-08-041-82/+114
* Factor out a whole bunch of code into it's own method.Chris Lattner2007-08-041-65/+82
* Use getNumPreds(BB) instead of computing them manually. This is a very small butChris Lattner2007-08-041-4/+4
* Change the rename pass to be "tail recursive", only adding N-1 successorsChris Lattner2007-08-041-21/+35
* cache computation of #preds for a BB. This speeds upChris Lattner2007-08-041-3/+14
* reserve operand space for phi nodes when we insert them.Chris Lattner2007-08-041-0/+1
* use continue to avoid nesting, no functionality change.Chris Lattner2007-08-041-14/+15
* Promoting allocas with the 'single store' fastpath is Chris Lattner2007-08-041-10/+9
* When PromoteLocallyUsedAllocas promoted allocas, it didn't rememberChris Lattner2007-08-041-2/+13
* std::map -> DenseMapChris Lattner2007-08-041-3/+3
* fix a logic bug where we wouldn't promote single store allocas if the Chris Lattner2007-08-041-2/+2
* When we do the single-store optimization, delete both the storeChris Lattner2007-08-041-2/+8
* Three improvements:Chris Lattner2007-08-041-6/+16
* switch from using a std::set to using a SmallPtrSet. This speeds up theChris Lattner2007-08-041-3/+3
* In mem2reg, when handling the single-store case, make sure to removeChris Lattner2007-08-041-8/+10
* split rewriting of single-store allocas into its ownChris Lattner2007-08-041-39/+57
* refactor some code to shrink PromoteMem2Reg::run a bitChris Lattner2007-08-041-63/+96
* add a typedef, no other change.Chris Lattner2007-08-041-7/+8
* avoid an unneeded vector copy. This speeds up mem2reg on the testcase Chris Lattner2007-08-041-1/+9
* make RenamePassWorkList a local var instead of an ivar.Chris Lattner2007-08-041-8/+8
* It's not necessary to do rounding for alloca operations when the requestedDan Gohman2007-07-181-0/+835