| /dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/sieve/ |
| H A D | las-threads.cpp | 20 if (n_bucket <= 0) return; in allocate_buckets()
35 double cost = ratio/n * BUCKET_REGIONS[T::level] * n_bucket * sizeof(typename T::update_t); in allocate_buckets()
43 B.allocate_memory(memory, n_bucket, ratio / n, logI); in allocate_buckets()
159 const int *n_bucket, in allocate_buckets() argument
178 … RA1_short.allocate_buckets(memory, n_bucket[1], mult.get<T1s>()*fill_ratio[1], logI, aux, pool); in allocate_buckets()
179 … RA2_short.allocate_buckets(memory, n_bucket[2], mult.get<T2s>()*fill_ratio[2], logI, aux, pool); in allocate_buckets()
180 … RA3_short.allocate_buckets(memory, n_bucket[3], mult.get<T3s>()*fill_ratio[3], logI, aux, pool); in allocate_buckets()
187 … RA2_long.allocate_buckets(memory, n_bucket[2], mult.get<T2l>()*fill_ratio[3], logI, aux, pool); in allocate_buckets()
189 … RA1_empty.allocate_buckets(memory, n_bucket[1], mult.get<T1s>()*fill_ratio[1], logI, aux, pool); in allocate_buckets()
190 … RA2_empty.allocate_buckets(memory, n_bucket[2], mult.get<T2s>()*fill_ratio[2], logI, aux, pool); in allocate_buckets()
[all …]
|
| /dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/botan/src/lib/utils/mem_pool/ |
| H A D | mem_pool.cpp | 335 const size_t n_bucket = choose_bucket(n); in allocate() local
337 if(n_bucket > 0) in allocate()
341 std::deque<Bucket>& buckets = m_buckets_for[n_bucket]; in allocate()
365 buckets.push_front(Bucket(ptr, m_page_size, n_bucket)); in allocate()
383 const size_t n_bucket = choose_bucket(len); in deallocate() local
385 if(n_bucket != 0) in deallocate()
391 std::deque<Bucket>& buckets = m_buckets_for[n_bucket]; in deallocate()
|
| /dports/security/botan2/Botan-2.18.2/src/lib/utils/mem_pool/ |
| H A D | mem_pool.cpp | 335 const size_t n_bucket = choose_bucket(n); in allocate() local
337 if(n_bucket > 0) in allocate()
341 std::deque<Bucket>& buckets = m_buckets_for[n_bucket]; in allocate()
365 buckets.push_front(Bucket(ptr, m_page_size, n_bucket)); in allocate()
383 const size_t n_bucket = choose_bucket(len); in deallocate() local
385 if(n_bucket != 0) in deallocate()
391 std::deque<Bucket>& buckets = m_buckets_for[n_bucket]; in deallocate()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/botan/src/lib/utils/mem_pool/ |
| H A D | mem_pool.cpp | 335 const size_t n_bucket = choose_bucket(n); in allocate() local
337 if(n_bucket > 0) in allocate()
341 std::deque<Bucket>& buckets = m_buckets_for[n_bucket]; in allocate()
365 buckets.push_front(Bucket(ptr, m_page_size, n_bucket)); in allocate()
383 const size_t n_bucket = choose_bucket(len); in deallocate() local
385 if(n_bucket != 0) in deallocate()
391 std::deque<Bucket>& buckets = m_buckets_for[n_bucket]; in deallocate()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 196 size_type n_bucket = static_cast<size_type>(&b - &buckets[0]); in increment() local
198 if (++n_bucket == buckets_len){ in increment()
202 slist_it_ = buckets[n_bucket].begin(); in increment()
204 while (slist_it_ == buckets[n_bucket].end()); in increment()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 262 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
266 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
271 while (buckets[n_bucket].empty()); in increment()
272 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 262 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
266 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
271 while (buckets[n_bucket].empty()); in increment()
272 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 262 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
266 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
271 while (buckets[n_bucket].empty()); in increment()
272 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 262 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
266 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
271 while (buckets[n_bucket].empty()); in increment()
272 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 262 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
266 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
271 while (buckets[n_bucket].empty()); in increment()
272 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 262 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
266 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
271 while (buckets[n_bucket].empty()); in increment()
272 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 263 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
267 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
272 while (buckets[n_bucket].empty()); in increment()
273 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 262 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
266 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
271 while (buckets[n_bucket].empty()); in increment()
272 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 271 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
275 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
280 while (buckets[n_bucket].empty()); in increment()
281 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 271 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
275 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
280 while (buckets[n_bucket].empty()); in increment()
281 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 271 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
275 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
280 while (buckets[n_bucket].empty()); in increment()
281 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 262 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
266 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
271 while (buckets[n_bucket].empty()); in increment()
272 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 271 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
275 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
280 while (buckets[n_bucket].empty()); in increment()
281 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 271 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
275 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
280 while (buckets[n_bucket].empty()); in increment()
281 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 271 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
275 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
280 while (buckets[n_bucket].empty()); in increment()
281 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 271 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
275 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
280 while (buckets[n_bucket].empty()); in increment()
281 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 262 size_type n_bucket = static_cast<size_type>(&b - buckets);
266 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator
271 while (buckets[n_bucket].empty());
272 slist_it_ = buckets[n_bucket].begin();
|
| /dports/textproc/htdig/htdig-3.2.0b6/db/ |
| H A D | mp_fget.c | 47 size_t n_bucket, n_cache, mf_offset; local
159 n_bucket = NBUCKET(mc, mf_offset, *pgnoaddr);
208 for (bhp = SH_TAILQ_FIRST(&dbht[n_bucket], __bh);
304 SH_TAILQ_INSERT_HEAD(&dbht[n_bucket], bhp, hq, __bh);
|
| /dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 262 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
266 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
271 while (buckets[n_bucket].empty()); in increment()
272 slist_it_ = buckets[n_bucket].begin(); in increment()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/detail/ |
| H A D | hashtable_node.hpp | 271 size_type n_bucket = static_cast<size_type>(&b - buckets); in increment() local
275 if (++n_bucket >= buckets_len){ //bucket overflow, return end() iterator in increment()
280 while (buckets[n_bucket].empty()); in increment()
281 slist_it_ = buckets[n_bucket].begin(); in increment()
|