ast.c

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