/
mojoshader_compiler.c
2417 lines (2109 loc) · 75.9 KB
1
2
3
4
5
6
7
8
9
/**
* MojoShader; generate shader programs from bytecode of compiled
* Direct3D shaders.
*
* Please see the file LICENSE.txt in the source's root directory.
*
* This file written by Ryan C. Gordon.
*/
10
11
#define __MOJOSHADER_INTERNAL__ 1
#include "mojoshader_internal.h"
12
13
14
15
16
#if DEBUG_COMPILER_PARSER
#define LEMON_SUPPORT_TRACING 1
#endif
17
typedef union TokenData
18
{
19
20
21
int64 i64;
double dbl;
const char *string;
22
23
} TokenData;
24
25
26
27
28
29
typedef struct StringBucket
{
char *string;
struct StringBucket *next;
} StringBucket;
30
31
// Structures that make up the parse tree...
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
typedef enum ASTNodeType
{
AST_OP_START_RANGE,
AST_OP_START_RANGE_UNARY,
AST_OP_POSTINCREMENT,
AST_OP_POSTDECREMENT,
AST_OP_PREINCREMENT,
AST_OP_PREDECREMENT,
AST_OP_NEGATE,
AST_OP_COMPLEMENT,
AST_OP_NOT,
AST_OP_END_RANGE_UNARY,
AST_OP_START_RANGE_BINARY,
AST_OP_DEREF_ARRAY,
AST_OP_CALLFUNC,
AST_OP_DEREF_STRUCT,
AST_OP_COMMA,
AST_OP_MULTIPLY,
AST_OP_DIVIDE,
AST_OP_MODULO,
AST_OP_ADD,
AST_OP_SUBTRACT,
AST_OP_LSHIFT,
AST_OP_RSHIFT,
AST_OP_LESSTHAN,
AST_OP_GREATERTHAN,
AST_OP_LESSTHANOREQUAL,
AST_OP_GREATERTHANOREQUAL,
AST_OP_EQUAL,
AST_OP_NOTEQUAL,
AST_OP_BINARYAND,
AST_OP_BINARYXOR,
AST_OP_BINARYOR,
AST_OP_LOGICALAND,
AST_OP_LOGICALOR,
AST_OP_ASSIGN,
AST_OP_MULASSIGN,
AST_OP_DIVASSIGN,
AST_OP_MODASSIGN,
AST_OP_ADDASSIGN,
AST_OP_SUBASSIGN,
AST_OP_LSHIFTASSIGN,
AST_OP_RSHIFTASSIGN,
AST_OP_ANDASSIGN,
AST_OP_XORASSIGN,
AST_OP_ORASSIGN,
AST_OP_END_RANGE_BINARY,
AST_OP_START_RANGE_TERNARY,
AST_OP_CONDITIONAL,
AST_OP_END_RANGE_TERNARY,
AST_OP_START_RANGE_DATA,
AST_OP_IDENTIFIER,
AST_OP_INT_LITERAL,
AST_OP_FLOAT_LITERAL,
AST_OP_STRING_LITERAL,
AST_OP_END_RANGE_DATA,
AST_OP_START_RANGE_MISC,
AST_OP_CONSTRUCTOR,
AST_OP_CAST,
AST_OP_END_RANGE_MISC,
AST_OP_END_RANGE,
AST_COMPUNIT_START_RANGE,
AST_COMPUNIT_FUNCTION, // function declaration or definition
AST_COMPUNIT_TYPEDEF, // typedef or struct
AST_COMPUNIT_STRUCT, // global struct
AST_COMPUNIT_VARIABLE, // global variable
AST_COMPUNIT_END_RANGE,
AST_STATEMENT_START_RANGE,
AST_STATEMENT_EMPTY,
AST_STATEMENT_EXPRESSION,
AST_STATEMENT_IF,
AST_STATEMENT_SWITCH,
AST_STATEMENT_FOR,
AST_STATEMENT_DO,
AST_STATEMENT_WHILE,
AST_STATEMENT_RETURN,
AST_STATEMENT_BREAK,
AST_STATEMENT_CONTINUE,
AST_STATEMENT_DISCARD,
AST_STATEMENT_TYPEDEF,
AST_STATEMENT_STRUCT,
AST_STATEMENT_VARDECL,
AST_STATEMENT_END_RANGE,
AST_MISC_START_RANGE,
AST_FUNCTION_ARGS,
AST_FUNCTION_SIGNATURE,
AST_SCALAR_OR_ARRAY,
AST_TYPEDEF,
AST_PACK_OFFSET,
AST_VARIABLE_LOWLEVEL,
AST_ANNOTATION,
AST_VARIABLE_DECLARATION,
AST_STRUCT_DECLARATION,
AST_STRUCT_MEMBER,
AST_SWITCH_CASE,
AST_MISC_END_RANGE,
AST_END_RANGE
} ASTNodeType;
typedef struct ASTNode
{
ASTNodeType type;
const char *filename;
uint32 line;
} ASTNode;
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
typedef enum VariableAttributes
{
VARATTR_EXTERN = (1 << 0),
VARATTR_NOINTERPOLATION = (1 << 1),
VARATTR_SHARED = (1 << 2),
VARATTR_STATIC = (1 << 3),
VARATTR_UNIFORM = (1 << 4),
VARATTR_VOLATILE = (1 << 5),
VARATTR_CONST = (1 << 6),
VARATTR_ROWMAJOR = (1 << 7),
VARATTR_COLUMNMAJOR = (1 << 8)
} VariableAttributes;
typedef enum IfAttributes
{
IFATTR_NONE,
IFATTR_BRANCH,
IFATTR_FLATTEN,
IFATTR_IFALL,
IFATTR_IFANY,
IFATTR_PREDICATE,
IFATTR_PREDICATEBLOCK,
} IfAttributes;
typedef enum SwitchAttributes
{
SWITCHATTR_NONE,
SWITCHATTR_FLATTEN,
SWITCHATTR_BRANCH,
SWITCHATTR_FORCECASE,
SWITCHATTR_CALL
} SwitchAttributes;
180
static inline int operator_is_unary(const ASTNodeType op)
181
{
182
return ((op > AST_OP_START_RANGE_UNARY) && (op < AST_OP_END_RANGE_UNARY));
183
184
} // operator_is_unary
185
static inline int operator_is_binary(const ASTNodeType op)
186
{
187
return ((op > AST_OP_START_RANGE_BINARY) && (op < AST_OP_END_RANGE_BINARY));
188
189
} // operator_is_binary
190
static inline int operator_is_ternary(const ASTNodeType op)
191
{
192
return ((op > AST_OP_START_RANGE_TERNARY) && (op < AST_OP_END_RANGE_TERNARY));
193
194
} // operator_is_ternary
195
typedef struct ASTGeneric
196
{
197
198
199
200
ASTNode ast;
} ASTGeneric;
typedef ASTGeneric Expression;
201
202
203
typedef struct ExpressionUnary
{
204
ASTNode ast;
205
206
207
208
209
Expression *operand;
} ExpressionUnary;
typedef struct ExpressionBinary
{
210
ASTNode ast;
211
212
213
214
215
216
Expression *left;
Expression *right;
} ExpressionBinary;
typedef struct ExpressionTernary
{
217
ASTNode ast;
218
219
220
221
222
223
224
Expression *left;
Expression *center;
Expression *right;
} ExpressionTernary;
typedef struct ExpressionIdentifier
{
225
ASTNode ast; // Always AST_OP_IDENTIFIER
226
227
228
229
230
const char *identifier;
} ExpressionIdentifier;
typedef struct ExpressionIntLiteral
{
231
ASTNode ast; // Always AST_OP_INT_LITERAL
232
233
234
235
236
int64 value;
} ExpressionIntLiteral;
typedef struct ExpressionFloatLiteral
{
237
ASTNode ast; // Always AST_OP_FLOAT_LITERAL
238
239
240
241
242
double value;
} ExpressionFloatLiteral;
typedef struct ExpressionStringLiteral
{
243
ASTNode ast; // Always AST_OP_STRING_LITERAL
244
245
246
const char *string;
} ExpressionStringLiteral;
247
248
typedef struct ExpressionConstructor
{
249
ASTNode ast; // Always AST_OP_CONSTRUCTOR
250
251
252
253
254
255
const char *datatype;
Expression *args;
} ExpressionConstructor;
typedef struct ExpressionCast
{
256
ASTNode ast; // Always AST_OP_CAST
257
258
259
260
const char *datatype;
Expression *operand;
} ExpressionCast;
261
262
typedef struct CompilationUnit
{
263
ASTNode ast;
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
struct CompilationUnit *next;
} CompilationUnit;
typedef enum FunctionStorageClass
{
FNSTORECLS_NONE,
FNSTORECLS_INLINE
} FunctionStorageClass;
typedef enum InputModifier
{
INPUTMOD_NONE,
INPUTMOD_IN,
INPUTMOD_OUT,
INPUTMOD_INOUT,
INPUTMOD_UNIFORM
} InputModifier;
typedef enum InterpolationModifier
{
INTERPMOD_NONE,
INTERPMOD_LINEAR,
INTERPMOD_CENTROID,
INTERPMOD_NOINTERPOLATION,
INTERPMOD_NOPERSPECTIVE,
INTERPMOD_SAMPLE
} InterpolationModifier;
typedef struct FunctionArguments
{
294
ASTNode ast;
295
296
297
298
299
300
301
302
303
304
305
InputModifier input_modifier;
const char *datatype;
const char *identifier;
const char *semantic;
InterpolationModifier interpolation_modifier;
Expression *initializer;
struct FunctionArguments *next;
} FunctionArguments;
typedef struct FunctionSignature
{
306
ASTNode ast;
307
308
309
310
311
312
313
314
315
const char *datatype;
const char *identifier;
FunctionArguments *args;
FunctionStorageClass storage_class;
const char *semantic;
} FunctionSignature;
typedef struct ScalarOrArray
{
316
ASTNode ast;
317
318
319
320
321
322
323
const char *identifier;
int isarray;
Expression *dimension;
} ScalarOrArray;
typedef struct Annotations
{
324
ASTNode ast;
325
326
327
328
329
330
331
const char *datatype;
Expression *initializer;
struct Annotations *next;
} Annotations;
typedef struct PackOffset
{
332
ASTNode ast;
333
334
335
336
337
338
const char *ident1; // !!! FIXME: rename this.
const char *ident2;
} PackOffset;
typedef struct VariableLowLevel
{
339
ASTNode ast;
340
341
342
343
344
345
PackOffset *packoffset;
const char *register_name;
} VariableLowLevel;
typedef struct StructMembers
{
346
ASTNode ast;
347
348
349
350
351
352
353
354
355
const char *datatype;
const char *semantic;
ScalarOrArray *details;
InterpolationModifier interpolation_mod;
struct StructMembers *next;
} StructMembers;
typedef struct StructDeclaration
{
356
ASTNode ast;
357
358
359
360
361
362
const char *name;
StructMembers *members;
} StructDeclaration;
typedef struct VariableDeclaration
{
363
ASTNode ast;
364
365
366
367
368
369
370
371
372
373
374
375
376
int attributes;
const char *datatype;
StructDeclaration *anonymous_datatype;
ScalarOrArray *details;
const char *semantic;
Annotations *annotations;
Expression *initializer;
VariableLowLevel *lowlevel;
struct VariableDeclaration *next;
} VariableDeclaration;
typedef struct Statement
{
377
ASTNode ast;
378
379
380
381
382
383
384
385
386
387
struct Statement *next;
} Statement;
typedef Statement EmptyStatement;
typedef Statement BreakStatement;
typedef Statement ContinueStatement;
typedef Statement DiscardStatement;
typedef struct ReturnStatement
{
388
ASTNode ast;
389
390
391
392
393
394
struct Statement *next;
Expression *expr;
} ReturnStatement;
typedef struct ExpressionStatement
{
395
ASTNode ast;
396
397
398
399
400
401
struct Statement *next;
Expression *expr;
} ExpressionStatement;
typedef struct IfStatement
{
402
ASTNode ast;
403
404
405
406
407
408
409
410
411
struct Statement *next;
int attributes;
Expression *expr;
Statement *statement;
Statement *else_statement;
} IfStatement;
typedef struct SwitchCases
{
412
ASTNode ast;
413
414
415
416
417
418
419
Expression *expr;
Statement *statement;
struct SwitchCases *next;
} SwitchCases;
typedef struct SwitchStatement
{
420
ASTNode ast;
421
422
423
424
425
426
427
428
struct Statement *next;
int attributes;
Expression *expr;
SwitchCases *cases;
} SwitchStatement;
typedef struct WhileStatement
{
429
ASTNode ast;
430
431
432
433
434
435
436
437
438
439
struct Statement *next;
int64 unroll; // # times to unroll, 0 to loop, -1 for compiler's choice.
Expression *expr;
Statement *statement;
} WhileStatement;
typedef WhileStatement DoStatement;
typedef struct ForStatement
{
440
ASTNode ast;
441
442
443
444
445
446
447
448
449
450
451
struct Statement *next;
int64 unroll; // # times to unroll, 0 to loop, -1 for compiler's choice.
VariableDeclaration *var_decl;
Expression *initializer;
Expression *looptest;
Expression *counter;
Statement *statement;
} ForStatement;
typedef struct Typedef
{
452
ASTNode ast;
453
454
455
456
457
458
459
int isconst;
const char *datatype;
ScalarOrArray *details;
} Typedef;
typedef struct TypedefStatement
{
460
ASTNode ast;
461
462
463
464
465
466
struct Statement *next;
Typedef *type_info;
} TypedefStatement;
typedef struct VarDeclStatement
{
467
ASTNode ast;
468
469
470
471
472
473
struct Statement *next;
VariableDeclaration *decl;
} VarDeclStatement;
typedef struct StructStatement
{
474
ASTNode ast;
475
476
477
478
479
480
struct Statement *next;
StructDeclaration *struct_info;
} StructStatement;
typedef struct CompilationUnitFunction
{
481
ASTNode ast;
482
483
484
485
486
487
488
struct CompilationUnit *next;
FunctionSignature *declaration;
Statement *definition;
} CompilationUnitFunction;
typedef struct CompilationUnitTypedef
{
489
ASTNode ast;
490
491
492
493
494
495
struct CompilationUnit *next;
Typedef *type_info;
} CompilationUnitTypedef;
typedef struct CompilationUnitStruct
{
496
ASTNode ast;
497
498
499
500
501
502
struct CompilationUnit *next;
StructDeclaration *struct_info;
} CompilationUnitStruct;
typedef struct CompilationUnitVariable
{
503
ASTNode ast;
504
505
506
507
508
struct CompilationUnit *next;
VariableDeclaration *declaration;
} CompilationUnitVariable;
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
// This tracks typedefs and structs, and notes when they enter/leave scope.
typedef struct UserTypeScopeStack
{
const char *symbol;
const char *datatype;
struct UserTypeScopeStack *next;
} UserTypeScopeStack;
typedef struct UserTypeMap
{
HashTable *types;
UserTypeScopeStack *scope;
} UserTypeMap;
525
526
527
528
529
530
531
532
533
534
535
536
// Compile state, passed around all over the place.
typedef struct Context
{
int isfail;
int out_of_memory;
MOJOSHADER_malloc malloc;
MOJOSHADER_free free;
void *malloc_data;
int error_count;
ErrorList *errors;
StringBucket *string_hashtable[256];
537
538
const char *sourcefile; // current source file that we're parsing.
unsigned int sourceline; // current line in sourcefile that we're parsing.
539
UserTypeMap usertypes;
540
541
542
543
544
545
546
547
CompilationUnit *ast; // Abstract Syntax Tree
} Context;
// Convenience functions for allocators...
static inline void out_of_memory(Context *ctx)
{
548
if (!ctx->out_of_memory) printf("out of memory\n"); // !!! FIXME: placeholder.
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
ctx->isfail = ctx->out_of_memory = 1;
} // out_of_memory
static inline void *Malloc(Context *ctx, const size_t len)
{
void *retval = ctx->malloc((int) len, ctx->malloc_data);
if (retval == NULL)
out_of_memory(ctx);
return retval;
} // Malloc
static inline char *StrDup(Context *ctx, const char *str)
{
char *retval = (char *) Malloc(ctx, strlen(str) + 1);
if (retval != NULL)
strcpy(retval, str);
return retval;
} // StrDup
static inline void Free(Context *ctx, void *ptr)
{
if (ptr != NULL) // check for NULL in case of dumb free() impl.
ctx->free(ptr, ctx->malloc_data);
} // Free
574
575
576
577
static void fail(Context *ctx, const char *str)
{
// !!! FIXME: placeholder.
(void) ctx;
578
printf("%s:%u: %s\n", ctx->sourcefile, ctx->sourceline, str);
579
} // fail
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
static void usertypemap_nuke(const void *k, const void *v) { /* no-op. */ }
static int create_usertypemap(Context *ctx)
{
UserTypeMap *map = &ctx->usertypes;
map->scope = NULL;
map->types = hash_create(255, hash_hash_string, hash_keymatch_string,
usertypemap_nuke, 1, ctx->malloc, ctx->free,
ctx->malloc_data);
if (!map->types)
{
out_of_memory(ctx);
return 0;
} // if
return 1;
} // create_usertypemap
static void push_usertype(Context *ctx, const char *sym, const char *datatype)
{
UserTypeMap *map = &ctx->usertypes;
UserTypeScopeStack *item;
item = (UserTypeScopeStack *) Malloc(ctx, sizeof (UserTypeScopeStack));
if (item == NULL)
return;
if (sym != NULL)
{
if (hash_insert(map->types, sym, datatype) == -1)
{
Free(ctx, item);
return;
}
} // if
item->symbol = sym; // cached strings, don't copy.
item->datatype = datatype;
item->next = map->scope;
map->scope = item;
} // push_usertype
static void pop_usertype(Context *ctx)
{
UserTypeMap *map = &ctx->usertypes;
UserTypeScopeStack *item = map->scope;
if (!item)
return;
if (item->symbol)
hash_remove(map->types, item->symbol);
map->scope = item->next;
Free(ctx, item);
} // pop_usertype
static void push_scope(Context *ctx)
{
push_usertype(ctx, NULL, NULL);
} // push_scope
static void pop_scope(Context *ctx)
{
UserTypeMap *map = &ctx->usertypes;
while ((map->scope) && (map->scope->symbol))
pop_usertype(ctx);
647
648
649
650
assert(map->scope != NULL);
assert(map->scope->symbol == NULL);
pop_usertype(ctx);
651
652
653
654
655
656
657
658
659
660
661
} // push_scope
static void destroy_usertypemap(Context *ctx)
{
UserTypeMap *map = &ctx->usertypes;
while (map->scope)
pop_usertype(ctx);
hash_destroy(map->types);
} // destroy_usertypemap
662
663
664
665
666
// These functions are mostly for construction and cleanup of nodes in the
// parse tree. Mostly this is simple allocation and initialization, so we
// can do as little in the lemon code as possible, and then sort it all out
// afterwards.
667
#define NEW_AST_NODE(retval, cls, typ) \
668
cls *retval = Malloc(ctx, sizeof (cls)); \
669
670
671
672
673
674
675
676
do { \
if (retval == NULL) { return NULL; } \
retval->ast.type = typ; \
retval->ast.filename = ctx->sourcefile; \
retval->ast.line = ctx->sourceline; \
} while (0)
#define DELETE_AST_NODE(cls) do { \
677
678
679
680
681
682
if (!cls) return; \
} while (0)
static void delete_compilation_unit(Context *ctx, CompilationUnit *unit);
static void delete_statement(Context *ctx, Statement *stmt);
683
684
685
static Expression *new_constructor_expr(Context *ctx, const char *datatype,
Expression *args)
{
686
NEW_AST_NODE(retval, ExpressionConstructor, AST_OP_CONSTRUCTOR);
687
688
689
690
691
692
693
694
retval->datatype = datatype;
retval->args = args;
return (Expression *) retval;
} // new_constructor_expr
static Expression *new_cast_expr(Context *ctx, const char *datatype,
Expression *operand)
{
695
NEW_AST_NODE(retval, ExpressionCast, AST_OP_CAST);
696
697
698
699
700
retval->datatype = datatype;
retval->operand = operand;
return (Expression *) retval;
} // new_cast_expr
701
static Expression *new_unary_expr(Context *ctx, const ASTNodeType op,
702
703
Expression *operand)
{
704
NEW_AST_NODE(retval, ExpressionUnary, op);
705
706
707
708
709
assert(operator_is_unary(op));
retval->operand = operand;
return (Expression *) retval;
} // new_unary_expr
710
static Expression *new_binary_expr(Context *ctx, const ASTNodeType op,
711
712
Expression *left, Expression *right)
{
713
NEW_AST_NODE(retval, ExpressionBinary, op);
714
715
716
717
718
719
assert(operator_is_binary(op));
retval->left = left;
retval->right = right;
return (Expression *) retval;
} // new_binary_expr
720
static Expression *new_ternary_expr(Context *ctx, const ASTNodeType op,
721
722
723
Expression *left, Expression *center,
Expression *right)
{
724
NEW_AST_NODE(retval, ExpressionTernary, op);
725
726
727
728
729
730
731
732
733
assert(operator_is_ternary(op));
retval->left = left;
retval->center = center;
retval->right = right;
return (Expression *) retval;
} // new_ternary_expr
static Expression *new_identifier_expr(Context *ctx, const char *string)
{
734
NEW_AST_NODE(retval, ExpressionIdentifier, AST_OP_IDENTIFIER);
735
736
737
738
739
740
retval->identifier = string; // cached; don't copy string.
return (Expression *) retval;
} // new_identifier_expr
static Expression *new_literal_int_expr(Context *ctx, const int64 value)
{
741
NEW_AST_NODE(retval, ExpressionIntLiteral, AST_OP_INT_LITERAL);
742
743
744
745
746
747
retval->value = value;
return (Expression *) retval;
} // new_literal_int_expr
static Expression *new_literal_float_expr(Context *ctx, const double dbl)
{
748
NEW_AST_NODE(retval, ExpressionFloatLiteral, AST_OP_FLOAT_LITERAL);
749
750
751
752
753
754
retval->value = dbl;
return (Expression *) retval;
} // new_literal_float_expr
static Expression *new_literal_string_expr(Context *ctx, const char *string)
{
755
NEW_AST_NODE(retval, ExpressionStringLiteral, AST_OP_STRING_LITERAL);
756
757
758
759
retval->string = string; // cached; don't copy string.
return (Expression *) retval;
} // new_string_literal_expr
760
761
762
static void delete_expr(Context *ctx, Expression *expr)
{
DELETE_AST_NODE(expr);
763
if (operator_is_unary(expr->ast.type))
764
765
766
767
{
const ExpressionUnary *unary = (const ExpressionUnary *) expr;
delete_expr(ctx, unary->operand);
} // if
768
else if (operator_is_binary(expr->ast.type))
769
770
771
772
773
{
const ExpressionBinary *binary = (const ExpressionBinary *) expr;
delete_expr(ctx, binary->left);
delete_expr(ctx, binary->right);
} // else if
774
else if (operator_is_ternary(expr->ast.type))
775
776
777
778
779
780
{
const ExpressionTernary *ternary = (const ExpressionTernary *) expr;
delete_expr(ctx, ternary->left);
delete_expr(ctx, ternary->center);
delete_expr(ctx, ternary->right);
} // else if
781
else if (expr->ast.type == AST_OP_CAST)
782
783
784
{
delete_expr(ctx, ((ExpressionCast *) expr)->operand);
} // else if
785
else if (expr->ast.type == AST_OP_CONSTRUCTOR)
786
787
788
{
delete_expr(ctx, ((ExpressionConstructor *) expr)->args);
} // else if
789
790
791
// rest of operators don't have extra data to free.
792
793
794
795
796
797
798
799
800
801
802
Free(ctx, expr);
} // delete_expr
static FunctionArguments *new_function_arg(Context *ctx,
const InputModifier inputmod,
const char *datatype,
const char *identifier,
const char *semantic,
const InterpolationModifier interpmod,
Expression *initializer)
{
803
NEW_AST_NODE(retval, FunctionArguments, AST_FUNCTION_ARGS);
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
retval->input_modifier = inputmod;
retval->datatype = datatype;
retval->identifier = identifier;
retval->semantic = semantic;
retval->interpolation_modifier = interpmod;
retval->initializer = initializer;
retval->next = NULL;
return retval;
} // new_function_arg
static void delete_function_args(Context *ctx, FunctionArguments *args)
{
DELETE_AST_NODE(args);
delete_function_args(ctx, args->next);
delete_expr(ctx, args->initializer);
Free(ctx, args);
} // delete_function_args
static FunctionSignature *new_function_signature(Context *ctx,
const char *datatype,
const char *identifier,
FunctionArguments *args)
{
827
NEW_AST_NODE(retval, FunctionSignature, AST_FUNCTION_SIGNATURE);
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
retval->datatype = datatype;
retval->identifier = identifier;
retval->args = args;
retval->storage_class = FNSTORECLS_NONE;
retval->semantic = NULL;
return retval;
} // new_function_signature
static void delete_function_signature(Context *ctx, FunctionSignature *sig)
{
DELETE_AST_NODE(sig);
delete_function_args(ctx, sig->args);
Free(ctx, sig);
} // delete_function_signature
static CompilationUnit *new_function(Context *ctx,
FunctionSignature *declaration,
Statement *definition)
{
847
NEW_AST_NODE(retval, CompilationUnitFunction, AST_COMPUNIT_FUNCTION);
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
retval->next = NULL;
retval->declaration = declaration;
retval->definition = definition;
return (CompilationUnit *) retval;
} // new_function
static void delete_function(Context *ctx, CompilationUnitFunction *unitfn)
{
DELETE_AST_NODE(unitfn);
delete_compilation_unit(ctx, unitfn->next);
delete_function_signature(ctx, unitfn->declaration);
delete_statement(ctx, unitfn->definition);
Free(ctx, unitfn);
} // delete_function
static ScalarOrArray *new_scalar_or_array(Context *ctx, const char *ident,
const int isvec, Expression *dim)
{
866
NEW_AST_NODE(retval, ScalarOrArray, AST_SCALAR_OR_ARRAY);
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
retval->identifier = ident;
retval->isarray = isvec;
retval->dimension = dim;
return retval;
} // new_scalar_or_array
static void delete_scalar_or_array(Context *ctx, ScalarOrArray *soa)
{
DELETE_AST_NODE(soa);
delete_expr(ctx, soa->dimension);
Free(ctx, soa);
} // delete_scalar_or_array
static Typedef *new_typedef(Context *ctx, int isconst, const char *datatype,
ScalarOrArray *soa)
{
883
NEW_AST_NODE(retval, Typedef, AST_TYPEDEF);
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
retval->isconst = isconst;
retval->datatype = datatype;
retval->details = soa;
return retval;
} // new_typedef
static void delete_typedef(Context *ctx, Typedef *td)
{
DELETE_AST_NODE(td);
delete_scalar_or_array(ctx, td->details);
Free(ctx, td);
} // delete_typedef
static PackOffset *new_pack_offset(Context *ctx, const char *a, const char *b)
{
899
NEW_AST_NODE(retval, PackOffset, AST_PACK_OFFSET);
900
901
902
903
904
905
906
907
908
909
910
911
912
913
retval->ident1 = a;
retval->ident2 = b;
return retval;
} // new_pack_offset
static void delete_pack_offset(Context *ctx, PackOffset *o)
{
DELETE_AST_NODE(o);
Free(ctx, o);
} // delete_pack_offset
static VariableLowLevel *new_variable_lowlevel(Context *ctx, PackOffset *po,
const char *reg)
{
914
NEW_AST_NODE(retval, VariableLowLevel, AST_VARIABLE_LOWLEVEL);
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
retval->packoffset = po;
retval->register_name = reg;
return retval;
} // new_variable_lowlevel
static void delete_variable_lowlevel(Context *ctx, VariableLowLevel *vll)
{
DELETE_AST_NODE(vll);
delete_pack_offset(ctx, vll->packoffset);
Free(ctx, vll);
} // delete_variable_lowlevel
static Annotations *new_annotation(Context *ctx, const char *datatype,
Expression *initializer)
{
930
NEW_AST_NODE(retval, Annotations, AST_ANNOTATION);
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
retval->datatype = datatype;
retval->initializer = initializer;
retval->next = NULL;
return retval;
} // new_annotation
static void delete_annotation(Context *ctx, Annotations *annotations)
{
DELETE_AST_NODE(annotations);
delete_annotation(ctx, annotations->next);
delete_expr(ctx, annotations->initializer);
Free(ctx, annotations);
} // delete_annotation
static VariableDeclaration *new_variable_declaration(Context *ctx,
ScalarOrArray *soa, const char *semantic,
Annotations *annotations, Expression *init,
VariableLowLevel *vll)
{
950
NEW_AST_NODE(retval, VariableDeclaration, AST_VARIABLE_DECLARATION);
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
retval->attributes = 0;
retval->datatype = NULL;
retval->anonymous_datatype = NULL;
retval->details = soa;
retval->semantic = semantic;
retval->annotations = annotations;
retval->initializer = init;
retval->lowlevel = vll;
retval->next = NULL;
return retval;
} // new_variable_declaration
static void delete_variable_declaration(Context *ctx, VariableDeclaration *dcl)
{
DELETE_AST_NODE(dcl);
delete_variable_declaration(ctx, dcl->next);
delete_scalar_or_array(ctx, dcl->details);
delete_annotation(ctx, dcl->annotations);
delete_expr(ctx, dcl->initializer);
delete_variable_lowlevel(ctx, dcl->lowlevel);
Free(ctx, dcl);
} // delete_variable_declaration
static CompilationUnit *new_global_variable(Context *ctx,
VariableDeclaration *decl)
{
977
NEW_AST_NODE(retval, CompilationUnitVariable, AST_COMPUNIT_VARIABLE);
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
retval->next = NULL;
retval->declaration = decl;
return (CompilationUnit *) retval;
} // new_global_variable
static void delete_global_variable(Context *ctx, CompilationUnitVariable *var)
{
DELETE_AST_NODE(var);
delete_compilation_unit(ctx, var->next);
delete_variable_declaration(ctx, var->declaration);
Free(ctx, var);
} // delete_global_variable
static CompilationUnit *new_global_typedef(Context *ctx, Typedef *td)
{
993
NEW_AST_NODE(retval, CompilationUnitTypedef, AST_COMPUNIT_TYPEDEF);
994
995
996
997
998
999
1000
retval->next = NULL;
retval->type_info = td;
return (CompilationUnit *) retval;
} // new_global_typedef
static void delete_global_typedef(Context *ctx, CompilationUnitTypedef *unit)
{