AleoHQ/leo
1
1
Fork 0
mirror of https://github.com/AleoHQ/leo.git synced 2024-11-24 10:52:29 +03:00
Code Issues Packages Projects Releases Wiki Activity

core function imports

Browse Source
This commit is contained in:
gluaxspeed 2021-08-18 18:52:56 -07:00
parent d1350d7cd8
commit 4fc6c5f586
371 changed files with 2099 additions and 1191 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
Cargo.lock generated
View File

@ -1230,6 +1230,16 @@ dependencies = [
"tendril",
]
[[package]]
name = "leo-ast-passes"
version = "1.5.3"
dependencies = [
"indexmap",
"leo-ast",
"leo-errors",
"leo-parser",
]
[[package]]
name = "leo-compiler"
version = "1.5.3"
@ -1240,6 +1250,7 @@ dependencies = [
"leo-asg",
"leo-asg-passes",
"leo-ast",
"leo-ast-passes",
"leo-errors",
"leo-imports",
"leo-input",
@ -1291,6 +1302,7 @@ dependencies = [
"indexmap",
"leo-asg",
"leo-ast",
"leo-ast-passes",
"leo-errors",
"leo-parser",
"tracing",

1
Cargo.toml
View File

@ -29,6 +29,7 @@ members = [
"asg",
"asg-passes",
"ast",
"ast-passes",
"compiler",
"errors",
"grammar",

4
asg-passes/src/constant_folding/mod.rs
View File

@ -17,7 +17,7 @@
use std::cell::Cell;
use leo_asg::*;
use leo_errors::LeoError;
use leo_errors::Result;
pub struct ConstantFolding<'a, 'b> {
program: &'b Program<'a>,
@ -46,7 +46,7 @@ impl<'a, 'b> StatementVisitor<'a> for ConstantFolding<'a, 'b> {}
impl<'a, 'b> ProgramVisitor<'a> for ConstantFolding<'a, 'b> {}
impl<'a, 'b> AsgPass<'a> for ConstantFolding<'a, 'b> {
fn do_pass(asg: Program<'a>) -> Result<Program<'a>, LeoError> {
fn do_pass(asg: Program<'a>) -> Result<Program<'a>> {
let pass = ConstantFolding { program: &asg };
let mut director = VisitorDirector::new(pass);
director.visit_program(&asg).ok();

4
asg-passes/src/dead_code_elimination/mod.rs
View File

@ -17,7 +17,7 @@
use std::cell::Cell;
use leo_asg::*;
use leo_errors::LeoError;
use leo_errors::Result;
pub struct DeadCodeElimination {}
@ -66,7 +66,7 @@ impl<'a> ReconstructingReducerStatement<'a> for DeadCodeElimination {
}
impl<'a> AsgPass<'a> for DeadCodeElimination {
fn do_pass(asg: Program<'a>) -> Result<Program<'a>, LeoError> {
fn do_pass(asg: Program<'a>) -> Result<Program<'a>> {
let pass = DeadCodeElimination {};
let mut director = ReconstructingDirector::new(asg.context, pass);
Ok(director.reduce_program(asg))

3
asg/src/lib.rs
View File

@ -41,9 +41,6 @@ pub use input::*;
pub mod node;
pub use node::*;
pub mod prelude;
pub use prelude::*;
pub mod program;
pub use program::*;

45
asg/src/prelude.rs
View File

@ -1,45 +0,0 @@
// Copyright (C) 2019-2021 Aleo Systems Inc.
// This file is part of the Leo library.
// The Leo library 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.
// The Leo library 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 the Leo library. If not, see <https://www.gnu.org/licenses/>.
// TODO (protryon): We should merge this with core
// use crate::{AsgContext, Program};
// use leo_errors::Result;
// TODO (protryon): Make asg deep copy so we can cache resolved core modules
// TODO (protryon): Figure out how to do headers without bogus returns
/* pub fn resolve_core_module<'a>(context: AsgContext<'a>, module: &str) -> Result<Option<Program<'a>>> {
match module {
"unstable.blake2s" => {
let asg = crate::load_asg(
context,
r#"
circuit Blake2s {
function hash(seed: [u8; 32], message: [u8; 32]) -> [u8; 32] {
return [0; 32];
}
}
"#,
&mut crate::NullImportResolver,
)?;
asg.set_core_mapping("blake2s");
Ok(Some(asg))
}
_ => Ok(None),
}
}
*/

3
asg/src/program/circuit.rs
View File

@ -61,7 +61,7 @@ impl<'a> Circuit<'a> {
id: scope.context.get_id(),
name: RefCell::new(value.circuit_name.clone()),
members: RefCell::new(IndexMap::new()),
core_mapping: RefCell::new(None),
core_mapping: value.core_mapping.clone(),
span: Some(value.circuit_name.span.clone()),
scope: new_scope,
});
@ -153,6 +153,7 @@ impl<'a> Into<leo_ast::Circuit> for &Circuit<'a> {
.collect();
leo_ast::Circuit {
circuit_name: self.name.borrow().clone(),
core_mapping: self.core_mapping.clone(),
members,
}
}

6
asg/src/program/mod.rs
View File

@ -179,10 +179,4 @@ impl<'a> Program<'a> {
scope,
})
}
/* pub(crate) fn set_core_mapping(&self, mapping: &str) {
for (_, circuit) in self.circuits.iter() {
circuit.core_mapping.replace(Some(mapping.to_string()));
}
} */
}

3
asg/tests/fail/core/core_circuit_invalid.leo
View File

@ -1,3 +0,0 @@
import core.unstable.blake2s.BadCircuit; // `BadCircuit` is not included in the blake2s package
function main() {}

3
asg/tests/fail/core/core_circuit_star_fail.leo
View File

@ -1,3 +0,0 @@
import core.*; // You cannot import all dependencies from core at once
function main() {}

3
asg/tests/fail/core/core_package_invalid.leo
View File

@ -1,3 +0,0 @@
import core.bad_circuit; // `bad_circuit` is not a core package
function main() {}

3
asg/tests/fail/core/core_unstable_package_invalid.leo
View File

@ -1,3 +0,0 @@
import core.unstable.bad_circuit; // `bad_circuit` is not a core unstable package
function main() {}

26
asg/tests/fail/core/mod.rs
View File

@ -13,29 +13,3 @@
// You should have received a copy of the GNU General Public License
// along with the Leo library. If not, see <https://www.gnu.org/licenses/>.
use crate::load_asg;
#[test]
fn test_core_circuit_invalid() {
let program_string = include_str!("core_package_invalid.leo");
load_asg(program_string).err().unwrap();
}
#[test]
fn test_core_circuit_star_fail() {
let program_string = include_str!("core_circuit_star_fail.leo");
load_asg(program_string).err().unwrap();
}
#[test]
fn test_core_package_invalid() {
let program_string = include_str!("core_package_invalid.leo");
load_asg(program_string).err().unwrap();
}
#[test]
fn test_core_unstable_package_invalid() {
let program_string = include_str!("core_unstable_package_invalid.leo");
load_asg(program_string).err().unwrap();
}

3
asg/tests/mod.rs
View File

@ -28,8 +28,7 @@ fn load_asg(program_string: &str) -> Result<Program<'static>, LeoError> {
}
fn load_asg_imports<'a>(context: AsgContext<'a>, program_string: &str) -> Result<Program<'a>, LeoError> {
let mut ast = parse_ast(&TESTING_FILEPATH, program_string)?;
ast.canonicalize()?;
let ast = parse_ast(&TESTING_FILEPATH, program_string)?;
Program::new(context, &ast.as_repr())
}

15
asg/tests/pass/circuits/member_static_function_nested.leo
View File

@ -1,15 +0,0 @@
circuit Foo {
function qux() {}
function bar() {
Self::qux();
}
function baz() {
Self::bar();
}
}
function main() {
Foo::baz();
}

12
asg/tests/pass/circuits/mod.rs
View File

@ -73,12 +73,6 @@ fn test_member_static_function() {
load_asg(program_string).unwrap();
}
#[test]
fn test_member_static_function_nested() {
let program_string = include_str!("member_static_function_nested.leo");
load_asg(program_string).unwrap();
}
// Mutability
#[test]
@ -109,12 +103,6 @@ fn test_self_member_pass() {
// All
#[test]
fn test_pedersen_mock() {
let program_string = include_str!("pedersen_mock.leo");
load_asg(program_string).unwrap();
}
#[test]
fn test_define_circuit_inside_circuit_function() {
let program_string = include_str!("define_circuit_inside_circuit_function.leo");

27
asg/tests/pass/circuits/pedersen_mock.leo
View File

@ -1,27 +0,0 @@
circuit PedersenHash {
parameters: [u32; 512];
function new(const parameters: [u32; 512]) -> Self {
return Self { parameters: parameters };
}
function hash(self, const bits: [bool; 512]) -> u32 {
let digest: u32 = 0;
for i in 0..512 {
let base = bits[i] ? self.parameters[i] : 0u32;
digest += base;
}
return digest;
}
}
// The 'pedersen_hash' main function.
function main() {
const parameters = [0u32; 512];
const pedersen = PedersenHash::new(parameters);
const hash_input: [bool; 512] = [true; 512];
const res = pedersen.hash(hash_input);
console.assert(res == 0u32);
}

5
asg/tests/pass/core/blake2s_input.leo
View File

@ -1,5 +0,0 @@
import core.unstable.blake2s.Blake2s;
function main(seed: [u8; 32], message: [u8; 32]) -> [u8; 32] {
return Blake2s::hash(seed, message);
}

7
asg/tests/pass/core/blake2s_random.leo
View File

@ -1,7 +0,0 @@
import core.unstable.blake2s.Blake2s;
function main(seed: [u8; 32], message: [u8; 32], expected: [u8; 32]) {
let actual = Blake2s::hash(seed, message);
console.assert(expected == actual);
}

20
asg/tests/pass/core/mod.rs
View File

@ -13,23 +13,3 @@
// You should have received a copy of the GNU General Public License
// along with the Leo library. If not, see <https://www.gnu.org/licenses/>.
use crate::load_asg;
#[test]
fn test_unstable_blake2s() {
let program_string = include_str!("unstable_blake2s.leo");
load_asg(program_string).unwrap();
}
#[test]
fn test_blake2s_input() {
let program_string = include_str!("blake2s_input.leo");
load_asg(program_string).unwrap();
}
#[test]
fn test_blake2s_random() {
let program_string = include_str!("blake2s_random.leo");
load_asg(program_string).unwrap();
}

10
asg/tests/pass/core/unstable_blake2s.leo
View File

@ -1,10 +0,0 @@
import core.unstable.blake2s.Blake2s;
function main() {
const seed: [u8; 32] = [0; 32];
const message: [u8; 32] = [0; 32];
const result = Blake2s::hash(seed, message);
console.log("Result: {}", result);
}

36
ast-passes/Cargo.toml Normal file
View File

@ -0,0 +1,36 @@
[package]
name = "leo-ast-passes"
version = "1.5.3"
authors = [ "The Aleo Team <hello@aleo.org>" ]
description = "The Leo programming language"
homepage = "https://aleo.org"
repository = "https://github.com/AleoHQ/leo"
keywords = [
"aleo",
"cryptography",
"leo",
"programming-language",
"zero-knowledge"
]
categories = [ "cryptography::cryptocurrencies", "web-programming" ]
include = [ "Cargo.toml", "src", "README.md", "LICENSE.md" ]
license = "GPL-3.0"
edition = "2018"
[lib]
path = "src/lib.rs"
[dependencies]
indexmap = "1.7.0"
[dependencies.leo-ast]
path = "../ast"
version = "1.5.3"
[dependencies.leo-errors]
path = "../errors"
version = "1.5.3"
[dependencies.leo-parser]
path = "../parser"
version = "1.5.3"

596
ast-passes/LICENSE.md Normal file
View File

@ -0,0 +1,596 @@
GNU General Public License
==========================
Version 3, 29 June 2007
Copyright © 2007 Free Software Foundation, Inc. &lt;<https://fsf.org/>&gt;
Everyone is permitted to copy and distribute verbatim copies of this license
document, but changing it is not allowed.
## Preamble
The GNU General Public License is a free, copyleft license for software and other
kinds of works.
The licenses for most software and other practical works are designed to take away
your freedom to share and change the works. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change all versions of a
program--to make sure it remains free software for all its users. We, the Free
Software Foundation, use the GNU General Public License for most of our software; it
applies also to any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not price. Our General
Public Licenses are designed to make sure that you have the freedom to distribute
copies of free software (and charge for them if you wish), that you receive source
code or can get it if you want it, that you can change the software or use pieces of
it in new free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you these rights or
asking you to surrender the rights. Therefore, you have certain responsibilities if
you distribute copies of the software, or if you modify it: responsibilities to
respect the freedom of others.
For example, if you distribute copies of such a program, whether gratis or for a fee,
you must pass on to the recipients the same freedoms that you received. You must make
sure that they, too, receive or can get the source code. And you must show them these
terms so they know their rights.
Developers that use the GNU GPL protect your rights with two steps: **(1)** assert
copyright on the software, and **(2)** offer you this License giving you legal permission
to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains that there is
no warranty for this free software. For both users' and authors' sake, the GPL
requires that modified versions be marked as changed, so that their problems will not
be attributed erroneously to authors of previous versions.
Some devices are designed to deny users access to install or run modified versions of
the software inside them, although the manufacturer can do so. This is fundamentally
incompatible with the aim of protecting users' freedom to change the software. The
systematic pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we have designed
this version of the GPL to prohibit the practice for those products. If such problems
arise substantially in other domains, we stand ready to extend this provision to
those domains in future versions of the GPL, as needed to protect the freedom of
users.
Finally, every program is threatened constantly by software patents. States should
not allow patents to restrict development and use of software on general-purpose
computers, but in those that do, we wish to avoid the special danger that patents
applied to a free program could make it effectively proprietary. To prevent this, the
GPL assures that patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and modification follow.
## TERMS AND CONDITIONS
### 0. Definitions
“This License” refers to version 3 of the GNU General Public License.
“Copyright” also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
“The Program” refers to any copyrightable work licensed under this
License. Each licensee is addressed as “you”. “Licensees” and
“recipients” may be individuals or organizations.
To “modify” a work means to copy from or adapt all or part of the work in
a fashion requiring copyright permission, other than the making of an exact copy. The
resulting work is called a “modified version” of the earlier work or a
work “based on” the earlier work.
A “covered work” means either the unmodified Program or a work based on
the Program.
To “propagate” a work means to do anything with it that, without
permission, would make you directly or secondarily liable for infringement under
applicable copyright law, except executing it on a computer or modifying a private
copy. Propagation includes copying, distribution (with or without modification),
making available to the public, and in some countries other activities as well.
To “convey” a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through a computer
network, with no transfer of a copy, is not conveying.
An interactive user interface displays “Appropriate Legal Notices” to the
extent that it includes a convenient and prominently visible feature that **(1)**
displays an appropriate copyright notice, and **(2)** tells the user that there is no
warranty for the work (except to the extent that warranties are provided), that
licensees may convey the work under this License, and how to view a copy of this
License. If the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
### 1. Source Code
The “source code” for a work means the preferred form of the work for
making modifications to it. “Object code” means any non-source form of a
work.
A “Standard Interface” means an interface that either is an official
standard defined by a recognized standards body, or, in the case of interfaces
specified for a particular programming language, one that is widely used among
developers working in that language.
The “System Libraries” of an executable work include anything, other than
the work as a whole, that **(a)** is included in the normal form of packaging a Major
Component, but which is not part of that Major Component, and **(b)** serves only to
enable use of the work with that Major Component, or to implement a Standard
Interface for which an implementation is available to the public in source code form.
A “Major Component”, in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system (if any) on which
the executable work runs, or a compiler used to produce the work, or an object code
interpreter used to run it.
The “Corresponding Source” for a work in object code form means all the
source code needed to generate, install, and (for an executable work) run the object
code and to modify the work, including scripts to control those activities. However,
it does not include the work's System Libraries, or general-purpose tools or
generally available free programs which are used unmodified in performing those
activities but which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for the work, and
the source code for shared libraries and dynamically linked subprograms that the work
is specifically designed to require, such as by intimate data communication or
control flow between those subprograms and other parts of the work.
The Corresponding Source need not include anything that users can regenerate
automatically from other parts of the Corresponding Source.
The Corresponding Source for a work in source code form is that same work.
### 2. Basic Permissions
All rights granted under this License are granted for the term of copyright on the
Program, and are irrevocable provided the stated conditions are met. This License
explicitly affirms your unlimited permission to run the unmodified Program. The
output from running a covered work is covered by this License only if the output,
given its content, constitutes a covered work. This License acknowledges your rights
of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not convey, without
conditions so long as your license otherwise remains in force. You may convey covered
works to others for the sole purpose of having them make modifications exclusively
for you, or provide you with facilities for running those works, provided that you
comply with the terms of this License in conveying all material for which you do not
control copyright. Those thus making or running the covered works for you must do so
exclusively on your behalf, under your direction and control, on terms that prohibit
them from making any copies of your copyrighted material outside their relationship
with you.
Conveying under any other circumstances is permitted solely under the conditions
stated below. Sublicensing is not allowed; section 10 makes it unnecessary.
### 3. Protecting Users' Legal Rights From Anti-Circumvention Law
No covered work shall be deemed part of an effective technological measure under any
applicable law fulfilling obligations under article 11 of the WIPO copyright treaty
adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention
of such measures.
When you convey a covered work, you waive any legal power to forbid circumvention of
technological measures to the extent such circumvention is effected by exercising
rights under this License with respect to the covered work, and you disclaim any
intention to limit operation or modification of the work as a means of enforcing,
against the work's users, your or third parties' legal rights to forbid circumvention
of technological measures.
### 4. Conveying Verbatim Copies
You may convey verbatim copies of the Program's source code as you receive it, in any
medium, provided that you conspicuously and appropriately publish on each copy an
appropriate copyright notice; keep intact all notices stating that this License and
any non-permissive terms added in accord with section 7 apply to the code; keep
intact all notices of the absence of any warranty; and give all recipients a copy of
this License along with the Program.
You may charge any price or no price for each copy that you convey, and you may offer
support or warranty protection for a fee.
### 5. Conveying Modified Source Versions
You may convey a work based on the Program, or the modifications to produce it from
the Program, in the form of source code under the terms of section 4, provided that
you also meet all of these conditions:
* **a)** The work must carry prominent notices stating that you modified it, and giving a
relevant date.
* **b)** The work must carry prominent notices stating that it is released under this
License and any conditions added under section 7. This requirement modifies the
requirement in section 4 to “keep intact all notices”.
* **c)** You must license the entire work, as a whole, under this License to anyone who
comes into possession of a copy. This License will therefore apply, along with any
applicable section 7 additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no permission to license the
work in any other way, but it does not invalidate such permission if you have
separately received it.
* **d)** If the work has interactive user interfaces, each must display Appropriate Legal
Notices; however, if the Program has interactive interfaces that do not display
Appropriate Legal Notices, your work need not make them do so.
A compilation of a covered work with other separate and independent works, which are
not by their nature extensions of the covered work, and which are not combined with
it such as to form a larger program, in or on a volume of a storage or distribution
medium, is called an “aggregate” if the compilation and its resulting
copyright are not used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work in an aggregate
does not cause this License to apply to the other parts of the aggregate.
### 6. Conveying Non-Source Forms
You may convey a covered work in object code form under the terms of sections 4 and
5, provided that you also convey the machine-readable Corresponding Source under the
terms of this License, in one of these ways:
* **a)** Convey the object code in, or embodied in, a physical product (including a
physical distribution medium), accompanied by the Corresponding Source fixed on a
durable physical medium customarily used for software interchange.
* **b)** Convey the object code in, or embodied in, a physical product (including a
physical distribution medium), accompanied by a written offer, valid for at least
three years and valid for as long as you offer spare parts or customer support for
that product model, to give anyone who possesses the object code either **(1)** a copy of
the Corresponding Source for all the software in the product that is covered by this
License, on a durable physical medium customarily used for software interchange, for
a price no more than your reasonable cost of physically performing this conveying of
source, or **(2)** access to copy the Corresponding Source from a network server at no
charge.
* **c)** Convey individual copies of the object code with a copy of the written offer to
provide the Corresponding Source. This alternative is allowed only occasionally and
noncommercially, and only if you received the object code with such an offer, in
accord with subsection 6b.
* **d)** Convey the object code by offering access from a designated place (gratis or for
a charge), and offer equivalent access to the Corresponding Source in the same way
through the same place at no further charge. You need not require recipients to copy
the Corresponding Source along with the object code. If the place to copy the object
code is a network server, the Corresponding Source may be on a different server
(operated by you or a third party) that supports equivalent copying facilities,
provided you maintain clear directions next to the object code saying where to find
the Corresponding Source. Regardless of what server hosts the Corresponding Source,
you remain obligated to ensure that it is available for as long as needed to satisfy
these requirements.
* **e)** Convey the object code using peer-to-peer transmission, provided you inform
other peers where the object code and Corresponding Source of the work are being
offered to the general public at no charge under subsection 6d.
A separable portion of the object code, whose source code is excluded from the
Corresponding Source as a System Library, need not be included in conveying the
object code work.
A “User Product” is either **(1)** a “consumer product”, which
means any tangible personal property which is normally used for personal, family, or
household purposes, or **(2)** anything designed or sold for incorporation into a
dwelling. In determining whether a product is a consumer product, doubtful cases
shall be resolved in favor of coverage. For a particular product received by a
particular user, “normally used” refers to a typical or common use of
that class of product, regardless of the status of the particular user or of the way
in which the particular user actually uses, or expects or is expected to use, the
product. A product is a consumer product regardless of whether the product has
substantial commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
“Installation Information” for a User Product means any methods,
procedures, authorization keys, or other information required to install and execute
modified versions of a covered work in that User Product from a modified version of
its Corresponding Source. The information must suffice to ensure that the continued
functioning of the modified object code is in no case prevented or interfered with
solely because modification has been made.
If you convey an object code work under this section in, or with, or specifically for
use in, a User Product, and the conveying occurs as part of a transaction in which
the right of possession and use of the User Product is transferred to the recipient
in perpetuity or for a fixed term (regardless of how the transaction is
characterized), the Corresponding Source conveyed under this section must be
accompanied by the Installation Information. But this requirement does not apply if
neither you nor any third party retains the ability to install modified object code
on the User Product (for example, the work has been installed in ROM).
The requirement to provide Installation Information does not include a requirement to
continue to provide support service, warranty, or updates for a work that has been
modified or installed by the recipient, or for the User Product in which it has been
modified or installed. Access to a network may be denied when the modification itself
materially and adversely affects the operation of the network or violates the rules
and protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided, in accord with
this section must be in a format that is publicly documented (and with an
implementation available to the public in source code form), and must require no
special password or key for unpacking, reading or copying.
### 7. Additional Terms
“Additional permissions” are terms that supplement the terms of this
License by making exceptions from one or more of its conditions. Additional
permissions that are applicable to the entire Program shall be treated as though they
were included in this License, to the extent that they are valid under applicable
law. If additional permissions apply only to part of the Program, that part may be
used separately under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option remove any
additional permissions from that copy, or from any part of it. (Additional
permissions may be written to require their own removal in certain cases when you
modify the work.) You may place additional permissions on material, added by you to a
covered work, for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you add to a
covered work, you may (if authorized by the copyright holders of that material)
supplement the terms of this License with terms:
* **a)** Disclaiming warranty or limiting liability differently from the terms of
sections 15 and 16 of this License; or
* **b)** Requiring preservation of specified reasonable legal notices or author
attributions in that material or in the Appropriate Legal Notices displayed by works
containing it; or
* **c)** Prohibiting misrepresentation of the origin of that material, or requiring that
modified versions of such material be marked in reasonable ways as different from the
original version; or
* **d)** Limiting the use for publicity purposes of names of licensors or authors of the
material; or
* **e)** Declining to grant rights under trademark law for use of some trade names,
trademarks, or service marks; or
* **f)** Requiring indemnification of licensors and authors of that material by anyone
who conveys the material (or modified versions of it) with contractual assumptions of
liability to the recipient, for any liability that these contractual assumptions
directly impose on those licensors and authors.
All other non-permissive additional terms are considered “further
restrictions” within the meaning of section 10. If the Program as you received
it, or any part of it, contains a notice stating that it is governed by this License
along with a term that is a further restriction, you may remove that term. If a
license document contains a further restriction but permits relicensing or conveying
under this License, you may add to a covered work material governed by the terms of
that license document, provided that the further restriction does not survive such
relicensing or conveying.
If you add terms to a covered work in accord with this section, you must place, in
the relevant source files, a statement of the additional terms that apply to those
files, or a notice indicating where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the form of a
separately written license, or stated as exceptions; the above requirements apply
either way.
### 8. Termination
You may not propagate or modify a covered work except as expressly provided under
this License. Any attempt otherwise to propagate or modify it is void, and will
automatically terminate your rights under this License (including any patent licenses
granted under the third paragraph of section 11).
However, if you cease all violation of this License, then your license from a
particular copyright holder is reinstated **(a)** provisionally, unless and until the
copyright holder explicitly and finally terminates your license, and **(b)** permanently,
if the copyright holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is reinstated permanently
if the copyright holder notifies you of the violation by some reasonable means, this
is the first time you have received notice of violation of this License (for any
work) from that copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the licenses of
parties who have received copies or rights from you under this License. If your
rights have been terminated and not permanently reinstated, you do not qualify to
receive new licenses for the same material under section 10.
### 9. Acceptance Not Required for Having Copies
You are not required to accept this License in order to receive or run a copy of the
Program. Ancillary propagation of a covered work occurring solely as a consequence of
using peer-to-peer transmission to receive a copy likewise does not require
acceptance. However, nothing other than this License grants you permission to
propagate or modify any covered work. These actions infringe copyright if you do not
accept this License. Therefore, by modifying or propagating a covered work, you
indicate your acceptance of this License to do so.
### 10. Automatic Licensing of Downstream Recipients
Each time you convey a covered work, the recipient automatically receives a license
from the original licensors, to run, modify and propagate that work, subject to this
License. You are not responsible for enforcing compliance by third parties with this
License.
An “entity transaction” is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an organization, or
merging organizations. If propagation of a covered work results from an entity
transaction, each party to that transaction who receives a copy of the work also
receives whatever licenses to the work the party's predecessor in interest had or
could give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if the predecessor
has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the rights granted or
affirmed under this License. For example, you may not impose a license fee, royalty,
or other charge for exercise of rights granted under this License, and you may not
initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging
that any patent claim is infringed by making, using, selling, offering for sale, or
importing the Program or any portion of it.
### 11. Patents
A “contributor” is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The work thus
licensed is called the contributor's “contributor version”.
A contributor's “essential patent claims” are all patent claims owned or
controlled by the contributor, whether already acquired or hereafter acquired, that
would be infringed by some manner, permitted by this License, of making, using, or
selling its contributor version, but do not include claims that would be infringed
only as a consequence of further modification of the contributor version. For
purposes of this definition, “control” includes the right to grant patent
sublicenses in a manner consistent with the requirements of this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free patent license
under the contributor's essential patent claims, to make, use, sell, offer for sale,
import and otherwise run, modify and propagate the contents of its contributor
version.
In the following three paragraphs, a “patent license” is any express
agreement or commitment, however denominated, not to enforce a patent (such as an
express permission to practice a patent or covenant not to sue for patent
infringement). To “grant” such a patent license to a party means to make
such an agreement or commitment not to enforce a patent against the party.
If you convey a covered work, knowingly relying on a patent license, and the
Corresponding Source of the work is not available for anyone to copy, free of charge
and under the terms of this License, through a publicly available network server or
other readily accessible means, then you must either **(1)** cause the Corresponding
Source to be so available, or **(2)** arrange to deprive yourself of the benefit of the
patent license for this particular work, or **(3)** arrange, in a manner consistent with
the requirements of this License, to extend the patent license to downstream
recipients. “Knowingly relying” means you have actual knowledge that, but
for the patent license, your conveying the covered work in a country, or your
recipient's use of the covered work in a country, would infringe one or more
identifiable patents in that country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or arrangement, you
convey, or propagate by procuring conveyance of, a covered work, and grant a patent
license to some of the parties receiving the covered work authorizing them to use,
propagate, modify or convey a specific copy of the covered work, then the patent
license you grant is automatically extended to all recipients of the covered work and
works based on it.
A patent license is “discriminatory” if it does not include within the
scope of its coverage, prohibits the exercise of, or is conditioned on the
non-exercise of one or more of the rights that are specifically granted under this
License. You may not convey a covered work if you are a party to an arrangement with
a third party that is in the business of distributing software, under which you make
payment to the third party based on the extent of your activity of conveying the
work, and under which the third party grants, to any of the parties who would receive
the covered work from you, a discriminatory patent license **(a)** in connection with
copies of the covered work conveyed by you (or copies made from those copies), or **(b)**
primarily for and in connection with specific products or compilations that contain
the covered work, unless you entered into that arrangement, or that patent license
was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting any implied
license or other defenses to infringement that may otherwise be available to you
under applicable patent law.
### 12. No Surrender of Others' Freedom
If conditions are imposed on you (whether by court order, agreement or otherwise)
that contradict the conditions of this License, they do not excuse you from the
conditions of this License. If you cannot convey a covered work so as to satisfy
simultaneously your obligations under this License and any other pertinent
obligations, then as a consequence you may not convey it at all. For example, if you
agree to terms that obligate you to collect a royalty for further conveying from
those to whom you convey the Program, the only way you could satisfy both those terms
and this License would be to refrain entirely from conveying the Program.
### 13. Use with the GNU Affero General Public License
Notwithstanding any other provision of this License, you have permission to link or
combine any covered work with a work licensed under version 3 of the GNU Affero
General Public License into a single combined work, and to convey the resulting work.
The terms of this License will continue to apply to the part which is the covered
work, but the special requirements of the GNU Affero General Public License, section
13, concerning interaction through a network will apply to the combination as such.
### 14. Revised Versions of this License
The Free Software Foundation may publish revised and/or new versions of the GNU
General Public License from time to time. Such new versions will be similar in spirit
to the present version, but may differ in detail to address new problems or concerns.
Each version is given a distinguishing version number. If the Program specifies that
a certain numbered version of the GNU General Public License “or any later
version” applies to it, you have the option of following the terms and
conditions either of that numbered version or of any later version published by the
Free Software Foundation. If the Program does not specify a version number of the GNU
General Public License, you may choose any version ever published by the Free
Software Foundation.
If the Program specifies that a proxy can decide which future versions of the GNU
General Public License can be used, that proxy's public statement of acceptance of a
version permanently authorizes you to choose that version for the Program.
Later license versions may give you additional or different permissions. However, no
additional obligations are imposed on any author or copyright holder as a result of
your choosing to follow a later version.
### 15. Disclaimer of Warranty
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM “AS IS” WITHOUT WARRANTY OF ANY KIND, EITHER
EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE
QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE
DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
### 16. Limitation of Liability
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY
COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS
PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL,
INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE
OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE
WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
### 17. Interpretation of Sections 15 and 16
If the disclaimer of warranty and limitation of liability provided above cannot be
given local legal effect according to their terms, reviewing courts shall apply local
law that most closely approximates an absolute waiver of all civil liability in
connection with the Program, unless a warranty or assumption of liability accompanies
a copy of the Program in return for a fee.
_END OF TERMS AND CONDITIONS_
## How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest possible use to
the public, the best way to achieve this is to make it free software which everyone
can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest to attach them
to the start of each source file to most effectively state the exclusion of warranty;
and each file should have at least the “copyright” line and a pointer to
where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program 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.
This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short notice like this
when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program comes with ABSOLUTELY NO WARRANTY; for details type 'show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type 'show c' for details.
The hypothetical commands `show w` and `show c` should show the appropriate parts of
the General Public License. Of course, your program's commands might be different;
for a GUI interface, you would use an “about box”.
You should also get your employer (if you work as a programmer) or school, if any, to
sign a “copyright disclaimer” for the program, if necessary. For more
information on this, and how to apply and follow the GNU GPL, see
&lt;<http://www.gnu.org/licenses/>&gt;.
The GNU General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may consider it
more useful to permit linking proprietary applications with the library. If this is
what you want to do, use the GNU Lesser General Public License instead of this
License. But first, please read
&lt;<http://www.gnu.org/philosophy/why-not-lgpl.html>&gt;.

