process.c 11 KB

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