Lines Matching defs:slabs
134 * making the slabs themselves more efficient, and the other zone is for
1174 u_int slabs, pages;
1191 * This is done if the number of slabs is larger than the hash size.
1195 if ((slabs = pages / keg->uk_ppera) > keg->uk_hash.uh_hashsize) {
1207 ret = hash_alloc(&newhash, 1 << fls(slabs));
1649 * Are the free items in partially allocated slabs sufficient to meet
1650 * the reserve? If not, compute the number of fully free slabs that must
1663 * Partition the free slabs into two sets: those that must be kept in
1917 * startup_alloc() returns direct-mapped slabs on some platforms. Avoid
2373 * may end up going to the VM for slabs which we do not want
2720 "Unused slabs");
3427 * Large slabs are expensive to reclaim, so don't bother doing
3942 * Find a slab with some space. Prefer slabs that are partially used over those
4099 * keg_fetch_slab() always returns slabs on the partial list.
5247 int aflags, domain, slabs;
5250 slabs = howmany(items, keg->uk_ipers);
5251 while (slabs-- > 0) {
5351 * Some slabs may have been freed but this zone will be visited early