@torrent-tv/proxy 2.80.18 → 2.81.0

package/test/coverage-map.test.js

@@ -1,195 +1,195 @@
-/**
- * @file The three states of a segment number, and the two questions that decide
- * where an encoder goes.
- */
-
-import test from "node:test";
-import assert from "node:assert/strict";
-import { CoverageMap } from "../services/encode/CoverageMap.js";
-
-/**
- * A stand-in for a run.
- *
- * The map files a claim under the run ITSELF: a run has no name, and needs
- * none — what identifies it is that it is itself, and what identifies it in a
- * line is the stretch it was given, which no other live run of one output can
- * hold.
- *
- * @returns {object}
- */
-function aRun() {
-  return {};
-}
-
-test("a number nobody has made and nobody is making is free", () => {
-  const map = new CoverageMap({ segmentCount: 10 });
-  assert.equal(map.stateOf(3), "free");
-  assert.equal(map.firstGapFrom(0), 0);
-});
-
-test("a closed file is ready whoever made it", () => {
-  const map = new CoverageMap({ segmentCount: 10 });
-  map.markReady(0);
-  map.markReady(1);
-  assert.equal(map.stateOf(1), "ready");
-  assert.equal(map.firstGapFrom(0), 2);
-});
-
-test("a run claims a stretch, and the gap search skips it", () => {
-  // The claim is an interval and not a head, which is the whole reason two runs
-  // can work on one output: the second is sent past what the first will reach.
-  const map = new CoverageMap({ segmentCount: 100 });
-  const runA = aRun();
-  map.claim(runA, 0, 40);
-  assert.equal(map.stateOf(20), "making");
-  assert.equal(map.makerOf(20), runA);
-  assert.equal(map.firstGapFrom(0), 41);
-});
-
-test("a run that ends gives back what it did not finish, and keeps what it did", () => {
-  const map = new CoverageMap({ segmentCount: 100 });
-  const runA = aRun();
-  map.claim(runA, 0, 40);
-  map.markReady(0);
-  map.markReady(1);
-  map.release(runA);
-  assert.equal(map.stateOf(0), "ready", "a closed file survives its maker");
-  assert.equal(map.stateOf(2), "free", "the rest of the stretch is free again");
-  assert.equal(map.firstGapFrom(0), 2);
-});
-
-test("a run with no end claims everything ahead of it", () => {
-  // Which is what every run was before ends existed, and is why a second run
-  // could never be placed.
-  const map = new CoverageMap({ segmentCount: 100 });
-  const runA = aRun();
-  map.claim(runA, 10, Number.POSITIVE_INFINITY);
-  assert.equal(map.firstGapFrom(10), null);
-  assert.equal(map.firstGapFrom(0), 0, "behind it is still free");
-});
-
-test("claiming again replaces the earlier claim rather than adding to it", () => {
-  // A run moved forward past ready material states its new stretch; if the two
-  // accumulated, the ground it has left would stay unavailable for ever.
-  const map = new CoverageMap({ segmentCount: 100 });
-  const runA = aRun();
-  map.claim(runA, 0, 20);
-  map.claim(runA, 50, 70);
-  assert.equal(map.stateOf(10), "free");
-  assert.equal(map.stateOf(60), "making");
-});
-
-test("the covered stretch ahead is measured, which is what prices a move", () => {
-  const map = new CoverageMap({ segmentCount: 100 });
-  const runA = aRun();
-  const runB = aRun();
-  for (let index = 10; index <= 24; index += 1) {
-    map.markReady(index);
-  }
-  map.claim(runB, 25, 30);
-  // Ready 10..24 then another run's 25..30, so fifteen plus six.
-  assert.equal(map.coveredRunFrom(10, runA), 21);
-  assert.equal(map.firstGapFrom(10), 31);
-});
-
-test("a run's own claim is not counted as somebody else's coverage", () => {
-  // Otherwise a run would read its own stretch as a reason to move off it.
-  const map = new CoverageMap({ segmentCount: 100 });
-  const runA = aRun();
-  map.claim(runA, 10, 30);
-  assert.equal(map.coveredRunFrom(10, runA), 0);
-});
-
-test("nothing free ahead answers null rather than a number past the end", () => {
-  const map = new CoverageMap({ segmentCount: 5 });
-  map.setReady([0, 1, 2, 3, 4]);
-  assert.equal(map.firstGapFrom(0), null);
-});
-
-test("a file that has gone stops being ready", () => {
-  // THE CHECK THE FIELD FAILURE OF 2026-09-07 NEEDED. Readiness used to
-  // accumulate: a number told once stayed ready for the life of the process
-  // however its file ended, so the map claimed a whole film that was not there,
-  // the plan scored every arrangement as perfect and took the only encoder away.
-  const map = new CoverageMap({ segmentCount: 10 });
-  map.setReady([3, 4]);
-  assert.equal(map.stateOf(4), "ready");
-  map.setReady([3]);
-  assert.equal(map.stateOf(4), "free", "the picture is replaced, not added to");
-  assert.equal(map.stateOf(3), "ready", "and what is still there stays");
-});
-
-test("the whole picture is replaced, so nothing survives that the disk has lost", () => {
-  const map = new CoverageMap({ segmentCount: 500 });
-  for (let index = 0; index < 500; index += 1) {
-    map.markReady(index);
-  }
-  assert.equal(map.stats().ready, 500);
-  map.setReady([]);
-  assert.equal(map.stats().ready, 0, "an empty directory is an empty map");
-  assert.equal(map.firstGapFrom(0), 0, "and the first gap is the beginning again");
-});
-
-test("a run's own claim does not hide the gap it is trying to move into", () => {
-  // Found by the plan's own checks: a run that had claimed the rest of the film
-  // — which is what every run did before ends existed — could find no gap
-  // anywhere, so it was stopped instead of moved.
-  const map = new CoverageMap({ segmentCount: 100 });
-  const runA = aRun();
-  map.claim(runA, 0, 99);
-  map.setReady([10, 11, 12]);
-  assert.equal(map.firstGapFrom(10, 90), null, "to anybody else its ground is taken");
-  assert.equal(map.firstGapFrom(10, 90, runA), 13, "to itself the ground beyond is a gap");
-});
-
-test("the free stretch ahead is measured, which is what gives a run its end", () => {
-  // A run handed the whole rest of the film would drive through the stretch
-  // another run is making. Handed the free stretch, it stops where the covered
-  // material begins.
-  const map = new CoverageMap({ segmentCount: 100 });
-  const runB = aRun();
-  map.claim(runB, 30, 60);
-  assert.equal(map.freeRunFrom(10), 20, "free from 10 up to 29");
-  map.markReady(15);
-  assert.equal(map.freeRunFrom(10), 5, "a ready segment ends the free stretch too");
-  assert.equal(map.freeRunFrom(15), 0, "a number that is not free has no free stretch");
-});
-
-test("a run's own claim does not end its own free stretch", () => {
-  const map = new CoverageMap({ segmentCount: 100 });
-  const runA = aRun();
-  map.claim(runA, 10, 40);
-  assert.equal(map.freeRunFrom(10, runA), 90, "its own ground is still its to fill");
-  assert.equal(map.freeRunFrom(10), 0, "to anybody else it is taken");
-});
-
-test("with the length unknown, a gap search needs its own bound", () => {
-  const map = new CoverageMap();
-  assert.equal(map.firstGapFrom(0), null, "no length and no bound answers nothing");
-  assert.equal(map.firstGapFrom(0, 3), 0);
-});
-
-test("with the length unknown, the free stretch is answered without walking to it", () => {
-  // What this pins: on the addon host, 2026-09-05, a map with no length walked
-  // one number at a time to MAX_SAFE_INTEGER, scanning every claim at each step.
-  // The main thread spun at 100% from the look-ahead timer and the proxy stopped
-  // answering anything, its own log included. The length was missing because the
-  // field naming it had moved to the timeline and three readers were left on the
-  // old name — but this walk must not be able to do that even when it is.
-  //
-  // This check cannot FAIL against the old code — a synchronous walk cannot be
-  // interrupted by the runner, so it would hang the whole run instead, which is
-  // worse than no check. What it pins is the contract that replaced the walk:
-  // the answer comes from what the map holds.
-  const map = new CoverageMap();
-
-  assert.equal(map.freeRunFrom(0), Number.POSITIVE_INFINITY, "nothing is covered, so nothing bounds it");
-
-  const run = aRun();
-  map.claim(run, 500, 900);
-  assert.equal(map.freeRunFrom(0), 500, "and a claim ahead is where the free stretch ends");
-  assert.equal(map.freeRunFrom(0, run), Number.POSITIVE_INFINITY, "its own claim does not bound it");
-
-  map.markReady(200);
-  assert.equal(map.freeRunFrom(0), 200, "so is a segment somebody has already made");
-});
+/**
+ * @file The three states of a segment number, and the two questions that decide
+ * where an encoder goes.
+ */
+
+import test from "node:test";
+import assert from "node:assert/strict";
+import { CoverageMap } from "../services/encode/CoverageMap.js";
+
+/**
+ * A stand-in for a run.
+ *
+ * The map files a claim under the run ITSELF: a run has no name, and needs
+ * none — what identifies it is that it is itself, and what identifies it in a
+ * line is the stretch it was given, which no other live run of one output can
+ * hold.
+ *
+ * @returns {object}
+ */
+function aRun() {
+  return {};
+}
+
+test("a number nobody has made and nobody is making is free", () => {
+  const map = new CoverageMap({ segmentCount: 10 });
+  assert.equal(map.stateOf(3), "free");
+  assert.equal(map.firstGapFrom(0), 0);
+});
+
+test("a closed file is ready whoever made it", () => {
+  const map = new CoverageMap({ segmentCount: 10 });
+  map.markReady(0);
+  map.markReady(1);
+  assert.equal(map.stateOf(1), "ready");
+  assert.equal(map.firstGapFrom(0), 2);
+});
+
+test("a run claims a stretch, and the gap search skips it", () => {
+  // The claim is an interval and not a head, which is the whole reason two runs
+  // can work on one output: the second is sent past what the first will reach.
+  const map = new CoverageMap({ segmentCount: 100 });
+  const runA = aRun();
+  map.claim(runA, 0, 40);
+  assert.equal(map.stateOf(20), "making");
+  assert.equal(map.makerOf(20), runA);
+  assert.equal(map.firstGapFrom(0), 41);
+});
+
+test("a run that ends gives back what it did not finish, and keeps what it did", () => {
+  const map = new CoverageMap({ segmentCount: 100 });
+  const runA = aRun();
+  map.claim(runA, 0, 40);
+  map.markReady(0);
+  map.markReady(1);
+  map.release(runA);
+  assert.equal(map.stateOf(0), "ready", "a closed file survives its maker");
+  assert.equal(map.stateOf(2), "free", "the rest of the stretch is free again");
+  assert.equal(map.firstGapFrom(0), 2);
+});
+
+test("a run with no end claims everything ahead of it", () => {
+  // Which is what every run was before ends existed, and is why a second run
+  // could never be placed.
+  const map = new CoverageMap({ segmentCount: 100 });
+  const runA = aRun();
+  map.claim(runA, 10, Number.POSITIVE_INFINITY);
+  assert.equal(map.firstGapFrom(10), null);
+  assert.equal(map.firstGapFrom(0), 0, "behind it is still free");
+});
+
+test("claiming again replaces the earlier claim rather than adding to it", () => {
+  // A run moved forward past ready material states its new stretch; if the two
+  // accumulated, the ground it has left would stay unavailable for ever.
+  const map = new CoverageMap({ segmentCount: 100 });
+  const runA = aRun();
+  map.claim(runA, 0, 20);
+  map.claim(runA, 50, 70);
+  assert.equal(map.stateOf(10), "free");
+  assert.equal(map.stateOf(60), "making");
+});
+
+test("the covered stretch ahead is measured, which is what prices a move", () => {
+  const map = new CoverageMap({ segmentCount: 100 });
+  const runA = aRun();
+  const runB = aRun();
+  for (let index = 10; index <= 24; index += 1) {
+    map.markReady(index);
+  }
+  map.claim(runB, 25, 30);
+  // Ready 10..24 then another run's 25..30, so fifteen plus six.
+  assert.equal(map.coveredRunFrom(10, runA), 21);
+  assert.equal(map.firstGapFrom(10), 31);
+});
+
+test("a run's own claim is not counted as somebody else's coverage", () => {
+  // Otherwise a run would read its own stretch as a reason to move off it.
+  const map = new CoverageMap({ segmentCount: 100 });
+  const runA = aRun();
+  map.claim(runA, 10, 30);
+  assert.equal(map.coveredRunFrom(10, runA), 0);
+});
+
+test("nothing free ahead answers null rather than a number past the end", () => {
+  const map = new CoverageMap({ segmentCount: 5 });
+  map.setReady([0, 1, 2, 3, 4]);
+  assert.equal(map.firstGapFrom(0), null);
+});
+
+test("a file that has gone stops being ready", () => {
+  // THE CHECK THE FIELD FAILURE OF 2026-09-07 NEEDED. Readiness used to
+  // accumulate: a number told once stayed ready for the life of the process
+  // however its file ended, so the map claimed a whole film that was not there,
+  // the plan scored every arrangement as perfect and took the only encoder away.
+  const map = new CoverageMap({ segmentCount: 10 });
+  map.setReady([3, 4]);
+  assert.equal(map.stateOf(4), "ready");
+  map.setReady([3]);
+  assert.equal(map.stateOf(4), "free", "the picture is replaced, not added to");
+  assert.equal(map.stateOf(3), "ready", "and what is still there stays");
+});
+
+test("the whole picture is replaced, so nothing survives that the disk has lost", () => {
+  const map = new CoverageMap({ segmentCount: 500 });
+  for (let index = 0; index < 500; index += 1) {
+    map.markReady(index);
+  }
+  assert.equal(map.stats().ready, 500);
+  map.setReady([]);
+  assert.equal(map.stats().ready, 0, "an empty directory is an empty map");
+  assert.equal(map.firstGapFrom(0), 0, "and the first gap is the beginning again");
+});
+
+test("a run's own claim does not hide the gap it is trying to move into", () => {
+  // Found by the plan's own checks: a run that had claimed the rest of the film
+  // — which is what every run did before ends existed — could find no gap
+  // anywhere, so it was stopped instead of moved.
+  const map = new CoverageMap({ segmentCount: 100 });
+  const runA = aRun();
+  map.claim(runA, 0, 99);
+  map.setReady([10, 11, 12]);
+  assert.equal(map.firstGapFrom(10, 90), null, "to anybody else its ground is taken");
+  assert.equal(map.firstGapFrom(10, 90, runA), 13, "to itself the ground beyond is a gap");
+});
+
+test("the free stretch ahead is measured, which is what gives a run its end", () => {
+  // A run handed the whole rest of the film would drive through the stretch
+  // another run is making. Handed the free stretch, it stops where the covered
+  // material begins.
+  const map = new CoverageMap({ segmentCount: 100 });
+  const runB = aRun();
+  map.claim(runB, 30, 60);
+  assert.equal(map.freeRunFrom(10), 20, "free from 10 up to 29");
+  map.markReady(15);
+  assert.equal(map.freeRunFrom(10), 5, "a ready segment ends the free stretch too");
+  assert.equal(map.freeRunFrom(15), 0, "a number that is not free has no free stretch");
+});
+
+test("a run's own claim does not end its own free stretch", () => {
+  const map = new CoverageMap({ segmentCount: 100 });
+  const runA = aRun();
+  map.claim(runA, 10, 40);
+  assert.equal(map.freeRunFrom(10, runA), 90, "its own ground is still its to fill");
+  assert.equal(map.freeRunFrom(10), 0, "to anybody else it is taken");
+});
+
+test("with the length unknown, a gap search needs its own bound", () => {
+  const map = new CoverageMap();
+  assert.equal(map.firstGapFrom(0), null, "no length and no bound answers nothing");
+  assert.equal(map.firstGapFrom(0, 3), 0);
+});
+
+test("with the length unknown, the free stretch is answered without walking to it", () => {
+  // What this pins: on the addon host, 2026-09-05, a map with no length walked
+  // one number at a time to MAX_SAFE_INTEGER, scanning every claim at each step.
+  // The main thread spun at 100% from the look-ahead timer and the proxy stopped
+  // answering anything, its own log included. The length was missing because the
+  // field naming it had moved to the timeline and three readers were left on the
+  // old name — but this walk must not be able to do that even when it is.
+  //
+  // This check cannot FAIL against the old code — a synchronous walk cannot be
+  // interrupted by the runner, so it would hang the whole run instead, which is
+  // worse than no check. What it pins is the contract that replaced the walk:
+  // the answer comes from what the map holds.
+  const map = new CoverageMap();
+
+  assert.equal(map.freeRunFrom(0), Number.POSITIVE_INFINITY, "nothing is covered, so nothing bounds it");
+
+  const run = aRun();
+  map.claim(run, 500, 900);
+  assert.equal(map.freeRunFrom(0), 500, "and a claim ahead is where the free stretch ends");
+  assert.equal(map.freeRunFrom(0, run), Number.POSITIVE_INFINITY, "its own claim does not bound it");
+
+  map.markReady(200);
+  assert.equal(map.freeRunFrom(0), 200, "so is a segment somebody has already made");
+});

