Lines Matching refs:TABLE
20 NAME name of the hash table structure.
21 TYPE data type of the hash table entries
26 ITERATE iterating over the table entries is possible
40 if (htab->table[idx].hashval != 0)
44 if (htab->table[idx].hashval == hval
45 && COMPARE (htab->table[idx].data, val) == 0)
59 if (htab->table[idx].hashval == hval
60 && COMPARE (htab->table[idx].data, val) == 0)
63 while (htab->table[idx].hashval);
73 if (htab->table[idx].hashval == 0)
76 htab->table[idx].next = htab->first;
77 htab->first = &htab->table[idx];
81 htab->first = htab->table[idx].next = &htab->table[idx];
84 htab->table[idx].next = htab->first->next;
85 htab->first = htab->first->next = &htab->table[idx];
91 htab->table[idx].hashval = hval;
92 htab->table[idx].data = data;
97 /* Table is filled more than 90%. Resize the table. */
107 name##_ent *table = htab->table
108 #define TABLE(name) _TABLE (name)
109 TABLE(NAME);
117 htab->table = calloc ((1 + htab->size), sizeof (htab->table[0]));
118 if (htab->table == NULL)
120 /* We cannot enlarge the table. Live with what we got. This
122 htab->table = table;
126 /* Add the old entries to the new table. When iteration is
148 if (table[idx].hashval != 0)
149 insert_entry_2 (htab, table[idx].hashval,
150 lookup (htab, table[idx].hashval, table[idx].data),
151 table[idx].data);
154 free (table);
176 htab->table = (void *) calloc ((init_size + 1), sizeof (htab->table[0]));
177 if (htab->table == NULL)
191 free (htab->table);
212 if (htab->table[idx].hashval != 0)
262 if (htab->table[idx].hashval == 0)
265 return htab->table[idx].data;
