e240e6b8b7
When we check for similarity, right now there is no order to how it is checked, except for via the suffix tree ordering. We can reduce how much structural analysis we perform by checking the the regions in decreasing size. In doing so, we know that if two large sections match, each of their contained regions also match. This allows us to skip the structural checking for each smaller section. IT does require that we use the large regions as a "bridge" to create the canonical mapping between the two regions. This reduces compile time significantly for some benchmarks. It will not perform as well for programs with many small items. Recommit fixes the IRSimilarity tests. Recommit of: |
||
|---|---|---|
| .. | ||
| AliasSet | ||
| AssumptionCache | ||
| BasicAA | ||
| BlockFrequencyInfo | ||
| BranchProbabilityInfo | ||
| CallGraph | ||
| CostModel | ||
| CycleInfo | ||
| DDG | ||
| Delinearization | ||
| DemandedBits | ||
| DependenceAnalysis | ||
| DivergenceAnalysis | ||
| DominanceFrontier | ||
| Dominators | ||
| DotMachineCFG/AMDGPU | ||
| FunctionPropertiesAnalysis | ||
| GlobalsModRef | ||
| IRSimilarityIdentifier | ||
| IVUsers | ||
| LazyCallGraph | ||
| LazyValueAnalysis | ||
| LegacyDivergenceAnalysis | ||
| Lint | ||
| LoopAccessAnalysis | ||
| LoopCacheAnalysis | ||
| LoopInfo | ||
| LoopNestAnalysis | ||
| MemoryDependenceAnalysis | ||
| MemorySSA | ||
| MustExecute | ||
| PhiValues | ||
| PostDominators | ||
| ProfileSummary | ||
| RegionInfo | ||
| ScalarEvolution | ||
| ScopedNoAliasAA | ||
| StackSafetyAnalysis | ||
| TypeBasedAliasAnalysis | ||
| ValueTracking | ||