A lock lies on a range of bytes, it has two different kinds of owner, and it guards no byte at all
Built as a memo rather than a table: the thing worth hanging it up for reads across the room, with the full reference in smaller type below it.
Three sizes in one archive — from a sheet on the fridge to a poster on the wall.
The band is a real 32-byte file: four locks from four processes, the state of every byte measured by one more. Below — who owns a lock, and what it does not stop.
The two kinds of lock do not recognize each other as their own. The standard requires a description-owned lock to be refused when the same bytes already carry a process-owned one — “any process (including the calling process)” — so a process that took F_SETLK gets [EAGAIN] on its own F_OFD_SETLK request.
Checked both ways round: whichever kind is taken first, the second runs into it. One process, one file, no rival in sight — and a refusal.
Why the numbers can be trusted. Every countable number here is computed from data rather than typed in, and the sheet must pass 9 independent checks before it is allowed to build — how many items there are, the order they come in, and the claim in the highlighted box itself. If one fails, there is no file.
ten tasks, the year of each, the system, the figure — and the human it was measured against
all 128 positions: the column is the three high bits, the row is the four low ones
who published each standard, when, what it does to the sound, and how many bits per second it allows
forty bits to a quantum: five bytes, eight characters and five padding cases