@earendil-works/chord 1.3.0 → 1.5.0

package/dist/next/remote/provider.js

@@ -0,0 +1,506 @@
+// The provider side of one origin on a link (§3, §22, W1; decision "Relay flow control per origin"): the holds the
+// peer sent for that origin, served here or relayed, by their ids; the calls on them, at most this side's N at once;
+// and the window: at most K unacknowledged `bound` and `state` messages of this host's own, with what waits meanwhile,
+// and the sender of every message in flight, so each `ack` reaches the host that sent its message.
+import { withAbortSignal } from "../../context/index.js";
+import { ChordError, isChordError } from "../data/index.js";
+import { DeflatedPart, oversized, parsePayload, payloadPart, wireError, } from "../link/internal.js";
+import { Hold } from "./hold.js";
+/** At most this many of this host's own `bound` and `state` messages unacknowledged per origin. */
+const WINDOW = 2;
+/**
+ * The provider side of one origin on a link. Ids are the origin's; a message naming an id this side does not know is
+ * ignored (Q1), one reusing a live id is a protocol error, and so are more concurrent calls than this side announced.
+ * This host's own `bound` and `state` messages go through the window: locally served holds wait while it is full
+ * (their ops in their members' pending queues, their bindings for the next slot). A relay forwards upstream messages
+ * at once (each upstream host keeps its own window for the origin it sees), so a slow consumer stalls only its origin.
+ */
+export class ProviderSide {
+    link;
+    /** Whose work this side serves: 0 for the peer's own, a relay's number for one of its downstream links. */
+    origin;
+    #calls = new Map();
+    #entries = new Map();
+    #limit;
+    /** The sender of each `bound` and `state` message in flight, in order: the consumer acknowledges in order. */
+    #sent = [];
+    /** This host's own messages in flight. */
+    #inFlight = 0;
+    /** The holds the current batch touched, in order; its flush sends or queues them. */
+    #touched = [];
+    /** Holds whose ops wait in their pending queues for a slot. */
+    #waiting = new Set();
+    /** Holds waiting for a slot to send their first binding. */
+    #binding = new Set();
+    /** The waiting bindings take the next slot: the last one went to waiting state while they waited. */
+    #bindingTurn = false;
+    /** Set once a hold of this origin is relayed. */
+    #relay;
+    constructor(link, origin, limit) {
+        this.link = link;
+        this.origin = origin;
+        this.#limit = limit;
+    }
+    /** Handles one message of this origin; a call whose arguments wait for an asynchronous inflate returns its promise. */
+    message(message) {
+        switch (message.kind) {
+            case "hold":
+                this.#hold(message);
+                break;
+            case "release":
+                this.#release(message.hold);
+                this.#settle();
+                break;
+            case "call":
+                return this.#call(message);
+            case "abort":
+                this.#abort(message.call);
+                this.#settle();
+                break;
+            case "retry":
+                this.#entries.get(message.hold)?.retry(message);
+                break;
+            case "ack":
+                this.#ack();
+                this.#settle();
+                break;
+        }
+    }
+    /**
+     * The link closed, or the origin did (`closed`): every hold is released (relayed ones by one `closed` to each
+     * upstream link) and every call aborted.
+     */
+    closed() {
+        const closing = this.link.host.closing;
+        const entries = [...this.#entries.values()];
+        this.#entries.clear();
+        const closed = new ChordError({ code: "unavailable", message: "the link closed" });
+        for (const call of this.#calls.values())
+            if (call.kind === "served")
+                call.abort.abort(closed);
+        this.#calls.clear();
+        // While the host closes, it ends its objects itself.
+        for (const entry of entries) {
+            if (entry.kind === "served" && !closing)
+                entry.release();
+            else
+                entry.drop();
+        }
+        // A batch flushing later finds nothing of this side.
+        this.#touched = [];
+        const relay = this.#relay;
+        if (relay === undefined)
+            return;
+        this.link.host.relays.delete(relay.origin);
+        for (const link of relay.links)
+            link.send({ kind: "closed", origin: relay.origin });
+    }
+    /** Sends `message` on the link with this origin. */
+    send(message) {
+        this.link.send(this.origin === 0 ? message : { ...message, origin: this.origin });
+    }
+    /**
+     * Ends with `error` every hold of this origin that acts for a principal `revoked` names and holds nothing: served
+     * here but unbound (before the publication, refused), or relayed and waiting for its route's link.
+     */
+    revokeUnbound(revoked, error) {
+        for (const hold of [...this.#entries.values()]) {
+            // A hold arriving on a link acts for a principal: the link's, or one its parent named.
+            if (!revoked(hold.caller.principal))
+                continue;
+            if (hold.kind === "served" && hold.unbound)
+                hold.end(error);
+            else if (hold.kind === "relayed" && hold.waiting)
+                hold.revoked(error);
+        }
+    }
+    /** A pending hold turned out to be relayed: it takes the hold's place in the table. */
+    relayed(hold) {
+        this.#entries.set(hold.id, hold);
+    }
+    /** This origin's number on upstream links (one per host, never reused), with `link` as one it relays to. */
+    relayTo(link) {
+        let relay = this.#relay;
+        if (relay === undefined) {
+            relay = { origin: this.link.host.relayOrigin(this), links: new Set() };
+            this.#relay = relay;
+        }
+        relay.links.add(link);
+        return relay.origin;
+    }
+    /**
+     * A message from upstream link `from` for this origin's relayed holds, forwarded with this origin: `bound` and
+     * `state` join the window's senders (their `ack` goes back to `from`), a reply ends its call, `gone` forgets its
+     * hold. A link answers only for what was relayed over it: an entry, a notice or a reply naming a hold (or a call)
+     * this origin did not relay over `from` is dropped (Q1); a `bound` or `state` left without entries is acknowledged
+     * to `from` at once. Parts travel unchecked and unparsed: the end that parses a part checks it against its own
+     * link's limits.
+     */
+    forward(message, from) {
+        const relay = this.#relay;
+        if (relay === undefined || !relay.links.has(from))
+            return;
+        const { origin: _, ...forwarded } = message;
+        switch (forwarded.kind) {
+            case "bound":
+            case "state": {
+                const holds = this.#relayedOver(forwarded.holds, from);
+                if (holds.length === 0) {
+                    from.send({ kind: "ack", origin: relay.origin });
+                    return;
+                }
+                this.#sent.push(from);
+                // The entries of the message's own kind.
+                this.send(holds === forwarded.holds ? forwarded : { ...forwarded, holds });
+                return;
+            }
+            case "result":
+            case "error": {
+                const call = this.#calls.get(forwarded.call);
+                if (call?.kind === "relayed" && call.hold.heldOn(from))
+                    this.reply(forwarded.call, forwarded);
+                return;
+            }
+            case "gone": {
+                const hold = this.#relayedHold(forwarded.hold, from);
+                if (hold === undefined)
+                    return;
+                hold.lost();
+                this.send(forwarded);
+                return;
+            }
+            default:
+                if (this.#relayedHold(forwarded.hold, from) !== undefined)
+                    this.send(forwarded);
+        }
+    }
+    /** An upstream link closed: nothing more is relayed to it, nor accepted from it. */
+    unlinked(link) {
+        this.#relay?.links.delete(link);
+    }
+    /**
+     * The upstream link of relayed hold `hold` dropped with `error`: its calls in flight fail, the hold goes loading
+     * downstream, and its path's next link holds it again.
+     */
+    upstreamDropped(hold, error) {
+        for (const [id, call] of this.#calls) {
+            if (call.hold === hold)
+                this.reply(id, { kind: "error", call: id, error: wireError(error) });
+        }
+        this.send({ kind: "loading", hold: hold.id });
+    }
+    /**
+     * Forgets a hold (released, refused or gone) and every call on it; local calls are aborted with `error` (its
+     * object's end for a gone hold, `released` otherwise).
+     */
+    forget(hold, error) {
+        if (this.#entries.get(hold.id) === hold)
+            this.#entries.delete(hold.id);
+        const reason = error ?? new ChordError({ code: "released", message: `hold ${hold.id}: released` });
+        for (const [id, call] of this.#calls) {
+            if (call.hold !== hold)
+                continue;
+            this.#calls.delete(id);
+            if (call.kind === "served")
+                call.abort.abort(reason);
+        }
+        if (hold.kind === "served")
+            this.unbind(hold);
+        this.#settle();
+    }
+    /** A call ended with `reply` (a result or an error): its slot is free; nothing is sent for one already gone. */
+    reply(id, reply) {
+        if (!this.#calls.delete(id))
+            return;
+        this.send(reply);
+        this.#settle();
+    }
+    /**
+     * Drops this side from its link once it holds nothing: no holds, no calls, nothing in flight. Its origin's next hold
+     * makes a new one (origins are never reused), so a long-lived link keeps records only for live work.
+     */
+    #settle() {
+        if (this.#entries.size === 0 && this.#calls.size === 0 && this.#sent.length === 0)
+            this.link.drop(this);
+    }
+    /** A hold's object is live: its `bound` goes now when a slot is free, else with the next free slot's bindings. */
+    bind(hold, context) {
+        if (this.#free) {
+            this.#sendOwn({ kind: "bound", holds: [hold.boundEntry(context)] });
+        }
+        else {
+            this.#binding.add(hold);
+        }
+    }
+    /** A hold stopped waiting for a slot: it was forgotten. */
+    unbind(hold) {
+        this.#waiting.delete(hold);
+        this.#binding.delete(hold);
+    }
+    /**
+     * A served hold left its object's binding (slice 7b §6, model §5): its unsent pending ops and a queued `bound` are
+     * dropped (the ack slots of messages already sent stay until their `ack`), its calls in flight rejected with `error`
+     * (each slot freed once).
+     */
+    unbound(hold, error) {
+        this.unbind(hold);
+        for (const [id, call] of this.#calls) {
+            if (call.hold !== hold)
+                continue;
+            if (call.kind === "served")
+                call.abort.abort(error);
+            this.reply(id, { kind: "error", call: id, error: wireError(error) });
+        }
+    }
+    /** A hold's members changed in the current batch; its flush sends or queues it. */
+    touched(hold) {
+        if (this.#touched.length === 0)
+            this.link.host.batch.flushing((context) => this.#flush(context));
+        this.#touched.push(hold);
+    }
+    /**
+     * `entries` whose holds this origin relayed over `from`, in one pass: the same array when all are, else a copy made
+     * at the first one that is not.
+     */
+    #relayedOver(entries, from) {
+        let kept;
+        for (let i = 0; i < entries.length; i++) {
+            const entry = entries[i];
+            const relayed = this.#relayedHold(entry.hold, from) !== undefined;
+            if (kept !== undefined) {
+                if (relayed)
+                    kept.push(entry);
+            }
+            else if (!relayed) {
+                kept = entries.slice(0, i);
+            }
+        }
+        return kept ?? entries;
+    }
+    /** The hold `id` of this origin when it is relayed over `from`. */
+    #relayedHold(id, from) {
+        const hold = this.#entries.get(id);
+        return hold?.kind === "relayed" && hold.heldOn(from) ? hold : undefined;
+    }
+    /**
+     * A hold message: a protocol error for a live id or compressed params (params are never compressed), otherwise
+     * admitted (`Hold.start`, placed once the host published). Its activation chain is kept only from a trusted link (Q5); its
+     * decoded limit is the link's, or the smaller one a parent stamped (Q2), and travels with it when it is relayed.
+     */
+    #hold(message) {
+        if (this.#entries.has(message.hold))
+            throw new Error(`hold ${message.hold}: the id is in use`);
+        if (message.params instanceof DeflatedPart)
+            throw new Error(`hold ${message.hold}: compressed params`);
+        // Whom it acts for is decided here once (`#caller`), never passed on: a relay names it only on a route link.
+        const { kind: _kind, origin: _origin, hold: id, principal: _principal, incarnation: _incarnation, chain, limit: stamped, ...fields } = message;
+        const { link } = this;
+        const limit = Math.min(link.limits.decoded, (link.role === "parent" ? stamped : undefined) ?? Infinity);
+        const request = {
+            ...fields,
+            ...(chain !== undefined && link.trusted ? { chain } : {}),
+            ...(limit === Infinity ? {} : { limit }),
+        };
+        const limits = limit === link.limits.decoded ? link.limits : { part: link.limits.part, decoded: limit };
+        const hold = new Hold(id, this, this.#caller(message), limits);
+        this.#entries.set(id, hold);
+        hold.start(request);
+    }
+    /**
+     * Whom a hold acts for: on a parent link the hold's own principal and incarnation when it names them, everywhere
+     * else the link's principal and the peer's incarnation (a child cannot claim to be someone else).
+     */
+    #caller(message) {
+        const { link } = this;
+        if (link.role !== "parent")
+            return { principal: link.principal, incarnation: link.peer };
+        // The message schema checked a principal's shape on an untrusted link; a trusted parent is believed.
+        const principal = message.principal ?? link.principal;
+        return { principal, incarnation: message.incarnation ?? link.peer };
+    }
+    #release(id) {
+        const hold = this.#entries.get(id);
+        if (hold === undefined)
+            return;
+        this.forget(hold);
+        hold.release();
+    }
+    /**
+     * A call: one on a hold this side does not know is ignored (Q1), more than this side's N at once and compressed
+     * arguments from a child (clients never compress) are protocol errors. On a relayed hold it is forwarded, its
+     * arguments checked against this link's part limit first (the bytes are here). On a served hold that is not bound
+     * yet (nor binding afresh after a swap) it is refused `not_ready`; its method is an index into the bound variant (one
+     * outside it is a protocol error) and its arguments are opened and parsed here within the hold's limits (past one
+     * the call fails `too_large/part`; a malformed part is a protocol error), absent ones `null`. Arguments this host
+     * must inflate asynchronously are inflated first, then the call is handled again.
+     */
+    #call(message) {
+        if (this.#calls.has(message.call))
+            throw new Error(`call ${message.call}: the id is in use`);
+        const hold = this.#entries.get(message.hold);
+        if (hold === undefined)
+            return;
+        if (this.#calls.size >= this.#limit)
+            throw new Error(`call ${message.call}: more than ${this.#limit} calls`);
+        const { args: part, segments } = message;
+        if (part instanceof DeflatedPart && this.link.role === "child") {
+            throw new Error(`call ${message.call}: compressed arguments from a child`);
+        }
+        if (hold.kind === "relayed") {
+            const error = part === undefined ? undefined : oversized(part, this.link.limits.part);
+            if (error !== undefined) {
+                this.#refuse(message.call, error);
+                return;
+            }
+            this.#calls.set(message.call, { kind: "relayed", hold });
+            hold.call(message);
+            return;
+        }
+        if (!hold.callable) {
+            this.#refuse(message.call, new ChordError({ code: "not_ready", message: `hold ${hold.id}: not bound yet` }));
+            return;
+        }
+        const method = hold.method(message.method);
+        if (this.link.inflates(part, hold.limits)) {
+            return this.link.inflate([[part, hold.limits.decoded]], () => this.#call(message));
+        }
+        let json;
+        try {
+            json = part === undefined ? undefined : this.link.openPart(part, hold.limits, this.link.context);
+        }
+        catch (error) {
+            if (!isChordError(error, "too_large"))
+                throw error;
+            this.#refuse(message.call, error);
+            return;
+        }
+        const args = json === undefined ? null : parsePayload(json, segments);
+        const call = { kind: "served", hold, bytes: method.resultBytes, abort: new AbortController() };
+        this.#calls.set(message.call, call);
+        void this.#run(message.call, call, method.name, args);
+    }
+    /**
+     * Runs a call and sends its result (absent when `null`) or error, unless it was aborted, released or gone
+     * meanwhile. A result that cannot be encoded is sent as its error.
+     */
+    async #run(id, call, method, args) {
+        let reply;
+        try {
+            // A link's context has no abort signal, so this is the call's own signal: no `AbortSignal.any` per call.
+            const result = await call.hold.call(method, args, withAbortSignal(call.abort.signal, this.link.context));
+            // Results are not validated: they are the provider's.
+            reply =
+                result === null || result === undefined
+                    ? { kind: "result", call: id }
+                    : this.#result(id, result, call.bytes, this.link.context);
+        }
+        catch (error) {
+            reply = { kind: "error", call: id, error: wireError(error) };
+        }
+        this.reply(id, reply);
+    }
+    /** Answers call `id` with `error` before it was admitted: it took no slot. */
+    #refuse(id, error) {
+        this.send({ kind: "error", call: id, error: wireError(error) });
+    }
+    #abort(id) {
+        const call = this.#calls.get(id);
+        if (call === undefined)
+            return;
+        this.#calls.delete(id);
+        if (call.kind === "relayed")
+            call.hold.abort(id);
+        else
+            call.abort.abort(new ChordError({ code: "aborted", message: `call ${id}: aborted by its caller` }));
+    }
+    /**
+     * An `ack` answers the oldest message in flight: this host's own frees a slot, a relayed one is acknowledged to its
+     * upstream link (closed meanwhile: nothing to do). An ack crossing nothing in flight is ignored.
+     */
+    #ack() {
+        const sender = this.#sent.shift();
+        if (sender === undefined)
+            return;
+        if (sender !== "local") {
+            // A relayed message implies the relay's number.
+            sender.send({ kind: "ack", origin: this.#relay.origin });
+            return;
+        }
+        this.#inFlight--;
+        this.#slotFreed();
+    }
+    /**
+     * The end of a batch: while a slot is free and nothing waits, one `state` message with an entry per touched hold;
+     * otherwise each touched hold's ops join its pending queues until a slot frees.
+     */
+    #flush(context) {
+        const holds = this.#touched;
+        // The side closed during the batch: nothing is sent.
+        if (holds.length === 0)
+            return;
+        this.#touched = [];
+        // A hold touched in this batch may have left its binding since (a reload unbound it).
+        if (this.#free) {
+            const entries = [];
+            for (const hold of holds)
+                if (hold.bound)
+                    entries.push(hold.entry(context));
+            if (entries.length > 0)
+                this.#sendOwn({ kind: "state", holds: entries });
+            return;
+        }
+        // A bound hold never waits for its binding.
+        for (const hold of holds) {
+            if (!hold.bound)
+                continue;
+            hold.queue();
+            this.#waiting.add(hold);
+        }
+    }
+    /** Whether this host's next message goes out now: a slot is free and nothing waits for one. */
+    get #free() {
+        return this.#binding.size === 0 && this.#waiting.size === 0 && this.#inFlight < WINDOW;
+    }
+    /**
+     * A slot may be free: while there is room, the waiting state goes out as one message and the waiting bindings as
+     * one `bound`, taking turns when both wait (state first), so neither a hold that keeps changing nor a stream of new
+     * holds starves the other.
+     */
+    #slotFreed() {
+        const context = this.link.context;
+        while (this.#inFlight < WINDOW) {
+            if (this.#binding.size > 0 && (this.#waiting.size === 0 || this.#bindingTurn)) {
+                const holds = [...this.#binding];
+                this.#binding.clear();
+                this.#bindingTurn = false;
+                // Every snapshot in one synchronous step: the binding shows all of them at one moment.
+                this.#sendOwn({ kind: "bound", holds: holds.map((hold) => hold.boundEntry(context)) });
+            }
+            else if (this.#waiting.size > 0) {
+                const holds = [...this.#waiting];
+                this.#waiting.clear();
+                this.#bindingTurn = this.#binding.size > 0;
+                this.#sendOwn({ kind: "state", holds: holds.map((hold) => hold.pendingEntry(context)) });
+            }
+            else {
+                return;
+            }
+        }
+    }
+    /**
+     * A call's result message, its part deflated above the threshold when this host compresses; with byte segments when
+     * its method's result schema has a `bytes()` leaf.
+     */
+    #result(id, result, bytes, context) {
+        const { json, segments } = payloadPart(result, bytes);
+        const value = this.link.part(json, context);
+        return { kind: "result", call: id, value, ...(segments === undefined ? {} : { segments }) };
+    }
+    /** Sends one of this host's own `bound` or `state` messages, taking a slot. */
+    #sendOwn(message) {
+        this.#inFlight++;
+        this.#sent.push("local");
+        this.send(message);
+    }
+}
+//# sourceMappingURL=provider.js.map

package/dist/next/remote/provider.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"provider.js","sourceRoot":"","sources":["../../../src/next/remote/provider.ts"],"names":[],"mappings":"AAAA,mHAAmH;AACnH,qHAAqH;AACrH,uHAAuH;AACvH,mGAAmG;AAEnG,OAAO,EAAgB,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACvE,OAAO,EAAE,UAAU,EAAE,YAAY,EAAkB,MAAM,kBAAkB,CAAC;AAE5E,OAAO,EAGN,YAAY,EAGZ,SAAS,EAET,YAAY,EACZ,WAAW,EAEX,SAAS,GACT,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAkBjC,mGAAmG;AACnG,MAAM,MAAM,GAAG,CAAC,CAAC;AAEjB;;;;;;GAMG;AACH,MAAM,OAAO,YAAY;IACf,IAAI,CAAW;IACxB,2GAA2G;IAClG,MAAM,CAAS;IACf,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;IACxC,QAAQ,GAAG,IAAI,GAAG,EAA8B,CAAC;IACjD,MAAM,CAAS;IACxB,8GAA8G;IACrG,KAAK,GAAa,EAAE,CAAC;IAC9B,0CAA0C;IAC1C,SAAS,GAAG,CAAC,CAAC;IACd,qFAAqF;IACrF,QAAQ,GAAW,EAAE,CAAC;IACtB,+DAA+D;IACtD,QAAQ,GAAG,IAAI,GAAG,EAAQ,CAAC;IACpC,4DAA4D;IACnD,QAAQ,GAAG,IAAI,GAAG,EAAQ,CAAC;IACpC,qGAAqG;IACrG,YAAY,GAAG,KAAK,CAAC;IACrB,iDAAiD;IACjD,MAAM,CAAoB;IAE1B,YAAY,IAAc,EAAE,MAAc,EAAE,KAAa;QACxD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,uHAAuH;IACvH,OAAO,CAAC,OAAwB;QAC/B,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;YACtB,KAAK,MAAM;gBACV,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBACpB,MAAM;YACP,KAAK,SAAS;gBACb,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAI,CAAC,OAAO,EAAE,CAAC;gBACf,MAAM;YACP,KAAK,MAAM;gBACV,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAC5B,KAAK,OAAO;gBACX,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC1B,IAAI,CAAC,OAAO,EAAE,CAAC;gBACf,MAAM;YACP,KAAK,OAAO;gBACX,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;gBAChD,MAAM;YACP,KAAK,KAAK;gBACT,IAAI,CAAC,IAAI,EAAE,CAAC;gBACZ,IAAI,CAAC,OAAO,EAAE,CAAC;gBACf,MAAM;QACR,CAAC;IACF,CAAC;IAED;;;OAGG;IACH,MAAM;QACL,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;QACvC,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;QAC5C,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC,CAAC;QACnF,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;YAAE,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;gBAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC9F,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,qDAAqD;QACrD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,OAAO;gBAAE,KAAK,CAAC,OAAO,EAAE,CAAC;;gBACpD,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,CAAC;QACD,qDAAqD;QACrD,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO;QAChC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;YAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACrF,CAAC;IAED,oDAAoD;IACpD,IAAI,CAAC,OAAsB;QAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACnF,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,OAA0C,EAAE,KAAiB;QAC1E,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;YAChD,uFAAuF;YACvF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,SAAU,CAAC;gBAAE,SAAS;YAC/C,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,OAAO;gBAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;iBACvD,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO;gBAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACvE,CAAC;IACF,CAAC;IAED,uFAAuF;IACvF,OAAO,CAAC,IAAiB;QACxB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAClC,CAAC;IAED,4GAA4G;IAC5G,OAAO,CAAC,IAAc;QACrB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;YACvE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACrB,CAAC;QACD,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,KAAK,CAAC,MAAM,CAAC;IACrB,CAAC;IAED;;;;;;;OAOG;IACH,OAAO,CAAC,OAAwB,EAAE,IAAc;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO;QAC1D,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,SAAS,EAAE,GAAG,OAAO,CAAC;QAC5C,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;YACxB,KAAK,OAAO,CAAC;YACb,KAAK,OAAO,EAAE,CAAC;gBACd,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAA0B,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAChF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACxB,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;oBACjD,OAAO;gBACR,CAAC;gBACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtB,yCAAyC;gBACzC,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,EAAE,GAAG,SAAS,EAAE,KAAK,EAAuB,CAAC,CAAC;gBACjG,OAAO;YACR,CAAC;YACD,KAAK,QAAQ,CAAC;YACd,KAAK,OAAO,EAAE,CAAC;gBACd,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBAC7C,IAAI,IAAI,EAAE,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;oBAAE,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;gBAC9F,OAAO;YACR,CAAC;YACD,KAAK,MAAM,EAAE,CAAC;gBACb,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBACrD,IAAI,IAAI,KAAK,SAAS;oBAAE,OAAO;gBAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACZ,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACrB,OAAO;YACR,CAAC;YACD;gBACC,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,SAAS;oBAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAClF,CAAC;IACF,CAAC;IAED,oFAAoF;IACpF,QAAQ,CAAC,IAAc;QACtB,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,eAAe,CAAC,IAAiB,EAAE,KAAiB;QACnD,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACtC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;gBAAE,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC9F,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;IAC/C,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,IAAwB,EAAE,KAAkB;QAClD,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,IAAI;YAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,KAAK,IAAI,IAAI,UAAU,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,IAAI,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC;QACnG,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACtC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;gBAAE,SAAS;YACjC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACvB,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;gBAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACtD,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;YAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAI,CAAC,OAAO,EAAE,CAAC;IAChB,CAAC;IAED,gHAAgH;IAChH,KAAK,CAAC,EAAU,EAAE,KAAoE;QACrF,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;YAAE,OAAO;QACpC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjB,IAAI,CAAC,OAAO,EAAE,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,OAAO;QACN,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzG,CAAC;IAED,kHAAkH;IAClH,IAAI,CAAC,IAAU,EAAE,OAAgB;QAChC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;QACrE,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;IACF,CAAC;IAED,2DAA2D;IAC3D,MAAM,CAAC,IAAU;QAChB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,IAAU,EAAE,KAAiB;QACpC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACtC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;gBAAE,SAAS;YACjC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;gBAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACpD,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACtE,CAAC;IACF,CAAC;IAED,mFAAmF;IACnF,OAAO,CAAC,IAAU;QACjB,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QACjG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,YAAY,CAAsC,OAAqB,EAAE,IAAc;QACtF,IAAI,IAAqB,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;YAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,SAAS,CAAC;YAClE,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACxB,IAAI,OAAO;oBAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC/B,CAAC;iBAAM,IAAI,CAAC,OAAO,EAAE,CAAC;gBACrB,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,CAAC;QACF,CAAC;QACD,OAAO,IAAI,IAAI,OAAO,CAAC;IACxB,CAAC;IAED,mEAAmE;IACnE,YAAY,CAAC,EAAU,EAAE,IAAc;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,OAAO,IAAI,EAAE,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IACzE,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,OAAoD;QACzD,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,QAAQ,OAAO,CAAC,IAAI,oBAAoB,CAAC,CAAC;QAC/F,IAAI,OAAO,CAAC,MAAM,YAAY,YAAY;YAAE,MAAM,IAAI,KAAK,CAAC,QAAQ,OAAO,CAAC,IAAI,qBAAqB,CAAC,CAAC;QACvG,6GAA6G;QAC7G,MAAM,EACL,IAAI,EAAE,KAAK,EACX,MAAM,EAAE,OAAO,EACf,IAAI,EAAE,EAAE,EACR,SAAS,EAAE,UAAU,EACrB,WAAW,EAAE,YAAY,EACzB,KAAK,EACL,KAAK,EAAE,OAAO,EACd,GAAG,MAAM,EACT,GAAG,OAAO,CAAC;QACZ,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,QAAQ,CAAC,CAAC;QACxG,MAAM,OAAO,GAAG;YACf,GAAG,MAAM;YACT,GAAG,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACzD,GAAG,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC;SACxC,CAAC;QACF,MAAM,MAAM,GAAG,KAAK,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QACxG,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC;QAC/D,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,OAAoD;QAC3D,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtB,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,WAAW,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC;QACzF,qGAAqG;QACrG,MAAM,SAAS,GAAI,OAAO,CAAC,SAAiC,IAAI,IAAI,CAAC,SAAS,CAAC;QAC/E,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;IACrE,CAAC;IAED,QAAQ,CAAC,EAAU;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO;QAC/B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClB,IAAI,CAAC,OAAO,EAAE,CAAC;IAChB,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,OAAoD;QACzD,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,QAAQ,OAAO,CAAC,IAAI,oBAAoB,CAAC,CAAC;QAC7F,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO;QAC/B,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,QAAQ,OAAO,CAAC,IAAI,eAAe,IAAI,CAAC,MAAM,QAAQ,CAAC,CAAC;QAC7G,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;QACzC,IAAI,IAAI,YAAY,YAAY,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAChE,MAAM,IAAI,KAAK,CAAC,QAAQ,OAAO,CAAC,IAAI,qCAAqC,CAAC,CAAC;QAC5E,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACtF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACzB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBAClC,OAAO;YACR,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YACzD,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACnB,OAAO;QACR,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,UAAU,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,IAAI,CAAC,EAAE,iBAAiB,EAAE,CAAC,CAAC,CAAC;YAC7G,OAAO;QACR,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QACpF,CAAC;QACD,IAAI,IAAqC,CAAC;QAC1C,IAAI,CAAC;YACJ,IAAI,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClG,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,WAAW,CAAC;gBAAE,MAAM,KAAK,CAAC;YACnD,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAClC,OAAO;QACR,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACtE,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,WAAW,EAAE,KAAK,EAAE,IAAI,eAAe,EAAE,EAAW,CAAC;QACxG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,KAAK,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACvD,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,IAAI,CACT,EAAU,EACV,IAAuD,EACvD,MAAc,EACd,IAAa;QAEb,IAAI,KAAoE,CAAC;QACzE,IAAI,CAAC;YACJ,yGAAyG;YACzG,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YACzG,sDAAsD;YACtD,KAAK;gBACJ,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,SAAS;oBACtC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,EAAE;oBAC9B,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7D,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,KAAK,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9D,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IACvB,CAAC;IAED,8EAA8E;IAC9E,OAAO,CAAC,EAAU,EAAE,KAAiB;QACpC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACjE,CAAC;IAED,MAAM,CAAC,EAAU;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO;QAC/B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;;YAC5C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,yBAAyB,EAAE,CAAC,CAAC,CAAC;IAC1G,CAAC;IAED;;;OAGG;IACH,IAAI;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAClC,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO;QACjC,IAAI,MAAM,KAAK,OAAO,EAAE,CAAC;YACxB,gDAAgD;YAChD,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,MAAO,CAAC,MAAM,EAAE,CAAC,CAAC;YAC1D,OAAO;QACR,CAAC;QACD,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,CAAC,UAAU,EAAE,CAAC;IACnB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,OAAgB;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,qDAAqD;QACrD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC/B,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,sFAAsF;QACtF,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,MAAM,OAAO,GAAiB,EAAE,CAAC;YACjC,KAAK,MAAM,IAAI,IAAI,KAAK;gBAAE,IAAI,IAAI,CAAC,KAAK;oBAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YAC5E,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;gBAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;YACzE,OAAO;QACR,CAAC;QACD,4CAA4C;QAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,KAAK;gBAAE,SAAS;YAC1B,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;IACF,CAAC;IAED,+FAA+F;IAC/F,IAAI,KAAK;QACR,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC;IACxF,CAAC;IAED;;;;OAIG;IACH,UAAU;QACT,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;QAClC,OAAO,IAAI,CAAC,SAAS,GAAG,MAAM,EAAE,CAAC;YAChC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;gBAC/E,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACjC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;gBAC1B,uFAAuF;gBACvF,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;YACxF,CAAC;iBAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBACnC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACjC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC;gBAC3C,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;YAC1F,CAAC;iBAAM,CAAC;gBACP,OAAO;YACR,CAAC;QACF,CAAC;IACF,CAAC;IAED;;;OAGG;IACH,OAAO,CACN,EAAU,EACV,MAAe,EACf,KAAc,EACd,OAAgB;QAEhB,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC5C,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IAC7F,CAAC;IAED,+EAA+E;IAC/E,QAAQ,CAAC,OAAqE;QAC7E,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACpB,CAAC;CACD","sourcesContent":["// The provider side of one origin on a link (§3, §22, W1; decision \"Relay flow control per origin\"): the holds the\n// peer sent for that origin, served here or relayed, by their ids; the calls on them, at most this side's N at once;\n// and the window: at most K unacknowledged `bound` and `state` messages of this host's own, with what waits meanwhile,\n// and the sender of every message in flight, so each `ack` reaches the host that sent its message.\n\nimport { type Context, withAbortSignal } from \"../../context/index.ts\";\nimport { ChordError, isChordError, type Principal } from \"../data/index.ts\";\nimport type { Caller } from \"../host/internal.ts\";\nimport {\n\ttype BoundEntry,\n\ttype ConsumerMessage,\n\tDeflatedPart,\n\ttype Message,\n\ttype OriginMessage,\n\toversized,\n\ttype ProviderMessage,\n\tparsePayload,\n\tpayloadPart,\n\ttype StateEntry,\n\twireError,\n} from \"../link/internal.ts\";\nimport { Hold } from \"./hold.ts\";\nimport type { HostLink } from \"./host-link.ts\";\nimport type { RelayedHold } from \"./relay.ts\";\n\n/**\n * A call being handled: on a hold served here, with whether its result carries byte segments and the abort of its\n * handler's context; or relayed, its reply forwarded from upstream.\n */\ntype RunningCall =\n\t| { readonly kind: \"served\"; readonly hold: Hold; readonly bytes: boolean; readonly abort: AbortController }\n\t| { readonly kind: \"relayed\"; readonly hold: RelayedHold };\n\n/** Who sent a `bound` or `state` message in flight: this host, or the upstream link a relay forwarded it from. */\ntype Sender = \"local\" | HostLink;\n\n/** A relaying origin: its number on upstream links, and the open upstream links it relayed holds to. */\ntype Relay = { readonly origin: number; readonly links: Set<HostLink> };\n\n/** At most this many of this host's own `bound` and `state` messages unacknowledged per origin. */\nconst WINDOW = 2;\n\n/**\n * The provider side of one origin on a link. Ids are the origin's; a message naming an id this side does not know is\n * ignored (Q1), one reusing a live id is a protocol error, and so are more concurrent calls than this side announced.\n * This host's own `bound` and `state` messages go through the window: locally served holds wait while it is full\n * (their ops in their members' pending queues, their bindings for the next slot). A relay forwards upstream messages\n * at once (each upstream host keeps its own window for the origin it sees), so a slow consumer stalls only its origin.\n */\nexport class ProviderSide {\n\treadonly link: HostLink;\n\t/** Whose work this side serves: 0 for the peer's own, a relay's number for one of its downstream links. */\n\treadonly origin: number;\n\treadonly #calls = new Map<number, RunningCall>();\n\treadonly #entries = new Map<number, Hold | RelayedHold>();\n\treadonly #limit: number;\n\t/** The sender of each `bound` and `state` message in flight, in order: the consumer acknowledges in order. */\n\treadonly #sent: Sender[] = [];\n\t/** This host's own messages in flight. */\n\t#inFlight = 0;\n\t/** The holds the current batch touched, in order; its flush sends or queues them. */\n\t#touched: Hold[] = [];\n\t/** Holds whose ops wait in their pending queues for a slot. */\n\treadonly #waiting = new Set<Hold>();\n\t/** Holds waiting for a slot to send their first binding. */\n\treadonly #binding = new Set<Hold>();\n\t/** The waiting bindings take the next slot: the last one went to waiting state while they waited. */\n\t#bindingTurn = false;\n\t/** Set once a hold of this origin is relayed. */\n\t#relay: Relay | undefined;\n\n\tconstructor(link: HostLink, origin: number, limit: number) {\n\t\tthis.link = link;\n\t\tthis.origin = origin;\n\t\tthis.#limit = limit;\n\t}\n\n\t/** Handles one message of this origin; a call whose arguments wait for an asynchronous inflate returns its promise. */\n\tmessage(message: ProviderMessage): void | Promise<void> {\n\t\tswitch (message.kind) {\n\t\t\tcase \"hold\":\n\t\t\t\tthis.#hold(message);\n\t\t\t\tbreak;\n\t\t\tcase \"release\":\n\t\t\t\tthis.#release(message.hold);\n\t\t\t\tthis.#settle();\n\t\t\t\tbreak;\n\t\t\tcase \"call\":\n\t\t\t\treturn this.#call(message);\n\t\t\tcase \"abort\":\n\t\t\t\tthis.#abort(message.call);\n\t\t\t\tthis.#settle();\n\t\t\t\tbreak;\n\t\t\tcase \"retry\":\n\t\t\t\tthis.#entries.get(message.hold)?.retry(message);\n\t\t\t\tbreak;\n\t\t\tcase \"ack\":\n\t\t\t\tthis.#ack();\n\t\t\t\tthis.#settle();\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\t/**\n\t * The link closed, or the origin did (`closed`): every hold is released (relayed ones by one `closed` to each\n\t * upstream link) and every call aborted.\n\t */\n\tclosed(): void {\n\t\tconst closing = this.link.host.closing;\n\t\tconst entries = [...this.#entries.values()];\n\t\tthis.#entries.clear();\n\t\tconst closed = new ChordError({ code: \"unavailable\", message: \"the link closed\" });\n\t\tfor (const call of this.#calls.values()) if (call.kind === \"served\") call.abort.abort(closed);\n\t\tthis.#calls.clear();\n\t\t// While the host closes, it ends its objects itself.\n\t\tfor (const entry of entries) {\n\t\t\tif (entry.kind === \"served\" && !closing) entry.release();\n\t\t\telse entry.drop();\n\t\t}\n\t\t// A batch flushing later finds nothing of this side.\n\t\tthis.#touched = [];\n\t\tconst relay = this.#relay;\n\t\tif (relay === undefined) return;\n\t\tthis.link.host.relays.delete(relay.origin);\n\t\tfor (const link of relay.links) link.send({ kind: \"closed\", origin: relay.origin });\n\t}\n\n\t/** Sends `message` on the link with this origin. */\n\tsend(message: OriginMessage): void {\n\t\tthis.link.send(this.origin === 0 ? message : { ...message, origin: this.origin });\n\t}\n\n\t/**\n\t * Ends with `error` every hold of this origin that acts for a principal `revoked` names and holds nothing: served\n\t * here but unbound (before the publication, refused), or relayed and waiting for its route's link.\n\t */\n\trevokeUnbound(revoked: (principal: Principal) => boolean, error: ChordError): void {\n\t\tfor (const hold of [...this.#entries.values()]) {\n\t\t\t// A hold arriving on a link acts for a principal: the link's, or one its parent named.\n\t\t\tif (!revoked(hold.caller.principal!)) continue;\n\t\t\tif (hold.kind === \"served\" && hold.unbound) hold.end(error);\n\t\t\telse if (hold.kind === \"relayed\" && hold.waiting) hold.revoked(error);\n\t\t}\n\t}\n\n\t/** A pending hold turned out to be relayed: it takes the hold's place in the table. */\n\trelayed(hold: RelayedHold): void {\n\t\tthis.#entries.set(hold.id, hold);\n\t}\n\n\t/** This origin's number on upstream links (one per host, never reused), with `link` as one it relays to. */\n\trelayTo(link: HostLink): number {\n\t\tlet relay = this.#relay;\n\t\tif (relay === undefined) {\n\t\t\trelay = { origin: this.link.host.relayOrigin(this), links: new Set() };\n\t\t\tthis.#relay = relay;\n\t\t}\n\t\trelay.links.add(link);\n\t\treturn relay.origin;\n\t}\n\n\t/**\n\t * A message from upstream link `from` for this origin's relayed holds, forwarded with this origin: `bound` and\n\t * `state` join the window's senders (their `ack` goes back to `from`), a reply ends its call, `gone` forgets its\n\t * hold. A link answers only for what was relayed over it: an entry, a notice or a reply naming a hold (or a call)\n\t * this origin did not relay over `from` is dropped (Q1); a `bound` or `state` left without entries is acknowledged\n\t * to `from` at once. Parts travel unchecked and unparsed: the end that parses a part checks it against its own\n\t * link's limits.\n\t */\n\tforward(message: ConsumerMessage, from: HostLink): void {\n\t\tconst relay = this.#relay;\n\t\tif (relay === undefined || !relay.links.has(from)) return;\n\t\tconst { origin: _, ...forwarded } = message;\n\t\tswitch (forwarded.kind) {\n\t\t\tcase \"bound\":\n\t\t\tcase \"state\": {\n\t\t\t\tconst holds = this.#relayedOver<BoundEntry | StateEntry>(forwarded.holds, from);\n\t\t\t\tif (holds.length === 0) {\n\t\t\t\t\tfrom.send({ kind: \"ack\", origin: relay.origin });\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tthis.#sent.push(from);\n\t\t\t\t// The entries of the message's own kind.\n\t\t\t\tthis.send(holds === forwarded.holds ? forwarded : ({ ...forwarded, holds } as typeof forwarded));\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tcase \"result\":\n\t\t\tcase \"error\": {\n\t\t\t\tconst call = this.#calls.get(forwarded.call);\n\t\t\t\tif (call?.kind === \"relayed\" && call.hold.heldOn(from)) this.reply(forwarded.call, forwarded);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tcase \"gone\": {\n\t\t\t\tconst hold = this.#relayedHold(forwarded.hold, from);\n\t\t\t\tif (hold === undefined) return;\n\t\t\t\thold.lost();\n\t\t\t\tthis.send(forwarded);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\tif (this.#relayedHold(forwarded.hold, from) !== undefined) this.send(forwarded);\n\t\t}\n\t}\n\n\t/** An upstream link closed: nothing more is relayed to it, nor accepted from it. */\n\tunlinked(link: HostLink): void {\n\t\tthis.#relay?.links.delete(link);\n\t}\n\n\t/**\n\t * The upstream link of relayed hold `hold` dropped with `error`: its calls in flight fail, the hold goes loading\n\t * downstream, and its path's next link holds it again.\n\t */\n\tupstreamDropped(hold: RelayedHold, error: ChordError): void {\n\t\tfor (const [id, call] of this.#calls) {\n\t\t\tif (call.hold === hold) this.reply(id, { kind: \"error\", call: id, error: wireError(error) });\n\t\t}\n\t\tthis.send({ kind: \"loading\", hold: hold.id });\n\t}\n\n\t/**\n\t * Forgets a hold (released, refused or gone) and every call on it; local calls are aborted with `error` (its\n\t * object's end for a gone hold, `released` otherwise).\n\t */\n\tforget(hold: Hold | RelayedHold, error?: ChordError): void {\n\t\tif (this.#entries.get(hold.id) === hold) this.#entries.delete(hold.id);\n\t\tconst reason = error ?? new ChordError({ code: \"released\", message: `hold ${hold.id}: released` });\n\t\tfor (const [id, call] of this.#calls) {\n\t\t\tif (call.hold !== hold) continue;\n\t\t\tthis.#calls.delete(id);\n\t\t\tif (call.kind === \"served\") call.abort.abort(reason);\n\t\t}\n\t\tif (hold.kind === \"served\") this.unbind(hold);\n\t\tthis.#settle();\n\t}\n\n\t/** A call ended with `reply` (a result or an error): its slot is free; nothing is sent for one already gone. */\n\treply(id: number, reply: Extract<OriginMessage, { readonly kind: \"result\" | \"error\" }>): void {\n\t\tif (!this.#calls.delete(id)) return;\n\t\tthis.send(reply);\n\t\tthis.#settle();\n\t}\n\n\t/**\n\t * Drops this side from its link once it holds nothing: no holds, no calls, nothing in flight. Its origin's next hold\n\t * makes a new one (origins are never reused), so a long-lived link keeps records only for live work.\n\t */\n\t#settle(): void {\n\t\tif (this.#entries.size === 0 && this.#calls.size === 0 && this.#sent.length === 0) this.link.drop(this);\n\t}\n\n\t/** A hold's object is live: its `bound` goes now when a slot is free, else with the next free slot's bindings. */\n\tbind(hold: Hold, context: Context): void {\n\t\tif (this.#free) {\n\t\t\tthis.#sendOwn({ kind: \"bound\", holds: [hold.boundEntry(context)] });\n\t\t} else {\n\t\t\tthis.#binding.add(hold);\n\t\t}\n\t}\n\n\t/** A hold stopped waiting for a slot: it was forgotten. */\n\tunbind(hold: Hold): void {\n\t\tthis.#waiting.delete(hold);\n\t\tthis.#binding.delete(hold);\n\t}\n\n\t/**\n\t * A served hold left its object's binding (slice 7b §6, model §5): its unsent pending ops and a queued `bound` are\n\t * dropped (the ack slots of messages already sent stay until their `ack`), its calls in flight rejected with `error`\n\t * (each slot freed once).\n\t */\n\tunbound(hold: Hold, error: ChordError): void {\n\t\tthis.unbind(hold);\n\t\tfor (const [id, call] of this.#calls) {\n\t\t\tif (call.hold !== hold) continue;\n\t\t\tif (call.kind === \"served\") call.abort.abort(error);\n\t\t\tthis.reply(id, { kind: \"error\", call: id, error: wireError(error) });\n\t\t}\n\t}\n\n\t/** A hold's members changed in the current batch; its flush sends or queues it. */\n\ttouched(hold: Hold): void {\n\t\tif (this.#touched.length === 0) this.link.host.batch.flushing((context) => this.#flush(context));\n\t\tthis.#touched.push(hold);\n\t}\n\n\t/**\n\t * `entries` whose holds this origin relayed over `from`, in one pass: the same array when all are, else a copy made\n\t * at the first one that is not.\n\t */\n\t#relayedOver<E extends { readonly hold: number }>(entries: readonly E[], from: HostLink): readonly E[] {\n\t\tlet kept: E[] | undefined;\n\t\tfor (let i = 0; i < entries.length; i++) {\n\t\t\tconst entry = entries[i]!;\n\t\t\tconst relayed = this.#relayedHold(entry.hold, from) !== undefined;\n\t\t\tif (kept !== undefined) {\n\t\t\t\tif (relayed) kept.push(entry);\n\t\t\t} else if (!relayed) {\n\t\t\t\tkept = entries.slice(0, i);\n\t\t\t}\n\t\t}\n\t\treturn kept ?? entries;\n\t}\n\n\t/** The hold `id` of this origin when it is relayed over `from`. */\n\t#relayedHold(id: number, from: HostLink): RelayedHold | undefined {\n\t\tconst hold = this.#entries.get(id);\n\t\treturn hold?.kind === \"relayed\" && hold.heldOn(from) ? hold : undefined;\n\t}\n\n\t/**\n\t * A hold message: a protocol error for a live id or compressed params (params are never compressed), otherwise\n\t * admitted (`Hold.start`, placed once the host published). Its activation chain is kept only from a trusted link (Q5); its\n\t * decoded limit is the link's, or the smaller one a parent stamped (Q2), and travels with it when it is relayed.\n\t */\n\t#hold(message: Extract<Message, { readonly kind: \"hold\" }>): void {\n\t\tif (this.#entries.has(message.hold)) throw new Error(`hold ${message.hold}: the id is in use`);\n\t\tif (message.params instanceof DeflatedPart) throw new Error(`hold ${message.hold}: compressed params`);\n\t\t// Whom it acts for is decided here once (`#caller`), never passed on: a relay names it only on a route link.\n\t\tconst {\n\t\t\tkind: _kind,\n\t\t\torigin: _origin,\n\t\t\thold: id,\n\t\t\tprincipal: _principal,\n\t\t\tincarnation: _incarnation,\n\t\t\tchain,\n\t\t\tlimit: stamped,\n\t\t\t...fields\n\t\t} = message;\n\t\tconst { link } = this;\n\t\tconst limit = Math.min(link.limits.decoded, (link.role === \"parent\" ? stamped : undefined) ?? Infinity);\n\t\tconst request = {\n\t\t\t...fields,\n\t\t\t...(chain !== undefined && link.trusted ? { chain } : {}),\n\t\t\t...(limit === Infinity ? {} : { limit }),\n\t\t};\n\t\tconst limits = limit === link.limits.decoded ? link.limits : { part: link.limits.part, decoded: limit };\n\t\tconst hold = new Hold(id, this, this.#caller(message), limits);\n\t\tthis.#entries.set(id, hold);\n\t\thold.start(request);\n\t}\n\n\t/**\n\t * Whom a hold acts for: on a parent link the hold's own principal and incarnation when it names them, everywhere\n\t * else the link's principal and the peer's incarnation (a child cannot claim to be someone else).\n\t */\n\t#caller(message: Extract<Message, { readonly kind: \"hold\" }>): Caller {\n\t\tconst { link } = this;\n\t\tif (link.role !== \"parent\") return { principal: link.principal, incarnation: link.peer };\n\t\t// The message schema checked a principal's shape on an untrusted link; a trusted parent is believed.\n\t\tconst principal = (message.principal as Caller[\"principal\"]) ?? link.principal;\n\t\treturn { principal, incarnation: message.incarnation ?? link.peer };\n\t}\n\n\t#release(id: number): void {\n\t\tconst hold = this.#entries.get(id);\n\t\tif (hold === undefined) return;\n\t\tthis.forget(hold);\n\t\thold.release();\n\t}\n\n\t/**\n\t * A call: one on a hold this side does not know is ignored (Q1), more than this side's N at once and compressed\n\t * arguments from a child (clients never compress) are protocol errors. On a relayed hold it is forwarded, its\n\t * arguments checked against this link's part limit first (the bytes are here). On a served hold that is not bound\n\t * yet (nor binding afresh after a swap) it is refused `not_ready`; its method is an index into the bound variant (one\n\t * outside it is a protocol error) and its arguments are opened and parsed here within the hold's limits (past one\n\t * the call fails `too_large/part`; a malformed part is a protocol error), absent ones `null`. Arguments this host\n\t * must inflate asynchronously are inflated first, then the call is handled again.\n\t */\n\t#call(message: Extract<Message, { readonly kind: \"call\" }>): void | Promise<void> {\n\t\tif (this.#calls.has(message.call)) throw new Error(`call ${message.call}: the id is in use`);\n\t\tconst hold = this.#entries.get(message.hold);\n\t\tif (hold === undefined) return;\n\t\tif (this.#calls.size >= this.#limit) throw new Error(`call ${message.call}: more than ${this.#limit} calls`);\n\t\tconst { args: part, segments } = message;\n\t\tif (part instanceof DeflatedPart && this.link.role === \"child\") {\n\t\t\tthrow new Error(`call ${message.call}: compressed arguments from a child`);\n\t\t}\n\t\tif (hold.kind === \"relayed\") {\n\t\t\tconst error = part === undefined ? undefined : oversized(part, this.link.limits.part);\n\t\t\tif (error !== undefined) {\n\t\t\t\tthis.#refuse(message.call, error);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis.#calls.set(message.call, { kind: \"relayed\", hold });\n\t\t\thold.call(message);\n\t\t\treturn;\n\t\t}\n\t\tif (!hold.callable) {\n\t\t\tthis.#refuse(message.call, new ChordError({ code: \"not_ready\", message: `hold ${hold.id}: not bound yet` }));\n\t\t\treturn;\n\t\t}\n\t\tconst method = hold.method(message.method);\n\t\tif (this.link.inflates(part, hold.limits)) {\n\t\t\treturn this.link.inflate([[part, hold.limits.decoded]], () => this.#call(message));\n\t\t}\n\t\tlet json: string | Uint8Array | undefined;\n\t\ttry {\n\t\t\tjson = part === undefined ? undefined : this.link.openPart(part, hold.limits, this.link.context);\n\t\t} catch (error) {\n\t\t\tif (!isChordError(error, \"too_large\")) throw error;\n\t\t\tthis.#refuse(message.call, error);\n\t\t\treturn;\n\t\t}\n\t\tconst args = json === undefined ? null : parsePayload(json, segments);\n\t\tconst call = { kind: \"served\", hold, bytes: method.resultBytes, abort: new AbortController() } as const;\n\t\tthis.#calls.set(message.call, call);\n\t\tvoid this.#run(message.call, call, method.name, args);\n\t}\n\n\t/**\n\t * Runs a call and sends its result (absent when `null`) or error, unless it was aborted, released or gone\n\t * meanwhile. A result that cannot be encoded is sent as its error.\n\t */\n\tasync #run(\n\t\tid: number,\n\t\tcall: Extract<RunningCall, { readonly kind: \"served\" }>,\n\t\tmethod: string,\n\t\targs: unknown,\n\t): Promise<void> {\n\t\tlet reply: Extract<OriginMessage, { readonly kind: \"result\" | \"error\" }>;\n\t\ttry {\n\t\t\t// A link's context has no abort signal, so this is the call's own signal: no `AbortSignal.any` per call.\n\t\t\tconst result = await call.hold.call(method, args, withAbortSignal(call.abort.signal, this.link.context));\n\t\t\t// Results are not validated: they are the provider's.\n\t\t\treply =\n\t\t\t\tresult === null || result === undefined\n\t\t\t\t\t? { kind: \"result\", call: id }\n\t\t\t\t\t: this.#result(id, result, call.bytes, this.link.context);\n\t\t} catch (error) {\n\t\t\treply = { kind: \"error\", call: id, error: wireError(error) };\n\t\t}\n\t\tthis.reply(id, reply);\n\t}\n\n\t/** Answers call `id` with `error` before it was admitted: it took no slot. */\n\t#refuse(id: number, error: ChordError): void {\n\t\tthis.send({ kind: \"error\", call: id, error: wireError(error) });\n\t}\n\n\t#abort(id: number): void {\n\t\tconst call = this.#calls.get(id);\n\t\tif (call === undefined) return;\n\t\tthis.#calls.delete(id);\n\t\tif (call.kind === \"relayed\") call.hold.abort(id);\n\t\telse call.abort.abort(new ChordError({ code: \"aborted\", message: `call ${id}: aborted by its caller` }));\n\t}\n\n\t/**\n\t * An `ack` answers the oldest message in flight: this host's own frees a slot, a relayed one is acknowledged to its\n\t * upstream link (closed meanwhile: nothing to do). An ack crossing nothing in flight is ignored.\n\t */\n\t#ack(): void {\n\t\tconst sender = this.#sent.shift();\n\t\tif (sender === undefined) return;\n\t\tif (sender !== \"local\") {\n\t\t\t// A relayed message implies the relay's number.\n\t\t\tsender.send({ kind: \"ack\", origin: this.#relay!.origin });\n\t\t\treturn;\n\t\t}\n\t\tthis.#inFlight--;\n\t\tthis.#slotFreed();\n\t}\n\n\t/**\n\t * The end of a batch: while a slot is free and nothing waits, one `state` message with an entry per touched hold;\n\t * otherwise each touched hold's ops join its pending queues until a slot frees.\n\t */\n\t#flush(context: Context): void {\n\t\tconst holds = this.#touched;\n\t\t// The side closed during the batch: nothing is sent.\n\t\tif (holds.length === 0) return;\n\t\tthis.#touched = [];\n\t\t// A hold touched in this batch may have left its binding since (a reload unbound it).\n\t\tif (this.#free) {\n\t\t\tconst entries: StateEntry[] = [];\n\t\t\tfor (const hold of holds) if (hold.bound) entries.push(hold.entry(context));\n\t\t\tif (entries.length > 0) this.#sendOwn({ kind: \"state\", holds: entries });\n\t\t\treturn;\n\t\t}\n\t\t// A bound hold never waits for its binding.\n\t\tfor (const hold of holds) {\n\t\t\tif (!hold.bound) continue;\n\t\t\thold.queue();\n\t\t\tthis.#waiting.add(hold);\n\t\t}\n\t}\n\n\t/** Whether this host's next message goes out now: a slot is free and nothing waits for one. */\n\tget #free(): boolean {\n\t\treturn this.#binding.size === 0 && this.#waiting.size === 0 && this.#inFlight < WINDOW;\n\t}\n\n\t/**\n\t * A slot may be free: while there is room, the waiting state goes out as one message and the waiting bindings as\n\t * one `bound`, taking turns when both wait (state first), so neither a hold that keeps changing nor a stream of new\n\t * holds starves the other.\n\t */\n\t#slotFreed(): void {\n\t\tconst context = this.link.context;\n\t\twhile (this.#inFlight < WINDOW) {\n\t\t\tif (this.#binding.size > 0 && (this.#waiting.size === 0 || this.#bindingTurn)) {\n\t\t\t\tconst holds = [...this.#binding];\n\t\t\t\tthis.#binding.clear();\n\t\t\t\tthis.#bindingTurn = false;\n\t\t\t\t// Every snapshot in one synchronous step: the binding shows all of them at one moment.\n\t\t\t\tthis.#sendOwn({ kind: \"bound\", holds: holds.map((hold) => hold.boundEntry(context)) });\n\t\t\t} else if (this.#waiting.size > 0) {\n\t\t\t\tconst holds = [...this.#waiting];\n\t\t\t\tthis.#waiting.clear();\n\t\t\t\tthis.#bindingTurn = this.#binding.size > 0;\n\t\t\t\tthis.#sendOwn({ kind: \"state\", holds: holds.map((hold) => hold.pendingEntry(context)) });\n\t\t\t} else {\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * A call's result message, its part deflated above the threshold when this host compresses; with byte segments when\n\t * its method's result schema has a `bytes()` leaf.\n\t */\n\t#result(\n\t\tid: number,\n\t\tresult: unknown,\n\t\tbytes: boolean,\n\t\tcontext: Context,\n\t): Extract<OriginMessage, { readonly kind: \"result\" }> {\n\t\tconst { json, segments } = payloadPart(result, bytes);\n\t\tconst value = this.link.part(json, context);\n\t\treturn { kind: \"result\", call: id, value, ...(segments === undefined ? {} : { segments }) };\n\t}\n\n\t/** Sends one of this host's own `bound` or `state` messages, taking a slot. */\n\t#sendOwn(message: Extract<OriginMessage, { readonly kind: \"bound\" | \"state\" }>): void {\n\t\tthis.#inFlight++;\n\t\tthis.#sent.push(\"local\");\n\t\tthis.send(message);\n\t}\n}\n"]}

package/dist/next/remote/relay.d.ts

@@ -0,0 +1,58 @@
+import { ChordError } from "../data/index.ts";
+import type { Caller } from "../host/internal.ts";
+import { type Message } from "../link/internal.ts";
+import { type HoldRequest } from "./hold.ts";
+import type { HostLink } from "./host-link.ts";
+import type { Path } from "./path.ts";
+import type { ProviderSide } from "./provider.ts";
+/**
+ * One relayed hold: `id` on its downstream origin, and the same id upstream on its path's current link (none while
+ * the path has no link). It keeps its `hold` message to hold again on the next link. Calls, `abort`, `retry` and
+ * `release` go upstream at once; what comes back is forwarded by its downstream origin (`ProviderSide.forward`). Two
+ * downstream holds are two upstream holds, each with its own encoders (R1).
+ */
+export declare class RelayedHold {
+    #private;
+    readonly kind = "relayed";
+    readonly id: number;
+    /** Whom the hold acts for, sent on route links. */
+    readonly caller: Caller;
+    constructor(id: number, downstream: ProviderSide, request: HoldRequest, caller: Caller, path: Path);
+    /** Takes the pending hold's place downstream and holds upstream (now, or when the path has a link). */
+    start(): void;
+    /** Whether it is held on `link` now: only that link answers for it. */
+    heldOn(link: HostLink): boolean;
+    /** Holds on `link`, the path's link now: its kept `hold` message, with whom it acts for on a route link. */
+    attach(link: HostLink): void;
+    /** The upstream link dropped: downstream its calls fail and the hold goes loading until the path's next link. */
+    dropped(error: ChordError): void;
+    /** Its path's address cannot be reached for now: downstream it fails `waiting` with `error` until the next link. */
+    unreachable(error: ChordError): void;
+    /**
+     * Whether it waits for its path's link (a route still resolving, or a dropped link's next): a revocation ends it then,
+     * since the link it is held on next gets no past `revoke` (§4).
+     */
+    get waiting(): boolean;
+    /** Revoked while it waited for its path's link: forgotten, and `gone` with `error` downstream. */
+    revoked(error: ChordError): void;
+    /** `gone` from upstream: the hold is forgotten (the downstream origin forwards the message). */
+    lost(): void;
+    /**
+     * A call from downstream (registered there under its id), forwarded upstream at once; its reply comes back by the
+     * origin. Without an upstream link it is answered `unavailable` at once (it crossed the `loading` notice).
+     */
+    call(message: Extract<Message, {
+        readonly kind: "call";
+    }>): void;
+    /** A downstream `abort` of call `id`, forwarded. */
+    abort(id: number): void;
+    /** A downstream `retry`, forwarded with its hop budget as it is (a relay visits no object). */
+    retry(message: Extract<Message, {
+        readonly kind: "retry";
+    }>): void;
+    /** Released downstream: released upstream (its calls with it) and no later link holds it. */
+    release(): void;
+    /** No later link holds it (gone, or its downstream origin closed, which `closed` tells the upstream links). */
+    drop(): void;
+}
+//# sourceMappingURL=relay.d.ts.map

package/dist/next/remote/relay.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"relay.d.ts","sourceRoot":"","sources":["../../../src/next/remote/relay.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,EAAE,KAAK,OAAO,EAAa,MAAM,qBAAqB,CAAC;AAC9D,OAAO,EAAa,KAAK,WAAW,EAAE,MAAM,WAAW,CAAC;AACxD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAElD;;;;;GAKG;AACH,qBAAa,WAAW;;IACvB,QAAQ,CAAC,IAAI,aAAa;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAOpB,mDAAmD;IACnD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAKxB,YAAY,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,YAAY,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EASjG;IAED,uGAAuG;IACvG,KAAK,IAAI,IAAI,CAGZ;IAED,uEAAuE;IACvE,MAAM,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO,CAE9B;IAED,4GAA4G;IAC5G,MAAM,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAI3B;IAED,iHAAiH;IACjH,OAAO,CAAC,KAAK,EAAE,UAAU,GAAG,IAAI,CAI/B;IAED,oHAAoH;IACpH,WAAW,CAAC,KAAK,EAAE,UAAU,GAAG,IAAI,CAEnC;IAED;;;OAGG;IACH,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,kGAAkG;IAClG,OAAO,CAAC,KAAK,EAAE,UAAU,GAAG,IAAI,CAI/B;IAED,gGAAgG;IAChG,IAAI,IAAI,IAAI,CAGX;IAED;;;OAGG;IACH,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI,CAQ/D;IAED,oDAAoD;IACpD,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,CAGtB;IAED,+FAA+F;IAC/F,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;KAAE,CAAC,GAAG,IAAI,CAGjE;IAED,6FAA6F;IAC7F,OAAO,IAAI,IAAI,CAId;IAED,+GAA+G;IAC/G,IAAI,IAAI,IAAI,CAGX;CACD"}