69 	struct hashtab_node *cur, *temp;  in hashtab_destroy()  local
72 		cur = h->htable[i];  in hashtab_destroy()
73 		while (cur) {  in hashtab_destroy()
74 			temp = cur;  in hashtab_destroy()
75 			cur = cur->next;  in hashtab_destroy()
91 	struct hashtab_node *cur;  in hashtab_map()  local
94 		cur = h->htable[i];  in hashtab_map()
95 		while (cur) {  in hashtab_map()
96 			ret = apply(cur->key, cur->datum, args);  in hashtab_map()
99 			cur = cur->next;  in hashtab_map()
109 	struct hashtab_node *cur;  in hashtab_stat()  local
114 		cur = h->htable[i];  in hashtab_stat()
115 		if (cur) {  in hashtab_stat()
118 			while (cur) {  in hashtab_stat()
120 				cur = cur->next;  in hashtab_stat()
138 	struct hashtab_node *cur, *tmp, *tail;  in hashtab_duplicate()  local
151 		for (cur = orig->htable[i]; cur; cur = cur->next) {  in hashtab_duplicate()
156 			rc = copy(tmp, cur, args);  in hashtab_duplicate()
175 		for (cur = new->htable[i]; cur; cur = tmp) {  in hashtab_duplicate()
176 			tmp = cur->next;  in hashtab_duplicate()
177 			destroy(cur->key, cur->datum, args);  in hashtab_duplicate()
178 			kmem_cache_free(hashtab_node_cachep, cur);  in hashtab_duplicate()