201 int hmatch_r(const char *match, int last_idx, ENTRY ** retval,  in hmatch_r()  argument
211 			*retval = &htab->table[idx].entry;  in hmatch_r()
217 	*retval = NULL;  in hmatch_r()
226 	ENTRY **retval, struct hsearch_data *htab, int flag,  in _compare_and_overwrite_entry()  argument
240 				*retval = NULL;  in _compare_and_overwrite_entry()
251 				*retval = NULL;  in _compare_and_overwrite_entry()
259 				*retval = NULL;  in _compare_and_overwrite_entry()
264 		*retval = &htab->table[idx].entry;  in _compare_and_overwrite_entry()
271 int hsearch_r(ENTRY item, ACTION action, ENTRY ** retval,  in hsearch_r()  argument
311 		ret = _compare_and_overwrite_entry(item, action, retval, htab,  in hsearch_r()
340 			ret = _compare_and_overwrite_entry(item, action, retval,  in hsearch_r()
356 			*retval = NULL;  in hsearch_r()
373 			*retval = NULL;  in hsearch_r()
391 			*retval = NULL;  in hsearch_r()
403 			*retval = NULL;  in hsearch_r()
408 		*retval = &htab->table[idx].entry;  in hsearch_r()
413 	*retval = NULL;  in hsearch_r()
976 	int retval;  in hwalk_r()  local
980 			retval = callback(&htab->table[i].entry);  in hwalk_r()
981 			if (retval)  in hwalk_r()
982 				return retval;  in hwalk_r()