| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| ... | |
| * | Handle (delete) dbg intrinsics while promoting alloca. | Devang Patel | 2008-11-07 | 1 | -3/+22 |
| * | Rewrite all the 'PromoteLocallyUsedAlloca[s]' logic. With the power of | Chris Lattner | 2008-10-27 | 1 | -175/+97 |
| * | Add a new LargeBlockInfo helper, which is just a wrapper around | Chris Lattner | 2008-10-27 | 1 | -57/+123 |
| * | API changes for class Use size reduction, wave 1. | Gabor Greif | 2008-04-06 | 1 | -3/+3 |
| * | Update -mem2reg to use succ_iterator instead of iterating across TerminatorInst | Nick Lewycky | 2008-03-13 | 1 | -13/+10 |
| * | Make RenamePass faster by making the 'is this a new phi node' | Chris Lattner | 2008-02-05 | 1 | -11/+11 |
| * | Remove attribution from file headers, per discussion on llvmdev. | Chris Lattner | 2007-12-29 | 1 | -2/+2 |
| * | Finishing initial docs for all transformations in Passes.html. | Gordon Henriksen | 2007-11-04 | 1 | -1/+1 |
| * | Merge DenseMapKeyInfo & DenseMapValueInfo into DenseMapInfo | Chris Lattner | 2007-09-17 | 1 | -7/+11 |
| * | Don't promote volatile loads/stores. This is needed (for example) to handle s... | Anton Korobeynikov | 2007-08-26 | 1 | -3/+6 |
| * | rewrite the code used to construct pruned SSA form with the IDF method. | Chris Lattner | 2007-08-04 | 1 | -82/+114 |
| * | Factor out a whole bunch of code into it's own method. | Chris Lattner | 2007-08-04 | 1 | -65/+82 |
| * | Use getNumPreds(BB) instead of computing them manually. This is a very small but | Chris Lattner | 2007-08-04 | 1 | -4/+4 |
| * | Change the rename pass to be "tail recursive", only adding N-1 successors | Chris Lattner | 2007-08-04 | 1 | -21/+35 |
| * | cache computation of #preds for a BB. This speeds up | Chris Lattner | 2007-08-04 | 1 | -3/+14 |
| * | reserve operand space for phi nodes when we insert them. | Chris Lattner | 2007-08-04 | 1 | -0/+1 |
| * | use continue to avoid nesting, no functionality change. | Chris Lattner | 2007-08-04 | 1 | -14/+15 |
| * | Promoting allocas with the 'single store' fastpath is | Chris Lattner | 2007-08-04 | 1 | -10/+9 |
| * | When PromoteLocallyUsedAllocas promoted allocas, it didn't remember | Chris Lattner | 2007-08-04 | 1 | -2/+13 |
| * | std::map -> DenseMap | Chris Lattner | 2007-08-04 | 1 | -3/+3 |
| * | fix a logic bug where we wouldn't promote single store allocas if the | Chris Lattner | 2007-08-04 | 1 | -2/+2 |
| * | When we do the single-store optimization, delete both the store | Chris Lattner | 2007-08-04 | 1 | -2/+8 |
| * | Three improvements: | Chris Lattner | 2007-08-04 | 1 | -6/+16 |
| * | switch from using a std::set to using a SmallPtrSet. This speeds up the | Chris Lattner | 2007-08-04 | 1 | -3/+3 |
| * | In mem2reg, when handling the single-store case, make sure to remove | Chris Lattner | 2007-08-04 | 1 | -8/+10 |
| * | split rewriting of single-store allocas into its own | Chris Lattner | 2007-08-04 | 1 | -39/+57 |
| * | refactor some code to shrink PromoteMem2Reg::run a bit | Chris Lattner | 2007-08-04 | 1 | -63/+96 |
| * | add a typedef, no other change. | Chris Lattner | 2007-08-04 | 1 | -7/+8 |
| * | avoid an unneeded vector copy. This speeds up mem2reg on the testcase | Chris Lattner | 2007-08-04 | 1 | -1/+9 |
| * | make RenamePassWorkList a local var instead of an ivar. | Chris Lattner | 2007-08-04 | 1 | -8/+8 |
| * | Use DominatorTree instead of ETForest. | Devang Patel | 2007-06-07 | 1 | -10/+12 |
| * | Mem2Reg does not need TargetData. | Devang Patel | 2007-04-25 | 1 | -7/+5 |
| * | Remove unused function argument. | Devang Patel | 2007-04-25 | 1 | -2/+2 |
| * | Fix a comment. | Owen Anderson | 2007-04-21 | 1 | -1/+1 |
| * | Move more passes to using ETForest instead of DominatorTree. | Owen Anderson | 2007-04-20 | 1 | -10/+9 |
| * | Reduce malloc/free traffic. | Devang Patel | 2007-03-26 | 1 | -12/+8 |
| * | Remove dead comments. | Devang Patel | 2007-03-09 | 1 | -3/+0 |
| * | Avoid recursion. Use iterative algorithm for RenamePass(). | Devang Patel | 2007-03-09 | 1 | -4/+31 |
| * | redesign the primary datastructure used by mem2reg to eliminate an | Chris Lattner | 2007-02-07 | 1 | -103/+156 |
| * | With the last change, we no longer need both directions of mapping from | Chris Lattner | 2007-02-05 | 1 | -4/+8 |
| * | Simplify use of DFBlocks, this makes no noticable performance difference, | Chris Lattner | 2007-02-05 | 1 | -3/+3 |
| * | Switch InsertedPHINodes back to SmallPtrSet now that the SmallPtrSet::erase | Chris Lattner | 2007-02-05 | 1 | -6/+6 |
| * | switch a SmallPtrSet back to an std::set for now, this caused problems. | Chris Lattner | 2007-02-05 | 1 | -6/+6 |
| * | switch an std::set over to a SmallPtrSet, speeding up mem2reg 6% on 176.gcc. | Chris Lattner | 2007-02-05 | 1 | -1/+1 |
| * | switch an std::set over to SmallPtrSet, speeding up mem2reg 3.4% on 176.gcc. | Chris Lattner | 2007-02-05 | 1 | -16/+13 |
| * | eliminate some malloc traffic, this speeds up mem2reg by 3.4%. | Chris Lattner | 2007-02-05 | 1 | -5/+8 |
| * | s|llvm/Support/Visibility.h|llvm/Support/Compiler.h| | Chris Lattner | 2006-08-27 | 1 | -1/+1 |
| * | Use hidden visibility to make symbols in an anonymous namespace get | Chris Lattner | 2006-06-28 | 1 | -1/+2 |
| * | Fix some nondeterminstic behavior in the mem2reg pass that (in addition to | Chris Lattner | 2006-04-27 | 1 | -20/+38 |
| * | Implement a refinement to the mem2reg algorithm for cases where an alloca | Chris Lattner | 2005-11-18 | 1 | -0/+55 |
