/dports/math/vtk6/VTK-6.2.0/ThirdParty/hdf5/vtkhdf5/src/ |
H A D | H5Dcontig.c | 659 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 660 sieve_end = sieve_start + sieve_size; in H5D__contig_readvv_sieve_cb() 706 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 707 sieve_end = sieve_start+sieve_size; in H5D__contig_readvv_sieve_cb() 771 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 930 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() 931 sieve_end = sieve_start + sieve_size; in H5D__contig_writevv_sieve_cb() 953 if(dset_contig->sieve_size > len) in H5D__contig_writevv_sieve_cb() 985 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() 1058 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() [all …]
|
/dports/science/hdf5/hdf5-1.10.6/src/ |
H A D | H5Dcontig.c | 738 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 739 sieve_end = sieve_start + sieve_size; in H5D__contig_readvv_sieve_cb() 786 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 787 sieve_end = sieve_start+sieve_size; in H5D__contig_readvv_sieve_cb() 855 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 1013 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() 1014 sieve_end = sieve_start + sieve_size; in H5D__contig_writevv_sieve_cb() 1036 if(dset_contig->sieve_size > len) in H5D__contig_writevv_sieve_cb() 1068 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() 1141 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() [all …]
|
/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/HDF5/src/itkhdf5/src/ |
H A D | H5Dcontig.c | 713 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 714 sieve_end = sieve_start + sieve_size; in H5D__contig_readvv_sieve_cb() 761 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 762 sieve_end = sieve_start+sieve_size; in H5D__contig_readvv_sieve_cb() 830 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 988 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() 989 sieve_end = sieve_start + sieve_size; in H5D__contig_writevv_sieve_cb() 1011 if(dset_contig->sieve_size > len) in H5D__contig_writevv_sieve_cb() 1043 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() 1116 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() [all …]
|
/dports/science/hdf5-18/hdf5-1.8.21/src/ |
H A D | H5Dcontig.c | 658 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 659 sieve_end = sieve_start + sieve_size; in H5D__contig_readvv_sieve_cb() 706 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 707 sieve_end = sieve_start+sieve_size; in H5D__contig_readvv_sieve_cb() 775 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 935 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() 936 sieve_end = sieve_start + sieve_size; in H5D__contig_writevv_sieve_cb() 958 if(dset_contig->sieve_size > len) in H5D__contig_writevv_sieve_cb() 991 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() 1064 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() [all …]
|
/dports/math/vtk8/VTK-8.2.0/ThirdParty/hdf5/vtkhdf5/src/ |
H A D | H5Dcontig.c | 722 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 723 sieve_end = sieve_start + sieve_size; in H5D__contig_readvv_sieve_cb() 770 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 771 sieve_end = sieve_start+sieve_size; in H5D__contig_readvv_sieve_cb() 839 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 999 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() 1000 sieve_end = sieve_start + sieve_size; in H5D__contig_writevv_sieve_cb() 1022 if(dset_contig->sieve_size > len) in H5D__contig_writevv_sieve_cb() 1054 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() 1127 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() [all …]
|
/dports/math/vtk9/VTK-9.1.0/ThirdParty/hdf5/vtkhdf5/src/ |
H A D | H5Dcontig.c | 707 sieve_size = dset_contig->sieve_size; in H5D__contig_readvv_sieve_cb() 708 sieve_end = sieve_start + sieve_size; in H5D__contig_readvv_sieve_cb() 974 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() 975 sieve_end = sieve_start + sieve_size; in H5D__contig_writevv_sieve_cb() 997 if (dset_contig->sieve_size > len) in H5D__contig_writevv_sieve_cb() 1015 if (dset_contig->sieve_size > len) { in H5D__contig_writevv_sieve_cb() 1030 sieve_size = dset_contig->sieve_size; in H5D__contig_writevv_sieve_cb() 1031 sieve_end = sieve_start + sieve_size; in H5D__contig_writevv_sieve_cb() 1068 dset_contig->sieve_size = 0; in H5D__contig_writevv_sieve_cb() 1100 dset_contig->sieve_size += len; in H5D__contig_writevv_sieve_cb() [all …]
|
/dports/math/primesieve/primesieve-7.7/src/ |
H A D | api.cpp | 27 int sieve_size = 0; variable 144 sieve_size = inBetween(16, size, 4096); in set_sieve_size() 145 sieve_size = floorPow2(sieve_size); in set_sieve_size() 151 if (sieve_size) in get_sieve_size() 152 return sieve_size; in get_sieve_size()
|
/dports/math/primecount/primecount-7.2/lib/primesieve/src/ |
H A D | api.cpp | 27 int sieve_size = 0; variable 144 sieve_size = inBetween(16, size, 4096); in set_sieve_size() 145 sieve_size = floorPow2(sieve_size); in set_sieve_size() 151 if (sieve_size) in get_sieve_size() 152 return sieve_size; in get_sieve_size()
|
H A D | api-c.cpp | 318 void primesieve_set_sieve_size(int sieve_size) in primesieve_set_sieve_size() argument 320 set_sieve_size(sieve_size); in primesieve_set_sieve_size()
|
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/qsieve/ |
H A D | collect_relations.c | 30 unsigned char * end = sieve + qs_inf->sieve_size; in qsieve_do_sieving() 39 memset(sieve, qs_inf->sieve_fill, qs_inf->sieve_size + sizeof(ulong)); in qsieve_do_sieving() 101 memset(sieve, qs_inf->sieve_fill, qs_inf->sieve_size + sizeof(ulong)); in qsieve_do_sieving2() 102 sieve[qs_inf->sieve_size] = (char) 255; in qsieve_do_sieving2() 115 for (b = 1; b <= qs_inf->sieve_size / BLOCK_SIZE; b++) in qsieve_do_sieving2() 229 fmpz_set_si(X, i - qs_inf->sieve_size / 2); /* X */ in qsieve_evaluate_candidate() 242 flint_printf("x = %wd\n", i - qs_inf->sieve_size / 2); in qsieve_evaluate_candidate() 459 while (j < qs_inf->sieve_size / sizeof(ulong)) in qsieve_evaluate_sieve() 474 while (i < (j + 1) * sizeof(ulong) && i < qs_inf->sieve_size) in qsieve_evaluate_sieve() 531 if (qs_inf->sieve_size < 2*BLOCK_SIZE) in qsieve_collect_relations_worker() [all …]
|
H A D | primes_init.c | 120 qs_inf->sieve_size = qsieve_tune[i][4]; /* size of sieve to use */ in qsieve_primes_init() 151 fmpz_tdiv_q_ui(qs_inf->target_A, qs_inf->target_A, qs_inf->sieve_size/2); in qsieve_primes_init() 177 fmpz_tdiv_q_ui(qs_inf->target_A, qs_inf->target_A, qs_inf->sieve_size/2); in qsieve_primes_increment()
|
/dports/math/e-antic/flint2-ae7ec89/qsieve/ |
H A D | collect_relations.c | 30 unsigned char * end = sieve + qs_inf->sieve_size; in qsieve_do_sieving() 39 memset(sieve, qs_inf->sieve_fill, qs_inf->sieve_size + sizeof(ulong)); in qsieve_do_sieving() 101 memset(sieve, qs_inf->sieve_fill, qs_inf->sieve_size + sizeof(ulong)); in qsieve_do_sieving2() 102 sieve[qs_inf->sieve_size] = (char) 255; in qsieve_do_sieving2() 115 for (b = 1; b <= qs_inf->sieve_size / BLOCK_SIZE; b++) in qsieve_do_sieving2() 229 fmpz_set_si(X, i - qs_inf->sieve_size / 2); /* X */ in qsieve_evaluate_candidate() 242 flint_printf("x = %wd\n", i - qs_inf->sieve_size / 2); in qsieve_evaluate_candidate() 459 while (j < qs_inf->sieve_size / sizeof(ulong)) in qsieve_evaluate_sieve() 474 while (i < (j + 1) * sizeof(ulong) && i < qs_inf->sieve_size) in qsieve_evaluate_sieve() 531 if (qs_inf->sieve_size < 2*BLOCK_SIZE) in qsieve_collect_relations_worker() [all …]
|
H A D | primes_init.c | 120 qs_inf->sieve_size = qsieve_tune[i][4]; /* size of sieve to use */ in qsieve_primes_init() 151 fmpz_tdiv_q_ui(qs_inf->target_A, qs_inf->target_A, qs_inf->sieve_size/2); in qsieve_primes_init() 177 fmpz_tdiv_q_ui(qs_inf->target_A, qs_inf->target_A, qs_inf->sieve_size/2); in qsieve_primes_increment()
|
/dports/math/flint2/flint-2.8.4/qsieve/ |
H A D | collect_relations.c | 30 unsigned char * end = sieve + qs_inf->sieve_size; in qsieve_do_sieving() 39 memset(sieve, qs_inf->sieve_fill, qs_inf->sieve_size + sizeof(ulong)); in qsieve_do_sieving() 101 memset(sieve, qs_inf->sieve_fill, qs_inf->sieve_size + sizeof(ulong)); in qsieve_do_sieving2() 102 sieve[qs_inf->sieve_size] = (char) 255; in qsieve_do_sieving2() 115 for (b = 1; b <= qs_inf->sieve_size / BLOCK_SIZE; b++) in qsieve_do_sieving2() 229 fmpz_set_si(X, i - qs_inf->sieve_size / 2); /* X */ in qsieve_evaluate_candidate() 242 flint_printf("x = %wd\n", i - qs_inf->sieve_size / 2); in qsieve_evaluate_candidate() 459 while (j < qs_inf->sieve_size / sizeof(ulong)) in qsieve_evaluate_sieve() 474 while (i < (j + 1) * sizeof(ulong) && i < qs_inf->sieve_size) in qsieve_evaluate_sieve() 531 if (qs_inf->sieve_size < 2*BLOCK_SIZE) in qsieve_collect_relations_worker() [all …]
|
H A D | primes_init.c | 120 qs_inf->sieve_size = qsieve_tune[i][4]; /* size of sieve to use */ in qsieve_primes_init() 151 fmpz_tdiv_q_ui(qs_inf->target_A, qs_inf->target_A, qs_inf->sieve_size/2); in qsieve_primes_init() 177 fmpz_tdiv_q_ui(qs_inf->target_A, qs_inf->target_A, qs_inf->sieve_size/2); in qsieve_primes_increment()
|
/dports/math/primecount/primecount-7.2/src/ |
H A D | Sieve.cpp | 311 uint64_t sieve_size = sieve_.size(); in cross_off() local 314 if_unlikely(m >= sieve_size) \ in cross_off() 334 while (m + prime * 28 < sieve_size) in cross_off() 359 while (m + prime * 28 + 6 < sieve_size) in cross_off() 384 while (m + prime * 28 + 10 < sieve_size) in cross_off() 409 while (m + prime * 28 + 12 < sieve_size) in cross_off() 434 while (m + prime * 28 + 16 < sieve_size) in cross_off() 459 while (m + prime * 28 + 18 < sieve_size) in cross_off() 484 while (m + prime * 28 + 22 < sieve_size) in cross_off() 546 uint64_t sieve_size = sieve_.size(); in cross_off_count() local [all …]
|
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/base/simple_classes/prime_list/ |
H A D | prime_list.cc | 104 register PRIME_LIST_COUNTER sieve_size) in apply_bit_sieve_prime_mask() argument 113 for (index = 0; index < sieve_size; index++) { in apply_bit_sieve_prime_mask() 1261 PRIME_LIST_COUNTER sieve_size; in sieve_int() local 1273 sieve_size = upper_bound_sqrt + 1; in sieve_int() 1276 if (sieve_size > max_sieve_size) in sieve_int() 1277 sieve_size = max_sieve_size; in sieve_int() 1279 sieve = new PRIME_LIST_SIEVE[sieve_size]; in sieve_int() 1293 current_sieve_size = sieve_size; in sieve_int() 1295 current_sieve_size = sieve_size; in sieve_int() 1342 current_sieve_size = sieve_size; in sieve_int() [all …]
|
/dports/security/botan110/Botan-1.10.17/src/math/numbertheory/ |
H A D | make_prm.cpp | 50 const size_t sieve_size = std::min(bits / 2, PRIME_TABLE_SIZE); in random_prime() local 51 SecureVector<size_t> sieve(sieve_size); in random_prime()
|
/dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/botan/src/lib/math/numbertheory/ |
H A D | make_prm.cpp | 23 Prime_Sieve(const BigInt& init_value, size_t sieve_size) : in Prime_Sieve() argument 24 m_sieve(std::min(sieve_size, PRIME_TABLE_SIZE)) in Prime_Sieve()
|
/dports/security/botan2/Botan-2.18.2/src/lib/math/numbertheory/ |
H A D | make_prm.cpp | 23 Prime_Sieve(const BigInt& init_value, size_t sieve_size) : in Prime_Sieve() argument 24 m_sieve(std::min(sieve_size, PRIME_TABLE_SIZE)) in Prime_Sieve()
|
/dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/botan/src/lib/math/numbertheory/ |
H A D | make_prm.cpp | 23 Prime_Sieve(const BigInt& init_value, size_t sieve_size) : in Prime_Sieve() argument 24 m_sieve(std::min(sieve_size, PRIME_TABLE_SIZE)) in Prime_Sieve()
|
/dports/security/libecc/libecc-0.14.0/testsuite/polynomial/ |
H A D | utils.cc | 42 int const sieve_size = (int)((1 << ((max_m + 1) / 2 - 1)) * ((max_m & 1) ? 1 : 1.414213562373096) +… variable 43 int prime_sieve[sieve_size]; // Corresponding prime == 2 * index + 3 45 int const largest_prime = 2 * (sieve_size - 1) + 3; // Actually this is larger than exp(log_larges… 66 if (last_index == sieve_size) in generate_primes() 75 for(int i = last_index + prime; i < sieve_size; i += prime) in generate_primes()
|
/dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/ |
H A D | sieve.c | 299 UV sieve_size, limit = isqrt(endp); in sieve_segment() local 304 sieve_size = get_prime_cache(0, &sieve); in sieve_segment() 306 if (sieve_size >= endp) { in sieve_segment() 312 } else if (!do_partial && sieve_size >= limit) { in sieve_segment()
|
/dports/math/primecount/primecount-7.2/lib/primesieve/include/ |
H A D | primesieve.h | 209 void primesieve_set_sieve_size(int sieve_size);
|
/dports/math/primesieve/primesieve-7.7/include/ |
H A D | primesieve.h | 209 void primesieve_set_sieve_size(int sieve_size);
|