process.c 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275
  1. /*
  2. * This file handles the architecture dependent parts of process handling.
  3. *
  4. * Copyright IBM Corp. 1999, 2009
  5. * Author(s): Martin Schwidefsky <schwidefsky@de.ibm.com>,
  6. * Hartmut Penner <hp@de.ibm.com>,
  7. * Denis Joseph Barrow,
  8. */
  9. #include <linux/compiler.h>
  10. #include <linux/cpu.h>
  11. #include <linux/sched.h>
  12. #include <linux/kernel.h>
  13. #include <linux/mm.h>
  14. #include <linux/elfcore.h>
  15. #include <linux/smp.h>
  16. #include <linux/slab.h>
  17. #include <linux/interrupt.h>
  18. #include <linux/tick.h>
  19. #include <linux/personality.h>
  20. #include <linux/syscalls.h>
  21. #include <linux/compat.h>
  22. #include <linux/kprobes.h>
  23. #include <linux/random.h>
  24. #include <linux/module.h>
  25. #include <asm/io.h>
  26. #include <asm/processor.h>
  27. #include <asm/vtimer.h>
  28. #include <asm/exec.h>
  29. #include <asm/irq.h>
  30. #include <asm/nmi.h>
  31. #include <asm/smp.h>
  32. #include <asm/switch_to.h>
  33. #include <asm/runtime_instr.h>
  34. #include "entry.h"
  35. asmlinkage void ret_from_fork(void) asm ("ret_from_fork");
  36. /*
  37. * Return saved PC of a blocked thread. used in kernel/sched.
  38. * resume in entry.S does not create a new stack frame, it
  39. * just stores the registers %r6-%r15 to the frame given by
  40. * schedule. We want to return the address of the caller of
  41. * schedule, so we have to walk the backchain one time to
  42. * find the frame schedule() store its return address.
  43. */
  44. unsigned long thread_saved_pc(struct task_struct *tsk)
  45. {
  46. struct stack_frame *sf, *low, *high;
  47. if (!tsk || !task_stack_page(tsk))
  48. return 0;
  49. low = task_stack_page(tsk);
  50. high = (struct stack_frame *) task_pt_regs(tsk);
  51. sf = (struct stack_frame *) (tsk->thread.ksp & PSW_ADDR_INSN);
  52. if (sf <= low || sf > high)
  53. return 0;
  54. sf = (struct stack_frame *) (sf->back_chain & PSW_ADDR_INSN);
  55. if (sf <= low || sf > high)
  56. return 0;
  57. return sf->gprs[8];
  58. }
  59. void arch_cpu_idle(void)
  60. {
  61. local_mcck_disable();
  62. if (test_thread_flag(TIF_MCCK_PENDING)) {
  63. local_mcck_enable();
  64. local_irq_enable();
  65. return;
  66. }
  67. /* Halt the cpu and keep track of cpu time accounting. */
  68. vtime_stop_cpu();
  69. local_irq_enable();
  70. }
  71. void arch_cpu_idle_exit(void)
  72. {
  73. if (test_thread_flag(TIF_MCCK_PENDING))
  74. s390_handle_mcck();
  75. }
  76. void arch_cpu_idle_dead(void)
  77. {
  78. cpu_die();
  79. }
  80. extern void __kprobes kernel_thread_starter(void);
  81. /*
  82. * Free current thread data structures etc..
  83. */
  84. void exit_thread(void)
  85. {
  86. exit_thread_runtime_instr();
  87. }
  88. void flush_thread(void)
  89. {
  90. }
  91. void release_thread(struct task_struct *dead_task)
  92. {
  93. }
  94. int copy_thread(unsigned long clone_flags, unsigned long new_stackp,
  95. unsigned long arg, struct task_struct *p)
  96. {
  97. struct thread_info *ti;
  98. struct fake_frame
  99. {
  100. struct stack_frame sf;
  101. struct pt_regs childregs;
  102. } *frame;
  103. frame = container_of(task_pt_regs(p), struct fake_frame, childregs);
  104. p->thread.ksp = (unsigned long) frame;
  105. /* Save access registers to new thread structure. */
  106. save_access_regs(&p->thread.acrs[0]);
  107. /* start new process with ar4 pointing to the correct address space */
  108. p->thread.mm_segment = get_fs();
  109. /* Don't copy debug registers */
  110. memset(&p->thread.per_user, 0, sizeof(p->thread.per_user));
  111. memset(&p->thread.per_event, 0, sizeof(p->thread.per_event));
  112. clear_tsk_thread_flag(p, TIF_SINGLE_STEP);
  113. clear_tsk_thread_flag(p, TIF_PER_TRAP);
  114. /* Initialize per thread user and system timer values */
  115. ti = task_thread_info(p);
  116. ti->user_timer = 0;
  117. ti->system_timer = 0;
  118. frame->sf.back_chain = 0;
  119. /* new return point is ret_from_fork */
  120. frame->sf.gprs[8] = (unsigned long) ret_from_fork;
  121. /* fake return stack for resume(), don't go back to schedule */
  122. frame->sf.gprs[9] = (unsigned long) frame;
  123. /* Store access registers to kernel stack of new process. */
  124. if (unlikely(p->flags & PF_KTHREAD)) {
  125. /* kernel thread */
  126. memset(&frame->childregs, 0, sizeof(struct pt_regs));
  127. frame->childregs.psw.mask = psw_kernel_bits | PSW_MASK_DAT |
  128. PSW_MASK_IO | PSW_MASK_EXT | PSW_MASK_MCHECK;
  129. frame->childregs.psw.addr = PSW_ADDR_AMODE |
  130. (unsigned long) kernel_thread_starter;
  131. frame->childregs.gprs[9] = new_stackp; /* function */
  132. frame->childregs.gprs[10] = arg;
  133. frame->childregs.gprs[11] = (unsigned long) do_exit;
  134. frame->childregs.orig_gpr2 = -1;
  135. return 0;
  136. }
  137. frame->childregs = *current_pt_regs();
  138. frame->childregs.gprs[2] = 0; /* child returns 0 on fork. */
  139. if (new_stackp)
  140. frame->childregs.gprs[15] = new_stackp;
  141. /* Don't copy runtime instrumentation info */
  142. p->thread.ri_cb = NULL;
  143. p->thread.ri_signum = 0;
  144. frame->childregs.psw.mask &= ~PSW_MASK_RI;
  145. #ifndef CONFIG_64BIT
  146. /*
  147. * save fprs to current->thread.fp_regs to merge them with
  148. * the emulated registers and then copy the result to the child.
  149. */
  150. save_fp_regs(&current->thread.fp_regs);
  151. memcpy(&p->thread.fp_regs, &current->thread.fp_regs,
  152. sizeof(s390_fp_regs));
  153. /* Set a new TLS ? */
  154. if (clone_flags & CLONE_SETTLS)
  155. p->thread.acrs[0] = frame->childregs.gprs[6];
  156. #else /* CONFIG_64BIT */
  157. /* Save the fpu registers to new thread structure. */
  158. save_fp_regs(&p->thread.fp_regs);
  159. /* Set a new TLS ? */
  160. if (clone_flags & CLONE_SETTLS) {
  161. unsigned long tls = frame->childregs.gprs[6];
  162. if (is_compat_task()) {
  163. p->thread.acrs[0] = (unsigned int)tls;
  164. } else {
  165. p->thread.acrs[0] = (unsigned int)(tls >> 32);
  166. p->thread.acrs[1] = (unsigned int)tls;
  167. }
  168. }
  169. #endif /* CONFIG_64BIT */
  170. return 0;
  171. }
  172. asmlinkage void execve_tail(void)
  173. {
  174. current->thread.fp_regs.fpc = 0;
  175. if (MACHINE_HAS_IEEE)
  176. asm volatile("sfpc %0,%0" : : "d" (0));
  177. }
  178. /*
  179. * fill in the FPU structure for a core dump.
  180. */
  181. int dump_fpu (struct pt_regs * regs, s390_fp_regs *fpregs)
  182. {
  183. #ifndef CONFIG_64BIT
  184. /*
  185. * save fprs to current->thread.fp_regs to merge them with
  186. * the emulated registers and then copy the result to the dump.
  187. */
  188. save_fp_regs(&current->thread.fp_regs);
  189. memcpy(fpregs, &current->thread.fp_regs, sizeof(s390_fp_regs));
  190. #else /* CONFIG_64BIT */
  191. save_fp_regs(fpregs);
  192. #endif /* CONFIG_64BIT */
  193. return 1;
  194. }
  195. EXPORT_SYMBOL(dump_fpu);
  196. unsigned long get_wchan(struct task_struct *p)
  197. {
  198. struct stack_frame *sf, *low, *high;
  199. unsigned long return_address;
  200. int count;
  201. if (!p || p == current || p->state == TASK_RUNNING || !task_stack_page(p))
  202. return 0;
  203. low = task_stack_page(p);
  204. high = (struct stack_frame *) task_pt_regs(p);
  205. sf = (struct stack_frame *) (p->thread.ksp & PSW_ADDR_INSN);
  206. if (sf <= low || sf > high)
  207. return 0;
  208. for (count = 0; count < 16; count++) {
  209. sf = (struct stack_frame *) (sf->back_chain & PSW_ADDR_INSN);
  210. if (sf <= low || sf > high)
  211. return 0;
  212. return_address = sf->gprs[8] & PSW_ADDR_INSN;
  213. if (!in_sched_functions(return_address))
  214. return return_address;
  215. }
  216. return 0;
  217. }
  218. unsigned long arch_align_stack(unsigned long sp)
  219. {
  220. if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
  221. sp -= get_random_int() & ~PAGE_MASK;
  222. return sp & ~0xf;
  223. }
  224. static inline unsigned long brk_rnd(void)
  225. {
  226. /* 8MB for 32bit, 1GB for 64bit */
  227. if (is_32bit_task())
  228. return (get_random_int() & 0x7ffUL) << PAGE_SHIFT;
  229. else
  230. return (get_random_int() & 0x3ffffUL) << PAGE_SHIFT;
  231. }
  232. unsigned long arch_randomize_brk(struct mm_struct *mm)
  233. {
  234. unsigned long ret = PAGE_ALIGN(mm->brk + brk_rnd());
  235. if (ret < mm->brk)
  236. return mm->brk;
  237. return ret;
  238. }
  239. unsigned long randomize_et_dyn(unsigned long base)
  240. {
  241. unsigned long ret = PAGE_ALIGN(base + brk_rnd());
  242. if (!(current->flags & PF_RANDOMIZE))
  243. return base;
  244. if (ret < base)
  245. return base;
  246. return ret;
  247. }