@torrent-tv/proxy 2.88.2 → 2.88.4

package/services/encode/start-stop-cost.js

@@ -1,178 +1,178 @@
-/**
- * @file What starting and stopping an encoder costs on THIS host, measured
- * before any viewer exists.
- *
- * WHY IT HAS TO BE MEASURED AT STARTUP. Both figures decide one thing: whether
- * to leave an encoder where it stands or kill it and start another elsewhere.
- * The plan compares when the wanted pieces appear under each arrangement, and
- * for that it needs how long a fresh encoder takes to produce anything and how
- * long killing one takes.
- *
- * Until now both were learned only from runs that had ENDED, so at a cold open
- * they were zero — and zero does not read as "not measured", it reads as
- * "free". A warming encoder then owed one piece and a moved one owed
- * `0 + 0 + one piece`: the same figure to the millisecond. The tie fell to
- * position, so any advantage however small won, and the plan moved the encoder
- * on every pass. Field 2026-09-08, the first fifteen seconds of a session:
- * start at #68, a second later kill and start at #69, half a second later kill
- * and start at #68 again, each dying having produced nothing. Over two days,
- * 153 runs stopped that way and 68 of them made no segment at all.
- *
- * ONE RUN GIVES BOTH READINGS. An encoder is started on a generated picture
- * through the same pipeline a session uses, timed until it says it has closed
- * its first piece, then killed and timed until it exits. Nothing about the
- * measurement is chosen: it is the same encoder, the same muxer, the same
- * channel the encoder announces finished pieces on.
- */
-
-import { spawn } from "node:child_process";
-import { mkdtempSync, rmSync } from "node:fs";
-import os from "node:os";
-import path from "node:path";
-
-/**
- * How long the measurement may take before it is abandoned.
- *
- * Not a property of the host and not a figure anything is derived from: it
- * bounds a startup step so a machine that cannot produce a piece at all does not
- * hold the proxy closed. A host that hits it has said something useful — that
- * its first piece takes longer than this — and the plan is told the bound rather
- * than a zero.
- */
-const GIVE_UP_AFTER_MS = 30_000;
-
-/**
- * Measure a start and a stop on this host.
- *
- * @param {object} params
- * @param {string} params.ffmpegBin
- * @param {import("./Encoder.js").Encoder} params.encoder - The encoder this
- *   proxy has chosen, so the reading is of the thing that will actually run.
- * @param {number} [params.segmentDurationSec]
- * @param {{ info: Function, warn: Function }} [params.logger]
- * @param {() => number} [params.now]
- * @returns {Promise<{ firstByteWaitSec: number, killCostSec: number } | null>}
- *   Null where nothing could be measured, which is said rather than passed off
- *   as a zero.
- */
-export async function measureStartAndStop({
-  ffmpegBin,
-  encoder,
-  segmentDurationSec = 4,
-  logger = null,
-  now = Date.now
-}) {
-  const log = logger ?? { info: () => {}, warn: () => {} };
-  const dir = mkdtempSync(path.join(os.tmpdir(), "tt-startstop-"));
-  try {
-    const args = [
-      "-hide_banner",
-      "-nostats",
-      "-loglevel",
-      "error",
-      // The device, where the kind takes one.
-      ...(typeof encoder?.benchmarkInputArgs === "function" ? encoder.benchmarkInputArgs() : []),
-      // A generated picture: the reading is of this host's encoder and muxer,
-      // and a file would add its own reading and its own download.
-      "-f",
-      "lavfi",
-      "-i",
-      `testsrc2=size=640x360:rate=25`,
-      "-t",
-      String(segmentDurationSec * 4),
-      // The encoder this proxy has chosen, asked for its own arguments: the
-      // reading must be of the thing that will actually run, since what a start
-      // costs is mostly the encoder opening.
-      // The same arguments the throughput benchmark uses, for the same reason:
-      // a start is timed on the encoder itself, not on a scaler in front of it.
-      ...(typeof encoder?.benchmarkArgs === "function"
-        ? encoder.benchmarkArgs(null)
-        : ["-c:v", "libx264", "-preset", "ultrafast"]),
-      "-an",
-      "-f",
-      "segment",
-      "-segment_time",
-      String(segmentDurationSec),
-      // The channel the encoder names its finished pieces on — the same one a
-      // session reads, so "the first piece exists" means here what it means
-      // there.
-      "-segment_list",
-      "pipe:3",
-      "-segment_list_flags",
-      "+live",
-      "-segment_format",
-      "mp4",
-      path.join(dir, "seg-%05d.mp4")
-    ];
-
-    const spawnedAt = now();
-    const child = spawn(ffmpegBin, args, {
-      stdio: ["ignore", "ignore", "pipe", "pipe"],
-      windowsHide: true
-    });
-
-    const firstPiece = await new Promise((resolve) => {
-      const timer = setTimeout(() => resolve(null), GIVE_UP_AFTER_MS);
-      timer.unref?.();
-      child.stdio?.[3]?.on("data", () => {
-        clearTimeout(timer);
-        resolve(now() - spawnedAt);
-      });
-      child.on("error", () => {
-        clearTimeout(timer);
-        resolve(null);
-      });
-      child.on("exit", () => {
-        clearTimeout(timer);
-        resolve(null);
-      });
-    });
-
-    if (firstPiece === null) {
-      try {
-        child.kill("SIGKILL");
-      } catch {
-        // Already gone.
-      }
-      log.warn("hwaccel: a start could not be measured; the plan is told so rather than told zero");
-      return null;
-    }
-
-    const killedAt = now();
-    const died = await new Promise((resolve) => {
-      const timer = setTimeout(() => resolve(null), GIVE_UP_AFTER_MS);
-      timer.unref?.();
-      child.on("exit", () => {
-        clearTimeout(timer);
-        resolve(now() - killedAt);
-      });
-      try {
-        child.kill("SIGTERM");
-      } catch {
-        clearTimeout(timer);
-        resolve(null);
-      }
-    });
-
-    const firstByteWaitSec = firstPiece / 1000;
-    const killCostSec = died === null ? 0 : died / 1000;
-    log.info(
-      `hwaccel: a start costs ${firstByteWaitSec.toFixed(2)}s to a first piece and ` +
-      `a stop ${killCostSec.toFixed(2)}s on this host — measured before any viewer, ` +
-      "because a plan told zero reads it as free and moves an encoder for nothing"
-    );
-    return { firstByteWaitSec, killCostSec };
-  } catch (error) {
-    log.warn(
-      `hwaccel: a start and a stop could not be measured: ` +
-      `${error instanceof Error ? error.message : String(error)}`
-    );
-    return null;
-  } finally {
-    try {
-      rmSync(dir, { recursive: true, force: true });
-    } catch {
-      // best effort
-    }
-  }
-}
+/**
+ * @file What starting and stopping an encoder costs on THIS host, measured
+ * before any viewer exists.
+ *
+ * WHY IT HAS TO BE MEASURED AT STARTUP. Both figures decide one thing: whether
+ * to leave an encoder where it stands or kill it and start another elsewhere.
+ * The plan compares when the wanted pieces appear under each arrangement, and
+ * for that it needs how long a fresh encoder takes to produce anything and how
+ * long killing one takes.
+ *
+ * Until now both were learned only from runs that had ENDED, so at a cold open
+ * they were zero — and zero does not read as "not measured", it reads as
+ * "free". A warming encoder then owed one piece and a moved one owed
+ * `0 + 0 + one piece`: the same figure to the millisecond. The tie fell to
+ * position, so any advantage however small won, and the plan moved the encoder
+ * on every pass. Field 2026-09-08, the first fifteen seconds of a session:
+ * start at #68, a second later kill and start at #69, half a second later kill
+ * and start at #68 again, each dying having produced nothing. Over two days,
+ * 153 runs stopped that way and 68 of them made no segment at all.
+ *
+ * ONE RUN GIVES BOTH READINGS. An encoder is started on a generated picture
+ * through the same pipeline a session uses, timed until it says it has closed
+ * its first piece, then killed and timed until it exits. Nothing about the
+ * measurement is chosen: it is the same encoder, the same muxer, the same
+ * channel the encoder announces finished pieces on.
+ */
+
+import { spawn } from "node:child_process";
+import { mkdtempSync, rmSync } from "node:fs";
+import os from "node:os";
+import path from "node:path";
+
+/**
+ * How long the measurement may take before it is abandoned.
+ *
+ * Not a property of the host and not a figure anything is derived from: it
+ * bounds a startup step so a machine that cannot produce a piece at all does not
+ * hold the proxy closed. A host that hits it has said something useful — that
+ * its first piece takes longer than this — and the plan is told the bound rather
+ * than a zero.
+ */
+const GIVE_UP_AFTER_MS = 30_000;
+
+/**
+ * Measure a start and a stop on this host.
+ *
+ * @param {object} params
+ * @param {string} params.ffmpegBin
+ * @param {import("./Encoder.js").Encoder} params.encoder - The encoder this
+ *   proxy has chosen, so the reading is of the thing that will actually run.
+ * @param {number} [params.segmentDurationSec]
+ * @param {{ info: Function, warn: Function }} [params.logger]
+ * @param {() => number} [params.now]
+ * @returns {Promise<{ firstByteWaitSec: number, killCostSec: number } | null>}
+ *   Null where nothing could be measured, which is said rather than passed off
+ *   as a zero.
+ */
+export async function measureStartAndStop({
+  ffmpegBin,
+  encoder,
+  segmentDurationSec = 4,
+  logger = null,
+  now = Date.now
+}) {
+  const log = logger ?? { info: () => {}, warn: () => {} };
+  const dir = mkdtempSync(path.join(os.tmpdir(), "tt-startstop-"));
+  try {
+    const args = [
+      "-hide_banner",
+      "-nostats",
+      "-loglevel",
+      "error",
+      // The device, where the kind takes one.
+      ...(typeof encoder?.benchmarkInputArgs === "function" ? encoder.benchmarkInputArgs() : []),
+      // A generated picture: the reading is of this host's encoder and muxer,
+      // and a file would add its own reading and its own download.
+      "-f",
+      "lavfi",
+      "-i",
+      `testsrc2=size=640x360:rate=25`,
+      "-t",
+      String(segmentDurationSec * 4),
+      // The encoder this proxy has chosen, asked for its own arguments: the
+      // reading must be of the thing that will actually run, since what a start
+      // costs is mostly the encoder opening.
+      // The same arguments the throughput benchmark uses, for the same reason:
+      // a start is timed on the encoder itself, not on a scaler in front of it.
+      ...(typeof encoder?.benchmarkArgs === "function"
+        ? encoder.benchmarkArgs(null)
+        : ["-c:v", "libx264", "-preset", "ultrafast"]),
+      "-an",
+      "-f",
+      "segment",
+      "-segment_time",
+      String(segmentDurationSec),
+      // The channel the encoder names its finished pieces on — the same one a
+      // session reads, so "the first piece exists" means here what it means
+      // there.
+      "-segment_list",
+      "pipe:3",
+      "-segment_list_flags",
+      "+live",
+      "-segment_format",
+      "mp4",
+      path.join(dir, "seg-%05d.mp4")
+    ];
+
+    const spawnedAt = now();
+    const child = spawn(ffmpegBin, args, {
+      stdio: ["ignore", "ignore", "pipe", "pipe"],
+      windowsHide: true
+    });
+
+    const firstPiece = await new Promise((resolve) => {
+      const timer = setTimeout(() => resolve(null), GIVE_UP_AFTER_MS);
+      timer.unref?.();
+      child.stdio?.[3]?.on("data", () => {
+        clearTimeout(timer);
+        resolve(now() - spawnedAt);
+      });
+      child.on("error", () => {
+        clearTimeout(timer);
+        resolve(null);
+      });
+      child.on("exit", () => {
+        clearTimeout(timer);
+        resolve(null);
+      });
+    });
+
+    if (firstPiece === null) {
+      try {
+        child.kill("SIGKILL");
+      } catch {
+        // Already gone.
+      }
+      log.warn("hwaccel: a start could not be measured; the plan is told so rather than told zero");
+      return null;
+    }
+
+    const killedAt = now();
+    const died = await new Promise((resolve) => {
+      const timer = setTimeout(() => resolve(null), GIVE_UP_AFTER_MS);
+      timer.unref?.();
+      child.on("exit", () => {
+        clearTimeout(timer);
+        resolve(now() - killedAt);
+      });
+      try {
+        child.kill("SIGTERM");
+      } catch {
+        clearTimeout(timer);
+        resolve(null);
+      }
+    });
+
+    const firstByteWaitSec = firstPiece / 1000;
+    const killCostSec = died === null ? 0 : died / 1000;
+    log.info(
+      `hwaccel: a start costs ${firstByteWaitSec.toFixed(2)}s to a first piece and ` +
+      `a stop ${killCostSec.toFixed(2)}s on this host — measured before any viewer, ` +
+      "because a plan told zero reads it as free and moves an encoder for nothing"
+    );
+    return { firstByteWaitSec, killCostSec };
+  } catch (error) {
+    log.warn(
+      `hwaccel: a start and a stop could not be measured: ` +
+      `${error instanceof Error ? error.message : String(error)}`
+    );
+    return null;
+  } finally {
+    try {
+      rmSync(dir, { recursive: true, force: true });
+    } catch {
+      // best effort
+    }
+  }
+}

