rubyx/lib/virtual/machine.rb

68 lines
3.1 KiB
Ruby
Raw Normal View History

2014-06-26 16:48:33 +02:00
module Virtual
# The Virtual Machine is a value based virtual machine in which ruby is implemented. While it is value based,
# it resembles oo in basic ways of object encapsulation and method invokation, it is a "closed" / static sytem
# in that all types are know and there is no dynamic dispatch (so we don't bite our tail here).
#
2014-06-25 01:33:44 +02:00
# It is minimal and realistic and low level
# - minimal means that if one thing can be implemented by another, it is left out. This is quite the opposite from
# ruby, which has several loops, many redundant if forms and the like.
# - realistic means it is easy to implement on a 32 bit machine (arm) and possibly 64 bit. Memory access, a stack,
# some registers of same size are the underlying hardware. (not ie byte machine)
# - low level means it's basic instructions are realively easily implemented in a register machine. ie send is not
# a an instruction but a function.
#
# So the memory model of the machine allows for indexed access into and "object" . A fixed number of objects exist
# (ie garbage collection is reclaming, not destroying and recreating) although there may be a way to increase that number.
#
# The ast is transformed to virtaul-machine objects, some of which represent code, some data.
2014-06-25 01:33:44 +02:00
#
# The next step transforms to the register machine layer, which is what actually executes.
#
# More concretely, an virtual machine is a sort of oo turing machine, it has a current instruction, executes the
# instructions, fetches the next one and so on.
2014-06-25 01:33:44 +02:00
# Off course the instructions are not soo simple, but in oo terms quite so.
#
# The machine is virtual in the sense that it is completely
# modeled in software, it's complete state explicitly available (not implicitly by walking stacks or something)
2014-06-25 01:33:44 +02:00
# The machine has a no register, but local variables, a scope at each point in time.
# Scope changes with calls and blocks, but is saved at each level. In terms of lower level implementation this means
# that the the model is such that what is a variable in ruby, never ends up being just on the pysical stack.
2014-06-25 01:33:44 +02:00
#
class Machine
# the main machine is the one that runs on the main thread, if it exists or receives an uncaught exception, that's it.
def self.main
@main || @main = Machine.new
end
def initialize
2014-07-01 17:58:25 +02:00
the_end = HaltInstruction.new
@frame = Frame.new(the_end , the_end , :Object)
end
2014-07-01 17:58:25 +02:00
attr_reader :frame
2014-06-26 10:34:48 +02:00
# run the instruction stream given. Instructions are a graph and executing means traversing it.
# If there is no next instruction the machine stops
def run instruction
2014-06-26 10:34:48 +02:00
while instruction do
next_instruction = instruction.next
instruction.execute
instruction = next_instruction
end
end
2014-07-01 17:58:25 +02:00
#return an anonymous new function (the top level) into which code is compiled
def anonymous
end
2014-06-25 01:33:44 +02:00
end
end
require_relative "list"
require_relative "instruction"
2014-06-29 18:05:35 +02:00
require_relative "frame"
require_relative "value"
require_relative "mystery"
require_relative "object"
require_relative "constants"