|
|
|
@ -17,6 +17,7 @@ |
|
|
|
|
#include <asm/mmu.h> |
|
|
|
|
#include <asm/page.h> |
|
|
|
|
#include <asm/pgtable.h> |
|
|
|
|
#include <asm/extable.h> |
|
|
|
|
#include <linux/string.h> |
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
@ -47,22 +48,6 @@ |
|
|
|
|
|
|
|
|
|
# define segment_eq(a, b) ((a).seg == (b).seg) |
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* The exception table consists of pairs of addresses: the first is the |
|
|
|
|
* address of an instruction that is allowed to fault, and the second is |
|
|
|
|
* the address at which the program should continue. No registers are |
|
|
|
|
* modified, so it is entirely up to the continuation code to figure out |
|
|
|
|
* what to do. |
|
|
|
|
* |
|
|
|
|
* All the routines below use bits of fixup code that are out of line |
|
|
|
|
* with the main instruction path. This means when everything is well, |
|
|
|
|
* we don't even have to jump over them. Further, they do not intrude |
|
|
|
|
* on our cache or tlb entries. |
|
|
|
|
*/ |
|
|
|
|
struct exception_table_entry { |
|
|
|
|
unsigned long insn, fixup; |
|
|
|
|
}; |
|
|
|
|
|
|
|
|
|
#ifndef CONFIG_MMU |
|
|
|
|
|
|
|
|
|
/* Check against bounds of physical memory */ |
|
|
|
|