| /illumos-gate/usr/src/cmd/mdb/common/modules/genunix/ |
| H A D | dist.c | 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) argument
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
81 dist_geometric(int buckets, int beg, int end, int minbucketsize) argument
[all...] |
| H A D | kmem.c | 381 int buckets; local
386 buckets = buffers_per_slab;
393 buckets = MIN(buckets, maxbuckets);
400 buckets = MIN(buckets, 1 + ((buffers_per_slab - 1) /
402 if ((buckets < 2) && (buffers_per_slab > 1)) {
403 buckets = 2;
410 * Passing (buckets - 1) excludes that bucket from the generated
415 distarray = dist_linear(buckets
539 boolean_t buckets = B_FALSE; local
[all...] |
| /illumos-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/ |
| H A D | Distribution.java | 51 private List <Bucket> buckets; field in class:Distribution
81 buckets = createBuckets(base, constant, frequencies);
100 buckets = new ArrayList <Bucket> (len);
101 buckets.addAll(frequencies);
111 // 2. Compute total (transient property derived from buckets)
115 int len = buckets.size();
117 bucket = buckets.get(i);
165 List <Bucket> buckets = new ArrayList <Bucket> (len);
175 buckets.add(bucket);
178 return buckets;
[all...] |
| H A D | LogDistribution.java | 47 * lower bound: 1, 2, 4, 8, etc. Mirroring these are buckets with
71 new String[] {"buckets"});
83 LogDistribution(long[] buckets) argument
85 super(0, 2, buckets); // initializes using base 0, power of 2
132 List <Distribution.Bucket> buckets = getBuckets();
133 for (Distribution.Bucket bucket : buckets) {
|
| H A D | LinearDistribution.java | 46 * and a step of 10. It has twelve buckets starting with {@code n < 0}
47 * and ending with {@code n >= 100}. The buckets in between are {@code
72 new String[] {"base", "step", "buckets" });
175 * buckets after the first.
177 * @return the step between the lower bounds of consecutive buckets
190 List <Distribution.Bucket> buckets = getBuckets();
191 int len = buckets.size();
195 bucket = buckets.get(0);
199 bucket = buckets.get(i);
203 bucket = buckets
[all...] |
| H A D | LogLinearDistribution.java | 60 new String[] { "encValue", "base", "buckets" });
185 List<Distribution.Bucket> buckets = getBuckets();
186 for (Distribution.Bucket bucket : buckets)
|
| /illumos-gate/usr/src/lib/librsm/inc/ |
| H A D | rsmlib_in.h | 58 #define RSM_MAX_BUCKETS 128 /* # buckets in the hash table */
84 rsm_pollfd_chunk_t *buckets[RSM_MAX_BUCKETS]; member in struct:__anon3902
|
| /illumos-gate/usr/src/cmd/dtrace/test/tst/common/java_api/src/ |
| H A D | TestBean.java | 205 List < Distribution.Bucket > buckets =
220 buckets.add(bucket);
222 buckets.add(bucket);
224 buckets.add(bucket);
238 buckets.add(bucket);
240 LogDistribution d = new LogDistribution(buckets);
247 List < Distribution.Bucket > buckets =
250 int n = 10; // number of buckets
254 buckets.add(bucket);
258 buckets
[all...] |
| /illumos-gate/usr/src/lib/libast/common/hash/ |
| H A D | hashlook.c | 149 * migrate popular buckets to the front
183 tab->buckets--;
242 tab->buckets--;
277 if (!tab->frozen && !(tab->flags & HASH_FIXED) && tab->buckets > tab->root->meanchain * tab->size)
335 tab->buckets++;
338 tab->buckets--;
351 tab->buckets++;
|
| H A D | hashdump.c | 123 sfprintf(sfstderr, " buckets: %d\n", tab->buckets);
|
| /illumos-gate/usr/src/cmd/ipf/tools/ |
| H A D | ipfstat.c | 1070 u_long minlen, maxlen, totallen, *buckets; local
1073 sz = sizeof(*buckets) * ipsp->iss_statesize;
1074 buckets = (u_long *)malloc(sz);
1075 if (buckets == NULL) {
1079 if (kmemcpy((char *)buckets, (u_long)ipsp->iss_bucketlen, sz)) {
1080 free(buckets);
1111 if (buckets[i] > maxlen)
1112 maxlen = buckets[i];
1113 if (buckets[i] < minlen)
1114 minlen = buckets[
[all...] |
| /illumos-gate/usr/src/uts/common/fs/nfs/ |
| H A D | nfs4_db.c | 687 rfs4_bucket_t *buckets, *bp; local
701 buckets = table->dbt_indices->dbi_buckets;
712 bp = &buckets[i];
723 * Given a table, lock each of the buckets and walk all entries (in
735 rfs4_bucket_t *buckets = table->dbt_indices->dbi_buckets, *bp; local
743 /* Walk the buckets looking for entries to release/destroy */
745 bp = &buckets[i];
765 rfs4_bucket_t *buckets = idx->dbi_buckets, *bp; local
776 /* Walk the buckets looking for entries to release/destroy */
778 bp = &buckets[
[all...] |
| /illumos-gate/usr/src/lib/libast/amd64/include/ast/ |
| H A D | hash.h | 184 int buckets; /* active bucket count */ member in struct:Hash_table
|
| /illumos-gate/usr/src/lib/libast/common/include/ |
| H A D | hash.h | 175 int buckets; /* active bucket count */ member in struct:Hash_table
|
| /illumos-gate/usr/src/lib/libast/i386/include/ast/ |
| H A D | hash.h | 184 int buckets; /* active bucket count */ member in struct:Hash_table
|
| /illumos-gate/usr/src/lib/libast/sparc/include/ast/ |
| H A D | hash.h | 184 int buckets; /* active bucket count */ member in struct:Hash_table
|
| /illumos-gate/usr/src/lib/libast/sparcv9/include/ast/ |
| H A D | hash.h | 184 int buckets; /* active bucket count */ member in struct:Hash_table
|
| /illumos-gate/usr/src/uts/common/sys/ |
| H A D | kobj.h | 79 symid_t *buckets; member in struct:module
|
| /illumos-gate/usr/src/boot/sys/boot/common/ |
| H A D | load_elf.c | 60 Elf_Hashelt *buckets; member in struct:elf_file
705 ef->buckets = ef->hashtab + 2;
706 ef->chains = ef->buckets + ef->nbuckets;
1010 COPYOUT(&ef->buckets[hash % ef->nbuckets], &symnum, sizeof(symnum));
|
| /illumos-gate/usr/src/cmd/mdb/common/modules/libumem/ |
| H A D | umem.c | 3888 int buckets; local
3897 nbucks = buckets = maxb - minb + 1;
3904 buckets = MIN(buckets, maxbuckets);
3907 buckets = MIN(buckets, nbucks/minbucketsize);
3908 if (buckets == 0) {
3909 buckets = 1;
3915 distarray = dist_geometric(buckets, minb, maxb, minbucketsize);
3917 distarray = dist_linear(buckets, min
[all...] |
| /illumos-gate/usr/src/lib/librsm/common/ |
| H A D | rsmlib.c | 146 pollfd_table.buckets[i] = NULL;
407 chunk = pollfd_table.buckets[hash];
428 chunk->next = pollfd_table.buckets[hash];
429 pollfd_table.buckets[hash] = chunk;
469 chunk = pollfd_table.buckets[RSM_POLLFD_HASH(segfd)];
512 prev_chunk = chunk = pollfd_table.buckets[hash];
528 pollfd_table.buckets[hash] =
|
| /illumos-gate/usr/src/uts/common/krtld/ |
| H A D | kobj.c | 840 KOBJ_MARK("buckets");
841 mp->buckets = kobj_zalloc(mp->hashsize * sizeof (symid_t), KM_WAIT);
946 mp->buckets = kobj_zalloc(mp->hashsize * sizeof (symid_t), KM_WAIT);
1546 * symbol table, buckets, chains, and strings.
1566 mp->buckets = (symid_t *)(mp->symtbl + (nsyms * symsize));
1567 mp->chains = (symid_t *)(mp->buckets + mp->hashsize);
2545 * Allocate space for the symbol table, buckets, chains, and strings.
2552 mp->buckets = (symid_t *)(mp->symtbl + mp->symhdr->sh_size);
2553 mp->chains = mp->buckets + mp->hashsize;
3334 for (ip = &mp->buckets[kobj_hash_nam
[all...] |
| /illumos-gate/usr/src/cmd/sgs/rtld/common/ |
| H A D | elf.c | 1316 * | # of buckets |
1351 uint_t ndx, hashoff, buckets, *chainptr; local
1367 buckets = HASH(ilmp)[0];
1369 hashoff = ((uint_t)hash % buckets) + 2;
1378 chainptr = HASH(ilmp) + 2 + buckets;
1391 hashoff = ndx + buckets + 2;
|
| /illumos-gate/usr/src/cmd/sendmail/src/ |
| H A D | queue.c | 7529 ** buckets -- the number of buckets (queue directories)
7539 hashfqn(fqn, buckets)
7541 int buckets;
7561 if (buckets < 2)
7564 hash = (h % buckets);
|