]> git.saurik.com Git - bison.git/blob - src/symlist.c
Finish implementation of per-type %destructor/%printer. Discussed
[bison.git] / src / symlist.c
1 /* Lists of symbols for Bison
2
3 Copyright (C) 2002, 2005, 2006 Free Software Foundation, Inc.
4
5 This file is part of Bison, the GNU Compiler Compiler.
6
7 Bison is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
10 any later version.
11
12 Bison is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with Bison; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, USA. */
21
22 #include <config.h>
23 #include "system.h"
24
25 #include "complain.h"
26 #include "symlist.h"
27
28
29 /*--------------------------------------.
30 | Create a list containing SYM at LOC. |
31 `--------------------------------------*/
32
33 symbol_list *
34 symbol_list_sym_new (symbol *sym, location loc)
35 {
36 symbol_list *res = xmalloc (sizeof *res);
37
38 res->content_type = SYMLIST_SYMBOL;
39 res->content.sym = sym;
40 res->location = loc;
41
42 res->midrule = NULL;
43 res->midrule_parent_rule = NULL;
44 res->midrule_parent_rhs_index = 0;
45
46 res->action = NULL;
47 res->used = false;
48
49 res->ruleprec = NULL;
50 res->dprec = 0;
51 res->merger = 0;
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.type_name = type_name;
70 res->location = loc;
71 res->next = NULL;
72
73 return res;
74 }
75
76
77 /*----------------------------------------------------.
78 | Create a list containing a %symbol-default at LOC. |
79 `----------------------------------------------------*/
80
81 symbol_list *
82 symbol_list_default_new (location loc)
83 {
84 symbol_list *res = xmalloc (sizeof *res);
85
86 res->content_type = SYMLIST_DEFAULT;
87 res->location = loc;
88 res->next = NULL;
89
90 return res;
91 }
92
93
94 /*-----------------------------------------------------------------------.
95 | Print this list, for which every content_type must be SYMLIST_SYMBOL. |
96 `-----------------------------------------------------------------------*/
97
98 void
99 symbol_list_syms_print (const symbol_list *l, FILE *f)
100 {
101 for (/* Nothing. */; l && l->content.sym; l = l->next)
102 {
103 symbol_print (l->content.sym, f);
104 fprintf (stderr, l->used ? " used" : " unused");
105 if (l && l->content.sym)
106 fprintf (f, ", ");
107 }
108 }
109
110
111 /*---------------------------.
112 | Prepend NODE to the LIST. |
113 `---------------------------*/
114
115 symbol_list *
116 symbol_list_prepend (symbol_list *list, symbol_list *node)
117 {
118 node->next = list;
119 return node;
120 }
121
122
123 /*-----------------------------------------------.
124 | Free the LIST, but not the items it contains. |
125 `-----------------------------------------------*/
126
127 void
128 symbol_list_free (symbol_list *list)
129 {
130 LIST_FREE (symbol_list, list);
131 }
132
133
134 /*--------------------.
135 | Return its length. |
136 `--------------------*/
137
138 int
139 symbol_list_length (symbol_list const *l)
140 {
141 int res = 0;
142 for (/* Nothing. */;
143 l && !(l->content_type == SYMLIST_SYMBOL && l->content.sym == NULL);
144 l = l->next)
145 ++res;
146 return res;
147 }
148
149
150 /*------------------------------.
151 | Get item N in symbol list L. |
152 `------------------------------*/
153
154 symbol_list *
155 symbol_list_n_get (symbol_list *l, int n)
156 {
157 int i;
158
159 if (n < 0)
160 return NULL;
161
162 for (i = 0; i < n; ++i)
163 {
164 l = l->next;
165 if (l == NULL
166 || (l->content_type == SYMLIST_SYMBOL && l->content.sym == NULL))
167 return NULL;
168 }
169
170 return l;
171 }
172
173
174 /*--------------------------------------------------------------.
175 | Get the data type (alternative in the union) of the value for |
176 | symbol N in symbol list L. |
177 `--------------------------------------------------------------*/
178
179 uniqstr
180 symbol_list_n_type_name_get (symbol_list *l, location loc, int n)
181 {
182 l = symbol_list_n_get (l, n);
183 if (!l)
184 {
185 complain_at (loc, _("invalid $ value: $%d"), n);
186 return NULL;
187 }
188 assert (l->content_type == SYMLIST_SYMBOL);
189 return l->content.sym->type_name;
190 }
191
192
193 /*--------------------------------------.
194 | The item N in symbol list L is USED. |
195 `--------------------------------------*/
196
197 void
198 symbol_list_n_used_set (symbol_list *l, int n, bool used)
199 {
200 l = symbol_list_n_get (l, n);
201 if (l)
202 l->used = used;
203 }
204
205 void
206 symbol_list_destructor_set (symbol_list *node, const char *destructor,
207 location loc)
208 {
209 switch (node->content_type)
210 {
211 case SYMLIST_SYMBOL:
212 symbol_destructor_set (node->content.sym, destructor, loc);
213 break;
214 case SYMLIST_TYPE:
215 semantic_type_destructor_set (
216 semantic_type_get (node->content.type_name), destructor, loc);
217 break;
218 case SYMLIST_DEFAULT:
219 default_destructor_set (destructor, loc);
220 break;
221 }
222 }
223
224 void
225 symbol_list_printer_set (symbol_list *node, const char *printer, location loc)
226 {
227 switch (node->content_type)
228 {
229 case SYMLIST_SYMBOL:
230 symbol_printer_set (node->content.sym, printer, loc);
231 break;
232 case SYMLIST_TYPE:
233 semantic_type_printer_set (
234 semantic_type_get (node->content.type_name), printer, loc);
235 break;
236 case SYMLIST_DEFAULT:
237 default_printer_set (printer, loc);
238 break;
239 }
240 }