Dan Gohman 2385e0e22c Create a ScalarEvolution-based AliasAnalysis implementation. ... This is a simple AliasAnalysis implementation which works by making ScalarEvolution queries. ScalarEvolution has a more complete understanding of arithmetic than BasicAA's collection of ad-hoc checks, so it handles some cases that BasicAA misses, for example p[i] and p[i+1] within the same iteration of a loop. This is currently experimental. It may be that the main use for this pass will be to help find cases where BasicAA can be profitably extended, or to help in the development of the overall AliasAnalysis infrastructure, however it's also possible that it could grow up to become a directly useful pass. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@80098 91177308-0d34-0410-b5e6-96231b3b80d8		2009-08-26 14:53:06 +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
GlobalsModRef	Remove the MarkModRef pass (use AddReadAttrs instead).	2008-09-19 08:23:44 +00:00
LoopDependenceAnalysis	Add another Strong-SIV testcase.	2009-08-08 00:21:49 +00:00
LoopInfo	Update this test for the LoopInfo::print changes.	2009-02-27 00:17:49 +00:00
PointerTracking	Introduce a pointertracking pass.	2009-07-14 18:44:28 +00:00
PostDominators
ScalarEvolution	Create a ScalarEvolution-based AliasAnalysis implementation.	2009-08-26 14:53:06 +00:00