71 	struct hashtab_node *cur, *temp;  in hashtab_destroy()  local
74 		cur = h->htable[i];  in hashtab_destroy()
75 		while (cur) {  in hashtab_destroy()
76 			temp = cur;  in hashtab_destroy()
77 			cur = cur->next;  in hashtab_destroy()
92 	struct hashtab_node *cur;  in hashtab_map()  local
95 		cur = h->htable[i];  in hashtab_map()
96 		while (cur) {  in hashtab_map()
97 			ret = apply(cur->key, cur->datum, args);  in hashtab_map()
100 			cur = cur->next;  in hashtab_map()
111 	struct hashtab_node *cur;  in hashtab_stat()  local
117 		cur = h->htable[i];  in hashtab_stat()
118 		if (cur) {  in hashtab_stat()
121 			while (cur) {  in hashtab_stat()
123 				cur = cur->next;  in hashtab_stat()
145 	struct hashtab_node *cur, *tmp, *tail;  in hashtab_duplicate()  local
184 		for (cur = new->htable[i]; cur; cur = tmp) {  in hashtab_duplicate()
185 			tmp = cur->next;  in hashtab_duplicate()
186 			destroy(cur->key, cur->datum, args);  in hashtab_duplicate()
187 			kmem_cache_free(hashtab_node_cachep, cur);  in hashtab_duplicate()