mirror of
https://github.com/hsoft/collapseos.git
synced 2024-11-14 17:28:05 +11:00
a9ed8da0b2
The previous approach of maintaining R> and W> pointers was conceptually simple, but made INT handler code actually quite complex. Now, we maintain indexes instead. It's much easier to perform bounds checks and to compare for equality, something we have to do quick in the INT handler.
17 lines
390 B
Plaintext
17 lines
390 B
Plaintext
Instructions list
|
|
|
|
r => A B C D E H L (HL)
|
|
d => BC DE HL AF/SP
|
|
c => CNZ CZ CNC CC CPO CPE CP CM
|
|
|
|
LD [rr, ri, di, (i)HL, HL(i), d(i), (i)d, rIXY, IXYr,
|
|
(DE)A, A(DE), (i)A, A(i)]
|
|
ADD [r, i, HLd, IXd, IXIX, IYd, IYIY]
|
|
ADC [r, HLd]
|
|
CP [r, i, (IXY+)]
|
|
SBC [r, HLd]
|
|
SUB [r, i]
|
|
PUSH POP
|
|
INC [r, d, (IXY+)] DEC [r, d, (IXY+)]
|
|
AND [r, i] OR [r, i] XOR [r, i] (cont.)
|