mirror of
https://github.com/logos-storage/plonky2.git
synced 2026-01-16 20:53:10 +00:00
05a1fbfbae
Uses a variant of Dijkstra's, with a few pruning mechanics, to find a path of instructions between the two stack states. We don't explicitly store the graph though. The Dijkstra implementation is somewhat inspired by the `pathfinding` crate. That crate doesn't quite fit our needs though. If we need to make it faster later, there are a lot of allocations and clones that we could probably eliminate.
26 lines
564 B
Rust
26 lines
564 B
Rust
pub mod aggregator;
|
|
pub mod assembler;
|
|
mod ast;
|
|
pub(crate) mod keccak_util;
|
|
mod opcodes;
|
|
mod parser;
|
|
mod stack_manipulation;
|
|
|
|
#[cfg(test)]
|
|
mod interpreter;
|
|
#[cfg(test)]
|
|
mod tests;
|
|
|
|
use assembler::assemble;
|
|
use parser::parse;
|
|
|
|
use crate::cpu::kernel::aggregator::evm_constants;
|
|
|
|
/// Assemble files, outputting bytes.
|
|
/// This is for debugging the kernel only.
|
|
pub fn assemble_to_bytes(files: &[String]) -> Vec<u8> {
|
|
let parsed_files: Vec<_> = files.iter().map(|f| parse(f)).collect();
|
|
let kernel = assemble(parsed_files, evm_constants());
|
|
kernel.code
|
|
}
|