open-multi-agent-kit 0.96.1 → 0.97.0

package/dist/core/workload-family-matcher.d.ts

@@ -0,0 +1,3 @@
+import type { WorkloadClassification } from "./workload-classifier.ts";
+export declare function matchWorkloadFamily(argv: readonly string[]): WorkloadClassification;
+//# sourceMappingURL=workload-family-matcher.d.ts.map

package/dist/core/workload-family-matcher.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"workload-family-matcher.d.ts","sourceRoot":"","sources":["../../src/core/workload-family-matcher.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAiB,sBAAsB,EAAyB,MAAM,0BAA0B,CAAC;AA4C7G,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,GAAG,sBAAsB,CAQnF","sourcesContent":["import type { WorkloadClass, WorkloadClassification, WorkloadCommandFamily } from \"./workload-classifier.ts\";\n\nconst LIGHT_EXECUTABLES = new Set([\n\t\"ls\",\n\t\"cat\",\n\t\"head\",\n\t\"tail\",\n\t\"grep\",\n\t\"rg\",\n\t\"find\",\n\t\"echo\",\n\t\"pwd\",\n\t\"which\",\n\t\"wc\",\n\t\"stat\",\n\t\"file\",\n\t\"true\",\n\t\"false\",\n]);\nconst LIGHT_GIT_SUBCOMMANDS = new Set([\"status\", \"log\", \"diff\", \"show\", \"branch\", \"rev-parse\", \"blame\"]);\nconst IO_EXECUTABLES = new Set([\"cp\", \"mv\", \"rsync\", \"mkdir\", \"touch\", \"dd\"]);\nconst CPU_EXECUTABLES = new Set([\"eslint\", \"prettier\", \"biome\", \"ruff\", \"gofmt\", \"rustfmt\"]);\nconst PACKAGE_MANAGERS = new Set([\"npm\", \"pnpm\", \"yarn\", \"bun\"]);\nconst JS_TEST_RUNNERS = new Set([\"vitest\", \"jest\"]);\nconst SHARD_CONFLICT_FLAGS = [\"--shard\", \"--runInBand\", \"--coverage\", \"--watch\", \"-u\", \"--updateSnapshot\", \"-w\"];\n\nfunction classification(\n\tworkloadClass: WorkloadClass,\n\tcommandFamily: WorkloadCommandFamily,\n\toptions?: { readonly safeToAutoShard?: boolean; readonly extraReasons?: readonly string[] },\n): WorkloadClassification {\n\treturn {\n\t\tworkloadClass,\n\t\tcommandFamily,\n\t\tcomplexity: \"simple-argv\",\n\t\tsafeToAutoShard: options?.safeToAutoShard ?? false,\n\t\treasonCodes: [`family.${commandFamily}`, `class.${workloadClass}`, ...(options?.extraReasons ?? [])],\n\t};\n}\n\nfunction hasShardConflictFlag(argv: readonly string[]): boolean {\n\treturn argv.some((token) => SHARD_CONFLICT_FLAGS.some((flag) => token === flag || token.startsWith(`${flag}=`)));\n}\n\nexport function matchWorkloadFamily(argv: readonly string[]): WorkloadClassification {\n\tconst executable = basename(argv[0]);\n\tconst rest = argv.slice(1);\n\treturn (\n\t\tmatchToolchainFamily(executable, rest) ??\n\t\tmatchInfraFamily(executable, rest) ??\n\t\tmatchTierFallback(executable, rest)\n\t);\n}\n\n/** JS/TS/Go/Rust toolchains (§9.2 first block). */\nfunction matchToolchainFamily(executable: string, rest: readonly string[]): WorkloadClassification | null {\n\tif (JS_TEST_RUNNERS.has(executable)) {\n\t\t// §12.2: direct vitest/jest invocations are shard candidates unless a\n\t\t// conflicting flag changes semantics; the M5 planner enforces the rest.\n\t\tconst conflict = hasShardConflictFlag(rest);\n\t\treturn classification(\"heavy\", \"node-test\", {\n\t\t\tsafeToAutoShard: !conflict,\n\t\t\textraReasons: conflict ? [\"shard.flag.conflict\"] : [],\n\t\t});\n\t}\n\tif (PACKAGE_MANAGERS.has(executable)) {\n\t\tconst script = rest[0] === \"run\" ? rest[1] : rest[0];\n\t\tif (script === \"test\" || script === \"t\" || script?.startsWith(\"test\")) {\n\t\t\t// Opaque wrapper: the underlying runner is unknown statically (§12.1).\n\t\t\treturn classification(\"heavy\", \"node-test\", { extraReasons: [\"shard.wrapper.opaque\"] });\n\t\t}\n\t\tif (script === \"build\" || script?.startsWith(\"build\")) {\n\t\t\treturn classification(\"heavy\", \"node-build\");\n\t\t}\n\t\treturn classification(\"unknown\", \"generic-process\");\n\t}\n\tif (executable === \"tsc\") {\n\t\tconst hasProjectFlag = rest.some((token) => [\"-p\", \"--project\", \"-b\", \"--build\"].includes(token));\n\t\tconst hasFileArg = rest.some((token) => !token.startsWith(\"-\"));\n\t\tif (hasProjectFlag || !hasFileArg) {\n\t\t\treturn classification(\"heavy\", \"typescript\");\n\t\t}\n\t\treturn classification(\"cpu\", \"typescript\");\n\t}\n\tif (executable === \"go\" && rest[0] === \"test\") {\n\t\tconst packageArgs = rest.slice(1).filter((token) => !token.startsWith(\"-\"));\n\t\tconst recursive = packageArgs.some((token) => token.endsWith(\"...\"));\n\t\tif (recursive || packageArgs.length >= 2) {\n\t\t\treturn classification(\"heavy\", \"go-test\", { safeToAutoShard: recursive && !rest.includes(\"-run\") });\n\t\t}\n\t\treturn classification(\"cpu\", \"go-test\");\n\t}\n\tif (executable === \"cargo\" && [\"build\", \"test\", \"check\", \"clippy\"].includes(rest[0] ?? \"\")) {\n\t\treturn classification(\"heavy\", \"rust-build\");\n\t}\n\treturn null;\n}\n\n/** Container/monorepo/archive tooling (§9.2 second block). */\nfunction matchInfraFamily(executable: string, rest: readonly string[]): WorkloadClassification | null {\n\tif ((executable === \"docker\" || executable === \"podman\") && rest[0] === \"build\") {\n\t\treturn classification(\"heavy\", \"container-build\");\n\t}\n\tif ((executable === \"nx\" && rest[0] === \"run-many\") || (executable === \"turbo\" && rest[0] === \"run\")) {\n\t\treturn classification(\"heavy\", \"monorepo\");\n\t}\n\tif (executable === \"tar\") {\n\t\tconst flags = rest[0] ?? \"\";\n\t\tif (flags.includes(\"c\") || rest.includes(\"--create\")) {\n\t\t\treturn classification(\"heavy\", \"archive\");\n\t\t}\n\t\treturn classification(\"io\", \"archive\");\n\t}\n\tif ((executable === \"zip\" && rest.includes(\"-r\")) || (executable === \"7z\" && rest[0] === \"a\")) {\n\t\treturn classification(\"heavy\", \"archive\");\n\t}\n\treturn null;\n}\n\n/** Known light/io/cpu tiers, else unknown/generic-process. */\nfunction matchTierFallback(executable: string, rest: readonly string[]): WorkloadClassification {\n\tif (executable === \"git\" && LIGHT_GIT_SUBCOMMANDS.has(rest[0] ?? \"\")) {\n\t\treturn classification(\"light\", \"generic-process\");\n\t}\n\tif (LIGHT_EXECUTABLES.has(executable)) {\n\t\treturn classification(\"light\", \"generic-process\");\n\t}\n\tif (IO_EXECUTABLES.has(executable)) {\n\t\treturn classification(\"io\", \"generic-process\");\n\t}\n\tif (CPU_EXECUTABLES.has(executable)) {\n\t\treturn classification(\"cpu\", \"generic-process\");\n\t}\n\treturn classification(\"unknown\", \"generic-process\");\n}\n\nfunction basename(token: string): string {\n\tconst slash = token.lastIndexOf(\"/\");\n\treturn slash === -1 ? token : token.slice(slash + 1);\n}\n"]}

package/dist/core/workload-family-matcher.js

