Building a baseline JIT for Lua automatically

https://sillycross.github.io/2023/05/12/2023-05-12/

by djwatson24 • 3 years ago

10 8 3 years ago

sillycross.github.io

djwatson24• 3 years ago

Deegen is my research meta-compiler to make high-performance VMs easier to write. Deegen takes in a semantic description of the VM bytecodes in C++, and use it as the single source of truth to automatically generate a high-performance VM at build time

russellsprouts• 3 years ago

To solve [forward branches], those bytecodes would push information about how the branch destination address shall be fixed up into a late-patch buffer.

This reminds me of how Forth `if` and `then` can be compiled in a single pass -- `if` writes the branch instruction and pushes the current instruction pointer to the stack, and `then` pops it and patches the instruction to point to the current instruction pointer.

sillycross3• 3 years ago

That's an interesting approach :) Though it only works if the control flow in the language is exactly "paired" (no continue/break, no goto, etc), I guess?

celeritascelery3• 3 years ago

Great work! This was a very interesting read. A lot of clever approaches here to make a generic JIT. How would one try out deegen?

celeritascelery3• 3 years ago

I don’t understand how you can remove the calls with copy-and-patch. It seems like you would have to inline evaluate_lhs and evaluate_rhs to remove calls completely.

sillycross3• 3 years ago

Look at the CPS-version of the add.

celeritascelery3• 3 years ago

I saw that. I think I understand a little better. The CPS is to remove the calls between bytecodes, but wouldn’t do anything about lua function calls.

Building a baseline JIT for Lua automatically

Related Stories