]>
Commit | Line | Data |
---|---|---|
ae7453f2 | 1 | /* Muscle table manager for Bison, |
beda758b | 2 | Copyright (C) 2001, 2002 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 | |
18 | the Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
19 | Boston, MA 02111-1307, USA. */ | |
20 | ||
f753cd62 MA |
21 | #include "system.h" |
22 | #include "hash.h" | |
23 | #include "files.h" | |
24 | #include "muscle_tab.h" | |
f508cb0a | 25 | #include "getargs.h" |
f753cd62 | 26 | |
592e8d4d AD |
27 | |
28 | /* An obstack used to create some entries. */ | |
29 | struct obstack muscle_obstack; | |
30 | ||
beda758b AD |
31 | /* Initial capacity of muscles hash table. */ |
32 | #define HT_INITIAL_CAPACITY 257 | |
f753cd62 | 33 | |
beda758b | 34 | struct hash_table *muscle_table = NULL; |
f753cd62 | 35 | |
beda758b AD |
36 | static bool |
37 | hash_compare_muscles (void const *x, void const *y) | |
f753cd62 | 38 | { |
beda758b AD |
39 | const muscle_entry_t *m1 = x; |
40 | const muscle_entry_t *m2 = y; | |
41 | return strcmp (m1->key, m2->key) ? FALSE : TRUE; | |
f753cd62 MA |
42 | } |
43 | ||
beda758b AD |
44 | static unsigned int |
45 | hash_muscle (const void *x, unsigned int tablesize) | |
f753cd62 | 46 | { |
beda758b AD |
47 | const muscle_entry_t *m = x; |
48 | return hash_string (m->key, tablesize); | |
f753cd62 MA |
49 | } |
50 | ||
592e8d4d AD |
51 | /*-----------------------------------------------------------------. |
52 | | Create the MUSCLE_TABLE, and initialize it with default values. | | |
53 | | Also set up the MUSCLE_OBSTACK. | | |
54 | `-----------------------------------------------------------------*/ | |
55 | ||
f753cd62 MA |
56 | void |
57 | muscle_init (void) | |
58 | { | |
ae7453f2 AD |
59 | /* Initialize the muscle obstack. */ |
60 | obstack_init (&muscle_obstack); | |
61 | ||
beda758b | 62 | muscle_table = hash_initialize (HT_INITIAL_CAPACITY, NULL, hash_muscle, |
592e8d4d | 63 | hash_compare_muscles, free); |
f753cd62 MA |
64 | |
65 | /* Version and input file. */ | |
ae7453f2 AD |
66 | MUSCLE_INSERT_STRING ("version", VERSION); |
67 | MUSCLE_INSERT_STRING ("filename", infile); | |
f753cd62 | 68 | |
592e8d4d AD |
69 | /* FIXME: there should probably be no default here, only in the |
70 | skeletons. */ | |
71 | ||
25b222fa | 72 | /* Default #line formatting. */ |
ae7453f2 | 73 | MUSCLE_INSERT_STRING ("linef", "#line %d %s\n"); |
f753cd62 MA |
74 | } |
75 | ||
592e8d4d AD |
76 | |
77 | /*------------------------------------------------------------. | |
78 | | Free all the memory consumed by the muscle machinery only. | | |
79 | `------------------------------------------------------------*/ | |
80 | ||
81 | void | |
82 | muscle_free (void) | |
83 | { | |
84 | hash_free (muscle_table); | |
85 | obstack_free (&muscle_obstack, NULL); | |
86 | } | |
87 | ||
88 | ||
89 | ||
ae7453f2 AD |
90 | /*------------------------------------------------------------. |
91 | | Insert (KEY, VALUE). If KEY already existed, overwrite the | | |
92 | | previous value. | | |
93 | `------------------------------------------------------------*/ | |
94 | ||
a870c567 | 95 | void |
ae7453f2 | 96 | muscle_insert (const char *key, char *value) |
f753cd62 | 97 | { |
ae7453f2 | 98 | muscle_entry_t probe; |
e9bca3ad AD |
99 | muscle_entry_t *entry = NULL; |
100 | ||
ae7453f2 AD |
101 | probe.key = key; |
102 | entry = hash_lookup (muscle_table, &probe); | |
beda758b AD |
103 | |
104 | if (!entry) | |
105 | { | |
106 | /* First insertion in the hash. */ | |
107 | entry = XMALLOC (muscle_entry_t, 1); | |
108 | entry->key = key; | |
109 | hash_insert (muscle_table, entry); | |
110 | } | |
111 | entry->value = value; | |
f753cd62 MA |
112 | } |
113 | ||
ae7453f2 AD |
114 | |
115 | /*-------------------------------------------------------------------. | |
116 | | Insert (KEY, VALUE). If KEY already existed, overwrite the | | |
117 | | previous value. Uses MUSCLE_OBSTACK. De-allocates the previously | | |
118 | | associated value. VALUE and SEPARATOR are copied. | | |
119 | `-------------------------------------------------------------------*/ | |
120 | ||
121 | void | |
122 | muscle_grow (const char *key, const char *val, const char *separator) | |
123 | { | |
124 | muscle_entry_t probe; | |
125 | muscle_entry_t *entry = NULL; | |
126 | ||
127 | probe.key = key; | |
128 | entry = hash_lookup (muscle_table, &probe); | |
129 | ||
130 | if (!entry) | |
131 | { | |
132 | /* First insertion in the hash. */ | |
133 | entry = XMALLOC (muscle_entry_t, 1); | |
134 | entry->key = key; | |
135 | hash_insert (muscle_table, entry); | |
136 | entry->value = xstrdup (val); | |
137 | } | |
138 | else | |
139 | { | |
140 | /* Grow the current value. */ | |
141 | char *new_val; | |
ae7453f2 AD |
142 | obstack_sgrow (&muscle_obstack, entry->value); |
143 | free (entry->value); | |
144 | obstack_sgrow (&muscle_obstack, separator); | |
145 | obstack_sgrow (&muscle_obstack, val); | |
146 | obstack_1grow (&muscle_obstack, 0); | |
147 | new_val = obstack_finish (&muscle_obstack); | |
148 | entry->value = xstrdup (new_val); | |
ae7453f2 AD |
149 | obstack_free (&muscle_obstack, new_val); |
150 | } | |
151 | } | |
152 | ||
153 | ||
154 | /*-------------------------------------------------------------------. | |
155 | | MUSCLE is an M4 list of pairs. Create or extend it with the pair | | |
156 | | (A1, A2). Note that because the muscle values are output *double* | | |
157 | | quoted, one needs to strip the first level of quotes to reach the | | |
158 | | list itself. | | |
159 | `-------------------------------------------------------------------*/ | |
160 | ||
161 | void muscle_pair_list_grow (const char *muscle, | |
162 | const char *a1, const char *a2) | |
163 | { | |
66d30cd4 | 164 | char *pair; |
ae7453f2 AD |
165 | obstack_fgrow2 (&muscle_obstack, "[[[%s]], [[%s]]]", a1, a2); |
166 | obstack_1grow (&muscle_obstack, 0); | |
66d30cd4 AD |
167 | pair = obstack_finish (&muscle_obstack); |
168 | muscle_grow (muscle, pair, ",\n"); | |
169 | obstack_free (&muscle_obstack, pair); | |
ae7453f2 AD |
170 | } |
171 | ||
172 | /*-------------------------------. | |
173 | | Find the value of muscle KEY. | | |
174 | `-------------------------------*/ | |
175 | ||
176 | char* | |
f753cd62 MA |
177 | muscle_find (const char *key) |
178 | { | |
ae7453f2 | 179 | muscle_entry_t probe; |
e9bca3ad AD |
180 | muscle_entry_t *result = NULL; |
181 | ||
ae7453f2 AD |
182 | probe.key = key; |
183 | result = hash_lookup (muscle_table, &probe); | |
beda758b | 184 | return result ? result->value : NULL; |
f753cd62 | 185 | } |
be2a1a68 AD |
186 | |
187 | ||
ae7453f2 AD |
188 | /*------------------------------------------------. |
189 | | Output the definition of ENTRY as a m4_define. | | |
190 | `------------------------------------------------*/ | |
be2a1a68 | 191 | |
cfaee611 | 192 | static int |
be2a1a68 AD |
193 | muscle_m4_output (muscle_entry_t *entry, FILE *out) |
194 | { | |
195 | fprintf (out, "m4_define([b4_%s],\n", entry->key); | |
ae7453f2 | 196 | fprintf (out, "[[%s]])\n\n\n", entry->value); |
cfaee611 | 197 | return 1; |
be2a1a68 AD |
198 | } |
199 | ||
200 | ||
ae7453f2 AD |
201 | /*----------------------------------------------------------------. |
202 | | Output the definition of all the current muscles into a list of | | |
203 | | m4_defines. | | |
204 | `----------------------------------------------------------------*/ | |
be2a1a68 AD |
205 | |
206 | void | |
207 | muscles_m4_output (FILE *out) | |
208 | { | |
209 | hash_do_for_each (muscle_table, | |
210 | (Hash_processor) muscle_m4_output, | |
211 | out); | |
212 | } |