trans_fd.c 35 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630
  1. /*
  2. * linux/fs/9p/trans_fd.c
  3. *
  4. * Fd transport layer. Includes deprecated socket layer.
  5. *
  6. * Copyright (C) 2006 by Russ Cox <rsc@swtch.com>
  7. * Copyright (C) 2004-2005 by Latchesar Ionkov <lucho@ionkov.net>
  8. * Copyright (C) 2004-2008 by Eric Van Hensbergen <ericvh@gmail.com>
  9. * Copyright (C) 1997-2002 by Ron Minnich <rminnich@sarnoff.com>
  10. *
  11. * This program is free software; you can redistribute it and/or modify
  12. * it under the terms of the GNU General Public License version 2
  13. * as published by the Free Software Foundation.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  18. * GNU General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public License
  21. * along with this program; if not, write to:
  22. * Free Software Foundation
  23. * 51 Franklin Street, Fifth Floor
  24. * Boston, MA 02111-1301 USA
  25. *
  26. */
  27. #include <linux/in.h>
  28. #include <linux/module.h>
  29. #include <linux/net.h>
  30. #include <linux/ipv6.h>
  31. #include <linux/kthread.h>
  32. #include <linux/errno.h>
  33. #include <linux/kernel.h>
  34. #include <linux/un.h>
  35. #include <linux/uaccess.h>
  36. #include <linux/inet.h>
  37. #include <linux/idr.h>
  38. #include <linux/file.h>
  39. #include <linux/parser.h>
  40. #include <net/9p/9p.h>
  41. #include <net/9p/transport.h>
  42. #define P9_PORT 564
  43. #define MAX_SOCK_BUF (64*1024)
  44. #define ERREQFLUSH 1
  45. #define SCHED_TIMEOUT 10
  46. #define MAXPOLLWADDR 2
  47. /**
  48. * struct p9_fd_opts - per-transport options
  49. * @rfd: file descriptor for reading (trans=fd)
  50. * @wfd: file descriptor for writing (trans=fd)
  51. * @port: port to connect to (trans=tcp)
  52. *
  53. */
  54. struct p9_fd_opts {
  55. int rfd;
  56. int wfd;
  57. u16 port;
  58. };
  59. /**
  60. * struct p9_trans_fd - transport state
  61. * @rd: reference to file to read from
  62. * @wr: reference of file to write to
  63. * @conn: connection state reference
  64. *
  65. */
  66. struct p9_trans_fd {
  67. struct file *rd;
  68. struct file *wr;
  69. struct p9_conn *conn;
  70. };
  71. /*
  72. * Option Parsing (code inspired by NFS code)
  73. * - a little lazy - parse all fd-transport options
  74. */
  75. enum {
  76. /* Options that take integer arguments */
  77. Opt_port, Opt_rfdno, Opt_wfdno, Opt_err,
  78. };
  79. static match_table_t tokens = {
  80. {Opt_port, "port=%u"},
  81. {Opt_rfdno, "rfdno=%u"},
  82. {Opt_wfdno, "wfdno=%u"},
  83. {Opt_err, NULL},
  84. };
  85. enum {
  86. Rworksched = 1, /* read work scheduled or running */
  87. Rpending = 2, /* can read */
  88. Wworksched = 4, /* write work scheduled or running */
  89. Wpending = 8, /* can write */
  90. };
  91. enum {
  92. None,
  93. Flushing,
  94. Flushed,
  95. };
  96. struct p9_req;
  97. typedef void (*p9_conn_req_callback)(struct p9_req *req, void *a);
  98. /**
  99. * struct p9_req - fd mux encoding of an rpc transaction
  100. * @lock: protects req_list
  101. * @tag: numeric tag for rpc transaction
  102. * @tcall: request &p9_fcall structure
  103. * @rcall: response &p9_fcall structure
  104. * @err: error state
  105. * @cb: callback for when response is received
  106. * @cba: argument to pass to callback
  107. * @flush: flag to indicate RPC has been flushed
  108. * @req_list: list link for higher level objects to chain requests
  109. *
  110. */
  111. struct p9_req {
  112. spinlock_t lock;
  113. int tag;
  114. struct p9_fcall *tcall;
  115. struct p9_fcall *rcall;
  116. int err;
  117. p9_conn_req_callback cb;
  118. void *cba;
  119. int flush;
  120. struct list_head req_list;
  121. };
  122. struct p9_mux_poll_task {
  123. struct task_struct *task;
  124. struct list_head mux_list;
  125. int muxnum;
  126. };
  127. /**
  128. * struct p9_conn - fd mux connection state information
  129. * @lock: protects mux_list (?)
  130. * @mux_list: list link for mux to manage multiple connections (?)
  131. * @poll_task: task polling on this connection
  132. * @msize: maximum size for connection (dup)
  133. * @extended: 9p2000.u flag (dup)
  134. * @trans: reference to transport instance for this connection
  135. * @tagpool: id accounting for transactions
  136. * @err: error state
  137. * @req_list: accounting for requests which have been sent
  138. * @unsent_req_list: accounting for requests that haven't been sent
  139. * @rcall: current response &p9_fcall structure
  140. * @rpos: read position in current frame
  141. * @rbuf: current read buffer
  142. * @wpos: write position for current frame
  143. * @wsize: amount of data to write for current frame
  144. * @wbuf: current write buffer
  145. * @poll_wait: array of wait_q's for various worker threads
  146. * @poll_waddr: ????
  147. * @pt: poll state
  148. * @rq: current read work
  149. * @wq: current write work
  150. * @wsched: ????
  151. *
  152. */
  153. struct p9_conn {
  154. spinlock_t lock; /* protect lock structure */
  155. struct list_head mux_list;
  156. struct p9_mux_poll_task *poll_task;
  157. int msize;
  158. unsigned char extended;
  159. struct p9_trans *trans;
  160. struct p9_idpool *tagpool;
  161. int err;
  162. struct list_head req_list;
  163. struct list_head unsent_req_list;
  164. struct p9_fcall *rcall;
  165. int rpos;
  166. char *rbuf;
  167. int wpos;
  168. int wsize;
  169. char *wbuf;
  170. wait_queue_t poll_wait[MAXPOLLWADDR];
  171. wait_queue_head_t *poll_waddr[MAXPOLLWADDR];
  172. poll_table pt;
  173. struct work_struct rq;
  174. struct work_struct wq;
  175. unsigned long wsched;
  176. };
  177. /**
  178. * struct p9_mux_rpc - fd mux rpc accounting structure
  179. * @m: connection this request was issued on
  180. * @err: error state
  181. * @tcall: request &p9_fcall
  182. * @rcall: response &p9_fcall
  183. * @wqueue: wait queue that client is blocked on for this rpc
  184. *
  185. * Bug: isn't this information duplicated elsewhere like &p9_req
  186. */
  187. struct p9_mux_rpc {
  188. struct p9_conn *m;
  189. int err;
  190. struct p9_fcall *tcall;
  191. struct p9_fcall *rcall;
  192. wait_queue_head_t wqueue;
  193. };
  194. static int p9_poll_proc(void *);
  195. static void p9_read_work(struct work_struct *work);
  196. static void p9_write_work(struct work_struct *work);
  197. static void p9_pollwait(struct file *filp, wait_queue_head_t *wait_address,
  198. poll_table *p);
  199. static int p9_fd_write(struct p9_trans *trans, void *v, int len);
  200. static int p9_fd_read(struct p9_trans *trans, void *v, int len);
  201. static DEFINE_MUTEX(p9_mux_task_lock);
  202. static struct workqueue_struct *p9_mux_wq;
  203. static int p9_mux_num;
  204. static int p9_mux_poll_task_num;
  205. static struct p9_mux_poll_task p9_mux_poll_tasks[100];
  206. static void p9_conn_destroy(struct p9_conn *);
  207. static unsigned int p9_fd_poll(struct p9_trans *trans,
  208. struct poll_table_struct *pt);
  209. #ifdef P9_NONBLOCK
  210. static int p9_conn_rpcnb(struct p9_conn *m, struct p9_fcall *tc,
  211. p9_conn_req_callback cb, void *a);
  212. #endif /* P9_NONBLOCK */
  213. static void p9_conn_cancel(struct p9_conn *m, int err);
  214. static u16 p9_mux_get_tag(struct p9_conn *m)
  215. {
  216. int tag;
  217. tag = p9_idpool_get(m->tagpool);
  218. if (tag < 0)
  219. return P9_NOTAG;
  220. else
  221. return (u16) tag;
  222. }
  223. static void p9_mux_put_tag(struct p9_conn *m, u16 tag)
  224. {
  225. if (tag != P9_NOTAG && p9_idpool_check(tag, m->tagpool))
  226. p9_idpool_put(tag, m->tagpool);
  227. }
  228. /**
  229. * p9_mux_calc_poll_procs - calculates the number of polling procs
  230. * @muxnum: number of mounts
  231. *
  232. * Calculation is based on the number of mounted v9fs filesystems.
  233. * The current implementation returns sqrt of the number of mounts.
  234. */
  235. static int p9_mux_calc_poll_procs(int muxnum)
  236. {
  237. int n;
  238. if (p9_mux_poll_task_num)
  239. n = muxnum / p9_mux_poll_task_num +
  240. (muxnum % p9_mux_poll_task_num ? 1 : 0);
  241. else
  242. n = 1;
  243. if (n > ARRAY_SIZE(p9_mux_poll_tasks))
  244. n = ARRAY_SIZE(p9_mux_poll_tasks);
  245. return n;
  246. }
  247. static int p9_mux_poll_start(struct p9_conn *m)
  248. {
  249. int i, n;
  250. struct p9_mux_poll_task *vpt, *vptlast;
  251. struct task_struct *pproc;
  252. P9_DPRINTK(P9_DEBUG_MUX, "mux %p muxnum %d procnum %d\n", m, p9_mux_num,
  253. p9_mux_poll_task_num);
  254. mutex_lock(&p9_mux_task_lock);
  255. n = p9_mux_calc_poll_procs(p9_mux_num + 1);
  256. if (n > p9_mux_poll_task_num) {
  257. for (i = 0; i < ARRAY_SIZE(p9_mux_poll_tasks); i++) {
  258. if (p9_mux_poll_tasks[i].task == NULL) {
  259. vpt = &p9_mux_poll_tasks[i];
  260. P9_DPRINTK(P9_DEBUG_MUX, "create proc %p\n",
  261. vpt);
  262. pproc = kthread_create(p9_poll_proc, vpt,
  263. "v9fs-poll");
  264. if (!IS_ERR(pproc)) {
  265. vpt->task = pproc;
  266. INIT_LIST_HEAD(&vpt->mux_list);
  267. vpt->muxnum = 0;
  268. p9_mux_poll_task_num++;
  269. wake_up_process(vpt->task);
  270. }
  271. break;
  272. }
  273. }
  274. if (i >= ARRAY_SIZE(p9_mux_poll_tasks))
  275. P9_DPRINTK(P9_DEBUG_ERROR,
  276. "warning: no free poll slots\n");
  277. }
  278. n = (p9_mux_num + 1) / p9_mux_poll_task_num +
  279. ((p9_mux_num + 1) % p9_mux_poll_task_num ? 1 : 0);
  280. vptlast = NULL;
  281. for (i = 0; i < ARRAY_SIZE(p9_mux_poll_tasks); i++) {
  282. vpt = &p9_mux_poll_tasks[i];
  283. if (vpt->task != NULL) {
  284. vptlast = vpt;
  285. if (vpt->muxnum < n) {
  286. P9_DPRINTK(P9_DEBUG_MUX, "put in proc %d\n", i);
  287. list_add(&m->mux_list, &vpt->mux_list);
  288. vpt->muxnum++;
  289. m->poll_task = vpt;
  290. memset(&m->poll_waddr, 0,
  291. sizeof(m->poll_waddr));
  292. init_poll_funcptr(&m->pt, p9_pollwait);
  293. break;
  294. }
  295. }
  296. }
  297. if (i >= ARRAY_SIZE(p9_mux_poll_tasks)) {
  298. if (vptlast == NULL) {
  299. mutex_unlock(&p9_mux_task_lock);
  300. return -ENOMEM;
  301. }
  302. P9_DPRINTK(P9_DEBUG_MUX, "put in proc %d\n", i);
  303. list_add(&m->mux_list, &vptlast->mux_list);
  304. vptlast->muxnum++;
  305. m->poll_task = vptlast;
  306. memset(&m->poll_waddr, 0, sizeof(m->poll_waddr));
  307. init_poll_funcptr(&m->pt, p9_pollwait);
  308. }
  309. p9_mux_num++;
  310. mutex_unlock(&p9_mux_task_lock);
  311. return 0;
  312. }
  313. static void p9_mux_poll_stop(struct p9_conn *m)
  314. {
  315. int i;
  316. struct p9_mux_poll_task *vpt;
  317. mutex_lock(&p9_mux_task_lock);
  318. vpt = m->poll_task;
  319. list_del(&m->mux_list);
  320. for (i = 0; i < ARRAY_SIZE(m->poll_waddr); i++) {
  321. if (m->poll_waddr[i] != NULL) {
  322. remove_wait_queue(m->poll_waddr[i], &m->poll_wait[i]);
  323. m->poll_waddr[i] = NULL;
  324. }
  325. }
  326. vpt->muxnum--;
  327. if (!vpt->muxnum) {
  328. P9_DPRINTK(P9_DEBUG_MUX, "destroy proc %p\n", vpt);
  329. kthread_stop(vpt->task);
  330. vpt->task = NULL;
  331. p9_mux_poll_task_num--;
  332. }
  333. p9_mux_num--;
  334. mutex_unlock(&p9_mux_task_lock);
  335. }
  336. /**
  337. * p9_conn_create - allocate and initialize the per-session mux data
  338. * @trans: transport structure
  339. *
  340. * Note: Creates the polling task if this is the first session.
  341. */
  342. static struct p9_conn *p9_conn_create(struct p9_trans *trans)
  343. {
  344. int i, n;
  345. struct p9_conn *m;
  346. P9_DPRINTK(P9_DEBUG_MUX, "transport %p msize %d\n", trans,
  347. trans->msize);
  348. m = kzalloc(sizeof(struct p9_conn), GFP_KERNEL);
  349. if (!m)
  350. return ERR_PTR(-ENOMEM);
  351. spin_lock_init(&m->lock);
  352. INIT_LIST_HEAD(&m->mux_list);
  353. m->msize = trans->msize;
  354. m->extended = trans->extended;
  355. m->trans = trans;
  356. m->tagpool = p9_idpool_create();
  357. if (IS_ERR(m->tagpool)) {
  358. kfree(m);
  359. return ERR_PTR(-ENOMEM);
  360. }
  361. INIT_LIST_HEAD(&m->req_list);
  362. INIT_LIST_HEAD(&m->unsent_req_list);
  363. INIT_WORK(&m->rq, p9_read_work);
  364. INIT_WORK(&m->wq, p9_write_work);
  365. n = p9_mux_poll_start(m);
  366. if (n) {
  367. kfree(m);
  368. return ERR_PTR(n);
  369. }
  370. n = p9_fd_poll(trans, &m->pt);
  371. if (n & POLLIN) {
  372. P9_DPRINTK(P9_DEBUG_MUX, "mux %p can read\n", m);
  373. set_bit(Rpending, &m->wsched);
  374. }
  375. if (n & POLLOUT) {
  376. P9_DPRINTK(P9_DEBUG_MUX, "mux %p can write\n", m);
  377. set_bit(Wpending, &m->wsched);
  378. }
  379. for (i = 0; i < ARRAY_SIZE(m->poll_waddr); i++) {
  380. if (IS_ERR(m->poll_waddr[i])) {
  381. p9_mux_poll_stop(m);
  382. kfree(m);
  383. return (void *)m->poll_waddr; /* the error code */
  384. }
  385. }
  386. return m;
  387. }
  388. /**
  389. * p9_mux_destroy - cancels all pending requests and frees mux resources
  390. * @m: mux to destroy
  391. *
  392. */
  393. static void p9_conn_destroy(struct p9_conn *m)
  394. {
  395. P9_DPRINTK(P9_DEBUG_MUX, "mux %p prev %p next %p\n", m,
  396. m->mux_list.prev, m->mux_list.next);
  397. p9_mux_poll_stop(m);
  398. cancel_work_sync(&m->rq);
  399. cancel_work_sync(&m->wq);
  400. p9_conn_cancel(m, -ECONNRESET);
  401. m->trans = NULL;
  402. p9_idpool_destroy(m->tagpool);
  403. kfree(m);
  404. }
  405. /**
  406. * p9_pollwait - add poll task to the wait queue
  407. * @filp: file pointer being polled
  408. * @wait_address: wait_q to block on
  409. * @p: poll state
  410. *
  411. * called by files poll operation to add v9fs-poll task to files wait queue
  412. */
  413. static void
  414. p9_pollwait(struct file *filp, wait_queue_head_t *wait_address, poll_table *p)
  415. {
  416. int i;
  417. struct p9_conn *m;
  418. m = container_of(p, struct p9_conn, pt);
  419. for (i = 0; i < ARRAY_SIZE(m->poll_waddr); i++)
  420. if (m->poll_waddr[i] == NULL)
  421. break;
  422. if (i >= ARRAY_SIZE(m->poll_waddr)) {
  423. P9_DPRINTK(P9_DEBUG_ERROR, "not enough wait_address slots\n");
  424. return;
  425. }
  426. m->poll_waddr[i] = wait_address;
  427. if (!wait_address) {
  428. P9_DPRINTK(P9_DEBUG_ERROR, "no wait_address\n");
  429. m->poll_waddr[i] = ERR_PTR(-EIO);
  430. return;
  431. }
  432. init_waitqueue_entry(&m->poll_wait[i], m->poll_task->task);
  433. add_wait_queue(wait_address, &m->poll_wait[i]);
  434. }
  435. /**
  436. * p9_poll_mux - polls a mux and schedules read or write works if necessary
  437. * @m: connection to poll
  438. *
  439. */
  440. static void p9_poll_mux(struct p9_conn *m)
  441. {
  442. int n;
  443. if (m->err < 0)
  444. return;
  445. n = p9_fd_poll(m->trans, NULL);
  446. if (n < 0 || n & (POLLERR | POLLHUP | POLLNVAL)) {
  447. P9_DPRINTK(P9_DEBUG_MUX, "error mux %p err %d\n", m, n);
  448. if (n >= 0)
  449. n = -ECONNRESET;
  450. p9_conn_cancel(m, n);
  451. }
  452. if (n & POLLIN) {
  453. set_bit(Rpending, &m->wsched);
  454. P9_DPRINTK(P9_DEBUG_MUX, "mux %p can read\n", m);
  455. if (!test_and_set_bit(Rworksched, &m->wsched)) {
  456. P9_DPRINTK(P9_DEBUG_MUX, "schedule read work %p\n", m);
  457. queue_work(p9_mux_wq, &m->rq);
  458. }
  459. }
  460. if (n & POLLOUT) {
  461. set_bit(Wpending, &m->wsched);
  462. P9_DPRINTK(P9_DEBUG_MUX, "mux %p can write\n", m);
  463. if ((m->wsize || !list_empty(&m->unsent_req_list))
  464. && !test_and_set_bit(Wworksched, &m->wsched)) {
  465. P9_DPRINTK(P9_DEBUG_MUX, "schedule write work %p\n", m);
  466. queue_work(p9_mux_wq, &m->wq);
  467. }
  468. }
  469. }
  470. /**
  471. * p9_poll_proc - poll worker thread
  472. * @a: thread state and arguments
  473. *
  474. * polls all v9fs transports for new events and queues the appropriate
  475. * work to the work queue
  476. *
  477. */
  478. static int p9_poll_proc(void *a)
  479. {
  480. struct p9_conn *m, *mtmp;
  481. struct p9_mux_poll_task *vpt;
  482. vpt = a;
  483. P9_DPRINTK(P9_DEBUG_MUX, "start %p %p\n", current, vpt);
  484. while (!kthread_should_stop()) {
  485. set_current_state(TASK_INTERRUPTIBLE);
  486. list_for_each_entry_safe(m, mtmp, &vpt->mux_list, mux_list) {
  487. p9_poll_mux(m);
  488. }
  489. P9_DPRINTK(P9_DEBUG_MUX, "sleeping...\n");
  490. schedule_timeout(SCHED_TIMEOUT * HZ);
  491. }
  492. __set_current_state(TASK_RUNNING);
  493. P9_DPRINTK(P9_DEBUG_MUX, "finish\n");
  494. return 0;
  495. }
  496. /**
  497. * p9_write_work - called when a transport can send some data
  498. * @work: container for work to be done
  499. *
  500. */
  501. static void p9_write_work(struct work_struct *work)
  502. {
  503. int n, err;
  504. struct p9_conn *m;
  505. struct p9_req *req;
  506. m = container_of(work, struct p9_conn, wq);
  507. if (m->err < 0) {
  508. clear_bit(Wworksched, &m->wsched);
  509. return;
  510. }
  511. if (!m->wsize) {
  512. if (list_empty(&m->unsent_req_list)) {
  513. clear_bit(Wworksched, &m->wsched);
  514. return;
  515. }
  516. spin_lock(&m->lock);
  517. again:
  518. req = list_entry(m->unsent_req_list.next, struct p9_req,
  519. req_list);
  520. list_move_tail(&req->req_list, &m->req_list);
  521. if (req->err == ERREQFLUSH)
  522. goto again;
  523. m->wbuf = req->tcall->sdata;
  524. m->wsize = req->tcall->size;
  525. m->wpos = 0;
  526. spin_unlock(&m->lock);
  527. }
  528. P9_DPRINTK(P9_DEBUG_MUX, "mux %p pos %d size %d\n", m, m->wpos,
  529. m->wsize);
  530. clear_bit(Wpending, &m->wsched);
  531. err = p9_fd_write(m->trans, m->wbuf + m->wpos, m->wsize - m->wpos);
  532. P9_DPRINTK(P9_DEBUG_MUX, "mux %p sent %d bytes\n", m, err);
  533. if (err == -EAGAIN) {
  534. clear_bit(Wworksched, &m->wsched);
  535. return;
  536. }
  537. if (err < 0)
  538. goto error;
  539. else if (err == 0) {
  540. err = -EREMOTEIO;
  541. goto error;
  542. }
  543. m->wpos += err;
  544. if (m->wpos == m->wsize)
  545. m->wpos = m->wsize = 0;
  546. if (m->wsize == 0 && !list_empty(&m->unsent_req_list)) {
  547. if (test_and_clear_bit(Wpending, &m->wsched))
  548. n = POLLOUT;
  549. else
  550. n = p9_fd_poll(m->trans, NULL);
  551. if (n & POLLOUT) {
  552. P9_DPRINTK(P9_DEBUG_MUX, "schedule write work %p\n", m);
  553. queue_work(p9_mux_wq, &m->wq);
  554. } else
  555. clear_bit(Wworksched, &m->wsched);
  556. } else
  557. clear_bit(Wworksched, &m->wsched);
  558. return;
  559. error:
  560. p9_conn_cancel(m, err);
  561. clear_bit(Wworksched, &m->wsched);
  562. }
  563. static void process_request(struct p9_conn *m, struct p9_req *req)
  564. {
  565. int ecode;
  566. struct p9_str *ename;
  567. if (!req->err && req->rcall->id == P9_RERROR) {
  568. ecode = req->rcall->params.rerror.errno;
  569. ename = &req->rcall->params.rerror.error;
  570. P9_DPRINTK(P9_DEBUG_MUX, "Rerror %.*s\n", ename->len,
  571. ename->str);
  572. if (m->extended)
  573. req->err = -ecode;
  574. if (!req->err) {
  575. req->err = p9_errstr2errno(ename->str, ename->len);
  576. /* string match failed */
  577. if (!req->err) {
  578. PRINT_FCALL_ERROR("unknown error", req->rcall);
  579. req->err = -ESERVERFAULT;
  580. }
  581. }
  582. } else if (req->tcall && req->rcall->id != req->tcall->id + 1) {
  583. P9_DPRINTK(P9_DEBUG_ERROR,
  584. "fcall mismatch: expected %d, got %d\n",
  585. req->tcall->id + 1, req->rcall->id);
  586. if (!req->err)
  587. req->err = -EIO;
  588. }
  589. }
  590. /**
  591. * p9_read_work - called when there is some data to be read from a transport
  592. * @work: container of work to be done
  593. *
  594. */
  595. static void p9_read_work(struct work_struct *work)
  596. {
  597. int n, err;
  598. struct p9_conn *m;
  599. struct p9_req *req, *rptr, *rreq;
  600. struct p9_fcall *rcall;
  601. char *rbuf;
  602. m = container_of(work, struct p9_conn, rq);
  603. if (m->err < 0)
  604. return;
  605. rcall = NULL;
  606. P9_DPRINTK(P9_DEBUG_MUX, "start mux %p pos %d\n", m, m->rpos);
  607. if (!m->rcall) {
  608. m->rcall =
  609. kmalloc(sizeof(struct p9_fcall) + m->msize, GFP_KERNEL);
  610. if (!m->rcall) {
  611. err = -ENOMEM;
  612. goto error;
  613. }
  614. m->rbuf = (char *)m->rcall + sizeof(struct p9_fcall);
  615. m->rpos = 0;
  616. }
  617. clear_bit(Rpending, &m->wsched);
  618. err = p9_fd_read(m->trans, m->rbuf + m->rpos, m->msize - m->rpos);
  619. P9_DPRINTK(P9_DEBUG_MUX, "mux %p got %d bytes\n", m, err);
  620. if (err == -EAGAIN) {
  621. clear_bit(Rworksched, &m->wsched);
  622. return;
  623. }
  624. if (err <= 0)
  625. goto error;
  626. m->rpos += err;
  627. while (m->rpos > 4) {
  628. n = le32_to_cpu(*(__le32 *) m->rbuf);
  629. if (n >= m->msize) {
  630. P9_DPRINTK(P9_DEBUG_ERROR,
  631. "requested packet size too big: %d\n", n);
  632. err = -EIO;
  633. goto error;
  634. }
  635. if (m->rpos < n)
  636. break;
  637. err =
  638. p9_deserialize_fcall(m->rbuf, n, m->rcall, m->extended);
  639. if (err < 0)
  640. goto error;
  641. #ifdef CONFIG_NET_9P_DEBUG
  642. if ((p9_debug_level&P9_DEBUG_FCALL) == P9_DEBUG_FCALL) {
  643. char buf[150];
  644. p9_printfcall(buf, sizeof(buf), m->rcall,
  645. m->extended);
  646. printk(KERN_NOTICE ">>> %p %s\n", m, buf);
  647. }
  648. #endif
  649. rcall = m->rcall;
  650. rbuf = m->rbuf;
  651. if (m->rpos > n) {
  652. m->rcall = kmalloc(sizeof(struct p9_fcall) + m->msize,
  653. GFP_KERNEL);
  654. if (!m->rcall) {
  655. err = -ENOMEM;
  656. goto error;
  657. }
  658. m->rbuf = (char *)m->rcall + sizeof(struct p9_fcall);
  659. memmove(m->rbuf, rbuf + n, m->rpos - n);
  660. m->rpos -= n;
  661. } else {
  662. m->rcall = NULL;
  663. m->rbuf = NULL;
  664. m->rpos = 0;
  665. }
  666. P9_DPRINTK(P9_DEBUG_MUX, "mux %p fcall id %d tag %d\n", m,
  667. rcall->id, rcall->tag);
  668. req = NULL;
  669. spin_lock(&m->lock);
  670. list_for_each_entry_safe(rreq, rptr, &m->req_list, req_list) {
  671. if (rreq->tag == rcall->tag) {
  672. req = rreq;
  673. if (req->flush != Flushing)
  674. list_del(&req->req_list);
  675. break;
  676. }
  677. }
  678. spin_unlock(&m->lock);
  679. if (req) {
  680. req->rcall = rcall;
  681. process_request(m, req);
  682. if (req->flush != Flushing) {
  683. if (req->cb)
  684. (*req->cb) (req, req->cba);
  685. else
  686. kfree(req->rcall);
  687. }
  688. } else {
  689. if (err >= 0 && rcall->id != P9_RFLUSH)
  690. P9_DPRINTK(P9_DEBUG_ERROR,
  691. "unexpected response mux %p id %d tag %d\n",
  692. m, rcall->id, rcall->tag);
  693. kfree(rcall);
  694. }
  695. }
  696. if (!list_empty(&m->req_list)) {
  697. if (test_and_clear_bit(Rpending, &m->wsched))
  698. n = POLLIN;
  699. else
  700. n = p9_fd_poll(m->trans, NULL);
  701. if (n & POLLIN) {
  702. P9_DPRINTK(P9_DEBUG_MUX, "schedule read work %p\n", m);
  703. queue_work(p9_mux_wq, &m->rq);
  704. } else
  705. clear_bit(Rworksched, &m->wsched);
  706. } else
  707. clear_bit(Rworksched, &m->wsched);
  708. return;
  709. error:
  710. p9_conn_cancel(m, err);
  711. clear_bit(Rworksched, &m->wsched);
  712. }
  713. /**
  714. * p9_send_request - send 9P request
  715. * The function can sleep until the request is scheduled for sending.
  716. * The function can be interrupted. Return from the function is not
  717. * a guarantee that the request is sent successfully. Can return errors
  718. * that can be retrieved by PTR_ERR macros.
  719. *
  720. * @m: mux data
  721. * @tc: request to be sent
  722. * @cb: callback function to call when response is received
  723. * @cba: parameter to pass to the callback function
  724. *
  725. */
  726. static struct p9_req *p9_send_request(struct p9_conn *m,
  727. struct p9_fcall *tc,
  728. p9_conn_req_callback cb, void *cba)
  729. {
  730. int n;
  731. struct p9_req *req;
  732. P9_DPRINTK(P9_DEBUG_MUX, "mux %p task %p tcall %p id %d\n", m, current,
  733. tc, tc->id);
  734. if (m->err < 0)
  735. return ERR_PTR(m->err);
  736. req = kmalloc(sizeof(struct p9_req), GFP_KERNEL);
  737. if (!req)
  738. return ERR_PTR(-ENOMEM);
  739. if (tc->id == P9_TVERSION)
  740. n = P9_NOTAG;
  741. else
  742. n = p9_mux_get_tag(m);
  743. if (n < 0) {
  744. kfree(req);
  745. return ERR_PTR(-ENOMEM);
  746. }
  747. p9_set_tag(tc, n);
  748. #ifdef CONFIG_NET_9P_DEBUG
  749. if ((p9_debug_level&P9_DEBUG_FCALL) == P9_DEBUG_FCALL) {
  750. char buf[150];
  751. p9_printfcall(buf, sizeof(buf), tc, m->extended);
  752. printk(KERN_NOTICE "<<< %p %s\n", m, buf);
  753. }
  754. #endif
  755. spin_lock_init(&req->lock);
  756. req->tag = n;
  757. req->tcall = tc;
  758. req->rcall = NULL;
  759. req->err = 0;
  760. req->cb = cb;
  761. req->cba = cba;
  762. req->flush = None;
  763. spin_lock(&m->lock);
  764. list_add_tail(&req->req_list, &m->unsent_req_list);
  765. spin_unlock(&m->lock);
  766. if (test_and_clear_bit(Wpending, &m->wsched))
  767. n = POLLOUT;
  768. else
  769. n = p9_fd_poll(m->trans, NULL);
  770. if (n & POLLOUT && !test_and_set_bit(Wworksched, &m->wsched))
  771. queue_work(p9_mux_wq, &m->wq);
  772. return req;
  773. }
  774. static void p9_mux_free_request(struct p9_conn *m, struct p9_req *req)
  775. {
  776. p9_mux_put_tag(m, req->tag);
  777. kfree(req);
  778. }
  779. static void p9_mux_flush_cb(struct p9_req *freq, void *a)
  780. {
  781. int tag;
  782. struct p9_conn *m;
  783. struct p9_req *req, *rreq, *rptr;
  784. m = a;
  785. P9_DPRINTK(P9_DEBUG_MUX, "mux %p tc %p rc %p err %d oldtag %d\n", m,
  786. freq->tcall, freq->rcall, freq->err,
  787. freq->tcall->params.tflush.oldtag);
  788. spin_lock(&m->lock);
  789. tag = freq->tcall->params.tflush.oldtag;
  790. req = NULL;
  791. list_for_each_entry_safe(rreq, rptr, &m->req_list, req_list) {
  792. if (rreq->tag == tag) {
  793. req = rreq;
  794. list_del(&req->req_list);
  795. break;
  796. }
  797. }
  798. spin_unlock(&m->lock);
  799. if (req) {
  800. spin_lock(&req->lock);
  801. req->flush = Flushed;
  802. spin_unlock(&req->lock);
  803. if (req->cb)
  804. (*req->cb) (req, req->cba);
  805. else
  806. kfree(req->rcall);
  807. }
  808. kfree(freq->tcall);
  809. kfree(freq->rcall);
  810. p9_mux_free_request(m, freq);
  811. }
  812. static int
  813. p9_mux_flush_request(struct p9_conn *m, struct p9_req *req)
  814. {
  815. struct p9_fcall *fc;
  816. struct p9_req *rreq, *rptr;
  817. P9_DPRINTK(P9_DEBUG_MUX, "mux %p req %p tag %d\n", m, req, req->tag);
  818. /* if a response was received for a request, do nothing */
  819. spin_lock(&req->lock);
  820. if (req->rcall || req->err) {
  821. spin_unlock(&req->lock);
  822. P9_DPRINTK(P9_DEBUG_MUX,
  823. "mux %p req %p response already received\n", m, req);
  824. return 0;
  825. }
  826. req->flush = Flushing;
  827. spin_unlock(&req->lock);
  828. spin_lock(&m->lock);
  829. /* if the request is not sent yet, just remove it from the list */
  830. list_for_each_entry_safe(rreq, rptr, &m->unsent_req_list, req_list) {
  831. if (rreq->tag == req->tag) {
  832. P9_DPRINTK(P9_DEBUG_MUX,
  833. "mux %p req %p request is not sent yet\n", m, req);
  834. list_del(&rreq->req_list);
  835. req->flush = Flushed;
  836. spin_unlock(&m->lock);
  837. if (req->cb)
  838. (*req->cb) (req, req->cba);
  839. return 0;
  840. }
  841. }
  842. spin_unlock(&m->lock);
  843. clear_thread_flag(TIF_SIGPENDING);
  844. fc = p9_create_tflush(req->tag);
  845. p9_send_request(m, fc, p9_mux_flush_cb, m);
  846. return 1;
  847. }
  848. static void
  849. p9_conn_rpc_cb(struct p9_req *req, void *a)
  850. {
  851. struct p9_mux_rpc *r;
  852. P9_DPRINTK(P9_DEBUG_MUX, "req %p r %p\n", req, a);
  853. r = a;
  854. r->rcall = req->rcall;
  855. r->err = req->err;
  856. if (req->flush != None && !req->err)
  857. r->err = -ERESTARTSYS;
  858. wake_up(&r->wqueue);
  859. }
  860. /**
  861. * p9_fd_rpc- sends 9P request and waits until a response is available.
  862. * The function can be interrupted.
  863. * @t: transport data
  864. * @tc: request to be sent
  865. * @rc: pointer where a pointer to the response is stored
  866. *
  867. */
  868. int
  869. p9_fd_rpc(struct p9_trans *t, struct p9_fcall *tc, struct p9_fcall **rc)
  870. {
  871. struct p9_trans_fd *p = t->priv;
  872. struct p9_conn *m = p->conn;
  873. int err, sigpending;
  874. unsigned long flags;
  875. struct p9_req *req;
  876. struct p9_mux_rpc r;
  877. r.err = 0;
  878. r.tcall = tc;
  879. r.rcall = NULL;
  880. r.m = m;
  881. init_waitqueue_head(&r.wqueue);
  882. if (rc)
  883. *rc = NULL;
  884. sigpending = 0;
  885. if (signal_pending(current)) {
  886. sigpending = 1;
  887. clear_thread_flag(TIF_SIGPENDING);
  888. }
  889. req = p9_send_request(m, tc, p9_conn_rpc_cb, &r);
  890. if (IS_ERR(req)) {
  891. err = PTR_ERR(req);
  892. P9_DPRINTK(P9_DEBUG_MUX, "error %d\n", err);
  893. return err;
  894. }
  895. err = wait_event_interruptible(r.wqueue, r.rcall != NULL || r.err < 0);
  896. if (r.err < 0)
  897. err = r.err;
  898. if (err == -ERESTARTSYS && m->trans->status == Connected
  899. && m->err == 0) {
  900. if (p9_mux_flush_request(m, req)) {
  901. /* wait until we get response of the flush message */
  902. do {
  903. clear_thread_flag(TIF_SIGPENDING);
  904. err = wait_event_interruptible(r.wqueue,
  905. r.rcall || r.err);
  906. } while (!r.rcall && !r.err && err == -ERESTARTSYS &&
  907. m->trans->status == Connected && !m->err);
  908. err = -ERESTARTSYS;
  909. }
  910. sigpending = 1;
  911. }
  912. if (sigpending) {
  913. spin_lock_irqsave(&current->sighand->siglock, flags);
  914. recalc_sigpending();
  915. spin_unlock_irqrestore(&current->sighand->siglock, flags);
  916. }
  917. if (rc)
  918. *rc = r.rcall;
  919. else
  920. kfree(r.rcall);
  921. p9_mux_free_request(m, req);
  922. if (err > 0)
  923. err = -EIO;
  924. return err;
  925. }
  926. #ifdef P9_NONBLOCK
  927. /**
  928. * p9_conn_rpcnb - sends 9P request without waiting for response.
  929. * @m: mux data
  930. * @tc: request to be sent
  931. * @cb: callback function to be called when response arrives
  932. * @a: value to pass to the callback function
  933. *
  934. */
  935. int p9_conn_rpcnb(struct p9_conn *m, struct p9_fcall *tc,
  936. p9_conn_req_callback cb, void *a)
  937. {
  938. int err;
  939. struct p9_req *req;
  940. req = p9_send_request(m, tc, cb, a);
  941. if (IS_ERR(req)) {
  942. err = PTR_ERR(req);
  943. P9_DPRINTK(P9_DEBUG_MUX, "error %d\n", err);
  944. return PTR_ERR(req);
  945. }
  946. P9_DPRINTK(P9_DEBUG_MUX, "mux %p tc %p tag %d\n", m, tc, req->tag);
  947. return 0;
  948. }
  949. #endif /* P9_NONBLOCK */
  950. /**
  951. * p9_conn_cancel - cancel all pending requests with error
  952. * @m: mux data
  953. * @err: error code
  954. *
  955. */
  956. void p9_conn_cancel(struct p9_conn *m, int err)
  957. {
  958. struct p9_req *req, *rtmp;
  959. LIST_HEAD(cancel_list);
  960. P9_DPRINTK(P9_DEBUG_ERROR, "mux %p err %d\n", m, err);
  961. m->err = err;
  962. spin_lock(&m->lock);
  963. list_for_each_entry_safe(req, rtmp, &m->req_list, req_list) {
  964. list_move(&req->req_list, &cancel_list);
  965. }
  966. list_for_each_entry_safe(req, rtmp, &m->unsent_req_list, req_list) {
  967. list_move(&req->req_list, &cancel_list);
  968. }
  969. spin_unlock(&m->lock);
  970. list_for_each_entry_safe(req, rtmp, &cancel_list, req_list) {
  971. list_del(&req->req_list);
  972. if (!req->err)
  973. req->err = err;
  974. if (req->cb)
  975. (*req->cb) (req, req->cba);
  976. else
  977. kfree(req->rcall);
  978. }
  979. }
  980. /**
  981. * parse_options - parse mount options into session structure
  982. * @options: options string passed from mount
  983. * @opts: transport-specific structure to parse options into
  984. *
  985. * Returns 0 upon success, -ERRNO upon failure
  986. */
  987. static int parse_opts(char *params, struct p9_fd_opts *opts)
  988. {
  989. char *p;
  990. substring_t args[MAX_OPT_ARGS];
  991. int option;
  992. char *options;
  993. int ret;
  994. opts->port = P9_PORT;
  995. opts->rfd = ~0;
  996. opts->wfd = ~0;
  997. if (!params)
  998. return 0;
  999. options = kstrdup(params, GFP_KERNEL);
  1000. if (!options) {
  1001. P9_DPRINTK(P9_DEBUG_ERROR,
  1002. "failed to allocate copy of option string\n");
  1003. return -ENOMEM;
  1004. }
  1005. while ((p = strsep(&options, ",")) != NULL) {
  1006. int token;
  1007. int r;
  1008. if (!*p)
  1009. continue;
  1010. token = match_token(p, tokens, args);
  1011. r = match_int(&args[0], &option);
  1012. if (r < 0) {
  1013. P9_DPRINTK(P9_DEBUG_ERROR,
  1014. "integer field, but no integer?\n");
  1015. ret = r;
  1016. continue;
  1017. }
  1018. switch (token) {
  1019. case Opt_port:
  1020. opts->port = option;
  1021. break;
  1022. case Opt_rfdno:
  1023. opts->rfd = option;
  1024. break;
  1025. case Opt_wfdno:
  1026. opts->wfd = option;
  1027. break;
  1028. default:
  1029. continue;
  1030. }
  1031. }
  1032. kfree(options);
  1033. return 0;
  1034. }
  1035. static int p9_fd_open(struct p9_trans *trans, int rfd, int wfd)
  1036. {
  1037. struct p9_trans_fd *ts = kmalloc(sizeof(struct p9_trans_fd),
  1038. GFP_KERNEL);
  1039. if (!ts)
  1040. return -ENOMEM;
  1041. ts->rd = fget(rfd);
  1042. ts->wr = fget(wfd);
  1043. if (!ts->rd || !ts->wr) {
  1044. if (ts->rd)
  1045. fput(ts->rd);
  1046. if (ts->wr)
  1047. fput(ts->wr);
  1048. kfree(ts);
  1049. return -EIO;
  1050. }
  1051. trans->priv = ts;
  1052. trans->status = Connected;
  1053. return 0;
  1054. }
  1055. static int p9_socket_open(struct p9_trans *trans, struct socket *csocket)
  1056. {
  1057. int fd, ret;
  1058. csocket->sk->sk_allocation = GFP_NOIO;
  1059. fd = sock_map_fd(csocket, 0);
  1060. if (fd < 0) {
  1061. P9_EPRINTK(KERN_ERR, "p9_socket_open: failed to map fd\n");
  1062. return fd;
  1063. }
  1064. ret = p9_fd_open(trans, fd, fd);
  1065. if (ret < 0) {
  1066. P9_EPRINTK(KERN_ERR, "p9_socket_open: failed to open fd\n");
  1067. sockfd_put(csocket);
  1068. return ret;
  1069. }
  1070. ((struct p9_trans_fd *)trans->priv)->rd->f_flags |= O_NONBLOCK;
  1071. return 0;
  1072. }
  1073. /**
  1074. * p9_fd_read- read from a fd
  1075. * @trans: transport instance state
  1076. * @v: buffer to receive data into
  1077. * @len: size of receive buffer
  1078. *
  1079. */
  1080. static int p9_fd_read(struct p9_trans *trans, void *v, int len)
  1081. {
  1082. int ret;
  1083. struct p9_trans_fd *ts = NULL;
  1084. if (trans && trans->status != Disconnected)
  1085. ts = trans->priv;
  1086. if (!ts)
  1087. return -EREMOTEIO;
  1088. if (!(ts->rd->f_flags & O_NONBLOCK))
  1089. P9_DPRINTK(P9_DEBUG_ERROR, "blocking read ...\n");
  1090. ret = kernel_read(ts->rd, ts->rd->f_pos, v, len);
  1091. if (ret <= 0 && ret != -ERESTARTSYS && ret != -EAGAIN)
  1092. trans->status = Disconnected;
  1093. return ret;
  1094. }
  1095. /**
  1096. * p9_fd_write - write to a socket
  1097. * @trans: transport instance state
  1098. * @v: buffer to send data from
  1099. * @len: size of send buffer
  1100. *
  1101. */
  1102. static int p9_fd_write(struct p9_trans *trans, void *v, int len)
  1103. {
  1104. int ret;
  1105. mm_segment_t oldfs;
  1106. struct p9_trans_fd *ts = NULL;
  1107. if (trans && trans->status != Disconnected)
  1108. ts = trans->priv;
  1109. if (!ts)
  1110. return -EREMOTEIO;
  1111. if (!(ts->wr->f_flags & O_NONBLOCK))
  1112. P9_DPRINTK(P9_DEBUG_ERROR, "blocking write ...\n");
  1113. oldfs = get_fs();
  1114. set_fs(get_ds());
  1115. /* The cast to a user pointer is valid due to the set_fs() */
  1116. ret = vfs_write(ts->wr, (void __user *)v, len, &ts->wr->f_pos);
  1117. set_fs(oldfs);
  1118. if (ret <= 0 && ret != -ERESTARTSYS && ret != -EAGAIN)
  1119. trans->status = Disconnected;
  1120. return ret;
  1121. }
  1122. static unsigned int
  1123. p9_fd_poll(struct p9_trans *trans, struct poll_table_struct *pt)
  1124. {
  1125. int ret, n;
  1126. struct p9_trans_fd *ts = NULL;
  1127. if (trans && trans->status == Connected)
  1128. ts = trans->priv;
  1129. if (!ts)
  1130. return -EREMOTEIO;
  1131. if (!ts->rd->f_op || !ts->rd->f_op->poll)
  1132. return -EIO;
  1133. if (!ts->wr->f_op || !ts->wr->f_op->poll)
  1134. return -EIO;
  1135. ret = ts->rd->f_op->poll(ts->rd, pt);
  1136. if (ret < 0)
  1137. return ret;
  1138. if (ts->rd != ts->wr) {
  1139. n = ts->wr->f_op->poll(ts->wr, pt);
  1140. if (n < 0)
  1141. return n;
  1142. ret = (ret & ~POLLOUT) | (n & ~POLLIN);
  1143. }
  1144. return ret;
  1145. }
  1146. /**
  1147. * p9_fd_close - shutdown socket
  1148. * @trans: private socket structure
  1149. *
  1150. */
  1151. static void p9_fd_close(struct p9_trans *trans)
  1152. {
  1153. struct p9_trans_fd *ts;
  1154. if (!trans)
  1155. return;
  1156. ts = xchg(&trans->priv, NULL);
  1157. if (!ts)
  1158. return;
  1159. p9_conn_destroy(ts->conn);
  1160. trans->status = Disconnected;
  1161. if (ts->rd)
  1162. fput(ts->rd);
  1163. if (ts->wr)
  1164. fput(ts->wr);
  1165. kfree(ts);
  1166. }
  1167. /*
  1168. * stolen from NFS - maybe should be made a generic function?
  1169. */
  1170. static inline int valid_ipaddr4(const char *buf)
  1171. {
  1172. int rc, count, in[4];
  1173. rc = sscanf(buf, "%d.%d.%d.%d", &in[0], &in[1], &in[2], &in[3]);
  1174. if (rc != 4)
  1175. return -EINVAL;
  1176. for (count = 0; count < 4; count++) {
  1177. if (in[count] > 255)
  1178. return -EINVAL;
  1179. }
  1180. return 0;
  1181. }
  1182. static struct p9_trans *
  1183. p9_trans_create_tcp(const char *addr, char *args, int msize, unsigned char dotu)
  1184. {
  1185. int err;
  1186. struct p9_trans *trans;
  1187. struct socket *csocket;
  1188. struct sockaddr_in sin_server;
  1189. struct p9_fd_opts opts;
  1190. struct p9_trans_fd *p;
  1191. err = parse_opts(args, &opts);
  1192. if (err < 0)
  1193. return ERR_PTR(err);
  1194. if (valid_ipaddr4(addr) < 0)
  1195. return ERR_PTR(-EINVAL);
  1196. csocket = NULL;
  1197. trans = kmalloc(sizeof(struct p9_trans), GFP_KERNEL);
  1198. if (!trans)
  1199. return ERR_PTR(-ENOMEM);
  1200. trans->msize = msize;
  1201. trans->extended = dotu;
  1202. trans->rpc = p9_fd_rpc;
  1203. trans->close = p9_fd_close;
  1204. sin_server.sin_family = AF_INET;
  1205. sin_server.sin_addr.s_addr = in_aton(addr);
  1206. sin_server.sin_port = htons(opts.port);
  1207. sock_create_kern(PF_INET, SOCK_STREAM, IPPROTO_TCP, &csocket);
  1208. if (!csocket) {
  1209. P9_EPRINTK(KERN_ERR, "p9_trans_tcp: problem creating socket\n");
  1210. err = -EIO;
  1211. goto error;
  1212. }
  1213. err = csocket->ops->connect(csocket,
  1214. (struct sockaddr *)&sin_server,
  1215. sizeof(struct sockaddr_in), 0);
  1216. if (err < 0) {
  1217. P9_EPRINTK(KERN_ERR,
  1218. "p9_trans_tcp: problem connecting socket to %s\n",
  1219. addr);
  1220. goto error;
  1221. }
  1222. err = p9_socket_open(trans, csocket);
  1223. if (err < 0)
  1224. goto error;
  1225. p = (struct p9_trans_fd *) trans->priv;
  1226. p->conn = p9_conn_create(trans);
  1227. if (IS_ERR(p->conn)) {
  1228. err = PTR_ERR(p->conn);
  1229. p->conn = NULL;
  1230. goto error;
  1231. }
  1232. return trans;
  1233. error:
  1234. if (csocket)
  1235. sock_release(csocket);
  1236. kfree(trans);
  1237. return ERR_PTR(err);
  1238. }
  1239. static struct p9_trans *
  1240. p9_trans_create_unix(const char *addr, char *args, int msize,
  1241. unsigned char dotu)
  1242. {
  1243. int err;
  1244. struct socket *csocket;
  1245. struct sockaddr_un sun_server;
  1246. struct p9_trans *trans;
  1247. struct p9_trans_fd *p;
  1248. csocket = NULL;
  1249. trans = kmalloc(sizeof(struct p9_trans), GFP_KERNEL);
  1250. if (!trans)
  1251. return ERR_PTR(-ENOMEM);
  1252. trans->rpc = p9_fd_rpc;
  1253. trans->close = p9_fd_close;
  1254. if (strlen(addr) > UNIX_PATH_MAX) {
  1255. P9_EPRINTK(KERN_ERR, "p9_trans_unix: address too long: %s\n",
  1256. addr);
  1257. err = -ENAMETOOLONG;
  1258. goto error;
  1259. }
  1260. sun_server.sun_family = PF_UNIX;
  1261. strcpy(sun_server.sun_path, addr);
  1262. sock_create_kern(PF_UNIX, SOCK_STREAM, 0, &csocket);
  1263. err = csocket->ops->connect(csocket, (struct sockaddr *)&sun_server,
  1264. sizeof(struct sockaddr_un) - 1, 0);
  1265. if (err < 0) {
  1266. P9_EPRINTK(KERN_ERR,
  1267. "p9_trans_unix: problem connecting socket: %s: %d\n",
  1268. addr, err);
  1269. goto error;
  1270. }
  1271. err = p9_socket_open(trans, csocket);
  1272. if (err < 0)
  1273. goto error;
  1274. trans->msize = msize;
  1275. trans->extended = dotu;
  1276. p = (struct p9_trans_fd *) trans->priv;
  1277. p->conn = p9_conn_create(trans);
  1278. if (IS_ERR(p->conn)) {
  1279. err = PTR_ERR(p->conn);
  1280. p->conn = NULL;
  1281. goto error;
  1282. }
  1283. return trans;
  1284. error:
  1285. if (csocket)
  1286. sock_release(csocket);
  1287. kfree(trans);
  1288. return ERR_PTR(err);
  1289. }
  1290. static struct p9_trans *
  1291. p9_trans_create_fd(const char *name, char *args, int msize,
  1292. unsigned char extended)
  1293. {
  1294. int err;
  1295. struct p9_trans *trans;
  1296. struct p9_fd_opts opts;
  1297. struct p9_trans_fd *p;
  1298. parse_opts(args, &opts);
  1299. if (opts.rfd == ~0 || opts.wfd == ~0) {
  1300. printk(KERN_ERR "v9fs: Insufficient options for proto=fd\n");
  1301. return ERR_PTR(-ENOPROTOOPT);
  1302. }
  1303. trans = kmalloc(sizeof(struct p9_trans), GFP_KERNEL);
  1304. if (!trans)
  1305. return ERR_PTR(-ENOMEM);
  1306. trans->rpc = p9_fd_rpc;
  1307. trans->close = p9_fd_close;
  1308. err = p9_fd_open(trans, opts.rfd, opts.wfd);
  1309. if (err < 0)
  1310. goto error;
  1311. trans->msize = msize;
  1312. trans->extended = extended;
  1313. p = (struct p9_trans_fd *) trans->priv;
  1314. p->conn = p9_conn_create(trans);
  1315. if (IS_ERR(p->conn)) {
  1316. err = PTR_ERR(p->conn);
  1317. p->conn = NULL;
  1318. goto error;
  1319. }
  1320. return trans;
  1321. error:
  1322. kfree(trans);
  1323. return ERR_PTR(err);
  1324. }
  1325. static struct p9_trans_module p9_tcp_trans = {
  1326. .name = "tcp",
  1327. .maxsize = MAX_SOCK_BUF,
  1328. .def = 1,
  1329. .create = p9_trans_create_tcp,
  1330. .owner = THIS_MODULE,
  1331. };
  1332. static struct p9_trans_module p9_unix_trans = {
  1333. .name = "unix",
  1334. .maxsize = MAX_SOCK_BUF,
  1335. .def = 0,
  1336. .create = p9_trans_create_unix,
  1337. .owner = THIS_MODULE,
  1338. };
  1339. static struct p9_trans_module p9_fd_trans = {
  1340. .name = "fd",
  1341. .maxsize = MAX_SOCK_BUF,
  1342. .def = 0,
  1343. .create = p9_trans_create_fd,
  1344. .owner = THIS_MODULE,
  1345. };
  1346. int p9_trans_fd_init(void)
  1347. {
  1348. int i;
  1349. for (i = 0; i < ARRAY_SIZE(p9_mux_poll_tasks); i++)
  1350. p9_mux_poll_tasks[i].task = NULL;
  1351. p9_mux_wq = create_workqueue("v9fs");
  1352. if (!p9_mux_wq) {
  1353. printk(KERN_WARNING "v9fs: mux: creating workqueue failed\n");
  1354. return -ENOMEM;
  1355. }
  1356. v9fs_register_trans(&p9_tcp_trans);
  1357. v9fs_register_trans(&p9_unix_trans);
  1358. v9fs_register_trans(&p9_fd_trans);
  1359. return 0;
  1360. }
  1361. void p9_trans_fd_exit(void)
  1362. {
  1363. v9fs_unregister_trans(&p9_tcp_trans);
  1364. v9fs_unregister_trans(&p9_unix_trans);
  1365. v9fs_unregister_trans(&p9_fd_trans);
  1366. destroy_workqueue(p9_mux_wq);
  1367. }