I have ported jonesforth to 64-bit x86 code.
jonesforth is a tutorial-style implementation of forth which explains in detail how the compiler and runtime is implemented. Porting the code to a slightly different assembly language helped me to think carefully about what each primitive does and about how they are used in the runtime code.
As noted in the jonesforth comments, the original advantage of using direct-threaded code on a 16-bit machine is that calling each word can be encoded in two bytes instead of three. That’s a savings of 33%. On 32-bit x86, it’s four bytes versus five, saving 20%. In my 64-bit implementation I chose to extend the 4-byte addresses to 8-byte words. This actually results in wasting space rather than saving it because on x86-64 calls and branches are usually encoded with a 5-byte instruction using relative displacement.
The port was fairly straightforward, I mostly just replaced 32-bit registers (eax, esp, esi etc) with the 64-bit equivalents (rax, rsp, rsi etc) and changed every reference to the word-size from 4 to 8.
The biggest difference is that syscalls use different registers on 64-bit linux and these registers can be clobbered during the call.
You can get the code from the mercurial repository (or browse it here):
hg clone http://subvert-the-dominant-paradigm.net/repos/jonesforth64/
To compile it:
gcc -m64 -nostdlib -static -Wl,-Ttext,0 -Wl,--build-id=none -o jonesforth64 jonesforth64.S
To run it:
cat jonesforth64.f - | ./jonesforth64
JONESFORTH VERSION 45
6393 CELLS REMAINING
1 2 3 4
4 3 2 1
3 2 4 1
I’ve tested most of the code in the .f file, but I haven’t yet implemented C strings, file-io or the built-in assembler.
I’ve tried to keep the comments intact, but haven’t updated them to reflect different word sizes or registers etc.