psdev.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433
  1. /*
  2. * An implementation of a loadable kernel mode driver providing
  3. * multiple kernel/user space bidirectional communications links.
  4. *
  5. * Author: Alan Cox <alan@lxorguk.ukuu.org.uk>
  6. *
  7. * This program is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU General Public License
  9. * as published by the Free Software Foundation; either version
  10. * 2 of the License, or (at your option) any later version.
  11. *
  12. * Adapted to become the Linux 2.0 Coda pseudo device
  13. * Peter Braam <braam@maths.ox.ac.uk>
  14. * Michael Callahan <mjc@emmy.smith.edu>
  15. *
  16. * Changes for Linux 2.1
  17. * Copyright (c) 1997 Carnegie-Mellon University
  18. */
  19. #include <linux/module.h>
  20. #include <linux/errno.h>
  21. #include <linux/kernel.h>
  22. #include <linux/major.h>
  23. #include <linux/time.h>
  24. #include <linux/sched.h>
  25. #include <linux/slab.h>
  26. #include <linux/ioport.h>
  27. #include <linux/fcntl.h>
  28. #include <linux/delay.h>
  29. #include <linux/skbuff.h>
  30. #include <linux/proc_fs.h>
  31. #include <linux/vmalloc.h>
  32. #include <linux/fs.h>
  33. #include <linux/file.h>
  34. #include <linux/poll.h>
  35. #include <linux/init.h>
  36. #include <linux/list.h>
  37. #include <linux/mutex.h>
  38. #include <linux/device.h>
  39. #include <linux/pid_namespace.h>
  40. #include <asm/io.h>
  41. #include <asm/poll.h>
  42. #include <asm/uaccess.h>
  43. #include <linux/coda.h>
  44. #include <linux/coda_psdev.h>
  45. #include "coda_linux.h"
  46. #include "coda_int.h"
  47. /* statistics */
  48. int coda_hard; /* allows signals during upcalls */
  49. unsigned long coda_timeout = 30; /* .. secs, then signals will dequeue */
  50. struct venus_comm coda_comms[MAX_CODADEVS];
  51. static struct class *coda_psdev_class;
  52. /*
  53. * Device operations
  54. */
  55. static unsigned int coda_psdev_poll(struct file *file, poll_table * wait)
  56. {
  57. struct venus_comm *vcp = (struct venus_comm *) file->private_data;
  58. unsigned int mask = POLLOUT | POLLWRNORM;
  59. poll_wait(file, &vcp->vc_waitq, wait);
  60. mutex_lock(&vcp->vc_mutex);
  61. if (!list_empty(&vcp->vc_pending))
  62. mask |= POLLIN | POLLRDNORM;
  63. mutex_unlock(&vcp->vc_mutex);
  64. return mask;
  65. }
  66. static long coda_psdev_ioctl(struct file * filp, unsigned int cmd, unsigned long arg)
  67. {
  68. unsigned int data;
  69. switch(cmd) {
  70. case CIOC_KERNEL_VERSION:
  71. data = CODA_KERNEL_VERSION;
  72. return put_user(data, (int __user *) arg);
  73. default:
  74. return -ENOTTY;
  75. }
  76. return 0;
  77. }
  78. /*
  79. * Receive a message written by Venus to the psdev
  80. */
  81. static ssize_t coda_psdev_write(struct file *file, const char __user *buf,
  82. size_t nbytes, loff_t *off)
  83. {
  84. struct venus_comm *vcp = (struct venus_comm *) file->private_data;
  85. struct upc_req *req = NULL;
  86. struct upc_req *tmp;
  87. struct list_head *lh;
  88. struct coda_in_hdr hdr;
  89. ssize_t retval = 0, count = 0;
  90. int error;
  91. /* Peek at the opcode, uniquefier */
  92. if (copy_from_user(&hdr, buf, 2 * sizeof(u_long)))
  93. return -EFAULT;
  94. if (DOWNCALL(hdr.opcode)) {
  95. union outputArgs *dcbuf;
  96. int size = sizeof(*dcbuf);
  97. if ( nbytes < sizeof(struct coda_out_hdr) ) {
  98. printk("coda_downcall opc %d uniq %d, not enough!\n",
  99. hdr.opcode, hdr.unique);
  100. count = nbytes;
  101. goto out;
  102. }
  103. if ( nbytes > size ) {
  104. printk("Coda: downcall opc %d, uniq %d, too much!",
  105. hdr.opcode, hdr.unique);
  106. nbytes = size;
  107. }
  108. CODA_ALLOC(dcbuf, union outputArgs *, nbytes);
  109. if (copy_from_user(dcbuf, buf, nbytes)) {
  110. CODA_FREE(dcbuf, nbytes);
  111. retval = -EFAULT;
  112. goto out;
  113. }
  114. /* what downcall errors does Venus handle ? */
  115. error = coda_downcall(vcp, hdr.opcode, dcbuf);
  116. CODA_FREE(dcbuf, nbytes);
  117. if (error) {
  118. printk("psdev_write: coda_downcall error: %d\n", error);
  119. retval = error;
  120. goto out;
  121. }
  122. count = nbytes;
  123. goto out;
  124. }
  125. /* Look for the message on the processing queue. */
  126. mutex_lock(&vcp->vc_mutex);
  127. list_for_each(lh, &vcp->vc_processing) {
  128. tmp = list_entry(lh, struct upc_req , uc_chain);
  129. if (tmp->uc_unique == hdr.unique) {
  130. req = tmp;
  131. list_del(&req->uc_chain);
  132. break;
  133. }
  134. }
  135. mutex_unlock(&vcp->vc_mutex);
  136. if (!req) {
  137. printk("psdev_write: msg (%d, %d) not found\n",
  138. hdr.opcode, hdr.unique);
  139. retval = -ESRCH;
  140. goto out;
  141. }
  142. /* move data into response buffer. */
  143. if (req->uc_outSize < nbytes) {
  144. printk("psdev_write: too much cnt: %d, cnt: %ld, opc: %d, uniq: %d.\n",
  145. req->uc_outSize, (long)nbytes, hdr.opcode, hdr.unique);
  146. nbytes = req->uc_outSize; /* don't have more space! */
  147. }
  148. if (copy_from_user(req->uc_data, buf, nbytes)) {
  149. req->uc_flags |= CODA_REQ_ABORT;
  150. wake_up(&req->uc_sleep);
  151. retval = -EFAULT;
  152. goto out;
  153. }
  154. /* adjust outsize. is this useful ?? */
  155. req->uc_outSize = nbytes;
  156. req->uc_flags |= CODA_REQ_WRITE;
  157. count = nbytes;
  158. /* Convert filedescriptor into a file handle */
  159. if (req->uc_opcode == CODA_OPEN_BY_FD) {
  160. struct coda_open_by_fd_out *outp =
  161. (struct coda_open_by_fd_out *)req->uc_data;
  162. if (!outp->oh.result)
  163. outp->fh = fget(outp->fd);
  164. }
  165. wake_up(&req->uc_sleep);
  166. out:
  167. return(count ? count : retval);
  168. }
  169. /*
  170. * Read a message from the kernel to Venus
  171. */
  172. static ssize_t coda_psdev_read(struct file * file, char __user * buf,
  173. size_t nbytes, loff_t *off)
  174. {
  175. DECLARE_WAITQUEUE(wait, current);
  176. struct venus_comm *vcp = (struct venus_comm *) file->private_data;
  177. struct upc_req *req;
  178. ssize_t retval = 0, count = 0;
  179. if (nbytes == 0)
  180. return 0;
  181. mutex_lock(&vcp->vc_mutex);
  182. add_wait_queue(&vcp->vc_waitq, &wait);
  183. set_current_state(TASK_INTERRUPTIBLE);
  184. while (list_empty(&vcp->vc_pending)) {
  185. if (file->f_flags & O_NONBLOCK) {
  186. retval = -EAGAIN;
  187. break;
  188. }
  189. if (signal_pending(current)) {
  190. retval = -ERESTARTSYS;
  191. break;
  192. }
  193. mutex_unlock(&vcp->vc_mutex);
  194. schedule();
  195. mutex_lock(&vcp->vc_mutex);
  196. }
  197. set_current_state(TASK_RUNNING);
  198. remove_wait_queue(&vcp->vc_waitq, &wait);
  199. if (retval)
  200. goto out;
  201. req = list_entry(vcp->vc_pending.next, struct upc_req,uc_chain);
  202. list_del(&req->uc_chain);
  203. /* Move the input args into userspace */
  204. count = req->uc_inSize;
  205. if (nbytes < req->uc_inSize) {
  206. printk ("psdev_read: Venus read %ld bytes of %d in message\n",
  207. (long)nbytes, req->uc_inSize);
  208. count = nbytes;
  209. }
  210. if (copy_to_user(buf, req->uc_data, count))
  211. retval = -EFAULT;
  212. /* If request was not a signal, enqueue and don't free */
  213. if (!(req->uc_flags & CODA_REQ_ASYNC)) {
  214. req->uc_flags |= CODA_REQ_READ;
  215. list_add_tail(&(req->uc_chain), &vcp->vc_processing);
  216. goto out;
  217. }
  218. CODA_FREE(req->uc_data, sizeof(struct coda_in_hdr));
  219. kfree(req);
  220. out:
  221. mutex_unlock(&vcp->vc_mutex);
  222. return (count ? count : retval);
  223. }
  224. static int coda_psdev_open(struct inode * inode, struct file * file)
  225. {
  226. struct venus_comm *vcp;
  227. int idx, err;
  228. if (task_active_pid_ns(current) != &init_pid_ns)
  229. return -EINVAL;
  230. idx = iminor(inode);
  231. if (idx < 0 || idx >= MAX_CODADEVS)
  232. return -ENODEV;
  233. err = -EBUSY;
  234. vcp = &coda_comms[idx];
  235. mutex_lock(&vcp->vc_mutex);
  236. if (!vcp->vc_inuse) {
  237. vcp->vc_inuse++;
  238. INIT_LIST_HEAD(&vcp->vc_pending);
  239. INIT_LIST_HEAD(&vcp->vc_processing);
  240. init_waitqueue_head(&vcp->vc_waitq);
  241. vcp->vc_sb = NULL;
  242. vcp->vc_seq = 0;
  243. file->private_data = vcp;
  244. err = 0;
  245. }
  246. mutex_unlock(&vcp->vc_mutex);
  247. return err;
  248. }
  249. static int coda_psdev_release(struct inode * inode, struct file * file)
  250. {
  251. struct venus_comm *vcp = (struct venus_comm *) file->private_data;
  252. struct upc_req *req, *tmp;
  253. if (!vcp || !vcp->vc_inuse ) {
  254. printk("psdev_release: Not open.\n");
  255. return -1;
  256. }
  257. mutex_lock(&vcp->vc_mutex);
  258. /* Wakeup clients so they can return. */
  259. list_for_each_entry_safe(req, tmp, &vcp->vc_pending, uc_chain) {
  260. list_del(&req->uc_chain);
  261. /* Async requests need to be freed here */
  262. if (req->uc_flags & CODA_REQ_ASYNC) {
  263. CODA_FREE(req->uc_data, sizeof(struct coda_in_hdr));
  264. kfree(req);
  265. continue;
  266. }
  267. req->uc_flags |= CODA_REQ_ABORT;
  268. wake_up(&req->uc_sleep);
  269. }
  270. list_for_each_entry_safe(req, tmp, &vcp->vc_processing, uc_chain) {
  271. list_del(&req->uc_chain);
  272. req->uc_flags |= CODA_REQ_ABORT;
  273. wake_up(&req->uc_sleep);
  274. }
  275. file->private_data = NULL;
  276. vcp->vc_inuse--;
  277. mutex_unlock(&vcp->vc_mutex);
  278. return 0;
  279. }
  280. static const struct file_operations coda_psdev_fops = {
  281. .owner = THIS_MODULE,
  282. .read = coda_psdev_read,
  283. .write = coda_psdev_write,
  284. .poll = coda_psdev_poll,
  285. .unlocked_ioctl = coda_psdev_ioctl,
  286. .open = coda_psdev_open,
  287. .release = coda_psdev_release,
  288. .llseek = noop_llseek,
  289. };
  290. static int init_coda_psdev(void)
  291. {
  292. int i, err = 0;
  293. if (register_chrdev(CODA_PSDEV_MAJOR, "coda", &coda_psdev_fops)) {
  294. printk(KERN_ERR "coda_psdev: unable to get major %d\n",
  295. CODA_PSDEV_MAJOR);
  296. return -EIO;
  297. }
  298. coda_psdev_class = class_create(THIS_MODULE, "coda");
  299. if (IS_ERR(coda_psdev_class)) {
  300. err = PTR_ERR(coda_psdev_class);
  301. goto out_chrdev;
  302. }
  303. for (i = 0; i < MAX_CODADEVS; i++) {
  304. mutex_init(&(&coda_comms[i])->vc_mutex);
  305. device_create(coda_psdev_class, NULL,
  306. MKDEV(CODA_PSDEV_MAJOR, i), NULL, "cfs%d", i);
  307. }
  308. coda_sysctl_init();
  309. goto out;
  310. out_chrdev:
  311. unregister_chrdev(CODA_PSDEV_MAJOR, "coda");
  312. out:
  313. return err;
  314. }
  315. MODULE_AUTHOR("Jan Harkes, Peter J. Braam");
  316. MODULE_DESCRIPTION("Coda Distributed File System VFS interface");
  317. MODULE_ALIAS_CHARDEV_MAJOR(CODA_PSDEV_MAJOR);
  318. MODULE_LICENSE("GPL");
  319. MODULE_VERSION("6.6");
  320. static int __init init_coda(void)
  321. {
  322. int status;
  323. int i;
  324. status = coda_init_inodecache();
  325. if (status)
  326. goto out2;
  327. status = init_coda_psdev();
  328. if ( status ) {
  329. printk("Problem (%d) in init_coda_psdev\n", status);
  330. goto out1;
  331. }
  332. status = register_filesystem(&coda_fs_type);
  333. if (status) {
  334. printk("coda: failed to register filesystem!\n");
  335. goto out;
  336. }
  337. return 0;
  338. out:
  339. for (i = 0; i < MAX_CODADEVS; i++)
  340. device_destroy(coda_psdev_class, MKDEV(CODA_PSDEV_MAJOR, i));
  341. class_destroy(coda_psdev_class);
  342. unregister_chrdev(CODA_PSDEV_MAJOR, "coda");
  343. coda_sysctl_clean();
  344. out1:
  345. coda_destroy_inodecache();
  346. out2:
  347. return status;
  348. }
  349. static void __exit exit_coda(void)
  350. {
  351. int err, i;
  352. err = unregister_filesystem(&coda_fs_type);
  353. if ( err != 0 ) {
  354. printk("coda: failed to unregister filesystem\n");
  355. }
  356. for (i = 0; i < MAX_CODADEVS; i++)
  357. device_destroy(coda_psdev_class, MKDEV(CODA_PSDEV_MAJOR, i));
  358. class_destroy(coda_psdev_class);
  359. unregister_chrdev(CODA_PSDEV_MAJOR, "coda");
  360. coda_sysctl_clean();
  361. coda_destroy_inodecache();
  362. }
  363. module_init(init_coda);
  364. module_exit(exit_coda);