Lines Matching +defs:table +defs:list
11 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
75 * Look for a hash table entry. If no hash table entry for the
79 hash_search(hte_t **table, const char *s, bool mknew)
84 if (table == NULL)
85 table = htab;
88 for (hte = table[h]; hte != NULL; hte = hte->h_link) {
108 hte->h_link = table[h];
110 table[h] = hte;
122 hte_list_add(struct hte_list *list, hte_t *item)
124 if (list->len >= list->cap) {
125 list->cap = list->cap == 0 ? 1024 : 2 * list->cap;
126 list->items = xrealloc(list->items,
127 sizeof(list->items[0]) * list->cap);
129 list->items[list->len++] = item;
148 * Call the action for each name in the hash table.
155 hte_t **table = htab;
158 for (hte = table[i]; hte != NULL; hte = hte->h_link)
163 /* Run the action for each name in the symbol table, in alphabetic order. */
170 hte_t **table = htab;
173 for (hte = table[i]; hte != NULL; hte = hte->h_link)
185 * Free all contents of the hash table that this module allocated.
188 hash_free(hte_t **table)
194 for (hte = table[i]; hte != NULL; hte = nexthte) {
200 free(table);