| /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
|
| timehist.h | 45 /** Number of buckets in a histogram */
64 /** number of buckets */
67 struct th_buck* buckets; member in struct:timehist
|
| 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
|
| DviChar.h | 29 DviCharNameHash *buckets[DVI_HASH_SIZE]; member in struct:_dviCharNameMap
|
| 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...] |
| 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...] |
| 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.h | 91 HashEntry **buckets; member in struct:HashTable
|
| 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
|
| hash.h | 65 bucket_t *buckets; member in struct:hash_table
|
| 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...] |
| 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...] |
| 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
|
| hash.h | 69 struct hash_bucket *buckets [1]; member in struct:hash_table
|
| 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
|
