]>
Commit | Line | Data |
---|---|---|
1 | /* Lists of symbols for Bison | |
2 | ||
3 | Copyright (C) 2002, 2005, 2006, 2007 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 | code_props_none_init (&res->action_props); | |
47 | ||
48 | res->ruleprec = NULL; | |
49 | res->dprec = 0; | |
50 | res->merger = 0; | |
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.type_name = type_name; | |
69 | res->location = loc; | |
70 | res->next = NULL; | |
71 | ||
72 | return res; | |
73 | } | |
74 | ||
75 | ||
76 | /*----------------------------------------. | |
77 | | Create a list containing a <*> at LOC. | | |
78 | `----------------------------------------*/ | |
79 | ||
80 | symbol_list * | |
81 | symbol_list_default_tagged_new (location loc) | |
82 | { | |
83 | symbol_list *res = xmalloc (sizeof *res); | |
84 | ||
85 | res->content_type = SYMLIST_DEFAULT_TAGGED; | |
86 | res->location = loc; | |
87 | res->next = NULL; | |
88 | ||
89 | return res; | |
90 | } | |
91 | ||
92 | ||
93 | /*---------------------------------------. | |
94 | | Create a list containing a <> at LOC. | | |
95 | `---------------------------------------*/ | |
96 | ||
97 | symbol_list * | |
98 | symbol_list_default_tagless_new (location loc) | |
99 | { | |
100 | symbol_list *res = xmalloc (sizeof *res); | |
101 | ||
102 | res->content_type = SYMLIST_DEFAULT_TAGLESS; | |
103 | res->location = loc; | |
104 | res->next = NULL; | |
105 | ||
106 | return res; | |
107 | } | |
108 | ||
109 | ||
110 | /*-----------------------------------------------------------------------. | |
111 | | Print this list, for which every content_type must be SYMLIST_SYMBOL. | | |
112 | `-----------------------------------------------------------------------*/ | |
113 | ||
114 | void | |
115 | symbol_list_syms_print (const symbol_list *l, FILE *f) | |
116 | { | |
117 | for (/* Nothing. */; l && l->content.sym; l = l->next) | |
118 | { | |
119 | symbol_print (l->content.sym, f); | |
120 | fprintf (stderr, l->action_props.is_value_used ? " used" : " unused"); | |
121 | if (l && l->content.sym) | |
122 | fprintf (f, ", "); | |
123 | } | |
124 | } | |
125 | ||
126 | ||
127 | /*---------------------------. | |
128 | | Prepend NODE to the LIST. | | |
129 | `---------------------------*/ | |
130 | ||
131 | symbol_list * | |
132 | symbol_list_prepend (symbol_list *list, symbol_list *node) | |
133 | { | |
134 | node->next = list; | |
135 | return node; | |
136 | } | |
137 | ||
138 | ||
139 | /*-----------------------------------------------. | |
140 | | Free the LIST, but not the items it contains. | | |
141 | `-----------------------------------------------*/ | |
142 | ||
143 | void | |
144 | symbol_list_free (symbol_list *list) | |
145 | { | |
146 | LIST_FREE (symbol_list, list); | |
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_at (loc, _("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 | ||
209 | void | |
210 | symbol_list_destructor_set (symbol_list *node, char const *code, location loc) | |
211 | { | |
212 | code_props destructor; | |
213 | code_props_symbol_action_init (&destructor, code, loc); | |
214 | code_props_translate_code (&destructor); | |
215 | switch (node->content_type) | |
216 | { | |
217 | case SYMLIST_SYMBOL: | |
218 | symbol_destructor_set (node->content.sym, &destructor); | |
219 | break; | |
220 | case SYMLIST_TYPE: | |
221 | semantic_type_destructor_set ( | |
222 | semantic_type_get (node->content.type_name), &destructor); | |
223 | break; | |
224 | case SYMLIST_DEFAULT_TAGGED: | |
225 | default_tagged_destructor_set (&destructor); | |
226 | break; | |
227 | case SYMLIST_DEFAULT_TAGLESS: | |
228 | default_tagless_destructor_set (&destructor); | |
229 | break; | |
230 | } | |
231 | } | |
232 | ||
233 | void | |
234 | symbol_list_printer_set (symbol_list *node, char const *code, location loc) | |
235 | { | |
236 | code_props printer; | |
237 | code_props_symbol_action_init (&printer, code, loc); | |
238 | code_props_translate_code (&printer); | |
239 | switch (node->content_type) | |
240 | { | |
241 | case SYMLIST_SYMBOL: | |
242 | symbol_printer_set (node->content.sym, &printer); | |
243 | break; | |
244 | case SYMLIST_TYPE: | |
245 | semantic_type_printer_set ( | |
246 | semantic_type_get (node->content.type_name), &printer); | |
247 | break; | |
248 | case SYMLIST_DEFAULT_TAGGED: | |
249 | default_tagged_printer_set (&printer); | |
250 | break; | |
251 | case SYMLIST_DEFAULT_TAGLESS: | |
252 | default_tagless_printer_set (&printer); | |
253 | break; | |
254 | } | |
255 | } |