@@ -0,0 +1,126 @@
+const LIGHT_EXECUTABLES = new Set([
+    "ls",
+    "cat",
+    "head",
+    "tail",
+    "grep",
+    "rg",
+    "find",
+    "echo",
+    "pwd",
+    "which",
+    "wc",
+    "stat",
+    "file",
+    "true",
+    "false",
+]);
+const LIGHT_GIT_SUBCOMMANDS = new Set(["status", "log", "diff", "show", "branch", "rev-parse", "blame"]);
+const IO_EXECUTABLES = new Set(["cp", "mv", "rsync", "mkdir", "touch", "dd"]);
+const CPU_EXECUTABLES = new Set(["eslint", "prettier", "biome", "ruff", "gofmt", "rustfmt"]);
+const PACKAGE_MANAGERS = new Set(["npm", "pnpm", "yarn", "bun"]);
+const JS_TEST_RUNNERS = new Set(["vitest", "jest"]);
+const SHARD_CONFLICT_FLAGS = ["--shard", "--runInBand", "--coverage", "--watch", "-u", "--updateSnapshot", "-w"];
+function classification(workloadClass, commandFamily, options) {
+    return {
+        workloadClass,
+        commandFamily,
+        complexity: "simple-argv",
+        safeToAutoShard: options?.safeToAutoShard ?? false,
+        reasonCodes: [`family.${commandFamily}`, `class.${workloadClass}`, ...(options?.extraReasons ?? [])],
+    };
+}
+function hasShardConflictFlag(argv) {
+    return argv.some((token) => SHARD_CONFLICT_FLAGS.some((flag) => token === flag || token.startsWith(`${flag}=`)));
+}
+export function matchWorkloadFamily(argv) {
+    const executable = basename(argv[0]);
+    const rest = argv.slice(1);
+    return (matchToolchainFamily(executable, rest) ??
+        matchInfraFamily(executable, rest) ??
+        matchTierFallback(executable, rest));
+}
+/** JS/TS/Go/Rust toolchains (§9.2 first block). */
+function matchToolchainFamily(executable, rest) {
+    if (JS_TEST_RUNNERS.has(executable)) {
+        // §12.2: direct vitest/jest invocations are shard candidates unless a
+        // conflicting flag changes semantics; the M5 planner enforces the rest.
+        const conflict = hasShardConflictFlag(rest);
+        return classification("heavy", "node-test", {
+            safeToAutoShard: !conflict,
+            extraReasons: conflict ? ["shard.flag.conflict"] : [],
+        });
+    }
+    if (PACKAGE_MANAGERS.has(executable)) {
+        const script = rest[0] === "run" ? rest[1] : rest[0];
+        if (script === "test" || script === "t" || script?.startsWith("test")) {
+            // Opaque wrapper: the underlying runner is unknown statically (§12.1).
+            return classification("heavy", "node-test", { extraReasons: ["shard.wrapper.opaque"] });
+        }
+        if (script === "build" || script?.startsWith("build")) {
+            return classification("heavy", "node-build");
+        }
+        return classification("unknown", "generic-process");
+    }
+    if (executable === "tsc") {
+        const hasProjectFlag = rest.some((token) => ["-p", "--project", "-b", "--build"].includes(token));
+        const hasFileArg = rest.some((token) => !token.startsWith("-"));
+        if (hasProjectFlag || !hasFileArg) {
+            return classification("heavy", "typescript");
+        }
+        return classification("cpu", "typescript");
+    }
+    if (executable === "go" && rest[0] === "test") {
+        const packageArgs = rest.slice(1).filter((token) => !token.startsWith("-"));
+        const recursive = packageArgs.some((token) => token.endsWith("..."));
+        if (recursive || packageArgs.length >= 2) {
+            return classification("heavy", "go-test", { safeToAutoShard: recursive && !rest.includes("-run") });
+        }
+        return classification("cpu", "go-test");
+    }
+    if (executable === "cargo" && ["build", "test", "check", "clippy"].includes(rest[0] ?? "")) {
+        return classification("heavy", "rust-build");
+    }
+    return null;
+}
+/** Container/monorepo/archive tooling (§9.2 second block). */
+function matchInfraFamily(executable, rest) {
+    if ((executable === "docker" || executable === "podman") && rest[0] === "build") {
+        return classification("heavy", "container-build");
+    }
+    if ((executable === "nx" && rest[0] === "run-many") || (executable === "turbo" && rest[0] === "run")) {
+        return classification("heavy", "monorepo");
+    }
+    if (executable === "tar") {
+        const flags = rest[0] ?? "";
+        if (flags.includes("c") || rest.includes("--create")) {
+            return classification("heavy", "archive");
+        }
+        return classification("io", "archive");
+    }
+    if ((executable === "zip" && rest.includes("-r")) || (executable === "7z" && rest[0] === "a")) {
+        return classification("heavy", "archive");
+    }
+    return null;
+}
+/** Known light/io/cpu tiers, else unknown/generic-process. */
+function matchTierFallback(executable, rest) {
+    if (executable === "git" && LIGHT_GIT_SUBCOMMANDS.has(rest[0] ?? "")) {
+        return classification("light", "generic-process");
+    }
+    if (LIGHT_EXECUTABLES.has(executable)) {
+        return classification("light", "generic-process");
+    }
+    if (IO_EXECUTABLES.has(executable)) {
+        return classification("io", "generic-process");
+    }
+    if (CPU_EXECUTABLES.has(executable)) {
+        return classification("cpu", "generic-process");
+    }
+    return classification("unknown", "generic-process");
+}
+function basename(token) {
+    const slash = token.lastIndexOf("/");
+    return slash === -1 ? token : token.slice(slash + 1);
+}
+//# sourceMappingURL=workload-family-matcher.js.map

