-
Notifications
You must be signed in to change notification settings - Fork 2
/
atom.c
432 lines (365 loc) · 9.03 KB
/
atom.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
/* atom.c - atomic objects from source */
/* (c) in 2010 by Volker Barthelmann and Frank Wille */
#include "vasm.h"
/* test implementation, not good */
/* searches mnemonic list and tries to parse (via the cpu module)
the operands according to the mnemonic requirements; returns an
instruction or 0 */
instruction *new_inst(char *inst,int len,int op_cnt,char **op,int *op_len)
{
#if MAX_OPERANDS!=0
operand ops[MAX_OPERANDS];
int omitted[MAX_OPERANDS]={0};
#endif
int i,j,inst_found=0,rc;
hashdata data;
instruction *new=mymalloc(sizeof(*new));
#ifdef HAVE_INSTRUCTION_EXTENSION
init_instruction_ext(&new->ext);
#endif
#ifdef NEED_CLEARED_OPERANDS
/* reset operands to allow the cpu-backend to parse them only once */
memset(ops,0,sizeof(ops));
#endif
if (find_namelen_nc(mnemohash,inst,len,&data)) {
/* instruction name fits - are operands ok? */
i = data.idx;
inst_found = 1;
/* search all mnemonics with the same name */
do {
for (j=0; j<op_cnt; j++) {
#if !ALLOW_EMPTY_OPS
if (mnemonics[i].operand_type[j] == 0) {
#if IGNORE_FIRST_EXTRA_OP
if (!j)
for (; j<op_cnt; omitted[j++]=1);
#endif
break;
}
#endif
rc = parse_operand(op[j],op_len[j],&ops[j],
mnemonics[i].operand_type[j]);
if (rc == PO_CORRUPT) {
myfree(new);
return 0;
}
if(rc == PO_NOMATCH) {
if (rc != PO_CORRUPT &&
OPERAND_OPTIONAL(mnemonics[i].operand_type[j]))
omitted[j] = 1;
else
break;
}
}
#if CPU_CHECKS_OPCNT
if (j<op_cnt) {
#else
if (j<op_cnt ||
(op_cnt<MAX_OPERANDS && mnemonics[i].operand_type[op_cnt]!=0)) {
#endif
i++;
continue;
}
new->code = i;
for (j=0; j<op_cnt; j++) {
if (omitted[j]) {
new->op[j] = 0;
}
else {
new->op[j] = mymalloc(sizeof(operand));
*new->op[j] = ops[j];
}
}
for(; j<MAX_OPERANDS; j++)
new->op[j] = 0;
return new;
i++;
}
while(i<mnemonic_cnt && !strnicmp(mnemonics[i].name,inst,len)
&& mnemonics[i].name[len]==0);
}
if (inst_found)
general_error(0);
else
general_error(1,cnvstr(inst,len));
myfree(new);
return 0;
}
dblock *new_dblock(void)
{
dblock *new = mymalloc(sizeof(*new));
new->size = 0;
new->data = 0;
new->relocs = 0;
return new;
}
sblock *new_sblock(expr *space,int size,expr *fill)
{
sblock *sb = mymalloc(sizeof(sblock));
sb->space = 0;
sb->space_exp = space;
sb->size = size;
if (!(sb->fill_exp = fill))
memset(sb->fill,0,SB_MAXSIZE);
sb->relocs = 0;
return sb;
}
static taddr space_size(sblock *sb,section *sec,taddr pc)
{
taddr space=0;
if (eval_expr(sb->space_exp,&space,sec,pc) || !final_pass)
sb->space = space;
else
general_error(30); /* expression must be constant */
if (final_pass && sb->fill_exp) {
if (sb->size <= sizeof(taddr)) {
/* space is filled with an expression which may also need relocations */
symbol *base=NULL;
taddr fill,i;
if (!eval_expr(sb->fill_exp,&fill,sec,pc)) {
base = find_base(sb->fill_exp,sec,pc);
if (!base)
general_error(38); /* illegal relocation */
}
copy_cpu_taddr(sb->fill,fill,sb->size);
if (base && !sb->relocs) {
/* generate relocations */
for (i=0; i<space; i++)
add_reloc(&sb->relocs,base,fill,REL_ABS,
sb->size<<3,(i*sb->size)<<3);
}
}
else
general_error(30); /* expression must be constant */
}
return space * (taddr)sb->size;
}
static taddr rorg_size(expr *rorg,section *sec,taddr pc)
{
taddr offs;
eval_expr(rorg,&offs,sec,pc);
offs = sec->org + offs - pc;
return offs>0 ? offs : 0;
}
/* adds an atom to the specified section; if sec==0, the current
section is used */
void add_atom(section *sec,atom *a)
{
if (!sec) {
sec = default_section();
if (!sec) {
general_error(3);
return;
}
}
a->src = cur_src;
a->line = cur_src->line;
if (sec->last) {
atom *pa = sec->last;
pa->next = a;
/* make sure that a label on the same line gets the same alignment */
if (pa->type==LABEL && pa->line==a->line &&
(a->type==INSTRUCTION || a->type==DATADEF || a->type==SPACE))
pa->align = a->align;
}
else
sec->first = a;
a->next = 0;
sec->last = a;
sec->pc = (sec->pc + a->align - 1) / a->align * a->align;
sec->pc += atom_size(a,sec,sec->pc);
if (a->align > sec->align)
sec->align = a->align;
if (produce_listing) {
a->list = last_listing;
if (last_listing) {
if (!last_listing->atom)
last_listing->atom = a;
}
}
else
a->list = 0;
}
taddr atom_size(atom *p,section *sec,taddr pc)
{
switch(p->type) {
case LABEL:
case LINE:
case OPTS:
case PRINTTEXT:
case PRINTEXPR:
return 0;
case DATA:
return p->content.db->size;
case INSTRUCTION:
return instruction_size(p->content.inst,sec,pc);
case SPACE:
return space_size(p->content.sb,sec,pc);
case DATADEF:
return (p->content.defb->bitsize+7)/8;
case RORG:
return rorg_size(p->content.roffs,sec,pc);
default:
ierror(0);
break;
}
return 0;
}
static void print_instruction(FILE *f,instruction *p)
{
int i;
printf("inst %d(%s) ",p->code,mnemonics[p->code].name);
#if MAX_OPERANDS!=0
for (i=0; i<MAX_OPERANDS; i++)
printf("%p ",(void *)p->op[i]);
#endif
}
void print_atom(FILE *f,atom *p)
{
size_t i;
rlist *rl;
switch (p->type) {
case LABEL:
fprintf(f,"symbol: ");
print_symbol(f,p->content.label);
break;
case DATA:
fprintf(f,"data(%lu): ",(unsigned long)p->content.db->size);
for (i=0;i<p->content.db->size;i++)
fprintf(f,"%02x ",(unsigned char)p->content.db->data[i]);
for (rl=p->content.db->relocs; rl; rl=rl->next)
print_reloc(f,rl->type,rl->reloc);
break;
case INSTRUCTION:
print_instruction(f,p->content.inst);
break;
case SPACE:
fprintf(f,"space(%lu,fill=",
(unsigned long)(p->content.sb->space*p->content.sb->size));
for (i=0; i<p->content.sb->size; i++)
fprintf(f,"%02x%c",(unsigned char)p->content.sb->fill[i],
(i==p->content.sb->size-1)?')':' ');
for (rl=p->content.sb->relocs; rl; rl=rl->next)
print_reloc(f,rl->type,rl->reloc);
break;
case DATADEF:
fprintf(f,"datadef(%lu bits)",(unsigned long)p->content.defb->bitsize);
break;
case LINE:
fprintf(f,"line: %d of %s",p->content.srcline,getdebugname());
break;
#ifdef HAVE_CPU_OPTS
case OPTS:
print_cpu_opts(f,p->content.opts);
break;
#endif
case PRINTTEXT:
fprintf(f,"text: \"%s\"",p->content.ptext);
break;
case PRINTEXPR:
fprintf(f,"expr: ");
print_expr(f,p->content.pexpr);
break;
case RORG:
fprintf(f,"rorg: offset ");
print_expr(f,p->content.roffs);
break;
default:
ierror(0);
}
}
atom *new_inst_atom(instruction *p)
{
atom *new = mymalloc(sizeof(*new));
new->next = 0;
new->type = INSTRUCTION;
new->align = INST_ALIGN;
new->content.inst = p;
return new;
}
atom *new_data_atom(dblock *p,int align)
{
atom *new = mymalloc(sizeof(*new));
new->next = 0;
new->type = DATA;
new->align = align;
new->content.db=p;
return new;
}
atom *new_label_atom(symbol *p)
{
atom *new = mymalloc(sizeof(*new));
new->next = 0;
new->type = LABEL;
new->align = 1;
new->content.label = p;
return new;
}
atom *new_space_atom(expr *space,int size,expr *fill)
{
atom *new = mymalloc(sizeof(*new));
int i;
if (size<1)
ierror(0); /* usually an error in syntax-module */
new->next = 0;
new->type = SPACE;
new->align = 1;
new->content.sb = new_sblock(space,size,fill);
return new;
}
atom *new_datadef_atom(taddr bitsize,operand *op)
{
atom *new = mymalloc(sizeof(*new));
new->next = 0;
new->type = DATADEF;
new->align = DATA_ALIGN(bitsize);
new->content.defb = mymalloc(sizeof(*new->content.defb));
new->content.defb->bitsize = bitsize;
new->content.defb->op = op;
return new;
}
atom *new_srcline_atom(int line)
{
atom *new = mymalloc(sizeof(*new));
new->next = 0;
new->type = LINE;
new->align = 1;
new->content.srcline = line;
return new;
}
atom *new_opts_atom(void *o)
{
atom *new = mymalloc(sizeof(*new));
new->next = 0;
new->type = OPTS;
new->align = 1;
new->content.opts = o;
return new;
}
atom *new_text_atom(char *txt)
{
atom *new = mymalloc(sizeof(*new));
new->next = 0;
new->type = PRINTTEXT;
new->align = 1;
new->content.ptext = txt;
return new;
}
atom *new_expr_atom(expr *x)
{
atom *new = mymalloc(sizeof(*new));
new->next = 0;
new->type = PRINTEXPR;
new->align = 1;
new->content.pexpr = x;
return new;
}
atom *new_rorg_atom(expr *offs)
{
atom *new = mymalloc(sizeof(*new));
new->next = 0;
new->type = RORG;
new->align = 1;
new->content.roffs = offs;
return new;
}