process.c 13 KB

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