]> git.saurik.com Git - bison.git/blob - src/symlist.c
f9ec837c92f323a5c0aefceca0cdd86fcd759444
[bison.git] / 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
40 res->midrule = NULL;
41 res->midrule_parent_rule = NULL;
42 res->midrule_parent_rhs_index = 0;
43
44 code_props_none_init (&res->action_props);
45
46 res->ruleprec = NULL;
47 res->dprec = 0;
48 res->merger = 0;
49
50 res->named_ref = NULL;
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 for (/* Nothing. */; l && l->content.sym; l = l->next)
89 {
90 symbol_print (l->content.sym, f);
91 fprintf (f, l->action_props.is_value_used ? " used" : " unused");
92 if (l && l->content.sym)
93 fprintf (f, ", ");
94 }
95 }
96
97
98 /*---------------------------.
99 | Prepend NODE to the LIST. |
100 `---------------------------*/
101
102 symbol_list *
103 symbol_list_prepend (symbol_list *list, symbol_list *node)
104 {
105 node->next = list;
106 return node;
107 }
108
109
110 /*-------------------------.
111 | Append NODE to the LIST. |
112 `-------------------------*/
113
114 symbol_list *
115 symbol_list_append (symbol_list *list, symbol_list *node)
116 {
117 if (!list)
118 return node;
119 symbol_list *next = list;
120 while (next->next)
121 next = next->next;
122 next->next = node;
123 return list;
124 }
125
126
127 /*-----------------------------------------------.
128 | Free the LIST, but not the items it contains. |
129 `-----------------------------------------------*/
130
131 void
132 symbol_list_free (symbol_list *list)
133 {
134 symbol_list *node, *next;
135 for (node = list; node; node = next)
136 {
137 next = node->next;
138 named_ref_free (node->named_ref);
139 if (node->content_type == SYMLIST_TYPE)
140 free (node->content.sem_type);
141 free (node);
142 }
143 }
144
145
146 /*--------------------.
147 | Return its length. |
148 `--------------------*/
149
150 int
151 symbol_list_length (symbol_list const *l)
152 {
153 int res = 0;
154 for (/* Nothing. */;
155 l && !(l->content_type == SYMLIST_SYMBOL && l->content.sym == NULL);
156 l = l->next)
157 ++res;
158 return res;
159 }
160
161
162 /*------------------------------.
163 | Get item N in symbol list L. |
164 `------------------------------*/
165
166 symbol_list *
167 symbol_list_n_get (symbol_list *l, int n)
168 {
169 int i;
170
171 if (n < 0)
172 return NULL;
173
174 for (i = 0; i < n; ++i)
175 {
176 l = l->next;
177 if (l == NULL
178 || (l->content_type == SYMLIST_SYMBOL && l->content.sym == NULL))
179 return NULL;
180 }
181
182 return l;
183 }
184
185
186 /*--------------------------------------------------------------.
187 | Get the data type (alternative in the union) of the value for |
188 | symbol N in symbol list L. |
189 `--------------------------------------------------------------*/
190
191 uniqstr
192 symbol_list_n_type_name_get (symbol_list *l, location loc, int n)
193 {
194 l = symbol_list_n_get (l, n);
195 if (!l)
196 {
197 complain (&loc, complaint, _("invalid $ value: $%d"), n);
198 return NULL;
199 }
200 aver (l->content_type == SYMLIST_SYMBOL);
201 return l->content.sym->type_name;
202 }
203
204 bool
205 symbol_list_null (symbol_list *node)
206 {
207 return !node ||
208 (node->content_type == SYMLIST_SYMBOL && !(node->content.sym));
209 }
210
211 void
212 symbol_list_code_props_set (symbol_list *node, code_props_type kind,
213 code_props const *cprops)
214 {
215 switch (node->content_type)
216 {
217 case SYMLIST_SYMBOL:
218 symbol_code_props_set (node->content.sym, kind, cprops);
219 if (node->content.sym->status == undeclared)
220 node->content.sym->status = used;
221 break;
222 case SYMLIST_TYPE:
223 semantic_type_code_props_set
224 (semantic_type_get (node->content.sem_type->tag,
225 &node->content.sem_type->location),
226 kind, cprops);
227 if (node->content.sem_type->status == undeclared)
228 node->content.sem_type->status = used;
229 break;
230 }
231 }