| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | PR5207: Change APInt methods trunc(), sext(), zext(), sextOrTrunc() and | Jay Foad | 2010-12-07 | 1 | -2/+2 |
| * | PR5207: Rename overloaded APInt methods set(), clear(), flip() to | Jay Foad | 2010-12-01 | 1 | -1/+1 |
| * | Simplify code. No change in functionality. | Benjamin Kramer | 2010-11-20 | 1 | -2/+2 |
| * | Silence warning about an uninitialized variable. | Benjamin Kramer | 2010-11-19 | 1 | -1/+1 |
| * | Factor code for testing whether replacing one value with another | Duncan Sands | 2010-11-18 | 1 | -17/+2 |
| * | Introduce memoization for ScalarEvolution dominates and properlyDominates | Dan Gohman | 2010-11-18 | 1 | -58/+56 |
| * | Factor out the code for purging a SCEV from all the various memoization maps. | Dan Gohman | 2010-11-17 | 1 | -26/+13 |
| * | Merge the implementations of isLoopInvariant and hasComputableLoopEvolution, and | Dan Gohman | 2010-11-17 | 1 | -71/+58 |
| * | Make SCEV::getType() and SCEV::print non-virtual. Move SCEV::hasOperand | Dan Gohman | 2010-11-17 | 1 | -105/+167 |
| * | Move SCEV::dominates and properlyDominates to ScalarEvolution. | Dan Gohman | 2010-11-17 | 1 | -58/+91 |
| * | Move SCEV::isLoopInvariant and hasComputableLoopEvolution to be member | Dan Gohman | 2010-11-17 | 1 | -81/+135 |
| * | Before replacing a phi node with a different value, it | Duncan Sands | 2010-11-17 | 1 | -11/+15 |
| * | Verify SCEVAddRecExpr's invariant in ScalarEvolution::getAddRecExpr | Dan Gohman | 2010-11-17 | 1 | -0/+3 |
| * | Fix ScalarEvolution's range memoization to avoid using a | Dan Gohman | 2010-11-17 | 1 | -44/+43 |
| * | Have ScalarEvolution use SimplifyInstruction rather than hasConstantValue. | Duncan Sands | 2010-11-17 | 1 | -1/+5 |
| * | Memoize results from ScalarEvolution's getUnsignedRange and getSignedRange. | Dan Gohman | 2010-11-17 | 1 | -43/+80 |
| * | Make ScalarEvolution::forgetLoop forget all contained loops too, because | Dan Gohman | 2010-10-29 | 1 | -0/+5 |
| * | Get rid of static constructors for pass registration. Instead, every pass ex... | Owen Anderson | 2010-10-19 | 1 | -0/+1 |
| * | Begin adding static dependence information to passes, which will allow us to | Owen Anderson | 2010-10-12 | 1 | -1/+5 |
| * | Now with fewer extraneous semicolons! | Owen Anderson | 2010-10-07 | 1 | -1/+1 |
| * | Don't add the operand count to SCEV uniquing data; FoldingSetNodeID | Dan Gohman | 2010-10-04 | 1 | -5/+0 |
| * | Reapply r112432, now that the real problem is addressed. | Dan Gohman | 2010-08-31 | 1 | -4/+9 |
| * | Reapply r112433, now that the real problem is addressed. | Dan Gohman | 2010-08-31 | 1 | -21/+24 |
| * | Revert r110916. This patch is buggy because the code inside the | Dan Gohman | 2010-08-31 | 1 | -7/+4 |
| * | Revert r112432. It appears to be exposing a problem in the emacs build. | Dan Gohman | 2010-08-31 | 1 | -9/+4 |
| * | Speculatively revert r112433. | Dan Gohman | 2010-08-31 | 1 | -24/+21 |
| * | Restructure the {A,+,B}<L> * {C,+,D}<L> folding so that it folds | Dan Gohman | 2010-08-29 | 1 | -21/+24 |
| * | Batch up subtracts along with adds, when analyzing long chains of | Dan Gohman | 2010-08-29 | 1 | -4/+9 |
| * | Micro-optimize GroupByComplexity. | Dan Gohman | 2010-08-29 | 1 | -2/+3 |
| * | Hold AddRec->getLoop() in a variable, to make the Mul code more consistent | Dan Gohman | 2010-08-29 | 1 | -3/+4 |
| * | Rename a variable, for consistency. | Dan Gohman | 2010-08-29 | 1 | -5/+8 |
| * | Use iterators instead of indices. | Dan Gohman | 2010-08-29 | 1 | -2/+2 |
| * | Fix an index calculation thinko. | Dan Gohman | 2010-08-28 | 1 | -1/+1 |
| * | When merging adjacent operands, scan ahead and merge all equal | Dan Gohman | 2010-08-27 | 1 | -11/+14 |
| * | Make the {A,+,B}<L> + {C,+,D}<L> --> Other + {A+C,+,B+D}<L> | Dan Gohman | 2010-08-27 | 1 | -23/+21 |
| * | Switch ScalarEvolution's main Value*->SCEV* map from std::map | Dan Gohman | 2010-08-27 | 1 | -28/+26 |
| * | Optimize SCEVComplexityCompare. Use a 3-way return instead of a 2-way | Dan Gohman | 2010-08-27 | 1 | -48/+82 |
| * | To create a copy of a SmallVector with an element removed from the | Dan Gohman | 2010-08-16 | 1 | -6/+7 |
| * | Tidy whitespace. | Dan Gohman | 2010-08-16 | 1 | -5/+4 |
| * | Add a comment. | Dan Gohman | 2010-08-16 | 1 | -0/+5 |
| * | Use const_iterator in a few places. | Dan Gohman | 2010-08-16 | 1 | -3/+3 |
| * | Use iterators instead of indices in a few more places. | Dan Gohman | 2010-08-16 | 1 | -6/+9 |
| * | Micro-optimize SCEVConstant comparison. | Dan Gohman | 2010-08-16 | 1 | -4/+4 |
| * | Move SCEVNAryExpr's virtual member functions out of line, and convert | Dan Gohman | 2010-08-16 | 1 | -0/+33 |
| * | Use iterators instead of indices in simple cases. | Dan Gohman | 2010-08-16 | 1 | -6/+4 |
| * | Avoid gratuitous inefficiency in ifndef NDEBUG code. | Dan Gohman | 2010-08-16 | 1 | -8/+8 |
| * | Make one getAddExpr call when analyzing a+b+c+d+e+... instead of one | Dan Gohman | 2010-08-16 | 1 | -6/+31 |
| * | Delete an unused function. | Dan Gohman | 2010-08-16 | 1 | -35/+0 |
| * | Various optimizations. Don't compare two loops' depths | Dan Gohman | 2010-08-13 | 1 | -18/+26 |
| * | When testing whether one loop contains another, test this directly | Dan Gohman | 2010-08-13 | 1 | -2/+2 |
