Searched refs:npools (Results 1 – 5 of 5) sorted by relevance
1667 idn.slabpool->npools = (ntotslabs + (minperpool - 1)) / minperpool; in smr_slabpool_init()1669 if ((idn.slabpool->npools & 1) == 0) { in smr_slabpool_init()1673 idn.slabpool->npools++; in smr_slabpool_init()1675 ASSERT(idn.slabpool->npools > 0); in smr_slabpool_init()1676 minperpool = (ntotslabs < idn.slabpool->npools) ? in smr_slabpool_init()1677 1 : (ntotslabs / idn.slabpool->npools); in smr_slabpool_init()1685 if (ntotslabs > (idn.slabpool->npools * minperpool)) in smr_slabpool_init()1686 nxslabs = ntotslabs - (idn.slabpool->npools * minperpool); in smr_slabpool_init()1689 ASSERT((nxslabs >= 0) && (nxslabs < idn.slabpool->npools)); in smr_slabpool_init()1692 idn.slabpool->npools); in smr_slabpool_init()[all …]
3883 for (p = nfree = 0; p < idn.slabpool->npools; p++) in idn_slabpool_report()3891 idn.slabpool->npools); in idn_slabpool_report()3895 for (p = 0; p < idn.slabpool->npools; p++) { in idn_slabpool_report()
133 #define SMR_SLABPOOL_HASH(d) ((d) % idn.slabpool->npools)134 #define SMR_SLABPOOL_HASHSTEP(p) (((p)+4) % idn.slabpool->npools)
2976 int npools; member
2508 int npools; in zpool_do_iostat() local2564 if ((npools = pool_list_count(list)) == 0) in zpool_do_iostat()2596 if (npools > 1 && !verbose) in zpool_do_iostat()