rsconstruct 0.9.2

Rust based fast build system
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
use std::collections::BTreeMap;
use std::sync::Arc;
use std::time::{Duration, Instant};
use anyhow::Result;
use tabled::builder::Builder as TableBuilder;
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, GraphSnapshot, ProductStatusLabels, StatusPrintOptions, phases_debug, print_graph_stats};

/// Expand `@`-prefixed shortcuts in the processor filter.
///
/// Three categories of shortcuts:
/// - **By type**: `@checkers`, `@generators`, `@creators`, `@lua`
/// - **By tool**: `@python3`, `@node`, etc. — matches processors whose `required_tools()` contains the name
/// - **By processor name**: `@ruff` → `"ruff"` — strips the `@` prefix
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())
                    );
                }
                "creators" => {
                    expanded.extend(
                        processors.iter()
                            .filter(|(_, p)| p.processor_type() == ProcessorType::Creator)
                            .map(|(n, _)| n.clone())
                    );
                }
                "lua" => {
                    expanded.extend(
                        processors.iter()
                            .filter(|(_, p)| p.processor_type() == ProcessorType::Lua)
                            .map(|(n, _)| n.clone())
                    );
                }
                _ => {
                    // Check if it's a tool name
                    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) {
                        // Fall back to processor name
                        expanded.push(alias.to_string());
                    } else {
                        // Unknown alias — keep original so validation reports the error
                        expanded.push(name.clone());
                    }
                }
            }
        } else {
            expanded.push(name.clone());
        }
    }
    expanded.sort();
    expanded.dedup();
    expanded
}

