src/muscle-tab.c

   1 /* Muscle table manager for Bison.
   2
   3    Copyright (C) 2001-2013 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 STREQ (m1->key, m2->key);
  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_printf (&muscle_obstack, "%s%s%s", entry->value, separator, val);
 161       free (entry->storage);
 162       new_val = obstack_finish0 (&muscle_obstack);
 163       entry->value = entry->storage = xstrdup (new_val);
 164       obstack_free (&muscle_obstack, new_val);
 165     }
 166 }
 167
 168 /*------------------------------------------------------------------.
 169 | Using muscle_grow, append a synchronization line for the location |
 170 | LOC to the current value of KEY.                                  |
 171 `------------------------------------------------------------------*/
 172
 173 static void
 174 muscle_syncline_grow (char const *key, location loc)
 175 {
 176   char *extension = NULL;
 177   obstack_printf (&muscle_obstack, "]b4_syncline(%d, ", loc.start.line);
 178   obstack_quote (&muscle_obstack,
 179                  quotearg_style (c_quoting_style, loc.start.file));
 180   obstack_sgrow (&muscle_obstack, ")[");
 181   extension = obstack_finish0 (&muscle_obstack);
 182   muscle_grow (key, extension, "");
 183   obstack_free (&muscle_obstack, extension);
 184 }
 185
 186 /*------------------------------------------------------------------.
 187 | Append VALUE to the current value of KEY, using muscle_grow.  But |
 188 | in addition, issue a synchronization line for the location LOC    |
 189 | using muscle_syncline_grow.                                       |
 190 `------------------------------------------------------------------*/
 191
 192 void
 193 muscle_code_grow (const char *key, const char *val, location loc)
 194 {
 195   muscle_syncline_grow (key, loc);
 196   muscle_grow (key, val, "\n");
 197 }
 198
 199
 200 void muscle_pair_list_grow (const char *muscle,
 201                             const char *a1, const char *a2)
 202 {
 203   char *pair;
 204   obstack_sgrow (&muscle_obstack, "[");
 205   obstack_quote (&muscle_obstack, a1);
 206   obstack_sgrow (&muscle_obstack, ", ");
 207   obstack_quote (&muscle_obstack, a2);
 208   obstack_sgrow (&muscle_obstack, "]");
 209   pair = obstack_finish0 (&muscle_obstack);
 210   muscle_grow (muscle, pair, ",\n");
 211   obstack_free (&muscle_obstack, pair);
 212 }
 213
 214
 215 /*----------------------------------------------------------------------------.
 216 | Find the value of muscle KEY.  Unlike MUSCLE_FIND, this is always reliable  |
 217 | to determine whether KEY has a value.                                       |
 218 `----------------------------------------------------------------------------*/
 219
 220 char const *
 221 muscle_find_const (char const *key)
 222 {
 223   muscle_entry probe;
 224   muscle_entry *result = NULL;
 225
 226   probe.key = key;
 227   result = hash_lookup (muscle_table, &probe);
 228   if (result)
 229     return result->value;
 230   return NULL;
 231 }
 232
 233
 234 /*----------------------------------------------------------------------------.
 235 | Find the value of muscle KEY.  Abort if muscle_insert was invoked more      |
 236 | recently than muscle_grow for KEY since muscle_find can't return a          |
 237 | char const *.                                                               |
 238 `----------------------------------------------------------------------------*/
 239
 240 char *
 241 muscle_find (char const *key)
 242 {
 243   muscle_entry probe;
 244   muscle_entry *result = NULL;
 245
 246   probe.key = key;
 247   result = hash_lookup (muscle_table, &probe);
 248   if (result)
 249     {
 250       aver (result->value == result->storage);
 251       return result->storage;
 252     }
 253   return NULL;
 254 }
 255
 256
 257 /* In the format `file_name:line.column', append BOUND to MUSCLE.  Use
 258    digraphs for special characters in the file name.  */
 259
 260 static void
 261 muscle_boundary_grow (char const *key, boundary bound)
 262 {
 263   char *extension;
 264   obstack_sgrow  (&muscle_obstack, "[[");
 265   obstack_escape (&muscle_obstack, bound.file);
 266   obstack_printf (&muscle_obstack, ":%d.%d]]", bound.line, bound.column);
 267   extension = obstack_finish0 (&muscle_obstack);
 268   muscle_grow (key, extension, "");
 269   obstack_free (&muscle_obstack, extension);
 270 }
 271
 272
 273 /* In the format `[[file_name:line.column]], [[file_name:line.column]]',
 274    append LOC to MUSCLE.  Use digraphs for special characters in each
 275    file name.  */
 276
 277 static void
 278 muscle_location_grow (char const *key, location loc)
 279 {
 280   muscle_boundary_grow (key, loc.start);
 281   muscle_grow (key, "", ", ");
 282   muscle_boundary_grow (key, loc.end);
 283 }
 284
 285 #define COMMON_DECODE(Value)                                    \
 286   case '$':                                                     \
 287     aver (*++(Value) == ']');                                   \
 288     aver (*++(Value) == '[');                                   \
 289     obstack_sgrow (&muscle_obstack, "$");                       \
 290     break;                                                      \
 291   case '@':                                                     \
 292     switch (*++(Value))                                         \
 293       {                                                         \
 294         case '@': obstack_sgrow (&muscle_obstack, "@" ); break; \
 295         case '{': obstack_sgrow (&muscle_obstack, "[" ); break; \
 296         case '}': obstack_sgrow (&muscle_obstack, "]" ); break; \
 297         default: aver (false); break;                           \
 298       }                                                         \
 299     break;                                                      \
 300   default:                                                      \
 301     obstack_1grow (&muscle_obstack, *(Value));                  \
 302     break;
 303
 304 /* Reverse of obstack_escape.  */
 305 static char *
 306 string_decode (char const *key)
 307 {
 308   char const *value = muscle_find_const (key);
 309   char *value_decoded;
 310   char *result;
 311
 312   if (!value)
 313     return NULL;
 314   do {
 315     switch (*value)
 316       {
 317         COMMON_DECODE (value)
 318         case '[':
 319         case ']':
 320           aver (false);
 321           break;
 322       }
 323   } while (*value++);
 324   value_decoded = obstack_finish (&muscle_obstack);
 325   result = xstrdup (value_decoded);
 326   obstack_free (&muscle_obstack, value_decoded);
 327   return result;
 328 }
 329
 330 /* Reverse of muscle_location_grow.  */
 331 static location
 332 location_decode (char const *key)
 333 {
 334   location loc;
 335   char const *value = muscle_find_const (key);
 336   aver (value);
 337   aver (*value == '[');
 338   aver (*++value == '[');
 339   while (*++value)
 340     switch (*value)
 341       {
 342         COMMON_DECODE (value)
 343         case '[':
 344           aver (false);
 345           break;
 346         case ']':
 347           {
 348             char *boundary_str;
 349             aver (*++value == ']');
 350             boundary_str = obstack_finish0 (&muscle_obstack);
 351             switch (*++value)
 352               {
 353                 case ',':
 354                   boundary_set_from_string (&loc.start, boundary_str);
 355                   obstack_free (&muscle_obstack, boundary_str);
 356                   aver (*++value == ' ');
 357                   aver (*++value == '[');
 358                   aver (*++value == '[');
 359                   break;
 360                 case '\0':
 361                   boundary_set_from_string (&loc.end, boundary_str);
 362                   obstack_free (&muscle_obstack, boundary_str);
 363                   return loc;
 364                   break;
 365                 default:
 366                   aver (false);
 367                   break;
 368               }
 369           }
 370           break;
 371       }
 372   aver (false);
 373   return loc;
 374 }
 375
 376 void
 377 muscle_user_name_list_grow (char const *key, char const *user_name,
 378                             location loc)
 379 {
 380   muscle_grow (key, "[[[[", ",");
 381   muscle_grow (key, user_name, "");
 382   muscle_grow (key, "]], ", "");
 383   muscle_location_grow (key, loc);
 384   muscle_grow (key, "]]", "");
 385 }
 386
 387
 388 /** Return an allocated string that represents the %define directive
 389     that performs the assignment.
 390
 391     @param assignment "VAR", or "VAR=VAL".
 392     @param value      default value if VAL \a assignment has no '='.
 393
 394     For instance:
 395     "foo", NULL      => "%define foo"
 396     "foo", "baz"     => "%define foo baz"
 397     "foo=bar", NULL  => "%define foo bar"
 398     "foo=bar", "baz" => "%define foo bar"
 399     "foo=", NULL     => "%define foo"
 400     "foo=", "baz"    => "%define foo"
 401  */
 402
 403 static
 404 char *
 405 define_directive (char const *assignment, char const *value)
 406 {
 407   char *eq = strchr (assignment, '=');
 408   char const *fmt = !eq && value && *value ? "%%define %s %s" : "%%define %s";
 409   char *res = xmalloc (strlen (fmt) + strlen (assignment)
 410                        + (value ? strlen (value) : 0));
 411   sprintf (res, fmt, assignment, value);
 412   eq = strchr (res, '=');
 413   if (eq)
 414     *eq = eq[1] ? ' ' : '\0';
 415   return res;
 416 }
 417
 418 /** If the \a variable name is obsolete, return the name to use,
 419  * otherwise \a variable.  If the \a value is obsolete, update it too.
 420  *
 421  * Allocates the returned value.  */
 422 static
 423 char *
 424 muscle_percent_variable_update (char const *variable, location variable_loc,
 425                                 char const **value)
 426 {
 427   typedef struct
 428   {
 429     const char *obsolete;
 430     const char *updated;
 431   } conversion_type;
 432   const conversion_type conversion[] =
 433     {
 434       { "api.push_pull", "api.push-pull", },
 435       { "api.tokens.prefix", "api.token.prefix", },
 436       { "lex_symbol", "api.token.constructor", },
 437       { "location_type", "api.location.type", },
 438       { "lr.default-reductions", "lr.default-reduction", },
 439       { "lr.keep-unreachable-states", "lr.keep-unreachable-state", },
 440       { "lr.keep_unreachable_states", "lr.keep-unreachable-state", },
 441       { "namespace", "api.namespace", },
 442       { "stype", "api.value.type", },
 443       { "variant=",     "api.value.type=variant", },
 444       { "variant=true", "api.value.type=variant", },
 445       { NULL, NULL, }
 446     };
 447   conversion_type const *c;
 448   for (c = conversion; c->obsolete; ++c)
 449     {
 450       char const *eq = strchr (c->obsolete, '=');
 451       if (eq
 452           ? (!strncmp (c->obsolete, variable, eq - c->obsolete)
 453              && STREQ (eq + 1, *value))
 454           : STREQ (c->obsolete, variable))
 455         {
 456           char *old = define_directive (c->obsolete, *value);
 457           char *upd = define_directive (c->updated, *value);
 458           deprecated_directive (&variable_loc, old, upd);
 459           free (old);
 460           free (upd);
 461           char *res = xstrdup (c->updated);
 462           {
 463             char *eq2 = strchr (res, '=');
 464             if (eq2)
 465               {
 466                 *eq2 = '\0';
 467                 *value = eq2 + 1;
 468               }
 469           }
 470           return res;
 471         }
 472     }
 473   return xstrdup (variable);
 474 }
 475
 476 void
 477 muscle_percent_define_insert (char const *var, location variable_loc,
 478                               char const *value,
 479                               muscle_percent_define_how how)
 480 {
 481   /* Backward compatibility.  */
 482   char *variable = muscle_percent_variable_update (var, variable_loc, &value);
 483   char const *name = UNIQSTR_CONCAT ("percent_define(", variable, ")");
 484   char const *loc_name = UNIQSTR_CONCAT ("percent_define_loc(", variable, ")");
 485   char const *syncline_name =
 486     UNIQSTR_CONCAT ("percent_define_syncline(", variable, ")");
 487   char const *how_name = UNIQSTR_CONCAT ("percent_define_how(", variable, ")");
 488
 489   /* Command-line options are processed before the grammar file.  */
 490   if (how == MUSCLE_PERCENT_DEFINE_GRAMMAR_FILE
 491       && muscle_find_const (name))
 492     {
 493       muscle_percent_define_how how_old = atoi (muscle_find_const (how_name));
 494       unsigned i = 0;
 495       if (how_old == MUSCLE_PERCENT_DEFINE_F)
 496         goto end;
 497       complain_indent (&variable_loc, complaint, &i,
 498                        _("%%define variable %s redefined"),
 499                        quote (variable));
 500       i += SUB_INDENT;
 501       location loc = muscle_percent_define_get_loc (variable);
 502       complain_indent (&loc, complaint, &i, _("previous definition"));
 503     }
 504
 505   MUSCLE_INSERT_STRING (name, value);
 506   muscle_insert (loc_name, "");
 507   muscle_location_grow (loc_name, variable_loc);
 508   muscle_insert (syncline_name, "");
 509   muscle_syncline_grow (syncline_name, variable_loc);
 510   muscle_user_name_list_grow ("percent_define_user_variables", variable,
 511                               variable_loc);
 512   MUSCLE_INSERT_INT (how_name, how);
 513  end:
 514   free (variable);
 515 }
 516
 517 /* This is used for backward compatibility, e.g., "%define api.pure"
 518    supersedes "%pure-parser".  */
 519 void
 520 muscle_percent_define_ensure (char const *variable, location loc,
 521                               bool value)
 522 {
 523   char const *val = value ? "" : "false";
 524   char const *name = UNIQSTR_CONCAT ("percent_define(", variable, ")");
 525
 526   /* %pure-parser is deprecated in favor of `%define api.pure', so use
 527      `%define api.pure' in a backward-compatible manner here.  First,
 528      don't complain if %pure-parser is specified multiple times.  */
 529   if (!muscle_find_const (name))
 530     muscle_percent_define_insert (variable, loc, val,
 531                                   MUSCLE_PERCENT_DEFINE_GRAMMAR_FILE);
 532   /* In all cases, use api.pure now so that the backend doesn't complain if
 533      the skeleton ignores api.pure, but do warn now if there's a previous
 534      conflicting definition from an actual %define.  */
 535   if (muscle_percent_define_flag_if (variable) != value)
 536     muscle_percent_define_insert (variable, loc, val,
 537                                   MUSCLE_PERCENT_DEFINE_GRAMMAR_FILE);
 538 }
 539
 540 char *
 541 muscle_percent_define_get (char const *variable)
 542 {
 543   char const *name = UNIQSTR_CONCAT ("percent_define(", variable, ")");
 544   char const *usage_name =
 545     UNIQSTR_CONCAT ("percent_define_bison_variables(", variable, ")");
 546   char *value = string_decode (name);
 547   if (!value)
 548     value = xstrdup ("");
 549
 550   muscle_insert (usage_name, "");
 551   return value;
 552 }
 553
 554 location
 555 muscle_percent_define_get_loc (char const *variable)
 556 {
 557   char const *loc_name = UNIQSTR_CONCAT ("percent_define_loc(", variable, ")");
 558   if (!muscle_find_const (loc_name))
 559     complain (NULL, fatal, _("%s: undefined %%define variable %s"),
 560               "muscle_percent_define_get_loc", quote (variable));
 561   return location_decode (loc_name);
 562 }
 563
 564 char const *
 565 muscle_percent_define_get_syncline (char const *variable)
 566 {
 567   char const *syncline_name =
 568     UNIQSTR_CONCAT ("percent_define_syncline(", variable, ")");
 569   char const *syncline = muscle_find_const (syncline_name);
 570   if (!syncline)
 571     complain (NULL, fatal, _("%s: undefined %%define variable %s"),
 572               "muscle_percent_define_get_syncline", quote (variable));
 573   return syncline;
 574 }
 575
 576 bool
 577 muscle_percent_define_ifdef (char const *variable)
 578 {
 579   char const *name = UNIQSTR_CONCAT ("percent_define(", variable, ")");
 580   char const *usage_name =
 581     UNIQSTR_CONCAT ("percent_define_bison_variables(", variable, ")");
 582   char const *value = muscle_find_const (name);
 583   if (value)
 584     {
 585       muscle_insert (usage_name, "");
 586       return true;
 587     }
 588
 589   return false;
 590 }
 591
 592 bool
 593 muscle_percent_define_flag_if (char const *variable)
 594 {
 595   char const *invalid_boolean_name =
 596     UNIQSTR_CONCAT ("percent_define_invalid_boolean(", variable, ")");
 597   bool result = false;
 598
 599   if (muscle_percent_define_ifdef (variable))
 600     {
 601       char *value = muscle_percent_define_get (variable);
 602       if (value[0] == '\0' || STREQ (value, "true"))
 603         result = true;
 604       else if (STREQ (value, "false"))
 605         result = false;
 606       else if (!muscle_find_const (invalid_boolean_name))
 607         {
 608           muscle_insert (invalid_boolean_name, "");
 609           location loc = muscle_percent_define_get_loc (variable);
 610           complain (&loc, complaint,
 611                     _("invalid value for %%define Boolean variable %s"),
 612                     quote (variable));
 613         }
 614       free (value);
 615     }
 616   else
 617     complain (NULL, fatal, _("%s: undefined %%define variable %s"),
 618               "muscle_percent_define_flag", quote (variable));
 619
 620   return result;
 621 }
 622
 623 void
 624 muscle_percent_define_default (char const *variable, char const *value)
 625 {
 626   char const *name = UNIQSTR_CONCAT ("percent_define(", variable, ")");
 627   char const *loc_name = UNIQSTR_CONCAT ("percent_define_loc(", variable, ")");
 628   char const *syncline_name =
 629     UNIQSTR_CONCAT ("percent_define_syncline(", variable, ")");
 630   if (!muscle_find_const (name))
 631     {
 632       location loc;
 633       MUSCLE_INSERT_STRING (name, value);
 634       loc.start.file = loc.end.file = "<default value>";
 635       loc.start.line = loc.end.line = -1;
 636       loc.start.column = loc.end.column = -1;
 637       muscle_insert (loc_name, "");
 638       muscle_location_grow (loc_name, loc);
 639       muscle_insert (syncline_name, "");
 640     }
 641 }
 642
 643 void
 644 muscle_percent_define_check_values (char const * const *values)
 645 {
 646   for (; *values; ++values)
 647     {
 648       char const * const *variablep = values;
 649       char const *name = UNIQSTR_CONCAT ("percent_define(", *variablep, ")");
 650       char *value = string_decode (name);
 651       if (value)
 652         {
 653           for (++values; *values; ++values)
 654             {
 655               if (STREQ (value, *values))
 656                 break;
 657             }
 658           if (!*values)
 659             {
 660               unsigned i = 0;
 661               location loc = muscle_percent_define_get_loc (*variablep);
 662               complain_indent (&loc, complaint, &i,
 663                                _("invalid value for %%define variable %s: %s"),
 664                                quote (*variablep), quote_n (1, value));
 665               i += SUB_INDENT;
 666               for (values = variablep + 1; *values; ++values)
 667                 complain_indent (&loc, complaint | no_caret, &i,
 668                                  _("accepted value: %s"), quote (*values));
 669             }
 670           else
 671             {
 672               while (*values)
 673                 ++values;
 674             }
 675           free (value);
 676         }
 677       else
 678         complain (NULL, fatal, _("%s: undefined %%define variable %s"),
 679                   "muscle_percent_define_check_values", quote (*variablep));
 680     }
 681 }
 682
 683 void
 684 muscle_percent_code_grow (char const *qualifier, location qualifier_loc,
 685                           char const *code, location code_loc)
 686 {
 687   char const *name = UNIQSTR_CONCAT ("percent_code(", qualifier, ")");
 688   muscle_code_grow (name, code, code_loc);
 689   muscle_user_name_list_grow ("percent_code_user_qualifiers", qualifier,
 690                                qualifier_loc);
 691 }
 692
 693
 694 /*------------------------------------------------.
 695 | Output the definition of ENTRY as a m4_define.  |
 696 `------------------------------------------------*/
 697
 698 static inline bool
 699 muscle_m4_output (muscle_entry *entry, FILE *out)
 700 {
 701   fprintf (out,
 702            "m4_define([b4_%s],\n"
 703            "[[%s]])\n\n\n", entry->key, entry->value);
 704   return true;
 705 }
 706
 707 static bool
 708 muscle_m4_output_processor (void *entry, void *out)
 709 {
 710   return muscle_m4_output (entry, out);
 711 }
 712
 713
 714 /*----------------------------------------------------------------.
 715 | Output the definition of all the current muscles into a list of |
 716 | m4_defines.                                                     |
 717 `----------------------------------------------------------------*/
 718
 719 void
 720 muscles_m4_output (FILE *out)
 721 {
 722   hash_do_for_each (muscle_table, muscle_m4_output_processor, out);
 723 }