x86: merge process.c a bit
[deliverable/linux.git] / arch / x86 / kernel / process_32.c
CommitLineData
1da177e4 1/*
1da177e4
LT
2 * Copyright (C) 1995 Linus Torvalds
3 *
4 * Pentium III FXSR, SSE support
5 * Gareth Hughes <gareth@valinux.com>, May 2000
6 */
7
8/*
9 * This file handles the architecture-dependent parts of process handling..
10 */
11
12#include <stdarg.h>
13
5c79d2a5 14#include <linux/stackprotector.h>
f3705136 15#include <linux/cpu.h>
1da177e4
LT
16#include <linux/errno.h>
17#include <linux/sched.h>
18#include <linux/fs.h>
19#include <linux/kernel.h>
20#include <linux/mm.h>
21#include <linux/elfcore.h>
22#include <linux/smp.h>
1da177e4
LT
23#include <linux/stddef.h>
24#include <linux/slab.h>
25#include <linux/vmalloc.h>
26#include <linux/user.h>
1da177e4 27#include <linux/interrupt.h>
1da177e4
LT
28#include <linux/utsname.h>
29#include <linux/delay.h>
30#include <linux/reboot.h>
31#include <linux/init.h>
32#include <linux/mc146818rtc.h>
33#include <linux/module.h>
34#include <linux/kallsyms.h>
35#include <linux/ptrace.h>
c16b63e0 36#include <linux/personality.h>
74167347 37#include <linux/tick.h>
7c3576d2 38#include <linux/percpu.h>
529e25f6 39#include <linux/prctl.h>
90f7d25c 40#include <linux/dmi.h>
8b96f011 41#include <linux/ftrace.h>
befa9e78
JSR
42#include <linux/uaccess.h>
43#include <linux/io.h>
44#include <linux/kdebug.h>
1da177e4 45
1da177e4
LT
46#include <asm/pgtable.h>
47#include <asm/system.h>
1da177e4
LT
48#include <asm/ldt.h>
49#include <asm/processor.h>
50#include <asm/i387.h>
1da177e4
LT
51#include <asm/desc.h>
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>
1eda8149 60#include <asm/idle.h>
bbc1f698 61#include <asm/syscalls.h>
bf53de90 62#include <asm/ds.h>
f3705136 63
1da177e4
LT
64asmlinkage void ret_from_fork(void) __asm__("ret_from_fork");
65
7c3576d2
JF
66DEFINE_PER_CPU(struct task_struct *, current_task) = &init_task;
67EXPORT_PER_CPU_SYMBOL(current_task);
68
1da177e4
LT
69/*
70 * Return saved PC of a blocked thread.
71 */
72unsigned long thread_saved_pc(struct task_struct *tsk)
73{
faca6227 74 return ((unsigned long *)tsk->thread.sp)[3];
1da177e4
LT
75}
76
913da64b
AN
77#ifndef CONFIG_SMP
78static inline void play_dead(void)
79{
80 BUG();
81}
82#endif
83
1da177e4
LT
84/*
85 * The idle thread. There's no useful work to be
86 * done, so just try to conserve power and have a
87 * low exit latency (ie sit in a loop waiting for
88 * somebody to say that they'd like to reschedule)
89 */
f3705136 90void cpu_idle(void)
1da177e4 91{
5bfb5d69 92 int cpu = smp_processor_id();
f3705136 93
5c79d2a5
TH
94 /*
95 * If we're the non-boot CPU, nothing set the stack canary up
96 * for us. CPU0 already has it initialized but no harm in
97 * doing it again. This is a good place for updating it, as
98 * we wont ever return from this function (so the invalid
99 * canaries already on the stack wont ever trigger).
100 */
101 boot_init_stack_canary();
102
495ab9c0 103 current_thread_info()->status |= TS_POLLING;
64c7c8f8 104
1da177e4
LT
105 /* endless idle loop with no priority at all */
106 while (1) {
b8f8c3cf 107 tick_nohz_stop_sched_tick(1);
1da177e4 108 while (!need_resched()) {
1da177e4 109
f1d1a842 110 check_pgt_cache();
1da177e4 111 rmb();
1da177e4 112
f3705136
ZM
113 if (cpu_is_offline(cpu))
114 play_dead();
115
7f424a8b 116 local_irq_disable();
6cd8a4bb
SR
117 /* Don't trace irqs off for idle */
118 stop_critical_timings();
6ddd2a27 119 pm_idle();
6cd8a4bb 120 start_critical_timings();
1da177e4 121 }
74167347 122 tick_nohz_restart_sched_tick();
5bfb5d69 123 preempt_enable_no_resched();
1da177e4 124 schedule();
5bfb5d69 125 preempt_disable();
1da177e4
LT
126 }
127}
128
e2ce07c8 129void __show_regs(struct pt_regs *regs, int all)
1da177e4
LT
130{
131 unsigned long cr0 = 0L, cr2 = 0L, cr3 = 0L, cr4 = 0L;
bb1995d5 132 unsigned long d0, d1, d2, d3, d6, d7;
65ea5b03 133 unsigned long sp;
9d975ebd 134 unsigned short ss, gs;
90f7d25c 135 const char *board;
9d975ebd
PE
136
137 if (user_mode_vm(regs)) {
65ea5b03
PA
138 sp = regs->sp;
139 ss = regs->ss & 0xffff;
d9a89a26 140 gs = get_user_gs(regs);
9d975ebd 141 } else {
65ea5b03 142 sp = (unsigned long) (&regs->sp);
9d975ebd
PE
143 savesegment(ss, ss);
144 savesegment(gs, gs);
145 }
1da177e4
LT
146
147 printk("\n");
90f7d25c
AV
148
149 board = dmi_get_system_info(DMI_PRODUCT_NAME);
150 if (!board)
151 board = "";
152 printk("Pid: %d, comm: %s %s (%s %.*s) %s\n",
60812a4a 153 task_pid_nr(current), current->comm,
9d975ebd
PE
154 print_tainted(), init_utsname()->release,
155 (int)strcspn(init_utsname()->version, " "),
90f7d25c 156 init_utsname()->version, board);
9d975ebd
PE
157
158 printk("EIP: %04x:[<%08lx>] EFLAGS: %08lx CPU: %d\n",
92bc2056 159 (u16)regs->cs, regs->ip, regs->flags,
9d975ebd 160 smp_processor_id());
65ea5b03 161 print_symbol("EIP is at %s\n", regs->ip);
1da177e4 162
1da177e4 163 printk("EAX: %08lx EBX: %08lx ECX: %08lx EDX: %08lx\n",
65ea5b03 164 regs->ax, regs->bx, regs->cx, regs->dx);
9d975ebd 165 printk("ESI: %08lx EDI: %08lx EBP: %08lx ESP: %08lx\n",
65ea5b03 166 regs->si, regs->di, regs->bp, sp);
9d975ebd 167 printk(" DS: %04x ES: %04x FS: %04x GS: %04x SS: %04x\n",
92bc2056 168 (u16)regs->ds, (u16)regs->es, (u16)regs->fs, gs, ss);
9d975ebd
PE
169
170 if (!all)
171 return;
1da177e4 172
4bb0d3ec
ZA
173 cr0 = read_cr0();
174 cr2 = read_cr2();
175 cr3 = read_cr3();
ff6e8c0d 176 cr4 = read_cr4_safe();
9d975ebd
PE
177 printk("CR0: %08lx CR2: %08lx CR3: %08lx CR4: %08lx\n",
178 cr0, cr2, cr3, cr4);
bb1995d5
AS
179
180 get_debugreg(d0, 0);
181 get_debugreg(d1, 1);
182 get_debugreg(d2, 2);
183 get_debugreg(d3, 3);
184 printk("DR0: %08lx DR1: %08lx DR2: %08lx DR3: %08lx\n",
185 d0, d1, d2, d3);
9d975ebd 186
bb1995d5
AS
187 get_debugreg(d6, 6);
188 get_debugreg(d7, 7);
9d975ebd
PE
189 printk("DR6: %08lx DR7: %08lx\n",
190 d6, d7);
191}
bb1995d5 192
9d975ebd
PE
193void show_regs(struct pt_regs *regs)
194{
e2ce07c8 195 __show_regs(regs, 1);
5bc27dc2 196 show_trace(NULL, regs, &regs->sp, regs->bp);
1da177e4
LT
197}
198
199/*
65ea5b03
PA
200 * This gets run with %bx containing the
201 * function to call, and %dx containing
1da177e4
LT
202 * the "args".
203 */
204extern void kernel_thread_helper(void);
1da177e4
LT
205
206/*
207 * Create a kernel thread
208 */
befa9e78 209int kernel_thread(int (*fn)(void *), void *arg, unsigned long flags)
1da177e4
LT
210{
211 struct pt_regs regs;
212
213 memset(&regs, 0, sizeof(regs));
214
65ea5b03
PA
215 regs.bx = (unsigned long) fn;
216 regs.dx = (unsigned long) arg;
1da177e4 217
65ea5b03
PA
218 regs.ds = __USER_DS;
219 regs.es = __USER_DS;
220 regs.fs = __KERNEL_PERCPU;
60a5317f 221 regs.gs = __KERNEL_STACK_CANARY;
65ea5b03
PA
222 regs.orig_ax = -1;
223 regs.ip = (unsigned long) kernel_thread_helper;
224 regs.cs = __KERNEL_CS | get_kernel_rpl();
225 regs.flags = X86_EFLAGS_IF | X86_EFLAGS_SF | X86_EFLAGS_PF | 0x2;
1da177e4
LT
226
227 /* Ok, create the new process.. */
8cf2c519 228 return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, &regs, 0, NULL, NULL);
1da177e4 229}
129f6946 230EXPORT_SYMBOL(kernel_thread);
1da177e4 231
1da177e4
LT
232void release_thread(struct task_struct *dead_task)
233{
2684927c 234 BUG_ON(dead_task->mm);
1da177e4
LT
235 release_vm86_irqs(dead_task);
236}
237
238/*
239 * This gets called before we allocate a new thread and copy
240 * the current task into it.
241 */
242void prepare_to_copy(struct task_struct *tsk)
243{
244 unlazy_fpu(tsk);
245}
246
6f2c55b8 247int copy_thread(unsigned long clone_flags, unsigned long sp,
1da177e4 248 unsigned long unused,
befa9e78 249 struct task_struct *p, struct pt_regs *regs)
1da177e4 250{
befa9e78 251 struct pt_regs *childregs;
1da177e4
LT
252 struct task_struct *tsk;
253 int err;
254
07b047fc 255 childregs = task_pt_regs(p);
f48d9663 256 *childregs = *regs;
65ea5b03
PA
257 childregs->ax = 0;
258 childregs->sp = sp;
f48d9663 259
faca6227
PA
260 p->thread.sp = (unsigned long) childregs;
261 p->thread.sp0 = (unsigned long) (childregs+1);
1da177e4 262
faca6227 263 p->thread.ip = (unsigned long) ret_from_fork;
1da177e4 264
d9a89a26 265 task_user_gs(p) = get_user_gs(regs);
1da177e4
LT
266
267 tsk = current;
b3cf2576 268 if (unlikely(test_tsk_thread_flag(tsk, TIF_IO_BITMAP))) {
52978be6
AD
269 p->thread.io_bitmap_ptr = kmemdup(tsk->thread.io_bitmap_ptr,
270 IO_BITMAP_BYTES, GFP_KERNEL);
1da177e4
LT
271 if (!p->thread.io_bitmap_ptr) {
272 p->thread.io_bitmap_max = 0;
273 return -ENOMEM;
274 }
b3cf2576 275 set_tsk_thread_flag(p, TIF_IO_BITMAP);
1da177e4
LT
276 }
277
efd1ca52
RM
278 err = 0;
279
1da177e4
LT
280 /*
281 * Set a new TLS for the child thread?
282 */
efd1ca52
RM
283 if (clone_flags & CLONE_SETTLS)
284 err = do_set_thread_area(p, -1,
65ea5b03 285 (struct user_desc __user *)childregs->si, 0);
1da177e4 286
1da177e4
LT
287 if (err && p->thread.io_bitmap_ptr) {
288 kfree(p->thread.io_bitmap_ptr);
289 p->thread.io_bitmap_max = 0;
290 }
bf53de90
MM
291
292 ds_copy_thread(p, current);
293
294 clear_tsk_thread_flag(p, TIF_DEBUGCTLMSR);
295 p->thread.debugctlmsr = 0;
296
1da177e4
LT
297 return err;
298}
299
513ad84b
IM
300void
301start_thread(struct pt_regs *regs, unsigned long new_ip, unsigned long new_sp)
302{
d9a89a26 303 set_user_gs(regs, 0);
513ad84b
IM
304 regs->fs = 0;
305 set_fs(USER_DS);
306 regs->ds = __USER_DS;
307 regs->es = __USER_DS;
308 regs->ss = __USER_DS;
309 regs->cs = __USER_CS;
310 regs->ip = new_ip;
311 regs->sp = new_sp;
aa283f49
SS
312 /*
313 * Free the old FP and other extended state
314 */
315 free_thread_xstate(current);
513ad84b
IM
316}
317EXPORT_SYMBOL_GPL(start_thread);
318
1da177e4
LT
319
320/*
321 * switch_to(x,yn) should switch tasks from x to y.
322 *
323 * We fsave/fwait so that an exception goes off at the right time
324 * (as a call from the fsave or fwait in effect) rather than to
325 * the wrong process. Lazy FP saving no longer makes any sense
326 * with modern CPU's, and this simplifies a lot of things (SMP
327 * and UP become the same).
328 *
329 * NOTE! We used to use the x86 hardware context switching. The
330 * reason for not using it any more becomes apparent when you
331 * try to recover gracefully from saved state that is no longer
332 * valid (stale segment register values in particular). With the
333 * hardware task-switch, there is no way to fix up bad state in
334 * a reasonable manner.
335 *
336 * The fact that Intel documents the hardware task-switching to
337 * be slow is a fairly red herring - this code is not noticeably
338 * faster. However, there _is_ some room for improvement here,
339 * so the performance issues may eventually be a valid point.
340 * More important, however, is the fact that this allows us much
341 * more flexibility.
342 *
65ea5b03 343 * The return value (in %ax) will be the "prev" task after
1da177e4
LT
344 * the task-switch, and shows up in ret_from_fork in entry.S,
345 * for example.
346 */
8b96f011
FW
347__notrace_funcgraph struct task_struct *
348__switch_to(struct task_struct *prev_p, struct task_struct *next_p)
1da177e4
LT
349{
350 struct thread_struct *prev = &prev_p->thread,
351 *next = &next_p->thread;
352 int cpu = smp_processor_id();
353 struct tss_struct *tss = &per_cpu(init_tss, cpu);
354
355 /* never put a printk in __switch_to... printk() calls wake_up*() indirectly */
356
357 __unlazy_fpu(prev_p);
358
acc20761
CE
359
360 /* we're going to use this soon, after a few expensive things */
361 if (next_p->fpu_counter > 5)
61c4628b 362 prefetch(next->xstate);
acc20761 363
1da177e4 364 /*
e7a2ff59 365 * Reload esp0.
1da177e4 366 */
faca6227 367 load_sp0(tss, next);
1da177e4
LT
368
369 /*
464d1a78 370 * Save away %gs. No need to save %fs, as it was saved on the
f95d47ca
JF
371 * stack on entry. No need to save %es and %ds, as those are
372 * always kernel segments while inside the kernel. Doing this
373 * before setting the new TLS descriptors avoids the situation
374 * where we temporarily have non-reloadable segments in %fs
375 * and %gs. This could be an issue if the NMI handler ever
376 * used %fs or %gs (it does not today), or if the kernel is
377 * running inside of a hypervisor layer.
1da177e4 378 */
ccbeed3a 379 lazy_save_gs(prev->gs);
1da177e4
LT
380
381 /*
e7a2ff59 382 * Load the per-thread Thread-Local Storage descriptor.
1da177e4 383 */
e7a2ff59 384 load_TLS(next, cpu);
1da177e4 385
8b151144
ZA
386 /*
387 * Restore IOPL if needed. In normal use, the flags restore
388 * in the switch assembly will handle this. But if the kernel
389 * is running virtualized at a non-zero CPL, the popf will
390 * not restore flags, so it must be done in a separate step.
391 */
392 if (get_kernel_rpl() && unlikely(prev->iopl != next->iopl))
393 set_iopl_mask(next->iopl);
394
1da177e4 395 /*
b3cf2576 396 * Now maybe handle debug registers and/or IO bitmaps
1da177e4 397 */
cf99abac
AA
398 if (unlikely(task_thread_info(prev_p)->flags & _TIF_WORK_CTXSW_PREV ||
399 task_thread_info(next_p)->flags & _TIF_WORK_CTXSW_NEXT))
400 __switch_to_xtra(prev_p, next_p, tss);
ffaa8bd6 401
9226d125
ZA
402 /*
403 * Leave lazy mode, flushing any hypercalls made here.
404 * This must be done before restoring TLS segments so
405 * the GDT and LDT are properly updated, and must be
406 * done before math_state_restore, so the TS bit is up
407 * to date.
408 */
409 arch_leave_lazy_cpu_mode();
410
acc20761
CE
411 /* If the task has used fpu the last 5 timeslices, just do a full
412 * restore of the math state immediately to avoid the trap; the
413 * chances of needing FPU soon are obviously high now
870568b3
SS
414 *
415 * tsk_used_math() checks prevent calling math_state_restore(),
416 * which can sleep in the case of !tsk_used_math()
acc20761 417 */
870568b3 418 if (tsk_used_math(next_p) && next_p->fpu_counter > 5)
acc20761
CE
419 math_state_restore();
420
9226d125
ZA
421 /*
422 * Restore %gs if needed (which is common)
423 */
424 if (prev->gs | next->gs)
ccbeed3a 425 lazy_load_gs(next->gs);
9226d125 426
6dbde353 427 percpu_write(current_task, next_p);
9226d125 428
1da177e4
LT
429 return prev_p;
430}
431
b12bdaf1 432int sys_clone(struct pt_regs *regs)
1da177e4 433{
b12bdaf1
BG
434 unsigned long clone_flags;
435 unsigned long newsp;
436 int __user *parent_tidptr, *child_tidptr;
437
438 clone_flags = regs->bx;
439 newsp = regs->cx;
440 parent_tidptr = (int __user *)regs->dx;
441 child_tidptr = (int __user *)regs->di;
1da177e4 442 if (!newsp)
253f29a4
BG
443 newsp = regs->sp;
444 return do_fork(clone_flags, newsp, regs, 0, parent_tidptr, child_tidptr);
1da177e4
LT
445}
446
1da177e4
LT
447/*
448 * sys_execve() executes a new program.
449 */
b12bdaf1 450int sys_execve(struct pt_regs *regs)
1da177e4
LT
451{
452 int error;
befa9e78 453 char *filename;
1da177e4 454
b12bdaf1 455 filename = getname((char __user *) regs->bx);
1da177e4
LT
456 error = PTR_ERR(filename);
457 if (IS_ERR(filename))
458 goto out;
b12bdaf1
BG
459 error = do_execve(filename,
460 (char __user * __user *) regs->cx,
461 (char __user * __user *) regs->dx,
462 regs);
1da177e4 463 if (error == 0) {
1da177e4
LT
464 /* Make sure we don't return using sysenter.. */
465 set_thread_flag(TIF_IRET);
466 }
467 putname(filename);
468out:
469 return error;
470}
471
472#define top_esp (THREAD_SIZE - sizeof(unsigned long))
473#define top_ebp (THREAD_SIZE - 2*sizeof(unsigned long))
474
475unsigned long get_wchan(struct task_struct *p)
476{
65ea5b03 477 unsigned long bp, sp, ip;
1da177e4
LT
478 unsigned long stack_page;
479 int count = 0;
480 if (!p || p == current || p->state == TASK_RUNNING)
481 return 0;
65e0fdff 482 stack_page = (unsigned long)task_stack_page(p);
faca6227 483 sp = p->thread.sp;
65ea5b03 484 if (!stack_page || sp < stack_page || sp > top_esp+stack_page)
1da177e4 485 return 0;
65ea5b03
PA
486 /* include/asm-i386/system.h:switch_to() pushes bp last. */
487 bp = *(unsigned long *) sp;
1da177e4 488 do {
65ea5b03 489 if (bp < stack_page || bp > top_ebp+stack_page)
1da177e4 490 return 0;
65ea5b03
PA
491 ip = *(unsigned long *) (bp+4);
492 if (!in_sched_functions(ip))
493 return ip;
494 bp = *(unsigned long *) bp;
1da177e4
LT
495 } while (count++ < 16);
496 return 0;
497}
498
This page took 0.857745 seconds and 5 git commands to generate.