aboutsummaryrefslogtreecommitdiff
path: root/lib/Transforms/Utils
AgeCommit message (Expand)Author
2007-08-21Use SmallVector instead of std::vector.Devang Patel
2007-08-17When one branch of condition is eliminated then head of the otherDevang Patel
2007-08-14Break infinite loop.Devang Patel
2007-08-13If NewBB dominates DestBB then DestBB is not part of NewBB's dominance frontier.Devang Patel
2007-08-10Add utility to clone loops.Devang Patel
2007-08-06remove some dead linesChris Lattner
2007-08-04rewrite the code used to construct pruned SSA form with the IDF method.Chris Lattner
2007-08-04Factor out a whole bunch of code into it's own method.Chris Lattner
2007-08-04Use getNumPreds(BB) instead of computing them manually. This is a very small butChris Lattner
2007-08-04Change the rename pass to be "tail recursive", only adding N-1 successorsChris Lattner
2007-08-04cache computation of #preds for a BB. This speeds upChris Lattner
2007-08-04reserve operand space for phi nodes when we insert them.Chris Lattner
2007-08-04use continue to avoid nesting, no functionality change.Chris Lattner
2007-08-04Promoting allocas with the 'single store' fastpath is Chris Lattner
2007-08-04When PromoteLocallyUsedAllocas promoted allocas, it didn't rememberChris Lattner
2007-08-04std::map -> DenseMapChris Lattner
2007-08-04fix a logic bug where we wouldn't promote single store allocas if the Chris Lattner
2007-08-04When we do the single-store optimization, delete both the storeChris Lattner
2007-08-04Three improvements:Chris Lattner
2007-08-04switch from using a std::set to using a SmallPtrSet. This speeds up theChris Lattner
2007-08-04In mem2reg, when handling the single-store case, make sure to removeChris Lattner
2007-08-04split rewriting of single-store allocas into its ownChris Lattner
2007-08-04refactor some code to shrink PromoteMem2Reg::run a bitChris Lattner
2007-08-04add a typedef, no other change.Chris Lattner
2007-08-04avoid an unneeded vector copy. This speeds up mem2reg on the testcase Chris Lattner
2007-08-04make RenamePassWorkList a local var instead of an ivar.Chris Lattner
2007-08-01More explicit keywords.Dan Gohman
2007-08-01New CallInst interface to address GLIBCXX_DEBUG errors caused byDavid Greene
2007-07-30LCSSA preserves dom info.Devang Patel
2007-07-27Use SmallPtrSet.Devang Patel
2007-07-26Move the GET_SIDE_EFFECT_INFO logic from isInstructionTriviallyDeadDan Gohman
2007-07-25Add BasicInliner interface. Devang Patel
2007-07-19Verify loop info.Devang Patel
2007-07-19After a basic block is split into two parts,Devang Patel
2007-07-19Now this temp. fix is not required.Devang Patel
2007-07-16Return Undef if the block has no dominator. This was required to allowReid Spencer
2007-07-16Fix comments about vectors to use the current wording.Dan Gohman
2007-07-13Make LCSSA a loop pass.Devang Patel
2007-07-11Adding ability to demote phi to stack. Tanya Lattner
2007-07-10During module cloning copy aliases too. This fixes PR1544Anton Korobeynikov
2007-07-06Add SplitEdge and SplitBlock utility routines. Devang Patel
2007-06-29Fix reference to iterator invalidated by an erase operation. UncoveredDavid Greene
2007-06-21Move code to update dominator information after basic block is splitDevang Patel
2007-06-11Add and use DominatorTreeBase::findNearestCommonDominator().Devang Patel
2007-06-11Simplify.Devang Patel
2007-06-11simplifyDevang Patel
2007-06-11Simplify. Dominator Tree is required so always available.Devang Patel
2007-06-08Update LoopSimplify to require and preserve DominatorTree only.Devang Patel
2007-06-08Do not preserve ETForest.Devang Patel
2007-06-07Do not use ETForest as well as DomiantorTree. DominatorTree is sufficient.Devang Patel
generated by cgit v1.2.3-18-g5258 (git 2.32.0) at 2025-08-10 15:38:52 +0000