solidity/libyul/optimiser/FunctionGrouper.cpp

61 lines
1.8 KiB
C++
Raw Normal View History

2017-12-04 15:42:18 +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
2017-12-04 15:42:18 +00:00
/**
2017-12-18 13:56:56 +00:00
* Optimiser component that changes the code of a block so that all non-function definition
* statements are moved to a block of their own followed by all function definitions.
2017-12-04 15:42:18 +00:00
*/
2018-10-15 09:52:35 +00:00
#include <libyul/optimiser/FunctionGrouper.h>
2017-12-04 15:42:18 +00:00
#include <libyul/AST.h>
2017-12-04 15:42:18 +00:00
using namespace std;
2019-12-11 16:31:36 +00:00
using namespace solidity;
using namespace solidity::yul;
2017-12-04 15:42:18 +00:00
void FunctionGrouper::operator()(Block& _block)
{
2019-01-08 14:03:40 +00:00
if (alreadyGrouped(_block))
return;
2017-12-04 15:42:18 +00:00
vector<Statement> reordered;
2021-04-27 14:53:04 +00:00
reordered.emplace_back(Block{_block.debugData, {}});
2017-12-04 15:42:18 +00:00
for (auto&& statement: _block.statements)
{
if (holds_alternative<FunctionDefinition>(statement))
2017-12-04 15:42:18 +00:00
reordered.emplace_back(std::move(statement));
else
std::get<Block>(reordered.front()).statements.emplace_back(std::move(statement));
2017-12-04 15:42:18 +00:00
}
_block.statements = std::move(reordered);
}
2019-01-08 14:03:40 +00:00
bool FunctionGrouper::alreadyGrouped(Block const& _block)
{
if (_block.statements.empty())
return false;
if (!holds_alternative<Block>(_block.statements.front()))
2019-01-08 14:03:40 +00:00
return false;
for (size_t i = 1; i < _block.statements.size(); ++i)
if (!holds_alternative<FunctionDefinition>(_block.statements.at(i)))
2019-01-08 14:03:40 +00:00
return false;
return true;
}