ast.c

   1 /*
   2  * Copyright (C) 2012
   3  *     Wolfgang Bumiller
   4  *
   5  * Permission is hereby granted, free of charge, to any person obtaining a copy of
   6  * this software and associated documentation files (the "Software"), to deal in
   7  * the Software without restriction, including without limitation the rights to
   8  * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
   9  * of the Software, and to permit persons to whom the Software is furnished to do
  10  * so, subject to the following conditions:
  11  *
  12  * The above copyright notice and this permission notice shall be included in all
  13  * copies or substantial portions of the Software.
  14  *
  15  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  16  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  17  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  18  * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  19  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  20  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  21  * SOFTWARE.
  22  */
  23 #include <stdio.h>
  24 #include <stdlib.h>
  25 #include <string.h>
  26
  27 #include "gmqcc.h"
  28 #include "ast.h"
  29
  30 #define ast_instantiate(T, ctx, destroyfn)                          \
  31     T* self = (T*)mem_a(sizeof(T));                                 \
  32     if (!self) {                                                    \
  33         return NULL;                                                \
  34     }                                                               \
  35     ast_node_init((ast_node*)self, ctx);                            \
  36     ( (ast_node*)self )->node.destroy = (ast_node_delete*)destroyfn
  37
  38 /* It must not be possible to get here. */
  39 static GMQCC_NORETURN void _ast_node_destroy(ast_node *self)
  40 {
  41     fprintf(stderr, "ast node missing destroy()\n");
  42     abort();
  43 }
  44
  45 /* Initialize main ast node aprts */
  46 static void ast_node_init(ast_node *self, lex_ctx ctx)
  47 {
  48     self->node.context = ctx;
  49     self->node.destroy = &_ast_node_destroy;
  50     self->node.keep    = false;
  51 }
  52
  53 /* General expression initialization */
  54 static void ast_expression_init(ast_expression *self,
  55                                 ast_expression_codegen *codegen)
  56 {
  57     self->expression.codegen = codegen;
  58     self->expression.vtype   = TYPE_VOID;
  59     self->expression.next    = NULL;
  60 }
  61
  62 static void ast_expression_delete(ast_expression *self)
  63 {
  64     if (self->expression.next)
  65         ast_delete(self->expression.next);
  66 }
  67
  68 static void ast_expression_delete_full(ast_expression *self)
  69 {
  70     ast_expression_delete(self);
  71     mem_d(self);
  72 }
  73
  74 static ast_expression* ast_type_copy(lex_ctx ctx, const ast_expression *ex)
  75 {
  76     const ast_expression_common *cpex;
  77     ast_expression_common *selfex;
  78
  79     if (!ex)
  80         return NULL;
  81     else
  82     {
  83         ast_instantiate(ast_expression, ctx, ast_expression_delete_full);
  84
  85         cpex   = &ex->expression;
  86         selfex = &self->expression;
  87
  88         selfex->vtype = cpex->vtype;
  89         if (cpex->next)
  90         {
  91             selfex->next = ast_type_copy(ctx, cpex->next);
  92             if (!selfex->next) {
  93                 mem_d(self);
  94                 return NULL;
  95             }
  96         }
  97         else
  98             selfex->next = NULL;
  99
 100         /* This may never be codegen()d */
 101         selfex->codegen = NULL;
 102         return self;
 103     }
 104 }
 105
 106 ast_value* ast_value_new(lex_ctx ctx, const char *name, int t)
 107 {
 108     ast_instantiate(ast_value, ctx, ast_value_delete);
 109     ast_expression_init((ast_expression*)self,
 110                         (ast_expression_codegen*)&ast_value_codegen);
 111     self->expression.node.keep = true; /* keep */
 112
 113     self->name = name ? util_strdup(name) : NULL;
 114     self->expression.vtype = t;
 115     self->expression.next  = NULL;
 116     MEM_VECTOR_INIT(self, params);
 117     self->isconst = false;
 118     memset(&self->constval, 0, sizeof(self->constval));
 119
 120     self->ir_v    = NULL;
 121
 122     return self;
 123 }
 124 MEM_VEC_FUNCTIONS(ast_value, ast_value*, params)
 125
 126 void ast_value_delete(ast_value* self)
 127 {
 128     size_t i;
 129     if (self->name)
 130         mem_d((void*)self->name);
 131     for (i = 0; i < self->params_count; ++i)
 132         ast_value_delete(self->params[i]); /* delete, the ast_function is expected to die first */
 133     MEM_VECTOR_CLEAR(self, params);
 134     if (self->isconst) {
 135         switch (self->expression.vtype)
 136         {
 137         case TYPE_STRING:
 138             mem_d((void*)self->constval.vstring);
 139             break;
 140         case TYPE_FUNCTION:
 141             /* unlink us from the function node */
 142             self->constval.vfunc->vtype = NULL;
 143             break;
 144         /* NOTE: delete function? currently collected in
 145          * the parser structure
 146          */
 147         default:
 148             break;
 149         }
 150     }
 151     ast_expression_delete((ast_expression*)self);
 152     mem_d(self);
 153 }
 154
 155 bool ast_value_set_name(ast_value *self, const char *name)
 156 {
 157     if (self->name)
 158         mem_d((void*)self->name);
 159     self->name = util_strdup(name);
 160     return !!self->name;
 161 }
 162
 163 ast_binary* ast_binary_new(lex_ctx ctx, int op,
 164                            ast_expression* left, ast_expression* right)
 165 {
 166     ast_instantiate(ast_binary, ctx, ast_binary_delete);
 167     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_binary_codegen);
 168
 169     self->op = op;
 170     self->left = left;
 171     self->right = right;
 172
 173     if (op >= INSTR_EQ_F && op <= INSTR_GT)
 174         self->expression.vtype = TYPE_FLOAT;
 175     else if (op == INSTR_AND || op == INSTR_OR ||
 176              op == INSTR_BITAND || op == INSTR_BITOR)
 177         self->expression.vtype = TYPE_FLOAT;
 178     else if (op == INSTR_MUL_VF || op == INSTR_MUL_FV)
 179         self->expression.vtype = TYPE_VECTOR;
 180     else if (op == INSTR_MUL_V)
 181         self->expression.vtype = TYPE_FLOAT;
 182     else
 183         self->expression.vtype = left->expression.vtype;
 184
 185     return self;
 186 }
 187
 188 void ast_binary_delete(ast_binary *self)
 189 {
 190     ast_unref(self->left);
 191     ast_unref(self->right);
 192     ast_expression_delete((ast_expression*)self);
 193     mem_d(self);
 194 }
 195
 196 ast_entfield* ast_entfield_new(lex_ctx ctx, ast_expression *entity, ast_expression *field)
 197 {
 198     const ast_expression *outtype;
 199
 200     ast_instantiate(ast_entfield, ctx, ast_entfield_delete);
 201
 202     if (field->expression.vtype != TYPE_FIELD) {
 203         mem_d(self);
 204         return NULL;
 205     }
 206
 207     outtype = field->expression.next;
 208     if (!outtype) {
 209         mem_d(self);
 210         /* Error: field has no type... */
 211         return NULL;
 212     }
 213
 214     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_entfield_codegen);
 215
 216     self->expression.vtype = outtype->expression.vtype;
 217     self->expression.next  = ast_type_copy(ctx, outtype->expression.next);
 218
 219     self->entity = entity;
 220     self->field  = field;
 221
 222     return self;
 223 }
 224
 225 void ast_entfield_delete(ast_entfield *self)
 226 {
 227     ast_unref(self->entity);
 228     ast_unref(self->field);
 229     ast_expression_delete((ast_expression*)self);
 230     mem_d(self);
 231 }
 232
 233 ast_ifthen* ast_ifthen_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
 234 {
 235     ast_instantiate(ast_ifthen, ctx, ast_ifthen_delete);
 236     if (!ontrue && !onfalse) {
 237         /* because it is invalid */
 238         mem_d(self);
 239         return NULL;
 240     }
 241     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ifthen_codegen);
 242
 243     self->cond     = cond;
 244     self->on_true  = ontrue;
 245     self->on_false = onfalse;
 246
 247     return self;
 248 }
 249
 250 void ast_ifthen_delete(ast_ifthen *self)
 251 {
 252     ast_unref(self->cond);
 253     if (self->on_true)
 254         ast_unref(self->on_true);
 255     if (self->on_false)
 256         ast_unref(self->on_false);
 257     ast_expression_delete((ast_expression*)self);
 258     mem_d(self);
 259 }
 260
 261 ast_ternary* ast_ternary_new(lex_ctx ctx, ast_expression *cond, ast_expression *ontrue, ast_expression *onfalse)
 262 {
 263     ast_instantiate(ast_ternary, ctx, ast_ternary_delete);
 264     /* This time NEITHER must be NULL */
 265     if (!ontrue || !onfalse) {
 266         mem_d(self);
 267         return NULL;
 268     }
 269     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_ternary_codegen);
 270
 271     self->cond     = cond;
 272     self->on_true  = ontrue;
 273     self->on_false = onfalse;
 274     self->phi_out  = NULL;
 275
 276     return self;
 277 }
 278
 279 void ast_ternary_delete(ast_ternary *self)
 280 {
 281     ast_unref(self->cond);
 282     ast_unref(self->on_true);
 283     ast_unref(self->on_false);
 284     ast_expression_delete((ast_expression*)self);
 285     mem_d(self);
 286 }
 287
 288 ast_loop* ast_loop_new(lex_ctx ctx,
 289                        ast_expression *initexpr,
 290                        ast_expression *precond,
 291                        ast_expression *postcond,
 292                        ast_expression *increment,
 293                        ast_expression *body)
 294 {
 295     ast_instantiate(ast_loop, ctx, ast_loop_delete);
 296     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_loop_codegen);
 297
 298     self->initexpr  = initexpr;
 299     self->precond   = precond;
 300     self->postcond  = postcond;
 301     self->increment = increment;
 302     self->body      = body;
 303
 304     return self;
 305 }
 306
 307 void ast_loop_delete(ast_loop *self)
 308 {
 309     if (self->initexpr)
 310         ast_unref(self->initexpr);
 311     if (self->precond)
 312         ast_unref(self->precond);
 313     if (self->postcond)
 314         ast_unref(self->postcond);
 315     if (self->increment)
 316         ast_unref(self->increment);
 317     if (self->body)
 318         ast_unref(self->body);
 319     ast_expression_delete((ast_expression*)self);
 320     mem_d(self);
 321 }
 322
 323 ast_call* ast_call_new(lex_ctx ctx,
 324                        ast_expression *funcexpr)
 325 {
 326     ast_instantiate(ast_call, ctx, ast_call_delete);
 327     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_call_codegen);
 328
 329     MEM_VECTOR_INIT(self, params);
 330
 331     self->func = funcexpr;
 332
 333     return self;
 334 }
 335 MEM_VEC_FUNCTIONS(ast_call, ast_expression*, params)
 336
 337 void ast_call_delete(ast_call *self)
 338 {
 339     size_t i;
 340     for (i = 0; i < self->params_count; ++i)
 341         ast_unref(self->params[i]);
 342     MEM_VECTOR_CLEAR(self, params);
 343
 344     if (self->func)
 345         ast_unref(self->func);
 346
 347     ast_expression_delete((ast_expression*)self);
 348     mem_d(self);
 349 }
 350
 351 ast_store* ast_store_new(lex_ctx ctx, int op,
 352                          ast_value *dest, ast_expression *source)
 353 {
 354     ast_instantiate(ast_store, ctx, ast_store_delete);
 355     ast_expression_init((ast_expression*)self, (ast_expression_codegen*)&ast_store_codegen);
 356
 357     self->op = op;
 358     self->dest = dest;
 359     self->source = source;
 360
 361     return self;
 362 }
 363
 364 void ast_store_delete(ast_store *self)
 365 {
 366     ast_unref(self->dest);
 367     ast_unref(self->source);
 368     ast_expression_delete((ast_expression*)self);
 369     mem_d(self);
 370 }
 371
 372 ast_block* ast_block_new(lex_ctx ctx)
 373 {
 374     ast_instantiate(ast_block, ctx, ast_block_delete);
 375     ast_expression_init((ast_expression*)self,
 376                         (ast_expression_codegen*)&ast_block_codegen);
 377
 378     MEM_VECTOR_INIT(self, locals);
 379     MEM_VECTOR_INIT(self, exprs);
 380
 381     return self;
 382 }
 383 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
 384 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
 385
 386 void ast_block_delete(ast_block *self)
 387 {
 388     size_t i;
 389     for (i = 0; i < self->exprs_count; ++i)
 390         ast_unref(self->exprs[i]);
 391     MEM_VECTOR_CLEAR(self, exprs);
 392     for (i = 0; i < self->locals_count; ++i)
 393         ast_delete(self->locals[i]);
 394     MEM_VECTOR_CLEAR(self, locals);
 395     ast_expression_delete((ast_expression*)self);
 396     mem_d(self);
 397 }
 398
 399 ast_function* ast_function_new(lex_ctx ctx, const char *name, ast_value *vtype)
 400 {
 401     ast_instantiate(ast_function, ctx, ast_function_delete);
 402
 403     if (!vtype ||
 404         vtype->isconst ||
 405         vtype->expression.vtype != TYPE_FUNCTION)
 406     {
 407         mem_d(self);
 408         return NULL;
 409     }
 410
 411     self->vtype = vtype;
 412     self->name = name ? util_strdup(name) : NULL;
 413     MEM_VECTOR_INIT(self, blocks);
 414
 415     self->labelcount = 0;
 416     self->builtin = 0;
 417
 418     self->ir_func = NULL;
 419     self->curblock = NULL;
 420
 421     self->breakblock    = NULL;
 422     self->continueblock = NULL;
 423
 424     vtype->isconst = true;
 425     vtype->constval.vfunc = self;
 426
 427     return self;
 428 }
 429
 430 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
 431
 432 void ast_function_delete(ast_function *self)
 433 {
 434     size_t i;
 435     if (self->name)
 436         mem_d((void*)self->name);
 437     if (self->vtype) {
 438         /* ast_value_delete(self->vtype); */
 439         self->vtype->isconst = false;
 440         self->vtype->constval.vfunc = NULL;
 441         /* We use unref - if it was stored in a global table it is supposed
 442          * to be deleted from *there*
 443          */
 444         ast_unref(self->vtype);
 445     }
 446     for (i = 0; i < self->blocks_count; ++i)
 447         ast_delete(self->blocks[i]);
 448     MEM_VECTOR_CLEAR(self, blocks);
 449     mem_d(self);
 450 }
 451
 452 static void ast_util_hexitoa(char *buf, size_t size, unsigned int num)
 453 {
 454     unsigned int base = 10;
 455 #define checknul() do { if (size == 1) { *buf = 0; return; } } while (0)
 456 #define addch(x) do { *buf++ = (x); --size; checknul(); } while (0)
 457     if (size < 1)
 458         return;
 459     checknul();
 460     if (!num)
 461         addch('0');
 462     else {
 463         while (num)
 464         {
 465             int digit = num % base;
 466             num /= base;
 467             addch('0' + digit);
 468         }
 469     }
 470
 471     *buf = 0;
 472 #undef addch
 473 #undef checknul
 474 }
 475
 476 const char* ast_function_label(ast_function *self, const char *prefix)
 477 {
 478     size_t id = (self->labelcount++);
 479     size_t len = strlen(prefix);
 480     strncpy(self->labelbuf, prefix, sizeof(self->labelbuf));
 481     ast_util_hexitoa(self->labelbuf + len, sizeof(self->labelbuf)-len, id);
 482     return self->labelbuf;
 483 }
 484
 485 /*********************************************************************/
 486 /* AST codegen part
 487  * by convention you must never pass NULL to the 'ir_value **out'
 488  * parameter. If you really don't care about the output, pass a dummy.
 489  * But I can't imagine a pituation where the output is truly unnecessary.
 490  */
 491
 492 bool ast_value_codegen(ast_value *self, ast_function *func, bool lvalue, ir_value **out)
 493 {
 494     /* NOTE: This is the codegen for a variable used in an expression.
 495      * It is not the codegen to generate the value. For this purpose,
 496      * ast_local_codegen and ast_global_codegen are to be used before this
 497      * is executed. ast_function_codegen should take care of its locals,
 498      * and the ast-user should take care of ast_global_codegen to be used
 499      * on all the globals.
 500      */
 501     if (!self->ir_v) {
 502         printf("ast_value used before generated (%s)\n", self->name);
 503         return false;
 504     }
 505     *out = self->ir_v;
 506     return true;
 507 }
 508
 509 bool ast_global_codegen(ast_value *self, ir_builder *ir)
 510 {
 511     ir_value *v = NULL;
 512     if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
 513     {
 514         ir_function *func = ir_builder_create_function(ir, self->name, self->expression.next->expression.vtype);
 515         if (!func)
 516             return false;
 517
 518         self->constval.vfunc->ir_func = func;
 519         self->ir_v = func->value;
 520         /* The function is filled later on ast_function_codegen... */
 521         return true;
 522     }
 523
 524     v = ir_builder_create_global(ir, self->name, self->expression.vtype);
 525     if (!v) {
 526         printf("ir_builder_create_global failed\n");
 527         return false;
 528     }
 529
 530     if (self->isconst) {
 531         switch (self->expression.vtype)
 532         {
 533             case TYPE_FLOAT:
 534                 if (!ir_value_set_float(v, self->constval.vfloat))
 535                     goto error;
 536                 break;
 537             case TYPE_VECTOR:
 538                 if (!ir_value_set_vector(v, self->constval.vvec))
 539                     goto error;
 540                 break;
 541             case TYPE_STRING:
 542                 if (!ir_value_set_string(v, self->constval.vstring))
 543                     goto error;
 544                 break;
 545             case TYPE_FUNCTION:
 546                 printf("global of type function not properly generated\n");
 547                 goto error;
 548                 /* Cannot generate an IR value for a function,
 549                  * need a pointer pointing to a function rather.
 550                  */
 551             default:
 552                 printf("TODO: global constant type %i\n", self->expression.vtype);
 553                 break;
 554         }
 555     }
 556
 557     /* link us to the ir_value */
 558     self->ir_v = v;
 559     return true;
 560
 561 error: /* clean up */
 562     ir_value_delete(v);
 563     return false;
 564 }
 565
 566 bool ast_local_codegen(ast_value *self, ir_function *func, bool param)
 567 {
 568     ir_value *v = NULL;
 569     if (self->isconst && self->expression.vtype == TYPE_FUNCTION)
 570     {
 571         /* Do we allow local functions? I think not...
 572          * this is NOT a function pointer atm.
 573          */
 574         return false;
 575     }
 576
 577     v = ir_function_create_local(func, self->name, self->expression.vtype, param);
 578     if (!v)
 579         return false;
 580
 581     /* A constant local... hmmm...
 582      * I suppose the IR will have to deal with this
 583      */
 584     if (self->isconst) {
 585         switch (self->expression.vtype)
 586         {
 587             case TYPE_FLOAT:
 588                 if (!ir_value_set_float(v, self->constval.vfloat))
 589                     goto error;
 590                 break;
 591             case TYPE_VECTOR:
 592                 if (!ir_value_set_vector(v, self->constval.vvec))
 593                     goto error;
 594                 break;
 595             case TYPE_STRING:
 596                 if (!ir_value_set_string(v, self->constval.vstring))
 597                     goto error;
 598                 break;
 599             default:
 600                 printf("TODO: global constant type %i\n", self->expression.vtype);
 601                 break;
 602         }
 603     }
 604
 605     /* link us to the ir_value */
 606     self->ir_v = v;
 607     return true;
 608
 609 error: /* clean up */
 610     ir_value_delete(v);
 611     return false;
 612 }
 613
 614 bool ast_function_codegen(ast_function *self, ir_builder *ir)
 615 {
 616     ir_function *irf;
 617     ir_value    *dummy;
 618     size_t    i;
 619
 620     irf = self->ir_func;
 621     if (!irf) {
 622         printf("ast_function's related ast_value was not generated yet\n");
 623         return false;
 624     }
 625
 626     /* fill the parameter list */
 627     for (i = 0; i < self->vtype->params_count; ++i)
 628     {
 629         if (!ir_function_params_add(irf, self->vtype->params[i]->expression.vtype))
 630             return false;
 631         if (!self->builtin) {
 632             if (!ast_local_codegen(self->vtype->params[i], self->ir_func, true))
 633                 return false;
 634         }
 635     }
 636
 637     if (self->builtin) {
 638         irf->builtin = self->builtin;
 639         return true;
 640     }
 641
 642     self->curblock = ir_function_create_block(irf, "entry");
 643     if (!self->curblock)
 644         return false;
 645
 646     for (i = 0; i < self->blocks_count; ++i) {
 647         ast_expression_codegen *gen = self->blocks[i]->expression.codegen;
 648         if (!(*gen)((ast_expression*)self->blocks[i], self, false, &dummy))
 649             return false;
 650     }
 651
 652     /* TODO: check return types */
 653     if (!self->curblock->is_return)
 654     {
 655         if (!self->vtype->expression.next ||
 656             self->vtype->expression.next->expression.vtype == TYPE_VOID)
 657         {
 658             return ir_block_create_return(self->curblock, NULL);
 659         }
 660         else
 661         {
 662             /* error("missing return"); */
 663             return false;
 664         }
 665     }
 666     return true;
 667 }
 668
 669 /* Note, you will not see ast_block_codegen generate ir_blocks.
 670  * To the AST and the IR, blocks are 2 different things.
 671  * In the AST it represents a block of code, usually enclosed in
 672  * curly braces {...}.
 673  * While in the IR it represents a block in terms of control-flow.
 674  */
 675 bool ast_block_codegen(ast_block *self, ast_function *func, bool lvalue, ir_value **out)
 676 {
 677     size_t i;
 678
 679     /* We don't use this
 680      * Note: an ast-representation using the comma-operator
 681      * of the form: (a, b, c) = x should not assign to c...
 682      */
 683     (void)lvalue;
 684
 685     /* output is NULL at first, we'll have each expression
 686      * assign to out output, thus, a comma-operator represention
 687      * using an ast_block will return the last generated value,
 688      * so: (b, c) + a  executed both b and c, and returns c,
 689      * which is then added to a.
 690      */
 691     *out = NULL;
 692
 693     /* generate locals */
 694     for (i = 0; i < self->locals_count; ++i)
 695     {
 696         if (!ast_local_codegen(self->locals[i], func->ir_func, false))
 697             return false;
 698     }
 699
 700     for (i = 0; i < self->exprs_count; ++i)
 701     {
 702         ast_expression_codegen *gen = self->exprs[i]->expression.codegen;
 703         if (!(*gen)(self->exprs[i], func, false, out))
 704             return false;
 705     }
 706
 707     return true;
 708 }
 709
 710 bool ast_store_codegen(ast_store *self, ast_function *func, bool lvalue, ir_value **out)
 711 {
 712     ast_expression_codegen *cgen;
 713     ir_value *left, *right;
 714
 715     cgen = self->dest->expression.codegen;
 716     /* lvalue! */
 717     if (!(*cgen)((ast_expression*)(self->dest), func, true, &left))
 718         return false;
 719
 720     cgen = self->source->expression.codegen;
 721     /* rvalue! */
 722     if (!(*cgen)((ast_expression*)(self->source), func, false, &right))
 723         return false;
 724
 725     if (!ir_block_create_store_op(func->curblock, self->op, left, right))
 726         return false;
 727
 728     /* Theoretically, an assinment returns its left side as an
 729      * lvalue, if we don't need an lvalue though, we return
 730      * the right side as an rvalue, otherwise we have to
 731      * somehow know whether or not we need to dereference the pointer
 732      * on the left side - that is: OP_LOAD if it was an address.
 733      * Also: in original QC we cannot OP_LOADP *anyway*.
 734      */
 735     *out = (lvalue ? left : right);
 736
 737     return true;
 738 }
 739
 740 bool ast_binary_codegen(ast_binary *self, ast_function *func, bool lvalue, ir_value **out)
 741 {
 742     ast_expression_codegen *cgen;
 743     ir_value *left, *right;
 744
 745     /* In the context of a binary operation, we can disregard
 746      * the lvalue flag.
 747      */
 748      (void)lvalue;
 749
 750     cgen = self->left->expression.codegen;
 751     /* lvalue! */
 752     if (!(*cgen)((ast_expression*)(self->left), func, false, &left))
 753         return false;
 754
 755     cgen = self->right->expression.codegen;
 756     /* rvalue! */
 757     if (!(*cgen)((ast_expression*)(self->right), func, false, &right))
 758         return false;
 759
 760     *out = ir_block_create_binop(func->curblock, ast_function_label(func, "bin"),
 761                                  self->op, left, right);
 762     if (!*out)
 763         return false;
 764
 765     return true;
 766 }
 767
 768 bool ast_entfield_codegen(ast_entfield *self, ast_function *func, bool lvalue, ir_value **out)
 769 {
 770     ast_expression_codegen *cgen;
 771     ir_value *ent, *field;
 772
 773     /* This function needs to take the 'lvalue' flag into account!
 774      * As lvalue we provide a field-pointer, as rvalue we provide the
 775      * value in a temp.
 776      */
 777
 778     cgen = self->entity->expression.codegen;
 779     if (!(*cgen)((ast_expression*)(self->entity), func, false, &ent))
 780         return false;
 781
 782     cgen = self->field->expression.codegen;
 783     if (!(*cgen)((ast_expression*)(self->field), func, false, &field))
 784         return false;
 785
 786     if (lvalue) {
 787         /* address! */
 788         *out = ir_block_create_fieldaddress(func->curblock, ast_function_label(func, "efa"),
 789                                             ent, field);
 790     } else {
 791         *out = ir_block_create_load_from_ent(func->curblock, ast_function_label(func, "efv"),
 792                                              ent, field, self->expression.vtype);
 793     }
 794     if (!*out)
 795         return false;
 796
 797     /* Hm that should be it... */
 798     return true;
 799 }
 800
 801 bool ast_ifthen_codegen(ast_ifthen *self, ast_function *func, bool lvalue, ir_value **out)
 802 {
 803     ast_expression_codegen *cgen;
 804
 805     ir_value *condval;
 806     ir_value *dummy;
 807
 808     ir_block *cond = func->curblock;
 809     ir_block *ontrue;
 810     ir_block *onfalse;
 811     ir_block *merge;
 812
 813     /* We don't output any value, thus also don't care about r/lvalue */
 814     (void)out;
 815     (void)lvalue;
 816
 817     /* generate the condition */
 818     func->curblock = cond;
 819     cgen = self->cond->expression.codegen;
 820     if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
 821         return false;
 822
 823     /* on-true path */
 824
 825     if (self->on_true) {
 826         /* create on-true block */
 827         ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "ontrue"));
 828         if (!ontrue)
 829             return false;
 830
 831         /* enter the block */
 832         func->curblock = ontrue;
 833
 834         /* generate */
 835         cgen = self->on_true->expression.codegen;
 836         if (!(*cgen)((ast_expression*)(self->on_true), func, false, &dummy))
 837             return false;
 838     } else
 839         ontrue = NULL;
 840
 841     /* on-false path */
 842     if (self->on_false) {
 843         /* create on-false block */
 844         onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "onfalse"));
 845         if (!onfalse)
 846             return false;
 847
 848         /* enter the block */
 849         func->curblock = onfalse;
 850
 851         /* generate */
 852         cgen = self->on_false->expression.codegen;
 853         if (!(*cgen)((ast_expression*)(self->on_false), func, false, &dummy))
 854             return false;
 855     } else
 856         onfalse = NULL;
 857
 858     /* Merge block were they all merge in to */
 859     merge = ir_function_create_block(func->ir_func, ast_function_label(func, "endif"));
 860     if (!merge)
 861         return false;
 862
 863     /* add jumps ot the merge block */
 864     if (ontrue && !ir_block_create_jump(ontrue, merge))
 865         return false;
 866     if (onfalse && !ir_block_create_jump(onfalse, merge))
 867         return false;
 868
 869     /* we create the if here, that way all blocks are ordered :)
 870      */
 871     if (!ir_block_create_if(cond, condval,
 872                             (ontrue  ? ontrue  : merge),
 873                             (onfalse ? onfalse : merge)))
 874     {
 875         return false;
 876     }
 877
 878     /* Now enter the merge block */
 879     func->curblock = merge;
 880
 881     return true;
 882 }
 883
 884 bool ast_ternary_codegen(ast_ternary *self, ast_function *func, bool lvalue, ir_value **out)
 885 {
 886     ast_expression_codegen *cgen;
 887
 888     ir_value *condval;
 889     ir_value *trueval, *falseval;
 890     ir_instr *phi;
 891
 892     ir_block *cond = func->curblock;
 893     ir_block *ontrue;
 894     ir_block *onfalse;
 895     ir_block *merge;
 896
 897     /* In theory it shouldn't be possible to pass through a node twice, but
 898      * in case we add any kind of optimization pass for the AST itself, it
 899      * may still happen, thus we remember a created ir_value and simply return one
 900      * if it already exists.
 901      */
 902     if (self->phi_out) {
 903         *out = self->phi_out;
 904         return true;
 905     }
 906
 907     /* Ternary can never create an lvalue... */
 908     if (lvalue)
 909         return false;
 910
 911     /* In the following, contraty to ast_ifthen, we assume both paths exist. */
 912
 913     /* generate the condition */
 914     func->curblock = cond;
 915     cgen = self->cond->expression.codegen;
 916     if (!(*cgen)((ast_expression*)(self->cond), func, false, &condval))
 917         return false;
 918
 919     /* create on-true block */
 920     ontrue = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_T"));
 921     if (!ontrue)
 922         return false;
 923     else
 924     {
 925         /* enter the block */
 926         func->curblock = ontrue;
 927
 928         /* generate */
 929         cgen = self->on_true->expression.codegen;
 930         if (!(*cgen)((ast_expression*)(self->on_true), func, false, &trueval))
 931             return false;
 932     }
 933
 934     /* create on-false block */
 935     onfalse = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_F"));
 936     if (!onfalse)
 937         return false;
 938     else
 939     {
 940         /* enter the block */
 941         func->curblock = onfalse;
 942
 943         /* generate */
 944         cgen = self->on_false->expression.codegen;
 945         if (!(*cgen)((ast_expression*)(self->on_false), func, false, &falseval))
 946             return false;
 947     }
 948
 949     /* create merge block */
 950     merge = ir_function_create_block(func->ir_func, ast_function_label(func, "tern_out"));
 951     if (!merge)
 952         return false;
 953     /* jump to merge block */
 954     if (!ir_block_create_jump(ontrue, merge))
 955         return false;
 956     if (!ir_block_create_jump(onfalse, merge))
 957         return false;
 958
 959     /* create if instruction */
 960     if (!ir_block_create_if(cond, condval, ontrue, onfalse))
 961         return false;
 962
 963     /* Now enter the merge block */
 964     func->curblock = merge;
 965
 966     /* Here, now, we need a PHI node
 967      * but first some sanity checking...
 968      */
 969     if (trueval->vtype != falseval->vtype) {
 970         /* error("ternary with different types on the two sides"); */
 971         return false;
 972     }
 973
 974     /* create PHI */
 975     phi = ir_block_create_phi(merge, ast_function_label(func, "phi"), trueval->vtype);
 976     if (!phi ||
 977         !ir_phi_add(phi, ontrue,  trueval) ||
 978         !ir_phi_add(phi, onfalse, falseval))
 979     {
 980         return false;
 981     }
 982
 983     self->phi_out = ir_phi_value(phi);
 984     *out = self->phi_out;
 985
 986     return true;
 987 }
 988
 989 bool ast_loop_codegen(ast_loop *self, ast_function *func, bool lvalue, ir_value **out)
 990 {
 991     ast_expression_codegen *cgen;
 992
 993     ir_value *dummy      = NULL;
 994     ir_value *precond    = NULL;
 995     ir_value *postcond   = NULL;
 996
 997     /* Since we insert some jumps "late" so we have blocks
 998      * ordered "nicely", we need to keep track of the actual end-blocks
 999      * of expressions to add the jumps to.
1000      */
1001     ir_block *bbody      = NULL, *end_bbody      = NULL;
1002     ir_block *bprecond   = NULL, *end_bprecond   = NULL;
1003     ir_block *bpostcond  = NULL, *end_bpostcond  = NULL;
1004     ir_block *bincrement = NULL, *end_bincrement = NULL;
1005     ir_block *bout       = NULL, *bin            = NULL;
1006
1007     /* let's at least move the outgoing block to the end */
1008     size_t    bout_id;
1009
1010     /* 'break' and 'continue' need to be able to find the right blocks */
1011     ir_block *bcontinue     = NULL;
1012     ir_block *bbreak        = NULL;
1013
1014     ir_block *old_bcontinue = NULL;
1015     ir_block *old_bbreak    = NULL;
1016
1017     ir_block *tmpblock      = NULL;
1018
1019     (void)lvalue;
1020     (void)out;
1021
1022     /* NOTE:
1023      * Should we ever need some kind of block ordering, better make this function
1024      * move blocks around than write a block ordering algorithm later... after all
1025      * the ast and ir should work together, not against each other.
1026      */
1027
1028     /* initexpr doesn't get its own block, it's pointless, it could create more blocks
1029      * anyway if for example it contains a ternary.
1030      */
1031     if (self->initexpr)
1032     {
1033         cgen = self->initexpr->expression.codegen;
1034         if (!(*cgen)((ast_expression*)(self->initexpr), func, false, &dummy))
1035             return false;
1036     }
1037
1038     /* Store the block from which we enter this chaos */
1039     bin = func->curblock;
1040
1041     /* The pre-loop condition needs its own block since we
1042      * need to be able to jump to the start of that expression.
1043      */
1044     if (self->precond)
1045     {
1046         bprecond = ir_function_create_block(func->ir_func, ast_function_label(func, "pre_loop_cond"));
1047         if (!bprecond)
1048             return false;
1049
1050         /* the pre-loop-condition the least important place to 'continue' at */
1051         bcontinue = bprecond;
1052
1053         /* enter */
1054         func->curblock = bprecond;
1055
1056         /* generate */
1057         cgen = self->precond->expression.codegen;
1058         if (!(*cgen)((ast_expression*)(self->precond), func, false, &precond))
1059             return false;
1060
1061         end_bprecond = func->curblock;
1062     } else {
1063         bprecond = end_bprecond = NULL;
1064     }
1065
1066     /* Now the next blocks won't be ordered nicely, but we need to
1067      * generate them this early for 'break' and 'continue'.
1068      */
1069     if (self->increment) {
1070         bincrement = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_increment"));
1071         if (!bincrement)
1072             return false;
1073         bcontinue = bincrement; /* increment comes before the pre-loop-condition */
1074     } else {
1075         bincrement = end_bincrement = NULL;
1076     }
1077
1078     if (self->postcond) {
1079         bpostcond = ir_function_create_block(func->ir_func, ast_function_label(func, "post_loop_cond"));
1080         if (!bpostcond)
1081             return false;
1082         bcontinue = bpostcond; /* postcond comes before the increment */
1083     } else {
1084         bpostcond = end_bpostcond = NULL;
1085     }
1086
1087     bout_id = func->ir_func->blocks_count;
1088     bout = ir_function_create_block(func->ir_func, ast_function_label(func, "after_loop"));
1089     if (!bout)
1090         return false;
1091     bbreak = bout;
1092
1093     /* The loop body... */
1094     if (self->body)
1095     {
1096         bbody = ir_function_create_block(func->ir_func, ast_function_label(func, "loop_body"));
1097         if (!bbody)
1098             return false;
1099
1100         /* enter */
1101         func->curblock = bbody;
1102
1103         old_bbreak          = func->breakblock;
1104         old_bcontinue       = func->continueblock;
1105         func->breakblock    = bbreak;
1106         func->continueblock = bcontinue;
1107
1108         /* generate */
1109         cgen = self->body->expression.codegen;
1110         if (!(*cgen)((ast_expression*)(self->body), func, false, &dummy))
1111             return false;
1112
1113         end_bbody = func->curblock;
1114         func->breakblock    = old_bbreak;
1115         func->continueblock = old_bcontinue;
1116     }
1117
1118     /* post-loop-condition */
1119     if (self->postcond)
1120     {
1121         /* enter */
1122         func->curblock = bpostcond;
1123
1124         /* generate */
1125         cgen = self->postcond->expression.codegen;
1126         if (!(*cgen)((ast_expression*)(self->postcond), func, false, &postcond))
1127             return false;
1128
1129         end_bpostcond = func->curblock;
1130     }
1131
1132     /* The incrementor */
1133     if (self->increment)
1134     {
1135         /* enter */
1136         func->curblock = bincrement;
1137
1138         /* generate */
1139         cgen = self->increment->expression.codegen;
1140         if (!(*cgen)((ast_expression*)(self->increment), func, false, &dummy))
1141             return false;
1142
1143         end_bincrement = func->curblock;
1144     }
1145
1146     /* In any case now, we continue from the outgoing block */
1147     func->curblock = bout;
1148
1149     /* Now all blocks are in place */
1150     /* From 'bin' we jump to whatever comes first */
1151     if      (bprecond)   tmpblock = bprecond;
1152     else if (bbody)      tmpblock = bbody;
1153     else if (bpostcond)  tmpblock = bpostcond;
1154     else                 tmpblock = bout;
1155     if (!ir_block_create_jump(bin, tmpblock))
1156         return false;
1157
1158     /* From precond */
1159     if (bprecond)
1160     {
1161         ir_block *ontrue, *onfalse;
1162         if      (bbody)      ontrue = bbody;
1163         else if (bincrement) ontrue = bincrement;
1164         else if (bpostcond)  ontrue = bpostcond;
1165         else                 ontrue = bprecond;
1166         onfalse = bout;
1167         if (!ir_block_create_if(end_bprecond, precond, ontrue, onfalse))
1168             return false;
1169     }
1170
1171     /* from body */
1172     if (bbody)
1173     {
1174         if      (bincrement) tmpblock = bincrement;
1175         else if (bpostcond)  tmpblock = bpostcond;
1176         else if (bprecond)   tmpblock = bprecond;
1177         else                 tmpblock = bout;
1178         if (!ir_block_create_jump(end_bbody, tmpblock))
1179             return false;
1180     }
1181
1182     /* from increment */
1183     if (bincrement)
1184     {
1185         if      (bpostcond)  tmpblock = bpostcond;
1186         else if (bprecond)   tmpblock = bprecond;
1187         else if (bbody)      tmpblock = bbody;
1188         else                 tmpblock = bout;
1189         if (!ir_block_create_jump(end_bincrement, tmpblock))
1190             return false;
1191     }
1192
1193     /* from postcond */
1194     if (bpostcond)
1195     {
1196         ir_block *ontrue, *onfalse;
1197         if      (bprecond)   ontrue = bprecond;
1198         else if (bbody)      ontrue = bbody;
1199         else if (bincrement) ontrue = bincrement;
1200         else                 ontrue = bpostcond;
1201         onfalse = bout;
1202         if (!ir_block_create_if(end_bpostcond, postcond, ontrue, onfalse))
1203             return false;
1204     }
1205
1206     /* Move 'bout' to the end */
1207     if (!ir_function_blocks_remove(func->ir_func, bout_id) ||
1208         !ir_function_blocks_add(func->ir_func, bout))
1209     {
1210         ir_block_delete(bout);
1211         return false;
1212     }
1213
1214     return true;
1215 }
1216
1217 bool ast_call_codegen(ast_call *self, ast_function *func, bool lvalue, ir_value **out)
1218 {
1219     ast_expression_codegen *cgen;
1220     ir_value_vector         params;
1221     ir_instr               *callinstr;
1222     size_t i;
1223
1224     ir_value *funval = NULL;
1225
1226     /* return values are never rvalues */
1227     (void)lvalue;
1228
1229     cgen = self->func->expression.codegen;
1230     if (!(*cgen)((ast_expression*)(self->func), func, false, &funval))
1231         return false;
1232     if (!funval)
1233         return false;
1234
1235     MEM_VECTOR_INIT(&params, v);
1236
1237     /* parameters */
1238     for (i = 0; i < self->params_count; ++i)
1239     {
1240         ir_value *param;
1241         ast_expression *expr = self->params[i];
1242
1243         cgen = expr->expression.codegen;
1244         if (!(*cgen)(expr, func, false, &param))
1245             goto error;
1246         if (!param)
1247             goto error;
1248         if (!ir_value_vector_v_add(&params, param))
1249             goto error;
1250     }
1251
1252     callinstr = ir_block_create_call(func->curblock, ast_function_label(func, "call"), funval);
1253     if (!callinstr)
1254         goto error;
1255
1256     for (i = 0; i < params.v_count; ++i) {
1257         if (!ir_call_param(callinstr, params.v[i]))
1258             goto error;
1259     }
1260
1261     *out = ir_call_value(callinstr);
1262
1263     return true;
1264 error:
1265     MEM_VECTOR_CLEAR(&params, v);
1266     return false;
1267 }