proc.c 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376
  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 struct proc * proc_create(const char * name)
  71. {
  72. struct proc * proc;
  73. proc = kmalloc(sizeof(*proc));
  74. if (proc == NULL)
  75. {
  76. return NULL;
  77. }
  78. proc->p_name = kstrdup(name);
  79. if (proc->p_name == NULL)
  80. {
  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 proc_destroy(struct proc * proc)
  99. {
  100. /*
  101. * note: some parts of the process structure, such as the address space,
  102. * are destroyed in sys_exit, before we get here
  103. *
  104. * note: depending on where this function is called from, curproc may not
  105. * be defined because the calling thread may have already detached itself
  106. * from the process.
  107. */
  108. KASSERT(proc != NULL);
  109. KASSERT(proc != kproc);
  110. /*
  111. * We don't take p_lock in here because we must have the only
  112. * reference to this structure. (Otherwise it would be
  113. * incorrect to destroy it.)
  114. */
  115. /* VFS fields */
  116. if (proc->p_cwd)
  117. {
  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. /*
  125. * In case p is the currently running process (which
  126. * it might be in some circumstances, or if this code
  127. * gets moved into exit as suggested above), clear
  128. * p_addrspace before calling as_destroy. Otherwise if
  129. * as_destroy sleeps (which is quite possible) when we
  130. * come back we'll be calling as_activate on a
  131. * half-destroyed address space. This tends to be
  132. * messily fatal.
  133. */
  134. struct addrspace * as;
  135. as_deactivate();
  136. as = curproc_setas(NULL);
  137. as_destroy(as);
  138. }
  139. #endif // UW
  140. #ifdef UW
  141. if (proc->console)
  142. {
  143. vfs_close(proc->console);
  144. }
  145. #endif // UW
  146. threadarray_cleanup(&proc->p_threads);
  147. spinlock_cleanup(&proc->p_lock);
  148. kfree(proc->p_name);
  149. kfree(proc);
  150. #ifdef UW
  151. /* decrement the process count */
  152. /* note: kproc is not included in the process count, but proc_destroy
  153. is never called on kproc (see KASSERT above), so we're OK to decrement
  154. the proc_count unconditionally here */
  155. P(proc_count_mutex);
  156. KASSERT(proc_count > 0);
  157. proc_count--;
  158. /* signal the kernel menu thread if the process count has reached zero */
  159. if (proc_count == 0)
  160. {
  161. V(no_proc_sem);
  162. }
  163. V(proc_count_mutex);
  164. #endif // UW
  165. }
  166. /*
  167. * Create the process structure for the kernel.
  168. */
  169. void proc_bootstrap(void)
  170. {
  171. kproc = proc_create("[kernel]");
  172. if (kproc == NULL)
  173. {
  174. panic("proc_create for kproc failed\n");
  175. }
  176. #ifdef UW
  177. proc_count = 0;
  178. proc_count_mutex = sem_create("proc_count_mutex",1);
  179. if (proc_count_mutex == NULL)
  180. {
  181. panic("could not create proc_count_mutex semaphore\n");
  182. }
  183. no_proc_sem = sem_create("no_proc_sem",0);
  184. if (no_proc_sem == NULL)
  185. {
  186. panic("could not create no_proc_sem semaphore\n");
  187. }
  188. #endif // UW
  189. }
  190. /*
  191. * Create a fresh proc for use by runprogram.
  192. *
  193. * It will have no address space and will inherit the current
  194. * process's (that is, the kernel menu's) current directory.
  195. */
  196. struct proc * proc_create_runprogram(const char * name)
  197. {
  198. struct proc * proc;
  199. char * console_path;
  200. proc = proc_create(name);
  201. if (proc == NULL)
  202. {
  203. return NULL;
  204. }
  205. #ifdef UW
  206. /* open the console - this should always succeed */
  207. console_path = kstrdup("con:");
  208. if (console_path == NULL)
  209. {
  210. panic("unable to copy console path name during process creation\n");
  211. }
  212. if (vfs_open(console_path,O_WRONLY,0,&(proc->console)))
  213. {
  214. panic("unable to open the console during process creation\n");
  215. }
  216. kfree(console_path);
  217. #endif // UW
  218. /* VM fields */
  219. proc->p_addrspace = NULL;
  220. /* VFS fields */
  221. #ifdef UW
  222. /* we do not need to acquire the p_lock here, the running thread should
  223. have the only reference to this process */
  224. /* also, acquiring the p_lock is problematic because VOP_INCREF may block */
  225. if (curproc->p_cwd != NULL)
  226. {
  227. VOP_INCREF(curproc->p_cwd);
  228. proc->p_cwd = curproc->p_cwd;
  229. }
  230. #else // UW
  231. spinlock_acquire(&curproc->p_lock);
  232. if (curproc->p_cwd != NULL)
  233. {
  234. VOP_INCREF(curproc->p_cwd);
  235. proc->p_cwd = curproc->p_cwd;
  236. }
  237. spinlock_release(&curproc->p_lock);
  238. #endif // UW
  239. #ifdef UW
  240. /* increment the count of processes */
  241. /* we are assuming that all procs, including those created by fork(),
  242. are created using a call to proc_create_runprogram */
  243. P(proc_count_mutex);
  244. proc_count++;
  245. V(proc_count_mutex);
  246. #endif // UW
  247. return proc;
  248. }
  249. /*
  250. * Add a thread to a process. Either the thread or the process might
  251. * or might not be current.
  252. */
  253. int proc_addthread(struct proc * proc, struct thread * t)
  254. {
  255. int result;
  256. KASSERT(t->t_proc == NULL);
  257. spinlock_acquire(&proc->p_lock);
  258. result = threadarray_add(&proc->p_threads, t, NULL);
  259. spinlock_release(&proc->p_lock);
  260. if (result)
  261. {
  262. return result;
  263. }
  264. t->t_proc = proc;
  265. return 0;
  266. }
  267. /*
  268. * Remove a thread from its process. Either the thread or the process
  269. * might or might not be current.
  270. */
  271. void proc_remthread(struct thread * t)
  272. {
  273. struct proc *proc;
  274. unsigned i, num;
  275. proc = t->t_proc;
  276. KASSERT(proc != NULL);
  277. spinlock_acquire(&proc->p_lock);
  278. /* ugh: find the thread in the array */
  279. num = threadarray_num(&proc->p_threads);
  280. for (i=0; i<num; i++)
  281. {
  282. if (threadarray_get(&proc->p_threads, i) == t)
  283. {
  284. threadarray_remove(&proc->p_threads, i);
  285. spinlock_release(&proc->p_lock);
  286. t->t_proc = NULL;
  287. return;
  288. }
  289. }
  290. /* Did not find it. */
  291. spinlock_release(&proc->p_lock);
  292. panic("Thread (%p) has escaped from its process (%p)\n", t, proc);
  293. }
  294. /*
  295. * Fetch the address space of the current process. Caution: it isn't
  296. * refcounted. If you implement multithreaded processes, make sure to
  297. * set up a refcount scheme or some other method to make this safe.
  298. */
  299. struct addrspace * curproc_getas(void)
  300. {
  301. struct addrspace *as;
  302. #ifdef UW
  303. /* Until user processes are created, threads used in testing
  304. * (i.e., kernel threads) have no process or address space.
  305. */
  306. if (curproc == NULL)
  307. {
  308. return NULL;
  309. }
  310. #endif
  311. spinlock_acquire(&curproc->p_lock);
  312. as = curproc->p_addrspace;
  313. spinlock_release(&curproc->p_lock);
  314. return as;
  315. }
  316. /*
  317. * Change the address space of the current process, and return the old
  318. * one.
  319. */
  320. struct addrspace * curproc_setas(struct addrspace * newas)
  321. {
  322. struct addrspace * oldas;
  323. struct proc * proc = curproc;
  324. spinlock_acquire(&proc->p_lock);
  325. oldas = proc->p_addrspace;
  326. proc->p_addrspace = newas;
  327. spinlock_release(&proc->p_lock);
  328. return oldas;
  329. }