import { expect, it } from "vitest"; import { buildJavaScriptSemanticGraph } from "./JavaScriptSemanticGraphBuilder.js"; import type { JavaScriptArtifactAnalysis } from "./JavaScriptArtifactAnalysisTypes.js"; import type { JavaScriptArtifactFile } from "./JavaScriptArtifactFiles.js"; import { queryJavaScriptSemanticGraph } from "../domain/javascriptSemanticQuery.js"; import { analyzeJavaScriptSemantics } from "../domain/javascriptSemanticAnalysis.js"; const SHA256 = "a".repeat(64); const GRAPH_ID = `jag_${"b".repeat(64)}`; it("projects closure and direct interprocedural flow without execution", () => { const graph = graphFor(` const outer = 2; function add(value) { return value + outer; } const input = 40; const answer = add(input); `); const relations = new Set(graph.relations.map(({ relation }) => relation)); for (const expected of [ "argument-to-parameter", "calls", "captures", "defines", "reads", "returns-to-call", ] as const) expect(relations.has(expected)).toBe(true); expect(graph.limitations).toContain( "The semantic graph contains static syntax observations and conservative relationship candidates; it does not claim runtime execution.", ); const parameter = graph.nodes.find( ({ kind, label }) => kind === "parameter" && label === "value", ); if (parameter === undefined) throw new Error("Expected parameter node"); const provenance = queryJavaScriptSemanticGraph(graph, { seed: { kind: "semantic-node", node_id: parameter.node_id }, direction: "backward-provenance", include_ambiguous_dynamic_edges: true, }); expect(provenance.relations.map(({ relation }) => relation)).toEqual( expect.arrayContaining([ "aliases", "argument-to-parameter", "defines", "reads", ]), ); }); it("keeps dynamic calls explicit and returns complete deterministic results", () => { const graph = graphFor(` const handlers = { ready() { return 1; } }; const key = process.argv[2]; handlers[key](); `); expect(graph.unknowns.some(({ reason }) => reason === "dynamic-call")).toBe( true, ); const seedNodeId = graph.relations.find( ({ relation }) => relation === "defines", )?.source_node_id; expect(seedNodeId).toBeDefined(); if (seedNodeId === undefined) throw new Error("Expected a definition seed"); const first = queryJavaScriptSemanticGraph(graph, { seed: { kind: "semantic-node", node_id: seedNodeId }, direction: "forward-influence", include_ambiguous_dynamic_edges: true, }); const repeated = queryJavaScriptSemanticGraph(graph, { seed: { kind: "semantic-node", node_id: seedNodeId }, direction: "forward-influence", include_ambiguous_dynamic_edges: true, }); expect(repeated).toEqual(first); }); it("keeps ambiguous interprocedural flow out of the default traversal", () => { const graph = graphFor(` function left(value) { return value; } function right(value) { return value; } const input = 1; const selected = Math.random() ? left : right; selected(input); `); const input = graph.nodes.find( ({ kind, label }) => kind === "binding" && label === "input", ); if (input === undefined) throw new Error("Expected input binding"); const query = { seed: { kind: "semantic-node" as const, node_id: input.node_id }, direction: "forward-influence" as const, allowed_relations: [ "reads" as const, "aliases" as const, "argument-to-parameter" as const, ], }; const strict = queryJavaScriptSemanticGraph(graph, query); expect( strict.relations.some( ({ relation }) => relation === "argument-to-parameter", ), ).toBe(false); expect(strict.status).toBe("ambiguous"); const admitted = queryJavaScriptSemanticGraph(graph, { ...query, include_ambiguous_dynamic_edges: true, }); expect( admitted.relations.filter( ({ relation }) => relation === "argument-to-parameter", ), ).toHaveLength(2); expect(admitted.status).toBe("ambiguous"); }); it("connects caller results, direct returns, parameters, and captures", () => { const graph = graphFor(` const outer = 2; function identity(value) { return value; } function readOuter() { return outer; } const input = 40; const output = identity(input); `); const binding = (label: string) => graph.nodes.find( ({ kind, label: nodeLabel }) => ["binding", "parameter"].includes(kind) && nodeLabel === label, ); const output = binding("output"); const input = binding("input"); const outer = binding("outer"); const readOuter = graph.nodes.find( ({ kind, label }) => kind === "function" && label === "readOuter", ); if ( output === undefined || input === undefined || outer === undefined || readOuter === undefined ) throw new Error("Expected semantic flow nodes"); const provenance = queryJavaScriptSemanticGraph(graph, { seed: { kind: "semantic-node", node_id: output.node_id }, direction: "backward-provenance", }); expect(provenance.nodes.map(({ node_id }) => node_id)).toContain( input.node_id, ); const influence = queryJavaScriptSemanticGraph(graph, { seed: { kind: "semantic-node", node_id: outer.node_id }, direction: "forward-influence", allowed_relations: ["captures"], }); expect(influence.nodes.map(({ node_id }) => node_id)).toContain( readOuter.node_id, ); const capture = graph.relations.find( ({ relation }) => relation === "captures", ); expect(capture?.evidence.location).toMatchObject({ available: true, value: { kind: "source-range", source: "app.js" }, }); expect(capture?.evidence.location).not.toEqual(readOuter.evidence.location); }); it("reports complete graph coverage for deeply nested static values", () => { const nesting = 40; const nestedValue = Array.from({ length: nesting }, () => "{ next: ").join("") + '"value"' + " }".repeat(nesting); const graph = graphFor(`const nested = ${nestedValue};`); expect(graph.coverage).toMatchObject({ truncated: false, omitted_nodes: 0, omitted_relations: 0, limits: [], }); }); it("projects bounded Promise ownership and unresolved sources", () => { const graph = graphFor(` async function run(value) { const owned = new Promise((resolve) => resolve(value)); await Promise.resolve(owned); Promise.resolve(value).then(work).finally(cleanup); value.then(work); return Promise.all([owned, Promise.resolve(value)]); } `); const relations = new Set(graph.relations.map(({ relation }) => relation)); for (const expected of [ "aggregates", "awaits", "chains", "creates-promise", "detaches-task", "owns", "returns-task", ] as const) expect(relations.has(expected)).toBe(true); expect(graph.nodes.filter(({ kind }) => kind === "promise")).not.toHaveLength( 0, ); expect( graph.nodes.find( ({ kind, properties }) => kind === "promise" && properties.method === "all" && properties.ownership === "returned", ), ).toBeDefined(); expect( graph.unknowns.some( ({ family, reason }) => family === "promise-ownership" && reason === "ambiguous-target", ), ).toBe(true); expect( graph.coverage.families.find( ({ family }) => family === "promise-ownership", ), ).toMatchObject({ status: "partial" }); }); it("keeps duplicate function fingerprints ambiguous", () => { const graph = graphFor(` function first(value) { return value + 1; } function second(input) { return input + 1; } `); expect(graph.fingerprints).toHaveLength(2); const digest = graph.fingerprints[0]?.fingerprint_sha256; expect(digest).toBeDefined(); expect(graph.fingerprints[1]?.fingerprint_sha256).toBe(digest); if (digest === undefined) throw new Error("Expected fingerprint"); const query = queryJavaScriptSemanticGraph(graph, { seed: { kind: "function", fingerprint_sha256: digest }, direction: "forward-influence", }); expect(query.status).toBe("ambiguous"); expect(query.summary.total_seed_matches).toBe(2); }); const graphFor = (source: string) => { const file: JavaScriptArtifactFile = { path: "app.js", container_sha256: SHA256, sha256: SHA256, bytes: Buffer.byteLength(source), inventory_artifact_id: `art_${SHA256}`, kind: "javascript", unpacked: false, text: { included: true, value: source }, }; const analysis: JavaScriptArtifactAnalysis = { files: [ { file, javascript: null, semantic: { ir: analyzeJavaScriptSemantics(source), }, }, ], packages: [], json_modules: [], html_scripts: [], source_maps: [], visited_ast_nodes: 0, findings: 0, modules: 0, parse_failures: 0, truncated_scopes: 0, limitations: [], }; return buildJavaScriptSemanticGraph({ rootArtifactSha256: SHA256, applicationGraph: { graph_id: GRAPH_ID, nodes: [] }, analysis, }); };