pyric 0.0.1 → 0.1.0-alpha.7

package/dist/rules/inspect/handler.js

@@ -0,0 +1,144 @@
+import { parseToASTOrError } from '../grammar/FirestoreParser.js';
+import { validateFirestoreRules } from '../grammar/FirestoreValidator.js';
+const RULES_API = 'https://firebaserules.googleapis.com/v1';
+export class InspectFirestoreRulesHandler {
+    async execute(scope) {
+        try {
+            const token = await scope.resolveToken();
+            // 1. List rulesets to find the latest Firestore ruleset
+            const listRes = await fetch(`${RULES_API}/projects/${scope.projectId}/rulesets?pageSize=10`, {
+                headers: { Authorization: `Bearer ${token}` },
+            });
+            if (listRes.status === 403) {
+                return {
+                    success: false,
+                    error: { code: 'PERMISSION_DENIED', message: 'Service account lacks permission to read Firestore rules', recoverable: false },
+                };
+            }
+            if (!listRes.ok) {
+                return {
+                    success: false,
+                    error: { code: 'FETCH_FAILED', message: `Failed to list rulesets: ${listRes.status}`, recoverable: false },
+                };
+            }
+            const listData = await listRes.json();
+            const rulesets = (listData.rulesets || []).filter(r => r.metadata?.services?.includes('cloud.firestore'));
+            if (rulesets.length === 0) {
+                return {
+                    success: false,
+                    error: { code: 'NO_RULESETS', message: 'No Firestore rulesets found for this project', recoverable: false },
+                };
+            }
+            // 2. Get the most recent ruleset
+            const latest = rulesets[0];
+            const rulesetId = latest.name.split('/').pop();
+            const getRes = await fetch(`${RULES_API}/${latest.name}`, {
+                headers: { Authorization: `Bearer ${token}` },
+            });
+            if (!getRes.ok) {
+                return {
+                    success: false,
+                    error: { code: 'FETCH_FAILED', message: `Failed to get ruleset: ${getRes.status}`, recoverable: false },
+                };
+            }
+            const rulesetData = await getRes.json();
+            const source = rulesetData.source.files[0]?.content || '';
+            // 3. Parse the rules — surface line/col so a deployed-but-broken
+            // ruleset is easy to locate even when it came from outside this SDK.
+            const parsed = parseToASTOrError(source);
+            if (!parsed.ok) {
+                return {
+                    success: false,
+                    error: {
+                        code: 'PARSE_FAILED',
+                        message: `Failed to parse deployed Firestore rules at line ${parsed.error.line}, col ${parsed.error.column}: expected ${parsed.error.expected || '<unknown>'}`,
+                        recoverable: false,
+                        parseError: parsed.error,
+                    },
+                };
+            }
+            const ast = parsed.ast;
+            // 4. Build summary + validate
+            const summary = buildSummary(ast.service.match);
+            const findings = validateFirestoreRules(ast);
+            return {
+                success: true,
+                data: {
+                    rules: ast,
+                    source,
+                    rulesetId,
+                    createdAt: latest.createTime,
+                    summary,
+                    findings,
+                },
+            };
+        }
+        catch (e) {
+            return {
+                success: false,
+                error: { code: 'FETCH_FAILED', message: e instanceof Error ? e.message : String(e), recoverable: false },
+            };
+        }
+    }
+}
+function buildSummary(rootMatch) {
+    const matchPaths = [];
+    const functionNames = [];
+    const operationCounts = {};
+    let totalAllowRules = 0;
+    const publicReadPaths = [];
+    const publicWritePaths = [];
+    function walkMatch(match) {
+        // Collect match path
+        matchPaths.push(match.path.raw);
+        // Collect functions
+        for (const fn of match.functions) {
+            functionNames.push(fn.name);
+        }
+        // Collect allow rules
+        for (const allow of match.allows) {
+            totalAllowRules++;
+            for (const op of allow.operations) {
+                operationCounts[op] = (operationCounts[op] || 0) + 1;
+            }
+            // Check for public access (condition is literal true)
+            if (isLiteralTrue(allow.condition)) {
+                for (const op of allow.operations) {
+                    if (op === 'read' || op === 'get' || op === 'list') {
+                        if (!publicReadPaths.includes(match.path.raw)) {
+                            publicReadPaths.push(match.path.raw);
+                        }
+                    }
+                    if (op === 'write' || op === 'create' || op === 'update' || op === 'delete') {
+                        if (!publicWritePaths.includes(match.path.raw)) {
+                            publicWritePaths.push(match.path.raw);
+                        }
+                    }
+                }
+            }
+        }
+        // Recurse into children
+        for (const child of match.children) {
+            walkMatch(child);
+        }
+    }
+    // Walk children of the documents match (skip the /databases/{database}/documents root)
+    for (const fn of rootMatch.functions) {
+        functionNames.push(fn.name);
+    }
+    for (const child of rootMatch.children) {
+        walkMatch(child);
+    }
+    // Also count root-level allows
+    for (const allow of rootMatch.allows) {
+        totalAllowRules++;
+        for (const op of allow.operations) {
+            operationCounts[op] = (operationCounts[op] || 0) + 1;
+        }
+    }
+    return { matchPaths, functionNames, operationCounts, totalAllowRules, publicReadPaths, publicWritePaths };
+}
+function isLiteralTrue(expr) {
+    return expr.type === 'literal' && expr.value === true;
+}
+//# sourceMappingURL=handler.js.map

