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*,
105 ast_node_common node;
106 ast_expression_codegen *codegen;
108 ast_expression *next;
109 MEM_VECTOR_MAKE(ast_value*, params);
110 /* The codegen functions should store their output values
111 * so we can call it multiple times without re-evaluating.
112 * Store lvalue and rvalue seperately though. So that
113 * ast_entfield for example can generate both if required.
117 } ast_expression_common;
118 MEM_VECTOR_PROTO(ast_expression_common, ast_value*, params);
122 * Types are also values, both have a type and a name.
123 * especially considering possible constructs like typedefs.
125 * is like creating a 'float foo', foo serving as the type's name.
129 ast_expression_common expression;
151 ast_value* ast_value_new(lex_ctx ctx, const char *name, int qctype);
152 ast_value* ast_value_copy(const ast_value *self);
153 /* This will NOT delete an underlying ast_function */
154 void ast_value_delete(ast_value*);
156 bool ast_value_set_name(ast_value*, const char *name);
158 bool ast_value_codegen(ast_value*, ast_function*, bool lvalue, ir_value**);
159 bool ast_local_codegen(ast_value *self, ir_function *func, bool isparam);
160 bool ast_global_codegen(ast_value *self, ir_builder *ir);
162 bool GMQCC_WARN ast_value_params_add(ast_value*, ast_value*);
164 bool ast_compare_type(ast_expression *a, ast_expression *b);
168 * A value-returning binary expression.
172 ast_expression_common expression;
175 ast_expression *left;
176 ast_expression *right;
178 ast_binary* ast_binary_new(lex_ctx ctx,
180 ast_expression *left,
181 ast_expression *right);
182 void ast_binary_delete(ast_binary*);
184 bool ast_binary_codegen(ast_binary*, ast_function*, bool lvalue, ir_value**);
188 * An assignment including a binary expression with the source as left operand.
189 * Eg. a += b; is a binstore { INSTR_STORE, INSTR_ADD, a, b }
191 struct ast_binstore_s
193 ast_expression_common expression;
197 ast_expression *dest;
198 ast_expression *source;
200 ast_binstore* ast_binstore_new(lex_ctx ctx,
203 ast_expression *left,
204 ast_expression *right);
205 void ast_binstore_delete(ast_binstore*);
207 bool ast_binstore_codegen(ast_binstore*, ast_function*, bool lvalue, ir_value**);
211 * Regular unary expressions: not,neg
215 ast_expression_common expression;
218 ast_expression *operand;
220 ast_unary* ast_unary_new(lex_ctx ctx,
222 ast_expression *expr);
223 void ast_unary_delete(ast_unary*);
225 bool ast_unary_codegen(ast_unary*, ast_function*, bool lvalue, ir_value**);
229 * Make sure 'return' only happens at the end of a block, otherwise the IR
230 * will refuse to create further instructions.
231 * This should be honored by the parser.
235 ast_expression_common expression;
236 ast_expression *operand;
238 ast_return* ast_return_new(lex_ctx ctx,
239 ast_expression *expr);
240 void ast_return_delete(ast_return*);
242 bool ast_return_codegen(ast_return*, ast_function*, bool lvalue, ir_value**);
246 * This must do 2 things:
247 * -) Provide a way to fetch an entity field value. (Rvalue)
248 * -) Provide a pointer to an entity field. (Lvalue)
250 * In original QC, there's only a STORE via pointer, but
251 * no LOAD via pointer.
252 * So we must know beforehand if we are going to read or assign
254 * For this we will have to extend the codegen() functions with
255 * a flag saying whether or not we need an L or an R-value.
257 struct ast_entfield_s
259 ast_expression_common expression;
260 /* The entity can come from an expression of course. */
261 ast_expression *entity;
262 /* As can the field, it just must result in a value of TYPE_FIELD */
263 ast_expression *field;
265 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field);
266 void ast_entfield_delete(ast_entfield*);
268 bool ast_entfield_codegen(ast_entfield*, ast_function*, bool lvalue, ir_value**);
272 * For now used for vectors. If we get structs or unions
273 * we can have them handled here as well.
277 ast_expression_common expression;
278 ast_expression *owner;
281 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field);
282 void ast_member_delete(ast_member*);
284 bool ast_member_codegen(ast_member*, ast_function*, bool lvalue, ir_value**);
288 * Stores left<-right and returns left.
289 * Specialized binary expression node
293 ast_expression_common expression;
295 ast_expression *dest;
296 ast_expression *source;
298 ast_store* ast_store_new(lex_ctx ctx, int op,
299 ast_expression *d, ast_expression *s);
300 void ast_store_delete(ast_store*);
302 bool ast_store_codegen(ast_store*, ast_function*, bool lvalue, ir_value**);
306 * A general 'if then else' statement, either side can be NULL and will
307 * thus be omitted. It is an error for *both* cases to be NULL at once.
309 * During its 'codegen' it'll be changing the ast_function's block.
311 * An if is also an "expression". Its codegen will put NULL into the
312 * output field though. For ternary expressions an ast_ternary will be
317 ast_expression_common expression;
318 ast_expression *cond;
319 /* It's all just 'expressions', since an ast_block is one too. */
320 ast_expression *on_true;
321 ast_expression *on_false;
323 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse);
324 void ast_ifthen_delete(ast_ifthen*);
326 bool ast_ifthen_codegen(ast_ifthen*, ast_function*, bool lvalue, ir_value**);
328 /* Ternary expressions...
330 * Contrary to 'if-then-else' nodes, ternary expressions actually
331 * return a value, otherwise they behave the very same way.
332 * The difference in 'codegen' is that it'll return the value of
335 * The other difference is that in an ast_ternary, NEITHER side
336 * must be NULL, there's ALWAYS an else branch.
338 * This is the only ast_node beside ast_value which contains
339 * an ir_value. Theoretically we don't need to remember it though.
343 ast_expression_common expression;
344 ast_expression *cond;
345 /* It's all just 'expressions', since an ast_block is one too. */
346 ast_expression *on_true;
347 ast_expression *on_false;
348 /* After a ternary expression we find ourselves in a new IR block
349 * and start with a PHI node */
352 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse);
353 void ast_ternary_delete(ast_ternary*);
355 bool ast_ternary_codegen(ast_ternary*, ast_function*, bool lvalue, ir_value**);
357 /* A general loop node
359 * For convenience it contains 4 parts:
360 * -) (ini) = initializing expression
361 * -) (pre) = pre-loop condition
362 * -) (pst) = post-loop condition
363 * -) (inc) = "increment" expression
364 * The following is a psudo-representation of this loop
365 * note that '=>' bears the logical meaning of "implies".
366 * (a => b) equals (!a || b)
369 while (has_pre => {pre})
373 continue: // a 'continue' will jump here
374 if (has_pst => {pst})
382 ast_expression_common expression;
383 ast_expression *initexpr;
384 ast_expression *precond;
385 ast_expression *postcond;
386 ast_expression *increment;
387 ast_expression *body;
389 ast_loop* ast_loop_new(lex_ctx ctx,
390 ast_expression *initexpr,
391 ast_expression *precond,
392 ast_expression *postcond,
393 ast_expression *increment,
394 ast_expression *body);
395 void ast_loop_delete(ast_loop*);
397 bool ast_loop_codegen(ast_loop*, ast_function*, bool lvalue, ir_value**);
401 * Contains an ast_expression as target, rather than an ast_function/value.
402 * Since it's how QC works, every ast_function has an ast_value
403 * associated anyway - in other words, the VM contains function
404 * pointers for every function anyway. Thus, this node will call
406 * Additionally it contains a list of ast_expressions as parameters.
407 * Since calls can return values, an ast_call is also an ast_expression.
411 ast_expression_common expression;
412 ast_expression *func;
413 MEM_VECTOR_MAKE(ast_expression*, params);
415 ast_call* ast_call_new(lex_ctx ctx,
416 ast_expression *funcexpr);
417 void ast_call_delete(ast_call*);
418 bool ast_call_codegen(ast_call*, ast_function*, bool lvalue, ir_value**);
420 MEM_VECTOR_PROTO(ast_call, ast_expression*, params);
427 ast_expression_common expression;
429 MEM_VECTOR_MAKE(ast_value*, locals);
430 MEM_VECTOR_MAKE(ast_expression*, exprs);
431 MEM_VECTOR_MAKE(ast_expression*, collect);
433 ast_block* ast_block_new(lex_ctx ctx);
434 void ast_block_delete(ast_block*);
435 bool ast_block_set_type(ast_block*, ast_expression *from);
437 MEM_VECTOR_PROTO(ast_block, ast_value*, locals);
438 MEM_VECTOR_PROTO(ast_block, ast_expression*, exprs);
439 MEM_VECTOR_PROTO(ast_block, ast_expression*, collect);
441 bool ast_block_codegen(ast_block*, ast_function*, bool lvalue, ir_value**);
442 bool ast_block_collect(ast_block*, ast_expression*);
446 * Contains a list of blocks... at least in theory.
447 * Usually there's just the main block, other blocks are inside that.
449 * Technically, functions don't need to be an AST node, since we have
450 * neither functions inside functions, nor lambdas, and function
451 * pointers could just work with a name. However, this way could be
452 * more flexible, and adds no real complexity.
454 struct ast_function_s
456 ast_node_common node;
463 ir_function *ir_func;
465 ir_block *breakblock;
466 ir_block *continueblock;
469 /* in order for thread safety - for the optional
470 * channel abesed multithreading... keeping a buffer
471 * here to use in ast_function_label.
475 MEM_VECTOR_MAKE(ast_block*, blocks);
477 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype);
478 /* This will NOT delete the underlying ast_value */
479 void ast_function_delete(ast_function*);
480 /* For "optimized" builds this can just keep returning "foo"...
483 const char* ast_function_label(ast_function*, const char *prefix);
485 MEM_VECTOR_PROTO(ast_function, ast_block*, blocks);
487 bool ast_function_codegen(ast_function *self, ir_builder *builder);
491 union ast_expression_u
493 ast_expression_common expression;
501 ast_entfield entfield;
508 ast_node_common node;
509 ast_expression expression;