package/test/declared-tracks.test.js

@@ -1,35 +1,35 @@
-/**
- * @file What the proxy promises the browser must be answerable.
- *
- * The session manager asks the planner's media-info cache which tracks the
- * output will carry. That cache never held the codecs — it holds dimensions,
- * duration, fps, start time and an HDR flag — so the read produced `undefined`
- * for both and the declaration came out `{video: false, audio: false}` for
- * EVERY session since the check existed. Measured 2026-08-11 in the field.
- *
- * Nothing caught it: the writer and the reader each looked correct alone, and
- * no test ever compared the shape of what is stored with the shape of what is
- * read. That comparison is this file's whole job.
- */
-
-import test from "node:test";
-import assert from "node:assert/strict";
-import { readFileSync } from "node:fs";
-
-const planner = readFileSync(new URL("../services/playback-planner.js", import.meta.url), "utf8");
-const sessions = readFileSync(new URL("../services/hls-session-manager.js", import.meta.url), "utf8");
-
-test("every field the declaration reads is a field the cache stores", () => {
-  // What `declaredTracks` reads off the cached media info.
-  const read = [...sessions.matchAll(/probed\?\.([A-Za-z]+)/g)].map((match) => match[1]);
-  assert.ok(read.length > 0, "the declaration must read something, or it declares nothing");
-
-  const stored = planner.slice(planner.indexOf("mediaInfoCache.set("));
-  for (const field of new Set(read)) {
-    assert.ok(
-      stored.includes(`${field}:`),
-      `the declaration reads "${field}" and the media-info cache never stores it — ` +
-      "the read yields undefined and the promise silently becomes false"
-    );
-  }
-});
+/**
+ * @file What the proxy promises the browser must be answerable.
+ *
+ * The session manager asks the planner's media-info cache which tracks the
+ * output will carry. That cache never held the codecs — it holds dimensions,
+ * duration, fps, start time and an HDR flag — so the read produced `undefined`
+ * for both and the declaration came out `{video: false, audio: false}` for
+ * EVERY session since the check existed. Measured 2026-08-11 in the field.
+ *
+ * Nothing caught it: the writer and the reader each looked correct alone, and
+ * no test ever compared the shape of what is stored with the shape of what is
+ * read. That comparison is this file's whole job.
+ */
+
+import test from "node:test";
+import assert from "node:assert/strict";
+import { readFileSync } from "node:fs";
+
+const planner = readFileSync(new URL("../services/playback-planner.js", import.meta.url), "utf8");
+const sessions = readFileSync(new URL("../services/hls-session-manager.js", import.meta.url), "utf8");
+
+test("every field the declaration reads is a field the cache stores", () => {
+  // What `declaredTracks` reads off the cached media info.
+  const read = [...sessions.matchAll(/probed\?\.([A-Za-z]+)/g)].map((match) => match[1]);
+  assert.ok(read.length > 0, "the declaration must read something, or it declares nothing");
+
+  const stored = planner.slice(planner.indexOf("mediaInfoCache.set("));
+  for (const field of new Set(read)) {
+    assert.ok(
+      stored.includes(`${field}:`),
+      `the declaration reads "${field}" and the media-info cache never stores it — ` +
+      "the read yields undefined and the promise silently becomes false"
+    );
+  }
+});

