mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2025-05-17 19:36:48 +00:00
cd0ad4216c
Replace most uses of `_LIBCPP_ASSERT` with `_LIBCPP_ASSERT_UNCATEGORIZED`. This is done as a prerequisite to introducing hardened mode to libc++. The idea is to make enabling assertions an opt-in with (somewhat) fine-grained controls over which categories of assertions are enabled. The vast majority of assertions are currently uncategorized; the new macro will allow turning on `_LIBCPP_ASSERT` (the underlying mechanism for all kinds of assertions) without enabling all the uncategorized assertions (in the future; this patch preserves the current behavior). Differential Revision: https://reviews.llvm.org/D153816
115 lines
3.8 KiB
C++
115 lines
3.8 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_SIFT_DOWN_H
|
|
#define _LIBCPP___ALGORITHM_SIFT_DOWN_H
|
|
|
|
#include <__algorithm/iterator_operations.h>
|
|
#include <__assert>
|
|
#include <__config>
|
|
#include <__iterator/iterator_traits.h>
|
|
#include <__utility/move.h>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
# pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
|
|
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 void
|
|
__sift_down(_RandomAccessIterator __first, _Compare&& __comp,
|
|
typename iterator_traits<_RandomAccessIterator>::difference_type __len,
|
|
_RandomAccessIterator __start)
|
|
{
|
|
using _Ops = _IterOps<_AlgPolicy>;
|
|
|
|
typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
|
|
typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type;
|
|
// left-child of __start is at 2 * __start + 1
|
|
// right-child of __start is at 2 * __start + 2
|
|
difference_type __child = __start - __first;
|
|
|
|
if (__len < 2 || (__len - 2) / 2 < __child)
|
|
return;
|
|
|
|
__child = 2 * __child + 1;
|
|
_RandomAccessIterator __child_i = __first + __child;
|
|
|
|
if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) {
|
|
// right-child exists and is greater than left-child
|
|
++__child_i;
|
|
++__child;
|
|
}
|
|
|
|
// check if we are in heap-order
|
|
if (__comp(*__child_i, *__start))
|
|
// we are, __start is larger than its largest child
|
|
return;
|
|
|
|
value_type __top(_Ops::__iter_move(__start));
|
|
do
|
|
{
|
|
// we are not in heap-order, swap the parent with its largest child
|
|
*__start = _Ops::__iter_move(__child_i);
|
|
__start = __child_i;
|
|
|
|
if ((__len - 2) / 2 < __child)
|
|
break;
|
|
|
|
// recompute the child based off of the updated parent
|
|
__child = 2 * __child + 1;
|
|
__child_i = __first + __child;
|
|
|
|
if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) {
|
|
// right-child exists and is greater than left-child
|
|
++__child_i;
|
|
++__child;
|
|
}
|
|
|
|
// check if we are in heap-order
|
|
} while (!__comp(*__child_i, __top));
|
|
*__start = _VSTD::move(__top);
|
|
}
|
|
|
|
template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
|
|
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _RandomAccessIterator
|
|
__floyd_sift_down(_RandomAccessIterator __first, _Compare&& __comp,
|
|
typename iterator_traits<_RandomAccessIterator>::difference_type __len)
|
|
{
|
|
using difference_type = typename iterator_traits<_RandomAccessIterator>::difference_type;
|
|
_LIBCPP_ASSERT_UNCATEGORIZED(__len >= 2, "shouldn't be called unless __len >= 2");
|
|
|
|
_RandomAccessIterator __hole = __first;
|
|
_RandomAccessIterator __child_i = __first;
|
|
difference_type __child = 0;
|
|
|
|
while (true) {
|
|
__child_i += difference_type(__child + 1);
|
|
__child = 2 * __child + 1;
|
|
|
|
if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) {
|
|
// right-child exists and is greater than left-child
|
|
++__child_i;
|
|
++__child;
|
|
}
|
|
|
|
// swap __hole with its largest child
|
|
*__hole = _IterOps<_AlgPolicy>::__iter_move(__child_i);
|
|
__hole = __child_i;
|
|
|
|
// if __hole is now a leaf, we're done
|
|
if (__child > (__len - 2) / 2)
|
|
return __hole;
|
|
}
|
|
}
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP___ALGORITHM_SIFT_DOWN_H
|