Release 4.18 lib/extable.c
/*
* Derived from arch/ppc/mm/extable.c and arch/i386/mm/extable.c.
*
* Copyright (C) 2004 Paul Mackerras, IBM Corp.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version
* 2 of the License, or (at your option) any later version.
*/
#include <linux/bsearch.h>
#include <linux/module.h>
#include <linux/init.h>
#include <linux/sort.h>
#include <linux/uaccess.h>
#ifndef ARCH_HAS_RELATIVE_EXTABLE
#define ex_to_insn(x) ((x)->insn)
#else
static inline unsigned long ex_to_insn(const struct exception_table_entry *x)
{
return (unsigned long)&x->insn + x->insn;
}
Contributors
Person | Tokens | Prop | Commits | CommitProp |
Ard Biesheuvel | 28 | 100.00% | 1 | 100.00% |
Total | 28 | 100.00% | 1 | 100.00% |
#endif
#ifndef ARCH_HAS_SORT_EXTABLE
#ifndef ARCH_HAS_RELATIVE_EXTABLE
#define swap_ex NULL
#else
static void swap_ex(void *a, void *b, int size)
{
struct exception_table_entry *x = a, *y = b, tmp;
int delta = b - a;
tmp = *x;
x->insn = y->insn + delta;
y->insn = tmp.insn - delta;
#ifdef swap_ex_entry_fixup
swap_ex_entry_fixup(x, y, tmp, delta);
#else
x->fixup = y->fixup + delta;
y->fixup = tmp.fixup - delta;
#endif
}
Contributors
Person | Tokens | Prop | Commits | CommitProp |
Ard Biesheuvel | 101 | 100.00% | 1 | 100.00% |
Total | 101 | 100.00% | 1 | 100.00% |
#endif /* ARCH_HAS_RELATIVE_EXTABLE */
/*
* 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_sort(const void *a, const void *b)
{
const struct exception_table_entry *x = a, *y = b;
/* avoid overflow */
if (ex_to_insn(x) > ex_to_insn(y))
return 1;
if (ex_to_insn(x) < ex_to_insn(y))
return -1;
return 0;
}
Contributors
Person | Tokens | Prop | Commits | CommitProp |
Matt Mackall | 51 | 79.69% | 2 | 50.00% |
Ard Biesheuvel | 12 | 18.75% | 1 | 25.00% |
Thomas Meyer | 1 | 1.56% | 1 | 25.00% |
Total | 64 | 100.00% | 4 | 100.00% |
void sort_extable(struct exception_table_entry *start,
struct exception_table_entry *finish)
{
sort(start, finish - start, sizeof(struct exception_table_entry),
cmp_ex_sort, swap_ex);
}
Contributors
Person | Tokens | Prop | Commits | CommitProp |
Linus Torvalds (pre-git) | 19 | 55.88% | 1 | 20.00% |
Matt Mackall | 12 | 35.29% | 1 | 20.00% |
Ard Biesheuvel | 1 | 2.94% | 1 | 20.00% |
Paul Mackerras | 1 | 2.94% | 1 | 20.00% |
Thomas Meyer | 1 | 2.94% | 1 | 20.00% |
Total | 34 | 100.00% | 5 | 100.00% |
#ifdef CONFIG_MODULES
/*
* If the exception table is sorted, any referring to the module init
* will be at the beginning or the end.
*/
void trim_init_extable(struct module *m)
{
/*trim the beginning*/
while (m->num_exentries &&
within_module_init(ex_to_insn(&m->extable[0]), m)) {
m->extable++;
m->num_exentries--;
}
/*trim the end*/
while (m->num_exentries &&
within_module_init(ex_to_insn(&m->extable[m->num_exentries - 1]),
m))
m->num_exentries--;
}
Contributors
Person | Tokens | Prop | Commits | CommitProp |
Rusty Russell | 69 | 89.61% | 1 | 50.00% |
Ard Biesheuvel | 8 | 10.39% | 1 | 50.00% |
Total | 77 | 100.00% | 2 | 100.00% |
#endif /* CONFIG_MODULES */
#endif /* !ARCH_HAS_SORT_EXTABLE */
#ifndef ARCH_HAS_SEARCH_EXTABLE
static int cmp_ex_search(const void *key, const void *elt)
{
const struct exception_table_entry *_elt = elt;
unsigned long _key = *(unsigned long *)key;
/* avoid overflow */
if (_key > ex_to_insn(_elt))
return 1;
if (_key < ex_to_insn(_elt))
return -1;
return 0;
}
Contributors
Person | Tokens | Prop | Commits | CommitProp |
Thomas Meyer | 32 | 49.23% | 1 | 16.67% |
Linus Torvalds (pre-git) | 20 | 30.77% | 2 | 33.33% |
Ard Biesheuvel | 6 | 9.23% | 1 | 16.67% |
Andrew Morton | 5 | 7.69% | 1 | 16.67% |
Eric Dumazet | 2 | 3.08% | 1 | 16.67% |
Total | 65 | 100.00% | 6 | 100.00% |
/*
* Search one exception table for an entry corresponding to the
* given instruction address, and return the address of the entry,
* or NULL if none is found.
* We use a binary search, and thus we assume that the table is
* already sorted.
*/
const struct exception_table_entry *
search_extable(const struct exception_table_entry *base,
const size_t num,
unsigned long value)
{
return bsearch(&value, base, num,
sizeof(struct exception_table_entry), cmp_ex_search);
}
Contributors
Person | Tokens | Prop | Commits | CommitProp |
Thomas Meyer | 38 | 92.68% | 1 | 33.33% |
Linus Torvalds (pre-git) | 3 | 7.32% | 2 | 66.67% |
Total | 41 | 100.00% | 3 | 100.00% |
#endif
Overall Contributors
Person | Tokens | Prop | Commits | CommitProp |
Ard Biesheuvel | 182 | 38.56% | 1 | 6.25% |
Rusty Russell | 80 | 16.95% | 2 | 12.50% |
Thomas Meyer | 76 | 16.10% | 1 | 6.25% |
Matt Mackall | 66 | 13.98% | 2 | 12.50% |
Linus Torvalds (pre-git) | 47 | 9.96% | 4 | 25.00% |
Andrew Morton | 15 | 3.18% | 2 | 12.50% |
Eric Dumazet | 2 | 0.42% | 1 | 6.25% |
Paul Mackerras | 2 | 0.42% | 1 | 6.25% |
Linus Torvalds | 1 | 0.21% | 1 | 6.25% |
Jon Mason | 1 | 0.21% | 1 | 6.25% |
Total | 472 | 100.00% | 16 | 100.00% |
Information contained on this website is for historical information purposes only and does not indicate or represent copyright ownership.