package/dist/rules/inspect/handler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"handler.js","sourceRoot":"","sources":["../../../src/rules/inspect/handler.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,sBAAsB,EAAE,MAAM,kCAAkC,CAAC;AAE1E,MAAM,SAAS,GAAG,yCAAyC,CAAC;AAE5D,MAAM,OAAO,4BAA4B;IACvC,KAAK,CAAC,OAAO,CAAC,KAAmB;QAC/B,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,YAAY,EAAE,CAAC;YAEzC,wDAAwD;YACxD,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,GAAG,SAAS,aAAa,KAAK,CAAC,SAAS,uBAAuB,EAAE;gBAC3F,OAAO,EAAE,EAAE,aAAa,EAAE,UAAU,KAAK,EAAE,EAAE;aAC9C,CAAC,CAAC;YAEH,IAAI,OAAO,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC;gBAC3B,OAAO;oBACL,OAAO,EAAE,KAAK;oBACd,KAAK,EAAE,EAAE,IAAI,EAAE,mBAAmB,EAAE,OAAO,EAAE,0DAA0D,EAAE,WAAW,EAAE,KAAK,EAAE;iBAC9H,CAAC;YACJ,CAAC;YAED,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC;gBAChB,OAAO;oBACL,OAAO,EAAE,KAAK;oBACd,KAAK,EAAE,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,4BAA4B,OAAO,CAAC,MAAM,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE;iBAC3G,CAAC;YACJ,CAAC;YAED,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,IAAI,EAAoG,CAAC;YACxI,MAAM,QAAQ,GAAG,CAAC,QAAQ,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CACpD,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,iBAAiB,CAAC,CAClD,CAAC;YAEF,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1B,OAAO;oBACL,OAAO,EAAE,KAAK;oBACd,KAAK,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,8CAA8C,EAAE,WAAW,EAAE,KAAK,EAAE;iBAC5G,CAAC;YACJ,CAAC;YAED,iCAAiC;YACjC,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAG,CAAC;YAEhD,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,GAAG,SAAS,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE;gBACxD,OAAO,EAAE,EAAE,aAAa,EAAE,UAAU,KAAK,EAAE,EAAE;aAC9C,CAAC,CAAC;YAEH,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;gBACf,OAAO;oBACL,OAAO,EAAE,KAAK;oBACd,KAAK,EAAE,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,0BAA0B,MAAM,CAAC,MAAM,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE;iBACxG,CAAC;YACJ,CAAC;YAED,MAAM,WAAW,GAAG,MAAM,MAAM,CAAC,IAAI,EAGpC,CAAC;YAEF,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,IAAI,EAAE,CAAC;YAE1D,iEAAiE;YACjE,qEAAqE;YACrE,MAAM,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;YACzC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;gBACf,OAAO;oBACL,OAAO,EAAE,KAAK;oBACd,KAAK,EAAE;wBACL,IAAI,EAAE,cAAc;wBACpB,OAAO,EAAE,oDAAoD,MAAM,CAAC,KAAK,CAAC,IAAI,SAAS,MAAM,CAAC,KAAK,CAAC,MAAM,cAAc,MAAM,CAAC,KAAK,CAAC,QAAQ,IAAI,WAAW,EAAE;wBAC9J,WAAW,EAAE,KAAK;wBAClB,UAAU,EAAE,MAAM,CAAC,KAAK;qBACzB;iBACF,CAAC;YACJ,CAAC;YACD,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;YAEvB,8BAA8B;YAC9B,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAChD,MAAM,QAAQ,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;YAE7C,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,IAAI,EAAE;oBACJ,KAAK,EAAE,GAAG;oBACV,MAAM;oBACN,SAAS;oBACT,SAAS,EAAE,MAAM,CAAC,UAAU;oBAC5B,OAAO;oBACP,QAAQ;iBACT;aACF,CAAC;QACJ,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE;aACzG,CAAC;QACJ,CAAC;IACH,CAAC;CACF;AAED,SAAS,YAAY,CAAC,SAAqB;IACzC,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,MAAM,eAAe,GAA2B,EAAE,CAAC;IACnD,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,MAAM,gBAAgB,GAAa,EAAE,CAAC;IAEtC,SAAS,SAAS,CAAC,KAAiB;QAClC,qBAAqB;QACrB,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEhC,oBAAoB;QACpB,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YACjC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;QAED,sBAAsB;QACtB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YACjC,eAAe,EAAE,CAAC;YAClB,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;gBAClC,eAAe,CAAC,EAAE,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACvD,CAAC;YAED,sDAAsD;YACtD,IAAI,aAAa,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;gBACnC,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;oBAClC,IAAI,EAAE,KAAK,MAAM,IAAI,EAAE,KAAK,KAAK,IAAI,EAAE,KAAK,MAAM,EAAE,CAAC;wBACnD,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;4BAC9C,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wBACvC,CAAC;oBACH,CAAC;oBACD,IAAI,EAAE,KAAK,OAAO,IAAI,EAAE,KAAK,QAAQ,IAAI,EAAE,KAAK,QAAQ,IAAI,EAAE,KAAK,QAAQ,EAAE,CAAC;wBAC5E,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;4BAC/C,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wBACxC,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,wBAAwB;QACxB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACnC,SAAS,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,uFAAuF;IACvF,KAAK,MAAM,EAAE,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;QACrC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;QACvC,SAAS,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;IACD,+BAA+B;IAC/B,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;QACrC,eAAe,EAAE,CAAC;QAClB,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;YAClC,eAAe,CAAC,EAAE,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,eAAe,EAAE,eAAe,EAAE,eAAe,EAAE,gBAAgB,EAAE,CAAC;AAC5G,CAAC;AAED,SAAS,aAAa,CAAC,IAAgB;IACrC,OAAO,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC;AACxD,CAAC"}