package/dist/core/workload-family-matcher.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workload-family-matcher.js","sourceRoot":"","sources":["../../src/core/workload-family-matcher.ts"],"names":[],"mappings":"AAEA,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC;IACjC,IAAI;IACJ,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;IACN,IAAI;IACJ,MAAM;IACN,MAAM;IACN,KAAK;IACL,OAAO;IACP,IAAI;IACJ,MAAM;IACN,MAAM;IACN,MAAM;IACN,OAAO;CACP,CAAC,CAAC;AACH,MAAM,qBAAqB,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC;AACzG,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;AAC9E,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC;AAC7F,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;AACjE,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;AACpD,MAAM,oBAAoB,GAAG,CAAC,SAAS,EAAE,aAAa,EAAE,YAAY,EAAE,SAAS,EAAE,IAAI,EAAE,kBAAkB,EAAE,IAAI,CAAC,CAAC;AAEjH,SAAS,cAAc,CACtB,aAA4B,EAC5B,aAAoC,EACpC,OAA2F,EAClE;IACzB,OAAO;QACN,aAAa;QACb,aAAa;QACb,UAAU,EAAE,aAAa;QACzB,eAAe,EAAE,OAAO,EAAE,eAAe,IAAI,KAAK;QAClD,WAAW,EAAE,CAAC,UAAU,aAAa,EAAE,EAAE,SAAS,aAAa,EAAE,EAAE,GAAG,CAAC,OAAO,EAAE,YAAY,IAAI,EAAE,CAAC,CAAC;KACpG,CAAC;AAAA,CACF;AAED,SAAS,oBAAoB,CAAC,IAAuB,EAAW;IAC/D,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;AAAA,CACjH;AAED,MAAM,UAAU,mBAAmB,CAAC,IAAuB,EAA0B;IACpF,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,OAAO,CACN,oBAAoB,CAAC,UAAU,EAAE,IAAI,CAAC;QACtC,gBAAgB,CAAC,UAAU,EAAE,IAAI,CAAC;QAClC,iBAAiB,CAAC,UAAU,EAAE,IAAI,CAAC,CACnC,CAAC;AAAA,CACF;AAED,oDAAmD;AACnD,SAAS,oBAAoB,CAAC,UAAkB,EAAE,IAAuB,EAAiC;IACzG,IAAI,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;QACrC,uEAAsE;QACtE,wEAAwE;QACxE,MAAM,QAAQ,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;QAC5C,OAAO,cAAc,CAAC,OAAO,EAAE,WAAW,EAAE;YAC3C,eAAe,EAAE,CAAC,QAAQ;YAC1B,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,EAAE;SACrD,CAAC,CAAC;IACJ,CAAC;IACD,IAAI,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrD,IAAI,MAAM,KAAK,MAAM,IAAI,MAAM,KAAK,GAAG,IAAI,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;YACvE,wEAAuE;YACvE,OAAO,cAAc,CAAC,OAAO,EAAE,WAAW,EAAE,EAAE,YAAY,EAAE,CAAC,sBAAsB,CAAC,EAAE,CAAC,CAAC;QACzF,CAAC;QACD,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YACvD,OAAO,cAAc,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,cAAc,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;IACrD,CAAC;IACD,IAAI,UAAU,KAAK,KAAK,EAAE,CAAC;QAC1B,MAAM,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAClG,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,IAAI,cAAc,IAAI,CAAC,UAAU,EAAE,CAAC;YACnC,OAAO,cAAc,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,cAAc,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IAC5C,CAAC;IACD,IAAI,UAAU,KAAK,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC;QAC/C,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5E,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QACrE,IAAI,SAAS,IAAI,WAAW,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC1C,OAAO,cAAc,CAAC,OAAO,EAAE,SAAS,EAAE,EAAE,eAAe,EAAE,SAAS,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrG,CAAC;QACD,OAAO,cAAc,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACzC,CAAC;IACD,IAAI,UAAU,KAAK,OAAO,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;QAC5F,OAAO,cAAc,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,IAAI,CAAC;AAAA,CACZ;AAED,+DAA8D;AAC9D,SAAS,gBAAgB,CAAC,UAAkB,EAAE,IAAuB,EAAiC;IACrG,IAAI,CAAC,UAAU,KAAK,QAAQ,IAAI,UAAU,KAAK,QAAQ,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,CAAC;QACjF,OAAO,cAAc,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC;IACnD,CAAC;IACD,IAAI,CAAC,UAAU,KAAK,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,IAAI,CAAC,UAAU,KAAK,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;QACtG,OAAO,cAAc,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IAC5C,CAAC;IACD,IAAI,UAAU,KAAK,KAAK,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;YACtD,OAAO,cAAc,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,cAAc,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACxC,CAAC;IACD,IAAI,CAAC,UAAU,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,KAAK,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;QAC/F,OAAO,cAAc,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,IAAI,CAAC;AAAA,CACZ;AAED,8DAA8D;AAC9D,SAAS,iBAAiB,CAAC,UAAkB,EAAE,IAAuB,EAA0B;IAC/F,IAAI,UAAU,KAAK,KAAK,IAAI,qBAAqB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;QACtE,OAAO,cAAc,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC;IACnD,CAAC;IACD,IAAI,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;QACvC,OAAO,cAAc,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC;IACnD,CAAC;IACD,IAAI,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;QACpC,OAAO,cAAc,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC;IAChD,CAAC;IACD,IAAI,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;QACrC,OAAO,cAAc,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,cAAc,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;AAAA,CACpD;AAED,SAAS,QAAQ,CAAC,KAAa,EAAU;IACxC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACrC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;AAAA,CACrD","sourcesContent":["import type { WorkloadClass, WorkloadClassification, WorkloadCommandFamily } from \"./workload-classifier.ts\";\n\nconst LIGHT_EXECUTABLES = new Set([\n\t\"ls\",\n\t\"cat\",\n\t\"head\",\n\t\"tail\",\n\t\"grep\",\n\t\"rg\",\n\t\"find\",\n\t\"echo\",\n\t\"pwd\",\n\t\"which\",\n\t\"wc\",\n\t\"stat\",\n\t\"file\",\n\t\"true\",\n\t\"false\",\n]);\nconst LIGHT_GIT_SUBCOMMANDS = new Set([\"status\", \"log\", \"diff\", \"show\", \"branch\", \"rev-parse\", \"blame\"]);\nconst IO_EXECUTABLES = new Set([\"cp\", \"mv\", \"rsync\", \"mkdir\", \"touch\", \"dd\"]);\nconst CPU_EXECUTABLES = new Set([\"eslint\", \"prettier\", \"biome\", \"ruff\", \"gofmt\", \"rustfmt\"]);\nconst PACKAGE_MANAGERS = new Set([\"npm\", \"pnpm\", \"yarn\", \"bun\"]);\nconst JS_TEST_RUNNERS = new Set([\"vitest\", \"jest\"]);\nconst SHARD_CONFLICT_FLAGS = [\"--shard\", \"--runInBand\", \"--coverage\", \"--watch\", \"-u\", \"--updateSnapshot\", \"-w\"];\n\nfunction classification(\n\tworkloadClass: WorkloadClass,\n\tcommandFamily: WorkloadCommandFamily,\n\toptions?: { readonly safeToAutoShard?: boolean; readonly extraReasons?: readonly string[] },\n): WorkloadClassification {\n\treturn {\n\t\tworkloadClass,\n\t\tcommandFamily,\n\t\tcomplexity: \"simple-argv\",\n\t\tsafeToAutoShard: options?.safeToAutoShard ?? false,\n\t\treasonCodes: [`family.${commandFamily}`, `class.${workloadClass}`, ...(options?.extraReasons ?? [])],\n\t};\n}\n\nfunction hasShardConflictFlag(argv: readonly string[]): boolean {\n\treturn argv.some((token) => SHARD_CONFLICT_FLAGS.some((flag) => token === flag || token.startsWith(`${flag}=`)));\n}\n\nexport function matchWorkloadFamily(argv: readonly string[]): WorkloadClassification {\n\tconst executable = basename(argv[0]);\n\tconst rest = argv.slice(1);\n\treturn (\n\t\tmatchToolchainFamily(executable, rest) ??\n\t\tmatchInfraFamily(executable, rest) ??\n\t\tmatchTierFallback(executable, rest)\n\t);\n}\n\n/** JS/TS/Go/Rust toolchains (§9.2 first block). */\nfunction matchToolchainFamily(executable: string, rest: readonly string[]): WorkloadClassification | null {\n\tif (JS_TEST_RUNNERS.has(executable)) {\n\t\t// §12.2: direct vitest/jest invocations are shard candidates unless a\n\t\t// conflicting flag changes semantics; the M5 planner enforces the rest.\n\t\tconst conflict = hasShardConflictFlag(rest);\n\t\treturn classification(\"heavy\", \"node-test\", {\n\t\t\tsafeToAutoShard: !conflict,\n\t\t\textraReasons: conflict ? [\"shard.flag.conflict\"] : [],\n\t\t});\n\t}\n\tif (PACKAGE_MANAGERS.has(executable)) {\n\t\tconst script = rest[0] === \"run\" ? rest[1] : rest[0];\n\t\tif (script === \"test\" || script === \"t\" || script?.startsWith(\"test\")) {\n\t\t\t// Opaque wrapper: the underlying runner is unknown statically (§12.1).\n\t\t\treturn classification(\"heavy\", \"node-test\", { extraReasons: [\"shard.wrapper.opaque\"] });\n\t\t}\n\t\tif (script === \"build\" || script?.startsWith(\"build\")) {\n\t\t\treturn classification(\"heavy\", \"node-build\");\n\t\t}\n\t\treturn classification(\"unknown\", \"generic-process\");\n\t}\n\tif (executable === \"tsc\") {\n\t\tconst hasProjectFlag = rest.some((token) => [\"-p\", \"--project\", \"-b\", \"--build\"].includes(token));\n\t\tconst hasFileArg = rest.some((token) => !token.startsWith(\"-\"));\n\t\tif (hasProjectFlag || !hasFileArg) {\n\t\t\treturn classification(\"heavy\", \"typescript\");\n\t\t}\n\t\treturn classification(\"cpu\", \"typescript\");\n\t}\n\tif (executable === \"go\" && rest[0] === \"test\") {\n\t\tconst packageArgs = rest.slice(1).filter((token) => !token.startsWith(\"-\"));\n\t\tconst recursive = packageArgs.some((token) => token.endsWith(\"...\"));\n\t\tif (recursive || packageArgs.length >= 2) {\n\t\t\treturn classification(\"heavy\", \"go-test\", { safeToAutoShard: recursive && !rest.includes(\"-run\") });\n\t\t}\n\t\treturn classification(\"cpu\", \"go-test\");\n\t}\n\tif (executable === \"cargo\" && [\"build\", \"test\", \"check\", \"clippy\"].includes(rest[0] ?? \"\")) {\n\t\treturn classification(\"heavy\", \"rust-build\");\n\t}\n\treturn null;\n}\n\n/** Container/monorepo/archive tooling (§9.2 second block). */\nfunction matchInfraFamily(executable: string, rest: readonly string[]): WorkloadClassification | null {\n\tif ((executable === \"docker\" || executable === \"podman\") && rest[0] === \"build\") {\n\t\treturn classification(\"heavy\", \"container-build\");\n\t}\n\tif ((executable === \"nx\" && rest[0] === \"run-many\") || (executable === \"turbo\" && rest[0] === \"run\")) {\n\t\treturn classification(\"heavy\", \"monorepo\");\n\t}\n\tif (executable === \"tar\") {\n\t\tconst flags = rest[0] ?? \"\";\n\t\tif (flags.includes(\"c\") || rest.includes(\"--create\")) {\n\t\t\treturn classification(\"heavy\", \"archive\");\n\t\t}\n\t\treturn classification(\"io\", \"archive\");\n\t}\n\tif ((executable === \"zip\" && rest.includes(\"-r\")) || (executable === \"7z\" && rest[0] === \"a\")) {\n\t\treturn classification(\"heavy\", \"archive\");\n\t}\n\treturn null;\n}\n\n/** Known light/io/cpu tiers, else unknown/generic-process. */\nfunction matchTierFallback(executable: string, rest: readonly string[]): WorkloadClassification {\n\tif (executable === \"git\" && LIGHT_GIT_SUBCOMMANDS.has(rest[0] ?? \"\")) {\n\t\treturn classification(\"light\", \"generic-process\");\n\t}\n\tif (LIGHT_EXECUTABLES.has(executable)) {\n\t\treturn classification(\"light\", \"generic-process\");\n\t}\n\tif (IO_EXECUTABLES.has(executable)) {\n\t\treturn classification(\"io\", \"generic-process\");\n\t}\n\tif (CPU_EXECUTABLES.has(executable)) {\n\t\treturn classification(\"cpu\", \"generic-process\");\n\t}\n\treturn classification(\"unknown\", \"generic-process\");\n}\n\nfunction basename(token: string): string {\n\tconst slash = token.lastIndexOf(\"/\");\n\treturn slash === -1 ? token : token.slice(slash + 1);\n}\n"]}

package/dist/core/workload-permit-pool.d.ts

@@ -0,0 +1,78 @@
+import type { WorkloadClass } from "./workload-classifier.ts";
+/**
+ * Shared workload permit pool (OMK v0.97.x roadmap §10, M3/PR5).
+ *
+ * Bounds concurrent heavy/cpu subprocesses independently of tool concurrency
+ * (§10.1: 4 concurrent reads != 4 concurrent `npm test` processes). One pool
+ * instance is shared by a session and, later, its child subagents (§14.1) —
+ * a child creating its own pool would oversubscribe the host.
+ *
+ * §10.3 rules implemented here: strict FIFO (§10.4), abort- and
+ * timeout-aware waiting, exactly-once release with double-release recorded
+ * as a diagnostic no-op, immediate rejection of requests wider than
+ * capacity, and a hard queue cap whose overflow surfaces as a structured
+ * error code (§15.4 `queue_overflow`). Waiter timers stay ref'd — a permit
+ * wait is actively awaited work — and are cleared on settle.
+ */
+export interface WorkloadPermitRequest {
+    readonly requestId: string;
+    readonly promptRunId: string;
+    readonly workloadClass: WorkloadClass;
+    readonly weight: 1 | 2;
+    readonly signal?: AbortSignal;
+    readonly timeoutMs?: number;
+}
+export interface WorkloadPermit {
+    readonly permitId: string;
+    readonly requestId: string;
+    readonly acquiredAt: string;
+    release(): void;
+}
+export interface WorkloadPermitPoolSnapshot {
+    readonly capacity: number;
+    readonly activeWeight: number;
+    readonly queuedCount: number;
+}
+export type WorkloadPermitErrorCode = "queue_overflow" | "timeout" | "aborted" | "over_capacity_weight";
+export declare class WorkloadPermitError extends Error {
+    readonly code: WorkloadPermitErrorCode;
+    readonly requestId: string;
+    constructor(code: WorkloadPermitErrorCode, requestId: string);
+}
+export declare const DEFAULT_PERMIT_QUEUE_CAP = 32;
+export type WorkloadPermitPoolOptions = {
+    /** Concurrent weight budget; §7.2 heavy caps feed this. Default 2. */
+    capacity?: number;
+    /** §10.3 queue length hard cap. Default 32. */
+    maxQueue?: number;
+    /** Injectable clock for deterministic tests. */
+    now?: () => Date;
+};
+export declare class WorkloadPermitPool {
+    private capacity;
+    private readonly maxQueue;
+    private readonly now;
+    private activeWeight;
+    private readonly queue;
+    private readonly releasedPermitIds;
+    private readonly activePermitIds;
+    private doubleReleases;
+    constructor(options?: WorkloadPermitPoolOptions);
+    /**
+     * Update capacity from a new admission decision. In-flight permits are
+     * never revoked; a reduction only delays future grants until active
+     * weight drains below the new capacity.
+     */
+    setCapacity(capacity: number): void;
+    /** Acquire a permit. Strict FIFO; rejects with {@link WorkloadPermitError}. */
+    acquire(request: WorkloadPermitRequest): Promise<WorkloadPermit>;
+    snapshot(): WorkloadPermitPoolSnapshot;
+    /** Diagnostic count of double releases (§10.3 no-op + diagnostic). */
+    get doubleReleaseCount(): number;
+    private grant;
+    /** Grant queued waiters strictly in FIFO order while the head fits (§10.4). */
+    private grantWhilePossible;
+    private evict;
+    private settleCleanup;
+}
+//# sourceMappingURL=workload-permit-pool.d.ts.map

