process.c 14 KB

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