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