-
Notifications
You must be signed in to change notification settings - Fork 219
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'master' into phated/nargo-crate-type
* master: chore: replace usage of `Directive::Quotient` with brillig opcode (#1766) chore: clippy fix (#2136) feat: Initial work on rewriting closures to regular functions with hi… (#1959) chore: Decouple acir blockid from ssa valueid (#2103) chore: Initialize copy array from previous values in `array_set` (#2106) chore: rename `ssa_refactor` module to `ssa` (#2129) chore: Use `--show-output` flag on execution rather than compilation (#2116) fix(globals): Accurately filter literals for resolving globals (#2126) feat: Optimize away constant calls to black box functions (#1981)
- Loading branch information
Showing
77 changed files
with
1,668 additions
and
462 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,6 @@ | ||
[package] | ||
name = "closures_mut_ref" | ||
authors = [""] | ||
compiler_version = "0.8.0" | ||
|
||
[dependencies] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1 @@ | ||
x = "0" |
20 changes: 20 additions & 0 deletions
20
crates/nargo_cli/tests/test_data/closures_mut_ref/src/main.nr
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,20 @@ | ||
use dep::std; | ||
|
||
fn main(mut x: Field) { | ||
let one = 1; | ||
let add1 = |z| { | ||
*z = *z + one; | ||
}; | ||
|
||
let two = 2; | ||
let add2 = |z| { | ||
*z = *z + two; | ||
}; | ||
|
||
add1(&mut x); | ||
assert(x == 1); | ||
|
||
add2(&mut x); | ||
assert(x == 3); | ||
|
||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
6 changes: 6 additions & 0 deletions
6
crates/nargo_cli/tests/test_data/higher_order_fn_selector/Nargo.toml
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,6 @@ | ||
[package] | ||
name = "higher_order_fn_selector" | ||
authors = [""] | ||
compiler_version = "0.8.0" | ||
|
||
[dependencies] |
39 changes: 39 additions & 0 deletions
39
crates/nargo_cli/tests/test_data/higher_order_fn_selector/src/main.nr
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,39 @@ | ||
use dep::std; | ||
|
||
fn g(x: &mut Field) -> () { | ||
*x *= 2; | ||
} | ||
|
||
fn h(x: &mut Field) -> () { | ||
*x *= 3; | ||
} | ||
|
||
fn selector(flag: &mut bool) -> fn(&mut Field) -> () { | ||
let my_func = if *flag { | ||
g | ||
} else { | ||
h | ||
}; | ||
|
||
// Flip the flag for the next function call | ||
*flag = !(*flag); | ||
my_func | ||
} | ||
|
||
fn main() { | ||
|
||
let mut flag: bool = true; | ||
|
||
let mut x: Field = 100; | ||
let returned_func = selector(&mut flag); | ||
returned_func(&mut x); | ||
|
||
assert(x == 200); | ||
|
||
let mut y: Field = 100; | ||
let returned_func2 = selector(&mut flag); | ||
returned_func2(&mut y); | ||
|
||
assert(y == 300); | ||
|
||
} |
6 changes: 6 additions & 0 deletions
6
crates/nargo_cli/tests/test_data/higher_order_functions/Nargo.toml
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,6 @@ | ||
[package] | ||
name = "higher_order_functions" | ||
authors = [""] | ||
compiler_version = "0.1" | ||
|
||
[dependencies] |
Empty file.
87 changes: 87 additions & 0 deletions
87
crates/nargo_cli/tests/test_data/higher_order_functions/src/main.nr
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,87 @@ | ||
use dep::std; | ||
|
||
fn main() -> pub Field { | ||
let f = if 3 * 7 > 200 as u32 { foo } else { bar }; | ||
assert(f()[1] == 2); | ||
// Lambdas: | ||
assert(twice(|x| x * 2, 5) == 20); | ||
assert((|x, y| x + y + 1)(2, 3) == 6); | ||
|
||
// nested lambdas | ||
assert((|a, b| { | ||
a + (|c| c + 2)(b) | ||
})(0, 1) == 3); | ||
|
||
|
||
// Closures: | ||
let a = 42; | ||
let g = || a; | ||
assert(g() == 42); | ||
|
||
// When you copy mutable variables, | ||
// the capture of the copies shouldn't change: | ||
let mut x = 2; | ||
x = x + 1; | ||
let z = x; | ||
|
||
// Add extra mutations to ensure we can mutate x without the | ||
// captured z changing. | ||
x = x + 1; | ||
assert((|y| y + z)(1) == 4); | ||
|
||
// When you capture mutable variables, | ||
// again, the captured variable doesn't change: | ||
let closure_capturing_mutable = (|y| y + x); | ||
assert(closure_capturing_mutable(1) == 5); | ||
x += 1; | ||
assert(closure_capturing_mutable(1) == 5); | ||
|
||
let ret = twice(add1, 3); | ||
|
||
test_array_functions(); | ||
ret | ||
} | ||
|
||
/// Test the array functions in std::array | ||
fn test_array_functions() { | ||
let myarray: [i32; 3] = [1, 2, 3]; | ||
assert(myarray.any(|n| n > 2)); | ||
|
||
let evens: [i32; 3] = [2, 4, 6]; | ||
assert(evens.all(|n| n > 1)); | ||
|
||
assert(evens.fold(0, |a, b| a + b) == 12); | ||
assert(evens.reduce(|a, b| a + b) == 12); | ||
|
||
// TODO: is this a sort_via issue with the new backend, | ||
// or something more general? | ||
// | ||
// currently it fails only with `--experimental-ssa` with | ||
// "not yet implemented: Cast into signed" | ||
// but it worked with the original ssa backend | ||
// (before dropping it) | ||
// | ||
// opened #2121 for it | ||
// https://github.com/noir-lang/noir/issues/2121 | ||
|
||
// let descending = myarray.sort_via(|a, b| a > b); | ||
// assert(descending == [3, 2, 1]); | ||
|
||
assert(evens.map(|n| n / 2) == myarray); | ||
} | ||
|
||
fn foo() -> [u32; 2] { | ||
[1, 3] | ||
} | ||
|
||
fn bar() -> [u32; 2] { | ||
[3, 2] | ||
} | ||
|
||
fn add1(x: Field) -> Field { | ||
x + 1 | ||
} | ||
|
||
fn twice(f: fn(Field) -> Field, x: Field) -> Field { | ||
f(f(x)) | ||
} |
1 change: 1 addition & 0 deletions
1
crates/nargo_cli/tests/test_data/higher_order_functions/target/c.json
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1 @@ | ||
{"backend":"acvm-backend-barretenberg","abi":{"parameters":[],"param_witnesses":{},"return_type":null,"return_witnesses":[]},"bytecode":[155,194,56,97,194,4,0],"proving_key":null,"verification_key":null} |
1 change: 1 addition & 0 deletions
1
crates/nargo_cli/tests/test_data/higher_order_functions/target/main.json
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1 @@ | ||
{"backend":"acvm-backend-barretenberg","abi":{"parameters":[{"name":"x","type":{"kind":"integer","sign":"unsigned","width":32},"visibility":"private"},{"name":"y","type":{"kind":"integer","sign":"unsigned","width":32},"visibility":"private"},{"name":"z","type":{"kind":"integer","sign":"unsigned","width":32},"visibility":"private"}],"param_witnesses":{"x":[1],"y":[2],"z":[3]},"return_type":null,"return_witnesses":[]},"bytecode":"H4sIAAAAAAAA/9WUTW6DMBSEJ/yFhoY26bYLjoAxBLPrVYpK7n+EgmoHamWXeShYQsYSvJ+Z9/kDwCf+1m58ArsXi3PgnUN7dt/u7P9fdi8fW8rlATduCW89GFe5l2iMES90YBd+EyTyjIjtGYIm+HF1eanroa0GpdV3WXW9acq66S9GGdWY5qcyWg+mNm3Xd23ZqVoP6tp0+moDJ5AxNOTUWdk6VUTsOSb6wtRPCuDYziaZAzGA92OMFCsAPCUqMAOcQg5gZwIb4BdsA+A9seeU6AtTPymAUzubZA7EAD6MMTKsAPCUqMAMcAY5gJ0JbIBfsQ2AD8SeM6IvTP2kAM7sbJI5EAP4OMbIsQLAU6ICM8A55AB2JrABfsM2AD4Se86Jvjy5freeQ2LPObGud6J+Ce5ADz6LzJqX9Z4W75HdgzszkQj0BC+Pr6PohSpl0kkg7hm84Zfq+8z36N/l9OyaLtcv2EfpKJUUAAA=","proving_key":null,"verification_key":null} |
Binary file added
BIN
+112 Bytes
crates/nargo_cli/tests/test_data/higher_order_functions/target/witness.tr
Binary file not shown.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,6 @@ | ||
[package] | ||
name = "inner_outer_cl" | ||
authors = [""] | ||
compiler_version = "0.7.1" | ||
|
||
[dependencies] |
12 changes: 12 additions & 0 deletions
12
crates/nargo_cli/tests/test_data/inner_outer_cl/src/main.nr
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,12 @@ | ||
fn main() { | ||
let z1 = 0; | ||
let z2 = 1; | ||
let cl_outer = |x| { | ||
let cl_inner = |y| { | ||
x + y + z2 | ||
}; | ||
cl_inner(1) + z1 | ||
}; | ||
let result = cl_outer(1); | ||
assert(result == 3); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,6 @@ | ||
[package] | ||
name = "ret_fn_ret_cl" | ||
authors = [""] | ||
compiler_version = "0.7.1" | ||
|
||
[dependencies] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1 @@ | ||
x = "10" |
39 changes: 39 additions & 0 deletions
39
crates/nargo_cli/tests/test_data/ret_fn_ret_cl/src/main.nr
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,39 @@ | ||
use dep::std; | ||
|
||
fn f(x: Field) -> Field { | ||
x + 1 | ||
} | ||
|
||
fn ret_fn() -> fn(Field) -> Field { | ||
f | ||
} | ||
|
||
// TODO: in the advanced implicitly generic function with closures branch | ||
// which would support higher-order functions in a better way | ||
// support returning closures: | ||
// | ||
// fn ret_closure() -> fn(Field) -> Field { | ||
// let y = 1; | ||
// let inner_closure = |z| -> Field{ | ||
// z + y | ||
// }; | ||
// inner_closure | ||
// } | ||
|
||
fn ret_lambda() -> fn(Field) -> Field { | ||
let cl = |z: Field| -> Field { | ||
z + 1 | ||
}; | ||
cl | ||
} | ||
|
||
fn main(x : Field) { | ||
let result_fn = ret_fn(); | ||
assert(result_fn(x) == x + 1); | ||
|
||
// let result_closure = ret_closure(); | ||
// assert(result_closure(x) == x + 1); | ||
|
||
let result_lambda = ret_lambda(); | ||
assert(result_lambda(x) == x + 1); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.