gitnexus 1.6.8-rc.9 → 1.6.8

package/dist/core/ingestion/cfg/visitors/csharp-harvest.js

@@ -0,0 +1,589 @@
+import { CallSiteFactAccumulator } from './call-site-harvest.js';
+import { ScopeTreeHarvester } from './scope-tree-harvest.js';
+/** Node types that own a nested CFG — their subtrees are opaque to harvesting. */
+const NESTED_FUNCTION_TYPES = new Set([
+    'lambda_expression',
+    'anonymous_method_expression',
+    'local_function_statement',
+    'method_declaration',
+    'constructor_declaration',
+]);
+/**
+ * Nodes that open a lexical scope for block-local declarations. A `block` is one
+ * scope; the loop constructs open a scope for their loop variable; a
+ * `catch_clause` scopes its exception name; a `using_statement` scopes its
+ * resource declaration; a `switch_section` scopes its pattern bindings.
+ */
+const SCOPE_TYPES = new Set([
+    'block',
+    'for_statement',
+    'foreach_statement',
+    'while_statement',
+    'using_statement',
+    'catch_clause',
+    'switch_section',
+    'switch_expression_arm',
+]);
+export class CsharpHarvester extends ScopeTreeHarvester {
+    constructor(fnNode) {
+        super(fnNode);
+        this.declareParams(fnNode);
+        const body = this.bodyOf(fnNode);
+        if (body)
+            this.prescan(body, this.openScope(body));
+    }
+    /** The function/lambda body node (a `block` or an expression for `=> expr`). */
+    bodyOf(fnNode) {
+        const body = fnNode.childForFieldName('body');
+        if (body)
+            return body;
+        // Anonymous method / local function: the body is the first `block` child.
+        return fnNode.namedChildren.find((c) => c.type === 'block');
+    }
+    // ── phase 1: declaration pre-scan ────────────────────────────────────────
+    declareParams(fnNode) {
+        const params = fnNode.childForFieldName('parameters') ??
+            fnNode.namedChildren.find((c) => c.type === 'parameter_list' || c.type === 'implicit_parameter');
+        if (!params)
+            return;
+        if (params.type === 'implicit_parameter') {
+            // Single un-parenthesized lambda parameter: `x => …`.
+            this.declare(params, 'param', this.root);
+            return;
+        }
+        for (let i = 0; i < params.namedChildCount; i++) {
+            const p = params.namedChild(i);
+            if (p?.type !== 'parameter')
+                continue;
+            const name = p.childForFieldName('name');
+            if (name)
+                this.declare(name, 'param', this.root);
+        }
+    }
+    prescan(node, scope) {
+        this.nearestScopeCache.set(node.id, scope);
+        const t = node.type;
+        if (NESTED_FUNCTION_TYPES.has(t) && node.id !== this.fnId) {
+            // A nested function / lambda body is opaque — do not descend.
+            return;
+        }
+        let childScope = scope;
+        if (SCOPE_TYPES.has(t))
+            childScope = this.openScope(node);
+        switch (t) {
+            case 'local_declaration_statement': {
+                const decl = node.namedChildren.find((c) => c.type === 'variable_declaration');
+                if (decl)
+                    this.declareVariableDeclaration(decl, childScope);
+                break;
+            }
+            case 'foreach_statement': {
+                // `foreach (var x in xs)` — the `left` is the loop var (identifier or a
+                // `tuple_pattern` of identifiers); binds in the loop scope.
+                const left = node.childForFieldName('left');
+                if (left)
+                    this.declareForeachTarget(left, childScope);
+                break;
+            }
+            case 'using_statement': {
+                // `using (var f = Open())` — declaration form binds the resource.
+                const decl = node.namedChildren.find((c) => c.type === 'variable_declaration');
+                if (decl)
+                    this.declareVariableDeclaration(decl, childScope);
+                break;
+            }
+            case 'catch_clause': {
+                const declNode = node.namedChildren.find((c) => c.type === 'catch_declaration');
+                const name = declNode?.childForFieldName('name');
+                if (name)
+                    this.declare(name, 'catch', childScope);
+                break;
+            }
+            case 'declaration_pattern': {
+                // `o is string s` / `case int n:` — `s`/`n` is a fresh binding.
+                const name = node.childForFieldName('name');
+                if (name)
+                    this.declare(name, 'var', childScope);
+                break;
+            }
+            case 'declaration_expression': {
+                // `f(out var n)` / `f(out int n)` — `n` is a fresh out-binding written
+                // by the callee; declare it so its def + later uses resolve to a real
+                // local rather than a synthetic module binding.
+                const name = node.childForFieldName('name');
+                if (name)
+                    this.declare(name, 'var', childScope);
+                break;
+            }
+            default:
+                break;
+        }
+        for (let i = 0; i < node.namedChildCount; i++) {
+            const c = node.namedChild(i);
+            if (c)
+                this.prescan(c, childScope);
+        }
+    }
+    /** Declare every `variable_declarator` name in a `variable_declaration`. */
+    declareVariableDeclaration(declNode, scope) {
+        for (let i = 0; i < declNode.namedChildCount; i++) {
+            const d = declNode.namedChild(i);
+            if (d?.type !== 'variable_declarator')
+                continue;
+            const name = d.childForFieldName('name');
+            if (name) {
+                this.declare(name, 'var', scope);
+            }
+            else {
+                // Deconstruction declaration `var (a, b) = …;` — the declarator's name
+                // slot is a `tuple_pattern`; declare each identifier under it (reusing
+                // the foreach tuple-target logic).
+                const tuple = d.namedChildren.find((c) => c.type === 'tuple_pattern');
+                if (tuple)
+                    this.declareForeachTarget(tuple, scope);
+            }
+        }
+    }
+    /** Declare a `foreach` target — an identifier or a `tuple_pattern`. */
+    declareForeachTarget(left, scope) {
+        if (left.type === 'identifier') {
+            this.declare(left, 'var', scope);
+            return;
+        }
+        // `var (k, v)` deconstruction — declare each identifier under the pattern.
+        for (let i = 0; i < left.namedChildCount; i++) {
+            const c = left.namedChild(i);
+            if (c?.type === 'identifier')
+                this.declare(c, 'var', scope);
+        }
+    }
+    // ── phase 2: per-statement fact extraction ───────────────────────────────
+    /** Def/use facts for one statement (or construct-header expression) node. */
+    facts(node) {
+        const acc = new FactAccumulator(node.startPosition.row + 1);
+        this.walkValue(node, acc);
+        return acc.finish();
+    }
+    /** Facts for an expression whose WHOLE evaluation is conditional (case tests). */
+    factsConditional(node) {
+        const acc = new FactAccumulator(node.startPosition.row + 1);
+        this.conditional(() => this.walkValue(node, acc));
+        return acc.finish();
+    }
+    /**
+     * Def-ONLY facts for a value-position binding carrier (`var x = k switch {…}`,
+     * #2207): just the declared name(s)' def, attached to the continuation block the
+     * switch arms rejoin. The discriminant + arm-value USES are already harvested
+     * onto the branch's own blocks ({@link facts} on each arm), so this must NOT
+     * re-walk the initializer — only each `variable_declarator`'s name is a def here.
+     */
+    bindingDefFacts(stmt) {
+        const acc = new FactAccumulator(stmt.startPosition.row + 1);
+        const decl = stmt.namedChildren.find((c) => c.type === 'variable_declaration');
+        if (decl) {
+            for (let i = 0; i < decl.namedChildCount; i++) {
+                const d = decl.namedChild(i);
+                if (d?.type !== 'variable_declarator')
+                    continue;
+                const name = d.childForFieldName('name');
+                if (name)
+                    this.def(name, acc);
+            }
+        }
+        return acc.defCount() ? acc.finish() : undefined;
+    }
+    /** Facts for a `foreach (decl in right)` head: decl binds, right is used. */
+    forEachHeadFacts(stmt) {
+        const acc = new FactAccumulator(stmt.startPosition.row + 1);
+        const left = stmt.childForFieldName('left');
+        const right = stmt.childForFieldName('right');
+        if (left)
+            this.defForeachTarget(left, acc);
+        if (right)
+            this.walkValue(right, acc);
+        return acc.finish();
+    }
+    /** ENTRY-block facts for the function's parameters (defs only). */
+    paramFacts() {
+        const params = this.fnNode.childForFieldName('parameters') ??
+            this.fnNode.namedChildren.find((c) => c.type === 'parameter_list' || c.type === 'implicit_parameter');
+        if (!params)
+            return undefined;
+        const acc = new FactAccumulator(this.fnNode.startPosition.row + 1);
+        if (params.type === 'implicit_parameter') {
+            this.def(params, acc);
+        }
+        else {
+            for (let i = 0; i < params.namedChildCount; i++) {
+                const p = params.namedChild(i);
+                if (p?.type !== 'parameter')
+                    continue;
+                const name = p.childForFieldName('name');
+                if (name)
+                    this.def(name, acc);
+            }
+        }
+        return acc.defCount() ? acc.finish() : undefined;
+    }
+    /** Def fact for a `catch (T e)` declaration — prepend to the handler entry block. */
+    catchParamFacts(catchClause) {
+        const declNode = catchClause.namedChildren.find((c) => c.type === 'catch_declaration');
+        const name = declNode?.childForFieldName('name');
+        if (!name)
+            return undefined;
+        const acc = new FactAccumulator(catchClause.startPosition.row + 1);
+        this.def(name, acc);
+        return acc.defCount() ? acc.finish() : undefined;
+    }
+    /** Strip parenthesized wrappers around an lvalue (`(x) = 1`). */
+    unwrapLvalue(node) {
+        let n = node;
+        let hops = 8;
+        while (n.type === 'parenthesized_expression' && hops-- > 0) {
+            const inner = n.namedChild(0);
+            if (!inner)
+                break;
+            n = inner;
+        }
+        return n;
+    }
+    /** Def a `foreach` target (identifier or tuple) in a header fact accumulator. */
+    defForeachTarget(left, acc) {
+        if (left.type === 'identifier') {
+            this.def(left, acc);
+            return;
+        }
+        for (let i = 0; i < left.namedChildCount; i++) {
+            const c = left.namedChild(i);
+            if (c?.type === 'identifier')
+                this.def(c, acc);
+        }
+    }
+    /** Value-position walk: collect uses; route def positions to the lvalue handler. */
+    walkValue(node, acc) {
+        const t = node.type;
+        if (NESTED_FUNCTION_TYPES.has(t) && node.id !== this.fnId) {
+            // Opaque nested function / lambda — captured reads/writes are invisible.
+            return;
+        }
+        switch (t) {
+            case 'identifier':
+                this.use(node, acc);
+                return;
+            case 'local_declaration_statement':
+            case 'variable_declaration': {
+                const decl = t === 'variable_declaration' ? node : node.namedChild(0);
+                if (decl && decl.type === 'variable_declaration') {
+                    for (let i = 0; i < decl.namedChildCount; i++) {
+                        const d = decl.namedChild(i);
+                        if (d?.type !== 'variable_declarator')
+                            continue;
+                        const name = d.childForFieldName('name');
+                        if (!name) {
+                            // Deconstruction declaration `var (a, b) = e;` — def each
+                            // identifier in the `tuple_pattern`; the initializer is the
+                            // declarator's non-pattern child.
+                            const tuple = d.namedChildren.find((c) => c.type === 'tuple_pattern');
+                            const tupleInit = d.namedChildren.find((c) => c.type !== 'tuple_pattern');
+                            if (tuple) {
+                                const snap = acc.defSnapshot();
+                                this.defTupleTargets(tuple, acc);
+                                if (tupleInit)
+                                    this.registerResultDefs(tupleInit, acc.defsSince(snap));
+                            }
+                            if (tupleInit)
+                                this.walkValue(tupleInit, acc);
+                            continue;
+                        }
+                        // The initializer (if any) is the LAST named child after `name`.
+                        const init = this.declaratorInit(d);
+                        if (name && init) {
+                            const snap = acc.defSnapshot();
+                            this.def(name, acc);
+                            this.registerResultDefs(init, acc.defsSince(snap));
+                        }
+                        if (init)
+                            this.walkValue(init, acc);
+                    }
+                }
+                return;
+            }
+            case 'declaration_expression': {
+                // `out var n` / `out int n` — the callee writes `n` (a must-def: C#
+                // requires an out parameter to be assigned before the method returns).
+                const name = node.childForFieldName('name');
+                if (name)
+                    this.def(name, acc);
+                return;
+            }
+            case 'assignment_expression': {
+                const left = node.childForFieldName('left');
+                const right = node.childForFieldName('right');
+                const op = node.childForFieldName('operator')?.text ?? '=';
+                if (left) {
+                    const lv = this.unwrapLvalue(left);
+                    if (lv.type === 'identifier') {
+                        const snap = acc.defSnapshot();
+                        this.def(lv, acc);
+                        if (op !== '=')
+                            this.use(lv, acc); // compound assign reads too
+                        if (op === '=' && right)
+                            this.registerResultDefs(right, acc.defsSince(snap));
+                    }
+                    else if (lv.type === 'tuple_expression') {
+                        this.defTupleTargets(lv, acc); // `(a, b) = …` deconstruction
+                    }
+                    else {
+                        this.walkValue(lv, acc); // member/element target — uses only
+                    }
+                }
+                if (right)
+                    this.walkValue(right, acc);
+                return;
+            }
+            case 'postfix_unary_expression':
+            case 'prefix_unary_expression': {
+                const arg = node.namedChild(0);
+                const lv = arg ? this.unwrapLvalue(arg) : null;
+                // Only `++`/`--` write; `!x`/`-x`/`~x` are pure reads. The operator is an
+                // anonymous child; treat as a def+use only when the operand is an
+                // identifier AND the op text is an increment/decrement.
+                if (lv?.type === 'identifier' && this.isIncDec(node)) {
+                    this.def(lv, acc);
+                    this.use(lv, acc);
+                }
+                else if (arg) {
+                    this.walkValue(arg, acc);
+                }
+                return;
+            }
+            case 'binary_expression': {
+                const left = node.childForFieldName('left');
+                const right = node.childForFieldName('right');
+                const op = node.childForFieldName('operator')?.text ?? '';
+                if (left)
+                    this.walkValue(left, acc);
+                if (right) {
+                    if (op === '&&' || op === '||' || op === '??') {
+                        this.conditional(() => this.walkValue(right, acc));
+                    }
+                    else {
+                        this.walkValue(right, acc);
+                    }
+                }
+                return;
+            }
+            case 'conditional_expression': {
+                const cond = node.childForFieldName('condition');
+                const cons = node.childForFieldName('consequence');
+                const alt = node.childForFieldName('alternative');
+                if (cond)
+                    this.walkValue(cond, acc);
+                if (cons)
+                    this.conditional(() => this.walkValue(cons, acc));
+                if (alt)
+                    this.conditional(() => this.walkValue(alt, acc));
+                return;
+            }
+            case 'invocation_expression':
+                // #2195 U6: explicit case (previously default-descended) — same uses,
+                // plus a taint-site record. Defs/uses stay byte-identical.
+                this.visitCall(node, acc, 'call');
+                return;
+            case 'object_creation_expression':
+                // `new Foo(x)` — constructor call site (`type` field is the callee).
+                this.visitCall(node, acc, 'new');
+                return;
+            case 'member_access_expression': {
+                // `a.B` — value read of the chain root only; the member name is not a
+                // scalar binding. Mirrors the TS member-read use semantics, plus a
+                // member-read site for the innermost identifier-rooted access.
+                this.walkChain(node, acc, false);
+                return;
+            }
+            default:
+                for (let i = 0; i < node.namedChildCount; i++) {
+                    const c = node.namedChild(i);
+                    if (c)
+                        this.walkValue(c, acc);
+                }
+        }
+    }
+    // ── taint-site harvest (#2195 U6) ────────────────────────────────────────
+    /**
+     * When `value`'s root (after stripping parens) is an invocation/creation
+     * node, remember that its site should carry `resultDefs: defs` — consumed by
+     * {@link visitCall} once the value walk reaches the node.
+     */
+    registerResultDefs(value, defs) {
+        if (defs.length === 0)
+            return;
+        const root = this.unwrapLvalue(value);
+        if (root.type === 'invocation_expression' || root.type === 'object_creation_expression') {
+            this.resultDefTargets.set(root.id, [...defs]);
+        }
+    }
+    /**
+     * Explicit invocation / object-creation handler: records a call site (callee
+     * path, receiver, per-arg occurrence entries, result defs) while reproducing
+     * EXACTLY the uses the old default descent recorded. C# wraps each argument in
+     * an `argument` node; `new Foo(...)` reads the `type` field as the callee.
+     */
+    visitCall(node, acc, kind) {
+        const calleeNode = node.childForFieldName(kind === 'new' ? 'type' : 'function');
+        const argsNode = node.childForFieldName('arguments');
+        // `node` IS the call/object-creation expression — the SAME node the
+        // scope-extractor anchors `@reference.call.*` (its `atRange`) on (KTD7).
+        const siteIdx = acc.openCallSite(kind, [node.startPosition.row + 1, node.startPosition.column]);
+        acc.pushFrame(siteIdx);
+        let calleePath;
+        if (calleeNode) {
+            const callee = this.unwrapLvalue(calleeNode);
+            if (callee.type === 'identifier') {
+                // For a `new Foo(...)`, the `type` is a type name, not a scalar
+                // binding — record neither a use nor an occurrence for it; for a bare
+                // call the callee name is a statement-level use but not an occurrence.
+                if (kind === 'call')
+                    acc.addUseWithoutOccurrence(this.resolve(callee));
+                calleePath = callee.text;
+            }
+            else if (callee.type === 'member_access_expression') {
+                // skipFinalRead: the final access IS the callee, carried by the path.
+                // A static dotted path (`System.Console.WriteLine(...)`) parses as a
+                // member_access_expression chain too, so this one branch covers both
+                // instance and static dotted callees.
+                const chain = this.walkChain(callee, acc, true);
+                calleePath = chain.path;
+                if (chain.rootIdx !== undefined)
+                    acc.setSiteReceiver(siteIdx, chain.rootIdx);
+            }
+            else {
+                this.walkValue(callee, acc);
+            }
+            if (calleePath !== undefined)
+                acc.setSiteCallee(siteIdx, calleePath);
+        }
+        const resultDefs = this.resultDefTargets.get(node.id);
+        if (resultDefs !== undefined)
+            acc.setSiteResultDefs(siteIdx, resultDefs);
+        if (argsNode) {
+            let pos = 0;
+            for (let i = 0; i < argsNode.namedChildCount; i++) {
+                const arg = argsNode.namedChild(i);
+                // C# wraps each value in an `argument` node; the value is the inner
+                // expression (a named argument `name: x` exposes the label through the
+                // `name` field — skip it so `x` is what flows).
+                if (!arg || arg.type === 'comment')
+                    continue;
+                acc.setFrameArg(pos);
+                const value = arg.type === 'argument' ? this.argumentValue(arg) : arg;
+                if (value)
+                    this.walkValue(value, acc);
+                pos++;
+            }
+        }
+        acc.popFrame();
+    }
+    /**
+     * The value expression inside an `argument` node. A named argument
+     * (`name: x`) carries the label on the `name` field and the value as a
+     * sibling; a positional argument is just the value. Returns the last named
+     * child that is not the `name`-field label (and skips `ref`/`out`/`in`
+     * modifier keywords, which are anonymous tokens, not named children).
+     */
+    argumentValue(arg) {
+        const label = arg.childForFieldName('name');
+        for (let i = arg.namedChildCount - 1; i >= 0; i--) {
+            const c = arg.namedChild(i);
+            if (c && c.id !== label?.id)
+                return c;
+        }
+        return undefined;
+    }
+    /**
+     * Member chain walk shared by value position and callee position. Records the
+     * chain-root identifier as a use (identical to the old default descent), plus
+     * at most ONE member-read site — the INNERMOST access — when the root is an
+     * identifier; `skipFinalRead` suppresses it when that access is the callee.
+     */
+    walkChain(node, acc, skipFinalRead) {
+        const accesses = [];
+        let cur = this.unwrapLvalue(node);
+        for (;;) {
+            if (cur.type === 'member_access_expression') {
+                const name = cur.childForFieldName('name');
+                accesses.unshift(name?.text ?? '');
+                const expr = cur.childForFieldName('expression');
+                if (!expr)
+                    break;
+                cur = this.unwrapLvalue(expr);
+            }
+            else {
+                break;
+            }
+        }
+        let rootIdx;
+        let rootSegment;
+        if (cur.type === 'identifier') {
+            rootIdx = this.resolve(cur);
+            acc.addUse(rootIdx);
+            rootSegment = cur.text;
+        }
+        else {
+            this.walkValue(cur, acc);
+        }
+        const innermost = accesses[0];
+        if (rootIdx !== undefined && innermost && !(skipFinalRead && accesses.length === 1)) {
+            acc.addMemberRead(rootIdx, innermost);
+        }
+        const path = rootSegment !== undefined && accesses.every((a) => a !== '')
+            ? [rootSegment, ...accesses].join('.')
+            : undefined;
+        return { path, rootIdx };
+    }
+    /**
+     * The initializer value of a `variable_declarator` — the named child after
+     * `name`. NOTE: deliberately duplicated in `csharp.ts` (the visitor is a
+     * standalone class with no shared base — repo convention). The two copies must
+     * stay in sync; there is no C#-specific shared module to host it, and the only
+     * module both files share is the generic `utils/ast-helpers` (types only).
+     */
+    declaratorInit(declarator) {
+        const name = declarator.childForFieldName('name');
+        for (let i = 0; i < declarator.namedChildCount; i++) {
+            const c = declarator.namedChild(i);
+            if (c && c.id !== name?.id)
+                return c;
+        }
+        return undefined;
+    }
+    /** Whether a unary expression is `++`/`--` (the only writing unary ops). */
+    isIncDec(node) {
+        for (let i = 0; i < node.childCount; i++) {
+            const c = node.child(i);
+            if (c && !c.isNamed && (c.text === '++' || c.text === '--'))
+                return true;
+        }
+        return false;
+    }
+    /** Def each identifier in a `(a, b) = …` tuple deconstruction target. */
+    defTupleTargets(tuple, acc) {
+        for (let i = 0; i < tuple.namedChildCount; i++) {
+            const c = tuple.namedChild(i);
+            if (!c)
+                continue;
+            // tuple_expression wraps each element in an `argument`.
+            const inner = c.type === 'argument' ? c.namedChild(0) : c;
+            if (inner?.type === 'identifier')
+                this.def(inner, acc);
+            else if (inner)
+                this.walkValue(inner, acc);
+        }
+    }
+}
+/**
+ * Ordered, deduplicating def/use + call-site collector for one statement record.
+ * The shared {@link CallSiteFactAccumulator} carries the def/use machinery the
+ * old local class had, plus the taint-site harvest (#2195 U6).
+ */
+const FactAccumulator = CallSiteFactAccumulator;

