-
-
Notifications
You must be signed in to change notification settings - Fork 5.6k
/
Copy pathircode.c
1679 lines (1584 loc) · 55.8 KB
/
ircode.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
// This file is a part of Julia. License is MIT: https://julialang.org/license
/*
encoding IR to/from compact representation
*/
#include <stdlib.h>
#include <string.h>
#include "julia.h"
#include "julia_internal.h"
#include "serialize.h"
#include "julia_assert.h"
#ifdef __cplusplus
extern "C" {
#endif
#define TAG_SYMBOL 2
#define TAG_SSAVALUE 3
#define TAG_DATATYPE 4
#define TAG_SLOTNUMBER 5
#define TAG_SVEC 6
#define TAG_NEARBYSSAVALUE 7
#define TAG_NULL 8
#define TAG_EXPR 9
#define TAG_PHINODE 10
#define TAG_PHICNODE 11
#define TAG_LONG_SYMBOL 12
#define TAG_LONG_SVEC 13
#define TAG_LONG_EXPR 14
#define TAG_LONG_PHINODE 15
#define TAG_LONG_PHICNODE 16
#define TAG_METHODROOT 17
#define TAG_EDGE 18
#define TAG_STRING 19
#define TAG_SHORT_INT64 20
//#define TAG_UNUSED 21
#define TAG_CNULL 22
#define TAG_ARRAY1D 23
#define TAG_SINGLETON 24
#define TAG_MODULE 25
#define TAG_TVAR 26
#define TAG_METHOD_INSTANCE 27
#define TAG_METHOD 28
#define TAG_CODE_INSTANCE 29
#define TAG_COMMONSYM 30
#define TAG_NEARBYGLOBAL 31
#define TAG_GLOBALREF 32
#define TAG_CORE 33
#define TAG_BASE 34
#define TAG_BITYPENAME 35
#define TAG_NEARBYMODULE 36
#define TAG_INT32 37
#define TAG_INT64 38
#define TAG_UINT8 39
#define TAG_VECTORTY 40
#define TAG_PTRTY 41
#define TAG_LONG_SSAVALUE 42
#define TAG_LONG_METHODROOT 43
#define TAG_LONG_EDGE 44
#define TAG_SHORTER_INT64 45
#define TAG_SHORT_INT32 46
#define TAG_CALL1 47
#define TAG_CALL2 48
#define TAG_SHORT_BACKREF 49
#define TAG_BACKREF 50
#define TAG_UNIONALL 51
#define TAG_GOTONODE 52
#define TAG_QUOTENODE 53
#define TAG_GENERAL 54
#define TAG_GOTOIFNOT 55
#define TAG_RETURNNODE 56
#define TAG_ARGUMENT 57
#define TAG_RELOC_METHODROOT 58
#define TAG_BINDING 59
#define TAG_MEMORYT 60
#define TAG_ENTERNODE 61
#define LAST_TAG 61
typedef struct {
ios_t *s;
size_t ssaid;
// method we're compressing for
jl_method_t *method;
jl_svec_t *edges;
jl_ptls_t ptls;
uint8_t relocatability;
} jl_ircode_state;
// type => tag hash for a few core types (e.g., Expr, PhiNode, etc)
static htable_t ser_tag;
// tag => type mapping, the reverse of ser_tag
static jl_value_t *deser_tag[256];
// hash of some common symbols, encoded as CommonSym_tag plus 1 byte
static htable_t common_symbol_tag;
static jl_value_t *deser_symbols[256];
static void *jl_lookup_ser_tag(jl_value_t *v)
{
return ptrhash_get(&ser_tag, v);
}
static void *jl_lookup_common_symbol(jl_value_t *v)
{
return ptrhash_get(&common_symbol_tag, v);
}
static jl_value_t *jl_deser_tag(uint8_t tag)
{
return deser_tag[tag];
}
static jl_value_t *jl_deser_symbol(uint8_t tag)
{
return deser_symbols[tag];
}
// --- encoding ---
static void jl_encode_value_(jl_ircode_state *s, jl_value_t *v, int as_literal);
#define jl_encode_value(s, v) jl_encode_value_((s), (jl_value_t*)(v), 0)
static void tagged_root(rle_reference *rr, jl_ircode_state *s, int i)
{
if (!get_root_reference(rr, s->method, i))
s->relocatability = 0;
}
static void literal_val_id(rle_reference *rr, jl_ircode_state *s, jl_value_t *v)
{
jl_array_t *rs = s->method->roots;
int i, l = jl_array_nrows(rs);
if (jl_is_symbol(v) || jl_is_concrete_type(v)) { // TODO: or more generally, any ptr-egal value
for (i = 0; i < l; i++) {
if (jl_array_ptr_ref(rs, i) == v)
return tagged_root(rr, s, i);
}
}
else {
for (i = 0; i < l; i++) {
if (jl_egal(jl_array_ptr_ref(rs, i), v))
return tagged_root(rr, s, i);
}
}
for (size_t i = 0; i < jl_svec_len(s->edges); i++) {
if (jl_svecref(s->edges, i) == v) {
rr->index = i;
return;
}
}
jl_add_method_root(s->method, jl_precompile_toplevel_module, v);
return tagged_root(rr, s, jl_array_nrows(rs) - 1);
}
static void jl_encode_int32(jl_ircode_state *s, int32_t x)
{
if (x >= INT16_MIN && x <= INT16_MAX) {
write_uint8(s->s, TAG_SHORT_INT32);
write_uint16(s->s, (uint16_t)x);
}
else {
write_uint8(s->s, TAG_INT32);
write_int32(s->s, x);
}
}
static void jl_encode_as_indexed_root(jl_ircode_state *s, jl_value_t *v)
{
rle_reference rr = {.key = -1, .index = -1};
if (jl_is_string(v))
v = jl_as_global_root(v, 1);
literal_val_id(&rr, s, v);
int id = rr.index;
assert(id >= 0);
if (rr.key == -1) {
if (id <= UINT8_MAX) {
write_uint8(s->s, TAG_EDGE);
write_uint8(s->s, id);
}
else {
write_uint8(s->s, TAG_LONG_EDGE);
write_uint32(s->s, id);
}
return;
}
if (rr.key) {
write_uint8(s->s, TAG_RELOC_METHODROOT);
write_uint64(s->s, rr.key);
}
if (id <= UINT8_MAX) {
write_uint8(s->s, TAG_METHODROOT);
write_uint8(s->s, id);
}
else {
assert(id <= UINT32_MAX);
write_uint8(s->s, TAG_LONG_METHODROOT);
write_uint32(s->s, id);
}
}
static void jl_encode_memory_slice(jl_ircode_state *s, jl_genericmemory_t *mem, size_t offset, size_t len)
{
jl_datatype_t *t = (jl_datatype_t*)jl_typetagof(mem);
size_t i;
const jl_datatype_layout_t *layout = t->layout;
if (layout->flags.arrayelem_isboxed) {
for (i = 0; i < len; i++) {
jl_value_t *e = jl_genericmemory_ptr_ref(mem, offset + i);
jl_encode_value(s, e);
}
}
else if (layout->first_ptr >= 0) {
uint16_t elsz = layout->size;
size_t j, np = layout->npointers;
const char *data = (const char*)mem->ptr + offset * elsz;
for (i = 0; i < len; i++) {
const char *start = data;
for (j = 0; j < np; j++) {
uint32_t ptr = jl_ptr_offset(t, j);
const jl_value_t *const *fld = &((const jl_value_t *const *)data)[ptr];
if ((const char*)fld != start)
ios_write(s->s, start, (const char*)fld - start);
JL_GC_PROMISE_ROOTED(*fld);
jl_encode_value(s, *fld);
start = (const char*)&fld[1];
}
data += elsz;
if (data != start)
ios_write(s->s, start, data - start);
}
}
else {
ios_write(s->s, (char*)mem->ptr + offset * layout->size, len * layout->size);
if (layout->flags.arrayelem_isunion)
ios_write(s->s, jl_genericmemory_typetagdata(mem) + offset, len);
}
}
static void jl_encode_value_(jl_ircode_state *s, jl_value_t *v, int as_literal)
{
size_t i;
if (v == NULL) {
write_uint8(s->s, TAG_NULL);
return;
}
void *tag = jl_lookup_ser_tag(v);
if (tag != HT_NOTFOUND) {
uint8_t t8 = (intptr_t)tag;
if (t8 <= LAST_TAG)
write_uint8(s->s, 0);
write_uint8(s->s, t8);
}
else if (jl_is_symbol(v) && (tag = jl_lookup_common_symbol(v)) != HT_NOTFOUND) {
write_uint8(s->s, TAG_COMMONSYM);
write_uint8(s->s, (uint8_t)(size_t)tag);
}
else if (v == (jl_value_t*)jl_core_module) {
write_uint8(s->s, TAG_CORE);
}
else if (v == (jl_value_t*)jl_base_module) {
write_uint8(s->s, TAG_BASE);
}
else if (jl_typetagis(v, jl_string_tag << 4) && jl_string_len(v) == 0) {
jl_encode_value(s, jl_an_empty_string);
}
else if (v == (jl_value_t*)s->method->module) {
write_uint8(s->s, TAG_NEARBYMODULE);
}
else if (jl_is_datatype(v) && ((jl_datatype_t*)v)->name == jl_array_typename &&
jl_is_long(jl_tparam1(v)) && jl_unbox_long(jl_tparam1(v)) == 1 &&
!((jl_datatype_t*)v)->hasfreetypevars) {
write_uint8(s->s, TAG_VECTORTY);
jl_encode_value(s, jl_tparam0(v));
}
else if (jl_is_datatype(v) && ((jl_datatype_t*)v)->name == jl_pointer_typename &&
!((jl_datatype_t*)v)->hasfreetypevars) {
write_uint8(s->s, TAG_PTRTY);
jl_encode_value(s, jl_tparam0(v));
}
else if (jl_is_svec(v)) {
size_t l = jl_svec_len(v);
if (l <= 255) {
write_uint8(s->s, TAG_SVEC);
write_uint8(s->s, (uint8_t)l);
}
else {
write_uint8(s->s, TAG_LONG_SVEC);
write_int32(s->s, l);
}
for (i = 0; i < l; i++) {
jl_encode_value(s, jl_svecref(v, i));
}
}
else if (jl_is_globalref(v)) {
if (jl_globalref_mod(v) == s->method->module) {
write_uint8(s->s, TAG_NEARBYGLOBAL);
jl_encode_value(s, jl_globalref_name(v));
}
else {
write_uint8(s->s, TAG_GLOBALREF);
jl_encode_value(s, jl_globalref_mod(v));
jl_encode_value(s, jl_globalref_name(v));
}
}
else if (jl_is_ssavalue(v) && s->ssaid - ((jl_ssavalue_t*)v)->id < 256) {
write_uint8(s->s, TAG_NEARBYSSAVALUE);
write_uint8(s->s, s->ssaid - ((jl_ssavalue_t*)v)->id);
}
else if (jl_is_ssavalue(v) && ((jl_ssavalue_t*)v)->id < 256 && ((jl_ssavalue_t*)v)->id >= 0) {
write_uint8(s->s, TAG_SSAVALUE);
write_uint8(s->s, ((jl_ssavalue_t*)v)->id);
}
else if (jl_is_ssavalue(v) && ((jl_ssavalue_t*)v)->id <= UINT16_MAX && ((jl_ssavalue_t*)v)->id >= 0) {
write_uint8(s->s, TAG_LONG_SSAVALUE);
write_uint16(s->s, ((jl_ssavalue_t*)v)->id);
}
else if (jl_typetagis(v, jl_slotnumber_type) && jl_slot_number(v) <= UINT16_MAX && jl_slot_number(v) >= 0) {
write_uint8(s->s, TAG_SLOTNUMBER);
write_uint16(s->s, jl_slot_number(v));
}
else if (jl_is_expr(v)) {
jl_expr_t *e = (jl_expr_t*)v;
size_t l = jl_array_nrows(e->args);
if (e->head == jl_call_sym) {
if (l == 2) {
write_uint8(s->s, TAG_CALL1);
jl_encode_value(s, jl_exprarg(e, 0));
jl_encode_value(s, jl_exprarg(e, 1));
return;
}
else if (l == 3) {
write_uint8(s->s, TAG_CALL2);
jl_encode_value(s, jl_exprarg(e, 0));
jl_encode_value(s, jl_exprarg(e, 1));
jl_encode_value(s, jl_exprarg(e, 2));
return;
}
}
if (l <= 255) {
write_uint8(s->s, TAG_EXPR);
write_uint8(s->s, (uint8_t)l);
}
else {
write_uint8(s->s, TAG_LONG_EXPR);
write_int32(s->s, l);
}
jl_encode_value(s, e->head);
for (i = 0; i < l; i++) {
jl_encode_value(s, jl_exprarg(e, i));
}
}
else if (jl_is_phinode(v)) {
jl_array_t *edges = (jl_array_t*)jl_fieldref_noalloc(v, 0);
jl_array_t *values = (jl_array_t*)jl_fieldref_noalloc(v, 1);
size_t l = jl_array_nrows(edges);
if (l <= 255 && jl_array_nrows(values) == l) {
write_uint8(s->s, TAG_PHINODE);
write_uint8(s->s, (uint8_t)l);
}
else {
write_uint8(s->s, TAG_LONG_PHINODE);
write_int32(s->s, l);
write_int32(s->s, jl_array_nrows(values));
}
for (i = 0; i < l; i++) {
int32_t e = jl_array_data(edges, int32_t)[i];
if (e <= 0 && e <= 20) { // 1-byte encodings
jl_value_t *ebox = jl_box_int32(e);
JL_GC_PROMISE_ROOTED(ebox);
jl_encode_value(s, ebox);
}
else
jl_encode_int32(s, e);
}
l = jl_array_nrows(values);
for (i = 0; i < l; i++) {
jl_encode_value(s, jl_array_ptr_ref(values, i));
}
}
else if (jl_is_phicnode(v)) {
jl_array_t *values = (jl_array_t*)jl_fieldref_noalloc(v, 0);
size_t l = jl_array_nrows(values);
if (l <= 255) {
write_uint8(s->s, TAG_PHICNODE);
write_uint8(s->s, (uint8_t)l);
}
else {
write_uint8(s->s, TAG_LONG_PHICNODE);
write_int32(s->s, l);
}
for (i = 0; i < l; i++) {
jl_encode_value(s, jl_array_ptr_ref(values, i));
}
}
else if (jl_is_gotonode(v)) {
write_uint8(s->s, TAG_GOTONODE);
jl_value_t *f = jl_get_nth_field(v, 0);
JL_GC_PUSH1(&f);
jl_encode_value(s, f);
JL_GC_POP();
}
else if (jl_is_gotoifnot(v)) {
write_uint8(s->s, TAG_GOTOIFNOT);
jl_value_t *f = jl_get_nth_field_noalloc(v, 0);
JL_GC_PUSH1(&f);
jl_encode_value(s, f);
f = jl_get_nth_field(v, 1);
jl_encode_value(s, f);
JL_GC_POP();
}
else if (jl_is_enternode(v)) {
write_uint8(s->s, TAG_ENTERNODE);
jl_value_t *f = jl_get_nth_field(v, 0);
JL_GC_PUSH1(&f);
jl_encode_value(s, f);
f = jl_get_nth_field_noalloc(v, 1);
jl_encode_value(s, f);
JL_GC_POP();
}
else if (jl_is_argument(v)) {
write_uint8(s->s, TAG_ARGUMENT);
jl_value_t *f = jl_get_nth_field(v, 0);
JL_GC_PUSH1(&f);
jl_encode_value(s, f);
JL_GC_POP();
}
else if (jl_is_returnnode(v)) {
write_uint8(s->s, TAG_RETURNNODE);
jl_encode_value(s, jl_returnnode_value(v));
}
else if (jl_is_quotenode(v)) {
write_uint8(s->s, TAG_QUOTENODE);
jl_value_t *inner = jl_quotenode_value(v);
// we might need to return this exact object at run time, therefore codegen might
// need to reference it as well, so it is more likely useful to give it a root
if (jl_is_expr(inner) || jl_is_phinode(inner) || jl_is_phicnode(inner))
jl_encode_as_indexed_root(s, inner);
else
jl_encode_value(s, inner);
}
else if (jl_typetagis(v, jl_int64_tag << 4)) {
void *data = jl_data_ptr(v);
if (*(int64_t*)data >= INT16_MIN && *(int64_t*)data <= INT16_MAX) {
write_uint8(s->s, TAG_SHORTER_INT64);
write_uint16(s->s, (uint16_t)*(int64_t*)data);
}
else if (*(int64_t*)data >= S32_MIN && *(int64_t*)data <= S32_MAX) {
write_uint8(s->s, TAG_SHORT_INT64);
write_int32(s->s, (int32_t)*(int64_t*)data);
}
else {
write_uint8(s->s, TAG_INT64);
write_uint64(s->s, *(int64_t*)data);
}
}
else if (jl_typetagis(v, jl_int32_tag << 4)) {
jl_encode_int32(s, *(int32_t*)jl_data_ptr(v));
}
else if (jl_typetagis(v, jl_uint8_tag << 4)) {
write_uint8(s->s, TAG_UINT8);
write_int8(s->s, *(int8_t*)jl_data_ptr(v));
}
else if (((jl_datatype_t*)jl_typeof(v))->instance == v) {
write_uint8(s->s, TAG_SINGLETON);
jl_encode_value(s, jl_typeof(v));
}
else if (as_literal && jl_typetagis(v, jl_string_tag << 4)) {
write_uint8(s->s, TAG_STRING);
write_int32(s->s, jl_string_len(v));
ios_write(s->s, jl_string_data(v), jl_string_len(v));
}
else if (as_literal && jl_is_array(v) && jl_array_ndims(v)) {
jl_array_t *ar = (jl_array_t*)v;
write_uint8(s->s, TAG_ARRAY1D);
size_t l = jl_array_dim0(ar);
jl_value_t *lbox = jl_box_long(l);
JL_GC_PUSH1(&lbox);
jl_encode_value(s, lbox);
JL_GC_POP();
jl_encode_value(s, jl_typeof(ar));
const jl_datatype_layout_t *layout = ((jl_datatype_t*)jl_typetagof(ar->ref.mem))->layout;
size_t offset;
if (layout->flags.arrayelem_isunion || layout->size == 0)
offset = (uintptr_t)ar->ref.ptr_or_offset;
else
offset = ((char*)ar->ref.ptr_or_offset - (char*)ar->ref.mem->ptr) / layout->size;
jl_encode_memory_slice(s, ar->ref.mem, offset, l);
}
else if (as_literal && jl_is_genericmemory(v)) {
jl_genericmemory_t* m = (jl_genericmemory_t*)v;
write_uint8(s->s, TAG_MEMORYT);
jl_encode_value(s, (jl_datatype_t*)jl_typetagof(v));
jl_value_t *lbox = jl_box_long(m->length);
JL_GC_PUSH1(&lbox);
jl_encode_value(s, lbox);
JL_GC_POP();
jl_encode_memory_slice(s, m, 0, m->length);
}
else if (as_literal && jl_is_layout_opaque(((jl_datatype_t*)jl_typeof(v))->layout)) {
assert(0 && "not legal to store this as literal");
}
else if (as_literal || jl_is_uniontype(v) || jl_is_newvarnode(v) || jl_is_linenode(v) ||
jl_is_upsilonnode(v) || jl_is_pinode(v) || jl_is_slotnumber(v) || jl_is_ssavalue(v) ||
(jl_isbits(jl_typeof(v)) && jl_datatype_size(jl_typeof(v)) <= 64)) {
write_uint8(s->s, TAG_GENERAL);
jl_datatype_t *t = (jl_datatype_t*)jl_typeof(v);
jl_encode_value(s, t);
char *data = (char*)jl_data_ptr(v);
size_t i, j, np = t->layout->npointers;
uint32_t nf = t->layout->nfields;
char *last = data;
for (i = 0, j = 0; i < nf+1; i++) {
char *ptr = data + (i < nf ? jl_field_offset(t, i) : jl_datatype_size(t));
if (j < np) {
char *prevptr = (char*)&((jl_value_t**)data)[jl_ptr_offset(t, j)];
while (ptr > prevptr) {
// previous field contained pointers; write them and their interleaved data
if (prevptr > last)
ios_write(s->s, last, prevptr - last);
jl_value_t *e = *(jl_value_t**)prevptr;
JL_GC_PROMISE_ROOTED(e);
jl_encode_value(s, e);
last = prevptr + sizeof(jl_value_t*);
j++;
if (j < np)
prevptr = (char*)&((jl_value_t**)data)[jl_ptr_offset(t, j)];
else
break;
}
}
if (i == nf)
break;
}
char *ptr = data + jl_datatype_size(t);
if (ptr > last)
ios_write(s->s, last, ptr - last);
}
else {
jl_encode_as_indexed_root(s, v);
}
}
static jl_code_info_flags_t code_info_flags(uint8_t propagate_inbounds, uint8_t has_fcall,
uint8_t nospecializeinfer, uint8_t isva,
uint8_t inlining, uint8_t constprop, uint8_t nargsmatchesmethod,
jl_array_t *ssaflags)
{
jl_code_info_flags_t flags;
flags.bits.propagate_inbounds = propagate_inbounds;
flags.bits.has_fcall = has_fcall;
flags.bits.nospecializeinfer = nospecializeinfer;
flags.bits.isva = isva;
flags.bits.inlining = inlining;
flags.bits.constprop = constprop;
flags.bits.nargsmatchesmethod = nargsmatchesmethod;
flags.bits.has_ssaflags = 0;
const uint32_t *ssaflag_data = jl_array_data(ssaflags, uint32_t);
for (size_t i = 0, l = jl_array_dim0(ssaflags); i < l; i++)
if (ssaflag_data[i])
flags.bits.has_ssaflags = 1;
return flags;
}
// --- decoding ---
static jl_value_t *jl_decode_value(jl_ircode_state *s);
static jl_value_t *jl_decode_value_svec(jl_ircode_state *s, uint8_t tag)
{
size_t i, len;
if (tag == TAG_SVEC)
len = read_uint8(s->s);
else
len = read_int32(s->s);
jl_svec_t *sv = jl_alloc_svec(len);
JL_GC_PUSH1(&sv);
for (i = 0; i < len; i++)
jl_svecset(sv, i, jl_decode_value(s));
JL_GC_POP();
return (jl_value_t*)sv;
}
static jl_genericmemory_t *jl_decode_value_memory(jl_ircode_state *s, jl_value_t *mty, size_t nel)
{
jl_genericmemory_t *m = jl_alloc_genericmemory(mty, nel);
JL_GC_PUSH1(&m);
const jl_datatype_layout_t *layout = ((jl_datatype_t*)mty)->layout;
if (layout->flags.arrayelem_isboxed) {
jl_value_t **data = (jl_value_t**)m->ptr;
size_t i, numel = m->length;
for (i = 0; i < numel; i++) {
data[i] = jl_decode_value(s);
jl_gc_wb(m, data[i]);
}
}
else if (layout->first_ptr >= 0) {
size_t i, numel = m->length;
char *data = (char*)m->ptr;
uint16_t elsz = layout->size;
size_t j, np = layout->npointers;
for (i = 0; i < numel; i++) {
char *start = data;
for (j = 0; j < np; j++) {
uint32_t ptr = jl_ptr_offset((jl_datatype_t*)mty, j);
jl_value_t **fld = &((jl_value_t**)data)[ptr];
if ((char*)fld != start)
ios_readall(s->s, start, (const char*)fld - start);
*fld = jl_decode_value(s);
jl_gc_wb(m, fld);
start = (char*)&fld[1];
}
data += elsz;
if (data != start)
ios_readall(s->s, start, data - start);
}
}
else {
size_t extra = jl_genericmemory_isbitsunion(m) ? m->length : 0;
size_t tot = m->length * layout->size + extra;
ios_readall(s->s, (char*)m->ptr, tot);
}
JL_GC_POP();
return m;
}
JL_DLLEXPORT jl_array_t *jl_alloc_array_nd(jl_value_t *atype, size_t *dims, size_t ndims);
static jl_value_t *jl_decode_value_array1d(jl_ircode_state *s, uint8_t tag)
{
int16_t ndims = 1;
size_t dim0 = jl_unbox_long(jl_decode_value(s));
size_t len = dim0;
jl_value_t *aty = jl_decode_value(s);
JL_GC_PROMISE_ROOTED(aty); // (JL_ALWAYS_LEAFTYPE)
jl_genericmemory_t *mem = jl_decode_value_memory(s, jl_field_type_concrete((jl_datatype_t*)jl_field_type_concrete((jl_datatype_t*)aty, 0), 1), len);
JL_GC_PUSH1(&mem);
int tsz = sizeof(jl_array_t) + ndims*sizeof(size_t);
jl_array_t *a = (jl_array_t*)jl_gc_alloc(s->ptls, tsz, aty);
a->ref.mem = mem;
const jl_datatype_layout_t *layout = ((jl_datatype_t*)jl_typetagof(a->ref.mem))->layout;
if (layout->flags.arrayelem_isunion || layout->size == 0)
a->ref.ptr_or_offset = (void*)0;
else
a->ref.ptr_or_offset = a->ref.mem->ptr;
a->dimsize[0] = dim0;
JL_GC_POP();
return (jl_value_t*)a;
}
static jl_value_t *jl_decode_value_expr(jl_ircode_state *s, uint8_t tag)
{
size_t i, len;
jl_sym_t *head = NULL;
if (tag == TAG_EXPR) {
len = read_uint8(s->s);
}
else if (tag == TAG_CALL1) {
len = 2;
head = jl_call_sym;
}
else if (tag == TAG_CALL2) {
len = 3;
head = jl_call_sym;
}
else {
len = read_int32(s->s);
}
if (head == NULL)
head = (jl_sym_t*)jl_decode_value(s);
jl_expr_t *e = jl_exprn(head, len);
JL_GC_PUSH1(&e);
jl_value_t **data = jl_array_ptr_data(e->args);
jl_value_t *owner = jl_array_owner(e->args);
for (i = 0; i < len; i++) {
data[i] = jl_decode_value(s);
jl_gc_wb(owner, data[i]);
}
JL_GC_POP();
return (jl_value_t*)e;
}
static jl_value_t *jl_decode_value_phi(jl_ircode_state *s, uint8_t tag)
{
size_t i, len_e, len_v;
if (tag == TAG_PHINODE) {
len_e = len_v = read_uint8(s->s);
}
else {
len_e = read_int32(s->s);
len_v = read_int32(s->s);
}
jl_array_t *e = NULL;
jl_array_t *v = NULL;
jl_value_t *phi = NULL;
JL_GC_PUSH3(&e, &v, &phi);
e = jl_alloc_array_1d(jl_array_int32_type, len_e);
v = jl_alloc_vec_any(len_v);
phi = jl_new_struct(jl_phinode_type, e, v);
int32_t *data_e = jl_array_data(e, int32_t);
for (i = 0; i < len_e; i++) {
data_e[i] = jl_unbox_int32(jl_decode_value(s));
}
jl_value_t **data_v = jl_array_ptr_data(v);
for (i = 0; i < len_v; i++) {
data_v[i] = jl_decode_value(s);
jl_gc_wb(jl_array_owner(v), data_v[i]);
}
JL_GC_POP();
return phi;
}
static jl_value_t *jl_decode_value_phic(jl_ircode_state *s, uint8_t tag)
{
size_t i, len;
if (tag == TAG_PHICNODE)
len = read_uint8(s->s);
else
len = read_int32(s->s);
jl_array_t *v = jl_alloc_vec_any(len);
jl_value_t *phic = (jl_value_t*)v;
JL_GC_PUSH1(&phic);
phic = jl_new_struct(jl_phicnode_type, v);
jl_value_t **data = jl_array_ptr_data(v);
for (i = 0; i < len; i++) {
data[i] = jl_decode_value(s);
jl_gc_wb(jl_array_owner(v), data[i]);
}
JL_GC_POP();
return phic;
}
static jl_value_t *jl_decode_value_globalref(jl_ircode_state *s)
{
jl_module_t *mod = (jl_module_t*)jl_decode_value(s);
JL_GC_PROMISE_ROOTED(mod);
jl_sym_t *var = (jl_sym_t*)jl_decode_value(s);
JL_GC_PROMISE_ROOTED(var);
return jl_module_globalref(mod, var);
}
static jl_value_t *jl_decode_value_any(jl_ircode_state *s)
{
jl_datatype_t *dt = (jl_datatype_t*)jl_decode_value(s);
JL_GC_PROMISE_ROOTED(dt); // (JL_ALWAYS_LEAFTYPE)
// jl_new_struct_uninit
size_t sz = jl_datatype_size(dt);
jl_value_t *v = jl_gc_alloc(s->ptls, sz, dt);
if (dt->smalltag) // TODO: do we need this?
jl_set_typetagof(v, dt->smalltag, 0);
char *data = (char*)jl_data_ptr(v);
size_t i, np = dt->layout->npointers;
char *start = data;
if (np) {
if (sz > 0)
memset(v, 0, sz);
JL_GC_PUSH1(&v);
for (i = 0; i < np; i++) {
uint32_t ptr = jl_ptr_offset(dt, i);
jl_value_t **fld = &((jl_value_t**)data)[ptr];
if ((char*)fld != start)
ios_readall(s->s, start, (const char*)fld - start);
*fld = jl_decode_value(s);
jl_gc_wb(v, *fld);
start = (char*)&fld[1];
}
JL_GC_POP();
}
data += jl_datatype_size(dt);
if (data != start)
ios_readall(s->s, start, data - start);
return v;
}
static jl_value_t *jl_decode_value(jl_ircode_state *s)
{
assert(!ios_eof(s->s));
jl_value_t *v;
size_t n;
uint64_t key;
uint8_t tag = read_uint8(s->s);
if (tag > LAST_TAG)
return jl_deser_tag(tag);
switch (tag) {
case TAG_NULL: return NULL;
case 0:
tag = read_uint8(s->s);
return jl_deser_tag(tag);
case TAG_RELOC_METHODROOT:
key = read_uint64(s->s);
tag = read_uint8(s->s);
assert(tag == TAG_METHODROOT || tag == TAG_LONG_METHODROOT);
int index = -1;
if (tag == TAG_METHODROOT)
index = read_uint8(s->s);
else if (tag == TAG_LONG_METHODROOT)
index = read_uint32(s->s);
assert(index >= 0);
return lookup_root(s->method, key, index);
case TAG_METHODROOT:
return lookup_root(s->method, 0, read_uint8(s->s));
case TAG_LONG_METHODROOT:
return lookup_root(s->method, 0, read_uint32(s->s));
case TAG_EDGE:
return jl_svecref(s->edges, read_uint8(s->s));
case TAG_LONG_EDGE:
return jl_svecref(s->edges, read_uint32(s->s));
case TAG_SVEC: JL_FALLTHROUGH; case TAG_LONG_SVEC:
return jl_decode_value_svec(s, tag);
case TAG_COMMONSYM:
return jl_deser_symbol(read_uint8(s->s));
case TAG_SSAVALUE:
v = jl_box_ssavalue(read_uint8(s->s));
return v;
case TAG_NEARBYSSAVALUE:
v = jl_box_ssavalue(s->ssaid - read_uint8(s->s));
return v;
case TAG_LONG_SSAVALUE:
v = jl_box_ssavalue(read_uint16(s->s));
return v;
case TAG_SLOTNUMBER:
v = jl_box_slotnumber(read_uint16(s->s));
return v;
case TAG_ARRAY1D:
return jl_decode_value_array1d(s, tag);
case TAG_MEMORYT:
v = jl_decode_value(s);
JL_GC_PROMISE_ROOTED(v); // (JL_ALWAYS_LEAFTYPE)
return (jl_value_t*)jl_decode_value_memory(s, v, jl_unbox_long(jl_decode_value(s)));
case TAG_EXPR: JL_FALLTHROUGH;
case TAG_LONG_EXPR: JL_FALLTHROUGH;
case TAG_CALL1: JL_FALLTHROUGH;
case TAG_CALL2:
return jl_decode_value_expr(s, tag);
case TAG_PHINODE: JL_FALLTHROUGH; case TAG_LONG_PHINODE:
return jl_decode_value_phi(s, tag);
case TAG_PHICNODE: JL_FALLTHROUGH; case TAG_LONG_PHICNODE:
return jl_decode_value_phic(s, tag);
case TAG_GOTONODE: JL_FALLTHROUGH; case TAG_QUOTENODE:
{
v = jl_new_struct_uninit(tag == TAG_GOTONODE ? jl_gotonode_type : jl_quotenode_type);
JL_GC_PUSH1(&v);
set_nth_field(tag == TAG_GOTONODE ? jl_gotonode_type : jl_quotenode_type, v, 0, jl_decode_value(s), 0);
JL_GC_POP();
return v;
}
case TAG_GOTOIFNOT:
{
v = jl_new_struct_uninit(jl_gotoifnot_type);
JL_GC_PUSH1(&v);
set_nth_field(jl_gotoifnot_type, v, 0, jl_decode_value(s), 0);
set_nth_field(jl_gotoifnot_type, v, 1, jl_decode_value(s), 0);
JL_GC_POP();
return v;
}
case TAG_ENTERNODE:
{
v = jl_new_struct_uninit(jl_enternode_type);
JL_GC_PUSH1(&v);
set_nth_field(jl_enternode_type, v, 0, jl_decode_value(s), 0);
set_nth_field(jl_enternode_type, v, 1, jl_decode_value(s), 0);
JL_GC_POP();
return v;
}
case TAG_ARGUMENT:
{
v = jl_new_struct_uninit(jl_argument_type);
JL_GC_PUSH1(&v);
set_nth_field(jl_argument_type, v, 0, jl_decode_value(s), 0);
JL_GC_POP();
return v;
}
case TAG_RETURNNODE:
{
v = jl_new_struct_uninit(jl_returnnode_type);
JL_GC_PUSH1(&v);
set_nth_field(jl_returnnode_type, v, 0, jl_decode_value(s), 0);
JL_GC_POP();
return v;
}
case TAG_SHORTER_INT64:
v = jl_box_int64((int16_t)read_uint16(s->s));
return v;
case TAG_SHORT_INT64:
v = jl_box_int64(read_int32(s->s));
return v;
case TAG_INT64:
v = jl_box_int64((int64_t)read_uint64(s->s));
return v;
case TAG_SHORT_INT32:
v = jl_box_int32((int16_t)read_uint16(s->s));
return v;
case TAG_INT32:
v = jl_box_int32(read_int32(s->s));
return v;
case TAG_UINT8:
return jl_box_uint8(read_uint8(s->s));
case TAG_NEARBYGLOBAL:
{
jl_method_t *m = s->method;
assert(m != NULL);
JL_GC_PROMISE_ROOTED(m);
v = jl_decode_value(s);
JL_GC_PROMISE_ROOTED(v); // symbol
return jl_module_globalref(m->module, (jl_sym_t*)v);
}
case TAG_NEARBYMODULE:
assert(s->method != NULL);
return (jl_value_t*)s->method->module;
case TAG_GLOBALREF:
return jl_decode_value_globalref(s);
case TAG_SINGLETON:
return ((jl_datatype_t*)jl_decode_value(s))->instance;
case TAG_CORE:
return (jl_value_t*)jl_core_module;
case TAG_BASE:
return (jl_value_t*)jl_base_module;
case TAG_VECTORTY:
{
v = jl_decode_value(s);
JL_GC_PUSH1(&v);
v = jl_apply_type2((jl_value_t*)jl_array_type, v, jl_box_long(1));
JL_GC_POP();
return v;
}
case TAG_PTRTY:
{
v = jl_decode_value(s);
JL_GC_PUSH1(&v);
v = jl_apply_type1((jl_value_t*)jl_pointer_type, v);
JL_GC_POP();
return v;
}
case TAG_STRING:
n = read_int32(s->s);
v = jl_alloc_string(n);
ios_readall(s->s, jl_string_data(v), n);
return v;
default:
assert(tag == TAG_GENERAL);
return jl_decode_value_any(s);
}
}
// --- entry points ---
typedef jl_value_t jl_string_t; // for local expressibility
static size_t codelocs_parseheader(jl_string_t *cl, int *line_offset, int *line_bytes, int *to_bytes) JL_NOTSAFEPOINT
{
if (jl_string_len(cl) == 0) {
*line_offset = *line_bytes = *to_bytes = 0;
return 0;
}
int32_t header[3];
memcpy(&header, (char*)jl_string_data(cl), sizeof(header));
*line_offset = header[0];
if (header[1] < 255)
*line_bytes = 1;
else if (header[1] < 65535)
*line_bytes = 2;
else
*line_bytes = 4;
if (header[2] == 0)
*to_bytes = 0;
else if (header[2] < 255)
*to_bytes = 1;
else if (header[2] < 65535)
*to_bytes = 2;
else
*to_bytes = 4;
assert(jl_string_len(cl) >= sizeof(header) + *line_bytes);
return (jl_string_len(cl) - sizeof(header) - *line_bytes) / (*line_bytes + *to_bytes * 2); // compute nstmts
}
#ifndef NDEBUG
static int codelocs_nstmts(jl_string_t *cl) JL_NOTSAFEPOINT
{
int line_offset, line_bytes, to_bytes;
return codelocs_parseheader(cl, &line_offset, &line_bytes, &to_bytes);
}
#endif
#define IR_DATASIZE_FLAGS sizeof(uint16_t)
#define IR_DATASIZE_PURITY sizeof(uint16_t)
#define IR_DATASIZE_INLINING_COST sizeof(uint16_t)
#define IR_DATASIZE_NSLOTS sizeof(int32_t)
typedef enum {
ir_offset_flags = 0,
ir_offset_purity = 0 + IR_DATASIZE_FLAGS,
ir_offset_inlining_cost = 0 + IR_DATASIZE_FLAGS + IR_DATASIZE_PURITY,
ir_offset_nslots = 0 + IR_DATASIZE_FLAGS + IR_DATASIZE_PURITY + IR_DATASIZE_INLINING_COST,
ir_offset_slotflags = 0 + IR_DATASIZE_FLAGS + IR_DATASIZE_PURITY + IR_DATASIZE_INLINING_COST + IR_DATASIZE_NSLOTS
} ir_offset;