| ... | ... | @@ -72,7 +72,6 @@ pub fn main() !void { |
| 72 | 72 | .query = .{}, |
| 73 | 73 | .result = try std.zig.system.resolveTargetQuery(.{}), |
| 74 | 74 | }, |
| 75 | | .incremental = null, |
| 76 | 75 | }; |
| 77 | 76 | |
| 78 | 77 | graph.cache.addPrefix(.{ .path = null, .handle = std.fs.cwd() }); |
| ... | ... | @@ -411,8 +410,8 @@ pub fn main() !void { |
| 411 | 410 | // trigger a rebuild on all steps with modified inputs, as well as their |
| 412 | 411 | // recursive dependants. |
| 413 | 412 | var caption_buf: [std.Progress.Node.max_name_len]u8 = undefined; |
| 414 | | const caption = std.fmt.bufPrint(&caption_buf, "Watching {d} Directories", .{ |
| 415 | | w.dir_table.entries.len, |
| 413 | const caption = std.fmt.bufPrint(&caption_buf, "watching {d} directories, {d} processes", .{ |
| 414 | w.dir_table.entries.len, countSubProcesses(run.step_stack.keys()), |
| 416 | 415 | }) catch &caption_buf; |
| 417 | 416 | var debouncing_node = main_progress_node.start(caption, 0); |
| 418 | 417 | var debounce_timeout: Watch.Timeout = .none; |
| ... | ... | @@ -445,6 +444,14 @@ fn markFailedStepsDirty(gpa: Allocator, all_steps: []const *Step) void { |
| 445 | 444 | }; |
| 446 | 445 | } |
| 447 | 446 | |
| 447 | fn countSubProcesses(all_steps: []const *Step) usize { |
| 448 | var count: usize = 0; |
| 449 | for (all_steps) |s| { |
| 450 | count += @intFromBool(s.getZigProcess() != null); |
| 451 | } |
| 452 | return count; |
| 453 | } |
| 454 | |
| 448 | 455 | const Run = struct { |
| 449 | 456 | max_rss: u64, |
| 450 | 457 | max_rss_is_default: bool, |