process_64.c 16 KB

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