-
Notifications
You must be signed in to change notification settings - Fork 0
/
assembler.c
596 lines (498 loc) · 19.3 KB
/
assembler.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
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
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
#include <assembler.h>
#include <asmutils.h>
#include <mnemonics.h>
#include <executables.h>
#include <string.h>
#include <stdint.h>
#include <stdlib.h>
bool parse_source_lvl1(char* source, lvl1_line_t** lines, int* line_num) {
bool errors_found = false;
char* buffer = (char*) malloc(4096);
memset(buffer, 0, 4096);
int buffer_index = 0;
int line_number = 0;
int sub_index = 0;
int mnemonic = 0;
int operands[MAX_OPERANDS];
bool was_code = false;
bool comment = false;
bool escape = false;
bool is_string = false;
bool is_register_info = false;
char string_char = 0;
while (*source) {
char current = *source++;
bool will_escape = false;
switch (current) {
case ' ': //These are characters that separate operands
case '\t':
case ';':
case ',': {
if (comment || is_register_info) {
break;
}
if (is_string) {
buffer[buffer_index++] = current;
break;
}
if (was_code) {
buffer[buffer_index++] = 0;
was_code = false;
} else if (current == ',') {
printf("Error line %d: Unexpected comma\n", line_number + 1);
errors_found = true;
break;
} else if (current == ';') {
comment = true;
}
break;
}
case '\n': { //On a new line, we can add a lvl1_line_t to our list
line_number++;
comment = false;
was_code = false;
is_register_info = false;
if (buffer_index == 0) {
break;
}
buffer_index++;
*lines = (lvl1_line_t*) realloc(*lines, sizeof(lvl1_line_t) * (*line_num + 1));
char* tmp_buffer = (char*) malloc(buffer_index); //The string is already null terminated
memcpy(tmp_buffer, buffer, buffer_index);
(*lines)[*line_num].buffer = tmp_buffer;
(*lines)[*line_num].buffer_size = buffer_index;
(*lines)[*line_num].line_num = line_number;
(*lines)[*line_num].part_num = sub_index;
(*lines)[*line_num].mnemonic = (char*) ((uint64_t) tmp_buffer + mnemonic);
(*lines)[*line_num].operands = (char**) malloc(sizeof(char*) * sub_index);
for (int i = 0; i < sub_index; i++) {
(*lines)[*line_num].operands[i] = (char*) ((uint64_t) tmp_buffer + operands[i]);
}
(*line_num)++;
memset(buffer, 0, 4096);
buffer_index = 0;
sub_index = 0;
mnemonic = 0;
memset(operands, 0, sizeof(operands));
break;
}
default: { //By default, we just add the character to the buffer
if (comment) {
break;
}
if (current == '[') {
if (is_register_info) {
printf("Error line %d: Unexpected [\n", line_number + 1);
errors_found = true;
break;
}
is_register_info = true;
} else if (current == ']') {
if (!is_register_info) {
printf("Error line %d: Unexpected ]\n", line_number + 1);
errors_found = true;
break;
}
is_register_info = false;
}
if (!was_code) { //If this is the start of a new operand, we need to set this index as one
was_code = true;
if (sub_index >= MAX_OPERANDS) {
printf("Error line %d: Too many operands\n", line_number + 1);
errors_found = true;
break;
}
if (sub_index == 0) {
mnemonic = buffer_index;
} else {
operands[sub_index - 1] = buffer_index;
}
sub_index++;
}
if (!escape) {
if (current == '\\') {
will_escape = true;
break;
} else if (current == '"' || current == '\'') {
if (is_string) {
if (current == string_char) {
is_string = false;
string_char = 0;
}
} else {
is_string = true;
string_char = current;
}
}
}
buffer[buffer_index++] = current;
break;
}
}
if (will_escape) {
escape = true;
} else {
escape = false;
}
}
free(buffer);
return errors_found;
}
uint64_t* process_number(char* str, int line_num, bool can_be_register, bool* errors_found) {
uint64_t value;
if (str[0] == '0' && str[1] == 'x') { //Hexadecimal
str += 2;
str_to_upper(str);
if (!is_hex(str)) {
printf("Error line %d: Invalid hexadecimal number \"%s\"\n", line_num, str);
*errors_found = true;
return 0;
}
if (strlen(str) > 16) {
printf("Error line %d: Hexadecimal number too large\n", line_num);
*errors_found = true;
return 0;
}
value = hex_str_to_num(str);
} else if (str[0] == '0' && str[1] == 'b') { //Binary
str += 2;
str_to_upper(str);
if (!is_binary(str)) {
printf("Error line %d: Invalid binary number \"%s\"\n", line_num, str);
*errors_found = true;
return 0;
}
if (strlen(str) > 64) {
printf("Error line %d: Binary number too large\n", line_num);
*errors_found = true;
return 0;
}
value = binary_str_to_num(str);
} else { //Decimal
if (!is_digits(str)) {
if (can_be_register) {
return 0;
}
printf("Error line %d: Invalid decimal number \"%s\"\n", line_num, str);
*errors_found = true;
return 0;
}
if (strlen(str) > 20) {
printf("Error line %d: Decimal number too large\n", line_num);
*errors_found = true;
return 0;
}
value = str_to_num(str);
}
uint64_t* return_value = (uint64_t*) malloc(sizeof(uint64_t));
*return_value = value;
return return_value;
}
operand_t process_operand(char* operand, int line_num, bool* errors_found) {
operand_t return_op;
return_op.displacement = 0;
if (operand[0] == '$') { //Operand is a label
operand++;
return_op.type = LABEL_OPERAND;
int size = strlen(operand);
char* label = (char*) malloc(size + 1);
memcpy(label, operand, size);
label[size] = 0;
return_op.size = size + 1;
return_op.value = label;
} else if (operand[0] == '\"' || operand[0] == '\'') { //Operand is a string
char delim = operand[0];
operand++;
return_op.type = STRING_OPERAND;
char* end = find_string_end(operand, delim);
if (!end) {
printf("Error line %d: String not terminated\n", line_num);
*errors_found = true;
return return_op;
}
int size = end - operand;
char* string = (char*) malloc(size + 1);
memcpy(string, operand, size);
string[size] = 0;
return_op.size = size + 1;
return_op.value = string;
} else { //Operand is a register or an address
uint64_t* address = process_number(operand, line_num, true, errors_found);
if (address) {
return_op.type = IMMEDIATE_OPERAND;
return_op.size = sizeof(uint64_t);
return_op.value = address;
return return_op;
}
//We made sure that this isn't an address, so is has to be a register
return_op.type = REGISTER_OPERAND;
if (operand[0] == '[' && operand[strlen(operand) - 1] == ']') { //Register used as an address
return_op.indirect = true;
//Check first to see if it isn't a relative label, in which case
if (strncmp(operand, "[rel$", 5) == 0) {
operand += 5;
operand[strlen(operand) - 1] = 0;
return_op.type = LABEL_OPERAND;
int size = strlen(operand);
char* label = (char*) malloc(size + 1);
memcpy(label, operand, size);
label[size] = 0;
return_op.size = size + 1;
return_op.value = label;
return return_op;
}
//Find displacement
bool positive = true;
char* disp_str = strchr(operand, '+');
if (!disp_str) {
disp_str = strchr(operand, '-');
positive = false;
}
if (disp_str) {
*disp_str = 0;
disp_str++; //Remove the + or -
disp_str[strlen(disp_str) - 1] = 0; //Remove the ]
uint64_t* displacement_ptr = process_number(disp_str, line_num, false, errors_found);
if (!displacement_ptr) {
return return_op;
}
uint64_t displacement_val = *displacement_ptr;
free(displacement_ptr);
if (displacement_val > INT32_MAX) {
printf("Error line %d: Displacement too large\n", line_num);
*errors_found = true;
return return_op;
}
return_op.displacement = displacement_val;
if (positive) {
return_op.displacement = displacement_val;
} else {
return_op.displacement = -displacement_val;
}
} else {
operand[strlen(operand) - 1] = 0;
}
operand++;
} else {
return_op.indirect = false;
}
str_to_upper(operand);
cpu_register_t reg = get_register(operand);
if (reg.size == 0) {
printf("Error line %d: Invalid register \"%s\"\n", line_num, operand);
*errors_found = true;
return return_op;
}
return_op.size = sizeof(cpu_register_t);
return_op.value = malloc(sizeof(cpu_register_t));
memcpy(return_op.value, ®, sizeof(cpu_register_t));
}
return return_op;
}
bool parse_source_lvl2(lvl1_line_t** lines, int line_num, lvl2_line_t** lines_out) {
bool errors_found = false;
*lines_out = (lvl2_line_t*) malloc(sizeof(lvl2_line_t) * line_num);
//Go through the split lines and process them to extract the operands and their types
for (int i = 0; i < line_num; i++) {
lvl1_line_t* line = &(*lines)[i];
if (line->part_num < 1) {
printf("Error: Lexer got empty line at %d for some reason!\n", line->line_num);
errors_found = true;
}
int mnsize = strlen(line->mnemonic);
operand_t operands[MAX_OPERANDS];
lvl2_line_t* new_line = &(*lines_out)[i];
new_line->line_num = line->line_num;
new_line->operand_num = line->part_num - 1;
if (line->mnemonic[mnsize - 1] == ':') { //Label definition
if (new_line->operand_num != 0) {
printf("Error line %d: Label definition can't have operands\n", line->line_num);
errors_found = true;
}
} else if (line->mnemonic[0] == '.') { //Segment definition
if (new_line->operand_num != 0) {
printf("Error line %d: Segment definition can't have operands\n", line->line_num);
errors_found = true;
}
str_to_upper(line->mnemonic);
} else { //Instruction
str_to_upper(line->mnemonic);
if (!is_letters(line->mnemonic)) {
printf("Error line %d: Invalid mnemonic \"%s\"\n", line->line_num, line->mnemonic);
errors_found = true;
}
//Process the operands one by one
for (int j = 0; j < new_line->operand_num; j++) {
operands[j] = process_operand(line->operands[j], line->line_num, &errors_found);
}
}
//Copy the processed line to the output
new_line->mnemonic = (char*) malloc(mnsize + 1);
memcpy(new_line->mnemonic, line->mnemonic, mnsize);
new_line->mnemonic[mnsize] = 0;
if (new_line->operand_num > 0) {
new_line->operands = (operand_t*) malloc(sizeof(operand_t) * line->part_num);
memcpy(new_line->operands, &operands, sizeof(operand_t) * line->part_num);
} else {
new_line->operands = 0;
}
}
return errors_found;
}
bool lex_source(lvl2_line_t** lines, int line_num, segment_data_t* segments, label_t** label_definitions, int* label_definition_num) {
bool errors_found = false;
segment_type_t current_segment_type = TEXT;
segment_data_t* current_segment = &segments[TEXT];
for (int i = 0; i < line_num; i++) {
lvl2_line_t* line = &(*lines)[i];
int mnsize = strlen(line->mnemonic);
if (line->mnemonic[mnsize - 1] == ':') { //Label definition
line->mnemonic[mnsize - 1] = 0;
//Check if the label is already defined
for (int j = 0; j < i; j++) {
if (strcmp((*lines)[j].mnemonic, line->mnemonic) == 0) {
printf("Error line %d: Label \"%s\" already defined\n", line->line_num, line->mnemonic);
errors_found = true;
continue;
}
}
//Add the label to the list of definitions
int current_label_definition_num = (*label_definition_num)++;
*label_definitions = (label_t*) realloc(*label_definitions, sizeof(label_t) * (*label_definition_num));
label_t* new_label = &(*label_definitions)[current_label_definition_num];
new_label->name = (char*) malloc(mnsize);
memcpy(new_label->name, line->mnemonic, mnsize);
new_label->segment = current_segment_type;
new_label->local_address = current_segment->opcode_num;
} else if (line->mnemonic[0] == '.') { //Segment definition
if (strcmp(line->mnemonic, ".TEXT") == 0) {
current_segment_type = TEXT;
} else if (strcmp(line->mnemonic, ".DATA") == 0) {
current_segment_type = DATA;
} else if (strcmp(line->mnemonic, ".RODATA") == 0) {
current_segment_type = RODATA;
} else if (strcmp(line->mnemonic, ".BSS") == 0) {
current_segment_type = BSS;
} else {
printf("Error line %d: Unknown segment \"%s\"\n", line->line_num, line->mnemonic);
errors_found = true;
continue;
}
current_segment = &segments[current_segment_type];
} else {
if (strcmp(line->mnemonic, "NOP") == 0) {
append_opcode(0x90);
}
check_mnemonic(HLT)
check_mnemonic(CALL)
check_mnemonic(JMP)
check_mnemonic(RET)
check_mnemonic(JE)
check_mnemonic(JG)
check_mnemonic(JGE)
check_mnemonic(JL)
check_mnemonic(JLE)
check_mnemonic(JNE)
check_mnemonic(DB)
check_mnemonic(DDW)
check_mnemonic(DQW)
check_mnemonic(DW)
check_mnemonic(ADD)
check_mnemonic(DEC)
check_mnemonic(DIV)
check_mnemonic(INC)
check_mnemonic(MUL)
check_mnemonic(SUB)
check_mnemonic(LEA)
check_mnemonic(MOV)
check_mnemonic(CMP)
check_mnemonic(INT)
check_mnemonic(SYSCALL)
else {
printf("Error line %d: Unknown mnemonic \"%s\"\n", line->line_num, line->mnemonic);
errors_found = true;
}
}
}
return errors_found;
}
bool assemble(FILE* source, FILE* output, executable_format_t format) {
fseek(source, 0, SEEK_END);
size_t file_size = ftell(source);
fseek(source, 0, SEEK_SET);
char* source_buffer = (char*) malloc(file_size + 2);
fread(source_buffer, file_size, 1, source);
source_buffer[file_size] = '\n';
source_buffer[file_size + 1] = '\0';
int line_num = 0;
//Level 1 parse
lvl1_line_t* lines_lvl1 = 0;
bool errors_found = parse_source_lvl1(source_buffer, &lines_lvl1, &line_num);
if (errors_found) {
return false;
}
free(source_buffer);
//Level 2 parse
lvl2_line_t* lines_lvl2 = 0;
errors_found = parse_source_lvl2(&lines_lvl1, line_num, &lines_lvl2);
if (errors_found) {
return false;
}
for (int i = 0; i < line_num; i++) {
free(lines_lvl1[i].buffer);
}
free(lines_lvl1);
//Lex to produce opcodes
segment_data_t segments[SEGMENT_TYPE_NUM];
memset(segments, 0, sizeof(segments));
for (int i = 0; i < SEGMENT_TYPE_NUM; i++) {
segments[i].segment_type = i;
}
label_t* label_definitions = 0;
int label_definition_num = 0;
errors_found = lex_source(&lines_lvl2, line_num, segments, &label_definitions, &label_definition_num);
if (errors_found) {
return false;
}
for (int i = 0; i < line_num; i++) {
free(lines_lvl2[i].mnemonic);
operand_t* operands = lines_lvl2[i].operands;
if (operands != 0) {
for (int j = 0; j < lines_lvl2[i].operand_num - 1; j++) {
free(lines_lvl2[i].operands[j].value);
}
free(lines_lvl2[i].operands);
}
}
free(lines_lvl2);
bool no_code_generated = true;
for (int i = 0; i < SEGMENT_TYPE_NUM; i++) {
if (segments[i].opcode_num > 0) {
no_code_generated = false;
break;
}
}
if (no_code_generated) {
printf("Error: No code generated!\n");
return false;
}
uint64_t entry_offset = 0; //TODO: Maybe add this?
errors_found = write_exec(format, output, entry_offset, segments, label_definitions, label_definition_num);
//Now we're done with the labels, we can free the definitions
if (label_definition_num != 0) {
for (int i = 0; i < label_definition_num; i++) {
free(label_definitions[i].name);
}
free(label_definitions);
}
//Free the segments and any data they contain
for (int i = 0; i < SEGMENT_TYPE_NUM; i++) {
if (segments[i].opcode_num != 0) {
free(segments[i].opcodes);
}
if (segments[i].replacement_num != 0) {
free(segments[i].replacements);
}
}
return !errors_found;
}