| /src/external/bsd/byacc/dist/ |
| symtab.c | 15 static bucket **symbol_table = NULL;
16 bucket *first_symbol;
17 bucket *last_symbol;
34 bucket *
37 bucket *bp;
41 bp = TMALLOC(bucket, 1);
67 bucket *
70 bucket *bp, **bpp;
94 bucket *bp;
96 symbol_table = TMALLOC(bucket *, TABLE_SIZE)
[all...] |
| /src/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/ |
| gl_linkedhash_list.c | 61 size_t bucket = node->h.hashcode % list->table_size; local
63 node->h.hash_next = list->table[bucket];
64 list->table[bucket] = &node->h;
71 size_t bucket = node->h.hashcode % list->table_size; local
74 for (p = &list->table[bucket]; ; p = &(*p)->hash_next)
82 /* node is not in the right bucket. Did the hash codes
|
| gl_anyhash_list2.h | 116 size_t bucket = node->hashcode % new_size; local
117 node->hash_next = new_table[bucket];
118 new_table[bucket] = node;
|
| /src/external/bsd/libarchive/dist/libarchive/ |
| archive_entry_link_resolver.c | 279 size_t hash, bucket; local
300 bucket = hash & (res->number_buckets - 1);
301 for (le = res->buckets[bucket]; le != NULL; le = le->next) {
314 /* Remove it from this hash bucket. */
319 if (res->buckets[bucket] == le)
320 res->buckets[bucket] = le->next;
334 size_t bucket; local
344 /* Look for next non-empty bucket in the links cache. */
345 for (bucket = 0; bucket < res->number_buckets; bucket++)
374 size_t hash, bucket; local
410 size_t i, bucket; local
[all...] |
| archive_write_disk_set_standard_lookup.c | 52 struct bucket { struct
79 * but has a bad pathology in which it thrashes a single bucket. Even
86 struct bucket *ucache = calloc(cache_size, sizeof(struct bucket));
87 struct bucket *gcache = calloc(cache_size, sizeof(struct bucket));
102 struct bucket *b;
103 struct bucket *gcache = (struct bucket *)private_data;
171 struct bucket *b
[all...] |
| /src/external/bsd/top/dist/ |
| hash.c | 39 * This is a conventional "bucket hash". The key is hashed in to a number
41 * to index in to the array of buckets. Each bucket is a linked list
198 /* adjust bucket count to be prime */
206 /* create each bucket as a linked list */
230 register bucket_t *bucket; local
232 bucket = ht->buckets;
235 cnt += bucket->list.count;
236 bucket++;
246 * Fill in "sizes" with information about bucket lengths in hash
256 register bucket_t *bucket; local
290 bucket_t *bucket; local
353 bucket_t *bucket; local
405 bucket_t *bucket; local
443 bucket_t *bucket; local
624 bucket_t *bucket; local
687 bucket_t *bucket; local
739 bucket_t *bucket; local
777 bucket_t *bucket; local
959 bucket_t *bucket; local
1022 bucket_t *bucket; local
1074 bucket_t *bucket; local
1112 bucket_t *bucket; local
1297 bucket_t *bucket; local
1360 bucket_t *bucket; local
1412 bucket_t *bucket; local
1450 bucket_t *bucket; local
1633 bucket_t *bucket; local
1696 bucket_t *bucket; local
1748 bucket_t *bucket; local
1786 bucket_t *bucket; local
[all...] |
| hash.m4c | 39 * This is a conventional "bucket hash". The key is hashed in to a number
41 * to index in to the array of buckets. Each bucket is a linked list
238 /* adjust bucket count to be prime */
246 /* create each bucket as a linked list */
269 register bucket_t *bucket;
271 bucket = ht->buckets;
274 cnt += bucket->list.count;
275 bucket++;
284 * Fill in "sizes" with information about bucket lengths in hash
294 register bucket_t *bucket;
[all...] |
| /src/lib/libbsdmalloc/ |
| malloc.c | 85 u_char ovu_index; /* bucket # */
117 static int pagebucket; /* page size bucket */
181 int bucket; local
203 bucket = 0;
207 bucket++;
209 pagebucket = bucket;
218 amt = 8; /* size of first bucket */
219 bucket = 0;
221 amt = 16; /* size of first bucket */
222 bucket = 1
[all...] |
| /src/external/bsd/libevent/dist/ |
| ratelim-internal.h | 36 /** A token bucket is an internal structure that tracks how many bytes we are
43 /** When was this bucket last updated? Measured in abstract 'ticks'
44 * relative to the token bucket configuration. */
48 /** Configuration info for a token bucket or set of token buckets. */
67 /** The current tick is 'current_tick': add bytes to 'bucket' as specified in
69 int ev_token_bucket_update_(struct ev_token_bucket *bucket,
78 /** Adjust 'bucket' to respect 'cfg', and note that it was last updated in
80 * configuration of 'bucket'; otherwise, we are setting it up for the first
83 int ev_token_bucket_init_(struct ev_token_bucket *bucket,
|
| /src/external/bsd/ntp/dist/sntp/libevent/ |
| ratelim-internal.h | 37 /** A token bucket is an internal structure that tracks how many bytes we are
44 /** When was this bucket last updated? Measured in abstract 'ticks'
45 * relative to the token bucket configuration. */
49 /** Configuration info for a token bucket or set of token buckets. */
68 /** The current tick is 'current_tick': add bytes to 'bucket' as specified in
70 int ev_token_bucket_update_(struct ev_token_bucket *bucket,
79 /** Adjust 'bucket' to respect 'cfg', and note that it was last updated in
81 * configuration of 'bucket'; otherwise, we are setting it up for the first
84 int ev_token_bucket_init_(struct ev_token_bucket *bucket,
|
| /src/external/bsd/jemalloc.old/dist/src/ |
| ckh.c | 4 * hash bucket contains 2^n cells, for n >= 1, and 2 indicates that two hash
24 * | #cells/bucket |
32 * The number of cells per bucket is chosen such that a bucket fits in one cache
58 * Search bucket for key and return the cell number if found; SIZE_T_MAX
62 ckh_bucket_search(ckh_t *ckh, size_t bucket, const void *key) {
67 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
69 return (bucket << LG_CKH_BUCKET_CELLS) + i;
81 size_t hashes[2], bucket, cell; local
87 /* Search primary bucket. *
137 size_t hashes[2], bucket, tbucket; local
205 size_t hashes[2], bucket; local
[all...] |
| /src/external/bsd/jemalloc/dist/src/ |
| ckh.c | 4 * hash bucket contains 2^n cells, for n >= 1, and 2 indicates that two hash
24 * | #cells/bucket |
32 * The number of cells per bucket is chosen such that a bucket fits in one cache
58 * Search bucket for key and return the cell number if found; SIZE_T_MAX
62 ckh_bucket_search(ckh_t *ckh, size_t bucket, const void *key) {
67 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
69 return (bucket << LG_CKH_BUCKET_CELLS) + i;
81 size_t hashes[2], bucket, cell; local
87 /* Search primary bucket. *
137 size_t hashes[2], bucket, tbucket; local
208 size_t hashes[2], bucket; local
[all...] |
| /src/sys/net/npf/ |
| lpm.c | 88 lpm_ent_t ** bucket; member in struct:__anon7045
115 KASSERT(!hmap->bucket);
119 lpm_ent_t *entry = hmap->bucket[i];
133 kmem_free(hmap->bucket, hmap->hashsize * sizeof(lpm_ent_t *));
134 hmap->bucket = NULL;
172 lpm_ent_t **bucket; local
178 bucket = kmem_zalloc(hashsize * sizeof(lpm_ent_t *), flags);
179 if (bucket == NULL)
182 lpm_ent_t *list = hmap->bucket[n];
190 entry->next = bucket[i]
[all...] |
| /src/external/mpl/bind/dist/lib/isccc/ |
| symtab.c | 102 free_elt(isccc_symtab_t *symtab, unsigned int bucket, elt_t *elt) {
103 ISC_LIST_UNLINK(symtab->table[bucket], elt, link);
191 unsigned int bucket; local
197 FIND(symtab, key, type, bucket, elt);
211 unsigned int bucket; local
218 FIND(symtab, key, type, bucket, elt);
225 ISC_LIST_UNLINK(symtab->table[bucket], elt, link);
246 ISC_LIST_PREPEND(symtab->table[bucket], elt, link);
254 unsigned int bucket; local
260 FIND(symtab, key, type, bucket, elt)
[all...] |
| /src/libexec/ld.elf_so/ |
| xmalloc.c | 111 uint16_t ovu_index; /* bucket # */
171 size_t bucket; local
200 bucket = 0;
203 bucket++;
204 if (amt == 0 || bucket >= NBUCKETS)
208 * If nothing in hash bucket right now,
211 if ((op = nextf[bucket]) == NULL) {
212 morecore(bucket);
213 if ((op = nextf[bucket]) == NULL)
217 nextf[bucket] = op->ov_next
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-phinodes.cc | 97 size_t bucket = NUM_BUCKETS - 2; local
102 for (bucket = len - 2; bucket < NUM_BUCKETS - 2; bucket++)
103 if (free_phinodes[bucket])
107 if (bucket < NUM_BUCKETS - 2
108 && gimple_phi_capacity ((*free_phinodes[bucket])[0]) >= len)
111 phi = as_a <gphi *> (free_phinodes[bucket]->pop ());
112 if (free_phinodes[bucket]->is_empty ())
113 vec_free (free_phinodes[bucket]);
215 size_t bucket; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-phinodes.cc | 97 size_t bucket = NUM_BUCKETS - 2; local
102 for (bucket = len - 2; bucket < NUM_BUCKETS - 2; bucket++)
103 if (free_phinodes[bucket])
107 if (bucket < NUM_BUCKETS - 2
108 && gimple_phi_capacity ((*free_phinodes[bucket])[0]) >= len)
111 phi = as_a <gphi *> (free_phinodes[bucket]->pop ());
112 if (free_phinodes[bucket]->is_empty ())
113 vec_free (free_phinodes[bucket]);
215 size_t bucket; local
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/dns/ |
| adb.c | 87 #define DNS_ADB_INVALIDBUCKET (-1) /*%< invalid bucket address */
125 * XXXRTH Have a per-bucket structure that contains all of these?
139 * XXXRTH Have a per-bucket structure that contains all of these?
587 unsigned int i, n, bucket; local
653 bucket = isc_sockaddr_hash(&e->sockaddr, true) % n;
654 e->lock_bucket = bucket;
655 ISC_LIST_APPEND(newentries[bucket], e, plink);
658 newentry_refcnt[bucket]++;
664 bucket = isc_sockaddr_hash(&e->sockaddr, true) % n;
665 e->lock_bucket = bucket;
752 unsigned int bucket; local
1062 int bucket; local
1186 int bucket; local
1242 int bucket; local
1277 unsigned int bucket; local
1322 unsigned int bucket; local
1669 int bucket; local
1687 int bucket; local
2084 int bucket; local
2127 int bucket; local
2231 int bucket; local
2913 int bucket; local
3284 int bucket; local
3342 int bucket; local
3874 int bucket; local
4150 int bucket; local
4189 int bucket; local
4209 int bucket; local
4253 int bucket; local
4360 int bucket; local
4396 int bucket; local
4421 int bucket; local
4458 int bucket; local
4506 int bucket; local
4537 int bucket; local
4553 int bucket; local
4587 int bucket; local
4618 int bucket; local
4641 int bucket; local
4695 int bucket; local
4761 unsigned int bucket; local
[all...] |
| /src/sys/dev/raidframe/ |
| rf_debugMem.c | 157 size_t bucket = (size_t)HASHADDR(addr); local
163 for (p = mh_table[bucket]; p && (p->address != addr); p = p->next)
168 p->next = mh_table[bucket];
169 mh_table[bucket] = p;
189 size_t bucket = HASHADDR(addr); local
193 for (p = mh_table[bucket]; p && (p->address != addr); p = p->next)
|
| /src/sys/arch/mips/rmi/ |
| rmixl_fmnvar.h | 59 * - here we use 1 bucket per thread
68 #define RMIXL_FMN_CORE_DESTID(core, bucket) \
69 (((core) << 3) | (bucket))
161 rmixl_msgld(uint32_t bucket)
169 :: "r"(bucket));
|
| /src/external/cddl/osnet/dist/tools/ctf/cvt/ |
| hash.c | 114 int bucket = hash->h_hashfn(hash->h_nbuckets, key); local
116 list_add(&hash->h_buckets[bucket], key);
142 int bucket = hash->h_hashfn(hash->h_nbuckets, key); local
144 (void) list_remove(&hash->h_buckets[bucket], key,
152 int bucket = hash->h_hashfn(hash->h_nbuckets, key); local
154 return (list_iter(hash->h_buckets[bucket], fun, private) < 0);
177 int bucket = hash->h_hashfn(hash->h_nbuckets, key); local
185 return (list_iter(hash->h_buckets[bucket], hash_find_list_cb,
|
| /src/external/cddl/osnet/dist/uts/common/dtrace/ |
| fasttrap.c | 137 * from being freed. A provider is looked up by taking the bucket lock for the
151 * bucket lock before provider lock
398 fasttrap_bucket_t *bucket; local
407 bucket = &fasttrap_procs.fth_table[FASTTRAP_PROCS_INDEX(pid)];
411 mutex_enter(&bucket->ftb_mtx);
412 for (fprc = bucket->ftb_data; fprc != NULL; fprc = fprc->ftpc_next) {
415 mutex_exit(&bucket->ftb_mtx);
420 mutex_exit(&bucket->ftb_mtx);
469 fasttrap_bucket_t *bucket; local
487 bucket = &fasttrap_provs.fth_table[i]
669 fasttrap_bucket_t *bucket = &fasttrap_tpoints.fth_table[i]; local
774 fasttrap_bucket_t *bucket; local
957 fasttrap_bucket_t *bucket; local
1486 fasttrap_bucket_t *bucket; local
1553 fasttrap_bucket_t *bucket; local
1640 fasttrap_bucket_t *bucket; local
1803 fasttrap_bucket_t *bucket; local
2622 fasttrap_bucket_t *bucket = &fasttrap_provs.fth_table[i]; local
[all...] |
| /src/usr.sbin/bootp/common/ |
| hash.c | 101 * Frees an entire linked list of bucket members (used in the open
122 * memory and resets all bucket pointers to NULL.
205 * to determine the bucket number, and "compare" and "key" to determine
209 * already exists in the given bucket of the hash table, or some other error
331 unsigned bucket;
344 * until we find a new chain (non-empty bucket) or run out of buckets.
346 bucket = hashtable->bucketnum + 1;
347 while ((bucket < hashtable->size) &&
348 !(memberptr = (hashtable->table)[bucket])) {
349 bucket++
323 unsigned bucket; local
[all...] |
| /src/external/mpl/bind/dist/lib/isc/ |
| symtab.c | 154 unsigned int bucket; local
160 FIND(symtab, key, type, bucket, elt);
213 unsigned int bucket; local
220 FIND(symtab, key, type, bucket, elt);
227 UNLINK(symtab->table[bucket], elt, link);
253 PREPEND(symtab->table[bucket], elt, link);
264 unsigned int bucket; local
270 FIND(symtab, key, type, bucket, elt);
280 UNLINK(symtab->table[bucket], elt, link);
|
| /src/external/mpl/dhcp/bind/dist/lib/isc/ |
| symtab.c | 157 unsigned int bucket; local
163 FIND(symtab, key, type, bucket, elt);
218 unsigned int bucket; local
225 FIND(symtab, key, type, bucket, elt);
232 UNLINK(symtab->table[bucket], elt, link);
258 PREPEND(symtab->table[bucket], elt, link);
269 unsigned int bucket; local
275 FIND(symtab, key, type, bucket, elt);
285 UNLINK(symtab->table[bucket], elt, link);
|
