ast.c

   1 /*
   2  * Copyright (C) 2012, 2013
   3  *     Wolfgang Bumiller
   4  *     Dale Weiler
   5  *
   6  * Permission is hereby granted, free of charge, to any person obtaining a copy of
   7  * this software and associated documentation files (the "Software"), to deal in
   8  * the Software without restriction, including without limitation the rights to
   9  * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
  10  * of the Software, and to permit persons to whom the Software is furnished to do
  11  * so, subject to the following conditions:
  12  *
  13  * The above copyright notice and this permission notice shall be included in all
  14  * copies or substantial portions of the Software.
  15  *
  16  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  17  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  18  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  19  * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  20  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  21  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  22  * SOFTWARE.
  23  */
  24 #include <stdlib.h>
  25 #include <string.h>
  26
  27 #include "gmqcc.h"
  28 #include "ast.h"
  29 #include "parser.h"
  30
  31 #define ast_instantiate(T, ctx, destroyfn)                          \
  32     T* self = (T*)mem_a(sizeof(T));                                 \
  33     if (!self) {                                                    \
  34         return NULL;                                                \
  35     }                                                               \
  36     ast_node_init((ast_node*)self, ctx, TYPE_##T);                  \
  37     ( (ast_node*)self )->destroy = (ast_node_delete*)destroyfn
  38
  39 /*
  40  * forward declarations, these need not be in ast.h for obvious
  41  * static reasons.
  42  */
  43 static bool ast_member_codegen(ast_member*, ast_function*, bool lvalue, ir_value**);
  44 static void ast_array_index_delete(ast_array_index*);
  45 static bool ast_array_index_codegen(ast_array_index*, ast_function*, bool lvalue, ir_value**);
  46 static void ast_argpipe_delete(ast_argpipe*);
  47 static bool ast_argpipe_codegen(ast_argpipe*, ast_function*, bool lvalue, ir_value**);
  48 static void ast_store_delete(ast_store*);
  49 static bool ast_store_codegen(ast_store*, ast_function*, bool lvalue, ir_value**);
  50 static void ast_ifthen_delete(ast_ifthen*);
  51 static bool ast_ifthen_codegen(ast_ifthen*, ast_function*, bool lvalue, ir_value**);
  52 static void ast_ternary_delete(ast_ternary*);
  53 static bool ast_ternary_codegen(ast_ternary*, ast_function*, bool lvalue, ir_value**);
  54 static void ast_loop_delete(ast_loop*);
  55 static bool ast_loop_codegen(ast_loop*, ast_function*, bool lvalue, ir_value**);
  56 static void ast_breakcont_delete(ast_breakcont*);
  57 static bool ast_breakcont_codegen(ast_breakcont*, ast_function*, bool lvalue, ir_value**);
  58 static void ast_switch_delete(ast_switch*);
  59 static bool ast_switch_codegen(ast_switch*, ast_function*, bool lvalue, ir_value**);
  60 static void ast_label_delete(ast_label*);
  61 static void ast_label_register_goto(ast_label*, ast_goto*);
  62 static bool ast_label_codegen(ast_label*, ast_function*, bool lvalue, ir_value**);
  63 static bool ast_goto_codegen(ast_goto*, ast_function*, bool lvalue, ir_value**);
  64 static void ast_goto_delete(ast_goto*);
  65 static void ast_call_delete(ast_call*);
  66 static bool ast_call_codegen(ast_call*, ast_function*, bool lvalue, ir_value**);
  67 static bool ast_block_codegen(ast_block*, ast_function*, bool lvalue, ir_value**);
  68 static void ast_unary_delete(ast_unary*);
  69 static bool ast_unary_codegen(ast_unary*, ast_function*, bool lvalue, ir_value**);
  70 static void ast_entfield_delete(ast_entfield*);
  71 static bool ast_entfield_codegen(ast_entfield*, ast_function*, bool lvalue, ir_value**);
  72 static void ast_return_delete(ast_return*);
  73 static bool ast_return_codegen(ast_return*, ast_function*, bool lvalue, ir_value**);
  74 static void ast_binstore_delete(ast_binstore*);
  75 static bool ast_binstore_codegen(ast_binstore*, ast_function*, bool lvalue, ir_value**);
  76 static void ast_binary_delete(ast_binary*);
  77 static bool ast_binary_codegen(ast_binary*, ast_function*, bool lvalue, ir_value**);
  78
  79 /* It must not be possible to get here. */
  80 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
  81 {
  82     (void)self;
  83     con_err("ast node missing destroy()\n");
  84     exit(EXIT_FAILURE);
  85 }
  86
  87 /* Initialize main ast node aprts */
  88 static void ast_node_init(ast_node *self, lex_ctx_t ctx, int nodetype)
  89 {
  90     self->context = ctx;
  91     self->destroy = &_ast_node_destroy;
  92     self->keep    = false;
  93     self->nodetype = nodetype;
  94     self->side_effects = false;
  95 }
  96
  97 /* weight and side effects */
  98 static void _ast_propagate_effects(ast_node *self, ast_node *other)
  99 {
 100     if (ast_side_effects(other))
 101         ast_side_effects(self) = true;
 102 }
 103 #define ast_propagate_effects(s,o) _ast_propagate_effects(((ast_node*)(s)), ((ast_node*)(o)))
 104
 105 /* General expression initialization */
 106 static void ast_expression_init(ast_expression *self,
 107                                 ast_expression_codegen *codegen)
 108 {
 109     self->codegen  = codegen;
 110     self->vtype    = TYPE_VOID;
 111     self->next     = NULL;
 112     self->outl     = NULL;
 113     self->outr     = NULL;
 114     self->params   = NULL;
 115     self->count    = 0;
 116     self->flags    = 0;
 117     self->varparam = NULL;
 118 }
 119
 120 static void ast_expression_delete(ast_expression *self)
 121 {
 122     size_t i;
 123     if (self->next)
 124         ast_delete(self->next);
 125     for (i = 0; i < vec_size(self->params); ++i) {
 126         ast_delete(self->params[i]);
 127     }
 128     vec_free(self->params);
 129     if (self->varparam)
 130         ast_delete(self->varparam);
 131 }
 132
 133 static void ast_expression_delete_full(ast_expression *self)
 134 {
 135     ast_expression_delete(self);
 136     mem_d(self);
 137 }
 138
 139 ast_value* ast_value_copy(const ast_value *self)
 140 {
 141     size_t i;
 142     const ast_expression *fromex;
 143     ast_expression       *selfex;
 144     ast_value *cp = ast_value_new(self->expression.node.context, self->name, self->expression.vtype);
 145     if (self->expression.next) {
 146         cp->expression.next = ast_type_copy(self->expression.node.context, self->expression.next);
 147     }
 148     fromex   = &self->expression;
 149     selfex = &cp->expression;
 150     selfex->count    = fromex->count;
 151     selfex->flags    = fromex->flags;
 152     for (i = 0; i < vec_size(fromex->params); ++i) {
 153         ast_value *v = ast_value_copy(fromex->params[i]);
 154         vec_push(selfex->params, v);
 155     }
 156     return cp;
 157 }
 158
 159 void ast_type_adopt_impl(ast_expression *self, const ast_expression *other)
 160 {
 161     size_t i;
 162     const ast_expression *fromex;
 163     ast_expression       *selfex;
 164     self->vtype = other->vtype;
 165     if (other->next) {
 166         self->next = (ast_expression*)ast_type_copy(ast_ctx(self), other->next);
 167     }
 168     fromex = other;
 169     selfex = self;
 170     selfex->count    = fromex->count;
 171     selfex->flags    = fromex->flags;
 172     for (i = 0; i < vec_size(fromex->params); ++i) {
 173         ast_value *v = ast_value_copy(fromex->params[i]);
 174         vec_push(selfex->params, v);
 175     }
 176 }
 177
 178 static ast_expression* ast_shallow_type(lex_ctx_t ctx, int vtype)
 179 {
 180     ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
 181     ast_expression_init(self, NULL);
 182     self->codegen = NULL;
 183     self->next    = NULL;
 184     self->vtype   = vtype;
 185     return self;
 186 }
 187
 188 ast_expression* ast_type_copy(lex_ctx_t ctx, const ast_expression *ex)
 189 {
 190     size_t i;
 191     const ast_expression *fromex;
 192     ast_expression       *selfex;
 193
 194     if (!ex)
 195         return NULL;
 196     else
 197     {
 198         ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
 199         ast_expression_init(self, NULL);
 200
 201         fromex = ex;
 202         selfex = self;
 203
 204         /* This may never be codegen()d */
 205         selfex->codegen = NULL;
 206
 207         selfex->vtype = fromex->vtype;
 208         if (fromex->next)
 209             selfex->next = ast_type_copy(ctx, fromex->next);
 210         else
 211             selfex->next = NULL;
 212
 213         selfex->count    = fromex->count;
 214         selfex->flags    = fromex->flags;
 215         for (i = 0; i < vec_size(fromex->params); ++i) {
 216             ast_value *v = ast_value_copy(fromex->params[i]);
 217             vec_push(selfex->params, v);
 218         }
 219
 220         return self;
 221     }
 222 }
 223
 224 bool ast_compare_type(ast_expression *a, ast_expression *b)
 225 {
 226     if (a->vtype == TYPE_NIL ||
 227         b->vtype == TYPE_NIL)
 228         return true;
 229     if (a->vtype != b->vtype)
 230         return false;
 231     if (!a->next != !b->next)
 232         return false;
 233     if (vec_size(a->params) != vec_size(b->params))
 234         return false;
 235     if ((a->flags & AST_FLAG_TYPE_MASK) !=
 236         (b->flags & AST_FLAG_TYPE_MASK) )
 237     {
 238         return false;
 239     }
 240     if (vec_size(a->params)) {
 241         size_t i;
 242         for (i = 0; i < vec_size(a->params); ++i) {
 243             if (!ast_compare_type((ast_expression*)a->params[i],
 244                                   (ast_expression*)b->params[i]))
 245                 return false;
 246         }
 247     }
 248     if (a->next)
 249         return ast_compare_type(a->next, b->next);
 250     return true;
 251 }
 252
 253 static size_t ast_type_to_string_impl(ast_expression *e, char *buf, size_t bufsize, size_t pos)
 254 {
 255     const char *typestr;
 256     size_t typelen;
 257     size_t i;
 258
 259     if (!e) {
 260         if (pos + 6 >= bufsize)
 261             goto full;
 262         util_strncpy(buf + pos, "(null)", 6);
 263         return pos + 6;
 264     }
 265
 266     if (pos + 1 >= bufsize)
 267         goto full;
 268
 269     switch (e->vtype) {
 270         case TYPE_VARIANT:
 271             util_strncpy(buf + pos, "(variant)", 9);
 272             return pos + 9;
 273
 274         case TYPE_FIELD:
 275             buf[pos++] = '.';
 276             return ast_type_to_string_impl(e->next, buf, bufsize, pos);
 277
 278         case TYPE_POINTER:
 279             if (pos + 3 >= bufsize)
 280                 goto full;
 281             buf[pos++] = '*';
 282             buf[pos++] = '(';
 283             pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
 284             if (pos + 1 >= bufsize)
 285                 goto full;
 286             buf[pos++] = ')';
 287             return pos;
 288
 289         case TYPE_FUNCTION:
 290             pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
 291             if (pos + 2 >= bufsize)
 292                 goto full;
 293             if (!vec_size(e->params)) {
 294                 buf[pos++] = '(';
 295                 buf[pos++] = ')';
 296                 return pos;
 297             }
 298             buf[pos++] = '(';
 299             pos = ast_type_to_string_impl((ast_expression*)(e->params[0]), buf, bufsize, pos);
 300             for (i = 1; i < vec_size(e->params); ++i) {
 301                 if (pos + 2 >= bufsize)
 302                     goto full;
 303                 buf[pos++] = ',';
 304                 buf[pos++] = ' ';
 305                 pos = ast_type_to_string_impl((ast_expression*)(e->params[i]), buf, bufsize, pos);
 306             }
 307             if (pos + 1 >= bufsize)
 308                 goto full;
 309             buf[pos++] = ')';
 310             return pos;
 311
 312         case TYPE_ARRAY:
 313             pos = ast_type_to_string_impl(e->next, buf, bufsize, pos);
 314             if (pos + 1 >= bufsize)
 315                 goto full;
 316             buf[pos++] = '[';
 317             pos += util_snprintf(buf + pos, bufsize - pos - 1, "%i", (int)e->count);
 318             if (pos + 1 >= bufsize)
 319                 goto full;
 320             buf[pos++] = ']';
 321             return pos;
 322
 323         default:
 324             typestr = type_name[e->vtype];
 325             typelen = strlen(typestr);
 326             if (pos + typelen >= bufsize)
 327                 goto full;
 328             util_strncpy(buf + pos, typestr, typelen);
 329             return pos + typelen;
 330     }
 331
 332 full:
 333     buf[bufsize-3] = '.';
 334     buf[bufsize-2] = '.';
 335     buf[bufsize-1] = '.';
 336     return bufsize;
 337 }
 338
 339 void ast_type_to_string(ast_expression *e, char *buf, size_t bufsize)
 340 {
 341     size_t pos = ast_type_to_string_impl(e, buf, bufsize-1, 0);
 342     buf[pos] = 0;
 343 }
 344
 345 static bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out);
 346 ast_value* ast_value_new(lex_ctx_t ctx, const char *name, int t)
 347 {
 348     ast_instantiate(ast_value, ctx, ast_value_delete);
 349     ast_expression_init((ast_expression*)self,
 350                         (ast_expression_codegen*)&ast_value_codegen);
 351     self->expression.node.keep = true; /* keep */
 352
 353     self->name = name ? util_strdup(name) : NULL;
 354     self->expression.vtype = t;
 355     self->expression.next  = NULL;
 356     self->isfield  = false;
 357     self->cvq      = CV_NONE;
 358     self->hasvalue = false;
 359     self->isimm    = false;
 360     self->uses     = 0;
 361     memset(&self->constval, 0, sizeof(self->constval));
 362     self->initlist = NULL;
 363
 364     self->ir_v           = NULL;
 365     self->ir_values      = NULL;
 366     self->ir_value_count = 0;
 367
 368     self->setter = NULL;
 369     self->getter = NULL;
 370     self->desc   = NULL;
 371
 372     self->argcounter = NULL;
 373     self->intrinsic = false;
 374
 375     return self;
 376 }
 377
 378 void ast_value_delete(ast_value* self)
 379 {
 380     if (self->name)
 381         mem_d((void*)self->name);
 382     if (self->argcounter)
 383         mem_d((void*)self->argcounter);
 384     if (self->hasvalue) {
 385         switch (self->expression.vtype)
 386         {
 387         case TYPE_STRING:
 388             mem_d((void*)self->constval.vstring);
 389             break;
 390         case TYPE_FUNCTION:
 391             /* unlink us from the function node */
 392             self->constval.vfunc->vtype = NULL;
 393             break;
 394         /* NOTE: delete function? currently collected in
 395          * the parser structure
 396          */
 397         default:
 398             break;
 399         }
 400     }
 401     if (self->ir_values)
 402         mem_d(self->ir_values);
 403
 404     if (self->desc)
 405         mem_d(self->desc);
 406
 407     if (self->initlist) {
 408         if (self->expression.next->vtype == TYPE_STRING) {
 409             /* strings are allocated, free them */
 410             size_t i, len = vec_size(self->initlist);
 411             /* in theory, len should be expression.count
 412              * but let's not take any chances */
 413             for (i = 0; i < len; ++i) {
 414                 if (self->initlist[i].vstring)
 415                     mem_d(self->initlist[i].vstring);
 416             }
 417         }
 418         vec_free(self->initlist);
 419     }
 420
 421     ast_expression_delete((ast_expression*)self);
 422     mem_d(self);
 423 }
 424
 425 void ast_value_params_add(ast_value *self, ast_value *p)
 426 {
 427     vec_push(self->expression.params, p);
 428 }
 429
 430 bool ast_value_set_name(ast_value *self, const char *name)
 431 {
 432     if (self->name)
 433         mem_d((void*)self->name);
 434     self->name = util_strdup(name);
 435     return !!self->name;
 436 }
 437
 438 ast_binary* ast_binary_new(lex_ctx_t ctx, int op,
 439                            ast_expression* left, ast_expression* right)
 440 {
 441     ast_binary *fold;
 442     ast_instantiate(ast_binary, ctx, ast_binary_delete);
 443     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
 444
 445     self->op = op;
 446     self->left = left;
 447     self->right = right;
 448     self->right_first = false;
 449
 450     ast_propagate_effects(self, left);
 451     ast_propagate_effects(self, right);
 452
 453     if (OPTS_OPTIMIZATION(OPTIM_PEEPHOLE) && (fold = (ast_binary*)fold_superfluous(left, right, op))) {
 454         ast_binary_delete(self);
 455         return fold;
 456     }
 457
 458     if (op >= INSTR_EQ_F && op <= INSTR_GT)
 459         self->expression.vtype = TYPE_FLOAT;
 460     else if (op == INSTR_AND || op == INSTR_OR) {
 461         if (OPTS_FLAG(PERL_LOGIC))
 462             ast_type_adopt(self, right);
 463         else
 464             self->expression.vtype = TYPE_FLOAT;
 465     }
 466     else if (op == INSTR_BITAND || op == INSTR_BITOR)
 467         self->expression.vtype = TYPE_FLOAT;
 468     else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
 469         self->expression.vtype = TYPE_VECTOR;
 470     else if (op == INSTR_MUL_V)
 471         self->expression.vtype = TYPE_FLOAT;
 472     else
 473         self->expression.vtype = left->vtype;
 474
 475     /* references all */
 476     self->refs = AST_REF_ALL;
 477
 478     return self;
 479 }
 480
 481 void ast_binary_delete(ast_binary *self)
 482 {
 483     if (self->refs & AST_REF_LEFT)  ast_unref(self->left);
 484     if (self->refs & AST_REF_RIGHT) ast_unref(self->right);
 485
 486     ast_expression_delete((ast_expression*)self);
 487     mem_d(self);
 488 }
 489
 490 ast_binstore* ast_binstore_new(lex_ctx_t ctx, int storop, int op,
 491                                ast_expression* left, ast_expression* right)
 492 {
 493     ast_instantiate(ast_binstore, ctx, ast_binstore_delete);
 494     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binstore_codegen);
 495
 496     ast_side_effects(self) = true;
 497
 498     self->opstore = storop;
 499     self->opbin   = op;
 500     self->dest    = left;
 501     self->source  = right;
 502
 503     self->keep_dest = false;
 504
 505     ast_type_adopt(self, left);
 506     return self;
 507 }
 508
 509 void ast_binstore_delete(ast_binstore *self)
 510 {
 511     if (!self->keep_dest)
 512         ast_unref(self->dest);
 513     ast_unref(self->source);
 514     ast_expression_delete((ast_expression*)self);
 515     mem_d(self);
 516 }
 517
 518 ast_unary* ast_unary_new(lex_ctx_t ctx, int op,
 519                          ast_expression *expr)
 520 {
 521     ast_instantiate(ast_unary, ctx, ast_unary_delete);
 522     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_unary_codegen);
 523
 524     self->op      = op;
 525     self->operand = expr;
 526
 527
 528     if (ast_istype(expr, ast_unary) && OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
 529         ast_unary *prev = (ast_unary*)((ast_unary*)expr)->operand;
 530
 531         /* Handle for double negation */
 532         if (((ast_unary*)expr)->op == op)
 533             prev = (ast_unary*)((ast_unary*)expr)->operand;
 534
 535         if (ast_istype(prev, ast_unary)) {
 536             ast_expression_delete((ast_expression*)self);
 537             mem_d(self);
 538             ++opts_optimizationcount[OPTIM_PEEPHOLE];
 539             return prev;
 540         }
 541     }
 542
 543     ast_propagate_effects(self, expr);
 544
 545     if ((op >= INSTR_NOT_F && op <= INSTR_NOT_FNC) || op == VINSTR_NEG_F) {
 546         self->expression.vtype = TYPE_FLOAT;
 547     } else if (op == VINSTR_NEG_V) {
 548         self->expression.vtype = TYPE_VECTOR;
 549     } else {
 550         compile_error(ctx, "cannot determine type of unary operation %s", util_instr_str[op]);
 551     }
 552
 553     return self;
 554 }
 555
 556 void ast_unary_delete(ast_unary *self)
 557 {
 558     if (self->operand) ast_unref(self->operand);
 559     ast_expression_delete((ast_expression*)self);
 560     mem_d(self);
 561 }
 562
 563 ast_return* ast_return_new(lex_ctx_t ctx, ast_expression *expr)
 564 {
 565     ast_instantiate(ast_return, ctx, ast_return_delete);
 566     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_return_codegen);
 567
 568     self->operand = expr;
 569
 570     if (expr)
 571         ast_propagate_effects(self, expr);
 572
 573     return self;
 574 }
 575
 576 void ast_return_delete(ast_return *self)
 577 {
 578     if (self->operand)
 579         ast_unref(self->operand);
 580     ast_expression_delete((ast_expression*)self);
 581     mem_d(self);
 582 }
 583
 584 ast_entfield* ast_entfield_new(lex_ctx_t ctx, ast_expression *entity, ast_expression *field)
 585 {
 586     if (field->vtype != TYPE_FIELD) {
 587         compile_error(ctx, "ast_entfield_new with expression not of type field");
 588         return NULL;
 589     }
 590     return ast_entfield_new_force(ctx, entity, field, field->next);
 591 }
 592
 593 ast_entfield* ast_entfield_new_force(lex_ctx_t ctx, ast_expression *entity, ast_expression *field, const ast_expression *outtype)
 594 {
 595     ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
 596
 597     if (!outtype) {
 598         mem_d(self);
 599         /* Error: field has no type... */
 600         return NULL;
 601     }
 602
 603     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
 604
 605     self->entity = entity;
 606     self->field  = field;
 607     ast_propagate_effects(self, entity);
 608     ast_propagate_effects(self, field);
 609
 610     ast_type_adopt(self, outtype);
 611     return self;
 612 }
 613
 614 void ast_entfield_delete(ast_entfield *self)
 615 {
 616     ast_unref(self->entity);
 617     ast_unref(self->field);
 618     ast_expression_delete((ast_expression*)self);
 619     mem_d(self);
 620 }
 621
 622 ast_member* ast_member_new(lex_ctx_t ctx, ast_expression *owner, unsigned int field, const char *name)
 623 {
 624     ast_instantiate(ast_member, ctx, ast_member_delete);
 625     if (field >= 3) {
 626         mem_d(self);
 627         return NULL;
 628     }
 629
 630     if (owner->vtype != TYPE_VECTOR &&
 631         owner->vtype != TYPE_FIELD) {
 632         compile_error(ctx, "member-access on an invalid owner of type %s", type_name[owner->vtype]);
 633         mem_d(self);
 634         return NULL;
 635     }
 636
 637     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_member_codegen);
 638     self->expression.node.keep = true; /* keep */
 639
 640     if (owner->vtype == TYPE_VECTOR) {
 641         self->expression.vtype = TYPE_FLOAT;
 642         self->expression.next  = NULL;
 643     } else {
 644         self->expression.vtype = TYPE_FIELD;
 645         self->expression.next = ast_shallow_type(ctx, TYPE_FLOAT);
 646     }
 647
 648     self->rvalue = false;
 649     self->owner  = owner;
 650     ast_propagate_effects(self, owner);
 651
 652     self->field = field;
 653     if (name)
 654         self->name = util_strdup(name);
 655     else
 656         self->name = NULL;
 657
 658     return self;
 659 }
 660
 661 void ast_member_delete(ast_member *self)
 662 {
 663     /* The owner is always an ast_value, which has .keep=true,
 664      * also: ast_members are usually deleted after the owner, thus
 665      * this will cause invalid access
 666     ast_unref(self->owner);
 667      * once we allow (expression).x to access a vector-member, we need
 668      * to change this: preferably by creating an alternate ast node for this
 669      * purpose that is not garbage-collected.
 670     */
 671     ast_expression_delete((ast_expression*)self);
 672     mem_d(self->name);
 673     mem_d(self);
 674 }
 675
 676 bool ast_member_set_name(ast_member *self, const char *name)
 677 {
 678     if (self->name)
 679         mem_d((void*)self->name);
 680     self->name = util_strdup(name);
 681     return !!self->name;
 682 }
 683
 684 ast_array_index* ast_array_index_new(lex_ctx_t ctx, ast_expression *array, ast_expression *index)
 685 {
 686     ast_expression *outtype;
 687     ast_instantiate(ast_array_index, ctx, ast_array_index_delete);
 688
 689     outtype = array->next;
 690     if (!outtype) {
 691         mem_d(self);
 692         /* Error: field has no type... */
 693         return NULL;
 694     }
 695
 696     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_array_index_codegen);
 697
 698     self->array = array;
 699     self->index = index;
 700     ast_propagate_effects(self, array);
 701     ast_propagate_effects(self, index);
 702
 703     ast_type_adopt(self, outtype);
 704     if (array->vtype == TYPE_FIELD && outtype->vtype == TYPE_ARRAY) {
 705         if (self->expression.vtype != TYPE_ARRAY) {
 706             compile_error(ast_ctx(self), "array_index node on type");
 707             ast_array_index_delete(self);
 708             return NULL;
 709         }
 710         self->array = outtype;
 711         self->expression.vtype = TYPE_FIELD;
 712     }
 713
 714     return self;
 715 }
 716
 717 void ast_array_index_delete(ast_array_index *self)
 718 {
 719     if (self->array)
 720         ast_unref(self->array);
 721     if (self->index)
 722         ast_unref(self->index);
 723     ast_expression_delete((ast_expression*)self);
 724     mem_d(self);
 725 }
 726
 727 ast_argpipe* ast_argpipe_new(lex_ctx_t ctx, ast_expression *index)
 728 {
 729     ast_instantiate(ast_argpipe, ctx, ast_argpipe_delete);
 730     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_argpipe_codegen);
 731     self->index = index;
 732     self->expression.vtype = TYPE_NOEXPR;
 733     return self;
 734 }
 735
 736 void ast_argpipe_delete(ast_argpipe *self)
 737 {
 738     if (self->index)
 739         ast_unref(self->index);
 740     ast_expression_delete((ast_expression*)self);
 741     mem_d(self);
 742 }
 743
 744 ast_ifthen* ast_ifthen_new(lex_ctx_t ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
 745 {
 746     ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
 747     if (!ontrue && !onfalse) {
 748         /* because it is invalid */
 749         mem_d(self);
 750         return NULL;
 751     }
 752     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
 753
 754     self->cond     = cond;
 755     self->on_true  = ontrue;
 756     self->on_false = onfalse;
 757     ast_propagate_effects(self, cond);
 758     if (ontrue)
 759         ast_propagate_effects(self, ontrue);
 760     if (onfalse)
 761         ast_propagate_effects(self, onfalse);
 762
 763     return self;
 764 }
 765
 766 void ast_ifthen_delete(ast_ifthen *self)
 767 {
 768     ast_unref(self->cond);
 769     if (self->on_true)
 770         ast_unref(self->on_true);
 771     if (self->on_false)
 772         ast_unref(self->on_false);
 773     ast_expression_delete((ast_expression*)self);
 774     mem_d(self);
 775 }
 776
 777 ast_ternary* ast_ternary_new(lex_ctx_t ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
 778 {
 779     ast_expression *exprtype = ontrue;
 780     ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
 781     /* This time NEITHER must be NULL */
 782     if (!ontrue || !onfalse) {
 783         mem_d(self);
 784         return NULL;
 785     }
 786     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
 787
 788     self->cond     = cond;
 789     self->on_true  = ontrue;
 790     self->on_false = onfalse;
 791     ast_propagate_effects(self, cond);
 792     ast_propagate_effects(self, ontrue);
 793     ast_propagate_effects(self, onfalse);
 794
 795     if (ontrue->vtype == TYPE_NIL)
 796         exprtype = onfalse;
 797     ast_type_adopt(self, exprtype);
 798
 799     return self;
 800 }
 801
 802 void ast_ternary_delete(ast_ternary *self)
 803 {
 804     /* the if()s are only there because computed-gotos can set them
 805      * to NULL
 806      */
 807     if (self->cond)     ast_unref(self->cond);
 808     if (self->on_true)  ast_unref(self->on_true);
 809     if (self->on_false) ast_unref(self->on_false);
 810     ast_expression_delete((ast_expression*)self);
 811     mem_d(self);
 812 }
 813
 814 ast_loop* ast_loop_new(lex_ctx_t ctx,
 815                        ast_expression *initexpr,
 816                        ast_expression *precond, bool pre_not,
 817                        ast_expression *postcond, bool post_not,
 818                        ast_expression *increment,
 819                        ast_expression *body)
 820 {
 821     ast_instantiate(ast_loop, ctx, ast_loop_delete);
 822     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
 823
 824     self->initexpr  = initexpr;
 825     self->precond   = precond;
 826     self->postcond  = postcond;
 827     self->increment = increment;
 828     self->body      = body;
 829
 830     self->pre_not   = pre_not;
 831     self->post_not  = post_not;
 832
 833     if (initexpr)
 834         ast_propagate_effects(self, initexpr);
 835     if (precond)
 836         ast_propagate_effects(self, precond);
 837     if (postcond)
 838         ast_propagate_effects(self, postcond);
 839     if (increment)
 840         ast_propagate_effects(self, increment);
 841     if (body)
 842         ast_propagate_effects(self, body);
 843
 844     return self;
 845 }
 846
 847 void ast_loop_delete(ast_loop *self)
 848 {
 849     if (self->initexpr)
 850         ast_unref(self->initexpr);
 851     if (self->precond)
 852         ast_unref(self->precond);
 853     if (self->postcond)
 854         ast_unref(self->postcond);
 855     if (self->increment)
 856         ast_unref(self->increment);
 857     if (self->body)
 858         ast_unref(self->body);
 859     ast_expression_delete((ast_expression*)self);
 860     mem_d(self);
 861 }
 862
 863 ast_breakcont* ast_breakcont_new(lex_ctx_t ctx, bool iscont, unsigned int levels)
 864 {
 865     ast_instantiate(ast_breakcont, ctx, ast_breakcont_delete);
 866     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_breakcont_codegen);
 867
 868     self->is_continue = iscont;
 869     self->levels      = levels;
 870
 871     return self;
 872 }
 873
 874 void ast_breakcont_delete(ast_breakcont *self)
 875 {
 876     ast_expression_delete((ast_expression*)self);
 877     mem_d(self);
 878 }
 879
 880 ast_switch* ast_switch_new(lex_ctx_t ctx, ast_expression *op)
 881 {
 882     ast_instantiate(ast_switch, ctx, ast_switch_delete);
 883     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_switch_codegen);
 884
 885     self->operand = op;
 886     self->cases   = NULL;
 887
 888     ast_propagate_effects(self, op);
 889
 890     return self;
 891 }
 892
 893 void ast_switch_delete(ast_switch *self)
 894 {
 895     size_t i;
 896     ast_unref(self->operand);
 897
 898     for (i = 0; i < vec_size(self->cases); ++i) {
 899         if (self->cases[i].value)
 900             ast_unref(self->cases[i].value);
 901         ast_unref(self->cases[i].code);
 902     }
 903     vec_free(self->cases);
 904
 905     ast_expression_delete((ast_expression*)self);
 906     mem_d(self);
 907 }
 908
 909 ast_label* ast_label_new(lex_ctx_t ctx, const char *name, bool undefined)
 910 {
 911     ast_instantiate(ast_label, ctx, ast_label_delete);
 912     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_label_codegen);
 913
 914     self->expression.vtype = TYPE_NOEXPR;
 915
 916     self->name      = util_strdup(name);
 917     self->irblock   = NULL;
 918     self->gotos     = NULL;
 919     self->undefined = undefined;
 920
 921     return self;
 922 }
 923
 924 void ast_label_delete(ast_label *self)
 925 {
 926     mem_d((void*)self->name);
 927     vec_free(self->gotos);
 928     ast_expression_delete((ast_expression*)self);
 929     mem_d(self);
 930 }
 931
 932 static void ast_label_register_goto(ast_label *self, ast_goto *g)
 933 {
 934     vec_push(self->gotos, g);
 935 }
 936
 937 ast_goto* ast_goto_new(lex_ctx_t ctx, const char *name)
 938 {
 939     ast_instantiate(ast_goto, ctx, ast_goto_delete);
 940     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_goto_codegen);
 941
 942     self->name    = util_strdup(name);
 943     self->target  = NULL;
 944     self->irblock_from = NULL;
 945
 946     return self;
 947 }
 948
 949 void ast_goto_delete(ast_goto *self)
 950 {
 951     mem_d((void*)self->name);
 952     ast_expression_delete((ast_expression*)self);
 953     mem_d(self);
 954 }
 955
 956 void ast_goto_set_label(ast_goto *self, ast_label *label)
 957 {
 958     self->target = label;
 959 }
 960
 961 ast_call* ast_call_new(lex_ctx_t ctx,
 962                        ast_expression *funcexpr)
 963 {
 964     ast_instantiate(ast_call, ctx, ast_call_delete);
 965     if (!funcexpr->next) {
 966         compile_error(ctx, "not a function");
 967         mem_d(self);
 968         return NULL;
 969     }
 970     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
 971
 972     ast_side_effects(self) = true;
 973
 974     self->params   = NULL;
 975     self->func     = funcexpr;
 976     self->va_count = NULL;
 977
 978     ast_type_adopt(self, funcexpr->next);
 979
 980     return self;
 981 }
 982
 983 void ast_call_delete(ast_call *self)
 984 {
 985     size_t i;
 986     for (i = 0; i < vec_size(self->params); ++i)
 987         ast_unref(self->params[i]);
 988     vec_free(self->params);
 989
 990     if (self->func)
 991         ast_unref(self->func);
 992
 993     if (self->va_count)
 994         ast_unref(self->va_count);
 995
 996     ast_expression_delete((ast_expression*)self);
 997     mem_d(self);
 998 }
 999
