Repository navigation
Expand file tree
/
Copy pathmain.c
More file actions
259 lines (231 loc) · 4.75 KB
/
Copy pathmain.c
File metadata and controls
259 lines (231 loc) · 4.75 KB
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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
#include <stdio.h>
#include <stdbool.h>
#define STACK_SIZE 256
static int stack[STACK_SIZE];
/** Registers */
typedef enum {
A, // GENERAL PURPOSE
B,
C,
D,
E,
F,
I,
J,
EX, // EXCESS
EXA, // MORE EXCESS
IP, // INSTRUCTION POINTER
SP, // STACK POINTER
REGISTER_SIZE
} Registers;
static int registers[REGISTER_SIZE];
/** Instructions */
typedef enum {
HLT, // 0 -- hlt :: halts program
PSH, // 1 -- psh val :: pushes <val> to stack
POP, // 2 -- pop :: pops value from stack
ADD, // 3 -- add :: adds top two vals on stack
MUL, // 4 -- mul :: multiplies top two vals on stack
DIV, // 5 -- div :: divides top two vals on stack
SUB, // 6 -- sub :: subtracts top two vals on stack
MOV, // 7 -- mov reg_a, reg_b :: movs the value in reg_a to reg_b
SET, // 8 -- set reg, val :: sets the reg to value
LOG, // 9 -- log a :: prints out a
IF, // 10 -- if reg val ip :: if the register == val branch to the ip
IFN, // 11 -- ifn reg val ip :: if the register != val branch to the ip
GLD, // 10 -- gld reg :: loads a register to the stack
GPT, // 11 -- gpt reg :: pushes top of stack to the given register
NOP // 12 -- nop :: nothing
} Instructions;
/** if the program is running */
static bool running = true;
/** testing addition */
int test_a[] = {
PSH, 5,
PSH, 2,
ADD,
PSH, 10,
PSH, 12,
ADD,
ADD,
POP,
HLT
};
/** testing multiplication */
int test_b[] = {
PSH, 5,
PSH, 2,
MUL,
PSH, 10,
PSH, 20,
ADD,
ADD,
HLT
};
/** testing set and move */
int instructions[] = {
SET, A, 21, // 3
GLD, A, // 5
PSH, 1, // 7
SUB, // 8
GPT, A, // 10
IFN, A, 0, 2, // 14
LOG, A, // 16
LOG, B,
HLT // 17
};
/** quick ways to get SP and IP */
#define SP (registers[SP])
#define IP (registers[IP])
/** fetch current instruction */
#define FETCH (instructions[IP])
/** prints the stack from A to B */
void print_stack() {
for (int i = 0; i < SP; i++) {
printf("0x%04d ", stack[i]);
if ((i + 1) % 4 == 0) printf("\n");
}
if (SP != 0) {
printf("\n");
}
}
void print_registers() {
printf("register dump\n");
for (int i = 0; i < REGISTER_SIZE; i++) {
printf("%04d ", registers[i]);
if ((i + 1) % 4 == 0) printf("\n");
}
}
int find_empty_register() {
for (int i = 0; i < REGISTER_SIZE; i++) {
if (i != registers[EX] && i != registers[EXA]) {
return i;
}
}
return EX; // throw it in EX, whatever
}
/** evaluate the given instruction */
void eval(int instr) {
switch (instr) {
case HLT: {
running = false;
printf("finished execution\n");
// print_stack(0, 16);
// print_registers();
break;
}
case PSH: {
SP = SP + 1;
IP = IP + 1;
stack[SP] = instructions[IP];
break;
}
case POP: {
SP = SP - 1;
break;
}
case IF: {
if (registers[instructions[IP + 1]] == instructions[IP + 2]) {
registers[IP + 1] = instructions[IP + 3];
}
IP = IP + 3;
break;
}
case IFN: {
if (registers[instructions[IP + 1]] != instructions[IP + 2]) {
registers[EX] = instructions[IP + 3];
registers[IP] = registers[EX];
}
else {
IP = IP + 3;
}
break;
}
case MOV: {
registers[instructions[IP + 2]] = registers[instructions[IP + 1]];
IP = IP + 2;
break;
}
case SET: {
registers[instructions[IP + 1]] = instructions[IP + 2];
IP = IP + 2;
break;
}
case GLD: {
SP = SP + 1;
IP = IP + 1;
stack[SP] = registers[instructions[IP]];
break;
}
case GPT: {
registers[instructions[IP + 1]] = stack[SP];
IP = IP + 1;
break;
}
case LOG: {
printf("%d\n", registers[instructions[IP + 1]]);
IP = IP + 1;
break;
}
case ADD: {
registers[A] = stack[SP];
SP = SP - 1;
registers[B] = stack[SP];
SP = SP - 1;
registers[C] = registers[B] + registers[A];
SP = SP + 1;
stack[SP] = registers[C];
printf("%d + %d = %d\n", registers[B], registers[A], registers[C]);
break;
}
case SUB: {
registers[A] = stack[SP];
SP = SP - 1;
registers[B] = stack[SP];
SP = SP - 1;
registers[C] = registers[B] - registers[A];
SP = SP + 1;
stack[SP] = registers[C];
printf("%d - %d = %d\n", registers[B], registers[A], registers[C]);
break;
}
case DIV: {
registers[A] = stack[SP];
SP = SP - 1;
registers[B] = stack[SP];
SP = SP - 1;
registers[C] = registers[B] / registers[A];
SP = SP + 1;
stack[SP] = registers[C];
printf("%d / %d = %d\n", registers[B], registers[A], registers[C]);
break;
}
case MUL: {
registers[A] = stack[SP];
SP = SP - 1;
registers[B] = stack[SP];
SP = SP - 1;
registers[C] = registers[B] * registers[A];
SP = SP + 1;
stack[SP] = registers[C];
printf("%d * %d = %d\n", registers[B], registers[A], registers[C]);
break;
}
case NOP: {
printf("do nothing\n");
break;
}
default: {
printf("unknown instruction %d\n", instr);
break;
}
}
}
int main() {
SP = -1;
while (running) {
eval(FETCH);
IP = IP + 1;
}
return 0;
}