package/dist/rules/inspect/spec.d.ts

@@ -0,0 +1,37 @@
+import type { FirestoreRules } from '../grammar/FirestoreAST.js';
+import type { ValidationFinding } from '../grammar/FirestoreValidator.js';
+import type { ParseError } from '../grammar/FirestoreParser.js';
+export type InspectFirestoreRulesResult = {
+    success: true;
+    data: {
+        rules: FirestoreRules;
+        source: string;
+        rulesetId: string;
+        createdAt: string;
+        summary: RulesSummary;
+        findings: ValidationFinding[];
+    };
+} | {
+    success: false;
+    error: {
+        code: string;
+        message: string;
+        recoverable: boolean;
+        parseError?: ParseError;
+    };
+};
+export interface RulesSummary {
+    /** All match paths in the rules (e.g., '/users/{userId}', '/posts/{postId}') */
+    matchPaths: string[];
+    /** All function names defined in the rules */
+    functionNames: string[];
+    /** Count of allow rules by operation type */
+    operationCounts: Record<string, number>;
+    /** Total number of allow rules */
+    totalAllowRules: number;
+    /** Paths with public read (allow read: if true) */
+    publicReadPaths: string[];
+    /** Paths with public write (allow write: if true or allow create/update/delete: if true) */
+    publicWritePaths: string[];
+}
+//# sourceMappingURL=spec.d.ts.map

