| /src/external/bsd/unbound/dist/util/ |
| 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/include/ |
| DviChar.h | 29 DviCharNameHash *buckets[DVI_HASH_SIZE]; member in struct:_dviCharNameMap
|
| /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/usr.bin/make/ |
| hash.h | 91 HashEntry **buckets; member in struct:HashTable
|
| 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/top/dist/ |
| hash.h | 65 bucket_t *buckets; member in struct:hash_table
|
| /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/external/mpl/dhcp/dist/includes/omapip/ |
| hash.h | 69 struct hash_bucket *buckets [1]; member in struct:hash_table
|
| /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/external/mpl/bind/dist/tests/isc/ |
| histo_test.c | 118 /* no gap between buckets */
176 const uint buckets = key; local
180 assert_float_equal(pop, buckets * 2, 0.5);
188 for (key = 0; key < buckets; key++) {
190 if (key == 0 || key % quantum == buckets % quantum) {
317 * here, the test fails when buckets have different
|
| /src/lib/librumpuser/ |
| rumpuser_dl.c | 235 Elf32_Word *gnuhash, *buckets, *ptr; local
249 maskwords *= 2; /* sizeof(*buckets) == 4 */
250 buckets = gnuhash + 4 + maskwords;
252 if (buckets[bi] != 0) {
253 maxchain = buckets[bi];
265 ptr = buckets + nbuck + (maxchain - symndx);
|
| /src/sys/external/bsd/drm2/dist/drm/radeon/ |
| radeon_cs.c | 80 /* Connect the sorted buckets in the output list. */
89 struct radeon_cs_buckets buckets; local
107 radeon_cs_buckets_init(&buckets);
194 radeon_cs_buckets_add(&buckets, &p->relocs[i].tv.head,
198 radeon_cs_buckets_get_list(&buckets, &p->validated);
|
| /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/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[]
147 size_t buckets[N_BUCKET]; local
250 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/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...] |
| /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/gpl2/xcvs/dist/diff/ |
| io.c | 49 /* 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++, (nbuckets + 1) * sizeof (*buckets))
[all...] |
| /src/external/mpl/bind/dist/lib/isc/ |
| histo.c | 48 * number of buckets when we need to do accurate bounds checks.
60 #define BUCKETS(hg) (EXPONENTS(hg) * MANTISSAS(hg))
150 * The way we map buckets to keys is what gives the histogram a
165 * mantissa, which indexes buckets within each chunk.
172 * == 1 << sigbits`. Each chunk has CHUNKSIZE buckets, so chunk 1 has
210 * The largest key passed by `key_to_maxval()` is `BUCKETS(hg)`, so
325 if (key < BUCKETS(hg)) {
341 uint buckets = BUCKETS(hg); local
345 while (key < buckets && key % chunksize == 0 &
[all...] |
| tls.c | 1514 isc_ht_t *buckets; member in struct:isc_tlsctx_client_session_cache
1547 isc_ht_init(&nc->buckets, mctx, 5, ISC_HT_CASE_SENSITIVE);
1582 RUNTIME_CHECK(isc_ht_delete(cache->buckets,
1620 RUNTIME_CHECK(isc_ht_count(cache->buckets) == 0);
1621 isc_ht_destroy(&cache->buckets);
1682 result = isc_ht_find(cache->buckets, (const uint8_t *)remote_peer_name,
1695 RUNTIME_CHECK(isc_ht_add(cache->buckets,
1744 result = isc_ht_find(cache->buckets, (const uint8_t *)remote_peer_name,
|
| /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/gpl3/gdb/dist/gdb/ |
| dictionary.c | 136 struct symbol **buckets; member in struct:dictionary_hashed
141 /* How many buckets we currently have. */
143 struct symbol **buckets; member in struct:dictionary_hashed_expandable
145 when to add more buckets. */
188 #define DICT_HASHED_BUCKETS(d) (d)->data.hashed.buckets
206 /* This calculates the number of buckets we'll use in a hashtable,
363 struct symbol **buckets = XOBNEWVEC (obstack, struct symbol *, nbuckets); local
364 memset (buckets, 0, nbuckets * sizeof (struct symbol *));
365 DICT_HASHED_BUCKETS (retval) = buckets;
367 /* Now fill the buckets. *
637 struct symbol **buckets = DICT_HASHED_BUCKETS (dict); local
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/ |
| dictionary.c | 136 struct symbol **buckets; member in struct:dictionary_hashed
141 /* How many buckets we currently have. */
143 struct symbol **buckets; member in struct:dictionary_hashed_expandable
145 when to add more buckets. */
188 #define DICT_HASHED_BUCKETS(d) (d)->data.hashed.buckets
206 /* This calculates the number of buckets we'll use in a hashtable,
363 struct symbol **buckets = XOBNEWVEC (obstack, struct symbol *, nbuckets); local
364 memset (buckets, 0, nbuckets * sizeof (struct symbol *));
365 DICT_HASHED_BUCKETS (retval) = buckets;
367 /* Now fill the buckets. *
637 struct symbol **buckets = DICT_HASHED_BUCKETS (dict); local
[all...] |
| /src/libexec/ld.elf_so/ |
| rtld.h | 189 const Elf_Symindx *buckets; /* Hash table buckets array */ member in struct:Struct_Obj_Entry
250 uint32_t nbuckets; /* Number of buckets */
256 const uint32_t *buckets_gnu; /* Hash table buckets array */
257 uint32_t nbuckets_gnu; /* Number of GNU hash buckets */
|
