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