@humwick/runner 0.130.0 → 0.130.2

package/src/test-run-dedup.ts

@@ -1,41 +1,14 @@
 import { relayEnv } from "@humwick/sdk/env";
-// #2142 — per-agent test-run dedup ("latest wins").
-//
-// Workers run `bun run test:affected` after every file change. When a change touches something
-// broad, a single run takes 10-15 minutes — and the agent starts the NEXT run long before the
-// previous one finishes. The stacked runs saturate the host: each one holds a gate slot, forks
-// its own shard processes, and the oldest run's result is thrown away the moment it lands.
-// Instructions don't fix this (an agent rationalizes around them), so the bound has to be
-// structural and live BELOW the agent: the runner watches its own session's process tree and,
-// whenever it sees more than one independent test run, kills every run except the newest.
-//
-// Scoping is per-agent BY CONSTRUCTION: the sweep only ever looks at processes it can PROVE belong
-// to this agent — descendants of this session's provider process (the tmux pane pid / direct child
-// pid the adapter already resolves for busy-liveness), plus processes carrying this agent's
-// AGENT_RELAY_ID in their environment. A sibling agent's runs satisfy neither test, so this can
-// never fratricide the fleet the way a host-wide `pkill -f` would (#753). It is also
-// provider-agnostic — nothing here knows whether the tree belongs to Claude or Codex.
-//
-// #2461 — the env-tag half of that ownership test is new, and it is why this file exists at all
-// after the lease landed. Ancestry ALONE made this a no-op for the case the issue reports: a
-// `relay_run` gate run executes under the ORCHESTRATOR daemon, a tree that shares no ancestor with
-// the provider pane, so a descendant-scoped sweep could never see it. The orchestrator now stamps
-// AGENT_RELAY_ID onto those children, which is what makes them attributable here.
-//
-// This sweep is now the BACKSTOP, not the primary mechanism. Kill-replace happens at LAUNCH, in
-// sdk/src/gate-run-lease.ts, entered from `scripts/gate-slot` and the orchestrator. What is left
-// for the sweep is the residual shape neither front door sees: a gate run started straight from the
-// provider shell in a repo that does not route through `gate.sh`. It is 15s-late by construction —
-// that is the documented coverage gap, tracked for a launch-exact PATH shim in the follow-up issue.
-// When a live lease holder exists it is AUTHORITATIVE: the sweep keeps it and kills the rest, so
-// the two mechanisms can never disagree about which run survives.
+// #3754 — the lease owns launch-time replacement. The sweep only deduplicates
+// unleased runs with the same captured checkout/revision; ancestry proves ownership,
+// but cannot prove two commands tested the same tree. Live leases protect whole runs.
 import { execFile } from "node:child_process";
 import { readFileSync, readdirSync } from "node:fs";
 import { promisify } from "node:util";
 import { errMessage } from "@humwick/sdk";
 import { killPid, waitForPidsExit } from "@humwick/sdk/process-utils";
 import { classifyGateRun, isTestRunCommand, type GateRunCommands } from "@humwick/sdk/gate-run-classify";
-import { GATE_RUN_AGENT_ENV } from "@humwick/sdk/gate-run-lease";
+import { GATE_RUN_AGENT_ENV, GATE_RUN_CONTEXT_ENV, GATE_RUN_HELD_ENV, readLiveGateRunHolderPids } from "@humwick/sdk/gate-run-lease";
 import type { ManagedProcess } from "./adapter";
 
 // Re-exported so the sweep and both lease front doors share ONE definition of "is this a test run".
