psdev.c 10 KB

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