mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2025-05-17 03:16:35 +00:00
615e6dd1c5
We recently noticed that the unwrap_iter.h file was pushing macros, but
it was pushing them again instead of popping them at the end of the
file. This led to libc++ basically swallowing any custom definition of
these macros in user code:
#define min HELLO
#include <algorithm>
// min is not HELLO anymore, it's not defined
While investigating this issue, I noticed that our push/pop pragmas were
actually entirely wrong too. Indeed, instead of pushing macros like
`move`, we'd push `move(int, int)` in the pragma, which is not a valid
macro name. As a result, we would not actually push macros like `move`
-- instead we'd simply undefine them. This led to the following code not
working:
#define move HELLO
#include <algorithm>
// move is not HELLO anymore
Fixing the pragma push/pop incantations led to a cascade of issues
because we use identifiers like `move` in a large number of places, and
all of these headers would now need to do the push/pop dance.
This patch fixes all these issues. First, it adds a check that we don't
swallow important names like min, max, move or refresh as explained
above. This is done by augmenting the existing
system_reserved_names.gen.py test to also check that the macros are what
we expect after including each header.
Second, it fixes the push/pop pragmas to work properly and adds missing
pragmas to all the files I could detect a failure in via the newly added
test.
rdar://121365472
(cherry picked from commit 7b4622514d232ce5f7110dd8b20d90e81127c467)
111 lines
3.9 KiB
C++
111 lines
3.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_RANGES_PARTITION_COPY_H
|
|
#define _LIBCPP___ALGORITHM_RANGES_PARTITION_COPY_H
|
|
|
|
#include <__algorithm/in_out_out_result.h>
|
|
#include <__config>
|
|
#include <__functional/identity.h>
|
|
#include <__functional/invoke.h>
|
|
#include <__iterator/concepts.h>
|
|
#include <__iterator/iterator_traits.h>
|
|
#include <__iterator/projected.h>
|
|
#include <__ranges/access.h>
|
|
#include <__ranges/concepts.h>
|
|
#include <__ranges/dangling.h>
|
|
#include <__type_traits/remove_cvref.h>
|
|
#include <__utility/move.h>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
# pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_PUSH_MACROS
|
|
#include <__undef_macros>
|
|
|
|
#if _LIBCPP_STD_VER >= 20
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
namespace ranges {
|
|
|
|
template <class _InIter, class _OutIter1, class _OutIter2>
|
|
using partition_copy_result = in_out_out_result<_InIter, _OutIter1, _OutIter2>;
|
|
|
|
namespace __partition_copy {
|
|
|
|
struct __fn {
|
|
// TODO(ranges): delegate to the classic algorithm.
|
|
template <class _InIter, class _Sent, class _OutIter1, class _OutIter2, class _Proj, class _Pred>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr static partition_copy_result<__remove_cvref_t<_InIter>,
|
|
__remove_cvref_t<_OutIter1>,
|
|
__remove_cvref_t<_OutIter2> >
|
|
__partition_copy_fn_impl(
|
|
_InIter&& __first,
|
|
_Sent&& __last,
|
|
_OutIter1&& __out_true,
|
|
_OutIter2&& __out_false,
|
|
_Pred& __pred,
|
|
_Proj& __proj) {
|
|
for (; __first != __last; ++__first) {
|
|
if (std::invoke(__pred, std::invoke(__proj, *__first))) {
|
|
*__out_true = *__first;
|
|
++__out_true;
|
|
|
|
} else {
|
|
*__out_false = *__first;
|
|
++__out_false;
|
|
}
|
|
}
|
|
|
|
return {std::move(__first), std::move(__out_true), std::move(__out_false)};
|
|
}
|
|
|
|
template <input_iterator _InIter,
|
|
sentinel_for<_InIter> _Sent,
|
|
weakly_incrementable _OutIter1,
|
|
weakly_incrementable _OutIter2,
|
|
class _Proj = identity,
|
|
indirect_unary_predicate<projected<_InIter, _Proj>> _Pred>
|
|
requires indirectly_copyable<_InIter, _OutIter1> && indirectly_copyable<_InIter, _OutIter2>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr partition_copy_result<_InIter, _OutIter1, _OutIter2> operator()(
|
|
_InIter __first, _Sent __last, _OutIter1 __out_true, _OutIter2 __out_false, _Pred __pred, _Proj __proj = {})
|
|
const {
|
|
return __partition_copy_fn_impl(
|
|
std::move(__first), std::move(__last), std::move(__out_true), std::move(__out_false), __pred, __proj);
|
|
}
|
|
|
|
template <input_range _Range,
|
|
weakly_incrementable _OutIter1,
|
|
weakly_incrementable _OutIter2,
|
|
class _Proj = identity,
|
|
indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
|
|
requires indirectly_copyable<iterator_t<_Range>, _OutIter1> && indirectly_copyable<iterator_t<_Range>, _OutIter2>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr partition_copy_result<borrowed_iterator_t<_Range>, _OutIter1, _OutIter2>
|
|
operator()(_Range&& __range, _OutIter1 __out_true, _OutIter2 __out_false, _Pred __pred, _Proj __proj = {}) const {
|
|
return __partition_copy_fn_impl(
|
|
ranges::begin(__range), ranges::end(__range), std::move(__out_true), std::move(__out_false), __pred, __proj);
|
|
}
|
|
};
|
|
|
|
} // namespace __partition_copy
|
|
|
|
inline namespace __cpo {
|
|
inline constexpr auto partition_copy = __partition_copy::__fn{};
|
|
} // namespace __cpo
|
|
} // namespace ranges
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP_STD_VER >= 20
|
|
|
|
_LIBCPP_POP_MACROS
|
|
|
|
#endif // _LIBCPP___ALGORITHM_RANGES_PARTITION_COPY_H
|