-
-
Notifications
You must be signed in to change notification settings - Fork 40
/
ir.zig
1106 lines (932 loc) · 27.3 KB
/
ir.zig
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
const std = @import("std");
const cy = @import("cyber.zig");
const TypeId = cy.TypeId;
const CompactType = cy.types.CompactType;
const sema = cy.sema;
const log = cy.log.scoped(.ir);
const ast = cy.ast;
/// An IR is useful because the AST isn't suited to represent the result of sema.
/// The IR is generated during the sema pass and thrown away after it is consumed by codegen.
/// A couple of reasons for an IR:
/// 1. Since there is static symbol resolution, some statements and expressions become irrelevant.
/// 2. Type inference, an operation's invocation may be patched:
/// Bin-exprs could be inlined rather than invoking an operator function.
/// 3. Lifted vars/param copies can be patched as sema discovers them.
/// 4. Additional IR can be added that have no source attribution such as
/// static variable initializers and zero values.
/// 5. Makes bc codegen simpler, creating additional backends should also be simpler.
///
/// The IR is a tree structure but all the nodes are packed into a linear array.
/// IR nodes are indexed by their position in the array.
/// Stmt and expr nodes contain metadata which starts with their node type followed by a pointer to their AST node.
/// Stmt nodes additionally have a next index that points to the next stmt node.
/// Expr nodes additionally have a type id that also contains a throws bit.
/// Data specific to a node's type follows the metadata.
pub const StmtCode = enum(u8) {
/// Main block. Only one chunk has IR for the main block.
mainBlock,
/// A [numParams]u8 array follows.
/// Each elem is a boolean indicating whether the respective param
/// will be written to at some point in the function.
funcBlock,
declareLocal,
declareLocalInit,
block,
exprStmt,
ifStmt,
switchStmt,
tryStmt,
loopStmt,
forRangeStmt,
retStmt,
retExprStmt,
breakStmt,
contStmt,
/// precedes a set* stmt.
opSet,
set,
setLocal,
setCaptured,
set_field_dyn,
set_field,
setIndex,
set_var_sym,
set_deref,
/// Like `set_var_sym` but allows referencing IR from a different chunk.
init_var_sym,
pushDebugLabel,
dumpBytecode,
verbose,
};
pub const ExprCode = enum(u8) {
cast,
coinitCall,
coyield,
coresume,
await_expr,
local,
object_init,
fieldDyn,
field,
array,
list,
map,
voidv,
truev,
falsev,
errorv,
symbol,
tag_lit,
float,
int,
byte,
none,
unOpEnd,
func_ptr,
func_union,
varSym,
context,
type,
enumMemberSym,
string,
stringTemplate,
lambda,
closure,
if_expr,
captured,
throw,
switchExpr,
switchCase,
/// Placeholder that is patched later to be `preCall`, `preBinOp`, `preUnOp`, etc.
pre,
preBinOp,
preUnOp,
call_dyn,
call_obj_sym,
call_sym,
call_sym_dyn,
call_trait,
andOp,
orOp,
tryExpr,
type_check,
typeCheckOption,
blockExpr,
mainEnd,
else_block,
unwrapChoice,
unwrap_or,
box,
unbox,
trait,
address_of,
deref,
};
pub const ExprType = packed struct {
id: u31,
throws: bool,
pub fn init(id: cy.TypeId) ExprType {
return .{ .id = @truncate(id), .throws = false };
}
pub fn initThrows(id: cy.TypeId) ExprType {
return .{ .id = @truncate(id), .throws = true };
}
};
pub const Await = struct {
expr: Loc,
};
pub const AddressOf = struct {
expr: Loc,
};
pub const Deref = struct {
expr: Loc,
};
pub const Trait = struct {
expr: Loc,
expr_t: cy.TypeId,
trait_t: cy.TypeId,
};
pub const Box = struct {
expr: Loc,
};
pub const Unbox = struct {
expr: Loc,
};
pub const TypeCheck = struct {
expr: Loc,
exp_type: cy.TypeId,
};
pub const TypeCheckOption = struct {
expr: Loc,
};
pub const UnwrapChoice = struct {
choice: Loc,
tag: u8,
fieldIdx: u8,
};
pub const UnwrapOr = struct {
opt: Loc,
default: Loc,
};
pub const Coresume = struct {
expr: Loc,
};
pub const Block = struct {
bodyHead: Loc,
};
pub const BlockExpr = struct {
bodyHead: Loc,
};
pub const Switch = struct {
expr: Loc,
numCases: u8,
is_expr: bool,
};
const Loc = u32;
pub const SwitchCase = struct {
// else case if `numConds` == 0.
numConds: u8,
bodyIsExpr: bool,
bodyHead: Loc,
};
pub const LoopStmt = struct {
body_head: Loc,
};
pub const PushDebugLabel = struct {
name: []const u8,
};
pub const Captured = struct {
idx: u8,
};
pub const IfExpr = struct {
cond: Loc,
body: u32,
elseBody: u32,
};
pub const ThrowExpr = struct {
expr: Loc,
};
pub const TryExpr = struct {
expr: Loc,
catchBody: u32,
};
pub const TagLit = struct {
name: []const u8,
};
pub const Symbol = struct {
name: []const u8,
};
pub const Error = struct {
name: []const u8,
};
pub const Cast = struct {
expr: Loc,
typeId: TypeId,
isRtCast: bool,
};
pub const FieldDyn = struct {
name: []const u8,
rec: Loc,
};
pub const SetFieldDyn = struct {
name: []const u8,
rec: Loc,
right: Loc,
};
/// Can have a chain of nested struct field indexes.
/// The array of nested indexes are located after this struct.
pub const Field = struct {
/// Receiver.
rec: Loc,
/// Parent type is recorded since a field can be applied to a type or a pointer.
parent_t: cy.TypeId,
/// Field index of receiver.
idx: u8,
/// Whether there is a followup member access.
member_cont: bool = false,
};
pub const SetField = struct {
field: Loc,
right: Loc,
};
pub const ObjectInit = struct {
typeId: TypeId,
args: Loc,
numArgs: u8,
};
pub const ForRangeStmt = struct {
start: Loc,
end: Loc,
eachLocal: ?u8,
increment: bool,
declHead: u32,
bodyHead: u32,
};
pub const TryStmt = struct {
hasErrLocal: bool,
errLocal: u8,
bodyHead: u32,
catchBodyHead: u32,
};
pub const Local = struct {
id: u8,
};
pub const Lambda = struct {
func: *cy.Func,
maxLocals: u8,
// If `numCaptures` > 0, this is a closure.
numCaptures: u8,
numParamCopies: u8,
bodyHead: u32,
params: Loc,
captures: u32,
ct: bool,
};
pub const FuncBlock = struct {
func: *cy.Func,
maxLocals: u8,
numParamCopies: u8,
bodyHead: u32,
params: Loc,
// For methods only.
parentType: cy.TypeId,
/// Mark a func block to skip generation.
/// Useful for removing temporary compile-time functions.
skip: bool = false,
};
pub const PushBlock = struct {
maxLocals: u8,
};
pub const MainBlock = struct {
maxLocals: u8,
bodyHead: u32,
};
pub const FuncParam = struct {
namePtr: [*]const u8,
nameLen: u16,
declType: TypeId,
isCopy: bool,
lifted: bool,
pub fn name(self: FuncParam) []const u8 {
return self.namePtr[0..self.nameLen];
}
};
pub const DeclareLocalInit = struct {
namePtr: [*]const u8,
nameLen: u16,
declType: TypeId,
id: u8,
lifted: bool,
/// If the local depends on a child local (declared in a block expr),
/// the memory must be zeroed so unwinding doesn't end up using an undefined value.
zeroMem: bool,
init: Loc,
initType: CompactType,
pub fn name(self: DeclareLocalInit) []const u8 {
return self.namePtr[0..self.nameLen];
}
};
pub const DeclareLocal = struct {
namePtr: [*]const u8,
nameLen: u16,
declType: TypeId,
id: u8,
lifted: bool,
pub fn name(self: DeclareLocal) []const u8 {
return self.namePtr[0..self.nameLen];
}
};
/// Several pre codes share a union so that sema
/// can generate the IR in one pass by back-patching.
pub const Prepare = union {
binOp: BinOp,
slice: Slice,
unOp: UnOp,
pub fn initCall(numArgs: u8) Prepare {
return .{
.call = .{
.numArgs = numArgs,
}
};
}
};
pub const Slice = struct {
recvT: TypeId,
rec: Loc,
left: Loc,
right: Loc,
};
pub const BinOp = struct {
leftT: TypeId,
rightT: TypeId,
op: cy.BinaryExprOp,
left: Loc,
right: Loc,
};
pub const Set = union {
local: SetLocal,
index: SetIndex,
generic: SetGeneric,
callObjSymTern: SetCallObjSymTern,
set_field_dyn: SetFieldDyn,
set_field: SetField,
};
pub const SetDeref = struct {
ptr: Loc,
right: Loc,
};
pub const SetCallObjSymTern = struct {
name: []const u8,
rec: Loc,
index: Loc,
right: Loc,
};
pub const SetGeneric = struct {
left_t: CompactType,
right_t: CompactType,
left: Loc,
right: Loc,
};
pub const SetLocal = struct {
id: u8,
right: Loc,
};
pub const SetIndex = struct {
recvT: TypeId,
rec: Loc,
index: Loc,
right: Loc,
};
pub const Context = struct {
sym: *cy.sym.ContextVar,
};
pub const InitVarSym = struct {
src_ir: *cy.ir.Buffer,
sym: *cy.Sym,
expr: Loc,
};
pub const SetVarSym = struct {
sym: *cy.Sym,
expr: Loc,
};
pub const VarSym = struct {
sym: *cy.Sym,
};
pub const EnumMemberSym = struct {
type: TypeId,
val: u8,
};
pub const FuncPtr = struct {
func: *cy.Func,
};
pub const FuncUnion = struct {
expr: Loc,
};
pub const Type = struct {
typeId: TypeId,
expr_type: bool = false,
};
pub const CoinitCall = struct {
call: Loc,
};
pub const CallObjSym = struct {
name: []const u8,
rec: Loc,
args: Loc,
// Does not include rec.
numArgs: u8,
};
pub const CallFuncSym = struct {
func: *cy.Func,
numArgs: u8,
args: Loc,
};
pub const CallSymDyn = struct {
sym: *cy.sym.FuncSym,
nargs: u8,
args: Loc,
};
pub const CallTrait = struct {
trait: Loc,
args: Loc,
nargs: u8,
vtable_idx: u8,
};
pub const CallDyn = struct {
callee: Loc,
args: Loc,
numArgs: u8,
};
pub const RetExprStmt = struct {
expr: Loc,
};
pub const ExprStmt = struct {
expr: Loc,
/// If in a block expression, returns as the result of the expression.
/// If in the main block, can be used to return from an `eval`.
isBlockResult: bool,
};
pub const Map = struct {
placeholder: u8,
};
pub const Array = struct {
args: Loc,
nargs: u8,
};
pub const List = struct {
args: Loc,
nargs: u8,
};
pub const Float = struct {
val: f64,
};
pub const Int = struct {
val: i64,
};
pub const Byte = struct {
val: u8,
};
pub const None = struct {
child: Loc,
};
pub const String = struct {
raw: []const u8,
};
pub const StringTemplate = struct {
numExprs: u8,
args: u32,
};
pub const UnOp = struct {
expr: Loc,
childT: TypeId,
op: cy.UnaryOp,
};
pub const StmtBlock = struct {
first: u32,
last: u32,
};
pub const ElseBlock = struct {
cond: cy.Nullable(Loc),
body_head: Loc,
else_block: cy.Nullable(Loc),
};
pub const IfStmt = struct {
cond: Loc,
body_head: Loc,
else_block: cy.Nullable(Loc),
};
pub const Verbose = struct {
verbose: bool,
};
pub const OpSet = struct {
op: cy.BinaryExprOp,
set_stmt: Loc,
};
pub fn StmtData(comptime code: StmtCode) type {
return comptime switch (code) {
.mainBlock => MainBlock,
.funcBlock => FuncBlock,
.declareLocal => DeclareLocal,
.declareLocalInit => DeclareLocalInit,
.ifStmt => IfStmt,
.tryStmt => TryStmt,
.forRangeStmt => ForRangeStmt,
.setIndex,
.setLocal,
.set_field_dyn,
.setCaptured,
.set_field,
.set => Set,
.set_var_sym => SetVarSym,
.init_var_sym => InitVarSym,
.set_deref => SetDeref,
.opSet => OpSet,
.pushDebugLabel => PushDebugLabel,
.verbose => Verbose,
.exprStmt => ExprStmt,
.block => Block,
.retExprStmt => RetExprStmt,
.loopStmt => LoopStmt,
else => void,
};
}
pub fn ExprData(comptime code: ExprCode) type {
return switch (code) {
.lambda => Lambda,
.switchExpr => Switch,
.switchCase => SwitchCase,
.else_block => ElseBlock,
.call_dyn => CallDyn,
.call_sym => CallFuncSym,
.call_trait => CallTrait,
.call_sym_dyn => CallSymDyn,
.call_obj_sym => CallObjSym,
.coinitCall => CoinitCall,
.preBinOp,
.preUnOp,
.pre => Prepare,
.varSym => VarSym,
.context => Context,
.enumMemberSym => EnumMemberSym,
.func_ptr => FuncPtr,
.func_union => FuncUnion,
.type => Type,
.float => Float,
.int => Int,
.byte => Byte,
.none => None,
.local => Local,
.if_expr => IfExpr,
.tryExpr => TryExpr,
.throw => ThrowExpr,
.list => List,
.map => Map,
.array => Array,
.string => String,
.stringTemplate => StringTemplate,
.object_init => ObjectInit,
.fieldDyn => FieldDyn,
.field => Field,
.cast => Cast,
.errorv => Error,
.captured => Captured,
.symbol => Symbol,
.tag_lit => TagLit,
.blockExpr => BlockExpr,
.coresume => Coresume,
.unwrapChoice => UnwrapChoice,
.unwrap_or => UnwrapOr,
.type_check => TypeCheck,
.typeCheckOption => TypeCheckOption,
.box => Box,
.unbox => Unbox,
.await_expr => Await,
.trait => Trait,
.address_of => AddressOf,
.deref => Deref,
else => void,
};
}
/// IR ops use an explicit index since the underlying buffer can grow.
pub const Buffer = struct {
buf: std.ArrayListUnmanaged(u8),
stmtBlockStack: std.ArrayListUnmanaged(StmtBlock),
/// Main and func blocks.
func_blocks: std.ArrayListUnmanaged(Loc),
pub fn init() Buffer {
return .{
.buf = .{},
.stmtBlockStack = .{},
.func_blocks = .{},
};
}
pub fn deinit(self: *Buffer, alloc: std.mem.Allocator) void {
self.buf.deinit(alloc);
self.stmtBlockStack.deinit(alloc);
self.func_blocks.deinit(alloc);
}
pub fn setExprCode(self: *Buffer, idx: usize, comptime code: ExprCode) void {
self.buf.items[idx] = @intFromEnum(code);
}
pub fn setExprData(self: *Buffer, idx: usize, comptime code: ExprCode, data: ExprData(code)) void {
const bytes = std.mem.toBytes(data);
@memcpy(self.buf.items[idx+1+8+4..idx+1+8+4+bytes.len], &bytes);
}
pub fn getExprData(self: *Buffer, idx: usize, comptime code: ExprCode) ExprData(code) {
const data = self.buf.items[idx+1+8+4..][0..@sizeOf(ExprData(code))];
return std.mem.bytesToValue(ExprData(code), data);
}
pub fn getExprDataPtr(self: *Buffer, idx: usize, comptime code: ExprCode) *align(1) ExprData(code) {
const data = self.buf.items[idx+1+8+4..][0..@sizeOf(ExprData(code))];
return std.mem.bytesAsValue(ExprData(code), data);
}
pub fn setStmtCode(self: *Buffer, idx: usize, comptime code: StmtCode) void {
self.buf.items[idx] = @intFromEnum(code);
}
pub fn setStmtData(self: *Buffer, idx: usize, comptime code: StmtCode, data: StmtData(code)) void {
const bytes = std.mem.toBytes(data);
@memcpy(self.buf.items[idx+1+8+4..idx+1+8+4+bytes.len], &bytes);
}
pub fn getStmtData(self: *Buffer, idx: usize, comptime code: StmtCode) StmtData(code) {
const data = self.buf.items[idx+1+8+4..][0..@sizeOf(StmtData(code))];
return std.mem.bytesToValue(StmtData(code), data);
}
pub fn getStmtDataPtr(self: *Buffer, idx: usize, comptime code: StmtCode) *align(1) StmtData(code) {
const data = self.buf.items[idx+1+8+4..][0..@sizeOf(StmtData(code))];
return std.mem.bytesAsValue(StmtData(code), data);
}
pub fn advanceArray(_: *Buffer, idx: usize, comptime T: type, arr: []align(1) const T) usize {
return idx + arr.len * @sizeOf(T);
}
pub fn advanceExpr(_: *Buffer, idx: usize, comptime code: ExprCode) usize {
return idx + 1 + 8 + 4 + @sizeOf(ExprData(code));
}
pub fn advanceStmt(_: *Buffer, idx: usize, comptime code: StmtCode) usize {
return idx + 1 + 8 + 4 + @sizeOf(StmtData(code));
}
pub fn pushStmtBlock(self: *Buffer, alloc: std.mem.Allocator) !void {
try self.stmtBlockStack.append(alloc, .{
.first = cy.NullId,
.last = cy.NullId,
});
}
pub fn pushStmtBlock2(self: *Buffer, alloc: std.mem.Allocator, block: StmtBlock) !void {
try self.stmtBlockStack.append(alloc, block);
}
pub fn popStmtBlock(self: *Buffer) StmtBlock {
return self.stmtBlockStack.pop();
}
pub fn pushEmptyExpr(self: *Buffer, comptime code: ExprCode, alloc: std.mem.Allocator, expr_t: ExprType, node_id: *ast.Node) !u32 {
log.tracev("irPushExpr: {} at {}", .{code, self.buf.items.len});
const start = self.buf.items.len;
try self.buf.resize(alloc, self.buf.items.len + 1 + 8 + 4 + @sizeOf(ExprData(code)));
self.buf.items[start] = @intFromEnum(code);
self.setNode(start, node_id);
self.setExprType2(start, expr_t);
return @intCast(start);
}
pub fn reserveData(self: *Buffer, alloc: std.mem.Allocator, comptime T: type) !*align(1) T {
const start = self.buf.items.len;
try self.buf.resize(alloc, self.buf.items.len + @sizeOf(T));
return @ptrCast(&self.buf.items[start]);
}
pub fn pushEmptyArray(self: *Buffer, alloc: std.mem.Allocator, comptime T: type, len: usize) !u32 {
const start = self.buf.items.len;
try self.buf.resize(alloc, self.buf.items.len + @sizeOf(T) * len);
return @intCast(start);
}
pub fn setArrayItem(self: *Buffer, idx: usize, comptime T: type, elemIdx: usize, elem: T) void {
@as(*align(1) T, @ptrCast(&self.buf.items[idx+@sizeOf(T)*elemIdx])).* = elem;
}
pub fn getArray(self: *Buffer, idx: usize, comptime T: type, len: usize) []align(1) T {
const data = self.buf.items[idx..idx + @sizeOf(T) * len];
return std.mem.bytesAsSlice(T, data);
}
pub fn pushExpr(self: *Buffer, comptime code: ExprCode, alloc: std.mem.Allocator, type_id: cy.TypeId, node: *ast.Node, data: ExprData(code)) !u32 {
const expr_t = ExprType.init(type_id);
const loc = try self.pushEmptyExpr(code, alloc, expr_t, node);
self.setExprData(loc, code, data);
return loc;
}
pub fn pushExprThrows(self: *Buffer, comptime code: ExprCode, alloc: std.mem.Allocator, type_id: cy.TypeId, node_id: *ast.Node, data: ExprData(code)) !u32 {
const expr_t = ExprType.initThrows(type_id);
const loc = try self.pushEmptyExpr(code, alloc, expr_t, node_id);
self.setExprData(loc, code, data);
return loc;
}
pub fn getExprCode(self: *Buffer, idx: usize) ExprCode {
return @enumFromInt(self.buf.items[idx]);
}
pub fn getStmtCode(self: *Buffer, idx: usize) StmtCode {
return @enumFromInt(self.buf.items[idx]);
}
pub fn getNode(self: *Buffer, idx: usize) *ast.Node {
return @as(*align(1) *ast.Node, @ptrCast(self.buf.items.ptr + idx + 1)).*;
}
pub fn setNode(self: *Buffer, idx: usize, nodeId: *ast.Node) void {
@as(*align(1) *ast.Node, @ptrCast(self.buf.items.ptr + idx + 1)).* = nodeId;
}
pub fn setExprType2(self: *Buffer, loc: usize, expr_t: ExprType) void {
@as(*align(1) ExprType, @ptrCast(self.buf.items.ptr + loc + 1 + 8)).* = expr_t;
}
pub fn setExprType(self: *Buffer, loc: usize, type_id: cy.TypeId) void {
const expr_t = ExprType.init(type_id);
@as(*align(1) ExprType, @ptrCast(self.buf.items.ptr + loc + 1 + 8)).* = expr_t;
}
pub fn setExprTypeThrows(self: *Buffer, loc: usize, type_id: cy.TypeId) void {
const expr_t = ExprType.initThrows(type_id);
@as(*align(1) ExprType, @ptrCast(self.buf.items.ptr + loc + 1 + 8)).* = expr_t;
}
pub fn getExprType(self: *Buffer, loc: usize) ExprType {
return @as(*align(1) ExprType, @ptrCast(self.buf.items.ptr + loc + 1 + 8)).*;
}
pub fn setStmtNext(self: *Buffer, idx: usize, nextIdx: u32) void {
@as(*align(1) u32, @ptrCast(self.buf.items.ptr + idx + 1 + 8)).* = nextIdx;
}
pub fn getStmtNext(self: *Buffer, idx: usize) u32 {
return @as(*align(1) u32, @ptrCast(self.buf.items.ptr + idx + 1 + 8)).*;
}
pub fn pushEmptyStmt(self: *Buffer, alloc: std.mem.Allocator, comptime code: StmtCode, node: *ast.Node) !u32 {
return self.pushEmptyStmt2(alloc, code, node, true);
}
pub fn getAndClearStmtBlock(self: *Buffer) u32 {
const b = &self.stmtBlockStack.items[self.stmtBlockStack.items.len-1];
defer {
b.first = cy.NullId;
b.last = cy.NullId;
}
return b.first;
}
pub fn appendToParent(self: *Buffer, idx: u32) void {
const list = &self.stmtBlockStack.items[self.stmtBlockStack.items.len-1];
if (list.last == cy.NullId) {
// Set head stmt.
list.first = idx;
list.last = idx;
} else {
// Attach to last.
self.setStmtNext(list.last, idx);
list.last = idx;
}
}
pub fn pushEmptyStmt2(self: *Buffer, alloc: std.mem.Allocator, comptime code: StmtCode, node: *ast.Node, comptime appendToParent_: bool) !u32 {
log.tracev("irPushStmt: {} at {}", .{code, self.buf.items.len});
const start: u32 = @intCast(self.buf.items.len);
try self.buf.resize(alloc, self.buf.items.len + 1 + 8 + 4 + @sizeOf(StmtData(code)));
self.buf.items[start] = @intFromEnum(code);
self.setNode(start, node);
self.setStmtNext(start, cy.NullId);
if (appendToParent_) {
self.appendToParent(start);
}
return @intCast(start);
}
pub fn pushStmt(self: *Buffer, alloc: std.mem.Allocator, comptime code: StmtCode, nodeId: *ast.Node, data: StmtData(code)) !u32 {
const idx = try self.pushEmptyStmt(alloc, code, nodeId);
self.setStmtData(idx, code, data);
return idx;
}
pub fn visitStmt(self: *Buffer, alloc: std.mem.Allocator, loc: u32) !Visitor {
var new = Visitor{
.alloc = alloc,
.buf = self,
.node_queue = std.fifo.LinearFifo(u32, .Dynamic).init(alloc),
.state_queue = std.fifo.LinearFifo(VisitState, .Dynamic).init(alloc),
};
try new.node_queue.writeItem(loc);
try new.state_queue.writeItem(.{ .is_stmt = true });
return new;
}
};
const VisitEntry = struct {
loc: u32,
is_stmt: bool,
};
const VisitState = struct {
is_stmt: bool,
};
const Visitor = struct {
alloc: std.mem.Allocator,
buf: *Buffer,
temp_nodes: std.ArrayListUnmanaged(u32) = .{},
temp_states: std.ArrayListUnmanaged(VisitState) = .{},
node_queue: std.fifo.LinearFifo(u32, .Dynamic),
state_queue: std.fifo.LinearFifo(VisitState, .Dynamic),
pub fn next(self: *Visitor) !?VisitEntry {
if (self.node_queue.count == 0) {
return null;
}
const loc = self.node_queue.readItem().?;
const state = self.state_queue.readItem().?;
if (state.is_stmt) {
const code = self.buf.getStmtCode(loc);
switch (code) {
.funcBlock => {
const data = self.buf.getStmtData(loc, .funcBlock);
self.clearTemps();
try self.pushStmts(data.bodyHead);
try self.prependTemps();
},
.retExprStmt => {
const data = self.buf.getStmtData(loc, .retExprStmt);
try self.prependExpr(data.expr);
},
.exprStmt => {
const data = self.buf.getStmtData(loc, .exprStmt);