//! Manages compiling of a `Project` //! //! The compilation of a project is performed in several steps. //! //! First the project's dependency graph [`crate::Graph`] is constructed and all imported //! dependencies are resolved. The graph holds all the relationships between the files and their //! versions. From there the appropriate version set is derived //! [`crate::Graph`] which need to be compiled with different //! [`crate::Solc`] versions. //! //! At this point we check if we need to compile a source file or whether we can reuse an _existing_ //! `Artifact`. We don't to compile if: //! - caching is enabled //! - the file is **not** dirty //! - the artifact for that file exists //! //! This concludes the preprocessing, and we now have either //! - only `Source` files that need to be compiled //! - only cached `Artifacts`, compilation can be skipped. This is considered an unchanged, //! cached project //! - Mix of both `Source` and `Artifacts`, only the `Source` files need to be compiled, the //! `Artifacts` can be reused. //! //! The final step is invoking `Solc` via the standard JSON format. //! //! ### Notes on [Import Path Resolution](https://docs.soliditylang.org/en/develop/path-resolution.html#path-resolution) //! //! In order to be able to support reproducible builds on all platforms, the Solidity compiler has //! to abstract away the details of the filesystem where source files are stored. Paths used in //! imports must work the same way everywhere while the command-line interface must be able to work //! with platform-specific paths to provide good user experience. This section aims to explain in //! detail how Solidity reconciles these requirements. //! //! The compiler maintains an internal database (virtual filesystem or VFS for short) where each //! source unit is assigned a unique source unit name which is an opaque and unstructured //! identifier. When you use the import statement, you specify an import path that references a //! source unit name. If the compiler does not find any source unit name matching the import path in //! the VFS, it invokes the callback, which is responsible for obtaining the source code to be //! placed under that name. //! //! This becomes relevant when dealing with resolved imports //! //! #### Relative Imports //! //! ```solidity //! import "./math/math.sol"; //! import "contracts/tokens/token.sol"; //! ``` //! In the above `./math/math.sol` and `contracts/tokens/token.sol` are import paths while the //! source unit names they translate to are `contracts/math/math.sol` and //! `contracts/tokens/token.sol` respectively. //! //! #### Direct Imports //! //! An import that does not start with `./` or `../` is a direct import. //! //! ```solidity //! import "/project/lib/util.sol"; // source unit name: /project/lib/util.sol //! import "lib/util.sol"; // source unit name: lib/util.sol //! import "@openzeppelin/address.sol"; // source unit name: @openzeppelin/address.sol //! import "https://example.com/token.sol"; // source unit name: //! ``` //! //! After applying any import remappings the import path simply becomes the source unit name. //! //! ##### Import Remapping //! //! ```solidity //! import "github.com/ethereum/dapp-bin/library/math.sol"; // source unit name: dapp-bin/library/math.sol //! ``` //! //! If compiled with `solc github.com/ethereum/dapp-bin/=dapp-bin/` the compiler will look for the //! file in the VFS under `dapp-bin/library/math.sol`. If the file is not available there, the //! source unit name will be passed to the Host Filesystem Loader, which will then look in //! `/project/dapp-bin/library/iterable_mapping.sol` //! //! //! ### Caching and Change detection //! //! If caching is enabled in the [Project](crate::Project) a cache file will be created upon a //! successful solc build. The [cache file](crate::cache::SolFilesCache) stores metadata for all the //! files that were provided to solc. //! For every file the cache file contains a dedicated [cache //! entry](crate::cache::CacheEntry), which represents the state of the file. A solidity file can //! contain several contracts, for every contract a separate [artifact](crate::Artifact) is emitted. //! Therefor the entry also tracks all artifacts emitted by a file. A solidity file can also be //! compiled with several solc versions. //! //! For example in `A(<=0.8.10) imports C(>0.4.0)` and //! `B(0.8.11) imports C(>0.4.0)`, both `A` and `B` import `C` but there's no solc version that's //! compatible with `A` and `B`, in which case two sets are compiled: [`A`, `C`] and [`B`, `C`]. //! This is reflected in the cache entry which tracks the file's artifacts by version. //! //! The cache makes it possible to detect changes during recompilation, so that only the changed, //! dirty, files need to be passed to solc. A file will be considered as dirty if: //! - the file is new, not included in the existing cache //! - the file was modified since the last compiler run, detected by comparing content hashes //! - any of the imported files is dirty //! - the file's artifacts don't exist, were deleted. //! //! Recompiling a project with cache enabled detects all files that meet these criteria and provides //! solc with only these dirty files instead of the entire source set. use crate::{ artifact_output::Artifacts, artifacts::{Settings, VersionedFilteredSources, VersionedSources}, cache::ArtifactsCache, error::Result, output::AggregatedCompilerOutput, report, resolver::GraphEdges, ArtifactOutput, CompilerInput, Graph, Project, ProjectCompileOutput, ProjectPathsConfig, Solc, Sources, }; use rayon::prelude::*; use crate::filter::SparseOutputFileFilter; use std::{collections::btree_map::BTreeMap, path::PathBuf}; #[derive(Debug)] pub struct ProjectCompiler<'a, T: ArtifactOutput> { /// Contains the relationship of the source files and their imports edges: GraphEdges, project: &'a Project, /// how to compile all the sources sources: CompilerSources, /// How to select solc [`crate::artifacts::CompilerOutput`] for files sparse_output: SparseOutputFileFilter, } impl<'a, T: ArtifactOutput> ProjectCompiler<'a, T> { /// Create a new `ProjectCompiler` to bootstrap the compilation process of the project's /// sources. /// /// # Example /// /// ```no_run /// use ethers_solc::Project; /// /// let project = Project::builder().build().unwrap(); /// let output = project.compile().unwrap(); /// ``` #[cfg(all(feature = "svm-solc", feature = "async"))] pub fn new(project: &'a Project) -> Result { Self::with_sources(project, project.paths.read_input_files()?) } /// Bootstraps the compilation process by resolving the dependency graph of all sources and the /// appropriate `Solc` -> `Sources` set as well as the compile mode to use (parallel, /// sequential) /// /// Multiple (`Solc` -> `Sources`) pairs can be compiled in parallel if the `Project` allows /// multiple `jobs`, see [`crate::Project::set_solc_jobs()`]. #[cfg(all(feature = "svm-solc", feature = "async"))] pub fn with_sources(project: &'a Project, sources: Sources) -> Result { let graph = Graph::resolve_sources(&project.paths, sources)?; let (versions, edges) = graph.into_sources_by_version(project.offline)?; let sources_by_version = versions.get(&project.allowed_lib_paths)?; let sources = if project.solc_jobs > 1 && sources_by_version.len() > 1 { // if there are multiple different versions, and we can use multiple jobs we can compile // them in parallel CompilerSources::Parallel(sources_by_version, project.solc_jobs) } else { CompilerSources::Sequential(sources_by_version) }; Ok(Self { edges, project, sources, sparse_output: Default::default() }) } /// Compiles the sources with a pinned `Solc` instance pub fn with_sources_and_solc( project: &'a Project, sources: Sources, solc: Solc, ) -> Result { let version = solc.version()?; let (sources, edges) = Graph::resolve_sources(&project.paths, sources)?.into_sources(); let sources_by_version = BTreeMap::from([(solc, (version, sources))]); let sources = CompilerSources::Sequential(sources_by_version); Ok(Self { edges, project, sources, sparse_output: Default::default() }) } /// Applies the specified filter to be applied when selecting solc output for /// specific files to be compiled pub fn with_sparse_output(mut self, sparse_output: impl Into) -> Self { self.sparse_output = sparse_output.into(); self } /// Compiles all the sources of the `Project` in the appropriate mode /// /// If caching is enabled, the sources are filtered and only _dirty_ sources are recompiled. /// /// The output of the compile process can be a mix of reused artifacts and freshly compiled /// `Contract`s /// /// # Example /// /// ```no_run /// use ethers_solc::Project; /// /// let project = Project::builder().build().unwrap(); /// let output = project.compile().unwrap(); /// ``` pub fn compile(self) -> Result> { // drive the compiler statemachine to completion self.preprocess()?.compile()?.write_artifacts()?.write_cache() } /// Does basic preprocessing /// - sets proper source unit names /// - check cache fn preprocess(self) -> Result> { let Self { edges, project, sources, sparse_output } = self; let mut cache = ArtifactsCache::new(project, edges)?; // retain and compile only dirty sources and all their imports let sources = sources.filtered(&mut cache); Ok(PreprocessedState { sources, cache, sparse_output }) } } /// A series of states that comprise the [`ProjectCompiler::compile()`] state machine /// /// The main reason is to debug all states individually #[derive(Debug)] struct PreprocessedState<'a, T: ArtifactOutput> { /// contains all sources to compile sources: FilteredCompilerSources, /// cache that holds [CacheEntry] object if caching is enabled and the project is recompiled cache: ArtifactsCache<'a, T>, sparse_output: SparseOutputFileFilter, } impl<'a, T: ArtifactOutput> PreprocessedState<'a, T> { /// advance to the next state by compiling all sources fn compile(self) -> Result> { let PreprocessedState { sources, cache, sparse_output } = self; let output = sources.compile( &cache.project().solc_config.settings, &cache.project().paths, sparse_output, )?; Ok(CompiledState { output, cache }) } } /// Represents the state after `solc` was successfully invoked #[derive(Debug)] struct CompiledState<'a, T: ArtifactOutput> { output: AggregatedCompilerOutput, cache: ArtifactsCache<'a, T>, } impl<'a, T: ArtifactOutput> CompiledState<'a, T> { /// advance to the next state by handling all artifacts /// /// Writes all output contracts to disk if enabled in the `Project` and if the build was /// successful fn write_artifacts(self) -> Result> { let CompiledState { output, cache } = self; // write all artifacts via the handler but only if the build succeeded let compiled_artifacts = if cache.project().no_artifacts { cache.project().artifacts_handler().output_to_artifacts(&output.contracts) } else if output.has_error() { tracing::trace!("skip writing cache file due to solc errors: {:?}", output.errors); cache.project().artifacts_handler().output_to_artifacts(&output.contracts) } else { cache .project() .artifacts_handler() .on_output(&output.contracts, &cache.project().paths)? }; Ok(ArtifactsState { output, cache, compiled_artifacts }) } } /// Represents the state after all artifacts were written to disk #[derive(Debug)] struct ArtifactsState<'a, T: ArtifactOutput> { output: AggregatedCompilerOutput, cache: ArtifactsCache<'a, T>, compiled_artifacts: Artifacts, } impl<'a, T: ArtifactOutput> ArtifactsState<'a, T> { /// Writes the cache file /// /// this concludes the [`Project::compile()`] statemachine fn write_cache(self) -> Result> { let ArtifactsState { output, cache, compiled_artifacts } = self; let ignored_error_codes = cache.project().ignored_error_codes.clone(); let cached_artifacts = cache.write_cache(&compiled_artifacts)?; Ok(ProjectCompileOutput { compiler_output: output, compiled_artifacts, cached_artifacts, ignored_error_codes, }) } } /// Determines how the `solc <-> sources` pairs are executed #[derive(Debug, Clone)] #[allow(dead_code)] enum CompilerSources { /// Compile all these sequentially Sequential(VersionedSources), /// Compile all these in parallel using a certain amount of jobs Parallel(VersionedSources, usize), } impl CompilerSources { /// Filters out all sources that don't need to be compiled, see [`ArtifactsCache::filter`] fn filtered(self, cache: &mut ArtifactsCache) -> FilteredCompilerSources { fn filtered_sources( sources: VersionedSources, cache: &mut ArtifactsCache, ) -> VersionedFilteredSources { sources .into_iter() .map(|(solc, (version, sources))| { tracing::trace!("Filtering {} sources for {}", sources.len(), version); let sources = cache.filter(sources, &version); tracing::trace!( "Detected {} dirty sources {:?}", sources.dirty().count(), sources.dirty_files().collect::>() ); (solc, (version, sources)) }) .collect() } match self { CompilerSources::Sequential(s) => { FilteredCompilerSources::Sequential(filtered_sources(s, cache)) } CompilerSources::Parallel(s, j) => { FilteredCompilerSources::Parallel(filtered_sources(s, cache), j) } } } } /// Determines how the `solc <-> sources` pairs are executed #[derive(Debug, Clone)] #[allow(dead_code)] enum FilteredCompilerSources { /// Compile all these sequentially Sequential(VersionedFilteredSources), /// Compile all these in parallel using a certain amount of jobs Parallel(VersionedFilteredSources, usize), } impl FilteredCompilerSources { /// Compiles all the files with `Solc` fn compile( self, settings: &Settings, paths: &ProjectPathsConfig, sparse_output: SparseOutputFileFilter, ) -> Result { match self { FilteredCompilerSources::Sequential(input) => { compile_sequential(input, settings, paths, sparse_output) } FilteredCompilerSources::Parallel(input, j) => { compile_parallel(input, j, settings, paths, sparse_output) } } } #[cfg(test)] #[allow(unused)] fn sources(&self) -> &VersionedFilteredSources { match self { FilteredCompilerSources::Sequential(v) => v, FilteredCompilerSources::Parallel(v, _) => v, } } } /// Compiles the input set sequentially and returns an aggregated set of the solc `CompilerOutput`s fn compile_sequential( input: VersionedFilteredSources, settings: &Settings, paths: &ProjectPathsConfig, sparse_output: SparseOutputFileFilter, ) -> Result { let mut aggregated = AggregatedCompilerOutput::default(); tracing::trace!("compiling {} jobs sequentially", input.len()); for (solc, (version, filtered_sources)) in input { if filtered_sources.is_empty() { // nothing to compile tracing::trace!( "skip solc {} {} for empty sources set", solc.as_ref().display(), version ); continue } tracing::trace!( "compiling {} sources with solc \"{}\" {:?}", filtered_sources.len(), solc.as_ref().display(), solc.args ); let dirty_files: Vec = filtered_sources.dirty_files().cloned().collect(); // depending on the composition of the filtered sources, the output selection can be // optimized let mut opt_settings = settings.clone(); let sources = sparse_output.sparse_sources(filtered_sources, &mut opt_settings); for input in CompilerInput::with_sources(sources) { let actually_dirty = input .sources .keys() .filter(|f| dirty_files.contains(f)) .cloned() .collect::>(); if actually_dirty.is_empty() { // nothing to compile for this particular language, all dirty files are in the other // language set tracing::trace!( "skip solc {} {} compilation of {} compiler input due to empty source set", solc.as_ref().display(), version, input.language ); continue } let input = input .settings(opt_settings.clone()) .normalize_evm_version(&version) .with_remappings(paths.remappings.clone()); tracing::trace!( "calling solc `{}` with {} sources {:?}", version, input.sources.len(), input.sources.keys() ); report::solc_spawn(&solc, &version, &input, &actually_dirty); let output = solc.compile_exact(&input)?; report::solc_success(&solc, &version, &output); tracing::trace!("compiled input, output has error: {}", output.has_error()); tracing::trace!("received compiler output: {:?}", output.contracts.keys()); aggregated.extend(version.clone(), output); } } Ok(aggregated) } /// compiles the input set using `num_jobs` threads fn compile_parallel( input: VersionedFilteredSources, num_jobs: usize, settings: &Settings, paths: &ProjectPathsConfig, sparse_output: SparseOutputFileFilter, ) -> Result { debug_assert!(num_jobs > 1); tracing::trace!( "compile {} sources in parallel using up to {} solc jobs", input.len(), num_jobs ); let mut jobs = Vec::with_capacity(input.len()); for (solc, (version, filtered_sources)) in input { if filtered_sources.is_empty() { // nothing to compile tracing::trace!( "skip solc {} {} for empty sources set", solc.as_ref().display(), version ); continue } let dirty_files: Vec = filtered_sources.dirty_files().cloned().collect(); // depending on the composition of the filtered sources, the output selection can be // optimized let mut opt_settings = settings.clone(); let sources = sparse_output.sparse_sources(filtered_sources, &mut opt_settings); for input in CompilerInput::with_sources(sources) { let actually_dirty = input .sources .keys() .filter(|f| dirty_files.contains(f)) .cloned() .collect::>(); if actually_dirty.is_empty() { // nothing to compile for this particular language, all dirty files are in the other // language set tracing::trace!( "skip solc {} {} compilation of {} compiler input due to empty source set", solc.as_ref().display(), version, input.language ); continue } let job = input .settings(settings.clone()) .normalize_evm_version(&version) .with_remappings(paths.remappings.clone()); jobs.push((solc.clone(), version.clone(), job, actually_dirty)) } } // start a rayon threadpool that will execute all `Solc::compile()` processes let pool = rayon::ThreadPoolBuilder::new().num_threads(num_jobs).build().unwrap(); let outputs = pool.install(move || { jobs.into_par_iter() .map(|(solc, version, input, actually_dirty)| { tracing::trace!( "calling solc `{}` {:?} with {} sources: {:?}", version, solc.args, input.sources.len(), input.sources.keys() ); report::solc_spawn(&solc, &version, &input, &actually_dirty); solc.compile(&input).map(move |output| { report::solc_success(&solc, &version, &output); (version, output) }) }) .collect::>>() })?; let mut aggregated = AggregatedCompilerOutput::default(); aggregated.extend_all(outputs); Ok(aggregated) } #[cfg(test)] #[cfg(feature = "project-util")] mod tests { use super::*; use crate::{project_util::TempProject, MinimalCombinedArtifacts}; use std::path::PathBuf; #[allow(unused)] fn init_tracing() { let _ = tracing_subscriber::fmt() .with_env_filter(tracing_subscriber::EnvFilter::from_default_env()) .try_init() .ok(); } #[test] fn can_preprocess() { let root = PathBuf::from(env!("CARGO_MANIFEST_DIR")).join("test-data/dapp-sample"); let project = Project::builder().paths(ProjectPathsConfig::dapptools(root).unwrap()).build().unwrap(); let compiler = ProjectCompiler::new(&project).unwrap(); let prep = compiler.preprocess().unwrap(); let cache = prep.cache.as_cached().unwrap(); // 3 contracts assert_eq!(cache.dirty_source_files.len(), 3); assert!(cache.filtered.is_empty()); assert!(cache.cache.is_empty()); let compiled = prep.compile().unwrap(); assert_eq!(compiled.output.contracts.files().count(), 3); } #[test] fn can_detect_cached_files() { let root = PathBuf::from(env!("CARGO_MANIFEST_DIR")).join("test-data/dapp-sample"); let paths = ProjectPathsConfig::builder().sources(root.join("src")).lib(root.join("lib")); let project = TempProject::::new(paths).unwrap(); let compiled = project.compile().unwrap(); assert!(!compiled.has_compiler_errors()); let inner = project.project(); let compiler = ProjectCompiler::new(inner).unwrap(); let prep = compiler.preprocess().unwrap(); assert!(prep.cache.as_cached().unwrap().dirty_source_files.is_empty()) } #[test] fn can_recompile_with_optimized_output() { let tmp = TempProject::dapptools().unwrap(); tmp.add_source( "A", r#" pragma solidity ^0.8.10; import "./B.sol"; contract A {} "#, ) .unwrap(); tmp.add_source( "B", r#" pragma solidity ^0.8.10; contract B { function hello() public {} } import "./C.sol"; "#, ) .unwrap(); tmp.add_source( "C", r#" pragma solidity ^0.8.10; contract C { function hello() public {} } "#, ) .unwrap(); let compiled = tmp.compile().unwrap(); assert!(!compiled.has_compiler_errors()); tmp.artifacts_snapshot().unwrap().assert_artifacts_essentials_present(); // modify A.sol tmp.add_source( "A", r#" pragma solidity ^0.8.10; import "./B.sol"; contract A { function testExample() public {} } "#, ) .unwrap(); let compiler = ProjectCompiler::new(tmp.project()).unwrap(); let state = compiler.preprocess().unwrap(); let sources = state.sources.sources(); // single solc assert_eq!(sources.len(), 1); let (_, filtered) = sources.values().next().unwrap(); // 3 contracts total assert_eq!(filtered.0.len(), 3); // A is modified assert_eq!(filtered.dirty().count(), 1); assert!(filtered.dirty_files().next().unwrap().ends_with("A.sol")); let state = state.compile().unwrap(); assert_eq!(state.output.sources.len(), 3); for (f, source) in &state.output.sources { if f.ends_with("A.sol") { assert!(source.ast.is_object()); } else { assert!(source.ast.is_null()); } } assert_eq!(state.output.contracts.len(), 1); let (a, c) = state.output.contracts_iter().next().unwrap(); assert_eq!(a, "A"); assert!(c.abi.is_some() && c.evm.is_some()); let state = state.write_artifacts().unwrap(); assert_eq!(state.compiled_artifacts.as_ref().len(), 1); let out = state.write_cache().unwrap(); let artifacts: Vec<_> = out.into_artifacts().collect(); assert_eq!(artifacts.len(), 3); for (_, artifact) in artifacts { let c = artifact.into_contract_bytecode(); assert!(c.abi.is_some() && c.bytecode.is_some() && c.deployed_bytecode.is_some()); } tmp.artifacts_snapshot().unwrap().assert_artifacts_essentials_present(); } #[test] #[ignore] fn can_compile_real_project() { init_tracing(); let paths = ProjectPathsConfig::builder() .root("../../foundry-integration-tests/testdata/solmate") .build() .unwrap(); let project = Project::builder().paths(paths).build().unwrap(); let compiler = ProjectCompiler::new(&project).unwrap(); let out = compiler.compile().unwrap(); println!("{}", out); } }