Lines Matching refs:entries
28 so that the hash table entries are in the flexible array at the end
70 /* Current size (in entries) of the hash table. */
79 /* Current size (in entries) of the hash table, as an index into the
84 hash_entry_type entries[];
244 memset (result->entries, 0, size * sizeof (hash_entry_type));
251 This function also assumes there are no deleted entries in the table.
259 hash_entry_type *slot = htab->entries + index;
274 slot = htab->entries + index;
283 entries and repeatedly inserts the table elements. The occupancy
286 table entries is changed. */
297 olimit = htab->entries + osize;
308 p = htab->entries;
337 entry = htab->entries[index];
349 entry = htab->entries[index];
384 entry = htab->entries[index];
388 first_deleted_slot = &htab->entries[index];
390 return &htab->entries[index];
399 entry = htab->entries[index];
405 first_deleted_slot = &htab->entries[index];
408 return &htab->entries[index];
423 return &htab->entries[index];
433 if (slot < htab->entries || slot >= htab->entries + htab_size (htab)