Name the path walks after their entry points, keep the probe allocation-free, and record why the walks are four loops

2026-09-28 00:26:33 +02:00
parent 917c93564f
commit 68033bd42f
8 changed files with 35 additions and 29 deletions
@@ -110,3 +110,4 @@ In [docs/decisions.md](docs/decisions.md):
 - The US given names come from a mirror of the SSA file
 - `List` advertises direct descents only
 - Each entry point to `drawCheck.hasRead` says what its caller gets
+- The four path walks are four loops