7 ;; [NOTE] Volatile registers Linux (syscalls) vs UEFI
9 ;; Linux syscalls: RAX, RCX, R11
10 ;; UEFI: RAX, RCX, R11, RDX, R8, R9, R10
12 ;; We are in the process of replacing our dependency on Linux with a dependency
13 ;; on UEFI. The following macros attempt to isolate what would be syscalls in
14 ;; Linux; thus, we will be able to replace these with UEFI-based implementations,
15 ;; and in theory we should expect the program to work.
17 ;; Print a string of a given length.
20 ;; - RCX = Pointer to buffer
21 ;; - RDX = Buffer length
23 ;; Clobbers: RAX, RCX, R11, RDI, RSI
24 macro sys_print_string {
29 call uefi_print_string
36 ;; Read a character from the user into the given buffer.
39 ;; - RSI = Character buffer
42 ;; - BYTE [RSI] = Character
44 ;; Clobbers: RAX, RCX, R11, RDI, RSI, RDX
62 macro sys_terminate code {
69 ;; The code in this macro is placed at the end of each Forth word. When we are
70 ;; executing a definition, this code is what causes execution to resume at the
71 ;; next word in that definition.
73 ;; RSI points to the address of the definition of the next word to execute.
74 lodsq ; Load value at RSI into RAX and increment RSI
75 ;; Now RAX contains the location of the next word to execute. The first 8
76 ;; bytes of this word is the address of the codeword, which is what we want
78 jmp qword [rax] ; Jump to the codeword of the current word
81 ;; pushr and popr work on the return stack, whose location is stored in the
92 ;; The following macro generates the dictionary header. It updates the
93 ;; initial_latest_entry variable, which is used as the initial value of the
94 ;; latest_entry variable that is made available at runtime.
96 ;; The header contains a link to the previous entry, the length of the name of
97 ;; the word and the word itself as a string literal.
99 ;; This macro also defines a label LABEL_entry.
100 initial_latest_entry = 0
101 macro header label, name, immediate {
105 dq initial_latest_entry
111 db .string_end - ($ + 1)
116 initial_latest_entry = label#_entry
119 ;; Define a Forth word that is implemented in assembly. See 'header' for details.
120 macro forth_asm label, name, immediate {
121 header label, name, immediate
126 section '.text' code readable executable
128 include "impl.asm" ; Misc. subroutines
129 include "bootstrap.asm" ; Forth words encoded in Assembly
132 cld ; Clear direction flag so LODSQ does the right thing.
133 mov rbp, return_stack_top ; Initialize return stack
142 ;; The codeword is the code that will be executed at the beginning of a forth
143 ;; word. It needs to save the old RSI and update it to point to the next word to
145 header DOCOL, 'DOCOL'
146 pushr rsi ; Save old value of RSI on return stack; we will continue execution there after we are done executing this word
147 lea rsi, [rax + 8] ; RAX currently points to the address of the codeword, so we want to continue at RAX+8
148 next ; Execute word pointed to by RSI
150 ;; This word is called at the end of a Forth definition. It just needs to
151 ;; restore the old value of RSI (saved by 'DOCOL') and resume execution.
152 forth_asm EXIT, 'EXIT'
156 ;; LIT is a special word that reads the next "word pointer" and causes it to be
157 ;; placed on the stack rather than executed.
163 ;; Given a string (a pointer following by a size), return the location of the
164 ;; dictionary entry for that word. If no such word exists, return 0.
165 forth_asm FIND, 'FIND'
168 pop [find.search_length]
169 pop [find.search_buffer]
170 mov rsi, [latest_entry] ; Start with the last added word
181 ;; Given an entry in the dictionary, return a pointer to the codeword of that
183 forth_asm TCFA, '>CFA'
185 add rax, 8 + 1 ; [rax] = length of name
186 movzx rbx, byte [rax]
188 add rax, rbx ; [rax] = codeword
192 ;; BRANCH is the fundamental mechanism for branching. BRANCH reads the next word
193 ;; as a signed integer literal and jumps by that offset.
194 forth_asm BRANCH, 'BRANCH'
195 add rsi, [rsi] ; [RSI], which is the next word, contains the offset; we add this to the instruction pointer.
196 next ; Then, we can just continue execution as normal
198 ;; 0BRANCH is like BRANCH, but it jumps only if the top of the stack is zero.
199 forth_asm ZBRANCH, '0BRANCH'
200 ;; Compare top of stack to see if we should branch
207 add rsi, 8 ; We need to skip over the next word, which contains the offset.
210 ;; Duplicate the top of the stack.
211 forth_asm DUP_, 'DUP'
215 ;; Execute the codeword at the given address.
216 forth_asm EXEC, 'EXEC'
220 ;; Expects a character on the stack and prints it to standard output.
221 forth_asm EMIT, 'EMIT'
234 ;; Read a word and push it onto the stack as a pointer and a size. The pointer
235 ;; is valid until the next call to READ_WORD.
236 forth_asm READ_WORD, 'READ-WORD'
237 ;; Are we reading from user input or from the input buffer?
238 cmp [input_buffer], 0
241 ;; Reading user input
252 ;; Reading from buffer
255 mov rsi, [input_buffer]
256 mov rcx, [input_buffer_length]
260 mov [input_buffer], rsi ; Updated buffer
261 mov [input_buffer_length], rcx ; Length of updated buffer
262 push rdi ; Word buffer
263 push rdx ; Length of word buffer
268 ;; Takes a string on the stack and replaces it with the decimal number that the
269 ;; string represents.
270 forth_asm PARSE_NUMBER, 'PARSE-NUMBER'
272 pop rdi ; String pointer
281 ;; Takes a string (in the form of a pointer and a length on the stack) and
282 ;; prints it to standard output.
283 forth_asm TELL, 'TELL'
295 ;; Exit the program cleanly.
296 forth_asm TERMINATE, 'TERMINATE'
299 ;; Duplicate a pair of elements.
300 forth_asm PAIRDUP, '2DUP'
309 ;; Swap the top two elements on the stack.
310 forth_asm SWAP, 'SWAP'
317 ;; Remove the top element from the stack.
318 forth_asm DROP, 'DROP'
322 forth_asm NOT_, 'NOT'
333 ;; .U prints the value on the stack as an unsigned integer in hexadecimal.
336 mov [.printed_length], 1
337 pop rax ; RAX = value to print
338 push rsi ; Save value of RSI
340 ;; We start by constructing the buffer to print in reverse
345 div rbx ; Put remainer in RDX and quotient in RAX
347 ;; Place the appropriate character in the buffer
356 ;; .printed_length is the number of characters that we ulitmately want to
357 ;; print. If we have printed a non-zero character, then we should update
360 je .skip_updating_real_length
362 mov [.printed_length], rbx
363 .skip_updating_real_length:
368 ;; Flip buffer around, since it is currently reversed
369 mov rcx, [.printed_length]
377 add rdi, [.printed_length]
385 mov rdx, [.printed_length]
388 ;; Restore RSI and continue execution
392 ;; Takes a value and an address, and stores the value at the given address.
399 ;; Takes an address and returns the value at the given address.
406 forth_asm PUT_BYTE, 'C!'
412 forth_asm GET_BYTE, 'C@'
414 movzx rax, byte [rax]
418 ;; Add two integers on the stack.
426 ;; Calculate difference between two integers on the stack. The second number is
427 ;; subtracted from the first.
435 ;; Given two integers a and b on the stack, pushes the quotient and remainder of
436 ;; division of a by b.
437 forth_asm TIMESMOD, '/MOD'
446 ;; Read input until next " character is found. Push a string containing the
447 ;; input on the stack as (buffer length). Note that the buffer is only valid
448 ;; until the next call to S" and that no more than 255 characters can be read.
449 forth_asm READ_STRING, 'S"'
450 ;; If the input buffer is set, we should read from there instead.
451 cmp [input_buffer], 0
452 jne read_string_buffer
459 mov rsi, .char_buffer
462 mov al, [.char_buffer]
483 ;; We borrow READ_STRING's buffer. They won't mind.
484 mov [READ_STRING.length], 0
487 mov rbx, [input_buffer]
492 mov rdx, READ_STRING.buffer
493 add rdx, [READ_STRING.length]
495 inc [READ_STRING.length]
498 dec [input_buffer_length]
507 dec [input_buffer_length]
509 push READ_STRING.buffer
510 push [READ_STRING.length]
514 ;; CREATE inserts a new header in the dictionary, and updates LATEST so that it
515 ;; points to the header. To compile a word, the user can then call ',' to
516 ;; continue to append data after the header.
518 ;; It takes the name of the word as a string (address length) on the stack.
519 forth_asm CREATE, 'CREATE'
520 pop rcx ; Word string length
521 pop rdx ; Word string pointer
523 mov rdi, [here] ; rdi = Address at which to insert this entry
524 mov rax, [latest_entry] ; rax = Address of the previous entry
525 mov [rdi], rax ; Insert link to previous entry
526 mov [latest_entry], rdi ; Update LATEST to point to this word
529 mov [rdi], byte 0 ; Insert immediate flag
532 mov [rdi], byte cl ; Insert length
534 ;; Insert word string
538 mov rsi, rdx ; rsi = Word string pointer
561 forth_asm PICK, 'PICK'
563 lea rax, [rsp + 8 * rax]
587 ;; Built-in variables:
593 forth LATEST, 'LATEST'
601 forth SYSCODE, 'SYSCODE'
606 forth INPUT_BUFFER, 'INPUT-BUFFER'
610 forth INPUT_LENGTH, 'INPUT-LENGTH'
611 dq LIT, input_buffer_length
614 section '.data' readable writable
616 ;; The LATEST variable holds a pointer to the word that was last added to the
617 ;; dictionary. This pointer is updated as new words are added, and its value is
618 ;; used by FIND to look up words.
619 latest_entry dq initial_latest_entry
621 ;; The STATE variable is 0 when the interpreter is executing, and non-zero when
625 ;; The interpreter can read either from standard input or from a buffer. When
626 ;; input-buffer is set (non-null), words like READ-WORD and S" will use this
627 ;; buffer instead of reading user input.
629 input_buffer_length dq 0
636 READ_STRING.char_buffer db ?
637 READ_STRING.buffer rb $FF
638 READ_STRING.length dq ?
640 DOTU.chars db '0123456789ABCDEF'
641 DOTU.buffer rq 16 ; 64-bit number has no more than 16 digits in hex
644 DOTU.printed_length dq ?
646 ;; Reserve space for compiled words, accessed through HERE.
654 ;; We store some Forth code in sys.f that defined common words that the user
655 ;; would expect to have available at startup. To execute these words, we just
656 ;; include the file directly in the binary, and then interpret it at startup.