Rev 333 | Rev 336 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 333 | Rev 335 | ||
---|---|---|---|
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/heap.h> |
29 | #include <mm/heap.h> |
30 | #include <memstr.h> |
30 | #include <memstr.h> |
31 | #include <sort.h> |
31 | #include <sort.h> |
- | 32 | #include <panic.h> |
|
32 | 33 | ||
- | 34 | static void _qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void * pivot, void * tmp); |
|
33 | 35 | ||
- | 36 | /* |
|
- | 37 | * Wrapper method for quicksort algorithm to decrease amount of allocations |
|
- | 38 | */ |
|
34 | void qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b)) { |
39 | void qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b)) { |
35 | if (n > 4) { |
- | |
36 | int i = 0, j = n - 1; |
- | |
37 | void * tmp = (void *) malloc(e_size); |
40 | void * tmp = (void *) malloc(e_size); |
38 | void * pivot = (void *) malloc(e_size); |
41 | void * pivot = (void *) malloc(e_size); |
39 | 42 | ||
40 | memcpy(pivot, data, e_size); |
- | |
41 | - | ||
42 | while (1) { |
- | |
43 | while ((cmp(data + i * e_size, pivot) < 0) && i < n) i++; |
- | |
44 | while ((cmp(data + j * e_size, pivot) >=0) && j > 0) j--; |
- | |
45 | if (i<j) { |
43 | if (!tmp || !pivot) { |
46 | memcpy(tmp, data + i * e_size, e_size); |
44 | panic("qsort(): Cannot allocate memory\n"); |
47 | memcpy(data + i * e_size, data + j * e_size, e_size); |
- | |
48 | memcpy(data + j * e_size, tmp, e_size); |
- | |
49 | } else { |
- | |
50 | break; |
- | |
51 | } |
- | |
52 | } |
45 | } |
53 | 46 | ||
- | 47 | _qsort(data, n, e_size, cmp, pivot, tmp); |
|
- | 48 | ||
54 | free(tmp); |
49 | free(tmp); |
55 | free(pivot); |
50 | free(pivot); |
56 | - | ||
57 | qsort(data, j + 1, e_size, cmp); |
- | |
58 | qsort(data + (j + 1) * e_size, n - j - 1, e_size, cmp); |
- | |
59 | } else { |
- | |
60 | bubblesort(data, n, e_size, cmp); |
- | |
61 | } |
- | |
62 | } |
51 | } |
63 | 52 | ||
64 | 53 | ||
65 | void bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b)) { |
54 | void bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b)) { |
66 | bool done = false; |
55 | bool done = false; |
67 | void * p; |
56 | void * p; |
68 | void * slot = (void *) malloc(e_size); |
57 | void * slot = (void *) malloc(e_size); |
69 | 58 | ||
70 | while (!done) { |
59 | while (!done) { |
71 | done = true; |
60 | done = true; |
72 | for (p = data; p < data + e_size * (n - 1); p = p + e_size) { |
61 | for (p = data; p < data + e_size * (n - 1); p = p + e_size) { |
73 | if (cmp(p, p + e_size) == 1) { |
62 | if (cmp(p, p + e_size) == 1) { |
74 | memcpy(slot, p, e_size); |
63 | memcpy(slot, p, e_size); |
75 | memcpy(p, p + e_size, e_size); |
64 | memcpy(p, p + e_size, e_size); |
76 | memcpy(p + e_size, slot, e_size); |
65 | memcpy(p + e_size, slot, e_size); |
77 | done = false; |
66 | done = false; |
78 | } |
67 | } |
79 | } |
68 | } |
80 | } |
69 | } |
81 | 70 | ||
82 | free(slot); |
71 | free(slot); |
83 | } |
72 | } |
84 | 73 | ||
- | 74 | static void _qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void * pivot, void * tmp) { |
|
- | 75 | if (n > 4) { |
|
- | 76 | int i = 0, j = n - 1; |
|
- | 77 | ||
- | 78 | memcpy(pivot, data, e_size); |
|
- | 79 | ||
- | 80 | while (1) { |
|
- | 81 | while ((cmp(data + i * e_size, pivot) < 0) && i < n) i++; |
|
- | 82 | while ((cmp(data + j * e_size, pivot) >=0) && j > 0) j--; |
|
- | 83 | if (i<j) { |
|
- | 84 | memcpy(tmp, data + i * e_size, e_size); |
|
- | 85 | memcpy(data + i * e_size, data + j * e_size, e_size); |
|
- | 86 | memcpy(data + j * e_size, tmp, e_size); |
|
- | 87 | } else { |
|
- | 88 | break; |
|
- | 89 | } |
|
- | 90 | } |
|
- | 91 | ||
- | 92 | qsort(data, j + 1, e_size, cmp); |
|
- | 93 | qsort(data + (j + 1) * e_size, n - j - 1, e_size, cmp); |
|
- | 94 | } else { |
|
- | 95 | bubblesort(data, n, e_size, cmp); |
|
- | 96 | } |
|
- | 97 | } |
|
- | 98 | ||
- | 99 | ||
- | 100 | ||
85 | /* |
101 | /* |
86 | * Comparator returns 1 if a > b, 0 if a == b, -1 if a < b |
102 | * Comparator returns 1 if a > b, 0 if a == b, -1 if a < b |
87 | */ |
103 | */ |
88 | int int_cmp(void * a, void * b) { |
104 | int int_cmp(void * a, void * b) { |
89 | return (* (int *) a > * (int*)b) ? 1 : (*(int *)a < * (int *)b) ? -1 : 0; |
105 | return (* (int *) a > * (int*)b) ? 1 : (*(int *)a < * (int *)b) ? -1 : 0; |
90 | } |
106 | } |
91 | 107 | ||
92 | int __u8_cmp(void * a, void * b) { |
108 | int __u8_cmp(void * a, void * b) { |
93 | return (* (__u8 *) a > * (__u8 *)b) ? 1 : (*(__u8 *)a < * (__u8 *)b) ? -1 : 0; |
109 | return (* (__u8 *) a > * (__u8 *)b) ? 1 : (*(__u8 *)a < * (__u8 *)b) ? -1 : 0; |
94 | } |
110 | } |
95 | 111 | ||
96 | int __u16_cmp(void * a, void * b) { |
112 | int __u16_cmp(void * a, void * b) { |
97 | return (* (__u16 *) a > * (__u16 *)b) ? 1 : (*(__u16 *)a < * (__u16 *)b) ? -1 : 0; |
113 | return (* (__u16 *) a > * (__u16 *)b) ? 1 : (*(__u16 *)a < * (__u16 *)b) ? -1 : 0; |
98 | } |
114 | } |
99 | 115 | ||
100 | int __u32_cmp(void * a, void * b) { |
116 | int __u32_cmp(void * a, void * b) { |
101 | return (* (__u32 *) a > * (__u32 *)b) ? 1 : (*(__u32 *)a < * (__u32 *)b) ? -1 : 0; |
117 | return (* (__u32 *) a > * (__u32 *)b) ? 1 : (*(__u32 *)a < * (__u32 *)b) ? -1 : 0; |
102 | } |
118 | } |
103 | 119 | ||
104 | 120 |