cerc-io/solidity
10
0
Fork 0
mirror of https://github.com/ethereum/solidity synced 2023-10-03 13:03:40 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Renaming libjulia to libyul

Browse Source
This commit is contained in:
Christian Parpart 2018-10-15 11:52:35 +02:00
parent b965fd6e17
commit 9a4bec7e47
No known key found for this signature in database
GPG Key ID: 19BC8DD20312C929
179 changed files with 143 additions and 143 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
libsolidity/CMakeLists.txt
View File

@ -1,6 +1,6 @@
# Until we have a clear separation, libjulia has to be included here # Until we have a clear separation, libyul has to be included here
file(GLOB_RECURSE sources "*.cpp" "../libjulia/*.cpp") file(GLOB_RECURSE sources "*.cpp" "../libyul/*.cpp")
file(GLOB_RECURSE headers "*.h" "../libjulia/*.h") file(GLOB_RECURSE headers "*.h" "../libyul/*.h")
find_package(Z3 QUIET) find_package(Z3 QUIET)
if (${Z3_FOUND}) if (${Z3_FOUND})

2
libsolidity/inlineasm/AsmAnalysis.h
View File

@ -25,7 +25,7 @@
#include <libsolidity/inlineasm/AsmScope.h> #include <libsolidity/inlineasm/AsmScope.h>
#include <libjulia/backends/evm/AbstractAssembly.h> #include <libyul/backends/evm/AbstractAssembly.h>
#include <libsolidity/inlineasm/AsmDataForward.h> #include <libsolidity/inlineasm/AsmDataForward.h>

4
libsolidity/inlineasm/AsmCodeGen.cpp
View File

@ -32,8 +32,8 @@
#include <libevmasm/SourceLocation.h> #include <libevmasm/SourceLocation.h>
#include <libevmasm/Instruction.h> #include <libevmasm/Instruction.h>
#include <libjulia/backends/evm/AbstractAssembly.h> #include <libyul/backends/evm/AbstractAssembly.h>
#include <libjulia/backends/evm/EVMCodeTransform.h> #include <libyul/backends/evm/EVMCodeTransform.h>
#include <libdevcore/CommonIO.h> #include <libdevcore/CommonIO.h>

4
libsolidity/interface/AssemblyStack.cpp
View File

@ -31,8 +31,8 @@
#include <libevmasm/Assembly.h> #include <libevmasm/Assembly.h>
#include <libjulia/backends/evm/EVMCodeTransform.h> #include <libyul/backends/evm/EVMCodeTransform.h>
#include <libjulia/backends/evm/EVMAssembly.h> #include <libyul/backends/evm/EVMAssembly.h>
using namespace std; using namespace std;
using namespace dev; using namespace dev;

0
libjulia/ASTDataForward.h → libyul/ASTDataForward.h
View File

0
libjulia/Exceptions.h → libyul/Exceptions.h
View File

0
libjulia/backends/evm/AbstractAssembly.h → libyul/backends/evm/AbstractAssembly.h
View File

2
libjulia/backends/evm/EVMAssembly.cpp → libyul/backends/evm/EVMAssembly.cpp
View File

@ -18,7 +18,7 @@
* Assembly interface for EVM and EVM1.5. * Assembly interface for EVM and EVM1.5.
*/ */
#include <libjulia/backends/evm/EVMAssembly.h> #include <libyul/backends/evm/EVMAssembly.h>
#include <libevmasm/Instruction.h> #include <libevmasm/Instruction.h>

2
libjulia/backends/evm/EVMAssembly.h → libyul/backends/evm/EVMAssembly.h
View File

@ -20,7 +20,7 @@
#pragma once #pragma once
#include <libjulia/backends/evm/AbstractAssembly.h> #include <libyul/backends/evm/AbstractAssembly.h>
#include <libevmasm/LinkerObject.h> #include <libevmasm/LinkerObject.h>

2
libjulia/backends/evm/EVMCodeTransform.cpp → libyul/backends/evm/EVMCodeTransform.cpp
View File

@ -18,7 +18,7 @@
* Common code generator for translating Yul / inline assembly to EVM and EVM1.5. * Common code generator for translating Yul / inline assembly to EVM and EVM1.5.
*/ */
#include <libjulia/backends/evm/EVMCodeTransform.h> #include <libyul/backends/evm/EVMCodeTransform.h>
#include <libsolidity/inlineasm/AsmAnalysisInfo.h> #include <libsolidity/inlineasm/AsmAnalysisInfo.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

4
libjulia/backends/evm/EVMCodeTransform.h → libyul/backends/evm/EVMCodeTransform.h
View File