package/dist/rules/inspect/spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"spec.d.ts","sourceRoot":"","sources":["../../../src/rules/inspect/spec.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AACjE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,kCAAkC,CAAC;AAC1E,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AAEhE,MAAM,MAAM,2BAA2B,GACnC;IACE,OAAO,EAAE,IAAI,CAAC;IACd,IAAI,EAAE;QACJ,KAAK,EAAE,cAAc,CAAC;QACtB,MAAM,EAAE,MAAM,CAAC;QACf,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;QAClB,OAAO,EAAE,YAAY,CAAC;QACtB,QAAQ,EAAE,iBAAiB,EAAE,CAAC;KAC/B,CAAC;CACH,GACD;IACE,OAAO,EAAE,KAAK,CAAC;IACf,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,OAAO,CAAC;QAAC,UAAU,CAAC,EAAE,UAAU,CAAA;KAAE,CAAC;CACzF,CAAC;AAEN,MAAM,WAAW,YAAY;IAC3B,gFAAgF;IAChF,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,8CAA8C;IAC9C,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,6CAA6C;IAC7C,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxC,kCAAkC;IAClC,eAAe,EAAE,MAAM,CAAC;IACxB,mDAAmD;IACnD,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,4FAA4F;IAC5F,gBAAgB,EAAE,MAAM,EAAE,CAAC;CAC5B"}

package/dist/rules/inspect/spec.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=spec.js.map

package/dist/rules/inspect/spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"spec.js","sourceRoot":"","sources":["../../../src/rules/inspect/spec.ts"],"names":[],"mappings":""}

package/dist/rules/inspect/tools.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Browser-safe `firestore_inspect_rules` factory. Returns a single
+ * `ToolHandler` that, given a `ProjectScope`, fetches + parses the
+ * currently deployed Firestore ruleset.
+ *
+ * Split from the main `createFirestoreRulesTools` factory (which is
+ * Node-only — it wraps the disk-reading modules resolver) so browser
+ * callers (the playground, debug surfaces) can opt into just the
+ * inspect tool without dragging in `node:fs`.
+ *
+ * Server-side callers should use `createFirestoreRulesTools({ scope })`
+ * (Node entry) which includes this tool + the rest of the rules
+ * lifecycle (test, simulate, lint, resolve-modules).
+ */
+import type { ToolHandler } from '@inbrowser/agent';
+import type { ProjectScope } from '../../project-scope.js';
+export interface FirestoreInspectToolDeps {
+    scope: ProjectScope;
+}
+export declare function createFirestoreInspectTool(deps: FirestoreInspectToolDeps): ToolHandler;
+//# sourceMappingURL=tools.d.ts.map