package/dist/core/workload-permit-pool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"workload-permit-pool.d.ts","sourceRoot":"","sources":["../../src/core/workload-permit-pool.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAE9D;;;;;;;;;;;;;;GAcG;AAEH,MAAM,WAAW,qBAAqB;IACrC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,aAAa,EAAE,aAAa,CAAC;IACtC,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC;IACvB,QAAQ,CAAC,MAAM,CAAC,EAAE,WAAW,CAAC;IAC9B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,WAAW,cAAc;IAC9B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,OAAO,IAAI,IAAI,CAAC;CAChB;AAED,MAAM,WAAW,0BAA0B;IAC1C,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,MAAM,uBAAuB,GAAG,gBAAgB,GAAG,SAAS,GAAG,SAAS,GAAG,sBAAsB,CAAC;AAExG,qBAAa,mBAAoB,SAAQ,KAAK;IAC7C,QAAQ,CAAC,IAAI,EAAE,uBAAuB,CAAC;IACvC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAE3B,YAAY,IAAI,EAAE,uBAAuB,EAAE,SAAS,EAAE,MAAM,EAK3D;CACD;AAUD,eAAO,MAAM,wBAAwB,KAAK,CAAC;AAE3C,MAAM,MAAM,yBAAyB,GAAG;IACvC,uEAAsE;IACtE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,gDAA+C;IAC/C,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,gDAAgD;IAChD,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC;CACjB,CAAC;AAEF,qBAAa,kBAAkB;IAC9B,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAa;IACjC,OAAO,CAAC,YAAY,CAAK;IACzB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAgB;IACtC,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAqB;IACvD,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAqB;IACrD,OAAO,CAAC,cAAc,CAAK;IAE3B,YAAY,OAAO,CAAC,EAAE,yBAAyB,EAI9C;IAED;;;;OAIG;IACH,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAGlC;IAED,+EAA+E;IAC/E,OAAO,CAAC,OAAO,EAAE,qBAAqB,GAAG,OAAO,CAAC,cAAc,CAAC,CA6B/D;IAED,QAAQ,IAAI,0BAA0B,CAErC;IAED,uEAAsE;IACtE,IAAI,kBAAkB,IAAI,MAAM,CAE/B;IAED,OAAO,CAAC,KAAK;IAmBb,gFAA+E;IAC/E,OAAO,CAAC,kBAAkB;IAoB1B,OAAO,CAAC,KAAK;IAUb,OAAO,CAAC,aAAa;CAUrB","sourcesContent":["import { randomUUID } from \"node:crypto\";\nimport type { WorkloadClass } from \"./workload-classifier.ts\";\n\n/**\n * Shared workload permit pool (OMK v0.97.x roadmap §10, M3/PR5).\n *\n * Bounds concurrent heavy/cpu subprocesses independently of tool concurrency\n * (§10.1: 4 concurrent reads != 4 concurrent `npm test` processes). One pool\n * instance is shared by a session and, later, its child subagents (§14.1) —\n * a child creating its own pool would oversubscribe the host.\n *\n * §10.3 rules implemented here: strict FIFO (§10.4), abort- and\n * timeout-aware waiting, exactly-once release with double-release recorded\n * as a diagnostic no-op, immediate rejection of requests wider than\n * capacity, and a hard queue cap whose overflow surfaces as a structured\n * error code (§15.4 `queue_overflow`). Waiter timers stay ref'd — a permit\n * wait is actively awaited work — and are cleared on settle.\n */\n\nexport interface WorkloadPermitRequest {\n\treadonly requestId: string;\n\treadonly promptRunId: string;\n\treadonly workloadClass: WorkloadClass;\n\treadonly weight: 1 | 2;\n\treadonly signal?: AbortSignal;\n\treadonly timeoutMs?: number;\n}\n\nexport interface WorkloadPermit {\n\treadonly permitId: string;\n\treadonly requestId: string;\n\treadonly acquiredAt: string;\n\trelease(): void;\n}\n\nexport interface WorkloadPermitPoolSnapshot {\n\treadonly capacity: number;\n\treadonly activeWeight: number;\n\treadonly queuedCount: number;\n}\n\nexport type WorkloadPermitErrorCode = \"queue_overflow\" | \"timeout\" | \"aborted\" | \"over_capacity_weight\";\n\nexport class WorkloadPermitError extends Error {\n\treadonly code: WorkloadPermitErrorCode;\n\treadonly requestId: string;\n\n\tconstructor(code: WorkloadPermitErrorCode, requestId: string) {\n\t\tsuper(`workload permit ${code} (request ${requestId})`);\n\t\tthis.name = \"WorkloadPermitError\";\n\t\tthis.code = code;\n\t\tthis.requestId = requestId;\n\t}\n}\n\ninterface Waiter {\n\treadonly request: WorkloadPermitRequest;\n\treadonly resolve: (permit: WorkloadPermit) => void;\n\treadonly reject: (error: WorkloadPermitError) => void;\n\ttimer: ReturnType<typeof setTimeout> | null;\n\tabortListener: (() => void) | null;\n}\n\nexport const DEFAULT_PERMIT_QUEUE_CAP = 32;\n\nexport type WorkloadPermitPoolOptions = {\n\t/** Concurrent weight budget; §7.2 heavy caps feed this. Default 2. */\n\tcapacity?: number;\n\t/** §10.3 queue length hard cap. Default 32. */\n\tmaxQueue?: number;\n\t/** Injectable clock for deterministic tests. */\n\tnow?: () => Date;\n};\n\nexport class WorkloadPermitPool {\n\tprivate capacity: number;\n\tprivate readonly maxQueue: number;\n\tprivate readonly now: () => Date;\n\tprivate activeWeight = 0;\n\tprivate readonly queue: Waiter[] = [];\n\tprivate readonly releasedPermitIds = new Set<string>();\n\tprivate readonly activePermitIds = new Set<string>();\n\tprivate doubleReleases = 0;\n\n\tconstructor(options?: WorkloadPermitPoolOptions) {\n\t\tthis.capacity = sanitizeCapacity(options?.capacity, 2);\n\t\tthis.maxQueue = sanitizeCapacity(options?.maxQueue, DEFAULT_PERMIT_QUEUE_CAP);\n\t\tthis.now = options?.now ?? (() => new Date());\n\t}\n\n\t/**\n\t * Update capacity from a new admission decision. In-flight permits are\n\t * never revoked; a reduction only delays future grants until active\n\t * weight drains below the new capacity.\n\t */\n\tsetCapacity(capacity: number): void {\n\t\tthis.capacity = sanitizeCapacity(capacity, this.capacity);\n\t\tthis.grantWhilePossible();\n\t}\n\n\t/** Acquire a permit. Strict FIFO; rejects with {@link WorkloadPermitError}. */\n\tacquire(request: WorkloadPermitRequest): Promise<WorkloadPermit> {\n\t\tif (request.weight > this.capacity) {\n\t\t\treturn Promise.reject(new WorkloadPermitError(\"over_capacity_weight\", request.requestId));\n\t\t}\n\t\tif (request.signal?.aborted) {\n\t\t\treturn Promise.reject(new WorkloadPermitError(\"aborted\", request.requestId));\n\t\t}\n\t\tif (this.queue.length === 0 && this.activeWeight + request.weight <= this.capacity) {\n\t\t\treturn Promise.resolve(this.grant(request));\n\t\t}\n\t\tif (this.queue.length >= this.maxQueue) {\n\t\t\treturn Promise.reject(new WorkloadPermitError(\"queue_overflow\", request.requestId));\n\t\t}\n\t\treturn new Promise<WorkloadPermit>((resolve, reject) => {\n\t\t\tconst waiter: Waiter = { request, resolve, reject, timer: null, abortListener: null };\n\t\t\tif (typeof request.timeoutMs === \"number\" && Number.isFinite(request.timeoutMs) && request.timeoutMs > 0) {\n\t\t\t\twaiter.timer = setTimeout(() => {\n\t\t\t\t\tthis.evict(waiter, \"timeout\");\n\t\t\t\t}, request.timeoutMs);\n\t\t\t}\n\t\t\tif (request.signal) {\n\t\t\t\tconst signal = request.signal;\n\t\t\t\twaiter.abortListener = () => {\n\t\t\t\t\tthis.evict(waiter, \"aborted\");\n\t\t\t\t};\n\t\t\t\tsignal.addEventListener(\"abort\", waiter.abortListener, { once: true });\n\t\t\t}\n\t\t\tthis.queue.push(waiter);\n\t\t});\n\t}\n\n\tsnapshot(): WorkloadPermitPoolSnapshot {\n\t\treturn { capacity: this.capacity, activeWeight: this.activeWeight, queuedCount: this.queue.length };\n\t}\n\n\t/** Diagnostic count of double releases (§10.3 no-op + diagnostic). */\n\tget doubleReleaseCount(): number {\n\t\treturn this.doubleReleases;\n\t}\n\n\tprivate grant(request: WorkloadPermitRequest): WorkloadPermit {\n\t\tthis.activeWeight += request.weight;\n\t\tconst permitId = `permit-${randomUUID()}`;\n\t\tthis.activePermitIds.add(permitId);\n\t\tconst release = (): void => {\n\t\t\t// §10.3 exactly-once: a late or repeated settlement must not return\n\t\t\t// weight it no longer owns.\n\t\t\tif (this.releasedPermitIds.has(permitId) || !this.activePermitIds.has(permitId)) {\n\t\t\t\tthis.doubleReleases += 1;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis.activePermitIds.delete(permitId);\n\t\t\tthis.releasedPermitIds.add(permitId);\n\t\t\tthis.activeWeight = Math.max(0, this.activeWeight - request.weight);\n\t\t\tthis.grantWhilePossible();\n\t\t};\n\t\treturn { permitId, requestId: request.requestId, acquiredAt: this.now().toISOString(), release };\n\t}\n\n\t/** Grant queued waiters strictly in FIFO order while the head fits (§10.4). */\n\tprivate grantWhilePossible(): void {\n\t\twhile (this.queue.length > 0) {\n\t\t\tconst head = this.queue[0];\n\t\t\tif (head.request.weight > this.capacity) {\n\t\t\t\t// Capacity shrank below the head's weight: reject rather than\n\t\t\t\t// starving everyone behind it forever.\n\t\t\t\tthis.queue.shift();\n\t\t\t\tthis.settleCleanup(head);\n\t\t\t\thead.reject(new WorkloadPermitError(\"over_capacity_weight\", head.request.requestId));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (this.activeWeight + head.request.weight > this.capacity) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis.queue.shift();\n\t\t\tthis.settleCleanup(head);\n\t\t\thead.resolve(this.grant(head.request));\n\t\t}\n\t}\n\n\tprivate evict(waiter: Waiter, code: WorkloadPermitErrorCode): void {\n\t\tconst index = this.queue.indexOf(waiter);\n\t\tif (index === -1) {\n\t\t\treturn; // Already granted or already evicted.\n\t\t}\n\t\tthis.queue.splice(index, 1);\n\t\tthis.settleCleanup(waiter);\n\t\twaiter.reject(new WorkloadPermitError(code, waiter.request.requestId));\n\t}\n\n\tprivate settleCleanup(waiter: Waiter): void {\n\t\tif (waiter.timer !== null) {\n\t\t\tclearTimeout(waiter.timer);\n\t\t\twaiter.timer = null;\n\t\t}\n\t\tif (waiter.abortListener !== null) {\n\t\t\twaiter.request.signal?.removeEventListener(\"abort\", waiter.abortListener);\n\t\t\twaiter.abortListener = null;\n\t\t}\n\t}\n}\n\nfunction sanitizeCapacity(value: number | undefined, fallback: number): number {\n\tif (typeof value !== \"number\" || !Number.isFinite(value) || value < 1) {\n\t\treturn fallback;\n\t}\n\treturn Math.floor(value);\n}\n"]}

