@smthrs/std 0.0.0-stage → 1.0.0-rc.12

package/dist/cjs/internal/EnvelopePrecheck.d.ts

@@ -0,0 +1,69 @@
+/**
+ * The hermetic pre-check: a lexical scan of shell text for the paths it names,
+ * and the refusal when one of them falls outside the declared envelope.
+ *
+ * The scan is fail-closed over explicit path tokens and nothing more. It
+ * cannot prove confinement — a shell can name a path no lexer sees, through a
+ * variable, a substitution, or a program that opens a file of its own — so a
+ * kernel or host sandbox must eventually enforce and report the complete read
+ * and write sets.
+ *
+ * It lives beside the flow rather than inside it because it is its own
+ * concept, with its own vocabulary (Access, PathReference) and its own
+ * security history: three independent bypasses, each sufficient on its own to
+ * defeat it, are closed here.
+ *
+ * @since 1.0.0
+ */
+import type * as Path from "@smthrs/kernel/Path";
+import * as StdError from "../StdError.ts";
+/**
+ * The filesystem envelope one invocation declared.
+ *
+ * Structural rather than the hermetic `Bash.Input` itself: the scan needs the
+ * three fields and none of the rest, and depending on the flow module would
+ * make the flow and its pre-check import each other.
+ *
+ * @category models
+ * @since 1.0.0
+ */
+export interface Envelope {
+    readonly cwd?: string | undefined;
+    readonly reads: ReadonlyArray<string>;
+    readonly writes: ReadonlyArray<string>;
+}
+/**
+ * How a command touches a path it names.
+ *
+ * @category models
+ * @since 1.0.0
+ */
+export type Access = "read" | "write";
+/**
+ * One path a command names, and how it touches it.
+ *
+ * @category models
+ * @since 1.0.0
+ */
+export interface PathReference {
+    readonly access: Access;
+    readonly value: string;
+}
+/**
+ * Every path token the shell text names, one segment at a time.
+ *
+ * @throws {StdError.StdError} `invalid_input` when substitutions or quotes nest
+ * deeper than the scan reads.
+ * @category pre-check
+ * @since 1.0.0
+ */
+export declare const commandReferences: (path: Path.Path, command: string) => ReadonlyArray<PathReference>;
+/**
+ * The refusal shell text earns by naming a path outside its declared
+ * envelope, or `undefined` when every path it names is declared.
+ *
+ * @category pre-check
+ * @since 1.0.0
+ */
+export declare const outsideEnvelope: (input: Envelope, text: string, path: Path.Path) => StdError.StdError | undefined;
+//# sourceMappingURL=EnvelopePrecheck.d.ts.map

package/dist/cjs/internal/EnvelopePrecheck.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"EnvelopePrecheck.d.ts","sourceRoot":"","sources":["../../../src/internal/EnvelopePrecheck.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,KAAK,IAAI,MAAM,qBAAqB,CAAA;AAChD,OAAO,KAAK,QAAQ,MAAM,gBAAgB,CAAA;AAG1C;;;;;;;;;GASG;AACH,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACjC,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;IACrC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;CACvC;AAED;;;;;GAKG;AACH,MAAM,MAAM,MAAM,GAAG,MAAM,GAAG,OAAO,CAAA;AAErC;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CACvB;AA0VD;;;;;;;GAOG;AACH,eAAO,MAAM,iBAAiB,GAAI,MAAM,IAAI,CAAC,IAAI,EAAE,SAAS,MAAM,KAAG,aAAa,CAAC,aAAa,CAClE,CAAA;AAmB9B;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,GAC1B,OAAO,QAAQ,EACf,MAAM,MAAM,EACZ,MAAM,IAAI,CAAC,IAAI,KACd,QAAQ,CAAC,QAAQ,GAAG,SAgDtB,CAAA"}

package/dist/cjs/internal/EnvelopePrecheck.js

