if (!self) { \
return NULL; \
} \
- ast_node_init((ast_node*)self, ctx); \
+ ast_node_init((ast_node*)self, ctx, TYPE_##T); \
( (ast_node*)self )->node.destroy = (ast_node_delete*)destroyfn
+/* error handling */
+static void asterror(lex_ctx ctx, const char *msg, ...)
+{
+ va_list ap;
+ va_start(ap, msg);
+ cvprintmsg(ctx, LVL_ERROR, "error", msg, ap);
+ va_end(ap);
+}
+
/* It must not be possible to get here. */
-static void _ast_node_destroy(ast_node *self)
+static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
{
fprintf(stderr, "ast node missing destroy()\n");
abort();
}
/* Initialize main ast node aprts */
-static void ast_node_init(ast_node *self, lex_ctx ctx)
+static void ast_node_init(ast_node *self, lex_ctx ctx, int nodetype)
{
self->node.context = ctx;
self->node.destroy = &_ast_node_destroy;
self->node.keep = false;
+ self->node.nodetype = nodetype;
}
/* General expression initialization */
self->expression.codegen = codegen;
self->expression.vtype = TYPE_VOID;
self->expression.next = NULL;
+ self->expression.outl = NULL;
+ self->expression.outr = NULL;
+ MEM_VECTOR_INIT(&self->expression, params);
}
static void ast_expression_delete(ast_expression *self)
{
+ size_t i;
if (self->expression.next)
ast_delete(self->expression.next);
+ for (i = 0; i < self->expression.params_count; ++i) {
+ ast_delete(self->expression.params[i]);
+ }
+ MEM_VECTOR_CLEAR(&self->expression, params);
}
static void ast_expression_delete_full(ast_expression *self)
mem_d(self);
}
-static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
+MEM_VEC_FUNCTIONS(ast_expression_common, ast_value*, params)
+
+ast_value* ast_value_copy(const ast_value *self)
{
- const ast_expression_common *cpex;
+ size_t i;
+ const ast_expression_common *fromex;
+ ast_expression_common *selfex;
+ ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
+ if (self->expression.next) {
+ cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
+ if (!cp->expression.next) {
+ ast_value_delete(cp);
+ return NULL;
+ }
+ }
+ fromex = &self->expression;
+ selfex = &cp->expression;
+ for (i = 0; i < fromex->params_count; ++i) {
+ ast_value *v = ast_value_copy(fromex->params[i]);
+ if (!v || !ast_expression_common_params_add(selfex, v)) {
+ ast_value_delete(cp);
+ return NULL;
+ }
+ }
+ return cp;
+}
+
+bool ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
+{
+ size_t i;
+ const ast_expression_common *fromex;
+ ast_expression_common *selfex;
+ self->expression.vtype = other->expression.vtype;
+ if (other->expression.next) {
+ self->expression.next = (ast_expression*)ast_type_copy(ast_ctx(self), other->expression.next);
+ if (!self->expression.next)
+ return false;
+ }
+ fromex = &other->expression;
+ selfex = &self->expression;
+ for (i = 0; i < fromex->params_count; ++i) {
+ ast_value *v = ast_value_copy(fromex->params[i]);
+ if (!v || !ast_expression_common_params_add(selfex, v))
+ return false;
+ }
+ return true;
+}
+
+static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
+{
+ ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
+ ast_expression_init(self, NULL);
+ self->expression.codegen = NULL;
+ self->expression.next = NULL;
+ self->expression.vtype = vtype;
+ return self;
+}
+
+ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
+{
+ size_t i;
+ const ast_expression_common *fromex;
ast_expression_common *selfex;
if (!ex)
else
{
ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
+ ast_expression_init(self, NULL);
- cpex = &ex->expression;
+ fromex = &ex->expression;
selfex = &self->expression;
- selfex->vtype = cpex->vtype;
- if (cpex->next)
+ /* This may never be codegen()d */
+ selfex->codegen = NULL;
+
+ selfex->vtype = fromex->vtype;
+ if (fromex->next)
{
- selfex->next = ast_type_copy(ctx, cpex->next);
+ selfex->next = ast_type_copy(ctx, fromex->next);
if (!selfex->next) {
- mem_d(self);
+ ast_expression_delete_full(self);
return NULL;
}
}
else
selfex->next = NULL;
- /* This may never be codegen()d */
- selfex->codegen = NULL;
+ for (i = 0; i < fromex->params_count; ++i) {
+ ast_value *v = ast_value_copy(fromex->params[i]);
+ if (!v || !ast_expression_common_params_add(selfex, v)) {
+ ast_expression_delete_full(self);
+ return NULL;
+ }
+ }
+
return self;
}
}
+bool ast_compare_type(ast_expression *a, ast_expression *b)
+{
+ if (a->expression.vtype != b->expression.vtype)
+ return false;
+ if (!a->expression.next != !b->expression.next)
+ return false;
+ if (a->expression.params_count != b->expression.params_count)
+ return false;
+ if (a->expression.params_count) {
+ size_t i;
+ for (i = 0; i < a->expression.params_count; ++i) {
+ if (!ast_compare_type((ast_expression*)a->expression.params[i],
+ (ast_expression*)b->expression.params[i]))
+ return false;
+ }
+ }
+ if (a->expression.next)
+ return ast_compare_type(a->expression.next, b->expression.next);
+ return true;
+}
+
ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
{
ast_instantiate(ast_value, ctx, ast_value_delete);
self->name = name ? util_strdup(name) : NULL;
self->expression.vtype = t;
self->expression.next = NULL;
- MEM_VECTOR_INIT(self, params);
self->isconst = false;
memset(&self->constval, 0, sizeof(self->constval));
return self;
}
-MEM_VEC_FUNCTIONS(ast_value, ast_value*, params)
void ast_value_delete(ast_value* self)
{
- size_t i;
if (self->name)
mem_d((void*)self->name);
- 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->isconst) {
switch (self->expression.vtype)
{
mem_d(self);
}
+bool GMQCC_WARN ast_value_params_add(ast_value *self, ast_value *p)
+{
+ return ast_expression_common_params_add(&self->expression, p);
+}
+
bool ast_value_set_name(ast_value *self, const char *name)
{
if (self->name)
self->left = left;
self->right = right;
+ if (op >= INSTR_EQ_F && op <= INSTR_GT)
+ self->expression.vtype = TYPE_FLOAT;
+ else if (op == INSTR_AND || op == INSTR_OR ||
+ op == INSTR_BITAND || op == INSTR_BITOR)
+ self->expression.vtype = TYPE_FLOAT;
+ else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
+ self->expression.vtype = TYPE_VECTOR;
+ else if (op == INSTR_MUL_V)
+ self->expression.vtype = TYPE_FLOAT;
+ else
+ self->expression.vtype = left->expression.vtype;
+
return self;
}
mem_d(self);
}
+ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
+ ast_expression* left, ast_expression* right)
+{
+ ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
+ ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
+
+ self->opstore = storop;
+ self->opbin = op;
+ self->dest = left;
+ self->source = right;
+
+ self->expression.vtype = left->expression.vtype;
+ if (left->expression.next) {
+ self->expression.next = ast_type_copy(ctx, left);
+ if (!self->expression.next) {
+ ast_delete(self);
+ return NULL;
+ }
+ }
+ else
+ self->expression.next = NULL;
+
+ return self;
+}
+
+void ast_binstore_delete(ast_binstore *self)
+{
+ ast_unref(self->dest);
+ ast_unref(self->source);
+ ast_expression_delete((ast_expression*)self);
+ mem_d(self);
+}
+
+ast_unary* ast_unary_new(lex_ctx ctx, int op,
+ ast_expression *expr)
+{
+ ast_instantiate(ast_unary, ctx, ast_unary_delete);
+ ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
+
+ self->op = op;
+ self->operand = expr;
+
+ if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
+ self->expression.vtype = TYPE_FLOAT;
+ } else
+ asterror(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
+
+ return self;
+}
+
+void ast_unary_delete(ast_unary *self)
+{
+ ast_unref(self->operand);
+ ast_expression_delete((ast_expression*)self);
+ mem_d(self);
+}
+
+ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
+{
+ ast_instantiate(ast_return, ctx, ast_return_delete);
+ ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
+
+ self->operand = expr;
+
+ return self;
+}
+
+void ast_return_delete(ast_return *self)
+{
+ if (self->operand)
+ ast_unref(self->operand);
+ 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_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;
+ if (!ast_type_adopt(self, outtype)) {
+ ast_entfield_delete(self);
+ return NULL;
+ }
+
return self;
}
mem_d(self);
}
+ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field)
+{
+ ast_instantiate(ast_member, ctx, ast_member_delete);
+ if (field >= 3) {
+ mem_d(self);
+ return NULL;
+ }
+
+ if (owner->expression.vtype != TYPE_VECTOR &&
+ owner->expression.vtype != TYPE_FIELD) {
+ asterror(ctx, "member-access on an invalid owner of type %s\n", type_name[owner->expression.vtype]);
+ mem_d(self);
+ return NULL;
+ }
+
+ ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
+ self->expression.node.keep = true; /* keep */
+
+ if (owner->expression.vtype == TYPE_VECTOR) {
+ self->expression.vtype = TYPE_FLOAT;
+ self->expression.next = NULL;
+ } else {
+ self->expression.vtype = TYPE_FIELD;
+ self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
+ }
+
+ self->owner = owner;
+ self->field = field;
+
+ return self;
+}
+
+void ast_member_delete(ast_member *self)
+{
+ /* The owner is always an ast_value, which has .keep=true,
+ * also: ast_members are usually deleted after the owner, thus
+ * this will cause invalid access
+ ast_unref(self->owner);
+ * once we allow (expression).x to access a vector-member, we need
+ * to change this: preferably by creating an alternate ast node for this
+ * purpose that is not garbage-collected.
+ */
+ 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);
mem_d(self);
}
+ast_call* ast_call_new(lex_ctx ctx,
+ ast_expression *funcexpr)
+{
+ ast_instantiate(ast_call, ctx, ast_call_delete);
+ ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
+
+ MEM_VECTOR_INIT(self, params);
+
+ self->func = funcexpr;
+
+ self->expression.vtype = funcexpr->expression.next->expression.vtype;
+ if (funcexpr->expression.next->expression.next)
+ self->expression.next = ast_type_copy(ctx, funcexpr->expression.next->expression.next);
+
+ return self;
+}
+MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
+
+void ast_call_delete(ast_call *self)
+{
+ size_t i;
+ for (i = 0; i < self->params_count; ++i)
+ ast_unref(self->params[i]);
+ MEM_VECTOR_CLEAR(self, params);
+
+ if (self->func)
+ ast_unref(self->func);
+
+ ast_expression_delete((ast_expression*)self);
+ mem_d(self);
+}
+
ast_store* ast_store_new(lex_ctx ctx, int op,
- ast_value *dest, ast_expression *source)
+ ast_expression *dest, ast_expression *source)
{
ast_instantiate(ast_store, ctx, ast_store_delete);
ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
MEM_VECTOR_INIT(self, locals);
MEM_VECTOR_INIT(self, exprs);
+ MEM_VECTOR_INIT(self, collect);
return self;
}
MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
+MEM_VEC_FUNCTIONS(ast_block, ast_expression*, collect)
+
+bool ast_block_collect(ast_block *self, ast_expression *expr)
+{
+ if (!ast_block_collect_add(self, expr))
+ return false;
+ expr->expression.node.keep = true;
+ return true;
+}
void ast_block_delete(ast_block *self)
{
for (i = 0; i < self->locals_count; ++i)
ast_delete(self->locals[i]);
MEM_VECTOR_CLEAR(self, locals);
+ for (i = 0; i < self->collect_count; ++i)
+ ast_delete(self->collect[i]);
+ MEM_VECTOR_CLEAR(self, collect);
ast_expression_delete((ast_expression*)self);
mem_d(self);
}
+bool ast_block_set_type(ast_block *self, ast_expression *from)
+{
+ if (self->expression.next)
+ ast_delete(self->expression.next);
+ self->expression.vtype = from->expression.vtype;
+ if (from->expression.next) {
+ self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
+ if (!self->expression.next)
+ return false;
+ }
+ else
+ self->expression.next = NULL;
+ return true;
+}
+
ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
{
ast_instantiate(ast_function, ctx, ast_function_delete);
MEM_VECTOR_INIT(self, blocks);
self->labelcount = 0;
+ self->builtin = 0;
self->ir_func = NULL;
self->curblock = NULL;
* and the ast-user should take care of ast_global_codegen to be used
* on all the globals.
*/
- if (!self->ir_v)
+ if (!self->ir_v) {
+ asterror(ast_ctx(self), "ast_value used before generated (%s)\n", self->name);
return false;
+ }
*out = self->ir_v;
return true;
}
ir_value *v = NULL;
if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
{
- ir_function *func = ir_builder_create_function(ir, self->name);
+ ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
if (!func)
return false;
+ func->context = ast_ctx(self);
self->constval.vfunc->ir_func = func;
+ self->ir_v = func->value;
/* The function is filled later on ast_function_codegen... */
return true;
}
+ if (self->expression.vtype == TYPE_FIELD) {
+ v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
+ if (!v)
+ return false;
+ v->context = ast_ctx(self);
+ if (self->isconst) {
+ asterror(ast_ctx(self), "TODO: constant field pointers with value\n");
+ goto error;
+ }
+ self->ir_v = v;
+ return true;
+ }
+
v = ir_builder_create_global(ir, self->name, self->expression.vtype);
- if (!v)
+ if (!v) {
+ asterror(ast_ctx(self), "ir_builder_create_global failed\n");
return false;
+ }
+ v->context = ast_ctx(self);
if (self->isconst) {
switch (self->expression.vtype)
goto error;
break;
case TYPE_FUNCTION:
+ asterror(ast_ctx(self), "global of type function not properly generated\n");
+ goto error;
/* Cannot generate an IR value for a function,
* need a pointer pointing to a function rather.
*/
- goto error;
default:
- printf("TODO: global constant type %i\n", self->expression.vtype);
+ asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
break;
}
}
return false;
}
-bool ast_local_codegen(ast_value *self, ir_function *func)
+bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
{
ir_value *v = NULL;
if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
return false;
}
- v = ir_function_create_local(func, self->name, self->expression.vtype);
+ v = ir_function_create_local(func, self->name, self->expression.vtype, param);
if (!v)
return false;
+ v->context = ast_ctx(self);
/* A constant local... hmmm...
* I suppose the IR will have to deal with this
goto error;
break;
default:
- printf("TODO: global constant type %i\n", self->expression.vtype);
+ asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
break;
}
}
{
ir_function *irf;
ir_value *dummy;
+ ast_expression_common *ec;
size_t i;
irf = self->ir_func;
if (!irf) {
- printf("ast_function's related ast_value was not generated yet\n");
+ asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet\n");
+ return false;
+ }
+
+ /* fill the parameter list */
+ ec = &self->vtype->expression;
+ for (i = 0; i < ec->params_count; ++i)
+ {
+ if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
+ return false;
+ if (!self->builtin) {
+ if (!ast_local_codegen(ec->params[i], self->ir_func, true))
+ return false;
+ }
+ }
+
+ if (self->builtin) {
+ irf->builtin = self->builtin;
+ return true;
+ }
+
+ if (!self->blocks_count) {
+ asterror(ast_ctx(self), "function `%s` has no body", self->name);
return false;
}
/* TODO: check return types */
if (!self->curblock->is_return)
{
+ return ir_block_create_return(self->curblock, NULL);
+ /* From now on the parser has to handle this situation */
+#if 0
if (!self->vtype->expression.next ||
self->vtype->expression.next->expression.vtype == TYPE_VOID)
+ {
return ir_block_create_return(self->curblock, NULL);
+ }
else
{
/* error("missing return"); */
+ asterror(ast_ctx(self), "function `%s` missing return value", self->name);
return false;
}
+#endif
}
return true;
}
* of the form: (a, b, c) = x should not assign to c...
*/
(void)lvalue;
+ if (self->expression.outr) {
+ *out = self->expression.outr;
+ return true;
+ }
/* output is NULL at first, we'll have each expression
* assign to out output, thus, a comma-operator represention
/* generate locals */
for (i = 0; i < self->locals_count; ++i)
{
- if (!ast_local_codegen(self->locals[i], func->ir_func))
+ if (!ast_local_codegen(self->locals[i], func->ir_func, false))
return false;
}
return false;
}
+ self->expression.outr = *out;
+
return true;
}
ast_expression_codegen *cgen;
ir_value *left, *right;
+ if (lvalue && self->expression.outl) {
+ *out = self->expression.outl;
+ return true;
+ }
+
+ if (!lvalue && self->expression.outr) {
+ *out = self->expression.outr;
+ return true;
+ }
+
cgen = self->dest->expression.codegen;
/* lvalue! */
if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
return false;
+ self->expression.outl = left;
cgen = self->source->expression.codegen;
/* rvalue! */
if (!ir_block_create_store_op(func->curblock, self->op, left, right))
return false;
+ self->expression.outr = right;
/* Theoretically, an assinment returns its left side as an
* lvalue, if we don't need an lvalue though, we return
/* In the context of a binary operation, we can disregard
* the lvalue flag.
*/
- (void)lvalue;
+ (void)lvalue;
+ if (self->expression.outr) {
+ *out = self->expression.outr;
+ return true;
+ }
cgen = self->left->expression.codegen;
/* lvalue! */
self->op, left, right);
if (!*out)
return false;
+ self->expression.outr = *out;
+
+ return true;
+}
+
+bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
+{
+ ast_expression_codegen *cgen;
+ ir_value *leftl, *leftr, *right, *bin;
+
+ if (lvalue && self->expression.outl) {
+ *out = self->expression.outl;
+ return true;
+ }
+
+ if (!lvalue && self->expression.outr) {
+ *out = self->expression.outr;
+ return true;
+ }
+
+ /* for a binstore we need both an lvalue and an rvalue for the left side */
+ /* rvalue of destination! */
+ cgen = self->dest->expression.codegen;
+ if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
+ return false;
+
+ /* source as rvalue only */
+ cgen = self->source->expression.codegen;
+ if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
+ return false;
+
+ /* now the binary */
+ bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
+ self->opbin, leftr, right);
+ self->expression.outr = bin;
+
+ /* now store them */
+ cgen = self->dest->expression.codegen;
+ /* lvalue of destination */
+ if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
+ return false;
+ self->expression.outl = leftl;
+
+ if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
+ return false;
+ self->expression.outr = bin;
+
+ /* 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 ? leftl : bin);
+
+ return true;
+}
+
+bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
+{
+ ast_expression_codegen *cgen;
+ ir_value *operand;
+
+ /* In the context of a unary operation, we can disregard
+ * the lvalue flag.
+ */
+ (void)lvalue;
+ if (self->expression.outr) {
+ *out = self->expression.outr;
+ return true;
+ }
+
+ cgen = self->operand->expression.codegen;
+ /* lvalue! */
+ if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
+ return false;
+
+ *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
+ self->op, operand);
+ if (!*out)
+ return false;
+ self->expression.outr = *out;
+
+ return true;
+}
+
+bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
+{
+ ast_expression_codegen *cgen;
+ ir_value *operand;
+
+ /* In the context of a return operation, we can disregard
+ * the lvalue flag.
+ */
+ (void)lvalue;
+ if (self->expression.outr) {
+ asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!\n");
+ return false;
+ }
+ self->expression.outr = (ir_value*)1;
+
+ if (self->operand) {
+ cgen = self->operand->expression.codegen;
+ /* lvalue! */
+ if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
+ return false;
+
+ if (!ir_block_create_return(func->curblock, operand))
+ return false;
+ } else {
+ if (!ir_block_create_return(func->curblock, NULL))
+ return false;
+ }
return true;
}
* value in a temp.
*/
+ if (lvalue && self->expression.outl) {
+ *out = self->expression.outl;
+ return true;
+ }
+
+ if (!lvalue && self->expression.outr) {
+ *out = self->expression.outr;
+ return true;
+ }
+
cgen = self->entity->expression.codegen;
if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
return false;
*out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
ent, field, self->expression.vtype);
}
- if (!*out)
+ if (!*out) {
+ asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
+ (lvalue ? "ADDRESS" : "FIELD"),
+ type_name[self->expression.vtype]);
return false;
+ }
+
+ if (lvalue)
+ self->expression.outl = *out;
+ else
+ self->expression.outr = *out;
/* Hm that should be it... */
return true;
}
+bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
+{
+ ast_expression_codegen *cgen;
+ ir_value *vec;
+
+ /* in QC this is always an lvalue */
+ (void)lvalue;
+ if (self->expression.outl) {
+ *out = self->expression.outl;
+ return true;
+ }
+
+ cgen = self->owner->expression.codegen;
+ if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
+ return false;
+
+ if (vec->vtype != TYPE_VECTOR &&
+ !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
+ {
+ return false;
+ }
+
+ *out = ir_value_vector_member(vec, self->field);
+ self->expression.outl = *out;
+
+ return (*out != NULL);
+}
+
bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
{
ast_expression_codegen *cgen;
(void)out;
(void)lvalue;
+ if (self->expression.outr) {
+ asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!\n");
+ return false;
+ }
+ self->expression.outr = (ir_value*)1;
+
/* generate the condition */
func->curblock = cond;
cgen = self->cond->expression.codegen;
return false;
} else
ontrue = NULL;
-
+
/* on-false path */
if (self->on_false) {
/* create on-false block */
/* Merge block were they all merge in to */
merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
if (!merge)
- return NULL;
+ return false;
/* add jumps ot the merge block */
- if (ontrue && !ir_block_create_jump(ontrue, merge))
+ if (ontrue && !ontrue->final && !ir_block_create_jump(ontrue, merge))
return false;
- if (onfalse && !ir_block_create_jump(onfalse, merge))
+ if (onfalse && !onfalse->final && !ir_block_create_jump(onfalse, merge))
return false;
/* we create the if here, that way all blocks are ordered :)
ir_block *onfalse;
ir_block *merge;
+ /* Ternary can never create an lvalue... */
+ if (lvalue)
+ return false;
+
/* 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
return true;
}
- /* Ternary can never create an lvalue... */
- if (lvalue)
- return false;
-
/* In the following, contraty to ast_ifthen, we assume both paths exist. */
-
+
/* generate the condition */
func->curblock = cond;
cgen = self->cond->expression.codegen;
if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
return false;
}
-
+
/* create on-false block */
onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
if (!onfalse)
/* create merge block */
merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
if (!merge)
- return NULL;
+ return false;
/* jump to merge block */
if (!ir_block_create_jump(ontrue, merge))
return false;
{
ast_expression_codegen *cgen;
- ir_value *dummy;
- ir_value *precond;
- ir_value *postcond;
+ ir_value *dummy = NULL;
+ ir_value *precond = NULL;
+ ir_value *postcond = NULL;
/* Since we insert some jumps "late" so we have blocks
* ordered "nicely", we need to keep track of the actual end-blocks
* of expressions to add the jumps to.
*/
- ir_block *bbody, *end_bbody;
- ir_block *bprecond, *end_bprecond;
- ir_block *bpostcond, *end_bpostcond;
- ir_block *bincrement, *end_bincrement;
- ir_block *bout, *bin;
+ ir_block *bbody = NULL, *end_bbody = NULL;
+ ir_block *bprecond = NULL, *end_bprecond = NULL;
+ ir_block *bpostcond = NULL, *end_bpostcond = NULL;
+ ir_block *bincrement = NULL, *end_bincrement = NULL;
+ ir_block *bout = NULL, *bin = NULL;
+
+ /* let's at least move the outgoing block to the end */
+ size_t bout_id;
/* 'break' and 'continue' need to be able to find the right blocks */
- ir_block *bcontinue = NULL;
- ir_block *bbreak = NULL;
+ ir_block *bcontinue = NULL;
+ ir_block *bbreak = NULL;
- ir_block *old_bcontinue;
- ir_block *old_bbreak;
+ ir_block *old_bcontinue = NULL;
+ ir_block *old_bbreak = NULL;
+
+ ir_block *tmpblock = NULL;
(void)lvalue;
(void)out;
+ if (self->expression.outr) {
+ asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!\n");
+ return false;
+ }
+ self->expression.outr = (ir_value*)1;
+
/* NOTE:
* Should we ever need some kind of block ordering, better make this function
* move blocks around than write a block ordering algorithm later... after all
bpostcond = end_bpostcond = NULL;
}
+ bout_id = func->ir_func->blocks_count;
bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
if (!bout)
return false;
end_bincrement = func->curblock;
}
+ /* In any case now, we continue from the outgoing block */
+ func->curblock = bout;
+
/* Now all blocks are in place */
/* From 'bin' we jump to whatever comes first */
- if (bprecond && !ir_block_create_jump(bin, bprecond))
- return false;
- else if (bbody && !ir_block_create_jump(bin, bbody))
- return false;
- else if (bpostcond && !ir_block_create_jump(bin, bpostcond))
- return false;
- else if ( !ir_block_create_jump(bin, bout))
+ if (bprecond) tmpblock = bprecond;
+ else if (bbody) tmpblock = bbody;
+ else if (bpostcond) tmpblock = bpostcond;
+ else tmpblock = bout;
+ if (!ir_block_create_jump(bin, tmpblock))
return false;
/* From precond */
/* from body */
if (bbody)
{
- if (bincrement && !ir_block_create_jump(end_bbody, bincrement))
- return false;
- else if (bpostcond && !ir_block_create_jump(end_bbody, bpostcond))
- return false;
- else if (bprecond && !ir_block_create_jump(end_bbody, bprecond))
- return false;
- else if (!ir_block_create_jump(end_bbody, bout))
+ if (bincrement) tmpblock = bincrement;
+ else if (bpostcond) tmpblock = bpostcond;
+ else if (bprecond) tmpblock = bprecond;
+ else tmpblock = bout;
+ if (!end_bbody->final && !ir_block_create_jump(end_bbody, tmpblock))
return false;
}
/* from increment */
if (bincrement)
{
- if (bpostcond && !ir_block_create_jump(end_bincrement, bpostcond))
- return false;
- else if (bprecond && !ir_block_create_jump(end_bincrement, bprecond))
- return false;
- else if (bbody && !ir_block_create_jump(end_bincrement, bbody))
- return false;
- else if (!ir_block_create_jump(end_bincrement, bout))
+ if (bpostcond) tmpblock = bpostcond;
+ else if (bprecond) tmpblock = bprecond;
+ else if (bbody) tmpblock = bbody;
+ else tmpblock = bout;
+ if (!ir_block_create_jump(end_bincrement, tmpblock))
return false;
}
return false;
}
+ /* Move 'bout' to the end */
+ if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
+ !ir_function_blocks_add(func->ir_func, bout))
+ {
+ ir_block_delete(bout);
+ return false;
+ }
+
+ return true;
+}
+
+bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
+{
+ ast_expression_codegen *cgen;
+ ir_value_vector params;
+ ir_instr *callinstr;
+ size_t i;
+
+ ir_value *funval = NULL;
+
+ /* return values are never lvalues */
+ (void)lvalue;
+
+ if (self->expression.outr) {
+ *out = self->expression.outr;
+ return true;
+ }
+
+ cgen = self->func->expression.codegen;
+ if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
+ return false;
+ if (!funval)
+ return false;
+
+ MEM_VECTOR_INIT(¶ms, v);
+
+ /* parameters */
+ for (i = 0; i < self->params_count; ++i)
+ {
+ ir_value *param;
+ ast_expression *expr = self->params[i];
+
+ cgen = expr->expression.codegen;
+ if (!(*cgen)(expr, func, false, ¶m))
+ goto error;
+ if (!param)
+ goto error;
+ if (!ir_value_vector_v_add(¶ms, param))
+ goto error;
+ }
+
+ callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
+ if (!callinstr)
+ goto error;
+
+ for (i = 0; i < params.v_count; ++i) {
+ if (!ir_call_param(callinstr, params.v[i]))
+ goto error;
+ }
+
+ *out = ir_call_value(callinstr);
+ self->expression.outr = *out;
+
+ MEM_VECTOR_CLEAR(¶ms, v);
return true;
+error:
+ MEM_VECTOR_CLEAR(¶ms, v);
+ return false;
}