Dan Gohman a334aa7a10 Teach ScalarEvolution how to analyze loops with multiple exit ... blocks, and also exit blocks with multiple conditions (combined with (bitwise) ands and ors). It's often infeasible to compute an exact trip count in such cases, but a useful upper bound can often be found. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@73866 91177308-0d34-0410-b5e6-96231b3b80d8		2009-06-22 00:31:57 +00:00
..
Andersens	Check that the function prototypes are correct before assuming that the	2008-12-27 16:20:53 +00:00
BasicAA	Teach BasicAliasAnalysis to understand constant gep indices that fall	2009-05-27 01:48:27 +00:00
CallGraph	Rationalize the names of passes that print information:	2008-09-23 12:47:39 +00:00
Dominators	Move these tests into the proper directory.	2008-05-29 16:30:29 +00:00
GlobalsModRef	Remove the MarkModRef pass (use AddReadAttrs instead).	2008-09-19 08:23:44 +00:00
LoopInfo	Update this test for the LoopInfo::print changes.	2009-02-27 00:17:49 +00:00
PostDominators	Move these tests into the proper directory.	2008-05-29 16:30:29 +00:00
ScalarEvolution	Teach ScalarEvolution how to analyze loops with multiple exit	2009-06-22 00:31:57 +00:00