mirror of
https://git.savannah.gnu.org/git/bison.git
synced 2026-03-10 21:03:04 +00:00
ac72f3e9b5
(uniqstr_print_processor): New function, to avoid casts. (uniqstrs_new, hash_initialize, uniqstrs_do): Use new functions instead of casting old functions unportably. (hash_compare_uniqstr): Remove unnecessary casts.
152 lines
3.1 KiB
C
152 lines
3.1 KiB
C
/* Keep a unique copy of strings.
|
||
|
||
Copyright (C) 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 <error.h>
|
||
#include <hash.h>
|
||
#include <quotearg.h>
|
||
|
||
#include "uniqstr.h"
|
||
|
||
/*-----------------------.
|
||
| A uniqstr hash table. |
|
||
`-----------------------*/
|
||
|
||
/* Initial capacity of uniqstr hash table. */
|
||
#define HT_INITIAL_CAPACITY 257
|
||
|
||
static struct hash_table *uniqstrs_table = NULL;
|
||
|
||
/*-------------------------------------.
|
||
| Create the uniqstr for S if needed. |
|
||
`-------------------------------------*/
|
||
|
||
uniqstr
|
||
uniqstr_new (char const *s)
|
||
{
|
||
uniqstr res = hash_lookup (uniqstrs_table, s);
|
||
if (!res)
|
||
{
|
||
/* First insertion in the hash. */
|
||
res = xstrdup (s);
|
||
hash_insert (uniqstrs_table, res);
|
||
}
|
||
return res;
|
||
}
|
||
|
||
|
||
/*------------------------------.
|
||
| Abort if S is not a uniqstr. |
|
||
`------------------------------*/
|
||
|
||
void
|
||
uniqstr_assert (char const *s)
|
||
{
|
||
if (!hash_lookup (uniqstrs_table, s))
|
||
{
|
||
error (0, 0, "not a uniqstr: %s", quotearg (s));
|
||
abort ();
|
||
}
|
||
}
|
||
|
||
|
||
/*--------------------.
|
||
| Print the uniqstr. |
|
||
`--------------------*/
|
||
|
||
static inline bool
|
||
uniqstr_print (uniqstr s)
|
||
{
|
||
fprintf (stderr, "%s\n", s);
|
||
return true;
|
||
}
|
||
|
||
static bool
|
||
uniqstr_print_processor (void *s, void *null ATTRIBUTE_UNUSED)
|
||
{
|
||
return uniqstr_print (s);
|
||
}
|
||
|
||
|
||
/*-----------------------.
|
||
| A uniqstr hash table. |
|
||
`-----------------------*/
|
||
|
||
static bool
|
||
hash_compare_uniqstr (void const *m1, void const *m2)
|
||
{
|
||
return strcmp (m1, m2) == 0;
|
||
}
|
||
|
||
static unsigned int
|
||
hash_uniqstr (void const *m, unsigned int tablesize)
|
||
{
|
||
return hash_string (m, tablesize);
|
||
}
|
||
|
||
/*----------------------------.
|
||
| Create the uniqstrs table. |
|
||
`----------------------------*/
|
||
|
||
void
|
||
uniqstrs_new (void)
|
||
{
|
||
uniqstrs_table = hash_initialize (HT_INITIAL_CAPACITY,
|
||
NULL,
|
||
hash_uniqstr,
|
||
hash_compare_uniqstr,
|
||
free);
|
||
}
|
||
|
||
|
||
/*-------------------------------------.
|
||
| Perform a task on all the uniqstrs. |
|
||
`-------------------------------------*/
|
||
|
||
static void
|
||
uniqstrs_do (Hash_processor processor, void *processor_data)
|
||
{
|
||
hash_do_for_each (uniqstrs_table, processor, processor_data);
|
||
}
|
||
|
||
|
||
/*-----------------.
|
||
| Print them all. |
|
||
`-----------------*/
|
||
|
||
void
|
||
uniqstrs_print (void)
|
||
{
|
||
uniqstrs_do (uniqstr_print_processor, NULL);
|
||
}
|
||
|
||
|
||
/*--------------------.
|
||
| Free the uniqstrs. |
|
||
`--------------------*/
|
||
|
||
void
|
||
uniqstrs_free (void)
|
||
{
|
||
hash_free (uniqstrs_table);
|
||
}
|