Home
last modified time | relevance | path

Searched refs:__head_ (Results 1 – 3 of 3) sorted by relevance

/openbmc/sdbusplus/include/sdbusplus/async/stdexec/__detail/
H A D__intrusive_queue.hpp39 __head_(std::exchange(__other.__head_, nullptr)), in __intrusive_queue()
44 __head_(__head), __tail_(__tail) in __intrusive_queue()
49 std::swap(__head_, __other.__head_); in operator =()
72 __result.__head_ = __new_head; in make_reversed()
80 __result.__head_ = __list; in make()
95 return __head_ == nullptr; in empty()
100 __head_ = nullptr; in clear()
107 _Item* __item = std::exchange(__head_, __head_->*_Next); in pop_front()
121 __item->*_Next = __head_; in push_front()
122 __head_ = __item; in push_front()
[all …]
H A D__intrusive_slist.hpp39 __head_(std::exchange(__other.__head_, nullptr)) in __intrusive_slist()
42 __intrusive_slist(_Item* __head) noexcept : __head_(__head) {} in __intrusive_slist()
46 std::swap(__head_, __other.__head_); in swap()
57 return __head_ == nullptr; in empty()
62 return __head_; in front()
67 __head_ = nullptr; in clear()
73 return std::exchange(__head_, __head_->*_Next); in pop_front()
79 __item->*_Next = std::exchange(__head_, __item); in push_front()
85 if (__head_ == __item) in remove()
147 return iterator(__head_); in begin()
[all …]
H A D__run_loop.hpp130 return {&__loop_->__head_, __loop_, in connect()
209 __task __head_{{}, &__head_, {&__head_}}; member in stdexec::__loop::run_loop
229 for (__task* __task; (__task = __pop_front_()) != &__head_;) in run()
245 __task->__next_ = &__head_; in __push_back_()
246 __head_.__tail_ = __head_.__tail_->__next_ = __task; in __push_back_()
254 [this] { return __head_.__next_ != &__head_ || __stop_; }); in __pop_front_()
255 if (__head_.__tail_ == __head_.__next_) in __pop_front_()
256 __head_.__tail_ = &__head_; in __pop_front_()
257 return std::exchange(__head_.__next_, __head_.__next_->__next_); in __pop_front_()