package/dist/rules/inspect/tools.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tools.d.ts","sourceRoot":"","sources":["../../../src/rules/inspect/tools.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAG3D,MAAM,WAAW,wBAAwB;IACvC,KAAK,EAAE,YAAY,CAAC;CACrB;AAED,wBAAgB,0BAA0B,CAAC,IAAI,EAAE,wBAAwB,GAAG,WAAW,CAmBtF"}

package/dist/rules/inspect/tools.js

@@ -0,0 +1,21 @@
+import { InspectFirestoreRulesHandler } from './handler.js';
+export function createFirestoreInspectTool(deps) {
+    const { scope } = deps;
+    const handler = new InspectFirestoreRulesHandler();
+    return {
+        name: 'firestore_inspect_rules',
+        description: 'Fetch and parse the currently deployed Firestore security rules for this project. Returns the parsed AST with match blocks, functions, allow rules, and a summary including public paths, operation counts, and function names. Use this to understand the security model before generating code or modifying rules.',
+        parameters: { type: 'object', properties: {} },
+        async execute() {
+            const result = await handler.execute(scope);
+            return {
+                ok: result.success,
+                summary: result.success
+                    ? `${result.data.summary.totalAllowRules} allow rule(s) across ${result.data.summary.matchPaths.length} match path(s)`
+                    : `Inspect failed: ${result.error.message}`,
+                data: result,
+            };
+        },
+    };
+}
+//# sourceMappingURL=tools.js.map

package/dist/rules/inspect/tools.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tools.js","sourceRoot":"","sources":["../../../src/rules/inspect/tools.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,4BAA4B,EAAE,MAAM,cAAc,CAAC;AAM5D,MAAM,UAAU,0BAA0B,CAAC,IAA8B;IACvE,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;IACvB,MAAM,OAAO,GAAG,IAAI,4BAA4B,EAAE,CAAC;IACnD,OAAO;QACL,IAAI,EAAE,yBAAyB;QAC/B,WAAW,EACT,sTAAsT;QACxT,UAAU,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE;QAC9C,KAAK,CAAC,OAAO;YACX,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC5C,OAAO;gBACL,EAAE,EAAE,MAAM,CAAC,OAAO;gBAClB,OAAO,EAAE,MAAM,CAAC,OAAO;oBACrB,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,eAAe,yBAAyB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,gBAAgB;oBACtH,CAAC,CAAC,mBAAmB,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE;gBAC7C,IAAI,EAAE,MAAM;aACb,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/rules/linter/ast-utils.d.ts

