Date: Mon, 8 Apr 2024 23:28:49 +0000 (GMT) From: jenkins-admin@FreeBSD.org To: des@FreeBSD.org, kp@FreeBSD.org, glebius@FreeBSD.org, fernape@FreeBSD.org, zlei@FreeBSD.org, dev-ci@FreeBSD.org Cc: jenkins-admin@FreeBSD.org Subject: FreeBSD-main-amd64-gcc12_build - Build #2666 - Still Failing Message-ID: <1841530321.6017.1712618930533@jenkins.ci.freebsd.org> In-Reply-To: <1860748670.6009.1712604529048@jenkins.ci.freebsd.org> References: <1860748670.6009.1712604529048@jenkins.ci.freebsd.org>
next in thread | previous in thread | raw e-mail | index | archive | help
------=_Part_6016_1696760760.1712618929672 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: quoted-printable FreeBSD-main-amd64-gcc12_build - Build #2666 (7f479dee48973541da8c869b888b9= 53161301c3b) - Still Failing Build information: https://ci.FreeBSD.org/job/FreeBSD-main-amd64-gcc12_buil= d/2666/ Full change log: https://ci.FreeBSD.org/job/FreeBSD-main-amd64-gcc12_build/= 2666/changes Full build log: https://ci.FreeBSD.org/job/FreeBSD-main-amd64-gcc12_build/2= 666/console Status explanation: "Failure" - the build is suspected being broken by the following changes "Still Failing" - the build has not been fixed by the following changes and this is a notification to note that these changes have not been fully tested by the CI system Change summaries: (Those commits are likely but not certainly responsible) 60d8dbbef075d3b39891ed35e124d0f7ef8e5fb9 by kp: netinet: add a probe point for IP, IP6, ICMP, ICMP6, UDP and TCP stats 7e68976408e4df21e120e2d6440392302cac84f3 by fernape: echo(1): Add EXAMPLES e7102929bf4fea4bf22855d2d6031edf6c413608 by zlei: ethernet: Fix logging of frame length 6fe4d8395bc5ec51a5ec68b5f1176b4710676b7c by zlei: debugnet: Fix logging of frame length 86a6393a7d6766875a9e03daa0273a2e55faacdd by glebius: ng_bridge: allow to automatically assign numbers to new hooks e943eceb928d1d277f28f262dd6d758c1d85e8d0 by glebius: ng_bridge: document the limitation brought in f961caf2184c 69fd60f1ead5a86eeb0b18847dd71f7ae3fce4a0 by des: sys/queue.h: Whitespace cleanup. 7f479dee48973541da8c869b888b953161301c3b by des: sys/queue.h: Add {LIST,TAILQ}_REPLACE(). The end of the build log: [...truncated 14.05 MiB...] /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:231:55:= note: candidate: 'template<class _U1, class _U2, typename std::__1::enable= _if<__enable_implicit<const _U1&, const _U2&>(), int>::type <anonymous> > c= onstexpr std::__1::pair< <template-parameter-1-1>, <template-parameter-1-2>= >::pair(const std::__1::pair<_U1, _U2>&) [with _U2 =3D _U1; typename std::= __1::enable_if<_CheckArgs::__enable_implicit<const _U1&, const _U2&>(), int= >::type <anonymous> =3D _U2; _T1 =3D long unsigned int; _T2 =3D long unsign= ed int]' 231 | _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair(pair<_U1= , _U2> const& __p) | ^~~~ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:231:55:= note: template argument deduction/substitution failed: /workspace/src/contrib/llvm-project/libcxx/include/__functional/hash.h:203:= 12: note: mismatched types 'const std::__1::pair<_T1, _T2>' and 'long uns= igned int' 203 | return pair<_Size, _Size>(__a + __z, __b + __c); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:223:64:= note: candidate: 'template<class _U1, class _U2, typename std::__1::enable= _if<__enable_explicit<const _U1&, const _U2&>(), int>::type <anonymous> > c= onstexpr std::__1::pair< <template-parameter-1-1>, <template-parameter-1-2>= >::pair(const std::__1::pair<_U1, _U2>&) [with _U2 =3D _U1; typename std::= __1::enable_if<_CheckArgs::__enable_explicit<const _U1&, const _U2&>(), int= >::type <anonymous> =3D _U2; _T1 =3D long unsigned int; _T2 =3D long unsign= ed int]' 223 | _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 explicit pair= (pair<_U1, _U2> const& __p) | ^~~~ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:223:64:= note: template argument deduction/substitution failed: --- algorithm.o --- /workspace/src/contrib/llvm-project/libcxx/include/__algorithm/sort.h: In i= nstantiation of 'void std::__1::__introsort(_RandomAccessIterator, _RandomA= ccessIterator, _Compare, typename iterator_traits<_Iter2>::difference_type,= bool) [with _AlgPolicy =3D _ClassicAlgPolicy; _Compare =3D ranges::less; _= RandomAccessIterator =3D long unsigned int*; bool _UseBitSetPartition =3D f= alse; typename iterator_traits<_Iter2>::difference_type =3D long int]': /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:24:85: requi= red from 'void std::__1::__sort(_RandomAccessIterator, _RandomAccessIterato= r, _Comp) [with _Comp =3D __less<long unsigned int>&; _RandomAccessIterator= =3D long unsigned int*]' /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:40:116: requ= ired from here /workspace/src/contrib/llvm-project/libcxx/include/__algorithm/sort.h:777:1= 7: error: no match for call to '(std::__1::ranges::less) (long unsigned int= &, long unsigned int&)' 777 | if (__comp(*--__last, *__first)) | ~~~~~~^~~~~~~~~~~~~~~~~~~~~ --- any.o --- /workspace/src/contrib/llvm-project/libcxx/include/__functional/hash.h:203:= 12: note: mismatched types 'const std::__1::pair<_T1, _T2>' and 'long uns= igned int' 203 | return pair<_Size, _Size>(__a + __z, __b + __c); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ --- algorithm.o --- /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: candidate: 'template<class _Tp, class _Up> requires = totally_ordered_with<_Tp, _Up> constexpr bool std::__1::ranges::less::oper= ator()(_Tp&&, _Up&&) const' 55 | [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp= && __t, _Up&& __u) const | ^~~~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: template argument deduction/substitution failed: --- any.o --- /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:204:55:= note: candidate: 'template<class _U1, class _U2, typename std::__1::enable= _if<__enable_implicit<_U1, _U2>(), int>::type <anonymous> > constexpr std::= __1::pair< <template-parameter-1-1>, <template-parameter-1-2> >::pair(_U1&&= , _U2&&) [with _U2 =3D _U1; typename std::__1::enable_if<_CheckArgs::__enab= le_implicit<_U1, _U2>(), int>::type <anonymous> =3D _U2; _T1 =3D long unsig= ned int; _T2 =3D long unsigned int]' 204 | _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair(_U1&& __= u1, _U2&& __u2) | ^~~~ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:204:55:= note: template argument deduction/substitution failed: --- algorithm.o --- /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: constraints not satisfied --- any.o --- /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:203:69:= in 'constexpr' expansion of 'std::__1::pair<long unsigned int, long unsi= gned int>::_CheckArgs::__enable_implicit<long unsigned int, long unsigned i= nt>()' /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:150:76:= in 'constexpr' expansion of 'std::__1::pair<long unsigned int, long unsi= gned int>::_CheckArgs::__is_implicit<long unsigned int, long unsigned int>(= )' /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:203:80:= error: 'constexpr' call flows off the end of the function 203 | __enable_if_t<_CheckArgs::template __enable_implicit<_U1, _U2= >(), int> =3D 0 > | = ^ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:203:69:= note: in template argument for type 'bool' 203 | __enable_if_t<_CheckArgs::template __enable_implicit<_U1, _U2= >(), int> =3D 0 > | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~= ~^~ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:189:64:= note: candidate: 'template<class _U1, class _U2, typename std::__1::enable= _if<__enable_explicit<_U1, _U2>(), int>::type <anonymous> > constexpr std::= __1::pair< <template-parameter-1-1>, <template-parameter-1-2> >::pair(_U1&&= , _U2&&) [with _U2 =3D _U1; typename std::__1::enable_if<_CheckArgs::__enab= le_explicit<_U1, _U2>(), int>::type <anonymous> =3D _U2; _T1 =3D long unsig= ned int; _T2 =3D long unsigned int]' 189 | _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 explicit pair= (_U1&& __u1, _U2&& __u2) | ^~~~ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:189:64:= note: substitution of deduced template arguments resulted in errors seen= above /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:176:55:= note: candidate: 'template<bool _Dummy, typename std::__1::enable_if<typen= ame std::__1::conditional<_MaybeEnable, std::__1::pair<long unsigned int, l= ong unsigned int>::_CheckArgs, std::__1::__check_tuple_constructor_fail>::t= ype::__enable_implicit<const long unsigned int&, const long unsigned int&>(= ), int>::type <anonymous> > constexpr std::__1::pair< <template-parameter-1= -1>, <template-parameter-1-2> >::pair(const _T1&, const _T2&) [with bool _D= ummy =3D _Dummy; typename std::__1::enable_if<typename std::__1::conditiona= l<_MaybeEnable, _CheckArgs, std::__1::__check_tuple_constructor_fail>::type= ::__enable_implicit<const _T1&, const _T2&>(), int>::type <anonymous> =3D <= anonymous>; _T1 =3D long unsigned int; _T2 =3D long unsigned int]' 176 | _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair(_T1 cons= t& __t1, _T2 const& __t2) | ^~~~ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:176:55:= note: template argument deduction/substitution failed: /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:175:100= : in 'constexpr' expansion of 'std::__1::pair<long unsigned int, long uns= igned int>::_CheckArgs::__enable_implicit<const long unsigned int&, const l= ong unsigned int&>()' /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:150:76:= in 'constexpr' expansion of 'std::__1::pair<long unsigned int, long unsi= gned int>::_CheckArgs::__is_implicit<const long unsigned int&, const long u= nsigned int&>()' /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:175:111= : error: 'constexpr' call flows off the end of the function 175 | __enable_if_t<_CheckArgsDep<_Dummy>::template __enable_= implicit<_T1 const&, _T2 const&>(), int> =3D 0> | = ^ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:175:100= : note: in template argument for type 'bool' 175 | __enable_if_t<_CheckArgsDep<_Dummy>::template __enable_= implicit<_T1 const&, _T2 const&>(), int> =3D 0> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~= ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ --- algorithm.o --- /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h: In substitution of 'template<class _Tp, class _Up> requires tot= ally_ordered_with<_Tp, _Up> constexpr bool std::__1::ranges::less::operator= ()(_Tp&&, _Up&&) const [with _Tp =3D long unsigned int&; _Up =3D long unsig= ned int&]': /workspace/src/contrib/llvm-project/libcxx/include/__algorithm/sort.h:777:1= 7: required from 'void std::__1::__introsort(_RandomAccessIterator, _Rand= omAccessIterator, _Compare, typename iterator_traits<_Iter2>::difference_ty= pe, bool) [with _AlgPolicy =3D _ClassicAlgPolicy; _Compare =3D ranges::less= ; _RandomAccessIterator =3D long unsigned int*; bool _UseBitSetPartition = =3D false; typename iterator_traits<_Iter2>::difference_type =3D long int]' /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:24:85: requi= red from 'void std::__1::__sort(_RandomAccessIterator, _RandomAccessIterato= r, _Comp) [with _Comp =3D __less<long unsigned int>&; _RandomAccessIterator= =3D long unsigned int*]' /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:40:116: requ= ired from here /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:29:9: required for the satisfaction of '__weakly_equality_compar= able_with<_Tp, _Tp>' [with _Tp =3D long unsigned int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:38:9: required for the satisfaction of 'equality_comparable<_Tp>= ' [with _Tp =3D long unsigned int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/totally_order= ed.h:41:9: required for the satisfaction of 'totally_ordered<_Tp>' [with = _Tp =3D long unsigned int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/totally_order= ed.h:45:9: required for the satisfaction of 'totally_ordered_with<_Tp, _U= p>' [with _Tp =3D long unsigned int&; _Up =3D long unsigned int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:30:5: in requirements with 'std::__1::__libcpp_remove_reference_= t<_Tp>& __t', 'std::__1::__libcpp_remove_reference_t<_Alloc>& __u' [with _U= p =3D long unsigned int&; _Tp =3D long unsigned int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:31:13: note: '(__t =3D=3D __u)' does not satisfy return-type-requi= rement 31 | { __t =3D=3D __u } -> __boolean_testable; | ~~~~^~~~~~ --- any.o --- /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:170:64:= note: candidate: 'template<bool _Dummy, typename std::__1::enable_if<typen= ame std::__1::conditional<_MaybeEnable, std::__1::pair<long unsigned int, l= ong unsigned int>::_CheckArgs, std::__1::__check_tuple_constructor_fail>::t= ype::__enable_explicit<const long unsigned int&, const long unsigned int&>(= ), int>::type <anonymous> > constexpr std::__1::pair< <template-parameter-1= -1>, <template-parameter-1-2> >::pair(const _T1&, const _T2&) [with bool _D= ummy =3D _Dummy; typename std::__1::enable_if<typename std::__1::conditiona= l<_MaybeEnable, _CheckArgs, std::__1::__check_tuple_constructor_fail>::type= ::__enable_explicit<const _T1&, const _T2&>(), int>::type <anonymous> =3D <= anonymous>; _T1 =3D long unsigned int; _T2 =3D long unsigned int]' 170 | _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 explicit pair= (_T1 const& __t1, _T2 const& __t2) | ^~~~ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:170:64:= note: substitution of deduced template arguments resulted in errors seen= above --- algorithm.o --- /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:32:13: note: '(__t !=3D __u)' does not satisfy return-type-require= ment 32 | { __t !=3D __u } -> __boolean_testable; | ~~~~^~~~~~ --- any.o --- /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:164:43:= note: candidate: 'template<bool _Dummy, typename std::__1::enable_if<typen= ame std::__1::conditional<_MaybeEnable, std::__1::pair<long unsigned int, l= ong unsigned int>::_CheckArgs, std::__1::__check_tuple_constructor_fail>::t= ype::__enable_implicit_default(), int>::type <anonymous> > constexpr std::_= _1::pair< <template-parameter-1-1>, <template-parameter-1-2> >::pair() [wit= h bool _Dummy =3D _Dummy; typename std::__1::enable_if<typename std::__1::c= onditional<_MaybeEnable, _CheckArgs, std::__1::__check_tuple_constructor_fa= il>::type::__enable_implicit_default(), int>::type <anonymous> =3D <anonymo= us>; _T1 =3D long unsigned int; _T2 =3D long unsigned int]' 164 | _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR pair() _NOEXCEPT_( | ^~~~ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:164:43:= note: template argument deduction/substitution failed: --- algorithm.o --- /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:33:13: note: '(__u =3D=3D __t)' does not satisfy return-type-requi= rement 33 | { __u =3D=3D __t } -> __boolean_testable; | ~~~~^~~~~~ --- any.o --- /workspace/src/contrib/llvm-project/libcxx/include/__functional/hash.h:203:= 12: note: candidate expects 0 arguments, 2 provided 203 | return pair<_Size, _Size>(__a + __z, __b + __c); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:159:52:= note: candidate: 'template<bool _Dummy, typename std::__1::enable_if<typen= ame std::__1::conditional<_MaybeEnable, std::__1::pair<long unsigned int, l= ong unsigned int>::_CheckArgs, std::__1::__check_tuple_constructor_fail>::t= ype::__enable_explicit_default(), int>::type <anonymous> > constexpr std::_= _1::pair< <template-parameter-1-1>, <template-parameter-1-2> >::pair() [wit= h bool _Dummy =3D _Dummy; typename std::__1::enable_if<typename std::__1::c= onditional<_MaybeEnable, _CheckArgs, std::__1::__check_tuple_constructor_fa= il>::type::__enable_explicit_default(), int>::type <anonymous> =3D <anonymo= us>; _T1 =3D long unsigned int; _T2 =3D long unsigned int]' 159 | explicit _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR pair() _NOEXCEPT= _( | ^~~~ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:159:52:= note: template argument deduction/substitution failed: --- algorithm.o --- /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:34:13: note: '(__u !=3D __t)' does not satisfy return-type-require= ment 34 | { __u !=3D __t } -> __boolean_testable; | ~~~~^~~~~~ --- any.o --- /workspace/src/contrib/llvm-project/libcxx/include/__functional/hash.h:203:= 12: note: candidate expects 0 arguments, 2 provided 203 | return pair<_Size, _Size>(__a + __z, __b + __c); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:92:25: = note: candidate: 'constexpr std::__1::pair< <template-parameter-1-1>, <temp= late-parameter-1-2> >::pair(std::__1::pair< <template-parameter-1-1>, <temp= late-parameter-1-2> >&&) [with _T1 =3D long unsigned int; _T2 =3D long unsi= gned int]' 92 | _LIBCPP_HIDE_FROM_ABI pair(pair&&) =3D default; | ^~~~ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:92:25: = note: candidate expects 1 argument, 2 provided /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:91:25: = note: candidate: 'constexpr std::__1::pair< <template-parameter-1-1>, <temp= late-parameter-1-2> >::pair(const std::__1::pair< <template-parameter-1-1>,= <template-parameter-1-2> >&) [with _T1 =3D long unsigned int; _T2 =3D long= unsigned int]' 91 | _LIBCPP_HIDE_FROM_ABI pair(pair const&) =3D default; | ^~~~ /workspace/src/contrib/llvm-project/libcxx/include/__utility/pair.h:91:25: = note: candidate expects 1 argument, 2 provided --- algorithm.o --- /workspace/src/contrib/llvm-project/libcxx/include/__algorithm/sort.h: In i= nstantiation of 'void std::__1::__introsort(_RandomAccessIterator, _RandomA= ccessIterator, _Compare, typename iterator_traits<_Iter2>::difference_type,= bool) [with _AlgPolicy =3D _ClassicAlgPolicy; _Compare =3D ranges::less; _= RandomAccessIterator =3D long unsigned int*; bool _UseBitSetPartition =3D f= alse; typename iterator_traits<_Iter2>::difference_type =3D long int]': /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:24:85: requi= red from 'void std::__1::__sort(_RandomAccessIterator, _RandomAccessIterato= r, _Comp) [with _Comp =3D __less<long unsigned int>&; _RandomAccessIterator= =3D long unsigned int*]' /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:40:116: requ= ired from here /workspace/src/contrib/llvm-project/libcxx/include/__algorithm/sort.h:837:3= 1: error: no match for call to '(std::__1::ranges::less) (long unsigned int= &, long unsigned int&)' 837 | if (!__leftmost && !__comp(*(__first - difference_type(1)), *__= first)) { | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~= ~~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: candidate: 'template<class _Tp, class _Up> requires = totally_ordered_with<_Tp, _Up> constexpr bool std::__1::ranges::less::oper= ator()(_Tp&&, _Up&&) const' 55 | [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp= && __t, _Up&& __u) const | ^~~~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: template argument deduction/substitution failed: /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: constraints not satisfied /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h: In substitution of 'template<class _Tp, class _Up> requires tot= ally_ordered_with<_Tp, _Up> constexpr bool std::__1::ranges::less::operator= ()(_Tp&&, _Up&&) const [with _Tp =3D long unsigned int&; _Up =3D long unsig= ned int&]': /workspace/src/contrib/llvm-project/libcxx/include/__algorithm/sort.h:837:3= 1: required from 'void std::__1::__introsort(_RandomAccessIterator, _Rand= omAccessIterator, _Compare, typename iterator_traits<_Iter2>::difference_ty= pe, bool) [with _AlgPolicy =3D _ClassicAlgPolicy; _Compare =3D ranges::less= ; _RandomAccessIterator =3D long unsigned int*; bool _UseBitSetPartition = =3D false; typename iterator_traits<_Iter2>::difference_type =3D long int]' /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:24:85: requi= red from 'void std::__1::__sort(_RandomAccessIterator, _RandomAccessIterato= r, _Comp) [with _Comp =3D __less<long unsigned int>&; _RandomAccessIterator= =3D long unsigned int*]' /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:40:116: requ= ired from here /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:29:9: required for the satisfaction of '__weakly_equality_compar= able_with<_Tp, _Tp>' [with _Tp =3D long unsigned int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:38:9: required for the satisfaction of 'equality_comparable<_Tp>= ' [with _Tp =3D long unsigned int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/totally_order= ed.h:41:9: required for the satisfaction of 'totally_ordered<_Tp>' [with = _Tp =3D long unsigned int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/totally_order= ed.h:45:9: required for the satisfaction of 'totally_ordered_with<_Tp, _U= p>' [with _Tp =3D long unsigned int&; _Up =3D long unsigned int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:30:5: in requirements with 'std::__1::__libcpp_remove_reference_= t<_Tp>& __t', 'std::__1::__libcpp_remove_reference_t<_Alloc>& __u' [with _U= p =3D long unsigned int&; _Tp =3D long unsigned int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:31:13: note: '(__t =3D=3D __u)' does not satisfy return-type-requi= rement 31 | { __t =3D=3D __u } -> __boolean_testable; | ~~~~^~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:32:13: note: '(__t !=3D __u)' does not satisfy return-type-require= ment 32 | { __t !=3D __u } -> __boolean_testable; | ~~~~^~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:33:13: note: '(__u =3D=3D __t)' does not satisfy return-type-requi= rement 33 | { __u =3D=3D __t } -> __boolean_testable; | ~~~~^~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:34:13: note: '(__u !=3D __t)' does not satisfy return-type-require= ment 34 | { __u !=3D __t } -> __boolean_testable; | ~~~~^~~~~~ --- lib/libcrypt__L --- --- sha256c.o --- /usr/local/bin/x86_64-unknown-freebsd14.0-gcc12 --sysroot=3D/tmp/obj/worksp= ace/src/amd64.amd64/tmp -B/usr/local/x86_64-unknown-freebsd14.0/bin/ -O2 -= pipe -fno-common -I/workspace/src/lib/libmd -I/workspace/src/sys/crypto/= sha2 -I/workspace/src/lib/libcrypt -DHAS_DES -DHAS_BLOWFISH -DMD4Init=3D__M= D4Init -DMD4Final=3D__MD4Final -DMD4Update=3D__MD4Update -DMD4Pad=3D__MD4Pa= d -DMD5Init=3D__MD5Init -DMD5Final=3D__MD5Final -DMD5Update=3D__MD5Update -= DMD5Pad=3D__MD5Pad -DSHA224_Init=3D__SHA224_Init -DSHA224_Final=3D__SHA224_= Final -DSHA224_Update=3D__SHA224_Update -DSHA256_Init=3D__SHA256_Init -DSHA= 256_Final=3D__SHA256_Final -DSHA256_Update=3D__SHA256_Update -DSHA512_224_I= nit=3D__SHA512_224_Init -DSHA512_224_Final=3D__SHA512_224_Final -DSHA512_22= 4_Update=3D__SHA512_224_Update -DSHA512_256_Init=3D__SHA512_256_Init -DSHA5= 12_256_Final=3D__SHA512_256_Final -DSHA512_256_Update=3D__SHA512_256_Update= -DSHA384_Init=3D__SHA384_Init -DSHA384_Final=3D__SHA384_Final -DSHA384_Upd= ate=3D__SHA384_Update -DSHA512_Init=3D__SHA512_Init -DSHA512_Final=3D__SHA5= 12_Final -DSHA512_Update=3D__SHA512_Update -g -MD -MF.depend.sha256c.o -MT= sha256c.o -std=3Dgnu99 -Wno-format-zero-length -fstack-protector-strong -Ws= ystem-headers -Werror -Wall -Wno-format-y2k -Wno-uninitialized -Wno-pointer= -sign -Wdate-time -Wno-error=3Daddress -Wno-error=3Darray-bounds -Wno-error= =3Dattributes -Wno-error=3Dbool-compare -Wno-error=3Dcast-align -Wno-error= =3Dclobbered -Wno-error=3Ddeprecated-declarations -Wno-error=3Denum-compare= -Wno-error=3Dextra -Wno-error=3Dlogical-not-parentheses -Wno-error=3Dstric= t-aliasing -Wno-error=3Duninitialized -Wno-error=3Dunused-function -Wno-err= or=3Dunused-value -Wno-error=3Dempty-body -Wno-error=3Dmaybe-uninitialized = -Wno-error=3Dnonnull-compare -Wno-error=3Dshift-negative-value -Wno-error= =3Dtautological-compare -Wno-error=3Dunused-const-variable -Wno-error=3Dboo= l-operation -Wno-error=3Ddeprecated -Wno-error=3Dexpansion-to-defined -Wno-= error=3Dformat-overflow -Wno-error=3Dformat-truncation -Wno-error=3Dimplici= t-fallthrough -Wno-error=3Dint-in-bool-context -Wno-error=3Dmemset-elt-size= -Wno-error=3Dnoexcept-type -Wno-error=3Dnonnull -Wno-error=3Dpointer-compa= re -Wno-error=3Dstringop-overflow -Wno-error=3Daggressive-loop-optimization= s -Wno-error=3Dcast-function-type -Wno-error=3Dcatch-value -Wno-error=3Dmul= tistatement-macros -Wno-error=3Drestrict -Wno-error=3Dsizeof-pointer-memacc= ess -Wno-error=3Dstringop-truncation -Wno-return-type -Wno-address-of-packe= d-member -c /workspace/src/sys/crypto/sha2/sha256c.c -o sha256c.o --- lib/libc++__L --- /workspace/src/contrib/llvm-project/libcxx/include/__algorithm/sort.h: In i= nstantiation of 'void std::__1::__introsort(_RandomAccessIterator, _RandomA= ccessIterator, _Compare, typename iterator_traits<_Iter2>::difference_type,= bool) [with _AlgPolicy =3D _ClassicAlgPolicy; _Compare =3D ranges::less; _= RandomAccessIterator =3D long long int*; bool _UseBitSetPartition =3D false= ; typename iterator_traits<_Iter2>::difference_type =3D long int]': /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:24:85: requi= red from 'void std::__1::__sort(_RandomAccessIterator, _RandomAccessIterato= r, _Comp) [with _Comp =3D __less<long long int>&; _RandomAccessIterator =3D= long long int*]' /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:41:96: requi= red from here /workspace/src/contrib/llvm-project/libcxx/include/__algorithm/sort.h:777:1= 7: error: no match for call to '(std::__1::ranges::less) (long long int&, l= ong long int&)' 777 | if (__comp(*--__last, *__first)) | ~~~~~~^~~~~~~~~~~~~~~~~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: candidate: 'template<class _Tp, class _Up> requires = totally_ordered_with<_Tp, _Up> constexpr bool std::__1::ranges::less::oper= ator()(_Tp&&, _Up&&) const' 55 | [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp= && __t, _Up&& __u) const | ^~~~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: template argument deduction/substitution failed: /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: constraints not satisfied /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h: In substitution of 'template<class _Tp, class _Up> requires tot= ally_ordered_with<_Tp, _Up> constexpr bool std::__1::ranges::less::operator= ()(_Tp&&, _Up&&) const [with _Tp =3D long long int&; _Up =3D long long int&= ]': /workspace/src/contrib/llvm-project/libcxx/include/__algorithm/sort.h:777:1= 7: required from 'void std::__1::__introsort(_RandomAccessIterator, _Rand= omAccessIterator, _Compare, typename iterator_traits<_Iter2>::difference_ty= pe, bool) [with _AlgPolicy =3D _ClassicAlgPolicy; _Compare =3D ranges::less= ; _RandomAccessIterator =3D long long int*; bool _UseBitSetPartition =3D fa= lse; typename iterator_traits<_Iter2>::difference_type =3D long int]' /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:24:85: requi= red from 'void std::__1::__sort(_RandomAccessIterator, _RandomAccessIterato= r, _Comp) [with _Comp =3D __less<long long int>&; _RandomAccessIterator =3D= long long int*]' /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:41:96: requi= red from here /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:29:9: required for the satisfaction of '__weakly_equality_compar= able_with<_Tp, _Tp>' [with _Tp =3D long long int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:38:9: required for the satisfaction of 'equality_comparable<_Tp>= ' [with _Tp =3D long long int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/totally_order= ed.h:41:9: required for the satisfaction of 'totally_ordered<_Tp>' [with = _Tp =3D long long int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/totally_order= ed.h:45:9: required for the satisfaction of 'totally_ordered_with<_Tp, _U= p>' [with _Tp =3D long long int&; _Up =3D long long int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:30:5: in requirements with 'std::__1::__libcpp_remove_reference_= t<_Tp>& __t', 'std::__1::__libcpp_remove_reference_t<_Alloc>& __u' [with _U= p =3D long long int&; _Tp =3D long long int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:31:13: note: '(__t =3D=3D __u)' does not satisfy return-type-requi= rement 31 | { __t =3D=3D __u } -> __boolean_testable; | ~~~~^~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:32:13: note: '(__t !=3D __u)' does not satisfy return-type-require= ment 32 | { __t !=3D __u } -> __boolean_testable; | ~~~~^~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:33:13: note: '(__u =3D=3D __t)' does not satisfy return-type-requi= rement 33 | { __u =3D=3D __t } -> __boolean_testable; | ~~~~^~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:34:13: note: '(__u !=3D __t)' does not satisfy return-type-require= ment 34 | { __u !=3D __t } -> __boolean_testable; | ~~~~^~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__algorithm/sort.h: In i= nstantiation of 'void std::__1::__introsort(_RandomAccessIterator, _RandomA= ccessIterator, _Compare, typename iterator_traits<_Iter2>::difference_type,= bool) [with _AlgPolicy =3D _ClassicAlgPolicy; _Compare =3D ranges::less; _= RandomAccessIterator =3D long long int*; bool _UseBitSetPartition =3D false= ; typename iterator_traits<_Iter2>::difference_type =3D long int]': /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:24:85: requi= red from 'void std::__1::__sort(_RandomAccessIterator, _RandomAccessIterato= r, _Comp) [with _Comp =3D __less<long long int>&; _RandomAccessIterator =3D= long long int*]' /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:41:96: requi= red from here /workspace/src/contrib/llvm-project/libcxx/include/__algorithm/sort.h:837:3= 1: error: no match for call to '(std::__1::ranges::less) (long long int&, l= ong long int&)' 837 | if (!__leftmost && !__comp(*(__first - difference_type(1)), *__= first)) { | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~= ~~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: candidate: 'template<class _Tp, class _Up> requires = totally_ordered_with<_Tp, _Up> constexpr bool std::__1::ranges::less::oper= ator()(_Tp&&, _Up&&) const' 55 | [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp= && __t, _Up&& __u) const | ^~~~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: template argument deduction/substitution failed: /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: constraints not satisfied /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h: In substitution of 'template<class _Tp, class _Up> requires tot= ally_ordered_with<_Tp, _Up> constexpr bool std::__1::ranges::less::operator= ()(_Tp&&, _Up&&) const [with _Tp =3D long long int&; _Up =3D long long int&= ]': /workspace/src/contrib/llvm-project/libcxx/include/__algorithm/sort.h:837:3= 1: required from 'void std::__1::__introsort(_RandomAccessIterator, _Rand= omAccessIterator, _Compare, typename iterator_traits<_Iter2>::difference_ty= pe, bool) [with _AlgPolicy =3D _ClassicAlgPolicy; _Compare =3D ranges::less= ; _RandomAccessIterator =3D long long int*; bool _UseBitSetPartition =3D fa= lse; typename iterator_traits<_Iter2>::difference_type =3D long int]' /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:24:85: requi= red from 'void std::__1::__sort(_RandomAccessIterator, _RandomAccessIterato= r, _Comp) [with _Comp =3D __less<long long int>&; _RandomAccessIterator =3D= long long int*]' /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:41:96: requi= red from here /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:29:9: required for the satisfaction of '__weakly_equality_compar= able_with<_Tp, _Tp>' [with _Tp =3D long long int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:38:9: required for the satisfaction of 'equality_comparable<_Tp>= ' [with _Tp =3D long long int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/totally_order= ed.h:41:9: required for the satisfaction of 'totally_ordered<_Tp>' [with = _Tp =3D long long int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/totally_order= ed.h:45:9: required for the satisfaction of 'totally_ordered_with<_Tp, _U= p>' [with _Tp =3D long long int&; _Up =3D long long int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:30:5: in requirements with 'std::__1::__libcpp_remove_reference_= t<_Tp>& __t', 'std::__1::__libcpp_remove_reference_t<_Alloc>& __u' [with _U= p =3D long long int&; _Tp =3D long long int&] /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:31:13: note: '(__t =3D=3D __u)' does not satisfy return-type-requi= rement 31 | { __t =3D=3D __u } -> __boolean_testable; | ~~~~^~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:32:13: note: '(__t !=3D __u)' does not satisfy return-type-require= ment 32 | { __t !=3D __u } -> __boolean_testable; | ~~~~^~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:33:13: note: '(__u =3D=3D __t)' does not satisfy return-type-requi= rement 33 | { __u =3D=3D __t } -> __boolean_testable; | ~~~~^~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__concepts/equality_comp= arable.h:34:13: note: '(__u !=3D __t)' does not satisfy return-type-require= ment 34 | { __u !=3D __t } -> __boolean_testable; | ~~~~^~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__algorithm/sort.h: In i= nstantiation of 'void std::__1::__introsort(_RandomAccessIterator, _RandomA= ccessIterator, _Compare, typename iterator_traits<_Iter2>::difference_type,= bool) [with _AlgPolicy =3D _ClassicAlgPolicy; _Compare =3D ranges::less; _= RandomAccessIterator =3D long long unsigned int*; bool _UseBitSetPartition = =3D false; typename iterator_traits<_Iter2>::difference_type =3D long int]'= : /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:24:85: requi= red from 'void std::__1::__sort(_RandomAccessIterator, _RandomAccessIterato= r, _Comp) [with _Comp =3D __less<long long unsigned int>&; _RandomAccessIte= rator =3D long long unsigned int*]' /workspace/src/contrib/llvm-project/libcxx/src/algorithm.cpp:42:141: requ= ired from here /workspace/src/contrib/llvm-project/libcxx/include/__algorithm/sort.h:777:1= 7: error: no match for call to '(std::__1::ranges::less) (long long unsigne= d int&, long long unsigned int&)' 777 | if (__comp(*--__last, *__first)) | ~~~~~~^~~~~~~~~~~~~~~~~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: candidate: 'template<class _Tp, class _Up> requires = totally_ordered_with<_Tp, _Up> constexpr bool std::__1::ranges::less::oper= ator()(_Tp&&, _Up&&) const' 55 | [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp= && __t, _Up&& __u) const | ^~~~~~~~ /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: template argument deduction/substitution failed: /workspace/src/contrib/llvm-project/libcxx/include/__functional/ranges_oper= ations.h:55:54: note: constraints not satisfied --- any.o --- *** [any.o] Error code 1 make[4]: stopped in /workspace/src/lib/libc++ make[2]: stopped in /workspace/src 35.11 real 289.93 user 65.03 sys make[1]: stopped in /workspace/src make: stopped in /workspace/src Build step 'Execute shell' marked build as failure [WARNINGS]Skipping publisher since build result is FAILURE [PostBuildScript] - [INFO] Executing post build scripts. [FreeBSD-main-amd64-gcc12_build] $ /bin/sh -xe /tmp/jenkins8274010776508930= 977.sh + sh freebsd-ci/scripts/jail/clean.sh clean jail FreeBSD-main-amd64-gcc12_build Checking for post-build Performing post-build step Checking if email needs to be generated Email was triggered for: Failure - Any Sending email for trigger: Failure - Any Sending mail from default account using System Admin e-mail address ------=_Part_6016_1696760760.1712618929672--
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?1841530321.6017.1712618930533>