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