use std::collections::BTreeMap;
use std::sync::Arc;
use std::time::{Duration, Instant};
use anyhow::Result;
use crate::cli::{BuildOptions, BuildPhase, DisplayOptions};
use crate::color;
use crate::errors;
use crate::executor::{Executor, ExecutorOptions};
use crate::processors::{BuildStats, ProcessorMap, ProcessorType};
use super::{Builder, ProductStatusLabels, StatusPrintOptions, phases_debug};
fn expand_aliases(filter: &[String], processors: &ProcessorMap) -> Vec<String> {
let mut expanded = Vec::new();
for name in filter {
if let Some(alias) = name.strip_prefix('@') {
match alias {
"checkers" => {
expanded.extend(
processors.iter()
.filter(|(_, p)| p.processor_type() == ProcessorType::Checker)
.map(|(n, _)| n.clone())
);
}
"generators" => {
expanded.extend(
processors.iter()
.filter(|(_, p)| p.processor_type() == ProcessorType::Generator)
.map(|(n, _)| n.clone())
);
}
"mass_generators" => {
expanded.extend(
processors.iter()
.filter(|(_, p)| p.processor_type() == ProcessorType::MassGenerator)
.map(|(n, _)| n.clone())
);
}
_ => {
let by_tool: Vec<_> = processors.iter()
.filter(|(_, p)| p.required_tools().iter().any(|t| t == alias))
.map(|(n, _)| n.clone())
.collect();
if !by_tool.is_empty() {
expanded.extend(by_tool);
} else if processors.contains_key(alias) {
expanded.push(alias.to_string());
} else {
expanded.push(name.clone());
}
}
}
} else {
expanded.push(name.clone());
}
}
expanded.sort();
expanded.dedup();
expanded
}
impl Builder {
pub fn build(&mut self, opts: &BuildOptions, interrupted: Arc<std::sync::atomic::AtomicBool>, init_timings: Vec<(String, Duration)>) -> Result<(), anyhow::Error> {
if opts.auto_add_words {
for inst in &mut self.config.processor.instances {
if (inst.type_name == "zspell" || inst.type_name == "aspell")
&& let Some(table) = inst.config_toml.as_table_mut()
{
table.insert("auto_add_words".to_string(), toml::Value::Boolean(true));
}
}
}
if opts.no_mtime {
self.object_store.set_mtime_check(false);
}
let t = Instant::now();
let processors = self.create_processors()?;
let create_processors_dur = t.elapsed();
let expanded_filter = opts.processor_filter.as_ref()
.map(|f| expand_aliases(f, &processors));
let processor_filter = expanded_filter.as_deref();
if let Some(filter) = processor_filter {
for name in filter {
if !processors.contains_key(name) {
let available: Vec<_> = processors.keys().collect();
return Err(crate::exit_code::RsconstructError::new(
crate::exit_code::RsconstructExitCode::ConfigError,
format!("Unknown processor '{}'. Available: {:?}", name, available),
).into());
}
}
}
{
let active_names: Vec<&String> = if let Some(filter) = processor_filter {
processors.keys().filter(|k| filter.iter().any(|f| f == *k)).collect()
} else {
processors.keys().collect()
};
let mut missing: Vec<(String, Vec<String>)> = Vec::new();
let mut checked: std::collections::HashSet<String> = std::collections::HashSet::new();
for name in &active_names {
for tool in processors[*name].required_tools() {
if !checked.insert(tool.clone()) {
continue;
}
if which::which(&tool).is_err() {
let procs: Vec<String> = active_names.iter()
.filter(|n| processors[**n].required_tools().contains(&tool))
.map(|n| (*n).clone())
.collect();
missing.push((tool, procs));
}
}
}
if !missing.is_empty() {
missing.sort_by(|a, b| a.0.cmp(&b.0));
let mut msg = String::from("Missing required tools:\n");
for (tool, procs) in &missing {
let install_hint = crate::processors::tool_install_command(&tool)
.map(|cmd| format!(" install: {}", cmd))
.unwrap_or_default();
msg.push_str(&format!(" {} (needed by: {}){}\n", tool, procs.join(", "), install_hint));
}
msg.push_str("\nRun `rsconstruct tools install` to install missing tools.");
return Err(crate::exit_code::RsconstructError::new(
crate::exit_code::RsconstructExitCode::ToolError,
msg.trim_end(),
).into());
}
}
self.detect_config_changes(&processors, opts.show_all_config_changes);
let (mut graph, mut phase_timings) = self.build_graph_with_processors_and_phase(&processors, opts.stop_after, processor_filter, opts.verbose)?;
if let Some(ref targets) = opts.targets {
graph.filter_by_targets(targets);
}
phase_timings.insert(0, ("create_processors".to_string(), create_processors_dur));
for (i, timing) in init_timings.into_iter().enumerate() {
phase_timings.insert(i, timing);
}
if opts.stop_after != BuildPhase::Build && opts.stop_after != BuildPhase::Classify {
if !crate::runtime_flags::quiet() {
println!("Stopped after {:?} phase.", opts.stop_after);
}
return Ok(());
}
if phases_debug() {
eprintln!("{}", color::dim(" Phase: classify"));
}
let t = Instant::now();
let order = graph.topological_sort()?;
let (skip_count, restore_count, build_count) =
crate::executor::classify_products(&graph, &order, &self.object_store, opts.force);
phase_timings.push(("classify".to_string(), t.elapsed()));
if !crate::runtime_flags::quiet() {
println!("{} products ({} up-to-date, {} to restore, {} to build)",
order.len(), skip_count, restore_count, build_count);
}
if opts.stop_after == BuildPhase::Classify {
return Ok(());
}
let parallel = opts.jobs
.or_else(|| std::env::var("RSCONSTRUCT_THREADS").ok().and_then(|v| v.parse().ok()))
.unwrap_or(self.config.build.parallel);
let batch_size = opts.batch_size.unwrap_or(self.config.build.batch_size);
let executor = Executor::new(&processors, ExecutorOptions {
parallel,
verbose: opts.verbose,
display_opts: opts.display_opts,
batch_size,
explain: opts.explain,
retry: opts.retry,
}, Arc::clone(&interrupted));
let t = Instant::now();
let collect_timings = opts.timings || opts.trace.is_some();
let result = executor.execute(&graph, &self.object_store, opts.force, collect_timings, opts.keep_going);
let build_dur = t.elapsed();
if interrupted.load(std::sync::atomic::Ordering::SeqCst) {
return Err(crate::exit_code::RsconstructError::new(
crate::exit_code::RsconstructExitCode::Interrupted,
"Build interrupted",
).into());
}
let mut stats = result?;
phase_timings.push(("build".to_string(), build_dur));
stats.phase_timings = phase_timings;
stats.print_summary(opts.summary, opts.timings);
if let Some(ref trace_path) = opts.trace {
write_trace_file(trace_path, &stats)?;
}
if stats.failed_count > 0 {
return Err(crate::exit_code::RsconstructError::new(
crate::exit_code::RsconstructExitCode::BuildError,
format!("Build completed with {} error(s)", stats.failed_count),
).into());
}
Ok(())
}
pub fn dry_run(&self, force: bool, explain: bool) -> anyhow::Result<()> {
let processors = self.create_processors()?;
let graph = self.build_graph_with_processors(&processors)?;
let order = graph.topological_sort()?;
if order.is_empty() {
println!("No products discovered.");
return Ok(());
}
let products: Vec<_> = order.iter()
.map(|&id| graph.get_product(id).expect(errors::INVALID_PRODUCT_ID))
.collect();
let labels = ProductStatusLabels {
current: (color::dim("SKIP"), "skip"),
restorable: (color::cyan("RESTORE"), "restore"),
stale: (color::yellow("BUILD"), "build"),
};
self.print_product_status(&products, &StatusPrintOptions {
force, labels: &labels, explain,
display_opts: DisplayOptions::default(), verbose: true,
all_processor_names: &[],
});
Ok(())
}
pub fn status(&self, verbose: bool, breakdown: bool) -> anyhow::Result<()> {
let processors = self.create_processors()?;
let graph = self.build_graph_with_processors(&processors)?;
let products: Vec<&_> = graph.products().iter().collect();
if products.is_empty() && processors.is_empty() {
println!("No products discovered.");
return Ok(());
}
let labels = ProductStatusLabels {
current: (color::green("UP-TO-DATE"), "up-to-date"),
restorable: (color::cyan("RESTORABLE"), "restorable"),
stale: (color::yellow("STALE"), "stale"),
};
let all_proc_names: Vec<&str> = super::sorted_keys(&processors)
.into_iter()
.map(|s| s.as_str())
.collect();
self.print_product_status(&products, &StatusPrintOptions {
force: false, labels: &labels, explain: false,
display_opts: DisplayOptions::default(), verbose,
all_processor_names: &all_proc_names,
});
if breakdown {
let mut per_processor_files: BTreeMap<&str, std::collections::HashSet<&std::path::Path>> = BTreeMap::new();
for name in &all_proc_names {
per_processor_files.entry(name).or_default();
}
for product in &products {
let files = per_processor_files.entry(&product.processor).or_default();
for input in &product.inputs {
files.insert(input.as_path());
}
}
let mut per_processor: BTreeMap<&str, BTreeMap<String, usize>> = BTreeMap::new();
for (proc_name, files) in &per_processor_files {
let ext_counts = per_processor.entry(proc_name).or_default();
for path in files {
let ext = path.extension()
.and_then(|e| e.to_str())
.unwrap_or("(no ext)");
*ext_counts.entry(ext.to_string()).or_default() += 1;
}
}
println!();
println!("{}:", color::bold("Source files by processor"));
let max_name = per_processor.keys().map(|n| n.len()).max().unwrap_or(0);
for (proc_name, ext_counts) in &per_processor {
let total: usize = ext_counts.values().sum();
if total == 0 {
println!(" {:<width$} 0 files", format!("{}:", proc_name), width = max_name + 1);
} else {
let breakdown_str = ext_counts.iter()
.map(|(ext, count)| format!("{} .{}", count, ext))
.collect::<Vec<_>>()
.join(", ");
println!(" {:<width$} {} files ({})", format!("{}:", proc_name), total, breakdown_str, width = max_name + 1);
}
}
}
Ok(())
}
pub fn info_source(&self) -> anyhow::Result<()> {
let processors = self.create_processors()?;
let graph = self.build_graph_with_processors(&processors)?;
let products = graph.products();
let mut all_inputs: std::collections::HashSet<&std::path::Path> = std::collections::HashSet::new();
for product in products {
for input in &product.inputs {
all_inputs.insert(input.as_path());
}
}
let mut ext_counts: BTreeMap<String, usize> = BTreeMap::new();
for path in &all_inputs {
let ext = path.extension()
.and_then(|e| e.to_str())
.unwrap_or("(no ext)");
*ext_counts.entry(ext.to_string()).or_default() += 1;
}
if crate::json_output::is_json_mode() {
let json = serde_json::json!({
"total": all_inputs.len(),
"by_extension": ext_counts,
});
println!("{}", serde_json::to_string_pretty(&json).expect(crate::errors::JSON_SERIALIZE));
} else {
println!("{}: {}", color::bold("Total source files"), all_inputs.len());
let max_ext_len = ext_counts.keys().map(|e| e.len()).max().unwrap_or(0);
for (ext, count) in &ext_counts {
println!(" .{:<width$} {}", ext, count, width = max_ext_len);
}
}
Ok(())
}
pub(super) fn print_product_status(
&self,
products: &[&crate::graph::Product],
opts: &StatusPrintOptions<'_>,
) {
use crate::object_store::ExplainAction;
let mut counts = [0usize; 3]; let mut per_processor: BTreeMap<&str, [usize; 3]> = BTreeMap::new();
for name in opts.all_processor_names {
per_processor.entry(name).or_default();
}
let status_labels = [&opts.labels.current.0, &opts.labels.restorable.0, &opts.labels.stale.0];
for product in products {
let cache_key = product.cache_key();
let display = product.display(opts.display_opts);
let input_checksum = match self.object_store.combined_input_checksum_fast(&product.inputs) {
Ok(cs) => cs,
Err(_) => {
if opts.verbose {
println!("{} [{}] {}", status_labels[2], product.processor, display);
}
counts[2] += 1;
per_processor.entry(&product.processor).or_default()[2] += 1;
continue;
}
};
let (status_idx, reason) = if opts.explain {
let action = self.object_store.explain_action(&cache_key, &input_checksum, &product.outputs, opts.force);
let reason = format!(" ({})", action);
let idx = match action {
ExplainAction::Skip => 0,
ExplainAction::Restore(_) => 1,
ExplainAction::Rebuild(_) => 2,
};
(idx, reason)
} else if !opts.force && !self.object_store.needs_rebuild(&cache_key, &input_checksum, &product.outputs) {
(0, String::new())
} else if !opts.force && self.object_store.can_restore(&cache_key, &input_checksum, &product.outputs) {
(1, String::new())
} else {
(2, String::new())
};
if opts.verbose {
println!("{} [{}] {}{}", status_labels[status_idx], product.processor, display, reason);
}
counts[status_idx] += 1;
per_processor.entry(&product.processor).or_default()[status_idx] += 1;
}
if per_processor.len() > 1 {
let max_name_len = per_processor.keys().map(|n| n.len()).max().unwrap_or(0);
for (name, pc) in &per_processor {
println!("{:width$} {} {}, {} {}, {} {}",
format!("{}:", name),
pc[0], opts.labels.current.1,
pc[1], opts.labels.restorable.1,
pc[2], opts.labels.stale.1,
width = max_name_len + 1);
}
}
println!("{}: {} {}, {} {}, {} {}",
color::bold("Summary"),
counts[0], opts.labels.current.1,
counts[1], opts.labels.restorable.1,
counts[2], opts.labels.stale.1);
}
}
fn write_trace_file(path: &str, stats: &BuildStats) -> Result<()> {
let mut events: Vec<serde_json::Value> = Vec::new();
let mut tid_counter = 1u64;
let mut phase_offset_us = 0i64;
for (name, dur) in &stats.phase_timings {
let dur_us = dur.as_micros() as i64;
events.push(serde_json::json!({
"name": name,
"cat": "phase",
"ph": "X",
"ts": phase_offset_us,
"dur": dur_us,
"pid": 1,
"tid": 0
}));
phase_offset_us += dur_us;
}
for cat in &stats.categories {
for pt in &cat.product_timings {
let dur_us = pt.duration.as_micros() as i64;
let ts_us = pt.start_offset
.map(|off| off.as_micros() as i64)
.unwrap_or(0);
let name = format!("{}:{}", pt.processor, pt.display);
events.push(serde_json::json!({
"name": name,
"cat": "build",
"ph": "X",
"ts": ts_us,
"dur": dur_us,
"pid": 1,
"tid": tid_counter
}));
tid_counter += 1;
}
}
let trace = serde_json::json!({ "traceEvents": events });
std::fs::write(path, serde_json::to_string_pretty(&trace)?)?;
if !crate::runtime_flags::quiet() {
println!("Wrote trace to {}", color::bold(path));
}
Ok(())
}