123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344 |
- /*-*- 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 │
- │ Copyright 2022 Hikaru Ikuta │
- │ │
- │ 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
- .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 "" # interned strings
- kQuote: .asciz "QUOTE" # builtin for eval
- kCond: .asciz "COND" # builtin for eval
- kRead: .asciz "READ" # builtin to apply
- kPrint: .asciz "PRINT" # builtin to apply
- kCar: .asciz "CAR" # builtin to apply
- kCdr: .asciz "CDR" # ordering matters
- kCons: .asciz "CONS" # must be 3rd last
- kEq: .asciz "EQ" # must be 2nd last
- kAtom: .asciz "ATOM" # needs to be last
- begin: mov $0x8000,%sp # uses higher address as stack
- # and set independently of SS!
- # 8088 doesn't stop interrupts
- # after SS is set, and PC BIOS
- # sets SP to a value that will
- # damage our code if int fires
- # between it setting SS and SP
- push %cs # that means ss = ds = es = cs
- pop %ds # noting ljmp set cs to 0x7c00
- push %cs # that's the bios load address
- pop %es # therefore NULL points to NUL
- push %cs # terminated NIL string above!
- pop %ss # errata exists but don't care
- mov $2,%bx
- main: mov %sp,%cx
- mov $'\r',%al
- call PutChar # call first to initialize %dx
- call Read
- call Eval
- xchg %si,%ax
- call PrintObject
- jmp main
- GetToken: # GetToken():al, dl is g_look
- 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 # dl = g_look
- 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 (A∙B)
- call .PutObject
- 4: mov $')',%al
- jmp PutChar
- .ifPrint:
- xchg %di,%si # Print(x:si)
- test %di,%di
- jnz PrintObject # print newline for empty args
- mov $'\r',%al
- .PutObject: # .PutObject(c:al,x:si)
- .PrintString: # nul-terminated in si
- call PutChar # preserves si
- PrintObject: # PrintObject(x:si)
- 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
- .ifRead:mov %bp,%dx # get cached character
- Read: call GetToken
- # jmp GetObject
- GetObject: # called just after GetToken
- cmp $'(',%al
- je GetList
- # jmp Intern
- Intern: push %cx # Intern(cx,di): ax
- mov %di,%bp
- sub %cx,%bp
- inc %bp
- xor %di,%di
- 1: pop %si
- push %si
- mov %bp,%cx
- mov %di,%ax
- cmp %bh,(%di)
- je 8f
- rep cmpsb # memcmp(di,si,cx)
- je 9f
- dec %di
- xor %ax,%ax
- 2: scasb # rawmemchr(di,al)
- jne 2b
- jmp 1b
- 8: rep movsb # memcpy(di,si,cx)
- 9: pop %cx
- ret
- GetChar:xor %ax,%ax # GetChar→al:dl
- int $0x16 # get keystroke
- mov %ax,%bp # used for READ
- PutChar:mov $0x0e,%ah # prints CP-437
- int $0x10 # vidya service
- cmp $'\r',%al # don't clobber
- jne .RetDx # look xchg ret
- mov $'\n',%al
- jmp PutChar
- .RetDx: xchg %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
- Builtin:cmp $kAtom,%ax # atom: last builtin atom
- ja .resolv # ah is zero if not above
- mov (%si),%di # di = Car(x)
- je .ifAtom
- cmp $kPrint,%al
- je .ifPrint
- cmp $kRead,%al
- je .ifRead
- .ifCar: cmp $kCar,%al
- je Car
- cmp $kCons,%al
- jb Cdr
- .ifCons:mov (%bx,%si),%si # si = Cdr(x)
- lodsw # si = Cadr(x)
- je Cons
- .isEq: xor %di,%ax
- jne .retF
- .retT: mov $kT,%al
- ret
- GetList:call GetToken
- cmp $')',%al
- je .retF
- call GetObject
- push %ax # popped by xCons
- call GetList
- jmp xCons
- 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
- add %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 Builtin # 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
- lodsw # ax = Car(y)
- push (%bx,%di) # push Cdr(x)
- mov (%di),%di # di = Car(x)
- mov (%si),%si # si = Cdr(y)
- 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
- .ifAtom:test %di,%di # test if atom
- jns .retT
- .retF: xor %ax,%ax # ax = nil
- ret
- Assoc: mov %dx,%si # Assoc(x:ax,y:dx):ax
- 1: mov (%si),%di
- mov (%bx,%si),%si
- scasw
- jne 1b
- .byte 0xA9 # shifted ip; reads as test, cmp
- 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
- push %dx # save a
- push %cx # save A
- push %ax
- call Evlis
- xchg %ax,%si
- pop %ax
- call Apply
- .fill 0x1BE - (. - _start), 1, 0x90 # to have this boot from a USB
- # drive on a modern PC, make a
- # degenerate "partition table"
- # where this sector starts the
- # bootable partition; inactive
- # partition table entries must
- # also be empty, or have valid
- # starting sector LBA numbers!
- # * 1st partition entry *
- .byte 0x00 # - bootable indicator
- .byte 0b11010010 # reads as add %dl,%dl
- pop %dx # restore A
- mov %cx,%si # si = B
- xchg %ax,%di
- call Gc
- mov %dx,%di # di = A
- .byte 0x00 # - hi8(c₀*Cₙ + h₀*Hₙ + s₀*Sₙ)
- .byte 0b11010010 # reads as add %dl,%dl
- sub %si,%cx # cx = C - B
- .byte 0x3C # cmp $0,%al
- # * 2nd partition entry *
- .byte 0x00 # - bootable indicator
- rep movsb
- mov %di,%cx # cx = A + (C - B)
- pop %dx # restore a
- 1: ret
- .fill 0x1CE + 0x8 - (. - _start), 1, 0xce
- .long 0 # - c₀*Cₙ + h₀*Hₙ + s₀*Sₙ
- .fill 0x1DE - (. - _start), 1, 0xce # * 3rd partition entry *
- .byte 0x80 # - bootable indicator
- .byte 0, 1, 0 # - h₀, s₀ (& c₀ hi bits), c₀
- .byte 0x7F # - OS or filesystem indicator
- .byte 0xFF, 0xFF, 0xFF # - h₉, s₉ (& c₉ hi bits), c₉
- .long 0 # - c₀*Cₙ + h₀*Hₙ + s₀*Sₙ
- .fill 0x1EE - (. - _start), 1, 0xce # * 4th partition entry *
- .byte 0x00 # - bootable indicator
- .sig: .fill 0x200 - (2f - 1f) - (. - _start), 1, 0xce
- 1: .ascii "SECTORLISP"
- .byte 0 # - hi8(c₀*Cₙ + h₀*Hₙ + s₀*Sₙ)
- .ascii " v2 "
- .word 0xAA55
- 2: .type .sig,@object
- .type kQuote,@object
- .type kCond,@object
- .type kRead,@object
- .type kPrint,@object
- .type kAtom,@object
- .type kCar,@object
- .type kCdr,@object
- .type kCons,@object
- .type kEq,@object
|