| Commit message (Expand) | Author | Age | Files | Lines |
| * | 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 |
| * | Fix batch of converting RegisterPass<> to INTIALIZE_PASS(). | Owen Anderson | 2010-07-21 | 1 | -2/+2 |
| * | Add a fast path for x - x. | Dan Gohman | 2010-07-20 | 1 | -0/+4 |
| * | Teach ScalarEvolution how to fold trunc(undef) and anyext(undef) to undef. | Dan Gohman | 2010-07-15 | 1 | -0/+14 |
| * | In ScalarEvolution::forgetValue, eliminate any SCEVUnknown | Dan Gohman | 2010-06-30 | 1 | -0/+20 |
| * | Revert the part of r107257 which introduced new logic for using | Dan Gohman | 2010-06-30 | 1 | -82/+11 |
| * | Improve ScalarEvolution's nsw and nuw preservation. | Dan Gohman | 2010-06-30 | 1 | -31/+105 |
| * | When computing a new ConservativeResult, intersect it with | Dan Gohman | 2010-06-30 | 1 | -1/+2 |
| * | Fix ScalarEvolution's tripcount computation for chains of loops | Dan Gohman | 2010-06-29 | 1 | -41/+61 |
| * | Just as its not safe to blindly transfer the nsw bit from an add | Dan Gohman | 2010-06-29 | 1 | -5/+9 |
| * | Eliminate a redundant FoldingSet lookup. | Dan Gohman | 2010-06-25 | 1 | -3/+3 |
| * | Don't try to preserve pointer types in SCEVConstants; the old code | Dan Gohman | 2010-06-24 | 1 | -12/+8 |
| * | Make the trunc code consistent with the zext and sext code in its | Dan Gohman | 2010-06-24 | 1 | -1/+2 |
| * | Replace ScalarEvolution's private copy of getLoopPredecessor | Dan Gohman | 2010-06-22 | 1 | -19/+2 |
| * | Allow "exhaustive" trip count evaluation on phi nodes with all | Dan Gohman | 2010-06-22 | 1 | -9/+7 |
| * | Use A.append(...) instead of A.insert(A.end(), ...) when A is a | Dan Gohman | 2010-06-21 | 1 | -7/+6 |
| * | Fix ScalarEvolution's "exhaustive" trip count evaluation code to avoid | Dan Gohman | 2010-06-19 | 1 | -2/+5 |
| * | Revert r106304 (105548 and friends), which are the SCEVComplexityCompare | Dan Gohman | 2010-06-18 | 1 | -38/+138 |
| * | Reapply 105540, 105542, and 105548, and revert r105732. | Dan Gohman | 2010-06-18 | 1 | -138/+38 |
| * | Reapply 105546. | Dan Gohman | 2010-06-18 | 1 | -7/+13 |
| * | Reapply 105544. | Dan Gohman | 2010-06-18 | 1 | -2/+2 |
| * | Remove getIntegerSCEV; it's redundant with getConstant, and getConstant | Dan Gohman | 2010-06-18 | 1 | -7/+0 |
| * | Simplify this code. | Dan Gohman | 2010-06-17 | 1 | -11/+3 |
| * | Revert 105540, 105542, 105544, 105546, and 105548 to unbreak bootstrapping. | Evan Cheng | 2010-06-09 | 1 | -53/+147 |
| * | The FoldingSet hash data includes pointer values, so it isn't | Dan Gohman | 2010-06-07 | 1 | -21/+28 |
| * | Optimize this code somewhat by taking advantage of the fact | Dan Gohman | 2010-06-07 | 1 | -7/+13 |
| * | Micro-optimize this, to speed up this hotspot in debug builds a little. | Dan Gohman | 2010-06-07 | 1 | -2/+2 |
| * | Micro-optimize this. | Dan Gohman | 2010-06-07 | 1 | -2/+4 |
| * | Optimize ScalarEvolution's SCEVComplexityCompare predicate: don't go | Dan Gohman | 2010-06-07 | 1 | -123/+14 |
| * | ConstantFoldConstantExpression can theoretically return null. | Dan Gohman | 2010-05-28 | 1 | -4/+8 |
| * | Use the SCEVAddRecExpr::getPostIncExpr utility function instead | Dan Gohman | 2010-05-04 | 1 | -4/+2 |
| * | Fix a copy+pasto. | Dan Gohman | 2010-05-04 | 1 | -2/+2 |
| * | Use getConstant instead of getIntegerSCEV. The two are basically the | Dan Gohman | 2010-05-03 | 1 | -13/+13 |
| * | Silence warnings about -1 being converted to an unsigned value. | Dan Gohman | 2010-05-03 | 1 | -6/+6 |
| * | Use isTrueWhenEqual and isFalseWhenEqual instead of assuming that | Dan Gohman | 2010-05-03 | 1 | -2/+2 |
| * | In ScalarEvolution::print, don't bother printing out the SCEVs for | Dan Gohman | 2010-05-03 | 1 | -1/+1 |