ir.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 "ir.h"
  29
  30 /***********************************************************************
  31  * Type sizes used at multiple points in the IR codegen
  32  */
  33
  34 const char *type_name[TYPE_COUNT] = {
  35     "void",
  36     "string",
  37     "float",
  38     "vector",
  39     "entity",
  40     "field",
  41     "function",
  42     "pointer",
  43     "integer",
  44     "variant",
  45     "struct",
  46     "union",
  47     "array",
  48
  49     "nil",
  50     "<no-expression>"
  51 };
  52
  53 static size_t type_sizeof_[TYPE_COUNT] = {
  54     1, /* TYPE_VOID     */
  55     1, /* TYPE_STRING   */
  56     1, /* TYPE_FLOAT    */
  57     3, /* TYPE_VECTOR   */
  58     1, /* TYPE_ENTITY   */
  59     1, /* TYPE_FIELD    */
  60     1, /* TYPE_FUNCTION */
  61     1, /* TYPE_POINTER  */
  62     1, /* TYPE_INTEGER  */
  63     3, /* TYPE_VARIANT  */
  64     0, /* TYPE_STRUCT   */
  65     0, /* TYPE_UNION    */
  66     0, /* TYPE_ARRAY    */
  67     0, /* TYPE_NIL      */
  68     0, /* TYPE_NOESPR   */
  69 };
  70
  71 const uint16_t type_store_instr[TYPE_COUNT] = {
  72     INSTR_STORE_F, /* should use I when having integer support */
  73     INSTR_STORE_S,
  74     INSTR_STORE_F,
  75     INSTR_STORE_V,
  76     INSTR_STORE_ENT,
  77     INSTR_STORE_FLD,
  78     INSTR_STORE_FNC,
  79     INSTR_STORE_ENT, /* should use I */
  80 #if 0
  81     INSTR_STORE_I, /* integer type */
  82 #else
  83     INSTR_STORE_F,
  84 #endif
  85
  86     INSTR_STORE_V, /* variant, should never be accessed */
  87
  88     VINSTR_END, /* struct */
  89     VINSTR_END, /* union  */
  90     VINSTR_END, /* array  */
  91     VINSTR_END, /* nil    */
  92     VINSTR_END, /* noexpr */
  93 };
  94
  95 const uint16_t field_store_instr[TYPE_COUNT] = {
  96     INSTR_STORE_FLD,
  97     INSTR_STORE_FLD,
  98     INSTR_STORE_FLD,
  99     INSTR_STORE_V,
 100     INSTR_STORE_FLD,
 101     INSTR_STORE_FLD,
 102     INSTR_STORE_FLD,
 103     INSTR_STORE_FLD,
 104 #if 0
 105     INSTR_STORE_FLD, /* integer type */
 106 #else
 107     INSTR_STORE_FLD,
 108 #endif
 109
 110     INSTR_STORE_V, /* variant, should never be accessed */
 111
 112     VINSTR_END, /* struct */
 113     VINSTR_END, /* union  */
 114     VINSTR_END, /* array  */
 115     VINSTR_END, /* nil    */
 116     VINSTR_END, /* noexpr */
 117 };
 118
 119 const uint16_t type_storep_instr[TYPE_COUNT] = {
 120     INSTR_STOREP_F, /* should use I when having integer support */
 121     INSTR_STOREP_S,
 122     INSTR_STOREP_F,
 123     INSTR_STOREP_V,
 124     INSTR_STOREP_ENT,
 125     INSTR_STOREP_FLD,
 126     INSTR_STOREP_FNC,
 127     INSTR_STOREP_ENT, /* should use I */
 128 #if 0
 129     INSTR_STOREP_ENT, /* integer type */
 130 #else
 131     INSTR_STOREP_F,
 132 #endif
 133
 134     INSTR_STOREP_V, /* variant, should never be accessed */
 135
 136     VINSTR_END, /* struct */
 137     VINSTR_END, /* union  */
 138     VINSTR_END, /* array  */
 139     VINSTR_END, /* nil    */
 140     VINSTR_END, /* noexpr */
 141 };
 142
 143 const uint16_t type_eq_instr[TYPE_COUNT] = {
 144     INSTR_EQ_F, /* should use I when having integer support */
 145     INSTR_EQ_S,
 146     INSTR_EQ_F,
 147     INSTR_EQ_V,
 148     INSTR_EQ_E,
 149     INSTR_EQ_E, /* FLD has no comparison */
 150     INSTR_EQ_FNC,
 151     INSTR_EQ_E, /* should use I */
 152 #if 0
 153     INSTR_EQ_I,
 154 #else
 155     INSTR_EQ_F,
 156 #endif
 157
 158     INSTR_EQ_V, /* variant, should never be accessed */
 159
 160     VINSTR_END, /* struct */
 161     VINSTR_END, /* union  */
 162     VINSTR_END, /* array  */
 163     VINSTR_END, /* nil    */
 164     VINSTR_END, /* noexpr */
 165 };
 166
 167 const uint16_t type_ne_instr[TYPE_COUNT] = {
 168     INSTR_NE_F, /* should use I when having integer support */
 169     INSTR_NE_S,
 170     INSTR_NE_F,
 171     INSTR_NE_V,
 172     INSTR_NE_E,
 173     INSTR_NE_E, /* FLD has no comparison */
 174     INSTR_NE_FNC,
 175     INSTR_NE_E, /* should use I */
 176 #if 0
 177     INSTR_NE_I,
 178 #else
 179     INSTR_NE_F,
 180 #endif
 181
 182     INSTR_NE_V, /* variant, should never be accessed */
 183
 184     VINSTR_END, /* struct */
 185     VINSTR_END, /* union  */
 186     VINSTR_END, /* array  */
 187     VINSTR_END, /* nil    */
 188     VINSTR_END, /* noexpr */
 189 };
 190
 191 const uint16_t type_not_instr[TYPE_COUNT] = {
 192     INSTR_NOT_F, /* should use I when having integer support */
 193     VINSTR_END,  /* not to be used, depends on string related -f flags */
 194     INSTR_NOT_F,
 195     INSTR_NOT_V,
 196     INSTR_NOT_ENT,
 197     INSTR_NOT_ENT,
 198     INSTR_NOT_FNC,
 199     INSTR_NOT_ENT, /* should use I */
 200 #if 0
 201     INSTR_NOT_I, /* integer type */
 202 #else
 203     INSTR_NOT_F,
 204 #endif
 205
 206     INSTR_NOT_V, /* variant, should never be accessed */
 207
 208     VINSTR_END, /* struct */
 209     VINSTR_END, /* union  */
 210     VINSTR_END, /* array  */
 211     VINSTR_END, /* nil    */
 212     VINSTR_END, /* noexpr */
 213 };
 214
 215 /* protos */
 216 static ir_value*       ir_value_var(const char *name, int st, int vtype);
 217 static bool            ir_value_set_name(ir_value*, const char *name);
 218 static void            ir_value_dump(ir_value*, int (*oprintf)(const char*,...));
 219
 220 static ir_value*       ir_gen_extparam_proto(ir_builder *ir);
 221 static void            ir_gen_extparam      (ir_builder *ir);
 222
 223 static bool            ir_builder_set_name(ir_builder *self, const char *name);
 224
 225 static ir_function*    ir_function_new(struct ir_builder_s *owner, int returntype);
 226 static bool            ir_function_set_name(ir_function*, const char *name);
 227 static void            ir_function_delete(ir_function*);
 228 static void            ir_function_dump(ir_function*, char *ind, int (*oprintf)(const char*,...));
 229
 230 static ir_value*       ir_block_create_general_instr(ir_block *self, lex_ctx_t, const char *label,
 231                                         int op, ir_value *a, ir_value *b, int outype);
 232 static void            ir_block_delete(ir_block*);
 233 static ir_block*       ir_block_new(struct ir_function_s *owner, const char *label);
 234 static bool GMQCC_WARN ir_block_create_store(ir_block*, lex_ctx_t, ir_value *target, ir_value *what);
 235 static bool            ir_block_set_label(ir_block*, const char *label);
 236 static void            ir_block_dump(ir_block*, char *ind, int (*oprintf)(const char*,...));
 237
 238 static bool            ir_instr_op(ir_instr*, int op, ir_value *value, bool writing);
 239 static void            ir_instr_delete(ir_instr*);
 240 static void            ir_instr_dump(ir_instr* in, char *ind, int (*oprintf)(const char*,...));
 241 /* error functions */
 242
 243 static void irerror(lex_ctx_t ctx, const char *msg, ...)
 244 {
 245     va_list ap;
 246     va_start(ap, msg);
 247     con_cvprintmsg(ctx, LVL_ERROR, "internal error", msg, ap);
 248     va_end(ap);
 249 }
 250
 251 static bool GMQCC_WARN irwarning(lex_ctx_t ctx, int warntype, const char *fmt, ...)
 252 {
 253     bool    r;
 254     va_list ap;
 255     va_start(ap, fmt);
 256     r = vcompile_warning(ctx, warntype, fmt, ap);
 257     va_end(ap);
 258     return r;
 259 }
 260
 261 /***********************************************************************
 262  * Vector utility functions
 263  */
 264
 265 static bool GMQCC_WARN vec_ir_value_find(ir_value **vec, const ir_value *what, size_t *idx)
 266 {
 267     size_t i;
 268     size_t len = vec_size(vec);
 269     for (i = 0; i < len; ++i) {
 270         if (vec[i] == what) {
 271             if (idx) *idx = i;
 272             return true;
 273         }
 274     }
 275     return false;
 276 }
 277
 278 static bool GMQCC_WARN vec_ir_block_find(ir_block **vec, ir_block *what, size_t *idx)
 279 {
 280     size_t i;
 281     size_t len = vec_size(vec);
 282     for (i = 0; i < len; ++i) {
 283         if (vec[i] == what) {
 284             if (idx) *idx = i;
 285             return true;
 286         }
 287     }
 288     return false;
 289 }
 290
 291 static bool GMQCC_WARN vec_ir_instr_find(ir_instr **vec, ir_instr *what, size_t *idx)
 292 {
 293     size_t i;
 294     size_t len = vec_size(vec);
 295     for (i = 0; i < len; ++i) {
 296         if (vec[i] == what) {
 297             if (idx) *idx = i;
 298             return true;
 299         }
 300     }
 301     return false;
 302 }
 303
 304 /***********************************************************************
 305  * IR Builder
 306  */
 307
 308 static void ir_block_delete_quick(ir_block* self);
 309 static void ir_instr_delete_quick(ir_instr *self);
 310 static void ir_function_delete_quick(ir_function *self);
 311
 312 ir_builder* ir_builder_new(const char *modulename)
 313 {
 314     ir_builder* self;
 315     size_t      i;
 316
 317     self = (ir_builder*)mem_a(sizeof(*self));
 318     if (!self)
 319         return NULL;
 320
 321     self->functions   = NULL;
 322     self->globals     = NULL;
 323     self->fields      = NULL;
 324     self->filenames   = NULL;
 325     self->filestrings = NULL;
 326     self->htglobals   = util_htnew(IR_HT_SIZE);
 327     self->htfields    = util_htnew(IR_HT_SIZE);
 328     self->htfunctions = util_htnew(IR_HT_SIZE);
 329
 330     self->extparams       = NULL;
 331     self->extparam_protos = NULL;
 332
 333     self->first_common_globaltemp = 0;
 334     self->max_globaltemps         = 0;
 335     self->first_common_local      = 0;
 336     self->max_locals              = 0;
 337
 338     self->str_immediate = 0;
 339     self->name = NULL;
 340     if (!ir_builder_set_name(self, modulename)) {
 341         mem_d(self);
 342         return NULL;
 343     }
 344
 345     self->nil = ir_value_var("nil", store_value, TYPE_NIL);
 346     self->nil->cvq = CV_CONST;
 347
 348     for (i = 0; i != IR_MAX_VINSTR_TEMPS; ++i) {
 349         /* we write to them, but they're not supposed to be used outside the IR, so
 350          * let's not allow the generation of ir_instrs which use these.
 351          * So it's a constant noexpr.
 352          */
 353         self->vinstr_temp[i] = ir_value_var("vinstr_temp", store_value, TYPE_NOEXPR);
 354         self->vinstr_temp[i]->cvq = CV_CONST;
 355     }
 356
 357     self->reserved_va_count = NULL;
 358     self->code              = code_init();
 359
 360     return self;
 361 }
 362
 363 void ir_builder_delete(ir_builder* self)
 364 {
 365     size_t i;
 366     util_htdel(self->htglobals);
 367     util_htdel(self->htfields);
 368     util_htdel(self->htfunctions);
 369     mem_d((void*)self->name);
 370     for (i = 0; i != vec_size(self->functions); ++i) {
 371         ir_function_delete_quick(self->functions[i]);
 372     }
 373     vec_free(self->functions);
 374     for (i = 0; i != vec_size(self->extparams); ++i) {
 375         ir_value_delete(self->extparams[i]);
 376     }
 377     vec_free(self->extparams);
 378     vec_free(self->extparam_protos);
 379     for (i = 0; i != vec_size(self->globals); ++i) {
 380         ir_value_delete(self->globals[i]);
 381     }
 382     vec_free(self->globals);
 383     for (i = 0; i != vec_size(self->fields); ++i) {
 384         ir_value_delete(self->fields[i]);
 385     }
 386     ir_value_delete(self->nil);
 387     for (i = 0; i != IR_MAX_VINSTR_TEMPS; ++i) {
 388         ir_value_delete(self->vinstr_temp[i]);
 389     }
 390     vec_free(self->fields);
 391     vec_free(self->filenames);
 392     vec_free(self->filestrings);
 393
 394     code_cleanup(self->code);
 395     mem_d(self);
 396 }
 397
 398 bool ir_builder_set_name(ir_builder *self, const char *name)
 399 {
 400     if (self->name)
 401         mem_d((void*)self->name);
 402     self->name = util_strdup(name);
 403     return !!self->name;
 404 }
 405
 406 static ir_function* ir_builder_get_function(ir_builder *self, const char *name)
 407 {
 408     return (ir_function*)util_htget(self->htfunctions, name);
 409 }
 410
 411 ir_function* ir_builder_create_function(ir_builder *self, const char *name, int outtype)
 412 {
 413     ir_function *fn = ir_builder_get_function(self, name);
 414     if (fn) {
 415         return NULL;
 416     }
 417
 418     fn = ir_function_new(self, outtype);
 419     if (!ir_function_set_name(fn, name))
 420     {
 421         ir_function_delete(fn);
 422         return NULL;
 423     }
 424     vec_push(self->functions, fn);
 425     util_htset(self->htfunctions, name, fn);
 426
 427     fn->value = ir_builder_create_global(self, fn->name, TYPE_FUNCTION);
 428     if (!fn->value) {
 429         ir_function_delete(fn);
 430         return NULL;
 431     }
 432
 433     fn->value->hasvalue = true;
 434     fn->value->outtype = outtype;
 435     fn->value->constval.vfunc = fn;
 436     fn->value->context = fn->context;
 437
 438     return fn;
 439 }
 440
 441 static ir_value* ir_builder_get_global(ir_builder *self, const char *name)
 442 {
 443     return (ir_value*)util_htget(self->htglobals, name);
 444 }
 445
 446 ir_value* ir_builder_create_global(ir_builder *self, const char *name, int vtype)
 447 {
 448     ir_value *ve;
 449
 450     if (name[0] != '#')
 451     {
 452         ve = ir_builder_get_global(self, name);
 453         if (ve) {
 454             return NULL;
 455         }
 456     }
 457
 458     ve = ir_value_var(name, store_global, vtype);
 459     vec_push(self->globals, ve);
 460     util_htset(self->htglobals, name, ve);
 461     return ve;
 462 }
 463
 464 ir_value* ir_builder_get_va_count(ir_builder *self)
 465 {
 466     if (self->reserved_va_count)
 467         return self->reserved_va_count;
 468     return (self->reserved_va_count = ir_builder_create_global(self, "reserved:va_count", TYPE_FLOAT));
 469 }
 470
 471 static ir_value* ir_builder_get_field(ir_builder *self, const char *name)
 472 {
 473     return (ir_value*)util_htget(self->htfields, name);
 474 }
 475
 476
 477 ir_value* ir_builder_create_field(ir_builder *self, const char *name, int vtype)
 478 {
 479     ir_value *ve = ir_builder_get_field(self, name);
 480     if (ve) {
 481         return NULL;
 482     }
 483
 484     ve = ir_value_var(name, store_global, TYPE_FIELD);
 485     ve->fieldtype = vtype;
 486     vec_push(self->fields, ve);
 487     util_htset(self->htfields, name, ve);
 488     return ve;
 489 }
 490
 491 /***********************************************************************
 492  *IR Function
 493  */
 494
 495 static bool ir_function_naive_phi(ir_function*);
 496 static void ir_function_enumerate(ir_function*);
 497 static bool ir_function_calculate_liferanges(ir_function*);
 498 static bool ir_function_allocate_locals(ir_function*);
 499
 500 ir_function* ir_function_new(ir_builder* owner, int outtype)
 501 {
 502     ir_function *self;
 503     self = (ir_function*)mem_a(sizeof(*self));
 504
 505     if (!self)
 506         return NULL;
 507
 508     memset(self, 0, sizeof(*self));
 509
 510     self->name = NULL;
 511     if (!ir_function_set_name(self, "<@unnamed>")) {
 512         mem_d(self);
 513         return NULL;
 514     }
 515     self->flags = 0;
 516
 517     self->owner = owner;
 518     self->context.file = "<@no context>";
 519     self->context.line = 0;
 520     self->outtype = outtype;
 521     self->value = NULL;
 522     self->builtin = 0;
 523
 524     self->params = NULL;
 525     self->blocks = NULL;
 526     self->values = NULL;
 527     self->locals = NULL;
 528
 529     self->max_varargs = 0;
 530
 531     self->code_function_def = -1;
 532     self->allocated_locals = 0;
 533     self->globaltemps      = 0;
 534
 535     self->run_id = 0;
 536     return self;
 537 }
 538
 539 bool ir_function_set_name(ir_function *self, const char *name)
 540 {
 541     if (self->name)
 542         mem_d((void*)self->name);
 543     self->name = util_strdup(name);
 544     return !!self->name;
 545 }
 546
 547 static void ir_function_delete_quick(ir_function *self)
 548 {
 549     size_t i;
 550     mem_d((void*)self->name);
 551
 552     for (i = 0; i != vec_size(self->blocks); ++i)
 553         ir_block_delete_quick(self->blocks[i]);
 554     vec_free(self->blocks);
 555
 556     vec_free(self->params);
 557
 558     for (i = 0; i != vec_size(self->values); ++i)
 559         ir_value_delete(self->values[i]);
 560     vec_free(self->values);
 561
 562     for (i = 0; i != vec_size(self->locals); ++i)
 563         ir_value_delete(self->locals[i]);
 564     vec_free(self->locals);
 565
 566     /* self->value is deleted by the builder */
 567
 568     mem_d(self);
 569 }
 570
 571 void ir_function_delete(ir_function *self)
 572 {
 573     size_t i;
 574     mem_d((void*)self->name);
 575
 576     for (i = 0; i != vec_size(self->blocks); ++i)
 577         ir_block_delete(self->blocks[i]);
 578     vec_free(self->blocks);
 579
 580     vec_free(self->params);
 581
 582     for (i = 0; i != vec_size(self->values); ++i)
 583         ir_value_delete(self->values[i]);
 584     vec_free(self->values);
 585
 586     for (i = 0; i != vec_size(self->locals); ++i)
 587         ir_value_delete(self->locals[i]);
 588     vec_free(self->locals);
 589
 590     /* self->value is deleted by the builder */
 591
 592     mem_d(self);
 593 }
 594
 595 static void ir_function_collect_value(ir_function *self, ir_value *v)
 596 {
 597     vec_push(self->values, v);
 598 }
 599
 600 ir_block* ir_function_create_block(lex_ctx_t ctx, ir_function *self, const char *label)
 601 {
 602     ir_block* bn = ir_block_new(self, label);
 603     bn->context = ctx;
 604     vec_push(self->blocks, bn);
 605     return bn;
 606 }
 607
 608 static bool instr_is_operation(uint16_t op)
 609 {
 610     return ( (op >= INSTR_MUL_F  && op <= INSTR_GT) ||
 611              (op >= INSTR_LOAD_F && op <= INSTR_LOAD_FNC) ||
 612              (op == INSTR_ADDRESS) ||
 613              (op >= INSTR_NOT_F  && op <= INSTR_NOT_FNC) ||
 614              (op >= INSTR_AND    && op <= INSTR_BITOR) ||
 615              (op >= INSTR_CALL0  && op <= INSTR_CALL8) ||
 616              (op >= VINSTR_BITAND_V && op <= VINSTR_NEG_V) );
 617 }
 618
 619 static bool ir_function_pass_peephole(ir_function *self)
 620 {
 621     size_t b;
 622
 623     for (b = 0; b < vec_size(self->blocks); ++b) {
 624         size_t    i;
 625         ir_block *block = self->blocks[b];
 626
 627         for (i = 0; i < vec_size(block->instr); ++i) {
 628             ir_instr *inst;
 629             inst = block->instr[i];
 630
 631             if (i >= 1 &&
 632                 (inst->opcode >= INSTR_STORE_F &&
 633                  inst->opcode <= INSTR_STORE_FNC))
 634             {
 635                 ir_instr *store;
 636                 ir_instr *oper;
 637                 ir_value *value;
 638
 639                 store = inst;
 640
 641                 oper  = block->instr[i-1];
 642                 if (!instr_is_operation(oper->opcode))
 643                     continue;
 644
 645                 /* Don't change semantics of MUL_VF in engines where these may not alias. */
 646                 if (OPTS_FLAG(LEGACY_VECTOR_MATHS)) {
 647                     if (oper->opcode == INSTR_MUL_VF && oper->_ops[2]->memberof == oper->_ops[1])
 648                         continue;
 649                     if (oper->opcode == INSTR_MUL_FV && oper->_ops[1]->memberof == oper->_ops[2])
 650                         continue;
 651                 }
 652
 653                 value = oper->_ops[0];
 654
 655                 /* only do it for SSA values */
 656                 if (value->store != store_value)
 657                     continue;
 658
 659                 /* don't optimize out the temp if it's used later again */
 660                 if (vec_size(value->reads) != 1)
 661                     continue;
 662
 663                 /* The very next store must use this value */
 664                 if (value->reads[0] != store)
 665                     continue;
 666
 667                 /* And of course the store must _read_ from it, so it's in
 668                  * OP 1 */
 669                 if (store->_ops[1] != value)
 670                     continue;
 671
 672                 ++opts_optimizationcount[OPTIM_PEEPHOLE];
 673                 (void)!ir_instr_op(oper, 0, store->_ops[0], true);
 674
 675                 vec_remove(block->instr, i, 1);
 676                 ir_instr_delete(store);
 677             }
 678             else if (inst->opcode == VINSTR_COND)
 679             {
 680                 /* COND on a value resulting from a NOT could
 681                  * remove the NOT and swap its operands
 682                  */
 683                 while (true) {
 684                     ir_block *tmp;
 685                     size_t    inotid;
 686                     ir_instr *inot;
 687                     ir_value *value;
 688                     value = inst->_ops[0];
 689
 690                     if (value->store != store_value ||
 691                         vec_size(value->reads) != 1 ||
 692                         value->reads[0] != inst)
 693                     {
 694                         break;
 695                     }
 696
 697                     inot = value->writes[0];
 698                     if (inot->_ops[0] != value ||
 699                         inot->opcode < INSTR_NOT_F ||
 700                         inot->opcode > INSTR_NOT_FNC ||
 701                         inot->opcode == INSTR_NOT_V || /* can't do these */
 702                         inot->opcode == INSTR_NOT_S)
 703                     {
 704                         break;
 705                     }
 706
 707                     /* count */
 708                     ++opts_optimizationcount[OPTIM_PEEPHOLE];
 709                     /* change operand */
 710                     (void)!ir_instr_op(inst, 0, inot->_ops[1], false);
 711                     /* remove NOT */
 712                     tmp = inot->owner;
 713                     for (inotid = 0; inotid < vec_size(tmp->instr); ++inotid) {
 714                         if (tmp->instr[inotid] == inot)
 715                             break;
 716                     }
 717                     if (inotid >= vec_size(tmp->instr)) {
 718                         compile_error(inst->context, "sanity-check failed: failed to find instruction to optimize out");
 719                         return false;
 720                     }
 721                     vec_remove(tmp->instr, inotid, 1);
 722                     ir_instr_delete(inot);
 723                     /* swap ontrue/onfalse */
 724                     tmp = inst->bops[0];
 725                     inst->bops[0] = inst->bops[1];
 726                     inst->bops[1] = tmp;
 727                 }
 728                 continue;
 729             }
 730         }
 731     }
 732
 733     return true;
 734 }
 735
 736 static bool ir_function_pass_tailrecursion(ir_function *self)
 737 {
 738     size_t b, p;
 739
 740     for (b = 0; b < vec_size(self->blocks); ++b) {
 741         ir_value *funcval;
 742         ir_instr *ret, *call, *store = NULL;
 743         ir_block *block = self->blocks[b];
 744
 745         if (!block->final || vec_size(block->instr) < 2)
 746             continue;
 747
 748         ret = block->instr[vec_size(block->instr)-1];
 749         if (ret->opcode != INSTR_DONE && ret->opcode != INSTR_RETURN)
 750             continue;
 751
 752         call = block->instr[vec_size(block->instr)-2];
 753         if (call->opcode >= INSTR_STORE_F && call->opcode <= INSTR_STORE_FNC) {
 754             /* account for the unoptimized
 755              * CALL
 756              * STORE %return, %tmp
 757              * RETURN %tmp
 758              * version
 759              */
 760             if (vec_size(block->instr) < 3)
 761                 continue;
 762
 763             store = call;
 764             call = block->instr[vec_size(block->instr)-3];
 765         }
 766
 767         if (call->opcode < INSTR_CALL0 || call->opcode > INSTR_CALL8)
 768             continue;
 769
 770         if (store) {
 771             /* optimize out the STORE */
 772             if (ret->_ops[0]   &&
 773                 ret->_ops[0]   == store->_ops[0] &&
 774                 store->_ops[1] == call->_ops[0])
 775             {
 776                 ++opts_optimizationcount[OPTIM_PEEPHOLE];
 777                 call->_ops[0] = store->_ops[0];
 778                 vec_remove(block->instr, vec_size(block->instr) - 2, 1);
 779                 ir_instr_delete(store);
 780             }
 781             else
 782                 continue;
 783         }
 784
 785         if (!call->_ops[0])
 786             continue;
 787
 788         funcval = call->_ops[1];
 789         if (!funcval)
 790             continue;
 791         if (funcval->vtype != TYPE_FUNCTION || funcval->constval.vfunc != self)
 792             continue;
 793
 794         /* now we have a CALL and a RET, check if it's a tailcall */
 795         if (ret->_ops[0] && call->_ops[0] != ret->_ops[0])
 796             continue;
 797
 798         ++opts_optimizationcount[OPTIM_TAIL_RECURSION];
 799         vec_shrinkby(block->instr, 2);
 800
 801         block->final = false; /* open it back up */
 802
 803         /* emite parameter-stores */
 804         for (p = 0; p < vec_size(call->params); ++p) {
 805             /* assert(call->params_count <= self->locals_count); */
 806             if (!ir_block_create_store(block, call->context, self->locals[p], call->params[p])) {
 807                 irerror(call->context, "failed to create tailcall store instruction for parameter %i", (int)p);
 808                 return false;
 809             }
 810         }
 811         if (!ir_block_create_jump(block, call->context, self->blocks[0])) {
 812             irerror(call->context, "failed to create tailcall jump");
 813             return false;
 814         }
 815
 816         ir_instr_delete(call);
 817         ir_instr_delete(ret);
 818     }
 819
 820     return true;
 821 }
 822
 823 bool ir_function_finalize(ir_function *self)
 824 {
 825     size_t i;
 826
 827     if (self->builtin)
 828         return true;
 829
 830     if (OPTS_OPTIMIZATION(OPTIM_PEEPHOLE)) {
 831         if (!ir_function_pass_peephole(self)) {
 832             irerror(self->context, "generic optimization pass broke something in `%s`", self->name);
 833             return false;
 834         }
 835     }
 836
 837     if (OPTS_OPTIMIZATION(OPTIM_TAIL_RECURSION)) {
 838         if (!ir_function_pass_tailrecursion(self)) {
 839             irerror(self->context, "tail-recursion optimization pass broke something in `%s`", self->name);
 840             return false;
 841         }
 842     }
 843
 844     if (!ir_function_naive_phi(self)) {
 845         irerror(self->context, "internal error: ir_function_naive_phi failed");
 846         return false;
 847     }
 848
 849     for (i = 0; i < vec_size(self->locals); ++i) {
 850         ir_value *v = self->locals[i];
 851         if (v->vtype == TYPE_VECTOR ||
 852             (v->vtype == TYPE_FIELD && v->outtype == TYPE_VECTOR))
 853         {
 854             ir_value_vector_member(v, 0);
 855             ir_value_vector_member(v, 1);
 856             ir_value_vector_member(v, 2);
 857         }
 858     }
 859     for (i = 0; i < vec_size(self->values); ++i) {
 860         ir_value *v = self->values[i];
 861         if (v->vtype == TYPE_VECTOR ||
 862             (v->vtype == TYPE_FIELD && v->outtype == TYPE_VECTOR))
 863         {
 864             ir_value_vector_member(v, 0);
 865             ir_value_vector_member(v, 1);
 866             ir_value_vector_member(v, 2);
 867         }
 868     }
 869
 870     ir_function_enumerate(self);
 871
 872     if (!ir_function_calculate_liferanges(self))
 873         return false;
 874     if (!ir_function_allocate_locals(self))
 875         return false;
 876     return true;
 877 }
 878
 879 ir_value* ir_function_create_local(ir_function *self, const char *name, int vtype, bool param)
 880 {
 881     ir_value *ve;
 882
 883     if (param &&
 884         vec_size(self->locals) &&
 885         self->locals[vec_size(self->locals)-1]->store != store_param) {
 886         irerror(self->context, "cannot add parameters after adding locals");
 887         return NULL;
 888     }
 889
 890     ve = ir_value_var(name, (param ? store_param : store_local), vtype);
 891     if (param)
 892         ve->locked = true;
 893     vec_push(self->locals, ve);
 894     return ve;
 895 }
 896
 897 /***********************************************************************
 898  *IR Block
 899  */
 900
 901 ir_block* ir_block_new(ir_function* owner, const char *name)
 902 {
 903     ir_block *self;
 904     self = (ir_block*)mem_a(sizeof(*self));
 905     if (!self)
 906         return NULL;
 907
 908     memset(self, 0, sizeof(*self));
 909
 910     self->label = NULL;
 911     if (name && !ir_block_set_label(self, name)) {
 912         mem_d(self);
 913         return NULL;
 914     }
 915     self->owner = owner;
 916     self->context.file = "<@no context>";
 917     self->context.line = 0;
 918     self->final = false;
 919
 920     self->instr   = NULL;
 921     self->entries = NULL;
 922     self->exits   = NULL;
 923
 924     self->eid = 0;
 925     self->is_return = false;
 926
 927     self->living = NULL;
 928
 929     self->generated = false;
 930
 931     return self;
 932 }
 933
 934 static void ir_block_delete_quick(ir_block* self)
 935 {
 936     size_t i;
 937     if (self->label) mem_d(self->label);
 938     for (i = 0; i != vec_size(self->instr); ++i)
 939         ir_instr_delete_quick(self->instr[i]);
 940     vec_free(self->instr);
 941     vec_free(self->entries);
 942     vec_free(self->exits);
 943     vec_free(self->living);
 944     mem_d(self);
 945 }
 946
 947 void ir_block_delete(ir_block* self)
 948 {
 949     size_t i;
 950     if (self->label) mem_d(self->label);
 951     for (i = 0; i != vec_size(self->instr); ++i)
 952         ir_instr_delete(self->instr[i]);
 953     vec_free(self->instr);
 954     vec_free(self->entries);
 955     vec_free(self->exits);
 956     vec_free(self->living);
 957     mem_d(self);
 958 }
 959
 960 bool ir_block_set_label(ir_block *self, const char *name)
 961 {
 962     if (self->label)
 963         mem_d((void*)self->label);
 964     self->label = util_strdup(name);
 965     return !!self->label;
 966 }
 967
 968 /***********************************************************************
 969  *IR Instructions
 970  */
 971
 972 static ir_instr* ir_instr_new(lex_ctx_t ctx, ir_block* owner, int op)
 973 {
 974     ir_instr *self;
 975     self = (ir_instr*)mem_a(sizeof(*self));
 976     if (!self)
 977         return NULL;
 978
 979     self->owner = owner;
 980     self->context = ctx;
 981     self->opcode = op;
 982     self->_ops[0] = NULL;
 983     self->_ops[1] = NULL;
 984     self->_ops[2] = NULL;
 985     self->bops[0] = NULL;
 986     self->bops[1] = NULL;
 987
 988     self->phi    = NULL;
 989     self->params = NULL;
 990
 991     self->eid = 0;
 992
 993     self->likely = true;
 994     return self;
 995 }
 996
 997 static void ir_instr_delete_quick(ir_instr *self)
 998 {
 999     vec_free(self->phi);
1000     vec_free(self->params);
1001     mem_d(self);
1002 }
1003
1004 static void ir_instr_delete(ir_instr *self)
1005 {
1006     size_t i;
1007     /* The following calls can only delete from
1008      * vectors, we still want to delete this instruction
1009      * so ignore the return value. Since with the warn_unused_result attribute
1010      * gcc doesn't care about an explicit: (void)foo(); to ignore the result,
1011      * I have to improvise here and use if(foo());
1012      */
1013     for (i = 0; i < vec_size(self->phi); ++i) {
1014         size_t idx;
1015         if (vec_ir_instr_find(self->phi[i].value->writes, self, &idx))
1016             vec_remove(self->phi[i].value->writes, idx, 1);
1017         if (vec_ir_instr_find(self->phi[i].value->reads, self, &idx))
1018             vec_remove(self->phi[i].value->reads, idx, 1);
1019     }
1020     vec_free(self->phi);
1021     for (i = 0; i < vec_size(self->params); ++i) {
1022         size_t idx;
1023         if (vec_ir_instr_find(self->params[i]->writes, self, &idx))
1024             vec_remove(self->params[i]->writes, idx, 1);
1025         if (vec_ir_instr_find(self->params[i]->reads, self, &idx))
1026             vec_remove(self->params[i]->reads, idx, 1);
1027     }
1028     vec_free(self->params);
1029     (void)!ir_instr_op(self, 0, NULL, false);
1030     (void)!ir_instr_op(self, 1, NULL, false);
1031     (void)!ir_instr_op(self, 2, NULL, false);
1032     mem_d(self);
1033 }
1034
1035 static bool ir_instr_op(ir_instr *self, int op, ir_value *v, bool writing)
1036 {
1037     if (v && v->vtype == TYPE_NOEXPR) {
1038         irerror(self->context, "tried to use a NOEXPR value");
1039         return false;
1040     }
1041
1042     if (self->_ops[op]) {
1043         size_t idx;
1044         if (writing && vec_ir_instr_find(self->_ops[op]->writes, self, &idx))
1045             vec_remove(self->_ops[op]->writes, idx, 1);
1046         else if (vec_ir_instr_find(self->_ops[op]->reads, self, &idx))
1047             vec_remove(self->_ops[op]->reads, idx, 1);
1048     }
1049     if (v) {
1050         if (writing)
1051             vec_push(v->writes, self);
1052         else
1053             vec_push(v->reads, self);
1054     }
1055     self->_ops[op] = v;
1056     return true;
1057 }
1058
1059 /***********************************************************************
1060  *IR Value
1061  */
1062
1063 static void ir_value_code_setaddr(ir_value *self, int32_t gaddr)
1064 {
1065     self->code.globaladdr = gaddr;
1066     if (self->members[0]) self->members[0]->code.globaladdr = gaddr;
1067     if (self->members[1]) self->members[1]->code.globaladdr = gaddr;
1068     if (self->members[2]) self->members[2]->code.globaladdr = gaddr;
1069 }
1070
1071 static int32_t ir_value_code_addr(const ir_value *self)
1072 {
1073     if (self->store == store_return)
1074         return OFS_RETURN + self->code.addroffset;
1075     return self->code.globaladdr + self->code.addroffset;
1076 }
1077
1078 ir_value* ir_value_var(const char *name, int storetype, int vtype)
1079 {
1080     ir_value *self;
1081     self = (ir_value*)mem_a(sizeof(*self));
1082     self->vtype = vtype;
1083     self->fieldtype = TYPE_VOID;
1084     self->outtype = TYPE_VOID;
1085     self->store = storetype;
1086     self->flags = 0;
1087
1088     self->reads  = NULL;
1089     self->writes = NULL;
1090
1091     self->cvq          = CV_NONE;
1092     self->hasvalue     = false;
1093     self->context.file = "<@no context>";
1094     self->context.line = 0;
1095     self->name = NULL;
1096     if (name && !ir_value_set_name(self, name)) {
1097         irerror(self->context, "out of memory");
1098         mem_d(self);
1099         return NULL;
1100     }
1101
1102     memset(&self->constval, 0, sizeof(self->constval));
1103     memset(&self->code,     0, sizeof(self->code));
1104
1105     self->members[0] = NULL;
1106     self->members[1] = NULL;
1107     self->members[2] = NULL;
1108     self->memberof = NULL;
1109
1110     self->unique_life = false;
1111     self->locked      = false;
1112     self->callparam   = false;
1113
1114     self->life = NULL;
1115     return self;
1116 }
1117
1118 ir_value* ir_value_vector_member(ir_value *self, unsigned int member)
1119 {
1120     char     *name;
1121     size_t    len;
1122     ir_value *m;
1123     if (member >= 3)
1124         return NULL;
1125
1126     if (self->members[member])
1127         return self->members[member];
1128
1129     if (self->name) {
1130         len = strlen(self->name);
1131         name = (char*)mem_a(len + 3);
1132         memcpy(name, self->name, len);
1133         name[len+0] = '_';
1134         name[len+1] = 'x' + member;
1135         name[len+2] = '\0';
1136     }
1137     else
1138         name = NULL;
1139
1140     if (self->vtype == TYPE_VECTOR)
1141     {
1142         m = ir_value_var(name, self->store, TYPE_FLOAT);
1143         if (name)
1144             mem_d(name);
1145         if (!m)
1146             return NULL;
1147         m->context = self->context;
1148
1149         self->members[member] = m;
1150         m->code.addroffset = member;
1151     }
1152     else if (self->vtype == TYPE_FIELD)
1153     {
1154         if (self->fieldtype != TYPE_VECTOR)
1155             return NULL;
1156         m = ir_value_var(name, self->store, TYPE_FIELD);
1157         if (name)
1158             mem_d(name);
1159         if (!m)
1160             return NULL;
1161         m->fieldtype = TYPE_FLOAT;
1162         m->context = self->context;
1163
1164         self->members[member] = m;
1165         m->code.addroffset = member;
1166     }
1167     else
1168     {
1169         irerror(self->context, "invalid member access on %s", self->name);
1170         return NULL;
1171     }
1172
1173     m->memberof = self;
1174     return m;
1175 }
1176
1177 static GMQCC_INLINE size_t ir_value_sizeof(const ir_value *self)
1178 {
1179     if (self->vtype == TYPE_FIELD && self->fieldtype == TYPE_VECTOR)
1180         return type_sizeof_[TYPE_VECTOR];
1181     return type_sizeof_[self->vtype];
1182 }
1183
1184 static ir_value* ir_value_out(ir_function *owner, const char *name, int storetype, int vtype)
1185 {
1186     ir_value *v = ir_value_var(name, storetype, vtype);
1187     if (!v)
1188         return NULL;
1189     ir_function_collect_value(owner, v);
1190     return v;
1191 }
1192
1193 void ir_value_delete(ir_value* self)
1194 {
1195     size_t i;
1196     if (self->name)
1197         mem_d((void*)self->name);
1198     if (self->hasvalue)
1199     {
1200         if (self->vtype == TYPE_STRING)
1201             mem_d((void*)self->constval.vstring);
1202     }
1203     for (i = 0; i < 3; ++i) {
1204         if (self->members[i])
1205             ir_value_delete(self->members[i]);
1206     }
1207     vec_free(self->reads);
1208     vec_free(self->writes);
1209     vec_free(self->life);
1210     mem_d(self);
1211 }
1212
1213 bool ir_value_set_name(ir_value *self, const char *name)
1214 {
1215     if (self->name)
1216         mem_d((void*)self->name);
1217     self->name = util_strdup(name);
1218     return !!self->name;
1219 }
1220
1221 bool ir_value_set_float(ir_value *self, float f)
1222 {
1223     if (self->vtype != TYPE_FLOAT)
1224         return false;
1225     self->constval.vfloat = f;
1226     self->hasvalue = true;
1227     return true;
1228 }
1229
1230 bool ir_value_set_func(ir_value *self, int f)
1231 {
1232     if (self->vtype != TYPE_FUNCTION)
1233         return false;
1234     self->constval.vint = f;
1235     self->hasvalue = true;
1236     return true;
1237 }
1238
1239 bool ir_value_set_vector(ir_value *self, vec3_t v)
1240 {
1241     if (self->vtype != TYPE_VECTOR)
1242         return false;
1243     self->constval.vvec = v;
1244     self->hasvalue = true;
1245     return true;
1246 }
1247
1248 bool ir_value_set_field(ir_value *self, ir_value *fld)
1249 {
1250     if (self->vtype != TYPE_FIELD)
1251         return false;
1252     self->constval.vpointer = fld;
1253     self->hasvalue = true;
1254     return true;
1255 }
1256
1257 bool ir_value_set_string(ir_value *self, const char *str)
1258 {
1259     if (self->vtype != TYPE_STRING)
1260         return false;
1261     self->constval.vstring = util_strdupe(str);
1262     self->hasvalue = true;
1263     return true;
1264 }
1265
1266 #if 0
1267 bool ir_value_set_int(ir_value *self, int i)
1268 {
1269     if (self->vtype != TYPE_INTEGER)
1270         return false;
1271     self->constval.vint = i;
1272     self->hasvalue = true;
1273     return true;
1274 }
1275 #endif
1276
1277 bool ir_value_lives(ir_value *self, size_t at)
1278 {
1279     size_t i;
1280     for (i = 0; i < vec_size(self->life); ++i)
1281     {
1282         ir_life_entry_t *life = &self->life[i];
1283         if (life->start <= at && at <= life->end)
1284             return true;
1285         if (life->start > at) /* since it's ordered */
1286             return false;
1287     }
1288     return false;
1289 }
1290
1291 static bool ir_value_life_insert(ir_value *self, size_t idx, ir_life_entry_t e)
1292 {
1293     size_t k;
1294     vec_push(self->life, e);
1295     for (k = vec_size(self->life)-1; k > idx; --k)
1296         self->life[k] = self->life[k-1];
1297     self->life[idx] = e;
1298     return true;
1299 }
1300
1301 static bool ir_value_life_merge(ir_value *self, size_t s)
1302 {
1303     size_t i;
1304     const size_t vs = vec_size(self->life);
1305     ir_life_entry_t *life = NULL;
1306     ir_life_entry_t *before = NULL;
1307     ir_life_entry_t new_entry;
1308
1309     /* Find the first range >= s */
1310     for (i = 0; i < vs; ++i)
1311     {
1312         before = life;
1313         life = &self->life[i];
1314         if (life->start > s)
1315             break;
1316     }
1317     /* nothing found? append */
1318     if (i == vs) {
1319         ir_life_entry_t e;
1320         if (life && life->end+1 == s)
1321         {
1322             /* previous life range can be merged in */
1323             life->end++;
1324             return true;
1325         }
1326         if (life && life->end >= s)
1327             return false;
1328         e.start = e.end = s;
1329         vec_push(self->life, e);
1330         return true;
1331     }
1332     /* found */
1333     if (before)
1334     {
1335         if (before->end + 1 == s &&
1336             life->start - 1 == s)
1337         {
1338             /* merge */
1339             before->end = life->end;
1340             vec_remove(self->life, i, 1);
1341             return true;
1342         }
1343         if (before->end + 1 == s)
1344         {
1345             /* extend before */
1346             before->end++;
1347             return true;
1348         }
1349         /* already contained */
1350         if (before->end >= s)
1351             return false;
1352     }
1353     /* extend */
1354     if (life->start - 1 == s)
1355     {
1356         life->start--;
1357         return true;
1358     }
1359     /* insert a new entry */
1360     new_entry.start = new_entry.end = s;
1361     return ir_value_life_insert(self, i, new_entry);
1362 }
1363
1364 static bool ir_value_life_merge_into(ir_value *self, const ir_value *other)
1365 {
1366     size_t i, myi;
1367
1368     if (!vec_size(other->life))
1369         return true;
1370
1371     if (!vec_size(self->life)) {
1372         size_t count = vec_size(other->life);
1373         ir_life_entry_t *life = vec_add(self->life, count);
1374         memcpy(life, other->life, count * sizeof(*life));
1375         return true;
1376     }
1377
1378     myi = 0;
1379     for (i = 0; i < vec_size(other->life); ++i)
1380     {
1381         const ir_life_entry_t *life = &other->life[i];
1382         while (true)
1383         {
1384             ir_life_entry_t *entry = &self->life[myi];
1385
1386             if (life->end+1 < entry->start)
1387             {
1388                 /* adding an interval before entry */
1389                 if (!ir_value_life_insert(self, myi, *life))
1390                     return false;
1391                 ++myi;
1392                 break;
1393             }
1394
1395             if (life->start <  entry->start &&
1396                 life->end+1 >= entry->start)
1397             {
1398                 /* starts earlier and overlaps */
1399                 entry->start = life->start;
1400             }
1401
1402             if (life->end   >  entry->end &&
1403                 life->start <= entry->end+1)
1404             {
1405                 /* ends later and overlaps */
1406                 entry->end = life->end;
1407             }
1408
1409             /* see if our change combines it with the next ranges */
1410             while (myi+1 < vec_size(self->life) &&
1411                    entry->end+1 >= self->life[1+myi].start)
1412             {
1413                 /* overlaps with (myi+1) */
1414                 if (entry->end < self->life[1+myi].end)
1415                     entry->end = self->life[1+myi].end;
1416                 vec_remove(self->life, myi+1, 1);
1417                 entry = &self->life[myi];
1418             }
1419
1420             /* see if we're after the entry */
1421             if (life->start > entry->end)
1422             {
1423                 ++myi;
1424                 /* append if we're at the end */
1425                 if (myi >= vec_size(self->life)) {
1426                     vec_push(self->life, *life);
1427                     break;
1428                 }
1429                 /* otherweise check the next range */
1430                 continue;
1431             }
1432             break;
1433         }
1434     }
1435     return true;
1436 }
1437
1438 static bool ir_values_overlap(const ir_value *a, const ir_value *b)
1439 {
1440     /* For any life entry in A see if it overlaps with
1441      * any life entry in B.
1442      * Note that the life entries are orderes, so we can make a
1443      * more efficient algorithm there than naively translating the
1444      * statement above.
1445      */
1446
1447     ir_life_entry_t *la, *lb, *enda, *endb;
1448
1449     /* first of all, if either has no life range, they cannot clash */
1450     if (!vec_size(a->life) || !vec_size(b->life))
1451         return false;
1452
1453     la = a->life;
1454     lb = b->life;
1455     enda = la + vec_size(a->life);
1456     endb = lb + vec_size(b->life);
1457     while (true)
1458     {
1459         /* check if the entries overlap, for that,
1460          * both must start before the other one ends.
1461          */
1462         if (la->start < lb->end &&
1463             lb->start < la->end)
1464         {
1465             return true;
1466         }
1467
1468         /* entries are ordered
1469          * one entry is earlier than the other
1470          * that earlier entry will be moved forward
1471          */
1472         if (la->start < lb->start)
1473         {
1474             /* order: A B, move A forward
1475              * check if we hit the end with A
1476              */
1477             if (++la == enda)
1478                 break;
1479         }
1480         else /* if (lb->start < la->start)  actually <= */
1481         {
1482             /* order: B A, move B forward
1483              * check if we hit the end with B
1484              */
1485             if (++lb == endb)
1486                 break;
1487         }
1488     }
1489     return false;
1490 }
1491
1492 /***********************************************************************
1493  *IR main operations
1494  */
1495
1496 static bool ir_check_unreachable(ir_block *self)
1497 {
1498     /* The IR should never have to deal with unreachable code */
1499     if (!self->final/* || OPTS_FLAG(ALLOW_UNREACHABLE_CODE)*/)
1500         return true;
1501     irerror(self->context, "unreachable statement (%s)", self->label);
1502     return false;
1503 }
1504
1505 bool ir_block_create_store_op(ir_block *self, lex_ctx_t ctx, int op, ir_value *target, ir_value *what)
1506 {
1507     ir_instr *in;
1508     if (!ir_check_unreachable(self))
1509         return false;
1510
1511     if (target->store == store_value &&
1512         (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC))
1513     {
1514         irerror(self->context, "cannot store to an SSA value");
1515         irerror(self->context, "trying to store: %s <- %s", target->name, what->name);
1516         irerror(self->context, "instruction: %s", util_instr_str[op]);
1517         return false;
1518     }
1519
1520     in = ir_instr_new(ctx, self, op);
1521     if (!in)
1522         return false;
1523
1524     if (!ir_instr_op(in, 0, target, (op < INSTR_STOREP_F || op > INSTR_STOREP_FNC)) ||
1525         !ir_instr_op(in, 1, what, false))
1526     {
1527         ir_instr_delete(in);
1528         return false;
1529     }
1530     vec_push(self->instr, in);
1531     return true;
1532 }
1533
1534 static bool ir_block_create_store(ir_block *self, lex_ctx_t ctx, ir_value *target, ir_value *what)
1535 {
1536     int op = 0;
1537     int vtype;
1538     if (target->vtype == TYPE_VARIANT)
1539         vtype = what->vtype;
1540     else
1541         vtype = target->vtype;
1542
1543 #if 0
1544     if      (vtype == TYPE_FLOAT   && what->vtype == TYPE_INTEGER)
1545         op = INSTR_CONV_ITOF;
1546     else if (vtype == TYPE_INTEGER && what->vtype == TYPE_FLOAT)
1547         op = INSTR_CONV_FTOI;
1548 #endif
1549         op = type_store_instr[vtype];
1550
1551     if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1552         if (op == INSTR_STORE_FLD && what->fieldtype == TYPE_VECTOR)
1553             op = INSTR_STORE_V;
1554     }
1555
1556     return ir_block_create_store_op(self, ctx, op, target, what);
1557 }
1558
1559 bool ir_block_create_storep(ir_block *self, lex_ctx_t ctx, ir_value *target, ir_value *what)
1560 {
1561     int op = 0;
1562     int vtype;
1563
1564     if (target->vtype != TYPE_POINTER)
1565         return false;
1566
1567     /* storing using pointer - target is a pointer, type must be
1568      * inferred from source
1569      */
1570     vtype = what->vtype;
1571
1572     op = type_storep_instr[vtype];
1573     if (OPTS_FLAG(ADJUST_VECTOR_FIELDS)) {
1574         if (op == INSTR_STOREP_FLD && what->fieldtype == TYPE_VECTOR)
1575             op = INSTR_STOREP_V;
1576     }
1577
1578     return ir_block_create_store_op(self, ctx, op, target, what);
1579 }
1580
1581 bool ir_block_create_return(ir_block *self, lex_ctx_t ctx, ir_value *v)
1582 {
1583     ir_instr *in;
1584     if (!ir_check_unreachable(self))
1585         return false;
1586     self->final = true;
1587     self->is_return = true;
1588     in = ir_instr_new(ctx, self, INSTR_RETURN);
1589     if (!in)
1590         return false;
1591
1592     if (v && !ir_instr_op(in, 0, v, false)) {
1593         ir_instr_delete(in);
1594         return false;
1595     }
1596
1597     vec_push(self->instr, in);
1598     return true;
1599 }
1600
1601 bool ir_block_create_if(ir_block *self, lex_ctx_t ctx, ir_value *v,
1602                         ir_block *ontrue, ir_block *onfalse)
1603 {
1604     ir_instr *in;
1605     if (!ir_check_unreachable(self))
1606         return false;
1607     self->final = true;
1608     /*in = ir_instr_new(ctx, self, (v->vtype == TYPE_STRING ? INSTR_IF_S : INSTR_IF_F));*/
1609     in = ir_instr_new(ctx, self, VINSTR_COND);
1610     if (!in)
1611         return false;
1612
1613     if (!ir_instr_op(in, 0, v, false)) {
1614         ir_instr_delete(in);
1615         return false;
1616     }
1617
1618     in->bops[0] = ontrue;
1619     in->bops[1] = onfalse;
1620
1621     vec_push(self->instr, in);
1622
1623     vec_push(self->exits, ontrue);
1624     vec_push(self->exits, onfalse);
1625     vec_push(ontrue->entries,  self);
1626     vec_push(onfalse->entries, self);
1627     return true;
1628 }
1629
1630 bool ir_block_create_jump(ir_block *self, lex_ctx_t ctx, ir_block *to)
1631 {
1632     ir_instr *in;
1633     if (!ir_check_unreachable(self))
1634         return false;
1635     self->final = true;
1636     in = ir_instr_new(ctx, self, VINSTR_JUMP);
1637     if (!in)
1638         return false;
1639
1640     in->bops[0] = to;
1641     vec_push(self->instr, in);
1642
1643     vec_push(self->exits, to);
1644     vec_push(to->entries, self);
1645     return true;
1646 }
1647
1648 bool ir_block_create_goto(ir_block *self, lex_ctx_t ctx, ir_block *to)
1649 {
1650     self->owner->flags |= IR_FLAG_HAS_GOTO;
1651     return ir_block_create_jump(self, ctx, to);
1652 }
1653
1654 ir_instr* ir_block_create_phi(ir_block *self, lex_ctx_t ctx, const char *label, int ot)
1655 {
1656     ir_value *out;
1657     ir_instr *in;
1658     if (!ir_check_unreachable(self))
1659         return NULL;
1660     in = ir_instr_new(ctx, self, VINSTR_PHI);
1661     if (!in)
1662         return NULL;
1663     out = ir_value_out(self->owner, label, store_value, ot);
1664     if (!out) {
1665         ir_instr_delete(in);
1666         return NULL;
1667     }
1668     if (!ir_instr_op(in, 0, out, true)) {
1669         ir_instr_delete(in);
1670         ir_value_delete(out);
1671         return NULL;
1672     }
1673     vec_push(self->instr, in);
1674     return in;
1675 }
1676
1677 ir_value* ir_phi_value(ir_instr *self)
1678 {
1679     return self->_ops[0];
1680 }
1681
1682 void ir_phi_add(ir_instr* self, ir_block *b, ir_value *v)
1683 {
1684     ir_phi_entry_t pe;
1685
1686     if (!vec_ir_block_find(self->owner->entries, b, NULL)) {
1687         /* Must not be possible to cause this, otherwise the AST
1688          * is doing something wrong.
1689          */
1690         irerror(self->context, "Invalid entry block for PHI");
1691         exit(EXIT_FAILURE);
1692     }
1693
1694     pe.value = v;
1695     pe.from = b;
1696     vec_push(v->reads, self);
1697     vec_push(self->phi, pe);
1698 }
1699
1700 /* call related code */
1701 ir_instr* ir_block_create_call(ir_block *self, lex_ctx_t ctx, const char *label, ir_value *func, bool noreturn)
1702 {
1703     ir_value *out;
1704     ir_instr *in;
1705     if (!ir_check_unreachable(self))
1706         return NULL;
1707     in = ir_instr_new(ctx, self, (noreturn ? VINSTR_NRCALL : INSTR_CALL0));
1708     if (!in)
1709         return NULL;
1710     if (noreturn) {
1711         self->final = true;
1712         self->is_return = true;
1713     }
1714     out = ir_value_out(self->owner, label, (func->outtype == TYPE_VOID) ? store_return : store_value, func->outtype);
1715     if (!out) {
1716         ir_instr_delete(in);
1717         return NULL;
1718     }
1719     if (!ir_instr_op(in, 0, out, true) ||
1720         !ir_instr_op(in, 1, func, false))
1721     {
1722         ir_instr_delete(in);
1723         ir_value_delete(out);
1724         return NULL;
1725     }
1726     vec_push(self->instr, in);
1727     /*
1728     if (noreturn) {
1729         if (!ir_block_create_return(self, ctx, NULL)) {
1730             compile_error(ctx, "internal error: failed to generate dummy-return instruction");
1731             ir_instr_delete(in);
1732             return NULL;
1733         }
1734     }
1735     */
1736     return in;
1737 }
1738
1739 ir_value* ir_call_value(ir_instr *self)
1740 {
1741     return self->_ops[0];
1742 }
1743
1744 void ir_call_param(ir_instr* self, ir_value *v)
1745 {
1746     vec_push(self->params, v);
1747     vec_push(v->reads, self);
1748 }
1749
1750 /* binary op related code */
1751
1752 ir_value* ir_block_create_binop(ir_block *self, lex_ctx_t ctx,
1753                                 const char *label, int opcode,
1754                                 ir_value *left, ir_value *right)
1755 {
1756     int ot = TYPE_VOID;
1757     switch (opcode) {
1758         case INSTR_ADD_F:
1759         case INSTR_SUB_F:
1760         case INSTR_DIV_F:
1761         case INSTR_MUL_F:
1762         case INSTR_MUL_V:
1763         case INSTR_AND:
1764         case INSTR_OR:
1765 #if 0
1766         case INSTR_AND_I:
1767         case INSTR_AND_IF:
1768         case INSTR_AND_FI:
1769         case INSTR_OR_I:
1770         case INSTR_OR_IF:
1771         case INSTR_OR_FI:
1772 #endif
1773         case INSTR_BITAND:
1774         case INSTR_BITOR:
1775         case VINSTR_BITXOR:
1776 #if 0
1777         case INSTR_SUB_S: /* -- offset of string as float */
1778         case INSTR_MUL_IF:
1779         case INSTR_MUL_FI:
1780         case INSTR_DIV_IF:
1781         case INSTR_DIV_FI:
1782         case INSTR_BITOR_IF:
1783         case INSTR_BITOR_FI:
1784         case INSTR_BITAND_FI:
1785         case INSTR_BITAND_IF:
1786         case INSTR_EQ_I:
1787         case INSTR_NE_I:
1788 #endif
1789             ot = TYPE_FLOAT;
1790             break;
1791 #if 0
1792         case INSTR_ADD_I:
1793         case INSTR_ADD_IF:
1794         case INSTR_ADD_FI:
1795         case INSTR_SUB_I:
1796         case INSTR_SUB_FI:
1797         case INSTR_SUB_IF:
1798         case INSTR_MUL_I:
1799         case INSTR_DIV_I:
1800         case INSTR_BITAND_I:
1801         case INSTR_BITOR_I:
1802         case INSTR_XOR_I:
1803         case INSTR_RSHIFT_I:
1804         case INSTR_LSHIFT_I:
1805             ot = TYPE_INTEGER;
1806             break;
1807 #endif
1808         case INSTR_ADD_V:
1809         case INSTR_SUB_V:
1810         case INSTR_MUL_VF:
1811         case INSTR_MUL_FV:
1812         case VINSTR_BITAND_V:
1813         case VINSTR_BITOR_V:
1814         case VINSTR_BITXOR_V:
1815         case VINSTR_BITAND_VF:
1816         case VINSTR_BITOR_VF:
1817         case VINSTR_BITXOR_VF:
1818         case VINSTR_CROSS:
1819 #if 0
1820         case INSTR_DIV_VF:
1821         case INSTR_MUL_IV:
1822         case INSTR_MUL_VI:
1823 #endif
1824             ot = TYPE_VECTOR;
1825             break;
1826 #if 0
1827         case INSTR_ADD_SF:
1828             ot = TYPE_POINTER;
1829             break;
1830 #endif
1831     /*
1832      * after the following default case, the value of opcode can never
1833      * be 1, 2, 3, 4, 5, 6, 7, 8, 9, 62, 63, 64, 65
1834      */
1835         default:
1836             /* ranges: */
1837             /* boolean operations result in floats */
1838
1839             /*
1840              * opcode >= 10 takes true branch opcode is at least 10
1841              * opcode <= 23 takes false branch opcode is at least 24
1842              */
1843             if (opcode >= INSTR_EQ_F && opcode <= INSTR_GT)
1844                 ot = TYPE_FLOAT;
1845
1846             /*
1847              * At condition "opcode <= 23", the value of "opcode" must be
1848              * at least 24.
1849              * At condition "opcode <= 23", the value of "opcode" cannot be
1850              * equal to any of {1, 2, 3, 4, 5, 6, 7, 8, 9, 62, 63, 64, 65}.
1851              * The condition "opcode <= 23" cannot be true.
1852              *
1853              * Thus ot=2 (TYPE_FLOAT) can never be true
1854              */
1855 #if 0
1856             else if (opcode >= INSTR_LE && opcode <= INSTR_GT)
1857                 ot = TYPE_FLOAT;
1858             else if (opcode >= INSTR_LE_I && opcode <= INSTR_EQ_FI)
1859                 ot = TYPE_FLOAT;
1860 #endif
1861             break;
1862     };
1863     if (ot == TYPE_VOID) {
1864         /* The AST or parser were supposed to check this! */
1865         return NULL;
1866     }
1867
1868     return ir_block_create_general_instr(self, ctx, label, opcode, left, right, ot);
1869 }
1870
1871 ir_value* ir_block_create_unary(ir_block *self, lex_ctx_t ctx,
1872                                 const char *label, int opcode,
1873                                 ir_value *operand)
1874 {
1875     int ot = TYPE_FLOAT;
1876     switch (opcode) {
1877         case INSTR_NOT_F:
1878         case INSTR_NOT_V:
1879         case INSTR_NOT_S:
1880         case INSTR_NOT_ENT:
1881         case INSTR_NOT_FNC: /*
1882         case INSTR_NOT_I:   */
1883             ot = TYPE_FLOAT;
1884             break;
1885
1886         /*
1887          * Negation for virtual instructions is emulated with 0-value. Thankfully
1888          * the operand for 0 already exists so we just source it from here.
1889          */
1890         case VINSTR_NEG_F:
1891             return ir_block_create_general_instr(self, ctx, label, INSTR_SUB_F, NULL, operand, ot);
1892         case VINSTR_NEG_V:
1893             return ir_block_create_general_instr(self, ctx, label, INSTR_SUB_V, NULL, operand, ot);
1894
1895         default:
1896             ot = operand->vtype;
1897             break;
1898     };
1899     if (ot == TYPE_VOID) {
1900         /* The AST or parser were supposed to check this! */
1901         return NULL;
1902     }
1903
1904     /* let's use the general instruction creator and pass NULL for OPB */
1905     return ir_block_create_general_instr(self, ctx, label, opcode, operand, NULL, ot);
1906 }
1907
1908 static ir_value* ir_block_create_general_instr(ir_block *self, lex_ctx_t ctx, const char *label,
1909                                         int op, ir_value *a, ir_value *b, int outype)
1910 {
1911     ir_instr *instr;
1912     ir_value *out;
1913
1914     out = ir_value_out(self->owner, label, store_value, outype);
1915     if (!out)
1916         return NULL;
1917
1918     instr = ir_instr_new(ctx, self, op);
1919     if (!instr) {
1920         ir_value_delete(out);
1921         return NULL;
1922     }
1923
1924     if (!ir_instr_op(instr, 0, out, true) ||
1925         !ir_instr_op(instr, 1, a, false) ||
1926         !ir_instr_op(instr, 2, b, false) )
1927     {
1928         goto on_error;
1929     }
1930
1931     vec_push(self->instr, instr);
1932
1933     return out;
1934 on_error:
1935     ir_instr_delete(instr);
1936     ir_value_delete(out);
1937     return NULL;
1938 }
1939
1940 ir_value* ir_block_create_fieldaddress(ir_block *self, lex_ctx_t ctx, const char *label, ir_value *ent, ir_value *field)
1941 {
1942     ir_value *v;
1943
1944     /* Support for various pointer types todo if so desired */
1945     if (ent->vtype != TYPE_ENTITY)
1946         return NULL;
1947
1948     if (field->vtype != TYPE_FIELD)
1949         return NULL;
1950
1951     v = ir_block_create_general_instr(self, ctx, label, INSTR_ADDRESS, ent, field, TYPE_POINTER);
1952     v->fieldtype = field->fieldtype;
1953     return v;
1954 }
1955
1956 ir_value* ir_block_create_load_from_ent(ir_block *self, lex_ctx_t ctx, const char *label, ir_value *ent, ir_value *field, int outype)
1957 {
1958     int op;
1959     if (ent->vtype != TYPE_ENTITY)
1960         return NULL;
1961
1962     /* at some point we could redirect for TYPE_POINTER... but that could lead to carelessness */
1963     if (field->vtype != TYPE_FIELD)
1964         return NULL;
1965
1966     switch (outype)
1967     {
1968         case TYPE_FLOAT:    op = INSTR_LOAD_F;   break;
1969         case TYPE_VECTOR:   op = INSTR_LOAD_V;   break;
1970         case TYPE_STRING:   op = INSTR_LOAD_S;   break;
1971         case TYPE_FIELD:    op = INSTR_LOAD_FLD; break;
1972         case TYPE_ENTITY:   op = INSTR_LOAD_ENT; break;
1973         case TYPE_FUNCTION: op = INSTR_LOAD_FNC; break;
1974 #if 0
1975         case TYPE_POINTER: op = INSTR_LOAD_I;   break;
1976         case TYPE_INTEGER: op = INSTR_LOAD_I;   break;
1977 #endif
1978         default:
1979             irerror(self->context, "invalid type for ir_block_create_load_from_ent: %s", type_name[outype]);
1980             return NULL;
1981     }
1982
1983     return ir_block_create_general_instr(self, ctx, label, op, ent, field, outype);
1984 }
1985
1986 /* PHI resolving breaks the SSA, and must thus be the last
1987  * step before life-range calculation.
1988  */
1989
1990 static bool ir_block_naive_phi(ir_block *self);
1991 bool ir_function_naive_phi(ir_function *self)
1992 {
1993     size_t i;
1994
1995     for (i = 0; i < vec_size(self->blocks); ++i)
1996     {
1997         if (!ir_block_naive_phi(self->blocks[i]))
1998             return false;
1999     }
2000     return true;
2001 }
2002
2003 static bool ir_block_naive_phi(ir_block *self)
2004 {
2005     size_t i, p; /*, w;*/
2006     /* FIXME: optionally, create_phi can add the phis
2007      * to a list so we don't need to loop through blocks
2008      * - anyway: "don't optimize YET"
2009      */
2010     for (i = 0; i < vec_size(self->instr); ++i)
2011     {
2012         ir_instr *instr = self->instr[i];
2013         if (instr->opcode != VINSTR_PHI)
2014             continue;
2015
2016         vec_remove(self->instr, i, 1);
2017         --i; /* NOTE: i+1 below */
2018
2019         for (p = 0; p < vec_size(instr->phi); ++p)
2020         {
2021             ir_value *v = instr->phi[p].value;
2022             ir_block *b = instr->phi[p].from;
2023
2024             if (v->store == store_value &&
2025                 vec_size(v->reads) == 1 &&
2026                 vec_size(v->writes) == 1)
2027             {
2028                 /* replace the value */
2029                 if (!ir_instr_op(v->writes[0], 0, instr->_ops[0], true))
2030                     return false;
2031             }
2032             else
2033             {
2034                 /* force a move instruction */
2035                 ir_instr *prevjump = vec_last(b->instr);
2036                 vec_pop(b->instr);
2037                 b->final = false;
2038                 instr->_ops[0]->store = store_global;
2039                 if (!ir_block_create_store(b, instr->context, instr->_ops[0], v))
2040                     return false;
2041                 instr->_ops[0]->store = store_value;
2042                 vec_push(b->instr, prevjump);
2043                 b->final = true;
2044             }
2045         }
2046         ir_instr_delete(instr);
2047     }
2048     return true;
2049 }
2050
2051 /***********************************************************************
2052  *IR Temp allocation code
2053  * Propagating value life ranges by walking through the function backwards
2054  * until no more changes are made.
2055  * In theory this should happen once more than once for every nested loop
2056  * level.
2057  * Though this implementation might run an additional time for if nests.
2058  */
2059
2060 /* Enumerate instructions used by value's life-ranges
2061  */
2062 static void ir_block_enumerate(ir_block *self, size_t *_eid)
2063 {
2064     size_t i;
2065     size_t eid = *_eid;
2066     for (i = 0; i < vec_size(self->instr); ++i)
2067     {
2068         self->instr[i]->eid = eid++;
2069     }
2070     *_eid = eid;
2071 }
2072
2073 /* Enumerate blocks and instructions.
2074  * The block-enumeration is unordered!
2075  * We do not really use the block enumreation, however
2076  * the instruction enumeration is important for life-ranges.
2077  */
2078 void ir_function_enumerate(ir_function *self)
2079 {
2080     size_t i;
2081     size_t instruction_id = 0;
2082     for (i = 0; i < vec_size(self->blocks); ++i)
2083     {
2084         /* each block now gets an additional "entry" instruction id
2085          * we can use to avoid point-life issues
2086          */
2087         self->blocks[i]->entry_id = instruction_id;
2088         ++instruction_id;
2089
2090         self->blocks[i]->eid = i;
2091         ir_block_enumerate(self->blocks[i], &instruction_id);
2092     }
2093 }
2094
2095 /* Local-value allocator
2096  * After finishing creating the liferange of all values used in a function
2097  * we can allocate their global-positions.
2098  * This is the counterpart to register-allocation in register machines.
2099  */
2100 typedef struct {
2101     ir_value **locals;
2102     size_t    *sizes;
2103     size_t    *positions;
2104     bool      *unique;
2105 } function_allocator;
2106
2107 static bool function_allocator_alloc(function_allocator *alloc, ir_value *var)
2108 {
2109     ir_value *slot;
2110     size_t vsize = ir_value_sizeof(var);
2111
2112     var->code.local = vec_size(alloc->locals);
2113
2114     slot = ir_value_var("reg", store_global, var->vtype);
2115     if (!slot)
2116         return false;
2117
2118     if (!ir_value_life_merge_into(slot, var))
2119         goto localerror;
2120
2121     vec_push(alloc->locals, slot);
2122     vec_push(alloc->sizes, vsize);
2123     vec_push(alloc->unique, var->unique_life);
2124
2125     return true;
2126
2127 localerror:
2128     ir_value_delete(slot);
2129     return false;
2130 }
2131
2132 static bool ir_function_allocator_assign(ir_function *self, function_allocator *alloc, ir_value *v)
2133 {
2134     size_t a;
2135     ir_value *slot;
2136
2137     if (v->unique_life)
2138         return function_allocator_alloc(alloc, v);
2139
2140     for (a = 0; a < vec_size(alloc->locals); ++a)
2141     {
2142         /* if it's reserved for a unique liferange: skip */
2143         if (alloc->unique[a])
2144             continue;
2145
2146         slot = alloc->locals[a];
2147
2148         /* never resize parameters
2149          * will be required later when overlapping temps + locals
2150          */
2151         if (a < vec_size(self->params) &&
2152             alloc->sizes[a] < ir_value_sizeof(v))
2153         {
2154             continue;
2155         }
2156
2157         if (ir_values_overlap(v, slot))
2158             continue;
2159
2160         if (!ir_value_life_merge_into(slot, v))
2161             return false;
2162
2163         /* adjust size for this slot */
2164         if (alloc->sizes[a] < ir_value_sizeof(v))
2165             alloc->sizes[a] = ir_value_sizeof(v);
2166
2167         v->code.local = a;
2168         return true;
2169     }
2170     if (a >= vec_size(alloc->locals)) {
2171         if (!function_allocator_alloc(alloc, v))
2172             return false;
2173     }
2174     return true;
2175 }
2176
2177 bool ir_function_allocate_locals(ir_function *self)
2178 {
2179     size_t i;
2180     bool   retval = true;
2181     size_t pos;
2182     bool   opt_gt = OPTS_OPTIMIZATION(OPTIM_GLOBAL_TEMPS);
2183
2184     ir_value *v;
2185
2186     function_allocator lockalloc, globalloc;
2187
2188     if (!vec_size(self->locals) && !vec_size(self->values))
2189         return true;
2190
2191     globalloc.locals    = NULL;
2192     globalloc.sizes     = NULL;
2193     globalloc.positions = NULL;
2194     globalloc.unique    = NULL;
2195     lockalloc.locals    = NULL;
2196     lockalloc.sizes     = NULL;
2197     lockalloc.positions = NULL;
2198     lockalloc.unique    = NULL;
2199
2200     for (i = 0; i < vec_size(self->locals); ++i)
2201     {
2202         v = self->locals[i];
2203         if ((self->flags & IR_FLAG_MASK_NO_LOCAL_TEMPS) || !OPTS_OPTIMIZATION(OPTIM_LOCAL_TEMPS)) {
2204             v->locked      = true;
2205             v->unique_life = true;
2206         }
2207         else if (i >= vec_size(self->params))
2208             break;
2209         else
2210             v->locked = true; /* lock parameters locals */
2211         if (!function_allocator_alloc((v->locked || !opt_gt ? &lockalloc : &globalloc), v))
2212             goto error;
2213     }
2214     for (; i < vec_size(self->locals); ++i)
2215     {
2216         v = self->locals[i];
2217         if (!vec_size(v->life))
2218             continue;
2219         if (!ir_function_allocator_assign(self, (v->locked || !opt_gt ? &lockalloc : &globalloc), v))
2220             goto error;
2221     }
2222
2223     /* Allocate a slot for any value that still exists */
2224     for (i = 0; i < vec_size(self->values); ++i)
2225     {
2226         v = self->values[i];
2227
2228         if (!vec_size(v->life))
2229             continue;
2230
2231         /* CALL optimization:
2232          * If the value is a parameter-temp: 1 write, 1 read from a CALL
2233          * and it's not "locked", write it to the OFS_PARM directly.
2234          */
2235         if (OPTS_OPTIMIZATION(OPTIM_CALL_STORES) && !v->locked && !v->unique_life) {
2236             if (vec_size(v->reads) == 1 && vec_size(v->writes) == 1 &&
2237                 (v->reads[0]->opcode == VINSTR_NRCALL ||
2238                  (v->reads[0]->opcode >= INSTR_CALL0 && v->reads[0]->opcode <= INSTR_CALL8)
2239                 )
2240                )
2241             {
2242                 size_t    param;
2243                 ir_instr *call = v->reads[0];
2244                 if (!vec_ir_value_find(call->params, v, &param)) {
2245                     irerror(call->context, "internal error: unlocked parameter %s not found", v->name);
2246                     goto error;
2247                 }
2248                 ++opts_optimizationcount[OPTIM_CALL_STORES];
2249                 v->callparam = true;
2250                 if (param < 8)
2251                     ir_value_code_setaddr(v, OFS_PARM0 + 3*param);
2252                 else {
2253                     size_t nprotos = vec_size(self->owner->extparam_protos);
2254                     ir_value *ep;
2255                     param -= 8;
2256                     if (nprotos > param)
2257                         ep = self->owner->extparam_protos[param];
2258                     else
2259                     {
2260                         ep = ir_gen_extparam_proto(self->owner);
2261                         while (++nprotos <= param)
2262                             ep = ir_gen_extparam_proto(self->owner);
2263                     }
2264                     ir_instr_op(v->writes[0], 0, ep, true);
2265                     call->params[param+8] = ep;
2266                 }
2267                 continue;
2268             }
2269             if (vec_size(v->writes) == 1 && v->writes[0]->opcode == INSTR_CALL0)
2270             {
2271                 v->store = store_return;
2272                 if (v->members[0]) v->members[0]->store = store_return;
2273                 if (v->members[1]) v->members[1]->store = store_return;
2274                 if (v->members[2]) v->members[2]->store = store_return;
2275                 ++opts_optimizationcount[OPTIM_CALL_STORES];
2276                 continue;
2277             }
2278         }
2279
2280         if (!ir_function_allocator_assign(self, (v->locked || !opt_gt ? &lockalloc : &globalloc), v))
2281             goto error;
2282     }
2283
2284     if (!lockalloc.sizes && !globalloc.sizes) {
2285         goto cleanup;
2286     }
2287     vec_push(lockalloc.positions, 0);
2288     vec_push(globalloc.positions, 0);
2289
2290     /* Adjust slot positions based on sizes */
2291     if (lockalloc.sizes) {
2292         pos = (vec_size(lockalloc.sizes) ? lockalloc.positions[0] : 0);
2293         for (i = 1; i < vec_size(lockalloc.sizes); ++i)
2294         {
2295             pos = lockalloc.positions[i-1] + lockalloc.sizes[i-1];
2296             vec_push(lockalloc.positions, pos);
2297         }
2298         self->allocated_locals = pos + vec_last(lockalloc.sizes);
2299     }
2300     if (globalloc.sizes) {
2301         pos = (vec_size(globalloc.sizes) ? globalloc.positions[0] : 0);
2302         for (i = 1; i < vec_size(globalloc.sizes); ++i)
2303         {
2304             pos = globalloc.positions[i-1] + globalloc.sizes[i-1];
2305             vec_push(globalloc.positions, pos);
2306         }
2307         self->globaltemps = pos + vec_last(globalloc.sizes);
2308     }
2309
2310     /* Locals need to know their new position */
2311     for (i = 0; i < vec_size(self->locals); ++i) {
2312         v = self->locals[i];
2313         if (v->locked || !opt_gt)
2314             v->code.local = lockalloc.positions[v->code.local];
2315         else
2316             v->code.local = globalloc.positions[v->code.local];
2317     }
2318     /* Take over the actual slot positions on values */
2319     for (i = 0; i < vec_size(self->values); ++i) {
2320         v = self->values[i];
2321         if (v->locked || !opt_gt)
2322             v->code.local = lockalloc.positions[v->code.local];
2323         else
2324             v->code.local = globalloc.positions[v->code.local];
2325     }
2326
2327     goto cleanup;
2328
2329 error:
2330     retval = false;
2331 cleanup:
2332     for (i = 0; i < vec_size(lockalloc.locals); ++i)
2333         ir_value_delete(lockalloc.locals[i]);
2334     for (i = 0; i < vec_size(globalloc.locals); ++i)
2335         ir_value_delete(globalloc.locals[i]);
2336     vec_free(globalloc.unique);
2337     vec_free(globalloc.locals);
2338     vec_free(globalloc.sizes);
2339     vec_free(globalloc.positions);
2340     vec_free(lockalloc.unique);
2341     vec_free(lockalloc.locals);
2342     vec_free(lockalloc.sizes);
2343     vec_free(lockalloc.positions);
2344     return retval;
2345 }
2346
2347 /* Get information about which operand
2348  * is read from, or written to.
2349  */
2350 static void ir_op_read_write(int op, size_t *read, size_t *write)
2351 {
2352     switch (op)
2353     {
2354     case VINSTR_JUMP:
2355     case INSTR_GOTO:
2356         *write = 0;
2357         *read = 0;
2358         break;
2359     case INSTR_IF:
2360     case INSTR_IFNOT:
2361 #if 0
2362     case INSTR_IF_S:
2363     case INSTR_IFNOT_S:
2364 #endif
2365     case INSTR_RETURN:
2366     case VINSTR_COND:
2367         *write = 0;
2368         *read = 1;
2369         break;
2370     case INSTR_STOREP_F:
2371     case INSTR_STOREP_V:
2372     case INSTR_STOREP_S:
2373     case INSTR_STOREP_ENT:
2374     case INSTR_STOREP_FLD:
2375     case INSTR_STOREP_FNC:
2376         *write = 0;
2377         *read  = 7;
2378         break;
2379     default:
2380         *write = 1;
2381         *read = 6;
2382         break;
2383     };
2384 }
2385
2386 static bool ir_block_living_add_instr(ir_block *self, size_t eid)
2387 {
2388     size_t       i;
2389     const size_t vs = vec_size(self->living);
2390     bool         changed = false;
2391     for (i = 0; i != vs; ++i)
2392     {
2393         if (ir_value_life_merge(self->living[i], eid))
2394             changed = true;
2395     }
2396     return changed;
2397 }
2398
2399 static bool ir_block_living_lock(ir_block *self)
2400 {
2401     size_t i;
2402     bool changed = false;
2403     for (i = 0; i != vec_size(self->living); ++i)
2404     {
2405         if (!self->living[i]->locked) {
2406             self->living[i]->locked = true;
2407             changed = true;
2408         }
2409     }
2410     return changed;
2411 }
2412
2413 static bool ir_block_life_propagate(ir_block *self, bool *changed)
2414 {
2415     ir_instr *instr;
2416     ir_value *value;
2417     size_t i, o, p, mem, cnt;
2418     /* bitmasks which operands are read from or written to */
2419     size_t read, write;
2420     char dbg_ind[16];
2421     dbg_ind[0] = '#';
2422     dbg_ind[1] = '0';
2423     (void)dbg_ind;
2424
2425     vec_free(self->living);
2426
2427     p = vec_size(self->exits);
2428     for (i = 0; i < p; ++i) {
2429         ir_block *prev = self->exits[i];
2430         cnt = vec_size(prev->living);
2431         for (o = 0; o < cnt; ++o) {
2432             if (!vec_ir_value_find(self->living, prev->living[o], NULL))
2433                 vec_push(self->living, prev->living[o]);
2434         }
2435     }
2436
2437     i = vec_size(self->instr);
2438     while (i)
2439     { --i;
2440         instr = self->instr[i];
2441
2442         /* See which operands are read and write operands */
2443         ir_op_read_write(instr->opcode, &read, &write);
2444
2445         /* Go through the 3 main operands
2446          * writes first, then reads
2447          */
2448         for (o = 0; o < 3; ++o)
2449         {
2450             if (!instr->_ops[o]) /* no such operand */
2451                 continue;
2452
2453             value = instr->_ops[o];
2454
2455             /* We only care about locals */
2456             /* we also calculate parameter liferanges so that locals
2457              * can take up parameter slots */
2458             if (value->store != store_value &&
2459                 value->store != store_local &&
2460                 value->store != store_param)
2461                 continue;
2462
2463             /* write operands */
2464             /* When we write to a local, we consider it "dead" for the
2465              * remaining upper part of the function, since in SSA a value
2466              * can only be written once (== created)
2467              */
2468             if (write & (1<<o))
2469             {
2470                 size_t idx;
2471                 bool in_living = vec_ir_value_find(self->living, value, &idx);
2472                 if (!in_living)
2473                 {
2474                     /* If the value isn't alive it hasn't been read before... */
2475                     /* TODO: See if the warning can be emitted during parsing or AST processing
2476                      * otherwise have warning printed here.
2477                      * IF printing a warning here: include filecontext_t,
2478                      * and make sure it's only printed once
2479                      * since this function is run multiple times.
2480                      */
2481                     /* con_err( "Value only written %s\n", value->name); */
2482                     if (ir_value_life_merge(value, instr->eid))
2483                         *changed = true;
2484                 } else {
2485                     /* since 'living' won't contain it
2486                      * anymore, merge the value, since
2487                      * (A) doesn't.
2488                      */
2489                     if (ir_value_life_merge(value, instr->eid))
2490                         *changed = true;
2491                     /* Then remove */
2492                     vec_remove(self->living, idx, 1);
2493                 }
2494                 /* Removing a vector removes all members */
2495                 for (mem = 0; mem < 3; ++mem) {
2496                     if (value->members[mem] && vec_ir_value_find(self->living, value->members[mem], &idx)) {
2497                         if (ir_value_life_merge(value->members[mem], instr->eid))
2498                             *changed = true;
2499                         vec_remove(self->living, idx, 1);
2500                     }
2501                 }
2502                 /* Removing the last member removes the vector */
2503                 if (value->memberof) {
2504                     value = value->memberof;
2505                     for (mem = 0; mem < 3; ++mem) {
2506                         if (value->members[mem] && vec_ir_value_find(self->living, value->members[mem], NULL))
2507                             break;
2508                     }
2509                     if (mem == 3 && vec_ir_value_find(self->living, value, &idx)) {
2510                         if (ir_value_life_merge(value, instr->eid))
2511                             *changed = true;
2512                         vec_remove(self->living, idx, 1);
2513                     }
2514                 }
2515             }
2516         }
2517
2518         /* These operations need a special case as they can break when using
2519          * same source and destination operand otherwise, as the engine may
2520          * read the source multiple times. */
2521         if (instr->opcode == INSTR_MUL_VF ||
2522             instr->opcode == VINSTR_BITAND_VF ||
2523             instr->opcode == VINSTR_BITOR_VF ||
2524             instr->opcode == VINSTR_BITXOR ||
2525             instr->opcode == VINSTR_BITXOR_VF ||
2526             instr->opcode == VINSTR_BITXOR_V ||
2527             instr->opcode == VINSTR_CROSS)
2528         {
2529             value = instr->_ops[2];
2530             /* the float source will get an additional lifetime */
2531             if (ir_value_life_merge(value, instr->eid+1))
2532                 *changed = true;
2533             if (value->memberof && ir_value_life_merge(value->memberof, instr->eid+1))
2534                 *changed = true;
2535         }
2536
2537         if (instr->opcode == INSTR_MUL_FV ||
2538             instr->opcode == INSTR_LOAD_V ||
2539             instr->opcode == VINSTR_BITXOR ||
2540             instr->opcode == VINSTR_BITXOR_VF ||
2541             instr->opcode == VINSTR_BITXOR_V ||
2542             instr->opcode == VINSTR_CROSS)
2543         {
2544             value = instr->_ops[1];
2545             /* the float source will get an additional lifetime */
2546             if (ir_value_life_merge(value, instr->eid+1))
2547                 *changed = true;
2548             if (value->memberof && ir_value_life_merge(value->memberof, instr->eid+1))
2549                 *changed = true;
2550         }
2551
2552         for (o = 0; o < 3; ++o)
2553         {
2554             if (!instr->_ops[o]) /* no such operand */
2555                 continue;
2556
2557             value = instr->_ops[o];
2558
2559             /* We only care about locals */
2560             /* we also calculate parameter liferanges so that locals
2561              * can take up parameter slots */
2562             if (value->store != store_value &&
2563                 value->store != store_local &&
2564                 value->store != store_param)
2565                 continue;
2566
2567             /* read operands */
2568             if (read & (1<<o))
2569             {
2570                 if (!vec_ir_value_find(self->living, value, NULL))
2571                     vec_push(self->living, value);
2572                 /* reading adds the full vector */
2573                 if (value->memberof && !vec_ir_value_find(self->living, value->memberof, NULL))
2574                     vec_push(self->living, value->memberof);
2575                 for (mem = 0; mem < 3; ++mem) {
2576                     if (value->members[mem] && !vec_ir_value_find(self->living, value->members[mem], NULL))
2577                         vec_push(self->living, value->members[mem]);
2578                 }
2579             }
2580         }
2581         /* PHI operands are always read operands */
2582         for (p = 0; p < vec_size(instr->phi); ++p)
2583         {
2584             value = instr->phi[p].value;
2585             if (!vec_ir_value_find(self->living, value, NULL))
2586                 vec_push(self->living, value);
2587             /* reading adds the full vector */
2588             if (value->memberof && !vec_ir_value_find(self->living, value->memberof, NULL))
2589                 vec_push(self->living, value->memberof);
2590             for (mem = 0; mem < 3; ++mem) {
2591                 if (value->members[mem] && !vec_ir_value_find(self->living, value->members[mem], NULL))
2592                     vec_push(self->living, value->members[mem]);
2593             }
2594         }
2595
2596         /* on a call, all these values must be "locked" */
2597         if (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8) {
2598             if (ir_block_living_lock(self))
2599                 *changed = true;
2600         }
2601         /* call params are read operands too */
2602         for (p = 0; p < vec_size(instr->params); ++p)
2603         {
2604             value = instr->params[p];
2605             if (!vec_ir_value_find(self->living, value, NULL))
2606                 vec_push(self->living, value);
2607             /* reading adds the full vector */
2608             if (value->memberof && !vec_ir_value_find(self->living, value->memberof, NULL))
2609                 vec_push(self->living, value->memberof);
2610             for (mem = 0; mem < 3; ++mem) {
2611                 if (value->members[mem] && !vec_ir_value_find(self->living, value->members[mem], NULL))
2612                     vec_push(self->living, value->members[mem]);
2613             }
2614         }
2615
2616         /* (A) */
2617         if (ir_block_living_add_instr(self, instr->eid))
2618             *changed = true;
2619     }
2620     /* the "entry" instruction ID */
2621     if (ir_block_living_add_instr(self, self->entry_id))
2622         *changed = true;
2623
2624     return true;
2625 }
2626
2627 bool ir_function_calculate_liferanges(ir_function *self)
2628 {
2629     size_t i, s;
2630     bool changed;
2631
2632     /* parameters live at 0 */
2633     for (i = 0; i < vec_size(self->params); ++i)
2634         if (!ir_value_life_merge(self->locals[i], 0))
2635             compile_error(self->context, "internal error: failed value-life merging");
2636
2637     do {
2638         self->run_id++;
2639         changed = false;
2640         i = vec_size(self->blocks);
2641         while (i--) {
2642             ir_block_life_propagate(self->blocks[i], &changed);
2643         }
2644     } while (changed);
2645
2646     if (vec_size(self->blocks)) {
2647         ir_block *block = self->blocks[0];
2648         for (i = 0; i < vec_size(block->living); ++i) {
2649             ir_value *v = block->living[i];
2650             if (v->store != store_local)
2651                 continue;
2652             if (v->vtype == TYPE_VECTOR)
2653                 continue;
2654             self->flags |= IR_FLAG_HAS_UNINITIALIZED;
2655             /* find the instruction reading from it */
2656             for (s = 0; s < vec_size(v->reads); ++s) {
2657                 if (v->reads[s]->eid == v->life[0].end)
2658                     break;
2659             }
2660             if (s < vec_size(v->reads)) {
2661                 if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2662                               "variable `%s` may be used uninitialized in this function\n"
2663                               " -> %s:%i",
2664                               v->name,
2665                               v->reads[s]->context.file, v->reads[s]->context.line)
2666                    )
2667                 {
2668                     return false;
2669                 }
2670                 continue;
2671             }
2672             if (v->memberof) {
2673                 ir_value *vec = v->memberof;
2674                 for (s = 0; s < vec_size(vec->reads); ++s) {
2675                     if (vec->reads[s]->eid == v->life[0].end)
2676                         break;
2677                 }
2678                 if (s < vec_size(vec->reads)) {
2679                     if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2680                                   "variable `%s` may be used uninitialized in this function\n"
2681                                   " -> %s:%i",
2682                                   v->name,
2683                                   vec->reads[s]->context.file, vec->reads[s]->context.line)
2684                        )
2685                     {
2686                         return false;
2687                     }
2688                     continue;
2689                 }
2690             }
2691             if (irwarning(v->context, WARN_USED_UNINITIALIZED,
2692                           "variable `%s` may be used uninitialized in this function", v->name))
2693             {
2694                 return false;
2695             }
2696         }
2697     }
2698     return true;
2699 }
2700
2701 /***********************************************************************
2702  *IR Code-Generation
2703  *
2704  * Since the IR has the convention of putting 'write' operands
2705  * at the beginning, we have to rotate the operands of instructions
2706  * properly in order to generate valid QCVM code.
2707  *
2708  * Having destinations at a fixed position is more convenient. In QC
2709  * this is *mostly* OPC,  but FTE adds at least 2 instructions which
2710  * read from from OPA,  and store to OPB rather than OPC.   Which is
2711  * partially the reason why the implementation of these instructions
2712  * in darkplaces has been delayed for so long.
2713  *
2714  * Breaking conventions is annoying...
2715  */
2716 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal);
2717
2718 static bool gen_global_field(code_t *code, ir_value *global)
2719 {
2720     if (global->hasvalue)
2721     {
2722         ir_value *fld = global->constval.vpointer;
2723         if (!fld) {
2724             irerror(global->context, "Invalid field constant with no field: %s", global->name);
2725             return false;
2726         }
2727
2728         /* copy the field's value */
2729         ir_value_code_setaddr(global, vec_size(code->globals));
2730         vec_push(code->globals, fld->code.fieldaddr);
2731         if (global->fieldtype == TYPE_VECTOR) {
2732             vec_push(code->globals, fld->code.fieldaddr+1);
2733             vec_push(code->globals, fld->code.fieldaddr+2);
2734         }
2735     }
2736     else
2737     {
2738         ir_value_code_setaddr(global, vec_size(code->globals));
2739         vec_push(code->globals, 0);
2740         if (global->fieldtype == TYPE_VECTOR) {
2741             vec_push(code->globals, 0);
2742             vec_push(code->globals, 0);
2743         }
2744     }
2745     if (global->code.globaladdr < 0)
2746         return false;
2747     return true;
2748 }
2749
2750 static bool gen_global_pointer(code_t *code, ir_value *global)
2751 {
2752     if (global->hasvalue)
2753     {
2754         ir_value *target = global->constval.vpointer;
2755         if (!target) {
2756             irerror(global->context, "Invalid pointer constant: %s", global->name);
2757             /* NULL pointers are pointing to the NULL constant, which also
2758              * sits at address 0, but still has an ir_value for itself.
2759              */
2760             return false;
2761         }
2762
2763         /* Here, relocations ARE possible - in fteqcc-enhanced-qc:
2764          * void() foo; <- proto
2765          * void() *fooptr = &foo;
2766          * void() foo = { code }
2767          */
2768         if (!target->code.globaladdr) {
2769             /* FIXME: Check for the constant nullptr ir_value!
2770              * because then code.globaladdr being 0 is valid.
2771              */
2772             irerror(global->context, "FIXME: Relocation support");
2773             return false;
2774         }
2775
2776         ir_value_code_setaddr(global, vec_size(code->globals));
2777         vec_push(code->globals, target->code.globaladdr);
2778     }
2779     else
2780     {
2781         ir_value_code_setaddr(global, vec_size(code->globals));
2782         vec_push(code->globals, 0);
2783     }
2784     if (global->code.globaladdr < 0)
2785         return false;
2786     return true;
2787 }
2788
2789 static bool gen_blocks_recursive(code_t *code, ir_function *func, ir_block *block)
2790 {
2791     prog_section_statement_t stmt;
2792     ir_instr *instr;
2793     ir_block *target;
2794     ir_block *ontrue;
2795     ir_block *onfalse;
2796     size_t    stidx;
2797     size_t    i;
2798     int       j;
2799
2800     block->generated = true;
2801     block->code_start = vec_size(code->statements);
2802     for (i = 0; i < vec_size(block->instr); ++i)
2803     {
2804         instr = block->instr[i];
2805
2806         if (instr->opcode == VINSTR_PHI) {
2807             irerror(block->context, "cannot generate virtual instruction (phi)");
2808             return false;
2809         }
2810
2811         if (instr->opcode == VINSTR_JUMP) {
2812             target = instr->bops[0];
2813             /* for uncoditional jumps, if the target hasn't been generated
2814              * yet, we generate them right here.
2815              */
2816             if (!target->generated)
2817                 return gen_blocks_recursive(code, func, target);
2818
2819             /* otherwise we generate a jump instruction */
2820             stmt.opcode = INSTR_GOTO;
2821             stmt.o1.s1 = (target->code_start) - vec_size(code->statements);
2822             stmt.o2.s1 = 0;
2823             stmt.o3.s1 = 0;
2824             if (stmt.o1.s1 != 1)
2825                 code_push_statement(code, &stmt, instr->context);
2826
2827             /* no further instructions can be in this block */
2828             return true;
2829         }
2830
2831         if (instr->opcode == VINSTR_BITXOR) {
2832             stmt.opcode = INSTR_BITOR;
2833             stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]);
2834             stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2835             stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2836             code_push_statement(code, &stmt, instr->context);
2837             stmt.opcode = INSTR_BITAND;
2838             stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]);
2839             stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2840             stmt.o3.s1 = ir_value_code_addr(func->owner->vinstr_temp[0]);
2841             code_push_statement(code, &stmt, instr->context);
2842             stmt.opcode = INSTR_SUB_F;
2843             stmt.o1.s1 = ir_value_code_addr(instr->_ops[0]);
2844             stmt.o2.s1 = ir_value_code_addr(func->owner->vinstr_temp[0]);
2845             stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2846             code_push_statement(code, &stmt, instr->context);
2847
2848             /* instruction generated */
2849             continue;
2850         }
2851
2852         if (instr->opcode == VINSTR_BITAND_V) {
2853             stmt.opcode = INSTR_BITAND;
2854             stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]);
2855             stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2856             stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2857             code_push_statement(code, &stmt, instr->context);
2858             ++stmt.o1.s1;
2859             ++stmt.o2.s1;
2860             ++stmt.o3.s1;
2861             code_push_statement(code, &stmt, instr->context);
2862             ++stmt.o1.s1;
2863             ++stmt.o2.s1;
2864             ++stmt.o3.s1;
2865             code_push_statement(code, &stmt, instr->context);
2866
2867             /* instruction generated */
2868             continue;
2869         }
2870
2871         if (instr->opcode == VINSTR_BITOR_V) {
2872             stmt.opcode = INSTR_BITOR;
2873             stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]);
2874             stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2875             stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2876             code_push_statement(code, &stmt, instr->context);
2877             ++stmt.o1.s1;
2878             ++stmt.o2.s1;
2879             ++stmt.o3.s1;
2880             code_push_statement(code, &stmt, instr->context);
2881             ++stmt.o1.s1;
2882             ++stmt.o2.s1;
2883             ++stmt.o3.s1;
2884             code_push_statement(code, &stmt, instr->context);
2885
2886             /* instruction generated */
2887             continue;
2888         }
2889
2890         if (instr->opcode == VINSTR_BITXOR_V) {
2891             for (j = 0; j < 3; ++j) {
2892                 stmt.opcode = INSTR_BITOR;
2893                 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]) + j;
2894                 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]) + j;
2895                 stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]) + j;
2896                 code_push_statement(code, &stmt, instr->context);
2897                 stmt.opcode = INSTR_BITAND;
2898                 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]) + j;
2899                 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]) + j;
2900                 stmt.o3.s1 = ir_value_code_addr(func->owner->vinstr_temp[0]) + j;
2901                 code_push_statement(code, &stmt, instr->context);
2902             }
2903             stmt.opcode = INSTR_SUB_V;
2904             stmt.o1.s1 = ir_value_code_addr(instr->_ops[0]);
2905             stmt.o2.s1 = ir_value_code_addr(func->owner->vinstr_temp[0]);
2906             stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2907             code_push_statement(code, &stmt, instr->context);
2908
2909             /* instruction generated */
2910             continue;
2911         }
2912
2913         if (instr->opcode == VINSTR_BITAND_VF) {
2914             stmt.opcode = INSTR_BITAND;
2915             stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]);
2916             stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2917             stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2918             code_push_statement(code, &stmt, instr->context);
2919             ++stmt.o1.s1;
2920             ++stmt.o3.s1;
2921             code_push_statement(code, &stmt, instr->context);
2922             ++stmt.o1.s1;
2923             ++stmt.o3.s1;
2924             code_push_statement(code, &stmt, instr->context);
2925
2926             /* instruction generated */
2927             continue;
2928         }
2929
2930         if (instr->opcode == VINSTR_BITOR_VF) {
2931             stmt.opcode = INSTR_BITOR;
2932             stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]);
2933             stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2934             stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2935             code_push_statement(code, &stmt, instr->context);
2936             ++stmt.o1.s1;
2937             ++stmt.o3.s1;
2938             code_push_statement(code, &stmt, instr->context);
2939             ++stmt.o1.s1;
2940             ++stmt.o3.s1;
2941             code_push_statement(code, &stmt, instr->context);
2942
2943             /* instruction generated */
2944             continue;
2945         }
2946
2947         if (instr->opcode == VINSTR_BITXOR_VF) {
2948             for (j = 0; j < 3; ++j) {
2949                 stmt.opcode = INSTR_BITOR;
2950                 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]) + j;
2951                 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2952                 stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]) + j;
2953                 code_push_statement(code, &stmt, instr->context);
2954                 stmt.opcode = INSTR_BITAND;
2955                 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]) + j;
2956                 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]);
2957                 stmt.o3.s1 = ir_value_code_addr(func->owner->vinstr_temp[0]) + j;
2958                 code_push_statement(code, &stmt, instr->context);
2959             }
2960             stmt.opcode = INSTR_SUB_V;
2961             stmt.o1.s1 = ir_value_code_addr(instr->_ops[0]);
2962             stmt.o2.s1 = ir_value_code_addr(func->owner->vinstr_temp[0]);
2963             stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2964             code_push_statement(code, &stmt, instr->context);
2965
2966             /* instruction generated */
2967             continue;
2968         }
2969
2970         if (instr->opcode == VINSTR_CROSS) {
2971             stmt.opcode = INSTR_MUL_F;
2972             for (j = 0; j < 3; ++j) {
2973                 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]) + (j + 1) % 3;
2974                 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]) + (j + 2) % 3;
2975                 stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]) + j;
2976                 code_push_statement(code, &stmt, instr->context);
2977                 stmt.o1.s1 = ir_value_code_addr(instr->_ops[1]) + (j + 2) % 3;
2978                 stmt.o2.s1 = ir_value_code_addr(instr->_ops[2]) + (j + 1) % 3;
2979                 stmt.o3.s1 = ir_value_code_addr(func->owner->vinstr_temp[0]) + j;
2980                 code_push_statement(code, &stmt, instr->context);
2981             }
2982             stmt.opcode = INSTR_SUB_V;
2983             stmt.o1.s1 = ir_value_code_addr(instr->_ops[0]);
2984             stmt.o2.s1 = ir_value_code_addr(func->owner->vinstr_temp[0]);
2985             stmt.o3.s1 = ir_value_code_addr(instr->_ops[0]);
2986             code_push_statement(code, &stmt, instr->context);
2987
2988             /* instruction generated */
2989             continue;
2990         }
2991
2992         if (instr->opcode == VINSTR_COND) {
2993             ontrue  = instr->bops[0];
2994             onfalse = instr->bops[1];
2995             /* TODO: have the AST signal which block should
2996              * come first: eg. optimize IFs without ELSE...
2997              */
2998
2999             stmt.o1.u1 = ir_value_code_addr(instr->_ops[0]);
3000             stmt.o2.u1 = 0;
3001             stmt.o3.s1 = 0;
3002
3003             if (ontrue->generated) {
3004                 stmt.opcode = INSTR_IF;
3005                 stmt.o2.s1 = (ontrue->code_start) - vec_size(code->statements);
3006                 if (stmt.o2.s1 != 1)
3007                     code_push_statement(code, &stmt, instr->context);
3008             }
3009             if (onfalse->generated) {
3010                 stmt.opcode = INSTR_IFNOT;
3011                 stmt.o2.s1 = (onfalse->code_start) - vec_size(code->statements);
3012                 if (stmt.o2.s1 != 1)
3013                     code_push_statement(code, &stmt, instr->context);
3014             }
3015             if (!ontrue->generated) {
3016                 if (onfalse->generated)
3017                     return gen_blocks_recursive(code, func, ontrue);
3018             }
3019             if (!onfalse->generated) {
3020                 if (ontrue->generated)
3021                     return gen_blocks_recursive(code, func, onfalse);
3022             }
3023             /* neither ontrue nor onfalse exist */
3024             stmt.opcode = INSTR_IFNOT;
3025             if (!instr->likely) {
3026                 /* Honor the likelyhood hint */
3027                 ir_block *tmp = onfalse;
3028                 stmt.opcode = INSTR_IF;
3029                 onfalse = ontrue;
3030                 ontrue = tmp;
3031             }
3032             stidx = vec_size(code->statements);
3033             code_push_statement(code, &stmt, instr->context);
3034             /* on false we jump, so add ontrue-path */
3035             if (!gen_blocks_recursive(code, func, ontrue))
3036                 return false;
3037             /* fixup the jump address */
3038             code->statements[stidx].o2.s1 = vec_size(code->statements) - stidx;
3039             /* generate onfalse path */
3040             if (onfalse->generated) {
3041                 /* fixup the jump address */
3042                 code->statements[stidx].o2.s1 = (onfalse->code_start) - (stidx);
3043                 if (stidx+2 == vec_size(code->statements) && code->statements[stidx].o2.s1 == 1) {
3044                     code->statements[stidx] = code->statements[stidx+1];
3045                     if (code->statements[stidx].o1.s1 < 0)
3046                         code->statements[stidx].o1.s1++;
3047                     code_pop_statement(code);
3048                 }
3049                 stmt.opcode = vec_last(code->statements).opcode;
3050                 if (stmt.opcode == INSTR_GOTO ||
3051                     stmt.opcode == INSTR_IF ||
3052                     stmt.opcode == INSTR_IFNOT ||
3053                     stmt.opcode == INSTR_RETURN ||
3054                     stmt.opcode == INSTR_DONE)
3055                 {
3056                     /* no use jumping from here */
3057                     return true;
3058                 }
3059                 /* may have been generated in the previous recursive call */
3060                 stmt.opcode = INSTR_GOTO;
3061                 stmt.o1.s1 = (onfalse->code_start) - vec_size(code->statements);
3062                 stmt.o2.s1 = 0;
3063                 stmt.o3.s1 = 0;
3064                 if (stmt.o1.s1 != 1)
3065                     code_push_statement(code, &stmt, instr->context);
3066                 return true;
3067             }
3068             else if (stidx+2 == vec_size(code->statements) && code->statements[stidx].o2.s1 == 1) {
3069                 code->statements[stidx] = code->statements[stidx+1];
3070                 if (code->statements[stidx].o1.s1 < 0)
3071                     code->statements[stidx].o1.s1++;
3072                 code_pop_statement(code);
3073             }
3074             /* if not, generate now */
3075             return gen_blocks_recursive(code, func, onfalse);
3076         }
3077
3078         if ( (instr->opcode >= INSTR_CALL0 && instr->opcode <= INSTR_CALL8)
3079            || instr->opcode == VINSTR_NRCALL)
3080         {
3081             size_t p, first;
3082             ir_value *retvalue;
3083
3084             first = vec_size(instr->params);
3085             if (first > 8)
3086                 first = 8;
3087             for (p = 0; p < first; ++p)
3088             {
3089                 ir_value *param = instr->params[p];
3090                 if (param->callparam)
3091                     continue;
3092
3093                 stmt.opcode = INSTR_STORE_F;
3094                 stmt.o3.u1 = 0;
3095
3096                 if (param->vtype == TYPE_FIELD)
3097                     stmt.opcode = field_store_instr[param->fieldtype];
3098                 else if (param->vtype == TYPE_NIL)
3099                     stmt.opcode = INSTR_STORE_V;
3100                 else
3101                     stmt.opcode = type_store_instr[param->vtype];
3102                 stmt.o1.u1 = ir_value_code_addr(param);
3103                 stmt.o2.u1 = OFS_PARM0 + 3 * p;
3104                 code_push_statement(code, &stmt, instr->context);
3105             }
3106             /* Now handle extparams */
3107             first = vec_size(instr->params);
3108             for (; p < first; ++p)
3109             {
3110                 ir_builder *ir = func->owner;
3111                 ir_value *param = instr->params[p];
3112                 ir_value *targetparam;
3113
3114                 if (param->callparam)
3115                     continue;
3116
3117                 if (p-8 >= vec_size(ir->extparams))
3118                     ir_gen_extparam(ir);
3119
3120                 targetparam = ir->extparams[p-8];
3121
3122                 stmt.opcode = INSTR_STORE_F;
3123                 stmt.o3.u1 = 0;
3124
3125                 if (param->vtype == TYPE_FIELD)
3126                     stmt.opcode = field_store_instr[param->fieldtype];
3127                 else if (param->vtype == TYPE_NIL)
3128                     stmt.opcode = INSTR_STORE_V;
3129                 else
3130                     stmt.opcode = type_store_instr[param->vtype];
3131                 stmt.o1.u1 = ir_value_code_addr(param);
3132                 stmt.o2.u1 = ir_value_code_addr(targetparam);
3133                 code_push_statement(code, &stmt, instr->context);
3134             }
3135
3136             stmt.opcode = INSTR_CALL0 + vec_size(instr->params);
3137             if (stmt.opcode > INSTR_CALL8)
3138                 stmt.opcode = INSTR_CALL8;
3139             stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
3140             stmt.o2.u1 = 0;
3141             stmt.o3.u1 = 0;
3142             code_push_statement(code, &stmt, instr->context);
3143
3144             retvalue = instr->_ops[0];
3145             if (retvalue && retvalue->store != store_return &&
3146                 (retvalue->store == store_global || vec_size(retvalue->life)))
3147             {
3148                 /* not to be kept in OFS_RETURN */
3149                 if (retvalue->vtype == TYPE_FIELD && OPTS_FLAG(ADJUST_VECTOR_FIELDS))
3150                     stmt.opcode = field_store_instr[retvalue->fieldtype];
3151                 else
3152                     stmt.opcode = type_store_instr[retvalue->vtype];
3153                 stmt.o1.u1 = OFS_RETURN;
3154                 stmt.o2.u1 = ir_value_code_addr(retvalue);
3155                 stmt.o3.u1 = 0;
3156                 code_push_statement(code, &stmt, instr->context);
3157             }
3158             continue;
3159         }
3160
3161         if (instr->opcode == INSTR_STATE) {
3162             irerror(block->context, "TODO: state instruction");
3163             return false;
3164         }
3165
3166         stmt.opcode = instr->opcode;
3167         stmt.o1.u1 = 0;
3168         stmt.o2.u1 = 0;
3169         stmt.o3.u1 = 0;
3170
3171         /* This is the general order of operands */
3172         if (instr->_ops[0])
3173             stmt.o3.u1 = ir_value_code_addr(instr->_ops[0]);
3174
3175         if (instr->_ops[1])
3176             stmt.o1.u1 = ir_value_code_addr(instr->_ops[1]);
3177
3178         if (instr->_ops[2])
3179             stmt.o2.u1 = ir_value_code_addr(instr->_ops[2]);
3180
3181         if (stmt.opcode == INSTR_RETURN || stmt.opcode == INSTR_DONE)
3182         {
3183             stmt.o1.u1 = stmt.o3.u1;
3184             stmt.o3.u1 = 0;
3185         }
3186         else if ((stmt.opcode >= INSTR_STORE_F &&
3187                   stmt.opcode <= INSTR_STORE_FNC) ||
3188                  (stmt.opcode >= INSTR_STOREP_F &&
3189                   stmt.opcode <= INSTR_STOREP_FNC))
3190         {
3191             /* 2-operand instructions with A -> B */
3192             stmt.o2.u1 = stmt.o3.u1;
3193             stmt.o3.u1 = 0;
3194
3195             /* tiny optimization, don't output
3196              * STORE a, a
3197              */
3198             if (stmt.o2.u1 == stmt.o1.u1 &&
3199                 OPTS_OPTIMIZATION(OPTIM_PEEPHOLE))
3200             {
3201                 ++opts_optimizationcount[OPTIM_PEEPHOLE];
3202                 continue;
3203             }
3204         }
3205         code_push_statement(code, &stmt, instr->context);
3206     }
3207     return true;
3208 }
3209
3210 static bool gen_function_code(code_t *code, ir_function *self)
3211 {
3212     ir_block *block;
3213     prog_section_statement_t stmt, *retst;
3214
3215     /* Starting from entry point, we generate blocks "as they come"
3216      * for now. Dead blocks will not be translated obviously.
3217      */
3218     if (!vec_size(self->blocks)) {
3219         irerror(self->context, "Function '%s' declared without body.", self->name);
3220         return false;
3221     }
3222
3223     block = self->blocks[0];
3224     if (block->generated)
3225         return true;
3226
3227     if (!gen_blocks_recursive(code, self, block)) {
3228         irerror(self->context, "failed to generate blocks for '%s'", self->name);
3229         return false;
3230     }
3231
3232     /* code_write and qcvm -disasm need to know that the function ends here */
3233     retst = &vec_last(code->statements);
3234     if (OPTS_OPTIMIZATION(OPTIM_VOID_RETURN) &&
3235         self->outtype == TYPE_VOID &&
3236         retst->opcode == INSTR_RETURN &&
3237         !retst->o1.u1 && !retst->o2.u1 && !retst->o3.u1)
3238     {
3239         retst->opcode = INSTR_DONE;
3240         ++opts_optimizationcount[OPTIM_VOID_RETURN];
3241     } else {
3242         lex_ctx_t last;
3243
3244         stmt.opcode = INSTR_DONE;
3245         stmt.o1.u1  = 0;
3246         stmt.o2.u1  = 0;
3247         stmt.o3.u1  = 0;
3248         last.line   = vec_last(code->linenums);
3249         last.column = vec_last(code->columnnums);
3250
3251         code_push_statement(code, &stmt, last);
3252     }
3253     return true;
3254 }
3255
3256 static qcint_t ir_builder_filestring(ir_builder *ir, const char *filename)
3257 {
3258     /* NOTE: filename pointers are copied, we never strdup them,
3259      * thus we can use pointer-comparison to find the string.
3260      */
3261     size_t i;
3262     qcint_t  str;
3263
3264     for (i = 0; i < vec_size(ir->filenames); ++i) {
3265         if (ir->filenames[i] == filename)
3266             return ir->filestrings[i];
3267     }
3268
3269     str = code_genstring(ir->code, filename);
3270     vec_push(ir->filenames, filename);
3271     vec_push(ir->filestrings, str);
3272     return str;
3273 }
3274
3275 static bool gen_global_function(ir_builder *ir, ir_value *global)
3276 {
3277     prog_section_function_t fun;
3278     ir_function            *irfun;
3279
3280     size_t i;
3281
3282     if (!global->hasvalue || (!global->constval.vfunc))
3283     {
3284         irerror(global->context, "Invalid state of function-global: not constant: %s", global->name);
3285         return false;
3286     }
3287
3288     irfun = global->constval.vfunc;
3289
3290     fun.name    = global->code.name;
3291     fun.file    = ir_builder_filestring(ir, global->context.file);
3292     fun.profile = 0; /* always 0 */
3293     fun.nargs   = vec_size(irfun->params);
3294     if (fun.nargs > 8)
3295         fun.nargs = 8;
3296
3297     for (i = 0;i < 8; ++i) {
3298         if ((int32_t)i >= fun.nargs)
3299             fun.argsize[i] = 0;
3300         else
3301             fun.argsize[i] = type_sizeof_[irfun->params[i]];
3302     }
3303
3304     fun.firstlocal = 0;
3305     fun.locals     = irfun->allocated_locals;
3306
3307     if (irfun->builtin)
3308         fun.entry = irfun->builtin+1;
3309     else {
3310         irfun->code_function_def = vec_size(ir->code->functions);
3311         fun.entry                = vec_size(ir->code->statements);
3312     }
3313
3314     vec_push(ir->code->functions, fun);
3315     return true;
3316 }
3317
3318 static ir_value* ir_gen_extparam_proto(ir_builder *ir)
3319 {
3320     ir_value *global;
3321     char      name[128];
3322
3323     util_snprintf(name, sizeof(name), "EXTPARM#%i", (int)(vec_size(ir->extparam_protos)));
3324     global = ir_value_var(name, store_global, TYPE_VECTOR);
3325
3326     vec_push(ir->extparam_protos, global);
3327     return global;
3328 }
3329
3330 static void ir_gen_extparam(ir_builder *ir)
3331 {
3332     prog_section_def_t def;
3333     ir_value          *global;
3334
3335     if (vec_size(ir->extparam_protos) < vec_size(ir->extparams)+1)
3336         global = ir_gen_extparam_proto(ir);
3337     else
3338         global = ir->extparam_protos[vec_size(ir->extparams)];
3339
3340     def.name   = code_genstring(ir->code, global->name);
3341     def.type   = TYPE_VECTOR;
3342     def.offset = vec_size(ir->code->globals);
3343
3344     vec_push(ir->code->defs, def);
3345
3346     ir_value_code_setaddr(global, def.offset);
3347
3348     vec_push(ir->code->globals, 0);
3349     vec_push(ir->code->globals, 0);
3350     vec_push(ir->code->globals, 0);
3351
3352     vec_push(ir->extparams, global);
3353 }
3354
3355 static bool gen_function_extparam_copy(code_t *code, ir_function *self)
3356 {
3357     size_t i, ext, numparams;
3358
3359     ir_builder *ir = self->owner;
3360     ir_value   *ep;
3361     prog_section_statement_t stmt;
3362
3363     numparams = vec_size(self->params);
3364     if (!numparams)
3365         return true;
3366
3367     stmt.opcode = INSTR_STORE_F;
3368     stmt.o3.s1 = 0;
3369     for (i = 8; i < numparams; ++i) {
3370         ext = i - 8;
3371         if (ext >= vec_size(ir->extparams))
3372             ir_gen_extparam(ir);
3373
3374         ep = ir->extparams[ext];
3375
3376         stmt.opcode = type_store_instr[self->locals[i]->vtype];
3377         if (self->locals[i]->vtype == TYPE_FIELD &&
3378             self->locals[i]->fieldtype == TYPE_VECTOR)
3379         {
3380             stmt.opcode = INSTR_STORE_V;
3381         }
3382         stmt.o1.u1 = ir_value_code_addr(ep);
3383         stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
3384         code_push_statement(code, &stmt, self->context);
3385     }
3386
3387     return true;
3388 }
3389
3390 static bool gen_function_varargs_copy(code_t *code, ir_function *self)
3391 {
3392     size_t i, ext, numparams, maxparams;
3393
3394     ir_builder *ir = self->owner;
3395     ir_value   *ep;
3396     prog_section_statement_t stmt;
3397
3398     numparams = vec_size(self->params);
3399     if (!numparams)
3400         return true;
3401
3402     stmt.opcode = INSTR_STORE_V;
3403     stmt.o3.s1 = 0;
3404     maxparams = numparams + self->max_varargs;
3405     for (i = numparams; i < maxparams; ++i) {
3406         if (i < 8) {
3407             stmt.o1.u1 = OFS_PARM0 + 3*i;
3408             stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
3409             code_push_statement(code, &stmt, self->context);
3410             continue;
3411         }
3412         ext = i - 8;
3413         while (ext >= vec_size(ir->extparams))
3414             ir_gen_extparam(ir);
3415
3416         ep = ir->extparams[ext];
3417
3418         stmt.o1.u1 = ir_value_code_addr(ep);
3419         stmt.o2.u1 = ir_value_code_addr(self->locals[i]);
3420         code_push_statement(code, &stmt, self->context);
3421     }
3422
3423     return true;
3424 }
3425
3426 static bool gen_function_locals(ir_builder *ir, ir_value *global)
3427 {
3428     prog_section_function_t *def;
3429     ir_function             *irfun;
3430     size_t                   i;
3431     uint32_t                 firstlocal, firstglobal;
3432
3433     irfun = global->constval.vfunc;
3434     def   = ir->code->functions + irfun->code_function_def;
3435
3436     if (OPTS_OPTION_BOOL(OPTION_G) ||
3437         !OPTS_OPTIMIZATION(OPTIM_OVERLAP_LOCALS)        ||
3438         (irfun->flags & IR_FLAG_MASK_NO_OVERLAP))
3439     {
3440         firstlocal = def->firstlocal = vec_size(ir->code->globals);
3441     } else {
3442         firstlocal = def->firstlocal = ir->first_common_local;
3443         ++opts_optimizationcount[OPTIM_OVERLAP_LOCALS];
3444     }
3445
3446     firstglobal = (OPTS_OPTIMIZATION(OPTIM_GLOBAL_TEMPS) ? ir->first_common_globaltemp : firstlocal);
3447
3448     for (i = vec_size(ir->code->globals); i < firstlocal + irfun->allocated_locals; ++i)
3449         vec_push(ir->code->globals, 0);
3450     for (i = 0; i < vec_size(irfun->locals); ++i) {
3451         ir_value *v = irfun->locals[i];
3452         if (v->locked || !OPTS_OPTIMIZATION(OPTIM_GLOBAL_TEMPS)) {
3453             ir_value_code_setaddr(v, firstlocal + v->code.local);
3454             if (!ir_builder_gen_global(ir, irfun->locals[i], true)) {
3455                 irerror(irfun->locals[i]->context, "failed to generate local %s", irfun->locals[i]->name);
3456                 return false;
3457             }
3458         }
3459         else
3460             ir_value_code_setaddr(v, firstglobal + v->code.local);
3461     }
3462     for (i = 0; i < vec_size(irfun->values); ++i)
3463     {
3464         ir_value *v = irfun->values[i];
3465         if (v->callparam)
3466             continue;
3467         if (v->locked)
3468             ir_value_code_setaddr(v, firstlocal + v->code.local);
3469         else
3470             ir_value_code_setaddr(v, firstglobal + v->code.local);
3471     }
3472     return true;
3473 }
3474
3475 static bool gen_global_function_code(ir_builder *ir, ir_value *global)
3476 {
3477     prog_section_function_t *fundef;
3478     ir_function             *irfun;
3479
3480     (void)ir;
3481
3482     irfun = global->constval.vfunc;
3483     if (!irfun) {
3484         if (global->cvq == CV_NONE) {
3485             if (irwarning(global->context, WARN_IMPLICIT_FUNCTION_POINTER,
3486                           "function `%s` has no body and in QC implicitly becomes a function-pointer",
3487                           global->name))
3488             {
3489                 /* Not bailing out just now. If this happens a lot you don't want to have
3490                  * to rerun gmqcc for each such function.
3491                  */
3492
3493                 /* return false; */
3494             }
3495         }
3496         /* this was a function pointer, don't generate code for those */
3497         return true;
3498     }
3499
3500     if (irfun->builtin)
3501         return true;
3502
3503     /*
3504      * If there is no definition and the thing is eraseable, we can ignore
3505      * outputting the function to begin with.
3506      */
3507     if (global->flags & IR_FLAG_ERASEABLE && irfun->code_function_def < 0) {
3508         return true;
3509     }
3510
3511     if (irfun->code_function_def < 0) {
3512         irerror(irfun->context, "`%s`: IR global wasn't generated, failed to access function-def", irfun->name);
3513         return false;
3514     }
3515     fundef = &ir->code->functions[irfun->code_function_def];
3516
3517     fundef->entry = vec_size(ir->code->statements);
3518     if (!gen_function_locals(ir, global)) {
3519         irerror(irfun->context, "Failed to generate locals for function %s", irfun->name);
3520         return false;
3521     }
3522     if (!gen_function_extparam_copy(ir->code, irfun)) {
3523         irerror(irfun->context, "Failed to generate extparam-copy code for function %s", irfun->name);
3524         return false;
3525     }
3526     if (irfun->max_varargs && !gen_function_varargs_copy(ir->code, irfun)) {
3527         irerror(irfun->context, "Failed to generate vararg-copy code for function %s", irfun->name);
3528         return false;
3529     }
3530     if (!gen_function_code(ir->code, irfun)) {
3531         irerror(irfun->context, "Failed to generate code for function %s", irfun->name);
3532         return false;
3533     }
3534     return true;
3535 }
3536
3537 static void gen_vector_defs(code_t *code, prog_section_def_t def, const char *name)
3538 {
3539     char  *component;
3540     size_t len, i;
3541
3542     if (!name || name[0] == '#' || OPTS_FLAG(SINGLE_VECTOR_DEFS))
3543         return;
3544
3545     def.type = TYPE_FLOAT;
3546
3547     len = strlen(name);
3548
3549     component = (char*)mem_a(len+3);
3550     memcpy(component, name, len);
3551     len += 2;
3552     component[len-0] = 0;
3553     component[len-2] = '_';
3554
3555     component[len-1] = 'x';
3556
3557     for (i = 0; i < 3; ++i) {
3558         def.name = code_genstring(code, component);
3559         vec_push(code->defs, def);
3560         def.offset++;
3561         component[len-1]++;
3562     }
3563
3564     mem_d(component);
3565 }
3566
3567 static void gen_vector_fields(code_t *code, prog_section_field_t fld, const char *name)
3568 {
3569     char  *component;
3570     size_t len, i;
3571
3572     if (!name || OPTS_FLAG(SINGLE_VECTOR_DEFS))
3573         return;
3574
3575     fld.type = TYPE_FLOAT;
3576
3577     len = strlen(name);
3578
3579     component = (char*)mem_a(len+3);
3580     memcpy(component, name, len);
3581     len += 2;
3582     component[len-0] = 0;
3583     component[len-2] = '_';
3584
3585     component[len-1] = 'x';
3586
3587     for (i = 0; i < 3; ++i) {
3588         fld.name = code_genstring(code, component);
3589         vec_push(code->fields, fld);
3590         fld.offset++;
3591         component[len-1]++;
3592     }
3593
3594     mem_d(component);
3595 }
3596
3597 static bool ir_builder_gen_global(ir_builder *self, ir_value *global, bool islocal)
3598 {
3599     size_t             i;
3600     int32_t           *iptr;
3601     prog_section_def_t def;
3602     bool               pushdef = opts.optimizeoff;
3603
3604     def.type   = global->vtype;
3605     def.offset = vec_size(self->code->globals);
3606     def.name   = 0;
3607     if (OPTS_OPTION_BOOL(OPTION_G) || !islocal)
3608     {
3609         pushdef = true;
3610
3611         /*
3612          * if we're eraseable and the function isn't referenced ignore outputting
3613          * the function.
3614          */
3615         if (global->flags & IR_FLAG_ERASEABLE && vec_size(global->reads) == 0) {
3616             return true;
3617         }
3618
3619         if (OPTS_OPTIMIZATION(OPTIM_STRIP_CONSTANT_NAMES) &&
3620             !(global->flags & IR_FLAG_INCLUDE_DEF) &&
3621             (global->name[0] == '#' || global->cvq == CV_CONST))
3622         {
3623             pushdef = false;
3624         }
3625
3626         if (pushdef) {
3627             if (global->name[0] == '#') {
3628                 if (!self->str_immediate)
3629                     self->str_immediate = code_genstring(self->code, "IMMEDIATE");
3630                 def.name = global->code.name = self->str_immediate;
3631             }
3632             else
3633                 def.name = global->code.name = code_genstring(self->code, global->name);
3634         }
3635         else
3636             def.name   = 0;
3637         if (islocal) {
3638             def.offset = ir_value_code_addr(global);
3639             vec_push(self->code->defs, def);
3640             if (global->vtype == TYPE_VECTOR)
3641                 gen_vector_defs(self->code, def, global->name);
3642             else if (global->vtype == TYPE_FIELD && global->fieldtype == TYPE_VECTOR)
3643                 gen_vector_defs(self->code, def, global->name);
3644             return true;
3645         }
3646     }
3647     if (islocal)
3648         return true;
3649
3650     switch (global->vtype)
3651     {
3652     case TYPE_VOID:
3653         if (!strcmp(global->name, "end_sys_globals")) {
3654             /* TODO: remember this point... all the defs before this one
3655              * should be checksummed and added to progdefs.h when we generate it.
3656              */
3657         }
3658         else if (!strcmp(global->name, "end_sys_fields")) {
3659             /* TODO: same as above but for entity-fields rather than globsl
3660              */
3661         }
3662         else if(irwarning(global->context, WARN_VOID_VARIABLES, "unrecognized variable of type void `%s`",
3663                           global->name))
3664         {
3665             /* Not bailing out */
3666             /* return false; */
3667         }
3668         /* I'd argue setting it to 0 is sufficient, but maybe some depend on knowing how far
3669          * the system fields actually go? Though the engine knows this anyway...
3670          * Maybe this could be an -foption
3671          * fteqcc creates data for end_sys_* - of size 1, so let's do the same
3672          */
3673         ir_value_code_setaddr(global, vec_size(self->code->globals));
3674         vec_push(self->code->globals, 0);
3675         /* Add the def */
3676         if (pushdef) vec_push(self->code->defs, def);
3677         return true;
3678     case TYPE_POINTER:
3679         if (pushdef) vec_push(self->code->defs, def);
3680         return gen_global_pointer(self->code, global);
3681     case TYPE_FIELD:
3682         if (pushdef) {
3683             vec_push(self->code->defs, def);
3684             if (global->fieldtype == TYPE_VECTOR)
3685                 gen_vector_defs(self->code, def, global->name);
3686         }
3687         return gen_global_field(self->code, global);
3688     case TYPE_ENTITY:
3689         /* fall through */
3690     case TYPE_FLOAT:
3691     {
3692         ir_value_code_setaddr(global, vec_size(self->code->globals));
3693         if (global->hasvalue) {
3694             iptr = (int32_t*)&global->constval.ivec[0];
3695             vec_push(self->code->globals, *iptr);
3696         } else {
3697             vec_push(self->code->globals, 0);
3698         }
3699         if (!islocal && global->cvq != CV_CONST)
3700             def.type |= DEF_SAVEGLOBAL;
3701         if (pushdef) vec_push(self->code->defs, def);
3702
3703         return global->code.globaladdr >= 0;
3704     }
3705     case TYPE_STRING:
3706     {
3707         ir_value_code_setaddr(global, vec_size(self->code->globals));
3708         if (global->hasvalue) {
3709             uint32_t load = code_genstring(self->code, global->constval.vstring);
3710             vec_push(self->code->globals, load);
3711         } else {
3712             vec_push(self->code->globals, 0);
3713         }
3714         if (!islocal && global->cvq != CV_CONST)
3715             def.type |= DEF_SAVEGLOBAL;
3716         if (pushdef) vec_push(self->code->defs, def);
3717         return global->code.globaladdr >= 0;
3718     }
3719     case TYPE_VECTOR:
3720     {
3721         size_t d;
3722         ir_value_code_setaddr(global, vec_size(self->code->globals));
3723         if (global->hasvalue) {
3724             iptr = (int32_t*)&global->constval.ivec[0];
3725             vec_push(self->code->globals, iptr[0]);
3726             if (global->code.globaladdr < 0)
3727                 return false;
3728             for (d = 1; d < type_sizeof_[global->vtype]; ++d) {
3729                 vec_push(self->code->globals, iptr[d]);
3730             }
3731         } else {
3732             vec_push(self->code->globals, 0);
3733             if (global->code.globaladdr < 0)
3734                 return false;
3735             for (d = 1; d < type_sizeof_[global->vtype]; ++d) {
3736                 vec_push(self->code->globals, 0);
3737             }
3738         }
3739         if (!islocal && global->cvq != CV_CONST)
3740             def.type |= DEF_SAVEGLOBAL;
3741
3742         if (pushdef) {
3743             vec_push(self->code->defs, def);
3744             def.type &= ~DEF_SAVEGLOBAL;
3745             gen_vector_defs(self->code, def, global->name);
3746         }
3747         return global->code.globaladdr >= 0;
3748     }
3749     case TYPE_FUNCTION:
3750         ir_value_code_setaddr(global, vec_size(self->code->globals));
3751         if (!global->hasvalue) {
3752             vec_push(self->code->globals, 0);
3753             if (global->code.globaladdr < 0)
3754                 return false;
3755         } else {
3756             vec_push(self->code->globals, vec_size(self->code->functions));
3757             if (!gen_global_function(self, global))
3758                 return false;
3759         }
3760         if (!islocal && global->cvq != CV_CONST)
3761             def.type |= DEF_SAVEGLOBAL;
3762         if (pushdef) vec_push(self->code->defs, def);
3763         return true;
3764     case TYPE_VARIANT:
3765         /* assume biggest type */
3766             ir_value_code_setaddr(global, vec_size(self->code->globals));
3767             vec_push(self->code->globals, 0);
3768             for (i = 1; i < type_sizeof_[TYPE_VARIANT]; ++i)
3769                 vec_push(self->code->globals, 0);
3770             return true;
3771     default:
3772         /* refuse to create 'void' type or any other fancy business. */
3773         irerror(global->context, "Invalid type for global variable `%s`: %s",
3774                 global->name, type_name[global->vtype]);
3775         return false;
3776     }
3777 }
3778
3779 static GMQCC_INLINE void ir_builder_prepare_field(code_t *code, ir_value *field)
3780 {
3781     field->code.fieldaddr = code_alloc_field(code, type_sizeof_[field->fieldtype]);
3782 }
3783
3784 static bool ir_builder_gen_field(ir_builder *self, ir_value *field)
3785 {
3786     prog_section_def_t def;
3787     prog_section_field_t fld;
3788
3789     (void)self;
3790
3791     def.type   = (uint16_t)field->vtype;
3792     def.offset = (uint16_t)vec_size(self->code->globals);
3793
3794     /* create a global named the same as the field */
3795     if (OPTS_OPTION_U32(OPTION_STANDARD) == COMPILER_GMQCC) {
3796         /* in our standard, the global gets a dot prefix */
3797         size_t len = strlen(field->name);
3798         char name[1024];
3799
3800         /* we really don't want to have to allocate this, and 1024
3801          * bytes is more than enough for a variable/field name
3802          */
3803         if (len+2 >= sizeof(name)) {
3804             irerror(field->context, "invalid field name size: %u", (unsigned int)len);
3805             return false;
3806         }
3807
3808         name[0] = '.';
3809         memcpy(name+1, field->name, len); /* no strncpy - we used strlen above */
3810         name[len+1] = 0;
3811
3812         def.name = code_genstring(self->code, name);
3813         fld.name = def.name + 1; /* we reuse that string table entry */
3814     } else {
3815         /* in plain QC, there cannot be a global with the same name,
3816          * and so we also name the global the same.
3817          * FIXME: fteqcc should create a global as well
3818          * check if it actually uses the same name. Probably does
3819          */
3820         def.name = code_genstring(self->code, field->name);
3821         fld.name = def.name;
3822     }
3823
3824     field->code.name = def.name;
3825
3826     vec_push(self->code->defs, def);
3827
3828     fld.type = field->fieldtype;
3829
3830     if (fld.type == TYPE_VOID) {
3831         irerror(field->context, "field is missing a type: %s - don't know its size", field->name);
3832         return false;
3833     }
3834
3835     fld.offset = field->code.fieldaddr;
3836
3837     vec_push(self->code->fields, fld);
3838
3839     ir_value_code_setaddr(field, vec_size(self->code->globals));
3840     vec_push(self->code->globals, fld.offset);
3841     if (fld.type == TYPE_VECTOR) {
3842         vec_push(self->code->globals, fld.offset+1);
3843         vec_push(self->code->globals, fld.offset+2);
3844     }
3845
3846     if (field->fieldtype == TYPE_VECTOR) {
3847         gen_vector_defs  (self->code, def, field->name);
3848         gen_vector_fields(self->code, fld, field->name);
3849     }
3850
3851     return field->code.globaladdr >= 0;
3852 }
3853
3854 bool ir_builder_generate(ir_builder *self, const char *filename)
3855 {
3856     prog_section_statement_t stmt;
3857     size_t i;
3858     char  *lnofile = NULL;
3859
3860     for (i = 0; i < vec_size(self->fields); ++i)
3861     {
3862         ir_builder_prepare_field(self->code, self->fields[i]);
3863     }
3864
3865     for (i = 0; i < vec_size(self->globals); ++i)
3866     {
3867         if (!ir_builder_gen_global(self, self->globals[i], false)) {
3868             return false;
3869         }
3870         if (self->globals[i]->vtype == TYPE_FUNCTION) {
3871             ir_function *func = self->globals[i]->constval.vfunc;
3872             if (func && self->max_locals < func->allocated_locals &&
3873                 !(func->flags & IR_FLAG_MASK_NO_OVERLAP))
3874             {
3875                 self->max_locals = func->allocated_locals;
3876             }
3877             if (func && self->max_globaltemps < func->globaltemps)
3878                 self->max_globaltemps = func->globaltemps;
3879         }
3880     }
3881
3882     for (i = 0; i < vec_size(self->fields); ++i)
3883     {
3884         if (!ir_builder_gen_field(self, self->fields[i])) {
3885             return false;
3886         }
3887     }
3888
3889     /* generate nil */
3890     ir_value_code_setaddr(self->nil, vec_size(self->code->globals));
3891     vec_push(self->code->globals, 0);
3892     vec_push(self->code->globals, 0);
3893     vec_push(self->code->globals, 0);
3894
3895     /* generate virtual-instruction temps */
3896     for (i = 0; i < IR_MAX_VINSTR_TEMPS; ++i) {
3897         ir_value_code_setaddr(self->vinstr_temp[i], vec_size(self->code->globals));
3898         vec_push(self->code->globals, 0);
3899         vec_push(self->code->globals, 0);
3900         vec_push(self->code->globals, 0);
3901     }
3902
3903     /* generate global temps */
3904     self->first_common_globaltemp = vec_size(self->code->globals);
3905     for (i = 0; i < self->max_globaltemps; ++i) {
3906         vec_push(self->code->globals, 0);
3907     }
3908     /* generate common locals */
3909     self->first_common_local = vec_size(self->code->globals);
3910     for (i = 0; i < self->max_locals; ++i) {
3911         vec_push(self->code->globals, 0);
3912     }
3913
3914     /* generate function code */
3915     for (i = 0; i < vec_size(self->globals); ++i)
3916     {
3917         if (self->globals[i]->vtype == TYPE_FUNCTION) {
3918             if (!gen_global_function_code(self, self->globals[i])) {
3919                 return false;
3920             }
3921         }
3922     }
3923
3924     if (vec_size(self->code->globals) >= 65536) {
3925         irerror(vec_last(self->globals)->context, "This progs file would require more globals than the metadata can handle. Bailing out.");
3926         return false;
3927     }
3928
3929     /* DP errors if the last instruction is not an INSTR_DONE. */
3930     if (vec_last(self->code->statements).opcode != INSTR_DONE)
3931     {
3932         lex_ctx_t last;
3933
3934         stmt.opcode = INSTR_DONE;
3935         stmt.o1.u1  = 0;
3936         stmt.o2.u1  = 0;
3937         stmt.o3.u1  = 0;
3938         last.line   = vec_last(self->code->linenums);
3939         last.column = vec_last(self->code->columnnums);
3940
3941         code_push_statement(self->code, &stmt, last);
3942     }
3943
3944     if (OPTS_OPTION_BOOL(OPTION_PP_ONLY))
3945         return true;
3946
3947     if (vec_size(self->code->statements) != vec_size(self->code->linenums)) {
3948         con_err("Linecounter wrong: %lu != %lu\n",
3949                 (unsigned long)vec_size(self->code->statements),
3950                 (unsigned long)vec_size(self->code->linenums));
3951     } else if (OPTS_FLAG(LNO)) {
3952         char  *dot;
3953         size_t filelen = strlen(filename);
3954
3955         memcpy(vec_add(lnofile, filelen+1), filename, filelen+1);
3956         dot = strrchr(lnofile, '.');
3957         if (!dot) {
3958             vec_pop(lnofile);
3959         } else {
3960             vec_shrinkto(lnofile, dot - lnofile);
3961         }
3962         memcpy(vec_add(lnofile, 5), ".lno", 5);
3963     }
3964
3965     if (!code_write(self->code, filename, lnofile)) {
3966         vec_free(lnofile);
3967         return false;
3968     }
3969
3970     vec_free(lnofile);
3971     return true;
3972 }
3973
3974 /***********************************************************************
3975  *IR DEBUG Dump functions...
3976  */
3977
3978 #define IND_BUFSZ 1024
3979
3980 static const char *qc_opname(int op)
3981 {
3982     if (op < 0) return "<INVALID>";
3983     if (op < VINSTR_END)
3984         return util_instr_str[op];
3985     switch (op) {
3986         case VINSTR_END:       return "END";
3987         case VINSTR_PHI:       return "PHI";
3988         case VINSTR_JUMP:      return "JUMP";
3989         case VINSTR_COND:      return "COND";
3990         case VINSTR_BITXOR:    return "BITXOR";
3991         case VINSTR_BITAND_V:  return "BITAND_V";
3992         case VINSTR_BITOR_V:   return "BITOR_V";
3993         case VINSTR_BITXOR_V:  return "BITXOR_V";
3994         case VINSTR_BITAND_VF: return "BITAND_VF";
3995         case VINSTR_BITOR_VF:  return "BITOR_VF";
3996         case VINSTR_BITXOR_VF: return "BITXOR_VF";
3997         case VINSTR_CROSS:     return "CROSS";
3998         case VINSTR_NEG_F:     return "NEG_F";
3999         case VINSTR_NEG_V:     return "NEG_V";
4000         default:               return "<UNK>";
4001     }
4002 }
4003
4004 void ir_builder_dump(ir_builder *b, int (*oprintf)(const char*, ...))
4005 {
4006     size_t i;
4007     char indent[IND_BUFSZ];
4008     indent[0] = '\t';
4009     indent[1] = 0;
4010
4011     oprintf("module %s\n", b->name);
4012     for (i = 0; i < vec_size(b->globals); ++i)
4013     {
4014         oprintf("global ");
4015         if (b->globals[i]->hasvalue)
4016             oprintf("%s = ", b->globals[i]->name);
4017         ir_value_dump(b->globals[i], oprintf);
4018         oprintf("\n");
4019     }
4020     for (i = 0; i < vec_size(b->functions); ++i)
4021         ir_function_dump(b->functions[i], indent, oprintf);
4022     oprintf("endmodule %s\n", b->name);
4023 }
4024
4025 static const char *storenames[] = {
4026     "[global]", "[local]", "[param]", "[value]", "[return]"
4027 };
4028
4029 void ir_function_dump(ir_function *f, char *ind,
4030                       int (*oprintf)(const char*, ...))
4031 {
4032     size_t i;
4033     if (f->builtin != 0) {
4034         oprintf("%sfunction %s = builtin %i\n", ind, f->name, -f->builtin);
4035         return;
4036     }
4037     oprintf("%sfunction %s\n", ind, f->name);
4038     util_strncat(ind, "\t", IND_BUFSZ-1);
4039     if (vec_size(f->locals))
4040     {
4041         oprintf("%s%i locals:\n", ind, (int)vec_size(f->locals));
4042         for (i = 0; i < vec_size(f->locals); ++i) {
4043             oprintf("%s\t", ind);
4044             ir_value_dump(f->locals[i], oprintf);
4045             oprintf("\n");
4046         }
4047     }
4048     oprintf("%sliferanges:\n", ind);
4049     for (i = 0; i < vec_size(f->locals); ++i) {
4050         const char *attr = "";
4051         size_t l, m;
4052         ir_value *v = f->locals[i];
4053         if (v->unique_life && v->locked)
4054             attr = "unique,locked ";
4055         else if (v->unique_life)
4056             attr = "unique ";
4057         else if (v->locked)
4058             attr = "locked ";
4059         oprintf("%s\t%s: %s %s %s%s@%i ", ind, v->name, type_name[v->vtype],
4060                 storenames[v->store],
4061                 attr, (v->callparam ? "callparam " : ""),
4062                 (int)v->code.local);
4063         if (!v->life)
4064             oprintf("[null]");
4065         for (l = 0; l < vec_size(v->life); ++l) {
4066             oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
4067         }
4068         oprintf("\n");
4069         for (m = 0; m < 3; ++m) {
4070             ir_value *vm = v->members[m];
4071             if (!vm)
4072                 continue;
4073             oprintf("%s\t%s: @%i ", ind, vm->name, (int)vm->code.local);
4074             for (l = 0; l < vec_size(vm->life); ++l) {
4075                 oprintf("[%i,%i] ", vm->life[l].start, vm->life[l].end);
4076             }
4077             oprintf("\n");
4078         }
4079     }
4080     for (i = 0; i < vec_size(f->values); ++i) {
4081         const char *attr = "";
4082         size_t l, m;
4083         ir_value *v = f->values[i];
4084         if (v->unique_life && v->locked)
4085             attr = "unique,locked ";
4086         else if (v->unique_life)
4087             attr = "unique ";
4088         else if (v->locked)
4089             attr = "locked ";
4090         oprintf("%s\t%s: %s %s %s%s@%i ", ind, v->name, type_name[v->vtype],
4091                 storenames[v->store],
4092                 attr, (v->callparam ? "callparam " : ""),
4093                 (int)v->code.local);
4094         if (!v->life)
4095             oprintf("[null]");
4096         for (l = 0; l < vec_size(v->life); ++l) {
4097             oprintf("[%i,%i] ", v->life[l].start, v->life[l].end);
4098         }
4099         oprintf("\n");
4100         for (m = 0; m < 3; ++m) {
4101             ir_value *vm = v->members[m];
4102             if (!vm)
4103                 continue;
4104             if (vm->unique_life && vm->locked)
4105                 attr = "unique,locked ";
4106             else if (vm->unique_life)
4107                 attr = "unique ";
4108             else if (vm->locked)
4109                 attr = "locked ";
4110             oprintf("%s\t%s: %s@%i ", ind, vm->name, attr, (int)vm->code.local);
4111             for (l = 0; l < vec_size(vm->life); ++l) {
4112                 oprintf("[%i,%i] ", vm->life[l].start, vm->life[l].end);
4113             }
4114             oprintf("\n");
4115         }
4116     }
4117     if (vec_size(f->blocks))
4118     {
4119         oprintf("%slife passes: %i\n", ind, (int)f->run_id);
4120         for (i = 0; i < vec_size(f->blocks); ++i) {
4121             ir_block_dump(f->blocks[i], ind, oprintf);
4122         }
4123
4124     }
4125     ind[strlen(ind)-1] = 0;
4126     oprintf("%sendfunction %s\n", ind, f->name);
4127 }
4128
4129 void ir_block_dump(ir_block* b, char *ind,
4130                    int (*oprintf)(const char*, ...))
4131 {
4132     size_t i;
4133     oprintf("%s:%s\n", ind, b->label);
4134     util_strncat(ind, "\t", IND_BUFSZ-1);
4135
4136     if (b->instr && b->instr[0])
4137         oprintf("%s (%i) [entry]\n", ind, (int)(b->instr[0]->eid-1));
4138     for (i = 0; i < vec_size(b->instr); ++i)
4139         ir_instr_dump(b->instr[i], ind, oprintf);
4140     ind[strlen(ind)-1] = 0;
4141 }
4142
4143 static void dump_phi(ir_instr *in, int (*oprintf)(const char*, ...))
4144 {
4145     size_t i;
4146     oprintf("%s <- phi ", in->_ops[0]->name);
4147     for (i = 0; i < vec_size(in->phi); ++i)
4148     {
4149         oprintf("([%s] : %s) ", in->phi[i].from->label,
4150                                 in->phi[i].value->name);
4151     }
4152     oprintf("\n");
4153 }
4154
4155 void ir_instr_dump(ir_instr *in, char *ind,
4156                        int (*oprintf)(const char*, ...))
4157 {
4158     size_t i;
4159     const char *comma = NULL;
4160
4161     oprintf("%s (%i) ", ind, (int)in->eid);
4162
4163     if (in->opcode == VINSTR_PHI) {
4164         dump_phi(in, oprintf);
4165         return;
4166     }
4167
4168     util_strncat(ind, "\t", IND_BUFSZ-1);
4169
4170     if (in->_ops[0] && (in->_ops[1] || in->_ops[2])) {
4171         ir_value_dump(in->_ops[0], oprintf);
4172         if (in->_ops[1] || in->_ops[2])
4173             oprintf(" <- ");
4174     }
4175     if (in->opcode == INSTR_CALL0 || in->opcode == VINSTR_NRCALL) {
4176         oprintf("CALL%i\t", vec_size(in->params));
4177     } else
4178         oprintf("%s\t", qc_opname(in->opcode));
4179
4180     if (in->_ops[0] && !(in->_ops[1] || in->_ops[2])) {
4181         ir_value_dump(in->_ops[0], oprintf);
4182         comma = ",\t";
4183     }
4184     else
4185     {
4186         for (i = 1; i != 3; ++i) {
4187             if (in->_ops[i]) {
4188                 if (comma)
4189                     oprintf(comma);
4190                 ir_value_dump(in->_ops[i], oprintf);
4191                 comma = ",\t";
4192             }
4193         }
4194     }
4195     if (in->bops[0]) {
4196         if (comma)
4197             oprintf(comma);
4198         oprintf("[%s]", in->bops[0]->label);
4199         comma = ",\t";
4200     }
4201     if (in->bops[1])
4202         oprintf("%s[%s]", comma, in->bops[1]->label);
4203     if (vec_size(in->params)) {
4204         oprintf("\tparams: ");
4205         for (i = 0; i != vec_size(in->params); ++i) {
4206             oprintf("%s, ", in->params[i]->name);
4207         }
4208     }
4209     oprintf("\n");
4210     ind[strlen(ind)-1] = 0;
4211 }
4212
4213 static void ir_value_dump_string(const char *str, int (*oprintf)(const char*, ...))
4214 {
4215     oprintf("\"");
4216     for (; *str; ++str) {
4217         switch (*str) {
4218             case '\n': oprintf("\\n"); break;
4219             case '\r': oprintf("\\r"); break;
4220             case '\t': oprintf("\\t"); break;
4221             case '\v': oprintf("\\v"); break;
4222             case '\f': oprintf("\\f"); break;
4223             case '\b': oprintf("\\b"); break;
4224             case '\a': oprintf("\\a"); break;
4225             case '\\': oprintf("\\\\"); break;
4226             case '"': oprintf("\\\""); break;
4227             default: oprintf("%c", *str); break;
4228         }
4229     }
4230     oprintf("\"");
4231 }
4232
4233 void ir_value_dump(ir_value* v, int (*oprintf)(const char*, ...))
4234 {
4235     if (v->hasvalue) {
4236         switch (v->vtype) {
4237             default:
4238             case TYPE_VOID:
4239                 oprintf("(void)");
4240                 break;
4241             case TYPE_FUNCTION:
4242                 oprintf("fn:%s", v->name);
4243                 break;
4244             case TYPE_FLOAT:
4245                 oprintf("%g", v->constval.vfloat);
4246                 break;
4247             case TYPE_VECTOR:
4248                 oprintf("'%g %g %g'",
4249                         v->constval.vvec.x,
4250                         v->constval.vvec.y,
4251                         v->constval.vvec.z);
4252                 break;
4253             case TYPE_ENTITY:
4254                 oprintf("(entity)");
4255                 break;
4256             case TYPE_STRING:
4257                 ir_value_dump_string(v->constval.vstring, oprintf);
4258                 break;
4259 #if 0
4260             case TYPE_INTEGER:
4261                 oprintf("%i", v->constval.vint);
4262                 break;
4263 #endif
4264             case TYPE_POINTER:
4265                 oprintf("&%s",
4266                     v->constval.vpointer->name);
4267                 break;
4268         }
4269     } else {
4270         oprintf("%s", v->name);
4271     }
4272 }
4273
4274 void ir_value_dump_life(const ir_value *self, int (*oprintf)(const char*,...))
4275 {
4276     size_t i;
4277     oprintf("Life of %12s:", self->name);
4278     for (i = 0; i < vec_size(self->life); ++i)
4279     {
4280         oprintf(" + [%i, %i]\n", self->life[i].start, self->life[i].end);
4281     }
4282 }