| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2025-03-14 | protect jit pages | Kimplul | |
| 2025-03-14 | start supporting 32bit arches | Kimplul | |
| 2025-03-13 | improve register allocation | Kimplul | |
| + Still linear, but orders regs by some kind of priority + Use all registers available, not just callee-save | |||
| 2025-03-07 | make code a bit more robust | Kimplul | |
| + Should be more difficult to make mistakes in the future, ejit can now automatically keep track of how many register slots are used and if 64 bit mode is required. Slight runtime overhead, but not too bad. | |||
| 2025-03-05 | allow direct calls between compiled functions | Kimplul | |
| 2025-01-05 | fix some assertions | Kimplul | |
| 2024-12-12 | add todo about minimizing mmap syscalls | Kimplul | |
| 2024-10-22 | move interp into run_interp | Kimplul | |
| + This allows us to skip a potential extra function call | |||
| 2024-10-22 | use type-specific vectors instead of generic ones | Kimplul | |
| + An attempt at speeding up function calls in the interpreted mode | |||
| 2024-07-14 | jit tests pass (kind of) on x86_64 | Kimplul | |
| 2024-07-14 | add float + double instead of just double | Kimplul | |
| 2024-07-13 | implement some more jit instructions | Kimplul | |
| 2024-07-13 | implement some float JIT handling | Kimplul | |
| 2024-07-13 | bytecode tests pass | Kimplul | |
| 2024-06-30 | work through loads and stores | Kimplul | |
| 2024-06-30 | continue working through test cases | Kimplul | |
| + Remove overflow and more complicated floating point tests for now | |||
| 2024-06-29 | work through branching instructions | Kimplul | |
| 2024-06-29 | continue working through bytecode ops | Kimplul | |
| 2024-06-29 | add flag for using 64 bit values on 32 machines | Kimplul | |
| + JIT backends needs to still trigger an assertion if we detect that the user lied | |||
| 2024-06-29 | start adding tests | Kimplul | |
| 2024-06-28 | optimize interpreter a bit | Kimplul | |
| + Use a gpr/fpr/arg stack shared between different functions to minimize amount of memory allocations done at runtime while still allowing interleaving bytecode/machine code functions during call, just with a bit of extra setup in between | |||
| 2024-06-28 | implement enough for fibonacci | Kimplul | |
| 2024-06-28 | some posthaste fixes | Kimplul | |
| + Interesting that the comparison thing only failed when compiled with RELEASE=1 | |||
| 2024-06-28 | implement more jit instructions | Kimplul | |
| 2024-06-26 | allow toggling between jit and bytecode | Kimplul | |
| 2024-06-26 | move labels out of the bytecode | Kimplul | |
| + Speeds up interpreter a little bit since we don't have to execute what's effectively a no-op | |||
| 2024-06-26 | enough functionality to implement posthaste | Kimplul | |
| 2024-06-25 | move branches to have the dest in r0 | Kimplul | |
| 2024-06-25 | example compiles under jit | Kimplul | |
| 2024-06-24 | add initial compiler framework | Kimplul | |
| 2024-06-23 | initial interpeter testing | Kimplul | |
 |
index : ejit | |
| Hybrid JIT/bytecode built on top of Lightening | kimi.h.kuparinen+ejit@gmail.com |
| aboutsummaryrefslogtreecommitdiff |