1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
//===-- Implementation header for qsort utilities ---------------*- 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 LLVM_LIBC_SRC_STDLIB_QSORT_UTIL_H
#define LLVM_LIBC_SRC_STDLIB_QSORT_UTIL_H
#include "src/stdlib/heap_sort.h"
#include "src/stdlib/quick_sort.h"
#define LIBC_QSORT_QUICK_SORT 1
#define LIBC_QSORT_HEAP_SORT 2
#ifndef LIBC_QSORT_IMPL
#define LIBC_QSORT_IMPL LIBC_QSORT_QUICK_SORT
#endif // LIBC_QSORT_IMPL
#if (LIBC_QSORT_IMPL != LIBC_QSORT_QUICK_SORT && \
LIBC_QSORT_IMPL != LIBC_QSORT_HEAP_SORT)
#error "LIBC_QSORT_IMPL is not recognized."
#endif
namespace LIBC_NAMESPACE_DECL {
namespace internal {
template <bool USE_QUICKSORT, typename F>
LIBC_INLINE void unstable_sort_impl(void *array, size_t array_len,
size_t elem_size, const F &is_less) {
if (array == nullptr || array_len == 0 || elem_size == 0)
return;
if constexpr (USE_QUICKSORT) {
switch (elem_size) {
case 4: {
auto arr_fixed_size = internal::ArrayFixedSize<4>(array, array_len);
quick_sort(arr_fixed_size, is_less);
return;
}
case 8: {
auto arr_fixed_size = internal::ArrayFixedSize<8>(array, array_len);
quick_sort(arr_fixed_size, is_less);
return;
}
case 16: {
auto arr_fixed_size = internal::ArrayFixedSize<16>(array, array_len);
quick_sort(arr_fixed_size, is_less);
return;
}
default:
auto arr_generic_size =
internal::ArrayGenericSize(array, array_len, elem_size);
quick_sort(arr_generic_size, is_less);
return;
}
} else {
auto arr_generic_size =
internal::ArrayGenericSize(array, array_len, elem_size);
heap_sort(arr_generic_size, is_less);
}
}
template <typename F>
LIBC_INLINE void unstable_sort(void *array, size_t array_len, size_t elem_size,
const F &is_less) {
#define USE_QUICK_SORT ((LIBC_QSORT_IMPL) == (LIBC_QSORT_QUICK_SORT))
unstable_sort_impl<USE_QUICK_SORT, F>(array, array_len, elem_size, is_less);
}
} // namespace internal
} // namespace LIBC_NAMESPACE_DECL
#endif // LLVM_LIBC_SRC_STDLIB_QSORT_UTIL_H
|
