3.6 KiB
#Salama
Salama is about native code generation in and of ruby. In is done.
Step 1 - Assembly
Produce binary that represents code. Traditionally called assembling, but there is no need for an external file representation.
Ie only in ruby code do i want to create machine code.
Most instructions are in fact assembling correctly. Meaning i have tests, and i can use objbump to verify the correct assembler code is disasembled
I even polished the dsl and so (from the tests), this is a valid hello world:
hello = "Hello World\n" @program.main do mov r7, 4 # 4 == write mov r0 , 1 # stdout add r1 , pc , hello # address of "hello World" mov r2 , hello.length swi 0 #software interupt, ie kernel syscall mov r7, 1 # 1 == exit swi 0 end write(7 + hello.length/4 + 1 , 'hello')
Step 2 -Link to system
Package the code into an executable. Run that and verify it's output. But full elf support (including externs) is eluding me for now.
Still, this has proven to be a good review point for the arcitecture and means no libc for now. Full rationale on the web pages, but it means starting an extra step.
Above Hello World can be linked and run. And will say its thing.
Step 3 - syscalls
Start implementing some syscalls and add the functionality we actually need from c (basic io only really)
Step 4 -Parse ruby
Parse simple code, using Parslet.
Parsing is a surprisingly fiddly process, very space and order sensitive. But Parslet is great and simple expressions (including function definitions and calls) are starting to work.
I spent some time on the parse testing framework, so it is safe to fiddle and add.
Step 5 - Virtual: Compile the Ast
Since we now have an Abstact syntax tree, it needs to be compiled to a virtual machine Instruction format.
It took me a while to come up with a decent but simple machine model. I had tried to map straight to hardware but failed. The current Virtual directory represent a machine with basic oo features.
Instead of having more Layers to go from virtual to arm, i opted to have passes that go over the data structure and modify it.
This is where it's at really :-)
Step 9 - Compound types
Arrays and Hash parse. Good. But this means The Actual datastructures should be implemented. AWIP ( a work in progress)
Implement Core library of arrays/hash/string , memory definition and access
Step 10
Implement Blocks, stack/external frames
Step 11
Implement Exceptions, frame walking
Step 12
Implement a way to call libc
Step 13
Iterate from one:
- more cpus (ie intel)
- more systems (ie mac)
- more syscalls, there are after all some hundreds
- Ruby is full of nicities that are not done, also negative tests are non existant
- A lot of modern cpu's functionality has to be mapped to ruby and implemented in assembler to be useful
- Different sized machines, with different register types ?
- on 64bit, there would be 8 bits for types and thus allow for rational, complex, and whatnot
- Housekeeping (the superset of gc) is abundant
- Any amount of time could be spent on a decent digital tree (see judy). Also better string/arrays would be good.
- Inlining would be good
And generally optimize and work towards that perfect world (we never seem to be able to attain).
Step 14
Celebrate New year 2030
Contributing to salama
Probably best to talk to me, if it's not a typo or so.
I do have a todo, for the adventurous.
Fork and create a branch before sending pulls.
== Copyright
Copyright (c) 2014 Torsten Ruger. See LICENSE.txt for further details.