1 /* stest.c -- Test for libbacktrace internal sort function
2 Copyright (C) 2012-2018 Free Software Foundation, Inc.
3 Written by Ian Lance Taylor, Google.
4
5 Redistribution and use in source and binary forms, with or without
6 modification, are permitted provided that the following conditions are
7 met:
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
21 THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
22 IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
23 WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
24 DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
25 INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
26 (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
27 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
29 STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
30 IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
31 POSSIBILITY OF SUCH DAMAGE. */
32
33 #include "config.h"
34
35 #include <stdio.h>
36 #include <stdlib.h>
37 #include <string.h>
38 #include <sys/types.h>
39
40 #include "backtrace.h"
41 #include "internal.h"
42
43 /* Test the local qsort implementation. */
44
45 #define MAX 10
46
47 struct test
48 {
49 size_t count;
50 int input[MAX];
51 int output[MAX];
52 };
53
54 static struct test tests[] =
55 {
56 {
57 10,
58 { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 },
59 { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 }
60 },
61 {
62 9,
63 { 1, 2, 3, 4, 5, 6, 7, 8, 9 },
64 { 1, 2, 3, 4, 5, 6, 7, 8, 9 }
65 },
66 {
67 10,
68 { 10, 9, 8, 7, 6, 5, 4, 3, 2, 1 },
69 { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 },
70 },
71 {
72 9,
73 { 9, 8, 7, 6, 5, 4, 3, 2, 1 },
74 { 1, 2, 3, 4, 5, 6, 7, 8, 9 },
75 },
76 {
77 10,
78 { 2, 4, 6, 8, 10, 1, 3, 5, 7, 9 },
79 { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 },
80 },
81 {
82 5,
83 { 4, 5, 3, 1, 2 },
84 { 1, 2, 3, 4, 5 },
85 },
86 {
87 5,
88 { 1, 1, 1, 1, 1 },
89 { 1, 1, 1, 1, 1 },
90 },
91 {
92 5,
93 { 1, 1, 2, 1, 1 },
94 { 1, 1, 1, 1, 2 },
95 },
96 {
97 5,
98 { 2, 1, 1, 1, 1 },
99 { 1, 1, 1, 1, 2 },
100 },
101 };
102
103 static int
compare(const void * a,const void * b)104 compare (const void *a, const void *b)
105 {
106 const int *ai = (const int *) a;
107 const int *bi = (const int *) b;
108
109 return *ai - *bi;
110 }
111
112 int
main(int argc ATTRIBUTE_UNUSED,char ** argv ATTRIBUTE_UNUSED)113 main (int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
114 {
115 int failures;
116 size_t i;
117 int a[MAX];
118
119 failures = 0;
120 for (i = 0; i < sizeof tests / sizeof tests[0]; i++)
121 {
122 memcpy (a, tests[i].input, tests[i].count * sizeof (int));
123 backtrace_qsort (a, tests[i].count, sizeof (int), compare);
124 if (memcmp (a, tests[i].output, tests[i].count * sizeof (int)) != 0)
125 {
126 size_t j;
127
128 fprintf (stderr, "test %d failed:", (int) i);
129 for (j = 0; j < tests[i].count; j++)
130 fprintf (stderr, " %d", a[j]);
131 fprintf (stderr, "\n");
132 ++failures;
133 }
134 }
135
136 exit (failures > 0 ? EXIT_FAILURE : EXIT_SUCCESS);
137 }
138