mirror of
https://mirrors.bfsu.edu.cn/git/linux.git
synced 2024-11-18 09:44:18 +08:00
1da177e4c3
Initial git repository build. I'm not bothering with the full history, even though we have it. We can create a separate "historical" git archive of that later if we want to, and in the meantime it's about 3.2GB when imported into git - space that would just make the early git days unnecessarily complicated, when we don't have a lot of good infrastructure for it. Let it rip!
36 lines
858 B
C
36 lines
858 B
C
/*
|
|
* linux/arch/x86_64/mm/extable.c
|
|
*/
|
|
|
|
#include <linux/config.h>
|
|
#include <linux/module.h>
|
|
#include <linux/spinlock.h>
|
|
#include <linux/init.h>
|
|
#include <asm/uaccess.h>
|
|
|
|
/* Simple binary search */
|
|
const struct exception_table_entry *
|
|
search_extable(const struct exception_table_entry *first,
|
|
const struct exception_table_entry *last,
|
|
unsigned long value)
|
|
{
|
|
/* Work around a B stepping K8 bug */
|
|
if ((value >> 32) == 0)
|
|
value |= 0xffffffffUL << 32;
|
|
|
|
while (first <= last) {
|
|
const struct exception_table_entry *mid;
|
|
long diff;
|
|
|
|
mid = (last - first) / 2 + first;
|
|
diff = mid->insn - value;
|
|
if (diff == 0)
|
|
return mid;
|
|
else if (diff < 0)
|
|
first = mid+1;
|
|
else
|
|
last = mid-1;
|
|
}
|
|
return NULL;
|
|
}
|