AnachronautandClaude Opus 5
ccf4b384e1
Five .asm files sat at the top of Programs/ beside six directories, with
nothing to say which a new file should join - and hello.asm, which is the
native assembler's first target and named in sixteen places, looked like a
stray.
Programs/
Examples/ what you read to learn: hello, printHello, inputTest,
replCalculator, and Fibonacci, primeSieve and gameOfLife
as sets of their own
Libraries/ included by name, no entry point of their own
Loader/ loader.asm, and the loadable program it reads
CosmOS/ the system, its applications and its assembler
testPrograms/ what 'make test' drives
Loader/ is the one worth explaining. loader.asm is not a demonstration: it
reads a program off a disk, puts the two pieces where the header asks, and
jumps to the entry. CosmOS grew out of it and does the same thing as one of
its commands. It is kept because backward compatibility with the simplest
version of the system is a standing goal, and it was sitting loose next to
the demos as though it were one.
Programs/loadable/ was a directory holding one file called hello.asm - a
third thing of that name, and the name said nothing about why it was there.
It is Loader/loadable.asm now, beside the loader that reads it.
Every reference moved with them: the makefile's program list, twelve
manifest lines, makedisks.sh, native.sh, and four paths across the README
and both manuals. Verified by deleting both build directories and running
the whole suite from nothing.
Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01E2JrLzFvuFX9fgi1LDRjrW
133 lines
1.8 KiB
NASM
133 lines
1.8 KiB
NASM
; A Fibonacci number generating program that uses four bytes to store the value.
|
|
|
|
#Include print.asm
|
|
|
|
#Program
|
|
start:
|
|
; Swap ValueB and ValueA.
|
|
; First, store ValueA on the stack.
|
|
SETD ValueA
|
|
LDA
|
|
PSHA
|
|
INCD
|
|
LDA
|
|
PSHA
|
|
INCD
|
|
LDA
|
|
PSHA
|
|
INCD
|
|
LDA
|
|
PSHA
|
|
; Next, store ValueB on the stack.
|
|
SETD ValueB
|
|
LDA
|
|
PSHA
|
|
INCD
|
|
LDA
|
|
PSHA
|
|
INCD
|
|
LDA
|
|
PSHA
|
|
INCD
|
|
LDA
|
|
PSHA
|
|
; Then pop ValueB into ValueA.
|
|
SETD ValueA
|
|
INCD INCD INCD
|
|
POPA
|
|
STA
|
|
DECD
|
|
POPA
|
|
STA
|
|
DECD
|
|
POPA
|
|
STA
|
|
DECD
|
|
POPA
|
|
STA
|
|
; Then pop ValueA into ValueB.
|
|
SETD ValueB
|
|
INCD INCD INCD
|
|
POPA
|
|
STA
|
|
DECD
|
|
POPA
|
|
STA
|
|
DECD
|
|
POPA
|
|
STA
|
|
DECD
|
|
POPA
|
|
STA
|
|
; Print ValueA.
|
|
SETD ValueA
|
|
INCD INCD INCD
|
|
LDA
|
|
CALL printByteHex
|
|
DECD
|
|
LDA
|
|
CALL printByteHex
|
|
DECD
|
|
LDA
|
|
CALL printByteHex
|
|
DECD
|
|
LDA
|
|
CALL printByteHex
|
|
CALL blankSpace
|
|
; Now add ValueA and ValueB, and store the result in ValueA.
|
|
; Add the lowest bytes of ValueA and ValueB.
|
|
SETD ValueB
|
|
LDB
|
|
SETD ValueA
|
|
LDA
|
|
ADD
|
|
; Store it in ValueA's lowest byte.
|
|
STQ
|
|
; Add the second lowest bytes of ValueA and ValueB.
|
|
SETD ValueB
|
|
INCD
|
|
LDB
|
|
SETD ValueA
|
|
INCD
|
|
LDA
|
|
ADD
|
|
; Store it in ValueA's second lowest byte.
|
|
STQ
|
|
; Add the second highest bytes of ValueA and ValueB.
|
|
SETD ValueB
|
|
INCD INCD
|
|
LDB
|
|
SETD ValueA
|
|
INCD INCD
|
|
LDA
|
|
ADD
|
|
; Store it in ValueA's third lowest byte.
|
|
STQ
|
|
; Add the highest bytes of ValueA and ValueB.
|
|
SETD ValueB
|
|
INCD INCD INCD
|
|
LDB
|
|
SETD ValueA
|
|
INCD INCD INCD
|
|
LDA
|
|
ADD
|
|
; If this addition overflows, we're done.
|
|
BRC end
|
|
; Otherwise, store the result in ValueA's highest byte.
|
|
STQ
|
|
; And branch back to the beginning of the loop.
|
|
BRI start
|
|
end:
|
|
CALL lineFeed
|
|
HALT
|
|
|
|
#Data
|
|
|
|
ValueA:
|
|
; Lowest byte ... Highest byte.
|
|
0x01 0x00 0x00 0x00
|
|
|
|
ValueB:
|
|
; Lowest byte ... Highest byte.
|
|
0x00 0x00 0x00 0x00
|