Captain Bob, 2026-11-17: "Fix the regression"; "Run Step 0, then report". Measure only; no code changed. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_017RzZgrf7V7Zk2iczBXDRbm
4.4 KiB
The fabric step's cost -- the regression at 046ce0be fixed -- design, for ruling
Written 2026-11-17. Captain Bob, asked how to handle aarch64 running out of its 570 s in POST:
"Fix the regression". This is treated as a correctness regression, not as tuning. The background
is in 2026-11-17-the-regression-at-046ce0be.md.
Nothing here is built. The design and its first step wait for his ruling.
1. What stays exactly as it is
The fabric's semantics are ruled, and they do not change:
- "Every node that is not blocked runs; on one processor that is each in rotation, an instruction word at a time ... not a policy" (ENGINE.md §3d, ruled "A").
- "There is no choice of whose turn it is" (MESH.md ruling 7 and §4.3;
fabric.h).
Unchanged:
- the order of a step's phases;
- which node executes;
- what is handed over, and when;
- what every node sees;
- POST's results,
dict_hashon every ISA, and every existing test's checks.
What changes: only what a step costs, when nodes are absent, blocked or have nothing new.
2. What it costs now (code, v4/src/fabric.c:423-490)
One step is one instruction word for each awake node. Every step walks all f->capacity places, 16 in
the kernel, in ten passes:
- the have-mask, an 8-port loop for each awake node;
look_about, an 8-port loop, for each node that is not blocked;- one instruction word for each awake node;
- the have-fetched clear;
- and 6. two operation passes;
- the handing over of writes;
- the handing over of reads, an 8-port device loop;
- the gone-error pass.
The mesh then polls the console's queue (v4_mesh_step, v4_mesh_tell).
In the boot, POST included, only Hera exists: 15 of the 16 places are empty (v4/system/mesh.c;
births come later). f10d2bc8 did, for each instruction word, one have-mask and one
v4_exec_step_word. 046ce0be does the whole walk for each.
3. Step 0 -- measure before choosing (no change to the code)
Intent: to know which parts of the step the time goes to before deciding what to change.
How:
- Profile the host mesh boot (
make -C v4 mesh-boot, POST 990 on Hera, in the fabric), with gprof or perf on the same build. - Count, per instruction word executed, the work in each of the ten passes and in
takes().
The observation that proves it (named before the run): the share of the time in
v4_fabric_step, and in each pass, adds up to the gap between f10d2bc8's direct loop and the fabric.
Evidence: the profile and the counts, committed under logs/<TS>/fabric-cost/.
4. The candidates (chosen with Step 0's data, and ruled before any is built)
| Mechanism | From the record | Risk to the semantics | |
|---|---|---|---|
| A | The fabric keeps a list of the places that hold a node, and each pass walks that list, not every place. | FABRIC-3.5 §XXII and §XXXV.2: no per-tick walk over every place ("hundreds of VMs") | None: an empty place takes part in no pass. The order of the walk is the same. |
| B | A node that is blocked, asleep or stopped is skipped in the passes that cannot touch it, by one flag test, not by the 8-port loops. | FABRIC-3 §XXVIII: "a flag set, not a walk" | Low: each pass's condition is kept, read once. |
| C | The have-mask and look_about are recomputed only for a node whose wires or neighbours changed since the last step. |
FABRIC-0 GAP-A1; 3.5 §XLIII: the target takes its own on its own turn | Higher: what changed must be tracked exactly, or a node misses a message. Only if A and B are not enough. |
5. How each built change is verified (named now)
- Semantics unchanged. These tests pass with every check as before:
test_fabric.c(334 checks);test_host_mesh.c, including the 26,814 disturbances;test_host_unit.c,test_host_depth.c,test_manage.c;test_mesh_boot.c;make -C v4 test test-32 sanitize hosted-check.
- The same machine. POST 990 of 990, and
dict_hashequal on all three ISAs and to today's value (0xa6bae4f1038dafd9). - The cost, measured as HEAT-OP's was (
logs/20261113-005047/heat-op/timing.txt):- five runs each, alternating OLD and NEW, of the host mesh boot;
- medians and instruction counts;
- then the kernel boots.
- The gate. The protocol on a clean tree: aarch64 inside its 570 s, with no timeout raised and no case cut.
6. For ruling
Run Step 0 (measure only), then bring back the data and the choice among A, B and C?