2 * linux/arch/i386/kernel/process.c
4 * Copyright (C) 1995 Linus Torvalds
6 * Pentium III FXSR, SSE support
7 * Gareth Hughes <gareth@valinux.com>, May 2000
11 * This file handles the architecture-dependent parts of process handling..
16 #include <linux/cpu.h>
17 #include <linux/errno.h>
18 #include <linux/sched.h>
20 #include <linux/kernel.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 #include <linux/kprobes.h>
43 #include <asm/uaccess.h>
44 #include <asm/pgtable.h>
45 #include <asm/system.h>
48 #include <asm/processor.h>
52 #ifdef CONFIG_MATH_EMULATION
53 #include <asm/math_emu.h>
56 #include <linux/irq.h>
57 #include <linux/err.h>
59 #include <asm/tlbflush.h>
62 asmlinkage void ret_from_fork(void) __asm__("ret_from_fork");
64 static int hlt_counter;
66 unsigned long boot_option_idle_override = 0;
67 EXPORT_SYMBOL(boot_option_idle_override);
70 * Return saved PC of a blocked thread.
72 unsigned long thread_saved_pc(struct task_struct *tsk)
74 return ((unsigned long *)tsk->thread.esp)[3];
78 * Powermanagement idle function, if any..
80 void (*pm_idle)(void);
81 EXPORT_SYMBOL(pm_idle);
82 static DEFINE_PER_CPU(unsigned int, cpu_idle_state);
84 void disable_hlt(void)
89 EXPORT_SYMBOL(disable_hlt);
96 EXPORT_SYMBOL(enable_hlt);
99 * We use this if we don't have any better
102 void default_idle(void)
104 if (!hlt_counter && boot_cpu_data.hlt_works_ok) {
114 #ifdef CONFIG_APM_MODULE
115 EXPORT_SYMBOL(default_idle);
119 * On SMP it's slightly faster (but much more power-consuming!)
120 * to poll the ->work.need_resched flag instead of waiting for the
121 * cross-CPU IPI to arrive. Use this option with caution.
123 static void poll_idle (void)
130 * Deal with another CPU just having chosen a thread to
133 oldval = test_and_clear_thread_flag(TIF_NEED_RESCHED);
136 set_thread_flag(TIF_POLLING_NRFLAG);
142 : : "i"(_TIF_NEED_RESCHED), "m" (current_thread_info()->flags));
144 clear_thread_flag(TIF_POLLING_NRFLAG);
150 #ifdef CONFIG_HOTPLUG_CPU
152 /* We don't actually take CPU down, just spin without interrupts. */
153 static inline void play_dead(void)
155 /* This must be done before dead CPU ack */
160 __get_cpu_var(cpu_state) = CPU_DEAD;
163 * With physical CPU hotplug, we should halt the cpu
167 __asm__ __volatile__("hlt":::"memory");
170 static inline void play_dead(void)
174 #endif /* CONFIG_HOTPLUG_CPU */
177 * The idle thread. There's no useful work to be
178 * done, so just try to conserve power and have a
179 * low exit latency (ie sit in a loop waiting for
180 * somebody to say that they'd like to reschedule)
184 int cpu = raw_smp_processor_id();
186 /* endless idle loop with no priority at all */
188 while (!need_resched()) {
191 if (__get_cpu_var(cpu_idle_state))
192 __get_cpu_var(cpu_idle_state) = 0;
200 if (cpu_is_offline(cpu))
203 __get_cpu_var(irq_stat).idle_timestamp = jiffies;
210 void cpu_idle_wait(void)
212 unsigned int cpu, this_cpu = get_cpu();
215 set_cpus_allowed(current, cpumask_of_cpu(this_cpu));
219 for_each_online_cpu(cpu) {
220 per_cpu(cpu_idle_state, cpu) = 1;
224 __get_cpu_var(cpu_idle_state) = 0;
229 for_each_online_cpu(cpu) {
230 if (cpu_isset(cpu, map) && !per_cpu(cpu_idle_state, cpu))
233 cpus_and(map, map, cpu_online_map);
234 } while (!cpus_empty(map));
236 EXPORT_SYMBOL_GPL(cpu_idle_wait);
239 * This uses new MONITOR/MWAIT instructions on P4 processors with PNI,
240 * which can obviate IPI to trigger checking of need_resched.
241 * We execute MONITOR against need_resched and enter optimized wait state
242 * through MWAIT. Whenever someone changes need_resched, we would be woken
243 * up from MWAIT (without an IPI).
245 static void mwait_idle(void)
249 if (!need_resched()) {
250 set_thread_flag(TIF_POLLING_NRFLAG);
252 __monitor((void *)¤t_thread_info()->flags, 0, 0);
256 } while (!need_resched());
257 clear_thread_flag(TIF_POLLING_NRFLAG);
261 void __devinit select_idle_routine(const struct cpuinfo_x86 *c)
263 if (cpu_has(c, X86_FEATURE_MWAIT)) {
264 printk("monitor/mwait feature present.\n");
266 * Skip, if setup has overridden idle.
267 * One CPU supports mwait => All CPUs supports mwait
270 printk("using mwait in idle threads.\n");
271 pm_idle = mwait_idle;
276 static int __init idle_setup (char *str)
278 if (!strncmp(str, "poll", 4)) {
279 printk("using polling idle threads.\n");
281 #ifdef CONFIG_X86_SMP
282 if (smp_num_siblings > 1)
283 printk("WARNING: polling idle and HT enabled, performance may degrade.\n");
285 } else if (!strncmp(str, "halt", 4)) {
286 printk("using halt in idle threads.\n");
287 pm_idle = default_idle;
290 boot_option_idle_override = 1;
294 __setup("idle=", idle_setup);
296 void show_regs(struct pt_regs * regs)
298 unsigned long cr0 = 0L, cr2 = 0L, cr3 = 0L, cr4 = 0L;
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);
306 printk(" ESP: %04x:%08lx",0xffff & regs->xss,regs->esp);
307 printk(" EFLAGS: %08lx %s (%s)\n",
308 regs->eflags, print_tainted(), system_utsname.release);
309 printk("EAX: %08lx EBX: %08lx ECX: %08lx EDX: %08lx\n",
310 regs->eax,regs->ebx,regs->ecx,regs->edx);
311 printk("ESI: %08lx EDI: %08lx EBP: %08lx",
312 regs->esi, regs->edi, regs->ebp);
313 printk(" DS: %04x ES: %04x\n",
314 0xffff & regs->xds,0xffff & regs->xes);
316 __asm__("movl %%cr0, %0": "=r" (cr0));
317 __asm__("movl %%cr2, %0": "=r" (cr2));
318 __asm__("movl %%cr3, %0": "=r" (cr3));
319 /* This could fault if %cr4 does not exist */
320 __asm__("1: movl %%cr4, %0 \n"
322 ".section __ex_table,\"a\" \n"
325 : "=r" (cr4): "0" (0));
326 printk("CR0: %08lx CR2: %08lx CR3: %08lx CR4: %08lx\n", cr0, cr2, cr3, cr4);
327 show_trace(NULL, ®s->esp);
331 * This gets run with %ebx containing the
332 * function to call, and %edx containing
335 extern void kernel_thread_helper(void);
336 __asm__(".section .text\n"
338 "kernel_thread_helper:\n\t"
347 * Create a kernel thread
349 int kernel_thread(int (*fn)(void *), void * arg, unsigned long flags)
353 memset(®s, 0, sizeof(regs));
355 regs.ebx = (unsigned long) fn;
356 regs.edx = (unsigned long) arg;
358 regs.xds = __USER_DS;
359 regs.xes = __USER_DS;
361 regs.eip = (unsigned long) kernel_thread_helper;
362 regs.xcs = __KERNEL_CS;
363 regs.eflags = X86_EFLAGS_IF | X86_EFLAGS_SF | X86_EFLAGS_PF | 0x2;
365 /* Ok, create the new process.. */
366 return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, ®s, 0, NULL, NULL);
368 EXPORT_SYMBOL(kernel_thread);
371 * Free current thread data structures etc..
373 void exit_thread(void)
375 struct task_struct *tsk = current;
376 struct thread_struct *t = &tsk->thread;
379 * Remove function-return probe instances associated with this task
380 * and put them back on the free list. Do not insert an exit probe for
381 * this function, it will be disabled by kprobe_flush_task if you do.
383 kprobe_flush_task(tsk);
385 /* The process may have allocated an io port bitmap... nuke it. */
386 if (unlikely(NULL != t->io_bitmap_ptr)) {
388 struct tss_struct *tss = &per_cpu(init_tss, cpu);
390 kfree(t->io_bitmap_ptr);
391 t->io_bitmap_ptr = NULL;
393 * Careful, clear this in the TSS too:
395 memset(tss->io_bitmap, 0xff, tss->io_bitmap_max);
396 t->io_bitmap_max = 0;
397 tss->io_bitmap_owner = NULL;
398 tss->io_bitmap_max = 0;
399 tss->io_bitmap_base = INVALID_IO_BITMAP_OFFSET;
404 void flush_thread(void)
406 struct task_struct *tsk = current;
409 * Remove function-return probe instances associated with this task
410 * and put them back on the free list. Do not insert an exit probe for
411 * this function, it will be disabled by kprobe_flush_task if you do.
413 kprobe_flush_task(tsk);
415 memset(tsk->thread.debugreg, 0, sizeof(unsigned long)*8);
416 memset(tsk->thread.tls_array, 0, sizeof(tsk->thread.tls_array));
418 * Forget coprocessor state..
424 void release_thread(struct task_struct *dead_task)
427 // temporary debugging check
428 if (dead_task->mm->context.size) {
429 printk("WARNING: dead process %8s still has LDT? <%p/%d>\n",
431 dead_task->mm->context.ldt,
432 dead_task->mm->context.size);
437 release_vm86_irqs(dead_task);
441 * This gets called before we allocate a new thread and copy
442 * the current task into it.
444 void prepare_to_copy(struct task_struct *tsk)
449 int copy_thread(int nr, unsigned long clone_flags, unsigned long esp,
450 unsigned long unused,
451 struct task_struct * p, struct pt_regs * regs)
453 struct pt_regs * childregs;
454 struct task_struct *tsk;
457 childregs = ((struct pt_regs *) (THREAD_SIZE + (unsigned long) p->thread_info)) - 1;
459 * The below -8 is to reserve 8 bytes on top of the ring0 stack.
460 * This is necessary to guarantee that the entire "struct pt_regs"
461 * is accessable even if the CPU haven't stored the SS/ESP registers
462 * on the stack (interrupt gate does not save these registers
463 * when switching to the same priv ring).
464 * Therefore beware: accessing the xss/esp fields of the
465 * "struct pt_regs" is possible, but they may contain the
466 * completely wrong values.
468 childregs = (struct pt_regs *) ((unsigned long) childregs - 8);
471 childregs->esp = esp;
473 p->thread.esp = (unsigned long) childregs;
474 p->thread.esp0 = (unsigned long) (childregs+1);
476 p->thread.eip = (unsigned long) ret_from_fork;
478 savesegment(fs,p->thread.fs);
479 savesegment(gs,p->thread.gs);
482 if (unlikely(NULL != tsk->thread.io_bitmap_ptr)) {
483 p->thread.io_bitmap_ptr = kmalloc(IO_BITMAP_BYTES, GFP_KERNEL);
484 if (!p->thread.io_bitmap_ptr) {
485 p->thread.io_bitmap_max = 0;
488 memcpy(p->thread.io_bitmap_ptr, tsk->thread.io_bitmap_ptr,
493 * Set a new TLS for the child thread?
495 if (clone_flags & CLONE_SETTLS) {
496 struct desc_struct *desc;
497 struct user_desc info;
501 if (copy_from_user(&info, (void __user *)childregs->esi, sizeof(info)))
504 if (LDT_empty(&info))
507 idx = info.entry_number;
508 if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
511 desc = p->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
512 desc->a = LDT_entry_a(&info);
513 desc->b = LDT_entry_b(&info);
518 if (err && p->thread.io_bitmap_ptr) {
519 kfree(p->thread.io_bitmap_ptr);
520 p->thread.io_bitmap_max = 0;
526 * fill in the user structure for a core dump..
528 void dump_thread(struct pt_regs * regs, struct user * dump)
532 /* changed the size calculations - should hopefully work better. lbt */
533 dump->magic = CMAGIC;
534 dump->start_code = 0;
535 dump->start_stack = regs->esp & ~(PAGE_SIZE - 1);
536 dump->u_tsize = ((unsigned long) current->mm->end_code) >> PAGE_SHIFT;
537 dump->u_dsize = ((unsigned long) (current->mm->brk + (PAGE_SIZE-1))) >> PAGE_SHIFT;
538 dump->u_dsize -= dump->u_tsize;
540 for (i = 0; i < 8; i++)
541 dump->u_debugreg[i] = current->thread.debugreg[i];
543 if (dump->start_stack < TASK_SIZE)
544 dump->u_ssize = ((unsigned long) (TASK_SIZE - dump->start_stack)) >> PAGE_SHIFT;
546 dump->regs.ebx = regs->ebx;
547 dump->regs.ecx = regs->ecx;
548 dump->regs.edx = regs->edx;
549 dump->regs.esi = regs->esi;
550 dump->regs.edi = regs->edi;
551 dump->regs.ebp = regs->ebp;
552 dump->regs.eax = regs->eax;
553 dump->regs.ds = regs->xds;
554 dump->regs.es = regs->xes;
555 savesegment(fs,dump->regs.fs);
556 savesegment(gs,dump->regs.gs);
557 dump->regs.orig_eax = regs->orig_eax;
558 dump->regs.eip = regs->eip;
559 dump->regs.cs = regs->xcs;
560 dump->regs.eflags = regs->eflags;
561 dump->regs.esp = regs->esp;
562 dump->regs.ss = regs->xss;
564 dump->u_fpvalid = dump_fpu (regs, &dump->i387);
566 EXPORT_SYMBOL(dump_thread);
569 * Capture the user space registers if the task is not running (in user space)
571 int dump_task_regs(struct task_struct *tsk, elf_gregset_t *regs)
573 struct pt_regs ptregs;
575 ptregs = *(struct pt_regs *)
576 ((unsigned long)tsk->thread_info+THREAD_SIZE - sizeof(ptregs));
577 ptregs.xcs &= 0xffff;
578 ptregs.xds &= 0xffff;
579 ptregs.xes &= 0xffff;
580 ptregs.xss &= 0xffff;
582 elf_core_copy_regs(regs, &ptregs);
588 handle_io_bitmap(struct thread_struct *next, struct tss_struct *tss)
590 if (!next->io_bitmap_ptr) {
592 * Disable the bitmap via an invalid offset. We still cache
593 * the previous bitmap owner and the IO bitmap contents:
595 tss->io_bitmap_base = INVALID_IO_BITMAP_OFFSET;
598 if (likely(next == tss->io_bitmap_owner)) {
600 * Previous owner of the bitmap (hence the bitmap content)
601 * matches the next task, we dont have to do anything but
602 * to set a valid offset in the TSS:
604 tss->io_bitmap_base = IO_BITMAP_OFFSET;
608 * Lazy TSS's I/O bitmap copy. We set an invalid offset here
609 * and we let the task to get a GPF in case an I/O instruction
610 * is performed. The handler of the GPF will verify that the
611 * faulting task has a valid I/O bitmap and, it true, does the
612 * real copy and restart the instruction. This will save us
613 * redundant copies when the currently switched task does not
614 * perform any I/O during its timeslice.
616 tss->io_bitmap_base = INVALID_IO_BITMAP_OFFSET_LAZY;
620 * This function selects if the context switch from prev to next
621 * has to tweak the TSC disable bit in the cr4.
623 static inline void disable_tsc(struct task_struct *prev_p,
624 struct task_struct *next_p)
626 struct thread_info *prev, *next;
629 * gcc should eliminate the ->thread_info dereference if
630 * has_secure_computing returns 0 at compile time (SECCOMP=n).
632 prev = prev_p->thread_info;
633 next = next_p->thread_info;
635 if (has_secure_computing(prev) || has_secure_computing(next)) {
637 if (has_secure_computing(prev) &&
638 !has_secure_computing(next)) {
639 write_cr4(read_cr4() & ~X86_CR4_TSD);
640 } else if (!has_secure_computing(prev) &&
641 has_secure_computing(next))
642 write_cr4(read_cr4() | X86_CR4_TSD);
647 * switch_to(x,yn) should switch tasks from x to y.
649 * We fsave/fwait so that an exception goes off at the right time
650 * (as a call from the fsave or fwait in effect) rather than to
651 * the wrong process. Lazy FP saving no longer makes any sense
652 * with modern CPU's, and this simplifies a lot of things (SMP
653 * and UP become the same).
655 * NOTE! We used to use the x86 hardware context switching. The
656 * reason for not using it any more becomes apparent when you
657 * try to recover gracefully from saved state that is no longer
658 * valid (stale segment register values in particular). With the
659 * hardware task-switch, there is no way to fix up bad state in
660 * a reasonable manner.
662 * The fact that Intel documents the hardware task-switching to
663 * be slow is a fairly red herring - this code is not noticeably
664 * faster. However, there _is_ some room for improvement here,
665 * so the performance issues may eventually be a valid point.
666 * More important, however, is the fact that this allows us much
669 * The return value (in %eax) will be the "prev" task after
670 * the task-switch, and shows up in ret_from_fork in entry.S,
673 struct task_struct fastcall * __switch_to(struct task_struct *prev_p, struct task_struct *next_p)
675 struct thread_struct *prev = &prev_p->thread,
676 *next = &next_p->thread;
677 int cpu = smp_processor_id();
678 struct tss_struct *tss = &per_cpu(init_tss, cpu);
680 /* never put a printk in __switch_to... printk() calls wake_up*() indirectly */
682 __unlazy_fpu(prev_p);
685 * Reload esp0, LDT and the page table pointer:
687 load_esp0(tss, next);
690 * Load the per-thread Thread-Local Storage descriptor.
695 * Save away %fs and %gs. No need to save %es and %ds, as
696 * those are always kernel segments while inside the kernel.
698 asm volatile("mov %%fs,%0":"=m" (prev->fs));
699 asm volatile("mov %%gs,%0":"=m" (prev->gs));
702 * Restore %fs and %gs if needed.
704 * Glibc normally makes %fs be zero, and %gs is one of
707 if (unlikely(prev->fs | next->fs))
708 loadsegment(fs, next->fs);
710 if (prev->gs | next->gs)
711 loadsegment(gs, next->gs);
714 * Now maybe reload the debug registers
716 if (unlikely(next->debugreg[7])) {
717 set_debugreg(next->debugreg[0], 0);
718 set_debugreg(next->debugreg[1], 1);
719 set_debugreg(next->debugreg[2], 2);
720 set_debugreg(next->debugreg[3], 3);
722 set_debugreg(next->debugreg[6], 6);
723 set_debugreg(next->debugreg[7], 7);
726 if (unlikely(prev->io_bitmap_ptr || next->io_bitmap_ptr))
727 handle_io_bitmap(next, tss);
729 disable_tsc(prev_p, next_p);
734 asmlinkage int sys_fork(struct pt_regs regs)
736 return do_fork(SIGCHLD, regs.esp, ®s, 0, NULL, NULL);
739 asmlinkage int sys_clone(struct pt_regs regs)
741 unsigned long clone_flags;
743 int __user *parent_tidptr, *child_tidptr;
745 clone_flags = regs.ebx;
747 parent_tidptr = (int __user *)regs.edx;
748 child_tidptr = (int __user *)regs.edi;
751 return do_fork(clone_flags, newsp, ®s, 0, parent_tidptr, child_tidptr);
755 * This is trivial, and on the face of it looks like it
756 * could equally well be done in user mode.
758 * Not so, for quite unobvious reasons - register pressure.
759 * In user mode vfork() cannot have a stack frame, and if
760 * done by calling the "clone()" system call directly, you
761 * do not have enough call-clobbered registers to hold all
762 * the information you need.
764 asmlinkage int sys_vfork(struct pt_regs regs)
766 return do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, regs.esp, ®s, 0, NULL, NULL);
770 * sys_execve() executes a new program.
772 asmlinkage int sys_execve(struct pt_regs regs)
777 filename = getname((char __user *) regs.ebx);
778 error = PTR_ERR(filename);
779 if (IS_ERR(filename))
781 error = do_execve(filename,
782 (char __user * __user *) regs.ecx,
783 (char __user * __user *) regs.edx,
787 current->ptrace &= ~PT_DTRACE;
788 task_unlock(current);
789 /* Make sure we don't return using sysenter.. */
790 set_thread_flag(TIF_IRET);
797 #define top_esp (THREAD_SIZE - sizeof(unsigned long))
798 #define top_ebp (THREAD_SIZE - 2*sizeof(unsigned long))
800 unsigned long get_wchan(struct task_struct *p)
802 unsigned long ebp, esp, eip;
803 unsigned long stack_page;
805 if (!p || p == current || p->state == TASK_RUNNING)
807 stack_page = (unsigned long)p->thread_info;
809 if (!stack_page || esp < stack_page || esp > top_esp+stack_page)
811 /* include/asm-i386/system.h:switch_to() pushes ebp last. */
812 ebp = *(unsigned long *) esp;
814 if (ebp < stack_page || ebp > top_ebp+stack_page)
816 eip = *(unsigned long *) (ebp+4);
817 if (!in_sched_functions(eip))
819 ebp = *(unsigned long *) ebp;
820 } while (count++ < 16);
823 EXPORT_SYMBOL(get_wchan);
826 * sys_alloc_thread_area: get a yet unused TLS descriptor index.
828 static int get_free_idx(void)
830 struct thread_struct *t = ¤t->thread;
833 for (idx = 0; idx < GDT_ENTRY_TLS_ENTRIES; idx++)
834 if (desc_empty(t->tls_array + idx))
835 return idx + GDT_ENTRY_TLS_MIN;
840 * Set a given TLS descriptor:
842 asmlinkage int sys_set_thread_area(struct user_desc __user *u_info)
844 struct thread_struct *t = ¤t->thread;
845 struct user_desc info;
846 struct desc_struct *desc;
849 if (copy_from_user(&info, u_info, sizeof(info)))
851 idx = info.entry_number;
854 * index -1 means the kernel should try to find and
855 * allocate an empty descriptor:
858 idx = get_free_idx();
861 if (put_user(idx, &u_info->entry_number))
865 if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
868 desc = t->tls_array + idx - GDT_ENTRY_TLS_MIN;
871 * We must not get preempted while modifying the TLS.
875 if (LDT_empty(&info)) {
879 desc->a = LDT_entry_a(&info);
880 desc->b = LDT_entry_b(&info);
890 * Get the current Thread-Local Storage area:
893 #define GET_BASE(desc) ( \
894 (((desc)->a >> 16) & 0x0000ffff) | \
895 (((desc)->b << 16) & 0x00ff0000) | \
896 ( (desc)->b & 0xff000000) )
898 #define GET_LIMIT(desc) ( \
899 ((desc)->a & 0x0ffff) | \
900 ((desc)->b & 0xf0000) )
902 #define GET_32BIT(desc) (((desc)->b >> 22) & 1)
903 #define GET_CONTENTS(desc) (((desc)->b >> 10) & 3)
904 #define GET_WRITABLE(desc) (((desc)->b >> 9) & 1)
905 #define GET_LIMIT_PAGES(desc) (((desc)->b >> 23) & 1)
906 #define GET_PRESENT(desc) (((desc)->b >> 15) & 1)
907 #define GET_USEABLE(desc) (((desc)->b >> 20) & 1)
909 asmlinkage int sys_get_thread_area(struct user_desc __user *u_info)
911 struct user_desc info;
912 struct desc_struct *desc;
915 if (get_user(idx, &u_info->entry_number))
917 if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
920 desc = current->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
922 info.entry_number = idx;
923 info.base_addr = GET_BASE(desc);
924 info.limit = GET_LIMIT(desc);
925 info.seg_32bit = GET_32BIT(desc);
926 info.contents = GET_CONTENTS(desc);
927 info.read_exec_only = !GET_WRITABLE(desc);
928 info.limit_in_pages = GET_LIMIT_PAGES(desc);
929 info.seg_not_present = !GET_PRESENT(desc);
930 info.useable = GET_USEABLE(desc);
932 if (copy_to_user(u_info, &info, sizeof(info)))
937 unsigned long arch_align_stack(unsigned long sp)
939 if (randomize_va_space)
940 sp -= get_random_int() % 8192;