1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/*
* Copyright (C) 2025 Johnny Richard <johnny@johnnyrichard.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "vm.h"
#include "array.h"
#include "stack.h"
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
void
vm_init(vm_t* vm)
{
assert(vm);
vm->stack = (stack_t){ .capacity = STACK_CAPACITY,
.size = 0,
.data = calloc(sizeof(int), STACK_CAPACITY) };
vm->call_stack = (stack_t){ .capacity = 3000,
.size = 0,
.data = calloc(sizeof(int), 3000) };
vm->heap = calloc(sizeof(int), HEAP_CAPACITY);
vm->labels = array(label_t);
}
void
vm_run(vm_t* vm, inst_t* insts)
{
size_t program_size = array_length(insts);
// resolve lables
for (size_t ip = 0; ip < program_size; ++ip) {
if (insts[ip].type == INST_LABEL) {
int name = insts[ip].operand;
label_t label = { .name = name, .index = ip };
array_append(vm->labels, label);
}
}
// resolve jumps
for (size_t ip = 0; ip < program_size; ++ip) {
switch (insts[ip].type) {
case INST_CALL:
case INST_JMP:
case INST_JMPN:
case INST_JMPZ: {
int label_name = insts[ip].operand;
size_t i = 0;
size_t labels_size = array_length(vm->labels);
for (; i < labels_size; ++i) {
if (vm->labels[i].name == label_name) {
insts[ip].operand = vm->labels[i].index;
break;
}
}
assert(i < labels_size);
}
default:
break;
}
}
// run
for (size_t ip = 0; ip < program_size; ++ip) {
switch (insts[ip].type) {
case INST_PUSH: {
stack_push(&vm->stack, insts[ip].operand);
break;
}
case INST_DUP: {
stack_push(&vm->stack, vm->stack.data[vm->stack.size - 1]);
break;
}
case INST_COPY: {
int operand = insts[ip].operand;
stack_push(&vm->stack,
vm->stack.data[vm->stack.size - 1 - operand]);
break;
}
case INST_SWAP: {
int a = stack_pop(&vm->stack);
int b = stack_pop(&vm->stack);
stack_push(&vm->stack, a);
stack_push(&vm->stack, b);
break;
}
case INST_DROP: {
stack_pop(&vm->stack);
break;
}
case INST_SLIDE: {
int operand = insts[ip].operand;
int top = stack_pop(&vm->stack);
while (operand-- > 0) {
stack_pop(&vm->stack);
}
stack_push(&vm->stack, top);
break;
}
case INST_ADD: {
int lhs = stack_pop(&vm->stack);
int rhs = stack_pop(&vm->stack);
stack_push(&vm->stack, lhs + rhs);
break;
}
case INST_SUB: {
int rhs = stack_pop(&vm->stack);
int lhs = stack_pop(&vm->stack);
stack_push(&vm->stack, lhs - rhs);
break;
}
case INST_MUL: {
int rhs = stack_pop(&vm->stack);
int lhs = stack_pop(&vm->stack);
stack_push(&vm->stack, lhs * rhs);
break;
}
case INST_DIV: {
int rhs = stack_pop(&vm->stack);
int lhs = stack_pop(&vm->stack);
stack_push(&vm->stack, lhs / rhs);
break;
}
case INST_MOD: {
int rhs = stack_pop(&vm->stack);
int lhs = stack_pop(&vm->stack);
stack_push(&vm->stack, lhs % rhs);
break;
}
case INST_STORE: {
int value = stack_pop(&vm->stack);
int address = stack_pop(&vm->stack);
vm->heap[address] = value;
break;
}
case INST_LOAD: {
int address = stack_pop(&vm->stack);
stack_push(&vm->stack, vm->heap[address]);
break;
}
case INST_CALL: {
stack_push(&vm->call_stack, ip + 1);
ip = insts[ip].operand;
break;
}
case INST_RET: {
ip = stack_pop(&vm->call_stack);
break;
}
case INST_JMP: {
ip = insts[ip].operand;
break;
}
case INST_JMPZ: {
int value = stack_pop(&vm->stack);
if (value == 0) {
ip = insts[ip].operand;
}
break;
}
case INST_JMPN: {
int value = stack_pop(&vm->stack);
if (value < 0) {
ip = insts[ip].operand;
}
break;
}
case INST_PRINTI: {
int value = stack_pop(&vm->stack);
printf("%d", value);
break;
}
case INST_PRINTC: {
int value = stack_pop(&vm->stack);
printf("%c", value);
break;
}
case INST_READI: {
int address = stack_pop(&vm->stack);
scanf("%d", vm->heap + address);
break;
}
case INST_READC: {
int address = stack_pop(&vm->stack);
vm->heap[address] = getchar();
break;
}
case INST_END: {
return;
}
case INST_LABEL: {
break;
}
default: {
assert(0 && "Unsupported instruction");
break;
}
}
}
}
|
