process.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427
  1. /*
  2. * Copyright (C) 2000 - 2007 Jeff Dike (jdike@{addtoit,linux.intel}.com)
  3. * Copyright 2003 PathScale, Inc.
  4. * Licensed under the GPL
  5. */
  6. #include <linux/stddef.h>
  7. #include <linux/err.h>
  8. #include <linux/hardirq.h>
  9. #include <linux/mm.h>
  10. #include <linux/module.h>
  11. #include <linux/personality.h>
  12. #include <linux/proc_fs.h>
  13. #include <linux/ptrace.h>
  14. #include <linux/random.h>
  15. #include <linux/slab.h>
  16. #include <linux/sched.h>
  17. #include <linux/seq_file.h>
  18. #include <linux/tick.h>
  19. #include <linux/threads.h>
  20. #include <linux/tracehook.h>
  21. #include <asm/current.h>
  22. #include <asm/pgtable.h>
  23. #include <asm/mmu_context.h>
  24. #include <asm/uaccess.h>
  25. #include <as-layout.h>
  26. #include <kern_util.h>
  27. #include <os.h>
  28. #include <skas.h>
  29. /*
  30. * This is a per-cpu array. A processor only modifies its entry and it only
  31. * cares about its entry, so it's OK if another processor is modifying its
  32. * entry.
  33. */
  34. struct cpu_task cpu_tasks[NR_CPUS] = { [0 ... NR_CPUS - 1] = { -1, NULL } };
  35. static inline int external_pid(void)
  36. {
  37. /* FIXME: Need to look up userspace_pid by cpu */
  38. return userspace_pid[0];
  39. }
  40. int pid_to_processor_id(int pid)
  41. {
  42. int i;
  43. for (i = 0; i < ncpus; i++) {
  44. if (cpu_tasks[i].pid == pid)
  45. return i;
  46. }
  47. return -1;
  48. }
  49. void free_stack(unsigned long stack, int order)
  50. {
  51. free_pages(stack, order);
  52. }
  53. unsigned long alloc_stack(int order, int atomic)
  54. {
  55. unsigned long page;
  56. gfp_t flags = GFP_KERNEL;
  57. if (atomic)
  58. flags = GFP_ATOMIC;
  59. page = __get_free_pages(flags, order);
  60. return page;
  61. }
  62. static inline void set_current(struct task_struct *task)
  63. {
  64. cpu_tasks[task_thread_info(task)->cpu] = ((struct cpu_task)
  65. { external_pid(), task });
  66. }
  67. extern void arch_switch_to(struct task_struct *to);
  68. void *__switch_to(struct task_struct *from, struct task_struct *to)
  69. {
  70. to->thread.prev_sched = from;
  71. set_current(to);
  72. do {
  73. current->thread.saved_task = NULL;
  74. switch_threads(&from->thread.switch_buf,
  75. &to->thread.switch_buf);
  76. arch_switch_to(current);
  77. if (current->thread.saved_task)
  78. show_regs(&(current->thread.regs));
  79. to = current->thread.saved_task;
  80. from = current;
  81. } while (current->thread.saved_task);
  82. return current->thread.prev_sched;
  83. }
  84. void interrupt_end(void)
  85. {
  86. if (need_resched())
  87. schedule();
  88. if (test_thread_flag(TIF_SIGPENDING))
  89. do_signal();
  90. if (test_and_clear_thread_flag(TIF_NOTIFY_RESUME))
  91. tracehook_notify_resume(&current->thread.regs);
  92. }
  93. void exit_thread(void)
  94. {
  95. }
  96. int get_current_pid(void)
  97. {
  98. return task_pid_nr(current);
  99. }
  100. /*
  101. * This is called magically, by its address being stuffed in a jmp_buf
  102. * and being longjmp-d to.
  103. */
  104. void new_thread_handler(void)
  105. {
  106. int (*fn)(void *), n;
  107. void *arg;
  108. if (current->thread.prev_sched != NULL)
  109. schedule_tail(current->thread.prev_sched);
  110. current->thread.prev_sched = NULL;
  111. fn = current->thread.request.u.thread.proc;
  112. arg = current->thread.request.u.thread.arg;
  113. /*
  114. * callback returns only if the kernel thread execs a process
  115. */
  116. n = fn(arg);
  117. userspace(&current->thread.regs.regs);
  118. }
  119. /* Called magically, see new_thread_handler above */
  120. void fork_handler(void)
  121. {
  122. force_flush_all();
  123. schedule_tail(current->thread.prev_sched);
  124. /*
  125. * XXX: if interrupt_end() calls schedule, this call to
  126. * arch_switch_to isn't needed. We could want to apply this to
  127. * improve performance. -bb
  128. */
  129. arch_switch_to(current);
  130. current->thread.prev_sched = NULL;
  131. userspace(&current->thread.regs.regs);
  132. }
  133. int copy_thread(unsigned long clone_flags, unsigned long sp,
  134. unsigned long arg, struct task_struct * p)
  135. {
  136. void (*handler)(void);
  137. int kthread = current->flags & PF_KTHREAD;
  138. int ret = 0;
  139. p->thread = (struct thread_struct) INIT_THREAD;
  140. if (!kthread) {
  141. memcpy(&p->thread.regs.regs, current_pt_regs(),
  142. sizeof(p->thread.regs.regs));
  143. PT_REGS_SET_SYSCALL_RETURN(&p->thread.regs, 0);
  144. if (sp != 0)
  145. REGS_SP(p->thread.regs.regs.gp) = sp;
  146. handler = fork_handler;
  147. arch_copy_thread(&current->thread.arch, &p->thread.arch);
  148. } else {
  149. get_safe_registers(p->thread.regs.regs.gp, p->thread.regs.regs.fp);
  150. p->thread.request.u.thread.proc = (int (*)(void *))sp;
  151. p->thread.request.u.thread.arg = (void *)arg;
  152. handler = new_thread_handler;
  153. }
  154. new_thread(task_stack_page(p), &p->thread.switch_buf, handler);
  155. if (!kthread) {
  156. clear_flushed_tls(p);
  157. /*
  158. * Set a new TLS for the child thread?
  159. */
  160. if (clone_flags & CLONE_SETTLS)
  161. ret = arch_copy_tls(p);
  162. }
  163. return ret;
  164. }
  165. void initial_thread_cb(void (*proc)(void *), void *arg)
  166. {
  167. int save_kmalloc_ok = kmalloc_ok;
  168. kmalloc_ok = 0;
  169. initial_thread_cb_skas(proc, arg);
  170. kmalloc_ok = save_kmalloc_ok;
  171. }
  172. void arch_cpu_idle(void)
  173. {
  174. unsigned long long nsecs;
  175. cpu_tasks[current_thread_info()->cpu].pid = os_getpid();
  176. nsecs = disable_timer();
  177. idle_sleep(nsecs);
  178. local_irq_enable();
  179. }
  180. int __cant_sleep(void) {
  181. return in_atomic() || irqs_disabled() || in_interrupt();
  182. /* Is in_interrupt() really needed? */
  183. }
  184. int user_context(unsigned long sp)
  185. {
  186. unsigned long stack;
  187. stack = sp & (PAGE_MASK << CONFIG_KERNEL_STACK_ORDER);
  188. return stack != (unsigned long) current_thread_info();
  189. }
  190. extern exitcall_t __uml_exitcall_begin, __uml_exitcall_end;
  191. void do_uml_exitcalls(void)
  192. {
  193. exitcall_t *call;
  194. call = &__uml_exitcall_end;
  195. while (--call >= &__uml_exitcall_begin)
  196. (*call)();
  197. }
  198. char *uml_strdup(const char *string)
  199. {
  200. return kstrdup(string, GFP_KERNEL);
  201. }
  202. EXPORT_SYMBOL(uml_strdup);
  203. int copy_to_user_proc(void __user *to, void *from, int size)
  204. {
  205. return copy_to_user(to, from, size);
  206. }
  207. int copy_from_user_proc(void *to, void __user *from, int size)
  208. {
  209. return copy_from_user(to, from, size);
  210. }
  211. int clear_user_proc(void __user *buf, int size)
  212. {
  213. return clear_user(buf, size);
  214. }
  215. int strlen_user_proc(char __user *str)
  216. {
  217. return strlen_user(str);
  218. }
  219. int smp_sigio_handler(void)
  220. {
  221. #ifdef CONFIG_SMP
  222. int cpu = current_thread_info()->cpu;
  223. IPI_handler(cpu);
  224. if (cpu != 0)
  225. return 1;
  226. #endif
  227. return 0;
  228. }
  229. int cpu(void)
  230. {
  231. return current_thread_info()->cpu;
  232. }
  233. static atomic_t using_sysemu = ATOMIC_INIT(0);
  234. int sysemu_supported;
  235. void set_using_sysemu(int value)
  236. {
  237. if (value > sysemu_supported)
  238. return;
  239. atomic_set(&using_sysemu, value);
  240. }
  241. int get_using_sysemu(void)
  242. {
  243. return atomic_read(&using_sysemu);
  244. }
  245. static int sysemu_proc_show(struct seq_file *m, void *v)
  246. {
  247. seq_printf(m, "%d\n", get_using_sysemu());
  248. return 0;
  249. }
  250. static int sysemu_proc_open(struct inode *inode, struct file *file)
  251. {
  252. return single_open(file, sysemu_proc_show, NULL);
  253. }
  254. static ssize_t sysemu_proc_write(struct file *file, const char __user *buf,
  255. size_t count, loff_t *pos)
  256. {
  257. char tmp[2];
  258. if (copy_from_user(tmp, buf, 1))
  259. return -EFAULT;
  260. if (tmp[0] >= '0' && tmp[0] <= '2')
  261. set_using_sysemu(tmp[0] - '0');
  262. /* We use the first char, but pretend to write everything */
  263. return count;
  264. }
  265. static const struct file_operations sysemu_proc_fops = {
  266. .owner = THIS_MODULE,
  267. .open = sysemu_proc_open,
  268. .read = seq_read,
  269. .llseek = seq_lseek,
  270. .release = single_release,
  271. .write = sysemu_proc_write,
  272. };
  273. int __init make_proc_sysemu(void)
  274. {
  275. struct proc_dir_entry *ent;
  276. if (!sysemu_supported)
  277. return 0;
  278. ent = proc_create("sysemu", 0600, NULL, &sysemu_proc_fops);
  279. if (ent == NULL)
  280. {
  281. printk(KERN_WARNING "Failed to register /proc/sysemu\n");
  282. return 0;
  283. }
  284. return 0;
  285. }
  286. late_initcall(make_proc_sysemu);
  287. int singlestepping(void * t)
  288. {
  289. struct task_struct *task = t ? t : current;
  290. if (!(task->ptrace & PT_DTRACE))
  291. return 0;
  292. if (task->thread.singlestep_syscall)
  293. return 1;
  294. return 2;
  295. }
  296. /*
  297. * Only x86 and x86_64 have an arch_align_stack().
  298. * All other arches have "#define arch_align_stack(x) (x)"
  299. * in their asm/system.h
  300. * As this is included in UML from asm-um/system-generic.h,
  301. * we can use it to behave as the subarch does.
  302. */
  303. #ifndef arch_align_stack
  304. unsigned long arch_align_stack(unsigned long sp)
  305. {
  306. if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
  307. sp -= get_random_int() % 8192;
  308. return sp & ~0xf;
  309. }
  310. #endif
  311. unsigned long get_wchan(struct task_struct *p)
  312. {
  313. unsigned long stack_page, sp, ip;
  314. bool seen_sched = 0;
  315. if ((p == NULL) || (p == current) || (p->state == TASK_RUNNING))
  316. return 0;
  317. stack_page = (unsigned long) task_stack_page(p);
  318. /* Bail if the process has no kernel stack for some reason */
  319. if (stack_page == 0)
  320. return 0;
  321. sp = p->thread.switch_buf->JB_SP;
  322. /*
  323. * Bail if the stack pointer is below the bottom of the kernel
  324. * stack for some reason
  325. */
  326. if (sp < stack_page)
  327. return 0;
  328. while (sp < stack_page + THREAD_SIZE) {
  329. ip = *((unsigned long *) sp);
  330. if (in_sched_functions(ip))
  331. /* Ignore everything until we're above the scheduler */
  332. seen_sched = 1;
  333. else if (kernel_text_address(ip) && seen_sched)
  334. return ip;
  335. sp += sizeof(unsigned long);
  336. }
  337. return 0;
  338. }
  339. int elf_core_copy_fpregs(struct task_struct *t, elf_fpregset_t *fpu)
  340. {
  341. int cpu = current_thread_info()->cpu;
  342. return save_fp_registers(userspace_pid[cpu], (unsigned long *) fpu);
  343. }