1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
3 *
4 * Copyright (c) 2011 The FreeBSD Foundation
5 *
6 * This software was developed by Konstantin Belousov under sponsorship from
7 * the FreeBSD Foundation.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 * SUCH DAMAGE.
29 */
30
31 #include <dev/drm2/drmP.h>
32 struct drm_list_sort_thunk {
33 int (*cmp)(void *, struct list_head *, struct list_head *);
34 void *priv;
35 };
36
37 static int
drm_le_cmp(const void * d1,const void * d2,void * priv)38 drm_le_cmp(const void *d1, const void *d2, void *priv)
39 {
40 struct list_head *le1, *le2;
41 struct drm_list_sort_thunk *thunk;
42
43 thunk = priv;
44 le1 = *(__DECONST(struct list_head **, d1));
45 le2 = *(__DECONST(struct list_head **, d2));
46 return ((thunk->cmp)(thunk->priv, le1, le2));
47 }
48
49 /*
50 * Punt and use array sort.
51 */
52 void
drm_list_sort(void * priv,struct list_head * head,int (* cmp)(void * priv,struct list_head * a,struct list_head * b))53 drm_list_sort(void *priv, struct list_head *head, int (*cmp)(void *priv,
54 struct list_head *a, struct list_head *b))
55 {
56 struct drm_list_sort_thunk thunk;
57 struct list_head **ar, *le;
58 int count, i;
59
60 count = 0;
61 list_for_each(le, head)
62 count++;
63 ar = malloc(sizeof(struct list_head *) * count, M_TEMP, M_WAITOK);
64 i = 0;
65 list_for_each(le, head)
66 ar[i++] = le;
67 thunk.cmp = cmp;
68 thunk.priv = priv;
69 qsort_r(ar, count, sizeof(struct list_head *), drm_le_cmp, &thunk);
70 INIT_LIST_HEAD(head);
71 for (i = 0; i < count; i++)
72 list_add_tail(ar[i], head);
73 free(ar, M_TEMP);
74 }
75