| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| ... | |
| * | 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 |
| * | In SimplifyICmpOperands, avoid needlessly swapping the operands in the | Dan Gohman | 2010-05-03 | 1 | -3/+6 |
| * | Factor out the new <= and >= analysis code into SimplifyICmpOperands. | Dan Gohman | 2010-05-03 | 1 | -51/+62 |
| * | Set isSigned to true when creating an all-ones integer constant, even | Dan Gohman | 2010-04-30 | 1 | -4/+4 |
| * | Silence compiler warnings. | Dan Gohman | 2010-04-30 | 1 | -4/+4 |
| * | ScalarEvolution support for <= and >= loops. | Dan Gohman | 2010-04-24 | 1 | -20/+107 |
| * | Use SimplifyICmpOperands in isKnownPredicate too. | Dan Gohman | 2010-04-24 | 1 | -0/+3 |
| * | Update isImpliedCond to use the new SimplifyICmpOperands utility. | Dan Gohman | 2010-04-24 | 1 | -111/+6 |
| * | Add a new utility function SimplifyICmpOperands. Much of this code is | Dan Gohman | 2010-04-24 | 1 | -0/+198 |
| * | When it doesn't matter whether zero or sign extension is used, | Dan Gohman | 2010-04-23 | 1 | -6/+2 |
| * | Don't attempt to analyze values which are obviously undef. This fixes some | Dan Gohman | 2010-04-22 | 1 | -75/+102 |
| * | Make ScalarEvolution::getConstant support pointer types, for consistency | Dan Gohman | 2010-04-21 | 1 | -2/+2 |
| * | Fix SCEVCommutativeExpr::print to be robust in the case of improper | Dan Gohman | 2010-04-16 | 1 | -4/+6 |
| * | Make getPredecessorWithUniqueSuccessorForBB return the unique successor | Dan Gohman | 2010-04-15 | 1 | -12/+10 |
| * | Add a comment. | Dan Gohman | 2010-04-14 | 1 | -0/+2 |
| * | Teach ScalarEvolution to simplify smax and umax when it can prove | Dan Gohman | 2010-04-13 | 1 | -2/+14 |
| * | Minor code micro-optimizations. | Dan Gohman | 2010-04-13 | 1 | -7/+7 |
| * | Micro-optimize a few hot spots. | Dan Gohman | 2010-04-12 | 1 | -10/+11 |
| * | Add fast paths to ScalarEvolution::getSizeOf and getOffsetOf, as | Dan Gohman | 2010-04-12 | 1 | -0/+14 |
| * | Generalize ScalarEvolution's PHI analysis to handle loops that don't | Dan Gohman | 2010-04-12 | 1 | -14/+26 |
| * | Rewrite the overflow checking in the get{Signed,Unsigned}Range code for | Dan Gohman | 2010-04-12 | 1 | -10/+34 |
| * | Fix indentation. | Dan Gohman | 2010-04-11 | 1 | -1/+1 |
| * | Enhance ScalarEvolution::isKnownPredicate with support for | Dan Gohman | 2010-04-11 | 1 | -8/+33 |
| * | Minor code simplification. | Dan Gohman | 2010-04-11 | 1 | -2/+1 |
