| /dports/devel/boost-python-libs/boost_1_72_0/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((in_+capacity(lk)-out_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
546 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
596 push_at(elem, wait_until_not_full(lk), lk); in push()
603 push_at(elem, wait_until_not_full(lk), lk); in push_back()
651 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
690 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((out_+capacity(lk)-in_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
544 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
594 push_at(elem, wait_until_not_full(lk), lk); in push()
601 push_at(elem, wait_until_not_full(lk), lk); in push_back()
649 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
688 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((in_+capacity(lk)-out_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
546 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
596 push_at(elem, wait_until_not_full(lk), lk); in push()
603 push_at(elem, wait_until_not_full(lk), lk); in push_back()
651 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
690 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((in_+capacity(lk)-out_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
546 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
596 push_at(elem, wait_until_not_full(lk), lk); in push()
603 push_at(elem, wait_until_not_full(lk), lk); in push_back()
651 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
690 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((out_+capacity(lk)-in_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
544 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
594 push_at(elem, wait_until_not_full(lk), lk); in push()
601 push_at(elem, wait_until_not_full(lk), lk); in push_back()
649 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
688 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((out_+capacity(lk)-in_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
544 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
594 push_at(elem, wait_until_not_full(lk), lk); in push()
601 push_at(elem, wait_until_not_full(lk), lk); in push_back()
649 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
688 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((out_+capacity(lk)-in_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
544 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
594 push_at(elem, wait_until_not_full(lk), lk); in push()
601 push_at(elem, wait_until_not_full(lk), lk); in push_back()
649 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
688 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((in_+capacity(lk)-out_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
546 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
596 push_at(elem, wait_until_not_full(lk), lk); in push()
603 push_at(elem, wait_until_not_full(lk), lk); in push_back()
651 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
690 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((out_+capacity(lk)-in_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
544 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
594 push_at(elem, wait_until_not_full(lk), lk); in push()
601 push_at(elem, wait_until_not_full(lk), lk); in push_back()
649 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
688 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((out_+capacity(lk)-in_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
544 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
594 push_at(elem, wait_until_not_full(lk), lk); in push()
601 push_at(elem, wait_until_not_full(lk), lk); in push_back()
649 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
688 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((out_+capacity(lk)-in_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
544 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
594 push_at(elem, wait_until_not_full(lk), lk); in push()
601 push_at(elem, wait_until_not_full(lk), lk); in push_back()
649 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
688 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((in_+capacity(lk)-out_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
546 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
596 push_at(elem, wait_until_not_full(lk), lk); in push()
603 push_at(elem, wait_until_not_full(lk), lk); in push_back()
651 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
690 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((in_+capacity(lk)-out_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
546 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
596 push_at(elem, wait_until_not_full(lk), lk); in push()
603 push_at(elem, wait_until_not_full(lk), lk); in push_back()
651 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
690 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((out_+capacity(lk)-in_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
544 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
594 push_at(elem, wait_until_not_full(lk), lk); in push()
601 push_at(elem, wait_until_not_full(lk), lk); in push_back()
649 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
688 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((in_+capacity(lk)-out_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
546 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
596 push_at(elem, wait_until_not_full(lk), lk); in push()
603 push_at(elem, wait_until_not_full(lk), lk); in push_back()
651 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
690 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((in_+capacity(lk)-out_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
546 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
596 push_at(elem, wait_until_not_full(lk), lk); in push()
603 push_at(elem, wait_until_not_full(lk), lk); in push_back()
651 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
690 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/thread/concurrent_queues/ |
| H A D | sync_bounded_queue.hpp | 129 if (full(lk)) return capacity(lk); in size()
130 return ((out_+capacity(lk)-in_) % capacity(lk)); in size()
324 if (empty(lk)) in try_pull()
335 if (empty(lk)) in try_pull()
353 if (empty(lk)) in try_pull_front()
544 push_at(elem, wait_until_not_full(lk), lk); in wait_push_back()
594 push_at(elem, wait_until_not_full(lk), lk); in push()
601 push_at(elem, wait_until_not_full(lk), lk); in push_back()
649 push_at(boost::move(elem), wait_until_not_full(lk), lk); in wait_push_back()
688 push_at(boost::move(elem), wait_until_not_full(lk), lk); in push()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/libxml/src/ |
| H A D | list.c | 61 (lk->prev)->next = lk->next; in xmlLinkDeallocator()
62 (lk->next)->prev = lk->prev; in xmlLinkDeallocator()
104 … for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next); in xmlListLowerSearch()
124 … for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev); in xmlListHigherSearch()
237 if (lk) in xmlListSearch()
258 if (lk) in xmlListReverseSearch()
502 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next, count++); in xmlListSize()
626 for (lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListReverse()
681 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListWalk()
702 for(lk = l->sentinel->prev; lk != l->sentinel; lk = lk->prev) { in xmlListReverseWalk()
[all …]
|
| /dports/devel/gettext-runtime/gettext-0.21/libtextstyle/lib/libxml/ |
| H A D | list.c | 72 (lk->prev)->next = lk->next; in xmlLinkDeallocator()
73 (lk->next)->prev = lk->prev; in xmlLinkDeallocator()
115 … for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next); in xmlListLowerSearch()
135 … for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev); in xmlListHigherSearch()
248 if (lk) in xmlListSearch()
269 if (lk) in xmlListReverseSearch()
513 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next, count++); in xmlListSize()
637 for (lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListReverse()
692 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListWalk()
713 for(lk = l->sentinel->prev; lk != l->sentinel; lk = lk->prev) { in xmlListReverseWalk()
[all …]
|
| /dports/devel/gettext-runtime/gettext-0.21/gnulib-local/lib/libxml/ |
| H A D | list.c | 72 (lk->prev)->next = lk->next; in xmlLinkDeallocator()
73 (lk->next)->prev = lk->prev; in xmlLinkDeallocator()
115 … for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next); in xmlListLowerSearch()
135 … for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev); in xmlListHigherSearch()
248 if (lk) in xmlListSearch()
269 if (lk) in xmlListReverseSearch()
513 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next, count++); in xmlListSize()
637 for (lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListReverse()
692 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListWalk()
713 for(lk = l->sentinel->prev; lk != l->sentinel; lk = lk->prev) { in xmlListReverseWalk()
[all …]
|
| /dports/devel/gettext-tools/gettext-0.21/libtextstyle/lib/libxml/ |
| H A D | list.c | 72 (lk->prev)->next = lk->next; in xmlLinkDeallocator()
73 (lk->next)->prev = lk->prev; in xmlLinkDeallocator()
115 … for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next); in xmlListLowerSearch()
135 … for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev); in xmlListHigherSearch()
248 if (lk) in xmlListSearch()
269 if (lk) in xmlListReverseSearch()
513 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next, count++); in xmlListSize()
637 for (lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListReverse()
692 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListWalk()
713 for(lk = l->sentinel->prev; lk != l->sentinel; lk = lk->prev) { in xmlListReverseWalk()
[all …]
|
| /dports/devel/gettext-tools/gettext-0.21/gettext-tools/gnulib-lib/libxml/ |
| H A D | list.c | 72 (lk->prev)->next = lk->next; in xmlLinkDeallocator()
73 (lk->next)->prev = lk->prev; in xmlLinkDeallocator()
115 … for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next); in xmlListLowerSearch()
135 … for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev); in xmlListHigherSearch()
248 if (lk) in xmlListSearch()
269 if (lk) in xmlListReverseSearch()
513 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next, count++); in xmlListSize()
637 for (lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListReverse()
692 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListWalk()
713 for(lk = l->sentinel->prev; lk != l->sentinel; lk = lk->prev) { in xmlListReverseWalk()
[all …]
|
| /dports/devel/gettext-tools/gettext-0.21/gnulib-local/lib/libxml/ |
| H A D | list.c | 72 (lk->prev)->next = lk->next; in xmlLinkDeallocator()
73 (lk->next)->prev = lk->prev; in xmlLinkDeallocator()
115 … for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next); in xmlListLowerSearch()
135 … for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev); in xmlListHigherSearch()
248 if (lk) in xmlListSearch()
269 if (lk) in xmlListReverseSearch()
513 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next, count++); in xmlListSize()
637 for (lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListReverse()
692 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListWalk()
713 for(lk = l->sentinel->prev; lk != l->sentinel; lk = lk->prev) { in xmlListReverseWalk()
[all …]
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/libxml/src/ |
| H A D | list.c | 61 (lk->prev)->next = lk->next; in xmlLinkDeallocator()
62 (lk->next)->prev = lk->prev; in xmlLinkDeallocator()
104 … for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next); in xmlListLowerSearch()
124 … for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev); in xmlListHigherSearch()
237 if (lk) in xmlListSearch()
258 if (lk) in xmlListReverseSearch()
502 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next, count++); in xmlListSize()
626 for (lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListReverse()
681 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListWalk()
702 for(lk = l->sentinel->prev; lk != l->sentinel; lk = lk->prev) { in xmlListReverseWalk()
[all …]
|
| /dports/devel/gettext-po-mode/gettext-0.21/libtextstyle/lib/libxml/ |
| H A D | list.c | 72 (lk->prev)->next = lk->next; in xmlLinkDeallocator()
73 (lk->next)->prev = lk->prev; in xmlLinkDeallocator()
115 … for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next); in xmlListLowerSearch()
135 … for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev); in xmlListHigherSearch()
248 if (lk) in xmlListSearch()
269 if (lk) in xmlListReverseSearch()
513 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next, count++); in xmlListSize()
637 for (lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListReverse()
692 for(lk = l->sentinel->next; lk != l->sentinel; lk = lk->next) { in xmlListWalk()
713 for(lk = l->sentinel->prev; lk != l->sentinel; lk = lk->prev) { in xmlListReverseWalk()
[all …]
|