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