process_32.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511
  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/stackprotector.h>
  12. #include <linux/cpu.h>
  13. #include <linux/errno.h>
  14. #include <linux/sched.h>
  15. #include <linux/fs.h>
  16. #include <linux/kernel.h>
  17. #include <linux/mm.h>
  18. #include <linux/elfcore.h>
  19. #include <linux/smp.h>
  20. #include <linux/stddef.h>
  21. #include <linux/slab.h>
  22. #include <linux/vmalloc.h>
  23. #include <linux/user.h>
  24. #include <linux/interrupt.h>
  25. #include <linux/utsname.h>
  26. #include <linux/delay.h>
  27. #include <linux/reboot.h>
  28. #include <linux/init.h>
  29. #include <linux/mc146818rtc.h>
  30. #include <linux/module.h>
  31. #include <linux/kallsyms.h>
  32. #include <linux/ptrace.h>
  33. #include <linux/random.h>
  34. #include <linux/personality.h>
  35. #include <linux/tick.h>
  36. #include <linux/percpu.h>
  37. #include <linux/prctl.h>
  38. #include <linux/dmi.h>
  39. #include <linux/ftrace.h>
  40. #include <linux/uaccess.h>
  41. #include <linux/io.h>
  42. #include <linux/kdebug.h>
  43. #include <asm/pgtable.h>
  44. #include <asm/system.h>
  45. #include <asm/ldt.h>
  46. #include <asm/processor.h>
  47. #include <asm/i387.h>
  48. #include <asm/desc.h>
  49. #ifdef CONFIG_MATH_EMULATION
  50. #include <asm/math_emu.h>
  51. #endif
  52. #include <linux/err.h>
  53. #include <asm/tlbflush.h>
  54. #include <asm/cpu.h>
  55. #include <asm/idle.h>
  56. #include <asm/syscalls.h>
  57. #include <asm/ds.h>
  58. asmlinkage void ret_from_fork(void) __asm__("ret_from_fork");
  59. DEFINE_PER_CPU(struct task_struct *, current_task) = &init_task;
  60. EXPORT_PER_CPU_SYMBOL(current_task);
  61. /*
  62. * Return saved PC of a blocked thread.
  63. */
  64. unsigned long thread_saved_pc(struct task_struct *tsk)
  65. {
  66. return ((unsigned long *)tsk->thread.sp)[3];
  67. }
  68. #ifndef CONFIG_SMP
  69. static inline void play_dead(void)
  70. {
  71. BUG();
  72. }
  73. #endif
  74. /*
  75. * The idle thread. There's no useful work to be
  76. * done, so just try to conserve power and have a
  77. * low exit latency (ie sit in a loop waiting for
  78. * somebody to say that they'd like to reschedule)
  79. */
  80. void cpu_idle(void)
  81. {
  82. int cpu = smp_processor_id();
  83. /*
  84. * If we're the non-boot CPU, nothing set the stack canary up
  85. * for us. CPU0 already has it initialized but no harm in
  86. * doing it again. This is a good place for updating it, as
  87. * we wont ever return from this function (so the invalid
  88. * canaries already on the stack wont ever trigger).
  89. */
  90. boot_init_stack_canary();
  91. current_thread_info()->status |= TS_POLLING;
  92. /* endless idle loop with no priority at all */
  93. while (1) {
  94. tick_nohz_stop_sched_tick(1);
  95. while (!need_resched()) {
  96. check_pgt_cache();
  97. rmb();
  98. if (cpu_is_offline(cpu))
  99. play_dead();
  100. local_irq_disable();
  101. /* Don't trace irqs off for idle */
  102. stop_critical_timings();
  103. pm_idle();
  104. start_critical_timings();
  105. }
  106. tick_nohz_restart_sched_tick();
  107. preempt_enable_no_resched();
  108. schedule();
  109. preempt_disable();
  110. }
  111. }
  112. void __show_regs(struct pt_regs *regs, int all)
  113. {
  114. unsigned long cr0 = 0L, cr2 = 0L, cr3 = 0L, cr4 = 0L;
  115. unsigned long d0, d1, d2, d3, d6, d7;
  116. unsigned long sp;
  117. unsigned short ss, gs;
  118. const char *board;
  119. if (user_mode_vm(regs)) {
  120. sp = regs->sp;
  121. ss = regs->ss & 0xffff;
  122. gs = get_user_gs(regs);
  123. } else {
  124. sp = (unsigned long) (&regs->sp);
  125. savesegment(ss, ss);
  126. savesegment(gs, gs);
  127. }
  128. printk("\n");
  129. board = dmi_get_system_info(DMI_PRODUCT_NAME);
  130. if (!board)
  131. board = "";
  132. printk("Pid: %d, comm: %s %s (%s %.*s) %s\n",
  133. task_pid_nr(current), current->comm,
  134. print_tainted(), init_utsname()->release,
  135. (int)strcspn(init_utsname()->version, " "),
  136. init_utsname()->version, board);
  137. printk("EIP: %04x:[<%08lx>] EFLAGS: %08lx CPU: %d\n",
  138. (u16)regs->cs, regs->ip, regs->flags,
  139. smp_processor_id());
  140. print_symbol("EIP is at %s\n", regs->ip);
  141. printk("EAX: %08lx EBX: %08lx ECX: %08lx EDX: %08lx\n",
  142. regs->ax, regs->bx, regs->cx, regs->dx);
  143. printk("ESI: %08lx EDI: %08lx EBP: %08lx ESP: %08lx\n",
  144. regs->si, regs->di, regs->bp, sp);
  145. printk(" DS: %04x ES: %04x FS: %04x GS: %04x SS: %04x\n",
  146. (u16)regs->ds, (u16)regs->es, (u16)regs->fs, gs, ss);
  147. if (!all)
  148. return;
  149. cr0 = read_cr0();
  150. cr2 = read_cr2();
  151. cr3 = read_cr3();
  152. cr4 = read_cr4_safe();
  153. printk("CR0: %08lx CR2: %08lx CR3: %08lx CR4: %08lx\n",
  154. cr0, cr2, cr3, cr4);
  155. get_debugreg(d0, 0);
  156. get_debugreg(d1, 1);
  157. get_debugreg(d2, 2);
  158. get_debugreg(d3, 3);
  159. printk("DR0: %08lx DR1: %08lx DR2: %08lx DR3: %08lx\n",
  160. d0, d1, d2, d3);
  161. get_debugreg(d6, 6);
  162. get_debugreg(d7, 7);
  163. printk("DR6: %08lx DR7: %08lx\n",
  164. d6, d7);
  165. }
  166. void show_regs(struct pt_regs *regs)
  167. {
  168. __show_regs(regs, 1);
  169. show_trace(NULL, regs, &regs->sp, regs->bp);
  170. }
  171. /*
  172. * This gets run with %bx containing the
  173. * function to call, and %dx containing
  174. * the "args".
  175. */
  176. extern void kernel_thread_helper(void);
  177. /*
  178. * Create a kernel thread
  179. */
  180. int kernel_thread(int (*fn)(void *), void *arg, unsigned long flags)
  181. {
  182. struct pt_regs regs;
  183. memset(&regs, 0, sizeof(regs));
  184. regs.bx = (unsigned long) fn;
  185. regs.dx = (unsigned long) arg;
  186. regs.ds = __USER_DS;
  187. regs.es = __USER_DS;
  188. regs.fs = __KERNEL_PERCPU;
  189. regs.gs = __KERNEL_STACK_CANARY;
  190. regs.orig_ax = -1;
  191. regs.ip = (unsigned long) kernel_thread_helper;
  192. regs.cs = __KERNEL_CS | get_kernel_rpl();
  193. regs.flags = X86_EFLAGS_IF | X86_EFLAGS_SF | X86_EFLAGS_PF | 0x2;
  194. /* Ok, create the new process.. */
  195. return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, &regs, 0, NULL, NULL);
  196. }
  197. EXPORT_SYMBOL(kernel_thread);
  198. void release_thread(struct task_struct *dead_task)
  199. {
  200. BUG_ON(dead_task->mm);
  201. release_vm86_irqs(dead_task);
  202. }
  203. /*
  204. * This gets called before we allocate a new thread and copy
  205. * the current task into it.
  206. */
  207. void prepare_to_copy(struct task_struct *tsk)
  208. {
  209. unlazy_fpu(tsk);
  210. }
  211. int copy_thread(unsigned long clone_flags, unsigned long sp,
  212. unsigned long unused,
  213. struct task_struct *p, struct pt_regs *regs)
  214. {
  215. struct pt_regs *childregs;
  216. struct task_struct *tsk;
  217. int err;
  218. childregs = task_pt_regs(p);
  219. *childregs = *regs;
  220. childregs->ax = 0;
  221. childregs->sp = sp;
  222. p->thread.sp = (unsigned long) childregs;
  223. p->thread.sp0 = (unsigned long) (childregs+1);
  224. p->thread.ip = (unsigned long) ret_from_fork;
  225. task_user_gs(p) = get_user_gs(regs);
  226. tsk = current;
  227. if (unlikely(test_tsk_thread_flag(tsk, TIF_IO_BITMAP))) {
  228. p->thread.io_bitmap_ptr = kmemdup(tsk->thread.io_bitmap_ptr,
  229. IO_BITMAP_BYTES, GFP_KERNEL);
  230. if (!p->thread.io_bitmap_ptr) {
  231. p->thread.io_bitmap_max = 0;
  232. return -ENOMEM;
  233. }
  234. set_tsk_thread_flag(p, TIF_IO_BITMAP);
  235. }
  236. err = 0;
  237. /*
  238. * Set a new TLS for the child thread?
  239. */
  240. if (clone_flags & CLONE_SETTLS)
  241. err = do_set_thread_area(p, -1,
  242. (struct user_desc __user *)childregs->si, 0);
  243. if (err && p->thread.io_bitmap_ptr) {
  244. kfree(p->thread.io_bitmap_ptr);
  245. p->thread.io_bitmap_max = 0;
  246. }
  247. ds_copy_thread(p, current);
  248. clear_tsk_thread_flag(p, TIF_DEBUGCTLMSR);
  249. p->thread.debugctlmsr = 0;
  250. return err;
  251. }
  252. void
  253. start_thread(struct pt_regs *regs, unsigned long new_ip, unsigned long new_sp)
  254. {
  255. set_user_gs(regs, 0);
  256. regs->fs = 0;
  257. set_fs(USER_DS);
  258. regs->ds = __USER_DS;
  259. regs->es = __USER_DS;
  260. regs->ss = __USER_DS;
  261. regs->cs = __USER_CS;
  262. regs->ip = new_ip;
  263. regs->sp = new_sp;
  264. /*
  265. * Free the old FP and other extended state
  266. */
  267. free_thread_xstate(current);
  268. }
  269. EXPORT_SYMBOL_GPL(start_thread);
  270. /*
  271. * switch_to(x,yn) should switch tasks from x to y.
  272. *
  273. * We fsave/fwait so that an exception goes off at the right time
  274. * (as a call from the fsave or fwait in effect) rather than to
  275. * the wrong process. Lazy FP saving no longer makes any sense
  276. * with modern CPU's, and this simplifies a lot of things (SMP
  277. * and UP become the same).
  278. *
  279. * NOTE! We used to use the x86 hardware context switching. The
  280. * reason for not using it any more becomes apparent when you
  281. * try to recover gracefully from saved state that is no longer
  282. * valid (stale segment register values in particular). With the
  283. * hardware task-switch, there is no way to fix up bad state in
  284. * a reasonable manner.
  285. *
  286. * The fact that Intel documents the hardware task-switching to
  287. * be slow is a fairly red herring - this code is not noticeably
  288. * faster. However, there _is_ some room for improvement here,
  289. * so the performance issues may eventually be a valid point.
  290. * More important, however, is the fact that this allows us much
  291. * more flexibility.
  292. *
  293. * The return value (in %ax) will be the "prev" task after
  294. * the task-switch, and shows up in ret_from_fork in entry.S,
  295. * for example.
  296. */
  297. __notrace_funcgraph struct task_struct *
  298. __switch_to(struct task_struct *prev_p, struct task_struct *next_p)
  299. {
  300. struct thread_struct *prev = &prev_p->thread,
  301. *next = &next_p->thread;
  302. int cpu = smp_processor_id();
  303. struct tss_struct *tss = &per_cpu(init_tss, cpu);
  304. /* never put a printk in __switch_to... printk() calls wake_up*() indirectly */
  305. __unlazy_fpu(prev_p);
  306. /* we're going to use this soon, after a few expensive things */
  307. if (next_p->fpu_counter > 5)
  308. prefetch(next->xstate);
  309. /*
  310. * Reload esp0.
  311. */
  312. load_sp0(tss, next);
  313. /*
  314. * Save away %gs. No need to save %fs, as it was saved on the
  315. * stack on entry. No need to save %es and %ds, as those are
  316. * always kernel segments while inside the kernel. Doing this
  317. * before setting the new TLS descriptors avoids the situation
  318. * where we temporarily have non-reloadable segments in %fs
  319. * and %gs. This could be an issue if the NMI handler ever
  320. * used %fs or %gs (it does not today), or if the kernel is
  321. * running inside of a hypervisor layer.
  322. */
  323. lazy_save_gs(prev->gs);
  324. /*
  325. * Load the per-thread Thread-Local Storage descriptor.
  326. */
  327. load_TLS(next, cpu);
  328. /*
  329. * Restore IOPL if needed. In normal use, the flags restore
  330. * in the switch assembly will handle this. But if the kernel
  331. * is running virtualized at a non-zero CPL, the popf will
  332. * not restore flags, so it must be done in a separate step.
  333. */
  334. if (get_kernel_rpl() && unlikely(prev->iopl != next->iopl))
  335. set_iopl_mask(next->iopl);
  336. /*
  337. * Now maybe handle debug registers and/or IO bitmaps
  338. */
  339. if (unlikely(task_thread_info(prev_p)->flags & _TIF_WORK_CTXSW_PREV ||
  340. task_thread_info(next_p)->flags & _TIF_WORK_CTXSW_NEXT))
  341. __switch_to_xtra(prev_p, next_p, tss);
  342. /*
  343. * Leave lazy mode, flushing any hypercalls made here.
  344. * This must be done before restoring TLS segments so
  345. * the GDT and LDT are properly updated, and must be
  346. * done before math_state_restore, so the TS bit is up
  347. * to date.
  348. */
  349. arch_leave_lazy_cpu_mode();
  350. /* If the task has used fpu the last 5 timeslices, just do a full
  351. * restore of the math state immediately to avoid the trap; the
  352. * chances of needing FPU soon are obviously high now
  353. *
  354. * tsk_used_math() checks prevent calling math_state_restore(),
  355. * which can sleep in the case of !tsk_used_math()
  356. */
  357. if (tsk_used_math(next_p) && next_p->fpu_counter > 5)
  358. math_state_restore();
  359. /*
  360. * Restore %gs if needed (which is common)
  361. */
  362. if (prev->gs | next->gs)
  363. lazy_load_gs(next->gs);
  364. percpu_write(current_task, next_p);
  365. return prev_p;
  366. }
  367. int sys_clone(struct pt_regs *regs)
  368. {
  369. unsigned long clone_flags;
  370. unsigned long newsp;
  371. int __user *parent_tidptr, *child_tidptr;
  372. clone_flags = regs->bx;
  373. newsp = regs->cx;
  374. parent_tidptr = (int __user *)regs->dx;
  375. child_tidptr = (int __user *)regs->di;
  376. if (!newsp)
  377. newsp = regs->sp;
  378. return do_fork(clone_flags, newsp, regs, 0, parent_tidptr, child_tidptr);
  379. }
  380. /*
  381. * sys_execve() executes a new program.
  382. */
  383. int sys_execve(struct pt_regs *regs)
  384. {
  385. int error;
  386. char *filename;
  387. filename = getname((char __user *) regs->bx);
  388. error = PTR_ERR(filename);
  389. if (IS_ERR(filename))
  390. goto out;
  391. error = do_execve(filename,
  392. (char __user * __user *) regs->cx,
  393. (char __user * __user *) regs->dx,
  394. regs);
  395. if (error == 0) {
  396. /* Make sure we don't return using sysenter.. */
  397. set_thread_flag(TIF_IRET);
  398. }
  399. putname(filename);
  400. out:
  401. return error;
  402. }
  403. #define top_esp (THREAD_SIZE - sizeof(unsigned long))
  404. #define top_ebp (THREAD_SIZE - 2*sizeof(unsigned long))
  405. unsigned long get_wchan(struct task_struct *p)
  406. {
  407. unsigned long bp, sp, ip;
  408. unsigned long stack_page;
  409. int count = 0;
  410. if (!p || p == current || p->state == TASK_RUNNING)
  411. return 0;
  412. stack_page = (unsigned long)task_stack_page(p);
  413. sp = p->thread.sp;
  414. if (!stack_page || sp < stack_page || sp > top_esp+stack_page)
  415. return 0;
  416. /* include/asm-i386/system.h:switch_to() pushes bp last. */
  417. bp = *(unsigned long *) sp;
  418. do {
  419. if (bp < stack_page || bp > top_ebp+stack_page)
  420. return 0;
  421. ip = *(unsigned long *) (bp+4);
  422. if (!in_sched_functions(ip))
  423. return ip;
  424. bp = *(unsigned long *) bp;
  425. } while (count++ < 16);
  426. return 0;
  427. }
  428. unsigned long arch_align_stack(unsigned long sp)
  429. {
  430. if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
  431. sp -= get_random_int() % 8192;
  432. return sp & ~0xf;
  433. }
  434. unsigned long arch_randomize_brk(struct mm_struct *mm)
  435. {
  436. unsigned long range_end = mm->brk + 0x02000000;
  437. return randomize_range(mm->brk, range_end, 0) ? : mm->brk;
  438. }