ast_expression_codegen *codegen)
{
self->expression.codegen = codegen;
+ self->expression.vtype = TYPE_VOID;
+ self->expression.next = NULL;
+}
+
+static void ast_expression_delete(ast_expression *self)
+{
+ if (self->expression.next)
+ ast_delete(self->expression.next);
+}
+
+static void ast_expression_delete_full(ast_expression *self)
+{
+ ast_expression_delete(self);
+ mem_d(self);
+}
+
+static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
+{
+ const ast_expression_common *cpex;
+ ast_expression_common *selfex;
+
+ if (!ex)
+ return NULL;
+ else
+ {
+ ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
+
+ cpex = &ex->expression;
+ selfex = &self->expression;
+
+ selfex->vtype = cpex->vtype;
+ if (cpex->next)
+ {
+ selfex->next = ast_type_copy(ctx, cpex->next);
+ if (!selfex->next) {
+ mem_d(self);
+ return NULL;
+ }
+ }
+ else
+ selfex->next = NULL;
+
+ /* This may never be codegen()d */
+ selfex->codegen = NULL;
+ return self;
+ }
}
ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
self->expression.node.keep = true; /* keep */
self->name = name ? util_strdup(name) : NULL;
- self->vtype = t;
- self->next = NULL;
+ self->expression.vtype = t;
+ self->expression.next = NULL;
MEM_VECTOR_INIT(self, params);
self->isconst = false;
memset(&self->constval, 0, sizeof(self->constval));
for (i = 0; i < self->params_count; ++i)
ast_value_delete(self->params[i]); /* delete, the ast_function is expected to die first */
MEM_VECTOR_CLEAR(self, params);
- if (self->next) /* delete, not unref, types are always copied */
- ast_delete(self->next);
if (self->isconst) {
- switch (self->vtype)
+ switch (self->expression.vtype)
{
case TYPE_STRING:
mem_d((void*)self->constval.vstring);
break;
}
}
+ ast_expression_delete((ast_expression*)self);
mem_d(self);
}
{
ast_unref(self->left);
ast_unref(self->right);
+ ast_expression_delete((ast_expression*)self);
mem_d(self);
}
ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
{
+ const ast_expression *outtype;
+
ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
+
+ if (field->expression.vtype != TYPE_FIELD) {
+ mem_d(self);
+ return NULL;
+ }
+
+ outtype = field->expression.next;
+ if (!outtype) {
+ mem_d(self);
+ /* Error: field has no type... */
+ return NULL;
+ }
+
ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
+ self->expression.vtype = outtype->expression.vtype;
+ self->expression.next = ast_type_copy(ctx, outtype->expression.next);
+
self->entity = entity;
self->field = field;
{
ast_unref(self->entity);
ast_unref(self->field);
+ ast_expression_delete((ast_expression*)self);
+ 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);
+ ast_expression_delete((ast_expression*)self);
+ 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);
+ ast_expression_delete((ast_expression*)self);
mem_d(self);
}
{
ast_unref(self->dest);
ast_unref(self->source);
+ ast_expression_delete((ast_expression*)self);
mem_d(self);
}
for (i = 0; i < self->locals_count; ++i)
ast_delete(self->locals[i]);
MEM_VECTOR_CLEAR(self, locals);
+ ast_expression_delete((ast_expression*)self);
mem_d(self);
}
if (!vtype ||
vtype->isconst ||
- vtype->vtype != TYPE_FUNCTION)
+ vtype->expression.vtype != TYPE_FUNCTION)
{
mem_d(self);
return NULL;
self->name = name ? util_strdup(name) : NULL;
MEM_VECTOR_INIT(self, blocks);
+ self->labelcount = 0;
+
self->ir_func = NULL;
+ self->curblock = NULL;
vtype->isconst = true;
vtype->constval.vfunc = self;
mem_d(self);
}
+static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
+{
+ unsigned int base = 10;
+#define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
+#define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
+ if (size < 1)
+ return;
+ checknul();
+ if (!num)
+ addch('0');
+ else {
+ while (num)
+ {
+ int digit = num % base;
+ num /= base;
+ addch('0' + digit);
+ }
+ }
+
+ *buf = 0;
+#undef addch
+#undef checknul
+}
+
+const char* ast_function_label(ast_function *self, const char *prefix)
+{
+ size_t id = (self->labelcount++);
+ size_t len = strlen(prefix);
+ strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
+ ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
+ return self->labelbuf;
+}
+
/*********************************************************************/
-/* 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)
{
ir_value *v = NULL;
- if (self->isconst && self->vtype == TYPE_FUNCTION)
+ if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
{
ir_function *func = ir_builder_create_function(ir, self->name);
if (!func)
return true;
}
- v = ir_builder_create_global(ir, self->name, self->vtype);
+ v = ir_builder_create_global(ir, self->name, self->expression.vtype);
if (!v)
return false;
if (self->isconst) {
- switch (self->vtype)
+ switch (self->expression.vtype)
{
case TYPE_FLOAT:
if (!ir_value_set_float(v, self->constval.vfloat))
*/
goto error;
default:
- printf("TODO: global constant type %i\n", self->vtype);
+ printf("TODO: global constant type %i\n", self->expression.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_local_codegen(ast_value *self, ir_function *func)
+{
+ ir_value *v = NULL;
+ if (self->isconst && self->expression.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->expression.vtype);
+ if (!v)
+ return false;
+
+ /* A constant local... hmmm...
+ * I suppose the IR will have to deal with this
+ */
+ if (self->isconst) {
+ switch (self->expression.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->expression.vtype);
break;
}
}
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;
}
- 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;
}
-bool ast_block_codegen(ast_block *self, ast_function *func, ir_value **out)
+/* 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)
{
- return false;
+ 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, ir_value **out)
+bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
{
- return false;
+ ast_expression_codegen *cgen;
+ ir_value *left, *right;
+
+ cgen = self->dest->expression.codegen;
+ /* lvalue! */
+ if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
+ return false;
+
+ cgen = self->source->expression.codegen;
+ /* rvalue! */
+ if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
+ return false;
+
+ if (!ir_block_create_store_op(func->curblock, self->op, left, right))
+ return false;
+
+ /* Theoretically, an assinment returns its left side as an
+ * lvalue, if we don't need an lvalue though, we return
+ * the right side as an rvalue, otherwise we have to
+ * somehow know whether or not we need to dereference the pointer
+ * on the left side - that is: OP_LOAD if it was an address.
+ * Also: in original QC we cannot OP_LOADP *anyway*.
+ */
+ *out = (lvalue ? left : right);
+
+ return true;
}
-bool ast_binary_codegen(ast_binary *self, ast_function *func, ir_value **out)
+bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
{
- return false;
+ ast_expression_codegen *cgen;
+ ir_value *left, *right;
+
+ /* In the context of a binary operation, we can disregard
+ * the lvalue flag.
+ */
+ (void)lvalue;
+
+ cgen = self->left->expression.codegen;
+ /* lvalue! */
+ if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
+ return false;
+
+ cgen = self->right->expression.codegen;
+ /* rvalue! */
+ if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
+ return false;
+
+ *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
+ self->op, left, right);
+ if (!*out)
+ return false;
+
+ return true;
}
-bool ast_entfield_codegen(ast_entfield *self, ast_function *func, ir_value **out)
+bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
{
- return false;
+ ast_expression_codegen *cgen;
+ ir_value *ent, *field;
+
+ /* This function needs to take the 'lvalue' flag into account!
+ * As lvalue we provide a field-pointer, as rvalue we provide the
+ * value in a temp.
+ */
+
+ cgen = self->entity->expression.codegen;
+ if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
+ return false;
+
+ cgen = self->field->expression.codegen;
+ if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
+ return false;
+
+ if (lvalue) {
+ /* address! */
+ *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
+ ent, field);
+ } else {
+ *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
+ ent, field, self->expression.vtype);
+ }
+ if (!*out)
+ return false;
+
+ /* Hm that should be it... */
+ return true;
+}
+
+bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
+{
+ ast_expression_codegen *cgen;
+
+ ir_value *condval;
+ ir_value *dummy;
+
+ ir_block *cond = func->curblock;
+ ir_block *ontrue;
+ ir_block *onfalse;
+ ir_block *merge;
+
+ /* We don't output any value, thus also don't care about r/lvalue */
+ (void)out;
+ (void)lvalue;
+
+ /* create blocks first, it's nicer if they're ordered */
+
+ if (self->on_true) {
+ /* create on-true block */
+ ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
+ if (!ontrue)
+ return false;
+ } else
+ ontrue = NULL;
+
+ if (self->on_false) {
+ /* create on-false block */
+ onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
+ if (!onfalse)
+ return false;
+ } else
+ onfalse = NULL;
+
+ merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
+ if (!merge)
+ return NULL;
+
+ /* generate the condition */
+ func->curblock = cond;
+ cgen = self->cond->expression.codegen;
+ if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
+ return false;
+
+ if (!ir_block_create_if(cond, condval,
+ (ontrue ? ontrue : merge),
+ (onfalse ? onfalse : merge)))
+ {
+ return false;
+ }
+
+ /* on-true path */
+ if (ontrue) {
+ /* enter the block */
+ func->curblock = ontrue;
+
+ /* generate */
+ cgen = self->on_true->expression.codegen;
+ if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
+ return false;
+
+ /* jump to merge block */
+ if (!ir_block_create_jump(ontrue, merge))
+ return false;
+ }
+
+ /* on-false path */
+ if (onfalse) {
+ /* enter the block */
+ func->curblock = onfalse;
+
+ /* generate */
+ cgen = self->on_false->expression.codegen;
+ if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
+ return false;
+
+ /* jump to merge block */
+ if (!ir_block_create_jump(ontrue, merge))
+ return false;
+ }
+
+ /* Now enter the merge block */
+ func->curblock = merge;
+
+ return true;
+}
+
+bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
+{
+ ast_expression_codegen *cgen;
+
+ ir_value *condval;
+ ir_value *trueval, *falseval;
+ ir_instr *phi;
+
+ ir_block *cond = func->curblock;
+ ir_block *ontrue;
+ ir_block *onfalse;
+ ir_block *merge;
+
+ /* 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;
+ }
+
+ /* Ternary can never create an lvalue... */
+ if (lvalue)
+ return false;
+
+ /* In the following, contraty to ast_ifthen, we assume both paths exist. */
+
+ /* create on-true block */
+ ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
+ if (!ontrue)
+ return false;
+
+ /* create on-false block */
+ onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
+ if (!onfalse)
+ return false;
+
+ merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
+ if (!merge)
+ return NULL;
+
+ /* generate the condition */
+ func->curblock = cond;
+ cgen = self->cond->expression.codegen;
+ if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
+ return false;
+
+ if (!ir_block_create_if(cond, condval, ontrue, onfalse))
+ return false;
+
+ /* on-true path */
+ /* enter the block */
+ func->curblock = ontrue;
+
+ /* generate */
+ cgen = self->on_true->expression.codegen;
+ if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
+ return false;
+
+ /* jump to merge block */
+ if (!ir_block_create_jump(ontrue, merge))
+ return false;
+
+ /* on-false path */
+ /* enter the block */
+ func->curblock = onfalse;
+
+ /* generate */
+ cgen = self->on_false->expression.codegen;
+ if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
+ return false;
+
+ /* jump to merge block */
+ if (!ir_block_create_jump(ontrue, merge))
+ return false;
+
+ /* Now enter the merge block */
+ func->curblock = merge;
+
+ /* Here, now, we need a PHI node
+ * but first some sanity checking...
+ */
+ if (trueval->vtype != falseval->vtype) {
+ /* error("ternary with different types on the two sides"); */
+ return false;
+ }
+
+ /* create PHI */
+ phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
+ if (!phi ||
+ !ir_phi_add(phi, ontrue, trueval) ||
+ !ir_phi_add(phi, onfalse, falseval))
+ {
+ return false;
+ }
+
+ self->phi_out = ir_phi_value(phi);
+ *out = self->phi_out;
+
+ return true;
}
projects / xonotic / gmqcc.git / blobdiff