Searched refs:buckets (Results 1 - 25 of 69) sorted by relevance

123

/netbsd-current/external/bsd/unbound/dist/util/
H A Dtimehist.c78 hist->buckets[i].lower = last;
80 hist->buckets[i].upper = last;
81 hist->buckets[i].count = 0;
92 hist->buckets = (struct th_buck*)calloc(hist->num,
94 if(!hist->buckets) {
98 /* setup the buckets */
107 free(hist->buckets);
115 hist->buckets[i].count = 0;
122 if(timeval_smaller(tv, &hist->buckets[i].upper)) {
123 hist->buckets[
[all...]
H A Dtimehist.h45 /** Number of buckets in a histogram */
64 /** number of buckets */
67 struct th_buck* buckets; member in struct:timehist
/netbsd-current/external/gpl2/groff/dist/src/libs/libxutil/
H A DDviChar.c67 DviCharNameHash **buckets; local
71 buckets = map->buckets;
73 for (h = buckets[i]; h; h=next) {
95 DviCharNameHash **buckets; local
99 buckets = map->buckets;
101 buckets[i] = 0;
108 h->next = buckets[i];
109 buckets[
[all...]
/netbsd-current/usr.bin/make/
H A Dhash.c80 * The ratio of # entries to # buckets at which we rebuild the table to
125 for (he = t->buckets[h & t->bucketsMask]; he != NULL; he = he->next) {
144 HashEntry **buckets = bmake_malloc(sizeof *buckets * n); local
146 buckets[i] = NULL;
148 t->buckets = buckets;
162 HashEntry **buckets = t->buckets; local
166 HashEntry *he = buckets[
308 HashEntry **buckets = t->buckets; local
[all...]
/netbsd-current/external/bsd/libarchive/dist/libarchive/
H A Darchive_entry_link_resolver.c80 struct links_entry **buckets; member in struct:archive_entry_linkresolver
113 res->buckets = calloc(res->number_buckets, sizeof(res->buckets[0]));
114 if (res->buckets == NULL) {
169 free(res->buckets);
283 for (le = res->buckets[bucket]; le != NULL; le = le->next) {
301 if (res->buckets[bucket] == le)
302 res->buckets[bucket] = le->next;
328 for (le = res->buckets[bucket]; le != NULL; le = le->next) {
341 res->buckets[bucke
[all...]
/netbsd-current/external/gpl2/groff/dist/src/include/
H A DDviChar.h29 DviCharNameHash *buckets[DVI_HASH_SIZE]; member in struct:_dviCharNameMap
/netbsd-current/external/gpl3/gcc.old/dist/libobjc/objc-private/
H A Dsarray.h127 struct sbucket* buckets[INDEX_SIZE]; member in struct:sindex
141 struct sbucket** buckets;
219 buckets[x.off.boffset]->
222 return array->buckets[x.off.boffset]->elems[x.off.eoffset];
228 buckets[(indx / BUCKET_SIZE) % INDEX_SIZE]->
231 return array->buckets[indx / BUCKET_SIZE]->elems[indx % BUCKET_SIZE];
/netbsd-current/external/gpl3/gcc/dist/libobjc/objc-private/
H A Dsarray.h127 struct sbucket* buckets[INDEX_SIZE]; member in struct:sindex
141 struct sbucket** buckets;
219 buckets[x.off.boffset]->
222 return array->buckets[x.off.boffset]->elems[x.off.eoffset];
228 buckets[(indx / BUCKET_SIZE) % INDEX_SIZE]->
231 return array->buckets[indx / BUCKET_SIZE]->elems[indx % BUCKET_SIZE];
/netbsd-current/sys/dev/wscons/
H A Dwsdisplay_glyphcache.c93 int cache_lines, buckets, i, usedcells = 0, idx; local
119 /* now allocate buckets */
120 buckets = (gc->gc_numcells / 223);
121 if ((buckets * 223) < gc->gc_numcells)
122 buckets++;
128 if (buckets < 1)
131 buckets = uimin(buckets, gc->gc_nbuckets);
132 gc->gc_numbuckets = buckets;
134 DPRINTF("%s: using %d buckets\
[all...]
/netbsd-current/external/gpl2/gettext/dist/gettext-tools/src/
H A Dwrite-qt.c154 u16 buckets[table_size];
171 buckets[i] is 0 for an empty bucket, or the offset in pool[] where
525 struct bucket *buckets = local
533 buckets[i].head = NULL;
534 buckets[i].tail = &buckets[i].head;
551 *buckets[i].tail = freelist;
552 buckets[i].tail = &freelist->next;
563 if (buckets[i].head != NULL)
567 for (p = buckets[
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/libdruntime/rt/
H A DaaA.d31 // magic hash constants to distinguish empty, deleted, and filled buckets
55 buckets = allocBuckets(sz);
56 firstUsed = cast(uint) buckets.length;
68 Bucket[] buckets;
93 return buckets.length;
106 if (!buckets[i].filled)
107 return &buckets[i];
117 if (buckets[i].hash == hash && keyti.equals(pkey, buckets[i].entry))
118 return &buckets[
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libobjc/
H A Dsarray.c135 the_bucket = &((*the_index)->buckets[boffset]);
137 the_bucket = &(array->buckets[boffset]);
154 the_bucket = &((*the_index)->buckets[boffset]);
166 the_bucket = &((*the_index)->buckets[boffset]);
264 arr->empty_index->buckets[counter] = arr->empty_bucket;
279 arr->buckets = new_buckets;
342 old_buckets = array->buckets;
347 /* Copy buckets below old_max_index (they are still valid). */
371 array->buckets = new_buckets;
408 old_buckets = array->buckets;
[all...]
/netbsd-current/external/gpl3/gcc/dist/libobjc/
H A Dsarray.c135 the_bucket = &((*the_index)->buckets[boffset]);
137 the_bucket = &(array->buckets[boffset]);
154 the_bucket = &((*the_index)->buckets[boffset]);
166 the_bucket = &((*the_index)->buckets[boffset]);
264 arr->empty_index->buckets[counter] = arr->empty_bucket;
279 arr->buckets = new_buckets;
342 old_buckets = array->buckets;
347 /* Copy buckets below old_max_index (they are still valid). */
371 array->buckets = new_buckets;
408 old_buckets = array->buckets;
[all...]
/netbsd-current/external/apache2/llvm/dist/clang/utils/hmaptool/
H A Dhmaptool55 # The number of buckets must be a power of two.
57 raise SystemExit("error: %s: invalid number of buckets" % (
60 # Read all of the buckets.
65 raise SystemExit("error: %s: truncated headermap buckets" % (
67 buckets = [struct.unpack(bucket_fmt,
90 return HeaderMap(num_entries, buckets, strtable)
92 def __init__(self, num_entries, buckets, strtable):
94 self.buckets = buckets
106 for key_idx,prefix_idx,suffix_idx in self.buckets
[all...]
/netbsd-current/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;
142 /* Account for all the hash buckets on the free list. */
230 memset ((*rp)->buckets, 0, hsize * sizeof(struct hash_bucket *));
368 bp = table->buckets[i];
432 bp -> next = table -> buckets [hashno];
434 table -> buckets [hashno] = bp;
458 for (bp = table -> buckets [hashno]; bp; bp = bp -> next) {
466 table -> buckets [hashn
[all...]
/netbsd-current/external/bsd/top/dist/
H A Dhash.m4h65 bucket_t *buckets;
H A Dhash.c40 * 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
183 * Creates a hash table structure with at least "num" buckets.
201 /* create the buckets */
203 result->buckets = b = emalloc(bytes);
232 bucket = ht->buckets;
260 bucket = ht->buckets;
307 bucket = &(ht->buckets[(key % ht->num_buckets)]);
328 /* add the unique element to the buckets list */
361 bucket = &(ht->buckets[(ke
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/building_blocks/
H A Dbucketizer.d32 Allocator[(max + 1 - min) / step] buckets;
37 return i < buckets.length ? buckets.ptr + i : null;
57 Directs the call to either one of the $(D buckets) allocators.
72 Directs the call to either one of the $(D buckets) allocators. Defined only
128 // Move cross buckets
155 // Move cross buckets
197 foreach (ref a; buckets)
211 foreach (ref a; buckets)
/netbsd-current/external/gpl3/gcc/dist/libphobos/libdruntime/rt/
H A DaaA.d33 // magic hash constants to distinguish empty, deleted, and filled buckets
57 buckets = allocBuckets(sz);
58 firstUsed = cast(uint) buckets.length;
71 Bucket[] buckets;
96 return buckets.length;
109 if (!buckets[i].filled)
110 return &buckets[i];
120 if (buckets[i].hash == hash && keyti.equals(pkey, buckets[i].entry))
121 return &buckets[
[all...]
/netbsd-current/external/mpl/dhcp/bind/dist/lib/dns/include/dns/
H A Ddispatch.h253 unsigned int maxrequests, unsigned int buckets,
261 unsigned int maxrequests, unsigned int buckets,
278 *\li buckets < 2097169
280 *\li increment > buckets
295 unsigned int buckets, unsigned int increment,
307 * "buckets" is the number of buckets to use, and should be prime.
310 * a prime > buckets, and not 2.
326 *\li buckets < 2097169 (the next prime after 65536 * 32)
328 *\li increment > buckets (an
[all...]
/netbsd-current/external/bsd/elftoolchain/dist/common/
H A Duthash.h131 /* initial number of buckets */
132 #define HASH_INITIAL_NUM_BUCKETS 32U /* initial number of buckets */
133 #define HASH_INITIAL_NUM_BUCKETS_LOG2 5U /* lg2 of initial number of buckets */
146 (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, out); \
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_bk
1095 UT_hash_bucket *buckets; member in struct:UT_hash_table
[all...]
/netbsd-current/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) {
427 "cannot allocate memory (%d) for buckets\n", sz);
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[
[all...]
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/experimental/allocator/building_blocks/
H A Dbucketizer.d36 Allocator[(max + 1 - min) / step] buckets;
42 return i < buckets.length ? &buckets[i] : null;
63 Directs the call to either one of the `buckets` allocators.
92 Directs the call to either one of the `buckets` allocators. Defined only
148 // Move cross buckets
175 // Move cross buckets
217 foreach (ref a; buckets)
231 foreach (ref a; buckets)
286 // Move cross buckets
[all...]
/netbsd-current/external/gpl2/xcvs/dist/diff/
H A Dio.c49 /* Hash-table: array of buckets, each being a chain of equivalence classes.
50 buckets[-1] is reserved for incomplete lines. */ variable
51 static int *buckets;
53 /* Number of buckets in the hash table array, not counting buckets[-1]. */
284 bucket = &buckets[h % nbuckets];
294 bucket = &buckets[-1];
705 buckets = (int *) xmalloc ((nbuckets + 1) * sizeof (*buckets));
706 bzero (buckets
[all...]
/netbsd-current/external/gpl2/diffutils/dist/src/
H A Dio.c54 /* Hash-table: array of buckets, each being a chain of equivalence classes.
55 buckets[-1] is reserved for incomplete lines. */ variable
56 static lin *buckets;
58 /* Number of buckets in the hash table array, not counting buckets[-1]. */
392 bucket = &buckets[h % nbuckets];
400 put the line into buckets[-1]. */
402 bucket = &buckets[-1];
844 /* Allocate (one plus) a prime number of hash buckets. Use a prime
850 if (PTRDIFF_MAX / sizeof *buckets <
[all...]

Completed in 439 milliseconds

123