process.c 9.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405
  1. /*
  2. * linux/arch/m68k/kernel/process.c
  3. *
  4. * Copyright (C) 1995 Hamish Macdonald
  5. *
  6. * 68060 fixes by Jesper Skov
  7. */
  8. /*
  9. * This file handles the architecture-dependent parts of process handling..
  10. */
  11. #include <linux/config.h>
  12. #include <linux/errno.h>
  13. #include <linux/module.h>
  14. #include <linux/sched.h>
  15. #include <linux/kernel.h>
  16. #include <linux/mm.h>
  17. #include <linux/smp.h>
  18. #include <linux/smp_lock.h>
  19. #include <linux/stddef.h>
  20. #include <linux/unistd.h>
  21. #include <linux/ptrace.h>
  22. #include <linux/slab.h>
  23. #include <linux/user.h>
  24. #include <linux/a.out.h>
  25. #include <linux/reboot.h>
  26. #include <linux/init_task.h>
  27. #include <linux/mqueue.h>
  28. #include <asm/uaccess.h>
  29. #include <asm/system.h>
  30. #include <asm/traps.h>
  31. #include <asm/machdep.h>
  32. #include <asm/setup.h>
  33. #include <asm/pgtable.h>
  34. /*
  35. * Initial task/thread structure. Make this a per-architecture thing,
  36. * because different architectures tend to have different
  37. * alignment requirements and potentially different initial
  38. * setup.
  39. */
  40. static struct fs_struct init_fs = INIT_FS;
  41. static struct files_struct init_files = INIT_FILES;
  42. static struct signal_struct init_signals = INIT_SIGNALS(init_signals);
  43. static struct sighand_struct init_sighand = INIT_SIGHAND(init_sighand);
  44. struct mm_struct init_mm = INIT_MM(init_mm);
  45. EXPORT_SYMBOL(init_mm);
  46. union thread_union init_thread_union
  47. __attribute__((section(".data.init_task"), aligned(THREAD_SIZE)))
  48. = { INIT_THREAD_INFO(init_task) };
  49. /* initial task structure */
  50. struct task_struct init_task = INIT_TASK(init_task);
  51. EXPORT_SYMBOL(init_task);
  52. asmlinkage void ret_from_fork(void);
  53. /*
  54. * Return saved PC from a blocked thread
  55. */
  56. unsigned long thread_saved_pc(struct task_struct *tsk)
  57. {
  58. struct switch_stack *sw = (struct switch_stack *)tsk->thread.ksp;
  59. /* Check whether the thread is blocked in resume() */
  60. if (in_sched_functions(sw->retpc))
  61. return ((unsigned long *)sw->a6)[1];
  62. else
  63. return sw->retpc;
  64. }
  65. /*
  66. * The idle loop on an m68k..
  67. */
  68. void default_idle(void)
  69. {
  70. if (!need_resched())
  71. #if defined(MACH_ATARI_ONLY) && !defined(CONFIG_HADES)
  72. /* block out HSYNC on the atari (falcon) */
  73. __asm__("stop #0x2200" : : : "cc");
  74. #else
  75. __asm__("stop #0x2000" : : : "cc");
  76. #endif
  77. }
  78. void (*idle)(void) = default_idle;
  79. /*
  80. * The idle thread. There's no useful work to be
  81. * done, so just try to conserve power and have a
  82. * low exit latency (ie sit in a loop waiting for
  83. * somebody to say that they'd like to reschedule)
  84. */
  85. void cpu_idle(void)
  86. {
  87. /* endless idle loop with no priority at all */
  88. while (1) {
  89. while (!need_resched())
  90. idle();
  91. schedule();
  92. }
  93. }
  94. void machine_restart(char * __unused)
  95. {
  96. if (mach_reset)
  97. mach_reset();
  98. for (;;);
  99. }
  100. EXPORT_SYMBOL(machine_restart);
  101. void machine_halt(void)
  102. {
  103. if (mach_halt)
  104. mach_halt();
  105. for (;;);
  106. }
  107. EXPORT_SYMBOL(machine_halt);
  108. void machine_power_off(void)
  109. {
  110. if (mach_power_off)
  111. mach_power_off();
  112. for (;;);
  113. }
  114. EXPORT_SYMBOL(machine_power_off);
  115. void show_regs(struct pt_regs * regs)
  116. {
  117. printk("\n");
  118. printk("Format %02x Vector: %04x PC: %08lx Status: %04x %s\n",
  119. regs->format, regs->vector, regs->pc, regs->sr, print_tainted());
  120. printk("ORIG_D0: %08lx D0: %08lx A2: %08lx A1: %08lx\n",
  121. regs->orig_d0, regs->d0, regs->a2, regs->a1);
  122. printk("A0: %08lx D5: %08lx D4: %08lx\n",
  123. regs->a0, regs->d5, regs->d4);
  124. printk("D3: %08lx D2: %08lx D1: %08lx\n",
  125. regs->d3, regs->d2, regs->d1);
  126. if (!(regs->sr & PS_S))
  127. printk("USP: %08lx\n", rdusp());
  128. }
  129. /*
  130. * Create a kernel thread
  131. */
  132. int kernel_thread(int (*fn)(void *), void * arg, unsigned long flags)
  133. {
  134. int pid;
  135. mm_segment_t fs;
  136. fs = get_fs();
  137. set_fs (KERNEL_DS);
  138. {
  139. register long retval __asm__ ("d0");
  140. register long clone_arg __asm__ ("d1") = flags | CLONE_VM | CLONE_UNTRACED;
  141. retval = __NR_clone;
  142. __asm__ __volatile__
  143. ("clrl %%d2\n\t"
  144. "trap #0\n\t" /* Linux/m68k system call */
  145. "tstl %0\n\t" /* child or parent */
  146. "jne 1f\n\t" /* parent - jump */
  147. "lea %%sp@(%c7),%6\n\t" /* reload current */
  148. "movel %6@,%6\n\t"
  149. "movel %3,%%sp@-\n\t" /* push argument */
  150. "jsr %4@\n\t" /* call fn */
  151. "movel %0,%%d1\n\t" /* pass exit value */
  152. "movel %2,%%d0\n\t" /* exit */
  153. "trap #0\n"
  154. "1:"
  155. : "+d" (retval)
  156. : "i" (__NR_clone), "i" (__NR_exit),
  157. "r" (arg), "a" (fn), "d" (clone_arg), "r" (current),
  158. "i" (-THREAD_SIZE)
  159. : "d2");
  160. pid = retval;
  161. }
  162. set_fs (fs);
  163. return pid;
  164. }
  165. void flush_thread(void)
  166. {
  167. unsigned long zero = 0;
  168. set_fs(USER_DS);
  169. current->thread.fs = __USER_DS;
  170. if (!FPU_IS_EMU)
  171. asm volatile (".chip 68k/68881\n\t"
  172. "frestore %0@\n\t"
  173. ".chip 68k" : : "a" (&zero));
  174. }
  175. /*
  176. * "m68k_fork()".. By the time we get here, the
  177. * non-volatile registers have also been saved on the
  178. * stack. We do some ugly pointer stuff here.. (see
  179. * also copy_thread)
  180. */
  181. asmlinkage int m68k_fork(struct pt_regs *regs)
  182. {
  183. return do_fork(SIGCHLD, rdusp(), regs, 0, NULL, NULL);
  184. }
  185. asmlinkage int m68k_vfork(struct pt_regs *regs)
  186. {
  187. return do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, rdusp(), regs, 0,
  188. NULL, NULL);
  189. }
  190. asmlinkage int m68k_clone(struct pt_regs *regs)
  191. {
  192. unsigned long clone_flags;
  193. unsigned long newsp;
  194. int *parent_tidptr, *child_tidptr;
  195. /* syscall2 puts clone_flags in d1 and usp in d2 */
  196. clone_flags = regs->d1;
  197. newsp = regs->d2;
  198. parent_tidptr = (int *)regs->d3;
  199. child_tidptr = (int *)regs->d4;
  200. if (!newsp)
  201. newsp = rdusp();
  202. return do_fork(clone_flags, newsp, regs, 0,
  203. parent_tidptr, child_tidptr);
  204. }
  205. int copy_thread(int nr, unsigned long clone_flags, unsigned long usp,
  206. unsigned long unused,
  207. struct task_struct * p, struct pt_regs * regs)
  208. {
  209. struct pt_regs * childregs;
  210. struct switch_stack * childstack, *stack;
  211. unsigned long stack_offset, *retp;
  212. stack_offset = THREAD_SIZE - sizeof(struct pt_regs);
  213. childregs = (struct pt_regs *) ((unsigned long) (p->thread_info) + stack_offset);
  214. *childregs = *regs;
  215. childregs->d0 = 0;
  216. retp = ((unsigned long *) regs);
  217. stack = ((struct switch_stack *) retp) - 1;
  218. childstack = ((struct switch_stack *) childregs) - 1;
  219. *childstack = *stack;
  220. childstack->retpc = (unsigned long)ret_from_fork;
  221. p->thread.usp = usp;
  222. p->thread.ksp = (unsigned long)childstack;
  223. /*
  224. * Must save the current SFC/DFC value, NOT the value when
  225. * the parent was last descheduled - RGH 10-08-96
  226. */
  227. p->thread.fs = get_fs().seg;
  228. if (!FPU_IS_EMU) {
  229. /* Copy the current fpu state */
  230. asm volatile ("fsave %0" : : "m" (p->thread.fpstate[0]) : "memory");
  231. if (!CPU_IS_060 ? p->thread.fpstate[0] : p->thread.fpstate[2])
  232. asm volatile ("fmovemx %/fp0-%/fp7,%0\n\t"
  233. "fmoveml %/fpiar/%/fpcr/%/fpsr,%1"
  234. : : "m" (p->thread.fp[0]), "m" (p->thread.fpcntl[0])
  235. : "memory");
  236. /* Restore the state in case the fpu was busy */
  237. asm volatile ("frestore %0" : : "m" (p->thread.fpstate[0]));
  238. }
  239. return 0;
  240. }
  241. /* Fill in the fpu structure for a core dump. */
  242. int dump_fpu (struct pt_regs *regs, struct user_m68kfp_struct *fpu)
  243. {
  244. char fpustate[216];
  245. if (FPU_IS_EMU) {
  246. int i;
  247. memcpy(fpu->fpcntl, current->thread.fpcntl, 12);
  248. memcpy(fpu->fpregs, current->thread.fp, 96);
  249. /* Convert internal fpu reg representation
  250. * into long double format
  251. */
  252. for (i = 0; i < 24; i += 3)
  253. fpu->fpregs[i] = ((fpu->fpregs[i] & 0xffff0000) << 15) |
  254. ((fpu->fpregs[i] & 0x0000ffff) << 16);
  255. return 1;
  256. }
  257. /* First dump the fpu context to avoid protocol violation. */
  258. asm volatile ("fsave %0" :: "m" (fpustate[0]) : "memory");
  259. if (!CPU_IS_060 ? !fpustate[0] : !fpustate[2])
  260. return 0;
  261. asm volatile ("fmovem %/fpiar/%/fpcr/%/fpsr,%0"
  262. :: "m" (fpu->fpcntl[0])
  263. : "memory");
  264. asm volatile ("fmovemx %/fp0-%/fp7,%0"
  265. :: "m" (fpu->fpregs[0])
  266. : "memory");
  267. return 1;
  268. }
  269. /*
  270. * fill in the user structure for a core dump..
  271. */
  272. void dump_thread(struct pt_regs * regs, struct user * dump)
  273. {
  274. struct switch_stack *sw;
  275. /* changed the size calculations - should hopefully work better. lbt */
  276. dump->magic = CMAGIC;
  277. dump->start_code = 0;
  278. dump->start_stack = rdusp() & ~(PAGE_SIZE - 1);
  279. dump->u_tsize = ((unsigned long) current->mm->end_code) >> PAGE_SHIFT;
  280. dump->u_dsize = ((unsigned long) (current->mm->brk +
  281. (PAGE_SIZE-1))) >> PAGE_SHIFT;
  282. dump->u_dsize -= dump->u_tsize;
  283. dump->u_ssize = 0;
  284. if (dump->start_stack < TASK_SIZE)
  285. dump->u_ssize = ((unsigned long) (TASK_SIZE - dump->start_stack)) >> PAGE_SHIFT;
  286. dump->u_ar0 = (struct user_regs_struct *)((int)&dump->regs - (int)dump);
  287. sw = ((struct switch_stack *)regs) - 1;
  288. dump->regs.d1 = regs->d1;
  289. dump->regs.d2 = regs->d2;
  290. dump->regs.d3 = regs->d3;
  291. dump->regs.d4 = regs->d4;
  292. dump->regs.d5 = regs->d5;
  293. dump->regs.d6 = sw->d6;
  294. dump->regs.d7 = sw->d7;
  295. dump->regs.a0 = regs->a0;
  296. dump->regs.a1 = regs->a1;
  297. dump->regs.a2 = regs->a2;
  298. dump->regs.a3 = sw->a3;
  299. dump->regs.a4 = sw->a4;
  300. dump->regs.a5 = sw->a5;
  301. dump->regs.a6 = sw->a6;
  302. dump->regs.d0 = regs->d0;
  303. dump->regs.orig_d0 = regs->orig_d0;
  304. dump->regs.stkadj = regs->stkadj;
  305. dump->regs.sr = regs->sr;
  306. dump->regs.pc = regs->pc;
  307. dump->regs.fmtvec = (regs->format << 12) | regs->vector;
  308. /* dump floating point stuff */
  309. dump->u_fpvalid = dump_fpu (regs, &dump->m68kfp);
  310. }
  311. /*
  312. * sys_execve() executes a new program.
  313. */
  314. asmlinkage int sys_execve(char *name, char **argv, char **envp)
  315. {
  316. int error;
  317. char * filename;
  318. struct pt_regs *regs = (struct pt_regs *) &name;
  319. lock_kernel();
  320. filename = getname(name);
  321. error = PTR_ERR(filename);
  322. if (IS_ERR(filename))
  323. goto out;
  324. error = do_execve(filename, argv, envp, regs);
  325. putname(filename);
  326. out:
  327. unlock_kernel();
  328. return error;
  329. }
  330. unsigned long get_wchan(struct task_struct *p)
  331. {
  332. unsigned long fp, pc;
  333. unsigned long stack_page;
  334. int count = 0;
  335. if (!p || p == current || p->state == TASK_RUNNING)
  336. return 0;
  337. stack_page = (unsigned long)(p->thread_info);
  338. fp = ((struct switch_stack *)p->thread.ksp)->a6;
  339. do {
  340. if (fp < stack_page+sizeof(struct thread_info) ||
  341. fp >= 8184+stack_page)
  342. return 0;
  343. pc = ((unsigned long *)fp)[1];
  344. if (!in_sched_functions(pc))
  345. return pc;
  346. fp = *(unsigned long *) fp;
  347. } while (count++ < 16);
  348. return 0;
  349. }