Searched defs:bucket (Results 1 - 25 of 77) sorted by relevance

1234

/illumos-gate/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);
/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], bh
[all...]
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);
/illumos-gate/usr/src/cmd/sgs/crle/common/
H A Dhash.c56 int bucket; local
65 bucket = hashval % tbl->t_size;
68 for (ent = tbl->t_entry[bucket]; ent != NULL;
85 * Key not found in this hash table ... insert new entry into bucket.
94 * Hook into bucket chain
96 ent->e_next = tbl->t_entry[bucket];
97 tbl->t_entry[bucket] = ent;
/illumos-gate/usr/src/cmd/abi/spectrans/spec2map/
H A Dbucket.h37 struct bucket *bl_bucket;
41 typedef struct bucket { struct
43 struct bucket *b_parent;
45 struct bucket *b_thread;
/illumos-gate/usr/src/cmd/vi/misc/
H A Dmkstr.c234 } *bucket[NBUCKETS]; variable in typeref:struct:hash
255 for (hp = bucket[i]; hp != 0; hp = hp->hnext)
267 hp->hnext = bucket[i];
274 bucket[i] = hp;
H A Dxstr.c308 } bucket[BUCKETS]; variable in typeref:struct:hash
318 hp = hp0 = &bucket[lastchr(str) & 0177];
343 for (hp = bucket[i].hnext; hp != NULL; hp = hp->hnext)
352 for (hp = bucket[i].hnext; hp != NULL; hp = hp->hnext) {
/illumos-gate/usr/src/cmd/sgs/link_audit/common/
H A Dhash.c65 long bucket; local
69 tmp = tbl->table[bucket = hash_string(key, tbl->size)];
71 tmp = tbl->table[bucket = labs((long)key) % tbl->size];
92 * insert new entry into bucket...
105 * hook into bucket chain
107 new->next_entry = tbl->table[bucket];
108 tbl->table[bucket] = new;
139 ulong_t bucket; local
143 bucket = hash_string(key, tbl->size);
145 bucket
[all...]
/illumos-gate/usr/src/tools/protocmp/
H A Ddepend.c49 int bucket; local
52 bucket = HASH(pkgname);
53 for (tmp = packages[bucket]; tmp != NULL; tmp = tmp->next) {
63 int bucket; local
66 bucket = HASH(pkgname);
70 tmp->next = packages[bucket];
71 packages[bucket] = tmp;
H A Dlist.c65 (void) printf("bucket[%4d] contains %5d entries\n",
249 int bucket; local
252 bucket = hash(e->name) % list->num_of_buckets;
253 if (list->list[bucket]) {
254 for (cur = list->list[bucket]; cur; cur = cur->next) {
273 e->next = list->list[bucket];
274 list->list[bucket] = e;
/illumos-gate/usr/src/uts/common/avs/ns/sdbc/
H A Dsd_hash.c104 _sd_hash_bucket_t *bucket; local
131 bucket = (hash_table->ht_buckets + i);
133 bucket->hb_lock = &_sd_hb_locks[i % _SD_HB_LOCKS];
134 bucket->hb_head = bucket->hb_tail = NULL;
135 bucket->hb_inlist = 0;
196 _sd_hash_bucket_t *bucket; local
205 bucket = (table->ht_buckets + i);
207 seq = bucket->hb_seq;
208 for (hptr = bucket
297 _sd_hash_bucket_t *bucket; local
379 _sd_hash_bucket_t *bucket; local
445 _sd_hash_bucket_t *bucket; local
[all...]
/illumos-gate/usr/src/lib/nsswitch/files/common/
H A Dfiles_common.c586 uint_t bucket = hp->h_hash % fhp->fh_size; variable
587 hp->h_next = htab[bucket].h_first;
588 htab[bucket].h_first = hp;
/illumos-gate/usr/src/lib/libtnf/
H A Dinfo.c117 struct taginfo *bucket, *info; local
119 bucket = tnf->tag_table[TAGHASH(tnf, tag)];
120 for (info = bucket; info; info = info->link)
171 struct taginfo *info, *bucket; local
188 bucket = tnf->tag_table[hash];
189 info->link = bucket;
/illumos-gate/usr/src/lib/libbsdmalloc/common/
H A Dmalloc.bsd43.c59 uchar_t ovu_index; /* bucket # */
63 uchar_t ovu_index; /* bucket # */
92 static int pagebucket; /* page size bucket */
100 int bucket; local
129 bucket = 0;
133 bucket++;
135 pagebucket = bucket;
143 amt = (1UL << EXP); /* size of first bucket */
144 bucket = 0;
148 bucket
176 morecore(int bucket) argument
[all...]
/illumos-gate/usr/src/cmd/truss/
H A Dhtbl.c121 unsigned int bucket; local
126 bucket = hash_str(key, htp->size);
127 cur = &htp->tbl[bucket];
195 new->bucket = b;
233 i = itr->bucket;
245 itr->bucket = i;
H A Dhtbl.h47 hentry_t *first; /* first entry in bucket */
48 mutex_t block; /* bucket lock */
57 int bucket; /* bucket in current iteration */ member in struct:hiter
/illumos-gate/usr/src/uts/common/io/scsi/adapters/mpt_sas/
H A Dmptsas_hash.c83 uint_t bucket; local
86 bucket = hp->rh_hash(obj_to_tag(hp, op)) % hp->rh_bucket_count;
91 list_insert_tail(&hp->rh_buckets[bucket], lp);
99 uint_t bucket; local
101 bucket = hp->rh_hash(obj_to_tag(hp, op)) % hp->rh_bucket_count;
102 list_remove(&hp->rh_buckets[bucket], lp);
122 uint_t bucket; local
126 bucket = hp->rh_hash(tp) % hp->rh_bucket_count;
127 for (lp = list_head(&hp->rh_buckets[bucket]); lp != NULL;
128 lp = list_next(&hp->rh_buckets[bucket], l
[all...]
/illumos-gate/usr/src/uts/common/io/
H A Dstr_conf.c131 uint_t bucket; local
137 bucket = FMODSW_HASH(fp->f_name);
138 for (pp = &(fmodsw_hash[bucket]); (p = *pp) != NULL;
153 uint_t bucket; local
159 bucket = FMODSW_HASH(name);
160 for (pp = &(fmodsw_hash[bucket]); (p = *pp) != NULL;
178 uint_t bucket; local
184 bucket = FMODSW_HASH(name);
185 for (p = fmodsw_hash[bucket]; p != NULL; p = p->f_next)
/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
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...]
/illumos-gate/usr/src/lib/libtecla/common/
H A Dhash.c66 HashNode *next; /* The next hash-table entry in a bucket list */
70 * Each hash-table bucket contains a linked list of entries that
71 * hash to the same bucket.
74 HashNode *head; /* The head of the bucket hash-node list */
87 HashBucket *bucket; /* An array of 'size' hash buckets */ member in struct:HashTable
96 static HashNode *_find_HashNode(HashTable *hash, HashBucket *bucket,
253 hash->bucket = NULL;
260 hash->bucket = (HashBucket *) malloc(sizeof(HashBucket) * size);
261 if(!hash->bucket) {
266 * Initialize the bucket arra
343 HashBucket *bucket; /* The hash-bucket associated with the name */ local
398 HashBucket *bucket = _find_HashBucket(hash, name); local
438 HashBucket *bucket; /* The hash-table bucket associated with name[] */ local
600 _find_HashNode(HashTable *hash, HashBucket *bucket, const char *name, HashNode **prev) argument
687 HashBucket *bucket = hash->bucket + i; local
733 HashBucket *bucket = hash->bucket + i; local
[all...]
/illumos-gate/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...]
/illumos-gate/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...]
/illumos-gate/usr/src/cmd/xstr/
H A Dxstr.c309 } bucket[BUCKETS]; variable in typeref:struct:hash
317 hp = hp0 = &bucket[lastchr(str) & 0177];
347 for (hp = bucket[i].hnext; hp != NULL; hp = hp->hnext)
358 for (hp = bucket[i].hnext; hp != NULL; hp = hp->hnext) {
/illumos-gate/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...]
/illumos-gate/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.

Completed in 141 milliseconds

1234