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