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()
102 				if ((*free_data)(prev->data, force) ==  in hashi_FreeMember()
105 					prev->next = unfree;  in hashi_FreeMember()
106 					unfree = prev;  in hashi_FreeMember()
108 					free(prev);  in hashi_FreeMember()
111 				free(prev);  in hashi_FreeMember()
271     boolean_t (*free_data)(), hash_member **prev)  in hashi_Exists()  argument
306 	if (prev != NULL)  in hashi_Exists()
307 		*prev = prevptr;  in hashi_Exists()
360 	hash_member *prev = NULL;  in hash_Insert()  local
368 	    &prev)) {  in hash_Insert()
377 	prev->next = temp;  in hash_Insert()
479 	hash_member *prev = NULL;  in hash_Delete()  local
488 	if (hashi_Exists(bucketptr, compare, key, free_data, &prev) ==  in hash_Delete()
489 	    B_FALSE || prev == NULL) {  in hash_Delete()
495 	temp = prev->next;  in hash_Delete()
497 		prev->next = temp->next;  in hash_Delete()
501 		prev->next = NULL;  in hash_Delete()
519 	hash_member *prev = NULL;  in hash_Lookup()  local
527 	    &prev) == B_TRUE) {  in hash_Lookup()
532 			hashi_Dhold(prev->next);  in hash_Lookup()
533 		ret = prev->next->data;  in hash_Lookup()