Arnold Schwaighofer 3036182e99 BasicAA: Use reachabilty instead of dominance for checking value equality in phi ... cycles This allows the value equality check to work even if we don't have a dominator tree. Also add some more comments. I was worried about compile time impacts and did not implement reachability but used the dominance check in the initial patch. The trade-off was that the dominator tree was required. The llvm utility function isPotentiallyReachable cuts off the recursive search after 32 visits. Testing did not show any compile time regressions showing my worries unjustfied. No compile time or performance regressions at O3 -flto -mavx on test-suite + externals. Addresses review comments from r198290. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@198400 91177308-0d34-0410-b5e6-96231b3b80d8		2014-01-03 05:47:03 +00:00
..
BasicAA	BasicAA: Use reachabilty instead of dominance for checking value equality in phi	2014-01-03 05:47:03 +00:00
BlockFrequencyInfo
BranchProbabilityInfo	Consider (x == -1) unlikely in BranchProbabilityInfo	2013-11-01 10:58:22 +00:00
CallGraph
CostModel	X86: Custom lower sext v16i8 to v16i16, and the corresponding truncate.	2013-10-23 21:06:07 +00:00
Delinearization	delinearization of arrays	2013-11-12 22:47:20 +00:00
DependenceAnalysis	improve dependence analysis testcases	2013-11-12 22:47:30 +00:00
Dominators
GlobalsModRef	BasicAA: Use reachabilty instead of dominance for checking value equality in phi	2014-01-03 05:47:03 +00:00
Lint
LoopInfo
MemoryDependenceAnalysis
PostDominators
RegionInfo
ScalarEvolution	Rewrite SCEV's backedge taken count computation.	2013-11-06 02:08:26 +00:00
TypeBasedAliasAnalysis