mirror of
https://github.com/AleoHQ/leo.git
synced 2024-12-20 16:11:35 +03:00
95 lines
3.4 KiB
Rust
95 lines
3.4 KiB
Rust
// Copyright (C) 2019-2020 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 leo_ast::LeoAst;
|
|
use leo_grammar::Grammar;
|
|
|
|
use criterion::{criterion_group, criterion_main, Criterion};
|
|
use std::{path::Path, time::Duration};
|
|
|
|
fn leo_ast<'ast>(ast: &Grammar<'ast>) -> LeoAst {
|
|
LeoAst::new("leo_core_tree", &ast)
|
|
}
|
|
|
|
fn bench_big_if_else(c: &mut Criterion) {
|
|
let filepath = Path::new("./big_if_else.leo").to_path_buf();
|
|
let program_string = include_str!("./big_if_else.leo");
|
|
let ast = Grammar::new(&filepath, program_string).unwrap();
|
|
|
|
c.bench_function("LeoAst::big_if_else", |b| b.iter(|| leo_ast(&ast)));
|
|
}
|
|
|
|
fn bench_big_ternary(c: &mut Criterion) {
|
|
let filepath = Path::new("./big_ternary.leo").to_path_buf();
|
|
let program_string = include_str!("./big_ternary.leo");
|
|
let ast = Grammar::new(&filepath, program_string).unwrap();
|
|
|
|
c.bench_function("LeoAst::big_ternary", |b| b.iter(|| leo_ast(&ast)));
|
|
}
|
|
|
|
fn bench_big_circuit(c: &mut Criterion) {
|
|
let filepath = Path::new("./big_circuit.leo").to_path_buf();
|
|
let program_string = include_str!("./big_circuit.leo");
|
|
let ast = Grammar::new(&filepath, program_string).unwrap();
|
|
|
|
c.bench_function("LeoAst::big_circuit", |b| b.iter(|| leo_ast(&ast)));
|
|
}
|
|
|
|
fn bench_long_expr(c: &mut Criterion) {
|
|
let filepath = Path::new("./long_expr.leo").to_path_buf();
|
|
let program_string = include_str!("./long_expr.leo");
|
|
let ast = Grammar::new(&filepath, program_string).unwrap();
|
|
|
|
c.bench_function("LeoAst::long_expr", |b| b.iter(|| leo_ast(&ast)));
|
|
}
|
|
|
|
fn bench_long_array(c: &mut Criterion) {
|
|
let filepath = Path::new("./long_array.leo").to_path_buf();
|
|
let program_string = include_str!("./long_array.leo");
|
|
let ast = Grammar::new(&filepath, program_string).unwrap();
|
|
|
|
c.bench_function("LeoAst::long_array", |b| b.iter(|| leo_ast(&ast)));
|
|
}
|
|
|
|
fn bench_many_foos(c: &mut Criterion) {
|
|
let filepath = Path::new("./many_foos.leo").to_path_buf();
|
|
let program_string = include_str!("./many_foos.leo");
|
|
let ast = Grammar::new(&filepath, program_string).unwrap();
|
|
|
|
c.bench_function("LeoAst::many_foos", |b| b.iter(|| leo_ast(&ast)));
|
|
}
|
|
|
|
fn bench_many_assigns(c: &mut Criterion) {
|
|
let filepath = Path::new("./many_assigns.leo").to_path_buf();
|
|
let program_string = include_str!("./many_assigns.leo");
|
|
let ast = Grammar::new(&filepath, program_string).unwrap();
|
|
|
|
c.bench_function("LeoAst::many_assigns", |b| b.iter(|| leo_ast(&ast)));
|
|
}
|
|
|
|
criterion_group!(
|
|
name = benches;
|
|
config = Criterion::default().sample_size(200).measurement_time(Duration::from_secs(10)).nresamples(200_000);
|
|
targets = bench_big_circuit,
|
|
bench_long_expr,
|
|
bench_big_if_else,
|
|
bench_big_ternary,
|
|
bench_long_array,
|
|
bench_many_assigns,
|
|
bench_many_foos,
|
|
);
|
|
criterion_main!(benches);
|