package/dist/core/workload-permit-pool.js

@@ -0,0 +1,138 @@
+import { randomUUID } from "node:crypto";
+export class WorkloadPermitError extends Error {
+    code;
+    requestId;
+    constructor(code, requestId) {
+        super(`workload permit ${code} (request ${requestId})`);
+        this.name = "WorkloadPermitError";
+        this.code = code;
+        this.requestId = requestId;
+    }
+}
+export const DEFAULT_PERMIT_QUEUE_CAP = 32;
+export class WorkloadPermitPool {
+    capacity;
+    maxQueue;
+    now;
+    activeWeight = 0;
+    queue = [];
+    releasedPermitIds = new Set();
+    activePermitIds = new Set();
+    doubleReleases = 0;
+    constructor(options) {
+        this.capacity = sanitizeCapacity(options?.capacity, 2);
+        this.maxQueue = sanitizeCapacity(options?.maxQueue, DEFAULT_PERMIT_QUEUE_CAP);
+        this.now = options?.now ?? (() => new Date());
+    }
+    /**
+     * Update capacity from a new admission decision. In-flight permits are
+     * never revoked; a reduction only delays future grants until active
+     * weight drains below the new capacity.
+     */
+    setCapacity(capacity) {
+        this.capacity = sanitizeCapacity(capacity, this.capacity);
+        this.grantWhilePossible();
+    }
+    /** Acquire a permit. Strict FIFO; rejects with {@link WorkloadPermitError}. */
+    acquire(request) {
+        if (request.weight > this.capacity) {
+            return Promise.reject(new WorkloadPermitError("over_capacity_weight", request.requestId));
+        }
+        if (request.signal?.aborted) {
+            return Promise.reject(new WorkloadPermitError("aborted", request.requestId));
+        }
+        if (this.queue.length === 0 && this.activeWeight + request.weight <= this.capacity) {
+            return Promise.resolve(this.grant(request));
+        }
+        if (this.queue.length >= this.maxQueue) {
+            return Promise.reject(new WorkloadPermitError("queue_overflow", request.requestId));
+        }
+        return new Promise((resolve, reject) => {
+            const waiter = { request, resolve, reject, timer: null, abortListener: null };
+            if (typeof request.timeoutMs === "number" && Number.isFinite(request.timeoutMs) && request.timeoutMs > 0) {
+                waiter.timer = setTimeout(() => {
+                    this.evict(waiter, "timeout");
+                }, request.timeoutMs);
+            }
+            if (request.signal) {
+                const signal = request.signal;
+                waiter.abortListener = () => {
+                    this.evict(waiter, "aborted");
+                };
+                signal.addEventListener("abort", waiter.abortListener, { once: true });
+            }
+            this.queue.push(waiter);
+        });
+    }
+    snapshot() {
+        return { capacity: this.capacity, activeWeight: this.activeWeight, queuedCount: this.queue.length };
+    }
+    /** Diagnostic count of double releases (§10.3 no-op + diagnostic). */
+    get doubleReleaseCount() {
+        return this.doubleReleases;
+    }
+    grant(request) {
+        this.activeWeight += request.weight;
+        const permitId = `permit-${randomUUID()}`;
+        this.activePermitIds.add(permitId);
+        const release = () => {
+            // §10.3 exactly-once: a late or repeated settlement must not return
+            // weight it no longer owns.
+            if (this.releasedPermitIds.has(permitId) || !this.activePermitIds.has(permitId)) {
+                this.doubleReleases += 1;
+                return;
+            }
+            this.activePermitIds.delete(permitId);
+            this.releasedPermitIds.add(permitId);
+            this.activeWeight = Math.max(0, this.activeWeight - request.weight);
+            this.grantWhilePossible();
+        };
+        return { permitId, requestId: request.requestId, acquiredAt: this.now().toISOString(), release };
+    }
+    /** Grant queued waiters strictly in FIFO order while the head fits (§10.4). */
+    grantWhilePossible() {
+        while (this.queue.length > 0) {
+            const head = this.queue[0];
+            if (head.request.weight > this.capacity) {
+                // Capacity shrank below the head's weight: reject rather than
+                // starving everyone behind it forever.
+                this.queue.shift();
+                this.settleCleanup(head);
+                head.reject(new WorkloadPermitError("over_capacity_weight", head.request.requestId));
+                continue;
+            }
+            if (this.activeWeight + head.request.weight > this.capacity) {
+                return;
+            }
+            this.queue.shift();
+            this.settleCleanup(head);
+            head.resolve(this.grant(head.request));
+        }
+    }
+    evict(waiter, code) {
+        const index = this.queue.indexOf(waiter);
+        if (index === -1) {
+            return; // Already granted or already evicted.
+        }
+        this.queue.splice(index, 1);
+        this.settleCleanup(waiter);
+        waiter.reject(new WorkloadPermitError(code, waiter.request.requestId));
+    }
+    settleCleanup(waiter) {
+        if (waiter.timer !== null) {
+            clearTimeout(waiter.timer);
+            waiter.timer = null;
+        }
+        if (waiter.abortListener !== null) {
+            waiter.request.signal?.removeEventListener("abort", waiter.abortListener);
+            waiter.abortListener = null;
+        }
+    }
+}
+function sanitizeCapacity(value, fallback) {
+    if (typeof value !== "number" || !Number.isFinite(value) || value < 1) {
+        return fallback;
+    }
+    return Math.floor(value);
+}
+//# sourceMappingURL=workload-permit-pool.js.map

