src/symlist.c

   1 /* Lists of symbols for Bison
   2
   3    Copyright (C) 2002, 2005, 2006, 2007, 2009, 2010 Free Software
   4    Foundation, Inc.
   5
   6    This file is part of Bison, the GNU Compiler Compiler.
   7
   8    This program is free software: you can redistribute it and/or modify
   9    it under the terms of the GNU General Public License as published by
  10    the Free Software Foundation, either version 3 of the License, or
  11    (at your option) any later version.
  12
  13    This program is distributed in the hope that it will be useful,
  14    but WITHOUT ANY WARRANTY; without even the implied warranty of
  15    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16    GNU General Public License for more details.
  17
  18    You should have received a copy of the GNU General Public License
  19    along with this program.  If not, see <http://www.gnu.org/licenses/>.  */
  20
  21 #include <config.h>
  22 #include "system.h"
  23
  24 #include "complain.h"
  25 #include "symlist.h"
  26
  27
  28 /*--------------------------------------.
  29 | Create a list containing SYM at LOC.  |
  30 `--------------------------------------*/
  31
  32 symbol_list *
  33 symbol_list_sym_new (symbol *sym, location loc)
  34 {
  35   symbol_list *res = xmalloc (sizeof *res);
  36
  37   res->content_type = SYMLIST_SYMBOL;
  38   res->content.sym = sym;
  39   res->location = res->sym_loc = loc;
  40
  41   res->midrule = NULL;
  42   res->midrule_parent_rule = NULL;
  43   res->midrule_parent_rhs_index = 0;
  44
  45   code_props_none_init (&res->action_props);
  46
  47   res->ruleprec = NULL;
  48   res->dprec = 0;
  49   res->merger = 0;
  50
  51   res->named_ref = NULL;
  52
  53   res->next = NULL;
  54
  55   return res;
  56 }
  57
  58
  59 /*--------------------------------------------.
  60 | Create a list containing TYPE_NAME at LOC.  |
  61 `--------------------------------------------*/
  62
  63 symbol_list *
  64 symbol_list_type_new (uniqstr type_name, location loc)
  65 {
  66   symbol_list *res = xmalloc (sizeof *res);
  67
  68   res->content_type = SYMLIST_TYPE;
  69   res->content.type_name = type_name;
  70   res->location = res->sym_loc = loc;
  71   res->named_ref = NULL;
  72   res->next = NULL;
  73
  74   return res;
  75 }
  76
  77
  78 /*----------------------------------------.
  79 | Create a list containing a <*> at LOC.  |
  80 `----------------------------------------*/
  81
  82 symbol_list *
  83 symbol_list_default_tagged_new (location loc)
  84 {
  85   symbol_list *res = xmalloc (sizeof *res);
  86
  87   res->content_type = SYMLIST_DEFAULT_TAGGED;
  88   res->location = res->sym_loc = loc;
  89   res->named_ref = NULL;
  90   res->next = NULL;
  91
  92   return res;
  93 }
  94
  95
  96 /*---------------------------------------.
  97 | Create a list containing a <> at LOC.  |
  98 `---------------------------------------*/
  99
 100 symbol_list *
 101 symbol_list_default_tagless_new (location loc)
 102 {
 103   symbol_list *res = xmalloc (sizeof *res);
 104
 105   res->content_type = SYMLIST_DEFAULT_TAGLESS;
 106   res->location = res->sym_loc = loc;
 107   res->named_ref = NULL;
 108   res->next = NULL;
 109
 110   return res;
 111 }
 112
 113
 114 /*-----------------------------------------------------------------------.
 115 | Print this list, for which every content_type must be SYMLIST_SYMBOL.  |
 116 `-----------------------------------------------------------------------*/
 117
 118 void
 119 symbol_list_syms_print (const symbol_list *l, FILE *f)
 120 {
 121   for (/* Nothing. */; l && l->content.sym; l = l->next)
 122     {
 123       symbol_print (l->content.sym, f);
 124       fprintf (stderr, l->action_props.is_value_used ? " used" : " unused");
 125       if (l && l->content.sym)
 126         fprintf (f, ", ");
 127     }
 128 }
 129
 130
 131 /*---------------------------.
 132 | Prepend NODE to the LIST.  |
 133 `---------------------------*/
 134
 135 symbol_list *
 136 symbol_list_prepend (symbol_list *list, symbol_list *node)
 137 {
 138   node->next = list;
 139   return node;
 140 }
 141
 142
 143 /*-----------------------------------------------.
 144 | Free the LIST, but not the items it contains.  |
 145 `-----------------------------------------------*/
 146
 147 void
 148 symbol_list_free (symbol_list *list)
 149 {
 150   symbol_list *node, *next;
 151   for (node = list; node; node = next)
 152     {
 153       next = node->next;
 154       if (node->named_ref)
 155         named_ref_free (node->named_ref);
 156       free (node);
 157     }
 158 }
 159
 160
 161 /*--------------------.
 162 | Return its length.  |
 163 `--------------------*/
 164
 165 int
 166 symbol_list_length (symbol_list const *l)
 167 {
 168   int res = 0;
 169   for (/* Nothing. */;
 170        l && !(l->content_type == SYMLIST_SYMBOL && l->content.sym == NULL);
 171        l = l->next)
 172     ++res;
 173   return res;
 174 }
 175
 176
 177 /*------------------------------.
 178 | Get item N in symbol list L.  |
 179 `------------------------------*/
 180
 181 symbol_list *
 182 symbol_list_n_get (symbol_list *l, int n)
 183 {
 184   int i;
 185
 186   if (n < 0)
 187     return NULL;
 188
 189   for (i = 0; i < n; ++i)
 190     {
 191       l = l->next;
 192       if (l == NULL
 193           || (l->content_type == SYMLIST_SYMBOL && l->content.sym == NULL))
 194         return NULL;
 195     }
 196
 197   return l;
 198 }
 199
 200
 201 /*--------------------------------------------------------------.
 202 | Get the data type (alternative in the union) of the value for |
 203 | symbol N in symbol list L.                                    |
 204 `--------------------------------------------------------------*/
 205
 206 uniqstr
 207 symbol_list_n_type_name_get (symbol_list *l, location loc, int n)
 208 {
 209   l = symbol_list_n_get (l, n);
 210   if (!l)
 211     {
 212       complain_at (loc, _("invalid $ value: $%d"), n);
 213       return NULL;
 214     }
 215   aver (l->content_type == SYMLIST_SYMBOL);
 216   return l->content.sym->type_name;
 217 }
 218
 219 bool
 220 symbol_list_null (symbol_list *node)
 221 {
 222   return !node ||
 223     (node->content_type == SYMLIST_SYMBOL && !(node->content.sym));
 224 }
 225
 226 void
 227 symbol_list_destructor_set (symbol_list *node, char const *code, location loc)
 228 {
 229   code_props destructor;
 230   code_props_symbol_action_init (&destructor, code, loc);
 231   code_props_translate_code (&destructor);
 232   switch (node->content_type)
 233     {
 234       case SYMLIST_SYMBOL:
 235         symbol_destructor_set (node->content.sym, &destructor);
 236         break;
 237       case SYMLIST_TYPE:
 238         semantic_type_destructor_set (
 239           semantic_type_get (node->content.type_name), &destructor);
 240         break;
 241       case SYMLIST_DEFAULT_TAGGED:
 242         default_tagged_destructor_set (&destructor);
 243         break;
 244       case SYMLIST_DEFAULT_TAGLESS:
 245         default_tagless_destructor_set (&destructor);
 246         break;
 247     }
 248 }
 249
 250 void
 251 symbol_list_printer_set (symbol_list *node, char const *code, location loc)
 252 {
 253   code_props printer;
 254   code_props_symbol_action_init (&printer, code, loc);
 255   code_props_translate_code (&printer);
 256   switch (node->content_type)
 257     {
 258       case SYMLIST_SYMBOL:
 259         symbol_printer_set (node->content.sym, &printer);
 260         break;
 261       case SYMLIST_TYPE:
 262         semantic_type_printer_set (
 263           semantic_type_get (node->content.type_name), &printer);
 264         break;
 265       case SYMLIST_DEFAULT_TAGGED:
 266         default_tagged_printer_set (&printer);
 267         break;
 268       case SYMLIST_DEFAULT_TAGLESS:
 269         default_tagless_printer_set (&printer);
 270         break;
 271     }
 272 }