94 	hash_member *prev, *next, *unfree = NULL;  in hashi_FreeMember()  local
98 		for (prev = *bucketptr; prev; prev = next) {  in hashi_FreeMember()
99 			next = prev->next;  in hashi_FreeMember()
100 			prev->next = NULL;  in hashi_FreeMember()
105 					prev->next = unfree;  in hashi_FreeMember()
147 	hash_member *next;  in hashi_Dfree()  local
149 	next = memberptr->next;  in hashi_Dfree()
150 	memberptr->next = NULL;  in hashi_Dfree()
154 		memberptr->next = next;  in hashi_Dfree()
254 		(void) hashi_FreeMember(&bucketptr->next, free_data, B_TRUE);  in hash_Reset()
255 		bucketptr->next = NULL;  in hash_Reset()
274 	hash_member *memberptr = bucketptr->next;  in hashi_Exists()
276 	hash_member *next;  in hashi_Exists()  local
286 			next = memberptr->next;  in hashi_Exists()
289 				prevptr->next = memberptr = next;  in hashi_Exists()
303 		memberptr = memberptr->next;  in hashi_Exists()
318 	hash_member *memberptr = bucketptr->next;  in hashi_Expire()
320 	hash_member *next;  in hashi_Expire()  local
330 			next = memberptr->next;  in hashi_Expire()
334 				prevptr->next = memberptr = next;  in hashi_Expire()
339 		memberptr = memberptr->next;  in hashi_Expire()
377 	prev->next = temp;  in hash_Insert()
379 	temp->next = NULL;  in hash_Insert()
495 	temp = prev->next;  in hash_Delete()
497 		prev->next = temp->next;  in hash_Delete()
498 		temp->next = NULL;  in hash_Delete()
501 		prev->next = NULL;  in hash_Delete()
532 			hashi_Dhold(prev->next);  in hash_Lookup()
533 		ret = prev->next->data;  in hash_Lookup()