| /dports/archivers/py-borgbackup/borgbackup-1.1.17/src/borg/ |
| H A D | _hashindex.c | 21 int32_t num_buckets; member
29 int num_buckets; member
182 index->num_buckets = new->num_buckets; in hashindex_resize()
191 int get_lower_limit(int num_buckets){ in get_lower_limit() argument
193 if (num_buckets <= min_buckets) in get_lower_limit()
200 if (num_buckets >= max_buckets) in get_upper_limit()
201 return num_buckets; in get_upper_limit()
205 int get_min_empty(int num_buckets){ in get_min_empty() argument
345 index->num_buckets = _le32toh(header->num_buckets); in hashindex_read()
439 index->num_buckets = capacity; in hashindex_init()
[all …]
|
| /dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gdb/gdb/ |
| H A D | bcache.c | 70 unsigned int num_buckets; member
145 new_num_buckets = bcache->num_buckets * 2; in expand_hash_table()
147 if (sizes[i] > bcache->num_buckets) in expand_hash_table()
159 bcache->structure_size -= (bcache->num_buckets in expand_hash_table()
165 for (i = 0; i < bcache->num_buckets; i++) in expand_hash_table()
185 bcache->num_buckets = new_num_buckets; in expand_hash_table()
215 hash_index = full_hash % bcache->num_buckets; in bcache_data()
333 for (b = 0; b < c->num_buckets; b++) in print_bcache_statistics()
345 gdb_assert (b < c->num_buckets); in print_bcache_statistics()
360 if (c->num_buckets > 0) in print_bcache_statistics()
[all …]
|
| /dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gdb/gdb/ |
| H A D | bcache.c | 70 unsigned int num_buckets; member
145 new_num_buckets = bcache->num_buckets * 2; in expand_hash_table()
147 if (sizes[i] > bcache->num_buckets) in expand_hash_table()
159 bcache->structure_size -= (bcache->num_buckets in expand_hash_table()
165 for (i = 0; i < bcache->num_buckets; i++) in expand_hash_table()
185 bcache->num_buckets = new_num_buckets; in expand_hash_table()
215 hash_index = full_hash % bcache->num_buckets; in bcache_data()
333 for (b = 0; b < c->num_buckets; b++) in print_bcache_statistics()
345 gdb_assert (b < c->num_buckets); in print_bcache_statistics()
360 if (c->num_buckets > 0) in print_bcache_statistics()
[all …]
|
| /dports/editors/neovim/neovim-0.6.1/src/nvim/testdir/samples/ |
| H A D | memfile_test.c | 43 size_t num_buckets; in test_mf_hash() local
53 num_buckets = ht.mht_mask + 1; in test_mf_hash()
54 assert(num_buckets > 0 && (num_buckets & (num_buckets - 1)) == 0); in test_mf_hash()
57 assert(ht.mht_count <= (num_buckets << MHT_LOG_LOAD_FACTOR)); in test_mf_hash()
62 assert(num_buckets == MHT_INIT_SIZE); in test_mf_hash()
67 assert(num_buckets > MHT_INIT_SIZE); in test_mf_hash()
82 if (ht.mht_mask + 1 != num_buckets) in test_mf_hash()
85 assert(ht.mht_mask + 1 == num_buckets * MHT_GROWTH_FACTOR); in test_mf_hash()
86 assert(i + 1 == (num_buckets << MHT_LOG_LOAD_FACTOR)); in test_mf_hash()
|
| /dports/editors/vim/vim-8.2.3745/src/ |
| H A D | memfile_test.c | 38 long_u num_buckets; in test_mf_hash() local
48 num_buckets = ht.mht_mask + 1; in test_mf_hash()
49 assert(num_buckets > 0 && (num_buckets & (num_buckets - 1)) == 0); in test_mf_hash()
52 assert(ht.mht_count <= (num_buckets << MHT_LOG_LOAD_FACTOR)); in test_mf_hash()
57 assert(num_buckets == MHT_INIT_SIZE); in test_mf_hash()
62 assert(num_buckets > MHT_INIT_SIZE); in test_mf_hash()
77 if (ht.mht_mask + 1 != num_buckets) in test_mf_hash()
80 assert(ht.mht_mask + 1 == num_buckets * MHT_GROWTH_FACTOR); in test_mf_hash()
81 assert(i + 1 == (num_buckets << MHT_LOG_LOAD_FACTOR)); in test_mf_hash()
|
| /dports/sysutils/wuzzah/wuzzah-0.53/hashtable/ |
| H A D | hashtable.c | 3 htable_t* ht_init(int num_buckets, int(*hashcode)(void *obj), in ht_init() argument
7 ht->table=(ht_list_t**)malloc(sizeof(ht_list_t*)*num_buckets); in ht_init()
8 memset(ht->table, 0, sizeof(ht_list_t*)*num_buckets); in ht_init()
9 ht->num_buckets=num_buckets; in ht_init()
20 for(i=0;i<ht->num_buckets;i++){ in ht_reset()
30 ht->table=(ht_list_t**)malloc(sizeof(ht_list_t*)*ht->num_buckets); in ht_reset()
31 memset(ht->table, 0, sizeof(ht_list_t*)*ht->num_buckets); in ht_reset()
36 ht_list_t *chain=ht->table[(ht->hashcode(obj)%ht->num_buckets)]; in ht_find()
49 int hc=(ht->hashcode(obj)%ht->num_buckets); in ht_insert()
63 int hc=(ht->hashcode(obj)%ht->num_buckets); in ht_remove()
[all …]
|
| /dports/emulators/mess/mame-mame0226/3rdparty/bgfx/3rdparty/glsl-optimizer/src/mesa/program/ |
| H A D | prog_hash_table.c | 44 unsigned num_buckets; member
57 hash_table_ctor(unsigned num_buckets, hash_func_t hash, in hash_table_ctor() argument
64 if (num_buckets < 16) { in hash_table_ctor()
65 num_buckets = 16; in hash_table_ctor()
68 ht = malloc(sizeof(*ht) + ((num_buckets - 1) in hash_table_ctor()
73 ht->num_buckets = num_buckets; in hash_table_ctor()
75 for (i = 0; i < num_buckets; i++) { in hash_table_ctor()
102 for (i = 0; i < ht->num_buckets; i++) { in hash_table_clear()
117 const unsigned bucket = hash_value % ht->num_buckets; in get_node()
143 const unsigned bucket = hash_value % ht->num_buckets; in hash_table_insert()
[all …]
|
| /dports/emulators/mame/mame-mame0226/3rdparty/bgfx/3rdparty/glsl-optimizer/src/mesa/program/ |
| H A D | prog_hash_table.c | 44 unsigned num_buckets; member
57 hash_table_ctor(unsigned num_buckets, hash_func_t hash, in hash_table_ctor() argument
64 if (num_buckets < 16) { in hash_table_ctor()
65 num_buckets = 16; in hash_table_ctor()
68 ht = malloc(sizeof(*ht) + ((num_buckets - 1) in hash_table_ctor()
73 ht->num_buckets = num_buckets; in hash_table_ctor()
75 for (i = 0; i < num_buckets; i++) { in hash_table_ctor()
102 for (i = 0; i < ht->num_buckets; i++) { in hash_table_clear()
117 const unsigned bucket = hash_value % ht->num_buckets; in get_node()
143 const unsigned bucket = hash_value % ht->num_buckets; in hash_table_insert()
[all …]
|
| /dports/devel/avr-gdb/gdb-7.3.1/gdb/ |
| H A D | bcache.c | 69 unsigned int num_buckets; member
156 new_num_buckets = bcache->num_buckets * 2; in expand_hash_table()
158 if (sizes[i] > bcache->num_buckets) in expand_hash_table()
177 for (i = 0; i < bcache->num_buckets; i++) in expand_hash_table()
198 bcache->num_buckets = new_num_buckets; in expand_hash_table()
254 hash_index = full_hash % bcache->num_buckets; in bcache_full()
382 for (b = 0; b < c->num_buckets; b++) in print_bcache_statistics()
394 gdb_assert (b < c->num_buckets); in print_bcache_statistics()
410 if (c->num_buckets > 0) in print_bcache_statistics()
468 c->num_buckets); in print_bcache_statistics()
[all …]
|
| /dports/devel/gdb761/gdb-7.6.1/gdb/ |
| H A D | bcache.c | 68 unsigned int num_buckets; member
155 new_num_buckets = bcache->num_buckets * 2; in expand_hash_table()
157 if (sizes[i] > bcache->num_buckets) in expand_hash_table()
176 for (i = 0; i < bcache->num_buckets; i++) in expand_hash_table()
197 bcache->num_buckets = new_num_buckets; in expand_hash_table()
253 hash_index = full_hash % bcache->num_buckets; in bcache_full()
381 for (b = 0; b < c->num_buckets; b++) in print_bcache_statistics()
393 gdb_assert (b < c->num_buckets); in print_bcache_statistics()
409 if (c->num_buckets > 0) in print_bcache_statistics()
467 c->num_buckets); in print_bcache_statistics()
[all …]
|
| /dports/devel/grpc/grpc-1.42.0/test/core/util/ |
| H A D | histogram.cc | 54 size_t num_buckets; member
68 GPR_ASSERT(bucket < h->num_buckets); in bucket_for()
91 h->num_buckets = bucket_for_unchecked(h, max_bucket_start) + 1; in grpc_histogram_create()
92 GPR_ASSERT(h->num_buckets > 1); in grpc_histogram_create()
93 GPR_ASSERT(h->num_buckets < 100000000); in grpc_histogram_create()
118 if ((dst->num_buckets != src->num_buckets) || in grpc_histogram_merge()
123 grpc_histogram_merge_contents(dst, src->buckets, src->num_buckets, in grpc_histogram_merge()
134 GPR_ASSERT(histogram->num_buckets == data_count); in grpc_histogram_merge_contents()
144 for (i = 0; i < histogram->num_buckets; i++) { in grpc_histogram_merge_contents()
169 for (lower_idx = 0; lower_idx < h->num_buckets; lower_idx++) { in threshold_for_count_below()
[all …]
|
| /dports/devel/grpc130/grpc-1.30.2/test/core/util/ |
| H A D | histogram.cc | 53 size_t num_buckets; member
66 GPR_ASSERT(bucket < h->num_buckets); in bucket_for()
89 h->num_buckets = bucket_for_unchecked(h, max_bucket_start) + 1; in grpc_histogram_create()
90 GPR_ASSERT(h->num_buckets > 1); in grpc_histogram_create()
91 GPR_ASSERT(h->num_buckets < 100000000); in grpc_histogram_create()
116 if ((dst->num_buckets != src->num_buckets) || in grpc_histogram_merge()
121 grpc_histogram_merge_contents(dst, src->buckets, src->num_buckets, in grpc_histogram_merge()
132 GPR_ASSERT(dst->num_buckets == data_count); in grpc_histogram_merge_contents()
142 for (i = 0; i < dst->num_buckets; i++) { in grpc_histogram_merge_contents()
167 for (lower_idx = 0; lower_idx < h->num_buckets; lower_idx++) { in threshold_for_count_below()
[all …]
|
| /dports/devel/grpc134/grpc-1.34.1/test/core/util/ |
| H A D | histogram.cc | 53 size_t num_buckets; member
66 GPR_ASSERT(bucket < h->num_buckets); in bucket_for()
89 h->num_buckets = bucket_for_unchecked(h, max_bucket_start) + 1; in grpc_histogram_create()
90 GPR_ASSERT(h->num_buckets > 1); in grpc_histogram_create()
91 GPR_ASSERT(h->num_buckets < 100000000); in grpc_histogram_create()
116 if ((dst->num_buckets != src->num_buckets) || in grpc_histogram_merge()
121 grpc_histogram_merge_contents(dst, src->buckets, src->num_buckets, in grpc_histogram_merge()
132 GPR_ASSERT(dst->num_buckets == data_count); in grpc_histogram_merge_contents()
142 for (i = 0; i < dst->num_buckets; i++) { in grpc_histogram_merge_contents()
167 for (lower_idx = 0; lower_idx < h->num_buckets; lower_idx++) { in threshold_for_count_below()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/grpc/src/test/core/util/ |
| H A D | histogram.cc | 53 size_t num_buckets; member
66 GPR_ASSERT(bucket < h->num_buckets); in bucket_for()
89 h->num_buckets = bucket_for_unchecked(h, max_bucket_start) + 1; in grpc_histogram_create()
90 GPR_ASSERT(h->num_buckets > 1); in grpc_histogram_create()
91 GPR_ASSERT(h->num_buckets < 100000000); in grpc_histogram_create()
116 if ((dst->num_buckets != src->num_buckets) || in grpc_histogram_merge()
121 grpc_histogram_merge_contents(dst, src->buckets, src->num_buckets, in grpc_histogram_merge()
132 GPR_ASSERT(dst->num_buckets == data_count); in grpc_histogram_merge_contents()
142 for (i = 0; i < dst->num_buckets; i++) { in grpc_histogram_merge_contents()
167 for (lower_idx = 0; lower_idx < h->num_buckets; lower_idx++) { in threshold_for_count_below()
[all …]
|
| /dports/misc/py-mxnet/incubator-mxnet-1.9.0/tests/nightly/ |
| H A D | test_np_random.py | 49 num_buckets = 5
53 probs = [(buckets[i][1] - buckets[i][0])/scale for i in range(num_buckets)]
67 num_buckets = 5
73 probs = [(buckets[i][1] - buckets[i][0])/scale for i in range(num_buckets)]
85 num_buckets = 20
90 ss.logistic.cdf(buckets[i][0], loc, scale)) for i in range(num_buckets)]
102 num_buckets = 5
106 probs = [(buckets[i][1] - buckets[i][0])/scale for i in range(num_buckets)]
120 num_buckets = 5
140 num_buckets = 5
[all …]
|
| /dports/misc/mxnet/incubator-mxnet-1.9.0/tests/nightly/ |
| H A D | test_np_random.py | 49 num_buckets = 5
53 probs = [(buckets[i][1] - buckets[i][0])/scale for i in range(num_buckets)]
67 num_buckets = 5
73 probs = [(buckets[i][1] - buckets[i][0])/scale for i in range(num_buckets)]
85 num_buckets = 20
90 ss.logistic.cdf(buckets[i][0], loc, scale)) for i in range(num_buckets)]
102 num_buckets = 5
106 probs = [(buckets[i][1] - buckets[i][0])/scale for i in range(num_buckets)]
120 num_buckets = 5
140 num_buckets = 5
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/boringssl/src/crypto/lhash/ |
| H A D | lhash.c | 85 size_t num_buckets; member
102 ret->num_buckets = kMinNumBuckets; in lh_new()
120 for (size_t i = 0; i < lh->num_buckets; i++) { in lh_free()
210 for (i = 0; i < lh->num_buckets; i++) { in lh_rebucket()
221 lh->num_buckets = new_num_buckets; in lh_rebucket()
234 assert(lh->num_buckets >= kMinNumBuckets); in lh_maybe_resize()
235 avg_chain_length = lh->num_items / lh->num_buckets; in lh_maybe_resize()
240 if (new_num_buckets > lh->num_buckets) { in lh_maybe_resize()
244 lh->num_buckets > kMinNumBuckets) { in lh_maybe_resize()
245 size_t new_num_buckets = lh->num_buckets / 2; in lh_maybe_resize()
[all …]
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/boringssl/src/crypto/lhash/ |
| H A D | lhash.c | 85 size_t num_buckets; member
102 ret->num_buckets = kMinNumBuckets; in lh_new()
120 for (size_t i = 0; i < lh->num_buckets; i++) { in lh_free()
210 for (i = 0; i < lh->num_buckets; i++) { in lh_rebucket()
221 lh->num_buckets = new_num_buckets; in lh_rebucket()
234 assert(lh->num_buckets >= kMinNumBuckets); in lh_maybe_resize()
235 avg_chain_length = lh->num_items / lh->num_buckets; in lh_maybe_resize()
240 if (new_num_buckets > lh->num_buckets) { in lh_maybe_resize()
244 lh->num_buckets > kMinNumBuckets) { in lh_maybe_resize()
245 size_t new_num_buckets = lh->num_buckets / 2; in lh_maybe_resize()
[all …]
|
| /dports/net/quiche/quiche-0.9.0/deps/boringssl/src/crypto/lhash/ |
| H A D | lhash.c | 85 size_t num_buckets; member
102 ret->num_buckets = kMinNumBuckets; in lh_new()
120 for (size_t i = 0; i < lh->num_buckets; i++) { in lh_free()
210 for (i = 0; i < lh->num_buckets; i++) { in lh_rebucket()
221 lh->num_buckets = new_num_buckets; in lh_rebucket()
234 assert(lh->num_buckets >= kMinNumBuckets); in lh_maybe_resize()
235 avg_chain_length = lh->num_items / lh->num_buckets; in lh_maybe_resize()
240 if (new_num_buckets > lh->num_buckets) { in lh_maybe_resize()
244 lh->num_buckets > kMinNumBuckets) { in lh_maybe_resize()
245 size_t new_num_buckets = lh->num_buckets / 2; in lh_maybe_resize()
[all …]
|
| /dports/net/quiche/quiche-0.9.0/cargo-crates/boring-sys-1.1.1/deps/boringssl/src/crypto/lhash/ |
| H A D | lhash.c | 85 size_t num_buckets; member
102 ret->num_buckets = kMinNumBuckets; in lh_new()
120 for (size_t i = 0; i < lh->num_buckets; i++) { in lh_free()
210 for (i = 0; i < lh->num_buckets; i++) { in lh_rebucket()
221 lh->num_buckets = new_num_buckets; in lh_rebucket()
234 assert(lh->num_buckets >= kMinNumBuckets); in lh_maybe_resize()
235 avg_chain_length = lh->num_items / lh->num_buckets; in lh_maybe_resize()
240 if (new_num_buckets > lh->num_buckets) { in lh_maybe_resize()
244 lh->num_buckets > kMinNumBuckets) { in lh_maybe_resize()
245 size_t new_num_buckets = lh->num_buckets / 2; in lh_maybe_resize()
[all …]
|
| /dports/security/boringssl/boringssl-6a71840/crypto/lhash/ |
| H A D | lhash.c | 85 size_t num_buckets; member
102 ret->num_buckets = kMinNumBuckets; in lh_new()
120 for (size_t i = 0; i < lh->num_buckets; i++) { in lh_free()
210 for (i = 0; i < lh->num_buckets; i++) { in lh_rebucket()
221 lh->num_buckets = new_num_buckets; in lh_rebucket()
234 assert(lh->num_buckets >= kMinNumBuckets); in lh_maybe_resize()
235 avg_chain_length = lh->num_items / lh->num_buckets; in lh_maybe_resize()
240 if (new_num_buckets > lh->num_buckets) { in lh_maybe_resize()
244 lh->num_buckets > kMinNumBuckets) { in lh_maybe_resize()
245 size_t new_num_buckets = lh->num_buckets / 2; in lh_maybe_resize()
[all …]
|
| /dports/devel/pecl-grpc/grpc-1.42.0/third_party/boringssl-with-bazel/src/crypto/lhash/ |
| H A D | lhash.c | 96 size_t num_buckets; in __virtual__()
113 ret->num_buckets = kMinNumBuckets;
131 for (size_t i = 0; i < lh->num_buckets; i++) {
223 for (i = 0; i < lh->num_buckets; i++) {
234 lh->num_buckets = new_num_buckets;
247 assert(lh->num_buckets >= kMinNumBuckets);
248 avg_chain_length = lh->num_items / lh->num_buckets;
253 if (new_num_buckets > lh->num_buckets) {
257 lh->num_buckets > kMinNumBuckets) {
258 size_t new_num_buckets = lh->num_buckets / 2;
[all …]
|
| /dports/devel/py-grpcio/grpcio-1.43.0/third_party/boringssl-with-bazel/src/crypto/lhash/ |
| H A D | lhash.c | 96 size_t num_buckets; member
113 ret->num_buckets = kMinNumBuckets; in OPENSSL_lh_new()
131 for (size_t i = 0; i < lh->num_buckets; i++) { in OPENSSL_lh_free()
223 for (i = 0; i < lh->num_buckets; i++) { in lh_rebucket()
234 lh->num_buckets = new_num_buckets; in lh_rebucket()
247 assert(lh->num_buckets >= kMinNumBuckets); in lh_maybe_resize()
248 avg_chain_length = lh->num_items / lh->num_buckets; in lh_maybe_resize()
253 if (new_num_buckets > lh->num_buckets) { in lh_maybe_resize()
257 lh->num_buckets > kMinNumBuckets) { in lh_maybe_resize()
258 size_t new_num_buckets = lh->num_buckets / 2; in lh_maybe_resize()
[all …]
|
| /dports/misc/py-gluonnlp/gluon-nlp-0.10.0/src/gluonnlp/data/ |
| H A D | sampler.py | 74 def __call__(self, max_lengths, min_lengths, num_buckets): argument
96 def __call__(self, max_lengths, min_lengths, num_buckets): argument
120 for i in range(num_buckets)]
124 for i in range(num_buckets)]
151 / (num_buckets * (num_buckets + 1))
157 for i in range(num_buckets)]
163 / (num_buckets * (num_buckets + 1))
165 for i in range(num_buckets)]
210 for i in range(num_buckets)]
220 for i in range(num_buckets)]
[all …]
|
| /dports/security/p11-kit/p11-kit-0.24.0/common/ |
| H A D | dict.c | 55 unsigned int num_buckets; member
70 if (iter->index >= iter->dict->num_buckets) in next_entry()
115 for (bucketp = &dict->buckets[hash % dict->num_buckets]; in lookup_or_create_bucket()
158 unsigned int num_buckets; in p11_dict_set() local
176 if (dict->num_items > dict->num_buckets) { in p11_dict_set()
177 num_buckets = dict->num_buckets * 2 + 1; in p11_dict_set()
184 unsigned int i = bucket->hashed % num_buckets; in p11_dict_set()
191 dict->num_buckets = num_buckets; in p11_dict_set()
250 for (i = 0; i < dict->num_buckets; ++i) { in p11_dict_clear()
263 memset (dict->buckets, 0, dict->num_buckets * sizeof (dictbucket *)); in p11_dict_clear()
[all …]
|