| Age | Commit message (Expand) | Author |
|---|
| 2011-02-13 | teach SCEV that the scale and addition of an inbounds gep don't NSW. | Chris Lattner |
| 2011-02-11 | Per discussion with Dan G, inbounds geps *certainly* can have | Chris Lattner |
| 2011-01-26 | Fix memory corruption. If one of the SCEV creation functions calls another but | Nick Lewycky |
| 2011-01-24 | Add a comment. | Dan Gohman |
| 2011-01-23 | Simplify some code with no functionality change. Make the test a lot more | Nick Lewycky |
| 2011-01-23 | Use value ranges to fold ext(trunc) in SCEV when possible. | Nick Lewycky |
| 2011-01-22 | Have SCEV turn sext(x) into zext(x) when x is s>= 0. This applies many times in | Nick Lewycky |
| 2011-01-19 | Similarly, analyze truncate through multiply. | Nick Lewycky |
| 2011-01-19 | Add a missed SCEV fold that is required to continue analyzing the IR produced | Nick Lewycky |
| 2011-01-19 | Add a missing SCEV simplification sext(zext x) --> zext x. | Nick Lewycky |
| 2011-01-11 | some comment improvements. | Chris Lattner |
| 2011-01-11 | Temporarily revert 123133, it's causing some regressions and I'm trying | Eric Christopher |
| 2011-01-11 | the GEP faq says that only inbounds geps are guaranteed to not overflow. | Chris Lattner |
| 2011-01-09 | add a fixme: ir isn't expressive enough. | Chris Lattner |
| 2011-01-09 | Step #4 in improving trip count analysis: HowFarToZero can analyze | Chris Lattner |
| 2011-01-09 | rearrange some code, no functionality change. | Chris Lattner |
| 2011-01-09 | Step #3 to improving trip count analysis: If we fold | Chris Lattner |
| 2011-01-09 | Step #2 to improve trip count analysis for loops like this: | Chris Lattner |
| 2011-01-09 | teach SCEV analysis of PHI nodes that PHI recurences formed | Chris Lattner |
| 2011-01-09 | reduce indentation. Print <nuw> and <nsw> when dumping SCEV AddRec's | Chris Lattner |
| 2010-12-07 | PR5207: Change APInt methods trunc(), sext(), zext(), sextOrTrunc() and | Jay Foad |
| 2010-12-01 | PR5207: Rename overloaded APInt methods set(), clear(), flip() to | Jay Foad |
| 2010-11-20 | Simplify code. No change in functionality. | Benjamin Kramer |
| 2010-11-19 | Silence warning about an uninitialized variable. | Benjamin Kramer |
| 2010-11-18 | Factor code for testing whether replacing one value with another | Duncan Sands |
| 2010-11-18 | Introduce memoization for ScalarEvolution dominates and properlyDominates | Dan Gohman |
| 2010-11-17 | Factor out the code for purging a SCEV from all the various memoization maps. | Dan Gohman |
| 2010-11-17 | Merge the implementations of isLoopInvariant and hasComputableLoopEvolution, and | Dan Gohman |
| 2010-11-17 | Make SCEV::getType() and SCEV::print non-virtual. Move SCEV::hasOperand | Dan Gohman |
| 2010-11-17 | Move SCEV::dominates and properlyDominates to ScalarEvolution. | Dan Gohman |
| 2010-11-17 | Move SCEV::isLoopInvariant and hasComputableLoopEvolution to be member | Dan Gohman |
| 2010-11-17 | Before replacing a phi node with a different value, it | Duncan Sands |
| 2010-11-17 | Verify SCEVAddRecExpr's invariant in ScalarEvolution::getAddRecExpr | Dan Gohman |
| 2010-11-17 | Fix ScalarEvolution's range memoization to avoid using a | Dan Gohman |
| 2010-11-17 | Have ScalarEvolution use SimplifyInstruction rather than hasConstantValue. | Duncan Sands |
| 2010-11-17 | Memoize results from ScalarEvolution's getUnsignedRange and getSignedRange. | Dan Gohman |
| 2010-10-29 | Make ScalarEvolution::forgetLoop forget all contained loops too, because | Dan Gohman |
| 2010-10-19 | Get rid of static constructors for pass registration. Instead, every pass ex... | Owen Anderson |
| 2010-10-12 | Begin adding static dependence information to passes, which will allow us to | Owen Anderson |
| 2010-10-07 | Now with fewer extraneous semicolons! | Owen Anderson |
| 2010-10-04 | Don't add the operand count to SCEV uniquing data; FoldingSetNodeID | Dan Gohman |
| 2010-08-31 | Reapply r112432, now that the real problem is addressed. | Dan Gohman |
| 2010-08-31 | Reapply r112433, now that the real problem is addressed. | Dan Gohman |
| 2010-08-31 | Revert r110916. This patch is buggy because the code inside the | Dan Gohman |
| 2010-08-31 | Revert r112432. It appears to be exposing a problem in the emacs build. | Dan Gohman |
| 2010-08-31 | Speculatively revert r112433. | Dan Gohman |
| 2010-08-29 | Restructure the {A,+,B}<L> * {C,+,D}<L> folding so that it folds | Dan Gohman |
| 2010-08-29 | Batch up subtracts along with adds, when analyzing long chains of | Dan Gohman |
| 2010-08-29 | Micro-optimize GroupByComplexity. | Dan Gohman |
| 2010-08-29 | Hold AddRec->getLoop() in a variable, to make the Mul code more consistent | Dan Gohman |
