mirror of
https://git.savannah.gnu.org/git/bison.git
synced 2026-03-10 12:53:03 +00:00
changed to use xcalloc, xnmalloc, xnrealloc, respectively, unless otherwise specified below. * src/LR0.c (allocate_itemsets): Use xnmalloc, not xcalloc, to allocate kernel_base, kernel_items, kernel_size, since they needn't be initialized to 0. (allocate_storgae): Likewise, for shiftset, redset, shift_symbol. * src/closure.c (new_closure): Likewise, for itemset. * src/derives.c (derives_compute): Likewise, for delts, derives, q. * src/lalr.c (set_goto_map): Likewise, for temp_map. (initialize_F): Likewise, for reads, edge, reads[i], includes[i]. (build_relations): Likewise for edge, states1, includes. * src/nullable.c (nullable_compute): Likewise, for squeue, relts. * src/reader.c (packgram): Likewise, for ritem, rules. * src/reduce.c (nonterminals_reduce): Likewise for nontermmap. * src/relation.c (relation_digraph): Likewise for VERTICES. (relation_transpose): Likewise for new_R, end_R. * src/symtab.c (symbols_token_translations_init): Likewise for token_translations. * src/tables.c (save_row): Likewise for froms, tos, conflict_tos. (token_actions): Likewise for yydefact, actrow, conflrow, conflict_list. (save_column): Likewise for froms[symno], tos[symno]. (goto_actions): Likewise for state_count. (pack_table): Likewise for base, pos, check. (tables_generate): Likewise for width. * src/LR0.c (set_states): Don't reuse kernel_size and kernel_base for initial core. Just have a separate core, so we needn't worry about whether kernel_size and kernel_base are initialized. * src/LR0.c (shift_symbol, redset, shiftset, kernel_base, kernel_size, kernel_items): Remove unnecessary initialization. * src/conflicts.c (conflicts): Likewise. * src/derives.c (derives): Likewise. * src/muscle_tablc (muscle_insert): Likewise. * src/relation.c (relation_digraph): Likewise. * src/tables.c (froms, tos, conflict_tos, tally, width, actrow, order, conflrow, conflict_table, conflict_list, table, check): Likewise. * src/closure.c (new_closure): Arg is of type unsigned int, not int. This is because all callers pass unsigned int. * src/closure.h (new_closure): Likewise. * src/lalr.c (initialize_F): Initialize reads[i] in all cases. (build_relations): Initialize includes[i] in all cases. * src/reader.c (packgram): Always initialize rules[ruleno].prec and rules[ruleno].precsym. Initialize members in order. * src/relation.c (relation_transpose): Always initialize new_R[i] and end_R[i]. * src/table.c (conflict_row): Initialize 0 at end of conflict_list. * src/output.c (prepare_actions): Pass 0 instead of conflict_list[0]; conflict_list[0] was always 0, but now it isn't initialized. * src/table.c (table_grow): When conflict_table grew, the grown area wasn't cleared. Fix this.
240 lines
6.8 KiB
C
240 lines
6.8 KiB
C
/* Muscle table manager for Bison.
|
|
|
|
Copyright (C) 2001, 2002, 2003, 2004 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"
|
|
|
|
typedef struct
|
|
{
|
|
const char *key;
|
|
char *value;
|
|
} muscle_entry;
|
|
|
|
/* 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)
|
|
{
|
|
muscle_entry const *m1 = x;
|
|
muscle_entry const *m2 = y;
|
|
return strcmp (m1->key, m2->key) == 0;
|
|
}
|
|
|
|
static size_t
|
|
hash_muscle (const void *x, size_t tablesize)
|
|
{
|
|
muscle_entry const *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 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);
|
|
}
|
|
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 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 = 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);
|
|
}
|
|
}
|
|
|
|
|
|
/*------------------------------------------------------------------.
|
|
| 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, "");
|
|
}
|
|
|
|
|
|
/*-------------------------------------------------------------------.
|
|
| 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 probe;
|
|
muscle_entry *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 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);
|
|
}
|