InfoQ

News

Rubinius: Inside the Bytecode Compiler and Foreign Function Interface

Posted by Werner Schuster on Oct 17, 2007 03:00 PM

Community
Ruby
Topics
Programming ,
Dynamic Languages
Tags
Rubinius
The first of two recent articles about Rubinius is by Giles Bowkett, who tries to get started with Rubinius compiler development. The Rubinius compiler works by traversing Ruby Abstract Syntax Tree (AST), a tree representation of the Ruby source, using ParseTree s-expressions. This means it is an array using symbols to describe the data. An addition, for instance, would look like this:
[:call, [:lit, 1], :+, [:array, [:lit, 1]]] 

A literal looks like this:
[:lit, 42] 

To traverse the AST, ParseTree comes with the SexpProcessor library, which facilitates the creation of visitors. To analyze all node types of a Ruby AST, a subclass of SexpProcessor with process_XXX methods is created, where XXX is the name of the node. For instance, this handles the :alias node:
def process_alias(node)
 cur = node.shift
 nw = node.shift
# ...
end

The Ruby to Rubinius bytecode compiler is built in this way. For instance, a Ruby alias call is parsed into [:alias, :old_name, :new_name], which the compiler handles as such:
 def process_alias(x)
 cur = x.shift
 nw = x.shift
 add "push :#{cur}"
 add "push :#{nw}"
 add "push self"
 add "send alias_method 2"
 end

The compiler takes the old name (in curr) and the new name (in nw), and creates the bytecode instructions (as strings) necessary to implement the functionality, which are then turned into the binary bytecodes executed by the Rubinius interpreter.

Having the compiler in Ruby makes it easy to get insight into the inner workings and modify it for experiments. Useful scenarios could include instrumentation of the generated code or a low overhead way of collecting statistics about the compiled code.

To look at the Rubinius source code, either refer to InfoQ's article about getting started with Rubinius development or just take a peek at the Rubinius source code online, for instance the current version of the Rubinius bytecode compiler.

The compiler is not the only aspect necessary for Rubinius. A complete standard library is necessary too. Marcus Crafter, of Red Artisan, provides a tutorial on how to add library functionality to Rubinius. The tutorial shows to use the Rubinius foreign function interface (ffi) to access native library calls. This is used to implement some missing library functionality, in this tutorial,  the POSIX call link.

No comments

Watch Thread Reply

Educational Content

Bindings, Platforms, and Innovation

This presentation focuses on the Internet and separating myth from fact, history from the future, and the mundane from the imaginative. Bob Frankston presents a vision of what could and should be.

Orchestrating Long Running Activities with JBoss / JBPM

This article explores the use of JBoss and jBPM to implement design solutions that effectively address the issue of orchestrating long running activities.

Neo4j - The Benefits of Graph Databases

This presentation covers the use of graph databases as an optimal solution for data that is difficult to fit in static tables, rapidly evolving data or data that has a lot of optional attributes.

Realistic about Risk: Software development with Real Options

This session introduces Real Options and shows how it can help in running your project. Real Options is a decision-making process that can be used to manage risk.

Communication Flexibility Using Bindings

This article discusses the use of bindings on services and references (including the instance of non-configured bindings) as the means to implement SCA communications in a Web and SOA environment.

Writing DSLs in Groovy

After a short introduction to DSLs, Scott Davis plays with the keyboard showing how to approach the creation of a DSL by typing working snippets of Groovy code that get executed.

Scaling Agile with C/ALM (Collaborative Application Lifecycle Management)

IBM Rational and InfoQ present, Scaling Agile with C/ALM, an eBook showing organizations how to become “finely tuned software delivery machines” by enabling team integration and scaling.

Concurrent Programming with Microsoft F#

Amanda Laucher presents a real life enterprise application written in F#. She shows actual code snippets, explaining design decisions and suggesting how to use some of the F# constructs.