impl Builder {
    /// Execute an incremental build using the dependency graph
    pub fn build(&mut self, ctx: &crate::build_context::BuildContext, opts: &BuildOptions, interrupted: Arc<std::sync::atomic::AtomicBool>, init_timings: Vec<(String, Duration)>) -> Result<(), anyhow::Error> {
        // CLI override for zspell and aspell auto_add_words
        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));
                }
            }
        }

        // CLI override for mtime pre-check
        if opts.no_mtime {
            ctx.set_mtime_check(false);
        }

        // Create processors
        let t = Instant::now();
        let processors = self.create_processors()?;
        let create_processors_dur = t.elapsed();

        // Expand @-prefixed shortcuts in both filters, then compute the final
        // set of processors to run:
        //   - if -p is given: start from that set (else all processors)
        //   - if -x is given: remove those from the set
        //   - conflict (same name in both) → error
        //   - unknown names in either filter → error
        let include_expanded = opts.processor_filter.as_ref()
            .map(|f| expand_aliases(f, &processors));
        let exclude_expanded = opts.exclude_filter.as_ref()
            .map(|f| expand_aliases(f, &processors));

        // Validate unknown names in either filter, pooling both error reports.
        let mut unknown: Vec<String> = Vec::new();
        for filter in [&include_expanded, &exclude_expanded].iter().copied().flatten() {
            for name in filter {
                if !processors.contains_key(name) {
                    unknown.push(name.clone());
                }
            }
        }
        if !unknown.is_empty() {
            let mut available: Vec<&String> = processors.keys().collect();
            available.sort();
            return Err(crate::exit_code::RsconstructError::new(
                crate::exit_code::RsconstructExitCode::ConfigError,
                format!("Unknown processor(s): {:?}. Available: {:?}", unknown, available),
            ).into());
        }

        // Reject overlap between -p and -x: contradictory intent should fail
        // loudly rather than silently picking one side.
        if let (Some(inc), Some(exc)) = (&include_expanded, &exclude_expanded) {
            let conflicts: Vec<&String> = exc.iter().filter(|e| inc.contains(e)).collect();
            if !conflicts.is_empty() {
                return Err(crate::exit_code::RsconstructError::new(
                    crate::exit_code::RsconstructExitCode::ConfigError,
                    format!("Processor(s) {:?} appear in both -p and -x", conflicts),
                ).into());
            }
        }

        // Build the final filter. When -x is the only filter, synthesize an
        // include list from "all processors minus excludes" so downstream code
        // can treat it as a regular allow-list.
        let expanded_filter: Option<Vec<String>> = match (include_expanded, exclude_expanded) {
            (Some(inc), Some(exc)) => Some(inc.into_iter().filter(|n| !exc.contains(n)).collect()),
            (Some(inc), None) => Some(inc),
            (None, Some(exc)) => Some(
                processors.keys().filter(|n| !exc.contains(n)).cloned().collect()
            ),
            (None, None) => None,
        };
        let processor_filter = expanded_filter.as_deref();

        // Pre-flight: verify all required tools are available for declared processors
        {
            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());
            }
        }

        // Check for config changes and display diffs
        self.detect_config_changes(&processors, opts.show_all_config_changes);

        // Build the dependency graph (may stop early based on stop_after)
        let (mut graph, mut phase_timings) = self.build_graph_with_processors_and_phase(ctx, &processors, opts.stop_after, processor_filter, opts.verbose)?;

        // Filter by target patterns if specified
        if let Some(ref targets) = opts.targets {
            graph.filter_by_targets(targets)?;
        }

        // Prepend create_processors and init timings
        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 we stopped early (before classify), we're done
        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(());
        }

        // Phase: Classify products (skip/restore/build). Printed in two lines,
        // matching the dep-scan phase style:
        //   - forward-looking total before classify runs (this is the checksum
        //     pass, which is the expensive work for large graphs)
        //   - post-classify breakdown showing what will actually be built
        if phases_debug() {
            eprintln!("{}", color::dim("  Phase: classify"));
        }
        let t = Instant::now();
        let order = graph.topological_sort()?;
        if !crate::runtime_flags::quiet() {
            println!("[build] {} products to check for updates", order.len());
        }
        let policy = crate::executor::IncrementalPolicy;
        let (skip_count, restore_count, build_count) =
            crate::executor::classify_products(ctx, &policy, &graph, &order, &self.object_store, opts.force);
        phase_timings.push(("classify".to_string(), t.elapsed()));
        if !crate::runtime_flags::quiet() {
            println!("[build] {} to build, {} to restore ({} up-to-date)",
                build_count, restore_count, skip_count);
        }
        print_graph_stats(GraphSnapshot::AfterClassify, &graph);

        if opts.stop_after == BuildPhase::Classify {
            return Ok(());
        }

        // Create executor with parallelism from command line, env var, or config
        let parallel = opts.jobs
            .or_else(|| std::env::var("RSCONSTRUCT_THREADS").ok().and_then(|v| v.parse().ok()))
            .unwrap_or(self.config.build.parallel);
        // CLI overrides config for batch_size
        let batch_size = opts.batch_size.unwrap_or(self.config.build.batch_size);
        let executor = Executor::new(&processors, ctx, &policy, ExecutorOptions {
            parallel,
            verbose: opts.verbose,
            display_opts: opts.display_opts,
            batch_size,
            explain: opts.explain,
            retry: opts.retry,
        }, Arc::clone(&interrupted));

        // Execute the build (enable timings collection if trace output is requested)
        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();
        print_graph_stats(GraphSnapshot::AfterExecute, &graph);

        // Exit if interrupted
        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?;

        // Add phase timings to stats
        phase_timings.push(("build".to_string(), build_dur));
        stats.phase_timings = phase_timings;

        // Print summary
        stats.print_summary(opts.summary, opts.timings);

        // Write Chrome trace file if requested
        if let Some(ref trace_path) = opts.trace {
            write_trace_file(trace_path, &stats)?;
        }

        // Return error if there were failures in keep-going mode
        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(())
    }

    /// Show what would happen without executing anything
    pub fn dry_run(&self, ctx: &crate::build_context::BuildContext, force: bool, explain: bool) -> anyhow::Result<()> {
        let processors = self.create_processors()?;
        let graph = self.build_graph_with_processors(ctx, &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"),
            new: (color::yellow("BUILD"), "build-new"),
        };

        self.print_product_status(ctx, &products, &StatusPrintOptions {
            force, labels: &labels, explain,
            display_opts: DisplayOptions::default(), verbose: true,
            all_processor_names: &[],
            native_processors: &std::collections::HashSet::new(),
        });
        Ok(())
    }

    /// Show the status of each product in the build graph
    pub fn status(&self, ctx: &crate::build_context::BuildContext, verbose: bool, breakdown: bool) -> anyhow::Result<()> {
        let processors = self.create_processors()?;
        let graph = self.build_graph_with_processors(ctx, &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"),
            new: (color::magenta("NEW"), "new"),
        };

        // Collect all processor names so we also show processors with 0 files
        let all_proc_names: Vec<&str> = super::sorted_keys(&processors)
            .into_iter()
            .map(|s| s.as_str())
            .collect();
        let native_set: std::collections::HashSet<&str> = processors.iter()
            .filter(|(_, proc)| proc.is_native())
            .map(|(name, _)| name.as_str())
            .collect();
        self.print_product_status(ctx, &products, &StatusPrintOptions {
            force: false, labels: &labels, explain: false,
            display_opts: DisplayOptions::default(), verbose,
            all_processor_names: &all_proc_names,
            native_processors: &native_set,
        });

        if breakdown {
            // Collect unique source files per processor, then count by extension
            let mut per_processor_files: BTreeMap<&str, std::collections::HashSet<&std::path::Path>> = BTreeMap::new();
            // Seed with all processors so 0-file processors are shown
            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 mut builder = TableBuilder::new();
            builder.push_record(["Processor", "Files", "Breakdown"]);
            for (proc_name, ext_counts) in &per_processor {
                let total: usize = ext_counts.values().sum();
                let breakdown_str = if total == 0 {
                    String::new()
                } else {
                    ext_counts.iter()
                        .map(|(ext, count)| format!("{} .{}", count, ext))
                        .collect::<Vec<_>>()
                        .join(", ")
                };
                builder.push_record([proc_name.to_string(), format!("{} files", total), breakdown_str]);
            }
            color::print_table(builder.build());
        }

        Ok(())
    }

    /// Show source file counts by extension.
    pub fn info_source(&self, ctx: &crate::build_context::BuildContext) -> anyhow::Result<()> {
        let processors = self.create_processors()?;
        let graph = self.build_graph_with_processors(ctx, &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 mut builder = TableBuilder::new();
            builder.push_record(["Extension", "Count"]);
            for (ext, count) in &ext_counts {
                builder.push_record([format!(".{}", ext), count.to_string()]);
            }
            color::print_table(builder.build());
        }
        Ok(())
    }

    /// Classify and print the status of each product, with per-processor and total summary.
    /// When `verbose` is false, only the per-processor and total summary lines are printed.
    pub(super) fn print_product_status(
        &self,
        ctx: &crate::build_context::BuildContext,
        products: &[&crate::graph::Product],
        opts: &StatusPrintOptions<'_>,
    ) {
        use crate::object_store::ExplainAction;

        const NUM_STATES: usize = 4; // current, restorable, stale, new
        let mut counts = [0usize; NUM_STATES];
        let mut per_processor: BTreeMap<&str, [usize; NUM_STATES]> = BTreeMap::new();
        // Seed with all processor names so processors with 0 products are shown
        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,
            &opts.labels.new.0,
        ];

        for product in products {
            let cache_key = product.cache_key();
            let display = product.display(opts.display_opts);

            let input_checksum = match crate::checksum::combined_input_checksum(ctx, &product.inputs) {
                Ok(cs) => cs,
                Err(_) => {
                    // Can't compute checksum — classify as new or stale based on cache
                    let idx = if self.object_store.has_cache_entry(&cache_key) { 2 } else { 3 };
                    if opts.verbose {
                        println!("{} [{}] {}", status_labels[idx], product.processor, display);
                    }
                    counts[idx] += 1;
                    per_processor.entry(&product.processor).or_default()[idx] += 1;
                    continue;
                }
            };

            let desc_key = product.descriptor_key(&input_checksum);
            let (status_idx, reason) = if opts.explain {
                let action = self.object_store.explain_descriptor(&desc_key, &product.outputs, opts.force);
                let reason = format!(" ({})", action);
                let idx = match action {
                    ExplainAction::Skip => 0,
                    ExplainAction::Restore(_) => 1,
                    ExplainAction::Rebuild(crate::object_store::RebuildReason::NoCacheEntry) => 3,
                    ExplainAction::Rebuild(_) => 2,
                };
                (idx, reason)
            } else if !opts.force && !self.object_store.needs_rebuild_descriptor(&desc_key, &product.outputs) {
                (0, String::new())
            } else if !opts.force && self.object_store.can_restore_descriptor(&desc_key) {
                (1, String::new())
            } else if self.object_store.has_cache_entry(&cache_key) {
                (2, String::new()) // stale: was built before
            } else {
                (3, String::new()) // new: never built
            };

            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 crate::json_output::is_json_mode() {
            let processors_json: Vec<serde_json::Value> = per_processor.iter().map(|(name, pc)| {
                serde_json::json!({
                    "name": name,
                    "up_to_date": pc[0],
                    "restorable": pc[1],
                    "stale": pc[2],
                    "new": pc[3],
                    "total": pc[0] + pc[1] + pc[2] + pc[3],
                    "native": opts.native_processors.contains(name),
                })
            }).collect();
            let json = serde_json::json!({
                "processors": processors_json,
                "totals": {
                    "up_to_date": counts[0],
                    "restorable": counts[1],
                    "stale": counts[2],
                    "new": counts[3],
                    "total": counts[0] + counts[1] + counts[2] + counts[3],
                },
            });
            println!("{}", serde_json::to_string_pretty(&json).expect(crate::errors::JSON_SERIALIZE));
            return;
        }

        // Per-processor table
        let col_labels = [
            opts.labels.current.1,
            opts.labels.restorable.1,
            opts.labels.stale.1,
            opts.labels.new.1,
        ];

        let mut builder = TableBuilder::new();
        builder.push_record(["Processor", col_labels[0], col_labels[1], col_labels[2], col_labels[3], "native"]);
        for (name, pc) in &per_processor {
            let native = crate::color::yes_no(opts.native_processors.contains(name));
            builder.push_record([
                name.to_string(),
                pc[0].to_string(), pc[1].to_string(), pc[2].to_string(), pc[3].to_string(),
                native.to_string(),
            ]);
        }
        builder.push_record([
            "Total".to_string(),
            counts[0].to_string(), counts[1].to_string(), counts[2].to_string(), counts[3].to_string(),
            String::new(),
        ]);
        color::print_table_with_total(builder.build());
    }
}


/// Write a Chrome trace format JSON file from build statistics.
/// The file can be opened in chrome://tracing or https://ui.perfetto.dev
fn write_trace_file(path: &str, stats: &BuildStats) -> Result<()> {
    let mut events: Vec<serde_json::Value> = Vec::new();
    let mut tid_counter = 1u64;

    // Phase timings on tid=0
    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;
    }

    // Product timings
    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 });
    crate::errors::ctx(std::fs::write(path, serde_json::to_string_pretty(&trace)?), &format!("Failed to write trace file: {}", path))?;
    if !crate::runtime_flags::quiet() {
        println!("Wrote trace to {}", color::bold(path));
    }
    Ok(())
}