Lines Matching defs:ndelta
17 reg_size_compute(int lg_base, int lg_delta, int ndelta) {
18 return (ZU(1) << lg_base) + (ZU(ndelta) << lg_delta);
23 slab_size(int lg_page, int lg_base, int lg_delta, int ndelta) {
25 size_t reg_size = reg_size_compute(lg_base, lg_delta, ndelta);
34 * base + ndelta * delta == (ndelta + base/ndelta) * delta, which is
35 * (ndelta + ngroup) * delta. The way we choose slabbing strategies
36 * means that delta is at most the page size and ndelta < ngroup. So
60 int index, int lg_base, int lg_delta, int ndelta) {
64 sc->ndelta = ndelta;
65 size_t size = reg_size_compute(lg_base, lg_delta, ndelta);
72 sc->pgs = slab_size(lg_page, lg_base, lg_delta, ndelta);
102 int ndelta = 0;
116 lg_base, lg_delta, ndelta);
142 ndelta = 1;
144 lg_base, lg_delta, ndelta);
155 while (ndelta < ngroup) {
158 lg_base, lg_delta, ndelta);
160 ndelta++;
172 ndelta = 1;
179 while (ndelta <= ndelta_limit) {
182 lg_base, lg_delta, ndelta);
187 + (ZU(ndelta) << lg_delta);
196 + (ZU(ndelta) << lg_delta);
204 + (ZU(ndelta) << lg_delta);
206 ndelta++;
296 sc->ndelta);