process.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910
  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 <linux/personality.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. current_thread_info()->status &= ~TS_POLLING;
  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. current_thread_info()->status |= TS_POLLING;
  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. current_thread_info()->status |= TS_POLLING;
  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. * New with Core Duo processors, MWAIT can take some hints based on CPU
  206. * capability.
  207. */
  208. void mwait_idle_with_hints(unsigned long eax, unsigned long ecx)
  209. {
  210. if (!need_resched()) {
  211. __monitor((void *)&current_thread_info()->flags, 0, 0);
  212. smp_mb();
  213. if (!need_resched())
  214. __mwait(eax, ecx);
  215. }
  216. }
  217. /* Default MONITOR/MWAIT with no hints, used for default C1 state */
  218. static void mwait_idle(void)
  219. {
  220. local_irq_enable();
  221. while (!need_resched())
  222. mwait_idle_with_hints(0, 0);
  223. }
  224. void __devinit select_idle_routine(const struct cpuinfo_x86 *c)
  225. {
  226. if (cpu_has(c, X86_FEATURE_MWAIT)) {
  227. printk("monitor/mwait feature present.\n");
  228. /*
  229. * Skip, if setup has overridden idle.
  230. * One CPU supports mwait => All CPUs supports mwait
  231. */
  232. if (!pm_idle) {
  233. printk("using mwait in idle threads.\n");
  234. pm_idle = mwait_idle;
  235. }
  236. }
  237. }
  238. static int __init idle_setup (char *str)
  239. {
  240. if (!strncmp(str, "poll", 4)) {
  241. printk("using polling idle threads.\n");
  242. pm_idle = poll_idle;
  243. #ifdef CONFIG_X86_SMP
  244. if (smp_num_siblings > 1)
  245. printk("WARNING: polling idle and HT enabled, performance may degrade.\n");
  246. #endif
  247. } else if (!strncmp(str, "halt", 4)) {
  248. printk("using halt in idle threads.\n");
  249. pm_idle = default_idle;
  250. }
  251. boot_option_idle_override = 1;
  252. return 1;
  253. }
  254. __setup("idle=", idle_setup);
  255. void show_regs(struct pt_regs * regs)
  256. {
  257. unsigned long cr0 = 0L, cr2 = 0L, cr3 = 0L, cr4 = 0L;
  258. printk("\n");
  259. printk("Pid: %d, comm: %20s\n", current->pid, current->comm);
  260. printk("EIP: %04x:[<%08lx>] CPU: %d\n",0xffff & regs->xcs,regs->eip, smp_processor_id());
  261. print_symbol("EIP is at %s\n", regs->eip);
  262. if (user_mode_vm(regs))
  263. printk(" ESP: %04x:%08lx",0xffff & regs->xss,regs->esp);
  264. printk(" EFLAGS: %08lx %s (%s %.*s)\n",
  265. regs->eflags, print_tainted(), init_utsname()->release,
  266. (int)strcspn(init_utsname()->version, " "),
  267. init_utsname()->version);
  268. printk("EAX: %08lx EBX: %08lx ECX: %08lx EDX: %08lx\n",
  269. regs->eax,regs->ebx,regs->ecx,regs->edx);
  270. printk("ESI: %08lx EDI: %08lx EBP: %08lx",
  271. regs->esi, regs->edi, regs->ebp);
  272. printk(" DS: %04x ES: %04x\n",
  273. 0xffff & regs->xds,0xffff & regs->xes);
  274. cr0 = read_cr0();
  275. cr2 = read_cr2();
  276. cr3 = read_cr3();
  277. cr4 = read_cr4_safe();
  278. printk("CR0: %08lx CR2: %08lx CR3: %08lx CR4: %08lx\n", cr0, cr2, cr3, cr4);
  279. show_trace(NULL, regs, &regs->esp);
  280. }
  281. /*
  282. * This gets run with %ebx containing the
  283. * function to call, and %edx containing
  284. * the "args".
  285. */
  286. extern void kernel_thread_helper(void);
  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 | get_kernel_rpl();
  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. /* The process may have allocated an io port bitmap... nuke it. */
  312. if (unlikely(test_thread_flag(TIF_IO_BITMAP))) {
  313. struct task_struct *tsk = current;
  314. struct thread_struct *t = &tsk->thread;
  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. clear_thread_flag(TIF_IO_BITMAP);
  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. clear_tsk_thread_flag(tsk, TIF_DEBUG);
  337. /*
  338. * Forget coprocessor state..
  339. */
  340. clear_fpu(tsk);
  341. clear_used_math();
  342. }
  343. void release_thread(struct task_struct *dead_task)
  344. {
  345. BUG_ON(dead_task->mm);
  346. release_vm86_irqs(dead_task);
  347. }
  348. /*
  349. * This gets called before we allocate a new thread and copy
  350. * the current task into it.
  351. */
  352. void prepare_to_copy(struct task_struct *tsk)
  353. {
  354. unlazy_fpu(tsk);
  355. }
  356. int copy_thread(int nr, unsigned long clone_flags, unsigned long esp,
  357. unsigned long unused,
  358. struct task_struct * p, struct pt_regs * regs)
  359. {
  360. struct pt_regs * childregs;
  361. struct task_struct *tsk;
  362. int err;
  363. childregs = task_pt_regs(p);
  364. *childregs = *regs;
  365. childregs->eax = 0;
  366. childregs->esp = esp;
  367. p->thread.esp = (unsigned long) childregs;
  368. p->thread.esp0 = (unsigned long) (childregs+1);
  369. p->thread.eip = (unsigned long) ret_from_fork;
  370. savesegment(fs,p->thread.fs);
  371. savesegment(gs,p->thread.gs);
  372. tsk = current;
  373. if (unlikely(test_tsk_thread_flag(tsk, TIF_IO_BITMAP))) {
  374. p->thread.io_bitmap_ptr = kmemdup(tsk->thread.io_bitmap_ptr,
  375. IO_BITMAP_BYTES, GFP_KERNEL);
  376. if (!p->thread.io_bitmap_ptr) {
  377. p->thread.io_bitmap_max = 0;
  378. return -ENOMEM;
  379. }
  380. set_tsk_thread_flag(p, TIF_IO_BITMAP);
  381. }
  382. /*
  383. * Set a new TLS for the child thread?
  384. */
  385. if (clone_flags & CLONE_SETTLS) {
  386. struct desc_struct *desc;
  387. struct user_desc info;
  388. int idx;
  389. err = -EFAULT;
  390. if (copy_from_user(&info, (void __user *)childregs->esi, sizeof(info)))
  391. goto out;
  392. err = -EINVAL;
  393. if (LDT_empty(&info))
  394. goto out;
  395. idx = info.entry_number;
  396. if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
  397. goto out;
  398. desc = p->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
  399. desc->a = LDT_entry_a(&info);
  400. desc->b = LDT_entry_b(&info);
  401. }
  402. err = 0;
  403. out:
  404. if (err && p->thread.io_bitmap_ptr) {
  405. kfree(p->thread.io_bitmap_ptr);
  406. p->thread.io_bitmap_max = 0;
  407. }
  408. return err;
  409. }
  410. /*
  411. * fill in the user structure for a core dump..
  412. */
  413. void dump_thread(struct pt_regs * regs, struct user * dump)
  414. {
  415. int i;
  416. /* changed the size calculations - should hopefully work better. lbt */
  417. dump->magic = CMAGIC;
  418. dump->start_code = 0;
  419. dump->start_stack = regs->esp & ~(PAGE_SIZE - 1);
  420. dump->u_tsize = ((unsigned long) current->mm->end_code) >> PAGE_SHIFT;
  421. dump->u_dsize = ((unsigned long) (current->mm->brk + (PAGE_SIZE-1))) >> PAGE_SHIFT;
  422. dump->u_dsize -= dump->u_tsize;
  423. dump->u_ssize = 0;
  424. for (i = 0; i < 8; i++)
  425. dump->u_debugreg[i] = current->thread.debugreg[i];
  426. if (dump->start_stack < TASK_SIZE)
  427. dump->u_ssize = ((unsigned long) (TASK_SIZE - dump->start_stack)) >> PAGE_SHIFT;
  428. dump->regs.ebx = regs->ebx;
  429. dump->regs.ecx = regs->ecx;
  430. dump->regs.edx = regs->edx;
  431. dump->regs.esi = regs->esi;
  432. dump->regs.edi = regs->edi;
  433. dump->regs.ebp = regs->ebp;
  434. dump->regs.eax = regs->eax;
  435. dump->regs.ds = regs->xds;
  436. dump->regs.es = regs->xes;
  437. savesegment(fs,dump->regs.fs);
  438. savesegment(gs,dump->regs.gs);
  439. dump->regs.orig_eax = regs->orig_eax;
  440. dump->regs.eip = regs->eip;
  441. dump->regs.cs = regs->xcs;
  442. dump->regs.eflags = regs->eflags;
  443. dump->regs.esp = regs->esp;
  444. dump->regs.ss = regs->xss;
  445. dump->u_fpvalid = dump_fpu (regs, &dump->i387);
  446. }
  447. EXPORT_SYMBOL(dump_thread);
  448. /*
  449. * Capture the user space registers if the task is not running (in user space)
  450. */
  451. int dump_task_regs(struct task_struct *tsk, elf_gregset_t *regs)
  452. {
  453. struct pt_regs ptregs = *task_pt_regs(tsk);
  454. ptregs.xcs &= 0xffff;
  455. ptregs.xds &= 0xffff;
  456. ptregs.xes &= 0xffff;
  457. ptregs.xss &= 0xffff;
  458. elf_core_copy_regs(regs, &ptregs);
  459. return 1;
  460. }
  461. static noinline void __switch_to_xtra(struct task_struct *next_p,
  462. struct tss_struct *tss)
  463. {
  464. struct thread_struct *next;
  465. next = &next_p->thread;
  466. if (test_tsk_thread_flag(next_p, TIF_DEBUG)) {
  467. set_debugreg(next->debugreg[0], 0);
  468. set_debugreg(next->debugreg[1], 1);
  469. set_debugreg(next->debugreg[2], 2);
  470. set_debugreg(next->debugreg[3], 3);
  471. /* no 4 and 5 */
  472. set_debugreg(next->debugreg[6], 6);
  473. set_debugreg(next->debugreg[7], 7);
  474. }
  475. if (!test_tsk_thread_flag(next_p, TIF_IO_BITMAP)) {
  476. /*
  477. * Disable the bitmap via an invalid offset. We still cache
  478. * the previous bitmap owner and the IO bitmap contents:
  479. */
  480. tss->io_bitmap_base = INVALID_IO_BITMAP_OFFSET;
  481. return;
  482. }
  483. if (likely(next == tss->io_bitmap_owner)) {
  484. /*
  485. * Previous owner of the bitmap (hence the bitmap content)
  486. * matches the next task, we dont have to do anything but
  487. * to set a valid offset in the TSS:
  488. */
  489. tss->io_bitmap_base = IO_BITMAP_OFFSET;
  490. return;
  491. }
  492. /*
  493. * Lazy TSS's I/O bitmap copy. We set an invalid offset here
  494. * and we let the task to get a GPF in case an I/O instruction
  495. * is performed. The handler of the GPF will verify that the
  496. * faulting task has a valid I/O bitmap and, it true, does the
  497. * real copy and restart the instruction. This will save us
  498. * redundant copies when the currently switched task does not
  499. * perform any I/O during its timeslice.
  500. */
  501. tss->io_bitmap_base = INVALID_IO_BITMAP_OFFSET_LAZY;
  502. }
  503. /*
  504. * This function selects if the context switch from prev to next
  505. * has to tweak the TSC disable bit in the cr4.
  506. */
  507. static inline void disable_tsc(struct task_struct *prev_p,
  508. struct task_struct *next_p)
  509. {
  510. struct thread_info *prev, *next;
  511. /*
  512. * gcc should eliminate the ->thread_info dereference if
  513. * has_secure_computing returns 0 at compile time (SECCOMP=n).
  514. */
  515. prev = task_thread_info(prev_p);
  516. next = task_thread_info(next_p);
  517. if (has_secure_computing(prev) || has_secure_computing(next)) {
  518. /* slow path here */
  519. if (has_secure_computing(prev) &&
  520. !has_secure_computing(next)) {
  521. write_cr4(read_cr4() & ~X86_CR4_TSD);
  522. } else if (!has_secure_computing(prev) &&
  523. has_secure_computing(next))
  524. write_cr4(read_cr4() | X86_CR4_TSD);
  525. }
  526. }
  527. /*
  528. * switch_to(x,yn) should switch tasks from x to y.
  529. *
  530. * We fsave/fwait so that an exception goes off at the right time
  531. * (as a call from the fsave or fwait in effect) rather than to
  532. * the wrong process. Lazy FP saving no longer makes any sense
  533. * with modern CPU's, and this simplifies a lot of things (SMP
  534. * and UP become the same).
  535. *
  536. * NOTE! We used to use the x86 hardware context switching. The
  537. * reason for not using it any more becomes apparent when you
  538. * try to recover gracefully from saved state that is no longer
  539. * valid (stale segment register values in particular). With the
  540. * hardware task-switch, there is no way to fix up bad state in
  541. * a reasonable manner.
  542. *
  543. * The fact that Intel documents the hardware task-switching to
  544. * be slow is a fairly red herring - this code is not noticeably
  545. * faster. However, there _is_ some room for improvement here,
  546. * so the performance issues may eventually be a valid point.
  547. * More important, however, is the fact that this allows us much
  548. * more flexibility.
  549. *
  550. * The return value (in %eax) will be the "prev" task after
  551. * the task-switch, and shows up in ret_from_fork in entry.S,
  552. * for example.
  553. */
  554. struct task_struct fastcall * __switch_to(struct task_struct *prev_p, struct task_struct *next_p)
  555. {
  556. struct thread_struct *prev = &prev_p->thread,
  557. *next = &next_p->thread;
  558. int cpu = smp_processor_id();
  559. struct tss_struct *tss = &per_cpu(init_tss, cpu);
  560. /* never put a printk in __switch_to... printk() calls wake_up*() indirectly */
  561. __unlazy_fpu(prev_p);
  562. /*
  563. * Reload esp0.
  564. */
  565. load_esp0(tss, next);
  566. /*
  567. * Save away %fs and %gs. No need to save %es and %ds, as
  568. * those are always kernel segments while inside the kernel.
  569. * Doing this before setting the new TLS descriptors avoids
  570. * the situation where we temporarily have non-reloadable
  571. * segments in %fs and %gs. This could be an issue if the
  572. * NMI handler ever used %fs or %gs (it does not today), or
  573. * if the kernel is running inside of a hypervisor layer.
  574. */
  575. savesegment(fs, prev->fs);
  576. savesegment(gs, prev->gs);
  577. /*
  578. * Load the per-thread Thread-Local Storage descriptor.
  579. */
  580. load_TLS(next, cpu);
  581. /*
  582. * Restore %fs and %gs if needed.
  583. *
  584. * Glibc normally makes %fs be zero, and %gs is one of
  585. * the TLS segments.
  586. */
  587. if (unlikely(prev->fs | next->fs))
  588. loadsegment(fs, next->fs);
  589. if (prev->gs | next->gs)
  590. loadsegment(gs, next->gs);
  591. /*
  592. * Restore IOPL if needed.
  593. */
  594. if (unlikely(prev->iopl != next->iopl))
  595. set_iopl_mask(next->iopl);
  596. /*
  597. * Now maybe handle debug registers and/or IO bitmaps
  598. */
  599. if (unlikely((task_thread_info(next_p)->flags & _TIF_WORK_CTXSW)
  600. || test_tsk_thread_flag(prev_p, TIF_IO_BITMAP)))
  601. __switch_to_xtra(next_p, tss);
  602. disable_tsc(prev_p, next_p);
  603. return prev_p;
  604. }
  605. asmlinkage int sys_fork(struct pt_regs regs)
  606. {
  607. return do_fork(SIGCHLD, regs.esp, &regs, 0, NULL, NULL);
  608. }
  609. asmlinkage int sys_clone(struct pt_regs regs)
  610. {
  611. unsigned long clone_flags;
  612. unsigned long newsp;
  613. int __user *parent_tidptr, *child_tidptr;
  614. clone_flags = regs.ebx;
  615. newsp = regs.ecx;
  616. parent_tidptr = (int __user *)regs.edx;
  617. child_tidptr = (int __user *)regs.edi;
  618. if (!newsp)
  619. newsp = regs.esp;
  620. return do_fork(clone_flags, newsp, &regs, 0, parent_tidptr, child_tidptr);
  621. }
  622. /*
  623. * This is trivial, and on the face of it looks like it
  624. * could equally well be done in user mode.
  625. *
  626. * Not so, for quite unobvious reasons - register pressure.
  627. * In user mode vfork() cannot have a stack frame, and if
  628. * done by calling the "clone()" system call directly, you
  629. * do not have enough call-clobbered registers to hold all
  630. * the information you need.
  631. */
  632. asmlinkage int sys_vfork(struct pt_regs regs)
  633. {
  634. return do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, regs.esp, &regs, 0, NULL, NULL);
  635. }
  636. /*
  637. * sys_execve() executes a new program.
  638. */
  639. asmlinkage int sys_execve(struct pt_regs regs)
  640. {
  641. int error;
  642. char * filename;
  643. filename = getname((char __user *) regs.ebx);
  644. error = PTR_ERR(filename);
  645. if (IS_ERR(filename))
  646. goto out;
  647. error = do_execve(filename,
  648. (char __user * __user *) regs.ecx,
  649. (char __user * __user *) regs.edx,
  650. &regs);
  651. if (error == 0) {
  652. task_lock(current);
  653. current->ptrace &= ~PT_DTRACE;
  654. task_unlock(current);
  655. /* Make sure we don't return using sysenter.. */
  656. set_thread_flag(TIF_IRET);
  657. }
  658. putname(filename);
  659. out:
  660. return error;
  661. }
  662. #define top_esp (THREAD_SIZE - sizeof(unsigned long))
  663. #define top_ebp (THREAD_SIZE - 2*sizeof(unsigned long))
  664. unsigned long get_wchan(struct task_struct *p)
  665. {
  666. unsigned long ebp, esp, eip;
  667. unsigned long stack_page;
  668. int count = 0;
  669. if (!p || p == current || p->state == TASK_RUNNING)
  670. return 0;
  671. stack_page = (unsigned long)task_stack_page(p);
  672. esp = p->thread.esp;
  673. if (!stack_page || esp < stack_page || esp > top_esp+stack_page)
  674. return 0;
  675. /* include/asm-i386/system.h:switch_to() pushes ebp last. */
  676. ebp = *(unsigned long *) esp;
  677. do {
  678. if (ebp < stack_page || ebp > top_ebp+stack_page)
  679. return 0;
  680. eip = *(unsigned long *) (ebp+4);
  681. if (!in_sched_functions(eip))
  682. return eip;
  683. ebp = *(unsigned long *) ebp;
  684. } while (count++ < 16);
  685. return 0;
  686. }
  687. /*
  688. * sys_alloc_thread_area: get a yet unused TLS descriptor index.
  689. */
  690. static int get_free_idx(void)
  691. {
  692. struct thread_struct *t = &current->thread;
  693. int idx;
  694. for (idx = 0; idx < GDT_ENTRY_TLS_ENTRIES; idx++)
  695. if (desc_empty(t->tls_array + idx))
  696. return idx + GDT_ENTRY_TLS_MIN;
  697. return -ESRCH;
  698. }
  699. /*
  700. * Set a given TLS descriptor:
  701. */
  702. asmlinkage int sys_set_thread_area(struct user_desc __user *u_info)
  703. {
  704. struct thread_struct *t = &current->thread;
  705. struct user_desc info;
  706. struct desc_struct *desc;
  707. int cpu, idx;
  708. if (copy_from_user(&info, u_info, sizeof(info)))
  709. return -EFAULT;
  710. idx = info.entry_number;
  711. /*
  712. * index -1 means the kernel should try to find and
  713. * allocate an empty descriptor:
  714. */
  715. if (idx == -1) {
  716. idx = get_free_idx();
  717. if (idx < 0)
  718. return idx;
  719. if (put_user(idx, &u_info->entry_number))
  720. return -EFAULT;
  721. }
  722. if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
  723. return -EINVAL;
  724. desc = t->tls_array + idx - GDT_ENTRY_TLS_MIN;
  725. /*
  726. * We must not get preempted while modifying the TLS.
  727. */
  728. cpu = get_cpu();
  729. if (LDT_empty(&info)) {
  730. desc->a = 0;
  731. desc->b = 0;
  732. } else {
  733. desc->a = LDT_entry_a(&info);
  734. desc->b = LDT_entry_b(&info);
  735. }
  736. load_TLS(t, cpu);
  737. put_cpu();
  738. return 0;
  739. }
  740. /*
  741. * Get the current Thread-Local Storage area:
  742. */
  743. #define GET_BASE(desc) ( \
  744. (((desc)->a >> 16) & 0x0000ffff) | \
  745. (((desc)->b << 16) & 0x00ff0000) | \
  746. ( (desc)->b & 0xff000000) )
  747. #define GET_LIMIT(desc) ( \
  748. ((desc)->a & 0x0ffff) | \
  749. ((desc)->b & 0xf0000) )
  750. #define GET_32BIT(desc) (((desc)->b >> 22) & 1)
  751. #define GET_CONTENTS(desc) (((desc)->b >> 10) & 3)
  752. #define GET_WRITABLE(desc) (((desc)->b >> 9) & 1)
  753. #define GET_LIMIT_PAGES(desc) (((desc)->b >> 23) & 1)
  754. #define GET_PRESENT(desc) (((desc)->b >> 15) & 1)
  755. #define GET_USEABLE(desc) (((desc)->b >> 20) & 1)
  756. asmlinkage int sys_get_thread_area(struct user_desc __user *u_info)
  757. {
  758. struct user_desc info;
  759. struct desc_struct *desc;
  760. int idx;
  761. if (get_user(idx, &u_info->entry_number))
  762. return -EFAULT;
  763. if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
  764. return -EINVAL;
  765. memset(&info, 0, sizeof(info));
  766. desc = current->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
  767. info.entry_number = idx;
  768. info.base_addr = GET_BASE(desc);
  769. info.limit = GET_LIMIT(desc);
  770. info.seg_32bit = GET_32BIT(desc);
  771. info.contents = GET_CONTENTS(desc);
  772. info.read_exec_only = !GET_WRITABLE(desc);
  773. info.limit_in_pages = GET_LIMIT_PAGES(desc);
  774. info.seg_not_present = !GET_PRESENT(desc);
  775. info.useable = GET_USEABLE(desc);
  776. if (copy_to_user(u_info, &info, sizeof(info)))
  777. return -EFAULT;
  778. return 0;
  779. }
  780. unsigned long arch_align_stack(unsigned long sp)
  781. {
  782. if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
  783. sp -= get_random_int() % 8192;
  784. return sp & ~0xf;
  785. }