hash_entry
hash_entry();
static void hash_entry(void);
struct hash_entry se_key; /* Must be first */
hash_insert(struct hash *h, unsigned int i, struct hash_entry *p,
struct hash_entry *
struct hash_entry *p;
#define DELETED ((struct hash_entry *)h)
struct hash_entry *hash_find(struct hash *, const char *, unsigned int *);
void hash_insert(struct hash *, unsigned int, struct hash_entry *, const char *);
static struct hash_entry *findsym (const char *sym, hash_table table,
static struct hash_entry empty_entry = {
(struct hash_entry *) 0, (struct hash_entry *) 0,
struct hash_entry *sym_entry =
struct hash_entry *prev, *next;
typedef struct hash_entry **hash_table;
static struct hash_entry *ndtbl[NAME_TABLE_HASH_SIZE];
static struct hash_entry *sctbl[START_COND_HASH_SIZE];
static struct hash_entry *ccltab[CCL_HASH_SIZE];
static struct hash_entry *findsym PROTO ((const char *sym,
struct hash_entry *sym_entry = table[hash_val];
struct hash_entry *new_entry;
struct hash_entry *successor;
new_entry = (struct hash_entry *)
malloc (sizeof (struct hash_entry));