11.3Sriastrad/* $NetBSD: sort.h,v 1.3 2021/12/19 11:20:41 riastradh Exp $ */ 21.1Sriastrad 31.1Sriastrad/*- 41.1Sriastrad * Copyright (c) 2018 The NetBSD Foundation, Inc. 51.1Sriastrad * All rights reserved. 61.1Sriastrad * 71.1Sriastrad * This code is derived from software contributed to The NetBSD Foundation 81.1Sriastrad * by Taylor R. Campbell. 91.1Sriastrad * 101.1Sriastrad * Redistribution and use in source and binary forms, with or without 111.1Sriastrad * modification, are permitted provided that the following conditions 121.1Sriastrad * are met: 131.1Sriastrad * 1. Redistributions of source code must retain the above copyright 141.1Sriastrad * notice, this list of conditions and the following disclaimer. 151.1Sriastrad * 2. Redistributions in binary form must reproduce the above copyright 161.1Sriastrad * notice, this list of conditions and the following disclaimer in the 171.1Sriastrad * documentation and/or other materials provided with the distribution. 181.1Sriastrad * 191.1Sriastrad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 201.1Sriastrad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 211.1Sriastrad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 221.1Sriastrad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 231.1Sriastrad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 241.1Sriastrad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 251.1Sriastrad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 261.1Sriastrad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 271.1Sriastrad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 281.1Sriastrad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 291.1Sriastrad * POSSIBILITY OF SUCH DAMAGE. 301.1Sriastrad */ 311.1Sriastrad 321.1Sriastrad#ifndef _LINUX_SORT_H_ 331.1Sriastrad#define _LINUX_SORT_H_ 341.1Sriastrad 351.2Sriastrad#include <sys/kmem.h> 361.2Sriastrad 371.2Sriastrad#include <lib/libkern/libkern.h> 381.2Sriastrad 391.2Sriastradstatic inline void 401.2Sriastradsort(void *array, size_t nelem, size_t elemsize, 411.2Sriastrad int (*cmp)(const void *, const void *), 421.2Sriastrad void (*swap)(void *, void *, int)) 431.2Sriastrad{ 441.2Sriastrad void *tmp; 451.2Sriastrad 461.2Sriastrad KASSERT(swap == NULL); /* XXX */ 471.2Sriastrad KASSERT(elemsize != 0); 481.2Sriastrad KASSERT(nelem <= SIZE_MAX/elemsize); 491.2Sriastrad 501.3Sriastrad tmp = kmem_alloc(elemsize, KM_SLEEP); 511.2Sriastrad kheapsort(array, nelem, elemsize, cmp, tmp); 521.3Sriastrad kmem_free(tmp, elemsize); 531.2Sriastrad} 541.2Sriastrad 551.1Sriastrad#endif /* _LINUX_SORT_H_ */ 56