summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis/ScalarEvolution.cpp
Commit message (Expand)AuthorAgeFilesLines
...
* 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
* Add a const.Dan Gohman2010-08-131-1/+1
* When creating a symmetric SCEV with a constant operand, putDan Gohman2010-08-131-4/+4
* An add recurrence is loop-invariant in any loop inside of itsDan Gohman2010-08-131-0/+4
* Optimize ScalarEvolution::getAddExpr's operand factoring code byDan Gohman2010-08-121-4/+7
* Hoist some loop-invariant code out of a hot loop.Dan Gohman2010-08-121-2/+4
* Optimize ScalarEvolution::getAddExpr's duplicate operand detectionDan Gohman2010-08-121-3/+7
* When analyzing loop exit conditions combined with and and or, don'tDan Gohman2010-08-111-14/+12
* Rename and reorder the arguments to isImpliedCond, for consistency and clarity.Dan Gohman2010-08-101-10/+12
* Reapply r110396, with fixes to appease the Linux buildbot gods.Owen Anderson2010-08-061-1/+1
* Revert r110396 to fix buildbots.Owen Anderson2010-08-061-1/+1
* Don't use PassInfo* as a type identifier for passes. Instead, use the addres...Owen Anderson2010-08-051-1/+1
* Fix a minor bug which resulted in intermediate calculationsDan Gohman2010-08-041-1/+1
* Make SCEVUnknown a CallbackVH, so that it can be notified directlyDan Gohman2010-08-021-47/+46
* Prefix `next' iterator operation with `llvm::'.Oscar Fuentes2010-08-021-2/+2
* Speculatively revert r109705 since it seems to be causing some build botEric Christopher2010-07-291-45/+29
* Factor out some of the code for updating old SCEVUnknown values, andDan Gohman2010-07-291-29/+45
* Make SCEVCallbackVH::allUsesReplacedWith update the old SCEVUnknownDan Gohman2010-07-281-22/+39
* Make SCEVCallbackVH::allUsesReplacedWith unconditionally deleteDan Gohman2010-07-281-12/+6
* Micro-optimize SCEVComplexityCompare.Dan Gohman2010-07-231-34/+44
* Add a const qualifier.Dan Gohman2010-07-231-2/+2
* mass elimination of reliance on automatic iterator dereferencingGabor Greif2010-07-221-1/+1
* Fix batch of converting RegisterPass<> to INTIALIZE_PASS().Owen Anderson2010-07-211-2/+2
* Add a fast path for x - x.Dan Gohman2010-07-201-0/+4
* Teach ScalarEvolution how to fold trunc(undef) and anyext(undef) to undef.Dan Gohman2010-07-151-0/+14
* In ScalarEvolution::forgetValue, eliminate any SCEVUnknownDan Gohman2010-06-301-0/+20
* Revert the part of r107257 which introduced new logic for usingDan Gohman2010-06-301-82/+11
* Improve ScalarEvolution's nsw and nuw preservation.Dan Gohman2010-06-301-31/+105
* When computing a new ConservativeResult, intersect it withDan Gohman2010-06-301-1/+2
* Fix ScalarEvolution's tripcount computation for chains of loopsDan Gohman2010-06-291-41/+61
OpenPOWER on IntegriCloud