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