| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Change a few std::maps to DenseMaps. | Dan Gohman | 2011-05-09 | 1 | -2/+2 |
| * | Corrects an old, old typo in a case that doesn't seem to be reached in practice. | Andrew Trick | 2011-04-27 | 1 | -1/+1 |
| * | Test case and comment for PR9633. | Andrew Trick | 2011-04-27 | 1 | -2/+3 |
| * | Fix for PR9633 [indvars] Assertion `isa<X>(Val) && "cast<Ty>() argument of in... | Andrew Trick | 2011-04-27 | 1 | -2/+7 |
| * | Fix an iterator invalidation bug. | Dan Gohman | 2011-04-25 | 1 | -9/+16 |
| * | Fix a ton of comment typos found by codespell. Patch by | Chris Lattner | 2011-04-15 | 1 | -1/+1 |
| * | Added isValidRewrite() to check the result of ScalarEvolutionExpander. | Andrew Trick | 2011-03-17 | 1 | -0/+30 |
| * | Remove getMinusSCEVForExitTest(). | Andrew Trick | 2011-03-15 | 1 | -106/+3 |
| * | Propagate SCEV no-wrap flags whenever possible. | Andrew Trick | 2011-03-15 | 1 | -60/+72 |
| * | Negating a recurrence preserves no-self-wrap. | Andrew Trick | 2011-03-14 | 1 | -0/+11 |
| * | HowFarToZero can compute a trip count as long as the recurrence has no-self-w... | Andrew Trick | 2011-03-14 | 1 | -16/+20 |
| * | Added SCEV::NoWrapFlags to manage unsigned, signed, and self wrap | Andrew Trick | 2011-03-14 | 1 | -126/+187 |
| * | When SCEV can determine the loop test is X < X, set ExactBECount=0. | Andrew Trick | 2011-03-09 | 1 | -1/+17 |
| * | whitespace | Andrew Trick | 2011-03-09 | 1 | -18/+18 |
| * | teach SCEV that the scale and addition of an inbounds gep don't NSW. | Chris Lattner | 2011-02-13 | 1 | -2/+5 |
| * | Per discussion with Dan G, inbounds geps *certainly* can have | Chris Lattner | 2011-02-11 | 1 | -3/+14 |
| * | Fix memory corruption. If one of the SCEV creation functions calls another but | Nick Lewycky | 2011-01-26 | 1 | -0/+2 |
| * | Add a comment. | Dan Gohman | 2011-01-24 | 1 | -0/+1 |
| * | Simplify some code with no functionality change. Make the test a lot more | Nick Lewycky | 2011-01-23 | 1 | -12/+4 |
| * | Use value ranges to fold ext(trunc) in SCEV when possible. | Nick Lewycky | 2011-01-23 | 1 | -0/+34 |
| * | Have SCEV turn sext(x) into zext(x) when x is s>= 0. This applies many times in | Nick Lewycky | 2011-01-22 | 1 | -0/+4 |
| * | Similarly, analyze truncate through multiply. | Nick Lewycky | 2011-01-19 | 1 | -0/+14 |
| * | Add a missed SCEV fold that is required to continue analyzing the IR produced | Nick Lewycky | 2011-01-19 | 1 | -0/+14 |
| * | Add a missing SCEV simplification sext(zext x) --> zext x. | Nick Lewycky | 2011-01-19 | 1 | -0/+4 |
| * | some comment improvements. | Chris Lattner | 2011-01-11 | 1 | -3/+4 |
| * | Temporarily revert 123133, it's causing some regressions and I'm trying | Eric Christopher | 2011-01-11 | 1 | -8/+4 |
| * | the GEP faq says that only inbounds geps are guaranteed to not overflow. | Chris Lattner | 2011-01-11 | 1 | -2/+3 |
| * | add a fixme: ir isn't expressive enough. | Chris Lattner | 2011-01-09 | 1 | -0/+1 |
| * | Step #4 in improving trip count analysis: HowFarToZero can analyze | Chris Lattner | 2011-01-09 | 1 | -2/+11 |
| * | rearrange some code, no functionality change. | Chris Lattner | 2011-01-09 | 1 | -41/+45 |
| * | Step #3 to improving trip count analysis: If we fold | Chris Lattner | 2011-01-09 | 1 | -4/+8 |
| * | Step #2 to improve trip count analysis for loops like this: | Chris Lattner | 2011-01-09 | 1 | -6/+105 |
| * | teach SCEV analysis of PHI nodes that PHI recurences formed | Chris Lattner | 2011-01-09 | 1 | -0/+5 |
| * | reduce indentation. Print <nuw> and <nsw> when dumping SCEV AddRec's | Chris Lattner | 2011-01-09 | 1 | -49/+54 |
| * | 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 |
