109 	if (htab->table != NULL)  in hcreate_r()
121 	htab->table = (_ENTRY *) calloc(htab->size + 1, sizeof(_ENTRY));  in hcreate_r()
122 	if (htab->table == NULL)  in hcreate_r()
151 		if (htab->table[i].used > 0) {  in hdestroy_r()
152 			ENTRY *ep = &htab->table[i].entry;  in hdestroy_r()
158 	free(htab->table);  in hdestroy_r()
161 	htab->table = NULL;  in hdestroy_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()
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()
300 	if (htab->table[idx].used) {  in hsearch_r()
307 		if (htab->table[idx].used == -1  in hsearch_r()
345 		while (htab->table[idx].used);  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()
437 	htab->table[idx].used = -1;  in _hdelete()
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()
614 		if (htab->table[i].used > 0) {  in hexport_r()
615 			ENTRY *ep = &htab->table[i].entry;  in hexport_r()
807 		       htab->table);  in himport_r()
808 		if (htab->table)  in himport_r()
830 	if (!htab->table) {  in himport_r()
979 		if (htab->table[i].used > 0) {  in hwalk_r()
980 			retval = callback(&htab->table[i].entry);  in hwalk_r()