forked from OSchip/llvm-project
fc539b0004
Our current strategy of computing ranges of SCEVUnknown Phis was to simply compute the union of ranges of all its inputs. In order to avoid infinite recursion, we mark Phis as pending and conservatively return full set for them. As result, even simplest patterns of cycled phis always have a range of full set. This patch makes this logic a bit smarter. We basically do the same, but instead of taking inputs of single Phi we find its strongly connected component (SCC) and compute the union of all inputs that come into this SCC from outside. Processing entire SCC together has one more advantage: we can set range for all of them at once, because the only thing that happens to them is the same value is being passed between those Phis. So, despite we spend more time analyzing a single Phi, overall we may save time by not processing other SCC members, so amortized compile time spent should be approximately the same. Differential Revision: https://reviews.llvm.org/D110620 Reviewed By: reames |
||
|---|---|---|
| .. | ||
| AliasSet | ||
| AssumptionCache | ||
| BasicAA | ||
| BlockFrequencyInfo | ||
| BranchProbabilityInfo | ||
| CFLAliasAnalysis | ||
| CallGraph | ||
| CostModel | ||
| CycleInfo | ||
| DDG | ||
| Delinearization | ||
| DemandedBits | ||
| DependenceAnalysis | ||
| DivergenceAnalysis | ||
| DominanceFrontier | ||
| Dominators | ||
| FunctionPropertiesAnalysis | ||
| GlobalsModRef | ||
| IRSimilarityIdentifier | ||
| IVUsers | ||
| LazyCallGraph | ||
| LazyValueAnalysis | ||
| LegacyDivergenceAnalysis | ||
| Lint | ||
| LoopAccessAnalysis | ||
| LoopCacheAnalysis/PowerPC | ||
| LoopInfo | ||
| LoopNestAnalysis | ||
| MemoryDependenceAnalysis | ||
| MemorySSA | ||
| MustExecute | ||
| PhiValues | ||
| PostDominators | ||
| ProfileSummary | ||
| RegionInfo | ||
| ScalarEvolution | ||
| ScopedNoAliasAA | ||
| StackSafetyAnalysis | ||
| TypeBasedAliasAnalysis | ||
| ValueTracking | ||
| alias-analysis-uses.ll | ||