2 * Copyright (C) 1995 Linus Torvalds
4 * Pentium III FXSR, SSE support
5 * Gareth Hughes <gareth@valinux.com>, May 2000
9 * This file handles the architecture-dependent parts of process handling..
14 #include <linux/stackprotector.h>
15 #include <linux/cpu.h>
16 #include <linux/errno.h>
17 #include <linux/sched.h>
19 #include <linux/kernel.h>
21 #include <linux/elfcore.h>
22 #include <linux/smp.h>
23 #include <linux/stddef.h>
24 #include <linux/slab.h>
25 #include <linux/vmalloc.h>
26 #include <linux/user.h>
27 #include <linux/interrupt.h>
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>
36 #include <linux/random.h>
37 #include <linux/personality.h>
38 #include <linux/tick.h>
39 #include <linux/percpu.h>
40 #include <linux/prctl.h>
41 #include <linux/dmi.h>
42 #include <linux/ftrace.h>
43 #include <linux/uaccess.h>
45 #include <linux/kdebug.h>
47 #include <asm/pgtable.h>
48 #include <asm/system.h>
50 #include <asm/processor.h>
53 #ifdef CONFIG_MATH_EMULATION
54 #include <asm/math_emu.h>
57 #include <linux/err.h>
59 #include <asm/tlbflush.h>
62 #include <asm/syscalls.h>
65 asmlinkage
void ret_from_fork(void) __asm__("ret_from_fork");
67 DEFINE_PER_CPU(struct task_struct
*, current_task
) = &init_task
;
68 EXPORT_PER_CPU_SYMBOL(current_task
);
71 * Return saved PC of a blocked thread.
73 unsigned long thread_saved_pc(struct task_struct
*tsk
)
75 return ((unsigned long *)tsk
->thread
.sp
)[3];
79 static inline void play_dead(void)
86 * The idle thread. There's no useful work to be
87 * done, so just try to conserve power and have a
88 * low exit latency (ie sit in a loop waiting for
89 * somebody to say that they'd like to reschedule)
93 int cpu
= smp_processor_id();
96 * If we're the non-boot CPU, nothing set the stack canary up
97 * for us. CPU0 already has it initialized but no harm in
98 * doing it again. This is a good place for updating it, as
99 * we wont ever return from this function (so the invalid
100 * canaries already on the stack wont ever trigger).
102 boot_init_stack_canary();
104 current_thread_info()->status
|= TS_POLLING
;
106 /* endless idle loop with no priority at all */
108 tick_nohz_stop_sched_tick(1);
109 while (!need_resched()) {
114 if (cpu_is_offline(cpu
))
118 /* Don't trace irqs off for idle */
119 stop_critical_timings();
121 start_critical_timings();
123 tick_nohz_restart_sched_tick();
124 preempt_enable_no_resched();
130 void __show_regs(struct pt_regs
*regs
, int all
)
132 unsigned long cr0
= 0L, cr2
= 0L, cr3
= 0L, cr4
= 0L;
133 unsigned long d0
, d1
, d2
, d3
, d6
, d7
;
135 unsigned short ss
, gs
;
138 if (user_mode_vm(regs
)) {
140 ss
= regs
->ss
& 0xffff;
141 gs
= get_user_gs(regs
);
143 sp
= (unsigned long) (®s
->sp
);
150 board
= dmi_get_system_info(DMI_PRODUCT_NAME
);
153 printk("Pid: %d, comm: %s %s (%s %.*s) %s\n",
154 task_pid_nr(current
), current
->comm
,
155 print_tainted(), init_utsname()->release
,
156 (int)strcspn(init_utsname()->version
, " "),
157 init_utsname()->version
, board
);
159 printk("EIP: %04x:[<%08lx>] EFLAGS: %08lx CPU: %d\n",
160 (u16
)regs
->cs
, regs
->ip
, regs
->flags
,
162 print_symbol("EIP is at %s\n", regs
->ip
);
164 printk("EAX: %08lx EBX: %08lx ECX: %08lx EDX: %08lx\n",
165 regs
->ax
, regs
->bx
, regs
->cx
, regs
->dx
);
166 printk("ESI: %08lx EDI: %08lx EBP: %08lx ESP: %08lx\n",
167 regs
->si
, regs
->di
, regs
->bp
, sp
);
168 printk(" DS: %04x ES: %04x FS: %04x GS: %04x SS: %04x\n",
169 (u16
)regs
->ds
, (u16
)regs
->es
, (u16
)regs
->fs
, gs
, ss
);
177 cr4
= read_cr4_safe();
178 printk("CR0: %08lx CR2: %08lx CR3: %08lx CR4: %08lx\n",
185 printk("DR0: %08lx DR1: %08lx DR2: %08lx DR3: %08lx\n",
190 printk("DR6: %08lx DR7: %08lx\n",
194 void show_regs(struct pt_regs
*regs
)
196 __show_regs(regs
, 1);
197 show_trace(NULL
, regs
, ®s
->sp
, regs
->bp
);
201 * This gets run with %bx containing the
202 * function to call, and %dx containing
205 extern void kernel_thread_helper(void);
208 * Create a kernel thread
210 int kernel_thread(int (*fn
)(void *), void *arg
, unsigned long flags
)
214 memset(®s
, 0, sizeof(regs
));
216 regs
.bx
= (unsigned long) fn
;
217 regs
.dx
= (unsigned long) arg
;
221 regs
.fs
= __KERNEL_PERCPU
;
222 regs
.gs
= __KERNEL_STACK_CANARY
;
224 regs
.ip
= (unsigned long) kernel_thread_helper
;
225 regs
.cs
= __KERNEL_CS
| get_kernel_rpl();
226 regs
.flags
= X86_EFLAGS_IF
| X86_EFLAGS_SF
| X86_EFLAGS_PF
| 0x2;
228 /* Ok, create the new process.. */
229 return do_fork(flags
| CLONE_VM
| CLONE_UNTRACED
, 0, ®s
, 0, NULL
, NULL
);
231 EXPORT_SYMBOL(kernel_thread
);
233 void release_thread(struct task_struct
*dead_task
)
235 BUG_ON(dead_task
->mm
);
236 release_vm86_irqs(dead_task
);
240 * This gets called before we allocate a new thread and copy
241 * the current task into it.
243 void prepare_to_copy(struct task_struct
*tsk
)
248 int copy_thread(unsigned long clone_flags
, unsigned long sp
,
249 unsigned long unused
,
250 struct task_struct
*p
, struct pt_regs
*regs
)
252 struct pt_regs
*childregs
;
253 struct task_struct
*tsk
;
256 childregs
= task_pt_regs(p
);
261 p
->thread
.sp
= (unsigned long) childregs
;
262 p
->thread
.sp0
= (unsigned long) (childregs
+1);
264 p
->thread
.ip
= (unsigned long) ret_from_fork
;
266 task_user_gs(p
) = get_user_gs(regs
);
269 if (unlikely(test_tsk_thread_flag(tsk
, TIF_IO_BITMAP
))) {
270 p
->thread
.io_bitmap_ptr
= kmemdup(tsk
->thread
.io_bitmap_ptr
,
271 IO_BITMAP_BYTES
, GFP_KERNEL
);
272 if (!p
->thread
.io_bitmap_ptr
) {
273 p
->thread
.io_bitmap_max
= 0;
276 set_tsk_thread_flag(p
, TIF_IO_BITMAP
);
282 * Set a new TLS for the child thread?
284 if (clone_flags
& CLONE_SETTLS
)
285 err
= do_set_thread_area(p
, -1,
286 (struct user_desc __user
*)childregs
->si
, 0);
288 if (err
&& p
->thread
.io_bitmap_ptr
) {
289 kfree(p
->thread
.io_bitmap_ptr
);
290 p
->thread
.io_bitmap_max
= 0;
293 ds_copy_thread(p
, current
);
295 clear_tsk_thread_flag(p
, TIF_DEBUGCTLMSR
);
296 p
->thread
.debugctlmsr
= 0;
302 start_thread(struct pt_regs
*regs
, unsigned long new_ip
, unsigned long new_sp
)
304 set_user_gs(regs
, 0);
307 regs
->ds
= __USER_DS
;
308 regs
->es
= __USER_DS
;
309 regs
->ss
= __USER_DS
;
310 regs
->cs
= __USER_CS
;
314 * Free the old FP and other extended state
316 free_thread_xstate(current
);
318 EXPORT_SYMBOL_GPL(start_thread
);
322 * switch_to(x,yn) should switch tasks from x to y.
324 * We fsave/fwait so that an exception goes off at the right time
325 * (as a call from the fsave or fwait in effect) rather than to
326 * the wrong process. Lazy FP saving no longer makes any sense
327 * with modern CPU's, and this simplifies a lot of things (SMP
328 * and UP become the same).
330 * NOTE! We used to use the x86 hardware context switching. The
331 * reason for not using it any more becomes apparent when you
332 * try to recover gracefully from saved state that is no longer
333 * valid (stale segment register values in particular). With the
334 * hardware task-switch, there is no way to fix up bad state in
335 * a reasonable manner.
337 * The fact that Intel documents the hardware task-switching to
338 * be slow is a fairly red herring - this code is not noticeably
339 * faster. However, there _is_ some room for improvement here,
340 * so the performance issues may eventually be a valid point.
341 * More important, however, is the fact that this allows us much
344 * The return value (in %ax) will be the "prev" task after
345 * the task-switch, and shows up in ret_from_fork in entry.S,
348 __notrace_funcgraph
struct task_struct
*
349 __switch_to(struct task_struct
*prev_p
, struct task_struct
*next_p
)
351 struct thread_struct
*prev
= &prev_p
->thread
,
352 *next
= &next_p
->thread
;
353 int cpu
= smp_processor_id();
354 struct tss_struct
*tss
= &per_cpu(init_tss
, cpu
);
356 /* never put a printk in __switch_to... printk() calls wake_up*() indirectly */
358 __unlazy_fpu(prev_p
);
361 /* we're going to use this soon, after a few expensive things */
362 if (next_p
->fpu_counter
> 5)
363 prefetch(next
->xstate
);
371 * Save away %gs. No need to save %fs, as it was saved on the
372 * stack on entry. No need to save %es and %ds, as those are
373 * always kernel segments while inside the kernel. Doing this
374 * before setting the new TLS descriptors avoids the situation
375 * where we temporarily have non-reloadable segments in %fs
376 * and %gs. This could be an issue if the NMI handler ever
377 * used %fs or %gs (it does not today), or if the kernel is
378 * running inside of a hypervisor layer.
380 lazy_save_gs(prev
->gs
);
383 * Load the per-thread Thread-Local Storage descriptor.
388 * Restore IOPL if needed. In normal use, the flags restore
389 * in the switch assembly will handle this. But if the kernel
390 * is running virtualized at a non-zero CPL, the popf will
391 * not restore flags, so it must be done in a separate step.
393 if (get_kernel_rpl() && unlikely(prev
->iopl
!= next
->iopl
))
394 set_iopl_mask(next
->iopl
);
397 * Now maybe handle debug registers and/or IO bitmaps
399 if (unlikely(task_thread_info(prev_p
)->flags
& _TIF_WORK_CTXSW_PREV
||
400 task_thread_info(next_p
)->flags
& _TIF_WORK_CTXSW_NEXT
))
401 __switch_to_xtra(prev_p
, next_p
, tss
);
404 * Leave lazy mode, flushing any hypercalls made here.
405 * This must be done before restoring TLS segments so
406 * the GDT and LDT are properly updated, and must be
407 * done before math_state_restore, so the TS bit is up
410 arch_leave_lazy_cpu_mode();
412 /* If the task has used fpu the last 5 timeslices, just do a full
413 * restore of the math state immediately to avoid the trap; the
414 * chances of needing FPU soon are obviously high now
416 * tsk_used_math() checks prevent calling math_state_restore(),
417 * which can sleep in the case of !tsk_used_math()
419 if (tsk_used_math(next_p
) && next_p
->fpu_counter
> 5)
420 math_state_restore();
423 * Restore %gs if needed (which is common)
425 if (prev
->gs
| next
->gs
)
426 lazy_load_gs(next
->gs
);
428 percpu_write(current_task
, next_p
);
433 int sys_clone(struct pt_regs
*regs
)
435 unsigned long clone_flags
;
437 int __user
*parent_tidptr
, *child_tidptr
;
439 clone_flags
= regs
->bx
;
441 parent_tidptr
= (int __user
*)regs
->dx
;
442 child_tidptr
= (int __user
*)regs
->di
;
445 return do_fork(clone_flags
, newsp
, regs
, 0, parent_tidptr
, child_tidptr
);
449 * sys_execve() executes a new program.
451 int sys_execve(struct pt_regs
*regs
)
456 filename
= getname((char __user
*) regs
->bx
);
457 error
= PTR_ERR(filename
);
458 if (IS_ERR(filename
))
460 error
= do_execve(filename
,
461 (char __user
* __user
*) regs
->cx
,
462 (char __user
* __user
*) regs
->dx
,
465 /* Make sure we don't return using sysenter.. */
466 set_thread_flag(TIF_IRET
);
473 #define top_esp (THREAD_SIZE - sizeof(unsigned long))
474 #define top_ebp (THREAD_SIZE - 2*sizeof(unsigned long))
476 unsigned long get_wchan(struct task_struct
*p
)
478 unsigned long bp
, sp
, ip
;
479 unsigned long stack_page
;
481 if (!p
|| p
== current
|| p
->state
== TASK_RUNNING
)
483 stack_page
= (unsigned long)task_stack_page(p
);
485 if (!stack_page
|| sp
< stack_page
|| sp
> top_esp
+stack_page
)
487 /* include/asm-i386/system.h:switch_to() pushes bp last. */
488 bp
= *(unsigned long *) sp
;
490 if (bp
< stack_page
|| bp
> top_ebp
+stack_page
)
492 ip
= *(unsigned long *) (bp
+4);
493 if (!in_sched_functions(ip
))
495 bp
= *(unsigned long *) bp
;
496 } while (count
++ < 16);
500 unsigned long arch_align_stack(unsigned long sp
)
502 if (!(current
->personality
& ADDR_NO_RANDOMIZE
) && randomize_va_space
)
503 sp
-= get_random_int() % 8192;
507 unsigned long arch_randomize_brk(struct mm_struct
*mm
)
509 unsigned long range_end
= mm
->brk
+ 0x02000000;
510 return randomize_range(mm
->brk
, range_end
, 0) ? : mm
->brk
;