-
Notifications
You must be signed in to change notification settings - Fork 0
/
program.d
339 lines (280 loc) · 11.1 KB
/
program.d
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
/********************************************************************************
* program.d: *
* *
* errata: *
* - does not handle eof in stdin from console *
* - does not handle process redirrection (ie. /dev/fd/63) *
* - lines ending without newlines _______ *
* *
* 2016 - Ben Perlin *
*******************************************************************************/
import std.algorithm : sort;
import std.ascii;
import std.exception;
import std.format;
import std.range;
import std.stdio;
import std.string;
import instruction, util;
struct Program
{
private:
uint startAddress, nextAddress;
Instruction[] code;
uint[string] symbolTable;
bool startDetermined;
bool strictCompatibility = false;
string[uint] reverseSymbolTable;
invariant() {
assert((startAddress & 0x3) == 0);
assert((nextAddress & 0x3) == 0);
assert(nextAddress >= startAddress); /* no overflow */
}
void parseLineASM(const string line, const uint lineNumber) {
enum ScannerState {leading, identifier, loaded, token, seperator, negative}
string processedLine = line.detab(8);
ScannerState state = ScannerState.leading;
Token[] tokens;
char[] token; /* the token being constructed */
uint tokenColumn; /* column of the token currently being constructed */
uint nLabels;
void addLabel(const string label) {
if (strictCompatibility && (nLabels > 0)) {
formatException("Error on line %d: strict compatibility mode disallows multiple labels per line\n\n%s",
lineNumber, line);
}
if (label in symbolTable) {
formatException("Error on line %s: duplicate label %s\n\n%s\n%s",
lineNumber, label, processedLine, carrotLine(tokenColumn));
}
symbolTable[label] = nextAddress;
}
uint column = 0;
// column numbering starts at 0
void scannerError(uint columnNumber, dchar c) {
formatException("Error scanning line %s: unexpected charactor '%s'\n\n%s\n%s",
lineNumber, c, processedLine, carrotLine(columnNumber));
}
scanner:
foreach (dc; processedLine.stride(1)) {
enforce(isASCII(dc), "We don't take kindly to non ASCII charactors here");
char c = cast(char) dc; /* cast dchar to char after verifing it is ASCII */
assert(c != '\t'); // check detabber
final switch (state) {
case ScannerState.leading:
switch (c) {
case ' ': break;
case '_': goto case;
case 'a': .. case 'z': goto case;
case 'A': .. case 'Z':
state = ScannerState.identifier;
token ~= c;
tokenColumn = column;
break;
case '\r', '\n', '#': break scanner;
default: scannerError(column, c);
}
break;
case ScannerState.identifier:
switch (c) {
case '_': goto case;
case 'a': .. case 'z': goto case;
case 'A': .. case 'Z': goto case;
case '0': .. case '9':
token ~= c;
break;
case ':':
addLabel(token.idup());
token = [];
state = ScannerState.leading;
break;
case ' ':
state = ScannerState.loaded;
break;
default: scannerError(column, c);
}
break;
case ScannerState.loaded:
switch (c) {
case ' ': break;
case ':':
addLabel(token.idup());
token = [];
state = ScannerState.leading;
break;
case '$', '_': goto case;
case 'a': .. case 'z': goto case;
case 'A': .. case 'Z': goto case;
case '0': .. case '9':
tokens ~= Token(token.idup(), tokenColumn);
token = [c];
tokenColumn = column;
state = ScannerState.token;
break;
default: scannerError(column, c); /* includes starting a comment here */
}
break;
case ScannerState.token:
switch (c) {
case '_': goto case;
case 'a': .. case 'z': goto case;
case 'A': .. case 'Z': goto case;
case '0': .. case '9':
token ~= c;
break;
case '(',')':
tokens ~= Token(token.idup(), tokenColumn);
token = [c];
tokens ~= Token(token.idup(), column);
token = [];
state = ScannerState.seperator;
break;
case ' ', ',':
tokens ~= Token(token.idup(), tokenColumn);
token = [];
state = ScannerState.seperator;
break;
case '#', '\r', '\n':
tokens ~= Token(token.idup(), tokenColumn);
token = [];
break scanner;
default: scannerError(column, c);
}
break;
case ScannerState.seperator:
switch (c) {
case ' ', ',': break;
case '$', '_': goto case;
case 'a': .. case 'z': goto case;
case 'A': .. case 'Z': goto case;
case '0': .. case '9':
token = [c];
tokenColumn = column;
state = ScannerState.token;
break;
case '-':
token = [c];
tokenColumn = column;
state = ScannerState.negative;
break;
case '\r', '\n', '#':
break scanner;
default: scannerError(column, c);
}
break;
case ScannerState.negative:
switch (c) {
case ' ': break; /* drop whitespace */
case '0': .. case '9':
token ~= c;
state = ScannerState.token;
break;
default: scannerError(column, c);
}
break;
}
column++;
}
if (token.length > 0) {
tokens ~= Token(token.idup(), tokenColumn);
}
if (tokens.length > 0) {
code ~= Instruction.generate(nextAddress, tokens, processedLine, lineNumber);
nextAddress += 4;
}
}
void parseLineBin(string line, uint lineNumber) {
uint address;
uint binaryInstruction;
uint hexInstruction;
// ERATA note does not handle uppercase x
uint nMatched = formattedRead(line, " [0x%x] %b 0x%x", &address, &binaryInstruction, &hexInstruction);
if (nMatched != 3) {
formatException("Error on line %d: Invalid format, expected \" [0x%%x] %%b %%x\"\n\n%s",
lineNumber, line);
}
if (binaryInstruction != hexInstruction) {
formatException("Error on line %d: binary and hex instructions do not match\n\n%s",
lineNumber, line);
}
if (startDetermined) {
if (address != nextAddress) {
formatException("Error on line %d: address given [0x%X] does not match expected [0x%X]\n\n%s",
lineNumber, address, nextAddress, line);
}
} else {
startAddress = address;
nextAddress = address;
startDetermined = true;
}
Instruction newInstruction = Instruction.decode(address, hexInstruction, line, lineNumber);
newInstruction.requestLabel(reverseSymbolTable);
code ~= newInstruction;
nextAddress += 4;
}
public:
/* Read in an assembly file to assemble */
void assemble(File codeFile, const uint startAddress, bool strictCompatibility = false) {
this.startAddress = startAddress;
this.strictCompatibility = strictCompatibility;
startDetermined = true;
nextAddress = startAddress;
uint lineNumber = 1;
foreach (line; codeFile.byLineCopy(KeepTerminator.yes)) {
assert(lineNumber > 0);
parseLineASM(line, lineNumber);
lineNumber++;
}
foreach (instruction; code) {
instruction.patchup(symbolTable);
}
}
/* Read in an assembled file to disassemble */
void disassemble(File codeFile) {
uint lineNumber = 1;
foreach (line; codeFile.byLineCopy()) {
assert(lineNumber > 0);
parseLineBin(line, lineNumber);
lineNumber++;
}
/* create labels for addresses corresponding to lines of code */
uint index;
foreach (address; reverseSymbolTable.keys.sort()) {
if (startAddress <= address && address <= nextAddress) {
string label = format("L%d", index);
symbolTable[label] = address;
reverseSymbolTable[address] = label;
index++;
}
}
foreach (instruction; code) {
instruction.patchup(reverseSymbolTable);
}
}
void printAssembled(File outputFile) const {
// outputFile.writeln("[Address] Instruction");
foreach (instruction; code) {
outputFile.writefln("[0x%08X]\t%032b\t0x%08X", instruction.address,
instruction.binaryInstruction, instruction.binaryInstruction);
}
}
void printDisassembled(File outputFile) const {
foreach (instruction; code) {
string label = " ";
if (instruction.address in reverseSymbolTable) {
label = format("%-8s", reverseSymbolTable[instruction.address] ~ ':');
}
outputFile.writeln(label, instruction.symbolicValue);
}
if (nextAddress in reverseSymbolTable) {
outputFile.writefln("%s:", reverseSymbolTable[nextAddress]);
}
}
void printSymbolTable(File outputFile) const {
outputFile.writeln("Symbol Table");
outputFile.writeln("Label : Address");
foreach (label; symbolTable.keys.sort()) {
outputFile.writefln("%-10s: [0x%X]", label, symbolTable[label]);
}
}
}