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 GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
{
}
/* 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 */
static void ast_expression_init(ast_expression *self,
ast_expression_codegen *codegen)
{
- self->expression.codegen = codegen;
- self->expression.vtype = TYPE_VOID;
- self->expression.next = NULL;
+ self->expression.codegen = codegen;
+ self->expression.vtype = TYPE_VOID;
+ self->expression.next = NULL;
+ self->expression.outl = NULL;
+ self->expression.outr = NULL;
+ self->expression.variadic = false;
+ 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)
+{
+ 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;
+ selfex->variadic = fromex->variadic;
+ 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;
+ selfex->variadic = fromex->variadic;
+ 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)
{
- const ast_expression_common *cpex;
+ 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;
+ selfex->variadic = fromex->variadic;
+ 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.variadic != b->expression.variadic)
+ 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;
+}
+
+static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
+{
+ const char *typestr;
+ size_t typelen;
+ size_t i;
+
+ if (!e) {
+ if (pos + 6 >= bufsize)
+ goto full;
+ strcpy(buf + pos, "(null)");
+ return pos + 6;
+ }
+
+ if (pos + 1 >= bufsize)
+ goto full;
+
+ switch (e->expression.vtype) {
+ case TYPE_VARIANT:
+ strcpy(buf + pos, "(variant)");
+ return pos + 9;
+
+ case TYPE_FIELD:
+ buf[pos++] = '.';
+ return ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
+
+ case TYPE_POINTER:
+ if (pos + 3 >= bufsize)
+ goto full;
+ buf[pos++] = '*';
+ buf[pos++] = '(';
+ pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
+ if (pos + 1 >= bufsize)
+ goto full;
+ buf[pos++] = ')';
+ return pos;
+
+ case TYPE_FUNCTION:
+ pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos);
+ if (pos + 2 >= bufsize)
+ goto full;
+ if (e->expression.params_count == 0) {
+ buf[pos++] = '(';
+ buf[pos++] = ')';
+ return pos;
+ }
+ buf[pos++] = '(';
+ pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[0]), buf, bufsize, pos);
+ for (i = 1; i < e->expression.params_count; ++i) {
+ if (pos + 2 >= bufsize)
+ goto full;
+ buf[pos++] = ',';
+ buf[pos++] = ' ';
+ pos = ast_type_to_string_impl((ast_expression*)(e->expression.params[i]), buf, bufsize, pos);
+ }
+ if (pos + 1 >= bufsize)
+ goto full;
+ buf[pos++] = ')';
+ return pos;
+
+ default:
+ typestr = type_name[e->expression.vtype];
+ typelen = strlen(typestr);
+ if (pos + typelen >= bufsize)
+ goto full;
+ strcpy(buf + pos, typestr);
+ return pos + typelen;
+ }
+
+full:
+ buf[bufsize-3] = '.';
+ buf[bufsize-2] = '.';
+ buf[bufsize-1] = '.';
+ return bufsize;
+}
+
+void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
+{
+ size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
+ buf[pos] = 0;
+}
+
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;
+ self->uses = 0;
memset(&self->constval, 0, sizeof(self->constval));
self->ir_v = NULL;
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)
{
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;
}
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", 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);
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)
mem_d(self);
}
+bool ast_call_check_types(ast_call *self)
+{
+ size_t i;
+ bool retval = true;
+ const ast_expression *func = self->func;
+ size_t count = self->params_count;
+ if (count > func->expression.params_count)
+ count = func->expression.params_count;
+
+ for (i = 0; i < count; ++i) {
+ if (!ast_compare_type(self->params[i], (ast_expression*)(func->expression.params[i]))) {
+ asterror(ast_ctx(self), "invalid type for parameter %u in function call",
+ (unsigned int)(i+1));
+ /* we don't immediately return */
+ retval = false;
+ }
+ }
+ return retval;
+}
+
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);
self->dest = dest;
self->source = source;
+ self->expression.vtype = dest->expression.vtype;
+ if (dest->expression.next) {
+ self->expression.next = ast_type_copy(ctx, dest);
+ if (!self->expression.next) {
+ ast_delete(self);
+ return NULL;
+ }
+ }
+ else
+ self->expression.next = NULL;
+
return self;
}
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_d(self);
}
-static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
+const char* ast_function_label(ast_function *self, const char *prefix)
{
- 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);
- }
- }
+ size_t id;
+ size_t len;
+ char *from;
- *buf = 0;
-#undef addch
-#undef checknul
-}
+ if (!opts_dump)
+ return NULL;
-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;
+ id = (self->labelcount++);
+ len = strlen(prefix);
+
+ from = self->labelbuf + sizeof(self->labelbuf)-1;
+ *from-- = 0;
+ do {
+ unsigned int digit = id % 10;
+ *from = digit + '0';
+ id /= 10;
+ } while (id);
+ memcpy(from - len, prefix, len);
+ return from - len;
}
/*********************************************************************/
* on all the globals.
*/
if (!self->ir_v) {
- printf("ast_value used before generated (%s)\n", self->name);
+ asterror(ast_ctx(self), "ast_value used before generated (%s)", self->name);
return false;
}
*out = self->ir_v;
ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
if (!func)
return false;
+ func->context = ast_ctx(self);
+ func->value->context = ast_ctx(self);
self->constval.vfunc->ir_func = func;
self->ir_v = func->value;
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");
+ 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");
return false;
+ }
+ v->context = ast_ctx(self);
if (self->isconst) {
switch (self->expression.vtype)
goto error;
break;
case TYPE_FUNCTION:
- printf("global of type function not properly generated\n");
+ asterror(ast_ctx(self), "global of type function not properly generated");
goto error;
/* Cannot generate an IR value for a function,
* need a pointer pointing to a function rather.
*/
default:
- printf("TODO: global constant type %i\n", self->expression.vtype);
+ asterror(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
break;
}
}
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", 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");
return false;
}
/* fill the parameter list */
- for (i = 0; i < self->vtype->params_count; ++i)
+ ec = &self->vtype->expression;
+ for (i = 0; i < ec->params_count; ++i)
{
- if (!ir_function_params_add(irf, self->vtype->params[i]->expression.vtype))
+ if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
return false;
if (!self->builtin) {
- if (!ast_local_codegen(self->vtype->params[i], self->ir_func, true))
+ if (!ast_local_codegen(ec->params[i], self->ir_func, true))
return false;
}
}
return true;
}
+ if (!self->blocks_count) {
+ asterror(ast_ctx(self), "function `%s` has no body", self->name);
+ return false;
+ }
+
self->curblock = ir_function_create_block(irf, "entry");
- if (!self->curblock)
+ if (!self->curblock) {
+ asterror(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
return false;
+ }
for (i = 0; i < self->blocks_count; ++i) {
ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
/* 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)
{
else
{
/* error("missing return"); */
+ asterror(ast_ctx(self), "function `%s` missing return value", self->name);
return false;
}
+#endif
}
return true;
}
* Note: an ast-representation using the comma-operator
* of the form: (a, b, c) = x should not assign to c...
*/
- (void)lvalue;
+ if (lvalue) {
+ asterror(ast_ctx(self), "not an l-value (code-block)");
+ return false;
+ }
+
+ 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, false))
+ if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
+ if (opts_debug)
+ asterror(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
return false;
+ }
}
for (i = 0; i < self->exprs_count; ++i)
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
ast_expression_codegen *cgen;
ir_value *left, *right;
- /* In the context of a binary operation, we can disregard
- * the lvalue flag.
- */
- (void)lvalue;
+ /* A binary operation cannot yield an l-value */
+ if (lvalue) {
+ asterror(ast_ctx(self), "not an l-value (binop)");
+ return false;
+ }
+
+ 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;
}
ast_expression_codegen *cgen;
ir_value *operand;
- /* In the context of a unary operation, we can disregard
- * the lvalue flag.
- */
- (void)lvalue;
+ /* An unary operation cannot yield an l-value */
+ if (lvalue) {
+ asterror(ast_ctx(self), "not an l-value (binop)");
+ return false;
+ }
+
+ 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, "bin"),
+ *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 don't actually return
+ * anything...
+ */
+ if (lvalue) {
+ asterror(ast_ctx(self), "return-expression is not an l-value");
+ return false;
+ }
+
+ if (self->expression.outr) {
+ asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
+ 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;
ir_block *cond = func->curblock;
ir_block *ontrue;
ir_block *onfalse;
+ ir_block *ontrue_endblock = NULL;
+ ir_block *onfalse_endblock = NULL;
ir_block *merge;
/* We don't output any value, thus also don't care about r/lvalue */
(void)out;
(void)lvalue;
+ if (self->expression.outr) {
+ asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
+ return false;
+ }
+ self->expression.outr = (ir_value*)1;
+
/* generate the condition */
func->curblock = cond;
cgen = self->cond->expression.codegen;
cgen = self->on_true->expression.codegen;
if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
return false;
+
+ /* we now need to work from the current endpoint */
+ ontrue_endblock = func->curblock;
} else
ontrue = NULL;
cgen = self->on_false->expression.codegen;
if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
return false;
+
+ /* we now need to work from the current endpoint */
+ onfalse_endblock = func->curblock;
} else
onfalse = NULL;
return false;
/* add jumps ot the merge block */
- if (ontrue && !ir_block_create_jump(ontrue, merge))
+ if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, merge))
return false;
- if (onfalse && !ir_block_create_jump(onfalse, merge))
+ if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, 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 */
(void)lvalue;
(void)out;
+ if (self->expression.outr) {
+ asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
+ 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
else if (bpostcond) tmpblock = bpostcond;
else if (bprecond) tmpblock = bprecond;
else tmpblock = bout;
- if (!ir_block_create_jump(end_bbody, tmpblock))
+ if (!end_bbody->final && !ir_block_create_jump(end_bbody, tmpblock))
return false;
}
ir_value *funval = NULL;
- /* return values are never rvalues */
- (void)lvalue;
+ /* return values are never lvalues */
+ if (lvalue) {
+ asterror(ast_ctx(self), "not an l-value (function call)");
+ return false;
+ }
+
+ if (self->expression.outr) {
+ *out = self->expression.outr;
+ return true;
+ }
cgen = self->func->expression.codegen;
if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
}
*out = ir_call_value(callinstr);
+ self->expression.outr = *out;
+ MEM_VECTOR_CLEAR(¶ms, v);
return true;
error:
MEM_VECTOR_CLEAR(¶ms, v);
projects / xonotic / gmqcc.git / blobdiff