package/dist/core/workload-permit-pool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workload-permit-pool.js","sourceRoot":"","sources":["../../src/core/workload-permit-pool.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AA2CzC,MAAM,OAAO,mBAAoB,SAAQ,KAAK;IACpC,IAAI,CAA0B;IAC9B,SAAS,CAAS;IAE3B,YAAY,IAA6B,EAAE,SAAiB,EAAE;QAC7D,KAAK,CAAC,mBAAmB,IAAI,aAAa,SAAS,GAAG,CAAC,CAAC;QACxD,IAAI,CAAC,IAAI,GAAG,qBAAqB,CAAC;QAClC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAAA,CAC3B;CACD;AAUD,MAAM,CAAC,MAAM,wBAAwB,GAAG,EAAE,CAAC;AAW3C,MAAM,OAAO,kBAAkB;IACtB,QAAQ,CAAS;IACR,QAAQ,CAAS;IACjB,GAAG,CAAa;IACzB,YAAY,GAAG,CAAC,CAAC;IACR,KAAK,GAAa,EAAE,CAAC;IACrB,iBAAiB,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAC7C,cAAc,GAAG,CAAC,CAAC;IAE3B,YAAY,OAAmC,EAAE;QAChD,IAAI,CAAC,QAAQ,GAAG,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QACvD,IAAI,CAAC,QAAQ,GAAG,gBAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,wBAAwB,CAAC,CAAC;QAC9E,IAAI,CAAC,GAAG,GAAG,OAAO,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;IAAA,CAC9C;IAED;;;;OAIG;IACH,WAAW,CAAC,QAAgB,EAAQ;QACnC,IAAI,CAAC,QAAQ,GAAG,gBAAgB,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC1D,IAAI,CAAC,kBAAkB,EAAE,CAAC;IAAA,CAC1B;IAED,+EAA+E;IAC/E,OAAO,CAAC,OAA8B,EAA2B;QAChE,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpC,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,mBAAmB,CAAC,sBAAsB,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;QAC3F,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC;YAC7B,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,mBAAmB,CAAC,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;QAC9E,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpF,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACxC,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,mBAAmB,CAAC,gBAAgB,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;QACrF,CAAC;QACD,OAAO,IAAI,OAAO,CAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC;YACvD,MAAM,MAAM,GAAW,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;YACtF,IAAI,OAAO,OAAO,CAAC,SAAS,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,OAAO,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;gBAC1G,MAAM,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC;oBAC/B,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAAA,CAC9B,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;YACvB,CAAC;YACD,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;gBACpB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;gBAC9B,MAAM,CAAC,aAAa,GAAG,GAAG,EAAE,CAAC;oBAC5B,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBAAA,CAC9B,CAAC;gBACF,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,MAAM,CAAC,aAAa,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;YACxE,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAAA,CACxB,CAAC,CAAC;IAAA,CACH;IAED,QAAQ,GAA+B;QACtC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;IAAA,CACpG;IAED,uEAAsE;IACtE,IAAI,kBAAkB,GAAW;QAChC,OAAO,IAAI,CAAC,cAAc,CAAC;IAAA,CAC3B;IAEO,KAAK,CAAC,OAA8B,EAAkB;QAC7D,IAAI,CAAC,YAAY,IAAI,OAAO,CAAC,MAAM,CAAC;QACpC,MAAM,QAAQ,GAAG,UAAU,UAAU,EAAE,EAAE,CAAC;QAC1C,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACnC,MAAM,OAAO,GAAG,GAAS,EAAE,CAAC;YAC3B,qEAAoE;YACpE,4BAA4B;YAC5B,IAAI,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACjF,IAAI,CAAC,cAAc,IAAI,CAAC,CAAC;gBACzB,OAAO;YACR,CAAC;YACD,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACtC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACrC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;YACpE,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAAA,CAC1B,CAAC;QACF,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,EAAE,OAAO,EAAE,CAAC;IAAA,CACjG;IAED,gFAA+E;IACvE,kBAAkB,GAAS;QAClC,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACzC,8DAA8D;gBAC9D,uCAAuC;gBACvC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;gBACnB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;gBACzB,IAAI,CAAC,MAAM,CAAC,IAAI,mBAAmB,CAAC,sBAAsB,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;gBACrF,SAAS;YACV,CAAC;YACD,IAAI,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC7D,OAAO;YACR,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACnB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QACxC,CAAC;IAAA,CACD;IAEO,KAAK,CAAC,MAAc,EAAE,IAA6B,EAAQ;QAClE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YAClB,OAAO,CAAC,sCAAsC;QAC/C,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,IAAI,mBAAmB,CAAC,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;IAAA,CACvE;IAEO,aAAa,CAAC,MAAc,EAAQ;QAC3C,IAAI,MAAM,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YAC3B,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC3B,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC;QACrB,CAAC;QACD,IAAI,MAAM,CAAC,aAAa,KAAK,IAAI,EAAE,CAAC;YACnC,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC;YAC1E,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC;QAC7B,CAAC;IAAA,CACD;CACD;AAED,SAAS,gBAAgB,CAAC,KAAyB,EAAE,QAAgB,EAAU;IAC9E,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACvE,OAAO,QAAQ,CAAC;IACjB,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AAAA,CACzB","sourcesContent":["import { randomUUID } from \"node:crypto\";\nimport type { WorkloadClass } from \"./workload-classifier.ts\";\n\n/**\n * Shared workload permit pool (OMK v0.97.x roadmap §10, M3/PR5).\n *\n * Bounds concurrent heavy/cpu subprocesses independently of tool concurrency\n * (§10.1: 4 concurrent reads != 4 concurrent `npm test` processes). One pool\n * instance is shared by a session and, later, its child subagents (§14.1) —\n * a child creating its own pool would oversubscribe the host.\n *\n * §10.3 rules implemented here: strict FIFO (§10.4), abort- and\n * timeout-aware waiting, exactly-once release with double-release recorded\n * as a diagnostic no-op, immediate rejection of requests wider than\n * capacity, and a hard queue cap whose overflow surfaces as a structured\n * error code (§15.4 `queue_overflow`). Waiter timers stay ref'd — a permit\n * wait is actively awaited work — and are cleared on settle.\n */\n\nexport interface WorkloadPermitRequest {\n\treadonly requestId: string;\n\treadonly promptRunId: string;\n\treadonly workloadClass: WorkloadClass;\n\treadonly weight: 1 | 2;\n\treadonly signal?: AbortSignal;\n\treadonly timeoutMs?: number;\n}\n\nexport interface WorkloadPermit {\n\treadonly permitId: string;\n\treadonly requestId: string;\n\treadonly acquiredAt: string;\n\trelease(): void;\n}\n\nexport interface WorkloadPermitPoolSnapshot {\n\treadonly capacity: number;\n\treadonly activeWeight: number;\n\treadonly queuedCount: number;\n}\n\nexport type WorkloadPermitErrorCode = \"queue_overflow\" | \"timeout\" | \"aborted\" | \"over_capacity_weight\";\n\nexport class WorkloadPermitError extends Error {\n\treadonly code: WorkloadPermitErrorCode;\n\treadonly requestId: string;\n\n\tconstructor(code: WorkloadPermitErrorCode, requestId: string) {\n\t\tsuper(`workload permit ${code} (request ${requestId})`);\n\t\tthis.name = \"WorkloadPermitError\";\n\t\tthis.code = code;\n\t\tthis.requestId = requestId;\n\t}\n}\n\ninterface Waiter {\n\treadonly request: WorkloadPermitRequest;\n\treadonly resolve: (permit: WorkloadPermit) => void;\n\treadonly reject: (error: WorkloadPermitError) => void;\n\ttimer: ReturnType<typeof setTimeout> | null;\n\tabortListener: (() => void) | null;\n}\n\nexport const DEFAULT_PERMIT_QUEUE_CAP = 32;\n\nexport type WorkloadPermitPoolOptions = {\n\t/** Concurrent weight budget; §7.2 heavy caps feed this. Default 2. */\n\tcapacity?: number;\n\t/** §10.3 queue length hard cap. Default 32. */\n\tmaxQueue?: number;\n\t/** Injectable clock for deterministic tests. */\n\tnow?: () => Date;\n};\n\nexport class WorkloadPermitPool {\n\tprivate capacity: number;\n\tprivate readonly maxQueue: number;\n\tprivate readonly now: () => Date;\n\tprivate activeWeight = 0;\n\tprivate readonly queue: Waiter[] = [];\n\tprivate readonly releasedPermitIds = new Set<string>();\n\tprivate readonly activePermitIds = new Set<string>();\n\tprivate doubleReleases = 0;\n\n\tconstructor(options?: WorkloadPermitPoolOptions) {\n\t\tthis.capacity = sanitizeCapacity(options?.capacity, 2);\n\t\tthis.maxQueue = sanitizeCapacity(options?.maxQueue, DEFAULT_PERMIT_QUEUE_CAP);\n\t\tthis.now = options?.now ?? (() => new Date());\n\t}\n\n\t/**\n\t * Update capacity from a new admission decision. In-flight permits are\n\t * never revoked; a reduction only delays future grants until active\n\t * weight drains below the new capacity.\n\t */\n\tsetCapacity(capacity: number): void {\n\t\tthis.capacity = sanitizeCapacity(capacity, this.capacity);\n\t\tthis.grantWhilePossible();\n\t}\n\n\t/** Acquire a permit. Strict FIFO; rejects with {@link WorkloadPermitError}. */\n\tacquire(request: WorkloadPermitRequest): Promise<WorkloadPermit> {\n\t\tif (request.weight > this.capacity) {\n\t\t\treturn Promise.reject(new WorkloadPermitError(\"over_capacity_weight\", request.requestId));\n\t\t}\n\t\tif (request.signal?.aborted) {\n\t\t\treturn Promise.reject(new WorkloadPermitError(\"aborted\", request.requestId));\n\t\t}\n\t\tif (this.queue.length === 0 && this.activeWeight + request.weight <= this.capacity) {\n\t\t\treturn Promise.resolve(this.grant(request));\n\t\t}\n\t\tif (this.queue.length >= this.maxQueue) {\n\t\t\treturn Promise.reject(new WorkloadPermitError(\"queue_overflow\", request.requestId));\n\t\t}\n\t\treturn new Promise<WorkloadPermit>((resolve, reject) => {\n\t\t\tconst waiter: Waiter = { request, resolve, reject, timer: null, abortListener: null };\n\t\t\tif (typeof request.timeoutMs === \"number\" && Number.isFinite(request.timeoutMs) && request.timeoutMs > 0) {\n\t\t\t\twaiter.timer = setTimeout(() => {\n\t\t\t\t\tthis.evict(waiter, \"timeout\");\n\t\t\t\t}, request.timeoutMs);\n\t\t\t}\n\t\t\tif (request.signal) {\n\t\t\t\tconst signal = request.signal;\n\t\t\t\twaiter.abortListener = () => {\n\t\t\t\t\tthis.evict(waiter, \"aborted\");\n\t\t\t\t};\n\t\t\t\tsignal.addEventListener(\"abort\", waiter.abortListener, { once: true });\n\t\t\t}\n\t\t\tthis.queue.push(waiter);\n\t\t});\n\t}\n\n\tsnapshot(): WorkloadPermitPoolSnapshot {\n\t\treturn { capacity: this.capacity, activeWeight: this.activeWeight, queuedCount: this.queue.length };\n\t}\n\n\t/** Diagnostic count of double releases (§10.3 no-op + diagnostic). */\n\tget doubleReleaseCount(): number {\n\t\treturn this.doubleReleases;\n\t}\n\n\tprivate grant(request: WorkloadPermitRequest): WorkloadPermit {\n\t\tthis.activeWeight += request.weight;\n\t\tconst permitId = `permit-${randomUUID()}`;\n\t\tthis.activePermitIds.add(permitId);\n\t\tconst release = (): void => {\n\t\t\t// §10.3 exactly-once: a late or repeated settlement must not return\n\t\t\t// weight it no longer owns.\n\t\t\tif (this.releasedPermitIds.has(permitId) || !this.activePermitIds.has(permitId)) {\n\t\t\t\tthis.doubleReleases += 1;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis.activePermitIds.delete(permitId);\n\t\t\tthis.releasedPermitIds.add(permitId);\n\t\t\tthis.activeWeight = Math.max(0, this.activeWeight - request.weight);\n\t\t\tthis.grantWhilePossible();\n\t\t};\n\t\treturn { permitId, requestId: request.requestId, acquiredAt: this.now().toISOString(), release };\n\t}\n\n\t/** Grant queued waiters strictly in FIFO order while the head fits (§10.4). */\n\tprivate grantWhilePossible(): void {\n\t\twhile (this.queue.length > 0) {\n\t\t\tconst head = this.queue[0];\n\t\t\tif (head.request.weight > this.capacity) {\n\t\t\t\t// Capacity shrank below the head's weight: reject rather than\n\t\t\t\t// starving everyone behind it forever.\n\t\t\t\tthis.queue.shift();\n\t\t\t\tthis.settleCleanup(head);\n\t\t\t\thead.reject(new WorkloadPermitError(\"over_capacity_weight\", head.request.requestId));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (this.activeWeight + head.request.weight > this.capacity) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis.queue.shift();\n\t\t\tthis.settleCleanup(head);\n\t\t\thead.resolve(this.grant(head.request));\n\t\t}\n\t}\n\n\tprivate evict(waiter: Waiter, code: WorkloadPermitErrorCode): void {\n\t\tconst index = this.queue.indexOf(waiter);\n\t\tif (index === -1) {\n\t\t\treturn; // Already granted or already evicted.\n\t\t}\n\t\tthis.queue.splice(index, 1);\n\t\tthis.settleCleanup(waiter);\n\t\twaiter.reject(new WorkloadPermitError(code, waiter.request.requestId));\n\t}\n\n\tprivate settleCleanup(waiter: Waiter): void {\n\t\tif (waiter.timer !== null) {\n\t\t\tclearTimeout(waiter.timer);\n\t\t\twaiter.timer = null;\n\t\t}\n\t\tif (waiter.abortListener !== null) {\n\t\t\twaiter.request.signal?.removeEventListener(\"abort\", waiter.abortListener);\n\t\t\twaiter.abortListener = null;\n\t\t}\n\t}\n}\n\nfunction sanitizeCapacity(value: number | undefined, fallback: number): number {\n\tif (typeof value !== \"number\" || !Number.isFinite(value) || value < 1) {\n\t\treturn fallback;\n\t}\n\treturn Math.floor(value);\n}\n"]}

