mirror of
https://git.savannah.gnu.org/git/bison.git
synced 2026-03-09 12:23:04 +00:00
(STRUNIQ_EQ, struniq_assert, struniq_assert_p): New. Use struniq for symbols. * src/symtab.h (symbol_t): The tag member is a struniq. (symbol_type_set): Adjust. * src/symtab.c (symbol_new): Takes a struniq. (symbol_free): Don't free the tag member. (hash_compare_symbol_t, hash_symbol_t): Rename as... (hash_compare_symbol, hash_symbol): these. Use the fact that tags as struniqs. (symbol_get): Use struniq_new. * src/symlist.h, src/symlist.c (symbol_list_n_type_name_get): Returns a strniq. * src/reader.h (merger_list, grammar_currentmerge_set): The name and type members are struniqs. * src/reader.c (get_merge_function) (grammar_current_rule_merge_set): Adjust. (TYPE, current_type): Are struniq. Use struniq for file names. * src/files.h, src/files.c (infile): Split into... (grammar_file, current_file): these. * src/scan-gram.c (YY_USER_INIT, handle_syncline): Adjust. * src/reduce.c (reduce_print): Likewise. * src/getargs.c (getargs): Likewise. * src/complain.h, src/complain.c: Likewise. * src/main.c (main): Call struniqs_new early enough to use it for file names. Don't free the input file name.
208 lines
5.9 KiB
C
208 lines
5.9 KiB
C
/* Muscle table manager for Bison,
|
|
Copyright (C) 2001, 2002 Free Software Foundation, Inc.
|
|
|
|
This file is part of Bison, the GNU Compiler Compiler.
|
|
|
|
Bison is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2, or (at your option)
|
|
any later version.
|
|
|
|
Bison is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
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 "system.h"
|
|
#include "hash.h"
|
|
#include "quotearg.h"
|
|
#include "files.h"
|
|
#include "muscle_tab.h"
|
|
#include "getargs.h"
|
|
|
|
|
|
/* An obstack used to create some entries. */
|
|
struct obstack muscle_obstack;
|
|
|
|
/* Initial capacity of muscles hash table. */
|
|
#define HT_INITIAL_CAPACITY 257
|
|
|
|
struct hash_table *muscle_table = NULL;
|
|
|
|
static bool
|
|
hash_compare_muscles (void const *x, void const *y)
|
|
{
|
|
const muscle_entry_t *m1 = x;
|
|
const muscle_entry_t *m2 = y;
|
|
return strcmp (m1->key, m2->key) == 0;
|
|
}
|
|
|
|
static unsigned int
|
|
hash_muscle (const void *x, unsigned int tablesize)
|
|
{
|
|
const muscle_entry_t *m = x;
|
|
return hash_string (m->key, tablesize);
|
|
}
|
|
|
|
/*-----------------------------------------------------------------.
|
|
| Create the MUSCLE_TABLE, and initialize it with default values. |
|
|
| Also set up the MUSCLE_OBSTACK. |
|
|
`-----------------------------------------------------------------*/
|
|
|
|
void
|
|
muscle_init (void)
|
|
{
|
|
/* Initialize the muscle obstack. */
|
|
obstack_init (&muscle_obstack);
|
|
|
|
muscle_table = hash_initialize (HT_INITIAL_CAPACITY, NULL, hash_muscle,
|
|
hash_compare_muscles, free);
|
|
|
|
/* Version and input file. */
|
|
MUSCLE_INSERT_STRING ("version", VERSION);
|
|
MUSCLE_INSERT_C_STRING ("filename", 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 (const char *key, char *value)
|
|
{
|
|
muscle_entry_t probe;
|
|
muscle_entry_t *entry = NULL;
|
|
|
|
probe.key = key;
|
|
entry = hash_lookup (muscle_table, &probe);
|
|
|
|
if (!entry)
|
|
{
|
|
/* First insertion in the hash. */
|
|
entry = XMALLOC (muscle_entry_t, 1);
|
|
entry->key = key;
|
|
hash_insert (muscle_table, entry);
|
|
}
|
|
entry->value = value;
|
|
}
|
|
|
|
|
|
/*-------------------------------------------------------------------.
|
|
| Insert (KEY, VALUE). If KEY already existed, overwrite the |
|
|
| previous value. Uses MUSCLE_OBSTACK. De-allocates the previously |
|
|
| associated value. VALUE and SEPARATOR are copied. |
|
|
`-------------------------------------------------------------------*/
|
|
|
|
void
|
|
muscle_grow (const char *key, const char *val, const char *separator)
|
|
{
|
|
muscle_entry_t probe;
|
|
muscle_entry_t *entry = NULL;
|
|
|
|
probe.key = key;
|
|
entry = hash_lookup (muscle_table, &probe);
|
|
|
|
if (!entry)
|
|
{
|
|
/* First insertion in the hash. */
|
|
entry = XMALLOC (muscle_entry_t, 1);
|
|
entry->key = key;
|
|
hash_insert (muscle_table, entry);
|
|
entry->value = xstrdup (val);
|
|
}
|
|
else
|
|
{
|
|
/* Grow the current value. */
|
|
char *new_val;
|
|
obstack_sgrow (&muscle_obstack, entry->value);
|
|
free (entry->value);
|
|
obstack_sgrow (&muscle_obstack, separator);
|
|
obstack_sgrow (&muscle_obstack, val);
|
|
obstack_1grow (&muscle_obstack, 0);
|
|
new_val = obstack_finish (&muscle_obstack);
|
|
entry->value = xstrdup (new_val);
|
|
obstack_free (&muscle_obstack, new_val);
|
|
}
|
|
}
|
|
|
|
|
|
/*-------------------------------------------------------------------.
|
|
| MUSCLE is an M4 list of pairs. Create or extend it with the pair |
|
|
| (A1, A2). Note that because the muscle values are output *double* |
|
|
| quoted, one needs to strip the first level of quotes to reach the |
|
|
| list itself. |
|
|
`-------------------------------------------------------------------*/
|
|
|
|
void muscle_pair_list_grow (const char *muscle,
|
|
const char *a1, const char *a2)
|
|
{
|
|
char *pair;
|
|
obstack_fgrow2 (&muscle_obstack, "[[[%s]], [[%s]]]", a1, a2);
|
|
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. |
|
|
`-------------------------------*/
|
|
|
|
char*
|
|
muscle_find (const char *key)
|
|
{
|
|
muscle_entry_t probe;
|
|
muscle_entry_t *result = NULL;
|
|
|
|
probe.key = key;
|
|
result = hash_lookup (muscle_table, &probe);
|
|
return result ? result->value : NULL;
|
|
}
|
|
|
|
|
|
/*------------------------------------------------.
|
|
| Output the definition of ENTRY as a m4_define. |
|
|
`------------------------------------------------*/
|
|
|
|
static int
|
|
muscle_m4_output (muscle_entry_t *entry, FILE *out)
|
|
{
|
|
fprintf (out, "m4_define([b4_%s],\n", entry->key);
|
|
fprintf (out, "[[%s]])\n\n\n", entry->value);
|
|
return 1;
|
|
}
|
|
|
|
|
|
/*----------------------------------------------------------------.
|
|
| 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,
|
|
(Hash_processor) muscle_m4_output,
|
|
out);
|
|
}
|