1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
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 __FBSDID("$FreeBSD$");
33
34 struct drm_list_sort_thunk {
35 int (*cmp)(void *, struct list_head *, struct list_head *);
36 void *priv;
37 };
38
39 static int
40 drm_le_cmp(void *priv, const void *d1, const void *d2)
41 {
42 struct list_head *le1, *le2;
43 struct drm_list_sort_thunk *thunk;
44
45 thunk = priv;
46 le1 = *(__DECONST(struct list_head **, d1));
47 le2 = *(__DECONST(struct list_head **, d2));
48 return ((thunk->cmp)(thunk->priv, le1, le2));
49 }
50
51 /*
52 * Punt and use array sort.
53 */
54 void
55 drm_list_sort(void *priv, struct list_head *head, int (*cmp)(void *priv,
56 struct list_head *a, struct list_head *b))
57 {
58 struct drm_list_sort_thunk thunk;
59 struct list_head **ar, *le;
60 int count, i;
61
62 count = 0;
63 list_for_each(le, head)
64 count++;
65 ar = malloc(sizeof(struct list_head *) * count, M_TEMP, M_WAITOK);
66 i = 0;
67 list_for_each(le, head)
68 ar[i++] = le;
69 thunk.cmp = cmp;
70 thunk.priv = priv;
71 qsort_r(ar, count, sizeof(struct list_head *), &thunk, drm_le_cmp);
72 INIT_LIST_HEAD(head);
73 for (i = 0; i < count; i++)
74 list_add_tail(ar[i], head);
75 free(ar, M_TEMP);
76 }
Cache object: 6670690d3cd54cb577dcd3cf32e64df7
|