-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathp.c
4664 lines (4488 loc) · 145 KB
/
p.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
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
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* p.c (wcpl parser) -- esl */
#include <stdbool.h>
#include <stdint.h>
#include <stddef.h>
#include <stdlib.h>
#include <stdio.h>
#include <stdarg.h>
#include <string.h>
#include <limits.h>
#include <errno.h>
#include <assert.h>
#include <ctype.h>
#include <wchar.h>
#include <time.h>
#include <math.h>
#include "l.h"
#include "w.h"
#include "p.h"
#include "c.h"
/* module names and files */
sym_t base_from_path(const char *path)
{
cbuf_t cb = mkcb(); char *fn = getfname(path);
sym_t bp = intern(cbset(&cb, path, fn-path));
cbfini(&cb);
return bp;
}
sym_t modname_from_path(const char *path)
{
cbuf_t cb = mkcb(); char *fn = getfname(path);
sym_t mod = intern(cbset(&cb, fn, spanfbase(fn)));
cbfini(&cb);
return mod;
}
pws_t *pws_from_modname(bool sys, sym_t mod)
{
pws_t *pws = NULL;
if (mod) {
size_t i; cbuf_t cb = mkcb();
if (!sys) { /* start with current directory */
pws = newpws(cbsetf(&cb, "%s", symname(mod)));
if (!pws) pws = newpws(cbsetf(&cb, "%s.h", symname(mod)));
if (!pws) pws = newpws(cbsetf(&cb, "%s.wh", symname(mod)));
}
/* search include base directories */
if (!pws) for (i = 0; i < buflen(g_ibases); ++i) {
sym_t *pb = bufref(g_ibases, i);
pws = newpws(cbsetf(&cb, "%s%s", symname(*pb), symname(mod)));
if (pws) break;
pws = newpws(cbsetf(&cb, "%s%s.h", symname(*pb), symname(mod)));
if (pws) break;
pws = newpws(cbsetf(&cb, "%s%s.wh", symname(*pb), symname(mod)));
if (pws) break;
}
if (pws) logef("# found '%s' module interface in %s (pws #%d)\n", symname(mod), cbdata(&cb), pwsid(pws));
cbfini(&cb);
}
return pws;
}
/* parser workspaces */
struct pws {
int id; /* sequential id of this pws or -1 */
dstr_t infile; /* current input file name or "-" */
sym_t curmod; /* current module name or 0 */
void *input; /* current input stream */
fgetlb_t getlb; /* function to read from it */
fclose_t close; /* and close it afterwards */
bool inateof; /* current input is exausted */
cbuf_t incb; /* input buffer for parser */
buf_t lsposs; /* line start positions */
size_t discarded; /* count of discarded chars */
cbuf_t chars; /* line buffer of chars */
int curi; /* current input position in buf */
bool gottk; /* lookahead token is available */
tt_t ctk; /* lookahead token type */
cbuf_t token; /* lookahead token char data */
char *tokstr; /* lookahead token string */
int pos; /* absolute pos of la token start */
int cclevel; /* nesting of active cc blocks */
}; /* pws_t */
int pwsid(pws_t *pw)
{
return pw->id;
}
sym_t pwscurmod(pws_t *pw)
{
return pw->curmod;
}
static buf_t g_pwsbuf;
/* alloc parser workspace for infile */
pws_t *newpws(const char *infile)
{
FILE *fp = NULL; MEM *mp = NULL;
const char *mpath; pws_t *pw = NULL;
if (streql(infile, "-")) fp = stdin;
else if ((mpath = strprf(infile, "res://")) != NULL) mp = mopen(mpath);
else fp = fopen(infile, "r");
if (fp) {
pw = emalloc(sizeof(pws_t));
pw->input = fp;
pw->getlb = (fgetlb_t)&fgetlb;
pw->close = (fclose_t)&fclose;
fget8bom(pw->input);
} else if (mp) {
pw = emalloc(sizeof(pws_t));
pw->input = mp;
pw->getlb = (fgetlb_t)&mgetlb;
pw->close = (fclose_t)&mclose;
}
/* init all remaining fields */
if (pw) {
pw->id = (int)buflen(&g_pwsbuf);
pw->infile = estrdup(infile);
pw->curmod = streql(infile, "-") ? intern("_") : modname_from_path(infile);
pw->inateof = false;
cbinit(&pw->incb);
bufinit(&pw->lsposs, sizeof(size_t));
pw->discarded = 0;
bufinit(&pw->chars, sizeof(char));
pw->curi = 0;
pw->gottk = false;
pw->ctk = TT_EOF;
cbinit(&pw->token);
pw->tokstr = NULL;
pw->pos = 0;
pw->cclevel = 0;
*(pws_t**)bufnewbk(&g_pwsbuf) = pw;
}
return pw;
}
/* close existing workspace, leaving only data used for error reporting */
void closepws(pws_t *pw)
{
if (pw) {
if (pw->input != NULL) {
if (pw->close != (fclose_t)&fclose || pw->input != stdin) (*pw->close)(pw->input);
pw->input = NULL;
}
cbclear(&pw->incb);
cbclear(&pw->token);
}
}
static void freepws(pws_t *pw)
{
if (pw) {
closepws(pw);
free(pw->infile);
cbfini(&pw->incb);
buffini(&pw->lsposs);
cbfini(&pw->chars);
cbfini(&pw->token);
free(pw);
}
}
void init_workspaces(void)
{
bufinit(&g_pwsbuf, sizeof(pws_t*));
}
void fini_workspaces(void)
{
size_t i;
for (i = 0; i < buflen(&g_pwsbuf); ++i) {
freepws(*(pws_t**)bufref(&g_pwsbuf, i));
}
buffini(&g_pwsbuf);
}
/* convert global position into 1-based line + 0-based offset */
static void pos2lnoff(pws_t *pw, int gci, int *pln1, int *poff0)
{
/* todo: use binary search */
size_t i; int curlc = 0, curci = 0;
gci += (int)pw->discarded; /* in case we are in a repl */
for (i = 0; i < buflen(&pw->lsposs); ++i) {
size_t *plsp = bufref(&pw->lsposs, i);
int ici = (int)*plsp;
if (ici > gci) break;
curlc = (int)i;
curci = ici;
}
*pln1 = curlc + 1;
*poff0 = gci - curci;
}
/* recall line #n; return NULL if it is not available */
static char *recallline(pws_t *pw, int lno, cbuf_t *pcb)
{
size_t gci, ppi; cbuf_t *pp = &pw->chars;
char *pchars = cbdata(pp);
assert(lno > 0);
/* check if this line is already comitted in full */
if (lno >= (int)(1+buflen(&pw->lsposs))) return NULL;
/* ok, let's get its global initial offset as gci */
gci = *(size_t *)bufref(&pw->lsposs, (size_t)(lno-1));
/* see if this part is still available */
if (gci < pw->discarded) return NULL;
gci -= pw->discarded; /* now gci is relative to pp */
assert(gci <= buflen(pp));
/* collect the characters */
cbclear(pcb);
for (ppi = gci; ppi <= cblen(pp); ++ppi) {
int c = pchars[ppi];
if (c == '\n') break;
cbputc(c, pcb);
}
return cbdata(pcb);
}
/* try to get new line of input so parsing can continue */
static int fetchline(pws_t *pw, char **ptbase, int *pendi)
{
cbuf_t *pp = &pw->chars; int c = EOF;
if (!pw->inateof) {
char *line = (*pw->getlb)(&pw->incb, pw->input);
if (!line) {
pw->inateof = true;
} else {
size_t pos = buflen(pp) + pw->discarded;
unsigned long ch = 0; char *ln = line;
while (*ln) {
ch = unutf8((unsigned char **)&ln);
if (ch == 0 || ch == (unsigned long)-1) {
int lno = (int)buflen(&pw->lsposs)+1;
eprintf("%s:%d: utf-8 encoding error", pw->infile, lno);
}
}
cbputs(line, pp);
if (ch == '\\') pp->fill -= 1; /* c preprocessor-like behavior */
else cbputc('\n', pp); /* normal line not ending in backslash */
if (c == EOF) c = '\n';
*(size_t*)bufnewbk(&pw->lsposs) = pos;
*ptbase = cbdata(pp);
*pendi = (int)cblen(pp);
}
}
return c;
}
#if 0
/* readjust input after previous read; return true unless at EOF */
static bool clearinput(pws_t *pw)
{
/* readjust and repeat unless at eof */
if (!pw->inateof) {
/* continuing after successful parse, its associated info is no longer needed */
/* throw away chars before curi -- but not after the beginning of the line where curi
* is located as we don't want to lose the ability to show current line as error line;
* also we still need to keep track of discarded chars for position calculations */
cbuf_t *pp = &pw->chars;
size_t nl = buflen(&pw->lsposs);
size_t lspos = nl ? *(size_t*)bufref(&pw->lsposs, nl-1): 0; /* abs pos of last line's start */
if (lspos < pw->discarded) {
/* pp contains partial line; no reason to keep it */
pw->discarded += pw->curi;
bufnrem(pp, 0, pw->curi);
pw->curi = 0;
} else {
/* pp contains full last line; throw away chars before its start only */
size_t rc = lspos - pw->discarded;
pw->discarded += rc;
bufnrem(pp, 0, rc); assert(pw->curi >= (int)rc);
pw->curi -= (int)rc;
}
return true;
}
return false;
}
#endif
/* report error, possibly printing location information */
static void vrprintf(pws_t *pw, int startpos, const char *fmt, va_list args)
{
cbuf_t cb = mkcb(); const char *s;
int ln = 0, off = 0; assert(fmt);
if (pw != NULL && pw->infile != NULL) cbputf(&cb, "%s:", pw->infile);
if (pw && startpos >= 0) {
pos2lnoff(pw, startpos, &ln, &off);
if (ln > 0) cbputf(&cb, "%d:%d:", ln, off+1);
}
fflush(stdout);
if (cblen(&cb) > 0) {
cbputc(' ', &cb);
fputs(cbdata(&cb), stderr);
}
vfprintf(stderr, fmt, args);
fputc('\n', stderr);
if (startpos >= 0 && ln > 0 && (s = recallline(pw, ln, &cb)) != NULL) {
fputs(s, stderr); fputc('\n', stderr);
while (off-- > 0) fputc(' ', stderr);
fputs("^\n", stderr);
}
fflush(stderr);
cbfini(&cb);
}
/* report error, possibly printing location information, and exit */
void reprintf(pws_t *pw, int startpos, const char *fmt, ...)
{
va_list args;
va_start(args, fmt);
vrprintf(pw, startpos, fmt, args);
va_end(args);
exit(1);
}
/* symbol table */
/* triples of <sym_t, tt_t, info> sorted by sym */
buf_t g_syminfo;
/* nodes referred to by some syminfos */
ndbuf_t g_nodes;
/* NB: intern_symbol does not check for duplicates! */
static void intern_symbol(const char *name, tt_t tt, int info)
{
int *pt = bufnewbk(&g_syminfo);
pt[0] = intern(name), pt[1] = tt, pt[2] = info;
bufqsort(&g_syminfo, &int_cmp);
}
/* NB: unintern_symbol does not touch g_nodes! */
static void unintern_symbol(const char *name)
{
sym_t s = intern(name);
int *pi = bufbsearch(&g_syminfo, &s, &int_cmp);
if (pi) bufrem(&g_syminfo, bufoff(&g_syminfo, pi));
}
size_t sizeof_vararg_union = 16;
void make_vararg_union_type(node_t *ptn)
{
node_t *pfn;
assert(ptn->nt == NT_NULL);
ptn->nt = NT_TYPE; ptn->ts = TS_UNION; ptn->name = intern("va_arg");
ndset(pfn = ndnewbk(ptn), NT_VARDECL, -1, -1)->name = intern("va_int");
ndsettype(ndnewbk(pfn), TS_INT);
ndset(pfn = ndnewbk(ptn), NT_VARDECL, -1, -1)->name = intern("va_uint");
ndsettype(ndnewbk(pfn), TS_UINT);
ndset(pfn = ndnewbk(ptn), NT_VARDECL, -1, -1)->name = intern("va_long");
ndsettype(ndnewbk(pfn), TS_LONG);
ndset(pfn = ndnewbk(ptn), NT_VARDECL, -1, -1)->name = intern("va_ulong");
ndsettype(ndnewbk(pfn), TS_ULONG);
ndset(pfn = ndnewbk(ptn), NT_VARDECL, -1, -1)->name = intern("va_llong");
ndsettype(ndnewbk(pfn), TS_LLONG);
ndset(pfn = ndnewbk(ptn), NT_VARDECL, -1, -1)->name = intern("va_ullong");
ndsettype(ndnewbk(pfn), TS_ULLONG);
ndset(pfn = ndnewbk(ptn), NT_VARDECL, -1, -1)->name = intern("va_double");
ndsettype(ndnewbk(pfn), TS_DOUBLE);
ndset(pfn = ndnewbk(ptn), NT_VARDECL, -1, -1)->name = intern("va_size");
ndsettype(ndnewbk(pfn), TS_ULONG);
ndset(pfn = ndnewbk(ptn), NT_VARDECL, -1, -1)->name = intern("va_v128");
ndsettype(ndnewbk(pfn), TS_V128);
ndset(pfn = ndnewbk(ptn), NT_VARDECL, -1, -1)->name = intern("va_voidptr");
ndsettype(ndnewbk(ndsettype(ndnewbk(pfn), TS_PTR)), TS_VOID);
}
void init_symbols(void)
{
node_t *pn, *psn; time_t now;
bufinit(&g_syminfo, sizeof(int)*3);
ndbinit(&g_nodes); time(&now);
intern_symbol("asm", TT_ASM_KW, -1); /* WCPL */
intern_symbol("auto", TT_AUTO_KW, -1);
intern_symbol("break", TT_BREAK_KW, -1);
intern_symbol("case", TT_CASE_KW, -1);
intern_symbol("char", TT_CHAR_KW, -1);
intern_symbol("const", TT_CONST_KW, -1);
intern_symbol("constexpr", TT_CONSTEXPR_KW, -1);
intern_symbol("continue", TT_CONTINUE_KW, -1);
intern_symbol("default", TT_DEFAULT_KW, -1);
intern_symbol("do" , TT_DO_KW, -1);
intern_symbol("double", TT_DOUBLE_KW, -1);
intern_symbol("else" , TT_ELSE_KW, -1);
intern_symbol("enum" , TT_ENUM_KW, -1);
intern_symbol("extern", TT_EXTERN_KW, -1);
intern_symbol("float", TT_FLOAT_KW, -1);
intern_symbol("for", TT_FOR_KW, -1);
intern_symbol("goto", TT_GOTO_KW, -1);
intern_symbol("if", TT_IF_KW, -1);
intern_symbol("inline", TT_INLINE_KW, -1);
intern_symbol("int", TT_INT_KW, -1);
intern_symbol("long", TT_LONG_KW, -1);
intern_symbol("register", TT_REGISTER_KW, -1);
intern_symbol("restrict", TT_RESTRICT_KW, -1);
intern_symbol("return", TT_RETURN_KW, -1);
intern_symbol("short", TT_SHORT_KW, -1);
intern_symbol("signed", TT_SIGNED_KW, -1);
intern_symbol("simd", TT_SIMD_KW, -1); /* WCPL */
intern_symbol("static", TT_STATIC_KW, -1);
intern_symbol("struct", TT_STRUCT_KW, -1);
intern_symbol("switch", TT_SWITCH_KW, -1);
intern_symbol("typedef", TT_TYPEDEF_KW, -1);
intern_symbol("union", TT_UNION_KW, -1);
intern_symbol("unsigned", TT_UNSIGNED_KW, -1);
intern_symbol("void", TT_VOID_KW, -1);
intern_symbol("volatile", TT_VOLATILE_KW, -1);
intern_symbol("while", TT_WHILE_KW, -1);
intern_symbol("bool", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_BOOL);
intern_symbol("true", TT_MACRO_NAME, (int)ndblen(&g_nodes));
pn = ndbnewbk(&g_nodes); ndset(pn, NT_LITERAL, -1, -1);
pn->ts = TS_BOOL; pn->val.i = 1; /* NB: int in C99 */
wrap_node(pn, NT_MACRODEF); pn->name = intern("true");
intern_symbol("false", TT_MACRO_NAME, (int)ndblen(&g_nodes));
pn = ndbnewbk(&g_nodes); ndset(pn, NT_LITERAL, -1, -1);
pn->ts = TS_BOOL; pn->val.i = 0; /* NB: int in C99 */
wrap_node(pn, NT_MACRODEF); pn->name = intern("false");
intern_symbol("wchar_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_INT);
intern_symbol("wint_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_INT);
intern_symbol("int8_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_CHAR);
intern_symbol("uint8_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_UCHAR);
intern_symbol("int16_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_SHORT);
intern_symbol("uint16_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_USHORT);
intern_symbol("int32_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_INT);
intern_symbol("uint32_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_UINT);
intern_symbol("int64_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_LLONG);
intern_symbol("uint64_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_ULLONG);
intern_symbol("size_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_ULONG);
intern_symbol("ssize_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_LONG);
intern_symbol("uintptr_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_ULONG);
intern_symbol("ptrdiff_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_LONG);
intern_symbol("intptr_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_LONG);
intern_symbol("float32_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_FLOAT);
intern_symbol("float64_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_DOUBLE);
intern_symbol("v128_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
ndsettype(ndbnewbk(&g_nodes), TS_V128);
intern_symbol("va_arg_t", TT_TYPE_NAME, (int)ndblen(&g_nodes));
pn = ndbnewbk(&g_nodes); make_vararg_union_type(pn);
intern_symbol("INTPTR_MIN", TT_MACRO_NAME, (int)ndblen(&g_nodes));
pn = ndsetilit(ndbnewbk(&g_nodes), TS_LONG, INT_MIN); /* wasm32 */
wrap_node(pn, NT_MACRODEF); pn->name = intern("INTPTR_MIN");
intern_symbol("INTPTR_MAX", TT_MACRO_NAME, (int)ndblen(&g_nodes));
pn = ndsetilit(ndbnewbk(&g_nodes), TS_LONG, INT_MAX); /* wasm32 */
wrap_node(pn, NT_MACRODEF); pn->name = intern("INTPTR_MAX");
intern_symbol("UINTPTR_MAX", TT_MACRO_NAME, (int)ndblen(&g_nodes));
pn = ndsetulit(ndbnewbk(&g_nodes), TS_ULONG, UINT_MAX); /* wasm32 */
wrap_node(pn, NT_MACRODEF); pn->name = intern("UINTPTR_MAX");
intern_symbol("NULL", TT_MACRO_NAME, (int)ndblen(&g_nodes));
pn = ndbnewbk(&g_nodes); ndset(pn, NT_CAST, -1, -1);
psn = ndnewbk(pn); ndsettype(psn, TS_PTR);
psn = ndnewbk(psn); ndsettype(psn, TS_VOID);
psn = ndnewbk(pn); ndset(psn, NT_LITERAL, -1, -1);
psn->ts = TS_ULONG; psn->val.i = 0;
wrap_node(pn, NT_MACRODEF); pn->name = intern("NULL");
intern_symbol("HUGE_VAL", TT_MACRO_NAME, (int)ndblen(&g_nodes));
pn = ndbnewbk(&g_nodes); ndset(pn, NT_LITERAL, -1, -1);
pn->ts = TS_DOUBLE; pn->val.d = HUGE_VAL;
wrap_node(pn, NT_MACRODEF); pn->name = intern("HUGE_VAL");
intern_symbol("sizeof", TT_INTR_NAME, INTR_SIZEOF);
intern_symbol("alignof", TT_INTR_NAME, INTR_ALIGNOF);
intern_symbol("offsetof", TT_INTR_NAME, INTR_OFFSETOF);
intern_symbol("countof", TT_INTR_NAME, INTR_COUNTOF);
intern_symbol("alloca", TT_INTR_NAME, INTR_ALLOCA);
intern_symbol("_Generic", TT_INTR_NAME, INTR_GENERIC); /* C11 */
intern_symbol("generic", TT_INTR_NAME, INTR_GENERIC); /* WCPL */
intern_symbol("va_etc", TT_INTR_NAME, INTR_VAETC);
intern_symbol("va_arg", TT_INTR_NAME, INTR_VAARG);
intern_symbol("static_assert", TT_INTR_NAME, INTR_SASSERT);
intern_symbol("defined", TT_INTR_NAME, INTR_DEFINED);
intern_symbol("__VA_ARGS__", TT_MACRO_NAME, (int)ndblen(&g_nodes)); /* C99 */
pn = ndbnewbk(&g_nodes); ndset(pn, NT_INTRCALL, -1, -1); pn->intr = INTR_VAETC;
wrap_node(pn, NT_MACRODEF); pn->name = intern("__VA_ARGS__");
intern_symbol("__DATE__", TT_MACRO_NAME, (int)ndblen(&g_nodes));
pn = ndbnewbk(&g_nodes); ndset(pn, NT_LITERAL, -1, -1);
pn->ts = TS_STRING; cbputtime("%b %d %Y", gmtime(&now), &pn->data);
cbputc(0, &pn->data); wrap_node(pn, NT_MACRODEF); pn->name = intern("__DATE__");
intern_symbol("__TIME__", TT_MACRO_NAME, (int)ndblen(&g_nodes));
pn = ndbnewbk(&g_nodes); ndset(pn, NT_LITERAL, -1, -1);
pn->ts = TS_STRING; cbputtime("%X", gmtime(&now), &pn->data);
cbputc(0, &pn->data); wrap_node(pn, NT_MACRODEF); pn->name = intern("__TIME__");
intern_symbol("__WCPL__", TT_MACRO_NAME, (int)ndblen(&g_nodes));
pn = ndsetilit(ndbnewbk(&g_nodes), TS_INT, 1); /* major version */
wrap_node(pn, NT_MACRODEF); pn->name = intern("__WCPL__");
}
/* simple comparison of numerical NT_LITERAL nodes for equivalence */
bool same_numlit(const node_t *pcn1, const node_t *pcn2)
{
node_t *pn1 = (node_t*)pcn1, *pn2 = (node_t*)pcn2;
if (pn1->nt == NT_NULL || pn2->nt == NT_NULL) return true;
if (pn1->nt != NT_LITERAL || pn2->nt != NT_LITERAL) return false;
if (pn1->ts != pn2->ts) return false;
switch (pn1->ts) {
case TS_INT: case TS_LONG: case TS_LLONG:
return pn1->val.i == pn2->val.i;
case TS_UINT: case TS_ULONG: case TS_ULLONG:
return pn1->val.u == pn2->val.u;
default:;
}
return false;
}
/* simple comparison of NT_TYPE nodes for equivalence */
bool same_type(const node_t *pctn1, const node_t *pctn2)
{
node_t *ptn1 = (node_t*)pctn1, *ptn2 = (node_t*)pctn2;
assert(ptn1->nt == NT_TYPE && ptn2->nt == NT_TYPE);
if (ptn1->ts == TS_ENUM && ptn2->ts == TS_INT) return true;
if (ptn1->ts == TS_INT && ptn2->ts == TS_ENUM) return true;
if (ptn1->ts == TS_V128 && ptn2->ts == TS_V128) {
assert(ndlen(ptn1) <= 2 && ndlen(ptn2) <= 2);
/* make sure specialized vectors are specialized in the same way */
if (!ndlen(ptn1) || !ndlen(ptn2) || same_type(ndcref(ptn1, 0), ndcref(ptn2, 0))) return true;
if (ndlen(ptn1) < 2 || ndlen(ptn2) < 2) return true;
return same_numlit(ndcref(ptn1, 1), ndcref(ptn2, 1));
}
if (ptn1->ts == TS_ARRAY && ptn2->ts == TS_PTR) {
assert(ndlen(ptn1) == 2 && ndlen(ptn2) == 1);
return ndref(ptn1, 1)->nt == NT_NULL && same_type(ndref(ptn1, 0), ndref(ptn2, 0));
} else if (ptn1->ts == TS_PTR && ptn2->ts == TS_ARRAY) {
assert(ndlen(ptn1) == 1 && ndlen(ptn2) == 2);
return ndref(ptn2, 1)->nt == NT_NULL && same_type(ndref(ptn1, 0), ndref(ptn2, 0));
}
if (ptn1->ts != ptn2->ts) return false;
if (ptn1->ts == TS_ENUM && (ptn1->name && ptn2->name && ptn1->name != ptn2->name)) return false;
if (ptn1->ts == TS_STRUCT || ptn1->ts == TS_UNION ||
ptn1->ts == TS_FUNCTION || ptn1->ts == TS_PTR) {
size_t i;
if ((ptn1->ts == TS_STRUCT || ptn1->ts == TS_UNION) &&
(ptn1->name != ptn2->name)) return false;
/* allow incomplete struct/union to be equivalent to a complete one */
if ((ptn1->ts == TS_STRUCT || ptn1->ts == TS_UNION) &&
(!ndlen(ptn1) || !ndlen(ptn2))) return true;
/* the rest are types/bindings that should match recursively */
if (ndlen(ptn1) != ndlen(ptn2)) return false;
for (i = 0; i < ndlen(ptn1); ++i) {
node_t *pn1 = ndref(ptn1, i), *pn2 = ndref(ptn2, i);
if ((ptn1->ts == TS_STRUCT || ptn1->ts == TS_UNION) &&
(pn1->nt != NT_VARDECL || pn2->nt != NT_VARDECL ||
pn1->name != pn2->name)) return false;
if (pn1->nt == NT_VARDECL && ndlen(pn1) == 1) pn1 = ndref(pn1, 0);
if (pn2->nt == NT_VARDECL && ndlen(pn2) == 1) pn2 = ndref(pn2, 0);
if (pn1->nt != NT_TYPE || pn2->nt != NT_TYPE ||
!same_type(pn1, pn2)) return false;
}
} else if (ptn1->ts == TS_ARRAY) {
/* allow incomplete array to be equivalent to a complete one */
assert(ndlen(ptn1) == 2 && ndlen(ptn2) == 2);
return same_type(ndref(ptn1, 0), ndref(ptn2, 0))
&& same_numlit(ndref(ptn1, 1), ndref(ptn2, 1));
}
return true;
}
/* post imported/forward symbol to symbol table; forward unless final */
const node_t *post_symbol(sym_t mod, node_t *pvn, bool final, bool hide)
{
/* kluge: symbol's status is encoded in pin->ts as follows:
* not final: not hide: NONE/EXTERN(if referenced) | hide: STATIC
* final: not hide: REGISTER | hide: AUTO
* (not final means 'just a declaration', final means 'definition')
* (not hide means external linkage, hide means internal linkage) */
node_t *pin = NULL; int *pi, info;
assert(pvn->nt == NT_VARDECL && pvn->name && ndlen(pvn) == 1);
assert(ndref(pvn, 0)->nt == NT_TYPE);
if ((pi = bufbsearch(&g_syminfo, &pvn->name, &int_cmp)) != NULL) {
/* see if what's there is an older one with the same name */
if (pi[1] == TT_IDENTIFIER && pi[2] >= 0) {
assert(pi[2] < (int)buflen(&g_nodes));
pin = bufref(&g_nodes, (size_t)pi[2]);
if (pin->nt == NT_IMPORT && ndlen(pin) == 1) {
bool curfinal = (pin->sc == SC_REGISTER || pin->sc == SC_AUTO);
if (final && curfinal) { /* redefinition attempt */
n2eprintf(pvn, pin, "symbol already defined: %s", symname(pvn->name));
} else { /* redeclaration attempt: allow if no change */
bool curhide = (pin->sc == SC_STATIC || pin->sc == SC_AUTO);
node_t *ptn = ndref(pin, 0); assert(ptn->nt == NT_TYPE);
if (curhide == hide && same_type(ptn, ndref(pvn, 0))) {
if (final) {
pin->pwsid = pvn->pwsid; pin->startpos = pvn->startpos;
pin->sc = (hide ? SC_AUTO : SC_REGISTER);
}
return pin;
}
}
}
}
n2eprintf(pvn, pin, "symbol already defined differently: %s", symname(pvn->name));
}
info = (int)ndblen(&g_nodes); pin = ndbnewbk(&g_nodes);
ndset(pin, NT_IMPORT, pvn->pwsid, pvn->startpos);
/* changed to SC_EXTERN on reference; SC_AUTO is for private, SC_REGISTER for public */
pin->name = mod; assert(mod);
pin->sc = final ? (hide ? SC_AUTO : SC_REGISTER) : (hide ? SC_STATIC : SC_NONE);
ndpushbk(pin, ndref(pvn, 0));
intern_symbol(symname(pvn->name), TT_IDENTIFIER, info);
return pin;
}
void fini_symbols(void)
{
buffini(&g_syminfo);
ndbfini(&g_nodes);
}
static tt_t lookup_symbol(const char *name, int *pinfo)
{
sym_t s = intern(name);
int *pi = bufbsearch(&g_syminfo, &s, &int_cmp);
if (pinfo) *pinfo = pi ? pi[2] : -1;
return pi != NULL ? (tt_t)pi[1] : TT_IDENTIFIER;
}
static bool check_once(const char *fname)
{
sym_t o = internf("once %s", fname);
int *pi = bufbsearch(&g_syminfo, &o, &int_cmp);
if (pi != NULL) return false;
intern_symbol(symname(o), TT_EOF, -1);
return true;
}
const node_t *lookup_global(sym_t name)
{
const node_t *pn = NULL;
int *pi = bufbsearch(&g_syminfo, &name, &int_cmp);
if (pi && pi[1] == TT_IDENTIFIER && pi[2] >= 0) {
assert(pi[2] < (int)buflen(&g_nodes));
pn = bufref(&g_nodes, (size_t)pi[2]);
}
return pn;
}
const node_t *lookup_macro(sym_t name)
{
const node_t *pn = NULL;
int *pi = bufbsearch(&g_syminfo, &name, &int_cmp);
if (pi && pi[1] == TT_MACRO_NAME && pi[2] >= 0) {
assert(pi[2] < (int)buflen(&g_nodes));
pn = bufref(&g_nodes, (size_t)pi[2]);
}
return pn;
}
void mark_global_referenced(const node_t *pgn)
{
assert(pgn && pgn->nt == NT_IMPORT);
if (pgn->sc == SC_NONE) ((node_t*)pgn)->sc = SC_EXTERN;
}
const node_t *lookup_eus_type(ts_t ts, sym_t name)
{
const char *tag = NULL; tt_t tt = TT_EOF;
sym_t s; int *pi; const node_t *pn = NULL;
switch (ts) {
case TS_ENUM: tag = "enum"; tt = TT_ENUM_KW; break;
case TS_UNION: tag = "union"; tt = TT_UNION_KW; break;
case TS_STRUCT: tag = "struct"; tt = TT_STRUCT_KW; break;
default: assert(false);
}
if (!name || !tag || tt == TT_EOF) return NULL;
s = internf("%s %s", tag, symname(name));
pi = bufbsearch(&g_syminfo, &s, &int_cmp);
if (pi) {
assert(pi[1] == tt);
assert(pi[2] < (int)buflen(&g_nodes));
pn = bufref(&g_nodes, (size_t)pi[2]);
assert(pn->nt == NT_TYPE && pn->ts == ts);
}
return pn;
}
/* tokenizer */
/* split input into tokens */
#define readchar() (c = *pcuri < endi ? tbase[(*pcuri)++] : fetchline(pw, &tbase, &endi))
#define unreadchar() ((*pcuri)--)
#define state_10d 78
#define state_10dd 79
#define state_10ddd 80
#define state_10dddd 81
#define state_10ddddd 82
#define state_4L 83
#define state_73LL 84
static tt_t lex(pws_t *pw, cbuf_t *pcb)
{
char *tbase = cbdata(&pw->chars);
int *pcuri = &pw->curi;
int endi = (int)cblen(&pw->chars);
int c, state = 0; bool longprefix = false;
cbclear(pcb);
while (true) {
switch (state) {
case 0:
readchar();
if (c == EOF) {
return TT_EOF;
} else if (c == '^') {
cbputc(c, pcb);
state = 29; continue;
} else if (c == '%') {
cbputc(c, pcb);
state = 28; continue;
} else if (c == '|') {
cbputc(c, pcb);
state = 27; continue;
} else if (c == '&') {
cbputc(c, pcb);
state = 26; continue;
} else if (c == '!') {
cbputc(c, pcb);
state = 25; continue;
} else if (c == '=') {
cbputc(c, pcb);
state = 24; continue;
} else if (c == '<') {
cbputc(c, pcb);
state = 23; continue;
} else if (c == '>') {
cbputc(c, pcb);
state = 22; continue;
} else if (c == '#') {
cbputc(c, pcb);
state = 21; continue;
} else if (c == ';') {
cbputc(c, pcb);
return TT_SEMICOLON;
} else if (c == ',') {
cbputc(c, pcb);
return TT_COMMA;
} else if (c == '}') {
cbputc(c, pcb);
return TT_RBRC;
} else if (c == '{') {
cbputc(c, pcb);
return TT_LBRC;
} else if (c == ']') {
cbputc(c, pcb);
return TT_RBRK;
} else if (c == '[') {
cbputc(c, pcb);
return TT_LBRK;
} else if (c == ')') {
cbputc(c, pcb);
return TT_RPAR;
} else if (c == '(') {
cbputc(c, pcb);
return TT_LPAR;
} else if (c == '?') {
cbputc(c, pcb);
return TT_QMARK;
} else if (c == ':') {
cbputc(c, pcb);
return TT_COLON;
} else if (c == '~') {
cbputc(c, pcb);
return TT_TILDE;
} else if (c == '\"') {
state = 11; continue;
} else if (c == '\'') {
state = 10; continue;
} else if (c == '-') {
cbputc(c, pcb);
state = 9; continue;
} else if (c == '+') {
cbputc(c, pcb);
state = 8; continue;
} else if (c == '.') {
cbputc(c, pcb);
state = 7; continue;
} else if (c == '0') {
cbputc(c, pcb);
state = 6; continue;
} else if ((c >= '1' && c <= '9')) {
cbputc(c, pcb);
state = 5; continue;
} else if (c == 'L') {
state = state_4L; continue;
} else if ((c >= 'A' && c <= 'Z') || c == '_' || (c >= 'a' && c <= 'z')) {
cbputc(c, pcb);
state = 4; continue;
} else if (c == '*') {
cbputc(c, pcb);
state = 3; continue;
} else if (c == '/') {
cbputc(c, pcb);
state = 2; continue;
} else if (c == '\t' || c == '\f' || c == ' ') {
cbputc(c, pcb);
state = 1; continue;
} else if (c == '\r') {
readchar();
if (c == '\n') {
cbputc(c, pcb);
return TT_WHITESPACE; /* single-char token */
} else {
unreadchar();
return TT_EOF;
}
} else if (c == '\n') {
cbputc(c, pcb);
return TT_WHITESPACE; /* single-char token */
} else {
unreadchar();
return TT_EOF;
}
case 1:
readchar();
if (c == EOF) {
return TT_WHITESPACE;
} else if (c == '\t' || c == '\f' || c == ' ') {
cbputc(c, pcb);
state = 1; continue;
} else {
unreadchar();
return TT_WHITESPACE;
}
case 2:
readchar();
if (c == EOF) {
return TT_SLASH;
} else if (c == '*') {
cbputc(c, pcb);
state = 76; continue;
} else if (c == '/') {
cbputc(c, pcb);
state = 75; continue;
} else if (c == '=') {
cbputc(c, pcb);
return TT_SLASH_ASN;
} else {
unreadchar();
return TT_SLASH;
}
case 3:
readchar();
if (c == EOF) {
return TT_STAR;
} else if (c == '=') {
cbputc(c, pcb);
return TT_STAR_ASN;
} else {
unreadchar();
return TT_STAR;
}
case state_4L:
readchar();
if (c == EOF) {
cbputc('L', pcb);
return lookup_symbol(cbdata(pcb), NULL);
} else if (c == '\"') {
longprefix = true;
state = 11; continue;
} else if (c == '\'') {
longprefix = true;
state = 10; continue;
} else if ((c >= '0' && c <= '9') || (c >= 'A' && c <= 'Z') || c == '_' || (c >= 'a' && c <= 'z')) {
cbputc('L', pcb);
cbputc(c, pcb);
state = 4; continue;
} else {
unreadchar();
cbputc('L', pcb);
return lookup_symbol(cbdata(pcb), NULL);
}
case 4:
readchar();
if (c == EOF) {
return lookup_symbol(cbdata(pcb), NULL);
} else if ((c >= '0' && c <= '9') || (c >= 'A' && c <= 'Z') || c == '_' || (c >= 'a' && c <= 'z')) {
cbputc(c, pcb);
state = 4; continue;
} else {
unreadchar();
return lookup_symbol(cbdata(pcb), NULL);
}
case 5:
readchar();
if (c == EOF) {
return TT_INT;
} else if (c == 'U' || c == 'u') {
state = 74; continue;
} else if (c == 'L' || c == 'l') {
readchar();
if (c == 'L' || c == 'l') {
state = state_73LL; continue;
}
if (c != EOF) unreadchar();
state = 73; continue;
} else if (c == '.') {
cbputc(c, pcb);
state = 66; continue;
} else if (c == 'E' || c == 'e') {
cbputc(c, pcb);
state = 62; continue;
} else if ((c >= '0' && c <= '9')) {
cbputc(c, pcb);
state = 5; continue;
} else {
unreadchar();
return TT_INT;
}
case 6:
readchar();
if (c == EOF) {
return TT_INT;
} else if (c == '.') {
cbputc(c, pcb);
state = 66; continue;
} else if ((c >= '8' && c <= '9')) {
cbputc(c, pcb);
state = 65; continue;
} else if ((c >= '0' && c <= '7')) {
cbputc(c, pcb);
state = 64; continue;
} else if (c == 'U' || c == 'u') {
state = 74; continue;
} else if (c == 'E' || c == 'e') {
cbputc(c, pcb);
state = 62; continue;
} else if (c == 'X' || c == 'x') {
cbputc(c, pcb);
state = 61; continue;
} else if (c == 'L' || c == 'l') {
readchar();
if (c == 'L' || c == 'l') {
state = state_73LL; continue;
}
if (c != EOF) unreadchar();
state = 73; continue;
} else {
unreadchar();
return TT_INT;
}
case 7:
readchar();
if (c == EOF) {
return TT_DOT;
} else if (c == '.') {
cbputc(c, pcb);
state = 55; continue;
} else if ((c >= '0' && c <= '9')) {
cbputc(c, pcb);
state = 54; continue;
} else {
unreadchar();
return TT_DOT;
}
case 8:
readchar();
if (c == EOF) {
return TT_PLUS;
} else if (c == '+') {
cbputc(c, pcb);
return TT_PLUS_PLUS;
} else if (c == '=') {
cbputc(c, pcb);
return TT_PLUS_ASN;
} else {
unreadchar();
return TT_PLUS;
}
case 9:
readchar();
if (c == EOF) {
return TT_MINUS;
} else if (c == '-') {
cbputc(c, pcb);
return TT_MINUS_MINUS;
} else if (c == '=') {
cbputc(c, pcb);
return TT_MINUS_ASN;
} else if (c == '>') {
cbputc(c, pcb);
return TT_ARROW;