@torrent-tv/proxy 2.86.0 → 2.87.0

package/services/storage/Diagnostics.js

@@ -0,0 +1,202 @@
+/**
+ * @file The room the evidence takes, and the one rule that bounds it.
+ *
+ * Core dumps, heap snapshots and packet captures are bytes on the same disk the
+ * product needs, and until 2026-09-14 every one of them was bounded by a COUNT
+ * and none by a size: two dumps and five snapshots, kept by their own rules,
+ * came to 3.2 GB on the addon host, and a capture of one wedge was taken
+ * thirteen times in six hours. A count is not a size and cannot bound a disk —
+ * the size of a dump is the size of the process, and the size of a snapshot is
+ * the size of the heap.
+ *
+ * **They are a claimant like any other, and they are told their share.** What
+ * makes them different is what happens at the boundary, and it is the whole of
+ * the design here:
+ *
+ * 1. **over the share, collection STOPS. Nothing recorded is deleted to make
+ *    room.** A dump is the only evidence of the death it records, and the
+ *    machine destroying it to keep collecting would be trading the answer for
+ *    the chance of another question. So a refusal is a LINE — "the evidence of
+ *    this was not kept, there was no room, and here is the figure" — rather
+ *    than a silence;
+ * 2. **except what is superseded, which is not evidence twice.** Only where a
+ *    new artifact strictly contains what an old one said. A heap snapshot taken
+ *    at a HIGHER high-water records the growth the lower one recorded and more;
+ *    a packet capture of a connection already captured adds nothing. Core dumps
+ *    are never superseded: each is a distinct death;
+ * 3. **what they ask for is measured, not a fraction.** What they hold, plus
+ *    room for one more of the largest kind seen. So the claim grows as evidence
+ *    accumulates and never asks for a share of a disk it has no use for.
+ *
+ * All of this is temporary by intention — most of this collection goes after
+ * release — and that is exactly why it must not be the thing that fills a
+ * viewer's disk in the meantime.
+ *
+ * **CORE DUMPS ARE NOT OURS TO REFUSE, and that limit is stated rather than
+ * papered over.** The kernel writes them, whole address space at a time — 4.18
+ * GB each on the field host — and no gate of ours is consulted. They are
+ * counted here, so they take room from what the product may hold and the figure
+ * is visible; what happens when one is about to be written is the kernel's
+ * business. The only lever this side has is removal, and removal of a dump is
+ * removal of the only evidence of a death, which rule 1 refuses. So they are
+ * measured and reported, and the pruning that already keeps the newest two is
+ * left where it is: changing it is a decision about evidence, not about disk.
+ */
+
+import { readdir, stat } from "node:fs/promises";
+import path from "node:path";
+
+export class Diagnostics {
+  /** @type {{ name: string, directory: () => string }[]} */
+  #kinds = [];
+
+  /** What the owner of the disk has allowed, or null before the first division. */
+  #allowanceBytes = null;
+
+  /** What the directories were last seen to weigh. */
+  #heldBytes = 0;
+
+  /** The largest single artifact seen, which is the room one more of it needs. */
+  #largestBytes = 0;
+
+  /** @type {{ info: Function, warn: Function }} */
+  #logger;
+
+  /**
+   * @param {object} params
+   * @param {{ name: string, directory: () => string, matches: (name: string) => boolean }[]} params.kinds -
+   *   Where each kind writes and how its files are told from anything else in
+   *   the same directory — the state directory holds the proxy's own small
+   *   files too, and they are not evidence.
+   * @param {{ info: Function, warn: Function }} [params.logger]
+   */
+  constructor({ kinds, logger = null }) {
+    this.#kinds = Array.isArray(kinds) ? kinds : [];
+    this.#logger = logger ?? { info: () => {}, warn: () => {} };
+  }
+
+  /**
+   * Re-read what the evidence weighs.
+   *
+   * @returns {Promise<number>}
+   */
+  async measure() {
+    let total = 0;
+    let largest = this.#largestBytes;
+    for (const kind of this.#kinds) {
+      const directory = kind.directory();
+      if (!directory) {
+        continue;
+      }
+      let names = [];
+      try {
+        names = await readdir(directory);
+      } catch {
+        continue; // Not there yet, which is the ordinary state before a fault.
+      }
+      for (const name of names) {
+        if (typeof kind.matches === "function" && !kind.matches(name)) {
+          continue;
+        }
+        try {
+          const size = (await stat(path.join(directory, name))).size;
+          total += size;
+          largest = Math.max(largest, size);
+        } catch {
+          // Gone between the listing and the question.
+        }
+      }
+    }
+    this.#heldBytes = total;
+    this.#largestBytes = largest;
+    return total;
+  }
+
+  /** What the evidence weighed when it was last measured. @returns {number} */
+  held() {
+    return this.#heldBytes;
+  }
+
+  /**
+   * What it asks the owner of the disk for.
+   *
+   * What it holds, plus room for one more of the largest kind seen. A measured
+   * quantity: the claim grows with the evidence rather than standing for a
+   * fraction of a disk it has no use for. Before anything has been written it
+   * asks for nothing, which is correct — a proxy that has never faulted needs
+   * no room to record a fault it has not had.
+   *
+   * @returns {number}
+   */
+  wanted() {
+    return this.#heldBytes + this.#largestBytes;
+  }
+
+  /**
+   * Take the share the owner has divided out.
+   *
+   * @param {number} bytes
+   * @returns {void}
+   */
+  allow(bytes) {
+    this.#allowanceBytes = Number.isFinite(bytes) && bytes >= 0 ? bytes : null;
+  }
+
+  /**
+   * Whether there is room to record one more thing of this size.
+   *
+   * @param {object} params
+   * @param {string} params.what - What would have been recorded, for the line.
+   * @param {number} params.bytes - What it is expected to weigh.
+   * @returns {boolean}
+   */
+  mayKeep({ what, bytes }) {
+    if (this.#allowanceBytes === null) {
+      return true;
+    }
+    const wanted = Math.max(0, Number(bytes) || 0);
+    if (this.#heldBytes + wanted <= this.#allowanceBytes) {
+      return true;
+    }
+    // SAID, NEVER SWALLOWED. The evidence of this fault is not being kept, and
+    // an investigation that finds nothing must be able to tell "it did not
+    // happen" from "we had nowhere to put it".
+    this.#logger.warn(
+      `diagnostics: ${what} was NOT kept — the evidence already here weighs ` +
+      `${megabytes(this.#heldBytes)} of the ${megabytes(this.#allowanceBytes)} this disk can spare, ` +
+      `and this would have needed ${megabytes(wanted)} more. Nothing already recorded is removed ` +
+      "to make room: a dump is the only evidence of the death it records."
+    );
+    return false;
+  }
+
+  /**
+   * Take one artifact into account without re-reading the directories.
+   *
+   * @param {number} bytes
+   * @returns {void}
+   */
+  noteKept(bytes) {
+    const size = Math.max(0, Number(bytes) || 0);
+    this.#heldBytes += size;
+    this.#largestBytes = Math.max(this.#largestBytes, size);
+  }
+
+  /**
+   * What to say about the evidence in the periodic line.
+   *
+   * @returns {string}
+   */
+  describe() {
+    const allowed = this.#allowanceBytes === null ? "not yet divided" : megabytes(this.#allowanceBytes);
+    return `diagnostics hold ${megabytes(this.#heldBytes)} of ${allowed}`;
+  }
+}
+
+/**
+ * @param {number} bytes
+ * @returns {string}
+ */
+function megabytes(bytes) {
+  return `${Math.round(Math.max(0, bytes) / (1024 * 1024))}MB`;
+}