package/test/disk-space.test.js

@@ -0,0 +1,138 @@
+/**
+ * @file One disk, one owner, three claimants.
+ *
+ * What these pin is the thing that was wrong: each consumer read the free space
+ * as though it were alone, so three ceilings each stood for the whole disk.
+ */
+
+import test from "node:test";
+import assert from "node:assert/strict";
+import { DiskSpace } from "../services/disk/DiskSpace.js";
+
+const MEGABYTE = 1024 * 1024;
+
+/**
+ * @param {string} name
+ * @param {number} held
+ * @param {number} wanted
+ */
+function consumerOf(name, held, wanted) {
+  const state = { allowed: -1 };
+  return {
+    state,
+    consumer: {
+      name,
+      held: () => held,
+      wanted: () => wanted,
+      allow: (bytes) => {
+        state.allowed = bytes;
+      }
+    }
+  };
+}
+
+test("what everyone may hold together never exceeds what the disk has", async () => {
+  const free = 100 * MEGABYTE;
+  const space = new DiskSpace({ readFree: async () => free });
+  const segments = consumerOf("segments", 10 * MEGABYTE, 1000 * MEGABYTE);
+  const pieces = consumerOf("pieces", 20 * MEGABYTE, 1000 * MEGABYTE);
+  const diagnostics = consumerOf("diagnostics", 5 * MEGABYTE, 1000 * MEGABYTE);
+  space.register(segments.consumer);
+  space.register(pieces.consumer);
+  space.register(diagnostics.consumer);
+
+  const { allowanceBytes } = await space.revise();
+
+  const together = segments.state.allowed + pieces.state.allowed + diagnostics.state.allowed;
+  assert.ok(together <= allowanceBytes, "the shares add up to more than the allowance");
+  // Free space plus what they already hold: that pair is the ceiling they could
+  // reach, which is the same statement the memory allowance makes.
+  assert.equal(allowanceBytes, free + 35 * MEGABYTE);
+  assert.ok(
+    together <= free + 35 * MEGABYTE,
+    "three consumers were between them allowed more than the disk has"
+  );
+});
+
+test("when everyone's ask fits, everyone gets it and the disk never binds", async () => {
+  const space = new DiskSpace({ readFree: async () => 1000 * MEGABYTE });
+  const small = consumerOf("diagnostics", 0, 5 * MEGABYTE);
+  const large = consumerOf("segments", 0, 500 * MEGABYTE);
+  space.register(small.consumer);
+  space.register(large.consumer);
+
+  await space.revise();
+
+  assert.equal(small.state.allowed, 5 * MEGABYTE);
+  assert.equal(large.state.allowed, 500 * MEGABYTE);
+});
+
+test("when they do not fit, each is cut in proportion to what it asked", async () => {
+  // The same rule memory divides by, and the same reason: a share taken from
+  // whoever asked most would hand the disk to whoever grew fastest.
+  const space = new DiskSpace({ readFree: async () => 200 * MEGABYTE });
+  const modest = consumerOf("diagnostics", 0, 100 * MEGABYTE);
+  const greedy = consumerOf("segments", 0, 300 * MEGABYTE);
+  space.register(modest.consumer);
+  space.register(greedy.consumer);
+
+  await space.revise();
+
+  assert.equal(modest.state.allowed, 50 * MEGABYTE);
+  assert.equal(greedy.state.allowed, 150 * MEGABYTE);
+  assert.equal(modest.state.allowed + greedy.state.allowed, 200 * MEGABYTE);
+});
+
+test("a disk that fills lowers every share, rather than keeping one taken when it was empty", async () => {
+  let free = 1000 * MEGABYTE;
+  const space = new DiskSpace({ readFree: async () => free });
+  const segments = consumerOf("segments", 0, 10_000 * MEGABYTE);
+  const pieces = consumerOf("pieces", 0, 10_000 * MEGABYTE);
+  space.register(segments.consumer);
+  space.register(pieces.consumer);
+
+  await space.revise();
+  const roomy = segments.state.allowed;
+
+  free = 40 * MEGABYTE;
+  await space.revise();
+
+  assert.ok(segments.state.allowed < roomy, "the share did not follow the disk down");
+  assert.ok(pieces.state.allowed < roomy, "the other share did not follow either");
+});
+
+test("what another process took is left for it, not spent", async () => {
+  // Between two readings the disk lost 400 MB that none of our consumers took.
+  // That is a measurement of somebody else's demand, and it is what the next
+  // allowance leaves alone.
+  let free = 1000 * MEGABYTE;
+  const space = new DiskSpace({ readFree: async () => free });
+  const only = consumerOf("segments", 0, 10_000 * MEGABYTE);
+  space.register(only.consumer);
+
+  await space.revise();
+  free = 600 * MEGABYTE;
+  const { allowanceBytes } = await space.revise();
+
+  assert.equal(allowanceBytes, 200 * MEGABYTE, "the fall we did not cause was spent anyway");
+});
+
+test("a disk that cannot be read allows nothing to grow", async () => {
+  const space = new DiskSpace({ readFree: async () => null });
+  const segments = consumerOf("segments", 0, 500 * MEGABYTE);
+  space.register(segments.consumer);
+
+  const { freeBytes, allowanceBytes } = await space.revise();
+
+  assert.equal(freeBytes, 0);
+  assert.equal(allowanceBytes, 0);
+  assert.equal(segments.state.allowed, 0, "an unreadable disk was treated as an empty one");
+});
+
+test("it says what the disk has and what each claimant may hold", async () => {
+  const space = new DiskSpace({ readFree: async () => 100 * MEGABYTE });
+  assert.match(space.describe(), /nothing has claimed/);
+  space.register(consumerOf("segments", 4 * MEGABYTE, 8 * MEGABYTE).consumer);
+  await space.revise();
+  assert.match(space.describe(), /disk: 100MB free; segments 4MB of 8MB/);
+});

package/test/encode-orchestrator.test.js

@@ -172,7 +172,6 @@ test("an encoder already working covers what it will reach in time", () => {
   // wanted at all.
   const { made, buildRun } = orchestrator();
   const first = buildRun({ from: 0, to: -1 });
-  first.start("a viewer needs it");
   first.noteSpeed(8);
   made.adopt(PICTURE, first);
   made.noteProduced(PICTURE, 0);
@@ -203,7 +202,6 @@ test("somebody stopped where no encoder can arrive in time is served, and the sc
   // seconds anybody spends looking at a spinner — outranks it.
   const { made, buildRun } = orchestrator();
   const first = buildRun({ from: 0, to: -1 });
-  first.start("a viewer needs it");
   first.noteSpeed(1);
   made.adopt(PICTURE, first);
   made.noteProduced(PICTURE, 0);
@@ -224,7 +222,6 @@ test("two encoders on one output never share a segment number", () => {
   // what that neighbour makes sooner.
   const { made, buildRun } = orchestrator();
   const first = buildRun({ from: 0, to: -1 });
-  first.start("a viewer needs it");
   first.noteSpeed(1);
   made.adopt(PICTURE, first);
   made.noteProduced(PICTURE, 0);