[PATCH] D12199: Add framework for iterative compilation to llvm
Zoran Jovanovic via llvm-commits
llvm-commits at lists.llvm.org
Wed Dec 30 09:27:52 PST 2015
zoran.jovanovic updated this revision to Diff 43792.
zoran.jovanovic added a comment.
This version introduces new algorithm for exploring decision trees.
As stated in the last patch, splitting one big decision tree into multiple ones for every function in compilation unit can improve results.
Furthermore, separate decision trees are needed for each optimization phase (interprocedural, precodegen and codegen).
The algorithm spends 1/3 of iterations on searching for the best combination of alternative decisions for trees of each phase for every function in parallel. We got some improvement in code size for 5% more test cases which adds up to roughly 25% of test cases where our algorithm achieved smaller code size than non-iterative version.
Those results show that implementing parallel explore enables deeper exploration of the decision tree for the same number of iterations.
Comments are welcome.
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 128259 bytes
Desc: not available
More information about the llvm-commits