[PATCH] i386 rework local apic timer calibration
[deliverable/linux.git] / arch / i386 / kernel / process.c
CommitLineData
1da177e4
LT
1/*
2 * linux/arch/i386/kernel/process.c
3 *
4 * Copyright (C) 1995 Linus Torvalds
5 *
6 * Pentium III FXSR, SSE support
7 * Gareth Hughes <gareth@valinux.com>, May 2000
8 */
9
10/*
11 * This file handles the architecture-dependent parts of process handling..
12 */
13
14#include <stdarg.h>
15
f3705136 16#include <linux/cpu.h>
1da177e4
LT
17#include <linux/errno.h>
18#include <linux/sched.h>
19#include <linux/fs.h>
20#include <linux/kernel.h>
21#include <linux/mm.h>
22#include <linux/elfcore.h>
23#include <linux/smp.h>
24#include <linux/smp_lock.h>
25#include <linux/stddef.h>
26#include <linux/slab.h>
27#include <linux/vmalloc.h>
28#include <linux/user.h>
29#include <linux/a.out.h>
30#include <linux/interrupt.h>
1da177e4
LT
31#include <linux/utsname.h>
32#include <linux/delay.h>
33#include <linux/reboot.h>
34#include <linux/init.h>
35#include <linux/mc146818rtc.h>
36#include <linux/module.h>
37#include <linux/kallsyms.h>
38#include <linux/ptrace.h>
39#include <linux/random.h>
c16b63e0 40#include <linux/personality.h>
1da177e4
LT
41
42#include <asm/uaccess.h>
43#include <asm/pgtable.h>
44#include <asm/system.h>
45#include <asm/io.h>
46#include <asm/ldt.h>
47#include <asm/processor.h>
48#include <asm/i387.h>
1da177e4 49#include <asm/desc.h>
64ca9004 50#include <asm/vm86.h>
2ff2d3d7 51#include <asm/idle.h>
1da177e4
LT
52#ifdef CONFIG_MATH_EMULATION
53#include <asm/math_emu.h>
54#endif
55
1da177e4
LT
56#include <linux/err.h>
57
f3705136
ZM
58#include <asm/tlbflush.h>
59#include <asm/cpu.h>
f95d47ca 60#include <asm/pda.h>
f3705136 61
1da177e4
LT
62asmlinkage void ret_from_fork(void) __asm__("ret_from_fork");
63
64static int hlt_counter;
65
66unsigned long boot_option_idle_override = 0;
67EXPORT_SYMBOL(boot_option_idle_override);
68
69/*
70 * Return saved PC of a blocked thread.
71 */
72unsigned long thread_saved_pc(struct task_struct *tsk)
73{
74 return ((unsigned long *)tsk->thread.esp)[3];
75}
76
77/*
78 * Powermanagement idle function, if any..
79 */
80void (*pm_idle)(void);
129f6946 81EXPORT_SYMBOL(pm_idle);
1da177e4
LT
82static DEFINE_PER_CPU(unsigned int, cpu_idle_state);
83
2ff2d3d7
SE
84static ATOMIC_NOTIFIER_HEAD(idle_notifier);
85
86void idle_notifier_register(struct notifier_block *n)
87{
88 atomic_notifier_chain_register(&idle_notifier, n);
89}
90
91void idle_notifier_unregister(struct notifier_block *n)
92{
93 atomic_notifier_chain_unregister(&idle_notifier, n);
94}
95
96static DEFINE_PER_CPU(volatile unsigned long, idle_state);
97
98void enter_idle(void)
99{
100 /* needs to be atomic w.r.t. interrupts, not against other CPUs */
101 __set_bit(0, &__get_cpu_var(idle_state));
102 atomic_notifier_call_chain(&idle_notifier, IDLE_START, NULL);
103}
104
105static void __exit_idle(void)
106{
107 /* needs to be atomic w.r.t. interrupts, not against other CPUs */
108 if (__test_and_clear_bit(0, &__get_cpu_var(idle_state)) == 0)
109 return;
110 atomic_notifier_call_chain(&idle_notifier, IDLE_END, NULL);
111}
112
113void exit_idle(void)
114{
115 if (current->pid)
116 return;
117 __exit_idle();
118}
119
1da177e4
LT
120void disable_hlt(void)
121{
122 hlt_counter++;
123}
124
125EXPORT_SYMBOL(disable_hlt);
126
127void enable_hlt(void)
128{
129 hlt_counter--;
130}
131
132EXPORT_SYMBOL(enable_hlt);
133
134/*
135 * We use this if we don't have any better
136 * idle routine..
137 */
138void default_idle(void)
139{
140 if (!hlt_counter && boot_cpu_data.hlt_works_ok) {
495ab9c0 141 current_thread_info()->status &= ~TS_POLLING;
0888f06a
IM
142 /*
143 * TS_POLLING-cleared state must be visible before we
144 * test NEED_RESCHED:
145 */
146 smp_mb();
147
72690a21
AK
148 local_irq_disable();
149 if (!need_resched())
150 safe_halt(); /* enables interrupts racelessly */
151 else
152 local_irq_enable();
495ab9c0 153 current_thread_info()->status |= TS_POLLING;
1da177e4 154 } else {
72690a21
AK
155 /* loop is done by the caller */
156 cpu_relax();
1da177e4
LT
157 }
158}
129f6946
AD
159#ifdef CONFIG_APM_MODULE
160EXPORT_SYMBOL(default_idle);
161#endif
1da177e4
LT
162
163/*
164 * On SMP it's slightly faster (but much more power-consuming!)
165 * to poll the ->work.need_resched flag instead of waiting for the
166 * cross-CPU IPI to arrive. Use this option with caution.
167 */
168static void poll_idle (void)
169{
2ff2d3d7 170 local_irq_enable();
72690a21 171 cpu_relax();
1da177e4
LT
172}
173
f3705136
ZM
174#ifdef CONFIG_HOTPLUG_CPU
175#include <asm/nmi.h>
176/* We don't actually take CPU down, just spin without interrupts. */
177static inline void play_dead(void)
178{
e1367daf
LS
179 /* This must be done before dead CPU ack */
180 cpu_exit_clear();
181 wbinvd();
182 mb();
f3705136
ZM
183 /* Ack it */
184 __get_cpu_var(cpu_state) = CPU_DEAD;
185
e1367daf
LS
186 /*
187 * With physical CPU hotplug, we should halt the cpu
188 */
f3705136 189 local_irq_disable();
e1367daf 190 while (1)
f2ab4461 191 halt();
f3705136
ZM
192}
193#else
194static inline void play_dead(void)
195{
196 BUG();
197}
198#endif /* CONFIG_HOTPLUG_CPU */
199
1da177e4
LT
200/*
201 * The idle thread. There's no useful work to be
202 * done, so just try to conserve power and have a
203 * low exit latency (ie sit in a loop waiting for
204 * somebody to say that they'd like to reschedule)
205 */
f3705136 206void cpu_idle(void)
1da177e4 207{
5bfb5d69 208 int cpu = smp_processor_id();
f3705136 209
495ab9c0 210 current_thread_info()->status |= TS_POLLING;
64c7c8f8 211
1da177e4
LT
212 /* endless idle loop with no priority at all */
213 while (1) {
214 while (!need_resched()) {
215 void (*idle)(void);
216
217 if (__get_cpu_var(cpu_idle_state))
218 __get_cpu_var(cpu_idle_state) = 0;
219
220 rmb();
221 idle = pm_idle;
222
223 if (!idle)
224 idle = default_idle;
225
f3705136
ZM
226 if (cpu_is_offline(cpu))
227 play_dead();
228
1da177e4 229 __get_cpu_var(irq_stat).idle_timestamp = jiffies;
2ff2d3d7
SE
230
231 /*
232 * Idle routines should keep interrupts disabled
233 * from here on, until they go to idle.
234 * Otherwise, idle callbacks can misfire.
235 */
236 local_irq_disable();
237 enter_idle();
1da177e4 238 idle();
2ff2d3d7 239 __exit_idle();
1da177e4 240 }
5bfb5d69 241 preempt_enable_no_resched();
1da177e4 242 schedule();
5bfb5d69 243 preempt_disable();
1da177e4
LT
244 }
245}
246
247void cpu_idle_wait(void)
248{
249 unsigned int cpu, this_cpu = get_cpu();
dc1829a4 250 cpumask_t map, tmp = current->cpus_allowed;
1da177e4
LT
251
252 set_cpus_allowed(current, cpumask_of_cpu(this_cpu));
253 put_cpu();
254
255 cpus_clear(map);
256 for_each_online_cpu(cpu) {
257 per_cpu(cpu_idle_state, cpu) = 1;
258 cpu_set(cpu, map);
259 }
260
261 __get_cpu_var(cpu_idle_state) = 0;
262
263 wmb();
264 do {
265 ssleep(1);
266 for_each_online_cpu(cpu) {
267 if (cpu_isset(cpu, map) && !per_cpu(cpu_idle_state, cpu))
268 cpu_clear(cpu, map);
269 }
270 cpus_and(map, map, cpu_online_map);
271 } while (!cpus_empty(map));
dc1829a4
IM
272
273 set_cpus_allowed(current, tmp);
1da177e4
LT
274}
275EXPORT_SYMBOL_GPL(cpu_idle_wait);
276
277/*
278 * This uses new MONITOR/MWAIT instructions on P4 processors with PNI,
279 * which can obviate IPI to trigger checking of need_resched.
280 * We execute MONITOR against need_resched and enter optimized wait state
281 * through MWAIT. Whenever someone changes need_resched, we would be woken
282 * up from MWAIT (without an IPI).
991528d7
VP
283 *
284 * New with Core Duo processors, MWAIT can take some hints based on CPU
285 * capability.
1da177e4 286 */
991528d7 287void mwait_idle_with_hints(unsigned long eax, unsigned long ecx)
1da177e4 288{
991528d7 289 if (!need_resched()) {
64c7c8f8
NP
290 __monitor((void *)&current_thread_info()->flags, 0, 0);
291 smp_mb();
991528d7 292 if (!need_resched())
2ff2d3d7
SE
293 __sti_mwait(eax, ecx);
294 else
295 local_irq_enable();
296 } else {
297 local_irq_enable();
1da177e4
LT
298 }
299}
300
991528d7
VP
301/* Default MONITOR/MWAIT with no hints, used for default C1 state */
302static void mwait_idle(void)
303{
304 local_irq_enable();
72690a21 305 mwait_idle_with_hints(0, 0);
991528d7
VP
306}
307
0bb3184d 308void __devinit select_idle_routine(const struct cpuinfo_x86 *c)
1da177e4
LT
309{
310 if (cpu_has(c, X86_FEATURE_MWAIT)) {
311 printk("monitor/mwait feature present.\n");
312 /*
313 * Skip, if setup has overridden idle.
314 * One CPU supports mwait => All CPUs supports mwait
315 */
316 if (!pm_idle) {
317 printk("using mwait in idle threads.\n");
318 pm_idle = mwait_idle;
319 }
320 }
321}
322
323static int __init idle_setup (char *str)
324{
325 if (!strncmp(str, "poll", 4)) {
326 printk("using polling idle threads.\n");
327 pm_idle = poll_idle;
328#ifdef CONFIG_X86_SMP
329 if (smp_num_siblings > 1)
330 printk("WARNING: polling idle and HT enabled, performance may degrade.\n");
331#endif
332 } else if (!strncmp(str, "halt", 4)) {
333 printk("using halt in idle threads.\n");
334 pm_idle = default_idle;
335 }
336
337 boot_option_idle_override = 1;
338 return 1;
339}
340
341__setup("idle=", idle_setup);
342
343void show_regs(struct pt_regs * regs)
344{
345 unsigned long cr0 = 0L, cr2 = 0L, cr3 = 0L, cr4 = 0L;
346
347 printk("\n");
348 printk("Pid: %d, comm: %20s\n", current->pid, current->comm);
349 printk("EIP: %04x:[<%08lx>] CPU: %d\n",0xffff & regs->xcs,regs->eip, smp_processor_id());
350 print_symbol("EIP is at %s\n", regs->eip);
351
db753bdf 352 if (user_mode_vm(regs))
1da177e4 353 printk(" ESP: %04x:%08lx",0xffff & regs->xss,regs->esp);
b53e8f68 354 printk(" EFLAGS: %08lx %s (%s %.*s)\n",
96b644bd
SH
355 regs->eflags, print_tainted(), init_utsname()->release,
356 (int)strcspn(init_utsname()->version, " "),
357 init_utsname()->version);
1da177e4
LT
358 printk("EAX: %08lx EBX: %08lx ECX: %08lx EDX: %08lx\n",
359 regs->eax,regs->ebx,regs->ecx,regs->edx);
360 printk("ESI: %08lx EDI: %08lx EBP: %08lx",
361 regs->esi, regs->edi, regs->ebp);
464d1a78
JF
362 printk(" DS: %04x ES: %04x FS: %04x\n",
363 0xffff & regs->xds,0xffff & regs->xes, 0xffff & regs->xfs);
1da177e4 364
4bb0d3ec
ZA
365 cr0 = read_cr0();
366 cr2 = read_cr2();
367 cr3 = read_cr3();
ff6e8c0d 368 cr4 = read_cr4_safe();
1da177e4 369 printk("CR0: %08lx CR2: %08lx CR3: %08lx CR4: %08lx\n", cr0, cr2, cr3, cr4);
176a2718 370 show_trace(NULL, regs, &regs->esp);
1da177e4
LT
371}
372
373/*
374 * This gets run with %ebx containing the
375 * function to call, and %edx containing
376 * the "args".
377 */
378extern void kernel_thread_helper(void);
1da177e4
LT
379
380/*
381 * Create a kernel thread
382 */
383int kernel_thread(int (*fn)(void *), void * arg, unsigned long flags)
384{
385 struct pt_regs regs;
386
387 memset(&regs, 0, sizeof(regs));
388
389 regs.ebx = (unsigned long) fn;
390 regs.edx = (unsigned long) arg;
391
392 regs.xds = __USER_DS;
393 regs.xes = __USER_DS;
464d1a78 394 regs.xfs = __KERNEL_PDA;
1da177e4
LT
395 regs.orig_eax = -1;
396 regs.eip = (unsigned long) kernel_thread_helper;
78be3706 397 regs.xcs = __KERNEL_CS | get_kernel_rpl();
1da177e4
LT
398 regs.eflags = X86_EFLAGS_IF | X86_EFLAGS_SF | X86_EFLAGS_PF | 0x2;
399
400 /* Ok, create the new process.. */
8cf2c519 401 return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, &regs, 0, NULL, NULL);
1da177e4 402}
129f6946 403EXPORT_SYMBOL(kernel_thread);
1da177e4
LT
404
405/*
406 * Free current thread data structures etc..
407 */
408void exit_thread(void)
409{
1da177e4 410 /* The process may have allocated an io port bitmap... nuke it. */
b3cf2576
SE
411 if (unlikely(test_thread_flag(TIF_IO_BITMAP))) {
412 struct task_struct *tsk = current;
413 struct thread_struct *t = &tsk->thread;
1da177e4
LT
414 int cpu = get_cpu();
415 struct tss_struct *tss = &per_cpu(init_tss, cpu);
416
417 kfree(t->io_bitmap_ptr);
418 t->io_bitmap_ptr = NULL;
b3cf2576 419 clear_thread_flag(TIF_IO_BITMAP);
1da177e4
LT
420 /*
421 * Careful, clear this in the TSS too:
422 */
423 memset(tss->io_bitmap, 0xff, tss->io_bitmap_max);
424 t->io_bitmap_max = 0;
425 tss->io_bitmap_owner = NULL;
426 tss->io_bitmap_max = 0;
427 tss->io_bitmap_base = INVALID_IO_BITMAP_OFFSET;
428 put_cpu();
429 }
430}
431
432void flush_thread(void)
433{
434 struct task_struct *tsk = current;
435
436 memset(tsk->thread.debugreg, 0, sizeof(unsigned long)*8);
437 memset(tsk->thread.tls_array, 0, sizeof(tsk->thread.tls_array));
b3cf2576 438 clear_tsk_thread_flag(tsk, TIF_DEBUG);
1da177e4
LT
439 /*
440 * Forget coprocessor state..
441 */
442 clear_fpu(tsk);
443 clear_used_math();
444}
445
446void release_thread(struct task_struct *dead_task)
447{
2684927c 448 BUG_ON(dead_task->mm);
1da177e4
LT
449 release_vm86_irqs(dead_task);
450}
451
452/*
453 * This gets called before we allocate a new thread and copy
454 * the current task into it.
455 */
456void prepare_to_copy(struct task_struct *tsk)
457{
458 unlazy_fpu(tsk);
459}
460
461int copy_thread(int nr, unsigned long clone_flags, unsigned long esp,
462 unsigned long unused,
463 struct task_struct * p, struct pt_regs * regs)
464{
465 struct pt_regs * childregs;
466 struct task_struct *tsk;
467 int err;
468
07b047fc 469 childregs = task_pt_regs(p);
f48d9663
AN
470 *childregs = *regs;
471 childregs->eax = 0;
472 childregs->esp = esp;
473
474 p->thread.esp = (unsigned long) childregs;
475 p->thread.esp0 = (unsigned long) (childregs+1);
1da177e4
LT
476
477 p->thread.eip = (unsigned long) ret_from_fork;
478
464d1a78 479 savesegment(gs,p->thread.gs);
1da177e4
LT
480
481 tsk = current;
b3cf2576 482 if (unlikely(test_tsk_thread_flag(tsk, TIF_IO_BITMAP))) {
52978be6
AD
483 p->thread.io_bitmap_ptr = kmemdup(tsk->thread.io_bitmap_ptr,
484 IO_BITMAP_BYTES, GFP_KERNEL);
1da177e4
LT
485 if (!p->thread.io_bitmap_ptr) {
486 p->thread.io_bitmap_max = 0;
487 return -ENOMEM;
488 }
b3cf2576 489 set_tsk_thread_flag(p, TIF_IO_BITMAP);
1da177e4
LT
490 }
491
492 /*
493 * Set a new TLS for the child thread?
494 */
495 if (clone_flags & CLONE_SETTLS) {
496 struct desc_struct *desc;
497 struct user_desc info;
498 int idx;
499
500 err = -EFAULT;
501 if (copy_from_user(&info, (void __user *)childregs->esi, sizeof(info)))
502 goto out;
503 err = -EINVAL;
504 if (LDT_empty(&info))
505 goto out;
506
507 idx = info.entry_number;
508 if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
509 goto out;
510
511 desc = p->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
512 desc->a = LDT_entry_a(&info);
513 desc->b = LDT_entry_b(&info);
514 }
515
516 err = 0;
517 out:
518 if (err && p->thread.io_bitmap_ptr) {
519 kfree(p->thread.io_bitmap_ptr);
520 p->thread.io_bitmap_max = 0;
521 }
522 return err;
523}
524
525/*
526 * fill in the user structure for a core dump..
527 */
528void dump_thread(struct pt_regs * regs, struct user * dump)
529{
530 int i;
531
532/* changed the size calculations - should hopefully work better. lbt */
533 dump->magic = CMAGIC;
534 dump->start_code = 0;
535 dump->start_stack = regs->esp & ~(PAGE_SIZE - 1);
536 dump->u_tsize = ((unsigned long) current->mm->end_code) >> PAGE_SHIFT;
537 dump->u_dsize = ((unsigned long) (current->mm->brk + (PAGE_SIZE-1))) >> PAGE_SHIFT;
538 dump->u_dsize -= dump->u_tsize;
539 dump->u_ssize = 0;
540 for (i = 0; i < 8; i++)
541 dump->u_debugreg[i] = current->thread.debugreg[i];
542
543 if (dump->start_stack < TASK_SIZE)
544 dump->u_ssize = ((unsigned long) (TASK_SIZE - dump->start_stack)) >> PAGE_SHIFT;
545
546 dump->regs.ebx = regs->ebx;
547 dump->regs.ecx = regs->ecx;
548 dump->regs.edx = regs->edx;
549 dump->regs.esi = regs->esi;
550 dump->regs.edi = regs->edi;
551 dump->regs.ebp = regs->ebp;
552 dump->regs.eax = regs->eax;
553 dump->regs.ds = regs->xds;
554 dump->regs.es = regs->xes;
464d1a78
JF
555 dump->regs.fs = regs->xfs;
556 savesegment(gs,dump->regs.gs);
1da177e4
LT
557 dump->regs.orig_eax = regs->orig_eax;
558 dump->regs.eip = regs->eip;
559 dump->regs.cs = regs->xcs;
560 dump->regs.eflags = regs->eflags;
561 dump->regs.esp = regs->esp;
562 dump->regs.ss = regs->xss;
563
564 dump->u_fpvalid = dump_fpu (regs, &dump->i387);
565}
129f6946 566EXPORT_SYMBOL(dump_thread);
1da177e4
LT
567
568/*
569 * Capture the user space registers if the task is not running (in user space)
570 */
571int dump_task_regs(struct task_struct *tsk, elf_gregset_t *regs)
572{
07b047fc 573 struct pt_regs ptregs = *task_pt_regs(tsk);
1da177e4
LT
574 ptregs.xcs &= 0xffff;
575 ptregs.xds &= 0xffff;
576 ptregs.xes &= 0xffff;
577 ptregs.xss &= 0xffff;
578
579 elf_core_copy_regs(regs, &ptregs);
580
581 return 1;
582}
583
b3cf2576
SE
584static noinline void __switch_to_xtra(struct task_struct *next_p,
585 struct tss_struct *tss)
1da177e4 586{
b3cf2576
SE
587 struct thread_struct *next;
588
589 next = &next_p->thread;
590
591 if (test_tsk_thread_flag(next_p, TIF_DEBUG)) {
592 set_debugreg(next->debugreg[0], 0);
593 set_debugreg(next->debugreg[1], 1);
594 set_debugreg(next->debugreg[2], 2);
595 set_debugreg(next->debugreg[3], 3);
596 /* no 4 and 5 */
597 set_debugreg(next->debugreg[6], 6);
598 set_debugreg(next->debugreg[7], 7);
599 }
600
601 if (!test_tsk_thread_flag(next_p, TIF_IO_BITMAP)) {
1da177e4
LT
602 /*
603 * Disable the bitmap via an invalid offset. We still cache
604 * the previous bitmap owner and the IO bitmap contents:
605 */
606 tss->io_bitmap_base = INVALID_IO_BITMAP_OFFSET;
607 return;
608 }
b3cf2576 609
1da177e4
LT
610 if (likely(next == tss->io_bitmap_owner)) {
611 /*
612 * Previous owner of the bitmap (hence the bitmap content)
613 * matches the next task, we dont have to do anything but
614 * to set a valid offset in the TSS:
615 */
616 tss->io_bitmap_base = IO_BITMAP_OFFSET;
617 return;
618 }
619 /*
620 * Lazy TSS's I/O bitmap copy. We set an invalid offset here
621 * and we let the task to get a GPF in case an I/O instruction
622 * is performed. The handler of the GPF will verify that the
623 * faulting task has a valid I/O bitmap and, it true, does the
624 * real copy and restart the instruction. This will save us
625 * redundant copies when the currently switched task does not
626 * perform any I/O during its timeslice.
627 */
628 tss->io_bitmap_base = INVALID_IO_BITMAP_OFFSET_LAZY;
629}
1da177e4 630
ffaa8bd6
AA
631/*
632 * This function selects if the context switch from prev to next
633 * has to tweak the TSC disable bit in the cr4.
634 */
635static inline void disable_tsc(struct task_struct *prev_p,
636 struct task_struct *next_p)
637{
638 struct thread_info *prev, *next;
639
640 /*
641 * gcc should eliminate the ->thread_info dereference if
642 * has_secure_computing returns 0 at compile time (SECCOMP=n).
643 */
06b425d8
AV
644 prev = task_thread_info(prev_p);
645 next = task_thread_info(next_p);
ffaa8bd6
AA
646
647 if (has_secure_computing(prev) || has_secure_computing(next)) {
648 /* slow path here */
649 if (has_secure_computing(prev) &&
650 !has_secure_computing(next)) {
651 write_cr4(read_cr4() & ~X86_CR4_TSD);
652 } else if (!has_secure_computing(prev) &&
653 has_secure_computing(next))
654 write_cr4(read_cr4() | X86_CR4_TSD);
655 }
656}
657
1da177e4
LT
658/*
659 * switch_to(x,yn) should switch tasks from x to y.
660 *
661 * We fsave/fwait so that an exception goes off at the right time
662 * (as a call from the fsave or fwait in effect) rather than to
663 * the wrong process. Lazy FP saving no longer makes any sense
664 * with modern CPU's, and this simplifies a lot of things (SMP
665 * and UP become the same).
666 *
667 * NOTE! We used to use the x86 hardware context switching. The
668 * reason for not using it any more becomes apparent when you
669 * try to recover gracefully from saved state that is no longer
670 * valid (stale segment register values in particular). With the
671 * hardware task-switch, there is no way to fix up bad state in
672 * a reasonable manner.
673 *
674 * The fact that Intel documents the hardware task-switching to
675 * be slow is a fairly red herring - this code is not noticeably
676 * faster. However, there _is_ some room for improvement here,
677 * so the performance issues may eventually be a valid point.
678 * More important, however, is the fact that this allows us much
679 * more flexibility.
680 *
681 * The return value (in %eax) will be the "prev" task after
682 * the task-switch, and shows up in ret_from_fork in entry.S,
683 * for example.
684 */
685struct task_struct fastcall * __switch_to(struct task_struct *prev_p, struct task_struct *next_p)
686{
687 struct thread_struct *prev = &prev_p->thread,
688 *next = &next_p->thread;
689 int cpu = smp_processor_id();
690 struct tss_struct *tss = &per_cpu(init_tss, cpu);
691
692 /* never put a printk in __switch_to... printk() calls wake_up*() indirectly */
693
694 __unlazy_fpu(prev_p);
695
acc20761
CE
696
697 /* we're going to use this soon, after a few expensive things */
698 if (next_p->fpu_counter > 5)
699 prefetch(&next->i387.fxsave);
700
1da177e4 701 /*
e7a2ff59 702 * Reload esp0.
1da177e4
LT
703 */
704 load_esp0(tss, next);
705
706 /*
464d1a78 707 * Save away %gs. No need to save %fs, as it was saved on the
f95d47ca
JF
708 * stack on entry. No need to save %es and %ds, as those are
709 * always kernel segments while inside the kernel. Doing this
710 * before setting the new TLS descriptors avoids the situation
711 * where we temporarily have non-reloadable segments in %fs
712 * and %gs. This could be an issue if the NMI handler ever
713 * used %fs or %gs (it does not today), or if the kernel is
714 * running inside of a hypervisor layer.
1da177e4 715 */
464d1a78 716 savesegment(gs, prev->gs);
1da177e4
LT
717
718 /*
e7a2ff59 719 * Load the per-thread Thread-Local Storage descriptor.
1da177e4 720 */
e7a2ff59 721 load_TLS(next, cpu);
1da177e4 722
8b151144
ZA
723 /*
724 * Restore IOPL if needed. In normal use, the flags restore
725 * in the switch assembly will handle this. But if the kernel
726 * is running virtualized at a non-zero CPL, the popf will
727 * not restore flags, so it must be done in a separate step.
728 */
729 if (get_kernel_rpl() && unlikely(prev->iopl != next->iopl))
730 set_iopl_mask(next->iopl);
731
1da177e4 732 /*
b3cf2576 733 * Now maybe handle debug registers and/or IO bitmaps
1da177e4 734 */
facf0147
CE
735 if (unlikely((task_thread_info(next_p)->flags & _TIF_WORK_CTXSW)
736 || test_tsk_thread_flag(prev_p, TIF_IO_BITMAP)))
b3cf2576 737 __switch_to_xtra(next_p, tss);
1da177e4 738
ffaa8bd6
AA
739 disable_tsc(prev_p, next_p);
740
9226d125
ZA
741 /*
742 * Leave lazy mode, flushing any hypercalls made here.
743 * This must be done before restoring TLS segments so
744 * the GDT and LDT are properly updated, and must be
745 * done before math_state_restore, so the TS bit is up
746 * to date.
747 */
748 arch_leave_lazy_cpu_mode();
749
acc20761
CE
750 /* If the task has used fpu the last 5 timeslices, just do a full
751 * restore of the math state immediately to avoid the trap; the
752 * chances of needing FPU soon are obviously high now
753 */
754 if (next_p->fpu_counter > 5)
755 math_state_restore();
756
9226d125
ZA
757 /*
758 * Restore %gs if needed (which is common)
759 */
760 if (prev->gs | next->gs)
761 loadsegment(gs, next->gs);
762
763 write_pda(pcurrent, next_p);
764
1da177e4
LT
765 return prev_p;
766}
767
768asmlinkage int sys_fork(struct pt_regs regs)
769{
770 return do_fork(SIGCHLD, regs.esp, &regs, 0, NULL, NULL);
771}
772
773asmlinkage int sys_clone(struct pt_regs regs)
774{
775 unsigned long clone_flags;
776 unsigned long newsp;
777 int __user *parent_tidptr, *child_tidptr;
778
779 clone_flags = regs.ebx;
780 newsp = regs.ecx;
781 parent_tidptr = (int __user *)regs.edx;
782 child_tidptr = (int __user *)regs.edi;
783 if (!newsp)
784 newsp = regs.esp;
785 return do_fork(clone_flags, newsp, &regs, 0, parent_tidptr, child_tidptr);
786}
787
788/*
789 * This is trivial, and on the face of it looks like it
790 * could equally well be done in user mode.
791 *
792 * Not so, for quite unobvious reasons - register pressure.
793 * In user mode vfork() cannot have a stack frame, and if
794 * done by calling the "clone()" system call directly, you
795 * do not have enough call-clobbered registers to hold all
796 * the information you need.
797 */
798asmlinkage int sys_vfork(struct pt_regs regs)
799{
800 return do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, regs.esp, &regs, 0, NULL, NULL);
801}
802
803/*
804 * sys_execve() executes a new program.
805 */
806asmlinkage int sys_execve(struct pt_regs regs)
807{
808 int error;
809 char * filename;
810
811 filename = getname((char __user *) regs.ebx);
812 error = PTR_ERR(filename);
813 if (IS_ERR(filename))
814 goto out;
815 error = do_execve(filename,
816 (char __user * __user *) regs.ecx,
817 (char __user * __user *) regs.edx,
818 &regs);
819 if (error == 0) {
820 task_lock(current);
821 current->ptrace &= ~PT_DTRACE;
822 task_unlock(current);
823 /* Make sure we don't return using sysenter.. */
824 set_thread_flag(TIF_IRET);
825 }
826 putname(filename);
827out:
828 return error;
829}
830
831#define top_esp (THREAD_SIZE - sizeof(unsigned long))
832#define top_ebp (THREAD_SIZE - 2*sizeof(unsigned long))
833
834unsigned long get_wchan(struct task_struct *p)
835{
836 unsigned long ebp, esp, eip;
837 unsigned long stack_page;
838 int count = 0;
839 if (!p || p == current || p->state == TASK_RUNNING)
840 return 0;
65e0fdff 841 stack_page = (unsigned long)task_stack_page(p);
1da177e4
LT
842 esp = p->thread.esp;
843 if (!stack_page || esp < stack_page || esp > top_esp+stack_page)
844 return 0;
845 /* include/asm-i386/system.h:switch_to() pushes ebp last. */
846 ebp = *(unsigned long *) esp;
847 do {
848 if (ebp < stack_page || ebp > top_ebp+stack_page)
849 return 0;
850 eip = *(unsigned long *) (ebp+4);
851 if (!in_sched_functions(eip))
852 return eip;
853 ebp = *(unsigned long *) ebp;
854 } while (count++ < 16);
855 return 0;
856}
857
858/*
859 * sys_alloc_thread_area: get a yet unused TLS descriptor index.
860 */
861static int get_free_idx(void)
862{
863 struct thread_struct *t = &current->thread;
864 int idx;
865
866 for (idx = 0; idx < GDT_ENTRY_TLS_ENTRIES; idx++)
867 if (desc_empty(t->tls_array + idx))
868 return idx + GDT_ENTRY_TLS_MIN;
869 return -ESRCH;
870}
871
872/*
873 * Set a given TLS descriptor:
874 */
875asmlinkage int sys_set_thread_area(struct user_desc __user *u_info)
876{
877 struct thread_struct *t = &current->thread;
878 struct user_desc info;
879 struct desc_struct *desc;
880 int cpu, idx;
881
882 if (copy_from_user(&info, u_info, sizeof(info)))
883 return -EFAULT;
884 idx = info.entry_number;
885
886 /*
887 * index -1 means the kernel should try to find and
888 * allocate an empty descriptor:
889 */
890 if (idx == -1) {
891 idx = get_free_idx();
892 if (idx < 0)
893 return idx;
894 if (put_user(idx, &u_info->entry_number))
895 return -EFAULT;
896 }
897
898 if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
899 return -EINVAL;
900
901 desc = t->tls_array + idx - GDT_ENTRY_TLS_MIN;
902
903 /*
904 * We must not get preempted while modifying the TLS.
905 */
906 cpu = get_cpu();
907
908 if (LDT_empty(&info)) {
909 desc->a = 0;
910 desc->b = 0;
911 } else {
912 desc->a = LDT_entry_a(&info);
913 desc->b = LDT_entry_b(&info);
914 }
915 load_TLS(t, cpu);
916
917 put_cpu();
918
919 return 0;
920}
921
922/*
923 * Get the current Thread-Local Storage area:
924 */
925
926#define GET_BASE(desc) ( \
927 (((desc)->a >> 16) & 0x0000ffff) | \
928 (((desc)->b << 16) & 0x00ff0000) | \
929 ( (desc)->b & 0xff000000) )
930
931#define GET_LIMIT(desc) ( \
932 ((desc)->a & 0x0ffff) | \
933 ((desc)->b & 0xf0000) )
934
935#define GET_32BIT(desc) (((desc)->b >> 22) & 1)
936#define GET_CONTENTS(desc) (((desc)->b >> 10) & 3)
937#define GET_WRITABLE(desc) (((desc)->b >> 9) & 1)
938#define GET_LIMIT_PAGES(desc) (((desc)->b >> 23) & 1)
939#define GET_PRESENT(desc) (((desc)->b >> 15) & 1)
940#define GET_USEABLE(desc) (((desc)->b >> 20) & 1)
941
942asmlinkage int sys_get_thread_area(struct user_desc __user *u_info)
943{
944 struct user_desc info;
945 struct desc_struct *desc;
946 int idx;
947
948 if (get_user(idx, &u_info->entry_number))
949 return -EFAULT;
950 if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
951 return -EINVAL;
952
71ae18ec
B
953 memset(&info, 0, sizeof(info));
954
1da177e4
LT
955 desc = current->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
956
957 info.entry_number = idx;
958 info.base_addr = GET_BASE(desc);
959 info.limit = GET_LIMIT(desc);
960 info.seg_32bit = GET_32BIT(desc);
961 info.contents = GET_CONTENTS(desc);
962 info.read_exec_only = !GET_WRITABLE(desc);
963 info.limit_in_pages = GET_LIMIT_PAGES(desc);
964 info.seg_not_present = !GET_PRESENT(desc);
965 info.useable = GET_USEABLE(desc);
966
967 if (copy_to_user(u_info, &info, sizeof(info)))
968 return -EFAULT;
969 return 0;
970}
971
972unsigned long arch_align_stack(unsigned long sp)
973{
c16b63e0 974 if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
1da177e4
LT
975 sp -= get_random_int() % 8192;
976 return sp & ~0xf;
977}
This page took 0.258166 seconds and 5 git commands to generate.