@@ -215,6 +188,9 @@ export interface TestRunDedupScope {
   /** Classifier override. Defaults to the argv-shape heuristic; the sweep passes a classifier bound
    *  to the repo's CONFIGURED gate commands so a foreign runner (`pnpm tier:run …`) is matched too. */
   isGateRun?: (args: string) => boolean;
+  /** Launch-time checkout/revision identity. Missing identity cannot prove a duplicate. */
+  contextByPid?: ReadonlyMap<number, string>;
+  leasedPids?: readonly number[];
 }
 
 export function planTestRunDedup(
@@ -278,29 +254,34 @@ export function planTestRunDedup(
   }
   if (runRoots.length < 2) return EMPTY_PLAN;
 
-  // Lower elapsed = started later = the run the agent actually wants. `ps etime` only has
-  // second precision, though, and a Codex agent can launch two commands within that second.
-  // Pids are allocated in start order within the host pid namespace, so the higher pid is the
-  // newer root for this otherwise-unresolvable tie. Without this deterministic tie-breaker, two
-  // same-second delivery runs remain tied forever and #2142 fails to bound the exact burst it
-  // was added for. The scope is still this session's process tree only.
-  // A live lease holder wins outright — it is the run the launch-time mechanism already chose. Only
-  // when there is none (an ungated run in a repo without gate.sh) does newest-wins decide.
-  const leaseKeep = scope.keepPid !== undefined && runRoots.includes(scope.keepPid) ? scope.keepPid : undefined;
-  const keptPid = leaseKeep ?? runRoots.reduce((newest, pid) => {
-    const candidate = byPid.get(pid)!;
-    const current = byPid.get(newest)!;
-    return candidate.elapsedSeconds < current.elapsedSeconds
-      || (candidate.elapsedSeconds === current.elapsedSeconds && pid > newest)
-      ? pid
-      : newest;
-  });
-  const newestElapsed = byPid.get(keptPid)!.elapsedSeconds;
-  const staleRoots = runRoots
-    // With a lease holder the age comparison is meaningless — the holder may be the OLDER run, and
-    // it still wins. Without one, keep the original guard so a mis-ranked row is never killed.
-    .filter((pid) => pid !== keptPid && (leaseKeep !== undefined || byPid.get(pid)!.elapsedSeconds >= newestElapsed))
-    .sort((a, b) => a - b);
+  // A lease may belong to a child of the outer shell. Spare the WHOLE run, including
+  // ancestors and descendants, rather than signalling its owner indirectly (#3754).
+  const leased = new Set(scope.leasedPids ?? []);
+  const groups = new Map<string, number[]>();
+  const leasedRoots = new Set<number>();
+  for (const pid of runRoots) {
+    if (subtree(pid).some((child) => leased.has(child))) leasedRoots.add(pid);
+    const context = scope.contextByPid ? scope.contextByPid.get(pid) : "legacy";
+    if (!context) continue;
+    const group = groups.get(context) ?? [];
+    group.push(pid);
+    groups.set(context, group);
+  }
+  const staleRoots: number[] = [];
+  let keptPid: number | undefined;
+  for (const group of groups.values()) {
+    if (group.length < 2) continue;
+    const leaseKeep = scope.keepPid !== undefined && group.includes(scope.keepPid) ? scope.keepPid : undefined;
+    const newest = group.find((pid) => leasedRoots.has(pid)) ?? leaseKeep ?? group.reduce((current, pid) => {
+      const candidate = byPid.get(pid)!;
+      const prior = byPid.get(current)!;
+      return candidate.elapsedSeconds < prior.elapsedSeconds
+        || (candidate.elapsedSeconds === prior.elapsedSeconds && pid > current) ? pid : current;
+    });
+    keptPid = newest;
+    staleRoots.push(...group.filter((pid) => pid !== newest && !leasedRoots.has(pid)));
+  }
+  staleRoots.sort((a, b) => a - b);
   if (staleRoots.length === 0) return EMPTY_PLAN;
 
   const protectedSet = new Set([rootPid, ...protectedPids]);
@@ -334,6 +315,17 @@ export async function readProcessTable(timeoutMs: number = PROCESS_TABLE_TIMEOUT
   return stdout;
 }
 
+/** Only launch-time metadata can distinguish revisions; today's HEAD cannot (#3754). */
+export function readTestRunContext(pid: number): { context?: string; leased?: boolean } {
+  try {
+    const env = Object.fromEntries(readFileSync(`/proc/${pid}/environ`, "utf8").split("\0").map((entry) => {
+      const equals = entry.indexOf("=");
+      return [entry.slice(0, equals), entry.slice(equals + 1)];
+    }));
+    return { context: relayEnv(env, GATE_RUN_CONTEXT_ENV), leased: !!relayEnv(env, GATE_RUN_HELD_ENV) };
+  } catch { return {}; }
+}
+
 export interface TestRunDedupDeps {
   /** Resolve this session's provider pid. undefined ⇒ ancestry proves nothing; the env tag may. */
   rootPid: () => number | undefined;
@@ -344,6 +336,8 @@ export interface TestRunDedupDeps {
   gateCommands?: () => GateRunCommands;
   /** The live lease holder pid, when one exists — authoritative over newest-wins. */
   leaseHolderPid?: () => number | undefined;
+  readRunContext?: (pid: number) => { context?: string; leased?: boolean };
+  liveLeasePids?: () => Promise<number[]>;
   collectOwnedPids?: (agentId: string) => Promise<number[]>;
   readProcessTable?: () => Promise<string>;
   kill?: (pid: number, signal: "SIGTERM" | "SIGKILL") => void;
@@ -374,8 +368,17 @@ export async function runTestRunDedupSweep(deps: TestRunDedupDeps): Promise<numb
   }
 
   const gateCommands = deps.gateCommands?.() ?? {};
-  const plan = planTestRunDedup(parseProcessTable(table), rootPid, deps.protectedPids?.() ?? [], {
-    ownedPids,
+  const rows = parseProcessTable(table);
+  const contextByPid = new Map<number, string>();
+  const leasedPids = await (deps.liveLeasePids ?? (() => agentId ? readLiveGateRunHolderPids(agentId) : Promise.resolve([])))();
+  for (const row of rows) {
+    if (classifyGateRun(row.args, gateCommands) === null) continue;
+    const context = (deps.readRunContext ?? readTestRunContext)(row.pid);
+    if (context.context) contextByPid.set(row.pid, context.context);
+    if (context.leased) leasedPids.push(row.pid);
+  }
+  const plan = planTestRunDedup(rows, rootPid, deps.protectedPids?.() ?? [], {
+    ownedPids, contextByPid, leasedPids,
     keepPid: deps.leaseHolderPid?.(),
     isGateRun: (args) => classifyGateRun(args, gateCommands) !== null,
   });

package/node_modules/@humwick/offload/LICENSE

@@ -1,167 +0,0 @@
-# PolyForm Shield License 1.0.0
-
-<https://polyformproject.org/licenses/shield/1.0.0>
-
-## Acceptance
-
-In order to get any license under these terms, you must agree
-to them as both strict obligations and conditions to all
-your licenses.
-
-## Copyright License
-
-The licensor grants you a copyright license for the
-software to do everything you might do with the software
-that would otherwise infringe the licensor's copyright
-in it for any permitted purpose.  However, you may
-only distribute the software according to [Distribution
-License](#distribution-license) and make changes or new works
-based on the software according to [Changes and New Works
-License](#changes-and-new-works-license).
-
-## Distribution License
-
-The licensor grants you an additional copyright license
-to distribute copies of the software.  Your license
-to distribute covers distributing the software with
-changes and new works permitted by [Changes and New Works
-License](#changes-and-new-works-license).
-
-## Notices
-
-You must ensure that anyone who gets a copy of any part of
-the software from you also gets a copy of these terms or the
-URL for them above, as well as copies of any plain-text lines
-beginning with `Required Notice:` that the licensor provided
-with the software.  For example:
-
-> Required Notice: Copyright Yoyodyne, Inc. (http://example.com)
-
-## Changes and New Works License
-
-The licensor grants you an additional copyright license to
-make changes and new works based on the software for any
-permitted purpose.
-
-## Patent License
-
-The licensor grants you a patent license for the software that
-covers patent claims the licensor can license, or becomes able
-to license, that you would infringe by using the software.
-
-## Noncompete
-
-Any purpose is a permitted purpose, except for providing any
-product that competes with the software or any product the
-licensor or any of its affiliates provides using the software.
-
-## Competition
-
-Goods and services compete even when they provide functionality
-through different kinds of interfaces or for different technical
-platforms.  Applications can compete with services, libraries
-with plugins, frameworks with development tools, and so on,
-even if they're written in different programming languages
-or for different computer architectures.  Goods and services
-compete even when provided free of charge.  If you market a
-product as a practical substitute for the software or another
-product, it definitely competes.
-
-## New Products
-
-If you are using the software to provide a product that does
-not compete, but the licensor or any of its affiliates brings
-your product into competition by providing a new version of
-the software or another product using the software, you may
-continue using versions of the software available under these
-terms beforehand to provide your competing product, but not
-any later versions.
-
-## Discontinued Products
-
-You may begin using the software to compete with a product
-or service that the licensor or any of its affiliates has
-stopped providing, unless the licensor includes a plain-text
-line beginning with `Licensor Line of Business:` with the
-software that mentions that line of business.  For example:
-
-> Licensor Line of Business: YoyodyneCMS Content Management
-System (http://example.com/cms)
-
-## Sales of Business
-
-If the licensor or any of its affiliates sells a line of
-business developing the software or using the software
-to provide a product, the buyer can also enforce
-[Noncompete](#noncompete) for that product.
-
-## Fair Use
-
-You may have "fair use" rights for the software under the
-law. These terms do not limit them.
-
-## No Other Rights
-
-These terms do not allow you to sublicense or transfer any of
-your licenses to anyone else, or prevent the licensor from
-granting licenses to anyone else.  These terms do not imply
-any other licenses.
-
-## Patent Defense
-
-If you make any written claim that the software infringes or
-contributes to infringement of any patent, your patent license
-for the software granted under these terms ends immediately. If
-your company makes such a claim, your patent license ends
-immediately for work on behalf of your company.
-
-## Violations
-
-The first time you are notified in writing that you have
-violated any of these terms, or done anything with the software
-not covered by your licenses, your licenses can nonetheless
-continue if you come into full compliance with these terms,
-and take practical steps to correct past violations, within
-32 days of receiving notice.  Otherwise, all your licenses
-end immediately.
-
-## No Liability
-
-***As far as the law allows, the software comes as is, without
-any warranty or condition, and the licensor will not be liable
-to you for any damages arising out of these terms or the use
-or nature of the software, under any kind of legal claim.***
-
-## Definitions
-
-The **licensor** is the individual or entity offering these
-terms, and the **software** is the software the licensor makes
-available under these terms.
-
-A **product** can be a good or service, or a combination
-of them.
-
-**You** refers to the individual or entity agreeing to these
-terms.
-
-**Your company** is any legal entity, sole proprietorship,
-or other kind of organization that you work for, plus all
-its affiliates.
-
-**Affiliates** means the other organizations than an
-organization has control over, is under the control of, or is
-under common control with.
-
-**Control** means ownership of substantially all the assets of
-an entity, or the power to direct its management and policies
-by vote, contract, or otherwise.  Control can be direct or
-indirect.
-
-**Your licenses** are all the licenses granted to you for the
-software under these terms.
-
-**Use** means anything you do with the software requiring one
-of your licenses.
-
-Required Notice: Copyright 2026 Exelerus AB
-Licensor Line of Business: provider-independent runtimes and coordination software for teams of AI agents

package/node_modules/@humwick/offload/README.md

@@ -1,57 +0,0 @@
-# @humwick/offload
-
-Bounded execution primitives for CPU workers, cooperative async I/O, and subprocesses.
-All runners use `OffloadEnvelope` for timeout, abort, structured logging, labels, typed
-`OffloadError`, and injected escalation.
-
-## Maintenance adoption
-
-`WorkerPool` and `SubprocessRunner` expose `offThread: true`; this is an intentional
-marker, not an automatic scheduler integration. A maintenance job that hands its heavy
-work to either runner must explicitly wire the existing #1757 seam immediately after
-starting it:
-
-```ts
-const work = runner.run("heavy-job", input, { signal: context.signal });
-if (runner.offThread) context.markOffThread?.();
-await work;
-```
-
-`AsyncRunner` is bounded but stays on the process event loop, so it does not advertise
-`offThread`.
-
-## Shutdown
-
-Every runner has a teardown that cancels rather than waits: `WorkerPool.destroy()`,
-`AsyncRunner.destroy()` and `SubprocessRunner.destroy()` reject outstanding work with an
-`aborted` `OffloadError`, kill live subprocess groups, and refuse new work. `drain()` is
-the opposite — it waits for accepted work to finish and cancels nothing.
-
-Because subprocess children run in their own process group, they are reparented rather
-than reaped when the host dies; the runner installs a single process `exit` hook that
-SIGKILLs any group still alive. A host killed with SIGKILL cannot run that hook, so a
-supervisor is still the only guarantee there.
-
-## Bounds worth knowing
-
-- `timeoutMs` (and abort) are hard for subprocesses: SIGTERM, then SIGKILL to the process
-  group after `killGraceMs` (default 2s), so a child that traps SIGTERM cannot outlive
-  its deadline. The concurrency slot is held until the child is actually reaped, so
-  `stats` never reports a slot as free while its work is still running.
-- A non-zero exit is a failure by default (it rejects and takes an escalation strike). Probe
-  callers whose answer *is* the exit code — `tmux has-session`, `which`, `git rev-parse`, a
-  land gate — must declare it with `okExitCodes` (`[0, 1]`, or `"any"` when the failing codes
-  are not enumerable). Without it the escalation signal inverts: the sink pages on a healthy
-  fleet and then latches, so the real outage goes unreported.
-  **`"any"` also accepts signal deaths** — 137 (SIGKILL, typically the OOM killer) and 139
-  (SIGSEGV) come back as successes and re-arm the strike counter. That is deliberate for a
-  land gate, where an OOM-killed gate is just a failed gate, but it means an infrastructure
-  death reads as a healthy answer and never escalates. Prefer an explicit code list unless
-  the failing codes genuinely cannot be enumerated; timeout and abort still throw either way.
-- Subprocess output is captured up to `maxOutputBytes` per stream (default 8 MiB) and the
-  result carries `truncated`. The stream is still drained past the cap so a chatty child
-  never blocks on a full pipe.
-- `AsyncRunner` work that ignores its signal keeps its slot until it returns: the cap
-  degrades toward serial rather than over-admitting. `destroy()` still returns promptly.
-- A worker round-trip costs ~110µs, so tasks below roughly 1ms of CPU are not worth
-  offloading. `run()` has no backpressure: the queue is unbounded by design.

package/node_modules/@humwick/offload/dist/async-runner.d.ts

@@ -1,18 +0,0 @@
-import { type OffloadDefaults, type OffloadEnvelope } from "./types.js";
-export interface AsyncRunnerOptions extends OffloadDefaults {
-    concurrency: number;
-}
-export interface AsyncRunner {
-    run<T>(taskName: string, fn: (signal: AbortSignal) => Promise<T> | T, env?: OffloadEnvelope): Promise<T>;
-    readonly stats: {
-        active: number;
-        queued: number;
-    };
-    /** Resolves when everything accepted so far has finished. Does not cancel anything. */
-    drain(): Promise<void>;
-    /** Cancels in-flight work, settles every outstanding caller, and refuses new work. */
-    destroy(): Promise<void>;
-}
-/** Bounded I/O runner. Work receives the composed signal and must cooperate with aborts. */
-export declare function createAsyncRunner(options: AsyncRunnerOptions): AsyncRunner;
-//# sourceMappingURL=async-runner.d.ts.map

package/node_modules/@humwick/offload/dist/async-runner.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"async-runner.d.ts","sourceRoot":"","sources":["../src/async-runner.ts"],"names":[],"mappings":"AAEA,OAAO,EAAgE,KAAK,eAAe,EAAE,KAAK,eAAe,EAAE,MAAM,YAAY,CAAC;AAEtI,MAAM,WAAW,kBAAmB,SAAQ,eAAe;IACzD,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,WAAW;IAC1B,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,EAAE,WAAW,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,eAAe,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACzG,QAAQ,CAAC,KAAK,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IACnD,uFAAuF;IACvF,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,sFAAsF;IACtF,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;CAC1B;AAYD,4FAA4F;AAC5F,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,kBAAkB,GAAG,WAAW,CA6I1E"}

package/node_modules/@humwick/offload/dist/async-runner.js

@@ -1,158 +0,0 @@
-import PQueue from "p-queue";
-import { beginRun, finishLog, recordResult, startLog } from "./envelope.js";
-import { OffloadError, StrikeCounter, normalizeError, validateTimeout } from "./types.js";
-/** Bounded I/O runner. Work receives the composed signal and must cooperate with aborts. */
-export function createAsyncRunner(options) {
-    if (!Number.isSafeInteger(options.concurrency) || options.concurrency < 1)
-        throw new RangeError("concurrency must be a positive integer");
-    const queue = new PQueue({ concurrency: options.concurrency });
-    const counter = new StrikeCounter(options.escalationThreshold, options.escalationWindowAttempts);
-    const live = new Set();
-    let destroyed = false;
-    const abortedError = (taskName, cause) => new OffloadError({ kind: "aborted", taskName, message: `${taskName} was aborted`, cause });
-    const destroyedError = (taskName) => new OffloadError({ kind: "aborted", taskName, message: `${taskName} was cancelled: async runner destroyed` });
-    return {
-        get stats() { return { active: queue.pending, queued: queue.size }; },
-        async run(taskName, fn, env) {
-            const labels = env?.labels ?? {};
-            const logger = env?.logger ?? options.logger;
-            const sink = env?.onEscalate ?? options.onEscalate;
-            const reportRejection = async (error) => {
-                // Rejecting before the run reaches startLog is still a terminal outcome; without this
-                // the structured stream shows nothing at all for it.
-                finishLog(logger, "async", taskName, labels, performance.now(), error);
-                await recordResult({ counter, taskName, backend: "async", labels, error, sink, logger });
-                throw error;
-            };
-            if (destroyed)
-                return reportRejection(destroyedError(taskName));
-            if (env?.signal?.aborted)
-                return reportRejection(abortedError(taskName, env.signal.reason));
-            // Eagerly validated so an invalid deadline rejects with an OffloadError rather than
-            // escaping the queue callback as a raw RangeError (#1809 P0-1, same class).
-            try {
-                validateTimeout(env?.timeoutMs ?? options.defaultTimeoutMs);
-            }
-            catch (error) {
-                return reportRejection(normalizeError(taskName, error, "rejected"));
-            }
-            let publish;
-            let published = false;
-            const outcome = new Promise((resolve) => {
-                publish = (value) => { if (!published) {
-                    published = true;
-                    resolve(value);
-                } };
-            });
-            let started = false;
-            let cancelled = false;
-            const entry = {
-                taskName,
-                teardown: new AbortController(),
-                settled: outcome.then(() => undefined),
-                cancelIfQueued: (error) => {
-                    if (started || cancelled)
-                        return;
-                    cancelled = true;
-                    // The single funnel for both abort-while-queued and destroy()-cancels-queued, so
-                    // the one line each terminal path owes the structured stream is emitted here. The
-                    // callback bails on `cancelled` without logging, which keeps it to exactly one.
-                    finishLog(logger, "async", taskName, labels, performance.now(), error);
-                    publish({ ok: false, error });
-                },
-            };
-            live.add(entry);
-            // p-queue's own `signal` option used to provide this, but it also released the slot
-            // while the work kept running (#1809 P1-7). Cancelling here keeps abort prompt for
-            // queued work without lying about occupancy.
-            const signal = env?.signal;
-            const onQueuedAbort = signal ? () => entry.cancelIfQueued(abortedError(taskName, signal.reason)) : undefined;
-            if (signal && onQueuedAbort)
-                signal.addEventListener("abort", onQueuedAbort, { once: true });
-            const task = queue.add(async () => {
-                if (signal && onQueuedAbort)
-                    signal.removeEventListener("abort", onQueuedAbort);
-                let work;
-                let context;
-                let onAbort;
-                try {
-                    if (cancelled)
-                        return;
-                    if (destroyed || entry.teardown.signal.aborted) {
-                        const error = destroyedError(taskName);
-                        finishLog(logger, "async", taskName, labels, performance.now(), error);
-                        publish({ ok: false, error });
-                        return;
-                    }
-                    started = true;
-                    // Match WorkerPool semantics: a task's deadline starts when it receives a slot,
-                    // not while it is waiting behind unrelated bounded work.
-                    context = beginRun(taskName, env, options, entry.teardown.signal);
-                    const run = context;
-                    const startedAt = startLog(logger, "async", taskName, labels);
-                    try {
-                        if (run.signal.aborted)
-                            throw run.abortError();
-                        const abort = new Promise((_, reject) => {
-                            onAbort = () => reject(run.abortError());
-                            run.signal.addEventListener("abort", onAbort, { once: true });
-                        });
-                        work = Promise.resolve().then(() => fn(run.signal));
-                        const value = await Promise.race([work, abort]);
-                        finishLog(logger, "async", taskName, labels, startedAt);
-                        await recordResult({ counter, taskName, backend: "async", labels, sink, logger });
-                        publish({ ok: true, value });
-                    }
-                    catch (error) {
-                        const normalized = run.signal.aborted ? run.abortError() : normalizeError(taskName, error);
-                        finishLog(logger, "async", taskName, labels, startedAt, normalized);
-                        await recordResult({ counter, taskName, backend: "async", labels, error: normalized, sink, logger });
-                        publish({ ok: false, error: normalized });
-                    }
-                    finally {
-                        // The composite signal stays reachable from the caller's long-lived signal, so an
-                        // un-removed listener retains this closure for the process lifetime (#1809 P0-4).
-                        if (onAbort)
-                            run.signal.removeEventListener("abort", onAbort);
-                        run.cleanup();
-                    }
-                }
-                catch (error) {
-                    const normalized = normalizeError(taskName, error, "rejected");
-                    finishLog(logger, "async", taskName, labels, performance.now(), normalized);
-                    await recordResult({ counter, taskName, backend: "async", labels, error: normalized, sink, logger });
-                    publish({ ok: false, error: normalized });
-                }
-                finally {
-                    context?.cleanup();
-                    // The caller may already have been settled by the abort race; the slot stays held
-                    // until the work itself finishes, otherwise the cap admits a replacement while the
-                    // aborted task is still running and `stats` under-reports it (#1809 P1-7).
-                    if (work)
-                        await work.catch(() => undefined);
-                    live.delete(entry);
-                }
-            });
-            // The callback settles callers through `publish` and never throws, but a stray
-            // rejection here would surface as an unhandled rejection rather than a failed run.
-            void task.catch(() => undefined);
-            const result = await outcome;
-            if (!result.ok)
-                throw result.error;
-            return result.value;
-        },
-        drain: () => queue.onIdle(),
-        async destroy() {
-            destroyed = true;
-            const outstanding = [...live];
-            for (const entry of outstanding) {
-                entry.cancelIfQueued(destroyedError(entry.taskName));
-                entry.teardown.abort(new DOMException("Async runner destroyed", "AbortError"));
-            }
-            // Waits on caller settlement rather than `queue.onIdle()`: work that ignores its signal
-            // must not be able to make teardown hang. Its slot is still held until it finishes.
-            await Promise.all(outstanding.map((entry) => entry.settled));
-        },
-    };
-}
-//# sourceMappingURL=async-runner.js.map

package/node_modules/@humwick/offload/dist/async-runner.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"async-runner.js","sourceRoot":"","sources":["../src/async-runner.ts"],"names":[],"mappings":"AAAA,OAAO,MAAM,MAAM,SAAS,CAAC;AAC7B,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,QAAQ,EAAmB,MAAM,eAAe,CAAC;AAC7F,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,cAAc,EAAE,eAAe,EAA8C,MAAM,YAAY,CAAC;AAyBtI,4FAA4F;AAC5F,MAAM,UAAU,iBAAiB,CAAC,OAA2B;IAC3D,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,OAAO,CAAC,WAAW,GAAG,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,wCAAwC,CAAC,CAAC;IAC1I,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;IAC/D,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,OAAO,CAAC,mBAAmB,EAAE,OAAO,CAAC,wBAAwB,CAAC,CAAC;IACjG,MAAM,IAAI,GAAG,IAAI,GAAG,EAAW,CAAC;IAChC,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,MAAM,YAAY,GAAG,CAAC,QAAgB,EAAE,KAAe,EAAgB,EAAE,CACvE,IAAI,YAAY,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,QAAQ,cAAc,EAAE,KAAK,EAAE,CAAC,CAAC;IAC7F,MAAM,cAAc,GAAG,CAAC,QAAgB,EAAgB,EAAE,CACxD,IAAI,YAAY,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,QAAQ,wCAAwC,EAAE,CAAC,CAAC;IAEhH,OAAO;QACL,IAAI,KAAK,KAAK,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACrE,KAAK,CAAC,GAAG,CAAI,QAAgB,EAAE,EAA2C,EAAE,GAAqB;YAC/F,MAAM,MAAM,GAAG,GAAG,EAAE,MAAM,IAAI,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,GAAG,EAAE,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC;YAC7C,MAAM,IAAI,GAAG,GAAG,EAAE,UAAU,IAAI,OAAO,CAAC,UAAU,CAAC;YACnD,MAAM,eAAe,GAAG,KAAK,EAAE,KAAmB,EAAkB,EAAE;gBACpE,sFAAsF;gBACtF,qDAAqD;gBACrD,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,CAAC,GAAG,EAAE,EAAE,KAAK,CAAC,CAAC;gBACvE,MAAM,YAAY,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;gBACzF,MAAM,KAAK,CAAC;YACd,CAAC,CAAC;YACF,IAAI,SAAS;gBAAE,OAAO,eAAe,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC;YAChE,IAAI,GAAG,EAAE,MAAM,EAAE,OAAO;gBAAE,OAAO,eAAe,CAAC,YAAY,CAAC,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5F,oFAAoF;YACpF,4EAA4E;YAC5E,IAAI,CAAC;gBACH,eAAe,CAAC,GAAG,EAAE,SAAS,IAAI,OAAO,CAAC,gBAAgB,CAAC,CAAC;YAC9D,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,OAAO,eAAe,CAAC,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC;YACtE,CAAC;YAED,IAAI,OAAuC,CAAC;YAC5C,IAAI,SAAS,GAAG,KAAK,CAAC;YACtB,MAAM,OAAO,GAAG,IAAI,OAAO,CAAa,CAAC,OAAO,EAAE,EAAE;gBAClD,OAAO,GAAG,CAAC,KAAK,EAAE,EAAE,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;oBAAC,SAAS,GAAG,IAAI,CAAC;oBAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAAC,CAAC,CAAC,CAAC,CAAC;YACjF,CAAC,CAAC,CAAC;YACH,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,IAAI,SAAS,GAAG,KAAK,CAAC;YACtB,MAAM,KAAK,GAAY;gBACrB,QAAQ;gBACR,QAAQ,EAAE,IAAI,eAAe,EAAE;gBAC/B,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC;gBACtC,cAAc,EAAE,CAAC,KAAK,EAAE,EAAE;oBACxB,IAAI,OAAO,IAAI,SAAS;wBAAE,OAAO;oBACjC,SAAS,GAAG,IAAI,CAAC;oBACjB,iFAAiF;oBACjF,kFAAkF;oBAClF,gFAAgF;oBAChF,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,CAAC,GAAG,EAAE,EAAE,KAAK,CAAC,CAAC;oBACvE,OAAO,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;gBAChC,CAAC;aACF,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAEhB,oFAAoF;YACpF,mFAAmF;YACnF,6CAA6C;YAC7C,MAAM,MAAM,GAAG,GAAG,EAAE,MAAM,CAAC;YAC3B,MAAM,aAAa,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7G,IAAI,MAAM,IAAI,aAAa;gBAAE,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,aAAa,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;YAE7F,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE;gBAChC,IAAI,MAAM,IAAI,aAAa;oBAAE,MAAM,CAAC,mBAAmB,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;gBAChF,IAAI,IAA4B,CAAC;gBACjC,IAAI,OAA+B,CAAC;gBACpC,IAAI,OAAiC,CAAC;gBACtC,IAAI,CAAC;oBACH,IAAI,SAAS;wBAAE,OAAO;oBACtB,IAAI,SAAS,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;wBAC/C,MAAM,KAAK,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;wBACvC,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,CAAC,GAAG,EAAE,EAAE,KAAK,CAAC,CAAC;wBACvE,OAAO,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;wBAC9B,OAAO;oBACT,CAAC;oBACD,OAAO,GAAG,IAAI,CAAC;oBACf,gFAAgF;oBAChF,yDAAyD;oBACzD,OAAO,GAAG,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;oBAClE,MAAM,GAAG,GAAG,OAAO,CAAC;oBACpB,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;oBAC9D,IAAI,CAAC;wBACH,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO;4BAAE,MAAM,GAAG,CAAC,UAAU,EAAE,CAAC;wBAC/C,MAAM,KAAK,GAAG,IAAI,OAAO,CAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE;4BAC7C,OAAO,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC;4BACzC,GAAG,CAAC,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;wBAChE,CAAC,CAAC,CAAC;wBACH,IAAI,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;wBACpD,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;wBAChD,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;wBACxD,MAAM,YAAY,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;wBAClF,OAAO,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;oBAC/B,CAAC;oBAAC,OAAO,KAAK,EAAE,CAAC;wBACf,MAAM,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;wBAC3F,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;wBACpE,MAAM,YAAY,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;wBACrG,OAAO,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;oBAC5C,CAAC;4BAAS,CAAC;wBACT,kFAAkF;wBAClF,kFAAkF;wBAClF,IAAI,OAAO;4BAAE,GAAG,CAAC,MAAM,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;wBAC9D,GAAG,CAAC,OAAO,EAAE,CAAC;oBAChB,CAAC;gBACH,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,MAAM,UAAU,GAAG,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;oBAC/D,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,CAAC,GAAG,EAAE,EAAE,UAAU,CAAC,CAAC;oBAC5E,MAAM,YAAY,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;oBACrG,OAAO,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;gBAC5C,CAAC;wBAAS,CAAC;oBACT,OAAO,EAAE,OAAO,EAAE,CAAC;oBACnB,kFAAkF;oBAClF,mFAAmF;oBACnF,2EAA2E;oBAC3E,IAAI,IAAI;wBAAE,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;oBAC5C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC,CAAC,CAAC;YACH,+EAA+E;YAC/E,mFAAmF;YACnF,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;YAEjC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC;YAC7B,IAAI,CAAC,MAAM,CAAC,EAAE;gBAAE,MAAM,MAAM,CAAC,KAAK,CAAC;YACnC,OAAO,MAAM,CAAC,KAAK,CAAC;QACtB,CAAC;QACD,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE;QAC3B,KAAK,CAAC,OAAO;YACX,SAAS,GAAG,IAAI,CAAC;YACjB,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;YAC9B,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;gBAChC,KAAK,CAAC,cAAc,CAAC,cAAc,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACrD,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,YAAY,CAAC,wBAAwB,EAAE,YAAY,CAAC,CAAC,CAAC;YACjF,CAAC;YACD,wFAAwF;YACxF,oFAAoF;YACpF,MAAM,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAC/D,CAAC;KACF,CAAC;AACJ,CAAC"}

package/node_modules/@humwick/offload/dist/envelope.d.ts

@@ -1,25 +0,0 @@
-import { OffloadError, type OffloadDefaults, type OffloadEnvelope, type OffloadLogger, type EscalationEvent, type EscalationSink, type StrikeCounter } from "./types.js";
-export interface RunContext {
-    signal: AbortSignal;
-    timeoutMs?: number;
-    cleanup(): void;
-    abortError(): OffloadError;
-}
-/**
- * `teardown` is the backend's own cancellation channel (runner `destroy()`); it is composed
- * with the caller's signal and the deadline so every backend has exactly one signal to observe.
- */
-export declare function beginRun(taskName: string, env: OffloadEnvelope | undefined, defaults: OffloadDefaults, teardown?: AbortSignal, timeoutMsOverride?: number | null): RunContext;
-export declare function startLog(logger: OffloadLogger | undefined, backend: EscalationEvent["backend"], taskName: string, labels: Record<string, string>): number;
-export declare function finishLog(logger: OffloadLogger | undefined, backend: EscalationEvent["backend"], taskName: string, labels: Record<string, string>, startedAt: number, error?: OffloadError): void;
-export declare function recordResult(options: {
-    counter: StrikeCounter;
-    taskName: string;
-    backend: EscalationEvent["backend"];
-    labels: Record<string, string>;
-    error?: OffloadError;
-    sink?: EscalationSink;
-    logger?: OffloadLogger;
-}): Promise<void>;
-export declare function errorForExit(taskName: string, code?: string): OffloadError;
-//# sourceMappingURL=envelope.d.ts.map

package/node_modules/@humwick/offload/dist/envelope.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"envelope.d.ts","sourceRoot":"","sources":["../src/envelope.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,KAAK,eAAe,EAAE,KAAK,eAAe,EAAE,KAAK,aAAa,EAAE,KAAK,eAAe,EAAE,KAAK,cAAc,EAAE,KAAK,aAAa,EAAwB,MAAM,YAAY,CAAC;AAE/L,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,WAAW,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,IAAI,IAAI,CAAC;IAChB,UAAU,IAAI,YAAY,CAAC;CAC5B;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,eAAe,GAAG,SAAS,EAAE,QAAQ,EAAE,eAAe,EAAE,QAAQ,CAAC,EAAE,WAAW,EAAE,iBAAiB,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,UAAU,CA8B7K;AAKD,wBAAgB,QAAQ,CAAC,MAAM,EAAE,aAAa,GAAG,SAAS,EAAE,OAAO,EAAE,eAAe,CAAC,SAAS,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAIzJ;AAED,wBAAgB,SAAS,CAAC,MAAM,EAAE,aAAa,GAAG,SAAS,EAAE,OAAO,EAAE,eAAe,CAAC,SAAS,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,YAAY,GAAG,IAAI,CAIjM;AAED,wBAAsB,YAAY,CAAC,OAAO,EAAE;IAC1C,OAAO,EAAE,aAAa,CAAC;IACvB,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,eAAe,CAAC,SAAS,CAAC,CAAC;IACpC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,KAAK,CAAC,EAAE,YAAY,CAAC;IACrB,IAAI,CAAC,EAAE,cAAc,CAAC;IACtB,MAAM,CAAC,EAAE,aAAa,CAAC;CACxB,GAAG,OAAO,CAAC,IAAI,CAAC,CAmBhB;AAED,wBAAgB,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,YAAY,CAE1E"}