mux.c 23 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060
  1. /*
  2. * net/9p/mux.c
  3. *
  4. * Protocol Multiplexer
  5. *
  6. * Copyright (C) 2004 by Eric Van Hensbergen <ericvh@gmail.com>
  7. * Copyright (C) 2004-2005 by Latchesar Ionkov <lucho@ionkov.net>
  8. *
  9. * This program is free software; you can redistribute it and/or modify
  10. * it under the terms of the GNU General Public License version 2
  11. * as published by the Free Software Foundation.
  12. *
  13. * This program is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with this program; if not, write to:
  20. * Free Software Foundation
  21. * 51 Franklin Street, Fifth Floor
  22. * Boston, MA 02111-1301 USA
  23. *
  24. */
  25. #include <linux/module.h>
  26. #include <linux/errno.h>
  27. #include <linux/fs.h>
  28. #include <linux/poll.h>
  29. #include <linux/kthread.h>
  30. #include <linux/idr.h>
  31. #include <linux/mutex.h>
  32. #include <net/9p/9p.h>
  33. #include <linux/parser.h>
  34. #include <net/9p/transport.h>
  35. #include <net/9p/conn.h>
  36. #define ERREQFLUSH 1
  37. #define SCHED_TIMEOUT 10
  38. #define MAXPOLLWADDR 2
  39. enum {
  40. Rworksched = 1, /* read work scheduled or running */
  41. Rpending = 2, /* can read */
  42. Wworksched = 4, /* write work scheduled or running */
  43. Wpending = 8, /* can write */
  44. };
  45. enum {
  46. None,
  47. Flushing,
  48. Flushed,
  49. };
  50. struct p9_mux_poll_task;
  51. struct p9_req {
  52. spinlock_t lock; /* protect request structure */
  53. int tag;
  54. struct p9_fcall *tcall;
  55. struct p9_fcall *rcall;
  56. int err;
  57. p9_conn_req_callback cb;
  58. void *cba;
  59. int flush;
  60. struct list_head req_list;
  61. };
  62. struct p9_conn {
  63. spinlock_t lock; /* protect lock structure */
  64. struct list_head mux_list;
  65. struct p9_mux_poll_task *poll_task;
  66. int msize;
  67. unsigned char *extended;
  68. struct p9_trans *trans;
  69. struct p9_idpool *tagpool;
  70. int err;
  71. wait_queue_head_t equeue;
  72. struct list_head req_list;
  73. struct list_head unsent_req_list;
  74. struct p9_fcall *rcall;
  75. int rpos;
  76. char *rbuf;
  77. int wpos;
  78. int wsize;
  79. char *wbuf;
  80. wait_queue_t poll_wait[MAXPOLLWADDR];
  81. wait_queue_head_t *poll_waddr[MAXPOLLWADDR];
  82. poll_table pt;
  83. struct work_struct rq;
  84. struct work_struct wq;
  85. unsigned long wsched;
  86. };
  87. struct p9_mux_poll_task {
  88. struct task_struct *task;
  89. struct list_head mux_list;
  90. int muxnum;
  91. };
  92. struct p9_mux_rpc {
  93. struct p9_conn *m;
  94. int err;
  95. struct p9_fcall *tcall;
  96. struct p9_fcall *rcall;
  97. wait_queue_head_t wqueue;
  98. };
  99. static int p9_poll_proc(void *);
  100. static void p9_read_work(struct work_struct *work);
  101. static void p9_write_work(struct work_struct *work);
  102. static void p9_pollwait(struct file *filp, wait_queue_head_t *wait_address,
  103. poll_table * p);
  104. static u16 p9_mux_get_tag(struct p9_conn *);
  105. static void p9_mux_put_tag(struct p9_conn *, u16);
  106. static DEFINE_MUTEX(p9_mux_task_lock);
  107. static struct workqueue_struct *p9_mux_wq;
  108. static int p9_mux_num;
  109. static int p9_mux_poll_task_num;
  110. static struct p9_mux_poll_task p9_mux_poll_tasks[100];
  111. int p9_mux_global_init(void)
  112. {
  113. int i;
  114. for (i = 0; i < ARRAY_SIZE(p9_mux_poll_tasks); i++)
  115. p9_mux_poll_tasks[i].task = NULL;
  116. p9_mux_wq = create_workqueue("v9fs");
  117. if (!p9_mux_wq) {
  118. printk(KERN_WARNING "v9fs: mux: creating workqueue failed\n");
  119. return -ENOMEM;
  120. }
  121. return 0;
  122. }
  123. void p9_mux_global_exit(void)
  124. {
  125. destroy_workqueue(p9_mux_wq);
  126. }
  127. /**
  128. * p9_mux_calc_poll_procs - calculates the number of polling procs
  129. * based on the number of mounted v9fs filesystems.
  130. *
  131. * The current implementation returns sqrt of the number of mounts.
  132. */
  133. static int p9_mux_calc_poll_procs(int muxnum)
  134. {
  135. int n;
  136. if (p9_mux_poll_task_num)
  137. n = muxnum / p9_mux_poll_task_num +
  138. (muxnum % p9_mux_poll_task_num ? 1 : 0);
  139. else
  140. n = 1;
  141. if (n > ARRAY_SIZE(p9_mux_poll_tasks))
  142. n = ARRAY_SIZE(p9_mux_poll_tasks);
  143. return n;
  144. }
  145. static int p9_mux_poll_start(struct p9_conn *m)
  146. {
  147. int i, n;
  148. struct p9_mux_poll_task *vpt, *vptlast;
  149. struct task_struct *pproc;
  150. P9_DPRINTK(P9_DEBUG_MUX, "mux %p muxnum %d procnum %d\n", m, p9_mux_num,
  151. p9_mux_poll_task_num);
  152. mutex_lock(&p9_mux_task_lock);
  153. n = p9_mux_calc_poll_procs(p9_mux_num + 1);
  154. if (n > p9_mux_poll_task_num) {
  155. for (i = 0; i < ARRAY_SIZE(p9_mux_poll_tasks); i++) {
  156. if (p9_mux_poll_tasks[i].task == NULL) {
  157. vpt = &p9_mux_poll_tasks[i];
  158. P9_DPRINTK(P9_DEBUG_MUX, "create proc %p\n",
  159. vpt);
  160. pproc = kthread_create(p9_poll_proc, vpt,
  161. "v9fs-poll");
  162. if (!IS_ERR(pproc)) {
  163. vpt->task = pproc;
  164. INIT_LIST_HEAD(&vpt->mux_list);
  165. vpt->muxnum = 0;
  166. p9_mux_poll_task_num++;
  167. wake_up_process(vpt->task);
  168. }
  169. break;
  170. }
  171. }
  172. if (i >= ARRAY_SIZE(p9_mux_poll_tasks))
  173. P9_DPRINTK(P9_DEBUG_ERROR,
  174. "warning: no free poll slots\n");
  175. }
  176. n = (p9_mux_num + 1) / p9_mux_poll_task_num +
  177. ((p9_mux_num + 1) % p9_mux_poll_task_num ? 1 : 0);
  178. vptlast = NULL;
  179. for (i = 0; i < ARRAY_SIZE(p9_mux_poll_tasks); i++) {
  180. vpt = &p9_mux_poll_tasks[i];
  181. if (vpt->task != NULL) {
  182. vptlast = vpt;
  183. if (vpt->muxnum < n) {
  184. P9_DPRINTK(P9_DEBUG_MUX, "put in proc %d\n", i);
  185. list_add(&m->mux_list, &vpt->mux_list);
  186. vpt->muxnum++;
  187. m->poll_task = vpt;
  188. memset(&m->poll_waddr, 0,
  189. sizeof(m->poll_waddr));
  190. init_poll_funcptr(&m->pt, p9_pollwait);
  191. break;
  192. }
  193. }
  194. }
  195. if (i >= ARRAY_SIZE(p9_mux_poll_tasks)) {
  196. if (vptlast == NULL) {
  197. mutex_unlock(&p9_mux_task_lock);
  198. return -ENOMEM;
  199. }
  200. P9_DPRINTK(P9_DEBUG_MUX, "put in proc %d\n", i);
  201. list_add(&m->mux_list, &vptlast->mux_list);
  202. vptlast->muxnum++;
  203. m->poll_task = vptlast;
  204. memset(&m->poll_waddr, 0, sizeof(m->poll_waddr));
  205. init_poll_funcptr(&m->pt, p9_pollwait);
  206. }
  207. p9_mux_num++;
  208. mutex_unlock(&p9_mux_task_lock);
  209. return 0;
  210. }
  211. static void p9_mux_poll_stop(struct p9_conn *m)
  212. {
  213. int i;
  214. struct p9_mux_poll_task *vpt;
  215. mutex_lock(&p9_mux_task_lock);
  216. vpt = m->poll_task;
  217. list_del(&m->mux_list);
  218. for (i = 0; i < ARRAY_SIZE(m->poll_waddr); i++) {
  219. if (m->poll_waddr[i] != NULL) {
  220. remove_wait_queue(m->poll_waddr[i], &m->poll_wait[i]);
  221. m->poll_waddr[i] = NULL;
  222. }
  223. }
  224. vpt->muxnum--;
  225. if (!vpt->muxnum) {
  226. P9_DPRINTK(P9_DEBUG_MUX, "destroy proc %p\n", vpt);
  227. kthread_stop(vpt->task);
  228. vpt->task = NULL;
  229. p9_mux_poll_task_num--;
  230. }
  231. p9_mux_num--;
  232. mutex_unlock(&p9_mux_task_lock);
  233. }
  234. /**
  235. * p9_conn_create - allocate and initialize the per-session mux data
  236. * Creates the polling task if this is the first session.
  237. *
  238. * @trans - transport structure
  239. * @msize - maximum message size
  240. * @extended - pointer to the extended flag
  241. */
  242. struct p9_conn *p9_conn_create(struct p9_trans *trans, int msize,
  243. unsigned char *extended)
  244. {
  245. int i, n;
  246. struct p9_conn *m, *mtmp;
  247. P9_DPRINTK(P9_DEBUG_MUX, "transport %p msize %d\n", trans, msize);
  248. m = kmalloc(sizeof(struct p9_conn), GFP_KERNEL);
  249. if (!m)
  250. return ERR_PTR(-ENOMEM);
  251. spin_lock_init(&m->lock);
  252. INIT_LIST_HEAD(&m->mux_list);
  253. m->msize = msize;
  254. m->extended = extended;
  255. m->trans = trans;
  256. m->tagpool = p9_idpool_create();
  257. if (IS_ERR(m->tagpool)) {
  258. mtmp = ERR_PTR(-ENOMEM);
  259. kfree(m);
  260. return mtmp;
  261. }
  262. m->err = 0;
  263. init_waitqueue_head(&m->equeue);
  264. INIT_LIST_HEAD(&m->req_list);
  265. INIT_LIST_HEAD(&m->unsent_req_list);
  266. m->rcall = NULL;
  267. m->rpos = 0;
  268. m->rbuf = NULL;
  269. m->wpos = m->wsize = 0;
  270. m->wbuf = NULL;
  271. INIT_WORK(&m->rq, p9_read_work);
  272. INIT_WORK(&m->wq, p9_write_work);
  273. m->wsched = 0;
  274. memset(&m->poll_waddr, 0, sizeof(m->poll_waddr));
  275. m->poll_task = NULL;
  276. n = p9_mux_poll_start(m);
  277. if (n) {
  278. kfree(m);
  279. return ERR_PTR(n);
  280. }
  281. n = trans->poll(trans, &m->pt);
  282. if (n & POLLIN) {
  283. P9_DPRINTK(P9_DEBUG_MUX, "mux %p can read\n", m);
  284. set_bit(Rpending, &m->wsched);
  285. }
  286. if (n & POLLOUT) {
  287. P9_DPRINTK(P9_DEBUG_MUX, "mux %p can write\n", m);
  288. set_bit(Wpending, &m->wsched);
  289. }
  290. for (i = 0; i < ARRAY_SIZE(m->poll_waddr); i++) {
  291. if (IS_ERR(m->poll_waddr[i])) {
  292. p9_mux_poll_stop(m);
  293. mtmp = (void *)m->poll_waddr; /* the error code */
  294. kfree(m);
  295. m = mtmp;
  296. break;
  297. }
  298. }
  299. return m;
  300. }
  301. EXPORT_SYMBOL(p9_conn_create);
  302. /**
  303. * p9_mux_destroy - cancels all pending requests and frees mux resources
  304. */
  305. void p9_conn_destroy(struct p9_conn *m)
  306. {
  307. P9_DPRINTK(P9_DEBUG_MUX, "mux %p prev %p next %p\n", m,
  308. m->mux_list.prev, m->mux_list.next);
  309. p9_conn_cancel(m, -ECONNRESET);
  310. if (!list_empty(&m->req_list)) {
  311. /* wait until all processes waiting on this session exit */
  312. P9_DPRINTK(P9_DEBUG_MUX,
  313. "mux %p waiting for empty request queue\n", m);
  314. wait_event_timeout(m->equeue, (list_empty(&m->req_list)), 5000);
  315. P9_DPRINTK(P9_DEBUG_MUX, "mux %p request queue empty: %d\n", m,
  316. list_empty(&m->req_list));
  317. }
  318. p9_mux_poll_stop(m);
  319. m->trans = NULL;
  320. p9_idpool_destroy(m->tagpool);
  321. kfree(m);
  322. }
  323. EXPORT_SYMBOL(p9_conn_destroy);
  324. /**
  325. * p9_pollwait - called by files poll operation to add v9fs-poll task
  326. * to files wait queue
  327. */
  328. static void
  329. p9_pollwait(struct file *filp, wait_queue_head_t *wait_address,
  330. poll_table * p)
  331. {
  332. int i;
  333. struct p9_conn *m;
  334. m = container_of(p, struct p9_conn, pt);
  335. for (i = 0; i < ARRAY_SIZE(m->poll_waddr); i++)
  336. if (m->poll_waddr[i] == NULL)
  337. break;
  338. if (i >= ARRAY_SIZE(m->poll_waddr)) {
  339. P9_DPRINTK(P9_DEBUG_ERROR, "not enough wait_address slots\n");
  340. return;
  341. }
  342. m->poll_waddr[i] = wait_address;
  343. if (!wait_address) {
  344. P9_DPRINTK(P9_DEBUG_ERROR, "no wait_address\n");
  345. m->poll_waddr[i] = ERR_PTR(-EIO);
  346. return;
  347. }
  348. init_waitqueue_entry(&m->poll_wait[i], m->poll_task->task);
  349. add_wait_queue(wait_address, &m->poll_wait[i]);
  350. }
  351. /**
  352. * p9_poll_mux - polls a mux and schedules read or write works if necessary
  353. */
  354. static void p9_poll_mux(struct p9_conn *m)
  355. {
  356. int n;
  357. if (m->err < 0)
  358. return;
  359. n = m->trans->poll(m->trans, NULL);
  360. if (n < 0 || n & (POLLERR | POLLHUP | POLLNVAL)) {
  361. P9_DPRINTK(P9_DEBUG_MUX, "error mux %p err %d\n", m, n);
  362. if (n >= 0)
  363. n = -ECONNRESET;
  364. p9_conn_cancel(m, n);
  365. }
  366. if (n & POLLIN) {
  367. set_bit(Rpending, &m->wsched);
  368. P9_DPRINTK(P9_DEBUG_MUX, "mux %p can read\n", m);
  369. if (!test_and_set_bit(Rworksched, &m->wsched)) {
  370. P9_DPRINTK(P9_DEBUG_MUX, "schedule read work %p\n", m);
  371. queue_work(p9_mux_wq, &m->rq);
  372. }
  373. }
  374. if (n & POLLOUT) {
  375. set_bit(Wpending, &m->wsched);
  376. P9_DPRINTK(P9_DEBUG_MUX, "mux %p can write\n", m);
  377. if ((m->wsize || !list_empty(&m->unsent_req_list))
  378. && !test_and_set_bit(Wworksched, &m->wsched)) {
  379. P9_DPRINTK(P9_DEBUG_MUX, "schedule write work %p\n", m);
  380. queue_work(p9_mux_wq, &m->wq);
  381. }
  382. }
  383. }
  384. /**
  385. * p9_poll_proc - polls all v9fs transports for new events and queues
  386. * the appropriate work to the work queue
  387. */
  388. static int p9_poll_proc(void *a)
  389. {
  390. struct p9_conn *m, *mtmp;
  391. struct p9_mux_poll_task *vpt;
  392. vpt = a;
  393. P9_DPRINTK(P9_DEBUG_MUX, "start %p %p\n", current, vpt);
  394. while (!kthread_should_stop()) {
  395. set_current_state(TASK_INTERRUPTIBLE);
  396. list_for_each_entry_safe(m, mtmp, &vpt->mux_list, mux_list) {
  397. p9_poll_mux(m);
  398. }
  399. P9_DPRINTK(P9_DEBUG_MUX, "sleeping...\n");
  400. schedule_timeout(SCHED_TIMEOUT * HZ);
  401. }
  402. __set_current_state(TASK_RUNNING);
  403. P9_DPRINTK(P9_DEBUG_MUX, "finish\n");
  404. return 0;
  405. }
  406. /**
  407. * p9_write_work - called when a transport can send some data
  408. */
  409. static void p9_write_work(struct work_struct *work)
  410. {
  411. int n, err;
  412. struct p9_conn *m;
  413. struct p9_req *req;
  414. m = container_of(work, struct p9_conn, wq);
  415. if (m->err < 0) {
  416. clear_bit(Wworksched, &m->wsched);
  417. return;
  418. }
  419. if (!m->wsize) {
  420. if (list_empty(&m->unsent_req_list)) {
  421. clear_bit(Wworksched, &m->wsched);
  422. return;
  423. }
  424. spin_lock(&m->lock);
  425. again:
  426. req = list_entry(m->unsent_req_list.next, struct p9_req,
  427. req_list);
  428. list_move_tail(&req->req_list, &m->req_list);
  429. if (req->err == ERREQFLUSH)
  430. goto again;
  431. m->wbuf = req->tcall->sdata;
  432. m->wsize = req->tcall->size;
  433. m->wpos = 0;
  434. spin_unlock(&m->lock);
  435. }
  436. P9_DPRINTK(P9_DEBUG_MUX, "mux %p pos %d size %d\n", m, m->wpos,
  437. m->wsize);
  438. clear_bit(Wpending, &m->wsched);
  439. err = m->trans->write(m->trans, m->wbuf + m->wpos, m->wsize - m->wpos);
  440. P9_DPRINTK(P9_DEBUG_MUX, "mux %p sent %d bytes\n", m, err);
  441. if (err == -EAGAIN) {
  442. clear_bit(Wworksched, &m->wsched);
  443. return;
  444. }
  445. if (err < 0)
  446. goto error;
  447. else if (err == 0) {
  448. err = -EREMOTEIO;
  449. goto error;
  450. }
  451. m->wpos += err;
  452. if (m->wpos == m->wsize)
  453. m->wpos = m->wsize = 0;
  454. if (m->wsize == 0 && !list_empty(&m->unsent_req_list)) {
  455. if (test_and_clear_bit(Wpending, &m->wsched))
  456. n = POLLOUT;
  457. else
  458. n = m->trans->poll(m->trans, NULL);
  459. if (n & POLLOUT) {
  460. P9_DPRINTK(P9_DEBUG_MUX, "schedule write work %p\n", m);
  461. queue_work(p9_mux_wq, &m->wq);
  462. } else
  463. clear_bit(Wworksched, &m->wsched);
  464. } else
  465. clear_bit(Wworksched, &m->wsched);
  466. return;
  467. error:
  468. p9_conn_cancel(m, err);
  469. clear_bit(Wworksched, &m->wsched);
  470. }
  471. static void process_request(struct p9_conn *m, struct p9_req *req)
  472. {
  473. int ecode;
  474. struct p9_str *ename;
  475. if (!req->err && req->rcall->id == P9_RERROR) {
  476. ecode = req->rcall->params.rerror.errno;
  477. ename = &req->rcall->params.rerror.error;
  478. P9_DPRINTK(P9_DEBUG_MUX, "Rerror %.*s\n", ename->len,
  479. ename->str);
  480. if (*m->extended)
  481. req->err = -ecode;
  482. if (!req->err) {
  483. req->err = p9_errstr2errno(ename->str, ename->len);
  484. if (!req->err) { /* string match failed */
  485. PRINT_FCALL_ERROR("unknown error", req->rcall);
  486. }
  487. if (!req->err)
  488. req->err = -ESERVERFAULT;
  489. }
  490. } else if (req->tcall && req->rcall->id != req->tcall->id + 1) {
  491. P9_DPRINTK(P9_DEBUG_ERROR,
  492. "fcall mismatch: expected %d, got %d\n",
  493. req->tcall->id + 1, req->rcall->id);
  494. if (!req->err)
  495. req->err = -EIO;
  496. }
  497. }
  498. /**
  499. * p9_read_work - called when there is some data to be read from a transport
  500. */
  501. static void p9_read_work(struct work_struct *work)
  502. {
  503. int n, err;
  504. struct p9_conn *m;
  505. struct p9_req *req, *rptr, *rreq;
  506. struct p9_fcall *rcall;
  507. char *rbuf;
  508. m = container_of(work, struct p9_conn, rq);
  509. if (m->err < 0)
  510. return;
  511. rcall = NULL;
  512. P9_DPRINTK(P9_DEBUG_MUX, "start mux %p pos %d\n", m, m->rpos);
  513. if (!m->rcall) {
  514. m->rcall =
  515. kmalloc(sizeof(struct p9_fcall) + m->msize, GFP_KERNEL);
  516. if (!m->rcall) {
  517. err = -ENOMEM;
  518. goto error;
  519. }
  520. m->rbuf = (char *)m->rcall + sizeof(struct p9_fcall);
  521. m->rpos = 0;
  522. }
  523. clear_bit(Rpending, &m->wsched);
  524. err = m->trans->read(m->trans, m->rbuf + m->rpos, m->msize - m->rpos);
  525. P9_DPRINTK(P9_DEBUG_MUX, "mux %p got %d bytes\n", m, err);
  526. if (err == -EAGAIN) {
  527. clear_bit(Rworksched, &m->wsched);
  528. return;
  529. }
  530. if (err <= 0)
  531. goto error;
  532. m->rpos += err;
  533. while (m->rpos > 4) {
  534. n = le32_to_cpu(*(__le32 *) m->rbuf);
  535. if (n >= m->msize) {
  536. P9_DPRINTK(P9_DEBUG_ERROR,
  537. "requested packet size too big: %d\n", n);
  538. err = -EIO;
  539. goto error;
  540. }
  541. if (m->rpos < n)
  542. break;
  543. err =
  544. p9_deserialize_fcall(m->rbuf, n, m->rcall, *m->extended);
  545. if (err < 0) {
  546. goto error;
  547. }
  548. #ifdef CONFIG_NET_9P_DEBUG
  549. if ((p9_debug_level&P9_DEBUG_FCALL) == P9_DEBUG_FCALL) {
  550. char buf[150];
  551. p9_printfcall(buf, sizeof(buf), m->rcall,
  552. *m->extended);
  553. printk(KERN_NOTICE ">>> %p %s\n", m, buf);
  554. }
  555. #endif
  556. rcall = m->rcall;
  557. rbuf = m->rbuf;
  558. if (m->rpos > n) {
  559. m->rcall = kmalloc(sizeof(struct p9_fcall) + m->msize,
  560. GFP_KERNEL);
  561. if (!m->rcall) {
  562. err = -ENOMEM;
  563. goto error;
  564. }
  565. m->rbuf = (char *)m->rcall + sizeof(struct p9_fcall);
  566. memmove(m->rbuf, rbuf + n, m->rpos - n);
  567. m->rpos -= n;
  568. } else {
  569. m->rcall = NULL;
  570. m->rbuf = NULL;
  571. m->rpos = 0;
  572. }
  573. P9_DPRINTK(P9_DEBUG_MUX, "mux %p fcall id %d tag %d\n", m,
  574. rcall->id, rcall->tag);
  575. req = NULL;
  576. spin_lock(&m->lock);
  577. list_for_each_entry_safe(rreq, rptr, &m->req_list, req_list) {
  578. if (rreq->tag == rcall->tag) {
  579. req = rreq;
  580. if (req->flush != Flushing)
  581. list_del(&req->req_list);
  582. break;
  583. }
  584. }
  585. spin_unlock(&m->lock);
  586. if (req) {
  587. req->rcall = rcall;
  588. process_request(m, req);
  589. if (req->flush != Flushing) {
  590. if (req->cb)
  591. (*req->cb) (req, req->cba);
  592. else
  593. kfree(req->rcall);
  594. wake_up(&m->equeue);
  595. }
  596. } else {
  597. if (err >= 0 && rcall->id != P9_RFLUSH)
  598. P9_DPRINTK(P9_DEBUG_ERROR,
  599. "unexpected response mux %p id %d tag %d\n",
  600. m, rcall->id, rcall->tag);
  601. kfree(rcall);
  602. }
  603. }
  604. if (!list_empty(&m->req_list)) {
  605. if (test_and_clear_bit(Rpending, &m->wsched))
  606. n = POLLIN;
  607. else
  608. n = m->trans->poll(m->trans, NULL);
  609. if (n & POLLIN) {
  610. P9_DPRINTK(P9_DEBUG_MUX, "schedule read work %p\n", m);
  611. queue_work(p9_mux_wq, &m->rq);
  612. } else
  613. clear_bit(Rworksched, &m->wsched);
  614. } else
  615. clear_bit(Rworksched, &m->wsched);
  616. return;
  617. error:
  618. p9_conn_cancel(m, err);
  619. clear_bit(Rworksched, &m->wsched);
  620. }
  621. /**
  622. * p9_send_request - send 9P request
  623. * The function can sleep until the request is scheduled for sending.
  624. * The function can be interrupted. Return from the function is not
  625. * a guarantee that the request is sent successfully. Can return errors
  626. * that can be retrieved by PTR_ERR macros.
  627. *
  628. * @m: mux data
  629. * @tc: request to be sent
  630. * @cb: callback function to call when response is received
  631. * @cba: parameter to pass to the callback function
  632. */
  633. static struct p9_req *p9_send_request(struct p9_conn *m,
  634. struct p9_fcall *tc,
  635. p9_conn_req_callback cb, void *cba)
  636. {
  637. int n;
  638. struct p9_req *req;
  639. P9_DPRINTK(P9_DEBUG_MUX, "mux %p task %p tcall %p id %d\n", m, current,
  640. tc, tc->id);
  641. if (m->err < 0)
  642. return ERR_PTR(m->err);
  643. req = kmalloc(sizeof(struct p9_req), GFP_KERNEL);
  644. if (!req)
  645. return ERR_PTR(-ENOMEM);
  646. if (tc->id == P9_TVERSION)
  647. n = P9_NOTAG;
  648. else
  649. n = p9_mux_get_tag(m);
  650. if (n < 0)
  651. return ERR_PTR(-ENOMEM);
  652. p9_set_tag(tc, n);
  653. #ifdef CONFIG_NET_9P_DEBUG
  654. if ((p9_debug_level&P9_DEBUG_FCALL) == P9_DEBUG_FCALL) {
  655. char buf[150];
  656. p9_printfcall(buf, sizeof(buf), tc, *m->extended);
  657. printk(KERN_NOTICE "<<< %p %s\n", m, buf);
  658. }
  659. #endif
  660. spin_lock_init(&req->lock);
  661. req->tag = n;
  662. req->tcall = tc;
  663. req->rcall = NULL;
  664. req->err = 0;
  665. req->cb = cb;
  666. req->cba = cba;
  667. req->flush = None;
  668. spin_lock(&m->lock);
  669. list_add_tail(&req->req_list, &m->unsent_req_list);
  670. spin_unlock(&m->lock);
  671. if (test_and_clear_bit(Wpending, &m->wsched))
  672. n = POLLOUT;
  673. else
  674. n = m->trans->poll(m->trans, NULL);
  675. if (n & POLLOUT && !test_and_set_bit(Wworksched, &m->wsched))
  676. queue_work(p9_mux_wq, &m->wq);
  677. return req;
  678. }
  679. static void p9_mux_free_request(struct p9_conn *m, struct p9_req *req)
  680. {
  681. p9_mux_put_tag(m, req->tag);
  682. kfree(req);
  683. }
  684. static void p9_mux_flush_cb(struct p9_req *freq, void *a)
  685. {
  686. p9_conn_req_callback cb;
  687. int tag;
  688. struct p9_conn *m;
  689. struct p9_req *req, *rreq, *rptr;
  690. m = a;
  691. P9_DPRINTK(P9_DEBUG_MUX, "mux %p tc %p rc %p err %d oldtag %d\n", m,
  692. freq->tcall, freq->rcall, freq->err,
  693. freq->tcall->params.tflush.oldtag);
  694. spin_lock(&m->lock);
  695. cb = NULL;
  696. tag = freq->tcall->params.tflush.oldtag;
  697. req = NULL;
  698. list_for_each_entry_safe(rreq, rptr, &m->req_list, req_list) {
  699. if (rreq->tag == tag) {
  700. req = rreq;
  701. list_del(&req->req_list);
  702. break;
  703. }
  704. }
  705. spin_unlock(&m->lock);
  706. if (req) {
  707. spin_lock(&req->lock);
  708. req->flush = Flushed;
  709. spin_unlock(&req->lock);
  710. if (req->cb)
  711. (*req->cb) (req, req->cba);
  712. else
  713. kfree(req->rcall);
  714. wake_up(&m->equeue);
  715. }
  716. kfree(freq->tcall);
  717. kfree(freq->rcall);
  718. p9_mux_free_request(m, freq);
  719. }
  720. static int
  721. p9_mux_flush_request(struct p9_conn *m, struct p9_req *req)
  722. {
  723. struct p9_fcall *fc;
  724. struct p9_req *rreq, *rptr;
  725. P9_DPRINTK(P9_DEBUG_MUX, "mux %p req %p tag %d\n", m, req, req->tag);
  726. /* if a response was received for a request, do nothing */
  727. spin_lock(&req->lock);
  728. if (req->rcall || req->err) {
  729. spin_unlock(&req->lock);
  730. P9_DPRINTK(P9_DEBUG_MUX,
  731. "mux %p req %p response already received\n", m, req);
  732. return 0;
  733. }
  734. req->flush = Flushing;
  735. spin_unlock(&req->lock);
  736. spin_lock(&m->lock);
  737. /* if the request is not sent yet, just remove it from the list */
  738. list_for_each_entry_safe(rreq, rptr, &m->unsent_req_list, req_list) {
  739. if (rreq->tag == req->tag) {
  740. P9_DPRINTK(P9_DEBUG_MUX,
  741. "mux %p req %p request is not sent yet\n", m, req);
  742. list_del(&rreq->req_list);
  743. req->flush = Flushed;
  744. spin_unlock(&m->lock);
  745. if (req->cb)
  746. (*req->cb) (req, req->cba);
  747. return 0;
  748. }
  749. }
  750. spin_unlock(&m->lock);
  751. clear_thread_flag(TIF_SIGPENDING);
  752. fc = p9_create_tflush(req->tag);
  753. p9_send_request(m, fc, p9_mux_flush_cb, m);
  754. return 1;
  755. }
  756. static void
  757. p9_conn_rpc_cb(struct p9_req *req, void *a)
  758. {
  759. struct p9_mux_rpc *r;
  760. P9_DPRINTK(P9_DEBUG_MUX, "req %p r %p\n", req, a);
  761. r = a;
  762. r->rcall = req->rcall;
  763. r->err = req->err;
  764. if (req->flush != None && !req->err)
  765. r->err = -ERESTARTSYS;
  766. wake_up(&r->wqueue);
  767. }
  768. /**
  769. * p9_mux_rpc - sends 9P request and waits until a response is available.
  770. * The function can be interrupted.
  771. * @m: mux data
  772. * @tc: request to be sent
  773. * @rc: pointer where a pointer to the response is stored
  774. */
  775. int
  776. p9_conn_rpc(struct p9_conn *m, struct p9_fcall *tc,
  777. struct p9_fcall **rc)
  778. {
  779. int err, sigpending;
  780. unsigned long flags;
  781. struct p9_req *req;
  782. struct p9_mux_rpc r;
  783. r.err = 0;
  784. r.tcall = tc;
  785. r.rcall = NULL;
  786. r.m = m;
  787. init_waitqueue_head(&r.wqueue);
  788. if (rc)
  789. *rc = NULL;
  790. sigpending = 0;
  791. if (signal_pending(current)) {
  792. sigpending = 1;
  793. clear_thread_flag(TIF_SIGPENDING);
  794. }
  795. req = p9_send_request(m, tc, p9_conn_rpc_cb, &r);
  796. if (IS_ERR(req)) {
  797. err = PTR_ERR(req);
  798. P9_DPRINTK(P9_DEBUG_MUX, "error %d\n", err);
  799. return err;
  800. }
  801. err = wait_event_interruptible(r.wqueue, r.rcall != NULL || r.err < 0);
  802. if (r.err < 0)
  803. err = r.err;
  804. if (err == -ERESTARTSYS && m->trans->status == Connected
  805. && m->err == 0) {
  806. if (p9_mux_flush_request(m, req)) {
  807. /* wait until we get response of the flush message */
  808. do {
  809. clear_thread_flag(TIF_SIGPENDING);
  810. err = wait_event_interruptible(r.wqueue,
  811. r.rcall || r.err);
  812. } while (!r.rcall && !r.err && err == -ERESTARTSYS &&
  813. m->trans->status == Connected && !m->err);
  814. err = -ERESTARTSYS;
  815. }
  816. sigpending = 1;
  817. }
  818. if (sigpending) {
  819. spin_lock_irqsave(&current->sighand->siglock, flags);
  820. recalc_sigpending();
  821. spin_unlock_irqrestore(&current->sighand->siglock, flags);
  822. }
  823. if (rc)
  824. *rc = r.rcall;
  825. else
  826. kfree(r.rcall);
  827. p9_mux_free_request(m, req);
  828. if (err > 0)
  829. err = -EIO;
  830. return err;
  831. }
  832. EXPORT_SYMBOL(p9_conn_rpc);
  833. #ifdef P9_NONBLOCK
  834. /**
  835. * p9_conn_rpcnb - sends 9P request without waiting for response.
  836. * @m: mux data
  837. * @tc: request to be sent
  838. * @cb: callback function to be called when response arrives
  839. * @cba: value to pass to the callback function
  840. */
  841. int p9_conn_rpcnb(struct p9_conn *m, struct p9_fcall *tc,
  842. p9_conn_req_callback cb, void *a)
  843. {
  844. int err;
  845. struct p9_req *req;
  846. req = p9_send_request(m, tc, cb, a);
  847. if (IS_ERR(req)) {
  848. err = PTR_ERR(req);
  849. P9_DPRINTK(P9_DEBUG_MUX, "error %d\n", err);
  850. return PTR_ERR(req);
  851. }
  852. P9_DPRINTK(P9_DEBUG_MUX, "mux %p tc %p tag %d\n", m, tc, req->tag);
  853. return 0;
  854. }
  855. EXPORT_SYMBOL(p9_conn_rpcnb);
  856. #endif /* P9_NONBLOCK */
  857. /**
  858. * p9_conn_cancel - cancel all pending requests with error
  859. * @m: mux data
  860. * @err: error code
  861. */
  862. void p9_conn_cancel(struct p9_conn *m, int err)
  863. {
  864. struct p9_req *req, *rtmp;
  865. LIST_HEAD(cancel_list);
  866. P9_DPRINTK(P9_DEBUG_ERROR, "mux %p err %d\n", m, err);
  867. m->err = err;
  868. spin_lock(&m->lock);
  869. list_for_each_entry_safe(req, rtmp, &m->req_list, req_list) {
  870. list_move(&req->req_list, &cancel_list);
  871. }
  872. list_for_each_entry_safe(req, rtmp, &m->unsent_req_list, req_list) {
  873. list_move(&req->req_list, &cancel_list);
  874. }
  875. spin_unlock(&m->lock);
  876. list_for_each_entry_safe(req, rtmp, &cancel_list, req_list) {
  877. list_del(&req->req_list);
  878. if (!req->err)
  879. req->err = err;
  880. if (req->cb)
  881. (*req->cb) (req, req->cba);
  882. else
  883. kfree(req->rcall);
  884. }
  885. wake_up(&m->equeue);
  886. }
  887. EXPORT_SYMBOL(p9_conn_cancel);
  888. static u16 p9_mux_get_tag(struct p9_conn *m)
  889. {
  890. int tag;
  891. tag = p9_idpool_get(m->tagpool);
  892. if (tag < 0)
  893. return P9_NOTAG;
  894. else
  895. return (u16) tag;
  896. }
  897. static void p9_mux_put_tag(struct p9_conn *m, u16 tag)
  898. {
  899. if (tag != P9_NOTAG && p9_idpool_check(tag, m->tagpool))
  900. p9_idpool_put(tag, m->tagpool);
  901. }