Lines Matching defs:entries
134 ht->entries = 0;
228 ht->entries = ht->deleted_entries = 0;
252 set->entries = 0;
338 assert(!ht->entries);
359 ht->entries = 0;
366 ht->entries = old_ht.entries;
372 _mesa_set_resize(struct set *set, uint32_t entries)
374 /* You can't shrink a set below its number of entries */
375 if (set->entries > entries)
376 entries = set->entries;
379 while (hash_sizes[size_index].max_entries < entries)
399 if (ht->entries >= ht->max_entries) {
401 } else if (ht->deleted_entries + ht->entries >= ht->max_entries) {
440 ht->entries++;
541 * the table deleting entries is safe.
550 ht->entries--;
564 * This function is an iterator over the set when no deleted entries are present.
572 if (!ht->entries)
588 * an iteration over the table is O(table_size) not O(entries).
614 if (ht->entries == 0)
650 /* iterate over the set with less entries */
651 if (b->entries < a->entries) {