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

12

/freebsd-current/contrib/unbound/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
/freebsd-current/contrib/bmake/
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[
313 HashEntry **buckets = t->buckets; local
[all...]
H A Dhash.h91 HashEntry **buckets; member in struct:HashTable
/freebsd-current/sys/netpfil/ipfw/
H A Ddn_heap.c323 int buckets; /* how many buckets, really buckets - 1*/ member in struct:dn_ht
338 dn_ht_init(struct dn_ht *ht, int buckets, int ofs, argument
359 * The ht->buckets variable store the bucket size - 1 to simply
363 int b_min; /* min buckets */
364 int b_max; /* max buckets */
365 int b_ori; /* original buckets */
371 if (buckets < 1 || buckets > 6553
[all...]
H A Ddn_heap.h116 * buckets, the offset of the link field, the main callbacks.
167 struct dn_ht *dn_ht_init(struct dn_ht *, int buckets, int ofs,
H A Dip_dn_glue.c421 fs->buckets = f->rq_size;
467 sch->buckets = fs->buckets; /*XXX*/
468 fs->buckets = 0;
647 fs->rq_size = s->sch.buckets ? s->sch.buckets : 1;
717 fs->rq_size = (f->fs.buckets ? f->fs.buckets : 1);
/freebsd-current/sbin/dhclient/
H A Dhash.c57 memset(&rv->buckets[0], 0,
98 bp->next = table->buckets[hashno];
100 table->buckets[hashno] = bp;
117 for (bp = table->buckets[hashno]; bp; bp = bp->next)
/freebsd-current/contrib/libarchive/libarchive/
H A Darchive_entry_link_resolver.c79 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);
282 for (le = res->buckets[bucket]; le != NULL; le = le->next) {
300 if (res->buckets[bucket] == le)
301 res->buckets[bucket] = le->next;
327 for (le = res->buckets[bucket]; le != NULL; le = le->next) {
340 res->buckets[bucke
[all...]
/freebsd-current/usr.bin/du/
H A Ddu.c373 static struct links_entry **buckets; local
386 if (buckets == NULL) {
388 buckets = malloc(number_buckets * sizeof(buckets[0]));
389 if (buckets == NULL)
392 buckets[i] = NULL;
415 while (buckets[i] != NULL) {
417 le = buckets[i];
418 buckets[i] = le->next;
431 free(buckets);
[all...]
/freebsd-current/sys/netinet/
H A Dip_dummynet.h140 * flow masks, buckets for the flow hash, and possibly scheduler-
149 uint32_t buckets; /* buckets used for the queue hash table */ member in struct:dn_fs
192 * sched_mask and buckets.
197 uint32_t buckets; /* number of buckets for the instances */ member in struct:dn_sch
H A Dtcp_fastopen.h77 unsigned int buckets; member in struct:tcp_fastopen_ccache
H A Dtcp_fastopen.c82 * The number of client cookie cache buckets.
283 "Client cookie cache number of buckets (power of 2)");
373 static MALLOC_DEFINE(M_TCP_FASTOPEN_CCACHE, "tfo_ccache", "TFO client cookie cache buckets");
405 V_tcp_fastopen_ccache.buckets =
408 V_tcp_fastopen_ccache.buckets = V_tcp_fastopen_ccache_buckets;
410 V_tcp_fastopen_ccache.mask = V_tcp_fastopen_ccache.buckets - 1;
413 V_tcp_fastopen_ccache.base = malloc(V_tcp_fastopen_ccache.buckets *
417 for (i = 0; i < V_tcp_fastopen_ccache.buckets; i++) {
434 * V_tcp_fastopen_ccache.buckets *
451 for (i = 0; i < V_tcp_fastopen_ccache.buckets;
[all...]
/freebsd-current/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/java_api/src/
H A DTestBean.java206 List < Distribution.Bucket > buckets =
221 buckets.add(bucket);
223 buckets.add(bucket);
225 buckets.add(bucket);
239 buckets.add(bucket);
241 LogDistribution d = new LogDistribution(buckets);
248 List < Distribution.Bucket > buckets =
251 int n = 10; // number of buckets
255 buckets.add(bucket);
259 buckets
[all...]
/freebsd-current/contrib/elftoolchain/common/
H A Duthash.h88 /* initial number of buckets */
89 #define HASH_INITIAL_NUM_BUCKETS 32 /* initial number of buckets */
90 #define HASH_INITIAL_NUM_BUCKETS_LOG2 5 /* lg2 of initial number of buckets */
103 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \
152 (head)->hh.tbl->buckets = (UT_hash_bucket*)uthash_malloc( \
154 if (! (head)->hh.tbl->buckets) { uthash_fatal( "out of memory"); } \
155 memset((head)->hh.tbl->buckets, 0, \
183 HASH_ADD_TO_BKT((head)->hh.tbl->buckets[_ha_bkt],&(add)->hh); \
211 uthash_free((head)->hh.tbl->buckets, \
235 HASH_DEL_IN_BKT(hh,(head)->hh.tbl->buckets[_hd_bk
876 UT_hash_bucket *buckets; member in struct:UT_hash_table
[all...]
/freebsd-current/contrib/libucl/uthash/
H A Duthash.h87 /* initial number of buckets */
88 #define HASH_INITIAL_NUM_BUCKETS 32 /* initial number of buckets */
89 #define HASH_INITIAL_NUM_BUCKETS_LOG2 5 /* lg2 of initial number of buckets */
102 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \
152 (head)->hh.tbl->buckets = (UT_hash_bucket*)uthash_malloc( \
154 if (! (head)->hh.tbl->buckets) { uthash_fatal( "out of memory"); } \
155 memset((head)->hh.tbl->buckets, 0, \
193 HASH_ADD_TO_BKT((head)->hh.tbl->buckets[_ha_bkt],&(add)->hh); \
221 uthash_free((head)->hh.tbl->buckets, \
245 HASH_DEL_IN_BKT(hh,(head)->hh.tbl->buckets[_hd_bk
677 UT_hash_bucket *buckets; member in struct:UT_hash_table
[all...]
/freebsd-current/sbin/ipf/ipnat/
H A Dipnat.c395 u_int *buckets; local
398 sz = sizeof(*buckets) * nsp->ns_nattab_sz;
399 buckets = (u_int *)malloc(sz);
400 if (buckets == NULL) {
402 "cannot allocate memory (%d) for buckets\n", sz);
416 table.ita_table = buckets;
421 free(buckets);
425 if (kmemcpy((char *)buckets, (u_long)nsp->ns_nattab_sz, sz)) {
426 free(buckets);
437 if (buckets[
[all...]
/freebsd-current/contrib/diff/src/
H A Dio.c52 /* Hash-table: array of buckets, each being a chain of equivalence classes.
53 buckets[-1] is reserved for incomplete lines. */ variable
54 static lin *buckets;
56 /* Number of buckets in the hash table array, not counting buckets[-1]. */
394 bucket = &buckets[h % nbuckets];
402 put the line into buckets[-1]. */
404 bucket = &buckets[-1];
846 /* Allocate (one plus) a prime number of hash buckets. Use a prime
852 if (PTRDIFF_MAX / sizeof *buckets <
[all...]
/freebsd-current/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_taskdeps.h59 if (h->buckets[i]) {
61 for (kmp_dephash_entry_t *entry = h->buckets[i]; entry; entry = next) {
76 h->buckets[i] = 0;
H A Dkmp_taskdeps.cpp89 h->buckets = (kmp_dephash_entry **)(h + 1);
94 // make sure buckets are properly initialized
96 h->buckets[i] = NULL;
102 for (entry = current_dephash->buckets[i]; entry; entry = next) {
107 entry->next_in_bucket = h->buckets[new_bucket];
111 h->buckets[new_bucket] = entry;
148 h->buckets = (kmp_dephash_entry **)(h + 1);
152 h->buckets[i] = 0;
168 for (entry = h->buckets[bucket]; entry; entry = entry->next_in_bucket)
190 entry->next_in_bucket = h->buckets[bucke
[all...]
/freebsd-current/sbin/ipf/ipfstat/
H A Dipfstat.c1114 u_int *buckets; local
1122 sz = sizeof(*buckets) * ipsp->iss_state_size;
1123 buckets = (u_int *)malloc(sz);
1131 table.ita_table = buckets;
1135 free(buckets);
1139 if (kmemcpy((char *)buckets,
1141 free(buckets);
1165 PRINTF("%u\thash buckets in use\n", ipsp->iss_inuse);
1226 if (buckets[i] > maxlen)
1227 maxlen = buckets[
[all...]
/freebsd-current/contrib/bearssl/test/
H A Dtest_x509.c201 ht_elt **buckets; member in struct:__anon82
214 ht->buckets = xmalloc(ht->num_buckets * sizeof(ht_elt *));
216 ht->buckets[u] = NULL;
280 for (e = ht->buckets[u]; e != NULL; e = f) {
291 xfree(ht->buckets);
292 ht->buckets = new_buckets;
305 prev = &ht->buckets[k];
329 e->next = ht->buckets[k];
330 ht->buckets[k] = e;
356 for (e = ht->buckets[
[all...]
/freebsd-current/usr.bin/systat/
H A Diolat.c123 split_u64(char *str, const char *delim, uint64_t *buckets, int *nbuckets) argument
128 memset(buckets, 0, n * sizeof(buckets[0]));
130 buckets[i] = strtoull(v, NULL, 10);
160 /* Should expoentially interpolate between buckets -- doing linear instead */
/freebsd-current/sbin/ipfw/
H A Ddummynet.c56 { "buckets", TOK_BUCKETS },
517 printf("%s %s%s %d queues (%d buckets) %s\n",
518 prefix, qs, plr, fs->oid.id, fs->buckets, red);
521 printf("q%05d %s%s %d flows (%d buckets) sched %d "
523 fs->fs_nr, qs, plr, fs->oid.id, fs->buckets,
602 printf(" sched %d type %s flags 0x%x %d buckets %d active\n",
604 s->name, s->flags, s->buckets, s->oid.id);
1295 uint32_t _foo = 0, *flags = &_foo , *buckets = &_foo; local
1355 buckets = &sch->buckets;
[all...]
/freebsd-current/contrib/unbound/smallapp/
H A Dunbound-control.c298 (int)hist->buckets[i].lower.tv_sec,
299 (int)hist->buckets[i].lower.tv_usec,
300 (int)hist->buckets[i].upper.tv_sec,
301 (int)hist->buckets[i].upper.tv_usec,
302 (unsigned long)hist->buckets[i].count);

Completed in 190 milliseconds

12