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     if (count > self->expression.count) {
1216         compile_error(ast_ctx(self), "too many elements in initializer");
1217         count = self->expression.count;
1218     }
1219     else if (count < self->expression.count) {
1220         /* add this?
1221         compile_warning(ast_ctx(self), "not all elements are initialized");
1222         */
1223     }
1224
1225     for (i = 0; i != count; ++i) {
1226         switch (self->expression.next->vtype) {
1227             case TYPE_FLOAT:
1228                 if (!ir_value_set_float(self->ir_values[i], self->initlist[i].vfloat))
1229                     return false;
1230                 break;
1231             case TYPE_VECTOR:
1232                 if (!ir_value_set_vector(self->ir_values[i], self->initlist[i].vvec))
1233                     return false;
1234                 break;
1235             case TYPE_STRING:
1236                 if (!ir_value_set_string(self->ir_values[i], self->initlist[i].vstring))
1237                     return false;
1238                 break;
1239             case TYPE_ARRAY:
1240                 /* we don't support them in any other place yet either */
1241                 compile_error(ast_ctx(self), "TODO: nested arrays");
1242                 return false;
1243             case TYPE_FUNCTION:
1244                 /* this requiers a bit more work - similar to the fields I suppose */
1245                 compile_error(ast_ctx(self), "global of type function not properly generated");
1246                 return false;
1247             case TYPE_FIELD:
1248                 if (!self->initlist[i].vfield) {
1249                     compile_error(ast_ctx(self), "field constant without vfield set");
1250                     return false;
1251                 }
1252                 if (!self->initlist[i].vfield->ir_v) {
1253                     compile_error(ast_ctx(self), "field constant generated before its field");
1254                     return false;
1255                 }
1256                 if (!ir_value_set_field(self->ir_values[i], self->initlist[i].vfield->ir_v))
1257                     return false;
1258                 break;
1259             default:
1260                 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1261                 break;
1262         }
1263     }
1264     return true;
1265 }
1266
1267 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1268 {
1269     ir_value *v = NULL;
1270
1271     if (self->expression.vtype == TYPE_NIL) {
1272         compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1273         return false;
1274     }
1275
1276     if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1277     {
1278         ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->vtype);
1279         if (!func)
1280             return false;
1281         func->context = ast_ctx(self);
1282         func->value->context = ast_ctx(self);
1283
1284         self->constval.vfunc->ir_func = func;
1285         self->ir_v = func->value;
1286         if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1287             self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1288         /* The function is filled later on ast_function_codegen... */
1289         return true;
1290     }
1291
1292     if (isfield && self->expression.vtype == TYPE_FIELD) {
1293         ast_expression *fieldtype = self->expression.next;
1294
1295         if (self->hasvalue) {
1296             compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1297             goto error;
1298         }
1299
1300         if (fieldtype->vtype == TYPE_ARRAY) {
1301             size_t ai;
1302             char   *name;
1303             size_t  namelen;
1304
1305             ast_expression *elemtype;
1306             int             vtype;
1307             ast_value      *array = (ast_value*)fieldtype;
1308
1309             if (!ast_istype(fieldtype, ast_value)) {
1310                 compile_error(ast_ctx(self), "internal error: ast_value required");
1311                 return false;
1312             }
1313
1314             /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1315             if (!array->expression.count || array->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE))
1316                 compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1317
1318             elemtype = array->expression.next;
1319             vtype = elemtype->vtype;
1320
1321             v = ir_builder_create_field(ir, self->name, vtype);
1322             if (!v) {
1323                 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1324                 return false;
1325             }
1326             v->context = ast_ctx(self);
1327             v->unique_life = true;
1328             v->locked      = true;
1329             array->ir_v = self->ir_v = v;
1330             if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1331                 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1332
1333             namelen = strlen(self->name);
1334             name    = (char*)mem_a(namelen + 16);
1335             util_strncpy(name, self->name, namelen);
1336
1337             array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1338             array->ir_values[0] = v;
1339             for (ai = 1; ai < array->expression.count; ++ai) {
1340                 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1341                 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1342                 if (!array->ir_values[ai]) {
1343                     mem_d(name);
1344                     compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1345                     return false;
1346                 }
1347                 array->ir_values[ai]->context = ast_ctx(self);
1348                 array->ir_values[ai]->unique_life = true;
1349                 array->ir_values[ai]->locked      = true;
1350                 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1351                     self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1352             }
1353             mem_d(name);
1354         }
1355         else
1356         {
1357             v = ir_builder_create_field(ir, self->name, self->expression.next->vtype);
1358             if (!v)
1359                 return false;
1360             v->context = ast_ctx(self);
1361             self->ir_v = v;
1362             if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1363                 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1364         }
1365         return true;
1366     }
1367
1368     if (self->expression.vtype == TYPE_ARRAY) {
1369         size_t ai;
1370         char   *name;
1371         size_t  namelen;
1372
1373         ast_expression *elemtype = self->expression.next;
1374         int vtype = elemtype->vtype;
1375
1376         /* same as with field arrays */
1377         if (!self->expression.count || self->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE))
1378             compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1379
1380         v = ir_builder_create_global(ir, self->name, vtype);
1381         if (!v) {
1382             compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1383             return false;
1384         }
1385         v->context = ast_ctx(self);
1386         v->unique_life = true;
1387         v->locked      = true;
1388         if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1389             v->flags |= IR_FLAG_INCLUDE_DEF;
1390
1391         namelen = strlen(self->name);
1392         name    = (char*)mem_a(namelen + 16);
1393         util_strncpy(name, self->name, namelen);
1394
1395         self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1396         self->ir_values[0] = v;
1397         for (ai = 1; ai < self->expression.count; ++ai) {
1398             util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1399             self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1400             if (!self->ir_values[ai]) {
1401                 mem_d(name);
1402                 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1403                 return false;
1404             }
1405             self->ir_values[ai]->context = ast_ctx(self);
1406             self->ir_values[ai]->unique_life = true;
1407             self->ir_values[ai]->locked      = true;
1408             if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1409                 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1410         }
1411         mem_d(name);
1412     }
1413     else
1414     {
1415         /* Arrays don't do this since there's no "array" value which spans across the
1416          * whole thing.
1417          */
1418         v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1419         if (!v) {
1420             compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1421             return false;
1422         }
1423         codegen_output_type(self, v);
1424         v->context = ast_ctx(self);
1425     }
1426
1427     /* link us to the ir_value */
1428     v->cvq = self->cvq;
1429     self->ir_v = v;
1430     if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1431         self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1432
1433     /* initialize */
1434     if (self->hasvalue) {
1435         switch (self->expression.vtype)
1436         {
1437             case TYPE_FLOAT:
1438                 if (!ir_value_set_float(v, self->constval.vfloat))
1439                     goto error;
1440                 break;
1441             case TYPE_VECTOR:
1442                 if (!ir_value_set_vector(v, self->constval.vvec))
1443                     goto error;
1444                 break;
1445             case TYPE_STRING:
1446                 if (!ir_value_set_string(v, self->constval.vstring))
1447                     goto error;
1448                 break;
1449             case TYPE_ARRAY:
1450                 ast_global_array_set(self);
1451                 break;
1452             case TYPE_FUNCTION:
1453                 compile_error(ast_ctx(self), "global of type function not properly generated");
1454                 goto error;
1455                 /* Cannot generate an IR value for a function,
1456                  * need a pointer pointing to a function rather.
1457                  */
1458             case TYPE_FIELD:
1459                 if (!self->constval.vfield) {
1460                     compile_error(ast_ctx(self), "field constant without vfield set");
1461                     goto error;
1462                 }
1463                 if (!self->constval.vfield->ir_v) {
1464                     compile_error(ast_ctx(self), "field constant generated before its field");
1465                     goto error;
1466                 }
1467                 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1468                     goto error;
1469                 break;
1470             default:
1471                 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1472                 break;
1473         }
1474     }
1475     return true;
1476
1477 error: /* clean up */
1478     ir_value_delete(v);
1479     return false;
1480 }
1481
1482 static bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1483 {
1484     ir_value *v = NULL;
1485
1486     if (self->expression.vtype == TYPE_NIL) {
1487         compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1488         return false;
1489     }
1490
1491     if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1492     {
1493         /* Do we allow local functions? I think not...
1494          * this is NOT a function pointer atm.
1495          */
1496         return false;
1497     }
1498
1499     if (self->expression.vtype == TYPE_ARRAY) {
1500         size_t ai;
1501         char   *name;
1502         size_t  namelen;
1503
1504         ast_expression *elemtype = self->expression.next;
1505         int vtype = elemtype->vtype;
1506
1507         func->flags |= IR_FLAG_HAS_ARRAYS;
1508
1509         if (param && !(self->expression.flags & AST_FLAG_IS_VARARG)) {
1510             compile_error(ast_ctx(self), "array-parameters are not supported");
1511             return false;
1512         }
1513
1514         /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1515         if (!self->expression.count || self->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE)) {
1516             compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)self->expression.count);
1517         }
1518
1519         self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1520         if (!self->ir_values) {
1521             compile_error(ast_ctx(self), "failed to allocate array values");
1522             return false;
1523         }
1524
1525         v = ir_function_create_local(func, self->name, vtype, param);
1526         if (!v) {
1527             compile_error(ast_ctx(self), "internal error: ir_function_create_local failed");
1528             return false;
1529         }
1530         v->context = ast_ctx(self);
1531         v->unique_life = true;
1532         v->locked      = true;
1533
1534         namelen = strlen(self->name);
1535         name    = (char*)mem_a(namelen + 16);
1536         util_strncpy(name, self->name, namelen);
1537
1538         self->ir_values[0] = v;
1539         for (ai = 1; ai < self->expression.count; ++ai) {
1540             util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1541             self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1542             if (!self->ir_values[ai]) {
1543                 compile_error(ast_ctx(self), "internal_error: ir_builder_create_global failed on `%s`", name);
1544                 return false;
1545             }
1546             self->ir_values[ai]->context = ast_ctx(self);
1547             self->ir_values[ai]->unique_life = true;
1548             self->ir_values[ai]->locked      = true;
1549         }
1550         mem_d(name);
1551     }
1552     else
1553     {
1554         v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1555         if (!v)
1556             return false;
1557         codegen_output_type(self, v);
1558         v->context = ast_ctx(self);
1559     }
1560
1561     /* A constant local... hmmm...
1562      * I suppose the IR will have to deal with this
1563      */
1564     if (self->hasvalue) {
1565         switch (self->expression.vtype)
1566         {
1567             case TYPE_FLOAT:
1568                 if (!ir_value_set_float(v, self->constval.vfloat))
1569                     goto error;
1570                 break;
1571             case TYPE_VECTOR:
1572                 if (!ir_value_set_vector(v, self->constval.vvec))
1573                     goto error;
1574                 break;
1575             case TYPE_STRING:
1576                 if (!ir_value_set_string(v, self->constval.vstring))
1577                     goto error;
1578                 break;
1579             default:
1580                 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1581                 break;
1582         }
1583     }
1584
1585     /* link us to the ir_value */
1586     v->cvq = self->cvq;
1587     self->ir_v = v;
1588
1589     if (!ast_generate_accessors(self, func->owner))
1590         return false;
1591     return true;
1592
1593 error: /* clean up */
1594     ir_value_delete(v);
1595     return false;
1596 }
1597
1598 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1599 {
1600     size_t i;
1601     bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1602     if (!self->setter || !self->getter)
1603         return true;
1604     for (i = 0; i < self->expression.count; ++i) {
1605         if (!self->ir_values) {
1606             compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1607             return false;
1608         }
1609         if (!self->ir_values[i]) {
1610             compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1611             return false;
1612         }
1613         if (self->ir_values[i]->life) {
1614             compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1615             return false;
1616         }
1617     }
1618
1619     opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1620     if (self->setter) {
1621         if (!ast_global_codegen  (self->setter, ir, false) ||
1622             !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1623             !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1624         {
1625             compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1626             opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1627             return false;
1628         }
1629     }
1630     if (self->getter) {
1631         if (!ast_global_codegen  (self->getter, ir, false) ||
1632             !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1633             !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1634         {
1635             compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1636             opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1637             return false;
1638         }
1639     }
1640     for (i = 0; i < self->expression.count; ++i) {
1641         vec_free(self->ir_values[i]->life);
1642     }
1643     opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1644     return true;
1645 }
1646
1647 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1648 {
1649     ir_function *irf;
1650     ir_value    *dummy;
1651     ast_expression         *ec;
1652     ast_expression_codegen *cgen;
1653     size_t    i;
1654
1655     (void)ir;
1656
1657     irf = self->ir_func;
1658     if (!irf) {
1659         compile_error(ast_ctx(self), "internal error: ast_function's related ast_value was not generated yet");
1660         return false;
1661     }
1662
1663     /* fill the parameter list */
1664     ec = &self->vtype->expression;
1665     for (i = 0; i < vec_size(ec->params); ++i)
1666     {
1667         if (ec->params[i]->expression.vtype == TYPE_FIELD)
1668             vec_push(irf->params, ec->params[i]->expression.next->vtype);
1669         else
1670             vec_push(irf->params, ec->params[i]->expression.vtype);
1671         if (!self->builtin) {
1672             if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1673                 return false;
1674         }
1675     }
1676
1677     if (self->varargs) {
1678         if (!ast_local_codegen(self->varargs, self->ir_func, true))
1679             return false;
1680         irf->max_varargs = self->varargs->expression.count;
1681     }
1682
1683     if (self->builtin) {
1684         irf->builtin = self->builtin;
1685         return true;
1686     }
1687
1688     /* have a local return value variable? */
1689     if (self->return_value) {
1690         if (!ast_local_codegen(self->return_value, self->ir_func, false))
1691             return false;
1692     }
1693
1694     if (!vec_size(self->blocks)) {
1695         compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1696         return false;
1697     }
1698
1699     irf->first = self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1700     if (!self->curblock) {
1701         compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1702         return false;
1703     }
1704
1705     if (self->argc) {
1706         ir_value *va_count;
1707         ir_value *fixed;
1708         ir_value *sub;
1709         if (!ast_local_codegen(self->argc, self->ir_func, true))
1710             return false;
1711         cgen = self->argc->expression.codegen;
1712         if (!(*cgen)((ast_expression*)(self->argc), self, false, &va_count))
1713             return false;
1714         cgen = self->fixedparams->expression.codegen;
1715         if (!(*cgen)((ast_expression*)(self->fixedparams), self, false, &fixed))
1716             return false;
1717         sub = ir_block_create_binop(self->curblock, ast_ctx(self),
1718                                     ast_function_label(self, "va_count"), INSTR_SUB_F,
1719                                     ir_builder_get_va_count(ir), fixed);
1720         if (!sub)
1721             return false;
1722         if (!ir_block_create_store_op(self->curblock, ast_ctx(self), INSTR_STORE_F,
1723                                       va_count, sub))
1724         {
1725             return false;
1726         }
1727     }
1728
1729     for (i = 0; i < vec_size(self->blocks); ++i) {
1730         cgen = self->blocks[i]->expression.codegen;
1731         if (!(*cgen)((ast_expression*)self->blocks[i], self, false, &dummy))
1732             return false;
1733     }
1734
1735     /* TODO: check return types */
1736     if (!self->curblock->final)
1737     {
1738         if (!self->vtype->expression.next ||
1739             self->vtype->expression.next->vtype == TYPE_VOID)
1740         {
1741             return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1742         }
1743         else if (vec_size(self->curblock->entries) || self->curblock == irf->first)
1744         {
1745             if (self->return_value) {
1746                 cgen = self->return_value->expression.codegen;
1747                 if (!(*cgen)((ast_expression*)(self->return_value), self, false, &dummy))
1748                     return false;
1749                 return ir_block_create_return(self->curblock, ast_ctx(self), dummy);
1750             }
1751             else if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1752                                 "control reaches end of non-void function (`%s`) via %s",
1753                                 self->name, self->curblock->label))
1754             {
1755                 return false;
1756             }
1757             return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1758         }
1759     }
1760     return true;
1761 }
1762
1763 /* Note, you will not see ast_block_codegen generate ir_blocks.
1764  * To the AST and the IR, blocks are 2 different things.
1765  * In the AST it represents a block of code, usually enclosed in
1766  * curly braces {...}.
1767  * While in the IR it represents a block in terms of control-flow.
1768  */
1769 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1770 {
1771     size_t i;
1772
1773     /* We don't use this
1774      * Note: an ast-representation using the comma-operator
1775      * of the form: (a, b, c) = x should not assign to c...
1776      */
1777     if (lvalue) {
1778         compile_error(ast_ctx(self), "not an l-value (code-block)");
1779         return false;
1780     }
1781
1782     if (self->expression.outr) {
1783         *out = self->expression.outr;
1784         return true;
1785     }
1786
1787     /* output is NULL at first, we'll have each expression
1788      * assign to out output, thus, a comma-operator represention
1789      * using an ast_block will return the last generated value,
1790      * so: (b, c) + a  executed both b and c, and returns c,
1791      * which is then added to a.
1792      */
1793     *out = NULL;
1794
1795     /* generate locals */
1796     for (i = 0; i < vec_size(self->locals); ++i)
1797     {
1798         if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1799             if (OPTS_OPTION_BOOL(OPTION_DEBUG))
1800                 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1801             return false;
1802         }
1803     }
1804
1805     for (i = 0; i < vec_size(self->exprs); ++i)
1806     {
1807         ast_expression_codegen *gen;
1808         if (func->curblock->final && !ast_istype(self->exprs[i], ast_label)) {
1809             if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1810                 return false;
1811             continue;
1812         }
1813         gen = self->exprs[i]->codegen;
1814         if (!(*gen)(self->exprs[i], func, false, out))
1815             return false;
1816     }
1817
1818     self->expression.outr = *out;
1819
1820     return true;
1821 }
1822
1823 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1824 {
1825     ast_expression_codegen *cgen;
1826     ir_value *left  = NULL;
1827     ir_value *right = NULL;
1828
1829     ast_value       *arr;
1830     ast_value       *idx = 0;
1831     ast_array_index *ai = NULL;
1832
1833     if (lvalue && self->expression.outl) {
1834         *out = self->expression.outl;
1835         return true;
1836     }
1837
1838     if (!lvalue && self->expression.outr) {
1839         *out = self->expression.outr;
1840         return true;
1841     }
1842
1843     if (ast_istype(self->dest, ast_array_index))
1844     {
1845
1846         ai = (ast_array_index*)self->dest;
1847         idx = (ast_value*)ai->index;
1848
1849         if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
1850             ai = NULL;
1851     }
1852
1853     if (ai) {
1854         /* we need to call the setter */
1855         ir_value  *iridx, *funval;
1856         ir_instr  *call;
1857
1858         if (lvalue) {
1859             compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
1860             return false;
1861         }
1862
1863         arr = (ast_value*)ai->array;
1864         if (!ast_istype(ai->array, ast_value) || !arr->setter) {
1865             compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
1866             return false;
1867         }
1868
1869         cgen = idx->expression.codegen;
1870         if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
1871             return false;
1872
1873         cgen = arr->setter->expression.codegen;
1874         if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
1875             return false;
1876
1877         cgen = self->source->codegen;
1878         if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1879             return false;
1880
1881         call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
1882         if (!call)
1883             return false;
1884         ir_call_param(call, iridx);
1885         ir_call_param(call, right);
1886         self->expression.outr = right;
1887     }
1888     else
1889     {
1890         /* regular code */
1891
1892         cgen = self->dest->codegen;
1893         /* lvalue! */
1894         if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1895             return false;
1896         self->expression.outl = left;
1897
1898         cgen = self->source->codegen;
1899         /* rvalue! */
1900         if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1901             return false;
1902
1903         if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
1904             return false;
1905         self->expression.outr = right;
1906     }
1907
1908     /* Theoretically, an assinment returns its left side as an
1909      * lvalue, if we don't need an lvalue though, we return
1910      * the right side as an rvalue, otherwise we have to
1911      * somehow know whether or not we need to dereference the pointer
1912      * on the left side - that is: OP_LOAD if it was an address.
1913      * Also: in original QC we cannot OP_LOADP *anyway*.
1914      */
1915     *out = (lvalue ? left : right);
1916
1917     return true;
1918 }
1919
1920 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1921 {
1922     ast_expression_codegen *cgen;
1923     ir_value *left, *right;
1924
1925     /* A binary operation cannot yield an l-value */
1926     if (lvalue) {
1927         compile_error(ast_ctx(self), "not an l-value (binop)");
1928         return false;
1929     }
1930
1931     if (self->expression.outr) {
1932         *out = self->expression.outr;
1933         return true;
1934     }
1935
1936     if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
1937         (self->op == INSTR_AND || self->op == INSTR_OR))
1938     {
1939         /* short circuit evaluation */
1940         ir_block *other, *merge;
1941         ir_block *from_left, *from_right;
1942         ir_instr *phi;
1943         size_t    merge_id;
1944
1945         /* prepare end-block */
1946         merge_id = vec_size(func->ir_func->blocks);
1947         merge    = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
1948
1949         /* generate the left expression */
1950         cgen = self->left->codegen;
1951         if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1952             return false;
1953         /* remember the block */
1954         from_left = func->curblock;
1955
1956         /* create a new block for the right expression */
1957         other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
1958         if (self->op == INSTR_AND) {
1959             /* on AND: left==true -> other */
1960             if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
1961                 return false;
1962         } else {
1963             /* on OR: left==false -> other */
1964             if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
1965                 return false;
1966         }
1967         /* use the likely flag */
1968         vec_last(func->curblock->instr)->likely = true;
1969
1970         /* enter the right-expression's block */
1971         func->curblock = other;
1972         /* generate */
1973         cgen = self->right->codegen;
1974         if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1975             return false;
1976         /* remember block */
1977         from_right = func->curblock;
1978
1979         /* jump to the merge block */
1980         if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
1981             return false;
1982
1983         vec_remove(func->ir_func->blocks, merge_id, 1);
1984         vec_push(func->ir_func->blocks, merge);
1985
1986         func->curblock = merge;
1987         phi = ir_block_create_phi(func->curblock, ast_ctx(self),
1988                                   ast_function_label(func, "sce_value"),
1989                                   self->expression.vtype);
1990         ir_phi_add(phi, from_left, left);
1991         ir_phi_add(phi, from_right, right);
1992         *out = ir_phi_value(phi);
1993         if (!*out)
1994             return false;
1995
1996         if (!OPTS_FLAG(PERL_LOGIC)) {
1997             /* cast-to-bool */
1998             if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
1999                 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2000                                              ast_function_label(func, "sce_bool_v"),
2001                                              INSTR_NOT_V, *out);
2002                 if (!*out)
2003                     return false;
2004                 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2005                                              ast_function_label(func, "sce_bool"),
2006                                              INSTR_NOT_F, *out);
2007                 if (!*out)
2008                     return false;
2009             }
2010             else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
2011                 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2012                                              ast_function_label(func, "sce_bool_s"),
2013                                              INSTR_NOT_S, *out);
2014                 if (!*out)
2015                     return false;
2016                 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2017                                              ast_function_label(func, "sce_bool"),
2018                                              INSTR_NOT_F, *out);
2019                 if (!*out)
2020                     return false;
2021             }
2022             else {
2023                 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
2024                                              ast_function_label(func, "sce_bool"),
2025                                              INSTR_AND, *out, *out);
2026                 if (!*out)
2027                     return false;
2028             }
2029         }
2030
2031         self->expression.outr = *out;
2032         codegen_output_type(self, *out);
2033         return true;
2034     }
2035
2036     cgen = self->left->codegen;
2037     if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2038         return false;
2039
2040     cgen = self->right->codegen;
2041     if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2042         return false;
2043
2044     *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
2045                                  self->op, left, right);
2046     if (!*out)
2047         return false;
2048     self->expression.outr = *out;
2049     codegen_output_type(self, *out);
2050
2051     return true;
2052 }
2053
2054 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
2055 {
2056     ast_expression_codegen *cgen;
2057     ir_value *leftl = NULL, *leftr, *right, *bin;
2058
2059     ast_value       *arr;
2060     ast_value       *idx = 0;
2061     ast_array_index *ai = NULL;
2062     ir_value        *iridx = NULL;
2063
2064     if (lvalue && self->expression.outl) {
2065         *out = self->expression.outl;
2066         return true;
2067     }
2068
2069     if (!lvalue && self->expression.outr) {
2070         *out = self->expression.outr;
2071         return true;
2072     }
2073
2074     if (ast_istype(self->dest, ast_array_index))
2075     {
2076
2077         ai = (ast_array_index*)self->dest;
2078         idx = (ast_value*)ai->index;
2079
2080         if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
2081             ai = NULL;
2082     }
2083
2084     /* for a binstore we need both an lvalue and an rvalue for the left side */
2085     /* rvalue of destination! */
2086     if (ai) {
2087         cgen = idx->expression.codegen;
2088         if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2089             return false;
2090     }
2091     cgen = self->dest->codegen;
2092     if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
2093         return false;
2094
2095     /* source as rvalue only */
2096     cgen = self->source->codegen;
2097     if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2098         return false;
2099
2100     /* now the binary */
2101     bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
2102                                 self->opbin, leftr, right);
2103     self->expression.outr = bin;
2104
2105
2106     if (ai) {
2107         /* we need to call the setter */
2108         ir_value  *funval;
2109         ir_instr  *call;
2110
2111         if (lvalue) {
2112             compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2113             return false;
2114         }
2115
2116         arr = (ast_value*)ai->array;
2117         if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2118             compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2119             return false;
2120         }
2121
2122         cgen = arr->setter->expression.codegen;
2123         if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2124             return false;
2125
2126         call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2127         if (!call)
2128             return false;
2129         ir_call_param(call, iridx);
2130         ir_call_param(call, bin);
2131         self->expression.outr = bin;
2132     } else {
2133         /* now store them */
2134         cgen = self->dest->codegen;
2135         /* lvalue of destination */
2136         if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2137             return false;
2138         self->expression.outl = leftl;
2139
2140         if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2141             return false;
2142         self->expression.outr = bin;
2143     }
2144
2145     /* Theoretically, an assinment returns its left side as an
2146      * lvalue, if we don't need an lvalue though, we return
2147      * the right side as an rvalue, otherwise we have to
2148      * somehow know whether or not we need to dereference the pointer
2149      * on the left side - that is: OP_LOAD if it was an address.
2150      * Also: in original QC we cannot OP_LOADP *anyway*.
2151      */
2152     *out = (lvalue ? leftl : bin);
2153
2154     return true;
2155 }
2156
2157 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2158 {
2159     ast_expression_codegen *cgen;
2160     ir_value *operand;
2161
2162     /* An unary operation cannot yield an l-value */
2163     if (lvalue) {
2164         compile_error(ast_ctx(self), "not an l-value (binop)");
2165         return false;
2166     }
2167
2168     if (self->expression.outr) {
2169         *out = self->expression.outr;
2170         return true;
2171     }
2172
2173     cgen = self->operand->codegen;
2174     /* lvalue! */
2175     if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2176         return false;
2177
2178     *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2179                                  self->op, operand);
2180     if (!*out)
2181         return false;
2182     self->expression.outr = *out;
2183
2184     return true;
2185 }
2186
2187 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2188 {
2189     ast_expression_codegen *cgen;
2190     ir_value *operand;
2191
2192     *out = NULL;
2193
2194     /* In the context of a return operation, we don't actually return
2195      * anything...
2196      */
2197     if (lvalue) {
2198         compile_error(ast_ctx(self), "return-expression is not an l-value");
2199         return false;
2200     }
2201
2202     if (self->expression.outr) {
2203         compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2204         return false;
2205     }
2206     self->expression.outr = (ir_value*)1;
2207
2208     if (self->operand) {
2209         cgen = self->operand->codegen;
2210         /* lvalue! */
2211         if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2212             return false;
2213
2214         if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2215             return false;
2216     } else {
2217         if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2218             return false;
2219     }
2220
2221     return true;
2222 }
2223
2224 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2225 {
2226     ast_expression_codegen *cgen;
2227     ir_value *ent, *field;
2228
2229     /* This function needs to take the 'lvalue' flag into account!
2230      * As lvalue we provide a field-pointer, as rvalue we provide the
2231      * value in a temp.
2232      */
2233
2234     if (lvalue && self->expression.outl) {
2235         *out = self->expression.outl;
2236         return true;
2237     }
2238
2239     if (!lvalue && self->expression.outr) {
2240         *out = self->expression.outr;
2241         return true;
2242     }
2243
2244     cgen = self->entity->codegen;
2245     if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2246         return false;
2247
2248     cgen = self->field->codegen;
2249     if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2250         return false;
2251
2252     if (lvalue) {
2253         /* address! */
2254         *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2255                                             ent, field);
2256     } else {
2257         *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2258                                              ent, field, self->expression.vtype);
2259         /* Done AFTER error checking:
2260         codegen_output_type(self, *out);
2261         */
2262     }
2263     if (!*out) {
2264         compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2265                  (lvalue ? "ADDRESS" : "FIELD"),
2266                  type_name[self->expression.vtype]);
2267         return false;
2268     }
2269     if (!lvalue)
2270         codegen_output_type(self, *out);
2271
2272     if (lvalue)
2273         self->expression.outl = *out;
2274     else
2275         self->expression.outr = *out;
2276
2277     /* Hm that should be it... */
2278     return true;
2279 }
2280
2281 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2282 {
2283     ast_expression_codegen *cgen;
2284     ir_value *vec;
2285
2286     /* in QC this is always an lvalue */
2287     if (lvalue && self->rvalue) {
2288         compile_error(ast_ctx(self), "not an l-value (member access)");
2289         return false;
2290     }
2291     if (self->expression.outl) {
2292         *out = self->expression.outl;
2293         return true;
2294     }
2295
2296     cgen = self->owner->codegen;
2297     if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2298         return false;
2299
2300     if (vec->vtype != TYPE_VECTOR &&
2301         !(vec->vtype == TYPE_FIELD && self->owner->next->vtype == TYPE_VECTOR))
2302     {
2303         return false;
2304     }
2305
2306     *out = ir_value_vector_member(vec, self->field);
2307     self->expression.outl = *out;
2308
2309     return (*out != NULL);
2310 }
2311
2312 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2313 {
2314     ast_value *arr;
2315     ast_value *idx;
2316
2317     if (!lvalue && self->expression.outr) {
2318         *out = self->expression.outr;
2319         return true;
2320     }
2321     if (lvalue && self->expression.outl) {
2322         *out = self->expression.outl;
2323         return true;
2324     }
2325
2326     if (!ast_istype(self->array, ast_value)) {
2327         compile_error(ast_ctx(self), "array indexing this way is not supported");
2328         /* note this would actually be pointer indexing because the left side is
2329          * not an actual array but (hopefully) an indexable expression.
2330          * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2331          * support this path will be filled.
2332          */
2333         return false;
2334     }
2335
2336     arr = (ast_value*)self->array;
2337     idx = (ast_value*)self->index;
2338
2339     if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2340         /* Time to use accessor functions */
2341         ast_expression_codegen *cgen;
2342         ir_value               *iridx, *funval;
2343         ir_instr               *call;
2344
2345         if (lvalue) {
2346             compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2347             return false;
2348         }
2349
2350         if (!arr->getter) {
2351             compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2352             return false;
2353         }
2354
2355         cgen = self->index->codegen;
2356         if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2357             return false;
2358
2359         cgen = arr->getter->expression.codegen;
2360         if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2361             return false;
2362
2363         call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2364         if (!call)
2365             return false;
2366         ir_call_param(call, iridx);
2367
2368         *out = ir_call_value(call);
2369         self->expression.outr = *out;
2370         (*out)->vtype = self->expression.vtype;
2371         codegen_output_type(self, *out);
2372         return true;
2373     }
2374
2375     if (idx->expression.vtype == TYPE_FLOAT) {
2376         unsigned int arridx = idx->constval.vfloat;
2377         if (arridx >= self->array->count)
2378         {
2379             compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2380             return false;
2381         }
2382         *out = arr->ir_values[arridx];
2383     }
2384     else if (idx->expression.vtype == TYPE_INTEGER) {
2385         unsigned int arridx = idx->constval.vint;
2386         if (arridx >= self->array->count)
2387         {
2388             compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2389             return false;
2390         }
2391         *out = arr->ir_values[arridx];
2392     }
2393     else {
2394         compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2395         return false;
2396     }
2397     (*out)->vtype = self->expression.vtype;
2398     codegen_output_type(self, *out);
2399     return true;
2400 }
2401
2402 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2403 {
2404     ast_expression_codegen *cgen;
2405
2406     ir_value *condval;
2407     ir_value *dummy;
2408
2409     ir_block *cond;
2410     ir_block *ontrue;
2411     ir_block *onfalse;
2412     ir_block *ontrue_endblock = NULL;
2413     ir_block *onfalse_endblock = NULL;
2414     ir_block *merge = NULL;
2415
2416     /* We don't output any value, thus also don't care about r/lvalue */
2417     (void)out;
2418     (void)lvalue;
2419
2420     if (self->expression.outr) {
2421         compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2422         return false;
2423     }
2424     self->expression.outr = (ir_value*)1;
2425
2426     /* generate the condition */
2427     cgen = self->cond->codegen;
2428     if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2429         return false;
2430     /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2431     cond = func->curblock;
2432
2433     /* on-true path */
2434
2435     if (self->on_true) {
2436         /* create on-true block */
2437         ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2438         if (!ontrue)
2439             return false;
2440
2441         /* enter the block */
2442         func->curblock = ontrue;
2443
2444         /* generate */
2445         cgen = self->on_true->codegen;
2446         if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2447             return false;
2448
2449         /* we now need to work from the current endpoint */
2450         ontrue_endblock = func->curblock;
2451     } else
2452         ontrue = NULL;
2453
2454     /* on-false path */
2455     if (self->on_false) {
2456         /* create on-false block */
2457         onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2458         if (!onfalse)
2459             return false;
2460
2461         /* enter the block */
2462         func->curblock = onfalse;
2463
2464         /* generate */
2465         cgen = self->on_false->codegen;
2466         if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2467             return false;
2468
2469         /* we now need to work from the current endpoint */
2470         onfalse_endblock = func->curblock;
2471     } else
2472         onfalse = NULL;
2473
2474     /* Merge block were they all merge in to */
2475     if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2476     {
2477         merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2478         if (!merge)
2479             return false;
2480         /* add jumps ot the merge block */
2481         if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2482             return false;
2483         if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2484             return false;
2485
2486         /* Now enter the merge block */
2487         func->curblock = merge;
2488     }
2489
2490     /* we create the if here, that way all blocks are ordered :)
2491      */
2492     if (!ir_block_create_if(cond, ast_ctx(self), condval,
2493                             (ontrue  ? ontrue  : merge),
2494                             (onfalse ? onfalse : merge)))
2495     {
2496         return false;
2497     }
2498
2499     return true;
2500 }
2501
2502 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2503 {
2504     ast_expression_codegen *cgen;
2505
2506     ir_value *condval;
2507     ir_value *trueval, *falseval;
2508     ir_instr *phi;
2509
2510     ir_block *cond = func->curblock;
2511     ir_block *cond_out = NULL;
2512     ir_block *ontrue, *ontrue_out = NULL;
2513     ir_block *onfalse, *onfalse_out = NULL;
2514     ir_block *merge;
2515
2516     /* Ternary can never create an lvalue... */
2517     if (lvalue)
2518         return false;
2519
2520     /* In theory it shouldn't be possible to pass through a node twice, but
2521      * in case we add any kind of optimization pass for the AST itself, it
2522      * may still happen, thus we remember a created ir_value and simply return one
2523      * if it already exists.
2524      */
2525     if (self->expression.outr) {
2526         *out = self->expression.outr;
2527         return true;
2528     }
2529
2530     /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2531
2532     /* generate the condition */
2533     func->curblock = cond;
2534     cgen = self->cond->codegen;
2535     if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2536         return false;
2537     cond_out = func->curblock;
2538
2539     /* create on-true block */
2540     ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2541     if (!ontrue)
2542         return false;
2543     else
2544     {
2545         /* enter the block */
2546         func->curblock = ontrue;
2547
2548         /* generate */
2549         cgen = self->on_true->codegen;
2550         if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2551             return false;
2552
2553         ontrue_out = func->curblock;
2554     }
2555
2556     /* create on-false block */
2557     onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2558     if (!onfalse)
2559         return false;
2560     else
2561     {
2562         /* enter the block */
2563         func->curblock = onfalse;
2564
2565         /* generate */
2566         cgen = self->on_false->codegen;
2567         if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2568             return false;
2569
2570         onfalse_out = func->curblock;
2571     }
2572
2573     /* create merge block */
2574     merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2575     if (!merge)
2576         return false;
2577     /* jump to merge block */
2578     if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2579         return false;
2580     if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2581         return false;
2582
2583     /* create if instruction */
2584     if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2585         return false;
2586
2587     /* Now enter the merge block */
2588     func->curblock = merge;
2589
2590     /* Here, now, we need a PHI node
2591      * but first some sanity checking...
2592      */
2593     if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2594         /* error("ternary with different types on the two sides"); */
2595         compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2596         return false;
2597     }
2598
2599     /* create PHI */
2600     phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->expression.vtype);
2601     if (!phi) {
2602         compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2603         return false;
2604     }
2605     ir_phi_add(phi, ontrue_out,  trueval);
2606     ir_phi_add(phi, onfalse_out, falseval);
2607
2608     self->expression.outr = ir_phi_value(phi);
2609     *out = self->expression.outr;
2610
2611     codegen_output_type(self, *out);
2612
2613     return true;
2614 }
2615
2616 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2617 {
2618     ast_expression_codegen *cgen;
2619
2620     ir_value *dummy      = NULL;
2621     ir_value *precond    = NULL;
2622     ir_value *postcond   = NULL;
2623
2624     /* Since we insert some jumps "late" so we have blocks
2625      * ordered "nicely", we need to keep track of the actual end-blocks
2626      * of expressions to add the jumps to.
2627      */
2628     ir_block *bbody      = NULL, *end_bbody      = NULL;
2629     ir_block *bprecond   = NULL, *end_bprecond   = NULL;
2630     ir_block *bpostcond  = NULL, *end_bpostcond  = NULL;
2631     ir_block *bincrement = NULL, *end_bincrement = NULL;
2632     ir_block *bout       = NULL, *bin            = NULL;
2633
2634     /* let's at least move the outgoing block to the end */
2635     size_t    bout_id;
2636
2637     /* 'break' and 'continue' need to be able to find the right blocks */
2638     ir_block *bcontinue     = NULL;
2639     ir_block *bbreak        = NULL;
2640
2641     ir_block *tmpblock      = NULL;
2642
2643     (void)lvalue;
2644     (void)out;
2645
2646     if (self->expression.outr) {
2647         compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2648         return false;
2649     }
2650     self->expression.outr = (ir_value*)1;
2651
2652     /* NOTE:
2653      * Should we ever need some kind of block ordering, better make this function
2654      * move blocks around than write a block ordering algorithm later... after all
2655      * the ast and ir should work together, not against each other.
2656      */
2657
2658     /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2659      * anyway if for example it contains a ternary.
2660      */
2661     if (self->initexpr)
2662     {
2663         cgen = self->initexpr->codegen;
2664         if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2665             return false;
2666     }
2667
2668     /* Store the block from which we enter this chaos */
2669     bin = func->curblock;
2670
2671     /* The pre-loop condition needs its own block since we
2672      * need to be able to jump to the start of that expression.
2673      */
2674     if (self->precond)
2675     {
2676         bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2677         if (!bprecond)
2678             return false;
2679
2680         /* the pre-loop-condition the least important place to 'continue' at */
2681         bcontinue = bprecond;
2682
2683         /* enter */
2684         func->curblock = bprecond;
2685
2686         /* generate */
2687         cgen = self->precond->codegen;
2688         if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2689             return false;
2690
2691         end_bprecond = func->curblock;
2692     } else {
2693         bprecond = end_bprecond = NULL;
2694     }
2695
2696     /* Now the next blocks won't be ordered nicely, but we need to
2697      * generate them this early for 'break' and 'continue'.
2698      */
2699     if (self->increment) {
2700         bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2701         if (!bincrement)
2702             return false;
2703         bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2704     } else {
2705         bincrement = end_bincrement = NULL;
2706     }
2707
2708     if (self->postcond) {
2709         bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2710         if (!bpostcond)
2711             return false;
2712         bcontinue = bpostcond; /* postcond comes before the increment */
2713     } else {
2714         bpostcond = end_bpostcond = NULL;
2715     }
2716
2717     bout_id = vec_size(func->ir_func->blocks);
2718     bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2719     if (!bout)
2720         return false;
2721     bbreak = bout;
2722
2723     /* The loop body... */
2724     /* if (self->body) */
2725     {
2726         bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2727         if (!bbody)
2728             return false;
2729
2730         /* enter */
2731         func->curblock = bbody;
2732
2733         vec_push(func->breakblocks,    bbreak);
2734         if (bcontinue)
2735             vec_push(func->continueblocks, bcontinue);
2736         else
2737             vec_push(func->continueblocks, bbody);
2738
2739         /* generate */
2740         if (self->body) {
2741             cgen = self->body->codegen;
2742             if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2743                 return false;
2744         }
2745
2746         end_bbody = func->curblock;
2747         vec_pop(func->breakblocks);
2748         vec_pop(func->continueblocks);
2749     }
2750
2751     /* post-loop-condition */
2752     if (self->postcond)
2753     {
2754         /* enter */
2755         func->curblock = bpostcond;
2756
2757         /* generate */
2758         cgen = self->postcond->codegen;
2759         if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2760             return false;
2761
2762         end_bpostcond = func->curblock;
2763     }
2764
2765     /* The incrementor */
2766     if (self->increment)
2767     {
2768         /* enter */
2769         func->curblock = bincrement;
2770
2771         /* generate */
2772         cgen = self->increment->codegen;
2773         if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2774             return false;
2775
2776         end_bincrement = func->curblock;
2777     }
2778
2779     /* In any case now, we continue from the outgoing block */
2780     func->curblock = bout;
2781
2782     /* Now all blocks are in place */
2783     /* From 'bin' we jump to whatever comes first */
2784     if      (bprecond)   tmpblock = bprecond;
2785     else if (bbody)      tmpblock = bbody;
2786     else if (bpostcond)  tmpblock = bpostcond;
2787     else                 tmpblock = bout;
2788     if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2789         return false;
2790
2791     /* From precond */
2792     if (bprecond)
2793     {
2794         ir_block *ontrue, *onfalse;
2795         if      (bbody)      ontrue = bbody;
2796         else if (bincrement) ontrue = bincrement;
2797         else if (bpostcond)  ontrue = bpostcond;
2798         else                 ontrue = bprecond;
2799         onfalse = bout;
2800         if (self->pre_not) {
2801             tmpblock = ontrue;
2802             ontrue   = onfalse;
2803             onfalse  = tmpblock;
2804         }
2805         if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2806             return false;
2807     }
2808
2809     /* from body */
2810     if (bbody)
2811     {
2812         if      (bincrement) tmpblock = bincrement;
2813         else if (bpostcond)  tmpblock = bpostcond;
2814         else if (bprecond)   tmpblock = bprecond;
2815         else                 tmpblock = bbody;
2816         if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
2817             return false;
2818     }
2819
2820     /* from increment */
2821     if (bincrement)
2822     {
2823         if      (bpostcond)  tmpblock = bpostcond;
2824         else if (bprecond)   tmpblock = bprecond;
2825         else if (bbody)      tmpblock = bbody;
2826         else                 tmpblock = bout;
2827         if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
2828             return false;
2829     }
2830
2831     /* from postcond */
2832     if (bpostcond)
2833     {
2834         ir_block *ontrue, *onfalse;
2835         if      (bprecond)   ontrue = bprecond;
2836         else if (bbody)      ontrue = bbody;
2837         else if (bincrement) ontrue = bincrement;
2838         else                 ontrue = bpostcond;
2839         onfalse = bout;
2840         if (self->post_not) {
2841             tmpblock = ontrue;
2842             ontrue   = onfalse;
2843             onfalse  = tmpblock;
2844         }
2845         if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
2846             return false;
2847     }
2848
2849     /* Move 'bout' to the end */
2850     vec_remove(func->ir_func->blocks, bout_id, 1);
2851     vec_push(func->ir_func->blocks, bout);
2852
2853     return true;
2854 }
2855
2856 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
2857 {
2858     ir_block *target;
2859
2860     *out = NULL;
2861
2862     if (lvalue) {
2863         compile_error(ast_ctx(self), "break/continue expression is not an l-value");
2864         return false;
2865     }
2866
2867     if (self->expression.outr) {
2868         compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
2869         return false;
2870     }
2871     self->expression.outr = (ir_value*)1;
2872
2873     if (self->is_continue)
2874         target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
2875     else
2876         target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
2877
2878     if (!target) {
2879         compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
2880         return false;
2881     }
2882
2883     if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
2884         return false;
2885     return true;
2886 }
2887
2888 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
2889 {
2890     ast_expression_codegen *cgen;
2891
2892     ast_switch_case *def_case     = NULL;
2893     ir_block        *def_bfall    = NULL;
2894     ir_block        *def_bfall_to = NULL;
2895     bool set_def_bfall_to = false;
2896
2897     ir_value *dummy     = NULL;
2898     ir_value *irop      = NULL;
2899     ir_block *bout      = NULL;
2900     ir_block *bfall     = NULL;
2901     size_t    bout_id;
2902     size_t    c;
2903
2904     char      typestr[1024];
2905     uint16_t  cmpinstr;
2906
2907     if (lvalue) {
2908         compile_error(ast_ctx(self), "switch expression is not an l-value");
2909         return false;
2910     }
2911
2912     if (self->expression.outr) {
2913         compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
2914         return false;
2915     }
2916     self->expression.outr = (ir_value*)1;
2917
2918     (void)lvalue;
2919     (void)out;
2920
2921     cgen = self->operand->codegen;
2922     if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
2923         return false;
2924
2925     if (!vec_size(self->cases))
2926         return true;
2927
2928     cmpinstr = type_eq_instr[irop->vtype];
2929     if (cmpinstr >= VINSTR_END) {
2930         ast_type_to_string(self->operand, typestr, sizeof(typestr));
2931         compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
2932         return false;
2933     }
2934
2935     bout_id = vec_size(func->ir_func->blocks);
2936     bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
2937     if (!bout)
2938         return false;
2939
2940     /* setup the break block */
2941     vec_push(func->breakblocks, bout);
2942
2943     /* Now create all cases */
2944     for (c = 0; c < vec_size(self->cases); ++c) {
2945         ir_value *cond, *val;
2946         ir_block *bcase, *bnot;
2947         size_t bnot_id;
2948
2949         ast_switch_case *swcase = &self->cases[c];
2950
2951         if (swcase->value) {
2952             /* A regular case */
2953             /* generate the condition operand */
2954             cgen = swcase->value->codegen;
2955             if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
2956                 return false;
2957             /* generate the condition */
2958             cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
2959             if (!cond)
2960                 return false;
2961
2962             bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
2963             bnot_id = vec_size(func->ir_func->blocks);
2964             bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
2965             if (!bcase || !bnot)
2966                 return false;
2967             if (set_def_bfall_to) {
2968                 set_def_bfall_to = false;
2969                 def_bfall_to = bcase;
2970             }
2971             if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
2972                 return false;
2973
2974             /* Make the previous case-end fall through */
2975             if (bfall && !bfall->final) {
2976                 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
2977                     return false;
2978             }
2979
2980             /* enter the case */
2981             func->curblock = bcase;
2982             cgen = swcase->code->codegen;
2983             if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
2984                 return false;
2985
2986             /* remember this block to fall through from */
2987             bfall = func->curblock;
2988
2989             /* enter the else and move it down */
2990             func->curblock = bnot;
2991             vec_remove(func->ir_func->blocks, bnot_id, 1);
2992             vec_push(func->ir_func->blocks, bnot);
2993         } else {
2994             /* The default case */
2995             /* Remember where to fall through from: */
2996             def_bfall = bfall;
2997             bfall     = NULL;
2998             /* remember which case it was */
2999             def_case  = swcase;
3000             /* And the next case will be remembered */
3001             set_def_bfall_to = true;
3002         }
3003     }
3004
3005     /* Jump from the last bnot to bout */
3006     if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
3007         /*
3008         astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
3009         */
3010         return false;
3011     }
3012
3013     /* If there was a default case, put it down here */
3014     if (def_case) {
3015         ir_block *bcase;
3016
3017         /* No need to create an extra block */
3018         bcase = func->curblock;
3019
3020         /* Insert the fallthrough jump */
3021         if (def_bfall && !def_bfall->final) {
3022             if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
3023                 return false;
3024         }
3025
3026         /* Now generate the default code */
3027         cgen = def_case->code->codegen;
3028         if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
3029             return false;
3030
3031         /* see if we need to fall through */
3032         if (def_bfall_to && !func->curblock->final)
3033         {
3034             if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
3035                 return false;
3036         }
3037     }
3038
3039     /* Jump from the last bnot to bout */
3040     if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
3041         return false;
3042     /* enter the outgoing block */
3043     func->curblock = bout;
3044
3045     /* restore the break block */
3046     vec_pop(func->breakblocks);
3047
3048     /* Move 'bout' to the end, it's nicer */
3049     vec_remove(func->ir_func->blocks, bout_id, 1);
3050     vec_push(func->ir_func->blocks, bout);
3051
3052     return true;
3053 }
3054
3055 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
3056 {
3057     size_t i;
3058     ir_value *dummy;
3059
3060     if (self->undefined) {
3061         compile_error(ast_ctx(self), "internal error: ast_label never defined");
3062         return false;
3063     }
3064
3065     *out = NULL;
3066     if (lvalue) {
3067         compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
3068         return false;
3069     }
3070
3071     /* simply create a new block and jump to it */
3072     self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
3073     if (!self->irblock) {
3074         compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
3075         return false;
3076     }
3077     if (!func->curblock->final) {
3078         if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
3079             return false;
3080     }
3081
3082     /* enter the new block */
3083     func->curblock = self->irblock;
3084
3085     /* Generate all the leftover gotos */
3086     for (i = 0; i < vec_size(self->gotos); ++i) {
3087         if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
3088             return false;
3089     }
3090
3091     return true;
3092 }
3093
3094 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
3095 {
3096     *out = NULL;
3097     if (lvalue) {
3098         compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
3099         return false;
3100     }
3101
3102     if (self->target->irblock) {
3103         if (self->irblock_from) {
3104             /* we already tried once, this is the callback */
3105             self->irblock_from->final = false;
3106             if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
3107                 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3108                 return false;
3109             }
3110         }
3111         else
3112         {
3113             if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
3114                 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3115                 return false;
3116             }
3117         }
3118     }
3119     else
3120     {
3121         /* the target has not yet been created...
3122          * close this block in a sneaky way:
3123          */
3124         func->curblock->final = true;
3125         self->irblock_from = func->curblock;
3126         ast_label_register_goto(self->target, self);
3127     }
3128
3129     return true;
3130 }
3131
3132 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
3133 {
3134     ast_expression_codegen *cgen;
3135     ir_value              **params;
3136     ir_instr               *callinstr;
3137     size_t i;
3138
3139     ir_value *funval = NULL;
3140
3141     /* return values are never lvalues */
3142     if (lvalue) {
3143         compile_error(ast_ctx(self), "not an l-value (function call)");
3144         return false;
3145     }
3146
3147     if (self->expression.outr) {
3148         *out = self->expression.outr;
3149         return true;
3150     }
3151
3152     cgen = self->func->codegen;
3153     if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3154         return false;
3155     if (!funval)
3156         return false;
3157
3158     params = NULL;
3159
3160     /* parameters */
3161     for (i = 0; i < vec_size(self->params); ++i)
3162     {
3163         ir_value *param;
3164         ast_expression *expr = self->params[i];
3165
3166         cgen = expr->codegen;
3167         if (!(*cgen)(expr, func, false, &param))
3168             goto error;
3169         if (!param)
3170             goto error;
3171         vec_push(params, param);
3172     }
3173
3174     /* varargs counter */
3175     if (self->va_count) {
3176         ir_value   *va_count;
3177         ir_builder *builder = func->curblock->owner->owner;
3178         cgen = self->va_count->codegen;
3179         if (!(*cgen)((ast_expression*)(self->va_count), func, false, &va_count))
3180             return false;
3181         if (!ir_block_create_store_op(func->curblock, ast_ctx(self), INSTR_STORE_F,
3182                                       ir_builder_get_va_count(builder), va_count))
3183         {
3184             return false;
3185         }
3186     }
3187
3188     callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3189                                      ast_function_label(func, "call"),
3190                                      funval, !!(self->func->flags & AST_FLAG_NORETURN));
3191     if (!callinstr)
3192         goto error;
3193
3194     for (i = 0; i < vec_size(params); ++i) {
3195         ir_call_param(callinstr, params[i]);
3196     }
3197
3198     *out = ir_call_value(callinstr);
3199     self->expression.outr = *out;
3200
3201     codegen_output_type(self, *out);
3202
3203     vec_free(params);
3204     return true;
3205 error:
3206     vec_free(params);
3207     return false;
3208 }