cerc-io/solidity
16
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

Rename Julia to Yul in comments

Browse Source
This commit is contained in:
Alex Beregszaszi 2018-06-18 23:26:31 +02:00
parent 91db46b128
commit 8fa8b2d08e
8 changed files with 11 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
libjulia/Exceptions.h
View File

@ -15,7 +15,7 @@
along with solidity. If not, see <http://www.gnu.org/licenses/>.
*/
/**
* Exceptions in Julia.
* Exceptions in Yul.
*/
#pragma once

2
libjulia/backends/evm/AbstractAssembly.h
View File

@ -42,7 +42,7 @@ namespace julia
{
///
/// Assembly class that abstracts both the libevmasm assembly and the new julia evm assembly.
/// Assembly class that abstracts both the libevmasm assembly and the new Yul assembly.
///
class AbstractAssembly
{

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

@ -15,7 +15,7 @@
along with solidity. If not, see <http://www.gnu.org/licenses/>.
*/
/**
* Common code generator for translating Julia / 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>

2
libjulia/backends/evm/EVMCodeTransform.h
View File

@ -15,7 +15,7 @@
along with solidity. If not, see <http://www.gnu.org/licenses/>.
*/
/**
* Common code generator for translating Julia / 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>

2
libjulia/optimiser/ASTCopier.h
View File

@ -62,7 +62,7 @@ public:
};
/**
* Creates a copy of a iulia AST potentially replacing identifier names.
* Creates a copy of a Yul AST potentially replacing identifier names.
* Base class to be extended.
*/
class ASTCopier: public ExpressionCopier, public StatementCopier

2
libjulia/optimiser/Disambiguator.h
View File

@ -38,7 +38,7 @@ namespace julia
{
/**
* Creates a copy of a iulia AST replacing all identifiers by unique names.
* Creates a copy of a Yul AST replacing all identifiers by unique names.
*/
class Disambiguator: public ASTCopier
{

6
libjulia/optimiser/README.md
View File

@ -1,6 +1,6 @@
## IULIA Optimiser
## Yul Optimiser
The iulia optimiser consists of several stages and components that all transform
The Yul optimiser consists of several stages and components that all transform
the AST in a semantically equivalent way. The goal is to end up either with code
that is shorter or at least only marginally longer but will allow further
optimisation steps.
@ -81,7 +81,7 @@ a loop or conditional, the first one is not inside), the first assignment is rem
## Expression Simplifier
This step can only be applied for the EVM-flavoured dialect of iulia. It applies
This step can only be applied for the EVM-flavoured dialect of Yul. It applies
simple rules like ``x + 0 == x`` to simplify expressions.
## Ineffective Statement Remover

4
libjulia/optimiser/UnusedPruner.cpp
View File

@ -59,7 +59,7 @@ void UnusedPruner::operator()(Block& _block)
// Multi-variable declarations are special. We can only remove it
// if all vairables are unused and the right-hand-side is either
// movable or it return a single value. In the latter case, we
// replace `let a := f()` by `pop(f())` (in pure IULIA, this will be
// replace `let a := f()` by `pop(f())` (in pure Yul, this will be
// `drop(f())`).
if (boost::algorithm::none_of(
varDecl.variables,
@ -74,7 +74,7 @@ void UnusedPruner::operator()(Block& _block)
statement = Block{std::move(varDecl.location), {}};
}
else if (varDecl.variables.size() == 1)
// In pure IULIA, this should be replaced by a function call to `drop`
// In pure Yul, this should be replaced by a function call to `drop`
// instead of `pop`.
statement = ExpressionStatement{varDecl.location, FunctionalInstruction{
varDecl.location,