Skip to content

Commit

Permalink
---
Browse files Browse the repository at this point in the history
yaml
---
r: 144367
b: refs/heads/master
c: 08a42e8
h: refs/heads/master
i:
  144365: 49c33fc
  144363: eeccf3a
  144359: a99982b
  144351: b3b302e
v: v3
  • Loading branch information
Ivan Kokshaysky authored and Linus Torvalds committed May 2, 2009
1 parent 613bdfb commit a054394
Show file tree
Hide file tree
Showing 3 changed files with 42 additions and 2 deletions.
2 changes: 1 addition & 1 deletion [refs]
Original file line number Diff line number Diff line change
@@ -1,2 +1,2 @@
---
refs/heads/master: 1ffb1c0c64b4a2b75eed1f63cc47f2beb711c92f
refs/heads/master: 08a42e86bce511b45ca3eee40f51674b02a777d1
2 changes: 2 additions & 0 deletions trunk/arch/alpha/include/asm/uaccess.h
Original file line number Diff line number Diff line change
Expand Up @@ -507,5 +507,7 @@ struct exception_table_entry
(pc) + (_fixup)->fixup.bits.nextinsn; \
})

#define ARCH_HAS_SORT_EXTABLE
#define ARCH_HAS_SEARCH_EXTABLE

#endif /* __ALPHA_UACCESS_H */
40 changes: 39 additions & 1 deletion trunk/arch/alpha/mm/extable.c
Original file line number Diff line number Diff line change
Expand Up @@ -3,11 +3,49 @@
*/

#include <linux/module.h>
#include <linux/sort.h>
#include <asm/uaccess.h>

static inline unsigned long ex_to_addr(const struct exception_table_entry *x)
{
return (unsigned long)&x->insn + x->insn;
}

static void swap_ex(void *a, void *b, int size)
{
struct exception_table_entry *ex_a = a, *ex_b = b;
unsigned long addr_a = ex_to_addr(ex_a), addr_b = ex_to_addr(ex_b);
unsigned int t = ex_a->fixup.unit;

ex_a->fixup.unit = ex_b->fixup.unit;
ex_b->fixup.unit = t;
ex_a->insn = (int)(addr_b - (unsigned long)&ex_a->insn);
ex_b->insn = (int)(addr_a - (unsigned long)&ex_b->insn);
}

/*
* The exception table needs to be sorted so that the binary
* search that we use to find entries in it works properly.
* This is used both for the kernel exception table and for
* the exception tables of modules that get loaded.
*/
static int cmp_ex(const void *a, const void *b)
{
const struct exception_table_entry *x = a, *y = b;

/* avoid overflow */
if (ex_to_addr(x) > ex_to_addr(y))
return 1;
if (ex_to_addr(x) < ex_to_addr(y))
return -1;
return 0;
}

void sort_extable(struct exception_table_entry *start,
struct exception_table_entry *finish)
{
sort(start, finish - start, sizeof(struct exception_table_entry),
cmp_ex, swap_ex);
}

const struct exception_table_entry *
Expand All @@ -20,7 +58,7 @@ search_extable(const struct exception_table_entry *first,
unsigned long mid_value;

mid = (last - first) / 2 + first;
mid_value = (unsigned long)&mid->insn + mid->insn;
mid_value = ex_to_addr(mid);
if (mid_value == value)
return mid;
else if (mid_value < value)
Expand Down

0 comments on commit a054394

Please sign in to comment.