X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/5b5d192929809b62eafc89aa5f957df74871d380..c1d19e10c32844d17122b473840752003521d21b:/src/muscle_tab.c diff --git a/src/muscle_tab.c b/src/muscle_tab.c index d487a4a0..5192fc5c 100644 --- a/src/muscle_tab.c +++ b/src/muscle_tab.c @@ -1,5 +1,7 @@ -/* Macro table manager for Bison, - Copyright 1984, 1989, 2000 Free Software Foundation, Inc. +/* Muscle table manager for Bison. + + Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 Free Software + Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -15,109 +17,292 @@ You should have received a copy of the GNU General Public License along with Bison; see the file COPYING. If not, write to - the Free Software Foundation, Inc., 59 Temple Place - Suite 330, - Boston, MA 02111-1307, USA. */ - -#include + the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, + Boston, MA 02110-1301, USA. */ -#include "xalloc.h" +#include #include "system.h" -#include "hash.h" + +#include +#include + #include "files.h" #include "muscle_tab.h" #include "getargs.h" -struct hash_table muscle_table; +/* A key-value pair, along with storage that can be reclaimed when + this pair is no longer needed. */ +typedef struct +{ + char const *key; + char const *value; + char *storage; +} muscle_entry; + +/* An obstack used to create some entries. */ +struct obstack muscle_obstack; + +/* Initial capacity of muscles hash table. */ +#define HT_INITIAL_CAPACITY 257 + +static struct hash_table *muscle_table = NULL; -static unsigned long -mhash1 (const void *item) +static bool +hash_compare_muscles (void const *x, void const *y) { - return_STRING_HASH_1 (((muscle_entry_t *) item)->key); + muscle_entry const *m1 = x; + muscle_entry const *m2 = y; + return strcmp (m1->key, m2->key) == 0; } -static unsigned long -mhash2 (const void *item) +static size_t +hash_muscle (const void *x, size_t tablesize) { - return_STRING_HASH_2 (((muscle_entry_t *) item)->key); + muscle_entry const *m = x; + return hash_string (m->key, tablesize); } -static int -mcmp (const void *x, const void *y) +/*-----------------------------------------------------------------. +| Create the MUSCLE_TABLE, and initialize it with default values. | +| Also set up the MUSCLE_OBSTACK. | +`-----------------------------------------------------------------*/ + +static void +muscle_entry_free (void *entry) { - return strcmp (((muscle_entry_t*) x)->key, ((muscle_entry_t *) y)->key); + muscle_entry *mentry = entry; + free (mentry->storage); + free (mentry); } void muscle_init (void) { - hash_init (&muscle_table, MTABSIZE, &mhash1, &mhash2, &mcmp); + /* Initialize the muscle obstack. */ + obstack_init (&muscle_obstack); + + muscle_table = hash_initialize (HT_INITIAL_CAPACITY, NULL, hash_muscle, + hash_compare_muscles, muscle_entry_free); /* Version and input file. */ - muscle_insert ("version", VERSION); - muscle_insert ("filename", infile); - - /* Types. */ - muscle_insert ("stype", "int"); - muscle_insert ("ltype", "yyltype"); - - /* Tokens. */ - muscle_insert ("tokendef", ""); - - /* Tables. */ - muscle_insert ("rhs", "0"); - muscle_insert ("pact", "0"); - muscle_insert ("prhs", "0"); - muscle_insert ("stos", "0"); - muscle_insert ("check", "0"); - muscle_insert ("pgoto", "0"); - muscle_insert ("table", "0"); - muscle_insert ("tname", "0"); - muscle_insert ("defact", "0"); - muscle_insert ("toknum", "0"); - muscle_insert ("defgoto", "0"); - muscle_insert ("translate", "0"); - - /* Various macros. */ - muscle_insert ("flag", "0"); - muscle_insert ("last", "0"); - muscle_insert ("pure", "0"); - muscle_insert ("nsym", "0"); - muscle_insert ("debug", "0"); - muscle_insert ("final", "0"); - muscle_insert ("maxtok", "0"); - muscle_insert ("ntbase", "0"); - muscle_insert ("error-verbose", "0"); - muscle_insert ("prefix", "yy"); - /* Default #line formatting. */ - muscle_insert ("linef", "#line %d %s\n"); - - /* No parser macros. */ - muscle_insert ("nnts", "0"); - muscle_insert ("nrules", "0"); - muscle_insert ("nstates", "0"); - muscle_insert ("ntokens", "0"); - - /* Stack parameters. */ - muscle_insert ("maxdepth", "10000"); - muscle_insert ("initdepth", "200"); - - /* C++ macros. */ - muscle_insert ("name", "Parser"); -} - -void -muscle_insert (const char *key, const char *value) -{ - muscle_entry_t *pair = XMALLOC (muscle_entry_t, 1); - pair->key = key; - pair->value = value; - hash_insert (&muscle_table, pair); -} - -const char* -muscle_find (const char *key) -{ - muscle_entry_t pair = { key, 0 }; - muscle_entry_t *result = hash_find_item (&muscle_table, &pair); - return result ? result->value : 0; + MUSCLE_INSERT_STRING ("version", VERSION); + MUSCLE_INSERT_C_STRING ("file_name", grammar_file); +} + + +/*------------------------------------------------------------. +| Free all the memory consumed by the muscle machinery only. | +`------------------------------------------------------------*/ + +void +muscle_free (void) +{ + hash_free (muscle_table); + obstack_free (&muscle_obstack, NULL); +} + + + +/*------------------------------------------------------------. +| Insert (KEY, VALUE). If KEY already existed, overwrite the | +| previous value. | +`------------------------------------------------------------*/ + +void +muscle_insert (char const *key, char const *value) +{ + muscle_entry probe; + muscle_entry *entry; + + probe.key = key; + entry = hash_lookup (muscle_table, &probe); + + if (!entry) + { + /* First insertion in the hash. */ + entry = xmalloc (sizeof *entry); + entry->key = key; + hash_insert (muscle_table, entry); + } + else + free (entry->storage); + entry->value = value; + entry->storage = NULL; +} + + +/*-------------------------------------------------------------------. +| Append VALUE to the current value of KEY. If KEY did not already | +| exist, create it. Use MUSCLE_OBSTACK. De-allocate the previously | +| associated value. Copy VALUE and SEPARATOR. | +`-------------------------------------------------------------------*/ + +void +muscle_grow (const char *key, const char *val, const char *separator) +{ + muscle_entry probe; + muscle_entry *entry = NULL; + + probe.key = key; + entry = hash_lookup (muscle_table, &probe); + + if (!entry) + { + /* First insertion in the hash. */ + entry = xmalloc (sizeof *entry); + entry->key = key; + hash_insert (muscle_table, entry); + entry->value = entry->storage = xstrdup (val); + } + else + { + /* Grow the current value. */ + char *new_val; + obstack_sgrow (&muscle_obstack, entry->value); + free (entry->storage); + obstack_sgrow (&muscle_obstack, separator); + obstack_sgrow (&muscle_obstack, val); + obstack_1grow (&muscle_obstack, 0); + new_val = obstack_finish (&muscle_obstack); + entry->value = entry->storage = xstrdup (new_val); + obstack_free (&muscle_obstack, new_val); + } +} + + +/*------------------------------------------------------------------. +| Append VALUE to the current value of KEY, using muscle_grow. But | +| in addition, issue a synchronization line for the location LOC. | +`------------------------------------------------------------------*/ + +void +muscle_code_grow (const char *key, const char *val, location loc) +{ + char *extension = NULL; + obstack_fgrow1 (&muscle_obstack, "]b4_syncline(%d, [[", loc.start.line); + MUSCLE_OBSTACK_SGROW (&muscle_obstack, + quotearg_style (c_quoting_style, loc.start.file)); + obstack_sgrow (&muscle_obstack, "]])[\n"); + obstack_sgrow (&muscle_obstack, val); + obstack_1grow (&muscle_obstack, 0); + extension = obstack_finish (&muscle_obstack); + muscle_grow (key, extension, ""); + obstack_free (&muscle_obstack, extension); +} + + +void muscle_pair_list_grow (const char *muscle, + const char *a1, const char *a2) +{ + char *pair; + obstack_sgrow (&muscle_obstack, "[[["); + MUSCLE_OBSTACK_SGROW (&muscle_obstack, a1); + obstack_sgrow (&muscle_obstack, "]], [["); + MUSCLE_OBSTACK_SGROW (&muscle_obstack, a2); + obstack_sgrow (&muscle_obstack, "]]]"); + obstack_1grow (&muscle_obstack, 0); + pair = obstack_finish (&muscle_obstack); + muscle_grow (muscle, pair, ",\n"); + obstack_free (&muscle_obstack, pair); +} + + +/*----------------------------------------------------------------------------. +| Find the value of muscle KEY. Unlike MUSCLE_FIND, this is always reliable | +| to determine whether KEY has a value. | +`----------------------------------------------------------------------------*/ + +char const * +muscle_find_const (char const *key) +{ + muscle_entry probe; + muscle_entry *result = NULL; + + probe.key = key; + result = hash_lookup (muscle_table, &probe); + if (result) + return result->value; + return NULL; +} + + +/*----------------------------------------------------------------------------. +| Find the value of muscle KEY. Abort if muscle_insert was invoked more | +| recently than muscle_grow for KEY since muscle_find can't return a | +| char const *. | +`----------------------------------------------------------------------------*/ + +char * +muscle_find (char const *key) +{ + muscle_entry probe; + muscle_entry *result = NULL; + + probe.key = key; + result = hash_lookup (muscle_table, &probe); + if (result) + { + aver (result->value == result->storage); + return result->storage; + } + return NULL; +} + + +/*------------------------------------------------. +| Output the definition of ENTRY as a m4_define. | +`------------------------------------------------*/ + +static inline bool +muscle_m4_output (muscle_entry *entry, FILE *out) +{ + fprintf (out, "m4_define([b4_%s],\n", entry->key); + fprintf (out, "[[%s]])\n\n\n", entry->value); + return true; +} + +static bool +muscle_m4_output_processor (void *entry, void *out) +{ + return muscle_m4_output (entry, out); +} + + +/*----------------------------------------------------------------. +| Output the definition of all the current muscles into a list of | +| m4_defines. | +`----------------------------------------------------------------*/ + +void +muscles_m4_output (FILE *out) +{ + hash_do_for_each (muscle_table, muscle_m4_output_processor, out); +} + +void +muscle_boundary_grow (char const *key, boundary bound) +{ + char *extension; + MUSCLE_OBSTACK_SGROW (&muscle_obstack, bound.file); + obstack_1grow (&muscle_obstack, ':'); + obstack_fgrow1 (&muscle_obstack, "%d", bound.line); + obstack_1grow (&muscle_obstack, '.'); + obstack_fgrow1 (&muscle_obstack, "%d", bound.column); + obstack_1grow (&muscle_obstack, '\0'); + extension = obstack_finish (&muscle_obstack); + muscle_grow (key, extension, ""); + obstack_free (&muscle_obstack, extension); +} + +void +muscle_grow_user_name_list (char const *key, char const *user_name, + location loc) +{ + muscle_grow (key, "[[[[", ","); + muscle_grow (key, user_name, ""); + muscle_grow (key, "]], [[", ""); + muscle_boundary_grow (key, loc.start); + muscle_grow (key, "]], [[", ""); + muscle_boundary_grow (key, loc.end); + muscle_grow (key, "]]]]", ""); }