Repository navigation
Expand file tree
/
Copy pathtilde_stmt.cpp
More file actions
2889 lines (2431 loc) · 79.9 KB
/
Copy pathtilde_stmt.cpp
File metadata and controls
2889 lines (2431 loc) · 79.9 KB
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
gb_internal bool cg_emit_goto(cgProcedure *p, TB_Node *control_region) {
if (tb_inst_get_control(p->func)) {
tb_inst_goto(p->func, control_region);
return true;
}
return false;
}
gb_internal TB_Node *cg_control_region(cgProcedure *p, char const *name) {
TEMPORARY_ALLOCATOR_GUARD();
isize n = gb_strlen(name);
char *new_name = gb_alloc_array(temporary_allocator(), char, n+12);
n = -1 + gb_snprintf(new_name, n+11, "%.*s_%u", cast(int)n, name, p->control_regions.count);
TB_Node *region = tb_inst_region(p->func);
tb_inst_set_region_name(p->func, region, n, new_name);
GB_ASSERT(p->scope_index >= 0);
array_add(&p->control_regions, cgControlRegion{region, p->scope_index});
return region;
}
gb_internal cgValue cg_emit_load(cgProcedure *p, cgValue const &ptr, bool is_volatile) {
GB_ASSERT_MSG(is_type_pointer(ptr.type), "%s", type_to_string(ptr.type));
Type *type = type_deref(ptr.type);
TB_DataType dt = cg_data_type(type);
if (TB_IS_VOID_TYPE(dt)) {
switch (ptr.kind) {
case cgValue_Value:
return cg_lvalue_addr(ptr.node, type);
case cgValue_Addr:
GB_PANIC("NOT POSSIBLE - Cannot load an lvalue to begin with");
break;
case cgValue_Multi:
GB_PANIC("NOT POSSIBLE - Cannot load multiple values at once");
break;
case cgValue_Symbol:
return cg_lvalue_addr(tb_inst_get_symbol_address(p->func, ptr.symbol), type);
}
}
GB_ASSERT(dt.type != TB_MEMORY);
GB_ASSERT(dt.type != TB_TUPLE);
// use the natural alignment
// if people need a special alignment, they can use `intrinsics.unaligned_load`
TB_CharUnits alignment = cast(TB_CharUnits)type_align_of(type);
TB_Node *the_ptr = nullptr;
switch (ptr.kind) {
case cgValue_Value:
the_ptr = ptr.node;
break;
case cgValue_Addr:
the_ptr = tb_inst_load(p->func, TB_TYPE_PTR, ptr.node, alignment, is_volatile);
break;
case cgValue_Multi:
GB_PANIC("NOT POSSIBLE - Cannot load multiple values at once");
break;
case cgValue_Symbol:
the_ptr = tb_inst_get_symbol_address(p->func, ptr.symbol);
break;
}
return cg_value(tb_inst_load(p->func, dt, the_ptr, alignment, is_volatile), type);
}
gb_internal void cg_emit_store(cgProcedure *p, cgValue dst, cgValue src, bool is_volatile) {
GB_ASSERT_MSG(dst.kind != cgValue_Multi, "cannot store to multiple values at once");
if (dst.kind == cgValue_Addr) {
dst = cg_emit_load(p, dst, is_volatile);
} else if (dst.kind == cgValue_Symbol) {
dst = cg_value(tb_inst_get_symbol_address(p->func, dst.symbol), dst.type);
}
GB_ASSERT(is_type_pointer(dst.type));
Type *dst_type = type_deref(dst.type);
GB_ASSERT_MSG(are_types_identical(core_type(dst_type), core_type(src.type)), "%s vs %s", type_to_string(dst_type), type_to_string(src.type));
TB_DataType dt = cg_data_type(dst_type);
TB_DataType st = cg_data_type(src.type);
GB_ASSERT(dt.raw == st.raw);
// use the natural alignment
// if people need a special alignment, they can use `intrinsics.unaligned_store`
TB_CharUnits alignment = cast(TB_CharUnits)type_align_of(dst_type);
if (TB_IS_VOID_TYPE(dt)) {
TB_Node *dst_ptr = nullptr;
TB_Node *src_ptr = nullptr;
switch (dst.kind) {
case cgValue_Value:
dst_ptr = dst.node;
break;
case cgValue_Addr:
GB_PANIC("DST cgValue_Addr should be handled above");
break;
case cgValue_Symbol:
dst_ptr = tb_inst_get_symbol_address(p->func, dst.symbol);
break;
}
switch (src.kind) {
case cgValue_Value:
GB_PANIC("SRC cgValue_Value should be handled above");
break;
case cgValue_Symbol:
GB_PANIC("SRC cgValue_Symbol should be handled above");
break;
case cgValue_Addr:
src_ptr = src.node;
break;
}
// IMPORTANT TODO(bill): needs to be memmove
i64 sz = type_size_of(dst_type);
TB_Node *count = tb_inst_uint(p->func, TB_TYPE_INT, cast(u64)sz);
tb_inst_memcpy(p->func, dst_ptr, src_ptr, count, alignment/*, is_volatile*/);
return;
}
switch (dst.kind) {
case cgValue_Value:
switch (src.kind) {
case cgValue_Value:
if (src.node->dt.type == TB_INT && src.node->dt.data == 1) {
src.node = tb_inst_zxt(p->func, src.node, dt);
}
tb_inst_store(p->func, dt, dst.node, src.node, alignment, is_volatile);
return;
case cgValue_Addr:
tb_inst_store(p->func, dt, dst.node,
tb_inst_load(p->func, st, src.node, alignment, is_volatile),
alignment, is_volatile);
return;
case cgValue_Symbol:
tb_inst_store(p->func, dt, dst.node,
tb_inst_get_symbol_address(p->func, src.symbol),
alignment, is_volatile);
return;
}
case cgValue_Addr:
GB_PANIC("cgValue_Addr should be handled above");
break;
case cgValue_Symbol:
GB_PANIC(" cgValue_Symbol should be handled above");
break;
}
}
gb_internal cgValue cg_address_from_load(cgProcedure *p, cgValue value) {
switch (value.kind) {
case cgValue_Value:
{
TB_Node *load_inst = value.node;
GB_ASSERT_MSG(load_inst->type == TB_LOAD, "expected a load instruction");
TB_Node *ptr = load_inst->inputs[2];
return cg_value(ptr, alloc_type_pointer(value.type));
}
case cgValue_Addr:
return cg_value(value.node, alloc_type_pointer(value.type));
case cgValue_Symbol:
GB_PANIC("Symbol is an invalid use case for cg_address_from_load");
return {};
case cgValue_Multi:
GB_PANIC("Multi is an invalid use case for cg_address_from_load");
break;
}
GB_PANIC("Invalid cgValue for cg_address_from_load");
return {};
}
gb_internal bool cg_addr_is_empty(cgAddr const &addr) {
switch (addr.kind) {
case cgValue_Value:
case cgValue_Addr:
return addr.addr.node == nullptr;
case cgValue_Symbol:
return addr.addr.symbol == nullptr;
case cgValue_Multi:
return addr.addr.multi == nullptr;
}
return true;
}
gb_internal Type *cg_addr_type(cgAddr const &addr) {
if (cg_addr_is_empty(addr)) {
return nullptr;
}
switch (addr.kind) {
case cgAddr_Map:
{
Type *t = base_type(addr.map.type);
GB_ASSERT(is_type_map(t));
return t->Map.value;
}
case cgAddr_Swizzle:
return addr.swizzle.type;
case cgAddr_SwizzleLarge:
return addr.swizzle_large.type;
case cgAddr_Context:
if (addr.ctx.sel.index.count > 0) {
Type *t = t_context;
for_array(i, addr.ctx.sel.index) {
GB_ASSERT(is_type_struct(t));
t = base_type(t)->Struct.fields[addr.ctx.sel.index[i]]->type;
}
return t;
}
break;
}
return type_deref(addr.addr.type);
}
gb_internal cgValue cg_addr_load(cgProcedure *p, cgAddr addr) {
if (addr.addr.node == nullptr) {
return {};
}
switch (addr.kind) {
case cgAddr_Default:
return cg_emit_load(p, addr.addr);
case cgAddr_Map:
{
Type *map_type = base_type(type_deref(addr.addr.type));
GB_ASSERT(map_type->kind == Type_Map);
cgAddr v_addr = cg_add_local(p, map_type->Map.value, nullptr, true);
cgValue ptr = cg_internal_dynamic_map_get_ptr(p, addr.addr, addr.map.key);
cgValue ok = cg_emit_conv(p, cg_emit_comp_against_nil(p, Token_NotEq, ptr), t_bool);
TB_Node *then = cg_control_region(p, "map.get.then");
TB_Node *done = cg_control_region(p, "map.get.done");
cg_emit_if(p, ok, then, done);
tb_inst_set_control(p->func, then);
{
cgValue value = cg_emit_conv(p, ptr, alloc_type_pointer(map_type->Map.value));
value = cg_emit_load(p, value);
cg_addr_store(p, v_addr, value);
}
cg_emit_goto(p, done);
tb_inst_set_control(p->func, done);
cgValue v = cg_addr_load(p, v_addr);
if (is_type_tuple(addr.map.result)) {
return cg_value_multi2(v, ok, addr.map.result);
} else {
return v;
}
}
case cgAddr_SoaVariable:
{
Type *t = type_deref(addr.addr.type);
t = base_type(t);
GB_ASSERT(t->kind == Type_Struct && t->Struct.soa_kind != StructSoa_None);
Type *elem = t->Struct.soa_elem;
cgValue len = {};
if (t->Struct.soa_kind == StructSoa_Fixed) {
len = cg_const_int(p, t_int, t->Struct.soa_count);
} else {
cgValue v = cg_emit_load(p, addr.addr);
len = cg_builtin_len(p, v);
}
cgAddr res = cg_add_local(p, elem, nullptr, true);
// if (addr.soa.index_expr != nullptr && (!cg_is_const(addr.soa.index) || t->Struct.soa_kind != StructSoa_Fixed)) {
// cg_emit_bounds_check(p, ast_token(addr.soa.index_expr), addr.soa.index, len);
// }
if (t->Struct.soa_kind == StructSoa_Fixed) {
for_array(i, t->Struct.fields) {
Entity *field = t->Struct.fields[i];
Type *base_type = field->type;
GB_ASSERT(base_type->kind == Type_Array);
cgValue dst = cg_emit_struct_ep(p, res.addr, cast(i32)i);
cgValue src_ptr = cg_emit_struct_ep(p, addr.addr, cast(i32)i);
src_ptr = cg_emit_array_ep(p, src_ptr, addr.soa.index);
cgValue src = cg_emit_load(p, src_ptr);
cg_emit_store(p, dst, src);
}
} else {
isize field_count = t->Struct.fields.count;
if (t->Struct.soa_kind == StructSoa_Slice) {
field_count -= 1;
} else if (t->Struct.soa_kind == StructSoa_Dynamic) {
field_count -= 3;
}
for (isize i = 0; i < field_count; i++) {
Entity *field = t->Struct.fields[i];
Type *base_type = field->type;
GB_ASSERT(base_type->kind == Type_Pointer);
cgValue dst = cg_emit_struct_ep(p, res.addr, cast(i32)i);
cgValue src_ptr = cg_emit_struct_ep(p, addr.addr, cast(i32)i);
cgValue src = cg_emit_load(p, src_ptr);
src = cg_emit_ptr_offset(p, src, addr.soa.index);
src = cg_emit_load(p, src);
cg_emit_store(p, dst, src);
}
}
return cg_addr_load(p, res);
}
}
GB_PANIC("TODO(bill): cg_addr_load %p", addr.addr.node);
return {};
}
gb_internal void cg_addr_store(cgProcedure *p, cgAddr addr, cgValue value) {
if (cg_addr_is_empty(addr)) {
return;
}
GB_ASSERT(value.type != nullptr);
if (is_type_untyped_uninit(value.type)) {
Type *t = cg_addr_type(addr);
value = cg_value(tb_inst_poison(p->func, cg_data_type(t)), t);
// TODO(bill): IS THIS EVEN A GOOD IDEA?
} else if (is_type_untyped_nil(value.type)) {
Type *t = cg_addr_type(addr);
value = cg_const_nil(p, t);
}
if (addr.kind == cgAddr_RelativePointer && addr.relative.deref) {
addr = cg_addr(cg_address_from_load(p, cg_addr_load(p, addr)));
}
if (addr.kind == cgAddr_RelativePointer) {
GB_PANIC("TODO(bill): cgAddr_RelativePointer");
} else if (addr.kind == cgAddr_RelativeSlice) {
GB_PANIC("TODO(bill): cgAddr_RelativeSlice");
} else if (addr.kind == cgAddr_Map) {
cg_internal_dynamic_map_set(p, addr.addr, addr.map.type, addr.map.key, value, p->curr_stmt);
return;
} else if (addr.kind == cgAddr_Context) {
cgAddr old_addr = cg_find_or_generate_context_ptr(p);
bool create_new = true;
for_array(i, p->context_stack) {
cgContextData *ctx_data = &p->context_stack[i];
if (ctx_data->ctx.addr.node == old_addr.addr.node) {
if (ctx_data->uses > 0) {
create_new = true;
} else if (p->scope_index > ctx_data->scope_index) {
create_new = true;
} else {
// gb_printf_err("%.*s (curr:%td) (ctx:%td) (uses:%td)\n", LIT(p->name), p->scope_index, ctx_data->scope_index, ctx_data->uses);
create_new = false;
}
break;
}
}
cgValue next = {};
if (create_new) {
cgValue old = cg_addr_load(p, old_addr);
cgAddr next_addr = cg_add_local(p, t_context, nullptr, true);
cg_addr_store(p, next_addr, old);
cg_push_context_onto_stack(p, next_addr);
next = next_addr.addr;
} else {
next = old_addr.addr;
}
if (addr.ctx.sel.index.count > 0) {
cgValue lhs = cg_emit_deep_field_gep(p, next, addr.ctx.sel);
cgValue rhs = cg_emit_conv(p, value, type_deref(lhs.type));
cg_emit_store(p, lhs, rhs);
} else {
cgValue lhs = next;
cgValue rhs = cg_emit_conv(p, value, cg_addr_type(addr));
cg_emit_store(p, lhs, rhs);
}
return;
} else if (addr.kind == cgAddr_SoaVariable) {
GB_PANIC("TODO(bill): cgAddr_SoaVariable");
} else if (addr.kind == cgAddr_Swizzle) {
GB_ASSERT(addr.swizzle.count <= 4);
GB_PANIC("TODO(bill): cgAddr_Swizzle");
} else if (addr.kind == cgAddr_SwizzleLarge) {
GB_PANIC("TODO(bill): cgAddr_SwizzleLarge");
}
value = cg_emit_conv(p, value, cg_addr_type(addr));
cg_emit_store(p, addr.addr, value);
}
gb_internal cgValue cg_addr_get_ptr(cgProcedure *p, cgAddr const &addr) {
if (cg_addr_is_empty(addr)) {
GB_PANIC("Illegal addr -> nullptr");
return {};
}
switch (addr.kind) {
case cgAddr_Map:
GB_PANIC("TODO(bill): cg_addr_get_ptr cgAddr_Map");
// return cg_internal_dynamic_map_get_ptr(p, addr.addr, addr.map.key);
break;
case cgAddr_RelativePointer: {
Type *rel_ptr = base_type(cg_addr_type(addr));
GB_ASSERT(rel_ptr->kind == Type_RelativePointer);
cgValue ptr = cg_emit_conv(p, addr.addr, t_uintptr);
cgValue offset = cg_emit_conv(p, ptr, alloc_type_pointer(rel_ptr->RelativePointer.base_integer));
offset = cg_emit_load(p, offset);
if (!is_type_unsigned(rel_ptr->RelativePointer.base_integer)) {
offset = cg_emit_conv(p, offset, t_i64);
}
offset = cg_emit_conv(p, offset, t_uintptr);
cgValue absolute_ptr = cg_emit_arith(p, Token_Add, ptr, offset, t_uintptr);
absolute_ptr = cg_emit_conv(p, absolute_ptr, rel_ptr->RelativePointer.pointer_type);
GB_PANIC("TODO(bill): cg_addr_get_ptr cgAddr_RelativePointer");
// cgValue cond = cg_emit_comp(p, Token_CmpEq, offset, cg_const_nil(p->module, rel_ptr->RelativePointer.base_integer));
// NOTE(bill): nil check
// cgValue nil_ptr = cg_const_nil(p->module, rel_ptr->RelativePointer.pointer_type);
// cgValue final_ptr = cg_emit_select(p, cond, nil_ptr, absolute_ptr);
// return final_ptr;
break;
}
case cgAddr_SoaVariable:
// TODO(bill): FIX THIS HACK
return cg_address_from_load(p, cg_addr_load(p, addr));
case cgAddr_Context:
GB_PANIC("cgAddr_Context should be handled elsewhere");
break;
case cgAddr_Swizzle:
case cgAddr_SwizzleLarge:
// TOOD(bill): is this good enough logic?
break;
}
return addr.addr;
}
gb_internal cgValue cg_emit_ptr_offset(cgProcedure *p, cgValue ptr, cgValue index) {
GB_ASSERT(ptr.kind == cgValue_Value);
GB_ASSERT(index.kind == cgValue_Value);
GB_ASSERT(is_type_pointer(ptr.type) || is_type_multi_pointer(ptr.type));
GB_ASSERT(is_type_integer(index.type));
Type *elem = type_deref(ptr.type, true);
i64 stride = type_size_of(elem);
return cg_value(tb_inst_array_access(p->func, ptr.node, index.node, stride), alloc_type_pointer(elem));
}
gb_internal cgValue cg_emit_array_ep(cgProcedure *p, cgValue s, cgValue index) {
GB_ASSERT(s.kind == cgValue_Value);
GB_ASSERT(index.kind == cgValue_Value);
Type *t = s.type;
GB_ASSERT_MSG(is_type_pointer(t), "%s", type_to_string(t));
Type *st = base_type(type_deref(t));
GB_ASSERT_MSG(is_type_array(st) || is_type_enumerated_array(st) || is_type_matrix(st), "%s", type_to_string(st));
GB_ASSERT_MSG(is_type_integer(core_type(index.type)), "%s", type_to_string(index.type));
Type *elem = base_array_type(st);
i64 stride = type_size_of(elem);
return cg_value(tb_inst_array_access(p->func, s.node, index.node, stride), alloc_type_pointer(elem));
}
gb_internal cgValue cg_emit_array_epi(cgProcedure *p, cgValue s, i64 index) {
return cg_emit_array_ep(p, s, cg_const_int(p, t_int, index));
}
gb_internal cgValue cg_emit_struct_ep(cgProcedure *p, cgValue s, i64 index) {
s = cg_flatten_value(p, s);
GB_ASSERT(is_type_pointer(s.type));
Type *t = base_type(type_deref(s.type));
Type *result_type = nullptr;
if (is_type_relative_pointer(t)) {
s = cg_addr_get_ptr(p, cg_addr(s));
}
i64 offset = -1;
i64 int_size = build_context.int_size;
i64 ptr_size = build_context.ptr_size;
switch (t->kind) {
case Type_Struct:
type_set_offsets(t);
result_type = t->Struct.fields[index]->type;
offset = t->Struct.offsets[index];
break;
case Type_Union:
GB_ASSERT(index == -1);
GB_PANIC("TODO(bill): cg_emit_union_tag_ptr");
break;
// return cg_emit_union_tag_ptr(p, s);
case Type_Tuple:
type_set_offsets(t);
result_type = t->Tuple.variables[index]->type;
offset = t->Tuple.offsets[index];
GB_PANIC("TODO(bill): cg_emit_tuple_ep %d", s.kind);
break;
// return cg_emit_tuple_ep(p, s, index);
case Type_Slice:
switch (index) {
case 0:
result_type = alloc_type_multi_pointer(t->Slice.elem);
offset = 0;
break;
case 1:
result_type = t_int;
offset = int_size;
break;
}
break;
case Type_Basic:
switch (t->Basic.kind) {
case Basic_string:
switch (index) {
case 0:
result_type = t_u8_multi_ptr;
offset = 0;
break;
case 1:
result_type = t_int;
offset = int_size;
break;
}
break;
case Basic_any:
switch (index) {
case 0:
result_type = t_rawptr;
offset = 0;
break;
case 1:
result_type = t_typeid;
offset = ptr_size;
break;
}
break;
case Basic_complex32:
case Basic_complex64:
case Basic_complex128:
{
Type *ft = base_complex_elem_type(t);
i64 sz = type_size_of(ft);
switch (index) {
case 0: case 1:
result_type = ft; offset = sz * index; break;
default: goto error_case;
}
break;
}
case Basic_quaternion64:
case Basic_quaternion128:
case Basic_quaternion256:
{
Type *ft = base_complex_elem_type(t);
i64 sz = type_size_of(ft);
switch (index) {
case 0: case 1: case 2: case 3:
result_type = ft; offset = sz * index; break;
default: goto error_case;
}
}
break;
default:
goto error_case;
}
break;
case Type_DynamicArray:
switch (index) {
case 0:
result_type = alloc_type_multi_pointer(t->DynamicArray.elem);
offset = index*int_size;
break;
case 1: case 2:
result_type = t_int;
offset = index*int_size;
break;
case 3:
result_type = t_allocator;
offset = index*int_size;
break;
default: goto error_case;
}
break;
case Type_Map:
{
init_map_internal_types(t);
Type *itp = alloc_type_pointer(t_raw_map);
s = cg_emit_transmute(p, s, itp);
Type *rms = base_type(t_raw_map);
GB_ASSERT(rms->kind == Type_Struct);
if (0 <= index && index < 3) {
result_type = rms->Struct.fields[index]->type;
offset = rms->Struct.offsets[index];
} else {
goto error_case;
}
break;
}
case Type_Array:
return cg_emit_array_epi(p, s, index);
case Type_SoaPointer:
switch (index) {
case 0:
result_type = alloc_type_pointer(t->SoaPointer.elem);
offset = 0;
break;
case 1:
result_type = t_int;
offset = int_size;
break;
}
break;
default:
error_case:;
GB_PANIC("TODO(bill): struct_gep type: %s, %lld", type_to_string(s.type), cast(long long)index);
break;
}
GB_ASSERT_MSG(result_type != nullptr, "%s %lld", type_to_string(t), cast(long long)index);
GB_ASSERT_MSG(offset >= 0, "%s %lld", type_to_string(t), cast(long long)offset);
GB_ASSERT(s.kind == cgValue_Value);
return cg_value(
tb_inst_member_access(p->func, s.node, offset),
alloc_type_pointer(result_type)
);
}
gb_internal cgValue cg_emit_struct_ev(cgProcedure *p, cgValue s, i64 index) {
s = cg_address_from_load_or_generate_local(p, s);
cgValue ptr = cg_emit_struct_ep(p, s, index);
return cg_flatten_value(p, cg_emit_load(p, ptr));
}
gb_internal cgValue cg_emit_deep_field_gep(cgProcedure *p, cgValue e, Selection const &sel) {
GB_ASSERT(sel.index.count > 0);
Type *type = type_deref(e.type);
for_array(i, sel.index) {
i64 index = sel.index[i];
if (is_type_pointer(type)) {
type = type_deref(type);
e = cg_emit_load(p, e);
}
type = core_type(type);
switch (type->kind) {
case Type_SoaPointer: {
cgValue addr = cg_emit_struct_ep(p, e, 0);
cgValue index = cg_emit_struct_ep(p, e, 1);
addr = cg_emit_load(p, addr);
index = cg_emit_load(p, index);
i64 first_index = sel.index[0];
Selection sub_sel = sel;
sub_sel.index.data += 1;
sub_sel.index.count -= 1;
cgValue arr = cg_emit_struct_ep(p, addr, first_index);
Type *t = base_type(type_deref(addr.type));
GB_ASSERT(is_type_soa_struct(t));
if (t->Struct.soa_kind == StructSoa_Fixed) {
e = cg_emit_array_ep(p, arr, index);
} else {
e = cg_emit_ptr_offset(p, cg_emit_load(p, arr), index);
}
break;
}
case Type_Basic:
switch (type->Basic.kind) {
case Basic_any:
if (index == 0) {
type = t_rawptr;
} else if (index == 1) {
type = t_type_info_ptr;
}
e = cg_emit_struct_ep(p, e, index);
break;
default:
e = cg_emit_struct_ep(p, e, index);
break;
}
break;
case Type_Struct:
if (type->Struct.is_raw_union) {
type = get_struct_field_type(type, index);
GB_ASSERT(is_type_pointer(e.type));
e = cg_emit_transmute(p, e, alloc_type_pointer(type));
} else {
type = get_struct_field_type(type, index);
e = cg_emit_struct_ep(p, e, index);
}
break;
case Type_Union:
GB_ASSERT(index == -1);
type = t_type_info_ptr;
e = cg_emit_struct_ep(p, e, index);
break;
case Type_Tuple:
type = type->Tuple.variables[index]->type;
e = cg_emit_struct_ep(p, e, index);
break;
case Type_Slice:
case Type_DynamicArray:
case Type_Map:
case Type_RelativePointer:
e = cg_emit_struct_ep(p, e, index);
break;
case Type_Array:
e = cg_emit_array_epi(p, e, index);
break;
default:
GB_PANIC("un-gep-able type %s", type_to_string(type));
break;
}
}
return e;
}
gb_internal cgBranchRegions cg_lookup_branch_regions(cgProcedure *p, Ast *ident) {
GB_ASSERT(ident->kind == Ast_Ident);
Entity *e = entity_of_node(ident);
GB_ASSERT(e->kind == Entity_Label);
for (cgBranchRegions const &b : p->branch_regions) {
if (b.label == e->Label.node) {
return b;
}
}
GB_PANIC("Unreachable");
cgBranchRegions empty = {};
return empty;
}
gb_internal cgTargetList *cg_push_target_list(cgProcedure *p, Ast *label, TB_Node *break_, TB_Node *continue_, TB_Node *fallthrough_) {
cgTargetList *tl = gb_alloc_item(permanent_allocator(), cgTargetList);
tl->prev = p->target_list;
tl->break_ = break_;
tl->continue_ = continue_;
tl->fallthrough_ = fallthrough_;
p->target_list = tl;
if (label != nullptr) { // Set label blocks
GB_ASSERT(label->kind == Ast_Label);
for (cgBranchRegions &b : p->branch_regions) {
GB_ASSERT(b.label != nullptr && label != nullptr);
GB_ASSERT(b.label->kind == Ast_Label);
if (b.label == label) {
b.break_ = break_;
b.continue_ = continue_;
return tl;
}
}
GB_PANIC("Unreachable");
}
return tl;
}
gb_internal void cg_pop_target_list(cgProcedure *p) {
p->target_list = p->target_list->prev;
}
gb_internal cgAddr cg_add_local(cgProcedure *p, Type *type, Entity *e, bool zero_init) {
GB_ASSERT(type != nullptr);
isize size = type_size_of(type);
TB_CharUnits alignment = cast(TB_CharUnits)type_align_of(type);
if (is_type_matrix(type)) {
alignment *= 2; // NOTE(bill): Just in case
}
TB_Node *local = tb_inst_local(p->func, cast(u32)size, alignment);
if (e != nullptr && e->token.string.len > 0 && e->token.string != "_") {
// NOTE(bill): for debugging purposes only
String name = e->token.string;
TB_DebugType *debug_type = cg_debug_type(p->module, type);
tb_function_attrib_variable(p->func, local, nullptr, name.len, cast(char const *)name.text, debug_type);
}
if (zero_init) {
bool is_volatile = false;
gb_unused(is_volatile);
TB_Node *zero = tb_inst_uint(p->func, TB_TYPE_I8, 0);
TB_Node *count = tb_inst_uint(p->func, TB_TYPE_I32, cast(u64)size);
tb_inst_memset(p->func, local, zero, count, alignment/*, is_volatile*/);
}
cgAddr addr = cg_addr(cg_value(local, alloc_type_pointer(type)));
if (e) {
map_set(&p->variable_map, e, addr);
}
return addr;
}
gb_internal cgAddr cg_add_global(cgProcedure *p, Type *type, Entity *e) {
GB_ASSERT(type != nullptr);
isize size = type_size_of(type);
TB_CharUnits alignment = cast(TB_CharUnits)type_align_of(type);
if (is_type_matrix(type)) {
alignment *= 2; // NOTE(bill): Just in case
}
TB_Global *global = tb_global_create(p->module->mod, 0, "", nullptr, TB_LINKAGE_PRIVATE);
tb_global_set_storage(p->module->mod, tb_module_get_data(p->module->mod), global, size, alignment, 0);
TB_Node *local = tb_inst_get_symbol_address(p->func, cast(TB_Symbol *)global);
if (e != nullptr && e->token.string.len > 0 && e->token.string != "_") {
// NOTE(bill): for debugging purposes only
String name = e->token.string;
TB_DebugType *debug_type = cg_debug_type(p->module, type);
tb_function_attrib_variable(p->func, local, nullptr, name.len, cast(char const *)name.text, debug_type);
}
cgAddr addr = cg_addr(cg_value(local, alloc_type_pointer(type)));
if (e) {
map_set(&p->variable_map, e, addr);
}
return addr;
}
gb_internal cgValue cg_copy_value_to_ptr(cgProcedure *p, cgValue value, Type *original_type, isize min_alignment) {
TB_CharUnits size = cast(TB_CharUnits)type_size_of(original_type);
TB_CharUnits align = cast(TB_CharUnits)gb_max(type_align_of(original_type), min_alignment);
TB_Node *copy = tb_inst_local(p->func, size, align);
if (value.kind == cgValue_Value) {
tb_inst_store(p->func, cg_data_type(original_type), copy, value.node, align, false);
} else {
GB_ASSERT(value.kind == cgValue_Addr);
tb_inst_memcpy(p->func, copy, value.node, tb_inst_uint(p->func, TB_TYPE_INT, size), align);
}
return cg_value(copy, alloc_type_pointer(original_type));
}
gb_internal cgValue cg_address_from_load_or_generate_local(cgProcedure *p, cgValue value) {
switch (value.kind) {
case cgValue_Value:
if (value.node->type == TB_LOAD) {
TB_Node *ptr = value.node->inputs[2];
return cg_value(ptr, alloc_type_pointer(value.type));
}
break;
case cgValue_Addr:
return cg_value(value.node, alloc_type_pointer(value.type));
case cgValue_Multi:
GB_PANIC("cgValue_Multi not allowed");
}
cgAddr res = cg_add_local(p, value.type, nullptr, false);
cg_addr_store(p, res, value);
return res.addr;
}
gb_internal void cg_build_defer_stmt(cgProcedure *p, cgDefer const &d) {
TB_Node *curr_region = tb_inst_get_control(p->func);
if (curr_region == nullptr) {
return;
}
// NOTE(bill): The prev block may defer injection before it's terminator
TB_Node *last_inst = nullptr;
// if (curr_region->input_count) {
// last_inst = *(curr_region->inputs + curr_region->input_count);
// }
// if (last_inst && TB_IS_NODE_TERMINATOR(last_inst->type)) {
// // NOTE(bill): ReturnStmt defer stuff will be handled previously
// return;
// }
isize prev_context_stack_count = p->context_stack.count;
GB_ASSERT(prev_context_stack_count <= p->context_stack.capacity);
defer (p->context_stack.count = prev_context_stack_count);
p->context_stack.count = d.context_stack_count;
TB_Node *b = cg_control_region(p, "defer");
if (last_inst == nullptr) {
cg_emit_goto(p, b);
}
tb_inst_set_control(p->func, b);
if (d.kind == cgDefer_Node) {
cg_build_stmt(p, d.stmt);
} else if (d.kind == cgDefer_Proc) {
cg_emit_call(p, d.proc.deferred, d.proc.result_as_args);
}
}
gb_internal void cg_emit_defer_stmts(cgProcedure *p, cgDeferExitKind kind, TB_Node *control_region) {
isize count = p->defer_stack.count;
isize i = count;
while (i --> 0) {
cgDefer const &d = p->defer_stack[i];
if (kind == cgDeferExit_Default) {
if (p->scope_index == d.scope_index &&
d.scope_index > 0) {
cg_build_defer_stmt(p, d);
array_pop(&p->defer_stack);
continue;
} else {
break;
}
} else if (kind == cgDeferExit_Return) {
cg_build_defer_stmt(p, d);
} else if (kind == cgDeferExit_Branch) {
GB_ASSERT(control_region != nullptr);
isize lower_limit = -1;
for (auto const &cr : p->control_regions) {
if (cr.control_region == control_region) {
lower_limit = cr.scope_index;
break;
}
}
GB_ASSERT(lower_limit >= 0);
if (lower_limit < d.scope_index) {
cg_build_defer_stmt(p, d);
}
}
}
}
gb_internal void cg_scope_open(cgProcedure *p, Scope *scope) {
// TODO(bill): debug scope information
p->scope_index += 1;
array_add(&p->scope_stack, scope);
}
gb_internal void cg_scope_close(cgProcedure *p, cgDeferExitKind kind, TB_Node *control_region) {
cg_emit_defer_stmts(p, kind, control_region);
GB_ASSERT(p->scope_index > 0);
while (p->context_stack.count > 0) {
auto *ctx = &p->context_stack[p->context_stack.count-1];
if (ctx->scope_index < p->scope_index) {
break;
}
array_pop(&p->context_stack);
}
p->scope_index -= 1;
array_pop(&p->scope_stack);
}
gb_internal isize cg_append_tuple_values(cgProcedure *p, Array<cgValue> *dst_values, cgValue src_value) {
isize init_count = dst_values->count;
Type *t = src_value.type;
if (t && t->kind == Type_Tuple) {
GB_ASSERT(src_value.kind == cgValue_Multi);
GB_ASSERT(src_value.multi != nullptr);
GB_ASSERT(src_value.multi->values.count == t->Tuple.variables.count);
for (cgValue const &value : src_value.multi->values) {
array_add(dst_values, value);
}
} else {
array_add(dst_values, src_value);
}
return dst_values->count - init_count;
}
gb_internal void cg_build_assignment(cgProcedure *p, Array<cgAddr> const &lvals, Slice<Ast *> const &values) {