Hash_Entry
register struct Hash_Entry **hp;
t->bucketPtr = hp = (struct Hash_Entry **)emalloc(sizeof(*hp) * i);
register struct Hash_Entry **hp, *h, *nexth = NULL;
Hash_Entry *
register Hash_Entry *e;
Hash_Entry *
register Hash_Entry *e;
struct Hash_Entry **hp;
e = (Hash_Entry *) emalloc(sizeof(*e) + keylen);
Hash_DeleteEntry(Hash_Table *t, Hash_Entry *e)
register Hash_Entry **hp, *p;
Hash_Entry *
Hash_Entry *
register Hash_Entry *e;
register Hash_Entry *e, *next = NULL, **hp, **xp;
register Hash_Entry **oldhp;
t->bucketPtr = hp = (struct Hash_Entry **) emalloc(sizeof(*hp) * i);
Hash_Entry *Hash_FindEntry(Hash_Table *, char *);
Hash_Entry *Hash_CreateEntry(Hash_Table *, char *, Boolean *);
void Hash_DeleteEntry(Hash_Table *, Hash_Entry *);
Hash_Entry *Hash_EnumFirst(Hash_Table *, Hash_Search *);
Hash_Entry *Hash_EnumNext(Hash_Search *);
struct Hash_Entry *next; /* Used to link together all the
struct Hash_Entry **bucketPtr;
Hash_Entry *hashEntryPtr; /* Next entry to check in current
Hash_Entry *entry;
Hash_Entry *entry;
Hash_Entry *entry;
static Hash_Entry *make_fake_provision(filenode *);
static void generate_graphviz_file_links(Hash_Entry *, filenode *);
Hash_Entry *entry;
Hash_Entry *entry;
static Hash_Entry *
Hash_Entry *entry;
Hash_Entry *entry, *fake_prov_entry;
generate_graphviz_file_links(Hash_Entry *entry, filenode *fnode)
Hash_Entry *entry;