]>
Commit | Line | Data |
---|---|---|
a932883e | 1 | /* Output the generated parsing program for Bison. |
87ceef73 | 2 | |
1462fcee JD |
3 | Copyright (C) 1984, 1986, 1989, 1992, 2000-2010 Free Software |
4 | Foundation, Inc. | |
c3e23647 | 5 | |
9ee3c97b | 6 | This file is part of Bison, the GNU Compiler Compiler. |
c3e23647 | 7 | |
f16b0819 PE |
8 | This program 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 3 of the License, or | |
11 | (at your option) any later version. | |
c3e23647 | 12 | |
f16b0819 PE |
13 | This program 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. | |
c3e23647 | 17 | |
9ee3c97b | 18 | You should have received a copy of the GNU General Public License |
f16b0819 | 19 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c3e23647 | 20 | |
2cec9080 | 21 | #include <config.h> |
c3e23647 | 22 | #include "system.h" |
21fd22d6 | 23 | |
3b2942e6 | 24 | #include <configmake.h> |
21fd22d6 PE |
25 | #include <error.h> |
26 | #include <get-errno.h> | |
47fa5747 | 27 | #include <pipe.h> |
21fd22d6 | 28 | #include <quotearg.h> |
21fd22d6 | 29 | #include <timevar.h> |
47fa5747 | 30 | #include <wait-process.h> |
21fd22d6 PE |
31 | |
32 | #include "complain.h" | |
c3e23647 | 33 | #include "files.h" |
21fd22d6 | 34 | #include "getargs.h" |
c3e23647 | 35 | #include "gram.h" |
23ec25b7 | 36 | #include "muscle-tab.h" |
6c89f1c1 | 37 | #include "output.h" |
a70083a3 | 38 | #include "reader.h" |
e9071366 | 39 | #include "scan-code.h" /* max_left_semantic_context */ |
04098407 | 40 | #include "scan-skel.h" |
ad949da9 | 41 | #include "symtab.h" |
c6f1a33c | 42 | #include "tables.h" |
be2a1a68 | 43 | |
aa50ba7b | 44 | # define ARRAY_CARDINALITY(Array) (sizeof (Array) / sizeof *(Array)) |
12b0043a | 45 | |
f87685c3 | 46 | static struct obstack format_obstack; |
c3e23647 | 47 | |
133c20e2 | 48 | |
5372019f AD |
49 | /*-------------------------------------------------------------------. |
50 | | Create a function NAME which associates to the muscle NAME the | | |
51 | | result of formatting the FIRST and then TABLE_DATA[BEGIN..END[ (of | | |
52 | | TYPE), and to the muscle NAME_max, the max value of the | | |
53 | | TABLE_DATA. | | |
54 | `-------------------------------------------------------------------*/ | |
62a3e4f0 | 55 | |
62a3e4f0 | 56 | |
5372019f | 57 | #define GENERATE_MUSCLE_INSERT_TABLE(Name, Type) \ |
5fbb0954 | 58 | \ |
5372019f | 59 | static void \ |
9e0876fb | 60 | Name (char const *name, \ |
5fbb0954 AD |
61 | Type *table_data, \ |
62 | Type first, \ | |
63 | int begin, \ | |
64 | int end) \ | |
65 | { \ | |
12b0043a | 66 | Type min = first; \ |
0c2d3f4c | 67 | Type max = first; \ |
87ceef73 PE |
68 | long int lmin; \ |
69 | long int lmax; \ | |
5fbb0954 AD |
70 | int i; \ |
71 | int j = 1; \ | |
72 | \ | |
5372019f | 73 | obstack_fgrow1 (&format_obstack, "%6d", first); \ |
5fbb0954 AD |
74 | for (i = begin; i < end; ++i) \ |
75 | { \ | |
5372019f | 76 | obstack_1grow (&format_obstack, ','); \ |
5fbb0954 AD |
77 | if (j >= 10) \ |
78 | { \ | |
5372019f | 79 | obstack_sgrow (&format_obstack, "\n "); \ |
5fbb0954 AD |
80 | j = 1; \ |
81 | } \ | |
82 | else \ | |
83 | ++j; \ | |
5372019f | 84 | obstack_fgrow1 (&format_obstack, "%6d", table_data[i]); \ |
12b0043a AD |
85 | if (table_data[i] < min) \ |
86 | min = table_data[i]; \ | |
87 | if (max < table_data[i]) \ | |
5fbb0954 AD |
88 | max = table_data[i]; \ |
89 | } \ | |
5372019f AD |
90 | obstack_1grow (&format_obstack, 0); \ |
91 | muscle_insert (name, obstack_finish (&format_obstack)); \ | |
5fbb0954 | 92 | \ |
87ceef73 PE |
93 | lmin = min; \ |
94 | lmax = max; \ | |
12b0043a AD |
95 | /* Build `NAME_min' and `NAME_max' in the obstack. */ \ |
96 | obstack_fgrow1 (&format_obstack, "%s_min", name); \ | |
97 | obstack_1grow (&format_obstack, 0); \ | |
87ceef73 | 98 | MUSCLE_INSERT_LONG_INT (obstack_finish (&format_obstack), lmin); \ |
5372019f AD |
99 | obstack_fgrow1 (&format_obstack, "%s_max", name); \ |
100 | obstack_1grow (&format_obstack, 0); \ | |
87ceef73 | 101 | MUSCLE_INSERT_LONG_INT (obstack_finish (&format_obstack), lmax); \ |
62a3e4f0 AD |
102 | } |
103 | ||
5372019f | 104 | GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_unsigned_int_table, unsigned int) |
12b0043a | 105 | GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_int_table, int) |
21fd22d6 PE |
106 | GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_base_table, base_number) |
107 | GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_rule_number_table, rule_number) | |
108 | GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_symbol_number_table, symbol_number) | |
109 | GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_item_number_table, item_number) | |
110 | GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_state_number_table, state_number) | |
c3e23647 RS |
111 | |
112 | ||
05ac60f3 PE |
113 | /*--------------------------------------------------------------------. |
114 | | Print to OUT a representation of STRING escaped both for C and M4. | | |
115 | `--------------------------------------------------------------------*/ | |
3813e141 PE |
116 | |
117 | static void | |
05ac60f3 | 118 | escaped_output (FILE *out, char const *string) |
3813e141 PE |
119 | { |
120 | char const *p; | |
2f4f028d | 121 | fprintf (out, "[["); |
3813e141 | 122 | |
05ac60f3 | 123 | for (p = quotearg_style (c_quoting_style, string); *p; p++) |
3813e141 PE |
124 | switch (*p) |
125 | { | |
126 | case '$': fputs ("$][", out); break; | |
127 | case '@': fputs ("@@", out); break; | |
128 | case '[': fputs ("@{", out); break; | |
129 | case ']': fputs ("@}", out); break; | |
130 | default: fputc (*p, out); break; | |
131 | } | |
132 | ||
2f4f028d | 133 | fprintf (out, "]]"); |
3813e141 PE |
134 | } |
135 | ||
136 | ||
39912f52 AD |
137 | /*------------------------------------------------------------------. |
138 | | Prepare the muscles related to the symbols: translate, tname, and | | |
139 | | toknum. | | |
140 | `------------------------------------------------------------------*/ | |
b0940840 | 141 | |
4a120d45 | 142 | static void |
39912f52 | 143 | prepare_symbols (void) |
c3e23647 | 144 | { |
141f5793 | 145 | MUSCLE_INSERT_BOOL ("token_table", token_table_flag); |
39912f52 AD |
146 | MUSCLE_INSERT_INT ("tokens_number", ntokens); |
147 | MUSCLE_INSERT_INT ("nterms_number", nvars); | |
148 | MUSCLE_INSERT_INT ("undef_token_number", undeftoken->number); | |
149 | MUSCLE_INSERT_INT ("user_token_number_max", max_user_token_number); | |
150 | ||
a49aecd5 | 151 | muscle_insert_symbol_number_table ("translate", |
fc5734fe AD |
152 | token_translations, |
153 | token_translations[0], | |
154 | 1, max_user_token_number + 1); | |
c3e23647 | 155 | |
39912f52 | 156 | /* tname -- token names. */ |
b0940840 AD |
157 | { |
158 | int i; | |
d423d460 AD |
159 | /* We assume that the table will be output starting at column 2. */ |
160 | int j = 2; | |
1cfe6375 JD |
161 | struct quoting_options *qo = clone_quoting_options (0); |
162 | set_quoting_style (qo, c_quoting_style); | |
163 | set_quoting_flags (qo, QA_SPLIT_TRIGRAPHS); | |
b0940840 AD |
164 | for (i = 0; i < nsyms; i++) |
165 | { | |
1cfe6375 | 166 | char *cp = quotearg_alloc (symbols[i]->tag, -1, qo); |
d423d460 AD |
167 | /* Width of the next token, including the two quotes, the |
168 | comma and the space. */ | |
21fd22d6 | 169 | int width = strlen (cp) + 2; |
b0940840 | 170 | |
21fd22d6 | 171 | if (j + width > 75) |
b0940840 | 172 | { |
d423d460 AD |
173 | obstack_sgrow (&format_obstack, "\n "); |
174 | j = 1; | |
b0940840 AD |
175 | } |
176 | ||
d423d460 AD |
177 | if (i) |
178 | obstack_1grow (&format_obstack, ' '); | |
3813e141 | 179 | MUSCLE_OBSTACK_SGROW (&format_obstack, cp); |
1cfe6375 | 180 | free (cp); |
d423d460 | 181 | obstack_1grow (&format_obstack, ','); |
21fd22d6 | 182 | j += width; |
b0940840 | 183 | } |
1cfe6375 | 184 | free (qo); |
8e1687ae | 185 | obstack_sgrow (&format_obstack, " ]b4_null["); |
c3e23647 | 186 | |
b0940840 AD |
187 | /* Finish table and store. */ |
188 | obstack_1grow (&format_obstack, 0); | |
189 | muscle_insert ("tname", obstack_finish (&format_obstack)); | |
190 | } | |
191 | ||
12b0043a | 192 | /* Output YYTOKNUM. */ |
b2ed6e58 AD |
193 | { |
194 | int i; | |
da2a7671 | 195 | int *values = xnmalloc (ntokens, sizeof *values); |
3650b4b8 | 196 | for (i = 0; i < ntokens; ++i) |
b0940840 | 197 | values[i] = symbols[i]->user_token_number; |
12b0043a | 198 | muscle_insert_int_table ("toknum", values, |
3650b4b8 | 199 | values[0], 1, ntokens); |
b0940840 | 200 | free (values); |
b2ed6e58 | 201 | } |
b0940840 | 202 | } |
b2ed6e58 | 203 | |
b0940840 AD |
204 | |
205 | /*-------------------------------------------------------------. | |
206 | | Prepare the muscles related to the rules: rhs, prhs, r1, r2, | | |
95612cfa | 207 | | rline, dprec, merger. | |
b0940840 AD |
208 | `-------------------------------------------------------------*/ |
209 | ||
210 | static void | |
211 | prepare_rules (void) | |
212 | { | |
21fd22d6 | 213 | rule_number r; |
5df5f6d5 | 214 | unsigned int i = 0; |
da2a7671 PE |
215 | item_number *rhs = xnmalloc (nritems, sizeof *rhs); |
216 | unsigned int *prhs = xnmalloc (nrules, sizeof *prhs); | |
217 | unsigned int *rline = xnmalloc (nrules, sizeof *rline); | |
218 | symbol_number *r1 = xnmalloc (nrules, sizeof *r1); | |
219 | unsigned int *r2 = xnmalloc (nrules, sizeof *r2); | |
f6fbd3da PE |
220 | int *dprec = xnmalloc (nrules, sizeof *dprec); |
221 | int *merger = xnmalloc (nrules, sizeof *merger); | |
4b3d3a8e AD |
222 | |
223 | for (r = 0; r < nrules; ++r) | |
b0940840 | 224 | { |
21fd22d6 | 225 | item_number *rhsp = NULL; |
b0940840 AD |
226 | /* Index of rule R in RHS. */ |
227 | prhs[r] = i; | |
228 | /* RHS of the rule R. */ | |
229 | for (rhsp = rules[r].rhs; *rhsp >= 0; ++rhsp) | |
230 | rhs[i++] = *rhsp; | |
231 | /* LHS of the rule R. */ | |
232 | r1[r] = rules[r].lhs->number; | |
233 | /* Length of rule R's RHS. */ | |
234 | r2[r] = i - prhs[r]; | |
235 | /* Separator in RHS. */ | |
236 | rhs[i++] = -1; | |
237 | /* Line where rule was defined. */ | |
2073702c | 238 | rline[r] = rules[r].location.start.line; |
95612cfa | 239 | /* Dynamic precedence (GLR). */ |
676385e2 | 240 | dprec[r] = rules[r].dprec; |
95612cfa | 241 | /* Merger-function index (GLR). */ |
676385e2 | 242 | merger[r] = rules[r].merger; |
b0940840 | 243 | } |
4f82b42a | 244 | aver (i == nritems); |
b0940840 | 245 | |
5372019f | 246 | muscle_insert_item_number_table ("rhs", rhs, ritem[0], 1, nritems); |
4b3d3a8e AD |
247 | muscle_insert_unsigned_int_table ("prhs", prhs, 0, 0, nrules); |
248 | muscle_insert_unsigned_int_table ("rline", rline, 0, 0, nrules); | |
249 | muscle_insert_symbol_number_table ("r1", r1, 0, 0, nrules); | |
250 | muscle_insert_unsigned_int_table ("r2", r2, 0, 0, nrules); | |
f6fbd3da PE |
251 | muscle_insert_int_table ("dprec", dprec, 0, 0, nrules); |
252 | muscle_insert_int_table ("merger", merger, 0, 0, nrules); | |
796d61fb | 253 | |
39912f52 | 254 | MUSCLE_INSERT_INT ("rules_number", nrules); |
25005f6a | 255 | MUSCLE_INSERT_INT ("max_left_semantic_context", max_left_semantic_context); |
39912f52 | 256 | |
b0940840 AD |
257 | free (rhs); |
258 | free (prhs); | |
5df5f6d5 AD |
259 | free (rline); |
260 | free (r1); | |
b0940840 | 261 | free (r2); |
676385e2 PH |
262 | free (dprec); |
263 | free (merger); | |
c3e23647 RS |
264 | } |
265 | ||
b0940840 AD |
266 | /*--------------------------------------------. |
267 | | Prepare the muscles related to the states. | | |
268 | `--------------------------------------------*/ | |
c3e23647 | 269 | |
4a120d45 | 270 | static void |
b0940840 | 271 | prepare_states (void) |
c3e23647 | 272 | { |
21fd22d6 | 273 | state_number i; |
da2a7671 | 274 | symbol_number *values = xnmalloc (nstates, sizeof *values); |
9703cc49 | 275 | for (i = 0; i < nstates; ++i) |
29e88316 | 276 | values[i] = states[i]->accessing_symbol; |
a49aecd5 | 277 | muscle_insert_symbol_number_table ("stos", values, |
d57650a5 | 278 | 0, 1, nstates); |
87ceef73 | 279 | free (values); |
39912f52 AD |
280 | |
281 | MUSCLE_INSERT_INT ("last", high); | |
282 | MUSCLE_INSERT_INT ("final_state_number", final_state->number); | |
283 | MUSCLE_INSERT_INT ("states_number", nstates); | |
c3e23647 RS |
284 | } |
285 | ||
286 | ||
c3e23647 | 287 | |
bb33f19a PE |
288 | /*---------------------------------. |
289 | | Output the user actions to OUT. | | |
290 | `---------------------------------*/ | |
12b0043a | 291 | |
4a120d45 | 292 | static void |
c6f1a33c | 293 | user_actions_output (FILE *out) |
3f96f4dc | 294 | { |
21fd22d6 | 295 | rule_number r; |
dafdc66f | 296 | |
8e1687ae | 297 | fputs ("m4_define([b4_actions], \n[", out); |
4b3d3a8e | 298 | for (r = 0; r < nrules; ++r) |
9222837b | 299 | if (rules[r].action) |
3f96f4dc | 300 | { |
8e1687ae | 301 | fprintf (out, "b4_case(%d, [b4_syncline(%d, ", r + 1, |
2073702c | 302 | rules[r].action_location.start.line); |
05ac60f3 | 303 | escaped_output (out, rules[r].action_location.start.file); |
8e1687ae | 304 | fprintf (out, ")\n[ %s]])\n\n", rules[r].action); |
3f96f4dc | 305 | } |
8e1687ae | 306 | fputs ("])\n\n", out); |
3f96f4dc AD |
307 | } |
308 | ||
676385e2 PH |
309 | /*--------------------------------------. |
310 | | Output the merge functions to OUT. | | |
311 | `--------------------------------------*/ | |
312 | ||
41442480 | 313 | static void |
676385e2 PH |
314 | merger_output (FILE *out) |
315 | { | |
316 | int n; | |
317 | merger_list* p; | |
318 | ||
319 | fputs ("m4_define([b4_mergers], \n[[", out); | |
e0e5bf84 | 320 | for (n = 1, p = merge_functions; p != NULL; n += 1, p = p->next) |
676385e2 | 321 | { |
e0e5bf84 | 322 | if (p->type[0] == '\0') |
16caa4f4 | 323 | fprintf (out, " case %d: *yy0 = %s (*yy0, *yy1); break;\n", |
676385e2 PH |
324 | n, p->name); |
325 | else | |
16caa4f4 | 326 | fprintf (out, " case %d: yy0->%s = %s (*yy0, *yy1); break;\n", |
676385e2 PH |
327 | n, p->type, p->name); |
328 | } | |
329 | fputs ("]])\n\n", out); | |
330 | } | |
3f96f4dc | 331 | |
ae7453f2 AD |
332 | /*--------------------------------------. |
333 | | Output the tokens definition to OUT. | | |
334 | `--------------------------------------*/ | |
091e20bb | 335 | |
c6f1a33c | 336 | static void |
be2a1a68 | 337 | token_definitions_output (FILE *out) |
091e20bb AD |
338 | { |
339 | int i; | |
d0829076 | 340 | char const *sep = ""; |
dafdc66f AD |
341 | |
342 | fputs ("m4_define([b4_tokens], \n[", out); | |
091e20bb AD |
343 | for (i = 0; i < ntokens; ++i) |
344 | { | |
21fd22d6 PE |
345 | symbol *sym = symbols[i]; |
346 | int number = sym->user_token_number; | |
091e20bb | 347 | |
07c0db18 JD |
348 | /* At this stage, if there are literal string aliases, they are |
349 | part of SYMBOLS, so we should not find their aliased symbols | |
350 | here. */ | |
351 | aver (number != USER_NUMBER_HAS_STRING_ALIAS); | |
b87f8b21 | 352 | |
091e20bb | 353 | /* Skip error token. */ |
21fd22d6 | 354 | if (sym == errtoken) |
091e20bb | 355 | continue; |
b87f8b21 AD |
356 | |
357 | /* If this string has an alias, then it is necessarily the alias | |
358 | which is to be output. */ | |
21fd22d6 PE |
359 | if (sym->alias) |
360 | sym = sym->alias; | |
b87f8b21 AD |
361 | |
362 | /* Don't output literal chars or strings (when defined only as a | |
363 | string). Note that must be done after the alias resolution: | |
364 | think about `%token 'f' "f"'. */ | |
21fd22d6 | 365 | if (sym->tag[0] == '\'' || sym->tag[0] == '\"') |
b87f8b21 | 366 | continue; |
091e20bb | 367 | |
663ce7bb AD |
368 | /* Don't #define nonliteral tokens whose names contain periods, |
369 | dashes or '$' (as does the default value of the EOF token). */ | |
370 | if (strchr (sym->tag, '.') | |
371 | || strchr (sym->tag, '-') | |
372 | || strchr (sym->tag, '$')) | |
091e20bb AD |
373 | continue; |
374 | ||
05ac60f3 | 375 | fprintf (out, "%s[[[%s]], %d]", |
d0829076 PE |
376 | sep, sym->tag, number); |
377 | sep = ",\n"; | |
091e20bb | 378 | } |
dafdc66f | 379 | fputs ("])\n\n", out); |
091e20bb AD |
380 | } |
381 | ||
382 | ||
95021767 JD |
383 | /*---------------------------------------------------. |
384 | | Output the symbol destructors or printers to OUT. | | |
385 | `---------------------------------------------------*/ | |
9280d3ef AD |
386 | |
387 | static void | |
95021767 JD |
388 | symbol_code_props_output (FILE *out, char const *what, |
389 | code_props const *(*get)(symbol const *)) | |
9280d3ef AD |
390 | { |
391 | int i; | |
d0829076 | 392 | char const *sep = ""; |
9280d3ef | 393 | |
95021767 JD |
394 | fputs ("m4_define([b4_symbol_", out); |
395 | fputs (what, out); | |
396 | fputs ("], \n[", out); | |
9280d3ef | 397 | for (i = 0; i < nsyms; ++i) |
95021767 JD |
398 | { |
399 | symbol *sym = symbols[i]; | |
400 | char const *code = (*get) (sym)->code; | |
401 | if (code) | |
402 | { | |
403 | location loc = (*get) (sym)->location; | |
404 | /* Filename, lineno, | |
405 | Symbol-name, Symbol-number, | |
406 | code, optional typename. */ | |
407 | fprintf (out, "%s[", sep); | |
408 | sep = ",\n"; | |
409 | escaped_output (out, loc.start.file); | |
410 | fprintf (out, ", %d, ", loc.start.line); | |
411 | escaped_output (out, sym->tag); | |
412 | fprintf (out, ", %d, [[%s]]", sym->number, code); | |
413 | if (sym->type_name) | |
414 | fprintf (out, ", [[%s]]", sym->type_name); | |
415 | fputc (']', out); | |
416 | } | |
417 | } | |
366eea36 AD |
418 | fputs ("])\n\n", out); |
419 | } | |
420 | ||
421 | ||
4a120d45 | 422 | static void |
c6f1a33c | 423 | prepare_actions (void) |
6c89f1c1 | 424 | { |
c6f1a33c | 425 | /* Figure out the actions for the specified state, indexed by |
742e4900 | 426 | lookahead token type. */ |
bbb5bcc6 | 427 | |
c6f1a33c AD |
428 | muscle_insert_rule_number_table ("defact", yydefact, |
429 | yydefact[0], 1, nstates); | |
6c89f1c1 | 430 | |
c6f1a33c AD |
431 | /* Figure out what to do after reducing with each rule, depending on |
432 | the saved state from before the beginning of parsing the data | |
433 | that matched this rule. */ | |
d57650a5 AD |
434 | muscle_insert_state_number_table ("defgoto", yydefgoto, |
435 | yydefgoto[0], 1, nsyms - ntokens); | |
12b0043a | 436 | |
12b0043a | 437 | |
12b0043a AD |
438 | /* Output PACT. */ |
439 | muscle_insert_base_table ("pact", base, | |
5372019f | 440 | base[0], 1, nstates); |
12b0043a | 441 | MUSCLE_INSERT_INT ("pact_ninf", base_ninf); |
c3e23647 | 442 | |
12b0043a AD |
443 | /* Output PGOTO. */ |
444 | muscle_insert_base_table ("pgoto", base, | |
5372019f | 445 | base[nstates], nstates + 1, nvectors); |
c3e23647 | 446 | |
12b0043a AD |
447 | muscle_insert_base_table ("table", table, |
448 | table[0], 1, high + 1); | |
449 | MUSCLE_INSERT_INT ("table_ninf", table_ninf); | |
676385e2 | 450 | |
12b0043a AD |
451 | muscle_insert_base_table ("check", check, |
452 | check[0], 1, high + 1); | |
c3e23647 | 453 | |
ea99527d AD |
454 | /* GLR parsing slightly modifies YYTABLE and YYCHECK (and thus |
455 | YYPACT) so that in states with unresolved conflicts, the default | |
456 | reduction is not used in the conflicted entries, so that there is | |
457 | a place to put a conflict pointer. | |
458 | ||
459 | This means that YYCONFLP and YYCONFL are nonsense for a non-GLR | |
460 | parser, so we could avoid accidents by not writing them out in | |
461 | that case. Nevertheless, it seems even better to be able to use | |
462 | the GLR skeletons even without the non-deterministic tables. */ | |
463 | muscle_insert_unsigned_int_table ("conflict_list_heads", conflict_table, | |
39912f52 | 464 | conflict_table[0], 1, high + 1); |
ea99527d | 465 | muscle_insert_unsigned_int_table ("conflicting_rules", conflict_list, |
da2a7671 | 466 | 0, 1, conflict_list_cnt); |
6c89f1c1 | 467 | } |
c3e23647 | 468 | |
96002de2 AD |
469 | /*--------------------------------------------. |
470 | | Output the definitions of all the muscles. | | |
471 | `--------------------------------------------*/ | |
472 | ||
473 | static void | |
474 | muscles_output (FILE *out) | |
475 | { | |
476 | fputs ("m4_init()\n", out); | |
477 | ||
478 | user_actions_output (out); | |
479 | merger_output (out); | |
480 | token_definitions_output (out); | |
481 | symbol_code_props_output (out, "destructors", &symbol_destructor_get); | |
482 | symbol_code_props_output (out, "printers", &symbol_printer_get); | |
483 | ||
484 | muscles_m4_output (out); | |
485 | } | |
652def80 | 486 | \f |
1239777d AD |
487 | /*---------------------------. |
488 | | Call the skeleton parser. | | |
489 | `---------------------------*/ | |
c3e23647 | 490 | |
4a120d45 | 491 | static void |
1239777d | 492 | output_skeleton (void) |
9b3add5b | 493 | { |
573312ac | 494 | FILE *in; |
573312ac | 495 | int filter_fd[2]; |
c5196098 | 496 | char const *argv[10]; |
573312ac PE |
497 | pid_t pid; |
498 | ||
a9fc7990 | 499 | /* Compute the names of the package data dir and skeleton files. */ |
573312ac | 500 | char const m4sugar[] = "m4sugar/m4sugar.m4"; |
90b9908d | 501 | char const m4bison[] = "bison.m4"; |
2fd4e131 | 502 | char *full_m4sugar; |
90b9908d | 503 | char *full_m4bison; |
eecf08fe | 504 | char *full_skeleton; |
573312ac PE |
505 | char const *p; |
506 | char const *m4 = (p = getenv ("M4")) ? p : M4; | |
d4bd2295 | 507 | char const *pkgdatadir = compute_pkgdatadir (); |
573312ac PE |
508 | size_t skeleton_size = strlen (skeleton) + 1; |
509 | size_t pkgdatadirlen = strlen (pkgdatadir); | |
510 | while (pkgdatadirlen && pkgdatadir[pkgdatadirlen - 1] == '/') | |
511 | pkgdatadirlen--; | |
eecf08fe PE |
512 | full_skeleton = xmalloc (pkgdatadirlen + 1 |
513 | + (skeleton_size < sizeof m4sugar | |
514 | ? sizeof m4sugar : skeleton_size)); | |
a7867f53 | 515 | strncpy (full_skeleton, pkgdatadir, pkgdatadirlen); |
eecf08fe PE |
516 | full_skeleton[pkgdatadirlen] = '/'; |
517 | strcpy (full_skeleton + pkgdatadirlen + 1, m4sugar); | |
518 | full_m4sugar = xstrdup (full_skeleton); | |
90b9908d PB |
519 | strcpy (full_skeleton + pkgdatadirlen + 1, m4bison); |
520 | full_m4bison = xstrdup (full_skeleton); | |
a7867f53 JD |
521 | if (strchr (skeleton, '/')) |
522 | strcpy (full_skeleton, skeleton); | |
523 | else | |
524 | strcpy (full_skeleton + pkgdatadirlen + 1, skeleton); | |
a9fc7990 JD |
525 | |
526 | /* Test whether m4sugar.m4 is readable, to check for proper | |
527 | installation. A faulty installation can cause deadlock, so a | |
528 | cheap sanity check is worthwhile. */ | |
2fd4e131 | 529 | xfclose (xfopen (full_m4sugar, "r")); |
573312ac PE |
530 | |
531 | /* Create an m4 subprocess connected to us via two pipes. */ | |
532 | ||
533 | if (trace_flag & trace_tools) | |
90b9908d | 534 | fprintf (stderr, "running: %s %s - %s %s\n", |
a9fc7990 | 535 | m4, full_m4sugar, full_m4bison, full_skeleton); |
573312ac | 536 | |
a9fc7990 JD |
537 | /* Some future version of GNU M4 (most likely 1.6) may treat the -dV in a |
538 | position-dependent manner. Keep it as the first argument so that all | |
539 | files are traced. | |
573312ac | 540 | |
a9fc7990 JD |
541 | See the thread starting at |
542 | <http://lists.gnu.org/archive/html/bug-bison/2008-07/msg00000.html> | |
543 | for details. */ | |
544 | { | |
545 | int i = 0; | |
546 | argv[i++] = m4; | |
c5196098 EB |
547 | |
548 | /* When POSIXLY_CORRECT is set, GNU M4 1.6 and later disable GNU | |
549 | extensions, which Bison's skeletons depend on. With older M4, | |
550 | it has no effect. M4 1.4.12 added a -g/--gnu command-line | |
551 | option to make it explicit that a program wants GNU M4 | |
552 | extensions even when POSIXLY_CORRECT is set. | |
553 | ||
554 | See the thread starting at | |
555 | <http://lists.gnu.org/archive/html/bug-bison/2008-07/msg00000.html> | |
556 | for details. */ | |
557 | if (*M4_GNU_OPTION) | |
558 | argv[i++] = M4_GNU_OPTION; | |
559 | ||
d67c52e8 EB |
560 | argv[i++] = "-I"; |
561 | argv[i++] = pkgdatadir; | |
a9fc7990 JD |
562 | if (trace_flag & trace_m4) |
563 | argv[i++] = "-dV"; | |
564 | argv[i++] = full_m4sugar; | |
565 | argv[i++] = "-"; | |
566 | argv[i++] = full_m4bison; | |
567 | argv[i++] = full_skeleton; | |
568 | argv[i++] = NULL; | |
c842365a | 569 | aver (i <= ARRAY_CARDINALITY (argv)); |
a9fc7990 | 570 | } |
a9fc7990 | 571 | |
47fa5747 JD |
572 | /* The ugly cast is because gnulib gets the const-ness wrong. */ |
573 | pid = create_pipe_bidi ("m4", m4, (char **)(void*)argv, false, true, | |
574 | true, filter_fd); | |
2fd4e131 | 575 | free (full_m4sugar); |
a9fc7990 | 576 | free (full_m4bison); |
eecf08fe | 577 | free (full_skeleton); |
573312ac | 578 | |
c65e5292 AD |
579 | if (trace_flag & trace_muscles) |
580 | muscles_output (stderr); | |
581 | { | |
47fa5747 | 582 | FILE *out = fdopen (filter_fd[1], "w"); |
c65e5292 AD |
583 | if (! out) |
584 | error (EXIT_FAILURE, get_errno (), | |
585 | "fdopen"); | |
586 | muscles_output (out); | |
587 | xfclose (out); | |
588 | } | |
be2a1a68 | 589 | |
573312ac | 590 | /* Read and process m4's output. */ |
1509d42f | 591 | timevar_push (TV_M4); |
47fa5747 | 592 | in = fdopen (filter_fd[0], "r"); |
573312ac | 593 | if (! in) |
04098407 PE |
594 | error (EXIT_FAILURE, get_errno (), |
595 | "fdopen"); | |
573312ac | 596 | scan_skel (in); |
47fa5747 JD |
597 | /* scan_skel should have read all of M4's output. Otherwise, when we |
598 | close the pipe, we risk letting M4 report a broken-pipe to the | |
599 | Bison user. */ | |
600 | aver (feof (in)); | |
573312ac | 601 | xfclose (in); |
47fa5747 | 602 | wait_subprocess (pid, "m4", false, false, true, true, NULL); |
1509d42f | 603 | timevar_pop (TV_M4); |
26f609ff RA |
604 | } |
605 | ||
606 | static void | |
607 | prepare (void) | |
608 | { | |
945e396c JD |
609 | /* BISON_USE_PUSH_FOR_PULL is for the test suite and should not be documented |
610 | for the user. */ | |
611 | char const *use_push_for_pull_env = getenv ("BISON_USE_PUSH_FOR_PULL"); | |
612 | bool use_push_for_pull_flag = false; | |
613 | if (use_push_for_pull_env != NULL | |
614 | && use_push_for_pull_env[0] != '\0' | |
615 | && 0 != strcmp (use_push_for_pull_env, "0")) | |
616 | use_push_for_pull_flag = true; | |
617 | ||
7db2ed2d | 618 | /* Flags. */ |
327afc7c | 619 | MUSCLE_INSERT_BOOL ("debug_flag", debug_flag); |
d0829076 | 620 | MUSCLE_INSERT_BOOL ("defines_flag", defines_flag); |
327afc7c | 621 | MUSCLE_INSERT_BOOL ("error_verbose_flag", error_verbose); |
90b9908d | 622 | MUSCLE_INSERT_BOOL ("glr_flag", glr_parser); |
d0829076 | 623 | MUSCLE_INSERT_BOOL ("locations_flag", locations_flag); |
90b9908d | 624 | MUSCLE_INSERT_BOOL ("nondeterministic_flag", nondeterministic_parser); |
d0829076 | 625 | MUSCLE_INSERT_BOOL ("synclines_flag", !no_lines_flag); |
ddc8ede1 | 626 | MUSCLE_INSERT_BOOL ("tag_seen_flag", tag_seen); |
95021767 | 627 | MUSCLE_INSERT_BOOL ("use_push_for_pull_flag", use_push_for_pull_flag); |
b931235e | 628 | MUSCLE_INSERT_BOOL ("yacc_flag", yacc_flag); |
11d82f03 | 629 | |
573a6cd3 | 630 | /* File names. */ |
90b9908d PB |
631 | if (spec_name_prefix) |
632 | MUSCLE_INSERT_STRING ("prefix", spec_name_prefix); | |
633 | ||
bd9d212b JD |
634 | MUSCLE_INSERT_STRING ("file_name_all_but_ext", all_but_ext); |
635 | ||
2b81e969 AD |
636 | #define DEFINE(Name) MUSCLE_INSERT_STRING (#Name, Name ? Name : "") |
637 | DEFINE (dir_prefix); | |
638 | DEFINE (parser_file_name); | |
639 | DEFINE (spec_defines_file); | |
640 | DEFINE (spec_file_prefix); | |
641 | DEFINE (spec_graph_file); | |
642 | DEFINE (spec_name_prefix); | |
643 | DEFINE (spec_outfile); | |
644 | DEFINE (spec_verbose_file); | |
645 | #undef DEFINE | |
b85810ae | 646 | |
0e021770 PE |
647 | /* Find the right skeleton file, and add muscles about the skeletons. */ |
648 | if (skeleton) | |
649 | MUSCLE_INSERT_C_STRING ("skeleton", skeleton); | |
650 | else | |
651 | skeleton = language->skeleton; | |
381fb12e | 652 | |
0e021770 | 653 | /* About the skeletons. */ |
cf147260 | 654 | { |
bd9d212b JD |
655 | /* b4_pkgdatadir is used inside m4_include in the skeletons, so digraphs |
656 | would never be expanded. Hopefully no one has M4-special characters in | |
657 | his Bison installation path. */ | |
d4bd2295 | 658 | MUSCLE_INSERT_STRING_RAW ("pkgdatadir", compute_pkgdatadir ()); |
cf147260 | 659 | } |
26f609ff | 660 | } |
c3e23647 | 661 | |
93ede233 | 662 | |
6c89f1c1 AD |
663 | /*----------------------------------------------------------. |
664 | | Output the parsing tables and the parser code to ftable. | | |
665 | `----------------------------------------------------------*/ | |
c3e23647 | 666 | |
6c89f1c1 AD |
667 | void |
668 | output (void) | |
669 | { | |
f87685c3 | 670 | obstack_init (&format_obstack); |
dd60faec | 671 | |
39912f52 | 672 | prepare_symbols (); |
b0940840 AD |
673 | prepare_rules (); |
674 | prepare_states (); | |
536545f3 | 675 | prepare_actions (); |
342b8b6e | 676 | |
26f609ff | 677 | prepare (); |
652def80 | 678 | |
9b3add5b RA |
679 | /* Process the selected skeleton file. */ |
680 | output_skeleton (); | |
681 | ||
f499b062 | 682 | obstack_free (&format_obstack, NULL); |
c3e23647 | 683 | } |
d4bd2295 JD |
684 | |
685 | char const * | |
686 | compute_pkgdatadir (void) | |
687 | { | |
688 | char const *pkgdatadir = getenv ("BISON_PKGDATADIR"); | |
689 | return pkgdatadir ? pkgdatadir : PKGDATADIR; | |
690 | } |