@ -18,9 +18,9 @@
* Common code generator for translating Yul / inline assembly to EVM and EVM1.5. * Common code generator for translating Yul / inline assembly to EVM and EVM1.5.
*/ */
#include <libjulia/backends/evm/EVMAssembly.h> #include <libyul/backends/evm/EVMAssembly.h>
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
#include <libsolidity/inlineasm/AsmScope.h> #include <libsolidity/inlineasm/AsmScope.h>

4
libjulia/optimiser/ASTCopier.cpp → libyul/optimiser/ASTCopier.cpp
View File

@ -18,9 +18,9 @@
* Creates an independent copy of an AST, renaming identifiers to be unique. * Creates an independent copy of an AST, renaming identifiers to be unique.
*/ */
#include <libjulia/optimiser/ASTCopier.h> #include <libyul/optimiser/ASTCopier.h>
#include <libjulia/Exceptions.h> #include <libyul/Exceptions.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/ASTCopier.h → libyul/optimiser/ASTCopier.h
View File

@ -20,7 +20,7 @@
#pragma once #pragma once
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
#include <boost/variant.hpp> #include <boost/variant.hpp>
#include <boost/optional.hpp> #include <boost/optional.hpp>

2
libjulia/optimiser/ASTWalker.cpp → libyul/optimiser/ASTWalker.cpp
View File

@ -18,7 +18,7 @@
* Generic AST walker. * Generic AST walker.
*/ */
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

4
libjulia/optimiser/ASTWalker.h → libyul/optimiser/ASTWalker.h
View File

@ -20,9 +20,9 @@
#pragma once #pragma once
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
#include <libjulia/Exceptions.h> #include <libyul/Exceptions.h>
#include <boost/variant.hpp> #include <boost/variant.hpp>
#include <boost/optional.hpp> #include <boost/optional.hpp>

8
libjulia/optimiser/CommonSubexpressionEliminator.cpp → libyul/optimiser/CommonSubexpressionEliminator.cpp
View File

@ -19,11 +19,11 @@
* in scope by a reference to that variable. * in scope by a reference to that variable.
*/ */
#include <libjulia/optimiser/CommonSubexpressionEliminator.h> #include <libyul/optimiser/CommonSubexpressionEliminator.h>
#include <libjulia/optimiser/Metrics.h> #include <libyul/optimiser/Metrics.h>
#include <libjulia/optimiser/SyntacticalEquality.h> #include <libyul/optimiser/SyntacticalEquality.h>
#include <libjulia/Exceptions.h> #include <libyul/Exceptions.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/CommonSubexpressionEliminator.h → libyul/optimiser/CommonSubexpressionEliminator.h
View File

