mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-21 03:53:04 +02:00
74eb1e2070
This doesn't implement *every* feature of the existing inliner, but tries to implement the most important ones for building a functional optimization pipeline and beginning to sort out bugs, regressions, and other problems. Notable, but intentional omissions: - No alloca merging support. Why? Because it isn't clear we want to do this at all. Active discussion and investigation is going on to remove it, so for simplicity I omitted it. - No support for trying to iterate on "internally" devirtualized calls. Why? Because it adds what I suspect is inappropriate coupling for little or no benefit. We will have an outer iteration system that tracks devirtualization including that from function passes and iterates already. We should improve that rather than approximate it here. - Optimization remarks. Why? Purely to make the patch smaller, no other reason at all. The last one I'll probably work on almost immediately. But I wanted to skip it in the initial patch to try to focus the change as much as possible as there is already a lot of code moving around and both of these *could* be skipped without really disrupting the core logic. A summary of the different things happening here: 1) Adding the usual new PM class and rigging. 2) Fixing minor underlying assumptions in the inline cost analysis or inline logic that don't generally hold in the new PM world. 3) Adding the core pass logic which is in essence a loop over the calls in the nodes in the call graph. This is a bit duplicated from the old inliner, but only a handful of lines could realistically be shared. (I tried at first, and it really didn't help anything.) All told, this is only about 100 lines of code, and most of that is the mechanics of wiring up analyses from the new PM world. 4) Updating the LazyCallGraph (in the new PM) based on the *newly inlined* calls and references. This is very minimal because we cannot form cycles. 5) When inlining removes the last use of a function, eagerly nuking the body of the function so that any "one use remaining" inline cost heuristics are immediately refined, and queuing these functions to be completely deleted once inlining is complete and the call graph updated to reflect that they have become dead. 6) After all the inlining for a particular function, updating the LazyCallGraph and the CGSCC pass manager to reflect the function-local simplifications that are done immediately and internally by the inline utilties. These are the exact same fundamental set of CG updates done by arbitrary function passes. 7) Adding a bunch of test cases to specifically target CGSCC and other subtle aspects in the new PM world. Many thanks to the careful review from Easwaran and Sanjoy and others! Differential Revision: https://reviews.llvm.org/D24226 llvm-svn: 290161 |
||
|---|---|---|
| .. | ||
| AddDiscriminators.h | ||
| ASanStackFrameLayout.h | ||
| BasicBlockUtils.h | ||
| BreakCriticalEdges.h | ||
| BuildLibCalls.h | ||
| BypassSlowDivision.h | ||
| Cloning.h | ||
| CmpInstAnalysis.h | ||
| CodeExtractor.h | ||
| CtorUtils.h | ||
| EscapeEnumerator.h | ||
| Evaluator.h | ||
| FunctionComparator.h | ||
| FunctionImportUtils.h | ||
| GlobalStatus.h | ||
| ImportedFunctionsInliningStatistics.h | ||
| IntegerDivision.h | ||
| LCSSA.h | ||
| LibCallsShrinkWrap.h | ||
| Local.h | ||
| LoopSimplify.h | ||
| LoopUtils.h | ||
| LoopVersioning.h | ||
| LowerInvoke.h | ||
| Mem2Reg.h | ||
| MemorySSA.h | ||
| ModuleUtils.h | ||
| NameAnonGlobals.h | ||
| PromoteMemToReg.h | ||
| SanitizerStats.h | ||
| SimplifyIndVar.h | ||
| SimplifyInstructions.h | ||
| SimplifyLibCalls.h | ||
| SplitModule.h | ||
| SSAUpdater.h | ||
| SSAUpdaterImpl.h | ||
| SymbolRewriter.h | ||
| UnifyFunctionExitNodes.h | ||
| UnrollLoop.h | ||
| ValueMapper.h | ||