blob: 525432e3fef734fce39f14db5aa01288a7e43fea [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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
Zwane Mwaikambof3705132005-06-25 14:54:50 -070016#include <linux/cpu.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070017#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>
31#include <linux/config.h>
32#include <linux/utsname.h>
33#include <linux/delay.h>
34#include <linux/reboot.h>
35#include <linux/init.h>
36#include <linux/mc146818rtc.h>
37#include <linux/module.h>
38#include <linux/kallsyms.h>
39#include <linux/ptrace.h>
40#include <linux/random.h>
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>
Linus Torvalds1da177e2005-04-16 15:20:36 -070049#include <asm/desc.h>
Matt Mackall64ca9002006-01-08 01:05:26 -080050#include <asm/vm86.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070051#ifdef CONFIG_MATH_EMULATION
52#include <asm/math_emu.h>
53#endif
54
Linus Torvalds1da177e2005-04-16 15:20:36 -070055#include <linux/err.h>
56
Zwane Mwaikambof3705132005-06-25 14:54:50 -070057#include <asm/tlbflush.h>
58#include <asm/cpu.h>
59
Linus Torvalds1da177e2005-04-16 15:20:36 -070060asmlinkage void ret_from_fork(void) __asm__("ret_from_fork");
61
62static int hlt_counter;
63
64unsigned long boot_option_idle_override = 0;
65EXPORT_SYMBOL(boot_option_idle_override);
66
67/*
68 * Return saved PC of a blocked thread.
69 */
70unsigned long thread_saved_pc(struct task_struct *tsk)
71{
72 return ((unsigned long *)tsk->thread.esp)[3];
73}
74
75/*
76 * Powermanagement idle function, if any..
77 */
78void (*pm_idle)(void);
Alexey Dobriyan129f6942005-06-23 00:08:33 -070079EXPORT_SYMBOL(pm_idle);
Linus Torvalds1da177e2005-04-16 15:20:36 -070080static DEFINE_PER_CPU(unsigned int, cpu_idle_state);
81
82void disable_hlt(void)
83{
84 hlt_counter++;
85}
86
87EXPORT_SYMBOL(disable_hlt);
88
89void enable_hlt(void)
90{
91 hlt_counter--;
92}
93
94EXPORT_SYMBOL(enable_hlt);
95
96/*
97 * We use this if we don't have any better
98 * idle routine..
99 */
100void default_idle(void)
101{
Nick Piggin64c7c8f2005-11-08 21:39:04 -0800102 local_irq_enable();
103
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104 if (!hlt_counter && boot_cpu_data.hlt_works_ok) {
Nick Piggin64c7c8f2005-11-08 21:39:04 -0800105 clear_thread_flag(TIF_POLLING_NRFLAG);
106 smp_mb__after_clear_bit();
107 while (!need_resched()) {
108 local_irq_disable();
109 if (!need_resched())
110 safe_halt();
111 else
112 local_irq_enable();
113 }
114 set_thread_flag(TIF_POLLING_NRFLAG);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700115 } else {
Nick Piggin64c7c8f2005-11-08 21:39:04 -0800116 while (!need_resched())
117 cpu_relax();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700118 }
119}
Alexey Dobriyan129f6942005-06-23 00:08:33 -0700120#ifdef CONFIG_APM_MODULE
121EXPORT_SYMBOL(default_idle);
122#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700123
124/*
125 * On SMP it's slightly faster (but much more power-consuming!)
126 * to poll the ->work.need_resched flag instead of waiting for the
127 * cross-CPU IPI to arrive. Use this option with caution.
128 */
129static void poll_idle (void)
130{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131 local_irq_enable();
132
Nick Piggin64c7c8f2005-11-08 21:39:04 -0800133 asm volatile(
134 "2:"
135 "testl %0, %1;"
136 "rep; nop;"
137 "je 2b;"
138 : : "i"(_TIF_NEED_RESCHED), "m" (current_thread_info()->flags));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139}
140
Zwane Mwaikambof3705132005-06-25 14:54:50 -0700141#ifdef CONFIG_HOTPLUG_CPU
142#include <asm/nmi.h>
143/* We don't actually take CPU down, just spin without interrupts. */
144static inline void play_dead(void)
145{
Li Shaohuae1367da2005-06-25 14:54:56 -0700146 /* This must be done before dead CPU ack */
147 cpu_exit_clear();
148 wbinvd();
149 mb();
Zwane Mwaikambof3705132005-06-25 14:54:50 -0700150 /* Ack it */
151 __get_cpu_var(cpu_state) = CPU_DEAD;
152
Li Shaohuae1367da2005-06-25 14:54:56 -0700153 /*
154 * With physical CPU hotplug, we should halt the cpu
155 */
Zwane Mwaikambof3705132005-06-25 14:54:50 -0700156 local_irq_disable();
Li Shaohuae1367da2005-06-25 14:54:56 -0700157 while (1)
Zachary Amsdenf2ab4462005-09-03 15:56:42 -0700158 halt();
Zwane Mwaikambof3705132005-06-25 14:54:50 -0700159}
160#else
161static inline void play_dead(void)
162{
163 BUG();
164}
165#endif /* CONFIG_HOTPLUG_CPU */
166
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167/*
168 * The idle thread. There's no useful work to be
169 * done, so just try to conserve power and have a
170 * low exit latency (ie sit in a loop waiting for
171 * somebody to say that they'd like to reschedule)
172 */
Zwane Mwaikambof3705132005-06-25 14:54:50 -0700173void cpu_idle(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174{
Nick Piggin5bfb5d62005-11-08 21:39:01 -0800175 int cpu = smp_processor_id();
Zwane Mwaikambof3705132005-06-25 14:54:50 -0700176
Nick Piggin64c7c8f2005-11-08 21:39:04 -0800177 set_thread_flag(TIF_POLLING_NRFLAG);
178
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179 /* endless idle loop with no priority at all */
180 while (1) {
181 while (!need_resched()) {
182 void (*idle)(void);
183
184 if (__get_cpu_var(cpu_idle_state))
185 __get_cpu_var(cpu_idle_state) = 0;
186
187 rmb();
188 idle = pm_idle;
189
190 if (!idle)
191 idle = default_idle;
192
Zwane Mwaikambof3705132005-06-25 14:54:50 -0700193 if (cpu_is_offline(cpu))
194 play_dead();
195
Linus Torvalds1da177e2005-04-16 15:20:36 -0700196 __get_cpu_var(irq_stat).idle_timestamp = jiffies;
197 idle();
198 }
Nick Piggin5bfb5d62005-11-08 21:39:01 -0800199 preempt_enable_no_resched();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700200 schedule();
Nick Piggin5bfb5d62005-11-08 21:39:01 -0800201 preempt_disable();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202 }
203}
204
205void cpu_idle_wait(void)
206{
207 unsigned int cpu, this_cpu = get_cpu();
208 cpumask_t map;
209
210 set_cpus_allowed(current, cpumask_of_cpu(this_cpu));
211 put_cpu();
212
213 cpus_clear(map);
214 for_each_online_cpu(cpu) {
215 per_cpu(cpu_idle_state, cpu) = 1;
216 cpu_set(cpu, map);
217 }
218
219 __get_cpu_var(cpu_idle_state) = 0;
220
221 wmb();
222 do {
223 ssleep(1);
224 for_each_online_cpu(cpu) {
225 if (cpu_isset(cpu, map) && !per_cpu(cpu_idle_state, cpu))
226 cpu_clear(cpu, map);
227 }
228 cpus_and(map, map, cpu_online_map);
229 } while (!cpus_empty(map));
230}
231EXPORT_SYMBOL_GPL(cpu_idle_wait);
232
233/*
234 * This uses new MONITOR/MWAIT instructions on P4 processors with PNI,
235 * which can obviate IPI to trigger checking of need_resched.
236 * We execute MONITOR against need_resched and enter optimized wait state
237 * through MWAIT. Whenever someone changes need_resched, we would be woken
238 * up from MWAIT (without an IPI).
239 */
240static void mwait_idle(void)
241{
242 local_irq_enable();
243
Nick Piggin64c7c8f2005-11-08 21:39:04 -0800244 while (!need_resched()) {
245 __monitor((void *)&current_thread_info()->flags, 0, 0);
246 smp_mb();
247 if (need_resched())
248 break;
249 __mwait(0, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700250 }
251}
252
Li Shaohua0bb31842005-06-25 14:54:55 -0700253void __devinit select_idle_routine(const struct cpuinfo_x86 *c)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700254{
255 if (cpu_has(c, X86_FEATURE_MWAIT)) {
256 printk("monitor/mwait feature present.\n");
257 /*
258 * Skip, if setup has overridden idle.
259 * One CPU supports mwait => All CPUs supports mwait
260 */
261 if (!pm_idle) {
262 printk("using mwait in idle threads.\n");
263 pm_idle = mwait_idle;
264 }
265 }
266}
267
268static int __init idle_setup (char *str)
269{
270 if (!strncmp(str, "poll", 4)) {
271 printk("using polling idle threads.\n");
272 pm_idle = poll_idle;
273#ifdef CONFIG_X86_SMP
274 if (smp_num_siblings > 1)
275 printk("WARNING: polling idle and HT enabled, performance may degrade.\n");
276#endif
277 } else if (!strncmp(str, "halt", 4)) {
278 printk("using halt in idle threads.\n");
279 pm_idle = default_idle;
280 }
281
282 boot_option_idle_override = 1;
283 return 1;
284}
285
286__setup("idle=", idle_setup);
287
288void show_regs(struct pt_regs * regs)
289{
290 unsigned long cr0 = 0L, cr2 = 0L, cr3 = 0L, cr4 = 0L;
291
292 printk("\n");
293 printk("Pid: %d, comm: %20s\n", current->pid, current->comm);
294 printk("EIP: %04x:[<%08lx>] CPU: %d\n",0xffff & regs->xcs,regs->eip, smp_processor_id());
295 print_symbol("EIP is at %s\n", regs->eip);
296
Jan Beulichdb753bd2006-03-23 02:59:46 -0800297 if (user_mode_vm(regs))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700298 printk(" ESP: %04x:%08lx",0xffff & regs->xss,regs->esp);
Chuck Ebbertb53e8f62006-02-04 23:28:04 -0800299 printk(" EFLAGS: %08lx %s (%s %.*s)\n",
300 regs->eflags, print_tainted(), system_utsname.release,
301 (int)strcspn(system_utsname.version, " "),
302 system_utsname.version);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700303 printk("EAX: %08lx EBX: %08lx ECX: %08lx EDX: %08lx\n",
304 regs->eax,regs->ebx,regs->ecx,regs->edx);
305 printk("ESI: %08lx EDI: %08lx EBP: %08lx",
306 regs->esi, regs->edi, regs->ebp);
307 printk(" DS: %04x ES: %04x\n",
308 0xffff & regs->xds,0xffff & regs->xes);
309
Zachary Amsden4bb0d3e2005-09-03 15:56:36 -0700310 cr0 = read_cr0();
311 cr2 = read_cr2();
312 cr3 = read_cr3();
Zachary Amsdenff6e8c02006-01-06 00:11:50 -0800313 cr4 = read_cr4_safe();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700314 printk("CR0: %08lx CR2: %08lx CR3: %08lx CR4: %08lx\n", cr0, cr2, cr3, cr4);
Jan Beulich176a2712006-06-26 13:57:41 +0200315 show_trace(NULL, regs, &regs->esp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316}
317
318/*
319 * This gets run with %ebx containing the
320 * function to call, and %edx containing
321 * the "args".
322 */
323extern void kernel_thread_helper(void);
324__asm__(".section .text\n"
325 ".align 4\n"
326 "kernel_thread_helper:\n\t"
327 "movl %edx,%eax\n\t"
328 "pushl %edx\n\t"
329 "call *%ebx\n\t"
330 "pushl %eax\n\t"
331 "call do_exit\n"
332 ".previous");
333
334/*
335 * Create a kernel thread
336 */
337int kernel_thread(int (*fn)(void *), void * arg, unsigned long flags)
338{
339 struct pt_regs regs;
340
341 memset(&regs, 0, sizeof(regs));
342
343 regs.ebx = (unsigned long) fn;
344 regs.edx = (unsigned long) arg;
345
346 regs.xds = __USER_DS;
347 regs.xes = __USER_DS;
348 regs.orig_eax = -1;
349 regs.eip = (unsigned long) kernel_thread_helper;
350 regs.xcs = __KERNEL_CS;
351 regs.eflags = X86_EFLAGS_IF | X86_EFLAGS_SF | X86_EFLAGS_PF | 0x2;
352
353 /* Ok, create the new process.. */
354 return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, &regs, 0, NULL, NULL);
355}
Alexey Dobriyan129f6942005-06-23 00:08:33 -0700356EXPORT_SYMBOL(kernel_thread);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700357
358/*
359 * Free current thread data structures etc..
360 */
361void exit_thread(void)
362{
363 struct task_struct *tsk = current;
364 struct thread_struct *t = &tsk->thread;
365
366 /* The process may have allocated an io port bitmap... nuke it. */
367 if (unlikely(NULL != t->io_bitmap_ptr)) {
368 int cpu = get_cpu();
369 struct tss_struct *tss = &per_cpu(init_tss, cpu);
370
371 kfree(t->io_bitmap_ptr);
372 t->io_bitmap_ptr = NULL;
373 /*
374 * Careful, clear this in the TSS too:
375 */
376 memset(tss->io_bitmap, 0xff, tss->io_bitmap_max);
377 t->io_bitmap_max = 0;
378 tss->io_bitmap_owner = NULL;
379 tss->io_bitmap_max = 0;
380 tss->io_bitmap_base = INVALID_IO_BITMAP_OFFSET;
381 put_cpu();
382 }
383}
384
385void flush_thread(void)
386{
387 struct task_struct *tsk = current;
388
389 memset(tsk->thread.debugreg, 0, sizeof(unsigned long)*8);
390 memset(tsk->thread.tls_array, 0, sizeof(tsk->thread.tls_array));
391 /*
392 * Forget coprocessor state..
393 */
394 clear_fpu(tsk);
395 clear_used_math();
396}
397
398void release_thread(struct task_struct *dead_task)
399{
Zachary Amsden26849272006-01-06 00:11:59 -0800400 BUG_ON(dead_task->mm);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700401 release_vm86_irqs(dead_task);
402}
403
404/*
405 * This gets called before we allocate a new thread and copy
406 * the current task into it.
407 */
408void prepare_to_copy(struct task_struct *tsk)
409{
410 unlazy_fpu(tsk);
411}
412
413int copy_thread(int nr, unsigned long clone_flags, unsigned long esp,
414 unsigned long unused,
415 struct task_struct * p, struct pt_regs * regs)
416{
417 struct pt_regs * childregs;
418 struct task_struct *tsk;
419 int err;
420
akpm@osdl.org07b047f2006-01-12 01:05:41 -0800421 childregs = task_pt_regs(p);
Alexander Nybergf48d9662005-05-05 16:15:03 -0700422 *childregs = *regs;
423 childregs->eax = 0;
424 childregs->esp = esp;
425
426 p->thread.esp = (unsigned long) childregs;
427 p->thread.esp0 = (unsigned long) (childregs+1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700428
429 p->thread.eip = (unsigned long) ret_from_fork;
430
431 savesegment(fs,p->thread.fs);
432 savesegment(gs,p->thread.gs);
433
434 tsk = current;
435 if (unlikely(NULL != tsk->thread.io_bitmap_ptr)) {
436 p->thread.io_bitmap_ptr = kmalloc(IO_BITMAP_BYTES, GFP_KERNEL);
437 if (!p->thread.io_bitmap_ptr) {
438 p->thread.io_bitmap_max = 0;
439 return -ENOMEM;
440 }
441 memcpy(p->thread.io_bitmap_ptr, tsk->thread.io_bitmap_ptr,
442 IO_BITMAP_BYTES);
443 }
444
445 /*
446 * Set a new TLS for the child thread?
447 */
448 if (clone_flags & CLONE_SETTLS) {
449 struct desc_struct *desc;
450 struct user_desc info;
451 int idx;
452
453 err = -EFAULT;
454 if (copy_from_user(&info, (void __user *)childregs->esi, sizeof(info)))
455 goto out;
456 err = -EINVAL;
457 if (LDT_empty(&info))
458 goto out;
459
460 idx = info.entry_number;
461 if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
462 goto out;
463
464 desc = p->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
465 desc->a = LDT_entry_a(&info);
466 desc->b = LDT_entry_b(&info);
467 }
468
469 err = 0;
470 out:
471 if (err && p->thread.io_bitmap_ptr) {
472 kfree(p->thread.io_bitmap_ptr);
473 p->thread.io_bitmap_max = 0;
474 }
475 return err;
476}
477
478/*
479 * fill in the user structure for a core dump..
480 */
481void dump_thread(struct pt_regs * regs, struct user * dump)
482{
483 int i;
484
485/* changed the size calculations - should hopefully work better. lbt */
486 dump->magic = CMAGIC;
487 dump->start_code = 0;
488 dump->start_stack = regs->esp & ~(PAGE_SIZE - 1);
489 dump->u_tsize = ((unsigned long) current->mm->end_code) >> PAGE_SHIFT;
490 dump->u_dsize = ((unsigned long) (current->mm->brk + (PAGE_SIZE-1))) >> PAGE_SHIFT;
491 dump->u_dsize -= dump->u_tsize;
492 dump->u_ssize = 0;
493 for (i = 0; i < 8; i++)
494 dump->u_debugreg[i] = current->thread.debugreg[i];
495
496 if (dump->start_stack < TASK_SIZE)
497 dump->u_ssize = ((unsigned long) (TASK_SIZE - dump->start_stack)) >> PAGE_SHIFT;
498
499 dump->regs.ebx = regs->ebx;
500 dump->regs.ecx = regs->ecx;
501 dump->regs.edx = regs->edx;
502 dump->regs.esi = regs->esi;
503 dump->regs.edi = regs->edi;
504 dump->regs.ebp = regs->ebp;
505 dump->regs.eax = regs->eax;
506 dump->regs.ds = regs->xds;
507 dump->regs.es = regs->xes;
508 savesegment(fs,dump->regs.fs);
509 savesegment(gs,dump->regs.gs);
510 dump->regs.orig_eax = regs->orig_eax;
511 dump->regs.eip = regs->eip;
512 dump->regs.cs = regs->xcs;
513 dump->regs.eflags = regs->eflags;
514 dump->regs.esp = regs->esp;
515 dump->regs.ss = regs->xss;
516
517 dump->u_fpvalid = dump_fpu (regs, &dump->i387);
518}
Alexey Dobriyan129f6942005-06-23 00:08:33 -0700519EXPORT_SYMBOL(dump_thread);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520
521/*
522 * Capture the user space registers if the task is not running (in user space)
523 */
524int dump_task_regs(struct task_struct *tsk, elf_gregset_t *regs)
525{
akpm@osdl.org07b047f2006-01-12 01:05:41 -0800526 struct pt_regs ptregs = *task_pt_regs(tsk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700527 ptregs.xcs &= 0xffff;
528 ptregs.xds &= 0xffff;
529 ptregs.xes &= 0xffff;
530 ptregs.xss &= 0xffff;
531
532 elf_core_copy_regs(regs, &ptregs);
533
534 return 1;
535}
536
537static inline void
538handle_io_bitmap(struct thread_struct *next, struct tss_struct *tss)
539{
540 if (!next->io_bitmap_ptr) {
541 /*
542 * Disable the bitmap via an invalid offset. We still cache
543 * the previous bitmap owner and the IO bitmap contents:
544 */
545 tss->io_bitmap_base = INVALID_IO_BITMAP_OFFSET;
546 return;
547 }
548 if (likely(next == tss->io_bitmap_owner)) {
549 /*
550 * Previous owner of the bitmap (hence the bitmap content)
551 * matches the next task, we dont have to do anything but
552 * to set a valid offset in the TSS:
553 */
554 tss->io_bitmap_base = IO_BITMAP_OFFSET;
555 return;
556 }
557 /*
558 * Lazy TSS's I/O bitmap copy. We set an invalid offset here
559 * and we let the task to get a GPF in case an I/O instruction
560 * is performed. The handler of the GPF will verify that the
561 * faulting task has a valid I/O bitmap and, it true, does the
562 * real copy and restart the instruction. This will save us
563 * redundant copies when the currently switched task does not
564 * perform any I/O during its timeslice.
565 */
566 tss->io_bitmap_base = INVALID_IO_BITMAP_OFFSET_LAZY;
567}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700568
569/*
Andrea Arcangeliffaa8bd2005-06-27 14:36:36 -0700570 * This function selects if the context switch from prev to next
571 * has to tweak the TSC disable bit in the cr4.
572 */
573static inline void disable_tsc(struct task_struct *prev_p,
574 struct task_struct *next_p)
575{
576 struct thread_info *prev, *next;
577
578 /*
579 * gcc should eliminate the ->thread_info dereference if
580 * has_secure_computing returns 0 at compile time (SECCOMP=n).
581 */
Al Viro06b425d2006-01-12 01:05:40 -0800582 prev = task_thread_info(prev_p);
583 next = task_thread_info(next_p);
Andrea Arcangeliffaa8bd2005-06-27 14:36:36 -0700584
585 if (has_secure_computing(prev) || has_secure_computing(next)) {
586 /* slow path here */
587 if (has_secure_computing(prev) &&
588 !has_secure_computing(next)) {
589 write_cr4(read_cr4() & ~X86_CR4_TSD);
590 } else if (!has_secure_computing(prev) &&
591 has_secure_computing(next))
592 write_cr4(read_cr4() | X86_CR4_TSD);
593 }
594}
595
596/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700597 * switch_to(x,yn) should switch tasks from x to y.
598 *
599 * We fsave/fwait so that an exception goes off at the right time
600 * (as a call from the fsave or fwait in effect) rather than to
601 * the wrong process. Lazy FP saving no longer makes any sense
602 * with modern CPU's, and this simplifies a lot of things (SMP
603 * and UP become the same).
604 *
605 * NOTE! We used to use the x86 hardware context switching. The
606 * reason for not using it any more becomes apparent when you
607 * try to recover gracefully from saved state that is no longer
608 * valid (stale segment register values in particular). With the
609 * hardware task-switch, there is no way to fix up bad state in
610 * a reasonable manner.
611 *
612 * The fact that Intel documents the hardware task-switching to
613 * be slow is a fairly red herring - this code is not noticeably
614 * faster. However, there _is_ some room for improvement here,
615 * so the performance issues may eventually be a valid point.
616 * More important, however, is the fact that this allows us much
617 * more flexibility.
618 *
619 * The return value (in %eax) will be the "prev" task after
620 * the task-switch, and shows up in ret_from_fork in entry.S,
621 * for example.
622 */
623struct task_struct fastcall * __switch_to(struct task_struct *prev_p, struct task_struct *next_p)
624{
625 struct thread_struct *prev = &prev_p->thread,
626 *next = &next_p->thread;
627 int cpu = smp_processor_id();
628 struct tss_struct *tss = &per_cpu(init_tss, cpu);
629
630 /* never put a printk in __switch_to... printk() calls wake_up*() indirectly */
631
632 __unlazy_fpu(prev_p);
633
634 /*
Zachary Amsdene7a2ff52005-09-03 15:56:39 -0700635 * Reload esp0.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700636 */
637 load_esp0(tss, next);
638
639 /*
Zachary Amsdene7a2ff52005-09-03 15:56:39 -0700640 * Save away %fs and %gs. No need to save %es and %ds, as
641 * those are always kernel segments while inside the kernel.
642 * Doing this before setting the new TLS descriptors avoids
643 * the situation where we temporarily have non-reloadable
644 * segments in %fs and %gs. This could be an issue if the
645 * NMI handler ever used %fs or %gs (it does not today), or
646 * if the kernel is running inside of a hypervisor layer.
647 */
648 savesegment(fs, prev->fs);
649 savesegment(gs, prev->gs);
650
651 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700652 * Load the per-thread Thread-Local Storage descriptor.
653 */
654 load_TLS(next, cpu);
655
656 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700657 * Restore %fs and %gs if needed.
Linus Torvaldsb339a182005-07-22 15:23:47 -0400658 *
659 * Glibc normally makes %fs be zero, and %gs is one of
660 * the TLS segments.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700661 */
Linus Torvaldsb339a182005-07-22 15:23:47 -0400662 if (unlikely(prev->fs | next->fs))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700663 loadsegment(fs, next->fs);
Linus Torvaldsb339a182005-07-22 15:23:47 -0400664
665 if (prev->gs | next->gs)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700666 loadsegment(gs, next->gs);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700667
668 /*
Zachary Amsdena5201122005-09-03 15:56:44 -0700669 * Restore IOPL if needed.
670 */
671 if (unlikely(prev->iopl != next->iopl))
672 set_iopl_mask(next->iopl);
673
674 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700675 * Now maybe reload the debug registers
676 */
677 if (unlikely(next->debugreg[7])) {
Linus Torvaldsb339a182005-07-22 15:23:47 -0400678 set_debugreg(next->debugreg[0], 0);
679 set_debugreg(next->debugreg[1], 1);
680 set_debugreg(next->debugreg[2], 2);
681 set_debugreg(next->debugreg[3], 3);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700682 /* no 4 and 5 */
Linus Torvaldsb339a182005-07-22 15:23:47 -0400683 set_debugreg(next->debugreg[6], 6);
684 set_debugreg(next->debugreg[7], 7);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700685 }
686
687 if (unlikely(prev->io_bitmap_ptr || next->io_bitmap_ptr))
688 handle_io_bitmap(next, tss);
689
Andrea Arcangeliffaa8bd2005-06-27 14:36:36 -0700690 disable_tsc(prev_p, next_p);
691
Linus Torvalds1da177e2005-04-16 15:20:36 -0700692 return prev_p;
693}
694
695asmlinkage int sys_fork(struct pt_regs regs)
696{
697 return do_fork(SIGCHLD, regs.esp, &regs, 0, NULL, NULL);
698}
699
700asmlinkage int sys_clone(struct pt_regs regs)
701{
702 unsigned long clone_flags;
703 unsigned long newsp;
704 int __user *parent_tidptr, *child_tidptr;
705
706 clone_flags = regs.ebx;
707 newsp = regs.ecx;
708 parent_tidptr = (int __user *)regs.edx;
709 child_tidptr = (int __user *)regs.edi;
710 if (!newsp)
711 newsp = regs.esp;
712 return do_fork(clone_flags, newsp, &regs, 0, parent_tidptr, child_tidptr);
713}
714
715/*
716 * This is trivial, and on the face of it looks like it
717 * could equally well be done in user mode.
718 *
719 * Not so, for quite unobvious reasons - register pressure.
720 * In user mode vfork() cannot have a stack frame, and if
721 * done by calling the "clone()" system call directly, you
722 * do not have enough call-clobbered registers to hold all
723 * the information you need.
724 */
725asmlinkage int sys_vfork(struct pt_regs regs)
726{
727 return do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, regs.esp, &regs, 0, NULL, NULL);
728}
729
730/*
731 * sys_execve() executes a new program.
732 */
733asmlinkage int sys_execve(struct pt_regs regs)
734{
735 int error;
736 char * filename;
737
738 filename = getname((char __user *) regs.ebx);
739 error = PTR_ERR(filename);
740 if (IS_ERR(filename))
741 goto out;
742 error = do_execve(filename,
743 (char __user * __user *) regs.ecx,
744 (char __user * __user *) regs.edx,
745 &regs);
746 if (error == 0) {
747 task_lock(current);
748 current->ptrace &= ~PT_DTRACE;
749 task_unlock(current);
750 /* Make sure we don't return using sysenter.. */
751 set_thread_flag(TIF_IRET);
752 }
753 putname(filename);
754out:
755 return error;
756}
757
758#define top_esp (THREAD_SIZE - sizeof(unsigned long))
759#define top_ebp (THREAD_SIZE - 2*sizeof(unsigned long))
760
761unsigned long get_wchan(struct task_struct *p)
762{
763 unsigned long ebp, esp, eip;
764 unsigned long stack_page;
765 int count = 0;
766 if (!p || p == current || p->state == TASK_RUNNING)
767 return 0;
Al Viro65e0fdf2006-01-12 01:05:41 -0800768 stack_page = (unsigned long)task_stack_page(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700769 esp = p->thread.esp;
770 if (!stack_page || esp < stack_page || esp > top_esp+stack_page)
771 return 0;
772 /* include/asm-i386/system.h:switch_to() pushes ebp last. */
773 ebp = *(unsigned long *) esp;
774 do {
775 if (ebp < stack_page || ebp > top_ebp+stack_page)
776 return 0;
777 eip = *(unsigned long *) (ebp+4);
778 if (!in_sched_functions(eip))
779 return eip;
780 ebp = *(unsigned long *) ebp;
781 } while (count++ < 16);
782 return 0;
783}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700784
785/*
786 * sys_alloc_thread_area: get a yet unused TLS descriptor index.
787 */
788static int get_free_idx(void)
789{
790 struct thread_struct *t = &current->thread;
791 int idx;
792
793 for (idx = 0; idx < GDT_ENTRY_TLS_ENTRIES; idx++)
794 if (desc_empty(t->tls_array + idx))
795 return idx + GDT_ENTRY_TLS_MIN;
796 return -ESRCH;
797}
798
799/*
800 * Set a given TLS descriptor:
801 */
802asmlinkage int sys_set_thread_area(struct user_desc __user *u_info)
803{
804 struct thread_struct *t = &current->thread;
805 struct user_desc info;
806 struct desc_struct *desc;
807 int cpu, idx;
808
809 if (copy_from_user(&info, u_info, sizeof(info)))
810 return -EFAULT;
811 idx = info.entry_number;
812
813 /*
814 * index -1 means the kernel should try to find and
815 * allocate an empty descriptor:
816 */
817 if (idx == -1) {
818 idx = get_free_idx();
819 if (idx < 0)
820 return idx;
821 if (put_user(idx, &u_info->entry_number))
822 return -EFAULT;
823 }
824
825 if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
826 return -EINVAL;
827
828 desc = t->tls_array + idx - GDT_ENTRY_TLS_MIN;
829
830 /*
831 * We must not get preempted while modifying the TLS.
832 */
833 cpu = get_cpu();
834
835 if (LDT_empty(&info)) {
836 desc->a = 0;
837 desc->b = 0;
838 } else {
839 desc->a = LDT_entry_a(&info);
840 desc->b = LDT_entry_b(&info);
841 }
842 load_TLS(t, cpu);
843
844 put_cpu();
845
846 return 0;
847}
848
849/*
850 * Get the current Thread-Local Storage area:
851 */
852
853#define GET_BASE(desc) ( \
854 (((desc)->a >> 16) & 0x0000ffff) | \
855 (((desc)->b << 16) & 0x00ff0000) | \
856 ( (desc)->b & 0xff000000) )
857
858#define GET_LIMIT(desc) ( \
859 ((desc)->a & 0x0ffff) | \
860 ((desc)->b & 0xf0000) )
861
862#define GET_32BIT(desc) (((desc)->b >> 22) & 1)
863#define GET_CONTENTS(desc) (((desc)->b >> 10) & 3)
864#define GET_WRITABLE(desc) (((desc)->b >> 9) & 1)
865#define GET_LIMIT_PAGES(desc) (((desc)->b >> 23) & 1)
866#define GET_PRESENT(desc) (((desc)->b >> 15) & 1)
867#define GET_USEABLE(desc) (((desc)->b >> 20) & 1)
868
869asmlinkage int sys_get_thread_area(struct user_desc __user *u_info)
870{
871 struct user_desc info;
872 struct desc_struct *desc;
873 int idx;
874
875 if (get_user(idx, &u_info->entry_number))
876 return -EFAULT;
877 if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
878 return -EINVAL;
879
Blaisorblade71ae18e2005-07-27 11:45:18 -0700880 memset(&info, 0, sizeof(info));
881
Linus Torvalds1da177e2005-04-16 15:20:36 -0700882 desc = current->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
883
884 info.entry_number = idx;
885 info.base_addr = GET_BASE(desc);
886 info.limit = GET_LIMIT(desc);
887 info.seg_32bit = GET_32BIT(desc);
888 info.contents = GET_CONTENTS(desc);
889 info.read_exec_only = !GET_WRITABLE(desc);
890 info.limit_in_pages = GET_LIMIT_PAGES(desc);
891 info.seg_not_present = !GET_PRESENT(desc);
892 info.useable = GET_USEABLE(desc);
893
894 if (copy_to_user(u_info, &info, sizeof(info)))
895 return -EFAULT;
896 return 0;
897}
898
899unsigned long arch_align_stack(unsigned long sp)
900{
901 if (randomize_va_space)
902 sp -= get_random_int() % 8192;
903 return sp & ~0xf;
904}