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;
40 /* Node interface with common components
42 typedef void ast_node_delete(ast_node*);
46 /* I don't feel comfortable using keywords like 'delete' as names... */
47 ast_node_delete *destroy;
48 /* keep: if a node contains this node, 'keep'
49 * prevents its dtor from destroying this node as well.
54 #define ast_delete(x) ( ( (ast_node*)(x) ) -> node.destroy )((ast_node*)(x))
55 #define ast_unref(x) do \
57 if (! (((ast_node*)(x))->node.keep) ) { \
62 /* Expression interface
64 * Any expression or block returns an ir_value, and needs
65 * to know the current function.
67 typedef bool ast_expression_codegen(ast_expression*,
73 ast_expression_codegen *codegen;
74 } ast_expression_common;
78 * Types are also values, both have a type and a name.
79 * especially considering possible constructs like typedefs.
81 * is like creating a 'float foo', foo serving as the type's name.
85 ast_expression_common expression;
104 /* if vtype is qc_function, params contain parameters, and
105 * 'next' the return type.
107 MEM_VECTOR_MAKE(ast_value*, params);
109 ast_value* ast_value_new(lex_ctx ctx, const char *name, int qctype);
110 /* This will NOT delete an underlying ast_function */
111 void ast_value_delete(ast_value*);
113 bool ast_value_set_name(ast_value*, const char *name);
115 bool ast_value_codegen(ast_value*, ast_function*, ir_value**);
119 * A value-returning binary expression.
123 ast_expression_common expression;
126 ast_expression *left;
127 ast_expression *right;
129 ast_binary* ast_binary_new(lex_ctx ctx,
131 ast_expression *left,
132 ast_expression *right);
133 void ast_binary_delete(ast_binary*);
135 /* hmm, seperate functions?
136 bool ast_block_codegen(ast_block*, ast_function*, ir_value**);
138 bool ast_binary_codegen(ast_binary*, ast_function*, ir_value**);
142 * Stores left<-right and returns left.
143 * Specialized binary expression node
147 ast_expression_common expression;
149 ast_value *dest; /* When we add pointers this might have to change to expression */
150 ast_expression *source;
152 ast_store* ast_store_new(lex_ctx ctx, int op,
153 ast_value *d, ast_expression *s);
154 void ast_store_delete(ast_store*);
156 bool ast_store_codegen(ast_store*, ast_function*, ir_value**);
163 ast_expression_common expression;
165 MEM_VECTOR_MAKE(ast_value*, locals);
166 MEM_VECTOR_MAKE(ast_expression*, exprs);
168 ast_block* ast_block_new(lex_ctx ctx);
169 void ast_block_delete(ast_block*);
171 MEM_VECTOR_PROTO(ast_block, ast_value*, locals);
172 MEM_VECTOR_PROTO(ast_block, ast_expression*, exprs);
174 bool ast_block_codegen(ast_block*, ast_function*, ir_value**);
178 * Contains a list of blocks... at least in theory.
179 * Usually there's just the main block, other blocks are inside that.
181 * Technically, functions don't need to be an AST node, since we have
182 * neither functions inside functions, nor lambdas, and function
183 * pointers could just work with a name. However, this way could be
184 * more flexible, and adds no real complexity.
186 struct ast_function_s
188 ast_node_common node;
193 ir_function *ir_func;
195 MEM_VECTOR_MAKE(ast_block*, blocks);
197 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype);
198 /* This will NOT delete the underlying ast_value */
199 void ast_function_delete(ast_function*);
201 MEM_VECTOR_PROTO(ast_function, ast_block*, blocks);
203 bool ast_function_codegen(ast_function *self, ir_builder *builder);
207 union ast_expression_u
209 ast_expression_common expression;
219 ast_node_common node;
220 ast_expression expression;