| 1 | /* Muscle table manager for Bison. |
| 2 | |
| 3 | Copyright (C) 2001-2012 Free Software Foundation, Inc. |
| 4 | |
| 5 | This file is part of Bison, the GNU Compiler Compiler. |
| 6 | |
| 7 | This program is free software: you can redistribute it and/or modify |
| 8 | it under the terms of the GNU General Public License as published by |
| 9 | the Free Software Foundation, either version 3 of the License, or |
| 10 | (at your option) any later version. |
| 11 | |
| 12 | This program is distributed in the hope that it will be useful, |
| 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 15 | GNU General Public License for more details. |
| 16 | |
| 17 | You should have received a copy of the GNU General Public License |
| 18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
| 19 | |
| 20 | #include <config.h> |
| 21 | #include "system.h" |
| 22 | |
| 23 | #include <hash.h> |
| 24 | |
| 25 | #include "complain.h" |
| 26 | #include "files.h" |
| 27 | #include "getargs.h" |
| 28 | #include "muscle-tab.h" |
| 29 | #include "quote.h" |
| 30 | |
| 31 | /* A key-value pair, along with storage that can be reclaimed when |
| 32 | this pair is no longer needed. */ |
| 33 | typedef struct |
| 34 | { |
| 35 | char const *key; |
| 36 | char const *value; |
| 37 | char *storage; |
| 38 | } muscle_entry; |
| 39 | |
| 40 | /* An obstack used to create some entries. */ |
| 41 | struct obstack muscle_obstack; |
| 42 | |
| 43 | /* Initial capacity of muscles hash table. */ |
| 44 | #define HT_INITIAL_CAPACITY 257 |
| 45 | |
| 46 | static struct hash_table *muscle_table = NULL; |
| 47 | |
| 48 | static bool |
| 49 | hash_compare_muscles (void const *x, void const *y) |
| 50 | { |
| 51 | muscle_entry const *m1 = x; |
| 52 | muscle_entry const *m2 = y; |
| 53 | return strcmp (m1->key, m2->key) == 0; |
| 54 | } |
| 55 | |
| 56 | static size_t |
| 57 | hash_muscle (const void *x, size_t tablesize) |
| 58 | { |
| 59 | muscle_entry const *m = x; |
| 60 | return hash_string (m->key, tablesize); |
| 61 | } |
| 62 | |
| 63 | /*-----------------------------------------------------------------. |
| 64 | | Create the MUSCLE_TABLE, and initialize it with default values. | |
| 65 | | Also set up the MUSCLE_OBSTACK. | |
| 66 | `-----------------------------------------------------------------*/ |
| 67 | |
| 68 | static void |
| 69 | muscle_entry_free (void *entry) |
| 70 | { |
| 71 | muscle_entry *mentry = entry; |
| 72 | free (mentry->storage); |
| 73 | free (mentry); |
| 74 | } |
| 75 | |
| 76 | void |
| 77 | muscle_init (void) |
| 78 | { |
| 79 | /* Initialize the muscle obstack. */ |
| 80 | obstack_init (&muscle_obstack); |
| 81 | |
| 82 | muscle_table = hash_initialize (HT_INITIAL_CAPACITY, NULL, hash_muscle, |
| 83 | hash_compare_muscles, muscle_entry_free); |
| 84 | |
| 85 | /* Version and input file. */ |
| 86 | MUSCLE_INSERT_STRING ("version", VERSION); |
| 87 | } |
| 88 | |
| 89 | |
| 90 | /*------------------------------------------------------------. |
| 91 | | Free all the memory consumed by the muscle machinery only. | |
| 92 | `------------------------------------------------------------*/ |
| 93 | |
| 94 | void |
| 95 | muscle_free (void) |
| 96 | { |
| 97 | hash_free (muscle_table); |
| 98 | obstack_free (&muscle_obstack, NULL); |
| 99 | } |
| 100 | |
| 101 | |
| 102 | |
| 103 | /*------------------------------------------------------------. |
| 104 | | Insert (KEY, VALUE). If KEY already existed, overwrite the | |
| 105 | | previous value. | |
| 106 | `------------------------------------------------------------*/ |
| 107 | |
| 108 | void |
| 109 | muscle_insert (char const *key, char const *value) |
| 110 | { |
| 111 | muscle_entry probe; |
| 112 | muscle_entry *entry; |
| 113 | |
| 114 | probe.key = key; |
| 115 | entry = hash_lookup (muscle_table, &probe); |
| 116 | |
| 117 | if (!entry) |
| 118 | { |
| 119 | /* First insertion in the hash. */ |
| 120 | entry = xmalloc (sizeof *entry); |
| 121 | entry->key = key; |
| 122 | if (!hash_insert (muscle_table, entry)) |
| 123 | xalloc_die (); |
| 124 | } |
| 125 | else |
| 126 | free (entry->storage); |
| 127 | entry->value = value; |
| 128 | entry->storage = NULL; |
| 129 | } |
| 130 | |
| 131 | |
| 132 | /*-------------------------------------------------------------------. |
| 133 | | Append VALUE to the current value of KEY. If KEY did not already | |
| 134 | | exist, create it. Use MUSCLE_OBSTACK. De-allocate the previously | |
| 135 | | associated value. Copy VALUE and SEPARATOR. | |
| 136 | `-------------------------------------------------------------------*/ |
| 137 | |
| 138 | void |
| 139 | muscle_grow (const char *key, const char *val, const char *separator) |
| 140 | { |
| 141 | muscle_entry probe; |
| 142 | muscle_entry *entry = NULL; |
| 143 | |
| 144 | probe.key = key; |
| 145 | entry = hash_lookup (muscle_table, &probe); |
| 146 | |
| 147 | if (!entry) |
| 148 | { |
| 149 | /* First insertion in the hash. */ |
| 150 | entry = xmalloc (sizeof *entry); |
| 151 | entry->key = key; |
| 152 | if (!hash_insert (muscle_table, entry)) |
| 153 | xalloc_die (); |
| 154 | entry->value = entry->storage = xstrdup (val); |
| 155 | } |
| 156 | else |
| 157 | { |
| 158 | /* Grow the current value. */ |
| 159 | char *new_val; |
| 160 | obstack_sgrow (&muscle_obstack, entry->value); |
| 161 | free (entry->storage); |
| 162 | obstack_sgrow (&muscle_obstack, separator); |
| 163 | obstack_sgrow (&muscle_obstack, val); |
| 164 | obstack_1grow (&muscle_obstack, 0); |
| 165 | new_val = obstack_finish (&muscle_obstack); |
| 166 | entry->value = entry->storage = xstrdup (new_val); |
| 167 | obstack_free (&muscle_obstack, new_val); |
| 168 | } |
| 169 | } |
| 170 | |
| 171 | /*------------------------------------------------------------------. |
| 172 | | Using muscle_grow, append a synchronization line for the location | |
| 173 | | LOC to the current value of KEY. | |
| 174 | `------------------------------------------------------------------*/ |
| 175 | |
| 176 | static void |
| 177 | muscle_syncline_grow (char const *key, location loc) |
| 178 | { |
| 179 | char *extension = NULL; |
| 180 | obstack_printf (&muscle_obstack, "]b4_syncline(%d, ", loc.start.line); |
| 181 | obstack_quote (&muscle_obstack, |
| 182 | quotearg_style (c_quoting_style, loc.start.file)); |
| 183 | obstack_sgrow (&muscle_obstack, ")["); |
| 184 | obstack_1grow (&muscle_obstack, 0); |
| 185 | extension = obstack_finish (&muscle_obstack); |
| 186 | muscle_grow (key, extension, ""); |
| 187 | obstack_free (&muscle_obstack, extension); |
| 188 | } |
| 189 | |
| 190 | /*------------------------------------------------------------------. |
| 191 | | Append VALUE to the current value of KEY, using muscle_grow. But | |
| 192 | | in addition, issue a synchronization line for the location LOC | |
| 193 | | using muscle_syncline_grow. | |
| 194 | `------------------------------------------------------------------*/ |
| 195 | |
| 196 | void |
| 197 | muscle_code_grow (const char *key, const char *val, location loc) |
| 198 | { |
| 199 | muscle_syncline_grow (key, loc); |
| 200 | muscle_grow (key, val, "\n"); |
| 201 | } |
| 202 | |
| 203 | |
| 204 | void muscle_pair_list_grow (const char *muscle, |
| 205 | const char *a1, const char *a2) |
| 206 | { |
| 207 | char *pair; |
| 208 | obstack_sgrow (&muscle_obstack, "["); |
| 209 | obstack_quote (&muscle_obstack, a1); |
| 210 | obstack_sgrow (&muscle_obstack, ", "); |
| 211 | obstack_quote (&muscle_obstack, a2); |
| 212 | obstack_sgrow (&muscle_obstack, "]"); |
| 213 | obstack_1grow (&muscle_obstack, 0); |
| 214 | pair = obstack_finish (&muscle_obstack); |
| 215 | muscle_grow (muscle, pair, ",\n"); |
| 216 | obstack_free (&muscle_obstack, pair); |
| 217 | } |
| 218 | |
| 219 | |
| 220 | /*----------------------------------------------------------------------------. |
| 221 | | Find the value of muscle KEY. Unlike MUSCLE_FIND, this is always reliable | |
| 222 | | to determine whether KEY has a value. | |
| 223 | `----------------------------------------------------------------------------*/ |
| 224 | |
| 225 | char const * |
| 226 | muscle_find_const (char const *key) |
| 227 | { |
| 228 | muscle_entry probe; |
| 229 | muscle_entry *result = NULL; |
| 230 | |
| 231 | probe.key = key; |
| 232 | result = hash_lookup (muscle_table, &probe); |
| 233 | if (result) |
| 234 | return result->value; |
| 235 | return NULL; |
| 236 | } |
| 237 | |
| 238 | |
| 239 | /*----------------------------------------------------------------------------. |
| 240 | | Find the value of muscle KEY. Abort if muscle_insert was invoked more | |
| 241 | | recently than muscle_grow for KEY since muscle_find can't return a | |
| 242 | | char const *. | |
| 243 | `----------------------------------------------------------------------------*/ |
| 244 | |
| 245 | char * |
| 246 | muscle_find (char const *key) |
| 247 | { |
| 248 | muscle_entry probe; |
| 249 | muscle_entry *result = NULL; |
| 250 | |
| 251 | probe.key = key; |
| 252 | result = hash_lookup (muscle_table, &probe); |
| 253 | if (result) |
| 254 | { |
| 255 | aver (result->value == result->storage); |
| 256 | return result->storage; |
| 257 | } |
| 258 | return NULL; |
| 259 | } |
| 260 | |
| 261 | |
| 262 | /* In the format `file_name:line.column', append BOUND to MUSCLE. Use |
| 263 | digraphs for special characters in the file name. */ |
| 264 | |
| 265 | static void |
| 266 | muscle_boundary_grow (char const *key, boundary bound) |
| 267 | { |
| 268 | char *extension; |
| 269 | obstack_sgrow (&muscle_obstack, "[["); |
| 270 | obstack_escape (&muscle_obstack, bound.file); |
| 271 | obstack_1grow (&muscle_obstack, ':'); |
| 272 | obstack_printf (&muscle_obstack, "%d", bound.line); |
| 273 | obstack_1grow (&muscle_obstack, '.'); |
| 274 | obstack_printf (&muscle_obstack, "%d", bound.column); |
| 275 | obstack_sgrow (&muscle_obstack, "]]"); |
| 276 | obstack_1grow (&muscle_obstack, '\0'); |
| 277 | extension = obstack_finish (&muscle_obstack); |
| 278 | muscle_grow (key, extension, ""); |
| 279 | obstack_free (&muscle_obstack, extension); |
| 280 | } |
| 281 | |
| 282 | |
| 283 | /* In the format `[[file_name:line.column]], [[file_name:line.column]]', |
| 284 | append LOC to MUSCLE. Use digraphs for special characters in each |
| 285 | file name. */ |
| 286 | |
| 287 | static void |
| 288 | muscle_location_grow (char const *key, location loc) |
| 289 | { |
| 290 | muscle_boundary_grow (key, loc.start); |
| 291 | muscle_grow (key, "", ", "); |
| 292 | muscle_boundary_grow (key, loc.end); |
| 293 | } |
| 294 | |
| 295 | #define COMMON_DECODE(Value) \ |
| 296 | case '$': \ |
| 297 | aver (*++(Value) == ']'); \ |
| 298 | aver (*++(Value) == '['); \ |
| 299 | obstack_sgrow (&muscle_obstack, "$"); \ |
| 300 | break; \ |
| 301 | case '@': \ |
| 302 | switch (*++(Value)) \ |
| 303 | { \ |
| 304 | case '@': obstack_sgrow (&muscle_obstack, "@" ); break; \ |
| 305 | case '{': obstack_sgrow (&muscle_obstack, "[" ); break; \ |
| 306 | case '}': obstack_sgrow (&muscle_obstack, "]" ); break; \ |
| 307 | default: aver (false); break; \ |
| 308 | } \ |
| 309 | break; \ |
| 310 | default: \ |
| 311 | obstack_1grow (&muscle_obstack, *(Value)); \ |
| 312 | break; |
| 313 | |
| 314 | /* Reverse of obstack_escape. */ |
| 315 | static char * |
| 316 | string_decode (char const *key) |
| 317 | { |
| 318 | char const *value; |
| 319 | char *value_decoded; |
| 320 | char *result; |
| 321 | |
| 322 | value = muscle_find_const (key); |
| 323 | if (!value) |
| 324 | return NULL; |
| 325 | do { |
| 326 | switch (*value) |
| 327 | { |
| 328 | COMMON_DECODE (value) |
| 329 | case '[': |
| 330 | case ']': |
| 331 | aver (false); |
| 332 | break; |
| 333 | } |
| 334 | } while (*value++); |
| 335 | value_decoded = obstack_finish (&muscle_obstack); |
| 336 | result = xstrdup (value_decoded); |
| 337 | obstack_free (&muscle_obstack, value_decoded); |
| 338 | return result; |
| 339 | } |
| 340 | |
| 341 | /* Reverse of muscle_location_grow. */ |
| 342 | static location |
| 343 | location_decode (char const *key) |
| 344 | { |
| 345 | location loc; |
| 346 | char const *value = muscle_find_const (key); |
| 347 | aver (value); |
| 348 | aver (*value == '['); |
| 349 | aver (*++value == '['); |
| 350 | while (*++value) |
| 351 | switch (*value) |
| 352 | { |
| 353 | COMMON_DECODE (value) |
| 354 | case '[': |
| 355 | aver (false); |
| 356 | break; |
| 357 | case ']': |
| 358 | { |
| 359 | char *boundary_str; |
| 360 | aver (*++value == ']'); |
| 361 | obstack_1grow (&muscle_obstack, '\0'); |
| 362 | boundary_str = obstack_finish (&muscle_obstack); |
| 363 | switch (*++value) |
| 364 | { |
| 365 | case ',': |
| 366 | boundary_set_from_string (&loc.start, boundary_str); |
| 367 | obstack_free (&muscle_obstack, boundary_str); |
| 368 | aver (*++value == ' '); |
| 369 | aver (*++value == '['); |
| 370 | aver (*++value == '['); |
| 371 | break; |
| 372 | case '\0': |
| 373 | boundary_set_from_string (&loc.end, boundary_str); |
| 374 | obstack_free (&muscle_obstack, boundary_str); |
| 375 | return loc; |
| 376 | break; |
| 377 | default: |
| 378 | aver (false); |
| 379 | break; |
| 380 | } |
| 381 | } |
| 382 | break; |
| 383 | } |
| 384 | aver (false); |
| 385 | return loc; |
| 386 | } |
| 387 | |
| 388 | void |
| 389 | muscle_user_name_list_grow (char const *key, char const *user_name, |
| 390 | location loc) |
| 391 | { |
| 392 | muscle_grow (key, "[[[[", ","); |
| 393 | muscle_grow (key, user_name, ""); |
| 394 | muscle_grow (key, "]], ", ""); |
| 395 | muscle_location_grow (key, loc); |
| 396 | muscle_grow (key, "]]", ""); |
| 397 | } |
| 398 | |
| 399 | void |
| 400 | muscle_percent_define_insert (char const *variable, location variable_loc, |
| 401 | char const *value, |
| 402 | muscle_percent_define_how how) |
| 403 | { |
| 404 | char *variable_tr = NULL; |
| 405 | char const *name; |
| 406 | char const *loc_name; |
| 407 | char const *syncline_name; |
| 408 | char const *how_name; |
| 409 | |
| 410 | /* Permit certain names with underscores for backward compatibility. */ |
| 411 | if (0 == strcmp (variable, "api.push_pull") |
| 412 | || 0 == strcmp (variable, "lr.keep_unreachable_states")) |
| 413 | { |
| 414 | variable_tr = strdup (variable); |
| 415 | tr (variable_tr, '_', '-'); |
| 416 | variable = variable_tr; |
| 417 | } |
| 418 | |
| 419 | name = UNIQSTR_CONCAT ("percent_define(", variable, ")"); |
| 420 | loc_name = UNIQSTR_CONCAT ("percent_define_loc(", variable, ")"); |
| 421 | syncline_name = |
| 422 | UNIQSTR_CONCAT ("percent_define_syncline(", variable, ")"); |
| 423 | how_name = UNIQSTR_CONCAT ("percent_define_how(", variable, ")"); |
| 424 | |
| 425 | /* Command-line options are processed before the grammar file. */ |
| 426 | if (how == MUSCLE_PERCENT_DEFINE_GRAMMAR_FILE |
| 427 | && muscle_find_const (name)) |
| 428 | { |
| 429 | muscle_percent_define_how how_old = |
| 430 | atoi (muscle_find_const (how_name)); |
| 431 | if (how_old == MUSCLE_PERCENT_DEFINE_F) |
| 432 | { |
| 433 | free (variable_tr); |
| 434 | return; |
| 435 | } |
| 436 | complain_at (variable_loc, _("%%define variable %s redefined"), |
| 437 | quote (variable)); |
| 438 | complain_at (muscle_percent_define_get_loc (variable), |
| 439 | _("previous definition")); |
| 440 | } |
| 441 | |
| 442 | MUSCLE_INSERT_STRING (name, value); |
| 443 | muscle_insert (loc_name, ""); |
| 444 | muscle_location_grow (loc_name, variable_loc); |
| 445 | muscle_insert (syncline_name, ""); |
| 446 | muscle_syncline_grow (syncline_name, variable_loc); |
| 447 | muscle_user_name_list_grow ("percent_define_user_variables", variable, |
| 448 | variable_loc); |
| 449 | MUSCLE_INSERT_INT (how_name, how); |
| 450 | |
| 451 | free (variable_tr); |
| 452 | } |
| 453 | |
| 454 | char * |
| 455 | muscle_percent_define_get (char const *variable) |
| 456 | { |
| 457 | char const *name; |
| 458 | char const *usage_name; |
| 459 | char *value; |
| 460 | |
| 461 | name = UNIQSTR_CONCAT ("percent_define(", variable, ")"); |
| 462 | usage_name = UNIQSTR_CONCAT ("percent_define_bison_variables(", |
| 463 | variable, ")"); |
| 464 | |
| 465 | muscle_insert (usage_name, ""); |
| 466 | value = string_decode (name); |
| 467 | if (!value) |
| 468 | value = xstrdup (""); |
| 469 | return value; |
| 470 | } |
| 471 | |
| 472 | location |
| 473 | muscle_percent_define_get_loc (char const *variable) |
| 474 | { |
| 475 | char const *loc_name; |
| 476 | loc_name = UNIQSTR_CONCAT ("percent_define_loc(", variable, ")"); |
| 477 | if (!muscle_find_const (loc_name)) |
| 478 | fatal(_("%s: undefined %%define variable %s"), |
| 479 | "muscle_percent_define_get_loc", quote (variable)); |
| 480 | return location_decode (loc_name); |
| 481 | } |
| 482 | |
| 483 | char const * |
| 484 | muscle_percent_define_get_syncline (char const *variable) |
| 485 | { |
| 486 | char const *syncline_name; |
| 487 | char const *syncline; |
| 488 | syncline_name = |
| 489 | UNIQSTR_CONCAT ("percent_define_syncline(", variable, ")"); |
| 490 | syncline = muscle_find_const (syncline_name); |
| 491 | if (!syncline) |
| 492 | fatal(_("%s: undefined %%define variable %s"), |
| 493 | "muscle_percent_define_get_syncline", quote (variable)); |
| 494 | return syncline; |
| 495 | } |
| 496 | |
| 497 | bool |
| 498 | muscle_percent_define_ifdef (char const *variable) |
| 499 | { |
| 500 | char const *name; |
| 501 | char const *usage_name; |
| 502 | char const *value; |
| 503 | |
| 504 | name = UNIQSTR_CONCAT ("percent_define(", variable, ")"); |
| 505 | usage_name = |
| 506 | UNIQSTR_CONCAT ("percent_define_bison_variables(", variable, ")"); |
| 507 | |
| 508 | value = muscle_find_const (name); |
| 509 | if (value) |
| 510 | { |
| 511 | muscle_insert (usage_name, ""); |
| 512 | return true; |
| 513 | } |
| 514 | |
| 515 | return false; |
| 516 | } |
| 517 | |
| 518 | bool |
| 519 | muscle_percent_define_flag_if (char const *variable) |
| 520 | { |
| 521 | char const *invalid_boolean_name; |
| 522 | bool result = false; |
| 523 | |
| 524 | invalid_boolean_name = |
| 525 | UNIQSTR_CONCAT ("percent_define_invalid_boolean(", variable, ")"); |
| 526 | |
| 527 | if (muscle_percent_define_ifdef (variable)) |
| 528 | { |
| 529 | char *value = muscle_percent_define_get (variable); |
| 530 | if (value[0] == '\0' || 0 == strcmp (value, "true")) |
| 531 | result = true; |
| 532 | else if (0 == strcmp (value, "false")) |
| 533 | result = false; |
| 534 | else if (!muscle_find_const (invalid_boolean_name)) |
| 535 | { |
| 536 | muscle_insert (invalid_boolean_name, ""); |
| 537 | complain_at(muscle_percent_define_get_loc (variable), |
| 538 | _("invalid value for %%define Boolean variable %s"), |
| 539 | quote (variable)); |
| 540 | } |
| 541 | free (value); |
| 542 | } |
| 543 | else |
| 544 | fatal(_("%s: undefined %%define variable %s"), |
| 545 | "muscle_percent_define_flag", quote (variable)); |
| 546 | |
| 547 | return result; |
| 548 | } |
| 549 | |
| 550 | void |
| 551 | muscle_percent_define_default (char const *variable, char const *value) |
| 552 | { |
| 553 | char const *name; |
| 554 | char const *loc_name; |
| 555 | char const *syncline_name; |
| 556 | name = UNIQSTR_CONCAT ("percent_define(", variable, ")"); |
| 557 | loc_name = UNIQSTR_CONCAT ("percent_define_loc(", variable, ")"); |
| 558 | syncline_name = |
| 559 | UNIQSTR_CONCAT ("percent_define_syncline(", variable, ")"); |
| 560 | if (!muscle_find_const (name)) |
| 561 | { |
| 562 | location loc; |
| 563 | MUSCLE_INSERT_STRING (name, value); |
| 564 | loc.start.file = loc.end.file = "<default value>"; |
| 565 | loc.start.line = loc.end.line = -1; |
| 566 | loc.start.column = loc.end.column = -1; |
| 567 | muscle_insert (loc_name, ""); |
| 568 | muscle_location_grow (loc_name, loc); |
| 569 | muscle_insert (syncline_name, ""); |
| 570 | } |
| 571 | } |
| 572 | |
| 573 | void |
| 574 | muscle_percent_define_check_values (char const * const *values) |
| 575 | { |
| 576 | for (; *values; ++values) |
| 577 | { |
| 578 | char const * const *variablep = values; |
| 579 | char const *name; |
| 580 | char *value; |
| 581 | |
| 582 | name = UNIQSTR_CONCAT ("percent_define(", *variablep, ")"); |
| 583 | |
| 584 | value = string_decode (name); |
| 585 | if (value) |
| 586 | { |
| 587 | for (++values; *values; ++values) |
| 588 | { |
| 589 | if (0 == strcmp (value, *values)) |
| 590 | break; |
| 591 | } |
| 592 | if (!*values) |
| 593 | { |
| 594 | location loc = muscle_percent_define_get_loc (*variablep); |
| 595 | complain_at(loc, |
| 596 | _("invalid value for %%define variable %s: %s"), |
| 597 | quote (*variablep), quote_n (1, value)); |
| 598 | for (values = variablep + 1; *values; ++values) |
| 599 | complain_at (loc, _("accepted value: %s"), quote (*values)); |
| 600 | } |
| 601 | else |
| 602 | { |
| 603 | while (*values) |
| 604 | ++values; |
| 605 | } |
| 606 | free (value); |
| 607 | } |
| 608 | else |
| 609 | fatal (_("%s: undefined %%define variable %s"), |
| 610 | "muscle_percent_define_check_values", quote (*variablep)); |
| 611 | } |
| 612 | } |
| 613 | |
| 614 | void |
| 615 | muscle_percent_code_grow (char const *qualifier, location qualifier_loc, |
| 616 | char const *code, location code_loc) |
| 617 | { |
| 618 | char const *name; |
| 619 | name = UNIQSTR_CONCAT ("percent_code(", qualifier, ")"); |
| 620 | muscle_code_grow (name, code, code_loc); |
| 621 | muscle_user_name_list_grow ("percent_code_user_qualifiers", qualifier, |
| 622 | qualifier_loc); |
| 623 | } |
| 624 | |
| 625 | |
| 626 | /*------------------------------------------------. |
| 627 | | Output the definition of ENTRY as a m4_define. | |
| 628 | `------------------------------------------------*/ |
| 629 | |
| 630 | static inline bool |
| 631 | muscle_m4_output (muscle_entry *entry, FILE *out) |
| 632 | { |
| 633 | fprintf (out, "m4_define([b4_%s],\n", entry->key); |
| 634 | fprintf (out, "[[%s]])\n\n\n", entry->value); |
| 635 | return true; |
| 636 | } |
| 637 | |
| 638 | static bool |
| 639 | muscle_m4_output_processor (void *entry, void *out) |
| 640 | { |
| 641 | return muscle_m4_output (entry, out); |
| 642 | } |
| 643 | |
| 644 | |
| 645 | /*----------------------------------------------------------------. |
| 646 | | Output the definition of all the current muscles into a list of | |
| 647 | | m4_defines. | |
| 648 | `----------------------------------------------------------------*/ |
| 649 | |
| 650 | void |
| 651 | muscles_m4_output (FILE *out) |
| 652 | { |
| 653 | hash_do_for_each (muscle_table, muscle_m4_output_processor, out); |
| 654 | } |