mirror of
https://github.com/ethereum/solidity
synced 2023-10-03 13:03:40 +00:00
Merge pull request #7238 from ethereum/sideEffectsPropagator
[Yul] Side effects propagator
This commit is contained in:
commit
276b275cdc
@ -78,17 +78,18 @@ private:
|
|||||||
/**
|
/**
|
||||||
* Generic breadth first search.
|
* Generic breadth first search.
|
||||||
*
|
*
|
||||||
|
* Note that V needs to be a comparable value type. If it is not, use a pointer type,
|
||||||
|
* but note that this might lead to non-deterministic traversal.
|
||||||
|
*
|
||||||
* Example: Gather all (recursive) children in a graph starting at (and including) ``root``:
|
* Example: Gather all (recursive) children in a graph starting at (and including) ``root``:
|
||||||
*
|
*
|
||||||
* Node const* root = ...;
|
* Node const* root = ...;
|
||||||
* std::set<Node> allNodes = BreadthFirstSearch<Node>{{root}}.run([](Node const& _node, auto&& _addChild) {
|
* std::set<Node const*> allNodes = BreadthFirstSearch<Node const*>{{root}}.run([](Node const* _node, auto&& _addChild) {
|
||||||
* // Potentially process ``_node``.
|
* // Potentially process ``_node``.
|
||||||
* for (Node const& _child: _node.children())
|
* for (Node const& _child: _node->children())
|
||||||
* // Potentially filter the children to be visited.
|
* // Potentially filter the children to be visited.
|
||||||
* _addChild(_child);
|
* _addChild(&_child);
|
||||||
* }).visited;
|
* }).visited;
|
||||||
*
|
|
||||||
* Note that the order of the traversal is *non-deterministic* (the children are stored in a std::set of pointers).
|
|
||||||
*/
|
*/
|
||||||
template<typename V>
|
template<typename V>
|
||||||
struct BreadthFirstSearch
|
struct BreadthFirstSearch
|
||||||
@ -102,20 +103,20 @@ struct BreadthFirstSearch
|
|||||||
{
|
{
|
||||||
while (!verticesToTraverse.empty())
|
while (!verticesToTraverse.empty())
|
||||||
{
|
{
|
||||||
V const* v = *verticesToTraverse.begin();
|
V v = *verticesToTraverse.begin();
|
||||||
verticesToTraverse.erase(verticesToTraverse.begin());
|
verticesToTraverse.erase(verticesToTraverse.begin());
|
||||||
visited.insert(v);
|
visited.insert(v);
|
||||||
|
|
||||||
_forEachChild(*v, [this](V const& _vertex) {
|
_forEachChild(v, [this](V _vertex) {
|
||||||
if (!visited.count(&_vertex))
|
if (!visited.count(_vertex))
|
||||||
verticesToTraverse.insert(&_vertex);
|
verticesToTraverse.emplace(std::move(_vertex));
|
||||||
});
|
});
|
||||||
}
|
}
|
||||||
return *this;
|
return *this;
|
||||||
}
|
}
|
||||||
|
|
||||||
std::set<V const*> verticesToTraverse;
|
std::set<V> verticesToTraverse;
|
||||||
std::set<V const*> visited{};
|
std::set<V> visited{};
|
||||||
};
|
};
|
||||||
|
|
||||||
}
|
}
|
||||||
|
@ -151,22 +151,22 @@ void ControlFlowAnalyzer::checkUninitializedAccess(CFGNode const* _entry, CFGNod
|
|||||||
void ControlFlowAnalyzer::checkUnreachable(CFGNode const* _entry, CFGNode const* _exit, CFGNode const* _revert) const
|
void ControlFlowAnalyzer::checkUnreachable(CFGNode const* _entry, CFGNode const* _exit, CFGNode const* _revert) const
|
||||||
{
|
{
|
||||||
// collect all nodes reachable from the entry point
|
// collect all nodes reachable from the entry point
|
||||||
std::set<CFGNode const*> reachable = BreadthFirstSearch<CFGNode>{{_entry}}.run(
|
std::set<CFGNode const*> reachable = BreadthFirstSearch<CFGNode const*>{{_entry}}.run(
|
||||||
[](CFGNode const& _node, auto&& _addChild) {
|
[](CFGNode const* _node, auto&& _addChild) {
|
||||||
for (CFGNode const* exit: _node.exits)
|
for (CFGNode const* exit: _node->exits)
|
||||||
_addChild(*exit);
|
_addChild(exit);
|
||||||
}
|
}
|
||||||
).visited;
|
).visited;
|
||||||
|
|
||||||
// traverse all paths backwards from exit and revert
|
// traverse all paths backwards from exit and revert
|
||||||
// and extract (valid) source locations of unreachable nodes into sorted set
|
// and extract (valid) source locations of unreachable nodes into sorted set
|
||||||
std::set<SourceLocation> unreachable;
|
std::set<SourceLocation> unreachable;
|
||||||
BreadthFirstSearch<CFGNode>{{_exit, _revert}}.run(
|
BreadthFirstSearch<CFGNode const*>{{_exit, _revert}}.run(
|
||||||
[&](CFGNode const& _node, auto&& _addChild) {
|
[&](CFGNode const* _node, auto&& _addChild) {
|
||||||
if (!reachable.count(&_node) && !_node.location.isEmpty())
|
if (!reachable.count(_node) && !_node->location.isEmpty())
|
||||||
unreachable.insert(_node.location);
|
unreachable.insert(_node->location);
|
||||||
for (CFGNode const* entry: _node.entries)
|
for (CFGNode const* entry: _node->entries)
|
||||||
_addChild(*entry);
|
_addChild(entry);
|
||||||
}
|
}
|
||||||
);
|
);
|
||||||
|
|
||||||
|
@ -73,6 +73,16 @@ struct SideEffects
|
|||||||
*this = *this + _other;
|
*this = *this + _other;
|
||||||
return *this;
|
return *this;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
bool operator==(SideEffects const& _other) const
|
||||||
|
{
|
||||||
|
return
|
||||||
|
movable == _other.movable &&
|
||||||
|
sideEffectFree == _other.sideEffectFree &&
|
||||||
|
sideEffectFreeIfNoMSize == _other.sideEffectFreeIfNoMSize &&
|
||||||
|
invalidatesStorage == _other.invalidatesStorage &&
|
||||||
|
invalidatesMemory == _other.invalidatesMemory;
|
||||||
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
}
|
}
|
||||||
|
@ -29,18 +29,24 @@ using namespace std;
|
|||||||
using namespace dev;
|
using namespace dev;
|
||||||
using namespace yul;
|
using namespace yul;
|
||||||
|
|
||||||
|
map<YulString, set<YulString>> CallGraphGenerator::callGraph(Block const& _ast)
|
||||||
|
{
|
||||||
|
CallGraphGenerator gen;
|
||||||
|
gen(_ast);
|
||||||
|
return std::move(gen.m_callGraph);
|
||||||
|
}
|
||||||
|
|
||||||
void CallGraphGenerator::operator()(FunctionalInstruction const& _functionalInstruction)
|
void CallGraphGenerator::operator()(FunctionalInstruction const& _functionalInstruction)
|
||||||
{
|
{
|
||||||
m_callGraph.insert(m_currentFunction, YulString{
|
string name = dev::eth::instructionInfo(_functionalInstruction.instruction).name;
|
||||||
dev::eth::instructionInfo(_functionalInstruction.instruction).name
|
std::transform(name.begin(), name.end(), name.begin(), [](unsigned char _c) { return tolower(_c); });
|
||||||
});
|
m_callGraph[m_currentFunction].insert(YulString{name});
|
||||||
ASTWalker::operator()(_functionalInstruction);
|
ASTWalker::operator()(_functionalInstruction);
|
||||||
}
|
}
|
||||||
|
|
||||||
void CallGraphGenerator::operator()(FunctionCall const& _functionCall)
|
void CallGraphGenerator::operator()(FunctionCall const& _functionCall)
|
||||||
{
|
{
|
||||||
m_callGraph.insert(m_currentFunction, _functionCall.functionName.name);
|
m_callGraph[m_currentFunction].insert(_functionCall.functionName.name);
|
||||||
ASTWalker::operator()(_functionCall);
|
ASTWalker::operator()(_functionCall);
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -48,7 +54,14 @@ void CallGraphGenerator::operator()(FunctionDefinition const& _functionDefinitio
|
|||||||
{
|
{
|
||||||
YulString previousFunction = m_currentFunction;
|
YulString previousFunction = m_currentFunction;
|
||||||
m_currentFunction = _functionDefinition.name;
|
m_currentFunction = _functionDefinition.name;
|
||||||
|
yulAssert(m_callGraph.count(m_currentFunction) == 0, "");
|
||||||
|
m_callGraph[m_currentFunction] = {};
|
||||||
ASTWalker::operator()(_functionDefinition);
|
ASTWalker::operator()(_functionDefinition);
|
||||||
m_currentFunction = previousFunction;
|
m_currentFunction = previousFunction;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
CallGraphGenerator::CallGraphGenerator()
|
||||||
|
{
|
||||||
|
m_callGraph[YulString{}] = {};
|
||||||
|
}
|
||||||
|
|
||||||
|
@ -40,8 +40,7 @@ namespace yul
|
|||||||
class CallGraphGenerator: public ASTWalker
|
class CallGraphGenerator: public ASTWalker
|
||||||
{
|
{
|
||||||
public:
|
public:
|
||||||
/// @returns the call graph of the visited AST.
|
static std::map<YulString, std::set<YulString>> callGraph(Block const& _ast);
|
||||||
InvertibleRelation<YulString> const& callGraph() const { return m_callGraph; }
|
|
||||||
|
|
||||||
using ASTWalker::operator();
|
using ASTWalker::operator();
|
||||||
void operator()(FunctionalInstruction const& _functionalInstruction) override;
|
void operator()(FunctionalInstruction const& _functionalInstruction) override;
|
||||||
@ -49,7 +48,9 @@ public:
|
|||||||
void operator()(FunctionDefinition const& _functionDefinition) override;
|
void operator()(FunctionDefinition const& _functionDefinition) override;
|
||||||
|
|
||||||
private:
|
private:
|
||||||
InvertibleRelation<YulString> m_callGraph;
|
CallGraphGenerator();
|
||||||
|
|
||||||
|
std::map<YulString, std::set<YulString>> m_callGraph;
|
||||||
/// The name of the function we are currently visiting during traversal.
|
/// The name of the function we are currently visiting during traversal.
|
||||||
YulString m_currentFunction;
|
YulString m_currentFunction;
|
||||||
};
|
};
|
||||||
|
@ -28,6 +28,7 @@
|
|||||||
#include <libevmasm/SemanticInformation.h>
|
#include <libevmasm/SemanticInformation.h>
|
||||||
|
|
||||||
#include <libdevcore/CommonData.h>
|
#include <libdevcore/CommonData.h>
|
||||||
|
#include <libdevcore/Algorithms.h>
|
||||||
|
|
||||||
using namespace std;
|
using namespace std;
|
||||||
using namespace dev;
|
using namespace dev;
|
||||||
@ -93,6 +94,33 @@ void MSizeFinder::operator()(FunctionCall const& _functionCall)
|
|||||||
m_msizeFound = true;
|
m_msizeFound = true;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
map<YulString, SideEffects> SideEffectsPropagator::sideEffects(
|
||||||
|
Dialect const& _dialect,
|
||||||
|
map<YulString, std::set<YulString>> const& _directCallGraph
|
||||||
|
)
|
||||||
|
{
|
||||||
|
map<YulString, SideEffects> ret;
|
||||||
|
for (auto const& call: _directCallGraph)
|
||||||
|
{
|
||||||
|
YulString funName = call.first;
|
||||||
|
SideEffects sideEffects;
|
||||||
|
BreadthFirstSearch<YulString>{call.second, {funName}}.run(
|
||||||
|
[&](YulString _function, auto&& _addChild) {
|
||||||
|
if (sideEffects == SideEffects::worst())
|
||||||
|
return;
|
||||||
|
if (BuiltinFunction const* f = _dialect.builtin(_function))
|
||||||
|
sideEffects += f->sideEffects;
|
||||||
|
else
|
||||||
|
for (YulString callee: _directCallGraph.at(_function))
|
||||||
|
_addChild(callee);
|
||||||
|
}
|
||||||
|
);
|
||||||
|
ret[funName] = sideEffects;
|
||||||
|
}
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
|
||||||
MovableChecker::MovableChecker(Dialect const& _dialect, Expression const& _expression):
|
MovableChecker::MovableChecker(Dialect const& _dialect, Expression const& _expression):
|
||||||
MovableChecker(_dialect)
|
MovableChecker(_dialect)
|
||||||
{
|
{
|
||||||
|
@ -62,6 +62,21 @@ private:
|
|||||||
SideEffects m_sideEffects;
|
SideEffects m_sideEffects;
|
||||||
};
|
};
|
||||||
|
|
||||||
|
/**
|
||||||
|
* This class can be used to determine the side-effects of user-defined functions.
|
||||||
|
*
|
||||||
|
* It is given a dialect and a mapping that represents the direct calls from user-defined
|
||||||
|
* functions to other user-defined functions and built-in functions.
|
||||||
|
*/
|
||||||
|
class SideEffectsPropagator
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
static std::map<YulString, SideEffects> sideEffects(
|
||||||
|
Dialect const& _dialect,
|
||||||
|
std::map<YulString, std::set<YulString>> const& _directCallGraph
|
||||||
|
);
|
||||||
|
};
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Class that can be used to find out if certain code contains the MSize instruction.
|
* Class that can be used to find out if certain code contains the MSize instruction.
|
||||||
*
|
*
|
||||||
|
@ -27,6 +27,7 @@
|
|||||||
#include <test/libyul/YulOptimizerTest.h>
|
#include <test/libyul/YulOptimizerTest.h>
|
||||||
#include <test/libyul/YulInterpreterTest.h>
|
#include <test/libyul/YulInterpreterTest.h>
|
||||||
#include <test/libyul/ObjectCompilerTest.h>
|
#include <test/libyul/ObjectCompilerTest.h>
|
||||||
|
#include <test/libyul/FunctionSideEffects.h>
|
||||||
|
|
||||||
#include <boost/filesystem.hpp>
|
#include <boost/filesystem.hpp>
|
||||||
|
|
||||||
@ -56,6 +57,7 @@ Testsuite const g_interactiveTestsuites[] = {
|
|||||||
{"Yul Optimizer", "libyul", "yulOptimizerTests", false, false, &yul::test::YulOptimizerTest::create},
|
{"Yul Optimizer", "libyul", "yulOptimizerTests", false, false, &yul::test::YulOptimizerTest::create},
|
||||||
{"Yul Interpreter", "libyul", "yulInterpreterTests", false, false, &yul::test::YulInterpreterTest::create},
|
{"Yul Interpreter", "libyul", "yulInterpreterTests", false, false, &yul::test::YulInterpreterTest::create},
|
||||||
{"Yul Object Compiler", "libyul", "objectCompiler", false, false, &yul::test::ObjectCompilerTest::create},
|
{"Yul Object Compiler", "libyul", "objectCompiler", false, false, &yul::test::ObjectCompilerTest::create},
|
||||||
|
{"Function Side Effects","libyul", "functionSideEffects", false, false, &yul::test::FunctionSideEffects::create},
|
||||||
{"Syntax", "libsolidity", "syntaxTests", false, false, &SyntaxTest::create},
|
{"Syntax", "libsolidity", "syntaxTests", false, false, &SyntaxTest::create},
|
||||||
{"Error Recovery", "libsolidity", "errorRecoveryTests", false, false, &SyntaxTest::createErrorRecovery},
|
{"Error Recovery", "libsolidity", "errorRecoveryTests", false, false, &SyntaxTest::createErrorRecovery},
|
||||||
{"Semantic", "libsolidity", "semanticTests", false, true, &SemanticTest::create},
|
{"Semantic", "libsolidity", "semanticTests", false, true, &SemanticTest::create},
|
||||||
|
125
test/libyul/FunctionSideEffects.cpp
Normal file
125
test/libyul/FunctionSideEffects.cpp
Normal file
@ -0,0 +1,125 @@
|
|||||||
|
/*
|
||||||
|
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 <test/libyul/FunctionSideEffects.h>
|
||||||
|
#include <test/Options.h>
|
||||||
|
#include <test/libyul/Common.h>
|
||||||
|
|
||||||
|
#include <libdevcore/AnsiColorized.h>
|
||||||
|
|
||||||
|
#include <libyul/SideEffects.h>
|
||||||
|
#include <libyul/optimiser/CallGraphGenerator.h>
|
||||||
|
#include <libyul/optimiser/Semantics.h>
|
||||||
|
#include <libyul/Object.h>
|
||||||
|
#include <libyul/backends/evm/EVMDialect.h>
|
||||||
|
|
||||||
|
#include <libdevcore/StringUtils.h>
|
||||||
|
|
||||||
|
#include <boost/algorithm/string.hpp>
|
||||||
|
|
||||||
|
|
||||||
|
using namespace dev;
|
||||||
|
using namespace langutil;
|
||||||
|
using namespace yul;
|
||||||
|
using namespace yul::test;
|
||||||
|
using namespace dev::solidity;
|
||||||
|
using namespace dev::solidity::test;
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
namespace
|
||||||
|
{
|
||||||
|
string toString(SideEffects const& _sideEffects)
|
||||||
|
{
|
||||||
|
vector<string> ret;
|
||||||
|
if (_sideEffects.movable)
|
||||||
|
ret.push_back("movable");
|
||||||
|
if (_sideEffects.sideEffectFree)
|
||||||
|
ret.push_back("sideEffectFree");
|
||||||
|
if (_sideEffects.sideEffectFreeIfNoMSize)
|
||||||
|
ret.push_back("sideEffectFreeIfNoMSize");
|
||||||
|
if (_sideEffects.invalidatesStorage)
|
||||||
|
ret.push_back("invalidatesStorage");
|
||||||
|
if (_sideEffects.invalidatesMemory)
|
||||||
|
ret.push_back("invalidatesMemory");
|
||||||
|
return joinHumanReadable(ret);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
FunctionSideEffects::FunctionSideEffects(string const& _filename)
|
||||||
|
{
|
||||||
|
ifstream file(_filename);
|
||||||
|
if (!file)
|
||||||
|
BOOST_THROW_EXCEPTION(runtime_error("Cannot open test input: \"" + _filename + "\"."));
|
||||||
|
file.exceptions(ios::badbit);
|
||||||
|
|
||||||
|
m_source = parseSourceAndSettings(file);
|
||||||
|
m_expectation = parseSimpleExpectations(file);}
|
||||||
|
|
||||||
|
TestCase::TestResult FunctionSideEffects::run(ostream& _stream, string const& _linePrefix, bool _formatted)
|
||||||
|
{
|
||||||
|
Object obj;
|
||||||
|
std::tie(obj.code, obj.analysisInfo) = yul::test::parse(m_source, false);
|
||||||
|
if (!obj.code)
|
||||||
|
BOOST_THROW_EXCEPTION(runtime_error("Parsing input failed."));
|
||||||
|
|
||||||
|
map<YulString, SideEffects> functionSideEffects = SideEffectsPropagator::sideEffects(
|
||||||
|
EVMDialect::strictAssemblyForEVM(langutil::EVMVersion()),
|
||||||
|
CallGraphGenerator::callGraph(*obj.code)
|
||||||
|
);
|
||||||
|
|
||||||
|
std::map<std::string, std::string> functionSideEffectsStr;
|
||||||
|
for (auto const& fun: functionSideEffects)
|
||||||
|
functionSideEffectsStr[fun.first.str()] = toString(fun.second);
|
||||||
|
|
||||||
|
m_obtainedResult.clear();
|
||||||
|
for (auto const& fun: functionSideEffectsStr)
|
||||||
|
m_obtainedResult += fun.first + ": " + fun.second + "\n";
|
||||||
|
|
||||||
|
if (m_expectation != m_obtainedResult)
|
||||||
|
{
|
||||||
|
string nextIndentLevel = _linePrefix + " ";
|
||||||
|
AnsiColorized(_stream, _formatted, {formatting::BOLD, formatting::CYAN}) << _linePrefix << "Expected result:" << endl;
|
||||||
|
printIndented(_stream, m_expectation, nextIndentLevel);
|
||||||
|
AnsiColorized(_stream, _formatted, {formatting::BOLD, formatting::CYAN}) << _linePrefix << "Obtained result:" << endl;
|
||||||
|
printIndented(_stream, m_obtainedResult, nextIndentLevel);
|
||||||
|
return TestResult::Failure;
|
||||||
|
}
|
||||||
|
return TestResult::Success;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
void FunctionSideEffects::printSource(ostream& _stream, string const& _linePrefix, bool const) const
|
||||||
|
{
|
||||||
|
printIndented(_stream, m_source, _linePrefix);
|
||||||
|
}
|
||||||
|
|
||||||
|
void FunctionSideEffects::printUpdatedExpectations(ostream& _stream, string const& _linePrefix) const
|
||||||
|
{
|
||||||
|
printIndented(_stream, m_obtainedResult, _linePrefix);
|
||||||
|
}
|
||||||
|
|
||||||
|
void FunctionSideEffects::printIndented(ostream& _stream, string const& _output, string const& _linePrefix) const
|
||||||
|
{
|
||||||
|
stringstream output(_output);
|
||||||
|
string line;
|
||||||
|
while (getline(output, line))
|
||||||
|
if (line.empty())
|
||||||
|
// Avoid trailing spaces.
|
||||||
|
_stream << boost::trim_right_copy(_linePrefix) << endl;
|
||||||
|
else
|
||||||
|
_stream << _linePrefix << line << endl;
|
||||||
|
}
|
54
test/libyul/FunctionSideEffects.h
Normal file
54
test/libyul/FunctionSideEffects.h
Normal file
@ -0,0 +1,54 @@
|
|||||||
|
/*
|
||||||
|
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/>.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include <libdevcore/AnsiColorized.h>
|
||||||
|
#include <test/TestCase.h>
|
||||||
|
|
||||||
|
#include <iosfwd>
|
||||||
|
#include <string>
|
||||||
|
#include <vector>
|
||||||
|
#include <utility>
|
||||||
|
|
||||||
|
namespace yul
|
||||||
|
{
|
||||||
|
namespace test
|
||||||
|
{
|
||||||
|
|
||||||
|
class FunctionSideEffects: public dev::solidity::test::TestCase
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
static std::unique_ptr<TestCase> create(Config const& _config)
|
||||||
|
{ return std::unique_ptr<TestCase>(new FunctionSideEffects(_config.filename)); }
|
||||||
|
explicit FunctionSideEffects(std::string const& _filename);
|
||||||
|
|
||||||
|
TestResult run(std::ostream& _stream, std::string const& _linePrefix = "", bool const _formatted = false) override;
|
||||||
|
|
||||||
|
void printSource(std::ostream& _stream, std::string const& _linePrefix = "", bool const _formatted = false) const override;
|
||||||
|
void printUpdatedExpectations(std::ostream& _stream, std::string const& _linePrefix) const override;
|
||||||
|
|
||||||
|
private:
|
||||||
|
void printIndented(std::ostream& _stream, std::string const& _output, std::string const& _linePrefix = "") const;
|
||||||
|
|
||||||
|
std::string m_source;
|
||||||
|
std::string m_expectation;
|
||||||
|
std::string m_obtainedResult;
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
|
}
|
10
test/libyul/functionSideEffects/cyclic_graph.yul
Normal file
10
test/libyul/functionSideEffects/cyclic_graph.yul
Normal file
@ -0,0 +1,10 @@
|
|||||||
|
{
|
||||||
|
function a() { b() }
|
||||||
|
function b() { c() }
|
||||||
|
function c() { b() }
|
||||||
|
}
|
||||||
|
// ----
|
||||||
|
// : movable, sideEffectFree, sideEffectFreeIfNoMSize
|
||||||
|
// a: movable, sideEffectFree, sideEffectFreeIfNoMSize
|
||||||
|
// b: movable, sideEffectFree, sideEffectFreeIfNoMSize
|
||||||
|
// c: movable, sideEffectFree, sideEffectFreeIfNoMSize
|
@ -0,0 +1,8 @@
|
|||||||
|
{
|
||||||
|
function a() { b() }
|
||||||
|
function b() { a() }
|
||||||
|
}
|
||||||
|
// ----
|
||||||
|
// : movable, sideEffectFree, sideEffectFreeIfNoMSize
|
||||||
|
// a: movable, sideEffectFree, sideEffectFreeIfNoMSize
|
||||||
|
// b: movable, sideEffectFree, sideEffectFreeIfNoMSize
|
4
test/libyul/functionSideEffects/empty.yul
Normal file
4
test/libyul/functionSideEffects/empty.yul
Normal file
@ -0,0 +1,4 @@
|
|||||||
|
{
|
||||||
|
}
|
||||||
|
// ----
|
||||||
|
// : movable, sideEffectFree, sideEffectFreeIfNoMSize
|
5
test/libyul/functionSideEffects/empty_with_sstore.yul
Normal file
5
test/libyul/functionSideEffects/empty_with_sstore.yul
Normal file
@ -0,0 +1,5 @@
|
|||||||
|
{
|
||||||
|
sstore(0, 1)
|
||||||
|
}
|
||||||
|
// ----
|
||||||
|
// : invalidatesStorage
|
22
test/libyul/functionSideEffects/multi_calls.yul
Normal file
22
test/libyul/functionSideEffects/multi_calls.yul
Normal file
@ -0,0 +1,22 @@
|
|||||||
|
{
|
||||||
|
function a() {
|
||||||
|
b()
|
||||||
|
}
|
||||||
|
function b() {
|
||||||
|
sstore(0, 1)
|
||||||
|
b()
|
||||||
|
}
|
||||||
|
function c() {
|
||||||
|
mstore(0, 1)
|
||||||
|
a()
|
||||||
|
d()
|
||||||
|
}
|
||||||
|
function d() {
|
||||||
|
}
|
||||||
|
}
|
||||||
|
// ----
|
||||||
|
// : movable, sideEffectFree, sideEffectFreeIfNoMSize
|
||||||
|
// a: invalidatesStorage
|
||||||
|
// b: invalidatesStorage
|
||||||
|
// c: invalidatesStorage, invalidatesMemory
|
||||||
|
// d: movable, sideEffectFree, sideEffectFreeIfNoMSize
|
6
test/libyul/functionSideEffects/recursive_function.yul
Normal file
6
test/libyul/functionSideEffects/recursive_function.yul
Normal file
@ -0,0 +1,6 @@
|
|||||||
|
{
|
||||||
|
function a() { a() }
|
||||||
|
}
|
||||||
|
// ----
|
||||||
|
// : movable, sideEffectFree, sideEffectFreeIfNoMSize
|
||||||
|
// a: movable, sideEffectFree, sideEffectFreeIfNoMSize
|
14
test/libyul/functionSideEffects/simple_functions.yul
Normal file
14
test/libyul/functionSideEffects/simple_functions.yul
Normal file
@ -0,0 +1,14 @@
|
|||||||
|
{
|
||||||
|
function a() {}
|
||||||
|
function f() { mstore(0, 1) }
|
||||||
|
function g() { sstore(0, 1) }
|
||||||
|
function h() { let x := msize() }
|
||||||
|
function i() { let z := mload(0) }
|
||||||
|
}
|
||||||
|
// ----
|
||||||
|
// : movable, sideEffectFree, sideEffectFreeIfNoMSize
|
||||||
|
// a: movable, sideEffectFree, sideEffectFreeIfNoMSize
|
||||||
|
// f: invalidatesMemory
|
||||||
|
// g: invalidatesStorage
|
||||||
|
// h: sideEffectFree, sideEffectFreeIfNoMSize
|
||||||
|
// i: sideEffectFreeIfNoMSize
|
40
test/libyul/functionSideEffects/structures.yul
Normal file
40
test/libyul/functionSideEffects/structures.yul
Normal file
@ -0,0 +1,40 @@
|
|||||||
|
{
|
||||||
|
if calldataload(0)
|
||||||
|
{
|
||||||
|
f()
|
||||||
|
}
|
||||||
|
g()
|
||||||
|
|
||||||
|
function f() {
|
||||||
|
pop(mload(0))
|
||||||
|
}
|
||||||
|
function g() {
|
||||||
|
if sload(0)
|
||||||
|
{
|
||||||
|
h()
|
||||||
|
}
|
||||||
|
}
|
||||||
|
function h() {
|
||||||
|
switch t()
|
||||||
|
case 1 {
|
||||||
|
i()
|
||||||
|
}
|
||||||
|
}
|
||||||
|
function t() -> x {
|
||||||
|
mstore(0, 1)
|
||||||
|
}
|
||||||
|
function i() {
|
||||||
|
sstore(0, 1)
|
||||||
|
}
|
||||||
|
function r(a) -> b {
|
||||||
|
b := mul(a, 2)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
// ----
|
||||||
|
// : invalidatesStorage, invalidatesMemory
|
||||||
|
// f: sideEffectFreeIfNoMSize
|
||||||
|
// g: invalidatesStorage, invalidatesMemory
|
||||||
|
// h: invalidatesStorage, invalidatesMemory
|
||||||
|
// i: invalidatesStorage
|
||||||
|
// r: movable, sideEffectFree, sideEffectFreeIfNoMSize
|
||||||
|
// t: invalidatesMemory
|
@ -30,6 +30,8 @@ add_executable(isoltest
|
|||||||
../libsolidity/ABIJsonTest.cpp
|
../libsolidity/ABIJsonTest.cpp
|
||||||
../libsolidity/ASTJSONTest.cpp
|
../libsolidity/ASTJSONTest.cpp
|
||||||
../libsolidity/SMTCheckerJSONTest.cpp
|
../libsolidity/SMTCheckerJSONTest.cpp
|
||||||
|
../libyul/Common.cpp
|
||||||
|
../libyul/FunctionSideEffects.cpp
|
||||||
../libyul/ObjectCompilerTest.cpp
|
../libyul/ObjectCompilerTest.cpp
|
||||||
../libyul/YulOptimizerTest.cpp
|
../libyul/YulOptimizerTest.cpp
|
||||||
../libyul/YulInterpreterTest.cpp
|
../libyul/YulInterpreterTest.cpp
|
||||||
|
Loading…
Reference in New Issue
Block a user