-
Notifications
You must be signed in to change notification settings - Fork 0
/
c.c
4699 lines (4526 loc) · 187 KB
/
c.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
/* c.c (wcpl compiler) -- esl */
#include <stdbool.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 <wchar.h>
#include "l.h"
#include "w.h"
#include "p.h"
#include "c.h"
/* wcpl globals */
long g_optlvl; /* -O arg */
buf_t *g_ibases; /* module include search bases */
buf_t *g_lbases; /* module object module search bases */
fsbuf_t g_funcsigs; /* unique function signatures */
sym_t g_crt_mod; /* C runtime module */
sym_t g_wasi_mod; /* WASI module */
sym_t g_lm_id; /* id for linear memory */
sym_t g_sp_id; /* id for stack pointer global */
sym_t g_sb_id; /* id for stack base global */
sym_t g_hb_id; /* id for heap base global */
size_t g_sdbaddr; /* static data allocation start */
size_t g_stacksz; /* stack size in bytes */
size_t g_argvbsz; /* argv buf size in bytes */
/* initialize wcpl environment */
void init_wcpl(dsbuf_t *pincv, dsbuf_t *plibv, long optlvl, size_t sarg, size_t aarg)
{
size_t i; char *ipath;
g_optlvl = optlvl;
g_ibases = newbuf(sizeof(sym_t));
for (i = 0; i < dsblen(pincv); ++i) {
dstr_t *pds = dsbref(pincv, i);
*(sym_t*)bufnewbk(g_ibases) = intern(*pds);
}
g_lbases = newbuf(sizeof(sym_t));
/* as a last resort, loook in internal in-memory archive */
ipath = "res://lib/"; dsbpushbk(plibv, &ipath);
for (i = 0; i < dsblen(plibv); ++i) {
dstr_t *pds = dsbref(plibv, i);
int sepchar = strsuf(*pds, "\\") ? '\\' : '/';
*(sym_t*)bufnewbk(g_lbases) = intern(*pds);
*(sym_t*)bufnewbk(g_ibases) = internf("%sinclude%c", *pds, sepchar);
}
fsbinit(&g_funcsigs);
g_wasi_mod = intern("wasi_snapshot_preview1");
g_crt_mod = intern("crt");
g_lm_id = intern("memory");
g_sp_id = intern("sp$");
g_sb_id = intern("stack_base");
g_hb_id = intern("heap_base");
g_sdbaddr = 1024; /* >0, 16-aligned: address 0 reserved for NULL */
g_stacksz = sarg; /* 64K default */
g_argvbsz = aarg; /* 4K default */
}
/* finalize wcpl environment */
void fini_wcpl(void)
{
freebuf(g_ibases);
freebuf(g_lbases);
fsbfini(&g_funcsigs);
g_wasi_mod = g_crt_mod = 0;
g_lm_id = g_sp_id = 0;
}
/* compiler globals */
static sym_t g_curmod;
static wat_module_t *g_curpwm;
/* initialize single compiler run */
void init_compiler(void)
{
init_workspaces();
init_nodepool();
init_regpool();
init_symbols();
g_curmod = 0;
g_curpwm = NULL;
}
/* finalize single compiler run */
void fini_compiler(void)
{
fini_workspaces();
fini_nodepool();
fini_regpool();
fini_symbols();
g_curmod = 0;
g_curpwm = NULL;
}
/* convert WCPL to a WASM type or VT_UNKN */
static valtype_t ts2vt(ts_t ts)
{
switch (ts) {
case TS_BOOL:
case TS_CHAR: case TS_UCHAR:
case TS_SHORT: case TS_USHORT:
case TS_INT: case TS_UINT:
case TS_ENUM:
return VT_I32;
case TS_LONG: case TS_ULONG:
case TS_PTR:
/* depends on wasm32/wasm64 model */
return VT_I32;
case TS_LLONG: case TS_ULLONG:
return VT_I64;
case TS_FLOAT:
return VT_F32;
case TS_DOUBLE:
return VT_F64;
case TS_V128:
return VT_V128;
default:;
}
return VT_UNKN;
}
/* type predicates and operations */
static bool ts_numerical(ts_t ts)
{
return TS_BOOL <= ts && ts <= TS_DOUBLE;
}
static bool ts_numerical_or_enum(ts_t ts)
{
return (TS_BOOL <= ts && ts <= TS_DOUBLE) || ts == TS_ENUM;
}
static bool ts_bulk(ts_t ts)
{
return ts == TS_ARRAY || ts == TS_STRUCT || ts == TS_UNION;
}
static bool ts_unsigned(ts_t ts)
{
switch (ts) {
case TS_BOOL: case TS_UCHAR:
case TS_USHORT: case TS_UINT:
case TS_ULONG: case TS_ULLONG:
return true;
default:;
}
return false;
}
static valtype_t ts_to_blocktype(ts_t ts)
{
switch (ts) {
case TS_VOID: return BT_VOID;
case TS_LONG: case TS_ULONG: /* fall thru (assumes wasm32) */
case TS_PTR: /* fall thru (assumes wasm32) */
case TS_ENUM:
case TS_INT: case TS_UINT: return VT_I32;
case TS_LLONG: case TS_ULLONG: return VT_I64;
case TS_FLOAT: return VT_F32;
case TS_DOUBLE: return VT_F64;
case TS_V128: return VT_V128;
default:;
}
return VT_UNKN;
}
/* returns TS_INT/TS_UINT/TS_LLONG/TS_ULLONG/TS_FLOAT/TS_DOUBLE */
static ts_t ts_integral_promote(ts_t ts)
{
switch (ts) {
case TS_BOOL:
case TS_CHAR: case TS_UCHAR:
case TS_SHORT: case TS_USHORT:
case TS_INT: case TS_ENUM:
return TS_INT;
case TS_UINT:
case TS_LONG: case TS_ULONG:
case TS_LLONG: case TS_ULLONG:
case TS_FLOAT: case TS_DOUBLE:
return ts;
default: assert(false);
}
return ts; /* shouldn't happen */
}
/* common arith type for ts1 and ts2 (can be promoted one) */
static ts_t ts_arith_common(ts_t ts1, ts_t ts2)
{
assert(ts_numerical_or_enum(ts1) && ts_numerical_or_enum(ts2));
if (ts1 == TS_DOUBLE || ts2 == TS_DOUBLE) return TS_DOUBLE;
if (ts1 == TS_FLOAT || ts2 == TS_FLOAT) return TS_FLOAT;
ts1 = ts_integral_promote(ts1), ts2 = ts_integral_promote(ts2);
if (ts1 == ts2) return ts1;
if (ts1 == TS_ULLONG || ts2 == TS_ULLONG) return TS_ULLONG;
if (ts1 == TS_LLONG || ts2 == TS_LLONG) return TS_LLONG;
if (ts1 == TS_ULONG || ts2 == TS_ULONG) return TS_ULONG;
if (ts1 == TS_LONG || ts2 == TS_LONG) return TS_LONG;
if (ts1 == TS_UINT || ts2 == TS_UINT) return TS_UINT;
return TS_INT;
}
/* ts2 can be promoted up to ts1 with implicit cast */
static bool ts_arith_assign_compatible(ts_t ts1, ts_t ts2)
{
assert(ts_numerical_or_enum(ts1) && ts_numerical_or_enum(ts2));
if (ts1 == ts2) return true;
return ts_arith_common(ts1, ts2) == ts1;
}
static unsigned long long integral_mask(ts_t ts, unsigned long long u)
{
switch (ts) {
case TS_CHAR: case TS_UCHAR:
return u & 0x00000000000000FFull;
case TS_SHORT: case TS_USHORT:
return u & 0x000000000000FFFFull;
case TS_INT: case TS_UINT: case TS_ENUM:
return u & 0x00000000FFFFFFFFull;
/* fixme: should depend on wasm32/wasm64 model */
case TS_LONG: case TS_ULONG:
return u & 0x00000000FFFFFFFFull;
case TS_LLONG: case TS_ULLONG:
return u;
default: assert(false);
}
return u;
}
static long long integral_sext(ts_t ts, long long i)
{
switch (ts) {
case TS_CHAR: case TS_UCHAR:
return (long long)((((unsigned long long)i & 0x00000000000000FFull)
^ 0x0000000000000080ull) - 0x0000000000000080ull);
case TS_SHORT: case TS_USHORT:
return (long long)((((unsigned long long)i & 0x000000000000FFFFull)
^ 0x0000000000008000ull) - 0x0000000000008000ull);
case TS_INT: case TS_UINT: case TS_ENUM:
return (long long)((((unsigned long long)i & 0x00000000FFFFFFFFull)
^ 0x0000000080000000ull) - 0x0000000080000000ull);
/* fixme: should depend on wasm32/wasm64 model */
case TS_LONG: case TS_ULONG:
return (long long)((((unsigned long long)i & 0x00000000FFFFFFFFull)
^ 0x0000000080000000ull) - 0x0000000080000000ull);
case TS_LLONG: case TS_ULLONG:
return i;
default: assert(false);
}
return i;
}
static void numval_convert(ts_t tsto, ts_t tsfrom, numval_t *pnv)
{
assert(pnv);
assert(ts_numerical_or_enum(tsto) && ts_numerical_or_enum(tsfrom));
if (tsto == tsfrom) return; /* no change */
else if (tsto == TS_DOUBLE) {
if (tsfrom == TS_FLOAT) pnv->d = (double)pnv->f;
else if (ts_unsigned(tsfrom)) pnv->d = (double)pnv->u;
else pnv->d = (double)pnv->i;
} else if (tsto == TS_FLOAT) {
if (tsfrom == TS_DOUBLE) pnv->f = (float)pnv->d;
else if (ts_unsigned(tsfrom)) pnv->f = (float)pnv->u;
else pnv->f = (float)pnv->i;
} else if (tsto == TS_BOOL) {
if (tsfrom == TS_DOUBLE) pnv->u = (pnv->d != 0);
else if (tsfrom == TS_FLOAT) pnv->u = (pnv->f != 0);
else if (ts_unsigned(tsfrom)) pnv->u = (pnv->u != 0);
else pnv->u = (pnv->i != 0);
} else if (ts_unsigned(tsto)) {
if (tsfrom == TS_DOUBLE) pnv->u = (unsigned long long)pnv->d;
else if (tsfrom == TS_FLOAT) pnv->u = (unsigned long long)pnv->f;
else pnv->u = integral_mask(tsto, pnv->u); /* i reinterpreted as u */
} else { /* signed integer */
if (tsfrom == TS_DOUBLE) pnv->i = (long long)pnv->d;
else if (tsfrom == TS_FLOAT) pnv->i = (long long)pnv->f;
else pnv->i = integral_sext(tsto, pnv->i); /* u reinterpreted as i */
}
}
static bool numval_eq(ts_t ts, numval_t *pnv1, numval_t *pnv2)
{
switch (ts) {
case TS_DOUBLE:
return pnv1->d == pnv2->d;
case TS_FLOAT:
return pnv1->f == pnv2->f;
case TS_BOOL: case TS_UCHAR:
case TS_USHORT: case TS_UINT:
case TS_ULONG: case TS_ULLONG:
return pnv1->u == pnv2->u;
default:;
}
return pnv1->i == pnv2->i;
}
/* ts/pnv can be used to init ts1 while preserving value */
static bool ts_arith_init_compatible(ts_t ts1, ts_t ts, numval_t *pnv)
{
assert(ts_numerical_or_enum(ts1) && ts_numerical_or_enum(ts));
if (ts1 != ts) {
numval_t nv = *pnv;
numval_convert(ts1, ts, &nv);
numval_convert(ts, ts1, &nv);
return numval_eq(ts, &nv, pnv); /* round-trip preserves value */
}
return true;
}
/* ts/pnv can be used up to init pointer type */
static bool ts_init_ptr_compatible(ts_t ts, numval_t *pnv)
{
if (ts == TS_PTR) return true;
if (ts == TS_INT && pnv->i == 0) return true; /* wasm32 */
return false;
}
/* unary operation with a number */
static ts_t numval_unop(tt_t op, ts_t tx, const numval_t *pvx, numval_t *pvz)
{
ts_t tz = ts_integral_promote(tx);
numval_t vx = *pvx; numval_convert(tz, tx, &vx);
switch (tz) {
case TS_DOUBLE: {
double x = vx.d;
switch (op) {
case TT_PLUS: pvz->d = x; break;
case TT_MINUS: pvz->d = -x; break;
case TT_NOT: pvz->i = x == 0; tz = TS_INT; break;
default: tz = TS_VOID; break;
}
} break;
case TS_FLOAT: {
float x = vx.f;
switch (op) {
case TT_PLUS: pvz->f = x; break;
case TT_MINUS: pvz->f = -x; break;
case TT_NOT: pvz->i = x == 0; tz = TS_INT; break;
default: tz = TS_VOID; break;
}
} break;
case TS_ULLONG: case TS_ULONG: case TS_UINT: {
unsigned long long x = vx.u;
switch (op) {
case TT_PLUS: pvz->u = integral_mask(tz, x); break;
case TT_MINUS: pvz->u = integral_mask(tz, (unsigned long long)-(long long)x); break;
case TT_TILDE: pvz->u = integral_mask(tz, ~x); break;
case TT_NOT: pvz->i = x == 0; tz = TS_INT; break;
default: tz = TS_VOID; break;
}
} break;
case TS_LLONG: case TS_LONG: case TS_INT: {
long long x = vx.i;
switch (op) {
case TT_PLUS: pvz->i = integral_sext(tz, x); break;
case TT_MINUS: pvz->i = integral_sext(tz, -x); break;
case TT_TILDE: pvz->i = integral_sext(tz, ~x); break;
case TT_NOT: pvz->i = x == 0; tz = TS_INT; break;
default: tz = TS_VOID; break;
}
} break;
default: {
assert(false);
tz = TS_VOID; break;
} break;
}
return tz;
}
/* binary operation between two numbers */
static ts_t numval_binop(tt_t op, ts_t tx, const numval_t *pvx, ts_t ty, const numval_t *pvy, numval_t *pvz)
{
ts_t tz = ts_arith_common(tx, ty);
numval_t vx = *pvx, vy = *pvy;
numval_convert(tz, tx, &vx); numval_convert(tz, ty, &vy);
switch (tz) {
case TS_DOUBLE: {
double x = vx.d, y = vy.d;
switch (op) {
case TT_PLUS: pvz->d = x + y; break;
case TT_MINUS: pvz->d = x - y; break;
case TT_STAR: pvz->d = x * y; break;
case TT_SLASH: if (y) pvz->d = x / y; else tz = TS_VOID; break;
case TT_EQ: pvz->i = x == y; tz = TS_INT; break;
case TT_NE: pvz->i = x != y; tz = TS_INT; break;
case TT_LT: pvz->i = x < y; tz = TS_INT; break;
case TT_GT: pvz->i = x > y; tz = TS_INT; break;
case TT_LE: pvz->i = x <= y; tz = TS_INT; break;
case TT_GE: pvz->i = x >= y; tz = TS_INT; break;
default: tz = TS_VOID; break;
}
} break;
case TS_FLOAT: {
float x = vx.f, y = vy.f;
switch (op) {
case TT_PLUS: pvz->f = x + y; break;
case TT_MINUS: pvz->f = x - y; break;
case TT_STAR: pvz->f = x * y; break;
case TT_SLASH: if (y) pvz->f = x / y; else tz = TS_VOID; break;
case TT_EQ: pvz->i = x == y; tz = TS_INT; break;
case TT_NE: pvz->i = x != y; tz = TS_INT; break;
case TT_LT: pvz->i = x < y; tz = TS_INT; break;
case TT_GT: pvz->i = x > y; tz = TS_INT; break;
case TT_LE: pvz->i = x <= y; tz = TS_INT; break;
case TT_GE: pvz->i = x >= y; tz = TS_INT; break;
default: tz = TS_VOID; break;
}
} break;
case TS_ULLONG: case TS_ULONG: case TS_UINT: {
unsigned long long x = vx.u, y = vy.u;
switch (op) {
case TT_PLUS: pvz->u = integral_mask(tz, x + y); break;
case TT_MINUS: pvz->u = integral_mask(tz, x - y); break;
case TT_STAR: pvz->u = integral_mask(tz, x * y); break;
case TT_AND: pvz->u = integral_mask(tz, x & y); break;
case TT_OR: pvz->u = integral_mask(tz, x | y); break;
case TT_XOR: pvz->u = integral_mask(tz, x ^ y); break;
case TT_SLASH: if (y) pvz->u = integral_mask(tz, x / y); else tz = TS_VOID; break;
case TT_REM: if (y) pvz->u = integral_mask(tz, x % y); else tz = TS_VOID; break;
case TT_SHL: if (y >= 0 && y < 64) pvz->u = integral_mask(tz, x << y); break;
case TT_SHR: if (y >= 0 && y < 64) pvz->u = integral_mask(tz, x >> y); break;
case TT_EQ: pvz->i = x == y; tz = TS_INT; break;
case TT_NE: pvz->i = x != y; tz = TS_INT; break;
case TT_LT: pvz->i = x < y; tz = TS_INT; break;
case TT_GT: pvz->i = x > y; tz = TS_INT; break;
case TT_LE: pvz->i = x <= y; tz = TS_INT; break;
case TT_GE: pvz->i = x >= y; tz = TS_INT; break;
default: tz = TS_VOID; break;
}
} break;
case TS_LLONG: case TS_LONG: case TS_INT: {
long long x = vx.i, y = vy.i;
switch (op) {
case TT_PLUS: pvz->i = integral_sext(tz, x + y); break;
case TT_MINUS: pvz->i = integral_sext(tz, x - y); break;
case TT_STAR: pvz->i = integral_sext(tz, x * y); break;
case TT_AND: pvz->i = integral_sext(tz, x & y); break;
case TT_OR: pvz->i = integral_sext(tz, x | y); break;
case TT_XOR: pvz->i = integral_sext(tz, x ^ y); break;
case TT_SLASH: if (y) pvz->i = integral_sext(tz, x / y); else tz = TS_VOID; break;
case TT_REM: if (y) pvz->i = integral_sext(tz, x % y); else tz = TS_VOID; break;
case TT_SHL: if (y >= 0 && y < 64) pvz->i = integral_sext(tz, x << y); break;
case TT_SHR: if (y >= 0 && y < 64) pvz->i = integral_sext(tz, x >> y); break;
case TT_EQ: pvz->i = x == y; tz = TS_INT; break;
case TT_NE: pvz->i = x != y; tz = TS_INT; break;
case TT_LT: pvz->i = x < y; tz = TS_INT; break;
case TT_GT: pvz->i = x > y; tz = TS_INT; break;
case TT_LE: pvz->i = x <= y; tz = TS_INT; break;
case TT_GE: pvz->i = x >= y; tz = TS_INT; break;
default: tz = TS_VOID; break;
}
} break;
default: {
assert(false);
tz = TS_VOID; break;
} break;
}
return tz;
}
/* produce numerical constant instruction from literal */
static void asm_numerical_const(ts_t ts, numval_t *pval, inscode_t *pic)
{
switch (ts) {
case TS_BOOL:
pic->in = IN_I32_CONST; pic->arg.u = !!pval->u;
break;
case TS_CHAR: case TS_UCHAR:
case TS_SHORT: case TS_USHORT:
case TS_INT: case TS_UINT: case TS_ENUM:
case TS_LONG: case TS_ULONG: /* wasm32 */
pic->in = IN_I32_CONST; pic->arg.u = pval->u;
break;
case TS_LLONG: case TS_ULLONG:
pic->in = IN_I64_CONST; pic->arg.u = pval->u;
break;
case TS_FLOAT:
pic->in = IN_F32_CONST; pic->arg.f = pval->f;
break;
case TS_DOUBLE:
pic->in = IN_F64_CONST; pic->arg.d = pval->d;
break;
default: assert(false);
}
}
/* produce simd128 constant instruction from literal */
static void asm_simd128_const(ts_t ts, cbuf_t *pb, inscode_t *pic)
{
int i; unsigned char *p = (unsigned char *)cbdata(pb);
assert(cblen(pb) == 16);
pic->in = IN_V128_CONST;
pic->id = -(sym_t)ts; /* WAT hint fot format_inscode() &c. */
pic->arg.u = pic->arg2.u = 0ULL;
for (i = 15; i >= 0; --i) {
unsigned long long u = p[i];
if (i > 7) pic->arg2.u = (pic->arg2.u << 8) | u;
else pic->arg.u = (pic->arg.u << 8) | u;
}
}
/* 'register' (wasm local var) info for typecheck */
typedef struct ri {
sym_t name; /* register or global var name */
const node_t *ptn; /* NT_TYPE (not owned) */
} ri_t;
/* look up var in prib (sorted by name; can be NULL) or globally */
static const node_t *lookup_var_type(sym_t name, buf_t *prib, sym_t *pmod)
{
ri_t *pri; const node_t *pgn;
if (prib != NULL && (pri = bufbsearch(prib, &name, &sym_cmp)) != NULL) {
*pmod = 0; /* local symbol */
return pri->ptn;
} else if ((pgn = lookup_global(name)) != NULL) {
if (pgn->nt == NT_IMPORT && ndlen(pgn) == 1) {
*pmod = pgn->name; /* global symbol's module name */
assert(*pmod);
/* mark this import as actually referenced! */
mark_global_referenced(pgn);
return ndcref(pgn, 0);
}
}
return NULL;
}
/* limited type eval for const expressions; returns NULL on failures */
static const node_t *type_eval(node_t *pn, buf_t *prib)
{
switch (pn->nt) {
case NT_LITERAL: {
if (ts_numerical_or_enum(pn->ts)) {
return ndsettype(npalloc(), pn->ts);
} else if (pn->ts == TS_STRING || pn->ts == TS_LSTRING) {
ts_t ets = (pn->ts == TS_STRING) ? TS_CHAR : TS_INT;
return wrap_type_pointer(ndsettype(npalloc(), ets));
}
} break;
case NT_IDENTIFIER: {
sym_t mod = 0;
return lookup_var_type(pn->name, prib, &mod);
} break;
case NT_SUBSCRIPT: {
if (ndlen(pn) == 2) {
const node_t *ptn = type_eval(ndref(pn, 0), prib);
if (ptn && (ptn->ts == TS_ARRAY || ptn->ts == TS_PTR)) {
if (ndlen(ptn) > 0) return ndcref(ptn, 0);
}
}
} break;
case NT_POSTFIX: {
if (pn->op == TT_DOT && pn->name && ndlen(pn) == 1) {
const node_t *ptn = type_eval(ndref(pn, 0), prib);
if (ptn && (ptn->ts == TS_STRUCT || ptn->ts == TS_UNION)) {
size_t i;
if (ptn->name && !ndlen(ptn)) {
node_t *pftn = (node_t *)lookup_eus_type(ptn->ts, ptn->name);
if (!pftn) n2eprintf(ptn, pn, "can't allocate/measure incomplete union type");
else ptn = pftn;
}
for (i = 0; i < ndlen(ptn); ++i) {
const node_t *pni = ndcref(ptn, i);
if (pni->nt == NT_VARDECL && pni->name == pn->name) {
return ndcref(pni, 0);
}
}
}
} else if (pn->op == TT_ARROW && pn->name && ndlen(pn) == 1) {
const node_t *ptn = type_eval(ndref(pn, 0), prib);
if (ptn && ptn->ts == TS_PTR && ndlen(ptn) == 1) {
ptn = ndcref(ptn, 0);
if (ptn->ts == TS_STRUCT || ptn->ts == TS_UNION) {
size_t i;
if (ptn->name && !ndlen(ptn)) {
node_t *pftn = (node_t *)lookup_eus_type(ptn->ts, ptn->name);
if (!pftn) n2eprintf(ptn, pn, "can't allocate/measure incomplete union type");
else ptn = pftn;
}
for (i = 0; i < ndlen(ptn); ++i) {
const node_t *pni = ndcref(ptn, i);
if (pni->nt == NT_VARDECL && pni->name == pn->name) {
return ndcref(pni, 0);
}
}
}
}
}
} break;
case NT_PREFIX: {
if (pn->op == TT_STAR && ndlen(pn) == 1) {
const node_t *ptn = type_eval(ndref(pn, 0), prib);
if (ptn && ptn->ts == TS_PTR && ndlen(ptn) == 1) {
if (ndlen(ptn) == 1) return ndcref(ptn, 0);
}
}
} break;
default:
break;
}
return NULL;
}
/* calc size/align for ptn; prn is NULL or reference node for errors */
void measure_type(const node_t *ptn, node_t *prn, size_t *psize, size_t *palign, int lvl)
{
assert(ptn && ptn->nt == NT_TYPE);
if (lvl > 100) n2eprintf(ptn, prn, "type too large (possible infinite nesting)");
*psize = *palign = 0;
switch (ptn->ts) {
case TS_VOID:
n2eprintf(ptn, prn, "can't allocate/measure void type");
break;
case TS_ETC:
n2eprintf(ptn, prn, "can't allocate data for ... yet");
break;
case TS_V128:
*psize = *palign = 16;
break;
case TS_BOOL:
case TS_CHAR: case TS_UCHAR:
*psize = *palign = 1;
break;
case TS_SHORT: case TS_USHORT:
*psize = *palign = 2;
break;
case TS_INT: case TS_UINT:
case TS_ENUM:
case TS_FLOAT:
*psize = *palign = 4;
break;
case TS_LONG: case TS_ULONG:
case TS_STRING: case TS_LSTRING:
case TS_PTR:
/* wasm32; should be 8 for wasm64 */
*psize = *palign = 4;
break;
case TS_LLONG: case TS_ULLONG:
case TS_DOUBLE:
*psize = *palign = 8;
break;
case TS_UNION: {
size_t size, align, i, n;
if (ptn->name && !ndlen(ptn)) {
node_t *pftn = (node_t *)lookup_eus_type(TS_UNION, ptn->name);
if (!pftn) n2eprintf(ptn, prn, "can't allocate/measure incomplete union type");
else ptn = pftn;
}
for (i = 0; i < ndlen(ptn); ++i) {
const node_t *pni = ndcref(ptn, i);
if (pni->nt == NT_VARDECL && ndlen(pni) == 1) pni = ndcref(pni, 0);
measure_type(pni, prn, &size, &align, lvl+1);
if (size > *psize) *psize = size;
if (align > *palign) *palign = align;
}
if (!*psize || !*palign)
n2eprintf(ptn, prn, "can't allocate/measure empty or incomplete union");
/* round size up so it is multiple of align */
if ((n = *psize % *palign) > 0) *psize += *palign - n;
} break;
case TS_STRUCT: {
size_t size, align, i, n;
if (ptn->name && !ndlen(ptn)) {
node_t *pftn = (node_t *)lookup_eus_type(TS_STRUCT, ptn->name);
if (!pftn) n2eprintf(ptn, prn, "can't allocate/measure incomplete struct type");
else ptn = pftn;
}
for (i = 0; i < ndlen(ptn); ++i) {
const node_t *pni = ndcref(ptn, i);
if (pni->nt == NT_VARDECL && ndlen(pni) == 1) pni = ndcref(pni, 0);
measure_type(pni, prn, &size, &align, lvl+1);
/* round size up so it is multiple of pni align */
if ((n = *psize % align) > 0) *psize += align - n;
*psize += size; if (align > *palign) *palign = align;
}
if (!*psize || !*palign)
n2eprintf(ptn, prn, "can't allocate/measure empty or incomplete struct");
/* round size up so it is multiple of align */
if ((n = *psize % *palign) > 0) *psize += *palign - n;
} break;
case TS_ARRAY: {
if (ndlen(ptn) == 2) {
const node_t *petn = ndcref(ptn, 0), *pcn = ndcref(ptn, 1);
int count = 0;
/* fixme: eval may need to see local vars, so prib is needed */
if (!arithmetic_eval_to_int((node_t*)pcn, NULL, &count) || count <= 0)
n2eprintf(pcn, prn, "can't allocate/measure data for arrays of nonconstant/nonpositive size");
measure_type(petn, prn, psize, palign, lvl+1);
*psize *= count;
} else {
n2eprintf(ptn, prn, "can't allocate/measure data for arrays of unspecified size");
}
} break;
case TS_FUNCTION:
n2eprintf(ptn, prn, "can't allocate/measure data for function");
break;
default:
assert(false);
}
if (!*psize || !*palign)
n2eprintf(ptn, prn, "can't allocate/measure type");
}
/* calc offset for ptn.fld; prn is NULL or reference node for errors */
size_t measure_offset(const node_t *ptn, node_t *prn, sym_t fld, node_t **ppftn)
{
assert(ptn && ptn->nt == NT_TYPE);
switch (ptn->ts) {
case TS_UNION: {
size_t i;
if (ptn->name && !ndlen(ptn)) {
node_t *pftn = (node_t *)lookup_eus_type(TS_UNION, ptn->name);
if (!pftn) n2eprintf(ptn, prn, "can't measure incomplete union type");
else ptn = pftn;
}
for (i = 0; i < ndlen(ptn); ++i) {
const node_t *pni = ndcref(ptn, i);
if (pni->nt == NT_VARDECL && pni->name == fld) {
if (ppftn) *ppftn = (node_t*)ndcref(pni, 0);
return 0;
}
}
n2eprintf(ptn, prn, "can't find field .%s in union", symname(fld));
} break;
case TS_STRUCT: {
size_t size, align, i, n, cursize = 0;
if (ptn->name && !ndlen(ptn)) {
node_t *pftn = (node_t *)lookup_eus_type(TS_STRUCT, ptn->name);
if (!pftn) n2eprintf(ptn, prn, "can't measure incomplete struct type");
else ptn = pftn;
}
for (i = 0; i < ndlen(ptn); ++i) {
const node_t *pni = ndcref(ptn, i); sym_t s = 0;
if (pni->nt == NT_VARDECL && ndlen(pni) == 1) s = pni->name, pni = ndcref(pni, 0);
measure_type(pni, prn, &size, &align, 0);
/* round size up so it is multiple of pni align */
if ((n = cursize % align) > 0) cursize += align - n;
if (s == fld) {
if (ppftn) *ppftn = (node_t*)pni;
return cursize;
}
cursize += size;
}
n2eprintf(ptn, prn, "can't find field .%s in struct", symname(fld));
} break;
default:;
}
n2eprintf(ptn, prn, "can't find field .%s in type", symname(fld));
return 0; /* won't happen */
}
/* intern the string literal, return fresh data id */
static sym_t intern_strlit(node_t *pn)
{
if (!pn->name) { /* first attempt */
size_t n = watieblen(&g_curpwm->exports);
watie_t *pd = watiebnewbk(&g_curpwm->exports, IEK_DATA);
assert(pn->ts == TS_STRING || pn->ts == TS_LSTRING);
pd->mod = g_curmod;
pd->id = internf("ds%d$", (int)n);
cbcpy(&pd->data, &pn->data);
pd->align = (pn->ts == TS_LSTRING) ? 4 /* wchar_t */ : 1 /* char */;
pd->mut = MT_CONST;
pn->name = pd->id;
}
return pn->name;
}
/* evaluate pn expression statically, putting result into pr */
bool static_eval(node_t *pn, buf_t *prib, seval_t *pr)
{
pr->id = 0;
switch (pn->nt) {
case NT_LITERAL: {
if (ts_numerical(pn->ts)) {
pr->ts = pn->ts;
pr->val = pn->val;
return true;
} else if (pn->ts == TS_STRING || pn->ts == TS_LSTRING) {
sym_t id = pn->name;
if (!id) {
node_t vn = mknd();
ts_t ets = (pn->ts == TS_STRING) ? TS_CHAR : TS_INT;
id = intern_strlit(pn); /* sets pn->name */
ndset(&vn, NT_VARDECL, pn->pwsid, pn->startpos);
vn.name = id;
wrap_type_pointer(ndsettype(ndnewbk(&vn), ets));
/* post id so initialize_bulk_data can find it */
post_symbol(g_curmod, &vn, true/*final*/, true/*hide*/);
ndfini(&vn);
}
pr->ts = TS_PTR;
pr->id = id;
pr->val.i = 0; /* no offset */
return true;
}
} break;
case NT_INTRCALL: {
if (pn->intr == INTR_SIZEOF || pn->intr == INTR_ALIGNOF) {
const node_t *ptn = NULL;
size_t size, align; assert(ndlen(pn) == 1);
if (ndref(pn, 0)->nt == NT_TYPE) ptn = ndref(pn, 0);
else ptn = type_eval(ndref(pn, 0), prib);
if (!ptn) return false; /* can't get type */
measure_type(ptn, pn, &size, &align, 0);
pr->ts = TS_INT;
if (pn->intr == INTR_SIZEOF) pr->val.i = (int)size;
else pr->val.i = (int)align;
return true;
} else if (pn->intr == INTR_OFFSETOF) {
const node_t *ptn = NULL;
size_t offset; assert(ndlen(pn) == 2 && ndref(pn, 1)->nt == NT_IDENTIFIER);
if (ndref(pn, 0)->nt == NT_TYPE) ptn = ndref(pn, 0);
else ptn = type_eval(ndref(pn, 0), prib);
if (!ptn) return false; /* can't get type */
offset = measure_offset(ptn, pn, ndref(pn, 1)->name, NULL);
pr->ts = TS_INT;
pr->val.i = (int)offset;
return true;
} else if (pn->intr == INTR_COUNTOF) {
const node_t *ptn = NULL; assert(ndlen(pn) == 1);
if (ndref(pn, 0)->nt == NT_TYPE) ptn = ndref(pn, 0);
else ptn = type_eval(ndref(pn, 0), prib);
if (ptn && ptn->ts == TS_ARRAY && ndlen(ptn) == 2) {
size_t asize, esize, align;
/* make sure array size is filled properly */
measure_type(ptn, pn, &asize, &align, 0);
measure_type(ndcref(ptn, 0), pn, &esize, &align, 0);
if (esize != 0) {
pr->ts = TS_INT;
pr->val.i = (int)(asize/esize);
return true;
}
}
return false; /* can't get sized array type */
} else if (pn->intr == INTR_GENERIC) {
size_t i; node_t *psn; const node_t *ptn = NULL;
assert(ndlen(pn) >= 1);
psn = ndref(pn, 0);
if (psn->nt == NT_TYPE) ptn = psn;
else ptn = type_eval(psn, prib);
if (!ptn && static_eval(psn, prib, pr) && !pr->id) {
ptn = ndsettype(npalloc(), pr->ts);
}
if (!ptn) return false; /* can't get type */
for (i = 1; i+1 < ndlen(pn); i += 2) {
node_t *ptni = ndref(pn, i), *pxni = ndref(pn, i+1);
if (ptni->nt == NT_NULL || same_type(ptn, ptni))
return static_eval(pxni, prib, pr); /* tail call? */
}
return false;
} else if (pn->intr == INTR_ACODE) {
instr_t in = IN_UNREACHABLE; node_t *pan; seval_t rx; bool ok = false;
if (ndlen(pn) > 0 && (pan = ndref(pn, 0))->nt == NT_ACODE && icblen(&pan->data) == 1)
in = icbref(&pan->data, 0)->in;
switch (in) {
case IN_I32_REINTERPRET_F32: case IN_F32_REINTERPRET_I32: {
ts_t tc = in == IN_I32_REINTERPRET_F32 ? TS_FLOAT : TS_UINT;
if (ndlen(pn) == 2 && static_eval(ndref(pn, 1), prib, &rx) && rx.ts == tc) {
union { unsigned u; float f; } uf;
if (tc == TS_FLOAT) { uf.f = rx.val.f; pr->ts = TS_UINT; pr->val.u = uf.u; }
else { uf.u = (unsigned)rx.val.u; pr->ts = TS_FLOAT; pr->val.f = uf.f; }
ok = true;
}
} break;
case IN_I64_REINTERPRET_F64: case IN_F64_REINTERPRET_I64: {
ts_t tc = in == IN_I64_REINTERPRET_F64 ? TS_DOUBLE : TS_ULLONG;
if (ndlen(pn) == 2 && static_eval(ndref(pn, 1), prib, &rx) && rx.ts == tc) {
pr->ts = (tc == TS_DOUBLE) ? TS_ULLONG : TS_DOUBLE;
pr->val = rx.val; ok = true;
}
} break;
default:;
}
return ok;
}
} break;
case NT_PREFIX: {
seval_t rx; node_t *psn; bool ok = false;
assert(ndlen(pn) == 1);
if (pn->op == TT_AND && ndref(pn, 0)->nt == NT_IDENTIFIER) {
pr->ts = TS_PTR; pr->val.i = 0; pr->id = ndref(pn, 0)->name;
ok = true;
} else if (pn->op == TT_AND && (psn = ndref(pn, 0))->nt == NT_SUBSCRIPT
&& ndref(psn, 0)->nt == NT_IDENTIFIER) {
assert(ndlen(psn) == 2);
if (static_eval(ndref(psn, 1), prib, &rx) && rx.ts == TS_INT) {
pr->ts = TS_PTR; pr->val = rx.val; pr->id = ndref(psn, 0)->name;
ok = true;
}
} else if (static_eval(ndref(pn, 0), prib, &rx)) {
if (ts_numerical(rx.ts)) {
numval_t vz; ts_t tz = numval_unop(pn->op, rx.ts, &rx.val, &vz);
if (tz != TS_VOID) { pr->ts = tz; pr->val = vz; ok = true; }
} else if (rx.ts == TS_PTR && pn->op == TT_NOT) {
pr->ts = TS_INT; pr->val.i = 0; ok = true; /* dseg ptr != NULL */
}
}
return ok;
} break;
case NT_INFIX: {
seval_t rx, ry; bool ok = false;
assert(ndlen(pn) == 2);
if (static_eval(ndref(pn, 0), prib, &rx) && static_eval(ndref(pn, 1), prib, &ry)) {
if (ts_numerical(rx.ts) && ts_numerical(ry.ts)) {
numval_t vz; ts_t tz = numval_binop(pn->op, rx.ts, &rx.val, ry.ts, &ry.val, &vz);
if (tz != TS_VOID) { pr->ts = tz; pr->val = vz; ok = true; }
} else if (rx.ts == TS_PTR && ry.ts == TS_INT && (pn->op == TT_MINUS || pn->op == TT_PLUS)) {
rx.val.i = (pn->op == TT_MINUS) ? rx.val.i - ry.val.i : rx.val.i + ry.val.i;
*pr = rx; ok = true;
} else if (rx.ts == TS_INT && ry.ts == TS_PTR && pn->op == TT_PLUS) {
ry.val.i = ry.val.i + rx.val.i;
*pr = ry; ok = true;
} else if (rx.ts == TS_PTR && ry.ts == TS_PTR && rx.id == ry.id) {
pr->ts = TS_INT; ok = true;
switch (pn->op) {
case TT_MINUS: pr->val.i = rx.val.i - ry.val.i; break;
case TT_EQ: pr->val.i = rx.val.i == ry.val.i; break;
case TT_NE: pr->val.i = rx.val.i != ry.val.i; break;
case TT_LT: pr->val.i = rx.val.i < ry.val.i; break;
case TT_GT: pr->val.i = rx.val.i > ry.val.i; break;
case TT_LE: pr->val.i = rx.val.i <= ry.val.i; break;
case TT_GE: pr->val.i = rx.val.i >= ry.val.i; break;
default: ok = false; break;
}
}
}
return ok;
} break;
case NT_COND: {
seval_t r; bool ok = false; int cond;
assert(ndlen(pn) == 3);
if (arithmetic_eval_to_int(ndref(pn, 0), prib, &cond)) {
if (cond) ok = static_eval(ndref(pn, 1), prib, &r);
else ok = static_eval(ndref(pn, 2), prib, &r);
if (ok) *pr = r; /* can be num or ptr! */
}
return ok;
} break;
case NT_CAST: {
seval_t rx; ts_t tc; bool ok = false;
assert(ndlen(pn) == 2); assert(ndref(pn, 0)->nt == NT_TYPE);
tc = ndref(pn, 0)->ts;
if (ts_numerical(tc) && static_eval(ndref(pn, 1), prib, &rx) && ts_numerical(rx.ts)) {
numval_t vc = rx.val; numval_convert(tc, rx.ts, &vc);
pr->ts = tc; pr->val = vc; ok = true;
} else if (tc == TS_PTR && ndlen(ndref(pn, 0)) == 1 && ndref(ndref(pn, 0), 0)->ts == TS_VOID) {
int ri; /* see if this is NULL pointer, i.e. (void*)0 */
if (arithmetic_eval_to_int(ndref(pn, 1), prib, &ri) && ri == 0) {
pr->ts = TS_PTR; pr->val.i = 0; pr->id = 0; ok = true;
}
}
return ok;
} break;
default:;
}
return false;
}
/* evaluate integer expression pn statically, putting result into pi */
bool arithmetic_eval_to_int(node_t *pn, buf_t *prib, int *pri)
{
seval_t r; bool ok = false;
if (static_eval(pn, prib, &r) && ts_numerical(r.ts)) {
numval_convert(TS_INT, r.ts, &r.val);
*pri = (int)r.val.i;
ok = true;
}
return ok;
}
/* calculate effective ts for v128's boolean */
static ts_t v128_int_ts_for_bool(int cnt)
{
ts_t ts = TS_VOID;
switch (cnt) {
case 16: ts = TS_CHAR; break;
case 8: ts = TS_SHORT; break;
case 4: ts = TS_INT; break;
case 2: ts = TS_LLONG; break;
default: assert(false);
}
return ts;
}
/* evaluate pn expression statically, putting result into prn (numbers/simd only) */
bool arithmetic_eval(node_t *pn, buf_t *prib, node_t *prn)
{
seval_t r; bool ok = false;
if (static_eval(pn, prib, &r) && ts_numerical(r.ts)) {
ndset(prn, NT_LITERAL, pn->pwsid, pn->startpos);