process.c 8.5 KB

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