solidity/libyul/optimiser/Suite.cpp

196 lines
6.0 KiB
C++
Raw Normal View History

2018-10-16 19:39:22 +00:00
/*
This file is part of solidity.
solidity is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
solidity is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with solidity. If not, see <http://www.gnu.org/licenses/>.
*/
/**
* Optimiser suite that combines all steps and also provides the settings for the heuristics.
*/
#include <libyul/optimiser/Suite.h>
#include <libyul/optimiser/Disambiguator.h>
2018-12-13 14:26:01 +00:00
#include <libyul/optimiser/VarDeclInitializer.h>
2019-01-08 14:19:35 +00:00
#include <libyul/optimiser/BlockFlattener.h>
2018-10-16 19:39:22 +00:00
#include <libyul/optimiser/FunctionGrouper.h>
#include <libyul/optimiser/FunctionHoister.h>
#include <libyul/optimiser/EquivalentFunctionCombiner.h>
2018-10-16 19:39:22 +00:00
#include <libyul/optimiser/ExpressionSplitter.h>
#include <libyul/optimiser/ExpressionJoiner.h>
#include <libyul/optimiser/ExpressionInliner.h>
#include <libyul/optimiser/FullInliner.h>
#include <libyul/optimiser/ForLoopInitRewriter.h>
2018-10-16 19:39:22 +00:00
#include <libyul/optimiser/Rematerialiser.h>
#include <libyul/optimiser/UnusedPruner.h>
#include <libyul/optimiser/ExpressionSimplifier.h>
#include <libyul/optimiser/CommonSubexpressionEliminator.h>
2019-01-16 10:44:45 +00:00
#include <libyul/optimiser/SSAReverser.h>
2018-10-16 19:39:22 +00:00
#include <libyul/optimiser/SSATransform.h>
2019-02-04 16:30:29 +00:00
#include <libyul/optimiser/StackCompressor.h>
#include <libyul/optimiser/StructuralSimplifier.h>
2018-10-16 19:39:22 +00:00
#include <libyul/optimiser/RedundantAssignEliminator.h>
#include <libyul/optimiser/VarNameCleaner.h>
#include <libyul/optimiser/Metrics.h>
#include <libyul/AsmAnalysis.h>
#include <libyul/AsmAnalysisInfo.h>
#include <libyul/AsmData.h>
#include <libyul/AsmPrinter.h>
2018-10-16 19:39:22 +00:00
#include <libyul/backends/evm/NoOutputAssembly.h>
2018-10-16 19:39:22 +00:00
#include <libdevcore/CommonData.h>
using namespace std;
using namespace dev;
using namespace yul;
2018-10-16 19:39:22 +00:00
void OptimiserSuite::run(
2019-01-31 13:44:57 +00:00
shared_ptr<Dialect> const& _dialect,
2018-10-16 19:39:22 +00:00
Block& _ast,
AsmAnalysisInfo const& _analysisInfo,
set<YulString> const& _externallyUsedIdentifiers
2018-10-16 19:39:22 +00:00
)
{
set<YulString> reservedIdentifiers = _externallyUsedIdentifiers;
2018-10-16 19:39:22 +00:00
2019-01-31 13:44:57 +00:00
Block ast = boost::get<Block>(Disambiguator(*_dialect, _analysisInfo, reservedIdentifiers)(_ast));
2018-10-16 19:39:22 +00:00
VarDeclInitializer{}(ast);
FunctionHoister{}(ast);
BlockFlattener{}(ast);
FunctionGrouper{}(ast);
EquivalentFunctionCombiner::run(ast);
2019-01-31 13:44:57 +00:00
UnusedPruner::runUntilStabilised(*_dialect, ast, reservedIdentifiers);
ForLoopInitRewriter{}(ast);
BlockFlattener{}(ast);
2019-01-31 13:44:57 +00:00
StructuralSimplifier{*_dialect}(ast);
BlockFlattener{}(ast);
// None of the above can make stack problems worse.
2018-10-16 19:39:22 +00:00
2019-01-31 13:44:57 +00:00
NameDispenser dispenser{*_dialect, ast};
2018-10-16 19:39:22 +00:00
size_t codeSize = 0;
for (size_t rounds = 0; rounds < 12; ++rounds)
2018-10-16 19:39:22 +00:00
{
{
size_t newSize = CodeSize::codeSizeIncludingFunctions(ast);
if (newSize == codeSize)
break;
codeSize = newSize;
}
{
// Turn into SSA and simplify
ExpressionSplitter{*_dialect, dispenser}(ast);
SSATransform::run(ast, dispenser);
RedundantAssignEliminator::run(*_dialect, ast);
RedundantAssignEliminator::run(*_dialect, ast);
ExpressionSimplifier::run(*_dialect, ast);
CommonSubexpressionEliminator{*_dialect}(ast);
}
{
// still in SSA, perform structural simplification
StructuralSimplifier{*_dialect}(ast);
BlockFlattener{}(ast);
UnusedPruner::runUntilStabilised(*_dialect, ast, reservedIdentifiers);
}
{
// simplify again
CommonSubexpressionEliminator{*_dialect}(ast);
UnusedPruner::runUntilStabilised(*_dialect, ast, reservedIdentifiers);
}
{
// reverse SSA
SSAReverser::run(ast);
CommonSubexpressionEliminator{*_dialect}(ast);
UnusedPruner::runUntilStabilised(*_dialect, ast, reservedIdentifiers);
ExpressionJoiner::run(ast);
ExpressionJoiner::run(ast);
}
// should have good "compilability" property here.
{
// run functional expression inliner
ExpressionInliner(*_dialect, ast).run();
UnusedPruner::runUntilStabilised(*_dialect, ast, reservedIdentifiers);
}
{
// Turn into SSA again and simplify
ExpressionSplitter{*_dialect, dispenser}(ast);
SSATransform::run(ast, dispenser);
RedundantAssignEliminator::run(*_dialect, ast);
RedundantAssignEliminator::run(*_dialect, ast);
CommonSubexpressionEliminator{*_dialect}(ast);
}
{
// run full inliner
FunctionGrouper{}(ast);
EquivalentFunctionCombiner::run(ast);
FullInliner{ast, dispenser}.run();
BlockFlattener{}(ast);
}
{
// SSA plus simplify
SSATransform::run(ast, dispenser);
RedundantAssignEliminator::run(*_dialect, ast);
RedundantAssignEliminator::run(*_dialect, ast);
ExpressionSimplifier::run(*_dialect, ast);
StructuralSimplifier{*_dialect}(ast);
BlockFlattener{}(ast);
CommonSubexpressionEliminator{*_dialect}(ast);
SSATransform::run(ast, dispenser);
RedundantAssignEliminator::run(*_dialect, ast);
RedundantAssignEliminator::run(*_dialect, ast);
UnusedPruner::runUntilStabilised(*_dialect, ast, reservedIdentifiers);
CommonSubexpressionEliminator{*_dialect}(ast);
}
2018-10-16 19:39:22 +00:00
}
// Make source short and pretty.
2018-10-16 19:39:22 +00:00
ExpressionJoiner::run(ast);
2019-01-31 13:44:57 +00:00
Rematerialiser::run(*_dialect, ast);
UnusedPruner::runUntilStabilised(*_dialect, ast, reservedIdentifiers);
2018-10-16 19:39:22 +00:00
ExpressionJoiner::run(ast);
2019-01-31 13:44:57 +00:00
UnusedPruner::runUntilStabilised(*_dialect, ast, reservedIdentifiers);
2018-10-16 19:39:22 +00:00
ExpressionJoiner::run(ast);
2019-01-31 13:44:57 +00:00
UnusedPruner::runUntilStabilised(*_dialect, ast, reservedIdentifiers);
2019-01-16 10:44:45 +00:00
2019-01-17 15:11:55 +00:00
SSAReverser::run(ast);
2019-01-31 13:44:57 +00:00
CommonSubexpressionEliminator{*_dialect}(ast);
UnusedPruner::runUntilStabilised(*_dialect, ast, reservedIdentifiers);
2019-01-16 10:44:45 +00:00
2018-10-16 19:39:22 +00:00
ExpressionJoiner::run(ast);
2019-01-31 13:44:57 +00:00
Rematerialiser::run(*_dialect, ast);
UnusedPruner::runUntilStabilised(*_dialect, ast, reservedIdentifiers);
2018-10-16 19:39:22 +00:00
FunctionGrouper{}(ast);
2019-02-04 16:30:29 +00:00
StackCompressor::run(_dialect, ast);
BlockFlattener{}(ast);
VarNameCleaner{ast, *_dialect, reservedIdentifiers}(ast);
yul::AsmAnalyzer::analyzeStrictAssertCorrect(_dialect, ast);
2019-02-04 16:30:29 +00:00
2018-10-16 19:39:22 +00:00
_ast = std::move(ast);
}