1993-06-29 09:51:23 +00:00
|
|
|
/* hash.h - for hash.c
|
1993-11-03 00:56:24 +00:00
|
|
|
Copyright (C) 1987, 1992 Free Software Foundation, Inc.
|
1995-05-30 05:05:38 +00:00
|
|
|
|
1993-11-03 00:56:24 +00:00
|
|
|
This file is part of GAS, the GNU Assembler.
|
1995-05-30 05:05:38 +00:00
|
|
|
|
1993-11-03 00:56:24 +00:00
|
|
|
GAS 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.
|
1995-05-30 05:05:38 +00:00
|
|
|
|
1993-11-03 00:56:24 +00:00
|
|
|
GAS 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.
|
1995-05-30 05:05:38 +00:00
|
|
|
|
1993-11-03 00:56:24 +00:00
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with GAS; see the file COPYING. If not, write to
|
|
|
|
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
|
|
|
|
/*
|
1999-08-27 23:37:10 +00:00
|
|
|
* $FreeBSD$
|
1993-11-03 00:56:24 +00:00
|
|
|
*/
|
1993-06-29 09:51:23 +00:00
|
|
|
|
|
|
|
|
|
|
|
#ifndef hashH
|
|
|
|
#define hashH
|
|
|
|
|
|
|
|
struct hash_entry
|
|
|
|
{
|
1993-11-03 00:56:24 +00:00
|
|
|
char *hash_string; /* points to where the symbol string is */
|
|
|
|
/* NULL means slot is not used */
|
|
|
|
/* DELETED means slot was deleted */
|
|
|
|
char *hash_value; /* user's datum, associated with symbol */
|
1993-06-29 09:51:23 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
#define HASH_STATLENGTH (6)
|
|
|
|
struct hash_control
|
|
|
|
{
|
1993-11-03 00:56:24 +00:00
|
|
|
struct hash_entry *hash_where; /* address of hash table */
|
|
|
|
int hash_sizelog; /* Log of ( hash_mask + 1 ) */
|
|
|
|
int hash_mask; /* masks a hash into index into table */
|
|
|
|
int hash_full; /* when hash_stat[STAT_USED] exceeds this, */
|
|
|
|
/* grow table */
|
|
|
|
struct hash_entry * hash_wall; /* point just after last (usable) entry */
|
|
|
|
/* here we have some statistics */
|
|
|
|
int hash_stat[HASH_STATLENGTH]; /* lies & statistics */
|
|
|
|
/* we need STAT_USED & STAT_SIZE */
|
1993-06-29 09:51:23 +00:00
|
|
|
};
|
|
|
|
|
1993-11-03 00:56:24 +00:00
|
|
|
/* fixme: prototype. */
|
|
|
|
|
|
|
|
/* returns */
|
|
|
|
struct hash_control *hash_new(); /* [control block] */
|
|
|
|
void hash_die();
|
|
|
|
void hash_say();
|
|
|
|
char *hash_delete(); /* previous value */
|
|
|
|
char *hash_relpace(); /* previous value */
|
|
|
|
char *hash_insert(); /* error string */
|
|
|
|
char *hash_apply(); /* 0 means OK */
|
|
|
|
char *hash_find(); /* value */
|
|
|
|
char *hash_jam(); /* error text (internal) */
|
1993-06-29 09:51:23 +00:00
|
|
|
|
1993-11-03 00:56:24 +00:00
|
|
|
#endif /* #ifdef hashH */
|
1993-06-29 09:51:23 +00:00
|
|
|
|
1993-11-03 00:56:24 +00:00
|
|
|
/* end of hash.h */
|