solidity/libyul/optimiser/FullInliner.cpp

244 lines
7.9 KiB
C++
Raw Normal View History

2017-12-07 14:43:23 +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 component that performs function inlining for arbitrary functions.
*/
2018-10-15 09:52:35 +00:00
#include <libyul/optimiser/FullInliner.h>
2017-12-07 14:43:23 +00:00
2018-10-15 09:52:35 +00:00
#include <libyul/optimiser/ASTCopier.h>
#include <libyul/optimiser/ASTWalker.h>
#include <libyul/optimiser/NameCollector.h>
2018-10-02 08:46:59 +00:00
#include <libyul/optimiser/Utilities.h>
2018-01-22 23:06:55 +00:00
#include <libyul/optimiser/Metrics.h>
#include <libyul/optimiser/SSAValueTracker.h>
2018-10-15 09:52:35 +00:00
#include <libyul/Exceptions.h>
#include <libyul/AsmData.h>
2017-12-07 14:43:23 +00:00
#include <libdevcore/CommonData.h>
2018-10-02 08:46:59 +00:00
#include <libdevcore/Visitor.h>
2017-12-07 14:43:23 +00:00
#include <boost/range/adaptor/reversed.hpp>
using namespace std;
using namespace dev;
using namespace yul;
2017-12-07 14:43:23 +00:00
using namespace dev::solidity;
2018-10-16 19:38:47 +00:00
FullInliner::FullInliner(Block& _ast, NameDispenser& _dispenser):
m_ast(_ast), m_nameDispenser(_dispenser)
2017-12-07 14:43:23 +00:00
{
2018-01-22 23:06:55 +00:00
// Determine constants
SSAValueTracker tracker;
tracker(m_ast);
for (auto const& ssaValue: tracker.values())
if (ssaValue.second && ssaValue.second->type() == typeid(Literal))
m_constants.emplace(ssaValue.first);
2018-01-22 23:06:55 +00:00
// Store size of global statements.
m_functionSizes[YulString{}] = CodeSize::codeSize(_ast);
map<YulString, size_t> references = ReferencesCounter::countReferences(m_ast);
2018-10-16 19:38:47 +00:00
for (auto& statement: m_ast.statements)
2017-12-07 14:43:23 +00:00
{
2018-10-16 19:38:47 +00:00
if (statement.type() != typeid(FunctionDefinition))
continue;
FunctionDefinition& fun = boost::get<FunctionDefinition>(statement);
2017-12-07 14:43:23 +00:00
m_functions[fun.name] = &fun;
2018-01-22 23:06:55 +00:00
// Always inline functions that are only called once.
if (references[fun.name] == 1)
m_singleUse.emplace(fun.name);
2018-01-22 23:06:55 +00:00
updateCodeSize(fun);
2017-12-07 14:43:23 +00:00
}
}
void FullInliner::run()
{
2018-10-16 19:38:47 +00:00
for (auto& statement: m_ast.statements)
if (statement.type() == typeid(Block))
handleBlock({}, boost::get<Block>(statement));
2018-10-02 08:46:59 +00:00
2018-01-22 23:06:55 +00:00
// TODO it might be good to determine a visiting order:
// first handle functions that are called from many places.
2018-10-16 15:21:14 +00:00
for (auto const& fun: m_functions)
2018-01-22 23:06:55 +00:00
{
2018-10-16 15:21:14 +00:00
handleBlock(fun.second->name, fun.second->body);
2018-01-22 23:06:55 +00:00
updateCodeSize(*fun.second);
}
}
void FullInliner::updateCodeSize(FunctionDefinition& fun)
{
m_functionSizes[fun.name] = CodeSize::codeSize(fun.body);
2017-12-07 14:43:23 +00:00
}
void FullInliner::handleBlock(YulString _currentFunctionName, Block& _block)
2017-12-07 14:43:23 +00:00
{
2018-10-02 08:46:59 +00:00
InlineModifier{*this, m_nameDispenser, _currentFunctionName}(_block);
2017-12-07 14:43:23 +00:00
}
bool FullInliner::shallInline(FunctionCall const& _funCall, YulString _callSite)
2018-01-22 23:06:55 +00:00
{
// No recursive inlining
if (_funCall.functionName.name == _callSite)
return false;
FunctionDefinition* calledFunction = function(_funCall.functionName.name);
if (!calledFunction)
return false;
// Do not inline into already big functions.
if (m_functionSizes.at(_callSite) > 100)
return false;
if (m_singleUse.count(calledFunction->name))
2018-01-22 23:06:55 +00:00
return true;
// Constant arguments might provide a means for further optimization, so they cause a bonus.
bool constantArg = false;
for (auto const& argument: _funCall.arguments)
if (argument.type() == typeid(Literal) || (
argument.type() == typeid(Identifier) &&
m_constants.count(boost::get<Identifier>(argument).name)
))
{
constantArg = true;
break;
}
size_t size = m_functionSizes.at(calledFunction->name);
return (size < 10 || (constantArg && size < 30));
}
void FullInliner::tentativelyUpdateCodeSize(YulString _function, YulString _callSite)
{
m_functionSizes.at(_callSite) += m_functionSizes.at(_function);
2018-01-22 23:06:55 +00:00
}
2017-12-07 14:43:23 +00:00
void InlineModifier::operator()(Block& _block)
{
2018-10-02 08:46:59 +00:00
function<boost::optional<vector<Statement>>(Statement&)> f = [&](Statement& _statement) -> boost::optional<vector<Statement>> {
visit(_statement);
return tryInlineStatement(_statement);
};
iterateReplacing(_block.statements, f);
2017-12-07 14:43:23 +00:00
}
2018-10-02 08:46:59 +00:00
boost::optional<vector<Statement>> InlineModifier::tryInlineStatement(Statement& _statement)
2017-12-07 14:43:23 +00:00
{
2018-10-02 08:46:59 +00:00
// Only inline for expression statements, assignments and variable declarations.
Expression* e = boost::apply_visitor(GenericFallbackReturnsVisitor<Expression*, ExpressionStatement, Assignment, VariableDeclaration>(
[](ExpressionStatement& _s) { return &_s.expression; },
[](Assignment& _s) { return _s.value.get(); },
[](VariableDeclaration& _s) { return _s.value.get(); }
), _statement);
if (e)
2017-12-07 14:43:23 +00:00
{
2018-10-02 08:46:59 +00:00
// Only inline direct function calls.
FunctionCall* funCall = boost::apply_visitor(GenericFallbackReturnsVisitor<FunctionCall*, FunctionCall&>(
[](FunctionCall& _e) { return &_e; }
), *e);
2018-01-22 23:06:55 +00:00
if (funCall && m_driver.shallInline(*funCall, m_currentFunction))
return performInline(_statement, *funCall);
}
2018-10-02 08:46:59 +00:00
return {};
}
2018-10-16 15:21:14 +00:00
vector<Statement> InlineModifier::performInline(Statement& _statement, FunctionCall& _funCall)
2017-12-07 14:43:23 +00:00
{
2018-10-02 08:46:59 +00:00
vector<Statement> newStatements;
map<YulString, YulString> variableReplacements;
2018-10-02 08:46:59 +00:00
FunctionDefinition* function = m_driver.function(_funCall.functionName.name);
assertThrow(!!function, OptimizerException, "Attempt to inline invalid function.");
2018-10-16 15:21:14 +00:00
m_driver.tentativelyUpdateCodeSize(function->name, m_currentFunction);
2018-12-13 14:38:14 +00:00
static Expression const zero{Literal{{}, LiteralKind::Number, YulString{"0"}, {}}};
2018-10-02 08:46:59 +00:00
// helper function to create a new variable that is supposed to model
// an existing variable.
auto newVariable = [&](TypedName const& _existingVariable, Expression* _value) {
YulString newName = m_nameDispenser.newName(_existingVariable.name, function->name);
2018-10-02 08:46:59 +00:00
variableReplacements[_existingVariable.name] = newName;
VariableDeclaration varDecl{_funCall.location, {{_funCall.location, newName, _existingVariable.type}}, {}};
if (_value)
varDecl.value = make_shared<Expression>(std::move(*_value));
2018-12-13 14:38:14 +00:00
else
varDecl.value = make_shared<Expression>(zero);
2018-10-02 08:46:59 +00:00
newStatements.emplace_back(std::move(varDecl));
};
for (size_t i = 0; i < _funCall.arguments.size(); ++i)
newVariable(function->parameters[i], &_funCall.arguments[i]);
for (auto const& var: function->returnVariables)
2018-10-02 08:46:59 +00:00
newVariable(var, nullptr);
Statement newBody = BodyCopier(m_nameDispenser, function->name, variableReplacements)(function->body);
2018-10-02 08:46:59 +00:00
newStatements += std::move(boost::get<Block>(newBody).statements);
boost::apply_visitor(GenericFallbackVisitor<Assignment, VariableDeclaration>{
[&](Assignment& _assignment)
2017-12-07 14:43:23 +00:00
{
2018-10-02 08:46:59 +00:00
for (size_t i = 0; i < _assignment.variableNames.size(); ++i)
newStatements.emplace_back(Assignment{
_assignment.location,
{_assignment.variableNames[i]},
make_shared<Expression>(Identifier{
_assignment.location,
variableReplacements.at(function->returnVariables[i].name)
2018-10-02 08:46:59 +00:00
})
});
},
[&](VariableDeclaration& _varDecl)
2017-12-07 14:43:23 +00:00
{
2018-10-02 08:46:59 +00:00
for (size_t i = 0; i < _varDecl.variables.size(); ++i)
newStatements.emplace_back(VariableDeclaration{
_varDecl.location,
{std::move(_varDecl.variables[i])},
make_shared<Expression>(Identifier{
_varDecl.location,
variableReplacements.at(function->returnVariables[i].name)
2018-10-02 08:46:59 +00:00
})
});
2017-12-07 14:43:23 +00:00
}
2018-10-02 08:46:59 +00:00
// nothing to be done for expression statement
}, _statement);
return newStatements;
2017-12-07 14:43:23 +00:00
}
Statement BodyCopier::operator()(VariableDeclaration const& _varDecl)
{
for (auto const& var: _varDecl.variables)
m_variableReplacements[var.name] = m_nameDispenser.newName(var.name, m_varNamePrefix);
2017-12-07 14:43:23 +00:00
return ASTCopier::operator()(_varDecl);
}
Statement BodyCopier::operator()(FunctionDefinition const& _funDef)
{
2018-05-09 09:43:14 +00:00
assertThrow(false, OptimizerException, "Function hoisting has to be done before function inlining.");
2017-12-07 14:43:23 +00:00
return _funDef;
}
YulString BodyCopier::translateIdentifier(YulString _name)
2017-12-07 14:43:23 +00:00
{
if (m_variableReplacements.count(_name))
return m_variableReplacements.at(_name);
else
return _name;
}