@askdb/core 1.0.0-beta.42 → 1.0.0-beta.43

package/dist/sql/tenant-guardrail.js

@@ -1,41 +1,92 @@
 import { TenantGuardrailError, } from "../errors.js";
+import { AskDbLogEvent } from "../logging/log-events.js";
+import { placeholderForTenantRoot, } from "../schema/v2/tenant-policy.js";
+import { isBuiltInDialectId } from "./dialect-spec.js";
+import { startsDashComment } from "./lexer.js";
 /**
- * Validate generated SQL against the tenant policy and runtime scope.
+ * Best-effort lint of generated SQL against the tenant policy and runtime scope.
  *
- * Uses heuristic pattern matching to verify that tenant-scoped tables
- * have the required predicates. Falls back to conservative rejection
- * when the SQL cannot be proven safe.
+ * Pass the SQL **before** tenant substitution: the model's statement, with the
+ * `:tenant_<root>_ids` placeholders still in place. That is the untrusted input;
+ * `resolveTenantSql()` then only swaps each placeholder for literals or driver
+ * markers. `ask()` and `generateSelectSql()` check that form.
  *
- * In `strict` mode, throws `TenantGuardrailError` on failure.
- * In `warn` mode, returns warnings without throwing.
+ * This is a heuristic, not a SQL parser. For each tenant-scoped table the query
+ * mentions, it looks for a tenant predicate: the table's tenant column compared
+ * with its root's placeholder (`col = :tenant_agency_ids`, `col IN
+ * (:tenant_agency_ids)`, `col = ANY(:tenant_agency_ids)`, either side), ANDed into
+ * a `WHERE`, `ON` or `HAVING` clause. A predicate beside an `OR` or `XOR` at any
+ * enclosing level, under `NOT`, or anywhere but a filter clause (the select list,
+ * a `CASE`) doesn't count, and neither does a literal ID or a bare mention of the
+ * column. A root table the scope covers (`org.agency` under an `agency` scope)
+ * needs the same predicate on its tenant ID column. Down a join path, the predicate
+ * must be on a column that carries the IDs of the path's root or one of its ancestors
+ * in the hierarchy. A polymorphic table also needs `typeColumn = '<key>'` ANDed into
+ * the same query block, with a `mapping` key of the root whose placeholder filters
+ * its id column. It does not tie a predicate
+ * to one table reference, so an unfiltered reference beside a filtered one can
+ * still pass; database-side row-level security is the sound boundary.
+ *
+ * **This is not a security boundary.** Its purpose is to catch model mistakes
+ * (a forgotten or widened tenant filter, an unclassified table) early and
+ * cheaply. Real tenant isolation must come from the database (for example
+ * row-level security) or from the host applying the tenant predicate itself.
+ *
+ * Identifiers are matched only in code regions: text inside string literals and
+ * comments never counts as a table reference or a tenant predicate. Regions are
+ * read the way `options.dialect` reads them. Without a dialect (a custom
+ * `AskDialect`, or a direct call without `options.dialect`) the statement is read
+ * the standard-SQL way, the Postgres way (`E'…'` escape strings), and the MySQL
+ * way (`--` starts a comment only before whitespace, and a `/*! … *\/` body is read
+ * both as code and as a comment): a table counts as referenced if any reading sees it, and a tenant
+ * predicate counts only if every reading does. So SQL whose scoping depends on
+ * the dialect (`"agency_id"`, `'it\'s …'`, `E'it\'s …'`) is flagged, never
+ * passed. A tenant placeholder counts only in its exact lowercase form, the only
+ * form `resolveTenantSql()` substitutes.
+ *
+ * `global` scope skips the check. In `strict` mode, throws `TenantGuardrailError`
+ * when the check finds a problem. In `warn` mode, returns warnings without throwing.
  */
