@nimbus-sh/fabric 0.1.0 → 0.2.0

package/src/outbox.ts

@@ -0,0 +1,520 @@
+/**
+ * outbox.ts — a durable retry outbox over a Durable Object's own SQLite.
+ *
+ * Proteus built this discipline twice by hand and says so: its email outbox
+ * (`cf-backend/src/email/outbox.ts:7` — "The discipline mirrors the peer
+ * outbox", 8 attempts from a 30s base) and its peer transport
+ * (`core/src/events/ingress/peer.ts` — 8 attempts from a 5s base, per-receiver
+ * ordering, an ask/reply waiter over the same rows). Both carry the same
+ * mechanism: a write-ahead intent row in `state='pending'`, an
+ * `attempt_count`, a `next_attempt_at` with a partial index over pending rows,
+ * backoff `next = now + base * 2**(attempts-1)`, and a `nextRetryAt()` folded
+ * into the object's single alarm. This module is that mechanism once.
+ *
+ * What the consumers proved and this keeps:
+ *   - WRITE-AHEAD. The row commits before send runs. On a Durable Object the
+ *     output gate orders it: an outbound message cannot leave before the
+ *     writes of its turn are durable, so no explicit sync is needed here.
+ *   - DISPOSITION, not a boolean. peer.ts:476-526 separates three failures: a
+ *     RESOLVED refusal is permanent (dlq now), a THROWN send is transport
+ *     trouble (backoff), a malformed row is poison (dlq now, no send). A
+ *     boolean cannot carry that, and retrying a refusal re-offends.
+ *   - ORDERING per key. Rows drain in id order. A transient failure blocks
+ *     later rows with the same order key until the head clears (peer.ts:465
+ *     head-of-line set); a dead-lettered head does not block, and keyless rows
+ *     never block each other (the email outbox has no ordering at all).
+ *   - IDEMPOTENCY. A dedupe key already queued or sent is refused with the
+ *     existing id, and a sent key never reaches send again.
+ *
+ * What the consumers lacked and this adds:
+ *   - The drain registers with `timers` (one reason in the shared map) instead
+ *     of owning an alarm, and the dispatch-side handler re-arms through its
+ *     RETURN value — calling schedule() from inside the dispatcher's chain
+ *     would deadlock on the chain that serializes the reason map. A host
+ *     whose alarm belongs to another framework (the Agents SDK, agent-core's
+ *     reconciler) uses the scheduler-seam form instead: fabric hands every
+ *     next due time to the policy's `schedule` and touches no timer storage.
+ *   - The drain is turn-bounded through a {@link TurnBudget}: both consumer
+ *     drains iterate every due row in one turn, which is the same
+ *     thread-holding shape the pacer exists to end.
+ *
+ * ADOPTION IS A DATA MIGRATION for a live consumer. The rows live in
+ * fabric's own table (`outbox_<name>`), and nothing moves itself: a consumer
+ * with pending intents or a sent-key dedupe history in its old table keeps
+ * them there. The ported EmailOutbox went from `email_outbox` to
+ * `outbox_email` — deployed live without a migration, its pending mail would
+ * never send and every sent key would deliver a second time.
+ */
+
+import { z } from 'zod/v4';
+import { timers, type TimerContext, type TimerHandlerResult, type TimerHost, type TimerStorage } from './timers.js';
+import type { TurnBudget } from './turn-budget.js';
+
+/** Synchronous DO SQLite, as the outbox uses it. `exec` returns row objects. */
+export interface OutboxSqlExec {
+  exec(query: string, ...bindings: Array<string | number | null>): Iterable<unknown>;
+}
+
+/** The hosting actor's storage: its SQLite plus the shared timer map's keys. */
+export interface OutboxStorage extends TimerStorage {
+  sql: OutboxSqlExec;
+}
+
+export interface OutboxContext extends TimerContext {
+  storage: OutboxStorage;
+}
+
+/**
+ * All a scheduler-seam outbox needs from its host: the SQLite the rows live
+ * in. The timer map's keys belong to the {@link TimerHost} path only.
+ */
+export interface OutboxSqlContext {
+  storage: { sql: OutboxSqlExec };
+}
+
+/**
+ * What one send attempt concluded. A resolved `retry` and a thrown send are
+ * the same transient class; `poison` is the resolved refusal that must never
+ * be retried — the split the peer transport proved necessary.
+ */
+export type OutboxDisposition =
+  | { status: 'sent' }
+  | { status: 'retry'; reason: string }
+  | { status: 'poison'; reason: string };
+
+export interface OutboxPolicy<M, C = void> {
+  /** Attempts before a row dead-letters. Email uses 8; peer uses 8. */
+  maxAttempts: number;
+  /** Backoff base: `next = now + baseMs * 2**(attempts-1)`. */
+  baseMs: number;
+  /**
+   * Per-key delivery order (the peer transport's per-receiver key). Rows
+   * without a key deliver independently, as the email outbox's do.
+   */
+  orderBy?(message: M): string;
+  /**
+   * Deliver one message. Throwing is transient, same as `retry`. `context`
+   * is the caller's per-drain state — Proteus's email outbox resolves its
+   * transport binding per call, and a policy closed at construction cannot
+   * hold it (the ported consumer smuggled it through an instance field).
+   */
+  send(message: M, info: { id: string; attempt: number }, context: C): Promise<OutboxDisposition>;
+}
+
+/**
+ * `context` carries the caller's per-drain state into `send`. Required when
+ * the policy declares one; absent (and unpayable) when it does not.
+ */
+export type OutboxDrainOptions<C> = { budget?: TurnBudget } & ([C] extends [void]
+  ? { context?: C }
+  : { context: C });
+
+type OutboxDrainArgs<C> = [C] extends [void]
+  ? [opts?: OutboxDrainOptions<C>]
+  : [opts: OutboxDrainOptions<C>];
+
+type OutboxHandlerArgs<C> = [C] extends [void] ? [] : [context: C];
+
+/**
+ * The policy of an outbox whose host owns the alarm. Proteus's Durable
+ * Object alarm belongs to the Agents SDK and agent-core's to its own
+ * reconciler; neither can give fabric the alarm slot. `schedule` receives
+ * every next due time — queue's admission instant, and the earliest pending
+ * deadline after each drain — and the consumer folds it into its own alarm.
+ */
+export interface ScheduledOutboxPolicy<M, C = void> extends OutboxPolicy<M, C> {
+  schedule(at: number): Promise<void>;
+}
+
+type OutboxScheduling =
+  | { kind: 'timers'; host: TimerHost; ctx: OutboxContext }
+  | { kind: 'schedule'; schedule: (at: number) => Promise<void> };
+
+export interface OutboxDrainResult {
+  sent: number;
+  retried: number;
+  deadLettered: number;
+}
+
+/**
+ * One row, as {@link Outbox.status} and {@link Outbox.find} report it. Both
+ * ported consumers read fabric's table with raw SQL for exactly this: the
+ * email outbox to answer sent/deduped/failed per key, the peer transport to
+ * correlate a reply with its stored ask — which is why the record carries
+ * the stored message, not just the state.
+ */
+export interface OutboxRecord<M> {
+  id: string;
+  state: 'pending' | 'sent' | 'dlq';
+  /** Null when the stored payload no longer parses (a poison-parse row). */
+  message: M | null;
+  dedupeKey: string | null;
+  attemptCount: number;
+  lastError: string | null;
+}
+
+export interface OutboxDeadLetter<M> {
+  id: string;
+  /** Null when the stored payload no longer parses (a poison-parse row). */
+  message: M | null;
+  dedupeKey: string | null;
+  attemptCount: number;
+  lastError: string;
+}
+
+const PendingRowSchema = z.object({
+  id: z.string(),
+  message: z.string(),
+  order_key: z.string().nullable(),
+  attempt_count: z.number(),
+  next_attempt_at: z.number(),
+});
+
+const DlqRowSchema = z.object({
+  id: z.string(),
+  message: z.string(),
+  dedupe_key: z.string().nullable(),
+  attempt_count: z.number(),
+  last_error: z.string().nullable(),
+});
+
+const RecordRowSchema = z.object({
+  id: z.string(),
+  state: z.enum(['pending', 'sent', 'dlq']),
+  message: z.string(),
+  dedupe_key: z.string().nullable(),
+  attempt_count: z.number(),
+  last_error: z.string().nullable(),
+});
+
+const NAME_PATTERN = /^[a-z][a-z0-9_]{0,40}$/;
+
+/** One named outbox on one hosting actor. Cheap accessor, like `timers()`. */
+export function outbox<M, C = void>(
+  host: TimerHost,
+  ctx: OutboxContext,
+  name: string,
+  policy: OutboxPolicy<M, C>,
+): Outbox<M, C>;
+/** The scheduler-seam form: the host owns the alarm, fabric owns the rows. */
+export function outbox<M, C = void>(
+  ctx: OutboxSqlContext,
+  name: string,
+  policy: ScheduledOutboxPolicy<M, C>,
+): Outbox<M, C>;
+export function outbox<M, C = void>(
+  ...args:
+    | [host: TimerHost, ctx: OutboxContext, name: string, policy: OutboxPolicy<M, C>]
+    | [ctx: OutboxSqlContext, name: string, policy: ScheduledOutboxPolicy<M, C>]
+): Outbox<M, C> {
+  if (args.length === 4) {
+    const [host, ctx, name, policy] = args;
+    return new Outbox(ctx, name, policy, { kind: 'timers', host, ctx });
+  }
+  const [ctx, name, policy] = args;
+  return new Outbox(ctx, name, policy, { kind: 'schedule', schedule: (at) => policy.schedule(at) });
+}
+
+export class Outbox<M, C = void> {
+  /** The timer reason this outbox arms in the shared map. */
+  readonly reason: string;
+
+  private readonly table: string;
+  private schemaReady = false;
+  private draining = false;
+  /** Largest id ever seen, so a replacement instance mints above it. */
+  private lastId = '';
+  private seq = 0;
+
+  constructor(
+    private readonly ctx: OutboxSqlContext,
+    name: string,
+    private readonly policy: OutboxPolicy<M, C>,
+    private readonly scheduling: OutboxScheduling,
+  ) {
+    if (!NAME_PATTERN.test(name)) {
+      throw new Error(`fabric: outbox name '${name}' must match ${NAME_PATTERN}`);
+    }
+    this.table = `outbox_${name}`;
+    this.reason = `outbox:${name}`;
+  }
+
+  private ensureSchema(): void {
+    if (this.schemaReady) return;
+    const sql = this.ctx.storage.sql;
+    sql.exec(`CREATE TABLE IF NOT EXISTS ${this.table} (
+      id              TEXT    PRIMARY KEY,
+      dedupe_key      TEXT,
+      order_key       TEXT,
+      message         TEXT    NOT NULL,
+      state           TEXT    NOT NULL DEFAULT 'pending'
+                              CHECK (state IN ('pending', 'sent', 'dlq')),
+      attempt_count   INTEGER NOT NULL DEFAULT 0,
+      next_attempt_at INTEGER NOT NULL,
+      created_at      INTEGER NOT NULL,
+      sent_at         INTEGER,
+      last_error      TEXT
+    )`);
+    sql.exec(`CREATE UNIQUE INDEX IF NOT EXISTS idx_${this.table}_dedupe
+      ON ${this.table} (dedupe_key) WHERE dedupe_key IS NOT NULL`);
+    // The recovery read (`nextRetryAt`, the drain) must not table-scan sent
+    // history, which only grows — the same reason both consumer schemas carry
+    // exactly this partial index.
+    sql.exec(`CREATE INDEX IF NOT EXISTS idx_${this.table}_pending
+      ON ${this.table} (next_attempt_at) WHERE state = 'pending'`);
+    const rows = [...sql.exec(`SELECT MAX(id) AS id FROM ${this.table}`)] as Array<{ id: string | null }>;
+    this.lastId = rows[0]?.id ?? '';
+    this.schemaReady = true;
+  }
+
+  /**
+   * Ids order the drain, so they must grow: time-prefixed, tie-broken by a
+   * per-instance counter, and forced above the largest stored id so a
+   * replacement instance with a lagging clock cannot mint into the past.
+   */
+  private mintId(now: number): string {
+    let id = `${now.toString(36).padStart(9, '0')}-${(this.seq++).toString(36).padStart(6, '0')}`;
+    if (this.lastId !== '' && id <= this.lastId) id = `${this.lastId}0`;
+    this.lastId = id;
+    return id;
+  }
+
+  /**
+   * Write the intent ahead of any send. Returns `admitted: false` with the
+   * existing id when the dedupe key is already queued, sent, or dead-lettered
+   * — a sent key never reaches send again (the email outbox's short-circuit).
+   *
+   * `onDuplicate: 'retry-now'` treats a re-ask for an UNSENT key as new
+   * intent: the row's retry instant is clamped to `now` and a dead letter
+   * returns to 'pending', its attempt count kept — so every re-ask buys one
+   * more delivery attempt, past the attempt budget. The monitor's alert-once
+   * contract needs exactly this: a failed alert is retried by each sweep
+   * until it lands. A sent key stays final either way.
+   *
+   * Arms the scheduler at `now`, so delivery is owed by the alarm even
+   * when the caller never drains inline.
+   */
+  async queue(
+    message: M,
+    opts: { dedupeKey?: string; now?: number; onDuplicate?: 'refuse' | 'retry-now' } = {},
+  ): Promise<{ id: string; admitted: boolean }> {
+    this.ensureSchema();
+    const now = opts.now ?? Date.now();
+    const sql = this.ctx.storage.sql;
+    if (opts.dedupeKey !== undefined) {
+      const existing = [...sql.exec(
+        `SELECT id, state FROM ${this.table} WHERE dedupe_key = ?`, opts.dedupeKey,
+      )] as Array<{ id: string; state: string }>;
+      if (existing.length > 0) {
+        if (opts.onDuplicate === 'retry-now' && existing[0].state !== 'sent') {
+          sql.exec(
+            `UPDATE ${this.table} SET state = 'pending', next_attempt_at = ? WHERE id = ?`,
+            now, existing[0].id,
+          );
+          await this.arm(now);
+        }
+        return { id: existing[0].id, admitted: false };
+      }
+    }
+    const id = this.mintId(now);
+    sql.exec(
+      `INSERT INTO ${this.table} (id, dedupe_key, order_key, message, next_attempt_at, created_at)
+       VALUES (?, ?, ?, ?, ?, ?)`,
+      id,
+      opts.dedupeKey ?? null,
+      this.policy.orderBy?.(message) ?? null,
+      JSON.stringify(message),
+      now,
+      now,
+    );
+    await this.arm(now);
+    return { id, admitted: true };
+  }
+
+  /** Hand a due time to whichever scheduler this outbox was built on. */
+  private async arm(at: number): Promise<void> {
+    if (this.scheduling.kind === 'timers') {
+      await timers(this.scheduling.host, this.scheduling.ctx).schedule(this.reason, at);
+    } else {
+      await this.scheduling.schedule(at);
+    }
+  }
+
+  /** The single-alarm fold: the earliest pending deadline, or null. */
+  nextRetryAt(): number | null {
+    this.ensureSchema();
+    const rows = [...this.ctx.storage.sql.exec(
+      `SELECT MIN(next_attempt_at) AS next FROM ${this.table} WHERE state = 'pending'`,
+    )] as Array<{ next: number | null }>;
+    return rows[0]?.next ?? null;
+  }
+
+  /** The row queue() named, by its id. Null when no such row exists. */
+  status(id: string): OutboxRecord<M> | null {
+    return this.record('id', id);
+  }
+
+  /** The row a dedupe key admitted, whatever its state. Null when none. */
+  find(dedupeKey: string): OutboxRecord<M> | null {
+    return this.record('dedupe_key', dedupeKey);
+  }
+
+  private record(column: 'id' | 'dedupe_key', value: string): OutboxRecord<M> | null {
+    this.ensureSchema();
+    const rows = [...this.ctx.storage.sql.exec(
+      `SELECT id, state, message, dedupe_key, attempt_count, last_error
+       FROM ${this.table} WHERE ${column} = ?`, value,
+    )];
+    if (rows.length === 0) return null;
+    const row = RecordRowSchema.parse(rows[0]);
+    let message: M | null = null;
+    try { message = JSON.parse(row.message) as M; } catch { /* poison-parse row */ }
+    return {
+      id: row.id,
+      state: row.state,
+      message,
+      dedupeKey: row.dedupe_key,
+      attemptCount: row.attempt_count,
+      lastError: row.last_error,
+    };
+  }
+
+  /** Dead-lettered rows, for inspection. Terminal: nothing retries out. */
+  dlq(): Array<OutboxDeadLetter<M>> {
+    this.ensureSchema();
+    const rows = [...this.ctx.storage.sql.exec(
+      `SELECT id, message, dedupe_key, attempt_count, last_error FROM ${this.table} WHERE state = 'dlq' ORDER BY id`,
+    )].map((row) => DlqRowSchema.parse(row));
+    return rows.map((row) => {
+      let message: M | null = null;
+      try { message = JSON.parse(row.message) as M; } catch { /* poison-parse row */ }
+      return {
+        id: row.id,
+        message,
+        dedupeKey: row.dedupe_key,
+        attemptCount: row.attempt_count,
+        lastError: row.last_error ?? '',
+      };
+    });
+  }
+
+  /**
+   * Deliver every due pending row, in id order, honouring per-key blocking.
+   * Reentrancy-guarded: the alarm and an inline post-queue drain overlap on
+   * the same activation (peer.ts:452 carries the same guard).
+   *
+   * `budget` bounds the turn: the drain spends each processed row's payload
+   * size and suspends when a chunk is full, so a large backlog crosses turns
+   * instead of holding the actor's only thread.
+   *
+   * `context` is handed to every `send` this drain makes — the seam for
+   * per-call state such as a transport binding resolved by the caller.
+   */
+  async drain(now = Date.now(), ...rest: OutboxDrainArgs<C>): Promise<OutboxDrainResult> {
+    const opts = rest[0] ?? {};
+    const result: OutboxDrainResult = { sent: 0, retried: 0, deadLettered: 0 };
+    if (this.draining) return result;
+    this.draining = true;
+    try {
+      this.ensureSchema();
+      const sql = this.ctx.storage.sql;
+      const rows = [...sql.exec(
+        `SELECT id, message, order_key, attempt_count, next_attempt_at
+         FROM ${this.table} WHERE state = 'pending' ORDER BY id`,
+      )].map((row) => PendingRowSchema.parse(row));
+      const blocked = new Set<string>();
+      for (const row of rows) {
+        if (row.order_key !== null && blocked.has(row.order_key)) continue;
+        if (row.next_attempt_at > now) {
+          // A backed-off head still blocks the rows queued behind it.
+          if (row.order_key !== null) blocked.add(row.order_key);
+          continue;
+        }
+        let message: M;
+        try {
+          message = JSON.parse(row.message) as M;
+        } catch (e) {
+          // Unparseable is poison: it can never succeed, so it never blocks.
+          this.deadLetter(row.id, row.attempt_count, `outbox row does not parse: ${errorText(e)}`);
+          result.deadLettered++;
+          continue;
+        }
+        const attempt = row.attempt_count + 1;
+        let disposition: OutboxDisposition;
+        try {
+          disposition = await this.policy.send(message, { id: row.id, attempt }, opts.context as C);
+        } catch (e) {
+          disposition = { status: 'retry', reason: errorText(e) };
+        }
+        if (disposition.status === 'sent') {
+          sql.exec(
+            `UPDATE ${this.table} SET state = 'sent', attempt_count = ?, sent_at = ?, last_error = NULL WHERE id = ?`,
+            attempt, now, row.id,
+          );
+          result.sent++;
+        } else if (disposition.status === 'poison') {
+          this.deadLetter(row.id, attempt, disposition.reason);
+          result.deadLettered++;
+        } else if (attempt >= this.policy.maxAttempts) {
+          this.deadLetter(row.id, attempt, `undeliverable after ${attempt} attempts: ${disposition.reason}`);
+          result.deadLettered++;
+        } else {
+          const next = now + this.policy.baseMs * 2 ** (attempt - 1);
+          sql.exec(
+            `UPDATE ${this.table} SET attempt_count = ?, next_attempt_at = ?, last_error = ? WHERE id = ?`,
+            attempt, next, disposition.reason, row.id,
+          );
+          result.retried++;
+          if (row.order_key !== null) blocked.add(row.order_key);
+        }
+        // Code-unit length: equal to UTF-8 bytes for the ASCII JSON the rows
+        // hold, an undercount otherwise — the bound names where a turn ends,
+        // it is not an admission ceiling (same reading as budgets.ts).
+        await opts.budget?.spend(row.message.length);
+      }
+      // A seam-scheduled outbox re-arms itself: there is no dispatcher whose
+      // return value could, and the ported consumer re-armed by hand after
+      // every drain — delivery stays owed either way.
+      if (this.scheduling.kind === 'schedule') {
+        const next = this.nextRetryAt();
+        if (next !== null) await this.scheduling.schedule(next);
+      }
+      return result;
+    } finally {
+      this.draining = false;
+    }
+  }
+
+  private deadLetter(id: string, attempts: number, error: string): void {
+    this.ctx.storage.sql.exec(
+      `UPDATE ${this.table} SET state = 'dlq', attempt_count = ?, last_error = ? WHERE id = ?`,
+      attempts, error, id,
+    );
+  }
+
+  /**
+   * The dispatch-side entry for the embedder's timer handler map. Re-arms
+   * through the RETURN value: the dispatcher runs handlers inside the chain
+   * that serializes the reason map, so a schedule() call from here would
+   * deadlock on its own chain.
+   *
+   * An alarm fires with no caller, so a policy that declares a drain context
+   * receives it here once, closed over every alarm-driven drain.
+   */
+  handler(...context: OutboxHandlerArgs<C>): (now: number) => Promise<TimerHandlerResult> {
+    if (this.scheduling.kind === 'schedule') {
+      throw new Error(
+        `fabric: outbox '${this.reason}' uses a scheduler seam — there is no timer dispatcher to hand this handler to`,
+      );
+    }
+    return async (now: number) => {
+      await this.drain(now, ...([{ context: context[0] }] as OutboxDrainArgs<C>));
+      const next = this.nextRetryAt();
+      return next === null ? undefined : { rearmAt: next };
+    };
+  }
+}
+
+function errorText(error: unknown): string {
+  return error instanceof Error ? error.message : String(error);
+}

