2 * linux/arch/x86_64/mm/extable.c
5 #include <linux/config.h>
6 #include <linux/module.h>
7 #include <linux/spinlock.h>
8 #include <linux/init.h>
9 #include <asm/uaccess.h>
11 /* Simple binary search */
12 const struct exception_table_entry *
13 search_extable(const struct exception_table_entry *first,
14 const struct exception_table_entry *last,
17 /* Work around a B stepping K8 bug */
18 if ((value >> 32) == 0)
19 value |= 0xffffffffUL << 32;
21 while (first <= last) {
22 const struct exception_table_entry *mid;
25 mid = (last - first) / 2 + first;
26 diff = mid->insn - value;
37 /* When an exception handler is in an non standard section (like __init)
38 the fixup table can end up unordered. Fix that here. */
39 void sort_extable(struct exception_table_entry *start,
40 struct exception_table_entry *finish)
42 struct exception_table_entry *e;
45 /* The input is near completely presorted, which makes bubble sort the
46 best (and simplest) sort algorithm. */
49 for (e = start+1; e < finish; e++) {
50 if (e->insn < e[-1].insn) {
51 struct exception_table_entry tmp = e[-1];
57 } while (change != 0);