package/services/encode/throughput.js

@@ -1,97 +1,97 @@
-/**
- * @file How fast a calibrated encoding mode runs at a given frame size, from
- * the readings the startup calibration took (`encode/calibration.js`).
- *
- * Pure arithmetic over measured figures, kept apart from the calibration so
- * that everything which prices an encode can read it without reaching the code
- * that runs ffmpeg.
- */
-
-/**
- * @typedef {object} SizeReading
- * @property {number} width
- * @property {number} height
- * @property {number} pixelsPerSec
- */
-
-/**
- * The rate of pictures this mode would encode at this frame, in pixels per
- * second, or null where this machine has not shown it can.
- *
- * An entry with no readings by size — built before sizes were read, or by a
- * check that states one figure — answers with its one figure, as it always did.
- *
- * @param {{ pixelsPerSec: number, bySize?: SizeReading[], interpolationError?: number | null }} entry
- * @param {{ width: number, height: number } | null | undefined} frame
- * @returns {number | null}
- */
-export function throughputAt(entry, frame) {
-  const bySize = Array.isArray(entry?.bySize) ? entry.bySize : [];
-  const width = Number(frame?.width) || 0;
-  const height = Number(frame?.height) || 0;
-  if (bySize.length === 0 || width <= 0 || height <= 0) {
-    const figure = Number(entry?.pixelsPerSec);
-    return Number.isFinite(figure) && figure > 0 ? figure : null;
-  }
-  const area = width * height;
-  const sorted = [...bySize].sort((left, right) => left.width * left.height - right.width * right.height);
-  const smallest = sorted[0];
-  const largest = sorted[sorted.length - 1];
-  if (area < smallest.width * smallest.height || area > largest.width * largest.height) {
-    return null;
-  }
-  for (let index = 0; index < sorted.length; index += 1) {
-    const reading = sorted[index];
-    const readArea = reading.width * reading.height;
-    if (readArea === area) {
-      return reading.pixelsPerSec;
-    }
-    if (readArea > area) {
-      const error = entry.interpolationError;
-      if (!(Number.isFinite(error) && error >= 0 && error < 1)) {
-        return null;
-      }
-      const below = sorted[index - 1];
-      return interpolate(below, reading, area) * (1 - error);
-    }
-  }
-  return null;
-}
-
-/**
- * Pixels per second at an area between two readings, straight in logarithms
- * of both: throughput against frame area is a power law over any short
- * stretch, and a straight line between two points of it is the least that
- * can be said without inventing a shape.
- *
- * @param {SizeReading} below
- * @param {SizeReading} above
- * @param {number} area
- * @returns {number}
- */
-function interpolate(below, above, area) {
-  const lowArea = below.width * below.height;
-  const highArea = above.width * above.height;
-  const share = Math.log(area / lowArea) / Math.log(highArea / lowArea);
-  return Math.exp(Math.log(below.pixelsPerSec) + share * (Math.log(above.pixelsPerSec) - Math.log(below.pixelsPerSec)));
-}
-
-/**
- * How far an interpolation between readings of this mode was measured to be
- * wrong: the largest relative error of a middle reading predicted from the two
- * outside it.
- *
- * @param {SizeReading[]} bySize - Smallest first.
- * @returns {number | null} Null with fewer than three readings.
- */
-export function interpolationErrorOf(bySize) {
-  let largest = null;
-  for (let index = 1; index + 1 < bySize.length; index += 1) {
-    const middle = bySize[index];
-    const predicted = interpolate(bySize[index - 1], bySize[index + 1], middle.width * middle.height);
-    const error = Math.abs(predicted - middle.pixelsPerSec) / middle.pixelsPerSec;
-    largest = largest === null ? error : Math.max(largest, error);
-  }
-  return largest;
-}
-
+/**
+ * @file How fast a calibrated encoding mode runs at a given frame size, from
+ * the readings the startup calibration took (`encode/calibration.js`).
+ *
+ * Pure arithmetic over measured figures, kept apart from the calibration so
+ * that everything which prices an encode can read it without reaching the code
+ * that runs ffmpeg.
+ */
+
+/**
+ * @typedef {object} SizeReading
+ * @property {number} width
+ * @property {number} height
+ * @property {number} pixelsPerSec
+ */
+
+/**
+ * The rate of pictures this mode would encode at this frame, in pixels per
+ * second, or null where this machine has not shown it can.
+ *
+ * An entry with no readings by size — built before sizes were read, or by a
+ * check that states one figure — answers with its one figure, as it always did.
+ *
+ * @param {{ pixelsPerSec: number, bySize?: SizeReading[], interpolationError?: number | null }} entry
+ * @param {{ width: number, height: number } | null | undefined} frame
+ * @returns {number | null}
+ */
+export function throughputAt(entry, frame) {
+  const bySize = Array.isArray(entry?.bySize) ? entry.bySize : [];
+  const width = Number(frame?.width) || 0;
+  const height = Number(frame?.height) || 0;
+  if (bySize.length === 0 || width <= 0 || height <= 0) {
+    const figure = Number(entry?.pixelsPerSec);
+    return Number.isFinite(figure) && figure > 0 ? figure : null;
+  }
+  const area = width * height;
+  const sorted = [...bySize].sort((left, right) => left.width * left.height - right.width * right.height);
+  const smallest = sorted[0];
+  const largest = sorted[sorted.length - 1];
+  if (area < smallest.width * smallest.height || area > largest.width * largest.height) {
+    return null;
+  }
+  for (let index = 0; index < sorted.length; index += 1) {
+    const reading = sorted[index];
+    const readArea = reading.width * reading.height;
+    if (readArea === area) {
+      return reading.pixelsPerSec;
+    }
+    if (readArea > area) {
+      const error = entry.interpolationError;
+      if (!(Number.isFinite(error) && error >= 0 && error < 1)) {
+        return null;
+      }
+      const below = sorted[index - 1];
+      return interpolate(below, reading, area) * (1 - error);
+    }
+  }
+  return null;
+}
+
+/**
+ * Pixels per second at an area between two readings, straight in logarithms
+ * of both: throughput against frame area is a power law over any short
+ * stretch, and a straight line between two points of it is the least that
+ * can be said without inventing a shape.
+ *
+ * @param {SizeReading} below
+ * @param {SizeReading} above
+ * @param {number} area
+ * @returns {number}
+ */
+function interpolate(below, above, area) {
+  const lowArea = below.width * below.height;
+  const highArea = above.width * above.height;
+  const share = Math.log(area / lowArea) / Math.log(highArea / lowArea);
+  return Math.exp(Math.log(below.pixelsPerSec) + share * (Math.log(above.pixelsPerSec) - Math.log(below.pixelsPerSec)));
+}
+
+/**
+ * How far an interpolation between readings of this mode was measured to be
+ * wrong: the largest relative error of a middle reading predicted from the two
+ * outside it.
+ *
+ * @param {SizeReading[]} bySize - Smallest first.
+ * @returns {number | null} Null with fewer than three readings.
+ */
+export function interpolationErrorOf(bySize) {
+  let largest = null;
+  for (let index = 1; index + 1 < bySize.length; index += 1) {
+    const middle = bySize[index];
+    const predicted = interpolate(bySize[index - 1], bySize[index + 1], middle.width * middle.height);
+    const error = Math.abs(predicted - middle.pixelsPerSec) / middle.pixelsPerSec;
+    largest = largest === null ? error : Math.max(largest, error);
+  }
+  return largest;
+}
+