agent-dag 3.22.1 → 3.22.3

package/src/server/lhm-parse.mjs

@@ -1,91 +0,0 @@
-// Reading LibreHardwareMonitor's sensor tree, out of the shape its own source
-// produces rather than out of an example.
-//
-// `GenerateJsonForNode` in HttpServer.cs builds every node as
-//
-//   { id, Text, Min, Value, Max }
-//
-// and a SENSOR node adds
-//
-//   SensorId : "/intelcpu/0/temperature/0"     the stable identifier
-//   Type     : "Temperature"                    the SensorType enum, as text
-//   Value    : "52.0 °C"                        formatted for a human
-//   RawValue : 52.0                             the number, unformatted
-//
-// Two of those decide this file.
-//
-// RAWVALUE, NEVER VALUE. `Value` is formatted with the machine's culture, so on
-// a German or Russian Windows it reads "52,0 °C" — a comma — and every naive
-// parse of it either throws away the decimal or produces 520. `RawValue` is the
-// number itself. This is the same trap the deck already hit once with `ps`
-// output and fixed with LC_NUMERIC.
-//
-// AND RAWVALUE CAN BE THE STRING "NaN". The server serialises with
-// JsonNumberHandling.AllowNamedFloatingPointLiterals, which writes a NaN as a
-// quoted "NaN" rather than failing — so a sensor that has not read yet arrives
-// as text where a number is expected. `Number("NaN")` is NaN and is rejected
-// below, which is the right answer, but it is rejected on purpose rather than
-// by luck.
-//
-// TYPE, NEVER THE NAME. `Type` comes from an enum and is the same word on every
-// machine in every language; the `Text` beside it is a display name that
-// differs between vendors and driver versions.
-
-/** A plausible temperature. The same floor the rest of the thermal code uses:
- *  0 is a sensor that has not read, and nothing above this is a temperature. */
-const plausible = (c) => Number.isFinite(c) && c > 0 && c < 150;
-
-/**
- * Every temperature sensor in the tree, flattened.
- *
- * Exported for its own test, and because "what did that machine actually
- * publish" is the question anybody debugging this will have first.
- */
-export function flattenSensors(root) {
-  const out = [];
-  const walk = (n, depth) => {
-    // The tree is four or five deep in practice — root, computer, hardware,
-    // type, sensor. The bound is against a cycle, which JSON cannot contain but
-    // a hand-written fixture can.
-    if (!n || typeof n !== "object" || depth > 12) return;
-    if (n.Type === "Temperature") {
-      out.push({
-        id: String(n.SensorId ?? ""),
-        name: String(n.Text ?? ""),
-        celsius: Number(n.RawValue),
-      });
-    }
-    if (Array.isArray(n.Children)) for (const c of n.Children) walk(c, depth + 1);
-  };
-  walk(root, 0);
-  return out;
-}
-
-/**
- * Which sensor is the CPU, and which is the GPU.
- *
- * Chosen by SensorId rather than by name. The identifier is built from the
- * hardware type — `/intelcpu/0/…`, `/amdcpu/0/…`, `/gpu-nvidia/0/…` — and is
- * the same on every machine, while `Text` is a display name that reads "CPU
- * Package" on one driver and "Core (Tctl/Tdie)" on another.
- *
- * The HOTTEST of a hardware's sensors is taken, not the first. A CPU publishes
- * a package reading and one per core; the package is usually the highest and is
- * what a person means by "the CPU temperature", and where a vendor publishes no
- * package the hottest core is the honest stand-in. Taking the first would
- * report core #1 while core #6 is thermal-throttling.
- */
-export function readTemps(root) {
-  const sensors = flattenSensors(root).filter(s => plausible(s.celsius));
-  const hottest = (re) => {
-    const mine = sensors.filter(s => re.test(s.id));
-    if (!mine.length) return null;
-    return Math.round(Math.max(...mine.map(s => s.celsius)));
-  };
-  const out = {};
-  const cpu = hottest(/^\/(intel|amd)cpu\//i);
-  const gpu = hottest(/^\/gpu-/i);
-  if (cpu != null) out.cpu = cpu;
-  if (gpu != null) out.gpu = gpu;
-  return out;
-}

package/src/server/log-tail.mjs

@@ -1,139 +0,0 @@
-// Reading a log backwards, because only its end is ever kept.
-//
-// #742. The event log is replayed before the port opens, and the replay parsed
-// every line in it from the beginning — 12,079 lines and 31 MB on the machine
-// this was measured on, 690ms of JSON.parse, growing with every session until
-// rotation cuts it at 50 MB. The ring it fills holds MAX_BUFFER = 2000 events.
-// So roughly five sixths of that work was parsing events that were evicted by
-// the ones parsed after them, on the critical path of a boot, every time.
-//
-// Reading from the end fixes the asymmetry rather than the constant: the loop
-// stops as soon as the ring is full, so the cost becomes a property of the ring
-// instead of a property of how long the user has been running the deck. When
-// the ring cannot be filled — a young log, or a workspace-scoped deck whose
-// events are a thin slice of a shared one — it reads all the way back to the
-// start and costs exactly what the forward read did. There is no case where
-// this is slower and no case where it sees less.
-//
-// Bytes, not characters. Lines are split on 0x0A and decoded one at a time,
-// which is safe in UTF-8 because no byte of a multi-byte sequence can be 0x0A —
-// a chunk boundary landing inside a three-byte character joins back together
-// before anything is decoded. Decoding the chunk first and splitting the string
-// is what would corrupt it, and it is the obvious way to write this.
-import { open } from "node:fs/promises";
-import { createReadStream } from "node:fs";
-import { createInterface } from "node:readline";
-
-/** One line out of a buffer, minus the carriage return a CRLF file leaves on
- *  the end of it. Sliced before decoding — see the note about 0x0A above. */
-function line(buf, from, to) {
-  const end = to > from && buf[to - 1] === 0x0D ? to - 1 : to;
-  return buf.subarray(from, end).toString("utf8");
-}
-
-/** How much is read at a time. One megabyte holds about 400 events at the size
- *  this log's lines actually run to, so a full ring is usually five reads. */
-export const CHUNK_BYTES = 1 << 20;
-
-/**
- * The file's lines, newest first, as an async iterable.
- *
- * Stops reading the moment the consumer stops asking — that is the whole point,
- * and it is why this is a generator rather than a function returning an array.
- * A `break` in the caller closes the handle through the generator's `finally`.
- *
- * Lines are yielded WITHOUT their newline, and the sequence is exactly the
- * reverse of what `readline` yields reading the same file forwards — empty
- * lines included, and a trailing newline at EOF is a line terminator rather
- * than an empty line after it. A CRLF file reads the same as it does forwards,
- * because the carriage return is stripped here too. That equivalence is the
- * contract, and it is what the round-trip case in the test file checks against
- * readline itself rather than against a hand-written expectation.
- *
- * The ONE difference: `readline` also breaks on a lone carriage return, for the
- * sake of files written by software that predates OS X. Walking those backwards
- * would mean scanning every byte of every chunk instead of asking Buffer for
- * the next 0x0A, and nothing that writes a line into this deck's log has
- * produced one since 2001. A file full of lone carriage returns reads here as a
- * single very long line, which JSON.parse then declines — one skipped line,
- * counted and reported, rather than a wrong answer.
- */
-export async function* linesFromEnd(filePath, { chunkBytes = CHUNK_BYTES, openFile = open } = {}) {
-  const fh = await openFile(filePath, "r");
-  try {
-    const { size } = await fh.stat();
-    let pos = size;
-    // The bytes at the front of what has been read that have no newline before
-    // them yet: the first line of the chunk, which may continue into the chunk
-    // that comes before it. Carried, never yielded, until a newline turns up or
-    // the start of the file does.
-    let carry = Buffer.alloc(0);
-    // The newline that ends the last line is a terminator, not the start of an
-    // empty line after it. Trimmed once, on the chunk that holds EOF.
-    let atEof = true;
-
-    while (pos > 0) {
-      const len = Math.min(chunkBytes, pos);
-      pos -= len;
-      const buf = Buffer.alloc(len);
-      // Node reads short at the end of a file and at a pipe; a regular file
-      // opened for reading at a known offset does not, but the loop is written
-      // to survive it rather than to assume it.
-      let got = 0;
-      while (got < len) {
-        const { bytesRead } = await fh.read(buf, got, len - got, pos + got);
-        if (bytesRead === 0) break;
-        got += bytesRead;
-      }
-      const hay = carry.length ? Buffer.concat([buf.subarray(0, got), carry]) : buf.subarray(0, got);
-
-      // Walk the newlines from the end. `end` is one past the last byte of the
-      // line being cut; every cut is a complete line, because everything to its
-      // right has already been yielded.
-      let end = hay.length;
-      if (atEof && end > 0 && hay[end - 1] === 0x0A) end--;
-      atEof = false;
-      while (end > 0) {
-        const nl = hay.lastIndexOf(0x0A, end - 1);
-        if (nl === -1) break;
-        yield line(hay, nl + 1, end);
-        end = nl;
-      }
-      carry = hay.subarray(0, end);
-    }
-
-    // Whatever is left has the start of the file in front of it, so it is a
-    // whole line — and an EMPTY one is still a line, which is why this is not
-    // conditional on `carry.length`. A file that opens with a newline opens
-    // with an empty line, and reading it forwards says so.
-    if (size > 0) yield line(carry, 0, carry.length);
-  } finally {
-    await fh.close().catch(() => {});
-  }
-}
-
-/**
- * The same file, the ordinary way round.
- *
- * Here rather than at the one call site so the two readers sit together and a
- * reader of either finds the other: replayLog picks between them per boot, on
- * whether its scope predicate can be fed a log backwards, and a pair of
- * functions in one file is what makes that choice legible.
- *
- * Streams, so a scoped deck on a 50 MB log holds one line at a time exactly as
- * it did before any of this.
- */
-export async function* linesFromStart(filePath) {
-  const input = createReadStream(filePath, { encoding: "utf8" });
-  const rl = createInterface({ input });
-  try {
-    for await (const line of rl) yield line;
-  } finally {
-    // Both, and the stream second. `rl.close()` stops the interface and leaves
-    // the descriptor under it open, which is fine for the one caller here
-    // because it reads to the end — and is a leak the day somebody breaks out
-    // of this loop the way the backwards reader is designed to be broken out of.
-    rl.close();
-    input.destroy();
-  }
-}

package/src/server/log-writer.mjs

@@ -1,322 +0,0 @@
-// Which of the running decks writes an event to the log they share?
-//
-// The hook already answers that for the events it delivers: it groups the decks
-// it is about to post to by the log file each one names in its discovery record,
-// elects one per file, and marks the request to every other one `?persist=0`.
-// See electWriters in hook/hook.js.
-//
-// The Codex rollout watcher never goes through the hook — it builds its events
-// inside the server by tailing ~/.codex/sessions/**/rollout-*.jsonl — so nothing
-// suppressed the copies on that path: every deck tailing the same rollout
-// appended its own line to the one events.jsonl they all default to, so each
-// Codex tool call, prompt and session start landed there once per running deck.
-// That is the duplication the hook election was added to end, still open on the
-// path that is the only Codex capture there is on Windows, where Codex hooks
-// never fire at all.
-//
-// So the server runs the same election, over the same discovery records, with
-// the same tie-break. The rule is repeated here rather than imported from
-// hook/hook.js because that file is copied out of the package and run standalone
-// by the host CLI, with no path back to the module it came from — the same
-// reason it re-derives the Claude config dir inline. The two copies are pinned
-// equal by a test, as challengeProof's pair already is.
-import { open } from "node:fs/promises";
-import { realpathSync } from "node:fs";
-import { basename, dirname, join, resolve, win32, posix } from "node:path";
-
-/**
- * Does this platform's filesystem treat two spellings that differ only in case
- * as the same file? The platform is a parameter so both answers can be checked
- * from either kind of machine.
- *
- * Windows always does, and macOS does by default (APFS and HFS+ are formatted
- * case-insensitive unless the user deliberately chose otherwise). Linux does
- * not, and folding case there would be a bug of its own: /srv/a/events.jsonl and
- * /srv/A/events.jsonl are two real files, each of which needs a writer.
- */
-/**
- * The one spelling of an events log, so two decks pointed at one file land in
- * one group (#793).
- *
- * `resolve` alone was what shipped, and it settles relative-vs-absolute and
- * nothing else. The election below then only case-folds — so two spellings of
- * one file read as two files, which is the exact thing `bin/deck.js`'s comment
- * over this value says must not happen. On Windows it needs no odd user action:
- * `claudeConfigDir()` derives from `homedir()`, and a shell whose `USERPROFILE`
- * is 8.3-shortened yields a different default string than one with the long
- * form. `subst` and mapped drives and junctions do it too, and on macOS so does
- * `/tmp` against `/private/tmp`.
- *
- * What it cost was not merely a duplicate group. BOTH decks were then elected,
- * so every hook event was appended twice — the duplicate-tools-after-restart
- * symptom the election exists to end — and `logSharing()` compares the same
- * string, so both answered `mine: true` and `POST /api/clear` truncated a file
- * this deck does not own. That is the #698 history loss the ownership gate was
- * added to prevent.
- *
- * THE DIRECTORY IS CANONICALISED EVEN WHEN THE FILE IS NOT THERE, which is the
- * half a plain realpath misses. On a first run, or against a `--history` naming
- * a file the deck will create, `realpath` throws ENOENT — and falling back to
- * the resolved string would leave the two spellings different for exactly the
- * run that creates the file. The parent exists (or is about to be created under
- * one canonical name), so it is canonicalised and the basename rejoined.
- *
- * `canonicalWorkspace` in index.mjs is the same rule for the other path this
- * deck publishes, with three comments naming 8.3 expansion as its reason. This
- * is that rule reaching the value two lines away from it.
- */
-export function canonicalLogPath(raw) {
-  if (typeof raw !== "string" || raw.trim() === "") return "";
-  const abs = resolve(raw);
-  try { return realpathSync.native(abs); } catch { /* not created yet */ }
-  try { return join(realpathSync.native(dirname(abs)), basename(abs)); } catch { return abs; }
-}
-
-export const foldsCase = (platform = process.platform) =>
-  platform === "win32" || platform === "darwin";
-
-/**
- * Of these decks, which ones write to disk? Returns the subset that should;
- * every other one is expected to draw the event and keep no record of it.
- *
- * Decks are grouped by the log file each one names in its discovery record and
- * one deck per group is elected. Grouping by the file rather than counting decks
- * is what keeps the overrides honest: a deck run with `--history` sits alone in
- * its own group and always writes, a deck run with `--no-persist` reports no
- * file and can never be elected to write for one that does, and a deck too old
- * to report either keeps the behaviour it had before this rule existed. Within a
- * group the lowest port wins — a fixed rule, so the same deck holds the file for
- * as long as it is up and the next one inherits it as soon as that deck is gone.
- *
- * Kept byte-for-byte equivalent to electWriters in hook/hook.js: the two decide
- * for the same decks over the same records, and a disagreement between them
- * means one log line written twice or none at all.
- */
-export function electWriters(decks, platform = process.platform) {
-  const byLog = new Map();
-  for (const d of decks) {
-    const log = typeof d.persist === "string" ? d.persist : "";
-    // Two namespaces, so a deck with no log to share — and a deck too old to
-    // report one — is alone in its group and cannot collide with a real path.
-    const key = log
-      ? `log:${foldsCase(platform) ? log.toLowerCase() : log}`
-      : `deck:${d.pid}:${d.port}`;
-    const held = byLog.get(key);
-    // Ports are unique among live decks; pid only breaks a tie a stale
-    // discovery file could invent, so the answer stays deterministic.
-    if (!held || d.port < held.port || (d.port === held.port && d.pid < held.pid)) {
-      byLog.set(key, d);
-    }
-  }
-  return new Set(byLog.values());
-}
-
-/**
- * Would a deck scoped to `workspace` capture a rollout running in `cwd`? An
- * empty workspace is unscoped and captures every session; a rollout that never
- * said where it runs is inside no workspace, so only an unscoped deck draws it.
- *
- * This answers two questions with one function — whether THIS deck tails a
- * rollout, and whether another deck tails it too — and that is only sound while
- * the rule below is the rule every deck actually runs. Model another deck's
- * capture with anything else and the election covers the wrong set: a deck that
- * writes without being elected, or an elected deck that never opened the file.
- *
- * It is also the rule hook/hook.js runs for the sessions it delivers, under the
- * name capturesSession — that script is copied out of the package and run
- * standalone, so the two are written twice and pinned equal by a test walking
- * one table of paths through both. They were not equal: case was folded here on
- * every platform, so on Linux a deck scoped to /srv/proj captured Codex sessions
- * from /srv/Proj and Claude sessions from neither. Those are two real
- * directories there, and the hook's own comment says what folding them together
- * costs — a deck handed the events of a tree it was not scoped to. So the fold
- * is per-platform on both sides now, and `--workspace` means one thing.
- *
- * (The narrow window that opens: two decks on Linux whose workspaces differ only
- * in case, one of them old enough to still fold, both containing one rollout's
- * cwd. Each models the other as tailing the file; one of them is wrong, and the
- * cost is a single log line written twice.)
- *
- * The platform is a parameter, following the hook's cwdInWorkspace and
- * spawnSpec in src/server/exec.mjs, so the Windows separator is testable from a
- * POSIX machine.
- */
-export function codexCwdInWorkspace(cwd, workspace, platform = process.platform) {
-  if (!workspace || typeof workspace !== "string") return true;
-  if (!cwd || typeof cwd !== "string") return false;
-  const p = platform === "win32" ? win32 : posix;
-  const fold = s => (foldsCase(platform) ? s.toLowerCase() : s);
-  const a = fold(p.resolve(cwd));
-  const b = fold(p.resolve(workspace));
-  if (a === b) return true;
-  // A root ("C:\", "/") already ends in the separator; appending a second one
-  // would match nothing.
-  return a.startsWith(b.endsWith(p.sep) ? b : b + p.sep);
-}
-
-/**
- * Does this deck append a rollout's events to its log, or is another deck doing
- * it? `decks` is every deck registered right now, `pid` identifies this one
- * among them, and `cwd` is the workspace the rollout is running in.
- *
- * The group is every deck that tails this same rollout: each deck decides for
- * itself, so all of them whose workspace contains the cwd read the file and all
- * of them would write it. The hook builds the same group the same way for the
- * events it delivers — it used to narrow them to the longest workspace match
- * first, which is the asymmetry the predicate above describes the end of. A deck
- * started with `--no-codex` tails nothing and is left out; electing it would
- * mean the rollout's events reach no log at all. A deck too old to say either
- * way is assumed to be tailing, which is what it was doing before this field
- * existed.
- */
-export function writesCodexLog({ decks, pid, cwd, platform = process.platform }) {
-  const live = Array.isArray(decks) ? decks : [];
-  const self = live.find(d => d && d.pid === pid) ?? null;
-  // No record of our own on disk — the window before the first heartbeat writes
-  // it, or a deck that cannot write one at all. Nobody can elect us and we
-  // cannot see who else is here, so keep what this deck did before the election
-  // existed and write. A line written twice is recoverable; a deck that quietly
-  // stops recording anything is not.
-  if (!self || typeof self.persist !== "string" || self.persist === "") return true;
-
-  const group = [self];
-  for (const d of live) {
-    if (!d || d.pid === self.pid) continue;
-    if (d.codex === false) continue;
-    if (!codexCwdInWorkspace(cwd, d.workspace ?? "", platform)) continue;
-    group.push(d);
-  }
-  return electWriters(group, platform).has(self);
-}
-
-// ─── Appending one whole line ─────────────────────────────────────────────
-//
-// The election above decides WHICH deck writes a line. This decides HOW, and
-// the two are answers to the same question: the log is one file that several
-// processes append to, so a line that arrives in pieces is a line another
-// writer can land inside.
-//
-// What was wrong. events.jsonl was appended with `fsPromises.appendFile`, which
-// is not one write(2). Node's writeFileHandle loops over the payload in chunks
-// of kWriteFileMaxChunkSize — 512 KiB — awaiting each one, so any line longer
-// than 524288 bytes became two or more separate appends with the event loop
-// free in between. Measured here, on Node 26 / macOS 15 / APFS, by watching the
-// file grow while one 5 MiB appendFile was in flight: it arrived in exactly ten
-// steps of 524288 bytes. A single handle.write of the same payload arrived in
-// one step of 5242880.
-//
-// That is reachable in ordinary use. `POST /api/event` accepts a body up to
-// 5,000,000 characters, and a PostToolUse carrying a large Read or Bash
-// response is routinely a good fraction of that. The event that gets spliced
-// into the middle is nearly always this deck's own: pushEvent kicks off
-// maybeResolveUsage / maybeResolveModel / maybeResolveContext on the same call,
-// and each of those pushes its own event a moment later. Reproduced at 8/8 runs
-// with one 1 MiB line and eight small ones issued in one tick, and 4/4 runs
-// across two processes appending 3 MiB lines to one file.
-//
-// The damage is silent and doubled: the oversized event is torn into two
-// unparseable halves AND the small event that landed between them is swallowed
-// inside one of those halves, so a boot replay loses both.
-//
-// What this does instead: exactly one write(2) per line, on a descriptor opened
-// O_APPEND. That is the primitive the atomicity rests on, so it is worth
-// stating exactly what each platform promises.
-//
-//   Linux — a write to a regular file holds the inode's i_rwsem for the whole
-//   call, so one write(2) is atomic against every other writer regardless of
-//   size, up to MAX_RW_COUNT (~2 GiB) after which the call returns short.
-//   O_APPEND additionally makes the seek-to-end and the write one step, which
-//   is what stops two processes overwriting each other's tail.
-//
-//   macOS — measured, not assumed, because the guarantee is not written down as
-//   plainly: single writes of 1 MiB and 5 MiB in-process, and 3 MiB from two
-//   processes at once, produced no torn line in any run, while appendFile of
-//   the same payloads tore in every run.
-//
-//   Windows — libuv issues the append as a WriteFile at the documented
-//   end-of-file offset on a handle opened FILE_APPEND_DATA, which NTFS serialises
-//   per call. This is the platform where the Codex rollout watcher is the only
-//   capture path there is, so it is also the platform with the most decks
-//   sharing one log.
-//
-// Where the guarantee does NOT hold: any filesystem that can return a short
-// write — NFS and some network/FUSE mounts under memory pressure, and any
-// platform once the payload passes its per-call ceiling. The loop below then
-// issues a second write for the remainder, and another writer can land between
-// them. Nothing available in userland fixes that, so the answer is the reader:
-// replayLog skips a line it cannot parse, counts it, and says so, rather than
-// stopping at it. A torn line costs one event, not the rest of the file.
-//
-// Why not cap or drop oversized events instead. The 5 MB ceiling is already the
-// cap, and it is enforced where it belongs — at ingest, with a 413 the poster
-// can see. Refusing to persist an event the deck is happily drawing would make
-// the canvas and its own replay disagree, which is the bug this fixes wearing a
-// different hat.
-//
-// Why the file is opened per line rather than kept open. maybeRotatePersistFile
-// renames events.jsonl to events.jsonl.1 at 50 MB and `/api/clear` truncates it
-// to zero; a descriptor held across either would go on filling the file nobody
-// reads any more. Opening per line is also exactly the syscall count appendFile
-// already paid — open, write, close — minus the extra writes.
-const appendTails = new Map();
-
-/**
- * Append one already-serialized line to the shared log, whole.
- *
- * Appends are serialized per file behind a promise chain. That is not what
- * makes them atomic — the single write(2) below is — but it keeps the order the
- * lines land in equal to the order pushEvent produced them, which is the order
- * a replay reads them back in, and it keeps this process to one open descriptor
- * on the log no matter how many events arrive in one tick.
- *
- * Never rejects. This is called fire-and-forget from the hottest path in the
- * process, and a rejection nobody awaits is a dead deck; a line that could not
- * be written is a line lost, which the caller could not have done anything
- * about anyway. The chain deliberately continues past a failure — one ENOSPC
- * must not stop every later event from being recorded once space is back.
- *
- * @param {string} filePath absolute path to the log
- * @param {string} line     the line to append, INCLUDING its trailing newline
- */
-export function appendLogLine(filePath, line) {
-  const tail = (appendTails.get(filePath) ?? Promise.resolve())
-    .then(() => writeWholeLine(filePath, line))
-    .catch(() => {});
-  appendTails.set(filePath, tail);
-  // Drop the chain once it drains, so a process that writes to several logs
-  // over its life does not hold a promise per path it has finished with. Only
-  // the tail we just installed is cleared: if another append chained on in the
-  // meantime the map already points at that one, and deleting it would let the
-  // next line race the one still in flight.
-  tail.then(() => { if (appendTails.get(filePath) === tail) appendTails.delete(filePath); });
-  return tail;
-}
-
-/**
- * One line, one write(2). The loop exists only for the short-write case
- * described above; on every filesystem that does not do that it runs once.
- *
- * `position` is left null on purpose. That is what makes libuv issue write(2)
- * rather than pwrite(2), and pwrite is the version that does not honour
- * O_APPEND on every platform — it would write at an offset computed before the
- * other writer moved the end of the file.
- */
-async function writeWholeLine(filePath, line) {
-  // Encoded up front so the short-write loop can count bytes rather than UTF-16
-  // units. A multi-byte character split across two chunks would otherwise be
-  // resumed mid-sequence and the line would be mojibake even without a race.
-  const buf = Buffer.from(line, "utf8");
-  const handle = await open(filePath, "a");
-  try {
-    let written = 0;
-    while (written < buf.byteLength) {
-      const { bytesWritten } = await handle.write(buf, written, buf.byteLength - written, null);
-      // A write that reports no progress would spin this loop forever inside a
-      // promise nobody is watching. Give up on the line instead.
-      if (bytesWritten <= 0) throw new Error(`append made no progress at ${written}/${buf.byteLength} bytes`);
-      written += bytesWritten;
-    }
-  } finally {
-    await handle.close();
-  }
-}