xref: /llvm-project/libcxx/include/__string/constexpr_c_functions.h (revision cedb44af53f195135e8e8de98f161048d19f8857)
1e8cb3559SNikolas Klauser //===----------------------------------------------------------------------===//
2e8cb3559SNikolas Klauser //
3e8cb3559SNikolas Klauser // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4e8cb3559SNikolas Klauser // See https://llvm.org/LICENSE.txt for license information.
5e8cb3559SNikolas Klauser // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6e8cb3559SNikolas Klauser //
7e8cb3559SNikolas Klauser //===----------------------------------------------------------------------===//
8e8cb3559SNikolas Klauser 
9e8cb3559SNikolas Klauser #ifndef _LIBCPP___STRING_CONSTEXPR_C_FUNCTIONS_H
10e8cb3559SNikolas Klauser #define _LIBCPP___STRING_CONSTEXPR_C_FUNCTIONS_H
11e8cb3559SNikolas Klauser 
12e8cb3559SNikolas Klauser #include <__config>
13e99c4906SNikolas Klauser #include <__cstddef/size_t.h>
146f36ead5SLouis Dionne #include <__memory/addressof.h>
156f36ead5SLouis Dionne #include <__memory/construct_at.h>
16c4e98722SNikolas Klauser #include <__type_traits/datasizeof.h>
17d6832a61SLouis Dionne #include <__type_traits/enable_if.h>
18c4e98722SNikolas Klauser #include <__type_traits/is_always_bitcastable.h>
196f36ead5SLouis Dionne #include <__type_traits/is_assignable.h>
20e8cb3559SNikolas Klauser #include <__type_traits/is_constant_evaluated.h>
216f36ead5SLouis Dionne #include <__type_traits/is_constructible.h>
22b4ecfd3cSNikolas Klauser #include <__type_traits/is_equality_comparable.h>
23d6832a61SLouis Dionne #include <__type_traits/is_integral.h>
24b4ecfd3cSNikolas Klauser #include <__type_traits/is_same.h>
25c4e98722SNikolas Klauser #include <__type_traits/is_trivially_copyable.h>
26746cf7e3SNikolas Klauser #include <__type_traits/is_trivially_lexicographically_comparable.h>
271fd08eddSNikolas Klauser #include <__type_traits/remove_cv.h>
28*cedb44afSLouis Dionne #include <__utility/element_count.h>
29c4e98722SNikolas Klauser #include <__utility/is_pointer_in_range.h>
30e8cb3559SNikolas Klauser 
31e8cb3559SNikolas Klauser #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
32e8cb3559SNikolas Klauser #  pragma GCC system_header
33e8cb3559SNikolas Klauser #endif
34e8cb3559SNikolas Klauser 
35e8cb3559SNikolas Klauser _LIBCPP_BEGIN_NAMESPACE_STD
36e8cb3559SNikolas Klauser 
3729312d39SNikolas Klauser template <class _Tp>
3829312d39SNikolas Klauser inline const bool __is_char_type = false;
3929312d39SNikolas Klauser 
4029312d39SNikolas Klauser template <>
4129312d39SNikolas Klauser inline const bool __is_char_type<char> = true;
4229312d39SNikolas Klauser 
43ba87515fSNikolas Klauser #if _LIBCPP_HAS_CHAR8_T
4429312d39SNikolas Klauser template <>
4529312d39SNikolas Klauser inline const bool __is_char_type<char8_t> = true;
4629312d39SNikolas Klauser #endif
4729312d39SNikolas Klauser 
4829312d39SNikolas Klauser template <class _Tp>
4929312d39SNikolas Klauser inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 size_t __constexpr_strlen(const _Tp* __str) _NOEXCEPT {
5029312d39SNikolas Klauser   static_assert(__is_char_type<_Tp>, "__constexpr_strlen only works with char and char8_t");
51e8cb3559SNikolas Klauser   // GCC currently doesn't support __builtin_strlen for heap-allocated memory during constant evaluation.
52e8cb3559SNikolas Klauser   // https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70816
53e8cb3559SNikolas Klauser   if (__libcpp_is_constant_evaluated()) {
5429312d39SNikolas Klauser #if _LIBCPP_STD_VER >= 17 && defined(_LIBCPP_COMPILER_CLANG_BASED)
5529312d39SNikolas Klauser     if constexpr (is_same_v<_Tp, char>)
5629312d39SNikolas Klauser       return __builtin_strlen(__str);
5729312d39SNikolas Klauser #endif
58e8cb3559SNikolas Klauser     size_t __i = 0;
59e8cb3559SNikolas Klauser     for (; __str[__i] != '\0'; ++__i)
60e8cb3559SNikolas Klauser       ;
61e8cb3559SNikolas Klauser     return __i;
62e8cb3559SNikolas Klauser   }
6329312d39SNikolas Klauser   return __builtin_strlen(reinterpret_cast<const char*>(__str));
64e8cb3559SNikolas Klauser }
65e8cb3559SNikolas Klauser 
66d07fdf97SNikolas Klauser // Because of __is_trivially_lexicographically_comparable_v we know that comparing the object representations is
67746cf7e3SNikolas Klauser // equivalent to a std::memcmp. Since we have multiple objects contiguously in memory, we can call memcmp once instead
68746cf7e3SNikolas Klauser // of invoking it on every object individually.
69b4ecfd3cSNikolas Klauser template <class _Tp, class _Up>
70e8cb3559SNikolas Klauser _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 int
71355f4667SNikolas Klauser __constexpr_memcmp(const _Tp* __lhs, const _Up* __rhs, __element_count __n) {
72d07fdf97SNikolas Klauser   static_assert(__is_trivially_lexicographically_comparable_v<_Tp, _Up>,
73746cf7e3SNikolas Klauser                 "_Tp and _Up have to be trivially lexicographically comparable");
74b4ecfd3cSNikolas Klauser 
75355f4667SNikolas Klauser   auto __count = static_cast<size_t>(__n);
76355f4667SNikolas Klauser 
77e8cb3559SNikolas Klauser   if (__libcpp_is_constant_evaluated()) {
78b4ecfd3cSNikolas Klauser #ifdef _LIBCPP_COMPILER_CLANG_BASED
79b4ecfd3cSNikolas Klauser     if (sizeof(_Tp) == 1 && !is_same<_Tp, bool>::value)
80355f4667SNikolas Klauser       return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp));
81b4ecfd3cSNikolas Klauser #endif
82b4ecfd3cSNikolas Klauser 
83b4ecfd3cSNikolas Klauser     while (__count != 0) {
84e8cb3559SNikolas Klauser       if (*__lhs < *__rhs)
85e8cb3559SNikolas Klauser         return -1;
86e8cb3559SNikolas Klauser       if (*__rhs < *__lhs)
87e8cb3559SNikolas Klauser         return 1;
88b4ecfd3cSNikolas Klauser 
89355f4667SNikolas Klauser       --__count;
90b4ecfd3cSNikolas Klauser       ++__lhs;
91b4ecfd3cSNikolas Klauser       ++__rhs;
92e8cb3559SNikolas Klauser     }
93e8cb3559SNikolas Klauser     return 0;
94b4ecfd3cSNikolas Klauser   } else {
95355f4667SNikolas Klauser     return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp));
96e8cb3559SNikolas Klauser   }
97b4ecfd3cSNikolas Klauser }
98e8cb3559SNikolas Klauser 
99746cf7e3SNikolas Klauser // Because of __libcpp_is_trivially_equality_comparable we know that comparing the object representations is equivalent
100746cf7e3SNikolas Klauser // to a std::memcmp(...) == 0. Since we have multiple objects contiguously in memory, we can call memcmp once instead
101746cf7e3SNikolas Klauser // of invoking it on every object individually.
102746cf7e3SNikolas Klauser template <class _Tp, class _Up>
103746cf7e3SNikolas Klauser _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 bool
104355f4667SNikolas Klauser __constexpr_memcmp_equal(const _Tp* __lhs, const _Up* __rhs, __element_count __n) {
105746cf7e3SNikolas Klauser   static_assert(__libcpp_is_trivially_equality_comparable<_Tp, _Up>::value,
106746cf7e3SNikolas Klauser                 "_Tp and _Up have to be trivially equality comparable");
107746cf7e3SNikolas Klauser 
108355f4667SNikolas Klauser   auto __count = static_cast<size_t>(__n);
109355f4667SNikolas Klauser 
110746cf7e3SNikolas Klauser   if (__libcpp_is_constant_evaluated()) {
111746cf7e3SNikolas Klauser #ifdef _LIBCPP_COMPILER_CLANG_BASED
112746cf7e3SNikolas Klauser     if (sizeof(_Tp) == 1 && is_integral<_Tp>::value && !is_same<_Tp, bool>::value)
113355f4667SNikolas Klauser       return __builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)) == 0;
114746cf7e3SNikolas Klauser #endif
115746cf7e3SNikolas Klauser     while (__count != 0) {
116746cf7e3SNikolas Klauser       if (*__lhs != *__rhs)
117746cf7e3SNikolas Klauser         return false;
118746cf7e3SNikolas Klauser 
119355f4667SNikolas Klauser       --__count;
120746cf7e3SNikolas Klauser       ++__lhs;
121746cf7e3SNikolas Klauser       ++__rhs;
122746cf7e3SNikolas Klauser     }
123746cf7e3SNikolas Klauser     return true;
124746cf7e3SNikolas Klauser   } else {
125cb7a03b4SNikolas Klauser     return ::__builtin_memcmp(__lhs, __rhs, __count * sizeof(_Tp)) == 0;
126746cf7e3SNikolas Klauser   }
127746cf7e3SNikolas Klauser }
128746cf7e3SNikolas Klauser 
1291fd08eddSNikolas Klauser template <class _Tp, class _Up>
1301fd08eddSNikolas Klauser _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp* __constexpr_memchr(_Tp* __str, _Up __value, size_t __count) {
1311fd08eddSNikolas Klauser   static_assert(sizeof(_Tp) == 1 && __libcpp_is_trivially_equality_comparable<_Tp, _Up>::value,
1321fd08eddSNikolas Klauser                 "Calling memchr on non-trivially equality comparable types is unsafe.");
1331fd08eddSNikolas Klauser 
1341fd08eddSNikolas Klauser   if (__libcpp_is_constant_evaluated()) {
1351fd08eddSNikolas Klauser // use __builtin_char_memchr to optimize constexpr evaluation if we can
1361fd08eddSNikolas Klauser #if _LIBCPP_STD_VER >= 17 && __has_builtin(__builtin_char_memchr)
1371fd08eddSNikolas Klauser     if constexpr (is_same_v<remove_cv_t<_Tp>, char> && is_same_v<remove_cv_t<_Up>, char>)
1381fd08eddSNikolas Klauser       return __builtin_char_memchr(__str, __value, __count);
1391fd08eddSNikolas Klauser #endif
1401fd08eddSNikolas Klauser 
141e8cb3559SNikolas Klauser     for (; __count; --__count) {
1421fd08eddSNikolas Klauser       if (*__str == __value)
143e8cb3559SNikolas Klauser         return __str;
144e8cb3559SNikolas Klauser       ++__str;
145e8cb3559SNikolas Klauser     }
146e8cb3559SNikolas Klauser     return nullptr;
1471fd08eddSNikolas Klauser   } else {
1481fd08eddSNikolas Klauser     char __value_buffer = 0;
1491fd08eddSNikolas Klauser     __builtin_memcpy(&__value_buffer, &__value, sizeof(char));
1501fd08eddSNikolas Klauser     return static_cast<_Tp*>(__builtin_memchr(__str, __value_buffer, __count));
1511fd08eddSNikolas Klauser   }
152e8cb3559SNikolas Klauser }
153e8cb3559SNikolas Klauser 
1546f36ead5SLouis Dionne // This function performs an assignment to an existing, already alive TriviallyCopyable object
1556f36ead5SLouis Dionne // from another TriviallyCopyable object.
1566f36ead5SLouis Dionne //
1576f36ead5SLouis Dionne // It basically works around the fact that TriviallyCopyable objects are not required to be
1586f36ead5SLouis Dionne // syntactically copy/move constructible or copy/move assignable. Technically, only one of the
1596f36ead5SLouis Dionne // four operations is required to be syntactically valid -- but at least one definitely has to
1606f36ead5SLouis Dionne // be valid.
1616f36ead5SLouis Dionne //
1626f36ead5SLouis Dionne // This is necessary in order to implement __constexpr_memmove below in a way that mirrors as
1636f36ead5SLouis Dionne // closely as possible what the compiler's __builtin_memmove is able to do.
1646f36ead5SLouis Dionne template <class _Tp, class _Up, __enable_if_t<is_assignable<_Tp&, _Up const&>::value, int> = 0>
1656f36ead5SLouis Dionne _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp& __assign_trivially_copyable(_Tp& __dest, _Up const& __src) {
1666f36ead5SLouis Dionne   __dest = __src;
1676f36ead5SLouis Dionne   return __dest;
1686f36ead5SLouis Dionne }
1696f36ead5SLouis Dionne 
1706f36ead5SLouis Dionne // clang-format off
1716f36ead5SLouis Dionne template <class _Tp, class _Up, __enable_if_t<!is_assignable<_Tp&, _Up const&>::value &&
1726f36ead5SLouis Dionne                                                is_assignable<_Tp&, _Up&&>::value, int> = 0>
1736f36ead5SLouis Dionne // clang-format on
1746f36ead5SLouis Dionne _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp& __assign_trivially_copyable(_Tp& __dest, _Up& __src) {
1756f36ead5SLouis Dionne   __dest =
1766f36ead5SLouis Dionne       static_cast<_Up&&>(__src); // this is safe, we're not actually moving anything since the assignment is trivial
1776f36ead5SLouis Dionne   return __dest;
1786f36ead5SLouis Dionne }
1796f36ead5SLouis Dionne 
1806f36ead5SLouis Dionne // clang-format off
1816f36ead5SLouis Dionne template <class _Tp, class _Up, __enable_if_t<!is_assignable<_Tp&, _Up const&>::value &&
1826f36ead5SLouis Dionne                                               !is_assignable<_Tp&, _Up&&>::value &&
1836f36ead5SLouis Dionne                                                is_constructible<_Tp, _Up const&>::value, int> = 0>
1846f36ead5SLouis Dionne // clang-format on
1856f36ead5SLouis Dionne _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp& __assign_trivially_copyable(_Tp& __dest, _Up const& __src) {
1866f36ead5SLouis Dionne   // _Tp is trivially destructible, so we don't need to call its destructor to end the lifetime of the object
1876f36ead5SLouis Dionne   // that was there previously
1886f36ead5SLouis Dionne   std::__construct_at(std::addressof(__dest), __src);
1896f36ead5SLouis Dionne   return __dest;
1906f36ead5SLouis Dionne }
1916f36ead5SLouis Dionne 
1926f36ead5SLouis Dionne // clang-format off
1936f36ead5SLouis Dionne template <class _Tp, class _Up, __enable_if_t<!is_assignable<_Tp&, _Up const&>::value &&
1946f36ead5SLouis Dionne                                               !is_assignable<_Tp&, _Up&&>::value &&
1956f36ead5SLouis Dionne                                               !is_constructible<_Tp, _Up const&>::value &&
1966f36ead5SLouis Dionne                                                is_constructible<_Tp, _Up&&>::value, int> = 0>
1976f36ead5SLouis Dionne // clang-format on
1986f36ead5SLouis Dionne _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _Tp& __assign_trivially_copyable(_Tp& __dest, _Up& __src) {
1996f36ead5SLouis Dionne   // _Tp is trivially destructible, so we don't need to call its destructor to end the lifetime of the object
2006f36ead5SLouis Dionne   // that was there previously
2016f36ead5SLouis Dionne   std::__construct_at(
2026f36ead5SLouis Dionne       std::addressof(__dest),
2036f36ead5SLouis Dionne       static_cast<_Up&&>(__src)); // this is safe, we're not actually moving anything since the constructor is trivial
2046f36ead5SLouis Dionne   return __dest;
2056f36ead5SLouis Dionne }
2066f36ead5SLouis Dionne 
207c4e98722SNikolas Klauser template <class _Tp, class _Up, __enable_if_t<__is_always_bitcastable<_Up, _Tp>::value, int> = 0>
208c4e98722SNikolas Klauser _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp*
209c4e98722SNikolas Klauser __constexpr_memmove(_Tp* __dest, _Up* __src, __element_count __n) {
210c4e98722SNikolas Klauser   size_t __count = static_cast<size_t>(__n);
211c4e98722SNikolas Klauser   if (__libcpp_is_constant_evaluated()) {
212c4e98722SNikolas Klauser #ifdef _LIBCPP_COMPILER_CLANG_BASED
213c4e98722SNikolas Klauser     if (is_same<__remove_cv_t<_Tp>, __remove_cv_t<_Up> >::value) {
214c4e98722SNikolas Klauser       ::__builtin_memmove(__dest, __src, __count * sizeof(_Tp));
215c4e98722SNikolas Klauser       return __dest;
216c4e98722SNikolas Klauser     }
217c4e98722SNikolas Klauser #endif
218c4e98722SNikolas Klauser     if (std::__is_pointer_in_range(__src, __src + __count, __dest)) {
219c4e98722SNikolas Klauser       for (; __count > 0; --__count)
2206f36ead5SLouis Dionne         std::__assign_trivially_copyable(__dest[__count - 1], __src[__count - 1]);
221c4e98722SNikolas Klauser     } else {
222c4e98722SNikolas Klauser       for (size_t __i = 0; __i != __count; ++__i)
2236f36ead5SLouis Dionne         std::__assign_trivially_copyable(__dest[__i], __src[__i]);
224c4e98722SNikolas Klauser     }
225c4e98722SNikolas Klauser   } else if (__count > 0) {
226d30f6bc5SNikolas Klauser     ::__builtin_memmove(__dest, __src, (__count - 1) * sizeof(_Tp) + __datasizeof_v<_Tp>);
227c4e98722SNikolas Klauser   }
228c4e98722SNikolas Klauser   return __dest;
229c4e98722SNikolas Klauser }
230c4e98722SNikolas Klauser 
231e8cb3559SNikolas Klauser _LIBCPP_END_NAMESPACE_STD
232e8cb3559SNikolas Klauser 
233e8cb3559SNikolas Klauser #endif // _LIBCPP___STRING_CONSTEXPR_C_FUNCTIONS_H
234