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
..
Andersens	Create nodes for inline asm so that we don't crash looking for the node later.	2007-11-22 03:07:37 +00:00
BasicAA	Teach basicaa that 'byval' arguments define a new memory location that	2008-01-24 18:00:32 +00:00
Dominators	update for new domtree dump format	2007-08-06 06:17:08 +00:00
GlobalsModRef	Ding dong, the DoesntAccessMemoryFns and	2007-11-23 19:30:27 +00:00
LoadVN	Ding dong, the DoesntAccessMemoryFns and	2007-11-23 19:30:27 +00:00
LoopInfo	Convert .cvsignore files	2007-06-29 16:35:07 +00:00
ScalarEvolution	Fix PR2002. Suppose n is the initial value for the induction	2008-02-12 15:09:36 +00:00