solidity/libyul/optimiser/SSAReverser.cpp

122 lines
3.4 KiB
C++
Raw Normal View History

2019-01-16 10:44:45 +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/>.
*/
// SPDX-License-Identifier: GPL-3.0
2019-01-16 10:44:45 +00:00
#include <libyul/optimiser/SSAReverser.h>
2019-01-17 15:11:55 +00:00
#include <libyul/optimiser/Metrics.h>
#include <libyul/AST.h>
#include <libsolutil/CommonData.h>
2019-01-16 10:44:45 +00:00
#include <variant>
2019-01-16 10:44:45 +00:00
using namespace std;
2019-12-11 16:31:36 +00:00
using namespace solidity;
using namespace solidity::yul;
2019-01-16 10:44:45 +00:00
2019-09-23 14:32:50 +00:00
void SSAReverser::run(OptimiserStepContext&, Block& _block)
2019-01-17 15:11:55 +00:00
{
AssignmentCounter assignmentCounter;
assignmentCounter(_block);
SSAReverser{assignmentCounter}(_block);
}
2019-01-16 10:44:45 +00:00
void SSAReverser::operator()(Block& _block)
{
walkVector(_block.statements);
2019-12-11 16:31:36 +00:00
util::iterateReplacingWindow<2>(
2019-01-16 10:44:45 +00:00
_block.statements,
[&](Statement& _stmt1, Statement& _stmt2) -> std::optional<vector<Statement>>
2019-01-16 10:44:45 +00:00
{
auto* varDecl = std::get_if<VariableDeclaration>(&_stmt1);
if (!varDecl || varDecl->variables.size() != 1 || !varDecl->value)
return {};
2019-01-16 10:44:45 +00:00
// Replaces
// let a_1 := E
// a := a_1
// with
// a := E
// let a_1 := a
if (auto* assignment = std::get_if<Assignment>(&_stmt2))
{
auto* identifier = std::get_if<Identifier>(assignment->value.get());
if (
assignment->variableNames.size() == 1 &&
identifier &&
identifier->name == varDecl->variables.front().name
2019-01-17 15:11:55 +00:00
)
{
// in the special case a == a_1, just remove the assignment
if (assignment->variableNames.front().name == identifier->name)
2019-12-11 16:31:36 +00:00
return util::make_vector<Statement>(std::move(_stmt1));
else
2019-12-11 16:31:36 +00:00
return util::make_vector<Statement>(
Assignment{
std::move(assignment->location),
assignment->variableNames,
std::move(varDecl->value)
},
VariableDeclaration{
std::move(varDecl->location),
std::move(varDecl->variables),
2020-10-28 16:21:08 +00:00
std::make_unique<Expression>(assignment->variableNames.front())
}
);
}
}
// Replaces
// let a_1 := E
// let a := a_1
// with
// let a := E
// let a_1 := a
else if (auto* varDecl2 = std::get_if<VariableDeclaration>(&_stmt2))
2019-01-16 10:44:45 +00:00
{
auto* identifier = std::get_if<Identifier>(varDecl2->value.get());
if (
varDecl2->variables.size() == 1 &&
identifier &&
2019-01-17 15:11:55 +00:00
identifier->name == varDecl->variables.front().name && (
m_assignmentCounter.assignmentCount(varDecl2->variables.front().name) >
m_assignmentCounter.assignmentCount(varDecl->variables.front().name)
2019-02-13 15:56:46 +00:00
)
)
{
auto varIdentifier2 = std::make_unique<Expression>(Identifier{
varDecl2->variables.front().location,
varDecl2->variables.front().name
});
2019-12-11 16:31:36 +00:00
return util::make_vector<Statement>(
VariableDeclaration{
std::move(varDecl2->location),
std::move(varDecl2->variables),
std::move(varDecl->value)
},
VariableDeclaration{
std::move(varDecl->location),
std::move(varDecl->variables),
std::move(varIdentifier2)
}
);
}
2019-01-16 10:44:45 +00:00
}
2019-01-16 10:44:45 +00:00
return {};
}
);
}