2019-03-28 13:18:17 +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/>.
|
|
|
|
*/
|
2020-07-17 14:54:12 +00:00
|
|
|
// SPDX-License-Identifier: GPL-3.0
|
2019-03-28 13:18:17 +00:00
|
|
|
/**
|
|
|
|
* Optimisation stage that removes unreachable code.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <libyul/optimiser/DeadCodeEliminator.h>
|
2019-05-13 09:00:45 +00:00
|
|
|
#include <libyul/optimiser/Semantics.h>
|
2019-09-23 14:32:50 +00:00
|
|
|
#include <libyul/optimiser/OptimiserStep.h>
|
2021-10-05 16:46:49 +00:00
|
|
|
#include <libyul/ControlFlowSideEffectsCollector.h>
|
2020-10-29 14:00:27 +00:00
|
|
|
#include <libyul/AST.h>
|
2019-03-28 13:18:17 +00:00
|
|
|
|
|
|
|
#include <libevmasm/SemanticInformation.h>
|
|
|
|
|
|
|
|
#include <algorithm>
|
2021-09-16 14:33:28 +00:00
|
|
|
#include <limits>
|
2019-03-28 13:18:17 +00:00
|
|
|
|
|
|
|
using namespace std;
|
2019-12-11 16:31:36 +00:00
|
|
|
using namespace solidity;
|
|
|
|
using namespace solidity::util;
|
|
|
|
using namespace solidity::yul;
|
2019-03-28 13:18:17 +00:00
|
|
|
|
2019-09-23 14:32:50 +00:00
|
|
|
void DeadCodeEliminator::run(OptimiserStepContext& _context, Block& _ast)
|
|
|
|
{
|
2021-10-05 16:46:49 +00:00
|
|
|
ControlFlowSideEffectsCollector sideEffects(_context.dialect, _ast);
|
|
|
|
DeadCodeEliminator{
|
|
|
|
_context.dialect,
|
|
|
|
sideEffects.functionSideEffects()
|
|
|
|
}(_ast);
|
2019-09-23 14:32:50 +00:00
|
|
|
}
|
|
|
|
|
2019-04-15 13:15:48 +00:00
|
|
|
void DeadCodeEliminator::operator()(ForLoop& _for)
|
|
|
|
{
|
|
|
|
yulAssert(_for.pre.statements.empty(), "DeadCodeEliminator needs ForLoopInitRewriter as a prerequisite.");
|
|
|
|
ASTModifier::operator()(_for);
|
|
|
|
}
|
|
|
|
|
2019-03-28 13:18:17 +00:00
|
|
|
void DeadCodeEliminator::operator()(Block& _block)
|
|
|
|
{
|
2019-05-13 09:00:45 +00:00
|
|
|
TerminationFinder::ControlFlow controlFlowChange;
|
|
|
|
size_t index;
|
2021-10-05 16:46:49 +00:00
|
|
|
tie(controlFlowChange, index) = TerminationFinder{m_dialect, &m_functionSideEffects}.firstUnconditionalControlFlowChange(_block.statements);
|
2019-05-13 09:00:45 +00:00
|
|
|
|
|
|
|
// Erase everything after the terminating statement that is not a function definition.
|
2020-06-02 13:34:28 +00:00
|
|
|
if (controlFlowChange != TerminationFinder::ControlFlow::FlowOut && index != std::numeric_limits<size_t>::max())
|
2019-05-13 09:00:45 +00:00
|
|
|
_block.statements.erase(
|
|
|
|
remove_if(
|
2020-06-02 13:34:28 +00:00
|
|
|
_block.statements.begin() + static_cast<ptrdiff_t>(index) + 1,
|
2019-05-13 09:00:45 +00:00
|
|
|
_block.statements.end(),
|
2019-11-19 15:42:49 +00:00
|
|
|
[] (Statement const& _s) { return !holds_alternative<yul::FunctionDefinition>(_s); }
|
2019-03-28 13:18:17 +00:00
|
|
|
),
|
2019-05-13 09:00:45 +00:00
|
|
|
_block.statements.end()
|
2019-03-28 13:18:17 +00:00
|
|
|
);
|
|
|
|
|
|
|
|
ASTModifier::operator()(_block);
|
|
|
|
}
|