Lines Matching defs:buckets
21 * priority. The table is essentially an array of buckets.
33 * A priority table is an array of buckets, indexed by priority. New entries are added to the end
41 /* A bit vector flagging all buckets that are currently non-empty */
43 /* The array of all buckets, indexed by priority */
44 struct bucket buckets[];
69 struct bucket *bucket = &table->buckets[priority];
94 * Unlink the buckets from any entries still in the table so the entries won't be left with
116 list_del_init(&table->buckets[priority].queue);
134 list_move_tail(entry, &table->buckets[priority].queue);
162 /* All buckets are empty. */
173 bucket = &table->buckets[top_priority];