@@ -0,0 +1,323 @@
+"use strict";
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var EnvelopePrecheck_exports = {};
+__export(EnvelopePrecheck_exports, {
+  commandReferences: () => commandReferences,
+  outsideEnvelope: () => outsideEnvelope
+});
+module.exports = __toCommonJS(EnvelopePrecheck_exports);
+var StdError = __toESM(require("../StdError.js"), 1);
+var import_Paths = require("./Paths.js");
+const commandSeparators = /* @__PURE__ */ new Set(["&&", "||", ";", ";;", ";&", ";;&", "|", "|&", "&", "\n", "(", ")"]);
+const writeRedirections = /* @__PURE__ */ new Set([">", ">>", ">|", "&>", "&>>", ">&", "<>"]);
+const readRedirections = /* @__PURE__ */ new Set(["<", "<&"]);
+const textRedirections = /* @__PURE__ */ new Set(["<<", "<<-", "<<<"]);
+const isRedirection = (token) => token.operator && (writeRedirections.has(token.text) || readRedirections.has(token.text) || textRedirections.has(token.text));
+const operators = [
+  ";;&",
+  "&>>",
+  "<<<",
+  "<<-",
+  ";;",
+  ";&",
+  "&&",
+  "||",
+  "|&",
+  "&>",
+  ">>",
+  ">|",
+  ">&",
+  "<>",
+  "<<",
+  "<&",
+  "\n",
+  ";",
+  "|",
+  "&",
+  "(",
+  ")",
+  ">",
+  "<"
+];
+const reservedWords = /* @__PURE__ */ new Set([
+  "!",
+  "{",
+  "}",
+  "case",
+  "do",
+  "done",
+  "elif",
+  "else",
+  "esac",
+  "fi",
+  "for",
+  "function",
+  "if",
+  "in",
+  "select",
+  "then",
+  "until",
+  "while"
+]);
+const writeCommands = /* @__PURE__ */ new Set(["chmod", "chown", "mkdir", "rm", "rmdir", "tee", "touch", "truncate", "unlink"]);
+const destinationCommands = /* @__PURE__ */ new Set(["cp", "install", "mv"]);
+const prefixWrappers = /* @__PURE__ */ new Set(["env", "nice", "time", "sudo", "nohup", "xargs", "command", "exec"]);
+const shells = /* @__PURE__ */ new Set(["ash", "bash", "dash", "fish", "ksh", "mksh", "sh", "zsh"]);
+const commandFlag = /^-[A-Za-z]*c[A-Za-z]*$/;
+const maxNesting = 32;
+const tooDeep = () => new StdError.StdError({
+  code: "invalid_input",
+  message: `Command nests substitutions or quotes deeper than ${maxNesting} levels`
+});
+const substitutionEnd = (text, from, nesting) => {
+  if (nesting > maxNesting) throw tooDeep();
+  let depth = 1;
+  let index = from;
+  while (index < text.length) {
+    const char = text[index];
+    if (char === "\\") {
+      index += 2;
+    } else if (char === "'") {
+      const close = text.indexOf("'", index + 1);
+      index = close === -1 ? text.length : close + 1;
+    } else if (char === '"') {
+      index = doubleQuoteEnd(text, index + 1, nesting + 1) + 1;
+    } else if (char === "`") {
+      index = backtickEnd(text, index + 1) + 1;
+    } else {
+      if (char === "(") depth++;
+      if (char === ")" && --depth === 0) return index;
+      index++;
+    }
+  }
+  return text.length;
+};
+const backtickEnd = (text, from) => {
+  let index = from;
+  while (index < text.length && text[index] !== "`") index += text[index] === "\\" ? 2 : 1;
+  return Math.min(index, text.length);
+};
+const doubleQuoteEnd = (text, from, nesting) => {
+  if (nesting > maxNesting) throw tooDeep();
+  let index = from;
+  while (index < text.length && text[index] !== '"') {
+    const char = text[index];
+    if (char === "\\") index += 2;
+    else if (char === "`") index = backtickEnd(text, index + 1) + 1;
+    else if (char === "$" && text[index + 1] === "(") index = substitutionEnd(text, index + 2, nesting + 1) + 1;
+    else index++;
+  }
+  return Math.min(index, text.length);
+};
+const descriptorPattern = /\d+(?=[<>])/y;
+const lex = (command, nesting) => {
+  const tokens = [];
+  const substitutions = [];
+  let index = 0;
+  const substitution = (from, to) => {
+    substitutions.push(command.slice(from, to));
+    return "$()";
+  };
+  while (index < command.length) {
+    const char = command[index];
+    if (char !== "\n" && /\s/.test(char)) {
+      index++;
+      continue;
+    }
+    if (char === "\\" && command[index + 1] === "\n") {
+      index += 2;
+      continue;
+    }
+    if (char === "#") {
+      while (index < command.length && command[index] !== "\n") index++;
+      continue;
+    }
+    descriptorPattern.lastIndex = index;
+    const descriptor = descriptorPattern.exec(command);
+    if (descriptor !== null) {
+      index += descriptor[0].length;
+      continue;
+    }
+    const operator = operators.find((candidate) => command.startsWith(candidate, index));
+    if (operator !== void 0) {
+      tokens.push({ operator: true, text: operator });
+      index += operator.length;
+      continue;
+    }
+    let text = "";
+    while (index < command.length) {
+      const next = command[index];
+      if (/[\s<>;|&()]/.test(next)) break;
+      if (next === "\\") {
+        const escaped = command[index + 1] ?? "";
+        if (escaped !== "\n") text += /[\s<>;|&()'"`$\\#]/.test(escaped) ? escaped : `\\${escaped}`;
+        index += 2;
+      } else if (next === "'") {
+        const close = command.indexOf("'", index + 1);
+        const end = close === -1 ? command.length : close;
+        text += command.slice(index + 1, end);
+        index = end + 1;
+      } else if (next === '"') {
+        const end = doubleQuoteEnd(command, index + 1, nesting + 1);
+        let inner = index + 1;
+        while (inner < end) {
+          const quoted = command[inner];
+          if (quoted === "\\" && /[$`"\\\n]/.test(command[inner + 1] ?? "")) {
+            if (command[inner + 1] !== "\n") text += command[inner + 1];
+            inner += 2;
+          } else if (quoted === "`") {
+            const close = backtickEnd(command, inner + 1);
+            text += substitution(inner + 1, close);
+            inner = close + 1;
+          } else if (quoted === "$" && command[inner + 1] === "(") {
+            const close = substitutionEnd(command, inner + 2, nesting + 2);
+            text += substitution(inner + 2, close);
+            inner = close + 1;
+          } else {
+            text += quoted;
+            inner++;
+          }
+        }
+        index = end + 1;
+      } else if (next === "`") {
+        const close = backtickEnd(command, index + 1);
+        text += substitution(index + 1, close);
+        index = close + 1;
+      } else if (next === "$" && command[index + 1] === "(") {
+        const close = substitutionEnd(command, index + 2, nesting + 1);
+        text += substitution(index + 2, close);
+        index = close + 1;
+      } else {
+        text += next;
+        index++;
+      }
+    }
+    tokens.push({ operator: false, text });
+  }
+  return { tokens, substitutions };
+};
+const pathValue = (token) => token.replace(/,+$/, "");
+const isPathToken = (path, token) => token === "." || token === ".." || token.startsWith("./") || token.startsWith("../") || path.isAbsolute(token) || /^[A-Za-z]:[\\/]/.test(token) || token.includes("/");
+const segmentReferences = (path, tokens, nesting) => {
+  const isTarget = (index) => index > 0 && isRedirection(tokens[index - 1]);
+  const isWord = (index) => !tokens[index].operator && !isTarget(index);
+  const name = (index) => path.basename(pathValue(tokens[index].text));
+  const hasWrapper = tokens.some((_, index) => isWord(index) && prefixWrappers.has(name(index)));
+  let commandIndex = tokens.findIndex(
+    (token, index) => isWord(index) && !token.text.includes("=") && !prefixWrappers.has(name(index)) && !reservedWords.has(token.text) && !token.text.startsWith("-") && token.text !== ""
+  );
+  if (hasWrapper) {
+    const mutatingIndex = tokens.findIndex(
+      (_, index) => isWord(index) && (writeCommands.has(name(index)) || destinationCommands.has(name(index)))
+    );
+    if (mutatingIndex !== -1) commandIndex = mutatingIndex;
+  }
+  const command = commandIndex === -1 ? "" : name(commandIndex);
+  const scripts = /* @__PURE__ */ new Set();
+  if (command === "eval") {
+    for (let index = commandIndex + 1; index < tokens.length; index++) if (isWord(index)) scripts.add(index);
+  } else if (shells.has(command)) {
+    const flag = tokens.findIndex(
+      (token, index) => index > commandIndex && isWord(index) && commandFlag.test(token.text)
+    );
+    if (flag !== -1 && flag + 1 < tokens.length && isWord(flag + 1)) scripts.add(flag + 1);
+  }
+  const candidates = [];
+  for (let index = 0; index < tokens.length; index++) {
+    const token = tokens[index];
+    if (index === commandIndex || scripts.has(index) || token.operator) continue;
+    if (!isTarget(index) && token.text.startsWith("-")) continue;
+    if (isTarget(index) && textRedirections.has(tokens[index - 1].text)) continue;
+    const value = pathValue(token.text);
+    if (value !== "" && isPathToken(path, value)) candidates.push({ index, value });
+  }
+  const destinationIndex = destinationCommands.has(command) ? candidates.filter(({ index }) => !isTarget(index)).at(-1)?.index : void 0;
+  const script = [...scripts].map((index) => tokens[index].text).join(" ");
+  const nested = script === "" ? [] : references(path, script, nesting + 1);
+  const named = candidates.map(({ index, value }) => {
+    const access = isTarget(index) ? writeRedirections.has(tokens[index - 1].text) ? "write" : "read" : writeCommands.has(command) || destinationIndex === index ? "write" : "read";
+    return { access, value };
+  });
+  return [...named, ...nested];
+};
+const references = (path, command, nesting) => {
+  if (nesting > maxNesting) throw tooDeep();
+  const { substitutions, tokens } = lex(command, nesting);
+  const found = [];
+  let segment = [];
+  for (const token of tokens) {
+    if (token.operator && commandSeparators.has(token.text)) {
+      found.push(...segmentReferences(path, segment, nesting));
+      segment = [];
+    } else {
+      segment.push(token);
+    }
+  }
+  found.push(...segmentReferences(path, segment, nesting));
+  for (const body of substitutions) found.push(...references(path, body, nesting + 1));
+  return found;
+};
+const commandReferences = (path, command) => references(path, command, 0);
+const resolvePath = (path, cwd, value) => path.isAbsolute(value) ? path.normalize(value) : path.resolve(cwd, value);
+const isDeclared = (path, cwd, declared, source) => (0, import_Paths.withinEnvelope)(
+  declared.map((entry) => resolvePath(path, cwd, entry)),
+  resolvePath(path, cwd, source)
+);
+const outsideEnvelope = (input, text, path) => {
+  const base = path.resolve(".");
+  const cwd = path.resolve(input.cwd ?? ".");
+  if (input.cwd !== void 0 && cwd !== base && !isDeclared(path, cwd, input.reads, cwd)) {
+    return new StdError.StdError({
+      code: "outside_declared_reads",
+      message: `Working directory is outside declared reads: ${cwd}`,
+      path: cwd
+    });
+  }
+  let named;
+  try {
+    named = commandReferences(path, text);
+  } catch {
+    return tooDeep();
+  }
+  for (const reference of named) {
+    const resolved = resolvePath(path, cwd, reference.value);
+    if (resolved.startsWith("/dev/")) continue;
+    const declared = reference.access === "write" ? input.writes : input.reads;
+    if (!isDeclared(path, cwd, declared, resolved)) {
+      const code = reference.access === "write" ? "outside_declared_writes" : "outside_declared_reads";
+      return new StdError.StdError({
+        code,
+        message: `Command path is outside declared ${reference.access}s: ${resolved}`,
+        path: resolved
+      });
+    }
+  }
+  return void 0;
+};
+//# sourceMappingURL=EnvelopePrecheck.js.map

package/dist/cjs/internal/EnvelopePrecheck.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/internal/EnvelopePrecheck.ts"],
+  "sourcesContent": ["/**\n * The hermetic pre-check: a lexical scan of shell text for the paths it names,\n * and the refusal when one of them falls outside the declared envelope.\n *\n * The scan is fail-closed over explicit path tokens and nothing more. It\n * cannot prove confinement \u2014 a shell can name a path no lexer sees, through a\n * variable, a substitution, or a program that opens a file of its own \u2014 so a\n * kernel or host sandbox must eventually enforce and report the complete read\n * and write sets.\n *\n * It lives beside the flow rather than inside it because it is its own\n * concept, with its own vocabulary (Access, PathReference) and its own\n * security history: three independent bypasses, each sufficient on its own to\n * defeat it, are closed here.\n *\n * @since 1.0.0\n */\n\nimport type * as Path from \"@smthrs/kernel/Path\"\nimport * as StdError from \"../StdError.ts\"\nimport { withinEnvelope } from \"./Paths.ts\"\n\n/**\n * The filesystem envelope one invocation declared.\n *\n * Structural rather than the hermetic `Bash.Input` itself: the scan needs the\n * three fields and none of the rest, and depending on the flow module would\n * make the flow and its pre-check import each other.\n *\n * @category models\n * @since 1.0.0\n */\nexport interface Envelope {\n  readonly cwd?: string | undefined\n  readonly reads: ReadonlyArray<string>\n  readonly writes: ReadonlyArray<string>\n}\n\n/**\n * How a command touches a path it names.\n *\n * @category models\n * @since 1.0.0\n */\nexport type Access = \"read\" | \"write\"\n\n/**\n * One path a command names, and how it touches it.\n *\n * @category models\n * @since 1.0.0\n */\nexport interface PathReference {\n  readonly access: Access\n  readonly value: string\n}\n\nconst commandSeparators = new Set([\"&&\", \"||\", \";\", \";;\", \";&\", \";;&\", \"|\", \"|&\", \"&\", \"\\n\", \"(\", \")\"])\nconst writeRedirections = new Set([\">\", \">>\", \">|\", \"&>\", \"&>>\", \">&\", \"<>\"])\nconst readRedirections = new Set([\"<\", \"<&\"])\n// A here-document delimiter and a here-string are text, not file names.\nconst textRedirections = new Set([\"<<\", \"<<-\", \"<<<\"])\nconst isRedirection = (token: Token): boolean =>\n  token.operator &&\n  (writeRedirections.has(token.text) || readRedirections.has(token.text) || textRedirections.has(token.text))\n// Longest first, so `&>>` is not read as `&` then `>>`.\nconst operators = [\n  \";;&\",\n  \"&>>\",\n  \"<<<\",\n  \"<<-\",\n  \";;\",\n  \";&\",\n  \"&&\",\n  \"||\",\n  \"|&\",\n  \"&>\",\n  \">>\",\n  \">|\",\n  \">&\",\n  \"<>\",\n  \"<<\",\n  \"<&\",\n  \"\\n\",\n  \";\",\n  \"|\",\n  \"&\",\n  \"(\",\n  \")\",\n  \">\",\n  \"<\"\n]\n// Reserved words and grouping braces open or close a compound command; the\n// command they wrap stands after them.\nconst reservedWords = new Set([\n  \"!\",\n  \"{\",\n  \"}\",\n  \"case\",\n  \"do\",\n  \"done\",\n  \"elif\",\n  \"else\",\n  \"esac\",\n  \"fi\",\n  \"for\",\n  \"function\",\n  \"if\",\n  \"in\",\n  \"select\",\n  \"then\",\n  \"until\",\n  \"while\"\n])\nconst writeCommands = new Set([\"chmod\", \"chown\", \"mkdir\", \"rm\", \"rmdir\", \"tee\", \"touch\", \"truncate\", \"unlink\"])\nconst destinationCommands = new Set([\"cp\", \"install\", \"mv\"])\nconst prefixWrappers = new Set([\"env\", \"nice\", \"time\", \"sudo\", \"nohup\", \"xargs\", \"command\", \"exec\"])\n// A shell runs the argument of its `-c` flag as shell text of its own.\nconst shells = new Set([\"ash\", \"bash\", \"dash\", \"fish\", \"ksh\", \"mksh\", \"sh\", \"zsh\"])\nconst commandFlag = /^-[A-Za-z]*c[A-Za-z]*$/\n\n/**\n * One lexical unit of shell text: an operator, or a word with its quotes\n * removed. A command substitution inside a word stands as `$()` in the word;\n * its body is scanned as a command of its own.\n */\ninterface Token {\n  readonly operator: boolean\n  readonly text: string\n}\n\ninterface Lexed {\n  readonly tokens: ReadonlyArray<Token>\n  readonly substitutions: ReadonlyArray<string>\n}\n\n// The end of a `$(` body that starts at `from`: the index of its closing\n// parenthesis, skipping quoted spans and nested parentheses. An unclosed body\n// runs to the end of the text, which is how a fail-closed scan must read it.\n// Substitutions and quotes nest without limit in a shell, but each level\n// costs this scan a pass over the rest of the text and a stack frame. Fifty\n// thousand `$(` used to run for half a minute and then overflow the stack, so\n// past this depth the text is refused rather than scanned.\nconst maxNesting = 32\n\nconst tooDeep = (): StdError.StdError =>\n  new StdError.StdError({\n    code: \"invalid_input\",\n    message: `Command nests substitutions or quotes deeper than ${maxNesting} levels`\n  })\n\nconst substitutionEnd = (text: string, from: number, nesting: number): number => {\n  if (nesting > maxNesting) throw tooDeep()\n  let depth = 1\n  let index = from\n  while (index < text.length) {\n    const char = text[index]!\n    if (char === \"\\\\\") {\n      index += 2\n    } else if (char === \"'\") {\n      const close = text.indexOf(\"'\", index + 1)\n      index = close === -1 ? text.length : close + 1\n    } else if (char === \"\\\"\") {\n      index = doubleQuoteEnd(text, index + 1, nesting + 1) + 1\n    } else if (char === \"`\") {\n      index = backtickEnd(text, index + 1) + 1\n    } else {\n      if (char === \"(\") depth++\n      if (char === \")\" && --depth === 0) return index\n      index++\n    }\n  }\n  return text.length\n}\n\nconst backtickEnd = (text: string, from: number): number => {\n  let index = from\n  while (index < text.length && text[index] !== \"`\") index += text[index] === \"\\\\\" ? 2 : 1\n  return Math.min(index, text.length)\n}\n\nconst doubleQuoteEnd = (text: string, from: number, nesting: number): number => {\n  if (nesting > maxNesting) throw tooDeep()\n  let index = from\n  while (index < text.length && text[index] !== \"\\\"\") {\n    const char = text[index]!\n    if (char === \"\\\\\") index += 2\n    else if (char === \"`\") index = backtickEnd(text, index + 1) + 1\n    else if (char === \"$\" && text[index + 1] === \"(\") index = substitutionEnd(text, index + 2, nesting + 1) + 1\n    else index++\n  }\n  return Math.min(index, text.length)\n}\n\n// A hand-rolled lexer rather than one regular expression: a word is any run\n// of bare characters, quoted spans, and substitutions, and a substitution can\n// hold quotes and operators of its own. Splitting on operator characters\n// alone let `echo \"$(rm /work/target)\"` hide a delete inside one quoted word,\n// read `>|` as a pipe that turned the target into the next command's name,\n// and read `(rm /work/target)` as a command named `(rm`.\n//\n// Quotes are removed from a word's text, because `\"/outs\"ide/x` names\n// `/outside/x`; keeping the quotes made it a relative path under the\n// working directory.\n// Sticky, so the match starts at `lastIndex` without copying the rest of the\n// text for every word.\nconst descriptorPattern = /\\d+(?=[<>])/y\n\nconst lex = (command: string, nesting: number): Lexed => {\n  const tokens: Array<Token> = []\n  const substitutions: Array<string> = []\n  let index = 0\n  const substitution = (from: number, to: number): string => {\n    substitutions.push(command.slice(from, to))\n    return \"$()\"\n  }\n  while (index < command.length) {\n    const char = command[index]!\n    // Every blank the word loop stops at must be skipped here, or the lexer\n    // would push an empty word without advancing.\n    if (char !== \"\\n\" && /\\s/.test(char)) {\n      index++\n      continue\n    }\n    if (char === \"\\\\\" && command[index + 1] === \"\\n\") {\n      index += 2\n      continue\n    }\n    if (char === \"#\") {\n      while (index < command.length && command[index] !== \"\\n\") index++\n      continue\n    }\n    // A file-descriptor number belongs to the redirection after it: in\n    // `2>/dev/null rm /work/target` the command is `rm`, not `2`.\n    descriptorPattern.lastIndex = index\n    const descriptor = descriptorPattern.exec(command)\n    if (descriptor !== null) {\n      index += descriptor[0].length\n      continue\n    }\n    const operator = operators.find((candidate) => command.startsWith(candidate, index))\n    if (operator !== undefined) {\n      tokens.push({ operator: true, text: operator })\n      index += operator.length\n      continue\n    }\n    let text = \"\"\n    while (index < command.length) {\n      const next = command[index]!\n      if (/[\\s<>;|&()]/.test(next)) break\n      if (next === \"\\\\\") {\n        // A backslash escapes shell syntax. Before any other character it is\n        // kept, so `C:\\work\\input` stays the path it names on Windows rather\n        // than collapsing to a word the scan cannot see as a path.\n        const escaped = command[index + 1] ?? \"\"\n        if (escaped !== \"\\n\") text += /[\\s<>;|&()'\"`$\\\\#]/.test(escaped) ? escaped : `\\\\${escaped}`\n        index += 2\n      } else if (next === \"'\") {\n        const close = command.indexOf(\"'\", index + 1)\n        const end = close === -1 ? command.length : close\n        text += command.slice(index + 1, end)\n        index = end + 1\n      } else if (next === \"\\\"\") {\n        const end = doubleQuoteEnd(command, index + 1, nesting + 1)\n        let inner = index + 1\n        while (inner < end) {\n          const quoted = command[inner]!\n          if (quoted === \"\\\\\" && /[$`\"\\\\\\n]/.test(command[inner + 1] ?? \"\")) {\n            if (command[inner + 1] !== \"\\n\") text += command[inner + 1]\n            inner += 2\n          } else if (quoted === \"`\") {\n            const close = backtickEnd(command, inner + 1)\n            text += substitution(inner + 1, close)\n            inner = close + 1\n          } else if (quoted === \"$\" && command[inner + 1] === \"(\") {\n            const close = substitutionEnd(command, inner + 2, nesting + 2)\n            text += substitution(inner + 2, close)\n            inner = close + 1\n          } else {\n            text += quoted\n            inner++\n          }\n        }\n        index = end + 1\n      } else if (next === \"`\") {\n        const close = backtickEnd(command, index + 1)\n        text += substitution(index + 1, close)\n        index = close + 1\n      } else if (next === \"$\" && command[index + 1] === \"(\") {\n        const close = substitutionEnd(command, index + 2, nesting + 1)\n        text += substitution(index + 2, close)\n        index = close + 1\n      } else {\n        text += next\n        index++\n      }\n    }\n    tokens.push({ operator: false, text })\n  }\n  return { tokens, substitutions }\n}\n\n// A parenthesis is an operator to the lexer, so one left in a word was quoted\n// and is part of the name; only a trailing comma is punctuation.\nconst pathValue = (token: string): string => token.replace(/,+$/, \"\")\n\nconst isPathToken = (path: Path.Path, token: string): boolean =>\n  token === \".\" ||\n  token === \"..\" ||\n  token.startsWith(\"./\") ||\n  token.startsWith(\"../\") ||\n  path.isAbsolute(token) ||\n  /^[A-Za-z]:[\\\\/]/.test(token) ||\n  token.includes(\"/\")\n\nconst segmentReferences = (\n  path: Path.Path,\n  tokens: ReadonlyArray<Token>,\n  nesting: number\n): ReadonlyArray<PathReference> => {\n  // The word after a redirection operator is its target, never the command.\n  const isTarget = (index: number): boolean => index > 0 && isRedirection(tokens[index - 1]!)\n  const isWord = (index: number): boolean => !tokens[index]!.operator && !isTarget(index)\n  const name = (index: number): string => path.basename(pathValue(tokens[index]!.text))\n  const hasWrapper = tokens.some((_, index) => isWord(index) && prefixWrappers.has(name(index)))\n  let commandIndex = tokens.findIndex((token, index) =>\n    isWord(index) &&\n    !token.text.includes(\"=\") &&\n    !prefixWrappers.has(name(index)) &&\n    !reservedWords.has(token.text) &&\n    !token.text.startsWith(\"-\") &&\n    token.text !== \"\"\n  )\n  if (hasWrapper) {\n    // Wrapper options can carry their own values. Prefer a later known\n    // mutating command so an option value cannot lend it a read classification.\n    const mutatingIndex = tokens.findIndex((_, index) =>\n      isWord(index) && (writeCommands.has(name(index)) || destinationCommands.has(name(index)))\n    )\n    if (mutatingIndex !== -1) commandIndex = mutatingIndex\n  }\n\n  const command = commandIndex === -1 ? \"\" : name(commandIndex)\n  // Shell text handed to `eval` or to a shell's `-c` flag is a command, not a\n  // path: reading `sh -c 'rm /work/target'` as one quoted word let a delete\n  // pass as a read of a file named `rm /work/target`.\n  const scripts = new Set<number>()\n  if (command === \"eval\") {\n    for (let index = commandIndex + 1; index < tokens.length; index++) if (isWord(index)) scripts.add(index)\n  } else if (shells.has(command)) {\n    const flag = tokens.findIndex((token, index) =>\n      index > commandIndex && isWord(index) && commandFlag.test(token.text)\n    )\n    if (flag !== -1 && flag + 1 < tokens.length && isWord(flag + 1)) scripts.add(flag + 1)\n  }\n  const candidates: Array<{ readonly index: number; readonly value: string }> = []\n  for (let index = 0; index < tokens.length; index++) {\n    const token = tokens[index]!\n    if (index === commandIndex || scripts.has(index) || token.operator) continue\n    if (!isTarget(index) && token.text.startsWith(\"-\")) continue\n    if (isTarget(index) && textRedirections.has(tokens[index - 1]!.text)) continue\n    const value = pathValue(token.text)\n    if (value !== \"\" && isPathToken(path, value)) candidates.push({ index, value })\n  }\n\n  const destinationIndex = destinationCommands.has(command)\n    ? candidates.filter(({ index }) => !isTarget(index)).at(-1)?.index\n    : undefined\n\n  const script = [...scripts].map((index) => tokens[index]!.text).join(\" \")\n  const nested = script === \"\" ? [] : references(path, script, nesting + 1)\n  const named = candidates.map(({ index, value }): PathReference => {\n    const access: Access = isTarget(index)\n      ? writeRedirections.has(tokens[index - 1]!.text) ? \"write\" : \"read\"\n      : writeCommands.has(command) || destinationIndex === index\n      ? \"write\"\n      : \"read\"\n    return { access, value }\n  })\n  return [...named, ...nested]\n}\n\nconst references = (path: Path.Path, command: string, nesting: number): ReadonlyArray<PathReference> => {\n  if (nesting > maxNesting) throw tooDeep()\n  const { substitutions, tokens } = lex(command, nesting)\n  const found: Array<PathReference> = []\n  let segment: Array<Token> = []\n  for (const token of tokens) {\n    if (token.operator && commandSeparators.has(token.text)) {\n      found.push(...segmentReferences(path, segment, nesting))\n      segment = []\n    } else {\n      segment.push(token)\n    }\n  }\n  found.push(...segmentReferences(path, segment, nesting))\n  // A substitution runs its body as a command; its paths count like any other.\n  for (const body of substitutions) found.push(...references(path, body, nesting + 1))\n  return found\n}\n\n/**\n * Every path token the shell text names, one segment at a time.\n *\n * @throws {StdError.StdError} `invalid_input` when substitutions or quotes nest\n * deeper than the scan reads.\n * @category pre-check\n * @since 1.0.0\n */\nexport const commandReferences = (path: Path.Path, command: string): ReadonlyArray<PathReference> =>\n  references(path, command, 0)\n\nconst resolvePath = (\n  path: Path.Path,\n  cwd: string,\n  value: string\n): string => path.isAbsolute(value) ? path.normalize(value) : path.resolve(cwd, value)\n\nconst isDeclared = (\n  path: Path.Path,\n  cwd: string,\n  declared: ReadonlyArray<string>,\n  source: string\n): boolean =>\n  withinEnvelope(\n    declared.map((entry) => resolvePath(path, cwd, entry)),\n    resolvePath(path, cwd, source)\n  )\n\n/**\n * The refusal shell text earns by naming a path outside its declared\n * envelope, or `undefined` when every path it names is declared.\n *\n * @category pre-check\n * @since 1.0.0\n */\nexport const outsideEnvelope = (\n  input: Envelope,\n  text: string,\n  path: Path.Path\n): StdError.StdError | undefined => {\n  const base = path.resolve(\".\")\n  const cwd = path.resolve(input.cwd ?? \".\")\n  // Passing the default explicitly is not a declaration the caller owes. A\n  // working directory is where the command runs, not a file it reads, and\n  // `cwd: \".\"` names exactly what omitting `cwd` names \u2014 so refusing it asked\n  // the caller to list the workspace root among its reads to say nothing at\n  // all. Agents hit this constantly: one SWE-bench run spent ten of its\n  // forty-eight tool calls re-issuing the same command after\n  // \"Working directory is outside declared reads: <the workspace root>\". A\n  // cwd that points somewhere else is still declared or refused.\n  if (input.cwd !== undefined && cwd !== base && !isDeclared(path, cwd, input.reads, cwd)) {\n    return new StdError.StdError({\n      code: \"outside_declared_reads\",\n      message: `Working directory is outside declared reads: ${cwd}`,\n      path: cwd\n    })\n  }\n\n  // The Shell contract currently has no sandbox or access-reporting surface.\n  // This lexical scan is intentionally only a fail-closed pre-check for\n  // explicit path tokens. It cannot prove confinement; a kernel/host sandbox\n  // must eventually enforce and report the complete read and write sets.\n  let named: ReadonlyArray<PathReference>\n  try {\n    named = commandReferences(path, text)\n  } catch {\n    // The depth bound is the one failure the scan raises, and a text the scan\n    // cannot read is refused whatever the reason, never run unchecked.\n    return tooDeep()\n  }\n  for (const reference of named) {\n    const resolved = resolvePath(path, cwd, reference.value)\n    // /dev/* is the process plumbing every shell one-liner leans on:\n    // `2>/dev/null`, `cat /dev/stdin`. Normalize first so a dot-dot segment\n    // cannot disguise an ordinary filesystem path as process plumbing.\n    if (resolved.startsWith(\"/dev/\")) continue\n    const declared = reference.access === \"write\" ? input.writes : input.reads\n    if (!isDeclared(path, cwd, declared, resolved)) {\n      const code = reference.access === \"write\" ? \"outside_declared_writes\" : \"outside_declared_reads\"\n      return new StdError.StdError({\n        code,\n        message: `Command path is outside declared ${reference.access}s: ${resolved}`,\n        path: resolved\n      })\n    }\n  }\n  return undefined\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAmBA,eAA0B;AAC1B,mBAA+B;AAqC/B,MAAM,oBAAoB,oBAAI,IAAI,CAAC,MAAM,MAAM,KAAK,MAAM,MAAM,OAAO,KAAK,MAAM,KAAK,MAAM,KAAK,GAAG,CAAC;AACtG,MAAM,oBAAoB,oBAAI,IAAI,CAAC,KAAK,MAAM,MAAM,MAAM,OAAO,MAAM,IAAI,CAAC;AAC5E,MAAM,mBAAmB,oBAAI,IAAI,CAAC,KAAK,IAAI,CAAC;AAE5C,MAAM,mBAAmB,oBAAI,IAAI,CAAC,MAAM,OAAO,KAAK,CAAC;AACrD,MAAM,gBAAgB,CAAC,UACrB,MAAM,aACL,kBAAkB,IAAI,MAAM,IAAI,KAAK,iBAAiB,IAAI,MAAM,IAAI,KAAK,iBAAiB,IAAI,MAAM,IAAI;AAE3G,MAAM,YAAY;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAGA,MAAM,gBAAgB,oBAAI,IAAI;AAAA,EAC5B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACD,MAAM,gBAAgB,oBAAI,IAAI,CAAC,SAAS,SAAS,SAAS,MAAM,SAAS,OAAO,SAAS,YAAY,QAAQ,CAAC;AAC9G,MAAM,sBAAsB,oBAAI,IAAI,CAAC,MAAM,WAAW,IAAI,CAAC;AAC3D,MAAM,iBAAiB,oBAAI,IAAI,CAAC,OAAO,QAAQ,QAAQ,QAAQ,SAAS,SAAS,WAAW,MAAM,CAAC;AAEnG,MAAM,SAAS,oBAAI,IAAI,CAAC,OAAO,QAAQ,QAAQ,QAAQ,OAAO,QAAQ,MAAM,KAAK,CAAC;AAClF,MAAM,cAAc;AAwBpB,MAAM,aAAa;AAEnB,MAAM,UAAU,MACd,IAAI,SAAS,SAAS;AAAA,EACpB,MAAM;AAAA,EACN,SAAS,qDAAqD,UAAU;AAC1E,CAAC;AAEH,MAAM,kBAAkB,CAAC,MAAc,MAAc,YAA4B;AAC/E,MAAI,UAAU,WAAY,OAAM,QAAQ;AACxC,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,SAAO,QAAQ,KAAK,QAAQ;AAC1B,UAAM,OAAO,KAAK,KAAK;AACvB,QAAI,SAAS,MAAM;AACjB,eAAS;AAAA,IACX,WAAW,SAAS,KAAK;AACvB,YAAM,QAAQ,KAAK,QAAQ,KAAK,QAAQ,CAAC;AACzC,cAAQ,UAAU,KAAK,KAAK,SAAS,QAAQ;AAAA,IAC/C,WAAW,SAAS,KAAM;AACxB,cAAQ,eAAe,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI;AAAA,IACzD,WAAW,SAAS,KAAK;AACvB,cAAQ,YAAY,MAAM,QAAQ,CAAC,IAAI;AAAA,IACzC,OAAO;AACL,UAAI,SAAS,IAAK;AAClB,UAAI,SAAS,OAAO,EAAE,UAAU,EAAG,QAAO;AAC1C;AAAA,IACF;AAAA,EACF;AACA,SAAO,KAAK;AACd;AAEA,MAAM,cAAc,CAAC,MAAc,SAAyB;AAC1D,MAAI,QAAQ;AACZ,SAAO,QAAQ,KAAK,UAAU,KAAK,KAAK,MAAM,IAAK,UAAS,KAAK,KAAK,MAAM,OAAO,IAAI;AACvF,SAAO,KAAK,IAAI,OAAO,KAAK,MAAM;AACpC;AAEA,MAAM,iBAAiB,CAAC,MAAc,MAAc,YAA4B;AAC9E,MAAI,UAAU,WAAY,OAAM,QAAQ;AACxC,MAAI,QAAQ;AACZ,SAAO,QAAQ,KAAK,UAAU,KAAK,KAAK,MAAM,KAAM;AAClD,UAAM,OAAO,KAAK,KAAK;AACvB,QAAI,SAAS,KAAM,UAAS;AAAA,aACnB,SAAS,IAAK,SAAQ,YAAY,MAAM,QAAQ,CAAC,IAAI;AAAA,aACrD,SAAS,OAAO,KAAK,QAAQ,CAAC,MAAM,IAAK,SAAQ,gBAAgB,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI;AAAA,QACrG;AAAA,EACP;AACA,SAAO,KAAK,IAAI,OAAO,KAAK,MAAM;AACpC;AAcA,MAAM,oBAAoB;AAE1B,MAAM,MAAM,CAAC,SAAiB,YAA2B;AACvD,QAAM,SAAuB,CAAC;AAC9B,QAAM,gBAA+B,CAAC;AACtC,MAAI,QAAQ;AACZ,QAAM,eAAe,CAAC,MAAc,OAAuB;AACzD,kBAAc,KAAK,QAAQ,MAAM,MAAM,EAAE,CAAC;AAC1C,WAAO;AAAA,EACT;AACA,SAAO,QAAQ,QAAQ,QAAQ;AAC7B,UAAM,OAAO,QAAQ,KAAK;AAG1B,QAAI,SAAS,QAAQ,KAAK,KAAK,IAAI,GAAG;AACpC;AACA;AAAA,IACF;AACA,QAAI,SAAS,QAAQ,QAAQ,QAAQ,CAAC,MAAM,MAAM;AAChD,eAAS;AACT;AAAA,IACF;AACA,QAAI,SAAS,KAAK;AAChB,aAAO,QAAQ,QAAQ,UAAU,QAAQ,KAAK,MAAM,KAAM;AAC1D;AAAA,IACF;AAGA,sBAAkB,YAAY;AAC9B,UAAM,aAAa,kBAAkB,KAAK,OAAO;AACjD,QAAI,eAAe,MAAM;AACvB,eAAS,WAAW,CAAC,EAAE;AACvB;AAAA,IACF;AACA,UAAM,WAAW,UAAU,KAAK,CAAC,cAAc,QAAQ,WAAW,WAAW,KAAK,CAAC;AACnF,QAAI,aAAa,QAAW;AAC1B,aAAO,KAAK,EAAE,UAAU,MAAM,MAAM,SAAS,CAAC;AAC9C,eAAS,SAAS;AAClB;AAAA,IACF;AACA,QAAI,OAAO;AACX,WAAO,QAAQ,QAAQ,QAAQ;AAC7B,YAAM,OAAO,QAAQ,KAAK;AAC1B,UAAI,cAAc,KAAK,IAAI,EAAG;AAC9B,UAAI,SAAS,MAAM;AAIjB,cAAM,UAAU,QAAQ,QAAQ,CAAC,KAAK;AACtC,YAAI,YAAY,KAAM,SAAQ,qBAAqB,KAAK,OAAO,IAAI,UAAU,KAAK,OAAO;AACzF,iBAAS;AAAA,MACX,WAAW,SAAS,KAAK;AACvB,cAAM,QAAQ,QAAQ,QAAQ,KAAK,QAAQ,CAAC;AAC5C,cAAM,MAAM,UAAU,KAAK,QAAQ,SAAS;AAC5C,gBAAQ,QAAQ,MAAM,QAAQ,GAAG,GAAG;AACpC,gBAAQ,MAAM;AAAA,MAChB,WAAW,SAAS,KAAM;AACxB,cAAM,MAAM,eAAe,SAAS,QAAQ,GAAG,UAAU,CAAC;AAC1D,YAAI,QAAQ,QAAQ;AACpB,eAAO,QAAQ,KAAK;AAClB,gBAAM,SAAS,QAAQ,KAAK;AAC5B,cAAI,WAAW,QAAQ,YAAY,KAAK,QAAQ,QAAQ,CAAC,KAAK,EAAE,GAAG;AACjE,gBAAI,QAAQ,QAAQ,CAAC,MAAM,KAAM,SAAQ,QAAQ,QAAQ,CAAC;AAC1D,qBAAS;AAAA,UACX,WAAW,WAAW,KAAK;AACzB,kBAAM,QAAQ,YAAY,SAAS,QAAQ,CAAC;AAC5C,oBAAQ,aAAa,QAAQ,GAAG,KAAK;AACrC,oBAAQ,QAAQ;AAAA,UAClB,WAAW,WAAW,OAAO,QAAQ,QAAQ,CAAC,MAAM,KAAK;AACvD,kBAAM,QAAQ,gBAAgB,SAAS,QAAQ,GAAG,UAAU,CAAC;AAC7D,oBAAQ,aAAa,QAAQ,GAAG,KAAK;AACrC,oBAAQ,QAAQ;AAAA,UAClB,OAAO;AACL,oBAAQ;AACR;AAAA,UACF;AAAA,QACF;AACA,gBAAQ,MAAM;AAAA,MAChB,WAAW,SAAS,KAAK;AACvB,cAAM,QAAQ,YAAY,SAAS,QAAQ,CAAC;AAC5C,gBAAQ,aAAa,QAAQ,GAAG,KAAK;AACrC,gBAAQ,QAAQ;AAAA,MAClB,WAAW,SAAS,OAAO,QAAQ,QAAQ,CAAC,MAAM,KAAK;AACrD,cAAM,QAAQ,gBAAgB,SAAS,QAAQ,GAAG,UAAU,CAAC;AAC7D,gBAAQ,aAAa,QAAQ,GAAG,KAAK;AACrC,gBAAQ,QAAQ;AAAA,MAClB,OAAO;AACL,gBAAQ;AACR;AAAA,MACF;AAAA,IACF;AACA,WAAO,KAAK,EAAE,UAAU,OAAO,KAAK,CAAC;AAAA,EACvC;AACA,SAAO,EAAE,QAAQ,cAAc;AACjC;AAIA,MAAM,YAAY,CAAC,UAA0B,MAAM,QAAQ,OAAO,EAAE;AAEpE,MAAM,cAAc,CAAC,MAAiB,UACpC,UAAU,OACV,UAAU,QACV,MAAM,WAAW,IAAI,KACrB,MAAM,WAAW,KAAK,KACtB,KAAK,WAAW,KAAK,KACrB,kBAAkB,KAAK,KAAK,KAC5B,MAAM,SAAS,GAAG;AAEpB,MAAM,oBAAoB,CACxB,MACA,QACA,YACiC;AAEjC,QAAM,WAAW,CAAC,UAA2B,QAAQ,KAAK,cAAc,OAAO,QAAQ,CAAC,CAAE;AAC1F,QAAM,SAAS,CAAC,UAA2B,CAAC,OAAO,KAAK,EAAG,YAAY,CAAC,SAAS,KAAK;AACtF,QAAM,OAAO,CAAC,UAA0B,KAAK,SAAS,UAAU,OAAO,KAAK,EAAG,IAAI,CAAC;AACpF,QAAM,aAAa,OAAO,KAAK,CAAC,GAAG,UAAU,OAAO,KAAK,KAAK,eAAe,IAAI,KAAK,KAAK,CAAC,CAAC;AAC7F,MAAI,eAAe,OAAO;AAAA,IAAU,CAAC,OAAO,UAC1C,OAAO,KAAK,KACZ,CAAC,MAAM,KAAK,SAAS,GAAG,KACxB,CAAC,eAAe,IAAI,KAAK,KAAK,CAAC,KAC/B,CAAC,cAAc,IAAI,MAAM,IAAI,KAC7B,CAAC,MAAM,KAAK,WAAW,GAAG,KAC1B,MAAM,SAAS;AAAA,EACjB;AACA,MAAI,YAAY;AAGd,UAAM,gBAAgB,OAAO;AAAA,MAAU,CAAC,GAAG,UACzC,OAAO,KAAK,MAAM,cAAc,IAAI,KAAK,KAAK,CAAC,KAAK,oBAAoB,IAAI,KAAK,KAAK,CAAC;AAAA,IACzF;AACA,QAAI,kBAAkB,GAAI,gBAAe;AAAA,EAC3C;AAEA,QAAM,UAAU,iBAAiB,KAAK,KAAK,KAAK,YAAY;AAI5D,QAAM,UAAU,oBAAI,IAAY;AAChC,MAAI,YAAY,QAAQ;AACtB,aAAS,QAAQ,eAAe,GAAG,QAAQ,OAAO,QAAQ,QAAS,KAAI,OAAO,KAAK,EAAG,SAAQ,IAAI,KAAK;AAAA,EACzG,WAAW,OAAO,IAAI,OAAO,GAAG;AAC9B,UAAM,OAAO,OAAO;AAAA,MAAU,CAAC,OAAO,UACpC,QAAQ,gBAAgB,OAAO,KAAK,KAAK,YAAY,KAAK,MAAM,IAAI;AAAA,IACtE;AACA,QAAI,SAAS,MAAM,OAAO,IAAI,OAAO,UAAU,OAAO,OAAO,CAAC,EAAG,SAAQ,IAAI,OAAO,CAAC;AAAA,EACvF;AACA,QAAM,aAAwE,CAAC;AAC/E,WAAS,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS;AAClD,UAAM,QAAQ,OAAO,KAAK;AAC1B,QAAI,UAAU,gBAAgB,QAAQ,IAAI,KAAK,KAAK,MAAM,SAAU;AACpE,QAAI,CAAC,SAAS,KAAK,KAAK,MAAM,KAAK,WAAW,GAAG,EAAG;AACpD,QAAI,SAAS,KAAK,KAAK,iBAAiB,IAAI,OAAO,QAAQ,CAAC,EAAG,IAAI,EAAG;AACtE,UAAM,QAAQ,UAAU,MAAM,IAAI;AAClC,QAAI,UAAU,MAAM,YAAY,MAAM,KAAK,EAAG,YAAW,KAAK,EAAE,OAAO,MAAM,CAAC;AAAA,EAChF;AAEA,QAAM,mBAAmB,oBAAoB,IAAI,OAAO,IACpD,WAAW,OAAO,CAAC,EAAE,MAAM,MAAM,CAAC,SAAS,KAAK,CAAC,EAAE,GAAG,EAAE,GAAG,QAC3D;AAEJ,QAAM,SAAS,CAAC,GAAG,OAAO,EAAE,IAAI,CAAC,UAAU,OAAO,KAAK,EAAG,IAAI,EAAE,KAAK,GAAG;AACxE,QAAM,SAAS,WAAW,KAAK,CAAC,IAAI,WAAW,MAAM,QAAQ,UAAU,CAAC;AACxE,QAAM,QAAQ,WAAW,IAAI,CAAC,EAAE,OAAO,MAAM,MAAqB;AAChE,UAAM,SAAiB,SAAS,KAAK,IACjC,kBAAkB,IAAI,OAAO,QAAQ,CAAC,EAAG,IAAI,IAAI,UAAU,SAC3D,cAAc,IAAI,OAAO,KAAK,qBAAqB,QACnD,UACA;AACJ,WAAO,EAAE,QAAQ,MAAM;AAAA,EACzB,CAAC;AACD,SAAO,CAAC,GAAG,OAAO,GAAG,MAAM;AAC7B;AAEA,MAAM,aAAa,CAAC,MAAiB,SAAiB,YAAkD;AACtG,MAAI,UAAU,WAAY,OAAM,QAAQ;AACxC,QAAM,EAAE,eAAe,OAAO,IAAI,IAAI,SAAS,OAAO;AACtD,QAAM,QAA8B,CAAC;AACrC,MAAI,UAAwB,CAAC;AAC7B,aAAW,SAAS,QAAQ;AAC1B,QAAI,MAAM,YAAY,kBAAkB,IAAI,MAAM,IAAI,GAAG;AACvD,YAAM,KAAK,GAAG,kBAAkB,MAAM,SAAS,OAAO,CAAC;AACvD,gBAAU,CAAC;AAAA,IACb,OAAO;AACL,cAAQ,KAAK,KAAK;AAAA,IACpB;AAAA,EACF;AACA,QAAM,KAAK,GAAG,kBAAkB,MAAM,SAAS,OAAO,CAAC;AAEvD,aAAW,QAAQ,cAAe,OAAM,KAAK,GAAG,WAAW,MAAM,MAAM,UAAU,CAAC,CAAC;AACnF,SAAO;AACT;AAUO,MAAM,oBAAoB,CAAC,MAAiB,YACjD,WAAW,MAAM,SAAS,CAAC;AAE7B,MAAM,cAAc,CAClB,MACA,KACA,UACW,KAAK,WAAW,KAAK,IAAI,KAAK,UAAU,KAAK,IAAI,KAAK,QAAQ,KAAK,KAAK;AAErF,MAAM,aAAa,CACjB,MACA,KACA,UACA,eAEA;AAAA,EACE,SAAS,IAAI,CAAC,UAAU,YAAY,MAAM,KAAK,KAAK,CAAC;AAAA,EACrD,YAAY,MAAM,KAAK,MAAM;AAC/B;AASK,MAAM,kBAAkB,CAC7B,OACA,MACA,SACkC;AAClC,QAAM,OAAO,KAAK,QAAQ,GAAG;AAC7B,QAAM,MAAM,KAAK,QAAQ,MAAM,OAAO,GAAG;AASzC,MAAI,MAAM,QAAQ,UAAa,QAAQ,QAAQ,CAAC,WAAW,MAAM,KAAK,MAAM,OAAO,GAAG,GAAG;AACvF,WAAO,IAAI,SAAS,SAAS;AAAA,MAC3B,MAAM;AAAA,MACN,SAAS,gDAAgD,GAAG;AAAA,MAC5D,MAAM;AAAA,IACR,CAAC;AAAA,EACH;AAMA,MAAI;AACJ,MAAI;AACF,YAAQ,kBAAkB,MAAM,IAAI;AAAA,EACtC,QAAQ;AAGN,WAAO,QAAQ;AAAA,EACjB;AACA,aAAW,aAAa,OAAO;AAC7B,UAAM,WAAW,YAAY,MAAM,KAAK,UAAU,KAAK;AAIvD,QAAI,SAAS,WAAW,OAAO,EAAG;AAClC,UAAM,WAAW,UAAU,WAAW,UAAU,MAAM,SAAS,MAAM;AACrE,QAAI,CAAC,WAAW,MAAM,KAAK,UAAU,QAAQ,GAAG;AAC9C,YAAM,OAAO,UAAU,WAAW,UAAU,4BAA4B;AACxE,aAAO,IAAI,SAAS,SAAS;AAAA,QAC3B;AAAA,QACA,SAAS,oCAAoC,UAAU,MAAM,MAAM,QAAQ;AAAA,QAC3E,MAAM;AAAA,MACR,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;",
+  "names": []
+}

package/dist/cjs/internal/Exec.d.ts

@@ -0,0 +1,151 @@
+/**
+ * Buffered shell execution over the permission-aware process spawner.
+ *
+ * `@smthrs/kernel` used to expose a `Shell` service whose `exec` returned a
+ * buffered `{ stdout, stderr, exitCode }`. The kernel replaced it with
+ * `ChildProcessSpawner`, Effect's own process boundary, which streams and has
+ * no buffered form. This module is the buffered form the shell flows still
+ * want, expressed in terms of the spawner so the `proc:spawn` capability check
+ * and the command-line resource stay exactly where the kernel put them.
+ *
+ * Commands run through the platform shell (`shell: true`), matching the old
+ * service: the flows take a command *line*, not an argv.
+ *
+ * @since 1.0.0
+ */
+import * as ChildProcessSpawner from "@smthrs/kernel/ChildProcessSpawner";
+import * as Effect from "effect/Effect";
+import * as Schema from "effect/Schema";
+import * as StdError from "../StdError.ts";
+/**
+ * Failure codes a buffered execution can report, matching the codes the
+ * removed kernel `Shell` used so handler-level mapping is unchanged.
+ *
+ * @category models
+ * @since 1.0.0
+ */
+export declare const ExecErrorCode: Schema.Literals<readonly ["timeout", "spawn_error", "arguments_too_long", "capture_overflow"]>;
+/**
+ * Failure codes a buffered execution can report.
+ *
+ * @category models
+ * @since 1.0.0
+ */
+export type ExecErrorCode = typeof ExecErrorCode.Type;
+declare const ExecError_base: Schema.Class<ExecError, Schema.TaggedStruct<"@smthrs/std/ExecError", {
+    readonly code: Schema.Literals<readonly ["timeout", "spawn_error", "arguments_too_long", "capture_overflow"]>;
+    readonly message: Schema.String;
+    /** The limit a `timeout` ran past, in milliseconds. */
+    readonly limitMillis: Schema.optional<Schema.Number>;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * A command that never produced an exit code.
+ *
+ * A non-zero exit is a successful {@link ExecResult}, not a failure; this
+ * error is reserved for a command that could not start (`arguments_too_long`
+ * when the operating system refused it for the size of its arguments) or was
+ * cut off by its timeout, or whose captured output exceeded a refusing capture
+ * bound.
+ *
+ * @category errors
+ * @since 1.0.0
+ */
+export declare class ExecError extends ExecError_base {
+}
+/**
+ * The buffered result of one command.
+ *
+ * @category models
+ * @since 1.0.0
+ */
+export interface ExecResult {
+    readonly stdout: string;
+    readonly stderr: string;
+    readonly exitCode: number;
+    /** UTF-8 bytes of stdout dropped to stay inside the capture bound; see `overflow`. */
+    readonly stdoutDroppedBytes: number;
+    /** UTF-8 bytes of stderr dropped to stay inside the capture bound; see `overflow`. */
+    readonly stderrDroppedBytes: number;
+}
+/**
+ * Options accepted by {@link exec}.
+ *
+ * @category models
+ * @since 1.0.0
+ */
+export interface ExecOptions {
+    readonly cwd?: string | undefined;
+    readonly env?: Readonly<Record<string, string>> | undefined;
+    readonly timeoutMs?: number | undefined;
+    /**
+     * The program's arguments. Present means an argv, absent means a command
+     * line for the platform shell. An argv is how a payload reaches a program
+     * without being quoted into a string: nothing between here and `execve`
+     * re-parses it.
+     */
+    readonly args?: ReadonlyArray<string> | undefined;
+    /**
+     * Text written to the program's standard input, as data. A script delivered
+     * this way is never quoted, escaped, or heredoc-terminated, which is the
+     * whole point: quoting corruption cost the measured SWE-bench program twelve
+     * probe failures and one instance's most expensive frame.
+     */
+    readonly stdin?: string | undefined;
+    /**
+     * Bytes retained per captured stream. A stream that prints more keeps what
+     * `overflow` names and reports what it dropped, so a command printing
+     * gigabytes costs a bounded amount of memory rather than the whole of what it
+     * printed.
+     *
+     * Absent means unbounded, which is what a caller wants when it needs every
+     * byte a tool produced (`rg --files`, `git worktree list`).
+     */
+    readonly maxCaptureBytes?: number | undefined;
+    /**
+     * What a stream past the bound keeps. `tail`, the default, keeps its last
+     * bytes. `ends` keeps its first and last halves and puts one line naming the
+     * dropped bytes where the middle was. `refuse` fails if either stream exceeds
+     * the bound.
+     */
+    readonly overflow?: Overflow | undefined;
+}
+type Overflow = "tail" | "ends" | "refuse";
+/**
+ * Runs a command line through the platform shell and buffers its output.
+ *
+ * Cancellation is scope closure: the spawn is scoped, so an interrupted fiber
+ * — including the one a `timeoutMs` interrupts — terminates the process rather
+ * than leaking it.
+ *
+ * @category execution
+ * @since 1.0.0
+ */
+export declare const exec: (command: string, options?: ExecOptions) => Effect.Effect<ExecResult, ExecError, ChildProcessSpawner.ChildProcessSpawner>;
+/**
+ * The model-facing failure code a command that never produced an exit code
+ * carries.
+ *
+ * A timeout keeps its own code, because "the command never finished" and "the
+ * command never started" are different things to a caller deciding whether to
+ * retry. Arguments the operating system refused for their size are the
+ * caller's own input, which a shell flow publishes, so they read as
+ * `invalid_input`. Every other way of producing no exit code is a host failure.
+ *
+ * @category errors
+ * @since 1.0.0
+ */
+export declare const toStdErrorCode: (error: ExecError) => StdError.Code;
+/**
+ * The model-facing failure one execution error becomes.
+ *
+ * A timeout names the command, which is what the caller asked for and all a
+ * timeout has to say. Arguments too long to start carry the reason and the
+ * fix, and nothing of the command. Any other failure carries the message the
+ * execution produced, which already names the command.
+ *
+ * @category errors
+ * @since 1.0.0
+ */
+export declare const toStdError: (command: string, error: ExecError) => StdError.StdError;
+export {};
+//# sourceMappingURL=Exec.d.ts.map

package/dist/cjs/internal/Exec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Exec.d.ts","sourceRoot":"","sources":["../../../src/internal/Exec.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAGH,OAAO,KAAK,mBAAmB,MAAM,oCAAoC,CAAA;AACzE,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AAEvC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AAEvC,OAAO,KAAK,QAAQ,MAAM,gBAAgB,CAAA;AAG1C;;;;;;GAMG;AACH,eAAO,MAAM,aAAa,gGAAwF,CAAA;AAElH;;;;;GAKG;AACH,MAAM,MAAM,aAAa,GAAG,OAAO,aAAa,CAAC,IAAI,CAAA;;;;IAiBnD,uDAAuD;;;AAfzD;;;;;;;;;;;GAWG;AACH,qBAAa,SAAU,SAAQ,cAK7B;CAAG;AAEL;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,sFAAsF;IACtF,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAA;IACnC,sFAAsF;IACtF,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAA;CACpC;AAED;;;;;GAKG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACjC,QAAQ,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,SAAS,CAAA;IAC3D,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACvC;;;;;OAKG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,SAAS,CAAA;IACjD;;;;;OAKG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACnC;;;;;;;;OAQG;IACH,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IAC7C;;;;;OAKG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,GAAG,SAAS,CAAA;CACzC;AAED,KAAK,QAAQ,GAAG,MAAM,GAAG,MAAM,GAAG,QAAQ,CAAA;AAkP1C;;;;;;;;;GASG;AACH,eAAO,MAAM,IAAI,GACf,SAAS,MAAM,EACf,UAAS,WAAgB,KACxB,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,SAAS,EAAE,mBAAmB,CAAC,mBAAmB,CAazE,CAAA;AAEN;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,cAAc,GAAI,OAAO,SAAS,KAAG,QAAQ,CAAC,IACsD,CAAA;AAEjH;;;;;;;;;;GAUG;AACH,eAAO,MAAM,UAAU,GAAI,SAAS,MAAM,EAAE,OAAO,SAAS,KAAG,QAAQ,CAAC,QASpE,CAAA"}