1
ast-passes/README.md Normal file
View File

@ -0,0 +1 @@
# leo-ast-passes

13
ast/src/reducer/canonicalization.rs → ast-passes/src/canonicalization/canonicalizer.rs
View File

@ -14,7 +14,7 @@
// You should have received a copy of the GNU General Public License
// along with the Leo library. If not, see <https://www.gnu.org/licenses/>.
use crate::*;
use leo_ast::*;
use leo_errors::{AstError, Result, Span};
/// Replace Self when it is in a enclosing circuit type.
@ -38,6 +38,14 @@ impl Default for Canonicalizer {
}
}
impl AstPass for Canonicalizer {
fn do_pass(ast: Program) -> Result<Ast> {
Ok(Ast::new(
ReconstructingDirector::new(Self::default()).reduce_program(&ast)?,
))
}
}
impl Canonicalizer {
pub fn canonicalize_accesses(
&mut self,
@ -663,13 +671,14 @@ impl ReconstructingReducer for Canonicalizer {
fn reduce_circuit(
&mut self,
_circuit: &Circuit,
circuit: &Circuit,
circuit_name: Identifier,
members: Vec<CircuitMember>,
) -> Result<Circuit> {
self.circuit_name = Some(circuit_name.clone());
let circ = Circuit {
circuit_name,
core_mapping: circuit.core_mapping.clone(),
members: members
.iter()
.map(|member| self.canonicalize_circuit_member(member))

18
ast-passes/src/canonicalization/mod.rs Normal file
View File

@ -0,0 +1,18 @@
// Copyright (C) 2019-2021 Aleo Systems Inc.
// This file is part of the Leo library.
// The Leo library 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.
// The Leo library 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 the Leo library. If not, see <https://www.gnu.org/licenses/>.
pub mod canonicalizer;
pub use canonicalizer::*;

12
ast/src/reducer/importer.rs → ast-passes/src/import_resolution/importer.rs
View File

@ -14,8 +14,10 @@
// You should have received a copy of the GNU General Public License
// along with the Leo library. If not, see <https://www.gnu.org/licenses/>.
use crate::*;
use leo_errors::{AstError, Span};
use crate::resolver::*;
use leo_ast::*;
use leo_errors::{AstError, Result, Span};
use indexmap::IndexMap;
@ -33,6 +35,12 @@ where
pub fn new(import_resolver: T) -> Self {
Self { import_resolver }
}
pub fn do_pass(ast: Program, importer: T) -> Result<Ast> {
Ok(Ast::new(
ReconstructingDirector::new(Importer::new(importer)).reduce_program(&ast)?,
))
}
}
/// Enumerates what names are imported from a package.

21
ast-passes/src/import_resolution/mod.rs Normal file
View File

@ -0,0 +1,21 @@
// Copyright (C) 2019-2021 Aleo Systems Inc.
// This file is part of the Leo library.
// The Leo library 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.
// The Leo library 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 the Leo library. If not, see <https://www.gnu.org/licenses/>.
pub mod importer;
pub use self::importer::*;
pub mod resolver;
pub use self::resolver::*;

36
ast/src/reducer/resolver.rs → ast-passes/src/import_resolution/resolver.rs
View File

@ -14,7 +14,7 @@
// You should have received a copy of the GNU General Public License
// along with the Leo library. If not, see <https://www.gnu.org/licenses/>.
use crate::Program;
use leo_ast::Program;
use leo_errors::{Result, Span};
use indexmap::IndexMap;
@ -61,23 +61,29 @@ impl ImportResolver for MockedImportResolver {
}
}
// TODO: Remove this.
pub fn load_ast(content: &str) -> Result<Program> {
// Parses the Leo file and constructs a grammar ast.
Ok(leo_parser::parse_ast("input.leo", content)?.into_repr())
}
// TODO: We should merge this with core
// TODO: Make asg deep copy so we can cache resolved core modules
// TODO: Figure out how to do headers without bogus returns
pub fn resolve_core_module(module: &str) -> Result<Option<Program>> {
match module {
"unstable.blake2s" => {
// let ast = load_asg(
// context,
// r#"
// circuit Blake2s {
// function hash(seed: [u8; 32], message: [u8; 32]) -> [u8; 32] {
// return [0; 32];
// }
// }
// "#,
// &mut crate::NullImportResolver,
// )?;
// asg.set_core_mapping("blake2s");
// Ok(Some(asg))
Ok(None)
let ast = load_ast(
r#"
circuit Blake2s {
function hash(seed: [u8; 32], message: [u8; 32]) -> [u8; 32] {
return [0; 32];
}
}
"#,
)?;
ast.set_core_mapping("blake2s");
Ok(Some(ast))
}
_ => Ok(None),
}

23
ast-passes/src/lib.rs Normal file
View File

@ -0,0 +1,23 @@
// Copyright (C) 2019-2021 Aleo Systems Inc.
// This file is part of the Leo library.
// The Leo library 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.
// The Leo library 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 the Leo library. If not, see <https://www.gnu.org/licenses/>.
#![doc = include_str!("../README.md")]
pub mod canonicalization;
pub use canonicalization::*;
pub mod import_resolution;
pub use import_resolution::*;

1
ast/src/circuits/circuit.rs
View File

@ -22,6 +22,7 @@ use std::fmt;
#[derive(Clone, PartialEq, Eq, Serialize, Deserialize)]
pub struct Circuit {
pub circuit_name: Identifier,
pub core_mapping: std::cell::RefCell<Option<String>>,
pub members: Vec<CircuitMember>,
}

7
ast/src/lib.rs
View File

@ -49,6 +49,9 @@ pub use self::imports::*;
pub mod input;
pub use self::input::*;
pub mod pass;
pub use self::pass::*;
pub mod program;
pub use self::program::*;
@ -83,7 +86,7 @@ impl Ast {
Self { ast: program }
}
/// Mutates the program ast by resolving the imports.
/* /// Mutates the program ast by resolving the imports.
pub fn importer<T: ImportResolver>(&mut self, importer: T) -> Result<()> {
self.ast = ReconstructingDirector::new(Importer::new(importer)).reduce_program(self.as_repr())?;
Ok(())
@ -93,7 +96,7 @@ impl Ast {
pub fn canonicalize(&mut self) -> Result<()> {
self.ast = ReconstructingDirector::new(Canonicalizer::default()).reduce_program(self.as_repr())?;
Ok(())
}
} */
/// Returns a reference to the inner program AST representation.
pub fn as_repr(&self) -> &Program {

22
ast/src/pass.rs Normal file
View File

@ -0,0 +1,22 @@
// Copyright (C) 2019-2021 Aleo Systems Inc.
// This file is part of the Leo library.
// The Leo library 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.
// The Leo library 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 the Leo library. If not, see <https://www.gnu.org/licenses/>.
use crate::{Ast, Program};
use leo_errors::Result;
pub trait AstPass {
fn do_pass(asg: Program) -> Result<Ast>;
}

6
ast/src/program.rs
View File

@ -79,6 +79,12 @@ impl Program {
}
}
pub fn set_core_mapping(&self, mapping: &str) {
for (_, circuit) in self.circuits.iter() {
circuit.core_mapping.replace(Some(mapping.to_string()));
}
}
pub fn get_name(&self) -> String {
self.name.to_string()
}

9
ast/src/reducer/mod.rs
View File

@ -14,17 +14,8 @@
// You should have received a copy of the GNU General Public License
// along with the Leo library. If not, see <https://www.gnu.org/licenses/>.
pub mod canonicalization;
pub use canonicalization::*;
pub mod reconstructing_reducer;
pub use reconstructing_reducer::*;
pub mod reconstructing_director;
pub use reconstructing_director::*;
pub mod importer;
pub use self::importer::*;
pub mod resolver;
pub use self::resolver::*;

8
ast/src/reducer/reconstructing_reducer.rs
View File

@ -445,11 +445,15 @@ pub trait ReconstructingReducer {
fn reduce_circuit(
&mut self,
_circuit: &Circuit,
circuit: &Circuit,
circuit_name: Identifier,
members: Vec<CircuitMember>,
) -> Result<Circuit> {
Ok(Circuit { circuit_name, members })
Ok(Circuit {
circuit_name,
core_mapping: circuit.core_mapping.clone(),
members,
})
}
fn reduce_annotation(&mut self, annotation: &Annotation, name: Identifier) -> Result<Annotation> {

4
compiler/Cargo.toml
View File

@ -53,6 +53,10 @@ version = "1.5.3"
path = "../asg-passes"
version = "1.5.3"
[dependencies.leo-ast-passes]
path = "../ast-passes"
version = "1.5.3"
[dependencies.leo-synthesizer]
path = "../synthesizer"
version = "1.5.3"

10
compiler/src/compiler.rs
View File

@ -21,7 +21,7 @@ use crate::{
};
pub use leo_asg::{new_context, AsgContext as Context, AsgContext};
use leo_asg::{Asg, AsgPass, Program as AsgProgram};
use leo_ast::{Input, MainInput, Program as AstProgram};
use leo_ast::{AstPass, Input, MainInput, Program as AstProgram};
use leo_errors::{CompilerError, Result};
use leo_input::LeoInputParser;
use leo_package::inputs::InputPairs;
@ -240,14 +240,18 @@ impl<'a, F: PrimeField, G: GroupType<F>> Compiler<'a, F, G> {
}
// Preform import resolution.
ast.importer(leo_imports::ImportParser::new(self.main_file_path.clone()))?;
// ast.importer(leo_imports::ImportParser::new(self.main_file_path.clone()))?;
ast = leo_ast_passes::Importer::do_pass(
ast.into_repr(),
leo_imports::ImportParser::new(self.main_file_path.clone()),
)?;
if self.ast_snapshot_options.imports_resolved {
ast.to_json_file(self.output_directory.clone(), "imports_resolved.json")?;
}
// Preform canonicalization of AST always.
ast.canonicalize()?;
ast = leo_ast_passes::Canonicalizer::do_pass(ast.into_repr())?;
if self.ast_snapshot_options.canonicalized {
ast.to_json_file(self.output_directory.clone(), "canonicalization_ast.json")?;

9
compiler/src/phase.rs
View File

@ -14,8 +14,13 @@
// You should have received a copy of the GNU General Public License
// along with the Leo library. If not, see <https://www.gnu.org/licenses/>.
use leo_asg::Program;
use leo_asg::Program as AsgProgram;
use leo_ast::Program as AstProgram;
pub trait ASGPhase {
fn apply(asg: &mut Program);
fn apply(asg: &mut AsgProgram);
}
pub trait ASTPhase {
fn apply(asg: &mut AstProgram);
}

4
imports/Cargo.toml
View File

@ -21,6 +21,10 @@ edition = "2018"
path = "../ast"
version = "1.5.3"
[dependencies.leo-ast-passes]
path = "../ast-passes"
version = "1.5.3"
[dependencies.leo-errors]
path = "../errors"
version = "1.5.3"

3
imports/src/parser/import_parser.rs
View File

@ -14,7 +14,8 @@
// You should have received a copy of the GNU General Public License
// along with the Leo library. If not, see <https://www.gnu.org/licenses/>.
use leo_ast::{ImportResolver, Program};
use leo_ast::Program;
use leo_ast_passes::ImportResolver;
use leo_errors::{ImportError, LeoError, Result, Span};
use indexmap::{IndexMap, IndexSet};

1
parser/src/parser/file.rs
View File

@ -412,6 +412,7 @@ impl ParserContext {
name.name.to_string(),
Circuit {
circuit_name: name,
core_mapping: std::cell::RefCell::new(None),
members,
},
))

6
tests/compiler/import_dependency/imports/dependency/src/main.leo
View File

@ -2,8 +2,4 @@ circuit Cave {
function name() -> [char; 4] {
return "cave";
}
}
function main() {
}
}

7
tests/expectations/compiler/compiler/address/branch.leo.out
View File

@ -16,6 +16,7 @@ outputs:
a:
type: bool
value: "true"
initial_ast: 0788eb39577304b655f147fe3045e1fad995b31811444afadc228bf99f505994
canonicalized_ast: 0788eb39577304b655f147fe3045e1fad995b31811444afadc228bf99f505994
type_inferenced_ast: 57aa71789a8ba7ac075f734ecc0450ae4b56b2343cff19e345cdab9c7715e1ee
initial_ast: dd6696f7af59ea9d65791b1af75b6dc58c5ba99f1c719f5f34906d6a73c5cba5
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: dd6696f7af59ea9d65791b1af75b6dc58c5ba99f1c719f5f34906d6a73c5cba5
type_inferenced_ast: 5ee9a99acd4238728efff9b0f60ab81bba5b313ba3cf6698932e4c5a1927865e

7
tests/expectations/compiler/compiler/address/equal.leo.out
View File

@ -22,6 +22,7 @@ outputs:
a:
type: bool
value: "false"
initial_ast: e057591dddc93027645e671870d9bb932a32647a600a452657e0a8a3748f0921
canonicalized_ast: e057591dddc93027645e671870d9bb932a32647a600a452657e0a8a3748f0921
type_inferenced_ast: 1d32fc5c118dc328274a6e2c4048c0efeea2b128fa2d2733ddf7d4fde4daf46f
initial_ast: 425bbc28260e7ebb4143822cc4828cdaaa07493634faa3c2f1052346632a190d
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 425bbc28260e7ebb4143822cc4828cdaaa07493634faa3c2f1052346632a190d
type_inferenced_ast: 5d42a0c55b1611d6edf2989e2d10b58a1e6f46c0e09f53b8d345794636b539e5

7
tests/expectations/compiler/compiler/address/index.leo.out
View File

@ -16,6 +16,7 @@ outputs:
a:
type: bool
value: "true"
initial_ast: 76cba1a1eb179db8b21c2e05403861e133983feec9b987c764a5584da78c16fb
canonicalized_ast: 76cba1a1eb179db8b21c2e05403861e133983feec9b987c764a5584da78c16fb
type_inferenced_ast: 822de2e0c4fdf74f7b476666b6a8a38782bd828dc2d216a7a68bf70edc444fbf
initial_ast: ca4d18696964e09c6964460490272877a1664e20c049e18169e5060af041156b
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: ca4d18696964e09c6964460490272877a1664e20c049e18169e5060af041156b
type_inferenced_ast: b1642d44d9fa241c7383aa54dedfd2bfd5361b5b4691657218b180e078bb2fe3

7
tests/expectations/compiler/compiler/address/ternary.leo.out
View File

@ -22,6 +22,7 @@ outputs:
a:
type: bool
value: "false"
initial_ast: 8a34bf070edd7585daad47802214b7df49b6df6dd9a6344644a4f121b320e449
canonicalized_ast: 8a34bf070edd7585daad47802214b7df49b6df6dd9a6344644a4f121b320e449
type_inferenced_ast: 2254abca31e4326444ef2066c8f85b3280505a3ecbaffaf7e472276a3034cc2f
initial_ast: 084c6d9fdf020a1453e2f0b15d284516169179a5324cffe423d225e7159aad0e
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 084c6d9fdf020a1453e2f0b15d284516169179a5324cffe423d225e7159aad0e
type_inferenced_ast: 032f5fc386538716648152e534ed351cd5c2546c73886d98ace298e073a7876d

7
tests/expectations/compiler/compiler/array/complex_access.leo.out
View File

@ -16,6 +16,7 @@ outputs:
out:
type: bool
value: "true"
initial_ast: 589670c04ad13f8dbe2ea01562fa6bdff1c6dfaf118730e60d0a55e5bb2168b9
canonicalized_ast: 82fd732401abaced235b6522298a454fd0491ea1dc0a80170773e1a129320657
type_inferenced_ast: 14321d2bd1a2d9da60f52372feee4c8bf6aa98d516c01bf309d219c903b7f241
initial_ast: bbdfca22b5ee00cd0a715e7ddd0e342dd8c4ec34446f78d486b251964caef71b
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 4fb51e3d1b31053d9b11a161e56effe5d3e3f90892e32d7fae5e7d7e6c3b474a
type_inferenced_ast: 3bc336b07606b1c9582151cc4a8ddd93ff8c6ac39014eb892abba67692341894

7
tests/expectations/compiler/compiler/array/equal_initializer.leo.out
View File

@ -22,6 +22,7 @@ outputs:
x:
type: bool
value: "false"
initial_ast: c4b7aca1f9002da95f8efab340d4dc5d38e64d97274b1815126e7f88f40e155a
canonicalized_ast: c8b633546058b56b76a0864ab0fce2aa7169554b716e17250ebc688708dcd206
type_inferenced_ast: 9411e52e1ab1ddec7d5d1111aa8c10a5ec916b9d5e86d24ed5348462ec0adb71
initial_ast: 53ceb9637c6339891bf3b58f9b9f06a5bd83b1f7c4312e21b8437c44f7acb6a2
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 137647e5acfe5fef8e3c1995e58527802db3667399f0cc96bcece3564475e695
type_inferenced_ast: 4b58dfe4387b31dd55b70bc6b69768eb05bf321465948e5748ad10dc327d00a1

7
tests/expectations/compiler/compiler/array/equal_initializer_2.leo.out
View File

@ -22,6 +22,7 @@ outputs:
x:
type: bool
value: "true"
initial_ast: 2cbe00dbca8111c92a55dcb9a18766ddb9a407e71535ae62d3bf4d6ec409fca2
canonicalized_ast: 75d8d33b9a5376fea14bb9821abe1bc5e1661cfccbf962f58facb42e539b1b04
type_inferenced_ast: 45b1b5d994a229da8fb761d97c474778a65b8a5fdd87cfbd6e4aaa4a1ddef7a0
initial_ast: e4367228e0cd49bc53aefbff05f472ca6d0561cbc67b1f20bfeb3bd8ea35a690
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 52d523284690f479c02ad15c3b0ebc978fa0d7d1988180ebabe7d695888cee47
type_inferenced_ast: cc5a783252ab74df46a176bdcbf56cd4a20688a1de24d4851d7c66b1a9b460a6

7
tests/expectations/compiler/compiler/array/input_nested_3x2.leo.out
View File

@ -16,6 +16,7 @@ outputs:
x:
type: bool
value: "true"
initial_ast: 002647d1f55a3b5f358cbd27beff81736973fc142dc3d708f8df8d634c1e8fa4
canonicalized_ast: b36a5f62c09093fcfce2797b89fe936c4bb94fe1e4aca6608cda4f529677b005
type_inferenced_ast: 524e0682eec030dda6f12637fb92af0122a7cf3986a8d7c974a2bc8a1554552d
initial_ast: b21bd2c74d5e897df1ca9454ac04360ee2712aefad1baaccd664f02fc421cd77
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: c72df790ad239fd934edf6842ea6cabc9b24a469a6b5e0c1a3efc85e2dd83602
type_inferenced_ast: caac141461cd4238b20ec214f269870f8d0a09156208b4aa67ed2cbca476519f

7
tests/expectations/compiler/compiler/array/input_tuple_3x2.leo.out
View File

@ -16,6 +16,7 @@ outputs:
x:
type: bool
value: "true"
initial_ast: c4b7aca1f9002da95f8efab340d4dc5d38e64d97274b1815126e7f88f40e155a
canonicalized_ast: c8b633546058b56b76a0864ab0fce2aa7169554b716e17250ebc688708dcd206
type_inferenced_ast: 9411e52e1ab1ddec7d5d1111aa8c10a5ec916b9d5e86d24ed5348462ec0adb71
initial_ast: 53ceb9637c6339891bf3b58f9b9f06a5bd83b1f7c4312e21b8437c44f7acb6a2
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 137647e5acfe5fef8e3c1995e58527802db3667399f0cc96bcece3564475e695
type_inferenced_ast: 4b58dfe4387b31dd55b70bc6b69768eb05bf321465948e5748ad10dc327d00a1

7
tests/expectations/compiler/compiler/array/multi_initializer.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 411fd383234eaff206ddb89e59c53eb3cf89cc0584065cbcc6a407f7b6c657da
canonicalized_ast: 8730ae623fae334d698ea4169b630365f3026e6b39264da353e194feb07c0863
type_inferenced_ast: 48ede78fbd4de76d6693bc2a50b813f119024f80d0a6c73f174f1a7ba56a92ce
initial_ast: 236c915aff81b43c7dd36a98970e2336d4c2221f6844619b631f14ec7d62e003
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 6093d8333e534dd60b7cd275acb53080fc903db82fb224325518f4def869d19b
type_inferenced_ast: b82cc536ebce65be69c200b1155d0def9eaccb6ce9c60208c33ca17db9027156

7
tests/expectations/compiler/compiler/array/nested.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 436ce80cb3f81cd43e5747a105b14947964f29c0c35070c394728cd2cd9b1fa3
canonicalized_ast: 3097d80c877f857bd36f1e3ca56aefd7524a2fc46239959190ae9c5ef166ba9a
type_inferenced_ast: 873a71a8f9894e1967f0f750d63011597f17e0a51b5cd42ea0b74191ffa357a1
initial_ast: 5fe3eb54995ebcbac1bb6b20c860ad880859f79faf4be905e5a651fe98d933c4
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: c9861e3c0ff9f9a05d329266861c2183e712a8f344f5161bdd640d755e602a01
type_inferenced_ast: 97ff0b786403ad5d12678954dda1fdf785b357015234c26cd24fc86dca2dbdd4

7
tests/expectations/compiler/compiler/array/nested_3x2_value.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 33a39a0f27f018eee2f2986d1356bcc9354ce3128447a60859f4392b8a4e4f29
canonicalized_ast: c227ab0a4e864f62af90e4b1d843dcd41e65b65354107558cf26383831010a1d
type_inferenced_ast: c2515f900d7b2ae04c80ed1f7a3bf5729fec502dffc910cae03ac8cf02530dce
initial_ast: 77dc240574ed87310aa2fc9203f6b1af92b18be84d3a22e87c4af68de5068791
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 6ebe763d7ff3781789f07f1038dbc5ba1ffbace7a3f75accd4d0213846e6a395
type_inferenced_ast: debe6716144af92597aee9719b8fed92c447707093a285bb274e0f02ddce55b8

7
tests/expectations/compiler/compiler/array/registers.leo.out
View File

@ -22,6 +22,7 @@ outputs:
r:
type: "[u8; 3]"
value: "\"123\""
initial_ast: c6b18b6fca7fda77a9eba151f4d27d084e1ad7aa616e6ec9deb1ef5f4bff2d24
canonicalized_ast: c6b18b6fca7fda77a9eba151f4d27d084e1ad7aa616e6ec9deb1ef5f4bff2d24
type_inferenced_ast: 6f6e6b35b55543bc87589005ac9a47830e3f65680a4db82e3f17d9280d6fa4ad
initial_ast: 7e1c0e290904318bcba5e521a1584f42f4f38747d30dec1352d36d6c6ac510b1
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 7e1c0e290904318bcba5e521a1584f42f4f38747d30dec1352d36d6c6ac510b1
type_inferenced_ast: 2c8ce9348a39719bfa2e322692bf5be787cd78cff2e21abc7220ed4cecb16140

7
tests/expectations/compiler/compiler/array/slice.leo.out
View File

@ -16,6 +16,7 @@ outputs:
x:
type: bool
value: "true"
initial_ast: e75ae154dab0f64ed38fc12e28289351e79787787e882847fbc020a780bc429f
canonicalized_ast: e75ae154dab0f64ed38fc12e28289351e79787787e882847fbc020a780bc429f
type_inferenced_ast: c5a14533d3c5d0751b98beb612a88eac2c7687ae77858dfcbc3424b160f1cd7d
initial_ast: 271d2b086f2ab3f0ddc2fccaf64c3160a4f3838c1c4d38e58bbeb92440293c6d
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 271d2b086f2ab3f0ddc2fccaf64c3160a4f3838c1c4d38e58bbeb92440293c6d
type_inferenced_ast: fadba5ca59c54dfe92247b9ba5e6e793e0973330a7a1b8f7a87a2b713d1303ed

7
tests/expectations/compiler/compiler/array/slice_lower.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 748ad013543f1352f922fc5b566b38bf6a9de939a566c4484660f17460ef5cee
canonicalized_ast: 748ad013543f1352f922fc5b566b38bf6a9de939a566c4484660f17460ef5cee
type_inferenced_ast: 80f8d5b301bc982f189c63a4d908c7bf7a9a2d5ea351778d740035bad95f166a
initial_ast: 9505a38403c73bab966dd15ed656df07aae9140fc5d933ae921faf4f1b824098
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 9505a38403c73bab966dd15ed656df07aae9140fc5d933ae921faf4f1b824098
type_inferenced_ast: 29c75c31d3fd1c1a14dea7919d14fca30c82dd894a50657ef5eb854d658b9de6

7
tests/expectations/compiler/compiler/array/spread.leo.out
View File

@ -16,6 +16,7 @@ outputs:
x:
type: bool
value: "true"
initial_ast: 97004d55104bcf3b6698926656fb23c849cc1c488e387d151c1f3e2be4438fe0
canonicalized_ast: 97004d55104bcf3b6698926656fb23c849cc1c488e387d151c1f3e2be4438fe0
type_inferenced_ast: 7294dc3dee9189573cbf54b90692869b2a02a78fb3bbb6fe3e2436d2cca377fc
initial_ast: 0fd92649a80a7ed0e72af11c3afcff5cd1353dd46e13bab22c5a62e795adefc6
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 0fd92649a80a7ed0e72af11c3afcff5cd1353dd46e13bab22c5a62e795adefc6
type_inferenced_ast: 11f1b4b59439cd6b4e218be2e7df05e92c7b722a955c3645d0aebee9d7208b4f

7
tests/expectations/compiler/compiler/array/ternary_in_array.leo.out
View File

@ -16,6 +16,7 @@ outputs:
x:
type: bool
value: "true"
initial_ast: aa978e3283733cfee6cef1e6eff20b4847cf56962ccb3501b6501d31cd42ddb5
canonicalized_ast: aa978e3283733cfee6cef1e6eff20b4847cf56962ccb3501b6501d31cd42ddb5
type_inferenced_ast: edcba3eea639506ff172054105ac6533c6d184c131240e73f896f307983ba3c2
initial_ast: 75cc551dcdd1ede61566d00dce39cc0c5d2a508988eabe5c19dfaa10536632c2
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 75cc551dcdd1ede61566d00dce39cc0c5d2a508988eabe5c19dfaa10536632c2
type_inferenced_ast: 3f707743b3739fe2972a73750feb516f0586187bf1041fd341151a165cc5864c

7
tests/expectations/compiler/compiler/array/tuple_3x2_value.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: f92dd478e6c8fdb9a7f0dfd3ad0cf9e6e0239c59e5ee1fda0851fdcdfb2ca589
canonicalized_ast: 0ce7eb5522cc65d45b259560b138eca8750b7a4231435f6b5df21c906db4d5ba
type_inferenced_ast: 1aeacac3268aed9b99f7d5a7736e9f32cd1a65905d3234d11ec5f6027bd68c66
initial_ast: 62499d4b773ecd59ede931032d7191d09c734c21d9ccc3220c3efbe579c03bf3
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: a2186b50b3dfd23d27fa146cd408f386fbf9249e7c99ead0fa7cabe4e3dac821
type_inferenced_ast: d942e3ed86de630af9a829dfb6d4a2a58d4e9746fb941d7d2b917b3a97fe12bf

7
tests/expectations/compiler/compiler/array/type_input_3x2.leo.out
View File

@ -16,6 +16,7 @@ outputs:
x:
type: bool
value: "true"
initial_ast: ab709670db7a5cc6642a175a78541054b53210f6be39a174d90ee57f3c5570f5
canonicalized_ast: ab709670db7a5cc6642a175a78541054b53210f6be39a174d90ee57f3c5570f5
type_inferenced_ast: f870e0b5181e4187da90ea8f7ea562596f0fea420425a403a972d761131718af
initial_ast: d581c28d08fdc2d027adcb450582cadbda63165532a121879157b6b2df3b1c21
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: d581c28d08fdc2d027adcb450582cadbda63165532a121879157b6b2df3b1c21
type_inferenced_ast: 650e762a41481d7445c3fa23036a6255945011130749fd52e799b96d8ae7d325

7
tests/expectations/compiler/compiler/array/type_input_4x3x2.leo.out
View File

@ -16,6 +16,7 @@ outputs:
x:
type: bool
value: "true"
initial_ast: 05ee62d30364f4d4ea3a6f680b049c3743d6fcb2cd7e751d798e61b38f1f0c70
canonicalized_ast: 05ee62d30364f4d4ea3a6f680b049c3743d6fcb2cd7e751d798e61b38f1f0c70
type_inferenced_ast: a1307016717f76519ff0f813ead70ed5460644e0e8414827665a1bd066159a76
initial_ast: 0977a86415107f195a0803c7f346a1943ab10eda3acf131efd814910fa0ecd8f
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 0977a86415107f195a0803c7f346a1943ab10eda3acf131efd814910fa0ecd8f
type_inferenced_ast: 221437bc369d7193c1214e1e18da47c505939b0b299cfb570e8e65e51ae82fa9

7
tests/expectations/compiler/compiler/array/type_nested_value_nested_3x2.leo.out
View File

@ -16,6 +16,7 @@ outputs:
x:
type: bool
value: "true"
initial_ast: 8caeaa858353e7f461b14364b898d538508c2e45c477c36dddc2960d4d626ed9
canonicalized_ast: 8caeaa858353e7f461b14364b898d538508c2e45c477c36dddc2960d4d626ed9
type_inferenced_ast: a61912871814695d648b0f176feaa0409b3d6bae3cb7c7a1234bf6543e015a5f
initial_ast: 896acd1ab0085e5d391e6178ca6d9b2cb6674d3e566fccdd375389a82618f905
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 896acd1ab0085e5d391e6178ca6d9b2cb6674d3e566fccdd375389a82618f905
type_inferenced_ast: ff80a68852e75e1c0401ce1cf7993b426c4891129f78832f8e10bc4f26f04fcd

7
tests/expectations/compiler/compiler/array/type_nested_value_nested_4x3x2.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 77b015384e8f21d34eef7f56465605fa133e739863a6bc33b01315232a86647e
canonicalized_ast: 77b015384e8f21d34eef7f56465605fa133e739863a6bc33b01315232a86647e
type_inferenced_ast: 4be69d8478185f5b9d4dcee3fc16ad4af858b7a47122bbc8e757d0dbc4bf92d8
initial_ast: 16fb098d2ea51e874835aca24e0ea1ef24d51cdf6e3374bf70c781fea8878a4a
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 16fb098d2ea51e874835aca24e0ea1ef24d51cdf6e3374bf70c781fea8878a4a
type_inferenced_ast: 3757d2a1f8d3bc6512ab921f06c5ebad4fb93dc9b35ca613f35d49c437d2fbf4

7
tests/expectations/compiler/compiler/array/type_nested_value_tuple_3x2.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: ce12666930386785c7a5afe142793c47eae62145ff1d50c590dc82c2b4baded6
canonicalized_ast: 8220bc2881fe07bbfa873376696618fc182aff993d2a7d1a23ace5cc00965ff8
type_inferenced_ast: c14a7e89debd9289883db476fdbc814d14bfc410d40d1ac100bbece88d35b7c8
initial_ast: 82f41814ab4e247a5fdd1a99a3ca83188492d56291f9bec3d8c1587245697f84
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: fc7f6031101346053f458f31cea55eefcd4770f7892aa74cd4e0cdfbb9743b08
type_inferenced_ast: d212fdad9f74f8fb08b417a3774ce358d67d4dcbf925b395aca3b8058e1ca21e

7
tests/expectations/compiler/compiler/array/type_nested_value_tuple_4x3x2.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 609dfd962592e1dbf90051979163cead865cb69c0722c641517fad4f3091ec57
canonicalized_ast: 4d6b8380c844ac6655c7dcc4c4a2ff45f14001577c82f21d87b4546e04c7e776
type_inferenced_ast: d86da787361b7cea05474815138f2a1f98642b93232641bf399647788c0d5ecd
initial_ast: b68151dbf7da38ee2f00223ea194854af0c624b889e66fe38bb46207a0eae75d
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: e9946a39a43de42d611a1a198e21e8f53d53c66e11b3ef6e25407040432512e5
type_inferenced_ast: c9fd7d05d46b56ebdca21092bfd107488bab758956c365380609b01b9f51e8f1

7
tests/expectations/compiler/compiler/array/type_tuple_value_nested_3x2.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 67cb2ae1b5b3e19a7c7aa8783d0f566b69bfb995e7848ec7746e1af0448c1aa8
canonicalized_ast: 4aba053c866851bfcd22da037e0270ad43a7fabbdc263629af52eea38d577b7a
type_inferenced_ast: b44ceb7749802ff53c82221efad075565264531500665a01aa94f745e0c304cd
initial_ast: 160aa96a5321941a1c2800d2d0a4aa87b07fd591ff2eed85f08a7bc806b6fc02
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 01065b3edc067c415ea87b136d196034490b3f31f48893d2844e206cf16b0555
type_inferenced_ast: a9417b4b4222b332379d1d34f4268209a2bf394bc47a1dc65f8d65e031877d38

7
tests/expectations/compiler/compiler/array/type_tuple_value_nested_4x3x2.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 9867f722c5ce3ccbc3701238c216acc2b7e37bdc6163a8f7a4a4d88b7f19b73a
canonicalized_ast: d5f9deb2b7806ec665a6c6a5a6a0bee2c76310ecec4f34a8a479aa6934902b3a
type_inferenced_ast: ed9cee663a3a9dc51ba06a80e5f192fdcc49e62b8e4cb0ae9582f3a7f7b1de25
initial_ast: 283a620a73600c82c3f99b6b8c6621936c52961d0576aa9748f3229e91f2b2a9
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: aa8026f8d075b1c86d7eef1858c30d29df4748d5458858d0237377ab33da993e
type_inferenced_ast: 75d5a8d06533c1b795a98d8bba17c45e563c33066c38fd65b4536076917969fd

7
tests/expectations/compiler/compiler/array/type_tuple_value_tuple_3x2.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 222950738e89721363dd15b8f5d240befa46d434c45f486857ec4898806d0e84
canonicalized_ast: b89098b4159b284f07be789cfb5b196515c9d33821be1411c4bc25ae3c90425f
type_inferenced_ast: 4e0acee05ff837a30c1057dec0c5cc18a6ce573e5891218990f88584fef683a7
initial_ast: c6e118fda48db36aca75ff9a2cf4faa4f5a61854a4cfd87dccb5fd699fd597cd
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 3e6423353de34af384d30cd5a3c95aca37a770389cc504cbfe0cae56aa79d99a
type_inferenced_ast: 672d4a535b16eaa9ebbf08c7b462ad6628b5282eff2397dc13b50776d1fb9d80

7
tests/expectations/compiler/compiler/array/type_tuple_value_tuple_4x3x2.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: a312fb26b99d2c4a7891d482079f0220663dba780bc68b9f651def2cd9bad960
canonicalized_ast: 01c472ee0495bbb164f67159e86483a29421918178a7115ebd3b905d6909150f
type_inferenced_ast: ac2c37891e21027028b4a1e4b8f5972e5ee64f91f6b2ba6a85218c622192ce02
initial_ast: c39ad5bd83f6cb83a6cfe24bfde06cc92a2ad12fe2c2833665659062eb012524
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: b8310f6b057520010f314f5c6f18d5fe56816d2d182f57640452d6d6051dc087
type_inferenced_ast: fa7ab6534b36f4aeddf37d451df3e4281c46c6440cae492299420caa3e159a0e

7
tests/expectations/compiler/compiler/boolean/and.leo.out
View File

@ -34,6 +34,7 @@ outputs:
x:
type: bool
value: "true"
initial_ast: 9f6929c30448a269b4a22f3001085be75f91bc91503978f2804f4d6bf7dd246f
canonicalized_ast: 9f6929c30448a269b4a22f3001085be75f91bc91503978f2804f4d6bf7dd246f
type_inferenced_ast: b41ada9ca834d73d94641fa3f28c95bea6e6862819bab431ac4b02cc342fb659
initial_ast: c3f09fbd295c5d30bb5e148d7b5a41faf4508de5dec1b0951303fb0268bc579e
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: c3f09fbd295c5d30bb5e148d7b5a41faf4508de5dec1b0951303fb0268bc579e
type_inferenced_ast: fa3b05137616480b9718358f077881e8670827f968f9e2893d5c8afe57364afd

7
tests/expectations/compiler/compiler/boolean/conditional.leo.out
View File

@ -34,6 +34,7 @@ outputs:
x:
type: bool
value: "true"
initial_ast: 3de9d88d40969c01145790a5903ab2dfa1a7614ec4f4d62c20b86b917653008e
canonicalized_ast: 3de9d88d40969c01145790a5903ab2dfa1a7614ec4f4d62c20b86b917653008e
type_inferenced_ast: 53a91ffe37b6a96f1c239669f04ab600f51d2a200a8aed2dee0dc50bb5fa4f7d
initial_ast: c566f6f42437cb9ef99fc6873d20dfeb81401ae2e2e22debeaead74dac4b714f
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: c566f6f42437cb9ef99fc6873d20dfeb81401ae2e2e22debeaead74dac4b714f
type_inferenced_ast: 8fde704fb16941f04f062500f8f47952f269b59ea9284ccec5de2ed10fb939e3

7
tests/expectations/compiler/compiler/boolean/equal.leo.out
View File

@ -34,6 +34,7 @@ outputs:
x:
type: bool
value: "true"
initial_ast: 7fe0c7281b31c1f126d41c425f852930de3283b0deb54362fba0834b6eb83ae3
canonicalized_ast: 7fe0c7281b31c1f126d41c425f852930de3283b0deb54362fba0834b6eb83ae3
type_inferenced_ast: 5c851d6f023000766f370ec5bc048af431212368c68fb1ba674500ae7451a36e
initial_ast: 079ebcb4152e0e2f584c183517b8b29777a1006f303e934c7c125ad0e09290ef
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 079ebcb4152e0e2f584c183517b8b29777a1006f303e934c7c125ad0e09290ef
type_inferenced_ast: ddad67aee58fa02297db8e5584491b38f374640e93b4ab16135af2e0b17ca7cc

7
tests/expectations/compiler/compiler/boolean/not_equal.leo.out
View File

@ -34,6 +34,7 @@ outputs:
x:
type: bool
value: "false"
initial_ast: aae17ba5bd2ce376b5c440df42be442b0731feb499fa37b133b89f364a8790bf
canonicalized_ast: aae17ba5bd2ce376b5c440df42be442b0731feb499fa37b133b89f364a8790bf
type_inferenced_ast: 5b110c3aa3e0d65942f7a7fdbdccfc745aa810ea7d71137358f220d2bfecb0b7
initial_ast: c36e26d05f20023e8bea0108cdb813abfa697c34c9491950597e276f7a613273
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: c36e26d05f20023e8bea0108cdb813abfa697c34c9491950597e276f7a613273
type_inferenced_ast: 13d8efc1e7d0d9e7b67d084eef73389461253929560271033b873e4c225057e4

7
tests/expectations/compiler/compiler/boolean/or.leo.out
View File

@ -34,6 +34,7 @@ outputs:
x:
type: bool
value: "true"
initial_ast: 35fd6670d1c00d5c70861e58f988536f86dbe84d26cb1cdf601228a3b784296e
canonicalized_ast: 35fd6670d1c00d5c70861e58f988536f86dbe84d26cb1cdf601228a3b784296e
type_inferenced_ast: 3dd86ce4e1ecce14619b49e274f1c3275ec7561f82655eadda4752f20e771802
initial_ast: 26d46b034c3a020d2ad41339ecaf7530491b3d76f08811da28ccf87c858a8026
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 26d46b034c3a020d2ad41339ecaf7530491b3d76f08811da28ccf87c858a8026
type_inferenced_ast: 92a0b9b921dc191d3887d7ff4ef733bea01cda136d7fcb13ae5bd665254903d3

7
tests/expectations/compiler/compiler/char/circuit.leo.out
View File

@ -100,6 +100,7 @@ outputs:
r:
type: char
value: "'\\u{1f62d}'"
initial_ast: aa3eb0c4de0eebada9490b11e35c36923316559727a3afce28fe3852a805354a
canonicalized_ast: aa3eb0c4de0eebada9490b11e35c36923316559727a3afce28fe3852a805354a
type_inferenced_ast: 73309200d30bf2831847477f3da7ede4ba9f4aa377e6ebf15c9c34774f53bcb5
initial_ast: c75622dff123827534b2fc2b4bc756dbc83ecb57d1d20137279199be99266beb
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: c75622dff123827534b2fc2b4bc756dbc83ecb57d1d20137279199be99266beb
type_inferenced_ast: ceda0b0bcffdec7f0c355625a85da761ab0dad078efa2884c000a53a37cfb5d4

7
tests/expectations/compiler/compiler/char/neq.leo.out
View File

@ -100,6 +100,7 @@ outputs:
r:
type: char
value: "'a'"
initial_ast: d3a773c0b0555cc2c3a6d2fafb9e567488ea8fd91ea965f758ec9f58a4679dd7
canonicalized_ast: d3a773c0b0555cc2c3a6d2fafb9e567488ea8fd91ea965f758ec9f58a4679dd7
type_inferenced_ast: 460b284982e0fb9819768800b2c84ab682929bba1b6056f03e5e90bfe7f92420
initial_ast: 3d44a5b9944a79972fe363d0a55a895ba4c54a7ebb5468c8b86f0cf7c2c08abc
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 3d44a5b9944a79972fe363d0a55a895ba4c54a7ebb5468c8b86f0cf7c2c08abc
type_inferenced_ast: 6a3015aa319b9b49284ec484e5df9643a583f2d24cdbcb3b9f55861dcf179fd2

7
tests/expectations/compiler/compiler/char/nonprinting.leo.out
View File

@ -19,6 +19,7 @@ outputs:
r1:
type: bool
value: "true"
initial_ast: b03b0ea8ad821952fa64e477900b43c830e9fbd9693478018ad4b13abd12b027
canonicalized_ast: b03b0ea8ad821952fa64e477900b43c830e9fbd9693478018ad4b13abd12b027
type_inferenced_ast: 4ded1909fcd3fa1edf7de8111d3f7b97fced37b5b2d18b316f9fee3aad246f5e
initial_ast: f903a8d76375a44484394a570a45c7f3a0608701ca5c9886d9fb2e4e284b3180
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: f903a8d76375a44484394a570a45c7f3a0608701ca5c9886d9fb2e4e284b3180
type_inferenced_ast: d21bd01666367760fac988e5c047451f53ace8c22566819413af89bb405aae1d

7
tests/expectations/compiler/compiler/char/out.leo.out
View File

@ -100,6 +100,7 @@ outputs:
r:
type: char
value: "'\\u{1f62d}'"
initial_ast: 2e1dc058de58dbe98a1f19e7b883fed916d58fc5087de2c2bd06bb98324411d5
canonicalized_ast: 2e1dc058de58dbe98a1f19e7b883fed916d58fc5087de2c2bd06bb98324411d5
type_inferenced_ast: 40d126753bfa96341a167671ffc7244c6430d8f40934d8197c969baa9b49c785
initial_ast: 76e143570c29b060dd5e669373abe7ec59ebf4eae533982eacfc94856fcb8eb5
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 76e143570c29b060dd5e669373abe7ec59ebf4eae533982eacfc94856fcb8eb5
type_inferenced_ast: 64a99631a5d65611d303e853567523dc01dc8a4c06916b62e6e07ef63cf95869

7
tests/expectations/compiler/compiler/circuits/big_self_in_circuit_replacement.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 776ea4bb946bb5d56430c22be58f3539dbecb25a11ec07e5e8bd3db49be7f937
canonicalized_ast: 6a95acbcb25193b7b9f9e7a2bbcaeafa83ec09163e097b12076ea512a9daaf14
type_inferenced_ast: d71ab34660bf998f236dfe59e55050f9f5fba8671bacbbdde04b4902927ec571
initial_ast: a7e859d88242d946cd7524fb17bce4fe70f5cd01f16b9620c85afb8916d7df96
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: e89b84cf6ad866872f77906158a881a7dc770c8887e6b9d919d4cf3c265bfdef
type_inferenced_ast: b5f8089d0789be83f656b956f5e57f6bf3bcd2ae86baff2848502596f1939436

7
tests/expectations/compiler/compiler/circuits/const_self_variable.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: b438fb664bd7b8683beabd5044efba7669d3fcab093994b1c386a30ad63fff14
canonicalized_ast: b438fb664bd7b8683beabd5044efba7669d3fcab093994b1c386a30ad63fff14
type_inferenced_ast: 9094424be690a804ae2e5d3ca2787104de01dc6bca89fe6d349db5709c5161ac
initial_ast: 0bc79340698c93a5eabc2a1851f36e8b00b60b5fe7cfc02f95325000aff36f31
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 0bc79340698c93a5eabc2a1851f36e8b00b60b5fe7cfc02f95325000aff36f31
type_inferenced_ast: 1451a70c95397c7e507e2df37a1db6cb10fa8c621f163ae8a374a4360a9f89af

7
tests/expectations/compiler/compiler/circuits/define_circuit_inside_circuit_function.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 7221141253b1998cbddad5f0c1385e7b53450a535112c0eb112b5af01474ce20
canonicalized_ast: 7221141253b1998cbddad5f0c1385e7b53450a535112c0eb112b5af01474ce20
type_inferenced_ast: f208046c46de9c4a42c47079504791711c9b0c8b3fb35dd413243fcbfd7dbd90
initial_ast: cc5e9d009c7dd3b282ccf4b38267f8b74029698c6c74d29291425d20377d8127
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: cc5e9d009c7dd3b282ccf4b38267f8b74029698c6c74d29291425d20377d8127
type_inferenced_ast: 1dde2150a23d9bc40905b75a2bf283493134f9387a28e8e770b9efa89dc612d4

7
tests/expectations/compiler/compiler/circuits/duplicate_name_context.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 46d600c5f3b64378fbdcff7b4097d54e3855eded01d642f5af25fa3aef44eede
canonicalized_ast: 46d600c5f3b64378fbdcff7b4097d54e3855eded01d642f5af25fa3aef44eede
type_inferenced_ast: e5cdf935d34157bdbc2eb228c94e2222887c91fc3bc1c9f24bc6e84fddde9730
initial_ast: 887429d8e06c0c8a748a660f63e5bfe9f0e1f6225417cc1ed3bf771f6978c664
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 887429d8e06c0c8a748a660f63e5bfe9f0e1f6225417cc1ed3bf771f6978c664
type_inferenced_ast: 0e5699dcb95c9b00f89a2351583ea875431cee438f5a3687f793743215ebe702

7
tests/expectations/compiler/compiler/circuits/inline.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: u32
value: "100"
initial_ast: ba821e922e3b934581e39a58e2ef08d14b6cb0355500ed79f017dc0ecd39651c
canonicalized_ast: ba821e922e3b934581e39a58e2ef08d14b6cb0355500ed79f017dc0ecd39651c
type_inferenced_ast: 03fadaa1772f83ffa18a67a2279a65bad0715a6077f7219ff8955b45707c0437
initial_ast: 37f8abc34c8f2973b504043f34e354cf91fe2a389e5ffdd4b188423a294e7e51
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 37f8abc34c8f2973b504043f34e354cf91fe2a389e5ffdd4b188423a294e7e51
type_inferenced_ast: 3412903f054af44584971d9e1656350595214e73225171d082cc70aad298edaf

7
tests/expectations/compiler/compiler/circuits/inline_member_pass.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 58d028cbd020f04ef3b1025a07dabbc8bc4f5a2adf7e2ca4bb67cc229d4f64cd
canonicalized_ast: 5e72d67df40e8ecd2ae9999419888ade6ebf1c054f1f80f91a274360e294d361
type_inferenced_ast: 177f3be4bed2ca8e1a9543b8bb71a75a751d6835dcac15910bc4bd5fa9e25897
initial_ast: b3e95c78293ceda8be21c713e80651df03a1d0438c04cd113f1a610e68c63796
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 7dfb7128fe79408041ce0fecc2db53875095f8fa0f874a9c6f971ebc45b3b3f1
type_inferenced_ast: 8799f5d5e9ae9a86dfba65c15e88cc461978d773fd075dcd4647ccf603fa253e

7
tests/expectations/compiler/compiler/circuits/member_function.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 681bcdc031155971ce0dab8c8ee659df3f09b97b4e6b4525d47f4a045765a57c
canonicalized_ast: 681bcdc031155971ce0dab8c8ee659df3f09b97b4e6b4525d47f4a045765a57c
type_inferenced_ast: 40920da878d0316ea8fd4d1963e53843b1d8933441fd568adba5f11e4ded7246
initial_ast: fa23cffb95b72b387ebc0a625dda090d95d04504418d20a2773b0fc6781bd303
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: fa23cffb95b72b387ebc0a625dda090d95d04504418d20a2773b0fc6781bd303
type_inferenced_ast: 28bbdb5579c9ab9126739e93b3d8657dad65b30d1f876edc3de09d9128191097

7
tests/expectations/compiler/compiler/circuits/member_function_nested.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 05ea77fc193abe91954fc2fcd338d3ebfaff6bb7939339e9dcc78e514802dd42
canonicalized_ast: 05ea77fc193abe91954fc2fcd338d3ebfaff6bb7939339e9dcc78e514802dd42
type_inferenced_ast: 9827f4b622a95714f55620295e8ce9d9cf6fc85603a869b178825c818d64d768
initial_ast: c17d0b7ffc6c6a9d292d0834e319fcbf42fb27cc943ab95bbf29b3b037fb8187
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: c17d0b7ffc6c6a9d292d0834e319fcbf42fb27cc943ab95bbf29b3b037fb8187
type_inferenced_ast: c3747599a2b2df3e3e9cdaa8d700705331637137f1631702408f937226d55721

7
tests/expectations/compiler/compiler/circuits/member_static_function.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: da39dd8a0b9ddb1304cfe1fd1dd555c01c43750524db4021d27e1425ec175322
canonicalized_ast: da39dd8a0b9ddb1304cfe1fd1dd555c01c43750524db4021d27e1425ec175322
type_inferenced_ast: 6cdc6a128cc2fb9220293b7c34ba4066cc63911f5ffbe00959142992f358e488
initial_ast: e5d18e88bcf7f4cc2369390ac79e866bcad834f7772a44ad9f3f87b36a923a0a
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: e5d18e88bcf7f4cc2369390ac79e866bcad834f7772a44ad9f3f87b36a923a0a
type_inferenced_ast: f4c4a44797daac02d724050d7c344a8c0d5ae4428f4f9a476e31f38ecf8e6367

7
tests/expectations/compiler/compiler/circuits/member_static_function_nested.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 380f44a5f5d7c1ef76c593da32936d480e79240bb7cd17fce0122b18c9e7f722
canonicalized_ast: 82f1edfa14a6e28b57828bf5f4be2aaaf21fb5468c0388088a56a4e44adb31fe
type_inferenced_ast: ab690a29d11e08699223ec4009174acdec23c3667d523af63556187d7396e66b
initial_ast: 4cd540b3d02c96d865ef2ef24ae065207e44361f6b6c0d6afef6aca6044b9167
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 18f4935c0b935a0f2f19bb9372dbe3cb18303cf06dff761a0d6402eb07c0020a
type_inferenced_ast: 9f159263ad1cc9bdb28741207db7bf729b4b1ae33462c799f25dbeb4ea1e2d25

7
tests/expectations/compiler/compiler/circuits/member_variable.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 0723285d6c4dac924f6c86e0a6fd57eb78947cfcecd45f2520b7b0f0029f3279
canonicalized_ast: 0723285d6c4dac924f6c86e0a6fd57eb78947cfcecd45f2520b7b0f0029f3279
type_inferenced_ast: c42738de8987ca76cacc30dbf86688ff11d5dbf7dccba67947cc78eb452460fd
initial_ast: 434732a3a575abc64d02547a671486a574ec2476fcb1156e65743f9df8b3df85
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 434732a3a575abc64d02547a671486a574ec2476fcb1156e65743f9df8b3df85
type_inferenced_ast: 9f3207a56ff9893955a6cc0ed213d75fa0cbaf3354779fe55684f19ea2cc690c

7
tests/expectations/compiler/compiler/circuits/member_variable_and_function.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: bbad7fd765dee42c9ebaca7e07201d61befefa5e7d5af700130954ac29cdd27c
canonicalized_ast: bbad7fd765dee42c9ebaca7e07201d61befefa5e7d5af700130954ac29cdd27c
type_inferenced_ast: cb8745ad419c19ad007a9d9d905f01c0d85d2e78cb82be0b82342c44015c322e
initial_ast: b258b2be80630573ec76e04b6cce4e0ea0d8f460fcfaeef2da231f11ebf9a1e2
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: b258b2be80630573ec76e04b6cce4e0ea0d8f460fcfaeef2da231f11ebf9a1e2
type_inferenced_ast: 1c33e9c84bcd214ec73548277951a7e921d3f63ac8bd2eef53ea2403e17079e2

7
tests/expectations/compiler/compiler/circuits/mut_self_variable.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: d2d5680f0e011b93b2e55aebb62f51b4e78cf68289ffd84a80f852d2a82a6723
canonicalized_ast: 57c2e52b3f73e7052fdc92d0c668b598b282321cd390ed836f20b92bc528b6e0
type_inferenced_ast: 4f8c32d94398d49ffb9b1eab3639076e77d77159411c1891d814b4946751e554
initial_ast: ff68e0fa97a6e4c87d354220c6df2065c38940356d85908ae424b2ac07ddd985
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: d1dc7a742e95cf89abe87bedf3db865816d63008309a5bf5887d333af4b34b0c
type_inferenced_ast: 9acf3aeb0b6314ce22b425762167ae1103793988d79412b0f9b7f54a0df9addf

7
tests/expectations/compiler/compiler/circuits/mut_self_variable_branch.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 15da2283babf7f4a490bd7bdc0331522107f7ce4c88949863178ba4a00419ead
canonicalized_ast: 96a167f8b897e9973bb7b9d13faa81da0b635a6611ef09124a5d12f817b35254
type_inferenced_ast: 82c54a8e54820fc234a7029cb4c6018df99e7a3d4b47f418efc8835889b1c6cc
initial_ast: ab56e024bb46d681ed4e4d9766f3aa1daa1e4ea28ee3a5dc1dbdc4974c8541fe
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 4256d1a31e567acf65d143fe4a3d581ae6348ee9751e2c76af7267059def6e3c
type_inferenced_ast: 56120e214c6534e19cffa65090fb9fba9136bd8f17dfeb106ace1dc0ed542273

7
tests/expectations/compiler/compiler/circuits/mut_self_variable_conditional.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 6fd3b11431e3e71f2b628bc9c64cb51d04c77df08d7584503b76b3dff7bc90cc
canonicalized_ast: a7a942a8a40f7cf8bfd79fdea0ed81fb6b56cfd9009b01b3d0225b427ef583cd
type_inferenced_ast: d3cc0e19adac957e11d520bf727133bfcc85eef5f306373cb5057b840b1a41f6
initial_ast: 9ef6f6f7032e7084d261418ea5ef1dabdd8fc32debfa998a1a4fe7abebd1d688
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 4d286f5ba9c5bd207cee6492e73683dbe6f8512c4be231759099ee05b328785b
type_inferenced_ast: 33bd48e0ded5b726baebc1f0976b05ebf974f8860141bcfc147753ae98cc4619

7
tests/expectations/compiler/compiler/circuits/mut_variable.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 48713617e0f06ade7b443ec779e646b0ff82e025f040c8a28bf2ea7eb37f3399
canonicalized_ast: 48713617e0f06ade7b443ec779e646b0ff82e025f040c8a28bf2ea7eb37f3399
type_inferenced_ast: 68e4f8baf01d452f42d0765f2819783adb55000238d5d57304a314fb5cff3c22
initial_ast: d0e39f622dc6c07b9b7c455028c8456747805059217c0153b3c67e73e1103dee
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: d0e39f622dc6c07b9b7c455028c8456747805059217c0153b3c67e73e1103dee
type_inferenced_ast: 03e7715008a91a649cc99d2f82cd11230c87410d99ff73c55b28dd735310dd97

7
tests/expectations/compiler/compiler/circuits/mutable_call_immutable_context.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 2f6262df5e4a39a662b85cff0985d297fa2628d56fc3c036b5beb31d683a8574
canonicalized_ast: 4bb2ac425c192058af2f97684019d74959bc40abc0f886a741894a89cc8e8d4f
type_inferenced_ast: 6c3c3d16ba595ab33902ece671d2460c3a25347e1e33e35ec82ff8622926afd2
initial_ast: badfa9d975c37f7172b31c15e3c76e61797b1d84fde268bbcd89a12a68f423b3
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: 29fffa777e57290c8615165ace58d39e08d0a073f4290951ee4fffc51acc941d
type_inferenced_ast: 24d19c8ccd812112002e0f4b82149f6215041ae86734750b4ba4c2dd787c9d19

7
tests/expectations/compiler/compiler/circuits/pedersen_mock.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: 591aa0cc25f8c009c7df6425697003904e97e74c55f887c5ed3b27984fda4176
canonicalized_ast: 7232353691a314166deb747de9046b05e507b581d35132479b01c6db41e72df6
type_inferenced_ast: ae5cb090082e845a9a058a15de6345a672864bf2ad2061930922475cc2c3f8e1
initial_ast: d6b60edc93e42ea3f227d8913d6bc078c91b0f2350839de6334638a6d92ec367
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: db69b1760fc941ef61afc6446a775c82bb03205ab1e37b53c2309dfa3999b05e
type_inferenced_ast: 41f8afc6cfcc45acf5263d4e5e00a5238649035306475bee56d2b0b8fd83dd1a

7
tests/expectations/compiler/compiler/circuits/return_self_type_array.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: f7e0f5bba37e3a25b8fdf655d2588054659ff212cade431c17bb548757a7781d
canonicalized_ast: 8425ce431117fc5d543a83ddde9e0cf946e0435146ede09096906a0f1fe9eff2
type_inferenced_ast: da1985f44598222e3940c14fefed9ce269e43d474aaf15b622292cd63f3efe87
initial_ast: d0a2ceebda399c0d467c8cd828110a0f0859d7ead350a9e90d23ddee9cb15c49
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: a4858ebba1a827ebdfcb04f201e5df2898e3ff55603e951ad51f32dd1409a5da
type_inferenced_ast: 04d79a59c312145ef91ac3685160ee63dde32b031f01cb7b4c8fb3438e9a1e7d

7
tests/expectations/compiler/compiler/circuits/return_self_type_tuple.leo.out
View File

@ -16,6 +16,7 @@ outputs:
r0:
type: bool
value: "true"
initial_ast: ab5c9ec7a0930713141b84e303355a1ddf69340f5222699c2192868e0e0dc8c4
canonicalized_ast: 3442d75d2ced2e10abfde09306d9bf91046cecd295a5e48e66a1823abff28ffc
type_inferenced_ast: ace67f309b2535d71ec2b277b42569fa3f89e6bcb817e8b911f7a773c9c4186e
initial_ast: b25143b9354fbc3ce53f85fd758180d9c3f2bc0988cc4263f61c7c2097676f66
imports_resolved_ast: 68d56e1fe5be8f6859aaeb97692139083eddd0f7f91041f8d583cf05ebf4c922
canonicalized_ast: be0c54e181d4600539061e91a4a590b29d1445b91b1a08a0190c3488e441568e
type_inferenced_ast: 06de84759b591a6e2cdb733c79a39d32db53253d86981ff87a6a5c1f28f415ce

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