Devang Patel 425514c509 Add incoming value from header only if phi node has any use inside the loop. ... llvm-svn: 48738		2008-03-24 20:16:14 +00:00
..
2007-09-21-LoopBound.ll	Fix PR1692	2007-09-21 21:18:19 +00:00
2007-09-24-UpdateIterationSpace.ll	Add transformation to update loop interation space. Now,	2007-09-25 17:31:19 +00:00
2007-09-25-UpdateIterationSpace-2.ll	Handle multiple induction variables.	2007-09-25 18:24:48 +00:00
2008-01-28-IndDecrement.ll	Filter loops that subtract induction variables.	2008-01-29 02:20:41 +00:00
2008-02-08-Crash.ll	Fix PR 1995.	2008-02-08 22:49:13 +00:00
2008-02-13-ExitValueNum.ll	Keep track of exit value operand number when operands are swapped.	2008-02-13 19:48:48 +00:00
2008-02-13-LoopLatch.ll	While moving exit condition, do not drop loop latch on the floor.	2008-02-13 22:06:36 +00:00
2008-02-13-LoopLatchPHI.ll	A loop latch phi node may have uses inside loop, not just in loop header.	2008-02-13 22:23:07 +00:00
2008-02-14-Crash.ll	If loop header is also loop exiting block then OrigPN is incoming value for B loop header.	2008-02-14 23:18:47 +00:00
2008-03-24-ExitPhi.ll	Add incoming value from header only if phi node has any use inside the loop.	2008-03-24 20:16:14 +00:00
Crash2-2007-08-17.ll
Crash-2007-08-17.ll
Crash-2007-12-03.ll	If ExitValue operand is also defined in Loop header then	2007-12-03 19:17:21 +00:00
dg.exp
ExitCondition-2007-09-10.ll	Filter exit conditions which are not yet handled.	2007-09-10 18:33:42 +00:00
OneIterLoop2-2007-08-17.ll
OneIterLoop3-2007-08-17.ll
OneIterLoop-2007-08-17.ll
SaveLastValue-2007-08-17.ll
SplitValue-2007-08-24.ll	While calculating upper loop bound for first loop and lower loop bound for second loop, take care of edge cases.	2007-08-25 00:56:38 +00:00
UpperBound-2007-08-24.ll	Constant split values needs upper bound and lower bound check, just like any other split value.	2007-08-25 01:09:14 +00:00