1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD 3 * 4 * Copyright (c) 2011 The FreeBSD Foundation 5 * All rights reserved. 6 * 7 * This software was developed by Konstantin Belousov under sponsorship from 8 * the FreeBSD Foundation. 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 AUTHOR AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 */ 31 32 #include <dev/drm2/drmP.h> 33 __FBSDID("$FreeBSD$"); 34 35 struct drm_list_sort_thunk { 36 int (*cmp)(void *, struct list_head *, struct list_head *); 37 void *priv; 38 }; 39 40 static int 41 drm_le_cmp(void *priv, const void *d1, const void *d2) 42 { 43 struct list_head *le1, *le2; 44 struct drm_list_sort_thunk *thunk; 45 46 thunk = priv; 47 le1 = *(__DECONST(struct list_head **, d1)); 48 le2 = *(__DECONST(struct list_head **, d2)); 49 return ((thunk->cmp)(thunk->priv, le1, le2)); 50 } 51 52 /* 53 * Punt and use array sort. 54 */ 55 void 56 drm_list_sort(void *priv, struct list_head *head, int (*cmp)(void *priv, 57 struct list_head *a, struct list_head *b)) 58 { 59 struct drm_list_sort_thunk thunk; 60 struct list_head **ar, *le; 61 int count, i; 62 63 count = 0; 64 list_for_each(le, head) 65 count++; 66 ar = malloc(sizeof(struct list_head *) * count, M_TEMP, M_WAITOK); 67 i = 0; 68 list_for_each(le, head) 69 ar[i++] = le; 70 thunk.cmp = cmp; 71 thunk.priv = priv; 72 qsort_r(ar, count, sizeof(struct list_head *), &thunk, drm_le_cmp); 73 INIT_LIST_HEAD(head); 74 for (i = 0; i < count; i++) 75 list_add_tail(ar[i], head); 76 free(ar, M_TEMP); 77 } 78