@ -21,7 +21,7 @@
#pragma once #pragma once
#include <libjulia/optimiser/DataFlowAnalyzer.h> #include <libyul/optimiser/DataFlowAnalyzer.h>
namespace dev namespace dev
{ {

8
libjulia/optimiser/DataFlowAnalyzer.cpp → libyul/optimiser/DataFlowAnalyzer.cpp
View File

@ -20,11 +20,11 @@
* Common Subexpression Eliminator. * Common Subexpression Eliminator.
*/ */
#include <libjulia/optimiser/DataFlowAnalyzer.h> #include <libyul/optimiser/DataFlowAnalyzer.h>
#include <libjulia/optimiser/NameCollector.h> #include <libyul/optimiser/NameCollector.h>
#include <libjulia/optimiser/Semantics.h> #include <libyul/optimiser/Semantics.h>
#include <libjulia/Exceptions.h> #include <libyul/Exceptions.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/DataFlowAnalyzer.h → libyul/optimiser/DataFlowAnalyzer.h
View File

@ -22,7 +22,7 @@
#pragma once #pragma once
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
#include <string> #include <string>
#include <map> #include <map>

4
libjulia/optimiser/Disambiguator.cpp → libyul/optimiser/Disambiguator.cpp
View File

@ -18,9 +18,9 @@
* Optimiser component that makes all identifiers unique. * Optimiser component that makes all identifiers unique.
*/ */
#include <libjulia/optimiser/Disambiguator.h> #include <libyul/optimiser/Disambiguator.h>
#include <libjulia/Exceptions.h> #include <libyul/Exceptions.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>
#include <libsolidity/inlineasm/AsmScope.h> #include <libsolidity/inlineasm/AsmScope.h>

6
libjulia/optimiser/Disambiguator.h → libyul/optimiser/Disambiguator.h
View File

@ -20,10 +20,10 @@
#pragma once #pragma once
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
#include <libjulia/optimiser/ASTCopier.h> #include <libyul/optimiser/ASTCopier.h>
#include <libjulia/optimiser/NameDispenser.h> #include <libyul/optimiser/NameDispenser.h>
#include <libsolidity/inlineasm/AsmAnalysisInfo.h> #include <libsolidity/inlineasm/AsmAnalysisInfo.h>

8
libjulia/optimiser/ExpressionInliner.cpp → libyul/optimiser/ExpressionInliner.cpp
View File

@ -18,11 +18,11 @@
* Optimiser component that performs function inlining inside expressions. * Optimiser component that performs function inlining inside expressions.
*/ */
#include <libjulia/optimiser/ExpressionInliner.h> #include <libyul/optimiser/ExpressionInliner.h>
#include <libjulia/optimiser/InlinableExpressionFunctionFinder.h> #include <libyul/optimiser/InlinableExpressionFunctionFinder.h>
#include <libjulia/optimiser/Substitution.h> #include <libyul/optimiser/Substitution.h>
#include <libjulia/optimiser/Semantics.h> #include <libyul/optimiser/Semantics.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

4
libjulia/optimiser/ExpressionInliner.h → libyul/optimiser/ExpressionInliner.h
View File

@ -19,9 +19,9 @@
*/ */
#pragma once #pragma once
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
#include <boost/variant.hpp> #include <boost/variant.hpp>
#include <boost/optional.hpp> #include <boost/optional.hpp>

8
libjulia/optimiser/ExpressionJoiner.cpp → libyul/optimiser/ExpressionJoiner.cpp
View File

@ -19,11 +19,11 @@
* it more or less inlines variable declarations. * it more or less inlines variable declarations.
*/ */
#include <libjulia/optimiser/ExpressionJoiner.h> #include <libyul/optimiser/ExpressionJoiner.h>
#include <libjulia/optimiser/NameCollector.h> #include <libyul/optimiser/NameCollector.h>
#include <libjulia/optimiser/Utilities.h> #include <libyul/optimiser/Utilities.h>
#include <libjulia/Exceptions.h> #include <libyul/Exceptions.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

4
libjulia/optimiser/ExpressionJoiner.h → libyul/optimiser/ExpressionJoiner.h
View File

@ -20,9 +20,9 @@
*/ */
#pragma once #pragma once
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
#include <map> #include <map>

6
libjulia/optimiser/ExpressionSimplifier.cpp → libyul/optimiser/ExpressionSimplifier.cpp
View File

@ -18,10 +18,10 @@
* Optimiser component that uses the simplification rules to simplify expressions. * Optimiser component that uses the simplification rules to simplify expressions.
*/ */
#include <libjulia/optimiser/ExpressionSimplifier.h> #include <libyul/optimiser/ExpressionSimplifier.h>
#include <libjulia/optimiser/SimplificationRules.h> #include <libyul/optimiser/SimplificationRules.h>
#include <libjulia/optimiser/Semantics.h> #include <libyul/optimiser/Semantics.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

4
libjulia/optimiser/ExpressionSimplifier.h → libyul/optimiser/ExpressionSimplifier.h
View File

@ -20,9 +20,9 @@
#pragma once #pragma once
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
namespace dev namespace dev
{ {

4
libjulia/optimiser/ExpressionSplitter.cpp → libyul/optimiser/ExpressionSplitter.cpp
View File

@ -19,9 +19,9 @@
* declarations. * declarations.
*/ */
#include <libjulia/optimiser/ExpressionSplitter.h> #include <libyul/optimiser/ExpressionSplitter.h>
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

6
libjulia/optimiser/ExpressionSplitter.h → libyul/optimiser/ExpressionSplitter.h
View File

@ -20,10 +20,10 @@
*/ */
#pragma once #pragma once
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
#include <libjulia/optimiser/NameDispenser.h> #include <libyul/optimiser/NameDispenser.h>
#include <vector> #include <vector>

12
libjulia/optimiser/FullInliner.cpp → libyul/optimiser/FullInliner.cpp
View File

@ -18,13 +18,13 @@
* Optimiser component that performs function inlining for arbitrary functions. * Optimiser component that performs function inlining for arbitrary functions.
*/ */
#include <libjulia/optimiser/FullInliner.h> #include <libyul/optimiser/FullInliner.h>
#include <libjulia/optimiser/ASTCopier.h> #include <libyul/optimiser/ASTCopier.h>
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
#include <libjulia/optimiser/NameCollector.h> #include <libyul/optimiser/NameCollector.h>
#include <libjulia/optimiser/Semantics.h> #include <libyul/optimiser/Semantics.h>
#include <libjulia/Exceptions.h> #include <libyul/Exceptions.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

10
libjulia/optimiser/FullInliner.h → libyul/optimiser/FullInliner.h
View File

@ -19,12 +19,12 @@
*/ */
#pragma once #pragma once
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
#include <libjulia/optimiser/ASTCopier.h> #include <libyul/optimiser/ASTCopier.h>
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
#include <libjulia/optimiser/NameDispenser.h> #include <libyul/optimiser/NameDispenser.h>
#include <libjulia/Exceptions.h> #include <libyul/Exceptions.h>
#include <libevmasm/SourceLocation.h> #include <libevmasm/SourceLocation.h>

2
libjulia/optimiser/FunctionGrouper.cpp → libyul/optimiser/FunctionGrouper.cpp
View File

@ -19,7 +19,7 @@
* statements are moved to a block of their own followed by all function definitions. * statements are moved to a block of their own followed by all function definitions.
*/ */
#include <libjulia/optimiser/FunctionGrouper.h> #include <libyul/optimiser/FunctionGrouper.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/FunctionGrouper.h → libyul/optimiser/FunctionGrouper.h
View File

@ -21,7 +21,7 @@
#pragma once #pragma once
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
namespace dev namespace dev
{ {

4
libjulia/optimiser/FunctionHoister.cpp → libyul/optimiser/FunctionHoister.cpp
View File

@ -20,8 +20,8 @@
* anywhere else. * anywhere else.
*/ */
#include <libjulia/optimiser/FunctionHoister.h> #include <libyul/optimiser/FunctionHoister.h>
#include <libjulia/optimiser/Utilities.h> #include <libyul/optimiser/Utilities.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

4
libjulia/optimiser/FunctionHoister.h → libyul/optimiser/FunctionHoister.h
View File

@ -21,9 +21,9 @@
#pragma once #pragma once
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
namespace dev namespace dev
{ {

4
libjulia/optimiser/InlinableExpressionFunctionFinder.cpp → libyul/optimiser/InlinableExpressionFunctionFinder.cpp
View File

@ -18,9 +18,9 @@
* Optimiser component that identifies functions to be inlined. * Optimiser component that identifies functions to be inlined.
*/ */
#include <libjulia/optimiser/InlinableExpressionFunctionFinder.h> #include <libyul/optimiser/InlinableExpressionFunctionFinder.h>
#include <libjulia/optimiser/Utilities.h> #include <libyul/optimiser/Utilities.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

4
libjulia/optimiser/InlinableExpressionFunctionFinder.h → libyul/optimiser/InlinableExpressionFunctionFinder.h
View File

@ -20,8 +20,8 @@
#pragma once #pragma once
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
#include <set> #include <set>

6
libjulia/optimiser/MainFunction.cpp → libyul/optimiser/MainFunction.cpp
View File

@ -19,10 +19,10 @@
* inputs nor outputs. * inputs nor outputs.
*/ */
#include <libjulia/optimiser/MainFunction.h> #include <libyul/optimiser/MainFunction.h>
#include <libjulia/optimiser/NameCollector.h> #include <libyul/optimiser/NameCollector.h>
#include <libjulia/Exceptions.h> #include <libyul/Exceptions.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/MainFunction.h → libyul/optimiser/MainFunction.h
View File

@ -21,7 +21,7 @@
#pragma once #pragma once
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
namespace dev namespace dev
{ {

2
libjulia/optimiser/Metrics.cpp → libyul/optimiser/Metrics.cpp
View File

@ -18,7 +18,7 @@
* Module providing metrics for the optimizer. * Module providing metrics for the optimizer.
*/ */
#include <libjulia/optimiser/Metrics.h> #include <libyul/optimiser/Metrics.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/Metrics.h → libyul/optimiser/Metrics.h
View File

@ -20,7 +20,7 @@
#pragma once #pragma once
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
namespace dev namespace dev
{ {

2
libjulia/optimiser/NameCollector.cpp → libyul/optimiser/NameCollector.cpp
View File

@ -18,7 +18,7 @@
* Specific AST walker that collects all defined names. * Specific AST walker that collects all defined names.
*/ */
#include <libjulia/optimiser/NameCollector.h> #include <libyul/optimiser/NameCollector.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/NameCollector.h → libyul/optimiser/NameCollector.h
View File

@ -20,7 +20,7 @@
#pragma once #pragma once
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
#include <string> #include <string>
#include <map> #include <map>

2
libjulia/optimiser/NameDispenser.cpp → libyul/optimiser/NameDispenser.cpp
View File

@ -18,7 +18,7 @@
* Optimiser component that can create new unique names. * Optimiser component that can create new unique names.
*/ */
#include <libjulia/optimiser/NameDispenser.h> #include <libyul/optimiser/NameDispenser.h>
using namespace std; using namespace std;
using namespace dev; using namespace dev;

0
libjulia/optimiser/NameDispenser.h → libyul/optimiser/NameDispenser.h
View File

0
libjulia/optimiser/README.md → libyul/optimiser/README.md
View File

8
libjulia/optimiser/Rematerialiser.cpp → libyul/optimiser/Rematerialiser.cpp
View File

@ -18,11 +18,11 @@
* Optimisation stage that replaces variables by their most recently assigned expressions. * Optimisation stage that replaces variables by their most recently assigned expressions.
*/ */
#include <libjulia/optimiser/Rematerialiser.h> #include <libyul/optimiser/Rematerialiser.h>
#include <libjulia/optimiser/Metrics.h> #include <libyul/optimiser/Metrics.h>
#include <libjulia/optimiser/ASTCopier.h> #include <libyul/optimiser/ASTCopier.h>
#include <libjulia/Exceptions.h> #include <libyul/Exceptions.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/Rematerialiser.h → libyul/optimiser/Rematerialiser.h
View File

@ -20,7 +20,7 @@
#pragma once #pragma once
#include <libjulia/optimiser/DataFlowAnalyzer.h> #include <libyul/optimiser/DataFlowAnalyzer.h>
#include <string> #include <string>
#include <map> #include <map>

4
libjulia/optimiser/Semantics.cpp → libyul/optimiser/Semantics.cpp
View File

@ -18,9 +18,9 @@
* Specific AST walkers that collect semantical facts. * Specific AST walkers that collect semantical facts.
*/ */
#include <libjulia/optimiser/Semantics.h> #include <libyul/optimiser/Semantics.h>
#include <libjulia/Exceptions.h> #include <libyul/Exceptions.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/Semantics.h → libyul/optimiser/Semantics.h
View File

@ -20,7 +20,7 @@
#pragma once #pragma once
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
#include <string> #include <string>
#include <map> #include <map>

10
libjulia/optimiser/SimplificationRules.cpp → libyul/optimiser/SimplificationRules.cpp
View File

@ -18,12 +18,12 @@
* Module for applying replacement rules against Expressions. * Module for applying replacement rules against Expressions.
*/ */
#include <libjulia/optimiser/SimplificationRules.h> #include <libyul/optimiser/SimplificationRules.h>
#include <libjulia/optimiser/Utilities.h> #include <libyul/optimiser/Utilities.h>
#include <libjulia/optimiser/ASTCopier.h> #include <libyul/optimiser/ASTCopier.h>
#include <libjulia/optimiser/Semantics.h> #include <libyul/optimiser/Semantics.h>
#include <libjulia/optimiser/SyntacticalEquality.h> #include <libyul/optimiser/SyntacticalEquality.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/SimplificationRules.h → libyul/optimiser/SimplificationRules.h
View File

@ -23,7 +23,7 @@
#include <libevmasm/ExpressionClasses.h> #include <libevmasm/ExpressionClasses.h>
#include <libevmasm/SimplificationRule.h> #include <libevmasm/SimplificationRule.h>
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/Substitution.cpp → libyul/optimiser/Substitution.cpp
View File

@ -18,7 +18,7 @@
* Specific AST copier that replaces certain identifiers with expressions. * Specific AST copier that replaces certain identifiers with expressions.
*/ */
#include <libjulia/optimiser/Substitution.h> #include <libyul/optimiser/Substitution.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/Substitution.h → libyul/optimiser/Substitution.h
View File

@ -20,7 +20,7 @@
#pragma once #pragma once
#include <libjulia/optimiser/ASTCopier.h> #include <libyul/optimiser/ASTCopier.h>
#include <string> #include <string>
#include <map> #include <map>

4
libjulia/optimiser/SyntacticalEquality.cpp → libyul/optimiser/SyntacticalEquality.cpp
View File

@ -18,9 +18,9 @@
* Component that can compare ASTs for equality on a syntactic basis. * Component that can compare ASTs for equality on a syntactic basis.
*/ */
#include <libjulia/optimiser/SyntacticalEquality.h> #include <libyul/optimiser/SyntacticalEquality.h>
#include <libjulia/Exceptions.h> #include <libyul/Exceptions.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/SyntacticalEquality.h → libyul/optimiser/SyntacticalEquality.h
View File

@ -20,7 +20,7 @@
#pragma once #pragma once
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
#include <vector> #include <vector>

10
libjulia/optimiser/UnusedPruner.cpp → libyul/optimiser/UnusedPruner.cpp
View File

@ -18,12 +18,12 @@
* Optimisation stage that removes unused variables and functions. * Optimisation stage that removes unused variables and functions.
*/ */
#include <libjulia/optimiser/UnusedPruner.h> #include <libyul/optimiser/UnusedPruner.h>
#include <libjulia/optimiser/NameCollector.h> #include <libyul/optimiser/NameCollector.h>
#include <libjulia/optimiser/Semantics.h> #include <libyul/optimiser/Semantics.h>
#include <libjulia/optimiser/Utilities.h> #include <libyul/optimiser/Utilities.h>
#include <libjulia/Exceptions.h> #include <libyul/Exceptions.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/UnusedPruner.h → libyul/optimiser/UnusedPruner.h
View File

@ -20,7 +20,7 @@
#pragma once #pragma once
#include <libjulia/optimiser/ASTWalker.h> #include <libyul/optimiser/ASTWalker.h>
#include <string> #include <string>
#include <map> #include <map>

2
libjulia/optimiser/Utilities.cpp → libyul/optimiser/Utilities.cpp
View File

@ -18,7 +18,7 @@
* Some useful snippets for the optimiser. * Some useful snippets for the optimiser.
*/ */
#include <libjulia/optimiser/Utilities.h> #include <libyul/optimiser/Utilities.h>
#include <libsolidity/inlineasm/AsmData.h> #include <libsolidity/inlineasm/AsmData.h>

2
libjulia/optimiser/Utilities.h → libyul/optimiser/Utilities.h
View File

@ -20,7 +20,7 @@
#pragma once #pragma once
#include <libjulia/ASTDataForward.h> #include <libyul/ASTDataForward.h>
namespace dev namespace dev
{ {

6
test/CMakeLists.txt
View File

@ -7,8 +7,8 @@ file(GLOB libdevcore_sources "libdevcore/*.cpp")
file(GLOB libdevcore_headers "libdevcore/*.h") file(GLOB libdevcore_headers "libdevcore/*.h")
file(GLOB libevmasm_sources "libevmasm/*.cpp") file(GLOB libevmasm_sources "libevmasm/*.cpp")
file(GLOB libevmasm_headers "libevmasm/*.h") file(GLOB libevmasm_headers "libevmasm/*.h")
file(GLOB libjulia_sources "libjulia/*.cpp") file(GLOB libyul_sources "libyul/*.cpp")
file(GLOB libjulia_headers "libjulia/*.h") file(GLOB libyul_headers "libyul/*.h")
file(GLOB liblll_sources "liblll/*.cpp") file(GLOB liblll_sources "liblll/*.cpp")
file(GLOB liblll_headers "liblll/*.h") file(GLOB liblll_headers "liblll/*.h")
file(GLOB libsolidity_sources "libsolidity/*.cpp") file(GLOB libsolidity_sources "libsolidity/*.cpp")
@ -18,7 +18,7 @@ add_executable(soltest ${sources} ${headers}
${contracts_sources} ${contracts_headers} ${contracts_sources} ${contracts_headers}
${libdevcore_sources} ${libdevcore_headers} ${libdevcore_sources} ${libdevcore_headers}
${libevmasm_sources} ${libevmasm_headers} ${libevmasm_sources} ${libevmasm_headers}
${libjulia_sources} ${libjulia_headers} ${libyul_sources} ${libyul_headers}
${liblll_sources} ${liblll_headers} ${liblll_sources} ${liblll_headers}
${libsolidity_sources} ${libsolidity_headers} ${libsolidity_sources} ${libsolidity_headers}
) )

4
test/boostTest.cpp
View File

@ -38,7 +38,7 @@
#include <test/Options.h> #include <test/Options.h>
#include <test/libsolidity/ASTJSONTest.h> #include <test/libsolidity/ASTJSONTest.h>
#include <test/libsolidity/SyntaxTest.h> #include <test/libsolidity/SyntaxTest.h>
#include <test/libjulia/YulOptimizerTest.h> #include <test/libyul/YulOptimizerTest.h>
#include <boost/algorithm/string.hpp> #include <boost/algorithm/string.hpp>
#include <boost/algorithm/string/predicate.hpp> #include <boost/algorithm/string/predicate.hpp>
@ -141,7 +141,7 @@ test_suite* init_unit_test_suite( int /*argc*/, char* /*argv*/[] )
) > 0, "no JSON AST tests found"); ) > 0, "no JSON AST tests found");
solAssert(registerTests( solAssert(registerTests(
master, master,
dev::test::Options::get().testPath / "libjulia", dev::test::Options::get().testPath / "libyul",
"yulOptimizerTests", "yulOptimizerTests",
dev::julia::test::YulOptimizerTest::create dev::julia::test::YulOptimizerTest::create
) > 0, "no Yul Optimizer tests found"); ) > 0, "no Yul Optimizer tests found");

4
test/libjulia/Common.cpp → test/libyul/Common.cpp
View File

@ -19,11 +19,11 @@
* Common functions the Yul tests. * Common functions the Yul tests.
*/ */
#include <test/libjulia/Common.h> #include <test/libyul/Common.h>
#include <test/Options.h> #include <test/Options.h>
#include <libjulia/optimiser/Disambiguator.h> #include <libyul/optimiser/Disambiguator.h>
#include <libsolidity/parsing/Scanner.h> #include <libsolidity/parsing/Scanner.h>

0
test/libjulia/Common.h → test/libyul/Common.h
View File

12
test/libjulia/Inliner.cpp → test/libyul/Inliner.cpp
View File

@ -19,13 +19,13 @@
* Unit tests for the Yul function inliner. * Unit tests for the Yul function inliner.
*/ */
#include <test/libjulia/Common.h> #include <test/libyul/Common.h>
#include <libjulia/optimiser/ExpressionInliner.h> #include <libyul/optimiser/ExpressionInliner.h>
#include <libjulia/optimiser/InlinableExpressionFunctionFinder.h> #include <libyul/optimiser/InlinableExpressionFunctionFinder.h>
#include <libjulia/optimiser/FullInliner.h> #include <libyul/optimiser/FullInliner.h>
#include <libjulia/optimiser/FunctionHoister.h> #include <libyul/optimiser/FunctionHoister.h>
#include <libjulia/optimiser/FunctionGrouper.h> #include <libyul/optimiser/FunctionGrouper.h>
#include <libsolidity/inlineasm/AsmPrinter.h> #include <libsolidity/inlineasm/AsmPrinter.h>

0
test/libjulia/Parser.cpp → test/libyul/Parser.cpp
View File

28
test/libjulia/YulOptimizerTest.cpp → test/libyul/YulOptimizerTest.cpp
View File

@ -15,25 +15,25 @@
along with solidity. If not, see <http://www.gnu.org/licenses/>. along with solidity. If not, see <http://www.gnu.org/licenses/>.
*/ */
#include <test/libjulia/YulOptimizerTest.h> #include <test/libyul/YulOptimizerTest.h>
#include <test/libsolidity/FormattedScope.h> #include <test/libsolidity/FormattedScope.h>
#include <test/Options.h> #include <test/Options.h>
#include <libjulia/optimiser/Disambiguator.h> #include <libyul/optimiser/Disambiguator.h>
#include <libjulia/optimiser/CommonSubexpressionEliminator.h> #include <libyul/optimiser/CommonSubexpressionEliminator.h>
#include <libjulia/optimiser/NameCollector.h> #include <libyul/optimiser/NameCollector.h>
#include <libjulia/optimiser/ExpressionSplitter.h> #include <libyul/optimiser/ExpressionSplitter.h>
#include <libjulia/optimiser/FunctionGrouper.h> #include <libyul/optimiser/FunctionGrouper.h>
#include <libjulia/optimiser/FunctionHoister.h> #include <libyul/optimiser/FunctionHoister.h>
#include <libjulia/optimiser/ExpressionInliner.h> #include <libyul/optimiser/ExpressionInliner.h>
#include <libjulia/optimiser/FullInliner.h> #include <libyul/optimiser/FullInliner.h>
#include <libjulia/optimiser/MainFunction.h> #include <libyul/optimiser/MainFunction.h>
#include <libjulia/optimiser/Rematerialiser.h> #include <libyul/optimiser/Rematerialiser.h>
#include <libjulia/optimiser/ExpressionSimplifier.h> #include <libyul/optimiser/ExpressionSimplifier.h>
#include <libjulia/optimiser/UnusedPruner.h> #include <libyul/optimiser/UnusedPruner.h>
#include <libjulia/optimiser/ExpressionJoiner.h> #include <libyul/optimiser/ExpressionJoiner.h>
#include <libsolidity/parsing/Scanner.h> #include <libsolidity/parsing/Scanner.h>
#include <libsolidity/inlineasm/AsmPrinter.h> #include <libsolidity/inlineasm/AsmPrinter.h>

0
test/libjulia/YulOptimizerTest.h → test/libyul/YulOptimizerTest.h
View File

0
test/libjulia/yulOptimizerTests/commonSubexpressionEliminator/branches_for.yul → test/libyul/yulOptimizerTests/commonSubexpressionEliminator/branches_for.yul
View File

0
test/libjulia/yulOptimizerTests/commonSubexpressionEliminator/branches_if.yul → test/libyul/yulOptimizerTests/commonSubexpressionEliminator/branches_if.yul
View File

0
test/libjulia/yulOptimizerTests/commonSubexpressionEliminator/non_movable_instr.yul → test/libyul/yulOptimizerTests/commonSubexpressionEliminator/non_movable_instr.yul
View File

0
test/libjulia/yulOptimizerTests/commonSubexpressionEliminator/non_movable_instr2.yul → test/libyul/yulOptimizerTests/commonSubexpressionEliminator/non_movable_instr2.yul
View File

0
test/libjulia/yulOptimizerTests/commonSubexpressionEliminator/smoke.yul → test/libyul/yulOptimizerTests/commonSubexpressionEliminator/smoke.yul
View File

0
test/libjulia/yulOptimizerTests/commonSubexpressionEliminator/trivial.yul → test/libyul/yulOptimizerTests/commonSubexpressionEliminator/trivial.yul
View File

0
test/libjulia/yulOptimizerTests/commonSubexpressionEliminator/variable_for_variable.yul → test/libyul/yulOptimizerTests/commonSubexpressionEliminator/variable_for_variable.yul
View File

0
test/libjulia/yulOptimizerTests/disambiguator/for_statement.yul → test/libyul/yulOptimizerTests/disambiguator/for_statement.yul
View File

0
test/libjulia/yulOptimizerTests/disambiguator/funtion_call.yul → test/libyul/yulOptimizerTests/disambiguator/funtion_call.yul
View File

0
test/libjulia/yulOptimizerTests/disambiguator/if_statement.yul → test/libyul/yulOptimizerTests/disambiguator/if_statement.yul
View File

0
test/libjulia/yulOptimizerTests/disambiguator/smoke.yul → test/libyul/yulOptimizerTests/disambiguator/smoke.yul
View File

0
test/libjulia/yulOptimizerTests/disambiguator/smoke_yul.yul → test/libyul/yulOptimizerTests/disambiguator/smoke_yul.yul
View File

0
test/libjulia/yulOptimizerTests/disambiguator/switch_statement.yul → test/libyul/yulOptimizerTests/disambiguator/switch_statement.yul
View File

0
test/libjulia/yulOptimizerTests/disambiguator/variables.yul → test/libyul/yulOptimizerTests/disambiguator/variables.yul
View File

0
test/libjulia/yulOptimizerTests/disambiguator/variables_clash.yul → test/libyul/yulOptimizerTests/disambiguator/variables_clash.yul
View File

0
test/libjulia/yulOptimizerTests/disambiguator/variables_inside_functions.yul → test/libyul/yulOptimizerTests/disambiguator/variables_inside_functions.yul
View File

0
test/libjulia/yulOptimizerTests/expressionInliner/complex_with_evm.yul → test/libyul/yulOptimizerTests/expressionInliner/complex_with_evm.yul
View File

0
test/libjulia/yulOptimizerTests/expressionInliner/double_calls.yul → test/libyul/yulOptimizerTests/expressionInliner/double_calls.yul
View File

0
test/libjulia/yulOptimizerTests/expressionInliner/double_recursive_calls.yul → test/libyul/yulOptimizerTests/expressionInliner/double_recursive_calls.yul
View File

0
test/libjulia/yulOptimizerTests/expressionInliner/no_inline_mload.yul → test/libyul/yulOptimizerTests/expressionInliner/no_inline_mload.yul
View File

0
test/libjulia/yulOptimizerTests/expressionInliner/no_move_with_sideeffects.yul → test/libyul/yulOptimizerTests/expressionInliner/no_move_with_sideeffects.yul
View File

0
test/libjulia/yulOptimizerTests/expressionInliner/simple.yul → test/libyul/yulOptimizerTests/expressionInliner/simple.yul
View File

0
test/libjulia/yulOptimizerTests/expressionInliner/with_args.yul → test/libyul/yulOptimizerTests/expressionInliner/with_args.yul
View File

0
test/libjulia/yulOptimizerTests/expressionJoiner/if_condition.yul → test/libyul/yulOptimizerTests/expressionJoiner/if_condition.yul
View File

0
test/libjulia/yulOptimizerTests/expressionJoiner/muli_wrong_order3.yul → test/libyul/yulOptimizerTests/expressionJoiner/muli_wrong_order3.yul
View File

0
test/libjulia/yulOptimizerTests/expressionJoiner/multi.yul → test/libyul/yulOptimizerTests/expressionJoiner/multi.yul
View File

0
test/libjulia/yulOptimizerTests/expressionJoiner/multi_reference.yul → test/libyul/yulOptimizerTests/expressionJoiner/multi_reference.yul
View File

0
test/libjulia/yulOptimizerTests/expressionJoiner/multi_wrong_order.yul → test/libyul/yulOptimizerTests/expressionJoiner/multi_wrong_order.yul
View File

0
test/libjulia/yulOptimizerTests/expressionJoiner/multi_wrong_order2.yul → test/libyul/yulOptimizerTests/expressionJoiner/multi_wrong_order2.yul
View File

0
test/libjulia/yulOptimizerTests/expressionJoiner/no_replacement_across_blocks.yul → test/libyul/yulOptimizerTests/expressionJoiner/no_replacement_across_blocks.yul
View File

0
test/libjulia/yulOptimizerTests/expressionJoiner/no_replacement_in_loop_condition1.yul → test/libyul/yulOptimizerTests/expressionJoiner/no_replacement_in_loop_condition1.yul
View File

0
test/libjulia/yulOptimizerTests/expressionJoiner/no_replacement_in_loop_condition2.yul → test/libyul/yulOptimizerTests/expressionJoiner/no_replacement_in_loop_condition2.yul
View File

Some files were not shown because too many files have changed in this diff Show More