#define ast_instantiate(T, ctx, destroyfn) \
T* self = (T*)mem_a(sizeof(T)); \
+ if (!self) { \
+ return NULL; \
+ } \
ast_node_init((ast_node*)self, ctx); \
( (ast_node*)self )->node.destroy = (ast_node_delete*)destroyfn
mem_d(self);
}
+ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
+{
+ ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
+ ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
+
+ self->entity = entity;
+ self->field = field;
+
+ return self;
+}
+
+void ast_entfield_delete(ast_entfield *self)
+{
+ ast_unref(self->entity);
+ ast_unref(self->field);
+ mem_d(self);
+}
+
+ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
+{
+ ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
+ if (!ontrue && !onfalse) {
+ /* because it is invalid */
+ mem_d(self);
+ return NULL;
+ }
+ ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
+
+ self->cond = cond;
+ self->on_true = ontrue;
+ self->on_false = onfalse;
+
+ return self;
+}
+
+void ast_ifthen_delete(ast_ifthen *self)
+{
+ ast_unref(self->cond);
+ ast_unref(self->on_true);
+ ast_unref(self->on_false);
+ mem_d(self);
+}
+
+ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
+{
+ ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
+ /* This time NEITHER must be NULL */
+ if (!ontrue || !onfalse) {
+ mem_d(self);
+ return NULL;
+ }
+ ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
+
+ self->cond = cond;
+ self->on_true = ontrue;
+ self->on_false = onfalse;
+ self->phi_out = NULL;
+
+ return self;
+}
+
+void ast_ternary_delete(ast_ternary *self)
+{
+ ast_unref(self->cond);
+ ast_unref(self->on_true);
+ ast_unref(self->on_false);
+ mem_d(self);
+}
+
ast_store* ast_store_new(lex_ctx ctx, int op,
ast_value *dest, ast_expression *source)
{
MEM_VECTOR_INIT(self, blocks);
self->ir_func = NULL;
+ self->curblock = NULL;
vtype->isconst = true;
vtype->constval.vfunc = self;
}
/*********************************************************************/
-/* AST codegen aprt
+/* AST codegen part
+ * by convention you must never pass NULL to the 'ir_value **out'
+ * parameter. If you really don't care about the output, pass a dummy.
+ * But I can't imagine a pituation where the output is truly unnecessary.
*/
-bool ast_value_codegen(ast_value *self, ast_function *func, ir_value **out)
+bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
{
/* NOTE: This is the codegen for a variable used in an expression.
* It is not the codegen to generate the value. For this purpose,
* and the ast-user should take care of ast_global_codegen to be used
* on all the globals.
*/
- return false;
+ if (!self->ir_v)
+ return false;
+ *out = self->ir_v;
+ return true;
}
bool ast_global_codegen(ast_value *self, ir_builder *ir)
return false;
}
+bool ast_local_codegen(ast_value *self, ir_function *func)
+{
+ ir_value *v = NULL;
+ if (self->isconst && self->vtype == TYPE_FUNCTION)
+ {
+ /* Do we allow local functions? I think not...
+ * this is NOT a function pointer atm.
+ */
+ return false;
+ }
+
+ v = ir_function_create_local(func, self->name, self->vtype);
+ if (!v)
+ return false;
+
+ /* A constant local... hmmm...
+ * I suppose the IR will have to deal with this
+ */
+ if (self->isconst) {
+ switch (self->vtype)
+ {
+ case TYPE_FLOAT:
+ if (!ir_value_set_float(v, self->constval.vfloat))
+ goto error;
+ break;
+ case TYPE_VECTOR:
+ if (!ir_value_set_vector(v, self->constval.vvec))
+ goto error;
+ break;
+ case TYPE_STRING:
+ if (!ir_value_set_string(v, self->constval.vstring))
+ goto error;
+ break;
+ default:
+ printf("TODO: global constant type %i\n", self->vtype);
+ break;
+ }
+ }
+
+ /* link us to the ir_value */
+ self->ir_v = v;
+ return true;
+
+error: /* clean up */
+ ir_value_delete(v);
+ return false;
+}
+
bool ast_function_codegen(ast_function *self, ir_builder *ir)
{
- if (!self->ir_func) {
+ ir_function *irf;
+ ir_value *dummy;
+ size_t i;
+
+ irf = self->ir_func;
+ if (!irf) {
printf("ast_function's related ast_value was not generated yet\n");
return false;
}
+
+ self->curblock = ir_function_create_block(irf, "entry");
+ if (!self->curblock)
+ return false;
+
+ for (i = 0; i < self->blocks_count; ++i) {
+ ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
+ if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
+ return false;
+ }
+ return true;
+}
+
+/* Note, you will not see ast_block_codegen generate ir_blocks.
+ * To the AST and the IR, blocks are 2 different things.
+ * In the AST it represents a block of code, usually enclosed in
+ * curly braces {...}.
+ * While in the IR it represents a block in terms of control-flow.
+ */
+bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
+{
+ size_t i;
+
+ /* We don't use this
+ * Note: an ast-representation using the comma-operator
+ * of the form: (a, b, c) = x should not assign to c...
+ */
+ (void)lvalue;
+
+ /* output is NULL at first, we'll have each expression
+ * assign to out output, thus, a comma-operator represention
+ * using an ast_block will return the last generated value,
+ * so: (b, c) + a executed both b and c, and returns c,
+ * which is then added to a.
+ */
+ *out = NULL;
+
+ /* generate locals */
+ for (i = 0; i < self->locals_count; ++i)
+ {
+ if (!ast_local_codegen(self->locals[i], func->ir_func))
+ return false;
+ }
+
+ for (i = 0; i < self->exprs_count; ++i)
+ {
+ ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
+ if (!(*gen)(self->exprs[i], func, false, out))
+ return false;
+ }
+
+ return true;
+}
+
+bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
+{
+ /* NOTE: remember: destination codegen needs to have lvalue=true */
return false;
}
-bool ast_block_codegen(ast_block *self, ast_function *func, ir_value **out)
+bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
{
return false;
}
-bool ast_store_codegen(ast_store *self, ast_function *func, ir_value **out)
+bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
{
return false;
}
-bool ast_binary_codegen(ast_binary *self, ast_function *func, ir_value **out)
+bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
{
+ if (out) *out = NULL;
+ return false;
+}
+
+bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
+{
+ /* In theory it shouldn't be possible to pass through a node twice, but
+ * in case we add any kind of optimization pass for the AST itself, it
+ * may still happen, thus we remember a created ir_value and simply return one
+ * if it already exists.
+ */
+ if (self->phi_out) {
+ *out = self->phi_out;
+ return true;
+ }
return false;
}
projects / xonotic / gmqcc.git / blobdiff