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 /* error handling */
  39 static void asterror(lex_ctx ctx, const char *msg, ...)
  40 {
  41     va_list ap;
  42     va_start(ap, msg);
  43     cvprintmsg(ctx, LVL_ERROR, "error", msg, ap);
  44     va_end(ap);
  45 }
  46
  47 /* It must not be possible to get here. */
  48 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
  49 {
  50     fprintf(stderr, "ast node missing destroy()\n");
  51     abort();
  52 }
  53
  54 /* Initialize main ast node aprts */
  55 static void ast_node_init(ast_node *self, lex_ctx ctx, int nodetype)
  56 {
  57     self->node.context = ctx;
  58     self->node.destroy = &_ast_node_destroy;
  59     self->node.keep    = false;
  60     self->node.nodetype = nodetype;
  61 }
  62
  63 /* General expression initialization */
  64 static void ast_expression_init(ast_expression *self,
  65                                 ast_expression_codegen *codegen)
  66 {
  67     self->expression.codegen = codegen;
  68     self->expression.vtype   = TYPE_VOID;
  69     self->expression.next    = NULL;
  70     self->expression.outl    = NULL;
  71     self->expression.outr    = NULL;
  72     MEM_VECTOR_INIT(&self->expression, params);
  73 }
  74
  75 static void ast_expression_delete(ast_expression *self)
  76 {
  77     size_t i;
  78     if (self->expression.next)
  79         ast_delete(self->expression.next);
  80     for (i = 0; i < self->expression.params_count; ++i) {
  81         ast_delete(self->expression.params[i]);
  82     }
  83     MEM_VECTOR_CLEAR(&self->expression, params);
  84 }
  85
  86 static void ast_expression_delete_full(ast_expression *self)
  87 {
  88     ast_expression_delete(self);
  89     mem_d(self);
  90 }
  91
  92 MEM_VEC_FUNCTIONS(ast_expression_common, ast_value*, params)
  93
  94 ast_value* ast_value_copy(const ast_value *self)
  95 {
  96     size_t i;
  97     const ast_expression_common *fromex;
  98     ast_expression_common *selfex;
  99     ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
 100     if (self->expression.next) {
 101         cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
 102         if (!cp->expression.next) {
 103             ast_value_delete(cp);
 104             return NULL;
 105         }
 106     }
 107     fromex   = &self->expression;
 108     selfex = &cp->expression;
 109     for (i = 0; i < fromex->params_count; ++i) {
 110         ast_value *v = ast_value_copy(fromex->params[i]);
 111         if (!v || !ast_expression_common_params_add(selfex, v)) {
 112             ast_value_delete(cp);
 113             return NULL;
 114         }
 115     }
 116     return cp;
 117 }
 118
 119 bool ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
 120 {
 121     size_t i;
 122     const ast_expression_common *fromex;
 123     ast_expression_common *selfex;
 124     self->expression.vtype = other->expression.vtype;
 125     if (other->expression.next) {
 126         self->expression.next = (ast_expression*)ast_type_copy(ast_ctx(self), other->expression.next);
 127         if (!self->expression.next)
 128             return false;
 129     }
 130     fromex   = &other->expression;
 131     selfex = &self->expression;
 132     for (i = 0; i < fromex->params_count; ++i) {
 133         ast_value *v = ast_value_copy(fromex->params[i]);
 134         if (!v || !ast_expression_common_params_add(selfex, v))
 135             return false;
 136     }
 137     return true;
 138 }
 139
 140 static ast_expression* ast_shallow_type(lex_ctx ctx, int vtype)
 141 {
 142     ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
 143     ast_expression_init(self, NULL);
 144     self->expression.codegen = NULL;
 145     self->expression.next    = NULL;
 146     self->expression.vtype   = vtype;
 147     return self;
 148 }
 149
 150 ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
 151 {
 152     size_t i;
 153     const ast_expression_common *fromex;
 154     ast_expression_common *selfex;
 155
 156     if (!ex)
 157         return NULL;
 158     else
 159     {
 160         ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
 161         ast_expression_init(self, NULL);
 162
 163         fromex   = &ex->expression;
 164         selfex = &self->expression;
 165
 166         /* This may never be codegen()d */
 167         selfex->codegen = NULL;
 168
 169         selfex->vtype = fromex->vtype;
 170         if (fromex->next)
 171         {
 172             selfex->next = ast_type_copy(ctx, fromex->next);
 173             if (!selfex->next) {
 174                 ast_expression_delete_full(self);
 175                 return NULL;
 176             }
 177         }
 178         else
 179             selfex->next = NULL;
 180
 181         for (i = 0; i < fromex->params_count; ++i) {
 182             ast_value *v = ast_value_copy(fromex->params[i]);
 183             if (!v || !ast_expression_common_params_add(selfex, v)) {
 184                 ast_expression_delete_full(self);
 185                 return NULL;
 186             }
 187         }
 188
 189         return self;
 190     }
 191 }
 192
 193 bool ast_compare_type(ast_expression *a, ast_expression *b)
 194 {
 195     if (a->expression.vtype != b->expression.vtype)
 196         return false;
 197     if (!a->expression.next != !b->expression.next)
 198         return false;
 199     if (a->expression.params_count != b->expression.params_count)
 200         return false;
 201     if (a->expression.params_count) {
 202         size_t i;
 203         for (i = 0; i < a->expression.params_count; ++i) {
 204             if (!ast_compare_type((ast_expression*)a->expression.params[i],
 205                                   (ast_expression*)b->expression.params[i]))
 206                 return false;
 207         }
 208     }
 209     if (a->expression.next)
 210         return ast_compare_type(a->expression.next, b->expression.next);
 211     return true;
 212 }
 213
 214 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
 215 {
 216     ast_instantiate(ast_value, ctx, ast_value_delete);
 217     ast_expression_init((ast_expression*)self,
 218                         (ast_expression_codegen*)&ast_value_codegen);
 219     self->expression.node.keep = true; /* keep */
 220
 221     self->name = name ? util_strdup(name) : NULL;
 222     self->expression.vtype = t;
 223     self->expression.next  = NULL;
 224     self->isconst = false;
 225     memset(&self->constval, 0, sizeof(self->constval));
 226
 227     self->ir_v    = NULL;
 228
 229     return self;
 230 }
 231
 232 void ast_value_delete(ast_value* self)
 233 {
 234     if (self->name)
 235         mem_d((void*)self->name);
 236     if (self->isconst) {
 237         switch (self->expression.vtype)
 238         {
 239         case TYPE_STRING:
 240             mem_d((void*)self->constval.vstring);
 241             break;
 242         case TYPE_FUNCTION:
 243             /* unlink us from the function node */
 244             self->constval.vfunc->vtype = NULL;
 245             break;
 246         /* NOTE: delete function? currently collected in
 247          * the parser structure
 248          */
 249         default:
 250             break;
 251         }
 252     }
 253     ast_expression_delete((ast_expression*)self);
 254     mem_d(self);
 255 }
 256
 257 bool GMQCC_WARN ast_value_params_add(ast_value *self, ast_value *p)
 258 {
 259     return ast_expression_common_params_add(&self->expression, p);
 260 }
 261
 262 bool ast_value_set_name(ast_value *self, const char *name)
 263 {
 264     if (self->name)
 265         mem_d((void*)self->name);
 266     self->name = util_strdup(name);
 267     return !!self->name;
 268 }
 269
 270 ast_binary* ast_binary_new(lex_ctx ctx, int op,
 271                            ast_expression* left, ast_expression* right)
 272 {
 273     ast_instantiate(ast_binary, ctx, ast_binary_delete);
 274     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
 275
 276     self->op = op;
 277     self->left = left;
 278     self->right = right;
 279
 280     if (op >= INSTR_EQ_F && op <= INSTR_GT)
 281         self->expression.vtype = TYPE_FLOAT;
 282     else if (op == INSTR_AND || op == INSTR_OR ||
 283              op == INSTR_BITAND || op == INSTR_BITOR)
 284         self->expression.vtype = TYPE_FLOAT;
 285     else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
 286         self->expression.vtype = TYPE_VECTOR;
 287     else if (op == INSTR_MUL_V)
 288         self->expression.vtype = TYPE_FLOAT;
 289     else
 290         self->expression.vtype = left->expression.vtype;
 291
 292     return self;
 293 }
 294
 295 void ast_binary_delete(ast_binary *self)
 296 {
 297     ast_unref(self->left);
 298     ast_unref(self->right);
 299     ast_expression_delete((ast_expression*)self);
 300     mem_d(self);
 301 }
 302
 303 ast_binstore* ast_binstore_new(lex_ctx ctx, int storop, int op,
 304                                ast_expression* left, ast_expression* right)
 305 {
 306     ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
 307     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
 308
 309     self->opstore = storop;
 310     self->opbin   = op;
 311     self->dest    = left;
 312     self->source  = right;
 313
 314     self->expression.vtype = left->expression.vtype;
 315     if (left->expression.next) {
 316         self->expression.next = ast_type_copy(ctx, left);
 317         if (!self->expression.next) {
 318             ast_delete(self);
 319             return NULL;
 320         }
 321     }
 322     else
 323         self->expression.next = NULL;
 324
 325     return self;
 326 }
 327
 328 void ast_binstore_delete(ast_binstore *self)
 329 {
 330     ast_unref(self->dest);
 331     ast_unref(self->source);
 332     ast_expression_delete((ast_expression*)self);
 333     mem_d(self);
 334 }
 335
 336 ast_unary* ast_unary_new(lex_ctx ctx, int op,
 337                          ast_expression *expr)
 338 {
 339     ast_instantiate(ast_unary, ctx, ast_unary_delete);
 340     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
 341
 342     self->op = op;
 343     self->operand = expr;
 344
 345     if (op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) {
 346         self->expression.vtype = TYPE_FLOAT;
 347     } else
 348         asterror(ctx, "cannot determine type of unary operation %s", asm_instr[op].m);
 349
 350     return self;
 351 }
 352
 353 void ast_unary_delete(ast_unary *self)
 354 {
 355     ast_unref(self->operand);
 356     ast_expression_delete((ast_expression*)self);
 357     mem_d(self);
 358 }
 359
 360 ast_return* ast_return_new(lex_ctx ctx, ast_expression *expr)
 361 {
 362     ast_instantiate(ast_return, ctx, ast_return_delete);
 363     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
 364
 365     self->operand = expr;
 366
 367     return self;
 368 }
 369
 370 void ast_return_delete(ast_return *self)
 371 {
 372     if (self->operand)
 373         ast_unref(self->operand);
 374     ast_expression_delete((ast_expression*)self);
 375     mem_d(self);
 376 }
 377
 378 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
 379 {
 380     const ast_expression *outtype;
 381
 382     ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
 383
 384     if (field->expression.vtype != TYPE_FIELD) {
 385         mem_d(self);
 386         return NULL;
 387     }
 388
 389     outtype = field->expression.next;
 390     if (!outtype) {
 391         mem_d(self);
 392         /* Error: field has no type... */
 393         return NULL;
 394     }
 395
 396     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
 397
 398     self->entity = entity;
 399     self->field  = field;
 400
 401     if (!ast_type_adopt(self, outtype)) {
 402         ast_entfield_delete(self);
 403         return NULL;
 404     }
 405
 406     return self;
 407 }
 408
 409 void ast_entfield_delete(ast_entfield *self)
 410 {
 411     ast_unref(self->entity);
 412     ast_unref(self->field);
 413     ast_expression_delete((ast_expression*)self);
 414     mem_d(self);
 415 }
 416
 417 ast_member* ast_member_new(lex_ctx ctx, ast_expression *owner, unsigned int field)
 418 {
 419     ast_instantiate(ast_member, ctx, ast_member_delete);
 420     if (field >= 3) {
 421         mem_d(self);
 422         return NULL;
 423     }
 424
 425     if (owner->expression.vtype != TYPE_VECTOR &&
 426         owner->expression.vtype != TYPE_FIELD) {
 427         asterror(ctx, "member-access on an invalid owner of type %s\n", type_name[owner->expression.vtype]);
 428         mem_d(self);
 429         return NULL;
 430     }
 431
 432     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
 433     self->expression.node.keep = true; /* keep */
 434
 435     if (owner->expression.vtype == TYPE_VECTOR) {
 436         self->expression.vtype = TYPE_FLOAT;
 437         self->expression.next  = NULL;
 438     } else {
 439         self->expression.vtype = TYPE_FIELD;
 440         self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
 441     }
 442
 443     self->owner = owner;
 444     self->field = field;
 445
 446     return self;
 447 }
 448
 449 void ast_member_delete(ast_member *self)
 450 {
 451     /* The owner is always an ast_value, which has .keep=true,
 452      * also: ast_members are usually deleted after the owner, thus
 453      * this will cause invalid access
 454     ast_unref(self->owner);
 455      * once we allow (expression).x to access a vector-member, we need
 456      * to change this: preferably by creating an alternate ast node for this
 457      * purpose that is not garbage-collected.
 458     */
 459     ast_expression_delete((ast_expression*)self);
 460     mem_d(self);
 461 }
 462
 463 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
 464 {
 465     ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
 466     if (!ontrue && !onfalse) {
 467         /* because it is invalid */
 468         mem_d(self);
 469         return NULL;
 470     }
 471     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
 472
 473     self->cond     = cond;
 474     self->on_true  = ontrue;
 475     self->on_false = onfalse;
 476
 477     return self;
 478 }
 479
 480 void ast_ifthen_delete(ast_ifthen *self)
 481 {
 482     ast_unref(self->cond);
 483     if (self->on_true)
 484         ast_unref(self->on_true);
 485     if (self->on_false)
 486         ast_unref(self->on_false);
 487     ast_expression_delete((ast_expression*)self);
 488     mem_d(self);
 489 }
 490
 491 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
 492 {
 493     ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
 494     /* This time NEITHER must be NULL */
 495     if (!ontrue || !onfalse) {
 496         mem_d(self);
 497         return NULL;
 498     }
 499     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
 500
 501     self->cond     = cond;
 502     self->on_true  = ontrue;
 503     self->on_false = onfalse;
 504     self->phi_out  = NULL;
 505
 506     return self;
 507 }
 508
 509 void ast_ternary_delete(ast_ternary *self)
 510 {
 511     ast_unref(self->cond);
 512     ast_unref(self->on_true);
 513     ast_unref(self->on_false);
 514     ast_expression_delete((ast_expression*)self);
 515     mem_d(self);
 516 }
 517
 518 ast_loop* ast_loop_new(lex_ctx ctx,
 519                        ast_expression *initexpr,
 520                        ast_expression *precond,
 521                        ast_expression *postcond,
 522                        ast_expression *increment,
 523                        ast_expression *body)
 524 {
 525     ast_instantiate(ast_loop, ctx, ast_loop_delete);
 526     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
 527
 528     self->initexpr  = initexpr;
 529     self->precond   = precond;
 530     self->postcond  = postcond;
 531     self->increment = increment;
 532     self->body      = body;
 533
 534     return self;
 535 }
 536
 537 void ast_loop_delete(ast_loop *self)
 538 {
 539     if (self->initexpr)
 540         ast_unref(self->initexpr);
 541     if (self->precond)
 542         ast_unref(self->precond);
 543     if (self->postcond)
 544         ast_unref(self->postcond);
 545     if (self->increment)
 546         ast_unref(self->increment);
 547     if (self->body)
 548         ast_unref(self->body);
 549     ast_expression_delete((ast_expression*)self);
 550     mem_d(self);
 551 }
 552
 553 ast_call* ast_call_new(lex_ctx ctx,
 554                        ast_expression *funcexpr)
 555 {
 556     ast_instantiate(ast_call, ctx, ast_call_delete);
 557     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
 558
 559     MEM_VECTOR_INIT(self, params);
 560
 561     self->func = funcexpr;
 562
 563     self->expression.vtype = funcexpr->expression.next->expression.vtype;
 564     if (funcexpr->expression.next->expression.next)
 565         self->expression.next = ast_type_copy(ctx, funcexpr->expression.next->expression.next);
 566
 567     return self;
 568 }
 569 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
 570
 571 void ast_call_delete(ast_call *self)
 572 {
 573     size_t i;
 574     for (i = 0; i < self->params_count; ++i)
 575         ast_unref(self->params[i]);
 576     MEM_VECTOR_CLEAR(self, params);
 577
 578     if (self->func)
 579         ast_unref(self->func);
 580
 581     ast_expression_delete((ast_expression*)self);
 582     mem_d(self);
 583 }
 584
 585 ast_store* ast_store_new(lex_ctx ctx, int op,
 586                          ast_expression *dest, ast_expression *source)
 587 {
 588     ast_instantiate(ast_store, ctx, ast_store_delete);
 589     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
 590
 591     self->op = op;
 592     self->dest = dest;
 593     self->source = source;
 594
 595     return self;
 596 }
 597
 598 void ast_store_delete(ast_store *self)
 599 {
 600     ast_unref(self->dest);
 601     ast_unref(self->source);
 602     ast_expression_delete((ast_expression*)self);
 603     mem_d(self);
 604 }
 605
 606 ast_block* ast_block_new(lex_ctx ctx)
 607 {
 608     ast_instantiate(ast_block, ctx, ast_block_delete);
 609     ast_expression_init((ast_expression*)self,
 610                         (ast_expression_codegen*)&ast_block_codegen);
 611
 612     MEM_VECTOR_INIT(self, locals);
 613     MEM_VECTOR_INIT(self, exprs);
 614     MEM_VECTOR_INIT(self, collect);
 615
 616     return self;
 617 }
 618 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
 619 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
 620 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, collect)
 621
 622 bool ast_block_collect(ast_block *self, ast_expression *expr)
 623 {
 624     if (!ast_block_collect_add(self, expr))
 625         return false;
 626     expr->expression.node.keep = true;
 627     return true;
 628 }
 629
 630 void ast_block_delete(ast_block *self)
 631 {
 632     size_t i;
 633     for (i = 0; i < self->exprs_count; ++i)
 634         ast_unref(self->exprs[i]);
 635     MEM_VECTOR_CLEAR(self, exprs);
 636     for (i = 0; i < self->locals_count; ++i)
 637         ast_delete(self->locals[i]);
 638     MEM_VECTOR_CLEAR(self, locals);
 639     for (i = 0; i < self->collect_count; ++i)
 640         ast_delete(self->collect[i]);
 641     MEM_VECTOR_CLEAR(self, collect);
 642     ast_expression_delete((ast_expression*)self);
 643     mem_d(self);
 644 }
 645
 646 bool ast_block_set_type(ast_block *self, ast_expression *from)
 647 {
 648     if (self->expression.next)
 649         ast_delete(self->expression.next);
 650     self->expression.vtype = from->expression.vtype;
 651     if (from->expression.next) {
 652         self->expression.next = ast_type_copy(self->expression.node.context, from->expression.next);
 653         if (!self->expression.next)
 654             return false;
 655     }
 656     else
 657         self->expression.next = NULL;
 658     return true;
 659 }
 660
 661 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
 662 {
 663     ast_instantiate(ast_function, ctx, ast_function_delete);
 664
 665     if (!vtype ||
 666         vtype->isconst ||
 667         vtype->expression.vtype != TYPE_FUNCTION)
 668     {
 669         mem_d(self);
 670         return NULL;
 671     }
 672
 673     self->vtype = vtype;
 674     self->name = name ? util_strdup(name) : NULL;
 675     MEM_VECTOR_INIT(self, blocks);
 676
 677     self->labelcount = 0;
 678     self->builtin = 0;
 679
 680     self->ir_func = NULL;
 681     self->curblock = NULL;
 682
 683     self->breakblock    = NULL;
 684     self->continueblock = NULL;
 685
 686     vtype->isconst = true;
 687     vtype->constval.vfunc = self;
 688
 689     return self;
 690 }
 691
 692 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
 693
 694 void ast_function_delete(ast_function *self)
 695 {
 696     size_t i;
 697     if (self->name)
 698         mem_d((void*)self->name);
 699     if (self->vtype) {
 700         /* ast_value_delete(self->vtype); */
 701         self->vtype->isconst = false;
 702         self->vtype->constval.vfunc = NULL;
 703         /* We use unref - if it was stored in a global table it is supposed
 704          * to be deleted from *there*
 705          */
 706         ast_unref(self->vtype);
 707     }
 708     for (i = 0; i < self->blocks_count; ++i)
 709         ast_delete(self->blocks[i]);
 710     MEM_VECTOR_CLEAR(self, blocks);
 711     mem_d(self);
 712 }
 713
 714 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
 715 {
 716     unsigned int base = 10;
 717 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
 718 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
 719     if (size < 1)
 720         return;
 721     checknul();
 722     if (!num)
 723         addch('0');
 724     else {
 725         while (num)
 726         {
 727             int digit = num % base;
 728             num /= base;
 729             addch('0' + digit);
 730         }
 731     }
 732
 733     *buf = 0;
 734 #undef addch
 735 #undef checknul
 736 }
 737
 738 const char* ast_function_label(ast_function *self, const char *prefix)
 739 {
 740     size_t id = (self->labelcount++);
 741     size_t len = strlen(prefix);
 742     strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
 743     ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
 744     return self->labelbuf;
 745 }
 746
 747 /*********************************************************************/
 748 /* AST codegen part
 749  * by convention you must never pass NULL to the 'ir_value **out'
 750  * parameter. If you really don't care about the output, pass a dummy.
 751  * But I can't imagine a pituation where the output is truly unnecessary.
 752  */
 753
 754 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
 755 {
 756     /* NOTE: This is the codegen for a variable used in an expression.
 757      * It is not the codegen to generate the value. For this purpose,
 758      * ast_local_codegen and ast_global_codegen are to be used before this
 759      * is executed. ast_function_codegen should take care of its locals,
 760      * and the ast-user should take care of ast_global_codegen to be used
 761      * on all the globals.
 762      */
 763     if (!self->ir_v) {
 764         asterror(ast_ctx(self), "ast_value used before generated (%s)\n", self->name);
 765         return false;
 766     }
 767     *out = self->ir_v;
 768     return true;
 769 }
 770
 771 bool ast_global_codegen(ast_value *self, ir_builder *ir)
 772 {
 773     ir_value *v = NULL;
 774     if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
 775     {
 776         ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
 777         if (!func)
 778             return false;
 779         func->context = ast_ctx(self);
 780
 781         self->constval.vfunc->ir_func = func;
 782         self->ir_v = func->value;
 783         /* The function is filled later on ast_function_codegen... */
 784         return true;
 785     }
 786
 787     if (self->expression.vtype == TYPE_FIELD) {
 788         v = ir_builder_create_field(ir, self->name, self->expression.next->expression.vtype);
 789         if (!v)
 790             return false;
 791         if (self->isconst) {
 792             asterror(ast_ctx(self), "TODO: constant field pointers with value\n");
 793             goto error;
 794         }
 795         self->ir_v = v;
 796         return true;
 797     }
 798
 799     v = ir_builder_create_global(ir, self->name, self->expression.vtype);
 800     if (!v) {
 801         asterror(ast_ctx(self), "ir_builder_create_global failed\n");
 802         return false;
 803     }
 804
 805     if (self->isconst) {
 806         switch (self->expression.vtype)
 807         {
 808             case TYPE_FLOAT:
 809                 if (!ir_value_set_float(v, self->constval.vfloat))
 810                     goto error;
 811                 break;
 812             case TYPE_VECTOR:
 813                 if (!ir_value_set_vector(v, self->constval.vvec))
 814                     goto error;
 815                 break;
 816             case TYPE_STRING:
 817                 if (!ir_value_set_string(v, self->constval.vstring))
 818                     goto error;
 819                 break;
 820             case TYPE_FUNCTION:
 821                 asterror(ast_ctx(self), "global of type function not properly generated\n");
 822                 goto error;
 823                 /* Cannot generate an IR value for a function,
 824                  * need a pointer pointing to a function rather.
 825                  */
 826             default:
 827                 asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
 828                 break;
 829         }
 830     }
 831
 832     /* link us to the ir_value */
 833     self->ir_v = v;
 834     return true;
 835
 836 error: /* clean up */
 837     ir_value_delete(v);
 838     return false;
 839 }
 840
 841 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
 842 {
 843     ir_value *v = NULL;
 844     if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
 845     {
 846         /* Do we allow local functions? I think not...
 847          * this is NOT a function pointer atm.
 848          */
 849         return false;
 850     }
 851
 852     v = ir_function_create_local(func, self->name, self->expression.vtype, param);
 853     if (!v)
 854         return false;
 855
 856     /* A constant local... hmmm...
 857      * I suppose the IR will have to deal with this
 858      */
 859     if (self->isconst) {
 860         switch (self->expression.vtype)
 861         {
 862             case TYPE_FLOAT:
 863                 if (!ir_value_set_float(v, self->constval.vfloat))
 864                     goto error;
 865                 break;
 866             case TYPE_VECTOR:
 867                 if (!ir_value_set_vector(v, self->constval.vvec))
 868                     goto error;
 869                 break;
 870             case TYPE_STRING:
 871                 if (!ir_value_set_string(v, self->constval.vstring))
 872                     goto error;
 873                 break;
 874             default:
 875                 asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
 876                 break;
 877         }
 878     }
 879
 880     /* link us to the ir_value */
 881     self->ir_v = v;
 882     return true;
 883
 884 error: /* clean up */
 885     ir_value_delete(v);
 886     return false;
 887 }
 888
 889 bool ast_function_codegen(ast_function *self, ir_builder *ir)
 890 {
 891     ir_function *irf;
 892     ir_value    *dummy;
 893     ast_expression_common *ec;
 894     size_t    i;
 895
 896     irf = self->ir_func;
 897     if (!irf) {
 898         asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet\n");
 899         return false;
 900     }
 901
 902     /* fill the parameter list */
 903     ec = &self->vtype->expression;
 904     for (i = 0; i < ec->params_count; ++i)
 905     {
 906         if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
 907             return false;
 908         if (!self->builtin) {
 909             if (!ast_local_codegen(ec->params[i], self->ir_func, true))
 910                 return false;
 911         }
 912     }
 913
 914     if (self->builtin) {
 915         irf->builtin = self->builtin;
 916         return true;
 917     }
 918
 919     if (!self->blocks_count) {
 920         asterror(ast_ctx(self), "function `%s` has no body", self->name);
 921         return false;
 922     }
 923
 924     self->curblock = ir_function_create_block(irf, "entry");
 925     if (!self->curblock)
 926         return false;
 927
 928     for (i = 0; i < self->blocks_count; ++i) {
 929         ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
 930         if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
 931             return false;
 932     }
 933
 934     /* TODO: check return types */
 935     if (!self->curblock->is_return)
 936     {
 937         if (!self->vtype->expression.next ||
 938             self->vtype->expression.next->expression.vtype == TYPE_VOID)
 939         {
 940             return ir_block_create_return(self->curblock, NULL);
 941         }
 942         else
 943         {
 944             /* error("missing return"); */
 945             asterror(ast_ctx(self), "function `%s` missing return value", self->name);
 946             return false;
 947         }
 948     }
 949     return true;
 950 }
 951
 952 /* Note, you will not see ast_block_codegen generate ir_blocks.
 953  * To the AST and the IR, blocks are 2 different things.
 954  * In the AST it represents a block of code, usually enclosed in
 955  * curly braces {...}.
 956  * While in the IR it represents a block in terms of control-flow.
 957  */
 958 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
 959 {
 960     size_t i;
 961
 962     /* We don't use this
 963      * Note: an ast-representation using the comma-operator
 964      * of the form: (a, b, c) = x should not assign to c...
 965      */
 966     (void)lvalue;
 967     if (self->expression.outr) {
 968         *out = self->expression.outr;
 969         return true;
 970     }
 971
 972     /* output is NULL at first, we'll have each expression
 973      * assign to out output, thus, a comma-operator represention
 974      * using an ast_block will return the last generated value,
 975      * so: (b, c) + a  executed both b and c, and returns c,
 976      * which is then added to a.
 977      */
 978     *out = NULL;
 979
 980     /* generate locals */
 981     for (i = 0; i < self->locals_count; ++i)
 982     {
 983         if (!ast_local_codegen(self->locals[i], func->ir_func, false))
 984             return false;
 985     }
 986
 987     for (i = 0; i < self->exprs_count; ++i)
 988     {
 989         ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
 990         if (!(*gen)(self->exprs[i], func, false, out))
 991             return false;
 992     }
 993
 994     self->expression.outr = *out;
 995
 996     return true;
 997 }
 998
 999 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1000 {
1001     ast_expression_codegen *cgen;
1002     ir_value *left, *right;
1003
1004     if (lvalue && self->expression.outl) {
1005         *out = self->expression.outl;
1006         return true;
1007     }
1008
1009     if (!lvalue && self->expression.outr) {
1010         *out = self->expression.outr;
1011         return true;
1012     }
1013
1014     cgen = self->dest->expression.codegen;
1015     /* lvalue! */
1016     if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1017         return false;
1018     self->expression.outl = left;
1019
1020     cgen = self->source->expression.codegen;
1021     /* rvalue! */
1022     if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1023         return false;
1024
1025     if (!ir_block_create_store_op(func->curblock, self->op, left, right))
1026         return false;
1027     self->expression.outr = right;
1028
1029     /* Theoretically, an assinment returns its left side as an
1030      * lvalue, if we don't need an lvalue though, we return
1031      * the right side as an rvalue, otherwise we have to
1032      * somehow know whether or not we need to dereference the pointer
1033      * on the left side - that is: OP_LOAD if it was an address.
1034      * Also: in original QC we cannot OP_LOADP *anyway*.
1035      */
1036     *out = (lvalue ? left : right);
1037
1038     return true;
1039 }
1040
1041 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1042 {
1043     ast_expression_codegen *cgen;
1044     ir_value *left, *right;
1045
1046     /* In the context of a binary operation, we can disregard
1047      * the lvalue flag.
1048      */
1049     (void)lvalue;
1050     if (self->expression.outr) {
1051         *out = self->expression.outr;
1052         return true;
1053     }
1054
1055     cgen = self->left->expression.codegen;
1056     /* lvalue! */
1057     if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1058         return false;
1059
1060     cgen = self->right->expression.codegen;
1061     /* rvalue! */
1062     if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1063         return false;
1064
1065     *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1066                                  self->op, left, right);
1067     if (!*out)
1068         return false;
1069     self->expression.outr = *out;
1070
1071     return true;
1072 }
1073
1074 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1075 {
1076     ast_expression_codegen *cgen;
1077     ir_value *leftl, *leftr, *right, *bin;
1078
1079     if (lvalue && self->expression.outl) {
1080         *out = self->expression.outl;
1081         return true;
1082     }
1083
1084     if (!lvalue && self->expression.outr) {
1085         *out = self->expression.outr;
1086         return true;
1087     }
1088
1089     /* for a binstore we need both an lvalue and an rvalue for the left side */
1090     /* rvalue of destination! */
1091     cgen = self->dest->expression.codegen;
1092     if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1093         return false;
1094
1095     /* source as rvalue only */
1096     cgen = self->source->expression.codegen;
1097     if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1098         return false;
1099
1100     /* now the binary */
1101     bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1102                                 self->opbin, leftr, right);
1103     self->expression.outr = bin;
1104
1105     /* now store them */
1106     cgen = self->dest->expression.codegen;
1107     /* lvalue of destination */
1108     if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1109         return false;
1110     self->expression.outl = leftl;
1111
1112     if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1113         return false;
1114     self->expression.outr = bin;
1115
1116     /* Theoretically, an assinment returns its left side as an
1117      * lvalue, if we don't need an lvalue though, we return
1118      * the right side as an rvalue, otherwise we have to
1119      * somehow know whether or not we need to dereference the pointer
1120      * on the left side - that is: OP_LOAD if it was an address.
1121      * Also: in original QC we cannot OP_LOADP *anyway*.
1122      */
1123     *out = (lvalue ? leftl : bin);
1124
1125     return true;
1126 }
1127
1128 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1129 {
1130     ast_expression_codegen *cgen;
1131     ir_value *operand;
1132
1133     /* In the context of a unary operation, we can disregard
1134      * the lvalue flag.
1135      */
1136     (void)lvalue;
1137     if (self->expression.outr) {
1138         *out = self->expression.outr;
1139         return true;
1140     }
1141
1142     cgen = self->operand->expression.codegen;
1143     /* lvalue! */
1144     if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1145         return false;
1146
1147     *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1148                                  self->op, operand);
1149     if (!*out)
1150         return false;
1151     self->expression.outr = *out;
1152
1153     return true;
1154 }
1155
1156 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1157 {
1158     ast_expression_codegen *cgen;
1159     ir_value *operand;
1160
1161     /* In the context of a return operation, we can disregard
1162      * the lvalue flag.
1163      */
1164     (void)lvalue;
1165     if (self->expression.outr) {
1166         asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!\n");
1167         return false;
1168     }
1169     self->expression.outr = (ir_value*)1;
1170
1171     if (self->operand) {
1172         cgen = self->operand->expression.codegen;
1173         /* lvalue! */
1174         if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1175             return false;
1176
1177         if (!ir_block_create_return(func->curblock, operand))
1178             return false;
1179     } else {
1180         if (!ir_block_create_return(func->curblock, NULL))
1181             return false;
1182     }
1183
1184     return true;
1185 }
1186
1187 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1188 {
1189     ast_expression_codegen *cgen;
1190     ir_value *ent, *field;
1191
1192     /* This function needs to take the 'lvalue' flag into account!
1193      * As lvalue we provide a field-pointer, as rvalue we provide the
1194      * value in a temp.
1195      */
1196
1197     if (lvalue && self->expression.outl) {
1198         *out = self->expression.outl;
1199         return true;
1200     }
1201
1202     if (!lvalue && self->expression.outr) {
1203         *out = self->expression.outr;
1204         return true;
1205     }
1206
1207     cgen = self->entity->expression.codegen;
1208     if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1209         return false;
1210
1211     cgen = self->field->expression.codegen;
1212     if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1213         return false;
1214
1215     if (lvalue) {
1216         /* address! */
1217         *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1218                                             ent, field);
1219     } else {
1220         *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1221                                              ent, field, self->expression.vtype);
1222     }
1223     if (!*out) {
1224         asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1225                  (lvalue ? "ADDRESS" : "FIELD"),
1226                  type_name[self->expression.vtype]);
1227         return false;
1228     }
1229
1230     if (lvalue)
1231         self->expression.outl = *out;
1232     else
1233         self->expression.outr = *out;
1234
1235     /* Hm that should be it... */
1236     return true;
1237 }
1238
1239 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1240 {
1241     ast_expression_codegen *cgen;
1242     ir_value *vec;
1243
1244     /* in QC this is always an lvalue */
1245     (void)lvalue;
1246     if (self->expression.outl) {
1247         *out = self->expression.outl;
1248         return true;
1249     }
1250
1251     cgen = self->owner->expression.codegen;
1252     if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1253         return false;
1254
1255     if (vec->vtype != TYPE_VECTOR &&
1256         !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1257     {
1258         return false;
1259     }
1260
1261     *out = ir_value_vector_member(vec, self->field);
1262     self->expression.outl = *out;
1263
1264     return (*out != NULL);
1265 }
1266
1267 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
1268 {
1269     ast_expression_codegen *cgen;
1270
1271     ir_value *condval;
1272     ir_value *dummy;
1273
1274     ir_block *cond = func->curblock;
1275     ir_block *ontrue;
1276     ir_block *onfalse;
1277     ir_block *merge;
1278
1279     /* We don't output any value, thus also don't care about r/lvalue */
1280     (void)out;
1281     (void)lvalue;
1282
1283     if (self->expression.outr) {
1284         asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!\n");
1285         return false;
1286     }
1287     self->expression.outr = (ir_value*)1;
1288
1289     /* generate the condition */
1290     func->curblock = cond;
1291     cgen = self->cond->expression.codegen;
1292     if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1293         return false;
1294
1295     /* on-true path */
1296
1297     if (self->on_true) {
1298         /* create on-true block */
1299         ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
1300         if (!ontrue)
1301             return false;
1302
1303         /* enter the block */
1304         func->curblock = ontrue;
1305
1306         /* generate */
1307         cgen = self->on_true->expression.codegen;
1308         if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
1309             return false;
1310     } else
1311         ontrue = NULL;
1312
1313     /* on-false path */
1314     if (self->on_false) {
1315         /* create on-false block */
1316         onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
1317         if (!onfalse)
1318             return false;
1319
1320         /* enter the block */
1321         func->curblock = onfalse;
1322
1323         /* generate */
1324         cgen = self->on_false->expression.codegen;
1325         if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
1326             return false;
1327     } else
1328         onfalse = NULL;
1329
1330     /* Merge block were they all merge in to */
1331     merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
1332     if (!merge)
1333         return false;
1334
1335     /* add jumps ot the merge block */
1336     if (ontrue && !ir_block_create_jump(ontrue, merge))
1337         return false;
1338     if (onfalse && !ir_block_create_jump(onfalse, merge))
1339         return false;
1340
1341     /* we create the if here, that way all blocks are ordered :)
1342      */
1343     if (!ir_block_create_if(cond, condval,
1344                             (ontrue  ? ontrue  : merge),
1345                             (onfalse ? onfalse : merge)))
1346     {
1347         return false;
1348     }
1349
1350     /* Now enter the merge block */
1351     func->curblock = merge;
1352
1353     return true;
1354 }
1355
1356 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1357 {
1358     ast_expression_codegen *cgen;
1359
1360     ir_value *condval;
1361     ir_value *trueval, *falseval;
1362     ir_instr *phi;
1363
1364     ir_block *cond = func->curblock;
1365     ir_block *ontrue;
1366     ir_block *onfalse;
1367     ir_block *merge;
1368
1369     /* Ternary can never create an lvalue... */
1370     if (lvalue)
1371         return false;
1372
1373     /* In theory it shouldn't be possible to pass through a node twice, but
1374      * in case we add any kind of optimization pass for the AST itself, it
1375      * may still happen, thus we remember a created ir_value and simply return one
1376      * if it already exists.
1377      */
1378     if (self->phi_out) {
1379         *out = self->phi_out;
1380         return true;
1381     }
1382
1383     /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1384
1385     /* generate the condition */
1386     func->curblock = cond;
1387     cgen = self->cond->expression.codegen;
1388     if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1389         return false;
1390
1391     /* create on-true block */
1392     ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1393     if (!ontrue)
1394         return false;
1395     else
1396     {
1397         /* enter the block */
1398         func->curblock = ontrue;
1399
1400         /* generate */
1401         cgen = self->on_true->expression.codegen;
1402         if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1403             return false;
1404     }
1405
1406     /* create on-false block */
1407     onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1408     if (!onfalse)
1409         return false;
1410     else
1411     {
1412         /* enter the block */
1413         func->curblock = onfalse;
1414
1415         /* generate */
1416         cgen = self->on_false->expression.codegen;
1417         if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1418             return false;
1419     }
1420
1421     /* create merge block */
1422     merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1423     if (!merge)
1424         return false;
1425     /* jump to merge block */
1426     if (!ir_block_create_jump(ontrue, merge))
1427         return false;
1428     if (!ir_block_create_jump(onfalse, merge))
1429         return false;
1430
1431     /* create if instruction */
1432     if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1433         return false;
1434
1435     /* Now enter the merge block */
1436     func->curblock = merge;
1437
1438     /* Here, now, we need a PHI node
1439      * but first some sanity checking...
1440      */
1441     if (trueval->vtype != falseval->vtype) {
1442         /* error("ternary with different types on the two sides"); */
1443         return false;
1444     }
1445
1446     /* create PHI */
1447     phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1448     if (!phi ||
1449         !ir_phi_add(phi, ontrue,  trueval) ||
1450         !ir_phi_add(phi, onfalse, falseval))
1451     {
1452         return false;
1453     }
1454
1455     self->phi_out = ir_phi_value(phi);
1456     *out = self->phi_out;
1457
1458     return true;
1459 }
1460
1461 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1462 {
1463     ast_expression_codegen *cgen;
1464
1465     ir_value *dummy      = NULL;
1466     ir_value *precond    = NULL;
1467     ir_value *postcond   = NULL;
1468
1469     /* Since we insert some jumps "late" so we have blocks
1470      * ordered "nicely", we need to keep track of the actual end-blocks
1471      * of expressions to add the jumps to.
1472      */
1473     ir_block *bbody      = NULL, *end_bbody      = NULL;
1474     ir_block *bprecond   = NULL, *end_bprecond   = NULL;
1475     ir_block *bpostcond  = NULL, *end_bpostcond  = NULL;
1476     ir_block *bincrement = NULL, *end_bincrement = NULL;
1477     ir_block *bout       = NULL, *bin            = NULL;
1478
1479     /* let's at least move the outgoing block to the end */
1480     size_t    bout_id;
1481
1482     /* 'break' and 'continue' need to be able to find the right blocks */
1483     ir_block *bcontinue     = NULL;
1484     ir_block *bbreak        = NULL;
1485
1486     ir_block *old_bcontinue = NULL;
1487     ir_block *old_bbreak    = NULL;
1488
1489     ir_block *tmpblock      = NULL;
1490
1491     (void)lvalue;
1492     (void)out;
1493
1494     if (self->expression.outr) {
1495         asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!\n");
1496         return false;
1497     }
1498     self->expression.outr = (ir_value*)1;
1499
1500     /* NOTE:
1501      * Should we ever need some kind of block ordering, better make this function
1502      * move blocks around than write a block ordering algorithm later... after all
1503      * the ast and ir should work together, not against each other.
1504      */
1505
1506     /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1507      * anyway if for example it contains a ternary.
1508      */
1509     if (self->initexpr)
1510     {
1511         cgen = self->initexpr->expression.codegen;
1512         if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1513             return false;
1514     }
1515
1516     /* Store the block from which we enter this chaos */
1517     bin = func->curblock;
1518
1519     /* The pre-loop condition needs its own block since we
1520      * need to be able to jump to the start of that expression.
1521      */
1522     if (self->precond)
1523     {
1524         bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1525         if (!bprecond)
1526             return false;
1527
1528         /* the pre-loop-condition the least important place to 'continue' at */
1529         bcontinue = bprecond;
1530
1531         /* enter */
1532         func->curblock = bprecond;
1533
1534         /* generate */
1535         cgen = self->precond->expression.codegen;
1536         if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1537             return false;
1538
1539         end_bprecond = func->curblock;
1540     } else {
1541         bprecond = end_bprecond = NULL;
1542     }
1543
1544     /* Now the next blocks won't be ordered nicely, but we need to
1545      * generate them this early for 'break' and 'continue'.
1546      */
1547     if (self->increment) {
1548         bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1549         if (!bincrement)
1550             return false;
1551         bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1552     } else {
1553         bincrement = end_bincrement = NULL;
1554     }
1555
1556     if (self->postcond) {
1557         bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1558         if (!bpostcond)
1559             return false;
1560         bcontinue = bpostcond; /* postcond comes before the increment */
1561     } else {
1562         bpostcond = end_bpostcond = NULL;
1563     }
1564
1565     bout_id = func->ir_func->blocks_count;
1566     bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1567     if (!bout)
1568         return false;
1569     bbreak = bout;
1570
1571     /* The loop body... */
1572     if (self->body)
1573     {
1574         bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1575         if (!bbody)
1576             return false;
1577
1578         /* enter */
1579         func->curblock = bbody;
1580
1581         old_bbreak          = func->breakblock;
1582         old_bcontinue       = func->continueblock;
1583         func->breakblock    = bbreak;
1584         func->continueblock = bcontinue;
1585
1586         /* generate */
1587         cgen = self->body->expression.codegen;
1588         if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1589             return false;
1590
1591         end_bbody = func->curblock;
1592         func->breakblock    = old_bbreak;
1593         func->continueblock = old_bcontinue;
1594     }
1595
1596     /* post-loop-condition */
1597     if (self->postcond)
1598     {
1599         /* enter */
1600         func->curblock = bpostcond;
1601
1602         /* generate */
1603         cgen = self->postcond->expression.codegen;
1604         if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1605             return false;
1606
1607         end_bpostcond = func->curblock;
1608     }
1609
1610     /* The incrementor */
1611     if (self->increment)
1612     {
1613         /* enter */
1614         func->curblock = bincrement;
1615
1616         /* generate */
1617         cgen = self->increment->expression.codegen;
1618         if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1619             return false;
1620
1621         end_bincrement = func->curblock;
1622     }
1623
1624     /* In any case now, we continue from the outgoing block */
1625     func->curblock = bout;
1626
1627     /* Now all blocks are in place */
1628     /* From 'bin' we jump to whatever comes first */
1629     if      (bprecond)   tmpblock = bprecond;
1630     else if (bbody)      tmpblock = bbody;
1631     else if (bpostcond)  tmpblock = bpostcond;
1632     else                 tmpblock = bout;
1633     if (!ir_block_create_jump(bin, tmpblock))
1634         return false;
1635
1636     /* From precond */
1637     if (bprecond)
1638     {
1639         ir_block *ontrue, *onfalse;
1640         if      (bbody)      ontrue = bbody;
1641         else if (bincrement) ontrue = bincrement;
1642         else if (bpostcond)  ontrue = bpostcond;
1643         else                 ontrue = bprecond;
1644         onfalse = bout;
1645         if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1646             return false;
1647     }
1648
1649     /* from body */
1650     if (bbody)
1651     {
1652         if      (bincrement) tmpblock = bincrement;
1653         else if (bpostcond)  tmpblock = bpostcond;
1654         else if (bprecond)   tmpblock = bprecond;
1655         else                 tmpblock = bout;
1656         if (!ir_block_create_jump(end_bbody, tmpblock))
1657             return false;
1658     }
1659
1660     /* from increment */
1661     if (bincrement)
1662     {
1663         if      (bpostcond)  tmpblock = bpostcond;
1664         else if (bprecond)   tmpblock = bprecond;
1665         else if (bbody)      tmpblock = bbody;
1666         else                 tmpblock = bout;
1667         if (!ir_block_create_jump(end_bincrement, tmpblock))
1668             return false;
1669     }
1670
1671     /* from postcond */
1672     if (bpostcond)
1673     {
1674         ir_block *ontrue, *onfalse;
1675         if      (bprecond)   ontrue = bprecond;
1676         else if (bbody)      ontrue = bbody;
1677         else if (bincrement) ontrue = bincrement;
1678         else                 ontrue = bpostcond;
1679         onfalse = bout;
1680         if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1681             return false;
1682     }
1683
1684     /* Move 'bout' to the end */
1685     if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1686         !ir_function_blocks_add(func->ir_func, bout))
1687     {
1688         ir_block_delete(bout);
1689         return false;
1690     }
1691
1692     return true;
1693 }
1694
1695 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1696 {
1697     ast_expression_codegen *cgen;
1698     ir_value_vector         params;
1699     ir_instr               *callinstr;
1700     size_t i;
1701
1702     ir_value *funval = NULL;
1703
1704     /* return values are never lvalues */
1705     (void)lvalue;
1706
1707     if (self->expression.outr) {
1708         *out = self->expression.outr;
1709         return true;
1710     }
1711
1712     cgen = self->func->expression.codegen;
1713     if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1714         return false;
1715     if (!funval)
1716         return false;
1717
1718     MEM_VECTOR_INIT(&params, v);
1719
1720     /* parameters */
1721     for (i = 0; i < self->params_count; ++i)
1722     {
1723         ir_value *param;
1724         ast_expression *expr = self->params[i];
1725
1726         cgen = expr->expression.codegen;
1727         if (!(*cgen)(expr, func, false, &param))
1728             goto error;
1729         if (!param)
1730             goto error;
1731         if (!ir_value_vector_v_add(&params, param))
1732             goto error;
1733     }
1734
1735     callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1736     if (!callinstr)
1737         goto error;
1738
1739     for (i = 0; i < params.v_count; ++i) {
1740         if (!ir_call_param(callinstr, params.v[i]))
1741             goto error;
1742     }
1743
1744     *out = ir_call_value(callinstr);
1745     self->expression.outr = *out;
1746
1747     MEM_VECTOR_CLEAR(&params, v);
1748     return true;
1749 error:
1750     MEM_VECTOR_CLEAR(&params, v);
1751     return false;
1752 }