]>
Commit | Line | Data |
---|---|---|
ae7453f2 | 1 | /* Muscle table manager for Bison, |
a737b216 | 2 | Copyright (C) 2001, 2002, 2003 Free Software Foundation, Inc. |
f753cd62 MA |
3 | |
4 | This file is part of Bison, the GNU Compiler Compiler. | |
5 | ||
6 | Bison is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
8 | the Free Software Foundation; either version 2, or (at your option) | |
9 | any later version. | |
10 | ||
11 | Bison is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with Bison; see the file COPYING. If not, write to | |
0fb669f9 PE |
18 | the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
19 | Boston, MA 02110-1301, USA. */ | |
f753cd62 MA |
20 | |
21 | #ifndef MUSCLE_TAB_H_ | |
f7737e2e | 22 | # define MUSCLE_TAB_H_ |
f753cd62 | 23 | |
cd3684cf AD |
24 | # include "location.h" |
25 | ||
d33cb3ae PE |
26 | void muscle_init (void); |
27 | void muscle_insert (const char *key, char *value); | |
28 | char *muscle_find (const char *key); | |
29 | void muscle_free (void); | |
592e8d4d AD |
30 | |
31 | ||
32 | /* An obstack dedicated to receive muscle keys and values. */ | |
33 | extern struct obstack muscle_obstack; | |
f753cd62 | 34 | |
d0829076 | 35 | #define MUSCLE_INSERT_BOOL(Key, Value) \ |
90b9908d | 36 | do { \ |
d0829076 PE |
37 | int v = Value; \ |
38 | MUSCLE_INSERT_INT (Key, v); \ | |
90b9908d | 39 | } while(0) |
d0829076 | 40 | |
9b3add5b | 41 | #define MUSCLE_INSERT_INT(Key, Value) \ |
90b9908d | 42 | do { \ |
04098407 | 43 | obstack_fgrow1 (&muscle_obstack, "%d", Value); \ |
9b3add5b RA |
44 | obstack_1grow (&muscle_obstack, 0); \ |
45 | muscle_insert (Key, obstack_finish (&muscle_obstack)); \ | |
90b9908d | 46 | } while(0) |
9b3add5b | 47 | |
680e8701 | 48 | #define MUSCLE_INSERT_LONG_INT(Key, Value) \ |
90b9908d | 49 | do { \ |
04098407 | 50 | obstack_fgrow1 (&muscle_obstack, "%ld", Value); \ |
680e8701 AD |
51 | obstack_1grow (&muscle_obstack, 0); \ |
52 | muscle_insert (Key, obstack_finish (&muscle_obstack)); \ | |
90b9908d | 53 | } while(0) |
680e8701 | 54 | |
9b3add5b | 55 | #define MUSCLE_INSERT_STRING(Key, Value) \ |
90b9908d | 56 | do { \ |
9b3add5b RA |
57 | obstack_sgrow (&muscle_obstack, Value); \ |
58 | obstack_1grow (&muscle_obstack, 0); \ | |
59 | muscle_insert (Key, obstack_finish (&muscle_obstack)); \ | |
90b9908d | 60 | } while(0) |
9b3add5b | 61 | |
a027c30d | 62 | #define MUSCLE_OBSTACK_SGROW(Obstack, Value) \ |
90b9908d | 63 | do { \ |
a737b216 PE |
64 | char const *p; \ |
65 | for (p = Value; *p; p++) \ | |
66 | switch (*p) \ | |
a027c30d PE |
67 | { \ |
68 | case '$': obstack_sgrow (Obstack, "$]["); break; \ | |
69 | case '@': obstack_sgrow (Obstack, "@@" ); break; \ | |
70 | case '[': obstack_sgrow (Obstack, "@{" ); break; \ | |
71 | case ']': obstack_sgrow (Obstack, "@}" ); break; \ | |
a737b216 | 72 | default: obstack_1grow (Obstack, *p); break; \ |
a027c30d | 73 | } \ |
90b9908d | 74 | } while(0) |
a027c30d PE |
75 | |
76 | #define MUSCLE_INSERT_C_STRING(Key, Value) \ | |
90b9908d | 77 | do { \ |
a027c30d PE |
78 | MUSCLE_OBSTACK_SGROW (&muscle_obstack, \ |
79 | quotearg_style (c_quoting_style, \ | |
80 | Value)); \ | |
ae7453f2 AD |
81 | obstack_1grow (&muscle_obstack, 0); \ |
82 | muscle_insert (Key, obstack_finish (&muscle_obstack)); \ | |
90b9908d | 83 | } while(0) |
9b3add5b | 84 | |
50a33993 JD |
85 | /* Append VALUE to the current value of KEY. If KEY did not already |
86 | exist, create it. Use MUSCLE_OBSTACK. De-allocate the previously | |
87 | associated value. Copy VALUE and SEPARATOR. */ | |
ae7453f2 | 88 | |
d33cb3ae | 89 | void muscle_grow (const char *key, const char *value, const char *separator); |
ae7453f2 | 90 | |
cd3684cf AD |
91 | |
92 | /* Append VALUE to the current value of KEY, using muscle_grow. But | |
93 | in addition, issue a synchronization line for the location LOC. */ | |
94 | ||
95 | void muscle_code_grow (const char *key, const char *value, location loc); | |
96 | ||
97 | ||
ae7453f2 AD |
98 | /* MUSCLE is an M4 list of pairs. Create or extend it with the pair |
99 | (A1, A2). Note that because the muscle values are output *double* | |
100 | quoted, one needs to strip the first level of quotes to reach the | |
101 | list itself. */ | |
102 | ||
d33cb3ae PE |
103 | void muscle_pair_list_grow (const char *muscle, |
104 | const char *a1, const char *a2); | |
be2a1a68 | 105 | |
d33cb3ae | 106 | void muscles_m4_output (FILE *out); |
be2a1a68 | 107 | |
f753cd62 | 108 | #endif /* not MUSCLE_TAB_H_ */ |