WebSVN – HelenOS-historic – Diff – /kernel/trunk/generic/src/lib/sort.c


/*
 * Copyright (C) 2005 Sergey Bondari
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#include <mm/slab.h>
#include <memstr.h>
#include <sort.h>
#include <panic.h>
 
#define EBUFSIZE    32
 
void _qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void *tmp, void *pivot);
void _bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void *slot);
 
/** Quicksort wrapper
 *
 * This is only a wrapper that takes care of memory allocations for storing
 * the pivot and temporary elements for generic quicksort algorithm.
 *
 * This function _can_ sleep
 *
 * @param data Pointer to data to be sorted.
 * @param n Number of elements to be sorted.
 * @param e_size Size of one element.
 * @param cmp Comparator function.
 *
 */
void qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b))
{
    __u8 buf_tmp[EBUFSIZE];
    __u8 buf_pivot[EBUFSIZE];
    void * tmp = buf_tmp;
    void * pivot = buf_pivot;
 
    if (e_size > EBUFSIZE) {
        pivot = (void *) malloc(e_size, 0);
        tmp = (void *) malloc(e_size, 0);
 
 
 
 
    }
 
    _qsort(data, n, e_size, cmp, tmp, pivot);
   
    if (e_size > EBUFSIZE) {
        free(tmp);
        free(pivot);
    }
}
 
/** Quicksort
 *
 * Apply generic quicksort algorithm on supplied data, using pre-allocated buffers.
 *
 * @param data Pointer to data to be sorted.
 * @param n Number of elements to be sorted.
 * @param e_size Size of one element.
 * @param cmp Comparator function.
 * @param tmp Pointer to scratch memory buffer e_size bytes long.
 * @param pivot Pointer to scratch memory buffer e_size bytes long.
 *
 */
void _qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void *tmp, void *pivot)
{
    if (n > 4) {
        int i = 0, j = n - 1;
 
        memcpy(pivot, data, e_size);
 
        while (1) {
            while ((cmp(data + i * e_size, pivot) < 0) && i < n) i++;
            while ((cmp(data + j * e_size, pivot) >=0) && j > 0) j--;
            if (i<j) {
                memcpy(tmp, data + i * e_size, e_size);
                memcpy(data + i * e_size, data + j * e_size, e_size);
                memcpy(data + j * e_size, tmp, e_size);
            } else {
                break;
            }
        }
 
        _qsort(data, j + 1, e_size, cmp, tmp, pivot);
        _qsort(data + (j + 1) * e_size, n - j - 1, e_size, cmp, tmp, pivot);
    } else {
        _bubblesort(data, n, e_size, cmp, tmp);
    }
}
 
/** Bubblesort wrapper
 *
 * This is only a wrapper that takes care of memory allocation for storing
 * the slot element for generic bubblesort algorithm.
 *
 * @param data Pointer to data to be sorted.
 * @param n Number of elements to be sorted.
 * @param e_size Size of one element.
 * @param cmp Comparator function.
 *
 */
void bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b))
{
    __u8 buf_slot[EBUFSIZE];
    void * slot = buf_slot;
   
    if (e_size > EBUFSIZE) {
        slot = (void *) malloc(e_size, 0);
 
 
 
 
    }
 
    _bubblesort(data, n, e_size, cmp, slot);
   
    if (e_size > EBUFSIZE) {
        free(slot);
    }
}
 
/** Bubblesort
 *
 * Apply generic bubblesort algorithm on supplied data, using pre-allocated buffer.
 *
 * @param data Pointer to data to be sorted.
 * @param n Number of elements to be sorted.
 * @param e_size Size of one element.
 * @param cmp Comparator function.
 * @param slot Pointer to scratch memory buffer e_size bytes long.
 *
 */
void _bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void *slot)
{
    bool done = false;
    void * p;
 
    while (!done) {
        done = true;
        for (p = data; p < data + e_size * (n - 1); p = p + e_size) {
            if (cmp(p, p + e_size) == 1) {
                memcpy(slot, p, e_size);
                memcpy(p, p + e_size, e_size);
                memcpy(p + e_size, slot, e_size);
                done = false;
            }
        }
    }
 
}
 
