Files
SplitBit-Emulator/Tests/expected/cosmosMonitor.out
T
AnachronautandClaude Opus 5 323d7a0330 A listing says what is left of the disk, and what will fit
dir said what was there and nothing about what was left. SplitDisk has
printed the free figure since it was written, so the machine's own
listing was the poorer of the two implementations at describing the same
disk.

  43 files, 3 directories
  46 of 64 entries, 1893 blocks free

Entries first, because they are the ceiling nobody notices until they hit
it: a disk of small files runs out of directory slots long before it runs
out of blocks.

COUNTED RATHER THAN ASKED. The superblock keeps a free count and this
file calls it "a note rather than the truth" in three places. sbfsSpace
reads the whole directory table instead, which costs a read per directory
block and is the answer rather than a guess. SplitDisk goes on reading
the note and saying when it is stale, which is the right place for that
check - the host tool is what you audit a disk with.

---- And it is a fact about the disk, not about where you are ----

The first version added the blocks up as the LISTING walked past them,
which cost no extra read and was wrong: that walk stops only on entries
in the working directory, so the same disk came out as 1,996 blocks free
from the root and 2,025 from /Apps. Comparing against SplitDisk is what
said so, which is what having two implementations is for.

---- The longest run, which is what decides whether a file fits ----

  4 of 16 entries, 37 blocks free
  the longest run is 25

Files are laid down contiguously, so the free total does not say whether
a file will fit. Both implementations learn it, from one specification.

Said only when it differs from the free total. Deleting is what fragments
a contiguous store, and a disk that has only been appended to has one gap
at the end - so on a healthy disk this is silent, and a line that appears
only when something is wrong is a line somebody reads.

There is no sort on this machine and the entries are in no order, so a
candidate walks the disk: each pass finds the used extent nearest at or
after it, and anything the candidate stands inside pushes it to the far
end and starts the pass again. The same trick allocating uses. So it
costs a pass per gap rather than per file - nearly nothing on a disk with
one gap, more the more fragmented the disk is, which is the right way
round.

holes.img is six files with the second and fourth deleted, because no
other disk here can show any of this: none of them has ever had anything
deleted from it.

Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01E2JrLzFvuFX9fgi1LDRjrW
2026-09-06 18:19:04 -04:00

141 lines
3.5 KiB
Plaintext

CosmOS
> monitor
x examine, d disassemble, a assemble, s set, b bank, g go, exit leaves
* b nonsense
b <program|data|number>
* b 9
there is no such bank
* load greet.sbx
loaded, starting at 5000
* b program
bank 00
* d 5000
5000 47 00 30 00 SETD.0 3000
5004 72 10 SWI 10
5006 47 00 30 44 SETD.0 3044
500A 72 10 SWI 10
500C 47 00 30 7A SETD.0 307A
5010 27 1F INIB 1F
5012 72 11 SWI 11
5014 47 00 30 5D SETD.0 305D
* x 5000
5000 47 00 30 00 72 10 47 00 30 44 72 10 47 00 30 7A G.0.r.G.0Dr.G.0z
5010 27 1F 72 11 47 00 30 5D 72 10 47 00 30 7A 72 10 '.r.G.0]r.G.0zr.
5020 47 00 30 65 72 10 20 72 12 00 00 00 00 00 00 00 G.0er. r........
5030 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 ................
* b data
bank 01
* x 3000
3000 61 20 70 72 6F 67 72 61 6D 2C 20 6C 6F 61 64 65 a program, loade
3010 64 20 6F 66 66 20 61 20 64 69 73 6B 2C 20 72 75 d off a disk, ru
3020 6E 6E 69 6E 67 20 6F 6E 20 74 68 65 20 73 79 73 nning on the sys
3030 74 65 6D 20 74 68 61 74 20 6C 6F 61 64 65 64 20 tem that loaded
* b 2
bank 02
* x 0
0000 01 FF 00 00 00 00 00 00 01 FF 00 00 00 00 00 00 ................
0010 03 FF 08 00 00 00 00 00 01 20 01 00 00 00 00 00 ......... ......
0020 00 FF 00 00 00 00 00 00 00 FF 00 00 00 00 00 00 ................
0030 00 FF 00 00 00 00 00 00 00 FF 00 00 00 00 00 00 ................
* s 0 FF
that bank will not be written
* b program
bank 00
* s 8000 26 48 D1 00 26 0A D1 00 18 12
* d 8000
8000 26 48 INIA 48
8002 D1 00 OUTA 00
8004 26 0A INIA 0A
8006 D1 00 OUTA 00
8008 18 SHR
8009 12 AND
800A 00 ?
800B 00 ?
* g 8000
H
that byte is not an instruction, at 800A
A 85 B 3F Q 05
the program was stopped
* d 8000
8000 26 48 INIA 48
8002 D1 00 OUTA 00
8004 26 0A INIA 0A
8006 D1 00 OUTA 00
8008 18 SHR
8009 12 AND
800A 00 ?
800B 00 ?
* b data
bank 01
* s 8100 68 65 6C 6C 6F 2C 20 74 79 70 65 64 0A 00
* b program
bank 00
* a 8200
8200: SETD.0 8100
8204: SWI 10
8206: lda.2
8208: LDD.0.1
820B: frobnicate
no such instruction
820B: INIA
that one needs a value after it
820B: SWI 12
820D: .
* d 8200
8200 47 00 81 00 SETD.0 8100
8204 72 10 SWI 10
8206 42 02 LDA.2
8208 4A 00 01 LDD.0.1
820B 72 12 SWI 12
820D 00 ?
820E 00 ?
820F 00 ?
* g 8200
hello, typed
finished
* exit
> dir
greet.sbx 211
hello.sbx 53
Life.sbx 1396
Snake.sbx 2164
Keys.sbx 664
Say.sbx 156
Where.sbx 827
Break.sbx 149
Grid.sbx 571
Press.sbx 872
Mode.sbx 48
Flip.sbx 173
Sprite.sbx 442
Depth.sbx 672
Packages <dir>
Pad.sbx 264
Crash.sbx 632
vars.script 50
blocks.script 343
loops.script 272
tune.sbx 318
Play.sbx 2526
notes.txt 21
Apps <dir>
hi.script 121
bad.script 45
plain.script 24
cross.script 280
nonl.script 38
outer.script 376
inner.script 44
loop.script 35
hush.script 42
aloud.script 59
args.script 64
pass.script 20
holds.script 87
35 files, 2 directories
46 of 64 entries, 1893 blocks free
> exit
halted
Execution halted.
[exit 0]