rubyx/lib/vm
2014-06-11 11:41:50 +03:00
..
block.rb still recoving from previous block - function change. no more exceptions at least 2014-06-11 00:38:46 +03:00
boot_class.rb still recoving from previous block - function change. no more exceptions at least 2014-06-11 00:38:46 +03:00
boot_memory.rb renamed program to boot_space, as in object_space at boot time. thats the way its going 2014-05-31 12:52:29 +03:00
boot_space.rb inrtoduce block passes. move the allocation there and implement those simple optimisations 2014-06-11 11:41:50 +03:00
call_site.rb removed the (too) fancy dsl. Also introduce register indirection 2014-06-07 17:59:44 +03:00
code.rb removed the (too) fancy dsl. Also introduce register indirection 2014-06-07 17:59:44 +03:00
constants.rb removed the (too) fancy dsl. Also introduce register indirection 2014-06-07 17:59:44 +03:00
context.rb remoe hash attributes (less magic) and make attributes on context explicit 2014-06-07 22:41:02 +03:00
function.rb inrtoduce block passes. move the allocation there and implement those simple optimisations 2014-06-11 11:41:50 +03:00
instruction.rb inrtoduce block passes. move the allocation there and implement those simple optimisations 2014-06-11 11:41:50 +03:00
meta_class.rb new register allocation generates good looking push/pop 2014-06-09 19:24:09 +03:00
passes.rb inrtoduce block passes. move the allocation there and implement those simple optimisations 2014-06-11 11:41:50 +03:00
README.markdown use crystal calling convention, documented in readme 2014-05-25 10:57:56 +03:00
register_machine.rb removed the (too) fancy dsl. Also introduce register indirection 2014-06-07 17:59:44 +03:00
values.rb moved registers to machine, changed return to 0 (from 7) and erased all integer references to registers 2014-06-10 13:29:01 +03:00

Virtual Machine

This is the logic that uses the generated ast to produce code, using the asm layer.

Apart from shuffeling things around from one layer to the other, it keeps track about registers and provides the stack glue. All the stuff a compiler would usually do.

Also all syscalls are abstracted as functions.

The Crystal Convention

Since we're not in c, we use the regsters more suitably for our job:

  • return register is not the same as passing registers
  • we pin one more register (ala stack/fp) for type information (this is used for returns too)
  • one line (8 registers) can be used by a function (caller saved?)
  • rest are scratch and may not hold values during call

For Arm this works out as:

  • 0 type word (for the line)
  • 1-6 argument passing + workspace
  • 7 return value

This means syscalls (using 7 for call number and 0 for return) must shuffle a little, but there's space to do it. Some more detail:

1 - returning in the same register as passing makes that one register a special case, which i want to avoid. shuffling it gets tricky and involves 2 moves for what? As i see it the benefitd of reusing the same register are one more argument register (not needed) and easy chaining of calls, which doen't really happen so much. On the plus side, not using the same register makes saving and restoring registers easy (to implement and understand!). An easy to understand policy is worth gold, as register mistakes are HARD to debug and not what i want to spend my time with just now. So that's settled.

2 - Tagging integers like MRI/BB is a hack which does not extend to other types, such as floats. So we don't use that and instead carry type information externally to the value. This is a burden off course, but then so is tagging. The convention (to make it easier) is to handle data in lines (8 words) and have one of them carry the type info for the other 7. This is also the object layout and so we reuse that code on the stack.