Searched refs:slabpool (Results 1 – 4 of 4) sorted by relevance
1657 (idn.slabpool != NULL) || in smr_slabpool_init()1662 idn.slabpool = GETSTRUCT(struct slabpool, 1); in smr_slabpool_init()1663 idn.slabpool->ntotslabs = ntotslabs = nwr_available / IDN_SLAB_SIZE; in smr_slabpool_init()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()[all …]
3876 if (idn.slabpool == NULL) { in idn_slabpool_report()3883 for (p = nfree = 0; p < idn.slabpool->npools; p++) in idn_slabpool_report()3884 nfree += idn.slabpool->pool[p].nfree; in idn_slabpool_report()3889 idn.slabpool->ntotslabs, in idn_slabpool_report()3890 idn.slabpool->ntotslabs - nfree, 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()3900 for (s = 0; s < idn.slabpool->pool[p].nslabs; s++) { in idn_slabpool_report()3903 dd = idn.slabpool->pool[p].sarray[s].sl_domid; in idn_slabpool_report()3923 p, idn.slabpool->pool[p].nslabs, in idn_slabpool_report()[all …]
101 #define IDN_SLAB_MAXNUM (idn.slabpool->ntotslabs)133 #define SMR_SLABPOOL_HASH(d) ((d) % idn.slabpool->npools)134 #define SMR_SLABPOOL_HASHSTEP(p) (((p)+4) % idn.slabpool->npools)136 ((d) % idn.slabpool->pool[p].nslabs)138 (((s)+1) % idn.slabpool->pool[p].nslabs)
2963 struct slabpool { struct2998 } *slabpool; member