Home
last modified time | relevance | path

Searched refs:buckets (Results 1 – 25 of 191) sorted by relevance

12345678

/netbsd-src/external/bsd/unbound/dist/util/
H A Dtimehist.c78 hist->buckets[i].lower = last; in dosetup()
80 hist->buckets[i].upper = last; in dosetup()
81 hist->buckets[i].count = 0; in dosetup()
92 hist->buckets = (struct th_buck*)calloc(hist->num, in timehist_setup()
94 if(!hist->buckets) { in timehist_setup()
107 free(hist->buckets); in timehist_delete()
115 hist->buckets[i].count = 0; in timehist_clear()
122 if(timeval_smaller(tv, &hist->buckets[i].upper)) { in timehist_insert()
123 hist->buckets[i].count++; in timehist_insert()
128 hist->buckets[hist->num-1].count++; in timehist_insert()
[all …]
/netbsd-src/usr.bin/make/
H A Dhash.c124 for (he = t->buckets[h & t->bucketsMask]; he != NULL; he = he->next) { in HashTable_Find()
139 HashEntry **buckets = bmake_malloc(sizeof *buckets * n); in HashTable_Init() local
141 buckets[i] = NULL; in HashTable_Init()
143 t->buckets = buckets; in HashTable_Init()
156 HashEntry **buckets = t->buckets; in HashTable_Done() local
160 HashEntry *he = buckets[i]; in HashTable_Done()
168 free(t->buckets); in HashTable_Done()
170 t->buckets = NULL; in HashTable_Done()
207 const HashEntry *he = t->buckets[b]; in HashTable_MaxChain()
224 HashEntry **oldBuckets = t->buckets; in HashTable_Enlarge()
[all …]
/netbsd-src/external/gpl2/groff/dist/src/libs/libxutil/
H A DDviChar.c67 DviCharNameHash **buckets; in dispose_hash() local
71 buckets = map->buckets; in dispose_hash()
73 for (h = buckets[i]; h; h=next) { in dispose_hash()
95 DviCharNameHash **buckets; in compute_hash() local
99 buckets = map->buckets; in compute_hash()
101 buckets[i] = 0; in compute_hash()
108 h->next = buckets[i]; in compute_hash()
109 buckets[i] = h; in compute_hash()
123 for (h = map->buckets[i]; h; h=h->next) in DviCharIndex()
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/libdruntime/rt/
H A DaaA.d55 buckets = allocBuckets(sz);
56 firstUsed = cast(uint) buckets.length;
68 Bucket[] buckets;
93 return buckets.length; in dim()
106 if (!buckets[i].filled) in inout()
107 return &buckets[i]; in inout()
117 if (buckets[i].hash == hash && keyti.equals(pkey, buckets[i].entry)) in inout()
118 return &buckets[i]; in inout()
119 else if (buckets[i].empty) in inout()
143 auto obuckets = buckets; in resize()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libobjc/
H A Dsarray.c135 the_bucket = &((*the_index)->buckets[boffset]); in sarray_at_put()
137 the_bucket = &(array->buckets[boffset]); in sarray_at_put()
154 the_bucket = &((*the_index)->buckets[boffset]); in sarray_at_put()
166 the_bucket = &((*the_index)->buckets[boffset]); in sarray_at_put()
264 arr->empty_index->buckets[counter] = arr->empty_bucket; in sarray_new()
279 arr->buckets = new_buckets; in sarray_new()
341 old_buckets = array->buckets; in sarray_realloc()
370 array->buckets = new_buckets; in sarray_realloc()
406 old_buckets = array->buckets; in sarray_free()
420 struct sbucket *bkt = idx->buckets[c2]; in sarray_free()
[all …]
/netbsd-src/external/gpl3/gcc/dist/libobjc/
H A Dsarray.c135 the_bucket = &((*the_index)->buckets[boffset]); in sarray_at_put()
137 the_bucket = &(array->buckets[boffset]); in sarray_at_put()
154 the_bucket = &((*the_index)->buckets[boffset]); in sarray_at_put()
166 the_bucket = &((*the_index)->buckets[boffset]); in sarray_at_put()
264 arr->empty_index->buckets[counter] = arr->empty_bucket; in sarray_new()
279 arr->buckets = new_buckets; in sarray_new()
341 old_buckets = array->buckets; in sarray_realloc()
370 array->buckets = new_buckets; in sarray_realloc()
406 old_buckets = array->buckets; in sarray_free()
420 struct sbucket *bkt = idx->buckets[c2]; in sarray_free()
[all …]
/netbsd-src/external/gpl2/gettext/dist/gettext-tools/src/
H A Dwrite-qt.c525 struct bucket *buckets = in write_qm() local
533 buckets[i].head = NULL; in write_qm()
534 buckets[i].tail = &buckets[i].head; in write_qm()
551 *buckets[i].tail = freelist; in write_qm()
552 buckets[i].tail = &freelist->next; in write_qm()
563 if (buckets[i].head != NULL) in write_qm()
567 for (p = buckets[i].head; p != NULL; p = p->next) in write_qm()
584 if (buckets[i].head != NULL) in write_qm()
589 for (p = buckets[i].head; p != NULL; p = p->next) in write_qm()
603 if (buckets[i].head != NULL) in write_qm()
[all …]
/netbsd-src/sys/dev/wscons/
H A Dwsdisplay_glyphcache.c118 int cache_lines, buckets, i, usedcells = 0, idx; in glyphcache_reconfig()
144 /* now allocate buckets */ in glyphcache_reconfig()
145 buckets = (gc->gc_numcells / 223); in glyphcache_reconfig()
146 if ((buckets * 223) < gc->gc_numcells) in glyphcache_reconfig()
147 buckets++; in glyphcache_reconfig()
153 if (buckets < 1) in glyphcache_reconfig()
156 buckets = uimin(buckets, gc->gc_nbuckets); in glyphcache_reconfig()
157 gc->gc_numbuckets = buckets; in glyphcache_reconfig()
159 DPRINTF("%s: using %d buckets\ in glyphcache_reconfig()
93 int cache_lines, buckets, i, usedcells = 0, idx; glyphcache_reconfig() local
[all...]
/netbsd-src/external/gpl3/gcc/dist/libphobos/libdruntime/rt/
H A DaaA.d57 buckets = allocBuckets(sz);
58 firstUsed = cast(uint) buckets.length;
71 Bucket[] buckets;
96 return buckets.length; in dim()
109 if (!buckets[i].filled) in inout()
110 return &buckets[i]; in inout()
120 if (buckets[i].hash == hash && keyti.equals(pkey, buckets[i].entry)) in inout()
121 return &buckets[i]; in inout()
122 else if (buckets[i].empty) in inout()
146 auto obuckets = buckets; in resize()
[all …]
/netbsd-src/external/bsd/top/dist/
H A Dhash.c203 result->buckets = b = emalloc(bytes); in hash_create()
232 bucket = ht->buckets; in hash_count()
260 bucket = ht->buckets; in hash_sizeinfo()
307 bucket = &(ht->buckets[(key % ht->num_buckets)]); in hash_add_uint()
361 bucket = &(ht->buckets[(key % ht->num_buckets)]); in hash_replace_uint()
413 if ((bucket = &(ht->buckets[(key % ht->num_buckets)])) != NULL) in hash_lookup_uint()
452 if ((bucket = &(ht->buckets[(key % ht->num_buckets)])) != NULL) in hash_remove_uint()
491 pos->hash_bucket = ht->buckets; in hash_first_uint()
641 bucket = &(ht->buckets[(key % ht->num_buckets)]); in hash_add_pid()
695 bucket = &(ht->buckets[(key % ht->num_buckets)]); in hash_replace_pid()
[all …]
H A Dhash.m4c40 * less than or equal to the number of buckets and the result is used
41 * to index in to the array of buckets. Each bucket is a linked list
223 * Creates a hash table structure with at least "num" buckets.
241 /* create the buckets */
243 result->buckets = b = (bucket_t *)MALLOC(bytes);
271 bucket = ht->buckets;
298 bucket = ht->buckets;
352 bucket = &(ht->buckets[$3]);
373 /* add the unique element to the buckets list */
406 bucket = &(ht->buckets[$3]);
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libobjc/objc-private/
H A Dsarray.h127 struct sbucket* buckets[INDEX_SIZE]; member
141 struct sbucket** buckets;
218 buckets[x.off.boffset]-> in sarray_get()
221 return array->buckets[x.off.boffset]->elems[x.off.eoffset]; in sarray_get()
227 buckets[(indx / BUCKET_SIZE) % INDEX_SIZE]-> in sarray_get()
230 return array->buckets[indx / BUCKET_SIZE]->elems[indx % BUCKET_SIZE]; in sarray_get()
/netbsd-src/external/gpl3/gcc/dist/libobjc/objc-private/
H A Dsarray.h127 struct sbucket* buckets[INDEX_SIZE]; member
141 struct sbucket** buckets;
218 buckets[x.off.boffset]-> in sarray_get()
221 return array->buckets[x.off.boffset]->elems[x.off.eoffset]; in sarray_get()
227 buckets[(indx / BUCKET_SIZE) % INDEX_SIZE]-> in sarray_get()
230 return array->buckets[indx / BUCKET_SIZE]->elems[indx % BUCKET_SIZE]; in sarray_get()
/netbsd-src/external/apache2/llvm/dist/clang/utils/hmaptool/
H A Dhmaptool67 buckets = [struct.unpack(bucket_fmt,
90 return HeaderMap(num_entries, buckets, strtable)
92 def __init__(self, num_entries, buckets, strtable): argument
94 self.buckets = buckets
106 for key_idx,prefix_idx,suffix_idx in self.buckets:
136 print (' num buckets: %d' % (len(hmap.buckets),))
138 for i,bucket in enumerate(hmap.buckets):
150 i, key, prefix, suffix, (hmap_hash(key) & (len(hmap.buckets) - 1))))
/netbsd-src/external/mpl/dhcp/dist/omapip/
H A Dhash.c116 for (hbc = ptr -> buckets [i]; hbc; hbc = hbn) {
121 for (hbc = ptr -> buckets [i]; hbc; hbc = hbn) {
125 ptr -> buckets [i] = (struct hash_bucket *)0;
230 memset ((*rp)->buckets, 0, hsize * sizeof(struct hash_bucket *)); in new_hash()
368 bp = table->buckets[i]; in hash_report()
432 bp -> next = table -> buckets [hashno];
434 table -> buckets [hashno] = bp;
458 for (bp = table -> buckets [hashno]; bp; bp = bp -> next) {
466 table -> buckets [hashno] = bp -> next;
502 for (bp = table -> buckets [hashno]; bp; bp = bp -> next) {
[all …]
/netbsd-src/external/bsd/ipf/dist/tools/
H A Dipnat.c420 u_int *buckets; local
423 sz = sizeof(*buckets) * nsp->ns_nattab_sz;
424 buckets = (u_int *)malloc(sz);
425 if (buckets == NULL) {
441 table.ita_table = buckets;
446 free(buckets);
450 if (kmemcpy((char *)buckets, (u_long)nsp->ns_nattab_sz, sz)) {
451 free(buckets);
462 if (buckets[i] > maxlen)
463 maxlen = buckets[i];
[all …]
/netbsd-src/external/bsd/elftoolchain/dist/common/
H A Duthash.h146 (head)->hh.tbl->buckets[_hd_bkt].count++; \
163 …HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], keyptr, keylen, hashval, …
226 (head)->hh.tbl->buckets = (UT_hash_bucket*)uthash_malloc( \
229 if (!(head)->hh.tbl->buckets) { \
233 uthash_bzero((head)->hh.tbl->buckets, \
238 uthash_free((head)->hh.tbl->buckets, \
322 HASH_ADD_TO_BKT((head)->hh.tbl->buckets[_ha_bkt], hh, &(add)->hh, oomed); \
345 HASH_ADD_TO_BKT((head)->hh.tbl->buckets[_ha_bkt], hh, &(add)->hh, oomed); \
458 uthash_free((head)->hh.tbl->buckets, \
476 HASH_DEL_IN_BKT((head)->hh.tbl->buckets[_hd_bkt], _hd_hh_del); \
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/building_blocks/
H A Dbucketizer.d32 Allocator[(max + 1 - min) / step] buckets; in Bucketizer()
37 return i < buckets.length ? buckets.ptr + i : null; in Bucketizer()
197 foreach (ref a; buckets) in Bucketizer()
211 foreach (ref a; buckets) in Bucketizer()
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/experimental/allocator/building_blocks/
H A Dbucketizer.d36 Allocator[(max + 1 - min) / step] buckets; in Bucketizer()
42 return i < buckets.length ? &buckets[i] : null; in Bucketizer()
217 foreach (ref a; buckets) in Bucketizer()
231 foreach (ref a; buckets) in Bucketizer()
304 foreach (ref bucket; a.buckets)
326 foreach (ref bucket; a.buckets)
/netbsd-src/external/gpl2/xcvs/dist/diff/
H A Dio.c50 static int *buckets; variable
281 bucket = &buckets[h % nbuckets];
291 bucket = &buckets[-1];
699 buckets = (int *) xmalloc ((nbuckets + 1) * sizeof (*buckets));
700 bzero (buckets++, (nbuckets + 1) * sizeof (*buckets));
708 free (buckets - 1);
/netbsd-src/external/gpl2/diffutils/dist/src/
H A Dio.c55 static lin *buckets; variable
388 bucket = &buckets[h % nbuckets]; in find_and_hash_each_line()
398 bucket = &buckets[-1]; in find_and_hash_each_line()
843 if (PTRDIFF_MAX / sizeof *buckets <= nbuckets) in read_files()
845 buckets = zalloc ((nbuckets + 1) * sizeof *buckets); in read_files()
846 buckets++; in read_files()
854 free (buckets - 1); in read_files()
/netbsd-src/external/gpl3/binutils/dist/ld/
H A Dpdb.c278 struct hash_entry **buckets = NULL; in populate_info_stream() local
312 buckets = xmalloc (sizeof (struct hash_entry *) * num_buckets); in populate_info_stream()
313 memset (buckets, 0, sizeof (struct hash_entry *) * num_buckets); in populate_info_stream()
323 while (buckets[bucket_num]) in populate_info_stream()
331 buckets[bucket_num] = xmalloc (sizeof (struct hash_entry)); in populate_info_stream()
333 buckets[bucket_num]->offset = names_length; in populate_info_stream()
334 buckets[bucket_num]->value = stream_num; in populate_info_stream()
393 if (buckets[i + j]) in populate_info_stream()
416 if (buckets[i]) in populate_info_stream()
418 bfd_putl32 (buckets[i]->offset, int_buf); in populate_info_stream()
[all …]
/netbsd-src/external/mpl/bind/dist/lib/dns/
H A Dresolver.c569 fctxbucket_t *buckets; global() member
/netbsd-src/external/apache2/llvm/dist/llvm/docs/PDB/
H A DHashTable.rst51 - **Capacity** - The number of buckets in the hash table. Producers should
55 about which buckets have valid values. If the bucket has a value, the
61 about which buckets have tombstone values. If the entry in this bucket is
64 - **Keys and Values** - A list of ``Capacity`` hash buckets, where the first
/netbsd-src/lib/librumpuser/
H A Drumpuser_dl.c235 Elf32_Word *gnuhash, *buckets, *ptr; in getsymbols() local
250 buckets = gnuhash + 4 + maskwords; in getsymbols()
252 if (buckets[bi] != 0) { in getsymbols()
253 maxchain = buckets[bi]; in getsymbols()
265 ptr = buckets + nbuck + (maxchain - symndx); in getsymbols()

12345678