process.c 11 KB

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