aboutsummaryrefslogtreecommitdiffstats
path: root/libyul/optimiser/Rematerialiser.cpp
blob: 56f6e99cccee5debaabdc468ce3ea9a1bb21debd (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
/*(
    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/>.
*/
/**
 * Optimisation stage that replaces variables by their most recently assigned expressions.
 */

#include <libyul/optimiser/Rematerialiser.h>

#include <libyul/optimiser/Metrics.h>
#include <libyul/optimiser/ASTCopier.h>
#include <libyul/optimiser/NameCollector.h>
#include <libyul/Exceptions.h>
#include <libyul/AsmData.h>

using namespace std;
using namespace dev;
using namespace yul;

void Rematerialiser::run(Dialect const& _dialect, Block& _ast)
{
    Rematerialiser{_dialect, _ast}(_ast);
}

Rematerialiser::Rematerialiser(Dialect const& _dialect, Block& _ast):
    DataFlowAnalyzer(_dialect),
    m_referenceCounts(ReferencesCounter::countReferences(_ast))
{
}

void Rematerialiser::visit(Expression& _e)
{
    if (_e.type() == typeid(Identifier))
    {
        Identifier& identifier = boost::get<Identifier>(_e);
        if (m_value.count(identifier.name))
        {
            YulString name = identifier.name;
            assertThrow(m_value.at(name), OptimizerException, "");
            auto const& value = *m_value.at(name);
            size_t refs = m_referenceCounts[name];
            size_t cost = CodeCost::codeCost(value);
            if (refs <= 1 || cost == 0 || (refs <= 5 && cost <= 1))
            {
                assertThrow(m_referenceCounts[name] > 0, OptimizerException, "");
                for (auto const& ref: m_references[name])
                    assertThrow(inScope(ref), OptimizerException, "");
                // update reference counts
                m_referenceCounts[name]--;
                for (auto const& ref: ReferencesCounter::countReferences(value))
                    m_referenceCounts[ref.first] += ref.second;
                _e = (ASTCopier{}).translate(value);
            }
        }
    }
    DataFlowAnalyzer::visit(_e);
}