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