sectorlisp/sectorlisp.S
2021-12-22 05:35:58 -08:00

333 lines
8.2 KiB
ArmAsm

/*-*- mode:unix-assembly; indent-tabs-mode:t; tab-width:8; coding:utf-8 -*-│
vi: set et ft=asm ts=8 tw=8 fenc=utf-8 :vi
Copyright 2020 Justine Alexandra Roberts Tunney
Copyright 2021 Alain Greppin
Some size optimisations by Peter Ferrie
Permission to use, copy, modify, and/or distribute this software for
any purpose with or without fee is hereby granted, provided that the
above copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
PERFORMANCE OF THIS SOFTWARE.
*/
// LISP meta-circular evaluator in a MBR
// Compatible with the original hardware
// This is the friendly extended version
// This adds (FOO . BAR) support to Read
// It print errors on undefined behavior
// It can also DEFINE persistent binding
.code16
.globl _start
_start: .asciz "NIL" # dec %si ; dec %cx ; dec %sp
kT: .asciz "T" # add %dl,(%si) boot A:\ DL=0
start: ljmp $0x7c00>>4,$begin # cs = 0x7c00 is boot address
.asciz ""
kDefine:.asciz "DEFINE"
kCond: .asciz "COND"
kQuote: .asciz "QUOTE"
kCar: .asciz "CAR" # ordering matters
kCdr: .asciz "CDR" # ordering matters
kCons: .asciz "CONS" # ordering matters
kEq: .asciz "EQ" # ordering matters
kAtom: .asciz "ATOM" # needs to be last
GetToken: # GetToken():al
mov %cx,%di
1: mov %dl,%al
cmp $' ',%al
jbe 2f
stosb
xchg %ax,%si
2: call GetChar # exchanges dx and ax
cmp $' ',%al
jbe 1b
cmp $')',%al
jbe 3f
cmp $')',%dl
ja 1b
3: mov %bh,(%di) # bh is zero
xchg %si,%ax
ret
.PrintList:
mov $'(',%al
2: push (%bx,%si)
mov (%si),%si
call .PutObject
mov $' ',%al
pop %si # restore 1
test %si,%si
js 2b # jump if cons
jz 4f # jump if nil
mov $249,%al # bullet (AB)
call .PutObject
4: mov $')',%al
jmp PutChar
.PutObject: # .PutObject(c:al,x:si)
.PrintString: # nul-terminated in si
call PutChar # preserves si
PrintObject: # PrintObject(x:si,a:di)
test %si,%si # set sf=1 if cons
js .PrintList # jump if not cons
.PrintAtom:
lodsb
test %al,%al # test for nul terminator
jnz .PrintString # -> ret
ret
GetObject: # called just after GetToken
cmp $'(',%al
je GetList
# jmp Intern
Intern: push %cx # Intern(cx,di): ax
sub %cx,%di
inc %di
push %di
xor %di,%di
1: pop %cx
pop %si
push %si
push %cx
mov %di,%ax
cmp %bh,(%di)
je 8f
rep cmpsb # memcmp(di,si,cx)
je 9f
xor %ax,%ax
dec %di
2: scasb
jne 2b
jmp 1b
8: rep movsb # memcpy(di,si,cx)
9: pop %cx
pop %cx
ret
GetChar:xor %ax,%ax # GetCharal:dl
int $0x16 # get keystroke
PutChar:mov $0x0e,%ah # prints CP-437
push %bp # scroll up bug
int $0x10 # vidya service
pop %bp # scroll up bug
cmp $'\r',%al # don't clobber
jne .retDx # look xchg ret
mov $'\n',%al
jmp PutChar
////////////////////////////////////////////////////////////////////////////////
Gc: cmp %dx,%di # Gc(x:di,A:dx,B:si):ax
jb .retDi # we assume immutable cells
push (%bx,%di) # mark prevents negative gc
mov (%di),%di
call Gc
pop %di
push %ax
call Gc
pop %di
call Cons
sub %si,%ax # ax -= C - B
add %dx,%ax
ret
Evlis: test %di,%di # Evlis(m:di,a:dx):ax
jz .retDi # jump if nil
push (%bx,%di) # save 1 Cdr(m)
mov (%di),%ax
call Eval
pop %di # restore 1
push %ax # save 2
call Evlis
# jmp xCons
xCons: pop %di # restore 2
Cons: xchg %di,%cx # Cons(m:di,a:ax):ax
mov %cx,(%di) # must preserve si
mov %ax,(%bx,%di)
lea 4(%di),%cx
.retDi: xchg %di,%ax
ret
GetList:call GetToken
cmp $')',%al
je .retF
cmp $'.',%al # FRIENDLY FEATURE
je 1f # CONS DOT LITERAL
call GetObject
push %ax # popped by xCons
call GetList
jmp xCons
1: call Read
push %ax
call GetList
pop %ax
ret
.retDx: xchg %dx,%ax
ret
.resolv:push %si
call Assoc # do (fn si) ((λ ...) si)
pop %si
Apply: test %ax,%ax # Apply(fn:ax,x:si:a:dx):ax
jns .switch # jump if atom
xchg %ax,%di # di = fn
.lambda:mov (%bx,%di),%di # di = Cdr(fn)
push %di # for .EvCadr
mov (%di),%di # di = Cadr(fn)
Pairlis:test %di,%di # Pairlis(x:di,y:si,a:dx):dx
jz .EvCadr # return if x is nil
xor %ax,%ax # FRIENDLY FEATURE
test %si,%si # DEFAULT NIL ARGS
jz 1f
lodsw # ax = Car(y)
mov (%si),%si # si = Cdr(y)
1: push (%bx,%di) # push Cdr(x)
mov (%di),%di # di = Car(x)
call Cons # Cons(Car(x),Car(y))
xchg %ax,%di
xchg %dx,%ax
call Cons # Cons(Cons(Car(x),Car(y)),a)
xchg %ax,%dx # a = new list
pop %di # grab Cdr(x)
jmp Pairlis
.switch:cmp $kAtom,%ax # eq is last builtin atom
ja .resolv # ah is zero if not above
mov (%si),%di # di = Car(x)
je .ifAtom
cmp $kCons,%ax
jae .ifCons
test %di,%di # FRIENDLY FEATURE
jns .retF # CAR/CDR(NIL)NIL
.ifCar: cmp $kCar,%al
je Car
.ifCdr: jmp Cdr
.ifCons:mov (%bx,%si),%si # si = Cdr(x)
lodsw # si = Cadr(x)
je Cons
.isEq: xor %di,%ax # we know for certain it's eq
jne .retF
.retT: mov $kT,%al
ret
.ifAtom:test %di,%di # test if atom
jns .retT
.retF: xor %ax,%ax # ax = nil
ret
Define: xchg %dx,%ax
call Cons
jmp .retDx
Assoc: mov %dx,%si # Assoc(x:ax,y:dx):ax
1: test %si,%si # FRIENDLY FEATURE
jns Undef # PRINT ?X IF XDX
mov (%si),%di
mov (%bx,%si),%si
scasw
jne 1b
.byte 0xf6
Cadr: mov (%bx,%di),%di # contents of decrement register
.byte 0x3C # cmp §scasw,%al (nop next byte)
Cdr: scasw # increments our data index by 2
Car: mov (%di),%ax # contents of address register!!
ret
1: mov (%bx,%di),%di # di = Cdr(c)
Evcon: push %di # save c
mov (%di),%si # di = Car(c)
lodsw # ax = Caar(c)
call Eval
pop %di # restore c
test %ax,%ax # nil test
jz 1b
push (%di) # push Car(c)
.EvCadr:pop %di
call Cadr # ax = Cadar(c)
# jmp Eval
Eval: test %ax,%ax # Eval(e:ax,a:dx):ax
jz 1f
jns Assoc # lookup val if atom
xchg %ax,%si # di = e
lodsw # ax = Car(e)
cmp $kQuote,%ax # maybe CONS
mov (%si),%di # di = Cdr(e)
je Car
cmp $kCond,%ax
je Evcon # ABC Garbage Collector
jb Define
push %dx # save a
push %cx # save A
push %ax
call Evlis
xchg %ax,%si
pop %ax
call Apply
pop %dx # restore A
mov %cx,%si # si = B
xchg %ax,%di
call Gc
mov %dx,%di # di = A
sub %si,%cx # cx = C - B
rep movsb
mov %di,%cx # cx = A + (C - B)
pop %dx # restore a
1: ret
Undef: push %ax
mov $'?',%al
call PutChar
pop %ax
jmp Catch
Read: call GetToken
call GetObject
ret
begin: mov $0x8000,%sp
push %cs
pop %ds
push %cs
pop %es
push %cs
pop %ss
mov $2,%bx
mov %sp,%cx
xor %bp,%bp
main: xor %dx,%dx
call Read
mov %bp,%dx
call Eval
mov %dx,%bp
cmp $kDefine,%ax
je main
Catch: xchg %ax,%si
call PrintObject
mov $'\r',%al
call PutChar
jmp main
.sig: .fill 510 - (. - _start), 1, 0xce
.word 0xAA55
.type .sig,@object
.type kDefine,@object
.type kQuote,@object
.type kCond,@object
.type kAtom,@object
.type kCar,@object
.type kCdr,@object
.type kCons,@object
.type kEq,@object