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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
|
// Glossary (because i don't know where else to put it)
// IR - intermediate representation
// SoN - sea of nodes (https://www.oracle.com/technetwork/java/javase/tech/c2-ir95-150110.pdf)
// SSA - single static assignment
// GVN - global value numbering
// CSE - common subexpression elimination
// CFG - control flow graph
// DSE - dead store elimination
// GCM - global code motion
// SROA - scalar replacement of aggregates
// SCCP - sparse conditional constant propagation
// RPO - reverse postorder
// BB - basic block
// ZTC - zero trip count
// SCC - strongly connected components
#ifndef TB_CORE_H
#define TB_CORE_H
#include <assert.h>
#include <inttypes.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
// https://semver.org/
#define TB_VERSION_MAJOR 0
#define TB_VERSION_MINOR 3
#define TB_VERSION_PATCH 0
#ifndef TB_API
# ifdef __cplusplus
# define TB_EXTERN extern "C"
# else
# define TB_EXTERN
# endif
# ifdef TB_DLL
# ifdef TB_IMPORT_DLL
# define TB_API TB_EXTERN __declspec(dllimport)
# else
# define TB_API TB_EXTERN __declspec(dllexport)
# endif
# else
# define TB_API TB_EXTERN
# endif
#endif
// These are flags
typedef enum TB_ArithmeticBehavior {
TB_ARITHMATIC_NONE = 0,
TB_ARITHMATIC_NSW = 1,
TB_ARITHMATIC_NUW = 2,
} TB_ArithmeticBehavior;
typedef enum TB_DebugFormat {
TB_DEBUGFMT_NONE,
TB_DEBUGFMT_DWARF,
TB_DEBUGFMT_CODEVIEW,
TB_DEBUGFMT_COLINPILLED
} TB_DebugFormat;
typedef enum TB_Arch {
TB_ARCH_UNKNOWN,
TB_ARCH_X86_64,
TB_ARCH_AARCH64, // unsupported but planned
TB_ARCH_WASM32,
} TB_Arch;
typedef enum TB_System {
TB_SYSTEM_WINDOWS,
TB_SYSTEM_LINUX,
TB_SYSTEM_MACOS,
TB_SYSTEM_ANDROID, // Not supported yet
TB_SYSTEM_WEB,
TB_SYSTEM_MAX,
} TB_System;
typedef enum TB_WindowsSubsystem {
TB_WIN_SUBSYSTEM_UNKNOWN,
TB_WIN_SUBSYSTEM_WINDOWS,
TB_WIN_SUBSYSTEM_CONSOLE,
TB_WIN_SUBSYSTEM_EFI_APP,
} TB_WindowsSubsystem;
typedef enum TB_ABI {
// Used on 64bit Windows platforms
TB_ABI_WIN64,
// Used on Mac, BSD and Linux platforms
TB_ABI_SYSTEMV,
} TB_ABI;
typedef enum TB_OutputFlavor {
TB_FLAVOR_OBJECT, // .o .obj
TB_FLAVOR_SHARED, // .so .dll
TB_FLAVOR_STATIC, // .a .lib
TB_FLAVOR_EXECUTABLE, // .exe
} TB_OutputFlavor;
typedef enum TB_CallingConv {
TB_CDECL,
TB_STDCALL
} TB_CallingConv;
typedef enum TB_FeatureSet_X64 {
TB_FEATURE_X64_SSE3 = (1u << 0u),
TB_FEATURE_X64_SSE41 = (1u << 1u),
TB_FEATURE_X64_SSE42 = (1u << 2u),
TB_FEATURE_X64_POPCNT = (1u << 3u),
TB_FEATURE_X64_LZCNT = (1u << 4u),
TB_FEATURE_X64_CLMUL = (1u << 5u),
TB_FEATURE_X64_F16C = (1u << 6u),
TB_FEATURE_X64_BMI1 = (1u << 7u),
TB_FEATURE_X64_BMI2 = (1u << 8u),
TB_FEATURE_X64_AVX = (1u << 9u),
TB_FEATURE_X64_AVX2 = (1u << 10u),
} TB_FeatureSet_X64;
typedef struct TB_FeatureSet {
TB_FeatureSet_X64 x64;
} TB_FeatureSet;
typedef enum TB_Linkage {
TB_LINKAGE_PUBLIC,
TB_LINKAGE_PRIVATE
} TB_Linkage;
typedef enum {
TB_COMDAT_NONE,
TB_COMDAT_MATCH_ANY,
} TB_ComdatType;
typedef enum TB_MemoryOrder {
TB_MEM_ORDER_RELAXED,
TB_MEM_ORDER_CONSUME,
TB_MEM_ORDER_ACQUIRE,
TB_MEM_ORDER_RELEASE,
TB_MEM_ORDER_ACQ_REL,
TB_MEM_ORDER_SEQ_CST,
} TB_MemoryOrder;
typedef enum TB_DataTypeEnum {
// Integers, note void is an i0 and bool is an i1
// i(0-64)
TB_INT,
// Floating point numbers
// f{32,64}
TB_FLOAT,
// Pointers
TB_PTR,
// represents control flow for REGION, BRANCH
TB_CONTROL,
// represents memory (and I/O)
TB_MEMORY,
// continuation (usually just return addresses :p)
TB_CONT,
// Tuples, these cannot be used in memory ops, just accessed via projections
TB_TUPLE,
} TB_DataTypeEnum;
typedef enum TB_FloatFormat {
// IEEE 754 floats
TB_FLT_32, TB_FLT_64
} TB_FloatFormat;
typedef union TB_DataType {
struct {
uint16_t type : 4;
// for integers it's the bitwidth
uint16_t data : 12;
};
uint16_t raw;
} TB_DataType;
static_assert(sizeof(TB_DataType) == 2, "im expecting this to be a uint16_t");
// classify data types
#define TB_IS_VOID_TYPE(x) ((x).type == TB_INT && (x).data == 0)
#define TB_IS_BOOL_TYPE(x) ((x).type == TB_INT && (x).data == 1)
#define TB_IS_INTEGER_TYPE(x) ((x).type == TB_INT)
#define TB_IS_FLOAT_TYPE(x) ((x).type == TB_FLOAT)
#define TB_IS_POINTER_TYPE(x) ((x).type == TB_PTR)
// accessors
#define TB_GET_INT_BITWIDTH(x) ((x).data)
#define TB_GET_FLOAT_FORMAT(x) ((x).data)
#define TB_GET_PTR_ADDRSPACE(x) ((x).data)
////////////////////////////////
// ANNOTATIONS
////////////////////////////////
//
// (A, B) -> (C, D)
//
// node takes A and B, produces C, D. if there's multiple
// results we need to use projections and the indices are
// based on the order seen here, proj0 is C, proj1 is D.
//
// (A, B) & C -> Int
//
// nodes takes A and B along with C in it's extra data. this is
// where non-node inputs fit.
//
typedef enum TB_NodeTypeEnum {
TB_NULL = 0,
////////////////////////////////
// CONSTANTS
////////////////////////////////
TB_INTEGER_CONST,
TB_FLOAT32_CONST,
TB_FLOAT64_CONST,
////////////////////////////////
// MISCELLANEOUS
////////////////////////////////
// this is an unspecified value, usually generated by the optimizer
// when malformed input is folded into an operation.
TB_POISON, // () -> Any
// projections just extract a single field of a tuple
TB_PROJ, // Tuple & Int -> Any
// this is a simple way to embed machine code into the code
TB_MACHINE_OP, // (Control, Memory) & Buffer -> (Control, Memory)
// reads the TSC on x64
TB_CYCLE_COUNTER, // (Control) -> Int64
// prefetches data for reading. The number next to the
//
// 0 is temporal
// 1-3 are just cache levels
TB_PREFETCH, // (Memory, Ptr) & Int -> Memory
////////////////////////////////
// CONTROL
////////////////////////////////
// there's only one START and STOP per function
TB_START, // () -> (Control, Memory, Data...)
TB_END, // (Control, Memory, Data?) -> ()
// regions are used to represent paths which have multiple entries.
// each input is a predecessor.
TB_REGION, // (Control...) -> (Control)
// phi nodes work the same as in SSA CFG, the value is based on which predecessor was taken.
// each input lines up with the regions such that region.in[i] will use phi.in[i+1] as the
// subsequent data.
TB_PHI, // (Control, Data...) -> Data
// branch is used to implement most control flow, it acts like a switch
// statement in C usually. they take a key and match against some cases,
// if they match, it'll jump to that successor, if none match it'll take
// the default successor.
//
// if (cond) { A; } else { B; } is just switch (cond) { case 0: B; default: A; }
//
// it's possible to not pass a key and the default successor is always called, this is
// a GOTO. tb_inst_goto, tb_inst_if can handle common cases for you.
TB_BRANCH, // (Control, Data?) -> (Control...)
// debugbreak will trap in a continuable manner.
TB_DEBUGBREAK, // (Control, Memory) -> (Control)
// trap will not be continuable but will stop execution.
TB_TRAP, // (Control) -> (Control)
// unreachable means it won't trap or be continuable.
TB_UNREACHABLE, // (Control) -> ()
// this is generated when a path becomes disconnected
// from the main IR, it'll be reduced by the monotonic
// rewrites.
TB_DEAD, // () -> (Control)
////////////////////////////////
// CONTROL + MEMORY
////////////////////////////////
// nothing special, it's just a function call, 3rd argument here is the
// target pointer (or syscall number) and the rest are just data args.
TB_CALL, // (Control, Memory, Data, Data...) -> (Control, Memory, Data)
TB_SYSCALL, // (Control, Memory, Data, Data...) -> (Control, Memory, Data)
// performs call while recycling the stack frame somewhat
TB_TAILCALL, // (Control, Memory, RPC, Data, Data...) -> ()
// safepoint polls are the same except they only trigger if the poll site
// says to (platform specific but almost always just the page being made
// unmapped/guard), 3rd argument is the poll site.
TB_SAFEPOINT_POLL, // (Control, Memory, Ptr?, Data...) -> (Control)
// this safepoint which doesn't emit any poll site, it's just
// an address, this is used by AOT compiles to encode line info.
TB_SAFEPOINT_NOP, // (Control, Memory, Ptr?, Data...) -> (Control)
////////////////////////////////
// MEMORY
////////////////////////////////
// MERGEMEM will join multiple non-aliasing memory effects, because
// they don't alias there's no ordering guarentee.
TB_MERGEMEM, // (Memory...) -> Memory
// LOAD and STORE are standard memory accesses, they can be folded away.
TB_LOAD, // (Control?, Memory, Ptr) -> Data
TB_STORE, // (Control, Memory, Ptr, Data) -> Memory
// bulk memory ops.
TB_MEMCPY, // (Control, Memory, Ptr, Ptr, Size) -> Memory
TB_MEMSET, // (Control, Memory, Ptr, Int8, Size) -> Memory
// these memory accesses represent "volatile" which means
// they may produce side effects and thus cannot be eliminated.
TB_READ, // (Control, Memory, Ptr) -> (Memory, Data)
TB_WRITE, // (Control, Memory, Ptr, Data) -> (Memory, Data)
// atomics have multiple observers (if not they wouldn't need to
// be atomic) and thus produce side effects everywhere just like
// volatiles except they have synchronization guarentees. the atomic
// data ops will return the value before the operation is performed.
// Atomic CAS return the old value and a boolean for success (true if
// the value was changed)
TB_ATOMIC_LOAD, // (Control, Memory, Ptr) -> (Memory, Data)
TB_ATOMIC_XCHG, // (Control, Memory, Ptr, Data) -> (Memory, Data)
TB_ATOMIC_ADD, // (Control, Memory, Ptr, Data) -> (Memory, Data)
TB_ATOMIC_SUB, // (Control, Memory, Ptr, Data) -> (Memory, Data)
TB_ATOMIC_AND, // (Control, Memory, Ptr, Data) -> (Memory, Data)
TB_ATOMIC_XOR, // (Control, Memory, Ptr, Data) -> (Memory, Data)
TB_ATOMIC_OR, // (Control, Memory, Ptr, Data) -> (Memory, Data)
TB_ATOMIC_CAS, // (Control, Memory, Data, Data) -> (Memory, Data, Bool)
// like a multi-way branch but without the control flow aspect, but for data.
TB_LOOKUP,
////////////////////////////////
// POINTERS
////////////////////////////////
// LOCAL will statically allocate stack space
TB_LOCAL, // () & (Int, Int) -> Ptr
// SYMBOL will return a pointer to a TB_Symbol
TB_SYMBOL, // () & TB_Symbol* -> Ptr
// offsets pointer by constant value
TB_MEMBER_ACCESS, // Ptr & Int -> Ptr
// arguments represent base, index, and stride respectively
// and will perform `base + index*stride`
TB_ARRAY_ACCESS, // (Ptr, Int) & Int -> Ptr
// converts an integer to a pointer
TB_INT2PTR, // Int -> Ptr
// converts a pointer to an integer
TB_PTR2INT, // Ptr -> Int
// Conversions
TB_TRUNCATE,
TB_FLOAT_EXT,
TB_SIGN_EXT,
TB_ZERO_EXT,
TB_UINT2FLOAT,
TB_FLOAT2UINT,
TB_INT2FLOAT,
TB_FLOAT2INT,
TB_BITCAST,
// Select
TB_SELECT,
// Bitmagic
TB_BSWAP,
TB_CLZ,
TB_CTZ,
TB_POPCNT,
// Unary operations
TB_NOT,
TB_NEG,
// Integer arithmatic
TB_AND,
TB_OR,
TB_XOR,
TB_ADD,
TB_SUB,
TB_MUL,
TB_SHL,
TB_SHR,
TB_SAR,
TB_ROL,
TB_ROR,
TB_UDIV,
TB_SDIV,
TB_UMOD,
TB_SMOD,
// Float arithmatic
TB_FADD,
TB_FSUB,
TB_FMUL,
TB_FDIV,
TB_FMAX,
TB_FMIN,
// Comparisons
TB_CMP_EQ,
TB_CMP_NE,
TB_CMP_ULT,
TB_CMP_ULE,
TB_CMP_SLT,
TB_CMP_SLE,
TB_CMP_FLT,
TB_CMP_FLE,
// Special ops
// adds two paired integers to two other paired integers and returns
// a low and high value
TB_ADDPAIR,
// does full multiplication (64x64=128 and so on) returning
// the low and high values in separate projections
TB_MULPAIR,
// variadic
TB_VA_START,
// x86 intrinsics
TB_X86INTRIN_LDMXCSR,
TB_X86INTRIN_STMXCSR,
TB_X86INTRIN_SQRT,
TB_X86INTRIN_RSQRT,
} TB_NodeTypeEnum;
typedef uint8_t TB_NodeType;
// just represents some region of bytes, usually in file parsing crap
typedef struct {
size_t length;
const uint8_t* data;
} TB_Slice;
// represents byte counts
typedef uint32_t TB_CharUnits;
// will get interned so each TB_Module has a unique identifier for the source file
typedef struct {
// used by the debug info export
int id;
size_t len;
uint8_t path[];
} TB_SourceFile;
typedef struct TB_Location {
TB_SourceFile* file;
int line, column;
uint32_t pos;
} TB_Location;
// SO refers to shared objects which mean either shared libraries (.so or .dll)
// or executables (.exe or ELF executables)
typedef enum {
// exports to the rest of the shared object
TB_EXTERNAL_SO_LOCAL,
// exports outside of the shared object
TB_EXTERNAL_SO_EXPORT,
} TB_ExternalType;
typedef struct TB_Global TB_Global;
typedef struct TB_External TB_External;
typedef struct TB_Function TB_Function;
typedef struct TB_Module TB_Module;
typedef struct TB_DebugType TB_DebugType;
typedef struct TB_ModuleSection TB_ModuleSection;
typedef struct TB_FunctionPrototype TB_FunctionPrototype;
enum { TB_MODULE_SECTION_NONE = -1 };
typedef int32_t TB_ModuleSectionHandle;
typedef struct TB_Attrib TB_Attrib;
// target-specific, just a unique ID for the registers
typedef int TB_PhysicalReg;
// Thread local module state
typedef struct TB_ThreadInfo TB_ThreadInfo;
typedef enum {
TB_SYMBOL_NONE,
TB_SYMBOL_EXTERNAL,
TB_SYMBOL_GLOBAL,
TB_SYMBOL_FUNCTION,
TB_SYMBOL_MAX,
} TB_SymbolTag;
// Refers generically to objects within a module
//
// TB_Function, TB_Global, and TB_External are all subtypes of TB_Symbol
// and thus are safely allowed to cast into a symbol for operations.
typedef struct TB_Symbol {
#ifdef __cplusplus
TB_SymbolTag tag;
#else
_Atomic TB_SymbolTag tag;
#endif
// which thread info it's tied to (we may need to remove it, this
// is used for that)
TB_ThreadInfo* info;
char* name;
// It's kinda a weird circular reference but yea
TB_Module* module;
// helpful for sorting and getting consistent builds
uint64_t ordinal;
union {
// if we're JITing then this maps to the address of the symbol
void* address;
size_t symbol_id;
};
// after this point it's tag-specific storage
} TB_Symbol;
typedef struct TB_Node TB_Node;
typedef struct User User;
struct User {
User* next;
TB_Node* n;
int slot;
};
struct TB_Node {
TB_NodeType type;
uint16_t input_count;
TB_DataType dt;
// makes it easier to track in graph walks
uint32_t gvn;
// only value while inside of a TB_Passes,
// these are unordered and usually just
// help perform certain transformations or
// analysis (not necessarily semantics)
User* users;
// ordered def-use edges, jolly ol' semantics
TB_Node** inputs;
char extra[];
};
// These are the extra data in specific nodes
#define TB_NODE_GET_EXTRA(n) ((void*) n->extra)
#define TB_NODE_GET_EXTRA_T(n, T) ((T*) (n)->extra)
#define TB_NODE_SET_EXTRA(n, T, ...) (*((T*) (n)->extra) = (T){ __VA_ARGS__ })
// this represents switch (many targets), if (one target) and goto (only default) logic.
typedef struct { // TB_BRANCH
size_t succ_count;
int64_t keys[];
} TB_NodeBranch;
typedef struct { // TB_PROJ
int index;
} TB_NodeProj;
typedef struct { // TB_INTEGER_CONST
uint64_t value;
} TB_NodeInt;
typedef struct { // any compare operator
TB_DataType cmp_dt;
} TB_NodeCompare;
typedef struct { // any integer binary operator
TB_ArithmeticBehavior ab;
} TB_NodeBinopInt;
typedef struct {
TB_CharUnits align;
} TB_NodeMemAccess;
typedef struct {
int level;
} TB_NodePrefetch;
typedef struct {
TB_CharUnits size, align;
int alias_index; // 0 if local is used beyond direct memops, 1...n as a unique alias name
} TB_NodeLocal;
typedef struct {
// this is the raw buffer
size_t length;
const uint8_t* data;
// represents the outputs, inputs and temporaries in that order
size_t outs, ins, tmps;
TB_PhysicalReg regs[];
} TB_NodeMachineOp;
typedef struct {
float value;
} TB_NodeFloat32;
typedef struct {
double value;
} TB_NodeFloat64;
typedef struct {
int64_t stride;
} TB_NodeArray;
typedef struct {
int64_t offset;
} TB_NodeMember;
typedef struct {
TB_Symbol* sym;
} TB_NodeSymbol;
typedef struct {
TB_MemoryOrder order;
TB_MemoryOrder order2;
TB_Node* proj0;
TB_Node* proj1;
} TB_NodeAtomic;
typedef struct {
// line info on safepoints
TB_SourceFile* file;
int line, column;
} TB_NodeSafepoint;
typedef struct {
TB_FunctionPrototype* proto;
int proj_count;
TB_Node* projs[];
} TB_NodeCall;
typedef struct {
TB_FunctionPrototype* proto;
} TB_NodeTailcall;
typedef struct {
const char* tag;
// magic factor for hot-code, higher means run more often
float freq;
// used for IR building only, stale after that.
TB_Node *mem_in, *mem_out;
} TB_NodeRegion;
typedef struct {
int64_t key;
uint64_t val;
} TB_LookupEntry;
typedef struct {
size_t entry_count;
TB_LookupEntry entries[];
} TB_NodeLookup;
typedef struct TB_MultiOutput {
size_t count;
union {
// count = 1
TB_Node* single;
// count > 1
TB_Node** multiple;
};
} TB_MultiOutput;
#define TB_MULTI_OUTPUT(o) ((o).count > 1 ? (o).multiple : &(o).single)
typedef struct {
int64_t key;
TB_Node* value;
} TB_SwitchEntry;
typedef enum {
TB_EXECUTABLE_UNKNOWN,
TB_EXECUTABLE_PE,
TB_EXECUTABLE_ELF,
} TB_ExecutableType;
typedef struct {
TB_Node* node; // type == TB_SAFEPOINT
void* userdata;
uint32_t ip; // relative to the function body.
uint32_t count; // same as node->input_count
int32_t values[];
} TB_Safepoint;
typedef enum {
TB_MODULE_SECTION_WRITE = 1,
TB_MODULE_SECTION_EXEC = 2,
TB_MODULE_SECTION_TLS = 4,
} TB_ModuleSectionFlags;
// *******************************
// Public macros
// *******************************
#ifdef __cplusplus
#define TB_TYPE_TUPLE TB_DataType{ { TB_TUPLE } }
#define TB_TYPE_CONTROL TB_DataType{ { TB_CONTROL } }
#define TB_TYPE_VOID TB_DataType{ { TB_INT, 0 } }
#define TB_TYPE_I8 TB_DataType{ { TB_INT, 8 } }
#define TB_TYPE_I16 TB_DataType{ { TB_INT, 16 } }
#define TB_TYPE_I32 TB_DataType{ { TB_INT, 32 } }
#define TB_TYPE_I64 TB_DataType{ { TB_INT, 64 } }
#define TB_TYPE_F32 TB_DataType{ { TB_FLOAT, TB_FLT_32 } }
#define TB_TYPE_F64 TB_DataType{ { TB_FLOAT, TB_FLT_64 } }
#define TB_TYPE_BOOL TB_DataType{ { TB_INT, 1 } }
#define TB_TYPE_PTR TB_DataType{ { TB_PTR, 0 } }
#define TB_TYPE_MEMORY TB_DataType{ { TB_MEMORY,0 } }
#define TB_TYPE_CONT TB_DataType{ { TB_CONT, 0 } }
#define TB_TYPE_INTN(N) TB_DataType{ { TB_INT, (N) } }
#define TB_TYPE_PTRN(N) TB_DataType{ { TB_PTR, (N) } }
#else
#define TB_TYPE_TUPLE (TB_DataType){ { TB_TUPLE } }
#define TB_TYPE_CONTROL (TB_DataType){ { TB_CONTROL } }
#define TB_TYPE_VOID (TB_DataType){ { TB_INT, 0 } }
#define TB_TYPE_I8 (TB_DataType){ { TB_INT, 8 } }
#define TB_TYPE_I16 (TB_DataType){ { TB_INT, 16 } }
#define TB_TYPE_I32 (TB_DataType){ { TB_INT, 32 } }
#define TB_TYPE_I64 (TB_DataType){ { TB_INT, 64 } }
#define TB_TYPE_F32 (TB_DataType){ { TB_FLOAT, TB_FLT_32 } }
#define TB_TYPE_F64 (TB_DataType){ { TB_FLOAT, TB_FLT_64 } }
#define TB_TYPE_BOOL (TB_DataType){ { TB_INT, 1 } }
#define TB_TYPE_PTR (TB_DataType){ { TB_PTR, 0 } }
#define TB_TYPE_CONT (TB_DataType){ { TB_CONT, 0 } }
#define TB_TYPE_MEMORY (TB_DataType){ { TB_MEMORY,0 } }
#define TB_TYPE_INTN(N) (TB_DataType){ { TB_INT, (N) } }
#define TB_TYPE_PTRN(N) (TB_DataType){ { TB_PTR, (N) } }
#endif
typedef void (*TB_PrintCallback)(void* user_data, const char* fmt, ...);
// defined in common/arena.h
typedef struct TB_Arena TB_Arena;
// 0 for default
TB_API void tb_arena_create(TB_Arena* restrict arena, size_t chunk_size);
TB_API void tb_arena_destroy(TB_Arena* restrict arena);
TB_API bool tb_arena_is_empty(TB_Arena* restrict arena);
TB_API void tb_arena_clear(TB_Arena* restrict arena);
////////////////////////////////
// Module management
////////////////////////////////
// Creates a module with the correct target and settings
TB_API TB_Module* tb_module_create(TB_Arch arch, TB_System sys, const TB_FeatureSet* features, bool is_jit);
// Creates a module but defaults on the architecture and system based on the host machine
TB_API TB_Module* tb_module_create_for_host(const TB_FeatureSet* features, bool is_jit);
// Frees all resources for the TB_Module and it's functions, globals and
// compiled code.
TB_API void tb_module_destroy(TB_Module* m);
// When targetting windows & thread local storage, you'll need to bind a tls index
// which is usually just a global that the runtime support has initialized, if you
// dont and the tls_index is used, it'll crash
TB_API void tb_module_set_tls_index(TB_Module* m, ptrdiff_t len, const char* name);
TB_API TB_ModuleSectionHandle tb_module_create_section(TB_Module* m, ptrdiff_t len, const char* name, TB_ModuleSectionFlags flags, TB_ComdatType comdat);
typedef struct {
TB_ThreadInfo* info;
size_t i;
} TB_SymbolIter;
// Lovely iterator for all the symbols... it's probably not "fast"
TB_SymbolIter tb_symbol_iter(TB_Module* mod);
TB_Symbol* tb_symbol_iter_next(TB_SymbolIter* iter);
////////////////////////////////
// Compiled code introspection
////////////////////////////////
enum { TB_ASSEMBLY_CHUNK_CAP = 4*1024 - sizeof(size_t[2]) };
typedef struct TB_Assembly TB_Assembly;
struct TB_Assembly {
TB_Assembly* next;
// nice chunk of text here
size_t length;
char data[];
};
// this is where the machine code and other relevant pieces go.
typedef struct TB_FunctionOutput TB_FunctionOutput;
TB_API void tb_output_print_asm(TB_FunctionOutput* out, FILE* fp);
TB_API uint8_t* tb_output_get_code(TB_FunctionOutput* out, size_t* out_length);
// returns NULL if there's no line info
TB_API TB_Location* tb_output_get_locations(TB_FunctionOutput* out, size_t* out_count);
// returns NULL if no assembly was generated
TB_API TB_Assembly* tb_output_get_asm(TB_FunctionOutput* out);
// this is relative to the start of the function (the start of the prologue)
TB_API TB_Safepoint* tb_safepoint_get(TB_Function* f, uint32_t relative_ip);
////////////////////////////////
// JIT compilation
////////////////////////////////
typedef struct TB_JIT TB_JIT;
typedef struct TB_CPUContext TB_CPUContext;
// passing 0 to jit_heap_capacity will default to 4MiB
TB_API TB_JIT* tb_jit_begin(TB_Module* m, size_t jit_heap_capacity);
TB_API void* tb_jit_place_function(TB_JIT* jit, TB_Function* f);
TB_API void* tb_jit_place_global(TB_JIT* jit, TB_Global* g);
TB_API void tb_jit_dump_heap(TB_JIT* jit);
TB_API void tb_jit_end(TB_JIT* jit);
typedef struct {
TB_Symbol* base;
uint32_t offset;
} TB_ResolvedAddr;
typedef struct {
TB_Function* f;
TB_Location* loc;
uint32_t start, end;
} TB_ResolvedLine;
TB_API TB_ResolvedAddr tb_jit_addr2sym(TB_JIT* jit, void* ptr);
TB_API TB_ResolvedLine tb_jit_addr2line(TB_JIT* jit, void* ptr);
TB_API void* tb_jit_get_code_ptr(TB_Function* f);
typedef enum {
// just keeps running
TB_DBG_NONE,
// stops after one instruction
TB_DBG_INST,
// stops once the line changes
TB_DBG_LINE,
} TB_DbgStep;
// Debugger stuff
// creates a new context we can run JIT code in, you don't
// technically need this but it's a nice helper for writing
// JITs especially when it comes to breakpoints (and eventually
// safepoints)
TB_API TB_CPUContext* tb_jit_thread_create(void* entry, void* arg);
// runs until TB_DbgStep condition is met
TB_API bool tb_jit_thread_resume(TB_JIT* jit, TB_CPUContext* cpu, TB_DbgStep step);
TB_API void* tb_jit_thread_pc(TB_CPUContext* cpu);
TB_API void tb_jit_breakpoint(TB_JIT* jit, void* addr);
TB_API void tb_jit_thread_dump_stack(TB_JIT* jit, TB_CPUContext* cpu);
////////////////////////////////
// Disassembler
////////////////////////////////
TB_API ptrdiff_t tb_print_disassembly_inst(TB_Arch arch, size_t length, const void* ptr);
////////////////////////////////
// Exporter
////////////////////////////////
// Export buffers are generated in chunks because it's easier, usually the
// chunks are "massive" (representing some connected piece of the buffer)
// but they don't have to be.
typedef struct TB_ExportChunk TB_ExportChunk;
struct TB_ExportChunk {
TB_ExportChunk* next;
size_t pos, size;
uint8_t data[];
};
typedef struct {
size_t total;
TB_ExportChunk *head, *tail;
} TB_ExportBuffer;
TB_API TB_ExportBuffer tb_module_object_export(TB_Module* m, TB_DebugFormat debug_fmt);
TB_API bool tb_export_buffer_to_file(TB_ExportBuffer buffer, const char* path);
TB_API void tb_export_buffer_free(TB_ExportBuffer buffer);
////////////////////////////////
// Linker exporter
////////////////////////////////
// This is used to export shared objects or executables
typedef struct TB_Linker TB_Linker;
typedef struct TB_LinkerSection TB_LinkerSection;
typedef struct TB_LinkerSectionPiece TB_LinkerSectionPiece;
typedef struct {
enum {
TB_LINKER_MSG_NULL,
// pragma comment(lib, "blah")
TB_LINKER_MSG_IMPORT,
} tag;
union {
// pragma lib request
TB_Slice import_path;
};
} TB_LinkerMsg;
TB_API TB_ExecutableType tb_system_executable_format(TB_System s);
TB_API TB_Linker* tb_linker_create(TB_ExecutableType type, TB_Arch arch);
TB_API TB_ExportBuffer tb_linker_export(TB_Linker* l);
TB_API void tb_linker_destroy(TB_Linker* l);
TB_API bool tb_linker_get_msg(TB_Linker* l, TB_LinkerMsg* msg);
// windows only
TB_API void tb_linker_set_subsystem(TB_Linker* l, TB_WindowsSubsystem subsystem);
TB_API void tb_linker_set_entrypoint(TB_Linker* l, const char* name);
// Links compiled module into output
TB_API void tb_linker_append_module(TB_Linker* l, TB_Module* m);
// Adds object file to output
TB_API void tb_linker_append_object(TB_Linker* l, TB_Slice obj_name, TB_Slice content);
// Adds static library to output
// this can include imports (wrappers for DLL symbols) along with
// normal sections.
TB_API void tb_linker_append_library(TB_Linker* l, TB_Slice ar_name, TB_Slice content);
////////////////////////////////
// Symbols
////////////////////////////////
TB_API TB_Global* tb_extern_transmute(TB_External* e, TB_DebugType* dbg_type, TB_Linkage linkage);
TB_API TB_External* tb_extern_create(TB_Module* m, ptrdiff_t len, const char* name, TB_ExternalType type);
TB_API TB_SourceFile* tb_get_source_file(TB_Module* m, const char* path);
// Called once you're done with TB operations on a thread (or i guess when it's
// about to be killed :p), not calling it can only result in leaks on that thread
// and calling it too early will result in TB potentially reallocating it but there's
// should be no crashes from this, just potential slowdown or higher than expected memory
// usage.
TB_API void tb_free_thread_resources(void);
////////////////////////////////
// Function Prototypes
////////////////////////////////
typedef struct TB_PrototypeParam {
TB_DataType dt;
TB_DebugType* debug_type;
// does not apply for returns
const char* name;
} TB_PrototypeParam;
struct TB_FunctionPrototype {
// header
TB_CallingConv call_conv;
uint16_t return_count, param_count;
bool has_varargs;
// params are directly followed by returns
TB_PrototypeParam params[];
};
#define TB_PROTOTYPE_RETURNS(p) ((p)->params + (p)->param_count)
// creates a function prototype used to define a function's parameters and returns.
//
// function prototypes do not get freed individually and last for the entire run
// of the backend, they can also be reused for multiple functions which have
// matching signatures.
TB_API TB_FunctionPrototype* tb_prototype_create(TB_Module* m, TB_CallingConv cc, size_t param_count, const TB_PrototypeParam* params, size_t return_count, const TB_PrototypeParam* returns, bool has_varargs);
// same as tb_function_set_prototype except it will handle lowering from types like the TB_DebugType
// into the correct ABI and exposing sane looking nodes to the parameters.
//
// returns the parameters
TB_API TB_Node** tb_function_set_prototype_from_dbg(TB_Function* f, TB_ModuleSectionHandle section, TB_DebugType* dbg, TB_Arena* arena, size_t* out_param_count);
TB_API TB_FunctionPrototype* tb_prototype_from_dbg(TB_Module* m, TB_DebugType* dbg);
// used for ABI parameter passing
typedef enum {
// needs a direct value
TB_PASSING_DIRECT,
// needs an address to the value
TB_PASSING_INDIRECT,
// doesn't use this parameter
TB_PASSING_IGNORE,
} TB_PassingRule;
TB_API TB_PassingRule tb_get_passing_rule_from_dbg(TB_Module* mod, TB_DebugType* param_type, bool is_return);
////////////////////////////////
// Globals
////////////////////////////////
TB_API TB_Global* tb_global_create(TB_Module* m, ptrdiff_t len, const char* name, TB_DebugType* dbg_type, TB_Linkage linkage);
// allocate space for the global
TB_API void tb_global_set_storage(TB_Module* m, TB_ModuleSectionHandle section, TB_Global* global, size_t size, size_t align, size_t max_objects);
// returns a buffer which the user can fill to then have represented in the initializer
TB_API void* tb_global_add_region(TB_Module* m, TB_Global* global, size_t offset, size_t size);
// places a relocation for a global at offset, the size of the relocation
// depends on the pointer size
TB_API void tb_global_add_symbol_reloc(TB_Module* m, TB_Global* global, size_t offset, const TB_Symbol* symbol);
TB_API TB_ModuleSectionHandle tb_module_get_text(TB_Module* m);
TB_API TB_ModuleSectionHandle tb_module_get_rdata(TB_Module* m);
TB_API TB_ModuleSectionHandle tb_module_get_data(TB_Module* m);
TB_API TB_ModuleSectionHandle tb_module_get_tls(TB_Module* m);
////////////////////////////////
// Function Attributes
////////////////////////////////
// These are parts of a function that describe metadata for instructions
TB_API void tb_function_attrib_variable(TB_Function* f, TB_Node* n, TB_Node* parent, ptrdiff_t len, const char* name, TB_DebugType* type);
TB_API void tb_function_attrib_scope(TB_Function* f, TB_Node* n, TB_Node* parent);
////////////////////////////////
// Debug info Generation
////////////////////////////////
TB_API TB_DebugType* tb_debug_get_void(TB_Module* m);
TB_API TB_DebugType* tb_debug_get_bool(TB_Module* m);
TB_API TB_DebugType* tb_debug_get_integer(TB_Module* m, bool is_signed, int bits);
TB_API TB_DebugType* tb_debug_get_float(TB_Module* m, TB_FloatFormat fmt);
TB_API TB_DebugType* tb_debug_create_ptr(TB_Module* m, TB_DebugType* base);
TB_API TB_DebugType* tb_debug_create_array(TB_Module* m, TB_DebugType* base, size_t count);
TB_API TB_DebugType* tb_debug_create_alias(TB_Module* m, TB_DebugType* base, ptrdiff_t len, const char* tag);
TB_API TB_DebugType* tb_debug_create_struct(TB_Module* m, ptrdiff_t len, const char* tag);
TB_API TB_DebugType* tb_debug_create_union(TB_Module* m, ptrdiff_t len, const char* tag);
TB_API TB_DebugType* tb_debug_create_field(TB_Module* m, TB_DebugType* type, ptrdiff_t len, const char* name, TB_CharUnits offset);
// returns the array you need to fill with fields
TB_API TB_DebugType** tb_debug_record_begin(TB_Module* m, TB_DebugType* type, size_t count);
TB_API void tb_debug_record_end(TB_DebugType* type, TB_CharUnits size, TB_CharUnits align);
TB_API TB_DebugType* tb_debug_create_func(TB_Module* m, TB_CallingConv cc, size_t param_count, size_t return_count, bool has_varargs);
TB_API TB_DebugType* tb_debug_field_type(TB_DebugType* type);
TB_API size_t tb_debug_func_return_count(TB_DebugType* type);
TB_API size_t tb_debug_func_param_count(TB_DebugType* type);
// you'll need to fill these if you make a function
TB_API TB_DebugType** tb_debug_func_params(TB_DebugType* type);
TB_API TB_DebugType** tb_debug_func_returns(TB_DebugType* type);
////////////////////////////////
// Symbols
////////////////////////////////
// returns NULL if the tag doesn't match
TB_API TB_Function* tb_symbol_as_function(TB_Symbol* s);
TB_API TB_External* tb_symbol_as_external(TB_Symbol* s);
TB_API TB_Global* tb_symbol_as_global(TB_Symbol* s);
////////////////////////////////
// Function IR Generation
////////////////////////////////
TB_API void tb_get_data_type_size(TB_Module* mod, TB_DataType dt, size_t* size, size_t* align);
// the user_data is expected to be a valid FILE*
TB_API void tb_default_print_callback(void* user_data, const char* fmt, ...);
TB_API void tb_inst_location(TB_Function* f, TB_SourceFile* file, int line, int column);
// this is where the STOP will be
TB_API void tb_inst_set_exit_location(TB_Function* f, TB_SourceFile* file, int line, int column);
// if section is NULL, default to .text
TB_API TB_Function* tb_function_create(TB_Module* m, ptrdiff_t len, const char* name, TB_Linkage linkage);
TB_API TB_Arena* tb_function_get_arena(TB_Function* f);
// if len is -1, it's null terminated
TB_API void tb_symbol_set_name(TB_Symbol* s, ptrdiff_t len, const char* name);
TB_API void tb_symbol_bind_ptr(TB_Symbol* s, void* ptr);
TB_API const char* tb_symbol_get_name(TB_Symbol* s);
// if arena is NULL, defaults to module arena which is freed on tb_free_thread_resources
TB_API void tb_function_set_prototype(TB_Function* f, TB_ModuleSectionHandle section, TB_FunctionPrototype* p, TB_Arena* arena);
TB_API TB_FunctionPrototype* tb_function_get_prototype(TB_Function* f);
TB_API void tb_inst_set_control(TB_Function* f, TB_Node* control);
TB_API TB_Node* tb_inst_get_control(TB_Function* f);
TB_API TB_Node* tb_inst_region(TB_Function* f);
// if len is -1, it's null terminated
TB_API void tb_inst_set_region_name(TB_Function* f, TB_Node* n, ptrdiff_t len, const char* name);
TB_API void tb_inst_unreachable(TB_Function* f);
TB_API void tb_inst_debugbreak(TB_Function* f);
TB_API void tb_inst_trap(TB_Function* f);
TB_API TB_Node* tb_inst_poison(TB_Function* f, TB_DataType dt);
TB_API TB_Node* tb_inst_param(TB_Function* f, int param_id);
TB_API TB_Node* tb_inst_fpxt(TB_Function* f, TB_Node* src, TB_DataType dt);
TB_API TB_Node* tb_inst_sxt(TB_Function* f, TB_Node* src, TB_DataType dt);
TB_API TB_Node* tb_inst_zxt(TB_Function* f, TB_Node* src, TB_DataType dt);
TB_API TB_Node* tb_inst_trunc(TB_Function* f, TB_Node* src, TB_DataType dt);
TB_API TB_Node* tb_inst_int2ptr(TB_Function* f, TB_Node* src);
TB_API TB_Node* tb_inst_ptr2int(TB_Function* f, TB_Node* src, TB_DataType dt);
TB_API TB_Node* tb_inst_int2float(TB_Function* f, TB_Node* src, TB_DataType dt, bool is_signed);
TB_API TB_Node* tb_inst_float2int(TB_Function* f, TB_Node* src, TB_DataType dt, bool is_signed);
TB_API TB_Node* tb_inst_bitcast(TB_Function* f, TB_Node* src, TB_DataType dt);
TB_API TB_Node* tb_inst_local(TB_Function* f, TB_CharUnits size, TB_CharUnits align);
TB_API TB_Node* tb_inst_load(TB_Function* f, TB_DataType dt, TB_Node* addr, TB_CharUnits align, bool is_volatile);
TB_API void tb_inst_store(TB_Function* f, TB_DataType dt, TB_Node* addr, TB_Node* val, TB_CharUnits align, bool is_volatile);
TB_API void tb_inst_safepoint_poll(TB_Function* f, TB_Node* addr, int input_count, TB_Node** inputs);
TB_API TB_Node* tb_inst_bool(TB_Function* f, bool imm);
TB_API TB_Node* tb_inst_sint(TB_Function* f, TB_DataType dt, int64_t imm);
TB_API TB_Node* tb_inst_uint(TB_Function* f, TB_DataType dt, uint64_t imm);
TB_API TB_Node* tb_inst_float32(TB_Function* f, float imm);
TB_API TB_Node* tb_inst_float64(TB_Function* f, double imm);
TB_API TB_Node* tb_inst_cstring(TB_Function* f, const char* str);
TB_API TB_Node* tb_inst_string(TB_Function* f, size_t len, const char* str);
// write 'val' over 'count' bytes on 'dst'
TB_API void tb_inst_memset(TB_Function* f, TB_Node* dst, TB_Node* val, TB_Node* count, TB_CharUnits align);
// zero 'count' bytes on 'dst'
TB_API void tb_inst_memzero(TB_Function* f, TB_Node* dst, TB_Node* count, TB_CharUnits align);
// performs a copy of 'count' elements from one memory location to another
// both locations cannot overlap.
TB_API void tb_inst_memcpy(TB_Function* f, TB_Node* dst, TB_Node* src, TB_Node* count, TB_CharUnits align);
// result = base + (index * stride)
TB_API TB_Node* tb_inst_array_access(TB_Function* f, TB_Node* base, TB_Node* index, int64_t stride);
// result = base + offset
// where base is a pointer
TB_API TB_Node* tb_inst_member_access(TB_Function* f, TB_Node* base, int64_t offset);
TB_API TB_Node* tb_inst_get_symbol_address(TB_Function* f, TB_Symbol* target);
// Performs a conditional select between two values, if the operation is
// performed wide then the cond is expected to be the same type as a and b where
// the condition is resolved as true if the MSB (per component) is 1.
//
// result = cond ? a : b
// a, b must match in type
TB_API TB_Node* tb_inst_select(TB_Function* f, TB_Node* cond, TB_Node* a, TB_Node* b);
// Integer arithmatic
TB_API TB_Node* tb_inst_add(TB_Function* f, TB_Node* a, TB_Node* b, TB_ArithmeticBehavior arith_behavior);
TB_API TB_Node* tb_inst_sub(TB_Function* f, TB_Node* a, TB_Node* b, TB_ArithmeticBehavior arith_behavior);
TB_API TB_Node* tb_inst_mul(TB_Function* f, TB_Node* a, TB_Node* b, TB_ArithmeticBehavior arith_behavior);
TB_API TB_Node* tb_inst_div(TB_Function* f, TB_Node* a, TB_Node* b, bool signedness);
TB_API TB_Node* tb_inst_mod(TB_Function* f, TB_Node* a, TB_Node* b, bool signedness);
// Bitmagic operations
TB_API TB_Node* tb_inst_bswap(TB_Function* f, TB_Node* n);
TB_API TB_Node* tb_inst_clz(TB_Function* f, TB_Node* n);
TB_API TB_Node* tb_inst_ctz(TB_Function* f, TB_Node* n);
TB_API TB_Node* tb_inst_popcount(TB_Function* f, TB_Node* n);
// Bitwise operations
TB_API TB_Node* tb_inst_not(TB_Function* f, TB_Node* n);
TB_API TB_Node* tb_inst_neg(TB_Function* f, TB_Node* n);
TB_API TB_Node* tb_inst_and(TB_Function* f, TB_Node* a, TB_Node* b);
TB_API TB_Node* tb_inst_or(TB_Function* f, TB_Node* a, TB_Node* b);
TB_API TB_Node* tb_inst_xor(TB_Function* f, TB_Node* a, TB_Node* b);
TB_API TB_Node* tb_inst_sar(TB_Function* f, TB_Node* a, TB_Node* b);
TB_API TB_Node* tb_inst_shl(TB_Function* f, TB_Node* a, TB_Node* b, TB_ArithmeticBehavior arith_behavior);
TB_API TB_Node* tb_inst_shr(TB_Function* f, TB_Node* a, TB_Node* b);
TB_API TB_Node* tb_inst_rol(TB_Function* f, TB_Node* a, TB_Node* b);
TB_API TB_Node* tb_inst_ror(TB_Function* f, TB_Node* a, TB_Node* b);
// Atomics
// By default you can use TB_MEM_ORDER_SEQ_CST for the memory order to get
// correct but possibly slower results on certain platforms (those with relaxed
// memory models).
// Must be aligned to the natural alignment of dt
TB_API TB_Node* tb_inst_atomic_load(TB_Function* f, TB_Node* addr, TB_DataType dt, TB_MemoryOrder order);
// All atomic operations here return the old value and the operations are
// performed in the same data type as 'src' with alignment of 'addr' being
// the natural alignment of 'src'
TB_API TB_Node* tb_inst_atomic_xchg(TB_Function* f, TB_Node* addr, TB_Node* src, TB_MemoryOrder order);
TB_API TB_Node* tb_inst_atomic_add(TB_Function* f, TB_Node* addr, TB_Node* src, TB_MemoryOrder order);
TB_API TB_Node* tb_inst_atomic_sub(TB_Function* f, TB_Node* addr, TB_Node* src, TB_MemoryOrder order);
TB_API TB_Node* tb_inst_atomic_and(TB_Function* f, TB_Node* addr, TB_Node* src, TB_MemoryOrder order);
TB_API TB_Node* tb_inst_atomic_xor(TB_Function* f, TB_Node* addr, TB_Node* src, TB_MemoryOrder order);
TB_API TB_Node* tb_inst_atomic_or(TB_Function* f, TB_Node* addr, TB_Node* src, TB_MemoryOrder order);
// returns old_value from *addr
TB_API TB_Node* tb_inst_atomic_cmpxchg(TB_Function* f, TB_Node* addr, TB_Node* expected, TB_Node* desired, TB_MemoryOrder succ, TB_MemoryOrder fail);
// Float math
TB_API TB_Node* tb_inst_fadd(TB_Function* f, TB_Node* a, TB_Node* b);
TB_API TB_Node* tb_inst_fsub(TB_Function* f, TB_Node* a, TB_Node* b);
TB_API TB_Node* tb_inst_fmul(TB_Function* f, TB_Node* a, TB_Node* b);
TB_API TB_Node* tb_inst_fdiv(TB_Function* f, TB_Node* a, TB_Node* b);
// Comparisons
TB_API TB_Node* tb_inst_cmp_eq(TB_Function* f, TB_Node* a, TB_Node* b);
TB_API TB_Node* tb_inst_cmp_ne(TB_Function* f, TB_Node* a, TB_Node* b);
TB_API TB_Node* tb_inst_cmp_ilt(TB_Function* f, TB_Node* a, TB_Node* b, bool signedness);
TB_API TB_Node* tb_inst_cmp_ile(TB_Function* f, TB_Node* a, TB_Node* b, bool signedness);
TB_API TB_Node* tb_inst_cmp_igt(TB_Function* f, TB_Node* a, TB_Node* b, bool signedness);
TB_API TB_Node* tb_inst_cmp_ige(TB_Function* f, TB_Node* a, TB_Node* b, bool signedness);
TB_API TB_Node* tb_inst_cmp_flt(TB_Function* f, TB_Node* a, TB_Node* b);
TB_API TB_Node* tb_inst_cmp_fle(TB_Function* f, TB_Node* a, TB_Node* b);
TB_API TB_Node* tb_inst_cmp_fgt(TB_Function* f, TB_Node* a, TB_Node* b);
TB_API TB_Node* tb_inst_cmp_fge(TB_Function* f, TB_Node* a, TB_Node* b);
// General intrinsics
TB_API TB_Node* tb_inst_va_start(TB_Function* f, TB_Node* a);
TB_API TB_Node* tb_inst_cycle_counter(TB_Function* f);
TB_API TB_Node* tb_inst_prefetch(TB_Function* f, TB_Node* addr, int level);
// x86 Intrinsics
TB_API TB_Node* tb_inst_x86_ldmxcsr(TB_Function* f, TB_Node* a);
TB_API TB_Node* tb_inst_x86_stmxcsr(TB_Function* f);
TB_API TB_Node* tb_inst_x86_sqrt(TB_Function* f, TB_Node* a);
TB_API TB_Node* tb_inst_x86_rsqrt(TB_Function* f, TB_Node* a);
// Control flow
TB_API TB_Node* tb_inst_syscall(TB_Function* f, TB_DataType dt, TB_Node* syscall_num, size_t param_count, TB_Node** params);
TB_API TB_MultiOutput tb_inst_call(TB_Function* f, TB_FunctionPrototype* proto, TB_Node* target, size_t param_count, TB_Node** params);
TB_API void tb_inst_tailcall(TB_Function* f, TB_FunctionPrototype* proto, TB_Node* target, size_t param_count, TB_Node** params);
TB_API TB_Node* tb_inst_safepoint(TB_Function* f, TB_Node* poke_site, size_t param_count, TB_Node** params);
TB_API TB_Node* tb_inst_incomplete_phi(TB_Function* f, TB_DataType dt, TB_Node* region, size_t preds);
TB_API bool tb_inst_add_phi_operand(TB_Function* f, TB_Node* phi, TB_Node* region, TB_Node* val);
TB_API TB_Node* tb_inst_phi2(TB_Function* f, TB_Node* region, TB_Node* a, TB_Node* b);
TB_API void tb_inst_goto(TB_Function* f, TB_Node* target);
TB_API void tb_inst_if(TB_Function* f, TB_Node* cond, TB_Node* true_case, TB_Node* false_case);
TB_API void tb_inst_branch(TB_Function* f, TB_DataType dt, TB_Node* key, TB_Node* default_case, size_t entry_count, const TB_SwitchEntry* keys);
TB_API void tb_inst_ret(TB_Function* f, size_t count, TB_Node** values);
////////////////////////////////
// Passes
////////////////////////////////
typedef enum {
// allowed to remove PHIs nodes, this is
// helpful because the default IR building
// will produce tons of useless memory PHIs.
TB_PEEPHOLE_PHI = 1,
// it's allowed to fold memory operations (store or load elimination)
TB_PEEPHOLE_MEMORY = 2,
// just do every reduction rule i can provide you
TB_PEEPHOLE_ALL = 7,
} TB_PeepholeFlags;
// Function analysis, optimizations, and codegen are all part of this
typedef struct TB_Passes TB_Passes;
// the arena is used to allocate the nodes while passes are being done.
TB_API TB_Passes* tb_pass_enter(TB_Function* f, TB_Arena* arena);
TB_API void tb_pass_exit(TB_Passes* opt);
// transformation passes:
// peephole: 99% of the optimizer, i'm sea of nodes pilled so i
// break down most optimizations into local rewrites, it's
// incremental and recommended to run after any non-peephole
// pass.
//
// mem2reg: lowers TB_LOCALs into SoN values, this makes more
// data flow analysis possible on the code and allows to codegen
// to place variables into registers.
//
// SROA: splits LOCALs into multiple to allow for more dataflow
// analysis later on.
TB_API void tb_pass_peephole(TB_Passes* opt, TB_PeepholeFlags flags);
TB_API void tb_pass_sroa(TB_Passes* opt);
TB_API bool tb_pass_mem2reg(TB_Passes* opt);
TB_API bool tb_pass_loop(TB_Passes* opt);
// this just runs the optimizer in the default configuration
TB_API void tb_pass_optimize(TB_Passes* opt);
// analysis
// print: prints IR in a flattened text form.
TB_API bool tb_pass_print(TB_Passes* opt);
// print-dot: prints IR as DOT
TB_API void tb_pass_print_dot(TB_Passes* opt, TB_PrintCallback callback, void* user_data);
// codegen
TB_API TB_FunctionOutput* tb_pass_codegen(TB_Passes* opt, bool emit_asm);
TB_API void tb_pass_kill_node(TB_Passes* opt, TB_Node* n);
TB_API void tb_pass_mark(TB_Passes* opt, TB_Node* n);
TB_API void tb_pass_mark_users(TB_Passes* opt, TB_Node* n);
////////////////////////////////
// IR access
////////////////////////////////
TB_API const char* tb_node_get_name(TB_Node* n);
TB_API TB_Node* tb_get_parent_region(TB_Node* n);
TB_API bool tb_node_is_constant_non_zero(TB_Node* n);
TB_API bool tb_node_is_constant_zero(TB_Node* n);
#endif /* TB_CORE_H */
|