mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2025-05-19 20:36:42 +00:00
4c19854222
In preparation for running clang-format on the whole code base, we are also removing mentions of the legacy _LIBCPP_INLINE_VISIBILITY macro in favor of the newer _LIBCPP_HIDE_FROM_ABI. We're still leaving the definition of _LIBCPP_INLINE_VISIBILITY to avoid creating needless breakage in case some older patches are checked-in with mentions of the old macro. After we branch for LLVM 18, we can do another pass to clean up remaining uses of the macro that might have gotten introduced by mistake (if any) and remove the macro itself at the same time. This is just a minor convenience to smooth out the transition as much as possible. See https://discourse.llvm.org/t/rfc-clang-formatting-all-of-libc-once-and-for-all for the clang-format proposal.
126 lines
4.9 KiB
C++
126 lines
4.9 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef _LIBCPP___ALGORITHM_COPY_H
|
|
#define _LIBCPP___ALGORITHM_COPY_H
|
|
|
|
#include <__algorithm/copy_move_common.h>
|
|
#include <__algorithm/for_each_segment.h>
|
|
#include <__algorithm/iterator_operations.h>
|
|
#include <__algorithm/min.h>
|
|
#include <__config>
|
|
#include <__iterator/segmented_iterator.h>
|
|
#include <__type_traits/common_type.h>
|
|
#include <__utility/move.h>
|
|
#include <__utility/pair.h>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
# pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_PUSH_MACROS
|
|
#include <__undef_macros>
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
template <class, class _InIter, class _Sent, class _OutIter>
|
|
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter> __copy(_InIter, _Sent, _OutIter);
|
|
|
|
template <class _AlgPolicy>
|
|
struct __copy_loop {
|
|
template <class _InIter, class _Sent, class _OutIter>
|
|
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
|
|
operator()(_InIter __first, _Sent __last, _OutIter __result) const {
|
|
while (__first != __last) {
|
|
*__result = *__first;
|
|
++__first;
|
|
++__result;
|
|
}
|
|
|
|
return std::make_pair(std::move(__first), std::move(__result));
|
|
}
|
|
|
|
template <class _InIter, class _OutIter>
|
|
struct _CopySegment {
|
|
using _Traits = __segmented_iterator_traits<_InIter>;
|
|
|
|
_OutIter& __result_;
|
|
|
|
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 explicit _CopySegment(_OutIter& __result)
|
|
: __result_(__result) {}
|
|
|
|
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 void
|
|
operator()(typename _Traits::__local_iterator __lfirst, typename _Traits::__local_iterator __llast) {
|
|
__result_ = std::__copy<_AlgPolicy>(__lfirst, __llast, std::move(__result_)).second;
|
|
}
|
|
};
|
|
|
|
template <class _InIter, class _OutIter, __enable_if_t<__is_segmented_iterator<_InIter>::value, int> = 0>
|
|
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
|
|
operator()(_InIter __first, _InIter __last, _OutIter __result) const {
|
|
std::__for_each_segment(__first, __last, _CopySegment<_InIter, _OutIter>(__result));
|
|
return std::make_pair(__last, std::move(__result));
|
|
}
|
|
|
|
template <class _InIter,
|
|
class _OutIter,
|
|
__enable_if_t<__has_random_access_iterator_category<_InIter>::value &&
|
|
!__is_segmented_iterator<_InIter>::value && __is_segmented_iterator<_OutIter>::value,
|
|
int> = 0>
|
|
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_InIter, _OutIter>
|
|
operator()(_InIter __first, _InIter __last, _OutIter __result) const {
|
|
using _Traits = __segmented_iterator_traits<_OutIter>;
|
|
using _DiffT = typename common_type<__iter_diff_t<_InIter>, __iter_diff_t<_OutIter> >::type;
|
|
|
|
if (__first == __last)
|
|
return std::make_pair(std::move(__first), std::move(__result));
|
|
|
|
auto __local_first = _Traits::__local(__result);
|
|
auto __segment_iterator = _Traits::__segment(__result);
|
|
while (true) {
|
|
auto __local_last = _Traits::__end(__segment_iterator);
|
|
auto __size = std::min<_DiffT>(__local_last - __local_first, __last - __first);
|
|
auto __iters = std::__copy<_AlgPolicy>(__first, __first + __size, __local_first);
|
|
__first = std::move(__iters.first);
|
|
|
|
if (__first == __last)
|
|
return std::make_pair(std::move(__first), _Traits::__compose(__segment_iterator, std::move(__iters.second)));
|
|
|
|
__local_first = _Traits::__begin(++__segment_iterator);
|
|
}
|
|
}
|
|
};
|
|
|
|
struct __copy_trivial {
|
|
// At this point, the iterators have been unwrapped so any `contiguous_iterator` has been unwrapped to a pointer.
|
|
template <class _In, class _Out, __enable_if_t<__can_lower_copy_assignment_to_memmove<_In, _Out>::value, int> = 0>
|
|
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_In*, _Out*>
|
|
operator()(_In* __first, _In* __last, _Out* __result) const {
|
|
return std::__copy_trivial_impl(__first, __last, __result);
|
|
}
|
|
};
|
|
|
|
template <class _AlgPolicy, class _InIter, class _Sent, class _OutIter>
|
|
pair<_InIter, _OutIter> inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
|
|
__copy(_InIter __first, _Sent __last, _OutIter __result) {
|
|
return std::__dispatch_copy_or_move<_AlgPolicy, __copy_loop<_AlgPolicy>, __copy_trivial>(
|
|
std::move(__first), std::move(__last), std::move(__result));
|
|
}
|
|
|
|
template <class _InputIterator, class _OutputIterator>
|
|
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _OutputIterator
|
|
copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) {
|
|
return std::__copy<_ClassicAlgPolicy>(__first, __last, __result).second;
|
|
}
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
_LIBCPP_POP_MACROS
|
|
|
|
#endif // _LIBCPP___ALGORITHM_COPY_H
|