@j0hanz/filesystem-mcp 2.7.5 → 2.8.0

package/dist/core/schema.js.map

@@ -1 +1 @@
-{"version":3,"file":"schema.js","sourceRoot":"","sources":["../../src/core/schema.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAC7C,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAE7C,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC;KACzB,GAAG,CAAC,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC;KACnC,QAAQ,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC,CAAC;AAExC,MAAM,eAAe,GAAG,IAAI,CAAC;AAE7B,MAAM,aAAa,GAAG,QAAQ,CAAC;AAE/B,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,GAAW,EAAW,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC;AAEzE,SAAS,cAAc,CACrB,KAAa,EACb,QAA6C;IAE7C,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;QAClB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC;YACxB,CAAC,CAAC,GAAG,KAAK,qCAAqC;YAC/C,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAClB,CAAC,CAAC,GAAG,KAAK,4BAA4B;gBACtC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;oBACd,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,6BAA6B,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QACrF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,GAAG,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAED,gEAAgE;AAChE,sEAAsE;AACtE,+CAA+C;AAC/C,MAAM,mBAAmB,GAAG,CAAC,GAAW,EAAW,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;AAEzF,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC;KAC1B,MAAM,EAAE;KACR,GAAG,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC;KACpC,GAAG,CAAC,eAAe,EAAE,EAAE,OAAO,EAAE,sBAAsB,eAAe,SAAS,EAAE,CAAC;KACjF,WAAW,CACV,cAAc,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,CAC7B,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,oDAAoD,CAAC,CAAC,CAAC,SAAS,CAC5F,CACF;KACA,QAAQ,CAAC,0DAA0D,CAAC,CAAC;AAExE,MAAM,CAAC,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,EAAE,CAAC;AAEpD,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC;KAC7B,MAAM,EAAE;KACR,GAAG,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC;KACvC,GAAG,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,gBAAgB,EAAE,CAAC;KACxC,WAAW,CACV,cAAc,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,EAAE,CAChC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,qDAAqD,CAC1F,CACF;KACA,QAAQ,CAAC,8EAA8E,CAAC;KACxF,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,SAAS,EAAE,aAAa,EAAE,eAAe,CAAC,EAAE,CAAC,CAAC;AAEnE,MAAM,UAAU,iBAAiB,CAC/B,KAKC,EACD,GAAoB;IAEpB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC;IACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,KAAK,SAAS,CAAC;IAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,KAAK,SAAS,CAAC;IAE3C,IAAI,OAAO,IAAI,CAAC,QAAQ,IAAI,MAAM,CAAC,EAAE,CAAC;QACpC,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,MAAM,CAAC;YACd,OAAO,EACL,0GAA0G;YAC5G,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,IAAI,OAAO,IAAI,CAAC,OAAO,IAAI,QAAQ,IAAI,MAAM,CAAC,EAAE,CAAC;QAC/C,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,MAAM,CAAC;YACd,OAAO,EACL,iHAAiH;YACnH,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,IAAI,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACxB,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,SAAS,CAAC;YACjB,OAAO,EAAE,kEAAkE;YAC3E,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,MAAM,cAAc,GAAG,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC;IAC5C,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,GAAG,cAAc,EAAE,CAAC;QAClE,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,SAAS,CAAC;YACjB,OAAO,EAAE,kCAAkC;YAC3C,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,WAAmB;IACrD,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;AAC1D,CAAC;AAED,MAAM,CAAC,MAAM,aAAa,GAAG,mBAAmB,CAAC,wCAAwC,CAAC,CAAC;AAC3F,MAAM,CAAC,MAAM,cAAc,GAAG,mBAAmB,CAC/C,kDAAkD,CACnD,CAAC;AACF,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC;KACtB,MAAM,EAAE;KACR,GAAG,CAAC,CAAC,CAAC;KACN,GAAG,CAAC,gBAAgB,CAAC;KACrB,QAAQ,EAAE;KACV,QAAQ,CAAC,0EAA0E,CAAC,CAAC;AAExF,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAO/B,MAAM,UAAU,uBAAuB,CACrC,KAAa;IAEb,MAAM,KAAK,GAAkB;QAC3B,GAAG,KAAK;QACR,IAAI,EAAE,YAAY,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,iDAAiD,CAAC;QACzF,KAAK,EAAE,CAAC;aACL,KAAK,CAAC,YAAY,CAAC;aACnB,GAAG,CAAC,CAAC,CAAC;aACN,GAAG,CAAC,iBAAiB,CAAC;aACtB,QAAQ,EAAE;aACV,QAAQ,CACP,2CAA2C,MAAM,CAAC,iBAAiB,CAAC,iCAAiC,CACtG;KACJ,CAAC;IAEF,MAAM,IAAI,GAAG,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;QAC5D,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC;QAC5C,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC;QAE9C,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC1B,GAAG,CAAC,QAAQ,CAAC;gBACX,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,CAAC,MAAM,CAAC;gBACd,OAAO,EAAE,2CAA2C;gBACpD,KAAK,EAAE,KAAK;aACb,CAAC,CAAC;YACH,OAAO;QACT,CAAC;QACD,IAAI,OAAO,IAAI,QAAQ,EAAE,CAAC;YACxB,GAAG,CAAC,QAAQ,CAAC;gBACX,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,CAAC,OAAO,CAAC;gBACf,OAAO,EAAE,oCAAoC;gBAC7C,KAAK,EAAE,KAAK;aACb,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,6EAA6E;IAC7E,kEAAkE;IAClE,OAAO,IAAI,CAAC,IAAI,CAAC;QACf,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;KACzD,CAA4C,CAAC;AAChD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,wBAAwB,CAAC,IAIxC;IACC,IAAI,IAAI,CAAC,IAAI;QAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,IAAI,CAAC,KAAK;QAAE,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACvC,IAAI,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACrD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,0EAA0E;AAC1E,8EAA8E;AAC9E,6EAA6E;AAC7E,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;AAE7D,0EAA0E;AAC1E,MAAM,CAAC,MAAM,YAAY,GAAG,eAAe;KACxC,QAAQ,EAAE;KACV,QAAQ,CACP,uFAAuF;IACrF,2FAA2F,CAC9F,CAAC;AAEJ;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,KAAc;IACrC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC1F,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC3C,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACrD,IAAI,GAAG,KAAK,MAAM,CAAC,KAAK,CAAC,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7F,IAAI,IAAI,IAAI,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAsB,MAAS;IAClE,OAAO,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;QACjC,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACrC,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,GAAG,SAAS,CAAC;QACrB,CAAC;QACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC;QAC3F,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,OAAO,EACL,qDAAqD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa;gBACrF,qGAAqG;YACvG,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;QACH,OAAO,CAAC,CAAC,KAAK,CAAC;IACjB,CAAC,EAAE,MAAM,CAAC,CAAC;AACb,CAAC","sourcesContent":["import * as z from 'zod/v4';\n\nimport { isSafeGlobSyntax } from './glob.ts';\nimport { MAX_SEARCH_DEPTH } from './util.ts';\n\nexport const PositiveInt = z\n  .int({ message: 'Must be integer' })\n  .positive({ message: 'Must be > 0' });\n\nconst MAX_PATH_LENGTH = 4096;\n\nconst LINE_BREAK_RE = /[\\n\\r]/;\n\nexport const isBlank = (val: string): boolean => val.trim().length === 0;\n\nfunction refineSafeText(\n  label: string,\n  specific: (val: string) => string | undefined,\n): (val: string, ctx: z.RefinementCtx) => void {\n  return (val, ctx) => {\n    if (val.length === 0) return;\n    const issue = isBlank(val)\n      ? `${label} cannot be empty or whitespace-only`\n      : val.includes('\\0')\n        ? `${label} cannot contain null bytes`\n        : (specific(val) ??\n          (LINE_BREAK_RE.test(val) ? `${label} cannot contain line breaks` : undefined));\n    if (issue !== undefined) {\n      ctx.addIssue({ code: 'custom', message: issue, fatal: true });\n    }\n  };\n}\n\n// Only a whole `..` segment is traversal. `..` inside a segment\n// (`[...slug]`, `v1..2.md`) is a plain file name; PathGuard re-checks\n// containment on the resolved path regardless.\nconst hasTraversalSegment = (val: string): boolean => val.split(/[\\\\/]/u).includes('..');\n\nexport const RequiredPath = z\n  .string()\n  .min(1, { message: 'Path required' })\n  .max(MAX_PATH_LENGTH, { message: `Path too long (max ${MAX_PATH_LENGTH} chars)` })\n  .superRefine(\n    refineSafeText('Path', (val) =>\n      hasTraversalSegment(val) ? 'Directory traversal sequences (\"..\") are forbidden' : undefined,\n    ),\n  )\n  .describe('File or directory path inside an allowed workspace root.');\n\nexport const OptionalPath = RequiredPath.optional();\n\nexport const SafeGlobPattern = z\n  .string()\n  .min(1, { message: 'Pattern required' })\n  .max(1000, { message: 'Max 1000 chars' })\n  .superRefine(\n    refineSafeText('Pattern', (val) =>\n      isSafeGlobSyntax(val) ? undefined : 'Invalid glob or unsafe path (absolute/.. forbidden)',\n    ),\n  )\n  .describe('Relative glob pattern under the search root (e.g. \"**/*.ts\", \"src/**/*.js\").')\n  .meta({ examples: ['**/*.ts', 'src/**/*.js', '**/*.{ts,tsx}'] });\n\nexport function validateReadRange(\n  value: {\n    head?: number | undefined;\n    tail?: number | undefined;\n    startLine?: number | undefined;\n    endLine?: number | undefined;\n  },\n  ctx: z.RefinementCtx,\n): void {\n  const hasHead = value.head !== undefined;\n  const hasTail = value.tail !== undefined;\n  const hasStart = value.startLine !== undefined;\n  const hasEnd = value.endLine !== undefined;\n\n  if (hasHead && (hasStart || hasEnd)) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['head'],\n      message:\n        \"Cannot use 'head' with 'startLine'/'endLine'. Use either 'head' alone or 'startLine'/'endLine' together.\",\n      input: value,\n    });\n  }\n  if (hasTail && (hasHead || hasStart || hasEnd)) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['tail'],\n      message:\n        \"Cannot use 'tail' with 'head'/'startLine'/'endLine'. Use 'tail' alone, or 'startLine'/'endLine' without 'tail'.\",\n      input: value,\n    });\n  }\n  if (hasEnd && !hasStart) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['endLine'],\n      message: \"'endLine' requires 'startLine' to be set. Provide both together.\",\n      input: value,\n    });\n  }\n  const effectiveStart = value.startLine ?? 1;\n  if (value.endLine !== undefined && value.endLine < effectiveStart) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['endLine'],\n      message: \"'endLine' must be >= 'startLine'\",\n      input: value,\n    });\n  }\n}\n\nexport function defaultFalseBoolean(description: string): z.ZodDefault<z.ZodBoolean> {\n  return z.boolean().default(false).describe(description);\n}\n\nexport const IncludeHidden = defaultFalseBoolean('Include hidden items (starting with .)');\nexport const IncludeIgnored = defaultFalseBoolean(\n  'Include ignored items (node_modules, .git, etc).',\n);\nexport const MaxDepth = z\n  .uint32()\n  .min(0)\n  .max(MAX_SEARCH_DEPTH)\n  .optional()\n  .describe('Max directory depth to scan; 0 = base directory only, omit for unlimited');\n\nconst DEFAULT_MAX_BATCH = 1000;\n\nexport type SingleOrBatchShape<TExtra extends z.ZodRawShape> = TExtra & {\n  path: z.ZodOptional<typeof RequiredPath>;\n  paths: z.ZodOptional<z.ZodArray<typeof RequiredPath>>;\n};\n\nexport function singleOrBatchPathsInput<TExtra extends z.ZodRawShape>(\n  extra: TExtra,\n): z.ZodObject<SingleOrBatchShape<TExtra>> {\n  const shape: z.ZodRawShape = {\n    ...extra,\n    path: RequiredPath.optional().describe('Single file path; mutually exclusive with paths'),\n    paths: z\n      .array(RequiredPath)\n      .min(1)\n      .max(DEFAULT_MAX_BATCH)\n      .optional()\n      .describe(\n        `Array of file paths for batch mode (max ${String(DEFAULT_MAX_BATCH)}); mutually exclusive with path`,\n      ),\n  };\n\n  const base = z.strictObject(shape).superRefine((value, ctx) => {\n    const hasPath = value['path'] !== undefined;\n    const hasPaths = value['paths'] !== undefined;\n\n    if (!hasPath && !hasPaths) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['path'],\n        message: \"Either 'path' or 'paths' must be provided\",\n        input: value,\n      });\n      return;\n    }\n    if (hasPath && hasPaths) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['paths'],\n        message: \"Cannot use both 'path' and 'paths'\",\n        input: value,\n      });\n    }\n  });\n\n  // Mirror the superRefine above on the wire: exactly one input mode. `{}` and\n  // `path`+`paths` both fail this oneOf, matching the runtime rule.\n  return base.meta({\n    oneOf: [{ required: ['path'] }, { required: ['paths'] }],\n  }) as z.ZodObject<SingleOrBatchShape<TExtra>>;\n}\n\n/**\n * Extract the filesystem paths from a {@link singleOrBatchPathsInput} shape\n * (`{ path?, paths?, files?[{path}] }`) for the executor's access-grant\n * pre-check. Exactly one of the three is set (enforced by the schema's\n * superRefine), so they are checked in priority order.\n */\nexport function singleOrBatchAccessPaths(args: {\n  path?: string | undefined;\n  paths?: string[] | undefined;\n  files?: readonly { path: string }[] | undefined;\n}): string[] {\n  if (args.path) return [args.path];\n  if (args.paths) return [...args.paths];\n  if (args.files) return args.files.map((f) => f.path);\n  return [];\n}\n\n// ponytail: charset regex, not z.base64url() — the SDK's AJV warns on the\n// unknown `base64url` format; the server's own decode (cursor.ts) is the real\n// validation, so loosening the client-facing schema to the alphabet is safe.\nconst base64urlCursor = z.string().regex(/^[A-Za-z0-9_-]+$/);\n\n// Ships once per paginated tool — wording is budgeted (TOOL-SURFACE-002).\nexport const CursorSchema = base64urlCursor\n  .optional()\n  .describe(\n    'Opaque pagination cursor; pass unchanged for the next page. Pages slice one snapshot ' +\n      'taken on the first call; it expires after ~60s — re-request without a cursor if rejected.',\n  );\n\n/**\n * Reassembles tool arguments that a client JSON-serialized and then spread\n * into an object: `{ path }` arrives as `{ \"0\": \"{\", \"1\": \"\\\"\", … }`, one key\n * per UTF-16 code unit. Returns `undefined` for anything else. Integer keys\n * enumerate first in ascending order, so matching each key to its position\n * also proves the keys are exactly `\"0\"…\"n-1\"` with nothing else alongside.\n */\nfunction joinSplitString(value: unknown): string | undefined {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) return undefined;\n  const entries = Object.entries(value);\n  if (entries.length === 0) return undefined;\n  let text = '';\n  for (const [index, [key, char]] of entries.entries()) {\n    if (key !== String(index) || typeof char !== 'string' || char.length !== 1) return undefined;\n    text += char;\n  }\n  return text;\n}\n\n/**\n * Wraps a tool's input schema so a stringified-then-spread payload (see\n * {@link joinSplitString}) is parsed back into the object it encodes, and one\n * that does not encode an object fails with a message naming the cause rather\n * than `Unrecognized keys: \"0\", \"1\", …`. The published JSON Schema is the\n * wrapped schema's own: a preprocess step converts to its output side.\n */\nexport function withSplitArgsRecovery<T extends z.ZodType>(schema: T): z.ZodPreprocess<T> {\n  return z.preprocess((value, ctx) => {\n    const text = joinSplitString(value);\n    if (text === undefined) return value;\n    let parsed: unknown;\n    try {\n      parsed = JSON.parse(text);\n    } catch {\n      parsed = undefined;\n    }\n    if (typeof parsed === 'object' && parsed !== null && !Array.isArray(parsed)) return parsed;\n    ctx.addIssue({\n      code: 'custom',\n      message:\n        `arguments must be a JSON object, but arrived as a ${String(text.length)}-character ` +\n        'string split into indexed keys (the client serialized the payload); send the arguments as an object',\n      input: value,\n    });\n    return z.NEVER;\n  }, schema);\n}\n"]}
+{"version":3,"file":"schema.js","sourceRoot":"","sources":["../../src/core/schema.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,MAAM,WAAW,CAAC;AAC7F,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAE7C,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC;KACzB,GAAG,CAAC,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC;KACnC,QAAQ,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC,CAAC;AAExC,MAAM,eAAe,GAAG,IAAI,CAAC;AAE7B,MAAM,aAAa,GAAG,QAAQ,CAAC;AAE/B,MAAM,OAAO,GAAG,CAAC,GAAW,EAAW,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC;AAElE;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,KAAa;IAC1C,MAAM,OAAO,GAAG,GAAG,KAAK,qCAAqC,CAAC;IAC9D,OAAO,CAAC;SACL,MAAM,EAAE;SACR,GAAG,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;SAChC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;AACjD,CAAC;AAED,SAAS,cAAc,CACrB,KAAa,EACb,QAA6C;IAE7C,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;QAClB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC;YACxB,CAAC,CAAC,GAAG,KAAK,qCAAqC;YAC/C,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAClB,CAAC,CAAC,GAAG,KAAK,4BAA4B;gBACtC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;oBACd,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,6BAA6B,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QACrF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,GAAG,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAED,gEAAgE;AAChE,sEAAsE;AACtE,+CAA+C;AAC/C,MAAM,mBAAmB,GAAG,CAAC,GAAW,EAAW,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;AAEzF,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC;KAC1B,MAAM,EAAE;KACR,GAAG,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC;KACpC,GAAG,CAAC,eAAe,EAAE,EAAE,OAAO,EAAE,sBAAsB,eAAe,SAAS,EAAE,CAAC;KACjF,WAAW,CACV,cAAc,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,CAC7B,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,oDAAoD,CAAC,CAAC,CAAC,SAAS,CAC5F,CACF;KACA,QAAQ,CAAC,0DAA0D,CAAC,CAAC;AAExE,MAAM,CAAC,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,EAAE,CAAC;AAEpD,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC;KAC7B,MAAM,EAAE;KACR,GAAG,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC;KACvC,GAAG,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,gBAAgB,EAAE,CAAC;KACxC,WAAW,CACV,cAAc,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,EAAE,CAChC,gBAAgB,CAAC,GAAG,CAAC;IACnB,CAAC,CAAC,SAAS;IACX,CAAC,CAAC,+DAA+D,MAAM,CAAC,sBAAsB,CAAC,2BAA2B,MAAM,CAAC,sBAAsB,CAAC,8BAA8B,CACzL,CACF;KACA,QAAQ,CAAC,8EAA8E,CAAC;KACxF,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,SAAS,EAAE,aAAa,EAAE,eAAe,CAAC,EAAE,CAAC,CAAC;AAEnE,MAAM,UAAU,iBAAiB,CAC/B,KAKC,EACD,GAAoB;IAEpB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC;IACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,KAAK,SAAS,CAAC;IAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,KAAK,SAAS,CAAC;IAE3C,IAAI,OAAO,IAAI,CAAC,QAAQ,IAAI,MAAM,CAAC,EAAE,CAAC;QACpC,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,MAAM,CAAC;YACd,OAAO,EACL,0GAA0G;YAC5G,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,IAAI,OAAO,IAAI,CAAC,OAAO,IAAI,QAAQ,IAAI,MAAM,CAAC,EAAE,CAAC;QAC/C,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,MAAM,CAAC;YACd,OAAO,EACL,iHAAiH;YACnH,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,IAAI,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACxB,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,SAAS,CAAC;YACjB,OAAO,EAAE,kEAAkE;YAC3E,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,MAAM,cAAc,GAAG,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC;IAC5C,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,GAAG,cAAc,EAAE,CAAC;QAClE,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,SAAS,CAAC;YACjB,OAAO,EAAE,kCAAkC;YAC3C,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,WAAmB;IACrD,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;AAC1D,CAAC;AAED,MAAM,CAAC,MAAM,aAAa,GAAG,mBAAmB,CAAC,wCAAwC,CAAC,CAAC;AAC3F,MAAM,CAAC,MAAM,cAAc,GAAG,mBAAmB,CAC/C,kDAAkD,CACnD,CAAC;AACF,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC;KACtB,MAAM,EAAE;KACR,GAAG,CAAC,CAAC,CAAC;KACN,GAAG,CAAC,gBAAgB,CAAC;KACrB,QAAQ,EAAE;KACV,QAAQ,CAAC,0EAA0E,CAAC,CAAC;AAExF,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAO/B,MAAM,UAAU,uBAAuB,CACrC,KAAa;IAEb,MAAM,KAAK,GAAkB;QAC3B,GAAG,KAAK;QACR,IAAI,EAAE,YAAY,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,iDAAiD,CAAC;QACzF,KAAK,EAAE,CAAC;aACL,KAAK,CAAC,YAAY,CAAC;aACnB,GAAG,CAAC,CAAC,CAAC;aACN,GAAG,CAAC,iBAAiB,CAAC;aACtB,QAAQ,EAAE;aACV,QAAQ,CACP,2CAA2C,MAAM,CAAC,iBAAiB,CAAC,iCAAiC,CACtG;KACJ,CAAC;IAEF,MAAM,IAAI,GAAG,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;QAC5D,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC;QAC5C,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC;QAE9C,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC1B,GAAG,CAAC,QAAQ,CAAC;gBACX,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,CAAC,MAAM,CAAC;gBACd,OAAO,EAAE,2CAA2C;gBACpD,KAAK,EAAE,KAAK;aACb,CAAC,CAAC;YACH,OAAO;QACT,CAAC;QACD,IAAI,OAAO,IAAI,QAAQ,EAAE,CAAC;YACxB,GAAG,CAAC,QAAQ,CAAC;gBACX,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,CAAC,OAAO,CAAC;gBACf,OAAO,EAAE,oCAAoC;gBAC7C,KAAK,EAAE,KAAK;aACb,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,6EAA6E;IAC7E,kEAAkE;IAClE,OAAO,IAAI,CAAC,IAAI,CAAC;QACf,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;KACzD,CAA4C,CAAC;AAChD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,wBAAwB,CAAC,IAIxC;IACC,IAAI,IAAI,CAAC,IAAI;QAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,IAAI,CAAC,KAAK;QAAE,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACvC,IAAI,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACrD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,0EAA0E;AAC1E,8EAA8E;AAC9E,6EAA6E;AAC7E,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;AAE7D,0EAA0E;AAC1E,MAAM,CAAC,MAAM,YAAY,GAAG,eAAe;KACxC,QAAQ,EAAE;KACV,QAAQ,CACP,uFAAuF;IACrF,2FAA2F,CAC9F,CAAC;AAEJ;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,KAAc;IACrC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC1F,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC3C,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACrD,IAAI,GAAG,KAAK,MAAM,CAAC,KAAK,CAAC,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7F,IAAI,IAAI,IAAI,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAsB,MAAS;IAClE,OAAO,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;QACjC,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACrC,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,GAAG,SAAS,CAAC;QACrB,CAAC;QACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC;QAC3F,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,OAAO,EACL,qDAAqD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa;gBACrF,qGAAqG;YACvG,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;QACH,OAAO,CAAC,CAAC,KAAK,CAAC;IACjB,CAAC,EAAE,MAAM,CAAC,CAAC;AACb,CAAC","sourcesContent":["import * as z from 'zod/v4';\n\nimport { isSafeGlobSyntax, MAX_BRACE_ALTERNATIVES, MAX_DOTDOT_CHECK_CHARS } from './glob.ts';\nimport { MAX_SEARCH_DEPTH } from './util.ts';\n\nexport const PositiveInt = z\n  .int({ message: 'Must be integer' })\n  .positive({ message: 'Must be > 0' });\n\nconst MAX_PATH_LENGTH = 4096;\n\nconst LINE_BREAK_RE = /[\\n\\r]/;\n\nconst isBlank = (val: string): boolean => val.trim().length === 0;\n\n/**\n * Text that must carry non-blank content. `min(1)` stays so `minLength: 1`\n * still publishes on the wire; it aborts so an empty value reports one\n * message, not the same one twice.\n */\nexport function nonBlankString(label: string): z.ZodString {\n  const message = `${label} cannot be empty or whitespace-only`;\n  return z\n    .string()\n    .min(1, { message, abort: true })\n    .refine((val) => !isBlank(val), { message });\n}\n\nfunction refineSafeText(\n  label: string,\n  specific: (val: string) => string | undefined,\n): (val: string, ctx: z.RefinementCtx) => void {\n  return (val, ctx) => {\n    if (val.length === 0) return;\n    const issue = isBlank(val)\n      ? `${label} cannot be empty or whitespace-only`\n      : val.includes('\\0')\n        ? `${label} cannot contain null bytes`\n        : (specific(val) ??\n          (LINE_BREAK_RE.test(val) ? `${label} cannot contain line breaks` : undefined));\n    if (issue !== undefined) {\n      ctx.addIssue({ code: 'custom', message: issue, fatal: true });\n    }\n  };\n}\n\n// Only a whole `..` segment is traversal. `..` inside a segment\n// (`[...slug]`, `v1..2.md`) is a plain file name; PathGuard re-checks\n// containment on the resolved path regardless.\nconst hasTraversalSegment = (val: string): boolean => val.split(/[\\\\/]/u).includes('..');\n\nexport const RequiredPath = z\n  .string()\n  .min(1, { message: 'Path required' })\n  .max(MAX_PATH_LENGTH, { message: `Path too long (max ${MAX_PATH_LENGTH} chars)` })\n  .superRefine(\n    refineSafeText('Path', (val) =>\n      hasTraversalSegment(val) ? 'Directory traversal sequences (\"..\") are forbidden' : undefined,\n    ),\n  )\n  .describe('File or directory path inside an allowed workspace root.');\n\nexport const OptionalPath = RequiredPath.optional();\n\nexport const SafeGlobPattern = z\n  .string()\n  .min(1, { message: 'Pattern required' })\n  .max(1000, { message: 'Max 1000 chars' })\n  .superRefine(\n    refineSafeText('Pattern', (val) =>\n      isSafeGlobSyntax(val)\n        ? undefined\n        : `Invalid glob or unsafe path (absolute/.. forbidden, at most ${String(MAX_BRACE_ALTERNATIVES)} brace alternatives and ${String(MAX_DOTDOT_CHECK_CHARS)} traversal-check characters)`,\n    ),\n  )\n  .describe('Relative glob pattern under the search root (e.g. \"**/*.ts\", \"src/**/*.js\").')\n  .meta({ examples: ['**/*.ts', 'src/**/*.js', '**/*.{ts,tsx}'] });\n\nexport function validateReadRange(\n  value: {\n    head?: number | undefined;\n    tail?: number | undefined;\n    startLine?: number | undefined;\n    endLine?: number | undefined;\n  },\n  ctx: z.RefinementCtx,\n): void {\n  const hasHead = value.head !== undefined;\n  const hasTail = value.tail !== undefined;\n  const hasStart = value.startLine !== undefined;\n  const hasEnd = value.endLine !== undefined;\n\n  if (hasHead && (hasStart || hasEnd)) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['head'],\n      message:\n        \"Cannot use 'head' with 'startLine'/'endLine'. Use either 'head' alone or 'startLine'/'endLine' together.\",\n      input: value,\n    });\n  }\n  if (hasTail && (hasHead || hasStart || hasEnd)) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['tail'],\n      message:\n        \"Cannot use 'tail' with 'head'/'startLine'/'endLine'. Use 'tail' alone, or 'startLine'/'endLine' without 'tail'.\",\n      input: value,\n    });\n  }\n  if (hasEnd && !hasStart) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['endLine'],\n      message: \"'endLine' requires 'startLine' to be set. Provide both together.\",\n      input: value,\n    });\n  }\n  const effectiveStart = value.startLine ?? 1;\n  if (value.endLine !== undefined && value.endLine < effectiveStart) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['endLine'],\n      message: \"'endLine' must be >= 'startLine'\",\n      input: value,\n    });\n  }\n}\n\nexport function defaultFalseBoolean(description: string): z.ZodDefault<z.ZodBoolean> {\n  return z.boolean().default(false).describe(description);\n}\n\nexport const IncludeHidden = defaultFalseBoolean('Include hidden items (starting with .)');\nexport const IncludeIgnored = defaultFalseBoolean(\n  'Include ignored items (node_modules, .git, etc).',\n);\nexport const MaxDepth = z\n  .uint32()\n  .min(0)\n  .max(MAX_SEARCH_DEPTH)\n  .optional()\n  .describe('Max directory depth to scan; 0 = base directory only, omit for unlimited');\n\nconst DEFAULT_MAX_BATCH = 1000;\n\nexport type SingleOrBatchShape<TExtra extends z.ZodRawShape> = TExtra & {\n  path: z.ZodOptional<typeof RequiredPath>;\n  paths: z.ZodOptional<z.ZodArray<typeof RequiredPath>>;\n};\n\nexport function singleOrBatchPathsInput<TExtra extends z.ZodRawShape>(\n  extra: TExtra,\n): z.ZodObject<SingleOrBatchShape<TExtra>> {\n  const shape: z.ZodRawShape = {\n    ...extra,\n    path: RequiredPath.optional().describe('Single file path; mutually exclusive with paths'),\n    paths: z\n      .array(RequiredPath)\n      .min(1)\n      .max(DEFAULT_MAX_BATCH)\n      .optional()\n      .describe(\n        `Array of file paths for batch mode (max ${String(DEFAULT_MAX_BATCH)}); mutually exclusive with path`,\n      ),\n  };\n\n  const base = z.strictObject(shape).superRefine((value, ctx) => {\n    const hasPath = value['path'] !== undefined;\n    const hasPaths = value['paths'] !== undefined;\n\n    if (!hasPath && !hasPaths) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['path'],\n        message: \"Either 'path' or 'paths' must be provided\",\n        input: value,\n      });\n      return;\n    }\n    if (hasPath && hasPaths) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['paths'],\n        message: \"Cannot use both 'path' and 'paths'\",\n        input: value,\n      });\n    }\n  });\n\n  // Mirror the superRefine above on the wire: exactly one input mode. `{}` and\n  // `path`+`paths` both fail this oneOf, matching the runtime rule.\n  return base.meta({\n    oneOf: [{ required: ['path'] }, { required: ['paths'] }],\n  }) as z.ZodObject<SingleOrBatchShape<TExtra>>;\n}\n\n/**\n * Extract the filesystem paths from a {@link singleOrBatchPathsInput} shape\n * (`{ path?, paths?, files?[{path}] }`) for the executor's access-grant\n * pre-check. Exactly one of the three is set (enforced by the schema's\n * superRefine), so they are checked in priority order.\n */\nexport function singleOrBatchAccessPaths(args: {\n  path?: string | undefined;\n  paths?: string[] | undefined;\n  files?: readonly { path: string }[] | undefined;\n}): string[] {\n  if (args.path) return [args.path];\n  if (args.paths) return [...args.paths];\n  if (args.files) return args.files.map((f) => f.path);\n  return [];\n}\n\n// ponytail: charset regex, not z.base64url() — the SDK's AJV warns on the\n// unknown `base64url` format; the server's own decode (cursor.ts) is the real\n// validation, so loosening the client-facing schema to the alphabet is safe.\nconst base64urlCursor = z.string().regex(/^[A-Za-z0-9_-]+$/);\n\n// Ships once per paginated tool — wording is budgeted (TOOL-SURFACE-002).\nexport const CursorSchema = base64urlCursor\n  .optional()\n  .describe(\n    'Opaque pagination cursor; pass unchanged for the next page. Pages slice one snapshot ' +\n      'taken on the first call; it expires after ~60s — re-request without a cursor if rejected.',\n  );\n\n/**\n * Reassembles tool arguments that a client JSON-serialized and then spread\n * into an object: `{ path }` arrives as `{ \"0\": \"{\", \"1\": \"\\\"\", … }`, one key\n * per UTF-16 code unit. Returns `undefined` for anything else. Integer keys\n * enumerate first in ascending order, so matching each key to its position\n * also proves the keys are exactly `\"0\"…\"n-1\"` with nothing else alongside.\n */\nfunction joinSplitString(value: unknown): string | undefined {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) return undefined;\n  const entries = Object.entries(value);\n  if (entries.length === 0) return undefined;\n  let text = '';\n  for (const [index, [key, char]] of entries.entries()) {\n    if (key !== String(index) || typeof char !== 'string' || char.length !== 1) return undefined;\n    text += char;\n  }\n  return text;\n}\n\n/**\n * Wraps a tool's input schema so a stringified-then-spread payload (see\n * {@link joinSplitString}) is parsed back into the object it encodes, and one\n * that does not encode an object fails with a message naming the cause rather\n * than `Unrecognized keys: \"0\", \"1\", …`. The published JSON Schema is the\n * wrapped schema's own: a preprocess step converts to its output side.\n */\nexport function withSplitArgsRecovery<T extends z.ZodType>(schema: T): z.ZodPreprocess<T> {\n  return z.preprocess((value, ctx) => {\n    const text = joinSplitString(value);\n    if (text === undefined) return value;\n    let parsed: unknown;\n    try {\n      parsed = JSON.parse(text);\n    } catch {\n      parsed = undefined;\n    }\n    if (typeof parsed === 'object' && parsed !== null && !Array.isArray(parsed)) return parsed;\n    ctx.addIssue({\n      code: 'custom',\n      message:\n        `arguments must be a JSON object, but arrived as a ${String(text.length)}-character ` +\n        'string split into indexed keys (the client serialized the payload); send the arguments as an object',\n      input: value,\n    });\n    return z.NEVER;\n  }, schema);\n}\n"]}

package/dist/core/search.d.ts

@@ -12,6 +12,13 @@ interface SearchResult {
     after?: string[];
 }
 export type Regex = RE2;
+/**
+ * re2-wasm copies the whole input on every exec, so draining a dense pattern is
+ * O(matches x input) and fully synchronous: the loop pins and the tool's
+ * AbortSignal.timeout (a timer) can never fire. The returned `tick` yields a
+ * macrotask every ~10ms and reports whether `signal` has aborted.
+ */
+export declare function createYielder(signal: AbortSignal | undefined): () => Promise<boolean>;
 /**
  * Largest input one RE2 call may scan as a single string. The input is copied
  * into the same fixed 16 MB wasm heap as the patterns; about 10 MB of input

package/dist/core/search.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../src/core/search.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAC;AAIxC,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAU3C,UAAU,YAAY;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,4DAA4D;IAC5D,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,gFAAgF;IAChF,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,MAAM,MAAM,KAAK,GAAG,GAAG,CAAC;AAKxB;;;;GAIG;AACH,eAAO,MAAM,mBAAmB,QAAU,CAAC;AAO3C;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,YAAY,CAC1B,OAAO,EAAE,MAAM,EACf,OAAO,GAAE;IAAE,aAAa,CAAC,EAAE,OAAO,CAAC;IAAC,SAAS,CAAC,EAAE,OAAO,CAAA;CAAO,GAC7D,KAAK,CAWP;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,SAAS,GAAG,IAAI,CAOxD;AAED,MAAM,WAAW,UAAU;IACzB,wBAAwB;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,gEAAgE;IAChE,MAAM,EAAE,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC;IAC/B,2DAA2D;IAC3D,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,CAAC;IAC1C,gFAAgF;IAChF,KAAK,EAAE,MAAM,CAAC;IACd,uCAAuC;IACvC,GAAG,EAAE,MAAM,CAAC;CACb;AAOD;;;;;;;;;;;;;;;GAeG;AACH,wBAAiB,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC,UAAU,EAAE,SAAS,CAAC,CA2BzF;AAoBD,MAAM,WAAW,oBAAoB;IACnC,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,qFAAqF;IACrF,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,OAAO,EAAE;QACP;;;;WAIG;QACH,aAAa,EAAE,MAAM,CAAC;QACtB,YAAY,EAAE,MAAM,CAAC;QACrB,YAAY,EAAE,MAAM,CAAC;QACrB,SAAS,EAAE,OAAO,CAAC;QACnB,4DAA4D;QAC5D,mBAAmB,EAAE,MAAM,CAAC;QAC5B,4DAA4D;QAC5D,eAAe,EAAE,MAAM,CAAC;QACxB,8DAA8D;QAC9D,aAAa,EAAE,MAAM,CAAC;QACtB;;;;WAIG;QACH,aAAa,CAAC,EAAE,YAAY,GAAG,SAAS,CAAC;KAC1C,CAAC;CACH;AAqFD,wBAAsB,aAAa,CACjC,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,oBAAoB,EAC7B,SAAS,EAAE,SAAS,GACnB,OAAO,CAAC,oBAAoB,CAAC,CAyH/B;AAyCD,wBAAsB,WAAW,CAC/B,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE;IACP,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACzB,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB,EACD,SAAS,EAAE,SAAS,GACnB,OAAO,CAAC;IACT,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE;QAAE,IAAI,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAC5B,OAAO,EAAE;QACP,OAAO,EAAE,MAAM,CAAC;QAChB,YAAY,EAAE,MAAM,CAAC;QACrB,SAAS,EAAE,OAAO,CAAC;QACnB,mBAAmB,EAAE,MAAM,CAAC;QAC5B,qEAAqE;QACrE,aAAa,CAAC,EAAE,YAAY,GAAG,SAAS,CAAC;KAC1C,CAAC;CACH,CAAC,CA8CD"}
+{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../src/core/search.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAC;AAKxC,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAU3C,UAAU,YAAY;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,4DAA4D;IAC5D,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,gFAAgF;IAChF,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,MAAM,MAAM,KAAK,GAAG,GAAG,CAAC;AAKxB;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,WAAW,GAAG,SAAS,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,CAWrF;AAED;;;;GAIG;AACH,eAAO,MAAM,mBAAmB,QAAU,CAAC;AAO3C;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,YAAY,CAC1B,OAAO,EAAE,MAAM,EACf,OAAO,GAAE;IAAE,aAAa,CAAC,EAAE,OAAO,CAAC;IAAC,SAAS,CAAC,EAAE,OAAO,CAAA;CAAO,GAC7D,KAAK,CAWP;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,SAAS,GAAG,IAAI,CAOxD;AAED,MAAM,WAAW,UAAU;IACzB,wBAAwB;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,gEAAgE;IAChE,MAAM,EAAE,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC;IAC/B,2DAA2D;IAC3D,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,CAAC;IAC1C,gFAAgF;IAChF,KAAK,EAAE,MAAM,CAAC;IACd,uCAAuC;IACvC,GAAG,EAAE,MAAM,CAAC;CACb;AAOD;;;;;;;;;;;;;;;GAeG;AACH,wBAAiB,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC,UAAU,EAAE,SAAS,CAAC,CA2BzF;AAuBD,MAAM,WAAW,oBAAoB;IACnC,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,qFAAqF;IACrF,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,OAAO,EAAE;QACP;;;;WAIG;QACH,aAAa,EAAE,MAAM,CAAC;QACtB,YAAY,EAAE,MAAM,CAAC;QACrB,YAAY,EAAE,MAAM,CAAC;QACrB,SAAS,EAAE,OAAO,CAAC;QACnB,4DAA4D;QAC5D,mBAAmB,EAAE,MAAM,CAAC;QAC5B,4DAA4D;QAC5D,eAAe,EAAE,MAAM,CAAC;QACxB,8DAA8D;QAC9D,aAAa,EAAE,MAAM,CAAC;QACtB;;;;WAIG;QACH,aAAa,CAAC,EAAE,YAAY,GAAG,SAAS,CAAC;KAC1C,CAAC;CACH;AAwFD,wBAAsB,aAAa,CACjC,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,oBAAoB,EAC7B,SAAS,EAAE,SAAS,GACnB,OAAO,CAAC,oBAAoB,CAAC,CA6H/B;AAWD,wBAAsB,WAAW,CAC/B,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE;IACP,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACzB,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB,EACD,SAAS,EAAE,SAAS,GACnB,OAAO,CAAC;IACT,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE;QAAE,IAAI,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAC5B,OAAO,EAAE;QACP,OAAO,EAAE,MAAM,CAAC;QAChB,YAAY,EAAE,MAAM,CAAC;QACrB,SAAS,EAAE,OAAO,CAAC;QACnB,mBAAmB,EAAE,MAAM,CAAC;QAC5B,qEAAqE;QACrE,aAAa,CAAC,EAAE,YAAY,GAAG,SAAS,CAAC;KAC1C,CAAC;CACH,CAAC,CAkED"}

package/dist/core/search.js

@@ -1,7 +1,59 @@
-import { stat as fsStat, readFile } from 'node:fs/promises';
+var __addDisposableResource = (this && this.__addDisposableResource) || function (env, value, async) {
+    if (value !== null && value !== void 0) {
+        if (typeof value !== "object" && typeof value !== "function") throw new TypeError("Object expected.");
+        var dispose, inner;
+        if (async) {
+            if (!Symbol.asyncDispose) throw new TypeError("Symbol.asyncDispose is not defined.");
+            dispose = value[Symbol.asyncDispose];
+        }
+        if (dispose === void 0) {
+            if (!Symbol.dispose) throw new TypeError("Symbol.dispose is not defined.");
+            dispose = value[Symbol.dispose];
+            if (async) inner = dispose;
+        }
+        if (typeof dispose !== "function") throw new TypeError("Object not disposable.");
+        if (inner) dispose = function() { try { inner.call(this); } catch (e) { return Promise.reject(e); } };
+        env.stack.push({ value: value, dispose: dispose, async: async });
+    }
+    else if (async) {
+        env.stack.push({ async: true });
+    }
+    return value;
+};
+var __disposeResources = (this && this.__disposeResources) || (function (SuppressedError) {
+    return function (env) {
+        function fail(e) {
+            env.error = env.hasError ? new SuppressedError(e, env.error, "An error was suppressed during disposal.") : e;
+            env.hasError = true;
+        }
+        var r, s = 0;
+        function next() {
+            while (r = env.stack.pop()) {
+                try {
+                    if (!r.async && s === 1) return s = 0, env.stack.push(r), Promise.resolve().then(next);
+                    if (r.dispose) {
+                        var result = r.dispose.call(r.value);
+                        if (r.async) return s |= 2, Promise.resolve(result).then(next, function(e) { fail(e); return next(); });
+                    }
+                    else s |= 1;
+                }
+                catch (e) {
+                    fail(e);
+                }
+            }
+            if (s === 1) return env.hasError ? Promise.reject(env.error) : Promise.resolve();
+            if (env.hasError) throw env.error;
+        }
+        return next();
+    };
+})(typeof SuppressedError === "function" ? SuppressedError : function (error, suppressed, message) {
+    var e = new Error(message);
+    return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e;
+});
 import { basename } from 'node:path';
 import { RE2 } from '@adguard/re2-wasm';
 import { processEntriesConcurrently, resolveStopReason } from "./concurrency.js";
+import { GuardedFileSystem } from "./fs.js";
 import { globEntries } from "./glob.js";
 import { escapeRegExp, getMaxTextFileSize, MIB, PARALLEL_CONCURRENCY } from "./util.js";
 /**
@@ -12,6 +64,24 @@ import { escapeRegExp, getMaxTextFileSize, MIB, PARALLEL_CONCURRENCY } from "./u
 const own = (s) => Buffer.from(s, 'utf8').toString('utf8');
 /** Occurrence-counting bound, so one pathological line cannot spin forever. */
 const MAX_MATCHES_PER_LINE = 100_000;
+/**
+ * re2-wasm copies the whole input on every exec, so draining a dense pattern is
+ * O(matches x input) and fully synchronous: the loop pins and the tool's
+ * AbortSignal.timeout (a timer) can never fire. The returned `tick` yields a
+ * macrotask every ~10ms and reports whether `signal` has aborted.
+ */
+export function createYielder(signal) {
+    let last = Date.now();
+    return async () => {
+        if (Date.now() - last > 10) {
+            await new Promise((resolve) => {
+                setImmediate(resolve);
+            });
+            last = Date.now();
+        }
+        return signal?.aborted ?? false;
+    };
+}
 /**
  * Largest input one RE2 call may scan as a single string. The input is copied
  * into the same fixed 16 MB wasm heap as the patterns; about 10 MB of input
@@ -122,36 +192,43 @@ export function* execMatches(regex, text) {
  * Find non-overlapping occurrences of a global regex in a single line, reporting
  * the first match's column alongside the count.
  */
-function findLineMatches(regex, line) {
+async function findLineMatches(regex, line, tick) {
     let count = 0;
     let column = -1;
+    // Awaiting mid-drain is safe with a shared regex: execMatches re-writes
+    // lastIndex from its own match before every exec, with no await inside.
     for (const match of execMatches(regex, line)) {
         if (column === -1)
             column = match.start;
         count++;
-        if (count >= MAX_MATCHES_PER_LINE)
+        if (count >= MAX_MATCHES_PER_LINE || (await tick()))
             break;
     }
     return count > 0 ? { count, column } : undefined;
 }
 async function scanFile(entryPath, scanCtx) {
-    try {
-        await scanCtx.pathGuard.validateExistingPath(entryPath);
-    }
-    catch {
-        return { kind: 'inaccessible' };
-    }
-    try {
-        const stats = await fsStat(entryPath);
-        if (stats.size > scanCtx.maxFileSize)
-            return { kind: 'tooLarge' };
-    }
-    catch {
-        return { kind: 'inaccessible' };
-    }
     let buffer;
     try {
-        buffer = await readFile(entryPath, { signal: scanCtx.signal });
+        const env_1 = { stack: [], error: void 0, hasError: false };
+        try {
+            // open() validates, refuses a swapped final symlink (O_NOFOLLOW) and
+            // re-checks the descriptor's real path (H4), so these bytes are the
+            // validated file's, not whatever the name points at by now.
+            const handle = __addDisposableResource(env_1, await scanCtx.fs.open(entryPath), true);
+            const stats = await handle.stat();
+            if (stats.size > scanCtx.maxFileSize)
+                return { kind: 'tooLarge' };
+            buffer = await handle.readFile({ signal: scanCtx.signal });
+        }
+        catch (e_1) {
+            env_1.error = e_1;
+            env_1.hasError = true;
+        }
+        finally {
+            const result_1 = __disposeResources(env_1);
+            if (result_1)
+                await result_1;
+        }
     }
     catch (error) {
         if (scanCtx.signal?.aborted)
@@ -174,14 +251,25 @@ async function scanFile(entryPath, scanCtx) {
     // empty file splits into one empty element: neither is a line the
     // file has, for matching or for context.
     const lineCount = content.length === 0 ? 0 : content.endsWith('\n') ? lines.length - 1 : lines.length;
+    // A single line past RE2_MAX_INPUT_BYTES OOMs the wasm module for the rest of
+    // the process; report the file tooLarge instead. Only a buffer over the bound
+    // can hold such a line, so ordinary files skip the per-line measure.
+    const checkLineSize = buffer.length > RE2_MAX_INPUT_BYTES;
     const matches = [];
+    const tick = createYielder(scanCtx.signal);
     for (let i = 0; i < lineCount; i++) {
         const line = lines[i];
         if (line === undefined)
             continue;
+        if (checkLineSize && Buffer.byteLength(line, 'utf8') > RE2_MAX_INPUT_BYTES) {
+            return { kind: 'tooLarge' };
+        }
+        // Yield between lines too: millions of short lines never yield per-match.
+        if (await tick())
+            break;
         // One scan per line: the helper resets lastIndex itself, so it
         // doubles as the "does this line match" test.
-        const found = findLineMatches(scanCtx.regex, line);
+        const found = await findLineMatches(scanCtx.regex, line, tick);
         if (found) {
             matches.push({
                 file: entryPath,
@@ -204,19 +292,23 @@ async function scanFile(entryPath, scanCtx) {
 }
 export async function searchContent(directory, pattern, options, pathGuard) {
     const source = options.isRegex ? pattern || '' : escapeRegExp(pattern || '');
-    const regex = compileRegex(source, {
-        caseSensitive: Boolean(options.caseSensitive),
-    });
-    // Whole-buffer test: `m` makes ^/$ line-relative so a per-line hit is always a
-    // buffer hit (the converse can be false — a false positive just falls through
-    // to the per-line scan). \A/\z/\Z are buffer-relative even under `m`, inline
-    // flag groups can undo `m`, and $ cannot see past a \r, so those inputs skip
-    // the prefilter (see canPrefilter).
-    const prefilter = compileRegex(source, {
-        caseSensitive: Boolean(options.caseSensitive),
-        multiline: true,
-    });
+    // Compiles live inside the try so a failing second compile does not leak the
+    // first's wasm memory; freeRegex is null-safe.
+    let regex;
+    let prefilter;
     try {
+        regex = compileRegex(source, {
+            caseSensitive: Boolean(options.caseSensitive),
+        });
+        // Whole-buffer test: `m` makes ^/$ line-relative so a per-line hit is always a
+        // buffer hit (the converse can be false — a false positive just falls through
+        // to the per-line scan). \A/\z/\Z are buffer-relative even under `m`, inline
+        // flag groups can undo `m`, and $ cannot see past a \r, so those inputs skip
+        // the prefilter (see canPrefilter).
+        prefilter = compileRegex(source, {
+            caseSensitive: Boolean(options.caseSensitive),
+            multiline: true,
+        });
         const matches = [];
         const maxResults = options.maxResults ?? 100;
         const maxFileSize = getMaxTextFileSize();
@@ -243,7 +335,7 @@ export async function searchContent(directory, pattern, options, pathGuard) {
         let skippedTooLarge = 0;
         let skippedBinary = 0;
         const scanCtx = {
-            pathGuard,
+            fs: new GuardedFileSystem(pathGuard),
             signal: options.signal,
             maxFileSize,
             maxResults,
@@ -333,55 +425,51 @@ function canPrefilter(source, buffer) {
         return false;
     return true;
 }
-async function* guardedEntries(entries, pathGuard, signal, counters) {
+export async function searchFiles(directory, pattern, options, pathGuard) {
+    const maxResults = options.maxResults ?? 100;
+    const ceiling = pathGuard.allowedRootContaining(directory);
+    const entries = globEntries({
+        cwd: directory,
+        pattern,
+        baseNameMatch: true,
+        includeHidden: Boolean(options.includeHidden),
+        skipIgnored: Boolean(options.skipIgnored),
+        ...(ceiling !== undefined ? { ignoreCeiling: ceiling } : {}),
+        ...(options.signal ? { signal: options.signal } : {}),
+        ...(options.maxDepth !== undefined ? { maxDepth: options.maxDepth } : {}),
+        suppressErrors: true,
+    });
+    const results = [];
+    let filesScanned = 0;
+    let skippedInaccessible = 0;
+    let stoppedByAbort = false;
     // The signal carries both client cancellation and the tool's search timeout,
     // so an abort means "return what we have, marked incomplete" rather than
     // throw — but it must never be reported as a finished scan. The walk itself
     // throws when the signal stops it before a single entry is yielded.
     try {
         for await (const entry of entries) {
-            if (signal?.aborted) {
-                counters.stoppedByAbort = true;
-                return;
+            if (options.signal?.aborted) {
+                stoppedByAbort = true;
+                break;
             }
             try {
                 await pathGuard.validateExistingPath(entry.path);
             }
             catch {
-                counters.skippedInaccessible++;
+                skippedInaccessible++;
                 continue;
             }
-            yield entry;
+            if (results.length >= maxResults)
+                break;
+            filesScanned++;
+            results.push({ path: entry.path });
         }
     }
     catch (error) {
-        if (!signal?.aborted)
+        if (!options.signal?.aborted)
             throw error;
-        counters.stoppedByAbort = true;
-    }
-}
-export async function searchFiles(directory, pattern, options, pathGuard) {
-    const maxResults = options.maxResults ?? 100;
-    const ceiling = pathGuard.allowedRootContaining(directory);
-    const entries = globEntries({
-        cwd: directory,
-        pattern,
-        baseNameMatch: true,
-        includeHidden: Boolean(options.includeHidden),
-        skipIgnored: Boolean(options.skipIgnored),
-        ...(ceiling !== undefined ? { ignoreCeiling: ceiling } : {}),
-        ...(options.signal ? { signal: options.signal } : {}),
-        ...(options.maxDepth !== undefined ? { maxDepth: options.maxDepth } : {}),
-        suppressErrors: true,
-    });
-    const results = [];
-    let filesScanned = 0;
-    const counters = { skippedInaccessible: 0, stoppedByAbort: false };
-    for await (const entry of guardedEntries(entries, pathGuard, options.signal, counters)) {
-        if (results.length >= maxResults)
-            break;
-        filesScanned++;
-        results.push({ path: entry.path });
+        stoppedByAbort = true;
     }
     // Sorting — only name / path are supported; size / modified were removed
     // (the glob never collected stats, so they were always undefined).
@@ -392,7 +480,7 @@ export async function searchFiles(directory, pattern, options, pathGuard) {
         results.sort((a, b) => a.path.localeCompare(b.path));
     }
     // Same precedence as above: the result cap wins over a same-iteration abort.
-    const stoppedReason = resolveStopReason(results.length >= maxResults, counters.stoppedByAbort);
+    const stoppedReason = resolveStopReason(results.length >= maxResults, stoppedByAbort);
     return {
         basePath: directory,
         results,
@@ -400,7 +488,7 @@ export async function searchFiles(directory, pattern, options, pathGuard) {
             matched: results.length,
             filesScanned,
             truncated: stoppedReason !== undefined,
-            skippedInaccessible: counters.skippedInaccessible,
+            skippedInaccessible,
             ...(stoppedReason ? { stoppedReason } : {}),
         },
     };

package/dist/core/search.js.map

@@ -1 +1 @@
-{"version":3,"file":"search.js","sourceRoot":"","sources":["../../src/core/search.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,IAAI,MAAM,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5D,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAGrC,OAAO,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAC;AAExC,OAAO,EAAE,0BAA0B,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AACjF,OAAO,EAAE,WAAW,EAAkB,MAAM,WAAW,CAAC;AAExD,OAAO,EAAE,YAAY,EAAE,kBAAkB,EAAE,GAAG,EAAE,oBAAoB,EAAE,MAAM,WAAW,CAAC;AAExF;;;;GAIG;AACH,MAAM,GAAG,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;AAgB3E,+EAA+E;AAC/E,MAAM,oBAAoB,GAAG,OAAO,CAAC;AAErC;;;;GAIG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,GAAG,GAAG,CAAC;AAE3C,MAAM,gBAAgB,GAAG,UAAU,CAAC;AACpC,wFAAwF;AACxF,MAAM,eAAe,GAAG,qBAAqB,CAAC;AAC9C,MAAM,EAAE,GAAG,EAAE,CAAC;AAEd;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,YAAY,CAC1B,OAAe,EACf,UAA4D,EAAE;IAE9D,MAAM,KAAK,GAAG,IAAI,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACrF,IAAI,CAAC;QACH,OAAO,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,CAAC,CAAC,KAAK,YAAY,WAAW,CAAC;YAAE,MAAM,KAAK,CAAC;QACjD,MAAM,IAAI,WAAW,CACnB,GAAG,KAAK,CAAC,OAAO,iEAAiE,EACjF,EAAE,KAAK,EAAE,KAAK,EAAE,CACjB,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CAAC,KAAwB;IAChD,MAAM,MAAM,GAAI,KAAsE,EAAE,OAAO,CAAC;IAChG,IAAI,CAAC;QACH,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACrB,CAAC;IAAC,MAAM,CAAC;QACP,+DAA+D;IACjE,CAAC;AACH,CAAC;AAeD,qFAAqF;AACrF,MAAM,eAAe,GAAG,CAAC,IAAY,EAAU,EAAE;AAC/C,0MAA0M;AAC1M,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC;AAEnB;;;;;;;;;;;;;;;GAeG;AACH,MAAM,SAAS,CAAC,CAAC,WAAW,CAAC,KAAY,EAAE,IAAY;IACrD,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;IACpB,0EAA0E;IAC1E,0EAA0E;IAC1E,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,KAA0B,CAAC;IAC/B,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAC3C,OAAO,QAAQ,GAAG,KAAK,CAAC,KAAK,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACzD,MAAM,MAAM,GACV,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,KAAK,MAAM;gBAChD,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,MAAM,CAAC;YACvD,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,QAAQ,EAAE,CAAC;QACb,CAAC;QACD,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,SAAS,CAAC;QACxB,MAAM;YACJ,IAAI,EAAE,OAAO;YACb,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACtB,KAAK,EAAE,KAAK,CAAC,MAAM;YACnB,KAAK;YACL,GAAG,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM;SAC5B,CAAC;QACF,4EAA4E;QAC5E,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC;IACxF,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CACtB,KAAY,EACZ,IAAY;IAEZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;IAChB,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;QAC7C,IAAI,MAAM,KAAK,CAAC,CAAC;YAAE,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;QACxC,KAAK,EAAE,CAAC;QACR,IAAI,KAAK,IAAI,oBAAoB;YAAE,MAAM;IAC3C,CAAC;IACD,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;AACnD,CAAC;AAkED,KAAK,UAAU,QAAQ,CAAC,SAAiB,EAAE,OAAoB;IAC7D,IAAI,CAAC;QACH,MAAM,OAAO,CAAC,SAAS,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;IAC1D,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC;IAClC,CAAC;IAED,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,MAAM,CAAC,SAAS,CAAC,CAAC;QACtC,IAAI,KAAK,CAAC,IAAI,GAAG,OAAO,CAAC,WAAW;YAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;IACpE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC;IAClC,CAAC;IAED,IAAI,MAAc,CAAC;IACnB,IAAI,CAAC;QACH,MAAM,GAAG,MAAM,QAAQ,CAAC,SAAS,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IACjE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO;YAAE,MAAM,KAAK,CAAC;QACzC,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC;IAClC,CAAC;IAED,uEAAuE;IACvE,oEAAoE;IACpE,iDAAiD;IACjD,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;IAElD,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACzC,IAAI,YAAY,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;QACzC,OAAO,CAAC,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC;QAChC,IAAI,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI;YAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IACxF,CAAC;IAED,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACtC,sEAAsE;IACtE,kEAAkE;IAClE,yCAAyC;IACzC,MAAM,SAAS,GACb,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IACtF,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,+DAA+D;QAC/D,8CAA8C;QAC9C,MAAM,KAAK,GAAG,eAAe,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACnD,IAAI,KAAK,EAAE,CAAC;YACV,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,CAAC,GAAG,CAAC;gBACX,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC;gBAClB,UAAU,EAAE,KAAK,CAAC,KAAK;gBACvB,GAAG,CAAC,OAAO,CAAC,OAAO,GAAG,CAAC;oBACrB,CAAC,CAAC;wBACE,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;wBACjE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;qBACjF;oBACH,CAAC,CAAC,EAAE,CAAC;aACR,CAAC,CAAC;YACH,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,UAAU;gBAAE,MAAM;QAClD,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AACtC,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,SAAiB,EACjB,OAAe,EACf,OAA6B,EAC7B,SAAoB;IAEpB,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IAC7E,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,EAAE;QACjC,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;KAC9C,CAAC,CAAC;IACH,+EAA+E;IAC/E,8EAA8E;IAC9E,6EAA6E;IAC7E,6EAA6E;IAC7E,oCAAoC;IACpC,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,EAAE;QACrC,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;QAC7C,SAAS,EAAE,IAAI;KAChB,CAAC,CAAC;IACH,IAAI,CAAC;QACH,MAAM,OAAO,GAAmB,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC;QAC7C,MAAM,WAAW,GAAG,kBAAkB,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,SAAS,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;QAE3D,MAAM,OAAO,GAAG,OAAO,CAAC,YAAY;YAClC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,YAAY,EAAE,CAAC;YAClC,CAAC,CAAC,WAAW,CAAC;gBACV,GAAG,EAAE,SAAS;gBACd,OAAO,EAAE,OAAO,CAAC,WAAW,IAAI,MAAM;gBACtC,yEAAyE;gBACzE,uEAAuE;gBACvE,aAAa,EAAE,IAAI;gBACnB,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;gBAC7C,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC;gBACzC,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5D,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrD,GAAG,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzE,cAAc,EAAE,IAAI;aACrB,CAAC,CAAC;QAEP,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,MAAM,OAAO,GAAgB;YAC3B,SAAS;YACT,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,WAAW;YACX,UAAU;YACV,KAAK;YACL,SAAS;YACT,MAAM;YACN,OAAO;SACR,CAAC;QACF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC5C,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,MAAM,OAAO,GAAG,MAAM,0BAA0B,CAAC,OAAO,EAAE;YACxD,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,WAAW,EAAE,oBAAoB;YACjC,UAAU,EAAE,GAAG,EAAE,CAAC,SAAS,IAAI,UAAU;YACzC,OAAO,EAAE,GAAG,EAAE;gBACZ,UAAU,EAAE,CAAC;YACf,CAAC;YACD,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;YACxB,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE;gBAC5B,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC;gBAC7B,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;gBAChD,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBACzB,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;oBAAE,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;YAChE,CAAC;SACF,CAAC,CAAC;QAEH,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;gBAClB,KAAK,cAAc;oBACjB,mBAAmB,EAAE,CAAC;oBACtB,MAAM;gBACR,KAAK,UAAU;oBACb,eAAe,EAAE,CAAC;oBAClB,MAAM;gBACR,KAAK,QAAQ;oBACX,YAAY,EAAE,CAAC;oBACf,aAAa,EAAE,CAAC;oBAChB,MAAM;gBACR,KAAK,SAAS;oBACZ,YAAY,EAAE,CAAC;oBACf,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;wBAAE,YAAY,EAAE,CAAC;oBAC5C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;wBACjC,IAAI,OAAO,CAAC,MAAM,IAAI,UAAU;4BAAE,MAAM;wBACxC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBACpB,aAAa,EAAE,CAAC;oBAClB,CAAC;oBACD,MAAM;YACV,CAAC;QACH,CAAC;QAED,MAAM,aAAa,GAAG,iBAAiB,CACrC,OAAO,CAAC,MAAM,IAAI,UAAU,EAC5B,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAC1D,CAAC;QAEF,OAAO;YACL,QAAQ,EAAE,SAAS;YACnB,OAAO;YACP,OAAO,EAAE;gBACP,aAAa;gBACb,YAAY;gBACZ,YAAY;gBACZ,SAAS,EAAE,aAAa,KAAK,SAAS;gBACtC,mBAAmB;gBACnB,eAAe;gBACf,aAAa;gBACb,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC5C;SACF,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,SAAS,CAAC,SAAS,CAAC,CAAC;QACrB,SAAS,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED,uFAAuF;AACvF,SAAS,YAAY,CAAC,MAAc,EAAE,MAAc;IAClD,IAAI,MAAM,CAAC,MAAM,GAAG,mBAAmB;QAAE,OAAO,KAAK,CAAC;IACtD,IAAI,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC;QAAE,OAAO,KAAK,CAAC;IAChD,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC;QAAE,OAAO,KAAK,CAAC;IAC/C,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QAAE,OAAO,KAAK,CAAC;IAC9D,OAAO,IAAI,CAAC;AACd,CAAC;AAED,KAAK,SAAS,CAAC,CAAC,cAAc,CAC5B,OAAiC,EACjC,SAAoB,EACpB,MAA+B,EAC/B,QAAkE;IAElE,6EAA6E;IAC7E,yEAAyE;IACzE,4EAA4E;IAC5E,oEAAoE;IACpE,IAAI,CAAC;QACH,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAClC,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;gBACpB,QAAQ,CAAC,cAAc,GAAG,IAAI,CAAC;gBAC/B,OAAO;YACT,CAAC;YACD,IAAI,CAAC;gBACH,MAAM,SAAS,CAAC,oBAAoB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACnD,CAAC;YAAC,MAAM,CAAC;gBACP,QAAQ,CAAC,mBAAmB,EAAE,CAAC;gBAC/B,SAAS;YACX,CAAC;YACD,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,MAAM,KAAK,CAAC;QAClC,QAAQ,CAAC,cAAc,GAAG,IAAI,CAAC;IACjC,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,SAAiB,EACjB,OAAe,EACf,OAOC,EACD,SAAoB;IAapB,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC;IAC7C,MAAM,OAAO,GAAG,SAAS,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;IAC3D,MAAM,OAAO,GAAG,WAAW,CAAC;QAC1B,GAAG,EAAE,SAAS;QACd,OAAO;QACP,aAAa,EAAE,IAAI;QACnB,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;QAC7C,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC;QACzC,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5D,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACrD,GAAG,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACzE,cAAc,EAAE,IAAI;KACrB,CAAC,CAAC;IACH,MAAM,OAAO,GAAuB,EAAE,CAAC;IACvC,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,MAAM,QAAQ,GAAG,EAAE,mBAAmB,EAAE,CAAC,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC;IAEnE,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,cAAc,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC;QACvF,IAAI,OAAO,CAAC,MAAM,IAAI,UAAU;YAAE,MAAM;QACxC,YAAY,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACrC,CAAC;IAED,yEAAyE;IACzE,mEAAmE;IACnE,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QAC9B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3E,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,6EAA6E;IAC7E,MAAM,aAAa,GAAG,iBAAiB,CAAC,OAAO,CAAC,MAAM,IAAI,UAAU,EAAE,QAAQ,CAAC,cAAc,CAAC,CAAC;IAE/F,OAAO;QACL,QAAQ,EAAE,SAAS;QACnB,OAAO;QACP,OAAO,EAAE;YACP,OAAO,EAAE,OAAO,CAAC,MAAM;YACvB,YAAY;YACZ,SAAS,EAAE,aAAa,KAAK,SAAS;YACtC,mBAAmB,EAAE,QAAQ,CAAC,mBAAmB;YACjD,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC5C;KACF,CAAC;AACJ,CAAC","sourcesContent":["import { stat as fsStat, readFile } from 'node:fs/promises';\nimport { basename } from 'node:path';\n\nimport type { RE2ExecArray } from '@adguard/re2-wasm';\nimport { RE2 } from '@adguard/re2-wasm';\n\nimport { processEntriesConcurrently, resolveStopReason } from './concurrency.ts';\nimport { globEntries, type GlobEntry } from './glob.ts';\nimport type { PathGuard } from './path.ts';\nimport { escapeRegExp, getMaxTextFileSize, MIB, PARALLEL_CONCURRENCY } from './util.ts';\n\n/**\n * A fresh, flat copy of `s`. V8 keeps a substring of a long string as a slice\n * that references its parent, so a kept line would otherwise pin the whole\n * file's text for as long as the match list lives (60 s in the page store).\n */\nconst own = (s: string): string => Buffer.from(s, 'utf8').toString('utf8');\n\ninterface SearchResult {\n  file: string;\n  line: number;\n  /** 0-indexed column of the first occurrence on the line. */\n  column: number;\n  content: string;\n  matchCount: number;\n  /** Up to `context` lines either side of the match; absent when context is 0. */\n  before?: string[];\n  after?: string[];\n}\n\nexport type Regex = RE2;\n\n/** Occurrence-counting bound, so one pathological line cannot spin forever. */\nconst MAX_MATCHES_PER_LINE = 100_000;\n\n/**\n * Largest input one RE2 call may scan as a single string. The input is copied\n * into the same fixed 16 MB wasm heap as the patterns; about 10 MB of input\n * aborts the module. 4 MiB leaves room for the copy and the pattern set.\n */\nexport const RE2_MAX_INPUT_BYTES = 4 * MIB;\n\nconst BUFFER_ANCHOR_RE = /\\\\[AzZ]/u;\n/** `(?i)`, `(?-m)`, `(?s:…)`: inline flags can undo the `m` the prefilter relies on. */\nconst INLINE_FLAGS_RE = /\\(\\?[a-zA-Z-]+[:)]/u;\nconst CR = 13;\n\n/**\n * Compile a pattern on RE2 rather than on V8's irregexp.\n *\n * Patterns arrive from the MCP client, so a backtracking engine would let one\n * request pin the event loop with no way out: an abort signal cannot preempt a\n * synchronous `exec`, and on stdio that wedges the whole server. RE2 matches in\n * time linear in the input and cannot backtrack at all, so the hazard is gone\n * rather than bounded.\n *\n * RE2 rejects the constructs the tool schema documents as unsupported —\n * lookahead, lookbehind, backreferences — with its own {@link SyntaxError},\n * which the tool layer turns into a normal tool error. It always matches in\n * Unicode mode and requires the `u` flag to say so.\n *\n * Every compiled pattern owns memory in re2-wasm's fixed 16 MB heap, which\n * `ALLOW_MEMORY_GROWTH` is off for. re2-wasm never frees it and a\n * FinalizationRegistry does not keep up (V8 sees no pressure from the wasm\n * heap), so exhaustion is an emscripten `abort()` that kills regex search for\n * the rest of the process. Every caller MUST pass the result to\n * {@link freeRegex} when it is done with it.\n */\nexport function compileRegex(\n  pattern: string,\n  options: { caseSensitive?: boolean; multiline?: boolean } = {},\n): Regex {\n  const flags = `g${options.multiline ? 'm' : ''}${options.caseSensitive ? '' : 'i'}u`;\n  try {\n    return new RE2(pattern, flags);\n  } catch (error) {\n    if (!(error instanceof SyntaxError)) throw error;\n    throw new SyntaxError(\n      `${error.message} — lookahead, lookbehind, and backreferences are not supported.`,\n      { cause: error },\n    );\n  }\n}\n\n/**\n * Release a compiled pattern's wasm memory. re2-wasm exposes no disposal of its\n * own, so this reaches the embind handle it holds privately; a version that\n * renames the field degrades to the pre-existing leak rather than throwing.\n * Idempotent — a second call on an already-freed handle is swallowed. Using a\n * {@link Regex} after freeing it is undefined behaviour in the wasm heap, so\n * free only in a `finally` that owns the compile.\n */\nexport function freeRegex(regex: Regex | undefined): void {\n  const handle = (regex as unknown as { wrapper?: { delete?: () => void } } | undefined)?.wrapper;\n  try {\n    handle?.delete?.();\n  } catch {\n    // already deleted, or a re2-wasm build without embind disposal\n  }\n}\n\nexport interface RegexMatch {\n  /** The matched text. */\n  text: string;\n  /** Capture groups, 1-indexed in the pattern, 0-indexed here. */\n  groups: (string | undefined)[];\n  /** Named capture groups, when the pattern declares any. */\n  named: Record<string, string> | undefined;\n  /** Start offset in UTF-16 code units — usable with `String.prototype.slice`. */\n  start: number;\n  /** End offset in UTF-16 code units. */\n  end: number;\n}\n\n/** Code-point length of `text`, i.e. its UTF-16 length minus its surrogate pairs. */\nconst codePointLength = (text: string): number =>\n  // eslint-disable-next-line @typescript-eslint/no-misused-spread -- code points are the intended unit (re2-wasm offsets count code points); grapheme segmentation would change the count, not preserve it.\n  [...text].length;\n\n/**\n * Iterate a global pattern's non-overlapping matches with offsets JS can use.\n *\n * re2-wasm reports `index` and `lastIndex` in **code points**, while every JS\n * string operation indexes in UTF-16 code units. The two agree only until the\n * first astral character (most emoji), past which every offset is short by one\n * per surrogate pair — slicing on the raw index cuts into the middle of\n * neighbouring text. Its `lastIndex` bookkeeping is worse still: it adds the\n * match's UTF-16 length to a code-point index, so an astral character inside a\n * match can skip the next one. This is the single place that corrects both; no\n * caller should read `match.index` or `regex.lastIndex` directly.\n *\n * Zero-length matches (e.g. `a*`) advance by one code point so they cannot loop\n * forever. The regex is global and shared across calls, so `lastIndex` is reset\n * on entry.\n */\nexport function* execMatches(regex: Regex, text: string): Generator<RegexMatch, undefined> {\n  regex.lastIndex = 0;\n  // Cursor into `text`, carried forward across matches: RE2 reports them in\n  // ascending order, so the walk is O(text) in total rather than per match.\n  let cursorCp = 0;\n  let cursorU16 = 0;\n  let match: RE2ExecArray | null;\n  while ((match = regex.exec(text)) !== null) {\n    while (cursorCp < match.index && cursorU16 < text.length) {\n      const isPair =\n        (text.charCodeAt(cursorU16) & 0xfc00) === 0xd800 &&\n        (text.charCodeAt(cursorU16 + 1) & 0xfc00) === 0xdc00;\n      cursorU16 += isPair ? 2 : 1;\n      cursorCp++;\n    }\n    const matched = match[0] ?? '';\n    const start = cursorU16;\n    yield {\n      text: matched,\n      groups: match.slice(1),\n      named: match.groups,\n      start,\n      end: start + matched.length,\n    };\n    // Own the advance rather than trusting the wrapper's mixed-unit arithmetic.\n    regex.lastIndex = match.index + (matched.length === 0 ? 1 : codePointLength(matched));\n  }\n}\n\n/**\n * Find non-overlapping occurrences of a global regex in a single line, reporting\n * the first match's column alongside the count.\n */\nfunction findLineMatches(\n  regex: Regex,\n  line: string,\n): { count: number; column: number } | undefined {\n  let count = 0;\n  let column = -1;\n  for (const match of execMatches(regex, line)) {\n    if (column === -1) column = match.start;\n    count++;\n    if (count >= MAX_MATCHES_PER_LINE) break;\n  }\n  return count > 0 ? { count, column } : undefined;\n}\n\nexport interface SearchContentOptions {\n  caseSensitive?: boolean;\n  isRegex?: boolean;\n  maxResults?: number;\n  filePattern?: string;\n  skipIgnored?: boolean;\n  includeHidden?: boolean;\n  maxDepth?: number;\n  /**\n   * Search exactly this file (absolute, already guard-validated) instead of\n   * walking `directory` with `filePattern`. Set when the caller named a file:\n   * its name must not be interpreted as a glob.\n   */\n  explicitFile?: string;\n  /** Lines of context to carry either side of each match; 0 (default) carries none. */\n  context?: number;\n  signal?: AbortSignal;\n}\n\nexport interface SearchContentOutcome {\n  basePath: string;\n  matches: SearchResult[];\n  summary: {\n    /**\n     * Matching *lines*, one per entry in `matches` — not pattern occurrences.\n     * A line with three occurrences counts once here and reports 3 in its own\n     * `SearchResult.matchCount`.\n     */\n    matchingLines: number;\n    filesScanned: number;\n    filesMatched: number;\n    truncated: boolean;\n    /** Files the guard rejected or that could not be stat'd. */\n    skippedInaccessible: number;\n    /** Files skipped unread because they exceed maxFileSize. */\n    skippedTooLarge: number;\n    /** Files skipped because they contain a NUL byte (binary). */\n    skippedBinary: number;\n    /**\n     * `StoppedReason` narrowed to the stops these scans can produce: both\n     * resolve the stop through `resolveStopReason` (concurrency.ts) — never\n     * `maxFiles`, which belongs to `replace_text`'s per-file cap.\n     */\n    stoppedReason?: 'maxResults' | 'timeout';\n  };\n}\n\ntype FileScan =\n  | { kind: 'inaccessible' }\n  | { kind: 'tooLarge' }\n  | { kind: 'binary' }\n  | { kind: 'scanned'; matches: SearchResult[] };\n\ninterface ScanContext {\n  pathGuard: PathGuard;\n  signal: AbortSignal | undefined;\n  maxFileSize: number;\n  maxResults: number;\n  regex: Regex;\n  prefilter: Regex;\n  source: string;\n  context: number;\n}\n\nasync function scanFile(entryPath: string, scanCtx: ScanContext): Promise<FileScan> {\n  try {\n    await scanCtx.pathGuard.validateExistingPath(entryPath);\n  } catch {\n    return { kind: 'inaccessible' };\n  }\n\n  try {\n    const stats = await fsStat(entryPath);\n    if (stats.size > scanCtx.maxFileSize) return { kind: 'tooLarge' };\n  } catch {\n    return { kind: 'inaccessible' };\n  }\n\n  let buffer: Buffer;\n  try {\n    buffer = await readFile(entryPath, { signal: scanCtx.signal });\n  } catch (error) {\n    if (scanCtx.signal?.aborted) throw error;\n    return { kind: 'inaccessible' };\n  }\n\n  // A NUL byte marks a binary file, as it does for `read` and `grep -I`.\n  // Non-UTF-8 text is still searched: a lossy decode only affects the\n  // bytes a pattern could not have matched anyway.\n  if (buffer.includes(0)) return { kind: 'binary' };\n\n  const content = buffer.toString('utf-8');\n  if (canPrefilter(scanCtx.source, buffer)) {\n    scanCtx.prefilter.lastIndex = 0;\n    if (scanCtx.prefilter.exec(content) === null) return { kind: 'scanned', matches: [] };\n  }\n\n  const lines = content.split(/\\r?\\n/u);\n  // A trailing newline splits into a phantom empty last element, and an\n  // empty file splits into one empty element: neither is a line the\n  // file has, for matching or for context.\n  const lineCount =\n    content.length === 0 ? 0 : content.endsWith('\\n') ? lines.length - 1 : lines.length;\n  const matches: SearchResult[] = [];\n  for (let i = 0; i < lineCount; i++) {\n    const line = lines[i];\n    if (line === undefined) continue;\n    // One scan per line: the helper resets lastIndex itself, so it\n    // doubles as the \"does this line match\" test.\n    const found = findLineMatches(scanCtx.regex, line);\n    if (found) {\n      matches.push({\n        file: entryPath,\n        line: i + 1,\n        column: found.column,\n        content: own(line),\n        matchCount: found.count,\n        ...(scanCtx.context > 0\n          ? {\n              before: lines.slice(Math.max(0, i - scanCtx.context), i).map(own),\n              after: lines.slice(i + 1, Math.min(lineCount, i + 1 + scanCtx.context)).map(own),\n            }\n          : {}),\n      });\n      if (matches.length >= scanCtx.maxResults) break;\n    }\n  }\n  return { kind: 'scanned', matches };\n}\n\nexport async function searchContent(\n  directory: string,\n  pattern: string,\n  options: SearchContentOptions,\n  pathGuard: PathGuard,\n): Promise<SearchContentOutcome> {\n  const source = options.isRegex ? pattern || '' : escapeRegExp(pattern || '');\n  const regex = compileRegex(source, {\n    caseSensitive: Boolean(options.caseSensitive),\n  });\n  // Whole-buffer test: `m` makes ^/$ line-relative so a per-line hit is always a\n  // buffer hit (the converse can be false — a false positive just falls through\n  // to the per-line scan). \\A/\\z/\\Z are buffer-relative even under `m`, inline\n  // flag groups can undo `m`, and $ cannot see past a \\r, so those inputs skip\n  // the prefilter (see canPrefilter).\n  const prefilter = compileRegex(source, {\n    caseSensitive: Boolean(options.caseSensitive),\n    multiline: true,\n  });\n  try {\n    const matches: SearchResult[] = [];\n    const maxResults = options.maxResults ?? 100;\n    const maxFileSize = getMaxTextFileSize();\n    const context = options.context ?? 0;\n    const ceiling = pathGuard.allowedRootContaining(directory);\n\n    const entries = options.explicitFile\n      ? [{ path: options.explicitFile }]\n      : globEntries({\n          cwd: directory,\n          pattern: options.filePattern ?? '**/*',\n          // Same rule as replace_text, so a search with the same glob previews the\n          // files a replace would touch: a slash-free glob matches at any depth.\n          baseNameMatch: true,\n          includeHidden: Boolean(options.includeHidden),\n          skipIgnored: Boolean(options.skipIgnored),\n          ...(ceiling !== undefined ? { ignoreCeiling: ceiling } : {}),\n          ...(options.signal ? { signal: options.signal } : {}),\n          ...(options.maxDepth !== undefined ? { maxDepth: options.maxDepth } : {}),\n          suppressErrors: true,\n        });\n\n    let filesScanned = 0;\n    let filesMatched = 0;\n    let matchingLines = 0;\n    let skippedTooLarge = 0;\n    let skippedBinary = 0;\n    const scanCtx: ScanContext = {\n      pathGuard,\n      signal: options.signal,\n      maxFileSize,\n      maxResults,\n      regex,\n      prefilter,\n      source,\n      context,\n    };\n    const perFile = new Map<number, FileScan>();\n    let dispatched = 0;\n    let collected = 0;\n    const stopped = await processEntriesConcurrently(entries, {\n      signal: options.signal,\n      concurrency: PARALLEL_CONCURRENCY,\n      shouldStop: () => collected >= maxResults,\n      onEntry: () => {\n        dispatched++;\n      },\n      onError: () => undefined,\n      runEntry: async (entryPath) => {\n        const index = dispatched - 1;\n        const scan = await scanFile(entryPath, scanCtx);\n        perFile.set(index, scan);\n        if (scan.kind === 'scanned') collected += scan.matches.length;\n      },\n    });\n\n    let skippedInaccessible = 0;\n    for (let i = 0; i < dispatched; i++) {\n      const scan = perFile.get(i);\n      if (!scan) continue;\n      switch (scan.kind) {\n        case 'inaccessible':\n          skippedInaccessible++;\n          break;\n        case 'tooLarge':\n          skippedTooLarge++;\n          break;\n        case 'binary':\n          filesScanned++;\n          skippedBinary++;\n          break;\n        case 'scanned':\n          filesScanned++;\n          if (scan.matches.length > 0) filesMatched++;\n          for (const match of scan.matches) {\n            if (matches.length >= maxResults) break;\n            matches.push(match);\n            matchingLines++;\n          }\n          break;\n      }\n    }\n\n    const stoppedReason = resolveStopReason(\n      matches.length >= maxResults,\n      stopped === 'timeout' || Boolean(options.signal?.aborted),\n    );\n\n    return {\n      basePath: directory,\n      matches,\n      summary: {\n        matchingLines,\n        filesScanned,\n        filesMatched,\n        truncated: stoppedReason !== undefined,\n        skippedInaccessible,\n        skippedTooLarge,\n        skippedBinary,\n        ...(stoppedReason ? { stoppedReason } : {}),\n      },\n    };\n  } finally {\n    freeRegex(prefilter);\n    freeRegex(regex);\n  }\n}\n\n/** Whether one whole-buffer RE2 test is a sound \"cannot match\" check for this file. */\nfunction canPrefilter(source: string, buffer: Buffer): boolean {\n  if (buffer.length > RE2_MAX_INPUT_BYTES) return false;\n  if (BUFFER_ANCHOR_RE.test(source)) return false;\n  if (INLINE_FLAGS_RE.test(source)) return false;\n  if (source.includes('$') && buffer.includes(CR)) return false;\n  return true;\n}\n\nasync function* guardedEntries(\n  entries: AsyncIterable<GlobEntry>,\n  pathGuard: PathGuard,\n  signal: AbortSignal | undefined,\n  counters: { skippedInaccessible: number; stoppedByAbort: boolean },\n): AsyncGenerator<GlobEntry> {\n  // The signal carries both client cancellation and the tool's search timeout,\n  // so an abort means \"return what we have, marked incomplete\" rather than\n  // throw — but it must never be reported as a finished scan. The walk itself\n  // throws when the signal stops it before a single entry is yielded.\n  try {\n    for await (const entry of entries) {\n      if (signal?.aborted) {\n        counters.stoppedByAbort = true;\n        return;\n      }\n      try {\n        await pathGuard.validateExistingPath(entry.path);\n      } catch {\n        counters.skippedInaccessible++;\n        continue;\n      }\n      yield entry;\n    }\n  } catch (error) {\n    if (!signal?.aborted) throw error;\n    counters.stoppedByAbort = true;\n  }\n}\n\nexport async function searchFiles(\n  directory: string,\n  pattern: string,\n  options: {\n    maxResults?: number;\n    includeHidden?: boolean;\n    sortBy?: 'name' | 'path';\n    skipIgnored?: boolean;\n    maxDepth?: number;\n    signal?: AbortSignal;\n  },\n  pathGuard: PathGuard,\n): Promise<{\n  basePath: string;\n  results: { path: string }[];\n  summary: {\n    matched: number;\n    filesScanned: number;\n    truncated: boolean;\n    skippedInaccessible: number;\n    /** Narrowed like SearchContentOutcome's — scans never `maxFiles`. */\n    stoppedReason?: 'maxResults' | 'timeout';\n  };\n}> {\n  const maxResults = options.maxResults ?? 100;\n  const ceiling = pathGuard.allowedRootContaining(directory);\n  const entries = globEntries({\n    cwd: directory,\n    pattern,\n    baseNameMatch: true,\n    includeHidden: Boolean(options.includeHidden),\n    skipIgnored: Boolean(options.skipIgnored),\n    ...(ceiling !== undefined ? { ignoreCeiling: ceiling } : {}),\n    ...(options.signal ? { signal: options.signal } : {}),\n    ...(options.maxDepth !== undefined ? { maxDepth: options.maxDepth } : {}),\n    suppressErrors: true,\n  });\n  const results: { path: string }[] = [];\n  let filesScanned = 0;\n  const counters = { skippedInaccessible: 0, stoppedByAbort: false };\n\n  for await (const entry of guardedEntries(entries, pathGuard, options.signal, counters)) {\n    if (results.length >= maxResults) break;\n    filesScanned++;\n    results.push({ path: entry.path });\n  }\n\n  // Sorting — only name / path are supported; size / modified were removed\n  // (the glob never collected stats, so they were always undefined).\n  if (options.sortBy === 'name') {\n    results.sort((a, b) => basename(a.path).localeCompare(basename(b.path)));\n  } else {\n    results.sort((a, b) => a.path.localeCompare(b.path));\n  }\n\n  // Same precedence as above: the result cap wins over a same-iteration abort.\n  const stoppedReason = resolveStopReason(results.length >= maxResults, counters.stoppedByAbort);\n\n  return {\n    basePath: directory,\n    results,\n    summary: {\n      matched: results.length,\n      filesScanned,\n      truncated: stoppedReason !== undefined,\n      skippedInaccessible: counters.skippedInaccessible,\n      ...(stoppedReason ? { stoppedReason } : {}),\n    },\n  };\n}\n"]}
+{"version":3,"file":"search.js","sourceRoot":"","sources":["../../src/core/search.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAGrC,OAAO,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAC;AAExC,OAAO,EAAE,0BAA0B,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AACjF,OAAO,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAExC,OAAO,EAAE,YAAY,EAAE,kBAAkB,EAAE,GAAG,EAAE,oBAAoB,EAAE,MAAM,WAAW,CAAC;AAExF;;;;GAIG;AACH,MAAM,GAAG,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;AAgB3E,+EAA+E;AAC/E,MAAM,oBAAoB,GAAG,OAAO,CAAC;AAErC;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,MAA+B;IAC3D,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACtB,OAAO,KAAK,IAAI,EAAE;QAChB,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,EAAE,EAAE,CAAC;YAC3B,MAAM,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC5B,YAAY,CAAC,OAAO,CAAC,CAAC;YACxB,CAAC,CAAC,CAAC;YACH,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACpB,CAAC;QACD,OAAO,MAAM,EAAE,OAAO,IAAI,KAAK,CAAC;IAClC,CAAC,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,GAAG,GAAG,CAAC;AAE3C,MAAM,gBAAgB,GAAG,UAAU,CAAC;AACpC,wFAAwF;AACxF,MAAM,eAAe,GAAG,qBAAqB,CAAC;AAC9C,MAAM,EAAE,GAAG,EAAE,CAAC;AAEd;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,YAAY,CAC1B,OAAe,EACf,UAA4D,EAAE;IAE9D,MAAM,KAAK,GAAG,IAAI,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACrF,IAAI,CAAC;QACH,OAAO,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,CAAC,CAAC,KAAK,YAAY,WAAW,CAAC;YAAE,MAAM,KAAK,CAAC;QACjD,MAAM,IAAI,WAAW,CACnB,GAAG,KAAK,CAAC,OAAO,iEAAiE,EACjF,EAAE,KAAK,EAAE,KAAK,EAAE,CACjB,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CAAC,KAAwB;IAChD,MAAM,MAAM,GAAI,KAAsE,EAAE,OAAO,CAAC;IAChG,IAAI,CAAC;QACH,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACrB,CAAC;IAAC,MAAM,CAAC;QACP,+DAA+D;IACjE,CAAC;AACH,CAAC;AAeD,qFAAqF;AACrF,MAAM,eAAe,GAAG,CAAC,IAAY,EAAU,EAAE;AAC/C,0MAA0M;AAC1M,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC;AAEnB;;;;;;;;;;;;;;;GAeG;AACH,MAAM,SAAS,CAAC,CAAC,WAAW,CAAC,KAAY,EAAE,IAAY;IACrD,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;IACpB,0EAA0E;IAC1E,0EAA0E;IAC1E,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,KAA0B,CAAC;IAC/B,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAC3C,OAAO,QAAQ,GAAG,KAAK,CAAC,KAAK,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACzD,MAAM,MAAM,GACV,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,KAAK,MAAM;gBAChD,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,MAAM,CAAC;YACvD,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,QAAQ,EAAE,CAAC;QACb,CAAC;QACD,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,SAAS,CAAC;QACxB,MAAM;YACJ,IAAI,EAAE,OAAO;YACb,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACtB,KAAK,EAAE,KAAK,CAAC,MAAM;YACnB,KAAK;YACL,GAAG,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM;SAC5B,CAAC;QACF,4EAA4E;QAC5E,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC;IACxF,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,eAAe,CAC5B,KAAY,EACZ,IAAY,EACZ,IAA4B;IAE5B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;IAChB,wEAAwE;IACxE,wEAAwE;IACxE,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;QAC7C,IAAI,MAAM,KAAK,CAAC,CAAC;YAAE,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;QACxC,KAAK,EAAE,CAAC;QACR,IAAI,KAAK,IAAI,oBAAoB,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC;YAAE,MAAM;IAC7D,CAAC;IACD,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;AACnD,CAAC;AAkED,KAAK,UAAU,QAAQ,CAAC,SAAiB,EAAE,OAAoB;IAC7D,IAAI,MAAc,CAAC;IACnB,IAAI,CAAC;;;YACH,qEAAqE;YACrE,oEAAoE;YACpE,4DAA4D;YAC5D,MAAY,MAAM,kCAAG,MAAM,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAA,CAAC;YACtD,MAAM,KAAK,GAAG,MAAM,MAAM,CAAC,IAAI,EAAE,CAAC;YAClC,IAAI,KAAK,CAAC,IAAI,GAAG,OAAO,CAAC,WAAW;gBAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;YAClE,MAAM,GAAG,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;;;;;;;;;;;KAC5D;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO;YAAE,MAAM,KAAK,CAAC;QACzC,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC;IAClC,CAAC;IAED,uEAAuE;IACvE,oEAAoE;IACpE,iDAAiD;IACjD,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;IAElD,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACzC,IAAI,YAAY,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;QACzC,OAAO,CAAC,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC;QAChC,IAAI,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI;YAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IACxF,CAAC;IAED,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACtC,sEAAsE;IACtE,kEAAkE;IAClE,yCAAyC;IACzC,MAAM,SAAS,GACb,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IACtF,8EAA8E;IAC9E,8EAA8E;IAC9E,qEAAqE;IACrE,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,GAAG,mBAAmB,CAAC;IAC1D,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,MAAM,IAAI,GAAG,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,IAAI,aAAa,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,mBAAmB,EAAE,CAAC;YAC3E,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;QAC9B,CAAC;QACD,0EAA0E;QAC1E,IAAI,MAAM,IAAI,EAAE;YAAE,MAAM;QACxB,+DAA+D;QAC/D,8CAA8C;QAC9C,MAAM,KAAK,GAAG,MAAM,eAAe,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC/D,IAAI,KAAK,EAAE,CAAC;YACV,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,CAAC,GAAG,CAAC;gBACX,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC;gBAClB,UAAU,EAAE,KAAK,CAAC,KAAK;gBACvB,GAAG,CAAC,OAAO,CAAC,OAAO,GAAG,CAAC;oBACrB,CAAC,CAAC;wBACE,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;wBACjE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;qBACjF;oBACH,CAAC,CAAC,EAAE,CAAC;aACR,CAAC,CAAC;YACH,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,UAAU;gBAAE,MAAM;QAClD,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AACtC,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,SAAiB,EACjB,OAAe,EACf,OAA6B,EAC7B,SAAoB;IAEpB,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IAC7E,6EAA6E;IAC7E,+CAA+C;IAC/C,IAAI,KAAwB,CAAC;IAC7B,IAAI,SAA4B,CAAC;IACjC,IAAI,CAAC;QACH,KAAK,GAAG,YAAY,CAAC,MAAM,EAAE;YAC3B,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;SAC9C,CAAC,CAAC;QACH,+EAA+E;QAC/E,8EAA8E;QAC9E,6EAA6E;QAC7E,6EAA6E;QAC7E,oCAAoC;QACpC,SAAS,GAAG,YAAY,CAAC,MAAM,EAAE;YAC/B,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;YAC7C,SAAS,EAAE,IAAI;SAChB,CAAC,CAAC;QACH,MAAM,OAAO,GAAmB,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC;QAC7C,MAAM,WAAW,GAAG,kBAAkB,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,SAAS,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;QAE3D,MAAM,OAAO,GAAG,OAAO,CAAC,YAAY;YAClC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,YAAY,EAAE,CAAC;YAClC,CAAC,CAAC,WAAW,CAAC;gBACV,GAAG,EAAE,SAAS;gBACd,OAAO,EAAE,OAAO,CAAC,WAAW,IAAI,MAAM;gBACtC,yEAAyE;gBACzE,uEAAuE;gBACvE,aAAa,EAAE,IAAI;gBACnB,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;gBAC7C,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC;gBACzC,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5D,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrD,GAAG,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzE,cAAc,EAAE,IAAI;aACrB,CAAC,CAAC;QAEP,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,MAAM,OAAO,GAAgB;YAC3B,EAAE,EAAE,IAAI,iBAAiB,CAAC,SAAS,CAAC;YACpC,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,WAAW;YACX,UAAU;YACV,KAAK;YACL,SAAS;YACT,MAAM;YACN,OAAO;SACR,CAAC;QACF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC5C,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,MAAM,OAAO,GAAG,MAAM,0BAA0B,CAAC,OAAO,EAAE;YACxD,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,WAAW,EAAE,oBAAoB;YACjC,UAAU,EAAE,GAAG,EAAE,CAAC,SAAS,IAAI,UAAU;YACzC,OAAO,EAAE,GAAG,EAAE;gBACZ,UAAU,EAAE,CAAC;YACf,CAAC;YACD,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;YACxB,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE;gBAC5B,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC;gBAC7B,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;gBAChD,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBACzB,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;oBAAE,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;YAChE,CAAC;SACF,CAAC,CAAC;QAEH,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;gBAClB,KAAK,cAAc;oBACjB,mBAAmB,EAAE,CAAC;oBACtB,MAAM;gBACR,KAAK,UAAU;oBACb,eAAe,EAAE,CAAC;oBAClB,MAAM;gBACR,KAAK,QAAQ;oBACX,YAAY,EAAE,CAAC;oBACf,aAAa,EAAE,CAAC;oBAChB,MAAM;gBACR,KAAK,SAAS;oBACZ,YAAY,EAAE,CAAC;oBACf,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;wBAAE,YAAY,EAAE,CAAC;oBAC5C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;wBACjC,IAAI,OAAO,CAAC,MAAM,IAAI,UAAU;4BAAE,MAAM;wBACxC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBACpB,aAAa,EAAE,CAAC;oBAClB,CAAC;oBACD,MAAM;YACV,CAAC;QACH,CAAC;QAED,MAAM,aAAa,GAAG,iBAAiB,CACrC,OAAO,CAAC,MAAM,IAAI,UAAU,EAC5B,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAC1D,CAAC;QAEF,OAAO;YACL,QAAQ,EAAE,SAAS;YACnB,OAAO;YACP,OAAO,EAAE;gBACP,aAAa;gBACb,YAAY;gBACZ,YAAY;gBACZ,SAAS,EAAE,aAAa,KAAK,SAAS;gBACtC,mBAAmB;gBACnB,eAAe;gBACf,aAAa;gBACb,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC5C;SACF,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,SAAS,CAAC,SAAS,CAAC,CAAC;QACrB,SAAS,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED,uFAAuF;AACvF,SAAS,YAAY,CAAC,MAAc,EAAE,MAAc;IAClD,IAAI,MAAM,CAAC,MAAM,GAAG,mBAAmB;QAAE,OAAO,KAAK,CAAC;IACtD,IAAI,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC;QAAE,OAAO,KAAK,CAAC;IAChD,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC;QAAE,OAAO,KAAK,CAAC;IAC/C,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QAAE,OAAO,KAAK,CAAC;IAC9D,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,SAAiB,EACjB,OAAe,EACf,OAOC,EACD,SAAoB;IAapB,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC;IAC7C,MAAM,OAAO,GAAG,SAAS,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;IAC3D,MAAM,OAAO,GAAG,WAAW,CAAC;QAC1B,GAAG,EAAE,SAAS;QACd,OAAO;QACP,aAAa,EAAE,IAAI;QACnB,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;QAC7C,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC;QACzC,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5D,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACrD,GAAG,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACzE,cAAc,EAAE,IAAI;KACrB,CAAC,CAAC;IACH,MAAM,OAAO,GAAuB,EAAE,CAAC;IACvC,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAC5B,IAAI,cAAc,GAAG,KAAK,CAAC;IAE3B,6EAA6E;IAC7E,yEAAyE;IACzE,4EAA4E;IAC5E,oEAAoE;IACpE,IAAI,CAAC;QACH,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAClC,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC;gBAC5B,cAAc,GAAG,IAAI,CAAC;gBACtB,MAAM;YACR,CAAC;YACD,IAAI,CAAC;gBACH,MAAM,SAAS,CAAC,oBAAoB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACnD,CAAC;YAAC,MAAM,CAAC;gBACP,mBAAmB,EAAE,CAAC;gBACtB,SAAS;YACX,CAAC;YACD,IAAI,OAAO,CAAC,MAAM,IAAI,UAAU;gBAAE,MAAM;YACxC,YAAY,EAAE,CAAC;YACf,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO;YAAE,MAAM,KAAK,CAAC;QAC1C,cAAc,GAAG,IAAI,CAAC;IACxB,CAAC;IAED,yEAAyE;IACzE,mEAAmE;IACnE,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QAC9B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3E,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,6EAA6E;IAC7E,MAAM,aAAa,GAAG,iBAAiB,CAAC,OAAO,CAAC,MAAM,IAAI,UAAU,EAAE,cAAc,CAAC,CAAC;IAEtF,OAAO;QACL,QAAQ,EAAE,SAAS;QACnB,OAAO;QACP,OAAO,EAAE;YACP,OAAO,EAAE,OAAO,CAAC,MAAM;YACvB,YAAY;YACZ,SAAS,EAAE,aAAa,KAAK,SAAS;YACtC,mBAAmB;YACnB,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC5C;KACF,CAAC;AACJ,CAAC","sourcesContent":["import { basename } from 'node:path';\n\nimport type { RE2ExecArray } from '@adguard/re2-wasm';\nimport { RE2 } from '@adguard/re2-wasm';\n\nimport { processEntriesConcurrently, resolveStopReason } from './concurrency.ts';\nimport { GuardedFileSystem } from './fs.ts';\nimport { globEntries } from './glob.ts';\nimport type { PathGuard } from './path.ts';\nimport { escapeRegExp, getMaxTextFileSize, MIB, PARALLEL_CONCURRENCY } from './util.ts';\n\n/**\n * A fresh, flat copy of `s`. V8 keeps a substring of a long string as a slice\n * that references its parent, so a kept line would otherwise pin the whole\n * file's text for as long as the match list lives (60 s in the page store).\n */\nconst own = (s: string): string => Buffer.from(s, 'utf8').toString('utf8');\n\ninterface SearchResult {\n  file: string;\n  line: number;\n  /** 0-indexed column of the first occurrence on the line. */\n  column: number;\n  content: string;\n  matchCount: number;\n  /** Up to `context` lines either side of the match; absent when context is 0. */\n  before?: string[];\n  after?: string[];\n}\n\nexport type Regex = RE2;\n\n/** Occurrence-counting bound, so one pathological line cannot spin forever. */\nconst MAX_MATCHES_PER_LINE = 100_000;\n\n/**\n * re2-wasm copies the whole input on every exec, so draining a dense pattern is\n * O(matches x input) and fully synchronous: the loop pins and the tool's\n * AbortSignal.timeout (a timer) can never fire. The returned `tick` yields a\n * macrotask every ~10ms and reports whether `signal` has aborted.\n */\nexport function createYielder(signal: AbortSignal | undefined): () => Promise<boolean> {\n  let last = Date.now();\n  return async () => {\n    if (Date.now() - last > 10) {\n      await new Promise((resolve) => {\n        setImmediate(resolve);\n      });\n      last = Date.now();\n    }\n    return signal?.aborted ?? false;\n  };\n}\n\n/**\n * Largest input one RE2 call may scan as a single string. The input is copied\n * into the same fixed 16 MB wasm heap as the patterns; about 10 MB of input\n * aborts the module. 4 MiB leaves room for the copy and the pattern set.\n */\nexport const RE2_MAX_INPUT_BYTES = 4 * MIB;\n\nconst BUFFER_ANCHOR_RE = /\\\\[AzZ]/u;\n/** `(?i)`, `(?-m)`, `(?s:…)`: inline flags can undo the `m` the prefilter relies on. */\nconst INLINE_FLAGS_RE = /\\(\\?[a-zA-Z-]+[:)]/u;\nconst CR = 13;\n\n/**\n * Compile a pattern on RE2 rather than on V8's irregexp.\n *\n * Patterns arrive from the MCP client, so a backtracking engine would let one\n * request pin the event loop with no way out: an abort signal cannot preempt a\n * synchronous `exec`, and on stdio that wedges the whole server. RE2 matches in\n * time linear in the input and cannot backtrack at all, so the hazard is gone\n * rather than bounded.\n *\n * RE2 rejects the constructs the tool schema documents as unsupported —\n * lookahead, lookbehind, backreferences — with its own {@link SyntaxError},\n * which the tool layer turns into a normal tool error. It always matches in\n * Unicode mode and requires the `u` flag to say so.\n *\n * Every compiled pattern owns memory in re2-wasm's fixed 16 MB heap, which\n * `ALLOW_MEMORY_GROWTH` is off for. re2-wasm never frees it and a\n * FinalizationRegistry does not keep up (V8 sees no pressure from the wasm\n * heap), so exhaustion is an emscripten `abort()` that kills regex search for\n * the rest of the process. Every caller MUST pass the result to\n * {@link freeRegex} when it is done with it.\n */\nexport function compileRegex(\n  pattern: string,\n  options: { caseSensitive?: boolean; multiline?: boolean } = {},\n): Regex {\n  const flags = `g${options.multiline ? 'm' : ''}${options.caseSensitive ? '' : 'i'}u`;\n  try {\n    return new RE2(pattern, flags);\n  } catch (error) {\n    if (!(error instanceof SyntaxError)) throw error;\n    throw new SyntaxError(\n      `${error.message} — lookahead, lookbehind, and backreferences are not supported.`,\n      { cause: error },\n    );\n  }\n}\n\n/**\n * Release a compiled pattern's wasm memory. re2-wasm exposes no disposal of its\n * own, so this reaches the embind handle it holds privately; a version that\n * renames the field degrades to the pre-existing leak rather than throwing.\n * Idempotent — a second call on an already-freed handle is swallowed. Using a\n * {@link Regex} after freeing it is undefined behaviour in the wasm heap, so\n * free only in a `finally` that owns the compile.\n */\nexport function freeRegex(regex: Regex | undefined): void {\n  const handle = (regex as unknown as { wrapper?: { delete?: () => void } } | undefined)?.wrapper;\n  try {\n    handle?.delete?.();\n  } catch {\n    // already deleted, or a re2-wasm build without embind disposal\n  }\n}\n\nexport interface RegexMatch {\n  /** The matched text. */\n  text: string;\n  /** Capture groups, 1-indexed in the pattern, 0-indexed here. */\n  groups: (string | undefined)[];\n  /** Named capture groups, when the pattern declares any. */\n  named: Record<string, string> | undefined;\n  /** Start offset in UTF-16 code units — usable with `String.prototype.slice`. */\n  start: number;\n  /** End offset in UTF-16 code units. */\n  end: number;\n}\n\n/** Code-point length of `text`, i.e. its UTF-16 length minus its surrogate pairs. */\nconst codePointLength = (text: string): number =>\n  // eslint-disable-next-line @typescript-eslint/no-misused-spread -- code points are the intended unit (re2-wasm offsets count code points); grapheme segmentation would change the count, not preserve it.\n  [...text].length;\n\n/**\n * Iterate a global pattern's non-overlapping matches with offsets JS can use.\n *\n * re2-wasm reports `index` and `lastIndex` in **code points**, while every JS\n * string operation indexes in UTF-16 code units. The two agree only until the\n * first astral character (most emoji), past which every offset is short by one\n * per surrogate pair — slicing on the raw index cuts into the middle of\n * neighbouring text. Its `lastIndex` bookkeeping is worse still: it adds the\n * match's UTF-16 length to a code-point index, so an astral character inside a\n * match can skip the next one. This is the single place that corrects both; no\n * caller should read `match.index` or `regex.lastIndex` directly.\n *\n * Zero-length matches (e.g. `a*`) advance by one code point so they cannot loop\n * forever. The regex is global and shared across calls, so `lastIndex` is reset\n * on entry.\n */\nexport function* execMatches(regex: Regex, text: string): Generator<RegexMatch, undefined> {\n  regex.lastIndex = 0;\n  // Cursor into `text`, carried forward across matches: RE2 reports them in\n  // ascending order, so the walk is O(text) in total rather than per match.\n  let cursorCp = 0;\n  let cursorU16 = 0;\n  let match: RE2ExecArray | null;\n  while ((match = regex.exec(text)) !== null) {\n    while (cursorCp < match.index && cursorU16 < text.length) {\n      const isPair =\n        (text.charCodeAt(cursorU16) & 0xfc00) === 0xd800 &&\n        (text.charCodeAt(cursorU16 + 1) & 0xfc00) === 0xdc00;\n      cursorU16 += isPair ? 2 : 1;\n      cursorCp++;\n    }\n    const matched = match[0] ?? '';\n    const start = cursorU16;\n    yield {\n      text: matched,\n      groups: match.slice(1),\n      named: match.groups,\n      start,\n      end: start + matched.length,\n    };\n    // Own the advance rather than trusting the wrapper's mixed-unit arithmetic.\n    regex.lastIndex = match.index + (matched.length === 0 ? 1 : codePointLength(matched));\n  }\n}\n\n/**\n * Find non-overlapping occurrences of a global regex in a single line, reporting\n * the first match's column alongside the count.\n */\nasync function findLineMatches(\n  regex: Regex,\n  line: string,\n  tick: () => Promise<boolean>,\n): Promise<{ count: number; column: number } | undefined> {\n  let count = 0;\n  let column = -1;\n  // Awaiting mid-drain is safe with a shared regex: execMatches re-writes\n  // lastIndex from its own match before every exec, with no await inside.\n  for (const match of execMatches(regex, line)) {\n    if (column === -1) column = match.start;\n    count++;\n    if (count >= MAX_MATCHES_PER_LINE || (await tick())) break;\n  }\n  return count > 0 ? { count, column } : undefined;\n}\n\nexport interface SearchContentOptions {\n  caseSensitive?: boolean;\n  isRegex?: boolean;\n  maxResults?: number;\n  filePattern?: string;\n  skipIgnored?: boolean;\n  includeHidden?: boolean;\n  maxDepth?: number;\n  /**\n   * Search exactly this file (absolute, already guard-validated) instead of\n   * walking `directory` with `filePattern`. Set when the caller named a file:\n   * its name must not be interpreted as a glob.\n   */\n  explicitFile?: string;\n  /** Lines of context to carry either side of each match; 0 (default) carries none. */\n  context?: number;\n  signal?: AbortSignal;\n}\n\nexport interface SearchContentOutcome {\n  basePath: string;\n  matches: SearchResult[];\n  summary: {\n    /**\n     * Matching *lines*, one per entry in `matches` — not pattern occurrences.\n     * A line with three occurrences counts once here and reports 3 in its own\n     * `SearchResult.matchCount`.\n     */\n    matchingLines: number;\n    filesScanned: number;\n    filesMatched: number;\n    truncated: boolean;\n    /** Files the guard rejected or that could not be stat'd. */\n    skippedInaccessible: number;\n    /** Files skipped unread because they exceed maxFileSize. */\n    skippedTooLarge: number;\n    /** Files skipped because they contain a NUL byte (binary). */\n    skippedBinary: number;\n    /**\n     * `StoppedReason` narrowed to the stops these scans can produce: both\n     * resolve the stop through `resolveStopReason` (concurrency.ts) — never\n     * `maxFiles`, which belongs to `replace_text`'s per-file cap.\n     */\n    stoppedReason?: 'maxResults' | 'timeout';\n  };\n}\n\ntype FileScan =\n  | { kind: 'inaccessible' }\n  | { kind: 'tooLarge' }\n  | { kind: 'binary' }\n  | { kind: 'scanned'; matches: SearchResult[] };\n\ninterface ScanContext {\n  fs: GuardedFileSystem;\n  signal: AbortSignal | undefined;\n  maxFileSize: number;\n  maxResults: number;\n  regex: Regex;\n  prefilter: Regex;\n  source: string;\n  context: number;\n}\n\nasync function scanFile(entryPath: string, scanCtx: ScanContext): Promise<FileScan> {\n  let buffer: Buffer;\n  try {\n    // open() validates, refuses a swapped final symlink (O_NOFOLLOW) and\n    // re-checks the descriptor's real path (H4), so these bytes are the\n    // validated file's, not whatever the name points at by now.\n    await using handle = await scanCtx.fs.open(entryPath);\n    const stats = await handle.stat();\n    if (stats.size > scanCtx.maxFileSize) return { kind: 'tooLarge' };\n    buffer = await handle.readFile({ signal: scanCtx.signal });\n  } catch (error) {\n    if (scanCtx.signal?.aborted) throw error;\n    return { kind: 'inaccessible' };\n  }\n\n  // A NUL byte marks a binary file, as it does for `read` and `grep -I`.\n  // Non-UTF-8 text is still searched: a lossy decode only affects the\n  // bytes a pattern could not have matched anyway.\n  if (buffer.includes(0)) return { kind: 'binary' };\n\n  const content = buffer.toString('utf-8');\n  if (canPrefilter(scanCtx.source, buffer)) {\n    scanCtx.prefilter.lastIndex = 0;\n    if (scanCtx.prefilter.exec(content) === null) return { kind: 'scanned', matches: [] };\n  }\n\n  const lines = content.split(/\\r?\\n/u);\n  // A trailing newline splits into a phantom empty last element, and an\n  // empty file splits into one empty element: neither is a line the\n  // file has, for matching or for context.\n  const lineCount =\n    content.length === 0 ? 0 : content.endsWith('\\n') ? lines.length - 1 : lines.length;\n  // A single line past RE2_MAX_INPUT_BYTES OOMs the wasm module for the rest of\n  // the process; report the file tooLarge instead. Only a buffer over the bound\n  // can hold such a line, so ordinary files skip the per-line measure.\n  const checkLineSize = buffer.length > RE2_MAX_INPUT_BYTES;\n  const matches: SearchResult[] = [];\n  const tick = createYielder(scanCtx.signal);\n  for (let i = 0; i < lineCount; i++) {\n    const line = lines[i];\n    if (line === undefined) continue;\n    if (checkLineSize && Buffer.byteLength(line, 'utf8') > RE2_MAX_INPUT_BYTES) {\n      return { kind: 'tooLarge' };\n    }\n    // Yield between lines too: millions of short lines never yield per-match.\n    if (await tick()) break;\n    // One scan per line: the helper resets lastIndex itself, so it\n    // doubles as the \"does this line match\" test.\n    const found = await findLineMatches(scanCtx.regex, line, tick);\n    if (found) {\n      matches.push({\n        file: entryPath,\n        line: i + 1,\n        column: found.column,\n        content: own(line),\n        matchCount: found.count,\n        ...(scanCtx.context > 0\n          ? {\n              before: lines.slice(Math.max(0, i - scanCtx.context), i).map(own),\n              after: lines.slice(i + 1, Math.min(lineCount, i + 1 + scanCtx.context)).map(own),\n            }\n          : {}),\n      });\n      if (matches.length >= scanCtx.maxResults) break;\n    }\n  }\n  return { kind: 'scanned', matches };\n}\n\nexport async function searchContent(\n  directory: string,\n  pattern: string,\n  options: SearchContentOptions,\n  pathGuard: PathGuard,\n): Promise<SearchContentOutcome> {\n  const source = options.isRegex ? pattern || '' : escapeRegExp(pattern || '');\n  // Compiles live inside the try so a failing second compile does not leak the\n  // first's wasm memory; freeRegex is null-safe.\n  let regex: Regex | undefined;\n  let prefilter: Regex | undefined;\n  try {\n    regex = compileRegex(source, {\n      caseSensitive: Boolean(options.caseSensitive),\n    });\n    // Whole-buffer test: `m` makes ^/$ line-relative so a per-line hit is always a\n    // buffer hit (the converse can be false — a false positive just falls through\n    // to the per-line scan). \\A/\\z/\\Z are buffer-relative even under `m`, inline\n    // flag groups can undo `m`, and $ cannot see past a \\r, so those inputs skip\n    // the prefilter (see canPrefilter).\n    prefilter = compileRegex(source, {\n      caseSensitive: Boolean(options.caseSensitive),\n      multiline: true,\n    });\n    const matches: SearchResult[] = [];\n    const maxResults = options.maxResults ?? 100;\n    const maxFileSize = getMaxTextFileSize();\n    const context = options.context ?? 0;\n    const ceiling = pathGuard.allowedRootContaining(directory);\n\n    const entries = options.explicitFile\n      ? [{ path: options.explicitFile }]\n      : globEntries({\n          cwd: directory,\n          pattern: options.filePattern ?? '**/*',\n          // Same rule as replace_text, so a search with the same glob previews the\n          // files a replace would touch: a slash-free glob matches at any depth.\n          baseNameMatch: true,\n          includeHidden: Boolean(options.includeHidden),\n          skipIgnored: Boolean(options.skipIgnored),\n          ...(ceiling !== undefined ? { ignoreCeiling: ceiling } : {}),\n          ...(options.signal ? { signal: options.signal } : {}),\n          ...(options.maxDepth !== undefined ? { maxDepth: options.maxDepth } : {}),\n          suppressErrors: true,\n        });\n\n    let filesScanned = 0;\n    let filesMatched = 0;\n    let matchingLines = 0;\n    let skippedTooLarge = 0;\n    let skippedBinary = 0;\n    const scanCtx: ScanContext = {\n      fs: new GuardedFileSystem(pathGuard),\n      signal: options.signal,\n      maxFileSize,\n      maxResults,\n      regex,\n      prefilter,\n      source,\n      context,\n    };\n    const perFile = new Map<number, FileScan>();\n    let dispatched = 0;\n    let collected = 0;\n    const stopped = await processEntriesConcurrently(entries, {\n      signal: options.signal,\n      concurrency: PARALLEL_CONCURRENCY,\n      shouldStop: () => collected >= maxResults,\n      onEntry: () => {\n        dispatched++;\n      },\n      onError: () => undefined,\n      runEntry: async (entryPath) => {\n        const index = dispatched - 1;\n        const scan = await scanFile(entryPath, scanCtx);\n        perFile.set(index, scan);\n        if (scan.kind === 'scanned') collected += scan.matches.length;\n      },\n    });\n\n    let skippedInaccessible = 0;\n    for (let i = 0; i < dispatched; i++) {\n      const scan = perFile.get(i);\n      if (!scan) continue;\n      switch (scan.kind) {\n        case 'inaccessible':\n          skippedInaccessible++;\n          break;\n        case 'tooLarge':\n          skippedTooLarge++;\n          break;\n        case 'binary':\n          filesScanned++;\n          skippedBinary++;\n          break;\n        case 'scanned':\n          filesScanned++;\n          if (scan.matches.length > 0) filesMatched++;\n          for (const match of scan.matches) {\n            if (matches.length >= maxResults) break;\n            matches.push(match);\n            matchingLines++;\n          }\n          break;\n      }\n    }\n\n    const stoppedReason = resolveStopReason(\n      matches.length >= maxResults,\n      stopped === 'timeout' || Boolean(options.signal?.aborted),\n    );\n\n    return {\n      basePath: directory,\n      matches,\n      summary: {\n        matchingLines,\n        filesScanned,\n        filesMatched,\n        truncated: stoppedReason !== undefined,\n        skippedInaccessible,\n        skippedTooLarge,\n        skippedBinary,\n        ...(stoppedReason ? { stoppedReason } : {}),\n      },\n    };\n  } finally {\n    freeRegex(prefilter);\n    freeRegex(regex);\n  }\n}\n\n/** Whether one whole-buffer RE2 test is a sound \"cannot match\" check for this file. */\nfunction canPrefilter(source: string, buffer: Buffer): boolean {\n  if (buffer.length > RE2_MAX_INPUT_BYTES) return false;\n  if (BUFFER_ANCHOR_RE.test(source)) return false;\n  if (INLINE_FLAGS_RE.test(source)) return false;\n  if (source.includes('$') && buffer.includes(CR)) return false;\n  return true;\n}\n\nexport async function searchFiles(\n  directory: string,\n  pattern: string,\n  options: {\n    maxResults?: number;\n    includeHidden?: boolean;\n    sortBy?: 'name' | 'path';\n    skipIgnored?: boolean;\n    maxDepth?: number;\n    signal?: AbortSignal;\n  },\n  pathGuard: PathGuard,\n): Promise<{\n  basePath: string;\n  results: { path: string }[];\n  summary: {\n    matched: number;\n    filesScanned: number;\n    truncated: boolean;\n    skippedInaccessible: number;\n    /** Narrowed like SearchContentOutcome's — scans never `maxFiles`. */\n    stoppedReason?: 'maxResults' | 'timeout';\n  };\n}> {\n  const maxResults = options.maxResults ?? 100;\n  const ceiling = pathGuard.allowedRootContaining(directory);\n  const entries = globEntries({\n    cwd: directory,\n    pattern,\n    baseNameMatch: true,\n    includeHidden: Boolean(options.includeHidden),\n    skipIgnored: Boolean(options.skipIgnored),\n    ...(ceiling !== undefined ? { ignoreCeiling: ceiling } : {}),\n    ...(options.signal ? { signal: options.signal } : {}),\n    ...(options.maxDepth !== undefined ? { maxDepth: options.maxDepth } : {}),\n    suppressErrors: true,\n  });\n  const results: { path: string }[] = [];\n  let filesScanned = 0;\n  let skippedInaccessible = 0;\n  let stoppedByAbort = false;\n\n  // The signal carries both client cancellation and the tool's search timeout,\n  // so an abort means \"return what we have, marked incomplete\" rather than\n  // throw — but it must never be reported as a finished scan. The walk itself\n  // throws when the signal stops it before a single entry is yielded.\n  try {\n    for await (const entry of entries) {\n      if (options.signal?.aborted) {\n        stoppedByAbort = true;\n        break;\n      }\n      try {\n        await pathGuard.validateExistingPath(entry.path);\n      } catch {\n        skippedInaccessible++;\n        continue;\n      }\n      if (results.length >= maxResults) break;\n      filesScanned++;\n      results.push({ path: entry.path });\n    }\n  } catch (error) {\n    if (!options.signal?.aborted) throw error;\n    stoppedByAbort = true;\n  }\n\n  // Sorting — only name / path are supported; size / modified were removed\n  // (the glob never collected stats, so they were always undefined).\n  if (options.sortBy === 'name') {\n    results.sort((a, b) => basename(a.path).localeCompare(basename(b.path)));\n  } else {\n    results.sort((a, b) => a.path.localeCompare(b.path));\n  }\n\n  // Same precedence as above: the result cap wins over a same-iteration abort.\n  const stoppedReason = resolveStopReason(results.length >= maxResults, stoppedByAbort);\n\n  return {\n    basePath: directory,\n    results,\n    summary: {\n      matched: results.length,\n      filesScanned,\n      truncated: stoppedReason !== undefined,\n      skippedInaccessible,\n      ...(stoppedReason ? { stoppedReason } : {}),\n    },\n  };\n}\n"]}