aboutsummaryrefslogtreecommitdiffstats
path: root/libyul/optimiser/ExpressionJoiner.cpp
blob: c3957497969bb46977709aaa57374f183e355e0d (plain) (blame)
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
/*
    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 undoes what the ExpressionSplitter did, i.e.
 * it more or less inlines variable declarations.
 */

#include <libyul/optimiser/ExpressionJoiner.h>

#include <libyul/optimiser/NameCollector.h>
#include <libyul/optimiser/Utilities.h>
#include <libyul/Exceptions.h>

#include <libsolidity/inlineasm/AsmData.h>

#include <libdevcore/CommonData.h>

#include <boost/range/adaptor/reversed.hpp>

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

void ExpressionJoiner::operator()(FunctionalInstruction& _instruction)
{
    handleArguments(_instruction.arguments);
}

void ExpressionJoiner::operator()(FunctionCall& _funCall)
{
    handleArguments(_funCall.arguments);
}

void ExpressionJoiner::operator()(If& _if)
{
    visit(*_if.condition);
    (*this)(_if.body);
}

void ExpressionJoiner::operator()(Switch& _switch)
{
    visit(*_switch.expression);
    for (auto& _case: _switch.cases)
        // Do not visit the case expression, nothing to join there.
        (*this)(_case.body);
}

void ExpressionJoiner::operator()(Block& _block)
{
    resetLatestStatementPointer();
    for (size_t i = 0; i < _block.statements.size(); ++i)
    {
        visit(_block.statements[i]);
        m_currentBlock = &_block;
        m_latestStatementInBlock = i;
    }

    removeEmptyBlocks(_block);
    resetLatestStatementPointer();
}

void ExpressionJoiner::visit(Expression& _e)
{
    if (_e.type() == typeid(Identifier))
    {
        Identifier const& identifier = boost::get<Identifier>(_e);
        if (isLatestStatementVarDeclOf(identifier) && m_references[identifier.name] == 1)
        {
            VariableDeclaration& varDecl = boost::get<VariableDeclaration>(*latestStatement());
            assertThrow(varDecl.variables.size() == 1, OptimizerException, "");
            assertThrow(varDecl.value, OptimizerException, "");

            _e = std::move(*varDecl.value);
            // Delete the variable declaration (also get the moved-from structure back into a sane state)
            *latestStatement() = Block();

            decrementLatestStatementPointer();
        }
    }
    else
        ASTModifier::visit(_e);
}

void ExpressionJoiner::run(Block& _ast)
{
    ExpressionJoiner{_ast}(_ast);
}

ExpressionJoiner::ExpressionJoiner(Block& _ast)
{
    ReferencesCounter counter;
    counter(_ast);
    m_references = counter.references();
}

void ExpressionJoiner::handleArguments(vector<Expression>& _arguments)
{
    // We have to fill from left to right, but we can only
    // fill if everything to the right is just an identifier
    // or a literal.
    // Also we only descend into function calls if everything
    // on the right is an identifier or literal.

    size_t i = _arguments.size();
    for (Expression const& arg: _arguments | boost::adaptors::reversed)
    {
        --i;
        if (arg.type() != typeid(Identifier) && arg.type() != typeid(Literal))
            break;
    }
    // i points to the last element that is neither an identifier nor a literal,
    // or to the first element if all of them are identifiers or literals.

    for (; i < _arguments.size(); ++i)
        visit(_arguments.at(i));
}

void ExpressionJoiner::decrementLatestStatementPointer()
{
    if (!m_currentBlock)
        return;
    if (m_latestStatementInBlock > 0)
        --m_latestStatementInBlock;
    else
        resetLatestStatementPointer();
}

void ExpressionJoiner::resetLatestStatementPointer()
{
    m_currentBlock = nullptr;
    m_latestStatementInBlock = size_t(-1);
}

Statement* ExpressionJoiner::latestStatement()
{
    if (!m_currentBlock)
        return nullptr;
    else
        return &m_currentBlock->statements.at(m_latestStatementInBlock);
}

bool ExpressionJoiner::isLatestStatementVarDeclOf(Identifier const& _identifier)
{
    Statement const* statement = latestStatement();
    if (!statement || statement->type() != typeid(VariableDeclaration))
        return false;
    VariableDeclaration const& varDecl = boost::get<VariableDeclaration>(*statement);
    if (varDecl.variables.size() != 1 || !varDecl.value)
        return false;
    return varDecl.variables.at(0).name == _identifier.name;
}