| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Don't unroll loops whose header block's address is taken. | Chris Lattner | 2011-02-18 | 1 | -2/+10 |
| | | | | | | | | | | | | | | | | | | This is part of a futile attempt to not "break" bizzaro code like this: l1: printf("l1: %p\n", &&l1); ++x; if( x < 3 ) goto l1; Previously we'd fold &&l1 to 1, which is fine per our semantics but not helpful to the user. llvm-svn: 125827 | ||||
| * | random cleanups | Chris Lattner | 2011-01-11 | 1 | -2/+2 |
| | | | | | llvm-svn: 123221 | ||||
| * | Remove all uses of the "ugly" method BranchInst::setUnconditionalDest(). | Jay Foad | 2011-01-07 | 1 | -1/+3 |
| | | | | | llvm-svn: 123025 | ||||
| * | Replace calls to ConstantFoldInstruction with calls to SimplifyInstruction | Duncan Sands | 2010-11-23 | 1 | -5/+6 |
| | | | | | | | | in two places that are really interested in simplified instructions, not constants. llvm-svn: 120044 | ||||
| * | Be more consistent in using ValueToValueMapTy. | Rafael Espindola | 2010-10-13 | 1 | -4/+3 |
| | | | | | llvm-svn: 116387 | ||||
| * | Preserve ScalarEvolution in the loop unroller. | Dan Gohman | 2010-07-26 | 1 | -0/+6 |
| | | | | | llvm-svn: 109412 | ||||
| * | Use ValueMap instead of DenseMap. | Devang Patel | 2010-06-24 | 1 | -3/+3 |
| | | | | | | | The ValueMapper used by various cloning utility maps MDNodes also. llvm-svn: 106706 | ||||
| * | Cosmetic change. | Devang Patel | 2010-06-23 | 1 | -9/+9 |
| | | | | | | | Do not use "ValueMap" as a name for a local variable or an argument. llvm-svn: 106698 | ||||
| * | Rename ValueMapTy as ValueToValueMapTy to clearly indicate that this has no ↵ | Devang Patel | 2010-04-20 | 1 | -4/+4 |
| | | | | | | | replationship with ADT/ValueMap. llvm-svn: 101950 | ||||
| * | Add a DominatorTree argument to isLCSSA so that it doesn't have to | Dan Gohman | 2010-03-10 | 1 | -6/+0 |
| | | | | | | | | compute a set of reachable blocks for itself each time it is called, which is fairly frequently. llvm-svn: 98179 | ||||
| * | Don't bother with sprintf, just pass the Twine through. | Benjamin Kramer | 2010-01-27 | 1 | -5/+1 |
| | | | | | llvm-svn: 94684 | ||||
| * | Change errs() to dbgs(). | David Greene | 2010-01-05 | 1 | -11/+11 |
| | | | | | llvm-svn: 92600 | ||||
| * | Add Loop contains utility methods for testing whether a loop | Dan Gohman | 2009-12-18 | 1 | -4/+4 |
| | | | | | | | | | contains another loop, or an instruction. The loop form is substantially more efficient on large loops than the typical code it replaces. llvm-svn: 91654 | ||||
| * | remove a bunch of extraneous LLVMContext arguments | Chris Lattner | 2009-11-06 | 1 | -2/+1 |
| | | | | | | | from various APIs, addressing PR5325. llvm-svn: 86231 | ||||
| * | Teach LoopUnroll how to bail if LoopSimplify can't give it what it needs. | Dan Gohman | 2009-11-05 | 1 | -1/+12 |
| | | | | | llvm-svn: 86164 | ||||
| * | Revert r85667. LoopUnroll currently can't call utility functions which | Dan Gohman | 2009-10-31 | 1 | -1/+47 |
| | | | | | | | | auto-update the DominatorTree because it doesn't keep the DominatorTree current while it works. llvm-svn: 85670 | ||||
| * | Merge the enhancements from LoopUnroll's FoldBlockIntoPredecessor into | Dan Gohman | 2009-10-31 | 1 | -47/+1 |
| | | | | | | | | MergeBlockIntoPredecessor. This makes SimplifyCFG slightly more aggressive, and makes it unnecessary for LoopUnroll to have its own copy of this code. llvm-svn: 85667 | ||||
| * | Simplify this code. | Dan Gohman | 2009-10-31 | 1 | -2/+2 |
| | | | | | llvm-svn: 85662 | ||||
| * | Rename UnrollLoop.cpp to LoopUnroll.cpp, and LoopUnroll.cpp to | Dan Gohman | 2009-10-31 | 1 | -0/+372 |
| LoopUnrollPass.cpp, for consistency with other passes which are similarly split. llvm-svn: 85659 | |||||
 |
index : bcm5719-llvm | |
| Project Ortega BCM5719 LLVM | Raptor Computing Systems |
| summaryrefslogtreecommitdiffstats |
|