2019-04-14 11:11:13 -04:00
|
|
|
; core
|
|
|
|
;
|
|
|
|
; Routines used by pretty much all parts. You will want to include it first
|
|
|
|
; in your glue file.
|
|
|
|
|
|
|
|
; *** CONSTS ***
|
2019-06-14 22:14:09 -04:00
|
|
|
.equ ASCII_BS 0x08
|
2019-05-14 16:42:44 -04:00
|
|
|
.equ ASCII_CR 0x0d
|
|
|
|
.equ ASCII_LF 0x0a
|
2019-06-14 22:14:09 -04:00
|
|
|
.equ ASCII_DEL 0x7f
|
2019-04-14 11:11:13 -04:00
|
|
|
|
2019-04-23 13:29:16 -04:00
|
|
|
; *** DATA ***
|
|
|
|
; Useful data to point to, when a pointer is needed.
|
|
|
|
P_NULL: .db 0
|
|
|
|
|
2019-04-22 14:26:16 -04:00
|
|
|
; *** REGISTER FIDDLING ***
|
2019-04-14 11:11:13 -04:00
|
|
|
|
|
|
|
; add the value of A into DE
|
|
|
|
addDE:
|
2019-04-30 15:51:39 -04:00
|
|
|
push af
|
2019-04-14 11:11:13 -04:00
|
|
|
add a, e
|
|
|
|
jr nc, .end ; no carry? skip inc
|
|
|
|
inc d
|
|
|
|
.end:
|
|
|
|
ld e, a
|
2019-04-30 15:51:39 -04:00
|
|
|
pop af
|
2019-05-31 11:12:29 -04:00
|
|
|
noop: ; piggy backing on the first "ret" we have
|
2019-04-14 11:11:13 -04:00
|
|
|
ret
|
|
|
|
|
2019-10-10 14:44:23 -04:00
|
|
|
; copy (HL) into DE, then exchange the two, utilising the optimised HL instructions.
|
|
|
|
; ld must be done little endian, so least significant byte first.
|
|
|
|
intoHL:
|
|
|
|
push de
|
|
|
|
ld e, (hl)
|
|
|
|
inc hl
|
|
|
|
ld d, (hl)
|
|
|
|
ex de, hl
|
|
|
|
pop de
|
2019-04-15 15:08:00 -04:00
|
|
|
ret
|
|
|
|
|
2019-10-10 14:44:23 -04:00
|
|
|
intoDE:
|
|
|
|
ex de, hl
|
|
|
|
call intoHL
|
|
|
|
ex de, hl ; de preserved by intoHL, so no push/pop needed
|
2019-04-23 13:29:16 -04:00
|
|
|
ret
|
|
|
|
|
2019-06-04 11:53:02 -04:00
|
|
|
intoIX:
|
2019-10-10 14:44:23 -04:00
|
|
|
push ix
|
|
|
|
ex (sp), hl ;swap hl with ix, on the stack
|
|
|
|
call intoHL
|
|
|
|
ex (sp), hl ;restore hl from stack
|
|
|
|
pop ix
|
2019-06-04 11:53:02 -04:00
|
|
|
ret
|
|
|
|
|
2019-04-14 23:14:07 -04:00
|
|
|
; add the value of A into HL
|
addHL and subHL affect flags, and are smaller (#30)
* addHL and subHL affect flags, and are smaller
Most importantly, addHL and subHL now affect the flags as you would expect from a 16 bit addition/subtraction. This seems like it'd be preferred behaviour, however I realise any code relying on it not affecting flags would break. One byte saved in addHL, and two bytes saved in subHL. Due to the branching nature of the original code, it's difficult to compare speeds, subHL is either 1 or 6 cycles faster depending on branching, and addHL is between -1 and 3 cycles faster. If the chance of a carry is 50%, addHL is expected to be a cycle faster, but for a chance of carry below 25% (so a < 0x40) this will be up to a cycle slower.
* Update core.asm
* Reworked one use of addHL
By essentially inlining both addHL and cpHLDE, 100 cycles are saved, but due to the registers not needing preserving, a byte is saved too.
* Corrected spelling error in comment
* Reworked second use of addHL
43 cycles saved, and no more addHL in critical loops. No bytes saved or used.
* Fixed tabs and spacing, and made a comment clearer.
* Clearer comments
* Adopted push/pop notation
2019-10-17 16:45:27 -04:00
|
|
|
; affects carry flag according to the 16-bit addition, Z, S and P untouched.
|
2019-04-14 23:14:07 -04:00
|
|
|
addHL:
|
addHL and subHL affect flags, and are smaller (#30)
* addHL and subHL affect flags, and are smaller
Most importantly, addHL and subHL now affect the flags as you would expect from a 16 bit addition/subtraction. This seems like it'd be preferred behaviour, however I realise any code relying on it not affecting flags would break. One byte saved in addHL, and two bytes saved in subHL. Due to the branching nature of the original code, it's difficult to compare speeds, subHL is either 1 or 6 cycles faster depending on branching, and addHL is between -1 and 3 cycles faster. If the chance of a carry is 50%, addHL is expected to be a cycle faster, but for a chance of carry below 25% (so a < 0x40) this will be up to a cycle slower.
* Update core.asm
* Reworked one use of addHL
By essentially inlining both addHL and cpHLDE, 100 cycles are saved, but due to the registers not needing preserving, a byte is saved too.
* Corrected spelling error in comment
* Reworked second use of addHL
43 cycles saved, and no more addHL in critical loops. No bytes saved or used.
* Fixed tabs and spacing, and made a comment clearer.
* Clearer comments
* Adopted push/pop notation
2019-10-17 16:45:27 -04:00
|
|
|
push de
|
|
|
|
ld d, 0
|
|
|
|
ld e, a
|
|
|
|
add hl, de
|
|
|
|
pop de
|
2019-04-14 23:14:07 -04:00
|
|
|
ret
|
|
|
|
|
addHL and subHL affect flags, and are smaller (#30)
* addHL and subHL affect flags, and are smaller
Most importantly, addHL and subHL now affect the flags as you would expect from a 16 bit addition/subtraction. This seems like it'd be preferred behaviour, however I realise any code relying on it not affecting flags would break. One byte saved in addHL, and two bytes saved in subHL. Due to the branching nature of the original code, it's difficult to compare speeds, subHL is either 1 or 6 cycles faster depending on branching, and addHL is between -1 and 3 cycles faster. If the chance of a carry is 50%, addHL is expected to be a cycle faster, but for a chance of carry below 25% (so a < 0x40) this will be up to a cycle slower.
* Update core.asm
* Reworked one use of addHL
By essentially inlining both addHL and cpHLDE, 100 cycles are saved, but due to the registers not needing preserving, a byte is saved too.
* Corrected spelling error in comment
* Reworked second use of addHL
43 cycles saved, and no more addHL in critical loops. No bytes saved or used.
* Fixed tabs and spacing, and made a comment clearer.
* Clearer comments
* Adopted push/pop notation
2019-10-17 16:45:27 -04:00
|
|
|
|
2019-05-28 15:56:39 -04:00
|
|
|
; subtract the value of A from HL
|
addHL and subHL affect flags, and are smaller (#30)
* addHL and subHL affect flags, and are smaller
Most importantly, addHL and subHL now affect the flags as you would expect from a 16 bit addition/subtraction. This seems like it'd be preferred behaviour, however I realise any code relying on it not affecting flags would break. One byte saved in addHL, and two bytes saved in subHL. Due to the branching nature of the original code, it's difficult to compare speeds, subHL is either 1 or 6 cycles faster depending on branching, and addHL is between -1 and 3 cycles faster. If the chance of a carry is 50%, addHL is expected to be a cycle faster, but for a chance of carry below 25% (so a < 0x40) this will be up to a cycle slower.
* Update core.asm
* Reworked one use of addHL
By essentially inlining both addHL and cpHLDE, 100 cycles are saved, but due to the registers not needing preserving, a byte is saved too.
* Corrected spelling error in comment
* Reworked second use of addHL
43 cycles saved, and no more addHL in critical loops. No bytes saved or used.
* Fixed tabs and spacing, and made a comment clearer.
* Clearer comments
* Adopted push/pop notation
2019-10-17 16:45:27 -04:00
|
|
|
; affects flags according to the 16-bit subtraction.
|
2019-05-28 15:56:39 -04:00
|
|
|
subHL:
|
addHL and subHL affect flags, and are smaller (#30)
* addHL and subHL affect flags, and are smaller
Most importantly, addHL and subHL now affect the flags as you would expect from a 16 bit addition/subtraction. This seems like it'd be preferred behaviour, however I realise any code relying on it not affecting flags would break. One byte saved in addHL, and two bytes saved in subHL. Due to the branching nature of the original code, it's difficult to compare speeds, subHL is either 1 or 6 cycles faster depending on branching, and addHL is between -1 and 3 cycles faster. If the chance of a carry is 50%, addHL is expected to be a cycle faster, but for a chance of carry below 25% (so a < 0x40) this will be up to a cycle slower.
* Update core.asm
* Reworked one use of addHL
By essentially inlining both addHL and cpHLDE, 100 cycles are saved, but due to the registers not needing preserving, a byte is saved too.
* Corrected spelling error in comment
* Reworked second use of addHL
43 cycles saved, and no more addHL in critical loops. No bytes saved or used.
* Fixed tabs and spacing, and made a comment clearer.
* Clearer comments
* Adopted push/pop notation
2019-10-17 16:45:27 -04:00
|
|
|
push de
|
|
|
|
ld d, 0
|
|
|
|
ld e, a
|
|
|
|
or a ;reset carry flag
|
|
|
|
sbc hl, de ;There is no 'sub hl, de', so we must use sbc
|
|
|
|
pop de
|
2019-05-28 15:56:39 -04:00
|
|
|
ret
|
2019-04-15 16:53:11 -04:00
|
|
|
|
2019-05-31 11:12:29 -04:00
|
|
|
; Compare HL with DE and sets Z and C in the same way as a regular cp X where
|
|
|
|
; HL is A and DE is X.
|
|
|
|
cpHLDE:
|
2019-10-16 20:39:38 -04:00
|
|
|
push hl
|
|
|
|
or a ;reset carry flag
|
|
|
|
sbc hl, de ;There is no 'sub hl, de', so we must use sbc
|
|
|
|
pop hl
|
2019-07-23 22:59:10 -04:00
|
|
|
ret
|
2019-05-31 11:12:29 -04:00
|
|
|
|
2019-04-15 16:53:11 -04:00
|
|
|
; Write the contents of HL in (DE)
|
2019-10-16 20:39:38 -04:00
|
|
|
; de and hl are preserved, so no pushing/popping necessary
|
2019-04-15 16:53:11 -04:00
|
|
|
writeHLinDE:
|
2019-10-16 20:39:38 -04:00
|
|
|
ex de, hl
|
|
|
|
ld (hl), e
|
|
|
|
inc hl
|
|
|
|
ld (hl), d
|
|
|
|
dec hl
|
|
|
|
ex de, hl
|
2019-04-15 16:53:11 -04:00
|
|
|
ret
|
|
|
|
|
2019-06-04 11:53:02 -04:00
|
|
|
; Call the method (IX) is a pointer to. In other words, call intoIX before
|
|
|
|
; callIX
|
|
|
|
callIXI:
|
|
|
|
push ix
|
|
|
|
call intoIX
|
|
|
|
call callIX
|
|
|
|
pop ix
|
|
|
|
ret
|
|
|
|
|
2019-04-14 17:01:28 -04:00
|
|
|
; jump to the location pointed to by IX. This allows us to call IX instead of
|
2019-05-31 11:12:29 -04:00
|
|
|
; just jumping it. We use IX because we seldom use this for arguments.
|
2019-04-14 17:01:28 -04:00
|
|
|
callIX:
|
|
|
|
jp (ix)
|
|
|
|
|
2019-04-23 15:50:26 -04:00
|
|
|
callIY:
|
|
|
|
jp (iy)
|
|
|
|
|
2019-04-22 14:26:16 -04:00
|
|
|
; Ensures that Z is unset (more complicated than it sounds...)
|
|
|
|
unsetZ:
|
|
|
|
push bc
|
|
|
|
ld b, a
|
|
|
|
inc b
|
|
|
|
cp b
|
|
|
|
pop bc
|
|
|
|
ret
|
|
|
|
|
|
|
|
; *** STRINGS ***
|
|
|
|
|
2019-04-23 13:29:16 -04:00
|
|
|
; Fill B bytes at (HL) with A
|
|
|
|
fill:
|
|
|
|
push bc
|
|
|
|
push hl
|
|
|
|
.loop:
|
|
|
|
ld (hl), a
|
|
|
|
inc hl
|
|
|
|
djnz .loop
|
|
|
|
pop hl
|
|
|
|
pop bc
|
|
|
|
ret
|
|
|
|
|
2019-04-23 09:37:22 -04:00
|
|
|
; Increase HL until the memory address it points to is equal to A for a maximum
|
|
|
|
; of 0xff bytes. Returns the new HL value as well as the number of bytes
|
|
|
|
; iterated in A.
|
|
|
|
; If a null char is encountered before we find A, processing is stopped in the
|
|
|
|
; same way as if we found our char (so, we look for A *or* 0)
|
2019-05-14 15:26:29 -04:00
|
|
|
; Set Z if the character is found. Unsets it if not
|
2019-04-23 09:37:22 -04:00
|
|
|
findchar:
|
2019-04-14 13:56:04 -04:00
|
|
|
push bc
|
2019-04-23 09:37:22 -04:00
|
|
|
ld c, a ; let's use C as our cp target
|
2019-04-14 13:56:04 -04:00
|
|
|
ld a, 0xff
|
|
|
|
ld b, a
|
|
|
|
|
|
|
|
.loop: ld a, (hl)
|
2019-04-23 09:37:22 -04:00
|
|
|
cp c
|
2019-05-14 15:26:29 -04:00
|
|
|
jr z, .match
|
|
|
|
or a ; cp 0
|
|
|
|
jr z, .nomatch
|
2019-04-14 13:56:04 -04:00
|
|
|
inc hl
|
|
|
|
djnz .loop
|
2019-05-14 15:26:29 -04:00
|
|
|
.nomatch:
|
|
|
|
call unsetZ
|
|
|
|
jr .end
|
|
|
|
.match:
|
2019-04-14 13:56:04 -04:00
|
|
|
; We ran 0xff-B loops. That's the result that goes in A.
|
|
|
|
ld a, 0xff
|
2019-05-17 20:47:43 -04:00
|
|
|
sub b
|
2019-05-14 15:26:29 -04:00
|
|
|
cp a ; ensure Z
|
|
|
|
.end:
|
2019-04-14 13:56:04 -04:00
|
|
|
pop bc
|
|
|
|
ret
|
|
|
|
|
2019-04-14 11:11:13 -04:00
|
|
|
; Format the lower nibble of A into a hex char and stores the result in A.
|
|
|
|
fmtHex:
|
2019-05-14 16:42:44 -04:00
|
|
|
and 0xf
|
2019-04-14 11:11:13 -04:00
|
|
|
cp 10
|
|
|
|
jr nc, .alpha ; if >= 10, we have alpha
|
|
|
|
add a, '0'
|
|
|
|
ret
|
|
|
|
.alpha:
|
|
|
|
add a, 'A'-10
|
|
|
|
ret
|
|
|
|
|
|
|
|
; Formats value in A into a string hex pair. Stores it in the memory location
|
|
|
|
; that HL points to. Does *not* add a null char at the end.
|
|
|
|
fmtHexPair:
|
|
|
|
push af
|
|
|
|
|
|
|
|
; let's start with the rightmost char
|
|
|
|
inc hl
|
|
|
|
call fmtHex
|
|
|
|
ld (hl), a
|
|
|
|
|
|
|
|
; and now with the leftmost
|
|
|
|
dec hl
|
|
|
|
pop af
|
|
|
|
push af
|
2019-05-14 16:50:35 -04:00
|
|
|
and 0xf0
|
2019-04-14 11:11:13 -04:00
|
|
|
rra \ rra \ rra \ rra
|
|
|
|
call fmtHex
|
|
|
|
ld (hl), a
|
|
|
|
|
|
|
|
pop af
|
|
|
|
ret
|
|
|
|
|
|
|
|
; Compares strings pointed to by HL and DE up to A count of characters. If
|
|
|
|
; equal, Z is set. If not equal, Z is reset.
|
|
|
|
strncmp:
|
|
|
|
push bc
|
|
|
|
push hl
|
|
|
|
push de
|
|
|
|
|
|
|
|
ld b, a
|
|
|
|
.loop:
|
|
|
|
ld a, (de)
|
|
|
|
cp (hl)
|
2019-04-14 17:01:28 -04:00
|
|
|
jr nz, .end ; not equal? break early. NZ is carried out
|
|
|
|
; to the called
|
|
|
|
cp 0 ; If our chars are null, stop the cmp
|
|
|
|
jr z, .end ; The positive result will be carried to the
|
|
|
|
; caller
|
2019-04-14 11:11:13 -04:00
|
|
|
inc hl
|
|
|
|
inc de
|
|
|
|
djnz .loop
|
2019-04-14 17:01:28 -04:00
|
|
|
; We went through all chars with success, but our current Z flag is
|
|
|
|
; unset because of the cp 0. Let's do a dummy CP to set the Z flag.
|
|
|
|
cp a
|
2019-04-14 11:11:13 -04:00
|
|
|
|
|
|
|
.end:
|
|
|
|
pop de
|
|
|
|
pop hl
|
|
|
|
pop bc
|
|
|
|
; Because we don't call anything else than CP that modify the Z flag,
|
|
|
|
; our Z value will be that of the last cp (reset if we broke the loop
|
|
|
|
; early, set otherwise)
|
|
|
|
ret
|
|
|
|
|
|
|
|
; Transforms the character in A, if it's in the a-z range, into its upcase
|
|
|
|
; version.
|
|
|
|
upcase:
|
|
|
|
cp 'a'
|
|
|
|
ret c ; A < 'a'. nothing to do
|
|
|
|
cp 'z'+1
|
|
|
|
ret nc ; A >= 'z'+1. nothing to do
|
|
|
|
; 'a' - 'A' == 0x20
|
|
|
|
sub 0x20
|
|
|
|
ret
|
2019-04-14 13:56:04 -04:00
|
|
|
|