| /openbsd/gnu/llvm/libcxx/src/support/win32/ |
| H A D | locale_win32.cpp | 29 __libcpp_locale_guard __current(__l); in MB_CUR_MAX_L()
36 __libcpp_locale_guard __current(loc); in localeconv_l() local
45 __libcpp_locale_guard __current(loc); in mbrlen_l() local
51 __libcpp_locale_guard __current(loc); in mbsrtowcs_l() local
57 __libcpp_locale_guard __current(loc); in wcrtomb_l() local
63 __libcpp_locale_guard __current(loc); in mbrtowc_l() local
69 __libcpp_locale_guard __current(loc); in mbsnrtowcs_l() local
75 __libcpp_locale_guard __current(loc); in wcsnrtombs_l() local
125 __libcpp_locale_guard __current(loc); in strtof_l() local
130 __libcpp_locale_guard __current(loc); in strtold_l() local
[all …]
|
| /openbsd/gnu/llvm/libcxx/include/ |
| H A D | __bsd_locale_fallbacks.h | 28 __libcpp_locale_guard __current(__l); in decltype()
36 __libcpp_locale_guard __current(__l); in __libcpp_btowc_l()
43 __libcpp_locale_guard __current(__l); in __libcpp_wctob_l()
51 __libcpp_locale_guard __current(__l); in __libcpp_wcsnrtombs_l()
58 __libcpp_locale_guard __current(__l); in __libcpp_wcrtomb_l()
66 __libcpp_locale_guard __current(__l); in __libcpp_mbsnrtowcs_l()
74 __libcpp_locale_guard __current(__l); in __libcpp_mbrtowc_l()
81 __libcpp_locale_guard __current(__l); in __libcpp_mbtowc_l()
88 __libcpp_locale_guard __current(__l); in __libcpp_mbrlen_l()
96 __libcpp_locale_guard __current(__l); in __libcpp_localeconv_l()
[all …]
|
| H A D | barrier | 269 uint64_t const __current = __phase_arrived_expected.load(memory_order_acquire);
270 return ((__current & __phase_bit) != __phase);
|
| /openbsd/gnu/llvm/libcxx/src/ |
| H A D | barrier.cpp | 45 __current = hash<thread::id>()(this_thread::get_id()) % ((__expected + 1) >> 1); in __arrive() local
51 for(;;++__current) { in __arrive()
52 if(__current == __end_node) in __arrive()
53 __current = 0; in __arrive()
55 if(__current == __last_node && (__current_expected & 1)) in __arrive()
57 …if(__state[__current].__tickets[__round].__phase.compare_exchange_strong(expect, __full_step, memo… in __arrive()
60 …else if(__state[__current].__tickets[__round].__phase.compare_exchange_strong(expect, __half_step,… in __arrive()
66 …if(__state[__current].__tickets[__round].__phase.compare_exchange_strong(expect, __full_step, memo… in __arrive()
71 __current >>= 1; in __arrive()
|
| /openbsd/gnu/llvm/libcxx/include/__ranges/ |
| H A D | lazy_split_view.h | 222 if (__current() == __end) {
230 ++__current();
234 __current() = ranges::find(std::move(__current()), __end, *__pbegin);
235 if (__current() != __end) {
237 ++__current();
238 if (__current() == __end)
247 __current() = __b;
325 auto __cur = __i_.__current();
344 return __i_.__current();
349 return __i_.__current();
[all …]
|
| H A D | split_view.h | 138 …split_view<_View, _Pattern>& __parent, iterator_t<_View> __current, subrange<iterator_t<_View>> __…
139 … : __parent_(std::addressof(__parent)), __cur_(std::move(__current)), __next_(std::move(__next)) {}
|
| H A D | filter_view.h | 141 constexpr __iterator(filter_view& __parent, iterator_t<_View> __current)
142 : __current_(std::move(__current)), __parent_(std::addressof(__parent))
|
| H A D | elements_view.h | 205 …OM_ABI constexpr explicit __iterator(iterator_t<_Base> __current) : __current_(std::move(__current…
|
| H A D | transform_view.h | 187 constexpr __iterator(_Parent& __parent, iterator_t<_Base> __current)
188 : __parent_(std::addressof(__parent)), __current_(std::move(__current)) {}
|
| H A D | zip_view.h | 246 …stexpr explicit __iterator(__tuple_or_pair<iterator_t<__maybe_const<_Const, _Views>>...> __current)
247 : __current_(std::move(__current)) {}
|
| /openbsd/gnu/llvm/libcxx/include/__functional/ |
| H A D | boyer_moore_searcher.h | 163 _RandomAccessIterator2 __current = __f; in __search() local
167 while (__current <= __last) { in __search()
169 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search()
172 return std::make_pair(__current, __current + __pattern_length_); in __search()
175 difference_type __k = __skip_table[__current[__j - 1]]; in __search()
178 __current += __m; in __search()
180 __current += __suffix_[__j]; in __search()
291 _RandomAccessIterator2 __current = __f; in __search() local
295 while (__current <= __last) { in __search()
300 return std::make_pair(__current, __current + __pattern_length_); in __search()
[all …]
|
| /openbsd/gnu/llvm/libcxx/include/__iterator/ |
| H A D | bounded_iter.h | 79 _Iterator __current, _Iterator __begin, _Iterator __end) in __bounded_iter()
80 : __current_(__current), __begin_(__begin), __end_(__end) { in __bounded_iter()
|
| /openbsd/gnu/lib/libstdc++/libstdc++/include/bits/ |
| H A D | stl_algo.h | 478 _ForwardIter1 __current = __first1; in search() local
486 __current = __first1; in search()
487 if (++__current == __last1) in search()
490 while (*__current == *__p) { in search()
493 if (++__current == __last1) in search()
554 _ForwardIter1 __current = __first1; in search() local
568 __current = __first1; in search()
569 if (++__current == __last1) return __last1; in search()
571 while (__predicate(*__current, *__p)) { in search()
574 if (++__current == __last1) in search()
|
| /openbsd/gnu/gcc/libstdc++-v3/include/bits/ |
| H A D | stl_algo.h | 511 _ForwardIterator1 __current = __first1; in search() local
520 __current = __first1; in search()
521 if (++__current == __last1) in search()
524 while (*__current == *__p) in search()
528 if (++__current == __last1) in search()
589 _ForwardIterator1 __current = __first1; in search() local
605 __current = __first1; in search()
606 if (++__current == __last1) in search()
609 while (__predicate(*__current, *__p)) in search()
613 if (++__current == __last1) in search()
|