tiny.smg.scan.reconcile.scope

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

1const std = @import("std");2const smg = @import("../../root.zig");34const graph_mod = smg.graph;5const model = smg.model;6const scan_root = smg.scan;7const core = scan_root.core;8const scan_files = scan_root.scan_files;910pub const Scope = struct {11    files: []const []const u8,12    trees: []const []const u8,13    exact: []const []const u8,14};1516pub fn collect(allocator: std.mem.Allocator, graph: graph_mod.Graph, root: []const u8, paths: []const []const u8, options: core.Options) !Scope {17    var files: std.ArrayList([]const u8) = .empty;18    var trees: std.ArrayList([]const u8) = .empty;19    var exact: std.ArrayList([]const u8) = .empty;20    var marker_changes: std.ArrayList([]const u8) = .empty;21    if (paths.len == 0) {22        try trees.append(allocator, ".");23        try scan_files.collectSupported(24            allocator,25            root,26            root,27            &files,28            options.excludes,29            options.limits.scan,30        );31    } else {32        for (paths) |path| {33            const stat = scan_files.statPath(path) catch |err| switch (err) {34                error.FileNotFound, error.NotDir => {35                    const rel = try scan_files.relativePath(allocator, root, path);36                    if (scan_files.supported(path) and !try scan_files.shouldSkip(allocator, root, path, options.excludes)) {37                        try scan_files.appendUnique(allocator, &exact, rel);38                        try trees.append(allocator, try treePrefix(allocator, rel));39                    } else if (!try scan_files.shouldSkip(allocator, root, path, options.excludes)) {40                        try trees.append(allocator, try treePrefix(allocator, rel));41                    }42                    if (packageMarker(rel)) try scan_files.appendUnique(allocator, &marker_changes, rel);43                    continue;44                },45                else => return err,46            };47            const rel = try scan_files.relativePath(allocator, root, path);48            if (stat.kind == .directory) {49                if (scan_files.supported(path) and !try scan_files.shouldSkip(allocator, root, path, options.excludes)) try scan_files.appendUnique(allocator, &exact, rel);50                try trees.append(allocator, try treePrefix(allocator, rel));51                try scan_files.collectSupported(52                    allocator,53                    root,54                    path,55                    &files,56                    options.excludes,57                    options.limits.scan,58                );59            } else {60                try trees.append(allocator, try treePrefix(allocator, rel));61                if (scan_files.supported(path) and !try scan_files.shouldSkip(allocator, root, path, options.excludes)) {62                    if (stat.kind == .file) {63                        try scan_files.appendUnique(allocator, &files, rel);64                    } else {65                        try scan_files.appendUnique(allocator, &exact, rel);66                    }67                }68            }69            if (packageMarker(rel)) try scan_files.appendUnique(allocator, &marker_changes, rel);70        }71    }72    for (marker_changes.items) |marker| {73        const parent = std.fs.path.dirname(marker) orelse ".";74        const prefix = try treePrefix(allocator, parent);75        try scan_files.appendUnique(allocator, &trees, prefix);76        const parent_path = if (std.mem.eql(u8, parent, ".")) root else try std.fs.path.join(allocator, &.{ root, parent });77        try scan_files.collectSupported(78            allocator,79            root,80            parent_path,81            &files,82            options.excludes,83            options.limits.scan,84        );85    }86    try addModuleIdentityReplacements(allocator, graph, root, files.items, &exact);87    std.mem.sort([]const u8, files.items, {}, scan_files.lessThan);88    std.mem.sort([]const u8, exact.items, {}, scan_files.lessThan);89    return .{90        .files = try files.toOwnedSlice(allocator),91        .trees = try trees.toOwnedSlice(allocator),92        .exact = try exact.toOwnedSlice(allocator),93    };94}9596fn treePrefix(allocator: std.mem.Allocator, rel_raw: []const u8) ![]const u8 {97    const rel = std.mem.trimEnd(u8, rel_raw, "/");98    if (rel.len == 0 or std.mem.eql(u8, rel, ".")) return ".";99    return try std.fmt.allocPrint(allocator, "{s}/", .{rel});100}101102fn packageMarker(file: []const u8) bool {103    return std.mem.eql(u8, std.fs.path.basename(file), "__init__.py");104}105106fn addModuleIdentityReplacements(107    allocator: std.mem.Allocator,108    graph: graph_mod.Graph,109    root: []const u8,110    files: []const []const u8,111    exact: *std.ArrayList([]const u8),112) !void {113    var live = std.StringHashMap(void).init(allocator);114    defer live.deinit();115    for (files) |file| try live.put(file, {});116    var expected = std.StringHashMap([]const u8).init(allocator);117    defer expected.deinit();118    for (graph.nodes.items) |node| {119        if (!graph_mod.isScan(node.metadata)) continue;120        if (!std.mem.eql(u8, node.type, model.NodeType.module) and !std.mem.eql(u8, node.type, model.NodeType.package)) continue;121        const file = node.file orelse continue;122        if (!live.contains(file)) continue;123        if (nestedFileModule(graph, node)) continue;124        const entry = try expected.getOrPut(file);125        if (!entry.found_existing) entry.value_ptr.* = try scan_files.moduleName(allocator, root, file);126        if (!std.mem.eql(u8, node.name, entry.value_ptr.*)) try scan_files.appendUnique(allocator, exact, file);127    }128}129130fn nestedFileModule(graph: graph_mod.Graph, node: model.Node) bool {131    const file = node.file orelse return false;132    for (graph_mod.incomingEdges(&graph, node.name)) |edge_index| {133        const edge = graph.edges.items[edge_index];134        if (!std.mem.eql(u8, edge.rel, model.RelType.contains) or !graph_mod.isScan(edge.metadata)) continue;135        const parent = graph_mod.getNode(&graph, edge.source) orelse continue;136        if (graph_mod.isScan(parent.metadata) and parent.file != null and std.mem.eql(u8, parent.file.?, file)) return true;137    }138    return false;139}