2 * Copyright (c) 2005 Sergey Bondari
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
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
15 * derived from this software without specific prior written permission.
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
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
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
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
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 /** @addtogroup generic
35 * @brief Sorting functions.
37 * This files contains functions implementing several sorting
38 * algorithms (e.g. quick sort and bubble sort).
48 void _qsort(void * data
, count_t n
, size_t e_size
, int (* cmp
) (void * a
, void * b
), void *tmp
, void *pivot
);
49 void _bubblesort(void * data
, count_t n
, size_t e_size
, int (* cmp
) (void * a
, void * b
), void *slot
);
53 * This is only a wrapper that takes care of memory allocations for storing
54 * the pivot and temporary elements for generic quicksort algorithm.
56 * This function _can_ sleep
58 * @param data Pointer to data to be sorted.
59 * @param n Number of elements to be sorted.
60 * @param e_size Size of one element.
61 * @param cmp Comparator function.
64 void qsort(void * data
, count_t n
, size_t e_size
, int (* cmp
) (void * a
, void * b
))
66 uint8_t buf_tmp
[EBUFSIZE
];
67 uint8_t buf_pivot
[EBUFSIZE
];
69 void * pivot
= buf_pivot
;
71 if (e_size
> EBUFSIZE
) {
72 pivot
= (void *) malloc(e_size
, 0);
73 tmp
= (void *) malloc(e_size
, 0);
76 _qsort(data
, n
, e_size
, cmp
, tmp
, pivot
);
78 if (e_size
> EBUFSIZE
) {
86 * Apply generic quicksort algorithm on supplied data, using pre-allocated buffers.
88 * @param data Pointer to data to be sorted.
89 * @param n Number of elements to be sorted.
90 * @param e_size Size of one element.
91 * @param cmp Comparator function.
92 * @param tmp Pointer to scratch memory buffer e_size bytes long.
93 * @param pivot Pointer to scratch memory buffer e_size bytes long.
96 void _qsort(void * data
, count_t n
, size_t e_size
, int (* cmp
) (void * a
, void * b
), void *tmp
, void *pivot
)
101 memcpy(pivot
, data
, e_size
);
104 while ((cmp(data
+ i
* e_size
, pivot
) < 0) && i
< n
) i
++;
105 while ((cmp(data
+ j
* e_size
, pivot
) >=0) && j
> 0) j
--;
107 memcpy(tmp
, data
+ i
* e_size
, e_size
);
108 memcpy(data
+ i
* e_size
, data
+ j
* e_size
, e_size
);
109 memcpy(data
+ j
* e_size
, tmp
, e_size
);
115 _qsort(data
, j
+ 1, e_size
, cmp
, tmp
, pivot
);
116 _qsort(data
+ (j
+ 1) * e_size
, n
- j
- 1, e_size
, cmp
, tmp
, pivot
);
118 _bubblesort(data
, n
, e_size
, cmp
, tmp
);
122 /** Bubblesort wrapper
124 * This is only a wrapper that takes care of memory allocation for storing
125 * the slot element for generic bubblesort algorithm.
127 * @param data Pointer to data to be sorted.
128 * @param n Number of elements to be sorted.
129 * @param e_size Size of one element.
130 * @param cmp Comparator function.
133 void bubblesort(void * data
, count_t n
, size_t e_size
, int (* cmp
) (void * a
, void * b
))
135 uint8_t buf_slot
[EBUFSIZE
];
136 void * slot
= buf_slot
;
138 if (e_size
> EBUFSIZE
) {
139 slot
= (void *) malloc(e_size
, 0);
142 _bubblesort(data
, n
, e_size
, cmp
, slot
);
144 if (e_size
> EBUFSIZE
) {
151 * Apply generic bubblesort algorithm on supplied data, using pre-allocated buffer.
153 * @param data Pointer to data to be sorted.
154 * @param n Number of elements to be sorted.
155 * @param e_size Size of one element.
156 * @param cmp Comparator function.
157 * @param slot Pointer to scratch memory buffer e_size bytes long.
160 void _bubblesort(void * data
, count_t n
, size_t e_size
, int (* cmp
) (void * a
, void * b
), void *slot
)
167 for (p
= data
; p
< data
+ e_size
* (n
- 1); p
= p
+ e_size
) {
168 if (cmp(p
, p
+ e_size
) == 1) {
169 memcpy(slot
, p
, e_size
);
170 memcpy(p
, p
+ e_size
, e_size
);
171 memcpy(p
+ e_size
, slot
, e_size
);
180 * Comparator returns 1 if a > b, 0 if a == b, -1 if a < b
182 int int_cmp(void * a
, void * b
)
184 return (* (int *) a
> * (int*)b
) ? 1 : (*(int *)a
< * (int *)b
) ? -1 : 0;
187 int uint8_t_cmp(void * a
, void * b
)
189 return (* (uint8_t *) a
> * (uint8_t *)b
) ? 1 : (*(uint8_t *)a
< * (uint8_t *)b
) ? -1 : 0;
192 int uint16_t_cmp(void * a
, void * b
)
194 return (* (uint16_t *) a
> * (uint16_t *)b
) ? 1 : (*(uint16_t *)a
< * (uint16_t *)b
) ? -1 : 0;
197 int uint32_t_cmp(void * a
, void * b
)
199 return (* (uint32_t *) a
> * (uint32_t *)b
) ? 1 : (*(uint32_t *)a
< * (uint32_t *)b
) ? -1 : 0;