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