llvm-6502/test/Analysis
Dan Gohman 0f4b285a5b Replace the original ad-hoc code for determining whether (v pred w) implies
(x pred y) with more thorough code that does more complete canonicalization
before resorting to range checks. This helps it find more cases where
the canonicalized expressions match.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@76671 91177308-0d34-0410-b5e6-96231b3b80d8
2009-07-21 23:03:19 +00:00
..
Andersens
BasicAA Teach BasicAliasAnalysis to understand constant gep indices that fall 2009-05-27 01:48:27 +00:00
CallGraph
Dominators
GlobalsModRef
LoopDependenceAnalysis Array accesses are independent if the underlying arrays differ. 2009-06-30 02:12:10 +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 Replace the original ad-hoc code for determining whether (v pred w) implies 2009-07-21 23:03:19 +00:00