ast.c

   1 /*
   2  * Copyright (C) 2012, 2013
   3  *     Wolfgang Bumiller
   4  *     Dale Weiler
   5  *
   6  * Permission is hereby granted, free of charge, to any person obtaining a copy of
   7  * this software and associated documentation files (the "Software"), to deal in
   8  * the Software without restriction, including without limitation the rights to
   9  * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
  10  * of the Software, and to permit persons to whom the Software is furnished to do
  11  * so, subject to the following conditions:
  12  *
  13  * The above copyright notice and this permission notice shall be included in all
  14  * copies or substantial portions of the Software.
  15  *
  16  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  17  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  18  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  19  * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  20  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  21  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  22  * SOFTWARE.
  23  */
  24 #include <stdlib.h>
  25 #include <string.h>
  26
  27 #include "gmqcc.h"
  28 #include "ast.h"
  29
  30 #define ast_instantiate(T, ctx, destroyfn)                          \
  31     T* self = (T*)mem_a(sizeof(T));                                 \
  32     if (!self) {                                                    \
  33         return NULL;                                                \
  34     }                                                               \
  35     ast_node_init((ast_node*)self, ctx, TYPE_##T);                  \
  36     ( (ast_node*)self )->destroy = (ast_node_delete*)destroyfn
  37
  38 /*
  39  * forward declarations, these need not be in ast.h for obvious
  40  * static reasons.
  41  */
  42 static bool ast_member_codegen(ast_member*, ast_function*, bool lvalue, ir_value**);
  43 static void ast_array_index_delete(ast_array_index*);
  44 static bool ast_array_index_codegen(ast_array_index*, ast_function*, bool lvalue, ir_value**);
  45 static void ast_store_delete(ast_store*);
  46 static bool ast_store_codegen(ast_store*, ast_function*, bool lvalue, ir_value**);
  47 static void ast_ifthen_delete(ast_ifthen*);
  48 static bool ast_ifthen_codegen(ast_ifthen*, ast_function*, bool lvalue, ir_value**);
  49 static void ast_ternary_delete(ast_ternary*);
  50 static bool ast_ternary_codegen(ast_ternary*, ast_function*, bool lvalue, ir_value**);
  51 static void ast_loop_delete(ast_loop*);
  52 static bool ast_loop_codegen(ast_loop*, ast_function*, bool lvalue, ir_value**);
  53 static void ast_breakcont_delete(ast_breakcont*);
  54 static bool ast_breakcont_codegen(ast_breakcont*, ast_function*, bool lvalue, ir_value**);
  55 static void ast_switch_delete(ast_switch*);
  56 static bool ast_switch_codegen(ast_switch*, ast_function*, bool lvalue, ir_value**);
  57 static void ast_label_delete(ast_label*);
  58 static void ast_label_register_goto(ast_label*, ast_goto*);
  59 static bool ast_label_codegen(ast_label*, ast_function*, bool lvalue, ir_value**);
  60 static bool ast_goto_codegen(ast_goto*, ast_function*, bool lvalue, ir_value**);
  61 static void ast_goto_delete(ast_goto*);
  62 static void ast_call_delete(ast_call*);
  63 static bool ast_call_codegen(ast_call*, ast_function*, bool lvalue, ir_value**);
  64 static bool ast_block_codegen(ast_block*, ast_function*, bool lvalue, ir_value**);
  65 static void ast_unary_delete(ast_unary*);
  66 static bool ast_unary_codegen(ast_unary*, ast_function*, bool lvalue, ir_value**);
  67 static void ast_entfield_delete(ast_entfield*);
  68 static bool ast_entfield_codegen(ast_entfield*, ast_function*, bool lvalue, ir_value**);
  69 static void ast_return_delete(ast_return*);
  70 static bool ast_return_codegen(ast_return*, ast_function*, bool lvalue, ir_value**);
  71 static void ast_binstore_delete(ast_binstore*);
  72 static bool ast_binstore_codegen(ast_binstore*, ast_function*, bool lvalue, ir_value**);
  73 static void ast_binary_delete(ast_binary*);
  74 static bool ast_binary_codegen(ast_binary*, ast_function*, bool lvalue, ir_value**);
  75
  76 /* It must not be possible to get here. */
  77 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
  78 {
  79     (void)self;
  80     con_err("ast node missing destroy()\n");
  81     exit(EXIT_FAILURE);
  82 }
  83
  84 /* Initialize main ast node aprts */
  85 static void ast_node_init(ast_node *self, lex_ctx ctx, int nodetype)
  86 {
  87     self->context = ctx;
  88     self->destroy = &_ast_node_destroy;
  89     self->keep    = false;
  90     self->nodetype = nodetype;
  91     self->side_effects = false;
  92 }
  93
  94 /* weight and side effects */
  95 static void _ast_propagate_effects(ast_node *self, ast_node *other)
  96 {
  97     if (ast_side_effects(other))
  98         ast_side_effects(self) = true;
  99 }
 100 #define ast_propagate_effects(s,o) _ast_propagate_effects(((ast_node*)(s)), ((ast_node*)(o)))
 101
 102 /* General expression initialization */
 103 static void ast_expression_init(ast_expression *self,
 104                                 ast_expression_codegen *codegen)
 105 {
 106     self->codegen  = codegen;
 107     self->vtype    = TYPE_VOID;
 108     self->next     = NULL;
 109     self->outl     = NULL;
 110     self->outr     = NULL;
 111     self->params   = NULL;
 112     self->count    = 0;
 113     self->flags    = 0;
 114     self->varparam = NULL;
 115 }
 116
 117 static void ast_expression_delete(ast_expression *self)
 118 {
 119     size_t i;
 120     if (self->next)
 121         ast_delete(self->next);
 122     for (i = 0; i < vec_size(self->params); ++i) {
 123         ast_delete(self->params[i]);
 124     }
 125     vec_free(self->params);
 126     if (self->varparam)
 127         ast_delete(self->varparam);
 128 }
 129
 130 static void ast_expression_delete_full(ast_expression *self)
 131 {
 132     ast_expression_delete(self);
 133     mem_d(self);
 134 }
 135
 136 ast_value* ast_value_copy(const ast_value *self)
 137 {
 138     size_t i;
 139     const ast_expression *fromex;
 140     ast_expression       *selfex;
 141     ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
 142     if (self->expression.next) {
 143         cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
 144     }
 145     fromex   = &self->expression;
 146     selfex = &cp->expression;
 147     selfex->count    = fromex->count;
 148     selfex->flags    = fromex->flags;
 149     for (i = 0; i < vec_size(fromex->params); ++i) {
 150         ast_value *v = ast_value_copy(fromex->params[i]);
 151         vec_push(selfex->params, v);
 152     }
 153     return cp;
 154 }
 155
 156 void ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
 157 {
 158     size_t i;
 159     const ast_expression *fromex;
 160     ast_expression       *selfex;
 161     self->vtype = other->vtype;
 162     if (other->next) {
 163         self->next = (ast_expression*)ast_type_copy(ast_ctx(self), other->next);
 164     }
 165     fromex = other;
 166     selfex = self;
 167     selfex->count    = fromex->count;
 168     selfex->flags    = fromex->flags;
 169     for (i = 0; i < vec_size(fromex->params); ++i) {
 170         ast_value *v = ast_value_copy(fromex->params[i]);
 171         vec_push(selfex->params, v);
 172     }
 173 }
 174
 175 static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
 176 {
 177     ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
 178     ast_expression_init(self, NULL);
 179     self->codegen = NULL;
 180     self->next    = NULL;
 181     self->vtype   = vtype;
 182     return self;
 183 }
 184
 185 ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
 186 {
 187     size_t i;
 188     const ast_expression *fromex;
 189     ast_expression       *selfex;
 190
 191     if (!ex)
 192         return NULL;
 193     else
 194     {
 195         ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
 196         ast_expression_init(self, NULL);
 197
 198         fromex = ex;
 199         selfex = self;
 200
 201         /* This may never be codegen()d */
 202         selfex->codegen = NULL;
 203
 204         selfex->vtype = fromex->vtype;
 205         if (fromex->next)
 206             selfex->next = ast_type_copy(ctx, fromex->next);
 207         else
 208             selfex->next = NULL;
 209
 210         selfex->count    = fromex->count;
 211         selfex->flags    = fromex->flags;
 212         for (i = 0; i < vec_size(fromex->params); ++i) {
 213             ast_value *v = ast_value_copy(fromex->params[i]);
 214             vec_push(selfex->params, v);
 215         }
 216
 217         return self;
 218     }
 219 }
 220
 221 bool ast_compare_type(ast_expression *a, ast_expression *b)
 222 {
 223     if (a->vtype == TYPE_NIL ||
 224         b->vtype == TYPE_NIL)
 225         return true;
 226     if (a->vtype != b->vtype)
 227         return false;
 228     if (!a->next != !b->next)
 229         return false;
 230     if (vec_size(a->params) != vec_size(b->params))
 231         return false;
 232     if ((a->flags & AST_FLAG_TYPE_MASK) !=
 233         (b->flags & AST_FLAG_TYPE_MASK) )
 234     {
 235         return false;
 236     }
 237     if (vec_size(a->params)) {
 238         size_t i;
 239         for (i = 0; i < vec_size(a->params); ++i) {
 240             if (!ast_compare_type((ast_expression*)a->params[i],
 241                                   (ast_expression*)b->params[i]))
 242                 return false;
 243         }
 244     }
 245     if (a->next)
 246         return ast_compare_type(a->next, b->next);
 247     return true;
 248 }
 249
 250 static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
 251 {
 252     const char *typestr;
 253     size_t typelen;
 254     size_t i;
 255
 256     if (!e) {
 257         if (pos + 6 >= bufsize)
 258             goto full;
 259         util_strncpy(buf + pos, "(null)", 6);
 260         return pos + 6;
 261     }
 262
 263     if (pos + 1 >= bufsize)
 264         goto full;
 265
 266     switch (e->vtype) {
 267         case TYPE_VARIANT:
 268             util_strncpy(buf + pos, "(variant)", 9);
 269             return pos + 9;
 270
 271         case TYPE_FIELD:
 272             buf[pos++] = '.';
 273             return ast_type_to_string_impl(e->next, buf, bufsize, pos);
 274
 275         case TYPE_POINTER:
 276             if (pos + 3 >= bufsize)
 277                 goto full;
 278             buf[pos++] = '*';
 279             buf[pos++] = '(';
 280             pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
 281             if (pos + 1 >= bufsize)
 282                 goto full;
 283             buf[pos++] = ')';
 284             return pos;
 285
 286         case TYPE_FUNCTION:
 287             pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
 288             if (pos + 2 >= bufsize)
 289                 goto full;
 290             if (!vec_size(e->params)) {
 291                 buf[pos++] = '(';
 292                 buf[pos++] = ')';
 293                 return pos;
 294             }
 295             buf[pos++] = '(';
 296             pos = ast_type_to_string_impl((ast_expression*)(e->params[0]), buf, bufsize, pos);
 297             for (i = 1; i < vec_size(e->params); ++i) {
 298                 if (pos + 2 >= bufsize)
 299                     goto full;
 300                 buf[pos++] = ',';
 301                 buf[pos++] = ' ';
 302                 pos = ast_type_to_string_impl((ast_expression*)(e->params[i]), buf, bufsize, pos);
 303             }
 304             if (pos + 1 >= bufsize)
 305                 goto full;
 306             buf[pos++] = ')';
 307             return pos;
 308
 309         case TYPE_ARRAY:
 310             pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
 311             if (pos + 1 >= bufsize)
 312                 goto full;
 313             buf[pos++] = '[';
 314             pos += util_snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->count);
 315             if (pos + 1 >= bufsize)
 316                 goto full;
 317             buf[pos++] = ']';
 318             return pos;
 319
 320         default:
 321             typestr = type_name[e->vtype];
 322             typelen = strlen(typestr);
 323             if (pos + typelen >= bufsize)
 324                 goto full;
 325             util_strncpy(buf + pos, typestr, typelen);
 326             return pos + typelen;
 327     }
 328
 329 full:
 330     buf[bufsize-3] = '.';
 331     buf[bufsize-2] = '.';
 332     buf[bufsize-1] = '.';
 333     return bufsize;
 334 }
 335
 336 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
 337 {
 338     size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
 339     buf[pos] = 0;
 340 }
 341
 342 static bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out);
 343 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
 344 {
 345     ast_instantiate(ast_value, ctx, ast_value_delete);
 346     ast_expression_init((ast_expression*)self,
 347                         (ast_expression_codegen*)&ast_value_codegen);
 348     self->expression.node.keep = true; /* keep */
 349
 350     self->name = name ? util_strdup(name) : NULL;
 351     self->expression.vtype = t;
 352     self->expression.next  = NULL;
 353     self->isfield  = false;
 354     self->cvq      = CV_NONE;
 355     self->hasvalue = false;
 356     self->isimm    = false;
 357     self->uses     = 0;
 358     memset(&self->constval, 0, sizeof(self->constval));
 359     self->initlist = NULL;
 360
 361     self->ir_v           = NULL;
 362     self->ir_values      = NULL;
 363     self->ir_value_count = 0;
 364
 365     self->setter = NULL;
 366     self->getter = NULL;
 367     self->desc   = NULL;
 368
 369     self->argcounter  = NULL;
 370
 371     return self;
 372 }
 373
 374 void ast_value_delete(ast_value* self)
 375 {
 376     if (self->name)
 377         mem_d((void*)self->name);
 378     if (self->argcounter)
 379         mem_d((void*)self->argcounter);
 380     if (self->hasvalue) {
 381         switch (self->expression.vtype)
 382         {
 383         case TYPE_STRING:
 384             mem_d((void*)self->constval.vstring);
 385             break;
 386         case TYPE_FUNCTION:
 387             /* unlink us from the function node */
 388             self->constval.vfunc->vtype = NULL;
 389             break;
 390         /* NOTE: delete function? currently collected in
 391          * the parser structure
 392          */
 393         default:
 394             break;
 395         }
 396     }
 397     if (self->ir_values)
 398         mem_d(self->ir_values);
 399
 400     if (self->desc)
 401         mem_d(self->desc);
 402
 403     if (self->initlist) {
 404         if (self->expression.next->vtype == TYPE_STRING) {
 405             /* strings are allocated, free them */
 406             size_t i, len = vec_size(self->initlist);
 407             /* in theory, len should be expression.count
 408              * but let's not take any chances */
 409             for (i = 0; i < len; ++i) {
 410                 if (self->initlist[i].vstring)
 411                     mem_d(self->initlist[i].vstring);
 412             }
 413         }
 414         vec_free(self->initlist);
 415     }
 416
 417     ast_expression_delete((ast_expression*)self);
 418     mem_d(self);
 419 }
 420
 421 void ast_value_params_add(ast_value *self, ast_value *p)
 422 {
 423     vec_push(self->expression.params, p);
 424 }
 425
 426 bool ast_value_set_name(ast_value *self, const char *name)
 427 {
 428     if (self->name)
 429         mem_d((void*)self->name);
 430     self->name = util_strdup(name);
 431     return !!self->name;
 432 }
 433
 434 ast_binary* ast_binary_new(lex_ctx ctx, int op,
 435                            ast_expression* left, ast_expression* right)
 436 {
 437     ast_instantiate(ast_binary, ctx, ast_binary_delete);
 438     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
 439
 440     self->op = op;
 441     self->left = left;
 442     self->right = right;
 443
 444     ast_propagate_effects(self, left);
 445     ast_propagate_effects(self, right);
 446
 447     if (op >= INSTR_EQ_F && op <= INSTR_GT)
 448         self->expression.vtype = TYPE_FLOAT;
 449     else if (op == INSTR_AND || op == INSTR_OR) {
 450         if (OPTS_FLAG(PERL_LOGIC))
 451             ast_type_adopt(self, right);
 452         else
 453             self->expression.vtype = TYPE_FLOAT;
 454     }
 455     else if (op == INSTR_BITAND || op == INSTR_BITOR)
 456         self->expression.vtype = TYPE_FLOAT;
 457     else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
 458         self->expression.vtype = TYPE_VECTOR;
 459     else if (op == INSTR_MUL_V)
 460         self->expression.vtype = TYPE_FLOAT;
 461     else
 462         self->expression.vtype = left->vtype;
 463
 464     /* references all */
 465     self->refs = AST_REF_ALL;
 466
 467     return self;
 468 }
 469
 470 void ast_binary_delete(ast_binary *self)
 471 {
 472     if (self->refs & AST_REF_LEFT)  ast_unref(self->left);
 473     if (self->refs & AST_REF_RIGHT) ast_unref(self->right);
 474
 475     ast_expression_delete((ast_expression*)self);
 476     mem_d(self);
 477 }
 478
 479 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
 480                                ast_expression* left, ast_expression* right)
 481 {
 482     ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
 483     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
 484
 485     ast_side_effects(self) = true;
 486
 487     self->opstore = storop;
 488     self->opbin   = op;
 489     self->dest    = left;
 490     self->source  = right;
 491
 492     self->keep_dest = false;
 493
 494     ast_type_adopt(self, left);
 495     return self;
 496 }
 497
 498 void ast_binstore_delete(ast_binstore *self)
 499 {
 500     if (!self->keep_dest)
 501         ast_unref(self->dest);
 502     ast_unref(self->source);
 503     ast_expression_delete((ast_expression*)self);
 504     mem_d(self);
 505 }
 506
 507 ast_unary* ast_unary_new(lex_ctx ctx, int op,
 508                          ast_expression *expr)
 509 {
 510     ast_instantiate(ast_unary, ctx, ast_unary_delete);
 511     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
 512
 513     self->op = op;
 514     self->operand = expr;
 515
 516     ast_propagate_effects(self, expr);
 517
 518     if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
 519         self->expression.vtype = TYPE_FLOAT;
 520     } else
 521         compile_error(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
 522
 523     return self;
 524 }
 525
 526 void ast_unary_delete(ast_unary *self)
 527 {
 528     if (self->operand) ast_unref(self->operand);
 529     ast_expression_delete((ast_expression*)self);
 530     mem_d(self);
 531 }
 532
 533 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
 534 {
 535     ast_instantiate(ast_return, ctx, ast_return_delete);
 536     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
 537
 538     self->operand = expr;
 539
 540     if (expr)
 541         ast_propagate_effects(self, expr);
 542
 543     return self;
 544 }
 545
 546 void ast_return_delete(ast_return *self)
 547 {
 548     if (self->operand)
 549         ast_unref(self->operand);
 550     ast_expression_delete((ast_expression*)self);
 551     mem_d(self);
 552 }
 553
 554 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
 555 {
 556     if (field->vtype != TYPE_FIELD) {
 557         compile_error(ctx, "ast_entfield_new with expression not of type field");
 558         return NULL;
 559     }
 560     return ast_entfield_new_force(ctx, entity, field, field->next);
 561 }
 562
 563 ast_entfield* ast_entfield_new_force(lex_ctx ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
 564 {
 565     ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
 566
 567     if (!outtype) {
 568         mem_d(self);
 569         /* Error: field has no type... */
 570         return NULL;
 571     }
 572
 573     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
 574
 575     self->entity = entity;
 576     self->field  = field;
 577     ast_propagate_effects(self, entity);
 578     ast_propagate_effects(self, field);
 579
 580     ast_type_adopt(self, outtype);
 581     return self;
 582 }
 583
 584 void ast_entfield_delete(ast_entfield *self)
 585 {
 586     ast_unref(self->entity);
 587     ast_unref(self->field);
 588     ast_expression_delete((ast_expression*)self);
 589     mem_d(self);
 590 }
 591
 592 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field, const char *name)
 593 {
 594     ast_instantiate(ast_member, ctx, ast_member_delete);
 595     if (field >= 3) {
 596         mem_d(self);
 597         return NULL;
 598     }
 599
 600     if (owner->vtype != TYPE_VECTOR &&
 601         owner->vtype != TYPE_FIELD) {
 602         compile_error(ctx, "member-access on an invalid owner of type %s", type_name[owner->vtype]);
 603         mem_d(self);
 604         return NULL;
 605     }
 606
 607     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
 608     self->expression.node.keep = true; /* keep */
 609
 610     if (owner->vtype == TYPE_VECTOR) {
 611         self->expression.vtype = TYPE_FLOAT;
 612         self->expression.next  = NULL;
 613     } else {
 614         self->expression.vtype = TYPE_FIELD;
 615         self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
 616     }
 617
 618     self->rvalue = false;
 619     self->owner  = owner;
 620     ast_propagate_effects(self, owner);
 621
 622     self->field = field;
 623     if (name)
 624         self->name = util_strdup(name);
 625     else
 626         self->name = NULL;
 627
 628     return self;
 629 }
 630
 631 void ast_member_delete(ast_member *self)
 632 {
 633     /* The owner is always an ast_value, which has .keep=true,
 634      * also: ast_members are usually deleted after the owner, thus
 635      * this will cause invalid access
 636     ast_unref(self->owner);
 637      * once we allow (expression).x to access a vector-member, we need
 638      * to change this: preferably by creating an alternate ast node for this
 639      * purpose that is not garbage-collected.
 640     */
 641     ast_expression_delete((ast_expression*)self);
 642     mem_d(self->name);
 643     mem_d(self);
 644 }
 645
 646 bool ast_member_set_name(ast_member *self, const char *name)
 647 {
 648     if (self->name)
 649         mem_d((void*)self->name);
 650     self->name = util_strdup(name);
 651     return !!self->name;
 652 }
 653
 654 ast_array_index* ast_array_index_new(lex_ctx ctx, ast_expression *array, ast_expression *index)
 655 {
 656     ast_expression *outtype;
 657     ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
 658
 659     outtype = array->next;
 660     if (!outtype) {
 661         mem_d(self);
 662         /* Error: field has no type... */
 663         return NULL;
 664     }
 665
 666     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
 667
 668     self->array = array;
 669     self->index = index;
 670     ast_propagate_effects(self, array);
 671     ast_propagate_effects(self, index);
 672
 673     ast_type_adopt(self, outtype);
 674     if (array->vtype == TYPE_FIELD && outtype->vtype == TYPE_ARRAY) {
 675         if (self->expression.vtype != TYPE_ARRAY) {
 676             compile_error(ast_ctx(self), "array_index node on type");
 677             ast_array_index_delete(self);
 678             return NULL;
 679         }
 680         self->array = outtype;
 681         self->expression.vtype = TYPE_FIELD;
 682     }
 683
 684     return self;
 685 }
 686
 687 void ast_array_index_delete(ast_array_index *self)
 688 {
 689     if (self->array)
 690         ast_unref(self->array);
 691     if (self->index)
 692         ast_unref(self->index);
 693     ast_expression_delete((ast_expression*)self);
 694     mem_d(self);
 695 }
 696
 697 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
 698 {
 699     ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
 700     if (!ontrue && !onfalse) {
 701         /* because it is invalid */
 702         mem_d(self);
 703         return NULL;
 704     }
 705     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
 706
 707     self->cond     = cond;
 708     self->on_true  = ontrue;
 709     self->on_false = onfalse;
 710     ast_propagate_effects(self, cond);
 711     if (ontrue)
 712         ast_propagate_effects(self, ontrue);
 713     if (onfalse)
 714         ast_propagate_effects(self, onfalse);
 715
 716     return self;
 717 }
 718
 719 void ast_ifthen_delete(ast_ifthen *self)
 720 {
 721     ast_unref(self->cond);
 722     if (self->on_true)
 723         ast_unref(self->on_true);
 724     if (self->on_false)
 725         ast_unref(self->on_false);
 726     ast_expression_delete((ast_expression*)self);
 727     mem_d(self);
 728 }
 729
 730 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
 731 {
 732     ast_expression *exprtype = ontrue;
 733     ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
 734     /* This time NEITHER must be NULL */
 735     if (!ontrue || !onfalse) {
 736         mem_d(self);
 737         return NULL;
 738     }
 739     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
 740
 741     self->cond     = cond;
 742     self->on_true  = ontrue;
 743     self->on_false = onfalse;
 744     ast_propagate_effects(self, cond);
 745     ast_propagate_effects(self, ontrue);
 746     ast_propagate_effects(self, onfalse);
 747
 748     if (ontrue->vtype == TYPE_NIL)
 749         exprtype = onfalse;
 750     ast_type_adopt(self, exprtype);
 751
 752     return self;
 753 }
 754
 755 void ast_ternary_delete(ast_ternary *self)
 756 {
 757     /* the if()s are only there because computed-gotos can set them
 758      * to NULL
 759      */
 760     if (self->cond)     ast_unref(self->cond);
 761     if (self->on_true)  ast_unref(self->on_true);
 762     if (self->on_false) ast_unref(self->on_false);
 763     ast_expression_delete((ast_expression*)self);
 764     mem_d(self);
 765 }
 766
 767 ast_loop* ast_loop_new(lex_ctx ctx,
 768                        ast_expression *initexpr,
 769                        ast_expression *precond, bool pre_not,
 770                        ast_expression *postcond, bool post_not,
 771                        ast_expression *increment,
 772                        ast_expression *body)
 773 {
 774     ast_instantiate(ast_loop, ctx, ast_loop_delete);
 775     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
 776
 777     self->initexpr  = initexpr;
 778     self->precond   = precond;
 779     self->postcond  = postcond;
 780     self->increment = increment;
 781     self->body      = body;
 782
 783     self->pre_not   = pre_not;
 784     self->post_not  = post_not;
 785
 786     if (initexpr)
 787         ast_propagate_effects(self, initexpr);
 788     if (precond)
 789         ast_propagate_effects(self, precond);
 790     if (postcond)
 791         ast_propagate_effects(self, postcond);
 792     if (increment)
 793         ast_propagate_effects(self, increment);
 794     if (body)
 795         ast_propagate_effects(self, body);
 796
 797     return self;
 798 }
 799
 800 void ast_loop_delete(ast_loop *self)
 801 {
 802     if (self->initexpr)
 803         ast_unref(self->initexpr);
 804     if (self->precond)
 805         ast_unref(self->precond);
 806     if (self->postcond)
 807         ast_unref(self->postcond);
 808     if (self->increment)
 809         ast_unref(self->increment);
 810     if (self->body)
 811         ast_unref(self->body);
 812     ast_expression_delete((ast_expression*)self);
 813     mem_d(self);
 814 }
 815
 816 ast_breakcont* ast_breakcont_new(lex_ctx ctx, bool iscont, unsigned int levels)
 817 {
 818     ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
 819     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
 820
 821     self->is_continue = iscont;
 822     self->levels      = levels;
 823
 824     return self;
 825 }
 826
 827 void ast_breakcont_delete(ast_breakcont *self)
 828 {
 829     ast_expression_delete((ast_expression*)self);
 830     mem_d(self);
 831 }
 832
 833 ast_switch* ast_switch_new(lex_ctx ctx, ast_expression *op)
 834 {
 835     ast_instantiate(ast_switch, ctx, ast_switch_delete);
 836     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
 837
 838     self->operand = op;
 839     self->cases   = NULL;
 840
 841     ast_propagate_effects(self, op);
 842
 843     return self;
 844 }
 845
 846 void ast_switch_delete(ast_switch *self)
 847 {
 848     size_t i;
 849     ast_unref(self->operand);
 850
 851     for (i = 0; i < vec_size(self->cases); ++i) {
 852         if (self->cases[i].value)
 853             ast_unref(self->cases[i].value);
 854         ast_unref(self->cases[i].code);
 855     }
 856     vec_free(self->cases);
 857
 858     ast_expression_delete((ast_expression*)self);
 859     mem_d(self);
 860 }
 861
 862 ast_label* ast_label_new(lex_ctx ctx, const char *name, bool undefined)
 863 {
 864     ast_instantiate(ast_label, ctx, ast_label_delete);
 865     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
 866
 867     self->expression.vtype = TYPE_NOEXPR;
 868
 869     self->name      = util_strdup(name);
 870     self->irblock   = NULL;
 871     self->gotos     = NULL;
 872     self->undefined = undefined;
 873
 874     return self;
 875 }
 876
 877 void ast_label_delete(ast_label *self)
 878 {
 879     mem_d((void*)self->name);
 880     vec_free(self->gotos);
 881     ast_expression_delete((ast_expression*)self);
 882     mem_d(self);
 883 }
 884
 885 static void ast_label_register_goto(ast_label *self, ast_goto *g)
 886 {
 887     vec_push(self->gotos, g);
 888 }
 889
 890 ast_goto* ast_goto_new(lex_ctx ctx, const char *name)
 891 {
 892     ast_instantiate(ast_goto, ctx, ast_goto_delete);
 893     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
 894
 895     self->name    = util_strdup(name);
 896     self->target  = NULL;
 897     self->irblock_from = NULL;
 898
 899     return self;
 900 }
 901
 902 void ast_goto_delete(ast_goto *self)
 903 {
 904     mem_d((void*)self->name);
 905     ast_expression_delete((ast_expression*)self);
 906     mem_d(self);
 907 }
 908
 909 void ast_goto_set_label(ast_goto *self, ast_label *label)
 910 {
 911     self->target = label;
 912 }
 913
 914 ast_call* ast_call_new(lex_ctx ctx,
 915                        ast_expression *funcexpr)
 916 {
 917     ast_instantiate(ast_call, ctx, ast_call_delete);
 918     if (!funcexpr->next) {
 919         compile_error(ctx, "not a function");
 920         mem_d(self);
 921         return NULL;
 922     }
 923     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
 924
 925     ast_side_effects(self) = true;
 926
 927     self->params   = NULL;
 928     self->func     = funcexpr;
 929     self->va_count = NULL;
 930
 931     ast_type_adopt(self, funcexpr->next);
 932
 933     return self;
 934 }
 935
 936 void ast_call_delete(ast_call *self)
 937 {
 938     size_t i;
 939     for (i = 0; i < vec_size(self->params); ++i)
 940         ast_unref(self->params[i]);
 941     vec_free(self->params);
 942
 943     if (self->func)
 944         ast_unref(self->func);
 945
 946     if (self->va_count)
 947         ast_unref(self->va_count);
 948
 949     ast_expression_delete((ast_expression*)self);
 950     mem_d(self);
 951 }
 952
 953 bool ast_call_check_types(ast_call *self)
 954 {
 955     char texp[1024];
 956     char tgot[1024];
 957     size_t i;
 958     bool   retval = true;
 959     const  ast_expression *func = self->func;
 960     size_t count = vec_size(self->params);
 961     if (count > vec_size(func->params))
 962         count = vec_size(func->params);
 963
 964     for (i = 0; i < count; ++i) {
 965         if (!ast_compare_type(self->params[i], (ast_expression*)(func->params[i])))
 966         {
 967             ast_type_to_string(self->params[i], tgot, sizeof(tgot));
 968             ast_type_to_string((ast_expression*)func->params[i], texp, sizeof(texp));
 969             compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
 970                      (unsigned int)(i+1), texp, tgot);
 971             /* we don't immediately return */
 972             retval = false;
 973         }
 974     }
 975     count = vec_size(self->params);
 976     if (count > vec_size(func->params) && func->varparam) {
 977         for (; i < count; ++i) {
 978             if (!ast_compare_type(self->params[i], func->varparam))
 979             {
 980                 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
 981                 ast_type_to_string(func->varparam, texp, sizeof(texp));
 982                 compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
 983                          (unsigned int)(i+1), texp, tgot);
 984                 /* we don't immediately return */
 985                 retval = false;
 986             }
 987         }
 988     }
 989     return retval;
 990 }
 991
 992 ast_store* ast_store_new(lex_ctx ctx, int op,
 993                          ast_expression *dest, ast_expression *source)
 994 {
 995     ast_instantiate(ast_store, ctx, ast_store_delete);
 996     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
 997
 998     ast_side_effects(self) = true;
 999
1000     self->op = op;
1001     self->dest = dest;
1002     self->source = source;
1003
1004     ast_type_adopt(self, dest);
1005
1006     return self;
1007 }
1008
1009 void ast_store_delete(ast_store *self)
1010 {
1011     ast_unref(self->dest);
1012     ast_unref(self->source);
1013     ast_expression_delete((ast_expression*)self);
1014     mem_d(self);
1015 }
1016
1017 ast_block* ast_block_new(lex_ctx ctx)
1018 {
1019     ast_instantiate(ast_block, ctx, ast_block_delete);
1020     ast_expression_init((ast_expression*)self,
1021                         (ast_expression_codegen*)&ast_block_codegen);
1022
1023     self->locals  = NULL;
1024     self->exprs   = NULL;
1025     self->collect = NULL;
1026
1027     return self;
1028 }
1029
1030 bool ast_block_add_expr(ast_block *self, ast_expression *e)
1031 {
1032     ast_propagate_effects(self, e);
1033     vec_push(self->exprs, e);
1034     if (self->expression.next) {
1035         ast_delete(self->expression.next);
1036         self->expression.next = NULL;
1037     }
1038     ast_type_adopt(self, e);
1039     return true;
1040 }
1041
1042 void ast_block_collect(ast_block *self, ast_expression *expr)
1043 {
1044     vec_push(self->collect, expr);
1045     expr->node.keep = true;
1046 }
1047
1048 void ast_block_delete(ast_block *self)
1049 {
1050     size_t i;
1051     for (i = 0; i < vec_size(self->exprs); ++i)
1052         ast_unref(self->exprs[i]);
1053     vec_free(self->exprs);
1054     for (i = 0; i < vec_size(self->locals); ++i)
1055         ast_delete(self->locals[i]);
1056     vec_free(self->locals);
1057     for (i = 0; i < vec_size(self->collect); ++i)
1058         ast_delete(self->collect[i]);
1059     vec_free(self->collect);
1060     ast_expression_delete((ast_expression*)self);
1061     mem_d(self);
1062 }
1063
1064 void ast_block_set_type(ast_block *self, ast_expression *from)
1065 {
1066     if (self->expression.next)
1067         ast_delete(self->expression.next);
1068     ast_type_adopt(self, from);
1069 }
1070
1071 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
1072 {
1073     ast_instantiate(ast_function, ctx, ast_function_delete);
1074
1075     if (!vtype ||
1076         vtype->hasvalue ||
1077         vtype->expression.vtype != TYPE_FUNCTION)
1078     {
1079         compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1080                  (int)!vtype,
1081                  (int)vtype->hasvalue,
1082                  vtype->expression.vtype);
1083         mem_d(self);
1084         return NULL;
1085     }
1086
1087     self->vtype  = vtype;
1088     self->name   = name ? util_strdup(name) : NULL;
1089     self->blocks = NULL;
1090
1091     self->labelcount = 0;
1092     self->builtin = 0;
1093
1094     self->ir_func = NULL;
1095     self->curblock = NULL;
1096
1097     self->breakblocks    = NULL;
1098     self->continueblocks = NULL;
1099
1100     vtype->hasvalue = true;
1101     vtype->constval.vfunc = self;
1102
1103     self->varargs          = NULL;
1104     self->argc             = NULL;
1105     self->fixedparams      = NULL;
1106     self->return_value     = NULL;
1107
1108     return self;
1109 }
1110
1111 void ast_function_delete(ast_function *self)
1112 {
1113     size_t i;
1114     if (self->name)
1115         mem_d((void*)self->name);
1116     if (self->vtype) {
1117         /* ast_value_delete(self->vtype); */
1118         self->vtype->hasvalue = false;
1119         self->vtype->constval.vfunc = NULL;
1120         /* We use unref - if it was stored in a global table it is supposed
1121          * to be deleted from *there*
1122          */
1123         ast_unref(self->vtype);
1124     }
1125     for (i = 0; i < vec_size(self->blocks); ++i)
1126         ast_delete(self->blocks[i]);
1127     vec_free(self->blocks);
1128     vec_free(self->breakblocks);
1129     vec_free(self->continueblocks);
1130     if (self->varargs)
1131         ast_delete(self->varargs);
1132     if (self->argc)
1133         ast_delete(self->argc);
1134     if (self->fixedparams)
1135         ast_unref(self->fixedparams);
1136     if (self->return_value)
1137         ast_unref(self->return_value);
1138     mem_d(self);
1139 }
1140
1141 static const char* ast_function_label(ast_function *self, const char *prefix)
1142 {
1143     size_t id;
1144     size_t len;
1145     char  *from;
1146
1147     if (!OPTS_OPTION_BOOL(OPTION_DUMP)    &&
1148         !OPTS_OPTION_BOOL(OPTION_DUMPFIN) &&
1149         !OPTS_OPTION_BOOL(OPTION_DEBUG))
1150     {
1151         return NULL;
1152     }
1153
1154     id  = (self->labelcount++);
1155     len = strlen(prefix);
1156
1157     from = self->labelbuf + sizeof(self->labelbuf)-1;
1158     *from-- = 0;
1159     do {
1160         *from-- = (id%10) + '0';
1161         id /= 10;
1162     } while (id);
1163     ++from;
1164     memcpy(from - len, prefix, len);
1165     return from - len;
1166 }
1167
1168 /*********************************************************************/
1169 /* AST codegen part
1170  * by convention you must never pass NULL to the 'ir_value **out'
1171  * parameter. If you really don't care about the output, pass a dummy.
1172  * But I can't imagine a pituation where the output is truly unnecessary.
1173  */
1174
1175 static void _ast_codegen_output_type(ast_expression *self, ir_value *out)
1176 {
1177     if (out->vtype == TYPE_FIELD)
1178         out->fieldtype = self->next->vtype;
1179     if (out->vtype == TYPE_FUNCTION)
1180         out->outtype = self->next->vtype;
1181 }
1182
1183 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1184
1185 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1186 {
1187     (void)func;
1188     (void)lvalue;
1189     if (self->expression.vtype == TYPE_NIL) {
1190         *out = func->ir_func->owner->nil;
1191         return true;
1192     }
1193     /* NOTE: This is the codegen for a variable used in an expression.
1194      * It is not the codegen to generate the value. For this purpose,
1195      * ast_local_codegen and ast_global_codegen are to be used before this
1196      * is executed. ast_function_codegen should take care of its locals,
1197      * and the ast-user should take care of ast_global_codegen to be used
1198      * on all the globals.
1199      */
1200     if (!self->ir_v) {
1201         char tname[1024]; /* typename is reserved in C++ */
1202         ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1203         compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1204         return false;
1205     }
1206     *out = self->ir_v;
1207     return true;
1208 }
1209
1210 static bool ast_global_array_set(ast_value *self)
1211 {
1212     size_t count = vec_size(self->initlist);
1213     size_t i;
1214
1215     for (i = 0; i != count; ++i) {
1216         switch (self->expression.next->vtype) {
1217             case TYPE_FLOAT:
1218                 if (!ir_value_set_float(self->ir_values[i], self->initlist[i].vfloat))
1219                     return false;
1220                 break;
1221             case TYPE_VECTOR:
1222                 if (!ir_value_set_vector(self->ir_values[i], self->initlist[i].vvec))
1223                     return false;
1224                 break;
1225             case TYPE_STRING:
1226                 if (!ir_value_set_string(self->ir_values[i], self->initlist[i].vstring))
1227                     return false;
1228                 break;
1229             case TYPE_ARRAY:
1230                 /* we don't support them in any other place yet either */
1231                 compile_error(ast_ctx(self), "TODO: nested arrays");
1232                 return false;
1233             case TYPE_FUNCTION:
1234                 /* this requiers a bit more work - similar to the fields I suppose */
1235                 compile_error(ast_ctx(self), "global of type function not properly generated");
1236                 return false;
1237             case TYPE_FIELD:
1238                 if (!self->initlist[i].vfield) {
1239                     compile_error(ast_ctx(self), "field constant without vfield set");
1240                     return false;
1241                 }
1242                 if (!self->initlist[i].vfield->ir_v) {
1243                     compile_error(ast_ctx(self), "field constant generated before its field");
1244                     return false;
1245                 }
1246                 if (!ir_value_set_field(self->ir_values[i], self->initlist[i].vfield->ir_v))
1247                     return false;
1248                 break;
1249             default:
1250                 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1251                 break;
1252         }
1253     }
1254     return true;
1255 }
1256
1257 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1258 {
1259     ir_value *v = NULL;
1260
1261     if (self->expression.vtype == TYPE_NIL) {
1262         compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1263         return false;
1264     }
1265
1266     if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1267     {
1268         ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->vtype);
1269         if (!func)
1270             return false;
1271         func->context = ast_ctx(self);
1272         func->value->context = ast_ctx(self);
1273
1274         self->constval.vfunc->ir_func = func;
1275         self->ir_v = func->value;
1276         if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1277             self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1278         /* The function is filled later on ast_function_codegen... */
1279         return true;
1280     }
1281
1282     if (isfield && self->expression.vtype == TYPE_FIELD) {
1283         ast_expression *fieldtype = self->expression.next;
1284
1285         if (self->hasvalue) {
1286             compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1287             goto error;
1288         }
1289
1290         if (fieldtype->vtype == TYPE_ARRAY) {
1291             size_t ai;
1292             char   *name;
1293             size_t  namelen;
1294
1295             ast_expression *elemtype;
1296             int             vtype;
1297             ast_value      *array = (ast_value*)fieldtype;
1298
1299             if (!ast_istype(fieldtype, ast_value)) {
1300                 compile_error(ast_ctx(self), "internal error: ast_value required");
1301                 return false;
1302             }
1303
1304             /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1305             if (!array->expression.count || array->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE))
1306                 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1307
1308             elemtype = array->expression.next;
1309             vtype = elemtype->vtype;
1310
1311             v = ir_builder_create_field(ir, self->name, vtype);
1312             if (!v) {
1313                 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1314                 return false;
1315             }
1316             v->context = ast_ctx(self);
1317             v->unique_life = true;
1318             v->locked      = true;
1319             array->ir_v = self->ir_v = v;
1320             if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1321                 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1322
1323             namelen = strlen(self->name);
1324             name    = (char*)mem_a(namelen + 16);
1325             util_strncpy(name, self->name, namelen);
1326
1327             array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1328             array->ir_values[0] = v;
1329             for (ai = 1; ai < array->expression.count; ++ai) {
1330                 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1331                 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1332                 if (!array->ir_values[ai]) {
1333                     mem_d(name);
1334                     compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1335                     return false;
1336                 }
1337                 array->ir_values[ai]->context = ast_ctx(self);
1338                 array->ir_values[ai]->unique_life = true;
1339                 array->ir_values[ai]->locked      = true;
1340                 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1341                     self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1342             }
1343             mem_d(name);
1344         }
1345         else
1346         {
1347             v = ir_builder_create_field(ir, self->name, self->expression.next->vtype);
1348             if (!v)
1349                 return false;
1350             v->context = ast_ctx(self);
1351             self->ir_v = v;
1352             if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1353                 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1354         }
1355         return true;
1356     }
1357
1358     if (self->expression.vtype == TYPE_ARRAY) {
1359         size_t ai;
1360         char   *name;
1361         size_t  namelen;
1362
1363         ast_expression *elemtype = self->expression.next;
1364         int vtype = elemtype->vtype;
1365
1366         /* same as with field arrays */
1367         if (!self->expression.count || self->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE))
1368             compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1369
1370         v = ir_builder_create_global(ir, self->name, vtype);
1371         if (!v) {
1372             compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1373             return false;
1374         }
1375         v->context = ast_ctx(self);
1376         v->unique_life = true;
1377         v->locked      = true;
1378         if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1379             v->flags |= IR_FLAG_INCLUDE_DEF;
1380
1381         namelen = strlen(self->name);
1382         name    = (char*)mem_a(namelen + 16);
1383         util_strncpy(name, self->name, namelen);
1384
1385         self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1386         self->ir_values[0] = v;
1387         for (ai = 1; ai < self->expression.count; ++ai) {
1388             util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1389             self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1390             if (!self->ir_values[ai]) {
1391                 mem_d(name);
1392                 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1393                 return false;
1394             }
1395             self->ir_values[ai]->context = ast_ctx(self);
1396             self->ir_values[ai]->unique_life = true;
1397             self->ir_values[ai]->locked      = true;
1398             if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1399                 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1400         }
1401         mem_d(name);
1402     }
1403     else
1404     {
1405         /* Arrays don't do this since there's no "array" value which spans across the
1406          * whole thing.
1407          */
1408         v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1409         if (!v) {
1410             compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1411             return false;
1412         }
1413         codegen_output_type(self, v);
1414         v->context = ast_ctx(self);
1415     }
1416
1417     /* link us to the ir_value */
1418     v->cvq = self->cvq;
1419     self->ir_v = v;
1420     if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1421         self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1422
1423     /* initialize */
1424     if (self->hasvalue) {
1425         switch (self->expression.vtype)
1426         {
1427             case TYPE_FLOAT:
1428                 if (!ir_value_set_float(v, self->constval.vfloat))
1429                     goto error;
1430                 break;
1431             case TYPE_VECTOR:
1432                 if (!ir_value_set_vector(v, self->constval.vvec))
1433                     goto error;
1434                 break;
1435             case TYPE_STRING:
1436                 if (!ir_value_set_string(v, self->constval.vstring))
1437                     goto error;
1438                 break;
1439             case TYPE_ARRAY:
1440                 ast_global_array_set(self);
1441                 break;
1442             case TYPE_FUNCTION:
1443                 compile_error(ast_ctx(self), "global of type function not properly generated");
1444                 goto error;
1445                 /* Cannot generate an IR value for a function,
1446                  * need a pointer pointing to a function rather.
1447                  */
1448             case TYPE_FIELD:
1449                 if (!self->constval.vfield) {
1450                     compile_error(ast_ctx(self), "field constant without vfield set");
1451                     goto error;
1452                 }
1453                 if (!self->constval.vfield->ir_v) {
1454                     compile_error(ast_ctx(self), "field constant generated before its field");
1455                     goto error;
1456                 }
1457                 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1458                     goto error;
1459                 break;
1460             default:
1461                 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1462                 break;
1463         }
1464     }
1465     return true;
1466
1467 error: /* clean up */
1468     ir_value_delete(v);
1469     return false;
1470 }
1471
1472 static bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1473 {
1474     ir_value *v = NULL;
1475
1476     if (self->expression.vtype == TYPE_NIL) {
1477         compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1478         return false;
1479     }
1480
1481     if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1482     {
1483         /* Do we allow local functions? I think not...
1484          * this is NOT a function pointer atm.
1485          */
1486         return false;
1487     }
1488
1489     if (self->expression.vtype == TYPE_ARRAY) {
1490         size_t ai;
1491         char   *name;
1492         size_t  namelen;
1493
1494         ast_expression *elemtype = self->expression.next;
1495         int vtype = elemtype->vtype;
1496
1497         func->flags |= IR_FLAG_HAS_ARRAYS;
1498
1499         if (param && !(self->expression.flags & AST_FLAG_IS_VARARG)) {
1500             compile_error(ast_ctx(self), "array-parameters are not supported");
1501             return false;
1502         }
1503
1504         /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1505         if (!self->expression.count || self->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE)) {
1506             compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1507         }
1508
1509         self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1510         if (!self->ir_values) {
1511             compile_error(ast_ctx(self), "failed to allocate array values");
1512             return false;
1513         }
1514
1515         v = ir_function_create_local(func, self->name, vtype, param);
1516         if (!v) {
1517             compile_error(ast_ctx(self), "internal error: ir_function_create_local failed");
1518             return false;
1519         }
1520         v->context = ast_ctx(self);
1521         v->unique_life = true;
1522         v->locked      = true;
1523
1524         namelen = strlen(self->name);
1525         name    = (char*)mem_a(namelen + 16);
1526         util_strncpy(name, self->name, namelen);
1527
1528         self->ir_values[0] = v;
1529         for (ai = 1; ai < self->expression.count; ++ai) {
1530             util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1531             self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1532             if (!self->ir_values[ai]) {
1533                 compile_error(ast_ctx(self), "internal_error: ir_builder_create_global failed on `%s`", name);
1534                 return false;
1535             }
1536             self->ir_values[ai]->context = ast_ctx(self);
1537             self->ir_values[ai]->unique_life = true;
1538             self->ir_values[ai]->locked      = true;
1539         }
1540         mem_d(name);
1541     }
1542     else
1543     {
1544         v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1545         if (!v)
1546             return false;
1547         codegen_output_type(self, v);
1548         v->context = ast_ctx(self);
1549     }
1550
1551     /* A constant local... hmmm...
1552      * I suppose the IR will have to deal with this
1553      */
1554     if (self->hasvalue) {
1555         switch (self->expression.vtype)
1556         {
1557             case TYPE_FLOAT:
1558                 if (!ir_value_set_float(v, self->constval.vfloat))
1559                     goto error;
1560                 break;
1561             case TYPE_VECTOR:
1562                 if (!ir_value_set_vector(v, self->constval.vvec))
1563                     goto error;
1564                 break;
1565             case TYPE_STRING:
1566                 if (!ir_value_set_string(v, self->constval.vstring))
1567                     goto error;
1568                 break;
1569             default:
1570                 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1571                 break;
1572         }
1573     }
1574
1575     /* link us to the ir_value */
1576     v->cvq = self->cvq;
1577     self->ir_v = v;
1578
1579     if (!ast_generate_accessors(self, func->owner))
1580         return false;
1581     return true;
1582
1583 error: /* clean up */
1584     ir_value_delete(v);
1585     return false;
1586 }
1587
1588 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1589 {
1590     size_t i;
1591     bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1592     if (!self->setter || !self->getter)
1593         return true;
1594     for (i = 0; i < self->expression.count; ++i) {
1595         if (!self->ir_values) {
1596             compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1597             return false;
1598         }
1599         if (!self->ir_values[i]) {
1600             compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1601             return false;
1602         }
1603         if (self->ir_values[i]->life) {
1604             compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1605             return false;
1606         }
1607     }
1608
1609     opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1610     if (self->setter) {
1611         if (!ast_global_codegen  (self->setter, ir, false) ||
1612             !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1613             !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1614         {
1615             compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1616             opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1617             return false;
1618         }
1619     }
1620     if (self->getter) {
1621         if (!ast_global_codegen  (self->getter, ir, false) ||
1622             !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1623             !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1624         {
1625             compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1626             opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1627             return false;
1628         }
1629     }
1630     for (i = 0; i < self->expression.count; ++i) {
1631         vec_free(self->ir_values[i]->life);
1632     }
1633     opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1634     return true;
1635 }
1636
1637 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1638 {
1639     ir_function *irf;
1640     ir_value    *dummy;
1641     ast_expression         *ec;
1642     ast_expression_codegen *cgen;
1643     size_t    i;
1644
1645     (void)ir;
1646
1647     irf = self->ir_func;
1648     if (!irf) {
1649         compile_error(ast_ctx(self), "internal error: ast_function's related ast_value was not generated yet");
1650         return false;
1651     }
1652
1653     /* fill the parameter list */
1654     ec = &self->vtype->expression;
1655     for (i = 0; i < vec_size(ec->params); ++i)
1656     {
1657         if (ec->params[i]->expression.vtype == TYPE_FIELD)
1658             vec_push(irf->params, ec->params[i]->expression.next->vtype);
1659         else
1660             vec_push(irf->params, ec->params[i]->expression.vtype);
1661         if (!self->builtin) {
1662             if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1663                 return false;
1664         }
1665     }
1666
1667     if (self->varargs) {
1668         if (!ast_local_codegen(self->varargs, self->ir_func, true))
1669             return false;
1670         irf->max_varargs = self->varargs->expression.count;
1671     }
1672
1673     if (self->builtin) {
1674         irf->builtin = self->builtin;
1675         return true;
1676     }
1677
1678     /* have a local return value variable? */
1679     if (self->return_value) {
1680         if (!ast_local_codegen(self->return_value, self->ir_func, false))
1681             return false;
1682     }
1683
1684     if (!vec_size(self->blocks)) {
1685         compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1686         return false;
1687     }
1688
1689     irf->first = self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1690     if (!self->curblock) {
1691         compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1692         return false;
1693     }
1694
1695     if (self->argc) {
1696         ir_value *va_count;
1697         ir_value *fixed;
1698         ir_value *sub;
1699         if (!ast_local_codegen(self->argc, self->ir_func, true))
1700             return false;
1701         cgen = self->argc->expression.codegen;
1702         if (!(*cgen)((ast_expression*)(self->argc), self, false, &va_count))
1703             return false;
1704         cgen = self->fixedparams->expression.codegen;
1705         if (!(*cgen)((ast_expression*)(self->fixedparams), self, false, &fixed))
1706             return false;
1707         sub = ir_block_create_binop(self->curblock, ast_ctx(self),
1708                                     ast_function_label(self, "va_count"), INSTR_SUB_F,
1709                                     ir_builder_get_va_count(ir), fixed);
1710         if (!sub)
1711             return false;
1712         if (!ir_block_create_store_op(self->curblock, ast_ctx(self), INSTR_STORE_F,
1713                                       va_count, sub))
1714         {
1715             return false;
1716         }
1717     }
1718
1719     for (i = 0; i < vec_size(self->blocks); ++i) {
1720         cgen = self->blocks[i]->expression.codegen;
1721         if (!(*cgen)((ast_expression*)self->blocks[i], self, false, &dummy))
1722             return false;
1723     }
1724
1725     /* TODO: check return types */
1726     if (!self->curblock->final)
1727     {
1728         if (!self->vtype->expression.next ||
1729             self->vtype->expression.next->vtype == TYPE_VOID)
1730         {
1731             return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1732         }
1733         else if (vec_size(self->curblock->entries) || self->curblock == irf->first)
1734         {
1735             if (self->return_value) {
1736                 cgen = self->return_value->expression.codegen;
1737                 if (!(*cgen)((ast_expression*)(self->return_value), self, false, &dummy))
1738                     return false;
1739                 return ir_block_create_return(self->curblock, ast_ctx(self), dummy);
1740             }
1741             else if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1742                                 "control reaches end of non-void function (`%s`) via %s",
1743                                 self->name, self->curblock->label))
1744             {
1745                 return false;
1746             }
1747             return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1748         }
1749     }
1750     return true;
1751 }
1752
1753 /* Note, you will not see ast_block_codegen generate ir_blocks.
1754  * To the AST and the IR, blocks are 2 different things.
1755  * In the AST it represents a block of code, usually enclosed in
1756  * curly braces {...}.
1757  * While in the IR it represents a block in terms of control-flow.
1758  */
1759 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1760 {
1761     size_t i;
1762
1763     /* We don't use this
1764      * Note: an ast-representation using the comma-operator
1765      * of the form: (a, b, c) = x should not assign to c...
1766      */
1767     if (lvalue) {
1768         compile_error(ast_ctx(self), "not an l-value (code-block)");
1769         return false;
1770     }
1771
1772     if (self->expression.outr) {
1773         *out = self->expression.outr;
1774         return true;
1775     }
1776
1777     /* output is NULL at first, we'll have each expression
1778      * assign to out output, thus, a comma-operator represention
1779      * using an ast_block will return the last generated value,
1780      * so: (b, c) + a  executed both b and c, and returns c,
1781      * which is then added to a.
1782      */
1783     *out = NULL;
1784
1785     /* generate locals */
1786     for (i = 0; i < vec_size(self->locals); ++i)
1787     {
1788         if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1789             if (OPTS_OPTION_BOOL(OPTION_DEBUG))
1790                 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1791             return false;
1792         }
1793     }
1794
1795     for (i = 0; i < vec_size(self->exprs); ++i)
1796     {
1797         ast_expression_codegen *gen;
1798         if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1799             if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1800                 return false;
1801             continue;
1802         }
1803         gen = self->exprs[i]->codegen;
1804         if (!(*gen)(self->exprs[i], func, false, out))
1805             return false;
1806     }
1807
1808     self->expression.outr = *out;
1809
1810     return true;
1811 }
1812
1813 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1814 {
1815     ast_expression_codegen *cgen;
1816     ir_value *left  = NULL;
1817     ir_value *right = NULL;
1818
1819     ast_value       *arr;
1820     ast_value       *idx = 0;
1821     ast_array_index *ai = NULL;
1822
1823     if (lvalue && self->expression.outl) {
1824         *out = self->expression.outl;
1825         return true;
1826     }
1827
1828     if (!lvalue && self->expression.outr) {
1829         *out = self->expression.outr;
1830         return true;
1831     }
1832
1833     if (ast_istype(self->dest, ast_array_index))
1834     {
1835
1836         ai = (ast_array_index*)self->dest;
1837         idx = (ast_value*)ai->index;
1838
1839         if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1840             ai = NULL;
1841     }
1842
1843     if (ai) {
1844         /* we need to call the setter */
1845         ir_value  *iridx, *funval;
1846         ir_instr  *call;
1847
1848         if (lvalue) {
1849             compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1850             return false;
1851         }
1852
1853         arr = (ast_value*)ai->array;
1854         if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1855             compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1856             return false;
1857         }
1858
1859         cgen = idx->expression.codegen;
1860         if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1861             return false;
1862
1863         cgen = arr->setter->expression.codegen;
1864         if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1865             return false;
1866
1867         cgen = self->source->codegen;
1868         if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1869             return false;
1870
1871         call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1872         if (!call)
1873             return false;
1874         ir_call_param(call, iridx);
1875         ir_call_param(call, right);
1876         self->expression.outr = right;
1877     }
1878     else
1879     {
1880         /* regular code */
1881
1882         cgen = self->dest->codegen;
1883         /* lvalue! */
1884         if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1885             return false;
1886         self->expression.outl = left;
1887
1888         cgen = self->source->codegen;
1889         /* rvalue! */
1890         if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1891             return false;
1892
1893         if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
1894             return false;
1895         self->expression.outr = right;
1896     }
1897
1898     /* Theoretically, an assinment returns its left side as an
1899      * lvalue, if we don't need an lvalue though, we return
1900      * the right side as an rvalue, otherwise we have to
1901      * somehow know whether or not we need to dereference the pointer
1902      * on the left side - that is: OP_LOAD if it was an address.
1903      * Also: in original QC we cannot OP_LOADP *anyway*.
1904      */
1905     *out = (lvalue ? left : right);
1906
1907     return true;
1908 }
1909
1910 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1911 {
1912     ast_expression_codegen *cgen;
1913     ir_value *left, *right;
1914
1915     /* A binary operation cannot yield an l-value */
1916     if (lvalue) {
1917         compile_error(ast_ctx(self), "not an l-value (binop)");
1918         return false;
1919     }
1920
1921     if (self->expression.outr) {
1922         *out = self->expression.outr;
1923         return true;
1924     }
1925
1926     if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
1927         (self->op == INSTR_AND || self->op == INSTR_OR))
1928     {
1929         /* short circuit evaluation */
1930         ir_block *other, *merge;
1931         ir_block *from_left, *from_right;
1932         ir_instr *phi;
1933         size_t    merge_id;
1934
1935         /* prepare end-block */
1936         merge_id = vec_size(func->ir_func->blocks);
1937         merge    = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
1938
1939         /* generate the left expression */
1940         cgen = self->left->codegen;
1941         if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1942             return false;
1943         /* remember the block */
1944         from_left = func->curblock;
1945
1946         /* create a new block for the right expression */
1947         other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
1948         if (self->op == INSTR_AND) {
1949             /* on AND: left==true -> other */
1950             if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
1951                 return false;
1952         } else {
1953             /* on OR: left==false -> other */
1954             if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
1955                 return false;
1956         }
1957         /* use the likely flag */
1958         vec_last(func->curblock->instr)->likely = true;
1959
1960         /* enter the right-expression's block */
1961         func->curblock = other;
1962         /* generate */
1963         cgen = self->right->codegen;
1964         if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1965             return false;
1966         /* remember block */
1967         from_right = func->curblock;
1968
1969         /* jump to the merge block */
1970         if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
1971             return false;
1972
1973         vec_remove(func->ir_func->blocks, merge_id, 1);
1974         vec_push(func->ir_func->blocks, merge);
1975
1976         func->curblock = merge;
1977         phi = ir_block_create_phi(func->curblock, ast_ctx(self),
1978                                   ast_function_label(func, "sce_value"),
1979                                   self->expression.vtype);
1980         ir_phi_add(phi, from_left, left);
1981         ir_phi_add(phi, from_right, right);
1982         *out = ir_phi_value(phi);
1983         if (!*out)
1984             return false;
1985
1986         if (!OPTS_FLAG(PERL_LOGIC)) {
1987             /* cast-to-bool */
1988             if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
1989                 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1990                                              ast_function_label(func, "sce_bool_v"),
1991                                              INSTR_NOT_V, *out);
1992                 if (!*out)
1993                     return false;
1994                 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
1995                                              ast_function_label(func, "sce_bool"),
1996                                              INSTR_NOT_F, *out);
1997                 if (!*out)
1998                     return false;
1999             }
2000             else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
2001                 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2002                                              ast_function_label(func, "sce_bool_s"),
2003                                              INSTR_NOT_S, *out);
2004                 if (!*out)
2005                     return false;
2006                 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2007                                              ast_function_label(func, "sce_bool"),
2008                                              INSTR_NOT_F, *out);
2009                 if (!*out)
2010                     return false;
2011             }
2012             else {
2013                 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
2014                                              ast_function_label(func, "sce_bool"),
2015                                              INSTR_AND, *out, *out);
2016                 if (!*out)
2017                     return false;
2018             }
2019         }
2020
2021         self->expression.outr = *out;
2022         codegen_output_type(self, *out);
2023         return true;
2024     }
2025
2026     cgen = self->left->codegen;
2027     if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2028         return false;
2029
2030     cgen = self->right->codegen;
2031     if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2032         return false;
2033
2034     *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
2035                                  self->op, left, right);
2036     if (!*out)
2037         return false;
2038     self->expression.outr = *out;
2039     codegen_output_type(self, *out);
2040
2041     return true;
2042 }
2043
2044 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
2045 {
2046     ast_expression_codegen *cgen;
2047     ir_value *leftl = NULL, *leftr, *right, *bin;
2048
2049     ast_value       *arr;
2050     ast_value       *idx = 0;
2051     ast_array_index *ai = NULL;
2052     ir_value        *iridx = NULL;
2053
2054     if (lvalue && self->expression.outl) {
2055         *out = self->expression.outl;
2056         return true;
2057     }
2058
2059     if (!lvalue && self->expression.outr) {
2060         *out = self->expression.outr;
2061         return true;
2062     }
2063
2064     if (ast_istype(self->dest, ast_array_index))
2065     {
2066
2067         ai = (ast_array_index*)self->dest;
2068         idx = (ast_value*)ai->index;
2069
2070         if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
2071             ai = NULL;
2072     }
2073
2074     /* for a binstore we need both an lvalue and an rvalue for the left side */
2075     /* rvalue of destination! */
2076     if (ai) {
2077         cgen = idx->expression.codegen;
2078         if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2079             return false;
2080     }
2081     cgen = self->dest->codegen;
2082     if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
2083         return false;
2084
2085     /* source as rvalue only */
2086     cgen = self->source->codegen;
2087     if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2088         return false;
2089
2090     /* now the binary */
2091     bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
2092                                 self->opbin, leftr, right);
2093     self->expression.outr = bin;
2094
2095
2096     if (ai) {
2097         /* we need to call the setter */
2098         ir_value  *funval;
2099         ir_instr  *call;
2100
2101         if (lvalue) {
2102             compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2103             return false;
2104         }
2105
2106         arr = (ast_value*)ai->array;
2107         if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2108             compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2109             return false;
2110         }
2111
2112         cgen = arr->setter->expression.codegen;
2113         if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2114             return false;
2115
2116         call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2117         if (!call)
2118             return false;
2119         ir_call_param(call, iridx);
2120         ir_call_param(call, bin);
2121         self->expression.outr = bin;
2122     } else {
2123         /* now store them */
2124         cgen = self->dest->codegen;
2125         /* lvalue of destination */
2126         if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2127             return false;
2128         self->expression.outl = leftl;
2129
2130         if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2131             return false;
2132         self->expression.outr = bin;
2133     }
2134
2135     /* Theoretically, an assinment returns its left side as an
2136      * lvalue, if we don't need an lvalue though, we return
2137      * the right side as an rvalue, otherwise we have to
2138      * somehow know whether or not we need to dereference the pointer
2139      * on the left side - that is: OP_LOAD if it was an address.
2140      * Also: in original QC we cannot OP_LOADP *anyway*.
2141      */
2142     *out = (lvalue ? leftl : bin);
2143
2144     return true;
2145 }
2146
2147 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2148 {
2149     ast_expression_codegen *cgen;
2150     ir_value *operand;
2151
2152     /* An unary operation cannot yield an l-value */
2153     if (lvalue) {
2154         compile_error(ast_ctx(self), "not an l-value (binop)");
2155         return false;
2156     }
2157
2158     if (self->expression.outr) {
2159         *out = self->expression.outr;
2160         return true;
2161     }
2162
2163     cgen = self->operand->codegen;
2164     /* lvalue! */
2165     if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2166         return false;
2167
2168     *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2169                                  self->op, operand);
2170     if (!*out)
2171         return false;
2172     self->expression.outr = *out;
2173
2174     return true;
2175 }
2176
2177 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2178 {
2179     ast_expression_codegen *cgen;
2180     ir_value *operand;
2181
2182     *out = NULL;
2183
2184     /* In the context of a return operation, we don't actually return
2185      * anything...
2186      */
2187     if (lvalue) {
2188         compile_error(ast_ctx(self), "return-expression is not an l-value");
2189         return false;
2190     }
2191
2192     if (self->expression.outr) {
2193         compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2194         return false;
2195     }
2196     self->expression.outr = (ir_value*)1;
2197
2198     if (self->operand) {
2199         cgen = self->operand->codegen;
2200         /* lvalue! */
2201         if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2202             return false;
2203
2204         if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2205             return false;
2206     } else {
2207         if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2208             return false;
2209     }
2210
2211     return true;
2212 }
2213
2214 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2215 {
2216     ast_expression_codegen *cgen;
2217     ir_value *ent, *field;
2218
2219     /* This function needs to take the 'lvalue' flag into account!
2220      * As lvalue we provide a field-pointer, as rvalue we provide the
2221      * value in a temp.
2222      */
2223
2224     if (lvalue && self->expression.outl) {
2225         *out = self->expression.outl;
2226         return true;
2227     }
2228
2229     if (!lvalue && self->expression.outr) {
2230         *out = self->expression.outr;
2231         return true;
2232     }
2233
2234     cgen = self->entity->codegen;
2235     if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2236         return false;
2237
2238     cgen = self->field->codegen;
2239     if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2240         return false;
2241
2242     if (lvalue) {
2243         /* address! */
2244         *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2245                                             ent, field);
2246     } else {
2247         *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2248                                              ent, field, self->expression.vtype);
2249         /* Done AFTER error checking:
2250         codegen_output_type(self, *out);
2251         */
2252     }
2253     if (!*out) {
2254         compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2255                  (lvalue ? "ADDRESS" : "FIELD"),
2256                  type_name[self->expression.vtype]);
2257         return false;
2258     }
2259     if (!lvalue)
2260         codegen_output_type(self, *out);
2261
2262     if (lvalue)
2263         self->expression.outl = *out;
2264     else
2265         self->expression.outr = *out;
2266
2267     /* Hm that should be it... */
2268     return true;
2269 }
2270
2271 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2272 {
2273     ast_expression_codegen *cgen;
2274     ir_value *vec;
2275
2276     /* in QC this is always an lvalue */
2277     if (lvalue && self->rvalue) {
2278         compile_error(ast_ctx(self), "not an l-value (member access)");
2279         return false;
2280     }
2281     if (self->expression.outl) {
2282         *out = self->expression.outl;
2283         return true;
2284     }
2285
2286     cgen = self->owner->codegen;
2287     if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2288         return false;
2289
2290     if (vec->vtype != TYPE_VECTOR &&
2291         !(vec->vtype == TYPE_FIELD && self->owner->next->vtype == TYPE_VECTOR))
2292     {
2293         return false;
2294     }
2295
2296     *out = ir_value_vector_member(vec, self->field);
2297     self->expression.outl = *out;
2298
2299     return (*out != NULL);
2300 }
2301
2302 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2303 {
2304     ast_value *arr;
2305     ast_value *idx;
2306
2307     if (!lvalue && self->expression.outr) {
2308         *out = self->expression.outr;
2309         return true;
2310     }
2311     if (lvalue && self->expression.outl) {
2312         *out = self->expression.outl;
2313         return true;
2314     }
2315
2316     if (!ast_istype(self->array, ast_value)) {
2317         compile_error(ast_ctx(self), "array indexing this way is not supported");
2318         /* note this would actually be pointer indexing because the left side is
2319          * not an actual array but (hopefully) an indexable expression.
2320          * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2321          * support this path will be filled.
2322          */
2323         return false;
2324     }
2325
2326     arr = (ast_value*)self->array;
2327     idx = (ast_value*)self->index;
2328
2329     if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2330         /* Time to use accessor functions */
2331         ast_expression_codegen *cgen;
2332         ir_value               *iridx, *funval;
2333         ir_instr               *call;
2334
2335         if (lvalue) {
2336             compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2337             return false;
2338         }
2339
2340         if (!arr->getter) {
2341             compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2342             return false;
2343         }
2344
2345         cgen = self->index->codegen;
2346         if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2347             return false;
2348
2349         cgen = arr->getter->expression.codegen;
2350         if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2351             return false;
2352
2353         call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2354         if (!call)
2355             return false;
2356         ir_call_param(call, iridx);
2357
2358         *out = ir_call_value(call);
2359         self->expression.outr = *out;
2360         (*out)->vtype = self->expression.vtype;
2361         codegen_output_type(self, *out);
2362         return true;
2363     }
2364
2365     if (idx->expression.vtype == TYPE_FLOAT) {
2366         unsigned int arridx = idx->constval.vfloat;
2367         if (arridx >= self->array->count)
2368         {
2369             compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2370             return false;
2371         }
2372         *out = arr->ir_values[arridx];
2373     }
2374     else if (idx->expression.vtype == TYPE_INTEGER) {
2375         unsigned int arridx = idx->constval.vint;
2376         if (arridx >= self->array->count)
2377         {
2378             compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2379             return false;
2380         }
2381         *out = arr->ir_values[arridx];
2382     }
2383     else {
2384         compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2385         return false;
2386     }
2387     (*out)->vtype = self->expression.vtype;
2388     codegen_output_type(self, *out);
2389     return true;
2390 }
2391
2392 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2393 {
2394     ast_expression_codegen *cgen;
2395
2396     ir_value *condval;
2397     ir_value *dummy;
2398
2399     ir_block *cond;
2400     ir_block *ontrue;
2401     ir_block *onfalse;
2402     ir_block *ontrue_endblock = NULL;
2403     ir_block *onfalse_endblock = NULL;
2404     ir_block *merge = NULL;
2405
2406     /* We don't output any value, thus also don't care about r/lvalue */
2407     (void)out;
2408     (void)lvalue;
2409
2410     if (self->expression.outr) {
2411         compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2412         return false;
2413     }
2414     self->expression.outr = (ir_value*)1;
2415
2416     /* generate the condition */
2417     cgen = self->cond->codegen;
2418     if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2419         return false;
2420     /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2421     cond = func->curblock;
2422
2423     /* on-true path */
2424
2425     if (self->on_true) {
2426         /* create on-true block */
2427         ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2428         if (!ontrue)
2429             return false;
2430
2431         /* enter the block */
2432         func->curblock = ontrue;
2433
2434         /* generate */
2435         cgen = self->on_true->codegen;
2436         if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2437             return false;
2438
2439         /* we now need to work from the current endpoint */
2440         ontrue_endblock = func->curblock;
2441     } else
2442         ontrue = NULL;
2443
2444     /* on-false path */
2445     if (self->on_false) {
2446         /* create on-false block */
2447         onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2448         if (!onfalse)
2449             return false;
2450
2451         /* enter the block */
2452         func->curblock = onfalse;
2453
2454         /* generate */
2455         cgen = self->on_false->codegen;
2456         if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2457             return false;
2458
2459         /* we now need to work from the current endpoint */
2460         onfalse_endblock = func->curblock;
2461     } else
2462         onfalse = NULL;
2463
2464     /* Merge block were they all merge in to */
2465     if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2466     {
2467         merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2468         if (!merge)
2469             return false;
2470         /* add jumps ot the merge block */
2471         if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2472             return false;
2473         if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2474             return false;
2475
2476         /* Now enter the merge block */
2477         func->curblock = merge;
2478     }
2479
2480     /* we create the if here, that way all blocks are ordered :)
2481      */
2482     if (!ir_block_create_if(cond, ast_ctx(self), condval,
2483                             (ontrue  ? ontrue  : merge),
2484                             (onfalse ? onfalse : merge)))
2485     {
2486         return false;
2487     }
2488
2489     return true;
2490 }
2491
2492 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2493 {
2494     ast_expression_codegen *cgen;
2495
2496     ir_value *condval;
2497     ir_value *trueval, *falseval;
2498     ir_instr *phi;
2499
2500     ir_block *cond = func->curblock;
2501     ir_block *cond_out = NULL;
2502     ir_block *ontrue, *ontrue_out = NULL;
2503     ir_block *onfalse, *onfalse_out = NULL;
2504     ir_block *merge;
2505
2506     /* Ternary can never create an lvalue... */
2507     if (lvalue)
2508         return false;
2509
2510     /* In theory it shouldn't be possible to pass through a node twice, but
2511      * in case we add any kind of optimization pass for the AST itself, it
2512      * may still happen, thus we remember a created ir_value and simply return one
2513      * if it already exists.
2514      */
2515     if (self->expression.outr) {
2516         *out = self->expression.outr;
2517         return true;
2518     }
2519
2520     /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2521
2522     /* generate the condition */
2523     func->curblock = cond;
2524     cgen = self->cond->codegen;
2525     if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2526         return false;
2527     cond_out = func->curblock;
2528
2529     /* create on-true block */
2530     ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2531     if (!ontrue)
2532         return false;
2533     else
2534     {
2535         /* enter the block */
2536         func->curblock = ontrue;
2537
2538         /* generate */
2539         cgen = self->on_true->codegen;
2540         if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2541             return false;
2542
2543         ontrue_out = func->curblock;
2544     }
2545
2546     /* create on-false block */
2547     onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2548     if (!onfalse)
2549         return false;
2550     else
2551     {
2552         /* enter the block */
2553         func->curblock = onfalse;
2554
2555         /* generate */
2556         cgen = self->on_false->codegen;
2557         if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2558             return false;
2559
2560         onfalse_out = func->curblock;
2561     }
2562
2563     /* create merge block */
2564     merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2565     if (!merge)
2566         return false;
2567     /* jump to merge block */
2568     if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2569         return false;
2570     if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2571         return false;
2572
2573     /* create if instruction */
2574     if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2575         return false;
2576
2577     /* Now enter the merge block */
2578     func->curblock = merge;
2579
2580     /* Here, now, we need a PHI node
2581      * but first some sanity checking...
2582      */
2583     if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2584         /* error("ternary with different types on the two sides"); */
2585         compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2586         return false;
2587     }
2588
2589     /* create PHI */
2590     phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->expression.vtype);
2591     if (!phi) {
2592         compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2593         return false;
2594     }
2595     ir_phi_add(phi, ontrue_out,  trueval);
2596     ir_phi_add(phi, onfalse_out, falseval);
2597
2598     self->expression.outr = ir_phi_value(phi);
2599     *out = self->expression.outr;
2600
2601     codegen_output_type(self, *out);
2602
2603     return true;
2604 }
2605
2606 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2607 {
2608     ast_expression_codegen *cgen;
2609
2610     ir_value *dummy      = NULL;
2611     ir_value *precond    = NULL;
2612     ir_value *postcond   = NULL;
2613
2614     /* Since we insert some jumps "late" so we have blocks
2615      * ordered "nicely", we need to keep track of the actual end-blocks
2616      * of expressions to add the jumps to.
2617      */
2618     ir_block *bbody      = NULL, *end_bbody      = NULL;
2619     ir_block *bprecond   = NULL, *end_bprecond   = NULL;
2620     ir_block *bpostcond  = NULL, *end_bpostcond  = NULL;
2621     ir_block *bincrement = NULL, *end_bincrement = NULL;
2622     ir_block *bout       = NULL, *bin            = NULL;
2623
2624     /* let's at least move the outgoing block to the end */
2625     size_t    bout_id;
2626
2627     /* 'break' and 'continue' need to be able to find the right blocks */
2628     ir_block *bcontinue     = NULL;
2629     ir_block *bbreak        = NULL;
2630
2631     ir_block *tmpblock      = NULL;
2632
2633     (void)lvalue;
2634     (void)out;
2635
2636     if (self->expression.outr) {
2637         compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2638         return false;
2639     }
2640     self->expression.outr = (ir_value*)1;
2641
2642     /* NOTE:
2643      * Should we ever need some kind of block ordering, better make this function
2644      * move blocks around than write a block ordering algorithm later... after all
2645      * the ast and ir should work together, not against each other.
2646      */
2647
2648     /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2649      * anyway if for example it contains a ternary.
2650      */
2651     if (self->initexpr)
2652     {
2653         cgen = self->initexpr->codegen;
2654         if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2655             return false;
2656     }
2657
2658     /* Store the block from which we enter this chaos */
2659     bin = func->curblock;
2660
2661     /* The pre-loop condition needs its own block since we
2662      * need to be able to jump to the start of that expression.
2663      */
2664     if (self->precond)
2665     {
2666         bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2667         if (!bprecond)
2668             return false;
2669
2670         /* the pre-loop-condition the least important place to 'continue' at */
2671         bcontinue = bprecond;
2672
2673         /* enter */
2674         func->curblock = bprecond;
2675
2676         /* generate */
2677         cgen = self->precond->codegen;
2678         if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2679             return false;
2680
2681         end_bprecond = func->curblock;
2682     } else {
2683         bprecond = end_bprecond = NULL;
2684     }
2685
2686     /* Now the next blocks won't be ordered nicely, but we need to
2687      * generate them this early for 'break' and 'continue'.
2688      */
2689     if (self->increment) {
2690         bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2691         if (!bincrement)
2692             return false;
2693         bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2694     } else {
2695         bincrement = end_bincrement = NULL;
2696     }
2697
2698     if (self->postcond) {
2699         bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2700         if (!bpostcond)
2701             return false;
2702         bcontinue = bpostcond; /* postcond comes before the increment */
2703     } else {
2704         bpostcond = end_bpostcond = NULL;
2705     }
2706
2707     bout_id = vec_size(func->ir_func->blocks);
2708     bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2709     if (!bout)
2710         return false;
2711     bbreak = bout;
2712
2713     /* The loop body... */
2714     /* if (self->body) */
2715     {
2716         bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2717         if (!bbody)
2718             return false;
2719
2720         /* enter */
2721         func->curblock = bbody;
2722
2723         vec_push(func->breakblocks,    bbreak);
2724         if (bcontinue)
2725             vec_push(func->continueblocks, bcontinue);
2726         else
2727             vec_push(func->continueblocks, bbody);
2728
2729         /* generate */
2730         if (self->body) {
2731             cgen = self->body->codegen;
2732             if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2733                 return false;
2734         }
2735
2736         end_bbody = func->curblock;
2737         vec_pop(func->breakblocks);
2738         vec_pop(func->continueblocks);
2739     }
2740
2741     /* post-loop-condition */
2742     if (self->postcond)
2743     {
2744         /* enter */
2745         func->curblock = bpostcond;
2746
2747         /* generate */
2748         cgen = self->postcond->codegen;
2749         if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2750             return false;
2751
2752         end_bpostcond = func->curblock;
2753     }
2754
2755     /* The incrementor */
2756     if (self->increment)
2757     {
2758         /* enter */
2759         func->curblock = bincrement;
2760
2761         /* generate */
2762         cgen = self->increment->codegen;
2763         if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2764             return false;
2765
2766         end_bincrement = func->curblock;
2767     }
2768
2769     /* In any case now, we continue from the outgoing block */
2770     func->curblock = bout;
2771
2772     /* Now all blocks are in place */
2773     /* From 'bin' we jump to whatever comes first */
2774     if      (bprecond)   tmpblock = bprecond;
2775     else if (bbody)      tmpblock = bbody;
2776     else if (bpostcond)  tmpblock = bpostcond;
2777     else                 tmpblock = bout;
2778     if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2779         return false;
2780
2781     /* From precond */
2782     if (bprecond)
2783     {
2784         ir_block *ontrue, *onfalse;
2785         if      (bbody)      ontrue = bbody;
2786         else if (bincrement) ontrue = bincrement;
2787         else if (bpostcond)  ontrue = bpostcond;
2788         else                 ontrue = bprecond;
2789         onfalse = bout;
2790         if (self->pre_not) {
2791             tmpblock = ontrue;
2792             ontrue   = onfalse;
2793             onfalse  = tmpblock;
2794         }
2795         if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2796             return false;
2797     }
2798
2799     /* from body */
2800     if (bbody)
2801     {
2802         if      (bincrement) tmpblock = bincrement;
2803         else if (bpostcond)  tmpblock = bpostcond;
2804         else if (bprecond)   tmpblock = bprecond;
2805         else                 tmpblock = bbody;
2806         if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2807             return false;
2808     }
2809
2810     /* from increment */
2811     if (bincrement)
2812     {
2813         if      (bpostcond)  tmpblock = bpostcond;
2814         else if (bprecond)   tmpblock = bprecond;
2815         else if (bbody)      tmpblock = bbody;
2816         else                 tmpblock = bout;
2817         if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2818             return false;
2819     }
2820
2821     /* from postcond */
2822     if (bpostcond)
2823     {
2824         ir_block *ontrue, *onfalse;
2825         if      (bprecond)   ontrue = bprecond;
2826         else if (bbody)      ontrue = bbody;
2827         else if (bincrement) ontrue = bincrement;
2828         else                 ontrue = bpostcond;
2829         onfalse = bout;
2830         if (self->post_not) {
2831             tmpblock = ontrue;
2832             ontrue   = onfalse;
2833             onfalse  = tmpblock;
2834         }
2835         if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
2836             return false;
2837     }
2838
2839     /* Move 'bout' to the end */
2840     vec_remove(func->ir_func->blocks, bout_id, 1);
2841     vec_push(func->ir_func->blocks, bout);
2842
2843     return true;
2844 }
2845
2846 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2847 {
2848     ir_block *target;
2849
2850     *out = NULL;
2851
2852     if (lvalue) {
2853         compile_error(ast_ctx(self), "break/continue expression is not an l-value");
2854         return false;
2855     }
2856
2857     if (self->expression.outr) {
2858         compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2859         return false;
2860     }
2861     self->expression.outr = (ir_value*)1;
2862
2863     if (self->is_continue)
2864         target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
2865     else
2866         target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
2867
2868     if (!target) {
2869         compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
2870         return false;
2871     }
2872
2873     if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
2874         return false;
2875     return true;
2876 }
2877
2878 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2879 {
2880     ast_expression_codegen *cgen;
2881
2882     ast_switch_case *def_case     = NULL;
2883     ir_block        *def_bfall    = NULL;
2884     ir_block        *def_bfall_to = NULL;
2885     bool set_def_bfall_to = false;
2886
2887     ir_value *dummy     = NULL;
2888     ir_value *irop      = NULL;
2889     ir_block *bout      = NULL;
2890     ir_block *bfall     = NULL;
2891     size_t    bout_id;
2892     size_t    c;
2893
2894     char      typestr[1024];
2895     uint16_t  cmpinstr;
2896
2897     if (lvalue) {
2898         compile_error(ast_ctx(self), "switch expression is not an l-value");
2899         return false;
2900     }
2901
2902     if (self->expression.outr) {
2903         compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2904         return false;
2905     }
2906     self->expression.outr = (ir_value*)1;
2907
2908     (void)lvalue;
2909     (void)out;
2910
2911     cgen = self->operand->codegen;
2912     if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2913         return false;
2914
2915     if (!vec_size(self->cases))
2916         return true;
2917
2918     cmpinstr = type_eq_instr[irop->vtype];
2919     if (cmpinstr >= VINSTR_END) {
2920         ast_type_to_string(self->operand, typestr, sizeof(typestr));
2921         compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2922         return false;
2923     }
2924
2925     bout_id = vec_size(func->ir_func->blocks);
2926     bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
2927     if (!bout)
2928         return false;
2929
2930     /* setup the break block */
2931     vec_push(func->breakblocks, bout);
2932
2933     /* Now create all cases */
2934     for (c = 0; c < vec_size(self->cases); ++c) {
2935         ir_value *cond, *val;
2936         ir_block *bcase, *bnot;
2937         size_t bnot_id;
2938
2939         ast_switch_case *swcase = &self->cases[c];
2940
2941         if (swcase->value) {
2942             /* A regular case */
2943             /* generate the condition operand */
2944             cgen = swcase->value->codegen;
2945             if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2946                 return false;
2947             /* generate the condition */
2948             cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2949             if (!cond)
2950                 return false;
2951
2952             bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
2953             bnot_id = vec_size(func->ir_func->blocks);
2954             bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
2955             if (!bcase || !bnot)
2956                 return false;
2957             if (set_def_bfall_to) {
2958                 set_def_bfall_to = false;
2959                 def_bfall_to = bcase;
2960             }
2961             if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
2962                 return false;
2963
2964             /* Make the previous case-end fall through */
2965             if (bfall && !bfall->final) {
2966                 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
2967                     return false;
2968             }
2969
2970             /* enter the case */
2971             func->curblock = bcase;
2972             cgen = swcase->code->codegen;
2973             if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2974                 return false;
2975
2976             /* remember this block to fall through from */
2977             bfall = func->curblock;
2978
2979             /* enter the else and move it down */
2980             func->curblock = bnot;
2981             vec_remove(func->ir_func->blocks, bnot_id, 1);
2982             vec_push(func->ir_func->blocks, bnot);
2983         } else {
2984             /* The default case */
2985             /* Remember where to fall through from: */
2986             def_bfall = bfall;
2987             bfall     = NULL;
2988             /* remember which case it was */
2989             def_case  = swcase;
2990             /* And the next case will be remembered */
2991             set_def_bfall_to = true;
2992         }
2993     }
2994
2995     /* Jump from the last bnot to bout */
2996     if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
2997         /*
2998         astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
2999         */
3000         return false;
3001     }
3002
3003     /* If there was a default case, put it down here */
3004     if (def_case) {
3005         ir_block *bcase;
3006
3007         /* No need to create an extra block */
3008         bcase = func->curblock;
3009
3010         /* Insert the fallthrough jump */
3011         if (def_bfall && !def_bfall->final) {
3012             if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
3013                 return false;
3014         }
3015
3016         /* Now generate the default code */
3017         cgen = def_case->code->codegen;
3018         if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
3019             return false;
3020
3021         /* see if we need to fall through */
3022         if (def_bfall_to && !func->curblock->final)
3023         {
3024             if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
3025                 return false;
3026         }
3027     }
3028
3029     /* Jump from the last bnot to bout */
3030     if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
3031         return false;
3032     /* enter the outgoing block */
3033     func->curblock = bout;
3034
3035     /* restore the break block */
3036     vec_pop(func->breakblocks);
3037
3038     /* Move 'bout' to the end, it's nicer */
3039     vec_remove(func->ir_func->blocks, bout_id, 1);
3040     vec_push(func->ir_func->blocks, bout);
3041
3042     return true;
3043 }
3044
3045 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
3046 {
3047     size_t i;
3048     ir_value *dummy;
3049
3050     if (self->undefined) {
3051         compile_error(ast_ctx(self), "internal error: ast_label never defined");
3052         return false;
3053     }
3054
3055     *out = NULL;
3056     if (lvalue) {
3057         compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
3058         return false;
3059     }
3060
3061     /* simply create a new block and jump to it */
3062     self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
3063     if (!self->irblock) {
3064         compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
3065         return false;
3066     }
3067     if (!func->curblock->final) {
3068         if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
3069             return false;
3070     }
3071
3072     /* enter the new block */
3073     func->curblock = self->irblock;
3074
3075     /* Generate all the leftover gotos */
3076     for (i = 0; i < vec_size(self->gotos); ++i) {
3077         if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
3078             return false;
3079     }
3080
3081     return true;
3082 }
3083
3084 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
3085 {
3086     *out = NULL;
3087     if (lvalue) {
3088         compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
3089         return false;
3090     }
3091
3092     if (self->target->irblock) {
3093         if (self->irblock_from) {
3094             /* we already tried once, this is the callback */
3095             self->irblock_from->final = false;
3096             if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
3097                 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3098                 return false;
3099             }
3100         }
3101         else
3102         {
3103             if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
3104                 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3105                 return false;
3106             }
3107         }
3108     }
3109     else
3110     {
3111         /* the target has not yet been created...
3112          * close this block in a sneaky way:
3113          */
3114         func->curblock->final = true;
3115         self->irblock_from = func->curblock;
3116         ast_label_register_goto(self->target, self);
3117     }
3118
3119     return true;
3120 }
3121
3122 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
3123 {
3124     ast_expression_codegen *cgen;
3125     ir_value              **params;
3126     ir_instr               *callinstr;
3127     size_t i;
3128
3129     ir_value *funval = NULL;
3130
3131     /* return values are never lvalues */
3132     if (lvalue) {
3133         compile_error(ast_ctx(self), "not an l-value (function call)");
3134         return false;
3135     }
3136
3137     if (self->expression.outr) {
3138         *out = self->expression.outr;
3139         return true;
3140     }
3141
3142     cgen = self->func->codegen;
3143     if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3144         return false;
3145     if (!funval)
3146         return false;
3147
3148     params = NULL;
3149
3150     /* parameters */
3151     for (i = 0; i < vec_size(self->params); ++i)
3152     {
3153         ir_value *param;
3154         ast_expression *expr = self->params[i];
3155
3156         cgen = expr->codegen;
3157         if (!(*cgen)(expr, func, false, &param))
3158             goto error;
3159         if (!param)
3160             goto error;
3161         vec_push(params, param);
3162     }
3163
3164     /* varargs counter */
3165     if (self->va_count) {
3166         ir_value   *va_count;
3167         ir_builder *builder = func->curblock->owner->owner;
3168         cgen = self->va_count->codegen;
3169         if (!(*cgen)((ast_expression*)(self->va_count), func, false, &va_count))
3170             return false;
3171         if (!ir_block_create_store_op(func->curblock, ast_ctx(self), INSTR_STORE_F,
3172                                       ir_builder_get_va_count(builder), va_count))
3173         {
3174             return false;
3175         }
3176     }
3177
3178     callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3179                                      ast_function_label(func, "call"),
3180                                      funval, !!(self->func->flags & AST_FLAG_NORETURN));
3181     if (!callinstr)
3182         goto error;
3183
3184     for (i = 0; i < vec_size(params); ++i) {
3185         ir_call_param(callinstr, params[i]);
3186     }
3187
3188     *out = ir_call_value(callinstr);
3189     self->expression.outr = *out;
3190
3191     codegen_output_type(self, *out);
3192
3193     vec_free(params);
3194     return true;
3195 error:
3196     vec_free(params);
3197     return false;
3198 }