X-Git-Url: https://git.xonotic.org/?p=xonotic%2Fgmqcc.git;a=blobdiff_plain;f=ast.c;h=f5ed565e93644b202798d2ff88c33ada85d57656;hp=71c4ae62b01423a45306dfa2c95f87beff6e114b;hb=b1425dfcf1afa18b81168ed57a4b790ddc0605b5;hpb=cfdf915b25352648748095685e00af917549639d diff --git a/ast.c b/ast.c index 71c4ae6..f5ed565 100644 --- a/ast.c +++ b/ast.c @@ -35,10 +35,19 @@ 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); + con_cvprintmsg((void*)&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) { - fprintf(stderr, "ast node missing destroy()\n"); + con_err("ast node missing destroy()\n"); abort(); } @@ -55,12 +64,13 @@ static void ast_node_init(ast_node *self, lex_ctx ctx, int nodetype) 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.outl = NULL; - self->expression.outr = NULL; - MEM_VECTOR_INIT(&self->expression, params); + 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; + self->expression.params = NULL; } static void ast_expression_delete(ast_expression *self) @@ -68,10 +78,10 @@ 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) { + for (i = 0; i < vec_size(self->expression.params); ++i) { ast_delete(self->expression.params[i]); } - MEM_VECTOR_CLEAR(&self->expression, params); + vec_free(self->expression.params); } static void ast_expression_delete_full(ast_expression *self) @@ -80,11 +90,11 @@ static void ast_expression_delete_full(ast_expression *self) mem_d(self); } -MEM_VEC_FUNCTIONS(ast_expression_common, ast_value*, params) - -static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex); -static ast_value* ast_value_copy(const ast_value *self) +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); @@ -93,19 +103,54 @@ static ast_value* ast_value_copy(const ast_value *self) return NULL; } } + fromex = &self->expression; + selfex = &cp->expression; + selfex->variadic = fromex->variadic; + for (i = 0; i < vec_size(fromex->params); ++i) { + ast_value *v = ast_value_copy(fromex->params[i]); + if (!v) { + ast_value_delete(cp); + return NULL; + } + vec_push(selfex->params, v); + } 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 < vec_size(fromex->params); ++i) { + ast_value *v = ast_value_copy(fromex->params[i]); + if (!v) + return false; + vec_push(selfex->params, v); + } + 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; } -static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex) +ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex) { size_t i; const ast_expression_common *fromex; @@ -116,6 +161,7 @@ static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex) else { ast_instantiate(ast_expression, ctx, ast_expression_delete_full); + ast_expression_init(self, NULL); fromex = &ex->expression; selfex = &self->expression; @@ -135,18 +181,135 @@ static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex) else selfex->next = NULL; - for (i = 0; i < fromex->params_count; ++i) { + selfex->variadic = fromex->variadic; + for (i = 0; i < vec_size(fromex->params); ++i) { ast_value *v = ast_value_copy(fromex->params[i]); - if (!v || !ast_expression_common_params_add(selfex, v)) { + if (!v) { ast_expression_delete_full(self); return NULL; } + vec_push(selfex->params, v); } 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 (vec_size(a->expression.params) != vec_size(b->expression.params)) + return false; + if (a->expression.variadic != b->expression.variadic) + return false; + if (vec_size(a->expression.params)) { + size_t i; + for (i = 0; i < vec_size(a->expression.params); ++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 (!vec_size(e->expression.params)) { + 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 < vec_size(e->expression.params); ++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; + + case TYPE_ARRAY: + pos = ast_type_to_string_impl(e->expression.next, buf, bufsize, pos); + if (pos + 1 >= bufsize) + goto full; + buf[pos++] = '['; + pos += snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->expression.count); + 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); @@ -158,9 +321,15 @@ ast_value* ast_value_new(lex_ctx ctx, const char *name, int t) self->expression.vtype = t; self->expression.next = NULL; self->isconst = false; + self->uses = 0; memset(&self->constval, 0, sizeof(self->constval)); - self->ir_v = NULL; + self->ir_v = NULL; + self->ir_values = NULL; + self->ir_value_count = 0; + + self->setter = NULL; + self->getter = NULL; return self; } @@ -186,13 +355,15 @@ void ast_value_delete(ast_value* self) break; } } + if (self->ir_values) + mem_d(self->ir_values); ast_expression_delete((ast_expression*)self); mem_d(self); } -bool GMQCC_WARN ast_value_params_add(ast_value *self, ast_value *p) +void ast_value_params_add(ast_value *self, ast_value *p) { - return ast_expression_common_params_add(&self->expression, p); + vec_push(self->expression.params, p); } bool ast_value_set_name(ast_value *self, const char *name) @@ -278,6 +449,11 @@ ast_unary* ast_unary_new(lex_ctx ctx, int op, 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; } @@ -300,23 +476,25 @@ ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr) void ast_return_delete(ast_return *self) { - ast_unref(self->operand); + 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_instantiate(ast_entfield, ctx, ast_entfield_delete); - if (field->expression.vtype != TYPE_FIELD) { - mem_d(self); + asterror(ctx, "ast_entfield_new with expression not of type field"); return NULL; } + return ast_entfield_new_force(ctx, entity, field, field->expression.next); +} + +ast_entfield* ast_entfield_new_force(lex_ctx ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype) +{ + ast_instantiate(ast_entfield, ctx, ast_entfield_delete); - outtype = field->expression.next; if (!outtype) { mem_d(self); /* Error: field has no type... */ @@ -325,12 +503,14 @@ ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expressi 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; } @@ -352,12 +532,13 @@ ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int fiel if (owner->expression.vtype != TYPE_VECTOR && owner->expression.vtype != TYPE_FIELD) { - printf("ast_member on an invalid owner of type %i\n", (int)owner->expression.vtype); + 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; @@ -375,7 +556,56 @@ ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int fiel 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_array_index* ast_array_index_new(lex_ctx ctx, ast_expression *array, ast_expression *index) +{ + ast_expression *outtype; + ast_instantiate(ast_array_index, ctx, ast_array_index_delete); + + outtype = array->expression.next; + if (!outtype) { + mem_d(self); + /* Error: field has no type... */ + return NULL; + } + + ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen); + + self->array = array; + self->index = index; + + if (!ast_type_adopt(self, outtype)) { + ast_array_index_delete(self); + return NULL; + } + if (array->expression.vtype == TYPE_FIELD && outtype->expression.vtype == TYPE_ARRAY) { + if (self->expression.vtype != TYPE_ARRAY) { + asterror(ast_ctx(self), "array_index node on type"); + ast_array_index_delete(self); + return NULL; + } + self->array = outtype; + self->expression.vtype = TYPE_FIELD; + } + + return self; +} + +void ast_array_index_delete(ast_array_index *self) +{ + ast_unref(self->array); + ast_unref(self->index); ast_expression_delete((ast_expression*)self); mem_d(self); } @@ -470,26 +700,71 @@ void ast_loop_delete(ast_loop *self) mem_d(self); } +ast_breakcont* ast_breakcont_new(lex_ctx ctx, bool iscont) +{ + ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete); + ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen); + + self->is_continue = iscont; + + return self; +} + +void ast_breakcont_delete(ast_breakcont *self) +{ + ast_expression_delete((ast_expression*)self); + mem_d(self); +} + +ast_switch* ast_switch_new(lex_ctx ctx, ast_expression *op) +{ + ast_instantiate(ast_switch, ctx, ast_switch_delete); + ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen); + + self->operand = op; + self->cases = NULL; + + return self; +} + +void ast_switch_delete(ast_switch *self) +{ + size_t i; + ast_unref(self->operand); + + for (i = 0; i < vec_size(self->cases); ++i) { + if (self->cases[i].value) + ast_unref(self->cases[i].value); + ast_unref(self->cases[i].code); + } + vec_free(self->cases); + + ast_expression_delete((ast_expression*)self); + 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->params = NULL; + self->func = funcexpr; - 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) + for (i = 0; i < vec_size(self->params); ++i) ast_unref(self->params[i]); - MEM_VECTOR_CLEAR(self, params); + vec_free(self->params); if (self->func) ast_unref(self->func); @@ -498,6 +773,26 @@ void ast_call_delete(ast_call *self) 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 = vec_size(self->params); + if (count > vec_size(func->expression.params)) + count = vec_size(func->expression.params); + + 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_expression *dest, ast_expression *source) { @@ -508,6 +803,17 @@ ast_store* ast_store_new(lex_ctx ctx, int op, 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; } @@ -525,23 +831,31 @@ ast_block* ast_block_new(lex_ctx ctx) ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_block_codegen); - MEM_VECTOR_INIT(self, locals); - MEM_VECTOR_INIT(self, exprs); + self->locals = NULL; + self->exprs = NULL; + self->collect = NULL; return self; } -MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals) -MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs) + +void ast_block_collect(ast_block *self, ast_expression *expr) +{ + vec_push(self->collect, expr); + expr->expression.node.keep = true; +} void ast_block_delete(ast_block *self) { size_t i; - for (i = 0; i < self->exprs_count; ++i) + for (i = 0; i < vec_size(self->exprs); ++i) ast_unref(self->exprs[i]); - MEM_VECTOR_CLEAR(self, exprs); - for (i = 0; i < self->locals_count; ++i) + vec_free(self->exprs); + for (i = 0; i < vec_size(self->locals); ++i) ast_delete(self->locals[i]); - MEM_VECTOR_CLEAR(self, locals); + vec_free(self->locals); + for (i = 0; i < vec_size(self->collect); ++i) + ast_delete(self->collect[i]); + vec_free(self->collect); ast_expression_delete((ast_expression*)self); mem_d(self); } @@ -556,6 +870,8 @@ bool ast_block_set_type(ast_block *self, ast_expression *from) if (!self->expression.next) return false; } + else + self->expression.next = NULL; return true; } @@ -571,9 +887,9 @@ ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype) return NULL; } - self->vtype = vtype; - self->name = name ? util_strdup(name) : NULL; - MEM_VECTOR_INIT(self, blocks); + self->vtype = vtype; + self->name = name ? util_strdup(name) : NULL; + self->blocks = NULL; self->labelcount = 0; self->builtin = 0; @@ -590,8 +906,6 @@ ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype) return self; } -MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks) - void ast_function_delete(ast_function *self) { size_t i; @@ -606,43 +920,33 @@ void ast_function_delete(ast_function *self) */ ast_unref(self->vtype); } - for (i = 0; i < self->blocks_count; ++i) + for (i = 0; i < vec_size(self->blocks); ++i) ast_delete(self->blocks[i]); - MEM_VECTOR_CLEAR(self, blocks); + vec_free(self->blocks); 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; } /*********************************************************************/ @@ -662,21 +966,26 @@ bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_valu * on all the globals. */ if (!self->ir_v) { - printf("ast_value used before generated (%s)\n", self->name); + char typename[1024]; + ast_type_to_string((ast_expression*)self, typename, sizeof(typename)); + asterror(ast_ctx(self), "ast_value used before generated %s %s", typename, self->name); return false; } *out = self->ir_v; return true; } -bool ast_global_codegen(ast_value *self, ir_builder *ir) +bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield) { ir_value *v = NULL; + if (self->isconst && self->expression.vtype == TYPE_FUNCTION) { 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; @@ -684,22 +993,130 @@ bool ast_global_codegen(ast_value *self, ir_builder *ir) 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; + if (isfield && self->expression.vtype == TYPE_FIELD) { + ast_expression *fieldtype = self->expression.next; + if (self->isconst) { - printf("TODO: constant field pointers with value\n"); + asterror(ast_ctx(self), "TODO: constant field pointers with value"); goto error; } - self->ir_v = v; + + if (fieldtype->expression.vtype == TYPE_ARRAY) { + size_t ai; + char *name; + size_t namelen; + + ast_expression_common *elemtype; + int vtype; + ast_value *array = (ast_value*)fieldtype; + + if (!ast_istype(fieldtype, ast_value)) { + asterror(ast_ctx(self), "internal error: ast_value required"); + return false; + } + + /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */ + if (!array->expression.count || array->expression.count > opts_max_array_size) + asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count); + + elemtype = &array->expression.next->expression; + vtype = elemtype->vtype; + + v = ir_builder_create_field(ir, self->name, vtype); + if (!v) { + asterror(ast_ctx(self), "ir_builder_create_global failed"); + return false; + } + if (vtype == TYPE_FIELD) + v->fieldtype = elemtype->next->expression.vtype; + v->context = ast_ctx(self); + array->ir_v = self->ir_v = v; + + namelen = strlen(self->name); + name = (char*)mem_a(namelen + 16); + strcpy(name, self->name); + + array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count); + array->ir_values[0] = v; + for (ai = 1; ai < array->expression.count; ++ai) { + snprintf(name + namelen, 16, "[%u]", (unsigned int)ai); + array->ir_values[ai] = ir_builder_create_field(ir, name, vtype); + if (!array->ir_values[ai]) { + mem_d(name); + asterror(ast_ctx(self), "ir_builder_create_global failed"); + return false; + } + if (vtype == TYPE_FIELD) + array->ir_values[ai]->fieldtype = elemtype->next->expression.vtype; + array->ir_values[ai]->context = ast_ctx(self); + } + mem_d(name); + } + else + { + v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype); + if (!v) + return false; + v->context = ast_ctx(self); + self->ir_v = v; + } return true; } - v = ir_builder_create_global(ir, self->name, self->expression.vtype); - if (!v) { - printf("ir_builder_create_global failed\n"); - return false; + if (self->expression.vtype == TYPE_ARRAY) { + size_t ai; + char *name; + size_t namelen; + + ast_expression_common *elemtype = &self->expression.next->expression; + int vtype = elemtype->vtype; + + /* same as with field arrays */ + if (!self->expression.count || self->expression.count > opts_max_array_size) + asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count); + + v = ir_builder_create_global(ir, self->name, vtype); + if (!v) { + asterror(ast_ctx(self), "ir_builder_create_global failed"); + return false; + } + if (vtype == TYPE_FIELD) + v->fieldtype = elemtype->next->expression.vtype; + v->context = ast_ctx(self); + + namelen = strlen(self->name); + name = (char*)mem_a(namelen + 16); + strcpy(name, self->name); + + self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count); + self->ir_values[0] = v; + for (ai = 1; ai < self->expression.count; ++ai) { + snprintf(name + namelen, 16, "[%u]", (unsigned int)ai); + self->ir_values[ai] = ir_builder_create_global(ir, name, vtype); + if (!self->ir_values[ai]) { + mem_d(name); + asterror(ast_ctx(self), "ir_builder_create_global failed"); + return false; + } + if (vtype == TYPE_FIELD) + self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype; + self->ir_values[ai]->context = ast_ctx(self); + } + mem_d(name); + } + else + { + /* Arrays don't do this since there's no "array" value which spans across the + * whole thing. + */ + v = ir_builder_create_global(ir, self->name, self->expression.vtype); + if (!v) { + asterror(ast_ctx(self), "ir_builder_create_global failed"); + return false; + } + if (self->expression.vtype == TYPE_FIELD) + v->fieldtype = self->expression.next->expression.vtype; + v->context = ast_ctx(self); } if (self->isconst) { @@ -717,14 +1134,17 @@ bool ast_global_codegen(ast_value *self, ir_builder *ir) if (!ir_value_set_string(v, self->constval.vstring)) goto error; break; + case TYPE_ARRAY: + asterror(ast_ctx(self), "TODO: global constant array"); + 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; } } @@ -749,9 +1169,65 @@ bool ast_local_codegen(ast_value *self, ir_function *func, bool param) return false; } - v = ir_function_create_local(func, self->name, self->expression.vtype, param); - if (!v) - return false; + if (self->expression.vtype == TYPE_ARRAY) { + size_t ai; + char *name; + size_t namelen; + + ast_expression_common *elemtype = &self->expression.next->expression; + int vtype = elemtype->vtype; + + if (param) { + asterror(ast_ctx(self), "array-parameters are not supported"); + return false; + } + + /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */ + if (!self->expression.count || self->expression.count > opts_max_array_size) { + asterror(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count); + } + + self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count); + if (!self->ir_values) { + asterror(ast_ctx(self), "failed to allocate array values"); + return false; + } + + v = ir_function_create_local(func, self->name, vtype, param); + if (!v) { + asterror(ast_ctx(self), "ir_function_create_local failed"); + return false; + } + if (vtype == TYPE_FIELD) + v->fieldtype = elemtype->next->expression.vtype; + v->context = ast_ctx(self); + + namelen = strlen(self->name); + name = (char*)mem_a(namelen + 16); + strcpy(name, self->name); + + self->ir_values[0] = v; + for (ai = 1; ai < self->expression.count; ++ai) { + snprintf(name + namelen, 16, "[%u]", (unsigned int)ai); + self->ir_values[ai] = ir_function_create_local(func, name, vtype, param); + if (!self->ir_values[ai]) { + asterror(ast_ctx(self), "ir_builder_create_global failed"); + return false; + } + if (vtype == TYPE_FIELD) + self->ir_values[ai]->fieldtype = elemtype->next->expression.vtype; + self->ir_values[ai]->context = ast_ctx(self); + } + } + else + { + v = ir_function_create_local(func, self->name, self->expression.vtype, param); + if (!v) + return false; + if (self->expression.vtype == TYPE_FIELD) + v->fieldtype = self->expression.next->expression.vtype; + v->context = ast_ctx(self); + } /* A constant local... hmmm... * I suppose the IR will have to deal with this @@ -772,13 +1248,26 @@ bool ast_local_codegen(ast_value *self, ir_function *func, bool param) 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; } } /* link us to the ir_value */ self->ir_v = v; + + if (self->setter) { + if (!ast_global_codegen(self->setter, func->owner, false) || + !ast_function_codegen(self->setter->constval.vfunc, func->owner) || + !ir_function_finalize(self->setter->constval.vfunc->ir_func)) + return false; + } + if (self->getter) { + if (!ast_global_codegen(self->getter, func->owner, false) || + !ast_function_codegen(self->getter->constval.vfunc, func->owner) || + !ir_function_finalize(self->getter->constval.vfunc->ir_func)) + return false; + } return true; error: /* clean up */ @@ -795,16 +1284,15 @@ bool ast_function_codegen(ast_function *self, ir_builder *ir) 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 */ ec = &self->vtype->expression; - for (i = 0; i < ec->params_count; ++i) + for (i = 0; i < vec_size(ec->params); ++i) { - if (!ir_function_params_add(irf, ec->params[i]->expression.vtype)) - return false; + vec_push(irf->params, ec->params[i]->expression.vtype); if (!self->builtin) { if (!ast_local_codegen(ec->params[i], self->ir_func, true)) return false; @@ -816,11 +1304,18 @@ bool ast_function_codegen(ast_function *self, ir_builder *ir) return true; } + if (!vec_size(self->blocks)) { + 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) { + for (i = 0; i < vec_size(self->blocks); ++i) { ast_expression_codegen *gen = self->blocks[i]->expression.codegen; if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy)) return false; @@ -829,6 +1324,9 @@ bool ast_function_codegen(ast_function *self, ir_builder *ir) /* 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) { @@ -837,8 +1335,10 @@ bool ast_function_codegen(ast_function *self, ir_builder *ir) else { /* error("missing return"); */ + asterror(ast_ctx(self), "function `%s` missing return value", self->name); return false; } +#endif } return true; } @@ -857,7 +1357,11 @@ bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_valu * 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; @@ -872,15 +1376,22 @@ bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_valu *out = NULL; /* generate locals */ - for (i = 0; i < self->locals_count; ++i) + for (i = 0; i < vec_size(self->locals); ++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) + for (i = 0; i < vec_size(self->exprs); ++i) { ast_expression_codegen *gen = self->exprs[i]->expression.codegen; + if (func->curblock->final) { + asterror(ast_ctx(self->exprs[i]), "unreachable statement"); + return false; + } if (!(*gen)(self->exprs[i], func, false, out)) return false; } @@ -895,6 +1406,10 @@ bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_valu ast_expression_codegen *cgen; ir_value *left, *right; + ast_value *arr; + ast_value *idx; + ast_array_index *ai = NULL; + if (lvalue && self->expression.outl) { *out = self->expression.outl; return true; @@ -905,20 +1420,70 @@ bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_valu return true; } - cgen = self->dest->expression.codegen; - /* lvalue! */ - if (!(*cgen)((ast_expression*)(self->dest), func, true, &left)) - return false; - self->expression.outl = left; + if (ast_istype(self->dest, ast_array_index)) + { - cgen = self->source->expression.codegen; - /* rvalue! */ - if (!(*cgen)((ast_expression*)(self->source), func, false, &right)) - return false; + ai = (ast_array_index*)self->dest; + idx = (ast_value*)ai->index; - if (!ir_block_create_store_op(func->curblock, self->op, left, right)) - return false; - self->expression.outr = right; + if (ast_istype(ai->index, ast_value) && idx->isconst) + ai = NULL; + } + + if (ai) { + /* we need to call the setter */ + ir_value *iridx, *funval; + ir_instr *call; + + if (lvalue) { + asterror(ast_ctx(self), "array-subscript assignment cannot produce lvalues"); + return false; + } + + arr = (ast_value*)ai->array; + if (!ast_istype(ai->array, ast_value) || !arr->setter) { + asterror(ast_ctx(self), "value has no setter (%s)", arr->name); + return false; + } + + cgen = idx->expression.codegen; + if (!(*cgen)((ast_expression*)(idx), func, false, &iridx)) + return false; + + cgen = arr->setter->expression.codegen; + if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval)) + return false; + + cgen = self->source->expression.codegen; + if (!(*cgen)((ast_expression*)(self->source), func, false, &right)) + return false; + + call = ir_block_create_call(func->curblock, ast_function_label(func, "store"), funval); + if (!call) + return false; + ir_call_param(call, iridx); + ir_call_param(call, right); + self->expression.outr = right; + } + else + { + /* regular code */ + + 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 (!(*cgen)((ast_expression*)(self->source), func, false, &right)) + return false; + + 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 @@ -937,22 +1502,71 @@ bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_va 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; } + if (OPTS_FLAG(SHORT_LOGIC) && + (self->op == INSTR_AND || self->op == INSTR_OR)) + { + /* short circuit evaluation */ + ir_block *other, *merge; + ir_block *from_left, *from_right; + ir_instr *phi; + size_t merge_id; + + merge_id = vec_size(func->blocks); + merge = ir_function_create_block(func->ir_func, ast_function_label(func, "sce_merge")); + + cgen = self->left->expression.codegen; + if (!(*cgen)((ast_expression*)(self->left), func, false, &left)) + return false; + + from_left = func->curblock; + other = ir_function_create_block(func->ir_func, ast_function_label(func, "sce_other")); + if (self->op == INSTR_AND) { + if (!ir_block_create_if(func->curblock, left, other, merge)) + return false; + } else { + if (!ir_block_create_if(func->curblock, left, merge, other)) + return false; + } + /* use the unlikely flag */ + vec_last(func->curblock->instr)->likely = false; + + func->curblock = other; + cgen = self->right->expression.codegen; + if (!(*cgen)((ast_expression*)(self->right), func, false, &right)) + return false; + from_right = func->curblock; + + if (!ir_block_create_jump(func->curblock, merge)) + return false; + + vec_remove(func->ir_func->blocks, merge_id, 1); + vec_push(func->ir_func->blocks, merge); + + func->curblock = merge; + phi = ir_block_create_phi(func->curblock, ast_function_label(func, "sce_value"), TYPE_FLOAT); + ir_phi_add(phi, from_left, left); + ir_phi_add(phi, from_right, right); + *out = ir_phi_value(phi); + self->expression.outr = *out; + return true; + } + 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; @@ -983,7 +1597,7 @@ bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, i /* 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, true, &leftr)) + if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr)) return false; /* source as rvalue only */ @@ -1024,10 +1638,12 @@ bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_valu 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; @@ -1052,23 +1668,32 @@ bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_va ast_expression_codegen *cgen; ir_value *operand; - /* In the context of a return operation, we can disregard - * the lvalue flag. + /* In the context of a return operation, we don't actually return + * anything... */ - (void)lvalue; + if (lvalue) { + asterror(ast_ctx(self), "return-expression is not an l-value"); + return false; + } + if (self->expression.outr) { - printf("internal error: ast_return cannot be reused, it bears no result!\n"); + asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!"); return false; } self->expression.outr = (ir_value*)1; - cgen = self->operand->expression.codegen; - /* lvalue! */ - if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand)) - return false; + 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; + if (!ir_block_create_return(func->curblock, operand)) + return false; + } else { + if (!ir_block_create_return(func->curblock, NULL)) + return false; + } return true; } @@ -1109,8 +1734,12 @@ bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, i *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; @@ -1149,6 +1778,76 @@ bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_va return (*out != NULL); } +bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out) +{ + ast_value *arr; + ast_value *idx; + + if (!lvalue && self->expression.outr) { + *out = self->expression.outr; + } + if (lvalue && self->expression.outl) { + *out = self->expression.outl; + } + + if (!ast_istype(self->array, ast_value)) { + asterror(ast_ctx(self), "array indexing this way is not supported"); + /* note this would actually be pointer indexing because the left side is + * not an actual array but (hopefully) an indexable expression. + * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction + * support this path will be filled. + */ + return false; + } + + arr = (ast_value*)self->array; + idx = (ast_value*)self->index; + + if (!ast_istype(self->index, ast_value) || !idx->isconst) { + /* Time to use accessor functions */ + ast_expression_codegen *cgen; + ir_value *iridx, *funval; + ir_instr *call; + + if (lvalue) { + asterror(ast_ctx(self), "(.2) array indexing here needs a compile-time constant"); + return false; + } + + if (!arr->getter) { + asterror(ast_ctx(self), "value has no getter, don't know how to index it"); + return false; + } + + cgen = self->index->expression.codegen; + if (!(*cgen)((ast_expression*)(self->index), func, true, &iridx)) + return false; + + cgen = arr->getter->expression.codegen; + if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval)) + return false; + + call = ir_block_create_call(func->curblock, ast_function_label(func, "fetch"), funval); + if (!call) + return false; + ir_call_param(call, iridx); + + *out = ir_call_value(call); + self->expression.outr = *out; + return true; + } + + if (idx->expression.vtype == TYPE_FLOAT) + *out = arr->ir_values[(int)idx->constval.vfloat]; + else if (idx->expression.vtype == TYPE_INTEGER) + *out = arr->ir_values[idx->constval.vint]; + else { + asterror(ast_ctx(self), "array indexing here needs an integer constant"); + return false; + } + return true; +} + bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out) { ast_expression_codegen *cgen; @@ -1159,6 +1858,8 @@ bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_va 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 */ @@ -1166,7 +1867,7 @@ bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_va (void)lvalue; if (self->expression.outr) { - printf("internal error: ast_ifthen cannot be reused, it bears no result!\n"); + asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!"); return false; } self->expression.outr = (ir_value*)1; @@ -1192,6 +1893,9 @@ bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_va 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; @@ -1209,6 +1913,9 @@ bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_va 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; @@ -1218,9 +1925,9 @@ bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_va 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 :) @@ -1330,12 +2037,10 @@ bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_ /* 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)) - { + if (!phi) return false; - } + ir_phi_add(phi, ontrue, trueval); + ir_phi_add(phi, onfalse, falseval); self->phi_out = ir_phi_value(phi); *out = self->phi_out; @@ -1377,7 +2082,7 @@ bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value (void)out; if (self->expression.outr) { - printf("internal error: ast_loop cannot be reused, it bears no result!\n"); + asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!"); return false; } self->expression.outr = (ir_value*)1; @@ -1447,7 +2152,7 @@ bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value bpostcond = end_bpostcond = NULL; } - bout_id = func->ir_func->blocks_count; + bout_id = vec_size(func->ir_func->blocks); bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop")); if (!bout) return false; @@ -1538,7 +2243,7 @@ bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value 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; } @@ -1567,27 +2272,205 @@ bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value } /* 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); + vec_remove(func->ir_func->blocks, bout_id, 1); + vec_push(func->ir_func->blocks, bout); + + return true; +} + +bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out) +{ + ir_block *target; + + if (lvalue) { + asterror(ast_ctx(self), "break/continue expression is not an l-value"); + return false; + } + + if (self->expression.outr) { + asterror(ast_ctx(self), "internal error: ast_breakcont cannot be reused!"); + return false; + } + self->expression.outr = (ir_value*)1; + + if (self->is_continue) + target = func->continueblock; + else + target = func->breakblock; + + if (!ir_block_create_jump(func->curblock, target)) + return false; + return true; +} + +bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out) +{ + ast_expression_codegen *cgen; + + ast_switch_case *def_case = NULL; + ir_block *def_bfall = NULL; + + ir_value *dummy = NULL; + ir_value *irop = NULL; + ir_block *old_break = NULL; + ir_block *bout = NULL; + ir_block *bfall = NULL; + size_t bout_id; + size_t c; + + char typestr[1024]; + uint16_t cmpinstr; + + if (lvalue) { + asterror(ast_ctx(self), "switch expression is not an l-value"); + return false; + } + + if (self->expression.outr) { + asterror(ast_ctx(self), "internal error: ast_switch cannot be reused!"); + return false; + } + self->expression.outr = (ir_value*)1; + + (void)lvalue; + (void)out; + + cgen = self->operand->expression.codegen; + if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop)) + return false; + + if (!vec_size(self->cases)) + return true; + + cmpinstr = type_eq_instr[irop->vtype]; + if (cmpinstr >= AINSTR_END) { + ast_type_to_string(self->operand, typestr, sizeof(typestr)); + asterror(ast_ctx(self), "invalid type to perform a switch on: %s", typestr); return false; } + bout_id = vec_size(func->ir_func->blocks); + bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_switch")); + if (!bout) + return false; + + /* setup the break block */ + old_break = func->breakblock; + func->breakblock = bout; + + /* Now create all cases */ + for (c = 0; c < vec_size(self->cases); ++c) { + ir_value *cond, *val; + ir_block *bcase, *bnot; + size_t bnot_id; + + ast_switch_case *swcase = &self->cases[c]; + + if (swcase->value) { + /* A regular case */ + /* generate the condition operand */ + cgen = swcase->value->expression.codegen; + if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val)) + return false; + /* generate the condition */ + cond = ir_block_create_binop(func->curblock, ast_function_label(func, "switch_eq"), cmpinstr, irop, val); + if (!cond) + return false; + + bcase = ir_function_create_block(func->ir_func, ast_function_label(func, "case")); + bnot_id = vec_size(func->ir_func->blocks); + bnot = ir_function_create_block(func->ir_func, ast_function_label(func, "not_case")); + if (!bcase || !bnot) + return false; + if (!ir_block_create_if(func->curblock, cond, bcase, bnot)) + return false; + + /* Make the previous case-end fall through */ + if (bfall && !bfall->final) { + if (!ir_block_create_jump(bfall, bcase)) + return false; + } + + /* enter the case */ + func->curblock = bcase; + cgen = swcase->code->expression.codegen; + if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy)) + return false; + + /* remember this block to fall through from */ + bfall = func->curblock; + + /* enter the else and move it down */ + func->curblock = bnot; + vec_remove(func->ir_func->blocks, bnot_id, 1); + vec_push(func->ir_func->blocks, bnot); + } else { + /* The default case */ + /* Remember where to fall through from: */ + def_bfall = bfall; + bfall = NULL; + /* remember which case it was */ + def_case = swcase; + } + } + + /* Jump from the last bnot to bout */ + if (bfall && !bfall->final && !ir_block_create_jump(bfall, bout)) { + /* + astwarning(ast_ctx(bfall), WARN_???, "missing break after last case"); + */ + return false; + } + + /* If there was a default case, put it down here */ + if (def_case) { + ir_block *bcase; + + /* No need to create an extra block */ + bcase = func->curblock; + + /* Insert the fallthrough jump */ + if (def_bfall && !def_bfall->final) { + if (!ir_block_create_jump(def_bfall, bcase)) + return false; + } + + /* Now generate the default code */ + cgen = def_case->code->expression.codegen; + if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy)) + return false; + } + + /* Jump from the last bnot to bout */ + if (!func->curblock->final && !ir_block_create_jump(func->curblock, bout)) + return false; + /* enter the outgoing block */ + func->curblock = bout; + + /* restore the break block */ + func->breakblock = old_break; + + /* Move 'bout' to the end, it's nicer */ + vec_remove(func->ir_func->blocks, bout_id, 1); + vec_push(func->ir_func->blocks, bout); + 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_value **params; ir_instr *callinstr; size_t i; ir_value *funval = NULL; /* return values are never lvalues */ - (void)lvalue; + if (lvalue) { + asterror(ast_ctx(self), "not an l-value (function call)"); + return false; + } if (self->expression.outr) { *out = self->expression.outr; @@ -1600,10 +2483,10 @@ bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value if (!funval) return false; - MEM_VECTOR_INIT(¶ms, v); + params = NULL; /* parameters */ - for (i = 0; i < self->params_count; ++i) + for (i = 0; i < vec_size(self->params); ++i) { ir_value *param; ast_expression *expr = self->params[i]; @@ -1613,25 +2496,23 @@ bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value goto error; if (!param) goto error; - if (!ir_value_vector_v_add(¶ms, param)) - goto error; + vec_push(params, param); } 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; + for (i = 0; i < vec_size(params); ++i) { + ir_call_param(callinstr, params[i]); } *out = ir_call_value(callinstr); self->expression.outr = *out; - MEM_VECTOR_CLEAR(¶ms, v); + vec_free(params); return true; error: - MEM_VECTOR_CLEAR(¶ms, v); + vec_free(params); return false; }