mux.c 23 KB

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