mirror of
https://github.com/hsoft/collapseos.git
synced 2024-11-26 07:28:10 +11:00
Compare commits
3 Commits
289037a3dd
...
e3c885085d
Author | SHA1 | Date | |
---|---|---|---|
|
e3c885085d | ||
|
7ca54d179d | ||
|
73a5275b1e |
@ -74,8 +74,6 @@ There are decimal, hexadecimal and binary literals. A "straight" number is
|
|||||||
parsed as a decimal. Hexadecimal literals must be prefixed with `0x` (`0xf4`).
|
parsed as a decimal. Hexadecimal literals must be prefixed with `0x` (`0xf4`).
|
||||||
Binary must be prefixed with `0b` (`0b01100110`).
|
Binary must be prefixed with `0b` (`0b01100110`).
|
||||||
|
|
||||||
A decimal literal cannot start with `0`, with the exception of the `0` literal.
|
|
||||||
|
|
||||||
Decimals and hexadecimal are "flexible". Whether they're written in a byte or
|
Decimals and hexadecimal are "flexible". Whether they're written in a byte or
|
||||||
a word, you don't need to prefix them with zeroes. Watch out for overflow,
|
a word, you don't need to prefix them with zeroes. Watch out for overflow,
|
||||||
however.
|
however.
|
||||||
|
@ -84,15 +84,12 @@ varAssign:
|
|||||||
; Check if value at (HL) is a variable. If yes, returns its associated value.
|
; Check if value at (HL) is a variable. If yes, returns its associated value.
|
||||||
; Otherwise, jump to parseLiteral.
|
; Otherwise, jump to parseLiteral.
|
||||||
parseLiteralOrVar:
|
parseLiteralOrVar:
|
||||||
inc hl
|
call isLiteralPrefix
|
||||||
ld a, (hl)
|
jp z, parseLiteral
|
||||||
dec hl
|
; not a literal, try var
|
||||||
or a
|
|
||||||
; if more than one in length, it can't be a variable
|
|
||||||
jp nz, parseLiteral
|
|
||||||
ld a, (hl)
|
ld a, (hl)
|
||||||
call varChk
|
call varChk
|
||||||
jp nz, parseLiteral
|
ret nz
|
||||||
; It's a variable, resolve!
|
; It's a variable, resolve!
|
||||||
add a, a ; * 2 because each element is a word
|
add a, a ; * 2 because each element is a word
|
||||||
push hl ; --> lvl 1
|
push hl ; --> lvl 1
|
||||||
@ -102,5 +99,6 @@ parseLiteralOrVar:
|
|||||||
inc hl
|
inc hl
|
||||||
ld d, (hl)
|
ld d, (hl)
|
||||||
pop hl ; <-- lvl 1
|
pop hl ; <-- lvl 1
|
||||||
|
inc hl ; point to char after variable
|
||||||
cp a ; ensure Z
|
cp a ; ensure Z
|
||||||
ret
|
ret
|
||||||
|
@ -6,6 +6,8 @@
|
|||||||
; EXPR_PARSE: routine to call to parse literals or symbols that are part of
|
; EXPR_PARSE: routine to call to parse literals or symbols that are part of
|
||||||
; the expression. Routine's signature:
|
; the expression. Routine's signature:
|
||||||
; String in (HL), returns its parsed value to DE. Z for success.
|
; String in (HL), returns its parsed value to DE. Z for success.
|
||||||
|
; HL is advanced to the character following the last successfully
|
||||||
|
; read char.
|
||||||
;
|
;
|
||||||
; *** Code ***
|
; *** Code ***
|
||||||
;
|
;
|
||||||
@ -258,74 +260,8 @@ _parseNumber:
|
|||||||
ret
|
ret
|
||||||
.skip1:
|
.skip1:
|
||||||
; End of special case 1
|
; End of special case 1
|
||||||
; Copy beginning of string to DE, we'll need it later
|
|
||||||
ld d, h
|
|
||||||
ld e, l
|
|
||||||
|
|
||||||
; Special case 2: we have a char literal. If we have a char literal, we
|
|
||||||
; don't want to go through the "_isOp" loop below because if that char
|
|
||||||
; is one of our operators, we're messing up our processing. So, set
|
|
||||||
; ourselves 3 chars further and continue from there. EXPR_PARSE will
|
|
||||||
; take care of validating those 3 chars.
|
|
||||||
cp 0x27 ; apostrophe (') char
|
|
||||||
jr nz, .skip2
|
|
||||||
; "'". advance HL by 3
|
|
||||||
inc hl \ inc hl \ inc hl
|
|
||||||
; End of special case 2
|
|
||||||
.skip2:
|
|
||||||
|
|
||||||
dec hl ; offset "inc-hl-before" in loop
|
|
||||||
.loop:
|
|
||||||
inc hl
|
|
||||||
ld a, (hl)
|
|
||||||
call _isOp
|
|
||||||
jr nz, .loop
|
|
||||||
; (HL) and A is an op or a null
|
|
||||||
push af ; --> lvl 1 save op
|
|
||||||
push hl ; --> lvl 2 save end of string
|
|
||||||
; temporarily put a null char instead of the op
|
|
||||||
xor a
|
|
||||||
ld (hl), a
|
|
||||||
ex de, hl ; rewind to beginning of number
|
|
||||||
call EXPR_PARSE ; --> DE
|
call EXPR_PARSE ; --> DE
|
||||||
ex af, af' ; keep result flags away while we restore (HL)
|
|
||||||
pop hl ; <-- lvl 2, end of string
|
|
||||||
pop af ; <-- lvl 1, saved op
|
|
||||||
ld (hl), a
|
|
||||||
ex af, af' ; restore Z from EXPR_PARSE
|
|
||||||
ret nz
|
ret nz
|
||||||
; HL is currently at the end of the number's string
|
; Check if (HL) points to null or op
|
||||||
; On success, have A be the operator char following the number
|
ld a, (hl)
|
||||||
ex af, af'
|
|
||||||
ret
|
ret
|
||||||
|
|
||||||
; Sets Z if A contains a valid operator char or a null char.
|
|
||||||
_isOp:
|
|
||||||
or a
|
|
||||||
ret z
|
|
||||||
push hl ; --> lvl 1
|
|
||||||
; Set A' to zero for quick end-of-table checks
|
|
||||||
ex af, af'
|
|
||||||
xor a
|
|
||||||
ex af, af'
|
|
||||||
ld hl, .exprChars
|
|
||||||
.loop:
|
|
||||||
cp (hl)
|
|
||||||
jr z, .found
|
|
||||||
ex af, af'
|
|
||||||
cp (hl)
|
|
||||||
jr z, .notFound ; end of table
|
|
||||||
ex af, af'
|
|
||||||
inc hl ; next char
|
|
||||||
jr .loop
|
|
||||||
.notFound:
|
|
||||||
ex af, af' ; restore orig A
|
|
||||||
inc a ; unset Z
|
|
||||||
.found:
|
|
||||||
; Z already set
|
|
||||||
pop hl ; <-- lvl 1
|
|
||||||
ret
|
|
||||||
|
|
||||||
.exprChars:
|
|
||||||
.db "+-*/%&|^{}", 0
|
|
||||||
|
|
||||||
|
@ -135,45 +135,30 @@ parseHexadecimal:
|
|||||||
|
|
||||||
; Parse string at (HL) as a binary value (010101) without the "0b" prefix and
|
; Parse string at (HL) as a binary value (010101) without the "0b" prefix and
|
||||||
; return value in E. D is always zero.
|
; return value in E. D is always zero.
|
||||||
|
; HL is advanced to the character following the last successfully read char.
|
||||||
; Sets Z on success.
|
; Sets Z on success.
|
||||||
parseBinaryLiteral:
|
parseBinaryLiteral:
|
||||||
push bc
|
ld de, 0
|
||||||
push hl
|
|
||||||
call strlen
|
|
||||||
or a
|
|
||||||
jr z, .error ; empty, error
|
|
||||||
cp 9
|
|
||||||
jr nc, .error ; >= 9, too long
|
|
||||||
; We have a string of 8 or less chars. What we'll do is that for each
|
|
||||||
; char, we rotate left and set the LSB according to whether we have '0'
|
|
||||||
; or '1'. Error out on anything else. C is our stored result.
|
|
||||||
ld b, a ; we loop for "strlen" times
|
|
||||||
ld c, 0 ; our stored result
|
|
||||||
.loop:
|
.loop:
|
||||||
rlc c
|
|
||||||
ld a, (hl)
|
ld a, (hl)
|
||||||
|
add a, 0xff-'1'
|
||||||
|
sub 0xff-1
|
||||||
|
jr c, .end
|
||||||
|
rl e
|
||||||
|
add a, e
|
||||||
|
ld e, a
|
||||||
|
jp c, unsetZ ; overflow
|
||||||
inc hl
|
inc hl
|
||||||
cp '0'
|
jr .loop
|
||||||
jr z, .nobit ; no bit to set
|
|
||||||
cp '1'
|
|
||||||
jr nz, .error ; not 0 or 1
|
|
||||||
; We have a bit to set
|
|
||||||
inc c
|
|
||||||
.nobit:
|
|
||||||
djnz .loop
|
|
||||||
ld e, c
|
|
||||||
cp a ; ensure Z
|
|
||||||
jr .end
|
|
||||||
.error:
|
|
||||||
call unsetZ
|
|
||||||
.end:
|
.end:
|
||||||
pop hl
|
; HL is properly set
|
||||||
pop bc
|
xor a ; ensure Z
|
||||||
ret
|
ret
|
||||||
|
|
||||||
; Parses the string at (HL) and returns the 16-bit value in DE. The string
|
; Parses the string at (HL) and returns the 16-bit value in DE. The string
|
||||||
; can be a decimal literal (1234), a hexadecimal literal (0x1234) or a char
|
; can be a decimal literal (1234), a hexadecimal literal (0x1234) or a char
|
||||||
; literal ('X').
|
; literal ('X').
|
||||||
|
; HL is advanced to the character following the last successfully read char.
|
||||||
;
|
;
|
||||||
; As soon as the number doesn't fit 16-bit any more, parsing stops and the
|
; As soon as the number doesn't fit 16-bit any more, parsing stops and the
|
||||||
; number is invalid. If the number is valid, Z is set, otherwise, unset.
|
; number is invalid. If the number is valid, Z is set, otherwise, unset.
|
||||||
@ -182,58 +167,57 @@ parseLiteral:
|
|||||||
ld a, (hl)
|
ld a, (hl)
|
||||||
cp 0x27 ; apostrophe
|
cp 0x27 ; apostrophe
|
||||||
jr z, .char
|
jr z, .char
|
||||||
|
call isDigit
|
||||||
|
ret nz
|
||||||
cp '0'
|
cp '0'
|
||||||
jr z, .hexOrBin
|
jp nz, parseDecimal
|
||||||
push hl
|
; maybe hex, maybe binary
|
||||||
call parseDecimalC
|
inc hl
|
||||||
pop hl
|
ld a, (hl)
|
||||||
ret
|
inc hl ; already place it for hex or bin
|
||||||
|
cp 'x'
|
||||||
|
jr z, parseHexadecimal
|
||||||
|
cp 'b'
|
||||||
|
jr z, parseBinaryLiteral
|
||||||
|
; nope, just a regular decimal
|
||||||
|
dec hl \ dec hl
|
||||||
|
jp parseDecimal
|
||||||
|
|
||||||
; Parse string at (HL) and, if it is a char literal, sets Z and return
|
; Parse string at (HL) and, if it is a char literal, sets Z and return
|
||||||
; corresponding value in E. D is always zero.
|
; corresponding value in E. D is always zero.
|
||||||
|
; HL is advanced to the character following the last successfully read char.
|
||||||
;
|
;
|
||||||
; A valid char literal starts with ', ends with ' and has one character in the
|
; A valid char literal starts with ', ends with ' and has one character in the
|
||||||
; middle. No escape sequence are accepted, but ''' will return the apostrophe
|
; middle. No escape sequence are accepted, but ''' will return the apostrophe
|
||||||
; character.
|
; character.
|
||||||
.char:
|
.char:
|
||||||
push hl
|
|
||||||
inc hl
|
inc hl
|
||||||
|
ld e, (hl) ; our result
|
||||||
inc hl
|
inc hl
|
||||||
cp (hl)
|
cp (hl)
|
||||||
jr nz, .charEnd ; not ending with an apostrophe
|
jr nz, .charError ; not ending with an apostrophe
|
||||||
|
; good char, advance HL and return
|
||||||
inc hl
|
inc hl
|
||||||
ld a, (hl)
|
; Z already set
|
||||||
or a ; cp 0
|
ret
|
||||||
jr nz, .charEnd ; string has to end there
|
.charError:
|
||||||
; Valid char, good
|
; In all error conditions, HL is advanced by 2. Rewind.
|
||||||
dec hl
|
dec hl \ dec hl
|
||||||
dec hl
|
; NZ already set
|
||||||
ld e, (hl)
|
|
||||||
cp a ; ensure Z
|
|
||||||
.charEnd:
|
|
||||||
pop hl
|
|
||||||
ret
|
ret
|
||||||
|
|
||||||
.hexOrBin:
|
|
||||||
inc hl
|
|
||||||
ld a, (hl)
|
|
||||||
inc hl ; already place it for hex or bin
|
|
||||||
cp 'x'
|
|
||||||
jr z, .hex
|
|
||||||
cp 'b'
|
|
||||||
jr z, .bin
|
|
||||||
; special case: single '0'. set Z if we hit have null terminating.
|
|
||||||
or a
|
|
||||||
.hexOrBinEnd:
|
|
||||||
dec hl \ dec hl ; replace HL
|
|
||||||
ret ; Z already set
|
|
||||||
|
|
||||||
.hex:
|
; Returns whether A is a literal prefix, that is, a digit or an apostrophe.
|
||||||
push hl
|
isLiteralPrefix:
|
||||||
call parseHexadecimal
|
cp 0x27 ; apostrophe
|
||||||
pop hl
|
ret z
|
||||||
jr .hexOrBinEnd
|
; continue to isDigit
|
||||||
|
|
||||||
.bin:
|
; Returns whether A is a digit
|
||||||
call parseBinaryLiteral
|
isDigit:
|
||||||
jr .hexOrBinEnd
|
cp '0'
|
||||||
|
jp c, unsetZ
|
||||||
|
cp '9'+1
|
||||||
|
jp nc, unsetZ
|
||||||
|
cp a ; ensure Z
|
||||||
|
ret
|
||||||
|
@ -1,27 +1,26 @@
|
|||||||
; Parse string in (HL) and return its numerical value whether its a number
|
; Parse string in (HL) and return its numerical value whether its a number
|
||||||
; literal or a symbol. Returns value in DE.
|
; literal or a symbol. Returns value in DE.
|
||||||
|
; HL is advanced to the character following the last successfully read char.
|
||||||
; Sets Z if number or symbol is valid, unset otherwise.
|
; Sets Z if number or symbol is valid, unset otherwise.
|
||||||
parseNumberOrSymbol:
|
parseNumberOrSymbol:
|
||||||
call parseLiteral
|
call isLiteralPrefix
|
||||||
ret z
|
jp z, parseLiteral
|
||||||
; Not a number.
|
; Not a number. try symbol
|
||||||
; Is str a single char? If yes, maybe it's a special symbol.
|
|
||||||
call strIs1L
|
|
||||||
jr nz, .symbol ; nope
|
|
||||||
ld a, (hl)
|
ld a, (hl)
|
||||||
cp '$'
|
cp '$'
|
||||||
jr z, .returnPC
|
jr z, .PC
|
||||||
cp '@'
|
cp '@'
|
||||||
jr nz, .symbol
|
jr z, .lastVal
|
||||||
; last val
|
call symParse
|
||||||
ld de, (DIREC_LASTVAL)
|
ret nz
|
||||||
ret
|
; HL at end of symbol name, DE at tmp null-terminated symname.
|
||||||
.symbol:
|
push hl ; --> lvl 1
|
||||||
|
ex de, hl
|
||||||
call symFindVal ; --> DE
|
call symFindVal ; --> DE
|
||||||
jr nz, .notfound
|
pop hl ; <-- lvl 1
|
||||||
ret
|
ret z
|
||||||
.notfound:
|
; not found
|
||||||
; If not found, check if we're in first pass. If we are, it doesn't
|
; When not found, check if we're in first pass. If we are, it doesn't
|
||||||
; matter that we didn't find our symbol. Return success anyhow.
|
; matter that we didn't find our symbol. Return success anyhow.
|
||||||
; Otherwise return error. Z is already unset, so in fact, this is the
|
; Otherwise return error. Z is already unset, so in fact, this is the
|
||||||
; same as jumping to zasmIsFirstPass
|
; same as jumping to zasmIsFirstPass
|
||||||
@ -30,9 +29,17 @@ parseNumberOrSymbol:
|
|||||||
ld de, 0
|
ld de, 0
|
||||||
jp zasmIsFirstPass
|
jp zasmIsFirstPass
|
||||||
|
|
||||||
.returnPC:
|
.PC:
|
||||||
push hl
|
ex de, hl
|
||||||
call zasmGetPC
|
call zasmGetPC ; --> HL
|
||||||
ex de, hl ; result in DE
|
ex de, hl ; result in DE
|
||||||
pop hl
|
inc hl ; char after last read
|
||||||
|
; Z already set from cp '$'
|
||||||
|
ret
|
||||||
|
|
||||||
|
.lastVal:
|
||||||
|
; last val
|
||||||
|
ld de, (DIREC_LASTVAL)
|
||||||
|
inc hl ; char after last read
|
||||||
|
; Z already set from cp '@'
|
||||||
ret
|
ret
|
||||||
|
@ -9,6 +9,12 @@
|
|||||||
; first pass" whenever we encounter a new context. That is, we wipe the local
|
; first pass" whenever we encounter a new context. That is, we wipe the local
|
||||||
; registry, parse the code until the next global symbol (or EOF), then rewind
|
; registry, parse the code until the next global symbol (or EOF), then rewind
|
||||||
; and continue second pass as usual.
|
; and continue second pass as usual.
|
||||||
|
;
|
||||||
|
; What is a symbol name? The accepted characters for a symbol are A-Z, a-z, 0-9
|
||||||
|
; dot (.) and underscore (_).
|
||||||
|
; This unit doesn't disallow symbols starting with a digit, but in effect, they
|
||||||
|
; aren't going to work because parseLiteral is going to get that digit first.
|
||||||
|
; So, make your symbols start with a letter or dot or underscore.
|
||||||
|
|
||||||
; *** Constants ***
|
; *** Constants ***
|
||||||
; Size of each record in registry
|
; Size of each record in registry
|
||||||
@ -18,6 +24,9 @@
|
|||||||
|
|
||||||
.equ SYM_LOC_REGSIZE ZASM_LREG_BUFSZ+1+ZASM_LREG_MAXCNT*SYM_RECSIZE
|
.equ SYM_LOC_REGSIZE ZASM_LREG_BUFSZ+1+ZASM_LREG_MAXCNT*SYM_RECSIZE
|
||||||
|
|
||||||
|
; Maximum name length for a symbol
|
||||||
|
.equ SYM_NAME_MAXLEN 0x20
|
||||||
|
|
||||||
; *** Variables ***
|
; *** Variables ***
|
||||||
; A registry has three parts: record count (byte) record list and names pool.
|
; A registry has three parts: record count (byte) record list and names pool.
|
||||||
; A record is a 3 bytes structure:
|
; A record is a 3 bytes structure:
|
||||||
@ -34,9 +43,11 @@
|
|||||||
|
|
||||||
; Global labels registry
|
; Global labels registry
|
||||||
.equ SYM_GLOB_REG SYM_RAMSTART
|
.equ SYM_GLOB_REG SYM_RAMSTART
|
||||||
.equ SYM_LOC_REG SYM_GLOB_REG+SYM_REGSIZE
|
.equ SYM_LOC_REG @+SYM_REGSIZE
|
||||||
.equ SYM_CONST_REG SYM_LOC_REG+SYM_LOC_REGSIZE
|
.equ SYM_CONST_REG @+SYM_LOC_REGSIZE
|
||||||
.equ SYM_RAMEND SYM_CONST_REG+SYM_REGSIZE
|
; Area where we parse symbol names into
|
||||||
|
.equ SYM_TMPNAME @+SYM_REGSIZE
|
||||||
|
.equ SYM_RAMEND @+SYM_NAME_MAXLEN+1
|
||||||
|
|
||||||
; *** Registries ***
|
; *** Registries ***
|
||||||
; A symbol registry is a 5 bytes record with points to the name pool then the
|
; A symbol registry is a 5 bytes record with points to the name pool then the
|
||||||
@ -267,3 +278,63 @@ _symIsFull:
|
|||||||
pop hl
|
pop hl
|
||||||
ret
|
ret
|
||||||
|
|
||||||
|
; Parse string (HL) as far as it can for a valid symbol name (see definition in
|
||||||
|
; comment at top) for a maximum of SYM_NAME_MAXLEN characters. Puts the parsed
|
||||||
|
; symbol, null-terminated, in SYM_TMPNAME. Make DE point to SYM_TMPNAME.
|
||||||
|
; HL is advanced to the character following the last successfully read char.
|
||||||
|
; Z for success.
|
||||||
|
; Error conditions:
|
||||||
|
; 1 - No character parsed.
|
||||||
|
; 2 - name too long.
|
||||||
|
symParse:
|
||||||
|
ld de, SYM_TMPNAME
|
||||||
|
push bc
|
||||||
|
; +1 because we want to loop one extra time to see if the char is good
|
||||||
|
; or bad. If it's bad, then fine, proceed as normal. If it's good, then
|
||||||
|
; its going to go through djnz and we can return an error then.
|
||||||
|
ld b, SYM_NAME_MAXLEN+1
|
||||||
|
.loop:
|
||||||
|
ld a, (hl)
|
||||||
|
; Set it directly, even if we don't know yet if it's good
|
||||||
|
ld (de), a
|
||||||
|
or a ; end of string?
|
||||||
|
jr z, .end ; easy ending, Z set, HL set
|
||||||
|
; Check special symbols first
|
||||||
|
cp '.'
|
||||||
|
jr z, .good
|
||||||
|
cp '_'
|
||||||
|
jr z, .good
|
||||||
|
; lowercase
|
||||||
|
or 0x20
|
||||||
|
cp '0'
|
||||||
|
jr c, .bad
|
||||||
|
cp '9'+1
|
||||||
|
jr c, .good
|
||||||
|
cp 'a'
|
||||||
|
jr c, .bad
|
||||||
|
cp 'z'+1
|
||||||
|
jr nc, .bad
|
||||||
|
.good:
|
||||||
|
; character is valid, continue!
|
||||||
|
inc hl
|
||||||
|
inc de
|
||||||
|
djnz .loop
|
||||||
|
; error: string too long
|
||||||
|
; NZ is already set from cp 'z'+1
|
||||||
|
; HL is one char too far
|
||||||
|
dec hl
|
||||||
|
jr .end
|
||||||
|
.bad:
|
||||||
|
; invalid char, stop where we are.
|
||||||
|
; In all cases, we want to null-terminate that string
|
||||||
|
xor a
|
||||||
|
ld (de), a
|
||||||
|
; HL is good. Now, did we succeed? to know, let's see where B is.
|
||||||
|
ld a, b
|
||||||
|
cp SYM_NAME_MAXLEN+1
|
||||||
|
; Our result is the invert of Z
|
||||||
|
call toggleZ
|
||||||
|
.end:
|
||||||
|
ld de, SYM_TMPNAME
|
||||||
|
pop bc
|
||||||
|
ret
|
||||||
|
@ -30,16 +30,6 @@ toggleZ:
|
|||||||
cp a
|
cp a
|
||||||
ret
|
ret
|
||||||
|
|
||||||
; Sets Z if string at (HL) is one character long
|
|
||||||
strIs1L:
|
|
||||||
xor a
|
|
||||||
cp (hl)
|
|
||||||
jp z, unsetZ ; empty string
|
|
||||||
inc hl
|
|
||||||
cp (hl) ; Z has proper value
|
|
||||||
dec hl ; doesn't touch Z
|
|
||||||
ret
|
|
||||||
|
|
||||||
; Compares strings pointed to by HL and DE up to A count of characters in a
|
; Compares strings pointed to by HL and DE up to A count of characters in a
|
||||||
; case-insensitive manner.
|
; case-insensitive manner.
|
||||||
; If equal, Z is set. If not equal, Z is reset.
|
; If equal, Z is set. If not equal, Z is reset.
|
||||||
|
@ -28,7 +28,6 @@ int main()
|
|||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
emul_loop();
|
emul_loop();
|
||||||
if (m->cpu.R1.wr.HL)
|
|
||||||
return m->cpu.R1.br.A;
|
return m->cpu.R1.br.A;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -37,6 +37,37 @@ assertNZ:
|
|||||||
.msg:
|
.msg:
|
||||||
.db "Z set", CR, LF, 0
|
.db "Z set", CR, LF, 0
|
||||||
|
|
||||||
|
assertC:
|
||||||
|
ret c
|
||||||
|
ld hl, .msg
|
||||||
|
call printstr
|
||||||
|
jp fail
|
||||||
|
.msg:
|
||||||
|
.db "C not set", CR, LF, 0
|
||||||
|
|
||||||
|
assertNC:
|
||||||
|
ret nc
|
||||||
|
ld hl, .msg
|
||||||
|
call printstr
|
||||||
|
jp fail
|
||||||
|
.msg:
|
||||||
|
.db "C set", CR, LF, 0
|
||||||
|
|
||||||
|
; Assert that A == B
|
||||||
|
assertEQB:
|
||||||
|
cp b
|
||||||
|
ret z
|
||||||
|
call printHex
|
||||||
|
call printcrlf
|
||||||
|
ld a, b
|
||||||
|
call printHex
|
||||||
|
call printcrlf
|
||||||
|
ld hl, .msg
|
||||||
|
call printstr
|
||||||
|
jp fail
|
||||||
|
.msg:
|
||||||
|
.db "A != B", CR, LF, 0
|
||||||
|
|
||||||
; Assert that HL == DE
|
; Assert that HL == DE
|
||||||
assertEQW:
|
assertEQW:
|
||||||
ld a, h
|
ld a, h
|
||||||
|
@ -128,9 +128,19 @@ testParseExpr:
|
|||||||
.dw 0x4080
|
.dw 0x4080
|
||||||
.db "FOO+BAR*4", 0
|
.db "FOO+BAR*4", 0
|
||||||
|
|
||||||
|
; "0" is a special case, let's test it
|
||||||
|
.t16:
|
||||||
|
.dw 0
|
||||||
|
.db "0", 0
|
||||||
|
|
||||||
|
; Another one that caused troubles
|
||||||
|
.t17:
|
||||||
|
.dw 123
|
||||||
|
.db "0+123", 0
|
||||||
|
|
||||||
.alltests:
|
.alltests:
|
||||||
.dw .t1, .t2, .t3, .t4, .t5, .t6, .t7, .t8, .t9, .t10, .t11, .t12
|
.dw .t1, .t2, .t3, .t4, .t5, .t6, .t7, .t8, .t9, .t10, .t11, .t12
|
||||||
.dw .t13, .t14, .t15, 0
|
.dw .t13, .t14, .t15, .t16, .t17, 0
|
||||||
|
|
||||||
; Ensure that stack is balanced on failure
|
; Ensure that stack is balanced on failure
|
||||||
testSPOnFail:
|
testSPOnFail:
|
||||||
|
@ -1,85 +1,195 @@
|
|||||||
jp test
|
jp test
|
||||||
|
|
||||||
|
.inc "ascii.h"
|
||||||
.inc "core.asm"
|
.inc "core.asm"
|
||||||
|
.equ STDIO_RAMSTART RAMSTART
|
||||||
|
.inc "stdio.asm"
|
||||||
|
.inc "common.asm"
|
||||||
|
.inc "lib/ari.asm"
|
||||||
.inc "lib/util.asm"
|
.inc "lib/util.asm"
|
||||||
|
.inc "lib/fmt.asm"
|
||||||
.inc "lib/parse.asm"
|
.inc "lib/parse.asm"
|
||||||
|
|
||||||
zasmGetPC:
|
|
||||||
ret
|
|
||||||
|
|
||||||
testNum: .db 1
|
|
||||||
|
|
||||||
test:
|
test:
|
||||||
ld sp, 0xffff
|
ld sp, 0xffff
|
||||||
|
|
||||||
call testParseHex
|
call testParseHex
|
||||||
call testParseHexadecimal
|
call testParseHexadecimal
|
||||||
|
call testParseDecimal
|
||||||
|
call testParseLiteral
|
||||||
|
|
||||||
; success
|
; success
|
||||||
xor a
|
xor a
|
||||||
halt
|
halt
|
||||||
|
|
||||||
testParseHex:
|
testParseHex:
|
||||||
ld a, '8'
|
ld hl, .allGood
|
||||||
call parseHex
|
ld ix, .testGood
|
||||||
jp c, fail
|
call testList
|
||||||
cp 8
|
ld hl, .allBad
|
||||||
jp nz, fail
|
ld ix, .testBad
|
||||||
call nexttest
|
jp testList
|
||||||
|
|
||||||
ld a, 'e'
|
.testGood:
|
||||||
|
ld a, (hl)
|
||||||
call parseHex
|
call parseHex
|
||||||
jp c, fail
|
call assertNC
|
||||||
cp 0xe
|
inc hl
|
||||||
jp nz, fail
|
ld b, (hl)
|
||||||
call nexttest
|
jp assertEQB
|
||||||
|
|
||||||
ld a, 'x'
|
.testBad:
|
||||||
|
ld a, (hl)
|
||||||
call parseHex
|
call parseHex
|
||||||
jp nc, fail
|
jp assertC
|
||||||
call nexttest
|
|
||||||
ret
|
.g1:
|
||||||
|
.db '8', 8
|
||||||
|
.g2:
|
||||||
|
.db 'e', 0xe
|
||||||
|
|
||||||
|
.allGood:
|
||||||
|
.dw .g1, .g2, 0
|
||||||
|
|
||||||
|
.b1:
|
||||||
|
.db 'x'
|
||||||
|
|
||||||
|
.allBad:
|
||||||
|
.dw .b1, 0
|
||||||
|
|
||||||
testParseHexadecimal:
|
testParseHexadecimal:
|
||||||
ld hl, .s99
|
ld hl, .allGood
|
||||||
|
ld ix, .testGood
|
||||||
|
jp testList
|
||||||
|
|
||||||
|
.testGood:
|
||||||
|
ld c, (hl)
|
||||||
|
inc hl
|
||||||
|
ld b, (hl)
|
||||||
|
inc hl
|
||||||
call parseHexadecimal
|
call parseHexadecimal
|
||||||
jp nz, fail
|
call assertZ
|
||||||
ld a, e
|
ld l, c
|
||||||
cp 0x99
|
ld h, b
|
||||||
jp nz, fail
|
jp assertEQW
|
||||||
call nexttest
|
|
||||||
|
|
||||||
ld hl, .saB
|
.g1:
|
||||||
call parseHexadecimal
|
.dw 0x99
|
||||||
jp nz, fail
|
.db "99", 0
|
||||||
ld a, e
|
.g2:
|
||||||
cp 0xab
|
.dw 0xab
|
||||||
jp nz, fail
|
.db "aB", 0
|
||||||
call nexttest
|
; The string "Foo" will not cause a failure. We will parse up to "o" and then
|
||||||
|
; stop.
|
||||||
|
.g3:
|
||||||
|
.dw 0xf
|
||||||
|
.db "Foo", 0
|
||||||
|
|
||||||
; The string "Foo" will not cause a failure. We will parse up to "o"
|
.allGood:
|
||||||
; and then stop.
|
.dw .g1, .g2, .g3, 0
|
||||||
ld hl, .sFoo
|
|
||||||
call parseHexadecimal
|
|
||||||
jp nz, fail
|
|
||||||
ld a, e
|
|
||||||
cp 0xf
|
|
||||||
call nexttest
|
|
||||||
ret
|
|
||||||
|
|
||||||
.sFoo: .db "Foo", 0
|
testParseDecimal:
|
||||||
.saB: .db "aB", 0
|
ld hl, .allGood
|
||||||
.s99: .db "99", 0
|
ld ix, .testGood
|
||||||
|
call testList
|
||||||
|
ld hl, .allBad
|
||||||
|
ld ix, .testBad
|
||||||
|
jp testList
|
||||||
|
|
||||||
nexttest:
|
.testGood:
|
||||||
ld a, (testNum)
|
ld c, (hl)
|
||||||
inc a
|
inc hl
|
||||||
ld (testNum), a
|
ld b, (hl)
|
||||||
ret
|
inc hl
|
||||||
|
call parseDecimalC
|
||||||
|
call assertZ
|
||||||
|
ld l, c
|
||||||
|
ld h, b
|
||||||
|
jp assertEQW
|
||||||
|
|
||||||
fail:
|
.testBad:
|
||||||
ld a, (testNum)
|
call parseDecimalC
|
||||||
halt
|
jp assertNZ
|
||||||
|
|
||||||
; used as RAM
|
.g1:
|
||||||
sandbox:
|
.dw 99
|
||||||
|
.db "99", 0
|
||||||
|
.g2:
|
||||||
|
.dw 65535
|
||||||
|
.db "65535", 0
|
||||||
|
; Space is also accepted as a number "ender"
|
||||||
|
.g3:
|
||||||
|
.dw 42
|
||||||
|
.db "42 x", 0
|
||||||
|
; Tab too
|
||||||
|
.g4:
|
||||||
|
.dw 42
|
||||||
|
.db "42", 0x09, 'x', 0
|
||||||
|
; A simple "0" works too!
|
||||||
|
.g5:
|
||||||
|
.dw 0
|
||||||
|
.db '0', 0
|
||||||
|
|
||||||
|
.allGood:
|
||||||
|
.dw .g1, .g2, .g3, .g4, .g5, 0
|
||||||
|
|
||||||
|
; null string is invalid
|
||||||
|
.b1:
|
||||||
|
.db 0
|
||||||
|
; too big, 5 chars
|
||||||
|
.b2:
|
||||||
|
.db "65536", 0
|
||||||
|
.b3:
|
||||||
|
.db "99999", 0
|
||||||
|
.b4:
|
||||||
|
; too big, 6 chars with rightmost chars being within bound
|
||||||
|
.db "111111", 0
|
||||||
|
|
||||||
|
.allBad:
|
||||||
|
.dw .b1, .b2, .b3, .b4, 0
|
||||||
|
|
||||||
|
testParseLiteral:
|
||||||
|
ld hl, .allGood
|
||||||
|
ld ix, .testGood
|
||||||
|
call testList
|
||||||
|
ld hl, .allBad
|
||||||
|
ld ix, .testBad
|
||||||
|
jp testList
|
||||||
|
|
||||||
|
.testGood:
|
||||||
|
ld c, (hl)
|
||||||
|
inc hl
|
||||||
|
ld b, (hl)
|
||||||
|
inc hl
|
||||||
|
call parseLiteral
|
||||||
|
call assertZ
|
||||||
|
ld l, c
|
||||||
|
ld h, b
|
||||||
|
jp assertEQW
|
||||||
|
|
||||||
|
.testBad:
|
||||||
|
call parseLiteral
|
||||||
|
jp assertNZ
|
||||||
|
|
||||||
|
.g1:
|
||||||
|
.dw 99
|
||||||
|
.db "99", 0
|
||||||
|
.g2:
|
||||||
|
.dw 0x100
|
||||||
|
.db "0x100", 0
|
||||||
|
.g3:
|
||||||
|
.dw 0b0101
|
||||||
|
.db "0b0101", 0
|
||||||
|
.g4:
|
||||||
|
.dw 0b01010101
|
||||||
|
.db "0b01010101", 0
|
||||||
|
|
||||||
|
.allGood:
|
||||||
|
.dw .g1, .g2, .g3, .g4, 0
|
||||||
|
|
||||||
|
.b1:
|
||||||
|
.db "Foo", 0
|
||||||
|
.allBad:
|
||||||
|
.dw .b1, 0
|
||||||
|
|
||||||
|
RAMSTART:
|
||||||
|
@ -1,175 +0,0 @@
|
|||||||
jp test
|
|
||||||
|
|
||||||
.inc "core.asm"
|
|
||||||
.inc "str.asm"
|
|
||||||
.inc "lib/util.asm"
|
|
||||||
.inc "zasm/util.asm"
|
|
||||||
.inc "lib/parse.asm"
|
|
||||||
|
|
||||||
; mocks. aren't used in tests
|
|
||||||
zasmGetPC:
|
|
||||||
zasmIsFirstPass:
|
|
||||||
symSelect:
|
|
||||||
symFindVal:
|
|
||||||
jp fail
|
|
||||||
|
|
||||||
testNum: .db 1
|
|
||||||
|
|
||||||
s99: .db "99", 0
|
|
||||||
s0x99: .db "0x99", 0
|
|
||||||
s0x100: .db "0x100", 0
|
|
||||||
s0b0101: .db "0b0101", 0
|
|
||||||
s0b01010101: .db "0b01010101", 0
|
|
||||||
sFoo: .db "Foo", 0
|
|
||||||
|
|
||||||
test:
|
|
||||||
ld sp, 0xffff
|
|
||||||
|
|
||||||
call testLiteral
|
|
||||||
call testDecimal
|
|
||||||
|
|
||||||
; success
|
|
||||||
xor a
|
|
||||||
halt
|
|
||||||
|
|
||||||
testLiteral:
|
|
||||||
ld hl, s99
|
|
||||||
call parseLiteral
|
|
||||||
jp nz, fail
|
|
||||||
ld a, d
|
|
||||||
or a
|
|
||||||
jp nz, fail
|
|
||||||
ld a, e
|
|
||||||
cp 99
|
|
||||||
jp nz, fail
|
|
||||||
call nexttest
|
|
||||||
|
|
||||||
ld hl, s0x100
|
|
||||||
call parseLiteral
|
|
||||||
jp nz, fail
|
|
||||||
ld a, d
|
|
||||||
cp 1
|
|
||||||
jp nz, fail
|
|
||||||
ld a, e
|
|
||||||
or a
|
|
||||||
jp nz, fail
|
|
||||||
call nexttest
|
|
||||||
|
|
||||||
ld hl, sFoo
|
|
||||||
call parseLiteral
|
|
||||||
jp z, fail
|
|
||||||
call nexttest
|
|
||||||
|
|
||||||
ld hl, s0b0101
|
|
||||||
call parseLiteral
|
|
||||||
jp nz, fail
|
|
||||||
ld a, d
|
|
||||||
or a
|
|
||||||
jp nz, fail
|
|
||||||
ld a, e
|
|
||||||
cp 0b0101
|
|
||||||
jp nz, fail
|
|
||||||
call nexttest
|
|
||||||
|
|
||||||
ld hl, s0b01010101
|
|
||||||
call parseLiteral
|
|
||||||
jp nz, fail
|
|
||||||
ld a, d
|
|
||||||
or a
|
|
||||||
jp nz, fail
|
|
||||||
ld a, e
|
|
||||||
cp 0b01010101
|
|
||||||
jp nz, fail
|
|
||||||
call nexttest
|
|
||||||
|
|
||||||
.equ FOO 0x42
|
|
||||||
.equ BAR @+1
|
|
||||||
ld a, BAR
|
|
||||||
cp 0x43
|
|
||||||
jp nz, fail
|
|
||||||
call nexttest
|
|
||||||
ret
|
|
||||||
|
|
||||||
testDecimal:
|
|
||||||
|
|
||||||
; test valid cases. We loop through tblDecimalValid for our cases
|
|
||||||
ld b, 5
|
|
||||||
ld hl, .valid
|
|
||||||
|
|
||||||
.loop1:
|
|
||||||
push hl ; --> lvl 1
|
|
||||||
; put expected number in IX
|
|
||||||
ld e, (hl)
|
|
||||||
inc hl
|
|
||||||
ld d, (hl)
|
|
||||||
inc hl
|
|
||||||
push de \ pop ix
|
|
||||||
call parseDecimalC ; --> DE
|
|
||||||
jp nz, fail
|
|
||||||
push ix \ pop hl ; push expected number in HL
|
|
||||||
ld a, h
|
|
||||||
cp d
|
|
||||||
jp nz, fail
|
|
||||||
ld a, l
|
|
||||||
cp e
|
|
||||||
jp nz, fail
|
|
||||||
pop hl ; <-- lvl 1
|
|
||||||
ld de, 8 ; row size
|
|
||||||
add hl, de
|
|
||||||
djnz .loop1
|
|
||||||
call nexttest
|
|
||||||
|
|
||||||
; test invalid cases. We loop through tblDecimalInvalid for our cases
|
|
||||||
ld b, 4
|
|
||||||
ld hl, .invalid
|
|
||||||
|
|
||||||
.loop2:
|
|
||||||
push hl
|
|
||||||
call parseDecimalC
|
|
||||||
pop hl
|
|
||||||
jp z, fail
|
|
||||||
ld de, 7 ; row size
|
|
||||||
add hl, de
|
|
||||||
djnz .loop2
|
|
||||||
call nexttest
|
|
||||||
ret
|
|
||||||
|
|
||||||
; 2b int, 6b str, null-padded
|
|
||||||
.valid:
|
|
||||||
.dw 99
|
|
||||||
.db "99", 0, 0, 0, 0
|
|
||||||
.dw 65535
|
|
||||||
.db "65535", 0
|
|
||||||
; Space is also accepted as a number "ender"
|
|
||||||
.dw 42
|
|
||||||
.db "42 x", 0, 0
|
|
||||||
; Tab too
|
|
||||||
.dw 42
|
|
||||||
.db "42", 0x09, 'x', 0, 0
|
|
||||||
; A simple "0" works too!
|
|
||||||
.dw 0
|
|
||||||
.db '0', 0, 0, 0, 0, 0
|
|
||||||
|
|
||||||
|
|
||||||
; 7b strings, null-padded
|
|
||||||
.invalid:
|
|
||||||
; null string is invalid
|
|
||||||
.db 0, 0, 0, 0, 0, 0, 0
|
|
||||||
; too big, 5 chars
|
|
||||||
.db "65536", 0, 0
|
|
||||||
.db "99999", 0, 0
|
|
||||||
; too big, 6 chars with rightmost chars being within bound
|
|
||||||
.db "111111", 0
|
|
||||||
|
|
||||||
|
|
||||||
nexttest:
|
|
||||||
ld a, (testNum)
|
|
||||||
inc a
|
|
||||||
ld (testNum), a
|
|
||||||
ret
|
|
||||||
|
|
||||||
fail:
|
|
||||||
ld a, (testNum)
|
|
||||||
halt
|
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user