| /onnv/onnv-gate/usr/src/lib/libast/common/hash/ |
| hashlast.c | 24 /* OBSOLETE 19960229 -- use tab->root->last.{table|bucket} */
36 * return last lookup bucket for table
42 return(tab->root->last.bucket);
|
| hashscan.c | 55 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);
|
| /onnv/onnv-gate/usr/src/uts/common/avs/ns/sdbc/ |
| sd_hash.c | 104 _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->hb_head; hptr; hptr = hnext)
297 _sd_hash_bucket_t *bucket; local
379 _sd_hash_bucket_t *bucket; local
445 _sd_hash_bucket_t *bucket; local
[all...] |
| /onnv/onnv-gate/usr/src/cmd/abi/spectrans/spec2map/ |
| bucket.h | 37 struct bucket *bl_bucket;
41 typedef struct bucket { struct
43 struct bucket *b_parent;
45 struct bucket *b_thread;
55 /* Bucket interfaces, general. */
|
| Makefile.targ | 36 bucket.o \
|
| /onnv/onnv-gate/usr/src/lib/libpool/common/ |
| dict.c | 63 * 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 ? bucket->db_value : NULL)
314 dict_bucket_t *bucket; local
352 dict_bucket_t *bucket = *pbucket; local
375 dict_bucket_t *bucket = NULL; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libgen/common/ |
| isencrypt.c | 78 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);
|
| /onnv/onnv-gate/usr/src/cmd/sgs/crle/common/ |
| hash.c | 56 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;
|
| /onnv/onnv-gate/usr/src/lib/libtecla/common/ |
| hash.c | 66 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 array
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
687 HashBucket *bucket = hash->bucket + i; local
733 HashBucket *bucket = hash->bucket + i; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/ |
| Distribution.java | 37 * 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 linea
114 Bucket bucket; local
164 Bucket bucket; local
[all...] |
| LinearDistribution.java | 38 * 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 rang
192 Distribution.Bucket bucket; local
[all...] |
| LogDistribution.java | 38 * 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)
132 List <Distribution.Bucket> buckets = getBuckets()
[all...] |
| /onnv/onnv-gate/usr/src/lib/libbsdmalloc/common/ |
| malloc.bsd43.c | 59 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 = pagebucket
[all...] |
| /onnv/onnv-gate/usr/src/lib/libnisdb/ |
| db_index.cc | 87 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 = hval %table_size
[all...] |
| /onnv/onnv-gate/usr/src/tools/protocmp/ |
| depend.c | 49 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;
|
| /onnv/onnv-gate/usr/src/cmd/sgs/link_audit/common/ |
| hash.c | 73 long bucket; local
78 tmp = tbl->table[bucket = hash_string(key, tbl->size)];
80 tmp = tbl->table[bucket = labs((long)key) % tbl->size];
101 * insert new entry into bucket...
113 * hook into bucket chain
115 new->next_entry = tbl->table[bucket];
116 tbl->table[bucket] = new;
148 ulong_t bucket; local
152 bucket = hash_string(key, tbl->size);
154 bucket = labs((long)key) % tbl->size
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/dtrace/ |
| fasttrap.c | 107 * from being freed. A provider is looked up by taking the bucket lock for the
121 * bucket lock before provider lock
274 fasttrap_bucket_t *bucket; local
296 bucket = &fasttrap_provs.fth_table[i];
297 mutex_enter(&bucket->ftb_mtx);
298 fpp = (fasttrap_provider_t **)&bucket->ftb_data;
348 mutex_exit(&bucket->ftb_mtx);
431 fasttrap_bucket_t *bucket = &fasttrap_tpoints.fth_table[i]; local
433 mutex_enter(&bucket->ftb_mtx);
434 for (tp = bucket->ftb_data; tp != NULL; tp = tp->ftt_next)
493 fasttrap_bucket_t *bucket; local
665 fasttrap_bucket_t *bucket; local
1163 fasttrap_bucket_t *bucket; local
1225 fasttrap_bucket_t *bucket; local
1281 fasttrap_bucket_t *bucket; local
1449 fasttrap_bucket_t *bucket; local
2245 fasttrap_bucket_t *bucket = &fasttrap_provs.fth_table[i]; local
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/io/ |
| str_conf.c | 133 uint_t bucket; local
139 bucket = FMODSW_HASH(fp->f_name);
140 for (pp = &(fmodsw_hash[bucket]); (p = *pp) != NULL;
155 uint_t bucket; local
161 bucket = FMODSW_HASH(name);
162 for (pp = &(fmodsw_hash[bucket]); (p = *pp) != NULL;
180 uint_t bucket; local
186 bucket = FMODSW_HASH(name);
187 for (p = fmodsw_hash[bucket]; p != NULL; p = p->f_next)
|
| /onnv/onnv-gate/usr/src/uts/common/inet/ip/ |
| ip_sadb.c | 93 * 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,
117 ASSERT(MUTEX_HELD(&bucket->isaf_lock));
127 * Fast path: do we have a latch structure, is it for this bucket,
142 if ((bucket == ipr->ipsr_bucket) &&
143 (bucket->isaf_gen == ipr->ipsr_gen) &&
171 * Walk the hash bucket, matching on:
182 * bucket.
192 for (retval = bucket->isaf_ipsa; retval != NULL
572 isaf_t *bucket; local
790 isaf_t *bucket; local
[all...] |
| /onnv/onnv-gate/usr/src/tools/ctf/cvt/ |
| hash.c | 108 int bucket = hash->h_hashfn(hash->h_nbuckets, key); local
110 list_add(&hash->h_buckets[bucket], key);
135 int bucket = hash->h_hashfn(hash->h_nbuckets, key); local
137 (void) list_remove(&hash->h_buckets[bucket], key,
145 int bucket = hash->h_hashfn(hash->h_nbuckets, key); local
147 return (list_iter(hash->h_buckets[bucket], fun, private) < 0);
169 int bucket = hash->h_hashfn(hash->h_nbuckets, key); local
177 return (list_iter(hash->h_buckets[bucket], (int (*)())hash_find_list_cb,
|
| /onnv/onnv-gate/usr/src/cmd/sendmail/db/mp/ |
| mp_pr.c | 176 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);
|
| /onnv/onnv-gate/usr/src/uts/common/os/ |
| taskq.c | 346 * is attached to a bucket for its lifetime and can't migrate to other buckets.
351 * "func" field and places an entry on the bucket cache of free entries pointed
360 * entry on the bucket free list and goes to a timed sleep. If it wakes up
365 * There are various statistics kept in the bucket which allows for later
372 * between the bucket and actual thread CPU, so buckets are used only to
374 * to the CPU denoted by a bucket may reduce number of times the job
377 * Current algorithm creates a thread whenever a bucket has no free
395 * For dynamic task queues, each bucket is marked as TQBUCKET_SUSPEND by
414 * 2) Each per-CPU bucket has a lock for bucket management
1082 taskq_bucket_t *bucket = NULL; \/* Which bucket needs extension *\/ local
1556 taskq_bucket_t *bucket = tqe->tqent_bucket; local
1850 taskq_bucket_t *bucket = kmem_zalloc(sizeof (taskq_bucket_t) * local
[all...] |
| /onnv/onnv-gate/usr/src/cmd/dtrace/test/tst/common/java_api/src/ |
| TestBean.java | 206 List < Distribution.Bucket > buckets =
207 new ArrayList < Distribution.Bucket > ();
208 Distribution.Bucket bucket; local
220 bucket = new Distribution.Bucket(-1, -1, n++);
221 buckets.add(bucket);
222 bucket = new Distribution.Bucket(0, 0, n++);
223 buckets.add(bucket);
250 Distribution.Bucket bucket; local
[all...] |
| /onnv/onnv-gate/usr/src/cmd/truss/ |
| htbl.h | 47 hentry_t *first; /* first entry in bucket */
48 mutex_t block; /* bucket lock */
57 int bucket; /* bucket in current iteration */ member in struct:hiter
|
| /onnv/onnv-gate/usr/src/cmd/vi/misc/ |
| mkstr.c | 234 } *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;
|
