libyul/optimiser/ExpressionInliner.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74

/*
    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 inside expressions.
 */

#include <libyul/optimiser/ExpressionInliner.h>

#include <libyul/optimiser/InlinableExpressionFunctionFinder.h>
#include <libyul/optimiser/Substitution.h>
#include <libyul/optimiser/Semantics.h>

#include <libsolidity/inlineasm/AsmData.h>

#include <boost/algorithm/cxx11/all_of.hpp>

using namespace std;
using namespace dev;
using namespace dev::yul;
using namespace dev::solidity;

void ExpressionInliner::run()
{
    InlinableExpressionFunctionFinder funFinder;
    funFinder(m_block);
    m_inlinableFunctions = funFinder.inlinableFunctions();

    (*this)(m_block);
}


void ExpressionInliner::operator()(FunctionDefinition& _fun)
{
    ASTModifier::operator()(_fun);
}

void ExpressionInliner::visit(Expression& _expression)
{
    ASTModifier::visit(_expression);
    if (_expression.type() == typeid(FunctionCall))
    {
        FunctionCall& funCall = boost::get<FunctionCall>(_expression);

        bool movable = boost::algorithm::all_of(
            funCall.arguments,
            [=](Expression const& _arg) { return MovableChecker(_arg).movable(); }
        );
        if (m_inlinableFunctions.count(funCall.functionName.name) && movable)
        {
            FunctionDefinition const& fun = *m_inlinableFunctions.at(funCall.functionName.name);
            map<YulString, Expression const*> substitutions;
            for (size_t i = 0; i < fun.parameters.size(); ++i)
                substitutions[fun.parameters[i].name] = &funCall.arguments[i];
            _expression = Substitution(substitutions).translate(*boost::get<Assignment>(fun.body.statements.front()).value);

            // TODO Add metric! This metric should perform well on a pair of functions who
            // call each other recursively.
        }
    }
}