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