parisc: use sort() instead of home-made implementation (v2)

Signed-off-by: Helge Deller <deller@gmx.de>
Signed-off-by: Randolph Chung <tausq@parisc-linux.org>
Signed-off-by: Kyle McMartin <kyle@mcmartin.ca>

diff --git a/arch/parisc/kernel/unwind.c b/arch/parisc/kernel/unwind.c
index f03f6fb0ec839ca36f1ccdd4079226760dbdcd96..d58eac1a8288af9c07ef776faa9b29d6b1890a2e 100644 (file)
--- a/arch/parisc/kernel/unwind.c
+++ b/arch/parisc/kernel/unwind.c
@@ -13,6 +13,7 @@
 #include <linux/sched.h>
 #include <linux/slab.h>
 #include <linux/kallsyms.h>
+#include <linux/sort.h>
 
 #include <asm/uaccess.h>
 #include <asm/assembly.h>
@@ -115,24 +116,18 @@ unwind_table_init(struct unwind_table *table, const char *name,
        }
 }
 
+static int cmp_unwind_table_entry(const void *a, const void *b)
+{
+       return ((const struct unwind_table_entry *)a)->region_start
+            - ((const struct unwind_table_entry *)b)->region_start;
+}
+
 static void
 unwind_table_sort(struct unwind_table_entry *start,
                  struct unwind_table_entry *finish)
 {
-       struct unwind_table_entry el, *p, *q;
-
-       for (p = start + 1; p < finish; ++p) {
-               if (p[0].region_start < p[-1].region_start) {
-                       el = *p;
-                       q = p;
-                       do {
-                               q[0] = q[-1];
-                               --q;
-                       } while (q > start && 
-                                el.region_start < q[-1].region_start);
-                       *q = el;
-               }
-       }
+       sort(start, finish - start, sizeof(struct unwind_table_entry),
+            cmp_unwind_table_entry, NULL);
 }
 
 struct unwind_table *