42 	struct hashtab_node *prev, *cur, *newnode;  in hashtab_insert()  local
51 	cur = h->htable[hvalue];  in hashtab_insert()
52 	while (cur && h->keycmp(h, key, cur->key) > 0) {  in hashtab_insert()
53 		prev = cur;  in hashtab_insert()
54 		cur = cur->next;  in hashtab_insert()
57 	if (cur && (h->keycmp(h, key, cur->key) == 0))  in hashtab_insert()
80 	struct hashtab_node *cur;  in hashtab_search()  local
86 	cur = h->htable[hvalue];  in hashtab_search()
87 	while (cur && h->keycmp(h, key, cur->key) > 0)  in hashtab_search()
88 		cur = cur->next;  in hashtab_search()
90 	if (cur == NULL || (h->keycmp(h, key, cur->key) != 0))  in hashtab_search()
93 	return cur->datum;  in hashtab_search()
99 	struct hashtab_node *cur, *temp;  in hashtab_destroy()  local
105 		cur = h->htable[i];  in hashtab_destroy()
106 		while (cur) {  in hashtab_destroy()
107 			temp = cur;  in hashtab_destroy()
108 			cur = cur->next;  in hashtab_destroy()
126 	struct hashtab_node *cur;  in hashtab_map()  local
132 		cur = h->htable[i];  in hashtab_map()
133 		while (cur) {  in hashtab_map()
134 			ret = apply(cur->key, cur->datum, args);  in hashtab_map()
137 			cur = cur->next;  in hashtab_map()
147 	struct hashtab_node *cur;  in hashtab_stat()  local
152 		cur = h->htable[i];  in hashtab_stat()
153 		if (cur) {  in hashtab_stat()
156 			while (cur) {  in hashtab_stat()
158 				cur = cur->next;  in hashtab_stat()