tiny.smg.command.calls.text

1pub const text = @import("text.zig");

1const std = @import("std");23const smg = @import("../../root.zig");4const calls = smg.calls;5const graph_mod = smg.graph;6const node_cli = smg.command.node;78const sample_max: usize = 3;9const territory_max: usize = 3;10const cycle_member_max: usize = 8;1112pub fn write(13    allocator: std.mem.Allocator,14    writer: *std.Io.Writer,15    graph: graph_mod.Graph,16    report: calls.Report,17    depth: u32,18) !void {19    const focus = graph.nodes.items[report.focus];20    const territory = graph.nodes.items[report.focus_territory];21    try writer.print("{s}  [{s}]\n", .{ focus.name, focus.type });22    const location = try node_cli.location(allocator, focus);23    if (location.len != 0) try writer.print("file: {s}\n", .{location});24    try writer.print(25        "territory: {s}  [{s}]\n\n",26        .{ territory.name, territory.type },27    );28    try writer.writeAll("Static call relationships from the last scan\n");29    try writer.print(30        "Loaded graph: {d} nodes, {d} edges\n",31        .{ report.graph_nodes, report.graph_edges },32    );33    try writer.writeAll(34        "Complete traversal; strata use minimum call distance.\n",35    );36    try writer.writeAll(37        "--depth controls display only; exact totals cover the loaded graph.\n",38    );39    try writer.writeAll(40        "Deduplicated edges; locations are declarations, not call sites.\n",41    );42    try writer.writeAll("No runtime path, frequency, or traffic meaning.\n");43    try writeReach(allocator, writer, graph, "Callers", report.callers, depth);44    try writeReach(allocator, writer, graph, "Calls", report.calls, depth);45    try writeCycle(allocator, writer, graph, report);46    try writeResolution(writer, report.resolution);47}4849fn writeReach(50    allocator: std.mem.Allocator,51    writer: *std.Io.Writer,52    graph: graph_mod.Graph,53    title: []const u8,54    reach: calls.Reach,55    depth: u32,56) !void {57    try writer.print(58        "\n{s}  {d} total · {d} test-marked · {d} other · max depth {d}\n",59        .{60            title,61            reach.total,62            reach.test_marked,63            reach.total - reach.test_marked,64            reach.max_depth,65        },66    );67    const shown_depth = @min(depth, reach.max_depth);68    for (reach.strata[0..shown_depth]) |stratum| {69        try writer.print(70            "  depth {d}  {d} nodes · {d} test-marked · {d} other · " ++71                "{d} territories\n",72            .{73                stratum.depth,74                stratum.count,75                stratum.test_marked,76                stratum.count - stratum.test_marked,77                stratum.territory_count,78            },79        );80        try writeTerritories(writer, graph, reach, stratum);81        try writeSamples(allocator, writer, graph, reach, stratum);82    }83    const beyond = reach.beyond(depth);84    if (beyond != 0) {85        try writer.print(86            "  ... {d} node{s} beyond depth {d}\n",87            .{ beyond, if (beyond == 1) "" else "s", depth },88        );89    }90}9192fn writeTerritories(93    writer: *std.Io.Writer,94    graph: graph_mod.Graph,95    reach: calls.Reach,96    stratum: calls.Stratum,97) !void {98    const start: usize = @intCast(stratum.territory_start);99    const count: usize = @intCast(stratum.territory_count);100    const displayed = @min(count, territory_max);101    try writer.writeAll("    territories: ");102    for (reach.territories[start..][0..displayed], 0..) |item, index| {103        if (index != 0) try writer.writeAll(", ");104        try writer.print(105            "{s} ({d})",106            .{ graph.nodes.items[item.node].name, item.count },107        );108    }109    if (displayed < count) {110        try writer.print(", +{d} more", .{count - displayed});111    }112    try writer.writeByte('\n');113}114115fn writeSamples(116    allocator: std.mem.Allocator,117    writer: *std.Io.Writer,118    graph: graph_mod.Graph,119    reach: calls.Reach,120    stratum: calls.Stratum,121) !void {122    var displayed: usize = 0;123    for (reach.entries) |entry| {124        if (entry.depth != stratum.depth) continue;125        if (displayed == sample_max) break;126        const node = graph.nodes.items[entry.node];127        const location = try node_cli.location(allocator, node);128        try writer.print("    {s}", .{node.name});129        if (entry.test_marked) try writer.writeAll(" [test]");130        if (entry.cycle) try writer.writeAll(" [cycle]");131        if (location.len != 0) try writer.print("  {s}", .{location});132        try writer.writeByte('\n');133        displayed += 1;134    }135    if (displayed < stratum.count) {136        try writer.print(137            "    ... {d} more at this depth\n",138            .{stratum.count - displayed},139        );140    }141}142143fn writeCycle(144    allocator: std.mem.Allocator,145    writer: *std.Io.Writer,146    graph: graph_mod.Graph,147    report: calls.Report,148) !void {149    try writer.writeAll("\nCycle participation\n");150    try writer.print(151        "  self-recursive: {s}\n",152        .{if (report.cycle.recursive) "yes" else "no"},153    );154    try writer.print(155        "  focus cycle: {d} other node{s}\n",156        .{157            report.cycle.members.len,158            if (report.cycle.members.len == 1) "" else "s",159        },160    );161    const displayed = @min(report.cycle.members.len, cycle_member_max);162    for (report.cycle.members[0..displayed]) |node_index| {163        const node = graph.nodes.items[node_index];164        const location = try node_cli.location(allocator, node);165        try writer.print("    {s}", .{node.name});166        if (location.len != 0) try writer.print("  {s}", .{location});167        try writer.writeByte('\n');168    }169    if (displayed < report.cycle.members.len) {170        try writer.print(171            "    ... {d} more cycle members\n",172            .{report.cycle.members.len - displayed},173        );174    }175}176177fn writeResolution(178    writer: *std.Io.Writer,179    resolution: calls.Resolution,180) !void {181    try writer.writeAll("\nCall target resolution evidence\n");182    try writer.writeAll("  unresolved target names: ");183    try writeOptionalCount(writer, resolution.unresolved_targets);184    try writer.writeAll("  external target names: ");185    try writeOptionalCount(writer, resolution.external_targets);186}187188fn writeOptionalCount(writer: *std.Io.Writer, value: ?u32) !void {189    if (value) |count| {190        try writer.print("{d}\n", .{count});191    } else {192        try writer.writeAll("unknown (not recorded by this scan)\n");193    }194}195196test "call architecture text distinguishes exact totals from display depth" {197    const fixture = @import("fixture.zig");198    var arena = std.heap.ArenaAllocator.init(std.testing.allocator);199    defer arena.deinit();200    const allocator = arena.allocator();201    const graph = try fixture.small(allocator);202    const report = try calls.build(allocator, graph, "app.focus");203    var out: std.Io.Writer.Allocating = .init(allocator);204    try write(allocator, &out.writer, graph, report, 1);205    try std.testing.expect(206        std.mem.indexOf(u8, out.written(), "Callers  2 total") != null,207    );208    try std.testing.expect(209        std.mem.indexOf(u8, out.written(), "... 1 node beyond depth 1") != null,210    );211    try std.testing.expect(212        std.mem.indexOf(213            u8,214            out.written(),215            "locations are declarations, not call sites",216        ) != null,217    );218}