Lines Matching refs:lists
22 * The MRU Cache data structure consists of a data store, an array of lists and
28 * The group count controls how many lists are created, and thereby how finely
30 * all the lists whose time has expired are deleted.
34 * five. Five internal lists will be created, each representing a two second
74 * current list. Doubly linked lists are used to make the list maintenance
76 * inserts and lookups can occur when there are no free lists available. When
90 * both the data store and to one of the lists. It must also be possible to
100 * likely result in a loop in one of the lists. That's a sure-fire recipe for
115 * lists relative to a particular time. In the case of destroying, that time
120 * list again and again until either a) the lists are all empty, or b) time zero
128 * zero if there's no need to schedule more work because the lists are empty.
143 /* While time zero is older than the time spanned by all the lists. */
150 lru_list = mru->lists + mru->lru_grp;
163 * lists have been migrated to the reap list, it's now empty.
176 lru_list = mru->lists + ((mru->lru_grp + grp) % mru->grp_count);
182 /* All the lists must be empty. */
190 * MRU list. The lists must be migrated first to ensure that they're
220 list_add_tail(&elem->list_node, mru->lists + grp);
283 ASSERT(mru && mru->lists);
284 if (!mru || !mru->lists)
362 mru->lists = kmem_zalloc(mru->grp_count * sizeof(*mru->lists), KM_SLEEP);
364 if (!mru->lists) {
370 INIT_LIST_HEAD(mru->lists + grp);
387 if (err && mru && mru->lists)
388 kmem_free(mru->lists);
405 if (!mru || !mru->lists)
425 if (!mru || !mru->lists)
430 kmem_free(mru->lists);
447 ASSERT(mru && mru->lists);
448 if (!mru || !mru->lists)
489 ASSERT(mru && mru->lists);
490 if (!mru || !mru->lists)
550 ASSERT(mru && mru->lists);
551 if (!mru || !mru->lists)