Last three days I added a lot of instructions. We can perform arithmetic expressions and jump with and without conditions. So I think my VM is turing complete isn´t it?

Today I did a fibonacci test and I beat the JVM.

First devlog

Last days I worked on a small and simple project called nano_code. It´s a bytecode written in pure assembly and designed to be fast. I hope I can beat the JVM on modern PC.

So what did I do?
Actually I did the hardest part of this project by making the loop (fetch-decode-execute). Now I just need to implement the instructions one by one.
Oh and I don´t load bytecode from a file for now so I have to implement it later.

I already implemented movr and movi (r = register and i = immediate), and I am currently making the arithmetic operations like add, sub, mul, div, and mod which is modulo of course. All of these instructions have two version : one with a register and an immediate value and the other one with two register as the operands.

Of course in the future I will need to make a small assembler to write easily code for that VM.

Thanks for reading, see you soon.