mirror of
https://github.com/ethereum/solidity
synced 2023-10-03 13:03:40 +00:00
Merge pull request #11615 from ethereum/yulStackLayoutGenerator
Yul Stack Layout Generator (New Code Transform Step 2)
This commit is contained in:
Daniel Kirchner
@@ -143,6 +143,8 @@ set(libyul_sources
|
||||
libyul/ObjectCompilerTest.h
|
||||
libyul/ObjectParser.cpp
|
||||
libyul/Parser.cpp
|
||||
libyul/StackLayoutGeneratorTest.cpp
|
||||
libyul/StackLayoutGeneratorTest.h
|
||||
libyul/SyntaxTest.h
|
||||
libyul/SyntaxTest.cpp
|
||||
libyul/YulInterpreterTest.cpp
|
||||
|
||||
@@ -32,6 +32,7 @@
|
||||
#include <test/libyul/YulInterpreterTest.h>
|
||||
#include <test/libyul/ObjectCompilerTest.h>
|
||||
#include <test/libyul/FunctionSideEffects.h>
|
||||
#include <test/libyul/StackLayoutGeneratorTest.h>
|
||||
#include <test/libyul/SyntaxTest.h>
|
||||
|
||||
#include <boost/filesystem.hpp>
|
||||
@@ -61,6 +62,7 @@ Testsuite const g_interactiveTestsuites[] = {
|
||||
{"Yul Interpreter", "libyul", "yulInterpreterTests", false, false, &yul::test::YulInterpreterTest::create},
|
||||
{"Yul Object Compiler", "libyul", "objectCompiler", false, false, &yul::test::ObjectCompilerTest::create},
|
||||
{"Yul Control Flow Graph", "libyul", "yulControlFlowGraph", false, false, &yul::test::ControlFlowGraphTest::create},
|
||||
{"Yul Stack Layout", "libyul", "yulStackLayout", false, false, &yul::test::StackLayoutGeneratorTest::create},
|
||||
{"Function Side Effects", "libyul", "functionSideEffects", false, false, &yul::test::FunctionSideEffects::create},
|
||||
{"Yul Syntax", "libyul", "yulSyntaxTests", false, false, &yul::test::SyntaxTest::create},
|
||||
{"EVM Code Transform", "libyul", "evmCodeTransform", false, false, &yul::test::EVMCodeTransformTest::create, {"nooptions"}},
|
||||
|
||||
@@ -22,6 +22,7 @@
|
||||
|
||||
#include <libyul/backends/evm/ControlFlowGraph.h>
|
||||
#include <libyul/backends/evm/ControlFlowGraphBuilder.h>
|
||||
#include <libyul/backends/evm/StackHelpers.h>
|
||||
#include <libyul/Object.h>
|
||||
#include <liblangutil/SourceReferenceFormatter.h>
|
||||
|
||||
@@ -52,26 +53,6 @@ ControlFlowGraphTest::ControlFlowGraphTest(string const& _filename):
|
||||
|
||||
namespace
|
||||
{
|
||||
static std::string stackSlotToString(StackSlot const& _slot)
|
||||
{
|
||||
return std::visit(util::GenericVisitor{
|
||||
[](FunctionCallReturnLabelSlot const& _ret) -> std::string { return "RET[" + _ret.call.get().functionName.name.str() + "]"; },
|
||||
[](FunctionReturnLabelSlot const&) -> std::string { return "RET"; },
|
||||
[](VariableSlot const& _var) { return _var.variable.get().name.str(); },
|
||||
[](LiteralSlot const& _lit) { return util::toCompactHexWithPrefix(_lit.value); },
|
||||
[](TemporarySlot const& _tmp) -> std::string { return "TMP[" + _tmp.call.get().functionName.name.str() + ", " + std::to_string(_tmp.index) + "]"; },
|
||||
[](JunkSlot const&) -> std::string { return "JUNK"; }
|
||||
}, _slot);
|
||||
}
|
||||
|
||||
static std::string stackToString(Stack const& _stack)
|
||||
{
|
||||
std::string result("[ ");
|
||||
for (auto const& slot: _stack)
|
||||
result += stackSlotToString(slot) + ' ';
|
||||
result += ']';
|
||||
return result;
|
||||
}
|
||||
static std::string variableSlotToString(VariableSlot const& _slot)
|
||||
{
|
||||
return _slot.variable.get().name.str();
|
||||
|
||||
@@ -0,0 +1,267 @@
|
||||
/*
|
||||
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
|
||||
|
||||
#include <test/libyul/StackLayoutGeneratorTest.h>
|
||||
#include <test/libyul/Common.h>
|
||||
#include <test/Common.h>
|
||||
|
||||
#include <libyul/backends/evm/ControlFlowGraph.h>
|
||||
#include <libyul/backends/evm/ControlFlowGraphBuilder.h>
|
||||
#include <libyul/backends/evm/StackHelpers.h>
|
||||
#include <libyul/backends/evm/StackLayoutGenerator.h>
|
||||
#include <libyul/Object.h>
|
||||
#include <liblangutil/SourceReferenceFormatter.h>
|
||||
|
||||
#include <libsolutil/AnsiColorized.h>
|
||||
#include <libsolutil/Visitor.h>
|
||||
|
||||
#include <range/v3/view/reverse.hpp>
|
||||
|
||||
#ifdef ISOLTEST
|
||||
#include <boost/process.hpp>
|
||||
#endif
|
||||
|
||||
using namespace solidity;
|
||||
using namespace solidity::util;
|
||||
using namespace solidity::langutil;
|
||||
using namespace solidity::yul;
|
||||
using namespace solidity::yul::test;
|
||||
using namespace solidity::frontend;
|
||||
using namespace solidity::frontend::test;
|
||||
using namespace std;
|
||||
|
||||
StackLayoutGeneratorTest::StackLayoutGeneratorTest(string const& _filename):
|
||||
TestCase(_filename)
|
||||
{
|
||||
m_source = m_reader.source();
|
||||
auto dialectName = m_reader.stringSetting("dialect", "evm");
|
||||
m_dialect = &dialect(dialectName, solidity::test::CommonOptions::get().evmVersion());
|
||||
m_expectation = m_reader.simpleExpectations();
|
||||
}
|
||||
|
||||
namespace
|
||||
{
|
||||
static std::string variableSlotToString(VariableSlot const& _slot)
|
||||
{
|
||||
return _slot.variable.get().name.str();
|
||||
}
|
||||
}
|
||||
|
||||
class StackLayoutPrinter
|
||||
{
|
||||
public:
|
||||
StackLayoutPrinter(std::ostream& _stream, StackLayout const& _stackLayout):
|
||||
m_stream(_stream), m_stackLayout(_stackLayout)
|
||||
{
|
||||
}
|
||||
void operator()(CFG::BasicBlock const& _block, bool _isMainEntry = true)
|
||||
{
|
||||
if (_isMainEntry)
|
||||
{
|
||||
m_stream << "Entry [label=\"Entry\"];\n";
|
||||
m_stream << "Entry -> Block" << getBlockId(_block) << ";\n";
|
||||
}
|
||||
while (!m_blocksToPrint.empty())
|
||||
{
|
||||
CFG::BasicBlock const* block = *m_blocksToPrint.begin();
|
||||
m_blocksToPrint.erase(m_blocksToPrint.begin());
|
||||
printBlock(*block);
|
||||
}
|
||||
|
||||
}
|
||||
void operator()(
|
||||
CFG::FunctionInfo const& _info
|
||||
)
|
||||
{
|
||||
m_stream << "FunctionEntry_" << _info.function.name.str() << " [label=\"";
|
||||
m_stream << "function " << _info.function.name.str() << "(";
|
||||
m_stream << joinHumanReadable(_info.parameters | ranges::views::transform(variableSlotToString));
|
||||
m_stream << ")";
|
||||
if (!_info.returnVariables.empty())
|
||||
{
|
||||
m_stream << " -> ";
|
||||
m_stream << joinHumanReadable(_info.returnVariables | ranges::views::transform(variableSlotToString));
|
||||
}
|
||||
m_stream << "\\l\\\n";
|
||||
Stack functionEntryStack = {FunctionReturnLabelSlot{_info.function}};
|
||||
functionEntryStack += _info.parameters | ranges::views::reverse;
|
||||
m_stream << stackToString(functionEntryStack) << "\"];\n";
|
||||
m_stream << "FunctionEntry_" << _info.function.name.str() << " -> Block" << getBlockId(*_info.entry) << ";\n";
|
||||
(*this)(*_info.entry, false);
|
||||
}
|
||||
|
||||
private:
|
||||
void printBlock(CFG::BasicBlock const& _block)
|
||||
{
|
||||
m_stream << "Block" << getBlockId(_block) << " [label=\"\\\n";
|
||||
|
||||
// Verify that the entries of this block exit into this block.
|
||||
for (auto const& entry: _block.entries)
|
||||
std::visit(util::GenericVisitor{
|
||||
[&](CFG::BasicBlock::Jump const& _jump)
|
||||
{
|
||||
soltestAssert(_jump.target == &_block, "Invalid control flow graph.");
|
||||
},
|
||||
[&](CFG::BasicBlock::ConditionalJump const& _conditionalJump)
|
||||
{
|
||||
soltestAssert(
|
||||
_conditionalJump.zero == &_block || _conditionalJump.nonZero == &_block,
|
||||
"Invalid control flow graph."
|
||||
);
|
||||
},
|
||||
[&](auto const&)
|
||||
{
|
||||
soltestAssert(false, "Invalid control flow graph.");
|
||||
}
|
||||
}, entry->exit);
|
||||
|
||||
auto const& blockInfo = m_stackLayout.blockInfos.at(&_block);
|
||||
m_stream << stackToString(blockInfo.entryLayout) << "\\l\\\n";
|
||||
for (auto const& operation: _block.operations)
|
||||
{
|
||||
auto entryLayout = m_stackLayout.operationEntryLayout.at(&operation);
|
||||
m_stream << stackToString(m_stackLayout.operationEntryLayout.at(&operation)) << "\\l\\\n";
|
||||
std::visit(util::GenericVisitor{
|
||||
[&](CFG::FunctionCall const& _call) {
|
||||
m_stream << _call.function.get().name.str();
|
||||
},
|
||||
[&](CFG::BuiltinCall const& _call) {
|
||||
m_stream << _call.functionCall.get().functionName.name.str();
|
||||
|
||||
},
|
||||
[&](CFG::Assignment const& _assignment) {
|
||||
m_stream << "Assignment(";
|
||||
m_stream << joinHumanReadable(_assignment.variables | ranges::views::transform(variableSlotToString));
|
||||
m_stream << ")";
|
||||
}
|
||||
}, operation.operation);
|
||||
m_stream << "\\l\\\n";
|
||||
soltestAssert(operation.input.size() <= entryLayout.size(), "Invalid Stack Layout.");
|
||||
for (size_t i = 0; i < operation.input.size(); ++i)
|
||||
entryLayout.pop_back();
|
||||
entryLayout += operation.output;
|
||||
m_stream << stackToString(entryLayout) << "\\l\\\n";
|
||||
}
|
||||
m_stream << stackToString(blockInfo.exitLayout) << "\\l\\\n";
|
||||
m_stream << "\"];\n";
|
||||
std::visit(util::GenericVisitor{
|
||||
[&](CFG::BasicBlock::MainExit const&)
|
||||
{
|
||||
m_stream << "Block" << getBlockId(_block) << "Exit [label=\"MainExit\"];\n";
|
||||
m_stream << "Block" << getBlockId(_block) << " -> Block" << getBlockId(_block) << "Exit;\n";
|
||||
},
|
||||
[&](CFG::BasicBlock::Jump const& _jump)
|
||||
{
|
||||
m_stream << "Block" << getBlockId(_block) << " -> Block" << getBlockId(_block) << "Exit [arrowhead=none];\n";
|
||||
m_stream << "Block" << getBlockId(_block) << "Exit [label=\"";
|
||||
if (_jump.backwards)
|
||||
m_stream << "Backwards";
|
||||
m_stream << "Jump\" shape=oval];\n";
|
||||
m_stream << "Block" << getBlockId(_block) << "Exit -> Block" << getBlockId(*_jump.target) << ";\n";
|
||||
},
|
||||
[&](CFG::BasicBlock::ConditionalJump const& _conditionalJump)
|
||||
{
|
||||
m_stream << "Block" << getBlockId(_block) << " -> Block" << getBlockId(_block) << "Exit;\n";
|
||||
m_stream << "Block" << getBlockId(_block) << "Exit [label=\"{ ";
|
||||
m_stream << stackSlotToString(_conditionalJump.condition);
|
||||
m_stream << "| { <0> Zero | <1> NonZero }}\" shape=Mrecord];\n";
|
||||
m_stream << "Block" << getBlockId(_block);
|
||||
m_stream << "Exit:0 -> Block" << getBlockId(*_conditionalJump.zero) << ";\n";
|
||||
m_stream << "Block" << getBlockId(_block);
|
||||
m_stream << "Exit:1 -> Block" << getBlockId(*_conditionalJump.nonZero) << ";\n";
|
||||
},
|
||||
[&](CFG::BasicBlock::FunctionReturn const& _return)
|
||||
{
|
||||
m_stream << "Block" << getBlockId(_block) << "Exit [label=\"FunctionReturn[" << _return.info->function.name.str() << "]\"];\n";
|
||||
m_stream << "Block" << getBlockId(_block) << " -> Block" << getBlockId(_block) << "Exit;\n";
|
||||
},
|
||||
[&](CFG::BasicBlock::Terminated const&)
|
||||
{
|
||||
m_stream << "Block" << getBlockId(_block) << "Exit [label=\"Terminated\"];\n";
|
||||
m_stream << "Block" << getBlockId(_block) << " -> Block" << getBlockId(_block) << "Exit;\n";
|
||||
}
|
||||
}, _block.exit);
|
||||
m_stream << "\n";
|
||||
}
|
||||
size_t getBlockId(CFG::BasicBlock const& _block)
|
||||
{
|
||||
if (size_t* id = util::valueOrNullptr(m_blockIds, &_block))
|
||||
return *id;
|
||||
size_t id = m_blockIds[&_block] = m_blockCount++;
|
||||
m_blocksToPrint.emplace_back(&_block);
|
||||
return id;
|
||||
}
|
||||
std::ostream& m_stream;
|
||||
StackLayout const& m_stackLayout;
|
||||
std::map<CFG::BasicBlock const*, size_t> m_blockIds;
|
||||
size_t m_blockCount = 0;
|
||||
std::list<CFG::BasicBlock const*> m_blocksToPrint;
|
||||
};
|
||||
|
||||
TestCase::TestResult StackLayoutGeneratorTest::run(ostream& _stream, string const& _linePrefix, bool const _formatted)
|
||||
{
|
||||
ErrorList errors;
|
||||
auto [object, analysisInfo] = parse(m_source, *m_dialect, errors);
|
||||
if (!object || !analysisInfo || !Error::containsOnlyWarnings(errors))
|
||||
{
|
||||
AnsiColorized(_stream, _formatted, {formatting::BOLD, formatting::RED}) << _linePrefix << "Error parsing source." << endl;
|
||||
return TestResult::FatalError;
|
||||
}
|
||||
|
||||
std::ostringstream output;
|
||||
|
||||
std::unique_ptr<CFG> cfg = ControlFlowGraphBuilder::build(*analysisInfo, *m_dialect, *object->code);
|
||||
StackLayout stackLayout = StackLayoutGenerator::run(*cfg);
|
||||
|
||||
output << "digraph CFG {\nnodesep=0.7;\nnode[shape=box];\n\n";
|
||||
StackLayoutPrinter printer{output, stackLayout};
|
||||
printer(*cfg->entry);
|
||||
for (auto function: cfg->functions)
|
||||
printer(cfg->functionInfo.at(function));
|
||||
output << "}\n";
|
||||
|
||||
m_obtainedResult = output.str();
|
||||
|
||||
auto result = checkResult(_stream, _linePrefix, _formatted);
|
||||
|
||||
#ifdef ISOLTEST
|
||||
char* graphDisplayer = nullptr;
|
||||
if (result == TestResult::Failure)
|
||||
graphDisplayer = getenv("ISOLTEST_DISPLAY_GRAPHS_FAILURE");
|
||||
else if (result == TestResult::Success)
|
||||
graphDisplayer = getenv("ISOLTEST_DISPLAY_GRAPHS_SUCCESS");
|
||||
|
||||
if (graphDisplayer)
|
||||
{
|
||||
if (result == TestResult::Success)
|
||||
std::cout << std::endl << m_source << std::endl;
|
||||
boost::process::opstream pipe;
|
||||
boost::process::child child(graphDisplayer, boost::process::std_in < pipe);
|
||||
|
||||
pipe << output.str();
|
||||
pipe.flush();
|
||||
pipe.pipe().close();
|
||||
if (result == TestResult::Success)
|
||||
child.wait();
|
||||
else
|
||||
child.detach();
|
||||
}
|
||||
#endif
|
||||
|
||||
return result;
|
||||
}
|
||||
@@ -0,0 +1,43 @@
|
||||
/*
|
||||
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
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <test/TestCase.h>
|
||||
|
||||
namespace solidity::yul
|
||||
{
|
||||
struct Dialect;
|
||||
|
||||
namespace test
|
||||
{
|
||||
|
||||
class StackLayoutGeneratorTest: public solidity::frontend::test::TestCase
|
||||
{
|
||||
public:
|
||||
static std::unique_ptr<TestCase> create(Config const& _config)
|
||||
{
|
||||
return std::make_unique<StackLayoutGeneratorTest>(_config.filename);
|
||||
}
|
||||
explicit StackLayoutGeneratorTest(std::string const& _filename);
|
||||
TestResult run(std::ostream& _stream, std::string const& _linePrefix = "", bool const _formatted = false) override;
|
||||
private:
|
||||
Dialect const* m_dialect = nullptr;
|
||||
};
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,318 @@
|
||||
{
|
||||
function f(a, b) -> c {
|
||||
for { let x := 42 } lt(x, a) {
|
||||
x := add(x, 1)
|
||||
if calldataload(x)
|
||||
{
|
||||
sstore(0, x)
|
||||
c := 0x21
|
||||
leave
|
||||
sstore(0x01, 0x0101)
|
||||
}
|
||||
sstore(0xFF, 0xFFFF)
|
||||
}
|
||||
{
|
||||
switch mload(x)
|
||||
case 0 {
|
||||
sstore(a, b)
|
||||
break
|
||||
sstore(a, b)
|
||||
}
|
||||
case 1 {
|
||||
sstore(0x04, x)
|
||||
leave
|
||||
sstore(a, 0x0505)
|
||||
}
|
||||
case 2 {
|
||||
sstore(x, 0x06)
|
||||
c := 42
|
||||
revert(0, 0)
|
||||
sstore(0x07, 0x0707)
|
||||
}
|
||||
case 3 {
|
||||
sstore(0x08, 0x0808)
|
||||
}
|
||||
default {
|
||||
if mload(b) {
|
||||
return(0, 0)
|
||||
sstore(0x09, 0x0909)
|
||||
}
|
||||
sstore(0x0A, 0x0A0A)
|
||||
}
|
||||
sstore(0x0B, 0x0B0B)
|
||||
}
|
||||
sstore(0x0C, 0x0C0C)
|
||||
if sload(0x0D) {
|
||||
c := 0x424242
|
||||
}
|
||||
}
|
||||
pop(f(1,2))
|
||||
}
|
||||
// ----
|
||||
// digraph CFG {
|
||||
// nodesep=0.7;
|
||||
// node[shape=box];
|
||||
//
|
||||
// Entry [label="Entry"];
|
||||
// Entry -> Block0;
|
||||
// Block0 [label="\
|
||||
// [ ]\l\
|
||||
// [ RET[f] 0x02 0x01 ]\l\
|
||||
// f\l\
|
||||
// [ TMP[f, 0] ]\l\
|
||||
// [ TMP[f, 0] ]\l\
|
||||
// pop\l\
|
||||
// [ ]\l\
|
||||
// [ ]\l\
|
||||
// "];
|
||||
// Block0Exit [label="MainExit"];
|
||||
// Block0 -> Block0Exit;
|
||||
//
|
||||
// FunctionEntry_f [label="function f(a, b) -> c\l\
|
||||
// [ RET b a ]"];
|
||||
// FunctionEntry_f -> Block1;
|
||||
// Block1 [label="\
|
||||
// [ c RET a b ]\l\
|
||||
// [ c RET a b 0x2a ]\l\
|
||||
// Assignment(x)\l\
|
||||
// [ c RET a b x ]\l\
|
||||
// [ c RET a b x ]\l\
|
||||
// "];
|
||||
// Block1 -> Block1Exit [arrowhead=none];
|
||||
// Block1Exit [label="Jump" shape=oval];
|
||||
// Block1Exit -> Block2;
|
||||
//
|
||||
// Block2 [label="\
|
||||
// [ c RET a b x ]\l\
|
||||
// [ c RET a b x a x ]\l\
|
||||
// lt\l\
|
||||
// [ c RET a b x TMP[lt, 0] ]\l\
|
||||
// [ c RET a b x TMP[lt, 0] ]\l\
|
||||
// "];
|
||||
// Block2 -> Block2Exit;
|
||||
// Block2Exit [label="{ TMP[lt, 0]| { <0> Zero | <1> NonZero }}" shape=Mrecord];
|
||||
// Block2Exit:0 -> Block3;
|
||||
// Block2Exit:1 -> Block4;
|
||||
//
|
||||
// Block3 [label="\
|
||||
// [ c RET JUNK JUNK JUNK ]\l\
|
||||
// [ c RET 0x0c0c 0x0c ]\l\
|
||||
// sstore\l\
|
||||
// [ c RET ]\l\
|
||||
// [ c RET 0x0d ]\l\
|
||||
// sload\l\
|
||||
// [ c RET TMP[sload, 0] ]\l\
|
||||
// [ c RET TMP[sload, 0] ]\l\
|
||||
// "];
|
||||
// Block3 -> Block3Exit;
|
||||
// Block3Exit [label="{ TMP[sload, 0]| { <0> Zero | <1> NonZero }}" shape=Mrecord];
|
||||
// Block3Exit:0 -> Block5;
|
||||
// Block3Exit:1 -> Block6;
|
||||
//
|
||||
// Block4 [label="\
|
||||
// [ c RET a b x ]\l\
|
||||
// [ c RET a b x x ]\l\
|
||||
// mload\l\
|
||||
// [ c RET a b x TMP[mload, 0] ]\l\
|
||||
// [ c RET a b x TMP[mload, 0] ]\l\
|
||||
// Assignment(GHOST[0])\l\
|
||||
// [ c RET a b x GHOST[0] ]\l\
|
||||
// [ c RET a b x GHOST[0] GHOST[0] 0x00 ]\l\
|
||||
// eq\l\
|
||||
// [ c RET a b x GHOST[0] TMP[eq, 0] ]\l\
|
||||
// [ c RET a b x GHOST[0] TMP[eq, 0] ]\l\
|
||||
// "];
|
||||
// Block4 -> Block4Exit;
|
||||
// Block4Exit [label="{ TMP[eq, 0]| { <0> Zero | <1> NonZero }}" shape=Mrecord];
|
||||
// Block4Exit:0 -> Block7;
|
||||
// Block4Exit:1 -> Block8;
|
||||
//
|
||||
// Block5 [label="\
|
||||
// [ c RET ]\l\
|
||||
// [ c RET ]\l\
|
||||
// "];
|
||||
// Block5Exit [label="FunctionReturn[f]"];
|
||||
// Block5 -> Block5Exit;
|
||||
//
|
||||
// Block6 [label="\
|
||||
// [ JUNK RET ]\l\
|
||||
// [ RET 0x424242 ]\l\
|
||||
// Assignment(c)\l\
|
||||
// [ RET c ]\l\
|
||||
// [ c RET ]\l\
|
||||
// "];
|
||||
// Block6 -> Block6Exit [arrowhead=none];
|
||||
// Block6Exit [label="Jump" shape=oval];
|
||||
// Block6Exit -> Block5;
|
||||
//
|
||||
// Block7 [label="\
|
||||
// [ c RET a b x GHOST[0] ]\l\
|
||||
// [ c RET a b x GHOST[0] GHOST[0] 0x01 ]\l\
|
||||
// eq\l\
|
||||
// [ c RET a b x GHOST[0] TMP[eq, 0] ]\l\
|
||||
// [ c RET a b x GHOST[0] TMP[eq, 0] ]\l\
|
||||
// "];
|
||||
// Block7 -> Block7Exit;
|
||||
// Block7Exit [label="{ TMP[eq, 0]| { <0> Zero | <1> NonZero }}" shape=Mrecord];
|
||||
// Block7Exit:0 -> Block9;
|
||||
// Block7Exit:1 -> Block10;
|
||||
//
|
||||
// Block8 [label="\
|
||||
// [ c RET a b JUNK JUNK ]\l\
|
||||
// [ c RET b a ]\l\
|
||||
// sstore\l\
|
||||
// [ c RET ]\l\
|
||||
// [ c RET ]\l\
|
||||
// "];
|
||||
// Block8 -> Block8Exit [arrowhead=none];
|
||||
// Block8Exit [label="Jump" shape=oval];
|
||||
// Block8Exit -> Block3;
|
||||
//
|
||||
// Block9 [label="\
|
||||
// [ c RET a b x GHOST[0] ]\l\
|
||||
// [ c RET a b x GHOST[0] GHOST[0] 0x02 ]\l\
|
||||
// eq\l\
|
||||
// [ c RET a b x GHOST[0] TMP[eq, 0] ]\l\
|
||||
// [ c RET a b x GHOST[0] TMP[eq, 0] ]\l\
|
||||
// "];
|
||||
// Block9 -> Block9Exit;
|
||||
// Block9Exit [label="{ TMP[eq, 0]| { <0> Zero | <1> NonZero }}" shape=Mrecord];
|
||||
// Block9Exit:0 -> Block11;
|
||||
// Block9Exit:1 -> Block12;
|
||||
//
|
||||
// Block10 [label="\
|
||||
// [ c RET JUNK JUNK x JUNK ]\l\
|
||||
// [ c RET x 0x04 ]\l\
|
||||
// sstore\l\
|
||||
// [ c RET ]\l\
|
||||
// [ c RET ]\l\
|
||||
// "];
|
||||
// Block10Exit [label="FunctionReturn[f]"];
|
||||
// Block10 -> Block10Exit;
|
||||
//
|
||||
// Block11 [label="\
|
||||
// [ c RET a b x GHOST[0] ]\l\
|
||||
// [ c RET a b x GHOST[0] 0x03 ]\l\
|
||||
// eq\l\
|
||||
// [ c RET a b x TMP[eq, 0] ]\l\
|
||||
// [ c RET a b x TMP[eq, 0] ]\l\
|
||||
// "];
|
||||
// Block11 -> Block11Exit;
|
||||
// Block11Exit [label="{ TMP[eq, 0]| { <0> Zero | <1> NonZero }}" shape=Mrecord];
|
||||
// Block11Exit:0 -> Block13;
|
||||
// Block11Exit:1 -> Block14;
|
||||
//
|
||||
// Block12 [label="\
|
||||
// [ JUNK JUNK JUNK JUNK x JUNK ]\l\
|
||||
// [ 0x06 x ]\l\
|
||||
// sstore\l\
|
||||
// [ ]\l\
|
||||
// [ 0x2a ]\l\
|
||||
// Assignment(c)\l\
|
||||
// [ c ]\l\
|
||||
// [ 0x00 0x00 ]\l\
|
||||
// revert\l\
|
||||
// [ ]\l\
|
||||
// [ ]\l\
|
||||
// "];
|
||||
// Block12Exit [label="Terminated"];
|
||||
// Block12 -> Block12Exit;
|
||||
//
|
||||
// Block13 [label="\
|
||||
// [ c RET a b x ]\l\
|
||||
// [ c RET a b x b ]\l\
|
||||
// mload\l\
|
||||
// [ c RET a b x TMP[mload, 0] ]\l\
|
||||
// [ c RET a b x TMP[mload, 0] ]\l\
|
||||
// "];
|
||||
// Block13 -> Block13Exit;
|
||||
// Block13Exit [label="{ TMP[mload, 0]| { <0> Zero | <1> NonZero }}" shape=Mrecord];
|
||||
// Block13Exit:0 -> Block15;
|
||||
// Block13Exit:1 -> Block16;
|
||||
//
|
||||
// Block14 [label="\
|
||||
// [ c RET a b x ]\l\
|
||||
// [ c RET a b 0x01 x 0x0808 0x08 ]\l\
|
||||
// sstore\l\
|
||||
// [ c RET a b 0x01 x ]\l\
|
||||
// [ c RET a b 0x01 x ]\l\
|
||||
// "];
|
||||
// Block14 -> Block14Exit [arrowhead=none];
|
||||
// Block14Exit [label="Jump" shape=oval];
|
||||
// Block14Exit -> Block17;
|
||||
//
|
||||
// Block15 [label="\
|
||||
// [ c RET a b x ]\l\
|
||||
// [ c RET a b 0x01 x 0x0a0a 0x0a ]\l\
|
||||
// sstore\l\
|
||||
// [ c RET a b 0x01 x ]\l\
|
||||
// [ c RET a b 0x01 x ]\l\
|
||||
// "];
|
||||
// Block15 -> Block15Exit [arrowhead=none];
|
||||
// Block15Exit [label="Jump" shape=oval];
|
||||
// Block15Exit -> Block17;
|
||||
//
|
||||
// Block16 [label="\
|
||||
// [ JUNK JUNK JUNK JUNK JUNK ]\l\
|
||||
// [ 0x00 0x00 ]\l\
|
||||
// return\l\
|
||||
// [ ]\l\
|
||||
// [ ]\l\
|
||||
// "];
|
||||
// Block16Exit [label="Terminated"];
|
||||
// Block16 -> Block16Exit;
|
||||
//
|
||||
// Block17 [label="\
|
||||
// [ c RET a b 0x01 x ]\l\
|
||||
// [ c RET a b 0x01 x 0x0b0b 0x0b ]\l\
|
||||
// sstore\l\
|
||||
// [ c RET a b 0x01 x ]\l\
|
||||
// [ c RET a b 0x01 x ]\l\
|
||||
// "];
|
||||
// Block17 -> Block17Exit [arrowhead=none];
|
||||
// Block17Exit [label="Jump" shape=oval];
|
||||
// Block17Exit -> Block18;
|
||||
//
|
||||
// Block18 [label="\
|
||||
// [ c RET a b 0x01 x ]\l\
|
||||
// [ c RET a b 0x01 x ]\l\
|
||||
// add\l\
|
||||
// [ c RET a b TMP[add, 0] ]\l\
|
||||
// [ c RET a b TMP[add, 0] ]\l\
|
||||
// Assignment(x)\l\
|
||||
// [ c RET a b x ]\l\
|
||||
// [ c RET x b a x ]\l\
|
||||
// calldataload\l\
|
||||
// [ c RET x b a TMP[calldataload, 0] ]\l\
|
||||
// [ c RET x b a TMP[calldataload, 0] ]\l\
|
||||
// "];
|
||||
// Block18 -> Block18Exit;
|
||||
// Block18Exit [label="{ TMP[calldataload, 0]| { <0> Zero | <1> NonZero }}" shape=Mrecord];
|
||||
// Block18Exit:0 -> Block19;
|
||||
// Block18Exit:1 -> Block20;
|
||||
//
|
||||
// Block19 [label="\
|
||||
// [ c RET x b a ]\l\
|
||||
// [ c RET x b a 0xffff 0xff ]\l\
|
||||
// sstore\l\
|
||||
// [ c RET x b a ]\l\
|
||||
// [ c RET x b a ]\l\
|
||||
// "];
|
||||
// Block19 -> Block19Exit [arrowhead=none];
|
||||
// Block19Exit [label="BackwardsJump" shape=oval];
|
||||
// Block19Exit -> Block2;
|
||||
//
|
||||
// Block20 [label="\
|
||||
// [ JUNK RET x JUNK JUNK ]\l\
|
||||
// [ RET x 0x00 ]\l\
|
||||
// sstore\l\
|
||||
// [ RET ]\l\
|
||||
// [ RET 0x21 ]\l\
|
||||
// Assignment(c)\l\
|
||||
// [ RET c ]\l\
|
||||
// [ c RET ]\l\
|
||||
// "];
|
||||
// Block20Exit [label="FunctionReturn[f]"];
|
||||
// Block20 -> Block20Exit;
|
||||
//
|
||||
// }
|
||||
@@ -0,0 +1,91 @@
|
||||
{
|
||||
let x := 0x01
|
||||
let y := 0x02
|
||||
sstore(0x01, x)
|
||||
for { sstore(0x02, 0x0202) } lt(x, 0x0303) { x := add(x,0x0404) } {
|
||||
sstore(0x05, 0x0505)
|
||||
y := sload(x)
|
||||
}
|
||||
sstore(0x06, 0x0506)
|
||||
}
|
||||
// ----
|
||||
// digraph CFG {
|
||||
// nodesep=0.7;
|
||||
// node[shape=box];
|
||||
//
|
||||
// Entry [label="Entry"];
|
||||
// Entry -> Block0;
|
||||
// Block0 [label="\
|
||||
// [ ]\l\
|
||||
// [ 0x01 ]\l\
|
||||
// Assignment(x)\l\
|
||||
// [ x ]\l\
|
||||
// [ x 0x02 ]\l\
|
||||
// Assignment(y)\l\
|
||||
// [ x y ]\l\
|
||||
// [ x x 0x01 ]\l\
|
||||
// sstore\l\
|
||||
// [ x ]\l\
|
||||
// [ x 0x0202 0x02 ]\l\
|
||||
// sstore\l\
|
||||
// [ x ]\l\
|
||||
// [ x ]\l\
|
||||
// "];
|
||||
// Block0 -> Block0Exit [arrowhead=none];
|
||||
// Block0Exit [label="Jump" shape=oval];
|
||||
// Block0Exit -> Block1;
|
||||
//
|
||||
// Block1 [label="\
|
||||
// [ x ]\l\
|
||||
// [ x 0x0303 x ]\l\
|
||||
// lt\l\
|
||||
// [ x TMP[lt, 0] ]\l\
|
||||
// [ x TMP[lt, 0] ]\l\
|
||||
// "];
|
||||
// Block1 -> Block1Exit;
|
||||
// Block1Exit [label="{ TMP[lt, 0]| { <0> Zero | <1> NonZero }}" shape=Mrecord];
|
||||
// Block1Exit:0 -> Block2;
|
||||
// Block1Exit:1 -> Block3;
|
||||
//
|
||||
// Block2 [label="\
|
||||
// [ JUNK ]\l\
|
||||
// [ 0x0506 0x06 ]\l\
|
||||
// sstore\l\
|
||||
// [ ]\l\
|
||||
// [ ]\l\
|
||||
// "];
|
||||
// Block2Exit [label="MainExit"];
|
||||
// Block2 -> Block2Exit;
|
||||
//
|
||||
// Block3 [label="\
|
||||
// [ x ]\l\
|
||||
// [ 0x0404 x 0x0505 0x05 ]\l\
|
||||
// sstore\l\
|
||||
// [ 0x0404 x ]\l\
|
||||
// [ 0x0404 x x ]\l\
|
||||
// sload\l\
|
||||
// [ 0x0404 x TMP[sload, 0] ]\l\
|
||||
// [ 0x0404 x TMP[sload, 0] ]\l\
|
||||
// Assignment(y)\l\
|
||||
// [ 0x0404 x y ]\l\
|
||||
// [ 0x0404 x ]\l\
|
||||
// "];
|
||||
// Block3 -> Block3Exit [arrowhead=none];
|
||||
// Block3Exit [label="Jump" shape=oval];
|
||||
// Block3Exit -> Block4;
|
||||
//
|
||||
// Block4 [label="\
|
||||
// [ 0x0404 x ]\l\
|
||||
// [ 0x0404 x ]\l\
|
||||
// add\l\
|
||||
// [ TMP[add, 0] ]\l\
|
||||
// [ TMP[add, 0] ]\l\
|
||||
// Assignment(x)\l\
|
||||
// [ x ]\l\
|
||||
// [ x ]\l\
|
||||
// "];
|
||||
// Block4 -> Block4Exit [arrowhead=none];
|
||||
// Block4Exit [label="BackwardsJump" shape=oval];
|
||||
// Block4Exit -> Block1;
|
||||
//
|
||||
// }
|
||||
@@ -0,0 +1,117 @@
|
||||
{
|
||||
function f(a, b) -> r {
|
||||
let x := add(a,b)
|
||||
r := sub(x,a)
|
||||
}
|
||||
function g() {
|
||||
sstore(0x01, 0x0101)
|
||||
}
|
||||
function h(x) {
|
||||
h(f(x, 0))
|
||||
g()
|
||||
}
|
||||
function i() -> v, w {
|
||||
v := 0x0202
|
||||
w := 0x0303
|
||||
}
|
||||
let x, y := i()
|
||||
h(x)
|
||||
h(y)
|
||||
}
|
||||
// ----
|
||||
// digraph CFG {
|
||||
// nodesep=0.7;
|
||||
// node[shape=box];
|
||||
//
|
||||
// Entry [label="Entry"];
|
||||
// Entry -> Block0;
|
||||
// Block0 [label="\
|
||||
// [ ]\l\
|
||||
// [ RET[h] RET[h] RET[i] ]\l\
|
||||
// i\l\
|
||||
// [ RET[h] RET[h] TMP[i, 0] TMP[i, 1] ]\l\
|
||||
// [ RET[h] RET[h] TMP[i, 0] TMP[i, 1] ]\l\
|
||||
// Assignment(x, y)\l\
|
||||
// [ RET[h] RET[h] x y ]\l\
|
||||
// [ RET[h] y RET[h] x ]\l\
|
||||
// h\l\
|
||||
// [ RET[h] y ]\l\
|
||||
// [ RET[h] y ]\l\
|
||||
// h\l\
|
||||
// [ ]\l\
|
||||
// [ ]\l\
|
||||
// "];
|
||||
// Block0Exit [label="MainExit"];
|
||||
// Block0 -> Block0Exit;
|
||||
//
|
||||
// FunctionEntry_f [label="function f(a, b) -> r\l\
|
||||
// [ RET b a ]"];
|
||||
// FunctionEntry_f -> Block1;
|
||||
// Block1 [label="\
|
||||
// [ RET a b ]\l\
|
||||
// [ RET a b a ]\l\
|
||||
// add\l\
|
||||
// [ RET a TMP[add, 0] ]\l\
|
||||
// [ RET a TMP[add, 0] ]\l\
|
||||
// Assignment(x)\l\
|
||||
// [ RET a x ]\l\
|
||||
// [ RET a x ]\l\
|
||||
// sub\l\
|
||||
// [ RET TMP[sub, 0] ]\l\
|
||||
// [ RET TMP[sub, 0] ]\l\
|
||||
// Assignment(r)\l\
|
||||
// [ RET r ]\l\
|
||||
// [ r RET ]\l\
|
||||
// "];
|
||||
// Block1Exit [label="FunctionReturn[f]"];
|
||||
// Block1 -> Block1Exit;
|
||||
//
|
||||
// FunctionEntry_g [label="function g()\l\
|
||||
// [ RET ]"];
|
||||
// FunctionEntry_g -> Block2;
|
||||
// Block2 [label="\
|
||||
// [ RET ]\l\
|
||||
// [ RET 0x0101 0x01 ]\l\
|
||||
// sstore\l\
|
||||
// [ RET ]\l\
|
||||
// [ RET ]\l\
|
||||
// "];
|
||||
// Block2Exit [label="FunctionReturn[g]"];
|
||||
// Block2 -> Block2Exit;
|
||||
//
|
||||
// FunctionEntry_h [label="function h(x)\l\
|
||||
// [ RET x ]"];
|
||||
// FunctionEntry_h -> Block3;
|
||||
// Block3 [label="\
|
||||
// [ RET RET[h] RET[f] 0x00 x ]\l\
|
||||
// [ RET RET[h] RET[f] 0x00 x ]\l\
|
||||
// f\l\
|
||||
// [ RET RET[h] TMP[f, 0] ]\l\
|
||||
// [ RET RET[h] TMP[f, 0] ]\l\
|
||||
// h\l\
|
||||
// [ RET ]\l\
|
||||
// [ RET RET[g] ]\l\
|
||||
// g\l\
|
||||
// [ RET ]\l\
|
||||
// [ RET ]\l\
|
||||
// "];
|
||||
// Block3Exit [label="FunctionReturn[h]"];
|
||||
// Block3 -> Block3Exit;
|
||||
//
|
||||
// FunctionEntry_i [label="function i() -> v, w\l\
|
||||
// [ RET ]"];
|
||||
// FunctionEntry_i -> Block4;
|
||||
// Block4 [label="\
|
||||
// [ RET ]\l\
|
||||
// [ RET 0x0202 ]\l\
|
||||
// Assignment(v)\l\
|
||||
// [ RET v ]\l\
|
||||
// [ v RET 0x0303 ]\l\
|
||||
// Assignment(w)\l\
|
||||
// [ v RET w ]\l\
|
||||
// [ v w RET ]\l\
|
||||
// "];
|
||||
// Block4Exit [label="FunctionReturn[i]"];
|
||||
// Block4 -> Block4Exit;
|
||||
//
|
||||
// }
|
||||
@@ -0,0 +1,51 @@
|
||||
{
|
||||
sstore(0x01, 0x0101)
|
||||
if calldataload(0) {
|
||||
sstore(0x02, 0x0202)
|
||||
}
|
||||
sstore(0x03, 0x003)
|
||||
}
|
||||
// ----
|
||||
// digraph CFG {
|
||||
// nodesep=0.7;
|
||||
// node[shape=box];
|
||||
//
|
||||
// Entry [label="Entry"];
|
||||
// Entry -> Block0;
|
||||
// Block0 [label="\
|
||||
// [ ]\l\
|
||||
// [ 0x0101 0x01 ]\l\
|
||||
// sstore\l\
|
||||
// [ ]\l\
|
||||
// [ 0x00 ]\l\
|
||||
// calldataload\l\
|
||||
// [ TMP[calldataload, 0] ]\l\
|
||||
// [ TMP[calldataload, 0] ]\l\
|
||||
// "];
|
||||
// Block0 -> Block0Exit;
|
||||
// Block0Exit [label="{ TMP[calldataload, 0]| { <0> Zero | <1> NonZero }}" shape=Mrecord];
|
||||
// Block0Exit:0 -> Block1;
|
||||
// Block0Exit:1 -> Block2;
|
||||
//
|
||||
// Block1 [label="\
|
||||
// [ ]\l\
|
||||
// [ 0x03 0x03 ]\l\
|
||||
// sstore\l\
|
||||
// [ ]\l\
|
||||
// [ ]\l\
|
||||
// "];
|
||||
// Block1Exit [label="MainExit"];
|
||||
// Block1 -> Block1Exit;
|
||||
//
|
||||
// Block2 [label="\
|
||||
// [ ]\l\
|
||||
// [ 0x0202 0x02 ]\l\
|
||||
// sstore\l\
|
||||
// [ ]\l\
|
||||
// [ ]\l\
|
||||
// "];
|
||||
// Block2 -> Block2Exit [arrowhead=none];
|
||||
// Block2Exit [label="Jump" shape=oval];
|
||||
// Block2Exit -> Block1;
|
||||
//
|
||||
// }
|
||||
@@ -0,0 +1,17 @@
|
||||
{
|
||||
}
|
||||
// ----
|
||||
// digraph CFG {
|
||||
// nodesep=0.7;
|
||||
// node[shape=box];
|
||||
//
|
||||
// Entry [label="Entry"];
|
||||
// Entry -> Block0;
|
||||
// Block0 [label="\
|
||||
// [ ]\l\
|
||||
// [ ]\l\
|
||||
// "];
|
||||
// Block0Exit [label="MainExit"];
|
||||
// Block0 -> Block0Exit;
|
||||
//
|
||||
// }
|
||||
@@ -0,0 +1,107 @@
|
||||
{
|
||||
let x := 0x0101
|
||||
let y := 0x0202
|
||||
let z := 0x0303
|
||||
switch sload(x)
|
||||
case 0 {
|
||||
x := 0x42
|
||||
}
|
||||
case 1 {
|
||||
y := 0x42
|
||||
}
|
||||
default {
|
||||
sstore(z, z)
|
||||
}
|
||||
|
||||
sstore(0x0404, y)
|
||||
}
|
||||
// ----
|
||||
// digraph CFG {
|
||||
// nodesep=0.7;
|
||||
// node[shape=box];
|
||||
//
|
||||
// Entry [label="Entry"];
|
||||
// Entry -> Block0;
|
||||
// Block0 [label="\
|
||||
// [ ]\l\
|
||||
// [ 0x0101 ]\l\
|
||||
// Assignment(x)\l\
|
||||
// [ x ]\l\
|
||||
// [ x 0x0202 ]\l\
|
||||
// Assignment(y)\l\
|
||||
// [ x y ]\l\
|
||||
// [ y x 0x0303 ]\l\
|
||||
// Assignment(z)\l\
|
||||
// [ y x z ]\l\
|
||||
// [ y z x ]\l\
|
||||
// sload\l\
|
||||
// [ y z TMP[sload, 0] ]\l\
|
||||
// [ y z TMP[sload, 0] ]\l\
|
||||
// Assignment(GHOST[0])\l\
|
||||
// [ y z GHOST[0] ]\l\
|
||||
// [ y z GHOST[0] GHOST[0] 0x00 ]\l\
|
||||
// eq\l\
|
||||
// [ y z GHOST[0] TMP[eq, 0] ]\l\
|
||||
// [ y z GHOST[0] TMP[eq, 0] ]\l\
|
||||
// "];
|
||||
// Block0 -> Block0Exit;
|
||||
// Block0Exit [label="{ TMP[eq, 0]| { <0> Zero | <1> NonZero }}" shape=Mrecord];
|
||||
// Block0Exit:0 -> Block1;
|
||||
// Block0Exit:1 -> Block2;
|
||||
//
|
||||
// Block1 [label="\
|
||||
// [ y z GHOST[0] ]\l\
|
||||
// [ y z GHOST[0] 0x01 ]\l\
|
||||
// eq\l\
|
||||
// [ y z TMP[eq, 0] ]\l\
|
||||
// [ y z TMP[eq, 0] ]\l\
|
||||
// "];
|
||||
// Block1 -> Block1Exit;
|
||||
// Block1Exit [label="{ TMP[eq, 0]| { <0> Zero | <1> NonZero }}" shape=Mrecord];
|
||||
// Block1Exit:0 -> Block3;
|
||||
// Block1Exit:1 -> Block4;
|
||||
//
|
||||
// Block2 [label="\
|
||||
// [ y JUNK JUNK ]\l\
|
||||
// [ y 0x42 ]\l\
|
||||
// Assignment(x)\l\
|
||||
// [ y x ]\l\
|
||||
// [ y ]\l\
|
||||
// "];
|
||||
// Block2 -> Block2Exit [arrowhead=none];
|
||||
// Block2Exit [label="Jump" shape=oval];
|
||||
// Block2Exit -> Block5;
|
||||
//
|
||||
// Block3 [label="\
|
||||
// [ y z ]\l\
|
||||
// [ y z z ]\l\
|
||||
// sstore\l\
|
||||
// [ y ]\l\
|
||||
// [ y ]\l\
|
||||
// "];
|
||||
// Block3 -> Block3Exit [arrowhead=none];
|
||||
// Block3Exit [label="Jump" shape=oval];
|
||||
// Block3Exit -> Block5;
|
||||
//
|
||||
// Block4 [label="\
|
||||
// [ JUNK JUNK ]\l\
|
||||
// [ 0x42 ]\l\
|
||||
// Assignment(y)\l\
|
||||
// [ y ]\l\
|
||||
// [ y ]\l\
|
||||
// "];
|
||||
// Block4 -> Block4Exit [arrowhead=none];
|
||||
// Block4Exit [label="Jump" shape=oval];
|
||||
// Block4Exit -> Block5;
|
||||
//
|
||||
// Block5 [label="\
|
||||
// [ y ]\l\
|
||||
// [ y 0x0404 ]\l\
|
||||
// sstore\l\
|
||||
// [ ]\l\
|
||||
// [ ]\l\
|
||||
// "];
|
||||
// Block5Exit [label="MainExit"];
|
||||
// Block5 -> Block5Exit;
|
||||
//
|
||||
// }
|
||||
@@ -0,0 +1,51 @@
|
||||
{
|
||||
let x := calldataload(0)
|
||||
let y := calldataload(2)
|
||||
|
||||
x := calldataload(3)
|
||||
y := calldataload(4)
|
||||
|
||||
sstore(x,y)
|
||||
}
|
||||
// ----
|
||||
// digraph CFG {
|
||||
// nodesep=0.7;
|
||||
// node[shape=box];
|
||||
//
|
||||
// Entry [label="Entry"];
|
||||
// Entry -> Block0;
|
||||
// Block0 [label="\
|
||||
// [ ]\l\
|
||||
// [ 0x00 ]\l\
|
||||
// calldataload\l\
|
||||
// [ TMP[calldataload, 0] ]\l\
|
||||
// [ TMP[calldataload, 0] ]\l\
|
||||
// Assignment(x)\l\
|
||||
// [ x ]\l\
|
||||
// [ 0x02 ]\l\
|
||||
// calldataload\l\
|
||||
// [ TMP[calldataload, 0] ]\l\
|
||||
// [ TMP[calldataload, 0] ]\l\
|
||||
// Assignment(y)\l\
|
||||
// [ y ]\l\
|
||||
// [ 0x03 ]\l\
|
||||
// calldataload\l\
|
||||
// [ TMP[calldataload, 0] ]\l\
|
||||
// [ TMP[calldataload, 0] ]\l\
|
||||
// Assignment(x)\l\
|
||||
// [ x ]\l\
|
||||
// [ x 0x04 ]\l\
|
||||
// calldataload\l\
|
||||
// [ x TMP[calldataload, 0] ]\l\
|
||||
// [ x TMP[calldataload, 0] ]\l\
|
||||
// Assignment(y)\l\
|
||||
// [ x y ]\l\
|
||||
// [ y x ]\l\
|
||||
// sstore\l\
|
||||
// [ ]\l\
|
||||
// [ ]\l\
|
||||
// "];
|
||||
// Block0Exit [label="MainExit"];
|
||||
// Block0 -> Block0Exit;
|
||||
//
|
||||
// }
|
||||
@@ -38,6 +38,7 @@ add_executable(isoltest
|
||||
../libyul/FunctionSideEffects.cpp
|
||||
../libyul/ObjectCompilerTest.cpp
|
||||
../libyul/SyntaxTest.cpp
|
||||
../libyul/StackLayoutGeneratorTest.cpp
|
||||
../libyul/YulOptimizerTest.cpp
|
||||
../libyul/YulOptimizerTestCommon.cpp
|
||||
../libyul/YulInterpreterTest.cpp
|
||||
|
||||
Reference in New Issue
Block a user