2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* Copyright (C) 1995 Linus Torvalds
|
|
|
|
*
|
|
|
|
* Pentium III FXSR, SSE support
|
|
|
|
* Gareth Hughes <gareth@valinux.com>, May 2000
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This file handles the architecture-dependent parts of process handling..
|
|
|
|
*/
|
|
|
|
|
2009-02-11 00:31:00 -07:00
|
|
|
#include <linux/stackprotector.h>
|
2005-06-25 15:54:50 -06:00
|
|
|
#include <linux/cpu.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/sched.h>
|
|
|
|
#include <linux/fs.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/elfcore.h>
|
|
|
|
#include <linux/smp.h>
|
|
|
|
#include <linux/stddef.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/vmalloc.h>
|
|
|
|
#include <linux/user.h>
|
|
|
|
#include <linux/interrupt.h>
|
|
|
|
#include <linux/delay.h>
|
|
|
|
#include <linux/reboot.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/mc146818rtc.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/kallsyms.h>
|
|
|
|
#include <linux/ptrace.h>
|
2006-09-26 02:52:28 -06:00
|
|
|
#include <linux/personality.h>
|
2007-02-16 02:28:07 -07:00
|
|
|
#include <linux/tick.h>
|
2007-05-02 11:27:16 -06:00
|
|
|
#include <linux/percpu.h>
|
2008-04-13 16:24:18 -06:00
|
|
|
#include <linux/prctl.h>
|
2008-12-05 19:40:00 -07:00
|
|
|
#include <linux/ftrace.h>
|
2009-01-04 03:48:56 -07:00
|
|
|
#include <linux/uaccess.h>
|
|
|
|
#include <linux/io.h>
|
|
|
|
#include <linux/kdebug.h>
|
2011-04-01 17:34:59 -06:00
|
|
|
#include <linux/cpuidle.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
#include <asm/pgtable.h>
|
|
|
|
#include <asm/system.h>
|
|
|
|
#include <asm/ldt.h>
|
|
|
|
#include <asm/processor.h>
|
|
|
|
#include <asm/i387.h>
|
|
|
|
#include <asm/desc.h>
|
|
|
|
#ifdef CONFIG_MATH_EMULATION
|
|
|
|
#include <asm/math_emu.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include <linux/err.h>
|
|
|
|
|
2005-06-25 15:54:50 -06:00
|
|
|
#include <asm/tlbflush.h>
|
|
|
|
#include <asm/cpu.h>
|
2008-09-23 20:40:02 -06:00
|
|
|
#include <asm/idle.h>
|
2008-07-21 10:04:13 -06:00
|
|
|
#include <asm/syscalls.h>
|
2009-06-01 12:14:55 -06:00
|
|
|
#include <asm/debugreg.h>
|
2011-09-30 13:06:22 -06:00
|
|
|
#include <asm/nmi.h>
|
2005-06-25 15:54:50 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
asmlinkage void ret_from_fork(void) __asm__("ret_from_fork");
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return saved PC of a blocked thread.
|
|
|
|
*/
|
|
|
|
unsigned long thread_saved_pc(struct task_struct *tsk)
|
|
|
|
{
|
2008-01-30 05:31:02 -07:00
|
|
|
return ((unsigned long *)tsk->thread.sp)[3];
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2008-09-03 07:30:23 -06:00
|
|
|
#ifndef CONFIG_SMP
|
|
|
|
static inline void play_dead(void)
|
|
|
|
{
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-04-16 16:20:36 -06: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)
|
|
|
|
*/
|
2005-06-25 15:54:50 -06:00
|
|
|
void cpu_idle(void)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2005-11-08 22:39:01 -07:00
|
|
|
int cpu = smp_processor_id();
|
2005-06-25 15:54:50 -06:00
|
|
|
|
2009-02-11 00:31:00 -07:00
|
|
|
/*
|
|
|
|
* If we're the non-boot CPU, nothing set the stack canary up
|
|
|
|
* for us. CPU0 already has it initialized but no harm in
|
|
|
|
* doing it again. This is a good place for updating it, as
|
|
|
|
* we wont ever return from this function (so the invalid
|
|
|
|
* canaries already on the stack wont ever trigger).
|
|
|
|
*/
|
|
|
|
boot_init_stack_canary();
|
|
|
|
|
2006-06-26 05:59:11 -06:00
|
|
|
current_thread_info()->status |= TS_POLLING;
|
[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-08 22:39:04 -07:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/* endless idle loop with no priority at all */
|
|
|
|
while (1) {
|
2011-11-17 10:48:14 -07:00
|
|
|
tick_nohz_idle_enter();
|
|
|
|
rcu_idle_enter();
|
2005-04-16 16:20:36 -06:00
|
|
|
while (!need_resched()) {
|
|
|
|
|
2007-05-12 12:15:24 -06:00
|
|
|
check_pgt_cache();
|
2005-04-16 16:20:36 -06:00
|
|
|
rmb();
|
|
|
|
|
2005-06-25 15:54:50 -06:00
|
|
|
if (cpu_is_offline(cpu))
|
|
|
|
play_dead();
|
|
|
|
|
2011-09-30 13:06:22 -06:00
|
|
|
local_touch_nmi();
|
2008-04-25 09:39:01 -06:00
|
|
|
local_irq_disable();
|
2008-05-12 13:20:42 -06:00
|
|
|
/* Don't trace irqs off for idle */
|
|
|
|
stop_critical_timings();
|
2011-04-01 17:34:59 -06:00
|
|
|
if (cpuidle_idle_call())
|
|
|
|
pm_idle();
|
2008-05-12 13:20:42 -06:00
|
|
|
start_critical_timings();
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2011-11-17 10:48:14 -07:00
|
|
|
rcu_idle_exit();
|
|
|
|
tick_nohz_idle_exit();
|
2005-11-08 22:39:01 -07:00
|
|
|
preempt_enable_no_resched();
|
2005-04-16 16:20:36 -06:00
|
|
|
schedule();
|
2005-11-08 22:39:01 -07:00
|
|
|
preempt_disable();
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-04-03 07:40:48 -06:00
|
|
|
void __show_regs(struct pt_regs *regs, int all)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
unsigned long cr0 = 0L, cr2 = 0L, cr3 = 0L, cr4 = 0L;
|
2007-07-21 09:10:42 -06:00
|
|
|
unsigned long d0, d1, d2, d3, d6, d7;
|
2008-01-30 05:30:56 -07:00
|
|
|
unsigned long sp;
|
2007-10-19 12:35:03 -06:00
|
|
|
unsigned short ss, gs;
|
|
|
|
|
|
|
|
if (user_mode_vm(regs)) {
|
2008-01-30 05:30:56 -07:00
|
|
|
sp = regs->sp;
|
|
|
|
ss = regs->ss & 0xffff;
|
2009-02-09 06:17:40 -07:00
|
|
|
gs = get_user_gs(regs);
|
2007-10-19 12:35:03 -06:00
|
|
|
} else {
|
2009-10-12 15:09:07 -06:00
|
|
|
sp = kernel_stack_pointer(regs);
|
2007-10-19 12:35:03 -06:00
|
|
|
savesegment(ss, ss);
|
|
|
|
savesegment(gs, gs);
|
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2009-12-08 01:29:42 -07:00
|
|
|
show_regs_common();
|
2007-10-19 12:35:03 -06:00
|
|
|
|
2009-12-28 01:26:59 -07:00
|
|
|
printk(KERN_DEFAULT "EIP: %04x:[<%08lx>] EFLAGS: %08lx CPU: %d\n",
|
2008-02-08 13:09:56 -07:00
|
|
|
(u16)regs->cs, regs->ip, regs->flags,
|
2007-10-19 12:35:03 -06:00
|
|
|
smp_processor_id());
|
2008-01-30 05:30:56 -07:00
|
|
|
print_symbol("EIP is at %s\n", regs->ip);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2009-12-28 01:26:59 -07:00
|
|
|
printk(KERN_DEFAULT "EAX: %08lx EBX: %08lx ECX: %08lx EDX: %08lx\n",
|
2008-01-30 05:30:56 -07:00
|
|
|
regs->ax, regs->bx, regs->cx, regs->dx);
|
2009-12-28 01:26:59 -07:00
|
|
|
printk(KERN_DEFAULT "ESI: %08lx EDI: %08lx EBP: %08lx ESP: %08lx\n",
|
2008-01-30 05:30:56 -07:00
|
|
|
regs->si, regs->di, regs->bp, sp);
|
2009-12-28 01:26:59 -07:00
|
|
|
printk(KERN_DEFAULT " DS: %04x ES: %04x FS: %04x GS: %04x SS: %04x\n",
|
2008-02-08 13:09:56 -07:00
|
|
|
(u16)regs->ds, (u16)regs->es, (u16)regs->fs, gs, ss);
|
2007-10-19 12:35:03 -06:00
|
|
|
|
|
|
|
if (!all)
|
|
|
|
return;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2005-09-03 16:56:36 -06:00
|
|
|
cr0 = read_cr0();
|
|
|
|
cr2 = read_cr2();
|
|
|
|
cr3 = read_cr3();
|
2006-01-06 01:11:50 -07:00
|
|
|
cr4 = read_cr4_safe();
|
2009-12-28 01:26:59 -07:00
|
|
|
printk(KERN_DEFAULT "CR0: %08lx CR2: %08lx CR3: %08lx CR4: %08lx\n",
|
2007-10-19 12:35:03 -06:00
|
|
|
cr0, cr2, cr3, cr4);
|
2007-07-21 09:10:42 -06:00
|
|
|
|
|
|
|
get_debugreg(d0, 0);
|
|
|
|
get_debugreg(d1, 1);
|
|
|
|
get_debugreg(d2, 2);
|
|
|
|
get_debugreg(d3, 3);
|
2009-12-28 01:26:59 -07:00
|
|
|
printk(KERN_DEFAULT "DR0: %08lx DR1: %08lx DR2: %08lx DR3: %08lx\n",
|
2007-07-21 09:10:42 -06:00
|
|
|
d0, d1, d2, d3);
|
2007-10-19 12:35:03 -06:00
|
|
|
|
2007-07-21 09:10:42 -06:00
|
|
|
get_debugreg(d6, 6);
|
|
|
|
get_debugreg(d7, 7);
|
2009-12-28 01:26:59 -07:00
|
|
|
printk(KERN_DEFAULT "DR6: %08lx DR7: %08lx\n",
|
2007-10-19 12:35:03 -06:00
|
|
|
d6, d7);
|
|
|
|
}
|
2007-07-21 09:10:42 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
void release_thread(struct task_struct *dead_task)
|
|
|
|
{
|
2006-01-06 01:11:59 -07:00
|
|
|
BUG_ON(dead_task->mm);
|
2005-04-16 16:20:36 -06:00
|
|
|
release_vm86_irqs(dead_task);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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);
|
|
|
|
}
|
|
|
|
|
2009-04-02 17:56:59 -06:00
|
|
|
int copy_thread(unsigned long clone_flags, unsigned long sp,
|
2005-04-16 16:20:36 -06:00
|
|
|
unsigned long unused,
|
2009-01-04 03:48:56 -07:00
|
|
|
struct task_struct *p, struct pt_regs *regs)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2009-01-04 03:48:56 -07:00
|
|
|
struct pt_regs *childregs;
|
2005-04-16 16:20:36 -06:00
|
|
|
struct task_struct *tsk;
|
|
|
|
int err;
|
|
|
|
|
2006-01-12 02:05:41 -07:00
|
|
|
childregs = task_pt_regs(p);
|
2005-05-05 17:15:03 -06:00
|
|
|
*childregs = *regs;
|
2008-01-30 05:30:56 -07:00
|
|
|
childregs->ax = 0;
|
|
|
|
childregs->sp = sp;
|
2005-05-05 17:15:03 -06:00
|
|
|
|
2008-01-30 05:31:02 -07:00
|
|
|
p->thread.sp = (unsigned long) childregs;
|
|
|
|
p->thread.sp0 = (unsigned long) (childregs+1);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2008-01-30 05:31:02 -07:00
|
|
|
p->thread.ip = (unsigned long) ret_from_fork;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2009-02-09 06:17:40 -07:00
|
|
|
task_user_gs(p) = get_user_gs(regs);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2012-02-20 11:24:09 -07:00
|
|
|
p->fpu_counter = 0;
|
2009-06-01 12:14:55 -06:00
|
|
|
p->thread.io_bitmap_ptr = NULL;
|
2005-04-16 16:20:36 -06:00
|
|
|
tsk = current;
|
2009-06-01 12:14:55 -06:00
|
|
|
err = -ENOMEM;
|
2009-09-09 11:22:48 -06:00
|
|
|
|
|
|
|
memset(p->thread.ptrace_bps, 0, sizeof(p->thread.ptrace_bps));
|
2009-06-01 12:14:55 -06:00
|
|
|
|
2006-07-09 19:12:39 -06:00
|
|
|
if (unlikely(test_tsk_thread_flag(tsk, TIF_IO_BITMAP))) {
|
2006-10-01 00:27:21 -06:00
|
|
|
p->thread.io_bitmap_ptr = kmemdup(tsk->thread.io_bitmap_ptr,
|
|
|
|
IO_BITMAP_BYTES, GFP_KERNEL);
|
2005-04-16 16:20:36 -06:00
|
|
|
if (!p->thread.io_bitmap_ptr) {
|
|
|
|
p->thread.io_bitmap_max = 0;
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
2006-07-09 19:12:39 -06:00
|
|
|
set_tsk_thread_flag(p, TIF_IO_BITMAP);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2008-01-30 05:30:46 -07:00
|
|
|
err = 0;
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* Set a new TLS for the child thread?
|
|
|
|
*/
|
2008-01-30 05:30:46 -07:00
|
|
|
if (clone_flags & CLONE_SETTLS)
|
|
|
|
err = do_set_thread_area(p, -1,
|
2008-01-30 05:30:56 -07:00
|
|
|
(struct user_desc __user *)childregs->si, 0);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
if (err && p->thread.io_bitmap_ptr) {
|
|
|
|
kfree(p->thread.io_bitmap_ptr);
|
|
|
|
p->thread.io_bitmap_max = 0;
|
|
|
|
}
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2008-02-20 21:18:40 -07:00
|
|
|
void
|
|
|
|
start_thread(struct pt_regs *regs, unsigned long new_ip, unsigned long new_sp)
|
|
|
|
{
|
2009-02-09 06:17:40 -07:00
|
|
|
set_user_gs(regs, 0);
|
2008-02-20 21:18:40 -07:00
|
|
|
regs->fs = 0;
|
|
|
|
regs->ds = __USER_DS;
|
|
|
|
regs->es = __USER_DS;
|
|
|
|
regs->ss = __USER_DS;
|
|
|
|
regs->cs = __USER_CS;
|
|
|
|
regs->ip = new_ip;
|
|
|
|
regs->sp = new_sp;
|
2008-03-10 16:28:05 -06:00
|
|
|
/*
|
|
|
|
* Free the old FP and other extended state
|
|
|
|
*/
|
|
|
|
free_thread_xstate(current);
|
2008-02-20 21:18:40 -07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(start_thread);
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
2011-04-28 03:02:08 -06:00
|
|
|
* switch_to(x,y) should switch tasks from x to y.
|
2005-04-16 16:20:36 -06:00
|
|
|
*
|
|
|
|
* We fsave/fwait so that an exception goes off at the right time
|
|
|
|
* (as a call from the fsave or fwait in effect) rather than to
|
|
|
|
* the wrong process. Lazy FP saving no longer makes any sense
|
|
|
|
* with modern CPU's, and this simplifies a lot of things (SMP
|
|
|
|
* and UP become the same).
|
|
|
|
*
|
|
|
|
* NOTE! We used to use the x86 hardware context switching. The
|
|
|
|
* reason for not using it any more becomes apparent when you
|
|
|
|
* try to recover gracefully from saved state that is no longer
|
|
|
|
* valid (stale segment register values in particular). With the
|
|
|
|
* hardware task-switch, there is no way to fix up bad state in
|
|
|
|
* a reasonable manner.
|
|
|
|
*
|
|
|
|
* The fact that Intel documents the hardware task-switching to
|
|
|
|
* be slow is a fairly red herring - this code is not noticeably
|
|
|
|
* faster. However, there _is_ some room for improvement here,
|
|
|
|
* so the performance issues may eventually be a valid point.
|
|
|
|
* More important, however, is the fact that this allows us much
|
|
|
|
* more flexibility.
|
|
|
|
*
|
2008-01-30 05:30:56 -07:00
|
|
|
* The return value (in %ax) will be the "prev" task after
|
2005-04-16 16:20:36 -06:00
|
|
|
* the task-switch, and shows up in ret_from_fork in entry.S,
|
|
|
|
* for example.
|
|
|
|
*/
|
2008-12-05 19:40:00 -07:00
|
|
|
__notrace_funcgraph struct task_struct *
|
|
|
|
__switch_to(struct task_struct *prev_p, struct task_struct *next_p)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
struct thread_struct *prev = &prev_p->thread,
|
|
|
|
*next = &next_p->thread;
|
|
|
|
int cpu = smp_processor_id();
|
|
|
|
struct tss_struct *tss = &per_cpu(init_tss, cpu);
|
i387: re-introduce FPU state preloading at context switch time
After all the FPU state cleanups and finally finding the problem that
caused all our FPU save/restore problems, this re-introduces the
preloading of FPU state that was removed in commit b3b0870ef3ff ("i387:
do not preload FPU state at task switch time").
However, instead of simply reverting the removal, this reimplements
preloading with several fixes, most notably
- properly abstracted as a true FPU state switch, rather than as
open-coded save and restore with various hacks.
In particular, implementing it as a proper FPU state switch allows us
to optimize the CR0.TS flag accesses: there is no reason to set the
TS bit only to then almost immediately clear it again. CR0 accesses
are quite slow and expensive, don't flip the bit back and forth for
no good reason.
- Make sure that the same model works for both x86-32 and x86-64, so
that there are no gratuitous differences between the two due to the
way they save and restore segment state differently due to
architectural differences that really don't matter to the FPU state.
- Avoid exposing the "preload" state to the context switch routines,
and in particular allow the concept of lazy state restore: if nothing
else has used the FPU in the meantime, and the process is still on
the same CPU, we can avoid restoring state from memory entirely, just
re-expose the state that is still in the FPU unit.
That optimized lazy restore isn't actually implemented here, but the
infrastructure is set up for it. Of course, older CPU's that use
'fnsave' to save the state cannot take advantage of this, since the
state saving also trashes the state.
In other words, there is now an actual _design_ to the FPU state saving,
rather than just random historical baggage. Hopefully it's easier to
follow as a result.
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2012-02-18 13:56:35 -07:00
|
|
|
fpu_switch_t fpu;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/* never put a printk in __switch_to... printk() calls wake_up*() indirectly */
|
|
|
|
|
i387: support lazy restore of FPU state
This makes us recognize when we try to restore FPU state that matches
what we already have in the FPU on this CPU, and avoids the restore
entirely if so.
To do this, we add two new data fields:
- a percpu 'fpu_owner_task' variable that gets written any time we
update the "has_fpu" field, and thus acts as a kind of back-pointer
to the task that owns the CPU. The exception is when we save the FPU
state as part of a context switch - if the save can keep the FPU
state around, we leave the 'fpu_owner_task' variable pointing at the
task whose FP state still remains on the CPU.
- a per-thread 'last_cpu' field, that indicates which CPU that thread
used its FPU on last. We update this on every context switch
(writing an invalid CPU number if the last context switch didn't
leave the FPU in a lazily usable state), so we know that *that*
thread has done nothing else with the FPU since.
These two fields together can be used when next switching back to the
task to see if the CPU still matches: if 'fpu_owner_task' matches the
task we are switching to, we know that no other task (or kernel FPU
usage) touched the FPU on this CPU in the meantime, and if the current
CPU number matches the 'last_cpu' field, we know that this thread did no
other FP work on any other CPU, so the FPU state on the CPU must match
what was saved on last context switch.
In that case, we can avoid the 'f[x]rstor' entirely, and just clear the
CR0.TS bit.
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2012-02-19 14:27:00 -07:00
|
|
|
fpu = switch_fpu_prepare(prev_p, next_p, cpu);
|
2006-12-06 18:14:01 -07:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
2005-09-03 16:56:39 -06:00
|
|
|
* Reload esp0.
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
2008-01-30 05:31:02 -07:00
|
|
|
load_sp0(tss, next);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
2007-02-13 05:26:20 -07:00
|
|
|
* Save away %gs. No need to save %fs, as it was saved on the
|
[PATCH] i386: Use %gs as the PDA base-segment in the kernel
This patch is the meat of the PDA change. This patch makes several related
changes:
1: Most significantly, %gs is now used in the kernel. This means that on
entry, the old value of %gs is saved away, and it is reloaded with
__KERNEL_PDA.
2: entry.S constructs the stack in the shape of struct pt_regs, and this
is passed around the kernel so that the process's saved register
state can be accessed.
Unfortunately struct pt_regs doesn't currently have space for %gs
(or %fs). This patch extends pt_regs to add space for gs (no space
is allocated for %fs, since it won't be used, and it would just
complicate the code in entry.S to work around the space).
3: Because %gs is now saved on the stack like %ds, %es and the integer
registers, there are a number of places where it no longer needs to
be handled specially; namely context switch, and saving/restoring the
register state in a signal context.
4: And since kernel threads run in kernel space and call normal kernel
code, they need to be created with their %gs == __KERNEL_PDA.
Signed-off-by: Jeremy Fitzhardinge <jeremy@xensource.com>
Signed-off-by: Andi Kleen <ak@suse.de>
Cc: Chuck Ebbert <76306.1226@compuserve.com>
Cc: Zachary Amsden <zach@vmware.com>
Cc: Jan Beulich <jbeulich@novell.com>
Cc: Andi Kleen <ak@suse.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
2006-12-06 18:14:02 -07:00
|
|
|
* stack on entry. No need to save %es and %ds, as those are
|
|
|
|
* always kernel segments while inside the kernel. Doing this
|
|
|
|
* before setting the new TLS descriptors avoids the situation
|
|
|
|
* where we temporarily have non-reloadable segments in %fs
|
|
|
|
* and %gs. This could be an issue if the NMI handler ever
|
|
|
|
* used %fs or %gs (it does not today), or if the kernel is
|
|
|
|
* running inside of a hypervisor layer.
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
2009-02-09 06:17:40 -07:00
|
|
|
lazy_save_gs(prev->gs);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
2005-09-03 16:56:39 -06:00
|
|
|
* Load the per-thread Thread-Local Storage descriptor.
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
2005-09-03 16:56:39 -06:00
|
|
|
load_TLS(next, cpu);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-02-13 05:26:21 -07:00
|
|
|
/*
|
|
|
|
* Restore IOPL if needed. In normal use, the flags restore
|
|
|
|
* in the switch assembly will handle this. But if the kernel
|
|
|
|
* is running virtualized at a non-zero CPL, the popf will
|
|
|
|
* not restore flags, so it must be done in a separate step.
|
|
|
|
*/
|
|
|
|
if (get_kernel_rpl() && unlikely(prev->iopl != next->iopl))
|
|
|
|
set_iopl_mask(next->iopl);
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
2006-07-09 19:12:39 -06:00
|
|
|
* Now maybe handle debug registers and/or IO bitmaps
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
2007-07-16 00:41:33 -06:00
|
|
|
if (unlikely(task_thread_info(prev_p)->flags & _TIF_WORK_CTXSW_PREV ||
|
|
|
|
task_thread_info(next_p)->flags & _TIF_WORK_CTXSW_NEXT))
|
|
|
|
__switch_to_xtra(prev_p, next_p, tss);
|
2005-06-27 15:36:36 -06:00
|
|
|
|
2007-02-13 05:26:21 -07:00
|
|
|
/*
|
|
|
|
* Leave lazy mode, flushing any hypercalls made here.
|
|
|
|
* This must be done before restoring TLS segments so
|
|
|
|
* the GDT and LDT are properly updated, and must be
|
|
|
|
* done before math_state_restore, so the TS bit is up
|
|
|
|
* to date.
|
|
|
|
*/
|
2009-02-18 12:18:57 -07:00
|
|
|
arch_end_context_switch(next_p);
|
2007-02-13 05:26:21 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Restore %gs if needed (which is common)
|
|
|
|
*/
|
|
|
|
if (prev->gs | next->gs)
|
2009-02-09 06:17:40 -07:00
|
|
|
lazy_load_gs(next->gs);
|
2007-02-13 05:26:21 -07:00
|
|
|
|
i387: re-introduce FPU state preloading at context switch time
After all the FPU state cleanups and finally finding the problem that
caused all our FPU save/restore problems, this re-introduces the
preloading of FPU state that was removed in commit b3b0870ef3ff ("i387:
do not preload FPU state at task switch time").
However, instead of simply reverting the removal, this reimplements
preloading with several fixes, most notably
- properly abstracted as a true FPU state switch, rather than as
open-coded save and restore with various hacks.
In particular, implementing it as a proper FPU state switch allows us
to optimize the CR0.TS flag accesses: there is no reason to set the
TS bit only to then almost immediately clear it again. CR0 accesses
are quite slow and expensive, don't flip the bit back and forth for
no good reason.
- Make sure that the same model works for both x86-32 and x86-64, so
that there are no gratuitous differences between the two due to the
way they save and restore segment state differently due to
architectural differences that really don't matter to the FPU state.
- Avoid exposing the "preload" state to the context switch routines,
and in particular allow the concept of lazy state restore: if nothing
else has used the FPU in the meantime, and the process is still on
the same CPU, we can avoid restoring state from memory entirely, just
re-expose the state that is still in the FPU unit.
That optimized lazy restore isn't actually implemented here, but the
infrastructure is set up for it. Of course, older CPU's that use
'fnsave' to save the state cannot take advantage of this, since the
state saving also trashes the state.
In other words, there is now an actual _design_ to the FPU state saving,
rather than just random historical baggage. Hopefully it's easier to
follow as a result.
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2012-02-18 13:56:35 -07:00
|
|
|
switch_fpu_finish(next_p, fpu);
|
|
|
|
|
percpu: add optimized generic percpu accessors
It is an optimization and a cleanup, and adds the following new
generic percpu methods:
percpu_read()
percpu_write()
percpu_add()
percpu_sub()
percpu_and()
percpu_or()
percpu_xor()
and implements support for them on x86. (other architectures will fall
back to a default implementation)
The advantage is that for example to read a local percpu variable,
instead of this sequence:
return __get_cpu_var(var);
ffffffff8102ca2b: 48 8b 14 fd 80 09 74 mov -0x7e8bf680(,%rdi,8),%rdx
ffffffff8102ca32: 81
ffffffff8102ca33: 48 c7 c0 d8 59 00 00 mov $0x59d8,%rax
ffffffff8102ca3a: 48 8b 04 10 mov (%rax,%rdx,1),%rax
We can get a single instruction by using the optimized variants:
return percpu_read(var);
ffffffff8102ca3f: 65 48 8b 05 91 8f fd mov %gs:0x7efd8f91(%rip),%rax
I also cleaned up the x86-specific APIs and made the x86 code use
these new generic percpu primitives.
tj: * fixed generic percpu_sub() definition as Roel Kluin pointed out
* added percpu_and() for completeness's sake
* made generic percpu ops atomic against preemption
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Tejun Heo <tj@kernel.org>
2009-01-15 06:15:53 -07:00
|
|
|
percpu_write(current_task, next_p);
|
2007-02-13 05:26:21 -07:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
return prev_p;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define top_esp (THREAD_SIZE - sizeof(unsigned long))
|
|
|
|
#define top_ebp (THREAD_SIZE - 2*sizeof(unsigned long))
|
|
|
|
|
|
|
|
unsigned long get_wchan(struct task_struct *p)
|
|
|
|
{
|
2008-01-30 05:30:56 -07:00
|
|
|
unsigned long bp, sp, ip;
|
2005-04-16 16:20:36 -06:00
|
|
|
unsigned long stack_page;
|
|
|
|
int count = 0;
|
|
|
|
if (!p || p == current || p->state == TASK_RUNNING)
|
|
|
|
return 0;
|
2006-01-12 02:05:41 -07:00
|
|
|
stack_page = (unsigned long)task_stack_page(p);
|
2008-01-30 05:31:02 -07:00
|
|
|
sp = p->thread.sp;
|
2008-01-30 05:30:56 -07:00
|
|
|
if (!stack_page || sp < stack_page || sp > top_esp+stack_page)
|
2005-04-16 16:20:36 -06:00
|
|
|
return 0;
|
2008-01-30 05:30:56 -07:00
|
|
|
/* include/asm-i386/system.h:switch_to() pushes bp last. */
|
|
|
|
bp = *(unsigned long *) sp;
|
2005-04-16 16:20:36 -06:00
|
|
|
do {
|
2008-01-30 05:30:56 -07:00
|
|
|
if (bp < stack_page || bp > top_ebp+stack_page)
|
2005-04-16 16:20:36 -06:00
|
|
|
return 0;
|
2008-01-30 05:30:56 -07:00
|
|
|
ip = *(unsigned long *) (bp+4);
|
|
|
|
if (!in_sched_functions(ip))
|
|
|
|
return ip;
|
|
|
|
bp = *(unsigned long *) bp;
|
2005-04-16 16:20:36 -06:00
|
|
|
} while (count++ < 16);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|