@rocicorp/zero 1.12.0-canary.0 → 1.12.0-canary.10

package/out/zero-cache/src/services/change-streamer/sqlite-change-log-catchup.js.map

@@ -1 +1 @@
-{"version":3,"file":"sqlite-change-log-catchup.js","names":["#lc","#forwarder","#reader","#batchSize","#barrierTimeoutMs","#barrierPollIntervalMs","#cleanupGuard","#sleep","#now","#onFailure","#barrierTimeouts","#barrierBacklogOverflows","#barrierWakeups","#catchupResults","#catchupRows","#catchupBytes","#catchupDuration","#barrierWaitDuration","#catchupBacklogPeak","#catchups","#commitWaiters","#closed","#throwIfAborted","#run","#awaitRequiredHead","#waitForPlan","#awaitChangeLogProgress"],"sources":["../../../../../../zero-cache/src/services/change-streamer/sqlite-change-log-catchup.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {resolver} from '@rocicorp/resolver';\nimport {AbortError} from '../../../../shared/src/abort-error.ts';\nimport {sleep} from '../../../../shared/src/sleep.ts';\nimport {\n  getOrCreateCounter,\n  getOrCreateLatencyHistogram,\n  getOrCreateValueHistogram,\n} from '../../observability/metrics.ts';\nimport type {WatermarkedChange} from './change-streamer.ts';\nimport * as ErrorType from './error-type-enum.ts';\nimport type {Forwarder} from './forwarder.ts';\nimport type {CatchupPlan} from './sqlite-change-log-reader.ts';\nimport type {Subscriber} from './subscriber.ts';\n\nexport interface SQLiteChangeLogCatchupReader {\n  plan(fromWatermark: string): CatchupPlan;\n  read(\n    fromWatermark: string,\n    throughWatermark: string,\n    batchSize: number,\n    signal?: AbortSignal,\n  ): AsyncIterable<readonly WatermarkedChange[]>;\n  close(): void;\n}\n\n/**\n * Slice 9 replaces this no-op implementation with a guard that waits for an\n * in-flight purge and blocks new purge dispatch while the subscriber's ACK is\n * made visible to the Forwarder.\n */\nexport interface SQLiteChangeLogCleanupGuard {\n  runWhilePurgeBlocked<T>(register: () => T): Promise<T>;\n}\n\n// How long the barrier waits for the change-log writer's commit notification\n// before re-reading the log itself. The notification normally arrives first, so\n// this is a backstop for the windows in which none is coming: the writer is\n// disabled, or it is between stream connections.\nconst DEFAULT_BARRIER_POLL_INTERVAL_MS = 1000;\n\nexport type SQLiteChangeLogCatchupOptions = {\n  batchSize: number;\n  barrierTimeoutMs: number;\n  barrierPollIntervalMs?: number | undefined;\n  cleanupGuard?: SQLiteChangeLogCleanupGuard | undefined;\n  sleep?: typeof sleep | undefined;\n  now?: (() => number) | undefined;\n  /** Opens slice 11's process-local breaker after registration has committed. */\n  onFailure?: ((failure: SQLiteChangeLogCatchupFailure) => void) | undefined;\n};\n\nexport type SQLiteChangeLogCatchupRequest = {\n  /**\n   * Whether the routing warm-up gate classified the log as warm *for this\n   * subscriber*. The coordinator is opened once and reused, so this cannot be\n   * a property of it: `coldReadPercent` serves some subscribers from a log\n   * that is still inside its warm-up window, and the catchup metrics have to\n   * separate those from steady-state serving.\n   */\n  readonly logWarm?: boolean | undefined;\n};\n\nexport type SQLiteChangeLogCatchupFailure = 'barrier-timeout' | 'reader-error';\n\nexport type SQLiteChangeLogCatchupRegistration =\n  | {readonly kind: 'registered'}\n  | {readonly kind: 'uncovered'; readonly minWatermark: string}\n  // Registration failed before the subscriber was committed to SQLite, so PG\n  // catchup is still available and the caller falls back to it.\n  | {readonly kind: 'declined'; readonly error: unknown}\n  // The coordinator closed or failed the subscriber itself.\n  | {readonly kind: 'handled'};\n\nconst NOOP_CLEANUP_GUARD: SQLiteChangeLogCleanupGuard = {\n  runWhilePurgeBlocked: register => Promise.resolve(register()),\n};\n\n/**\n * Coordinates a serving subscriber's gap-free transition from replica-local\n * SQLite catchup to the Forwarder's live stream.\n *\n * Registration and required-head capture happen in one synchronous callback.\n * The subscriber therefore either sees a transaction in SQLite catchup or in\n * its live backlog (duplicates across that boundary are filtered by\n * Subscriber), never in neither place.\n */\nexport class SQLiteChangeLogCatchup implements Disposable {\n  readonly #lc: LogContext;\n  readonly #forwarder: Forwarder;\n  readonly #reader: SQLiteChangeLogCatchupReader;\n  readonly #batchSize: number;\n  readonly #barrierTimeoutMs: number;\n  readonly #barrierPollIntervalMs: number;\n  readonly #cleanupGuard: SQLiteChangeLogCleanupGuard;\n  readonly #sleep: typeof sleep;\n  readonly #now: () => number;\n  readonly #onFailure:\n    | ((failure: SQLiteChangeLogCatchupFailure) => void)\n    | undefined;\n  readonly #barrierTimeouts = getOrCreateCounter(\n    'replication',\n    'sqlite_change_log.barrier_timeouts',\n    'SQLite change-log catchups that timed out waiting for the required head.',\n  );\n  readonly #barrierBacklogOverflows = getOrCreateCounter(\n    'replication',\n    'sqlite_change_log.barrier_backlog_overflows',\n    'SQLite change-log catchups abandoned because the subscriber backlog ' +\n      'reached its high water mark while waiting for the required head.',\n  );\n  readonly #barrierWakeups = getOrCreateCounter(\n    'replication',\n    'sqlite_change_log.barrier_wakeups',\n    'SQLite catchup barrier waits, labeled by what ended the wait. A ' +\n      'population dominated by \"poll\" means the change-log writer\\'s commit ' +\n      'notification is not reaching the barrier.',\n  );\n  readonly #catchupResults = getOrCreateCounter(\n    'replication',\n    'sqlite_change_log.catchup_results',\n    'SQLite catchup subscriptions by outcome.',\n  );\n  readonly #catchupRows = getOrCreateCounter(\n    'replication',\n    'sqlite_change_log.catchup_rows',\n    'Rows served from the SQLite change log during catchup.',\n  );\n  readonly #catchupBytes = getOrCreateCounter(\n    'replication',\n    'sqlite_change_log.catchup_bytes',\n    {\n      description: 'Bytes served from the SQLite change log during catchup.',\n      unit: 'By',\n    },\n  );\n  readonly #catchupDuration = getOrCreateLatencyHistogram(\n    'replication',\n    'sqlite_change_log.catchup_duration',\n    'Duration of a SQLite change-log catchup.',\n  );\n  readonly #barrierWaitDuration = getOrCreateLatencyHistogram(\n    'replication',\n    'sqlite_change_log.barrier_wait_duration',\n    'Time SQLite catchup waits for its pinned required head.',\n  );\n  readonly #catchupBacklogPeak = getOrCreateValueHistogram(\n    'replication',\n    'sqlite_change_log.catchup_backlog_peak_bytes',\n    {\n      description:\n        'Peak live backlog bytes buffered while a subscriber catches up from SQLite.',\n      unit: 'By',\n      bucketBoundaries: [\n        0, 1024, 16_384, 65_536, 262_144, 1_048_576, 4_194_304, 16_777_216,\n      ],\n    },\n  );\n  readonly #catchups = new Map<Subscriber, AbortController>();\n  readonly #commitWaiters = new Set<CommitWaiter>();\n  #closed = false;\n\n  constructor(\n    lc: LogContext,\n    forwarder: Forwarder,\n    reader: SQLiteChangeLogCatchupReader,\n    opts: SQLiteChangeLogCatchupOptions,\n  ) {\n    this.#lc = lc.withContext('component', 'sqlite-change-log-catchup');\n    this.#forwarder = forwarder;\n    this.#reader = reader;\n    this.#batchSize = opts.batchSize;\n    this.#barrierTimeoutMs = opts.barrierTimeoutMs;\n    this.#barrierPollIntervalMs =\n      opts.barrierPollIntervalMs ?? DEFAULT_BARRIER_POLL_INTERVAL_MS;\n    this.#cleanupGuard = opts.cleanupGuard ?? NOOP_CLEANUP_GUARD;\n    this.#sleep = opts.sleep ?? sleep;\n    this.#now = opts.now ?? Date.now;\n    this.#onFailure = opts.onFailure;\n  }\n\n  /**\n   * Registers the subscriber before resolving. Catchup itself continues in\n   * the background so subscribe() does not wait for SQLite to reach the\n   * required head.\n   */\n  async catchup(\n    subscriber: Subscriber,\n    captureRequiredHead: () => string | Promise<string>,\n    request: SQLiteChangeLogCatchupRequest = {},\n  ): Promise<SQLiteChangeLogCatchupRegistration> {\n    if (this.#closed) {\n      subscriber.fail(new AbortError('SQLite change-log catchup is closed'));\n      return {kind: 'handled'};\n    }\n\n    const abort = new AbortController();\n    this.#catchups.set(subscriber, abort);\n    let requiredHead: string | Promise<string> | undefined;\n    let uncoveredMinWatermark: string | undefined;\n    let committed = false;\n    try {\n      await this.#cleanupGuard.runWhilePurgeBlocked(() => {\n        this.#throwIfAborted(abort.signal);\n        // The router's eligibility inspection happens before this async guard\n        // is acquired. Recheck the exact boundary here: an in-flight purge can\n        // have advanced the minimum while registration waited. Once added to\n        // the Forwarder, the subscriber's ACK prevents any later purge from\n        // crossing this boundary.\n        const plan = this.#reader.plan(subscriber.watermark);\n        if (plan.kind === 'too-old') {\n          uncoveredMinWatermark = plan.minWatermark;\n          return;\n        }\n        requiredHead = captureRequiredHead();\n        this.#forwarder.add(subscriber);\n        committed = true;\n      });\n    } catch (error) {\n      this.#catchups.delete(subscriber);\n      if (abort.signal.aborted) {\n        return {kind: 'handled'};\n      }\n      if (!committed) {\n        // Nothing was committed to SQLite -- the subscriber never reached\n        // Forwarder.add() -- so PG catchup is still available. Failing here\n        // would send the client a terminal ['error', ...], which\n        // IncrementalSyncer answers with a full litestream replica restore,\n        // for a fallback that was still open. Trip the breaker as well: this\n        // is a reader failure like any other, and without it the retry picks\n        // SQLite again and the reset repeats.\n        this.#onFailure?.('reader-error');\n        return {kind: 'declined', error};\n      }\n      this.#lc.error?.(\n        `error while registering SQLite catchup subscriber ${subscriber.id}`,\n        error,\n      );\n      subscriber.fail(error);\n      return {kind: 'handled'};\n    }\n    if (uncoveredMinWatermark !== undefined) {\n      this.#catchups.delete(subscriber);\n      return {kind: 'uncovered', minWatermark: uncoveredMinWatermark};\n    }\n\n    void this.#run(\n      subscriber,\n      requiredHead as string | Promise<string>,\n      abort,\n      request.logWarm,\n    );\n    return {kind: 'registered'};\n  }\n\n  /**\n   * Notes that the change-log writer has committed `watermark`, i.e. that the\n   * log's head has advanced to it. The writer runs in this process, so this is\n   * the event itself rather than a subscriber's ACK of it.\n   *\n   * It is a wakeup, not an authority: `plan()` still decides what can be read.\n   * A notification that never arrives costs the barrier a poll interval, and one\n   * that arrives early costs an extra `plan()` call.\n   */\n  onChangeLogCommit(watermark: string): void {\n    for (const waiter of this.#commitWaiters) {\n      if (watermark >= waiter.watermark) {\n        this.#commitWaiters.delete(waiter);\n        waiter.resolve();\n      }\n    }\n  }\n\n  remove(subscriber: Subscriber): void {\n    this.#catchups.get(subscriber)?.abort();\n    this.#catchups.delete(subscriber);\n    this.#forwarder.remove(subscriber);\n  }\n\n  close(): void {\n    if (this.#closed) {\n      return;\n    }\n    this.#closed = true;\n    for (const [subscriber, abort] of this.#catchups) {\n      abort.abort();\n      this.#forwarder.remove(subscriber);\n    }\n    this.#catchups.clear();\n    this.#reader.close();\n  }\n\n  [Symbol.dispose](): void {\n    this.close();\n  }\n\n  async #run(\n    subscriber: Subscriber,\n    requiredHead: string | Promise<string>,\n    abort: AbortController,\n    logWarm: boolean | undefined,\n  ): Promise<void> {\n    const {signal} = abort;\n    const catchupStart = this.#now();\n    let outcome = 'aborted';\n    let backlogPeakBytes = 0;\n    try {\n      const requiredHeadStart = this.#now();\n      const required = await this.#awaitRequiredHead(requiredHead, signal);\n      const requiredHeadWaitMs = this.#now() - requiredHeadStart;\n      if (requiredHeadWaitMs > this.#barrierTimeoutMs) {\n        this.#lc.info?.(\n          `waited ${requiredHeadWaitMs} ms for the forwarded transaction to ` +\n            `commit before starting the SQLite barrier for ${subscriber.id}`,\n        );\n      }\n      // The barrier bounds replica lag, not upstream transaction duration, so\n      // its deadline starts once the required head is known. Sharing one\n      // deadline with the wait above would fail subscribers that registered\n      // during a transaction longer than barrierTimeoutMs, however current\n      // the replica is.\n      const deadline = this.#now() + this.#barrierTimeoutMs;\n      const barrierStart = this.#now();\n      let plan: CatchupPlan;\n      try {\n        plan = await this.#waitForPlan(subscriber, required, deadline, signal);\n      } finally {\n        // Record failed and aborted barriers too; their wait distribution is\n        // at least as operationally important as the successful path.\n        this.#barrierWaitDuration.recordMs(this.#now() - barrierStart);\n      }\n      this.#throwIfAborted(signal);\n\n      if (plan.kind === 'too-old') {\n        outcome = 'too-old';\n        const message =\n          `earliest supported watermark is ${plan.minWatermark} ` +\n          `(requested ${subscriber.watermark})`;\n        this.#lc.warn?.(\n          `rejecting subscriber at watermark ${subscriber.watermark} ` +\n            `(earliest watermark: ${plan.minWatermark})`,\n        );\n        subscriber.close(ErrorType.WatermarkTooOld, message);\n        return;\n      }\n\n      let count = 0;\n      let bytes = 0;\n      const start = this.#now();\n      if (plan.kind === 'range') {\n        let lastBatchConsumed: Promise<unknown> | undefined;\n        for await (const changes of this.#reader.read(\n          subscriber.watermark,\n          plan.headWatermark,\n          this.#batchSize,\n          signal,\n        )) {\n          const waitStart = this.#now();\n          await lastBatchConsumed;\n          const elapsed = this.#now() - waitStart;\n          if (lastBatchConsumed) {\n            this.#lc[elapsed > 100 ? 'info' : 'debug']?.(\n              `waited ${elapsed.toFixed(3)} ms for ${subscriber.id} to consume ` +\n                `the previous SQLite catchup batch`,\n            );\n          }\n          this.#throwIfAborted(signal);\n          for (const change of changes) {\n            lastBatchConsumed = subscriber.catchup(change);\n            count++;\n            bytes += Buffer.byteLength(change[2]);\n          }\n          backlogPeakBytes = Math.max(\n            backlogPeakBytes,\n            subscriber.getStats().backlogBytes,\n          );\n        }\n        await lastBatchConsumed;\n        outcome = 'range';\n      } else {\n        outcome = 'ahead';\n        this.#lc.warn?.(\n          `subscriber ${subscriber.id} at watermark ${subscriber.watermark} ` +\n            `is ahead of the SQLite change-log head ${plan.headWatermark}; ` +\n            `waiting for the replica to catch up`,\n        );\n      }\n\n      this.#throwIfAborted(signal);\n      this.#lc.info?.(\n        `caught up ${subscriber.id} from SQLite with ${count} changes ` +\n          `(${this.#now() - start} ms)`,\n      );\n      const attributes = {\n        classification: outcome,\n        log_warm: logWarm ?? 'unknown',\n      };\n      this.#catchupRows.add(count, attributes);\n      this.#catchupBytes.add(bytes, attributes);\n      // Keep buffering live sends until the asynchronous backlog drain has\n      // established its ordering boundary.\n      void subscriber.setCaughtUp();\n    } catch (error) {\n      if (signal.aborted) {\n        return;\n      }\n      if (error instanceof SQLiteChangeLogBarrierError) {\n        if (error instanceof SQLiteChangeLogBarrierTimeoutError) {\n          this.#barrierTimeouts.add(1);\n          outcome = 'barrier-timeout';\n          this.#onFailure?.('barrier-timeout');\n        } else {\n          // No #onFailure: a backlog high water mark is a property of this\n          // one subscriber's consumption, not of the log. Tripping the\n          // process-wide breaker for it would take every task in the shard\n          // off SQLite, which a client that reconnects and stalls again\n          // could hold open indefinitely.\n          outcome = 'barrier-backlog';\n        }\n        // Giving up on the barrier means the replica has not caught up *yet*,\n        // not that it cannot serve this subscriber. End the subscription\n        // cleanly so the client reconnects and retries: IncrementalSyncer\n        // treats any ['error', ...] message as terminal and restores a fresh\n        // replica from litestream, whereas a clean end backs off and\n        // re-subscribes. If retries keep failing until the change log is purged\n        // past the subscriber's watermark, plan() returns 'too-old', which is\n        // terminal by design.\n        this.#lc.warn?.(\n          `ending subscription for ${subscriber.id} to retry SQLite catchup`,\n          error,\n        );\n        subscriber.close();\n        return;\n      }\n      outcome = 'reader-error';\n      this.#onFailure?.('reader-error');\n      this.#lc.error?.(\n        `error while catching up subscriber ${subscriber.id} from SQLite`,\n        error,\n      );\n      subscriber.fail(error);\n    } finally {\n      backlogPeakBytes = Math.max(\n        backlogPeakBytes,\n        subscriber.getStats().backlogBytes,\n      );\n      const attributes = {\n        classification: outcome,\n        log_warm: logWarm ?? 'unknown',\n      };\n      this.#catchupResults.add(1, attributes);\n      this.#catchupDuration.recordMs(this.#now() - catchupStart, attributes);\n      this.#catchupBacklogPeak.record(backlogPeakBytes, attributes);\n      if (this.#catchups.get(subscriber) === abort) {\n        this.#catchups.delete(subscriber);\n      }\n    }\n  }\n\n  /**\n   * Waits for the transaction that was in flight at registration to finish.\n   *\n   * This wait is bounded by the upstream transaction rather than by\n   * `barrierTimeoutMs`: the completion settles on both commit and rollback,\n   * and an interrupted change stream forwards a synthetic rollback, so it\n   * always settles. Aborting -- the subscriber disconnecting or the service\n   * shutting down -- is what releases it early.\n   */\n  async #awaitRequiredHead(\n    requiredHead: string | Promise<string>,\n    signal: AbortSignal,\n  ): Promise<string> {\n    if (typeof requiredHead === 'string') {\n      return requiredHead;\n    }\n    this.#throwIfAborted(signal);\n    let onAbort: (() => void) | undefined;\n    try {\n      return await Promise.race([\n        requiredHead,\n        new Promise<never>((_, reject) => {\n          onAbort = () =>\n            reject(new AbortError('SQLite change-log catchup aborted'));\n          signal.addEventListener('abort', onAbort, {once: true});\n        }),\n      ]);\n    } finally {\n      if (onAbort) {\n        signal.removeEventListener('abort', onAbort);\n      }\n    }\n  }\n\n  async #waitForPlan(\n    subscriber: Subscriber,\n    requiredHead: string,\n    deadline: number,\n    signal: AbortSignal,\n  ): Promise<Exclude<CatchupPlan, {kind: 'not-ready'}>> {\n    // Race backlog growth once around the whole polling loop. Attaching the\n    // same unresolved promise to every per-poll race would retain one reaction\n    // per iteration until the subscriber's backlog eventually filled.\n    const backlogFull = subscriber.whenBacklogFull();\n    const barrier = new AbortController();\n    const abortBarrier = () => barrier.abort();\n    signal.addEventListener('abort', abortBarrier, {once: true});\n    if (signal.aborted) {\n      barrier.abort();\n    }\n\n    let observedHead = subscriber.watermark;\n    try {\n      const planReady = (async () => {\n        while (true) {\n          this.#throwIfAborted(barrier.signal);\n          const plan = this.#reader.plan(subscriber.watermark);\n          // A not-ready log has no head to compare, so it can never satisfy\n          // the required head: keep waiting for the writer to create and\n          // reconcile it, and let the barrier deadline end the subscription\n          // cleanly for a retry. Selection declines a not-ready log before a\n          // subscriber gets here, and neither purging nor reconciliation can\n          // empty a log that had content, so this is a belt-and-braces path.\n          if (plan.kind !== 'not-ready') {\n            observedHead = plan.headWatermark;\n            if (plan.headWatermark >= requiredHead) {\n              return plan;\n            }\n          }\n          const remaining = deadline - this.#now();\n          if (remaining <= 0) {\n            throw new SQLiteChangeLogBarrierTimeoutError(\n              `timed out waiting for SQLite head ${observedHead} to ` +\n                `reach required head ${requiredHead}`,\n            );\n          }\n          await this.#awaitChangeLogProgress(\n            requiredHead,\n            remaining,\n            barrier.signal,\n          );\n        }\n      })();\n\n      const backlogOverflow = backlogFull.promise.then(() => {\n        this.#throwIfAborted(signal);\n        // close() also resolves backlog waiters so none are stranded. The\n        // backlog is cleared first, which distinguishes close from overflow.\n        if (!subscriber.backlogFull) {\n          return new Promise<never>(() => {});\n        }\n        this.#barrierWakeups.add(1, {'wakeup.source': 'backlog'});\n        // Bytes, not time, are what the barrier actually costs: past the high\n        // water mark this subscriber's send() no longer resolves, so it holds\n        // up every flush and can stall the replica this barrier waits on.\n        this.#barrierBacklogOverflows.add(1);\n        throw new SQLiteChangeLogBarrierBacklogError(\n          `backlog for subscriber ${subscriber.id} reached its high water ` +\n            `mark while waiting for SQLite head ${observedHead} to ` +\n            `reach required head ${requiredHead}`,\n        );\n      });\n\n      return await Promise.race([planReady, backlogOverflow]);\n    } finally {\n      signal.removeEventListener('abort', abortBarrier);\n      barrier.abort();\n      backlogFull.cancel();\n    }\n  }\n\n  /**\n   * Waits for the change-log writer to commit `requiredHead`, or the poll\n   * interval as a backstop.\n   *\n   * No notification can be missed by registering after `plan()` was read: the\n   * notification follows the commit it reports, so if the writer had already\n   * committed `requiredHead`, `plan()` would have seen it.\n   */\n  async #awaitChangeLogProgress(\n    requiredHead: string,\n    remainingMs: number,\n    signal: AbortSignal,\n  ): Promise<void> {\n    const committed = resolver<void>();\n    const waiter = {watermark: requiredHead, resolve: committed.resolve};\n    this.#commitWaiters.add(waiter);\n    // Scopes the backstop timer to this wait so that a commit cancels it rather\n    // than leaving it to fire against a barrier that has already moved on.\n    const poll = new AbortController();\n    const abortPoll = () => poll.abort();\n    signal.addEventListener('abort', abortPoll, {once: true});\n    try {\n      const wokenBy = await Promise.race([\n        committed.promise.then(() => 'commit' as const),\n        this.#sleep(\n          Math.min(this.#barrierPollIntervalMs, remainingMs),\n          poll.signal,\n        ).then(() => 'poll' as const),\n      ]);\n      this.#barrierWakeups.add(1, {'wakeup.source': wokenBy});\n    } finally {\n      this.#commitWaiters.delete(waiter);\n      signal.removeEventListener('abort', abortPoll);\n      poll.abort();\n    }\n  }\n\n  #throwIfAborted(signal: AbortSignal): void {\n    if (this.#closed || signal.aborted) {\n      throw new AbortError('SQLite change-log catchup aborted');\n    }\n  }\n}\n\ntype CommitWaiter = {watermark: string; resolve: () => void};\n\n/**\n * A barrier that gave up on the replica reaching the required head. Both\n * reasons mean \"not yet\", not \"never\", so both end the subscription cleanly\n * for a retry rather than failing it.\n */\nexport class SQLiteChangeLogBarrierError extends Error {}\n\n/** The replica did not reach the required head before the deadline. */\nexport class SQLiteChangeLogBarrierTimeoutError extends SQLiteChangeLogBarrierError {\n  readonly name = 'SQLiteChangeLogBarrierTimeoutError';\n}\n\n/** Waiting any longer would have cost more than reconnecting. */\nexport class SQLiteChangeLogBarrierBacklogError extends SQLiteChangeLogBarrierError {\n  readonly name = 'SQLiteChangeLogBarrierBacklogError';\n}\n"],"mappings":";;;;;AAuCA,IAAM,mCAAmC;AAmCzC,IAAM,qBAAkD,EACtD,uBAAsB,aAAY,QAAQ,QAAQ,SAAS,CAAC,EAC9D;;;;;;;;;;AAWA,IAAa,yBAAb,MAA0D;CACxD;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAGA,mBAA4B,mBAC1B,eACA,sCACA,0EACF;CACA,2BAAoC,mBAClC,eACA,+CACA,sIAEF;CACA,kBAA2B,mBACzB,eACA,qCACA,iLAGF;CACA,kBAA2B,mBACzB,eACA,qCACA,0CACF;CACA,eAAwB,mBACtB,eACA,kCACA,wDACF;CACA,gBAAyB,mBACvB,eACA,mCACA;EACE,aAAa;EACb,MAAM;CACR,CACF;CACA,mBAA4B,4BAC1B,eACA,sCACA,0CACF;CACA,uBAAgC,4BAC9B,eACA,2CACA,yDACF;CACA,sBAA+B,0BAC7B,eACA,gDACA;EACE,aACE;EACF,MAAM;EACN,kBAAkB;GAChB;GAAG;GAAM;GAAQ;GAAQ;GAAS;GAAW;GAAW;EAC1D;CACF,CACF;CACA,4BAAqB,IAAI,IAAiC;CAC1D,iCAA0B,IAAI,IAAkB;CAChD,UAAU;CAEV,YACE,IACA,WACA,QACA,MACA;EACA,KAAKA,MAAM,GAAG,YAAY,aAAa,2BAA2B;EAClE,KAAKC,aAAa;EAClB,KAAKC,UAAU;EACf,KAAKC,aAAa,KAAK;EACvB,KAAKC,oBAAoB,KAAK;EAC9B,KAAKC,yBACH,KAAK,yBAAyB;EAChC,KAAKC,gBAAgB,KAAK,gBAAgB;EAC1C,KAAKC,SAAS,KAAK,SAAS;EAC5B,KAAKC,OAAO,KAAK,OAAO,KAAK;EAC7B,KAAKC,aAAa,KAAK;CACzB;;;;;;CAOA,MAAM,QACJ,YACA,qBACA,UAAyC,CAAC,GACG;EAC7C,IAAI,KAAKY,SAAS;GAChB,WAAW,KAAK,IAAI,WAAW,qCAAqC,CAAC;GACrE,OAAO,EAAC,MAAM,UAAS;EACzB;EAEA,MAAM,QAAQ,IAAI,gBAAgB;EAClC,KAAKF,UAAU,IAAI,YAAY,KAAK;EACpC,IAAI;EACJ,IAAI;EACJ,IAAI,YAAY;EAChB,IAAI;GACF,MAAM,KAAKb,cAAc,2BAA2B;IAClD,KAAKgB,gBAAgB,MAAM,MAAM;IAMjC,MAAM,OAAO,KAAKpB,QAAQ,KAAK,WAAW,SAAS;IACnD,IAAI,KAAK,SAAS,WAAW;KAC3B,wBAAwB,KAAK;KAC7B;IACF;IACA,eAAe,oBAAoB;IACnC,KAAKD,WAAW,IAAI,UAAU;IAC9B,YAAY;GACd,CAAC;EACH,SAAS,OAAO;GACd,KAAKkB,UAAU,OAAO,UAAU;GAChC,IAAI,MAAM,OAAO,SACf,OAAO,EAAC,MAAM,UAAS;GAEzB,IAAI,CAAC,WAAW;IAQd,KAAKV,aAAa,cAAc;IAChC,OAAO;KAAC,MAAM;KAAY;IAAK;GACjC;GACA,KAAKT,IAAI,QACP,qDAAqD,WAAW,MAChE,KACF;GACA,WAAW,KAAK,KAAK;GACrB,OAAO,EAAC,MAAM,UAAS;EACzB;EACA,IAAI,0BAA0B,KAAA,GAAW;GACvC,KAAKmB,UAAU,OAAO,UAAU;GAChC,OAAO;IAAC,MAAM;IAAa,cAAc;GAAqB;EAChE;EAEA,KAAUI,KACR,YACA,cACA,OACA,QAAQ,OACV;EACA,OAAO,EAAC,MAAM,aAAY;CAC5B;;;;;;;;;;CAWA,kBAAkB,WAAyB;EACzC,KAAK,MAAM,UAAU,KAAKH,gBACxB,IAAI,aAAa,OAAO,WAAW;GACjC,KAAKA,eAAe,OAAO,MAAM;GACjC,OAAO,QAAQ;EACjB;CAEJ;CAEA,OAAO,YAA8B;EACnC,KAAKD,UAAU,IAAI,UAAU,GAAG,MAAM;EACtC,KAAKA,UAAU,OAAO,UAAU;EAChC,KAAKlB,WAAW,OAAO,UAAU;CACnC;CAEA,QAAc;EACZ,IAAI,KAAKoB,SACP;EAEF,KAAKA,UAAU;EACf,KAAK,MAAM,CAAC,YAAY,UAAU,KAAKF,WAAW;GAChD,MAAM,MAAM;GACZ,KAAKlB,WAAW,OAAO,UAAU;EACnC;EACA,KAAKkB,UAAU,MAAM;EACrB,KAAKjB,QAAQ,MAAM;CACrB;CAEA,CAAC,OAAO,WAAiB;EACvB,KAAK,MAAM;CACb;CAEA,MAAMqB,KACJ,YACA,cACA,OACA,SACe;EACf,MAAM,EAAC,WAAU;EACjB,MAAM,eAAe,KAAKf,KAAK;EAC/B,IAAI,UAAU;EACd,IAAI,mBAAmB;EACvB,IAAI;GACF,MAAM,oBAAoB,KAAKA,KAAK;GACpC,MAAM,WAAW,MAAM,KAAKgB,mBAAmB,cAAc,MAAM;GACnE,MAAM,qBAAqB,KAAKhB,KAAK,IAAI;GACzC,IAAI,qBAAqB,KAAKJ,mBAC5B,KAAKJ,IAAI,OACP,UAAU,mBAAmB,qFACsB,WAAW,IAChE;GAOF,MAAM,WAAW,KAAKQ,KAAK,IAAI,KAAKJ;GACpC,MAAM,eAAe,KAAKI,KAAK;GAC/B,IAAI;GACJ,IAAI;IACF,OAAO,MAAM,KAAKiB,aAAa,YAAY,UAAU,UAAU,MAAM;GACvE,UAAU;IAGR,KAAKR,qBAAqB,SAAS,KAAKT,KAAK,IAAI,YAAY;GAC/D;GACA,KAAKc,gBAAgB,MAAM;GAE3B,IAAI,KAAK,SAAS,WAAW;IAC3B,UAAU;IACV,MAAM,UACJ,mCAAmC,KAAK,aAAa,cACvC,WAAW,UAAU;IACrC,KAAKtB,IAAI,OACP,qCAAqC,WAAW,UAAU,wBAChC,KAAK,aAAa,EAC9C;IACA,WAAW,MAAM,GAA2B,OAAO;IACnD;GACF;GAEA,IAAI,QAAQ;GACZ,IAAI,QAAQ;GACZ,MAAM,QAAQ,KAAKQ,KAAK;GACxB,IAAI,KAAK,SAAS,SAAS;IACzB,IAAI;IACJ,WAAW,MAAM,WAAW,KAAKN,QAAQ,KACvC,WAAW,WACX,KAAK,eACL,KAAKC,YACL,MACF,GAAG;KACD,MAAM,YAAY,KAAKK,KAAK;KAC5B,MAAM;KACN,MAAM,UAAU,KAAKA,KAAK,IAAI;KAC9B,IAAI,mBACF,KAAKR,IAAI,UAAU,MAAM,SAAS,WAChC,UAAU,QAAQ,QAAQ,CAAC,EAAE,UAAU,WAAW,GAAG,8CAEvD;KAEF,KAAKsB,gBAAgB,MAAM;KAC3B,KAAK,MAAM,UAAU,SAAS;MAC5B,oBAAoB,WAAW,QAAQ,MAAM;MAC7C;MACA,SAAS,OAAO,WAAW,OAAO,EAAE;KACtC;KACA,mBAAmB,KAAK,IACtB,kBACA,WAAW,SAAS,EAAE,YACxB;IACF;IACA,MAAM;IACN,UAAU;GACZ,OAAO;IACL,UAAU;IACV,KAAKtB,IAAI,OACP,cAAc,WAAW,GAAG,gBAAgB,WAAW,UAAU,0CACrB,KAAK,cAAc,sCAEjE;GACF;GAEA,KAAKsB,gBAAgB,MAAM;GAC3B,KAAKtB,IAAI,OACP,aAAa,WAAW,GAAG,oBAAoB,MAAM,YAC/C,KAAKQ,KAAK,IAAI,MAAM,KAC5B;GACA,MAAM,aAAa;IACjB,gBAAgB;IAChB,UAAU,WAAW;GACvB;GACA,KAAKM,aAAa,IAAI,OAAO,UAAU;GACvC,KAAKC,cAAc,IAAI,OAAO,UAAU;GAGxC,WAAgB,YAAY;EAC9B,SAAS,OAAO;GACd,IAAI,OAAO,SACT;GAEF,IAAI,iBAAiB,6BAA6B;IAChD,IAAI,iBAAiB,oCAAoC;KACvD,KAAKL,iBAAiB,IAAI,CAAC;KAC3B,UAAU;KACV,KAAKD,aAAa,iBAAiB;IACrC,OAME,UAAU;IAUZ,KAAKT,IAAI,OACP,2BAA2B,WAAW,GAAG,2BACzC,KACF;IACA,WAAW,MAAM;IACjB;GACF;GACA,UAAU;GACV,KAAKS,aAAa,cAAc;GAChC,KAAKT,IAAI,QACP,sCAAsC,WAAW,GAAG,eACpD,KACF;GACA,WAAW,KAAK,KAAK;EACvB,UAAU;GACR,mBAAmB,KAAK,IACtB,kBACA,WAAW,SAAS,EAAE,YACxB;GACA,MAAM,aAAa;IACjB,gBAAgB;IAChB,UAAU,WAAW;GACvB;GACA,KAAKa,gBAAgB,IAAI,GAAG,UAAU;GACtC,KAAKG,iBAAiB,SAAS,KAAKR,KAAK,IAAI,cAAc,UAAU;GACrE,KAAKU,oBAAoB,OAAO,kBAAkB,UAAU;GAC5D,IAAI,KAAKC,UAAU,IAAI,UAAU,MAAM,OACrC,KAAKA,UAAU,OAAO,UAAU;EAEpC;CACF;;;;;;;;;;CAWA,MAAMK,mBACJ,cACA,QACiB;EACjB,IAAI,OAAO,iBAAiB,UAC1B,OAAO;EAET,KAAKF,gBAAgB,MAAM;EAC3B,IAAI;EACJ,IAAI;GACF,OAAO,MAAM,QAAQ,KAAK,CACxB,cACA,IAAI,SAAgB,GAAG,WAAW;IAChC,gBACE,OAAO,IAAI,WAAW,mCAAmC,CAAC;IAC5D,OAAO,iBAAiB,SAAS,SAAS,EAAC,MAAM,KAAI,CAAC;GACxD,CAAC,CACH,CAAC;EACH,UAAU;GACR,IAAI,SACF,OAAO,oBAAoB,SAAS,OAAO;EAE/C;CACF;CAEA,MAAMG,aACJ,YACA,cACA,UACA,QACoD;EAIpD,MAAM,cAAc,WAAW,gBAAgB;EAC/C,MAAM,UAAU,IAAI,gBAAgB;EACpC,MAAM,qBAAqB,QAAQ,MAAM;EACzC,OAAO,iBAAiB,SAAS,cAAc,EAAC,MAAM,KAAI,CAAC;EAC3D,IAAI,OAAO,SACT,QAAQ,MAAM;EAGhB,IAAI,eAAe,WAAW;EAC9B,IAAI;GACF,MAAM,aAAa,YAAY;IAC7B,OAAO,MAAM;KACX,KAAKH,gBAAgB,QAAQ,MAAM;KACnC,MAAM,OAAO,KAAKpB,QAAQ,KAAK,WAAW,SAAS;KAOnD,IAAI,KAAK,SAAS,aAAa;MAC7B,eAAe,KAAK;MACpB,IAAI,KAAK,iBAAiB,cACxB,OAAO;KAEX;KACA,MAAM,YAAY,WAAW,KAAKM,KAAK;KACvC,IAAI,aAAa,GACf,MAAM,IAAI,mCACR,qCAAqC,aAAa,0BACzB,cAC3B;KAEF,MAAM,KAAKkB,wBACT,cACA,WACA,QAAQ,MACV;IACF;GACF,GAAG;GAEH,MAAM,kBAAkB,YAAY,QAAQ,WAAW;IACrD,KAAKJ,gBAAgB,MAAM;IAG3B,IAAI,CAAC,WAAW,aACd,OAAO,IAAI,cAAqB,CAAC,CAAC;IAEpC,KAAKV,gBAAgB,IAAI,GAAG,EAAC,iBAAiB,UAAS,CAAC;IAIxD,KAAKD,yBAAyB,IAAI,CAAC;IACnC,MAAM,IAAI,mCACR,0BAA0B,WAAW,GAAG,6DACA,aAAa,0BAC5B,cAC3B;GACF,CAAC;GAED,OAAO,MAAM,QAAQ,KAAK,CAAC,WAAW,eAAe,CAAC;EACxD,UAAU;GACR,OAAO,oBAAoB,SAAS,YAAY;GAChD,QAAQ,MAAM;GACd,YAAY,OAAO;EACrB;CACF;;;;;;;;;CAUA,MAAMe,wBACJ,cACA,aACA,QACe;EACf,MAAM,YAAY,SAAe;EACjC,MAAM,SAAS;GAAC,WAAW;GAAc,SAAS,UAAU;EAAO;EACnE,KAAKN,eAAe,IAAI,MAAM;EAG9B,MAAM,OAAO,IAAI,gBAAgB;EACjC,MAAM,kBAAkB,KAAK,MAAM;EACnC,OAAO,iBAAiB,SAAS,WAAW,EAAC,MAAM,KAAI,CAAC;EACxD,IAAI;GACF,MAAM,UAAU,MAAM,QAAQ,KAAK,CACjC,UAAU,QAAQ,WAAW,QAAiB,GAC9C,KAAKb,OACH,KAAK,IAAI,KAAKF,wBAAwB,WAAW,GACjD,KAAK,MACP,EAAE,WAAW,MAAe,CAC9B,CAAC;GACD,KAAKO,gBAAgB,IAAI,GAAG,EAAC,iBAAiB,QAAO,CAAC;EACxD,UAAU;GACR,KAAKQ,eAAe,OAAO,MAAM;GACjC,OAAO,oBAAoB,SAAS,SAAS;GAC7C,KAAK,MAAM;EACb;CACF;CAEA,gBAAgB,QAA2B;EACzC,IAAI,KAAKC,WAAW,OAAO,SACzB,MAAM,IAAI,WAAW,mCAAmC;CAE5D;AACF;;;;;;AASA,IAAa,8BAAb,cAAiD,MAAM,CAAC;;AAGxD,IAAa,qCAAb,cAAwD,4BAA4B;CAClF,OAAgB;AAClB;;AAGA,IAAa,qCAAb,cAAwD,4BAA4B;CAClF,OAAgB;AAClB"}
+{"version":3,"file":"sqlite-change-log-catchup.js","names":[],"sources":["../../../../../../zero-cache/src/services/change-streamer/sqlite-change-log-catchup.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {AbortError} from '../../../../shared/src/abort-error.ts';\nimport {resolver} from '../../../../shared/src/resolver.ts';\nimport {sleep} from '../../../../shared/src/sleep.ts';\nimport {\n  getOrCreateCounter,\n  getOrCreateLatencyHistogram,\n  getOrCreateValueHistogram,\n} from '../../observability/metrics.ts';\nimport type {WatermarkedChange} from './change-streamer.ts';\nimport * as ErrorType from './error-type-enum.ts';\nimport type {Forwarder} from './forwarder.ts';\nimport type {CatchupPlan} from './sqlite-change-log-reader.ts';\nimport type {Subscriber} from './subscriber.ts';\n\nexport interface SQLiteChangeLogCatchupReader {\n  plan(fromWatermark: string): CatchupPlan;\n  read(\n    fromWatermark: string,\n    throughWatermark: string,\n    batchSize: number,\n    signal?: AbortSignal,\n  ): AsyncIterable<readonly WatermarkedChange[]>;\n  close(): void;\n}\n\n/**\n * Slice 9 replaces this no-op implementation with a guard that waits for an\n * in-flight purge and blocks new purge dispatch while the subscriber's ACK is\n * made visible to the Forwarder.\n */\nexport interface SQLiteChangeLogCleanupGuard {\n  runWhilePurgeBlocked<T>(register: () => T): Promise<T>;\n}\n\n// How long the barrier waits for the change-log writer's commit notification\n// before re-reading the log itself. The notification normally arrives first, so\n// this is a backstop for the windows in which none is coming: the writer is\n// disabled, or it is between stream connections.\nconst DEFAULT_BARRIER_POLL_INTERVAL_MS = 1000;\n\nexport type SQLiteChangeLogCatchupOptions = {\n  batchSize: number;\n  barrierTimeoutMs: number;\n  barrierPollIntervalMs?: number | undefined;\n  cleanupGuard?: SQLiteChangeLogCleanupGuard | undefined;\n  sleep?: typeof sleep | undefined;\n  now?: (() => number) | undefined;\n  /** Opens slice 11's process-local breaker after registration has committed. */\n  onFailure?: ((failure: SQLiteChangeLogCatchupFailure) => void) | undefined;\n};\n\nexport type SQLiteChangeLogCatchupRequest = {\n  /**\n   * Whether the routing warm-up gate classified the log as warm *for this\n   * subscriber*. The coordinator is opened once and reused, so this cannot be\n   * a property of it: `coldReadPercent` serves some subscribers from a log\n   * that is still inside its warm-up window, and the catchup metrics have to\n   * separate those from steady-state serving.\n   */\n  readonly logWarm?: boolean | undefined;\n};\n\nexport type SQLiteChangeLogCatchupFailure = 'barrier-timeout' | 'reader-error';\n\nexport type SQLiteChangeLogCatchupRegistration =\n  | {readonly kind: 'registered'}\n  | {readonly kind: 'uncovered'; readonly minWatermark: string}\n  // Registration failed before the subscriber was committed to SQLite, so PG\n  // catchup is still available and the caller falls back to it.\n  | {readonly kind: 'declined'; readonly error: unknown}\n  // The coordinator closed or failed the subscriber itself.\n  | {readonly kind: 'handled'};\n\nconst NOOP_CLEANUP_GUARD: SQLiteChangeLogCleanupGuard = {\n  runWhilePurgeBlocked: register => Promise.resolve(register()),\n};\n\n/**\n * Coordinates a serving subscriber's gap-free transition from replica-local\n * SQLite catchup to the Forwarder's live stream.\n *\n * Registration and required-head capture happen in one synchronous callback.\n * The subscriber therefore either sees a transaction in SQLite catchup or in\n * its live backlog (duplicates across that boundary are filtered by\n * Subscriber), never in neither place.\n */\nexport class SQLiteChangeLogCatchup implements Disposable {\n  readonly #lc: LogContext;\n  readonly #forwarder: Forwarder;\n  readonly #reader: SQLiteChangeLogCatchupReader;\n  readonly #batchSize: number;\n  readonly #barrierTimeoutMs: number;\n  readonly #barrierPollIntervalMs: number;\n  readonly #cleanupGuard: SQLiteChangeLogCleanupGuard;\n  readonly #sleep: typeof sleep;\n  readonly #now: () => number;\n  readonly #onFailure:\n    | ((failure: SQLiteChangeLogCatchupFailure) => void)\n    | undefined;\n  readonly #barrierTimeouts = getOrCreateCounter(\n    'replication',\n    'sqlite_change_log.barrier_timeouts',\n    'SQLite change-log catchups that timed out waiting for the required head.',\n  );\n  readonly #barrierBacklogOverflows = getOrCreateCounter(\n    'replication',\n    'sqlite_change_log.barrier_backlog_overflows',\n    'SQLite change-log catchups abandoned because the subscriber backlog ' +\n      'reached its high water mark while waiting for the required head.',\n  );\n  readonly #barrierWakeups = getOrCreateCounter(\n    'replication',\n    'sqlite_change_log.barrier_wakeups',\n    'SQLite catchup barrier waits, labeled by what ended the wait. A ' +\n      'population dominated by \"poll\" means the change-log writer\\'s commit ' +\n      'notification is not reaching the barrier.',\n  );\n  readonly #catchupResults = getOrCreateCounter(\n    'replication',\n    'sqlite_change_log.catchup_results',\n    'SQLite catchup subscriptions by outcome.',\n  );\n  readonly #catchupRows = getOrCreateCounter(\n    'replication',\n    'sqlite_change_log.catchup_rows',\n    'Rows served from the SQLite change log during catchup.',\n  );\n  readonly #catchupBytes = getOrCreateCounter(\n    'replication',\n    'sqlite_change_log.catchup_bytes',\n    {\n      description: 'Bytes served from the SQLite change log during catchup.',\n      unit: 'By',\n    },\n  );\n  readonly #catchupDuration = getOrCreateLatencyHistogram(\n    'replication',\n    'sqlite_change_log.catchup_duration',\n    'Duration of a SQLite change-log catchup.',\n  );\n  readonly #barrierWaitDuration = getOrCreateLatencyHistogram(\n    'replication',\n    'sqlite_change_log.barrier_wait_duration',\n    'Time SQLite catchup waits for its pinned required head.',\n  );\n  readonly #catchupBacklogPeak = getOrCreateValueHistogram(\n    'replication',\n    'sqlite_change_log.catchup_backlog_peak_bytes',\n    {\n      description:\n        'Peak live backlog bytes buffered while a subscriber catches up from SQLite.',\n      unit: 'By',\n      bucketBoundaries: [\n        0, 1024, 16_384, 65_536, 262_144, 1_048_576, 4_194_304, 16_777_216,\n      ],\n    },\n  );\n  readonly #catchups = new Map<Subscriber, AbortController>();\n  readonly #commitWaiters = new Set<CommitWaiter>();\n  #closed = false;\n\n  constructor(\n    lc: LogContext,\n    forwarder: Forwarder,\n    reader: SQLiteChangeLogCatchupReader,\n    opts: SQLiteChangeLogCatchupOptions,\n  ) {\n    this.#lc = lc.withContext('component', 'sqlite-change-log-catchup');\n    this.#forwarder = forwarder;\n    this.#reader = reader;\n    this.#batchSize = opts.batchSize;\n    this.#barrierTimeoutMs = opts.barrierTimeoutMs;\n    this.#barrierPollIntervalMs =\n      opts.barrierPollIntervalMs ?? DEFAULT_BARRIER_POLL_INTERVAL_MS;\n    this.#cleanupGuard = opts.cleanupGuard ?? NOOP_CLEANUP_GUARD;\n    this.#sleep = opts.sleep ?? sleep;\n    this.#now = opts.now ?? Date.now;\n    this.#onFailure = opts.onFailure;\n  }\n\n  /**\n   * Registers the subscriber before resolving. Catchup itself continues in\n   * the background so subscribe() does not wait for SQLite to reach the\n   * required head.\n   */\n  async catchup(\n    subscriber: Subscriber,\n    captureRequiredHead: () => string | Promise<string>,\n    request: SQLiteChangeLogCatchupRequest = {},\n  ): Promise<SQLiteChangeLogCatchupRegistration> {\n    if (this.#closed) {\n      subscriber.fail(new AbortError('SQLite change-log catchup is closed'));\n      return {kind: 'handled'};\n    }\n\n    const abort = new AbortController();\n    this.#catchups.set(subscriber, abort);\n    let requiredHead: string | Promise<string> | undefined;\n    let uncoveredMinWatermark: string | undefined;\n    let committed = false;\n    try {\n      await this.#cleanupGuard.runWhilePurgeBlocked(() => {\n        this.#throwIfAborted(abort.signal);\n        // The router's eligibility inspection happens before this async guard\n        // is acquired. Recheck the exact boundary here: an in-flight purge can\n        // have advanced the minimum while registration waited. Once added to\n        // the Forwarder, the subscriber's ACK prevents any later purge from\n        // crossing this boundary.\n        const plan = this.#reader.plan(subscriber.watermark);\n        if (plan.kind === 'too-old') {\n          uncoveredMinWatermark = plan.minWatermark;\n          return;\n        }\n        requiredHead = captureRequiredHead();\n        this.#forwarder.add(subscriber);\n        committed = true;\n      });\n    } catch (error) {\n      this.#catchups.delete(subscriber);\n      if (abort.signal.aborted) {\n        return {kind: 'handled'};\n      }\n      if (!committed) {\n        // Nothing was committed to SQLite -- the subscriber never reached\n        // Forwarder.add() -- so PG catchup is still available. Failing here\n        // would send the client a terminal ['error', ...], which\n        // IncrementalSyncer answers with a full litestream replica restore,\n        // for a fallback that was still open. Trip the breaker as well: this\n        // is a reader failure like any other, and without it the retry picks\n        // SQLite again and the reset repeats.\n        this.#onFailure?.('reader-error');\n        return {kind: 'declined', error};\n      }\n      this.#lc.error?.(\n        `error while registering SQLite catchup subscriber ${subscriber.id}`,\n        error,\n      );\n      subscriber.fail(error);\n      return {kind: 'handled'};\n    }\n    if (uncoveredMinWatermark !== undefined) {\n      this.#catchups.delete(subscriber);\n      return {kind: 'uncovered', minWatermark: uncoveredMinWatermark};\n    }\n\n    void this.#run(\n      subscriber,\n      requiredHead as string | Promise<string>,\n      abort,\n      request.logWarm,\n    );\n    return {kind: 'registered'};\n  }\n\n  /**\n   * Notes that the change-log writer has committed `watermark`, i.e. that the\n   * log's head has advanced to it. The writer runs in this process, so this is\n   * the event itself rather than a subscriber's ACK of it.\n   *\n   * It is a wakeup, not an authority: `plan()` still decides what can be read.\n   * A notification that never arrives costs the barrier a poll interval, and one\n   * that arrives early costs an extra `plan()` call.\n   */\n  onChangeLogCommit(watermark: string): void {\n    for (const waiter of this.#commitWaiters) {\n      if (watermark >= waiter.watermark) {\n        this.#commitWaiters.delete(waiter);\n        waiter.resolve();\n      }\n    }\n  }\n\n  remove(subscriber: Subscriber): void {\n    this.#catchups.get(subscriber)?.abort();\n    this.#catchups.delete(subscriber);\n    this.#forwarder.remove(subscriber);\n  }\n\n  close(): void {\n    if (this.#closed) {\n      return;\n    }\n    this.#closed = true;\n    for (const [subscriber, abort] of this.#catchups) {\n      abort.abort();\n      this.#forwarder.remove(subscriber);\n    }\n    this.#catchups.clear();\n    this.#reader.close();\n  }\n\n  [Symbol.dispose](): void {\n    this.close();\n  }\n\n  async #run(\n    subscriber: Subscriber,\n    requiredHead: string | Promise<string>,\n    abort: AbortController,\n    logWarm: boolean | undefined,\n  ): Promise<void> {\n    const {signal} = abort;\n    const catchupStart = this.#now();\n    let outcome = 'aborted';\n    let backlogPeakBytes = 0;\n    try {\n      const requiredHeadStart = this.#now();\n      const required = await this.#awaitRequiredHead(requiredHead, signal);\n      const requiredHeadWaitMs = this.#now() - requiredHeadStart;\n      if (requiredHeadWaitMs > this.#barrierTimeoutMs) {\n        this.#lc.info?.(\n          `waited ${requiredHeadWaitMs} ms for the forwarded transaction to ` +\n            `commit before starting the SQLite barrier for ${subscriber.id}`,\n        );\n      }\n      // The barrier bounds replica lag, not upstream transaction duration, so\n      // its deadline starts once the required head is known. Sharing one\n      // deadline with the wait above would fail subscribers that registered\n      // during a transaction longer than barrierTimeoutMs, however current\n      // the replica is.\n      const deadline = this.#now() + this.#barrierTimeoutMs;\n      const barrierStart = this.#now();\n      let plan: CatchupPlan;\n      try {\n        plan = await this.#waitForPlan(subscriber, required, deadline, signal);\n      } finally {\n        // Record failed and aborted barriers too; their wait distribution is\n        // at least as operationally important as the successful path.\n        this.#barrierWaitDuration.recordMs(this.#now() - barrierStart);\n      }\n      this.#throwIfAborted(signal);\n\n      if (plan.kind === 'too-old') {\n        outcome = 'too-old';\n        const message =\n          `earliest supported watermark is ${plan.minWatermark} ` +\n          `(requested ${subscriber.watermark})`;\n        this.#lc.warn?.(\n          `rejecting subscriber at watermark ${subscriber.watermark} ` +\n            `(earliest watermark: ${plan.minWatermark})`,\n        );\n        subscriber.close(ErrorType.WatermarkTooOld, message);\n        return;\n      }\n\n      let count = 0;\n      let bytes = 0;\n      const start = this.#now();\n      if (plan.kind === 'range') {\n        let lastBatchConsumed: Promise<unknown> | undefined;\n        for await (const changes of this.#reader.read(\n          subscriber.watermark,\n          plan.headWatermark,\n          this.#batchSize,\n          signal,\n        )) {\n          const waitStart = this.#now();\n          await lastBatchConsumed;\n          const elapsed = this.#now() - waitStart;\n          if (lastBatchConsumed) {\n            this.#lc[elapsed > 100 ? 'info' : 'debug']?.(\n              `waited ${elapsed.toFixed(3)} ms for ${subscriber.id} to consume ` +\n                `the previous SQLite catchup batch`,\n            );\n          }\n          this.#throwIfAborted(signal);\n          for (const change of changes) {\n            lastBatchConsumed = subscriber.catchup(change);\n            count++;\n            bytes += Buffer.byteLength(change[2]);\n          }\n          backlogPeakBytes = Math.max(\n            backlogPeakBytes,\n            subscriber.getStats().backlogBytes,\n          );\n        }\n        await lastBatchConsumed;\n        outcome = 'range';\n      } else {\n        outcome = 'ahead';\n        this.#lc.warn?.(\n          `subscriber ${subscriber.id} at watermark ${subscriber.watermark} ` +\n            `is ahead of the SQLite change-log head ${plan.headWatermark}; ` +\n            `waiting for the replica to catch up`,\n        );\n      }\n\n      this.#throwIfAborted(signal);\n      this.#lc.info?.(\n        `caught up ${subscriber.id} from SQLite with ${count} changes ` +\n          `(${this.#now() - start} ms)`,\n      );\n      const attributes = {\n        classification: outcome,\n        log_warm: logWarm ?? 'unknown',\n      };\n      this.#catchupRows.add(count, attributes);\n      this.#catchupBytes.add(bytes, attributes);\n      // Keep buffering live sends until the asynchronous backlog drain has\n      // established its ordering boundary.\n      void subscriber.setCaughtUp();\n    } catch (error) {\n      if (signal.aborted) {\n        return;\n      }\n      if (error instanceof SQLiteChangeLogBarrierError) {\n        if (error instanceof SQLiteChangeLogBarrierTimeoutError) {\n          this.#barrierTimeouts.add(1);\n          outcome = 'barrier-timeout';\n          this.#onFailure?.('barrier-timeout');\n        } else {\n          // No #onFailure: a backlog high water mark is a property of this\n          // one subscriber's consumption, not of the log. Tripping the\n          // process-wide breaker for it would take every task in the shard\n          // off SQLite, which a client that reconnects and stalls again\n          // could hold open indefinitely.\n          outcome = 'barrier-backlog';\n        }\n        // Giving up on the barrier means the replica has not caught up *yet*,\n        // not that it cannot serve this subscriber. End the subscription\n        // cleanly so the client reconnects and retries: IncrementalSyncer\n        // treats any ['error', ...] message as terminal and restores a fresh\n        // replica from litestream, whereas a clean end backs off and\n        // re-subscribes. If retries keep failing until the change log is purged\n        // past the subscriber's watermark, plan() returns 'too-old', which is\n        // terminal by design.\n        this.#lc.warn?.(\n          `ending subscription for ${subscriber.id} to retry SQLite catchup`,\n          error,\n        );\n        subscriber.close();\n        return;\n      }\n      outcome = 'reader-error';\n      this.#onFailure?.('reader-error');\n      this.#lc.error?.(\n        `error while catching up subscriber ${subscriber.id} from SQLite`,\n        error,\n      );\n      subscriber.fail(error);\n    } finally {\n      backlogPeakBytes = Math.max(\n        backlogPeakBytes,\n        subscriber.getStats().backlogBytes,\n      );\n      const attributes = {\n        classification: outcome,\n        log_warm: logWarm ?? 'unknown',\n      };\n      this.#catchupResults.add(1, attributes);\n      this.#catchupDuration.recordMs(this.#now() - catchupStart, attributes);\n      this.#catchupBacklogPeak.record(backlogPeakBytes, attributes);\n      if (this.#catchups.get(subscriber) === abort) {\n        this.#catchups.delete(subscriber);\n      }\n    }\n  }\n\n  /**\n   * Waits for the transaction that was in flight at registration to finish.\n   *\n   * This wait is bounded by the upstream transaction rather than by\n   * `barrierTimeoutMs`: the completion settles on both commit and rollback,\n   * and an interrupted change stream forwards a synthetic rollback, so it\n   * always settles. Aborting -- the subscriber disconnecting or the service\n   * shutting down -- is what releases it early.\n   */\n  async #awaitRequiredHead(\n    requiredHead: string | Promise<string>,\n    signal: AbortSignal,\n  ): Promise<string> {\n    if (typeof requiredHead === 'string') {\n      return requiredHead;\n    }\n    this.#throwIfAborted(signal);\n    let onAbort: (() => void) | undefined;\n    try {\n      return await Promise.race([\n        requiredHead,\n        new Promise<never>((_, reject) => {\n          onAbort = () =>\n            reject(new AbortError('SQLite change-log catchup aborted'));\n          signal.addEventListener('abort', onAbort, {once: true});\n        }),\n      ]);\n    } finally {\n      if (onAbort) {\n        signal.removeEventListener('abort', onAbort);\n      }\n    }\n  }\n\n  async #waitForPlan(\n    subscriber: Subscriber,\n    requiredHead: string,\n    deadline: number,\n    signal: AbortSignal,\n  ): Promise<Exclude<CatchupPlan, {kind: 'not-ready'}>> {\n    // Race backlog growth once around the whole polling loop. Attaching the\n    // same unresolved promise to every per-poll race would retain one reaction\n    // per iteration until the subscriber's backlog eventually filled.\n    const backlogFull = subscriber.whenBacklogFull();\n    const barrier = new AbortController();\n    const abortBarrier = () => barrier.abort();\n    signal.addEventListener('abort', abortBarrier, {once: true});\n    if (signal.aborted) {\n      barrier.abort();\n    }\n\n    let observedHead = subscriber.watermark;\n    try {\n      const planReady = (async () => {\n        while (true) {\n          this.#throwIfAborted(barrier.signal);\n          const plan = this.#reader.plan(subscriber.watermark);\n          // A not-ready log has no head to compare, so it can never satisfy\n          // the required head: keep waiting for the writer to create and\n          // reconcile it, and let the barrier deadline end the subscription\n          // cleanly for a retry. Selection declines a not-ready log before a\n          // subscriber gets here, and neither purging nor reconciliation can\n          // empty a log that had content, so this is a belt-and-braces path.\n          if (plan.kind !== 'not-ready') {\n            observedHead = plan.headWatermark;\n            if (plan.headWatermark >= requiredHead) {\n              return plan;\n            }\n          }\n          const remaining = deadline - this.#now();\n          if (remaining <= 0) {\n            throw new SQLiteChangeLogBarrierTimeoutError(\n              `timed out waiting for SQLite head ${observedHead} to ` +\n                `reach required head ${requiredHead}`,\n            );\n          }\n          await this.#awaitChangeLogProgress(\n            requiredHead,\n            remaining,\n            barrier.signal,\n          );\n        }\n      })();\n\n      const backlogOverflow = backlogFull.promise.then(() => {\n        this.#throwIfAborted(signal);\n        // close() also resolves backlog waiters so none are stranded. The\n        // backlog is cleared first, which distinguishes close from overflow.\n        if (!subscriber.backlogFull) {\n          return new Promise<never>(() => {});\n        }\n        this.#barrierWakeups.add(1, {'wakeup.source': 'backlog'});\n        // Bytes, not time, are what the barrier actually costs: past the high\n        // water mark this subscriber's send() no longer resolves, so it holds\n        // up every flush and can stall the replica this barrier waits on.\n        this.#barrierBacklogOverflows.add(1);\n        throw new SQLiteChangeLogBarrierBacklogError(\n          `backlog for subscriber ${subscriber.id} reached its high water ` +\n            `mark while waiting for SQLite head ${observedHead} to ` +\n            `reach required head ${requiredHead}`,\n        );\n      });\n\n      return await Promise.race([planReady, backlogOverflow]);\n    } finally {\n      signal.removeEventListener('abort', abortBarrier);\n      barrier.abort();\n      backlogFull.cancel();\n    }\n  }\n\n  /**\n   * Waits for the change-log writer to commit `requiredHead`, or the poll\n   * interval as a backstop.\n   *\n   * No notification can be missed by registering after `plan()` was read: the\n   * notification follows the commit it reports, so if the writer had already\n   * committed `requiredHead`, `plan()` would have seen it.\n   */\n  async #awaitChangeLogProgress(\n    requiredHead: string,\n    remainingMs: number,\n    signal: AbortSignal,\n  ): Promise<void> {\n    const committed = resolver<void>();\n    const waiter = {watermark: requiredHead, resolve: committed.resolve};\n    this.#commitWaiters.add(waiter);\n    // Scopes the backstop timer to this wait so that a commit cancels it rather\n    // than leaving it to fire against a barrier that has already moved on.\n    const poll = new AbortController();\n    const abortPoll = () => poll.abort();\n    signal.addEventListener('abort', abortPoll, {once: true});\n    try {\n      const wokenBy = await Promise.race([\n        committed.promise.then(() => 'commit' as const),\n        this.#sleep(\n          Math.min(this.#barrierPollIntervalMs, remainingMs),\n          poll.signal,\n        ).then(() => 'poll' as const),\n      ]);\n      this.#barrierWakeups.add(1, {'wakeup.source': wokenBy});\n    } finally {\n      this.#commitWaiters.delete(waiter);\n      signal.removeEventListener('abort', abortPoll);\n      poll.abort();\n    }\n  }\n\n  #throwIfAborted(signal: AbortSignal): void {\n    if (this.#closed || signal.aborted) {\n      throw new AbortError('SQLite change-log catchup aborted');\n    }\n  }\n}\n\ntype CommitWaiter = {watermark: string; resolve: () => void};\n\n/**\n * A barrier that gave up on the replica reaching the required head. Both\n * reasons mean \"not yet\", not \"never\", so both end the subscription cleanly\n * for a retry rather than failing it.\n */\nclass SQLiteChangeLogBarrierError extends Error {}\n\n/** The replica did not reach the required head before the deadline. */\nexport class SQLiteChangeLogBarrierTimeoutError extends SQLiteChangeLogBarrierError {\n  readonly name = 'SQLiteChangeLogBarrierTimeoutError';\n}\n\n/** Waiting any longer would have cost more than reconnecting. */\nexport class SQLiteChangeLogBarrierBacklogError extends SQLiteChangeLogBarrierError {\n  readonly name = 'SQLiteChangeLogBarrierBacklogError';\n}\n"],"mappings":";;;;;AAuCA,IAAM,mCAAmC;AAmCzC,IAAM,qBAAkD,EACtD,uBAAsB,aAAY,QAAQ,QAAQ,SAAS,CAAC,EAC9D;;;;;;;;;;AAWA,IAAa,yBAAb,MAA0D;CACxD;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAGA,mBAA4B,mBAC1B,eACA,sCACA,0EACF;CACA,2BAAoC,mBAClC,eACA,+CACA,sIAEF;CACA,kBAA2B,mBACzB,eACA,qCACA,iLAGF;CACA,kBAA2B,mBACzB,eACA,qCACA,0CACF;CACA,eAAwB,mBACtB,eACA,kCACA,wDACF;CACA,gBAAyB,mBACvB,eACA,mCACA;EACE,aAAa;EACb,MAAM;CACR,CACF;CACA,mBAA4B,4BAC1B,eACA,sCACA,0CACF;CACA,uBAAgC,4BAC9B,eACA,2CACA,yDACF;CACA,sBAA+B,0BAC7B,eACA,gDACA;EACE,aACE;EACF,MAAM;EACN,kBAAkB;GAChB;GAAG;GAAM;GAAQ;GAAQ;GAAS;GAAW;GAAW;EAC1D;CACF,CACF;CACA,4BAAqB,IAAI,IAAiC;CAC1D,iCAA0B,IAAI,IAAkB;CAChD,UAAU;CAEV,YACE,IACA,WACA,QACA,MACA;EACA,KAAK,MAAM,GAAG,YAAY,aAAa,2BAA2B;EAClE,KAAK,aAAa;EAClB,KAAK,UAAU;EACf,KAAK,aAAa,KAAK;EACvB,KAAK,oBAAoB,KAAK;EAC9B,KAAK,yBACH,KAAK,yBAAyB;EAChC,KAAK,gBAAgB,KAAK,gBAAgB;EAC1C,KAAK,SAAS,KAAK,SAAS;EAC5B,KAAK,OAAO,KAAK,OAAO,KAAK;EAC7B,KAAK,aAAa,KAAK;CACzB;;;;;;CAOA,MAAM,QACJ,YACA,qBACA,UAAyC,CAAC,GACG;EAC7C,IAAI,KAAK,SAAS;GAChB,WAAW,KAAK,IAAI,WAAW,qCAAqC,CAAC;GACrE,OAAO,EAAC,MAAM,UAAS;EACzB;EAEA,MAAM,QAAQ,IAAI,gBAAgB;EAClC,KAAK,UAAU,IAAI,YAAY,KAAK;EACpC,IAAI;EACJ,IAAI;EACJ,IAAI,YAAY;EAChB,IAAI;GACF,MAAM,KAAK,cAAc,2BAA2B;IAClD,KAAK,gBAAgB,MAAM,MAAM;IAMjC,MAAM,OAAO,KAAK,QAAQ,KAAK,WAAW,SAAS;IACnD,IAAI,KAAK,SAAS,WAAW;KAC3B,wBAAwB,KAAK;KAC7B;IACF;IACA,eAAe,oBAAoB;IACnC,KAAK,WAAW,IAAI,UAAU;IAC9B,YAAY;GACd,CAAC;EACH,SAAS,OAAO;GACd,KAAK,UAAU,OAAO,UAAU;GAChC,IAAI,MAAM,OAAO,SACf,OAAO,EAAC,MAAM,UAAS;GAEzB,IAAI,CAAC,WAAW;IAQd,KAAK,aAAa,cAAc;IAChC,OAAO;KAAC,MAAM;KAAY;IAAK;GACjC;GACA,KAAK,IAAI,QACP,qDAAqD,WAAW,MAChE,KACF;GACA,WAAW,KAAK,KAAK;GACrB,OAAO,EAAC,MAAM,UAAS;EACzB;EACA,IAAI,0BAA0B,KAAA,GAAW;GACvC,KAAK,UAAU,OAAO,UAAU;GAChC,OAAO;IAAC,MAAM;IAAa,cAAc;GAAqB;EAChE;EAEA,KAAU,KACR,YACA,cACA,OACA,QAAQ,OACV;EACA,OAAO,EAAC,MAAM,aAAY;CAC5B;;;;;;;;;;CAWA,kBAAkB,WAAyB;EACzC,KAAK,MAAM,UAAU,KAAK,gBACxB,IAAI,aAAa,OAAO,WAAW;GACjC,KAAK,eAAe,OAAO,MAAM;GACjC,OAAO,QAAQ;EACjB;CAEJ;CAEA,OAAO,YAA8B;EACnC,KAAK,UAAU,IAAI,UAAU,CAAC,EAAE,MAAM;EACtC,KAAK,UAAU,OAAO,UAAU;EAChC,KAAK,WAAW,OAAO,UAAU;CACnC;CAEA,QAAc;EACZ,IAAI,KAAK,SACP;EAEF,KAAK,UAAU;EACf,KAAK,MAAM,CAAC,YAAY,UAAU,KAAK,WAAW;GAChD,MAAM,MAAM;GACZ,KAAK,WAAW,OAAO,UAAU;EACnC;EACA,KAAK,UAAU,MAAM;EACrB,KAAK,QAAQ,MAAM;CACrB;CAEA,CAAC,OAAO,WAAiB;EACvB,KAAK,MAAM;CACb;CAEA,MAAM,KACJ,YACA,cACA,OACA,SACe;EACf,MAAM,EAAC,WAAU;EACjB,MAAM,eAAe,KAAK,KAAK;EAC/B,IAAI,UAAU;EACd,IAAI,mBAAmB;EACvB,IAAI;GACF,MAAM,oBAAoB,KAAK,KAAK;GACpC,MAAM,WAAW,MAAM,KAAK,mBAAmB,cAAc,MAAM;GACnE,MAAM,qBAAqB,KAAK,KAAK,IAAI;GACzC,IAAI,qBAAqB,KAAK,mBAC5B,KAAK,IAAI,OACP,UAAU,mBAAmB,qFACsB,WAAW,IAChE;GAOF,MAAM,WAAW,KAAK,KAAK,IAAI,KAAK;GACpC,MAAM,eAAe,KAAK,KAAK;GAC/B,IAAI;GACJ,IAAI;IACF,OAAO,MAAM,KAAK,aAAa,YAAY,UAAU,UAAU,MAAM;GACvE,UAAU;IAGR,KAAK,qBAAqB,SAAS,KAAK,KAAK,IAAI,YAAY;GAC/D;GACA,KAAK,gBAAgB,MAAM;GAE3B,IAAI,KAAK,SAAS,WAAW;IAC3B,UAAU;IACV,MAAM,UACJ,mCAAmC,KAAK,aAAa,cACvC,WAAW,UAAU;IACrC,KAAK,IAAI,OACP,qCAAqC,WAAW,UAAU,wBAChC,KAAK,aAAa,EAC9C;IACA,WAAW,MAAM,GAA2B,OAAO;IACnD;GACF;GAEA,IAAI,QAAQ;GACZ,IAAI,QAAQ;GACZ,MAAM,QAAQ,KAAK,KAAK;GACxB,IAAI,KAAK,SAAS,SAAS;IACzB,IAAI;IACJ,WAAW,MAAM,WAAW,KAAK,QAAQ,KACvC,WAAW,WACX,KAAK,eACL,KAAK,YACL,MACF,GAAG;KACD,MAAM,YAAY,KAAK,KAAK;KAC5B,MAAM;KACN,MAAM,UAAU,KAAK,KAAK,IAAI;KAC9B,IAAI,mBACF,KAAK,IAAI,UAAU,MAAM,SAAS,QAAQ,GACxC,UAAU,QAAQ,QAAQ,CAAC,EAAE,UAAU,WAAW,GAAG,8CAEvD;KAEF,KAAK,gBAAgB,MAAM;KAC3B,KAAK,MAAM,UAAU,SAAS;MAC5B,oBAAoB,WAAW,QAAQ,MAAM;MAC7C;MACA,SAAS,OAAO,WAAW,OAAO,EAAE;KACtC;KACA,mBAAmB,KAAK,IACtB,kBACA,WAAW,SAAS,CAAC,CAAC,YACxB;IACF;IACA,MAAM;IACN,UAAU;GACZ,OAAO;IACL,UAAU;IACV,KAAK,IAAI,OACP,cAAc,WAAW,GAAG,gBAAgB,WAAW,UAAU,0CACrB,KAAK,cAAc,sCAEjE;GACF;GAEA,KAAK,gBAAgB,MAAM;GAC3B,KAAK,IAAI,OACP,aAAa,WAAW,GAAG,oBAAoB,MAAM,YAC/C,KAAK,KAAK,IAAI,MAAM,KAC5B;GACA,MAAM,aAAa;IACjB,gBAAgB;IAChB,UAAU,WAAW;GACvB;GACA,KAAK,aAAa,IAAI,OAAO,UAAU;GACvC,KAAK,cAAc,IAAI,OAAO,UAAU;GAGxC,WAAgB,YAAY;EAC9B,SAAS,OAAO;GACd,IAAI,OAAO,SACT;GAEF,IAAI,iBAAiB,6BAA6B;IAChD,IAAI,iBAAiB,oCAAoC;KACvD,KAAK,iBAAiB,IAAI,CAAC;KAC3B,UAAU;KACV,KAAK,aAAa,iBAAiB;IACrC,OAME,UAAU;IAUZ,KAAK,IAAI,OACP,2BAA2B,WAAW,GAAG,2BACzC,KACF;IACA,WAAW,MAAM;IACjB;GACF;GACA,UAAU;GACV,KAAK,aAAa,cAAc;GAChC,KAAK,IAAI,QACP,sCAAsC,WAAW,GAAG,eACpD,KACF;GACA,WAAW,KAAK,KAAK;EACvB,UAAU;GACR,mBAAmB,KAAK,IACtB,kBACA,WAAW,SAAS,CAAC,CAAC,YACxB;GACA,MAAM,aAAa;IACjB,gBAAgB;IAChB,UAAU,WAAW;GACvB;GACA,KAAK,gBAAgB,IAAI,GAAG,UAAU;GACtC,KAAK,iBAAiB,SAAS,KAAK,KAAK,IAAI,cAAc,UAAU;GACrE,KAAK,oBAAoB,OAAO,kBAAkB,UAAU;GAC5D,IAAI,KAAK,UAAU,IAAI,UAAU,MAAM,OACrC,KAAK,UAAU,OAAO,UAAU;EAEpC;CACF;;;;;;;;;;CAWA,MAAM,mBACJ,cACA,QACiB;EACjB,IAAI,OAAO,iBAAiB,UAC1B,OAAO;EAET,KAAK,gBAAgB,MAAM;EAC3B,IAAI;EACJ,IAAI;GACF,OAAO,MAAM,QAAQ,KAAK,CACxB,cACA,IAAI,SAAgB,GAAG,WAAW;IAChC,gBACE,OAAO,IAAI,WAAW,mCAAmC,CAAC;IAC5D,OAAO,iBAAiB,SAAS,SAAS,EAAC,MAAM,KAAI,CAAC;GACxD,CAAC,CACH,CAAC;EACH,UAAU;GACR,IAAI,SACF,OAAO,oBAAoB,SAAS,OAAO;EAE/C;CACF;CAEA,MAAM,aACJ,YACA,cACA,UACA,QACoD;EAIpD,MAAM,cAAc,WAAW,gBAAgB;EAC/C,MAAM,UAAU,IAAI,gBAAgB;EACpC,MAAM,qBAAqB,QAAQ,MAAM;EACzC,OAAO,iBAAiB,SAAS,cAAc,EAAC,MAAM,KAAI,CAAC;EAC3D,IAAI,OAAO,SACT,QAAQ,MAAM;EAGhB,IAAI,eAAe,WAAW;EAC9B,IAAI;GACF,MAAM,aAAa,YAAY;IAC7B,OAAO,MAAM;KACX,KAAK,gBAAgB,QAAQ,MAAM;KACnC,MAAM,OAAO,KAAK,QAAQ,KAAK,WAAW,SAAS;KAOnD,IAAI,KAAK,SAAS,aAAa;MAC7B,eAAe,KAAK;MACpB,IAAI,KAAK,iBAAiB,cACxB,OAAO;KAEX;KACA,MAAM,YAAY,WAAW,KAAK,KAAK;KACvC,IAAI,aAAa,GACf,MAAM,IAAI,mCACR,qCAAqC,aAAa,0BACzB,cAC3B;KAEF,MAAM,KAAK,wBACT,cACA,WACA,QAAQ,MACV;IACF;GACF,EAAA,CAAG;GAEH,MAAM,kBAAkB,YAAY,QAAQ,WAAW;IACrD,KAAK,gBAAgB,MAAM;IAG3B,IAAI,CAAC,WAAW,aACd,OAAO,IAAI,cAAqB,CAAC,CAAC;IAEpC,KAAK,gBAAgB,IAAI,GAAG,EAAC,iBAAiB,UAAS,CAAC;IAIxD,KAAK,yBAAyB,IAAI,CAAC;IACnC,MAAM,IAAI,mCACR,0BAA0B,WAAW,GAAG,6DACA,aAAa,0BAC5B,cAC3B;GACF,CAAC;GAED,OAAO,MAAM,QAAQ,KAAK,CAAC,WAAW,eAAe,CAAC;EACxD,UAAU;GACR,OAAO,oBAAoB,SAAS,YAAY;GAChD,QAAQ,MAAM;GACd,YAAY,OAAO;EACrB;CACF;;;;;;;;;CAUA,MAAM,wBACJ,cACA,aACA,QACe;EACf,MAAM,YAAY,SAAe;EACjC,MAAM,SAAS;GAAC,WAAW;GAAc,SAAS,UAAU;EAAO;EACnE,KAAK,eAAe,IAAI,MAAM;EAG9B,MAAM,OAAO,IAAI,gBAAgB;EACjC,MAAM,kBAAkB,KAAK,MAAM;EACnC,OAAO,iBAAiB,SAAS,WAAW,EAAC,MAAM,KAAI,CAAC;EACxD,IAAI;GACF,MAAM,UAAU,MAAM,QAAQ,KAAK,CACjC,UAAU,QAAQ,WAAW,QAAiB,GAC9C,KAAK,OACH,KAAK,IAAI,KAAK,wBAAwB,WAAW,GACjD,KAAK,MACP,CAAC,CAAC,WAAW,MAAe,CAC9B,CAAC;GACD,KAAK,gBAAgB,IAAI,GAAG,EAAC,iBAAiB,QAAO,CAAC;EACxD,UAAU;GACR,KAAK,eAAe,OAAO,MAAM;GACjC,OAAO,oBAAoB,SAAS,SAAS;GAC7C,KAAK,MAAM;EACb;CACF;CAEA,gBAAgB,QAA2B;EACzC,IAAI,KAAK,WAAW,OAAO,SACzB,MAAM,IAAI,WAAW,mCAAmC;CAE5D;AACF;;;;;;AASA,IAAM,8BAAN,cAA0C,MAAM,CAAC;;AAGjD,IAAa,qCAAb,cAAwD,4BAA4B;CAClF,OAAgB;AAClB;;AAGA,IAAa,qCAAb,cAAwD,4BAA4B;CAClF,OAAgB;AAClB"}