package/services/storage/MachineBudget.js

@@ -0,0 +1,235 @@
+/**
+ * @file The one budget: how much of this machine the proxy may take, and how
+ * that is divided between everything that holds bytes.
+ *
+ * THERE IS ONE BUDGET, AND IT IS NOT ONE NUMBER. Memory cannot be paid for with
+ * disk, so what is divided is divided per RESOURCE; what there is one of is the
+ * OWNER, the POLICY, and the place that reads the machine. Until 2026-09-14
+ * there were two owners — the memory store divided memory inside the torrent
+ * thread, `DiskSpace` divided disk on the main one — each applying the same rule
+ * from `allowance.js` to its own reading, neither able to see the other.
+ *
+ * **Why one owner rather than two, and it is measured rather than argued.** The
+ * claimants TRADE ACROSS RESOURCES. Pieces held in memory that do not fit are
+ * spilled to disk — the same bytes, in whichever resource there is room for —
+ * so how much memory the piece store is given decides how much disk it needs.
+ * Whole files exist on disk so that pieces need not be held at all; produced
+ * segments exist on disk because making them again is dear. Field 2026-08-31:
+ * **14 400 MB spilled to disk in fifty minutes** while the memory store held
+ * 312-424 MB. Give it memory and there is no spill to bound. Two owners cannot
+ * make that trade, because neither sees both sides of it.
+ *
+ * **A RESOURCE IS WHAT CANNOT BE SUBSTITUTED, and disk is not one of them.**
+ * Measured on the addon host 2026-09-05: `/tmp`, where the segments and the
+ * spill live, is the overlay filesystem (`dev=68`); `/data`, where the
+ * diagnostics live, is ext4 on the nvme (`dev=66305`). One "disk" figure
+ * divided between claimants on two devices gives each of them a share of a disk
+ * it is not writing to — which is what `DiskSpace` did, reading the free space
+ * of the segment root alone. So a resource is named by the DEVICE its
+ * claimants' directories are on, read with `statSync(dir).dev` rather than
+ * guessed.
+ *
+ * **The policy is the operator's, stated once at startup.** Three shapes, and
+ * the default is the measured one:
+ *
+ *   - `adaptive` (default) — what is free now, plus what we already hold, less
+ *     what everything that is not us has recently been seen to need. Nothing
+ *     chosen: `allowance.js` computes every term from readings;
+ *   - `share` — a fraction of what is free. A chosen number, and legitimately
+ *     so: it is the machine's owner saying what of their machine we may use;
+ *   - `fixed` — a hard ceiling, the same;
+ *
+ * plus a FLOOR per resource, which is the operator saying "below this the proxy
+ * is not worth running". A floor is not a licence to take: it bounds from
+ * below what the policy hands out, and a claimant below its own minimum says so
+ * rather than working badly in silence.
+ *
+ * The distinction matters because everything else in this codebase refuses
+ * chosen constants. These are chosen BY THE PERSON WHOSE MACHINE IT IS, which
+ * is the one kind of number that is not ours to derive.
+ */
+
+import { OtherDemand, divideAllowance } from "./allowance.js";
+
+/**
+ * One thing that holds bytes of one resource.
+ *
+ * @typedef {object} Claimant
+ * @property {string} name - What it is called in the reading.
+ * @property {string} resource - Which resource it takes.
+ * @property {() => number} held - What it holds right now, in bytes.
+ * @property {() => number} wanted - What it would take if it could.
+ * @property {(allowanceBytes: number) => void} allow - Told its share.
+ * @property {number} [minimum] - Below this it cannot do its job, and says so.
+ */
+
+/**
+ * What the operator has said we may take.
+ *
+ * @typedef {object} BudgetPolicy
+ * @property {"adaptive" | "share" | "fixed"} [kind]
+ * @property {number} [share] - For `share`: the fraction of free space, 0..1.
+ * @property {number} [bytes] - For `fixed`: the ceiling.
+ * @property {Record<string, number>} [floors] - Per resource, the least this
+ *   proxy should have. Absent, the policy's own answer stands.
+ */
+
+export class MachineBudget {
+  /** Resource name → how to read what is free, and what others have needed. */
+  #resources = new Map();
+
+  /** @type {Claimant[]} */
+  #claimants = [];
+
+  /** @type {BudgetPolicy} */
+  #policy;
+
+  #logger;
+
+  /** The last division, for the reading. @type {Map<string, { freeBytes: number, allowanceBytes: number, shares: { name: string, held: number, allowed: number, short: boolean }[] }>} */
+  #last = new Map();
+
+  /**
+   * @param {object} params
+   * @param {BudgetPolicy} [params.policy]
+   * @param {{ info: (line: string) => void, warn?: (line: string) => void }} [params.logger]
+   */
+  constructor({ policy = {}, logger = null } = {}) {
+    this.#policy = { kind: "adaptive", ...policy };
+    this.#logger = logger;
+  }
+
+  /**
+   * Say that a resource exists and how to read what is free of it.
+   *
+   * @param {object} params
+   * @param {string} params.name
+   * @param {() => Promise<number | null> | number | null} params.readFree
+   * @returns {void}
+   */
+  defineResource({ name, readFree }) {
+    if (!this.#resources.has(name)) {
+      this.#resources.set(name, { readFree, otherDemand: new OtherDemand() });
+      return;
+    }
+    this.#resources.get(name).readFree = readFree;
+  }
+
+  /**
+   * Register something that holds bytes. Registering twice under one name
+   * replaces it.
+   *
+   * @param {Claimant} claimant
+   * @returns {void}
+   */
+  register(claimant) {
+    this.#claimants = this.#claimants.filter((one) => one.name !== claimant.name);
+    this.#claimants.push(claimant);
+  }
+
+  /**
+   * @param {string} name
+   * @returns {void}
+   */
+  forget(name) {
+    this.#claimants = this.#claimants.filter((one) => one.name !== name);
+  }
+
+  /**
+   * Read every resource, divide each, and tell each claimant its share.
+   *
+   * @returns {Promise<Map<string, { freeBytes: number, allowanceBytes: number, shares: object[] }>>}
+   */
+  async revise() {
+    for (const [name, resource] of this.#resources) {
+      const claimants = this.#claimants.filter((one) => one.resource === name);
+      if (claimants.length === 0) {
+        continue;
+      }
+      const held = claimants.reduce((sum, one) => sum + Math.max(0, one.held()), 0);
+      const free = await resource.readFree();
+      // WITHOUT A READING, NOTHING IS ALLOWED TO GROW. A resource whose free
+      // space cannot be read is not a resource with room; answering "unbounded"
+      // there is how the spill file came to have no limit in the first place.
+      const freeBytes = Number.isFinite(free) && free !== null ? Math.max(0, free) : 0;
+      const allowanceBytes = this.#allowanceFor(name, resource, freeBytes, held);
+      const shares = divideAllowance(claimants.map((one) => Math.max(0, one.wanted())), allowanceBytes);
+      const reading = claimants.map((one, position) => ({
+        name: one.name,
+        held: one.held(),
+        allowed: shares[position],
+        short: Number.isFinite(one.minimum) && shares[position] < one.minimum
+      }));
+      this.#last.set(name, { freeBytes, allowanceBytes, shares: reading });
+      for (const [position, one] of claimants.entries()) {
+        one.allow(shares[position]);
+      }
+      for (const share of reading.filter((one) => one.short)) {
+        // SAID, because a claimant working below what it needs is a fault of
+        // the machine and not of the code, and it is invisible otherwise.
+        this.#logger?.warn?.(
+          `budget: ${share.name} has ${megabytes(share.allowed)} of ${name}, ` +
+          `below the ${megabytes(claimants.find((one) => one.name === share.name)?.minimum ?? 0)} it needs`
+        );
+      }
+    }
+    this.#logger?.info?.(this.describe());
+    return this.#last;
+  }
+
+  /**
+   * What the policy allows of one resource.
+   *
+   * @param {string} name
+   * @param {{ otherDemand: OtherDemand }} resource
+   * @param {number} freeBytes
+   * @param {number} heldBytes
+   * @returns {number}
+   */
+  #allowanceFor(name, resource, freeBytes, heldBytes) {
+    // Noted whatever the policy, because the reading of what others need is a
+    // measurement of the machine and does not stop being true when the operator
+    // has named a number.
+    const reserve = resource.otherDemand.note(freeBytes, heldBytes);
+    const floor = Math.max(0, Number(this.#policy.floors?.[name]) || 0);
+    let allowance;
+    if (this.#policy.kind === "fixed") {
+      allowance = Math.max(0, Number(this.#policy.bytes) || 0);
+    } else if (this.#policy.kind === "share") {
+      const share = Math.min(1, Math.max(0, Number(this.#policy.share) || 0));
+      allowance = Math.floor((freeBytes + heldBytes) * share);
+    } else {
+      // What is free now, plus what we already hold, less what everything that
+      // is not us has recently been seen to need.
+      allowance = Math.max(0, freeBytes + heldBytes - reserve);
+    }
+    return Math.max(allowance, Math.min(floor, freeBytes + heldBytes));
+  }
+
+  /**
+   * One line per resource: what it has, what each claimant holds and may hold.
+   *
+   * @returns {string}
+   */
+  describe() {
+    if (this.#last.size === 0) {
+      return "budget: nothing has claimed anything yet";
+    }
+    const lines = [];
+    for (const [name, reading] of this.#last) {
+      const parts = reading.shares.map(
+        (share) => `${share.name} ${megabytes(share.held)} of ${megabytes(share.allowed)}${share.short ? " (short)" : ""}`
+      );
+      lines.push(`${name}: ${megabytes(reading.freeBytes)} free; ${parts.join(", ")}`);
+    }
+    return `budget — ${lines.join(" | ")}`;
+  }
+}
+
+/**
+ * @param {number} bytes
+ * @returns {string}
+ */
+function megabytes(bytes) {
+  return `${Math.round(Math.max(0, bytes) / (1024 * 1024))}MB`;
+}

package/services/{piece-store → storage}/allowance.js

@@ -1,107 +1,107 @@
-/**
- * @file How much of a machine's resource the stores may hold between them.
- *
- * Written once and used twice, because memory and disk are the same question
- * asked of two resources: what is free now, plus what we already hold, less
- * what everything that is not us has recently been seen to need.
- *
- * It used to exist only for memory, inside the memory store, keyed on module
- * state. Disk had no such rule at all — the spill file grew until the machine
- * did, 14.4 GB in a single viewing on 2026-08-31 — and copying the memory rule
- * across would have made two rules to keep in step. One rule, two readings.
- */
-
-/**
- * How many observations of other processes' demand are kept.
- *
- * A window rather than a high-water: a single spike would otherwise stand for
- * the life of the process and hold the stores down long after whatever caused
- * it had finished.
- */
-const OTHER_DEMAND_SAMPLES = 60;
-
-/**
- * What everything that is not us has recently been seen to need.
- *
- * One instance per resource. A fall in what is free that we did not cause is a
- * measurement of somebody else's demand; a fall we did cause is our own doing
- * and says nothing about the machine.
- */
-export class OtherDemand {
-  /** @type {number[]} */
-  #falls = [];
-
-  #lastFreeBytes = 0;
-
-  #lastHeldBytes = 0;
-
-  /**
-   * Take a reading, and answer what to reserve for others.
-   *
-   * @param {number} freeBytes - What the machine says is free now.
-   * @param {number} heldBytes - What the stores hold of this resource now.
-   * @returns {number} The reserve, in bytes.
-   */
-  note(freeBytes, heldBytes) {
-    if (this.#lastFreeBytes > 0) {
-      const fell = this.#lastFreeBytes - freeBytes;
-      const ours = heldBytes - this.#lastHeldBytes;
-      this.#falls.push(Math.max(0, fell - ours));
-      if (this.#falls.length > OTHER_DEMAND_SAMPLES) {
-        this.#falls.shift();
-      }
-    }
-    this.#lastFreeBytes = freeBytes;
-    this.#lastHeldBytes = heldBytes;
-    return this.reserve();
-  }
-
-  /** @returns {number} */
-  reserve() {
-    return this.#falls.length === 0 ? 0 : Math.max(...this.#falls);
-  }
-
-  /** Forget the readings. For tests, which share a module. */
-  forget() {
-    this.#falls = [];
-    this.#lastFreeBytes = 0;
-    this.#lastHeldBytes = 0;
-  }
-}
-
-/**
- * How much of the resource the stores may hold between them.
- *
- * What the machine reports free is what could be taken ON TOP of what is
- * already held, so the stores' own bytes are added back: the pair is the
- * ceiling the stores could reach.
- *
- * @param {number} freeBytes
- * @param {number} heldBytes
- * @param {number} reserveBytes
- * @returns {number}
- */
-export function machineAllowanceBytes(freeBytes, heldBytes, reserveBytes) {
-  return Math.max(0, Math.max(freeBytes, 0) + Math.max(heldBytes, 0) - Math.max(reserveBytes, 0));
-}
-
-/**
- * Divide what the machine allows between the stores, by what each is asking
- * for.
- *
- * When everyone's ask fits, everyone gets it and the machine's limit never
- * binds. When the asks do not fit, each store is cut in proportion to what it
- * asked, so a store wanting little is not cut to make room for one wanting
- * much.
- *
- * @param {number[]} wantedBytes - What each store is asking for, in order.
- * @param {number} allowanceBytes
- * @returns {number[]} What each store may hold, in the same order.
- */
-export function divideAllowance(wantedBytes, allowanceBytes) {
-  const total = wantedBytes.reduce((sum, want) => sum + Math.max(0, want), 0);
-  if (total <= allowanceBytes || total === 0) {
-    return wantedBytes.map((want) => Math.max(0, want));
-  }
-  return wantedBytes.map((want) => Math.floor(allowanceBytes * (Math.max(0, want) / total)));
-}
+/**
+ * @file How much of a machine's resource the stores may hold between them.
+ *
+ * Written once and used twice, because memory and disk are the same question
+ * asked of two resources: what is free now, plus what we already hold, less
+ * what everything that is not us has recently been seen to need.
+ *
+ * It used to exist only for memory, inside the memory store, keyed on module
+ * state. Disk had no such rule at all — the spill file grew until the machine
+ * did, 14.4 GB in a single viewing on 2026-08-31 — and copying the memory rule
+ * across would have made two rules to keep in step. One rule, two readings.
+ */
+
+/**
+ * How many observations of other processes' demand are kept.
+ *
+ * A window rather than a high-water: a single spike would otherwise stand for
+ * the life of the process and hold the stores down long after whatever caused
+ * it had finished.
+ */
+const OTHER_DEMAND_SAMPLES = 60;
+
+/**
+ * What everything that is not us has recently been seen to need.
+ *
+ * One instance per resource. A fall in what is free that we did not cause is a
+ * measurement of somebody else's demand; a fall we did cause is our own doing
+ * and says nothing about the machine.
+ */
+export class OtherDemand {
+  /** @type {number[]} */
+  #falls = [];
+
+  #lastFreeBytes = 0;
+
+  #lastHeldBytes = 0;
+
+  /**
+   * Take a reading, and answer what to reserve for others.
+   *
+   * @param {number} freeBytes - What the machine says is free now.
+   * @param {number} heldBytes - What the stores hold of this resource now.
+   * @returns {number} The reserve, in bytes.
+   */
+  note(freeBytes, heldBytes) {
+    if (this.#lastFreeBytes > 0) {
+      const fell = this.#lastFreeBytes - freeBytes;
+      const ours = heldBytes - this.#lastHeldBytes;
+      this.#falls.push(Math.max(0, fell - ours));
+      if (this.#falls.length > OTHER_DEMAND_SAMPLES) {
+        this.#falls.shift();
+      }
+    }
+    this.#lastFreeBytes = freeBytes;
+    this.#lastHeldBytes = heldBytes;
+    return this.reserve();
+  }
+
+  /** @returns {number} */
+  reserve() {
+    return this.#falls.length === 0 ? 0 : Math.max(...this.#falls);
+  }
+
+  /** Forget the readings. For tests, which share a module. */
+  forget() {
+    this.#falls = [];
+    this.#lastFreeBytes = 0;
+    this.#lastHeldBytes = 0;
+  }
+}
+
+/**
+ * How much of the resource the stores may hold between them.
+ *
+ * What the machine reports free is what could be taken ON TOP of what is
+ * already held, so the stores' own bytes are added back: the pair is the
+ * ceiling the stores could reach.
+ *
+ * @param {number} freeBytes
+ * @param {number} heldBytes
+ * @param {number} reserveBytes
+ * @returns {number}
+ */
+export function machineAllowanceBytes(freeBytes, heldBytes, reserveBytes) {
+  return Math.max(0, Math.max(freeBytes, 0) + Math.max(heldBytes, 0) - Math.max(reserveBytes, 0));
+}
+
+/**
+ * Divide what the machine allows between the stores, by what each is asking
+ * for.
+ *
+ * When everyone's ask fits, everyone gets it and the machine's limit never
+ * binds. When the asks do not fit, each store is cut in proportion to what it
+ * asked, so a store wanting little is not cut to make room for one wanting
+ * much.
+ *
+ * @param {number[]} wantedBytes - What each store is asking for, in order.
+ * @param {number} allowanceBytes
+ * @returns {number[]} What each store may hold, in the same order.
+ */
+export function divideAllowance(wantedBytes, allowanceBytes) {
+  const total = wantedBytes.reduce((sum, want) => sum + Math.max(0, want), 0);
+  if (total <= allowanceBytes || total === 0) {
+    return wantedBytes.map((want) => Math.max(0, want));
+  }
+  return wantedBytes.map((want) => Math.floor(allowanceBytes * (Math.max(0, want) / total)));
+}

package/services/{core-dumps.js → storage/core-dumps.js}

@@ -14,7 +14,7 @@
 import { readdir, rm, stat } from "node:fs/promises";
 import path from "node:path";
 
-import { logger } from "../utils/logger.js";
+import { logger } from "../../utils/logger.js";
 
 /** How many to keep, newest first. */
 export const CORE_DUMPS_KEPT = 2;