2 * Copyright (C) 2012, 2013, 2014
6 * Permission is hereby granted, free of charge, to any person obtaining a copy of
7 * this software and associated documentation files (the "Software"), to deal in
8 * the Software without restriction, including without limitation the rights to
9 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
10 * of the Software, and to permit persons to whom the Software is furnished to do
11 * so, subject to the following conditions:
13 * The above copyright notice and this permission notice shall be included in all
14 * copies or substantial portions of the Software.
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
28 typedef uint16_t ast_flag_t;
30 /* Note: I will not be using a _t suffix for the
31 * "main" ast node types for now.
34 typedef struct ast_node_common ast_node;
35 typedef struct ast_expression_common ast_expression;
37 typedef struct ast_value_s ast_value;
38 typedef struct ast_function_s ast_function;
39 typedef struct ast_block_s ast_block;
40 typedef struct ast_binary_s ast_binary;
41 typedef struct ast_store_s ast_store;
42 typedef struct ast_binstore_s ast_binstore;
43 typedef struct ast_entfield_s ast_entfield;
44 typedef struct ast_ifthen_s ast_ifthen;
45 typedef struct ast_ternary_s ast_ternary;
46 typedef struct ast_loop_s ast_loop;
47 typedef struct ast_call_s ast_call;
48 typedef struct ast_unary_s ast_unary;
49 typedef struct ast_return_s ast_return;
50 typedef struct ast_member_s ast_member;
51 typedef struct ast_array_index_s ast_array_index;
52 typedef struct ast_breakcont_s ast_breakcont;
53 typedef struct ast_switch_s ast_switch;
54 typedef struct ast_label_s ast_label;
55 typedef struct ast_goto_s ast_goto;
56 typedef struct ast_argpipe_s ast_argpipe;
59 AST_FLAG_VARIADIC = 1 << 0,
60 AST_FLAG_NORETURN = 1 << 1,
61 AST_FLAG_INLINE = 1 << 2,
62 AST_FLAG_INITIALIZED = 1 << 3,
63 AST_FLAG_DEPRECATED = 1 << 4,
64 AST_FLAG_INCLUDE_DEF = 1 << 5,
65 AST_FLAG_IS_VARARG = 1 << 6,
66 AST_FLAG_ALIAS = 1 << 7,
67 AST_FLAG_ERASEABLE = 1 << 8,
68 AST_FLAG_ACCUMULATE = 1 << 9,
70 /* An array declared as []
71 * so that the size is taken from the initializer
73 AST_FLAG_ARRAY_INIT = 1 << 10,
75 AST_FLAG_FINAL_DECL = 1 << 11,
77 /* Several coverage options
78 * AST_FLAG_COVERAGE means there was an explicit [[coverage]] attribute,
79 * which will overwrite the default set via the commandline switches.
80 * BLOCK_COVERAGE inserts coverage() calls into every basic block.
81 * In the future there might be more options like tracking variable access
82 * by creating get/set wrapper functions.
84 AST_FLAG_COVERAGE = 1 << 12,
85 AST_FLAG_BLOCK_COVERAGE = 1 << 13,
88 AST_FLAG_TYPE_MASK = (AST_FLAG_VARIADIC | AST_FLAG_NORETURN),
89 AST_FLAG_COVERAGE_MASK = (AST_FLAG_BLOCK_COVERAGE)
93 TYPE_ast_node, /* 0 */
94 TYPE_ast_expression, /* 1 */
95 TYPE_ast_value, /* 2 */
96 TYPE_ast_function, /* 3 */
97 TYPE_ast_block, /* 4 */
98 TYPE_ast_binary, /* 5 */
99 TYPE_ast_store, /* 6 */
100 TYPE_ast_binstore, /* 7 */
101 TYPE_ast_entfield, /* 8 */
102 TYPE_ast_ifthen, /* 9 */
103 TYPE_ast_ternary, /* 10 */
104 TYPE_ast_loop, /* 11 */
105 TYPE_ast_call, /* 12 */
106 TYPE_ast_unary, /* 13 */
107 TYPE_ast_return, /* 14 */
108 TYPE_ast_member, /* 15 */
109 TYPE_ast_array_index, /* 16 */
110 TYPE_ast_breakcont, /* 17 */
111 TYPE_ast_switch, /* 18 */
112 TYPE_ast_label, /* 19 */
113 TYPE_ast_goto, /* 20 */
114 TYPE_ast_argpipe /* 21 */
117 #define ast_istype(x, t) ( ((ast_node*)x)->nodetype == (TYPE_##t) )
118 #define ast_ctx(node) (((ast_node*)(node))->context)
119 #define ast_side_effects(node) (((ast_node*)(node))->side_effects)
121 /* Node interface with common components
123 typedef void ast_node_delete(ast_node*);
124 struct ast_node_common
127 /* I don't feel comfortable using keywords like 'delete' as names... */
128 ast_node_delete *destroy;
130 /* keep: if a node contains this node, 'keep'
131 * prevents its dtor from destroying this node as well.
137 #define ast_delete(x) (*( ((ast_node*)(x))->destroy ))((ast_node*)(x))
138 #define ast_unref(x) do \
140 if (! (((ast_node*)(x))->keep) ) { \
145 /* Expression interface
147 * Any expression or block returns an ir_value, and needs
148 * to know the current function.
150 typedef bool ast_expression_codegen(ast_expression*,
154 /* TODO: the codegen function should take an output-type parameter
155 * indicating whether a variable, type, label etc. is expected, and
157 * Then later an ast_ident could have a codegen using this to figure
158 * out what to look for.
159 * eg. in code which uses a not-yet defined variable, the expression
160 * would take an ast_ident, and the codegen would be called with
161 * type `expression`, so the ast_ident's codegen would search for
162 * variables through the environment (or functions, constants...).
164 struct ast_expression_common
167 ast_expression_codegen *codegen;
169 ast_expression *next;
170 /* arrays get a member-count */
174 /* void foo(string...) gets varparam set as a restriction
175 * for variadic parameters
177 ast_expression *varparam;
178 /* The codegen functions should store their output values
179 * so we can call it multiple times without re-evaluating.
180 * Store lvalue and rvalue seperately though. So that
181 * ast_entfield for example can generate both if required.
189 * Types are also values, both have a type and a name.
190 * especially considering possible constructs like typedefs.
192 * is like creating a 'float foo', foo serving as the type's name.
206 ast_expression expression;
211 const char *argcounter;
213 int cvq; /* const/var qualifier */
214 bool isfield; /* this declares a field */
215 bool isimm; /* an immediate, not just const */
217 bool inexact; /* inexact coming from folded expression */
218 basic_value_t constval;
219 /* for TYPE_ARRAY we have an optional vector
220 * of constants when an initializer list
223 basic_value_t *initlist;
225 /* usecount for the parser */
229 ir_value **ir_values;
230 size_t ir_value_count;
232 /* ONLY for arrays in progs version up to 6 */
237 bool intrinsic; /* true if associated with intrinsic */
240 ast_value* ast_value_new(lex_ctx_t ctx, const char *name, int qctype);
241 ast_value* ast_value_copy(const ast_value *self);
242 /* This will NOT delete an underlying ast_function */
243 void ast_value_delete(ast_value*);
245 bool ast_value_set_name(ast_value*, const char *name);
248 bool ast_value_codegen(ast_value*, ast_function*, bool lvalue, ir_value**);
249 bool ast_local_codegen(ast_value *self, ir_function *func, bool isparam);
252 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield);
254 void ast_value_params_add(ast_value*, ast_value*);
256 bool ast_compare_type(ast_expression *a, ast_expression *b);
257 ast_expression* ast_type_copy(lex_ctx_t ctx, const ast_expression *ex);
258 #define ast_type_adopt(a, b) ast_type_adopt_impl((ast_expression*)(a), (ast_expression*)(b))
259 void ast_type_adopt_impl(ast_expression *self, const ast_expression *other);
260 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize);
262 typedef enum ast_binary_ref_s {
264 AST_REF_LEFT = 1 << 1,
265 AST_REF_RIGHT = 1 << 2,
266 AST_REF_ALL = (AST_REF_LEFT | AST_REF_RIGHT)
272 * A value-returning binary expression.
276 ast_expression expression;
279 ast_expression *left;
280 ast_expression *right;
284 ast_binary* ast_binary_new(lex_ctx_t ctx,
286 ast_expression *left,
287 ast_expression *right);
291 * An assignment including a binary expression with the source as left operand.
292 * Eg. a += b; is a binstore { INSTR_STORE, INSTR_ADD, a, b }
294 struct ast_binstore_s
296 ast_expression expression;
300 ast_expression *dest;
301 ast_expression *source;
302 /* for &~= which uses the destination in a binary in source we can use this */
305 ast_binstore* ast_binstore_new(lex_ctx_t ctx,
308 ast_expression *left,
309 ast_expression *right);
313 * Regular unary expressions: not,neg
317 ast_expression expression;
320 ast_expression *operand;
322 ast_unary* ast_unary_new(lex_ctx_t ctx,
324 ast_expression *expr);
328 * Make sure 'return' only happens at the end of a block, otherwise the IR
329 * will refuse to create further instructions.
330 * This should be honored by the parser.
334 ast_expression expression;
335 ast_expression *operand;
337 ast_return* ast_return_new(lex_ctx_t ctx,
338 ast_expression *expr);
342 * This must do 2 things:
343 * -) Provide a way to fetch an entity field value. (Rvalue)
344 * -) Provide a pointer to an entity field. (Lvalue)
346 * In original QC, there's only a STORE via pointer, but
347 * no LOAD via pointer.
348 * So we must know beforehand if we are going to read or assign
350 * For this we will have to extend the codegen() functions with
351 * a flag saying whether or not we need an L or an R-value.
353 struct ast_entfield_s
355 ast_expression expression;
356 /* The entity can come from an expression of course. */
357 ast_expression *entity;
358 /* As can the field, it just must result in a value of TYPE_FIELD */
359 ast_expression *field;
361 ast_entfield* ast_entfield_new(lex_ctx_t ctx, ast_expression *entity, ast_expression *field);
362 ast_entfield* ast_entfield_new_force(lex_ctx_t ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype);
366 * For now used for vectors. If we get structs or unions
367 * we can have them handled here as well.
371 ast_expression expression;
372 ast_expression *owner;
377 ast_member* ast_member_new(lex_ctx_t ctx, ast_expression *owner, unsigned int field, const char *name);
378 void ast_member_delete(ast_member*);
379 bool ast_member_set_name(ast_member*, const char *name);
382 /* Array index access:
384 * QC forces us to take special action on arrays:
385 * an ast_store on an ast_array_index must not codegen the index,
386 * but call its setter - unless we have an instruction set which supports
388 * Any other array index access will be codegened to a call to the getter.
389 * In any case, accessing an element via a compiletime-constant index will
390 * result in quick access to that variable.
392 struct ast_array_index_s
394 ast_expression expression;
395 ast_expression *array;
396 ast_expression *index;
398 ast_array_index* ast_array_index_new(lex_ctx_t ctx, ast_expression *array, ast_expression *index);
402 * copy all varargs starting from a specific index
406 ast_expression expression;
407 ast_expression *index;
409 ast_argpipe* ast_argpipe_new(lex_ctx_t ctx, ast_expression *index);
413 * Stores left<-right and returns left.
414 * Specialized binary expression node
418 ast_expression expression;
420 ast_expression *dest;
421 ast_expression *source;
423 ast_store* ast_store_new(lex_ctx_t ctx, int op,
424 ast_expression *d, ast_expression *s);
428 * A general 'if then else' statement, either side can be NULL and will
429 * thus be omitted. It is an error for *both* cases to be NULL at once.
431 * During its 'codegen' it'll be changing the ast_function's block.
433 * An if is also an "expression". Its codegen will put NULL into the
434 * output field though. For ternary expressions an ast_ternary will be
439 ast_expression expression;
440 ast_expression *cond;
441 /* It's all just 'expressions', since an ast_block is one too. */
442 ast_expression *on_true;
443 ast_expression *on_false;
445 ast_ifthen* ast_ifthen_new(lex_ctx_t ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse);
447 /* Ternary expressions...
449 * Contrary to 'if-then-else' nodes, ternary expressions actually
450 * return a value, otherwise they behave the very same way.
451 * The difference in 'codegen' is that it'll return the value of
454 * The other difference is that in an ast_ternary, NEITHER side
455 * must be NULL, there's ALWAYS an else branch.
457 * This is the only ast_node beside ast_value which contains
458 * an ir_value. Theoretically we don't need to remember it though.
462 ast_expression expression;
463 ast_expression *cond;
464 /* It's all just 'expressions', since an ast_block is one too. */
465 ast_expression *on_true;
466 ast_expression *on_false;
468 ast_ternary* ast_ternary_new(lex_ctx_t ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse);
470 /* A general loop node
472 * For convenience it contains 4 parts:
473 * -) (ini) = initializing expression
474 * -) (pre) = pre-loop condition
475 * -) (pst) = post-loop condition
476 * -) (inc) = "increment" expression
477 * The following is a psudo-representation of this loop
478 * note that '=>' bears the logical meaning of "implies".
479 * (a => b) equals (!a || b)
482 while (has_pre => {pre})
486 continue: // a 'continue' will jump here
487 if (has_pst => {pst})
495 ast_expression expression;
496 ast_expression *initexpr;
497 ast_expression *precond;
498 ast_expression *postcond;
499 ast_expression *increment;
500 ast_expression *body;
501 /* For now we allow a seperate flag on whether or not the condition
502 * is supposed to be true or false.
503 * That way, the parser can generate a 'while not(!x)' for `while(x)`
504 * if desired, which is useful for the new -f{true,false}-empty-strings
510 ast_loop* ast_loop_new(lex_ctx_t ctx,
511 ast_expression *initexpr,
512 ast_expression *precond, bool pre_not,
513 ast_expression *postcond, bool post_not,
514 ast_expression *increment,
515 ast_expression *body);
519 struct ast_breakcont_s
521 ast_expression expression;
525 ast_breakcont* ast_breakcont_new(lex_ctx_t ctx, bool iscont, unsigned int levels);
529 * A few notes about this: with the original QCVM, no real optimization
530 * is possible. The SWITCH instruction set isn't really helping a lot, since
531 * it only collapes the EQ and IF instructions into one.
532 * Note: Declaring local variables inside caseblocks is normal.
533 * Since we don't have to deal with a stack there's no unnatural behaviour to
534 * be expected from it.
538 ast_expression *value; /* #20 will replace this */
539 ast_expression *code;
543 ast_expression expression;
545 ast_expression *operand;
546 ast_switch_case *cases;
549 ast_switch* ast_switch_new(lex_ctx_t ctx, ast_expression *op);
553 * Introduce a label which can be used together with 'goto'
557 ast_expression expression;
562 /* means it has not yet been defined */
566 ast_label* ast_label_new(lex_ctx_t ctx, const char *name, bool undefined);
570 * Go to a label, the label node is filled in at a later point!
574 ast_expression expression;
577 ir_block *irblock_from;
580 ast_goto* ast_goto_new(lex_ctx_t ctx, const char *name);
581 void ast_goto_set_label(ast_goto*, ast_label*);
585 * Contains an ast_expression as target, rather than an ast_function/value.
586 * Since it's how QC works, every ast_function has an ast_value
587 * associated anyway - in other words, the VM contains function
588 * pointers for every function anyway. Thus, this node will call
590 * Additionally it contains a list of ast_expressions as parameters.
591 * Since calls can return values, an ast_call is also an ast_expression.
595 ast_expression expression;
596 ast_expression *func;
597 ast_expression **params;
598 ast_expression *va_count;
600 ast_call* ast_call_new(lex_ctx_t ctx,
601 ast_expression *funcexpr);
602 bool ast_call_check_types(ast_call*, ast_expression *this_func_va_type);
609 ast_expression expression;
612 ast_expression* *exprs;
613 ast_expression* *collect;
615 ast_block* ast_block_new(lex_ctx_t ctx);
616 void ast_block_delete(ast_block*);
617 void ast_block_set_type(ast_block*, ast_expression *from);
618 void ast_block_collect(ast_block*, ast_expression*);
620 bool GMQCC_WARN ast_block_add_expr(ast_block*, ast_expression*);
624 * Contains a list of blocks... at least in theory.
625 * Usually there's just the main block, other blocks are inside that.
627 * Technically, functions don't need to be an AST node, since we have
628 * neither functions inside functions, nor lambdas, and function
629 * pointers could just work with a name. However, this way could be
630 * more flexible, and adds no real complexity.
632 struct ast_function_s
641 /* list of used-up names for statics without the count suffix */
643 /* number of static variables, by convention this includes the
644 * ones without the count-suffix - remember this when dealing
645 * with savegames. uint instead of size_t as %zu in printf is
646 * C99, so no windows support. */
647 unsigned int static_count;
649 ir_function *ir_func;
651 ir_block **breakblocks;
652 ir_block **continueblocks;
655 /* In order for early-out logic not to go over
656 * excessive jumps, we remember their target
664 /* in order for thread safety - for the optional
665 * channel abesed multithreading... keeping a buffer
666 * here to use in ast_function_label.
674 ast_value *fixedparams;
675 ast_value *return_value;
677 ast_function* ast_function_new(lex_ctx_t ctx, const char *name, ast_value *vtype);
678 /* This will NOT delete the underlying ast_value */
679 void ast_function_delete(ast_function*);
680 /* For "optimized" builds this can just keep returning "foo"...
683 const char* ast_function_label(ast_function*, const char *prefix);
685 bool ast_function_codegen(ast_function *self, ir_builder *builder);
686 bool ast_generate_accessors(ast_value *asvalue, ir_builder *ir);
689 * If the condition creates a situation where this becomes -1 size it means there are
690 * more AST_FLAGs than the type ast_flag_t is capable of holding. So either eliminate
691 * the AST flag count or change the ast_flag_t typedef to a type large enough to accomodate
694 typedef int static_assert_is_ast_flag_safe [((AST_FLAG_LAST) <= (ast_flag_t)(-1)) ? 1 : -1];