2005-04-16 18:20:36 -04:00
|
|
|
/*
|
|
|
|
* Copyright (C) 1995 Linus Torvalds
|
|
|
|
*
|
|
|
|
* Pentium III FXSR, SSE support
|
|
|
|
* Gareth Hughes <gareth@valinux.com>, May 2000
|
2008-01-30 07:31:03 -05:00
|
|
|
*
|
2005-04-16 18:20:36 -04:00
|
|
|
* X86-64 port
|
|
|
|
* Andi Kleen.
|
2005-06-25 17:55:00 -04:00
|
|
|
*
|
|
|
|
* CPU hotplug support - ashok.raj@intel.com
|
2005-04-16 18:20:36 -04:00
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This file handles the architecture-dependent parts of process handling..
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdarg.h>
|
|
|
|
|
2005-06-25 17:55:00 -04:00
|
|
|
#include <linux/cpu.h>
|
2005-04-16 18:20:36 -04:00
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/sched.h>
|
2008-01-30 07:31:03 -05:00
|
|
|
#include <linux/fs.h>
|
2005-04-16 18:20:36 -04:00
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/elfcore.h>
|
|
|
|
#include <linux/smp.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/user.h>
|
|
|
|
#include <linux/interrupt.h>
|
2008-01-30 07:31:03 -05:00
|
|
|
#include <linux/utsname.h>
|
2005-04-16 18:20:36 -04:00
|
|
|
#include <linux/delay.h>
|
2008-01-30 07:31:03 -05:00
|
|
|
#include <linux/module.h>
|
2005-04-16 18:20:36 -04:00
|
|
|
#include <linux/ptrace.h>
|
|
|
|
#include <linux/random.h>
|
2006-01-11 16:44:36 -05:00
|
|
|
#include <linux/notifier.h>
|
2006-03-26 04:38:20 -05:00
|
|
|
#include <linux/kprobes.h>
|
2007-05-08 03:27:03 -04:00
|
|
|
#include <linux/kdebug.h>
|
2007-10-12 17:04:07 -04:00
|
|
|
#include <linux/tick.h>
|
2008-04-13 18:24:18 -04:00
|
|
|
#include <linux/prctl.h>
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
#include <asm/uaccess.h>
|
|
|
|
#include <asm/pgtable.h>
|
|
|
|
#include <asm/system.h>
|
|
|
|
#include <asm/io.h>
|
|
|
|
#include <asm/processor.h>
|
|
|
|
#include <asm/i387.h>
|
|
|
|
#include <asm/mmu_context.h>
|
|
|
|
#include <asm/pda.h>
|
|
|
|
#include <asm/prctl.h>
|
|
|
|
#include <asm/desc.h>
|
|
|
|
#include <asm/proto.h>
|
|
|
|
#include <asm/ia32.h>
|
2006-01-11 16:44:36 -05:00
|
|
|
#include <asm/idle.h>
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
asmlinkage extern void ret_from_fork(void);
|
|
|
|
|
|
|
|
unsigned long kernel_thread_flags = CLONE_VM | CLONE_UNTRACED;
|
|
|
|
|
|
|
|
unsigned long boot_option_idle_override = 0;
|
|
|
|
EXPORT_SYMBOL(boot_option_idle_override);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Powermanagement idle function, if any..
|
|
|
|
*/
|
|
|
|
void (*pm_idle)(void);
|
2006-06-26 07:59:44 -04:00
|
|
|
EXPORT_SYMBOL(pm_idle);
|
2005-04-16 18:20:36 -04: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 04:16:30 -05:00
|
|
|
static ATOMIC_NOTIFIER_HEAD(idle_notifier);
|
2006-01-11 16:44:36 -05:00
|
|
|
|
|
|
|
void idle_notifier_register(struct notifier_block *n)
|
|
|
|
{
|
[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 04:16:30 -05:00
|
|
|
atomic_notifier_chain_register(&idle_notifier, n);
|
2006-01-11 16:44:36 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
void enter_idle(void)
|
|
|
|
{
|
2006-09-26 04:52:40 -04:00
|
|
|
write_pda(isidle, 1);
|
[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 04:16:30 -05:00
|
|
|
atomic_notifier_call_chain(&idle_notifier, IDLE_START, NULL);
|
2006-01-11 16:44:36 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static void __exit_idle(void)
|
|
|
|
{
|
2006-11-14 10:57:46 -05:00
|
|
|
if (test_and_clear_bit_pda(0, isidle) == 0)
|
2006-09-26 04:52:40 -04:00
|
|
|
return;
|
[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 04:16:30 -05:00
|
|
|
atomic_notifier_call_chain(&idle_notifier, IDLE_END, NULL);
|
2006-01-11 16:44:36 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Called from interrupts to signify idle end */
|
|
|
|
void exit_idle(void)
|
|
|
|
{
|
2006-09-26 04:52:40 -04:00
|
|
|
/* idle loop has pid 0 */
|
|
|
|
if (current->pid)
|
2006-01-11 16:44:36 -05:00
|
|
|
return;
|
|
|
|
__exit_idle();
|
|
|
|
}
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
/*
|
|
|
|
* We use this if we don't have any better
|
|
|
|
* idle routine..
|
|
|
|
*/
|
2008-01-30 07:31:08 -05:00
|
|
|
void default_idle(void)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
2006-06-26 07:59:11 -04:00
|
|
|
current_thread_info()->status &= ~TS_POLLING;
|
[PATCH] sched: fix bad missed wakeups in the i386, x86_64, ia64, ACPI and APM idle code
Fernando Lopez-Lezcano reported frequent scheduling latencies and audio
xruns starting at the 2.6.18-rt kernel, and those problems persisted all
until current -rt kernels. The latencies were serious and unjustified by
system load, often in the milliseconds range.
After a patient and heroic multi-month effort of Fernando, where he
tested dozens of kernels, tried various configs, boot options,
test-patches of mine and provided latency traces of those incidents, the
following 'smoking gun' trace was captured by him:
_------=> CPU#
/ _-----=> irqs-off
| / _----=> need-resched
|| / _---=> hardirq/softirq
||| / _--=> preempt-depth
|||| /
||||| delay
cmd pid ||||| time | caller
\ / ||||| \ | /
IRQ_19-1479 1D..1 0us : __trace_start_sched_wakeup (try_to_wake_up)
IRQ_19-1479 1D..1 0us : __trace_start_sched_wakeup <<...>-5856> (37 0)
IRQ_19-1479 1D..1 0us : __trace_start_sched_wakeup (c01262ba 0 0)
IRQ_19-1479 1D..1 0us : resched_task (try_to_wake_up)
IRQ_19-1479 1D..1 0us : __spin_unlock_irqrestore (try_to_wake_up)
...
<idle>-0 1...1 11us!: default_idle (cpu_idle)
...
<idle>-0 0Dn.1 602us : smp_apic_timer_interrupt (c0103baf 1 0)
...
<...>-5856 0D..2 618us : __switch_to (__schedule)
<...>-5856 0D..2 618us : __schedule <<idle>-0> (20 162)
<...>-5856 0D..2 619us : __spin_unlock_irq (__schedule)
<...>-5856 0...1 619us : trace_stop_sched_switched (__schedule)
<...>-5856 0D..1 619us : trace_stop_sched_switched <<...>-5856> (37 0)
what is visible in this trace is that CPU#1 ran try_to_wake_up() for
PID:5856, it placed PID:5856 on CPU#0's runqueue and ran resched_task()
for CPU#0. But it decided to not send an IPI that no CPU - due to
TS_POLLING. But CPU#0 never woke up after its NEED_RESCHED bit was set,
and only rescheduled to PID:5856 upon the next lapic timer IRQ. The
result was a 600+ usecs latency and a missed wakeup!
the bug turned out to be an idle-wakeup bug introduced into the mainline
kernel this summer via an optimization in the x86_64 tree:
commit 495ab9c045e1b0e5c82951b762257fe1c9d81564
Author: Andi Kleen <ak@suse.de>
Date: Mon Jun 26 13:59:11 2006 +0200
[PATCH] i386/x86-64/ia64: Move polling flag into thread_info_status
During some profiling I noticed that default_idle causes a lot of
memory traffic. I think that is caused by the atomic operations
to clear/set the polling flag in thread_info. There is actually
no reason to make this atomic - only the idle thread does it
to itself, other CPUs only read it. So I moved it into ti->status.
the problem is this type of change:
if (!hlt_counter && boot_cpu_data.hlt_works_ok) {
- clear_thread_flag(TIF_POLLING_NRFLAG);
+ current_thread_info()->status &= ~TS_POLLING;
smp_mb__after_clear_bit();
while (!need_resched()) {
local_irq_disable();
this changes clear_thread_flag() to an explicit clearing of TS_POLLING.
clear_thread_flag() is defined as:
clear_bit(flag, &ti->flags);
and clear_bit() is a LOCK-ed atomic instruction on all x86 platforms:
static inline void clear_bit(int nr, volatile unsigned long * addr)
{
__asm__ __volatile__( LOCK_PREFIX
"btrl %1,%0"
hence smp_mb__after_clear_bit() is defined as a simple compile barrier:
#define smp_mb__after_clear_bit() barrier()
but the explicit TS_POLLING clearing introduced by the patch:
+ current_thread_info()->status &= ~TS_POLLING;
is not an atomic op! So the clearing of the TS_POLLING bit is freely
reorderable with the reading of the NEED_RESCHED bit - and both now
reside in different memory addresses.
CPU idle wakeup very much depends on ordered memory ops, the clearing of
the TS_POLLING flag must always be done before we test need_resched()
and hit the idle instruction(s). [Symmetrically, the wakeup code needs
to set NEED_RESCHED before it tests the TS_POLLING flag, so memory
ordering is paramount.]
Fernando's dual-core Athlon64 system has a sufficiently advanced memory
ordering model so that it triggered this scenario very often.
( And it also turned out that the reason why these latencies never
triggered on my testsystems is that i routinely use idle=poll, which
was the only idle variant not affected by this bug. )
The fix is to change the smp_mb__after_clear_bit() to an smp_mb(), to
act as an absolute barrier between the TS_POLLING write and the
NEED_RESCHED read. This affects almost all idling methods (default,
ACPI, APM), on all 3 x86 architectures: i386, x86_64, ia64.
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Tested-by: Fernando Lopez-Lezcano <nando@ccrma.Stanford.EDU>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-12-22 04:11:56 -05:00
|
|
|
/*
|
|
|
|
* TS_POLLING-cleared state must be visible before we
|
|
|
|
* test NEED_RESCHED:
|
|
|
|
*/
|
|
|
|
smp_mb();
|
2006-12-06 20:14:03 -05:00
|
|
|
local_irq_disable();
|
|
|
|
if (!need_resched()) {
|
2008-01-30 07:30:06 -05:00
|
|
|
safe_halt(); /* enables interrupts racelessly */
|
|
|
|
local_irq_disable();
|
2008-01-30 07:30:06 -05:00
|
|
|
}
|
|
|
|
local_irq_enable();
|
2006-06-26 07:59:11 -04:00
|
|
|
current_thread_info()->status |= TS_POLLING;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* On SMP it's slightly faster (but much more power-consuming!)
|
|
|
|
* to poll the ->need_resched flag instead of waiting for the
|
|
|
|
* cross-CPU IPI to arrive. Use this option with caution.
|
|
|
|
*/
|
2008-01-30 07:31:03 -05:00
|
|
|
static void poll_idle(void)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
2006-12-06 20:14:13 -05:00
|
|
|
local_irq_enable();
|
2006-12-06 20:14:03 -05:00
|
|
|
cpu_relax();
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2005-06-25 17:55:00 -04:00
|
|
|
#ifdef CONFIG_HOTPLUG_CPU
|
|
|
|
DECLARE_PER_CPU(int, cpu_state);
|
|
|
|
|
|
|
|
#include <asm/nmi.h>
|
2006-01-06 03:12:20 -05:00
|
|
|
/* We halt the CPU with physical CPU hotplug */
|
2005-06-25 17:55:00 -04:00
|
|
|
static inline void play_dead(void)
|
|
|
|
{
|
|
|
|
idle_task_exit();
|
|
|
|
wbinvd();
|
|
|
|
mb();
|
|
|
|
/* Ack it */
|
|
|
|
__get_cpu_var(cpu_state) = CPU_DEAD;
|
|
|
|
|
2006-01-06 03:12:20 -05:00
|
|
|
local_irq_disable();
|
2005-06-25 17:55:00 -04:00
|
|
|
while (1)
|
2006-01-06 03:12:20 -05:00
|
|
|
halt();
|
2005-06-25 17:55:00 -04:00
|
|
|
}
|
|
|
|
#else
|
|
|
|
static inline void play_dead(void)
|
|
|
|
{
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_HOTPLUG_CPU */
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
/*
|
|
|
|
* The idle thread. There's no useful work to be
|
|
|
|
* done, so just try to conserve power and have a
|
|
|
|
* low exit latency (ie sit in a loop waiting for
|
|
|
|
* somebody to say that they'd like to reschedule)
|
|
|
|
*/
|
2008-01-30 07:30:00 -05:00
|
|
|
void cpu_idle(void)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
2006-06-26 07:59:11 -04:00
|
|
|
current_thread_info()->status |= TS_POLLING;
|
2005-04-16 18:20:36 -04:00
|
|
|
/* endless idle loop with no priority at all */
|
|
|
|
while (1) {
|
2008-01-30 07:33:00 -05:00
|
|
|
tick_nohz_stop_sched_tick();
|
2005-04-16 18:20:36 -04:00
|
|
|
while (!need_resched()) {
|
|
|
|
void (*idle)(void);
|
|
|
|
|
|
|
|
rmb();
|
|
|
|
idle = pm_idle;
|
|
|
|
if (!idle)
|
|
|
|
idle = default_idle;
|
2005-06-25 17:55:00 -04:00
|
|
|
if (cpu_is_offline(smp_processor_id()))
|
|
|
|
play_dead();
|
2006-12-06 20:14:13 -05:00
|
|
|
/*
|
|
|
|
* Idle routines should keep interrupts disabled
|
|
|
|
* from here on, until they go to idle.
|
|
|
|
* Otherwise, idle callbacks can misfire.
|
|
|
|
*/
|
|
|
|
local_irq_disable();
|
2006-01-11 16:44:36 -05:00
|
|
|
enter_idle();
|
2005-04-16 18:20:36 -04:00
|
|
|
idle();
|
2006-09-26 04:52:40 -04:00
|
|
|
/* In many cases the interrupt that ended idle
|
|
|
|
has already called exit_idle. But some idle
|
|
|
|
loops can be woken up without interrupt. */
|
2006-01-11 16:44:36 -05:00
|
|
|
__exit_idle();
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2007-10-12 17:04:07 -04:00
|
|
|
tick_nohz_restart_sched_tick();
|
2005-11-09 00:39:01 -05:00
|
|
|
preempt_enable_no_resched();
|
2005-04-16 18:20:36 -04:00
|
|
|
schedule();
|
2005-11-09 00:39:01 -05:00
|
|
|
preempt_disable();
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-01-30 07:31:03 -05:00
|
|
|
static void do_nothing(void *unused)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2008-04-10 12:49:58 -04:00
|
|
|
/*
|
|
|
|
* cpu_idle_wait - Used to ensure that all the CPUs discard old value of
|
|
|
|
* pm_idle and update to new pm_idle value. Required while changing pm_idle
|
|
|
|
* handler on SMP systems.
|
|
|
|
*
|
|
|
|
* Caller must have changed pm_idle to the new value before the call. Old
|
|
|
|
* pm_idle value will not be used by any CPU after the return of this function.
|
|
|
|
*/
|
2008-01-30 07:31:03 -05:00
|
|
|
void cpu_idle_wait(void)
|
|
|
|
{
|
2008-04-10 12:49:58 -04:00
|
|
|
smp_mb();
|
|
|
|
/* kick all the CPUs so that they exit out of pm_idle */
|
|
|
|
smp_call_function(do_nothing, NULL, 0, 1);
|
2008-01-30 07:31:03 -05:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(cpu_idle_wait);
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
/*
|
|
|
|
* This uses new MONITOR/MWAIT instructions on P4 processors with PNI,
|
|
|
|
* which can obviate IPI to trigger checking of need_resched.
|
|
|
|
* We execute MONITOR against need_resched and enter optimized wait state
|
|
|
|
* through MWAIT. Whenever someone changes need_resched, we would be woken
|
|
|
|
* up from MWAIT (without an IPI).
|
2006-09-25 19:28:13 -04:00
|
|
|
*
|
|
|
|
* New with Core Duo processors, MWAIT can take some hints based on CPU
|
|
|
|
* capability.
|
2005-04-16 18:20:36 -04:00
|
|
|
*/
|
2008-01-30 07:30:56 -05:00
|
|
|
void mwait_idle_with_hints(unsigned long ax, unsigned long cx)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
2006-09-25 19:28:13 -04:00
|
|
|
if (!need_resched()) {
|
[PATCH] sched: resched and cpu_idle rework
Make some changes to the NEED_RESCHED and POLLING_NRFLAG to reduce
confusion, and make their semantics rigid. Improves efficiency of
resched_task and some cpu_idle routines.
* In resched_task:
- TIF_NEED_RESCHED is only cleared with the task's runqueue lock held,
and as we hold it during resched_task, then there is no need for an
atomic test and set there. The only other time this should be set is
when the task's quantum expires, in the timer interrupt - this is
protected against because the rq lock is irq-safe.
- If TIF_NEED_RESCHED is set, then we don't need to do anything. It
won't get unset until the task get's schedule()d off.
- If we are running on the same CPU as the task we resched, then set
TIF_NEED_RESCHED and no further action is required.
- If we are running on another CPU, and TIF_POLLING_NRFLAG is *not* set
after TIF_NEED_RESCHED has been set, then we need to send an IPI.
Using these rules, we are able to remove the test and set operation in
resched_task, and make clear the previously vague semantics of
POLLING_NRFLAG.
* In idle routines:
- Enter cpu_idle with preempt disabled. When the need_resched() condition
becomes true, explicitly call schedule(). This makes things a bit clearer
(IMO), but haven't updated all architectures yet.
- Many do a test and clear of TIF_NEED_RESCHED for some reason. According
to the resched_task rules, this isn't needed (and actually breaks the
assumption that TIF_NEED_RESCHED is only cleared with the runqueue lock
held). So remove that. Generally one less locked memory op when switching
to the idle thread.
- Many idle routines clear TIF_POLLING_NRFLAG, and only set it in the inner
most polling idle loops. The above resched_task semantics allow it to be
set until before the last time need_resched() is checked before going into
a halt requiring interrupt wakeup.
Many idle routines simply never enter such a halt, and so POLLING_NRFLAG
can be always left set, completely eliminating resched IPIs when rescheduling
the idle task.
POLLING_NRFLAG width can be increased, to reduce the chance of resched IPIs.
Signed-off-by: Nick Piggin <npiggin@suse.de>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: Con Kolivas <kernel@kolivas.org>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-11-09 00:39:04 -05:00
|
|
|
__monitor((void *)¤t_thread_info()->flags, 0, 0);
|
|
|
|
smp_mb();
|
2006-09-25 19:28:13 -04:00
|
|
|
if (!need_resched())
|
2008-01-30 07:30:56 -05:00
|
|
|
__mwait(ax, cx);
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-09-25 19:28:13 -04:00
|
|
|
/* Default MONITOR/MWAIT with no hints, used for default C1 state */
|
|
|
|
static void mwait_idle(void)
|
|
|
|
{
|
2006-12-06 20:14:13 -05:00
|
|
|
if (!need_resched()) {
|
|
|
|
__monitor((void *)¤t_thread_info()->flags, 0, 0);
|
|
|
|
smp_mb();
|
|
|
|
if (!need_resched())
|
|
|
|
__sti_mwait(0, 0);
|
|
|
|
else
|
|
|
|
local_irq_enable();
|
|
|
|
} else {
|
|
|
|
local_irq_enable();
|
|
|
|
}
|
2006-09-25 19:28:13 -04:00
|
|
|
}
|
|
|
|
|
2008-01-30 07:33:16 -05:00
|
|
|
|
2008-01-30 07:33:37 -05:00
|
|
|
static int __cpuinit mwait_usable(const struct cpuinfo_x86 *c)
|
2008-01-30 07:33:16 -05:00
|
|
|
{
|
|
|
|
if (force_mwait)
|
|
|
|
return 1;
|
|
|
|
/* Any C1 states supported? */
|
|
|
|
return c->cpuid_level >= 5 && ((cpuid_edx(5) >> 4) & 0xf) > 0;
|
|
|
|
}
|
|
|
|
|
[PATCH] x86_64: Change init sections for CPU hotplug support
This patch adds __cpuinit and __cpuinitdata sections that need to exist past
boot to support cpu hotplug.
Caveat: This is done *only* for EM64T CPU Hotplug support, on request from
Andi Kleen. Much of the generic hotplug code in kernel, and none of the other
archs that support CPU hotplug today, i386, ia64, ppc64, s390 and parisc dont
mark sections with __cpuinit, but only mark them as __devinit, and
__devinitdata.
If someone is motivated to change generic code, we need to make sure all
existing hotplug code does not break, on other arch's that dont use __cpuinit,
and __cpudevinit.
Signed-off-by: Ashok Raj <ashok.raj@intel.com>
Acked-by: Andi Kleen <ak@muc.de>
Acked-by: Zwane Mwaikambo <zwane@arm.linux.org.uk>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-25 17:54:58 -04:00
|
|
|
void __cpuinit select_idle_routine(const struct cpuinfo_x86 *c)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
2008-01-30 07:33:18 -05:00
|
|
|
static int selected;
|
|
|
|
|
|
|
|
if (selected)
|
|
|
|
return;
|
|
|
|
#ifdef CONFIG_X86_SMP
|
|
|
|
if (pm_idle == poll_idle && smp_num_siblings > 1) {
|
|
|
|
printk(KERN_WARNING "WARNING: polling idle and HT enabled,"
|
|
|
|
" performance may degrade.\n");
|
|
|
|
}
|
|
|
|
#endif
|
2008-01-30 07:33:16 -05:00
|
|
|
if (cpu_has(c, X86_FEATURE_MWAIT) && mwait_usable(c)) {
|
2005-04-16 18:20:36 -04:00
|
|
|
/*
|
|
|
|
* Skip, if setup has overridden idle.
|
|
|
|
* One CPU supports mwait => All CPUs supports mwait
|
|
|
|
*/
|
|
|
|
if (!pm_idle) {
|
2008-01-30 07:33:18 -05:00
|
|
|
printk(KERN_INFO "using mwait in idle threads.\n");
|
2005-04-16 18:20:36 -04:00
|
|
|
pm_idle = mwait_idle;
|
|
|
|
}
|
|
|
|
}
|
2008-01-30 07:33:18 -05:00
|
|
|
selected = 1;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2008-01-30 07:31:03 -05:00
|
|
|
static int __init idle_setup(char *str)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
2007-05-02 13:27:12 -04:00
|
|
|
if (!strcmp(str, "poll")) {
|
2005-04-16 18:20:36 -04:00
|
|
|
printk("using polling idle threads.\n");
|
|
|
|
pm_idle = poll_idle;
|
2007-05-02 13:27:12 -04:00
|
|
|
} else if (!strcmp(str, "mwait"))
|
|
|
|
force_mwait = 1;
|
|
|
|
else
|
|
|
|
return -1;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
boot_option_idle_override = 1;
|
2007-05-02 13:27:12 -04:00
|
|
|
return 0;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
2007-05-02 13:27:12 -04:00
|
|
|
early_param("idle", idle_setup);
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2008-01-30 07:31:03 -05:00
|
|
|
/* Prints also some state that isn't saved in the pt_regs */
|
2005-04-16 18:20:36 -04:00
|
|
|
void __show_regs(struct pt_regs * regs)
|
|
|
|
{
|
|
|
|
unsigned long cr0 = 0L, cr2 = 0L, cr3 = 0L, cr4 = 0L, fs, gs, shadowgs;
|
2007-07-21 11:10:42 -04:00
|
|
|
unsigned long d0, d1, d2, d3, d6, d7;
|
2008-01-30 07:31:03 -05:00
|
|
|
unsigned int fsindex, gsindex;
|
|
|
|
unsigned int ds, cs, es;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
printk("\n");
|
|
|
|
print_modules();
|
2005-09-12 12:49:24 -04:00
|
|
|
printk("Pid: %d, comm: %.20s %s %s %.*s\n",
|
|
|
|
current->pid, current->comm, print_tainted(),
|
2006-10-02 05:18:13 -04:00
|
|
|
init_utsname()->release,
|
|
|
|
(int)strcspn(init_utsname()->version, " "),
|
|
|
|
init_utsname()->version);
|
2008-01-30 07:30:56 -05:00
|
|
|
printk("RIP: %04lx:[<%016lx>] ", regs->cs & 0xffff, regs->ip);
|
2008-01-30 07:33:08 -05:00
|
|
|
printk_address(regs->ip, 1);
|
2008-01-30 07:30:56 -05:00
|
|
|
printk("RSP: %04lx:%016lx EFLAGS: %08lx\n", regs->ss, regs->sp,
|
|
|
|
regs->flags);
|
2005-04-16 18:20:36 -04:00
|
|
|
printk("RAX: %016lx RBX: %016lx RCX: %016lx\n",
|
2008-01-30 07:30:56 -05:00
|
|
|
regs->ax, regs->bx, regs->cx);
|
2005-04-16 18:20:36 -04:00
|
|
|
printk("RDX: %016lx RSI: %016lx RDI: %016lx\n",
|
2008-01-30 07:30:56 -05:00
|
|
|
regs->dx, regs->si, regs->di);
|
2005-04-16 18:20:36 -04:00
|
|
|
printk("RBP: %016lx R08: %016lx R09: %016lx\n",
|
2008-01-30 07:30:56 -05:00
|
|
|
regs->bp, regs->r8, regs->r9);
|
2005-04-16 18:20:36 -04:00
|
|
|
printk("R10: %016lx R11: %016lx R12: %016lx\n",
|
|
|
|
regs->r10, regs->r11, regs->r12);
|
|
|
|
printk("R13: %016lx R14: %016lx R15: %016lx\n",
|
|
|
|
regs->r13, regs->r14, regs->r15);
|
|
|
|
|
|
|
|
asm("movl %%ds,%0" : "=r" (ds));
|
|
|
|
asm("movl %%cs,%0" : "=r" (cs));
|
|
|
|
asm("movl %%es,%0" : "=r" (es));
|
|
|
|
asm("movl %%fs,%0" : "=r" (fsindex));
|
|
|
|
asm("movl %%gs,%0" : "=r" (gsindex));
|
|
|
|
|
|
|
|
rdmsrl(MSR_FS_BASE, fs);
|
|
|
|
rdmsrl(MSR_GS_BASE, gs);
|
|
|
|
rdmsrl(MSR_KERNEL_GS_BASE, shadowgs);
|
|
|
|
|
2007-07-22 05:12:29 -04:00
|
|
|
cr0 = read_cr0();
|
|
|
|
cr2 = read_cr2();
|
|
|
|
cr3 = read_cr3();
|
|
|
|
cr4 = read_cr4();
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
printk("FS: %016lx(%04x) GS:%016lx(%04x) knlGS:%016lx\n",
|
|
|
|
fs,fsindex,gs,gsindex,shadowgs);
|
|
|
|
printk("CS: %04x DS: %04x ES: %04x CR0: %016lx\n", cs, ds, es, cr0);
|
|
|
|
printk("CR2: %016lx CR3: %016lx CR4: %016lx\n", cr2, cr3, cr4);
|
2007-07-21 11:10:42 -04:00
|
|
|
|
|
|
|
get_debugreg(d0, 0);
|
|
|
|
get_debugreg(d1, 1);
|
|
|
|
get_debugreg(d2, 2);
|
|
|
|
printk("DR0: %016lx DR1: %016lx DR2: %016lx\n", d0, d1, d2);
|
|
|
|
get_debugreg(d3, 3);
|
|
|
|
get_debugreg(d6, 6);
|
|
|
|
get_debugreg(d7, 7);
|
|
|
|
printk("DR3: %016lx DR6: %016lx DR7: %016lx\n", d3, d6, d7);
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
void show_regs(struct pt_regs *regs)
|
|
|
|
{
|
2005-09-06 18:16:16 -04:00
|
|
|
printk("CPU %d:", smp_processor_id());
|
2005-04-16 18:20:36 -04:00
|
|
|
__show_regs(regs);
|
2008-01-30 07:33:07 -05:00
|
|
|
show_trace(NULL, regs, (void *)(regs + 1), regs->bp);
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Free current thread data structures etc..
|
|
|
|
*/
|
|
|
|
void exit_thread(void)
|
|
|
|
{
|
|
|
|
struct task_struct *me = current;
|
|
|
|
struct thread_struct *t = &me->thread;
|
[PATCH] x86_64 specific function return probes
The following patch adds the x86_64 architecture specific implementation
for function return probes.
Function return probes is a mechanism built on top of kprobes that allows
a caller to register a handler to be called when a given function exits.
For example, to instrument the return path of sys_mkdir:
static int sys_mkdir_exit(struct kretprobe_instance *i, struct pt_regs *regs)
{
printk("sys_mkdir exited\n");
return 0;
}
static struct kretprobe return_probe = {
.handler = sys_mkdir_exit,
};
<inside setup function>
return_probe.kp.addr = (kprobe_opcode_t *) kallsyms_lookup_name("sys_mkdir");
if (register_kretprobe(&return_probe)) {
printk(KERN_DEBUG "Unable to register return probe!\n");
/* do error path */
}
<inside cleanup function>
unregister_kretprobe(&return_probe);
The way this works is that:
* At system initialization time, kernel/kprobes.c installs a kprobe
on a function called kretprobe_trampoline() that is implemented in
the arch/x86_64/kernel/kprobes.c (More on this later)
* When a return probe is registered using register_kretprobe(),
kernel/kprobes.c will install a kprobe on the first instruction of the
targeted function with the pre handler set to arch_prepare_kretprobe()
which is implemented in arch/x86_64/kernel/kprobes.c.
* arch_prepare_kretprobe() will prepare a kretprobe instance that stores:
- nodes for hanging this instance in an empty or free list
- a pointer to the return probe
- the original return address
- a pointer to the stack address
With all this stowed away, arch_prepare_kretprobe() then sets the return
address for the targeted function to a special trampoline function called
kretprobe_trampoline() implemented in arch/x86_64/kernel/kprobes.c
* The kprobe completes as normal, with control passing back to the target
function that executes as normal, and eventually returns to our trampoline
function.
* Since a kprobe was installed on kretprobe_trampoline() during system
initialization, control passes back to kprobes via the architecture
specific function trampoline_probe_handler() which will lookup the
instance in an hlist maintained by kernel/kprobes.c, and then call
the handler function.
* When trampoline_probe_handler() is done, the kprobes infrastructure
single steps the original instruction (in this case just a top), and
then calls trampoline_post_handler(). trampoline_post_handler() then
looks up the instance again, puts the instance back on the free list,
and then makes a long jump back to the original return instruction.
So to recap, to instrument the exit path of a function this implementation
will cause four interruptions:
- A breakpoint at the very beginning of the function allowing us to
switch out the return address
- A single step interruption to execute the original instruction that
we replaced with the break instruction (normal kprobe flow)
- A breakpoint in the trampoline function where our instrumented function
returned to
- A single step interruption to execute the original instruction that
we replaced with the break instruction (normal kprobe flow)
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 03:09:23 -04:00
|
|
|
|
2008-01-30 07:31:03 -05:00
|
|
|
if (me->thread.io_bitmap_ptr) {
|
2005-04-16 18:20:36 -04:00
|
|
|
struct tss_struct *tss = &per_cpu(init_tss, get_cpu());
|
|
|
|
|
|
|
|
kfree(t->io_bitmap_ptr);
|
|
|
|
t->io_bitmap_ptr = NULL;
|
2006-09-26 04:52:28 -04:00
|
|
|
clear_thread_flag(TIF_IO_BITMAP);
|
2005-04-16 18:20:36 -04:00
|
|
|
/*
|
|
|
|
* Careful, clear this in the TSS too:
|
|
|
|
*/
|
|
|
|
memset(tss->io_bitmap, 0xff, t->io_bitmap_max);
|
|
|
|
t->io_bitmap_max = 0;
|
|
|
|
put_cpu();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void flush_thread(void)
|
|
|
|
{
|
|
|
|
struct task_struct *tsk = current;
|
|
|
|
|
2007-03-18 05:26:11 -04:00
|
|
|
if (test_tsk_thread_flag(tsk, TIF_ABI_PENDING)) {
|
|
|
|
clear_tsk_thread_flag(tsk, TIF_ABI_PENDING);
|
|
|
|
if (test_tsk_thread_flag(tsk, TIF_IA32)) {
|
|
|
|
clear_tsk_thread_flag(tsk, TIF_IA32);
|
|
|
|
} else {
|
|
|
|
set_tsk_thread_flag(tsk, TIF_IA32);
|
2006-06-26 07:57:19 -04:00
|
|
|
current_thread_info()->status |= TS_COMPAT;
|
2007-03-18 05:26:11 -04:00
|
|
|
}
|
2006-06-26 07:57:19 -04:00
|
|
|
}
|
2007-03-18 05:26:11 -04:00
|
|
|
clear_tsk_thread_flag(tsk, TIF_DEBUG);
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
tsk->thread.debugreg0 = 0;
|
|
|
|
tsk->thread.debugreg1 = 0;
|
|
|
|
tsk->thread.debugreg2 = 0;
|
|
|
|
tsk->thread.debugreg3 = 0;
|
|
|
|
tsk->thread.debugreg6 = 0;
|
|
|
|
tsk->thread.debugreg7 = 0;
|
2008-01-30 07:31:03 -05:00
|
|
|
memset(tsk->thread.tls_array, 0, sizeof(tsk->thread.tls_array));
|
2005-04-16 18:20:36 -04:00
|
|
|
/*
|
|
|
|
* Forget coprocessor state..
|
|
|
|
*/
|
|
|
|
clear_fpu(tsk);
|
|
|
|
clear_used_math();
|
|
|
|
}
|
|
|
|
|
|
|
|
void release_thread(struct task_struct *dead_task)
|
|
|
|
{
|
|
|
|
if (dead_task->mm) {
|
|
|
|
if (dead_task->mm->context.size) {
|
|
|
|
printk("WARNING: dead process %8s still has LDT? <%p/%d>\n",
|
|
|
|
dead_task->comm,
|
|
|
|
dead_task->mm->context.ldt,
|
|
|
|
dead_task->mm->context.size);
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void set_32bit_tls(struct task_struct *t, int tls, u32 addr)
|
|
|
|
{
|
2008-01-30 07:31:03 -05:00
|
|
|
struct user_desc ud = {
|
2005-04-16 18:20:36 -04:00
|
|
|
.base_addr = addr,
|
|
|
|
.limit = 0xfffff,
|
|
|
|
.seg_32bit = 1,
|
|
|
|
.limit_in_pages = 1,
|
|
|
|
.useable = 1,
|
|
|
|
};
|
2008-01-30 07:33:23 -05:00
|
|
|
struct desc_struct *desc = t->thread.tls_array;
|
2005-04-16 18:20:36 -04:00
|
|
|
desc += tls;
|
2008-01-30 07:31:13 -05:00
|
|
|
fill_ldt(desc, &ud);
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline u32 read_32bit_tls(struct task_struct *t, int tls)
|
|
|
|
{
|
2008-01-30 07:30:45 -05:00
|
|
|
return get_desc_base(&t->thread.tls_array[tls]);
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This gets called before we allocate a new thread and copy
|
|
|
|
* the current task into it.
|
|
|
|
*/
|
|
|
|
void prepare_to_copy(struct task_struct *tsk)
|
|
|
|
{
|
|
|
|
unlazy_fpu(tsk);
|
|
|
|
}
|
|
|
|
|
2008-01-30 07:30:56 -05:00
|
|
|
int copy_thread(int nr, unsigned long clone_flags, unsigned long sp,
|
2005-04-16 18:20:36 -04:00
|
|
|
unsigned long unused,
|
|
|
|
struct task_struct * p, struct pt_regs * regs)
|
|
|
|
{
|
|
|
|
int err;
|
|
|
|
struct pt_regs * childregs;
|
|
|
|
struct task_struct *me = current;
|
|
|
|
|
2005-11-05 11:25:54 -05:00
|
|
|
childregs = ((struct pt_regs *)
|
2006-01-12 04:05:39 -05:00
|
|
|
(THREAD_SIZE + task_stack_page(p))) - 1;
|
2005-04-16 18:20:36 -04:00
|
|
|
*childregs = *regs;
|
|
|
|
|
2008-01-30 07:30:56 -05:00
|
|
|
childregs->ax = 0;
|
|
|
|
childregs->sp = sp;
|
|
|
|
if (sp == ~0UL)
|
|
|
|
childregs->sp = (unsigned long)childregs;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2008-01-30 07:31:02 -05:00
|
|
|
p->thread.sp = (unsigned long) childregs;
|
|
|
|
p->thread.sp0 = (unsigned long) (childregs+1);
|
|
|
|
p->thread.usersp = me->thread.usersp;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-01-12 04:05:38 -05:00
|
|
|
set_tsk_thread_flag(p, TIF_FORK);
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
p->thread.fs = me->thread.fs;
|
|
|
|
p->thread.gs = me->thread.gs;
|
|
|
|
|
[PATCH] i386/x86_64 segment register access update
The new i386/x86_64 assemblers no longer accept instructions for moving
between a segment register and a 32bit memory location, i.e.,
movl (%eax),%ds
movl %ds,(%eax)
To generate instructions for moving between a segment register and a
16bit memory location without the 16bit operand size prefix, 0x66,
mov (%eax),%ds
mov %ds,(%eax)
should be used. It will work with both new and old assemblers. The
assembler starting from 2.16.90.0.1 will also support
movw (%eax),%ds
movw %ds,(%eax)
without the 0x66 prefix. I am enclosing patches for 2.4 and 2.6 kernels
here. The resulting kernel binaries should be unchanged as before, with
old and new assemblers, if gcc never generates memory access for
unsigned gsindex;
asm volatile("movl %%gs,%0" : "=g" (gsindex));
If gcc does generate memory access for the code above, the upper bits
in gsindex are undefined and the new assembler doesn't allow it.
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-05-01 11:58:48 -04:00
|
|
|
asm("mov %%gs,%0" : "=m" (p->thread.gsindex));
|
|
|
|
asm("mov %%fs,%0" : "=m" (p->thread.fsindex));
|
|
|
|
asm("mov %%es,%0" : "=m" (p->thread.es));
|
|
|
|
asm("mov %%ds,%0" : "=m" (p->thread.ds));
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-09-26 04:52:28 -04:00
|
|
|
if (unlikely(test_tsk_thread_flag(me, TIF_IO_BITMAP))) {
|
2005-04-16 18:20:36 -04:00
|
|
|
p->thread.io_bitmap_ptr = kmalloc(IO_BITMAP_BYTES, GFP_KERNEL);
|
|
|
|
if (!p->thread.io_bitmap_ptr) {
|
|
|
|
p->thread.io_bitmap_max = 0;
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
2005-11-05 11:25:54 -05:00
|
|
|
memcpy(p->thread.io_bitmap_ptr, me->thread.io_bitmap_ptr,
|
|
|
|
IO_BITMAP_BYTES);
|
2006-09-26 04:52:28 -04:00
|
|
|
set_tsk_thread_flag(p, TIF_IO_BITMAP);
|
2008-01-30 07:31:03 -05:00
|
|
|
}
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Set a new TLS for the child thread?
|
|
|
|
*/
|
|
|
|
if (clone_flags & CLONE_SETTLS) {
|
|
|
|
#ifdef CONFIG_IA32_EMULATION
|
|
|
|
if (test_thread_flag(TIF_IA32))
|
2008-01-30 07:30:46 -05:00
|
|
|
err = do_set_thread_area(p, -1,
|
2008-01-30 07:30:56 -05:00
|
|
|
(struct user_desc __user *)childregs->si, 0);
|
2005-04-16 18:20:36 -04:00
|
|
|
else
|
|
|
|
#endif
|
|
|
|
err = do_arch_prctl(p, ARCH_SET_FS, childregs->r8);
|
|
|
|
if (err)
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
err = 0;
|
|
|
|
out:
|
|
|
|
if (err && p->thread.io_bitmap_ptr) {
|
|
|
|
kfree(p->thread.io_bitmap_ptr);
|
|
|
|
p->thread.io_bitmap_max = 0;
|
|
|
|
}
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2008-02-20 23:18:40 -05:00
|
|
|
void
|
|
|
|
start_thread(struct pt_regs *regs, unsigned long new_ip, unsigned long new_sp)
|
|
|
|
{
|
|
|
|
asm volatile("movl %0, %%fs; movl %0, %%es; movl %0, %%ds" :: "r"(0));
|
|
|
|
load_gs_index(0);
|
|
|
|
regs->ip = new_ip;
|
|
|
|
regs->sp = new_sp;
|
|
|
|
write_pda(oldrsp, new_sp);
|
|
|
|
regs->cs = __USER_CS;
|
|
|
|
regs->ss = __USER_DS;
|
|
|
|
regs->flags = 0x200;
|
|
|
|
set_fs(USER_DS);
|
2008-03-10 18:28:05 -04:00
|
|
|
/*
|
|
|
|
* Free the old FP and other extended state
|
|
|
|
*/
|
|
|
|
free_thread_xstate(current);
|
2008-02-20 23:18:40 -05:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(start_thread);
|
|
|
|
|
2008-04-13 18:24:18 -04:00
|
|
|
static void hard_disable_TSC(void)
|
|
|
|
{
|
|
|
|
write_cr4(read_cr4() | X86_CR4_TSD);
|
|
|
|
}
|
|
|
|
|
|
|
|
void disable_TSC(void)
|
|
|
|
{
|
|
|
|
preempt_disable();
|
|
|
|
if (!test_and_set_thread_flag(TIF_NOTSC))
|
|
|
|
/*
|
|
|
|
* Must flip the CPU state synchronously with
|
|
|
|
* TIF_NOTSC in the current running context.
|
|
|
|
*/
|
|
|
|
hard_disable_TSC();
|
|
|
|
preempt_enable();
|
|
|
|
}
|
|
|
|
|
|
|
|
static void hard_enable_TSC(void)
|
|
|
|
{
|
|
|
|
write_cr4(read_cr4() & ~X86_CR4_TSD);
|
|
|
|
}
|
|
|
|
|
2008-04-23 07:20:56 -04:00
|
|
|
static void enable_TSC(void)
|
2008-04-13 18:24:18 -04:00
|
|
|
{
|
|
|
|
preempt_disable();
|
|
|
|
if (test_and_clear_thread_flag(TIF_NOTSC))
|
|
|
|
/*
|
|
|
|
* Must flip the CPU state synchronously with
|
|
|
|
* TIF_NOTSC in the current running context.
|
|
|
|
*/
|
|
|
|
hard_enable_TSC();
|
|
|
|
preempt_enable();
|
|
|
|
}
|
|
|
|
|
|
|
|
int get_tsc_mode(unsigned long adr)
|
|
|
|
{
|
|
|
|
unsigned int val;
|
|
|
|
|
|
|
|
if (test_thread_flag(TIF_NOTSC))
|
|
|
|
val = PR_TSC_SIGSEGV;
|
|
|
|
else
|
|
|
|
val = PR_TSC_ENABLE;
|
|
|
|
|
|
|
|
return put_user(val, (unsigned int __user *)adr);
|
|
|
|
}
|
|
|
|
|
|
|
|
int set_tsc_mode(unsigned int val)
|
|
|
|
{
|
|
|
|
if (val == PR_TSC_SIGSEGV)
|
|
|
|
disable_TSC();
|
|
|
|
else if (val == PR_TSC_ENABLE)
|
|
|
|
enable_TSC();
|
|
|
|
else
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
/*
|
|
|
|
* This special macro can be used to load a debugging register
|
|
|
|
*/
|
2008-01-30 07:31:03 -05:00
|
|
|
#define loaddebug(thread, r) set_debugreg(thread->debugreg ## r, r)
|
|
|
|
|
2006-09-26 04:52:28 -04:00
|
|
|
static inline void __switch_to_xtra(struct task_struct *prev_p,
|
2008-01-30 07:31:03 -05:00
|
|
|
struct task_struct *next_p,
|
|
|
|
struct tss_struct *tss)
|
2006-09-26 04:52:28 -04:00
|
|
|
{
|
|
|
|
struct thread_struct *prev, *next;
|
2008-01-30 07:31:09 -05:00
|
|
|
unsigned long debugctl;
|
2006-09-26 04:52:28 -04:00
|
|
|
|
|
|
|
prev = &prev_p->thread,
|
|
|
|
next = &next_p->thread;
|
|
|
|
|
2008-01-30 07:31:09 -05:00
|
|
|
debugctl = prev->debugctlmsr;
|
|
|
|
if (next->ds_area_msr != prev->ds_area_msr) {
|
|
|
|
/* we clear debugctl to make sure DS
|
|
|
|
* is not in use when we change it */
|
|
|
|
debugctl = 0;
|
2008-03-10 09:11:17 -04:00
|
|
|
update_debugctlmsr(0);
|
2008-01-30 07:31:09 -05:00
|
|
|
wrmsrl(MSR_IA32_DS_AREA, next->ds_area_msr);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (next->debugctlmsr != debugctl)
|
2008-03-10 09:11:17 -04:00
|
|
|
update_debugctlmsr(next->debugctlmsr);
|
2008-01-30 07:30:54 -05:00
|
|
|
|
2006-09-26 04:52:28 -04:00
|
|
|
if (test_tsk_thread_flag(next_p, TIF_DEBUG)) {
|
|
|
|
loaddebug(next, 0);
|
|
|
|
loaddebug(next, 1);
|
|
|
|
loaddebug(next, 2);
|
|
|
|
loaddebug(next, 3);
|
|
|
|
/* no 4 and 5 */
|
|
|
|
loaddebug(next, 6);
|
|
|
|
loaddebug(next, 7);
|
|
|
|
}
|
|
|
|
|
2008-04-13 18:24:18 -04:00
|
|
|
if (test_tsk_thread_flag(prev_p, TIF_NOTSC) ^
|
|
|
|
test_tsk_thread_flag(next_p, TIF_NOTSC)) {
|
|
|
|
/* prev and next are different */
|
|
|
|
if (test_tsk_thread_flag(next_p, TIF_NOTSC))
|
|
|
|
hard_disable_TSC();
|
|
|
|
else
|
|
|
|
hard_enable_TSC();
|
|
|
|
}
|
|
|
|
|
2006-09-26 04:52:28 -04:00
|
|
|
if (test_tsk_thread_flag(next_p, TIF_IO_BITMAP)) {
|
|
|
|
/*
|
|
|
|
* Copy the relevant range of the IO bitmap.
|
|
|
|
* Normally this is 128 bytes or less:
|
|
|
|
*/
|
|
|
|
memcpy(tss->io_bitmap, next->io_bitmap_ptr,
|
|
|
|
max(prev->io_bitmap_max, next->io_bitmap_max));
|
|
|
|
} else if (test_tsk_thread_flag(prev_p, TIF_IO_BITMAP)) {
|
|
|
|
/*
|
|
|
|
* Clear any possible leftover bits:
|
|
|
|
*/
|
|
|
|
memset(tss->io_bitmap, 0xff, prev->io_bitmap_max);
|
|
|
|
}
|
2008-01-30 07:31:09 -05:00
|
|
|
|
2008-02-26 03:40:27 -05:00
|
|
|
#ifdef X86_BTS
|
2008-01-30 07:31:09 -05:00
|
|
|
if (test_tsk_thread_flag(prev_p, TIF_BTS_TRACE_TS))
|
|
|
|
ptrace_bts_take_timestamp(prev_p, BTS_TASK_DEPARTS);
|
|
|
|
|
|
|
|
if (test_tsk_thread_flag(next_p, TIF_BTS_TRACE_TS))
|
|
|
|
ptrace_bts_take_timestamp(next_p, BTS_TASK_ARRIVES);
|
2008-02-26 03:40:27 -05:00
|
|
|
#endif
|
2006-09-26 04:52:28 -04:00
|
|
|
}
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
/*
|
|
|
|
* switch_to(x,y) should switch tasks from x to y.
|
|
|
|
*
|
2008-01-30 07:31:03 -05:00
|
|
|
* This could still be optimized:
|
2005-04-16 18:20:36 -04:00
|
|
|
* - fold all the options into a flag word and test it with a single test.
|
|
|
|
* - could test fs/gs bitsliced
|
2006-02-03 15:51:38 -05:00
|
|
|
*
|
|
|
|
* Kprobes not supported here. Set the probe on schedule instead.
|
2005-04-16 18:20:36 -04:00
|
|
|
*/
|
2007-10-16 04:27:49 -04:00
|
|
|
struct task_struct *
|
2005-11-05 11:25:54 -05:00
|
|
|
__switch_to(struct task_struct *prev_p, struct task_struct *next_p)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
|
|
|
struct thread_struct *prev = &prev_p->thread,
|
|
|
|
*next = &next_p->thread;
|
2008-01-30 07:31:03 -05:00
|
|
|
int cpu = smp_processor_id();
|
2005-04-16 18:20:36 -04:00
|
|
|
struct tss_struct *tss = &per_cpu(init_tss, cpu);
|
|
|
|
|
2006-09-26 04:52:36 -04:00
|
|
|
/* we're going to use this soon, after a few expensive things */
|
|
|
|
if (next_p->fpu_counter>5)
|
2008-03-10 18:28:04 -04:00
|
|
|
prefetch(next->xstate);
|
2006-09-26 04:52:36 -04:00
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
/*
|
|
|
|
* Reload esp0, LDT and the page table pointer:
|
|
|
|
*/
|
2008-01-30 07:31:31 -05:00
|
|
|
load_sp0(tss, next);
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Switch DS and ES.
|
|
|
|
* This won't pick up thread selector changes, but I guess that is ok.
|
|
|
|
*/
|
[PATCH] i386/x86_64 segment register access update
The new i386/x86_64 assemblers no longer accept instructions for moving
between a segment register and a 32bit memory location, i.e.,
movl (%eax),%ds
movl %ds,(%eax)
To generate instructions for moving between a segment register and a
16bit memory location without the 16bit operand size prefix, 0x66,
mov (%eax),%ds
mov %ds,(%eax)
should be used. It will work with both new and old assemblers. The
assembler starting from 2.16.90.0.1 will also support
movw (%eax),%ds
movw %ds,(%eax)
without the 0x66 prefix. I am enclosing patches for 2.4 and 2.6 kernels
here. The resulting kernel binaries should be unchanged as before, with
old and new assemblers, if gcc never generates memory access for
unsigned gsindex;
asm volatile("movl %%gs,%0" : "=g" (gsindex));
If gcc does generate memory access for the code above, the upper bits
in gsindex are undefined and the new assembler doesn't allow it.
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-05-01 11:58:48 -04:00
|
|
|
asm volatile("mov %%es,%0" : "=m" (prev->es));
|
2005-04-16 18:20:36 -04:00
|
|
|
if (unlikely(next->es | prev->es))
|
|
|
|
loadsegment(es, next->es);
|
|
|
|
|
[PATCH] i386/x86_64 segment register access update
The new i386/x86_64 assemblers no longer accept instructions for moving
between a segment register and a 32bit memory location, i.e.,
movl (%eax),%ds
movl %ds,(%eax)
To generate instructions for moving between a segment register and a
16bit memory location without the 16bit operand size prefix, 0x66,
mov (%eax),%ds
mov %ds,(%eax)
should be used. It will work with both new and old assemblers. The
assembler starting from 2.16.90.0.1 will also support
movw (%eax),%ds
movw %ds,(%eax)
without the 0x66 prefix. I am enclosing patches for 2.4 and 2.6 kernels
here. The resulting kernel binaries should be unchanged as before, with
old and new assemblers, if gcc never generates memory access for
unsigned gsindex;
asm volatile("movl %%gs,%0" : "=g" (gsindex));
If gcc does generate memory access for the code above, the upper bits
in gsindex are undefined and the new assembler doesn't allow it.
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-05-01 11:58:48 -04:00
|
|
|
asm volatile ("mov %%ds,%0" : "=m" (prev->ds));
|
2005-04-16 18:20:36 -04:00
|
|
|
if (unlikely(next->ds | prev->ds))
|
|
|
|
loadsegment(ds, next->ds);
|
|
|
|
|
|
|
|
load_TLS(next, cpu);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Switch FS and GS.
|
|
|
|
*/
|
|
|
|
{
|
|
|
|
unsigned fsindex;
|
|
|
|
asm volatile("movl %%fs,%0" : "=r" (fsindex));
|
|
|
|
/* segment register != 0 always requires a reload.
|
|
|
|
also reload when it has changed.
|
|
|
|
when prev process used 64bit base always reload
|
|
|
|
to avoid an information leak. */
|
|
|
|
if (unlikely(fsindex | next->fsindex | prev->fs)) {
|
|
|
|
loadsegment(fs, next->fsindex);
|
|
|
|
/* check if the user used a selector != 0
|
|
|
|
* if yes clear 64bit base, since overloaded base
|
|
|
|
* is always mapped to the Null selector
|
|
|
|
*/
|
|
|
|
if (fsindex)
|
|
|
|
prev->fs = 0;
|
|
|
|
}
|
|
|
|
/* when next process has a 64bit base use it */
|
|
|
|
if (next->fs)
|
|
|
|
wrmsrl(MSR_FS_BASE, next->fs);
|
|
|
|
prev->fsindex = fsindex;
|
|
|
|
}
|
|
|
|
{
|
|
|
|
unsigned gsindex;
|
|
|
|
asm volatile("movl %%gs,%0" : "=r" (gsindex));
|
|
|
|
if (unlikely(gsindex | next->gsindex | prev->gs)) {
|
|
|
|
load_gs_index(next->gsindex);
|
|
|
|
if (gsindex)
|
|
|
|
prev->gs = 0;
|
|
|
|
}
|
|
|
|
if (next->gs)
|
|
|
|
wrmsrl(MSR_KERNEL_GS_BASE, next->gs);
|
|
|
|
prev->gsindex = gsindex;
|
|
|
|
}
|
|
|
|
|
2006-10-05 12:47:22 -04:00
|
|
|
/* Must be after DS reload */
|
|
|
|
unlazy_fpu(prev_p);
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
/*
|
2006-03-25 10:29:25 -05:00
|
|
|
* Switch the PDA and FPU contexts.
|
2005-04-16 18:20:36 -04:00
|
|
|
*/
|
2008-01-30 07:31:02 -05:00
|
|
|
prev->usersp = read_pda(oldrsp);
|
|
|
|
write_pda(oldrsp, next->usersp);
|
2005-04-16 18:20:36 -04:00
|
|
|
write_pda(pcurrent, next_p);
|
2006-04-19 20:36:45 -04:00
|
|
|
|
2005-11-05 11:25:54 -05:00
|
|
|
write_pda(kernelstack,
|
2006-09-26 04:52:39 -04:00
|
|
|
(unsigned long)task_stack_page(next_p) + THREAD_SIZE - PDA_STACKOFFSET);
|
2006-09-26 04:52:38 -04:00
|
|
|
#ifdef CONFIG_CC_STACKPROTECTOR
|
|
|
|
write_pda(stack_canary, next_p->stack_canary);
|
|
|
|
/*
|
|
|
|
* Build time only check to make sure the stack_canary is at
|
|
|
|
* offset 40 in the pda; this is a gcc ABI requirement
|
|
|
|
*/
|
|
|
|
BUILD_BUG_ON(offsetof(struct x8664_pda, stack_canary) != 40);
|
|
|
|
#endif
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
/*
|
2006-09-26 04:52:28 -04:00
|
|
|
* Now maybe reload the debug registers and handle I/O bitmaps
|
2005-04-16 18:20:36 -04:00
|
|
|
*/
|
2008-01-30 07:31:09 -05:00
|
|
|
if (unlikely(task_thread_info(next_p)->flags & _TIF_WORK_CTXSW_NEXT ||
|
|
|
|
task_thread_info(prev_p)->flags & _TIF_WORK_CTXSW_PREV))
|
2006-09-26 04:52:28 -04:00
|
|
|
__switch_to_xtra(prev_p, next_p, tss);
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-09-26 04:52:36 -04:00
|
|
|
/* If the task has used fpu the last 5 timeslices, just do a full
|
|
|
|
* restore of the math state immediately to avoid the trap; the
|
|
|
|
* chances of needing FPU soon are obviously high now
|
|
|
|
*/
|
|
|
|
if (next_p->fpu_counter>5)
|
|
|
|
math_state_restore();
|
2005-04-16 18:20:36 -04:00
|
|
|
return prev_p;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* sys_execve() executes a new program.
|
|
|
|
*/
|
2008-01-30 07:31:03 -05:00
|
|
|
asmlinkage
|
2005-04-16 18:20:36 -04:00
|
|
|
long sys_execve(char __user *name, char __user * __user *argv,
|
2008-02-26 06:55:57 -05:00
|
|
|
char __user * __user *envp, struct pt_regs *regs)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
|
|
|
long error;
|
|
|
|
char * filename;
|
|
|
|
|
|
|
|
filename = getname(name);
|
|
|
|
error = PTR_ERR(filename);
|
2008-02-26 06:55:57 -05:00
|
|
|
if (IS_ERR(filename))
|
2005-04-16 18:20:36 -04:00
|
|
|
return error;
|
2008-02-26 06:55:57 -05:00
|
|
|
error = do_execve(filename, argv, envp, regs);
|
2005-04-16 18:20:36 -04:00
|
|
|
putname(filename);
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
void set_personality_64bit(void)
|
|
|
|
{
|
|
|
|
/* inherit personality from parent */
|
|
|
|
|
|
|
|
/* Make sure to be in 64bit mode */
|
2008-01-30 07:31:03 -05:00
|
|
|
clear_thread_flag(TIF_IA32);
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
/* TBD: overwrites user setup. Should have two bits.
|
|
|
|
But 64bit processes have always behaved this way,
|
|
|
|
so it's not too bad. The main problem is just that
|
2008-01-30 07:31:03 -05:00
|
|
|
32bit childs are affected again. */
|
2005-04-16 18:20:36 -04:00
|
|
|
current->personality &= ~READ_IMPLIES_EXEC;
|
|
|
|
}
|
|
|
|
|
|
|
|
asmlinkage long sys_fork(struct pt_regs *regs)
|
|
|
|
{
|
2008-01-30 07:30:56 -05:00
|
|
|
return do_fork(SIGCHLD, regs->sp, regs, 0, NULL, NULL);
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2005-11-05 11:25:54 -05:00
|
|
|
asmlinkage long
|
|
|
|
sys_clone(unsigned long clone_flags, unsigned long newsp,
|
|
|
|
void __user *parent_tid, void __user *child_tid, struct pt_regs *regs)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
|
|
|
if (!newsp)
|
2008-01-30 07:30:56 -05:00
|
|
|
newsp = regs->sp;
|
2005-04-16 18:20:36 -04:00
|
|
|
return do_fork(clone_flags, newsp, regs, 0, parent_tid, child_tid);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is trivial, and on the face of it looks like it
|
|
|
|
* could equally well be done in user mode.
|
|
|
|
*
|
|
|
|
* Not so, for quite unobvious reasons - register pressure.
|
|
|
|
* In user mode vfork() cannot have a stack frame, and if
|
|
|
|
* done by calling the "clone()" system call directly, you
|
|
|
|
* do not have enough call-clobbered registers to hold all
|
|
|
|
* the information you need.
|
|
|
|
*/
|
|
|
|
asmlinkage long sys_vfork(struct pt_regs *regs)
|
|
|
|
{
|
2008-01-30 07:30:56 -05:00
|
|
|
return do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, regs->sp, regs, 0,
|
2005-04-16 18:20:36 -04:00
|
|
|
NULL, NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned long get_wchan(struct task_struct *p)
|
|
|
|
{
|
|
|
|
unsigned long stack;
|
2008-01-30 07:30:56 -05:00
|
|
|
u64 fp,ip;
|
2005-04-16 18:20:36 -04:00
|
|
|
int count = 0;
|
|
|
|
|
|
|
|
if (!p || p == current || p->state==TASK_RUNNING)
|
|
|
|
return 0;
|
2006-01-12 04:05:39 -05:00
|
|
|
stack = (unsigned long)task_stack_page(p);
|
2008-01-30 07:31:02 -05:00
|
|
|
if (p->thread.sp < stack || p->thread.sp > stack+THREAD_SIZE)
|
2005-04-16 18:20:36 -04:00
|
|
|
return 0;
|
2008-01-30 07:31:02 -05:00
|
|
|
fp = *(u64 *)(p->thread.sp);
|
2005-04-16 18:20:36 -04:00
|
|
|
do {
|
2005-11-05 11:25:54 -05:00
|
|
|
if (fp < (unsigned long)stack ||
|
|
|
|
fp > (unsigned long)stack+THREAD_SIZE)
|
2005-04-16 18:20:36 -04:00
|
|
|
return 0;
|
2008-01-30 07:30:56 -05:00
|
|
|
ip = *(u64 *)(fp+8);
|
|
|
|
if (!in_sched_functions(ip))
|
|
|
|
return ip;
|
2005-04-16 18:20:36 -04:00
|
|
|
fp = *(u64 *)fp;
|
|
|
|
} while (count++ < 16);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
long do_arch_prctl(struct task_struct *task, int code, unsigned long addr)
|
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
int doit = task == current;
|
|
|
|
int cpu;
|
|
|
|
|
|
|
|
switch (code) {
|
|
|
|
case ARCH_SET_GS:
|
[PATCH] x86_64: TASK_SIZE fixes for compatibility mode processes
Appended patch will setup compatibility mode TASK_SIZE properly. This will
fix atleast three known bugs that can be encountered while running
compatibility mode apps.
a) A malicious 32bit app can have an elf section at 0xffffe000. During
exec of this app, we will have a memory leak as insert_vm_struct() is
not checking for return value in syscall32_setup_pages() and thus not
freeing the vma allocated for the vsyscall page. And instead of exec
failing (as it has addresses > TASK_SIZE), we were allowing it to
succeed previously.
b) With a 32bit app, hugetlb_get_unmapped_area/arch_get_unmapped_area
may return addresses beyond 32bits, ultimately causing corruption
because of wrap-around and resulting in SEGFAULT, instead of returning
ENOMEM.
c) 32bit app doing this below mmap will now fail.
mmap((void *)(0xFFFFE000UL), 0x10000UL, PROT_READ|PROT_WRITE,
MAP_FIXED|MAP_PRIVATE|MAP_ANON, 0, 0);
Signed-off-by: Zou Nan hai <nanhai.zou@intel.com>
Signed-off-by: Suresh Siddha <suresh.b.siddha@intel.com>
Cc: Andi Kleen <ak@muc.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-21 20:14:32 -04:00
|
|
|
if (addr >= TASK_SIZE_OF(task))
|
2005-04-16 18:20:36 -04:00
|
|
|
return -EPERM;
|
|
|
|
cpu = get_cpu();
|
|
|
|
/* handle small bases via the GDT because that's faster to
|
|
|
|
switch. */
|
|
|
|
if (addr <= 0xffffffff) {
|
|
|
|
set_32bit_tls(task, GS_TLS, addr);
|
|
|
|
if (doit) {
|
|
|
|
load_TLS(&task->thread, cpu);
|
|
|
|
load_gs_index(GS_TLS_SEL);
|
|
|
|
}
|
|
|
|
task->thread.gsindex = GS_TLS_SEL;
|
|
|
|
task->thread.gs = 0;
|
|
|
|
} else {
|
|
|
|
task->thread.gsindex = 0;
|
|
|
|
task->thread.gs = addr;
|
|
|
|
if (doit) {
|
2005-11-05 11:25:54 -05:00
|
|
|
load_gs_index(0);
|
|
|
|
ret = checking_wrmsrl(MSR_KERNEL_GS_BASE, addr);
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
put_cpu();
|
|
|
|
break;
|
|
|
|
case ARCH_SET_FS:
|
|
|
|
/* Not strictly needed for fs, but do it for symmetry
|
|
|
|
with gs */
|
[PATCH] x86_64: TASK_SIZE fixes for compatibility mode processes
Appended patch will setup compatibility mode TASK_SIZE properly. This will
fix atleast three known bugs that can be encountered while running
compatibility mode apps.
a) A malicious 32bit app can have an elf section at 0xffffe000. During
exec of this app, we will have a memory leak as insert_vm_struct() is
not checking for return value in syscall32_setup_pages() and thus not
freeing the vma allocated for the vsyscall page. And instead of exec
failing (as it has addresses > TASK_SIZE), we were allowing it to
succeed previously.
b) With a 32bit app, hugetlb_get_unmapped_area/arch_get_unmapped_area
may return addresses beyond 32bits, ultimately causing corruption
because of wrap-around and resulting in SEGFAULT, instead of returning
ENOMEM.
c) 32bit app doing this below mmap will now fail.
mmap((void *)(0xFFFFE000UL), 0x10000UL, PROT_READ|PROT_WRITE,
MAP_FIXED|MAP_PRIVATE|MAP_ANON, 0, 0);
Signed-off-by: Zou Nan hai <nanhai.zou@intel.com>
Signed-off-by: Suresh Siddha <suresh.b.siddha@intel.com>
Cc: Andi Kleen <ak@muc.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-21 20:14:32 -04:00
|
|
|
if (addr >= TASK_SIZE_OF(task))
|
2008-01-30 07:31:03 -05:00
|
|
|
return -EPERM;
|
2005-04-16 18:20:36 -04:00
|
|
|
cpu = get_cpu();
|
2008-01-30 07:31:03 -05:00
|
|
|
/* handle small bases via the GDT because that's faster to
|
2005-04-16 18:20:36 -04:00
|
|
|
switch. */
|
2008-01-30 07:31:03 -05:00
|
|
|
if (addr <= 0xffffffff) {
|
2005-04-16 18:20:36 -04:00
|
|
|
set_32bit_tls(task, FS_TLS, addr);
|
2008-01-30 07:31:03 -05:00
|
|
|
if (doit) {
|
|
|
|
load_TLS(&task->thread, cpu);
|
2005-11-05 11:25:54 -05:00
|
|
|
asm volatile("movl %0,%%fs" :: "r"(FS_TLS_SEL));
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
task->thread.fsindex = FS_TLS_SEL;
|
|
|
|
task->thread.fs = 0;
|
2008-01-30 07:31:03 -05:00
|
|
|
} else {
|
2005-04-16 18:20:36 -04:00
|
|
|
task->thread.fsindex = 0;
|
|
|
|
task->thread.fs = addr;
|
|
|
|
if (doit) {
|
|
|
|
/* set the selector to 0 to not confuse
|
|
|
|
__switch_to */
|
2005-11-05 11:25:54 -05:00
|
|
|
asm volatile("movl %0,%%fs" :: "r" (0));
|
|
|
|
ret = checking_wrmsrl(MSR_FS_BASE, addr);
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
put_cpu();
|
|
|
|
break;
|
2008-01-30 07:31:03 -05:00
|
|
|
case ARCH_GET_FS: {
|
|
|
|
unsigned long base;
|
2005-04-16 18:20:36 -04:00
|
|
|
if (task->thread.fsindex == FS_TLS_SEL)
|
|
|
|
base = read_32bit_tls(task, FS_TLS);
|
2005-11-05 11:25:54 -05:00
|
|
|
else if (doit)
|
2005-04-16 18:20:36 -04:00
|
|
|
rdmsrl(MSR_FS_BASE, base);
|
2005-11-05 11:25:54 -05:00
|
|
|
else
|
2005-04-16 18:20:36 -04:00
|
|
|
base = task->thread.fs;
|
2008-01-30 07:31:03 -05:00
|
|
|
ret = put_user(base, (unsigned long __user *)addr);
|
|
|
|
break;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
2008-01-30 07:31:03 -05:00
|
|
|
case ARCH_GET_GS: {
|
2005-04-16 18:20:36 -04:00
|
|
|
unsigned long base;
|
[PATCH] x86_64: Plug GS leak in arch_prctl()
In linux-2.6.16, we have noticed a problem where the gs base value
returned from an arch_prtcl(ARCH_GET_GS, ...) call will be incorrect if:
- the current/calling task has NOT set its own gs base yet to a
non-zero value,
- some other task that ran on the same processor previously set their
own gs base to a non-zero value.
In this situation, the ARCH_GET_GS code will read and return the
MSR_KERNEL_GS_BASE msr register.
However, since the __switch_to() code does NOT load/zero the
MSR_KERNEL_GS_BASE register when the task that is switched IN has a zero
next->gs value, the caller of arch_prctl(ARCH_GET_GS, ...) will get back
the value of some previous tasks's gs base value instead of 0.
Change the arch_prctl() ARCH_GET_GS code to only read and return
the MSR_KERNEL_GS_BASE msr register if the 'gs' register of the calling
task is non-zero.
Side note: Since in addition to using arch_prctl(ARCH_SET_GS, ...),
a task can also setup a gs base value by using modify_ldt() and write
an index value into 'gs' from user space, the patch below reads
'gs' instead of using thread.gs, since in the modify_ldt() case,
the thread.gs value will be 0, and incorrect value would be returned
(the task->thread.gs value).
When the user has not set its own gs base value and the 'gs'
register is zero, then the MSR_KERNEL_GS_BASE register will not be
read and a value of zero will be returned by reading and returning
'task->thread.gs'.
The first patch shown below is an attempt at implementing this
approach.
Signed-off-by: Andi Kleen <ak@suse.de>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-04-07 13:50:25 -04:00
|
|
|
unsigned gsindex;
|
2005-04-16 18:20:36 -04:00
|
|
|
if (task->thread.gsindex == GS_TLS_SEL)
|
|
|
|
base = read_32bit_tls(task, GS_TLS);
|
[PATCH] x86_64: Plug GS leak in arch_prctl()
In linux-2.6.16, we have noticed a problem where the gs base value
returned from an arch_prtcl(ARCH_GET_GS, ...) call will be incorrect if:
- the current/calling task has NOT set its own gs base yet to a
non-zero value,
- some other task that ran on the same processor previously set their
own gs base to a non-zero value.
In this situation, the ARCH_GET_GS code will read and return the
MSR_KERNEL_GS_BASE msr register.
However, since the __switch_to() code does NOT load/zero the
MSR_KERNEL_GS_BASE register when the task that is switched IN has a zero
next->gs value, the caller of arch_prctl(ARCH_GET_GS, ...) will get back
the value of some previous tasks's gs base value instead of 0.
Change the arch_prctl() ARCH_GET_GS code to only read and return
the MSR_KERNEL_GS_BASE msr register if the 'gs' register of the calling
task is non-zero.
Side note: Since in addition to using arch_prctl(ARCH_SET_GS, ...),
a task can also setup a gs base value by using modify_ldt() and write
an index value into 'gs' from user space, the patch below reads
'gs' instead of using thread.gs, since in the modify_ldt() case,
the thread.gs value will be 0, and incorrect value would be returned
(the task->thread.gs value).
When the user has not set its own gs base value and the 'gs'
register is zero, then the MSR_KERNEL_GS_BASE register will not be
read and a value of zero will be returned by reading and returning
'task->thread.gs'.
The first patch shown below is an attempt at implementing this
approach.
Signed-off-by: Andi Kleen <ak@suse.de>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-04-07 13:50:25 -04:00
|
|
|
else if (doit) {
|
2008-01-30 07:31:03 -05:00
|
|
|
asm("movl %%gs,%0" : "=r" (gsindex));
|
[PATCH] x86_64: Plug GS leak in arch_prctl()
In linux-2.6.16, we have noticed a problem where the gs base value
returned from an arch_prtcl(ARCH_GET_GS, ...) call will be incorrect if:
- the current/calling task has NOT set its own gs base yet to a
non-zero value,
- some other task that ran on the same processor previously set their
own gs base to a non-zero value.
In this situation, the ARCH_GET_GS code will read and return the
MSR_KERNEL_GS_BASE msr register.
However, since the __switch_to() code does NOT load/zero the
MSR_KERNEL_GS_BASE register when the task that is switched IN has a zero
next->gs value, the caller of arch_prctl(ARCH_GET_GS, ...) will get back
the value of some previous tasks's gs base value instead of 0.
Change the arch_prctl() ARCH_GET_GS code to only read and return
the MSR_KERNEL_GS_BASE msr register if the 'gs' register of the calling
task is non-zero.
Side note: Since in addition to using arch_prctl(ARCH_SET_GS, ...),
a task can also setup a gs base value by using modify_ldt() and write
an index value into 'gs' from user space, the patch below reads
'gs' instead of using thread.gs, since in the modify_ldt() case,
the thread.gs value will be 0, and incorrect value would be returned
(the task->thread.gs value).
When the user has not set its own gs base value and the 'gs'
register is zero, then the MSR_KERNEL_GS_BASE register will not be
read and a value of zero will be returned by reading and returning
'task->thread.gs'.
The first patch shown below is an attempt at implementing this
approach.
Signed-off-by: Andi Kleen <ak@suse.de>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-04-07 13:50:25 -04:00
|
|
|
if (gsindex)
|
|
|
|
rdmsrl(MSR_KERNEL_GS_BASE, base);
|
|
|
|
else
|
|
|
|
base = task->thread.gs;
|
|
|
|
}
|
2005-11-05 11:25:54 -05:00
|
|
|
else
|
2005-04-16 18:20:36 -04:00
|
|
|
base = task->thread.gs;
|
2008-01-30 07:31:03 -05:00
|
|
|
ret = put_user(base, (unsigned long __user *)addr);
|
2005-04-16 18:20:36 -04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
default:
|
|
|
|
ret = -EINVAL;
|
|
|
|
break;
|
2008-01-30 07:31:03 -05:00
|
|
|
}
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2008-01-30 07:31:03 -05:00
|
|
|
return ret;
|
|
|
|
}
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
long sys_arch_prctl(int code, unsigned long addr)
|
|
|
|
{
|
|
|
|
return do_arch_prctl(current, code, addr);
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned long arch_align_stack(unsigned long sp)
|
|
|
|
{
|
2006-09-26 04:52:28 -04:00
|
|
|
if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
|
2005-04-16 18:20:36 -04:00
|
|
|
sp -= get_random_int() % 8192;
|
|
|
|
return sp & ~0xf;
|
|
|
|
}
|
2008-01-30 07:30:40 -05:00
|
|
|
|
|
|
|
unsigned long arch_randomize_brk(struct mm_struct *mm)
|
|
|
|
{
|
|
|
|
unsigned long range_end = mm->brk + 0x02000000;
|
|
|
|
return randomize_range(mm->brk, range_end, 0) ? : mm->brk;
|
|
|
|
}
|