solidity/libyul/optimiser/UnusedPruner.h

68 lines
1.8 KiB
C
Raw Normal View History

2017-12-20 12:48:23 +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/>.
*/
/**
* Optimisation stage that removes unused variables and functions.
*/
#pragma once
2018-10-15 09:52:35 +00:00
#include <libyul/optimiser/ASTWalker.h>
2017-12-20 12:48:23 +00:00
#include <string>
#include <map>
#include <set>
namespace dev
{
namespace yul
2017-12-20 12:48:23 +00:00
{
/**
* Optimisation stage that removes unused variables and functions.
*
* TODO: Also remove intermediate variable assignments from movable expressions
* which are not referenced until after the next assignment to the same variable.
*
* Note that this does not remove circular references.
*
* Prerequisite: Disambiguator
*/
class UnusedPruner: public ASTModifier
{
public:
explicit UnusedPruner(Block& _ast);
using ASTModifier::operator();
virtual void operator()(Block& _block) override;
2018-02-05 17:16:08 +00:00
// @returns true iff the code changed in the previous run.
2017-12-20 12:48:23 +00:00
bool shouldRunAgain() const { return m_shouldRunAgain; }
2018-02-05 17:16:08 +00:00
// Run the pruner until the code does not change anymore.
2017-12-20 12:48:23 +00:00
static void runUntilStabilised(Block& _ast);
private:
bool used(std::string const& _name) const;
void subtractReferences(std::map<std::string, size_t> const& _subtrahend);
bool m_shouldRunAgain = false;
std::map<std::string, size_t> m_references;
};
}
}