process_32.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729
  1. /*
  2. * Copyright (C) 1995 Linus Torvalds
  3. *
  4. * Pentium III FXSR, SSE support
  5. * Gareth Hughes <gareth@valinux.com>, May 2000
  6. */
  7. /*
  8. * This file handles the architecture-dependent parts of process handling..
  9. */
  10. #include <stdarg.h>
  11. #include <linux/cpu.h>
  12. #include <linux/errno.h>
  13. #include <linux/sched.h>
  14. #include <linux/fs.h>
  15. #include <linux/kernel.h>
  16. #include <linux/mm.h>
  17. #include <linux/elfcore.h>
  18. #include <linux/smp.h>
  19. #include <linux/stddef.h>
  20. #include <linux/slab.h>
  21. #include <linux/vmalloc.h>
  22. #include <linux/user.h>
  23. #include <linux/interrupt.h>
  24. #include <linux/utsname.h>
  25. #include <linux/delay.h>
  26. #include <linux/reboot.h>
  27. #include <linux/init.h>
  28. #include <linux/mc146818rtc.h>
  29. #include <linux/module.h>
  30. #include <linux/kallsyms.h>
  31. #include <linux/ptrace.h>
  32. #include <linux/random.h>
  33. #include <linux/personality.h>
  34. #include <linux/tick.h>
  35. #include <linux/percpu.h>
  36. #include <linux/prctl.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. #ifdef CONFIG_MATH_EMULATION
  46. #include <asm/math_emu.h>
  47. #endif
  48. #include <linux/err.h>
  49. #include <asm/tlbflush.h>
  50. #include <asm/cpu.h>
  51. #include <asm/kdebug.h>
  52. asmlinkage void ret_from_fork(void) __asm__("ret_from_fork");
  53. DEFINE_PER_CPU(struct task_struct *, current_task) = &init_task;
  54. EXPORT_PER_CPU_SYMBOL(current_task);
  55. DEFINE_PER_CPU(int, cpu_number);
  56. EXPORT_PER_CPU_SYMBOL(cpu_number);
  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.sp)[3];
  63. }
  64. #ifdef CONFIG_HOTPLUG_CPU
  65. #include <asm/nmi.h>
  66. static void cpu_exit_clear(void)
  67. {
  68. int cpu = raw_smp_processor_id();
  69. idle_task_exit();
  70. cpu_uninit();
  71. irq_ctx_exit(cpu);
  72. cpu_clear(cpu, cpu_callout_map);
  73. cpu_clear(cpu, cpu_callin_map);
  74. numa_remove_cpu(cpu);
  75. }
  76. /* We don't actually take CPU down, just spin without interrupts. */
  77. static inline void play_dead(void)
  78. {
  79. /* This must be done before dead CPU ack */
  80. cpu_exit_clear();
  81. wbinvd();
  82. mb();
  83. /* Ack it */
  84. __get_cpu_var(cpu_state) = CPU_DEAD;
  85. /*
  86. * With physical CPU hotplug, we should halt the cpu
  87. */
  88. local_irq_disable();
  89. while (1)
  90. halt();
  91. }
  92. #else
  93. static inline void play_dead(void)
  94. {
  95. BUG();
  96. }
  97. #endif /* CONFIG_HOTPLUG_CPU */
  98. /*
  99. * The idle thread. There's no useful work to be
  100. * done, so just try to conserve power and have a
  101. * low exit latency (ie sit in a loop waiting for
  102. * somebody to say that they'd like to reschedule)
  103. */
  104. void cpu_idle(void)
  105. {
  106. int cpu = smp_processor_id();
  107. current_thread_info()->status |= TS_POLLING;
  108. /* endless idle loop with no priority at all */
  109. while (1) {
  110. tick_nohz_stop_sched_tick();
  111. while (!need_resched()) {
  112. check_pgt_cache();
  113. rmb();
  114. if (rcu_pending(cpu))
  115. rcu_check_callbacks(cpu, 0);
  116. if (cpu_is_offline(cpu))
  117. play_dead();
  118. local_irq_disable();
  119. __get_cpu_var(irq_stat).idle_timestamp = jiffies;
  120. /* Don't trace irqs off for idle */
  121. stop_critical_timings();
  122. pm_idle();
  123. start_critical_timings();
  124. }
  125. tick_nohz_restart_sched_tick();
  126. preempt_enable_no_resched();
  127. schedule();
  128. preempt_disable();
  129. }
  130. }
  131. void __show_registers(struct pt_regs *regs, int all)
  132. {
  133. unsigned long cr0 = 0L, cr2 = 0L, cr3 = 0L, cr4 = 0L;
  134. unsigned long d0, d1, d2, d3, d6, d7;
  135. unsigned long sp;
  136. unsigned short ss, gs;
  137. if (user_mode_vm(regs)) {
  138. sp = regs->sp;
  139. ss = regs->ss & 0xffff;
  140. savesegment(gs, gs);
  141. } else {
  142. sp = (unsigned long) (&regs->sp);
  143. savesegment(ss, ss);
  144. savesegment(gs, gs);
  145. }
  146. printk("\n");
  147. printk("Pid: %d, comm: %s %s (%s %.*s)\n",
  148. task_pid_nr(current), current->comm,
  149. print_tainted(), init_utsname()->release,
  150. (int)strcspn(init_utsname()->version, " "),
  151. init_utsname()->version);
  152. printk("EIP: %04x:[<%08lx>] EFLAGS: %08lx CPU: %d\n",
  153. (u16)regs->cs, regs->ip, regs->flags,
  154. smp_processor_id());
  155. print_symbol("EIP is at %s\n", regs->ip);
  156. printk("EAX: %08lx EBX: %08lx ECX: %08lx EDX: %08lx\n",
  157. regs->ax, regs->bx, regs->cx, regs->dx);
  158. printk("ESI: %08lx EDI: %08lx EBP: %08lx ESP: %08lx\n",
  159. regs->si, regs->di, regs->bp, sp);
  160. printk(" DS: %04x ES: %04x FS: %04x GS: %04x SS: %04x\n",
  161. (u16)regs->ds, (u16)regs->es, (u16)regs->fs, gs, ss);
  162. if (!all)
  163. return;
  164. cr0 = read_cr0();
  165. cr2 = read_cr2();
  166. cr3 = read_cr3();
  167. cr4 = read_cr4_safe();
  168. printk("CR0: %08lx CR2: %08lx CR3: %08lx CR4: %08lx\n",
  169. cr0, cr2, cr3, cr4);
  170. get_debugreg(d0, 0);
  171. get_debugreg(d1, 1);
  172. get_debugreg(d2, 2);
  173. get_debugreg(d3, 3);
  174. printk("DR0: %08lx DR1: %08lx DR2: %08lx DR3: %08lx\n",
  175. d0, d1, d2, d3);
  176. get_debugreg(d6, 6);
  177. get_debugreg(d7, 7);
  178. printk("DR6: %08lx DR7: %08lx\n",
  179. d6, d7);
  180. }
  181. void show_regs(struct pt_regs *regs)
  182. {
  183. __show_registers(regs, 1);
  184. show_trace(NULL, regs, &regs->sp, regs->bp);
  185. }
  186. /*
  187. * This gets run with %bx containing the
  188. * function to call, and %dx containing
  189. * the "args".
  190. */
  191. extern void kernel_thread_helper(void);
  192. /*
  193. * Create a kernel thread
  194. */
  195. int kernel_thread(int (*fn)(void *), void * arg, unsigned long flags)
  196. {
  197. struct pt_regs regs;
  198. memset(&regs, 0, sizeof(regs));
  199. regs.bx = (unsigned long) fn;
  200. regs.dx = (unsigned long) arg;
  201. regs.ds = __USER_DS;
  202. regs.es = __USER_DS;
  203. regs.fs = __KERNEL_PERCPU;
  204. regs.orig_ax = -1;
  205. regs.ip = (unsigned long) kernel_thread_helper;
  206. regs.cs = __KERNEL_CS | get_kernel_rpl();
  207. regs.flags = X86_EFLAGS_IF | X86_EFLAGS_SF | X86_EFLAGS_PF | 0x2;
  208. /* Ok, create the new process.. */
  209. return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, &regs, 0, NULL, NULL);
  210. }
  211. EXPORT_SYMBOL(kernel_thread);
  212. /*
  213. * Free current thread data structures etc..
  214. */
  215. void exit_thread(void)
  216. {
  217. /* The process may have allocated an io port bitmap... nuke it. */
  218. if (unlikely(test_thread_flag(TIF_IO_BITMAP))) {
  219. struct task_struct *tsk = current;
  220. struct thread_struct *t = &tsk->thread;
  221. int cpu = get_cpu();
  222. struct tss_struct *tss = &per_cpu(init_tss, cpu);
  223. kfree(t->io_bitmap_ptr);
  224. t->io_bitmap_ptr = NULL;
  225. clear_thread_flag(TIF_IO_BITMAP);
  226. /*
  227. * Careful, clear this in the TSS too:
  228. */
  229. memset(tss->io_bitmap, 0xff, tss->io_bitmap_max);
  230. t->io_bitmap_max = 0;
  231. tss->io_bitmap_owner = NULL;
  232. tss->io_bitmap_max = 0;
  233. tss->x86_tss.io_bitmap_base = INVALID_IO_BITMAP_OFFSET;
  234. put_cpu();
  235. }
  236. }
  237. void flush_thread(void)
  238. {
  239. struct task_struct *tsk = current;
  240. tsk->thread.debugreg0 = 0;
  241. tsk->thread.debugreg1 = 0;
  242. tsk->thread.debugreg2 = 0;
  243. tsk->thread.debugreg3 = 0;
  244. tsk->thread.debugreg6 = 0;
  245. tsk->thread.debugreg7 = 0;
  246. memset(tsk->thread.tls_array, 0, sizeof(tsk->thread.tls_array));
  247. clear_tsk_thread_flag(tsk, TIF_DEBUG);
  248. /*
  249. * Forget coprocessor state..
  250. */
  251. tsk->fpu_counter = 0;
  252. clear_fpu(tsk);
  253. clear_used_math();
  254. }
  255. void release_thread(struct task_struct *dead_task)
  256. {
  257. BUG_ON(dead_task->mm);
  258. release_vm86_irqs(dead_task);
  259. }
  260. /*
  261. * This gets called before we allocate a new thread and copy
  262. * the current task into it.
  263. */
  264. void prepare_to_copy(struct task_struct *tsk)
  265. {
  266. unlazy_fpu(tsk);
  267. }
  268. int copy_thread(int nr, unsigned long clone_flags, unsigned long sp,
  269. unsigned long unused,
  270. struct task_struct * p, struct pt_regs * regs)
  271. {
  272. struct pt_regs * childregs;
  273. struct task_struct *tsk;
  274. int err;
  275. childregs = task_pt_regs(p);
  276. *childregs = *regs;
  277. childregs->ax = 0;
  278. childregs->sp = sp;
  279. p->thread.sp = (unsigned long) childregs;
  280. p->thread.sp0 = (unsigned long) (childregs+1);
  281. p->thread.ip = (unsigned long) ret_from_fork;
  282. savesegment(gs, p->thread.gs);
  283. tsk = current;
  284. if (unlikely(test_tsk_thread_flag(tsk, TIF_IO_BITMAP))) {
  285. p->thread.io_bitmap_ptr = kmemdup(tsk->thread.io_bitmap_ptr,
  286. IO_BITMAP_BYTES, GFP_KERNEL);
  287. if (!p->thread.io_bitmap_ptr) {
  288. p->thread.io_bitmap_max = 0;
  289. return -ENOMEM;
  290. }
  291. set_tsk_thread_flag(p, TIF_IO_BITMAP);
  292. }
  293. err = 0;
  294. /*
  295. * Set a new TLS for the child thread?
  296. */
  297. if (clone_flags & CLONE_SETTLS)
  298. err = do_set_thread_area(p, -1,
  299. (struct user_desc __user *)childregs->si, 0);
  300. if (err && p->thread.io_bitmap_ptr) {
  301. kfree(p->thread.io_bitmap_ptr);
  302. p->thread.io_bitmap_max = 0;
  303. }
  304. return err;
  305. }
  306. void
  307. start_thread(struct pt_regs *regs, unsigned long new_ip, unsigned long new_sp)
  308. {
  309. __asm__("movl %0, %%gs" :: "r"(0));
  310. regs->fs = 0;
  311. set_fs(USER_DS);
  312. regs->ds = __USER_DS;
  313. regs->es = __USER_DS;
  314. regs->ss = __USER_DS;
  315. regs->cs = __USER_CS;
  316. regs->ip = new_ip;
  317. regs->sp = new_sp;
  318. /*
  319. * Free the old FP and other extended state
  320. */
  321. free_thread_xstate(current);
  322. }
  323. EXPORT_SYMBOL_GPL(start_thread);
  324. static void hard_disable_TSC(void)
  325. {
  326. write_cr4(read_cr4() | X86_CR4_TSD);
  327. }
  328. void disable_TSC(void)
  329. {
  330. preempt_disable();
  331. if (!test_and_set_thread_flag(TIF_NOTSC))
  332. /*
  333. * Must flip the CPU state synchronously with
  334. * TIF_NOTSC in the current running context.
  335. */
  336. hard_disable_TSC();
  337. preempt_enable();
  338. }
  339. static void hard_enable_TSC(void)
  340. {
  341. write_cr4(read_cr4() & ~X86_CR4_TSD);
  342. }
  343. static void enable_TSC(void)
  344. {
  345. preempt_disable();
  346. if (test_and_clear_thread_flag(TIF_NOTSC))
  347. /*
  348. * Must flip the CPU state synchronously with
  349. * TIF_NOTSC in the current running context.
  350. */
  351. hard_enable_TSC();
  352. preempt_enable();
  353. }
  354. int get_tsc_mode(unsigned long adr)
  355. {
  356. unsigned int val;
  357. if (test_thread_flag(TIF_NOTSC))
  358. val = PR_TSC_SIGSEGV;
  359. else
  360. val = PR_TSC_ENABLE;
  361. return put_user(val, (unsigned int __user *)adr);
  362. }
  363. int set_tsc_mode(unsigned int val)
  364. {
  365. if (val == PR_TSC_SIGSEGV)
  366. disable_TSC();
  367. else if (val == PR_TSC_ENABLE)
  368. enable_TSC();
  369. else
  370. return -EINVAL;
  371. return 0;
  372. }
  373. static noinline void
  374. __switch_to_xtra(struct task_struct *prev_p, struct task_struct *next_p,
  375. struct tss_struct *tss)
  376. {
  377. struct thread_struct *prev, *next;
  378. unsigned long debugctl;
  379. prev = &prev_p->thread;
  380. next = &next_p->thread;
  381. debugctl = prev->debugctlmsr;
  382. if (next->ds_area_msr != prev->ds_area_msr) {
  383. /* we clear debugctl to make sure DS
  384. * is not in use when we change it */
  385. debugctl = 0;
  386. update_debugctlmsr(0);
  387. wrmsr(MSR_IA32_DS_AREA, next->ds_area_msr, 0);
  388. }
  389. if (next->debugctlmsr != debugctl)
  390. update_debugctlmsr(next->debugctlmsr);
  391. if (test_tsk_thread_flag(next_p, TIF_DEBUG)) {
  392. set_debugreg(next->debugreg0, 0);
  393. set_debugreg(next->debugreg1, 1);
  394. set_debugreg(next->debugreg2, 2);
  395. set_debugreg(next->debugreg3, 3);
  396. /* no 4 and 5 */
  397. set_debugreg(next->debugreg6, 6);
  398. set_debugreg(next->debugreg7, 7);
  399. }
  400. if (test_tsk_thread_flag(prev_p, TIF_NOTSC) ^
  401. test_tsk_thread_flag(next_p, TIF_NOTSC)) {
  402. /* prev and next are different */
  403. if (test_tsk_thread_flag(next_p, TIF_NOTSC))
  404. hard_disable_TSC();
  405. else
  406. hard_enable_TSC();
  407. }
  408. #ifdef X86_BTS
  409. if (test_tsk_thread_flag(prev_p, TIF_BTS_TRACE_TS))
  410. ptrace_bts_take_timestamp(prev_p, BTS_TASK_DEPARTS);
  411. if (test_tsk_thread_flag(next_p, TIF_BTS_TRACE_TS))
  412. ptrace_bts_take_timestamp(next_p, BTS_TASK_ARRIVES);
  413. #endif
  414. if (!test_tsk_thread_flag(next_p, TIF_IO_BITMAP)) {
  415. /*
  416. * Disable the bitmap via an invalid offset. We still cache
  417. * the previous bitmap owner and the IO bitmap contents:
  418. */
  419. tss->x86_tss.io_bitmap_base = INVALID_IO_BITMAP_OFFSET;
  420. return;
  421. }
  422. if (likely(next == tss->io_bitmap_owner)) {
  423. /*
  424. * Previous owner of the bitmap (hence the bitmap content)
  425. * matches the next task, we dont have to do anything but
  426. * to set a valid offset in the TSS:
  427. */
  428. tss->x86_tss.io_bitmap_base = IO_BITMAP_OFFSET;
  429. return;
  430. }
  431. /*
  432. * Lazy TSS's I/O bitmap copy. We set an invalid offset here
  433. * and we let the task to get a GPF in case an I/O instruction
  434. * is performed. The handler of the GPF will verify that the
  435. * faulting task has a valid I/O bitmap and, it true, does the
  436. * real copy and restart the instruction. This will save us
  437. * redundant copies when the currently switched task does not
  438. * perform any I/O during its timeslice.
  439. */
  440. tss->x86_tss.io_bitmap_base = INVALID_IO_BITMAP_OFFSET_LAZY;
  441. }
  442. /*
  443. * switch_to(x,yn) should switch tasks from x to y.
  444. *
  445. * We fsave/fwait so that an exception goes off at the right time
  446. * (as a call from the fsave or fwait in effect) rather than to
  447. * the wrong process. Lazy FP saving no longer makes any sense
  448. * with modern CPU's, and this simplifies a lot of things (SMP
  449. * and UP become the same).
  450. *
  451. * NOTE! We used to use the x86 hardware context switching. The
  452. * reason for not using it any more becomes apparent when you
  453. * try to recover gracefully from saved state that is no longer
  454. * valid (stale segment register values in particular). With the
  455. * hardware task-switch, there is no way to fix up bad state in
  456. * a reasonable manner.
  457. *
  458. * The fact that Intel documents the hardware task-switching to
  459. * be slow is a fairly red herring - this code is not noticeably
  460. * faster. However, there _is_ some room for improvement here,
  461. * so the performance issues may eventually be a valid point.
  462. * More important, however, is the fact that this allows us much
  463. * more flexibility.
  464. *
  465. * The return value (in %ax) will be the "prev" task after
  466. * the task-switch, and shows up in ret_from_fork in entry.S,
  467. * for example.
  468. */
  469. struct task_struct * __switch_to(struct task_struct *prev_p, struct task_struct *next_p)
  470. {
  471. struct thread_struct *prev = &prev_p->thread,
  472. *next = &next_p->thread;
  473. int cpu = smp_processor_id();
  474. struct tss_struct *tss = &per_cpu(init_tss, cpu);
  475. /* never put a printk in __switch_to... printk() calls wake_up*() indirectly */
  476. __unlazy_fpu(prev_p);
  477. /* we're going to use this soon, after a few expensive things */
  478. if (next_p->fpu_counter > 5)
  479. prefetch(next->xstate);
  480. /*
  481. * Reload esp0.
  482. */
  483. load_sp0(tss, next);
  484. /*
  485. * Save away %gs. No need to save %fs, as it was saved on the
  486. * stack on entry. No need to save %es and %ds, as those are
  487. * always kernel segments while inside the kernel. Doing this
  488. * before setting the new TLS descriptors avoids the situation
  489. * where we temporarily have non-reloadable segments in %fs
  490. * and %gs. This could be an issue if the NMI handler ever
  491. * used %fs or %gs (it does not today), or if the kernel is
  492. * running inside of a hypervisor layer.
  493. */
  494. savesegment(gs, prev->gs);
  495. /*
  496. * Load the per-thread Thread-Local Storage descriptor.
  497. */
  498. load_TLS(next, cpu);
  499. /*
  500. * Restore IOPL if needed. In normal use, the flags restore
  501. * in the switch assembly will handle this. But if the kernel
  502. * is running virtualized at a non-zero CPL, the popf will
  503. * not restore flags, so it must be done in a separate step.
  504. */
  505. if (get_kernel_rpl() && unlikely(prev->iopl != next->iopl))
  506. set_iopl_mask(next->iopl);
  507. /*
  508. * Now maybe handle debug registers and/or IO bitmaps
  509. */
  510. if (unlikely(task_thread_info(prev_p)->flags & _TIF_WORK_CTXSW_PREV ||
  511. task_thread_info(next_p)->flags & _TIF_WORK_CTXSW_NEXT))
  512. __switch_to_xtra(prev_p, next_p, tss);
  513. /*
  514. * Leave lazy mode, flushing any hypercalls made here.
  515. * This must be done before restoring TLS segments so
  516. * the GDT and LDT are properly updated, and must be
  517. * done before math_state_restore, so the TS bit is up
  518. * to date.
  519. */
  520. arch_leave_lazy_cpu_mode();
  521. /* If the task has used fpu the last 5 timeslices, just do a full
  522. * restore of the math state immediately to avoid the trap; the
  523. * chances of needing FPU soon are obviously high now
  524. *
  525. * tsk_used_math() checks prevent calling math_state_restore(),
  526. * which can sleep in the case of !tsk_used_math()
  527. */
  528. if (tsk_used_math(next_p) && next_p->fpu_counter > 5)
  529. math_state_restore();
  530. /*
  531. * Restore %gs if needed (which is common)
  532. */
  533. if (prev->gs | next->gs)
  534. loadsegment(gs, next->gs);
  535. x86_write_percpu(current_task, next_p);
  536. return prev_p;
  537. }
  538. asmlinkage int sys_fork(struct pt_regs regs)
  539. {
  540. return do_fork(SIGCHLD, regs.sp, &regs, 0, NULL, NULL);
  541. }
  542. asmlinkage int sys_clone(struct pt_regs regs)
  543. {
  544. unsigned long clone_flags;
  545. unsigned long newsp;
  546. int __user *parent_tidptr, *child_tidptr;
  547. clone_flags = regs.bx;
  548. newsp = regs.cx;
  549. parent_tidptr = (int __user *)regs.dx;
  550. child_tidptr = (int __user *)regs.di;
  551. if (!newsp)
  552. newsp = regs.sp;
  553. return do_fork(clone_flags, newsp, &regs, 0, parent_tidptr, child_tidptr);
  554. }
  555. /*
  556. * This is trivial, and on the face of it looks like it
  557. * could equally well be done in user mode.
  558. *
  559. * Not so, for quite unobvious reasons - register pressure.
  560. * In user mode vfork() cannot have a stack frame, and if
  561. * done by calling the "clone()" system call directly, you
  562. * do not have enough call-clobbered registers to hold all
  563. * the information you need.
  564. */
  565. asmlinkage int sys_vfork(struct pt_regs regs)
  566. {
  567. return do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, regs.sp, &regs, 0, NULL, NULL);
  568. }
  569. /*
  570. * sys_execve() executes a new program.
  571. */
  572. asmlinkage int sys_execve(struct pt_regs regs)
  573. {
  574. int error;
  575. char * filename;
  576. filename = getname((char __user *) regs.bx);
  577. error = PTR_ERR(filename);
  578. if (IS_ERR(filename))
  579. goto out;
  580. error = do_execve(filename,
  581. (char __user * __user *) regs.cx,
  582. (char __user * __user *) regs.dx,
  583. &regs);
  584. if (error == 0) {
  585. /* Make sure we don't return using sysenter.. */
  586. set_thread_flag(TIF_IRET);
  587. }
  588. putname(filename);
  589. out:
  590. return error;
  591. }
  592. #define top_esp (THREAD_SIZE - sizeof(unsigned long))
  593. #define top_ebp (THREAD_SIZE - 2*sizeof(unsigned long))
  594. unsigned long get_wchan(struct task_struct *p)
  595. {
  596. unsigned long bp, sp, ip;
  597. unsigned long stack_page;
  598. int count = 0;
  599. if (!p || p == current || p->state == TASK_RUNNING)
  600. return 0;
  601. stack_page = (unsigned long)task_stack_page(p);
  602. sp = p->thread.sp;
  603. if (!stack_page || sp < stack_page || sp > top_esp+stack_page)
  604. return 0;
  605. /* include/asm-i386/system.h:switch_to() pushes bp last. */
  606. bp = *(unsigned long *) sp;
  607. do {
  608. if (bp < stack_page || bp > top_ebp+stack_page)
  609. return 0;
  610. ip = *(unsigned long *) (bp+4);
  611. if (!in_sched_functions(ip))
  612. return ip;
  613. bp = *(unsigned long *) bp;
  614. } while (count++ < 16);
  615. return 0;
  616. }
  617. unsigned long arch_align_stack(unsigned long sp)
  618. {
  619. if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
  620. sp -= get_random_int() % 8192;
  621. return sp & ~0xf;
  622. }
  623. unsigned long arch_randomize_brk(struct mm_struct *mm)
  624. {
  625. unsigned long range_end = mm->brk + 0x02000000;
  626. return randomize_range(mm->brk, range_end, 0) ? : mm->brk;
  627. }