process.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483
  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/kernel.h>
  15. #include <linux/mm.h>
  16. #include <linux/stddef.h>
  17. #include <linux/unistd.h>
  18. #include <linux/ptrace.h>
  19. #include <linux/slab.h>
  20. #include <linux/mman.h>
  21. #include <linux/personality.h>
  22. #include <linux/sys.h>
  23. #include <linux/user.h>
  24. #include <linux/a.out.h>
  25. #include <linux/init.h>
  26. #include <linux/completion.h>
  27. #include <linux/kallsyms.h>
  28. #include <asm/abi.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. #ifdef CONFIG_MIPS_MT_SMTC
  43. #include <asm/mipsmtregs.h>
  44. extern void smtc_idle_loop_hook(void);
  45. #endif /* CONFIG_MIPS_MT_SMTC */
  46. /*
  47. * The idle thread. There's no useful work to be done, so just try to conserve
  48. * power and have a low exit latency (ie sit in a loop waiting for somebody to
  49. * say that they'd like to reschedule)
  50. */
  51. ATTRIB_NORET void cpu_idle(void)
  52. {
  53. /* endless idle loop with no priority at all */
  54. while (1) {
  55. while (!need_resched()) {
  56. #ifdef CONFIG_MIPS_MT_SMTC
  57. smtc_idle_loop_hook();
  58. #endif /* CONFIG_MIPS_MT_SMTC */
  59. if (cpu_wait)
  60. (*cpu_wait)();
  61. }
  62. preempt_enable_no_resched();
  63. schedule();
  64. preempt_disable();
  65. }
  66. }
  67. /*
  68. * Native o32 and N64 ABI without DSP ASE
  69. */
  70. struct mips_abi mips_abi = {
  71. .do_signal = do_signal,
  72. #ifdef CONFIG_TRAD_SIGNALS
  73. .setup_frame = setup_frame,
  74. #endif
  75. .setup_rt_frame = setup_rt_frame
  76. };
  77. #ifdef CONFIG_MIPS32_O32
  78. /*
  79. * o32 compatibility on 64-bit kernels, without DSP ASE
  80. */
  81. struct mips_abi mips_abi_32 = {
  82. .do_signal = do_signal32,
  83. .setup_frame = setup_frame_32,
  84. .setup_rt_frame = setup_rt_frame_32
  85. };
  86. #endif /* CONFIG_MIPS32_O32 */
  87. #ifdef CONFIG_MIPS32_N32
  88. /*
  89. * N32 on 64-bit kernels, without DSP ASE
  90. */
  91. struct mips_abi mips_abi_n32 = {
  92. .do_signal = do_signal,
  93. .setup_rt_frame = setup_rt_frame_n32
  94. };
  95. #endif /* CONFIG_MIPS32_N32 */
  96. asmlinkage void ret_from_fork(void);
  97. void start_thread(struct pt_regs * regs, unsigned long pc, unsigned long sp)
  98. {
  99. unsigned long status;
  100. /* New thread loses kernel privileges. */
  101. status = regs->cp0_status & ~(ST0_CU0|ST0_CU1|KU_MASK);
  102. #ifdef CONFIG_64BIT
  103. status &= ~ST0_FR;
  104. status |= (current->thread.mflags & MF_32BIT_REGS) ? 0 : ST0_FR;
  105. #endif
  106. status |= KU_USER;
  107. regs->cp0_status = status;
  108. clear_used_math();
  109. lose_fpu();
  110. if (cpu_has_dsp)
  111. __init_dsp();
  112. regs->cp0_epc = pc;
  113. regs->regs[29] = sp;
  114. current_thread_info()->addr_limit = USER_DS;
  115. }
  116. void exit_thread(void)
  117. {
  118. }
  119. void flush_thread(void)
  120. {
  121. }
  122. int copy_thread(int nr, unsigned long clone_flags, unsigned long usp,
  123. unsigned long unused, struct task_struct *p, struct pt_regs *regs)
  124. {
  125. struct thread_info *ti = task_thread_info(p);
  126. struct pt_regs *childregs;
  127. long childksp;
  128. p->set_child_tid = p->clear_child_tid = NULL;
  129. childksp = (unsigned long)task_stack_page(p) + THREAD_SIZE - 32;
  130. preempt_disable();
  131. if (is_fpu_owner())
  132. save_fp(p);
  133. if (cpu_has_dsp)
  134. save_dsp(p);
  135. preempt_enable();
  136. /* set up new TSS. */
  137. childregs = (struct pt_regs *) childksp - 1;
  138. *childregs = *regs;
  139. childregs->regs[7] = 0; /* Clear error flag */
  140. #if defined(CONFIG_BINFMT_IRIX)
  141. if (current->personality != PER_LINUX) {
  142. /* Under IRIX things are a little different. */
  143. childregs->regs[3] = 1;
  144. regs->regs[3] = 0;
  145. }
  146. #endif
  147. childregs->regs[2] = 0; /* Child gets zero as return value */
  148. regs->regs[2] = p->pid;
  149. if (childregs->cp0_status & ST0_CU0) {
  150. childregs->regs[28] = (unsigned long) ti;
  151. childregs->regs[29] = childksp;
  152. ti->addr_limit = KERNEL_DS;
  153. } else {
  154. childregs->regs[29] = usp;
  155. ti->addr_limit = USER_DS;
  156. }
  157. p->thread.reg29 = (unsigned long) childregs;
  158. p->thread.reg31 = (unsigned long) ret_from_fork;
  159. /*
  160. * New tasks lose permission to use the fpu. This accelerates context
  161. * switching for most programs since they don't use the fpu.
  162. */
  163. p->thread.cp0_status = read_c0_status() & ~(ST0_CU2|ST0_CU1);
  164. childregs->cp0_status &= ~(ST0_CU2|ST0_CU1);
  165. clear_tsk_thread_flag(p, TIF_USEDFPU);
  166. #ifdef CONFIG_MIPS_MT_FPAFF
  167. /*
  168. * FPU affinity support is cleaner if we track the
  169. * user-visible CPU affinity from the very beginning.
  170. * The generic cpus_allowed mask will already have
  171. * been copied from the parent before copy_thread
  172. * is invoked.
  173. */
  174. p->thread.user_cpus_allowed = p->cpus_allowed;
  175. #endif /* CONFIG_MIPS_MT_FPAFF */
  176. if (clone_flags & CLONE_SETTLS)
  177. ti->tp_value = regs->regs[7];
  178. return 0;
  179. }
  180. /* Fill in the fpu structure for a core dump.. */
  181. int dump_fpu(struct pt_regs *regs, elf_fpregset_t *r)
  182. {
  183. memcpy(r, &current->thread.fpu, sizeof(current->thread.fpu));
  184. return 1;
  185. }
  186. void elf_dump_regs(elf_greg_t *gp, struct pt_regs *regs)
  187. {
  188. int i;
  189. for (i = 0; i < EF_R0; i++)
  190. gp[i] = 0;
  191. gp[EF_R0] = 0;
  192. for (i = 1; i <= 31; i++)
  193. gp[EF_R0 + i] = regs->regs[i];
  194. gp[EF_R26] = 0;
  195. gp[EF_R27] = 0;
  196. gp[EF_LO] = regs->lo;
  197. gp[EF_HI] = regs->hi;
  198. gp[EF_CP0_EPC] = regs->cp0_epc;
  199. gp[EF_CP0_BADVADDR] = regs->cp0_badvaddr;
  200. gp[EF_CP0_STATUS] = regs->cp0_status;
  201. gp[EF_CP0_CAUSE] = regs->cp0_cause;
  202. #ifdef EF_UNUSED0
  203. gp[EF_UNUSED0] = 0;
  204. #endif
  205. }
  206. int dump_task_regs (struct task_struct *tsk, elf_gregset_t *regs)
  207. {
  208. elf_dump_regs(*regs, task_pt_regs(tsk));
  209. return 1;
  210. }
  211. int dump_task_fpu (struct task_struct *t, elf_fpregset_t *fpr)
  212. {
  213. memcpy(fpr, &t->thread.fpu, sizeof(current->thread.fpu));
  214. return 1;
  215. }
  216. /*
  217. * Create a kernel thread
  218. */
  219. ATTRIB_NORET void kernel_thread_helper(void *arg, int (*fn)(void *))
  220. {
  221. do_exit(fn(arg));
  222. }
  223. long kernel_thread(int (*fn)(void *), void *arg, unsigned long flags)
  224. {
  225. struct pt_regs regs;
  226. memset(&regs, 0, sizeof(regs));
  227. regs.regs[4] = (unsigned long) arg;
  228. regs.regs[5] = (unsigned long) fn;
  229. regs.cp0_epc = (unsigned long) kernel_thread_helper;
  230. regs.cp0_status = read_c0_status();
  231. #if defined(CONFIG_CPU_R3000) || defined(CONFIG_CPU_TX39XX)
  232. regs.cp0_status &= ~(ST0_KUP | ST0_IEC);
  233. regs.cp0_status |= ST0_IEP;
  234. #else
  235. regs.cp0_status |= ST0_EXL;
  236. #endif
  237. /* Ok, create the new process.. */
  238. return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, &regs, 0, NULL, NULL);
  239. }
  240. static struct mips_frame_info {
  241. void *func;
  242. unsigned long func_size;
  243. int frame_size;
  244. int pc_offset;
  245. } *schedule_frame, mfinfo[64];
  246. static int mfinfo_num;
  247. static int get_frame_info(struct mips_frame_info *info)
  248. {
  249. int i;
  250. void *func = info->func;
  251. union mips_instruction *ip = (union mips_instruction *)func;
  252. info->pc_offset = -1;
  253. info->frame_size = 0;
  254. for (i = 0; i < 128; i++, ip++) {
  255. /* if jal, jalr, jr, stop. */
  256. if (ip->j_format.opcode == jal_op ||
  257. (ip->r_format.opcode == spec_op &&
  258. (ip->r_format.func == jalr_op ||
  259. ip->r_format.func == jr_op)))
  260. break;
  261. if (info->func_size && i >= info->func_size / 4)
  262. break;
  263. if (
  264. #ifdef CONFIG_32BIT
  265. ip->i_format.opcode == addiu_op &&
  266. #endif
  267. #ifdef CONFIG_64BIT
  268. ip->i_format.opcode == daddiu_op &&
  269. #endif
  270. ip->i_format.rs == 29 &&
  271. ip->i_format.rt == 29) {
  272. /* addiu/daddiu sp,sp,-imm */
  273. if (info->frame_size)
  274. continue;
  275. info->frame_size = - ip->i_format.simmediate;
  276. }
  277. if (
  278. #ifdef CONFIG_32BIT
  279. ip->i_format.opcode == sw_op &&
  280. #endif
  281. #ifdef CONFIG_64BIT
  282. ip->i_format.opcode == sd_op &&
  283. #endif
  284. ip->i_format.rs == 29 &&
  285. ip->i_format.rt == 31) {
  286. /* sw / sd $ra, offset($sp) */
  287. if (info->pc_offset != -1)
  288. continue;
  289. info->pc_offset =
  290. ip->i_format.simmediate / sizeof(long);
  291. }
  292. }
  293. if (info->frame_size && info->pc_offset >= 0) /* nested */
  294. return 0;
  295. if (info->pc_offset < 0) /* leaf */
  296. return 1;
  297. /* prologue seems boggus... */
  298. return -1;
  299. }
  300. static int __init frame_info_init(void)
  301. {
  302. int i;
  303. #ifdef CONFIG_KALLSYMS
  304. char *modname;
  305. char namebuf[KSYM_NAME_LEN + 1];
  306. unsigned long start, size, ofs;
  307. extern char __sched_text_start[], __sched_text_end[];
  308. extern char __lock_text_start[], __lock_text_end[];
  309. start = (unsigned long)__sched_text_start;
  310. for (i = 0; i < ARRAY_SIZE(mfinfo); i++) {
  311. if (start == (unsigned long)schedule)
  312. schedule_frame = &mfinfo[i];
  313. if (!kallsyms_lookup(start, &size, &ofs, &modname, namebuf))
  314. break;
  315. mfinfo[i].func = (void *)(start + ofs);
  316. mfinfo[i].func_size = size;
  317. start += size - ofs;
  318. if (start >= (unsigned long)__lock_text_end)
  319. break;
  320. if (start == (unsigned long)__sched_text_end)
  321. start = (unsigned long)__lock_text_start;
  322. }
  323. #else
  324. mfinfo[0].func = schedule;
  325. schedule_frame = &mfinfo[0];
  326. #endif
  327. for (i = 0; i < ARRAY_SIZE(mfinfo) && mfinfo[i].func; i++) {
  328. struct mips_frame_info *info = &mfinfo[i];
  329. if (get_frame_info(info)) {
  330. /* leaf or unknown */
  331. if (info->func == schedule)
  332. printk("Can't analyze prologue code at %p\n",
  333. info->func);
  334. }
  335. }
  336. mfinfo_num = i;
  337. return 0;
  338. }
  339. arch_initcall(frame_info_init);
  340. /*
  341. * Return saved PC of a blocked thread.
  342. */
  343. unsigned long thread_saved_pc(struct task_struct *tsk)
  344. {
  345. struct thread_struct *t = &tsk->thread;
  346. /* New born processes are a special case */
  347. if (t->reg31 == (unsigned long) ret_from_fork)
  348. return t->reg31;
  349. if (!schedule_frame || schedule_frame->pc_offset < 0)
  350. return 0;
  351. return ((unsigned long *)t->reg29)[schedule_frame->pc_offset];
  352. }
  353. /* get_wchan - a maintenance nightmare^W^Wpain in the ass ... */
  354. unsigned long get_wchan(struct task_struct *p)
  355. {
  356. unsigned long stack_page;
  357. unsigned long pc;
  358. #ifdef CONFIG_KALLSYMS
  359. unsigned long frame;
  360. #endif
  361. if (!p || p == current || p->state == TASK_RUNNING)
  362. return 0;
  363. stack_page = (unsigned long)task_stack_page(p);
  364. if (!stack_page || !mfinfo_num)
  365. return 0;
  366. pc = thread_saved_pc(p);
  367. #ifdef CONFIG_KALLSYMS
  368. if (!in_sched_functions(pc))
  369. return pc;
  370. frame = p->thread.reg29 + schedule_frame->frame_size;
  371. do {
  372. int i;
  373. if (frame < stack_page || frame > stack_page + THREAD_SIZE - 32)
  374. return 0;
  375. for (i = mfinfo_num - 1; i >= 0; i--) {
  376. if (pc >= (unsigned long) mfinfo[i].func)
  377. break;
  378. }
  379. if (i < 0)
  380. break;
  381. if (mfinfo[i].pc_offset < 0)
  382. break;
  383. pc = ((unsigned long *)frame)[mfinfo[i].pc_offset];
  384. if (!mfinfo[i].frame_size)
  385. break;
  386. frame += mfinfo[i].frame_size;
  387. } while (in_sched_functions(pc));
  388. #endif
  389. return pc;
  390. }
  391. #ifdef CONFIG_KALLSYMS
  392. /* used by show_frametrace() */
  393. unsigned long unwind_stack(struct task_struct *task,
  394. unsigned long **sp, unsigned long pc)
  395. {
  396. unsigned long stack_page;
  397. struct mips_frame_info info;
  398. char *modname;
  399. char namebuf[KSYM_NAME_LEN + 1];
  400. unsigned long size, ofs;
  401. stack_page = (unsigned long)task_stack_page(task);
  402. if (!stack_page)
  403. return 0;
  404. if (!kallsyms_lookup(pc, &size, &ofs, &modname, namebuf))
  405. return 0;
  406. if (ofs == 0)
  407. return 0;
  408. info.func = (void *)(pc - ofs);
  409. info.func_size = ofs; /* analyze from start to ofs */
  410. if (get_frame_info(&info)) {
  411. /* leaf or unknown */
  412. *sp += info.frame_size / sizeof(long);
  413. return 0;
  414. }
  415. if ((unsigned long)*sp < stack_page ||
  416. (unsigned long)*sp + info.frame_size / sizeof(long) >
  417. stack_page + THREAD_SIZE - 32)
  418. return 0;
  419. pc = (*sp)[info.pc_offset];
  420. *sp += info.frame_size / sizeof(long);
  421. return pc;
  422. }
  423. #endif