7 size_RS = 1024 # Return stack size
8 size_PS = 1024 # Parameter stack size
9 size_TIB = 1096 # Terminal input buffer size
11 # The mem array constitutes the memory of the VM. It has the following geography:
13 # mem = +-----------------------+
14 # | Built-in Variables |
15 # +-----------------------+
17 # +-----------------------+
19 # +-----------------------+
20 # | Terminal Input Buffer |
21 # +-----------------------+
23 # +-----------------------+
25 # Note that all words (user-defined, primitive, variables, etc) are included in
28 # Simple linear addressing is used with one exception: references to primitive code
29 # blocks, which are represented as anonymous functions, appear as negative indicies
30 # into the primitives array which contains these functions.
32 mem = Array{Int64,1}(size_mem)
33 primitives = Array{Function,1}()
34 primNames = Array{ASCIIString,1}()
39 RSP0 = nextVarAddr; nextVarAddr += 1
40 PSP0 = nextVarAddr; nextVarAddr += 1
41 HERE = nextVarAddr; nextVarAddr += 1
42 LATEST = nextVarAddr; nextVarAddr += 1
44 mem[RSP0] = nextVarAddr # bottom of RS
45 mem[PSP0] = mem[RSP0] + size_RS # bottom of PS
46 TIB = mem[PSP0] + size_PS # address of terminal input buffer
47 mem[HERE] = TIB + size_TIB # location of bottom of dictionary
48 mem[LATEST] = 0 # no previous definition
50 DICT = mem[HERE] # Save bottom of dictionary as constant
54 RSP::Int64 # Return stack pointer
55 PSP::Int64 # Parameter/data stack pointer
56 IP::Int64 # Instruction pointer
57 W::Int64 # Working register
59 reg = Reg(mem[RSP0], mem[PSP0], 0, 0)
61 # Stack manipulation functions
63 type ParamStackUnderflow <: Exception end
64 type ReturnStackUnderflow <: Exception end
66 Base.showerror(io::IO, ex::ParamStackUnderflow) = print(io, "Parameter stack underflow.")
67 Base.showerror(io::IO, ex::ReturnStackUnderflow) = print(io, "Return stack underflow.")
69 getRSDepth() = reg.RSP - mem[RSP0]
70 getPSDepth() = reg.PSP - mem[PSP0]
72 function ensurePSDepth(depth::Int64)
74 throw(ParamStackUnderflow())
78 function ensureRSDepth(depth::Int64)
80 throw(ReturnStackUnderflow())
84 function pushRS(val::Int64)
96 function pushPS(val::Int64)
97 mem[reg.PSP += 1] = val
108 # Handy functions for adding/retrieving strings to/from memory.
110 getString(addr::Int64, len::Int64) = ASCIIString([Char(c) for c in mem[addr:(addr+len-1)]])
111 function putString(str::ASCIIString, addr::Int64)
112 mem[addr:(addr+length(str)-1)] = [Int64(c) for c in str]
115 # Primitive creation and calling functions
117 function defPrim(f::Function; name="nameless")
119 push!(primNames, replace(replace(name, "\004", "EOF"), "\n", "\\n"))
121 return -length(primitives)
124 callPrim(addr::Int64) = primitives[-addr]()
128 function createHeader(name::AbstractString, flags::Int64)
129 mem[mem[HERE]] = mem[LATEST]
130 mem[LATEST] = mem[HERE]
133 mem[mem[HERE]] = length(name) | flags; mem[HERE] += 1
134 putString(name, mem[HERE]); mem[HERE] += length(name)
137 function defPrimWord(name::AbstractString, f::Function; flags::Int64=0)
138 createHeader(name, flags)
140 codeWordAddr = mem[HERE]
141 mem[codeWordAddr] = defPrim(f, name=name)
147 function defWord(name::AbstractString, wordAddrs::Array{Int64,1}; flags::Int64=0)
148 createHeader(name, flags)
151 mem[mem[HERE]] = DOCOL
154 for wordAddr in wordAddrs
155 mem[mem[HERE]] = wordAddr
164 function defExistingVar(name::AbstractString, varAddr::Int64; flags::Int64=0)
166 defPrimWord(name, eval(:(() -> begin
172 function defNewVar(name::AbstractString, initial::Int64; flags::Int64=0)
173 createHeader(name, flags)
175 codeWordAddr = mem[HERE]
176 varAddr = mem[HERE] + 1
178 f = eval(:(() -> begin
183 mem[mem[HERE]] = defPrim(f, name=name); mem[HERE] += 1
184 mem[mem[HERE]] = initial; mem[HERE] += 1
186 return varAddr, codeWordAddr
189 function defConst(name::AbstractString, val::Int64; flags::Int64=0)
190 defPrimWord(name, eval(:(() -> begin
198 # Threading Primitives (inner interpreter)
200 NEXT = defPrim(() -> begin
206 DOCOL = defPrim(() -> begin
212 EXIT = defPrimWord("EXIT", () -> begin
217 # Basic forth primitives
219 DROP = defPrimWord("DROP", () -> begin
224 SWAP = defPrimWord("SWAP", () -> begin
232 DUP = defPrimWord("DUP", () -> begin
238 OVER = defPrimWord("OVER", () -> begin
240 pushPS(mem[reg.PSP-1])
244 ROT = defPrimWord("ROT", () -> begin
254 NROT = defPrimWord("-ROT", () -> begin
264 TWODROP = defPrimWord("2DROP", () -> begin
270 TWODUP = defPrimWord("2DUP", () -> begin
279 TWOSWAP = defPrimWord("2SWAP", () -> begin
291 QDUP = defPrimWord("?DUP", () -> begin
300 INCR = defPrimWord("1+", () -> begin
306 DECR = defPrimWord("1-", () -> begin
312 INCR2 = defPrimWord("2+", () -> begin
318 DECR2 = defPrimWord("2-", () -> begin
324 ADD = defPrimWord("+", () -> begin
331 SUB = defPrimWord("-", () -> begin
338 MUL = defPrimWord("*", () -> begin
345 DIVMOD = defPrimWord("/MOD", () -> begin
354 EQU = defPrimWord("=", () -> begin
357 pushPS(a==b ? -1 : 0)
361 NEQU = defPrimWord("<>", () -> begin
364 pushPS(a!=b ? -1 : 0)
368 LT = defPrimWord("<", () -> begin
375 GT = defPrimWord(">", () -> begin
382 LE = defPrimWord("<=", () -> begin
385 pushPS(a<=b ? -1 : 0)
389 GE = defPrimWord(">=", () -> begin
392 pushPS(a>=b ? -1 : 0)
396 ZEQU = defPrimWord("0=", () -> begin
397 pushPS(popPS() == 0 ? -1 : 0)
401 ZNEQU = defPrimWord("0<>", () -> begin
402 pushPS(popPS() != 0 ? -1 : 0)
406 ZLT = defPrimWord("0<", () -> begin
407 pushPS(popPS() < 0 ? -1 : 0)
411 ZGT = defPrimWord("0>", () -> begin
412 pushPS(popPS() > 0 ? -1 : 0)
416 ZLE = defPrimWord("0<=", () -> begin
417 pushPS(popPS() <= 0 ? -1 : 0)
421 ZGE = defPrimWord("0>=", () -> begin
422 pushPS(popPS() >= 0 ? -1 : 0)
426 AND = defPrimWord("AND", () -> begin
433 OR = defPrimWord("OR", () -> begin
440 XOR = defPrimWord("XOR", () -> begin
447 INVERT = defPrimWord("INVERT", () -> begin
454 LIT = defPrimWord("LIT", () -> begin
462 STORE = defPrimWord("!", () -> begin
469 FETCH = defPrimWord("@", () -> begin
475 ADDSTORE = defPrimWord("+!", () -> begin
482 SUBSTORE = defPrimWord("-!", () -> begin
492 HERE_CFA = defExistingVar("HERE", HERE)
493 LATEST_CFA = defExistingVar("LATEST", LATEST)
494 PSP0_CFA = defExistingVar("PSP0", PSP0)
495 RSP0_CFA = defExistingVar("RSP0", RSP0)
496 STATE, STATE_CFA = defNewVar("STATE", 0)
497 BASE, BASE_CFA = defNewVar("BASE", 10)
501 defConst("VERSION", 1)
502 defConst("DOCOL", DOCOL)
503 defConst("DICT", DICT)
504 F_IMMED = defConst("F_IMMED", 128)
505 F_HIDDEN = defConst("F_HIDDEN", 256)
506 F_LENMASK = defConst("F_LENMASK", 127)
510 TOR = defPrimWord(">R", () -> begin
515 FROMR = defPrimWord("R>", () -> begin
520 RFETCH = defPrimWord("R@", () -> begin
525 RSPFETCH = defPrimWord("RSP@", () -> begin
530 RSPSTORE = defPrimWord("RSP!", () -> begin
535 RDROP = defPrimWord("RDROP", () -> begin
542 PSPFETCH = defPrimWord("PSP@", () -> begin
547 PSPSTORE = defPrimWord("PSP!", () -> begin
554 WFETCH = defPrimWord("W@", () -> begin
559 WSTORE = defPrimWord("W!", () -> begin
566 sources = Array{Any,1}()
567 currentSource() = sources[length(sources)]
570 NUMTIB, NUMTIB_CFA = defNewVar("#TIB", 0)
571 TOIN, TOIN_CFA = defNewVar(">IN", 0)
572 EOF = defConst("EOF", 4)
574 KEY = defPrimWord("KEY", () -> begin
575 if mem[TOIN] >= mem[NUMTIB]
578 if !eof(currentSource())
579 line = readline(currentSource())
580 mem[NUMTIB] = length(line)
588 pushPS(mem[TIB + mem[TOIN]])
594 EMIT = defPrimWord("EMIT", () -> begin
599 WORD = defPrimWord("WORD", () -> begin
616 if c == '\n' || c == eof_char
622 if c == ' ' || c == '\t'
632 if c == '\n' || c == eof_char
633 # Treat newline as a special word
635 mem[wordAddr + offset] = Int64(c)
642 mem[wordAddr + offset] = Int64(c)
648 if c == ' ' || c == '\t' || c == '\n' || c == eof_char
663 NUMBER = defPrimWord("NUMBER", () -> begin
668 s = getString(wordAddr, wordLen)
671 pushPS(parse(Int64, s, mem[BASE]))
674 pushPS(1) # Error indication
680 # Dictionary searches
682 FIND = defPrimWord("FIND", () -> begin
686 word = lowercase(getString(wordAddr, wordLen))
691 while (latest = mem[latest]) > 0
692 lenAndFlags = mem[latest+1]
693 len = lenAndFlags & F_LENMASK
694 hidden = (lenAndFlags & F_HIDDEN) == F_HIDDEN
696 if hidden || len != wordLen
701 thisWord = lowercase(getString(thisAddr, len))
703 if lowercase(thisWord) == lowercase(word)
713 TOCFA = defPrimWord(">CFA", () -> begin
716 lenAndFlags = mem[addr+1]
717 len = lenAndFlags & F_LENMASK
719 pushPS(addr + 2 + len)
724 TODFA = defWord(">DFA", [TOCFA, INCR, EXIT])
728 BRANCH = defPrimWord("BRANCH", () -> begin
729 reg.IP += mem[reg.IP]
733 ZBRANCH = defPrimWord("0BRANCH", () -> begin
735 reg.IP += mem[reg.IP]
745 CREATE = defPrimWord("CREATE", () -> begin
749 word = getString(wordAddr, wordLen)
751 createHeader(word, 0)
756 COMMA = defPrimWord(",", () -> begin
757 mem[mem[HERE]] = popPS()
763 LBRAC = defPrimWord("[", () -> begin
768 RBRAC = defPrimWord("]", () -> begin
773 HIDDEN = defPrimWord("HIDDEN", () -> begin
775 mem[addr] = mem[addr] $ F_HIDDEN
779 HIDE = defWord("HIDE",
789 LATEST_CFA, FETCH, HIDDEN,
793 SEMICOLON = defWord(";",
795 LATEST_CFA, FETCH, HIDDEN,
797 EXIT], flags=F_IMMED)
799 IMMEDIATE = defPrimWord("IMMEDIATE", () -> begin
800 lenAndFlagsAddr = mem[LATEST] + 1
801 mem[lenAndFlagsAddr] = mem[lenAndFlagsAddr] $ F_IMMED
806 [STATE_CFA, FETCH, ZBRANCH, 7,
807 FROMR, DUP, INCR, TOR, FETCH, EXIT,
808 WORD, FIND, TOCFA, EXIT])
812 LITSTRING = defPrimWord("LITSTRING", () -> begin
822 TELL = defPrimWord("TELL", () -> begin
825 str = getString(addr, len)
832 EXECUTE = defPrimWord("EXECUTE", () -> begin
837 INTERPRET = defPrimWord("INTERPRET", () -> begin
841 wordName = getString(mem[reg.PSP-1], mem[reg.PSP])
842 #println("... ", replace(replace(wordName, "\004", "EOF"), "\n", "\\n"), " ...")
844 callPrim(mem[TWODUP])
847 wordAddr = mem[reg.PSP]
852 isImmediate = (mem[wordAddr+1] & F_IMMED) != 0
855 callPrim(mem[ROT]) # get rid of extra copy of word string details
859 if mem[STATE] == 0 || isImmediate
861 return callPrim(mem[EXECUTE])
863 # Append CFA to dictionary
867 # Not in dictionary, assume number
871 callPrim(mem[NUMBER])
874 println("Parse error at word: '$wordName'")
879 # Number already on stack!
881 # Append literal to dictionary
891 QUIT = defWord("QUIT",
896 BYE = defPrimWord("BYE", () -> begin
900 PROMPT = defPrimWord("PROMPT", () -> begin
904 NL = defPrimWord("\n", () -> begin
905 if mem[STATE] == 0 && currentSource() == STDIN
906 callPrim(mem[PROMPT])
911 INCLUDE = defPrimWord("INCLUDE", () -> begin
915 word = getString(wordAddr, wordLen)
917 push!(sources, open(word, "r"))
925 EOF_WORD = defPrimWord("\x04", () -> begin
926 if currentSource() != STDIN
927 close(currentSource())
933 if currentSource() == STDIN
934 callPrim(mem[PROMPT])
945 CHAR = defPrimWord("CHAR", () -> begin
949 word = getString(wordAddr, wordLen)
950 pushPS(Int64(word[1]))
957 # Begin with STDIN as source
958 push!(sources, STDIN)
960 # Start with IP pointing to first instruction of outer interpreter
963 # Primitive processing loop.
964 # Everyting else is simply a consequence of this loop!
968 #println("Evaluating prim ", jmp," ", primNames[-jmp])
972 showerror(STDOUT, ex)
984 function dump(startAddr::Int64; count::Int64 = 100, cellsPerLine::Int64 = 10)
985 chars = Array{Char,1}(cellsPerLine)
987 lineStartAddr = cellsPerLine*div((startAddr-1),cellsPerLine) + 1
988 endAddr = startAddr + count - 1
990 q, r = divrem((endAddr-lineStartAddr+1), cellsPerLine)
991 numLines = q + (r > 0 ? 1 : 0)
997 for c in 1:cellsPerLine
998 if i >= startAddr && i <= endAddr
1000 if mem[i]>=32 && mem[i]<128
1001 chars[c] = Char(mem[i])
1013 println("\t", ASCIIString(chars))
1018 count = reg.PSP - mem[PSP0]
1022 for i in (mem[PSP0]+1):reg.PSP
1027 println("Parameter stack empty")
1032 count = reg.RSP - mem[RSP0]
1036 for i in (mem[RSP0]+1):reg.RSP
1041 println("Return stack empty")
1045 DUMP = defPrimWord("DUMP", () -> begin
1049 dump(addr, count=count)