-
Notifications
You must be signed in to change notification settings - Fork 97
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Simple command line utility that can run tests in a `.asm` file.
- Loading branch information
Showing
13 changed files
with
199 additions
and
103 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,109 @@ | ||
| use std::{collections::BTreeSet, path::PathBuf, str::FromStr}; | ||
|
|
||
| use itertools::Itertools; | ||
|
|
||
| use powdr_ast::{ | ||
| analyzed::{Analyzed, FunctionValueDefinition}, | ||
| parsed::{ | ||
| asm::SymbolPath, | ||
| types::{FunctionType, Type}, | ||
| }, | ||
| }; | ||
| use powdr_number::FieldElement; | ||
| use powdr_pil_analyzer::evaluator::{self, SymbolLookup}; | ||
|
|
||
| use crate::Pipeline; | ||
|
|
||
| /// Executes all functions in the given file that start with `test_` and are | ||
| /// inside a module called `test` (or a sub-module thereof). | ||
| /// | ||
| /// @param include_std_tests: Whether to run the tests inside the standard library. | ||
| pub fn run_from_file<F: FieldElement>( | ||
| input: &str, | ||
| include_std_tests: bool, | ||
| ) -> Result<usize, Vec<String>> { | ||
| let mut pipeline = Pipeline::<F>::default().from_file(PathBuf::from(&input)); | ||
|
|
||
| let analyzed = pipeline.compute_analyzed_pil()?; | ||
| run_tests::<F>(analyzed, include_std_tests) | ||
| } | ||
|
|
||
| #[allow(clippy::print_stdout)] | ||
| /// Executes all functions in the given file that start with `test_` and are | ||
| /// inside a module called `test` (or a sub-module thereof). | ||
| /// | ||
| /// @param include_std_tests: Whether to run the tests inside the standard library. | ||
| /// | ||
| /// Returns the number of tests executed. | ||
| pub fn run_tests<F: FieldElement>( | ||
| analyzed: &Analyzed<F>, | ||
| include_std_tests: bool, | ||
| ) -> Result<usize, Vec<String>> { | ||
| let mut symbols = evaluator::Definitions { | ||
| definitions: &analyzed.definitions, | ||
| solved_impls: &analyzed.solved_impls, | ||
| }; | ||
|
|
||
| let mut errors = vec![]; | ||
| let tests: BTreeSet<&String> = analyzed | ||
| .definitions | ||
| .iter() | ||
| .filter(|(n, _)| { | ||
| (n.starts_with("test::") || n.contains("::test::")) && n.contains("::test_") | ||
| }) | ||
| .filter(|(n, _)| include_std_tests || !n.starts_with("std::")) | ||
| .filter(|(n, _)| SymbolPath::from_str(n).unwrap().name().starts_with("test_")) | ||
| .sorted_by_key(|(n, _)| *n) | ||
| .filter_map(|(n, (_, val))| { | ||
| let Some(FunctionValueDefinition::Expression(f)) = val else { | ||
| return None; | ||
| }; | ||
| // Require a plain `->()` type. | ||
| (f.type_scheme.as_ref().unwrap().ty | ||
| == (FunctionType { | ||
| params: vec![], | ||
| value: Box::new(Type::empty_tuple()), | ||
| }) | ||
| .into()) | ||
| .then_some(n) | ||
| }) | ||
| .collect(); | ||
| let field_name = F::known_field().map_or_else( | ||
| || format!("with modulus {}", F::modulus()), | ||
| |f| f.to_string(), | ||
| ); | ||
| println!("Running {} tests using field {field_name}...", tests.len()); | ||
| println!("{}", "-".repeat(85)); | ||
| for name in &tests { | ||
| let name_len = name.len(); | ||
| let padding = if name_len >= 75 { | ||
| " ".to_string() | ||
| } else { | ||
| " ".repeat(76 - name_len) | ||
| }; | ||
| print!("{name}..."); | ||
| let function = symbols.lookup(name, &None).unwrap(); | ||
| match evaluator::evaluate_function_call::<F>(function, vec![], &mut symbols) { | ||
| Err(e) => { | ||
| let msg = e.to_string(); | ||
| println!("{padding}failed\n {msg}"); | ||
| errors.push((name, msg)); | ||
| } | ||
| Ok(_) => println!("{padding}ok"), | ||
| } | ||
| } | ||
|
|
||
| println!("{}", "-".repeat(85)); | ||
| if errors.is_empty() { | ||
| println!("All {} tests passed!", tests.len()); | ||
| Ok(tests.len()) | ||
| } else { | ||
| println!( | ||
| "Failed tests: {} / {}\n{}", | ||
| errors.len(), | ||
| tests.len(), | ||
| errors.iter().map(|(n, e)| format!(" {n}: {e}")).join("\n") | ||
| ); | ||
| Err(vec![format!("{} test(s) failed.", errors.len())]) | ||
| } | ||
| } |
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
Oops, something went wrong.