Lines Matching refs:table
104 if (htab->table != NULL) { in hcreate_r()
118 htab->table = (struct env_entry_node *)calloc(htab->size + 1, in hcreate_r()
120 if (htab->table == NULL) { in hcreate_r()
150 if (htab->table[i].used > 0) { in hdestroy_r()
151 struct env_entry *ep = &htab->table[i].entry; in hdestroy_r()
157 free(htab->table); in hdestroy_r()
160 htab->table = NULL; in hdestroy_r()
207 if (htab->table[idx].used <= 0) in hmatch_r()
209 if (!strncmp(match, htab->table[idx].entry.key, key_len)) { in hmatch_r()
210 *retval = &htab->table[idx].entry; in hmatch_r()
261 if (htab->table[idx].used == hval in _compare_and_overwrite_entry()
262 && strcmp(item.key, htab->table[idx].entry.key) == 0) { in _compare_and_overwrite_entry()
267 &htab->table[idx].entry, item.data, in _compare_and_overwrite_entry()
277 if (do_callback(&htab->table[idx].entry, item.key, in _compare_and_overwrite_entry()
286 free(htab->table[idx].entry.data); in _compare_and_overwrite_entry()
287 htab->table[idx].entry.data = strdup(item.data); in _compare_and_overwrite_entry()
288 if (!htab->table[idx].entry.data) { in _compare_and_overwrite_entry()
295 *retval = &htab->table[idx].entry; in _compare_and_overwrite_entry()
331 if (htab->table[idx].used) { in hsearch_r()
338 if (htab->table[idx].used == USED_DELETED) in hsearch_r()
369 if (htab->table[idx].used == USED_DELETED in hsearch_r()
379 while (htab->table[idx].used != USED_FREE); in hsearch_r()
401 htab->table[idx].used = hval; in hsearch_r()
402 htab->table[idx].entry.key = strdup(item.key); in hsearch_r()
403 htab->table[idx].entry.data = strdup(item.data); in hsearch_r()
404 if (!htab->table[idx].entry.key || in hsearch_r()
405 !htab->table[idx].entry.data) { in hsearch_r()
414 env_callback_init(&htab->table[idx].entry); in hsearch_r()
416 env_flags_init(&htab->table[idx].entry); in hsearch_r()
420 &htab->table[idx].entry, item.data, env_op_create, flag)) { in hsearch_r()
423 _hdelete(item.key, htab, &htab->table[idx].entry, idx); in hsearch_r()
430 if (do_callback(&htab->table[idx].entry, item.key, item.data, in hsearch_r()
434 _hdelete(item.key, htab, &htab->table[idx].entry, idx); in hsearch_r()
441 *retval = &htab->table[idx].entry; in hsearch_r()
468 htab->table[idx].used = USED_DELETED; in _hdelete()
498 if (do_callback(&htab->table[idx].entry, key, NULL, in hdelete_r()
644 if (htab->table[i].used > 0) { in hexport_r()
645 struct env_entry *ep = &htab->table[i].entry; in hexport_r()
844 htab->table); in himport_r()
845 if (htab->table) in himport_r()
867 if (!htab->table) { in himport_r()
1016 if (htab->table[i].used > 0) { in hwalk_r()
1017 retval = callback(&htab->table[i].entry); in hwalk_r()