Dan Gohman 4d52c6d622 Optimize ScalarEvolution's SCEVComplexityCompare predicate: don't go
scrounging through SCEVUnknown contents and SCEVNAryExpr operands;
instead just do a simple deterministic comparison of the precomputed
hash data.

Also, since this is more precise, it eliminates the need for the slow
N^2 duplicate detection code.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@105540 91177308-0d34-0410-b5e6-96231b3b80d8
2010-06-07 19:06:13 +00:00
..
2010-02-08 22:00:06 +00:00
2010-01-16 13:38:07 +00:00
2010-03-24 00:27:49 +00:00
2010-04-11 19:27:52 +00:00
2010-05-28 16:06:09 +00:00
2010-04-08 17:41:04 +00:00