2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
* linux/arch/i386/traps.c
|
|
|
|
*
|
|
|
|
* Copyright (C) 1991, 1992 Linus Torvalds
|
|
|
|
*
|
|
|
|
* Pentium III FXSR, SSE support
|
|
|
|
* Gareth Hughes <gareth@valinux.com>, May 2000
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 'Traps.c' handles hardware traps and faults after we have saved some
|
|
|
|
* state in 'asm.s'.
|
|
|
|
*/
|
|
|
|
#include <linux/sched.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/timer.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/delay.h>
|
|
|
|
#include <linux/spinlock.h>
|
|
|
|
#include <linux/interrupt.h>
|
|
|
|
#include <linux/highmem.h>
|
|
|
|
#include <linux/kallsyms.h>
|
|
|
|
#include <linux/ptrace.h>
|
|
|
|
#include <linux/utsname.h>
|
|
|
|
#include <linux/kprobes.h>
|
2005-06-26 05:58:26 +08:00
|
|
|
#include <linux/kexec.h>
|
2006-06-26 19:57:41 +08:00
|
|
|
#include <linux/unwind.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
#ifdef CONFIG_EISA
|
|
|
|
#include <linux/ioport.h>
|
|
|
|
#include <linux/eisa.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef CONFIG_MCA
|
|
|
|
#include <linux/mca.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include <asm/processor.h>
|
|
|
|
#include <asm/system.h>
|
|
|
|
#include <asm/uaccess.h>
|
|
|
|
#include <asm/io.h>
|
|
|
|
#include <asm/atomic.h>
|
|
|
|
#include <asm/debugreg.h>
|
|
|
|
#include <asm/desc.h>
|
|
|
|
#include <asm/i387.h>
|
|
|
|
#include <asm/nmi.h>
|
2006-06-26 19:57:41 +08:00
|
|
|
#include <asm/unwind.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <asm/smp.h>
|
|
|
|
#include <asm/arch_hooks.h>
|
|
|
|
#include <asm/kdebug.h>
|
2006-09-26 16:52:34 +08:00
|
|
|
#include <asm/stacktrace.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
#include <linux/module.h>
|
|
|
|
|
|
|
|
#include "mach_traps.h"
|
|
|
|
|
|
|
|
asmlinkage int system_call(void);
|
|
|
|
|
|
|
|
struct desc_struct default_ldt[] = { { 0, 0 }, { 0, 0 }, { 0, 0 },
|
|
|
|
{ 0, 0 }, { 0, 0 } };
|
|
|
|
|
|
|
|
/* Do we ignore FPU interrupts ? */
|
|
|
|
char ignore_fpu_irq = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The IDT has to be page-aligned to simplify the Pentium
|
|
|
|
* F0 0F bug workaround.. We have a special link segment
|
|
|
|
* for this.
|
|
|
|
*/
|
|
|
|
struct desc_struct idt_table[256] __attribute__((__section__(".data.idt"))) = { {0, 0}, };
|
|
|
|
|
|
|
|
asmlinkage void divide_error(void);
|
|
|
|
asmlinkage void debug(void);
|
|
|
|
asmlinkage void nmi(void);
|
|
|
|
asmlinkage void int3(void);
|
|
|
|
asmlinkage void overflow(void);
|
|
|
|
asmlinkage void bounds(void);
|
|
|
|
asmlinkage void invalid_op(void);
|
|
|
|
asmlinkage void device_not_available(void);
|
|
|
|
asmlinkage void coprocessor_segment_overrun(void);
|
|
|
|
asmlinkage void invalid_TSS(void);
|
|
|
|
asmlinkage void segment_not_present(void);
|
|
|
|
asmlinkage void stack_segment(void);
|
|
|
|
asmlinkage void general_protection(void);
|
|
|
|
asmlinkage void page_fault(void);
|
|
|
|
asmlinkage void coprocessor_error(void);
|
|
|
|
asmlinkage void simd_coprocessor_error(void);
|
|
|
|
asmlinkage void alignment_check(void);
|
|
|
|
asmlinkage void spurious_interrupt_bug(void);
|
|
|
|
asmlinkage void machine_check(void);
|
|
|
|
|
|
|
|
static int kstack_depth_to_print = 24;
|
2006-08-31 01:37:11 +08:00
|
|
|
#ifdef CONFIG_STACK_UNWIND
|
2006-06-26 19:57:47 +08:00
|
|
|
static int call_trace = 1;
|
2006-08-31 01:37:11 +08:00
|
|
|
#else
|
|
|
|
#define call_trace (-1)
|
|
|
|
#endif
|
[PATCH] Notifier chain update: API changes
The kernel's implementation of notifier chains is unsafe. There is no
protection against entries being added to or removed from a chain while the
chain is in use. The issues were discussed in this thread:
http://marc.theaimsgroup.com/?l=linux-kernel&m=113018709002036&w=2
We noticed that notifier chains in the kernel fall into two basic usage
classes:
"Blocking" chains are always called from a process context
and the callout routines are allowed to sleep;
"Atomic" chains can be called from an atomic context and
the callout routines are not allowed to sleep.
We decided to codify this distinction and make it part of the API. Therefore
this set of patches introduces three new, parallel APIs: one for blocking
notifiers, one for atomic notifiers, and one for "raw" notifiers (which is
really just the old API under a new name). New kinds of data structures are
used for the heads of the chains, and new routines are defined for
registration, unregistration, and calling a chain. The three APIs are
explained in include/linux/notifier.h and their implementation is in
kernel/sys.c.
With atomic and blocking chains, the implementation guarantees that the chain
links will not be corrupted and that chain callers will not get messed up by
entries being added or removed. For raw chains the implementation provides no
guarantees at all; users of this API must provide their own protections. (The
idea was that situations may come up where the assumptions of the atomic and
blocking APIs are not appropriate, so it should be possible for users to
handle these things in their own way.)
There are some limitations, which should not be too hard to live with. For
atomic/blocking chains, registration and unregistration must always be done in
a process context since the chain is protected by a mutex/rwsem. Also, a
callout routine for a non-raw chain must not try to register or unregister
entries on its own chain. (This did happen in a couple of places and the code
had to be changed to avoid it.)
Since atomic chains may be called from within an NMI handler, they cannot use
spinlocks for synchronization. Instead we use RCU. The overhead falls almost
entirely in the unregister routine, which is okay since unregistration is much
less frequent that calling a chain.
Here is the list of chains that we adjusted and their classifications. None
of them use the raw API, so for the moment it is only a placeholder.
ATOMIC CHAINS
-------------
arch/i386/kernel/traps.c: i386die_chain
arch/ia64/kernel/traps.c: ia64die_chain
arch/powerpc/kernel/traps.c: powerpc_die_chain
arch/sparc64/kernel/traps.c: sparc64die_chain
arch/x86_64/kernel/traps.c: die_chain
drivers/char/ipmi/ipmi_si_intf.c: xaction_notifier_list
kernel/panic.c: panic_notifier_list
kernel/profile.c: task_free_notifier
net/bluetooth/hci_core.c: hci_notifier
net/ipv4/netfilter/ip_conntrack_core.c: ip_conntrack_chain
net/ipv4/netfilter/ip_conntrack_core.c: ip_conntrack_expect_chain
net/ipv6/addrconf.c: inet6addr_chain
net/netfilter/nf_conntrack_core.c: nf_conntrack_chain
net/netfilter/nf_conntrack_core.c: nf_conntrack_expect_chain
net/netlink/af_netlink.c: netlink_chain
BLOCKING CHAINS
---------------
arch/powerpc/platforms/pseries/reconfig.c: pSeries_reconfig_chain
arch/s390/kernel/process.c: idle_chain
arch/x86_64/kernel/process.c idle_notifier
drivers/base/memory.c: memory_chain
drivers/cpufreq/cpufreq.c cpufreq_policy_notifier_list
drivers/cpufreq/cpufreq.c cpufreq_transition_notifier_list
drivers/macintosh/adb.c: adb_client_list
drivers/macintosh/via-pmu.c sleep_notifier_list
drivers/macintosh/via-pmu68k.c sleep_notifier_list
drivers/macintosh/windfarm_core.c wf_client_list
drivers/usb/core/notify.c usb_notifier_list
drivers/video/fbmem.c fb_notifier_list
kernel/cpu.c cpu_chain
kernel/module.c module_notify_list
kernel/profile.c munmap_notifier
kernel/profile.c task_exit_notifier
kernel/sys.c reboot_notifier_list
net/core/dev.c netdev_chain
net/decnet/dn_dev.c: dnaddr_chain
net/ipv4/devinet.c: inetaddr_chain
It's possible that some of these classifications are wrong. If they are,
please let us know or submit a patch to fix them. Note that any chain that
gets called very frequently should be atomic, because the rwsem read-locking
used for blocking chains is very likely to incur cache misses on SMP systems.
(However, if the chain's callout routines may sleep then the chain cannot be
atomic.)
The patch set was written by Alan Stern and Chandra Seetharaman, incorporating
material written by Keith Owens and suggestions from Paul McKenney and Andrew
Morton.
[jes@sgi.com: restructure the notifier chain initialization macros]
Signed-off-by: Alan Stern <stern@rowland.harvard.edu>
Signed-off-by: Chandra Seetharaman <sekharan@us.ibm.com>
Signed-off-by: Jes Sorensen <jes@sgi.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-27 17:16:30 +08:00
|
|
|
ATOMIC_NOTIFIER_HEAD(i386die_chain);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
int register_die_notifier(struct notifier_block *nb)
|
|
|
|
{
|
2006-03-23 18:59:45 +08:00
|
|
|
vmalloc_sync_all();
|
[PATCH] Notifier chain update: API changes
The kernel's implementation of notifier chains is unsafe. There is no
protection against entries being added to or removed from a chain while the
chain is in use. The issues were discussed in this thread:
http://marc.theaimsgroup.com/?l=linux-kernel&m=113018709002036&w=2
We noticed that notifier chains in the kernel fall into two basic usage
classes:
"Blocking" chains are always called from a process context
and the callout routines are allowed to sleep;
"Atomic" chains can be called from an atomic context and
the callout routines are not allowed to sleep.
We decided to codify this distinction and make it part of the API. Therefore
this set of patches introduces three new, parallel APIs: one for blocking
notifiers, one for atomic notifiers, and one for "raw" notifiers (which is
really just the old API under a new name). New kinds of data structures are
used for the heads of the chains, and new routines are defined for
registration, unregistration, and calling a chain. The three APIs are
explained in include/linux/notifier.h and their implementation is in
kernel/sys.c.
With atomic and blocking chains, the implementation guarantees that the chain
links will not be corrupted and that chain callers will not get messed up by
entries being added or removed. For raw chains the implementation provides no
guarantees at all; users of this API must provide their own protections. (The
idea was that situations may come up where the assumptions of the atomic and
blocking APIs are not appropriate, so it should be possible for users to
handle these things in their own way.)
There are some limitations, which should not be too hard to live with. For
atomic/blocking chains, registration and unregistration must always be done in
a process context since the chain is protected by a mutex/rwsem. Also, a
callout routine for a non-raw chain must not try to register or unregister
entries on its own chain. (This did happen in a couple of places and the code
had to be changed to avoid it.)
Since atomic chains may be called from within an NMI handler, they cannot use
spinlocks for synchronization. Instead we use RCU. The overhead falls almost
entirely in the unregister routine, which is okay since unregistration is much
less frequent that calling a chain.
Here is the list of chains that we adjusted and their classifications. None
of them use the raw API, so for the moment it is only a placeholder.
ATOMIC CHAINS
-------------
arch/i386/kernel/traps.c: i386die_chain
arch/ia64/kernel/traps.c: ia64die_chain
arch/powerpc/kernel/traps.c: powerpc_die_chain
arch/sparc64/kernel/traps.c: sparc64die_chain
arch/x86_64/kernel/traps.c: die_chain
drivers/char/ipmi/ipmi_si_intf.c: xaction_notifier_list
kernel/panic.c: panic_notifier_list
kernel/profile.c: task_free_notifier
net/bluetooth/hci_core.c: hci_notifier
net/ipv4/netfilter/ip_conntrack_core.c: ip_conntrack_chain
net/ipv4/netfilter/ip_conntrack_core.c: ip_conntrack_expect_chain
net/ipv6/addrconf.c: inet6addr_chain
net/netfilter/nf_conntrack_core.c: nf_conntrack_chain
net/netfilter/nf_conntrack_core.c: nf_conntrack_expect_chain
net/netlink/af_netlink.c: netlink_chain
BLOCKING CHAINS
---------------
arch/powerpc/platforms/pseries/reconfig.c: pSeries_reconfig_chain
arch/s390/kernel/process.c: idle_chain
arch/x86_64/kernel/process.c idle_notifier
drivers/base/memory.c: memory_chain
drivers/cpufreq/cpufreq.c cpufreq_policy_notifier_list
drivers/cpufreq/cpufreq.c cpufreq_transition_notifier_list
drivers/macintosh/adb.c: adb_client_list
drivers/macintosh/via-pmu.c sleep_notifier_list
drivers/macintosh/via-pmu68k.c sleep_notifier_list
drivers/macintosh/windfarm_core.c wf_client_list
drivers/usb/core/notify.c usb_notifier_list
drivers/video/fbmem.c fb_notifier_list
kernel/cpu.c cpu_chain
kernel/module.c module_notify_list
kernel/profile.c munmap_notifier
kernel/profile.c task_exit_notifier
kernel/sys.c reboot_notifier_list
net/core/dev.c netdev_chain
net/decnet/dn_dev.c: dnaddr_chain
net/ipv4/devinet.c: inetaddr_chain
It's possible that some of these classifications are wrong. If they are,
please let us know or submit a patch to fix them. Note that any chain that
gets called very frequently should be atomic, because the rwsem read-locking
used for blocking chains is very likely to incur cache misses on SMP systems.
(However, if the chain's callout routines may sleep then the chain cannot be
atomic.)
The patch set was written by Alan Stern and Chandra Seetharaman, incorporating
material written by Keith Owens and suggestions from Paul McKenney and Andrew
Morton.
[jes@sgi.com: restructure the notifier chain initialization macros]
Signed-off-by: Alan Stern <stern@rowland.harvard.edu>
Signed-off-by: Chandra Seetharaman <sekharan@us.ibm.com>
Signed-off-by: Jes Sorensen <jes@sgi.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-27 17:16:30 +08:00
|
|
|
return atomic_notifier_chain_register(&i386die_chain, nb);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
2006-07-10 19:44:05 +08:00
|
|
|
EXPORT_SYMBOL(register_die_notifier); /* used modular by kdb */
|
2005-04-17 06:20:36 +08:00
|
|
|
|
[PATCH] Notifier chain update: API changes
The kernel's implementation of notifier chains is unsafe. There is no
protection against entries being added to or removed from a chain while the
chain is in use. The issues were discussed in this thread:
http://marc.theaimsgroup.com/?l=linux-kernel&m=113018709002036&w=2
We noticed that notifier chains in the kernel fall into two basic usage
classes:
"Blocking" chains are always called from a process context
and the callout routines are allowed to sleep;
"Atomic" chains can be called from an atomic context and
the callout routines are not allowed to sleep.
We decided to codify this distinction and make it part of the API. Therefore
this set of patches introduces three new, parallel APIs: one for blocking
notifiers, one for atomic notifiers, and one for "raw" notifiers (which is
really just the old API under a new name). New kinds of data structures are
used for the heads of the chains, and new routines are defined for
registration, unregistration, and calling a chain. The three APIs are
explained in include/linux/notifier.h and their implementation is in
kernel/sys.c.
With atomic and blocking chains, the implementation guarantees that the chain
links will not be corrupted and that chain callers will not get messed up by
entries being added or removed. For raw chains the implementation provides no
guarantees at all; users of this API must provide their own protections. (The
idea was that situations may come up where the assumptions of the atomic and
blocking APIs are not appropriate, so it should be possible for users to
handle these things in their own way.)
There are some limitations, which should not be too hard to live with. For
atomic/blocking chains, registration and unregistration must always be done in
a process context since the chain is protected by a mutex/rwsem. Also, a
callout routine for a non-raw chain must not try to register or unregister
entries on its own chain. (This did happen in a couple of places and the code
had to be changed to avoid it.)
Since atomic chains may be called from within an NMI handler, they cannot use
spinlocks for synchronization. Instead we use RCU. The overhead falls almost
entirely in the unregister routine, which is okay since unregistration is much
less frequent that calling a chain.
Here is the list of chains that we adjusted and their classifications. None
of them use the raw API, so for the moment it is only a placeholder.
ATOMIC CHAINS
-------------
arch/i386/kernel/traps.c: i386die_chain
arch/ia64/kernel/traps.c: ia64die_chain
arch/powerpc/kernel/traps.c: powerpc_die_chain
arch/sparc64/kernel/traps.c: sparc64die_chain
arch/x86_64/kernel/traps.c: die_chain
drivers/char/ipmi/ipmi_si_intf.c: xaction_notifier_list
kernel/panic.c: panic_notifier_list
kernel/profile.c: task_free_notifier
net/bluetooth/hci_core.c: hci_notifier
net/ipv4/netfilter/ip_conntrack_core.c: ip_conntrack_chain
net/ipv4/netfilter/ip_conntrack_core.c: ip_conntrack_expect_chain
net/ipv6/addrconf.c: inet6addr_chain
net/netfilter/nf_conntrack_core.c: nf_conntrack_chain
net/netfilter/nf_conntrack_core.c: nf_conntrack_expect_chain
net/netlink/af_netlink.c: netlink_chain
BLOCKING CHAINS
---------------
arch/powerpc/platforms/pseries/reconfig.c: pSeries_reconfig_chain
arch/s390/kernel/process.c: idle_chain
arch/x86_64/kernel/process.c idle_notifier
drivers/base/memory.c: memory_chain
drivers/cpufreq/cpufreq.c cpufreq_policy_notifier_list
drivers/cpufreq/cpufreq.c cpufreq_transition_notifier_list
drivers/macintosh/adb.c: adb_client_list
drivers/macintosh/via-pmu.c sleep_notifier_list
drivers/macintosh/via-pmu68k.c sleep_notifier_list
drivers/macintosh/windfarm_core.c wf_client_list
drivers/usb/core/notify.c usb_notifier_list
drivers/video/fbmem.c fb_notifier_list
kernel/cpu.c cpu_chain
kernel/module.c module_notify_list
kernel/profile.c munmap_notifier
kernel/profile.c task_exit_notifier
kernel/sys.c reboot_notifier_list
net/core/dev.c netdev_chain
net/decnet/dn_dev.c: dnaddr_chain
net/ipv4/devinet.c: inetaddr_chain
It's possible that some of these classifications are wrong. If they are,
please let us know or submit a patch to fix them. Note that any chain that
gets called very frequently should be atomic, because the rwsem read-locking
used for blocking chains is very likely to incur cache misses on SMP systems.
(However, if the chain's callout routines may sleep then the chain cannot be
atomic.)
The patch set was written by Alan Stern and Chandra Seetharaman, incorporating
material written by Keith Owens and suggestions from Paul McKenney and Andrew
Morton.
[jes@sgi.com: restructure the notifier chain initialization macros]
Signed-off-by: Alan Stern <stern@rowland.harvard.edu>
Signed-off-by: Chandra Seetharaman <sekharan@us.ibm.com>
Signed-off-by: Jes Sorensen <jes@sgi.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-27 17:16:30 +08:00
|
|
|
int unregister_die_notifier(struct notifier_block *nb)
|
|
|
|
{
|
|
|
|
return atomic_notifier_chain_unregister(&i386die_chain, nb);
|
|
|
|
}
|
2006-07-10 19:44:05 +08:00
|
|
|
EXPORT_SYMBOL(unregister_die_notifier); /* used modular by kdb */
|
[PATCH] Notifier chain update: API changes
The kernel's implementation of notifier chains is unsafe. There is no
protection against entries being added to or removed from a chain while the
chain is in use. The issues were discussed in this thread:
http://marc.theaimsgroup.com/?l=linux-kernel&m=113018709002036&w=2
We noticed that notifier chains in the kernel fall into two basic usage
classes:
"Blocking" chains are always called from a process context
and the callout routines are allowed to sleep;
"Atomic" chains can be called from an atomic context and
the callout routines are not allowed to sleep.
We decided to codify this distinction and make it part of the API. Therefore
this set of patches introduces three new, parallel APIs: one for blocking
notifiers, one for atomic notifiers, and one for "raw" notifiers (which is
really just the old API under a new name). New kinds of data structures are
used for the heads of the chains, and new routines are defined for
registration, unregistration, and calling a chain. The three APIs are
explained in include/linux/notifier.h and their implementation is in
kernel/sys.c.
With atomic and blocking chains, the implementation guarantees that the chain
links will not be corrupted and that chain callers will not get messed up by
entries being added or removed. For raw chains the implementation provides no
guarantees at all; users of this API must provide their own protections. (The
idea was that situations may come up where the assumptions of the atomic and
blocking APIs are not appropriate, so it should be possible for users to
handle these things in their own way.)
There are some limitations, which should not be too hard to live with. For
atomic/blocking chains, registration and unregistration must always be done in
a process context since the chain is protected by a mutex/rwsem. Also, a
callout routine for a non-raw chain must not try to register or unregister
entries on its own chain. (This did happen in a couple of places and the code
had to be changed to avoid it.)
Since atomic chains may be called from within an NMI handler, they cannot use
spinlocks for synchronization. Instead we use RCU. The overhead falls almost
entirely in the unregister routine, which is okay since unregistration is much
less frequent that calling a chain.
Here is the list of chains that we adjusted and their classifications. None
of them use the raw API, so for the moment it is only a placeholder.
ATOMIC CHAINS
-------------
arch/i386/kernel/traps.c: i386die_chain
arch/ia64/kernel/traps.c: ia64die_chain
arch/powerpc/kernel/traps.c: powerpc_die_chain
arch/sparc64/kernel/traps.c: sparc64die_chain
arch/x86_64/kernel/traps.c: die_chain
drivers/char/ipmi/ipmi_si_intf.c: xaction_notifier_list
kernel/panic.c: panic_notifier_list
kernel/profile.c: task_free_notifier
net/bluetooth/hci_core.c: hci_notifier
net/ipv4/netfilter/ip_conntrack_core.c: ip_conntrack_chain
net/ipv4/netfilter/ip_conntrack_core.c: ip_conntrack_expect_chain
net/ipv6/addrconf.c: inet6addr_chain
net/netfilter/nf_conntrack_core.c: nf_conntrack_chain
net/netfilter/nf_conntrack_core.c: nf_conntrack_expect_chain
net/netlink/af_netlink.c: netlink_chain
BLOCKING CHAINS
---------------
arch/powerpc/platforms/pseries/reconfig.c: pSeries_reconfig_chain
arch/s390/kernel/process.c: idle_chain
arch/x86_64/kernel/process.c idle_notifier
drivers/base/memory.c: memory_chain
drivers/cpufreq/cpufreq.c cpufreq_policy_notifier_list
drivers/cpufreq/cpufreq.c cpufreq_transition_notifier_list
drivers/macintosh/adb.c: adb_client_list
drivers/macintosh/via-pmu.c sleep_notifier_list
drivers/macintosh/via-pmu68k.c sleep_notifier_list
drivers/macintosh/windfarm_core.c wf_client_list
drivers/usb/core/notify.c usb_notifier_list
drivers/video/fbmem.c fb_notifier_list
kernel/cpu.c cpu_chain
kernel/module.c module_notify_list
kernel/profile.c munmap_notifier
kernel/profile.c task_exit_notifier
kernel/sys.c reboot_notifier_list
net/core/dev.c netdev_chain
net/decnet/dn_dev.c: dnaddr_chain
net/ipv4/devinet.c: inetaddr_chain
It's possible that some of these classifications are wrong. If they are,
please let us know or submit a patch to fix them. Note that any chain that
gets called very frequently should be atomic, because the rwsem read-locking
used for blocking chains is very likely to incur cache misses on SMP systems.
(However, if the chain's callout routines may sleep then the chain cannot be
atomic.)
The patch set was written by Alan Stern and Chandra Seetharaman, incorporating
material written by Keith Owens and suggestions from Paul McKenney and Andrew
Morton.
[jes@sgi.com: restructure the notifier chain initialization macros]
Signed-off-by: Alan Stern <stern@rowland.harvard.edu>
Signed-off-by: Chandra Seetharaman <sekharan@us.ibm.com>
Signed-off-by: Jes Sorensen <jes@sgi.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-27 17:16:30 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
static inline int valid_stack_ptr(struct thread_info *tinfo, void *p)
|
|
|
|
{
|
|
|
|
return p > (void *)tinfo &&
|
|
|
|
p < (void *)tinfo + THREAD_SIZE - 3;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline unsigned long print_context_stack(struct thread_info *tinfo,
|
2006-01-15 05:20:52 +08:00
|
|
|
unsigned long *stack, unsigned long ebp,
|
2006-09-26 16:52:34 +08:00
|
|
|
struct stacktrace_ops *ops, void *data)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
unsigned long addr;
|
|
|
|
|
|
|
|
#ifdef CONFIG_FRAME_POINTER
|
|
|
|
while (valid_stack_ptr(tinfo, (void *)ebp)) {
|
|
|
|
addr = *(unsigned long *)(ebp + 4);
|
2006-09-26 16:52:34 +08:00
|
|
|
ops->address(data, addr);
|
2006-06-23 17:04:20 +08:00
|
|
|
/*
|
|
|
|
* break out of recursive entries (such as
|
|
|
|
* end_of_stack_stop_unwind_function):
|
|
|
|
*/
|
|
|
|
if (ebp == *(unsigned long *)ebp)
|
|
|
|
break;
|
2005-04-17 06:20:36 +08:00
|
|
|
ebp = *(unsigned long *)ebp;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
while (valid_stack_ptr(tinfo, stack)) {
|
|
|
|
addr = *stack++;
|
2006-01-15 05:20:52 +08:00
|
|
|
if (__kernel_text_address(addr))
|
2006-09-26 16:52:34 +08:00
|
|
|
ops->address(data, addr);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
return ebp;
|
|
|
|
}
|
|
|
|
|
2006-09-26 16:52:34 +08:00
|
|
|
struct ops_and_data {
|
|
|
|
struct stacktrace_ops *ops;
|
|
|
|
void *data;
|
|
|
|
};
|
|
|
|
|
2006-07-03 15:24:37 +08:00
|
|
|
static asmlinkage int
|
2006-09-26 16:52:34 +08:00
|
|
|
dump_trace_unwind(struct unwind_frame_info *info, void *data)
|
2006-06-26 19:57:41 +08:00
|
|
|
{
|
2006-09-26 16:52:34 +08:00
|
|
|
struct ops_and_data *oad = (struct ops_and_data *)data;
|
2006-06-26 19:57:47 +08:00
|
|
|
int n = 0;
|
2006-06-26 19:57:41 +08:00
|
|
|
|
|
|
|
while (unwind(info) == 0 && UNW_PC(info)) {
|
2006-07-03 15:24:37 +08:00
|
|
|
n++;
|
2006-09-26 16:52:34 +08:00
|
|
|
oad->ops->address(oad->data, UNW_PC(info));
|
2006-06-26 19:57:41 +08:00
|
|
|
if (arch_unw_user_mode(info))
|
|
|
|
break;
|
|
|
|
}
|
2006-06-26 19:57:47 +08:00
|
|
|
return n;
|
2006-06-26 19:57:41 +08:00
|
|
|
}
|
|
|
|
|
2006-09-26 16:52:34 +08:00
|
|
|
void dump_trace(struct task_struct *task, struct pt_regs *regs,
|
|
|
|
unsigned long *stack,
|
|
|
|
struct stacktrace_ops *ops, void *data)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2006-09-26 16:52:34 +08:00
|
|
|
unsigned long ebp = 0;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
if (!task)
|
|
|
|
task = current;
|
|
|
|
|
2006-06-26 19:57:47 +08:00
|
|
|
if (call_trace >= 0) {
|
|
|
|
int unw_ret = 0;
|
|
|
|
struct unwind_frame_info info;
|
2006-09-26 16:52:34 +08:00
|
|
|
struct ops_and_data oad = { .ops = ops, .data = data };
|
2006-06-26 19:57:47 +08:00
|
|
|
|
|
|
|
if (regs) {
|
|
|
|
if (unwind_init_frame_info(&info, task, regs) == 0)
|
2006-09-26 16:52:34 +08:00
|
|
|
unw_ret = dump_trace_unwind(&info, &oad);
|
2006-06-26 19:57:47 +08:00
|
|
|
} else if (task == current)
|
2006-09-26 16:52:34 +08:00
|
|
|
unw_ret = unwind_init_running(&info, dump_trace_unwind, &oad);
|
2006-06-26 19:57:47 +08:00
|
|
|
else {
|
|
|
|
if (unwind_init_blocked(&info, task) == 0)
|
2006-09-26 16:52:34 +08:00
|
|
|
unw_ret = dump_trace_unwind(&info, &oad);
|
2006-06-26 19:57:41 +08:00
|
|
|
}
|
2006-08-31 01:37:11 +08:00
|
|
|
if (unw_ret > 0) {
|
|
|
|
if (call_trace == 1 && !arch_unw_user_mode(&info)) {
|
2006-09-26 16:52:34 +08:00
|
|
|
ops->warning_symbol(data, "DWARF2 unwinder stuck at %s\n",
|
2006-08-31 01:37:11 +08:00
|
|
|
UNW_PC(&info));
|
|
|
|
if (UNW_SP(&info) >= PAGE_OFFSET) {
|
2006-09-26 16:52:34 +08:00
|
|
|
ops->warning(data, "Leftover inexact backtrace:\n");
|
2006-07-30 03:42:52 +08:00
|
|
|
stack = (void *)UNW_SP(&info);
|
2006-09-26 16:52:34 +08:00
|
|
|
if (!stack)
|
|
|
|
return;
|
2006-09-26 16:52:34 +08:00
|
|
|
ebp = UNW_FP(&info);
|
2006-08-31 01:37:11 +08:00
|
|
|
} else
|
2006-09-26 16:52:34 +08:00
|
|
|
ops->warning(data, "Full inexact backtrace again:\n");
|
2006-08-31 01:37:11 +08:00
|
|
|
} else if (call_trace >= 1)
|
2006-06-26 19:57:47 +08:00
|
|
|
return;
|
2006-07-28 20:44:57 +08:00
|
|
|
else
|
2006-09-26 16:52:34 +08:00
|
|
|
ops->warning(data, "Full inexact backtrace again:\n");
|
2006-08-31 01:37:11 +08:00
|
|
|
} else
|
2006-09-26 16:52:34 +08:00
|
|
|
ops->warning(data, "Inexact backtrace:\n");
|
2006-09-26 16:52:34 +08:00
|
|
|
}
|
|
|
|
if (!stack) {
|
2006-09-26 16:52:34 +08:00
|
|
|
unsigned long dummy;
|
|
|
|
stack = &dummy;
|
|
|
|
if (task && task != current)
|
|
|
|
stack = (unsigned long *)task->thread.esp;
|
2006-06-26 19:57:41 +08:00
|
|
|
}
|
|
|
|
|
2006-09-26 16:52:34 +08:00
|
|
|
#ifdef CONFIG_FRAME_POINTER
|
|
|
|
if (!ebp) {
|
|
|
|
if (task == current) {
|
|
|
|
/* Grab ebp right from our regs */
|
|
|
|
asm ("movl %%ebp, %0" : "=r" (ebp) : );
|
|
|
|
} else {
|
|
|
|
/* ebp is the last reg pushed by switch_to */
|
|
|
|
ebp = *(unsigned long *) task->thread.esp;
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
2006-09-26 16:52:34 +08:00
|
|
|
#endif
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
while (1) {
|
|
|
|
struct thread_info *context;
|
|
|
|
context = (struct thread_info *)
|
|
|
|
((unsigned long)stack & (~(THREAD_SIZE - 1)));
|
2006-09-26 16:52:34 +08:00
|
|
|
ebp = print_context_stack(context, stack, ebp, ops, data);
|
|
|
|
/* Should be after the line below, but somewhere
|
|
|
|
in early boot context comes out corrupted and we
|
|
|
|
can't reference it -AK */
|
|
|
|
if (ops->stack(data, "IRQ") < 0)
|
|
|
|
break;
|
2005-04-17 06:20:36 +08:00
|
|
|
stack = (unsigned long*)context->previous_esp;
|
|
|
|
if (!stack)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2006-09-26 16:52:34 +08:00
|
|
|
EXPORT_SYMBOL(dump_trace);
|
|
|
|
|
|
|
|
static void
|
|
|
|
print_trace_warning_symbol(void *data, char *msg, unsigned long symbol)
|
|
|
|
{
|
|
|
|
printk(data);
|
|
|
|
print_symbol(msg, symbol);
|
|
|
|
printk("\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
static void print_trace_warning(void *data, char *msg)
|
|
|
|
{
|
|
|
|
printk("%s%s\n", (char *)data, msg);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int print_trace_stack(void *data, char *name)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Print one address/symbol entries per line.
|
|
|
|
*/
|
|
|
|
static void print_trace_address(void *data, unsigned long addr)
|
|
|
|
{
|
|
|
|
printk("%s [<%08lx>] ", (char *)data, addr);
|
|
|
|
print_symbol("%s\n", addr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct stacktrace_ops print_trace_ops = {
|
|
|
|
.warning = print_trace_warning,
|
|
|
|
.warning_symbol = print_trace_warning_symbol,
|
|
|
|
.stack = print_trace_stack,
|
|
|
|
.address = print_trace_address,
|
|
|
|
};
|
|
|
|
|
|
|
|
static void
|
|
|
|
show_trace_log_lvl(struct task_struct *task, struct pt_regs *regs,
|
|
|
|
unsigned long * stack, char *log_lvl)
|
|
|
|
{
|
|
|
|
dump_trace(task, regs, stack, &print_trace_ops, log_lvl);
|
|
|
|
printk("%s =======================\n", log_lvl);
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-09-26 16:52:34 +08:00
|
|
|
void show_trace(struct task_struct *task, struct pt_regs *regs,
|
|
|
|
unsigned long * stack)
|
2006-01-15 05:20:52 +08:00
|
|
|
{
|
2006-06-26 19:57:41 +08:00
|
|
|
show_trace_log_lvl(task, regs, stack, "");
|
2006-01-15 05:20:52 +08:00
|
|
|
}
|
|
|
|
|
2006-06-26 19:57:41 +08:00
|
|
|
static void show_stack_log_lvl(struct task_struct *task, struct pt_regs *regs,
|
|
|
|
unsigned long *esp, char *log_lvl)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
unsigned long *stack;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (esp == NULL) {
|
|
|
|
if (task)
|
|
|
|
esp = (unsigned long*)task->thread.esp;
|
|
|
|
else
|
|
|
|
esp = (unsigned long *)&esp;
|
|
|
|
}
|
|
|
|
|
|
|
|
stack = esp;
|
|
|
|
for(i = 0; i < kstack_depth_to_print; i++) {
|
|
|
|
if (kstack_end(stack))
|
|
|
|
break;
|
2006-03-23 18:59:52 +08:00
|
|
|
if (i && ((i % 8) == 0))
|
|
|
|
printk("\n%s ", log_lvl);
|
2005-04-17 06:20:36 +08:00
|
|
|
printk("%08lx ", *stack++);
|
|
|
|
}
|
2006-03-23 18:59:52 +08:00
|
|
|
printk("\n%sCall Trace:\n", log_lvl);
|
2006-06-26 19:57:41 +08:00
|
|
|
show_trace_log_lvl(task, regs, esp, log_lvl);
|
2006-01-15 05:20:52 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void show_stack(struct task_struct *task, unsigned long *esp)
|
|
|
|
{
|
2006-03-23 18:59:52 +08:00
|
|
|
printk(" ");
|
2006-06-26 19:57:41 +08:00
|
|
|
show_stack_log_lvl(task, NULL, esp, "");
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The architecture-independent dump_stack generator
|
|
|
|
*/
|
|
|
|
void dump_stack(void)
|
|
|
|
{
|
|
|
|
unsigned long stack;
|
|
|
|
|
2006-06-26 19:57:41 +08:00
|
|
|
show_trace(current, NULL, &stack);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(dump_stack);
|
|
|
|
|
|
|
|
void show_registers(struct pt_regs *regs)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
int in_kernel = 1;
|
|
|
|
unsigned long esp;
|
|
|
|
unsigned short ss;
|
|
|
|
|
|
|
|
esp = (unsigned long) (®s->esp);
|
2005-09-04 06:56:43 +08:00
|
|
|
savesegment(ss, ss);
|
2006-03-23 18:59:46 +08:00
|
|
|
if (user_mode_vm(regs)) {
|
2005-04-17 06:20:36 +08:00
|
|
|
in_kernel = 0;
|
|
|
|
esp = regs->esp;
|
|
|
|
ss = regs->xss & 0xffff;
|
|
|
|
}
|
|
|
|
print_modules();
|
2006-01-10 12:51:32 +08:00
|
|
|
printk(KERN_EMERG "CPU: %d\nEIP: %04x:[<%08lx>] %s VLI\n"
|
2006-02-05 15:28:04 +08:00
|
|
|
"EFLAGS: %08lx (%s %.*s) \n",
|
2005-04-17 06:20:36 +08:00
|
|
|
smp_processor_id(), 0xffff & regs->xcs, regs->eip,
|
2006-02-05 15:28:04 +08:00
|
|
|
print_tainted(), regs->eflags, system_utsname.release,
|
|
|
|
(int)strcspn(system_utsname.version, " "),
|
|
|
|
system_utsname.version);
|
2006-01-10 12:51:32 +08:00
|
|
|
print_symbol(KERN_EMERG "EIP is at %s\n", regs->eip);
|
|
|
|
printk(KERN_EMERG "eax: %08lx ebx: %08lx ecx: %08lx edx: %08lx\n",
|
2005-04-17 06:20:36 +08:00
|
|
|
regs->eax, regs->ebx, regs->ecx, regs->edx);
|
2006-01-10 12:51:32 +08:00
|
|
|
printk(KERN_EMERG "esi: %08lx edi: %08lx ebp: %08lx esp: %08lx\n",
|
2005-04-17 06:20:36 +08:00
|
|
|
regs->esi, regs->edi, regs->ebp, esp);
|
2006-01-10 12:51:32 +08:00
|
|
|
printk(KERN_EMERG "ds: %04x es: %04x ss: %04x\n",
|
2005-04-17 06:20:36 +08:00
|
|
|
regs->xds & 0xffff, regs->xes & 0xffff, ss);
|
2006-06-23 17:04:31 +08:00
|
|
|
printk(KERN_EMERG "Process %.*s (pid: %d, ti=%p task=%p task.ti=%p)",
|
|
|
|
TASK_COMM_LEN, current->comm, current->pid,
|
|
|
|
current_thread_info(), current, current->thread_info);
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
* When in-kernel, we also print out the stack and code at the
|
|
|
|
* time of the fault..
|
|
|
|
*/
|
|
|
|
if (in_kernel) {
|
2005-06-26 05:58:44 +08:00
|
|
|
u8 __user *eip;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-01-10 12:51:32 +08:00
|
|
|
printk("\n" KERN_EMERG "Stack: ");
|
2006-06-26 19:57:41 +08:00
|
|
|
show_stack_log_lvl(NULL, regs, (unsigned long *)esp, KERN_EMERG);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-01-10 12:51:32 +08:00
|
|
|
printk(KERN_EMERG "Code: ");
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2005-06-26 05:58:44 +08:00
|
|
|
eip = (u8 __user *)regs->eip - 43;
|
2005-04-17 06:20:36 +08:00
|
|
|
for (i = 0; i < 64; i++, eip++) {
|
|
|
|
unsigned char c;
|
|
|
|
|
2005-06-26 05:58:44 +08:00
|
|
|
if (eip < (u8 __user *)PAGE_OFFSET || __get_user(c, eip)) {
|
2005-04-17 06:20:36 +08:00
|
|
|
printk(" Bad EIP value.");
|
|
|
|
break;
|
|
|
|
}
|
2005-06-26 05:58:44 +08:00
|
|
|
if (eip == (u8 __user *)regs->eip)
|
2005-04-17 06:20:36 +08:00
|
|
|
printk("<%02x> ", c);
|
|
|
|
else
|
|
|
|
printk("%02x ", c);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
printk("\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
static void handle_BUG(struct pt_regs *regs)
|
|
|
|
{
|
2006-07-14 15:23:58 +08:00
|
|
|
unsigned long eip = regs->eip;
|
2005-04-17 06:20:36 +08:00
|
|
|
unsigned short ud2;
|
|
|
|
|
|
|
|
if (eip < PAGE_OFFSET)
|
2006-07-14 15:23:58 +08:00
|
|
|
return;
|
2005-06-26 05:58:44 +08:00
|
|
|
if (__get_user(ud2, (unsigned short __user *)eip))
|
2006-07-14 15:23:58 +08:00
|
|
|
return;
|
2005-04-17 06:20:36 +08:00
|
|
|
if (ud2 != 0x0b0f)
|
2006-07-14 15:23:58 +08:00
|
|
|
return;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-01-10 12:51:32 +08:00
|
|
|
printk(KERN_EMERG "------------[ cut here ]------------\n");
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-07-14 15:23:58 +08:00
|
|
|
#ifdef CONFIG_DEBUG_BUGVERBOSE
|
|
|
|
do {
|
|
|
|
unsigned short line;
|
|
|
|
char *file;
|
|
|
|
char c;
|
|
|
|
|
|
|
|
if (__get_user(line, (unsigned short __user *)(eip + 2)))
|
|
|
|
break;
|
|
|
|
if (__get_user(file, (char * __user *)(eip + 4)) ||
|
|
|
|
(unsigned long)file < PAGE_OFFSET || __get_user(c, file))
|
|
|
|
file = "<bad filename>";
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-07-14 15:23:58 +08:00
|
|
|
printk(KERN_EMERG "kernel BUG at %s:%d!\n", file, line);
|
|
|
|
return;
|
|
|
|
} while (0);
|
|
|
|
#endif
|
|
|
|
printk(KERN_EMERG "Kernel BUG at [verbose debug info unavailable]\n");
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
2005-06-26 05:58:26 +08:00
|
|
|
/* This is gone through when something in the kernel
|
|
|
|
* has done something bad and is about to be terminated.
|
|
|
|
*/
|
2005-04-17 06:20:36 +08:00
|
|
|
void die(const char * str, struct pt_regs * regs, long err)
|
|
|
|
{
|
|
|
|
static struct {
|
|
|
|
spinlock_t lock;
|
|
|
|
u32 lock_owner;
|
|
|
|
int lock_owner_depth;
|
|
|
|
} die = {
|
|
|
|
.lock = SPIN_LOCK_UNLOCKED,
|
|
|
|
.lock_owner = -1,
|
|
|
|
.lock_owner_depth = 0
|
|
|
|
};
|
|
|
|
static int die_counter;
|
2006-01-06 16:11:48 +08:00
|
|
|
unsigned long flags;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-03-23 19:00:57 +08:00
|
|
|
oops_enter();
|
|
|
|
|
2005-06-22 08:14:34 +08:00
|
|
|
if (die.lock_owner != raw_smp_processor_id()) {
|
2005-04-17 06:20:36 +08:00
|
|
|
console_verbose();
|
2006-01-06 16:11:48 +08:00
|
|
|
spin_lock_irqsave(&die.lock, flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
die.lock_owner = smp_processor_id();
|
|
|
|
die.lock_owner_depth = 0;
|
|
|
|
bust_spinlocks(1);
|
|
|
|
}
|
2006-01-06 16:11:48 +08:00
|
|
|
else
|
|
|
|
local_save_flags(flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
if (++die.lock_owner_depth < 3) {
|
|
|
|
int nl = 0;
|
2006-04-11 13:53:11 +08:00
|
|
|
unsigned long esp;
|
|
|
|
unsigned short ss;
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
handle_BUG(regs);
|
2006-01-10 12:51:32 +08:00
|
|
|
printk(KERN_EMERG "%s: %04lx [#%d]\n", str, err & 0xffff, ++die_counter);
|
2005-04-17 06:20:36 +08:00
|
|
|
#ifdef CONFIG_PREEMPT
|
2006-01-10 12:51:32 +08:00
|
|
|
printk(KERN_EMERG "PREEMPT ");
|
2005-04-17 06:20:36 +08:00
|
|
|
nl = 1;
|
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_SMP
|
2006-01-10 12:51:32 +08:00
|
|
|
if (!nl)
|
|
|
|
printk(KERN_EMERG);
|
2005-04-17 06:20:36 +08:00
|
|
|
printk("SMP ");
|
|
|
|
nl = 1;
|
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_DEBUG_PAGEALLOC
|
2006-01-10 12:51:32 +08:00
|
|
|
if (!nl)
|
|
|
|
printk(KERN_EMERG);
|
2005-04-17 06:20:36 +08:00
|
|
|
printk("DEBUG_PAGEALLOC");
|
|
|
|
nl = 1;
|
|
|
|
#endif
|
|
|
|
if (nl)
|
|
|
|
printk("\n");
|
2006-03-26 17:37:01 +08:00
|
|
|
if (notify_die(DIE_OOPS, str, regs, err,
|
|
|
|
current->thread.trap_no, SIGSEGV) !=
|
2006-04-11 13:53:11 +08:00
|
|
|
NOTIFY_STOP) {
|
2006-03-26 17:37:01 +08:00
|
|
|
show_registers(regs);
|
2006-04-11 13:53:11 +08:00
|
|
|
/* Executive summary in case the oops scrolled away */
|
|
|
|
esp = (unsigned long) (®s->esp);
|
|
|
|
savesegment(ss, ss);
|
|
|
|
if (user_mode(regs)) {
|
|
|
|
esp = regs->esp;
|
|
|
|
ss = regs->xss & 0xffff;
|
|
|
|
}
|
|
|
|
printk(KERN_EMERG "EIP: [<%08lx>] ", regs->eip);
|
|
|
|
print_symbol("%s", regs->eip);
|
|
|
|
printk(" SS:ESP %04x:%08lx\n", ss, esp);
|
|
|
|
}
|
2006-03-26 17:37:01 +08:00
|
|
|
else
|
|
|
|
regs = NULL;
|
2005-04-17 06:20:36 +08:00
|
|
|
} else
|
2006-01-10 12:51:32 +08:00
|
|
|
printk(KERN_EMERG "Recursive die() failure, output suppressed\n");
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
bust_spinlocks(0);
|
|
|
|
die.lock_owner = -1;
|
2006-01-06 16:11:48 +08:00
|
|
|
spin_unlock_irqrestore(&die.lock, flags);
|
2005-06-26 05:58:26 +08:00
|
|
|
|
2006-03-26 17:37:01 +08:00
|
|
|
if (!regs)
|
|
|
|
return;
|
|
|
|
|
2005-06-26 05:58:26 +08:00
|
|
|
if (kexec_should_crash(current))
|
|
|
|
crash_kexec(regs);
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
if (in_interrupt())
|
|
|
|
panic("Fatal exception in interrupt");
|
|
|
|
|
2006-07-30 18:03:34 +08:00
|
|
|
if (panic_on_oops)
|
2006-08-14 14:24:22 +08:00
|
|
|
panic("Fatal exception");
|
2006-07-30 18:03:34 +08:00
|
|
|
|
2006-03-23 19:00:57 +08:00
|
|
|
oops_exit();
|
2005-04-17 06:20:36 +08:00
|
|
|
do_exit(SIGSEGV);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void die_if_kernel(const char * str, struct pt_regs * regs, long err)
|
|
|
|
{
|
2005-06-23 15:08:45 +08:00
|
|
|
if (!user_mode_vm(regs))
|
2005-04-17 06:20:36 +08:00
|
|
|
die(str, regs, err);
|
|
|
|
}
|
|
|
|
|
2005-09-07 06:19:27 +08:00
|
|
|
static void __kprobes do_trap(int trapnr, int signr, char *str, int vm86,
|
|
|
|
struct pt_regs * regs, long error_code,
|
|
|
|
siginfo_t *info)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2005-06-26 05:58:27 +08:00
|
|
|
struct task_struct *tsk = current;
|
|
|
|
tsk->thread.error_code = error_code;
|
|
|
|
tsk->thread.trap_no = trapnr;
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
if (regs->eflags & VM_MASK) {
|
|
|
|
if (vm86)
|
|
|
|
goto vm86_trap;
|
|
|
|
goto trap_signal;
|
|
|
|
}
|
|
|
|
|
2005-06-23 15:08:45 +08:00
|
|
|
if (!user_mode(regs))
|
2005-04-17 06:20:36 +08:00
|
|
|
goto kernel_trap;
|
|
|
|
|
|
|
|
trap_signal: {
|
|
|
|
if (info)
|
|
|
|
force_sig_info(signr, info, tsk);
|
|
|
|
else
|
|
|
|
force_sig(signr, tsk);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
kernel_trap: {
|
|
|
|
if (!fixup_exception(regs))
|
|
|
|
die(str, regs, error_code);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
vm86_trap: {
|
|
|
|
int ret = handle_vm86_trap((struct kernel_vm86_regs *) regs, error_code, trapnr);
|
|
|
|
if (ret) goto trap_signal;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#define DO_ERROR(trapnr, signr, str, name) \
|
|
|
|
fastcall void do_##name(struct pt_regs * regs, long error_code) \
|
|
|
|
{ \
|
|
|
|
if (notify_die(DIE_TRAP, str, regs, error_code, trapnr, signr) \
|
|
|
|
== NOTIFY_STOP) \
|
|
|
|
return; \
|
|
|
|
do_trap(trapnr, signr, str, 0, regs, error_code, NULL); \
|
|
|
|
}
|
|
|
|
|
|
|
|
#define DO_ERROR_INFO(trapnr, signr, str, name, sicode, siaddr) \
|
|
|
|
fastcall void do_##name(struct pt_regs * regs, long error_code) \
|
|
|
|
{ \
|
|
|
|
siginfo_t info; \
|
|
|
|
info.si_signo = signr; \
|
|
|
|
info.si_errno = 0; \
|
|
|
|
info.si_code = sicode; \
|
|
|
|
info.si_addr = (void __user *)siaddr; \
|
|
|
|
if (notify_die(DIE_TRAP, str, regs, error_code, trapnr, signr) \
|
|
|
|
== NOTIFY_STOP) \
|
|
|
|
return; \
|
|
|
|
do_trap(trapnr, signr, str, 0, regs, error_code, &info); \
|
|
|
|
}
|
|
|
|
|
|
|
|
#define DO_VM86_ERROR(trapnr, signr, str, name) \
|
|
|
|
fastcall void do_##name(struct pt_regs * regs, long error_code) \
|
|
|
|
{ \
|
|
|
|
if (notify_die(DIE_TRAP, str, regs, error_code, trapnr, signr) \
|
|
|
|
== NOTIFY_STOP) \
|
|
|
|
return; \
|
|
|
|
do_trap(trapnr, signr, str, 1, regs, error_code, NULL); \
|
|
|
|
}
|
|
|
|
|
|
|
|
#define DO_VM86_ERROR_INFO(trapnr, signr, str, name, sicode, siaddr) \
|
|
|
|
fastcall void do_##name(struct pt_regs * regs, long error_code) \
|
|
|
|
{ \
|
|
|
|
siginfo_t info; \
|
|
|
|
info.si_signo = signr; \
|
|
|
|
info.si_errno = 0; \
|
|
|
|
info.si_code = sicode; \
|
|
|
|
info.si_addr = (void __user *)siaddr; \
|
|
|
|
if (notify_die(DIE_TRAP, str, regs, error_code, trapnr, signr) \
|
|
|
|
== NOTIFY_STOP) \
|
|
|
|
return; \
|
|
|
|
do_trap(trapnr, signr, str, 1, regs, error_code, &info); \
|
|
|
|
}
|
|
|
|
|
|
|
|
DO_VM86_ERROR_INFO( 0, SIGFPE, "divide error", divide_error, FPE_INTDIV, regs->eip)
|
|
|
|
#ifndef CONFIG_KPROBES
|
|
|
|
DO_VM86_ERROR( 3, SIGTRAP, "int3", int3)
|
|
|
|
#endif
|
|
|
|
DO_VM86_ERROR( 4, SIGSEGV, "overflow", overflow)
|
|
|
|
DO_VM86_ERROR( 5, SIGSEGV, "bounds", bounds)
|
2006-01-04 11:36:14 +08:00
|
|
|
DO_ERROR_INFO( 6, SIGILL, "invalid opcode", invalid_op, ILL_ILLOPN, regs->eip)
|
2005-04-17 06:20:36 +08:00
|
|
|
DO_ERROR( 9, SIGFPE, "coprocessor segment overrun", coprocessor_segment_overrun)
|
|
|
|
DO_ERROR(10, SIGSEGV, "invalid TSS", invalid_TSS)
|
|
|
|
DO_ERROR(11, SIGBUS, "segment not present", segment_not_present)
|
|
|
|
DO_ERROR(12, SIGBUS, "stack segment", stack_segment)
|
|
|
|
DO_ERROR_INFO(17, SIGBUS, "alignment check", alignment_check, BUS_ADRALN, 0)
|
2005-04-30 00:38:44 +08:00
|
|
|
DO_ERROR_INFO(32, SIGSEGV, "iret exception", iret_error, ILL_BADSTK, 0)
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2005-09-07 06:19:27 +08:00
|
|
|
fastcall void __kprobes do_general_protection(struct pt_regs * regs,
|
|
|
|
long error_code)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
int cpu = get_cpu();
|
|
|
|
struct tss_struct *tss = &per_cpu(init_tss, cpu);
|
|
|
|
struct thread_struct *thread = ¤t->thread;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Perform the lazy TSS's I/O bitmap copy. If the TSS has an
|
|
|
|
* invalid offset set (the LAZY one) and the faulting thread has
|
|
|
|
* a valid I/O bitmap pointer, we copy the I/O bitmap in the TSS
|
|
|
|
* and we set the offset field correctly. Then we let the CPU to
|
|
|
|
* restart the faulting instruction.
|
|
|
|
*/
|
|
|
|
if (tss->io_bitmap_base == INVALID_IO_BITMAP_OFFSET_LAZY &&
|
|
|
|
thread->io_bitmap_ptr) {
|
|
|
|
memcpy(tss->io_bitmap, thread->io_bitmap_ptr,
|
|
|
|
thread->io_bitmap_max);
|
|
|
|
/*
|
|
|
|
* If the previously set map was extending to higher ports
|
|
|
|
* than the current one, pad extra space with 0xff (no access).
|
|
|
|
*/
|
|
|
|
if (thread->io_bitmap_max < tss->io_bitmap_max)
|
|
|
|
memset((char *) tss->io_bitmap +
|
|
|
|
thread->io_bitmap_max, 0xff,
|
|
|
|
tss->io_bitmap_max - thread->io_bitmap_max);
|
|
|
|
tss->io_bitmap_max = thread->io_bitmap_max;
|
|
|
|
tss->io_bitmap_base = IO_BITMAP_OFFSET;
|
2005-10-31 06:59:29 +08:00
|
|
|
tss->io_bitmap_owner = thread;
|
2005-04-17 06:20:36 +08:00
|
|
|
put_cpu();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
put_cpu();
|
|
|
|
|
2005-06-26 05:58:27 +08:00
|
|
|
current->thread.error_code = error_code;
|
|
|
|
current->thread.trap_no = 13;
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
if (regs->eflags & VM_MASK)
|
|
|
|
goto gp_in_vm86;
|
|
|
|
|
2005-06-23 15:08:45 +08:00
|
|
|
if (!user_mode(regs))
|
2005-04-17 06:20:36 +08:00
|
|
|
goto gp_in_kernel;
|
|
|
|
|
|
|
|
current->thread.error_code = error_code;
|
|
|
|
current->thread.trap_no = 13;
|
|
|
|
force_sig(SIGSEGV, current);
|
|
|
|
return;
|
|
|
|
|
|
|
|
gp_in_vm86:
|
|
|
|
local_irq_enable();
|
|
|
|
handle_vm86_fault((struct kernel_vm86_regs *) regs, error_code);
|
|
|
|
return;
|
|
|
|
|
|
|
|
gp_in_kernel:
|
|
|
|
if (!fixup_exception(regs)) {
|
|
|
|
if (notify_die(DIE_GPF, "general protection fault", regs,
|
|
|
|
error_code, 13, SIGSEGV) == NOTIFY_STOP)
|
|
|
|
return;
|
|
|
|
die("general protection fault", regs, error_code);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void mem_parity_error(unsigned char reason, struct pt_regs * regs)
|
|
|
|
{
|
2006-09-26 16:52:27 +08:00
|
|
|
printk(KERN_EMERG "Uhhuh. NMI received for unknown reason %02x on "
|
|
|
|
"CPU %d.\n", reason, smp_processor_id());
|
2006-01-10 12:51:32 +08:00
|
|
|
printk(KERN_EMERG "You probably have a hardware problem with your RAM "
|
|
|
|
"chips\n");
|
2006-09-26 16:52:27 +08:00
|
|
|
if (panic_on_unrecovered_nmi)
|
|
|
|
panic("NMI: Not continuing");
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-09-26 16:52:27 +08:00
|
|
|
printk(KERN_EMERG "Dazed and confused, but trying to continue\n");
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/* Clear and disable the memory parity error line. */
|
|
|
|
clear_mem_error(reason);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void io_check_error(unsigned char reason, struct pt_regs * regs)
|
|
|
|
{
|
|
|
|
unsigned long i;
|
|
|
|
|
2006-01-10 12:51:32 +08:00
|
|
|
printk(KERN_EMERG "NMI: IOCK error (debug interrupt?)\n");
|
2005-04-17 06:20:36 +08:00
|
|
|
show_registers(regs);
|
|
|
|
|
|
|
|
/* Re-enable the IOCK line, wait for a few seconds */
|
|
|
|
reason = (reason & 0xf) | 8;
|
|
|
|
outb(reason, 0x61);
|
|
|
|
i = 2000;
|
|
|
|
while (--i) udelay(1000);
|
|
|
|
reason &= ~8;
|
|
|
|
outb(reason, 0x61);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void unknown_nmi_error(unsigned char reason, struct pt_regs * regs)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_MCA
|
|
|
|
/* Might actually be able to figure out what the guilty party
|
|
|
|
* is. */
|
|
|
|
if( MCA_bus ) {
|
|
|
|
mca_handle_nmi();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
#endif
|
2006-09-26 16:52:27 +08:00
|
|
|
printk(KERN_EMERG "Uhhuh. NMI received for unknown reason %02x on "
|
|
|
|
"CPU %d.\n", reason, smp_processor_id());
|
|
|
|
printk(KERN_EMERG "Do you have a strange power saving mode enabled?\n");
|
2006-09-26 16:52:27 +08:00
|
|
|
if (panic_on_unrecovered_nmi)
|
|
|
|
panic("NMI: Not continuing");
|
|
|
|
|
2006-09-26 16:52:27 +08:00
|
|
|
printk(KERN_EMERG "Dazed and confused, but trying to continue\n");
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static DEFINE_SPINLOCK(nmi_print_lock);
|
|
|
|
|
|
|
|
void die_nmi (struct pt_regs *regs, const char *msg)
|
|
|
|
{
|
2006-03-26 17:37:01 +08:00
|
|
|
if (notify_die(DIE_NMIWATCHDOG, msg, regs, 0, 2, SIGINT) ==
|
2005-09-04 06:56:48 +08:00
|
|
|
NOTIFY_STOP)
|
|
|
|
return;
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
spin_lock(&nmi_print_lock);
|
|
|
|
/*
|
|
|
|
* We are in trouble anyway, lets at least try
|
|
|
|
* to get a message out.
|
|
|
|
*/
|
|
|
|
bust_spinlocks(1);
|
2006-01-10 12:51:32 +08:00
|
|
|
printk(KERN_EMERG "%s", msg);
|
2005-04-17 06:20:36 +08:00
|
|
|
printk(" on CPU%d, eip %08lx, registers:\n",
|
|
|
|
smp_processor_id(), regs->eip);
|
|
|
|
show_registers(regs);
|
2006-01-10 12:51:32 +08:00
|
|
|
printk(KERN_EMERG "console shuts up ...\n");
|
2005-04-17 06:20:36 +08:00
|
|
|
console_silent();
|
|
|
|
spin_unlock(&nmi_print_lock);
|
|
|
|
bust_spinlocks(0);
|
2005-06-26 05:58:26 +08:00
|
|
|
|
|
|
|
/* If we are in kernel we are probably nested up pretty bad
|
|
|
|
* and might aswell get out now while we still can.
|
|
|
|
*/
|
2006-03-23 18:59:46 +08:00
|
|
|
if (!user_mode_vm(regs)) {
|
2005-06-26 05:58:26 +08:00
|
|
|
current->thread.trap_no = 2;
|
|
|
|
crash_kexec(regs);
|
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
do_exit(SIGSEGV);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void default_do_nmi(struct pt_regs * regs)
|
|
|
|
{
|
|
|
|
unsigned char reason = 0;
|
|
|
|
|
|
|
|
/* Only the BSP gets external NMIs from the system. */
|
|
|
|
if (!smp_processor_id())
|
|
|
|
reason = get_nmi_reason();
|
|
|
|
|
|
|
|
if (!(reason & 0xc0)) {
|
2006-03-26 17:37:01 +08:00
|
|
|
if (notify_die(DIE_NMI_IPI, "nmi_ipi", regs, reason, 2, SIGINT)
|
2005-04-17 06:20:36 +08:00
|
|
|
== NOTIFY_STOP)
|
|
|
|
return;
|
|
|
|
#ifdef CONFIG_X86_LOCAL_APIC
|
|
|
|
/*
|
|
|
|
* Ok, so this is none of the documented NMI sources,
|
|
|
|
* so it must be the NMI watchdog.
|
|
|
|
*/
|
2006-09-26 16:52:26 +08:00
|
|
|
if (nmi_watchdog_tick(regs, reason))
|
2005-04-17 06:20:36 +08:00
|
|
|
return;
|
2006-09-26 16:52:27 +08:00
|
|
|
if (!do_nmi_callback(regs, smp_processor_id()))
|
2005-04-17 06:20:36 +08:00
|
|
|
#endif
|
2006-09-26 16:52:26 +08:00
|
|
|
unknown_nmi_error(reason, regs);
|
2006-09-26 16:52:27 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
return;
|
|
|
|
}
|
2006-03-26 17:37:01 +08:00
|
|
|
if (notify_die(DIE_NMI, "nmi", regs, reason, 2, SIGINT) == NOTIFY_STOP)
|
2005-04-17 06:20:36 +08:00
|
|
|
return;
|
|
|
|
if (reason & 0x80)
|
|
|
|
mem_parity_error(reason, regs);
|
|
|
|
if (reason & 0x40)
|
|
|
|
io_check_error(reason, regs);
|
|
|
|
/*
|
|
|
|
* Reassert NMI in case it became active meanwhile
|
|
|
|
* as it's edge-triggered.
|
|
|
|
*/
|
|
|
|
reassert_nmi();
|
|
|
|
}
|
|
|
|
|
|
|
|
fastcall void do_nmi(struct pt_regs * regs, long error_code)
|
|
|
|
{
|
|
|
|
int cpu;
|
|
|
|
|
|
|
|
nmi_enter();
|
|
|
|
|
|
|
|
cpu = smp_processor_id();
|
2005-06-26 05:54:50 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
++nmi_count(cpu);
|
|
|
|
|
2006-09-26 16:52:26 +08:00
|
|
|
default_do_nmi(regs);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
nmi_exit();
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_KPROBES
|
2005-09-07 06:19:27 +08:00
|
|
|
fastcall void __kprobes do_int3(struct pt_regs *regs, long error_code)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
if (notify_die(DIE_INT3, "int3", regs, error_code, 3, SIGTRAP)
|
|
|
|
== NOTIFY_STOP)
|
2005-05-01 23:58:49 +08:00
|
|
|
return;
|
2005-04-17 06:20:36 +08:00
|
|
|
/* This is an interrupt gate, because kprobes wants interrupts
|
|
|
|
disabled. Normal trap handlers don't. */
|
|
|
|
restore_interrupts(regs);
|
|
|
|
do_trap(3, SIGTRAP, "int3", 1, regs, error_code, NULL);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Our handling of the processor debug registers is non-trivial.
|
|
|
|
* We do not clear them on entry and exit from the kernel. Therefore
|
|
|
|
* it is possible to get a watchpoint trap here from inside the kernel.
|
|
|
|
* However, the code in ./ptrace.c has ensured that the user can
|
|
|
|
* only set watchpoints on userspace addresses. Therefore the in-kernel
|
|
|
|
* watchpoint trap can only occur in code which is reading/writing
|
|
|
|
* from user space. Such code must not hold kernel locks (since it
|
|
|
|
* can equally take a page fault), therefore it is safe to call
|
|
|
|
* force_sig_info even though that claims and releases locks.
|
|
|
|
*
|
|
|
|
* Code in ./signal.c ensures that the debug control register
|
|
|
|
* is restored before we deliver any signal, and therefore that
|
|
|
|
* user code runs with the correct debug control register even though
|
|
|
|
* we clear it here.
|
|
|
|
*
|
|
|
|
* Being careful here means that we don't have to be as careful in a
|
|
|
|
* lot of more complicated places (task switching can be a bit lazy
|
|
|
|
* about restoring all the debug state, and ptrace doesn't have to
|
|
|
|
* find every occurrence of the TF bit that could be saved away even
|
|
|
|
* by user code)
|
|
|
|
*/
|
2005-09-07 06:19:27 +08:00
|
|
|
fastcall void __kprobes do_debug(struct pt_regs * regs, long error_code)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
unsigned int condition;
|
|
|
|
struct task_struct *tsk = current;
|
|
|
|
|
2005-06-23 15:08:43 +08:00
|
|
|
get_debugreg(condition, 6);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
if (notify_die(DIE_DEBUG, "debug", regs, condition, error_code,
|
|
|
|
SIGTRAP) == NOTIFY_STOP)
|
|
|
|
return;
|
|
|
|
/* It's safe to allow irq's after DR6 has been saved */
|
|
|
|
if (regs->eflags & X86_EFLAGS_IF)
|
|
|
|
local_irq_enable();
|
|
|
|
|
|
|
|
/* Mask out spurious debug traps due to lazy DR7 setting */
|
|
|
|
if (condition & (DR_TRAP0|DR_TRAP1|DR_TRAP2|DR_TRAP3)) {
|
|
|
|
if (!tsk->thread.debugreg[7])
|
|
|
|
goto clear_dr7;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (regs->eflags & VM_MASK)
|
|
|
|
goto debug_vm86;
|
|
|
|
|
|
|
|
/* Save debug status register where ptrace can see it */
|
|
|
|
tsk->thread.debugreg[6] = condition;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Single-stepping through TF: make sure we ignore any events in
|
|
|
|
* kernel space (but re-enable TF when returning to user mode).
|
|
|
|
*/
|
|
|
|
if (condition & DR_STEP) {
|
|
|
|
/*
|
|
|
|
* We already checked v86 mode above, so we can
|
|
|
|
* check for kernel mode by just checking the CPL
|
|
|
|
* of CS.
|
|
|
|
*/
|
2005-06-23 15:08:45 +08:00
|
|
|
if (!user_mode(regs))
|
2005-04-17 06:20:36 +08:00
|
|
|
goto clear_TF_reenable;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Ok, finally something we can handle */
|
|
|
|
send_sigtrap(tsk, regs, error_code);
|
|
|
|
|
|
|
|
/* Disable additional traps. They'll be re-enabled when
|
|
|
|
* the signal is delivered.
|
|
|
|
*/
|
|
|
|
clear_dr7:
|
2005-06-23 15:08:43 +08:00
|
|
|
set_debugreg(0, 7);
|
2005-04-17 06:20:36 +08:00
|
|
|
return;
|
|
|
|
|
|
|
|
debug_vm86:
|
|
|
|
handle_vm86_trap((struct kernel_vm86_regs *) regs, error_code, 1);
|
|
|
|
return;
|
|
|
|
|
|
|
|
clear_TF_reenable:
|
|
|
|
set_tsk_thread_flag(tsk, TIF_SINGLESTEP);
|
|
|
|
regs->eflags &= ~TF_MASK;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Note that we play around with the 'TS' bit in an attempt to get
|
|
|
|
* the correct behaviour even in the presence of the asynchronous
|
|
|
|
* IRQ13 behaviour
|
|
|
|
*/
|
|
|
|
void math_error(void __user *eip)
|
|
|
|
{
|
|
|
|
struct task_struct * task;
|
|
|
|
siginfo_t info;
|
|
|
|
unsigned short cwd, swd;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Save the info for the exception handler and clear the error.
|
|
|
|
*/
|
|
|
|
task = current;
|
|
|
|
save_init_fpu(task);
|
|
|
|
task->thread.trap_no = 16;
|
|
|
|
task->thread.error_code = 0;
|
|
|
|
info.si_signo = SIGFPE;
|
|
|
|
info.si_errno = 0;
|
|
|
|
info.si_code = __SI_FAULT;
|
|
|
|
info.si_addr = eip;
|
|
|
|
/*
|
|
|
|
* (~cwd & swd) will mask out exceptions that are not set to unmasked
|
|
|
|
* status. 0x3f is the exception bits in these regs, 0x200 is the
|
|
|
|
* C1 reg you need in case of a stack fault, 0x040 is the stack
|
|
|
|
* fault bit. We should only be taking one exception at a time,
|
|
|
|
* so if this combination doesn't produce any single exception,
|
|
|
|
* then we have a bad program that isn't syncronizing its FPU usage
|
|
|
|
* and it will suffer the consequences since we won't be able to
|
|
|
|
* fully reproduce the context of the exception
|
|
|
|
*/
|
|
|
|
cwd = get_fpu_cwd(task);
|
|
|
|
swd = get_fpu_swd(task);
|
2005-08-24 09:36:40 +08:00
|
|
|
switch (swd & ~cwd & 0x3f) {
|
2005-09-13 16:55:41 +08:00
|
|
|
case 0x000: /* No unmasked exception */
|
|
|
|
return;
|
|
|
|
default: /* Multiple exceptions */
|
2005-04-17 06:20:36 +08:00
|
|
|
break;
|
|
|
|
case 0x001: /* Invalid Op */
|
2005-08-24 09:36:40 +08:00
|
|
|
/*
|
|
|
|
* swd & 0x240 == 0x040: Stack Underflow
|
|
|
|
* swd & 0x240 == 0x240: Stack Overflow
|
|
|
|
* User must clear the SF bit (0x40) if set
|
|
|
|
*/
|
2005-04-17 06:20:36 +08:00
|
|
|
info.si_code = FPE_FLTINV;
|
|
|
|
break;
|
|
|
|
case 0x002: /* Denormalize */
|
|
|
|
case 0x010: /* Underflow */
|
|
|
|
info.si_code = FPE_FLTUND;
|
|
|
|
break;
|
|
|
|
case 0x004: /* Zero Divide */
|
|
|
|
info.si_code = FPE_FLTDIV;
|
|
|
|
break;
|
|
|
|
case 0x008: /* Overflow */
|
|
|
|
info.si_code = FPE_FLTOVF;
|
|
|
|
break;
|
|
|
|
case 0x020: /* Precision */
|
|
|
|
info.si_code = FPE_FLTRES;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
force_sig_info(SIGFPE, &info, task);
|
|
|
|
}
|
|
|
|
|
|
|
|
fastcall void do_coprocessor_error(struct pt_regs * regs, long error_code)
|
|
|
|
{
|
|
|
|
ignore_fpu_irq = 1;
|
|
|
|
math_error((void __user *)regs->eip);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void simd_math_error(void __user *eip)
|
|
|
|
{
|
|
|
|
struct task_struct * task;
|
|
|
|
siginfo_t info;
|
|
|
|
unsigned short mxcsr;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Save the info for the exception handler and clear the error.
|
|
|
|
*/
|
|
|
|
task = current;
|
|
|
|
save_init_fpu(task);
|
|
|
|
task->thread.trap_no = 19;
|
|
|
|
task->thread.error_code = 0;
|
|
|
|
info.si_signo = SIGFPE;
|
|
|
|
info.si_errno = 0;
|
|
|
|
info.si_code = __SI_FAULT;
|
|
|
|
info.si_addr = eip;
|
|
|
|
/*
|
|
|
|
* The SIMD FPU exceptions are handled a little differently, as there
|
|
|
|
* is only a single status/control register. Thus, to determine which
|
|
|
|
* unmasked exception was caught we must mask the exception mask bits
|
|
|
|
* at 0x1f80, and then use these to mask the exception bits at 0x3f.
|
|
|
|
*/
|
|
|
|
mxcsr = get_fpu_mxcsr(task);
|
|
|
|
switch (~((mxcsr & 0x1f80) >> 7) & (mxcsr & 0x3f)) {
|
|
|
|
case 0x000:
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
case 0x001: /* Invalid Op */
|
|
|
|
info.si_code = FPE_FLTINV;
|
|
|
|
break;
|
|
|
|
case 0x002: /* Denormalize */
|
|
|
|
case 0x010: /* Underflow */
|
|
|
|
info.si_code = FPE_FLTUND;
|
|
|
|
break;
|
|
|
|
case 0x004: /* Zero Divide */
|
|
|
|
info.si_code = FPE_FLTDIV;
|
|
|
|
break;
|
|
|
|
case 0x008: /* Overflow */
|
|
|
|
info.si_code = FPE_FLTOVF;
|
|
|
|
break;
|
|
|
|
case 0x020: /* Precision */
|
|
|
|
info.si_code = FPE_FLTRES;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
force_sig_info(SIGFPE, &info, task);
|
|
|
|
}
|
|
|
|
|
|
|
|
fastcall void do_simd_coprocessor_error(struct pt_regs * regs,
|
|
|
|
long error_code)
|
|
|
|
{
|
|
|
|
if (cpu_has_xmm) {
|
|
|
|
/* Handle SIMD FPU exceptions on PIII+ processors. */
|
|
|
|
ignore_fpu_irq = 1;
|
|
|
|
simd_math_error((void __user *)regs->eip);
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Handle strange cache flush from user space exception
|
|
|
|
* in all other cases. This is undocumented behaviour.
|
|
|
|
*/
|
|
|
|
if (regs->eflags & VM_MASK) {
|
|
|
|
handle_vm86_fault((struct kernel_vm86_regs *)regs,
|
|
|
|
error_code);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
current->thread.trap_no = 19;
|
|
|
|
current->thread.error_code = error_code;
|
2005-06-26 05:58:27 +08:00
|
|
|
die_if_kernel("cache flush denied", regs, error_code);
|
2005-04-17 06:20:36 +08:00
|
|
|
force_sig(SIGSEGV, current);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fastcall void do_spurious_interrupt_bug(struct pt_regs * regs,
|
|
|
|
long error_code)
|
|
|
|
{
|
|
|
|
#if 0
|
|
|
|
/* No need to warn about this any longer. */
|
|
|
|
printk("Ignoring P6 Local APIC Spurious Interrupt Bug...\n");
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
fastcall void setup_x86_bogus_stack(unsigned char * stk)
|
|
|
|
{
|
|
|
|
unsigned long *switch16_ptr, *switch32_ptr;
|
|
|
|
struct pt_regs *regs;
|
|
|
|
unsigned long stack_top, stack_bot;
|
|
|
|
unsigned short iret_frame16_off;
|
|
|
|
int cpu = smp_processor_id();
|
|
|
|
/* reserve the space on 32bit stack for the magic switch16 pointer */
|
|
|
|
memmove(stk, stk + 8, sizeof(struct pt_regs));
|
|
|
|
switch16_ptr = (unsigned long *)(stk + sizeof(struct pt_regs));
|
|
|
|
regs = (struct pt_regs *)stk;
|
|
|
|
/* now the switch32 on 16bit stack */
|
|
|
|
stack_bot = (unsigned long)&per_cpu(cpu_16bit_stack, cpu);
|
|
|
|
stack_top = stack_bot + CPU_16BIT_STACK_SIZE;
|
|
|
|
switch32_ptr = (unsigned long *)(stack_top - 8);
|
|
|
|
iret_frame16_off = CPU_16BIT_STACK_SIZE - 8 - 20;
|
|
|
|
/* copy iret frame on 16bit stack */
|
|
|
|
memcpy((void *)(stack_bot + iret_frame16_off), ®s->eip, 20);
|
|
|
|
/* fill in the switch pointers */
|
|
|
|
switch16_ptr[0] = (regs->esp & 0xffff0000) | iret_frame16_off;
|
|
|
|
switch16_ptr[1] = __ESPFIX_SS;
|
|
|
|
switch32_ptr[0] = (unsigned long)stk + sizeof(struct pt_regs) +
|
|
|
|
8 - CPU_16BIT_STACK_SIZE;
|
|
|
|
switch32_ptr[1] = __KERNEL_DS;
|
|
|
|
}
|
|
|
|
|
|
|
|
fastcall unsigned char * fixup_x86_bogus_stack(unsigned short sp)
|
|
|
|
{
|
|
|
|
unsigned long *switch32_ptr;
|
|
|
|
unsigned char *stack16, *stack32;
|
|
|
|
unsigned long stack_top, stack_bot;
|
|
|
|
int len;
|
|
|
|
int cpu = smp_processor_id();
|
|
|
|
stack_bot = (unsigned long)&per_cpu(cpu_16bit_stack, cpu);
|
|
|
|
stack_top = stack_bot + CPU_16BIT_STACK_SIZE;
|
|
|
|
switch32_ptr = (unsigned long *)(stack_top - 8);
|
|
|
|
/* copy the data from 16bit stack to 32bit stack */
|
|
|
|
len = CPU_16BIT_STACK_SIZE - 8 - sp;
|
|
|
|
stack16 = (unsigned char *)(stack_bot + sp);
|
|
|
|
stack32 = (unsigned char *)
|
|
|
|
(switch32_ptr[0] + CPU_16BIT_STACK_SIZE - 8 - len);
|
|
|
|
memcpy(stack32, stack16, len);
|
|
|
|
return stack32;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 'math_state_restore()' saves the current math information in the
|
|
|
|
* old math state array, and gets the new ones from the current task
|
|
|
|
*
|
|
|
|
* Careful.. There are problems with IBM-designed IRQ13 behaviour.
|
|
|
|
* Don't touch unless you *really* know how it works.
|
|
|
|
*
|
|
|
|
* Must be called with kernel preemption disabled (in this case,
|
|
|
|
* local interrupts are disabled at the call-site in entry.S).
|
|
|
|
*/
|
|
|
|
asmlinkage void math_state_restore(struct pt_regs regs)
|
|
|
|
{
|
|
|
|
struct thread_info *thread = current_thread_info();
|
|
|
|
struct task_struct *tsk = thread->task;
|
|
|
|
|
|
|
|
clts(); /* Allow maths ops (or we recurse) */
|
|
|
|
if (!tsk_used_math(tsk))
|
|
|
|
init_fpu(tsk);
|
|
|
|
restore_fpu(tsk);
|
|
|
|
thread->status |= TS_USEDFPU; /* So we fnsave on switch_to() */
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef CONFIG_MATH_EMULATION
|
|
|
|
|
|
|
|
asmlinkage void math_emulate(long arg)
|
|
|
|
{
|
2006-01-10 12:51:32 +08:00
|
|
|
printk(KERN_EMERG "math-emulation not enabled and no coprocessor found.\n");
|
|
|
|
printk(KERN_EMERG "killing %s.\n",current->comm);
|
2005-04-17 06:20:36 +08:00
|
|
|
force_sig(SIGFPE,current);
|
|
|
|
schedule();
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* CONFIG_MATH_EMULATION */
|
|
|
|
|
|
|
|
#ifdef CONFIG_X86_F00F_BUG
|
|
|
|
void __init trap_init_f00f_bug(void)
|
|
|
|
{
|
|
|
|
__set_fixmap(FIX_F00F_IDT, __pa(&idt_table), PAGE_KERNEL_RO);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Update the IDT descriptor and reload the IDT so that
|
|
|
|
* it uses the read-only mapped virtual address.
|
|
|
|
*/
|
|
|
|
idt_descr.address = fix_to_virt(FIX_F00F_IDT);
|
2005-09-04 06:56:38 +08:00
|
|
|
load_idt(&idt_descr);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#define _set_gate(gate_addr,type,dpl,addr,seg) \
|
|
|
|
do { \
|
|
|
|
int __d0, __d1; \
|
|
|
|
__asm__ __volatile__ ("movw %%dx,%%ax\n\t" \
|
|
|
|
"movw %4,%%dx\n\t" \
|
|
|
|
"movl %%eax,%0\n\t" \
|
|
|
|
"movl %%edx,%1" \
|
|
|
|
:"=m" (*((long *) (gate_addr))), \
|
|
|
|
"=m" (*(1+(long *) (gate_addr))), "=&a" (__d0), "=&d" (__d1) \
|
|
|
|
:"i" ((short) (0x8000+(dpl<<13)+(type<<8))), \
|
|
|
|
"3" ((char *) (addr)),"2" ((seg) << 16)); \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This needs to use 'idt_table' rather than 'idt', and
|
|
|
|
* thus use the _nonmapped_ version of the IDT, as the
|
|
|
|
* Pentium F0 0F bugfix can have resulted in the mapped
|
|
|
|
* IDT being write-protected.
|
|
|
|
*/
|
|
|
|
void set_intr_gate(unsigned int n, void *addr)
|
|
|
|
{
|
|
|
|
_set_gate(idt_table+n,14,0,addr,__KERNEL_CS);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This routine sets up an interrupt gate at directory privilege level 3.
|
|
|
|
*/
|
|
|
|
static inline void set_system_intr_gate(unsigned int n, void *addr)
|
|
|
|
{
|
|
|
|
_set_gate(idt_table+n, 14, 3, addr, __KERNEL_CS);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __init set_trap_gate(unsigned int n, void *addr)
|
|
|
|
{
|
|
|
|
_set_gate(idt_table+n,15,0,addr,__KERNEL_CS);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __init set_system_gate(unsigned int n, void *addr)
|
|
|
|
{
|
|
|
|
_set_gate(idt_table+n,15,3,addr,__KERNEL_CS);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __init set_task_gate(unsigned int n, unsigned int gdt_entry)
|
|
|
|
{
|
|
|
|
_set_gate(idt_table+n,5,0,0,(gdt_entry<<3));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void __init trap_init(void)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_EISA
|
|
|
|
void __iomem *p = ioremap(0x0FFFD9, 4);
|
|
|
|
if (readl(p) == 'E'+('I'<<8)+('S'<<16)+('A'<<24)) {
|
|
|
|
EISA_bus = 1;
|
|
|
|
}
|
|
|
|
iounmap(p);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef CONFIG_X86_LOCAL_APIC
|
|
|
|
init_apic_mappings();
|
|
|
|
#endif
|
|
|
|
|
|
|
|
set_trap_gate(0,÷_error);
|
|
|
|
set_intr_gate(1,&debug);
|
|
|
|
set_intr_gate(2,&nmi);
|
2006-01-06 16:11:49 +08:00
|
|
|
set_system_intr_gate(3, &int3); /* int3/4 can be called from all */
|
2005-04-17 06:20:36 +08:00
|
|
|
set_system_gate(4,&overflow);
|
2006-01-06 16:11:49 +08:00
|
|
|
set_trap_gate(5,&bounds);
|
2005-04-17 06:20:36 +08:00
|
|
|
set_trap_gate(6,&invalid_op);
|
|
|
|
set_trap_gate(7,&device_not_available);
|
|
|
|
set_task_gate(8,GDT_ENTRY_DOUBLEFAULT_TSS);
|
|
|
|
set_trap_gate(9,&coprocessor_segment_overrun);
|
|
|
|
set_trap_gate(10,&invalid_TSS);
|
|
|
|
set_trap_gate(11,&segment_not_present);
|
|
|
|
set_trap_gate(12,&stack_segment);
|
|
|
|
set_trap_gate(13,&general_protection);
|
|
|
|
set_intr_gate(14,&page_fault);
|
|
|
|
set_trap_gate(15,&spurious_interrupt_bug);
|
|
|
|
set_trap_gate(16,&coprocessor_error);
|
|
|
|
set_trap_gate(17,&alignment_check);
|
|
|
|
#ifdef CONFIG_X86_MCE
|
|
|
|
set_trap_gate(18,&machine_check);
|
|
|
|
#endif
|
|
|
|
set_trap_gate(19,&simd_coprocessor_error);
|
|
|
|
|
2006-01-06 16:11:49 +08:00
|
|
|
if (cpu_has_fxsr) {
|
|
|
|
/*
|
|
|
|
* Verify that the FXSAVE/FXRSTOR data will be 16-byte aligned.
|
|
|
|
* Generates a compile-time "error: zero width for bit-field" if
|
|
|
|
* the alignment is wrong.
|
|
|
|
*/
|
|
|
|
struct fxsrAlignAssert {
|
|
|
|
int _:!(offsetof(struct task_struct,
|
|
|
|
thread.i387.fxsave) & 15);
|
|
|
|
};
|
|
|
|
|
|
|
|
printk(KERN_INFO "Enabling fast FPU save and restore... ");
|
|
|
|
set_in_cr4(X86_CR4_OSFXSR);
|
|
|
|
printk("done.\n");
|
|
|
|
}
|
|
|
|
if (cpu_has_xmm) {
|
|
|
|
printk(KERN_INFO "Enabling unmasked SIMD FPU exception "
|
|
|
|
"support... ");
|
|
|
|
set_in_cr4(X86_CR4_OSXMMEXCPT);
|
|
|
|
printk("done.\n");
|
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
set_system_gate(SYSCALL_VECTOR,&system_call);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Should be a barrier for any external CPU state.
|
|
|
|
*/
|
|
|
|
cpu_init();
|
|
|
|
|
|
|
|
trap_init_hook();
|
|
|
|
}
|
|
|
|
|
|
|
|
static int __init kstack_setup(char *s)
|
|
|
|
{
|
|
|
|
kstack_depth_to_print = simple_strtoul(s, NULL, 0);
|
2006-03-31 18:30:33 +08:00
|
|
|
return 1;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
__setup("kstack=", kstack_setup);
|
2006-06-26 19:57:47 +08:00
|
|
|
|
2006-08-31 01:37:11 +08:00
|
|
|
#ifdef CONFIG_STACK_UNWIND
|
2006-06-26 19:57:47 +08:00
|
|
|
static int __init call_trace_setup(char *s)
|
|
|
|
{
|
|
|
|
if (strcmp(s, "old") == 0)
|
|
|
|
call_trace = -1;
|
|
|
|
else if (strcmp(s, "both") == 0)
|
|
|
|
call_trace = 0;
|
2006-07-30 03:42:52 +08:00
|
|
|
else if (strcmp(s, "newfallback") == 0)
|
2006-06-26 19:57:47 +08:00
|
|
|
call_trace = 1;
|
2006-07-30 03:42:52 +08:00
|
|
|
else if (strcmp(s, "new") == 2)
|
|
|
|
call_trace = 2;
|
2006-06-26 19:57:47 +08:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
__setup("call_trace=", call_trace_setup);
|
2006-08-31 01:37:11 +08:00
|
|
|
#endif
|