mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-09-03 02:30:00 +00:00
de1c9bb450
introduce no-return or unreachable heuristics. The return heuristics from the Ball and Larus paper don't work well in practice as they pessimize early return paths. The only good hitrate return heuristics are those for: - NULL return - Constant return - negative integer return Only the last of these three can possibly require significant code for the returning block, and even the last is fairly rare and usually also a constant. As a consequence, even for the cold return paths, there is little code on that return path, and so little code density to be gained by sinking it. The places where sinking these blocks is valuable (inner loops) will already be weighted appropriately as the edge is a loop-exit branch. All of this aside, early returns are nearly as common as all three of these return categories, and should actually be predicted as taken! Rather than muddy the waters of the static predictions, just remain silent on returns and let the CFG itself dictate any layout or other issues. However, the return heuristic was flagging one very important case: unreachable. Unfortunately it still gave a 1/4 chance of the branch-to-unreachable occuring. It also didn't do a rigorous job of finding those blocks which post-dominate an unreachable block. This patch builds a more powerful analysis that should flag all branches to blocks known to then reach unreachable. It also has better worst-case runtime complexity by not looping through successors for each block. The previous code would perform an N^2 walk in the event of a single entry block branching to N successors with a switch where each successor falls through to the next and they finally fall through to a return. Test case added for noreturn heuristics. Also doxygen comments improved along the way. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@142793 91177308-0d34-0410-b5e6-96231b3b80d8 |
||
|---|---|---|
| .. | ||
| AliasAnalysis.h | ||
| AliasSetTracker.h | ||
| BlockFrequencyImpl.h | ||
| BlockFrequencyInfo.h | ||
| BranchProbabilityInfo.h | ||
| CallGraph.h | ||
| CaptureTracking.h | ||
| CFGPrinter.h | ||
| CodeMetrics.h | ||
| ConstantFolding.h | ||
| ConstantsScanner.h | ||
| DebugInfo.h | ||
| DIBuilder.h | ||
| DominanceFrontier.h | ||
| DominatorInternals.h | ||
| Dominators.h | ||
| DomPrinter.h | ||
| DOTGraphTraitsPass.h | ||
| FindUsedTypes.h | ||
| InlineCost.h | ||
| InstructionSimplify.h | ||
| Interval.h | ||
| IntervalIterator.h | ||
| IntervalPartition.h | ||
| IVUsers.h | ||
| LazyValueInfo.h | ||
| LibCallAliasAnalysis.h | ||
| LibCallSemantics.h | ||
| Lint.h | ||
| Loads.h | ||
| LoopDependenceAnalysis.h | ||
| LoopInfo.h | ||
| LoopIterator.h | ||
| LoopPass.h | ||
| MemoryBuiltins.h | ||
| MemoryDependenceAnalysis.h | ||
| Passes.h | ||
| PathNumbering.h | ||
| PathProfileInfo.h | ||
| PHITransAddr.h | ||
| PostDominators.h | ||
| ProfileInfo.h | ||
| ProfileInfoLoader.h | ||
| ProfileInfoTypes.h | ||
| RegionInfo.h | ||
| RegionIterator.h | ||
| RegionPass.h | ||
| RegionPrinter.h | ||
| ScalarEvolution.h | ||
| ScalarEvolutionExpander.h | ||
| ScalarEvolutionExpressions.h | ||
| ScalarEvolutionNormalization.h | ||
| SparsePropagation.h | ||
| Trace.h | ||
| ValueTracking.h | ||
| Verifier.h | ||