-export function validateTenantGuardrails(sql, policy, scope) {
+export function validateTenantGuardrails(sql, policy, scope, options) {
     // Global scope bypasses tenant guardrails
     if (scope.access.kind === "global") {
         return { passed: true, warnings: [] };
     }
     const warnings = [];
-    const normalizedSql = normalizeSql(sql);
+    const views = codeViews(sql, options?.dialect);
+    // Check the roots this scope covers: a query on the root table itself is scoped by its tenant ID column.
+    for (const rootId of scopeRootIds(scope)) {
+        const root = policy.roots.find((r) => r.id === rootId);
+        if (!root || !mentionsTable(views, extractTableName(root.id)))
+            continue;
+        const column = extractColumnName(root.tenantIdColumn);
+        // Filtered on its own tenant ID column, or on a column that carries its IDs (a query
+        // that joins the root for a label, filtered on the scoped table's tenant column).
+        if (!hasTenantPredicate(views, extractTableName(root.id), idCarriers(policy, root.id))) {
+            warnings.push(warn("MISSING_TENANT_PREDICATE", root.id, `Tenant root table '${extractTableName(root.id)}' is missing required tenant predicate. ` +
+                `Expected: ${column} = ${placeholderForTenantRoot(root)}`));
+        }
+    }
     // Check scoped tables
     for (const st of policy.scopedTables) {
         const tableName = extractTableName(st.id);
-        if (!mentionsTable(normalizedSql, tableName))
+        if (!mentionsTable(views, tableName))
             continue;
-        checkScopedTable(normalizedSql, st, policy, warnings);
+        checkScopedTable(views, st, policy, warnings);
     }
     // Check polymorphic tables
     for (const pt of policy.polymorphicTables) {
         const tableName = extractTableName(pt.id);
-        if (!mentionsTable(normalizedSql, tableName))
+        if (!mentionsTable(views, tableName))
             continue;
-        checkPolymorphicTable(normalizedSql, pt, policy, warnings);
+        checkPolymorphicTable(views, pt, policy, warnings);
     }
     // Check unknown tables
     for (const entry of policy.coverage) {
         if (entry.classification !== "unknown")
             continue;
         const tableName = extractTableName(entry.tableId);
-        if (mentionsTable(normalizedSql, tableName)) {
+        if (mentionsTable(views, tableName)) {
             warnings.push(warn("UNKNOWN_TABLE_REFERENCED", entry.tableId, `Query references unclassified table '${tableName}'. Classify it in tenant-policy.md.`));
         }
     }
@@ -45,39 +96,83 @@ export function validateTenantGuardrails(sql, policy, scope) {
     }
     return { passed, warnings };
 }
+/**
+ * Run {@link validateTenantGuardrails} over every SQL form the caller is about to
+ * hand out (e.g. the bound `sql` and, when present, the `unboundSql`), merge the
+ * findings into one result, and log a single pass/fail event.
+ *
+ * Every form is checked in `warn` mode first so the merged result lists all
+ * findings; when the policy is `strict` and anything failed, a single
+ * `TenantGuardrailError` is thrown afterwards. `extra` lets a caller fold in a
+ * result reported by a custom generator so its findings are never dropped.
+ * `dialect` is the target engine, when known (undefined for a custom `AskDialect`).
+ *
+ * Internal to `@askdb/core` — `ask()` and `generateSelectSql()` share it so the
+ * check always runs on the SQL that is actually returned.
+ */
+export function enforceTenantGuardrails(sqls, policy, scope, logger, extra, dialect) {
+    const collectPolicy = { ...policy, enforcement: "warn" };
+    const warnings = [];
+    const seen = new Set();
+    const add = (w) => {
+        const key = `${w.rule}\u0000${w.tableId}\u0000${w.message}`;
+        if (seen.has(key))
+            return;
+        seen.add(key);
+        warnings.push(w);
+    };
+    const checked = new Set();
+    for (const sql of sqls) {
+        if (sql === undefined || checked.has(sql))
+            continue;
+        checked.add(sql);
+        for (const w of validateTenantGuardrails(sql, collectPolicy, scope, { dialect }).warnings)
+            add(w);
+    }
+    for (const w of extra?.warnings ?? [])
+        add(w);
+    const passed = warnings.length === 0 && extra?.passed !== false;
+    if (passed) {
+        logger?.info({ event: AskDbLogEvent.TenantGuardrailPassed }, "tenant guardrail validation passed");
+    }
+    else {
+        logger?.info({
+            event: AskDbLogEvent.TenantGuardrailFailed,
+            warningCount: warnings.length,
+            enforcement: policy.enforcement,
+        }, "tenant guardrail validation found issues");
+    }
+    if (!passed && policy.enforcement === "strict") {
+        const detail = warnings.length > 0
+            ? warnings.map((w) => w.message).join("; ")
+            : "the SQL generator reported a failed tenant guardrail";
+        throw new TenantGuardrailError(`Tenant guardrail validation failed (strict mode): ${detail}`, warnings);
+    }
+    return { passed, warnings };
+}
 // ---------------------------------------------------------------------------
 // Per-table checks
 // ---------------------------------------------------------------------------
 function checkScopedTable(sql, st, policy, warnings) {
+    const table = extractTableName(st.id);
     for (const path of st.scopeThrough) {
+        const placeholder = placeholderFor(policy, path.root);
         if ("column" in path) {
-            const colName = extractColumnName(path.column);
-            const rootLabel = policy.roots.find((r) => r.id === path.root)?.label ?? path.root;
-            const placeholder = `:tenant_${rootLabel.toLowerCase().replace(/[^a-z0-9]+/g, "_")}_ids`;
-            // Check if the tenant column or placeholder appears in the SQL
-            if (mentionsIdentifier(sql, colName) || mentionsIdentifier(sql, placeholder)) {
-                return; // At least one scope path is satisfied
-            }
+            // The table's tenant column compared with its root's placeholder.
+            if (hasTenantPredicate(sql, table, [{ placeholder, column: extractColumnName(path.column), table }]))
+                return;
         }
         else {
-            // Inherited via JOINs — check if the join path columns appear
-            const allStepsPresent = path.join.every((step) => {
-                const fromCol = extractColumnName(step.from);
-                const toCol = extractColumnName(step.to);
-                return mentionsIdentifier(sql, fromCol) && mentionsIdentifier(sql, toCol);
-            });
-            if (allStepsPresent) {
-                // Also verify the root table's tenant column appears somewhere
-                const rootTenantCol = policy.roots.find((r) => r.id === path.root);
-                if (rootTenantCol) {
-                    const rootColName = extractColumnName(rootTenantCol.tenantIdColumn);
-                    const rootLabel = rootTenantCol.label;
-                    const placeholder = `:tenant_${rootLabel.toLowerCase().replace(/[^a-z0-9]+/g, "_")}_ids`;
-                    if (mentionsIdentifier(sql, rootColName) || mentionsIdentifier(sql, placeholder)) {
-                        return; // Join path + root filter present
-                    }
-                }
-            }
+            // Inherited via JOINs: every join column appears, and a tenant predicate filters
+            // the root: on its tenant ID column, or, up the hierarchy, on a column that carries
+            // the IDs of one of its ancestors. A root outside that chain filters nothing here,
+            // even one the scope binds.
+            const allStepsPresent = path.join.every((step) => mentionsIdentifier(sql, extractColumnName(step.from)) && mentionsIdentifier(sql, extractColumnName(step.to)));
+            if (!allStepsPresent)
+                continue;
+            const targets = selfAndAncestors(policy, path.root).flatMap((rootId) => idCarriers(policy, rootId));
+            if (hasTenantPredicate(sql, table, targets))
+                return;
         }
     }
     // None of the scope paths were satisfied
@@ -87,16 +182,107 @@ function checkScopedTable(sql, st, policy, warnings) {
         return p.join.map((j) => `${extractColumnName(j.from)}→${extractColumnName(j.to)}`).join(", ");
     });
     warnings.push(warn("MISSING_TENANT_PREDICATE", st.id, `Tenant-scoped table '${extractTableName(st.id)}' is missing required tenant predicate. ` +
-        `Expected one of: ${pathDescriptions.join(" OR ")}`));
+        `Expected one of: ${pathDescriptions.join(" OR ")}, compared with its tenant placeholder in a WHERE/ON/HAVING clause, ANDed (not OR-ed) with the rest`));
 }
