| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | 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 |
| * | Add a const. | Dan Gohman | 2010-08-13 | 1 | -1/+1 |
| * | When creating a symmetric SCEV with a constant operand, put | Dan Gohman | 2010-08-13 | 1 | -4/+4 |
| * | An add recurrence is loop-invariant in any loop inside of its | Dan Gohman | 2010-08-13 | 1 | -0/+4 |
| * | Optimize ScalarEvolution::getAddExpr's operand factoring code by | Dan Gohman | 2010-08-12 | 1 | -4/+7 |
| * | Hoist some loop-invariant code out of a hot loop. | Dan Gohman | 2010-08-12 | 1 | -2/+4 |
| * | Optimize ScalarEvolution::getAddExpr's duplicate operand detection | Dan Gohman | 2010-08-12 | 1 | -3/+7 |
| * | When analyzing loop exit conditions combined with and and or, don't | Dan Gohman | 2010-08-11 | 1 | -14/+12 |
| * | Rename and reorder the arguments to isImpliedCond, for consistency and clarity. | Dan Gohman | 2010-08-10 | 1 | -10/+12 |
| * | Reapply r110396, with fixes to appease the Linux buildbot gods. | Owen Anderson | 2010-08-06 | 1 | -1/+1 |
| * | Revert r110396 to fix buildbots. | Owen Anderson | 2010-08-06 | 1 | -1/+1 |
| * | Don't use PassInfo* as a type identifier for passes. Instead, use the addres... | Owen Anderson | 2010-08-05 | 1 | -1/+1 |
| * | Fix a minor bug which resulted in intermediate calculations | Dan Gohman | 2010-08-04 | 1 | -1/+1 |
| * | Make SCEVUnknown a CallbackVH, so that it can be notified directly | Dan Gohman | 2010-08-02 | 1 | -47/+46 |
| * | Prefix `next' iterator operation with `llvm::'. | Oscar Fuentes | 2010-08-02 | 1 | -2/+2 |
| * | Speculatively revert r109705 since it seems to be causing some build bot | Eric Christopher | 2010-07-29 | 1 | -45/+29 |
| * | Factor out some of the code for updating old SCEVUnknown values, and | Dan Gohman | 2010-07-29 | 1 | -29/+45 |
| * | Make SCEVCallbackVH::allUsesReplacedWith update the old SCEVUnknown | Dan Gohman | 2010-07-28 | 1 | -22/+39 |
| * | Make SCEVCallbackVH::allUsesReplacedWith unconditionally delete | Dan Gohman | 2010-07-28 | 1 | -12/+6 |
| * | Micro-optimize SCEVComplexityCompare. | Dan Gohman | 2010-07-23 | 1 | -34/+44 |
| * | Add a const qualifier. | Dan Gohman | 2010-07-23 | 1 | -2/+2 |
| * | mass elimination of reliance on automatic iterator dereferencing | Gabor Greif | 2010-07-22 | 1 | -1/+1 |
