1 /* $NetBSD: sort.h,v 1.3 2021/12/19 11:20:41 riastradh Exp $ */
2
3 /*-
4 * Copyright (c) 2018 The NetBSD Foundation, Inc.
5 * All rights reserved.
6 *
7 * This code is derived from software contributed to The NetBSD Foundation
8 * by Taylor R. Campbell.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 * POSSIBILITY OF SUCH DAMAGE.
30 */
31
32 #ifndef _LINUX_SORT_H_
33 #define _LINUX_SORT_H_
34
35 #include <sys/kmem.h>
36
37 #include <lib/libkern/libkern.h>
38
39 static inline void
sort(void * array,size_t nelem,size_t elemsize,int (* cmp)(const void *,const void *),void (* swap)(void *,void *,int))40 sort(void *array, size_t nelem, size_t elemsize,
41 int (*cmp)(const void *, const void *),
42 void (*swap)(void *, void *, int))
43 {
44 void *tmp;
45
46 KASSERT(swap == NULL); /* XXX */
47 KASSERT(elemsize != 0);
48 KASSERT(nelem <= SIZE_MAX/elemsize);
49
50 tmp = kmem_alloc(elemsize, KM_SLEEP);
51 kheapsort(array, nelem, elemsize, cmp, tmp);
52 kmem_free(tmp, elemsize);
53 }
54
55 #endif /* _LINUX_SORT_H_ */
56