Blame view
lib/sort.c
2.94 KB
1da177e4c Linux-2.6.12-rc2 |
1 2 3 4 5 |
/* * A fast, small, non-recursive O(nlog n) sort for the Linux kernel * * Jan 23 2005 Matt Mackall <mpm@selenic.com> */ |
42cf80965 lib/sort.c: use s... |
6 7 |
#include <linux/types.h> #include <linux/export.h> |
ecec4cb7a [PATCH] lib/sort.... |
8 |
#include <linux/sort.h> |
1da177e4c Linux-2.6.12-rc2 |
9 |
|
ca96ab859 lib/sort: Add 64 ... |
10 11 12 13 14 |
static int alignment_ok(const void *base, int align) { return IS_ENABLED(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) || ((unsigned long)base & (align - 1)) == 0; } |
ecec4cb7a [PATCH] lib/sort.... |
15 |
static void u32_swap(void *a, void *b, int size) |
1da177e4c Linux-2.6.12-rc2 |
16 17 18 19 20 |
{ u32 t = *(u32 *)a; *(u32 *)a = *(u32 *)b; *(u32 *)b = t; } |
ca96ab859 lib/sort: Add 64 ... |
21 22 23 24 25 26 |
static void u64_swap(void *a, void *b, int size) { u64 t = *(u64 *)a; *(u64 *)a = *(u64 *)b; *(u64 *)b = t; } |
ecec4cb7a [PATCH] lib/sort.... |
27 |
static void generic_swap(void *a, void *b, int size) |
1da177e4c Linux-2.6.12-rc2 |
28 29 30 31 32 33 34 35 36 |
{ char t; do { t = *(char *)a; *(char *)a++ = *(char *)b; *(char *)b++ = t; } while (--size > 0); } |
72fd4a35a [PATCH] Numerous ... |
37 |
/** |
1da177e4c Linux-2.6.12-rc2 |
38 39 40 41 |
* sort - sort an array of elements * @base: pointer to data to sort * @num: number of elements * @size: size of each element |
b53907c01 generic swap(): l... |
42 43 |
* @cmp_func: pointer to comparison function * @swap_func: pointer to swap function or NULL |
1da177e4c Linux-2.6.12-rc2 |
44 45 |
* * This function does a heapsort on the given array. You may provide a |
b53907c01 generic swap(): l... |
46 |
* swap_func function optimized to your element type. |
1da177e4c Linux-2.6.12-rc2 |
47 48 49 50 51 52 53 54 |
* * Sorting time is O(n log n) both on average and worst-case. While * qsort is about 20% faster on average, it suffers from exploitable * O(n*n) worst-case behavior and extra memory requirements that make * it less suitable for kernel use. */ void sort(void *base, size_t num, size_t size, |
b53907c01 generic swap(): l... |
55 56 |
int (*cmp_func)(const void *, const void *), void (*swap_func)(void *, void *, int size)) |
1da177e4c Linux-2.6.12-rc2 |
57 58 |
{ /* pre-scale counters for performance */ |
d3717bdf8 [PATCH] low perfo... |
59 |
int i = (num/2 - 1) * size, n = num * size, c, r; |
1da177e4c Linux-2.6.12-rc2 |
60 |
|
ca96ab859 lib/sort: Add 64 ... |
61 62 63 64 65 66 67 68 |
if (!swap_func) { if (size == 4 && alignment_ok(base, 4)) swap_func = u32_swap; else if (size == 8 && alignment_ok(base, 8)) swap_func = u64_swap; else swap_func = generic_swap; } |
1da177e4c Linux-2.6.12-rc2 |
69 70 71 |
/* heapify */ for ( ; i >= 0; i -= size) { |
d3717bdf8 [PATCH] low perfo... |
72 73 |
for (r = i; r * 2 + size < n; r = c) { c = r * 2 + size; |
b53907c01 generic swap(): l... |
74 75 |
if (c < n - size && cmp_func(base + c, base + c + size) < 0) |
1da177e4c Linux-2.6.12-rc2 |
76 |
c += size; |
b53907c01 generic swap(): l... |
77 |
if (cmp_func(base + r, base + c) >= 0) |
1da177e4c Linux-2.6.12-rc2 |
78 |
break; |
b53907c01 generic swap(): l... |
79 |
swap_func(base + r, base + c, size); |
1da177e4c Linux-2.6.12-rc2 |
80 81 82 83 |
} } /* sort */ |
995e4286a lib/sort.c optimi... |
84 |
for (i = n - size; i > 0; i -= size) { |
b53907c01 generic swap(): l... |
85 |
swap_func(base, base + i, size); |
d3717bdf8 [PATCH] low perfo... |
86 87 |
for (r = 0; r * 2 + size < i; r = c) { c = r * 2 + size; |
b53907c01 generic swap(): l... |
88 89 |
if (c < i - size && cmp_func(base + c, base + c + size) < 0) |
1da177e4c Linux-2.6.12-rc2 |
90 |
c += size; |
b53907c01 generic swap(): l... |
91 |
if (cmp_func(base + r, base + c) >= 0) |
1da177e4c Linux-2.6.12-rc2 |
92 |
break; |
b53907c01 generic swap(): l... |
93 |
swap_func(base + r, base + c, size); |
1da177e4c Linux-2.6.12-rc2 |
94 95 96 97 98 99 100 |
} } } EXPORT_SYMBOL(sort); #if 0 |
2ddae683b lib/sort.c: move ... |
101 |
#include <linux/slab.h> |
1da177e4c Linux-2.6.12-rc2 |
102 103 104 105 106 107 108 109 110 |
/* a simple boot-time regression test */ int cmpint(const void *a, const void *b) { return *(int *)a - *(int *)b; } static int sort_test(void) { |
d28c2bc8d [PATCH] fix lib/s... |
111 |
int *a, i, r = 1; |
1da177e4c Linux-2.6.12-rc2 |
112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 |
a = kmalloc(1000 * sizeof(int), GFP_KERNEL); BUG_ON(!a); printk("testing sort() "); for (i = 0; i < 1000; i++) { r = (r * 725861) % 6599; a[i] = r; } sort(a, 1000, sizeof(int), cmpint, NULL); for (i = 0; i < 999; i++) if (a[i] > a[i+1]) { printk("sort() failed! "); break; } kfree(a); return 0; } module_init(sort_test); #endif |