aboutsummaryrefslogtreecommitdiffstats
path: root/lib/sort.c
diff options
context:
space:
mode:
authorLinus Torvalds <torvalds@ppc970.osdl.org>2005-04-16 18:20:36 -0400
committerLinus Torvalds <torvalds@ppc970.osdl.org>2005-04-16 18:20:36 -0400
commit1da177e4c3f41524e886b7f1b8a0c1fc7321cac2 (patch)
tree0bba044c4ce775e45a88a51686b5d9f90697ea9d /lib/sort.c
Linux-2.6.12-rc2v2.6.12-rc2
Initial git repository build. I'm not bothering with the full history, even though we have it. We can create a separate "historical" git archive of that later if we want to, and in the meantime it's about 3.2GB when imported into git - space that would just make the early git days unnecessarily complicated, when we don't have a lot of good infrastructure for it. Let it rip!
Diffstat (limited to 'lib/sort.c')
-rw-r--r--lib/sort.c119
1 files changed, 119 insertions, 0 deletions
diff --git a/lib/sort.c b/lib/sort.c
new file mode 100644
index 000000000000..ea3caedeabdb
--- /dev/null
+++ b/lib/sort.c
@@ -0,0 +1,119 @@
1/*
2 * A fast, small, non-recursive O(nlog n) sort for the Linux kernel
3 *
4 * Jan 23 2005 Matt Mackall <mpm@selenic.com>
5 */
6
7#include <linux/kernel.h>
8#include <linux/module.h>
9
10void u32_swap(void *a, void *b, int size)
11{
12 u32 t = *(u32 *)a;
13 *(u32 *)a = *(u32 *)b;
14 *(u32 *)b = t;
15}
16
17void generic_swap(void *a, void *b, int size)
18{
19 char t;
20
21 do {
22 t = *(char *)a;
23 *(char *)a++ = *(char *)b;
24 *(char *)b++ = t;
25 } while (--size > 0);
26}
27
28/*
29 * sort - sort an array of elements
30 * @base: pointer to data to sort
31 * @num: number of elements
32 * @size: size of each element
33 * @cmp: pointer to comparison function
34 * @swap: pointer to swap function or NULL
35 *
36 * This function does a heapsort on the given array. You may provide a
37 * swap function optimized to your element type.
38 *
39 * Sorting time is O(n log n) both on average and worst-case. While
40 * qsort is about 20% faster on average, it suffers from exploitable
41 * O(n*n) worst-case behavior and extra memory requirements that make
42 * it less suitable for kernel use.
43 */
44
45void sort(void *base, size_t num, size_t size,
46 int (*cmp)(const void *, const void *),
47 void (*swap)(void *, void *, int size))
48{
49 /* pre-scale counters for performance */
50 int i = (num/2) * size, n = num * size, c, r;
51
52 if (!swap)
53 swap = (size == 4 ? u32_swap : generic_swap);
54
55 /* heapify */
56 for ( ; i >= 0; i -= size) {
57 for (r = i; r * 2 < n; r = c) {
58 c = r * 2;
59 if (c < n - size && cmp(base + c, base + c + size) < 0)
60 c += size;
61 if (cmp(base + r, base + c) >= 0)
62 break;
63 swap(base + r, base + c, size);
64 }
65 }
66
67 /* sort */
68 for (i = n - size; i >= 0; i -= size) {
69 swap(base, base + i, size);
70 for (r = 0; r * 2 < i; r = c) {
71 c = r * 2;
72 if (c < i - size && cmp(base + c, base + c + size) < 0)
73 c += size;
74 if (cmp(base + r, base + c) >= 0)
75 break;
76 swap(base + r, base + c, size);
77 }
78 }
79}
80
81EXPORT_SYMBOL(sort);
82
83#if 0
84/* a simple boot-time regression test */
85
86int cmpint(const void *a, const void *b)
87{
88 return *(int *)a - *(int *)b;
89}
90
91static int sort_test(void)
92{
93 int *a, i, r = 0;
94
95 a = kmalloc(1000 * sizeof(int), GFP_KERNEL);
96 BUG_ON(!a);
97
98 printk("testing sort()\n");
99
100 for (i = 0; i < 1000; i++) {
101 r = (r * 725861) % 6599;
102 a[i] = r;
103 }
104
105 sort(a, 1000, sizeof(int), cmpint, NULL);
106
107 for (i = 0; i < 999; i++)
108 if (a[i] > a[i+1]) {
109 printk("sort() failed!\n");
110 break;
111 }
112
113 kfree(a);
114
115 return 0;
116}
117
118module_init(sort_test);
119#endif