process.c 22 KB

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