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
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
|
#include <stdlib.h>
#include <assert.h>
#include <string.h>
#include <stdio.h>
#include "semantics.h"
#include "ast.h"
#define NEW(type) ((type *)malloc(sizeof(type)))
#define CHECK_TYPE(p, _type) assert(p->type == _type)
#define ERROR(row, col) print_error(err_buff, NULL, row, col, 0)
#define WARNING(row, col) print_error(err_buff, NULL, row, col, 1)
#ifdef CIBIC_DEBUG
CTable_t ctable_create(Hashfunc_t hfunc, Printfunc_t pfunc) {
CTable_t ct = NEW(CTable);
memset(ct->head, 0, sizeof(CTNode*) * MAX_TABLE_SIZE);
ct->hfunc = hfunc;
ct->pfunc = pfunc;
return ct;
}
#else
CTable_t ctable_create(Hashfunc_t hfunc) {
CTable_t ct = NEW(CTable);
memset(ct->head, 0, sizeof(CTNode*) * MAX_TABLE_SIZE);
ct->hfunc = hfunc;
return ct;
}
#endif
extern void print_error(char *, char *, int, int, int);
extern char *load_line(int);
static char err_buff[MAX_ERROR_BUFF];
void *ctable_lookup(CTable_t ct, const char *key) {
unsigned int hv = ct->hfunc(key) % MAX_TABLE_SIZE;
CTNode *p = ct->head[hv];
for (; p; p = p->next)
if (!strcmp(p->key, key))
return p->val;
return NULL; /* not found */
}
int ctable_insert(CTable_t ct, const char *key, void *val, int lvl) {
unsigned int hv = ct->hfunc(key) % MAX_TABLE_SIZE;
CTNode *p = ct->head[hv];
CTNode *np;
for (; p && p->lvl == lvl; p = p->next)
if (!strcmp(p->key, key))
return 0; /* conflict */
np = NEW(CTNode);
np->key = key;
np->val = val;
np->lvl = lvl;
np->next = ct->head[hv];
ct->head[hv] = np;
return 1;
}
void ctable_clip(CTable_t ct, const char *key, int max_lvl) {
unsigned int hv = ct->hfunc(key) % MAX_TABLE_SIZE;
CTNode *p = ct->head[hv], *np;
for (; p && p->lvl > max_lvl; p = np)
{
np = p->next;
free(p);
}
ct->head[hv] = p;
}
CScope_t cscope_create() {
CScope_t p = NEW(CScope);
p->lvl = -1;
p->top = NULL;
#ifdef CIBIC_DEBUG
p->tvar = ctable_create(bkdr_hash, ctable_cvar_print);
p->ttype = ctable_create(bkdr_hash, ctable_ctype_print);
#else
p->tvar = ctable_create(bkdr_hash);
p->ttype = ctable_create(bkdr_hash);
#endif
cscope_enter(p);
return p;
}
int cscope_push_var(CScope_t cs, CVar_t var) {
#ifdef CIBIC_DEBUG
assert(cs->top);
#endif
if (ctable_insert(cs->tvar, var->name, var, cs->lvl))
{
CSVar *csvar = NEW(CSVar);
csvar->var = var;
csvar->next = cs->top->vhead;
cs->top->vhead = csvar;
return 1;
}
else return 0; /* naming conflict */
}
int cscope_push_type(CScope_t cs, CType_t type) {
#ifdef CIBIC_DEBUG
assert(cs->top);
#endif
if (ctable_insert(cs->ttype, type->name, type, cs->lvl))
{
CSType *cstype = NEW(CSType);
cstype->type = type;
cstype->next = cs->top->thead;
cs->top->thead = cstype;
return 1;
}
else return 0; /* naming conflict */
}
void cscope_enter(CScope_t cs) {
CSNode *np = NEW(CSNode);
np->next = cs->top;
np->vhead = NULL;
np->thead = NULL;
cs->top = np;
cs->lvl++;
}
void cscope_exit(CScope_t cs) {
CSNode *top_o = cs->top;
CSVar *vp;
CSType *tp;
cs->lvl--;
cs->top = top_o->next;
for (vp = top_o->vhead; vp; vp = vp->next)
ctable_clip(cs->tvar, vp->var->name, cs->lvl);
for (tp = top_o->thead; tp; tp = tp->next)
ctable_clip(cs->ttype, tp->type->name, cs->lvl);
free(top_o);
}
void ctable_debug_print(CTable_t ct) {
int i;
fprintf(stderr, "*** CTable ***\n");
for (i = 0; i < MAX_TABLE_SIZE; i++)
if (ct->head[i])
{
CTNode *p;
fprintf(stderr, "[%04d]", i);
for (p = ct->head[i]; p; p = p->next)
fprintf(stderr, "->[%s:%d]", ct->pfunc(p->val), p->lvl);
fprintf(stderr, "\n");
}
fprintf(stderr, "*** CTable ***\n");
}
void cscope_debug_print(CScope_t cs) {
int lvl = cs->lvl;
CSNode *p;
fprintf(stderr, "\n****** CScope ******\n");
for (p = cs->top; p; p = p->next)
{
CSVar *vp;
CSType *tp;
fprintf(stderr, "Level %d:\n", lvl--);
fprintf(stderr, "Vars: ");
for (vp = p->vhead; vp; vp = vp->next)
fprintf(stderr, "%s ", vp->var->name);
fprintf(stderr, "\nTypes: ");
for (tp = p->thead; tp; tp = tp->next)
fprintf(stderr, "%s ", tp->type->name);
fprintf(stderr, "\n\n");
}
fprintf(stderr, "Var Table:\n");
ctable_debug_print(cs->tvar);
fprintf(stderr, "Type Table:\n");
ctable_debug_print(cs->ttype);
fprintf(stderr, "****** CScope ******\n\n");
}
CVar_t cscope_lookup_var(CScope_t cs, const char *name) {
return ctable_lookup(cs->tvar, name);
}
CType_t cscope_lookup_type(CScope_t cs, const char *name) {
return ctable_lookup(cs->ttype, name);
}
unsigned int bkdr_hash(const char *str) {
unsigned int seed = 131;
unsigned int hv = 0;
while (*str)
hv = hv * seed + (unsigned)(*str++);
return hv;
}
const char *ctable_cvar_print(void *var) {
static char buff[MAX_DEBUG_PRINT_BUFF];
sprintf(buff, "%s@%lx", ((CVar_t )var)->name, (size_t)var);
return buff;
}
const char *ctable_ctype_print(void *type) {
static char buff[MAX_DEBUG_PRINT_BUFF];
sprintf(buff, "%s@%lx", ((CType_t )type)->name, (size_t)type);
return buff;
}
CVar_t cvar_create(const char *name, CType_t type, CNode *ast) {
CVar_t cv = NEW(CVar);
cv->name = name;
cv->type = type;
cv->ast = ast;
return cv;
}
CType_t ctype_create(const char *name, int type, CNode *ast) {
CType_t ct = NEW(CType);
ct->name = name;
ct->type = type;
ct->ast = ast;
switch (type)
{
case CINT: ct->size = INT_SIZE; break;
case CCHAR: ct->size = CHAR_SIZE; break;
case CVOID: ct->size = 0; break;
}
return ct;
}
void ctype_print(CType_t);
void cvar_print(CVar_t cv) {
fprintf(stderr, "[var@%lx:%s]->", (size_t)cv, cv->name);
ctype_print(cv->type);
}
void ctype_print(CType_t ct) {
switch (ct->type)
{
case CINT: fprintf(stderr, "[int]"); break;
case CCHAR: fprintf(stderr, "[char]"); break;
case CVOID: fprintf(stderr, "[void]"); break;
case CSTRUCT: case CUNION:
{
CTable_t f = ct->rec.fields;
int i;
CTNode *fn;
fprintf(stderr, "[%s@%lx:(name:%s|fields:",
ct->type == CSTRUCT ? "struct" : "union",
(size_t)ct,
ct->name);
if (f)
{
int first = 1;
for (i = 0; i < MAX_TABLE_SIZE; i++)
for (fn = f->head[i]; fn; fn = fn->next)
{
fprintf(stderr, "%s", first ? (first = 0, "") : ",");
fprintf(stderr, "%s:", fn->key);
cvar_print((CVar_t)fn->val);
}
}
fprintf(stderr, ")]");
}
break;
case CARR:
{
fprintf(stderr, "[arr:(%d)]->", ct->rec.arr.len);
ctype_print(ct->rec.arr.elem);
}
break;
case CPTR:
{
fprintf(stderr, "[ptr]->");
ctype_print(ct->rec.ref);
}
break;
case CFUNC:
{
CVar_t p;
fprintf(stderr, "[func:(name:%s|params:", ct->name);
for (p = ct->rec.func.params; p; p = p->next)
{
cvar_print(p);
if (p->next) fprintf(stderr, ",");
}
fprintf(stderr, "|local:");
for (p = ct->rec.func.local; p; p = p->next)
{
cvar_print(p);
if (p->next) fprintf(stderr, ",");
}
fprintf(stderr, ")]->");
ctype_print(ct->rec.func.ret);
}
break;
}
}
static CType_t type_merge(CType_t new, CScope_t scope) {
CType_t old;
if (cscope_push_type(scope, new))
return new;
else
old = cscope_lookup_type(scope, new->name);
if (old->type != new->type)
{
sprintf(err_buff, "conflicting types of '%s'", new->name);
ERROR(new->ast->loc.row, new->ast->loc.col);
}
if (!new->rec.fields)
return old;
if (old->rec.fields)
{
sprintf(err_buff, "redefinition of '%s'", new->name);
ERROR(new->ast->loc.row, new->ast->loc.col);
}
/* complete the type */
old->next = new->next;
old->rec.fields = new->rec.fields;
old->ast = new->ast;
free(new);
return old;
}
int is_same_type(CType_t typea, CType_t typeb) {
if (typea == typeb) return 1;
if (typea->type != typeb->type) return 0;
switch (typea->type)
{
case CSTRUCT: case CUNION:
return typea == typeb;
case CARR:
if (typea->rec.arr.len != typeb->rec.arr.len)
return 0;
return is_same_type(typea->rec.arr.elem,
typeb->rec.arr.elem);
case CPTR:
return is_same_type(typea->rec.ref,
typeb->rec.ref);
case CFUNC:
{
CVar_t pa, pb;
for (pa = typea->rec.func.params,
pb = typeb->rec.func.params; pa && pb;
pa = pa->next, pb = pb->next)
if (!is_same_type(pa->type, pb->type))
return 0;
if (pa || pb)
return 0; /* different number of parameters */
break;
}
case CINT: case CCHAR: case CVOID:
;
break;
}
return 1;
}
static CVar_t var_merge(CVar_t new, CScope_t scope) {
CVar_t old;
if (cscope_push_var(scope, new))
return new;
else
old = cscope_lookup_var(scope, new->name);
if (!is_same_type(old->type, new->type) || scope->lvl > 0)
{
sprintf(err_buff, "conflicting types of '%s'", new->name);
ERROR(new->ast->loc.row, new->ast->loc.col);
}
free(new);
return old;
}
CTable_t semantics_fields(CNode *, CScope_t scope);
CType_t semantics_type_spec(CNode *p, CScope_t scope) {
CHECK_TYPE(p, TYPE_SPEC);
CType_t type;
switch (p->rec.subtype)
{
case KW_VOID: type = ctype_create("", CVOID, p); break;
case KW_CHAR: type = ctype_create("", CCHAR, p); break;
case KW_INT: type = ctype_create("", CINT, p); break;
case KW_STRUCT: case KW_UNION:
{
CNode *id = p->chd,
*fields = p->chd->next;
type = ctype_create(id->type == NOP ? "" : id->rec.strval,
p->rec.subtype == KW_STRUCT ? CSTRUCT : CUNION,
p);
if (fields->type == NOP)
type->rec.fields = NULL; /* incomplete type */
else
type->rec.fields = semantics_fields(fields, scope);
if (id->type != NOP)
type = type_merge(type, scope);
}
break;
default: assert(0);
}
return type;
}
CVar_t semantics_declr(CNode *, CType_t, CScope_t);
CVar_t semantics_p_decl(CNode *p, CScope_t scope) {
CHECK_TYPE(p, PLAIN_DECL);
return semantics_declr(p->chd->next,
semantics_type_spec(p->chd, scope),
scope);
}
CVar_t semantics_params(CNode *p, CScope_t scope) {
CHECK_TYPE(p, PARAMS);
p = p->chd;
if (p->type == NOP) return NULL; /* void arguments */
CVar_t params = semantics_p_decl(p, scope);
cscope_push_var(scope, params);
for (p = p->next; p; p = p->next)
{
CVar_t var = semantics_p_decl(p, scope);
if (scope) /* params inside a function definition */
if (!cscope_push_var(scope, var))
{
sprintf(err_buff, "redefinition of parameter '%s'", var->name);
ERROR(var->ast->loc.row, var->ast->loc.col);
}
var->next = params;
params = var;
}
return params;
}
CVar_t semantics_p_declr(CNode *p, CType_t type_spec) {
/* deal with pointer prefix */
CNode *t, *ast;
CType_t tt, ptype;
const char *name;
if (p->type == ID)
{
ptype = type_spec; /* filled by type spec */
name = p->rec.strval;
ast = p;
}
else
{
ptype = ctype_create("", CPTR, p); /* pointer */
for (t = p, tt = ptype;; t = t->chd)
{
if (t->chd->type == ID)
{
tt->rec.ref = type_spec; /* filled by type spec */
name = t->chd->rec.strval;
ast = t;
break;
}
tt->rec.ref = ctype_create("", CPTR, t);
tt = tt->rec.ref;
}
}
return cvar_create(name, ptype, ast);
}
CVar_t semantics_declr(CNode *p, CType_t type_spec, CScope_t scope) {
CType_t type;
const char *name;
CNode *ast;
if (p->type == ID || p->rec.subtype == '*')
return semantics_p_declr(p, type_spec);
switch (p->rec.subtype)
{
case DECLR_FUNC:
{
CVar_t p_declr = semantics_p_declr(p->chd, type_spec);
type = ctype_create("", CFUNC, p); /* function declr */
cscope_enter(scope);
type->rec.func.params = semantics_params(p->chd->next, scope);
cscope_exit(scope);
/* incomplete type */
type->rec.func.local = NULL;
type->rec.func.ret = p_declr->type;
name = p_declr->name;
ast = p_declr->ast;
free(p_declr);
}
break;
case DECLR_ARR:
{
CNode *t;
CType_t tt;
type = ctype_create("", CARR, p); /* array declr */
for (t = p, tt = type;; t = t->chd)
{
/* TODO: range checking */
tt->rec.arr.len = t->chd->next->rec.intval; /* array length */
if (t->chd->type == ID || t->chd->rec.subtype == '*')
{
CVar_t p_declr = semantics_p_declr(t->chd, type_spec);
tt->rec.arr.elem = p_declr->type;
name = p_declr->name;
ast = p_declr->ast;
free(p_declr);
break;
}
tt->rec.arr.elem = ctype_create("", CARR, t);
tt = tt->rec.arr.elem;
}
}
break;
default: assert(0);
}
return cvar_create(name, type, ast);
}
CTable_t semantics_fields(CNode *p, CScope_t scope) {
#ifdef CIBIC_DEBUG
CTable_t ct = ctable_create(bkdr_hash, ctable_cvar_print);
#else
CTable_t ct = ctable_create(bkdr_hash);
#endif
for (p = p->chd; p; p = p->next)
{
CNode *declr = p->chd->next->chd;
for (; declr; declr = declr->next)
{
CVar_t var = semantics_declr(declr,
semantics_type_spec(p->chd, scope),
scope);
/* TODO: conflicts report */
if (!ctable_insert(ct, var->name, var, 0))
{
sprintf(err_buff, "duplicate member '%s'", var->name);
ERROR(var->ast->loc.row, var->ast->loc.col);
}
}
}
return ct;
}
CVar_t semantics_decl(CNode *p, CScope_t scope) {
CHECK_TYPE(p, DECL);
CNode *init = p->chd->next;
CType_t type = semantics_type_spec(p->chd, scope);
CVar_t res = NULL;
switch (type->type)
{
case CSTRUCT:
case CUNION:
cscope_push_type(scope, type); break;
case CINT:
case CCHAR:
case CVOID: break;
default: assert(0);
}
if (init->chd->type != NOP)
{
CNode *p;
for (p = init->chd; p; p = p->next)
{
/* TODO: initializer checking */
CVar_t var = semantics_declr(p->chd, type, scope);
var = var_merge(var, scope);
var->next = res;
res = var;
}
}
else
{
/* TODO: useless typename warning */
sprintf(err_buff, "useless declaration");
WARNING(type->ast->loc.row, type->ast->loc.col);
}
return res;
}
CVar_t semantics_comp(CNode *, CScope_t);
CVar_t semantics_stmt(CNode *p, CScope_t scope) {
CHECK_TYPE(p, STMT);
switch (p->rec.subtype)
{
case STMT_EXP:
/* TODO: expression handle */
break;
case STMT_COMP:
{
CVar_t res;
cscope_enter(scope);
res = semantics_comp(p, scope);
cscope_exit(scope);
return res;
}
case STMT_IF:
/* TODO: `if' statement */
;
break;
case STMT_FOR:
/* TODO: `for' statement */
;
break;
case STMT_WHILE:
/* TODO: `while' statement */
;
break;
case STMT_CONT:
/* TODO: `continue' statement */
;
break;
case STMT_BREAK:
/* TODO: `break' statement */
;
break;
case STMT_RET:
/* TODO: `return' statement */
;
break;
default: assert(0);
}
return NULL;
}
CVar_t semantics_comp(CNode *p, CScope_t scope) {
CNode *decls = p->chd,
*stmts = p->chd->next, *i;
CVar_t res = NULL;
if (decls->chd->type != NOP)
for (i = decls->chd; i; i = i->next)
{
CVar_t vlist = semantics_decl(i, scope);
if (vlist) /* collect local vars */
{
CVar_t p;
for (p = vlist; p->next; p = p->next);
p->next = res;
res = vlist;
}
}
if (stmts->chd->type != NOP)
for (i = stmts->chd; i; i = i->next)
{
CVar_t vlist = semantics_stmt(i, scope);
if (vlist) /* collect nested local vars */
{
CVar_t p;
for (p = vlist; p->next; p = p->next);
p->next = res;
res = vlist;
}
}
return res;
}
CVar_t semantics_func(CNode *p, CScope_t scope) {
CHECK_TYPE(p, FUNC_DEF);
CNode *chd = p->chd->next;
CType_t func = ctype_create(chd->rec.strval, CFUNC, p);
CVar_t res;
chd = chd->next;
func->rec.func.ret = semantics_type_spec(p->chd, scope); /* check return type */
cscope_enter(scope); /* enter into function local scope */
func->rec.func.params = semantics_params(chd, scope); /* check params */
func->rec.func.local = semantics_comp(chd->next, scope); /* check comp */
cscope_exit(scope); /* exit from local scope */
res = cvar_create(func->name, func, p);
if (!cscope_push_var(scope, res))
puts("fuck func name");
return res;
}
void semantics_check_(CNode *p, CScope_t scope) {
p = p->chd;
switch (p->type)
{
case FUNC_DEF: semantics_func(p, scope); break;
default: ;
}
}
void semantics_check(CNode *ast) {
CScope_t scope = cscope_create();
/* add top-level basic types */
cscope_push_type(scope, ctype_create("int", CINT, NULL));
cscope_push_type(scope, ctype_create("char", CCHAR, NULL));
cscope_push_type(scope, ctype_create("void", CVOID, NULL));
/* check all definitions and declarations */
for (ast = ast->chd; ast; ast = ast->next)
{
switch (ast->type)
{
case FUNC_DEF:
semantics_func(ast, scope); break;
case DECL:
semantics_decl(ast, scope); break;
default: assert(0);
}
}
cscope_debug_print(scope);
{
CTNode *p;
int i;
for (i = 0; i < MAX_TABLE_SIZE; i++)
for (p = scope->tvar->head[i]; p; p = p->next)
{
cvar_print((CVar_t)p->val);
fprintf(stderr, "\n");
}
for (i = 0; i < MAX_TABLE_SIZE; i++)
for (p = scope->ttype->head[i]; p; p = p->next)
{
ctype_print((CType_t)p->val);
fprintf(stderr, "\n");
}
}
}
|