xref: /llvm-project/libcxx/include/__cxx03/__string/constexpr_c_functions.h (revision ce7771902dc50d900de639d499a60486b83f70e0)
1e78f53d1SNikolas Klauser //===----------------------------------------------------------------------===//
2e78f53d1SNikolas Klauser //
3e78f53d1SNikolas Klauser // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4e78f53d1SNikolas Klauser // See https://llvm.org/LICENSE.txt for license information.
5e78f53d1SNikolas Klauser // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6e78f53d1SNikolas Klauser //
7e78f53d1SNikolas Klauser //===----------------------------------------------------------------------===//
8e78f53d1SNikolas Klauser 
9*ce777190SNikolas Klauser #ifndef _LIBCPP___CXX03___STRING_CONSTEXPR_C_FUNCTIONS_H
10*ce777190SNikolas Klauser #define _LIBCPP___CXX03___STRING_CONSTEXPR_C_FUNCTIONS_H
11e78f53d1SNikolas Klauser 
1273fbae83SNikolas Klauser #include <__cxx03/__config>
1373fbae83SNikolas Klauser #include <__cxx03/__memory/addressof.h>
1473fbae83SNikolas Klauser #include <__cxx03/__memory/construct_at.h>
1573fbae83SNikolas Klauser #include <__cxx03/__type_traits/datasizeof.h>
1673fbae83SNikolas Klauser #include <__cxx03/__type_traits/is_always_bitcastable.h>
1773fbae83SNikolas Klauser #include <__cxx03/__type_traits/is_assignable.h>
1873fbae83SNikolas Klauser #include <__cxx03/__type_traits/is_constant_evaluated.h>
1973fbae83SNikolas Klauser #include <__cxx03/__type_traits/is_constructible.h>
2073fbae83SNikolas Klauser #include <__cxx03/__type_traits/is_equality_comparable.h>
2173fbae83SNikolas Klauser #include <__cxx03/__type_traits/is_same.h>
2273fbae83SNikolas Klauser #include <__cxx03/__type_traits/is_trivially_copyable.h>
2373fbae83SNikolas Klauser #include <__cxx03/__type_traits/is_trivially_lexicographically_comparable.h>
2473fbae83SNikolas Klauser #include <__cxx03/__type_traits/remove_cv.h>
2573fbae83SNikolas Klauser #include <__cxx03/__utility/is_pointer_in_range.h>
2673fbae83SNikolas Klauser #include <__cxx03/cstddef>
27e78f53d1SNikolas Klauser 
28e78f53d1SNikolas Klauser #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
29e78f53d1SNikolas Klauser #  pragma GCC system_header
30e78f53d1SNikolas Klauser #endif
31e78f53d1SNikolas Klauser 
32e78f53d1SNikolas Klauser _LIBCPP_BEGIN_NAMESPACE_STD
33e78f53d1SNikolas Klauser 
34e78f53d1SNikolas Klauser // Type used to encode that a function takes an integer that represents a number
35e78f53d1SNikolas Klauser // of elements as opposed to a number of bytes.
36e78f53d1SNikolas Klauser enum class __element_count : size_t {};
37e78f53d1SNikolas Klauser 
38e78f53d1SNikolas Klauser template <class _Tp>
39e78f53d1SNikolas Klauser inline const bool __is_char_type = false;
40e78f53d1SNikolas Klauser 
41e78f53d1SNikolas Klauser template <>
42e78f53d1SNikolas Klauser inline const bool __is_char_type<char> = true;
43e78f53d1SNikolas Klauser 
44e78f53d1SNikolas Klauser #ifndef _LIBCPP_HAS_NO_CHAR8_T
45e78f53d1SNikolas Klauser template <>
46e78f53d1SNikolas Klauser inline const bool __is_char_type<char8_t> = true;
47e78f53d1SNikolas Klauser #endif
48e78f53d1SNikolas Klauser 
49e78f53d1SNikolas Klauser template <class _Tp>
50e78f53d1SNikolas Klauser inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 size_t __constexpr_strlen(const _Tp* __str) _NOEXCEPT {
51e78f53d1SNikolas Klauser   static_assert(__is_char_type<_Tp>, "__constexpr_strlen only works with char and char8_t");
52e78f53d1SNikolas Klauser   // GCC currently doesn't support __builtin_strlen for heap-allocated memory during constant evaluation.
53e78f53d1SNikolas Klauser   // https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70816
54e78f53d1SNikolas Klauser   if (__libcpp_is_constant_evaluated()) {
55e78f53d1SNikolas Klauser #if _LIBCPP_STD_VER >= 17 && defined(_LIBCPP_COMPILER_CLANG_BASED)
56e78f53d1SNikolas Klauser     if constexpr (is_same_v<_Tp, char>)
57e78f53d1SNikolas Klauser       return __builtin_strlen(__str);
58e78f53d1SNikolas Klauser #endif
59e78f53d1SNikolas Klauser     size_t __i = 0;
60e78f53d1SNikolas Klauser     for (; __str[__i] != '\0'; ++__i)
61e78f53d1SNikolas Klauser       ;
62e78f53d1SNikolas Klauser     return __i;
63e78f53d1SNikolas Klauser   }
64e78f53d1SNikolas Klauser   return __builtin_strlen(reinterpret_cast<const char*>(__str));
65e78f53d1SNikolas Klauser }
66e78f53d1SNikolas Klauser 
67e78f53d1SNikolas Klauser // Because of __libcpp_is_trivially_lexicographically_comparable we know that comparing the object representations is
68e78f53d1SNikolas Klauser // equivalent to a std::memcmp. Since we have multiple objects contiguously in memory, we can call memcmp once instead
69e78f53d1SNikolas Klauser // of invoking it on every object individually.
70e78f53d1SNikolas Klauser template <class _Tp, class _Up>
71e78f53d1SNikolas Klauser _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 int
72e78f53d1SNikolas Klauser __constexpr_memcmp(const _Tp* __lhs, const _Up* __rhs, __element_count __n) {
73e78f53d1SNikolas Klauser   static_assert(__libcpp_is_trivially_lexicographically_comparable<_Tp, _Up>::value,
74e78f53d1SNikolas Klauser                 "_Tp and _Up have to be trivially lexicographically comparable");
75e78f53d1SNikolas Klauser 
76e78f53d1SNikolas Klauser   auto __count = static_cast<size_t>(__n);
77e78f53d1SNikolas Klauser 
78e78f53d1SNikolas Klauser   if (__libcpp_is_constant_evaluated()) {
79e78f53d1SNikolas Klauser #ifdef _LIBCPP_COMPILER_CLANG_BASED
80e78f53d1SNikolas Klauser     if (sizeof(_Tp) == 1 && !is_same<_Tp, bool>::value)
81e78f53d1SNikolas Klauser       return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp));
82e78f53d1SNikolas Klauser #endif
83e78f53d1SNikolas Klauser 
84e78f53d1SNikolas Klauser     while (__count != 0) {
85e78f53d1SNikolas Klauser       if (*__lhs < *__rhs)
86e78f53d1SNikolas Klauser         return -1;
87e78f53d1SNikolas Klauser       if (*__rhs < *__lhs)
88e78f53d1SNikolas Klauser         return 1;
89e78f53d1SNikolas Klauser 
90e78f53d1SNikolas Klauser       --__count;
91e78f53d1SNikolas Klauser       ++__lhs;
92e78f53d1SNikolas Klauser       ++__rhs;
93e78f53d1SNikolas Klauser     }
94e78f53d1SNikolas Klauser     return 0;
95e78f53d1SNikolas Klauser   } else {
96e78f53d1SNikolas Klauser     return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp));
97e78f53d1SNikolas Klauser   }
98e78f53d1SNikolas Klauser }
99e78f53d1SNikolas Klauser 
100e78f53d1SNikolas Klauser // Because of __libcpp_is_trivially_equality_comparable we know that comparing the object representations is equivalent
101e78f53d1SNikolas Klauser // to a std::memcmp(...) == 0. Since we have multiple objects contiguously in memory, we can call memcmp once instead
102e78f53d1SNikolas Klauser // of invoking it on every object individually.
103e78f53d1SNikolas Klauser template <class _Tp, class _Up>
104e78f53d1SNikolas Klauser _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 bool
105e78f53d1SNikolas Klauser __constexpr_memcmp_equal(const _Tp* __lhs, const _Up* __rhs, __element_count __n) {
106e78f53d1SNikolas Klauser   static_assert(__libcpp_is_trivially_equality_comparable<_Tp, _Up>::value,
107e78f53d1SNikolas Klauser                 "_Tp and _Up have to be trivially equality comparable");
108e78f53d1SNikolas Klauser 
109e78f53d1SNikolas Klauser   auto __count = static_cast<size_t>(__n);
110e78f53d1SNikolas Klauser 
111e78f53d1SNikolas Klauser   if (__libcpp_is_constant_evaluated()) {
112e78f53d1SNikolas Klauser #ifdef _LIBCPP_COMPILER_CLANG_BASED
113e78f53d1SNikolas Klauser     if (sizeof(_Tp) == 1 && is_integral<_Tp>::value && !is_same<_Tp, bool>::value)
114e78f53d1SNikolas Klauser       return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)) == 0;
115e78f53d1SNikolas Klauser #endif
116e78f53d1SNikolas Klauser     while (__count != 0) {
117e78f53d1SNikolas Klauser       if (*__lhs != *__rhs)
118e78f53d1SNikolas Klauser         return false;
119e78f53d1SNikolas Klauser 
120e78f53d1SNikolas Klauser       --__count;
121e78f53d1SNikolas Klauser       ++__lhs;
122e78f53d1SNikolas Klauser       ++__rhs;
123e78f53d1SNikolas Klauser     }
124e78f53d1SNikolas Klauser     return true;
125e78f53d1SNikolas Klauser   } else {
126e78f53d1SNikolas Klauser     return ::__builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)) == 0;
127e78f53d1SNikolas Klauser   }
128e78f53d1SNikolas Klauser }
129e78f53d1SNikolas Klauser 
130e78f53d1SNikolas Klauser template <class _Tp, class _Up>
131e78f53d1SNikolas Klauser _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp* __constexpr_memchr(_Tp* __str, _Up __value, size_t __count) {
132e78f53d1SNikolas Klauser   static_assert(sizeof(_Tp) == 1 && __libcpp_is_trivially_equality_comparable<_Tp, _Up>::value,
133e78f53d1SNikolas Klauser                 "Calling memchr on non-trivially equality comparable types is unsafe.");
134e78f53d1SNikolas Klauser 
135e78f53d1SNikolas Klauser   if (__libcpp_is_constant_evaluated()) {
136e78f53d1SNikolas Klauser // use __builtin_char_memchr to optimize constexpr evaluation if we can
137e78f53d1SNikolas Klauser #if _LIBCPP_STD_VER >= 17 && __has_builtin(__builtin_char_memchr)
138e78f53d1SNikolas Klauser     if constexpr (is_same_v<remove_cv_t<_Tp>, char> && is_same_v<remove_cv_t<_Up>, char>)
139e78f53d1SNikolas Klauser       return __builtin_char_memchr(__str, __value, __count);
140e78f53d1SNikolas Klauser #endif
141e78f53d1SNikolas Klauser 
142e78f53d1SNikolas Klauser     for (; __count; --__count) {
143e78f53d1SNikolas Klauser       if (*__str == __value)
144e78f53d1SNikolas Klauser         return __str;
145e78f53d1SNikolas Klauser       ++__str;
146e78f53d1SNikolas Klauser     }
147e78f53d1SNikolas Klauser     return nullptr;
148e78f53d1SNikolas Klauser   } else {
149e78f53d1SNikolas Klauser     char __value_buffer = 0;
150e78f53d1SNikolas Klauser     __builtin_memcpy(&__value_buffer, &__value, sizeof(char));
151e78f53d1SNikolas Klauser     return static_cast<_Tp*>(__builtin_memchr(__str, __value_buffer, __count));
152e78f53d1SNikolas Klauser   }
153e78f53d1SNikolas Klauser }
154e78f53d1SNikolas Klauser 
155e78f53d1SNikolas Klauser // This function performs an assignment to an existing, already alive TriviallyCopyable object
156e78f53d1SNikolas Klauser // from another TriviallyCopyable object.
157e78f53d1SNikolas Klauser //
158e78f53d1SNikolas Klauser // It basically works around the fact that TriviallyCopyable objects are not required to be
159e78f53d1SNikolas Klauser // syntactically copy/move constructible or copy/move assignable. Technically, only one of the
160e78f53d1SNikolas Klauser // four operations is required to be syntactically valid -- but at least one definitely has to
161e78f53d1SNikolas Klauser // be valid.
162e78f53d1SNikolas Klauser //
163e78f53d1SNikolas Klauser // This is necessary in order to implement __constexpr_memmove below in a way that mirrors as
164e78f53d1SNikolas Klauser // closely as possible what the compiler's __builtin_memmove is able to do.
165e78f53d1SNikolas Klauser template <class _Tp, class _Up, __enable_if_t<is_assignable<_Tp&, _Up const&>::value, int> = 0>
166e78f53d1SNikolas Klauser _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp& __assign_trivially_copyable(_Tp& __dest, _Up const& __src) {
167e78f53d1SNikolas Klauser   __dest = __src;
168e78f53d1SNikolas Klauser   return __dest;
169e78f53d1SNikolas Klauser }
170e78f53d1SNikolas Klauser 
171e78f53d1SNikolas Klauser // clang-format off
172e78f53d1SNikolas Klauser template <class _Tp, class _Up, __enable_if_t<!is_assignable<_Tp&, _Up const&>::value &&
173e78f53d1SNikolas Klauser                                                is_assignable<_Tp&, _Up&&>::value, int> = 0>
174e78f53d1SNikolas Klauser // clang-format on
175e78f53d1SNikolas Klauser _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp& __assign_trivially_copyable(_Tp& __dest, _Up& __src) {
176e78f53d1SNikolas Klauser   __dest =
177e78f53d1SNikolas Klauser       static_cast<_Up&&>(__src); // this is safe, we're not actually moving anything since the assignment is trivial
178e78f53d1SNikolas Klauser   return __dest;
179e78f53d1SNikolas Klauser }
180e78f53d1SNikolas Klauser 
181e78f53d1SNikolas Klauser // clang-format off
182e78f53d1SNikolas Klauser template <class _Tp, class _Up, __enable_if_t<!is_assignable<_Tp&, _Up const&>::value &&
183e78f53d1SNikolas Klauser                                               !is_assignable<_Tp&, _Up&&>::value &&
184e78f53d1SNikolas Klauser                                                is_constructible<_Tp, _Up const&>::value, int> = 0>
185e78f53d1SNikolas Klauser // clang-format on
186e78f53d1SNikolas Klauser _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp& __assign_trivially_copyable(_Tp& __dest, _Up const& __src) {
187e78f53d1SNikolas Klauser   // _Tp is trivially destructible, so we don't need to call its destructor to end the lifetime of the object
188e78f53d1SNikolas Klauser   // that was there previously
189e78f53d1SNikolas Klauser   std::__construct_at(std::addressof(__dest), __src);
190e78f53d1SNikolas Klauser   return __dest;
191e78f53d1SNikolas Klauser }
192e78f53d1SNikolas Klauser 
193e78f53d1SNikolas Klauser // clang-format off
194e78f53d1SNikolas Klauser template <class _Tp, class _Up, __enable_if_t<!is_assignable<_Tp&, _Up const&>::value &&
195e78f53d1SNikolas Klauser                                               !is_assignable<_Tp&, _Up&&>::value &&
196e78f53d1SNikolas Klauser                                               !is_constructible<_Tp, _Up const&>::value &&
197e78f53d1SNikolas Klauser                                                is_constructible<_Tp, _Up&&>::value, int> = 0>
198e78f53d1SNikolas Klauser // clang-format on
199e78f53d1SNikolas Klauser _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp& __assign_trivially_copyable(_Tp& __dest, _Up& __src) {
200e78f53d1SNikolas Klauser   // _Tp is trivially destructible, so we don't need to call its destructor to end the lifetime of the object
201e78f53d1SNikolas Klauser   // that was there previously
202e78f53d1SNikolas Klauser   std::__construct_at(
203e78f53d1SNikolas Klauser       std::addressof(__dest),
204e78f53d1SNikolas Klauser       static_cast<_Up&&>(__src)); // this is safe, we're not actually moving anything since the constructor is trivial
205e78f53d1SNikolas Klauser   return __dest;
206e78f53d1SNikolas Klauser }
207e78f53d1SNikolas Klauser 
208e78f53d1SNikolas Klauser template <class _Tp, class _Up, __enable_if_t<__is_always_bitcastable<_Up, _Tp>::value, int> = 0>
209e78f53d1SNikolas Klauser _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp*
210e78f53d1SNikolas Klauser __constexpr_memmove(_Tp* __dest, _Up* __src, __element_count __n) {
211e78f53d1SNikolas Klauser   size_t __count = static_cast<size_t>(__n);
212e78f53d1SNikolas Klauser   if (__libcpp_is_constant_evaluated()) {
213e78f53d1SNikolas Klauser #ifdef _LIBCPP_COMPILER_CLANG_BASED
214e78f53d1SNikolas Klauser     if (is_same<__remove_cv_t<_Tp>, __remove_cv_t<_Up> >::value) {
215e78f53d1SNikolas Klauser       ::__builtin_memmove(__dest, __src, __count * sizeof(_Tp));
216e78f53d1SNikolas Klauser       return __dest;
217e78f53d1SNikolas Klauser     }
218e78f53d1SNikolas Klauser #endif
219e78f53d1SNikolas Klauser     if (std::__is_pointer_in_range(__src, __src + __count, __dest)) {
220e78f53d1SNikolas Klauser       for (; __count > 0; --__count)
221e78f53d1SNikolas Klauser         std::__assign_trivially_copyable(__dest[__count - 1], __src[__count - 1]);
222e78f53d1SNikolas Klauser     } else {
223e78f53d1SNikolas Klauser       for (size_t __i = 0; __i != __count; ++__i)
224e78f53d1SNikolas Klauser         std::__assign_trivially_copyable(__dest[__i], __src[__i]);
225e78f53d1SNikolas Klauser     }
226e78f53d1SNikolas Klauser   } else if (__count > 0) {
227e78f53d1SNikolas Klauser     ::__builtin_memmove(__dest, __src, (__count - 1) * sizeof(_Tp) + __datasizeof_v<_Tp>);
228e78f53d1SNikolas Klauser   }
229e78f53d1SNikolas Klauser   return __dest;
230e78f53d1SNikolas Klauser }
231e78f53d1SNikolas Klauser 
232e78f53d1SNikolas Klauser _LIBCPP_END_NAMESPACE_STD
233e78f53d1SNikolas Klauser 
234*ce777190SNikolas Klauser #endif // _LIBCPP___CXX03___STRING_CONSTEXPR_C_FUNCTIONS_H
235