Lines Matching refs:table
35 NAME name of the hash table structure.
36 TYPE data type of the hash table entries
41 ITERATE iterating over the table entries is possible
53 if (htab->table[idx].hashval != 0)
57 if (htab->table[idx].hashval == hval
58 && COMPARE (htab->table[idx].data, val) == 0)
72 if (htab->table[idx].hashval == hval
73 && COMPARE (htab->table[idx].data, val) == 0)
76 while (htab->table[idx].hashval);
86 if (htab->table[idx].hashval == 0)
89 htab->table[idx].next = htab->first;
90 htab->first = &htab->table[idx];
94 htab->first = htab->table[idx].next = &htab->table[idx];
97 htab->table[idx].next = htab->first->next;
98 htab->first = htab->first->next = &htab->table[idx];
104 htab->table[idx].hashval = hval;
105 htab->table[idx].data = data;
110 /* Table is filled more than 90%. Resize the table. */
120 name##_ent *table = htab->table
121 #define TABLE(name) _TABLE (name)
122 TABLE(NAME);
130 htab->table = calloc ((1 + htab->size), sizeof (htab->table[0]));
131 if (htab->table == NULL)
133 /* We cannot enlarge the table. Live with what we got. This
135 htab->table = table;
139 /* Add the old entries to the new table. When iteration is
161 if (table[idx].hashval != 0)
162 insert_entry_2 (htab, table[idx].hashval,
163 lookup (htab, table[idx].hashval, table[idx].data),
164 table[idx].data);
167 free (table);
187 htab->table = (void *) calloc ((init_size + 1), sizeof (htab->table[0]));
188 if (htab->table == NULL)
201 free (htab->table);
219 if (htab->table[idx].hashval != 0)
263 if (htab->table[idx].hashval == 0)
266 return htab->table[idx].data;
