Lines Matching defs:deadlist
1897 list_t *deadlist = &cp->cache_defrag->kmd_deadlist;
1899 * Slabs are inserted at both ends of the deadlist to
1907 list_insert_tail(deadlist, sp);
1909 list_insert_head(deadlist, sp);
4121 /* reuse the slab's AVL linkage for deadlist linkage */
4840 * on a deadlist, which is drained after the last callback completes. This means
4843 * zero for as long as the slab remains on the deadlist and until the slab is
5086 list_t *deadlist = &cp->cache_defrag->kmd_deadlist;
5097 while ((sp = list_remove_head(deadlist)) != NULL) {
5099 list_insert_tail(deadlist, sp);
5217 * deadlist, so that upon reacquiring the lock, sp has
5222 * deadlist and prevents it from being destroyed, since
5231 list_t *deadlist =
5233 list_remove(deadlist, sp);
5247 * on the deadlist after the last
5250 list_insert_head(deadlist, sp);
5396 list_t *deadlist = &cp->cache_defrag->kmd_deadlist;
5397 list_remove(deadlist, sp);
5401 list_insert_head(deadlist, sp);