src/symlist.c

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