aboutsummaryrefslogtreecommitdiff
path: root/vm/fib.c
diff options
context:
space:
mode:
authorAryadev Chavali <aryadev@aryadevchavali.com>2023-10-23 03:58:34 +0100
committerAryadev Chavali <aryadev@aryadevchavali.com>2023-10-23 03:58:34 +0100
commitb44a61be41e44b415b1293fcbc1f1e8c4ce3373d (patch)
tree218cdb4901d23089ab0b54b4ff3097202c442acd /vm/fib.c
parent587f31a63b26fe3789acd0ba129474a2be200d37 (diff)
downloadovm-b44a61be41e44b415b1293fcbc1f1e8c4ce3373d.tar.gz
ovm-b44a61be41e44b415b1293fcbc1f1e8c4ce3373d.tar.bz2
ovm-b44a61be41e44b415b1293fcbc1f1e8c4ce3373d.zip
src->vm, Makefile is now a bit more abstracted and pretty colours
Changed folder names for sake of clarity (will be introducing a new build target soon), and Makefile can now easily support more targets.
Diffstat (limited to 'vm/fib.c')
-rw-r--r--vm/fib.c79
1 files changed, 79 insertions, 0 deletions
diff --git a/vm/fib.c b/vm/fib.c
new file mode 100644
index 0000000..7107c3e
--- /dev/null
+++ b/vm/fib.c
@@ -0,0 +1,79 @@
+/* Copyright (C) 2023 Aryadev Chavali
+
+ * You may distribute and modify this code under the terms of the GPLv2
+ * license. You should have received a copy of the GPLv2 license with
+ * this file. If not, please write to: aryadev@aryadevchavali.com.
+
+ * Created: 2023-10-23
+ * Author: Aryadev Chavali
+ * Description: An example virtual machine program which computes and
+ * prints fibonacci numbers. Note that by default the virtual machine
+ * just rolls overflows over, so this program will never terminate.
+ */
+
+#include <assert.h>
+#include <stdio.h>
+#include <string.h>
+
+#include "./inst.h"
+#include "./runtime.h"
+
+int main(void)
+{
+ inst_t instructions[] = {
+ // MOV the values 1 and 1 to REG[0] and REG[1] respectively
+ INST_PUSH(WORD, 1),
+ INST_MOV(WORD, 0),
+ INST_PUSH(WORD, 1),
+ INST_MOV(WORD, 1),
+
+ // Print value at register 0 with newline.
+ INST_PUSH_REG(WORD, 0), // <-- #
+ INST_PRINT(WORD),
+ INST_PUSH(BYTE, '\n'),
+ INST_PRINT(CHAR),
+
+ // Print value at register 1 with newline
+ INST_PUSH_REG(WORD, 1),
+ INST_PRINT(WORD),
+ INST_PUSH(BYTE, '\n'),
+ INST_PRINT(CHAR),
+
+ /* Compute the next pair of fibonacci numbers */
+ // REG[0] + REG[1]
+ INST_PUSH_REG(WORD, 0),
+ INST_PUSH_REG(WORD, 1),
+ INST_PLUS(WORD),
+
+ // Mov REG[0] + REG[1] to REG[0]
+ INST_MOV(WORD, 0),
+
+ // REG[0] + REG[1]
+ INST_PUSH_REG(WORD, 0),
+ INST_PUSH_REG(WORD, 1),
+ INST_PLUS(WORD),
+
+ // Mov REG[0] + REG[1] to REG[1]
+ INST_MOV(WORD, 1),
+
+ // Jump to the point #
+ INST_JUMP_ABS(4),
+ INST_HALT,
+ };
+
+ byte stack[256];
+ vm_t vm = {0};
+ vm_load_stack(&vm, stack, ARR_SIZE(stack));
+ vm_load_program(&vm, instructions, ARR_SIZE(instructions));
+ err_t err = vm_execute_all(&vm);
+
+ if (err)
+ {
+ const char *error_str = err_as_cstr(err);
+ fprintf(stderr, "[ERROR]: %s\n", error_str);
+ fprintf(stderr, "[ERROR]: VM Trace:\n");
+ vm_print_all(&vm, stderr);
+ return 255 - err;
+ }
+ return 0;
+}