Searched refs:bucket (Results 1 - 25 of 36) sorted by relevance

12

/osnet-11/usr/src/lib/libast/common/hash/
H A Dhashlast.c24 /* OBSOLETE 19960229 -- use tab->root->last.{table|bucket} */
36 * return last lookup bucket for table
42 return(tab->root->last.bucket);
H A Dhashscan.c55 pos->bucket = ∅
91 if (!pos) return(pos->tab->root->last.bucket = 0);
92 b = pos->bucket;
123 return(pos->tab->root->last.bucket = pos->bucket = b);
H A Dhashlook.c83 last->bucket = (Hash_bucket_t*)name;
84 name = hashname(last->bucket);
86 else last->bucket = 0;
88 if (flags & HASH_BUCKET) n = last->bucket->hash;
139 if (b = last->bucket)
142 * found the bucket
245 last->bucket = b;
258 * create a new bucket
281 b = last->bucket;
344 * finally got the bucket
[all...]
/osnet-11/usr/src/lib/libpool/common/
H A Ddict.c63 * bucket is acceptable, but if there is too much overflow, then
73 * A key bucket.
79 struct dict_bucket *db_next; /* next bucket */
296 dict_bucket_t *bucket; local
299 for (bucket = hdl->dh_buckets[i]; bucket != NULL;
300 bucket = bucket->db_next)
301 if ((*hdl->dh_cmp)(key, bucket->db_key) == 0)
303 return (bucket
314 dict_bucket_t *bucket; local
352 dict_bucket_t *bucket = *pbucket; local
375 dict_bucket_t *bucket = NULL; local
[all...]
/osnet-11/usr/src/lib/libgen/common/
H A Disencrypt.c78 int bucket[8]; local
81 for (i = 0; i < 8; i++) bucket[i] = 0;
83 for (i = 0; i < 64; i++) bucket[(fbuf[i]>>5)&07] += 1;
86 for (i = 0; i < 8; i++) cs += (bucket[i]-8)*(bucket[i]-8);
/osnet-11/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
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
88 * subclass for determining bucket range
192 checkBucketRange(int i, int bucketCount, Distribution.Bucket bucket, long base, long constant) argument
200 checkBucketRange(int i, int bucketCount, Distribution.Bucket bucket) argument
207 checkBucketRange(int i, Distribution.Bucket bucket, long[] range) argument
[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 doe
[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
133 for (Distribution.Bucket bucket : buckets) {
134 total += ((double)bucket
[all...]
/osnet-11/usr/src/lib/libbsdmalloc/common/
H A Dmalloc.bsd43.c57 uchar_t ovu_index; /* bucket # */
61 uchar_t ovu_index; /* bucket # */
90 static int pagebucket; /* page size bucket */
98 int bucket; local
127 bucket = 0;
131 bucket++;
133 pagebucket = bucket;
141 amt = (1UL << EXP); /* size of first bucket */
142 bucket = 0;
146 bucket
174 morecore(int bucket) argument
[all...]
/osnet-11/usr/src/lib/libnisdb/
H A Ddb_index.cc87 while (curr != NULL) { // go through bucket
193 unsigned long bucket; local
202 bucket = hval % table_size;
204 db_index_entry_p fst = tab[bucket ];
231 unsigned long bucket; local
244 bucket = hval % table_size;
246 fst = tab[bucket];
249 else if (fst->remove(&tab[bucket], case_insens, hval, index_value,
281 unsigned long bucket; local
282 bucket
[all...]
H A Ddb_dictionary.cc201 db_table_desc* bucket; local
205 /* delete each bucket */
207 bucket = dict->tables.tables_val[i];
208 if (bucket)
209 delete_bucket(bucket);
218 /* Relocate bucket starting with this entry to new hashtable 'new_tab'. */
220 relocate_bucket(db_table_desc* bucket, argument
225 for (np = bucket; np != NULL; np = next_np) {
238 enumerate_bucket(db_table_desc* bucket, db_status(*func)(db_table_desc *)) argument
243 for (np = bucket; n
257 search_bucket(db_table_desc* bucket, unsigned long hval, char *target) argument
279 remove_from_bucket(db_table_desc_p bucket, db_table_desc_p *head, unsigned long hval, char *target, bool_t free_storage) argument
316 add_to_bucket(db_table_desc_p bucket, db_table_desc **head, db_table_desc_p td) argument
461 db_table_desc *bucket; local
488 unsigned long bucket; local
514 unsigned long bucket; local
570 unsigned long bucket; local
634 db_clone_bucket(db_table_desc *bucket, db_table_desc **clone) argument
842 db_table_desc *bucket, *np, *clone, *next_np; local
[all...]
/osnet-11/usr/src/cmd/sendmail/db/mp/
H A Dmp_pr.c176 size_t bucket, fmap[FMAP_ENTRIES + 1]; local
239 bucket = 0; bucket < mp->htab_buckets; ++htabp, ++bucket) {
240 if (SH_TAILQ_FIRST(&dbmp->htab[bucket], __bh) != NULL)
241 (void)fprintf(fp, "%lu:\n", (u_long)bucket);
242 for (bhp = SH_TAILQ_FIRST(&dbmp->htab[bucket], __bh);
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], bh
[all...]
/osnet-11/usr/src/lib/libc/port/threads/
H A Dalloc.c85 * into one 4K buffer for bucket 6 and one 8K buffer for bucket 7.
96 initial_allocation(bucket_t *bp) /* &__uberdata.bucket[0] */
214 initial_allocation(udp->bucket);
218 bp = &udp->bucket[bucketnum];
304 bp = &__uberdata.bucket[bucketnum];
306 bp = &self->ul_uberdata->bucket[bucketnum];
/osnet-11/usr/src/cmd/sendmail/db/hash/
H A Dhash.c546 if (hcp->bucket != BUCKET_INVALID) {
558 if (hcp->bucket == BUCKET_INVALID)
566 if (hcp->bucket == BUCKET_INVALID)
567 hcp->bucket = 0;
614 * Ran out of entries in a bucket; change buckets.
620 if (hcp->bucket == 0) {
624 hcp->bucket--;
633 hcp->bucket++;
636 if (hcp->bucket > hcp->hdr->max_bucket) {
813 * we'll do between then and now is increment max bucket an
882 u_int32_t n, bucket; local
[all...]
/osnet-11/usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/
H A Dhash.c184 * maximum bucket number, so the number of buckets is
336 /* Fix bucket size to be optimal for file system */
712 u_int32_t bucket; local
734 bucket = __call_hash(hashp, (int8_t *)key->data, key->size);
739 cursor.bucket = bucket;
842 new_curs->bucket = 0;
885 * bucket pointers. This works, since the only other place we
887 * bucket at a time. However, there is the problem that certain other
916 cursorp->bucket
1018 int32_t n, bucket; local
[all...]
H A Dhash.h53 db_pgno_t bucket; member in struct:cursor_t
74 int32_t max_bucket; /* ID of Maximum bucket in use */
173 db_pgno_t bucket; member in struct:item_info
H A Dhash_page.c104 __get_page(hashp, cursorp->bucket, A_BUCKET);
161 item_info->bucket = cursorp->bucket;
179 cursorp->bucket = -1;
210 cursorp->bucket = 0;
418 pagep = __get_page(hashp, item_info->bucket, A_BUCKET);
478 old_ii.bucket = obucket;
479 new_ii.bucket = nbucket;
641 * to an already-allocated big page in the appropriate bucket.
656 pagep = __get_page(hashp, item_info->bucket, A_BUCKE
[all...]
/osnet-11/usr/src/cmd/sendmail/db/include/
H A Dhash.h60 db_pgno_t bucket; /* Bucket we are traversing. */ member in struct:cursor_t
62 DB_LOCK lock; /* Lock held on the current bucket. */
79 #define H_NOMORE 0x0010 /* No more entries in bucket. */
86 #define IS_VALID(C) ((C)->bucket != BUCKET_INVALID)
160 * we've allocated at each point to calculate bucket to page number mapping.
H A Dhash_auto.h53 u_int32_t bucket; member in struct:_ham_splitmeta_args
/osnet-11/usr/src/lib/libast/amd64/include/ast/
H A Dhash.h52 #define HASH_CREATE (1L<<8) /* create bucket if not found */
53 #define HASH_DELETE (1L<<9) /* delete bucket if found */
55 #define HASH_RENAME (1L<<7) /* rename bucket if found */
57 #define HASH_BUCKET (1L<<11) /* name is installed bucket */
58 #define HASH_INSTALL (1L<<12) /* install allocated bucket */
60 #define HASH_OPAQUE (1L<<14) /* opaque bucket */
61 #define HASH_VALUE (1L<<15) /* value bucket field used */
63 #define HASH_SIZE(n) (((long)(n))<<16) /* fixed bucket size */
67 #define HASH_KEEP (1L<<(8*sizeof(int)-2)) /* no free on bucket */
71 #define HASH_FREENAME (1L<<(8*sizeof(int)-6)) /* free bucket nam
153 Hash_bucket_t* bucket; /* bucket */ member in struct:__anon1111
162 Hash_bucket_t* bucket; /* last lookup bucket */ member in struct:__anon1112
[all...]
/osnet-11/usr/src/lib/libast/common/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 nam
144 Hash_bucket_t* bucket; /* bucket */ member in struct:__anon1145
153 Hash_bucket_t* bucket; /* last lookup bucket */ member in struct:__anon1146
[all...]
/osnet-11/usr/src/lib/libast/i386/include/ast/
H A Dhash.h52 #define HASH_CREATE (1L<<8) /* create bucket if not found */
53 #define HASH_DELETE (1L<<9) /* delete bucket if found */
55 #define HASH_RENAME (1L<<7) /* rename bucket if found */
57 #define HASH_BUCKET (1L<<11) /* name is installed bucket */
58 #define HASH_INSTALL (1L<<12) /* install allocated bucket */
60 #define HASH_OPAQUE (1L<<14) /* opaque bucket */
61 #define HASH_VALUE (1L<<15) /* value bucket field used */
63 #define HASH_SIZE(n) (((long)(n))<<16) /* fixed bucket size */
67 #define HASH_KEEP (1L<<(8*sizeof(int)-2)) /* no free on bucket */
71 #define HASH_FREENAME (1L<<(8*sizeof(int)-6)) /* free bucket nam
153 Hash_bucket_t* bucket; /* bucket */ member in struct:__anon1205
162 Hash_bucket_t* bucket; /* last lookup bucket */ member in struct:__anon1206
[all...]
/osnet-11/usr/src/lib/libast/sparc/include/ast/
H A Dhash.h52 #define HASH_CREATE (1L<<8) /* create bucket if not found */
53 #define HASH_DELETE (1L<<9) /* delete bucket if found */
55 #define HASH_RENAME (1L<<7) /* rename bucket if found */
57 #define HASH_BUCKET (1L<<11) /* name is installed bucket */
58 #define HASH_INSTALL (1L<<12) /* install allocated bucket */
60 #define HASH_OPAQUE (1L<<14) /* opaque bucket */
61 #define HASH_VALUE (1L<<15) /* value bucket field used */
63 #define HASH_SIZE(n) (((long)(n))<<16) /* fixed bucket size */
67 #define HASH_KEEP (1L<<(8*sizeof(int)-2)) /* no free on bucket */
71 #define HASH_FREENAME (1L<<(8*sizeof(int)-6)) /* free bucket nam
153 Hash_bucket_t* bucket; /* bucket */ member in struct:__anon1227
162 Hash_bucket_t* bucket; /* last lookup bucket */ member in struct:__anon1228
[all...]
/osnet-11/usr/src/lib/libast/sparcv9/include/ast/
H A Dhash.h52 #define HASH_CREATE (1L<<8) /* create bucket if not found */
53 #define HASH_DELETE (1L<<9) /* delete bucket if found */
55 #define HASH_RENAME (1L<<7) /* rename bucket if found */
57 #define HASH_BUCKET (1L<<11) /* name is installed bucket */
58 #define HASH_INSTALL (1L<<12) /* install allocated bucket */
60 #define HASH_OPAQUE (1L<<14) /* opaque bucket */
61 #define HASH_VALUE (1L<<15) /* value bucket field used */
63 #define HASH_SIZE(n) (((long)(n))<<16) /* fixed bucket size */
67 #define HASH_KEEP (1L<<(8*sizeof(int)-2)) /* no free on bucket */
71 #define HASH_FREENAME (1L<<(8*sizeof(int)-6)) /* free bucket nam
153 Hash_bucket_t* bucket; /* bucket */ member in struct:__anon1249
162 Hash_bucket_t* bucket; /* last lookup bucket */ member in struct:__anon1250
[all...]

Completed in 95 milliseconds

12