-function checkPolymorphicTable(sql, pt, _policy, warnings) {
+function checkPolymorphicTable(sql, pt, policy, warnings) {
     const typeColName = extractColumnName(pt.typeColumn);
     const idColName = extractColumnName(pt.idColumn);
-    if (!mentionsIdentifier(sql, typeColName)) {
-        warnings.push(warn("MISSING_TYPE_DISCRIMINATOR", pt.id, `Polymorphic table '${extractTableName(pt.id)}' is missing type discriminator column '${typeColName}' in WHERE clause.`));
+    const table = extractTableName(pt.id);
+    const typeMentioned = mentionsIdentifier(sql, typeColName);
+    if (!typeMentioned) {
+        warnings.push(warn("MISSING_TYPE_DISCRIMINATOR", pt.id, `Polymorphic table '${table}' is missing type discriminator column '${typeColName}' in WHERE clause.`));
+    }
+    const rootIds = [...new Set(Object.values(pt.mapping))];
+    const targets = rootIds.map((rootId) => ({ placeholder: placeholderFor(policy, rootId), column: idColName, table }));
+    if (!hasTenantPredicate(sql, table, targets)) {
+        warnings.push(warn("MISSING_TENANT_PREDICATE", pt.id, `Polymorphic table '${table}' is missing a tenant predicate on '${idColName}' (compared with a tenant placeholder in a WHERE/ON/HAVING clause).`));
+        return;
+    }
+    // The id predicate filters by one root's IDs, so the discriminator must pick that root's
+    // rows: `owner_type = 'agency' AND owner_id = :tenant_agency_ids`, ANDed in the same block.
+    const paired = rootIds.map((rootId, i) => ({
+        ...targets[i],
+        discriminator: {
+            column: typeColName,
+            values: Object.entries(pt.mapping).filter(([, r]) => r === rootId).map(([key]) => key),
+        },
+    }));
+    if (typeMentioned && !hasTenantPredicate(sql, table, paired)) {
+        const [key, rootId] = Object.entries(pt.mapping)[0] ?? ["<key>", ""];
+        warnings.push(warn("MISSING_TYPE_DISCRIMINATOR", pt.id, `Polymorphic table '${table}' needs '${typeColName}' compared with the mapping key of the root whose placeholder filters '${idColName}', ` +
+            `ANDed into the same clause (e.g. ${typeColName} = '${key}' AND ${idColName} = ${placeholderFor(policy, rootId)}).`));
+    }
+}
+/** The placeholder `resolveTenantSql()` substitutes for a root (by its label). */
+function placeholderFor(policy, rootId) {
+    return placeholderForTenantRoot(policy.roots.find((r) => r.id === rootId) ?? { id: rootId, label: rootId });
+}
+/**
+ * The columns that hold a root's tenant IDs, each with its root's placeholder: the root's
+ * own `tenantIdColumn`; the foreign key of each child root pointing at it (`hierarchy[]`,
+ * `roots[].parent`), e.g. `sub_agencies.agency_id`; the tenant column of each table
+ * scoped directly through it; and the last hop of each join path that reaches it (the
+ * `from` column of a step whose `to` is the root's tenant ID column).
+ */
+function idCarriers(policy, rootId) {
+    const root = policy.roots.find((r) => r.id === rootId);
+    if (!root)
+        return [];
+    const placeholder = placeholderForTenantRoot(root);
+    const carriers = [
+        { placeholder, column: extractColumnName(root.tenantIdColumn), table: extractTableName(root.id) },
+    ];
+    for (const edge of policy.hierarchy) {
+        if (edge.parent === rootId)
+            carriers.push({ placeholder, column: extractColumnName(edge.foreignKey), table: extractTableName(edge.child) });
+    }
+    for (const child of policy.roots) {
+        if (child.parent?.root === rootId) {
+            carriers.push({ placeholder, column: extractColumnName(child.parent.foreignKey), table: extractTableName(child.id) });
+        }
+    }
+    for (const st of policy.scopedTables) {
+        for (const path of st.scopeThrough) {
+            if (path.root !== rootId)
+                continue;
+            if ("column" in path) {
+                carriers.push({ placeholder, column: extractColumnName(path.column), table: extractTableName(st.id) });
+                continue;
+            }
+            for (const step of path.join) {
+                if (step.to !== root.tenantIdColumn)
+                    continue;
+                carriers.push({ placeholder, column: extractColumnName(step.from), table: tableOfColumn(step.from) });
+            }
+        }
     }
-    if (!mentionsIdentifier(sql, idColName)) {
-        warnings.push(warn("MISSING_TENANT_PREDICATE", pt.id, `Polymorphic table '${extractTableName(pt.id)}' is missing id column '${idColName}' in WHERE/JOIN clause.`));
+    return carriers;
+}
+/** `rootId` and every root above it in the policy's hierarchy (`hierarchy[]`, `roots[].parent`). */
+function selfAndAncestors(policy, rootId) {
+    const chain = [rootId];
+    for (let i = 0; i < chain.length; i++) {
+        const parents = [
+            ...policy.hierarchy.filter((edge) => edge.child === chain[i]).map((edge) => edge.parent),
+            policy.roots.find((r) => r.id === chain[i])?.parent?.root,
+        ];
+        for (const parent of parents)
+            if (parent !== undefined && !chain.includes(parent))
+                chain.push(parent);
+    }
+    return chain;
+}
+/** The tenant roots a scope binds IDs for (`global` binds none). */
+function scopeRootIds(scope) {
+    const access = scope.access;
+    switch (access.kind) {
+        case "ids":
+        case "subtree":
+            return [access.tenantRoot];
+        case "multi_root":
+            return access.scopes.map((s) => s.tenantRoot);
+        default:
+            return [];
     }
 }
 // ---------------------------------------------------------------------------
@@ -110,21 +296,582 @@ function extractTableName(tableId) {
     const dot = tableId.lastIndexOf(".");
     return dot !== -1 ? tableId.slice(dot + 1) : tableId;
 }
+function tableOfColumn(columnId) {
+    // "table:public.orders#agency_id" → "orders"
+    const hash = columnId.lastIndexOf("#");
+    return extractTableName(hash !== -1 ? columnId.slice(0, hash) : columnId);
+}
 function extractColumnName(columnId) {
     // "table:public.orders#agency_id" → "agency_id"
     const hash = columnId.lastIndexOf("#");
     return hash !== -1 ? columnId.slice(hash + 1) : columnId;
 }
-function normalizeSql(sql) {
-    return sql.toLowerCase();
+const STANDARD_READING = {
+    doubleQuoted: "identifier",
+    backslashEscapes: false,
+    hashComments: false,
+    eStrings: false,
+    pipesAreOr: false,
+    dashCommentNeedsSpace: false,
+    executableComments: false,
+};
+const POSTGRES_READING = { ...STANDARD_READING, eStrings: true };
+const MYSQL_READING = {
+    doubleQuoted: "string",
+    backslashEscapes: true,
+    hashComments: true,
+    eStrings: false,
+    pipesAreOr: true,
+    dashCommentNeedsSpace: true,
+    executableComments: true,
+};
+/** MySQL with its executable comments read as comments: a server too old for their version skips them. */
+const MYSQL_SKIPPING_EXECUTABLE = { ...MYSQL_READING, executableComments: false };
+/**
+ * A known dialect gets its own single reading. An unknown one gets every reading
+ * (standard SQL, Postgres with `E'…'` escape strings, MySQL): the statement is
+ * ambiguous exactly where they differ, and the matchers below resolve that
+ * ambiguity toward a warning (tables: any view; predicates: every view). A MySQL
+ * server running with `ANSI_QUOTES` reads `"…"` as an identifier; the MySQL
+ * reading still treats it as a string, so a predicate written only as
+ * `"agency_id"` is flagged there, never passed. A MySQL reading comes twice, with the
+ * bodies of `/*! … *\/` executable comments read as code and as comments, since whether
+ * the server runs one depends on its version.
+ */
+function codeViews(sql, dialect) {
+    if (dialect === undefined || !isBuiltInDialectId(dialect.id)) {
+        return [STANDARD_READING, POSTGRES_READING, MYSQL_READING, MYSQL_SKIPPING_EXECUTABLE].map((r) => view(sql, r));
+    }
+    const backslashEscapes = dialect.backslashEscapes === true;
+    const bases = dialect.id === "mysql" || dialect.id === "mariadb"
+        ? [MYSQL_READING, MYSQL_SKIPPING_EXECUTABLE]
+        : dialect.id === "postgres" || dialect.id === "cockroachdb"
+            ? [POSTGRES_READING]
+            : [STANDARD_READING];
+    return bases.map((base) => view(sql, { ...base, backslashEscapes }));
+}
+function view(sql, reading) {
+    return { text: codeView(sql, reading), source: sql, reading };
+}
+/**
+ * What a quoted identifier's delimiters become in a code view: not a word character, so
+ * identifier matching still sees `"agency_id"` as `agency_id`, but the tokenizer can tell
+ * a quoted `"where"` (an identifier) from the keyword `WHERE`.
+ */
+const QUOTE_MARK = "\u0001";
+/** A character that continues an identifier, so an `E` before it is not a string prefix. */
+const IDENTIFIER_CONTINUE = /[A-Za-z0-9_$\u0080-\uffff]/;
+/**
+ * Blank out everything that is not SQL code, so identifier checks only see code
+ * regions. String literals (`'…'`, `$tag$…$tag$` bodies, and `"…"` when the
+ * reading says so) and comments become spaces. A comment starts where the reading
+ * says (`--` only before whitespace on MySQL, see `startsDashComment` in the shared
+ * lexer), and an executable comment's body stays code when the reading says so. The output has the same length
+ * and keeps the original case (placeholders are case-sensitive), so word
+ * boundaries at the seams are unchanged.
+ *
+ * Quoted identifiers keep their contents; their delimiters become {@link QUOTE_MARK}:
+ * `"agency_id"` *is* the identifier `agency_id` on Postgres, and blanking it
+ * would hide `FROM "orders"` from the table check and skip that table.
+ */
+function codeView(sql, reading) {
+    const out = sql.split("");
+    const blank = (from, to) => {
+        for (let k = from; k < to; k++)
+            if (out[k] !== "\n")
+                out[k] = " ";
+    };
+    /**
+     * End (exclusive) of the string literal opened by `quote` at `open`. `escapes`
+     * says whether backslash escapes the next character inside it.
+     */
+    const stringEnd = (open, quote, escapes) => {
+        let j = open + 1;
+        while (j < sql.length) {
+            const c = sql[j];
+            if (c === "\\" && escapes) {
+                j += 2;
+                continue;
+            }
+            if (c === quote) {
+                if (sql[j + 1] === quote) {
+                    j += 2;
+                    continue;
+                }
+                return j + 1;
+            }
+            j++;
+        }
+        return sql.length;
+    };
+    const dollarTag = /\$(?:[A-Za-z_][A-Za-z0-9_]*)?\$/y;
+    const executableOpener = /\/\*M?!\d*/y;
+    let inExecutable = false;
+    let i = 0;
+    while (i < sql.length) {
+        const ch = sql[i];
+        const next = sql[i + 1];
+        if (startsDashComment(sql, i, reading.dashCommentNeedsSpace) || (ch === "#" && reading.hashComments)) {
+            const newline = sql.indexOf("\n", i);
+            const end = newline === -1 ? sql.length : newline;
+            blank(i, end);
+            i = end;
+            continue;
+        }
+        if (ch === "*" && next === "/" && inExecutable) {
+            blank(i, i + 2);
+            inExecutable = false;
+            i += 2;
+            continue;
+        }
+        if (ch === "/" && next === "*" && reading.executableComments && !inExecutable) {
+            executableOpener.lastIndex = i;
+            const opener = executableOpener.exec(sql);
+            if (opener) {
+                blank(i, i + opener[0].length);
+                inExecutable = true;
+                i += opener[0].length;
+                continue;
+            }
+        }
+        if (ch === "/" && next === "*") {
+            const close = sql.indexOf("*/", i + 2);
+            const end = close === -1 ? sql.length : close + 2;
+            blank(i, end);
+            i = end;
+            continue;
+        }
+        if (ch === "'" || (ch === '"' && reading.doubleQuoted === "string")) {
+            const escapes = reading.backslashEscapes || (ch === "'" && isEStringPrefix(out, i, reading));
+            const end = stringEnd(i, ch, escapes);
+            blank(i, end);
+            i = end;
+            continue;
+        }
+        if (ch === "$") {
+            dollarTag.lastIndex = i;
+            const tag = dollarTag.exec(sql);
+            const close = tag ? sql.indexOf(tag[0], i + tag[0].length) : -1;
+            if (tag && close !== -1) {
+                const end = close + tag[0].length;
+                blank(i, end);
+                i = end;
+                continue;
+            }
+            i++;
+            continue;
+        }
+        if (ch === '"' || ch === "`" || ch === "[") {
+            const close = sql.indexOf(ch === "[" ? "]" : ch, i + 1);
+            out[i] = QUOTE_MARK;
+            if (close === -1)
+                break;
+            out[close] = QUOTE_MARK;
+            i = close + 1;
+            continue;
+        }
+        i++;
+    }
+    return out.join("");
+}
+/**
+ * Whether the `'` at `quote` opens a Postgres `E'…'` escape string: the character
+ * before it is `E`/`e` and that `E` starts a new token (it is not the tail of an
+ * identifier such as `date'…'`). `out` is the view built so far, where blanked
+ * strings, comments, and quoted-identifier delimiters are spaces.
+ */
+function isEStringPrefix(out, quote, reading) {
+    if (!reading.eStrings || quote === 0)
+        return false;
+    const prefix = out[quote - 1];
+    if (prefix !== "E" && prefix !== "e")
+        return false;
+    return quote < 2 || !IDENTIFIER_CONTINUE.test(out[quote - 2]);
+}
+/** A table counts as referenced when any reading sees it. */
+function mentionsTable(views, tableName) {
+    const pattern = new RegExp(`\\b${escapeRegex(tableName)}\\b`, "i");
+    return views.some((view) => pattern.test(view.text));
+}
+/** A tenant column counts only when every reading sees it in code. */
+function mentionsIdentifier(views, identifier) {
+    const pattern = new RegExp(`\\b${escapeRegex(identifier)}\\b`, "i");
+    return views.every((view) => pattern.test(view.text));
+}
+const TOKEN = /:[A-Za-z0-9_]+|::|\|\||<>|!=|<=|>=|[A-Za-z_\u0080-\uffff][\w$\u0080-\uffff]*|\d[\w.]*|\S/g;
+/** Split a code view into tokens with their nesting depth. Strings and comments are already blanked. */
+function tokenize(text) {
+    const tokens = [];
+    let depth = 0;
+    let quoted = false;
+    for (const m of text.matchAll(TOKEN)) {
+        const t = m[0];
+        if (t === QUOTE_MARK) {
+            quoted = !quoted;
+            continue;
+        }
+        if (t === ")")
+            depth = Math.max(0, depth - 1);
+        const lower = t.toLowerCase();
+        tokens.push({ text: t, lower, kw: quoted ? "" : lower, depth, offset: m.index });
+        if (t === "(")
+            depth++;
+    }
+    return tokens;
+}
+/** Keywords that open a clause whose conjuncts filter rows. */
+const FILTER_CLAUSE = new Set(["where", "on", "having"]);
+/** Keywords that end a filter clause at its own nesting level. */
+const CLAUSE_END = new Set([
+    "group", "order", "limit", "offset", "fetch", "union", "intersect", "except", "minus", "window",
+    "qualify", "returning", "for", "lock", "into", "having", "where", "join", "inner", "left", "right",
+    "full", "cross", "outer", "natural", "straight_join", "apply", "using",
+]);
+/** Words that put a predicate somewhere other than a filter conjunct (select list, `CASE`, assignment, …). */
+const NOT_A_FILTER = new Set(["select", "from", "by", "when", "then", "else", "case", "end", "as", "set", "values", "distinct", "is"]);
+/** Keywords that combine query blocks; each block is checked on its own. */
+const SET_OPERATORS = new Set(["union", "intersect", "except", "minus"]);
+/** Words other than identifiers that the predicate forms use. */
+const PREDICATE_WORDS = new Set(["in", "any", "and", "or", "not", "xor"]);
+/** Keywords a table can be named after only when quoted (`"order"`, `[group]`). */
+const RESERVED = new Set([
+    ...FILTER_CLAUSE, ...CLAUSE_END, ...NOT_A_FILTER, ...SET_OPERATORS, ...PREDICATE_WORDS,
+    "order", "group", "user", "table", "limit", "offset", "all", "exists",
+]);
+/**
+ * Whether the statement has a tenant predicate for `table` on every reading: a column
+ * and placeholder from `targets`, compared as a conjunct of a filter clause. Every query
+ * block that mentions the table needs its own: the statement, and each branch of every
+ * `UNION` / `INTERSECT` / `EXCEPT`, at the top level or inside a derived table or CTE.
+ * See {@link validateTenantGuardrails} for the rule.
+ */
+function hasTenantPredicate(views, table, targets) {
+    const name = table.toLowerCase();
+    // A table named after a keyword (`order`) can only be written quoted, so its unquoted
+    // spelling (`ORDER BY`) is the keyword, not the table.
+    const mentions = (t) => t.lower === name && (t.kw === "" || !RESERVED.has(t.kw));
+    return views.every((view) => {
+        const tokens = tokenize(view.text);
+        return queryBlocks(tokens)
+            .filter(([from, to]) => tokens.slice(from, to).some(mentions))
+            .every(([from, to]) => {
+            for (let k = from; k < to; k++) {
+                for (const target of targets) {
+                    if (tokens[k].text !== target.placeholder)
+                        continue;
+                    const span = predicateSpan(tokens, k, target);
+                    if (!span || !isFilterConjunct(tokens, span[0], span[1], view.reading))
+                        continue;
+                    if (!target.discriminator || hasDiscriminator(tokens, from, to, view, target))
+                        return true;
+                }
+            }
+            return false;
+        });
+    });
+}
+/**
+ * Whether the block `tokens[from, to)` ANDs in `col = '<value>'` for `target.discriminator`:
+ * its column (optionally qualified with the target's table or alias), `=`, and a plain
+ * `'…'` literal, read from `view.source` at the offsets where the view blanked it, whose
+ * value is one of the discriminator's values and which nothing but whitespace follows up
+ * to the next token (no `''`-escape, no adjacent literal, no comment).
+ */
+function hasDiscriminator(tokens, from, to, view, target) {
+    const { column, values } = target.discriminator;
+    const source = view.source;
+    for (let i = from; i < to; i++) {
+        const t = tokens[i];
+        const eq = tokens[i + 1];
+        if (!isIdentifier(t) || t.lower !== column.toLowerCase() || eq?.text !== "=")
+            continue;
+        const qualifier = tokens[i - 1]?.text === "." ? tokens[i - 2] : undefined;
+        if (qualifier !== undefined && namesOtherTable(tokens, qualifier.lower, target.table.toLowerCase()))
+            continue;
+        let open = eq.offset + 1;
+        while (/\s/.test(source[open] ?? ""))
+            open++;
+        if (source[open] !== "'")
+            continue;
+        const close = source.indexOf("'", open + 1);
+        if (close < 0)
+            continue;
+        const value = source.slice(open + 1, close);
+        if (value.includes("\\") || !values.includes(value))
+            continue;
+        // The view must read it as a string, and it must end there.
+        const next = tokens[i + 2]?.offset ?? source.length;
+        if (view.text.slice(open, close + 1).trim() !== "" || source.slice(close + 1, next).trim() !== "")
+            continue;
+        if (isFilterConjunct(tokens, qualifiedStart(tokens, i), i + 1, view.reading))
+            return true;
+    }
+    return false;
+}
+/**
+ * Token ranges `[from, to)` of the statement's query blocks: the whole statement, and
+ * each branch of every set operation at any depth (bounded by the parentheses around it).
+ */
+function queryBlocks(tokens) {
+    const blocks = [[0, tokens.length]];
+    const splits = new Map(); // enclosing "(" (or -1) → set-operator positions
+    tokens.forEach((t, i) => {
+        if (!SET_OPERATORS.has(t.kw))
+            return;
+        const open = enclosing(tokens, i, "(");
+        splits.set(open, [...(splits.get(open) ?? []), i]);
+    });
+    for (const [open, positions] of splits) {
+        const end = open < 0 ? tokens.length : enclosing(tokens, open + 1, ")");
+        let from = open + 1;
+        for (const at of positions) {
+            blocks.push([from, at]);
+            from = at + 1;
+        }
+        blocks.push([from, end < 0 ? tokens.length : end]);
+    }
+    return blocks;
+}
+/** An identifier token: a word that isn't one of the predicate forms' keywords. */
+function isIdentifier(token) {
+    return /^[A-Za-z_\u0080-\uffff]/.test(token.text) && !PREDICATE_WORDS.has(token.kw);
+}
+/**
+ * A clause keyword used as a function name (`LEFT(status, 1)`, `RIGHT(…)`) is an identifier.
+ * A set operator never is: `UNION (SELECT …)` opens a parenthesized operand.
+ */
+function isFunctionCall(tokens, i) {
+    return tokens[i + 1]?.text === "(" && isIdentifier(tokens[i]) && !SET_OPERATORS.has(tokens[i].kw);
+}
+/** Start index of a possibly qualified column (`o.agency_id`, `s.o.agency_id`) that ends at `end`. */
+function qualifiedStart(tokens, end) {
+    let start = end;
+    while (tokens[start - 1]?.text === "." && tokens[start - 2] !== undefined && isIdentifier(tokens[start - 2]))
+        start -= 2;
+    return start;
 }
-function mentionsTable(normalizedSql, tableName) {
-    const pattern = new RegExp(`\\b${escapeRegex(tableName.toLowerCase())}\\b`);
-    return pattern.test(normalizedSql);
+/**
+ * The token span `[start, end]` of a tenant predicate around the placeholder at `k`:
+ * `col = P`, `P = col`, `col IN (P)` or `col = ANY (P)`, where `col` (the last part of a
+ * possibly qualified name) is the target's column. A qualifier that names, or is the
+ * alias of, a table other than the target's makes it no predicate for that table.
+ */
+function predicateSpan(tokens, k, target) {
+    const at = (i) => tokens[i];
+    const column = target.column.toLowerCase();
+    const matches = (i) => {
+        const t = at(i);
+        if (t === undefined || !isIdentifier(t) || t.lower !== column)
+            return false;
+        const qualifier = at(i - 1)?.text === "." ? at(i - 2) : undefined;
+        return qualifier === undefined || !namesOtherTable(tokens, qualifier.lower, target.table.toLowerCase());
+    };
+    // col = P
+    if (at(k - 1)?.text === "=" && matches(k - 2))
+        return [qualifiedStart(tokens, k - 2), k];
+    const closed = at(k + 1)?.text === ")";
+    // col IN ( P )
+    if (closed && at(k - 1)?.text === "(" && at(k - 2)?.kw === "in" && matches(k - 3)) {
+        return [qualifiedStart(tokens, k - 3), k + 1];
+    }
+    // col = ANY ( P )
+    if (closed && at(k - 1)?.text === "(" && at(k - 2)?.kw === "any" && at(k - 3)?.text === "=" && matches(k - 4)) {
+        return [qualifiedStart(tokens, k - 4), k + 1];
+    }
+    // P = col
+    if (at(k + 1)?.text === "=") {
+        let end = k + 2;
+        while (at(end + 1)?.text === "." && at(end + 2) !== undefined && isIdentifier(at(end + 2)))
+            end += 2;
+        if (matches(end))
+            return [k, end];
+    }
+    return undefined;
+}
+/**
+ * Whether the qualifier `name` names a table other than `table`: `name` is that other
+ * table, or is declared as its alias (`FROM appointments a`, `JOIN appointments AS a`).
+ * A qualifier the statement doesn't declare (a derived table's or CTE's name) names no
+ * known table, so it doesn't rule the predicate out.
+ */
+function namesOtherTable(tokens, name, table) {
+    if (name === table)
+        return false;
+    for (let i = 1; i < tokens.length; i++) {
+        if (tokens[i].lower !== name || !isIdentifier(tokens[i]))
+            continue;
+        const source = tokens[i - 1]?.kw === "as" ? i - 2 : i - 1;
+        const src = tokens[source];
+        if (src === undefined || !isIdentifier(src) || tokens[source + 1]?.text === ".")
+            continue;
+        const before = tokens[qualifiedStart(tokens, source) - 1];
+        if (before !== undefined && (before.kw === "from" || before.kw === "join" || before.text === ",")) {
+            return src.lower !== table;
+        }
+    }
+    return false;
 }
-function mentionsIdentifier(normalizedSql, identifier) {
-    const pattern = new RegExp(`\\b${escapeRegex(identifier.toLowerCase())}\\b`);
-    return pattern.test(normalizedSql);
+/**
+ * Whether the subquery opened by the `(` at `open` is a row source (a derived table in
+ * `FROM`/`JOIN`, a CTE body after `AS`), the right side of `col IN (…)`, or anything else.
+ * `EXISTS (…)` is "other": its filter limits the subquery's rows, not the outer query's.
+ * A parenthesized statement, or a parenthesized operand of a set operation (after `(`,
+ * or after `UNION`/`INTERSECT`/`EXCEPT`/`MINUS` [`ALL`|`DISTINCT`]), produces the rows of
+ * the query around it, so it is used however that query is.
+ */
+function subqueryUse(tokens, open) {
+    const opener = tokens[open - 1];
+    const setOperand = opener !== undefined &&
+        (SET_OPERATORS.has(opener.kw) ||
+            ((opener.kw === "all" || opener.kw === "distinct") && SET_OPERATORS.has(tokens[open - 2]?.kw ?? "")));
+    if (opener === undefined || opener.text === "(" || setOperand) {
+        const around = opener?.text === "(" ? open - 1 : enclosing(tokens, open, "(");
+        if (around < 0)
+            return "table"; // the statement itself
+        // `col IN ((…))`: the caller reads `col IN` right before the subquery, so don't claim it.
+        const use = subqueryUse(tokens, around);
+        return use === "in" ? "other" : use;
+    }
+    if (opener.kw === "in")
+        return tokens[open - 2] !== undefined && isIdentifier(tokens[open - 2]) ? "in" : "other";
+    if (opener.kw === "as" || opener.kw === "lateral")
+        return "table";
+    const depth = tokens[open].depth;
+    for (let i = open - 1; i >= 0; i--) {
+        const t = tokens[i];
+        if (t.depth < depth)
+            return "other";
+        if (t.depth > depth)
+            continue;
+        // OUTER APPLY keeps every left-side row, like an outer join; CROSS APPLY filters.
+        if (t.kw === "apply")
+            return tokens[i - 1]?.kw === "outer" ? "other" : "table";
+        if (t.kw === "from" || t.kw === "join")
+            return "table";
+        if (t.text !== "," && !(isIdentifier(t) && !CLAUSE_END.has(t.kw) && !NOT_A_FILTER.has(t.kw)))
+            return "other";
+    }
+    return "other";
+}
+/** SQL Server join hints, written between the join kind and `JOIN` (`LEFT HASH JOIN`). */
+const JOIN_HINTS = new Set(["loop", "hash", "merge", "remote"]);
+/** Whether the `ON` at `on` belongs to an outer join, whose `ON` doesn't filter the preserved side. */
+function isOuterJoinOn(tokens, on) {
+    const depth = tokens[on].depth;
+    for (let i = on - 1; i >= 0; i--) {
+        const t = tokens[i];
+        if (t.depth < depth)
+            return false;
+        if (t.depth > depth || t.kw !== "join")
+            continue;
+        let kind = i - 1;
+        if (JOIN_HINTS.has(tokens[kind]?.kw ?? ""))
+            kind--;
+        if (tokens[kind]?.kw === "outer")
+            kind--;
+        return ["left", "right", "full"].includes(tokens[kind]?.kw ?? "");
+    }
+    return false;
+}
+/**
+ * Whether the term `tokens[start..end]` is ANDed into a `WHERE`, `ON` (of an inner join)
+ * or `HAVING` clause of the statement: at its own level and at every enclosing
+ * parenthesized level up to that clause, it sits between `AND`s (or the clause's start
+ * and end), with no `OR`, `XOR` (or MySQL's `||`) at that level and no `NOT` in front of
+ * it. A clause inside a subquery counts only when the subquery is a row source (a
+ * derived table or CTE), or when the whole `col IN (…)` around it is itself such a
+ * conjunct; not inside `EXISTS (…)`, a scalar subquery, or a comparison. A level opened by a function call or a comparison doesn't count.
+ */
+function isFilterConjunct(tokens, start, end, reading) {
+    const disjunction = (t) => t.kw === "or" || t.kw === "xor" || (t.text === "||" && reading.pipesAreOr);
+    const endsClause = (i) => CLAUSE_END.has(tokens[i].kw) && !isFunctionCall(tokens, i);
+    let lo = start;
+    let hi = end;
+    let depth = tokens[start].depth;
+    for (;;) {
+        // What is directly around the term, at its level.
+        const before = tokens[lo - 1];
+        const after = tokens[hi + 1];
+        const leftOk = before !== undefined && (before.kw === "and" || before.text === "(" || FILTER_CLAUSE.has(before.kw));
+        const rightOk = after === undefined || after.kw === "and" || after.text === ")" || after.text === ";" || endsClause(hi + 1);
+        if (!leftOk || !rightOk)
+            return false;
+        // Scan the rest of this level on both sides for a disjunction, a NOT, or the clause keyword.
+        let clause = -1;
+        let open = -1;
+        for (let i = lo - 1; i >= 0; i--) {
+            const t = tokens[i];
+            if (t.depth < depth) {
+                open = i; // the "(" opening this level
+                break;
+            }
+            if (t.depth > depth)
+                continue;
+            if (disjunction(t) || t.kw === "not")
+                return false;
+            if (FILTER_CLAUSE.has(t.kw)) {
+                clause = i;
+                break;
+            }
+            if ((endsClause(i) || NOT_A_FILTER.has(t.kw)) && !isFunctionCall(tokens, i))
+                return false;
+        }
+        let close = tokens.length;
+        for (let j = hi + 1; j < tokens.length; j++) {
+            const t = tokens[j];
+            if (t.depth < depth) {
+                close = j; // the ")" closing this level
+                break;
+            }
+            if (t.depth > depth)
+                continue;
+            if (t.text === ";" || endsClause(j))
+                break;
+            if (disjunction(t))
+                return false;
+        }
+        if (clause >= 0) {
+            if (tokens[clause].kw === "on" && isOuterJoinOn(tokens, clause))
+                return false;
+            if (depth === 0)
+                return true;
+            // The clause is inside a subquery: how does the query around it use that subquery?
+            const blockOpen = enclosing(tokens, clause, "(");
+            const blockClose = enclosing(tokens, clause, ")");
+            if (blockOpen < 0 || blockClose < 0)
+                return false;
+            const use = subqueryUse(tokens, blockOpen);
+            if (use === "table")
+                return true;
+            if (use === "other")
+                return false;
+            lo = qualifiedStart(tokens, blockOpen - 2); // `col IN (…)`
+            hi = blockClose;
+            depth = tokens[blockOpen].depth;
+            continue;
+        }
+        if (open < 0 || tokens[open].text !== "(" || close >= tokens.length || tokens[close].text !== ")")
+            return false;
+        // A parenthesized group counts only as a plain boolean conjunct: opened right after
+        // WHERE/ON/HAVING, AND, or another "(". Anything else (`f(`, `IN (`, `EXISTS (`,
+        // `NOT (`, `= (`) makes it something other than a filter conjunct.
+        const opener = tokens[open - 1];
+        if (opener === undefined || !(FILTER_CLAUSE.has(opener.kw) || opener.kw === "and" || opener.text === "("))
+            return false;
+        lo = open;
+        hi = close;
+        depth = tokens[open].depth;
+    }
+}
+/** Index of the `(` or `)` that encloses the token at `i`, or -1 at the top level. */
+function enclosing(tokens, i, paren) {
+    const depth = tokens[i].depth;
+    const step = paren === "(" ? -1 : 1;
+    for (let k = i + step; k >= 0 && k < tokens.length; k += step) {
+        if (tokens[k].depth < depth)
+            return tokens[k].text === paren ? k : -1;
+    }
+    return -1;
 }
 function escapeRegex(str) {
     return str.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");