@open-cr-agent/runtime-opencode 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+

package/README.md

@@ -0,0 +1,3 @@
+# @open-cr-agent/runtime-opencode
+
+The agent runtime backed by [OpenCode](https://opencode.ai) of [Open-CR-Agent](https://github.com/jma49/Open-CR-Agent), the multi-agent code reviewer. Most users want [`@open-cr-agent/cli`](https://www.npmjs.com/package/@open-cr-agent/cli), which provides the `ocra` command and installs this package; see the [manual](https://ocra.majincheng.com). All `@open-cr-agent` packages are released together at one version. Apache-2.0.

package/dist/binary.d.ts

@@ -0,0 +1,10 @@
+import type { Env } from "@open-cr-agent/core";
+export interface Host {
+    platform: string;
+    arch: string;
+    musl: boolean;
+    baseline: boolean;
+}
+export declare function resolveOpencodeBinary(env: Env): string;
+export declare function binaryVariants(host: Host): string[];
+//# sourceMappingURL=binary.d.ts.map

package/dist/binary.js

@@ -0,0 +1,71 @@
+import { spawnSync } from "node:child_process";
+import { existsSync, readFileSync } from "node:fs";
+import { createRequire } from "node:module";
+import { dirname, join } from "node:path";
+const PLATFORMS = { darwin: "darwin", linux: "linux", win32: "windows" };
+// Resolved from opencode-ai's platform packages directly, because newer npm
+// versions block the postinstall script that would otherwise place it.
+export function resolveOpencodeBinary(env) {
+    const override = env.OCRA_OPENCODE_BIN;
+    if (override)
+        return override;
+    const platform = PLATFORMS[process.platform] ?? process.platform;
+    const executable = platform === "windows" ? "opencode.exe" : "opencode";
+    const fromOpencode = createRequire(createRequire(import.meta.url).resolve("opencode-ai/package.json"));
+    for (const variant of binaryVariants(currentHost(platform))) {
+        try {
+            const pkg = fromOpencode.resolve(`opencode-${platform}-${process.arch}${variant}/package.json`);
+            const binary = join(dirname(pkg), "bin", executable);
+            if (existsSync(binary))
+                return binary;
+        }
+        catch { }
+    }
+    throw new Error(`No OpenCode binary for ${platform}-${process.arch}; set OCRA_OPENCODE_BIN`);
+}
+// The builds to try, best first. npm installs every build whose os and cpu
+// match, and the glibc builds declare no libc, so musl Linux has both kinds;
+// the order follows opencode-ai's own install script.
+export function binaryVariants(host) {
+    const glibc = host.arch !== "x64" ? [""] : host.baseline ? ["-baseline", ""] : ["", "-baseline"];
+    if (host.platform !== "linux")
+        return glibc;
+    const musl = glibc.map((variant) => `${variant}-musl`);
+    return host.musl ? [...musl, ...glibc] : [...glibc, ...musl];
+}
+function currentHost(platform) {
+    const x64 = process.arch === "x64";
+    return {
+        platform,
+        arch: process.arch,
+        musl: platform === "linux" && isMusl(),
+        baseline: x64 && lacksAvx2(platform),
+    };
+}
+// Node's diagnostic report names the glibc it runs on; a musl build has none.
+function isMusl() {
+    try {
+        const report = process.report.getReport();
+        return !report.header?.glibcVersionRuntime;
+    }
+    catch {
+        return false;
+    }
+}
+// Unknown counts as AVX2 present: the default build is tried first, as before.
+function lacksAvx2(platform) {
+    try {
+        if (platform === "linux")
+            return !/\bavx2\b/.test(readFileSync("/proc/cpuinfo", "utf8"));
+        if (platform === "darwin") {
+            const sysctl = spawnSync("sysctl", ["-n", "hw.optional.avx2_0"], {
+                encoding: "utf8",
+                timeout: 1500,
+            });
+            return sysctl.status === 0 && sysctl.stdout.trim() === "0";
+        }
+    }
+    catch { }
+    return false;
+}
+//# sourceMappingURL=binary.js.map

package/dist/failback.d.ts

@@ -0,0 +1,14 @@
+import { type AgentEvent, type ModelTier } from "@open-cr-agent/core";
+import type { ModelHealth } from "./models.js";
+import type { SessionOutcome } from "./session-outcome.js";
+export interface FailbackOptions {
+    taskId: string;
+    tier: ModelTier;
+    chain: readonly string[];
+    health: ModelHealth;
+    signal: AbortSignal;
+    attempt(model: string): Promise<SessionOutcome>;
+}
+export declare function withFailback(options: FailbackOptions): AsyncGenerator<AgentEvent>;
+export declare function toolSummary(toolCalls: readonly string[]): string;
+//# sourceMappingURL=failback.d.ts.map

package/dist/failback.js

@@ -0,0 +1,81 @@
+import { REVIEW_TOOLS } from "@open-cr-agent/core";
+import { sleep } from "./quota.js";
+// Findings from a failed attempt are still emitted: the pipeline deduplicates
+// by fingerprint, so a retry on the next model cannot double-report them.
+export async function* withFailback(options) {
+    const { taskId, health, signal } = options;
+    let lastError = "";
+    for (const model of health.order(options.chain)) {
+        for (;;) {
+            if (signal.aborted)
+                return;
+            const pause = health.pausedFor(model);
+            if (pause > 0) {
+                yield {
+                    type: "progress",
+                    taskId,
+                    message: `${model} is rate limited; waiting ${Math.ceil(pause / 1000)}s`,
+                };
+                await sleep(pause, signal);
+                if (signal.aborted)
+                    return;
+            }
+            yield { type: "progress", taskId, message: `reviewing with ${model}` };
+            const outcome = await options.attempt(model);
+            yield { type: "usage", taskId, ...outcome.usage };
+            yield { type: "progress", taskId, message: attemptSummary(model, outcome) };
+            for (const finding of outcome.findings)
+                yield { type: "finding", taskId, finding };
+            if (!outcome.error) {
+                health.recordSuccess(model);
+                yield { type: "done", taskId };
+                return;
+            }
+            if (!outcome.error.retryable) {
+                yield {
+                    type: "error",
+                    taskId,
+                    error: `${model}: ${outcome.error.message}`,
+                    retryable: false,
+                };
+                return;
+            }
+            if (outcome.error.quota && health.recordQuota(model, outcome.error.quota) === "wait") {
+                continue;
+            }
+            if (!outcome.error.quota)
+                health.recordFailure(model);
+            lastError = `${model}: ${outcome.error.message}`;
+            yield { type: "progress", taskId, message: `${lastError}; trying the next model` };
+            break;
+        }
+    }
+    yield {
+        type: "error",
+        taskId,
+        error: lastError
+            ? `every ${options.tier} model failed (${lastError})`
+            : `every ${options.tier} model is out of quota for this run`,
+        retryable: true,
+    };
+}
+// Which tools an attempt spent its steps on, and whether it finished: a
+// review that never called task_done was cut off, usually by the step cap.
+function attemptSummary(model, outcome) {
+    const { inputTokens, outputTokens, reasoningTokens, costUsd } = outcome.usage;
+    const resumed = outcome.resumed ? ", resumed after stopping early" : "";
+    return `${model}: ${outcome.steps} step(s), ${toolSummary(outcome.toolCalls)}${resumed}, ${inputTokens} in / ${outputTokens} out / ${reasoningTokens} reasoning tokens, $${costUsd.toFixed(4)}`;
+}
+export function toolSummary(toolCalls) {
+    if (toolCalls.length === 0)
+        return "no tool calls";
+    // MCP tools carry the server's name as a prefix (MCP_SERVER in runtime.ts).
+    const names = toolCalls.map((t) => t.replace(/^ocra_/, ""));
+    const counts = new Map();
+    for (const name of names)
+        counts.set(name, (counts.get(name) ?? 0) + 1);
+    const byUse = [...counts].sort((a, b) => b[1] - a[1] || a[0].localeCompare(b[0]));
+    const finished = names.includes(REVIEW_TOOLS.taskDone) ? "" : "; no task_done";
+    return `${toolCalls.length} tool call(s) (${byUse.map(([n, c]) => `${n} ${c}`).join(", ")}${finished})`;
+}
+//# sourceMappingURL=failback.js.map

package/dist/index.d.ts

@@ -0,0 +1,4 @@
+export * from "./models.js";
+export * from "./plugin.js";
+export * from "./runtime.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.js

@@ -0,0 +1,4 @@
+export * from "./models.js";
+export * from "./plugin.js";
+export * from "./runtime.js";
+//# sourceMappingURL=index.js.map

package/dist/models.d.ts

@@ -0,0 +1,30 @@
+import { type QuotaError } from "./quota.js";
+export interface ModelRef {
+    providerID: string;
+    modelID: string;
+}
+export declare function parseModel(model: string): ModelRef;
+export interface CircuitOptions {
+    threshold?: number;
+    cooldownMs?: number;
+    maxCooldownMs?: number;
+    now?: () => number;
+}
+export declare class ModelHealth {
+    private readonly circuits;
+    private readonly quotas;
+    private readonly outOfQuota;
+    private readonly threshold;
+    private readonly cooldownMs;
+    private readonly maxCooldownMs;
+    private readonly now;
+    constructor(options?: CircuitOptions);
+    order(chain: readonly string[]): string[];
+    state(model: string): "closed" | "open" | "half-open";
+    recordFailure(model: string): void;
+    recordSuccess(model: string): void;
+    pausedFor(model: string): number;
+    isOutOfQuota(model: string): boolean;
+    recordQuota(model: string, quota: QuotaError): "wait" | "out_of_quota";
+}
+//# sourceMappingURL=models.d.ts.map

package/dist/models.js

@@ -0,0 +1,88 @@
+import { MAX_QUOTA_WAIT_MS, QUOTA_RETRIES } from "./quota.js";
+export function parseModel(model) {
+    const slash = model.indexOf("/");
+    if (slash <= 0 || slash === model.length - 1) {
+        throw new Error(`Model "${model}" must be written as provider/model, for example google/gemini-flash-lite-latest`);
+    }
+    return { providerID: model.slice(0, slash), modelID: model.slice(slash + 1) };
+}
+// A circuit breaker per model: after `threshold` consecutive failures the
+// model is skipped (open) for a cooldown, then one attempt is let through
+// (half-open). Success closes the circuit; failure reopens it for twice as
+// long, up to a limit. Tasks go straight to the fallback instead of paying
+// for a model that is down.
+export class ModelHealth {
+    circuits = new Map();
+    quotas = new Map();
+    outOfQuota = new Set();
+    threshold;
+    cooldownMs;
+    maxCooldownMs;
+    now;
+    constructor(options = {}) {
+        this.threshold = options.threshold ?? 2;
+        this.cooldownMs = options.cooldownMs ?? 60_000;
+        this.maxCooldownMs = options.maxCooldownMs ?? 10 * 60_000;
+        this.now = options.now ?? Date.now;
+    }
+    // Models whose circuit is closed or half-open, in chain order. When every
+    // circuit is open, all models in the order they reopen: a review should
+    // still try rather than fail without a request.
+    // Models out of quota are left out entirely: another request would only be
+    // refused again.
+    order(chain) {
+        const now = this.now();
+        const usable = chain.filter((m) => !this.outOfQuota.has(m));
+        const available = usable.filter((m) => (this.circuits.get(m)?.openUntil ?? 0) <= now);
+        if (available.length > 0)
+            return available;
+        return [...usable].sort((a, b) => (this.circuits.get(a)?.openUntil ?? 0) - (this.circuits.get(b)?.openUntil ?? 0));
+    }
+    state(model) {
+        const circuit = this.circuits.get(model);
+        if (circuit?.openUntil === undefined)
+            return "closed";
+        return circuit.openUntil > this.now() ? "open" : "half-open";
+    }
+    recordFailure(model) {
+        const circuit = this.circuits.get(model) ?? { failures: 0, cooldownMs: this.cooldownMs };
+        const probing = this.state(model) === "half-open";
+        circuit.failures += 1;
+        if (probing || circuit.failures >= this.threshold) {
+            circuit.openUntil = this.now() + circuit.cooldownMs;
+            circuit.cooldownMs = Math.min(circuit.cooldownMs * 2, this.maxCooldownMs);
+            circuit.failures = 0;
+        }
+        this.circuits.set(model, circuit);
+    }
+    recordSuccess(model) {
+        this.circuits.delete(model);
+        this.quotas.delete(model);
+    }
+    // How long every task should hold off this model (a shared rate-limit pause).
+    pausedFor(model) {
+        return Math.max(0, (this.quotas.get(model)?.pausedUntil ?? 0) - this.now());
+    }
+    isOutOfQuota(model) {
+        return this.outOfQuota.has(model);
+    }
+    // A rate limit with a short, stated wait pauses the model for every task;
+    // a daily limit, no stated wait, a long one, or too many waits in a row
+    // mean the model is out of quota for the rest of the run.
+    recordQuota(model, quota) {
+        const state = this.quotas.get(model) ?? { waits: 0, pausedUntil: 0 };
+        const wait = quota.retryAfterMs;
+        if (quota.daily ||
+            wait === undefined ||
+            wait > MAX_QUOTA_WAIT_MS ||
+            state.waits >= QUOTA_RETRIES) {
+            this.outOfQuota.add(model);
+            return "out_of_quota";
+        }
+        state.waits += 1;
+        state.pausedUntil = Math.max(state.pausedUntil, this.now() + wait);
+        this.quotas.set(model, state);
+        return "wait";
+    }
+}
+//# sourceMappingURL=models.js.map

package/dist/opencode-server.d.ts

@@ -0,0 +1,14 @@
+export interface OpencodeServer {
+    url: string;
+    authorization: string;
+    close(): Promise<void>;
+    killNow(): void;
+}
+export interface StartOptions {
+    binary: string;
+    env: Record<string, string>;
+    config: unknown;
+    startupTimeoutMs?: number;
+}
+export declare function startOpencodeServer(options: StartOptions): Promise<OpencodeServer>;
+//# sourceMappingURL=opencode-server.d.ts.map

package/dist/opencode-server.js

@@ -0,0 +1,84 @@
+import { spawn } from "node:child_process";
+import { randomBytes } from "node:crypto";
+import { createServer } from "node:net";
+const LISTENING = /opencode server listening on (https?:\/\/\S+)/;
+export async function startOpencodeServer(options) {
+    const port = await freePort();
+    const password = randomBytes(24).toString("hex");
+    const child = spawn(options.binary, ["serve", "--hostname=127.0.0.1", `--port=${port}`], {
+        env: {
+            ...options.env,
+            OPENCODE_CONFIG_CONTENT: JSON.stringify(options.config),
+            OPENCODE_SERVER_PASSWORD: password,
+        },
+        stdio: ["ignore", "pipe", "pipe"],
+    });
+    const url = await waitForListening(child, options.startupTimeoutMs ?? 30_000);
+    return {
+        url,
+        authorization: `Basic ${Buffer.from(`opencode:${password}`).toString("base64")}`,
+        close: () => stop(child),
+        killNow: () => {
+            if (child.exitCode === null && child.signalCode === null)
+                child.kill("SIGKILL");
+        },
+    };
+}
+const STARTUP_OUTPUT_CHARS = 16_000;
+function waitForListening(child, timeoutMs) {
+    return new Promise((resolve, reject) => {
+        let output = "";
+        const fail = (message) => {
+            clearTimeout(timer);
+            void stop(child);
+            reject(new Error(`${message}${output.trim() ? `\n${output.trim()}` : ""}`));
+        };
+        const timer = setTimeout(() => fail(`OpenCode did not start within ${timeoutMs}ms`), timeoutMs);
+        // Only the tail matters for a startup error message.
+        const keep = (chunk) => {
+            output = (output + chunk.toString()).slice(-STARTUP_OUTPUT_CHARS);
+        };
+        const onData = (chunk) => {
+            keep(chunk);
+            const match = LISTENING.exec(output);
+            if (match?.[1]) {
+                clearTimeout(timer);
+                // Past startup the output is not needed, but it must still be read:
+                // a full pipe would block OpenCode's next write.
+                child.stdout?.off("data", onData);
+                child.stderr?.off("data", keep);
+                child.stdout?.resume();
+                child.stderr?.resume();
+                resolve(match[1]);
+            }
+        };
+        child.stdout?.on("data", onData);
+        child.stderr?.on("data", keep);
+        child.once("error", (error) => fail(`OpenCode failed to start: ${error.message}`));
+        child.once("exit", (code) => fail(`OpenCode exited with code ${code} during startup`));
+    });
+}
+function stop(child) {
+    if (child.exitCode !== null || child.signalCode !== null)
+        return Promise.resolve();
+    return new Promise((resolve) => {
+        const kill = setTimeout(() => child.kill("SIGKILL"), 5_000);
+        child.once("exit", () => {
+            clearTimeout(kill);
+            resolve();
+        });
+        child.kill("SIGTERM");
+    });
+}
+function freePort() {
+    return new Promise((resolve, reject) => {
+        const server = createServer();
+        server.once("error", reject);
+        server.listen(0, "127.0.0.1", () => {
+            const address = server.address();
+            const port = typeof address === "object" && address ? address.port : 0;
+            server.close(() => resolve(port));
+        });
+    });
+}
+//# sourceMappingURL=opencode-server.js.map

package/dist/plugin.d.ts

@@ -0,0 +1,3 @@
+import type { OcraPlugin } from "@open-cr-agent/core";
+export declare const opencodeRuntimePlugin: OcraPlugin;
+//# sourceMappingURL=plugin.d.ts.map

package/dist/plugin.js

@@ -0,0 +1,8 @@
+import { OpenCodeRuntime } from "./runtime.js";
+export const opencodeRuntimePlugin = {
+    name: "runtime-opencode",
+    configure(ctx) {
+        ctx.registerRuntime("opencode", (options) => new OpenCodeRuntime(options));
+    },
+};
+//# sourceMappingURL=plugin.js.map

package/dist/quota.d.ts

@@ -0,0 +1,9 @@
+export interface QuotaError {
+    retryAfterMs?: number;
+    daily: boolean;
+}
+export declare const MAX_QUOTA_WAIT_MS = 90000;
+export declare const QUOTA_RETRIES = 3;
+export declare function parseQuotaError(message: string, statusCode?: number): QuotaError | undefined;
+export declare function sleep(ms: number, signal: AbortSignal): Promise<void>;
+//# sourceMappingURL=quota.d.ts.map