src/symlist.c

   1 /* Lists of symbols for Bison
   2
   3    Copyright (C) 2002, 2005-2007, 2009-2013 Free Software Foundation,
   4    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 | Create a list containing SYM at LOC.  |
  29 `--------------------------------------*/
  30
  31 symbol_list *
  32 symbol_list_sym_new (symbol *sym, location loc)
  33 {
  34   symbol_list *res = xmalloc (sizeof *res);
  35
  36   res->content_type = SYMLIST_SYMBOL;
  37   res->content.sym = sym;
  38   res->location = res->sym_loc = loc;
  39   res->named_ref = NULL;
  40
  41   res->midrule = NULL;
  42   res->midrule_parent_rule = NULL;
  43   res->midrule_parent_rhs_index = 0;
  44
  45   /* Members used for LHS only.  */
  46   res->ruleprec = NULL;
  47   res->percent_empty_loc = empty_location;
  48   code_props_none_init (&res->action_props);
  49   res->dprec = 0;
  50   res->merger = 0;
  51
  52   res->next = NULL;
  53
  54   return res;
  55 }
  56
  57
  58 /*--------------------------------------------.
  59 | Create a list containing TYPE_NAME at LOC.  |
  60 `--------------------------------------------*/
  61
  62 symbol_list *
  63 symbol_list_type_new (uniqstr type_name, location loc)
  64 {
  65   symbol_list *res = xmalloc (sizeof *res);
  66
  67   res->content_type = SYMLIST_TYPE;
  68   res->content.sem_type = xmalloc (sizeof (semantic_type));
  69   res->content.sem_type->tag = type_name;
  70   res->content.sem_type->location = loc;
  71   res->content.sem_type->status = undeclared;
  72
  73   res->location = res->sym_loc = loc;
  74   res->named_ref = NULL;
  75   res->next = NULL;
  76
  77   return res;
  78 }
  79
  80
  81 /*-----------------------------------------------------------------------.
  82 | Print this list, for which every content_type must be SYMLIST_SYMBOL.  |
  83 `-----------------------------------------------------------------------*/
  84
  85 void
  86 symbol_list_syms_print (const symbol_list *l, FILE *f)
  87 {
  88   char const *sep = "";
  89   for (/* Nothing. */; l && l->content.sym; l = l->next)
  90     {
  91       fputs (sep, f);
  92       fputs (l->content_type == SYMLIST_SYMBOL ? "symbol: "
  93              : l->content_type == SYMLIST_TYPE ? "type: "
  94              : "invalid content_type: ",
  95              f);
  96       symbol_print (l->content.sym, f);
  97       fputs (l->action_props.is_value_used ? " used" : " unused", f);
  98       sep = ", ";
  99     }
 100 }
 101
 102
 103 /*---------------------------.
 104 | Prepend NODE to the LIST.  |
 105 `---------------------------*/
 106
 107 symbol_list *
 108 symbol_list_prepend (symbol_list *list, symbol_list *node)
 109 {
 110   node->next = list;
 111   return node;
 112 }
 113
 114
 115 /*-------------------------.
 116 | Append NODE to the LIST. |
 117 `-------------------------*/
 118
 119 symbol_list *
 120 symbol_list_append (symbol_list *list, symbol_list *node)
 121 {
 122   if (!list)
 123     return node;
 124   symbol_list *next = list;
 125   while (next->next)
 126     next = next->next;
 127   next->next = node;
 128   return list;
 129 }
 130
 131
 132 /*-----------------------------------------------.
 133 | Free the LIST, but not the items it contains.  |
 134 `-----------------------------------------------*/
 135
 136 void
 137 symbol_list_free (symbol_list *list)
 138 {
 139   symbol_list *node, *next;
 140   for (node = list; node; node = next)
 141     {
 142       next = node->next;
 143       named_ref_free (node->named_ref);
 144       if (node->content_type == SYMLIST_TYPE)
 145         free (node->content.sem_type);
 146       free (node);
 147     }
 148 }
 149
 150
 151 /*--------------------.
 152 | Return its length.  |
 153 `--------------------*/
 154
 155 int
 156 symbol_list_length (symbol_list const *l)
 157 {
 158   int res = 0;
 159   for (/* Nothing. */;
 160        l && !(l->content_type == SYMLIST_SYMBOL && l->content.sym == NULL);
 161        l = l->next)
 162     ++res;
 163   return res;
 164 }
 165
 166
 167 /*------------------------------.
 168 | Get item N in symbol list L.  |
 169 `------------------------------*/
 170
 171 symbol_list *
 172 symbol_list_n_get (symbol_list *l, int n)
 173 {
 174   int i;
 175
 176   if (n < 0)
 177     return NULL;
 178
 179   for (i = 0; i < n; ++i)
 180     {
 181       l = l->next;
 182       if (l == NULL
 183           || (l->content_type == SYMLIST_SYMBOL && l->content.sym == NULL))
 184         return NULL;
 185     }
 186
 187   return l;
 188 }
 189
 190
 191 /*--------------------------------------------------------------.
 192 | Get the data type (alternative in the union) of the value for |
 193 | symbol N in symbol list L.                                    |
 194 `--------------------------------------------------------------*/
 195
 196 uniqstr
 197 symbol_list_n_type_name_get (symbol_list *l, location loc, int n)
 198 {
 199   l = symbol_list_n_get (l, n);
 200   if (!l)
 201     {
 202       complain (&loc, complaint, _("invalid $ value: $%d"), n);
 203       return NULL;
 204     }
 205   aver (l->content_type == SYMLIST_SYMBOL);
 206   return l->content.sym->type_name;
 207 }
 208
 209 bool
 210 symbol_list_null (symbol_list *node)
 211 {
 212   return !node ||
 213     (node->content_type == SYMLIST_SYMBOL && !(node->content.sym));
 214 }
 215
 216 void
 217 symbol_list_code_props_set (symbol_list *node, code_props_type kind,
 218                             code_props const *cprops)
 219 {
 220   switch (node->content_type)
 221     {
 222     case SYMLIST_SYMBOL:
 223       symbol_code_props_set (node->content.sym, kind, cprops);
 224       if (node->content.sym->status == undeclared)
 225         node->content.sym->status = used;
 226       break;
 227     case SYMLIST_TYPE:
 228       semantic_type_code_props_set
 229         (semantic_type_get (node->content.sem_type->tag,
 230                             &node->content.sem_type->location),
 231          kind, cprops);
 232       if (node->content.sem_type->status == undeclared)
 233         node->content.sem_type->status = used;
 234       break;
 235     }
 236 }