package/src/process-fabric.ts

@@ -5,7 +5,7 @@
  * Every long-lived process Nimbus runs — node servers, python/ruby socket
  * servers, an agent TUI and its headless server — runs as a **DO Facet**:
  * a named child actor whose class comes from a dynamic worker, opened by
- * `openResidentFacet` in `workerd-facet-host.ts`.
+ * `processes(ctx, env).spawn` in `workerd-facet-host.ts`.
  *
  *   ctx.facets.get(`proc-${pid}`, () => ({
  *     class: env.LOADER.get(workerKey, buildConfig)
@@ -156,37 +156,10 @@ export type ResidentBootSpec =
   | { kind: 'code'; code: ResidentCodeSpec };
 
 // ── Staged boots ────────────────────────────────────────────────────────────
-
-/**
- * Assemble a complete Worker Loader config from a staged-artifact spec. The
- * embedder supplies this: a stage names artifact sources only the embedder
- * knows how to fetch (Nimbus's largest staged artifact is a ~23 MB module map from
- * ASSETS), and the assembler runs inside the loader's cache-miss callback so
- * those sources are materialized only while the facet actually loads.
- * `env` is whichever hosting actor's env the facet is opened with.
- */
-export type StagedBootAssembler = (
-  env: unknown,
-  stage: unknown,
-) => Promise<object>;
-
-let _stagedBootAssembler: StagedBootAssembler | null = null;
-
-/** Registered once at composition time, first-write-wins. */
-export function setStagedBootAssembler(assembler: StagedBootAssembler): void {
-  if (_stagedBootAssembler) return;
-  _stagedBootAssembler = assembler;
-}
-
-export function requireStagedBootAssembler(): StagedBootAssembler {
-  if (!_stagedBootAssembler) {
-    throw new Error(
-      'fabric: no staged-boot assembler registered; a \'staged\' boot spec '
-        + 'cannot be assembled without one (setStagedBootAssembler)',
-    );
-  }
-  return _stagedBootAssembler;
-}
+//
+// A 'staged' boot spec assembles through the embedder's composed
+// StagedBootAssembler — see composition.ts. What a stage IS belongs to
+// whoever composed the assembler.
 
 // ── Boot-image store ────────────────────────────────────────────────────────
 
@@ -425,7 +398,7 @@ export interface ProcessImageDelivery {
    * ends: the source exists and is populated before, the destination is
    * non-empty after. A blocklist of bad names would pass a typo straight
    * through and wipe a process's filesystem while returning ok. Enforced by
-   * `cloneFacetStorage` in the workerd host, which is the one way the fabric
+   * `cloneStorage` in the workerd host, which is the one way the fabric
    * calls clone.
    */
   readonly reflink: 'same-object' | 'impossible';

package/src/process-host.ts

@@ -9,7 +9,7 @@
  *   peer  — the process is a named child actor of a SIBLING session DO, and
  *           the coordinator reaches it over one held-open RPC.
  *
- * Both call the same `openResidentFacet`. The peer leg is not a second process
+ * Both call the same `processes(ctx, env).spawn`. The peer leg is not a second process
  * implementation; it is the same call made on a different actor, which is why
  * the runner, the boot spec, the class name, the writer handshake, the start
  * contract and the lifecycle are shared code rather than parallel paths.
@@ -64,9 +64,9 @@
  * that pair unforgeable by anything that did not open the process.
  */
 
-import { disposeRpcResource } from '@nimbus-sh/core/_shared/rpc-dispose.js';
-import { isTransientDoReset } from '@nimbus-sh/core/observability/oom-classify.js';
-import { PEER_RETRY_BACKOFF_MS, PEER_TRANSIENT_RESET_RETRIES } from './fanout-pool.js';
+import { disposeRpcResource } from '@nimbus-sh/platform/rpc-dispose.js';
+import { isTransientDoReset } from '@nimbus-sh/platform/oom-classify.js';
+import { PEER_RETRY_BACKOFF_MS, PEER_TRANSIENT_RESET_RETRIES } from './fanout.js';
 import {
   type HostedProcess,
   type OneShotParams,
@@ -77,11 +77,10 @@ import {
   type ResidentDiskReader,
   type ResidentSupervisorProps,
 } from './process-fabric.js';
+import { DYNAMIC_WORKER_CODE_LIMIT_BYTES } from './budgets.js';
 import {
-  DYNAMIC_WORKER_CODE_LIMIT_BYTES,
-  openResidentFacet,
+  processes,
   residentFacetName,
-  runOneShotWorker,
   type ResidentFacetEnv,
 } from './workerd-facet-host.js';
 import { BindingError } from './vendor/errors.js';
@@ -136,9 +135,7 @@ class FacetProcessHost implements ProcessHost {
   }
 
   runOnce<T>(params: OneShotParams, consume: (response: Response) => Promise<T>): Promise<T> {
-    return runOneShotWorker(
-      this.ctx,
-      this.env,
+    return processes(this.ctx, this.env).run(
       { doId: this.coordDoId, pid: params.pid, writerId: params.writerId },
       params,
       consume,
@@ -151,7 +148,7 @@ class FacetProcessHost implements ProcessHost {
       pid: params.pid,
       writerId: params.writerId,
     };
-    const { slot, ...facet } = openResidentFacet(this.ctx, this.env, this.disk, supervisor, params);
+    const { slot, ...facet } = processes(this.ctx, this.env).spawn(this.disk, supervisor, params);
     return {
       ...facet,
       describe: () =>
@@ -337,9 +334,7 @@ class PeerProcessHost implements ProcessHost {
    * worker of the coordinator here exactly as it does on `facet`.
    */
   runOnce<T>(params: OneShotParams, consume: (response: Response) => Promise<T>): Promise<T> {
-    return runOneShotWorker(
-      this.ctx,
-      this.env,
+    return processes(this.ctx, this.env).run(
       { doId: this.coordDoId, pid: params.pid, writerId: params.writerId },
       params,
       consume,
@@ -386,7 +381,7 @@ class PeerProcessHost implements ProcessHost {
     } catch (error) {
       this.tokensInUse.delete(params.pid);
       // Awaited, not fired off: a spawn that rejects must mean nothing was
-      // left running, which is what a throw from `openResidentFacet` means on
+      // left running, which is what a throw from `processes().spawn` means on
       // the other substrate.
       try { await this._cancel(params.workerKey, placement.peerName); }
       finally { disposeRpcResource(placement.stub); }