Home
last modified time | relevance | path

Searched full:bucket (Results 1 – 25 of 362) sorted by relevance

12345678910>>...15

/illumos-gate/usr/src/cmd/dtrace/test/tst/common/java_api/
H A Dtst.Bean.ksh.out45 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
56 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
68 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
79 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
150 …Bucket[min = -4611686018427387904, max = -2305843009213693953, frequency = 0], org.opensolaris.os.…
151 …Bucket[min = -4611686018427387904, max = -2305843009213693953, frequency = 0], org.opensolaris.os.…
153 …Bucket[min = -4611686018427387904, max = -2305843009213693953, frequency = 0], org.opensolaris.os.…
154 …Bucket[min = -4611686018427387904, max = -2305843009213693953, frequency = 0], org.opensolaris.os.…
156 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
157 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
[all …]
/illumos-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/
H A DDistribution.java37 * range known as a bucket and counts toward the frequency of that
38 * bucket. Bucket ranges are consecutive, with the maximum of one
39 * bucket's range always one less than the minimum of the next bucket's
40 * range. By convention each bucket is identified by the minimum of its
46 Iterable <Distribution.Bucket>, Serializable
51 private List <Bucket> buckets;
62 * used to calculate the lower bound of any bucket given the lower
63 * bound of the previous bucket, for example the step in a linear
65 * @param frequencies for each bucket, the number of aggregated
66 * values falling into that bucket's range; each element must be a
[all …]
H A DLinearDistribution.java38 * Each range, known as a bucket, begins at the {@code lquantize()}
40 * step, unless it is the first bucket, which is the frequency of all
41 * aggregated values less than the base. The last bucket counts all
98 * the second bucket in this distribution (the first bucket contains
101 * bucket and the lower bound of the next consecutive bucket
102 * (excluding the first bucket)
103 * @param frequencies list of frequencies in each bucket range
107 * one, or if any bucket does not have the expected range
112 List <Bucket> frequencies) in LinearDistribution()
134 // first bucket is everything less than the base in getBucketRange()
[all …]
H A DLogLinearDistribution.java84 * @param frequencies list of frequencies in each bucket range
87 List<Bucket> frequencies) { in LogLinearDistribution()
105 * @param frequencies list of frequencies in each bucket range
109 List<Bucket> frequencies) { in LogLinearDistribution()
126 int order, bucket = 0; in fillRangeCache() local
141 rangeCache[bucket][0] = Long.MIN_VALUE; in fillRangeCache()
142 rangeCache[bucket][1] = value - 1; in fillRangeCache()
143 bucket++; in fillRangeCache()
149 rangeCache[bucket][0] = value; in fillRangeCache()
150 rangeCache[bucket][1] = value + step - 1; in fillRangeCache()
[all …]
H A DLogDistribution.java38 * range, known as a bucket, begins at two to the power of <i>n</i> and
39 * ends at one less than the beginning of the next bucket, two to the
40 * power of <i>n + 1</i>. The zero bucket is the degenerate case and
42 * bucket after 0 starts at 1 (2 to the power of 0) and ends at 1 (one
43 * less than 2 to the power of 1). The next bucket starts at 2 (2 to
45 * Each bucket frequency is incremented for each aggregated value that
92 * @param frequencies list of frequencies in bucket ranges bounded
96 * @throws IllegalArgumentException if any bucket does not have the
100 LogDistribution(List <Bucket> frequencies) in LogDistribution()
132 List <Distribution.Bucket> buckets = getBuckets(); in getValue()
[all …]
/illumos-gate/usr/src/uts/common/os/
H A Dtaskq.c379 * One additional bucket is used as the "idle bucket" (details below).
381 * Each bucket also has a "backlog" list, used to store pending jobs,
384 * threads become available in each bucket, they begin work on the backlog
388 * Each bucket usually has some worker threads ready to accept new work,
390 * that array of buckets there is one more bucket called the "idle bucket",
392 * bucket when that bucket needs another worker thread. When a dispatch
394 * bucket free list nor in the idle bucket, it will attempt to create a
395 * new thread in the hashed bucket (see taskq_bucket_extend).
397 * Dispatch first tries a bucket chosen by hash, then the idle bucket.
399 * bucket chosen by hash, and makes a dispatch attempt on that bucket.
[all …]
/illumos-gate/usr/src/lib/libpool/common/
H A Ddict.c61 * bucket is acceptable, but if there is too much overflow, then
71 * A key bucket.
77 struct dict_bucket *db_next; /* next bucket */
294 dict_bucket_t *bucket; in dict_get() local
297 for (bucket = hdl->dh_buckets[i]; bucket != NULL; in dict_get()
298 bucket = bucket->db_next) in dict_get()
299 if ((*hdl->dh_cmp)(key, bucket->db_key) == 0) in dict_get()
301 return (bucket ? bucket->db_value : NULL); in dict_get()
312 dict_bucket_t *bucket; in dict_put() local
316 for (bucket = hdl->dh_buckets[i]; bucket != NULL; in dict_put()
[all …]
/illumos-gate/usr/src/cmd/dtrace/test/tst/common/java_api/src/
H A DTestBean.java205 List < Distribution.Bucket > buckets = in getLogDistribution()
206 new ArrayList < Distribution.Bucket > (); in getLogDistribution()
207 Distribution.Bucket bucket; in getLogDistribution() local
219 bucket = new Distribution.Bucket(-1, -1, n++); in getLogDistribution()
220 buckets.add(bucket); in getLogDistribution()
221 bucket = new Distribution.Bucket(0, 0, n++); in getLogDistribution()
222 buckets.add(bucket); in getLogDistribution()
223 bucket = new Distribution.Bucket(1, 1, n++); in getLogDistribution()
224 buckets.add(bucket); in getLogDistribution()
237 bucket = new Distribution.Bucket(lowerBound, upperBound, n++); in getLogDistribution()
[all …]
/illumos-gate/usr/src/lib/libtecla/common/
H A Dhash.c64 HashNode *next; /* The next hash-table entry in a bucket list */
68 * Each hash-table bucket contains a linked list of entries that
69 * hash to the same bucket.
72 HashNode *head; /* The head of the bucket hash-node list */
85 HashBucket *bucket; /* An array of 'size' hash buckets */ member
94 static HashNode *_find_HashNode(HashTable *hash, HashBucket *bucket,
251 hash->bucket = NULL; in _new_HashTable()
258 hash->bucket = (HashBucket *) malloc(sizeof(HashBucket) * size); in _new_HashTable()
259 if(!hash->bucket) { in _new_HashTable()
264 * Initialize the bucket array. in _new_HashTable()
[all …]
/illumos-gate/usr/src/lib/libbsdmalloc/common/
H A Dmalloc.bsd43.c58 uchar_t ovu_index; /* bucket # */
62 uchar_t ovu_index; /* bucket # */
91 static int pagebucket; /* page size bucket */
99 int bucket; in malloc() local
128 bucket = 0; in malloc()
132 bucket++; in malloc()
134 pagebucket = bucket; in malloc()
142 amt = (1UL << EXP); /* size of first bucket */ in malloc()
143 bucket = 0; in malloc()
147 bucket = pagebucket; in malloc()
[all …]
/illumos-gate/usr/src/contrib/ast/src/lib/libast/include/
H A Dhash.h43 #define HASH_CREATE (1L<<8) /* create bucket if not found */
44 #define HASH_DELETE (1L<<9) /* delete bucket if found */
46 #define HASH_RENAME (1L<<7) /* rename bucket if found */
48 #define HASH_BUCKET (1L<<11) /* name is installed bucket */
49 #define HASH_INSTALL (1L<<12) /* install allocated bucket */
51 #define HASH_OPAQUE (1L<<14) /* opaque bucket */
52 #define HASH_VALUE (1L<<15) /* value bucket field used */
54 #define HASH_SIZE(n) (((long)(n))<<16) /* fixed bucket size */
58 #define HASH_KEEP (1L<<(8*sizeof(int)-2)) /* no free on bucket */
62 #define HASH_FREENAME (1L<<(8*sizeof(int)-6)) /* free bucket name */
[all …]
/illumos-gate/usr/src/uts/common/inet/ip/
H A Dip_sadb.c93 * I expect an SA hash bucket, and that its per-bucket mutex is held.
97 ipsec_getassocbyconn(isaf_t *bucket, ip_xmit_attr_t *ixa, uint32_t *src, in ipsec_getassocbyconn() argument
117 ASSERT(MUTEX_HELD(&bucket->isaf_lock)); in ipsec_getassocbyconn()
127 * Fast path: do we have a latch structure, is it for this bucket, in ipsec_getassocbyconn()
142 if ((bucket == ipr->ipsr_bucket) && in ipsec_getassocbyconn()
143 (bucket->isaf_gen == ipr->ipsr_gen) && in ipsec_getassocbyconn()
171 * Walk the hash bucket, matching on: in ipsec_getassocbyconn()
182 * bucket. in ipsec_getassocbyconn()
192 for (retval = bucket->isaf_ipsa; retval != NULL; in ipsec_getassocbyconn()
425 ipr->ipsr_bucket = bucket; in ipsec_getassocbyconn()
[all …]
/illumos-gate/usr/src/uts/common/dtrace/
H A Dfasttrap.c110 * from being freed. A provider is looked up by taking the bucket lock for the
124 * bucket lock before provider lock
277 fasttrap_bucket_t *bucket; in fasttrap_pid_cleanup_cb() local
299 bucket = &fasttrap_provs.fth_table[i]; in fasttrap_pid_cleanup_cb()
300 mutex_enter(&bucket->ftb_mtx); in fasttrap_pid_cleanup_cb()
301 fpp = (fasttrap_provider_t **)&bucket->ftb_data; in fasttrap_pid_cleanup_cb()
355 mutex_exit(&bucket->ftb_mtx); in fasttrap_pid_cleanup_cb()
442 fasttrap_bucket_t *bucket = &fasttrap_tpoints.fth_table[i]; in fasttrap_fork() local
444 mutex_enter(&bucket->ftb_mtx); in fasttrap_fork()
445 for (tp = bucket->ftb_data; tp != NULL; tp = tp->ftt_next) { in fasttrap_fork()
[all …]
/illumos-gate/usr/src/cmd/sgs/link_audit/common/
H A Dhash.c65 long bucket; in get_hash() local
69 tmp = tbl->table[bucket = hash_string(key, tbl->size)]; in get_hash()
71 tmp = tbl->table[bucket = labs((long)key) % tbl->size]; in get_hash()
92 * insert new entry into bucket... in get_hash()
105 * hook into bucket chain in get_hash()
107 new->next_entry = tbl->table[bucket]; in get_hash()
108 tbl->table[bucket] = new; in get_hash()
139 ulong_t bucket; in del_hash() local
143 bucket = hash_string(key, tbl->size); in del_hash()
145 bucket = labs((long)key) % tbl->size; in del_hash()
[all …]
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Ddist.c35 * number of buckets, adding one bucket at the end that is one past the end of
109 * now need to generate the array of bucket bounds. There are in dist_geometric()
117 * bucket size. Since b_idx is an exponentially growing function, in dist_geometric()
124 * of oddness around the 0 bucket, but it's mostly reasonable. in dist_geometric()
152 * Print the distribution header with the given bucket label. The header is
156 * for the bucket counts.
180 * Print one distribution bucket whose range is from distarray[i] inclusive to
183 * Each bucket is labeled by its range in the form "first-last" (omit "-last" if
185 * one less than the first value of the next bucket range. The bucket label is
194 int b; /* bucket range index */ in dist_print_bucket()
[all …]
/illumos-gate/usr/src/lib/libnisdb/
H A Ddb_index.cc85 while (curr != NULL) { // go through bucket in reset()
191 unsigned long bucket; in lookup() local
200 bucket = hval % table_size; in lookup()
202 db_index_entry_p fst = tab[bucket ]; in lookup()
229 unsigned long bucket; in remove() local
242 bucket = hval % table_size; in remove()
244 fst = tab[bucket]; in remove()
247 else if (fst->remove(&tab[bucket], case_insens, hval, index_value, in remove()
279 unsigned long bucket; in add() local
280 bucket = hval %table_size; in add()
[all …]
H A Ddb_dictionary.cc206 db_table_desc* bucket; in delete_dictionary() local
210 /* delete each bucket */ in delete_dictionary()
212 bucket = dict->tables.tables_val[i]; in delete_dictionary()
213 if (bucket) in delete_dictionary()
214 delete_bucket(bucket); in delete_dictionary()
224 /* Relocate bucket starting with this entry to new hashtable 'new_tab'. */
226 relocate_bucket(db_table_desc* bucket, in relocate_bucket() argument
231 for (np = bucket; np != NULL; np = next_np) { in relocate_bucket()
244 enumerate_bucket(db_table_desc* bucket, db_status(*func)(db_table_desc *)) in enumerate_bucket() argument
249 for (np = bucket; np != NULL; np = np->next) { in enumerate_bucket()
[all …]
/illumos-gate/usr/src/uts/common/refhash/
H A Drefhash.c77 uint_t bucket; in refhash_insert() local
80 bucket = hp->rh_hash(obj_to_tag(hp, op)) % hp->rh_bucket_count; in refhash_insert()
85 list_insert_tail(&hp->rh_buckets[bucket], lp); in refhash_insert()
93 uint_t bucket; in refhash_delete() local
95 bucket = hp->rh_hash(obj_to_tag(hp, op)) % hp->rh_bucket_count; in refhash_delete()
96 list_remove(&hp->rh_buckets[bucket], lp); in refhash_delete()
116 uint_t bucket; in refhash_lookup() local
120 bucket = hp->rh_hash(tp) % hp->rh_bucket_count; in refhash_lookup()
121 for (lp = list_head(&hp->rh_buckets[bucket]); lp != NULL; in refhash_lookup()
122 lp = list_next(&hp->rh_buckets[bucket], lp)) { in refhash_lookup()
/illumos-gate/usr/src/uts/common/fs/zfs/
H A Daggsum.c33 * aggsum_bucket structure contains a per-bucket lock to protect the contents of
34 * the bucket, the current amount that this bucket has changed from the global
39 * counter will modify one bucket's counter (determined by their current CPU, to
40 * help minimize lock and cache contention). If the bucket already has
42 * they simply modify the delta and return. If the bucket does not, we clear
43 * the bucket's current state (to prevent the borrowed amounts from getting too
46 * and setting the borrow value for the bucket to the amount added (or
47 * subtracted). Clearing the bucket is the opposite; we add the current delta
61 * then clearing a bucket. This proceeds until the target is outside of the
62 * upper and lower bounds and we return a response, or the last bucket has been
[all …]
/illumos-gate/usr/src/cmd/sgs/crle/common/
H A Dhash.c58 int bucket; in get_hash() local
67 bucket = hashval % tbl->t_size; in get_hash()
70 for (ent = tbl->t_entry[bucket]; ent != NULL; in get_hash()
87 * Key not found in this hash table ... insert new entry into bucket. in get_hash()
96 * Hook into bucket chain in get_hash()
98 ent->e_next = tbl->t_entry[bucket]; in get_hash()
99 tbl->t_entry[bucket] = ent; in get_hash()
/illumos-gate/usr/src/cmd/abi/spectrans/spec2map/
H A Dbucket.c34 #include "bucket.h"
61 * create_lists -- initialize the bucket list and hash map.
88 * the bucket version (eg, SUNW_1.1) hasn't
202 * add_by_name -- look up bucket and add an interface to it.
244 * Add to bucket. in add_by_name()
294 errlog(VERBOSE, "set has_protecteds on bucket 0x%p", b); in add_by_name()
320 errlog(VERBOSE, "l-bucket: %s", l->b_name); in sort_buckets()
339 * add_local -- set the local flag on the logically first bucket.
341 * mapfiles, not inherent ordering or bucket contents...
358 "set has_locals on bucket 0x%p", b); in add_local()
[all …]
/illumos-gate/usr/src/uts/common/vm/
H A Dvm_seg.c93 struct seg_phash *p_hashp; /* our pcache hash bucket */
103 kmutex_t p_hmutex; /* protects hash bucket */
104 pcache_link_t p_halink[2]; /* active bucket linkages */
110 kmutex_t p_hmutex; /* protects hash bucket */
252 * active hash bucket lists. We maintain active bucket lists to reduce the
257 * There're 2 active bucket lists. Current active list (as per seg_pahcur) is
265 * seg_padd_abuck() only adds the bucket to current list if the bucket is not
266 * yet on any list. seg_premove_abuck() may remove the bucket from either
267 * list. If the bucket is on current list it will be always removed. Otherwise
268 * the bucket is only removed if asynchronous purge thread is not currently
[all …]
/illumos-gate/usr/src/cmd/sendmail/db/mp/
H A Dmp_fget.c41 size_t bucket, mf_offset; local
59 * The only alternative is for hash to write the last "bucket" all the
97 /* Determine the hash bucket where this page will live. */
98 bucket = BUCKET(mp, mf_offset, *pgnoaddr);
116 bucket = BUCKET(mp, mf_offset, mfp->last_pgno);
166 for (bhp = SH_TAILQ_FIRST(&dbmp->htab[bucket], __bh);
263 * Prepend the bucket header to the head of the appropriate MPOOL
264 * bucket hash list. Append the bucket header to the tail of the
267 SH_TAILQ_INSERT_HEAD(&dbmp->htab[bucket], bhp, hq, __bh);
/illumos-gate/usr/src/uts/common/inet/tcp/
H A Dtcp_time_wait.c93 unsigned int bucket; in tcp_time_wait_remove() local
95 bucket = TW_BUCKET(tcp->tcp_time_wait_expire); in tcp_time_wait_remove()
96 ASSERT(tsp->tcp_time_wait_bucket[bucket] == tcp); in tcp_time_wait_remove()
97 tsp->tcp_time_wait_bucket[bucket] = tcp->tcp_time_wait_next; in tcp_time_wait_remove()
137 unsigned int bucket; in tcp_time_wait_append() local
177 * tcp_time_wait_lock, doing so complicates bucket addressing later. in tcp_time_wait_append()
204 * Append the connection into the appropriate bucket. in tcp_time_wait_append()
206 bucket = TW_BUCKET(tcp->tcp_time_wait_expire); in tcp_time_wait_append()
207 tcp->tcp_time_wait_next = tsp->tcp_time_wait_bucket[bucket]; in tcp_time_wait_append()
208 tsp->tcp_time_wait_bucket[bucket] = tcp; in tcp_time_wait_append()
[all …]
/illumos-gate/usr/src/uts/common/inet/ilb/
H A Dilb_conn.h37 * Struct of the conn hash table bucket
39 * ilb_connp: the first conn hash entry in the bucket
40 * ilb_conn_hash_lock: mutex to protect the list in the bucket
41 * ilb_conn_cnt: number of conn hash entries in this bucket
85 * conn_hash: back pointer to the conn hash table bucket
178 * Struct of the sticky hash table bucket
180 * sticky_head: the sticky hash list of this bucket
182 * sticki_cnt: number of sticky hash entries in this bucket

12345678910>>...15