process.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583
  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. #ifdef CONFIG_CC_STACKPROTECTOR
  177. #include <linux/stackprotector.h>
  178. unsigned long __stack_chk_guard __read_mostly;
  179. EXPORT_SYMBOL(__stack_chk_guard);
  180. #endif
  181. /*
  182. *
  183. */
  184. struct mips_frame_info {
  185. void *func;
  186. unsigned long func_size;
  187. int frame_size;
  188. int pc_offset;
  189. };
  190. #define J_TARGET(pc,target) \
  191. (((unsigned long)(pc) & 0xf0000000) | ((target) << 2))
  192. static inline int is_ra_save_ins(union mips_instruction *ip)
  193. {
  194. #ifdef CONFIG_CPU_MICROMIPS
  195. union mips_instruction mmi;
  196. /*
  197. * swsp ra,offset
  198. * swm16 reglist,offset(sp)
  199. * swm32 reglist,offset(sp)
  200. * sw32 ra,offset(sp)
  201. * jradiussp - NOT SUPPORTED
  202. *
  203. * microMIPS is way more fun...
  204. */
  205. if (mm_insn_16bit(ip->halfword[0])) {
  206. mmi.word = (ip->halfword[0] << 16);
  207. return ((mmi.mm16_r5_format.opcode == mm_swsp16_op &&
  208. mmi.mm16_r5_format.rt == 31) ||
  209. (mmi.mm16_m_format.opcode == mm_pool16c_op &&
  210. mmi.mm16_m_format.func == mm_swm16_op));
  211. }
  212. else {
  213. mmi.halfword[0] = ip->halfword[1];
  214. mmi.halfword[1] = ip->halfword[0];
  215. return ((mmi.mm_m_format.opcode == mm_pool32b_op &&
  216. mmi.mm_m_format.rd > 9 &&
  217. mmi.mm_m_format.base == 29 &&
  218. mmi.mm_m_format.func == mm_swm32_func) ||
  219. (mmi.i_format.opcode == mm_sw32_op &&
  220. mmi.i_format.rs == 29 &&
  221. mmi.i_format.rt == 31));
  222. }
  223. #else
  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. #endif
  229. }
  230. static inline int is_jump_ins(union mips_instruction *ip)
  231. {
  232. #ifdef CONFIG_CPU_MICROMIPS
  233. /*
  234. * jr16,jrc,jalr16,jalr16
  235. * jal
  236. * jalr/jr,jalr.hb/jr.hb,jalrs,jalrs.hb
  237. * jraddiusp - NOT SUPPORTED
  238. *
  239. * microMIPS is kind of more fun...
  240. */
  241. union mips_instruction mmi;
  242. mmi.word = (ip->halfword[0] << 16);
  243. if ((mmi.mm16_r5_format.opcode == mm_pool16c_op &&
  244. (mmi.mm16_r5_format.rt & mm_jr16_op) == mm_jr16_op) ||
  245. ip->j_format.opcode == mm_jal32_op)
  246. return 1;
  247. if (ip->r_format.opcode != mm_pool32a_op ||
  248. ip->r_format.func != mm_pool32axf_op)
  249. return 0;
  250. return (((ip->u_format.uimmediate >> 6) & mm_jalr_op) == mm_jalr_op);
  251. #else
  252. if (ip->j_format.opcode == j_op)
  253. return 1;
  254. if (ip->j_format.opcode == jal_op)
  255. return 1;
  256. if (ip->r_format.opcode != spec_op)
  257. return 0;
  258. return ip->r_format.func == jalr_op || ip->r_format.func == jr_op;
  259. #endif
  260. }
  261. static inline int is_sp_move_ins(union mips_instruction *ip)
  262. {
  263. #ifdef CONFIG_CPU_MICROMIPS
  264. /*
  265. * addiusp -imm
  266. * addius5 sp,-imm
  267. * addiu32 sp,sp,-imm
  268. * jradiussp - NOT SUPPORTED
  269. *
  270. * microMIPS is not more fun...
  271. */
  272. if (mm_insn_16bit(ip->halfword[0])) {
  273. union mips_instruction mmi;
  274. mmi.word = (ip->halfword[0] << 16);
  275. return ((mmi.mm16_r3_format.opcode == mm_pool16d_op &&
  276. mmi.mm16_r3_format.simmediate && mm_addiusp_func) ||
  277. (mmi.mm16_r5_format.opcode == mm_pool16d_op &&
  278. mmi.mm16_r5_format.rt == 29));
  279. }
  280. return (ip->mm_i_format.opcode == mm_addiu32_op &&
  281. ip->mm_i_format.rt == 29 && ip->mm_i_format.rs == 29);
  282. #else
  283. /* addiu/daddiu sp,sp,-imm */
  284. if (ip->i_format.rs != 29 || ip->i_format.rt != 29)
  285. return 0;
  286. if (ip->i_format.opcode == addiu_op || ip->i_format.opcode == daddiu_op)
  287. return 1;
  288. #endif
  289. return 0;
  290. }
  291. static int get_frame_info(struct mips_frame_info *info)
  292. {
  293. #ifdef CONFIG_CPU_MICROMIPS
  294. union mips_instruction *ip = (void *) (((char *) info->func) - 1);
  295. #else
  296. union mips_instruction *ip = info->func;
  297. #endif
  298. unsigned max_insns = info->func_size / sizeof(union mips_instruction);
  299. unsigned i;
  300. info->pc_offset = -1;
  301. info->frame_size = 0;
  302. if (!ip)
  303. goto err;
  304. if (max_insns == 0)
  305. max_insns = 128U; /* unknown function size */
  306. max_insns = min(128U, max_insns);
  307. for (i = 0; i < max_insns; i++, ip++) {
  308. if (is_jump_ins(ip))
  309. break;
  310. if (!info->frame_size) {
  311. if (is_sp_move_ins(ip))
  312. {
  313. #ifdef CONFIG_CPU_MICROMIPS
  314. if (mm_insn_16bit(ip->halfword[0]))
  315. {
  316. unsigned short tmp;
  317. if (ip->halfword[0] & mm_addiusp_func)
  318. {
  319. tmp = (((ip->halfword[0] >> 1) & 0x1ff) << 2);
  320. info->frame_size = -(signed short)(tmp | ((tmp & 0x100) ? 0xfe00 : 0));
  321. } else {
  322. tmp = (ip->halfword[0] >> 1);
  323. info->frame_size = -(signed short)(tmp & 0xf);
  324. }
  325. ip = (void *) &ip->halfword[1];
  326. ip--;
  327. } else
  328. #endif
  329. info->frame_size = - ip->i_format.simmediate;
  330. }
  331. continue;
  332. }
  333. if (info->pc_offset == -1 && is_ra_save_ins(ip)) {
  334. info->pc_offset =
  335. ip->i_format.simmediate / sizeof(long);
  336. break;
  337. }
  338. }
  339. if (info->frame_size && info->pc_offset >= 0) /* nested */
  340. return 0;
  341. if (info->pc_offset < 0) /* leaf */
  342. return 1;
  343. /* prologue seems boggus... */
  344. err:
  345. return -1;
  346. }
  347. static struct mips_frame_info schedule_mfi __read_mostly;
  348. #ifdef CONFIG_KALLSYMS
  349. static unsigned long get___schedule_addr(void)
  350. {
  351. return kallsyms_lookup_name("__schedule");
  352. }
  353. #else
  354. static unsigned long get___schedule_addr(void)
  355. {
  356. union mips_instruction *ip = (void *)schedule;
  357. int max_insns = 8;
  358. int i;
  359. for (i = 0; i < max_insns; i++, ip++) {
  360. if (ip->j_format.opcode == j_op)
  361. return J_TARGET(ip, ip->j_format.target);
  362. }
  363. return 0;
  364. }
  365. #endif
  366. static int __init frame_info_init(void)
  367. {
  368. unsigned long size = 0;
  369. #ifdef CONFIG_KALLSYMS
  370. unsigned long ofs;
  371. #endif
  372. unsigned long addr;
  373. addr = get___schedule_addr();
  374. if (!addr)
  375. addr = (unsigned long)schedule;
  376. #ifdef CONFIG_KALLSYMS
  377. kallsyms_lookup_size_offset(addr, &size, &ofs);
  378. #endif
  379. schedule_mfi.func = (void *)addr;
  380. schedule_mfi.func_size = size;
  381. get_frame_info(&schedule_mfi);
  382. /*
  383. * Without schedule() frame info, result given by
  384. * thread_saved_pc() and get_wchan() are not reliable.
  385. */
  386. if (schedule_mfi.pc_offset < 0)
  387. printk("Can't analyze schedule() prologue at %p\n", schedule);
  388. return 0;
  389. }
  390. arch_initcall(frame_info_init);
  391. /*
  392. * Return saved PC of a blocked thread.
  393. */
  394. unsigned long thread_saved_pc(struct task_struct *tsk)
  395. {
  396. struct thread_struct *t = &tsk->thread;
  397. /* New born processes are a special case */
  398. if (t->reg31 == (unsigned long) ret_from_fork)
  399. return t->reg31;
  400. if (schedule_mfi.pc_offset < 0)
  401. return 0;
  402. return ((unsigned long *)t->reg29)[schedule_mfi.pc_offset];
  403. }
  404. #ifdef CONFIG_KALLSYMS
  405. /* generic stack unwinding function */
  406. unsigned long notrace unwind_stack_by_address(unsigned long stack_page,
  407. unsigned long *sp,
  408. unsigned long pc,
  409. unsigned long *ra)
  410. {
  411. struct mips_frame_info info;
  412. unsigned long size, ofs;
  413. int leaf;
  414. extern void ret_from_irq(void);
  415. extern void ret_from_exception(void);
  416. if (!stack_page)
  417. return 0;
  418. /*
  419. * If we reached the bottom of interrupt context,
  420. * return saved pc in pt_regs.
  421. */
  422. if (pc == (unsigned long)ret_from_irq ||
  423. pc == (unsigned long)ret_from_exception) {
  424. struct pt_regs *regs;
  425. if (*sp >= stack_page &&
  426. *sp + sizeof(*regs) <= stack_page + THREAD_SIZE - 32) {
  427. regs = (struct pt_regs *)*sp;
  428. pc = regs->cp0_epc;
  429. if (__kernel_text_address(pc)) {
  430. *sp = regs->regs[29];
  431. *ra = regs->regs[31];
  432. return pc;
  433. }
  434. }
  435. return 0;
  436. }
  437. if (!kallsyms_lookup_size_offset(pc, &size, &ofs))
  438. return 0;
  439. /*
  440. * Return ra if an exception occurred at the first instruction
  441. */
  442. if (unlikely(ofs == 0)) {
  443. pc = *ra;
  444. *ra = 0;
  445. return pc;
  446. }
  447. info.func = (void *)(pc - ofs);
  448. info.func_size = ofs; /* analyze from start to ofs */
  449. leaf = get_frame_info(&info);
  450. if (leaf < 0)
  451. return 0;
  452. if (*sp < stack_page ||
  453. *sp + info.frame_size > stack_page + THREAD_SIZE - 32)
  454. return 0;
  455. if (leaf)
  456. /*
  457. * For some extreme cases, get_frame_info() can
  458. * consider wrongly a nested function as a leaf
  459. * one. In that cases avoid to return always the
  460. * same value.
  461. */
  462. pc = pc != *ra ? *ra : 0;
  463. else
  464. pc = ((unsigned long *)(*sp))[info.pc_offset];
  465. *sp += info.frame_size;
  466. *ra = 0;
  467. return __kernel_text_address(pc) ? pc : 0;
  468. }
  469. EXPORT_SYMBOL(unwind_stack_by_address);
  470. /* used by show_backtrace() */
  471. unsigned long unwind_stack(struct task_struct *task, unsigned long *sp,
  472. unsigned long pc, unsigned long *ra)
  473. {
  474. unsigned long stack_page = (unsigned long)task_stack_page(task);
  475. return unwind_stack_by_address(stack_page, sp, pc, ra);
  476. }
  477. #endif
  478. /*
  479. * get_wchan - a maintenance nightmare^W^Wpain in the ass ...
  480. */
  481. unsigned long get_wchan(struct task_struct *task)
  482. {
  483. unsigned long pc = 0;
  484. #ifdef CONFIG_KALLSYMS
  485. unsigned long sp;
  486. unsigned long ra = 0;
  487. #endif
  488. if (!task || task == current || task->state == TASK_RUNNING)
  489. goto out;
  490. if (!task_stack_page(task))
  491. goto out;
  492. pc = thread_saved_pc(task);
  493. #ifdef CONFIG_KALLSYMS
  494. sp = task->thread.reg29 + schedule_mfi.frame_size;
  495. while (in_sched_functions(pc))
  496. pc = unwind_stack(task, &sp, pc, &ra);
  497. #endif
  498. out:
  499. return pc;
  500. }
  501. /*
  502. * Don't forget that the stack pointer must be aligned on a 8 bytes
  503. * boundary for 32-bits ABI and 16 bytes for 64-bits ABI.
  504. */
  505. unsigned long arch_align_stack(unsigned long sp)
  506. {
  507. if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
  508. sp -= get_random_int() & ~PAGE_MASK;
  509. return sp & ALMASK;
  510. }