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