package/out/zero-cache/src/services/change-streamer/sqlite-change-log-comparator.js

@@ -19,7 +19,7 @@ var DEFAULT_MAX_ROWS_PER_SOURCE_PER_CYCLE = 1e3;
 * which scales with payload size instead of row count. Normal traffic
 * reaches the row limit first. Wide payloads reach this one.
 */
-var DEFAULT_MAX_BYTES_PER_SOURCE_PER_CYCLE = 32 * 1024 * 1024;
+var DEFAULT_MAX_BYTES_PER_SOURCE_PER_CYCLE = 33554432;
 /** Rows per SQLite catchup batch. */
 var DEFAULT_READ_BATCH_ROWS = 1e3;
 /** Uses separate aggregates so SQLite can use an index for each value. */
@@ -401,7 +401,7 @@ var SQLiteChangeLogComparator = class {
 };
 /** Applies the same reconstruction as Postgres catchup. */
 async function* reconstructBatches(batches) {
-	for await (const batch of batches) yield batch.map(reconstructWatermarkedChange);
+	for await (const batch of batches) yield batch.map(({ watermark, tag, change }) => reconstructWatermarkedChange(watermark, tag, change));
 }
 function minWatermark(a, b) {
 	return a < b ? a : b;

package/out/zero-cache/src/services/change-streamer/sqlite-change-log-comparator.js.map

@@ -1 +1 @@
-{"version":3,"file":"sqlite-change-log-comparator.js","names":["#lc","#shard","#changeLogFile","#identity","#pg","#opts","#now","#setTimeoutFn","#clearTimeoutFn","#yield","#compareResults","#compareCycles","#cycleDuration","#scheduleNext","#stopped","#running","#runCycle","#continueWithoutDelay","#rescheduleNext","#timer","#fileGeneration","#cursor","#skipped","#pinBounds","#reconfirm","#compared","#enumerateCommits","#compareTransaction","#readSQLiteBounds"],"sources":["../../../../../../zero-cache/src/services/change-streamer/sqlite-change-log-comparator.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {Database} from '../../../../zqlite/src/db.ts';\nimport {\n  getOrCreateCounter,\n  getOrCreateLatencyHistogram,\n} from '../../observability/metrics.ts';\nimport type {ShardID} from '../../types/shards.ts';\nimport {\n  CHANGE_LOG_DB_SCHEMA_VERSION,\n  CHANGE_LOG_STREAM_TABLE,\n  readChangeLogMeta,\n  type ChangeLogIdentity,\n  type ChangeLogMeta,\n} from '../replicator/change-log-db.ts';\nimport {\n  reconstructWatermarkedChange,\n  type ChangeLogEntry,\n} from './change-log-codec.ts';\nimport {\n  digestCatchupRange,\n  type CatchupRangeDigest,\n} from './change-log-compare-digest.ts';\nimport type {WatermarkedChange} from './change-streamer.ts';\nimport {isSampledForShard} from './shard-sampling.ts';\nimport {SQLiteChangeLogReader} from './sqlite-change-log-reader.ts';\n\n/** Interval between comparison cycles. */\nconst DEFAULT_COMPARE_INTERVAL_MS = 30_000;\n\n/** Maximum transactions enumerated per cycle. */\nconst DEFAULT_MAX_TRANSACTIONS_PER_CYCLE = 256;\n\n/** Maximum catchup rows read from each store per cycle. */\nconst DEFAULT_MAX_ROWS_PER_SOURCE_PER_CYCLE = 1000;\n\n/**\n * Maximum catchup bytes read from each store per cycle.\n *\n * Rows bound the per-row overhead. Bytes bound the read and hash work,\n * which scales with payload size instead of row count. Normal traffic\n * reaches the row limit first. Wide payloads reach this one.\n */\nconst DEFAULT_MAX_BYTES_PER_SOURCE_PER_CYCLE = 32 * 1024 * 1024;\n\n/** Rows per SQLite catchup batch. */\nconst DEFAULT_READ_BATCH_ROWS = 1000;\n\n/**\n * Result for one committed transaction.\n *\n * `mismatch` covers missing, extra, changed, or reordered rows.\n * `inconclusive` means that store bounds changed during the comparison.\n */\nexport type CompareOutcome =\n  | 'match'\n  | 'mismatch'\n  | 'inconclusive'\n  | 'deferred'\n  | 'oversized';\n\nexport type CompareSkipReason =\n  // The comparator was stopped.\n  | 'stopped'\n  // The writer replaced the file during this cycle.\n  | 'log-rebuilt'\n  // The file is absent, unreadable, or uninitialized.\n  | 'log-unavailable'\n  // The schema version does not match this build.\n  | 'ineligible-schema'\n  // The log belongs to a different replica.\n  | 'ineligible-identity'\n  // The log is younger than the warm-up period.\n  | 'cold-log'\n  // The stores have no complete committed range in common.\n  | 'nothing-to-compare'\n  // The cycle failed. The error was logged and counted.\n  | 'error';\n\nexport type CompareCycleResult =\n  | {readonly kind: 'skipped'; readonly reason: CompareSkipReason}\n  | {\n      readonly kind: 'compared';\n      /** Exclusive lower bound of the compared range. */\n      readonly fromWatermark: string;\n      /** Inclusive upper bound handled. The next cycle resumes from here. */\n      readonly throughWatermark: string;\n      /** Committed transactions handled through `throughWatermark`. */\n      readonly transactions: number;\n      /** Transactions with compared catchup output. */\n      readonly sampled: number;\n      readonly matched: number;\n      readonly mismatched: number;\n      /** Suspects rejected because store bounds changed. */\n      readonly inconclusive: number;\n      /** Sampled transactions deferred to a fresh budget. */\n      readonly deferred: number;\n      /** Sampled transactions that exceed a fresh budget. */\n      readonly oversized: number;\n    };\n\n/** Provides the Postgres side of the catchup comparison. */\nexport interface PGChangeLogRangeReader {\n  getCatchupBounds(): Promise<{\n    minWatermark: string | null;\n    lastWatermark: string;\n  }>;\n  listCommitWatermarks(\n    afterWatermark: string,\n    throughWatermark: string,\n    limit: number,\n  ): Promise<string[]>;\n  readCatchupRange(\n    afterWatermark: string,\n    throughWatermark: string,\n    batchRows?: number | undefined,\n  ): AsyncIterable<ChangeLogEntry[]>;\n}\n\nexport type SQLiteChangeLogCompareOptions = {\n  /** Stable percentage of transactions selected for payload comparison. */\n  readonly comparePercent: number;\n  /** Warm-up time after a seed. The comparator skips a younger log. */\n  readonly retentionMs: number;\n  readonly intervalMs?: number | undefined;\n  readonly maxTransactionsPerCycle?: number | undefined;\n  /** Maximum catchup rows read from each store in one cycle. */\n  readonly maxRowsPerSourcePerCycle?: number | undefined;\n  /** Maximum catchup bytes read from each store in one cycle. */\n  readonly maxBytesPerSourcePerCycle?: number | undefined;\n  readonly readBatchRows?: number | undefined;\n  /** Clock for the warm-up period. Defaults to `Date.now`. */\n  readonly now?: (() => number) | undefined;\n  readonly setTimeoutFn?: typeof setTimeout | undefined;\n  readonly clearTimeoutFn?: typeof clearTimeout | undefined;\n  /** Yields between sampled transactions. Defaults to `setImmediate`. */\n  readonly yieldFn?: (() => Promise<void>) | undefined;\n};\n\n/** Uses separate aggregates so SQLite can use an index for each value. */\nconst SQLITE_BOUNDS_SQL = /*sql*/ `\n  SELECT\n    (SELECT min(\"watermark\") FROM \"${CHANGE_LOG_STREAM_TABLE}\")\n      AS \"minWatermark\",\n    (SELECT max(\"watermark\") FROM \"${CHANGE_LOG_STREAM_TABLE}\")\n      AS \"headWatermark\"\n`;\n\n/** Lists committed transaction watermarks in `(@after, @through]`. */\nconst SQLITE_COMMITS_SQL = /*sql*/ `\n  SELECT \"watermark\" FROM \"${CHANGE_LOG_STREAM_TABLE}\"\n   WHERE \"precommit\" IS NOT NULL\n     AND \"watermark\" > @after\n     AND \"watermark\" <= @through\n   ORDER BY \"watermark\"\n   LIMIT @limit\n`;\n\ntype SQLiteBounds = {\n  readonly minWatermark: string;\n  readonly headWatermark: string;\n};\n\ntype PinnedBounds = {\n  readonly meta: ChangeLogMeta;\n  readonly sqlite: SQLiteBounds;\n  readonly pgMinWatermark: string;\n  readonly pgLastWatermark: string;\n};\n\ntype SampledComparison = {\n  readonly outcome: CompareOutcome;\n  readonly sqliteRowsRead: number;\n  readonly pgRowsRead: number;\n  readonly sqliteBytesRead: number;\n  readonly pgBytesRead: number;\n};\n\n/**\n * Compares SQLite and Postgres catchup output without affecting subscribers.\n *\n * Each cycle compares complete ranges through the lower store head.\n * It checks every transaction for presence and samples payloads.\n * A bounds change makes the affected result `inconclusive`.\n * Postgres remains authoritative.\n */\nexport class SQLiteChangeLogComparator {\n  readonly #lc: LogContext;\n  readonly #shard: ShardID;\n  readonly #changeLogFile: string;\n  readonly #identity: ChangeLogIdentity;\n  readonly #pg: PGChangeLogRangeReader;\n  readonly #opts: SQLiteChangeLogCompareOptions;\n  readonly #now: () => number;\n  readonly #setTimeoutFn: typeof setTimeout;\n  readonly #clearTimeoutFn: typeof clearTimeout;\n  readonly #yield: () => Promise<void>;\n\n  readonly #compareResults = getOrCreateCounter(\n    'replica',\n    'sqlite_change_log.compare_result',\n    'Outcomes of the dark comparison between what SQLite catchup serves and ' +\n      'what PG catchup serves, per committed transaction. `inconclusive` ' +\n      'means a purge or reseed moved the pinned bounds mid-comparison.',\n  );\n  readonly #compareCycles = getOrCreateCounter(\n    'replica',\n    'sqlite_change_log.compare_cycles',\n    'SQLite change-log comparison cycles, by result.',\n  );\n  readonly #cycleDuration = getOrCreateLatencyHistogram(\n    'replica',\n    'sqlite_change_log.compare_cycle_duration',\n    'Duration of one SQLite change-log comparison cycle.',\n  );\n\n  /** Last handled commit watermark. A restart derives it from current bounds. */\n  #cursor: string | undefined;\n  #running: Promise<CompareCycleResult> | undefined;\n  #timer: ReturnType<typeof setTimeout> | undefined;\n  #stopped = false;\n  #continueWithoutDelay = false;\n  #fileGeneration = 0;\n\n  constructor(\n    lc: LogContext,\n    shard: ShardID,\n    changeLogFile: string,\n    identity: ChangeLogIdentity,\n    pg: PGChangeLogRangeReader,\n    opts: SQLiteChangeLogCompareOptions,\n  ) {\n    this.#lc = lc.withContext('component', 'sqlite-change-log-compare');\n    this.#shard = shard;\n    this.#changeLogFile = changeLogFile;\n    this.#identity = identity;\n    this.#pg = pg;\n    this.#opts = opts;\n    this.#now = opts.now ?? Date.now;\n    this.#setTimeoutFn = opts.setTimeoutFn ?? setTimeout;\n    this.#clearTimeoutFn = opts.clearTimeoutFn ?? clearTimeout;\n    this.#yield =\n      opts.yieldFn ??\n      (() => new Promise<void>(resolve => setImmediate(resolve)));\n    this.#scheduleNext();\n  }\n\n  /**\n   * Runs one cycle. Concurrent calls share the same promise.\n   * Errors produce `skipped: 'error'`.\n   */\n  compareOnce(): Promise<CompareCycleResult> {\n    if (this.#stopped) {\n      return Promise.resolve({kind: 'skipped', reason: 'stopped'});\n    }\n    if (this.#running === undefined) {\n      this.#running = this.#runCycle()\n        .then(result => {\n          if (this.#continueWithoutDelay) {\n            this.#rescheduleNext(0);\n          }\n          return result;\n        })\n        .finally(() => {\n          this.#running = undefined;\n        });\n    }\n    return this.#running;\n  }\n\n  stop(): void {\n    this.#stopped = true;\n    if (this.#timer !== undefined) {\n      this.#clearTimeoutFn(this.#timer);\n      this.#timer = undefined;\n    }\n  }\n\n  /** Invalidates cycles that can still read a replaced file. */\n  invalidate(): void {\n    this.#fileGeneration++;\n    this.#cursor = undefined;\n    this.#continueWithoutDelay = false;\n  }\n\n  #scheduleNext(\n    delayMs = this.#opts.intervalMs ?? DEFAULT_COMPARE_INTERVAL_MS,\n  ): void {\n    if (this.#stopped || this.#timer !== undefined) {\n      return;\n    }\n    this.#timer = this.#setTimeoutFn(() => {\n      this.#timer = undefined;\n      void this.compareOnce().finally(() => this.#scheduleNext());\n    }, delayMs);\n  }\n\n  #rescheduleNext(delayMs: number): void {\n    if (this.#timer !== undefined) {\n      this.#clearTimeoutFn(this.#timer);\n      this.#timer = undefined;\n    }\n    this.#scheduleNext(delayMs);\n  }\n\n  async #runCycle(): Promise<CompareCycleResult> {\n    const startedAt = performance.now();\n    const fileGeneration = this.#fileGeneration;\n    this.#continueWithoutDelay = false;\n    let db: Database | undefined;\n    let reader: SQLiteChangeLogReader | undefined;\n    try {\n      try {\n        // A readonly handle does not create a missing file.\n        db = new Database(this.#lc, this.#changeLogFile, {readonly: true});\n      } catch {\n        return this.#skipped('log-unavailable');\n      }\n\n      const pinned = await this.#pinBounds(db);\n      if (fileGeneration !== this.#fileGeneration) {\n        return this.#skipped('log-rebuilt');\n      }\n      if (typeof pinned === 'string') {\n        return this.#skipped(pinned);\n      }\n      const {meta} = pinned;\n\n      const from = maxWatermark(\n        this.#cursor ?? meta.seedWatermark,\n        // Exclude the synthetic SQLite seed transaction.\n        // The Postgres seed has no `precommit`, so enumeration also excludes it.\n        meta.seedWatermark,\n        // A store cannot serve the transaction at its minimum watermark.\n        pinned.pgMinWatermark,\n        pinned.sqlite.minWatermark,\n      );\n      const through = minWatermark(\n        pinned.pgLastWatermark,\n        pinned.sqlite.headWatermark,\n      );\n      if (through <= from) {\n        return this.#skipped('nothing-to-compare');\n      }\n\n      let transactions = 0;\n      let sampled = 0;\n      const outcomes: Record<CompareOutcome, number> = {\n        match: 0,\n        mismatch: 0,\n        inconclusive: 0,\n        deferred: 0,\n        oversized: 0,\n      };\n      const record = (watermark: string, outcome: CompareOutcome) => {\n        this.#compareResults.add(1, {outcome});\n        outcomes[outcome]++;\n        if (outcome === 'mismatch') {\n          // Log only the watermark because payloads contain customer data.\n          this.#lc.error?.(\n            'SQLite change-log catchup output diverged from Postgres',\n            {sqliteChangeLogCompare: {watermark}},\n          );\n        }\n      };\n\n      reader = new SQLiteChangeLogReader(this.#lc, this.#changeLogFile);\n      const plan = reader.plan(from);\n      if (plan.kind === 'not-ready') {\n        return this.#skipped('log-unavailable');\n      }\n      if (plan.kind === 'ahead') {\n        return this.#skipped('nothing-to-compare');\n      }\n      if (plan.kind === 'too-old') {\n        // A fixed lower bound makes this result a mismatch.\n        // A changed lower bound makes it inconclusive.\n        const reconfirmed = await this.#reconfirm(db, pinned, from);\n        const outcome =\n          fileGeneration === this.#fileGeneration\n            ? reconfirmed\n            : 'inconclusive';\n        record(from, outcome);\n        if (outcome === 'inconclusive') {\n          // Keep the cursor unchanged because the bounds moved.\n          return this.#compared(from, from, transactions, sampled, outcomes);\n        }\n        // Positional reads can continue after a missing boundary.\n        // Advancing avoids reporting the same boundary in every cycle.\n      }\n\n      const limit = Math.max(\n        1,\n        this.#opts.maxTransactionsPerCycle ??\n          DEFAULT_MAX_TRANSACTIONS_PER_CYCLE,\n      );\n      const union = await this.#enumerateCommits(db, from, through, limit);\n      if (fileGeneration !== this.#fileGeneration) {\n        return this.#skipped('log-rebuilt');\n      }\n      const maxRowsPerSource = Math.max(\n        1,\n        this.#opts.maxRowsPerSourcePerCycle ??\n          DEFAULT_MAX_ROWS_PER_SOURCE_PER_CYCLE,\n      );\n      const maxBytesPerSource = Math.max(\n        1,\n        this.#opts.maxBytesPerSourcePerCycle ??\n          DEFAULT_MAX_BYTES_PER_SOURCE_PER_CYCLE,\n      );\n\n      let sqliteRowsRead = 0;\n      let pgRowsRead = 0;\n      let sqliteBytesRead = 0;\n      let pgBytesRead = 0;\n      let previousBoundary = from;\n      let handledThrough = from;\n      for (const {watermark, inSqlite, inPg} of union) {\n        if (this.#stopped) {\n          break;\n        }\n        let stopAfterTransaction = false;\n        if (!inSqlite || !inPg) {\n          // Check every transaction for presence because this needs no payload read.\n          const outcome = await this.#reconfirm(db, pinned, watermark);\n          record(\n            watermark,\n            fileGeneration === this.#fileGeneration ? outcome : 'inconclusive',\n          );\n        } else if (\n          isSampledForShard(this.#shard, watermark, this.#opts.comparePercent)\n        ) {\n          const sqliteRowsRemaining = maxRowsPerSource - sqliteRowsRead;\n          const pgRowsRemaining = maxRowsPerSource - pgRowsRead;\n          // A read may pass the byte budget by its last row, so this\n          // compares against zero rather than checking for equality.\n          const sqliteBytesRemaining = maxBytesPerSource - sqliteBytesRead;\n          const pgBytesRemaining = maxBytesPerSource - pgBytesRead;\n          if (\n            sqliteRowsRemaining === 0 ||\n            pgRowsRemaining === 0 ||\n            sqliteBytesRemaining <= 0 ||\n            pgBytesRemaining <= 0\n          ) {\n            record(watermark, 'deferred');\n            break;\n          }\n          sampled++;\n          const comparison = await this.#compareTransaction(\n            db,\n            reader,\n            pinned,\n            previousBoundary,\n            watermark,\n            sqliteRowsRemaining,\n            pgRowsRemaining,\n            sqliteBytesRemaining,\n            pgBytesRemaining,\n            maxRowsPerSource,\n            maxBytesPerSource,\n          );\n          sqliteRowsRead += comparison.sqliteRowsRead;\n          pgRowsRead += comparison.pgRowsRead;\n          sqliteBytesRead += comparison.sqliteBytesRead;\n          pgBytesRead += comparison.pgBytesRead;\n          const outcome =\n            fileGeneration === this.#fileGeneration\n              ? comparison.outcome\n              : 'inconclusive';\n          record(watermark, outcome);\n          if (outcome === 'inconclusive') {\n            break;\n          }\n          if (outcome === 'deferred') {\n            break;\n          }\n          if (outcome === 'oversized') {\n            // Advance past a transaction that cannot fit in a fresh budget.\n            stopAfterTransaction = true;\n          }\n          // Yield between sampled reads so other stream work can continue.\n          await this.#yield();\n        }\n        previousBoundary = watermark;\n        handledThrough = watermark;\n        transactions++;\n        if (stopAfterTransaction) {\n          break;\n        }\n      }\n\n      if (\n        !this.#stopped &&\n        fileGeneration === this.#fileGeneration &&\n        outcomes.inconclusive === 0\n      ) {\n        this.#cursor = handledThrough;\n        this.#continueWithoutDelay = handledThrough < through;\n      }\n      return this.#compared(\n        from,\n        handledThrough,\n        transactions,\n        sampled,\n        outcomes,\n      );\n    } catch (e) {\n      this.#lc.warn?.('error comparing the SQLite change log', e);\n      return this.#skipped('error');\n    } finally {\n      reader?.close();\n      db?.close();\n      this.#cycleDuration.recordMs(performance.now() - startedAt);\n    }\n  }\n\n  /** Checks log eligibility and reads the bounds from both stores. */\n  async #pinBounds(db: Database): Promise<PinnedBounds | CompareSkipReason> {\n    let meta: ChangeLogMeta;\n    try {\n      meta = readChangeLogMeta(db);\n    } catch {\n      // The writer has not initialized the log.\n      return 'log-unavailable';\n    }\n    if (meta.schemaVersion !== CHANGE_LOG_DB_SCHEMA_VERSION) {\n      return 'ineligible-schema';\n    }\n    const {epoch, generation, replicaID} = this.#identity;\n    if (\n      meta.epoch !== epoch ||\n      meta.generation !== generation ||\n      meta.replicaID !== replicaID\n    ) {\n      return 'ineligible-identity';\n    }\n    if (this.#now() - meta.seededAtMs < this.#opts.retentionMs) {\n      return 'cold-log';\n    }\n    const sqlite = this.#readSQLiteBounds(db);\n    if (sqlite === undefined) {\n      return 'log-unavailable';\n    }\n    const {minWatermark, lastWatermark} = await this.#pg.getCatchupBounds();\n    if (minWatermark === null) {\n      // Only a new replica has an empty Postgres change log.\n      return 'nothing-to-compare';\n    }\n    return {\n      meta,\n      sqlite,\n      pgMinWatermark: minWatermark,\n      pgLastWatermark: lastWatermark,\n    };\n  }\n\n  #readSQLiteBounds(db: Database): SQLiteBounds | undefined {\n    const bounds = db\n      .prepare(SQLITE_BOUNDS_SQL)\n      .get<{minWatermark: string | null; headWatermark: string | null}>();\n    return bounds.minWatermark === null || bounds.headWatermark === null\n      ? undefined\n      : {\n          minWatermark: bounds.minWatermark,\n          headWatermark: bounds.headWatermark,\n        };\n  }\n\n  /**\n   * Merges committed transaction watermarks from both stores.\n   * If a list reaches the limit, the result ends at the last complete common range.\n   */\n  async #enumerateCommits(\n    db: Database,\n    from: string,\n    through: string,\n    limit: number,\n  ): Promise<{watermark: string; inSqlite: boolean; inPg: boolean}[]> {\n    let sqlite: string[] = db\n      .prepare(SQLITE_COMMITS_SQL)\n      .all<{watermark: string}>({after: from, through, limit: limit + 1})\n      .map(({watermark}) => watermark);\n    let pg = await this.#pg.listCommitWatermarks(from, through, limit + 1);\n\n    let effectiveThrough = through;\n    if (sqlite.length > limit) {\n      sqlite.length = limit;\n      effectiveThrough = minWatermark(effectiveThrough, sqlite[limit - 1]);\n    }\n    if (pg.length > limit) {\n      pg.length = limit;\n      effectiveThrough = minWatermark(effectiveThrough, pg[limit - 1]);\n    }\n    if (effectiveThrough !== through) {\n      sqlite = sqlite.filter(w => w <= effectiveThrough);\n      pg = pg.filter(w => w <= effectiveThrough);\n    }\n\n    const union: {watermark: string; inSqlite: boolean; inPg: boolean}[] = [];\n    let s = 0;\n    let p = 0;\n    while (s < sqlite.length || p < pg.length) {\n      const sw = s < sqlite.length ? sqlite[s] : undefined;\n      const pw = p < pg.length ? pg[p] : undefined;\n      if (sw !== undefined && (pw === undefined || sw < pw)) {\n        union.push({watermark: sw, inSqlite: true, inPg: false});\n        s++;\n      } else if (pw !== undefined && (sw === undefined || pw < sw)) {\n        union.push({watermark: pw, inSqlite: false, inPg: true});\n        p++;\n      } else if (sw !== undefined) {\n        union.push({watermark: sw, inSqlite: true, inPg: true});\n        s++;\n        p++;\n      }\n    }\n    return union;\n  }\n\n  /**\n   * Compares the output in `(previousBoundary, watermark]`.\n   * Positional reads do not require either store to contain the boundary row.\n   */\n  async #compareTransaction(\n    db: Database,\n    reader: SQLiteChangeLogReader,\n    pinned: PinnedBounds,\n    previousBoundary: string,\n    watermark: string,\n    sqliteMaxRows: number,\n    pgMaxRows: number,\n    sqliteMaxBytes: number,\n    pgMaxBytes: number,\n    maxRowsPerSource: number,\n    maxBytesPerSource: number,\n  ): Promise<SampledComparison> {\n    let sqlite: CatchupRangeDigest;\n    let pg: CatchupRangeDigest;\n    try {\n      const readBatchRows = this.#opts.readBatchRows ?? DEFAULT_READ_BATCH_ROWS;\n      sqlite = await digestCatchupRange(\n        reader.read(\n          previousBoundary,\n          watermark,\n          Math.min(readBatchRows, sqliteMaxRows),\n          undefined,\n          sqliteMaxRows,\n        ),\n        watermark,\n        sqliteMaxRows,\n        sqliteMaxBytes,\n      );\n      pg = await digestCatchupRange(\n        reconstructBatches(\n          this.#pg.readCatchupRange(previousBoundary, watermark, pgMaxRows),\n        ),\n        watermark,\n        pgMaxRows,\n        pgMaxBytes,\n      );\n    } catch (e) {\n      // A failed catchup read makes the transaction suspect.\n      this.#lc.warn?.(\n        `error reading transaction ${watermark} for comparison`,\n        e,\n      );\n      return {\n        outcome: await this.#reconfirm(db, pinned, watermark),\n        sqliteRowsRead: 0,\n        pgRowsRead: 0,\n        sqliteBytesRead: 0,\n        pgBytesRead: 0,\n      };\n    }\n    const read = {\n      sqliteRowsRead: sqlite.rows,\n      pgRowsRead: pg.rows,\n      sqliteBytesRead: sqlite.bytes,\n      pgBytesRead: pg.bytes,\n    };\n    if (sqlite.limitReached || pg.limitReached) {\n      // Skip a transaction that cannot fit in a fresh budget.\n      // Defer one that does not fit only in the remaining budget.\n      // A budget is fresh when neither dimension has been spent.\n      const sqliteFresh =\n        sqliteMaxRows === maxRowsPerSource &&\n        sqliteMaxBytes === maxBytesPerSource;\n      const pgFresh =\n        pgMaxRows === maxRowsPerSource && pgMaxBytes === maxBytesPerSource;\n      const outcome =\n        (sqlite.limitReached && sqliteFresh) || (pg.limitReached && pgFresh)\n          ? 'oversized'\n          : 'deferred';\n      return {outcome, ...read};\n    }\n    if (sqlite.digest === pg.digest) {\n      return {outcome: 'match', ...read};\n    }\n    return {\n      outcome: await this.#reconfirm(db, pinned, watermark),\n      ...read,\n    };\n  }\n\n  /**\n   * Rechecks a suspect result against current store bounds.\n   * A moved bound, changed seed, failed read, or lower head makes the result inconclusive.\n   */\n  async #reconfirm(\n    db: Database,\n    pinned: PinnedBounds,\n    watermark: string,\n  ): Promise<'mismatch' | 'inconclusive'> {\n    try {\n      const meta = readChangeLogMeta(db);\n      if (\n        meta.seedWatermark !== pinned.meta.seedWatermark ||\n        meta.seededAtMs !== pinned.meta.seededAtMs\n      ) {\n        return 'inconclusive';\n      }\n      const sqlite = this.#readSQLiteBounds(db);\n      const {minWatermark, lastWatermark} = await this.#pg.getCatchupBounds();\n      if (sqlite === undefined || minWatermark === null) {\n        return 'inconclusive';\n      }\n      if (\n        (sqlite.minWatermark > pinned.sqlite.minWatermark &&\n          watermark <= sqlite.minWatermark) ||\n        (minWatermark > pinned.pgMinWatermark && watermark <= minWatermark) ||\n        watermark > sqlite.headWatermark ||\n        watermark > lastWatermark\n      ) {\n        return 'inconclusive';\n      }\n      return 'mismatch';\n    } catch {\n      return 'inconclusive';\n    }\n  }\n\n  #skipped(reason: CompareSkipReason): CompareCycleResult {\n    this.#compareCycles.add(1, {result: reason});\n    if (reason === 'error') {\n      // The caller logged the error.\n    } else if (reason !== 'nothing-to-compare') {\n      this.#lc.debug?.(`skipping SQLite change-log comparison: ${reason}`);\n    }\n    return {kind: 'skipped', reason};\n  }\n\n  #compared(\n    fromWatermark: string,\n    throughWatermark: string,\n    transactions: number,\n    sampled: number,\n    outcomes: Record<CompareOutcome, number>,\n  ): CompareCycleResult {\n    this.#compareCycles.add(1, {result: 'compared'});\n    const result = {\n      kind: 'compared',\n      fromWatermark,\n      throughWatermark,\n      transactions,\n      sampled,\n      matched: outcomes.match,\n      mismatched: outcomes.mismatch,\n      inconclusive: outcomes.inconclusive,\n      deferred: outcomes.deferred,\n      oversized: outcomes.oversized,\n    } as const;\n    this.#lc.debug?.('SQLite change-log comparison cycle', {\n      sqliteChangeLogCompare: result,\n    });\n    return result;\n  }\n}\n\n/** Applies the same reconstruction as Postgres catchup. */\nasync function* reconstructBatches(\n  batches: AsyncIterable<ChangeLogEntry[]>,\n): AsyncIterable<WatermarkedChange[]> {\n  for await (const batch of batches) {\n    yield batch.map(reconstructWatermarkedChange);\n  }\n}\n\nfunction minWatermark(a: string, b: string): string {\n  return a < b ? a : b;\n}\n\nfunction maxWatermark(...watermarks: string[]): string {\n  let max = watermarks[0];\n  for (const w of watermarks) {\n    if (w > max) {\n      max = w;\n    }\n  }\n  return max;\n}\n"],"mappings":";;;;;;;;;AA2BA,IAAM,8BAA8B;;AAGpC,IAAM,qCAAqC;;AAG3C,IAAM,wCAAwC;;;;;;;;AAS9C,IAAM,yCAAyC,KAAK,OAAO;;AAG3D,IAAM,0BAA0B;;AA8FhC,IAAM,oBAA4B;;qCAEG,wBAAwB;;qCAExB,wBAAwB;;;;AAK7D,IAAM,qBAA6B;6BACN,wBAAwB;;;;;;;;;;;;;;;AAoCrD,IAAa,4BAAb,MAAuC;CACrC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA,kBAA2B,mBACzB,WACA,oCACA,0MAGF;CACA,iBAA0B,mBACxB,WACA,oCACA,iDACF;CACA,iBAA0B,4BACxB,WACA,4CACA,qDACF;;CAGA;CACA;CACA;CACA,WAAW;CACX,wBAAwB;CACxB,kBAAkB;CAElB,YACE,IACA,OACA,eACA,UACA,IACA,MACA;EACA,KAAKA,MAAM,GAAG,YAAY,aAAa,2BAA2B;EAClE,KAAKC,SAAS;EACd,KAAKC,iBAAiB;EACtB,KAAKC,YAAY;EACjB,KAAKC,MAAM;EACX,KAAKC,QAAQ;EACb,KAAKC,OAAO,KAAK,OAAO,KAAK;EAC7B,KAAKC,gBAAgB,KAAK,gBAAgB;EAC1C,KAAKC,kBAAkB,KAAK,kBAAkB;EAC9C,KAAKC,SACH,KAAK,kBACE,IAAI,SAAc,YAAW,aAAa,OAAO,CAAC;EAC3D,KAAKI,cAAc;CACrB;;;;;CAMA,cAA2C;EACzC,IAAI,KAAKC,UACP,OAAO,QAAQ,QAAQ;GAAC,MAAM;GAAW,QAAQ;EAAS,CAAC;EAE7D,IAAI,KAAKC,aAAa,KAAA,GACpB,KAAKA,WAAW,KAAKC,UAAU,EAC5B,MAAK,WAAU;GACd,IAAI,KAAKC,uBACP,KAAKC,gBAAgB,CAAC;GAExB,OAAO;EACT,CAAC,EACA,cAAc;GACb,KAAKH,WAAW,KAAA;EAClB,CAAC;EAEL,OAAO,KAAKA;CACd;CAEA,OAAa;EACX,KAAKD,WAAW;EAChB,IAAI,KAAKK,WAAW,KAAA,GAAW;GAC7B,KAAKX,gBAAgB,KAAKW,MAAM;GAChC,KAAKA,SAAS,KAAA;EAChB;CACF;;CAGA,aAAmB;EACjB,KAAKC;EACL,KAAKC,UAAU,KAAA;EACf,KAAKJ,wBAAwB;CAC/B;CAEA,cACE,UAAU,KAAKZ,MAAM,cAAc,6BAC7B;EACN,IAAI,KAAKS,YAAY,KAAKK,WAAW,KAAA,GACnC;EAEF,KAAKA,SAAS,KAAKZ,oBAAoB;GACrC,KAAKY,SAAS,KAAA;GACd,KAAU,YAAY,EAAE,cAAc,KAAKN,cAAc,CAAC;EAC5D,GAAG,OAAO;CACZ;CAEA,gBAAgB,SAAuB;EACrC,IAAI,KAAKM,WAAW,KAAA,GAAW;GAC7B,KAAKX,gBAAgB,KAAKW,MAAM;GAChC,KAAKA,SAAS,KAAA;EAChB;EACA,KAAKN,cAAc,OAAO;CAC5B;CAEA,MAAMG,YAAyC;EAC7C,MAAM,YAAY,YAAY,IAAI;EAClC,MAAM,iBAAiB,KAAKI;EAC5B,KAAKH,wBAAwB;EAC7B,IAAI;EACJ,IAAI;EACJ,IAAI;GACF,IAAI;IAEF,KAAK,IAAI,SAAS,KAAKjB,KAAK,KAAKE,gBAAgB,EAAC,UAAU,KAAI,CAAC;GACnE,QAAQ;IACN,OAAO,KAAKoB,SAAS,iBAAiB;GACxC;GAEA,MAAM,SAAS,MAAM,KAAKC,WAAW,EAAE;GACvC,IAAI,mBAAmB,KAAKH,iBAC1B,OAAO,KAAKE,SAAS,aAAa;GAEpC,IAAI,OAAO,WAAW,UACpB,OAAO,KAAKA,SAAS,MAAM;GAE7B,MAAM,EAAC,SAAQ;GAEf,MAAM,OAAO,aACX,KAAKD,WAAW,KAAK,eAGrB,KAAK,eAEL,OAAO,gBACP,OAAO,OAAO,YAChB;GACA,MAAM,UAAU,aACd,OAAO,iBACP,OAAO,OAAO,aAChB;GACA,IAAI,WAAW,MACb,OAAO,KAAKC,SAAS,oBAAoB;GAG3C,IAAI,eAAe;GACnB,IAAI,UAAU;GACd,MAAM,WAA2C;IAC/C,OAAO;IACP,UAAU;IACV,cAAc;IACd,UAAU;IACV,WAAW;GACb;GACA,MAAM,UAAU,WAAmB,YAA4B;IAC7D,KAAKZ,gBAAgB,IAAI,GAAG,EAAC,QAAO,CAAC;IACrC,SAAS;IACT,IAAI,YAAY,YAEd,KAAKV,IAAI,QACP,2DACA,EAAC,wBAAwB,EAAC,UAAS,EAAC,CACtC;GAEJ;GAEA,SAAS,IAAI,sBAAsB,KAAKA,KAAK,KAAKE,cAAc;GAChE,MAAM,OAAO,OAAO,KAAK,IAAI;GAC7B,IAAI,KAAK,SAAS,aAChB,OAAO,KAAKoB,SAAS,iBAAiB;GAExC,IAAI,KAAK,SAAS,SAChB,OAAO,KAAKA,SAAS,oBAAoB;GAE3C,IAAI,KAAK,SAAS,WAAW;IAG3B,MAAM,cAAc,MAAM,KAAKE,WAAW,IAAI,QAAQ,IAAI;IAC1D,MAAM,UACJ,mBAAmB,KAAKJ,kBACpB,cACA;IACN,OAAO,MAAM,OAAO;IACpB,IAAI,YAAY,gBAEd,OAAO,KAAKK,UAAU,MAAM,MAAM,cAAc,SAAS,QAAQ;GAIrE;GAEA,MAAM,QAAQ,KAAK,IACjB,GACA,KAAKpB,MAAM,2BACT,kCACJ;GACA,MAAM,QAAQ,MAAM,KAAKqB,kBAAkB,IAAI,MAAM,SAAS,KAAK;GACnE,IAAI,mBAAmB,KAAKN,iBAC1B,OAAO,KAAKE,SAAS,aAAa;GAEpC,MAAM,mBAAmB,KAAK,IAC5B,GACA,KAAKjB,MAAM,4BACT,qCACJ;GACA,MAAM,oBAAoB,KAAK,IAC7B,GACA,KAAKA,MAAM,6BACT,sCACJ;GAEA,IAAI,iBAAiB;GACrB,IAAI,aAAa;GACjB,IAAI,kBAAkB;GACtB,IAAI,cAAc;GAClB,IAAI,mBAAmB;GACvB,IAAI,iBAAiB;GACrB,KAAK,MAAM,EAAC,WAAW,UAAU,UAAS,OAAO;IAC/C,IAAI,KAAKS,UACP;IAEF,IAAI,uBAAuB;IAC3B,IAAI,CAAC,YAAY,CAAC,MAAM;KAEtB,MAAM,UAAU,MAAM,KAAKU,WAAW,IAAI,QAAQ,SAAS;KAC3D,OACE,WACA,mBAAmB,KAAKJ,kBAAkB,UAAU,cACtD;IACF,OAAO,IACL,kBAAkB,KAAKnB,QAAQ,WAAW,KAAKI,MAAM,cAAc,GACnE;KACA,MAAM,sBAAsB,mBAAmB;KAC/C,MAAM,kBAAkB,mBAAmB;KAG3C,MAAM,uBAAuB,oBAAoB;KACjD,MAAM,mBAAmB,oBAAoB;KAC7C,IACE,wBAAwB,KACxB,oBAAoB,KACpB,wBAAwB,KACxB,oBAAoB,GACpB;MACA,OAAO,WAAW,UAAU;MAC5B;KACF;KACA;KACA,MAAM,aAAa,MAAM,KAAKsB,oBAC5B,IACA,QACA,QACA,kBACA,WACA,qBACA,iBACA,sBACA,kBACA,kBACA,iBACF;KACA,kBAAkB,WAAW;KAC7B,cAAc,WAAW;KACzB,mBAAmB,WAAW;KAC9B,eAAe,WAAW;KAC1B,MAAM,UACJ,mBAAmB,KAAKP,kBACpB,WAAW,UACX;KACN,OAAO,WAAW,OAAO;KACzB,IAAI,YAAY,gBACd;KAEF,IAAI,YAAY,YACd;KAEF,IAAI,YAAY,aAEd,uBAAuB;KAGzB,MAAM,KAAKX,OAAO;IACpB;IACA,mBAAmB;IACnB,iBAAiB;IACjB;IACA,IAAI,sBACF;GAEJ;GAEA,IACE,CAAC,KAAKK,YACN,mBAAmB,KAAKM,mBACxB,SAAS,iBAAiB,GAC1B;IACA,KAAKC,UAAU;IACf,KAAKJ,wBAAwB,iBAAiB;GAChD;GACA,OAAO,KAAKQ,UACV,MACA,gBACA,cACA,SACA,QACF;EACF,SAAS,GAAG;GACV,KAAKzB,IAAI,OAAO,yCAAyC,CAAC;GAC1D,OAAO,KAAKsB,SAAS,OAAO;EAC9B,UAAU;GACR,QAAQ,MAAM;GACd,IAAI,MAAM;GACV,KAAKV,eAAe,SAAS,YAAY,IAAI,IAAI,SAAS;EAC5D;CACF;;CAGA,MAAMW,WAAW,IAAyD;EACxE,IAAI;EACJ,IAAI;GACF,OAAO,kBAAkB,EAAE;EAC7B,QAAQ;GAEN,OAAO;EACT;EACA,IAAI,KAAK,kBAAA,GACP,OAAO;EAET,MAAM,EAAC,OAAO,YAAY,cAAa,KAAKpB;EAC5C,IACE,KAAK,UAAU,SACf,KAAK,eAAe,cACpB,KAAK,cAAc,WAEnB,OAAO;EAET,IAAI,KAAKG,KAAK,IAAI,KAAK,aAAa,KAAKD,MAAM,aAC7C,OAAO;EAET,MAAM,SAAS,KAAKuB,kBAAkB,EAAE;EACxC,IAAI,WAAW,KAAA,GACb,OAAO;EAET,MAAM,EAAC,cAAc,kBAAiB,MAAM,KAAKxB,IAAI,iBAAiB;EACtE,IAAI,iBAAiB,MAEnB,OAAO;EAET,OAAO;GACL;GACA;GACA,gBAAgB;GAChB,iBAAiB;EACnB;CACF;CAEA,kBAAkB,IAAwC;EACxD,MAAM,SAAS,GACZ,QAAQ,iBAAiB,EACzB,IAAiE;EACpE,OAAO,OAAO,iBAAiB,QAAQ,OAAO,kBAAkB,OAC5D,KAAA,IACA;GACE,cAAc,OAAO;GACrB,eAAe,OAAO;EACxB;CACN;;;;;CAMA,MAAMsB,kBACJ,IACA,MACA,SACA,OACkE;EAClE,IAAI,SAAmB,GACpB,QAAQ,kBAAkB,EAC1B,IAAyB;GAAC,OAAO;GAAM;GAAS,OAAO,QAAQ;EAAC,CAAC,EACjE,KAAK,EAAC,gBAAe,SAAS;EACjC,IAAI,KAAK,MAAM,KAAKtB,IAAI,qBAAqB,MAAM,SAAS,QAAQ,CAAC;EAErE,IAAI,mBAAmB;EACvB,IAAI,OAAO,SAAS,OAAO;GACzB,OAAO,SAAS;GAChB,mBAAmB,aAAa,kBAAkB,OAAO,QAAQ,EAAE;EACrE;EACA,IAAI,GAAG,SAAS,OAAO;GACrB,GAAG,SAAS;GACZ,mBAAmB,aAAa,kBAAkB,GAAG,QAAQ,EAAE;EACjE;EACA,IAAI,qBAAqB,SAAS;GAChC,SAAS,OAAO,QAAO,MAAK,KAAK,gBAAgB;GACjD,KAAK,GAAG,QAAO,MAAK,KAAK,gBAAgB;EAC3C;EAEA,MAAM,QAAiE,CAAC;EACxE,IAAI,IAAI;EACR,IAAI,IAAI;EACR,OAAO,IAAI,OAAO,UAAU,IAAI,GAAG,QAAQ;GACzC,MAAM,KAAK,IAAI,OAAO,SAAS,OAAO,KAAK,KAAA;GAC3C,MAAM,KAAK,IAAI,GAAG,SAAS,GAAG,KAAK,KAAA;GACnC,IAAI,OAAO,KAAA,MAAc,OAAO,KAAA,KAAa,KAAK,KAAK;IACrD,MAAM,KAAK;KAAC,WAAW;KAAI,UAAU;KAAM,MAAM;IAAK,CAAC;IACvD;GACF,OAAO,IAAI,OAAO,KAAA,MAAc,OAAO,KAAA,KAAa,KAAK,KAAK;IAC5D,MAAM,KAAK;KAAC,WAAW;KAAI,UAAU;KAAO,MAAM;IAAI,CAAC;IACvD;GACF,OAAO,IAAI,OAAO,KAAA,GAAW;IAC3B,MAAM,KAAK;KAAC,WAAW;KAAI,UAAU;KAAM,MAAM;IAAI,CAAC;IACtD;IACA;GACF;EACF;EACA,OAAO;CACT;;;;;CAMA,MAAMuB,oBACJ,IACA,QACA,QACA,kBACA,WACA,eACA,WACA,gBACA,YACA,kBACA,mBAC4B;EAC5B,IAAI;EACJ,IAAI;EACJ,IAAI;GACF,MAAM,gBAAgB,KAAKtB,MAAM,iBAAiB;GAClD,SAAS,MAAM,mBACb,OAAO,KACL,kBACA,WACA,KAAK,IAAI,eAAe,aAAa,GACrC,KAAA,GACA,aACF,GACA,WACA,eACA,cACF;GACA,KAAK,MAAM,mBACT,mBACE,KAAKD,IAAI,iBAAiB,kBAAkB,WAAW,SAAS,CAClE,GACA,WACA,WACA,UACF;EACF,SAAS,GAAG;GAEV,KAAKJ,IAAI,OACP,6BAA6B,UAAU,kBACvC,CACF;GACA,OAAO;IACL,SAAS,MAAM,KAAKwB,WAAW,IAAI,QAAQ,SAAS;IACpD,gBAAgB;IAChB,YAAY;IACZ,iBAAiB;IACjB,aAAa;GACf;EACF;EACA,MAAM,OAAO;GACX,gBAAgB,OAAO;GACvB,YAAY,GAAG;GACf,iBAAiB,OAAO;GACxB,aAAa,GAAG;EAClB;EACA,IAAI,OAAO,gBAAgB,GAAG,cAAc;GAI1C,MAAM,cACJ,kBAAkB,oBAClB,mBAAmB;GACrB,MAAM,UACJ,cAAc,oBAAoB,eAAe;GAKnD,OAAO;IAAC,SAHL,OAAO,gBAAgB,eAAiB,GAAG,gBAAgB,UACxD,cACA;IACW,GAAG;GAAI;EAC1B;EACA,IAAI,OAAO,WAAW,GAAG,QACvB,OAAO;GAAC,SAAS;GAAS,GAAG;EAAI;EAEnC,OAAO;GACL,SAAS,MAAM,KAAKA,WAAW,IAAI,QAAQ,SAAS;GACpD,GAAG;EACL;CACF;;;;;CAMA,MAAMA,WACJ,IACA,QACA,WACsC;EACtC,IAAI;GACF,MAAM,OAAO,kBAAkB,EAAE;GACjC,IACE,KAAK,kBAAkB,OAAO,KAAK,iBACnC,KAAK,eAAe,OAAO,KAAK,YAEhC,OAAO;GAET,MAAM,SAAS,KAAKI,kBAAkB,EAAE;GACxC,MAAM,EAAC,cAAc,kBAAiB,MAAM,KAAKxB,IAAI,iBAAiB;GACtE,IAAI,WAAW,KAAA,KAAa,iBAAiB,MAC3C,OAAO;GAET,IACG,OAAO,eAAe,OAAO,OAAO,gBACnC,aAAa,OAAO,gBACrB,eAAe,OAAO,kBAAkB,aAAa,gBACtD,YAAY,OAAO,iBACnB,YAAY,eAEZ,OAAO;GAET,OAAO;EACT,QAAQ;GACN,OAAO;EACT;CACF;CAEA,SAAS,QAA+C;EACtD,KAAKO,eAAe,IAAI,GAAG,EAAC,QAAQ,OAAM,CAAC;EAC3C,IAAI,WAAW,SAAS,CAExB,OAAO,IAAI,WAAW,sBACpB,KAAKX,IAAI,QAAQ,0CAA0C,QAAQ;EAErE,OAAO;GAAC,MAAM;GAAW;EAAM;CACjC;CAEA,UACE,eACA,kBACA,cACA,SACA,UACoB;EACpB,KAAKW,eAAe,IAAI,GAAG,EAAC,QAAQ,WAAU,CAAC;EAC/C,MAAM,SAAS;GACb,MAAM;GACN;GACA;GACA;GACA;GACA,SAAS,SAAS;GAClB,YAAY,SAAS;GACrB,cAAc,SAAS;GACvB,UAAU,SAAS;GACnB,WAAW,SAAS;EACtB;EACA,KAAKX,IAAI,QAAQ,sCAAsC,EACrD,wBAAwB,OAC1B,CAAC;EACD,OAAO;CACT;AACF;;AAGA,gBAAgB,mBACd,SACoC;CACpC,WAAW,MAAM,SAAS,SACxB,MAAM,MAAM,IAAI,4BAA4B;AAEhD;AAEA,SAAS,aAAa,GAAW,GAAmB;CAClD,OAAO,IAAI,IAAI,IAAI;AACrB;AAEA,SAAS,aAAa,GAAG,YAA8B;CACrD,IAAI,MAAM,WAAW;CACrB,KAAK,MAAM,KAAK,YACd,IAAI,IAAI,KACN,MAAM;CAGV,OAAO;AACT"}
+{"version":3,"file":"sqlite-change-log-comparator.js","names":[],"sources":["../../../../../../zero-cache/src/services/change-streamer/sqlite-change-log-comparator.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {Database} from '../../../../zqlite/src/db.ts';\nimport {\n  getOrCreateCounter,\n  getOrCreateLatencyHistogram,\n} from '../../observability/metrics.ts';\nimport type {ShardID} from '../../types/shards.ts';\nimport {\n  CHANGE_LOG_DB_SCHEMA_VERSION,\n  CHANGE_LOG_STREAM_TABLE,\n  readChangeLogMeta,\n  type ChangeLogIdentity,\n  type ChangeLogMeta,\n} from '../replicator/change-log-db.ts';\nimport {\n  reconstructWatermarkedChange,\n  type ChangeLogEntry,\n} from './change-log-codec.ts';\nimport {\n  digestCatchupRange,\n  type CatchupRangeDigest,\n} from './change-log-compare-digest.ts';\nimport type {WatermarkedChange} from './change-streamer.ts';\nimport {isSampledForShard} from './shard-sampling.ts';\nimport {SQLiteChangeLogReader} from './sqlite-change-log-reader.ts';\n\n/** Interval between comparison cycles. */\nconst DEFAULT_COMPARE_INTERVAL_MS = 30_000;\n\n/** Maximum transactions enumerated per cycle. */\nconst DEFAULT_MAX_TRANSACTIONS_PER_CYCLE = 256;\n\n/** Maximum catchup rows read from each store per cycle. */\nconst DEFAULT_MAX_ROWS_PER_SOURCE_PER_CYCLE = 1000;\n\n/**\n * Maximum catchup bytes read from each store per cycle.\n *\n * Rows bound the per-row overhead. Bytes bound the read and hash work,\n * which scales with payload size instead of row count. Normal traffic\n * reaches the row limit first. Wide payloads reach this one.\n */\nconst DEFAULT_MAX_BYTES_PER_SOURCE_PER_CYCLE = 32 * 1024 * 1024;\n\n/** Rows per SQLite catchup batch. */\nconst DEFAULT_READ_BATCH_ROWS = 1000;\n\n/**\n * Result for one committed transaction.\n *\n * `mismatch` covers missing, extra, changed, or reordered rows.\n * `inconclusive` means that store bounds changed during the comparison.\n */\nexport type CompareOutcome =\n  | 'match'\n  | 'mismatch'\n  | 'inconclusive'\n  | 'deferred'\n  | 'oversized';\n\nexport type CompareSkipReason =\n  // The comparator was stopped.\n  | 'stopped'\n  // The writer replaced the file during this cycle.\n  | 'log-rebuilt'\n  // The file is absent, unreadable, or uninitialized.\n  | 'log-unavailable'\n  // The schema version does not match this build.\n  | 'ineligible-schema'\n  // The log belongs to a different replica.\n  | 'ineligible-identity'\n  // The log is younger than the warm-up period.\n  | 'cold-log'\n  // The stores have no complete committed range in common.\n  | 'nothing-to-compare'\n  // The cycle failed. The error was logged and counted.\n  | 'error';\n\nexport type CompareCycleResult =\n  | {readonly kind: 'skipped'; readonly reason: CompareSkipReason}\n  | {\n      readonly kind: 'compared';\n      /** Exclusive lower bound of the compared range. */\n      readonly fromWatermark: string;\n      /** Inclusive upper bound handled. The next cycle resumes from here. */\n      readonly throughWatermark: string;\n      /** Committed transactions handled through `throughWatermark`. */\n      readonly transactions: number;\n      /** Transactions with compared catchup output. */\n      readonly sampled: number;\n      readonly matched: number;\n      readonly mismatched: number;\n      /** Suspects rejected because store bounds changed. */\n      readonly inconclusive: number;\n      /** Sampled transactions deferred to a fresh budget. */\n      readonly deferred: number;\n      /** Sampled transactions that exceed a fresh budget. */\n      readonly oversized: number;\n    };\n\n/** Provides the Postgres side of the catchup comparison. */\nexport interface PGChangeLogRangeReader {\n  getCatchupBounds(): Promise<{\n    minWatermark: string | null;\n    lastWatermark: string;\n  }>;\n  listCommitWatermarks(\n    afterWatermark: string,\n    throughWatermark: string,\n    limit: number,\n  ): Promise<string[]>;\n  readCatchupRange(\n    afterWatermark: string,\n    throughWatermark: string,\n    batchRows?: number | undefined,\n  ): AsyncIterable<ChangeLogEntry[]>;\n}\n\nexport type SQLiteChangeLogCompareOptions = {\n  /** Stable percentage of transactions selected for payload comparison. */\n  readonly comparePercent: number;\n  /** Warm-up time after a seed. The comparator skips a younger log. */\n  readonly retentionMs: number;\n  readonly intervalMs?: number | undefined;\n  readonly maxTransactionsPerCycle?: number | undefined;\n  /** Maximum catchup rows read from each store in one cycle. */\n  readonly maxRowsPerSourcePerCycle?: number | undefined;\n  /** Maximum catchup bytes read from each store in one cycle. */\n  readonly maxBytesPerSourcePerCycle?: number | undefined;\n  readonly readBatchRows?: number | undefined;\n  /** Clock for the warm-up period. Defaults to `Date.now`. */\n  readonly now?: (() => number) | undefined;\n  readonly setTimeoutFn?: typeof setTimeout | undefined;\n  readonly clearTimeoutFn?: typeof clearTimeout | undefined;\n  /** Yields between sampled transactions. Defaults to `setImmediate`. */\n  readonly yieldFn?: (() => Promise<void>) | undefined;\n};\n\n/** Uses separate aggregates so SQLite can use an index for each value. */\nconst SQLITE_BOUNDS_SQL = /*sql*/ `\n  SELECT\n    (SELECT min(\"watermark\") FROM \"${CHANGE_LOG_STREAM_TABLE}\")\n      AS \"minWatermark\",\n    (SELECT max(\"watermark\") FROM \"${CHANGE_LOG_STREAM_TABLE}\")\n      AS \"headWatermark\"\n`;\n\n/** Lists committed transaction watermarks in `(@after, @through]`. */\nconst SQLITE_COMMITS_SQL = /*sql*/ `\n  SELECT \"watermark\" FROM \"${CHANGE_LOG_STREAM_TABLE}\"\n   WHERE \"precommit\" IS NOT NULL\n     AND \"watermark\" > @after\n     AND \"watermark\" <= @through\n   ORDER BY \"watermark\"\n   LIMIT @limit\n`;\n\ntype SQLiteBounds = {\n  readonly minWatermark: string;\n  readonly headWatermark: string;\n};\n\ntype PinnedBounds = {\n  readonly meta: ChangeLogMeta;\n  readonly sqlite: SQLiteBounds;\n  readonly pgMinWatermark: string;\n  readonly pgLastWatermark: string;\n};\n\ntype SampledComparison = {\n  readonly outcome: CompareOutcome;\n  readonly sqliteRowsRead: number;\n  readonly pgRowsRead: number;\n  readonly sqliteBytesRead: number;\n  readonly pgBytesRead: number;\n};\n\n/**\n * Compares SQLite and Postgres catchup output without affecting subscribers.\n *\n * Each cycle compares complete ranges through the lower store head.\n * It checks every transaction for presence and samples payloads.\n * A bounds change makes the affected result `inconclusive`.\n * Postgres remains authoritative.\n */\nexport class SQLiteChangeLogComparator {\n  readonly #lc: LogContext;\n  readonly #shard: ShardID;\n  readonly #changeLogFile: string;\n  readonly #identity: ChangeLogIdentity;\n  readonly #pg: PGChangeLogRangeReader;\n  readonly #opts: SQLiteChangeLogCompareOptions;\n  readonly #now: () => number;\n  readonly #setTimeoutFn: typeof setTimeout;\n  readonly #clearTimeoutFn: typeof clearTimeout;\n  readonly #yield: () => Promise<void>;\n\n  readonly #compareResults = getOrCreateCounter(\n    'replica',\n    'sqlite_change_log.compare_result',\n    'Outcomes of the dark comparison between what SQLite catchup serves and ' +\n      'what PG catchup serves, per committed transaction. `inconclusive` ' +\n      'means a purge or reseed moved the pinned bounds mid-comparison.',\n  );\n  readonly #compareCycles = getOrCreateCounter(\n    'replica',\n    'sqlite_change_log.compare_cycles',\n    'SQLite change-log comparison cycles, by result.',\n  );\n  readonly #cycleDuration = getOrCreateLatencyHistogram(\n    'replica',\n    'sqlite_change_log.compare_cycle_duration',\n    'Duration of one SQLite change-log comparison cycle.',\n  );\n\n  /** Last handled commit watermark. A restart derives it from current bounds. */\n  #cursor: string | undefined;\n  #running: Promise<CompareCycleResult> | undefined;\n  #timer: ReturnType<typeof setTimeout> | undefined;\n  #stopped = false;\n  #continueWithoutDelay = false;\n  #fileGeneration = 0;\n\n  constructor(\n    lc: LogContext,\n    shard: ShardID,\n    changeLogFile: string,\n    identity: ChangeLogIdentity,\n    pg: PGChangeLogRangeReader,\n    opts: SQLiteChangeLogCompareOptions,\n  ) {\n    this.#lc = lc.withContext('component', 'sqlite-change-log-compare');\n    this.#shard = shard;\n    this.#changeLogFile = changeLogFile;\n    this.#identity = identity;\n    this.#pg = pg;\n    this.#opts = opts;\n    this.#now = opts.now ?? Date.now;\n    this.#setTimeoutFn = opts.setTimeoutFn ?? setTimeout;\n    this.#clearTimeoutFn = opts.clearTimeoutFn ?? clearTimeout;\n    this.#yield =\n      opts.yieldFn ??\n      (() => new Promise<void>(resolve => setImmediate(resolve)));\n    this.#scheduleNext();\n  }\n\n  /**\n   * Runs one cycle. Concurrent calls share the same promise.\n   * Errors produce `skipped: 'error'`.\n   */\n  compareOnce(): Promise<CompareCycleResult> {\n    if (this.#stopped) {\n      return Promise.resolve({kind: 'skipped', reason: 'stopped'});\n    }\n    if (this.#running === undefined) {\n      this.#running = this.#runCycle()\n        .then(result => {\n          if (this.#continueWithoutDelay) {\n            this.#rescheduleNext(0);\n          }\n          return result;\n        })\n        .finally(() => {\n          this.#running = undefined;\n        });\n    }\n    return this.#running;\n  }\n\n  stop(): void {\n    this.#stopped = true;\n    if (this.#timer !== undefined) {\n      this.#clearTimeoutFn(this.#timer);\n      this.#timer = undefined;\n    }\n  }\n\n  /** Invalidates cycles that can still read a replaced file. */\n  invalidate(): void {\n    this.#fileGeneration++;\n    this.#cursor = undefined;\n    this.#continueWithoutDelay = false;\n  }\n\n  #scheduleNext(\n    delayMs = this.#opts.intervalMs ?? DEFAULT_COMPARE_INTERVAL_MS,\n  ): void {\n    if (this.#stopped || this.#timer !== undefined) {\n      return;\n    }\n    this.#timer = this.#setTimeoutFn(() => {\n      this.#timer = undefined;\n      void this.compareOnce().finally(() => this.#scheduleNext());\n    }, delayMs);\n  }\n\n  #rescheduleNext(delayMs: number): void {\n    if (this.#timer !== undefined) {\n      this.#clearTimeoutFn(this.#timer);\n      this.#timer = undefined;\n    }\n    this.#scheduleNext(delayMs);\n  }\n\n  async #runCycle(): Promise<CompareCycleResult> {\n    const startedAt = performance.now();\n    const fileGeneration = this.#fileGeneration;\n    this.#continueWithoutDelay = false;\n    let db: Database | undefined;\n    let reader: SQLiteChangeLogReader | undefined;\n    try {\n      try {\n        // A readonly handle does not create a missing file.\n        db = new Database(this.#lc, this.#changeLogFile, {readonly: true});\n      } catch {\n        return this.#skipped('log-unavailable');\n      }\n\n      const pinned = await this.#pinBounds(db);\n      if (fileGeneration !== this.#fileGeneration) {\n        return this.#skipped('log-rebuilt');\n      }\n      if (typeof pinned === 'string') {\n        return this.#skipped(pinned);\n      }\n      const {meta} = pinned;\n\n      const from = maxWatermark(\n        this.#cursor ?? meta.seedWatermark,\n        // Exclude the synthetic SQLite seed transaction.\n        // The Postgres seed has no `precommit`, so enumeration also excludes it.\n        meta.seedWatermark,\n        // A store cannot serve the transaction at its minimum watermark.\n        pinned.pgMinWatermark,\n        pinned.sqlite.minWatermark,\n      );\n      const through = minWatermark(\n        pinned.pgLastWatermark,\n        pinned.sqlite.headWatermark,\n      );\n      if (through <= from) {\n        return this.#skipped('nothing-to-compare');\n      }\n\n      let transactions = 0;\n      let sampled = 0;\n      const outcomes: Record<CompareOutcome, number> = {\n        match: 0,\n        mismatch: 0,\n        inconclusive: 0,\n        deferred: 0,\n        oversized: 0,\n      };\n      const record = (watermark: string, outcome: CompareOutcome) => {\n        this.#compareResults.add(1, {outcome});\n        outcomes[outcome]++;\n        if (outcome === 'mismatch') {\n          // Log only the watermark because payloads contain customer data.\n          this.#lc.error?.(\n            'SQLite change-log catchup output diverged from Postgres',\n            {sqliteChangeLogCompare: {watermark}},\n          );\n        }\n      };\n\n      reader = new SQLiteChangeLogReader(this.#lc, this.#changeLogFile);\n      const plan = reader.plan(from);\n      if (plan.kind === 'not-ready') {\n        return this.#skipped('log-unavailable');\n      }\n      if (plan.kind === 'ahead') {\n        return this.#skipped('nothing-to-compare');\n      }\n      if (plan.kind === 'too-old') {\n        // A fixed lower bound makes this result a mismatch.\n        // A changed lower bound makes it inconclusive.\n        const reconfirmed = await this.#reconfirm(db, pinned, from);\n        const outcome =\n          fileGeneration === this.#fileGeneration\n            ? reconfirmed\n            : 'inconclusive';\n        record(from, outcome);\n        if (outcome === 'inconclusive') {\n          // Keep the cursor unchanged because the bounds moved.\n          return this.#compared(from, from, transactions, sampled, outcomes);\n        }\n        // Positional reads can continue after a missing boundary.\n        // Advancing avoids reporting the same boundary in every cycle.\n      }\n\n      const limit = Math.max(\n        1,\n        this.#opts.maxTransactionsPerCycle ??\n          DEFAULT_MAX_TRANSACTIONS_PER_CYCLE,\n      );\n      const union = await this.#enumerateCommits(db, from, through, limit);\n      if (fileGeneration !== this.#fileGeneration) {\n        return this.#skipped('log-rebuilt');\n      }\n      const maxRowsPerSource = Math.max(\n        1,\n        this.#opts.maxRowsPerSourcePerCycle ??\n          DEFAULT_MAX_ROWS_PER_SOURCE_PER_CYCLE,\n      );\n      const maxBytesPerSource = Math.max(\n        1,\n        this.#opts.maxBytesPerSourcePerCycle ??\n          DEFAULT_MAX_BYTES_PER_SOURCE_PER_CYCLE,\n      );\n\n      let sqliteRowsRead = 0;\n      let pgRowsRead = 0;\n      let sqliteBytesRead = 0;\n      let pgBytesRead = 0;\n      let previousBoundary = from;\n      let handledThrough = from;\n      for (const {watermark, inSqlite, inPg} of union) {\n        if (this.#stopped) {\n          break;\n        }\n        let stopAfterTransaction = false;\n        if (!inSqlite || !inPg) {\n          // Check every transaction for presence because this needs no payload read.\n          const outcome = await this.#reconfirm(db, pinned, watermark);\n          record(\n            watermark,\n            fileGeneration === this.#fileGeneration ? outcome : 'inconclusive',\n          );\n        } else if (\n          isSampledForShard(this.#shard, watermark, this.#opts.comparePercent)\n        ) {\n          const sqliteRowsRemaining = maxRowsPerSource - sqliteRowsRead;\n          const pgRowsRemaining = maxRowsPerSource - pgRowsRead;\n          // A read may pass the byte budget by its last row, so this\n          // compares against zero rather than checking for equality.\n          const sqliteBytesRemaining = maxBytesPerSource - sqliteBytesRead;\n          const pgBytesRemaining = maxBytesPerSource - pgBytesRead;\n          if (\n            sqliteRowsRemaining === 0 ||\n            pgRowsRemaining === 0 ||\n            sqliteBytesRemaining <= 0 ||\n            pgBytesRemaining <= 0\n          ) {\n            record(watermark, 'deferred');\n            break;\n          }\n          sampled++;\n          const comparison = await this.#compareTransaction(\n            db,\n            reader,\n            pinned,\n            previousBoundary,\n            watermark,\n            sqliteRowsRemaining,\n            pgRowsRemaining,\n            sqliteBytesRemaining,\n            pgBytesRemaining,\n            maxRowsPerSource,\n            maxBytesPerSource,\n          );\n          sqliteRowsRead += comparison.sqliteRowsRead;\n          pgRowsRead += comparison.pgRowsRead;\n          sqliteBytesRead += comparison.sqliteBytesRead;\n          pgBytesRead += comparison.pgBytesRead;\n          const outcome =\n            fileGeneration === this.#fileGeneration\n              ? comparison.outcome\n              : 'inconclusive';\n          record(watermark, outcome);\n          if (outcome === 'inconclusive') {\n            break;\n          }\n          if (outcome === 'deferred') {\n            break;\n          }\n          if (outcome === 'oversized') {\n            // Advance past a transaction that cannot fit in a fresh budget.\n            stopAfterTransaction = true;\n          }\n          // Yield between sampled reads so other stream work can continue.\n          await this.#yield();\n        }\n        previousBoundary = watermark;\n        handledThrough = watermark;\n        transactions++;\n        if (stopAfterTransaction) {\n          break;\n        }\n      }\n\n      if (\n        !this.#stopped &&\n        fileGeneration === this.#fileGeneration &&\n        outcomes.inconclusive === 0\n      ) {\n        this.#cursor = handledThrough;\n        this.#continueWithoutDelay = handledThrough < through;\n      }\n      return this.#compared(\n        from,\n        handledThrough,\n        transactions,\n        sampled,\n        outcomes,\n      );\n    } catch (e) {\n      this.#lc.warn?.('error comparing the SQLite change log', e);\n      return this.#skipped('error');\n    } finally {\n      reader?.close();\n      db?.close();\n      this.#cycleDuration.recordMs(performance.now() - startedAt);\n    }\n  }\n\n  /** Checks log eligibility and reads the bounds from both stores. */\n  async #pinBounds(db: Database): Promise<PinnedBounds | CompareSkipReason> {\n    let meta: ChangeLogMeta;\n    try {\n      meta = readChangeLogMeta(db);\n    } catch {\n      // The writer has not initialized the log.\n      return 'log-unavailable';\n    }\n    if (meta.schemaVersion !== CHANGE_LOG_DB_SCHEMA_VERSION) {\n      return 'ineligible-schema';\n    }\n    const {epoch, generation, replicaID} = this.#identity;\n    if (\n      meta.epoch !== epoch ||\n      meta.generation !== generation ||\n      meta.replicaID !== replicaID\n    ) {\n      return 'ineligible-identity';\n    }\n    if (this.#now() - meta.seededAtMs < this.#opts.retentionMs) {\n      return 'cold-log';\n    }\n    const sqlite = this.#readSQLiteBounds(db);\n    if (sqlite === undefined) {\n      return 'log-unavailable';\n    }\n    const {minWatermark, lastWatermark} = await this.#pg.getCatchupBounds();\n    if (minWatermark === null) {\n      // Only a new replica has an empty Postgres change log.\n      return 'nothing-to-compare';\n    }\n    return {\n      meta,\n      sqlite,\n      pgMinWatermark: minWatermark,\n      pgLastWatermark: lastWatermark,\n    };\n  }\n\n  #readSQLiteBounds(db: Database): SQLiteBounds | undefined {\n    const bounds = db\n      .prepare(SQLITE_BOUNDS_SQL)\n      .get<{minWatermark: string | null; headWatermark: string | null}>();\n    return bounds.minWatermark === null || bounds.headWatermark === null\n      ? undefined\n      : {\n          minWatermark: bounds.minWatermark,\n          headWatermark: bounds.headWatermark,\n        };\n  }\n\n  /**\n   * Merges committed transaction watermarks from both stores.\n   * If a list reaches the limit, the result ends at the last complete common range.\n   */\n  async #enumerateCommits(\n    db: Database,\n    from: string,\n    through: string,\n    limit: number,\n  ): Promise<{watermark: string; inSqlite: boolean; inPg: boolean}[]> {\n    let sqlite: string[] = db\n      .prepare(SQLITE_COMMITS_SQL)\n      .all<{watermark: string}>({after: from, through, limit: limit + 1})\n      .map(({watermark}) => watermark);\n    let pg = await this.#pg.listCommitWatermarks(from, through, limit + 1);\n\n    let effectiveThrough = through;\n    if (sqlite.length > limit) {\n      sqlite.length = limit;\n      effectiveThrough = minWatermark(effectiveThrough, sqlite[limit - 1]);\n    }\n    if (pg.length > limit) {\n      pg.length = limit;\n      effectiveThrough = minWatermark(effectiveThrough, pg[limit - 1]);\n    }\n    if (effectiveThrough !== through) {\n      sqlite = sqlite.filter(w => w <= effectiveThrough);\n      pg = pg.filter(w => w <= effectiveThrough);\n    }\n\n    const union: {watermark: string; inSqlite: boolean; inPg: boolean}[] = [];\n    let s = 0;\n    let p = 0;\n    while (s < sqlite.length || p < pg.length) {\n      const sw = s < sqlite.length ? sqlite[s] : undefined;\n      const pw = p < pg.length ? pg[p] : undefined;\n      if (sw !== undefined && (pw === undefined || sw < pw)) {\n        union.push({watermark: sw, inSqlite: true, inPg: false});\n        s++;\n      } else if (pw !== undefined && (sw === undefined || pw < sw)) {\n        union.push({watermark: pw, inSqlite: false, inPg: true});\n        p++;\n      } else if (sw !== undefined) {\n        union.push({watermark: sw, inSqlite: true, inPg: true});\n        s++;\n        p++;\n      }\n    }\n    return union;\n  }\n\n  /**\n   * Compares the output in `(previousBoundary, watermark]`.\n   * Positional reads do not require either store to contain the boundary row.\n   */\n  async #compareTransaction(\n    db: Database,\n    reader: SQLiteChangeLogReader,\n    pinned: PinnedBounds,\n    previousBoundary: string,\n    watermark: string,\n    sqliteMaxRows: number,\n    pgMaxRows: number,\n    sqliteMaxBytes: number,\n    pgMaxBytes: number,\n    maxRowsPerSource: number,\n    maxBytesPerSource: number,\n  ): Promise<SampledComparison> {\n    let sqlite: CatchupRangeDigest;\n    let pg: CatchupRangeDigest;\n    try {\n      const readBatchRows = this.#opts.readBatchRows ?? DEFAULT_READ_BATCH_ROWS;\n      sqlite = await digestCatchupRange(\n        reader.read(\n          previousBoundary,\n          watermark,\n          Math.min(readBatchRows, sqliteMaxRows),\n          undefined,\n          sqliteMaxRows,\n        ),\n        watermark,\n        sqliteMaxRows,\n        sqliteMaxBytes,\n      );\n      pg = await digestCatchupRange(\n        reconstructBatches(\n          this.#pg.readCatchupRange(previousBoundary, watermark, pgMaxRows),\n        ),\n        watermark,\n        pgMaxRows,\n        pgMaxBytes,\n      );\n    } catch (e) {\n      // A failed catchup read makes the transaction suspect.\n      this.#lc.warn?.(\n        `error reading transaction ${watermark} for comparison`,\n        e,\n      );\n      return {\n        outcome: await this.#reconfirm(db, pinned, watermark),\n        sqliteRowsRead: 0,\n        pgRowsRead: 0,\n        sqliteBytesRead: 0,\n        pgBytesRead: 0,\n      };\n    }\n    const read = {\n      sqliteRowsRead: sqlite.rows,\n      pgRowsRead: pg.rows,\n      sqliteBytesRead: sqlite.bytes,\n      pgBytesRead: pg.bytes,\n    };\n    if (sqlite.limitReached || pg.limitReached) {\n      // Skip a transaction that cannot fit in a fresh budget.\n      // Defer one that does not fit only in the remaining budget.\n      // A budget is fresh when neither dimension has been spent.\n      const sqliteFresh =\n        sqliteMaxRows === maxRowsPerSource &&\n        sqliteMaxBytes === maxBytesPerSource;\n      const pgFresh =\n        pgMaxRows === maxRowsPerSource && pgMaxBytes === maxBytesPerSource;\n      const outcome =\n        (sqlite.limitReached && sqliteFresh) || (pg.limitReached && pgFresh)\n          ? 'oversized'\n          : 'deferred';\n      return {outcome, ...read};\n    }\n    if (sqlite.digest === pg.digest) {\n      return {outcome: 'match', ...read};\n    }\n    return {\n      outcome: await this.#reconfirm(db, pinned, watermark),\n      ...read,\n    };\n  }\n\n  /**\n   * Rechecks a suspect result against current store bounds.\n   * A moved bound, changed seed, failed read, or lower head makes the result inconclusive.\n   */\n  async #reconfirm(\n    db: Database,\n    pinned: PinnedBounds,\n    watermark: string,\n  ): Promise<'mismatch' | 'inconclusive'> {\n    try {\n      const meta = readChangeLogMeta(db);\n      if (\n        meta.seedWatermark !== pinned.meta.seedWatermark ||\n        meta.seededAtMs !== pinned.meta.seededAtMs\n      ) {\n        return 'inconclusive';\n      }\n      const sqlite = this.#readSQLiteBounds(db);\n      const {minWatermark, lastWatermark} = await this.#pg.getCatchupBounds();\n      if (sqlite === undefined || minWatermark === null) {\n        return 'inconclusive';\n      }\n      if (\n        (sqlite.minWatermark > pinned.sqlite.minWatermark &&\n          watermark <= sqlite.minWatermark) ||\n        (minWatermark > pinned.pgMinWatermark && watermark <= minWatermark) ||\n        watermark > sqlite.headWatermark ||\n        watermark > lastWatermark\n      ) {\n        return 'inconclusive';\n      }\n      return 'mismatch';\n    } catch {\n      return 'inconclusive';\n    }\n  }\n\n  #skipped(reason: CompareSkipReason): CompareCycleResult {\n    this.#compareCycles.add(1, {result: reason});\n    if (reason === 'error') {\n      // The caller logged the error.\n    } else if (reason !== 'nothing-to-compare') {\n      this.#lc.debug?.(`skipping SQLite change-log comparison: ${reason}`);\n    }\n    return {kind: 'skipped', reason};\n  }\n\n  #compared(\n    fromWatermark: string,\n    throughWatermark: string,\n    transactions: number,\n    sampled: number,\n    outcomes: Record<CompareOutcome, number>,\n  ): CompareCycleResult {\n    this.#compareCycles.add(1, {result: 'compared'});\n    const result = {\n      kind: 'compared',\n      fromWatermark,\n      throughWatermark,\n      transactions,\n      sampled,\n      matched: outcomes.match,\n      mismatched: outcomes.mismatch,\n      inconclusive: outcomes.inconclusive,\n      deferred: outcomes.deferred,\n      oversized: outcomes.oversized,\n    } as const;\n    this.#lc.debug?.('SQLite change-log comparison cycle', {\n      sqliteChangeLogCompare: result,\n    });\n    return result;\n  }\n}\n\n/** Applies the same reconstruction as Postgres catchup. */\nasync function* reconstructBatches(\n  batches: AsyncIterable<ChangeLogEntry[]>,\n): AsyncIterable<WatermarkedChange[]> {\n  for await (const batch of batches) {\n    yield batch.map(({watermark, tag, change}) =>\n      reconstructWatermarkedChange(watermark, tag, change),\n    );\n  }\n}\n\nfunction minWatermark(a: string, b: string): string {\n  return a < b ? a : b;\n}\n\nfunction maxWatermark(...watermarks: string[]): string {\n  let max = watermarks[0];\n  for (const w of watermarks) {\n    if (w > max) {\n      max = w;\n    }\n  }\n  return max;\n}\n"],"mappings":";;;;;;;;;AA2BA,IAAM,8BAA8B;;AAGpC,IAAM,qCAAqC;;AAG3C,IAAM,wCAAwC;;;;;;;;AAS9C,IAAM,yCAAyC;;AAG/C,IAAM,0BAA0B;;AA8FhC,IAAM,oBAA4B;;qCAEG,wBAAwB;;qCAExB,wBAAwB;;;;AAK7D,IAAM,qBAA6B;6BACN,wBAAwB;;;;;;;;;;;;;;;AAoCrD,IAAa,4BAAb,MAAuC;CACrC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA,kBAA2B,mBACzB,WACA,oCACA,0MAGF;CACA,iBAA0B,mBACxB,WACA,oCACA,iDACF;CACA,iBAA0B,4BACxB,WACA,4CACA,qDACF;;CAGA;CACA;CACA;CACA,WAAW;CACX,wBAAwB;CACxB,kBAAkB;CAElB,YACE,IACA,OACA,eACA,UACA,IACA,MACA;EACA,KAAK,MAAM,GAAG,YAAY,aAAa,2BAA2B;EAClE,KAAK,SAAS;EACd,KAAK,iBAAiB;EACtB,KAAK,YAAY;EACjB,KAAK,MAAM;EACX,KAAK,QAAQ;EACb,KAAK,OAAO,KAAK,OAAO,KAAK;EAC7B,KAAK,gBAAgB,KAAK,gBAAgB;EAC1C,KAAK,kBAAkB,KAAK,kBAAkB;EAC9C,KAAK,SACH,KAAK,kBACE,IAAI,SAAc,YAAW,aAAa,OAAO,CAAC;EAC3D,KAAK,cAAc;CACrB;;;;;CAMA,cAA2C;EACzC,IAAI,KAAK,UACP,OAAO,QAAQ,QAAQ;GAAC,MAAM;GAAW,QAAQ;EAAS,CAAC;EAE7D,IAAI,KAAK,aAAa,KAAA,GACpB,KAAK,WAAW,KAAK,UAAU,CAAC,CAC7B,MAAK,WAAU;GACd,IAAI,KAAK,uBACP,KAAK,gBAAgB,CAAC;GAExB,OAAO;EACT,CAAC,CAAC,CACD,cAAc;GACb,KAAK,WAAW,KAAA;EAClB,CAAC;EAEL,OAAO,KAAK;CACd;CAEA,OAAa;EACX,KAAK,WAAW;EAChB,IAAI,KAAK,WAAW,KAAA,GAAW;GAC7B,KAAK,gBAAgB,KAAK,MAAM;GAChC,KAAK,SAAS,KAAA;EAChB;CACF;;CAGA,aAAmB;EACjB,KAAK;EACL,KAAK,UAAU,KAAA;EACf,KAAK,wBAAwB;CAC/B;CAEA,cACE,UAAU,KAAK,MAAM,cAAc,6BAC7B;EACN,IAAI,KAAK,YAAY,KAAK,WAAW,KAAA,GACnC;EAEF,KAAK,SAAS,KAAK,oBAAoB;GACrC,KAAK,SAAS,KAAA;GACd,KAAU,YAAY,CAAC,CAAC,cAAc,KAAK,cAAc,CAAC;EAC5D,GAAG,OAAO;CACZ;CAEA,gBAAgB,SAAuB;EACrC,IAAI,KAAK,WAAW,KAAA,GAAW;GAC7B,KAAK,gBAAgB,KAAK,MAAM;GAChC,KAAK,SAAS,KAAA;EAChB;EACA,KAAK,cAAc,OAAO;CAC5B;CAEA,MAAM,YAAyC;EAC7C,MAAM,YAAY,YAAY,IAAI;EAClC,MAAM,iBAAiB,KAAK;EAC5B,KAAK,wBAAwB;EAC7B,IAAI;EACJ,IAAI;EACJ,IAAI;GACF,IAAI;IAEF,KAAK,IAAI,SAAS,KAAK,KAAK,KAAK,gBAAgB,EAAC,UAAU,KAAI,CAAC;GACnE,QAAQ;IACN,OAAO,KAAK,SAAS,iBAAiB;GACxC;GAEA,MAAM,SAAS,MAAM,KAAK,WAAW,EAAE;GACvC,IAAI,mBAAmB,KAAK,iBAC1B,OAAO,KAAK,SAAS,aAAa;GAEpC,IAAI,OAAO,WAAW,UACpB,OAAO,KAAK,SAAS,MAAM;GAE7B,MAAM,EAAC,SAAQ;GAEf,MAAM,OAAO,aACX,KAAK,WAAW,KAAK,eAGrB,KAAK,eAEL,OAAO,gBACP,OAAO,OAAO,YAChB;GACA,MAAM,UAAU,aACd,OAAO,iBACP,OAAO,OAAO,aAChB;GACA,IAAI,WAAW,MACb,OAAO,KAAK,SAAS,oBAAoB;GAG3C,IAAI,eAAe;GACnB,IAAI,UAAU;GACd,MAAM,WAA2C;IAC/C,OAAO;IACP,UAAU;IACV,cAAc;IACd,UAAU;IACV,WAAW;GACb;GACA,MAAM,UAAU,WAAmB,YAA4B;IAC7D,KAAK,gBAAgB,IAAI,GAAG,EAAC,QAAO,CAAC;IACrC,SAAS,QAAQ;IACjB,IAAI,YAAY,YAEd,KAAK,IAAI,QACP,2DACA,EAAC,wBAAwB,EAAC,UAAS,EAAC,CACtC;GAEJ;GAEA,SAAS,IAAI,sBAAsB,KAAK,KAAK,KAAK,cAAc;GAChE,MAAM,OAAO,OAAO,KAAK,IAAI;GAC7B,IAAI,KAAK,SAAS,aAChB,OAAO,KAAK,SAAS,iBAAiB;GAExC,IAAI,KAAK,SAAS,SAChB,OAAO,KAAK,SAAS,oBAAoB;GAE3C,IAAI,KAAK,SAAS,WAAW;IAG3B,MAAM,cAAc,MAAM,KAAK,WAAW,IAAI,QAAQ,IAAI;IAC1D,MAAM,UACJ,mBAAmB,KAAK,kBACpB,cACA;IACN,OAAO,MAAM,OAAO;IACpB,IAAI,YAAY,gBAEd,OAAO,KAAK,UAAU,MAAM,MAAM,cAAc,SAAS,QAAQ;GAIrE;GAEA,MAAM,QAAQ,KAAK,IACjB,GACA,KAAK,MAAM,2BACT,kCACJ;GACA,MAAM,QAAQ,MAAM,KAAK,kBAAkB,IAAI,MAAM,SAAS,KAAK;GACnE,IAAI,mBAAmB,KAAK,iBAC1B,OAAO,KAAK,SAAS,aAAa;GAEpC,MAAM,mBAAmB,KAAK,IAC5B,GACA,KAAK,MAAM,4BACT,qCACJ;GACA,MAAM,oBAAoB,KAAK,IAC7B,GACA,KAAK,MAAM,6BACT,sCACJ;GAEA,IAAI,iBAAiB;GACrB,IAAI,aAAa;GACjB,IAAI,kBAAkB;GACtB,IAAI,cAAc;GAClB,IAAI,mBAAmB;GACvB,IAAI,iBAAiB;GACrB,KAAK,MAAM,EAAC,WAAW,UAAU,UAAS,OAAO;IAC/C,IAAI,KAAK,UACP;IAEF,IAAI,uBAAuB;IAC3B,IAAI,CAAC,YAAY,CAAC,MAAM;KAEtB,MAAM,UAAU,MAAM,KAAK,WAAW,IAAI,QAAQ,SAAS;KAC3D,OACE,WACA,mBAAmB,KAAK,kBAAkB,UAAU,cACtD;IACF,OAAO,IACL,kBAAkB,KAAK,QAAQ,WAAW,KAAK,MAAM,cAAc,GACnE;KACA,MAAM,sBAAsB,mBAAmB;KAC/C,MAAM,kBAAkB,mBAAmB;KAG3C,MAAM,uBAAuB,oBAAoB;KACjD,MAAM,mBAAmB,oBAAoB;KAC7C,IACE,wBAAwB,KACxB,oBAAoB,KACpB,wBAAwB,KACxB,oBAAoB,GACpB;MACA,OAAO,WAAW,UAAU;MAC5B;KACF;KACA;KACA,MAAM,aAAa,MAAM,KAAK,oBAC5B,IACA,QACA,QACA,kBACA,WACA,qBACA,iBACA,sBACA,kBACA,kBACA,iBACF;KACA,kBAAkB,WAAW;KAC7B,cAAc,WAAW;KACzB,mBAAmB,WAAW;KAC9B,eAAe,WAAW;KAC1B,MAAM,UACJ,mBAAmB,KAAK,kBACpB,WAAW,UACX;KACN,OAAO,WAAW,OAAO;KACzB,IAAI,YAAY,gBACd;KAEF,IAAI,YAAY,YACd;KAEF,IAAI,YAAY,aAEd,uBAAuB;KAGzB,MAAM,KAAK,OAAO;IACpB;IACA,mBAAmB;IACnB,iBAAiB;IACjB;IACA,IAAI,sBACF;GAEJ;GAEA,IACE,CAAC,KAAK,YACN,mBAAmB,KAAK,mBACxB,SAAS,iBAAiB,GAC1B;IACA,KAAK,UAAU;IACf,KAAK,wBAAwB,iBAAiB;GAChD;GACA,OAAO,KAAK,UACV,MACA,gBACA,cACA,SACA,QACF;EACF,SAAS,GAAG;GACV,KAAK,IAAI,OAAO,yCAAyC,CAAC;GAC1D,OAAO,KAAK,SAAS,OAAO;EAC9B,UAAU;GACR,QAAQ,MAAM;GACd,IAAI,MAAM;GACV,KAAK,eAAe,SAAS,YAAY,IAAI,IAAI,SAAS;EAC5D;CACF;;CAGA,MAAM,WAAW,IAAyD;EACxE,IAAI;EACJ,IAAI;GACF,OAAO,kBAAkB,EAAE;EAC7B,QAAQ;GAEN,OAAO;EACT;EACA,IAAI,KAAK,kBAAA,GACP,OAAO;EAET,MAAM,EAAC,OAAO,YAAY,cAAa,KAAK;EAC5C,IACE,KAAK,UAAU,SACf,KAAK,eAAe,cACpB,KAAK,cAAc,WAEnB,OAAO;EAET,IAAI,KAAK,KAAK,IAAI,KAAK,aAAa,KAAK,MAAM,aAC7C,OAAO;EAET,MAAM,SAAS,KAAK,kBAAkB,EAAE;EACxC,IAAI,WAAW,KAAA,GACb,OAAO;EAET,MAAM,EAAC,cAAc,kBAAiB,MAAM,KAAK,IAAI,iBAAiB;EACtE,IAAI,iBAAiB,MAEnB,OAAO;EAET,OAAO;GACL;GACA;GACA,gBAAgB;GAChB,iBAAiB;EACnB;CACF;CAEA,kBAAkB,IAAwC;EACxD,MAAM,SAAS,GACZ,QAAQ,iBAAiB,CAAC,CAC1B,IAAiE;EACpE,OAAO,OAAO,iBAAiB,QAAQ,OAAO,kBAAkB,OAC5D,KAAA,IACA;GACE,cAAc,OAAO;GACrB,eAAe,OAAO;EACxB;CACN;;;;;CAMA,MAAM,kBACJ,IACA,MACA,SACA,OACkE;EAClE,IAAI,SAAmB,GACpB,QAAQ,kBAAkB,CAAC,CAC3B,IAAyB;GAAC,OAAO;GAAM;GAAS,OAAO,QAAQ;EAAC,CAAC,CAAC,CAClE,KAAK,EAAC,gBAAe,SAAS;EACjC,IAAI,KAAK,MAAM,KAAK,IAAI,qBAAqB,MAAM,SAAS,QAAQ,CAAC;EAErE,IAAI,mBAAmB;EACvB,IAAI,OAAO,SAAS,OAAO;GACzB,OAAO,SAAS;GAChB,mBAAmB,aAAa,kBAAkB,OAAO,QAAQ,EAAE;EACrE;EACA,IAAI,GAAG,SAAS,OAAO;GACrB,GAAG,SAAS;GACZ,mBAAmB,aAAa,kBAAkB,GAAG,QAAQ,EAAE;EACjE;EACA,IAAI,qBAAqB,SAAS;GAChC,SAAS,OAAO,QAAO,MAAK,KAAK,gBAAgB;GACjD,KAAK,GAAG,QAAO,MAAK,KAAK,gBAAgB;EAC3C;EAEA,MAAM,QAAiE,CAAC;EACxE,IAAI,IAAI;EACR,IAAI,IAAI;EACR,OAAO,IAAI,OAAO,UAAU,IAAI,GAAG,QAAQ;GACzC,MAAM,KAAK,IAAI,OAAO,SAAS,OAAO,KAAK,KAAA;GAC3C,MAAM,KAAK,IAAI,GAAG,SAAS,GAAG,KAAK,KAAA;GACnC,IAAI,OAAO,KAAA,MAAc,OAAO,KAAA,KAAa,KAAK,KAAK;IACrD,MAAM,KAAK;KAAC,WAAW;KAAI,UAAU;KAAM,MAAM;IAAK,CAAC;IACvD;GACF,OAAO,IAAI,OAAO,KAAA,MAAc,OAAO,KAAA,KAAa,KAAK,KAAK;IAC5D,MAAM,KAAK;KAAC,WAAW;KAAI,UAAU;KAAO,MAAM;IAAI,CAAC;IACvD;GACF,OAAO,IAAI,OAAO,KAAA,GAAW;IAC3B,MAAM,KAAK;KAAC,WAAW;KAAI,UAAU;KAAM,MAAM;IAAI,CAAC;IACtD;IACA;GACF;EACF;EACA,OAAO;CACT;;;;;CAMA,MAAM,oBACJ,IACA,QACA,QACA,kBACA,WACA,eACA,WACA,gBACA,YACA,kBACA,mBAC4B;EAC5B,IAAI;EACJ,IAAI;EACJ,IAAI;GACF,MAAM,gBAAgB,KAAK,MAAM,iBAAiB;GAClD,SAAS,MAAM,mBACb,OAAO,KACL,kBACA,WACA,KAAK,IAAI,eAAe,aAAa,GACrC,KAAA,GACA,aACF,GACA,WACA,eACA,cACF;GACA,KAAK,MAAM,mBACT,mBACE,KAAK,IAAI,iBAAiB,kBAAkB,WAAW,SAAS,CAClE,GACA,WACA,WACA,UACF;EACF,SAAS,GAAG;GAEV,KAAK,IAAI,OACP,6BAA6B,UAAU,kBACvC,CACF;GACA,OAAO;IACL,SAAS,MAAM,KAAK,WAAW,IAAI,QAAQ,SAAS;IACpD,gBAAgB;IAChB,YAAY;IACZ,iBAAiB;IACjB,aAAa;GACf;EACF;EACA,MAAM,OAAO;GACX,gBAAgB,OAAO;GACvB,YAAY,GAAG;GACf,iBAAiB,OAAO;GACxB,aAAa,GAAG;EAClB;EACA,IAAI,OAAO,gBAAgB,GAAG,cAAc;GAI1C,MAAM,cACJ,kBAAkB,oBAClB,mBAAmB;GACrB,MAAM,UACJ,cAAc,oBAAoB,eAAe;GAKnD,OAAO;IAAC,SAHL,OAAO,gBAAgB,eAAiB,GAAG,gBAAgB,UACxD,cACA;IACW,GAAG;GAAI;EAC1B;EACA,IAAI,OAAO,WAAW,GAAG,QACvB,OAAO;GAAC,SAAS;GAAS,GAAG;EAAI;EAEnC,OAAO;GACL,SAAS,MAAM,KAAK,WAAW,IAAI,QAAQ,SAAS;GACpD,GAAG;EACL;CACF;;;;;CAMA,MAAM,WACJ,IACA,QACA,WACsC;EACtC,IAAI;GACF,MAAM,OAAO,kBAAkB,EAAE;GACjC,IACE,KAAK,kBAAkB,OAAO,KAAK,iBACnC,KAAK,eAAe,OAAO,KAAK,YAEhC,OAAO;GAET,MAAM,SAAS,KAAK,kBAAkB,EAAE;GACxC,MAAM,EAAC,cAAc,kBAAiB,MAAM,KAAK,IAAI,iBAAiB;GACtE,IAAI,WAAW,KAAA,KAAa,iBAAiB,MAC3C,OAAO;GAET,IACG,OAAO,eAAe,OAAO,OAAO,gBACnC,aAAa,OAAO,gBACrB,eAAe,OAAO,kBAAkB,aAAa,gBACtD,YAAY,OAAO,iBACnB,YAAY,eAEZ,OAAO;GAET,OAAO;EACT,QAAQ;GACN,OAAO;EACT;CACF;CAEA,SAAS,QAA+C;EACtD,KAAK,eAAe,IAAI,GAAG,EAAC,QAAQ,OAAM,CAAC;EAC3C,IAAI,WAAW,SAAS,CAExB,OAAO,IAAI,WAAW,sBACpB,KAAK,IAAI,QAAQ,0CAA0C,QAAQ;EAErE,OAAO;GAAC,MAAM;GAAW;EAAM;CACjC;CAEA,UACE,eACA,kBACA,cACA,SACA,UACoB;EACpB,KAAK,eAAe,IAAI,GAAG,EAAC,QAAQ,WAAU,CAAC;EAC/C,MAAM,SAAS;GACb,MAAM;GACN;GACA;GACA;GACA;GACA,SAAS,SAAS;GAClB,YAAY,SAAS;GACrB,cAAc,SAAS;GACvB,UAAU,SAAS;GACnB,WAAW,SAAS;EACtB;EACA,KAAK,IAAI,QAAQ,sCAAsC,EACrD,wBAAwB,OAC1B,CAAC;EACD,OAAO;CACT;AACF;;AAGA,gBAAgB,mBACd,SACoC;CACpC,WAAW,MAAM,SAAS,SACxB,MAAM,MAAM,KAAK,EAAC,WAAW,KAAK,aAChC,6BAA6B,WAAW,KAAK,MAAM,CACrD;AAEJ;AAEA,SAAS,aAAa,GAAW,GAAmB;CAClD,OAAO,IAAI,IAAI,IAAI;AACrB;AAEA,SAAS,aAAa,GAAG,YAA8B;CACrD,IAAI,MAAM,WAAW;CACrB,KAAK,MAAM,KAAK,YACd,IAAI,IAAI,KACN,MAAM;CAGV,OAAO;AACT"}

package/out/zero-cache/src/services/change-streamer/sqlite-change-log-purge-scheduler.js.map

@@ -1 +1 @@
-{"version":3,"file":"sqlite-change-log-purge-scheduler.js","names":["#lc","#connection","#subscriberAcks","#opts","#now","#setTimeoutFn","#clearTimeoutFn","#yield","#lock","#pausedBy","#writerIdleWaiters","#purgedRows","#passDuration","#passBatches","#declines","#floorProbes","#stopped","#skipped","#runPass","#awaitWriterIdle","#gate","#cacheFor","#probeFloor","#continuation","#cache"],"sources":["../../../../../../zero-cache/src/services/change-streamer/sqlite-change-log-purge-scheduler.ts"],"sourcesContent":["import {Lock} from '@rocicorp/lock';\nimport type {LogContext} from '@rocicorp/logger';\nimport {assert} from '../../../../shared/src/asserts.ts';\nimport type {Database, Statement} from '../../../../zqlite/src/db.ts';\nimport {\n  getOrCreateCounter,\n  getOrCreateLatencyHistogram,\n  getOrCreateValueHistogram,\n} from '../../observability/metrics.ts';\nimport {\n  CHANGE_LOG_STREAM_TABLE,\n  readChangeLogMeta,\n} from '../replicator/change-log-db.ts';\nimport {SQLiteChangeLogPurger} from '../replicator/sqlite-change-log-purger.ts';\nimport type {SQLiteChangeLogCleanupGuard} from './sqlite-change-log-catchup.ts';\nimport {SQLITE_CHANGE_LOG_PLAN_SQL} from './sqlite-change-log-reader.ts';\n\n/**\n * The duration target for any one purge statement, enforced by the purger's\n * measured-budget feedback. Purge runs on the writer's own\n * connection, in the stream loop's process, so a statement's duration stalls\n * the appending path — and the fan-out behind it — directly. The bench's\n * 100 ms bound was derived for the replicator's write worker; this budget is\n * measured against an event loop that also owes progress to fan-out, catchup,\n * and websocket keepalives, so it is deliberately tighter.\n */\nconst DEFAULT_STATEMENT_TARGET_MS = 20;\n\n/**\n * Batches per pass. This bounds one pass's bookkeeping, not the drain: a pass\n * that hits the limit asks its caller for an immediate continuation.\n */\nconst DEFAULT_MAX_BATCHES_PER_PASS = 100;\n\n/**\n * The backstop poll while waiting for the writer's open transaction to\n * commit. The commit notification normally arrives first; this covers an\n * interrupted stream, whose rollback does not notify.\n */\nconst DEFAULT_IN_TRANSACTION_POLL_MS = 1_000;\n\n/** Why a pass stopped before draining the eligible set. */\nexport type PurgeStopReason =\n  // The scheduler was stopped.\n  | 'stopped'\n  // A snapshot reservation is open.\n  | 'paused'\n  // The writer has not opened the change log (the file does not exist yet),\n  // or has failed soft and deleted it.\n  | 'writer-unavailable'\n  // A connected subscriber's ACK is behind the floor. Re-checked before every\n  // batch so a registration that lands mid-drain is honored by the very next\n  // batch.\n  | 'subscriber-behind'\n  // The per-pass batch limit was reached with history still eligible.\n  | 'batch-limit'\n  // The pass failed; the error was logged and counted.\n  | 'error';\n\n/**\n * The invariant-14 probe's classification of `plan(floor)` after a pass.\n *\n * `too-old` at the floor is not by itself a violation: a log that never held\n * that history — routine at every fork, restore, and rolling restart — returns\n * `too-old` without having purged anything. Only the seed point distinguishes\n * the two, which is why `seedWatermark` is in the v2 meta row:\n *\n * ```\n * violation  ⇔  plan(floor) is `too-old`  AND  seedWatermark <= floor\n * ```\n */\nexport type FloorProbeOutcome =\n  // plan(floor) is `range`: the transaction at the floor survives as a\n  // restoring follower's catchup boundary.\n  | 'retained'\n  // The floor is above the log's head, i.e. the log is stale/frozen and the\n  // head cap is what held retention. Nothing at the floor was ever purged.\n  | 'ahead'\n  // plan(floor) is `too-old` but the log was seeded above the floor: it never\n  // held that history. Charted, and feeds the fork/resumption reach\n  // measurement; not an alert.\n  | 'cold-log'\n  // plan(floor) is `too-old` and the log demonstrably once held the floor.\n  // This is an invariant-14 violation: the only copy a restoring follower\n  // could catch up from was purged.\n  | 'violation';\n\n/** When the cleanup coordinator should run another pass. */\nexport type PurgeContinuation =\n  // The pass hit its batch limit while eligible history remained.\n  | 'immediate'\n  // Progress depends on time or external state: retention, a subscriber ACK,\n  // a reservation, the writer becoming available, or a transient error.\n  | 'deferred';\n\nexport type PurgePassResult = {\n  /** The external floor the pass used. */\n  readonly floor: string;\n  readonly batches: number;\n  readonly deletedRows: number;\n  /** Why the pass ended before draining, if it did. */\n  readonly stopped: PurgeStopReason | undefined;\n  /** The invariant-14 probe's outcome, when the log was available to probe. */\n  readonly probe: FloorProbeOutcome | undefined;\n  /** Whether, and how soon, the cleanup coordinator should run another pass. */\n  readonly continuation: PurgeContinuation | undefined;\n};\n\nexport type SQLiteChangeLogPurgeSchedulerOptions = {\n  /**\n   * `sqliteChangeLogRetentionMs`: the minimum retention window, ANDed on top\n   * of the external floor. It can only make purge more conservative — the\n   * purger never accepts it as a standalone bound.\n   */\n  readonly retentionMs: number;\n  /**\n   * `sqliteChangeLogPurgeBatchRows`: the starting chunk size per batch. Not\n   * the bound — the statement duration target is.\n   */\n  readonly batchRows: number;\n  readonly statementTargetMs?: number | undefined;\n  readonly maxBatchesPerPass?: number | undefined;\n  readonly inTransactionPollMs?: number | undefined;\n  /** The clock the retention cutoff is measured against. Defaults to `Date.now`. */\n  readonly now?: (() => number) | undefined;\n  readonly setTimeoutFn?: typeof setTimeout | undefined;\n  readonly clearTimeoutFn?: typeof clearTimeout | undefined;\n  /**\n   * Awaited between batches so fan-out and catchup make progress. Defaults to\n   * a macrotask (`setImmediate`), so pending I/O runs before the next batch.\n   */\n  readonly yieldFn?: (() => Promise<void>) | undefined;\n};\n\ntype ConnectionCache = {\n  readonly db: Database;\n  readonly purger: SQLiteChangeLogPurger;\n  readonly plan: Statement;\n  readonly belowFloorRemains: Statement;\n};\n\ntype PlanRow = {\n  readonly headWatermark: string | null;\n  readonly minWatermark: string | null;\n  readonly boundaryExists: number;\n};\n\n/**\n * Whether the cleanup coordinator still owes this floor a pass. Deliberately\n * not the purger's eligibility query, in two ways:\n *\n * - `remains`: rows younger than the retention cutoff are not eligible *yet*,\n *   but they will be, and their presence asks the cleanup coordinator for a\n *   deferred pass even on a quiet source.\n * - `headBehindFloor`: a head behind the floor means the writer is expected\n *   to replay commits below it (e.g. after reconnecting while the backup\n *   outran this log). Those rows do not exist to count yet, writer commits\n *   only wake an in-flight waiter, and backup monitors never resend an\n *   unchanged floor — so reporting quiescence here would disarm cleanup for\n *   good. An empty log (no head) defers for the same reason.\n */\nconst BELOW_FLOOR_REMAINS_SQL = /*sql*/ `\n  SELECT\n    EXISTS (\n      SELECT 1 FROM \"${CHANGE_LOG_STREAM_TABLE}\"\n      WHERE \"watermark\" < @floor\n        AND \"watermark\" < (SELECT max(\"watermark\") FROM \"${CHANGE_LOG_STREAM_TABLE}\")\n    ) AS \"remains\",\n    coalesce(\n      (SELECT max(\"watermark\") FROM \"${CHANGE_LOG_STREAM_TABLE}\") < @floor,\n      1\n    ) AS \"headBehindFloor\"\n`;\n\n/**\n * Runs bounded SQLite change-log purge passes on the writer's own connection.\n *\n * The caller supplies the current durable cleanup floor independently of any\n * other change-log implementation and owns the timing of subsequent passes.\n * Within a pass this class drains bounded batches, re-checking live subscriber\n * ACKs before each one and releasing the cleanup guard between them, so a\n * catchup registration or snapshot reservation never waits longer than one\n * batch.\n *\n * Purge windows exist only between the writer's commits: purge shares the\n * writer's connection, so it cannot run inside the writer's open transaction,\n * and a batch that finds one waits for the commit notification instead.\n *\n * The result tells the cleanup coordinator whether the next pass should be\n * immediate or deferred. This class deliberately owns no cleanup timer: the\n * same level-triggered coordinator continues a large drain, advances the\n * retention clock on a quiet source, and retries changing external state.\n */\nexport class SQLiteChangeLogPurgeScheduler {\n  readonly #lc: LogContext;\n  readonly #connection: () => Database | undefined;\n  readonly #subscriberAcks: () => Iterable<string>;\n  readonly #opts: SQLiteChangeLogPurgeSchedulerOptions;\n  readonly #now: () => number;\n  readonly #setTimeoutFn: typeof setTimeout;\n  readonly #clearTimeoutFn: typeof clearTimeout;\n  readonly #yield: () => Promise<void>;\n\n  /**\n   * The mutex that serializes purge batches with catchup registration and\n   * reservation pauses. It is only ever held across a synchronous section —\n   * one batch, or one registration — never across a yield, which is what\n   * bounds any waiter to a single batch's duration.\n   */\n  readonly #lock = new Lock();\n\n  /**\n   * Open snapshot reservations, reference-counted by taskID. Purge pauses\n   * while any is open. Counted rather than a set so that a reservation retry\n   * -- whose cancel-then-recreate can resolve its old resume after its new\n   * suspend -- still nets out.\n   */\n  readonly #pausedBy = new Map<string, number>();\n\n  /** Waiters for the writer's next commit (or rollback). */\n  readonly #writerIdleWaiters = new Set<() => void>();\n\n  readonly #purgedRows = getOrCreateCounter(\n    'replica',\n    'sqlite_change_log.purged_rows',\n    'Rows removed from the SQLite change log by the purge scheduler.',\n  );\n  readonly #passDuration = getOrCreateLatencyHistogram(\n    'replica',\n    'sqlite_change_log.purge_cycle_duration',\n    'Duration of one SQLite change-log purge pass, including the yields ' +\n      'between its batches.',\n  );\n  readonly #passBatches = getOrCreateValueHistogram(\n    'replica',\n    'sqlite_change_log.purge_cycle_batches',\n    {\n      description: 'Purge batches run per SQLite change-log purge pass.',\n      unit: '{batch}',\n      bucketBoundaries: [1, 2, 5, 10, 25, 50, 100, 250],\n    },\n  );\n  readonly #declines = getOrCreateCounter(\n    'replica',\n    'sqlite_change_log.purge_declined',\n    'SQLite change-log purge passes that ended before draining, by reason.',\n  );\n  readonly #floorProbes = getOrCreateCounter(\n    'replica',\n    'sqlite_change_log.purge_floor_probe',\n    'Invariant-14 probe outcomes: whether the transaction at the purge ' +\n      'floor is still servable after each pass. \"violation\" means history ' +\n      'at or above the floor was purged and alerts; \"cold-log\" means the ' +\n      'log never held it, which is routine at every fork and resumption.',\n  );\n\n  #cache: ConnectionCache | undefined;\n  #stopped = false;\n\n  /**\n   * The guard that brackets catchup registration: required-head capture and\n   * `Forwarder.add()` run under the same mutex as purge batches, so the\n   * registered ACK is visible to `Forwarder.getAcks()` before the next batch\n   * evaluates its gate.\n   */\n  readonly cleanupGuard: SQLiteChangeLogCleanupGuard = {\n    runWhilePurgeBlocked: register => this.#lock.withLock(register),\n  };\n\n  /**\n   * @param connection the writer's own connection (§3.3). `undefined` until\n   *     the writer's first reconcile creates the file, and again after the\n   *     writer fails soft and deletes it — both of which defer the pass rather\n   *     than fail it, so a later coordinator pass picks up a late-appearing\n   *     file without a restart.\n   * @param subscriberAcks live subscriber ACKs, re-read before every batch so\n   *     the supplied floor remains safe throughout an asynchronous drain.\n   */\n  constructor(\n    lc: LogContext,\n    connection: () => Database | undefined,\n    subscriberAcks: () => Iterable<string>,\n    opts: SQLiteChangeLogPurgeSchedulerOptions,\n  ) {\n    assert(\n      Number.isSafeInteger(opts.retentionMs) && opts.retentionMs > 0,\n      'sqliteChangeLogRetentionMs must be a positive integer',\n    );\n    assert(\n      Number.isSafeInteger(opts.batchRows) && opts.batchRows > 0,\n      'sqliteChangeLogPurgeBatchRows must be a positive integer',\n    );\n    this.#lc = lc.withContext('component', 'sqlite-change-log-purge');\n    this.#connection = connection;\n    this.#subscriberAcks = subscriberAcks;\n    this.#opts = opts;\n    this.#now = opts.now ?? Date.now;\n    this.#setTimeoutFn = opts.setTimeoutFn ?? setTimeout;\n    this.#clearTimeoutFn = opts.clearTimeoutFn ?? clearTimeout;\n    this.#yield =\n      opts.yieldFn ??\n      (() => new Promise<void>(resolve => setImmediate(resolve)));\n  }\n\n  /**\n   * Runs one purge pass for the current durable cleanup `floor`.\n   * Never rejects; a failed pass is logged and reported as `stopped: 'error'`.\n   */\n  async purge(floor: string): Promise<PurgePassResult> {\n    if (this.#stopped) {\n      return this.#skipped(floor, 'stopped');\n    }\n    try {\n      return await this.#runPass(floor);\n    } catch (e) {\n      this.#lc.warn?.('error purging the SQLite change log', e);\n      this.#declines.add(1, {reason: 'error'});\n      return this.#skipped(floor, 'error', 'deferred');\n    }\n  }\n\n  /**\n   * Pauses purging while `taskID` holds a snapshot reservation. The returned\n   * promise resolves once no purge batch is in flight, i.e. once the bounds a\n   * backup monitor is about to advertise cannot be invalidated by a batch\n   * that had already been dispatched.\n   */\n  pause(taskID: string): Promise<void> {\n    this.#pausedBy.set(taskID, (this.#pausedBy.get(taskID) ?? 0) + 1);\n    return this.#lock.withLock(() => {});\n  }\n\n  /**\n   * Ends one of `taskID`'s pauses. A later coordinator pass can purge once\n   * every reservation has ended. Unknown `taskID`s are ignored.\n   */\n  resume(taskID: string): void {\n    const count = this.#pausedBy.get(taskID);\n    if (count === undefined) {\n      return;\n    }\n    if (count > 1) {\n      this.#pausedBy.set(taskID, count - 1);\n      return;\n    }\n    this.#pausedBy.delete(taskID);\n  }\n\n  /**\n   * Notes that the writer's open transaction has ended, waking any batch\n   * waiting for a purge window. A missed notification costs one poll\n   * interval, never correctness.\n   */\n  onWriterIdle(): void {\n    for (const waiter of this.#writerIdleWaiters) {\n      waiter();\n    }\n    this.#writerIdleWaiters.clear();\n  }\n\n  stop(): void {\n    this.#stopped = true;\n    this.onWriterIdle();\n  }\n\n  async #runPass(floor: string): Promise<PurgePassResult> {\n    const startedAt = performance.now();\n    let batches = 0;\n    let deletedRows = 0;\n    let stopped: PurgeStopReason | undefined;\n    let db: Database | undefined;\n\n    try {\n      for (;;) {\n        if (this.#stopped) {\n          stopped = 'stopped';\n          break;\n        }\n        if (this.#pausedBy.size > 0) {\n          stopped = 'paused';\n          break;\n        }\n        const connection = this.#connection();\n        if (connection === undefined) {\n          db = undefined;\n          this.#lc.debug?.(\n            'skipping SQLite change-log purge: the writer has not opened the log',\n          );\n          stopped = 'writer-unavailable';\n          break;\n        }\n        db = connection;\n        if (\n          batches >=\n          Math.max(\n            1,\n            this.#opts.maxBatchesPerPass ?? DEFAULT_MAX_BATCHES_PER_PASS,\n          )\n        ) {\n          stopped = 'batch-limit';\n          break;\n        }\n        if (connection.inTransaction) {\n          // Purge windows exist only between the writer's commits (§3.3).\n          await this.#awaitWriterIdle();\n          continue;\n        }\n\n        const outcome = await this.#lock.withLock(() => {\n          // Everything the wait above established is re-checked under the lock:\n          // the writer may have begun another transaction or failed soft while\n          // this batch's acquisition was queued behind a registration.\n          if (this.#connection() !== connection || connection.inTransaction) {\n            return {kind: 'retry'} as const;\n          }\n          const declined = this.#gate(floor);\n          if (declined !== undefined) {\n            return {kind: 'declined', reason: declined} as const;\n          }\n          const result = this.#cacheFor(connection).purger.purgeBatch({\n            externalFloor: floor,\n            retentionCutoffMs: this.#now() - this.#opts.retentionMs,\n            maxRows: this.#opts.batchRows,\n            maxDurationMs:\n              this.#opts.statementTargetMs ?? DEFAULT_STATEMENT_TARGET_MS,\n          });\n          return {kind: 'purged', result} as const;\n        });\n\n        if (outcome.kind === 'retry') {\n          continue;\n        }\n        if (outcome.kind === 'declined') {\n          stopped = outcome.reason;\n          break;\n        }\n        batches++;\n        deletedRows += outcome.result.deletedRows;\n        if (!outcome.result.moreEligible) {\n          break;\n        }\n        // Release the loop — and the guard, released above — so fan-out,\n        // catchup, and registrations make progress between batches.\n        await this.#yield();\n      }\n    } catch (e) {\n      // Earlier batches committed independently and must remain visible in the\n      // result and metrics. Finalize the partial pass, including its floor\n      // probe, rather than replacing it with an empty skipped result.\n      this.#lc.warn?.('error purging the SQLite change log', e);\n      stopped = 'error';\n    }\n\n    const probe = db === undefined ? undefined : this.#probeFloor(db, floor);\n    let continuation: PurgeContinuation | undefined;\n    try {\n      continuation = this.#continuation(floor, stopped);\n    } catch (e) {\n      // A connection can fail soft between the pass and this level check. Keep\n      // completed batches visible and ask the coordinator to retry later.\n      this.#lc.warn?.(\n        'unable to determine whether SQLite change-log purge should continue',\n        e,\n      );\n      continuation = 'deferred';\n      stopped ??= 'error';\n    }\n    if (deletedRows > 0) {\n      this.#purgedRows.add(deletedRows);\n    }\n    if (batches > 0) {\n      this.#passBatches.record(batches);\n      this.#passDuration.recordMs(performance.now() - startedAt);\n    }\n    if (stopped !== undefined) {\n      this.#declines.add(1, {reason: stopped});\n    }\n    if (batches > 0 || stopped !== 'writer-unavailable') {\n      this.#lc.debug?.('SQLite change-log purge pass', {\n        sqliteChangeLogPurge: {\n          floor,\n          batches,\n          deletedRows,\n          stopped,\n          probe,\n          continuation,\n        },\n      });\n    }\n    return {floor, batches, deletedRows, stopped, probe, continuation};\n  }\n\n  /**\n   * Reports whether the level-triggered cleanup coordinator should run again.\n   * Rows below the floor but inside the retention window require a deferred\n   * pass even when no new backup watermark arrives, and so does a head behind\n   * the floor: the rows the writer replays into that gap arrive after this\n   * check, with no other event armed to reap them.\n   */\n  #continuation(\n    floor: string,\n    stopped: PurgeStopReason | undefined,\n  ): PurgeContinuation | undefined {\n    switch (stopped) {\n      case 'batch-limit':\n        return 'immediate';\n      case 'stopped':\n        return undefined;\n      case 'paused':\n      case 'subscriber-behind':\n      case 'writer-unavailable':\n      case 'error':\n        return 'deferred';\n      case undefined: {\n        // A read is safe even inside the writer's open transaction; it just\n        // observes the uncommitted head, which is never below the floor.\n        const db = this.#connection();\n        if (db === undefined) {\n          return 'deferred';\n        }\n        const {remains, headBehindFloor} = this.#cacheFor(\n          db,\n        ).belowFloorRemains.get<{\n          remains: number;\n          headBehindFloor: number;\n        }>({floor});\n        return remains === 0 && headBehindFloor === 0 ? undefined : 'deferred';\n      }\n    }\n  }\n\n  /**\n   * No purge while a connected subscriber is behind the supplied floor. The\n   * cleanup coordinator has already provided the reconnect grace period; an\n   * empty live set places no additional constraint on the durable floor.\n   */\n  #gate(floor: string): 'subscriber-behind' | undefined {\n    for (const ack of this.#subscriberAcks()) {\n      if (ack < floor) {\n        return 'subscriber-behind';\n      }\n    }\n    return undefined;\n  }\n\n  /**\n   * The live check on invariant 14 — what makes running this slice dark worth\n   * anything: in `write` mode nothing reads the log, so a wrong floor would\n   * otherwise stay invisible until the canary rollout two slices later.\n   */\n  #probeFloor(db: Database, floor: string): FloorProbeOutcome | undefined {\n    try {\n      const cache = this.#cacheFor(db);\n      const row = cache.plan.get<PlanRow>({fromWatermark: floor});\n      const {headWatermark, minWatermark} = row;\n      if (headWatermark === null || minWatermark === null) {\n        return undefined;\n      }\n      let outcome: FloorProbeOutcome;\n      if (floor > headWatermark) {\n        outcome = 'ahead';\n      } else if (floor < minWatermark || row.boundaryExists === 0) {\n        const {seedWatermark} = readChangeLogMeta(db);\n        outcome = seedWatermark <= floor ? 'violation' : 'cold-log';\n      } else {\n        outcome = 'retained';\n      }\n      this.#floorProbes.add(1, {outcome});\n      if (outcome === 'violation') {\n        this.#lc.error?.(\n          'SQLite change log purged history at or above the purge floor. A ' +\n            'follower restoring to that watermark would get `too-old` and ' +\n            'take a full restore.',\n          {sqliteChangeLogFloorProbe: {floor, ...row}},\n        );\n      }\n      return outcome;\n    } catch (e) {\n      this.#lc.warn?.('unable to probe the SQLite change-log purge floor', e);\n      return undefined;\n    }\n  }\n\n  /** Resolves once the writer's open transaction has committed or rolled back. */\n  #awaitWriterIdle(): Promise<void> {\n    return new Promise<void>(resolve => {\n      let timer: ReturnType<typeof setTimeout> | undefined;\n      const waiter = () => {\n        if (timer !== undefined) {\n          this.#clearTimeoutFn(timer);\n        }\n        this.#writerIdleWaiters.delete(waiter);\n        resolve();\n      };\n      this.#writerIdleWaiters.add(waiter);\n      timer = this.#setTimeoutFn(\n        waiter,\n        this.#opts.inTransactionPollMs ?? DEFAULT_IN_TRANSACTION_POLL_MS,\n      );\n    });\n  }\n\n  /**\n   * The per-connection statements, rebuilt if the writer's connection ever\n   * changes. The purger's prepared statements survive a reseed — SQLite\n   * re-prepares on schema change — but not a different `Database`.\n   */\n  #cacheFor(db: Database): ConnectionCache {\n    if (this.#cache?.db !== db) {\n      this.#cache = {\n        db,\n        purger: new SQLiteChangeLogPurger(db),\n        plan: db.prepare(SQLITE_CHANGE_LOG_PLAN_SQL),\n        belowFloorRemains: db.prepare(BELOW_FLOOR_REMAINS_SQL),\n      };\n    }\n    return this.#cache;\n  }\n\n  #skipped(\n    floor: string,\n    reason: PurgeStopReason,\n    continuation?: PurgeContinuation | undefined,\n  ): PurgePassResult {\n    return {\n      floor,\n      batches: 0,\n      deletedRows: 0,\n      stopped: reason,\n      probe: undefined,\n      continuation,\n    };\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;AA0BA,IAAM,8BAA8B;;;;;AAMpC,IAAM,+BAA+B;;;;;;AAOrC,IAAM,iCAAiC;;;;;;;;;;;;;;;AA0HvC,IAAM,0BAAkC;;;uBAGjB,wBAAwB;;2DAEY,wBAAwB;;;uCAG5C,wBAAwB;;;;;;;;;;;;;;;;;;;;;;;AAwB/D,IAAa,gCAAb,MAA2C;CACzC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;;;;;;;CAQA,QAAiB,IAAI,KAAK;;;;;;;CAQ1B,4BAAqB,IAAI,IAAoB;;CAG7C,qCAA8B,IAAI,IAAgB;CAElD,cAAuB,mBACrB,WACA,iCACA,iEACF;CACA,gBAAyB,4BACvB,WACA,0CACA,yFAEF;CACA,eAAwB,0BACtB,WACA,yCACA;EACE,aAAa;EACb,MAAM;EACN,kBAAkB;GAAC;GAAG;GAAG;GAAG;GAAI;GAAI;GAAI;GAAK;EAAG;CAClD,CACF;CACA,YAAqB,mBACnB,WACA,oCACA,uEACF;CACA,eAAwB,mBACtB,WACA,uCACA,8QAIF;CAEA;CACA,WAAW;;;;;;;CAQX,eAAqD,EACnD,uBAAsB,aAAY,KAAKQ,MAAM,SAAS,QAAQ,EAChE;;;;;;;;;;CAWA,YACE,IACA,YACA,gBACA,MACA;EACA,OACE,OAAO,cAAc,KAAK,WAAW,KAAK,KAAK,cAAc,GAC7D,uDACF;EACA,OACE,OAAO,cAAc,KAAK,SAAS,KAAK,KAAK,YAAY,GACzD,0DACF;EACA,KAAKR,MAAM,GAAG,YAAY,aAAa,yBAAyB;EAChE,KAAKC,cAAc;EACnB,KAAKC,kBAAkB;EACvB,KAAKC,QAAQ;EACb,KAAKC,OAAO,KAAK,OAAO,KAAK;EAC7B,KAAKC,gBAAgB,KAAK,gBAAgB;EAC1C,KAAKC,kBAAkB,KAAK,kBAAkB;EAC9C,KAAKC,SACH,KAAK,kBACE,IAAI,SAAc,YAAW,aAAa,OAAO,CAAC;CAC7D;;;;;CAMA,MAAM,MAAM,OAAyC;EACnD,IAAI,KAAKS,UACP,OAAO,KAAKC,SAAS,OAAO,SAAS;EAEvC,IAAI;GACF,OAAO,MAAM,KAAKC,SAAS,KAAK;EAClC,SAAS,GAAG;GACV,KAAKlB,IAAI,OAAO,uCAAuC,CAAC;GACxD,KAAKc,UAAU,IAAI,GAAG,EAAC,QAAQ,QAAO,CAAC;GACvC,OAAO,KAAKG,SAAS,OAAO,SAAS,UAAU;EACjD;CACF;;;;;;;CAQA,MAAM,QAA+B;EACnC,KAAKR,UAAU,IAAI,SAAS,KAAKA,UAAU,IAAI,MAAM,KAAK,KAAK,CAAC;EAChE,OAAO,KAAKD,MAAM,eAAe,CAAC,CAAC;CACrC;;;;;CAMA,OAAO,QAAsB;EAC3B,MAAM,QAAQ,KAAKC,UAAU,IAAI,MAAM;EACvC,IAAI,UAAU,KAAA,GACZ;EAEF,IAAI,QAAQ,GAAG;GACb,KAAKA,UAAU,IAAI,QAAQ,QAAQ,CAAC;GACpC;EACF;EACA,KAAKA,UAAU,OAAO,MAAM;CAC9B;;;;;;CAOA,eAAqB;EACnB,KAAK,MAAM,UAAU,KAAKC,oBACxB,OAAO;EAET,KAAKA,mBAAmB,MAAM;CAChC;CAEA,OAAa;EACX,KAAKM,WAAW;EAChB,KAAK,aAAa;CACpB;CAEA,MAAME,SAAS,OAAyC;EACtD,MAAM,YAAY,YAAY,IAAI;EAClC,IAAI,UAAU;EACd,IAAI,cAAc;EAClB,IAAI;EACJ,IAAI;EAEJ,IAAI;GACF,SAAS;IACP,IAAI,KAAKF,UAAU;KACjB,UAAU;KACV;IACF;IACA,IAAI,KAAKP,UAAU,OAAO,GAAG;KAC3B,UAAU;KACV;IACF;IACA,MAAM,aAAa,KAAKR,YAAY;IACpC,IAAI,eAAe,KAAA,GAAW;KAC5B,KAAK,KAAA;KACL,KAAKD,IAAI,QACP,qEACF;KACA,UAAU;KACV;IACF;IACA,KAAK;IACL,IACE,WACA,KAAK,IACH,GACA,KAAKG,MAAM,qBAAqB,4BAClC,GACA;KACA,UAAU;KACV;IACF;IACA,IAAI,WAAW,eAAe;KAE5B,MAAM,KAAKgB,iBAAiB;KAC5B;IACF;IAEA,MAAM,UAAU,MAAM,KAAKX,MAAM,eAAe;KAI9C,IAAI,KAAKP,YAAY,MAAM,cAAc,WAAW,eAClD,OAAO,EAAC,MAAM,QAAO;KAEvB,MAAM,WAAW,KAAKmB,MAAM,KAAK;KACjC,IAAI,aAAa,KAAA,GACf,OAAO;MAAC,MAAM;MAAY,QAAQ;KAAQ;KAS5C,OAAO;MAAC,MAAM;MAAU,QAPT,KAAKC,UAAU,UAAU,EAAE,OAAO,WAAW;OAC1D,eAAe;OACf,mBAAmB,KAAKjB,KAAK,IAAI,KAAKD,MAAM;OAC5C,SAAS,KAAKA,MAAM;OACpB,eACE,KAAKA,MAAM,qBAAqB;MACpC,CACwB;KAAM;IAChC,CAAC;IAED,IAAI,QAAQ,SAAS,SACnB;IAEF,IAAI,QAAQ,SAAS,YAAY;KAC/B,UAAU,QAAQ;KAClB;IACF;IACA;IACA,eAAe,QAAQ,OAAO;IAC9B,IAAI,CAAC,QAAQ,OAAO,cAClB;IAIF,MAAM,KAAKI,OAAO;GACpB;EACF,SAAS,GAAG;GAIV,KAAKP,IAAI,OAAO,uCAAuC,CAAC;GACxD,UAAU;EACZ;EAEA,MAAM,QAAQ,OAAO,KAAA,IAAY,KAAA,IAAY,KAAKsB,YAAY,IAAI,KAAK;EACvE,IAAI;EACJ,IAAI;GACF,eAAe,KAAKC,cAAc,OAAO,OAAO;EAClD,SAAS,GAAG;GAGV,KAAKvB,IAAI,OACP,uEACA,CACF;GACA,eAAe;GACf,YAAY;EACd;EACA,IAAI,cAAc,GAChB,KAAKW,YAAY,IAAI,WAAW;EAElC,IAAI,UAAU,GAAG;GACf,KAAKE,aAAa,OAAO,OAAO;GAChC,KAAKD,cAAc,SAAS,YAAY,IAAI,IAAI,SAAS;EAC3D;EACA,IAAI,YAAY,KAAA,GACd,KAAKE,UAAU,IAAI,GAAG,EAAC,QAAQ,QAAO,CAAC;EAEzC,IAAI,UAAU,KAAK,YAAY,sBAC7B,KAAKd,IAAI,QAAQ,gCAAgC,EAC/C,sBAAsB;GACpB;GACA;GACA;GACA;GACA;GACA;EACF,EACF,CAAC;EAEH,OAAO;GAAC;GAAO;GAAS;GAAa;GAAS;GAAO;EAAY;CACnE;;;;;;;;CASA,cACE,OACA,SAC+B;EAC/B,QAAQ,SAAR;GACE,KAAK,eACH,OAAO;GACT,KAAK,WACH;GACF,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,SACH,OAAO;GACT,KAAK,KAAA,GAAW;IAGd,MAAM,KAAK,KAAKC,YAAY;IAC5B,IAAI,OAAO,KAAA,GACT,OAAO;IAET,MAAM,EAAC,SAAS,oBAAmB,KAAKoB,UACtC,EACF,EAAE,kBAAkB,IAGjB,EAAC,MAAK,CAAC;IACV,OAAO,YAAY,KAAK,oBAAoB,IAAI,KAAA,IAAY;GAC9D;EACF;CACF;;;;;;CAOA,MAAM,OAAgD;EACpD,KAAK,MAAM,OAAO,KAAKnB,gBAAgB,GACrC,IAAI,MAAM,OACR,OAAO;CAIb;;;;;;CAOA,YAAY,IAAc,OAA8C;EACtE,IAAI;GAEF,MAAM,MADQ,KAAKmB,UAAU,EACjB,EAAM,KAAK,IAAa,EAAC,eAAe,MAAK,CAAC;GAC1D,MAAM,EAAC,eAAe,iBAAgB;GACtC,IAAI,kBAAkB,QAAQ,iBAAiB,MAC7C;GAEF,IAAI;GACJ,IAAI,QAAQ,eACV,UAAU;QACL,IAAI,QAAQ,gBAAgB,IAAI,mBAAmB,GAAG;IAC3D,MAAM,EAAC,kBAAiB,kBAAkB,EAAE;IAC5C,UAAU,iBAAiB,QAAQ,cAAc;GACnD,OACE,UAAU;GAEZ,KAAKN,aAAa,IAAI,GAAG,EAAC,QAAO,CAAC;GAClC,IAAI,YAAY,aACd,KAAKf,IAAI,QACP,qJAGA,EAAC,2BAA2B;IAAC;IAAO,GAAG;GAAG,EAAC,CAC7C;GAEF,OAAO;EACT,SAAS,GAAG;GACV,KAAKA,IAAI,OAAO,qDAAqD,CAAC;GACtE;EACF;CACF;;CAGA,mBAAkC;EAChC,OAAO,IAAI,SAAc,YAAW;GAClC,IAAI;GACJ,MAAM,eAAe;IACnB,IAAI,UAAU,KAAA,GACZ,KAAKM,gBAAgB,KAAK;IAE5B,KAAKI,mBAAmB,OAAO,MAAM;IACrC,QAAQ;GACV;GACA,KAAKA,mBAAmB,IAAI,MAAM;GAClC,QAAQ,KAAKL,cACX,QACA,KAAKF,MAAM,uBAAuB,8BACpC;EACF,CAAC;CACH;;;;;;CAOA,UAAU,IAA+B;EACvC,IAAI,KAAKqB,QAAQ,OAAO,IACtB,KAAKA,SAAS;GACZ;GACA,QAAQ,IAAI,sBAAsB,EAAE;GACpC,MAAM,GAAG,QAAQ,0BAA0B;GAC3C,mBAAmB,GAAG,QAAQ,uBAAuB;EACvD;EAEF,OAAO,KAAKA;CACd;CAEA,SACE,OACA,QACA,cACiB;EACjB,OAAO;GACL;GACA,SAAS;GACT,aAAa;GACb,SAAS;GACT,OAAO,KAAA;GACP;EACF;CACF;AACF"}
+{"version":3,"file":"sqlite-change-log-purge-scheduler.js","names":[],"sources":["../../../../../../zero-cache/src/services/change-streamer/sqlite-change-log-purge-scheduler.ts"],"sourcesContent":["import {Lock} from '@rocicorp/lock';\nimport type {LogContext} from '@rocicorp/logger';\nimport {assert} from '../../../../shared/src/asserts.ts';\nimport type {Database, Statement} from '../../../../zqlite/src/db.ts';\nimport {\n  getOrCreateCounter,\n  getOrCreateLatencyHistogram,\n  getOrCreateValueHistogram,\n} from '../../observability/metrics.ts';\nimport {\n  CHANGE_LOG_STREAM_TABLE,\n  readChangeLogMeta,\n} from '../replicator/change-log-db.ts';\nimport {SQLiteChangeLogPurger} from '../replicator/sqlite-change-log-purger.ts';\nimport type {SQLiteChangeLogCleanupGuard} from './sqlite-change-log-catchup.ts';\nimport {SQLITE_CHANGE_LOG_PLAN_SQL} from './sqlite-change-log-reader.ts';\n\n/**\n * The duration target for any one purge statement, enforced by the purger's\n * measured-budget feedback. Purge runs on the writer's own\n * connection, in the stream loop's process, so a statement's duration stalls\n * the appending path — and the fan-out behind it — directly. The bench's\n * 100 ms bound was derived for the replicator's write worker; this budget is\n * measured against an event loop that also owes progress to fan-out, catchup,\n * and websocket keepalives, so it is deliberately tighter.\n */\nconst DEFAULT_STATEMENT_TARGET_MS = 20;\n\n/**\n * Batches per pass. This bounds one pass's bookkeeping, not the drain: a pass\n * that hits the limit asks its caller for an immediate continuation.\n */\nconst DEFAULT_MAX_BATCHES_PER_PASS = 100;\n\n/**\n * The backstop poll while waiting for the writer's open transaction to\n * commit. The commit notification normally arrives first; this covers an\n * interrupted stream, whose rollback does not notify.\n */\nconst DEFAULT_IN_TRANSACTION_POLL_MS = 1_000;\n\n/** Why a pass stopped before draining the eligible set. */\nexport type PurgeStopReason =\n  // The scheduler was stopped.\n  | 'stopped'\n  // A snapshot reservation is open.\n  | 'paused'\n  // The writer has not opened the change log (the file does not exist yet),\n  // or has failed soft and deleted it.\n  | 'writer-unavailable'\n  // A connected subscriber's ACK is behind the floor. Re-checked before every\n  // batch so a registration that lands mid-drain is honored by the very next\n  // batch.\n  | 'subscriber-behind'\n  // The per-pass batch limit was reached with history still eligible.\n  | 'batch-limit'\n  // The pass failed; the error was logged and counted.\n  | 'error';\n\n/**\n * The invariant-14 probe's classification of `plan(floor)` after a pass.\n *\n * `too-old` at the floor is not by itself a violation: a log that never held\n * that history — routine at every fork, restore, and rolling restart — returns\n * `too-old` without having purged anything. Only the seed point distinguishes\n * the two, which is why `seedWatermark` is in the v2 meta row:\n *\n * ```\n * violation  ⇔  plan(floor) is `too-old`  AND  seedWatermark <= floor\n * ```\n */\nexport type FloorProbeOutcome =\n  // plan(floor) is `range`: the transaction at the floor survives as a\n  // restoring follower's catchup boundary.\n  | 'retained'\n  // The floor is above the log's head, i.e. the log is stale/frozen and the\n  // head cap is what held retention. Nothing at the floor was ever purged.\n  | 'ahead'\n  // plan(floor) is `too-old` but the log was seeded above the floor: it never\n  // held that history. Charted, and feeds the fork/resumption reach\n  // measurement; not an alert.\n  | 'cold-log'\n  // plan(floor) is `too-old` and the log demonstrably once held the floor.\n  // This is an invariant-14 violation: the only copy a restoring follower\n  // could catch up from was purged.\n  | 'violation';\n\n/** When the cleanup coordinator should run another pass. */\nexport type PurgeContinuation =\n  // The pass hit its batch limit while eligible history remained.\n  | 'immediate'\n  // Progress depends on time or external state: retention, a subscriber ACK,\n  // a reservation, the writer becoming available, or a transient error.\n  | 'deferred';\n\nexport type PurgePassResult = {\n  /** The external floor the pass used. */\n  readonly floor: string;\n  readonly batches: number;\n  readonly deletedRows: number;\n  /** Why the pass ended before draining, if it did. */\n  readonly stopped: PurgeStopReason | undefined;\n  /** The invariant-14 probe's outcome, when the log was available to probe. */\n  readonly probe: FloorProbeOutcome | undefined;\n  /** Whether, and how soon, the cleanup coordinator should run another pass. */\n  readonly continuation: PurgeContinuation | undefined;\n};\n\nexport type SQLiteChangeLogPurgeSchedulerOptions = {\n  /**\n   * `sqliteChangeLogRetentionMs`: the minimum retention window, ANDed on top\n   * of the external floor. It can only make purge more conservative — the\n   * purger never accepts it as a standalone bound.\n   */\n  readonly retentionMs: number;\n  /**\n   * `sqliteChangeLogPurgeBatchRows`: the starting chunk size per batch. Not\n   * the bound — the statement duration target is.\n   */\n  readonly batchRows: number;\n  readonly statementTargetMs?: number | undefined;\n  readonly maxBatchesPerPass?: number | undefined;\n  readonly inTransactionPollMs?: number | undefined;\n  /** The clock the retention cutoff is measured against. Defaults to `Date.now`. */\n  readonly now?: (() => number) | undefined;\n  readonly setTimeoutFn?: typeof setTimeout | undefined;\n  readonly clearTimeoutFn?: typeof clearTimeout | undefined;\n  /**\n   * Awaited between batches so fan-out and catchup make progress. Defaults to\n   * a macrotask (`setImmediate`), so pending I/O runs before the next batch.\n   */\n  readonly yieldFn?: (() => Promise<void>) | undefined;\n};\n\ntype ConnectionCache = {\n  readonly db: Database;\n  readonly purger: SQLiteChangeLogPurger;\n  readonly plan: Statement;\n  readonly belowFloorRemains: Statement;\n};\n\ntype PlanRow = {\n  readonly headWatermark: string | null;\n  readonly minWatermark: string | null;\n  readonly boundaryExists: number;\n};\n\n/**\n * Whether the cleanup coordinator still owes this floor a pass. Deliberately\n * not the purger's eligibility query, in two ways:\n *\n * - `remains`: rows younger than the retention cutoff are not eligible *yet*,\n *   but they will be, and their presence asks the cleanup coordinator for a\n *   deferred pass even on a quiet source.\n * - `headBehindFloor`: a head behind the floor means the writer is expected\n *   to replay commits below it (e.g. after reconnecting while the backup\n *   outran this log). Those rows do not exist to count yet, writer commits\n *   only wake an in-flight waiter, and backup monitors never resend an\n *   unchanged floor — so reporting quiescence here would disarm cleanup for\n *   good. An empty log (no head) defers for the same reason.\n */\nconst BELOW_FLOOR_REMAINS_SQL = /*sql*/ `\n  SELECT\n    EXISTS (\n      SELECT 1 FROM \"${CHANGE_LOG_STREAM_TABLE}\"\n      WHERE \"watermark\" < @floor\n        AND \"watermark\" < (SELECT max(\"watermark\") FROM \"${CHANGE_LOG_STREAM_TABLE}\")\n    ) AS \"remains\",\n    coalesce(\n      (SELECT max(\"watermark\") FROM \"${CHANGE_LOG_STREAM_TABLE}\") < @floor,\n      1\n    ) AS \"headBehindFloor\"\n`;\n\n/**\n * Runs bounded SQLite change-log purge passes on the writer's own connection.\n *\n * The caller supplies the current durable cleanup floor independently of any\n * other change-log implementation and owns the timing of subsequent passes.\n * Within a pass this class drains bounded batches, re-checking live subscriber\n * ACKs before each one and releasing the cleanup guard between them, so a\n * catchup registration or snapshot reservation never waits longer than one\n * batch.\n *\n * Purge windows exist only between the writer's commits: purge shares the\n * writer's connection, so it cannot run inside the writer's open transaction,\n * and a batch that finds one waits for the commit notification instead.\n *\n * The result tells the cleanup coordinator whether the next pass should be\n * immediate or deferred. This class deliberately owns no cleanup timer: the\n * same level-triggered coordinator continues a large drain, advances the\n * retention clock on a quiet source, and retries changing external state.\n */\nexport class SQLiteChangeLogPurgeScheduler {\n  readonly #lc: LogContext;\n  readonly #connection: () => Database | undefined;\n  readonly #subscriberAcks: () => Iterable<string>;\n  readonly #opts: SQLiteChangeLogPurgeSchedulerOptions;\n  readonly #now: () => number;\n  readonly #setTimeoutFn: typeof setTimeout;\n  readonly #clearTimeoutFn: typeof clearTimeout;\n  readonly #yield: () => Promise<void>;\n\n  /**\n   * The mutex that serializes purge batches with catchup registration and\n   * reservation pauses. It is only ever held across a synchronous section —\n   * one batch, or one registration — never across a yield, which is what\n   * bounds any waiter to a single batch's duration.\n   */\n  readonly #lock = new Lock();\n\n  /**\n   * Open snapshot reservations, reference-counted by taskID. Purge pauses\n   * while any is open. Counted rather than a set so that a reservation retry\n   * -- whose cancel-then-recreate can resolve its old resume after its new\n   * suspend -- still nets out.\n   */\n  readonly #pausedBy = new Map<string, number>();\n\n  /** Waiters for the writer's next commit (or rollback). */\n  readonly #writerIdleWaiters = new Set<() => void>();\n\n  readonly #purgedRows = getOrCreateCounter(\n    'replica',\n    'sqlite_change_log.purged_rows',\n    'Rows removed from the SQLite change log by the purge scheduler.',\n  );\n  readonly #passDuration = getOrCreateLatencyHistogram(\n    'replica',\n    'sqlite_change_log.purge_cycle_duration',\n    'Duration of one SQLite change-log purge pass, including the yields ' +\n      'between its batches.',\n  );\n  readonly #passBatches = getOrCreateValueHistogram(\n    'replica',\n    'sqlite_change_log.purge_cycle_batches',\n    {\n      description: 'Purge batches run per SQLite change-log purge pass.',\n      unit: '{batch}',\n      bucketBoundaries: [1, 2, 5, 10, 25, 50, 100, 250],\n    },\n  );\n  readonly #declines = getOrCreateCounter(\n    'replica',\n    'sqlite_change_log.purge_declined',\n    'SQLite change-log purge passes that ended before draining, by reason.',\n  );\n  readonly #floorProbes = getOrCreateCounter(\n    'replica',\n    'sqlite_change_log.purge_floor_probe',\n    'Invariant-14 probe outcomes: whether the transaction at the purge ' +\n      'floor is still servable after each pass. \"violation\" means history ' +\n      'at or above the floor was purged and alerts; \"cold-log\" means the ' +\n      'log never held it, which is routine at every fork and resumption.',\n  );\n\n  #cache: ConnectionCache | undefined;\n  #stopped = false;\n\n  /**\n   * The guard that brackets catchup registration: required-head capture and\n   * `Forwarder.add()` run under the same mutex as purge batches, so the\n   * registered ACK is visible to `Forwarder.getAcks()` before the next batch\n   * evaluates its gate.\n   */\n  readonly cleanupGuard: SQLiteChangeLogCleanupGuard = {\n    runWhilePurgeBlocked: register => this.#lock.withLock(register),\n  };\n\n  /**\n   * @param connection the writer's own connection (§3.3). `undefined` until\n   *     the writer's first reconcile creates the file, and again after the\n   *     writer fails soft and deletes it — both of which defer the pass rather\n   *     than fail it, so a later coordinator pass picks up a late-appearing\n   *     file without a restart.\n   * @param subscriberAcks live subscriber ACKs, re-read before every batch so\n   *     the supplied floor remains safe throughout an asynchronous drain.\n   */\n  constructor(\n    lc: LogContext,\n    connection: () => Database | undefined,\n    subscriberAcks: () => Iterable<string>,\n    opts: SQLiteChangeLogPurgeSchedulerOptions,\n  ) {\n    assert(\n      Number.isSafeInteger(opts.retentionMs) && opts.retentionMs > 0,\n      'sqliteChangeLogRetentionMs must be a positive integer',\n    );\n    assert(\n      Number.isSafeInteger(opts.batchRows) && opts.batchRows > 0,\n      'sqliteChangeLogPurgeBatchRows must be a positive integer',\n    );\n    this.#lc = lc.withContext('component', 'sqlite-change-log-purge');\n    this.#connection = connection;\n    this.#subscriberAcks = subscriberAcks;\n    this.#opts = opts;\n    this.#now = opts.now ?? Date.now;\n    this.#setTimeoutFn = opts.setTimeoutFn ?? setTimeout;\n    this.#clearTimeoutFn = opts.clearTimeoutFn ?? clearTimeout;\n    this.#yield =\n      opts.yieldFn ??\n      (() => new Promise<void>(resolve => setImmediate(resolve)));\n  }\n\n  /**\n   * Runs one purge pass for the current durable cleanup `floor`.\n   * Never rejects; a failed pass is logged and reported as `stopped: 'error'`.\n   */\n  async purge(floor: string): Promise<PurgePassResult> {\n    if (this.#stopped) {\n      return this.#skipped(floor, 'stopped');\n    }\n    try {\n      return await this.#runPass(floor);\n    } catch (e) {\n      this.#lc.warn?.('error purging the SQLite change log', e);\n      this.#declines.add(1, {reason: 'error'});\n      return this.#skipped(floor, 'error', 'deferred');\n    }\n  }\n\n  /**\n   * Pauses purging while `taskID` holds a snapshot reservation. The returned\n   * promise resolves once no purge batch is in flight, i.e. once the bounds a\n   * backup monitor is about to advertise cannot be invalidated by a batch\n   * that had already been dispatched.\n   */\n  pause(taskID: string): Promise<void> {\n    this.#pausedBy.set(taskID, (this.#pausedBy.get(taskID) ?? 0) + 1);\n    return this.#lock.withLock(() => {});\n  }\n\n  /**\n   * Ends one of `taskID`'s pauses. A later coordinator pass can purge once\n   * every reservation has ended. Unknown `taskID`s are ignored.\n   */\n  resume(taskID: string): void {\n    const count = this.#pausedBy.get(taskID);\n    if (count === undefined) {\n      return;\n    }\n    if (count > 1) {\n      this.#pausedBy.set(taskID, count - 1);\n      return;\n    }\n    this.#pausedBy.delete(taskID);\n  }\n\n  /**\n   * Notes that the writer's open transaction has ended, waking any batch\n   * waiting for a purge window. A missed notification costs one poll\n   * interval, never correctness.\n   */\n  onWriterIdle(): void {\n    for (const waiter of this.#writerIdleWaiters) {\n      waiter();\n    }\n    this.#writerIdleWaiters.clear();\n  }\n\n  stop(): void {\n    this.#stopped = true;\n    this.onWriterIdle();\n  }\n\n  async #runPass(floor: string): Promise<PurgePassResult> {\n    const startedAt = performance.now();\n    let batches = 0;\n    let deletedRows = 0;\n    let stopped: PurgeStopReason | undefined;\n    let db: Database | undefined;\n\n    try {\n      for (;;) {\n        if (this.#stopped) {\n          stopped = 'stopped';\n          break;\n        }\n        if (this.#pausedBy.size > 0) {\n          stopped = 'paused';\n          break;\n        }\n        const connection = this.#connection();\n        if (connection === undefined) {\n          db = undefined;\n          this.#lc.debug?.(\n            'skipping SQLite change-log purge: the writer has not opened the log',\n          );\n          stopped = 'writer-unavailable';\n          break;\n        }\n        db = connection;\n        if (\n          batches >=\n          Math.max(\n            1,\n            this.#opts.maxBatchesPerPass ?? DEFAULT_MAX_BATCHES_PER_PASS,\n          )\n        ) {\n          stopped = 'batch-limit';\n          break;\n        }\n        if (connection.inTransaction) {\n          // Purge windows exist only between the writer's commits (§3.3).\n          await this.#awaitWriterIdle();\n          continue;\n        }\n\n        const outcome = await this.#lock.withLock(() => {\n          // Everything the wait above established is re-checked under the lock:\n          // the writer may have begun another transaction or failed soft while\n          // this batch's acquisition was queued behind a registration.\n          if (this.#connection() !== connection || connection.inTransaction) {\n            return {kind: 'retry'} as const;\n          }\n          const declined = this.#gate(floor);\n          if (declined !== undefined) {\n            return {kind: 'declined', reason: declined} as const;\n          }\n          const result = this.#cacheFor(connection).purger.purgeBatch({\n            externalFloor: floor,\n            retentionCutoffMs: this.#now() - this.#opts.retentionMs,\n            maxRows: this.#opts.batchRows,\n            maxDurationMs:\n              this.#opts.statementTargetMs ?? DEFAULT_STATEMENT_TARGET_MS,\n          });\n          return {kind: 'purged', result} as const;\n        });\n\n        if (outcome.kind === 'retry') {\n          continue;\n        }\n        if (outcome.kind === 'declined') {\n          stopped = outcome.reason;\n          break;\n        }\n        batches++;\n        deletedRows += outcome.result.deletedRows;\n        if (!outcome.result.moreEligible) {\n          break;\n        }\n        // Release the loop — and the guard, released above — so fan-out,\n        // catchup, and registrations make progress between batches.\n        await this.#yield();\n      }\n    } catch (e) {\n      // Earlier batches committed independently and must remain visible in the\n      // result and metrics. Finalize the partial pass, including its floor\n      // probe, rather than replacing it with an empty skipped result.\n      this.#lc.warn?.('error purging the SQLite change log', e);\n      stopped = 'error';\n    }\n\n    const probe = db === undefined ? undefined : this.#probeFloor(db, floor);\n    let continuation: PurgeContinuation | undefined;\n    try {\n      continuation = this.#continuation(floor, stopped);\n    } catch (e) {\n      // A connection can fail soft between the pass and this level check. Keep\n      // completed batches visible and ask the coordinator to retry later.\n      this.#lc.warn?.(\n        'unable to determine whether SQLite change-log purge should continue',\n        e,\n      );\n      continuation = 'deferred';\n      stopped ??= 'error';\n    }\n    if (deletedRows > 0) {\n      this.#purgedRows.add(deletedRows);\n    }\n    if (batches > 0) {\n      this.#passBatches.record(batches);\n      this.#passDuration.recordMs(performance.now() - startedAt);\n    }\n    if (stopped !== undefined) {\n      this.#declines.add(1, {reason: stopped});\n    }\n    if (batches > 0 || stopped !== 'writer-unavailable') {\n      this.#lc.debug?.('SQLite change-log purge pass', {\n        sqliteChangeLogPurge: {\n          floor,\n          batches,\n          deletedRows,\n          stopped,\n          probe,\n          continuation,\n        },\n      });\n    }\n    return {floor, batches, deletedRows, stopped, probe, continuation};\n  }\n\n  /**\n   * Reports whether the level-triggered cleanup coordinator should run again.\n   * Rows below the floor but inside the retention window require a deferred\n   * pass even when no new backup watermark arrives, and so does a head behind\n   * the floor: the rows the writer replays into that gap arrive after this\n   * check, with no other event armed to reap them.\n   */\n  #continuation(\n    floor: string,\n    stopped: PurgeStopReason | undefined,\n  ): PurgeContinuation | undefined {\n    switch (stopped) {\n      case 'batch-limit':\n        return 'immediate';\n      case 'stopped':\n        return undefined;\n      case 'paused':\n      case 'subscriber-behind':\n      case 'writer-unavailable':\n      case 'error':\n        return 'deferred';\n      case undefined: {\n        // A read is safe even inside the writer's open transaction; it just\n        // observes the uncommitted head, which is never below the floor.\n        const db = this.#connection();\n        if (db === undefined) {\n          return 'deferred';\n        }\n        const {remains, headBehindFloor} = this.#cacheFor(\n          db,\n        ).belowFloorRemains.get<{\n          remains: number;\n          headBehindFloor: number;\n        }>({floor});\n        return remains === 0 && headBehindFloor === 0 ? undefined : 'deferred';\n      }\n    }\n  }\n\n  /**\n   * No purge while a connected subscriber is behind the supplied floor. The\n   * cleanup coordinator has already provided the reconnect grace period; an\n   * empty live set places no additional constraint on the durable floor.\n   */\n  #gate(floor: string): 'subscriber-behind' | undefined {\n    for (const ack of this.#subscriberAcks()) {\n      if (ack < floor) {\n        return 'subscriber-behind';\n      }\n    }\n    return undefined;\n  }\n\n  /**\n   * The live check on invariant 14 — what makes running this slice dark worth\n   * anything: in `write` mode nothing reads the log, so a wrong floor would\n   * otherwise stay invisible until the canary rollout two slices later.\n   */\n  #probeFloor(db: Database, floor: string): FloorProbeOutcome | undefined {\n    try {\n      const cache = this.#cacheFor(db);\n      const row = cache.plan.get<PlanRow>({fromWatermark: floor});\n      const {headWatermark, minWatermark} = row;\n      if (headWatermark === null || minWatermark === null) {\n        return undefined;\n      }\n      let outcome: FloorProbeOutcome;\n      if (floor > headWatermark) {\n        outcome = 'ahead';\n      } else if (floor < minWatermark || row.boundaryExists === 0) {\n        const {seedWatermark} = readChangeLogMeta(db);\n        outcome = seedWatermark <= floor ? 'violation' : 'cold-log';\n      } else {\n        outcome = 'retained';\n      }\n      this.#floorProbes.add(1, {outcome});\n      if (outcome === 'violation') {\n        this.#lc.error?.(\n          'SQLite change log purged history at or above the purge floor. A ' +\n            'follower restoring to that watermark would get `too-old` and ' +\n            'take a full restore.',\n          {sqliteChangeLogFloorProbe: {floor, ...row}},\n        );\n      }\n      return outcome;\n    } catch (e) {\n      this.#lc.warn?.('unable to probe the SQLite change-log purge floor', e);\n      return undefined;\n    }\n  }\n\n  /** Resolves once the writer's open transaction has committed or rolled back. */\n  #awaitWriterIdle(): Promise<void> {\n    return new Promise<void>(resolve => {\n      let timer: ReturnType<typeof setTimeout> | undefined;\n      const waiter = () => {\n        if (timer !== undefined) {\n          this.#clearTimeoutFn(timer);\n        }\n        this.#writerIdleWaiters.delete(waiter);\n        resolve();\n      };\n      this.#writerIdleWaiters.add(waiter);\n      timer = this.#setTimeoutFn(\n        waiter,\n        this.#opts.inTransactionPollMs ?? DEFAULT_IN_TRANSACTION_POLL_MS,\n      );\n    });\n  }\n\n  /**\n   * The per-connection statements, rebuilt if the writer's connection ever\n   * changes. The purger's prepared statements survive a reseed — SQLite\n   * re-prepares on schema change — but not a different `Database`.\n   */\n  #cacheFor(db: Database): ConnectionCache {\n    if (this.#cache?.db !== db) {\n      this.#cache = {\n        db,\n        purger: new SQLiteChangeLogPurger(db),\n        plan: db.prepare(SQLITE_CHANGE_LOG_PLAN_SQL),\n        belowFloorRemains: db.prepare(BELOW_FLOOR_REMAINS_SQL),\n      };\n    }\n    return this.#cache;\n  }\n\n  #skipped(\n    floor: string,\n    reason: PurgeStopReason,\n    continuation?: PurgeContinuation | undefined,\n  ): PurgePassResult {\n    return {\n      floor,\n      batches: 0,\n      deletedRows: 0,\n      stopped: reason,\n      probe: undefined,\n      continuation,\n    };\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;AA0BA,IAAM,8BAA8B;;;;;AAMpC,IAAM,+BAA+B;;;;;;AAOrC,IAAM,iCAAiC;;;;;;;;;;;;;;;AA0HvC,IAAM,0BAAkC;;;uBAGjB,wBAAwB;;2DAEY,wBAAwB;;;uCAG5C,wBAAwB;;;;;;;;;;;;;;;;;;;;;;;AAwB/D,IAAa,gCAAb,MAA2C;CACzC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;;;;;;;CAQA,QAAiB,IAAI,KAAK;;;;;;;CAQ1B,4BAAqB,IAAI,IAAoB;;CAG7C,qCAA8B,IAAI,IAAgB;CAElD,cAAuB,mBACrB,WACA,iCACA,iEACF;CACA,gBAAyB,4BACvB,WACA,0CACA,yFAEF;CACA,eAAwB,0BACtB,WACA,yCACA;EACE,aAAa;EACb,MAAM;EACN,kBAAkB;GAAC;GAAG;GAAG;GAAG;GAAI;GAAI;GAAI;GAAK;EAAG;CAClD,CACF;CACA,YAAqB,mBACnB,WACA,oCACA,uEACF;CACA,eAAwB,mBACtB,WACA,uCACA,8QAIF;CAEA;CACA,WAAW;;;;;;;CAQX,eAAqD,EACnD,uBAAsB,aAAY,KAAK,MAAM,SAAS,QAAQ,EAChE;;;;;;;;;;CAWA,YACE,IACA,YACA,gBACA,MACA;EACA,OACE,OAAO,cAAc,KAAK,WAAW,KAAK,KAAK,cAAc,GAC7D,uDACF;EACA,OACE,OAAO,cAAc,KAAK,SAAS,KAAK,KAAK,YAAY,GACzD,0DACF;EACA,KAAK,MAAM,GAAG,YAAY,aAAa,yBAAyB;EAChE,KAAK,cAAc;EACnB,KAAK,kBAAkB;EACvB,KAAK,QAAQ;EACb,KAAK,OAAO,KAAK,OAAO,KAAK;EAC7B,KAAK,gBAAgB,KAAK,gBAAgB;EAC1C,KAAK,kBAAkB,KAAK,kBAAkB;EAC9C,KAAK,SACH,KAAK,kBACE,IAAI,SAAc,YAAW,aAAa,OAAO,CAAC;CAC7D;;;;;CAMA,MAAM,MAAM,OAAyC;EACnD,IAAI,KAAK,UACP,OAAO,KAAK,SAAS,OAAO,SAAS;EAEvC,IAAI;GACF,OAAO,MAAM,KAAK,SAAS,KAAK;EAClC,SAAS,GAAG;GACV,KAAK,IAAI,OAAO,uCAAuC,CAAC;GACxD,KAAK,UAAU,IAAI,GAAG,EAAC,QAAQ,QAAO,CAAC;GACvC,OAAO,KAAK,SAAS,OAAO,SAAS,UAAU;EACjD;CACF;;;;;;;CAQA,MAAM,QAA+B;EACnC,KAAK,UAAU,IAAI,SAAS,KAAK,UAAU,IAAI,MAAM,KAAK,KAAK,CAAC;EAChE,OAAO,KAAK,MAAM,eAAe,CAAC,CAAC;CACrC;;;;;CAMA,OAAO,QAAsB;EAC3B,MAAM,QAAQ,KAAK,UAAU,IAAI,MAAM;EACvC,IAAI,UAAU,KAAA,GACZ;EAEF,IAAI,QAAQ,GAAG;GACb,KAAK,UAAU,IAAI,QAAQ,QAAQ,CAAC;GACpC;EACF;EACA,KAAK,UAAU,OAAO,MAAM;CAC9B;;;;;;CAOA,eAAqB;EACnB,KAAK,MAAM,UAAU,KAAK,oBACxB,OAAO;EAET,KAAK,mBAAmB,MAAM;CAChC;CAEA,OAAa;EACX,KAAK,WAAW;EAChB,KAAK,aAAa;CACpB;CAEA,MAAM,SAAS,OAAyC;EACtD,MAAM,YAAY,YAAY,IAAI;EAClC,IAAI,UAAU;EACd,IAAI,cAAc;EAClB,IAAI;EACJ,IAAI;EAEJ,IAAI;GACF,SAAS;IACP,IAAI,KAAK,UAAU;KACjB,UAAU;KACV;IACF;IACA,IAAI,KAAK,UAAU,OAAO,GAAG;KAC3B,UAAU;KACV;IACF;IACA,MAAM,aAAa,KAAK,YAAY;IACpC,IAAI,eAAe,KAAA,GAAW;KAC5B,KAAK,KAAA;KACL,KAAK,IAAI,QACP,qEACF;KACA,UAAU;KACV;IACF;IACA,KAAK;IACL,IACE,WACA,KAAK,IACH,GACA,KAAK,MAAM,qBAAqB,4BAClC,GACA;KACA,UAAU;KACV;IACF;IACA,IAAI,WAAW,eAAe;KAE5B,MAAM,KAAK,iBAAiB;KAC5B;IACF;IAEA,MAAM,UAAU,MAAM,KAAK,MAAM,eAAe;KAI9C,IAAI,KAAK,YAAY,MAAM,cAAc,WAAW,eAClD,OAAO,EAAC,MAAM,QAAO;KAEvB,MAAM,WAAW,KAAK,MAAM,KAAK;KACjC,IAAI,aAAa,KAAA,GACf,OAAO;MAAC,MAAM;MAAY,QAAQ;KAAQ;KAS5C,OAAO;MAAC,MAAM;MAAU,QAPT,KAAK,UAAU,UAAU,CAAC,CAAC,OAAO,WAAW;OAC1D,eAAe;OACf,mBAAmB,KAAK,KAAK,IAAI,KAAK,MAAM;OAC5C,SAAS,KAAK,MAAM;OACpB,eACE,KAAK,MAAM,qBAAqB;MACpC,CACwB;KAAM;IAChC,CAAC;IAED,IAAI,QAAQ,SAAS,SACnB;IAEF,IAAI,QAAQ,SAAS,YAAY;KAC/B,UAAU,QAAQ;KAClB;IACF;IACA;IACA,eAAe,QAAQ,OAAO;IAC9B,IAAI,CAAC,QAAQ,OAAO,cAClB;IAIF,MAAM,KAAK,OAAO;GACpB;EACF,SAAS,GAAG;GAIV,KAAK,IAAI,OAAO,uCAAuC,CAAC;GACxD,UAAU;EACZ;EAEA,MAAM,QAAQ,OAAO,KAAA,IAAY,KAAA,IAAY,KAAK,YAAY,IAAI,KAAK;EACvE,IAAI;EACJ,IAAI;GACF,eAAe,KAAK,cAAc,OAAO,OAAO;EAClD,SAAS,GAAG;GAGV,KAAK,IAAI,OACP,uEACA,CACF;GACA,eAAe;GACf,YAAY;EACd;EACA,IAAI,cAAc,GAChB,KAAK,YAAY,IAAI,WAAW;EAElC,IAAI,UAAU,GAAG;GACf,KAAK,aAAa,OAAO,OAAO;GAChC,KAAK,cAAc,SAAS,YAAY,IAAI,IAAI,SAAS;EAC3D;EACA,IAAI,YAAY,KAAA,GACd,KAAK,UAAU,IAAI,GAAG,EAAC,QAAQ,QAAO,CAAC;EAEzC,IAAI,UAAU,KAAK,YAAY,sBAC7B,KAAK,IAAI,QAAQ,gCAAgC,EAC/C,sBAAsB;GACpB;GACA;GACA;GACA;GACA;GACA;EACF,EACF,CAAC;EAEH,OAAO;GAAC;GAAO;GAAS;GAAa;GAAS;GAAO;EAAY;CACnE;;;;;;;;CASA,cACE,OACA,SAC+B;EAC/B,QAAQ,SAAR;GACE,KAAK,eACH,OAAO;GACT,KAAK,WACH;GACF,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,SACH,OAAO;GACT,KAAK,KAAA,GAAW;IAGd,MAAM,KAAK,KAAK,YAAY;IAC5B,IAAI,OAAO,KAAA,GACT,OAAO;IAET,MAAM,EAAC,SAAS,oBAAmB,KAAK,UACtC,EACF,CAAC,CAAC,kBAAkB,IAGjB,EAAC,MAAK,CAAC;IACV,OAAO,YAAY,KAAK,oBAAoB,IAAI,KAAA,IAAY;GAC9D;EACF;CACF;;;;;;CAOA,MAAM,OAAgD;EACpD,KAAK,MAAM,OAAO,KAAK,gBAAgB,GACrC,IAAI,MAAM,OACR,OAAO;CAIb;;;;;;CAOA,YAAY,IAAc,OAA8C;EACtE,IAAI;GAEF,MAAM,MADQ,KAAK,UAAU,EACjB,CAAA,CAAM,KAAK,IAAa,EAAC,eAAe,MAAK,CAAC;GAC1D,MAAM,EAAC,eAAe,iBAAgB;GACtC,IAAI,kBAAkB,QAAQ,iBAAiB,MAC7C;GAEF,IAAI;GACJ,IAAI,QAAQ,eACV,UAAU;QACL,IAAI,QAAQ,gBAAgB,IAAI,mBAAmB,GAAG;IAC3D,MAAM,EAAC,kBAAiB,kBAAkB,EAAE;IAC5C,UAAU,iBAAiB,QAAQ,cAAc;GACnD,OACE,UAAU;GAEZ,KAAK,aAAa,IAAI,GAAG,EAAC,QAAO,CAAC;GAClC,IAAI,YAAY,aACd,KAAK,IAAI,QACP,qJAGA,EAAC,2BAA2B;IAAC;IAAO,GAAG;GAAG,EAAC,CAC7C;GAEF,OAAO;EACT,SAAS,GAAG;GACV,KAAK,IAAI,OAAO,qDAAqD,CAAC;GACtE;EACF;CACF;;CAGA,mBAAkC;EAChC,OAAO,IAAI,SAAc,YAAW;GAClC,IAAI;GACJ,MAAM,eAAe;IACnB,IAAI,UAAU,KAAA,GACZ,KAAK,gBAAgB,KAAK;IAE5B,KAAK,mBAAmB,OAAO,MAAM;IACrC,QAAQ;GACV;GACA,KAAK,mBAAmB,IAAI,MAAM;GAClC,QAAQ,KAAK,cACX,QACA,KAAK,MAAM,uBAAuB,8BACpC;EACF,CAAC;CACH;;;;;;CAOA,UAAU,IAA+B;EACvC,IAAI,KAAK,QAAQ,OAAO,IACtB,KAAK,SAAS;GACZ;GACA,QAAQ,IAAI,sBAAsB,EAAE;GACpC,MAAM,GAAG,QAAQ,0BAA0B;GAC3C,mBAAmB,GAAG,QAAQ,uBAAuB;EACvD;EAEF,OAAO,KAAK;CACd;CAEA,SACE,OACA,QACA,cACiB;EACjB,OAAO;GACL;GACA,SAAS;GACT,aAAa;GACb,SAAS;GACT,OAAO,KAAA;GACP;EACF;CACF;AACF"}

package/out/zero-cache/src/services/change-streamer/sqlite-change-log-read-router.js.map

@@ -1 +1 @@
-{"version":3,"file":"sqlite-change-log-read-router.js","names":["#shard","#readPercent","#coldReadPercent","#retentionMs","#inspect","#failureCooldownMs","#now","#pins","#choose","#asPinned","#permanentlyDisabled","#breakerUntilMs"],"sources":["../../../../../../zero-cache/src/services/change-streamer/sqlite-change-log-read-router.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {Database} from '../../../../zqlite/src/db.ts';\nimport type {ShardID} from '../../types/shards.ts';\nimport {\n  CHANGE_LOG_DB_SCHEMA_VERSION,\n  readChangeLogBounds,\n  readChangeLogMeta,\n  type ChangeLogIdentity,\n} from '../replicator/change-log-db.ts';\nimport {isSampledForShard} from './shard-sampling.ts';\n\nexport type ChangeLogReadSource = 'pg' | 'sqlite';\n\nexport type SQLiteChangeLogCoverage = {\n  readonly seededAtMs: number;\n  readonly seedWatermark: string;\n  readonly minWatermark: string;\n  readonly headWatermark: string;\n};\n\nexport type ChangeLogReadRouteReason =\n  | 'selected'\n  // Selected while the log was still inside its warm-up window. Kept\n  // distinct from 'selected' so bootstrap serving is separable in metrics\n  // from steady-state serving.\n  | 'selected-cold'\n  | 'percentage'\n  | 'cold-log'\n  | 'log-unavailable'\n  | 'breaker-open'\n  // Pinned to SQLite, then demoted because the log could not cover the\n  // backup the reservation is restoring from. See {@link\n  // SQLiteChangeLogReadRouter.demote}.\n  | 'backup-uncovered';\n\nexport type ChangeLogReadRoute = {\n  readonly source: ChangeLogReadSource;\n  readonly reason: ChangeLogReadRouteReason;\n  readonly pinned?: boolean | undefined;\n  readonly coverage?: SQLiteChangeLogCoverage | undefined;\n};\n\nexport type SQLiteChangeLogReadRouterOptions = {\n  readonly shard: ShardID;\n  readonly readPercent: number;\n  /**\n   * Percentage of eligible tasks served from a log that has not yet aged\n   * through {@link retentionMs}. Defaults to zero, which keeps every such\n   * task on PG.\n   */\n  readonly coldReadPercent?: number | undefined;\n  readonly retentionMs: number;\n  readonly inspect: () => SQLiteChangeLogCoverage | undefined;\n  readonly failureCooldownMs?: number | undefined;\n  readonly now?: (() => number) | undefined;\n};\n\nconst DEFAULT_FAILURE_COOLDOWN_MS = 30_000;\n\n/**\n * Selects and pins the catchup source shared by `/snapshot` and `/changes`.\n *\n * A post-registration SQLite failure opens a process-local breaker. Requests\n * use PG during the cooldown; the first request after it expires is the\n * bounded probe. A successful readiness inspection closes the breaker, while\n * another unavailable result rearms it. A writer failure opens it permanently\n * because the writer remains disabled and its file stays absent for the life\n * of the process.\n */\nexport class SQLiteChangeLogReadRouter {\n  readonly #shard: ShardID;\n  readonly #readPercent: number;\n  readonly #coldReadPercent: number;\n  readonly #retentionMs: number;\n  readonly #inspect: () => SQLiteChangeLogCoverage | undefined;\n  readonly #failureCooldownMs: number;\n  readonly #now: () => number;\n  readonly #pins = new Map<string, ChangeLogReadRoute>();\n\n  #breakerUntilMs: number | undefined;\n  #permanentlyDisabled = false;\n\n  constructor(opts: SQLiteChangeLogReadRouterOptions) {\n    this.#shard = opts.shard;\n    this.#readPercent = opts.readPercent;\n    this.#coldReadPercent = opts.coldReadPercent ?? 0;\n    this.#retentionMs = opts.retentionMs;\n    this.#inspect = opts.inspect;\n    this.#failureCooldownMs =\n      opts.failureCooldownMs ?? DEFAULT_FAILURE_COOLDOWN_MS;\n    this.#now = opts.now ?? Date.now;\n  }\n\n  /** Chooses and pins a source for a snapshot reservation. */\n  pin(taskID: string): ChangeLogReadRoute {\n    const route = this.#choose(taskID);\n    this.#pins.set(taskID, route);\n    return route;\n  }\n\n  /** Returns the source pinned by an active snapshot reservation. */\n  peek(taskID: string): ChangeLogReadRoute | undefined {\n    const route = this.#pins.get(taskID);\n    return route && this.#asPinned(route);\n  }\n\n  /** Consumes a snapshot pin, or makes the stable choice for a direct retry. */\n  consume(taskID: string): ChangeLogReadRoute {\n    const route = this.#pins.get(taskID);\n    if (route === undefined) {\n      return this.#choose(taskID);\n    }\n    this.#pins.delete(taskID);\n    return this.#asPinned(route);\n  }\n\n  /** Releases a pin whose snapshot reservation ended before subscribing. */\n  release(taskID: string): void {\n    this.#pins.delete(taskID);\n  }\n\n  /**\n   * Replaces a pinned SQLite route with PG, for a reservation whose backup\n   * the log cannot cover -- most often a log seeded after that backup.\n   *\n   * The pin moves, not just the reservation's advertised bounds. Confirming\n   * with PG bounds while the task's `/changes` request still resolves to\n   * SQLite is exactly the mismatch the reservation path exists to prevent,\n   * so the two have to change together.\n   *\n   * A task with no pin is left alone: `consume` makes it a fresh choice.\n   */\n  demote(taskID: string): ChangeLogReadRoute {\n    const route: ChangeLogReadRoute = {\n      source: 'pg',\n      reason: 'backup-uncovered',\n    };\n    if (this.#pins.has(taskID)) {\n      this.#pins.set(taskID, route);\n    }\n    return route;\n  }\n\n  /** Opens the post-registration failure breaker. */\n  trip(permanent = false): void {\n    if (permanent) {\n      this.#permanentlyDisabled = true;\n      this.#breakerUntilMs = undefined;\n      return;\n    }\n    if (!this.#permanentlyDisabled) {\n      this.#breakerUntilMs = this.#now() + this.#failureCooldownMs;\n    }\n  }\n\n  #choose(taskID: string): ChangeLogReadRoute {\n    const now = this.#now();\n    if (\n      this.#permanentlyDisabled ||\n      (this.#breakerUntilMs !== undefined && now < this.#breakerUntilMs)\n    ) {\n      return {source: 'pg', reason: 'breaker-open'};\n    }\n\n    // Inspect eligibility even at readPercent=0. Slice 11 starts its rollout\n    // at zero specifically so warm/cold/unavailable rates are visible before\n    // any subscriber is routed to SQLite.\n    let coverage: SQLiteChangeLogCoverage | undefined;\n    try {\n      coverage = this.#inspect();\n    } catch {\n      coverage = undefined;\n    }\n    if (coverage === undefined) {\n      // This was a breaker probe rather than ordinary startup unavailability.\n      // Rearm it so a busy retry loop does not turn into an open/read loop.\n      if (this.#breakerUntilMs !== undefined) {\n        this.#breakerUntilMs = now + this.#failureCooldownMs;\n      }\n      return {source: 'pg', reason: 'log-unavailable'};\n    }\n    // A successful probe restores eligibility. This happens before the gates\n    // below so that declining a task -- for a cold log or for the percentage\n    // -- does not leave the cooldown armed against the next ordinary\n    // unavailability.\n    this.#breakerUntilMs = undefined;\n    // A log seeded less than a retention window ago holds less history than\n    // the purger promises to keep, so it is the case that most often cannot\n    // cover a follower. It is also the only path that has no PG to fall back\n    // to once PG is retired, which is the argument for exercising it now\n    // rather than meeting it at the cutover: `coldReadPercent` is that dial.\n    const cold = now - coverage.seededAtMs < this.#retentionMs;\n    if (\n      cold &&\n      !isSampledForShard(this.#shard, taskID, this.#coldReadPercent)\n    ) {\n      return {source: 'pg', reason: 'cold-log', coverage};\n    }\n\n    // Keeping the percentage decision after readiness makes zero-percent\n    // rollouts emit eligibility metrics without serving reads.\n    if (!isSampledForShard(this.#shard, taskID, this.#readPercent)) {\n      return {source: 'pg', reason: 'percentage', coverage};\n    }\n    return {\n      source: 'sqlite',\n      reason: cold ? 'selected-cold' : 'selected',\n      coverage,\n    };\n  }\n\n  #asPinned(route: ChangeLogReadRoute): ChangeLogReadRoute {\n    return {...route, pinned: true};\n  }\n}\n\n/**\n * Reads the coverage and validates the v2 schema and RMv2 identity in one\n * short-lived readonly connection. It never creates the log.\n */\nexport function inspectSQLiteChangeLog(\n  lc: LogContext,\n  changeLogFile: string,\n  identity: ChangeLogIdentity,\n): SQLiteChangeLogCoverage | undefined {\n  let db: Database | undefined;\n  try {\n    db = new Database(\n      lc.withContext('component', 'sqlite-change-log-read-router'),\n      changeLogFile,\n      {readonly: true},\n    );\n    const meta = readChangeLogMeta(db);\n    if (\n      meta.schemaVersion !== CHANGE_LOG_DB_SCHEMA_VERSION ||\n      meta.epoch !== identity.epoch ||\n      meta.generation !== identity.generation ||\n      meta.replicaID !== identity.replicaID\n    ) {\n      return undefined;\n    }\n    const bounds = readChangeLogBounds(db);\n    if (bounds.minWatermark === null || bounds.headWatermark === null) {\n      return undefined;\n    }\n    return {\n      seededAtMs: meta.seededAtMs,\n      seedWatermark: meta.seedWatermark,\n      minWatermark: bounds.minWatermark,\n      headWatermark: bounds.headWatermark,\n    };\n  } catch {\n    return undefined;\n  } finally {\n    db?.close();\n  }\n}\n"],"mappings":";;;;AAyDA,IAAM,8BAA8B;;;;;;;;;;;AAYpC,IAAa,4BAAb,MAAuC;CACrC;CACA;CACA;CACA;CACA;CACA;CACA;CACA,wBAAiB,IAAI,IAAgC;CAErD;CACA,uBAAuB;CAEvB,YAAY,MAAwC;EAClD,KAAKA,SAAS,KAAK;EACnB,KAAKC,eAAe,KAAK;EACzB,KAAKC,mBAAmB,KAAK,mBAAmB;EAChD,KAAKC,eAAe,KAAK;EACzB,KAAKC,WAAW,KAAK;EACrB,KAAKC,qBACH,KAAK,qBAAqB;EAC5B,KAAKC,OAAO,KAAK,OAAO,KAAK;CAC/B;;CAGA,IAAI,QAAoC;EACtC,MAAM,QAAQ,KAAKE,QAAQ,MAAM;EACjC,KAAKD,MAAM,IAAI,QAAQ,KAAK;EAC5B,OAAO;CACT;;CAGA,KAAK,QAAgD;EACnD,MAAM,QAAQ,KAAKA,MAAM,IAAI,MAAM;EACnC,OAAO,SAAS,KAAKE,UAAU,KAAK;CACtC;;CAGA,QAAQ,QAAoC;EAC1C,MAAM,QAAQ,KAAKF,MAAM,IAAI,MAAM;EACnC,IAAI,UAAU,KAAA,GACZ,OAAO,KAAKC,QAAQ,MAAM;EAE5B,KAAKD,MAAM,OAAO,MAAM;EACxB,OAAO,KAAKE,UAAU,KAAK;CAC7B;;CAGA,QAAQ,QAAsB;EAC5B,KAAKF,MAAM,OAAO,MAAM;CAC1B;;;;;;;;;;;;CAaA,OAAO,QAAoC;EACzC,MAAM,QAA4B;GAChC,QAAQ;GACR,QAAQ;EACV;EACA,IAAI,KAAKA,MAAM,IAAI,MAAM,GACvB,KAAKA,MAAM,IAAI,QAAQ,KAAK;EAE9B,OAAO;CACT;;CAGA,KAAK,YAAY,OAAa;EAC5B,IAAI,WAAW;GACb,KAAKG,uBAAuB;GAC5B,KAAKC,kBAAkB,KAAA;GACvB;EACF;EACA,IAAI,CAAC,KAAKD,sBACR,KAAKC,kBAAkB,KAAKL,KAAK,IAAI,KAAKD;CAE9C;CAEA,QAAQ,QAAoC;EAC1C,MAAM,MAAM,KAAKC,KAAK;EACtB,IACE,KAAKI,wBACJ,KAAKC,oBAAoB,KAAA,KAAa,MAAM,KAAKA,iBAElD,OAAO;GAAC,QAAQ;GAAM,QAAQ;EAAc;EAM9C,IAAI;EACJ,IAAI;GACF,WAAW,KAAKP,SAAS;EAC3B,QAAQ;GACN,WAAW,KAAA;EACb;EACA,IAAI,aAAa,KAAA,GAAW;GAG1B,IAAI,KAAKO,oBAAoB,KAAA,GAC3B,KAAKA,kBAAkB,MAAM,KAAKN;GAEpC,OAAO;IAAC,QAAQ;IAAM,QAAQ;GAAiB;EACjD;EAKA,KAAKM,kBAAkB,KAAA;EAMvB,MAAM,OAAO,MAAM,SAAS,aAAa,KAAKR;EAC9C,IACE,QACA,CAAC,kBAAkB,KAAKH,QAAQ,QAAQ,KAAKE,gBAAgB,GAE7D,OAAO;GAAC,QAAQ;GAAM,QAAQ;GAAY;EAAQ;EAKpD,IAAI,CAAC,kBAAkB,KAAKF,QAAQ,QAAQ,KAAKC,YAAY,GAC3D,OAAO;GAAC,QAAQ;GAAM,QAAQ;GAAc;EAAQ;EAEtD,OAAO;GACL,QAAQ;GACR,QAAQ,OAAO,kBAAkB;GACjC;EACF;CACF;CAEA,UAAU,OAA+C;EACvD,OAAO;GAAC,GAAG;GAAO,QAAQ;EAAI;CAChC;AACF;;;;;AAMA,SAAgB,uBACd,IACA,eACA,UACqC;CACrC,IAAI;CACJ,IAAI;EACF,KAAK,IAAI,SACP,GAAG,YAAY,aAAa,+BAA+B,GAC3D,eACA,EAAC,UAAU,KAAI,CACjB;EACA,MAAM,OAAO,kBAAkB,EAAE;EACjC,IACE,KAAK,kBAAA,KACL,KAAK,UAAU,SAAS,SACxB,KAAK,eAAe,SAAS,cAC7B,KAAK,cAAc,SAAS,WAE5B;EAEF,MAAM,SAAS,oBAAoB,EAAE;EACrC,IAAI,OAAO,iBAAiB,QAAQ,OAAO,kBAAkB,MAC3D;EAEF,OAAO;GACL,YAAY,KAAK;GACjB,eAAe,KAAK;GACpB,cAAc,OAAO;GACrB,eAAe,OAAO;EACxB;CACF,QAAQ;EACN;CACF,UAAU;EACR,IAAI,MAAM;CACZ;AACF"}
+{"version":3,"file":"sqlite-change-log-read-router.js","names":[],"sources":["../../../../../../zero-cache/src/services/change-streamer/sqlite-change-log-read-router.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {Database} from '../../../../zqlite/src/db.ts';\nimport type {ShardID} from '../../types/shards.ts';\nimport {\n  CHANGE_LOG_DB_SCHEMA_VERSION,\n  readChangeLogBounds,\n  readChangeLogMeta,\n  type ChangeLogIdentity,\n} from '../replicator/change-log-db.ts';\nimport {isSampledForShard} from './shard-sampling.ts';\n\nexport type ChangeLogReadSource = 'pg' | 'sqlite';\n\nexport type SQLiteChangeLogCoverage = {\n  readonly seededAtMs: number;\n  readonly seedWatermark: string;\n  readonly minWatermark: string;\n  readonly headWatermark: string;\n};\n\ntype ChangeLogReadRouteReason =\n  | 'selected'\n  // Selected while the log was still inside its warm-up window. Kept\n  // distinct from 'selected' so bootstrap serving is separable in metrics\n  // from steady-state serving.\n  | 'selected-cold'\n  | 'percentage'\n  | 'cold-log'\n  | 'log-unavailable'\n  | 'breaker-open'\n  // Pinned to SQLite, then demoted because the log could not cover the\n  // backup the reservation is restoring from. See {@link\n  // SQLiteChangeLogReadRouter.demote}.\n  | 'backup-uncovered';\n\nexport type ChangeLogReadRoute = {\n  readonly source: ChangeLogReadSource;\n  readonly reason: ChangeLogReadRouteReason;\n  readonly pinned?: boolean | undefined;\n  readonly coverage?: SQLiteChangeLogCoverage | undefined;\n};\n\nexport type SQLiteChangeLogReadRouterOptions = {\n  readonly shard: ShardID;\n  readonly readPercent: number;\n  /**\n   * Percentage of eligible tasks served from a log that has not yet aged\n   * through {@link retentionMs}. Defaults to zero, which keeps every such\n   * task on PG.\n   */\n  readonly coldReadPercent?: number | undefined;\n  readonly retentionMs: number;\n  readonly inspect: () => SQLiteChangeLogCoverage | undefined;\n  readonly failureCooldownMs?: number | undefined;\n  readonly now?: (() => number) | undefined;\n};\n\nconst DEFAULT_FAILURE_COOLDOWN_MS = 30_000;\n\n/**\n * Selects and pins the catchup source shared by `/snapshot` and `/changes`.\n *\n * A post-registration SQLite failure opens a process-local breaker. Requests\n * use PG during the cooldown; the first request after it expires is the\n * bounded probe. A successful readiness inspection closes the breaker, while\n * another unavailable result rearms it. A writer failure opens it permanently\n * because the writer remains disabled and its file stays absent for the life\n * of the process.\n */\nexport class SQLiteChangeLogReadRouter {\n  readonly #shard: ShardID;\n  readonly #readPercent: number;\n  readonly #coldReadPercent: number;\n  readonly #retentionMs: number;\n  readonly #inspect: () => SQLiteChangeLogCoverage | undefined;\n  readonly #failureCooldownMs: number;\n  readonly #now: () => number;\n  readonly #pins = new Map<string, ChangeLogReadRoute>();\n\n  #breakerUntilMs: number | undefined;\n  #permanentlyDisabled = false;\n\n  constructor(opts: SQLiteChangeLogReadRouterOptions) {\n    this.#shard = opts.shard;\n    this.#readPercent = opts.readPercent;\n    this.#coldReadPercent = opts.coldReadPercent ?? 0;\n    this.#retentionMs = opts.retentionMs;\n    this.#inspect = opts.inspect;\n    this.#failureCooldownMs =\n      opts.failureCooldownMs ?? DEFAULT_FAILURE_COOLDOWN_MS;\n    this.#now = opts.now ?? Date.now;\n  }\n\n  /** Chooses and pins a source for a snapshot reservation. */\n  pin(taskID: string): ChangeLogReadRoute {\n    const route = this.#choose(taskID);\n    this.#pins.set(taskID, route);\n    return route;\n  }\n\n  /** Returns the source pinned by an active snapshot reservation. */\n  peek(taskID: string): ChangeLogReadRoute | undefined {\n    const route = this.#pins.get(taskID);\n    return route && this.#asPinned(route);\n  }\n\n  /** Consumes a snapshot pin, or makes the stable choice for a direct retry. */\n  consume(taskID: string): ChangeLogReadRoute {\n    const route = this.#pins.get(taskID);\n    if (route === undefined) {\n      return this.#choose(taskID);\n    }\n    this.#pins.delete(taskID);\n    return this.#asPinned(route);\n  }\n\n  /** Releases a pin whose snapshot reservation ended before subscribing. */\n  release(taskID: string): void {\n    this.#pins.delete(taskID);\n  }\n\n  /**\n   * Replaces a pinned SQLite route with PG, for a reservation whose backup\n   * the log cannot cover -- most often a log seeded after that backup.\n   *\n   * The pin moves, not just the reservation's advertised bounds. Confirming\n   * with PG bounds while the task's `/changes` request still resolves to\n   * SQLite is exactly the mismatch the reservation path exists to prevent,\n   * so the two have to change together.\n   *\n   * A task with no pin is left alone: `consume` makes it a fresh choice.\n   */\n  demote(taskID: string): ChangeLogReadRoute {\n    const route: ChangeLogReadRoute = {\n      source: 'pg',\n      reason: 'backup-uncovered',\n    };\n    if (this.#pins.has(taskID)) {\n      this.#pins.set(taskID, route);\n    }\n    return route;\n  }\n\n  /** Opens the post-registration failure breaker. */\n  trip(permanent = false): void {\n    if (permanent) {\n      this.#permanentlyDisabled = true;\n      this.#breakerUntilMs = undefined;\n      return;\n    }\n    if (!this.#permanentlyDisabled) {\n      this.#breakerUntilMs = this.#now() + this.#failureCooldownMs;\n    }\n  }\n\n  #choose(taskID: string): ChangeLogReadRoute {\n    const now = this.#now();\n    if (\n      this.#permanentlyDisabled ||\n      (this.#breakerUntilMs !== undefined && now < this.#breakerUntilMs)\n    ) {\n      return {source: 'pg', reason: 'breaker-open'};\n    }\n\n    // Inspect eligibility even at readPercent=0. Slice 11 starts its rollout\n    // at zero specifically so warm/cold/unavailable rates are visible before\n    // any subscriber is routed to SQLite.\n    let coverage: SQLiteChangeLogCoverage | undefined;\n    try {\n      coverage = this.#inspect();\n    } catch {\n      coverage = undefined;\n    }\n    if (coverage === undefined) {\n      // This was a breaker probe rather than ordinary startup unavailability.\n      // Rearm it so a busy retry loop does not turn into an open/read loop.\n      if (this.#breakerUntilMs !== undefined) {\n        this.#breakerUntilMs = now + this.#failureCooldownMs;\n      }\n      return {source: 'pg', reason: 'log-unavailable'};\n    }\n    // A successful probe restores eligibility. This happens before the gates\n    // below so that declining a task -- for a cold log or for the percentage\n    // -- does not leave the cooldown armed against the next ordinary\n    // unavailability.\n    this.#breakerUntilMs = undefined;\n    // A log seeded less than a retention window ago holds less history than\n    // the purger promises to keep, so it is the case that most often cannot\n    // cover a follower. It is also the only path that has no PG to fall back\n    // to once PG is retired, which is the argument for exercising it now\n    // rather than meeting it at the cutover: `coldReadPercent` is that dial.\n    const cold = now - coverage.seededAtMs < this.#retentionMs;\n    if (\n      cold &&\n      !isSampledForShard(this.#shard, taskID, this.#coldReadPercent)\n    ) {\n      return {source: 'pg', reason: 'cold-log', coverage};\n    }\n\n    // Keeping the percentage decision after readiness makes zero-percent\n    // rollouts emit eligibility metrics without serving reads.\n    if (!isSampledForShard(this.#shard, taskID, this.#readPercent)) {\n      return {source: 'pg', reason: 'percentage', coverage};\n    }\n    return {\n      source: 'sqlite',\n      reason: cold ? 'selected-cold' : 'selected',\n      coverage,\n    };\n  }\n\n  #asPinned(route: ChangeLogReadRoute): ChangeLogReadRoute {\n    return {...route, pinned: true};\n  }\n}\n\n/**\n * Reads the coverage and validates the v2 schema and RMv2 identity in one\n * short-lived readonly connection. It never creates the log.\n */\nexport function inspectSQLiteChangeLog(\n  lc: LogContext,\n  changeLogFile: string,\n  identity: ChangeLogIdentity,\n): SQLiteChangeLogCoverage | undefined {\n  let db: Database | undefined;\n  try {\n    db = new Database(\n      lc.withContext('component', 'sqlite-change-log-read-router'),\n      changeLogFile,\n      {readonly: true},\n    );\n    const meta = readChangeLogMeta(db);\n    if (\n      meta.schemaVersion !== CHANGE_LOG_DB_SCHEMA_VERSION ||\n      meta.epoch !== identity.epoch ||\n      meta.generation !== identity.generation ||\n      meta.replicaID !== identity.replicaID\n    ) {\n      return undefined;\n    }\n    const bounds = readChangeLogBounds(db);\n    if (bounds.minWatermark === null || bounds.headWatermark === null) {\n      return undefined;\n    }\n    return {\n      seededAtMs: meta.seededAtMs,\n      seedWatermark: meta.seedWatermark,\n      minWatermark: bounds.minWatermark,\n      headWatermark: bounds.headWatermark,\n    };\n  } catch {\n    return undefined;\n  } finally {\n    db?.close();\n  }\n}\n"],"mappings":";;;;AAyDA,IAAM,8BAA8B;;;;;;;;;;;AAYpC,IAAa,4BAAb,MAAuC;CACrC;CACA;CACA;CACA;CACA;CACA;CACA;CACA,wBAAiB,IAAI,IAAgC;CAErD;CACA,uBAAuB;CAEvB,YAAY,MAAwC;EAClD,KAAK,SAAS,KAAK;EACnB,KAAK,eAAe,KAAK;EACzB,KAAK,mBAAmB,KAAK,mBAAmB;EAChD,KAAK,eAAe,KAAK;EACzB,KAAK,WAAW,KAAK;EACrB,KAAK,qBACH,KAAK,qBAAqB;EAC5B,KAAK,OAAO,KAAK,OAAO,KAAK;CAC/B;;CAGA,IAAI,QAAoC;EACtC,MAAM,QAAQ,KAAK,QAAQ,MAAM;EACjC,KAAK,MAAM,IAAI,QAAQ,KAAK;EAC5B,OAAO;CACT;;CAGA,KAAK,QAAgD;EACnD,MAAM,QAAQ,KAAK,MAAM,IAAI,MAAM;EACnC,OAAO,SAAS,KAAK,UAAU,KAAK;CACtC;;CAGA,QAAQ,QAAoC;EAC1C,MAAM,QAAQ,KAAK,MAAM,IAAI,MAAM;EACnC,IAAI,UAAU,KAAA,GACZ,OAAO,KAAK,QAAQ,MAAM;EAE5B,KAAK,MAAM,OAAO,MAAM;EACxB,OAAO,KAAK,UAAU,KAAK;CAC7B;;CAGA,QAAQ,QAAsB;EAC5B,KAAK,MAAM,OAAO,MAAM;CAC1B;;;;;;;;;;;;CAaA,OAAO,QAAoC;EACzC,MAAM,QAA4B;GAChC,QAAQ;GACR,QAAQ;EACV;EACA,IAAI,KAAK,MAAM,IAAI,MAAM,GACvB,KAAK,MAAM,IAAI,QAAQ,KAAK;EAE9B,OAAO;CACT;;CAGA,KAAK,YAAY,OAAa;EAC5B,IAAI,WAAW;GACb,KAAK,uBAAuB;GAC5B,KAAK,kBAAkB,KAAA;GACvB;EACF;EACA,IAAI,CAAC,KAAK,sBACR,KAAK,kBAAkB,KAAK,KAAK,IAAI,KAAK;CAE9C;CAEA,QAAQ,QAAoC;EAC1C,MAAM,MAAM,KAAK,KAAK;EACtB,IACE,KAAK,wBACJ,KAAK,oBAAoB,KAAA,KAAa,MAAM,KAAK,iBAElD,OAAO;GAAC,QAAQ;GAAM,QAAQ;EAAc;EAM9C,IAAI;EACJ,IAAI;GACF,WAAW,KAAK,SAAS;EAC3B,QAAQ;GACN,WAAW,KAAA;EACb;EACA,IAAI,aAAa,KAAA,GAAW;GAG1B,IAAI,KAAK,oBAAoB,KAAA,GAC3B,KAAK,kBAAkB,MAAM,KAAK;GAEpC,OAAO;IAAC,QAAQ;IAAM,QAAQ;GAAiB;EACjD;EAKA,KAAK,kBAAkB,KAAA;EAMvB,MAAM,OAAO,MAAM,SAAS,aAAa,KAAK;EAC9C,IACE,QACA,CAAC,kBAAkB,KAAK,QAAQ,QAAQ,KAAK,gBAAgB,GAE7D,OAAO;GAAC,QAAQ;GAAM,QAAQ;GAAY;EAAQ;EAKpD,IAAI,CAAC,kBAAkB,KAAK,QAAQ,QAAQ,KAAK,YAAY,GAC3D,OAAO;GAAC,QAAQ;GAAM,QAAQ;GAAc;EAAQ;EAEtD,OAAO;GACL,QAAQ;GACR,QAAQ,OAAO,kBAAkB;GACjC;EACF;CACF;CAEA,UAAU,OAA+C;EACvD,OAAO;GAAC,GAAG;GAAO,QAAQ;EAAI;CAChC;AACF;;;;;AAMA,SAAgB,uBACd,IACA,eACA,UACqC;CACrC,IAAI;CACJ,IAAI;EACF,KAAK,IAAI,SACP,GAAG,YAAY,aAAa,+BAA+B,GAC3D,eACA,EAAC,UAAU,KAAI,CACjB;EACA,MAAM,OAAO,kBAAkB,EAAE;EACjC,IACE,KAAK,kBAAA,KACL,KAAK,UAAU,SAAS,SACxB,KAAK,eAAe,SAAS,cAC7B,KAAK,cAAc,SAAS,WAE5B;EAEF,MAAM,SAAS,oBAAoB,EAAE;EACrC,IAAI,OAAO,iBAAiB,QAAQ,OAAO,kBAAkB,MAC3D;EAEF,OAAO;GACL,YAAY,KAAK;GACjB,eAAe,KAAK;GACpB,cAAc,OAAO;GACrB,eAAe,OAAO;EACxB;CACF,QAAQ;EACN;CACF,UAAU;EACR,IAAI,MAAM;CACZ;AACF"}

package/out/zero-cache/src/services/change-streamer/sqlite-change-log-reader.js

@@ -116,12 +116,10 @@ var SQLiteChangeLogReader = class {
 			const rows = statements.readBatch.all(lastWatermark, lastPos, throughWatermark, Math.min(batchSize, remainingRows));
 			this.#throwIfAborted(signal);
 			if (rows.length === 0) break;
-			const changes = rows.map(reconstructWatermarkedChange);
+			const changes = rows.map(([watermark, , tag, change]) => reconstructWatermarkedChange(watermark, tag, change));
 			const last = rows.at(-1);
 			assert(last !== void 0, "non-empty batch must have a final row");
-			lastWatermark = last.watermark;
-			lastPos = last.pos;
-			lastTag = last.tag;
+			[lastWatermark, lastPos, lastTag] = last;
 			rowsRead += rows.length;
 			yield changes;
 		}
@@ -143,7 +141,7 @@ var SQLiteChangeLogReader = class {
 	#prepare() {
 		if (this.#statements === void 0 && this.#streamTableExists()) this.#statements = {
 			plan: this.#db.prepare(SQLITE_CHANGE_LOG_PLAN_SQL),
-			readBatch: this.#db.prepare(SQLITE_CHANGE_LOG_READ_BATCH_SQL)
+			readBatch: this.#db.prepare(SQLITE_CHANGE_LOG_READ_BATCH_SQL).raw(true)
 		};
 		return this.#statements;
 	}
@@ -159,6 +157,6 @@ var SQLiteChangeLogReader = class {
 	}
 };
 //#endregion
-export { SQLITE_CHANGE_LOG_BOUNDARY_SQL, SQLITE_CHANGE_LOG_PLAN_SQL, SQLiteChangeLogReader };
+export { SQLITE_CHANGE_LOG_BOUNDARY_SQL, SQLITE_CHANGE_LOG_PLAN_SQL, SQLITE_CHANGE_LOG_READ_BATCH_SQL, SQLiteChangeLogReader };
 
 //# sourceMappingURL=sqlite-change-log-reader.js.map