-
Notifications
You must be signed in to change notification settings - Fork 1
/
generate.c
233 lines (199 loc) · 5.47 KB
/
generate.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
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
/*
* Copyright (C) 2012 Sean "rioki" Farrell
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "generate.h"
#include "cpu.h"
static program_t* prog = NULL;
#define JUMP_TABLE_MAX 1024
static struct
{
const char* name;
unsigned int pos;
} jump_table[JUMP_TABLE_MAX];
static unsigned int jump_table_size = 0;
int generate_jump_table()
{
assert(prog != NULL);
unsigned int i;
unsigned int code_point = 0;
// TODO validate uniqueness of labels
for (i = 0; i < prog->code_lines; i++)
{
if (prog->code[i].label != NULL)
{
assert(jump_table_size < JUMP_TABLE_MAX);
jump_table[jump_table_size].name = prog->code[i].label;
jump_table[jump_table_size].pos = code_point;
jump_table_size++;
}
code_point += 1;
if (prog->code[i].arg1.extra.type != NO_TYPE)
{
code_point += 1;
}
if (prog->code[i].arg2.extra.type != NO_TYPE)
{
code_point += 1;
}
}
return 0;
}
int resolve_label(unsigned int* pos, const char* label)
{
assert(pos != NULL);
unsigned int i;
for (i = 0; i < JUMP_TABLE_MAX; i++)
{
if (strcmp(jump_table[i].name, label) == 0)
{
*pos = jump_table[i].pos;
return 0;
}
}
return -1;
}
int is_simple_opcode(int opcode)
{
switch (opcode)
{
case SET_OPCODE:
case ADD_OPCODE:
case SUB_OPCODE:
case MUL_OPCODE:
case DIV_OPCODE:
case MOD_OPCODE:
case SHL_OPCODE:
case SHR_OPCODE:
case AND_OPCODE:
case BOR_OPCODE:
case XOR_OPCODE:
case IFE_OPCODE:
case IFN_OPCODE:
case IFG_OPCODE:
case IFB_OPCODE:
return 1;
default:
return 0;
}
}
/* implemented in cpu.c */
unsigned short swap_endienness(unsigned short x);
int generate_executable(FILE* fp)
{
int result = 0;
unsigned int i;
assert(fp != NULL);
for (i = 0; i < prog->code_lines; i++)
{
// instructions can be only 3 words (3 x 2 byte) long
unsigned short buff[3] = {0, 0, 0};
unsigned int size = 1;
arg_t arg1 = prog->code[i].arg1;
arg_t arg2 = prog->code[i].arg2;
buff[0] |= prog->code[i].opcode;
/* todo as value */
if (is_simple_opcode(prog->code[i].opcode))
{
assert(arg1.value <= 0x3f);
assert(arg2.value <= 0x3f);
buff[0] |= arg1.value << 4;
buff[0] |= arg2.value << 10;
if (arg1.extra.type == UINT_TYPE)
{
buff[size] = arg1.extra.ui;
size++;
}
if (arg1.extra.type == STRING_TYPE)
{
unsigned int pos = 0;
resolve_label(&pos, arg1.extra.str);
buff[size] = pos;
size++;
}
if (arg2.extra.type == UINT_TYPE)
{
buff[size] = arg2.extra.ui;
size++;
}
if (arg2.extra.type == STRING_TYPE)
{
unsigned int pos = 0;
resolve_label(&pos, arg2.extra.str);
buff[size] = pos;
size++;
}
}
else
{
assert(arg1.value <= 0x3f);
buff[0] |= arg1.value << 10;
if (arg1.extra.type == UINT_TYPE)
{
/* label */
buff[size] = arg1.extra.ui;
size++;
}
if (arg1.extra.type == STRING_TYPE)
{
unsigned int pos = 0;
resolve_label(&pos, arg1.extra.str);
buff[size] = pos;
size++;
}
}
buff[0] = swap_endienness(buff[0]);
buff[1] = swap_endienness(buff[1]);
buff[2] = swap_endienness(buff[2]);
fwrite(&buff, 2, size, fp);
}
return result;
}
int generate(const char* file, program_t* p)
{
int result = 0;
FILE* fp = NULL;
assert(p != NULL);
prog = p;
result = generate_jump_table();
if (result < 0)
{
return result;
}
if (file != NULL)
{
fp = fopen(file, "wb");
if (fp == NULL)
{
fprintf(stderr, "Failed to open %s\n", file);
return -1;
}
}
else
{
fp = stdout;
}
result = generate_executable(fp);
return result;
}