llvm-6502/test/Analysis/ScalarEvolution
Andrew Trick e62289b98f When SCEV can determine the loop test is X < X, set ExactBECount=0.
When ExactBECount is a constant, use it for MaxBECount.
When MaxBECount cannot be computed, replace it with ExactBECount.
Fixes PR9424.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@127342 91177308-0d34-0410-b5e6-96231b3b80d8
2011-03-09 17:29:58 +00:00
..
2007-07-15-NegativeStride.ll
2007-08-06-MisinterpretBranch.ll
2007-08-06-Unsigned.ll
2007-09-27-LargeStepping.ll
2007-11-14-SignedAddRec.ll
2007-11-18-OrInstruction.ll
2008-02-11-ReversedCondition.ll
2008-02-12-SMAXTripCount.ll
2008-02-15-UMax.ll
2008-05-25-NegativeStepToZero.ll
2008-06-12-BinomialInt64.ll
2008-07-12-UnneededSelect1.ll
2008-07-12-UnneededSelect2.ll
2008-07-19-InfiniteLoop.ll
2008-07-19-WrappingIV.ll
2008-07-29-SGTTripCount.ll
2008-07-29-SMinExpr.ll Revert r106304 (105548 and friends), which are the SCEVComplexityCompare 2010-06-18 19:54:20 +00:00
2008-08-04-IVOverflow.ll
2008-08-04-LongAddRec.ll
2008-11-02-QuadraticCrash.ll
2008-11-15-CubicOOM.ll
2008-11-18-LessThanOrEqual.ll ScalarEvolution support for <= and >= loops. 2010-04-24 03:09:42 +00:00
2008-11-18-Stride1.ll
2008-11-18-Stride2.ll Add a comment to this test. 2010-04-26 21:37:43 +00:00
2008-12-08-FiniteSGE.ll ScalarEvolution support for <= and >= loops. 2010-04-24 03:09:42 +00:00
2008-12-11-SMaxOverflow.ll ScalarEvolution support for <= and >= loops. 2010-04-24 03:09:42 +00:00
2008-12-14-StrideAndSigned.ll
2008-12-15-DontUseSDiv.ll
2009-01-02-SignedNegativeStride.ll
2009-04-22-TruncCast.ll
2009-05-09-PointerEdgeCount.ll
2009-07-04-GroupConstantsWidthMismatch.ll
2010-09-03-RequiredTransitive.ll Implement requiredTransitive 2011-01-20 21:03:22 +00:00
2011-03-09-ExactNoMaxBECount.ll When SCEV can determine the loop test is X < X, set ExactBECount=0. 2011-03-09 17:29:58 +00:00
and-xor.ll
avoid-infinite-recursion-0.ll
avoid-infinite-recursion-1.ll
avoid-smax-0.ll
avoid-smax-1.ll remove some noise from tests. 2010-09-02 22:35:33 +00:00
dg.exp
div-overflow.ll
do-loop.ll
fold.ll Simplify some code with no functionality change. Make the test a lot more 2011-01-23 20:06:05 +00:00
max-trip-count.ll When analyzing loop exit conditions combined with and and or, don't 2010-08-11 00:12:36 +00:00
nsw-offset.ll
nsw.ll teach SCEV that the scale and addition of an inbounds gep don't NSW. 2011-02-13 03:14:49 +00:00
pointer-sign-bits.ll
pr3909.ll
scev-aa.ll teach SCEV that the scale and addition of an inbounds gep don't NSW. 2011-02-13 03:14:49 +00:00
sext-inreg.ll
sext-iv-0.ll
sext-iv-1.ll
sext-iv-2.ll
sle.ll ScalarEvolution support for <= and >= loops. 2010-04-24 03:09:42 +00:00
smax.ll
SolveQuadraticEquation.ll
trip-count2.ll
trip-count3.ll
trip-count4.ll
trip-count5.ll
trip-count6.ll
trip-count7.ll
trip-count8.ll
trip-count9.ll
trip-count10.ll Allow "exhaustive" trip count evaluation on phi nodes with all 2010-06-22 13:15:46 +00:00
trip-count.ll
undefined.ll Don't attempt to analyze values which are obviously undef. This fixes some 2010-04-22 01:35:11 +00:00
unreachable-code.ll Avoid analyzing instructions in blocks not reachable from the entry block. 2010-03-09 23:46:50 +00:00
unsimplified-loop.ll Generalize ScalarEvolution's PHI analysis to handle loops that don't 2010-04-12 07:49:36 +00:00
xor-and.ll
zext-wrap.ll