size_mem = 640*1024
# Buffer sizes
-size_BIVar = 16 #
size_RS = 1024 # Return stack size
size_PS = 1024 # Parameter stack size
-size_TIB = 4096 # Terminal input buffer size
+size_TIB = 1096 # Terminal input buffer size
# The mem array constitutes the memory of the VM. It has the following geography:
#
HERE = nextVarAddr; nextVarAddr += 1
LATEST = nextVarAddr; nextVarAddr += 1
-mem[RSP0] = size_BIVar # bottom of RS
+mem[RSP0] = nextVarAddr # bottom of RS
mem[PSP0] = mem[RSP0] + size_RS # bottom of PS
TIB = mem[PSP0] + size_PS # address of terminal input buffer
mem[HERE] = TIB + size_TIB # location of bottom of dictionary
mem[LATEST] = 0 # no previous definition
+DICT = mem[HERE] # Save bottom of dictionary as constant
+
# VM registers
type Reg
RSP::Int64 # Return stack pointer
end
reg = Reg(mem[RSP0], mem[PSP0], 0, 0, 0)
-# Stack manipulation functions
+# Stack manipulation
+
+type StackUnderflow <: Exception end
+
+getRSDepth() = reg.RSP - mem[RSP0]
+getPSDepth() = reg.PSP - mem[PSP0]
+
+function ensurePSDepth(depth::Int64)
+ if getPSDepth()<depth
+ throw(StackUnderflow())
+ end
+end
+
+function ensureRSDepth(depth::Int64)
+ if getRSDepth()<depth
+ throw(StackUnderflow())
+ end
+end
function pushRS(val::Int64)
mem[reg.RSP+=1] = val
end
function popRS()
+ ensureRSDepth(1)
+
val = mem[reg.RSP]
reg.RSP -= 1
return val
end
function popPS()
+ ensurePSDepth(1)
+
val = mem[reg.PSP]
reg.PSP -= 1
return val
mem[LATEST] = mem[HERE]
mem[HERE] += 1
- mem[mem[HERE]] = length(name) + flags; mem[HERE] += 1
+ mem[mem[HERE]] = length(name) | flags; mem[HERE] += 1
mem[mem[HERE]:(mem[HERE]+length(name)-1)] = [Int(c) for c in name]; mem[HERE] += length(name)
end
function defPrim(name::AbstractString, f::Function; flags::Int64=0)
createHeader(name, flags)
+ codeWordAddr = mem[HERE]
push!(primitives, f)
- mem[mem[HERE]] = -length(primitives)
+ mem[codeWordAddr] = -length(primitives)
mem[HERE] += 1
- return -length(primitives)
+ return codeWordAddr
end
callPrim(addr::Int64) = primitives[-addr]()
function defExistingVar(name::AbstractString, varAddr::Int64; flags::Int64=0)
defPrim(name, eval(:(() -> begin
pushPS($(varAddr))
- return NEXT
- end)))
-end
-
-function defConst(name::AbstractString, val::Int64; flags::Int64=0)
- defPrim(name, eval(:(() -> begin
- pushPS($(val))
- return NEXT
+ return mem[NEXT]
end)))
end
varAddr = mem[HERE] + 1
push!(primitives, eval(:(() -> begin
pushPS($(varAddr))
- return NEXT
+ return mem[NEXT]
end)))
mem[mem[HERE]] = -length(primitives); mem[HERE] += 1
return varAddr
end
-# Threading Primitives
+function defConst(name::AbstractString, val::Int64; flags::Int64=0)
+ defPrim(name, eval(:(() -> begin
+ pushPS($(val))
+ return mem[NEXT]
+ end)))
+
+ return val
+end
+
+function defWord(name::AbstractString, wordAddrs::Array{Int64,1}; flags::Int64=0)
+ createHeader(name, flags)
+
+ addr = mem[HERE]
+ mem[mem[HERE]] = mem[DOCOL]
+ mem[HERE] += 1
+
+ for wordAddr in wordAddrs
+ mem[mem[HERE]] = wordAddr
+ mem[HERE] += 1
+ end
+
+ return addr
+end
+
+# Threading Primitives (inner interpreter)
NEXT = defPrim("NEXT", () -> begin
reg.W = mem[reg.IP]
reg.IP += 1
- X = mem[reg.W]
- return X
+ return mem[reg.W]
end)
DOCOL = defPrim("DOCOL", () -> begin
pushRS(reg.IP)
reg.IP = reg.W + 1
- return NEXT
+ return mem[NEXT]
end)
EXIT = defPrim("EXIT", () -> begin
reg.IP = popRS()
- return NEXT
+ return mem[NEXT]
end)
-
# Basic forth primitives
DROP = defPrim("DROP", () -> begin
popPS()
- return NEXT
+ return mem[NEXT]
end)
SWAP = defPrim("SWAP", () -> begin
- mem[reg.PSP], mem[reg.PSP-1] = mem[reg.PSP-1], mem[reg.PSP]
- return NEXT
+ a = popPS()
+ b = popPS()
+ pushPS(a)
+ pushPS(b)
+ return mem[NEXT]
end)
DUP = defPrim("DUP", () -> begin
pushPS(mem[reg.PSP])
- return NEXT
+ return mem[NEXT]
+end)
+
+OVER = defPrim("OVER", () -> begin
+ ensurePSDepth(2)
+ pushPS(mem[reg.PSP-1])
+ return mem[NEXT]
+end)
+
+ROT = defPrim("ROT", () -> begin
+ a = popPS()
+ b = popPS()
+ c = popPS()
+ pushPS(a)
+ pushPS(c)
+ pushPS(b)
+ return mem[NEXT]
+end)
+
+NROT = defPrim("-ROT", () -> begin
+ a = popPS()
+ b = popPS()
+ c = popPS()
+ pushPS(b)
+ pushPS(a)
+ pushPS(c)
+ return mem[NEXT]
+end)
+
+TWODROP = defPrim("2DROP", () -> begin
+ popPS()
+ popPS()
+ return mem[NEXT]
+end)
+
+TWODUP = defPrim("2DUP", () -> begin
+ ensurePSDepth(2)
+ a = mem[reg.PSP-1]
+ b = mem[reg.PSP]
+ pushPS(a)
+ pushPS(b)
+ return mem[NEXT]
end)
+TWOSWAP = defPrim("2SWAP", () -> begin
+ a = popPS()
+ b = popPS()
+ c = popPS()
+ d = popPS()
+ pushPS(b)
+ pushPS(a)
+ pushPS(c)
+ pushPS(d)
+ return mem[NEXT]
+end)
+
+QDUP = defPrim("?DUP", () -> begin
+ ensurePSDepth(1)
+ val = mem[reg.PSP]
+ if val != 0
+ pushPS(val)
+ end
+ return mem[NEXT]
+end)
+
+INCR = defPrim("1+", () -> begin
+ ensurePSDepth(1)
+ mem[reg.PSP] += 1
+ return mem[NEXT]
+end)
+
+DECR = defPrim("1-", () -> begin
+ ensurePSDepth(1)
+ mem[reg.PSP] -= 1
+ return mem[NEXT]
+end)
+
+INCR2 = defPrim("2+", () -> begin
+ ensurePSDepth(1)
+ mem[reg.PSP] += 2
+ return mem[NEXT]
+end)
+
+DECR2 = defPrim("2-", () -> begin
+ ensurePSDepth(1)
+ mem[reg.PSP] -= 2
+ return mem[NEXT]
+end)
+
+ADD = defPrim("+", () -> begin
+ b = popPS()
+ a = popPS()
+ pushPS(a+b)
+ return mem[NEXT]
+end)
+
+SUB = defPrim("-", () -> begin
+ b = popPS()
+ a = popPS()
+ pushPS(a-b)
+ return mem[NEXT]
+end)
+
+MUL = defPrim("*", () -> begin
+ b = popPS()
+ a = popPS()
+ pushPS(a*b)
+ return mem[NEXT]
+end)
+
+DIVMOD = defPrim("/MOD", () -> begin
+ b = popPS()
+ a = popPS()
+ q,r = divrem(a,b)
+ pushPS(r)
+ pushPS(q)
+ return mem[NEXT]
+end)
+
+EQU = defPrim("=", () -> begin
+ b = popPS()
+ a = popPS()
+ pushPS(a==b ? -1 : 0)
+ return mem[NEXT]
+end)
+
+NEQU = defPrim("<>", () -> begin
+ b = popPS()
+ a = popPS()
+ pushPS(a!=b ? -1 : 0)
+ return mem[NEXT]
+end)
+
+LT = defPrim("<", () -> begin
+ b = popPS()
+ a = popPS()
+ pushPS(a<b ? -1 : 0)
+ return mem[NEXT]
+end)
+
+GT = defPrim(">", () -> begin
+ b = popPS()
+ a = popPS()
+ pushPS(a>b ? -1 : 0)
+ return mem[NEXT]
+end)
+
+LE = defPrim("<=", () -> begin
+ b = popPS()
+ a = popPS()
+ pushPS(a<=b ? -1 : 0)
+ return mem[NEXT]
+end)
+
+GE = defPrim(">=", () -> begin
+ b = popPS()
+ a = popPS()
+ pushPS(a>=b ? -1 : 0)
+ return mem[NEXT]
+end)
+
+ZEQU = defPrim("0=", () -> begin
+ pushPS(popPS() == 0 ? -1 : 0)
+ return mem[NEXT]
+end)
+
+ZNEQU = defPrim("0<>", () -> begin
+ pushPS(popPS() != 0 ? -1 : 0)
+ return mem[NEXT]
+end)
+
+ZLT = defPrim("0<", () -> begin
+ pushPS(popPS() < 0 ? -1 : 0)
+ return mem[NEXT]
+end)
+
+ZGT = defPrim("0>", () -> begin
+ pushPS(popPS() > 0 ? -1 : 0)
+ return mem[NEXT]
+end)
+
+ZLE = defPrim("0<=", () -> begin
+ pushPS(popPS() <= 0 ? -1 : 0)
+ return mem[NEXT]
+end)
+
+ZGE = defPrim("0>=", () -> begin
+ pushPS(popPS() >= 0 ? -1 : 0)
+ return mem[NEXT]
+end)
+
+AND = defPrim("AND", () -> begin
+ b = popPS()
+ a = popPS()
+ pushPS(a & b)
+ return mem[NEXT]
+end)
+
+OR = defPrim("OR", () -> begin
+ b = popPS()
+ a = popPS()
+ pushPS(a | b)
+ return mem[NEXT]
+end)
+
+XOR = defPrim("XOR", () -> begin
+ b = popPS()
+ a = popPS()
+ pushPS(a $ b)
+ return mem[NEXT]
+end)
+
+INVERT = defPrim("INVERT", () -> begin
+ pushPS(~popPS())
+ return mem[NEXT]
+end)
+
+# Literals
+
LIT = defPrim("LIT", () -> begin
pushPS(mem[reg.IP])
reg.IP += 1
- return NEXT
+ return mem[NEXT]
end)
# Memory primitives
addr = popPS()
dat = popPS()
mem[addr] = dat
- return NEXT
+ return mem[NEXT]
end)
FETCH = defPrim("@", () -> begin
addr = popPS()
pushPS(mem[addr])
- return NEXT
+ return mem[NEXT]
end)
ADDSTORE = defPrim("+!", () -> begin
addr = popPS()
toAdd = popPS()
mem[addr] += toAdd
- return NEXT
+ return mem[NEXT]
end)
SUBSTORE = defPrim("-!", () -> begin
addr = popPS()
toSub = popPS()
mem[addr] -= toSub
- return NEXT
+ return mem[NEXT]
end)
defExistingVar("LATEST", LATEST)
defExistingVar("PSP0", PSP0)
defExistingVar("RSP0", RSP0)
-defNewVar("STATE", 0)
-defNewVar("BASE", 10)
+STATE = defNewVar("STATE", 0)
+BASE = defNewVar("BASE", 10)
# Constants
defConst("VERSION", 1)
defConst("DOCOL", DOCOL)
+defConst("DICT", DICT)
+F_IMMED = defConst("F_IMMED", 128)
+F_HIDDEN = defConst("F_HIDDEN", 256)
+F_LENMASK = defConst("F_LENMASK", 127)
# Return Stack
TOR = defPrim(">R", () -> begin
pushRS(popPS())
- return NEXT
+ return mem[NEXT]
end)
FROMR = defPrim("R>", () -> begin
pushPS(popRS())
- return NEXT
+ return mem[NEXT]
end)
RSPFETCH = defPrim("RSP@", () -> begin
- pushPS(RSP)
- return NEXT
+ pushPS(reg.RSP)
+ return mem[NEXT]
end)
RSPSTORE = defPrim("RSP!", () -> begin
RSP = popPS()
- return NEXT
+ return mem[NEXT]
end)
RDROP = defPrim("RDROP", () -> begin
popRS()
- return NEXT
+ return mem[NEXT]
end)
# Parameter Stack
PSPFETCH = defPrim("PSP@", () -> begin
- pushPS(PSP)
- return NEXT
+ pushPS(reg.PSP)
+ return mem[NEXT]
end)
PSPSTORE = defPrim("PSP!", () -> begin
PSP = popPS()
- return NEXT
+ return mem[NEXT]
end)
# I/O
defConst("TIB", TIB)
NUMTIB = defNewVar("#TIB", 0)
-TOIN = defNewVar(">IN", TIB)
+TOIN = defNewVar(">IN", 0)
+
+KEY = defPrim("KEY", () -> begin
+ if mem[TOIN] >= mem[NUMTIB]
+ mem[TOIN] = 0
+ line = readline()
+ mem[NUMTIB] = length(line)
+ mem[TIB:(TIB+mem[NUMTIB]-1)] = [Int64(c) for c in collect(line)]
+ end
+
+ pushPS(mem[TIB + mem[TOIN]])
+ mem[TOIN] += 1
+
+ return mem[NEXT]
+end)
+
+EMIT = defPrim("EMIT", () -> begin
+ print(Char(popPS()))
+ return mem[NEXT]
+end)
+
+WORD = defPrim("WORD", () -> begin
+
+ c = -1
+
+ skip_to_end = false
+ while true
+
+ callPrim(mem[KEY])
+ c = Char(popPS())
+
+ if c == '\\'
+ skip_to_end = true
+ continue
+ end
+
+ if skip_to_end
+ if c == '\n'
+ skip_to_end = false
+ end
+ continue
+ end
+
+ if c == ' ' || c == '\t'
+ continue
+ end
+
+ break
+ end
+
+ wordAddr = mem[HERE]
+ offset = 0
+
+ while true
+ mem[wordAddr + offset] = Int64(c)
+ offset += 1
+
+ callPrim(mem[KEY])
+ c = Char(popPS())
+
+ if c == ' ' || c == '\t' || c == '\n'
+ break
+ end
+ end
+
+ wordLen = offset
+
+ pushPS(wordAddr)
+ pushPS(wordLen)
+
+ return mem[NEXT]
+end)
+
+NUMBER = defPrim("NUMBER", () -> begin
+
+ wordLen = popPS()
+ wordAddr = popPS()
+
+ s = ASCIIString([Char(c) for c in mem[wordAddr:(wordAddr+wordLen-1)]])
+
+ try
+ pushPS(parse(Int64, s, mem[BASE]))
+ pushPS(0)
+ catch
+ pushPS(1) # Error indication
+ end
+
+ return mem[NEXT]
+end)
+
+# Dictionary searches
+
+FIND = defPrim("FIND", () -> begin
+
+ wordLen = popPS()
+ wordAddr = popPS()
+ word = ASCIIString([Char(c) for c in mem[wordAddr:(wordAddr+wordLen-1)]])
+
+ latest = mem[LATEST]
+
+ while latest>0
+ lenAndFlags = mem[latest+1]
+ len = lenAndFlags & F_LENMASK
+ hidden = (lenAndFlags & F_HIDDEN) == F_HIDDEN
+
+ if hidden || len != wordLen
+ latest = mem[latest]
+ continue
+ end
+
+ thisAddr = latest+2
+ thisWord = ASCIIString([Char(c) for c in mem[thisAddr:(thisAddr+len-1)]])
+
+ if thisWord == word
+ break
+ end
+ end
+
+ pushPS(latest)
+
+ return mem[NEXT]
+end)
+
+TOCFA = defPrim(">CFA", () -> begin
+
+ addr = popPS()
+ lenAndFlags = mem[addr+1]
+ len = lenAndFlags & F_LENMASK
+
+ pushPS(addr + 2 + len)
+
+ return mem[NEXT]
+end)
+
+TODFA = defWord(">DFA", [TOCFA, INCR, EXIT])
+
+# Compilation
+
+CREATE = defPrim("CREATE", () -> begin
+
+ wordLen = popPS()
+ wordAddr = popPS()
+ word = ASCIIString([Char(c) for c in mem[wordAddr:(wordAddr+wordLen-1)]])
+
+ mem[mem[HERE]] = mem[LATEST]; mem[HERE] += 1
+ mem[LATEST] = mem[HERE]
+ mem[mem[HERE]] = wordLen; mem[HERE] += 1
+
+ mem[mem[HERE]:(mem[HERE]+wordLen-1)] = collect(Int64, word)
+ mem[HERE] += wordLen
+
+ return mem[NEXT]
+end)
+
+COMMA = defPrim(",", () -> begin
+ mem[mem[HERE]] = popPS()
+ mem[HERE] += 1
+
+ return mem[NEXT]
+end)
+
+LBRAC = defPrim("[", () -> begin
+ mem[STATE] = 0
+ return mem[NEXT]
+end, flags=F_IMMEDIATE)
+
+RBRAC = defPrim("]", () -> begin
+ mem[STATE] = 1
+ return mem[NEXT]
+end, flags=F_IMMEDIATE)
+
+HIDDEN = defPrim("HIDDEN", () -> begin
+ addr = popPS() + 1
+ mem[addr] = mem[addr] $ F_HIDDEN
+ reurn mem[NEXT]
+end)
+
+COLON = defWord(":",
+ [WORD,
+ CREATE,
+ LIT, DOCOL, COMMA,
+ LATEST, FETCH, HIDDEN,
+ RBRAC,
+ EXIT])
+
+SEMICOLON = defWord(";",
+ [LIT, EXIT, COMMA,
+ LATEST, FETCH, HIDDEN,
+ LBRAC,
+ EXIT], flags=F_IMMEDIATE)
-#KEY = defPrim("KEY", (reg) -> begin
-# if toin >= numtib
-#
-# end
-#
-# return NEXT
-#end)
-#
-#EMIT = defPrim("EMIT", (reg) -> begin
-#
-# return NEXT
-#end)
-#
-#WORD = defPrim("WORD", (reg) -> begin
-#
-# return NEXT
-#end)
-#
-#NUMBER = defPrim("NUMBER", (reg) -> begin
-#
-# return NEXT
-#end)
-#
#### VM loop ####
-#function runVM(reg::Reg)
-# jmp = NEXT
-# while (jmp = callPrim(reg, jmp)) != 0 end
-#end
+function runVM()
+ jmp = NEXT
+ while (jmp = callPrim(jmp)) != 0 end
+end
# Debugging tools
-function coredump(startAddr::Int64; count::Int64 = 16, cellsPerLine::Int64 = 8)
+function dump(startAddr::Int64; count::Int64 = 100, cellsPerLine::Int64 = 10)
chars = Array{Char,1}(cellsPerLine)
for i in 0:(count-1)
end
end
-function dumpPS()
+function printPS()
count = reg.PSP - mem[PSP0]
if count > 0
end
end
+function printRS()
+ count = reg.RSP - mem[RSP0]
+
+ if count > 0
+ print("<$count>")
+ for i in (mem[RSP0]+1):reg.RSP
+ print(" $(mem[i])")
+ end
+ println()
+ else
+ println("Return stack empty")
+ end
+end
+
end
The Lambda Lab / projects / forth.jl.git / blobdiff