Lines Matching defs:npools
1667 idn.slabpool->npools = (ntotslabs + (minperpool - 1)) / minperpool;
1669 if ((idn.slabpool->npools & 1) == 0) {
1671 * npools needs to be odd for hashing algorithm.
1673 idn.slabpool->npools++;
1675 ASSERT(idn.slabpool->npools > 0);
1676 minperpool = (ntotslabs < idn.slabpool->npools) ?
1677 1 : (ntotslabs / idn.slabpool->npools);
1682 * npools. Only one extra slab is allocated to each pool
1685 if (ntotslabs > (idn.slabpool->npools * minperpool))
1686 nxslabs = ntotslabs - (idn.slabpool->npools * minperpool);
1689 ASSERT((nxslabs >= 0) && (nxslabs < idn.slabpool->npools));
1692 idn.slabpool->npools);
1699 (p < idn.slabpool->npools) && (ntotslabs > 0);
1742 idn.slabpool->npools);
1991 register int p, npools;
2018 npools = idn.slabpool->npools;
2021 for (p = 0; p < npools; tblp++, p++)