1000 static bool ast_call_check_vararg(ast_call *self, ast_expression *va_type, ast_expression *exp_type)
1001 {
1002     char texp[1024];
1003     char tgot[1024];
1004     if (!exp_type)
1005         return true;
1006     if (!va_type || !ast_compare_type(va_type, exp_type))
1007     {
1008         if (va_type && exp_type)
1009         {
1010             ast_type_to_string(va_type,  tgot, sizeof(tgot));
1011             ast_type_to_string(exp_type, texp, sizeof(texp));
1012             if (OPTS_FLAG(UNSAFE_VARARGS)) {
1013                 if (compile_warning(ast_ctx(self), WARN_UNSAFE_TYPES,
1014                                     "piped variadic argument differs in type: constrained to type %s, expected type %s",
1015                                     tgot, texp))
1016                     return false;
1017             } else {
1018                 compile_error(ast_ctx(self),
1019                               "piped variadic argument differs in type: constrained to type %s, expected type %s",
1020                               tgot, texp);
1021                 return false;
1022             }
1023         }
1024         else
1025         {
1026             ast_type_to_string(exp_type, texp, sizeof(texp));
1027             if (OPTS_FLAG(UNSAFE_VARARGS)) {
1028                 if (compile_warning(ast_ctx(self), WARN_UNSAFE_TYPES,
1029                                     "piped variadic argument may differ in type: expected type %s",
1030                                     texp))
1031                     return false;
1032             } else {
1033                 compile_error(ast_ctx(self),
1034                               "piped variadic argument may differ in type: expected type %s",
1035                               texp);
1036                 return false;
1037             }
1038         }
1039     }
1040     return true;
1041 }
1042
1043 bool ast_call_check_types(ast_call *self, ast_expression *va_type)
1044 {
1045     char texp[1024];
1046     char tgot[1024];
1047     size_t i;
1048     bool   retval = true;
1049     const  ast_expression *func = self->func;
1050     size_t count = vec_size(self->params);
1051     if (count > vec_size(func->params))
1052         count = vec_size(func->params);
1053
1054     for (i = 0; i < count; ++i) {
1055         if (ast_istype(self->params[i], ast_argpipe)) {
1056             /* warn about type safety instead */
1057             if (i+1 != count) {
1058                 compile_error(ast_ctx(self), "argpipe must be the last parameter to a function call");
1059                 return false;
1060             }
1061             if (!ast_call_check_vararg(self, va_type, (ast_expression*)func->params[i]))
1062                 retval = false;
1063         }
1064         else if (!ast_compare_type(self->params[i], (ast_expression*)(func->params[i])))
1065         {
1066             ast_type_to_string(self->params[i], tgot, sizeof(tgot));
1067             ast_type_to_string((ast_expression*)func->params[i], texp, sizeof(texp));
1068             compile_error(ast_ctx(self), "invalid type for parameter %u in function call: expected %s, got %s",
1069                      (unsigned int)(i+1), texp, tgot);
1070             /* we don't immediately return */
1071             retval = false;
1072         }
1073     }
1074     count = vec_size(self->params);
1075     if (count > vec_size(func->params) && func->varparam) {
1076         for (; i < count; ++i) {
1077             if (ast_istype(self->params[i], ast_argpipe)) {
1078                 /* warn about type safety instead */
1079                 if (i+1 != count) {
1080                     compile_error(ast_ctx(self), "argpipe must be the last parameter to a function call");
1081                     return false;
1082                 }
1083                 if (!ast_call_check_vararg(self, va_type, func->varparam))
1084                     retval = false;
1085             }
1086             else if (!ast_compare_type(self->params[i], func->varparam))
1087             {
1088                 ast_type_to_string(self->params[i], tgot, sizeof(tgot));
1089                 ast_type_to_string(func->varparam, texp, sizeof(texp));
1090                 compile_error(ast_ctx(self), "invalid type for variadic parameter %u in function call: expected %s, got %s",
1091                          (unsigned int)(i+1), texp, tgot);
1092                 /* we don't immediately return */
1093                 retval = false;
1094             }
1095         }
1096     }
1097     return retval;
1098 }
1099
1100 ast_store* ast_store_new(lex_ctx_t ctx, int op,
1101                          ast_expression *dest, ast_expression *source)
1102 {
1103     ast_instantiate(ast_store, ctx, ast_store_delete);
1104     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
1105
1106     ast_side_effects(self) = true;
1107
1108     self->op = op;
1109     self->dest = dest;
1110     self->source = source;
1111
1112     ast_type_adopt(self, dest);
1113
1114     return self;
1115 }
1116
1117 void ast_store_delete(ast_store *self)
1118 {
1119     ast_unref(self->dest);
1120     ast_unref(self->source);
1121     ast_expression_delete((ast_expression*)self);
1122     mem_d(self);
1123 }
1124
1125 ast_block* ast_block_new(lex_ctx_t ctx)
1126 {
1127     ast_instantiate(ast_block, ctx, ast_block_delete);
1128     ast_expression_init((ast_expression*)self,
1129                         (ast_expression_codegen*)&ast_block_codegen);
1130
1131     self->locals  = NULL;
1132     self->exprs   = NULL;
1133     self->collect = NULL;
1134
1135     return self;
1136 }
1137
1138 bool ast_block_add_expr(ast_block *self, ast_expression *e)
1139 {
1140     ast_propagate_effects(self, e);
1141     vec_push(self->exprs, e);
1142     if (self->expression.next) {
1143         ast_delete(self->expression.next);
1144         self->expression.next = NULL;
1145     }
1146     ast_type_adopt(self, e);
1147     return true;
1148 }
1149
1150 void ast_block_collect(ast_block *self, ast_expression *expr)
1151 {
1152     vec_push(self->collect, expr);
1153     expr->node.keep = true;
1154 }
1155
1156 void ast_block_delete(ast_block *self)
1157 {
1158     size_t i;
1159     for (i = 0; i < vec_size(self->exprs); ++i)
1160         ast_unref(self->exprs[i]);
1161     vec_free(self->exprs);
1162     for (i = 0; i < vec_size(self->locals); ++i)
1163         ast_delete(self->locals[i]);
1164     vec_free(self->locals);
1165     for (i = 0; i < vec_size(self->collect); ++i)
1166         ast_delete(self->collect[i]);
1167     vec_free(self->collect);
1168     ast_expression_delete((ast_expression*)self);
1169     mem_d(self);
1170 }
1171
1172 void ast_block_set_type(ast_block *self, ast_expression *from)
1173 {
1174     if (self->expression.next)
1175         ast_delete(self->expression.next);
1176     ast_type_adopt(self, from);
1177 }
1178
1179 ast_function* ast_function_new(lex_ctx_t ctx, const char *name, ast_value *vtype)
1180 {
1181     ast_instantiate(ast_function, ctx, ast_function_delete);
1182
1183     if (!vtype) {
1184         compile_error(ast_ctx(self), "internal error: ast_function_new condition 0");
1185         goto cleanup;
1186     } else if (vtype->hasvalue || vtype->expression.vtype != TYPE_FUNCTION) {
1187     } else if (vtype->hasvalue || vtype->expression.vtype != TYPE_FUNCTION) {
1188         compile_error(ast_ctx(self), "internal error: ast_function_new condition %i %i type=%i (probably 2 bodies?)",
1189                  (int)!vtype,
1190                  (int)vtype->hasvalue,
1191                  vtype->expression.vtype);
1192         goto cleanup;
1193     }
1194
1195     self->vtype  = vtype;
1196     self->name   = name ? util_strdup(name) : NULL;
1197     self->blocks = NULL;
1198
1199     self->labelcount = 0;
1200     self->builtin = 0;
1201
1202     self->ir_func = NULL;
1203     self->curblock = NULL;
1204
1205     self->breakblocks    = NULL;
1206     self->continueblocks = NULL;
1207
1208     vtype->hasvalue = true;
1209     vtype->constval.vfunc = self;
1210
1211     self->varargs          = NULL;
1212     self->argc             = NULL;
1213     self->fixedparams      = NULL;
1214     self->return_value     = NULL;
1215
1216     return self;
1217
1218 cleanup:
1219     mem_d(self);
1220     return NULL;
1221 }
1222
1223 void ast_function_delete(ast_function *self)
1224 {
1225     size_t i;
1226     if (self->name)
1227         mem_d((void*)self->name);
1228     if (self->vtype) {
1229         /* ast_value_delete(self->vtype); */
1230         self->vtype->hasvalue = false;
1231         self->vtype->constval.vfunc = NULL;
1232         /* We use unref - if it was stored in a global table it is supposed
1233          * to be deleted from *there*
1234          */
1235         ast_unref(self->vtype);
1236     }
1237     for (i = 0; i < vec_size(self->blocks); ++i)
1238         ast_delete(self->blocks[i]);
1239     vec_free(self->blocks);
1240     vec_free(self->breakblocks);
1241     vec_free(self->continueblocks);
1242     if (self->varargs)
1243         ast_delete(self->varargs);
1244     if (self->argc)
1245         ast_delete(self->argc);
1246     if (self->fixedparams)
1247         ast_unref(self->fixedparams);
1248     if (self->return_value)
1249         ast_unref(self->return_value);
1250     mem_d(self);
1251 }
1252
1253 const char* ast_function_label(ast_function *self, const char *prefix)
1254 {
1255     size_t id;
1256     size_t len;
1257     char  *from;
1258
1259     if (!OPTS_OPTION_BOOL(OPTION_DUMP)    &&
1260         !OPTS_OPTION_BOOL(OPTION_DUMPFIN) &&
1261         !OPTS_OPTION_BOOL(OPTION_DEBUG))
1262     {
1263         return NULL;
1264     }
1265
1266     id  = (self->labelcount++);
1267     len = strlen(prefix);
1268
1269     from = self->labelbuf + sizeof(self->labelbuf)-1;
1270     *from-- = 0;
1271     do {
1272         *from-- = (id%10) + '0';
1273         id /= 10;
1274     } while (id);
1275     ++from;
1276     memcpy(from - len, prefix, len);
1277     return from - len;
1278 }
1279
1280 /*********************************************************************/
1281 /* AST codegen part
1282  * by convention you must never pass NULL to the 'ir_value **out'
1283  * parameter. If you really don't care about the output, pass a dummy.
1284  * But I can't imagine a pituation where the output is truly unnecessary.
1285  */
1286
1287 static void _ast_codegen_output_type(ast_expression *self, ir_value *out)
1288 {
1289     if (out->vtype == TYPE_FIELD)
1290         out->fieldtype = self->next->vtype;
1291     if (out->vtype == TYPE_FUNCTION)
1292         out->outtype = self->next->vtype;
1293 }
1294
1295 #define codegen_output_type(a,o) (_ast_codegen_output_type(&((a)->expression),(o)))
1296
1297 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
1298 {
1299     (void)func;
1300     (void)lvalue;
1301     if (self->expression.vtype == TYPE_NIL) {
1302         *out = func->ir_func->owner->nil;
1303         return true;
1304     }
1305     /* NOTE: This is the codegen for a variable used in an expression.
1306      * It is not the codegen to generate the value. For this purpose,
1307      * ast_local_codegen and ast_global_codegen are to be used before this
1308      * is executed. ast_function_codegen should take care of its locals,
1309      * and the ast-user should take care of ast_global_codegen to be used
1310      * on all the globals.
1311      */
1312     if (!self->ir_v) {
1313         char tname[1024]; /* typename is reserved in C++ */
1314         ast_type_to_string((ast_expression*)self, tname, sizeof(tname));
1315         compile_error(ast_ctx(self), "ast_value used before generated %s %s", tname, self->name);
1316         return false;
1317     }
1318     *out = self->ir_v;
1319     return true;
1320 }
1321
1322 static bool ast_global_array_set(ast_value *self)
1323 {
1324     size_t count = vec_size(self->initlist);
1325     size_t i;
1326
1327     if (count > self->expression.count) {
1328         compile_error(ast_ctx(self), "too many elements in initializer");
1329         count = self->expression.count;
1330     }
1331     else if (count < self->expression.count) {
1332         /* add this?
1333         compile_warning(ast_ctx(self), "not all elements are initialized");
1334         */
1335     }
1336
1337     for (i = 0; i != count; ++i) {
1338         switch (self->expression.next->vtype) {
1339             case TYPE_FLOAT:
1340                 if (!ir_value_set_float(self->ir_values[i], self->initlist[i].vfloat))
1341                     return false;
1342                 break;
1343             case TYPE_VECTOR:
1344                 if (!ir_value_set_vector(self->ir_values[i], self->initlist[i].vvec))
1345                     return false;
1346                 break;
1347             case TYPE_STRING:
1348                 if (!ir_value_set_string(self->ir_values[i], self->initlist[i].vstring))
1349                     return false;
1350                 break;
1351             case TYPE_ARRAY:
1352                 /* we don't support them in any other place yet either */
1353                 compile_error(ast_ctx(self), "TODO: nested arrays");
1354                 return false;
1355             case TYPE_FUNCTION:
1356                 /* this requiers a bit more work - similar to the fields I suppose */
1357                 compile_error(ast_ctx(self), "global of type function not properly generated");
1358                 return false;
1359             case TYPE_FIELD:
1360                 if (!self->initlist[i].vfield) {
1361                     compile_error(ast_ctx(self), "field constant without vfield set");
1362                     return false;
1363                 }
1364                 if (!self->initlist[i].vfield->ir_v) {
1365                     compile_error(ast_ctx(self), "field constant generated before its field");
1366                     return false;
1367                 }
1368                 if (!ir_value_set_field(self->ir_values[i], self->initlist[i].vfield->ir_v))
1369                     return false;
1370                 break;
1371             default:
1372                 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1373                 break;
1374         }
1375     }
1376     return true;
1377 }
1378
1379 static bool check_array(ast_value *self, ast_value *array)
1380 {
1381     if (array->expression.flags & AST_FLAG_ARRAY_INIT && !array->initlist) {
1382         compile_error(ast_ctx(self), "array without size: %s", self->name);
1383         return false;
1384     }
1385     /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1386     if (!array->expression.count || array->expression.count > OPTS_OPTION_U32(OPTION_MAX_ARRAY_SIZE)) {
1387         compile_error(ast_ctx(self), "Invalid array of size %lu", (unsigned long)array->expression.count);
1388         return false;
1389     }
1390     return true;
1391 }
1392
1393 bool ast_global_codegen(ast_value *self, ir_builder *ir, bool isfield)
1394 {
1395     ir_value *v = NULL;
1396
1397     if (self->expression.vtype == TYPE_NIL) {
1398         compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1399         return false;
1400     }
1401
1402     if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1403     {
1404         ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->vtype);
1405         if (!func)
1406             return false;
1407         func->context = ast_ctx(self);
1408         func->value->context = ast_ctx(self);
1409
1410         self->constval.vfunc->ir_func = func;
1411         self->ir_v = func->value;
1412         if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1413             self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1414         if (self->expression.flags & AST_FLAG_ERASEABLE)
1415             self->ir_v->flags |= IR_FLAG_ERASEABLE;
1416         /* The function is filled later on ast_function_codegen... */
1417         return true;
1418     }
1419
1420     if (isfield && self->expression.vtype == TYPE_FIELD) {
1421         ast_expression *fieldtype = self->expression.next;
1422
1423         if (self->hasvalue) {
1424             compile_error(ast_ctx(self), "TODO: constant field pointers with value");
1425             goto error;
1426         }
1427
1428         if (fieldtype->vtype == TYPE_ARRAY) {
1429             size_t ai;
1430             char   *name;
1431             size_t  namelen;
1432
1433             ast_expression *elemtype;
1434             int             vtype;
1435             ast_value      *array = (ast_value*)fieldtype;
1436
1437             if (!ast_istype(fieldtype, ast_value)) {
1438                 compile_error(ast_ctx(self), "internal error: ast_value required");
1439                 return false;
1440             }
1441
1442             if (!check_array(self, array))
1443                 return false;
1444
1445             elemtype = array->expression.next;
1446             vtype = elemtype->vtype;
1447
1448             v = ir_builder_create_field(ir, self->name, vtype);
1449             if (!v) {
1450                 compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1451                 return false;
1452             }
1453             v->context = ast_ctx(self);
1454             v->unique_life = true;
1455             v->locked      = true;
1456             array->ir_v = self->ir_v = v;
1457
1458             if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1459                 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1460             if (self->expression.flags & AST_FLAG_ERASEABLE)
1461                 self->ir_v->flags |= IR_FLAG_ERASEABLE;
1462
1463             namelen = strlen(self->name);
1464             name    = (char*)mem_a(namelen + 16);
1465             util_strncpy(name, self->name, namelen);
1466
1467             array->ir_values = (ir_value**)mem_a(sizeof(array->ir_values[0]) * array->expression.count);
1468             array->ir_values[0] = v;
1469             for (ai = 1; ai < array->expression.count; ++ai) {
1470                 util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1471                 array->ir_values[ai] = ir_builder_create_field(ir, name, vtype);
1472                 if (!array->ir_values[ai]) {
1473                     mem_d(name);
1474                     compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", name);
1475                     return false;
1476                 }
1477                 array->ir_values[ai]->context = ast_ctx(self);
1478                 array->ir_values[ai]->unique_life = true;
1479                 array->ir_values[ai]->locked      = true;
1480                 if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1481                     self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1482             }
1483             mem_d(name);
1484         }
1485         else
1486         {
1487             v = ir_builder_create_field(ir, self->name, self->expression.next->vtype);
1488             if (!v)
1489                 return false;
1490             v->context = ast_ctx(self);
1491             self->ir_v = v;
1492             if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1493                 self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1494
1495             if (self->expression.flags & AST_FLAG_ERASEABLE)
1496                 self->ir_v->flags |= IR_FLAG_ERASEABLE;
1497         }
1498         return true;
1499     }
1500
1501     if (self->expression.vtype == TYPE_ARRAY) {
1502         size_t ai;
1503         char   *name;
1504         size_t  namelen;
1505
1506         ast_expression *elemtype = self->expression.next;
1507         int vtype = elemtype->vtype;
1508
1509         if (self->expression.flags & AST_FLAG_ARRAY_INIT && !self->expression.count) {
1510             compile_error(ast_ctx(self), "array `%s' has no size", self->name);
1511             return false;
1512         }
1513
1514         /* same as with field arrays */
1515         if (!check_array(self, self))
1516             return false;
1517
1518         v = ir_builder_create_global(ir, self->name, vtype);
1519         if (!v) {
1520             compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", self->name);
1521             return false;
1522         }
1523         v->context = ast_ctx(self);
1524         v->unique_life = true;
1525         v->locked      = true;
1526
1527         if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1528             v->flags |= IR_FLAG_INCLUDE_DEF;
1529         if (self->expression.flags & AST_FLAG_ERASEABLE)
1530             self->ir_v->flags |= IR_FLAG_ERASEABLE;
1531
1532         namelen = strlen(self->name);
1533         name    = (char*)mem_a(namelen + 16);
1534         util_strncpy(name, self->name, namelen);
1535
1536         self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1537         self->ir_values[0] = v;
1538         for (ai = 1; ai < self->expression.count; ++ai) {
1539             util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1540             self->ir_values[ai] = ir_builder_create_global(ir, name, vtype);
1541             if (!self->ir_values[ai]) {
1542                 mem_d(name);
1543                 compile_error(ast_ctx(self), "ir_builder_create_global failed `%s`", name);
1544                 return false;
1545             }
1546             self->ir_values[ai]->context = ast_ctx(self);
1547             self->ir_values[ai]->unique_life = true;
1548             self->ir_values[ai]->locked      = true;
1549             if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1550                 self->ir_values[ai]->flags |= IR_FLAG_INCLUDE_DEF;
1551         }
1552         mem_d(name);
1553     }
1554     else
1555     {
1556         /* Arrays don't do this since there's no "array" value which spans across the
1557          * whole thing.
1558          */
1559         v = ir_builder_create_global(ir, self->name, self->expression.vtype);
1560         if (!v) {
1561             compile_error(ast_ctx(self), "ir_builder_create_global failed on `%s`", self->name);
1562             return false;
1563         }
1564         codegen_output_type(self, v);
1565         v->context = ast_ctx(self);
1566     }
1567
1568     /* link us to the ir_value */
1569     v->cvq = self->cvq;
1570     self->ir_v = v;
1571
1572     if (self->expression.flags & AST_FLAG_INCLUDE_DEF)
1573         self->ir_v->flags |= IR_FLAG_INCLUDE_DEF;
1574     if (self->expression.flags & AST_FLAG_ERASEABLE)
1575         self->ir_v->flags |= IR_FLAG_ERASEABLE;
1576
1577     /* initialize */
1578     if (self->hasvalue) {
1579         switch (self->expression.vtype)
1580         {
1581             case TYPE_FLOAT:
1582                 if (!ir_value_set_float(v, self->constval.vfloat))
1583                     goto error;
1584                 break;
1585             case TYPE_VECTOR:
1586                 if (!ir_value_set_vector(v, self->constval.vvec))
1587                     goto error;
1588                 break;
1589             case TYPE_STRING:
1590                 if (!ir_value_set_string(v, self->constval.vstring))
1591                     goto error;
1592                 break;
1593             case TYPE_ARRAY:
1594                 ast_global_array_set(self);
1595                 break;
1596             case TYPE_FUNCTION:
1597                 compile_error(ast_ctx(self), "global of type function not properly generated");
1598                 goto error;
1599                 /* Cannot generate an IR value for a function,
1600                  * need a pointer pointing to a function rather.
1601                  */
1602             case TYPE_FIELD:
1603                 if (!self->constval.vfield) {
1604                     compile_error(ast_ctx(self), "field constant without vfield set");
1605                     goto error;
1606                 }
1607                 if (!self->constval.vfield->ir_v) {
1608                     compile_error(ast_ctx(self), "field constant generated before its field");
1609                     goto error;
1610                 }
1611                 if (!ir_value_set_field(v, self->constval.vfield->ir_v))
1612                     goto error;
1613                 break;
1614             default:
1615                 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1616                 break;
1617         }
1618     }
1619     return true;
1620
1621 error: /* clean up */
1622     if(v) ir_value_delete(v);
1623     return false;
1624 }
1625
1626 static bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
1627 {
1628     ir_value *v = NULL;
1629
1630     if (self->expression.vtype == TYPE_NIL) {
1631         compile_error(ast_ctx(self), "internal error: trying to generate a variable of TYPE_NIL");
1632         return false;
1633     }
1634
1635     if (self->hasvalue && self->expression.vtype == TYPE_FUNCTION)
1636     {
1637         /* Do we allow local functions? I think not...
1638          * this is NOT a function pointer atm.
1639          */
1640         return false;
1641     }
1642
1643     if (self->expression.vtype == TYPE_ARRAY) {
1644         size_t ai;
1645         char   *name;
1646         size_t  namelen;
1647
1648         ast_expression *elemtype = self->expression.next;
1649         int vtype = elemtype->vtype;
1650
1651         func->flags |= IR_FLAG_HAS_ARRAYS;
1652
1653         if (param && !(self->expression.flags & AST_FLAG_IS_VARARG)) {
1654             compile_error(ast_ctx(self), "array-parameters are not supported");
1655             return false;
1656         }
1657
1658         /* we are lame now - considering the way QC works we won't tolerate arrays > 1024 elements */
1659         if (!check_array(self, self))
1660             return false;
1661
1662         self->ir_values = (ir_value**)mem_a(sizeof(self->ir_values[0]) * self->expression.count);
1663         if (!self->ir_values) {
1664             compile_error(ast_ctx(self), "failed to allocate array values");
1665             return false;
1666         }
1667
1668         v = ir_function_create_local(func, self->name, vtype, param);
1669         if (!v) {
1670             compile_error(ast_ctx(self), "internal error: ir_function_create_local failed");
1671             return false;
1672         }
1673         v->context = ast_ctx(self);
1674         v->unique_life = true;
1675         v->locked      = true;
1676
1677         namelen = strlen(self->name);
1678         name    = (char*)mem_a(namelen + 16);
1679         util_strncpy(name, self->name, namelen);
1680
1681         self->ir_values[0] = v;
1682         for (ai = 1; ai < self->expression.count; ++ai) {
1683             util_snprintf(name + namelen, 16, "[%u]", (unsigned int)ai);
1684             self->ir_values[ai] = ir_function_create_local(func, name, vtype, param);
1685             if (!self->ir_values[ai]) {
1686                 compile_error(ast_ctx(self), "internal_error: ir_builder_create_global failed on `%s`", name);
1687                 return false;
1688             }
1689             self->ir_values[ai]->context = ast_ctx(self);
1690             self->ir_values[ai]->unique_life = true;
1691             self->ir_values[ai]->locked      = true;
1692         }
1693         mem_d(name);
1694     }
1695     else
1696     {
1697         v = ir_function_create_local(func, self->name, self->expression.vtype, param);
1698         if (!v)
1699             return false;
1700         codegen_output_type(self, v);
1701         v->context = ast_ctx(self);
1702     }
1703
1704     /* A constant local... hmmm...
1705      * I suppose the IR will have to deal with this
1706      */
1707     if (self->hasvalue) {
1708         switch (self->expression.vtype)
1709         {
1710             case TYPE_FLOAT:
1711                 if (!ir_value_set_float(v, self->constval.vfloat))
1712                     goto error;
1713                 break;
1714             case TYPE_VECTOR:
1715                 if (!ir_value_set_vector(v, self->constval.vvec))
1716                     goto error;
1717                 break;
1718             case TYPE_STRING:
1719                 if (!ir_value_set_string(v, self->constval.vstring))
1720                     goto error;
1721                 break;
1722             default:
1723                 compile_error(ast_ctx(self), "TODO: global constant type %i", self->expression.vtype);
1724                 break;
1725         }
1726     }
1727
1728     /* link us to the ir_value */
1729     v->cvq = self->cvq;
1730     self->ir_v = v;
1731
1732     if (!ast_generate_accessors(self, func->owner))
1733         return false;
1734     return true;
1735
1736 error: /* clean up */
1737     ir_value_delete(v);
1738     return false;
1739 }
1740
1741 bool ast_generate_accessors(ast_value *self, ir_builder *ir)
1742 {
1743     size_t i;
1744     bool warn = OPTS_WARN(WARN_USED_UNINITIALIZED);
1745     if (!self->setter || !self->getter)
1746         return true;
1747     for (i = 0; i < self->expression.count; ++i) {
1748         if (!self->ir_values) {
1749             compile_error(ast_ctx(self), "internal error: no array values generated for `%s`", self->name);
1750             return false;
1751         }
1752         if (!self->ir_values[i]) {
1753             compile_error(ast_ctx(self), "internal error: not all array values have been generated for `%s`", self->name);
1754             return false;
1755         }
1756         if (self->ir_values[i]->life) {
1757             compile_error(ast_ctx(self), "internal error: function containing `%s` already generated", self->name);
1758             return false;
1759         }
1760     }
1761
1762     opts_set(opts.warn, WARN_USED_UNINITIALIZED, false);
1763     if (self->setter) {
1764         if (!ast_global_codegen  (self->setter, ir, false) ||
1765             !ast_function_codegen(self->setter->constval.vfunc, ir) ||
1766             !ir_function_finalize(self->setter->constval.vfunc->ir_func))
1767         {
1768             compile_error(ast_ctx(self), "internal error: failed to generate setter for `%s`", self->name);
1769             opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1770             return false;
1771         }
1772     }
1773     if (self->getter) {
1774         if (!ast_global_codegen  (self->getter, ir, false) ||
1775             !ast_function_codegen(self->getter->constval.vfunc, ir) ||
1776             !ir_function_finalize(self->getter->constval.vfunc->ir_func))
1777         {
1778             compile_error(ast_ctx(self), "internal error: failed to generate getter for `%s`", self->name);
1779             opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1780             return false;
1781         }
1782     }
1783     for (i = 0; i < self->expression.count; ++i) {
1784         vec_free(self->ir_values[i]->life);
1785     }
1786     opts_set(opts.warn, WARN_USED_UNINITIALIZED, warn);
1787     return true;
1788 }
1789
1790 bool ast_function_codegen(ast_function *self, ir_builder *ir)
1791 {
1792     ir_function *irf;
1793     ir_value    *dummy;
1794     ast_expression         *ec;
1795     ast_expression_codegen *cgen;
1796
1797     size_t    i;
1798
1799     (void)ir;
1800
1801     irf = self->ir_func;
1802     if (!irf) {
1803         compile_error(ast_ctx(self), "internal error: ast_function's related ast_value was not generated yet");
1804         return false;
1805     }
1806
1807     /* fill the parameter list */
1808     ec = &self->vtype->expression;
1809     for (i = 0; i < vec_size(ec->params); ++i)
1810     {
1811         if (ec->params[i]->expression.vtype == TYPE_FIELD)
1812             vec_push(irf->params, ec->params[i]->expression.next->vtype);
1813         else
1814             vec_push(irf->params, ec->params[i]->expression.vtype);
1815         if (!self->builtin) {
1816             if (!ast_local_codegen(ec->params[i], self->ir_func, true))
1817                 return false;
1818         }
1819     }
1820
1821     if (self->varargs) {
1822         if (!ast_local_codegen(self->varargs, self->ir_func, true))
1823             return false;
1824         irf->max_varargs = self->varargs->expression.count;
1825     }
1826
1827     if (self->builtin) {
1828         irf->builtin = self->builtin;
1829         return true;
1830     }
1831
1832     /* have a local return value variable? */
1833     if (self->return_value) {
1834         if (!ast_local_codegen(self->return_value, self->ir_func, false))
1835             return false;
1836     }
1837
1838     if (!vec_size(self->blocks)) {
1839         compile_error(ast_ctx(self), "function `%s` has no body", self->name);
1840         return false;
1841     }
1842
1843     irf->first = self->curblock = ir_function_create_block(ast_ctx(self), irf, "entry");
1844     if (!self->curblock) {
1845         compile_error(ast_ctx(self), "failed to allocate entry block for `%s`", self->name);
1846         return false;
1847     }
1848
1849     if (self->argc) {
1850         ir_value *va_count;
1851         ir_value *fixed;
1852         ir_value *sub;
1853         if (!ast_local_codegen(self->argc, self->ir_func, true))
1854             return false;
1855         cgen = self->argc->expression.codegen;
1856         if (!(*cgen)((ast_expression*)(self->argc), self, false, &va_count))
1857             return false;
1858         cgen = self->fixedparams->expression.codegen;
1859         if (!(*cgen)((ast_expression*)(self->fixedparams), self, false, &fixed))
1860             return false;
1861         sub = ir_block_create_binop(self->curblock, ast_ctx(self),
1862                                     ast_function_label(self, "va_count"), INSTR_SUB_F,
1863                                     ir_builder_get_va_count(ir), fixed);
1864         if (!sub)
1865             return false;
1866         if (!ir_block_create_store_op(self->curblock, ast_ctx(self), INSTR_STORE_F,
1867                                       va_count, sub))
1868         {
1869             return false;
1870         }
1871     }
1872
1873     for (i = 0; i < vec_size(self->blocks); ++i) {
1874         cgen = self->blocks[i]->expression.codegen;
1875         if (!(*cgen)((ast_expression*)self->blocks[i], self, false, &dummy))
1876             return false;
1877     }
1878
1879     /* TODO: check return types */
1880     if (!self->curblock->final)
1881     {
1882         if (!self->vtype->expression.next ||
1883             self->vtype->expression.next->vtype == TYPE_VOID)
1884         {
1885             return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1886         }
1887         else if (vec_size(self->curblock->entries) || self->curblock == irf->first)
1888         {
1889             if (self->return_value) {
1890                 cgen = self->return_value->expression.codegen;
1891                 if (!(*cgen)((ast_expression*)(self->return_value), self, false, &dummy))
1892                     return false;
1893                 return ir_block_create_return(self->curblock, ast_ctx(self), dummy);
1894             }
1895             else if (compile_warning(ast_ctx(self), WARN_MISSING_RETURN_VALUES,
1896                                 "control reaches end of non-void function (`%s`) via %s",
1897                                 self->name, self->curblock->label))
1898             {
1899                 return false;
1900             }
1901             return ir_block_create_return(self->curblock, ast_ctx(self), NULL);
1902         }
1903     }
1904     return true;
1905 }
1906
1907 static bool starts_a_label(ast_expression *ex)
1908 {
1909     while (ex && ast_istype(ex, ast_block)) {
1910         ast_block *b = (ast_block*)ex;
1911         ex = b->exprs[0];
1912     }
1913     if (!ex)
1914         return false;
1915     return ast_istype(ex, ast_label);
1916 }
1917
1918 /* Note, you will not see ast_block_codegen generate ir_blocks.
1919  * To the AST and the IR, blocks are 2 different things.
1920  * In the AST it represents a block of code, usually enclosed in
1921  * curly braces {...}.
1922  * While in the IR it represents a block in terms of control-flow.
1923  */
1924 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
1925 {
1926     size_t i;
1927
1928     /* We don't use this
1929      * Note: an ast-representation using the comma-operator
1930      * of the form: (a, b, c) = x should not assign to c...
1931      */
1932     if (lvalue) {
1933         compile_error(ast_ctx(self), "not an l-value (code-block)");
1934         return false;
1935     }
1936
1937     if (self->expression.outr) {
1938         *out = self->expression.outr;
1939         return true;
1940     }
1941
1942     /* output is NULL at first, we'll have each expression
1943      * assign to out output, thus, a comma-operator represention
1944      * using an ast_block will return the last generated value,
1945      * so: (b, c) + a  executed both b and c, and returns c,
1946      * which is then added to a.
1947      */
1948     *out = NULL;
1949
1950     /* generate locals */
1951     for (i = 0; i < vec_size(self->locals); ++i)
1952     {
1953         if (!ast_local_codegen(self->locals[i], func->ir_func, false)) {
1954             if (OPTS_OPTION_BOOL(OPTION_DEBUG))
1955                 compile_error(ast_ctx(self), "failed to generate local `%s`", self->locals[i]->name);
1956             return false;
1957         }
1958     }
1959
1960     for (i = 0; i < vec_size(self->exprs); ++i)
1961     {
1962         ast_expression_codegen *gen;
1963         if (func->curblock->final && !starts_a_label(self->exprs[i])) {
1964             if (compile_warning(ast_ctx(self->exprs[i]), WARN_UNREACHABLE_CODE, "unreachable statement"))
1965                 return false;
1966             continue;
1967         }
1968         gen = self->exprs[i]->codegen;
1969         if (!(*gen)(self->exprs[i], func, false, out))
1970             return false;
1971     }
1972
1973     self->expression.outr = *out;
1974
1975     return true;
1976 }
1977
1978 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
1979 {
1980     ast_expression_codegen *cgen;
1981     ir_value *left  = NULL;
1982     ir_value *right = NULL;
1983
1984     ast_value       *arr;
1985     ast_value       *idx = 0;
1986     ast_array_index *ai = NULL;
1987
1988     if (lvalue && self->expression.outl) {
1989         *out = self->expression.outl;
1990         return true;
1991     }
1992
1993     if (!lvalue && self->expression.outr) {
1994         *out = self->expression.outr;
1995         return true;
1996     }
1997
1998     if (ast_istype(self->dest, ast_array_index))
1999     {
2000
2001         ai = (ast_array_index*)self->dest;
2002         idx = (ast_value*)ai->index;
2003
2004         if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
2005             ai = NULL;
2006     }
2007
2008     if (ai) {
2009         /* we need to call the setter */
2010         ir_value  *iridx, *funval;
2011         ir_instr  *call;
2012
2013         if (lvalue) {
2014             compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2015             return false;
2016         }
2017
2018         arr = (ast_value*)ai->array;
2019         if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2020             compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2021             return false;
2022         }
2023
2024         cgen = idx->expression.codegen;
2025         if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2026             return false;
2027
2028         cgen = arr->setter->expression.codegen;
2029         if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2030             return false;
2031
2032         cgen = self->source->codegen;
2033         if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2034             return false;
2035
2036         call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2037         if (!call)
2038             return false;
2039         ir_call_param(call, iridx);
2040         ir_call_param(call, right);
2041         self->expression.outr = right;
2042     }
2043     else
2044     {
2045         /* regular code */
2046
2047         cgen = self->dest->codegen;
2048         /* lvalue! */
2049         if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
2050             return false;
2051         self->expression.outl = left;
2052
2053         cgen = self->source->codegen;
2054         /* rvalue! */
2055         if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2056             return false;
2057
2058         if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->op, left, right))
2059             return false;
2060         self->expression.outr = right;
2061     }
2062
2063     /* Theoretically, an assinment returns its left side as an
2064      * lvalue, if we don't need an lvalue though, we return
2065      * the right side as an rvalue, otherwise we have to
2066      * somehow know whether or not we need to dereference the pointer
2067      * on the left side - that is: OP_LOAD if it was an address.
2068      * Also: in original QC we cannot OP_LOADP *anyway*.
2069      */
2070     *out = (lvalue ? left : right);
2071
2072     return true;
2073 }
2074
2075 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
2076 {
2077     ast_expression_codegen *cgen;
2078     ir_value *left, *right;
2079
2080     /* A binary operation cannot yield an l-value */
2081     if (lvalue) {
2082         compile_error(ast_ctx(self), "not an l-value (binop)");
2083         return false;
2084     }
2085
2086     if (self->expression.outr) {
2087         *out = self->expression.outr;
2088         return true;
2089     }
2090
2091     if ((OPTS_FLAG(SHORT_LOGIC) || OPTS_FLAG(PERL_LOGIC)) &&
2092         (self->op == INSTR_AND || self->op == INSTR_OR))
2093     {
2094         /* NOTE: The short-logic path will ignore right_first */
2095
2096         /* short circuit evaluation */
2097         ir_block *other, *merge;
2098         ir_block *from_left, *from_right;
2099         ir_instr *phi;
2100         size_t    merge_id;
2101
2102         /* prepare end-block */
2103         merge_id = vec_size(func->ir_func->blocks);
2104         merge    = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_merge"));
2105
2106         /* generate the left expression */
2107         cgen = self->left->codegen;
2108         if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2109             return false;
2110         /* remember the block */
2111         from_left = func->curblock;
2112
2113         /* create a new block for the right expression */
2114         other = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "sce_other"));
2115         if (self->op == INSTR_AND) {
2116             /* on AND: left==true -> other */
2117             if (!ir_block_create_if(func->curblock, ast_ctx(self), left, other, merge))
2118                 return false;
2119         } else {
2120             /* on OR: left==false -> other */
2121             if (!ir_block_create_if(func->curblock, ast_ctx(self), left, merge, other))
2122                 return false;
2123         }
2124         /* use the likely flag */
2125         vec_last(func->curblock->instr)->likely = true;
2126
2127         /* enter the right-expression's block */
2128         func->curblock = other;
2129         /* generate */
2130         cgen = self->right->codegen;
2131         if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2132             return false;
2133         /* remember block */
2134         from_right = func->curblock;
2135
2136         /* jump to the merge block */
2137         if (!ir_block_create_jump(func->curblock, ast_ctx(self), merge))
2138             return false;
2139
2140         vec_remove(func->ir_func->blocks, merge_id, 1);
2141         vec_push(func->ir_func->blocks, merge);
2142
2143         func->curblock = merge;
2144         phi = ir_block_create_phi(func->curblock, ast_ctx(self),
2145                                   ast_function_label(func, "sce_value"),
2146                                   self->expression.vtype);
2147         ir_phi_add(phi, from_left, left);
2148         ir_phi_add(phi, from_right, right);
2149         *out = ir_phi_value(phi);
2150         if (!*out)
2151             return false;
2152
2153         if (!OPTS_FLAG(PERL_LOGIC)) {
2154             /* cast-to-bool */
2155             if (OPTS_FLAG(CORRECT_LOGIC) && (*out)->vtype == TYPE_VECTOR) {
2156                 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2157                                              ast_function_label(func, "sce_bool_v"),
2158                                              INSTR_NOT_V, *out);
2159                 if (!*out)
2160                     return false;
2161                 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2162                                              ast_function_label(func, "sce_bool"),
2163                                              INSTR_NOT_F, *out);
2164                 if (!*out)
2165                     return false;
2166             }
2167             else if (OPTS_FLAG(FALSE_EMPTY_STRINGS) && (*out)->vtype == TYPE_STRING) {
2168                 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2169                                              ast_function_label(func, "sce_bool_s"),
2170                                              INSTR_NOT_S, *out);
2171                 if (!*out)
2172                     return false;
2173                 *out = ir_block_create_unary(func->curblock, ast_ctx(self),
2174                                              ast_function_label(func, "sce_bool"),
2175                                              INSTR_NOT_F, *out);
2176                 if (!*out)
2177                     return false;
2178             }
2179             else {
2180                 *out = ir_block_create_binop(func->curblock, ast_ctx(self),
2181                                              ast_function_label(func, "sce_bool"),
2182                                              INSTR_AND, *out, *out);
2183                 if (!*out)
2184                     return false;
2185             }
2186         }
2187
2188         self->expression.outr = *out;
2189         codegen_output_type(self, *out);
2190         return true;
2191     }
2192
2193     if (self->right_first) {
2194         cgen = self->right->codegen;
2195         if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2196             return false;
2197         cgen = self->left->codegen;
2198         if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2199             return false;
2200     } else {
2201         cgen = self->left->codegen;
2202         if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
2203             return false;
2204         cgen = self->right->codegen;
2205         if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
2206             return false;
2207     }
2208
2209     *out = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "bin"),
2210                                  self->op, left, right);
2211     if (!*out)
2212         return false;
2213     self->expression.outr = *out;
2214     codegen_output_type(self, *out);
2215
2216     return true;
2217 }
2218
2219 bool ast_binstore_codegen(ast_binstore *self, ast_function *func, bool lvalue, ir_value **out)
2220 {
2221     ast_expression_codegen *cgen;
2222     ir_value *leftl = NULL, *leftr, *right, *bin;
2223
2224     ast_value       *arr;
2225     ast_value       *idx = 0;
2226     ast_array_index *ai = NULL;
2227     ir_value        *iridx = NULL;
2228
2229     if (lvalue && self->expression.outl) {
2230         *out = self->expression.outl;
2231         return true;
2232     }
2233
2234     if (!lvalue && self->expression.outr) {
2235         *out = self->expression.outr;
2236         return true;
2237     }
2238
2239     if (ast_istype(self->dest, ast_array_index))
2240     {
2241
2242         ai = (ast_array_index*)self->dest;
2243         idx = (ast_value*)ai->index;
2244
2245         if (ast_istype(ai->index, ast_value) && idx->hasvalue && idx->cvq == CV_CONST)
2246             ai = NULL;
2247     }
2248
2249     /* for a binstore we need both an lvalue and an rvalue for the left side */
2250     /* rvalue of destination! */
2251     if (ai) {
2252         cgen = idx->expression.codegen;
2253         if (!(*cgen)((ast_expression*)(idx), func, false, &iridx))
2254             return false;
2255     }
2256     cgen = self->dest->codegen;
2257     if (!(*cgen)((ast_expression*)(self->dest), func, false, &leftr))
2258         return false;
2259
2260     /* source as rvalue only */
2261     cgen = self->source->codegen;
2262     if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
2263         return false;
2264
2265     /* now the binary */
2266     bin = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "binst"),
2267                                 self->opbin, leftr, right);
2268     self->expression.outr = bin;
2269
2270
2271     if (ai) {
2272         /* we need to call the setter */
2273         ir_value  *funval;
2274         ir_instr  *call;
2275
2276         if (lvalue) {
2277             compile_error(ast_ctx(self), "array-subscript assignment cannot produce lvalues");
2278             return false;
2279         }
2280
2281         arr = (ast_value*)ai->array;
2282         if (!ast_istype(ai->array, ast_value) || !arr->setter) {
2283             compile_error(ast_ctx(self), "value has no setter (%s)", arr->name);
2284             return false;
2285         }
2286
2287         cgen = arr->setter->expression.codegen;
2288         if (!(*cgen)((ast_expression*)(arr->setter), func, true, &funval))
2289             return false;
2290
2291         call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "store"), funval, false);
2292         if (!call)
2293             return false;
2294         ir_call_param(call, iridx);
2295         ir_call_param(call, bin);
2296         self->expression.outr = bin;
2297     } else {
2298         /* now store them */
2299         cgen = self->dest->codegen;
2300         /* lvalue of destination */
2301         if (!(*cgen)((ast_expression*)(self->dest), func, true, &leftl))
2302             return false;
2303         self->expression.outl = leftl;
2304
2305         if (!ir_block_create_store_op(func->curblock, ast_ctx(self), self->opstore, leftl, bin))
2306             return false;
2307         self->expression.outr = bin;
2308     }
2309
2310     /* Theoretically, an assinment returns its left side as an
2311      * lvalue, if we don't need an lvalue though, we return
2312      * the right side as an rvalue, otherwise we have to
2313      * somehow know whether or not we need to dereference the pointer
2314      * on the left side - that is: OP_LOAD if it was an address.
2315      * Also: in original QC we cannot OP_LOADP *anyway*.
2316      */
2317     *out = (lvalue ? leftl : bin);
2318
2319     return true;
2320 }
2321
2322 bool ast_unary_codegen(ast_unary *self, ast_function *func, bool lvalue, ir_value **out)
2323 {
2324     ast_expression_codegen *cgen;
2325     ir_value *operand;
2326
2327     /* An unary operation cannot yield an l-value */
2328     if (lvalue) {
2329         compile_error(ast_ctx(self), "not an l-value (binop)");
2330         return false;
2331     }
2332
2333     if (self->expression.outr) {
2334         *out = self->expression.outr;
2335         return true;
2336     }
2337
2338     cgen = self->operand->codegen;
2339     /* lvalue! */
2340     if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2341         return false;
2342
2343     *out = ir_block_create_unary(func->curblock, ast_ctx(self), ast_function_label(func, "unary"),
2344                                  self->op, operand);
2345     if (!*out)
2346         return false;
2347     self->expression.outr = *out;
2348
2349     return true;
2350 }
2351
2352 bool ast_return_codegen(ast_return *self, ast_function *func, bool lvalue, ir_value **out)
2353 {
2354     ast_expression_codegen *cgen;
2355     ir_value *operand;
2356
2357     *out = NULL;
2358
2359     /* In the context of a return operation, we don't actually return
2360      * anything...
2361      */
2362     if (lvalue) {
2363         compile_error(ast_ctx(self), "return-expression is not an l-value");
2364         return false;
2365     }
2366
2367     if (self->expression.outr) {
2368         compile_error(ast_ctx(self), "internal error: ast_return cannot be reused, it bears no result!");
2369         return false;
2370     }
2371     self->expression.outr = (ir_value*)1;
2372
2373     if (self->operand) {
2374         cgen = self->operand->codegen;
2375         /* lvalue! */
2376         if (!(*cgen)((ast_expression*)(self->operand), func, false, &operand))
2377             return false;
2378
2379         if (!ir_block_create_return(func->curblock, ast_ctx(self), operand))
2380             return false;
2381     } else {
2382         if (!ir_block_create_return(func->curblock, ast_ctx(self), NULL))
2383             return false;
2384     }
2385
2386     return true;
2387 }
2388
2389 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
2390 {
2391     ast_expression_codegen *cgen;
2392     ir_value *ent, *field;
2393
2394     /* This function needs to take the 'lvalue' flag into account!
2395      * As lvalue we provide a field-pointer, as rvalue we provide the
2396      * value in a temp.
2397      */
2398
2399     if (lvalue && self->expression.outl) {
2400         *out = self->expression.outl;
2401         return true;
2402     }
2403
2404     if (!lvalue && self->expression.outr) {
2405         *out = self->expression.outr;
2406         return true;
2407     }
2408
2409     cgen = self->entity->codegen;
2410     if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
2411         return false;
2412
2413     cgen = self->field->codegen;
2414     if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
2415         return false;
2416
2417     if (lvalue) {
2418         /* address! */
2419         *out = ir_block_create_fieldaddress(func->curblock, ast_ctx(self), ast_function_label(func, "efa"),
2420                                             ent, field);
2421     } else {
2422         *out = ir_block_create_load_from_ent(func->curblock, ast_ctx(self), ast_function_label(func, "efv"),
2423                                              ent, field, self->expression.vtype);
2424         /* Done AFTER error checking:
2425         codegen_output_type(self, *out);
2426         */
2427     }
2428     if (!*out) {
2429         compile_error(ast_ctx(self), "failed to create %s instruction (output type %s)",
2430                  (lvalue ? "ADDRESS" : "FIELD"),
2431                  type_name[self->expression.vtype]);
2432         return false;
2433     }
2434     if (!lvalue)
2435         codegen_output_type(self, *out);
2436
2437     if (lvalue)
2438         self->expression.outl = *out;
2439     else
2440         self->expression.outr = *out;
2441
2442     /* Hm that should be it... */
2443     return true;
2444 }
2445
2446 bool ast_member_codegen(ast_member *self, ast_function *func, bool lvalue, ir_value **out)
2447 {
2448     ast_expression_codegen *cgen;
2449     ir_value *vec;
2450
2451     /* in QC this is always an lvalue */
2452     if (lvalue && self->rvalue) {
2453         compile_error(ast_ctx(self), "not an l-value (member access)");
2454         return false;
2455     }
2456     if (self->expression.outl) {
2457         *out = self->expression.outl;
2458         return true;
2459     }
2460
2461     cgen = self->owner->codegen;
2462     if (!(*cgen)((ast_expression*)(self->owner), func, false, &vec))
2463         return false;
2464
2465     if (vec->vtype != TYPE_VECTOR &&
2466         !(vec->vtype == TYPE_FIELD && self->owner->next->vtype == TYPE_VECTOR))
2467     {
2468         return false;
2469     }
2470
2471     *out = ir_value_vector_member(vec, self->field);
2472     self->expression.outl = *out;
2473
2474     return (*out != NULL);
2475 }
2476
2477 bool ast_array_index_codegen(ast_array_index *self, ast_function *func, bool lvalue, ir_value **out)
2478 {
2479     ast_value *arr;
2480     ast_value *idx;
2481
2482     if (!lvalue && self->expression.outr) {
2483         *out = self->expression.outr;
2484         return true;
2485     }
2486     if (lvalue && self->expression.outl) {
2487         *out = self->expression.outl;
2488         return true;
2489     }
2490
2491     if (!ast_istype(self->array, ast_value)) {
2492         compile_error(ast_ctx(self), "array indexing this way is not supported");
2493         /* note this would actually be pointer indexing because the left side is
2494          * not an actual array but (hopefully) an indexable expression.
2495          * Once we get integer arithmetic, and GADDRESS/GSTORE/GLOAD instruction
2496          * support this path will be filled.
2497          */
2498         return false;
2499     }
2500
2501     arr = (ast_value*)self->array;
2502     idx = (ast_value*)self->index;
2503
2504     if (!ast_istype(self->index, ast_value) || !idx->hasvalue || idx->cvq != CV_CONST) {
2505         /* Time to use accessor functions */
2506         ast_expression_codegen *cgen;
2507         ir_value               *iridx, *funval;
2508         ir_instr               *call;
2509
2510         if (lvalue) {
2511             compile_error(ast_ctx(self), "(.2) array indexing here needs a compile-time constant");
2512             return false;
2513         }
2514
2515         if (!arr->getter) {
2516             compile_error(ast_ctx(self), "value has no getter, don't know how to index it");
2517             return false;
2518         }
2519
2520         cgen = self->index->codegen;
2521         if (!(*cgen)((ast_expression*)(self->index), func, false, &iridx))
2522             return false;
2523
2524         cgen = arr->getter->expression.codegen;
2525         if (!(*cgen)((ast_expression*)(arr->getter), func, true, &funval))
2526             return false;
2527
2528         call = ir_block_create_call(func->curblock, ast_ctx(self), ast_function_label(func, "fetch"), funval, false);
2529         if (!call)
2530             return false;
2531         ir_call_param(call, iridx);
2532
2533         *out = ir_call_value(call);
2534         self->expression.outr = *out;
2535         (*out)->vtype = self->expression.vtype;
2536         codegen_output_type(self, *out);
2537         return true;
2538     }
2539
2540     if (idx->expression.vtype == TYPE_FLOAT) {
2541         unsigned int arridx = idx->constval.vfloat;
2542         if (arridx >= self->array->count)
2543         {
2544             compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2545             return false;
2546         }
2547         *out = arr->ir_values[arridx];
2548     }
2549     else if (idx->expression.vtype == TYPE_INTEGER) {
2550         unsigned int arridx = idx->constval.vint;
2551         if (arridx >= self->array->count)
2552         {
2553             compile_error(ast_ctx(self), "array index out of bounds: %i", arridx);
2554             return false;
2555         }
2556         *out = arr->ir_values[arridx];
2557     }
2558     else {
2559         compile_error(ast_ctx(self), "array indexing here needs an integer constant");
2560         return false;
2561     }
2562     (*out)->vtype = self->expression.vtype;
2563     codegen_output_type(self, *out);
2564     return true;
2565 }
2566
2567 bool ast_argpipe_codegen(ast_argpipe *self, ast_function *func, bool lvalue, ir_value **out)
2568 {
2569     *out = NULL;
2570     if (lvalue) {
2571         compile_error(ast_ctx(self), "argpipe node: not an lvalue");
2572         return false;
2573     }
2574     (void)func;
2575     (void)out;
2576     compile_error(ast_ctx(self), "TODO: argpipe codegen not implemented");
2577     return false;
2578 }
2579
2580 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
2581 {
2582     ast_expression_codegen *cgen;
2583
2584     ir_value *condval;
2585     ir_value *dummy;
2586
2587     ir_block *cond;
2588     ir_block *ontrue;
2589     ir_block *onfalse;
2590     ir_block *ontrue_endblock = NULL;
2591     ir_block *onfalse_endblock = NULL;
2592     ir_block *merge = NULL;
2593     int       fold  = 0;
2594
2595     /* We don't output any value, thus also don't care about r/lvalue */
2596     (void)out;
2597     (void)lvalue;
2598
2599     if (self->expression.outr) {
2600         compile_error(ast_ctx(self), "internal error: ast_ifthen cannot be reused, it bears no result!");
2601         return false;
2602     }
2603     self->expression.outr = (ir_value*)1;
2604
2605     /* generate the condition */
2606     cgen = self->cond->codegen;
2607     if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2608         return false;
2609     /* update the block which will get the jump - because short-logic or ternaries may have changed this */
2610     cond = func->curblock;
2611
2612     /* try constant folding away the condition */
2613     if ((fold = fold_cond_ifthen(condval, func, self)) != -1)
2614         return fold;
2615
2616     if (self->on_true) {
2617         /* create on-true block */
2618         ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "ontrue"));
2619         if (!ontrue)
2620             return false;
2621
2622         /* enter the block */
2623         func->curblock = ontrue;
2624
2625         /* generate */
2626         cgen = self->on_true->codegen;
2627         if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
2628             return false;
2629
2630         /* we now need to work from the current endpoint */
2631         ontrue_endblock = func->curblock;
2632     } else
2633         ontrue = NULL;
2634
2635     /* on-false path */
2636     if (self->on_false) {
2637         /* create on-false block */
2638         onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "onfalse"));
2639         if (!onfalse)
2640             return false;
2641
2642         /* enter the block */
2643         func->curblock = onfalse;
2644
2645         /* generate */
2646         cgen = self->on_false->codegen;
2647         if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
2648             return false;
2649
2650         /* we now need to work from the current endpoint */
2651         onfalse_endblock = func->curblock;
2652     } else
2653         onfalse = NULL;
2654
2655     /* Merge block were they all merge in to */
2656     if (!ontrue || !onfalse || !ontrue_endblock->final || !onfalse_endblock->final)
2657     {
2658         merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "endif"));
2659         if (!merge)
2660             return false;
2661         /* add jumps ot the merge block */
2662         if (ontrue && !ontrue_endblock->final && !ir_block_create_jump(ontrue_endblock, ast_ctx(self), merge))
2663             return false;
2664         if (onfalse && !onfalse_endblock->final && !ir_block_create_jump(onfalse_endblock, ast_ctx(self), merge))
2665             return false;
2666
2667         /* Now enter the merge block */
2668         func->curblock = merge;
2669     }
2670
2671     /* we create the if here, that way all blocks are ordered :)
2672      */
2673     if (!ir_block_create_if(cond, ast_ctx(self), condval,
2674                             (ontrue  ? ontrue  : merge),
2675                             (onfalse ? onfalse : merge)))
2676     {
2677         return false;
2678     }
2679
2680     return true;
2681 }
2682
2683 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
2684 {
2685     ast_expression_codegen *cgen;
2686
2687     ir_value *condval;
2688     ir_value *trueval, *falseval;
2689     ir_instr *phi;
2690
2691     ir_block *cond = func->curblock;
2692     ir_block *cond_out = NULL;
2693     ir_block *ontrue, *ontrue_out = NULL;
2694     ir_block *onfalse, *onfalse_out = NULL;
2695     ir_block *merge;
2696     int       fold  = 0;
2697
2698     /* Ternary can never create an lvalue... */
2699     if (lvalue)
2700         return false;
2701
2702     /* In theory it shouldn't be possible to pass through a node twice, but
2703      * in case we add any kind of optimization pass for the AST itself, it
2704      * may still happen, thus we remember a created ir_value and simply return one
2705      * if it already exists.
2706      */
2707     if (self->expression.outr) {
2708         *out = self->expression.outr;
2709         return true;
2710     }
2711
2712     /* In the following, contraty to ast_ifthen, we assume both paths exist. */
2713
2714     /* generate the condition */
2715     func->curblock = cond;
2716     cgen = self->cond->codegen;
2717     if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
2718         return false;
2719     cond_out = func->curblock;
2720
2721     /* try constant folding away the condition */
2722     if ((fold = fold_cond_ternary(condval, func, self)) != -1)
2723         return fold;
2724
2725     /* create on-true block */
2726     ontrue = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_T"));
2727     if (!ontrue)
2728         return false;
2729     else
2730     {
2731         /* enter the block */
2732         func->curblock = ontrue;
2733
2734         /* generate */
2735         cgen = self->on_true->codegen;
2736         if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
2737             return false;
2738
2739         ontrue_out = func->curblock;
2740     }
2741
2742     /* create on-false block */
2743     onfalse = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_F"));
2744     if (!onfalse)
2745         return false;
2746     else
2747     {
2748         /* enter the block */
2749         func->curblock = onfalse;
2750
2751         /* generate */
2752         cgen = self->on_false->codegen;
2753         if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
2754             return false;
2755
2756         onfalse_out = func->curblock;
2757     }
2758
2759     /* create merge block */
2760     merge = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "tern_out"));
2761     if (!merge)
2762         return false;
2763     /* jump to merge block */
2764     if (!ir_block_create_jump(ontrue_out, ast_ctx(self), merge))
2765         return false;
2766     if (!ir_block_create_jump(onfalse_out, ast_ctx(self), merge))
2767         return false;
2768
2769     /* create if instruction */
2770     if (!ir_block_create_if(cond_out, ast_ctx(self), condval, ontrue, onfalse))
2771         return false;
2772
2773     /* Now enter the merge block */
2774     func->curblock = merge;
2775
2776     /* Here, now, we need a PHI node
2777      * but first some sanity checking...
2778      */
2779     if (trueval->vtype != falseval->vtype && trueval->vtype != TYPE_NIL && falseval->vtype != TYPE_NIL) {
2780         /* error("ternary with different types on the two sides"); */
2781         compile_error(ast_ctx(self), "internal error: ternary operand types invalid");
2782         return false;
2783     }
2784
2785     /* create PHI */
2786     phi = ir_block_create_phi(merge, ast_ctx(self), ast_function_label(func, "phi"), self->expression.vtype);
2787     if (!phi) {
2788         compile_error(ast_ctx(self), "internal error: failed to generate phi node");
2789         return false;
2790     }
2791     ir_phi_add(phi, ontrue_out,  trueval);
2792     ir_phi_add(phi, onfalse_out, falseval);
2793
2794     self->expression.outr = ir_phi_value(phi);
2795     *out = self->expression.outr;
2796
2797     codegen_output_type(self, *out);
2798
2799     return true;
2800 }
2801
2802 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
2803 {
2804     ast_expression_codegen *cgen;
2805
2806     ir_value *dummy      = NULL;
2807     ir_value *precond    = NULL;
2808     ir_value *postcond   = NULL;
2809
2810     /* Since we insert some jumps "late" so we have blocks
2811      * ordered "nicely", we need to keep track of the actual end-blocks
2812      * of expressions to add the jumps to.
2813      */
2814     ir_block *bbody      = NULL, *end_bbody      = NULL;
2815     ir_block *bprecond   = NULL, *end_bprecond   = NULL;
2816     ir_block *bpostcond  = NULL, *end_bpostcond  = NULL;
2817     ir_block *bincrement = NULL, *end_bincrement = NULL;
2818     ir_block *bout       = NULL, *bin            = NULL;
2819
2820     /* let's at least move the outgoing block to the end */
2821     size_t    bout_id;
2822
2823     /* 'break' and 'continue' need to be able to find the right blocks */
2824     ir_block *bcontinue     = NULL;
2825     ir_block *bbreak        = NULL;
2826
2827     ir_block *tmpblock      = NULL;
2828
2829     (void)lvalue;
2830     (void)out;
2831
2832     if (self->expression.outr) {
2833         compile_error(ast_ctx(self), "internal error: ast_loop cannot be reused, it bears no result!");
2834         return false;
2835     }
2836     self->expression.outr = (ir_value*)1;
2837
2838     /* NOTE:
2839      * Should we ever need some kind of block ordering, better make this function
2840      * move blocks around than write a block ordering algorithm later... after all
2841      * the ast and ir should work together, not against each other.
2842      */
2843
2844     /* initexpr doesn't get its own block, it's pointless, it could create more blocks
2845      * anyway if for example it contains a ternary.
2846      */
2847     if (self->initexpr)
2848     {
2849         cgen = self->initexpr->codegen;
2850         if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
2851             return false;
2852     }
2853
2854     /* Store the block from which we enter this chaos */
2855     bin = func->curblock;
2856
2857     /* The pre-loop condition needs its own block since we
2858      * need to be able to jump to the start of that expression.
2859      */
2860     if (self->precond)
2861     {
2862         bprecond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "pre_loop_cond"));
2863         if (!bprecond)
2864             return false;
2865
2866         /* the pre-loop-condition the least important place to 'continue' at */
2867         bcontinue = bprecond;
2868
2869         /* enter */
2870         func->curblock = bprecond;
2871
2872         /* generate */
2873         cgen = self->precond->codegen;
2874         if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
2875             return false;
2876
2877         end_bprecond = func->curblock;
2878     } else {
2879         bprecond = end_bprecond = NULL;
2880     }
2881
2882     /* Now the next blocks won't be ordered nicely, but we need to
2883      * generate them this early for 'break' and 'continue'.
2884      */
2885     if (self->increment) {
2886         bincrement = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_increment"));
2887         if (!bincrement)
2888             return false;
2889         bcontinue = bincrement; /* increment comes before the pre-loop-condition */
2890     } else {
2891         bincrement = end_bincrement = NULL;
2892     }
2893
2894     if (self->postcond) {
2895         bpostcond = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "post_loop_cond"));
2896         if (!bpostcond)
2897             return false;
2898         bcontinue = bpostcond; /* postcond comes before the increment */
2899     } else {
2900         bpostcond = end_bpostcond = NULL;
2901     }
2902
2903     bout_id = vec_size(func->ir_func->blocks);
2904     bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_loop"));
2905     if (!bout)
2906         return false;
2907     bbreak = bout;
2908
2909     /* The loop body... */
2910     /* if (self->body) */
2911     {
2912         bbody = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "loop_body"));
2913         if (!bbody)
2914             return false;
2915
2916         /* enter */
2917         func->curblock = bbody;
2918
2919         vec_push(func->breakblocks,    bbreak);
2920         if (bcontinue)
2921             vec_push(func->continueblocks, bcontinue);
2922         else
2923             vec_push(func->continueblocks, bbody);
2924
2925         /* generate */
2926         if (self->body) {
2927             cgen = self->body->codegen;
2928             if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
2929                 return false;
2930         }
2931
2932         end_bbody = func->curblock;
2933         vec_pop(func->breakblocks);
2934         vec_pop(func->continueblocks);
2935     }
2936
2937     /* post-loop-condition */
2938     if (self->postcond)
2939     {
2940         /* enter */
2941         func->curblock = bpostcond;
2942
2943         /* generate */
2944         cgen = self->postcond->codegen;
2945         if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
2946             return false;
2947
2948         end_bpostcond = func->curblock;
2949     }
2950
2951     /* The incrementor */
2952     if (self->increment)
2953     {
2954         /* enter */
2955         func->curblock = bincrement;
2956
2957         /* generate */
2958         cgen = self->increment->codegen;
2959         if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
2960             return false;
2961
2962         end_bincrement = func->curblock;
2963     }
2964
2965     /* In any case now, we continue from the outgoing block */
2966     func->curblock = bout;
2967
2968     /* Now all blocks are in place */
2969     /* From 'bin' we jump to whatever comes first */
2970     if      (bprecond)   tmpblock = bprecond;
2971     else                 tmpblock = bbody;    /* can never be null */
2972
2973     /* DEAD CODE
2974     else if (bpostcond)  tmpblock = bpostcond;
2975     else                 tmpblock = bout;
2976     */
2977
2978     if (!ir_block_create_jump(bin, ast_ctx(self), tmpblock))
2979         return false;
2980
2981     /* From precond */
2982     if (bprecond)
2983     {
2984         ir_block *ontrue, *onfalse;
2985         ontrue = bbody; /* can never be null */
2986
2987         /* all of this is dead code
2988         else if (bincrement) ontrue = bincrement;
2989         else                 ontrue = bpostcond;
2990         */
2991
2992         onfalse = bout;
2993         if (self->pre_not) {
2994             tmpblock = ontrue;
2995             ontrue   = onfalse;
2996             onfalse  = tmpblock;
2997         }
2998         if (!ir_block_create_if(end_bprecond, ast_ctx(self), precond, ontrue, onfalse))
2999             return false;
3000     }
3001
3002     /* from body */
3003     if (bbody)
3004     {
3005         if      (bincrement) tmpblock = bincrement;
3006         else if (bpostcond)  tmpblock = bpostcond;
3007         else if (bprecond)   tmpblock = bprecond;
3008         else                 tmpblock = bbody;
3009         if (!end_bbody->final && !ir_block_create_jump(end_bbody, ast_ctx(self), tmpblock))
3010             return false;
3011     }
3012
3013     /* from increment */
3014     if (bincrement)
3015     {
3016         if      (bpostcond)  tmpblock = bpostcond;
3017         else if (bprecond)   tmpblock = bprecond;
3018         else if (bbody)      tmpblock = bbody;
3019         else                 tmpblock = bout;
3020         if (!ir_block_create_jump(end_bincrement, ast_ctx(self), tmpblock))
3021             return false;
3022     }
3023
3024     /* from postcond */
3025     if (bpostcond)
3026     {
3027         ir_block *ontrue, *onfalse;
3028         if      (bprecond)   ontrue = bprecond;
3029         else                 ontrue = bbody; /* can never be null */
3030
3031         /* all of this is dead code
3032         else if (bincrement) ontrue = bincrement;
3033         else                 ontrue = bpostcond;
3034         */
3035
3036         onfalse = bout;
3037         if (self->post_not) {
3038             tmpblock = ontrue;
3039             ontrue   = onfalse;
3040             onfalse  = tmpblock;
3041         }
3042         if (!ir_block_create_if(end_bpostcond, ast_ctx(self), postcond, ontrue, onfalse))
3043             return false;
3044     }
3045
3046     /* Move 'bout' to the end */
3047     vec_remove(func->ir_func->blocks, bout_id, 1);
3048     vec_push(func->ir_func->blocks, bout);
3049
3050     return true;
3051 }
3052
3053 bool ast_breakcont_codegen(ast_breakcont *self, ast_function *func, bool lvalue, ir_value **out)
3054 {
3055     ir_block *target;
3056
3057     *out = NULL;
3058
3059     if (lvalue) {
3060         compile_error(ast_ctx(self), "break/continue expression is not an l-value");
3061         return false;
3062     }
3063
3064     if (self->expression.outr) {
3065         compile_error(ast_ctx(self), "internal error: ast_breakcont cannot be reused!");
3066         return false;
3067     }
3068     self->expression.outr = (ir_value*)1;
3069
3070     if (self->is_continue)
3071         target = func->continueblocks[vec_size(func->continueblocks)-1-self->levels];
3072     else
3073         target = func->breakblocks[vec_size(func->breakblocks)-1-self->levels];
3074
3075     if (!target) {
3076         compile_error(ast_ctx(self), "%s is lacking a target block", (self->is_continue ? "continue" : "break"));
3077         return false;
3078     }
3079
3080     if (!ir_block_create_jump(func->curblock, ast_ctx(self), target))
3081         return false;
3082     return true;
3083 }
3084
3085 bool ast_switch_codegen(ast_switch *self, ast_function *func, bool lvalue, ir_value **out)
3086 {
3087     ast_expression_codegen *cgen;
3088
3089     ast_switch_case *def_case     = NULL;
3090     ir_block        *def_bfall    = NULL;
3091     ir_block        *def_bfall_to = NULL;
3092     bool set_def_bfall_to = false;
3093
3094     ir_value *dummy     = NULL;
3095     ir_value *irop      = NULL;
3096     ir_block *bout      = NULL;
3097     ir_block *bfall     = NULL;
3098     size_t    bout_id;
3099     size_t    c;
3100
3101     char      typestr[1024];
3102     uint16_t  cmpinstr;
3103
3104     if (lvalue) {
3105         compile_error(ast_ctx(self), "switch expression is not an l-value");
3106         return false;
3107     }
3108
3109     if (self->expression.outr) {
3110         compile_error(ast_ctx(self), "internal error: ast_switch cannot be reused!");
3111         return false;
3112     }
3113     self->expression.outr = (ir_value*)1;
3114
3115     (void)lvalue;
3116     (void)out;
3117
3118     cgen = self->operand->codegen;
3119     if (!(*cgen)((ast_expression*)(self->operand), func, false, &irop))
3120         return false;
3121
3122     if (!vec_size(self->cases))
3123         return true;
3124
3125     cmpinstr = type_eq_instr[irop->vtype];
3126     if (cmpinstr >= VINSTR_END) {
3127         ast_type_to_string(self->operand, typestr, sizeof(typestr));
3128         compile_error(ast_ctx(self), "invalid type to perform a switch on: %s", typestr);
3129         return false;
3130     }
3131
3132     bout_id = vec_size(func->ir_func->blocks);
3133     bout = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "after_switch"));
3134     if (!bout)
3135         return false;
3136
3137     /* setup the break block */
3138     vec_push(func->breakblocks, bout);
3139
3140     /* Now create all cases */
3141     for (c = 0; c < vec_size(self->cases); ++c) {
3142         ir_value *cond, *val;
3143         ir_block *bcase, *bnot;
3144         size_t bnot_id;
3145
3146         ast_switch_case *swcase = &self->cases[c];
3147
3148         if (swcase->value) {
3149             /* A regular case */
3150             /* generate the condition operand */
3151             cgen = swcase->value->codegen;
3152             if (!(*cgen)((ast_expression*)(swcase->value), func, false, &val))
3153                 return false;
3154             /* generate the condition */
3155             cond = ir_block_create_binop(func->curblock, ast_ctx(self), ast_function_label(func, "switch_eq"), cmpinstr, irop, val);
3156             if (!cond)
3157                 return false;
3158
3159             bcase = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "case"));
3160             bnot_id = vec_size(func->ir_func->blocks);
3161             bnot = ir_function_create_block(ast_ctx(self), func->ir_func, ast_function_label(func, "not_case"));
3162             if (!bcase || !bnot)
3163                 return false;
3164             if (set_def_bfall_to) {
3165                 set_def_bfall_to = false;
3166                 def_bfall_to = bcase;
3167             }
3168             if (!ir_block_create_if(func->curblock, ast_ctx(self), cond, bcase, bnot))
3169                 return false;
3170
3171             /* Make the previous case-end fall through */
3172             if (bfall && !bfall->final) {
3173                 if (!ir_block_create_jump(bfall, ast_ctx(self), bcase))
3174                     return false;
3175             }
3176
3177             /* enter the case */
3178             func->curblock = bcase;
3179             cgen = swcase->code->codegen;
3180             if (!(*cgen)((ast_expression*)swcase->code, func, false, &dummy))
3181                 return false;
3182
3183             /* remember this block to fall through from */
3184             bfall = func->curblock;
3185
3186             /* enter the else and move it down */
3187             func->curblock = bnot;
3188             vec_remove(func->ir_func->blocks, bnot_id, 1);
3189             vec_push(func->ir_func->blocks, bnot);
3190         } else {
3191             /* The default case */
3192             /* Remember where to fall through from: */
3193             def_bfall = bfall;
3194             bfall     = NULL;
3195             /* remember which case it was */
3196             def_case  = swcase;
3197             /* And the next case will be remembered */
3198             set_def_bfall_to = true;
3199         }
3200     }
3201
3202     /* Jump from the last bnot to bout */
3203     if (bfall && !bfall->final && !ir_block_create_jump(bfall, ast_ctx(self), bout)) {
3204         /*
3205         astwarning(ast_ctx(bfall), WARN_???, "missing break after last case");
3206         */
3207         return false;
3208     }
3209
3210     /* If there was a default case, put it down here */
3211     if (def_case) {
3212         ir_block *bcase;
3213
3214         /* No need to create an extra block */
3215         bcase = func->curblock;
3216
3217         /* Insert the fallthrough jump */
3218         if (def_bfall && !def_bfall->final) {
3219             if (!ir_block_create_jump(def_bfall, ast_ctx(self), bcase))
3220                 return false;
3221         }
3222
3223         /* Now generate the default code */
3224         cgen = def_case->code->codegen;
3225         if (!(*cgen)((ast_expression*)def_case->code, func, false, &dummy))
3226             return false;
3227
3228         /* see if we need to fall through */
3229         if (def_bfall_to && !func->curblock->final)
3230         {
3231             if (!ir_block_create_jump(func->curblock, ast_ctx(self), def_bfall_to))
3232                 return false;
3233         }
3234     }
3235
3236     /* Jump from the last bnot to bout */
3237     if (!func->curblock->final && !ir_block_create_jump(func->curblock, ast_ctx(self), bout))
3238         return false;
3239     /* enter the outgoing block */
3240     func->curblock = bout;
3241
3242     /* restore the break block */
3243     vec_pop(func->breakblocks);
3244
3245     /* Move 'bout' to the end, it's nicer */
3246     vec_remove(func->ir_func->blocks, bout_id, 1);
3247     vec_push(func->ir_func->blocks, bout);
3248
3249     return true;
3250 }
3251
3252 bool ast_label_codegen(ast_label *self, ast_function *func, bool lvalue, ir_value **out)
3253 {
3254     size_t i;
3255     ir_value *dummy;
3256
3257     if (self->undefined) {
3258         compile_error(ast_ctx(self), "internal error: ast_label never defined");
3259         return false;
3260     }
3261
3262     *out = NULL;
3263     if (lvalue) {
3264         compile_error(ast_ctx(self), "internal error: ast_label cannot be an lvalue");
3265         return false;
3266     }
3267
3268     /* simply create a new block and jump to it */
3269     self->irblock = ir_function_create_block(ast_ctx(self), func->ir_func, self->name);
3270     if (!self->irblock) {
3271         compile_error(ast_ctx(self), "failed to allocate label block `%s`", self->name);
3272         return false;
3273     }
3274     if (!func->curblock->final) {
3275         if (!ir_block_create_jump(func->curblock, ast_ctx(self), self->irblock))
3276             return false;
3277     }
3278
3279     /* enter the new block */
3280     func->curblock = self->irblock;
3281
3282     /* Generate all the leftover gotos */
3283     for (i = 0; i < vec_size(self->gotos); ++i) {
3284         if (!ast_goto_codegen(self->gotos[i], func, false, &dummy))
3285             return false;
3286     }
3287
3288     return true;
3289 }
3290
3291 bool ast_goto_codegen(ast_goto *self, ast_function *func, bool lvalue, ir_value **out)
3292 {
3293     *out = NULL;
3294     if (lvalue) {
3295         compile_error(ast_ctx(self), "internal error: ast_goto cannot be an lvalue");
3296         return false;
3297     }
3298
3299     if (self->target->irblock) {
3300         if (self->irblock_from) {
3301             /* we already tried once, this is the callback */
3302             self->irblock_from->final = false;
3303             if (!ir_block_create_goto(self->irblock_from, ast_ctx(self), self->target->irblock)) {
3304                 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3305                 return false;
3306             }
3307         }
3308         else
3309         {
3310             if (!ir_block_create_goto(func->curblock, ast_ctx(self), self->target->irblock)) {
3311                 compile_error(ast_ctx(self), "failed to generate goto to `%s`", self->name);
3312                 return false;
3313             }
3314         }
3315     }
3316     else
3317     {
3318         /* the target has not yet been created...
3319          * close this block in a sneaky way:
3320          */
3321         func->curblock->final = true;
3322         self->irblock_from = func->curblock;
3323         ast_label_register_goto(self->target, self);
3324     }
3325
3326     return true;
3327 }
3328
3329 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
3330 {
3331     ast_expression_codegen *cgen;
3332     ir_value              **params;
3333     ir_instr               *callinstr;
3334     size_t i;
3335
3336     ir_value *funval = NULL;
3337
3338     /* return values are never lvalues */
3339     if (lvalue) {
3340         compile_error(ast_ctx(self), "not an l-value (function call)");
3341         return false;
3342     }
3343
3344     if (self->expression.outr) {
3345         *out = self->expression.outr;
3346         return true;
3347     }
3348
3349     cgen = self->func->codegen;
3350     if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
3351         return false;
3352     if (!funval)
3353         return false;
3354
3355     params = NULL;
3356
3357     /* parameters */
3358     for (i = 0; i < vec_size(self->params); ++i)
3359     {
3360         ir_value *param;
3361         ast_expression *expr = self->params[i];
3362
3363         cgen = expr->codegen;
3364         if (!(*cgen)(expr, func, false, &param))
3365             goto error;
3366         if (!param)
3367             goto error;
3368         vec_push(params, param);
3369     }
3370
3371     /* varargs counter */
3372     if (self->va_count) {
3373         ir_value   *va_count;
3374         ir_builder *builder = func->curblock->owner->owner;
3375         cgen = self->va_count->codegen;
3376         if (!(*cgen)((ast_expression*)(self->va_count), func, false, &va_count))
3377             return false;
3378         if (!ir_block_create_store_op(func->curblock, ast_ctx(self), INSTR_STORE_F,
3379                                       ir_builder_get_va_count(builder), va_count))
3380         {
3381             return false;
3382         }
3383     }
3384
3385     callinstr = ir_block_create_call(func->curblock, ast_ctx(self),
3386                                      ast_function_label(func, "call"),
3387                                      funval, !!(self->func->flags & AST_FLAG_NORETURN));
3388     if (!callinstr)
3389         goto error;
3390
3391     for (i = 0; i < vec_size(params); ++i) {
3392         ir_call_param(callinstr, params[i]);
3393     }
3394
3395     *out = ir_call_value(callinstr);
3396     self->expression.outr = *out;
3397
3398     codegen_output_type(self, *out);
3399
3400     vec_free(params);
3401     return true;
3402 error:
3403     vec_free(params);
3404     return false;
3405 }