Home
last modified time | relevance | path

Searched refs:pidx_ (Results 1 – 17 of 17) sorted by relevance

/dports/devel/hyperscan/boost_1_75_0/boost/fiber/
H A Dbuffered_channel.hpp57 return cidx_ == pidx_; in is_empty_()
104 slots_[pidx_] = value; in try_push()
105 pidx_ = (pidx_ + 1) % capacity_; in try_push()
118 slots_[pidx_] = std::move( value); in try_push()
119 pidx_ = (pidx_ + 1) % capacity_; in try_push()
134 slots_[pidx_] = value; in push()
135 pidx_ = (pidx_ + 1) % capacity_; in push()
153 pidx_ = (pidx_ + 1) % capacity_; in push()
190 slots_[pidx_] = value; in push_wait_until()
191 pidx_ = (pidx_ + 1) % capacity_; in push_wait_until()
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/fiber/
H A Dbuffered_channel.hpp57 return cidx_ == pidx_; in is_empty_()
104 slots_[pidx_] = value; in try_push()
105 pidx_ = (pidx_ + 1) % capacity_; in try_push()
118 slots_[pidx_] = std::move( value); in try_push()
119 pidx_ = (pidx_ + 1) % capacity_; in try_push()
134 slots_[pidx_] = value; in push()
135 pidx_ = (pidx_ + 1) % capacity_; in push()
153 pidx_ = (pidx_ + 1) % capacity_; in push()
190 slots_[pidx_] = value; in push_wait_until()
191 pidx_ = (pidx_ + 1) % capacity_; in push_wait_until()
[all …]
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/fiber/
H A Dbuffered_channel.hpp57 return cidx_ == pidx_; in is_empty_()
104 slots_[pidx_] = value; in try_push()
105 pidx_ = (pidx_ + 1) % capacity_; in try_push()
118 slots_[pidx_] = std::move( value); in try_push()
119 pidx_ = (pidx_ + 1) % capacity_; in try_push()
134 slots_[pidx_] = value; in push()
135 pidx_ = (pidx_ + 1) % capacity_; in push()
153 pidx_ = (pidx_ + 1) % capacity_; in push()
190 slots_[pidx_] = value; in push_wait_until()
191 pidx_ = (pidx_ + 1) % capacity_; in push_wait_until()
[all …]
/dports/devel/hyperscan/boost_1_75_0/boost/fiber/detail/
H A Dcontext_spinlock_queue.hpp34 std::size_t pidx_{ 0 }; member in boost::fibers::detail::context_spinlock_queue
45 std::memcpy( slots_ + offset, old_slots, pidx_ * sizeof( slot_type) ); in resize_()
48 pidx_ = capacity_ - 1; in resize_()
54 return cidx_ == ((pidx_ + 1) % capacity_); in is_full_()
58 return cidx_ == pidx_; in is_empty_()
84 slots_[pidx_] = c; in push()
85 pidx_ = (pidx_ + 1) % capacity_; in push()
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/fiber/detail/
H A Dcontext_spinlock_queue.hpp34 std::size_t pidx_{ 0 }; member in boost::fibers::detail::context_spinlock_queue
45 std::memcpy( slots_ + offset, old_slots, pidx_ * sizeof( slot_type) ); in resize_()
48 pidx_ = capacity_ - 1; in resize_()
54 return cidx_ == ((pidx_ + 1) % capacity_); in is_full_()
58 return cidx_ == pidx_; in is_empty_()
84 slots_[pidx_] = c; in push()
85 pidx_ = (pidx_ + 1) % capacity_; in push()
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/fiber/detail/
H A Dcontext_spinlock_queue.hpp34 std::size_t pidx_{ 0 }; member in boost::fibers::detail::context_spinlock_queue
45 std::memcpy( slots_ + offset, old_slots, pidx_ * sizeof( slot_type) ); in resize_()
48 pidx_ = capacity_ - 1; in resize_()
54 return cidx_ == ((pidx_ + 1) % capacity_); in is_full_()
58 return cidx_ == pidx_; in is_empty_()
84 slots_[pidx_] = c; in push()
85 pidx_ = (pidx_ + 1) % capacity_; in push()
/dports/devel/boost-libs/boost_1_72_0/boost/fiber/detail/
H A Dcontext_spinlock_queue.hpp34 std::size_t pidx_{ 0 }; member in boost::fibers::detail::context_spinlock_queue
45 std::memcpy( slots_ + offset, old_slots, pidx_ * sizeof( slot_type) ); in resize_()
48 pidx_ = capacity_ - 1; in resize_()
54 return cidx_ == ((pidx_ + 1) % capacity_); in is_full_()
58 return cidx_ == pidx_; in is_empty_()
84 slots_[pidx_] = c; in push()
85 pidx_ = (pidx_ + 1) % capacity_; in push()
/dports/devel/boost-docs/boost_1_72_0/boost/fiber/detail/
H A Dcontext_spinlock_queue.hpp34 std::size_t pidx_{ 0 }; member in boost::fibers::detail::context_spinlock_queue
45 std::memcpy( slots_ + offset, old_slots, pidx_ * sizeof( slot_type) ); in resize_()
48 pidx_ = capacity_ - 1; in resize_()
54 return cidx_ == ((pidx_ + 1) % capacity_); in is_full_()
58 return cidx_ == pidx_; in is_empty_()
84 slots_[pidx_] = c; in push()
85 pidx_ = (pidx_ + 1) % capacity_; in push()
/dports/devel/boost-python-libs/boost_1_72_0/boost/fiber/detail/
H A Dcontext_spinlock_queue.hpp34 std::size_t pidx_{ 0 }; member in boost::fibers::detail::context_spinlock_queue
45 std::memcpy( slots_ + offset, old_slots, pidx_ * sizeof( slot_type) ); in resize_()
48 pidx_ = capacity_ - 1; in resize_()
54 return cidx_ == ((pidx_ + 1) % capacity_); in is_full_()
58 return cidx_ == pidx_; in is_empty_()
84 slots_[pidx_] = c; in push()
85 pidx_ = (pidx_ + 1) % capacity_; in push()
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/fiber/detail/
H A Dcontext_spinlock_queue.hpp34 std::size_t pidx_{ 0 }; member in boost::fibers::detail::context_spinlock_queue
45 std::memcpy( slots_ + offset, old_slots, pidx_ * sizeof( slot_type) ); in resize_()
48 pidx_ = capacity_ - 1; in resize_()
54 return cidx_ == ((pidx_ + 1) % capacity_); in is_full_()
58 return cidx_ == pidx_; in is_empty_()
84 slots_[pidx_] = c; in push()
85 pidx_ = (pidx_ + 1) % capacity_; in push()
/dports/devel/boost-libs/boost_1_72_0/boost/fiber/
H A Dbuffered_channel.hpp53 return cidx_ == ((pidx_ + 1) % capacity_); in is_full_()
57 return cidx_ == pidx_; in is_empty_()
131 slots_[pidx_] = value; in try_push()
132 pidx_ = (pidx_ + 1) % capacity_; in try_push()
164 pidx_ = (pidx_ + 1) % capacity_; in try_push()
199 slots_[pidx_] = value; in push()
200 pidx_ = (pidx_ + 1) % capacity_; in push()
237 pidx_ = (pidx_ + 1) % capacity_; in push()
296 slots_[pidx_] = value; in push_wait_until()
297 pidx_ = (pidx_ + 1) % capacity_; in push_wait_until()
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/boost/fiber/
H A Dbuffered_channel.hpp53 return cidx_ == ((pidx_ + 1) % capacity_); in is_full_()
57 return cidx_ == pidx_; in is_empty_()
131 slots_[pidx_] = value; in try_push()
132 pidx_ = (pidx_ + 1) % capacity_; in try_push()
164 pidx_ = (pidx_ + 1) % capacity_; in try_push()
199 slots_[pidx_] = value; in push()
200 pidx_ = (pidx_ + 1) % capacity_; in push()
237 pidx_ = (pidx_ + 1) % capacity_; in push()
296 slots_[pidx_] = value; in push_wait_until()
297 pidx_ = (pidx_ + 1) % capacity_; in push_wait_until()
[all …]
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/fiber/
H A Dbuffered_channel.hpp53 return cidx_ == ((pidx_ + 1) % capacity_);
57 return cidx_ == pidx_;
131 slots_[pidx_] = value;
132 pidx_ = (pidx_ + 1) % capacity_;
164 pidx_ = (pidx_ + 1) % capacity_;
199 slots_[pidx_] = value;
200 pidx_ = (pidx_ + 1) % capacity_;
237 pidx_ = (pidx_ + 1) % capacity_;
296 slots_[pidx_] = value;
297 pidx_ = (pidx_ + 1) % capacity_;
[all …]
/dports/devel/boost-docs/boost_1_72_0/boost/fiber/
H A Dbuffered_channel.hpp53 return cidx_ == ((pidx_ + 1) % capacity_); in is_full_()
57 return cidx_ == pidx_; in is_empty_()
131 slots_[pidx_] = value; in try_push()
132 pidx_ = (pidx_ + 1) % capacity_; in try_push()
164 pidx_ = (pidx_ + 1) % capacity_; in try_push()
199 slots_[pidx_] = value; in push()
200 pidx_ = (pidx_ + 1) % capacity_; in push()
237 pidx_ = (pidx_ + 1) % capacity_; in push()
296 slots_[pidx_] = value; in push_wait_until()
297 pidx_ = (pidx_ + 1) % capacity_; in push_wait_until()
[all …]
/dports/cad/iverilog/verilog-11.0/
H A Dnet_expr.cc385 pidx_ = use_type->property_idx_from_name(pnam); in NetEProperty()
386 ivl_type_t prop_type = use_type->get_prop_type(pidx_); in NetEProperty()
400 ivl_type_t prop_type = use_type->get_prop_type(pidx_); in expr_type()
H A Ddesign_dump.cc1843 o << net_->name() << ".<" << pidx_ << ">"; in dump()
H A Dnetlist.h4542 inline size_t property_idx() const { return pidx_; } in property_idx()
4556 size_t pidx_; variable