Lines Matching refs:buckets
37 * number of buckets, adding one bucket at the end that is one past the end of
38 * the range. The returned buckets will be automatically freed when the dcmd
42 dist_linear(int buckets, int beg, int end)
44 int *out = mdb_alloc((buckets + 1) * sizeof (*out), UM_SLEEP | UM_GC);
48 for (pos = 0; pos < buckets; pos++)
49 out[pos] = beg + (pos * dist)/buckets;
50 out[buckets] = end + 1;
64 * buckets
69 * buckets ___________________
74 * buckets
76 * (log ((end + 1) / beg)) / buckets
81 dist_geometric(int buckets, int beg, int end, int minbucketsize)
84 return (dist_linear(buckets, beg, end));
86 int *out = mdb_alloc((buckets + 1) * sizeof (*out), UM_SLEEP | UM_GC);
97 if (buckets == 1) {
107 r = exp(log((double)(end + 1) / beg) / buckets);
118 * above, into integer-sized buckets, with a specified minimum
120 * any inadequate buckets must be at the beginning. To deal
121 * with this, we make buckets of minimum size until b catches up
133 for (idx = 0; idx < buckets; idx++) {
146 out[buckets] = end + 1;