The open source OpenXR runtime
matrixfurry.com
1/* sort.c -- Sort without allocating memory
2 Copyright (C) 2012-2021 Free Software Foundation, Inc.
3 Written by Ian Lance Taylor, Google.
4
5Redistribution and use in source and binary forms, with or without
6modification, are permitted provided that the following conditions are
7met:
8
9 (1) Redistributions of source code must retain the above copyright
10 notice, this list of conditions and the following disclaimer.
11
12 (2) Redistributions in binary form must reproduce the above copyright
13 notice, this list of conditions and the following disclaimer in
14 the documentation and/or other materials provided with the
15 distribution.
16
17 (3) The name of the author may not be used to
18 endorse or promote products derived from this software without
19 specific prior written permission.
20
21THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
22IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
23WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
24DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
25INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
26(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
27SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
29STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
30IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
31POSSIBILITY OF SUCH DAMAGE. */
32
33#include "config.h"
34
35#include <stddef.h>
36#include <sys/types.h>
37
38#include "backtrace.hpp"
39#include "internal.hpp"
40
41namespace tracy
42{
43
44/* The GNU glibc version of qsort allocates memory, which we must not
45 do if we are invoked by a signal handler. So provide our own
46 sort. */
47
48static void
49swap (char *a, char *b, size_t size)
50{
51 size_t i;
52
53 for (i = 0; i < size; i++, a++, b++)
54 {
55 char t;
56
57 t = *a;
58 *a = *b;
59 *b = t;
60 }
61}
62
63void
64backtrace_qsort (void *basearg, size_t count, size_t size,
65 int (*compar) (const void *, const void *))
66{
67 char *base = (char *) basearg;
68 size_t i;
69 size_t mid;
70
71 tail_recurse:
72 if (count < 2)
73 return;
74
75 /* The symbol table and DWARF tables, which is all we use this
76 routine for, tend to be roughly sorted. Pick the middle element
77 in the array as our pivot point, so that we are more likely to
78 cut the array in half for each recursion step. */
79 swap (base, base + (count / 2) * size, size);
80
81 mid = 0;
82 for (i = 1; i < count; i++)
83 {
84 if ((*compar) (base, base + i * size) > 0)
85 {
86 ++mid;
87 if (i != mid)
88 swap (base + mid * size, base + i * size, size);
89 }
90 }
91
92 if (mid > 0)
93 swap (base, base + mid * size, size);
94
95 /* Recurse with the smaller array, loop with the larger one. That
96 ensures that our maximum stack depth is log count. */
97 if (2 * mid < count)
98 {
99 backtrace_qsort (base, mid, size, compar);
100 base += (mid + 1) * size;
101 count -= mid + 1;
102 goto tail_recurse;
103 }
104 else
105 {
106 backtrace_qsort (base + (mid + 1) * size, count - (mid + 1),
107 size, compar);
108 count = mid;
109 goto tail_recurse;
110 }
111}
112
113}