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