Walks a word's code, opcode by opcode with the engine's own counts, and gives what it takes and leaves on both stacks, or why it has none. Called and in-line words; recursion, computed jumps, paths that meet at different depths and loops that leave a count have none. Test first: 23 checks failed against a stub. SWAP', UM/MOD, C@, C! and ROUNDTRIP agree with their stack comments. On the nucleus: 214 of 315 headers fixed. v4 test, test-32 and ASan+UBSan pass. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_017RzZgrf7V7Zk2iczBXDRbm
8 lines
410 B
Plaintext
8 lines
410 B
Plaintext
The nucleus's dictionary, analysed by effect.c (a one-off measurement; the program is not kept).
|
|
Each header's word, in line if its flag 8 is set, else as called; 64-bit cells.
|
|
headers 315 (in line 65): fixed 214, none 101
|
|
78 it calls a word with no fixed effect
|
|
4 it touches its caller's return address
|
|
8 two returns leave different depths
|
|
11 ; to an address of its own: a computed jump
|