aboutsummaryrefslogtreecommitdiffstats
path: root/lib/Transforms/Utils/PromoteMemoryToRegister.cpp
Commit message (Expand)AuthorAgeFilesLines
* 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
generated by cgit v1.1 at 2025-06-02 14:21:01 +0000