20 #define HASH(s,n) {int j=0; n=0; while(s[j]) n+=s[j++]; n%=HTAB_SIZE;} 23 {char *s=ss, *t=tt; while(*s && *s == *t){s++; t++;} i = *s - *t;} 106 COMP(name,h->h_name);
144 COMP(name,h->h_name);
174 for (h = list[i]; h; h = hh) {
198 datafmt =
"hash=%d name=%s\n";
200 for (h = list[i]; h; h = h->
h_next) {
220 for (h = list[i]; h; h = h->
h_next) {
249 for (h = list[i]; h; h = h->
h_next) {
257 s = (
char**)
tmalloc(2*
sizeof(
char*));
void htab_free(void *listp, int freedata)
void * htab_wl(void *listp)
void * htab_get(char *name, void *listp)
struct wordlist * wl_prev
void htab_print(void *listp, char *datafmt)
struct s_hashlist * h_next
struct wordlist * wl_next
void htab_delete(char *name, void *listp)
void htab_add(char *name, void *data, void *listp)
void * htab_list(void *listp)
int htab_empty(void *listp)