process.c 22 KB

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