mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-18 17:39:04 +00:00
4d52c6d622
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 |
||
---|---|---|
.. | ||
BasicAA | ||
CallGraph | ||
Dominators | ||
GlobalsModRef | ||
LoopDependenceAnalysis | ||
LoopInfo | ||
PointerTracking | ||
PostDominators | ||
Profiling | ||
ScalarEvolution |