forked from OSchip/llvm-project
57cbdfc99a
When a loop gets bundled up, its outgoing edges are quite large, and can just barely overflow 64-bits. If one successor has multiple incoming edges -- and that successor is getting all the incoming mass -- combining just its edges can overflow. Handle that by saturating rather than asserting. This fixes PR21622. llvm-svn: 223500 |
||
|---|---|---|
| .. | ||
| BasicAA | ||
| BlockFrequencyInfo | ||
| BranchProbabilityInfo | ||
| CFLAliasAnalysis | ||
| CallGraph | ||
| CostModel | ||
| Delinearization | ||
| DependenceAnalysis | ||
| Dominators | ||
| GlobalsModRef | ||
| LazyCallGraph | ||
| Lint | ||
| LoopInfo | ||
| MemoryDependenceAnalysis | ||
| PostDominators | ||
| RegionInfo | ||
| ScalarEvolution | ||
| ScopedNoAliasAA | ||
| TypeBasedAliasAnalysis | ||