]> git.proxmox.com Git - mirror_ubuntu-jammy-kernel.git/blame - arch/i386/kernel/process.c
[PATCH] x86_64: stack unwinder crash fix
[mirror_ubuntu-jammy-kernel.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>
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>
59
1da177e4
LT
60asmlinkage 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);
129f6946 79EXPORT_SYMBOL(pm_idle);
1da177e4
LT
80static 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{
64c7c8f8
NP
102 local_irq_enable();
103
1da177e4 104 if (!hlt_counter && boot_cpu_data.hlt_works_ok) {
495ab9c0 105 current_thread_info()->status &= ~TS_POLLING;
64c7c8f8
NP
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 }
495ab9c0 114 current_thread_info()->status |= TS_POLLING;
1da177e4 115 } else {
64c7c8f8
NP
116 while (!need_resched())
117 cpu_relax();
1da177e4
LT
118 }
119}
129f6946
AD
120#ifdef CONFIG_APM_MODULE
121EXPORT_SYMBOL(default_idle);
122#endif
1da177e4
LT
123
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{
1da177e4
LT
131 local_irq_enable();
132
64c7c8f8
NP
133 asm volatile(
134 "2:"
135 "testl %0, %1;"
136 "rep; nop;"
137 "je 2b;"
138 : : "i"(_TIF_NEED_RESCHED), "m" (current_thread_info()->flags));
1da177e4
LT
139}
140
f3705136
ZM
141#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{
e1367daf
LS
146 /* This must be done before dead CPU ack */
147 cpu_exit_clear();
148 wbinvd();
149 mb();
f3705136
ZM
150 /* Ack it */
151 __get_cpu_var(cpu_state) = CPU_DEAD;
152
e1367daf
LS
153 /*
154 * With physical CPU hotplug, we should halt the cpu
155 */
f3705136 156 local_irq_disable();
e1367daf 157 while (1)
f2ab4461 158 halt();
f3705136
ZM
159}
160#else
161static inline void play_dead(void)
162{
163 BUG();
164}
165#endif /* CONFIG_HOTPLUG_CPU */
166
1da177e4
LT
167/*
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 */
f3705136 173void cpu_idle(void)
1da177e4 174{
5bfb5d69 175 int cpu = smp_processor_id();
f3705136 176
495ab9c0 177 current_thread_info()->status |= TS_POLLING;
64c7c8f8 178
1da177e4
LT
179 /* 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
f3705136
ZM
193 if (cpu_is_offline(cpu))
194 play_dead();
195
1da177e4
LT
196 __get_cpu_var(irq_stat).idle_timestamp = jiffies;
197 idle();
198 }
5bfb5d69 199 preempt_enable_no_resched();
1da177e4 200 schedule();
5bfb5d69 201 preempt_disable();
1da177e4
LT
202 }
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).
991528d7
VP
239 *
240 * New with Core Duo processors, MWAIT can take some hints based on CPU
241 * capability.
1da177e4 242 */
991528d7 243void mwait_idle_with_hints(unsigned long eax, unsigned long ecx)
1da177e4 244{
991528d7 245 if (!need_resched()) {
64c7c8f8
NP
246 __monitor((void *)&current_thread_info()->flags, 0, 0);
247 smp_mb();
991528d7
VP
248 if (!need_resched())
249 __mwait(eax, ecx);
1da177e4
LT
250 }
251}
252
991528d7
VP
253/* Default MONITOR/MWAIT with no hints, used for default C1 state */
254static void mwait_idle(void)
255{
256 local_irq_enable();
257 while (!need_resched())
258 mwait_idle_with_hints(0, 0);
259}
260
0bb3184d 261void __devinit select_idle_routine(const struct cpuinfo_x86 *c)
1da177e4
LT
262{
263 if (cpu_has(c, X86_FEATURE_MWAIT)) {
264 printk("monitor/mwait feature present.\n");
265 /*
266 * Skip, if setup has overridden idle.
267 * One CPU supports mwait => All CPUs supports mwait
268 */
269 if (!pm_idle) {
270 printk("using mwait in idle threads.\n");
271 pm_idle = mwait_idle;
272 }
273 }
274}
275
276static int __init idle_setup (char *str)
277{
278 if (!strncmp(str, "poll", 4)) {
279 printk("using polling idle threads.\n");
280 pm_idle = poll_idle;
281#ifdef CONFIG_X86_SMP
282 if (smp_num_siblings > 1)
283 printk("WARNING: polling idle and HT enabled, performance may degrade.\n");
284#endif
285 } else if (!strncmp(str, "halt", 4)) {
286 printk("using halt in idle threads.\n");
287 pm_idle = default_idle;
288 }
289
290 boot_option_idle_override = 1;
291 return 1;
292}
293
294__setup("idle=", idle_setup);
295
296void show_regs(struct pt_regs * regs)
297{
298 unsigned long cr0 = 0L, cr2 = 0L, cr3 = 0L, cr4 = 0L;
299
300 printk("\n");
301 printk("Pid: %d, comm: %20s\n", current->pid, current->comm);
302 printk("EIP: %04x:[<%08lx>] CPU: %d\n",0xffff & regs->xcs,regs->eip, smp_processor_id());
303 print_symbol("EIP is at %s\n", regs->eip);
304
db753bdf 305 if (user_mode_vm(regs))
1da177e4 306 printk(" ESP: %04x:%08lx",0xffff & regs->xss,regs->esp);
b53e8f68 307 printk(" EFLAGS: %08lx %s (%s %.*s)\n",
96b644bd
SH
308 regs->eflags, print_tainted(), init_utsname()->release,
309 (int)strcspn(init_utsname()->version, " "),
310 init_utsname()->version);
1da177e4
LT
311 printk("EAX: %08lx EBX: %08lx ECX: %08lx EDX: %08lx\n",
312 regs->eax,regs->ebx,regs->ecx,regs->edx);
313 printk("ESI: %08lx EDI: %08lx EBP: %08lx",
314 regs->esi, regs->edi, regs->ebp);
315 printk(" DS: %04x ES: %04x\n",
316 0xffff & regs->xds,0xffff & regs->xes);
317
4bb0d3ec
ZA
318 cr0 = read_cr0();
319 cr2 = read_cr2();
320 cr3 = read_cr3();
ff6e8c0d 321 cr4 = read_cr4_safe();
1da177e4 322 printk("CR0: %08lx CR2: %08lx CR3: %08lx CR4: %08lx\n", cr0, cr2, cr3, cr4);
176a2718 323 show_trace(NULL, regs, &regs->esp);
1da177e4
LT
324}
325
326/*
327 * This gets run with %ebx containing the
328 * function to call, and %edx containing
329 * the "args".
330 */
331extern void kernel_thread_helper(void);
1da177e4
LT
332
333/*
334 * Create a kernel thread
335 */
336int kernel_thread(int (*fn)(void *), void * arg, unsigned long flags)
337{
338 struct pt_regs regs;
339
340 memset(&regs, 0, sizeof(regs));
341
342 regs.ebx = (unsigned long) fn;
343 regs.edx = (unsigned long) arg;
344
345 regs.xds = __USER_DS;
346 regs.xes = __USER_DS;
347 regs.orig_eax = -1;
348 regs.eip = (unsigned long) kernel_thread_helper;
78be3706 349 regs.xcs = __KERNEL_CS | get_kernel_rpl();
1da177e4
LT
350 regs.eflags = X86_EFLAGS_IF | X86_EFLAGS_SF | X86_EFLAGS_PF | 0x2;
351
352 /* Ok, create the new process.. */
8cf2c519 353 return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, &regs, 0, NULL, NULL);
1da177e4 354}
129f6946 355EXPORT_SYMBOL(kernel_thread);
1da177e4
LT
356
357/*
358 * Free current thread data structures etc..
359 */
360void exit_thread(void)
361{
1da177e4 362 /* The process may have allocated an io port bitmap... nuke it. */
b3cf2576
SE
363 if (unlikely(test_thread_flag(TIF_IO_BITMAP))) {
364 struct task_struct *tsk = current;
365 struct thread_struct *t = &tsk->thread;
1da177e4
LT
366 int cpu = get_cpu();
367 struct tss_struct *tss = &per_cpu(init_tss, cpu);
368
369 kfree(t->io_bitmap_ptr);
370 t->io_bitmap_ptr = NULL;
b3cf2576 371 clear_thread_flag(TIF_IO_BITMAP);
1da177e4
LT
372 /*
373 * Careful, clear this in the TSS too:
374 */
375 memset(tss->io_bitmap, 0xff, tss->io_bitmap_max);
376 t->io_bitmap_max = 0;
377 tss->io_bitmap_owner = NULL;
378 tss->io_bitmap_max = 0;
379 tss->io_bitmap_base = INVALID_IO_BITMAP_OFFSET;
380 put_cpu();
381 }
382}
383
384void flush_thread(void)
385{
386 struct task_struct *tsk = current;
387
388 memset(tsk->thread.debugreg, 0, sizeof(unsigned long)*8);
389 memset(tsk->thread.tls_array, 0, sizeof(tsk->thread.tls_array));
b3cf2576 390 clear_tsk_thread_flag(tsk, TIF_DEBUG);
1da177e4
LT
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{
2684927c 400 BUG_ON(dead_task->mm);
1da177e4
LT
401 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
07b047fc 421 childregs = task_pt_regs(p);
f48d9663
AN
422 *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);
1da177e4
LT
428
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;
b3cf2576 435 if (unlikely(test_tsk_thread_flag(tsk, TIF_IO_BITMAP))) {
52978be6
AD
436 p->thread.io_bitmap_ptr = kmemdup(tsk->thread.io_bitmap_ptr,
437 IO_BITMAP_BYTES, GFP_KERNEL);
1da177e4
LT
438 if (!p->thread.io_bitmap_ptr) {
439 p->thread.io_bitmap_max = 0;
440 return -ENOMEM;
441 }
b3cf2576 442 set_tsk_thread_flag(p, TIF_IO_BITMAP);
1da177e4
LT
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}
129f6946 519EXPORT_SYMBOL(dump_thread);
1da177e4
LT
520
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{
07b047fc 526 struct pt_regs ptregs = *task_pt_regs(tsk);
1da177e4
LT
527 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
b3cf2576
SE
537static noinline void __switch_to_xtra(struct task_struct *next_p,
538 struct tss_struct *tss)
1da177e4 539{
b3cf2576
SE
540 struct thread_struct *next;
541
542 next = &next_p->thread;
543
544 if (test_tsk_thread_flag(next_p, TIF_DEBUG)) {
545 set_debugreg(next->debugreg[0], 0);
546 set_debugreg(next->debugreg[1], 1);
547 set_debugreg(next->debugreg[2], 2);
548 set_debugreg(next->debugreg[3], 3);
549 /* no 4 and 5 */
550 set_debugreg(next->debugreg[6], 6);
551 set_debugreg(next->debugreg[7], 7);
552 }
553
554 if (!test_tsk_thread_flag(next_p, TIF_IO_BITMAP)) {
1da177e4
LT
555 /*
556 * Disable the bitmap via an invalid offset. We still cache
557 * the previous bitmap owner and the IO bitmap contents:
558 */
559 tss->io_bitmap_base = INVALID_IO_BITMAP_OFFSET;
560 return;
561 }
b3cf2576 562
1da177e4
LT
563 if (likely(next == tss->io_bitmap_owner)) {
564 /*
565 * Previous owner of the bitmap (hence the bitmap content)
566 * matches the next task, we dont have to do anything but
567 * to set a valid offset in the TSS:
568 */
569 tss->io_bitmap_base = IO_BITMAP_OFFSET;
570 return;
571 }
572 /*
573 * Lazy TSS's I/O bitmap copy. We set an invalid offset here
574 * and we let the task to get a GPF in case an I/O instruction
575 * is performed. The handler of the GPF will verify that the
576 * faulting task has a valid I/O bitmap and, it true, does the
577 * real copy and restart the instruction. This will save us
578 * redundant copies when the currently switched task does not
579 * perform any I/O during its timeslice.
580 */
581 tss->io_bitmap_base = INVALID_IO_BITMAP_OFFSET_LAZY;
582}
1da177e4 583
ffaa8bd6
AA
584/*
585 * This function selects if the context switch from prev to next
586 * has to tweak the TSC disable bit in the cr4.
587 */
588static inline void disable_tsc(struct task_struct *prev_p,
589 struct task_struct *next_p)
590{
591 struct thread_info *prev, *next;
592
593 /*
594 * gcc should eliminate the ->thread_info dereference if
595 * has_secure_computing returns 0 at compile time (SECCOMP=n).
596 */
06b425d8
AV
597 prev = task_thread_info(prev_p);
598 next = task_thread_info(next_p);
ffaa8bd6
AA
599
600 if (has_secure_computing(prev) || has_secure_computing(next)) {
601 /* slow path here */
602 if (has_secure_computing(prev) &&
603 !has_secure_computing(next)) {
604 write_cr4(read_cr4() & ~X86_CR4_TSD);
605 } else if (!has_secure_computing(prev) &&
606 has_secure_computing(next))
607 write_cr4(read_cr4() | X86_CR4_TSD);
608 }
609}
610
1da177e4
LT
611/*
612 * switch_to(x,yn) should switch tasks from x to y.
613 *
614 * We fsave/fwait so that an exception goes off at the right time
615 * (as a call from the fsave or fwait in effect) rather than to
616 * the wrong process. Lazy FP saving no longer makes any sense
617 * with modern CPU's, and this simplifies a lot of things (SMP
618 * and UP become the same).
619 *
620 * NOTE! We used to use the x86 hardware context switching. The
621 * reason for not using it any more becomes apparent when you
622 * try to recover gracefully from saved state that is no longer
623 * valid (stale segment register values in particular). With the
624 * hardware task-switch, there is no way to fix up bad state in
625 * a reasonable manner.
626 *
627 * The fact that Intel documents the hardware task-switching to
628 * be slow is a fairly red herring - this code is not noticeably
629 * faster. However, there _is_ some room for improvement here,
630 * so the performance issues may eventually be a valid point.
631 * More important, however, is the fact that this allows us much
632 * more flexibility.
633 *
634 * The return value (in %eax) will be the "prev" task after
635 * the task-switch, and shows up in ret_from_fork in entry.S,
636 * for example.
637 */
638struct task_struct fastcall * __switch_to(struct task_struct *prev_p, struct task_struct *next_p)
639{
640 struct thread_struct *prev = &prev_p->thread,
641 *next = &next_p->thread;
642 int cpu = smp_processor_id();
643 struct tss_struct *tss = &per_cpu(init_tss, cpu);
644
645 /* never put a printk in __switch_to... printk() calls wake_up*() indirectly */
646
647 __unlazy_fpu(prev_p);
648
649 /*
e7a2ff59 650 * Reload esp0.
1da177e4
LT
651 */
652 load_esp0(tss, next);
653
654 /*
e7a2ff59
ZA
655 * Save away %fs and %gs. No need to save %es and %ds, as
656 * those are always kernel segments while inside the kernel.
657 * Doing this before setting the new TLS descriptors avoids
658 * the situation where we temporarily have non-reloadable
659 * segments in %fs and %gs. This could be an issue if the
660 * NMI handler ever used %fs or %gs (it does not today), or
661 * if the kernel is running inside of a hypervisor layer.
1da177e4 662 */
e7a2ff59
ZA
663 savesegment(fs, prev->fs);
664 savesegment(gs, prev->gs);
1da177e4
LT
665
666 /*
e7a2ff59 667 * Load the per-thread Thread-Local Storage descriptor.
1da177e4 668 */
e7a2ff59 669 load_TLS(next, cpu);
1da177e4
LT
670
671 /*
672 * Restore %fs and %gs if needed.
b339a18b
LT
673 *
674 * Glibc normally makes %fs be zero, and %gs is one of
675 * the TLS segments.
1da177e4 676 */
b339a18b 677 if (unlikely(prev->fs | next->fs))
1da177e4 678 loadsegment(fs, next->fs);
b339a18b
LT
679
680 if (prev->gs | next->gs)
1da177e4 681 loadsegment(gs, next->gs);
1da177e4 682
a5201129
ZA
683 /*
684 * Restore IOPL if needed.
685 */
686 if (unlikely(prev->iopl != next->iopl))
687 set_iopl_mask(next->iopl);
688
1da177e4 689 /*
b3cf2576 690 * Now maybe handle debug registers and/or IO bitmaps
1da177e4 691 */
facf0147
CE
692 if (unlikely((task_thread_info(next_p)->flags & _TIF_WORK_CTXSW)
693 || test_tsk_thread_flag(prev_p, TIF_IO_BITMAP)))
b3cf2576 694 __switch_to_xtra(next_p, tss);
1da177e4 695
ffaa8bd6
AA
696 disable_tsc(prev_p, next_p);
697
1da177e4
LT
698 return prev_p;
699}
700
701asmlinkage int sys_fork(struct pt_regs regs)
702{
703 return do_fork(SIGCHLD, regs.esp, &regs, 0, NULL, NULL);
704}
705
706asmlinkage int sys_clone(struct pt_regs regs)
707{
708 unsigned long clone_flags;
709 unsigned long newsp;
710 int __user *parent_tidptr, *child_tidptr;
711
712 clone_flags = regs.ebx;
713 newsp = regs.ecx;
714 parent_tidptr = (int __user *)regs.edx;
715 child_tidptr = (int __user *)regs.edi;
716 if (!newsp)
717 newsp = regs.esp;
718 return do_fork(clone_flags, newsp, &regs, 0, parent_tidptr, child_tidptr);
719}
720
721/*
722 * This is trivial, and on the face of it looks like it
723 * could equally well be done in user mode.
724 *
725 * Not so, for quite unobvious reasons - register pressure.
726 * In user mode vfork() cannot have a stack frame, and if
727 * done by calling the "clone()" system call directly, you
728 * do not have enough call-clobbered registers to hold all
729 * the information you need.
730 */
731asmlinkage int sys_vfork(struct pt_regs regs)
732{
733 return do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, regs.esp, &regs, 0, NULL, NULL);
734}
735
736/*
737 * sys_execve() executes a new program.
738 */
739asmlinkage int sys_execve(struct pt_regs regs)
740{
741 int error;
742 char * filename;
743
744 filename = getname((char __user *) regs.ebx);
745 error = PTR_ERR(filename);
746 if (IS_ERR(filename))
747 goto out;
748 error = do_execve(filename,
749 (char __user * __user *) regs.ecx,
750 (char __user * __user *) regs.edx,
751 &regs);
752 if (error == 0) {
753 task_lock(current);
754 current->ptrace &= ~PT_DTRACE;
755 task_unlock(current);
756 /* Make sure we don't return using sysenter.. */
757 set_thread_flag(TIF_IRET);
758 }
759 putname(filename);
760out:
761 return error;
762}
763
764#define top_esp (THREAD_SIZE - sizeof(unsigned long))
765#define top_ebp (THREAD_SIZE - 2*sizeof(unsigned long))
766
767unsigned long get_wchan(struct task_struct *p)
768{
769 unsigned long ebp, esp, eip;
770 unsigned long stack_page;
771 int count = 0;
772 if (!p || p == current || p->state == TASK_RUNNING)
773 return 0;
65e0fdff 774 stack_page = (unsigned long)task_stack_page(p);
1da177e4
LT
775 esp = p->thread.esp;
776 if (!stack_page || esp < stack_page || esp > top_esp+stack_page)
777 return 0;
778 /* include/asm-i386/system.h:switch_to() pushes ebp last. */
779 ebp = *(unsigned long *) esp;
780 do {
781 if (ebp < stack_page || ebp > top_ebp+stack_page)
782 return 0;
783 eip = *(unsigned long *) (ebp+4);
784 if (!in_sched_functions(eip))
785 return eip;
786 ebp = *(unsigned long *) ebp;
787 } while (count++ < 16);
788 return 0;
789}
790
791/*
792 * sys_alloc_thread_area: get a yet unused TLS descriptor index.
793 */
794static int get_free_idx(void)
795{
796 struct thread_struct *t = &current->thread;
797 int idx;
798
799 for (idx = 0; idx < GDT_ENTRY_TLS_ENTRIES; idx++)
800 if (desc_empty(t->tls_array + idx))
801 return idx + GDT_ENTRY_TLS_MIN;
802 return -ESRCH;
803}
804
805/*
806 * Set a given TLS descriptor:
807 */
808asmlinkage int sys_set_thread_area(struct user_desc __user *u_info)
809{
810 struct thread_struct *t = &current->thread;
811 struct user_desc info;
812 struct desc_struct *desc;
813 int cpu, idx;
814
815 if (copy_from_user(&info, u_info, sizeof(info)))
816 return -EFAULT;
817 idx = info.entry_number;
818
819 /*
820 * index -1 means the kernel should try to find and
821 * allocate an empty descriptor:
822 */
823 if (idx == -1) {
824 idx = get_free_idx();
825 if (idx < 0)
826 return idx;
827 if (put_user(idx, &u_info->entry_number))
828 return -EFAULT;
829 }
830
831 if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
832 return -EINVAL;
833
834 desc = t->tls_array + idx - GDT_ENTRY_TLS_MIN;
835
836 /*
837 * We must not get preempted while modifying the TLS.
838 */
839 cpu = get_cpu();
840
841 if (LDT_empty(&info)) {
842 desc->a = 0;
843 desc->b = 0;
844 } else {
845 desc->a = LDT_entry_a(&info);
846 desc->b = LDT_entry_b(&info);
847 }
848 load_TLS(t, cpu);
849
850 put_cpu();
851
852 return 0;
853}
854
855/*
856 * Get the current Thread-Local Storage area:
857 */
858
859#define GET_BASE(desc) ( \
860 (((desc)->a >> 16) & 0x0000ffff) | \
861 (((desc)->b << 16) & 0x00ff0000) | \
862 ( (desc)->b & 0xff000000) )
863
864#define GET_LIMIT(desc) ( \
865 ((desc)->a & 0x0ffff) | \
866 ((desc)->b & 0xf0000) )
867
868#define GET_32BIT(desc) (((desc)->b >> 22) & 1)
869#define GET_CONTENTS(desc) (((desc)->b >> 10) & 3)
870#define GET_WRITABLE(desc) (((desc)->b >> 9) & 1)
871#define GET_LIMIT_PAGES(desc) (((desc)->b >> 23) & 1)
872#define GET_PRESENT(desc) (((desc)->b >> 15) & 1)
873#define GET_USEABLE(desc) (((desc)->b >> 20) & 1)
874
875asmlinkage int sys_get_thread_area(struct user_desc __user *u_info)
876{
877 struct user_desc info;
878 struct desc_struct *desc;
879 int idx;
880
881 if (get_user(idx, &u_info->entry_number))
882 return -EFAULT;
883 if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
884 return -EINVAL;
885
71ae18ec
PBG
886 memset(&info, 0, sizeof(info));
887
1da177e4
LT
888 desc = current->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
889
890 info.entry_number = idx;
891 info.base_addr = GET_BASE(desc);
892 info.limit = GET_LIMIT(desc);
893 info.seg_32bit = GET_32BIT(desc);
894 info.contents = GET_CONTENTS(desc);
895 info.read_exec_only = !GET_WRITABLE(desc);
896 info.limit_in_pages = GET_LIMIT_PAGES(desc);
897 info.seg_not_present = !GET_PRESENT(desc);
898 info.useable = GET_USEABLE(desc);
899
900 if (copy_to_user(u_info, &info, sizeof(info)))
901 return -EFAULT;
902 return 0;
903}
904
905unsigned long arch_align_stack(unsigned long sp)
906{
c16b63e0 907 if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
1da177e4
LT
908 sp -= get_random_int() % 8192;
909 return sp & ~0xf;
910}