aboutsummaryrefslogtreecommitdiffstats
path: root/lib/Analysis/ScalarEvolution.cpp
Commit message (Expand)AuthorAgeFilesLines
* PR5207: Change APInt methods trunc(), sext(), zext(), sextOrTrunc() andJay Foad2010-12-071-2/+2
* PR5207: Rename overloaded APInt methods set(), clear(), flip() toJay Foad2010-12-011-1/+1
* Simplify code. No change in functionality.Benjamin Kramer2010-11-201-2/+2
* Silence warning about an uninitialized variable.Benjamin Kramer2010-11-191-1/+1
* Factor code for testing whether replacing one value with anotherDuncan Sands2010-11-181-17/+2
* Introduce memoization for ScalarEvolution dominates and properlyDominatesDan Gohman2010-11-181-58/+56
* Factor out the code for purging a SCEV from all the various memoization maps.Dan Gohman2010-11-171-26/+13
* Merge the implementations of isLoopInvariant and hasComputableLoopEvolution, andDan Gohman2010-11-171-71/+58
* Make SCEV::getType() and SCEV::print non-virtual. Move SCEV::hasOperandDan Gohman2010-11-171-105/+167
* Move SCEV::dominates and properlyDominates to ScalarEvolution.Dan Gohman2010-11-171-58/+91
* Move SCEV::isLoopInvariant and hasComputableLoopEvolution to be memberDan Gohman2010-11-171-81/+135
* Before replacing a phi node with a different value, itDuncan Sands2010-11-171-11/+15
* Verify SCEVAddRecExpr's invariant in ScalarEvolution::getAddRecExprDan Gohman2010-11-171-0/+3
* Fix ScalarEvolution's range memoization to avoid using aDan Gohman2010-11-171-44/+43
* Have ScalarEvolution use SimplifyInstruction rather than hasConstantValue.Duncan Sands2010-11-171-1/+5
* Memoize results from ScalarEvolution's getUnsignedRange and getSignedRange.Dan Gohman2010-11-171-43/+80
* Make ScalarEvolution::forgetLoop forget all contained loops too, becauseDan Gohman2010-10-291-0/+5
* Get rid of static constructors for pass registration. Instead, every pass ex...Owen Anderson2010-10-191-0/+1
* Begin adding static dependence information to passes, which will allow us toOwen Anderson2010-10-121-1/+5
* Now with fewer extraneous semicolons!Owen Anderson2010-10-071-1/+1
* Don't add the operand count to SCEV uniquing data; FoldingSetNodeIDDan Gohman2010-10-041-5/+0
* Reapply r112432, now that the real problem is addressed.Dan Gohman2010-08-311-4/+9
* Reapply r112433, now that the real problem is addressed.Dan Gohman2010-08-311-21/+24
* Revert r110916. This patch is buggy because the code inside theDan Gohman2010-08-311-7/+4
* Revert r112432. It appears to be exposing a problem in the emacs build.Dan Gohman2010-08-311-9/+4
* Speculatively revert r112433.Dan Gohman2010-08-311-24/+21
* Restructure the {A,+,B}<L> * {C,+,D}<L> folding so that it foldsDan Gohman2010-08-291-21/+24
* Batch up subtracts along with adds, when analyzing long chains ofDan Gohman2010-08-291-4/+9
* Micro-optimize GroupByComplexity.Dan Gohman2010-08-291-2/+3
* Hold AddRec->getLoop() in a variable, to make the Mul code more consistentDan Gohman2010-08-291-3/+4
* Rename a variable, for consistency.Dan Gohman2010-08-291-5/+8
* Use iterators instead of indices.Dan Gohman2010-08-291-2/+2
* Fix an index calculation thinko.Dan Gohman2010-08-281-1/+1
* When merging adjacent operands, scan ahead and merge all equalDan Gohman2010-08-271-11/+14
* Make the {A,+,B}<L> + {C,+,D}<L> --> Other + {A+C,+,B+D}<L>Dan Gohman2010-08-271-23/+21
* Switch ScalarEvolution's main Value*->SCEV* map from std::mapDan Gohman2010-08-271-28/+26
* Optimize SCEVComplexityCompare. Use a 3-way return instead of a 2-wayDan Gohman2010-08-271-48/+82
* To create a copy of a SmallVector with an element removed from theDan Gohman2010-08-161-6/+7
* Tidy whitespace.Dan Gohman2010-08-161-5/+4
* Add a comment.Dan Gohman2010-08-161-0/+5
* Use const_iterator in a few places.Dan Gohman2010-08-161-3/+3
* Use iterators instead of indices in a few more places.Dan Gohman2010-08-161-6/+9
* Micro-optimize SCEVConstant comparison.Dan Gohman2010-08-161-4/+4
* Move SCEVNAryExpr's virtual member functions out of line, and convertDan Gohman2010-08-161-0/+33
* Use iterators instead of indices in simple cases.Dan Gohman2010-08-161-6/+4
* Avoid gratuitous inefficiency in ifndef NDEBUG code.Dan Gohman2010-08-161-8/+8
* Make one getAddExpr call when analyzing a+b+c+d+e+... instead of oneDan Gohman2010-08-161-6/+31
* Delete an unused function.Dan Gohman2010-08-161-35/+0
* Various optimizations. Don't compare two loops' depthsDan Gohman2010-08-131-18/+26
* When testing whether one loop contains another, test this directlyDan Gohman2010-08-131-2/+2