1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
/*
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/>.
*/
/**
* Unit tests for the common subexpression eliminator optimizer stage.
*/
#include <test/libjulia/Common.h>
#include <libjulia/optimiser/CommonSubexpressionEliminator.h>
#include <libsolidity/inlineasm/AsmPrinter.h>
#include <boost/test/unit_test.hpp>
#include <boost/range/adaptors.hpp>
#include <boost/algorithm/string/join.hpp>
using namespace std;
using namespace dev;
using namespace dev::julia;
using namespace dev::julia::test;
using namespace dev::solidity;
#define CHECK(_original, _expectation)\
do\
{\
assembly::AsmPrinter p;\
Block b = disambiguate(_original, false);\
(CommonSubexpressionEliminator{})(b);\
string result = p(b);\
BOOST_CHECK_EQUAL(result, format(_expectation, false));\
}\
while(false)
BOOST_AUTO_TEST_SUITE(IuliaCSE)
BOOST_AUTO_TEST_CASE(smoke_test)
{
CHECK("{ }", "{ }");
}
BOOST_AUTO_TEST_CASE(trivial)
{
CHECK(
"{ let a := mul(1, codesize()) let b := mul(1, codesize()) }",
"{ let a := mul(1, codesize()) let b := a }"
);
}
BOOST_AUTO_TEST_CASE(non_movable_instr)
{
CHECK(
"{ let a := mload(1) let b := mload(1) }",
"{ let a := mload(1) let b := mload(1) }"
);
}
BOOST_AUTO_TEST_CASE(non_movable_instr2)
{
CHECK(
"{ let a := gas() let b := gas() }",
"{ let a := gas() let b := gas() }"
);
}
BOOST_AUTO_TEST_CASE(branches_if)
{
CHECK(
"{ let b := 1 if b { b := 1 } let c := 1 }",
"{ let b := 1 if b { b := b } let c := 1 }"
);
}
BOOST_AUTO_TEST_CASE(branches_for)
{
CHECK(
"{ let a := 1 let b := codesize()"
"for { } lt(1, codesize()) { mstore(1, codesize()) a := add(a, codesize()) }"
"{ mstore(1, codesize()) } mstore(1, codesize()) }",
"{ let a := 1 let b := codesize()"
"for { } lt(1, b) { mstore(1, b) a := add(a, b) }"
"{ mstore(1, b) } mstore(1, b) }"
);
}
BOOST_AUTO_TEST_SUITE_END()
|
