Home
last modified time | relevance | path

Searched refs:__next_ (Results 1 – 11 of 11) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A Dforward_list285 pointer __next_;
287 _LIBCPP_HIDE_FROM_ABI __forward_begin_node() : __next_(nullptr) {}
288 _LIBCPP_HIDE_FROM_ABI explicit __forward_begin_node(pointer __n) : __next_(__n) {}
291 return static_cast<__begin_node_pointer>(__next_);
367 __ptr_ = __traits::__as_iter_node(__ptr_->__next_);
433 __ptr_ = __traits::__as_iter_node(__ptr_->__next_);
560 swap(__before_begin()->__next_, __x.__before_begin()->__next_);
565 for (__node_pointer __p = __before_begin()->__next_; __p != nullptr;) {
566 __node_pointer __next = __p->__next_;
570 __before_begin()->__next_ = nullptr;
[all …]
H A D__hash_table85 __next_pointer __next_;
97 _LIBCPP_HIDE_FROM_ABI __hash_node_base() _NOEXCEPT : __next_(nullptr) {}
98 …_LIBCPP_HIDE_FROM_ABI explicit __hash_node_base(__next_pointer __next) _NOEXCEPT : __next_(__next)…
286 __node_ = __node_->__next_;
354 __node_ = __node_->__next_;
418 __node_ = __node_->__next_;
444 __node_ = __node_->__next_;
501 __node_ = __node_->__next_;
529 __node_ = __node_->__next_;
986 …__bucket_list_[std::__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] = __p1_.fir…
[all …]
H A Dlist283 __link_pointer __next_;
287 __next_(_NodeTraits::__unsafe_link_pointer_cast(__self())) {}
290 : __prev_(__prev), __next_(__next) {}
355 __ptr_ = __ptr_->__next_;
413 __ptr_ = __ptr_->__next_;
497 _LIBCPP_HIDE_FROM_ABI iterator begin() _NOEXCEPT { return iterator(__end_.__next_); }
498 …CPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT { return const_iterator(__end_.__next_); }
560 __f->__prev_->__next_ = __l->__next_;
561 __l->__next_->__prev_ = __f->__prev_;
581 __link_pointer __f = __end_.__next_;
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dforward_list304 pointer __next_;
306 _LIBCPP_CONSTEXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI __forward_begin_node() : __next_(nullptr) {}
307 …EXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI explicit __forward_begin_node(pointer __n) : __next_(__n) {}
390 __ptr_ = std::__static_fancy_pointer_cast<__begin_node_pointer>(__ptr_->__next_);
454 __ptr_ = std::__static_fancy_pointer_cast<__begin_node_pointer>(__ptr_->__next_);
595 __x.__before_begin()->__next_ = nullptr;
603 __before_begin()->__next_ = __x.__before_begin()->__next_;
604 __x.__before_begin()->__next_ = nullptr;
625 swap(__before_begin()->__next_, __x.__before_begin()->__next_);
630 for (__node_pointer __p = __before_begin()->__next_; __p != nullptr;) {
[all …]
H A D__hash_table96 __next_pointer __next_;
108 _LIBCPP_HIDE_FROM_ABI __hash_node_base() _NOEXCEPT : __next_(nullptr) {}
109 …_LIBCPP_HIDE_FROM_ABI explicit __hash_node_base(__next_pointer __next) _NOEXCEPT : __next_(__next)…
323 __node_ = __node_->__next_;
391 __node_ = __node_->__next_;
455 __node_ = __node_->__next_;
481 __node_ = __node_->__next_;
538 __node_ = __node_->__next_;
566 __node_ = __node_->__next_;
1137 …__bucket_list_[std::__constrain_hash(__first_node_.__next_->__hash(), bucket_count())] = __first_n…
[all …]
H A Dlist298 __base_pointer __next_;
300 …EXPR_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI __list_node_base() : __prev_(__self()), __next_(__self()) {}
304 : __prev_(__prev), __next_(__next) {}
392 __ptr_ = __ptr_->__next_;
455 __ptr_ = __ptr_->__next_;
541 …R_SINCE_CXX26 _LIBCPP_HIDE_FROM_ABI iterator begin() _NOEXCEPT { return iterator(__end_.__next_); }
543 return const_iterator(__end_.__next_);
616 __f->__prev_->__next_ = __l->__next_;
617 __l->__next_->__prev_ = __f->__prev_;
648 __base_pointer __f = __end_.__next_;
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__stop_token/
H A Dintrusive_list_view.h26 _Derived* __next_ = nullptr; member
45 __node->__next_ = __head_; in __push_front()
54 __head_ = __head_->__next_; in __pop_front()
65 __node->__prev_->__next_ = __node->__next_; in __remove()
66 if (__node->__next_) { in __remove()
67 __node->__next_->__prev_ = __node->__prev_; in __remove()
/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Dchunk_by_view.h144 _LIBCPP_NO_UNIQUE_ADDRESS iterator_t<_View> __next_ = iterator_t<_View>(); variable
148 : __parent_(std::addressof(__parent)), __current_(__current), __next_(__next) {} in __iterator()
161 …_LIBCPP_ASSERT_PEDANTIC(__current_ != __next_, "Trying to dereference past-the-end chunk_by_view i…
162 return {__current_, __next_};
167 …_LIBCPP_ASSERT_PEDANTIC(__current_ != __next_, "Trying to increment past end chunk_by_view iterato…
168 __current_ = __next_;
169 __next_ = __parent_->__find_next(__current_);
182 __next_ = __current_;
183 __current_ = __parent_->__find_prev(__next_);
200 return __x.__current_ == __x.__next_;
H A Dsplit_view.h128 _LIBCPP_NO_UNIQUE_ADDRESS subrange<iterator_t<_View>> __next_ = subrange<iterator_t<_View>>();
143 … : __parent_(std::addressof(__parent)), __cur_(std::move(__current)), __next_(std::move(__next)) {}
147 _LIBCPP_HIDE_FROM_ABI constexpr value_type operator*() const { return {__cur_, __next_.begin()}; }
150 __cur_ = __next_.begin();
152 __cur_ = __next_.end();
155 __next_ = {__cur_, __cur_};
157 __next_ = __parent_->__find_next(__cur_);
/freebsd/contrib/llvm-project/libcxx/src/
H A Dmemory_resource.cpp146 __chunk_footer* __next_; member
154 __chunk_footer* next = __first_->__next_; in __release_ptr()
172 h->__next_ = __first_; in __do_allocate()
183 __chunk_footer* next = __first_->__next_; in __do_deallocate()
187 for (__chunk_footer* h = __first_; h->__next_ != nullptr; h = h->__next_) { in __do_deallocate()
188 if (h->__next_->__start_ == p) { in __do_deallocate()
189 __chunk_footer* next = h->__next_->__next_; in __do_deallocate()
190 upstream->deallocate(p, h->__next_->__allocation_size(), h->__next_->__align_); in __do_deallocate()
191 h->__next_ = next; in __do_deallocate()
202 __chunk_footer* __next_; member
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__memory_resource/
H A Dmonotonic_buffer_resource.h33 __chunk_footer* __next_; member
90 __chunk_footer* __next = __chunks_->__next_; in release()