package/dist/core/workload-shard-executor.d.ts

@@ -0,0 +1,68 @@
+import type { ResourceAdmissionDecision } from "./resource-admission.ts";
+import type { WorkloadPermitPool } from "./workload-permit-pool.ts";
+import { type WorkloadShardPlan, type WorkloadShardSpec, type WorkloadShardState } from "./workload-shard-plan.ts";
+import { type WorkloadShardStore } from "./workload-shard-store.ts";
+/**
+ * Workload shard executor (OMK v0.97.x roadmap §13, M5 completion slice).
+ *
+ * Drives a validated `WorkloadShardPlan` through the journalled §13.4 state
+ * machine: passed shards are terminal and never re-run (§13.5 step 3),
+ * crash-orphaned `running` shards are recovered through `pending` re-arm
+ * records, concurrency is recomputed from the CURRENT admission decision
+ * (§13.5 step 6) plus the shared permit pool, and completion produces an
+ * aggregate evidence receipt (§13.6) — an observation input for
+ * `evaluateTask()`, never a task verdict by itself.
+ *
+ * Fail-closed rules (§21): a corrupt journal is quarantined and the run is
+ * `blocked`; a journal written for a different plan is `blocked`; an invalid
+ * plan never starts. The executor never rewrites shard commands (§12.3) —
+ * it only runs what the plan's descriptors already describe via the
+ * injected runner.
+ */
+export interface ShardRunContext {
+    readonly shard: WorkloadShardSpec;
+    readonly attempt: number;
+    readonly signal?: AbortSignal;
+}
+export type ShardRunner = (context: ShardRunContext) => Promise<{
+    readonly exitCode: number;
+    readonly evidenceRefs?: readonly string[];
+}>;
+export interface ExecuteWorkloadShardPlanInput {
+    readonly plan: WorkloadShardPlan;
+    readonly store: WorkloadShardStore;
+    readonly runner: ShardRunner;
+    readonly decision: ResourceAdmissionDecision;
+    readonly permitPool?: WorkloadPermitPool;
+    readonly signal?: AbortSignal;
+    /** §13.5 step 4 retry policy: re-arm previously failed shards. Default false. */
+    readonly retryFailed?: boolean;
+    /** §13.4: aborted -> pending needs an explicit resume; this call is that act. Default true. */
+    readonly resumeAborted?: boolean;
+    readonly permitWaitTimeoutMs?: number;
+    readonly now?: () => Date;
+}
+export interface ShardResultSummary {
+    readonly shardId: string;
+    readonly state: WorkloadShardState;
+    readonly attempt: number;
+    readonly evidenceRefs: readonly string[];
+    readonly reasonCode?: string;
+}
+/** §13.6 aggregate evidence receipt; §15.1 observation kind. */
+export interface WorkloadShardAggregateEvidence {
+    readonly kind: "workload_shard_result.v1";
+    readonly planId: string;
+    readonly promptRunId: string;
+    readonly commandDigest: string;
+    readonly strategy: string;
+    readonly verdict: "passed" | "failed" | "aborted" | "blocked";
+    readonly reasonCodes: readonly string[];
+    readonly shardCount: number;
+    readonly counts: Readonly<Record<WorkloadShardState, number>>;
+    readonly shards: readonly ShardResultSummary[];
+    readonly effectiveConcurrency: number;
+    readonly completedAt: string;
+}
+export declare function executeWorkloadShardPlan(input: ExecuteWorkloadShardPlanInput): Promise<WorkloadShardAggregateEvidence>;
+//# sourceMappingURL=workload-shard-executor.d.ts.map

