process.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577
  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. * Copyright (C) 2013 Imagination Technologies Ltd.
  11. */
  12. #include <linux/errno.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/export.h>
  20. #include <linux/ptrace.h>
  21. #include <linux/mman.h>
  22. #include <linux/personality.h>
  23. #include <linux/sys.h>
  24. #include <linux/user.h>
  25. #include <linux/init.h>
  26. #include <linux/completion.h>
  27. #include <linux/kallsyms.h>
  28. #include <linux/random.h>
  29. #include <asm/asm.h>
  30. #include <asm/bootinfo.h>
  31. #include <asm/cpu.h>
  32. #include <asm/dsp.h>
  33. #include <asm/fpu.h>
  34. #include <asm/pgtable.h>
  35. #include <asm/mipsregs.h>
  36. #include <asm/processor.h>
  37. #include <asm/uaccess.h>
  38. #include <asm/io.h>
  39. #include <asm/elf.h>
  40. #include <asm/isadep.h>
  41. #include <asm/inst.h>
  42. #include <asm/stacktrace.h>
  43. #ifdef CONFIG_HOTPLUG_CPU
  44. void arch_cpu_idle_dead(void)
  45. {
  46. /* What the heck is this check doing ? */
  47. if (!cpu_isset(smp_processor_id(), cpu_callin_map))
  48. play_dead();
  49. }
  50. #endif
  51. asmlinkage void ret_from_fork(void);
  52. asmlinkage void ret_from_kernel_thread(void);
  53. void start_thread(struct pt_regs * regs, unsigned long pc, unsigned long sp)
  54. {
  55. unsigned long status;
  56. /* New thread loses kernel privileges. */
  57. status = regs->cp0_status & ~(ST0_CU0|ST0_CU1|ST0_FR|KU_MASK);
  58. #ifdef CONFIG_64BIT
  59. status |= test_thread_flag(TIF_32BIT_REGS) ? 0 : ST0_FR;
  60. #endif
  61. status |= KU_USER;
  62. regs->cp0_status = status;
  63. clear_used_math();
  64. clear_fpu_owner();
  65. if (cpu_has_dsp)
  66. __init_dsp();
  67. regs->cp0_epc = pc;
  68. regs->regs[29] = sp;
  69. }
  70. void exit_thread(void)
  71. {
  72. }
  73. void flush_thread(void)
  74. {
  75. }
  76. int copy_thread(unsigned long clone_flags, unsigned long usp,
  77. unsigned long arg, struct task_struct *p)
  78. {
  79. struct thread_info *ti = task_thread_info(p);
  80. struct pt_regs *childregs, *regs = current_pt_regs();
  81. unsigned long childksp;
  82. p->set_child_tid = p->clear_child_tid = NULL;
  83. childksp = (unsigned long)task_stack_page(p) + THREAD_SIZE - 32;
  84. preempt_disable();
  85. if (is_fpu_owner())
  86. save_fp(p);
  87. if (cpu_has_dsp)
  88. save_dsp(p);
  89. preempt_enable();
  90. /* set up new TSS. */
  91. childregs = (struct pt_regs *) childksp - 1;
  92. /* Put the stack after the struct pt_regs. */
  93. childksp = (unsigned long) childregs;
  94. p->thread.cp0_status = read_c0_status() & ~(ST0_CU2|ST0_CU1);
  95. if (unlikely(p->flags & PF_KTHREAD)) {
  96. unsigned long status = p->thread.cp0_status;
  97. memset(childregs, 0, sizeof(struct pt_regs));
  98. ti->addr_limit = KERNEL_DS;
  99. p->thread.reg16 = usp; /* fn */
  100. p->thread.reg17 = arg;
  101. p->thread.reg29 = childksp;
  102. p->thread.reg31 = (unsigned long) ret_from_kernel_thread;
  103. #if defined(CONFIG_CPU_R3000) || defined(CONFIG_CPU_TX39XX)
  104. status = (status & ~(ST0_KUP | ST0_IEP | ST0_IEC)) |
  105. ((status & (ST0_KUC | ST0_IEC)) << 2);
  106. #else
  107. status |= ST0_EXL;
  108. #endif
  109. childregs->cp0_status = status;
  110. return 0;
  111. }
  112. *childregs = *regs;
  113. childregs->regs[7] = 0; /* Clear error flag */
  114. childregs->regs[2] = 0; /* Child gets zero as return value */
  115. if (usp)
  116. childregs->regs[29] = usp;
  117. ti->addr_limit = USER_DS;
  118. p->thread.reg29 = (unsigned long) childregs;
  119. p->thread.reg31 = (unsigned long) ret_from_fork;
  120. /*
  121. * New tasks lose permission to use the fpu. This accelerates context
  122. * switching for most programs since they don't use the fpu.
  123. */
  124. childregs->cp0_status &= ~(ST0_CU2|ST0_CU1);
  125. #ifdef CONFIG_MIPS_MT_SMTC
  126. /*
  127. * SMTC restores TCStatus after Status, and the CU bits
  128. * are aliased there.
  129. */
  130. childregs->cp0_tcstatus &= ~(ST0_CU2|ST0_CU1);
  131. #endif
  132. clear_tsk_thread_flag(p, TIF_USEDFPU);
  133. #ifdef CONFIG_MIPS_MT_FPAFF
  134. clear_tsk_thread_flag(p, TIF_FPUBOUND);
  135. #endif /* CONFIG_MIPS_MT_FPAFF */
  136. if (clone_flags & CLONE_SETTLS)
  137. ti->tp_value = regs->regs[7];
  138. return 0;
  139. }
  140. /* Fill in the fpu structure for a core dump.. */
  141. int dump_fpu(struct pt_regs *regs, elf_fpregset_t *r)
  142. {
  143. memcpy(r, &current->thread.fpu, sizeof(current->thread.fpu));
  144. return 1;
  145. }
  146. void elf_dump_regs(elf_greg_t *gp, struct pt_regs *regs)
  147. {
  148. int i;
  149. for (i = 0; i < EF_R0; i++)
  150. gp[i] = 0;
  151. gp[EF_R0] = 0;
  152. for (i = 1; i <= 31; i++)
  153. gp[EF_R0 + i] = regs->regs[i];
  154. gp[EF_R26] = 0;
  155. gp[EF_R27] = 0;
  156. gp[EF_LO] = regs->lo;
  157. gp[EF_HI] = regs->hi;
  158. gp[EF_CP0_EPC] = regs->cp0_epc;
  159. gp[EF_CP0_BADVADDR] = regs->cp0_badvaddr;
  160. gp[EF_CP0_STATUS] = regs->cp0_status;
  161. gp[EF_CP0_CAUSE] = regs->cp0_cause;
  162. #ifdef EF_UNUSED0
  163. gp[EF_UNUSED0] = 0;
  164. #endif
  165. }
  166. int dump_task_regs(struct task_struct *tsk, elf_gregset_t *regs)
  167. {
  168. elf_dump_regs(*regs, task_pt_regs(tsk));
  169. return 1;
  170. }
  171. int dump_task_fpu(struct task_struct *t, elf_fpregset_t *fpr)
  172. {
  173. memcpy(fpr, &t->thread.fpu, sizeof(current->thread.fpu));
  174. return 1;
  175. }
  176. /*
  177. *
  178. */
  179. struct mips_frame_info {
  180. void *func;
  181. unsigned long func_size;
  182. int frame_size;
  183. int pc_offset;
  184. };
  185. #define J_TARGET(pc,target) \
  186. (((unsigned long)(pc) & 0xf0000000) | ((target) << 2))
  187. static inline int is_ra_save_ins(union mips_instruction *ip)
  188. {
  189. #ifdef CONFIG_CPU_MICROMIPS
  190. union mips_instruction mmi;
  191. /*
  192. * swsp ra,offset
  193. * swm16 reglist,offset(sp)
  194. * swm32 reglist,offset(sp)
  195. * sw32 ra,offset(sp)
  196. * jradiussp - NOT SUPPORTED
  197. *
  198. * microMIPS is way more fun...
  199. */
  200. if (mm_insn_16bit(ip->halfword[0])) {
  201. mmi.word = (ip->halfword[0] << 16);
  202. return ((mmi.mm16_r5_format.opcode == mm_swsp16_op &&
  203. mmi.mm16_r5_format.rt == 31) ||
  204. (mmi.mm16_m_format.opcode == mm_pool16c_op &&
  205. mmi.mm16_m_format.func == mm_swm16_op));
  206. }
  207. else {
  208. mmi.halfword[0] = ip->halfword[1];
  209. mmi.halfword[1] = ip->halfword[0];
  210. return ((mmi.mm_m_format.opcode == mm_pool32b_op &&
  211. mmi.mm_m_format.rd > 9 &&
  212. mmi.mm_m_format.base == 29 &&
  213. mmi.mm_m_format.func == mm_swm32_func) ||
  214. (mmi.i_format.opcode == mm_sw32_op &&
  215. mmi.i_format.rs == 29 &&
  216. mmi.i_format.rt == 31));
  217. }
  218. #else
  219. /* sw / sd $ra, offset($sp) */
  220. return (ip->i_format.opcode == sw_op || ip->i_format.opcode == sd_op) &&
  221. ip->i_format.rs == 29 &&
  222. ip->i_format.rt == 31;
  223. #endif
  224. }
  225. static inline int is_jump_ins(union mips_instruction *ip)
  226. {
  227. #ifdef CONFIG_CPU_MICROMIPS
  228. /*
  229. * jr16,jrc,jalr16,jalr16
  230. * jal
  231. * jalr/jr,jalr.hb/jr.hb,jalrs,jalrs.hb
  232. * jraddiusp - NOT SUPPORTED
  233. *
  234. * microMIPS is kind of more fun...
  235. */
  236. union mips_instruction mmi;
  237. mmi.word = (ip->halfword[0] << 16);
  238. if ((mmi.mm16_r5_format.opcode == mm_pool16c_op &&
  239. (mmi.mm16_r5_format.rt & mm_jr16_op) == mm_jr16_op) ||
  240. ip->j_format.opcode == mm_jal32_op)
  241. return 1;
  242. if (ip->r_format.opcode != mm_pool32a_op ||
  243. ip->r_format.func != mm_pool32axf_op)
  244. return 0;
  245. return (((ip->u_format.uimmediate >> 6) & mm_jalr_op) == mm_jalr_op);
  246. #else
  247. if (ip->j_format.opcode == j_op)
  248. return 1;
  249. if (ip->j_format.opcode == jal_op)
  250. return 1;
  251. if (ip->r_format.opcode != spec_op)
  252. return 0;
  253. return ip->r_format.func == jalr_op || ip->r_format.func == jr_op;
  254. #endif
  255. }
  256. static inline int is_sp_move_ins(union mips_instruction *ip)
  257. {
  258. #ifdef CONFIG_CPU_MICROMIPS
  259. /*
  260. * addiusp -imm
  261. * addius5 sp,-imm
  262. * addiu32 sp,sp,-imm
  263. * jradiussp - NOT SUPPORTED
  264. *
  265. * microMIPS is not more fun...
  266. */
  267. if (mm_insn_16bit(ip->halfword[0])) {
  268. union mips_instruction mmi;
  269. mmi.word = (ip->halfword[0] << 16);
  270. return ((mmi.mm16_r3_format.opcode == mm_pool16d_op &&
  271. mmi.mm16_r3_format.simmediate && mm_addiusp_func) ||
  272. (mmi.mm16_r5_format.opcode == mm_pool16d_op &&
  273. mmi.mm16_r5_format.rt == 29));
  274. }
  275. return (ip->mm_i_format.opcode == mm_addiu32_op &&
  276. ip->mm_i_format.rt == 29 && ip->mm_i_format.rs == 29);
  277. #else
  278. /* addiu/daddiu sp,sp,-imm */
  279. if (ip->i_format.rs != 29 || ip->i_format.rt != 29)
  280. return 0;
  281. if (ip->i_format.opcode == addiu_op || ip->i_format.opcode == daddiu_op)
  282. return 1;
  283. #endif
  284. return 0;
  285. }
  286. static int get_frame_info(struct mips_frame_info *info)
  287. {
  288. #ifdef CONFIG_CPU_MICROMIPS
  289. union mips_instruction *ip = (void *) (((char *) info->func) - 1);
  290. #else
  291. union mips_instruction *ip = info->func;
  292. #endif
  293. unsigned max_insns = info->func_size / sizeof(union mips_instruction);
  294. unsigned i;
  295. info->pc_offset = -1;
  296. info->frame_size = 0;
  297. if (!ip)
  298. goto err;
  299. if (max_insns == 0)
  300. max_insns = 128U; /* unknown function size */
  301. max_insns = min(128U, max_insns);
  302. for (i = 0; i < max_insns; i++, ip++) {
  303. if (is_jump_ins(ip))
  304. break;
  305. if (!info->frame_size) {
  306. if (is_sp_move_ins(ip))
  307. {
  308. #ifdef CONFIG_CPU_MICROMIPS
  309. if (mm_insn_16bit(ip->halfword[0]))
  310. {
  311. unsigned short tmp;
  312. if (ip->halfword[0] & mm_addiusp_func)
  313. {
  314. tmp = (((ip->halfword[0] >> 1) & 0x1ff) << 2);
  315. info->frame_size = -(signed short)(tmp | ((tmp & 0x100) ? 0xfe00 : 0));
  316. } else {
  317. tmp = (ip->halfword[0] >> 1);
  318. info->frame_size = -(signed short)(tmp & 0xf);
  319. }
  320. ip = (void *) &ip->halfword[1];
  321. ip--;
  322. } else
  323. #endif
  324. info->frame_size = - ip->i_format.simmediate;
  325. }
  326. continue;
  327. }
  328. if (info->pc_offset == -1 && is_ra_save_ins(ip)) {
  329. info->pc_offset =
  330. ip->i_format.simmediate / sizeof(long);
  331. break;
  332. }
  333. }
  334. if (info->frame_size && info->pc_offset >= 0) /* nested */
  335. return 0;
  336. if (info->pc_offset < 0) /* leaf */
  337. return 1;
  338. /* prologue seems boggus... */
  339. err:
  340. return -1;
  341. }
  342. static struct mips_frame_info schedule_mfi __read_mostly;
  343. #ifdef CONFIG_KALLSYMS
  344. static unsigned long get___schedule_addr(void)
  345. {
  346. return kallsyms_lookup_name("__schedule");
  347. }
  348. #else
  349. static unsigned long get___schedule_addr(void)
  350. {
  351. union mips_instruction *ip = (void *)schedule;
  352. int max_insns = 8;
  353. int i;
  354. for (i = 0; i < max_insns; i++, ip++) {
  355. if (ip->j_format.opcode == j_op)
  356. return J_TARGET(ip, ip->j_format.target);
  357. }
  358. return 0;
  359. }
  360. #endif
  361. static int __init frame_info_init(void)
  362. {
  363. unsigned long size = 0;
  364. #ifdef CONFIG_KALLSYMS
  365. unsigned long ofs;
  366. #endif
  367. unsigned long addr;
  368. addr = get___schedule_addr();
  369. if (!addr)
  370. addr = (unsigned long)schedule;
  371. #ifdef CONFIG_KALLSYMS
  372. kallsyms_lookup_size_offset(addr, &size, &ofs);
  373. #endif
  374. schedule_mfi.func = (void *)addr;
  375. schedule_mfi.func_size = size;
  376. get_frame_info(&schedule_mfi);
  377. /*
  378. * Without schedule() frame info, result given by
  379. * thread_saved_pc() and get_wchan() are not reliable.
  380. */
  381. if (schedule_mfi.pc_offset < 0)
  382. printk("Can't analyze schedule() prologue at %p\n", schedule);
  383. return 0;
  384. }
  385. arch_initcall(frame_info_init);
  386. /*
  387. * Return saved PC of a blocked thread.
  388. */
  389. unsigned long thread_saved_pc(struct task_struct *tsk)
  390. {
  391. struct thread_struct *t = &tsk->thread;
  392. /* New born processes are a special case */
  393. if (t->reg31 == (unsigned long) ret_from_fork)
  394. return t->reg31;
  395. if (schedule_mfi.pc_offset < 0)
  396. return 0;
  397. return ((unsigned long *)t->reg29)[schedule_mfi.pc_offset];
  398. }
  399. #ifdef CONFIG_KALLSYMS
  400. /* generic stack unwinding function */
  401. unsigned long notrace unwind_stack_by_address(unsigned long stack_page,
  402. unsigned long *sp,
  403. unsigned long pc,
  404. unsigned long *ra)
  405. {
  406. struct mips_frame_info info;
  407. unsigned long size, ofs;
  408. int leaf;
  409. extern void ret_from_irq(void);
  410. extern void ret_from_exception(void);
  411. if (!stack_page)
  412. return 0;
  413. /*
  414. * If we reached the bottom of interrupt context,
  415. * return saved pc in pt_regs.
  416. */
  417. if (pc == (unsigned long)ret_from_irq ||
  418. pc == (unsigned long)ret_from_exception) {
  419. struct pt_regs *regs;
  420. if (*sp >= stack_page &&
  421. *sp + sizeof(*regs) <= stack_page + THREAD_SIZE - 32) {
  422. regs = (struct pt_regs *)*sp;
  423. pc = regs->cp0_epc;
  424. if (__kernel_text_address(pc)) {
  425. *sp = regs->regs[29];
  426. *ra = regs->regs[31];
  427. return pc;
  428. }
  429. }
  430. return 0;
  431. }
  432. if (!kallsyms_lookup_size_offset(pc, &size, &ofs))
  433. return 0;
  434. /*
  435. * Return ra if an exception occurred at the first instruction
  436. */
  437. if (unlikely(ofs == 0)) {
  438. pc = *ra;
  439. *ra = 0;
  440. return pc;
  441. }
  442. info.func = (void *)(pc - ofs);
  443. info.func_size = ofs; /* analyze from start to ofs */
  444. leaf = get_frame_info(&info);
  445. if (leaf < 0)
  446. return 0;
  447. if (*sp < stack_page ||
  448. *sp + info.frame_size > stack_page + THREAD_SIZE - 32)
  449. return 0;
  450. if (leaf)
  451. /*
  452. * For some extreme cases, get_frame_info() can
  453. * consider wrongly a nested function as a leaf
  454. * one. In that cases avoid to return always the
  455. * same value.
  456. */
  457. pc = pc != *ra ? *ra : 0;
  458. else
  459. pc = ((unsigned long *)(*sp))[info.pc_offset];
  460. *sp += info.frame_size;
  461. *ra = 0;
  462. return __kernel_text_address(pc) ? pc : 0;
  463. }
  464. EXPORT_SYMBOL(unwind_stack_by_address);
  465. /* used by show_backtrace() */
  466. unsigned long unwind_stack(struct task_struct *task, unsigned long *sp,
  467. unsigned long pc, unsigned long *ra)
  468. {
  469. unsigned long stack_page = (unsigned long)task_stack_page(task);
  470. return unwind_stack_by_address(stack_page, sp, pc, ra);
  471. }
  472. #endif
  473. /*
  474. * get_wchan - a maintenance nightmare^W^Wpain in the ass ...
  475. */
  476. unsigned long get_wchan(struct task_struct *task)
  477. {
  478. unsigned long pc = 0;
  479. #ifdef CONFIG_KALLSYMS
  480. unsigned long sp;
  481. unsigned long ra = 0;
  482. #endif
  483. if (!task || task == current || task->state == TASK_RUNNING)
  484. goto out;
  485. if (!task_stack_page(task))
  486. goto out;
  487. pc = thread_saved_pc(task);
  488. #ifdef CONFIG_KALLSYMS
  489. sp = task->thread.reg29 + schedule_mfi.frame_size;
  490. while (in_sched_functions(pc))
  491. pc = unwind_stack(task, &sp, pc, &ra);
  492. #endif
  493. out:
  494. return pc;
  495. }
  496. /*
  497. * Don't forget that the stack pointer must be aligned on a 8 bytes
  498. * boundary for 32-bits ABI and 16 bytes for 64-bits ABI.
  499. */
  500. unsigned long arch_align_stack(unsigned long sp)
  501. {
  502. if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
  503. sp -= get_random_int() & ~PAGE_MASK;
  504. return sp & ALMASK;
  505. }