Wojciech Matyjewicz 7b5b76835a Fix PR2002. Suppose n is the initial value for the induction ... variable (with step 1) and m is its final value. Then, the correct trip count is SMAX(m,n)-n. Previously, we used SMAX(0,m-n), but m-n may overflow and can't in general be interpreted as signed. Patch by Nick Lewycky. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@47007 91177308-0d34-0410-b5e6-96231b3b80d8		2008-02-12 15:09:36 +00:00
..
2007-07-15-NegativeStride.ll	Change grep '' to grep {}.	2007-11-27 00:10:35 +00:00
2007-08-06-MisinterpretBranch.ll	Fix the dates on these tests. It's not September yet. Thanks Reid!	2007-08-06 20:00:11 +00:00
2007-08-06-Unsigned.ll	Fix bug in regression tests that ignored stderr output in RUN lines. Updated tests and fixed broken run lines.	2007-11-28 04:57:00 +00:00
2007-09-27-LargeStepping.ll	Change grep '' to grep {}.	2007-11-27 00:10:35 +00:00
2007-11-14-SignedAddRec.ll	Fix PR1798 - an error in the evaluation of SCEVAddRecExpr at an	2008-02-11 11:03:14 +00:00
2007-11-18-OrInstruction.ll	Change grep '' to grep {}.	2007-11-27 00:10:35 +00:00
2008-02-11-ReversedCondition.ll	If the LHS of the comparison is a loop-invariant we also want to move it	2008-02-11 18:37:34 +00:00
2008-02-12-SMAXTripCount.ll	Fix PR2002. Suppose n is the initial value for the induction	2008-02-12 15:09:36 +00:00
dg.exp	For PR1319:	2007-04-15 09:31:07 +00:00
do-loop.ll	Add new SCEV, SCEVSMax. This allows LLVM to analyze do-while loops.	2007-11-25 22:41:31 +00:00
smax.ll	Add new SCEV, SCEVSMax. This allows LLVM to analyze do-while loops.	2007-11-25 22:41:31 +00:00
SolveQuadraticEquation.ll	Add two test cases to cover apintification change.	2007-04-26 16:44:48 +00:00
trip-count2.ll	Add two test cases to cover apintification change.	2007-04-26 16:44:48 +00:00
trip-count.ll	For PR1319:	2007-04-15 09:31:07 +00:00