| /src/contrib/llvm-project/libcxx/include/__format/ |
| H A D | unicode.h | 130 : __first_(__first), __last_(__last) {} in __code_point_view() 132 _LIBCPP_HIDE_FROM_ABI constexpr bool __at_end() const noexcept { return __first_ == __last_; } in __at_end() 133 _LIBCPP_HIDE_FROM_ABI constexpr _Iterator __position() const noexcept { return __first_; } in __position() 158 _LIBCPP_ASSERT_INTERNAL(__first_ != __last_, "can't move beyond the end of input"); in __consume() 163 switch (std::countl_one(static_cast<unsigned char>(*__first_))) { in __consume() 165 return {static_cast<unsigned char>(*__first_++)}; in __consume() 168 if (__last_ - __first_ < 2 || !__unicode::__is_continuation(__first_ + 1, 1)) [[unlikely]] in __consume() 171 char32_t __value = static_cast<unsigned char>(*__first_++) & 0x1f; in __consume() 173 __value |= static_cast<unsigned char>(*__first_++) & 0x3f; in __consume() 183 if (__last_ - __first_ < 3 || !__unicode::__is_continuation(__first_ + 1, 2)) [[unlikely]] in __consume() [all …]
|
| /src/contrib/llvm-project/libcxx/include/ |
| H A D | __split_buffer | 50 // It has uninitialized memory in the ranges [__first_, __begin_) and [__end_, __end_cap_.first())… 78 pointer __first_; 91 …: __first_(nullptr), __begin_(nullptr), __end_(nullptr), __end_cap_(nullptr, __default_init_tag())… 94 : __first_(nullptr), __begin_(nullptr), __end_(nullptr), __end_cap_(nullptr, __a) {} 97 : __first_(nullptr), __begin_(nullptr), __end_(nullptr), __end_cap_(nullptr, __a) {} 139 return static_cast<size_type>(__end_cap() - __first_); 143 return static_cast<size_type>(__begin_ - __first_); 232 if (__first_ == nullptr) { 240 if (__begin_ < __first_) 292 size_type __old_cap = __end_cap() - __first_; [all …]
|
| H A D | bitset | 185 __storage_type __first_[_N_words]; 196 …return reference(__first_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word); 199 …return const_reference(__first_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per… 202 return iterator(__first_ + __pos / __bits_per_word, __pos % __bits_per_word); 205 return const_iterator(__first_ + __pos / __bits_per_word, __pos % __bits_per_word); 240 : __first_{0} 244 std::fill_n(__first_, _N_words, __storage_type(0)); 260 std::copy(__t, __t + sizeof(__t) / sizeof(__t[0]), __first_); 262 …__first_ + sizeof(__t) / sizeof(__t[0]), __first_ + sizeof(__first_) / sizeof(__first_[0]), __stor… 267 __first_[0] = __v; [all …]
|
| H A D | iomanip | 458 const _CharT* __first_; 464 : __first_(__f), __last_(__l), __delim_(__d), __escape_(__e) {} 469 return std::__quoted_output(__os, __p.__first_, __p.__last_, __p.__delim_, __p.__escape_);
|
| H A D | regex | 1325 const _CharT* __first_; 1336 __first_(nullptr), 1384 __node<_CharT>* __first_; 1387 _LIBCPP_HIDE_FROM_ABI explicit __has_one_state(__node<_CharT>* __s) : __first_(__s) {} 1389 _LIBCPP_HIDE_FROM_ABI __node<_CharT>* first() const { return __first_; } 1390 _LIBCPP_HIDE_FROM_ABI __node<_CharT>*& first() { return __first_; } 1804 if (__s.__first_ != __s.__last_) { 1810 …} else if (__s.__current_ == __s.__first_ && !(__s.__flags_ & regex_constants::match_prev_avail)) { 1856 …if (__s.__at_first_ && __s.__current_ == __s.__first_ && !(__s.__flags_ & regex_constants::match_n… 2723 __s.__at_first_ && __s.__current_ == __s.__first_); [all …]
|
| H A D | deque | 2055 std::swap(__map_.__first_, __buf.__first_); 2132 std::swap(__map_.__first_, __buf.__first_); 2178 std::swap(__map_.__first_, __buf.__first_); 2257 std::swap(__map_.__first_, __buf.__first_);
|
| H A D | vector | 1059 __v.__first_ = __v.__begin_; 1089 __v.__first_ = __v.__begin_;
|
| /src/contrib/llvm-project/libcxx/src/ |
| H A D | memory_resource.cpp | 150 while (__first_ != nullptr) { in __release_ptr() 151 __chunk_footer* next = __first_->__next_; in __release_ptr() 152 upstream->deallocate(__first_->__start_, __first_->__allocation_size(), __first_->__align_); in __release_ptr() 153 __first_ = next; in __release_ptr() 169 h->__next_ = __first_; in __do_allocate() 172 __first_ = h; in __do_allocate() 178 …_LIBCPP_ASSERT_NON_NULL(__first_ != nullptr, "deallocating a block that was not allocated with thi… in __do_deallocate() 179 if (__first_->__start_ == p) { in __do_deallocate() 180 __chunk_footer* next = __first_->__next_; in __do_deallocate() 181 upstream->deallocate(p, __first_->__allocation_size(), __first_->__align_); in __do_deallocate() [all …]
|
| /src/contrib/llvm-project/libcxx/include/__functional/ |
| H A D | boyer_moore_searcher.h | 108 : __first_(__first), in __first_() function 121 __build_suffix_table(__first_, __last_, __pred_); in __first_() 132 if (__first_ == __last_) in operator() 141 _RandomAccessIterator1 __first_; 157 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search() 239 : __first_(__first), in __first_() function 263 if (__first_ == __last_) in operator() 273 _RandomAccessIterator1 __first_; 288 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search()
|
| H A D | default_searcher.h | 34 : __first_(__f), __last_(__l), __pred_(__p) {} in __first_() function 40 return std::__search_impl(__f, __l, __first_, __last_, __pred_, __proj, __proj); in operator() 44 _ForwardIterator __first_;
|
| /src/contrib/llvm-project/libcxx/include/experimental/ |
| H A D | iterator | 86 : __output_iter_(std::addressof(__os)), __delim_(std::move(__d)), __first_(true) {} 89 : __output_iter_(std::addressof(__os)), __delim_(__d), __first_(true) {} 93 if (!__first_) 95 __first_ = false; 107 bool __first_;
|
| /src/contrib/llvm-project/libcxx/include/__memory_resource/ |
| H A D | unsynchronized_pool_resource.h | 35 __chunk_footer* __first_; variable 38 _LIBCPP_HIDE_FROM_ABI explicit __adhoc_pool() : __first_(nullptr) {} in __adhoc_pool()
|
| /src/contrib/llvm-project/libcxx/include/__memory/ |
| H A D | uninitialized_algorithms.h | 526 : __alloc_(__alloc), __first_(__first), __last_(__last) {} in _AllocatorDestroyRangeReverse() 529 …r_destroy(__alloc_, std::reverse_iterator<_Iter>(__last_), std::reverse_iterator<_Iter>(__first_)); in operator() 534 _Iter& __first_; variable
|