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[];
232 memset (htab->entries, 0, htab->size * sizeof (hash_entry_type));
257 This function also assumes there are no deleted entries in the table.
265 hash_entry_type *slot = htab->entries + index;
280 slot = htab->entries + index;
289 entries and repeatedly inserts the table elements. The occupancy
292 table entries is changed. */
303 olimit = htab->entries + osize;
314 p = htab->entries;
343 entry = htab->entries[index];
355 entry = htab->entries[index];
390 entry = htab->entries[index];
394 first_deleted_slot = &htab->entries[index];
396 return &htab->entries[index];
405 entry = htab->entries[index];
411 first_deleted_slot = &htab->entries[index];
414 return &htab->entries[index];
429 return &htab->entries[index];
439 if (slot < htab->entries || slot >= htab->entries + htab_size (htab)