process.c 11 KB

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