| /src/external/bsd/unbound/dist/util/ |
| timehist.c | 78 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[i].count++
[all...] |
| timehist.h | 45 /** Number of buckets in a histogram */
64 /** number of buckets */
67 struct th_buck* buckets; member in struct:timehist
|
| /src/external/gpl2/groff/dist/src/libs/libxutil/ |
| DviChar.c | 67 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[i] = h
[all...] |
| /src/usr.bin/make/ |
| hash.c | 80 * The ratio of # entries to # buckets at which we rebuild the table to
124 for (he = t->buckets[h & t->bucketsMask]; he != NULL; he = he->next) {
139 HashEntry **buckets = bmake_malloc(sizeof *buckets * n); local
141 buckets[i] = NULL;
143 t->buckets = buckets;
156 HashEntry **buckets = t->buckets; local
160 HashEntry *he = buckets[i]
315 HashEntry **buckets = t->buckets; local
[all...] |
| /src/external/bsd/jemalloc.old/dist/test/analyze/ |
| rand.c | 10 * (b) the buckets:
11 * (1) number of buckets,
21 * (1) ~68% buckets should show no interesting deviation, meaning a
23 * (2) ~27% buckets should show '+' / '-', meaning a deviation in the range
25 * (3) ~4% buckets should show '++' / '--', meaning a deviation in the
27 * (4) less than 0.3% buckets should show more than two '+'s / '-'s.
32 * (b) The buckets must be of equal width and the lowest bucket starts at
49 collect_buckets(uint64_t (*gen)(void *), void *opaque, size_t buckets[],
57 ++buckets[bucket_id];
62 print_buckets(const size_t buckets[], const size_t means[]
147 size_t buckets[N_BUCKET]; local
250 size_t buckets[N_GEO_BUCKET + 1]; local
[all...] |
| /src/external/bsd/jemalloc/dist/test/analyze/ |
| rand.c | 10 * (b) the buckets:
11 * (1) number of buckets,
21 * (1) ~68% buckets should show no interesting deviation, meaning a
23 * (2) ~27% buckets should show '+' / '-', meaning a deviation in the range
25 * (3) ~4% buckets should show '++' / '--', meaning a deviation in the
27 * (4) less than 0.3% buckets should show more than two '+'s / '-'s.
32 * (b) The buckets must be of equal width and the lowest bucket starts at
49 collect_buckets(uint64_t (*gen)(void *), void *opaque, size_t buckets[],
57 ++buckets[bucket_id];
62 print_buckets(const size_t buckets[], const size_t means[]
149 size_t buckets[N_BUCKET]; local
253 size_t buckets[N_GEO_BUCKET + 1]; local
[all...] |
| /src/external/bsd/libarchive/dist/libarchive/ |
| archive_entry_link_resolver.c | 79 struct links_entry **buckets; member in struct:archive_entry_linkresolver
112 res->buckets = calloc(res->number_buckets, sizeof(res->buckets[0]));
113 if (res->buckets == NULL) {
168 free(res->buckets);
301 for (le = res->buckets[bucket]; le != NULL; le = le->next) {
319 if (res->buckets[bucket] == le)
320 res->buckets[bucket] = le->next;
346 for (le = res->buckets[bucket]; le != NULL; le = le->next) {
359 res->buckets[bucket] = le->next
[all...] |
| /src/external/gpl2/groff/dist/src/include/ |
| DviChar.h | 29 DviCharNameHash *buckets[DVI_HASH_SIZE]; member in struct:_dviCharNameMap
|
| /src/external/gpl3/gcc/dist/libobjc/objc-private/ |
| sarray.h | 56 /* Buckets are 8 words each. */
70 /* Buckets are 32 words each. */
127 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];
|
| /src/external/gpl3/gcc.old/dist/libobjc/objc-private/ |
| sarray.h | 56 /* Buckets are 8 words each. */
70 /* Buckets are 32 words each. */
127 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];
|
| /src/sys/dev/wscons/ |
| wsdisplay_glyphcache.c | 118 int cache_lines, buckets, i, usedcells = 0, idx; local
144 /* now allocate buckets */
145 buckets = (gc->gc_numcells / 223);
146 if ((buckets * 223) < gc->gc_numcells)
147 buckets++;
153 if (buckets < 1)
156 buckets = uimin(buckets, gc->gc_nbuckets);
157 gc->gc_numbuckets = buckets;
159 DPRINTF("%s: using %d buckets\n", __func__, buckets)
[all...] |
| /src/external/gpl2/gettext/dist/gettext-tools/src/ |
| write-qt.c | 154 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[i].head; p != NULL; p = p->next
[all...] |
| /src/external/gpl3/gcc/dist/libobjc/ |
| sarray.c | 135 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...] |
| /src/external/gpl3/gcc.old/dist/libobjc/ |
| sarray.c | 135 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...] |
| /src/external/apache2/llvm/dist/clang/utils/hmaptool/ |
| hmaptool | 55 # 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...] |
| /src/external/mpl/dhcp/dist/omapip/ |
| hash.c | 116 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 [hashno] = bp -> next
[all...] |
| /src/external/bsd/top/dist/ |
| hash.m4h | 65 bucket_t *buckets;
|
| hash.c | 40 * 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[(key % ht->num_buckets)])
[all...] |
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/rt/ |
| aaA.d | 33 // 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[i]
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/dns/include/dns/ |
| dispatch.h | 253 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 (and prime)
[all...] |
| /src/external/bsd/elftoolchain/dist/common/ |
| uthash.h | 131 /* 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_bkt], hh, &(add)->hh, oomed);
1095 UT_hash_bucket *buckets; member in struct:UT_hash_table
[all...] |
| /src/external/mpl/bind/dist/lib/dns/ |
| qpcache.c | 216 * nodes in the database will evenly distributed among buckets
308 qpcache_bucket_t buckets[]; /* attribute((counted_by(buckets_count))) */ member in struct:qpcache
558 ISC_LIST_UNLINK(qpdb->buckets[HEADERNODE(header)->locknum].lru, header,
561 ISC_LIST_PREPEND(qpdb->buckets[HEADERNODE(header)->locknum].lru, header,
795 isc_rwlock_t *nlock = &qpdb->buckets[node->locknum].lock;
856 &qpdb->buckets[node->locknum].deadnodes, node,
1187 &search->qpdb->buckets[node->locknum].lock;
1324 nlock = &search->qpdb->buckets[node->locknum].lock;
1397 nlock = &qpdb->buckets[node->locknum].lock;
1553 nlock = &search->qpdb->buckets[node->locknum].lock
[all...] |
| /src/external/bsd/ipf/dist/tools/ |
| ipnat.c | 420 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[i] > maxlen
[all...] |
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/building_blocks/ |
| bucketizer.d | 36 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...] |
| /src/external/gpl2/diffutils/dist/src/ |
| io.c | 54 /* 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 <= nbuckets
[all...] |
