-
Notifications
You must be signed in to change notification settings - Fork 142
/
Copy patheli.c
214 lines (188 loc) · 4.08 KB
/
eli.c
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
#include <assert.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ir/ir.h>
#ifdef __eir__
#define MEMSZ 0x100000
#else
#define MEMSZ 0x1000000
#endif
int pc;
Inst* prog[65536];
int mem[MEMSZ];
int regs[6];
bool verbose;
#ifdef __GNUC__
__attribute__((noreturn))
#endif
static void error(const char* msg) {
fprintf(stderr, "%s (pc=%d)\n", msg, pc);
exit(1);
}
static inline void dump_regs(Inst* inst) {
bool had_negative = false;
static const char* REG_NAMES[] = {
"A", "B", "C", "D", "BP", "SP"
};
fprintf(stderr, "PC=%d ", inst->lineno);
for (int i = 0; i < 6; i++) {
if (regs[i] < 0)
had_negative = true;
fprintf(stderr, "%s=%d", REG_NAMES[i], regs[i]);
fprintf(stderr, i == 5 ? "\n" : " ");
}
if (had_negative) {
error("had negative!");
}
}
static int value(Value* v) {
if (v->type == REG) {
return regs[v->reg];
} else if (v->type == IMM) {
return v->imm;
} else {
error("invalid value");
}
}
static int src(Inst* inst) {
return value(&inst->src);
}
static int cmp(Inst* inst) {
int op = inst->op;
if (op >= 16)
op -= 8;
assert(inst->dst.type == REG);
int d = regs[inst->dst.reg];
int s = src(inst);
switch (op) {
case JEQ:
return d == s;
case JNE:
return d != s;
case JLT:
return d < s;
case JGT:
return d > s;
case JLE:
return d <= s;
case JGE:
return d >= s;
case JMP:
return 1;
default:
error("oops");
}
}
int main(int argc, char* argv[]) {
#if defined(NOFILE) || defined(__eir__)
Module* m = load_eir(stdin);
#else
if (argc >= 2 && !strcmp(argv[1], "-v")) {
verbose = true;
argc--;
argv++;
}
if (argc < 2) {
fprintf(stderr, "no input file\n");
return 1;
}
Module* m = load_eir_from_file(argv[1]);
#endif
int i;
i = 0;
for (Data* d = m->data; d; d = d->next, i++) {
mem[i] = d->v;
}
for (Inst* inst = m->text; inst; i++) {
pc = inst->pc;
prog[pc] = inst;
for (; inst && pc == inst->pc; inst = inst->next) {}
}
pc = m->text->pc;
for (;;) {
Inst* inst = prog[pc];
for (; inst; inst = inst->next) {
if (verbose) {
dump_regs(inst);
dump_inst(inst);
}
int npc = -1;
switch (inst->op) {
case MOV:
assert(inst->dst.type == REG);
regs[inst->dst.reg] = src(inst);
break;
case ADD:
assert(inst->dst.type == REG);
regs[inst->dst.reg] += src(inst);
regs[inst->dst.reg] += MEMSZ;
regs[inst->dst.reg] %= MEMSZ;
break;
case SUB:
assert(inst->dst.type == REG);
regs[inst->dst.reg] -= src(inst);
regs[inst->dst.reg] += MEMSZ;
regs[inst->dst.reg] %= MEMSZ;
break;
case LOAD: {
assert(inst->dst.type == REG);
int addr = src(inst);
if (addr < 0)
error("zero page load");
regs[inst->dst.reg] = mem[addr];
break;
}
case STORE: {
assert(inst->dst.type == REG);
int addr = src(inst);
if (addr < 0)
error("zero page store");
mem[addr] = regs[inst->dst.reg];
break;
}
case PUTC:
putchar(src(inst));
break;
case GETC: {
int c = getchar();
regs[inst->dst.reg] = c == EOF ? 0 : c;
regs[inst->dst.reg] += MEMSZ;
regs[inst->dst.reg] %= MEMSZ;
break;
}
case EXIT:
exit(0);
case DUMP:
break;
case EQ:
case NE:
case LT:
case GT:
case LE:
case GE:
regs[inst->dst.reg] = cmp(inst);
break;
case JEQ:
case JNE:
case JLT:
case JGT:
case JLE:
case JGE:
case JMP:
if (cmp(inst)) {
npc = value(&inst->jmp);
}
break;
default:
error("oops");
}
if (npc != -1) {
pc = npc;
break;
}
}
}
return 0;
}