/freebsd-src/contrib/llvm-project/libcxx/modules/std/ |
H A D | algorithm.inc | 11 namespace ranges { 13 using std::ranges::in_found_result; 14 using std::ranges::in_fun_result; 15 using std::ranges::in_in_out_result; 16 using std::ranges::in_in_result; 17 using std::ranges::in_out_out_result; 18 using std::ranges::in_out_result; 20 using std::ranges::in_value_result; 22 using std::ranges::min_max_result; 23 // using std::ranges [all...] |
H A D | ranges.inc | 11 namespace ranges { 14 using std::ranges::__cpo::begin; 15 using std::ranges::__cpo::cbegin; 16 using std::ranges::__cpo::cend; 17 using std::ranges::__cpo::crbegin; 18 using std::ranges::__cpo::crend; 19 using std::ranges::__cpo::end; 20 using std::ranges::__cpo::rbegin; 21 using std::ranges::__cpo::rend; 23 using std::ranges [all...] |
H A D | memory.inc | 61 namespace ranges { 62 using std::ranges::uninitialized_default_construct; 63 using std::ranges::uninitialized_default_construct_n; 64 } // namespace ranges 69 namespace ranges { 70 using std::ranges::uninitialized_value_construct; 71 using std::ranges::uninitialized_value_construct_n; 72 } // namespace ranges 77 namespace ranges { 78 using std::ranges [all...] |
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | AddressRanges.h | 53 /// normalized address ranges collection. This class keeps a sorted vector 55 /// The address ranges are always sorted and never contain any invalid, 56 /// empty or intersected address ranges. 61 Collection Ranges; variable 64 void clear() { Ranges.clear(); } in clear() 65 bool empty() const { return Ranges.empty(); } in empty() 67 return find(Addr, Addr + 1) != Ranges.end(); in contains() 70 return find(Range.start(), Range.end()) != Ranges.end(); in contains() 72 void reserve(size_t Capacity) { Ranges.reserve(Capacity); } in reserve() 73 size_t size() const { return Ranges.size(); } in size() [all …]
|
/freebsd-src/contrib/llvm-project/libcxx/include/__ranges/ |
H A D | view_interface.h | 37 namespace ranges { 58 return ranges::size(__derived()) == 0; 60 return ranges::begin(__derived()) == ranges::end(__derived()); in empty() 69 return ranges::size(__derived()) == 0; 71 return ranges::begin(__derived()) == ranges::end(__derived()); 77 requires requires(_D2& __t) { ranges::empty(__t); } 79 return !ranges::empty(__derived()); 84 requires requires(const _D2& __t) { ranges in data() [all...] |
H A D | drop_view.h | 58 namespace ranges { 61 // We cache begin() whenever ranges::next is not guaranteed O(1) to provide an 94 const auto __dist = std::min(ranges::distance(__base_), __count_); in begin() 95 return ranges::begin(__base_) + __dist; 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() 111 return ranges::begin(__base_) + __dist; in begin() 117 return ranges in end() [all...] |
H A D | access.h | 34 namespace ranges { 37 } // namespace ranges 41 namespace ranges { 92 } // namespace ranges 96 namespace ranges { 98 using iterator_t = decltype(ranges::begin(std::declval<_Tp&>())); 99 } // namespace ranges 103 namespace ranges { 149 } // namespace ranges 153 namespace ranges { [all...] |
H A D | take_view.h | 58 namespace ranges { 92 return ranges::begin(__base_); in begin() 96 return counted_iterator(ranges::begin(__base_), static_cast<_DifferenceT>(__size)); in begin() 99 return counted_iterator(ranges::begin(__base_), __count_); in begin() 108 return ranges::begin(__base_); in begin() 112 return counted_iterator(ranges::begin(__base_), static_cast<_DifferenceT>(__size)); in begin() 115 return counted_iterator(ranges::begin(__base_), __count_); in begin() 124 return ranges::begin(__base_) + size(); in end() 129 return __sentinel<false>{ranges::end(__base_)}; in end() 138 return ranges in end() [all...] |
H A D | rend.h | 37 namespace ranges { 41 ranges::rbegin(__t); in requires() 42 { _LIBCPP_AUTO_CAST(__t.rend()) } -> sentinel_for<decltype(ranges::rbegin(__t))>; in requires() 50 ranges::rbegin(__t); 51 { _LIBCPP_AUTO_CAST(rend(__t)) } -> sentinel_for<decltype(ranges::rbegin(__t))>; 56 { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>; 57 { ranges::begin(__t) } -> bidirectional_iterator; 79 noexcept(noexcept(ranges::begin(__t))) { in operator() 80 return std::make_reverse_iterator(ranges in operator() [all...] |
H A D | size.h | 35 namespace ranges { 38 } // namespace ranges 42 namespace ranges { 63 { ranges::begin(__t) } -> forward_iterator; 64 { ranges::end(__t) } -> sized_sentinel_for<decltype(ranges::begin(std::declval<_Tp>()))>; 97 noexcept(noexcept(std::__to_unsigned_like(ranges::end(__t) - ranges::begin(__t)))) 98 -> decltype(std::__to_unsigned_like(ranges::end(__t) - ranges [all...] |
H A D | zip_view.h | 53 namespace ranges { 103 return ranges::__tuple_zip_transform( in __tuple_zip_transform() 120 return ranges::__tuple_zip_for_each( in __tuple_zip_for_each() 129 const auto __equals = ranges::__tuple_zip_transform(std::equal_to<>(), __tuple1, __tuple2); in __tuple_any_equals() 159 return __iterator<false>(ranges::__tuple_transform(ranges::begin, __views_)); in requires() 165 return __iterator<true>(ranges::__tuple_transform(ranges::begin, __views_)); in requires() 172 return __sentinel<false>(ranges::__tuple_transform(ranges in requires() [all...] |
H A D | rbegin.h | 34 // [ranges.access.rbegin] 36 namespace ranges { 54 { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>; 55 { ranges::begin(__t) } -> bidirectional_iterator; 75 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const noexcept(noexcept(ranges::end(__t))) { 76 return std::make_reverse_iterator(ranges::end(__t)); in operator() 86 } // namespace ranges 90 namespace ranges { 96 noexcept(noexcept(ranges [all...] |
/freebsd-src/contrib/llvm-project/libcxx/include/ |
H A D | algorithm | 21 namespace ranges { 49 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> // since C++20 53 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20 57 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 58 constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 61 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 62 constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 68 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 74 class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 79 requires indirect_binary_predicate<ranges [all...] |
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | UnicodeCharRanges.h | 1 //===--- UnicodeCharRanges.h - Types and functions for character ranges ---===// 45 /// Array pointed by \p Ranges should have the lifetime at least as long as 48 /// instances per each array of ranges, as possible. 55 constexpr UnicodeCharSet(CharRanges Ranges) : Ranges(Ranges) {} in UnicodeCharSet() argument 57 UnicodeCharSet(CharRanges Ranges) : Ranges(Ranges) { in UnicodeCharSet() argument 65 return std::binary_search(Ranges.begin(), Ranges.end(), C); in contains() 69 /// Returns true if each of the ranges is a proper closed range 70 /// [min, max], and if the ranges themselves are ordered and non-overlapping. 73 for (CharRanges::const_iterator I = Ranges.begin(), E = Ranges.end(); in rangesAreValid() 75 if (I != Ranges.begin() && Prev >= I->Lower) { in rangesAreValid() [all …]
|
/freebsd-src/share/man/man9/ |
H A D | sglist.9 | 114 API manages physical address ranges. 148 the physical address ranges mapped by a single kernel virtual address range. 160 The ranges start at an offset of 169 the physical address ranges of a buffer backed by an array of virtual memory 181 address ranges mapped by a single kernel virtual address range. 233 family of routines can be used to append the physical address ranges described 241 function appends the physical address ranges described by a single kernel 252 function appends the physical address ranges described by a single bio 259 function appends the physical address ranges described by the 266 The physical address ranges star [all...] |
/freebsd-src/sys/contrib/device-tree/src/powerpc/fsl/ |
H A D | cyrus_p5020.dts | 27 ranges; 44 ranges = <0x00000000 0xf 0x00000000 0x01008000>; 48 ranges = <0x0 0xf 0xf4000000 0x200000>; 52 ranges = <0x0 0xf 0xf4200000 0x200000>; 56 ranges = <0x00000000 0xf 0xfe000000 0x1000000>; 76 ranges = <0 0 0xc 0x20000000 0 0x10000000>; 79 ranges = <0 0 0xc 0x30000000 0 0x10000000>; 85 ranges = <0 0 0xf 0xe8000000 0x08000000 92 ranges = <0x02000000 0 0xe0000000 0xc 0x00000000 0x0 0x20000000 95 ranges = <0x02000000 0 0xe0000000 [all …]
|
/freebsd-src/sys/contrib/device-tree/src/arm/st/ |
H A D | stm32f746-pinctrl.dtsi | 13 gpio-ranges = <&pinctrl 0 0 16>; 17 gpio-ranges = <&pinctrl 0 16 16>; 21 gpio-ranges = <&pinctrl 0 32 16>; 25 gpio-ranges = <&pinctrl 0 48 16>; 29 gpio-ranges = <&pinctrl 0 64 16>; 33 gpio-ranges = <&pinctrl 0 80 16>; 37 gpio-ranges = <&pinctrl 0 96 16>; 41 gpio-ranges = <&pinctrl 0 112 16>; 45 gpio-ranges = <&pinctrl 0 128 16>; 49 gpio-ranges = <&pinctrl 0 144 16>; [all …]
|
H A D | stm32f769-pinctrl.dtsi | 13 gpio-ranges = <&pinctrl 0 0 16>; 17 gpio-ranges = <&pinctrl 0 16 16>; 21 gpio-ranges = <&pinctrl 0 32 16>; 25 gpio-ranges = <&pinctrl 0 48 16>; 29 gpio-ranges = <&pinctrl 0 64 16>; 33 gpio-ranges = <&pinctrl 0 80 16>; 37 gpio-ranges = <&pinctrl 0 96 16>; 41 gpio-ranges = <&pinctrl 0 112 16>; 45 gpio-ranges = <&pinctrl 0 128 16>; 49 gpio-ranges = <&pinctrl 0 144 16>; [all …]
|
H A D | stm32mp15xxaa-pinctrl.dtsi | 13 gpio-ranges = <&pinctrl 0 0 16>; 19 gpio-ranges = <&pinctrl 0 16 16>; 25 gpio-ranges = <&pinctrl 0 32 16>; 31 gpio-ranges = <&pinctrl 0 48 16>; 37 gpio-ranges = <&pinctrl 0 64 16>; 43 gpio-ranges = <&pinctrl 0 80 16>; 49 gpio-ranges = <&pinctrl 0 96 16>; 55 gpio-ranges = <&pinctrl 0 112 16>; 61 gpio-ranges = <&pinctrl 0 128 16>; 67 gpio-ranges = <&pinctrl 0 144 16>; [all …]
|
/freebsd-src/sys/contrib/device-tree/src/arm64/st/ |
H A D | stm32mp25xxai-pinctrl.dtsi | 13 gpio-ranges = <&pinctrl 0 0 16>; 19 gpio-ranges = <&pinctrl 0 16 16>; 25 gpio-ranges = <&pinctrl 0 32 14>; 31 gpio-ranges = <&pinctrl 0 48 16>; 37 gpio-ranges = <&pinctrl 0 64 16>; 43 gpio-ranges = <&pinctrl 0 80 16>; 49 gpio-ranges = <&pinctrl 0 96 16>; 55 gpio-ranges = <&pinctrl 2 114 12>; 61 gpio-ranges = <&pinctrl 0 128 16>; 67 gpio-ranges = <&pinctrl 0 144 16>; [all …]
|
/freebsd-src/sys/contrib/device-tree/src/arc/ |
H A D | abilis_tb100.dtsi | 163 gpio-ranges = <&iomux 0 0 0>; 164 gpio-ranges-group-names = "gpioa"; 176 gpio-ranges = <&iomux 0 0 0>; 177 gpio-ranges-group-names = "gpiob"; 189 gpio-ranges = <&iomux 0 0 0>; 190 gpio-ranges-group-names = "gpioc"; 202 gpio-ranges = <&iomux 0 0 0>; 203 gpio-ranges-group-names = "gpiod"; 215 gpio-ranges = <&iomux 0 0 0>; 216 gpio-ranges-group-names = "gpioe"; [all …]
|
H A D | abilis_tb101.dtsi | 172 gpio-ranges = <&iomux 0 0 0>; 173 gpio-ranges-group-names = "gpioa"; 185 gpio-ranges = <&iomux 0 0 0>; 186 gpio-ranges-group-names = "gpiob"; 198 gpio-ranges = <&iomux 0 0 0>; 199 gpio-ranges-group-names = "gpioc"; 211 gpio-ranges = <&iomux 0 0 0>; 212 gpio-ranges-group-names = "gpiod"; 224 gpio-ranges = <&iomux 0 0 0>; 225 gpio-ranges-group-names = "gpioe"; [all …]
|
/freebsd-src/contrib/llvm-project/clang/lib/Tooling/Inclusions/Stdlib/ |
H A D | StdSymbolMap.inc | 1372 SYMBOL(from_range, std::, <ranges>) 1373 SYMBOL(from_range_t, std::, <ranges>) 3541 SYMBOL(adjacent_find, std::ranges::, <algorithm>) 3542 SYMBOL(advance, std::ranges::, <iterator>) 3543 SYMBOL(all_of, std::ranges::, <algorithm>) 3544 SYMBOL(any_of, std::ranges::, <algorithm>) 3545 SYMBOL(as_const_view, std::ranges::, <ranges>) 3546 SYMBOL(as_rvalue_view, std::ranges::, <ranges>) 3547 SYMBOL(basic_istream_view, std::ranges::, <ranges>) 3548 SYMBOL(begin, std::ranges::, <ranges>) [all …]
|
/freebsd-src/contrib/llvm-project/libcxx/include/__algorithm/ |
H A D | ranges_ends_with.h | 38 namespace ranges { 54 return ranges::starts_with( in __ends_with_fn_impl_bidirectional() 72 auto __n1 = ranges::distance(__first1, __last1); in __ends_with_fn_impl() 73 auto __n2 = ranges::distance(__first2, __last2); in __ends_with_fn_impl() 114 ranges::advance(__first1, __offset); in __ends_with_fn_impl_with_offset() 115 return ranges::equal( in __ends_with_fn_impl_with_offset() 130 class _Pred = ranges::equal_to, 150 class _Pred = ranges::equal_to, 158 auto __n1 = ranges::size(__range1); 159 auto __n2 = ranges [all...] |
H A D | ranges_search.h | 35 namespace ranges { 48 auto __size2 = ranges::distance(__first2, __last2); in __ranges_search_impl() 53 auto __size1 = ranges::distance(__first1, __last1); in __ranges_search_impl() 55 ranges::advance(__first1, __last1); in __ranges_search_impl() 76 class _Pred = ranges::equal_to, 93 class _Pred = ranges::equal_to, 99 auto __first1 = ranges::begin(__range1); 101 auto __size2 = ranges::size(__range2); 105 auto __size1 = ranges::size(__range1); 107 ranges [all...] |