Lines Matching defs:TABLE
56 NAME name of the hash table structure.
57 TYPE data type of the hash table entries
62 ITERATE iterating over the table entries is possible
76 if (htab->table[idx].hashval != 0)
80 if (htab->table[idx].hashval == hval
81 && COMPARE (htab->table[idx].data, val) == 0)
95 if (htab->table[idx].hashval == hval
96 && COMPARE (htab->table[idx].data, val) == 0)
99 while (htab->table[idx].hashval);
109 if (htab->table[idx].hashval == 0)
112 htab->table[idx].next = htab->first;
113 htab->first = &htab->table[idx];
117 htab->first = htab->table[idx].next = &htab->table[idx];
120 htab->table[idx].next = htab->first->next;
121 htab->first = htab->first->next = &htab->table[idx];
127 htab->table[idx].hashval = hval;
128 htab->table[idx].data = data;
133 /* Table is filled more than 90%. Resize the table. */
143 name##_ent *table = htab->table
144 #define TABLE(name) _TABLE (name)
145 TABLE(NAME);
153 htab->table = calloc ((1 + htab->size), sizeof (htab->table[0]));
154 if (htab->table == NULL)
156 /* We cannot enlarge the table. Live with what we got. This
158 htab->table = table;
162 /* Add the old entries to the new table. When iteration is
184 if (table[idx].hashval != 0)
185 insert_entry_2 (htab, table[idx].hashval,
186 lookup (htab, table[idx].hashval, table[idx].data),
187 table[idx].data);
190 free (table);
212 htab->table = (void *) calloc ((init_size + 1), sizeof (htab->table[0]));
213 if (htab->table == NULL)
227 free (htab->table);
248 if (htab->table[idx].hashval != 0)
298 if (htab->table[idx].hashval == 0)
301 return htab->table[idx].data;
