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_entfield_s ast_entfield;
41 /* Node interface with common components
43 typedef void ast_node_delete(ast_node*);
47 /* I don't feel comfortable using keywords like 'delete' as names... */
48 ast_node_delete *destroy;
49 /* keep: if a node contains this node, 'keep'
50 * prevents its dtor from destroying this node as well.
55 #define ast_delete(x) ( ( (ast_node*)(x) ) -> node.destroy )((ast_node*)(x))
56 #define ast_unref(x) do \
58 if (! (((ast_node*)(x))->node.keep) ) { \
63 /* Expression interface
65 * Any expression or block returns an ir_value, and needs
66 * to know the current function.
68 typedef bool ast_expression_codegen(ast_expression*,
74 ast_expression_codegen *codegen;
75 } ast_expression_common;
79 * Types are also values, both have a type and a name.
80 * especially considering possible constructs like typedefs.
82 * is like creating a 'float foo', foo serving as the type's name.
86 ast_expression_common expression;
105 /* if vtype is qc_function, params contain parameters, and
106 * 'next' the return type.
108 MEM_VECTOR_MAKE(ast_value*, params);
110 ast_value* ast_value_new(lex_ctx ctx, const char *name, int qctype);
111 /* This will NOT delete an underlying ast_function */
112 void ast_value_delete(ast_value*);
114 bool ast_value_set_name(ast_value*, const char *name);
116 bool ast_value_codegen(ast_value*, ast_function*, ir_value**);
120 * A value-returning binary expression.
124 ast_expression_common expression;
127 ast_expression *left;
128 ast_expression *right;
130 ast_binary* ast_binary_new(lex_ctx ctx,
132 ast_expression *left,
133 ast_expression *right);
134 void ast_binary_delete(ast_binary*);
136 /* hmm, seperate functions?
137 bool ast_block_codegen(ast_block*, ast_function*, ir_value**);
139 bool ast_binary_codegen(ast_binary*, ast_function*, ir_value**);
143 * This must do 2 things:
144 * -) Provide a way to fetch an entity field value. (Rvalue)
145 * -) Provide a pointer to an entity field. (Lvalue)
147 * In original QC, there's only a STORE via pointer, but
148 * no LOAD via pointer.
149 * So we must know beforehand if we are going to read or assign
151 * For this we will have to extend the codegen() functions with
152 * a flag saying whether or not we need an L or an R-value.
154 struct ast_entfield_s
156 ast_expression_common expression;
157 /* The entity can come from an expression of course. */
158 ast_expression *entity;
159 /* As can the field, it just must result in a value of TYPE_FIELD */
160 ast_expression *field;
162 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field);
163 void ast_entfield_delete(ast_entfield*);
165 bool ast_entfield_codegen(ast_entfield*, ast_function*, ir_value**);
169 * Stores left<-right and returns left.
170 * Specialized binary expression node
174 ast_expression_common expression;
176 ast_value *dest; /* When we add pointers this might have to change to expression */
177 ast_expression *source;
179 ast_store* ast_store_new(lex_ctx ctx, int op,
180 ast_value *d, ast_expression *s);
181 void ast_store_delete(ast_store*);
183 bool ast_store_codegen(ast_store*, ast_function*, ir_value**);
190 ast_expression_common expression;
192 MEM_VECTOR_MAKE(ast_value*, locals);
193 MEM_VECTOR_MAKE(ast_expression*, exprs);
195 ast_block* ast_block_new(lex_ctx ctx);
196 void ast_block_delete(ast_block*);
198 MEM_VECTOR_PROTO(ast_block, ast_value*, locals);
199 MEM_VECTOR_PROTO(ast_block, ast_expression*, exprs);
201 bool ast_block_codegen(ast_block*, ast_function*, ir_value**);
205 * Contains a list of blocks... at least in theory.
206 * Usually there's just the main block, other blocks are inside that.
208 * Technically, functions don't need to be an AST node, since we have
209 * neither functions inside functions, nor lambdas, and function
210 * pointers could just work with a name. However, this way could be
211 * more flexible, and adds no real complexity.
213 struct ast_function_s
215 ast_node_common node;
220 ir_function *ir_func;
222 MEM_VECTOR_MAKE(ast_block*, blocks);
224 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype);
225 /* This will NOT delete the underlying ast_value */
226 void ast_function_delete(ast_function*);
228 MEM_VECTOR_PROTO(ast_function, ast_block*, blocks);
230 bool ast_function_codegen(ast_function *self, ir_builder *builder);
234 union ast_expression_u
236 ast_expression_common expression;
246 ast_node_common node;
247 ast_expression expression;