mirror of
https://github.com/abhigyanpatwari/GitNexus.git
synced 2026-09-21 00:21:30 +00:00
* feat(pdg): add CDG + POST_DOMINATE edge types (M5 #2085) * feat(pdg): post-dominator tree on reverse CFG (M5 #2085) * feat(pdg): Ferrante control-dependence over the post-dom tree (M5 #2085) * feat(pdg): emitFileCdg + optional POST_DOMINATE debug edges (M5 #2085) * feat(pdg): wire CDG emission in-phase + pdgModeMismatch CDG-cap stamp (M5 #2085) * test(pdg): CDG snapshot + end-to-end pipeline answerability (M5 #2085) * fix(review): apply autofix feedback (M5 #2085) * fix(pdg): label CDG edges by controller arm sense, not edge kind (#2188 F1/F2/F4) Tri-review (with Codex as the independent engine) found the CDG 'T'/'F' label was wrong for the commonest control flow: the M1 TS visitor wires a condition's fall-through FALSE arm as `seq`/`loop-back`, but `branchSense` mapped both to 'T', so guard clauses, if-no-else, and loop `break` got 'T' instead of 'F' (F1, P1). The structural CDG edges were correct; only the label — the AC3 "under what condition does X run?" answer — was wrong. - F1: replace edge-kind `branchSense` with controller-arm-sense `labelFor`. An ambiguous fall-through edge (seq/loop-back) takes the COMPLEMENT of its source block's explicit cond-true/cond-false sibling arm. This correctly handles do/while (loop-back = TRUE arm) and inner-if-in-loop (loop-back = FALSE arm) — the ambiguity a kind→label table cannot resolve. Adds real-parser regression tests (the hand-built tests used a fictional cond-false edge and missed it). - F2: correct the false "sound over-approximation that never drops a real dependence" claim in post-dominators.ts — exit-unreachable regions both drop and invent control dependences (latent for the current TS visitor, which keeps EXIT reverse-reachable). Reframe the exit-less-loop test to characterize, not bless, the degenerate behavior. - F4: make the AC2 property-test reference compute post-dominance INDEPENDENTLY (node-removal reachability, no shared code with post-dominators.ts), so a post-dom direction bug can no longer pass both the impl and the reference. Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com> * fix(ci): root-prettier format + run-analyze pdg stamp gains maxCdgEdgesPerFunction (#2085) Two deterministic CI failures from the M5 CDG work: - quality/format: basicblock-roundtrip.test.ts failed CI's root `prettier --check .` (the pre-commit hook uses the gitnexus-local prettier config, which differs); reformatted with the root config. - tests/ubuntu/coverage: run-analyze.test.ts pinned the resolved RepoMeta.pdg shape (DEFAULTS) and the all-zero cap override without the new maxCdgEdgesPerFunction key (default 5000); added it so resolvePdgConfig toEqual and pdgModeMismatch(DEFAULTS) pass. (The stale-test sweep missed this file in PR #2188 — same trap M2 hit.) Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com> * feat(mcp): add pdg_query tool definition (controls/flows modes) [M6 #2086] * feat(mcp): pdg_query backend — controls (CDG) + flows (REACHING_DEF) + e2e test [M6 #2086] * feat(mcp): document PDG edges + pdg_query (schema, cypher, skill, --pdg-gated ai-context) [M6 #2086] * fix(mcp): correct pdg_query symbol-anchor lower bound + harden inputs [PR #2188 review] Tri-review (Codex + adversarial + correctness lanes) of the M6 pdg_query surface found the symbol-anchor window over-includes a neighbor function's block. The upper bound was widened to the 1-based BasicBlock basis (symEnd+1) but the lower bound was left 0-based, so a block on the line directly above the target function leaked into the result. Shift both bounds +1 ([symStart+1, symEnd+1]) so the window is the function's true block span. Also from the same review: - pdg_query no longer throws on a no-arguments MCP call: the dispatch passes raw `params`, so default it to {} → a clean mode-validation error instead of a TypeError. (`explain` shares this latent pattern — pre-existing follow-up.) - tools.ts: the controls-mode description no longer hard-codes the 'F' branch sense for guards — `if (!ok) return;` rides the predicate's 'T' arm; the guard:true flag is label-agnostic (regex on the dependent block text). Tests: a hand-seeded adjacency regression (verified failing without the lower-bound +1) + a no-arguments validation test. Skill doc updated to document the two-sided [symStart+1, symEnd+1] window. Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com> * fix(mcp): drop always-true anchor conditional in pdg_query [CodeQL #2188] CodeQL alert 756 flagged `...(anchor ? { anchor } : {})` in _pdgQueryImpl as a useless conditional: `anchor` is unconditionally assigned in both the file-path and symbol branches before the return (the not-found/ambiguous/no-layer paths return earlier), so it is always truthy. Drop `| undefined` from the declaration (TypeScript definite-assignment holds across both branches) and emit `anchor` directly. No runtime change — the `anchor` field was already present on every result. Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com> * test(cli): add hasPdg to the noStats bridge expectation [#2188] The M6 work threaded `hasPdg: options.pdg === true` into the AIContextOptions passed to generateAIContextFiles on the --skills regeneration path, but this test's strict .toEqual expectation predated it (4 keys vs 3 → CI failure). Add `hasPdg: false` (the value on this non---pdg path). The assertion stays strict; the #1477 noStats bridging it guards is unchanged. Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com> * refactor(cli): collapse generateGitNexusContent params to an options bag [#2188] The function had grown to 9 positional params; reaching `hasPdg` meant passing six `undefined`s (the M6 review's maintainability flag). Collapse params 3-9 (generatedSkills, groupNames, noStats, skipSkills, runnerPath, defaultBranch, hasPdg) into a `GitNexusContentOptions` object with the defaults moved to destructuring. The body is unchanged (same local names); the single production caller and the test calls become self-documenting named fields. Pure refactor — generated AGENTS.md/CLAUDE.md content is byte-identical. Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com> * fix(cfg): skip CDG for exit-unreachable CFGs (unsound post-dominance) [#2188] M5 review P2: computePostDominators roots only at cfg.exitIndex and nothing enforced that EXIT is reachable from every block. For an entry-reachable region that cannot reach EXIT (a non-terminating loop, or a multi-terminal CFG a future visitor might emit) the EXIT-rooted reverse walk degenerates — it both drops real control dependences and invents spurious ones. Add a pure precondition predicate `isExitReachableFromAllBlocks` (co-located with the algorithm it guards) and gate it in emitFileCdg: a CFG that violates it is skipped for CDG (counted as skippedUnsoundFunctions + one onWarn), while its CFG and REACHING_DEF projections — which do not depend on post-dominance — are kept. A CDG-specific gate, not a widening of isEmitSafeCfg, so the blast radius is exactly the unsound CDG. The current TS visitor always satisfies the precondition (every loop gets a structural header→loopExit edge), so CDG output for real fixtures is unchanged. Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com> * fix(cfg): bound computeControlDependence materialization (heap parity) [#2188] M5 review P2: unlike computeReachingDefs (maxFacts) and the emit-side edge cap, computeControlDependence materialized the full deduped seen/out before emitFileCdg's per-function cap could trim it — O(edges × post-dom depth) heap for a deeply nested function. Add a `maxEdges` ceiling (default 0 = unbounded) returning {edges, truncated}, mirroring computeReachingDefs's {facts, truncated}. The ceiling is checked before pushing a new unique edge, so `truncated` means a genuine overflow (not merely "reached cap"). emitFileCdg passes a FIXED materialization ceiling (8× the default edge cap) — deliberately NOT derived from the runtime edge cap, because CDG's materialization IS the deduped-edge quantity the cap reports on (deriving it would pre-truncate that set and lose the exact dropped count). A ceiling hit is surfaced via onWarn + the truncated flag — never silent. Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com> * refactor(mcp): share resolveBlockAnchor; fix explain's anchor off-by-one [#2188] M6 review P2 (duplication) + the flagged pre-existing _explainImpl correctness follow-up. _pdgQueryImpl and _explainImpl each carried a near-identical symbol↔block anchor resolver that had DRIFTED: pdg_query used the corrected [symStart+1, symEnd+1] window (BasicBlock startLine is 1-based, the symbol span 0-based) while _explainImpl still used [symStart, symEnd] — dropping a taint source on the function's final line AND leaking a neighbor's block on the line directly above. Extract one `resolveBlockAnchor` helper, used by both, that applies the correct window and a single (bare) clause convention (callers compose their own WHERE). This removes ~50 duplicated lines and fixes explain's anchor in one place. A hand-seeded characterization test (taint-explain Block 4) pins both bounds — verified to FAIL on the pre-fix window (it returned the line-10 neighbor instead of the line-15 final-line source). Existing taint-explain + pdg-query suites are unchanged (their fixtures have interior sources/sinks). Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com> * fix(mcp): pdg_query reports "status unknown" when the layer can't be confirmed [#2188] M6 review P3 (Codex): when meta is UNREADABLE and the bounded global existence probe returns zero rows of the edge type, _pdgQueryImpl asserted "no PDG layer" — but a genuinely edge-free layer (all-linear functions) is indistinguishable from a missing one via that probe. Soften only that fallback path to an inconclusive "PDG layer status unknown — was this repo indexed with --pdg?" note. The meta-stamped path (stamp present, cap absent ⇒ layer truly missing) keeps the definitive "no PDG layer" wording. Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com> * test(mcp): cover pdg_query ambiguous / pagination / Windows-path gaps [#2188] M6 review test-gap follow-ups, all hand-seeded with controlled data: - ambiguous symbol name → status:'ambiguous' + ranked candidates shape (uid/name/filePath/score), never a silent guess; - total/truncated page boundary in both directions (limit below the match count sets truncated with the full total; limit above it omits truncated); - a Windows-style filePath containing ':' resolves and fnLineOf decodes the function-line segment correctly (split-from-right past the drive letter). Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com> * docs(skills): ship gitnexus-pdg-query skill mirrors + add pdg_query to the guide [#2086] M6 bundled pdg_query into this PR, but the skill shipped only in the canonical gitnexus/skills/ root. Mirror it (byte-identical) to the two hand-maintained roots the sibling taint skill uses — .claude/skills/gitnexus/ and the plugin — so Claude Code + plugin users get it too. Also extend the gitnexus-guide tool reference (all 3 copies, now byte-identical): add a `pdg_query` row + a "Control & data dependence" section mirroring the taint/`explain` section, and reconcile the pre-existing drift where only the .claude copy carried the `check` tool row (a real registered tool) — all three now list it. Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com> * docs(architecture): refresh CFG/PDG section for the full M1–M6 stack [#2086] The PR body had deferred the "ARCHITECTURE docs refresh" to #2086; now that M6 ships here, do it: - MCP tools table gains `explain` and `pdg_query` (were absent). - "Optional CFG/PDG emission" was M1-only; rewrite to cover the whole opt-in stack — M1 CFG, M2 REACHING_DEF, M3/M4 taint, M5 CDG (Ferrante over CHK post-dominators, with the exit-unreachable skip), M6 read surface (pdg_query + explain, anchored + LIMIT-bounded, shared resolveBlockAnchor) — and note the no-Function→BasicBlock-edge join. - LadybugDB schema notes the `--pdg` additions: the `BasicBlock` node table and the CFG/REACHING_DEF/CDG/TAINTED/SANITIZES/TAINT_PATH relation types, kept out of the default VALID_RELATION_TYPES / web schema. Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com> --------- Co-authored-by: Claude Opus 4.8 (1M context) <noreply@anthropic.com>
266 lines
8.5 KiB
TypeScript
266 lines
8.5 KiB
TypeScript
import { describe, it, expect } from 'vitest';
|
|
import {
|
|
NODE_TABLES,
|
|
REL_TABLE_NAME,
|
|
REL_TYPES,
|
|
EMBEDDING_TABLE_NAME,
|
|
NODE_SCHEMA_QUERIES,
|
|
REL_SCHEMA_QUERIES,
|
|
SCHEMA_QUERIES,
|
|
FILE_SCHEMA,
|
|
FOLDER_SCHEMA,
|
|
FUNCTION_SCHEMA,
|
|
CLASS_SCHEMA,
|
|
INTERFACE_SCHEMA,
|
|
METHOD_SCHEMA,
|
|
PROPERTY_SCHEMA,
|
|
CODE_ELEMENT_SCHEMA,
|
|
COMMUNITY_SCHEMA,
|
|
PROCESS_SCHEMA,
|
|
BASICBLOCK_SCHEMA,
|
|
RELATION_SCHEMA,
|
|
EMBEDDING_SCHEMA,
|
|
CREATE_VECTOR_INDEX_QUERY,
|
|
} from '../../src/core/lbug/schema.js';
|
|
|
|
describe('LadybugDB Schema', () => {
|
|
describe('NODE_TABLES', () => {
|
|
it('includes all core node types', () => {
|
|
const core = [
|
|
'File',
|
|
'Folder',
|
|
'Function',
|
|
'Class',
|
|
'Interface',
|
|
'Method',
|
|
'CodeElement',
|
|
'Community',
|
|
'Process',
|
|
];
|
|
for (const t of core) {
|
|
expect(NODE_TABLES).toContain(t);
|
|
}
|
|
});
|
|
|
|
it('includes multi-language node types', () => {
|
|
const multiLang = [
|
|
'Struct',
|
|
'Enum',
|
|
'Macro',
|
|
'Typedef',
|
|
'Union',
|
|
'Namespace',
|
|
'Trait',
|
|
'Impl',
|
|
'TypeAlias',
|
|
'Const',
|
|
'Static',
|
|
'Variable',
|
|
'Property',
|
|
'Record',
|
|
'Delegate',
|
|
'Annotation',
|
|
'Constructor',
|
|
'Template',
|
|
'Module',
|
|
];
|
|
for (const t of multiLang) {
|
|
expect(NODE_TABLES).toContain(t);
|
|
}
|
|
});
|
|
|
|
it('includes the BasicBlock taint/PDG substrate node (issue #2080)', () => {
|
|
expect(NODE_TABLES).toContain('BasicBlock');
|
|
});
|
|
|
|
it('has expected total count', () => {
|
|
// 9 core + 19 multi-language + Route + Tool + BasicBlock = 32
|
|
expect(NODE_TABLES).toHaveLength(32);
|
|
});
|
|
});
|
|
|
|
describe('REL_TYPES', () => {
|
|
it('includes all expected relationship types', () => {
|
|
const expected = [
|
|
'CONTAINS',
|
|
'DEFINES',
|
|
'IMPORTS',
|
|
'CALLS',
|
|
'EXTENDS',
|
|
'IMPLEMENTS',
|
|
'MEMBER_OF',
|
|
'STEP_IN_PROCESS',
|
|
];
|
|
for (const t of expected) {
|
|
expect(REL_TYPES).toContain(t);
|
|
}
|
|
});
|
|
|
|
it('includes the taint/PDG substrate edge types (issue #2080)', () => {
|
|
for (const t of ['CFG', 'REACHING_DEF', 'TAINTED', 'SANITIZES', 'TAINT_PATH']) {
|
|
expect(REL_TYPES).toContain(t);
|
|
}
|
|
});
|
|
|
|
it('includes the control-dependence edge types (issue #2085 M5)', () => {
|
|
for (const t of ['CDG', 'POST_DOMINATE']) {
|
|
expect(REL_TYPES).toContain(t);
|
|
}
|
|
});
|
|
});
|
|
|
|
describe('node schema DDL', () => {
|
|
it.each([
|
|
['FILE_SCHEMA', FILE_SCHEMA, 'File'],
|
|
['FOLDER_SCHEMA', FOLDER_SCHEMA, 'Folder'],
|
|
['FUNCTION_SCHEMA', FUNCTION_SCHEMA, 'Function'],
|
|
['CLASS_SCHEMA', CLASS_SCHEMA, 'Class'],
|
|
['INTERFACE_SCHEMA', INTERFACE_SCHEMA, 'Interface'],
|
|
['METHOD_SCHEMA', METHOD_SCHEMA, 'Method'],
|
|
['CODE_ELEMENT_SCHEMA', CODE_ELEMENT_SCHEMA, 'CodeElement'],
|
|
['COMMUNITY_SCHEMA', COMMUNITY_SCHEMA, 'Community'],
|
|
['PROCESS_SCHEMA', PROCESS_SCHEMA, 'Process'],
|
|
])('%s contains CREATE NODE TABLE for %s', (_, schema, tableName) => {
|
|
expect(schema).toContain('CREATE NODE TABLE');
|
|
expect(schema).toContain(tableName);
|
|
expect(schema).toContain('PRIMARY KEY');
|
|
});
|
|
|
|
it('Function schema has startLine and endLine', () => {
|
|
expect(FUNCTION_SCHEMA).toContain('startLine INT64');
|
|
expect(FUNCTION_SCHEMA).toContain('endLine INT64');
|
|
});
|
|
|
|
it('Function schema has isExported', () => {
|
|
expect(FUNCTION_SCHEMA).toContain('isExported BOOLEAN');
|
|
});
|
|
|
|
it('Property schema preserves declaredType', () => {
|
|
expect(SCHEMA_QUERIES).toContain(PROPERTY_SCHEMA);
|
|
expect(PROPERTY_SCHEMA).toContain('declaredType STRING');
|
|
});
|
|
|
|
it('BasicBlock schema is wired into SCHEMA_QUERIES (issue #2080, F1 guard)', () => {
|
|
// Defining BASICBLOCK_SCHEMA is not enough — it must be appended to
|
|
// NODE_SCHEMA_QUERIES (→ SCHEMA_QUERIES) or initLbug never creates the
|
|
// table and the bulk-COPY round-trip fails with "table does not exist".
|
|
expect(SCHEMA_QUERIES).toContain(BASICBLOCK_SCHEMA);
|
|
expect(BASICBLOCK_SCHEMA).toContain('CREATE NODE TABLE BasicBlock');
|
|
expect(BASICBLOCK_SCHEMA).toContain('filePath STRING');
|
|
expect(BASICBLOCK_SCHEMA).toContain('startLine INT64');
|
|
expect(BASICBLOCK_SCHEMA).toContain('endLine INT64');
|
|
expect(BASICBLOCK_SCHEMA).toContain('text STRING');
|
|
expect(BASICBLOCK_SCHEMA).toContain('PRIMARY KEY (id)');
|
|
});
|
|
|
|
it('Community schema has heuristicLabel and cohesion', () => {
|
|
expect(COMMUNITY_SCHEMA).toContain('heuristicLabel STRING');
|
|
expect(COMMUNITY_SCHEMA).toContain('cohesion DOUBLE');
|
|
});
|
|
|
|
it('Process schema has processType and stepCount', () => {
|
|
expect(PROCESS_SCHEMA).toContain('processType STRING');
|
|
expect(PROCESS_SCHEMA).toContain('stepCount INT32');
|
|
});
|
|
});
|
|
|
|
describe('relation schema', () => {
|
|
it('creates a single REL TABLE named CodeRelation', () => {
|
|
expect(RELATION_SCHEMA).toContain(`CREATE REL TABLE ${REL_TABLE_NAME}`);
|
|
});
|
|
|
|
it('has type, confidence, reason, step properties', () => {
|
|
expect(RELATION_SCHEMA).toContain('type STRING');
|
|
expect(RELATION_SCHEMA).toContain('confidence DOUBLE');
|
|
expect(RELATION_SCHEMA).toContain('reason STRING');
|
|
expect(RELATION_SCHEMA).toContain('step INT32');
|
|
});
|
|
|
|
it('connects Function to Function (CALLS)', () => {
|
|
expect(RELATION_SCHEMA).toContain('FROM Function TO Function');
|
|
});
|
|
|
|
it('connects File to Function (CONTAINS/DEFINES)', () => {
|
|
expect(RELATION_SCHEMA).toContain('FROM File TO Function');
|
|
});
|
|
|
|
it('connects symbols to Community (MEMBER_OF)', () => {
|
|
expect(RELATION_SCHEMA).toContain('FROM Function TO Community');
|
|
expect(RELATION_SCHEMA).toContain('FROM Class TO Community');
|
|
});
|
|
|
|
it('connects symbols to Process (STEP_IN_PROCESS)', () => {
|
|
expect(RELATION_SCHEMA).toContain('FROM Function TO Process');
|
|
expect(RELATION_SCHEMA).toContain('FROM Method TO Process');
|
|
});
|
|
|
|
it('connects BasicBlock to BasicBlock (taint/PDG substrate edges, #2080)', () => {
|
|
expect(RELATION_SCHEMA).toContain('FROM BasicBlock TO BasicBlock');
|
|
});
|
|
|
|
it('has all FROM/TO pairs needed for HAS_METHOD edges', () => {
|
|
// HAS_METHOD sources: Class, Interface, Struct, Trait, Impl, Record
|
|
// HAS_METHOD targets: Method, Constructor (Property is now HAS_PROPERTY)
|
|
const sources = ['Class', 'Interface'];
|
|
const backtickSources = ['Struct', 'Trait', 'Impl', 'Record'];
|
|
const targets = ['Method'];
|
|
const backtickTargets = ['Constructor'];
|
|
|
|
// Non-backtick source → non-backtick target
|
|
for (const src of sources) {
|
|
for (const tgt of targets) {
|
|
expect(RELATION_SCHEMA).toContain(`FROM ${src} TO ${tgt}`);
|
|
}
|
|
for (const tgt of backtickTargets) {
|
|
expect(RELATION_SCHEMA).toContain(`FROM ${src} TO \`${tgt}\``);
|
|
}
|
|
}
|
|
|
|
// Backtick source → all targets
|
|
for (const src of backtickSources) {
|
|
for (const tgt of targets) {
|
|
expect(RELATION_SCHEMA).toContain(`FROM \`${src}\` TO ${tgt}`);
|
|
}
|
|
for (const tgt of backtickTargets) {
|
|
expect(RELATION_SCHEMA).toContain(`FROM \`${src}\` TO \`${tgt}\``);
|
|
}
|
|
}
|
|
});
|
|
});
|
|
|
|
describe('embedding schema', () => {
|
|
it('creates CodeEmbedding table', () => {
|
|
expect(EMBEDDING_SCHEMA).toContain(`CREATE NODE TABLE ${EMBEDDING_TABLE_NAME}`);
|
|
expect(EMBEDDING_SCHEMA).toContain('embedding FLOAT[384]');
|
|
});
|
|
|
|
it('has vector index query', () => {
|
|
expect(CREATE_VECTOR_INDEX_QUERY).toContain('CREATE_VECTOR_INDEX');
|
|
expect(CREATE_VECTOR_INDEX_QUERY).toContain('cosine');
|
|
});
|
|
});
|
|
|
|
describe('schema query ordering', () => {
|
|
it('NODE_SCHEMA_QUERIES has correct count', () => {
|
|
// 31 + BasicBlock = 32
|
|
expect(NODE_SCHEMA_QUERIES).toHaveLength(32);
|
|
});
|
|
|
|
it('REL_SCHEMA_QUERIES has one relation table', () => {
|
|
expect(REL_SCHEMA_QUERIES).toHaveLength(1);
|
|
});
|
|
|
|
it('SCHEMA_QUERIES includes all node + rel + embedding schemas', () => {
|
|
// 32 node + 1 rel + 1 embedding = 34
|
|
expect(SCHEMA_QUERIES).toHaveLength(34);
|
|
});
|
|
|
|
it('node schemas come before relation schemas in SCHEMA_QUERIES', () => {
|
|
const relIndex = SCHEMA_QUERIES.indexOf(RELATION_SCHEMA);
|
|
const lastNodeIndex = SCHEMA_QUERIES.indexOf(
|
|
NODE_SCHEMA_QUERIES[NODE_SCHEMA_QUERIES.length - 1],
|
|
);
|
|
expect(relIndex).toBeGreaterThan(lastNodeIndex);
|
|
});
|
|
});
|
|
});
|