tiny.smg.calls

1pub const Cycle = struct {2    members: []const u32,3    recursive: bool,4};

1pub const Entry = struct {2    node: u32,3    territory: u32,4    depth: u32,5    test_marked: bool,6    cycle: bool,7};

1pub const Reach = struct {2    total: u32,3    test_marked: u32,4    max_depth: u32,5    entries: []const Entry,6    strata: []const Stratum,7    territories: []const Territory,89    pub fn beyond(self: Reach, depth: u32) u32 {10        if (depth >= self.max_depth) return 0;11        var count: u32 = 0;12        for (self.strata[depth..]) |stratum| count += stratum.count;13        return count;14    }15};

1pub const Report = struct {2    focus: u32,3    focus_territory: u32,4    graph_nodes: u32,5    graph_edges: u32,6    callers: Reach,7    calls: Reach,8    cycle: Cycle,9    resolution: Resolution,10};

1pub const Resolution = struct {2    unresolved_targets: ?u32,3    external_targets: ?u32,4};

1pub const Stratum = struct {2    depth: u32,3    count: u32,4    test_marked: u32,5    territory_start: u32,6    territory_count: u32,7};

1pub const Territory = struct {2    node: u32,3    count: u32,4};

1pub fn build(2    allocator: std.mem.Allocator,3    graph: graph_mod.Graph,4    focus_name: []const u8,5) !calls.Report {6    if (graph.nodes.items.len >= unreached) return error.CapacityOverflow;7    if (graph.edges.items.len > std.math.maxInt(u32)) return error.CapacityOverflow;8    const focus: u32 = @intCast(graph.node_index.get(focus_name) orelse9        return error.NodeNotFound);10    const incoming = try allocator.alloc(u32, graph.nodes.items.len);11    defer allocator.free(incoming);12    const outgoing = try allocator.alloc(u32, graph.nodes.items.len);13    defer allocator.free(outgoing);14    const queue = try allocator.alloc(u32, graph.nodes.items.len);15    defer allocator.free(queue);16    fillDistances(graph, focus, .incoming, incoming, queue);17    fillDistances(graph, focus, .outgoing, outgoing, queue);18    return .{19        .focus = focus,20        .focus_territory = territoryIndex(graph, focus),21        .graph_nodes = @intCast(graph.nodes.items.len),22        .graph_edges = @intCast(graph.edges.items.len),23        .callers = try buildReach(allocator, graph, incoming, outgoing),24        .calls = try buildReach(allocator, graph, outgoing, incoming),25        .cycle = try buildCycle(allocator, graph, focus, incoming, outgoing),26        .resolution = try resolution(allocator, graph.nodes.items[focus]),27    };28}

1const report = @import("report.zig");23pub const Cycle = report.Cycle;4pub const Entry = report.Entry;5pub const Reach = report.Reach;6pub const Report = report.Report;7pub const Resolution = report.Resolution;8pub const Stratum = report.Stratum;9pub const Territory = report.Territory;1011pub const build = @import("analyze.zig").build;

1pub const calls = @import("calls/root.zig");