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