@@ -0,0 +1,97 @@
+/**
+ * AST utility functions for the Firestore rules linter.
+ *
+ * These are low-level tree-walking primitives that the lint rules compose.
+ * Each is independently testable against the linter corpus.
+ */
+import type { Expression, FunctionDef, AllowRule, MatchBlock } from '../grammar/FirestoreAST.js';
+/**
+ * Count the maximum flat binary chain depth for a given operator.
+ *
+ * A flat chain `a && b && c` has depth 3 (three operands joined by &&).
+ * Nested chains `(a && b) || (c && d)` have OR-depth 2 and AND-depth 2.
+ *
+ * The Firestore compilation limit is 98 for both AND and OR chains.
+ *
+ * The parser builds right-associative trees: `a && b && c` becomes
+ * `binaryOp(&&, a, binaryOp(&&, b, c))`. So we count by following the
+ * right branch while the operator matches.
+ */
+export declare function maxChainDepth(expr: Expression, op: string): number;
+/**
+ * Find the maximum chain depth for ANY binary operator in an expression tree.
+ * Walks all subexpressions to find the deepest chain anywhere.
+ */
+export declare function deepestChain(expr: Expression): {
+    op: string;
+    depth: number;
+};
+/**
+ * Count total expression nodes in an expression tree.
+ * Used for runtime budget estimation.
+ */
+export declare function countExpressionNodes(expr: Expression): number;
+/**
+ * Produce a structural fingerprint of an expression for comparison.
+ * Used by SHARED_GATE to detect identical first expressions across allow rules.
+ *
+ * Two expressions with the same fingerprint are structurally identical
+ * (same operators, same field names, same literals, same nesting).
+ */
+export declare function expressionFingerprint(expr: Expression): string;
+/**
+ * Extract the first (leftmost) condition from a binary AND chain.
+ * For `a && b && c`, returns `a` (the gate expression).
+ *
+ * The parser builds: binaryOp(&&, a, binaryOp(&&, b, c))
+ * So the first expression is always the left child of the outermost &&.
+ */
+export declare function extractFirstExpression(condition: Expression): Expression;
+/**
+ * Build a call graph: function name → list of functions it calls.
+ * Includes both direct and let-binding calls.
+ */
+export declare function buildCallGraph(functions: FunctionDef[]): Map<string, string[]>;
+/**
+ * Find the maximum call chain depth from a starting point.
+ */
+export declare function maxCallDepth(start: string, graph: Map<string, string[]>, visited?: Set<string>): number;
+/**
+ * Count get() and exists() calls reachable from an expression,
+ * following function calls transitively.
+ */
+export declare function countGetCalls(expr: Expression, functions: Map<string, FunctionDef>, visited?: Set<string>): number;
+/**
+ * Count how many times each user-defined function is called in an expression.
+ * Unlike countGetCalls (which deduplicates), this counts raw call-site occurrences.
+ */
+export declare function countFunctionCallSites(expr: Expression, fnNames: Set<string>): Map<string, number>;
+/**
+ * Check if a function transitively contains get() or exists() calls.
+ */
+export declare function functionContainsGet(fnName: string, fnMap: Map<string, FunctionDef>, visited?: Set<string>): boolean;
+/**
+ * Check if an expression transitively references `request.time`. Walks
+ * subexpressions and follows user-defined function calls. Used by the
+ * REQUEST_TIME_NOT_PINNED lint rule (REBUILD_PLAN.md Item 0.F follow-up):
+ * a rule that reads `request.time` produces non-deterministic outcomes
+ * across CI runs unless the test pins `requestTime`.
+ *
+ * Matches both the dot form (`request.time`) — `memberAccess` whose
+ * object is the identifier `request` and property is `time` — and the
+ * bracket form (`request['time']`).
+ */
+export declare function referencesRequestTime(expr: Expression, fnMap: Map<string, FunctionDef>, visited?: Set<string>): boolean;
+/**
+ * Collect all functions from a match block and its children (recursive).
+ */
+export declare function collectAllFunctions(match: MatchBlock): FunctionDef[];
+/**
+ * Collect all allow rules from a match block and its children (recursive).
+ */
+export declare function collectAllRules(match: MatchBlock): {
+    rule: AllowRule;
+    path: string;
+    matchFunctions: FunctionDef[];
+}[];
+//# sourceMappingURL=ast-utils.d.ts.map

package/dist/rules/linter/ast-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-utils.d.ts","sourceRoot":"","sources":["../../../src/rules/linter/ast-utils.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAEjG;;;;;;;;;;;GAWG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAIlE;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,UAAU,GAAG;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAiC5E;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CA4C7D;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAsB9D;AAED;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CAAC,SAAS,EAAE,UAAU,GAAG,UAAU,CAKxE;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,SAAS,EAAE,WAAW,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAuC9E;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,cAAoB,GAAG,MAAM,CAU7G;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,EAAE,OAAO,cAAoB,GAAG,MAAM,CA6BxH;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAwBlG;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,EAAE,OAAO,cAAoB,GAAG,OAAO,CA2BzH;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,qBAAqB,CACnC,IAAI,EAAE,UAAU,EAChB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,EAC/B,OAAO,cAAoB,GAC1B,OAAO,CAsCT;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,UAAU,GAAG,WAAW,EAAE,CAMpE;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,UAAU,GAAG;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,cAAc,EAAE,WAAW,EAAE,CAAA;CAAE,EAAE,CAcrH"}