proc.c 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366
  1. /*
  2. * Copyright (c) 2013
  3. * The President and Fellows of Harvard College.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. * 1. Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * 2. Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in the
  12. * documentation and/or other materials provided with the distribution.
  13. * 3. Neither the name of the University nor the names of its contributors
  14. * may be used to endorse or promote products derived from this software
  15. * without specific prior written permission.
  16. *
  17. * THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY AND CONTRIBUTORS ``AS IS'' AND
  18. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20. * ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OR CONTRIBUTORS BE LIABLE
  21. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27. * SUCH DAMAGE.
  28. */
  29. /*
  30. * Process support.
  31. *
  32. * There is (intentionally) not much here; you will need to add stuff
  33. * and maybe change around what's already present.
  34. *
  35. * p_lock is intended to be held when manipulating the pointers in the
  36. * proc structure, not while doing any significant work with the
  37. * things they point to. Rearrange this (and/or change it to be a
  38. * regular lock) as needed.
  39. *
  40. * Unless you're implementing multithreaded user processes, the only
  41. * process that will have more than one thread is the kernel process.
  42. */
  43. #include <types.h>
  44. #include <proc.h>
  45. #include <current.h>
  46. #include <addrspace.h>
  47. #include <vnode.h>
  48. #include <vfs.h>
  49. #include <synch.h>
  50. #include <kern/fcntl.h>
  51. /*
  52. * The process for the kernel; this holds all the kernel-only threads.
  53. */
  54. struct proc *kproc;
  55. /*
  56. * Mechanism for making the kernel menu thread sleep while processes are running
  57. */
  58. #ifdef UW
  59. /* count of the number of processes, excluding kproc */
  60. static volatile unsigned int proc_count;
  61. /* provides mutual exclusion for proc_count */
  62. /* it would be better to use a lock here, but we use a semaphore because locks are not implemented in the base kernel */
  63. static struct semaphore *proc_count_mutex;
  64. /* used to signal the kernel menu thread when there are no processes */
  65. struct semaphore *no_proc_sem;
  66. #endif // UW
  67. /*
  68. * Create a proc structure.
  69. */
  70. static
  71. struct proc *
  72. proc_create(const char *name)
  73. {
  74. struct proc *proc;
  75. proc = kmalloc(sizeof(*proc));
  76. if (proc == NULL) {
  77. return NULL;
  78. }
  79. proc->p_name = kstrdup(name);
  80. if (proc->p_name == NULL) {
  81. kfree(proc);
  82. return NULL;
  83. }
  84. threadarray_init(&proc->p_threads);
  85. spinlock_init(&proc->p_lock);
  86. /* VM fields */
  87. proc->p_addrspace = NULL;
  88. /* VFS fields */
  89. proc->p_cwd = NULL;
  90. #ifdef UW
  91. proc->console = NULL;
  92. #endif // UW
  93. return proc;
  94. }
  95. /*
  96. * Destroy a proc structure.
  97. */
  98. void
  99. proc_destroy(struct proc *proc)
  100. {
  101. /*
  102. * note: some parts of the process structure, such as the address space,
  103. * are destroyed in sys_exit, before we get here
  104. *
  105. * note: depending on where this function is called from, curproc may not
  106. * be defined because the calling thread may have already detached itself
  107. * from the process.
  108. */
  109. KASSERT(proc != NULL);
  110. KASSERT(proc != kproc);
  111. /*
  112. * We don't take p_lock in here because we must have the only
  113. * reference to this structure. (Otherwise it would be
  114. * incorrect to destroy it.)
  115. */
  116. /* VFS fields */
  117. if (proc->p_cwd) {
  118. VOP_DECREF(proc->p_cwd);
  119. proc->p_cwd = NULL;
  120. }
  121. #ifndef UW // in the UW version, space destruction occurs in sys_exit, not here
  122. if (proc->p_addrspace) {
  123. /*
  124. * In case p is the currently running process (which
  125. * it might be in some circumstances, or if this code
  126. * gets moved into exit as suggested above), clear
  127. * p_addrspace before calling as_destroy. Otherwise if
  128. * as_destroy sleeps (which is quite possible) when we
  129. * come back we'll be calling as_activate on a
  130. * half-destroyed address space. This tends to be
  131. * messily fatal.
  132. */
  133. struct addrspace *as;
  134. as_deactivate();
  135. as = curproc_setas(NULL);
  136. as_destroy(as);
  137. }
  138. #endif // UW
  139. #ifdef UW
  140. if (proc->console) {
  141. vfs_close(proc->console);
  142. }
  143. #endif // UW
  144. threadarray_cleanup(&proc->p_threads);
  145. spinlock_cleanup(&proc->p_lock);
  146. kfree(proc->p_name);
  147. kfree(proc);
  148. #ifdef UW
  149. /* decrement the process count */
  150. /* note: kproc is not included in the process count, but proc_destroy
  151. is never called on kproc (see KASSERT above), so we're OK to decrement
  152. the proc_count unconditionally here */
  153. P(proc_count_mutex);
  154. KASSERT(proc_count > 0);
  155. proc_count--;
  156. /* signal the kernel menu thread if the process count has reached zero */
  157. if (proc_count == 0) {
  158. V(no_proc_sem);
  159. }
  160. V(proc_count_mutex);
  161. #endif // UW
  162. }
  163. /*
  164. * Create the process structure for the kernel.
  165. */
  166. void
  167. proc_bootstrap(void)
  168. {
  169. kproc = proc_create("[kernel]");
  170. if (kproc == NULL) {
  171. panic("proc_create for kproc failed\n");
  172. }
  173. #ifdef UW
  174. proc_count = 0;
  175. proc_count_mutex = sem_create("proc_count_mutex",1);
  176. if (proc_count_mutex == NULL) {
  177. panic("could not create proc_count_mutex semaphore\n");
  178. }
  179. no_proc_sem = sem_create("no_proc_sem",0);
  180. if (no_proc_sem == NULL) {
  181. panic("could not create no_proc_sem semaphore\n");
  182. }
  183. #endif // UW
  184. }
  185. /*
  186. * Create a fresh proc for use by runprogram.
  187. *
  188. * It will have no address space and will inherit the current
  189. * process's (that is, the kernel menu's) current directory.
  190. */
  191. struct proc *
  192. proc_create_runprogram(const char *name)
  193. {
  194. struct proc *proc;
  195. char *console_path;
  196. proc = proc_create(name);
  197. if (proc == NULL) {
  198. return NULL;
  199. }
  200. #ifdef UW
  201. /* open the console - this should always succeed */
  202. console_path = kstrdup("con:");
  203. if (console_path == NULL) {
  204. panic("unable to copy console path name during process creation\n");
  205. }
  206. if (vfs_open(console_path,O_WRONLY,0,&(proc->console))) {
  207. panic("unable to open the console during process creation\n");
  208. }
  209. kfree(console_path);
  210. #endif // UW
  211. /* VM fields */
  212. proc->p_addrspace = NULL;
  213. /* VFS fields */
  214. #ifdef UW
  215. /* we do not need to acquire the p_lock here, the running thread should
  216. have the only reference to this process */
  217. /* also, acquiring the p_lock is problematic because VOP_INCREF may block */
  218. if (curproc->p_cwd != NULL) {
  219. VOP_INCREF(curproc->p_cwd);
  220. proc->p_cwd = curproc->p_cwd;
  221. }
  222. #else // UW
  223. spinlock_acquire(&curproc->p_lock);
  224. if (curproc->p_cwd != NULL) {
  225. VOP_INCREF(curproc->p_cwd);
  226. proc->p_cwd = curproc->p_cwd;
  227. }
  228. spinlock_release(&curproc->p_lock);
  229. #endif // UW
  230. #ifdef UW
  231. /* increment the count of processes */
  232. /* we are assuming that all procs, including those created by fork(),
  233. are created using a call to proc_create_runprogram */
  234. P(proc_count_mutex);
  235. proc_count++;
  236. V(proc_count_mutex);
  237. #endif // UW
  238. return proc;
  239. }
  240. /*
  241. * Add a thread to a process. Either the thread or the process might
  242. * or might not be current.
  243. */
  244. int
  245. proc_addthread(struct proc *proc, struct thread *t)
  246. {
  247. int result;
  248. KASSERT(t->t_proc == NULL);
  249. spinlock_acquire(&proc->p_lock);
  250. result = threadarray_add(&proc->p_threads, t, NULL);
  251. spinlock_release(&proc->p_lock);
  252. if (result) {
  253. return result;
  254. }
  255. t->t_proc = proc;
  256. return 0;
  257. }
  258. /*
  259. * Remove a thread from its process. Either the thread or the process
  260. * might or might not be current.
  261. */
  262. void
  263. proc_remthread(struct thread *t)
  264. {
  265. struct proc *proc;
  266. unsigned i, num;
  267. proc = t->t_proc;
  268. KASSERT(proc != NULL);
  269. spinlock_acquire(&proc->p_lock);
  270. /* ugh: find the thread in the array */
  271. num = threadarray_num(&proc->p_threads);
  272. for (i=0; i<num; i++) {
  273. if (threadarray_get(&proc->p_threads, i) == t) {
  274. threadarray_remove(&proc->p_threads, i);
  275. spinlock_release(&proc->p_lock);
  276. t->t_proc = NULL;
  277. return;
  278. }
  279. }
  280. /* Did not find it. */
  281. spinlock_release(&proc->p_lock);
  282. panic("Thread (%p) has escaped from its process (%p)\n", t, proc);
  283. }
  284. /*
  285. * Fetch the address space of the current process. Caution: it isn't
  286. * refcounted. If you implement multithreaded processes, make sure to
  287. * set up a refcount scheme or some other method to make this safe.
  288. */
  289. struct addrspace *
  290. curproc_getas(void)
  291. {
  292. struct addrspace *as;
  293. #ifdef UW
  294. /* Until user processes are created, threads used in testing
  295. * (i.e., kernel threads) have no process or address space.
  296. */
  297. if (curproc == NULL) {
  298. return NULL;
  299. }
  300. #endif
  301. spinlock_acquire(&curproc->p_lock);
  302. as = curproc->p_addrspace;
  303. spinlock_release(&curproc->p_lock);
  304. return as;
  305. }
  306. /*
  307. * Change the address space of the current process, and return the old
  308. * one.
  309. */
  310. struct addrspace *
  311. curproc_setas(struct addrspace *newas)
  312. {
  313. struct addrspace *oldas;
  314. struct proc *proc = curproc;
  315. spinlock_acquire(&proc->p_lock);
  316. oldas = proc->p_addrspace;
  317. proc->p_addrspace = newas;
  318. spinlock_release(&proc->p_lock);
  319. return oldas;
  320. }