]> git.saurik.com Git - bison.git/blame - src/muscle_tab.c
Use ASCII for Sebastien Fricker's name.
[bison.git] / src / muscle_tab.c
CommitLineData
e00b6826
PE
1/* Muscle table manager for Bison.
2
279cabb6 3 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 Free Software
05ac60f3 4 Foundation, Inc.
f753cd62
MA
5
6 This file is part of Bison, the GNU Compiler Compiler.
7
8 Bison 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 2, or (at your option)
11 any later version.
12
13 Bison 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 Bison; see the file COPYING. If not, write to
0fb669f9
PE
20 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
21 Boston, MA 02110-1301, USA. */
f753cd62 22
2cec9080 23#include <config.h>
f753cd62 24#include "system.h"
8322e8f5
PE
25
26#include <hash.h>
27#include <quotearg.h>
28
9611cfa2 29#include "complain.h"
f753cd62
MA
30#include "files.h"
31#include "muscle_tab.h"
f508cb0a 32#include "getargs.h"
f753cd62 33
eb095650
PE
34/* A key-value pair, along with storage that can be reclaimed when
35 this pair is no longer needed. */
8322e8f5
PE
36typedef struct
37{
eb095650
PE
38 char const *key;
39 char const *value;
40 char *storage;
8322e8f5 41} muscle_entry;
592e8d4d
AD
42
43/* An obstack used to create some entries. */
44struct obstack muscle_obstack;
45
beda758b
AD
46/* Initial capacity of muscles hash table. */
47#define HT_INITIAL_CAPACITY 257
f753cd62 48
04098407 49static struct hash_table *muscle_table = NULL;
f753cd62 50
beda758b
AD
51static bool
52hash_compare_muscles (void const *x, void const *y)
f753cd62 53{
8322e8f5
PE
54 muscle_entry const *m1 = x;
55 muscle_entry const *m2 = y;
5dd5fd4a 56 return strcmp (m1->key, m2->key) == 0;
f753cd62
MA
57}
58
233a88ad
PE
59static size_t
60hash_muscle (const void *x, size_t tablesize)
f753cd62 61{
8322e8f5 62 muscle_entry const *m = x;
beda758b 63 return hash_string (m->key, tablesize);
f753cd62
MA
64}
65
592e8d4d
AD
66/*-----------------------------------------------------------------.
67| Create the MUSCLE_TABLE, and initialize it with default values. |
68| Also set up the MUSCLE_OBSTACK. |
69`-----------------------------------------------------------------*/
70
eb095650
PE
71static void
72muscle_entry_free (void *entry)
73{
74 muscle_entry *mentry = entry;
75 free (mentry->storage);
76 free (mentry);
77}
78
f753cd62
MA
79void
80muscle_init (void)
81{
ae7453f2
AD
82 /* Initialize the muscle obstack. */
83 obstack_init (&muscle_obstack);
84
beda758b 85 muscle_table = hash_initialize (HT_INITIAL_CAPACITY, NULL, hash_muscle,
eb095650 86 hash_compare_muscles, muscle_entry_free);
f753cd62
MA
87
88 /* Version and input file. */
ae7453f2 89 MUSCLE_INSERT_STRING ("version", VERSION);
48b16bbc 90 MUSCLE_INSERT_C_STRING ("file_name", grammar_file);
f753cd62
MA
91}
92
592e8d4d
AD
93
94/*------------------------------------------------------------.
95| Free all the memory consumed by the muscle machinery only. |
96`------------------------------------------------------------*/
97
98void
99muscle_free (void)
100{
101 hash_free (muscle_table);
102 obstack_free (&muscle_obstack, NULL);
103}
104
105
106
ae7453f2
AD
107/*------------------------------------------------------------.
108| Insert (KEY, VALUE). If KEY already existed, overwrite the |
109| previous value. |
110`------------------------------------------------------------*/
111
a870c567 112void
eb095650 113muscle_insert (char const *key, char const *value)
f753cd62 114{
8322e8f5 115 muscle_entry probe;
da2a7671 116 muscle_entry *entry;
e9bca3ad 117
ae7453f2
AD
118 probe.key = key;
119 entry = hash_lookup (muscle_table, &probe);
beda758b
AD
120
121 if (!entry)
122 {
123 /* First insertion in the hash. */
da2a7671 124 entry = xmalloc (sizeof *entry);
beda758b
AD
125 entry->key = key;
126 hash_insert (muscle_table, entry);
127 }
4502eadc
JD
128 else
129 free (entry->storage);
beda758b 130 entry->value = value;
4502eadc 131 entry->storage = NULL;
f753cd62
MA
132}
133
ae7453f2
AD
134
135/*-------------------------------------------------------------------.
ff5150d9
PE
136| Append VALUE to the current value of KEY. If KEY did not already |
137| exist, create it. Use MUSCLE_OBSTACK. De-allocate the previously |
138| associated value. Copy VALUE and SEPARATOR. |
ae7453f2
AD
139`-------------------------------------------------------------------*/
140
141void
142muscle_grow (const char *key, const char *val, const char *separator)
143{
8322e8f5
PE
144 muscle_entry probe;
145 muscle_entry *entry = NULL;
ae7453f2
AD
146
147 probe.key = key;
148 entry = hash_lookup (muscle_table, &probe);
149
150 if (!entry)
151 {
152 /* First insertion in the hash. */
da2a7671 153 entry = xmalloc (sizeof *entry);
ae7453f2
AD
154 entry->key = key;
155 hash_insert (muscle_table, entry);
eb095650 156 entry->value = entry->storage = xstrdup (val);
ae7453f2
AD
157 }
158 else
159 {
160 /* Grow the current value. */
161 char *new_val;
ae7453f2 162 obstack_sgrow (&muscle_obstack, entry->value);
eb095650 163 free (entry->storage);
ae7453f2
AD
164 obstack_sgrow (&muscle_obstack, separator);
165 obstack_sgrow (&muscle_obstack, val);
166 obstack_1grow (&muscle_obstack, 0);
167 new_val = obstack_finish (&muscle_obstack);
eb095650 168 entry->value = entry->storage = xstrdup (new_val);
ae7453f2
AD
169 obstack_free (&muscle_obstack, new_val);
170 }
171}
172
173
cd3684cf
AD
174/*------------------------------------------------------------------.
175| Append VALUE to the current value of KEY, using muscle_grow. But |
176| in addition, issue a synchronization line for the location LOC. |
177`------------------------------------------------------------------*/
178
179void
180muscle_code_grow (const char *key, const char *val, location loc)
181{
182 char *extension = NULL;
05ac60f3 183 obstack_fgrow1 (&muscle_obstack, "]b4_syncline(%d, [[", loc.start.line);
cd3684cf
AD
184 MUSCLE_OBSTACK_SGROW (&muscle_obstack,
185 quotearg_style (c_quoting_style, loc.start.file));
186 obstack_sgrow (&muscle_obstack, "]])[\n");
187 obstack_sgrow (&muscle_obstack, val);
188 obstack_1grow (&muscle_obstack, 0);
189 extension = obstack_finish (&muscle_obstack);
190 muscle_grow (key, extension, "");
eb095650 191 obstack_free (&muscle_obstack, extension);
cd3684cf
AD
192}
193
194
ae7453f2
AD
195void muscle_pair_list_grow (const char *muscle,
196 const char *a1, const char *a2)
197{
66d30cd4 198 char *pair;
7ecec4dd
JD
199 obstack_sgrow (&muscle_obstack, "[[[");
200 MUSCLE_OBSTACK_SGROW (&muscle_obstack, a1);
201 obstack_sgrow (&muscle_obstack, "]], [[");
202 MUSCLE_OBSTACK_SGROW (&muscle_obstack, a2);
203 obstack_sgrow (&muscle_obstack, "]]]");
ae7453f2 204 obstack_1grow (&muscle_obstack, 0);
66d30cd4
AD
205 pair = obstack_finish (&muscle_obstack);
206 muscle_grow (muscle, pair, ",\n");
207 obstack_free (&muscle_obstack, pair);
ae7453f2
AD
208}
209
7eb8a0bc
JD
210
211/*----------------------------------------------------------------------------.
212| Find the value of muscle KEY. Unlike MUSCLE_FIND, this is always reliable |
213| to determine whether KEY has a value. |
214`----------------------------------------------------------------------------*/
215
216char const *
217muscle_find_const (char const *key)
218{
219 muscle_entry probe;
220 muscle_entry *result = NULL;
221
222 probe.key = key;
223 result = hash_lookup (muscle_table, &probe);
224 if (result)
225 return result->value;
226 return NULL;
227}
228
229
4502eadc
JD
230/*----------------------------------------------------------------------------.
231| Find the value of muscle KEY. Abort if muscle_insert was invoked more |
232| recently than muscle_grow for KEY since muscle_find can't return a |
233| char const *. |
234`----------------------------------------------------------------------------*/
ae7453f2 235
ff5150d9 236char *
7eb8a0bc 237muscle_find (char const *key)
f753cd62 238{
8322e8f5
PE
239 muscle_entry probe;
240 muscle_entry *result = NULL;
e9bca3ad 241
ae7453f2
AD
242 probe.key = key;
243 result = hash_lookup (muscle_table, &probe);
4502eadc
JD
244 if (result)
245 {
246 aver (result->value == result->storage);
247 return result->storage;
248 }
249 return NULL;
f753cd62 250}
be2a1a68
AD
251
252
9611cfa2
JD
253void
254muscle_boundary_grow (char const *key, boundary bound)
255{
256 char *extension;
257 MUSCLE_OBSTACK_SGROW (&muscle_obstack, bound.file);
258 obstack_1grow (&muscle_obstack, ':');
259 obstack_fgrow1 (&muscle_obstack, "%d", bound.line);
260 obstack_1grow (&muscle_obstack, '.');
261 obstack_fgrow1 (&muscle_obstack, "%d", bound.column);
262 obstack_1grow (&muscle_obstack, '\0');
263 extension = obstack_finish (&muscle_obstack);
264 muscle_grow (key, extension, "");
265 obstack_free (&muscle_obstack, extension);
266}
267
268void
269muscle_location_grow (char const *key, location loc)
270{
271 muscle_grow (key, "[[", "");
272 muscle_boundary_grow (key, loc.start);
273 muscle_grow (key, "]], [[", "");
274 muscle_boundary_grow (key, loc.end);
275 muscle_grow (key, "]]", "");
276}
277
278/* Reverse of muscle_location_grow. */
279static location
280muscle_location_decode (char const *key)
281{
282 location loc;
283 char const *value = muscle_find_const (key);
284 aver (value);
285 aver (*value == '[');
286 aver (*++value == '[');
287 while (*++value)
288 switch (*value)
289 {
290 case '$':
291 aver (*++value == ']');
292 aver (*++value == '[');
293 obstack_sgrow (&muscle_obstack, "$");
294 break;
295 case '@':
296 switch (*++value)
297 {
298 case '@': obstack_sgrow (&muscle_obstack, "@" ); break;
299 case '{': obstack_sgrow (&muscle_obstack, "[" ); break;
300 case '}': obstack_sgrow (&muscle_obstack, "]" ); break;
301 default: aver (false); break;
302 }
303 break;
304 case '[':
305 aver (false);
306 break;
307 case ']':
308 {
309 char *boundary_str;
310 aver (*++value == ']');
311 obstack_1grow (&muscle_obstack, '\0');
312 boundary_str = obstack_finish (&muscle_obstack);
313 switch (*++value)
314 {
315 case ',':
316 boundary_set_from_string (&loc.start, boundary_str);
317 obstack_free (&muscle_obstack, boundary_str);
318 aver (*++value == ' ');
319 aver (*++value == '[');
320 aver (*++value == '[');
321 break;
322 case '\0':
323 boundary_set_from_string (&loc.end, boundary_str);
324 obstack_free (&muscle_obstack, boundary_str);
325 return loc;
326 break;
327 default:
328 aver (false);
329 break;
330 }
331 }
332 break;
333 default:
334 obstack_1grow (&muscle_obstack, *value);
335 break;
336 }
337 aver (false);
338 return loc;
339}
340
341void
342muscle_user_name_list_grow (char const *key, char const *user_name,
343 location loc)
344{
345 muscle_grow (key, "[[[[", ",");
346 muscle_grow (key, user_name, "");
347 muscle_grow (key, "]], ", "");
348 muscle_location_grow (key, loc);
349 muscle_grow (key, "]]", "");
350}
351
352#define MUSCLE_USER_NAME_CONVERT(NAME, PREFIX, USER_NAME, SUFFIX) \
353do { \
354 char *tmp; \
355 size_t length = strlen ((USER_NAME)); \
356 tmp = xmalloc (sizeof (PREFIX) - 1 + length + sizeof (SUFFIX)); \
357 strcpy (tmp, (PREFIX)); \
358 strcpy (tmp + sizeof (PREFIX) - 1, (USER_NAME)); \
359 strcpy (tmp + sizeof (PREFIX) - 1 + length, (SUFFIX)); \
360 (NAME) = uniqstr_new (tmp); \
361 free (tmp); \
362} while (0)
363
364void
365muscle_percent_define_insert (char const *variable, location variable_loc,
366 char const *value)
367{
368 char const *name;
369 char const *loc_name;
370
371 MUSCLE_USER_NAME_CONVERT (name, "percent_define(", variable, ")");
372 MUSCLE_USER_NAME_CONVERT (loc_name, "percent_define_loc(", variable, ")");
373
374 if (muscle_find_const (name))
375 {
376 warn_at (variable_loc, _("%s `%s' redefined"),
377 "%define variable", variable);
378 warn_at (muscle_location_decode (loc_name), _("previous definition"));
379 }
380 MUSCLE_INSERT_STRING (name, value);
381
382 muscle_insert (loc_name, "");
383 muscle_location_grow (loc_name, variable_loc);
384 muscle_user_name_list_grow ("percent_define_user_variables", variable,
385 variable_loc);
386}
387
388bool
389muscle_percent_define_flag_if (char const *variable)
390{
391 char const *name;
392 char const *loc_name;
393 char const *usage_name;
394 char const *value;
395 bool result = false;
396
397 MUSCLE_USER_NAME_CONVERT (name, "percent_define(", variable, ")");
398 MUSCLE_USER_NAME_CONVERT (loc_name, "percent_define_loc(", variable, ")");
399 MUSCLE_USER_NAME_CONVERT (usage_name, "percent_define_bison_variables(",
400 variable, ")");
401
402 value = muscle_find_const (name);
403 if (value)
404 {
405 if (value[0] == '\0' || 0 == strcmp (value, "true"))
406 result = true;
407 else if (0 == strcmp (value, "false"))
408 result = false;
409 else if (!muscle_find_const (usage_name))
410 complain_at(muscle_location_decode (loc_name),
411 _("invalid value for %%define boolean variable `%s'"),
412 variable);
413 }
414 else
415 fatal(_("undefined %%define variable `%s' passed to muscle_percent_define_flag_if"),
416 variable);
417
418 muscle_insert (usage_name, "");
419
420 return result;
421}
422
423void
424muscle_percent_define_default (char const *variable, char const *value)
425{
426 char const *name;
427 char const *loc_name;
428 MUSCLE_USER_NAME_CONVERT (name, "percent_define(", variable, ")");
429 MUSCLE_USER_NAME_CONVERT (loc_name, "percent_define_loc(", variable, ")");
430 if (!muscle_find_const (name))
431 {
432 location loc;
433 MUSCLE_INSERT_STRING (name, value);
434 loc.start.file = loc.end.file = "[Bison:muscle_percent_define_default]";
435 loc.start.line = loc.start.column = 0;
436 loc.end.line = loc.end.column = 0;
437 muscle_insert (loc_name, "");
438 muscle_location_grow (loc_name, loc);
439 }
440}
441
442void
443muscle_percent_code_grow (char const *qualifier, location qualifier_loc,
444 char const *code, location code_loc)
445{
446 char const *name;
447 MUSCLE_USER_NAME_CONVERT (name, "percent_code(", qualifier, ")");
448 muscle_code_grow (name, code, code_loc);
449 muscle_user_name_list_grow ("percent_code_user_qualifiers", qualifier,
450 qualifier_loc);
451}
452
453
ae7453f2
AD
454/*------------------------------------------------.
455| Output the definition of ENTRY as a m4_define. |
456`------------------------------------------------*/
be2a1a68 457
e00b6826 458static inline bool
8322e8f5 459muscle_m4_output (muscle_entry *entry, FILE *out)
be2a1a68
AD
460{
461 fprintf (out, "m4_define([b4_%s],\n", entry->key);
ae7453f2 462 fprintf (out, "[[%s]])\n\n\n", entry->value);
e00b6826
PE
463 return true;
464}
465
466static bool
467muscle_m4_output_processor (void *entry, void *out)
468{
469 return muscle_m4_output (entry, out);
be2a1a68
AD
470}
471
472
ae7453f2
AD
473/*----------------------------------------------------------------.
474| Output the definition of all the current muscles into a list of |
475| m4_defines. |
476`----------------------------------------------------------------*/
be2a1a68
AD
477
478void
479muscles_m4_output (FILE *out)
480{
e00b6826 481 hash_do_for_each (muscle_table, muscle_m4_output_processor, out);
be2a1a68 482}