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
|
/*
Unix SMB/CIFS implementation.
typesafe qsort
Copyright (C) Andrew Tridgell 2010
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _TSORT_H
#define _TSORT_H
#include <assert.h>
/*
a wrapper around qsort() that ensures the comparison function is
type safe.
*/
#ifndef TYPESAFE_QSORT
#define TYPESAFE_QSORT(base, numel, comparison) \
do { \
if (numel > 1) { \
qsort(base, numel, sizeof((base)[0]), (int (*)(const void *, const void *))comparison); \
assert(comparison(&((base)[0]), &((base)[1])) <= 0); \
} \
} while (0)
#endif
#ifndef NUMERIC_CMP
/*
* NUMERIC_CMP is a safe replacement for `a - b` in comparison
* functions. It will work on integers, pointers, and floats.
*
* Rather than
*
* return a - b;
*
* use
*
* return NUMERIC_CMP(a, b);
*
* and you won't have any troubles if a - b would overflow.
*/
#define NUMERIC_CMP(a, b) (((a) > (b)) - ((a) < (b)))
#endif
#endif
|
