Home
last modified time | relevance | path

Searched refs:__count_ (Results 1 – 6 of 6) sorted by relevance

/src/contrib/llvm-project/libcxx/include/__iterator/
H A Dcounted_iterator.h84 : __current_(std::move(__iter)), __count_(__n) {
91 : __current_(__other.__current_), __count_(__other.__count_) {}
97 __count_ = __other.__count_;
105 …_LIBCPP_HIDE_FROM_ABI constexpr iter_difference_t<_Iter> count() const noexcept { return __count_;…
108 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__count_ > 0, "Iterator is equal to or past end.");
115 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__count_ > 0, "Iterator is equal to or past end.");
126 _LIBCPP_ASSERT_UNCATEGORIZED(__count_ > 0, "Iterator already at or past end.");
128 --__count_;
133 _LIBCPP_ASSERT_UNCATEGORIZED(__count_ > 0, "Iterator already at or past end.");
134 --__count_;
[all …]
/src/contrib/llvm-project/libcxx/src/
H A Dmutex.cpp102 recursive_timed_mutex::recursive_timed_mutex() : __count_(0), __id_{} {} in recursive_timed_mutex()
110 if (__count_ == numeric_limits<size_t>::max()) in lock()
112 ++__count_; in lock()
115 while (__count_ != 0) in lock()
117 __count_ = 1; in lock()
124 if (lk.owns_lock() && (__count_ == 0 || id == __id_)) { in try_lock()
125 if (__count_ == numeric_limits<size_t>::max()) in try_lock()
127 ++__count_; in try_lock()
136 if (--__count_ == 0) { in unlock()
/src/contrib/llvm-project/libcxx/include/__ranges/
H A Ddrop_view.h69 range_difference_t<_View> __count_ = 0; variable
79 : __count_(__count), __base_(std::move(__base)) { in drop_view()
80 _LIBCPP_ASSERT_UNCATEGORIZED(__count_ >= 0, "count must be greater than or equal to zero."); in drop_view()
94 const auto __dist = std::min(ranges::distance(__base_), __count_); in begin()
101 auto __tmp = ranges::next(ranges::begin(__base_), __count_, ranges::end(__base_)); in begin()
110 const auto __dist = std::min(ranges::distance(__base_), __count_); in begin()
128 const auto __c = static_cast<decltype(__s)>(__self.__count_); in __size()
H A Dtake_view.h63 range_difference_t<_View> __count_ = 0; variable
75 : __base_(std::move(__base)), __count_(__count) { in take_view()
99 return counted_iterator(ranges::begin(__base_), __count_); in begin()
115 return counted_iterator(ranges::begin(__base_), __count_); in begin()
151 return ranges::min(__n, static_cast<decltype(__n)>(__count_)); in size()
158 return ranges::min(__n, static_cast<decltype(__n)>(__count_)); in size()
/src/contrib/llvm-project/libcxx/include/
H A Dmutex281 size_t __count_;
309 if (__count_ == numeric_limits<size_t>::max())
311 ++__count_;
315 while (__no_timeout && __count_ != 0)
317 if (__count_ == 0) {
318 __count_ = 1;
/src/contrib/llvm-project/libcxx/include/__memory/
H A Dshared_ptr.h886 : __alloc_(__alloc), __count_(__count) {
887 …std::__uninitialized_allocator_fill_n_multidimensional(__alloc_, std::begin(__data_), __count_, __…
891 : __alloc_(__alloc), __count_(__count) {
896 std::uninitialized_default_construct_n(std::begin(__data_), __count_);
898 …ninitialized_allocator_value_construct_n_multidimensional(__alloc_, std::begin(__data_), __count_);
901 …ninitialized_allocator_value_construct_n_multidimensional(__alloc_, std::begin(__data_), __count_);
928 std::__reverse_destroy(__data_, __data_ + __count_);
931 std::__allocator_destroy_multidimensional(__value_alloc, __data_, __data_ + __count_);
935 std::__allocator_destroy_multidimensional(__value_alloc, __data_, __data_ + __count_);
946 size_t __size = __unbounded_array_control_block::__bytes_for(__count_);
[all …]