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_setfunc(me, fn, what) ( *(void**)&((me)->fn) = what )
  31
  32 #define ast_instantiate(T, ctx, destroyfn)                    \
  33     T *self = (T*)mem_a(sizeof(T));                           \
  34     ast_node_init((ast_node*)self, ctx);                      \
  35     ast_setfunc(&((ast_node*)self)->node, destroy, destroyfn)
  36
  37 /* It must not be possible to get here. */
  38 static void _ast_node_destroy(ast_node *self)
  39 {
  40     fprintf(stderr, "ast node missing destroy()\n");
  41     abort();
  42 }
  43
  44 /* Initialize main ast node aprts */
  45 static void ast_node_init(ast_node *self, lex_ctx_t ctx)
  46 {
  47     self->node.context = ctx;
  48     self->node.destroy = &_ast_node_destroy;
  49 }
  50
  51 /* General expression initialization */
  52 static void ast_expression_init(ast_expression *self,
  53                                 ast_expression_codegen *codegen)
  54 {
  55     ast_setfunc(&self->expression, codegen, codegen);
  56 }
  57
  58 ast_value* ast_value_new(lex_ctx_t ctx, const char *name, int t)
  59 {
  60     ast_instantiate(ast_value, ctx, ast_value_delete);
  61     ast_expression_init((ast_expression*)self,
  62                         (ast_expression_codegen*)&ast_value_codegen);
  63
  64     self->name = name ? util_strdup(name) : NULL;
  65     self->vtype = t;
  66     self->next = NULL;
  67     MEM_VECTOR_INIT(self, params);
  68     self->isconst = false;
  69     memset(&self->constval, 0, sizeof(self->constval));
  70
  71     self->ir_v = NULL;
  72
  73     return self;
  74 }
  75 MEM_VEC_FUNCTIONS(ast_value, ast_value*, params)
  76
  77 void ast_value_delete(ast_value* self)
  78 {
  79     size_t i;
  80     if (self->name)
  81         mem_d((void*)self->name);
  82     for (i = 0; i < self->params_count; ++i)
  83         ast_delete(self->params[i]);
  84     MEM_VECTOR_CLEAR(self, params);
  85     if (self->next)
  86         ast_delete(self->next);
  87     if (self->isconst) {
  88         switch (self->vtype)
  89         {
  90         case qc_string:
  91             mem_d((void*)self->constval.vstring);
  92             break;
  93         /* NOTE: delete function? currently collected in
  94          * the parser structure
  95          */
  96         default:
  97             break;
  98         }
  99     }
 100     mem_d(self);
 101 }
 102
 103 void ast_value_set_name(ast_value *self, const char *name)
 104 {
 105     if (self->name)
 106         mem_d((void*)self->name);
 107     self->name = util_strdup(name);
 108 }
 109
 110 ast_binary* ast_binary_new(lex_ctx_t ctx, int op,
 111                            ast_value* left, ast_value* right)
 112 {
 113     ast_instantiate(ast_binary, ctx, ast_binary_delete);
 114     ast_expression_init((ast_expression*)self, NULL); /* FIXME */
 115
 116     self->op = op;
 117     self->left = left;
 118     self->right = right;
 119
 120     return self;
 121 }
 122
 123 void ast_binary_delete(ast_binary *self)
 124 {
 125     mem_d(self);
 126 }
 127
 128 ast_block* ast_block_new(lex_ctx_t ctx)
 129 {
 130     ast_instantiate(ast_block, ctx, ast_block_delete);
 131     ast_expression_init((ast_expression*)self,
 132                         (ast_expression_codegen*)&ast_block_codegen);
 133
 134     MEM_VECTOR_INIT(self, locals);
 135     MEM_VECTOR_INIT(self, exprs);
 136
 137     return self;
 138 }
 139 MEM_VEC_FUNCTIONS(ast_block, ast_value*, locals)
 140 MEM_VEC_FUNCTIONS(ast_block, ast_expression*, exprs)
 141
 142 void ast_block_delete(ast_block *self)
 143 {
 144     size_t i;
 145     for (i = 0; i < self->locals_count; ++i)
 146         ast_delete(self->locals[i]);
 147     MEM_VECTOR_CLEAR(self, locals);
 148     for (i = 0; i < self->exprs_count; ++i)
 149         ast_delete(self->exprs[i]);
 150     MEM_VECTOR_CLEAR(self, exprs);
 151     mem_d(self);
 152 }
 153
 154 ast_function* ast_function_new(lex_ctx_t ctx, const char *name, ast_value *vtype)
 155 {
 156     ast_instantiate(ast_function, ctx, ast_function_delete);
 157
 158     self->vtype = vtype;
 159     self->name = name ? util_strdup(name) : NULL;
 160     MEM_VECTOR_INIT(self, blocks);
 161
 162     return self;
 163 }
 164
 165 MEM_VEC_FUNCTIONS(ast_function, ast_block*, blocks)
 166
 167 void ast_function_delete(ast_function *self)
 168 {
 169     size_t i;
 170     if (self->name)
 171         mem_d((void*)self->name);
 172     if (self->vtype)
 173         ast_value_delete(self->vtype);
 174     for (i = 0; i < self->blocks_count; ++i)
 175         ast_delete(self->blocks[i]);
 176     MEM_VECTOR_CLEAR(self, blocks);
 177     mem_d(self);
 178 }
 179
 180 /*********************************************************************/
 181 /* AST codegen aprt
 182  */
 183
 184 /* TODO */