| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Finegrainify namespacification | Chris Lattner | 2004-01-09 | 14 | -80/+37 |
| | | | | | llvm-svn: 10725 | ||||
| * | Improve encapsulation in the Loop and LoopInfo classes by eliminating the | Chris Lattner | 2004-01-08 | 3 | -26/+24 |
| | | | | | | | | getSubLoops/getTopLevelLoops methods, replacing them with iterator-based accessors. llvm-svn: 10714 | ||||
| * | More minor non-functional changes. This now computes the exit condition, though | Chris Lattner | 2003-12-23 | 1 | -15/+52 |
| | | | | | | | it doesn't do anything with it. llvm-svn: 10590 | ||||
| * | Don't mind me, I'm just refactoring away. This patch makes room for LFTR, but | Chris Lattner | 2003-12-22 | 1 | -90/+130 |
| | | | | | | | contains no functionality changes. llvm-svn: 10583 | ||||
| * | Implement IndVarsSimplify/pointer-indvars.ll, transforming pointer | Chris Lattner | 2003-12-22 | 1 | -9/+19 |
| | | | | | | | arithmetic into "array subscripts" llvm-svn: 10580 | ||||
| * | Fix PR194 | Chris Lattner | 2003-12-22 | 1 | -56/+85 |
| | | | | | llvm-svn: 10573 | ||||
| * | Fix ADCE/2003-12-19-MergeReturn.llx | Chris Lattner | 2003-12-19 | 1 | -7/+8 |
| | | | | | llvm-svn: 10539 | ||||
| * | Remove the wierd "Operands" loop, by traversing basicblocks in reverse order | Chris Lattner | 2003-12-19 | 1 | -14/+14 |
| | | | | | llvm-svn: 10536 | ||||
| * | Implement LICM/sink_multiple.ll, by sinking all possible instructions in the | Chris Lattner | 2003-12-19 | 1 | -20/+55 |
| | | | | | | | loop before hoisting any. llvm-svn: 10534 | ||||
| * | Generalize a special case to fix PR187 | Chris Lattner | 2003-12-19 | 1 | -18/+28 |
| | | | | | llvm-svn: 10531 | ||||
| * | Factor code out into the Utils library | Chris Lattner | 2003-12-19 | 1 | -23/+3 |
| | | | | | llvm-svn: 10530 | ||||
| * | Reverted back to previous revision - this was previously merged | John Criswell | 2003-12-18 | 1 | -8/+15 |
| | | | | | | | according to the CVS log messages. llvm-svn: 10517 | ||||
| * | Merged in RELEASE_11. | John Criswell | 2003-12-18 | 1 | -15/+8 |
| | | | | | llvm-svn: 10516 | ||||
| * | When we delete instructions from the loop, make sure to remove them from the | Chris Lattner | 2003-12-18 | 1 | -0/+2 |
| | | | | | | | AliasSetTracker as well. llvm-svn: 10507 | ||||
| * | Fix for PR185 & IndVarsSimplify/2003-12-15-Crash.llx | Chris Lattner | 2003-12-15 | 1 | -0/+9 |
| | | | | | llvm-svn: 10473 | ||||
| * | Refactor code just a little bit, allowing us to implement ↵ | Chris Lattner | 2003-12-14 | 1 | -51/+68 |
| | | | | | | | TailCallElim/return_constant.ll llvm-svn: 10467 | ||||
| * | Do not promote volatile alias sets into registers | Chris Lattner | 2003-12-14 | 1 | -1/+1 |
| | | | | | llvm-svn: 10458 | ||||
| * | Fix LICM/2003-12-11-SinkingToPHI.ll, and quite possibly all of the other ↵ | Chris Lattner | 2003-12-11 | 1 | -2/+11 |
| | | | | | | | known problems in the universe. llvm-svn: 10409 | ||||
| * | Fix bug: LICM/sink_multiple_exits.ll | Chris Lattner | 2003-12-10 | 1 | -1/+1 |
| | | | | | | | Thanks for pointing this out John :) llvm-svn: 10387 | ||||
| * | Don't allow dead instructions to stop sinking early. | Chris Lattner | 2003-12-10 | 1 | -10/+9 |
| | | | | | llvm-svn: 10386 | ||||
| * | Fix bug: IndVarsSimplify/2003-12-10-RemoveInstrCrash.llx | Chris Lattner | 2003-12-10 | 1 | -0/+5 |
| | | | | | llvm-svn: 10385 | ||||
| * | Finegrainify namespacification | Chris Lattner | 2003-12-10 | 1 | -11/+11 |
| | | | | | | | Fix bug: LowerInvoke/2003-12-10-Crash.llx llvm-svn: 10382 | ||||
| * | Finegrainify namespacification | Chris Lattner | 2003-12-10 | 1 | -8/+27 |
| | | | | | | | | Reorder #includes Implement: IndVarsSimplify/2003-12-10-IndVarDeadCode.ll llvm-svn: 10376 | ||||
| * | Finegrainify namespacification | Chris Lattner | 2003-12-10 | 1 | -22/+21 |
| | | | | | | | Fix bug: LoopSimplify/2003-12-10-ExitBlocksProblem.ll llvm-svn: 10373 | ||||
| * | Simplify code | Chris Lattner | 2003-12-10 | 1 | -6/+1 |
| | | | | | llvm-svn: 10371 | ||||
| * | Avoid performing two identical lookups when one will suffice | Chris Lattner | 2003-12-10 | 1 | -3/+1 |
| | | | | | llvm-svn: 10370 | ||||
| * | Make LICM itself a bit more efficient, and make the generated code more ↵ | Chris Lattner | 2003-12-10 | 1 | -21/+26 |
| | | | | | | | efficient too: don't insert a store in every exit block, because a particular block may be exited to more than once by a loop llvm-svn: 10369 | ||||
| * | Implement instruction sinking out of loops. This still can do a little bit | Chris Lattner | 2003-12-10 | 1 | -61/+246 |
| | | | | | | | | better job, but this is the majority of the work. This implements LICM/sink*.ll llvm-svn: 10358 | ||||
| * | Do not insert one entry PHI nodes in split exit blocks! | Chris Lattner | 2003-12-09 | 1 | -13/+23 |
| | | | | | llvm-svn: 10348 | ||||
| * | Refactor code a little bit, eliminating the gratuitous InstVisitor, which | Chris Lattner | 2003-12-09 | 1 | -41/+43 |
| | | | | | | | | should make subsequent changes simpler. This also allows us to hoist vaarg and vanext instructions llvm-svn: 10342 | ||||
| * | Fine grainify namespacification | Chris Lattner | 2003-12-09 | 1 | -36/+48 |
| | | | | | | | | Code cleanups Make LICM::SafeToHoist marginally more efficient llvm-svn: 10341 | ||||
| * | Implement: TailCallElim/accum_recursion_constant_arg.ll | Chris Lattner | 2003-12-08 | 1 | -6/+60 |
| | | | | | | | Also make sure to clean up any PHI nodes that are inserted which are pointless. llvm-svn: 10333 | ||||
| * | Implement: test/Regression/Transforms/TailCallElim/accum_recursion.ll | Chris Lattner | 2003-12-08 | 1 | -12/+122 |
| | | | | | | | | | We now insert accumulator variables as necessary to eliminate tail recursion more aggressively. This is still fairly limited, but allows us to transform fib/factorial, and other functions into nice happy loops. :) llvm-svn: 10332 | ||||
| * | Cleanup and restructure the code to make it easier to read and maintain. | Chris Lattner | 2003-12-08 | 1 | -53/+126 |
| | | | | | | | | | | | | | | | The only functionality change is that we now implement: Regression/Transforms/TailCallElim/intervening-inst.ll Which is really kinda pointless, because it means that trivially dead code does not interfere with -tce, but trivially dead code probably wouldn't be around anytime when this pass is run anyway. The point of including this change it to support other more aggressive transformations when we have the analysis capabilities to do so. llvm-svn: 10312 | ||||
| * | * Finegrainify namespacification | Chris Lattner | 2003-12-07 | 1 | -4/+17 |
| | | | | | | | * Transform: free <ty>* (cast <ty2>* X to <ty>*) into free <ty2>* X llvm-svn: 10303 | ||||
| * | 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 | ||||
| * | Do not crash when deleing a region with a dead invoke instruction | Chris Lattner | 2003-11-22 | 1 | -0/+4 |
| | | | | | llvm-svn: 10161 | ||||
| * | Finegrainify namespacification | Chris Lattner | 2003-11-22 | 1 | -14/+16 |
| | | | | | | | The module stripping pass should not strip symbols on external globals llvm-svn: 10157 | ||||
| * | Minor cleanups and simplifications | Chris Lattner | 2003-11-21 | 4 | -7/+7 |
| | | | | | llvm-svn: 10127 | ||||
| * | Start using the nicer terminator auto-insertion API | Chris Lattner | 2003-11-20 | 4 | -19/+15 |
| | | | | | llvm-svn: 10111 | ||||
| * | Fix PR116 | Chris Lattner | 2003-11-16 | 1 | -0/+12 |
| | | | | | llvm-svn: 10032 | ||||
| * | Implement feature: InstCombine/2003-11-13-ConstExprCastCall.ll | Chris Lattner | 2003-11-13 | 1 | -1/+2 |
| | | | | | llvm-svn: 9981 | ||||
| * | Put all LLVM code into the llvm namespace, as per bug 109. | Brian Gaeke | 2003-11-11 | 23 | -12/+103 |
| | | | | | llvm-svn: 9903 | ||||
| * | Adjust to new critical edge interface | Chris Lattner | 2003-11-10 | 1 | -6/+4 |
| | | | | | llvm-svn: 9853 | ||||
| * | Declare FunctionPasses as such so that they can be used in FunctionPassManager. | Misha Brukman | 2003-11-07 | 3 | -3/+3 |
| | | | | | llvm-svn: 9768 | ||||
| * | Fix flawed logic that was breaking several SPEC benchmarks, including gzip ↵ | Chris Lattner | 2003-11-05 | 1 | -3/+3 |
| | | | | | | | and crafty. llvm-svn: 9731 | ||||
| * | Fix bug with previous implementation: | Chris Lattner | 2003-11-05 | 1 | -4/+11 |
| | | | | | | | | | - // ~(c-X) == X-(c-1) == X+(-c+1) + // ~(c-X) == X-c-1 == X+(-c-1) Implement: C - ~X == X + (1+C) llvm-svn: 9715 | ||||
| * | Minor cleanup, plus implement InstCombine/xor.ll:test17 | Chris Lattner | 2003-11-04 | 1 | -3/+17 |
| | | | | | llvm-svn: 9711 | ||||
| * | Implement InstCombine/xor.ll:test(15|16) | Chris Lattner | 2003-11-04 | 1 | -1/+8 |
| | | | | | llvm-svn: 9708 | ||||

