RubyX compiles ruby to binary (in ruby), hoping to be that X times faster
Go to file
2015-10-22 14:42:23 +03:00
lib fix integers and clock reset 2015-10-22 14:42:23 +03:00
stash there go the slots 2015-10-16 18:16:39 +03:00
test fix offsets, debugging revealed them to be 1 off 2015-10-22 11:48:03 +03:00
.gitignore ignore logs 2015-06-10 10:43:28 +02:00
.travis.yml ignore 1.9.3 2015-09-27 22:56:20 +03:00
CNAME sorted out the domain 2015-05-03 20:33:54 +03:00
CodeStyle.md went over the various readmes 2015-10-07 11:32:48 +03:00
FEATURES.md moved to consitent md ending 2014-08-28 18:52:55 +03:00
Gemfile switch back to white quarks ast since he merged 2015-10-06 00:22:51 +03:00
Gemfile.lock update to new syntax and patch tests 2015-10-19 15:31:48 +03:00
Guardfile add guard 2015-08-08 18:08:15 +03:00
LICENSE.txt jeweler generates its things 2014-04-14 15:58:59 +03:00
Rakefile update version 2015-10-07 15:22:10 +03:00
README.md update the reader rewrite and reflect name changes 2015-10-09 17:51:14 +03:00
salama.gemspec update version 2015-10-07 15:22:10 +03:00
ToDo.md update the reader rewrite and reflect name changes 2015-10-09 17:51:14 +03:00

Build Status Gem Version Code Climate Test Coverage

Salama

Salama is about native code generation in and of ruby.

It is probably best to read the The Book first.

The current third rewrite adds a system language, with the idea of compiling ruby to that language, Phisol. The original ruby parser has been remodeled to parse Phisol and later we will use whitequarks parser to parse ruby. Then it will be ruby --> Phisol --> assembler --> binary .

Done

Some things that are finished (for a definition of finished, ie started)

Interpreter

After doing some debugging on the generated binaries i opted to write an interpreter for the register layer. That way test runs on the interpreter reveal most issues.

Debugger

And after the interpreter was done, i wrote a visual debugger. It is a simple opal application that nevertheless has proven great help both in figuring out what is going on, and in finding bugs.

Assembly

Produce binary that represents code. Traditionally called assembling, but there is no need for an external file representation.

Most instructions are in fact assembling correctly. Meaning i have tests, and i can use objdump to verify the correct assembler code is disassembled

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')

Linking

Package the code into an executable, currently elf, and very simple at that.

Above Hello World can be linked and run. And will say its thing.

There is no way to link c code currently and not planned either, for some time (see next)

Syscalls

Some small portion of what libc usually provides is needed even right at the beginning. Mainly file open and read, exit, that kind of thing. Looking at libc implementations and kernel "api" docs, this is quite simple to do.

As said, "Hello world" comes out and does use syscall 4. Also the program stops by syscall exit. The full list is on the net and involves mostly just work.

Parse Phisol

Parse Phisol, using Parslet. This has been separated out as it's own gem, salama-reader.

Phisol is now fully typed (all variables, arguments and return). Also it has statements, unlike ruby where everything is an statements. Statements have no value. Otherwise it is quite basic, and it's main purpose is to have an oo system language to compile to.

I spent some time on the parse testing framework, so it is safe to fiddle and add. In fact it is very modular and easy to add to.

Virtual: Compile the Ast

Since we now have an Abstact syntax tree, it needs to be compiled to a virtual machine Instruction format. For the parsed subset that's almost done.

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.

Parfait - the runtime

After an initial phase where i aimed for a really really small run-time, i have now started to implement a more decent set classes and functions. This is a process off course.

I was encouraged by the thought that a large amount of the run-time code can actually be reused at compile time, by using inlining. That off course assumes that i figure out how to do inlining, but i have at least an idea.

Sof

Salama Object File format is a yaml like format to look at code dumps and help testing. The dumper is ok and does produce (as intended) considerably denser dumps than yaml

When a reader is done (not started) the idea is to use sof as pre-compiled, language independent exchange format, have the core read that, and use the mechanism to achieve language independence.

Status

Currently all the work is on the Phisol front. Also documenting the small change of a new language.

I'll do some simple string and fibo examples in Phisol next.

Next will be the multiple return feature and then to try to compile ruby to Phisol.

Future

Blocks

Implement ruby Blocks, and make new vm classes to deal with that. This is in fact a little open, but i have a general notion that blocks are "just" methods with even more implicit arguments.

Exceptions

Implement Exceptions. Conceptually this is not so difficult in an oo machine as it would be in c.

I have a post about it

which boils down to the fact that we can treat the address to return to in an exception quite like a return address from a function. Ie just another implicit parameter (as return is really an implicit parameter, a little like self for oo)

C linking

Implement a way to call libc and other c libraries. I am not placing a large emphasis on this personally, but expect somebody will come along and have library they want to use so much they can't stop themselves. Personally i think a fresh start is what we need much more. I once counted the call chain from a simple printf to the actual kernel invocation in some libc, and it was getting to 10! I hope with dynamic (re)compiling and intelligent inlining, we can do better than that.

Stary sky

Iterate:

  1. more cpus (ie intel)
  2. more systems (ie mac)
  3. more syscalls, there are after all some hundreds
  4. Ruby is full of niceties that are not done, also negative tests are non existant
  5. A lot of modern cpu's functionality has to be mapped to ruby and implemented in assembler to be useful
  6. Different sized machines, with different register types ?
  7. on 64bit, there would be 8 bits for types and thus allow for rational, complex, and whatnot
  8. Housekeeping (the superset of gc) is abundant
  9. Any amount of time could be spent on a decent digital tree (see judy). Or possibly Dr.Cliffs hash.
  10. Also better string/arrays would be good.
  11. The minor point of threads and hopefully lock free primitives to deal with that.
  12. Other languages, python at least, maybe others
  13. translation of the vm instructions to another vm, say js

And generally optimize and work towards that perfect world (we never seem to be able to attain).

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.