process.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457
  1. /*
  2. * This file is subject to the terms and conditions of the GNU General Public
  3. * License. See the file "COPYING" in the main directory of this archive
  4. * for more details.
  5. *
  6. * Copyright (C) 1994 - 1999, 2000 by Ralf Baechle and others.
  7. * Copyright (C) 2005, 2006 by Ralf Baechle (ralf@linux-mips.org)
  8. * Copyright (C) 1999, 2000 Silicon Graphics, Inc.
  9. * Copyright (C) 2004 Thiemo Seufer
  10. */
  11. #include <linux/errno.h>
  12. #include <linux/sched.h>
  13. #include <linux/tick.h>
  14. #include <linux/kernel.h>
  15. #include <linux/mm.h>
  16. #include <linux/stddef.h>
  17. #include <linux/unistd.h>
  18. #include <linux/export.h>
  19. #include <linux/ptrace.h>
  20. #include <linux/mman.h>
  21. #include <linux/personality.h>
  22. #include <linux/sys.h>
  23. #include <linux/user.h>
  24. #include <linux/init.h>
  25. #include <linux/completion.h>
  26. #include <linux/kallsyms.h>
  27. #include <linux/random.h>
  28. #include <asm/asm.h>
  29. #include <asm/bootinfo.h>
  30. #include <asm/cpu.h>
  31. #include <asm/dsp.h>
  32. #include <asm/fpu.h>
  33. #include <asm/pgtable.h>
  34. #include <asm/mipsregs.h>
  35. #include <asm/processor.h>
  36. #include <asm/uaccess.h>
  37. #include <asm/io.h>
  38. #include <asm/elf.h>
  39. #include <asm/isadep.h>
  40. #include <asm/inst.h>
  41. #include <asm/stacktrace.h>
  42. #ifdef CONFIG_HOTPLUG_CPU
  43. void arch_cpu_idle_dead(void)
  44. {
  45. /* What the heck is this check doing ? */
  46. if (!cpu_isset(smp_processor_id(), cpu_callin_map))
  47. play_dead();
  48. }
  49. #endif
  50. void arch_cpu_idle(void)
  51. {
  52. #ifdef CONFIG_MIPS_MT_SMTC
  53. extern void smtc_idle_loop_hook(void);
  54. smtc_idle_loop_hook();
  55. #endif
  56. if (cpu_wait)
  57. (*cpu_wait)();
  58. else
  59. local_irq_enable();
  60. }
  61. asmlinkage void ret_from_fork(void);
  62. asmlinkage void ret_from_kernel_thread(void);
  63. void start_thread(struct pt_regs * regs, unsigned long pc, unsigned long sp)
  64. {
  65. unsigned long status;
  66. /* New thread loses kernel privileges. */
  67. status = regs->cp0_status & ~(ST0_CU0|ST0_CU1|ST0_FR|KU_MASK);
  68. #ifdef CONFIG_64BIT
  69. status |= test_thread_flag(TIF_32BIT_REGS) ? 0 : ST0_FR;
  70. #endif
  71. status |= KU_USER;
  72. regs->cp0_status = status;
  73. clear_used_math();
  74. clear_fpu_owner();
  75. if (cpu_has_dsp)
  76. __init_dsp();
  77. regs->cp0_epc = pc;
  78. regs->regs[29] = sp;
  79. }
  80. void exit_thread(void)
  81. {
  82. }
  83. void flush_thread(void)
  84. {
  85. }
  86. int copy_thread(unsigned long clone_flags, unsigned long usp,
  87. unsigned long arg, struct task_struct *p)
  88. {
  89. struct thread_info *ti = task_thread_info(p);
  90. struct pt_regs *childregs, *regs = current_pt_regs();
  91. unsigned long childksp;
  92. p->set_child_tid = p->clear_child_tid = NULL;
  93. childksp = (unsigned long)task_stack_page(p) + THREAD_SIZE - 32;
  94. preempt_disable();
  95. if (is_fpu_owner())
  96. save_fp(p);
  97. if (cpu_has_dsp)
  98. save_dsp(p);
  99. preempt_enable();
  100. /* set up new TSS. */
  101. childregs = (struct pt_regs *) childksp - 1;
  102. /* Put the stack after the struct pt_regs. */
  103. childksp = (unsigned long) childregs;
  104. p->thread.cp0_status = read_c0_status() & ~(ST0_CU2|ST0_CU1);
  105. if (unlikely(p->flags & PF_KTHREAD)) {
  106. unsigned long status = p->thread.cp0_status;
  107. memset(childregs, 0, sizeof(struct pt_regs));
  108. ti->addr_limit = KERNEL_DS;
  109. p->thread.reg16 = usp; /* fn */
  110. p->thread.reg17 = arg;
  111. p->thread.reg29 = childksp;
  112. p->thread.reg31 = (unsigned long) ret_from_kernel_thread;
  113. #if defined(CONFIG_CPU_R3000) || defined(CONFIG_CPU_TX39XX)
  114. status = (status & ~(ST0_KUP | ST0_IEP | ST0_IEC)) |
  115. ((status & (ST0_KUC | ST0_IEC)) << 2);
  116. #else
  117. status |= ST0_EXL;
  118. #endif
  119. childregs->cp0_status = status;
  120. return 0;
  121. }
  122. *childregs = *regs;
  123. childregs->regs[7] = 0; /* Clear error flag */
  124. childregs->regs[2] = 0; /* Child gets zero as return value */
  125. if (usp)
  126. childregs->regs[29] = usp;
  127. ti->addr_limit = USER_DS;
  128. p->thread.reg29 = (unsigned long) childregs;
  129. p->thread.reg31 = (unsigned long) ret_from_fork;
  130. /*
  131. * New tasks lose permission to use the fpu. This accelerates context
  132. * switching for most programs since they don't use the fpu.
  133. */
  134. childregs->cp0_status &= ~(ST0_CU2|ST0_CU1);
  135. #ifdef CONFIG_MIPS_MT_SMTC
  136. /*
  137. * SMTC restores TCStatus after Status, and the CU bits
  138. * are aliased there.
  139. */
  140. childregs->cp0_tcstatus &= ~(ST0_CU2|ST0_CU1);
  141. #endif
  142. clear_tsk_thread_flag(p, TIF_USEDFPU);
  143. #ifdef CONFIG_MIPS_MT_FPAFF
  144. clear_tsk_thread_flag(p, TIF_FPUBOUND);
  145. #endif /* CONFIG_MIPS_MT_FPAFF */
  146. if (clone_flags & CLONE_SETTLS)
  147. ti->tp_value = regs->regs[7];
  148. return 0;
  149. }
  150. /* Fill in the fpu structure for a core dump.. */
  151. int dump_fpu(struct pt_regs *regs, elf_fpregset_t *r)
  152. {
  153. memcpy(r, &current->thread.fpu, sizeof(current->thread.fpu));
  154. return 1;
  155. }
  156. void elf_dump_regs(elf_greg_t *gp, struct pt_regs *regs)
  157. {
  158. int i;
  159. for (i = 0; i < EF_R0; i++)
  160. gp[i] = 0;
  161. gp[EF_R0] = 0;
  162. for (i = 1; i <= 31; i++)
  163. gp[EF_R0 + i] = regs->regs[i];
  164. gp[EF_R26] = 0;
  165. gp[EF_R27] = 0;
  166. gp[EF_LO] = regs->lo;
  167. gp[EF_HI] = regs->hi;
  168. gp[EF_CP0_EPC] = regs->cp0_epc;
  169. gp[EF_CP0_BADVADDR] = regs->cp0_badvaddr;
  170. gp[EF_CP0_STATUS] = regs->cp0_status;
  171. gp[EF_CP0_CAUSE] = regs->cp0_cause;
  172. #ifdef EF_UNUSED0
  173. gp[EF_UNUSED0] = 0;
  174. #endif
  175. }
  176. int dump_task_regs(struct task_struct *tsk, elf_gregset_t *regs)
  177. {
  178. elf_dump_regs(*regs, task_pt_regs(tsk));
  179. return 1;
  180. }
  181. int dump_task_fpu(struct task_struct *t, elf_fpregset_t *fpr)
  182. {
  183. memcpy(fpr, &t->thread.fpu, sizeof(current->thread.fpu));
  184. return 1;
  185. }
  186. /*
  187. *
  188. */
  189. struct mips_frame_info {
  190. void *func;
  191. unsigned long func_size;
  192. int frame_size;
  193. int pc_offset;
  194. };
  195. static inline int is_ra_save_ins(union mips_instruction *ip)
  196. {
  197. /* sw / sd $ra, offset($sp) */
  198. return (ip->i_format.opcode == sw_op || ip->i_format.opcode == sd_op) &&
  199. ip->i_format.rs == 29 &&
  200. ip->i_format.rt == 31;
  201. }
  202. static inline int is_jal_jalr_jr_ins(union mips_instruction *ip)
  203. {
  204. if (ip->j_format.opcode == jal_op)
  205. return 1;
  206. if (ip->r_format.opcode != spec_op)
  207. return 0;
  208. return ip->r_format.func == jalr_op || ip->r_format.func == jr_op;
  209. }
  210. static inline int is_sp_move_ins(union mips_instruction *ip)
  211. {
  212. /* addiu/daddiu sp,sp,-imm */
  213. if (ip->i_format.rs != 29 || ip->i_format.rt != 29)
  214. return 0;
  215. if (ip->i_format.opcode == addiu_op || ip->i_format.opcode == daddiu_op)
  216. return 1;
  217. return 0;
  218. }
  219. static int get_frame_info(struct mips_frame_info *info)
  220. {
  221. union mips_instruction *ip = info->func;
  222. unsigned max_insns = info->func_size / sizeof(union mips_instruction);
  223. unsigned i;
  224. info->pc_offset = -1;
  225. info->frame_size = 0;
  226. if (!ip)
  227. goto err;
  228. if (max_insns == 0)
  229. max_insns = 128U; /* unknown function size */
  230. max_insns = min(128U, max_insns);
  231. for (i = 0; i < max_insns; i++, ip++) {
  232. if (is_jal_jalr_jr_ins(ip))
  233. break;
  234. if (!info->frame_size) {
  235. if (is_sp_move_ins(ip))
  236. info->frame_size = - ip->i_format.simmediate;
  237. continue;
  238. }
  239. if (info->pc_offset == -1 && is_ra_save_ins(ip)) {
  240. info->pc_offset =
  241. ip->i_format.simmediate / sizeof(long);
  242. break;
  243. }
  244. }
  245. if (info->frame_size && info->pc_offset >= 0) /* nested */
  246. return 0;
  247. if (info->pc_offset < 0) /* leaf */
  248. return 1;
  249. /* prologue seems boggus... */
  250. err:
  251. return -1;
  252. }
  253. static struct mips_frame_info schedule_mfi __read_mostly;
  254. static int __init frame_info_init(void)
  255. {
  256. unsigned long size = 0;
  257. #ifdef CONFIG_KALLSYMS
  258. unsigned long ofs;
  259. kallsyms_lookup_size_offset((unsigned long)schedule, &size, &ofs);
  260. #endif
  261. schedule_mfi.func = schedule;
  262. schedule_mfi.func_size = size;
  263. get_frame_info(&schedule_mfi);
  264. /*
  265. * Without schedule() frame info, result given by
  266. * thread_saved_pc() and get_wchan() are not reliable.
  267. */
  268. if (schedule_mfi.pc_offset < 0)
  269. printk("Can't analyze schedule() prologue at %p\n", schedule);
  270. return 0;
  271. }
  272. arch_initcall(frame_info_init);
  273. /*
  274. * Return saved PC of a blocked thread.
  275. */
  276. unsigned long thread_saved_pc(struct task_struct *tsk)
  277. {
  278. struct thread_struct *t = &tsk->thread;
  279. /* New born processes are a special case */
  280. if (t->reg31 == (unsigned long) ret_from_fork)
  281. return t->reg31;
  282. if (schedule_mfi.pc_offset < 0)
  283. return 0;
  284. return ((unsigned long *)t->reg29)[schedule_mfi.pc_offset];
  285. }
  286. #ifdef CONFIG_KALLSYMS
  287. /* generic stack unwinding function */
  288. unsigned long notrace unwind_stack_by_address(unsigned long stack_page,
  289. unsigned long *sp,
  290. unsigned long pc,
  291. unsigned long *ra)
  292. {
  293. struct mips_frame_info info;
  294. unsigned long size, ofs;
  295. int leaf;
  296. extern void ret_from_irq(void);
  297. extern void ret_from_exception(void);
  298. if (!stack_page)
  299. return 0;
  300. /*
  301. * If we reached the bottom of interrupt context,
  302. * return saved pc in pt_regs.
  303. */
  304. if (pc == (unsigned long)ret_from_irq ||
  305. pc == (unsigned long)ret_from_exception) {
  306. struct pt_regs *regs;
  307. if (*sp >= stack_page &&
  308. *sp + sizeof(*regs) <= stack_page + THREAD_SIZE - 32) {
  309. regs = (struct pt_regs *)*sp;
  310. pc = regs->cp0_epc;
  311. if (__kernel_text_address(pc)) {
  312. *sp = regs->regs[29];
  313. *ra = regs->regs[31];
  314. return pc;
  315. }
  316. }
  317. return 0;
  318. }
  319. if (!kallsyms_lookup_size_offset(pc, &size, &ofs))
  320. return 0;
  321. /*
  322. * Return ra if an exception occurred at the first instruction
  323. */
  324. if (unlikely(ofs == 0)) {
  325. pc = *ra;
  326. *ra = 0;
  327. return pc;
  328. }
  329. info.func = (void *)(pc - ofs);
  330. info.func_size = ofs; /* analyze from start to ofs */
  331. leaf = get_frame_info(&info);
  332. if (leaf < 0)
  333. return 0;
  334. if (*sp < stack_page ||
  335. *sp + info.frame_size > stack_page + THREAD_SIZE - 32)
  336. return 0;
  337. if (leaf)
  338. /*
  339. * For some extreme cases, get_frame_info() can
  340. * consider wrongly a nested function as a leaf
  341. * one. In that cases avoid to return always the
  342. * same value.
  343. */
  344. pc = pc != *ra ? *ra : 0;
  345. else
  346. pc = ((unsigned long *)(*sp))[info.pc_offset];
  347. *sp += info.frame_size;
  348. *ra = 0;
  349. return __kernel_text_address(pc) ? pc : 0;
  350. }
  351. EXPORT_SYMBOL(unwind_stack_by_address);
  352. /* used by show_backtrace() */
  353. unsigned long unwind_stack(struct task_struct *task, unsigned long *sp,
  354. unsigned long pc, unsigned long *ra)
  355. {
  356. unsigned long stack_page = (unsigned long)task_stack_page(task);
  357. return unwind_stack_by_address(stack_page, sp, pc, ra);
  358. }
  359. #endif
  360. /*
  361. * get_wchan - a maintenance nightmare^W^Wpain in the ass ...
  362. */
  363. unsigned long get_wchan(struct task_struct *task)
  364. {
  365. unsigned long pc = 0;
  366. #ifdef CONFIG_KALLSYMS
  367. unsigned long sp;
  368. unsigned long ra = 0;
  369. #endif
  370. if (!task || task == current || task->state == TASK_RUNNING)
  371. goto out;
  372. if (!task_stack_page(task))
  373. goto out;
  374. pc = thread_saved_pc(task);
  375. #ifdef CONFIG_KALLSYMS
  376. sp = task->thread.reg29 + schedule_mfi.frame_size;
  377. while (in_sched_functions(pc))
  378. pc = unwind_stack(task, &sp, pc, &ra);
  379. #endif
  380. out:
  381. return pc;
  382. }
  383. /*
  384. * Don't forget that the stack pointer must be aligned on a 8 bytes
  385. * boundary for 32-bits ABI and 16 bytes for 64-bits ABI.
  386. */
  387. unsigned long arch_align_stack(unsigned long sp)
  388. {
  389. if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
  390. sp -= get_random_int() & ~PAGE_MASK;
  391. return sp & ALMASK;
  392. }