WebSVN – HelenOS – Diff – /tags/0.2.0.1/kernel/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.
 */
 
/**
 * @file    sort.c
 * @brief   Sorting functions.
 *
 * This files contains functions implementing several sorting
 * algorithms (e.g. quick sort and bubble sort).
 */
 
#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

(root)/tags/0.2.0.1/kernel/generic/src/lib/sort.c – Rev 1965 → 1968

Rev 1965		Rev 1968
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	/**	29	/**
30	* @file sort.c	30	* @file sort.c
31	* @brief Sorting functions.	31	* @brief Sorting functions.
32	*	32	*
33	* This files contains functions implementing several sorting	33	* This files contains functions implementing several sorting
34	* algorithms (e.g. quick sort and bubble sort).	34	* algorithms (e.g. quick sort and bubble sort).
35	*/	35	*/
36		36
37	#include <mm/slab.h>	37	#include <mm/slab.h>
38	#include <memstr.h>	38	#include <memstr.h>
39	#include <sort.h>	39	#include <sort.h>
40	#include <panic.h>	40	#include <panic.h>
41		41
42	#define EBUFSIZE 32	42	#define EBUFSIZE 32
43		43
44	void _qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void tmp, void pivot);	44	void _qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void tmp, void pivot);
45	void _bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void *slot);	45	void _bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void *slot);
46		46
47	/** Quicksort wrapper	47	/** Quicksort wrapper
48	*	48	*
49	* This is only a wrapper that takes care of memory allocations for storing	49	* This is only a wrapper that takes care of memory allocations for storing
50	* the pivot and temporary elements for generic quicksort algorithm.	50	* the pivot and temporary elements for generic quicksort algorithm.
51	*	51	*
52	* This function _can_ sleep	52	* This function _can_ sleep
53	*	53	*
54	* @param data Pointer to data to be sorted.	54	* @param data Pointer to data to be sorted.
55	* @param n Number of elements to be sorted.	55	* @param n Number of elements to be sorted.
56	* @param e_size Size of one element.	56	* @param e_size Size of one element.
57	* @param cmp Comparator function.	57	* @param cmp Comparator function.
58	*	58	*
59	*/	59	*/
60	void qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b))	60	void qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b))
61	{	61	{
62	__u8 buf_tmp[EBUFSIZE];	62	__u8 buf_tmp[EBUFSIZE];
63	__u8 buf_pivot[EBUFSIZE];	63	__u8 buf_pivot[EBUFSIZE];
64	void * tmp = buf_tmp;	64	void * tmp = buf_tmp;
65	void * pivot = buf_pivot;	65	void * pivot = buf_pivot;
66		66
67	if (e_size > EBUFSIZE) {	67	if (e_size > EBUFSIZE) {
68	pivot = (void *) malloc(e_size, 0);	68	pivot = (void *) malloc(e_size, 0);
69	tmp = (void *) malloc(e_size, 0);	69	tmp = (void *) malloc(e_size, 0);
70	}	70	}
71		71
72	_qsort(data, n, e_size, cmp, tmp, pivot);	72	_qsort(data, n, e_size, cmp, tmp, pivot);
73		73
74	if (e_size > EBUFSIZE) {	74	if (e_size > EBUFSIZE) {
75	free(tmp);	75	free(tmp);
76	free(pivot);	76	free(pivot);
77	}	77	}
78	}	78	}
79		79
80	/** Quicksort	80	/** Quicksort
81	*	81	*
82	* Apply generic quicksort algorithm on supplied data, using pre-allocated buffers.	82	* Apply generic quicksort algorithm on supplied data, using pre-allocated buffers.
83	*	83	*
84	* @param data Pointer to data to be sorted.	84	* @param data Pointer to data to be sorted.
85	* @param n Number of elements to be sorted.	85	* @param n Number of elements to be sorted.
86	* @param e_size Size of one element.	86	* @param e_size Size of one element.
87	* @param cmp Comparator function.	87	* @param cmp Comparator function.
88	* @param tmp Pointer to scratch memory buffer e_size bytes long.	88	* @param tmp Pointer to scratch memory buffer e_size bytes long.
89	* @param pivot Pointer to scratch memory buffer e_size bytes long.	89	* @param pivot Pointer to scratch memory buffer e_size bytes long.
90	*	90	*
91	*/	91	*/
92	void _qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void tmp, void pivot)	92	void _qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void tmp, void pivot)
93	{	93	{
94	if (n > 4) {	94	if (n > 4) {
95	int i = 0, j = n - 1;	95	int i = 0, j = n - 1;
96		96
97	memcpy(pivot, data, e_size);	97	memcpy(pivot, data, e_size);
98		98
99	while (1) {	99	while (1) {
100	while ((cmp(data + i * e_size, pivot) < 0) && i < n) i++;	100	while ((cmp(data + i * e_size, pivot) < 0) && i < n) i++;
101	while ((cmp(data + j * e_size, pivot) >=0) && j > 0) j--;	101	while ((cmp(data + j * e_size, pivot) >=0) && j > 0) j--;
102	if (i<j) {	102	if (i<j) {
103	memcpy(tmp, data + i * e_size, e_size);	103	memcpy(tmp, data + i * e_size, e_size);
104	memcpy(data + i * e_size, data + j * e_size, e_size);	104	memcpy(data + i * e_size, data + j * e_size, e_size);
105	memcpy(data + j * e_size, tmp, e_size);	105	memcpy(data + j * e_size, tmp, e_size);
106	} else {	106	} else {
107	break;	107	break;
108	}	108	}
109	}	109	}
110		110
111	_qsort(data, j + 1, e_size, cmp, tmp, pivot);	111	_qsort(data, j + 1, e_size, cmp, tmp, pivot);
112	_qsort(data + (j + 1) * e_size, n - j - 1, e_size, cmp, tmp, pivot);	112	_qsort(data + (j + 1) * e_size, n - j - 1, e_size, cmp, tmp, pivot);
113	} else {	113	} else {
114	_bubblesort(data, n, e_size, cmp, tmp);	114	_bubblesort(data, n, e_size, cmp, tmp);
115	}	115	}
116	}	116	}
117		117
118	/** Bubblesort wrapper	118	/** Bubblesort wrapper
119	*	119	*
120	* This is only a wrapper that takes care of memory allocation for storing	120	* This is only a wrapper that takes care of memory allocation for storing
121	* the slot element for generic bubblesort algorithm.	121	* the slot element for generic bubblesort algorithm.
122	*	122	*
123	* @param data Pointer to data to be sorted.	123	* @param data Pointer to data to be sorted.
124	* @param n Number of elements to be sorted.	124	* @param n Number of elements to be sorted.
125	* @param e_size Size of one element.	125	* @param e_size Size of one element.
126	* @param cmp Comparator function.	126	* @param cmp Comparator function.
127	*	127	*
128	*/	128	*/
129	void bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b))	129	void bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b))
130	{	130	{
131	__u8 buf_slot[EBUFSIZE];	131	__u8 buf_slot[EBUFSIZE];
132	void * slot = buf_slot;	132	void * slot = buf_slot;
133		133
134	if (e_size > EBUFSIZE) {	134	if (e_size > EBUFSIZE) {
135	slot = (void *) malloc(e_size, 0);	135	slot = (void *) malloc(e_size, 0);
136	}	136	}
137		137
138	_bubblesort(data, n, e_size, cmp, slot);	138	_bubblesort(data, n, e_size, cmp, slot);
139		139
140	if (e_size > EBUFSIZE) {	140	if (e_size > EBUFSIZE) {
141	free(slot);	141	free(slot);
142	}	142	}
143	}	143	}
144		144
145	/** Bubblesort	145	/** Bubblesort
146	*	146	*
147	* Apply generic bubblesort algorithm on supplied data, using pre-allocated buffer.	147	* Apply generic bubblesort algorithm on supplied data, using pre-allocated buffer.
148	*	148	*
149	* @param data Pointer to data to be sorted.	149	* @param data Pointer to data to be sorted.
150	* @param n Number of elements to be sorted.	150	* @param n Number of elements to be sorted.
151	* @param e_size Size of one element.	151	* @param e_size Size of one element.
152	* @param cmp Comparator function.	152	* @param cmp Comparator function.
153	* @param slot Pointer to scratch memory buffer e_size bytes long.	153	* @param slot Pointer to scratch memory buffer e_size bytes long.
154	*	154	*
155	*/	155	*/
156	void _bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void *slot)	156	void _bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void *slot)
157	{	157	{
158	bool done = false;	158	bool done = false;
159	void * p;	159	void * p;
160		160
161	while (!done) {	161	while (!done) {
162	done = true;	162	done = true;
163	for (p = data; p < data + e_size * (n - 1); p = p + e_size) {	163	for (p = data; p < data + e_size * (n - 1); p = p + e_size) {
164	if (cmp(p, p + e_size) == 1) {	164	if (cmp(p, p + e_size) == 1) {
165	memcpy(slot, p, e_size);	165	memcpy(slot, p, e_size);
166	memcpy(p, p + e_size, e_size);	166	memcpy(p, p + e_size, e_size);
167	memcpy(p + e_size, slot, e_size);	167	memcpy(p + e_size, slot, e_size);
168	done = false;	168	done = false;
169	}	169	}
170	}	170	}
171	}	171	}
172		172
173	}	173	}
174		174
175	/*	175	/*
176	* Comparator returns 1 if a > b, 0 if a == b, -1 if a < b	176	* Comparator returns 1 if a > b, 0 if a == b, -1 if a < b
177	*/	177	*/
178	int int_cmp(void * a, void * b)	178	int int_cmp(void * a, void * b)
179	{	179	{
180	return (* (int ) a > (int)b) ? 1 : ((int )a < (int *)b) ? -1 : 0;	180	return (* (int ) a > (int)b) ? 1 : ((int )a < (int *)b) ? -1 : 0;
181	}	181	}
182		182
183	int __u8_cmp(void * a, void * b)	183	int __u8_cmp(void * a, void * b)
184	{	184	{
185	return (* (__u8 ) a > (__u8 )b) ? 1 : ((__u8 )a < (__u8 *)b) ? -1 : 0;	185	return (* (__u8 ) a > (__u8 )b) ? 1 : ((__u8 )a < (__u8 *)b) ? -1 : 0;
186	}	186	}
187		187
188	int __u16_cmp(void * a, void * b)	188	int __u16_cmp(void * a, void * b)
189	{	189	{
190	return (* (__u16 ) a > (__u16 )b) ? 1 : ((__u16 )a < (__u16 *)b) ? -1 : 0;	190	return (* (__u16 ) a > (__u16 )b) ? 1 : ((__u16 )a < (__u16 *)b) ? -1 : 0;
191	}	191	}
192		192
193	int __u32_cmp(void * a, void * b)	193	int __u32_cmp(void * a, void * b)
194	{	194	{
195	return (* (__u32 ) a > (__u32 )b) ? 1 : ((__u32 )a < (__u32 *)b) ? -1 : 0;	195	return (* (__u32 ) a > (__u32 )b) ? 1 : ((__u32 )a < (__u32 *)b) ? -1 : 0;
196	}	196	}
197		197