5 * Permission is hereby granted, free of charge, to any person obtaining a copy of
6 * this software and associated documentation files (the "Software"), to deal in
7 * the Software without restriction, including without limitation the rights to
8 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
9 * of the Software, and to permit persons to whom the Software is furnished to do
10 * so, subject to the following conditions:
12 * The above copyright notice and this permission notice shall be included in all
13 * copies or substantial portions of the Software.
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
27 /* Note: I will not be using a _t suffix for the
28 * "main" ast node types for now.
31 typedef union ast_node_u ast_node;
32 typedef union ast_expression_u ast_expression;
34 typedef struct ast_value_s ast_value;
35 typedef struct ast_function_s ast_function;
36 typedef struct ast_block_s ast_block;
37 typedef struct ast_binary_s ast_binary;
38 typedef struct ast_store_s ast_store;
39 typedef struct ast_binstore_s ast_binstore;
40 typedef struct ast_entfield_s ast_entfield;
41 typedef struct ast_ifthen_s ast_ifthen;
42 typedef struct ast_ternary_s ast_ternary;
43 typedef struct ast_loop_s ast_loop;
44 typedef struct ast_call_s ast_call;
45 typedef struct ast_unary_s ast_unary;
46 typedef struct ast_return_s ast_return;
47 typedef struct ast_member_s ast_member;
68 #define ast_istype(x, t) ( ((ast_node_common*)x)->nodetype == (TYPE_##t) )
69 #define ast_ctx(node) (((ast_node_common*)(node))->context)
71 /* Node interface with common components
73 typedef void ast_node_delete(ast_node*);
77 /* I don't feel comfortable using keywords like 'delete' as names... */
78 ast_node_delete *destroy;
80 /* keep: if a node contains this node, 'keep'
81 * prevents its dtor from destroying this node as well.
86 #define ast_delete(x) ( ( (ast_node*)(x) ) -> node.destroy )((ast_node*)(x))
87 #define ast_unref(x) do \
89 if (! (((ast_node*)(x))->node.keep) ) { \
94 /* Expression interface
96 * Any expression or block returns an ir_value, and needs
97 * to know the current function.
99 typedef bool ast_expression_codegen(ast_expression*,
103 /* TODO: the codegen function should take an output-type parameter
104 * indicating whether a variable, type, label etc. is expected, and
106 * Then later an ast_ident could have a codegen using this to figure
107 * out what to look for.
108 * eg. in code which uses a not-yet defined variable, the expression
109 * would take an ast_ident, and the codegen would be called with
110 * type `expression`, so the ast_ident's codegen would search for
111 * variables through the environment (or functions, constants...).
115 ast_node_common node;
116 ast_expression_codegen *codegen;
118 ast_expression *next;
119 /* arrays get a member-count */
121 MEM_VECTOR_MAKE(ast_value*, params);
123 /* The codegen functions should store their output values
124 * so we can call it multiple times without re-evaluating.
125 * Store lvalue and rvalue seperately though. So that
126 * ast_entfield for example can generate both if required.
130 } ast_expression_common;
131 MEM_VECTOR_PROTO(ast_expression_common, ast_value*, params);
135 * Types are also values, both have a type and a name.
136 * especially considering possible constructs like typedefs.
138 * is like creating a 'float foo', foo serving as the type's name.
142 ast_expression_common expression;
161 /* usecount for the parser */
167 ast_value* ast_value_new(lex_ctx ctx, const char *name, int qctype);
168 ast_value* ast_value_copy(const ast_value *self);
169 /* This will NOT delete an underlying ast_function */
170 void ast_value_delete(ast_value*);
172 bool ast_value_set_name(ast_value*, const char *name);
174 bool ast_value_codegen(ast_value*, ast_function*, bool lvalue, ir_value**);
175 bool ast_local_codegen(ast_value *self, ir_function *func, bool isparam);
176 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield);
178 bool GMQCC_WARN ast_value_params_add(ast_value*, ast_value*);
180 bool ast_compare_type(ast_expression *a, ast_expression *b);
181 ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex);
182 #define ast_type_adopt(a, b) ast_type_adopt_impl((ast_expression*)(a), (ast_expression*)(b))
183 bool ast_type_adopt_impl(ast_expression *self, const ast_expression *other);
184 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize);
188 * A value-returning binary expression.
192 ast_expression_common expression;
195 ast_expression *left;
196 ast_expression *right;
198 ast_binary* ast_binary_new(lex_ctx ctx,
200 ast_expression *left,
201 ast_expression *right);
202 void ast_binary_delete(ast_binary*);
204 bool ast_binary_codegen(ast_binary*, ast_function*, bool lvalue, ir_value**);
208 * An assignment including a binary expression with the source as left operand.
209 * Eg. a += b; is a binstore { INSTR_STORE, INSTR_ADD, a, b }
211 struct ast_binstore_s
213 ast_expression_common expression;
217 ast_expression *dest;
218 ast_expression *source;
220 ast_binstore* ast_binstore_new(lex_ctx ctx,
223 ast_expression *left,
224 ast_expression *right);
225 void ast_binstore_delete(ast_binstore*);
227 bool ast_binstore_codegen(ast_binstore*, ast_function*, bool lvalue, ir_value**);
231 * Regular unary expressions: not,neg
235 ast_expression_common expression;
238 ast_expression *operand;
240 ast_unary* ast_unary_new(lex_ctx ctx,
242 ast_expression *expr);
243 void ast_unary_delete(ast_unary*);
245 bool ast_unary_codegen(ast_unary*, ast_function*, bool lvalue, ir_value**);
249 * Make sure 'return' only happens at the end of a block, otherwise the IR
250 * will refuse to create further instructions.
251 * This should be honored by the parser.
255 ast_expression_common expression;
256 ast_expression *operand;
258 ast_return* ast_return_new(lex_ctx ctx,
259 ast_expression *expr);
260 void ast_return_delete(ast_return*);
262 bool ast_return_codegen(ast_return*, ast_function*, bool lvalue, ir_value**);
266 * This must do 2 things:
267 * -) Provide a way to fetch an entity field value. (Rvalue)
268 * -) Provide a pointer to an entity field. (Lvalue)
270 * In original QC, there's only a STORE via pointer, but
271 * no LOAD via pointer.
272 * So we must know beforehand if we are going to read or assign
274 * For this we will have to extend the codegen() functions with
275 * a flag saying whether or not we need an L or an R-value.
277 struct ast_entfield_s
279 ast_expression_common expression;
280 /* The entity can come from an expression of course. */
281 ast_expression *entity;
282 /* As can the field, it just must result in a value of TYPE_FIELD */
283 ast_expression *field;
285 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field);
286 void ast_entfield_delete(ast_entfield*);
288 bool ast_entfield_codegen(ast_entfield*, ast_function*, bool lvalue, ir_value**);
292 * For now used for vectors. If we get structs or unions
293 * we can have them handled here as well.
297 ast_expression_common expression;
298 ast_expression *owner;
301 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field);
302 void ast_member_delete(ast_member*);
304 bool ast_member_codegen(ast_member*, ast_function*, bool lvalue, ir_value**);
308 * Stores left<-right and returns left.
309 * Specialized binary expression node
313 ast_expression_common expression;
315 ast_expression *dest;
316 ast_expression *source;
318 ast_store* ast_store_new(lex_ctx ctx, int op,
319 ast_expression *d, ast_expression *s);
320 void ast_store_delete(ast_store*);
322 bool ast_store_codegen(ast_store*, ast_function*, bool lvalue, ir_value**);
326 * A general 'if then else' statement, either side can be NULL and will
327 * thus be omitted. It is an error for *both* cases to be NULL at once.
329 * During its 'codegen' it'll be changing the ast_function's block.
331 * An if is also an "expression". Its codegen will put NULL into the
332 * output field though. For ternary expressions an ast_ternary will be
337 ast_expression_common expression;
338 ast_expression *cond;
339 /* It's all just 'expressions', since an ast_block is one too. */
340 ast_expression *on_true;
341 ast_expression *on_false;
343 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse);
344 void ast_ifthen_delete(ast_ifthen*);
346 bool ast_ifthen_codegen(ast_ifthen*, ast_function*, bool lvalue, ir_value**);
348 /* Ternary expressions...
350 * Contrary to 'if-then-else' nodes, ternary expressions actually
351 * return a value, otherwise they behave the very same way.
352 * The difference in 'codegen' is that it'll return the value of
355 * The other difference is that in an ast_ternary, NEITHER side
356 * must be NULL, there's ALWAYS an else branch.
358 * This is the only ast_node beside ast_value which contains
359 * an ir_value. Theoretically we don't need to remember it though.
363 ast_expression_common expression;
364 ast_expression *cond;
365 /* It's all just 'expressions', since an ast_block is one too. */
366 ast_expression *on_true;
367 ast_expression *on_false;
368 /* After a ternary expression we find ourselves in a new IR block
369 * and start with a PHI node */
372 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse);
373 void ast_ternary_delete(ast_ternary*);
375 bool ast_ternary_codegen(ast_ternary*, ast_function*, bool lvalue, ir_value**);
377 /* A general loop node
379 * For convenience it contains 4 parts:
380 * -) (ini) = initializing expression
381 * -) (pre) = pre-loop condition
382 * -) (pst) = post-loop condition
383 * -) (inc) = "increment" expression
384 * The following is a psudo-representation of this loop
385 * note that '=>' bears the logical meaning of "implies".
386 * (a => b) equals (!a || b)
389 while (has_pre => {pre})
393 continue: // a 'continue' will jump here
394 if (has_pst => {pst})
402 ast_expression_common expression;
403 ast_expression *initexpr;
404 ast_expression *precond;
405 ast_expression *postcond;
406 ast_expression *increment;
407 ast_expression *body;
409 ast_loop* ast_loop_new(lex_ctx ctx,
410 ast_expression *initexpr,
411 ast_expression *precond,
412 ast_expression *postcond,
413 ast_expression *increment,
414 ast_expression *body);
415 void ast_loop_delete(ast_loop*);
417 bool ast_loop_codegen(ast_loop*, ast_function*, bool lvalue, ir_value**);
421 * Contains an ast_expression as target, rather than an ast_function/value.
422 * Since it's how QC works, every ast_function has an ast_value
423 * associated anyway - in other words, the VM contains function
424 * pointers for every function anyway. Thus, this node will call
426 * Additionally it contains a list of ast_expressions as parameters.
427 * Since calls can return values, an ast_call is also an ast_expression.
431 ast_expression_common expression;
432 ast_expression *func;
433 MEM_VECTOR_MAKE(ast_expression*, params);
435 ast_call* ast_call_new(lex_ctx ctx,
436 ast_expression *funcexpr);
437 void ast_call_delete(ast_call*);
438 bool ast_call_codegen(ast_call*, ast_function*, bool lvalue, ir_value**);
439 bool ast_call_check_types(ast_call*);
441 MEM_VECTOR_PROTO(ast_call, ast_expression*, params);
448 ast_expression_common expression;
450 MEM_VECTOR_MAKE(ast_value*, locals);
451 MEM_VECTOR_MAKE(ast_expression*, exprs);
452 MEM_VECTOR_MAKE(ast_expression*, collect);
454 ast_block* ast_block_new(lex_ctx ctx);
455 void ast_block_delete(ast_block*);
456 bool ast_block_set_type(ast_block*, ast_expression *from);
458 MEM_VECTOR_PROTO(ast_block, ast_value*, locals);
459 MEM_VECTOR_PROTO(ast_block, ast_expression*, exprs);
460 MEM_VECTOR_PROTO(ast_block, ast_expression*, collect);
462 bool ast_block_codegen(ast_block*, ast_function*, bool lvalue, ir_value**);
463 bool ast_block_collect(ast_block*, ast_expression*);
467 * Contains a list of blocks... at least in theory.
468 * Usually there's just the main block, other blocks are inside that.
470 * Technically, functions don't need to be an AST node, since we have
471 * neither functions inside functions, nor lambdas, and function
472 * pointers could just work with a name. However, this way could be
473 * more flexible, and adds no real complexity.
475 struct ast_function_s
477 ast_node_common node;
484 ir_function *ir_func;
486 ir_block *breakblock;
487 ir_block *continueblock;
490 /* in order for thread safety - for the optional
491 * channel abesed multithreading... keeping a buffer
492 * here to use in ast_function_label.
496 MEM_VECTOR_MAKE(ast_block*, blocks);
498 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype);
499 /* This will NOT delete the underlying ast_value */
500 void ast_function_delete(ast_function*);
501 /* For "optimized" builds this can just keep returning "foo"...
504 const char* ast_function_label(ast_function*, const char *prefix);
506 MEM_VECTOR_PROTO(ast_function, ast_block*, blocks);
508 bool ast_function_codegen(ast_function *self, ir_builder *builder);
512 union ast_expression_u
514 ast_expression_common expression;
522 ast_entfield entfield;
529 ast_node_common node;
530 ast_expression expression;