process.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493
  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. /*
  43. * The idle thread. There's no useful work to be done, so just try to conserve
  44. * power and have a low exit latency (ie sit in a loop waiting for somebody to
  45. * say that they'd like to reschedule)
  46. */
  47. void __noreturn cpu_idle(void)
  48. {
  49. int cpu;
  50. /* CPU is going idle. */
  51. cpu = smp_processor_id();
  52. /* endless idle loop with no priority at all */
  53. while (1) {
  54. tick_nohz_idle_enter();
  55. rcu_idle_enter();
  56. while (!need_resched() && cpu_online(cpu)) {
  57. #ifdef CONFIG_MIPS_MT_SMTC
  58. extern void smtc_idle_loop_hook(void);
  59. smtc_idle_loop_hook();
  60. #endif
  61. if (cpu_wait) {
  62. /* Don't trace irqs off for idle */
  63. stop_critical_timings();
  64. (*cpu_wait)();
  65. start_critical_timings();
  66. }
  67. }
  68. #ifdef CONFIG_HOTPLUG_CPU
  69. if (!cpu_online(cpu) && !cpu_isset(cpu, cpu_callin_map))
  70. play_dead();
  71. #endif
  72. rcu_idle_exit();
  73. tick_nohz_idle_exit();
  74. schedule_preempt_disabled();
  75. }
  76. }
  77. asmlinkage void ret_from_fork(void);
  78. void start_thread(struct pt_regs * regs, unsigned long pc, unsigned long sp)
  79. {
  80. unsigned long status;
  81. /* New thread loses kernel privileges. */
  82. status = regs->cp0_status & ~(ST0_CU0|ST0_CU1|ST0_FR|KU_MASK);
  83. #ifdef CONFIG_64BIT
  84. status |= test_thread_flag(TIF_32BIT_REGS) ? 0 : ST0_FR;
  85. #endif
  86. status |= KU_USER;
  87. regs->cp0_status = status;
  88. clear_used_math();
  89. clear_fpu_owner();
  90. if (cpu_has_dsp)
  91. __init_dsp();
  92. regs->cp0_epc = pc;
  93. regs->regs[29] = sp;
  94. }
  95. void exit_thread(void)
  96. {
  97. }
  98. void flush_thread(void)
  99. {
  100. }
  101. int copy_thread(unsigned long clone_flags, unsigned long usp,
  102. unsigned long unused, struct task_struct *p, struct pt_regs *regs)
  103. {
  104. struct thread_info *ti = task_thread_info(p);
  105. struct pt_regs *childregs;
  106. unsigned long childksp;
  107. p->set_child_tid = p->clear_child_tid = NULL;
  108. childksp = (unsigned long)task_stack_page(p) + THREAD_SIZE - 32;
  109. preempt_disable();
  110. if (is_fpu_owner())
  111. save_fp(p);
  112. if (cpu_has_dsp)
  113. save_dsp(p);
  114. preempt_enable();
  115. /* set up new TSS. */
  116. childregs = (struct pt_regs *) childksp - 1;
  117. /* Put the stack after the struct pt_regs. */
  118. childksp = (unsigned long) childregs;
  119. *childregs = *regs;
  120. childregs->regs[7] = 0; /* Clear error flag */
  121. childregs->regs[2] = 0; /* Child gets zero as return value */
  122. if (childregs->cp0_status & ST0_CU0) {
  123. childregs->regs[28] = (unsigned long) ti;
  124. childregs->regs[29] = childksp;
  125. ti->addr_limit = KERNEL_DS;
  126. } else {
  127. childregs->regs[29] = usp;
  128. ti->addr_limit = USER_DS;
  129. }
  130. p->thread.reg29 = (unsigned long) childregs;
  131. p->thread.reg31 = (unsigned long) ret_from_fork;
  132. /*
  133. * New tasks lose permission to use the fpu. This accelerates context
  134. * switching for most programs since they don't use the fpu.
  135. */
  136. p->thread.cp0_status = read_c0_status() & ~(ST0_CU2|ST0_CU1);
  137. childregs->cp0_status &= ~(ST0_CU2|ST0_CU1);
  138. #ifdef CONFIG_MIPS_MT_SMTC
  139. /*
  140. * SMTC restores TCStatus after Status, and the CU bits
  141. * are aliased there.
  142. */
  143. childregs->cp0_tcstatus &= ~(ST0_CU2|ST0_CU1);
  144. #endif
  145. clear_tsk_thread_flag(p, TIF_USEDFPU);
  146. #ifdef CONFIG_MIPS_MT_FPAFF
  147. clear_tsk_thread_flag(p, TIF_FPUBOUND);
  148. #endif /* CONFIG_MIPS_MT_FPAFF */
  149. if (clone_flags & CLONE_SETTLS)
  150. ti->tp_value = regs->regs[7];
  151. return 0;
  152. }
  153. /* Fill in the fpu structure for a core dump.. */
  154. int dump_fpu(struct pt_regs *regs, elf_fpregset_t *r)
  155. {
  156. memcpy(r, &current->thread.fpu, sizeof(current->thread.fpu));
  157. return 1;
  158. }
  159. void elf_dump_regs(elf_greg_t *gp, struct pt_regs *regs)
  160. {
  161. int i;
  162. for (i = 0; i < EF_R0; i++)
  163. gp[i] = 0;
  164. gp[EF_R0] = 0;
  165. for (i = 1; i <= 31; i++)
  166. gp[EF_R0 + i] = regs->regs[i];
  167. gp[EF_R26] = 0;
  168. gp[EF_R27] = 0;
  169. gp[EF_LO] = regs->lo;
  170. gp[EF_HI] = regs->hi;
  171. gp[EF_CP0_EPC] = regs->cp0_epc;
  172. gp[EF_CP0_BADVADDR] = regs->cp0_badvaddr;
  173. gp[EF_CP0_STATUS] = regs->cp0_status;
  174. gp[EF_CP0_CAUSE] = regs->cp0_cause;
  175. #ifdef EF_UNUSED0
  176. gp[EF_UNUSED0] = 0;
  177. #endif
  178. }
  179. int dump_task_regs(struct task_struct *tsk, elf_gregset_t *regs)
  180. {
  181. elf_dump_regs(*regs, task_pt_regs(tsk));
  182. return 1;
  183. }
  184. int dump_task_fpu(struct task_struct *t, elf_fpregset_t *fpr)
  185. {
  186. memcpy(fpr, &t->thread.fpu, sizeof(current->thread.fpu));
  187. return 1;
  188. }
  189. /*
  190. * Create a kernel thread
  191. */
  192. static void __noreturn kernel_thread_helper(void *arg, int (*fn)(void *))
  193. {
  194. do_exit(fn(arg));
  195. }
  196. long kernel_thread(int (*fn)(void *), void *arg, unsigned long flags)
  197. {
  198. struct pt_regs regs;
  199. memset(&regs, 0, sizeof(regs));
  200. regs.regs[4] = (unsigned long) arg;
  201. regs.regs[5] = (unsigned long) fn;
  202. regs.cp0_epc = (unsigned long) kernel_thread_helper;
  203. regs.cp0_status = read_c0_status();
  204. #if defined(CONFIG_CPU_R3000) || defined(CONFIG_CPU_TX39XX)
  205. regs.cp0_status = (regs.cp0_status & ~(ST0_KUP | ST0_IEP | ST0_IEC)) |
  206. ((regs.cp0_status & (ST0_KUC | ST0_IEC)) << 2);
  207. #else
  208. regs.cp0_status |= ST0_EXL;
  209. #endif
  210. /* Ok, create the new process.. */
  211. return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, &regs, 0, NULL, NULL);
  212. }
  213. /*
  214. *
  215. */
  216. struct mips_frame_info {
  217. void *func;
  218. unsigned long func_size;
  219. int frame_size;
  220. int pc_offset;
  221. };
  222. static inline int is_ra_save_ins(union mips_instruction *ip)
  223. {
  224. /* sw / sd $ra, offset($sp) */
  225. return (ip->i_format.opcode == sw_op || ip->i_format.opcode == sd_op) &&
  226. ip->i_format.rs == 29 &&
  227. ip->i_format.rt == 31;
  228. }
  229. static inline int is_jal_jalr_jr_ins(union mips_instruction *ip)
  230. {
  231. if (ip->j_format.opcode == jal_op)
  232. return 1;
  233. if (ip->r_format.opcode != spec_op)
  234. return 0;
  235. return ip->r_format.func == jalr_op || ip->r_format.func == jr_op;
  236. }
  237. static inline int is_sp_move_ins(union mips_instruction *ip)
  238. {
  239. /* addiu/daddiu sp,sp,-imm */
  240. if (ip->i_format.rs != 29 || ip->i_format.rt != 29)
  241. return 0;
  242. if (ip->i_format.opcode == addiu_op || ip->i_format.opcode == daddiu_op)
  243. return 1;
  244. return 0;
  245. }
  246. static int get_frame_info(struct mips_frame_info *info)
  247. {
  248. union mips_instruction *ip = info->func;
  249. unsigned max_insns = info->func_size / sizeof(union mips_instruction);
  250. unsigned i;
  251. info->pc_offset = -1;
  252. info->frame_size = 0;
  253. if (!ip)
  254. goto err;
  255. if (max_insns == 0)
  256. max_insns = 128U; /* unknown function size */
  257. max_insns = min(128U, max_insns);
  258. for (i = 0; i < max_insns; i++, ip++) {
  259. if (is_jal_jalr_jr_ins(ip))
  260. break;
  261. if (!info->frame_size) {
  262. if (is_sp_move_ins(ip))
  263. info->frame_size = - ip->i_format.simmediate;
  264. continue;
  265. }
  266. if (info->pc_offset == -1 && is_ra_save_ins(ip)) {
  267. info->pc_offset =
  268. ip->i_format.simmediate / sizeof(long);
  269. break;
  270. }
  271. }
  272. if (info->frame_size && info->pc_offset >= 0) /* nested */
  273. return 0;
  274. if (info->pc_offset < 0) /* leaf */
  275. return 1;
  276. /* prologue seems boggus... */
  277. err:
  278. return -1;
  279. }
  280. static struct mips_frame_info schedule_mfi __read_mostly;
  281. static int __init frame_info_init(void)
  282. {
  283. unsigned long size = 0;
  284. #ifdef CONFIG_KALLSYMS
  285. unsigned long ofs;
  286. kallsyms_lookup_size_offset((unsigned long)schedule, &size, &ofs);
  287. #endif
  288. schedule_mfi.func = schedule;
  289. schedule_mfi.func_size = size;
  290. get_frame_info(&schedule_mfi);
  291. /*
  292. * Without schedule() frame info, result given by
  293. * thread_saved_pc() and get_wchan() are not reliable.
  294. */
  295. if (schedule_mfi.pc_offset < 0)
  296. printk("Can't analyze schedule() prologue at %p\n", schedule);
  297. return 0;
  298. }
  299. arch_initcall(frame_info_init);
  300. /*
  301. * Return saved PC of a blocked thread.
  302. */
  303. unsigned long thread_saved_pc(struct task_struct *tsk)
  304. {
  305. struct thread_struct *t = &tsk->thread;
  306. /* New born processes are a special case */
  307. if (t->reg31 == (unsigned long) ret_from_fork)
  308. return t->reg31;
  309. if (schedule_mfi.pc_offset < 0)
  310. return 0;
  311. return ((unsigned long *)t->reg29)[schedule_mfi.pc_offset];
  312. }
  313. #ifdef CONFIG_KALLSYMS
  314. /* generic stack unwinding function */
  315. unsigned long notrace unwind_stack_by_address(unsigned long stack_page,
  316. unsigned long *sp,
  317. unsigned long pc,
  318. unsigned long *ra)
  319. {
  320. struct mips_frame_info info;
  321. unsigned long size, ofs;
  322. int leaf;
  323. extern void ret_from_irq(void);
  324. extern void ret_from_exception(void);
  325. if (!stack_page)
  326. return 0;
  327. /*
  328. * If we reached the bottom of interrupt context,
  329. * return saved pc in pt_regs.
  330. */
  331. if (pc == (unsigned long)ret_from_irq ||
  332. pc == (unsigned long)ret_from_exception) {
  333. struct pt_regs *regs;
  334. if (*sp >= stack_page &&
  335. *sp + sizeof(*regs) <= stack_page + THREAD_SIZE - 32) {
  336. regs = (struct pt_regs *)*sp;
  337. pc = regs->cp0_epc;
  338. if (__kernel_text_address(pc)) {
  339. *sp = regs->regs[29];
  340. *ra = regs->regs[31];
  341. return pc;
  342. }
  343. }
  344. return 0;
  345. }
  346. if (!kallsyms_lookup_size_offset(pc, &size, &ofs))
  347. return 0;
  348. /*
  349. * Return ra if an exception occurred at the first instruction
  350. */
  351. if (unlikely(ofs == 0)) {
  352. pc = *ra;
  353. *ra = 0;
  354. return pc;
  355. }
  356. info.func = (void *)(pc - ofs);
  357. info.func_size = ofs; /* analyze from start to ofs */
  358. leaf = get_frame_info(&info);
  359. if (leaf < 0)
  360. return 0;
  361. if (*sp < stack_page ||
  362. *sp + info.frame_size > stack_page + THREAD_SIZE - 32)
  363. return 0;
  364. if (leaf)
  365. /*
  366. * For some extreme cases, get_frame_info() can
  367. * consider wrongly a nested function as a leaf
  368. * one. In that cases avoid to return always the
  369. * same value.
  370. */
  371. pc = pc != *ra ? *ra : 0;
  372. else
  373. pc = ((unsigned long *)(*sp))[info.pc_offset];
  374. *sp += info.frame_size;
  375. *ra = 0;
  376. return __kernel_text_address(pc) ? pc : 0;
  377. }
  378. EXPORT_SYMBOL(unwind_stack_by_address);
  379. /* used by show_backtrace() */
  380. unsigned long unwind_stack(struct task_struct *task, unsigned long *sp,
  381. unsigned long pc, unsigned long *ra)
  382. {
  383. unsigned long stack_page = (unsigned long)task_stack_page(task);
  384. return unwind_stack_by_address(stack_page, sp, pc, ra);
  385. }
  386. #endif
  387. /*
  388. * get_wchan - a maintenance nightmare^W^Wpain in the ass ...
  389. */
  390. unsigned long get_wchan(struct task_struct *task)
  391. {
  392. unsigned long pc = 0;
  393. #ifdef CONFIG_KALLSYMS
  394. unsigned long sp;
  395. unsigned long ra = 0;
  396. #endif
  397. if (!task || task == current || task->state == TASK_RUNNING)
  398. goto out;
  399. if (!task_stack_page(task))
  400. goto out;
  401. pc = thread_saved_pc(task);
  402. #ifdef CONFIG_KALLSYMS
  403. sp = task->thread.reg29 + schedule_mfi.frame_size;
  404. while (in_sched_functions(pc))
  405. pc = unwind_stack(task, &sp, pc, &ra);
  406. #endif
  407. out:
  408. return pc;
  409. }
  410. /*
  411. * Don't forget that the stack pointer must be aligned on a 8 bytes
  412. * boundary for 32-bits ABI and 16 bytes for 64-bits ABI.
  413. */
  414. unsigned long arch_align_stack(unsigned long sp)
  415. {
  416. if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
  417. sp -= get_random_int() & ~PAGE_MASK;
  418. return sp & ALMASK;
  419. }