67 	int idx);
204 	unsigned int idx;  in hmatch_r()  local
207 	for (idx = last_idx + 1; idx < htab->size; ++idx) {  in hmatch_r()
208 		if (htab->table[idx].used <= 0)  in hmatch_r()
210 		if (!strncmp(match, htab->table[idx].entry.key, key_len)) {  in hmatch_r()
211 			*retval = &htab->table[idx].entry;  in hmatch_r()
212 			return idx;  in hmatch_r()
227 	unsigned int hval, unsigned int idx)  in _compare_and_overwrite_entry()  argument
229 	if (htab->table[idx].used == hval  in _compare_and_overwrite_entry()
230 	    && strcmp(item.key, htab->table[idx].entry.key) == 0) {  in _compare_and_overwrite_entry()
235 			    &htab->table[idx].entry, item.data,  in _compare_and_overwrite_entry()
245 			if (htab->table[idx].entry.callback &&  in _compare_and_overwrite_entry()
246 			    htab->table[idx].entry.callback(item.key,  in _compare_and_overwrite_entry()
255 			free(htab->table[idx].entry.data);  in _compare_and_overwrite_entry()
256 			htab->table[idx].entry.data = strdup(item.data);  in _compare_and_overwrite_entry()
257 			if (!htab->table[idx].entry.data) {  in _compare_and_overwrite_entry()
264 		*retval = &htab->table[idx].entry;  in _compare_and_overwrite_entry()
265 		return idx;  in _compare_and_overwrite_entry()
277 	unsigned int idx;  in hsearch_r()  local
298 	idx = hval;  in hsearch_r()
300 	if (htab->table[idx].used) {  in hsearch_r()
307 		if (htab->table[idx].used == -1  in hsearch_r()
309 			first_deleted = idx;  in hsearch_r()
312 			flag, hval, idx);  in hsearch_r()
327 			if (idx <= hval2)  in hsearch_r()
328 				idx = htab->size + idx - hval2;  in hsearch_r()
330 				idx -= hval2;  in hsearch_r()
336 			if (idx == hval)  in hsearch_r()
341 				htab, flag, hval, idx);  in hsearch_r()
345 		while (htab->table[idx].used);  in hsearch_r()
365 			idx = first_deleted;  in hsearch_r()
367 		htab->table[idx].used = hval;  in hsearch_r()
368 		htab->table[idx].entry.key = strdup(item.key);  in hsearch_r()
369 		htab->table[idx].entry.data = strdup(item.data);  in hsearch_r()
370 		if (!htab->table[idx].entry.key ||  in hsearch_r()
371 		    !htab->table[idx].entry.data) {  in hsearch_r()
380 		env_callback_init(&htab->table[idx].entry);  in hsearch_r()
382 		env_flags_init(&htab->table[idx].entry);  in hsearch_r()
386 		    &htab->table[idx].entry, item.data, env_op_create, flag)) {  in hsearch_r()
389 			_hdelete(item.key, htab, &htab->table[idx].entry, idx);  in hsearch_r()
396 		if (htab->table[idx].entry.callback &&  in hsearch_r()
397 		    htab->table[idx].entry.callback(item.key, item.data,  in hsearch_r()
401 			_hdelete(item.key, htab, &htab->table[idx].entry, idx);  in hsearch_r()
408 		*retval = &htab->table[idx].entry;  in hsearch_r()
429 	int idx)  in _hdelete()  argument
437 	htab->table[idx].used = -1;  in _hdelete()
445 	int idx;  in hdelete_r()  local
451 	idx = hsearch_r(e, FIND, &ep, htab, 0);  in hdelete_r()
452 	if (idx == 0) {  in hdelete_r()
467 	if (htab->table[idx].entry.callback &&  in hdelete_r()
468 	    htab->table[idx].entry.callback(key, NULL, env_op_delete, flag)) {  in hdelete_r()
475 	_hdelete(key, htab, ep, idx);  in hdelete_r()