| .. | ||
| builtin | ||
| instructions | ||
| assembler.rb | ||
| boot.rb | ||
| collector.rb | ||
| eventable.rb | ||
| instruction.rb | ||
| interpreter.rb | ||
| machine.rb | ||
| padding.rb | ||
| positioned.rb | ||
| README.md | ||
| register_value.rb | ||
Register Machine
The RegisterMachine, is an abstract machine with registers. Think of it as an arm machine with normal instruction names. It is not however an abstraction of existing hardware, but only of that subset that we need.
Our primary objective is to compile typed code to this level, so the register machine has:
- object access instructions
- object load
- object oriented call semantics
- extended (and extensible) branching
- normal integer operators (but no sub word instructions)
All data is in objects.
The register machine is aware of Parfait objects, and specifically uses Message and Frame to express call semantics.
Calls and syscalls
The RegisterMachine only uses 1 fixed register, the currently worked on Message.
There is no stack, rather messages form a linked list, and preparing to call, the data is pre-filled into the next message. Calling then means moving the new message to the current one and jumping to the address of the method. Returning is the somewhat reverse process.
Syscalls are implemented by one Syscall instruction. The Register machine does not specify/limit the meaning or number of syscalls. This is implemented by the level below, eg the arm/interpreter.
Interpreter
There is an interpreter that can interpret compiled register machine programs. This is very handy for debugging (an nothing else).
Even more handy is the graphical interface for the interpreter, which is in it's own repository: salama-debugger.
Arm / Elf
There is also a (very strightforward) transformation to arm instructions. Together with the also quite minimal elf module, arm binaries can be produced.
These binaries have no external dependencies and in fact can not even call c at the moment (only syscalls :-)).