/*
 * Comparator returns 1 if a > b, 0 if a == b, -1 if a < b
 */
int int_cmp(void * a, void * b)
{
    return (* (int *) a > * (int*)b) ? 1 : (*(int *)a < * (int *)b) ? -1 : 0;
}
 
int __u8_cmp(void * a, void * b)
{
    return (* (__u8 *) a > * (__u8 *)b) ? 1 : (*(__u8 *)a < * (__u8 *)b) ? -1 : 0;
}
 
int __u16_cmp(void * a, void * b)
{
    return (* (__u16 *) a > * (__u16 *)b) ? 1 : (*(__u16 *)a < * (__u16 *)b) ? -1 : 0;
}
 
int __u32_cmp(void * a, void * b)
{
    return (* (__u32 *) a > * (__u32 *)b) ? 1 : (*(__u32 *)a < * (__u32 *)b) ? -1 : 0;
}
 

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/lib/sort.c – Rev 814 → 822

Rev 814		Rev 822
1	/*	1	/*
2	* Copyright (C) 2005 Sergey Bondari	2	* Copyright (C) 2005 Sergey Bondari
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	13	* documentation and/or other materials provided with the distribution.
14	* - The name of the author may not be used to endorse or promote products	14	* - The name of the author may not be used to endorse or promote products
15	* derived from this software without specific prior written permission.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF	25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	#include <mm/slab.h>	29	#include <mm/slab.h>
30	#include <memstr.h>	30	#include <memstr.h>
31	#include <sort.h>	31	#include <sort.h>
32	#include <panic.h>	32	#include <panic.h>
33		33
34	#define EBUFSIZE 32	34	#define EBUFSIZE 32
35		35
36	void _qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void tmp, void pivot);	36	void _qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void tmp, void pivot);
37	void _bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void *slot);	37	void _bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void *slot);
38		38
39	/** Quicksort wrapper	39	/** Quicksort wrapper
40	*	40	*
41	* This is only a wrapper that takes care of memory allocations for storing	41	* This is only a wrapper that takes care of memory allocations for storing
42	* the pivot and temporary elements for generic quicksort algorithm.	42	* the pivot and temporary elements for generic quicksort algorithm.
43	*	43	*
-		44	* This function _can_ sleep
-		45	*
44	* @param data Pointer to data to be sorted.	46	* @param data Pointer to data to be sorted.
45	* @param n Number of elements to be sorted.	47	* @param n Number of elements to be sorted.
46	* @param e_size Size of one element.	48	* @param e_size Size of one element.
47	* @param cmp Comparator function.	49	* @param cmp Comparator function.
48	*	50	*
49	*/	51	*/
50	void qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b))	52	void qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b))
51	{	53	{
52	__u8 buf_tmp[EBUFSIZE];	54	__u8 buf_tmp[EBUFSIZE];
53	__u8 buf_pivot[EBUFSIZE];	55	__u8 buf_pivot[EBUFSIZE];
54	void * tmp = buf_tmp;	56	void * tmp = buf_tmp;
55	void * pivot = buf_pivot;	57	void * pivot = buf_pivot;
56		58
57	if (e_size > EBUFSIZE) {	59	if (e_size > EBUFSIZE) {
58	pivot = (void *) malloc(e_size);	60	pivot = (void *) malloc(e_size, 0);
59	tmp = (void *) malloc(e_size);	61	tmp = (void *) malloc(e_size, 0);
60		-
61	if (!tmp \|\| !pivot) {	-
62	panic("Cannot allocate memory\n");	-
63	}	-
64	}	62	}
65		63
66	_qsort(data, n, e_size, cmp, tmp, pivot);	64	_qsort(data, n, e_size, cmp, tmp, pivot);
67		65
68	if (e_size > EBUFSIZE) {	66	if (e_size > EBUFSIZE) {
69	free(tmp);	67	free(tmp);
70	free(pivot);	68	free(pivot);
71	}	69	}
72	}	70	}
73		71
74	/** Quicksort	72	/** Quicksort
75	*	73	*
76	* Apply generic quicksort algorithm on supplied data, using pre-allocated buffers.	74	* Apply generic quicksort algorithm on supplied data, using pre-allocated buffers.
77	*	75	*
78	* @param data Pointer to data to be sorted.	76	* @param data Pointer to data to be sorted.
79	* @param n Number of elements to be sorted.	77	* @param n Number of elements to be sorted.
80	* @param e_size Size of one element.	78	* @param e_size Size of one element.
81	* @param cmp Comparator function.	79	* @param cmp Comparator function.
82	* @param tmp Pointer to scratch memory buffer e_size bytes long.	80	* @param tmp Pointer to scratch memory buffer e_size bytes long.
83	* @param pivot Pointer to scratch memory buffer e_size bytes long.	81	* @param pivot Pointer to scratch memory buffer e_size bytes long.
84	*	82	*
85	*/	83	*/
86	void _qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void tmp, void pivot)	84	void _qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void tmp, void pivot)
87	{	85	{
88	if (n > 4) {	86	if (n > 4) {
89	int i = 0, j = n - 1;	87	int i = 0, j = n - 1;
90		88
91	memcpy(pivot, data, e_size);	89	memcpy(pivot, data, e_size);
92		90
93	while (1) {	91	while (1) {
94	while ((cmp(data + i * e_size, pivot) < 0) && i < n) i++;	92	while ((cmp(data + i * e_size, pivot) < 0) && i < n) i++;
95	while ((cmp(data + j * e_size, pivot) >=0) && j > 0) j--;	93	while ((cmp(data + j * e_size, pivot) >=0) && j > 0) j--;
96	if (i<j) {	94	if (i<j) {
97	memcpy(tmp, data + i * e_size, e_size);	95	memcpy(tmp, data + i * e_size, e_size);
98	memcpy(data + i * e_size, data + j * e_size, e_size);	96	memcpy(data + i * e_size, data + j * e_size, e_size);
99	memcpy(data + j * e_size, tmp, e_size);	97	memcpy(data + j * e_size, tmp, e_size);
100	} else {	98	} else {
101	break;	99	break;
102	}	100	}
103	}	101	}
104		102
105	_qsort(data, j + 1, e_size, cmp, tmp, pivot);	103	_qsort(data, j + 1, e_size, cmp, tmp, pivot);
106	_qsort(data + (j + 1) * e_size, n - j - 1, e_size, cmp, tmp, pivot);	104	_qsort(data + (j + 1) * e_size, n - j - 1, e_size, cmp, tmp, pivot);
107	} else {	105	} else {
108	_bubblesort(data, n, e_size, cmp, tmp);	106	_bubblesort(data, n, e_size, cmp, tmp);
109	}	107	}
110	}	108	}
111		109
112	/** Bubblesort wrapper	110	/** Bubblesort wrapper
113	*	111	*
114	* This is only a wrapper that takes care of memory allocation for storing	112	* This is only a wrapper that takes care of memory allocation for storing
115	* the slot element for generic bubblesort algorithm.	113	* the slot element for generic bubblesort algorithm.
116	*	114	*
117	* @param data Pointer to data to be sorted.	115	* @param data Pointer to data to be sorted.
118	* @param n Number of elements to be sorted.	116	* @param n Number of elements to be sorted.
119	* @param e_size Size of one element.	117	* @param e_size Size of one element.
120	* @param cmp Comparator function.	118	* @param cmp Comparator function.
121	*	119	*
122	*/	120	*/
123	void bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b))	121	void bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b))
124	{	122	{
125	__u8 buf_slot[EBUFSIZE];	123	__u8 buf_slot[EBUFSIZE];
126	void * slot = buf_slot;	124	void * slot = buf_slot;
127		125
128	if (e_size > EBUFSIZE) {	126	if (e_size > EBUFSIZE) {
129	slot = (void *) malloc(e_size);	127	slot = (void *) malloc(e_size, 0);
130		-
131	if (!slot) {	-
132	panic("Cannot allocate memory\n");	-
133	}	-
134	}	128	}
135		129
136	_bubblesort(data, n, e_size, cmp, slot);	130	_bubblesort(data, n, e_size, cmp, slot);
137		131
138	if (e_size > EBUFSIZE) {	132	if (e_size > EBUFSIZE) {
139	free(slot);	133	free(slot);
140	}	134	}
141	}	135	}
142		136
143	/** Bubblesort	137	/** Bubblesort
144	*	138	*
145	* Apply generic bubblesort algorithm on supplied data, using pre-allocated buffer.	139	* Apply generic bubblesort algorithm on supplied data, using pre-allocated buffer.
146	*	140	*
147	* @param data Pointer to data to be sorted.	141	* @param data Pointer to data to be sorted.
148	* @param n Number of elements to be sorted.	142	* @param n Number of elements to be sorted.
149	* @param e_size Size of one element.	143	* @param e_size Size of one element.
150	* @param cmp Comparator function.	144	* @param cmp Comparator function.
151	* @param slot Pointer to scratch memory buffer e_size bytes long.	145	* @param slot Pointer to scratch memory buffer e_size bytes long.
152	*	146	*
153	*/	147	*/
154	void _bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void *slot)	148	void _bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void *slot)
155	{	149	{
156	bool done = false;	150	bool done = false;
157	void * p;	151	void * p;
158		152
159	while (!done) {	153	while (!done) {
160	done = true;	154	done = true;
161	for (p = data; p < data + e_size * (n - 1); p = p + e_size) {	155	for (p = data; p < data + e_size * (n - 1); p = p + e_size) {
162	if (cmp(p, p + e_size) == 1) {	156	if (cmp(p, p + e_size) == 1) {
163	memcpy(slot, p, e_size);	157	memcpy(slot, p, e_size);
164	memcpy(p, p + e_size, e_size);	158	memcpy(p, p + e_size, e_size);
165	memcpy(p + e_size, slot, e_size);	159	memcpy(p + e_size, slot, e_size);
166	done = false;	160	done = false;
167	}	161	}
168	}	162	}
169	}	163	}
170		164
171	}	165	}
172		166
173	/*	167	/*
174	* Comparator returns 1 if a > b, 0 if a == b, -1 if a < b	168	* Comparator returns 1 if a > b, 0 if a == b, -1 if a < b
175	*/	169	*/
176	int int_cmp(void * a, void * b)	170	int int_cmp(void * a, void * b)
177	{	171	{
178	return (* (int ) a > (int)b) ? 1 : ((int )a < (int *)b) ? -1 : 0;	172	return (* (int ) a > (int)b) ? 1 : ((int )a < (int *)b) ? -1 : 0;
179	}	173	}
180		174
181	int __u8_cmp(void * a, void * b)	175	int __u8_cmp(void * a, void * b)
182	{	176	{
183	return (* (__u8 ) a > (__u8 )b) ? 1 : ((__u8 )a < (__u8 *)b) ? -1 : 0;	177	return (* (__u8 ) a > (__u8 )b) ? 1 : ((__u8 )a < (__u8 *)b) ? -1 : 0;
184	}	178	}
185		179
186	int __u16_cmp(void * a, void * b)	180	int __u16_cmp(void * a, void * b)
187	{	181	{
188	return (* (__u16 ) a > (__u16 )b) ? 1 : ((__u16 )a < (__u16 *)b) ? -1 : 0;	182	return (* (__u16 ) a > (__u16 )b) ? 1 : ((__u16 )a < (__u16 *)b) ? -1 : 0;
189	}	183	}
190		184
191	int __u32_cmp(void * a, void * b)	185	int __u32_cmp(void * a, void * b)
192	{	186	{
193	return (* (__u32 ) a > (__u32 )b) ? 1 : ((__u32 )a < (__u32 *)b) ? -1 : 0;	187	return (* (__u32 ) a > (__u32 )b) ? 1 : ((__u32 )a < (__u32 *)b) ? -1 : 0;
194	}	188	}
195		189