package/dist/core/workload-shard-executor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"workload-shard-executor.d.ts","sourceRoot":"","sources":["../../src/core/workload-shard-executor.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,yBAAyB,CAAC;AACzE,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AACpE,OAAO,EAIN,KAAK,iBAAiB,EAEtB,KAAK,iBAAiB,EACtB,KAAK,kBAAkB,EACvB,MAAM,0BAA0B,CAAC;AAElC,OAAO,EAA6B,KAAK,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAE/F;;;;;;;;;;;;;;;;GAgBG;AAEH,MAAM,WAAW,eAAe;IAC/B,QAAQ,CAAC,KAAK,EAAE,iBAAiB,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,CAAC,EAAE,WAAW,CAAC;CAC9B;AAED,MAAM,MAAM,WAAW,GAAG,CACzB,OAAO,EAAE,eAAe,KACpB,OAAO,CAAC;IAAE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,CAAC,CAAC;AAEvF,MAAM,WAAW,6BAA6B;IAC7C,QAAQ,CAAC,IAAI,EAAE,iBAAiB,CAAC;IACjC,QAAQ,CAAC,KAAK,EAAE,kBAAkB,CAAC;IACnC,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,yBAAyB,CAAC;IAC7C,QAAQ,CAAC,UAAU,CAAC,EAAE,kBAAkB,CAAC;IACzC,QAAQ,CAAC,MAAM,CAAC,EAAE,WAAW,CAAC;IAC9B,kFAAiF;IACjF,QAAQ,CAAC,WAAW,CAAC,EAAE,OAAO,CAAC;IAC/B,gGAA+F;IAC/F,QAAQ,CAAC,aAAa,CAAC,EAAE,OAAO,CAAC;IACjC,QAAQ,CAAC,mBAAmB,CAAC,EAAE,MAAM,CAAC;IACtC,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC;CAC1B;AAED,MAAM,WAAW,kBAAkB;IAClC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,kBAAkB,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED,kEAAgE;AAChE,MAAM,WAAW,8BAA8B;IAC9C,QAAQ,CAAC,IAAI,EAAE,0BAA0B,CAAC;IAC1C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,CAAC;IAC9D,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,kBAAkB,EAAE,MAAM,CAAC,CAAC,CAAC;IAC9D,QAAQ,CAAC,MAAM,EAAE,SAAS,kBAAkB,EAAE,CAAC;IAC/C,QAAQ,CAAC,oBAAoB,EAAE,MAAM,CAAC;IACtC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC7B;AAED,wBAAsB,wBAAwB,CAC7C,KAAK,EAAE,6BAA6B,GAClC,OAAO,CAAC,8BAA8B,CAAC,CAoFzC","sourcesContent":["import type { ResourceAdmissionDecision } from \"./resource-admission.ts\";\nimport type { WorkloadPermitPool } from \"./workload-permit-pool.ts\";\nimport {\n\tplanShardResume,\n\treduceShardRecords,\n\tvalidateWorkloadShardPlan,\n\ttype WorkloadShardPlan,\n\ttype WorkloadShardProjection,\n\ttype WorkloadShardSpec,\n\ttype WorkloadShardState,\n} from \"./workload-shard-plan.ts\";\nimport { applyTransition, runOneShard, shardById } from \"./workload-shard-runner.ts\";\nimport { WorkloadShardJournalError, type WorkloadShardStore } from \"./workload-shard-store.ts\";\n\n/**\n * Workload shard executor (OMK v0.97.x roadmap §13, M5 completion slice).\n *\n * Drives a validated `WorkloadShardPlan` through the journalled §13.4 state\n * machine: passed shards are terminal and never re-run (§13.5 step 3),\n * crash-orphaned `running` shards are recovered through `pending` re-arm\n * records, concurrency is recomputed from the CURRENT admission decision\n * (§13.5 step 6) plus the shared permit pool, and completion produces an\n * aggregate evidence receipt (§13.6) — an observation input for\n * `evaluateTask()`, never a task verdict by itself.\n *\n * Fail-closed rules (§21): a corrupt journal is quarantined and the run is\n * `blocked`; a journal written for a different plan is `blocked`; an invalid\n * plan never starts. The executor never rewrites shard commands (§12.3) —\n * it only runs what the plan's descriptors already describe via the\n * injected runner.\n */\n\nexport interface ShardRunContext {\n\treadonly shard: WorkloadShardSpec;\n\treadonly attempt: number;\n\treadonly signal?: AbortSignal;\n}\n\nexport type ShardRunner = (\n\tcontext: ShardRunContext,\n) => Promise<{ readonly exitCode: number; readonly evidenceRefs?: readonly string[] }>;\n\nexport interface ExecuteWorkloadShardPlanInput {\n\treadonly plan: WorkloadShardPlan;\n\treadonly store: WorkloadShardStore;\n\treadonly runner: ShardRunner;\n\treadonly decision: ResourceAdmissionDecision;\n\treadonly permitPool?: WorkloadPermitPool;\n\treadonly signal?: AbortSignal;\n\t/** §13.5 step 4 retry policy: re-arm previously failed shards. Default false. */\n\treadonly retryFailed?: boolean;\n\t/** §13.4: aborted -> pending needs an explicit resume; this call is that act. Default true. */\n\treadonly resumeAborted?: boolean;\n\treadonly permitWaitTimeoutMs?: number;\n\treadonly now?: () => Date;\n}\n\nexport interface ShardResultSummary {\n\treadonly shardId: string;\n\treadonly state: WorkloadShardState;\n\treadonly attempt: number;\n\treadonly evidenceRefs: readonly string[];\n\treadonly reasonCode?: string;\n}\n\n/** §13.6 aggregate evidence receipt; §15.1 observation kind. */\nexport interface WorkloadShardAggregateEvidence {\n\treadonly kind: \"workload_shard_result.v1\";\n\treadonly planId: string;\n\treadonly promptRunId: string;\n\treadonly commandDigest: string;\n\treadonly strategy: string;\n\treadonly verdict: \"passed\" | \"failed\" | \"aborted\" | \"blocked\";\n\treadonly reasonCodes: readonly string[];\n\treadonly shardCount: number;\n\treadonly counts: Readonly<Record<WorkloadShardState, number>>;\n\treadonly shards: readonly ShardResultSummary[];\n\treadonly effectiveConcurrency: number;\n\treadonly completedAt: string;\n}\n\nexport async function executeWorkloadShardPlan(\n\tinput: ExecuteWorkloadShardPlanInput,\n): Promise<WorkloadShardAggregateEvidence> {\n\tconst now = input.now ?? (() => new Date());\n\tconst planErrors = validateWorkloadShardPlan(input.plan);\n\tif (planErrors.length > 0) {\n\t\treturn blockedEvidence(input, now, [\"plan.invalid\", ...planErrors.slice(0, 3)]);\n\t}\n\n\tlet journal: ReturnType<WorkloadShardStore[\"load\"]>;\n\ttry {\n\t\tjournal = input.store.load();\n\t} catch (error) {\n\t\t// §21 fail closed: corrupt evidence is quarantined, never silently rebuilt.\n\t\tif (error instanceof WorkloadShardJournalError) {\n\t\t\tinput.store.quarantine();\n\t\t\treturn blockedEvidence(input, now, [`journal.${error.code}`]);\n\t\t}\n\t\tthrow error;\n\t}\n\tif (journal.plan === null) {\n\t\tinput.store.appendPlan(input.plan);\n\t} else if (journal.plan.planId !== input.plan.planId || journal.plan.commandDigest !== input.plan.commandDigest) {\n\t\treturn blockedEvidence(input, now, [\"plan.mismatch\"]);\n\t}\n\n\tconst projections = new Map<string, WorkloadShardProjection>(\n\t\tjournal.projections ?? reduceShardRecords(input.plan, []),\n\t);\n\tconst effectiveConcurrency = Math.max(1, Math.min(input.plan.maxConcurrency, input.decision.maxHeavyProcesses));\n\n\t// §13.5 steps 2-4: re-arm recoverable shards through explicit pending records.\n\tconst resume = planShardResume(input.plan, projections);\n\tconst rearm = [\n\t\t...resume.interrupted,\n\t\t...(input.retryFailed ? resume.retryable : []),\n\t\t...((input.resumeAborted ?? true) ? resume.resumable : []),\n\t];\n\tfor (const shardId of rearm) {\n\t\t// §13.5 step 2: a crash-orphaned `running` shard is first projected as\n\t\t// interrupted (running -> pending is illegal in §13.4), then re-armed.\n\t\tif (projections.get(shardId)?.state === \"running\") {\n\t\t\tapplyTransition(input, projections, shardId, \"interrupted\", { reasonCode: \"recovery.orphaned\", now });\n\t\t}\n\t\tapplyTransition(input, projections, shardId, \"pending\", { reasonCode: \"recovery.rearm\", now });\n\t}\n\n\t// Dependency-wave scheduler: launch ready shards up to the recomputed width.\n\tconst remaining = new Set(\n\t\tinput.plan.shards.map((shard) => shard.shardId).filter((id) => projections.get(id)?.state !== \"passed\"),\n\t);\n\tlet active = 0;\n\tlet wake: (() => void) | undefined;\n\tconst waitTurn = () =>\n\t\tnew Promise<void>((resolve) => {\n\t\t\twake = resolve;\n\t\t});\n\tconst running = new Map<string, Promise<void>>();\n\n\twhile (remaining.size > 0 && !input.signal?.aborted) {\n\t\tconst ready = [...remaining].filter((id) => {\n\t\t\tconst projection = projections.get(id);\n\t\t\tif (projection?.state !== \"pending\") return false;\n\t\t\tconst spec = shardById(input.plan, id);\n\t\t\treturn spec.dependencyIds.every((dep) => projections.get(dep)?.state === \"passed\");\n\t\t});\n\t\tconst launchable = ready.slice(0, Math.max(0, effectiveConcurrency - active));\n\t\tif (launchable.length === 0) {\n\t\t\tif (running.size === 0) break; // deadlock = blocked dependents; aggregate reports them\n\t\t\tawait Promise.race([...running.values(), waitTurn()]);\n\t\t\tcontinue;\n\t\t}\n\t\tfor (const shardId of launchable) {\n\t\t\tremaining.delete(shardId);\n\t\t\tactive += 1;\n\t\t\tconst task = runOneShard(input, projections, shardId, now).finally(() => {\n\t\t\t\tactive -= 1;\n\t\t\t\trunning.delete(shardId);\n\t\t\t\twake?.();\n\t\t\t});\n\t\t\trunning.set(shardId, task);\n\t\t}\n\t}\n\tawait Promise.all(running.values());\n\n\treturn aggregate(input, projections, effectiveConcurrency, now, input.signal?.aborted ? [\"run.aborted\"] : []);\n}\n\nfunction aggregate(\n\tinput: ExecuteWorkloadShardPlanInput,\n\tprojections: ReadonlyMap<string, WorkloadShardProjection>,\n\teffectiveConcurrency: number,\n\tnow: () => Date,\n\textraReasons: readonly string[],\n): WorkloadShardAggregateEvidence {\n\tconst counts: Record<WorkloadShardState, number> = {\n\t\tpending: 0,\n\t\trunning: 0,\n\t\tpassed: 0,\n\t\tfailed: 0,\n\t\taborted: 0,\n\t\tinterrupted: 0,\n\t};\n\tconst shards: ShardResultSummary[] = input.plan.shards.map((shard) => {\n\t\tconst projection = projections.get(shard.shardId);\n\t\tconst state = projection?.state ?? \"pending\";\n\t\tcounts[state] += 1;\n\t\treturn {\n\t\t\tshardId: shard.shardId,\n\t\t\tstate,\n\t\t\tattempt: projection?.attempt ?? 0,\n\t\t\tevidenceRefs: projection?.evidenceRefs ?? [],\n\t\t\t...(projection?.reasonCode !== undefined ? { reasonCode: projection.reasonCode } : {}),\n\t\t};\n\t});\n\tconst verdict = aggregateVerdict(counts, input.plan.shards.length, extraReasons);\n\treturn {\n\t\tkind: \"workload_shard_result.v1\",\n\t\tplanId: input.plan.planId,\n\t\tpromptRunId: input.plan.promptRunId,\n\t\tcommandDigest: input.plan.commandDigest,\n\t\tstrategy: input.plan.strategy,\n\t\tverdict,\n\t\treasonCodes: extraReasons,\n\t\tshardCount: input.plan.shards.length,\n\t\tcounts,\n\t\tshards,\n\t\teffectiveConcurrency,\n\t\tcompletedAt: now().toISOString(),\n\t};\n}\n\nfunction blockedEvidence(\n\tinput: ExecuteWorkloadShardPlanInput,\n\tnow: () => Date,\n\treasonCodes: readonly string[],\n): WorkloadShardAggregateEvidence {\n\tconst counts: Record<WorkloadShardState, number> = {\n\t\tpending: input.plan.shards.length,\n\t\trunning: 0,\n\t\tpassed: 0,\n\t\tfailed: 0,\n\t\taborted: 0,\n\t\tinterrupted: 0,\n\t};\n\treturn {\n\t\tkind: \"workload_shard_result.v1\",\n\t\tplanId: input.plan.planId,\n\t\tpromptRunId: input.plan.promptRunId,\n\t\tcommandDigest: input.plan.commandDigest,\n\t\tstrategy: input.plan.strategy,\n\t\tverdict: \"blocked\",\n\t\treasonCodes,\n\t\tshardCount: input.plan.shards.length,\n\t\tcounts,\n\t\tshards: input.plan.shards.map((shard) => ({\n\t\t\tshardId: shard.shardId,\n\t\t\tstate: \"pending\" as const,\n\t\t\tattempt: 0,\n\t\t\tevidenceRefs: [],\n\t\t})),\n\t\teffectiveConcurrency: 0,\n\t\tcompletedAt: now().toISOString(),\n\t};\n}\n\n/** §13.6: \"passed\" requires EVERY shard to hold terminal passed evidence. */\nfunction aggregateVerdict(\n\tcounts: Readonly<Record<WorkloadShardState, number>>,\n\tshardCount: number,\n\textraReasons: readonly string[],\n): WorkloadShardAggregateEvidence[\"verdict\"] {\n\tif (counts.passed === shardCount) return \"passed\";\n\tif (counts.aborted > 0 || extraReasons.includes(\"run.aborted\")) return \"aborted\";\n\treturn \"failed\";\n}\n"]}