process_64.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550
  1. /*
  2. * arch/sh/kernel/process_64.c
  3. *
  4. * This file handles the architecture-dependent parts of process handling..
  5. *
  6. * Copyright (C) 2000, 2001 Paolo Alberelli
  7. * Copyright (C) 2003 - 2007 Paul Mundt
  8. * Copyright (C) 2003, 2004 Richard Curnow
  9. *
  10. * Started from SH3/4 version:
  11. * Copyright (C) 1999, 2000 Niibe Yutaka & Kaz Kojima
  12. *
  13. * In turn started from i386 version:
  14. * Copyright (C) 1995 Linus Torvalds
  15. *
  16. * This file is subject to the terms and conditions of the GNU General Public
  17. * License. See the file "COPYING" in the main directory of this archive
  18. * for more details.
  19. */
  20. #include <linux/mm.h>
  21. #include <linux/fs.h>
  22. #include <linux/ptrace.h>
  23. #include <linux/reboot.h>
  24. #include <linux/slab.h>
  25. #include <linux/init.h>
  26. #include <linux/module.h>
  27. #include <linux/io.h>
  28. #include <asm/syscalls.h>
  29. #include <asm/uaccess.h>
  30. #include <asm/pgtable.h>
  31. #include <asm/mmu_context.h>
  32. #include <asm/fpu.h>
  33. #include <asm/switch_to.h>
  34. struct task_struct *last_task_used_math = NULL;
  35. struct pt_regs fake_swapper_regs = { 0, };
  36. void show_regs(struct pt_regs *regs)
  37. {
  38. unsigned long long ah, al, bh, bl, ch, cl;
  39. printk("\n");
  40. ah = (regs->pc) >> 32;
  41. al = (regs->pc) & 0xffffffff;
  42. bh = (regs->regs[18]) >> 32;
  43. bl = (regs->regs[18]) & 0xffffffff;
  44. ch = (regs->regs[15]) >> 32;
  45. cl = (regs->regs[15]) & 0xffffffff;
  46. printk("PC : %08Lx%08Lx LINK: %08Lx%08Lx SP : %08Lx%08Lx\n",
  47. ah, al, bh, bl, ch, cl);
  48. ah = (regs->sr) >> 32;
  49. al = (regs->sr) & 0xffffffff;
  50. asm volatile ("getcon " __TEA ", %0" : "=r" (bh));
  51. asm volatile ("getcon " __TEA ", %0" : "=r" (bl));
  52. bh = (bh) >> 32;
  53. bl = (bl) & 0xffffffff;
  54. asm volatile ("getcon " __KCR0 ", %0" : "=r" (ch));
  55. asm volatile ("getcon " __KCR0 ", %0" : "=r" (cl));
  56. ch = (ch) >> 32;
  57. cl = (cl) & 0xffffffff;
  58. printk("SR : %08Lx%08Lx TEA : %08Lx%08Lx KCR0: %08Lx%08Lx\n",
  59. ah, al, bh, bl, ch, cl);
  60. ah = (regs->regs[0]) >> 32;
  61. al = (regs->regs[0]) & 0xffffffff;
  62. bh = (regs->regs[1]) >> 32;
  63. bl = (regs->regs[1]) & 0xffffffff;
  64. ch = (regs->regs[2]) >> 32;
  65. cl = (regs->regs[2]) & 0xffffffff;
  66. printk("R0 : %08Lx%08Lx R1 : %08Lx%08Lx R2 : %08Lx%08Lx\n",
  67. ah, al, bh, bl, ch, cl);
  68. ah = (regs->regs[3]) >> 32;
  69. al = (regs->regs[3]) & 0xffffffff;
  70. bh = (regs->regs[4]) >> 32;
  71. bl = (regs->regs[4]) & 0xffffffff;
  72. ch = (regs->regs[5]) >> 32;
  73. cl = (regs->regs[5]) & 0xffffffff;
  74. printk("R3 : %08Lx%08Lx R4 : %08Lx%08Lx R5 : %08Lx%08Lx\n",
  75. ah, al, bh, bl, ch, cl);
  76. ah = (regs->regs[6]) >> 32;
  77. al = (regs->regs[6]) & 0xffffffff;
  78. bh = (regs->regs[7]) >> 32;
  79. bl = (regs->regs[7]) & 0xffffffff;
  80. ch = (regs->regs[8]) >> 32;
  81. cl = (regs->regs[8]) & 0xffffffff;
  82. printk("R6 : %08Lx%08Lx R7 : %08Lx%08Lx R8 : %08Lx%08Lx\n",
  83. ah, al, bh, bl, ch, cl);
  84. ah = (regs->regs[9]) >> 32;
  85. al = (regs->regs[9]) & 0xffffffff;
  86. bh = (regs->regs[10]) >> 32;
  87. bl = (regs->regs[10]) & 0xffffffff;
  88. ch = (regs->regs[11]) >> 32;
  89. cl = (regs->regs[11]) & 0xffffffff;
  90. printk("R9 : %08Lx%08Lx R10 : %08Lx%08Lx R11 : %08Lx%08Lx\n",
  91. ah, al, bh, bl, ch, cl);
  92. ah = (regs->regs[12]) >> 32;
  93. al = (regs->regs[12]) & 0xffffffff;
  94. bh = (regs->regs[13]) >> 32;
  95. bl = (regs->regs[13]) & 0xffffffff;
  96. ch = (regs->regs[14]) >> 32;
  97. cl = (regs->regs[14]) & 0xffffffff;
  98. printk("R12 : %08Lx%08Lx R13 : %08Lx%08Lx R14 : %08Lx%08Lx\n",
  99. ah, al, bh, bl, ch, cl);
  100. ah = (regs->regs[16]) >> 32;
  101. al = (regs->regs[16]) & 0xffffffff;
  102. bh = (regs->regs[17]) >> 32;
  103. bl = (regs->regs[17]) & 0xffffffff;
  104. ch = (regs->regs[19]) >> 32;
  105. cl = (regs->regs[19]) & 0xffffffff;
  106. printk("R16 : %08Lx%08Lx R17 : %08Lx%08Lx R19 : %08Lx%08Lx\n",
  107. ah, al, bh, bl, ch, cl);
  108. ah = (regs->regs[20]) >> 32;
  109. al = (regs->regs[20]) & 0xffffffff;
  110. bh = (regs->regs[21]) >> 32;
  111. bl = (regs->regs[21]) & 0xffffffff;
  112. ch = (regs->regs[22]) >> 32;
  113. cl = (regs->regs[22]) & 0xffffffff;
  114. printk("R20 : %08Lx%08Lx R21 : %08Lx%08Lx R22 : %08Lx%08Lx\n",
  115. ah, al, bh, bl, ch, cl);
  116. ah = (regs->regs[23]) >> 32;
  117. al = (regs->regs[23]) & 0xffffffff;
  118. bh = (regs->regs[24]) >> 32;
  119. bl = (regs->regs[24]) & 0xffffffff;
  120. ch = (regs->regs[25]) >> 32;
  121. cl = (regs->regs[25]) & 0xffffffff;
  122. printk("R23 : %08Lx%08Lx R24 : %08Lx%08Lx R25 : %08Lx%08Lx\n",
  123. ah, al, bh, bl, ch, cl);
  124. ah = (regs->regs[26]) >> 32;
  125. al = (regs->regs[26]) & 0xffffffff;
  126. bh = (regs->regs[27]) >> 32;
  127. bl = (regs->regs[27]) & 0xffffffff;
  128. ch = (regs->regs[28]) >> 32;
  129. cl = (regs->regs[28]) & 0xffffffff;
  130. printk("R26 : %08Lx%08Lx R27 : %08Lx%08Lx R28 : %08Lx%08Lx\n",
  131. ah, al, bh, bl, ch, cl);
  132. ah = (regs->regs[29]) >> 32;
  133. al = (regs->regs[29]) & 0xffffffff;
  134. bh = (regs->regs[30]) >> 32;
  135. bl = (regs->regs[30]) & 0xffffffff;
  136. ch = (regs->regs[31]) >> 32;
  137. cl = (regs->regs[31]) & 0xffffffff;
  138. printk("R29 : %08Lx%08Lx R30 : %08Lx%08Lx R31 : %08Lx%08Lx\n",
  139. ah, al, bh, bl, ch, cl);
  140. ah = (regs->regs[32]) >> 32;
  141. al = (regs->regs[32]) & 0xffffffff;
  142. bh = (regs->regs[33]) >> 32;
  143. bl = (regs->regs[33]) & 0xffffffff;
  144. ch = (regs->regs[34]) >> 32;
  145. cl = (regs->regs[34]) & 0xffffffff;
  146. printk("R32 : %08Lx%08Lx R33 : %08Lx%08Lx R34 : %08Lx%08Lx\n",
  147. ah, al, bh, bl, ch, cl);
  148. ah = (regs->regs[35]) >> 32;
  149. al = (regs->regs[35]) & 0xffffffff;
  150. bh = (regs->regs[36]) >> 32;
  151. bl = (regs->regs[36]) & 0xffffffff;
  152. ch = (regs->regs[37]) >> 32;
  153. cl = (regs->regs[37]) & 0xffffffff;
  154. printk("R35 : %08Lx%08Lx R36 : %08Lx%08Lx R37 : %08Lx%08Lx\n",
  155. ah, al, bh, bl, ch, cl);
  156. ah = (regs->regs[38]) >> 32;
  157. al = (regs->regs[38]) & 0xffffffff;
  158. bh = (regs->regs[39]) >> 32;
  159. bl = (regs->regs[39]) & 0xffffffff;
  160. ch = (regs->regs[40]) >> 32;
  161. cl = (regs->regs[40]) & 0xffffffff;
  162. printk("R38 : %08Lx%08Lx R39 : %08Lx%08Lx R40 : %08Lx%08Lx\n",
  163. ah, al, bh, bl, ch, cl);
  164. ah = (regs->regs[41]) >> 32;
  165. al = (regs->regs[41]) & 0xffffffff;
  166. bh = (regs->regs[42]) >> 32;
  167. bl = (regs->regs[42]) & 0xffffffff;
  168. ch = (regs->regs[43]) >> 32;
  169. cl = (regs->regs[43]) & 0xffffffff;
  170. printk("R41 : %08Lx%08Lx R42 : %08Lx%08Lx R43 : %08Lx%08Lx\n",
  171. ah, al, bh, bl, ch, cl);
  172. ah = (regs->regs[44]) >> 32;
  173. al = (regs->regs[44]) & 0xffffffff;
  174. bh = (regs->regs[45]) >> 32;
  175. bl = (regs->regs[45]) & 0xffffffff;
  176. ch = (regs->regs[46]) >> 32;
  177. cl = (regs->regs[46]) & 0xffffffff;
  178. printk("R44 : %08Lx%08Lx R45 : %08Lx%08Lx R46 : %08Lx%08Lx\n",
  179. ah, al, bh, bl, ch, cl);
  180. ah = (regs->regs[47]) >> 32;
  181. al = (regs->regs[47]) & 0xffffffff;
  182. bh = (regs->regs[48]) >> 32;
  183. bl = (regs->regs[48]) & 0xffffffff;
  184. ch = (regs->regs[49]) >> 32;
  185. cl = (regs->regs[49]) & 0xffffffff;
  186. printk("R47 : %08Lx%08Lx R48 : %08Lx%08Lx R49 : %08Lx%08Lx\n",
  187. ah, al, bh, bl, ch, cl);
  188. ah = (regs->regs[50]) >> 32;
  189. al = (regs->regs[50]) & 0xffffffff;
  190. bh = (regs->regs[51]) >> 32;
  191. bl = (regs->regs[51]) & 0xffffffff;
  192. ch = (regs->regs[52]) >> 32;
  193. cl = (regs->regs[52]) & 0xffffffff;
  194. printk("R50 : %08Lx%08Lx R51 : %08Lx%08Lx R52 : %08Lx%08Lx\n",
  195. ah, al, bh, bl, ch, cl);
  196. ah = (regs->regs[53]) >> 32;
  197. al = (regs->regs[53]) & 0xffffffff;
  198. bh = (regs->regs[54]) >> 32;
  199. bl = (regs->regs[54]) & 0xffffffff;
  200. ch = (regs->regs[55]) >> 32;
  201. cl = (regs->regs[55]) & 0xffffffff;
  202. printk("R53 : %08Lx%08Lx R54 : %08Lx%08Lx R55 : %08Lx%08Lx\n",
  203. ah, al, bh, bl, ch, cl);
  204. ah = (regs->regs[56]) >> 32;
  205. al = (regs->regs[56]) & 0xffffffff;
  206. bh = (regs->regs[57]) >> 32;
  207. bl = (regs->regs[57]) & 0xffffffff;
  208. ch = (regs->regs[58]) >> 32;
  209. cl = (regs->regs[58]) & 0xffffffff;
  210. printk("R56 : %08Lx%08Lx R57 : %08Lx%08Lx R58 : %08Lx%08Lx\n",
  211. ah, al, bh, bl, ch, cl);
  212. ah = (regs->regs[59]) >> 32;
  213. al = (regs->regs[59]) & 0xffffffff;
  214. bh = (regs->regs[60]) >> 32;
  215. bl = (regs->regs[60]) & 0xffffffff;
  216. ch = (regs->regs[61]) >> 32;
  217. cl = (regs->regs[61]) & 0xffffffff;
  218. printk("R59 : %08Lx%08Lx R60 : %08Lx%08Lx R61 : %08Lx%08Lx\n",
  219. ah, al, bh, bl, ch, cl);
  220. ah = (regs->regs[62]) >> 32;
  221. al = (regs->regs[62]) & 0xffffffff;
  222. bh = (regs->tregs[0]) >> 32;
  223. bl = (regs->tregs[0]) & 0xffffffff;
  224. ch = (regs->tregs[1]) >> 32;
  225. cl = (regs->tregs[1]) & 0xffffffff;
  226. printk("R62 : %08Lx%08Lx T0 : %08Lx%08Lx T1 : %08Lx%08Lx\n",
  227. ah, al, bh, bl, ch, cl);
  228. ah = (regs->tregs[2]) >> 32;
  229. al = (regs->tregs[2]) & 0xffffffff;
  230. bh = (regs->tregs[3]) >> 32;
  231. bl = (regs->tregs[3]) & 0xffffffff;
  232. ch = (regs->tregs[4]) >> 32;
  233. cl = (regs->tregs[4]) & 0xffffffff;
  234. printk("T2 : %08Lx%08Lx T3 : %08Lx%08Lx T4 : %08Lx%08Lx\n",
  235. ah, al, bh, bl, ch, cl);
  236. ah = (regs->tregs[5]) >> 32;
  237. al = (regs->tregs[5]) & 0xffffffff;
  238. bh = (regs->tregs[6]) >> 32;
  239. bl = (regs->tregs[6]) & 0xffffffff;
  240. ch = (regs->tregs[7]) >> 32;
  241. cl = (regs->tregs[7]) & 0xffffffff;
  242. printk("T5 : %08Lx%08Lx T6 : %08Lx%08Lx T7 : %08Lx%08Lx\n",
  243. ah, al, bh, bl, ch, cl);
  244. /*
  245. * If we're in kernel mode, dump the stack too..
  246. */
  247. if (!user_mode(regs)) {
  248. void show_stack(struct task_struct *tsk, unsigned long *sp);
  249. unsigned long sp = regs->regs[15] & 0xffffffff;
  250. struct task_struct *tsk = get_current();
  251. tsk->thread.kregs = regs;
  252. show_stack(tsk, (unsigned long *)sp);
  253. }
  254. }
  255. /*
  256. * Create a kernel thread
  257. */
  258. __noreturn void kernel_thread_helper(void *arg, int (*fn)(void *))
  259. {
  260. do_exit(fn(arg));
  261. }
  262. /*
  263. * This is the mechanism for creating a new kernel thread.
  264. *
  265. * NOTE! Only a kernel-only process(ie the swapper or direct descendants
  266. * who haven't done an "execve()") should use this: it will work within
  267. * a system call from a "real" process, but the process memory space will
  268. * not be freed until both the parent and the child have exited.
  269. */
  270. int kernel_thread(int (*fn)(void *), void * arg, unsigned long flags)
  271. {
  272. struct pt_regs regs;
  273. memset(&regs, 0, sizeof(regs));
  274. regs.regs[2] = (unsigned long)arg;
  275. regs.regs[3] = (unsigned long)fn;
  276. regs.pc = (unsigned long)kernel_thread_helper;
  277. regs.sr = (1 << 30);
  278. /* Ok, create the new process.. */
  279. return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0,
  280. &regs, 0, NULL, NULL);
  281. }
  282. EXPORT_SYMBOL(kernel_thread);
  283. /*
  284. * Free current thread data structures etc..
  285. */
  286. void exit_thread(void)
  287. {
  288. /*
  289. * See arch/sparc/kernel/process.c for the precedent for doing
  290. * this -- RPC.
  291. *
  292. * The SH-5 FPU save/restore approach relies on
  293. * last_task_used_math pointing to a live task_struct. When
  294. * another task tries to use the FPU for the 1st time, the FPUDIS
  295. * trap handling (see arch/sh/kernel/cpu/sh5/fpu.c) will save the
  296. * existing FPU state to the FP regs field within
  297. * last_task_used_math before re-loading the new task's FPU state
  298. * (or initialising it if the FPU has been used before). So if
  299. * last_task_used_math is stale, and its page has already been
  300. * re-allocated for another use, the consequences are rather
  301. * grim. Unless we null it here, there is no other path through
  302. * which it would get safely nulled.
  303. */
  304. #ifdef CONFIG_SH_FPU
  305. if (last_task_used_math == current) {
  306. last_task_used_math = NULL;
  307. }
  308. #endif
  309. }
  310. void flush_thread(void)
  311. {
  312. /* Called by fs/exec.c (setup_new_exec) to remove traces of a
  313. * previously running executable. */
  314. #ifdef CONFIG_SH_FPU
  315. if (last_task_used_math == current) {
  316. last_task_used_math = NULL;
  317. }
  318. /* Force FPU state to be reinitialised after exec */
  319. clear_used_math();
  320. #endif
  321. /* if we are a kernel thread, about to change to user thread,
  322. * update kreg
  323. */
  324. if(current->thread.kregs==&fake_swapper_regs) {
  325. current->thread.kregs =
  326. ((struct pt_regs *)(THREAD_SIZE + (unsigned long) current) - 1);
  327. current->thread.uregs = current->thread.kregs;
  328. }
  329. }
  330. void release_thread(struct task_struct *dead_task)
  331. {
  332. /* do nothing */
  333. }
  334. /* Fill in the fpu structure for a core dump.. */
  335. int dump_fpu(struct pt_regs *regs, elf_fpregset_t *fpu)
  336. {
  337. #ifdef CONFIG_SH_FPU
  338. int fpvalid;
  339. struct task_struct *tsk = current;
  340. fpvalid = !!tsk_used_math(tsk);
  341. if (fpvalid) {
  342. if (current == last_task_used_math) {
  343. enable_fpu();
  344. save_fpu(tsk);
  345. disable_fpu();
  346. last_task_used_math = 0;
  347. regs->sr |= SR_FD;
  348. }
  349. memcpy(fpu, &tsk->thread.xstate->hardfpu, sizeof(*fpu));
  350. }
  351. return fpvalid;
  352. #else
  353. return 0; /* Task didn't use the fpu at all. */
  354. #endif
  355. }
  356. EXPORT_SYMBOL(dump_fpu);
  357. asmlinkage void ret_from_fork(void);
  358. int copy_thread(unsigned long clone_flags, unsigned long usp,
  359. unsigned long unused,
  360. struct task_struct *p, struct pt_regs *regs)
  361. {
  362. struct pt_regs *childregs;
  363. #ifdef CONFIG_SH_FPU
  364. if(last_task_used_math == current) {
  365. enable_fpu();
  366. save_fpu(current);
  367. disable_fpu();
  368. last_task_used_math = NULL;
  369. regs->sr |= SR_FD;
  370. }
  371. #endif
  372. /* Copy from sh version */
  373. childregs = (struct pt_regs *)(THREAD_SIZE + task_stack_page(p)) - 1;
  374. *childregs = *regs;
  375. /*
  376. * Sign extend the edited stack.
  377. * Note that thread.pc and thread.pc will stay
  378. * 32-bit wide and context switch must take care
  379. * of NEFF sign extension.
  380. */
  381. if (user_mode(regs)) {
  382. childregs->regs[15] = neff_sign_extend(usp);
  383. p->thread.uregs = childregs;
  384. } else {
  385. childregs->regs[15] =
  386. neff_sign_extend((unsigned long)task_stack_page(p) +
  387. THREAD_SIZE);
  388. }
  389. childregs->regs[9] = 0; /* Set return value for child */
  390. childregs->sr |= SR_FD; /* Invalidate FPU flag */
  391. p->thread.sp = (unsigned long) childregs;
  392. p->thread.pc = (unsigned long) ret_from_fork;
  393. return 0;
  394. }
  395. asmlinkage int sys_fork(unsigned long r2, unsigned long r3,
  396. unsigned long r4, unsigned long r5,
  397. unsigned long r6, unsigned long r7,
  398. struct pt_regs *pregs)
  399. {
  400. return do_fork(SIGCHLD, pregs->regs[15], pregs, 0, 0, 0);
  401. }
  402. asmlinkage int sys_clone(unsigned long clone_flags, unsigned long newsp,
  403. unsigned long r4, unsigned long r5,
  404. unsigned long r6, unsigned long r7,
  405. struct pt_regs *pregs)
  406. {
  407. if (!newsp)
  408. newsp = pregs->regs[15];
  409. return do_fork(clone_flags, newsp, pregs, 0, 0, 0);
  410. }
  411. /*
  412. * This is trivial, and on the face of it looks like it
  413. * could equally well be done in user mode.
  414. *
  415. * Not so, for quite unobvious reasons - register pressure.
  416. * In user mode vfork() cannot have a stack frame, and if
  417. * done by calling the "clone()" system call directly, you
  418. * do not have enough call-clobbered registers to hold all
  419. * the information you need.
  420. */
  421. asmlinkage int sys_vfork(unsigned long r2, unsigned long r3,
  422. unsigned long r4, unsigned long r5,
  423. unsigned long r6, unsigned long r7,
  424. struct pt_regs *pregs)
  425. {
  426. return do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, pregs->regs[15], pregs, 0, 0, 0);
  427. }
  428. /*
  429. * sys_execve() executes a new program.
  430. */
  431. asmlinkage int sys_execve(const char *ufilename, char **uargv,
  432. char **uenvp, unsigned long r5,
  433. unsigned long r6, unsigned long r7,
  434. struct pt_regs *pregs)
  435. {
  436. int error;
  437. char *filename;
  438. filename = getname((char __user *)ufilename);
  439. error = PTR_ERR(filename);
  440. if (IS_ERR(filename))
  441. goto out;
  442. error = do_execve(filename,
  443. (const char __user *const __user *)uargv,
  444. (const char __user *const __user *)uenvp,
  445. pregs);
  446. putname(filename);
  447. out:
  448. return error;
  449. }
  450. #ifdef CONFIG_FRAME_POINTER
  451. static int in_sh64_switch_to(unsigned long pc)
  452. {
  453. extern char __sh64_switch_to_end;
  454. /* For a sleeping task, the PC is somewhere in the middle of the function,
  455. so we don't have to worry about masking the LSB off */
  456. return (pc >= (unsigned long) sh64_switch_to) &&
  457. (pc < (unsigned long) &__sh64_switch_to_end);
  458. }
  459. #endif
  460. unsigned long get_wchan(struct task_struct *p)
  461. {
  462. unsigned long pc;
  463. if (!p || p == current || p->state == TASK_RUNNING)
  464. return 0;
  465. /*
  466. * The same comment as on the Alpha applies here, too ...
  467. */
  468. pc = thread_saved_pc(p);
  469. #ifdef CONFIG_FRAME_POINTER
  470. if (in_sh64_switch_to(pc)) {
  471. unsigned long schedule_fp;
  472. unsigned long sh64_switch_to_fp;
  473. unsigned long schedule_caller_pc;
  474. sh64_switch_to_fp = (long) p->thread.sp;
  475. /* r14 is saved at offset 4 in the sh64_switch_to frame */
  476. schedule_fp = *(unsigned long *) (long)(sh64_switch_to_fp + 4);
  477. /* and the caller of 'schedule' is (currently!) saved at offset 24
  478. in the frame of schedule (from disasm) */
  479. schedule_caller_pc = *(unsigned long *) (long)(schedule_fp + 24);
  480. return schedule_caller_pc;
  481. }
  482. #endif
  483. return pc;
  484. }