mirror of
https://github.com/ethereum/solidity
synced 2023-10-03 13:03:40 +00:00
121 lines
3.4 KiB
C++
121 lines
3.4 KiB
C++
/*
|
|
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/>.
|
|
*/
|
|
#include <libyul/optimiser/SSAReverser.h>
|
|
#include <libyul/optimiser/Metrics.h>
|
|
#include <libyul/AsmData.h>
|
|
#include <libsolutil/CommonData.h>
|
|
|
|
#include <variant>
|
|
|
|
using namespace std;
|
|
using namespace solidity;
|
|
using namespace solidity::yul;
|
|
|
|
void SSAReverser::run(OptimiserStepContext&, Block& _block)
|
|
{
|
|
AssignmentCounter assignmentCounter;
|
|
assignmentCounter(_block);
|
|
SSAReverser{assignmentCounter}(_block);
|
|
}
|
|
|
|
void SSAReverser::operator()(Block& _block)
|
|
{
|
|
walkVector(_block.statements);
|
|
util::iterateReplacingWindow<2>(
|
|
_block.statements,
|
|
[&](Statement& _stmt1, Statement& _stmt2) -> std::optional<vector<Statement>>
|
|
{
|
|
auto* varDecl = std::get_if<VariableDeclaration>(&_stmt1);
|
|
|
|
if (!varDecl || varDecl->variables.size() != 1 || !varDecl->value)
|
|
return {};
|
|
|
|
// 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
|
|
)
|
|
{
|
|
// in the special case a == a_1, just remove the assignment
|
|
if (assignment->variableNames.front().name == identifier->name)
|
|
return util::make_vector<Statement>(std::move(_stmt1));
|
|
else
|
|
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),
|
|
std::make_unique<Expression>(std::move(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))
|
|
{
|
|
auto* identifier = std::get_if<Identifier>(varDecl2->value.get());
|
|
if (
|
|
varDecl2->variables.size() == 1 &&
|
|
identifier &&
|
|
identifier->name == varDecl->variables.front().name && (
|
|
m_assignmentCounter.assignmentCount(varDecl2->variables.front().name) >
|
|
m_assignmentCounter.assignmentCount(varDecl->variables.front().name)
|
|
)
|
|
)
|
|
{
|
|
auto varIdentifier2 = std::make_unique<Expression>(Identifier{
|
|
varDecl2->variables.front().location,
|
|
varDecl2->variables.front().name
|
|
});
|
|
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)
|
|
}
|
|
);
|
|
}
|
|
}
|
|
|
|
return {};
|
|
}
|
|
);
|
|
}
|