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         v->context = ast_ctx(self);
 792         if (self->isconst) {
 793             asterror(ast_ctx(self), "TODO: constant field pointers with value\n");
 794             goto error;
 795         }
 796         self->ir_v = v;
 797         return true;
 798     }
 799
 800     v = ir_builder_create_global(ir, self->name, self->expression.vtype);
 801     if (!v) {
 802         asterror(ast_ctx(self), "ir_builder_create_global failed\n");
 803         return false;
 804     }
 805     v->context = ast_ctx(self);
 806
 807     if (self->isconst) {
 808         switch (self->expression.vtype)
 809         {
 810             case TYPE_FLOAT:
 811                 if (!ir_value_set_float(v, self->constval.vfloat))
 812                     goto error;
 813                 break;
 814             case TYPE_VECTOR:
 815                 if (!ir_value_set_vector(v, self->constval.vvec))
 816                     goto error;
 817                 break;
 818             case TYPE_STRING:
 819                 if (!ir_value_set_string(v, self->constval.vstring))
 820                     goto error;
 821                 break;
 822             case TYPE_FUNCTION:
 823                 asterror(ast_ctx(self), "global of type function not properly generated\n");
 824                 goto error;
 825                 /* Cannot generate an IR value for a function,
 826                  * need a pointer pointing to a function rather.
 827                  */
 828             default:
 829                 asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
 830                 break;
 831         }
 832     }
 833
 834     /* link us to the ir_value */
 835     self->ir_v = v;
 836     return true;
 837
 838 error: /* clean up */
 839     ir_value_delete(v);
 840     return false;
 841 }
 842
 843 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
 844 {
 845     ir_value *v = NULL;
 846     if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
 847     {
 848         /* Do we allow local functions? I think not...
 849          * this is NOT a function pointer atm.
 850          */
 851         return false;
 852     }
 853
 854     v = ir_function_create_local(func, self->name, self->expression.vtype, param);
 855     if (!v)
 856         return false;
 857
 858     /* A constant local... hmmm...
 859      * I suppose the IR will have to deal with this
 860      */
 861     if (self->isconst) {
 862         switch (self->expression.vtype)
 863         {
 864             case TYPE_FLOAT:
 865                 if (!ir_value_set_float(v, self->constval.vfloat))
 866                     goto error;
 867                 break;
 868             case TYPE_VECTOR:
 869                 if (!ir_value_set_vector(v, self->constval.vvec))
 870                     goto error;
 871                 break;
 872             case TYPE_STRING:
 873                 if (!ir_value_set_string(v, self->constval.vstring))
 874                     goto error;
 875                 break;
 876             default:
 877                 asterror(ast_ctx(self), "TODO: global constant type %i\n", self->expression.vtype);
 878                 break;
 879         }
 880     }
 881
 882     /* link us to the ir_value */
 883     self->ir_v = v;
 884     return true;
 885
 886 error: /* clean up */
 887     ir_value_delete(v);
 888     return false;
 889 }
 890
 891 bool ast_function_codegen(ast_function *self, ir_builder *ir)
 892 {
 893     ir_function *irf;
 894     ir_value    *dummy;
 895     ast_expression_common *ec;
 896     size_t    i;
 897
 898     irf = self->ir_func;
 899     if (!irf) {
 900         asterror(ast_ctx(self), "ast_function's related ast_value was not generated yet\n");
 901         return false;
 902     }
 903
 904     /* fill the parameter list */
 905     ec = &self->vtype->expression;
 906     for (i = 0; i < ec->params_count; ++i)
 907     {
 908         if (!ir_function_params_add(irf, ec->params[i]->expression.vtype))
 909             return false;
 910         if (!self->builtin) {
 911             if (!ast_local_codegen(ec->params[i], self->ir_func, true))
 912                 return false;
 913         }
 914     }
 915
 916     if (self->builtin) {
 917         irf->builtin = self->builtin;
 918         return true;
 919     }
 920
 921     if (!self->blocks_count) {
 922         asterror(ast_ctx(self), "function `%s` has no body", self->name);
 923         return false;
 924     }
 925
 926     self->curblock = ir_function_create_block(irf, "entry");
 927     if (!self->curblock)
 928         return false;
 929
 930     for (i = 0; i < self->blocks_count; ++i) {
 931         ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
 932         if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
 933             return false;
 934     }
 935
 936     /* TODO: check return types */
 937     if (!self->curblock->is_return)
 938     {
 939         return ir_block_create_return(self->curblock, NULL);
 940         /* From now on the parser has to handle this situation */
 941 #if 0
 942         if (!self->vtype->expression.next ||
 943             self->vtype->expression.next->expression.vtype == TYPE_VOID)
 944         {
 945             return ir_block_create_return(self->curblock, NULL);
 946         }
 947         else
 948         {
 949             /* error("missing return"); */
 950             asterror(ast_ctx(self), "function `%s` missing return value", self->name);
 951             return false;
 952         }
 953 #endif
 954     }
 955     return true;
 956 }
 957
 958 /* Note, you will not see ast_block_codegen generate ir_blocks.
 959  * To the AST and the IR, blocks are 2 different things.
 960  * In the AST it represents a block of code, usually enclosed in
 961  * curly braces {...}.
 962  * While in the IR it represents a block in terms of control-flow.
 963  */
 964 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
 965 {
 966     size_t i;
 967
 968     /* We don't use this
 969      * Note: an ast-representation using the comma-operator
 970      * of the form: (a, b, c) = x should not assign to c...
 971      */
 972     (void)lvalue;
 973     if (self->expression.outr) {
 974         *out = self->expression.outr;
 975         return true;
 976     }
 977
 978     /* output is NULL at first, we'll have each expression
 979      * assign to out output, thus, a comma-operator represention
 980      * using an ast_block will return the last generated value,
 981      * so: (b, c) + a  executed both b and c, and returns c,
 982      * which is then added to a.
 983      */
 984     *out = NULL;
 985
 986     /* generate locals */
 987     for (i = 0; i < self->locals_count; ++i)
 988     {
 989         if (!ast_local_codegen(self->locals[i], func->ir_func, false))
 990             return false;
 991     }
 992
 993     for (i = 0; i < self->exprs_count; ++i)
 994     {
 995         ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
 996         if (!(*gen)(self->exprs[i], func, false, out))
 997             return false;
 998     }
 999
1000     self->expression.outr = *out;
1001
1002     return true;
1003 }
1004
1005 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1006 {
1007     ast_expression_codegen *cgen;
1008     ir_value *left, *right;
1009
1010     if (lvalue && self->expression.outl) {
1011         *out = self->expression.outl;
1012         return true;
1013     }
1014
1015     if (!lvalue && self->expression.outr) {
1016         *out = self->expression.outr;
1017         return true;
1018     }
1019
1020     cgen = self->dest->expression.codegen;
1021     /* lvalue! */
1022     if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
1023         return false;
1024     self->expression.outl = left;
1025
1026     cgen = self->source->expression.codegen;
1027     /* rvalue! */
1028     if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1029         return false;
1030
1031     if (!ir_block_create_store_op(func->curblock, self->op, left, right))
1032         return false;
1033     self->expression.outr = right;
1034
1035     /* Theoretically, an assinment returns its left side as an
1036      * lvalue, if we don't need an lvalue though, we return
1037      * the right side as an rvalue, otherwise we have to
1038      * somehow know whether or not we need to dereference the pointer
1039      * on the left side - that is: OP_LOAD if it was an address.
1040      * Also: in original QC we cannot OP_LOADP *anyway*.
1041      */
1042     *out = (lvalue ? left : right);
1043
1044     return true;
1045 }
1046
1047 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
1048 {
1049     ast_expression_codegen *cgen;
1050     ir_value *left, *right;
1051
1052     /* In the context of a binary operation, we can disregard
1053      * the lvalue flag.
1054      */
1055     (void)lvalue;
1056     if (self->expression.outr) {
1057         *out = self->expression.outr;
1058         return true;
1059     }
1060
1061     cgen = self->left->expression.codegen;
1062     /* lvalue! */
1063     if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
1064         return false;
1065
1066     cgen = self->right->expression.codegen;
1067     /* rvalue! */
1068     if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
1069         return false;
1070
1071     *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
1072                                  self->op, left, right);
1073     if (!*out)
1074         return false;
1075     self->expression.outr = *out;
1076
1077     return true;
1078 }
1079
1080 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
1081 {
1082     ast_expression_codegen *cgen;
1083     ir_value *leftl, *leftr, *right, *bin;
1084
1085     if (lvalue && self->expression.outl) {
1086         *out = self->expression.outl;
1087         return true;
1088     }
1089
1090     if (!lvalue && self->expression.outr) {
1091         *out = self->expression.outr;
1092         return true;
1093     }
1094
1095     /* for a binstore we need both an lvalue and an rvalue for the left side */
1096     /* rvalue of destination! */
1097     cgen = self->dest->expression.codegen;
1098     if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
1099         return false;
1100
1101     /* source as rvalue only */
1102     cgen = self->source->expression.codegen;
1103     if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
1104         return false;
1105
1106     /* now the binary */
1107     bin = ir_block_create_binop(func->curblock, ast_function_label(func, "binst"),
1108                                 self->opbin, leftr, right);
1109     self->expression.outr = bin;
1110
1111     /* now store them */
1112     cgen = self->dest->expression.codegen;
1113     /* lvalue of destination */
1114     if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
1115         return false;
1116     self->expression.outl = leftl;
1117
1118     if (!ir_block_create_store_op(func->curblock, self->opstore, leftl, bin))
1119         return false;
1120     self->expression.outr = bin;
1121
1122     /* Theoretically, an assinment returns its left side as an
1123      * lvalue, if we don't need an lvalue though, we return
1124      * the right side as an rvalue, otherwise we have to
1125      * somehow know whether or not we need to dereference the pointer
1126      * on the left side - that is: OP_LOAD if it was an address.
1127      * Also: in original QC we cannot OP_LOADP *anyway*.
1128      */
1129     *out = (lvalue ? leftl : bin);
1130
1131     return true;
1132 }
1133
1134 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
1135 {
1136     ast_expression_codegen *cgen;
1137     ir_value *operand;
1138
1139     /* In the context of a unary operation, we can disregard
1140      * the lvalue flag.
1141      */
1142     (void)lvalue;
1143     if (self->expression.outr) {
1144         *out = self->expression.outr;
1145         return true;
1146     }
1147
1148     cgen = self->operand->expression.codegen;
1149     /* lvalue! */
1150     if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1151         return false;
1152
1153     *out = ir_block_create_unary(func->curblock, ast_function_label(func, "unary"),
1154                                  self->op, operand);
1155     if (!*out)
1156         return false;
1157     self->expression.outr = *out;
1158
1159     return true;
1160 }
1161
1162 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
1163 {
1164     ast_expression_codegen *cgen;
1165     ir_value *operand;
1166
1167     /* In the context of a return operation, we can disregard
1168      * the lvalue flag.
1169      */
1170     (void)lvalue;
1171     if (self->expression.outr) {
1172         asterror(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!\n");
1173         return false;
1174     }
1175     self->expression.outr = (ir_value*)1;
1176
1177     if (self->operand) {
1178         cgen = self->operand->expression.codegen;
1179         /* lvalue! */
1180         if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
1181             return false;
1182
1183         if (!ir_block_create_return(func->curblock, operand))
1184             return false;
1185     } else {
1186         if (!ir_block_create_return(func->curblock, NULL))
1187             return false;
1188     }
1189
1190     return true;
1191 }
1192
1193 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
1194 {
1195     ast_expression_codegen *cgen;
1196     ir_value *ent, *field;
1197
1198     /* This function needs to take the 'lvalue' flag into account!
1199      * As lvalue we provide a field-pointer, as rvalue we provide the
1200      * value in a temp.
1201      */
1202
1203     if (lvalue && self->expression.outl) {
1204         *out = self->expression.outl;
1205         return true;
1206     }
1207
1208     if (!lvalue && self->expression.outr) {
1209         *out = self->expression.outr;
1210         return true;
1211     }
1212
1213     cgen = self->entity->expression.codegen;
1214     if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
1215         return false;
1216
1217     cgen = self->field->expression.codegen;
1218     if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
1219         return false;
1220
1221     if (lvalue) {
1222         /* address! */
1223         *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
1224                                             ent, field);
1225     } else {
1226         *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
1227                                              ent, field, self->expression.vtype);
1228     }
1229     if (!*out) {
1230         asterror(ast_ctx(self), "failed to create %s instruction (output type %s)",
1231                  (lvalue ? "ADDRESS" : "FIELD"),
1232                  type_name[self->expression.vtype]);
1233         return false;
1234     }
1235
1236     if (lvalue)
1237         self->expression.outl = *out;
1238     else
1239         self->expression.outr = *out;
1240
1241     /* Hm that should be it... */
1242     return true;
1243 }
1244
1245 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
1246 {
1247     ast_expression_codegen *cgen;
1248     ir_value *vec;
1249
1250     /* in QC this is always an lvalue */
1251     (void)lvalue;
1252     if (self->expression.outl) {
1253         *out = self->expression.outl;
1254         return true;
1255     }
1256
1257     cgen = self->owner->expression.codegen;
1258     if (!(*cgen)((ast_expression*)(self->owner), func, true, &vec))
1259         return false;
1260
1261     if (vec->vtype != TYPE_VECTOR &&
1262         !(vec->vtype == TYPE_FIELD && self->owner->expression.next->expression.vtype == TYPE_VECTOR))
1263     {
1264         return false;
1265     }
1266
1267     *out = ir_value_vector_member(vec, self->field);
1268     self->expression.outl = *out;
1269
1270     return (*out != NULL);
1271 }
1272
1273 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
1274 {
1275     ast_expression_codegen *cgen;
1276
1277     ir_value *condval;
1278     ir_value *dummy;
1279
1280     ir_block *cond = func->curblock;
1281     ir_block *ontrue;
1282     ir_block *onfalse;
1283     ir_block *merge;
1284
1285     /* We don't output any value, thus also don't care about r/lvalue */
1286     (void)out;
1287     (void)lvalue;
1288
1289     if (self->expression.outr) {
1290         asterror(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!\n");
1291         return false;
1292     }
1293     self->expression.outr = (ir_value*)1;
1294
1295     /* generate the condition */
1296     func->curblock = cond;
1297     cgen = self->cond->expression.codegen;
1298     if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1299         return false;
1300
1301     /* on-true path */
1302
1303     if (self->on_true) {
1304         /* create on-true block */
1305         ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
1306         if (!ontrue)
1307             return false;
1308
1309         /* enter the block */
1310         func->curblock = ontrue;
1311
1312         /* generate */
1313         cgen = self->on_true->expression.codegen;
1314         if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
1315             return false;
1316     } else
1317         ontrue = NULL;
1318
1319     /* on-false path */
1320     if (self->on_false) {
1321         /* create on-false block */
1322         onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
1323         if (!onfalse)
1324             return false;
1325
1326         /* enter the block */
1327         func->curblock = onfalse;
1328
1329         /* generate */
1330         cgen = self->on_false->expression.codegen;
1331         if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
1332             return false;
1333     } else
1334         onfalse = NULL;
1335
1336     /* Merge block were they all merge in to */
1337     merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
1338     if (!merge)
1339         return false;
1340
1341     /* add jumps ot the merge block */
1342     if (ontrue && !ontrue->final && !ir_block_create_jump(ontrue, merge))
1343         return false;
1344     if (onfalse && !onfalse->final && !ir_block_create_jump(onfalse, merge))
1345         return false;
1346
1347     /* we create the if here, that way all blocks are ordered :)
1348      */
1349     if (!ir_block_create_if(cond, condval,
1350                             (ontrue  ? ontrue  : merge),
1351                             (onfalse ? onfalse : merge)))
1352     {
1353         return false;
1354     }
1355
1356     /* Now enter the merge block */
1357     func->curblock = merge;
1358
1359     return true;
1360 }
1361
1362 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
1363 {
1364     ast_expression_codegen *cgen;
1365
1366     ir_value *condval;
1367     ir_value *trueval, *falseval;
1368     ir_instr *phi;
1369
1370     ir_block *cond = func->curblock;
1371     ir_block *ontrue;
1372     ir_block *onfalse;
1373     ir_block *merge;
1374
1375     /* Ternary can never create an lvalue... */
1376     if (lvalue)
1377         return false;
1378
1379     /* In theory it shouldn't be possible to pass through a node twice, but
1380      * in case we add any kind of optimization pass for the AST itself, it
1381      * may still happen, thus we remember a created ir_value and simply return one
1382      * if it already exists.
1383      */
1384     if (self->phi_out) {
1385         *out = self->phi_out;
1386         return true;
1387     }
1388
1389     /* In the following, contraty to ast_ifthen, we assume both paths exist. */
1390
1391     /* generate the condition */
1392     func->curblock = cond;
1393     cgen = self->cond->expression.codegen;
1394     if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
1395         return false;
1396
1397     /* create on-true block */
1398     ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
1399     if (!ontrue)
1400         return false;
1401     else
1402     {
1403         /* enter the block */
1404         func->curblock = ontrue;
1405
1406         /* generate */
1407         cgen = self->on_true->expression.codegen;
1408         if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
1409             return false;
1410     }
1411
1412     /* create on-false block */
1413     onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
1414     if (!onfalse)
1415         return false;
1416     else
1417     {
1418         /* enter the block */
1419         func->curblock = onfalse;
1420
1421         /* generate */
1422         cgen = self->on_false->expression.codegen;
1423         if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
1424             return false;
1425     }
1426
1427     /* create merge block */
1428     merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
1429     if (!merge)
1430         return false;
1431     /* jump to merge block */
1432     if (!ir_block_create_jump(ontrue, merge))
1433         return false;
1434     if (!ir_block_create_jump(onfalse, merge))
1435         return false;
1436
1437     /* create if instruction */
1438     if (!ir_block_create_if(cond, condval, ontrue, onfalse))
1439         return false;
1440
1441     /* Now enter the merge block */
1442     func->curblock = merge;
1443
1444     /* Here, now, we need a PHI node
1445      * but first some sanity checking...
1446      */
1447     if (trueval->vtype != falseval->vtype) {
1448         /* error("ternary with different types on the two sides"); */
1449         return false;
1450     }
1451
1452     /* create PHI */
1453     phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
1454     if (!phi ||
1455         !ir_phi_add(phi, ontrue,  trueval) ||
1456         !ir_phi_add(phi, onfalse, falseval))
1457     {
1458         return false;
1459     }
1460
1461     self->phi_out = ir_phi_value(phi);
1462     *out = self->phi_out;
1463
1464     return true;
1465 }
1466
1467 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
1468 {
1469     ast_expression_codegen *cgen;
1470
1471     ir_value *dummy      = NULL;
1472     ir_value *precond    = NULL;
1473     ir_value *postcond   = NULL;
1474
1475     /* Since we insert some jumps "late" so we have blocks
1476      * ordered "nicely", we need to keep track of the actual end-blocks
1477      * of expressions to add the jumps to.
1478      */
1479     ir_block *bbody      = NULL, *end_bbody      = NULL;
1480     ir_block *bprecond   = NULL, *end_bprecond   = NULL;
1481     ir_block *bpostcond  = NULL, *end_bpostcond  = NULL;
1482     ir_block *bincrement = NULL, *end_bincrement = NULL;
1483     ir_block *bout       = NULL, *bin            = NULL;
1484
1485     /* let's at least move the outgoing block to the end */
1486     size_t    bout_id;
1487
1488     /* 'break' and 'continue' need to be able to find the right blocks */
1489     ir_block *bcontinue     = NULL;
1490     ir_block *bbreak        = NULL;
1491
1492     ir_block *old_bcontinue = NULL;
1493     ir_block *old_bbreak    = NULL;
1494
1495     ir_block *tmpblock      = NULL;
1496
1497     (void)lvalue;
1498     (void)out;
1499
1500     if (self->expression.outr) {
1501         asterror(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!\n");
1502         return false;
1503     }
1504     self->expression.outr = (ir_value*)1;
1505
1506     /* NOTE:
1507      * Should we ever need some kind of block ordering, better make this function
1508      * move blocks around than write a block ordering algorithm later... after all
1509      * the ast and ir should work together, not against each other.
1510      */
1511
1512     /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1513      * anyway if for example it contains a ternary.
1514      */
1515     if (self->initexpr)
1516     {
1517         cgen = self->initexpr->expression.codegen;
1518         if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1519             return false;
1520     }
1521
1522     /* Store the block from which we enter this chaos */
1523     bin = func->curblock;
1524
1525     /* The pre-loop condition needs its own block since we
1526      * need to be able to jump to the start of that expression.
1527      */
1528     if (self->precond)
1529     {
1530         bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1531         if (!bprecond)
1532             return false;
1533
1534         /* the pre-loop-condition the least important place to 'continue' at */
1535         bcontinue = bprecond;
1536
1537         /* enter */
1538         func->curblock = bprecond;
1539
1540         /* generate */
1541         cgen = self->precond->expression.codegen;
1542         if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1543             return false;
1544
1545         end_bprecond = func->curblock;
1546     } else {
1547         bprecond = end_bprecond = NULL;
1548     }
1549
1550     /* Now the next blocks won't be ordered nicely, but we need to
1551      * generate them this early for 'break' and 'continue'.
1552      */
1553     if (self->increment) {
1554         bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1555         if (!bincrement)
1556             return false;
1557         bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1558     } else {
1559         bincrement = end_bincrement = NULL;
1560     }
1561
1562     if (self->postcond) {
1563         bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1564         if (!bpostcond)
1565             return false;
1566         bcontinue = bpostcond; /* postcond comes before the increment */
1567     } else {
1568         bpostcond = end_bpostcond = NULL;
1569     }
1570
1571     bout_id = func->ir_func->blocks_count;
1572     bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1573     if (!bout)
1574         return false;
1575     bbreak = bout;
1576
1577     /* The loop body... */
1578     if (self->body)
1579     {
1580         bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1581         if (!bbody)
1582             return false;
1583
1584         /* enter */
1585         func->curblock = bbody;
1586
1587         old_bbreak          = func->breakblock;
1588         old_bcontinue       = func->continueblock;
1589         func->breakblock    = bbreak;
1590         func->continueblock = bcontinue;
1591
1592         /* generate */
1593         cgen = self->body->expression.codegen;
1594         if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1595             return false;
1596
1597         end_bbody = func->curblock;
1598         func->breakblock    = old_bbreak;
1599         func->continueblock = old_bcontinue;
1600     }
1601
1602     /* post-loop-condition */
1603     if (self->postcond)
1604     {
1605         /* enter */
1606         func->curblock = bpostcond;
1607
1608         /* generate */
1609         cgen = self->postcond->expression.codegen;
1610         if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1611             return false;
1612
1613         end_bpostcond = func->curblock;
1614     }
1615
1616     /* The incrementor */
1617     if (self->increment)
1618     {
1619         /* enter */
1620         func->curblock = bincrement;
1621
1622         /* generate */
1623         cgen = self->increment->expression.codegen;
1624         if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1625             return false;
1626
1627         end_bincrement = func->curblock;
1628     }
1629
1630     /* In any case now, we continue from the outgoing block */
1631     func->curblock = bout;
1632
1633     /* Now all blocks are in place */
1634     /* From 'bin' we jump to whatever comes first */
1635     if      (bprecond)   tmpblock = bprecond;
1636     else if (bbody)      tmpblock = bbody;
1637     else if (bpostcond)  tmpblock = bpostcond;
1638     else                 tmpblock = bout;
1639     if (!ir_block_create_jump(bin, tmpblock))
1640         return false;
1641
1642     /* From precond */
1643     if (bprecond)
1644     {
1645         ir_block *ontrue, *onfalse;
1646         if      (bbody)      ontrue = bbody;
1647         else if (bincrement) ontrue = bincrement;
1648         else if (bpostcond)  ontrue = bpostcond;
1649         else                 ontrue = bprecond;
1650         onfalse = bout;
1651         if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1652             return false;
1653     }
1654
1655     /* from body */
1656     if (bbody)
1657     {
1658         if      (bincrement) tmpblock = bincrement;
1659         else if (bpostcond)  tmpblock = bpostcond;
1660         else if (bprecond)   tmpblock = bprecond;
1661         else                 tmpblock = bout;
1662         if (!end_bbody->final && !ir_block_create_jump(end_bbody, tmpblock))
1663             return false;
1664     }
1665
1666     /* from increment */
1667     if (bincrement)
1668     {
1669         if      (bpostcond)  tmpblock = bpostcond;
1670         else if (bprecond)   tmpblock = bprecond;
1671         else if (bbody)      tmpblock = bbody;
1672         else                 tmpblock = bout;
1673         if (!ir_block_create_jump(end_bincrement, tmpblock))
1674             return false;
1675     }
1676
1677     /* from postcond */
1678     if (bpostcond)
1679     {
1680         ir_block *ontrue, *onfalse;
1681         if      (bprecond)   ontrue = bprecond;
1682         else if (bbody)      ontrue = bbody;
1683         else if (bincrement) ontrue = bincrement;
1684         else                 ontrue = bpostcond;
1685         onfalse = bout;
1686         if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1687             return false;
1688     }
1689
1690     /* Move 'bout' to the end */
1691     if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1692         !ir_function_blocks_add(func->ir_func, bout))
1693     {
1694         ir_block_delete(bout);
1695         return false;
1696     }
1697
1698     return true;
1699 }
1700
1701 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1702 {
1703     ast_expression_codegen *cgen;
1704     ir_value_vector         params;
1705     ir_instr               *callinstr;
1706     size_t i;
1707
1708     ir_value *funval = NULL;
1709
1710     /* return values are never lvalues */
1711     (void)lvalue;
1712
1713     if (self->expression.outr) {
1714         *out = self->expression.outr;
1715         return true;
1716     }
1717
1718     cgen = self->func->expression.codegen;
1719     if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1720         return false;
1721     if (!funval)
1722         return false;
1723
1724     MEM_VECTOR_INIT(&params, v);
1725
1726     /* parameters */
1727     for (i = 0; i < self->params_count; ++i)
1728     {
1729         ir_value *param;
1730         ast_expression *expr = self->params[i];
1731
1732         cgen = expr->expression.codegen;
1733         if (!(*cgen)(expr, func, false, &param))
1734             goto error;
1735         if (!param)
1736             goto error;
1737         if (!ir_value_vector_v_add(&params, param))
1738             goto error;
1739     }
1740
1741     callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1742     if (!callinstr)
1743         goto error;
1744
1745     for (i = 0; i < params.v_count; ++i) {
1746         if (!ir_call_param(callinstr, params.v[i]))
1747             goto error;
1748     }
1749
1750     *out = ir_call_value(callinstr);
1751     self->expression.outr = *out;
1752
1753     MEM_VECTOR_CLEAR(&params, v);
1754     return true;
1755 error:
1756     MEM_VECTOR_CLEAR(&params, v);
1757     return false;
1758 }