70 	struct hashtab_node *cur, *temp;  in hashtab_destroy()  local
73 		cur = h->htable[i];  in hashtab_destroy()
74 		while (cur) {  in hashtab_destroy()
75 			temp = cur;  in hashtab_destroy()
76 			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()
110 	struct hashtab_node *cur;  in hashtab_stat()  local
115 		cur = h->htable[i];  in hashtab_stat()
116 		if (cur) {  in hashtab_stat()
119 			while (cur) {  in hashtab_stat()
121 				cur = cur->next;  in hashtab_stat()
140 	struct hashtab_node *cur, *tmp, *tail;  in hashtab_duplicate()  local
154 		for (cur = orig->htable[i]; cur; cur = cur->next) {  in hashtab_duplicate()
159 			rc = copy(tmp, cur, args);  in hashtab_duplicate()
178 		for (cur = new->htable[i]; cur; cur = tmp) {  in hashtab_duplicate()
179 			tmp = cur->next;  in hashtab_duplicate()
180 			destroy(cur->key, cur->datum, args);  in hashtab_duplicate()
181 			kmem_cache_free(hashtab_node_cachep, cur);  in hashtab_duplicate()