package/dist/core/ingestion/cfg/visitors/csharp.d.ts

@@ -0,0 +1,87 @@
+/**
+ * C# CfgVisitor (#2195 U3, plan KTD2).
+ *
+ * Walks a C# function's tree-sitter AST and drives the language-agnostic
+ * {@link CfgBuilder} to produce a serializable {@link FunctionCfg}, plus a
+ * def/use harvest ({@link CsharpHarvester}) for the reaching-defs / CDG solvers.
+ * Structured like the TS visitor — a `visit_<node_type>` dispatch over the
+ * statement taxonomy, driving a per-function {@link ControlFlowContext} — because
+ * C# shares TS's `finally` semantics (try/finally AND `using`/`lock`-as-finally),
+ * which the finalizer-frame machinery in `control-flow-context.ts` models.
+ *
+ * Every node type and field literal below was grammar-validated against
+ * tree-sitter-c-sharp via the introspection probe before use (mandatory pre-step,
+ * KTD5). Known C# surprises pre-empted: records are `record_declaration` (NOT
+ * `record_struct_declaration`); there is no `else_clause` wrapper (an
+ * `if_statement`'s `alternative` is the else body / nested `if` directly); switch
+ * cases live in `switch_section`s under a `switch_body`; `variable_declarator`
+ * exposes only a `name` field (the initializer is a positional child);
+ * `finally_clause` / `lock_statement` / `catch_filter_clause` expose no field for
+ * their body/condition (positional children).
+ *
+ * Function nodes: `method_declaration`, `local_function_statement`,
+ * `constructor_declaration`, `lambda_expression`, `anonymous_method_expression`,
+ * and expression-bodied members (`body` is an `arrow_expression_clause`).
+ *
+ * Edge-kind contract (matches the TS visitor — RD/CDG consume these):
+ *  - if/else → `cond-true` / `cond-false`
+ *  - loops (for / foreach / while / do-while) → `cond-true` / `loop-back` /
+ *    `cond-false`
+ *  - switch (`switch_statement`) → `switch-case` / `fallthrough`; a
+ *    `switch_expression` arm dispatches as `switch-case` (each arm a guarded
+ *    branch, no fallthrough)
+ *  - try/catch → `throw` (every protected-region block → the handler); a jump
+ *    crossing a `finally` → `finally-return` / `finally-break` / `finally-continue`
+ *  - `using` / `lock` → modeled like try/finally: the dispose (`using`) runs on
+ *    BOTH normal and exception exit (deterministic), so a `return`/`break`/
+ *    `continue` crossing it gets the `finally-*` completion edge too. `lock`'s
+ *    monitor-release is likewise a deterministic finalizer.
+ *  - return / throw / break / continue → the matching terminator kind
+ *  - straight-line → `seq`
+ *
+ * Classic hazards, handled explicitly (mirrors the TS visitor):
+ *  - loops allocate a dedicated loop-exit block so `break` has a target before
+ *    the loop's successor is known; `continue` targets the header/increment.
+ *  - `for (;;) {}` / `while (true) {}` still emit the structural `header →
+ *    loopExit` `cond-false` escape edge so EXIT stays reverse-reachable from
+ *    every block — the post-dominator / CDG pass silently emits zero CDG for the
+ *    function otherwise.
+ *  - labeled `goto`: labels resolve within the function (forward AND backward);
+ *    an unresolved `goto` (incl. `goto case`/`goto default`, which target a
+ *    switch arm this CFG does not label) routes to EXIT and logs, preserving
+ *    single-exit.
+ *  - try/catch: conservative exceptional flow — EVERY block in the protected
+ *    region edges to the handler (an exception may fire mid-block), matching the
+ *    TS `visitTry` over-approximation.
+ *
+ * Known limitations:
+ *  - `yield return` / `yield break`: C# iterator methods compile to a hidden
+ *    state machine; tree-sitter shows only the surface `yield_statement`. This
+ *    visitor models `yield break` as a terminator → EXIT (`return`) and
+ *    `yield return e` as a block whose value continues to the next statement
+ *    (the producer resumes after the consumer pulls). The real suspend/resume
+ *    state-machine control flow is NOT modeled — documented gap, not faked.
+ *  - `goto case L;` / `goto default;` have no statically-labeled CFG target
+ *    (switch arms are not labeled blocks here) and route to EXIT like an
+ *    unresolved label.
+ *  - Async/await suspension points are modeled as straight-line (the awaited
+ *    continuation is not a separate flow), consistent with the TS visitor.
+ *  - A value-position `switch_expression` (`k switch {…}`) with ≥2 arms IS modeled
+ *    as a `switch-case` dispatch in three carriers (#2207): a single-declarator
+ *    `var x = k switch {…}` (arms rejoin at a binding continuation), `return k
+ *    switch {…}`, and an `=> k switch {…}` expression body (each arm returns).
+ *    A value switch in any OTHER position — an assignment RHS (`x = k switch …`),
+ *    a call argument, or a multi-declarator decl — stays INLINE (one block).
+ *  - Def/use harvest scope: see `csharp-harvest.ts` — member/element writes are
+ *    not scalar defs; nested-function bodies are opaque in both directions.
+ *
+ * Returns `undefined` (never throws) for an AST shape it cannot model, so a
+ * malformed function never drops the whole file's CFG group (R4).
+ */
+import type { SyntaxNode } from '../../utils/ast-helpers.js';
+import type { CfgVisitor } from '../types.js';
+/** C# node types that own a CFG-bearing function body. */
+declare const CSHARP_FUNCTION_TYPES: Set<string>;
+/** The C# CFG visitor. */
+export declare function createCsharpCfgVisitor(): CfgVisitor<SyntaxNode>;
+export { CSHARP_FUNCTION_TYPES };