tiny.smg.command.session

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

1const std = @import("std");2const alloc = @import("alloc");3const sql = @import("sql");4const sys = @import("sys");56const smg = @import("../root.zig");7const concepts = smg.concepts;8const graph_mod = smg.graph;9const model = smg.model;10const output = smg.cli.output;11const search = smg.search;12const storage = smg.storage;1314pub const PhaseBoundary = alloc.PhaseBoundary;1516pub fn load(17    allocator: std.mem.Allocator,18    scratch: std.mem.Allocator,19    limits: smg.Limits,20) !struct { []const u8, graph_mod.Graph } {21    const loaded = try loadMutation(allocator, scratch, limits);22    return .{ loaded.root, loaded.graph };23}2425pub const GraphMutation = struct {26    root: []const u8,27    graph: graph_mod.Graph,28    head: sql.Hash,29};3031pub fn loadMutation(32    allocator: std.mem.Allocator,33    scratch: std.mem.Allocator,34    limits: smg.Limits,35) !GraphMutation {36    const root = try storage.requireRoot(allocator);37    return try loadMutationAt(allocator, scratch, root, limits);38}3940pub fn loadMutationAt(41    allocator: std.mem.Allocator,42    scratch: std.mem.Allocator,43    root: []const u8,44    limits: smg.Limits,45) !GraphMutation {46    try noteGraphAge(allocator, root);47    const snapshot = try storage.graph.loadSnapshot(48        allocator,49        scratch,50        root,51        limits.storage,52    );53    return .{ .root = root, .graph = snapshot.graph, .head = snapshot.head };54}5556pub fn loadRead(57    allocator: std.mem.Allocator,58    scratch: std.mem.Allocator,59    limits: smg.Limits,60    boundary: PhaseBoundary,61) !struct { []const u8, graph_mod.Graph } {62    const loaded = try load(allocator, scratch, limits);63    boundary.seal();64    return loaded;65}6667pub const GraphConcepts = struct {68    root: []const u8,69    graph: graph_mod.Graph,70    concepts: []const concepts.Concept,71};7273pub fn loadGraphAndConcepts(74    allocator: std.mem.Allocator,75    scratch: std.mem.Allocator,76    limits: smg.Limits,77) !GraphConcepts {78    const root = try storage.requireRoot(allocator);79    try noteGraphAge(allocator, root);80    var opened = try storage.store.openRead(scratch, root, limits.storage);81    defer opened.close();82    var graph = try storage.graph.loadFromReader(allocator, scratch, &opened.reader);83    errdefer graph_mod.deinit(&graph);84    return .{85        .root = root,86        .graph = graph,87        .concepts = try concepts.loadFromReader(allocator, &opened.reader),88    };89}9091pub fn loadReadGraphAndConcepts(92    allocator: std.mem.Allocator,93    scratch: std.mem.Allocator,94    limits: smg.Limits,95    boundary: PhaseBoundary,96) !GraphConcepts {97    const loaded = try loadGraphAndConcepts(allocator, scratch, limits);98    boundary.seal();99    return loaded;100}101102const graph_age_note_ns: i128 = 60 * 60 * std.time.ns_per_s;103104pub fn noteGraphAge(allocator: std.mem.Allocator, root: []const u8) !void {105    var newest: ?i128 = null;106    for ([_][]const u8{ storage.paths.wal_file_name, storage.paths.database_file_name }) |file_name| {107        const path = try std.fs.path.join(allocator, &.{ root, storage.paths.smg_dir_name, file_name });108        defer allocator.free(path);109        const stat = sys.fs.statFile(path) catch continue;110        if (newest == null or stat.mtime.nanoseconds > newest.?) newest = stat.mtime.nanoseconds;111    }112    const mtime = newest orelse return;113    const age_ns = sys.time.realNanoTimestamp() - mtime;114    if (age_ns < graph_age_note_ns) return;115    const age_text = try humanAge(allocator, age_ns);116    defer allocator.free(age_text);117    try output.writeErrFmt(allocator, "note: graph last scanned {s} ago; run smg scan to refresh\n", .{age_text});118}119120fn humanAge(allocator: std.mem.Allocator, age_ns: i128) ![]u8 {121    const seconds: i64 = @intCast(@divTrunc(age_ns, std.time.ns_per_s));122    if (seconds >= 2 * 24 * 60 * 60) return try std.fmt.allocPrint(allocator, "{d}d", .{@divTrunc(seconds, 24 * 60 * 60)});123    if (seconds >= 60 * 60) return try std.fmt.allocPrint(allocator, "{d}h", .{@divTrunc(seconds, 60 * 60)});124    if (seconds >= 60) return try std.fmt.allocPrint(allocator, "{d}m", .{@divTrunc(seconds, 60)});125    return try std.fmt.allocPrint(allocator, "{d}s", .{@max(seconds, 0)});126}127128test "humanAge reports days hours and minutes" {129    const day = try humanAge(std.testing.allocator, 3 * 24 * 60 * 60 * std.time.ns_per_s);130    defer std.testing.allocator.free(day);131    try std.testing.expectEqualStrings("3d", day);132    const hour = try humanAge(std.testing.allocator, 5 * 60 * 60 * std.time.ns_per_s);133    defer std.testing.allocator.free(hour);134    try std.testing.expectEqualStrings("5h", hour);135    const minute = try humanAge(std.testing.allocator, 7 * 60 * std.time.ns_per_s);136    defer std.testing.allocator.free(minute);137    try std.testing.expectEqualStrings("7m", minute);138}139140test "graph publication releases persistence scratch and preserves search row order" {141    var arena = std.heap.ArenaAllocator.init(std.testing.allocator);142    defer arena.deinit();143    const allocator = arena.allocator();144    const root = try std.fmt.allocPrint(allocator, "/tmp/smg-main-search-rowids-{x}", .{@as(u64, @intCast(@max(0, sys.time.realMilliTimestamp())))});145    defer sys.fs.deleteTree(root) catch {};146    try sys.fs.createDirPath(root);147    _ = try storage.initProject(allocator, root, smg.default_limits.storage);148    const snapshot = try storage.graph.loadSnapshot(149        allocator,150        allocator,151        root,152        smg.default_limits.storage,153    );154    var graph = graph_mod.init(allocator);155    try graph_mod.addNode(&graph, .{ .name = "smg.cli.helpers._truncate", .type = model.NodeType.function, .file = "src/smg/cli/_helpers.py", .line = 42, .docstring = "Trim a string to width with an ellipsis" });156    try graph_mod.addNode(&graph, .{ .name = "smg.graph.SemGraph", .type = model.NodeType.class, .file = "src/smg/graph.py", .line = 10, .docstring = "Core semantic graph data structure" });157    try graph_mod.addNode(&graph, .{ .name = "smg.graph.SemGraph.truncate_path", .type = model.NodeType.method, .file = "src/smg/graph.py", .line = 412, .docstring = "Drop path components after max depth" });158    try graph_mod.addNode(&graph, .{ .name = "smg.scan.scan_paths", .type = model.NodeType.function, .file = "src/smg/scan.py", .line = 100, .docstring = "Scan source files and populate graph" });159    try graph_mod.addNode(&graph, .{ .name = "smg.cli.helpers.format_output", .type = model.NodeType.function, .file = "src/smg/cli/_helpers.py", .line = 80, .docstring = "Format output for display" });160    try storage.graph.publish(161        std.testing.allocator,162        root,163        graph,164        snapshot.head,165        smg.default_limits,166    );167    const result = try testSearchStored(allocator, root, "truncate", null, 10);168    try std.testing.expectEqual(@as(i64, 2), result.total);169    try std.testing.expectEqual(@as(usize, 2), result.hits.len);170    try std.testing.expectEqualStrings("smg.cli.helpers._truncate", result.hits[0].name);171    try std.testing.expectEqualStrings("smg.graph.SemGraph.truncate_path", result.hits[1].name);172    const near_path = try testSearchStored(allocator, root, "NEAR(truncate path, 5)", null, 10);173    try std.testing.expectEqual(@as(i64, 1), near_path.total);174    try std.testing.expectEqualStrings("smg.graph.SemGraph.truncate_path", near_path.hits[0].name);175    const near_helpers = try testSearchStored(allocator, root, "NEAR(truncate helpers, 5)", null, 10);176    try std.testing.expectEqual(@as(i64, 1), near_helpers.total);177    try std.testing.expectEqualStrings("smg.cli.helpers._truncate", near_helpers.hits[0].name);178    const bare_near = try testSearchStored(allocator, root, "NEAR", null, 10);179    try std.testing.expectEqual(@as(i64, 0), bare_near.total);180    try std.testing.expectError(search.Error.InvalidSearchQuery, testSearchStored(allocator, root, "NEAR(truncate path, bad)", null, 10));181    const cross_field_phrase = try testSearchStored(allocator, root, "\"path Drop\"", null, 10);182    try std.testing.expectEqual(@as(i64, 0), cross_field_phrase.total);183    const cross_field_near = try testSearchStored(allocator, root, "NEAR(truncate max, 10)", null, 10);184    try std.testing.expectEqual(@as(i64, 0), cross_field_near.total);185    const cross_field_and = try testSearchStored(allocator, root, "truncate AND max", null, 10);186    try std.testing.expectEqual(@as(i64, 1), cross_field_and.total);187    try std.testing.expectEqualStrings("smg.graph.SemGraph.truncate_path", cross_field_and.hits[0].name);188    const name_filter = try testSearchStored(allocator, root, "name_tokens:truncate", null, 10);189    try std.testing.expectEqual(@as(i64, 2), name_filter.total);190    try std.testing.expectEqualStrings("smg.cli.helpers._truncate", name_filter.hits[0].name);191    try std.testing.expectEqualStrings("smg.graph.SemGraph.truncate_path", name_filter.hits[1].name);192    const doc_filter = try testSearchStored(allocator, root, "docstring:max", null, 10);193    try std.testing.expectEqual(@as(i64, 1), doc_filter.total);194    try std.testing.expectEqualStrings("smg.graph.SemGraph.truncate_path", doc_filter.hits[0].name);195    const left_group = try testSearchStored(allocator, root, "(truncate OR output) AND format", null, 10);196    try std.testing.expectEqual(@as(i64, 1), left_group.total);197    try std.testing.expectEqualStrings("smg.cli.helpers.format_output", left_group.hits[0].name);198    const right_group = try testSearchStored(allocator, root, "truncate AND (path OR helpers)", null, 10);199    try std.testing.expectEqual(@as(i64, 2), right_group.total);200    try std.testing.expectEqualStrings("smg.graph.SemGraph.truncate_path", right_group.hits[0].name);201    try std.testing.expectEqualStrings("smg.cli.helpers._truncate", right_group.hits[1].name);202}203204fn testSearchStored(205    allocator: std.mem.Allocator,206    root: []const u8,207    query: []const u8,208    kind: ?[]const u8,209    limit: i64,210) !search.Result {211    return try search.searchStored(212        allocator,213        root,214        query,215        kind,216        limit,217        smg.default_limits.storage,218    );219}