| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Finegrainify namespacification | Chris Lattner | 2003-12-02 | 1 | -6/+3 |
| | | | | | | | Fix regressions ScalarRepl/basictest.ll & arraytest.ll llvm-svn: 10287 | ||||
| * | Do not use index type to determine what it is indexing into! | Chris Lattner | 2003-11-25 | 1 | -26/+26 |
| | | | | | llvm-svn: 10226 | ||||
| * | Put all LLVM code into the llvm namespace, as per bug 109. | Brian Gaeke | 2003-11-11 | 1 | -0/+5 |
| | | | | | llvm-svn: 9903 | ||||
| * | Fix PR66 & ScalarRepl/2003-10-29-ArrayProblem.ll | Chris Lattner | 2003-10-29 | 1 | -62/+25 |
| | | | | | llvm-svn: 9585 | ||||
| * | Added LLVM project notice to the top of every C++ source file. | John Criswell | 2003-10-20 | 1 | -0/+7 |
| | | | | | | | Header files will be on the way. llvm-svn: 9298 | ||||
| * | Change the interface to PromoteMemToReg to also take a DominatorTree | Chris Lattner | 2003-10-05 | 1 | -1/+4 |
| | | | | | llvm-svn: 8883 | ||||
| * | Rename Function::getEntryNode -> getEntryBlock | Chris Lattner | 2003-09-20 | 1 | -2/+2 |
| | | | | | llvm-svn: 8625 | ||||
| * | Do not return success after checking only the FIRST USE of a gep instruction. | Chris Lattner | 2003-09-12 | 1 | -3/+7 |
| | | | | | | | | | Instead, check all uses. This fixes bug: ScalarRepl/2003-09-12-IncorrectPromote.ll This also fixes the miscompilation of Ptrdist/bc llvm-svn: 8493 | ||||
| * | Minor optimization efficiency improvement: | Chris Lattner | 2003-09-12 | 1 | -7/+9 |
| | | | | | | | | - Run mem2reg promotion first - Only rerun passes if the previous thing changed something llvm-svn: 8490 | ||||
| * | Apostrophes are only used for possession and quoting. | Misha Brukman | 2003-09-11 | 1 | -2/+2 |
| | | | | | llvm-svn: 8473 | ||||
| * | Integrate functionality of the mem2reg pass directly into this pass to make | Chris Lattner | 2003-09-11 | 1 | -7/+62 |
| | | | | | | | the combination more effective llvm-svn: 8471 | ||||
| * | ScalarRepl does not modify the CFG. Say so! | Chris Lattner | 2003-08-31 | 1 | -0/+6 |
| | | | | | llvm-svn: 8243 | ||||
| * | DEBUG got moved to Support/Debug.h | Chris Lattner | 2003-08-01 | 1 | -1/+2 |
| | | | | | llvm-svn: 7492 | ||||
| * | Simplify code by using ConstantInt::getRawValue instead of checking to see | Chris Lattner | 2003-07-23 | 1 | -5/+1 |
| | | | | | | | whether the constant is signed or unsigned, then casting llvm-svn: 7252 | ||||
| * | Okay totally give up on trying to optimize aggregates that cannot be completely | Chris Lattner | 2003-05-30 | 1 | -40/+6 |
| | | | | | | | broken up into their elements. Too many programs break because of this. llvm-svn: 6440 | ||||
| * | add a check that allows the SRoA pass to avoid breaking programs, even if their | Chris Lattner | 2003-05-30 | 1 | -1/+33 |
| | | | | | | | behavior is technically undefined llvm-svn: 6438 | ||||
| * | Fix bug: ScalarRepl/2003-05-30-MultiLevel.ll | Chris Lattner | 2003-05-30 | 1 | -4/+4 |
| | | | | | llvm-svn: 6428 | ||||
| * | Fix bug: ScalarRepl/2003-05-29-ArrayFail.ll | Chris Lattner | 2003-05-30 | 1 | -42/+128 |
| | | | | | llvm-svn: 6425 | ||||
| * | * Actually USE the statistic that we made | Chris Lattner | 2003-05-27 | 1 | -6/+21 |
| | | | | | | | * Implement SRoA for arrays llvm-svn: 6349 | ||||
| * | Implementation of the simple "scalar replacement of aggregates" transformation | Chris Lattner | 2003-05-27 | 1 | -0/+164 |
| llvm-svn: 6346 | |||||

