From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 2181) id DF6DE385840B; Thu, 1 Sep 2022 09:28:43 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org DF6DE385840B DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1662024523; bh=f9oD88P6979BGqqaiIXbvoqWS/t29MRyXyN7p5ZhBqA=; h=From:To:Subject:Date:From; b=Q9BdIBxJltCW6O17+vvyiVioFumN4fQVNo4W6E+CMp/vIj6zNP0QXMLw+TkxFWzT8 s5uT2hn7UJPZhbBQrG0cdmpTMpEOqHIyYtqBKRsSyqJI0GkSTjC6M/kZ5UjGtNtJxS Dwkp0+44OERX45w38ZAHh7WhxS+PszP/RRdXeKsI= MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Type: text/plain; charset="utf-8" From: Jonathan Wakely To: gcc-cvs@gcc.gnu.org, libstdc++-cvs@gcc.gnu.org Subject: [gcc r13-2337] libstdc++: Optimize array traits X-Act-Checkin: gcc X-Git-Author: Jonathan Wakely X-Git-Refname: refs/heads/master X-Git-Oldrev: 953e08fde44a596e4ec2491efd15cd645e1ddc48 X-Git-Newrev: 0e1b1222af5e5346df9431df817f2e7dca01bee6 Message-Id: <20220901092843.DF6DE385840B@sourceware.org> Date: Thu, 1 Sep 2022 09:28:43 +0000 (GMT) List-Id: https://gcc.gnu.org/g:0e1b1222af5e5346df9431df817f2e7dca01bee6 commit r13-2337-g0e1b1222af5e5346df9431df817f2e7dca01bee6 Author: Jonathan Wakely Date: Wed Aug 31 15:00:07 2022 +0100 libstdc++: Optimize array traits Improve compile times by avoiding unnecessary class template instantiations. __is_array_known_bounds and __is_array_unknown_bounds can be defined without instantiating extent, by providing partial specializations for the true cases. std::extent can avoid recursing down through a multidimensional array, so it stops after providing the result. Previously extent would instantiate extent and extent as well. std::is_array_v can use partial specializations to avoid instantiating std::is_array, and similarly for std::rank_v and std::extent_v. std::is_bounded_array_v and std::is_unbounded_array_v can also use partial specializations, and then the class templates can be defined in terms of the variable templates. This makes sense for these traits, because they are new in C++20 and so the variable templates are always available, which isn't true in general for C++11 and C++14 traits. libstdc++-v3/ChangeLog: * include/std/type_traits (__is_array_known_bounds): Add partial specialization instead of using std::extent. (__is_array_unknown_bounds): Likewise. (extent): Add partial specializations to stop recursion after the result is found. (is_array_v): Add partial specializations instead of instantiating the class template. (rank_v, extent_v): Likewise. (is_bounded_array_v, is_unbounded_array_v): Likewise. (is_bounded_array, is_unbounded_array): Define in terms of the variable templates. Diff: --- libstdc++-v3/include/std/type_traits | 98 ++++++++++++++++++++++++------------ 1 file changed, 67 insertions(+), 31 deletions(-) diff --git a/libstdc++-v3/include/std/type_traits b/libstdc++-v3/include/std/type_traits index c2f5cb9c806..5984442c0aa 100644 --- a/libstdc++-v3/include/std/type_traits +++ b/libstdc++-v3/include/std/type_traits @@ -867,21 +867,28 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION template auto declval() noexcept -> decltype(__declval<_Tp>(0)); - template - struct extent; - template struct remove_all_extents; /// @cond undocumented template struct __is_array_known_bounds - : public integral_constant::value > 0)> + : public false_type + { }; + + template + struct __is_array_known_bounds<_Tp[_Size]> + : public true_type { }; template struct __is_array_unknown_bounds - : public __and_, __not_>> + : public false_type + { }; + + template + struct __is_array_unknown_bounds<_Tp[]> + : public true_type { }; // Destructible and constructible type properties. @@ -1430,23 +1437,25 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION : public integral_constant::value> { }; /// extent - template + template struct extent - : public integral_constant { }; + : public integral_constant { }; - template + template + struct extent<_Tp[_Size], 0> + : public integral_constant { }; + + template struct extent<_Tp[_Size], _Uint> - : public integral_constant::value> - { }; + : public extent<_Tp, _Uint - 1>::type { }; + + template + struct extent<_Tp[], 0> + : public integral_constant { }; template struct extent<_Tp[], _Uint> - : public integral_constant::value> - { }; + : public extent<_Tp, _Uint - 1>::type { }; // Type relations. @@ -3133,8 +3142,14 @@ template inline constexpr bool is_integral_v = is_integral<_Tp>::value; template inline constexpr bool is_floating_point_v = is_floating_point<_Tp>::value; + +template + inline constexpr bool is_array_v = false; template - inline constexpr bool is_array_v = is_array<_Tp>::value; + inline constexpr bool is_array_v<_Tp[]> = true; +template + inline constexpr bool is_array_v<_Tp[_Num]> = true; + template inline constexpr bool is_pointer_v = is_pointer<_Tp>::value; template @@ -3276,10 +3291,25 @@ template has_virtual_destructor<_Tp>::value; template inline constexpr size_t alignment_of_v = alignment_of<_Tp>::value; + +template + inline constexpr size_t rank_v = 0; +template + inline constexpr size_t rank_v<_Tp[_Size]> = 1 + rank_v<_Tp>; template - inline constexpr size_t rank_v = rank<_Tp>::value; + inline constexpr size_t rank_v<_Tp[]> = 1 + rank_v<_Tp>; + template - inline constexpr size_t extent_v = extent<_Tp, _Idx>::value; + inline constexpr size_t extent_v = 0; +template + inline constexpr size_t extent_v<_Tp[_Size], 0> = _Size; +template + inline constexpr size_t extent_v<_Tp[_Size], _Idx> = extent_v<_Tp, _Idx - 1>; +template + inline constexpr size_t extent_v<_Tp[], 0> = 0; +template + inline constexpr size_t extent_v<_Tp[], _Idx> = extent_v<_Tp, _Idx - 1>; + #ifdef _GLIBCXX_HAVE_BUILTIN_IS_SAME template inline constexpr bool is_same_v = __is_same(_Tp, _Up); @@ -3408,30 +3438,36 @@ template #define __cpp_lib_bounded_array_traits 201902L /// True for a type that is an array of known bound. + /// @ingroup variable_templates /// @since C++20 template - struct is_bounded_array - : public __is_array_known_bounds<_Tp> - { }; + inline constexpr bool is_bounded_array_v = false; + + template + inline constexpr bool is_bounded_array_v<_Tp[_Size]> = true; /// True for a type that is an array of unknown bound. + /// @ingroup variable_templates /// @since C++20 template - struct is_unbounded_array - : public __is_array_unknown_bounds<_Tp> - { }; + inline constexpr bool is_unbounded_array_v = false; - /// @ingroup variable_templates + template + inline constexpr bool is_unbounded_array_v<_Tp[]> = true; + + /// True for a type that is an array of known bound. /// @since C++20 template - inline constexpr bool is_bounded_array_v - = is_bounded_array<_Tp>::value; + struct is_bounded_array + : public bool_constant> + { }; - /// @ingroup variable_templates + /// True for a type that is an array of unknown bound. /// @since C++20 template - inline constexpr bool is_unbounded_array_v - = is_unbounded_array<_Tp>::value; + struct is_unbounded_array + : public bool_constant> + { }; #if __has_builtin(__is_layout_compatible)