mux.c 23.4 KB
Newer Older
1
/*
2
 * net/9p/mux.c
3 4 5 6
 *
 * Protocol Multiplexer
 *
 *  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 11
 *  it under the terms of the GNU General Public License version 2
 *  as published by the Free Software Foundation.
12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to:
 *  Free Software Foundation
 *  51 Franklin Street, Fifth Floor
 *  Boston, MA  02111-1301  USA
 *
 */

#include <linux/module.h>
#include <linux/errno.h>
#include <linux/fs.h>
29
#include <linux/poll.h>
30 31
#include <linux/kthread.h>
#include <linux/idr.h>
32
#include <linux/mutex.h>
33 34 35
#include <net/9p/9p.h>
#include <net/9p/transport.h>
#include <net/9p/conn.h>
36

37 38 39 40 41 42 43 44 45 46 47
#define ERREQFLUSH	1
#define SCHED_TIMEOUT	10
#define MAXPOLLWADDR	2

enum {
	Rworksched = 1,		/* read work scheduled or running */
	Rpending = 2,		/* can read */
	Wworksched = 4,		/* write work scheduled or running */
	Wpending = 8,		/* can write */
};

48 49 50 51 52 53
enum {
	None,
	Flushing,
	Flushed,
};

54
struct p9_mux_poll_task;
55

56 57
struct p9_req {
	spinlock_t lock; /* protect request structure */
58
	int tag;
59 60
	struct p9_fcall *tcall;
	struct p9_fcall *rcall;
61
	int err;
62
	p9_conn_req_callback cb;
63
	void *cba;
64
	int flush;
65 66 67
	struct list_head req_list;
};

68 69
struct p9_conn {
	spinlock_t lock; /* protect lock structure */
70
	struct list_head mux_list;
71
	struct p9_mux_poll_task *poll_task;
72 73
	int msize;
	unsigned char *extended;
74 75
	struct p9_transport *trans;
	struct p9_idpool *tagpool;
76 77 78 79
	int err;
	wait_queue_head_t equeue;
	struct list_head req_list;
	struct list_head unsent_req_list;
80
	struct p9_fcall *rcall;
81 82 83 84 85 86 87 88 89 90 91 92 93
	int rpos;
	char *rbuf;
	int wpos;
	int wsize;
	char *wbuf;
	wait_queue_t poll_wait[MAXPOLLWADDR];
	wait_queue_head_t *poll_waddr[MAXPOLLWADDR];
	poll_table pt;
	struct work_struct rq;
	struct work_struct wq;
	unsigned long wsched;
};

94
struct p9_mux_poll_task {
95 96 97 98 99
	struct task_struct *task;
	struct list_head mux_list;
	int muxnum;
};

100 101
struct p9_mux_rpc {
	struct p9_conn *m;
102
	int err;
103 104
	struct p9_fcall *tcall;
	struct p9_fcall *rcall;
105 106 107
	wait_queue_head_t wqueue;
};

108 109 110 111
static int p9_poll_proc(void *);
static void p9_read_work(struct work_struct *work);
static void p9_write_work(struct work_struct *work);
static void p9_pollwait(struct file *filp, wait_queue_head_t *wait_address,
112
			  poll_table * p);
113 114
static u16 p9_mux_get_tag(struct p9_conn *);
static void p9_mux_put_tag(struct p9_conn *, u16);
115

116 117
static DEFINE_MUTEX(p9_mux_task_lock);
static struct workqueue_struct *p9_mux_wq;
118

119 120 121
static int p9_mux_num;
static int p9_mux_poll_task_num;
static struct p9_mux_poll_task p9_mux_poll_tasks[100];
122

123
int p9_mux_global_init(void)
124 125 126
{
	int i;

127 128
	for (i = 0; i < ARRAY_SIZE(p9_mux_poll_tasks); i++)
		p9_mux_poll_tasks[i].task = NULL;
129

130 131
	p9_mux_wq = create_workqueue("v9fs");
	if (!p9_mux_wq) {
132
		printk(KERN_WARNING "v9fs: mux: creating workqueue failed\n");
133
		return -ENOMEM;
134
	}
135 136

	return 0;
137
}
138

139
void p9_mux_global_exit(void)
140
{
141
	destroy_workqueue(p9_mux_wq);
142 143 144
}

/**
145
 * p9_mux_calc_poll_procs - calculates the number of polling procs
146
 * based on the number of mounted v9fs filesystems.
147
 *
148
 * The current implementation returns sqrt of the number of mounts.
149
 */
150
static int p9_mux_calc_poll_procs(int muxnum)
151 152 153
{
	int n;

154 155 156
	if (p9_mux_poll_task_num)
		n = muxnum / p9_mux_poll_task_num +
		    (muxnum % p9_mux_poll_task_num ? 1 : 0);
157 158 159
	else
		n = 1;

160 161
	if (n > ARRAY_SIZE(p9_mux_poll_tasks))
		n = ARRAY_SIZE(p9_mux_poll_tasks);
162

163 164 165
	return n;
}

166
static int p9_mux_poll_start(struct p9_conn *m)
167
{
168
	int i, n;
169
	struct p9_mux_poll_task *vpt, *vptlast;
170
	struct task_struct *pproc;
171

172 173 174
	P9_DPRINTK(P9_DEBUG_MUX, "mux %p muxnum %d procnum %d\n", m, p9_mux_num,
		p9_mux_poll_task_num);
	mutex_lock(&p9_mux_task_lock);
175

176 177 178 179 180 181 182 183 184
	n = p9_mux_calc_poll_procs(p9_mux_num + 1);
	if (n > p9_mux_poll_task_num) {
		for (i = 0; i < ARRAY_SIZE(p9_mux_poll_tasks); i++) {
			if (p9_mux_poll_tasks[i].task == NULL) {
				vpt = &p9_mux_poll_tasks[i];
				P9_DPRINTK(P9_DEBUG_MUX, "create proc %p\n",
									vpt);
				pproc = kthread_create(p9_poll_proc, vpt,
								"v9fs-poll");
185 186 187 188 189

				if (!IS_ERR(pproc)) {
					vpt->task = pproc;
					INIT_LIST_HEAD(&vpt->mux_list);
					vpt->muxnum = 0;
190
					p9_mux_poll_task_num++;
191 192
					wake_up_process(vpt->task);
				}
193 194
				break;
			}
195 196
		}

197 198 199
		if (i >= ARRAY_SIZE(p9_mux_poll_tasks))
			P9_DPRINTK(P9_DEBUG_ERROR,
					"warning: no free poll slots\n");
200
	}
201

202 203
	n = (p9_mux_num + 1) / p9_mux_poll_task_num +
	    ((p9_mux_num + 1) % p9_mux_poll_task_num ? 1 : 0);
204 205

	vptlast = NULL;
206 207
	for (i = 0; i < ARRAY_SIZE(p9_mux_poll_tasks); i++) {
		vpt = &p9_mux_poll_tasks[i];
208 209 210
		if (vpt->task != NULL) {
			vptlast = vpt;
			if (vpt->muxnum < n) {
211
				P9_DPRINTK(P9_DEBUG_MUX, "put in proc %d\n", i);
212 213 214
				list_add(&m->mux_list, &vpt->mux_list);
				vpt->muxnum++;
				m->poll_task = vpt;
215 216 217
				memset(&m->poll_waddr, 0,
							sizeof(m->poll_waddr));
				init_poll_funcptr(&m->pt, p9_pollwait);
218 219 220
				break;
			}
		}
221 222
	}

223
	if (i >= ARRAY_SIZE(p9_mux_poll_tasks)) {
224 225 226
		if (vptlast == NULL)
			return -ENOMEM;

227
		P9_DPRINTK(P9_DEBUG_MUX, "put in proc %d\n", i);
228 229
		list_add(&m->mux_list, &vptlast->mux_list);
		vptlast->muxnum++;
230
		m->poll_task = vptlast;
231
		memset(&m->poll_waddr, 0, sizeof(m->poll_waddr));
232
		init_poll_funcptr(&m->pt, p9_pollwait);
233 234
	}

235 236
	p9_mux_num++;
	mutex_unlock(&p9_mux_task_lock);
237 238

	return 0;
239
}
240

241
static void p9_mux_poll_stop(struct p9_conn *m)
242 243
{
	int i;
244
	struct p9_mux_poll_task *vpt;
245

246
	mutex_lock(&p9_mux_task_lock);
247 248
	vpt = m->poll_task;
	list_del(&m->mux_list);
249
	for (i = 0; i < ARRAY_SIZE(m->poll_waddr); i++) {
250 251 252 253 254 255 256
		if (m->poll_waddr[i] != NULL) {
			remove_wait_queue(m->poll_waddr[i], &m->poll_wait[i]);
			m->poll_waddr[i] = NULL;
		}
	}
	vpt->muxnum--;
	if (!vpt->muxnum) {
257
		P9_DPRINTK(P9_DEBUG_MUX, "destroy proc %p\n", vpt);
258
		kthread_stop(vpt->task);
259
		vpt->task = NULL;
260
		p9_mux_poll_task_num--;
261
	}
262 263
	p9_mux_num--;
	mutex_unlock(&p9_mux_task_lock);
264
}
265

266
/**
267
 * p9_conn_create - allocate and initialize the per-session mux data
268 269 270 271 272 273
 * Creates the polling task if this is the first session.
 *
 * @trans - transport structure
 * @msize - maximum message size
 * @extended - pointer to the extended flag
 */
274
struct p9_conn *p9_conn_create(struct p9_transport *trans, int msize,
275 276 277
				    unsigned char *extended)
{
	int i, n;
278
	struct p9_conn *m, *mtmp;
279

280 281
	P9_DPRINTK(P9_DEBUG_MUX, "transport %p msize %d\n", trans, msize);
	m = kmalloc(sizeof(struct p9_conn), GFP_KERNEL);
282 283 284 285 286 287 288 289
	if (!m)
		return ERR_PTR(-ENOMEM);

	spin_lock_init(&m->lock);
	INIT_LIST_HEAD(&m->mux_list);
	m->msize = msize;
	m->extended = extended;
	m->trans = trans;
290
	m->tagpool = p9_idpool_create();
E
Eric Van Hensbergen 已提交
291 292
	if (IS_ERR(m->tagpool)) {
		mtmp = ERR_PTR(-ENOMEM);
293
		kfree(m);
E
Eric Van Hensbergen 已提交
294
		return mtmp;
295 296
	}

297 298 299 300
	m->err = 0;
	init_waitqueue_head(&m->equeue);
	INIT_LIST_HEAD(&m->req_list);
	INIT_LIST_HEAD(&m->unsent_req_list);
301
	m->rcall = NULL;
302
	m->rpos = 0;
303
	m->rbuf = NULL;
304
	m->wpos = m->wsize = 0;
305
	m->wbuf = NULL;
306 307
	INIT_WORK(&m->rq, p9_read_work);
	INIT_WORK(&m->wq, p9_write_work);
308 309
	m->wsched = 0;
	memset(&m->poll_waddr, 0, sizeof(m->poll_waddr));
310
	m->poll_task = NULL;
311
	n = p9_mux_poll_start(m);
E
Eric Van Hensbergen 已提交
312 313
	if (n) {
		kfree(m);
314
		return ERR_PTR(n);
E
Eric Van Hensbergen 已提交
315
	}
316 317 318

	n = trans->poll(trans, &m->pt);
	if (n & POLLIN) {
319
		P9_DPRINTK(P9_DEBUG_MUX, "mux %p can read\n", m);
320
		set_bit(Rpending, &m->wsched);
321 322
	}

323
	if (n & POLLOUT) {
324
		P9_DPRINTK(P9_DEBUG_MUX, "mux %p can write\n", m);
325
		set_bit(Wpending, &m->wsched);
326 327
	}

328
	for (i = 0; i < ARRAY_SIZE(m->poll_waddr); i++) {
329
		if (IS_ERR(m->poll_waddr[i])) {
330
			p9_mux_poll_stop(m);
331 332 333 334 335
			mtmp = (void *)m->poll_waddr;	/* the error code */
			kfree(m);
			m = mtmp;
			break;
		}
336 337
	}

338 339
	return m;
}
340
EXPORT_SYMBOL(p9_conn_create);
341

342
/**
343
 * p9_mux_destroy - cancels all pending requests and frees mux resources
344
 */
345
void p9_conn_destroy(struct p9_conn *m)
346
{
347
	P9_DPRINTK(P9_DEBUG_MUX, "mux %p prev %p next %p\n", m,
348
		m->mux_list.prev, m->mux_list.next);
349
	p9_conn_cancel(m, -ECONNRESET);
350 351 352

	if (!list_empty(&m->req_list)) {
		/* wait until all processes waiting on this session exit */
353 354
		P9_DPRINTK(P9_DEBUG_MUX,
			"mux %p waiting for empty request queue\n", m);
355
		wait_event_timeout(m->equeue, (list_empty(&m->req_list)), 5000);
356
		P9_DPRINTK(P9_DEBUG_MUX, "mux %p request queue empty: %d\n", m,
357 358
			list_empty(&m->req_list));
	}
359

360
	p9_mux_poll_stop(m);
361
	m->trans = NULL;
362
	p9_idpool_destroy(m->tagpool);
363
	kfree(m);
364
}
365
EXPORT_SYMBOL(p9_conn_destroy);
366 367

/**
368
 * p9_pollwait - called by files poll operation to add v9fs-poll task
369
 * 	to files wait queue
370
 */
371
static void
372
p9_pollwait(struct file *filp, wait_queue_head_t *wait_address,
373
	      poll_table * p)
374
{
375
	int i;
376
	struct p9_conn *m;
377

378 379
	m = container_of(p, struct p9_conn, pt);
	for (i = 0; i < ARRAY_SIZE(m->poll_waddr); i++)
380 381
		if (m->poll_waddr[i] == NULL)
			break;
382

383
	if (i >= ARRAY_SIZE(m->poll_waddr)) {
384
		P9_DPRINTK(P9_DEBUG_ERROR, "not enough wait_address slots\n");
385 386
		return;
	}
387

388
	m->poll_waddr[i] = wait_address;
389

390
	if (!wait_address) {
391
		P9_DPRINTK(P9_DEBUG_ERROR, "no wait_address\n");
392 393 394
		m->poll_waddr[i] = ERR_PTR(-EIO);
		return;
	}
395

396 397
	init_waitqueue_entry(&m->poll_wait[i], m->poll_task->task);
	add_wait_queue(wait_address, &m->poll_wait[i]);
398 399 400
}

/**
401
 * p9_poll_mux - polls a mux and schedules read or write works if necessary
402
 */
403
static void p9_poll_mux(struct p9_conn *m)
404
{
405
	int n;
406

407 408 409 410 411
	if (m->err < 0)
		return;

	n = m->trans->poll(m->trans, NULL);
	if (n < 0 || n & (POLLERR | POLLHUP | POLLNVAL)) {
412
		P9_DPRINTK(P9_DEBUG_MUX, "error mux %p err %d\n", m, n);
413 414
		if (n >= 0)
			n = -ECONNRESET;
415
		p9_conn_cancel(m, n);
416 417 418 419
	}

	if (n & POLLIN) {
		set_bit(Rpending, &m->wsched);
420
		P9_DPRINTK(P9_DEBUG_MUX, "mux %p can read\n", m);
421
		if (!test_and_set_bit(Rworksched, &m->wsched)) {
422 423
			P9_DPRINTK(P9_DEBUG_MUX, "schedule read work %p\n", m);
			queue_work(p9_mux_wq, &m->rq);
424 425
		}
	}
426

427 428
	if (n & POLLOUT) {
		set_bit(Wpending, &m->wsched);
429
		P9_DPRINTK(P9_DEBUG_MUX, "mux %p can write\n", m);
430 431
		if ((m->wsize || !list_empty(&m->unsent_req_list))
		    && !test_and_set_bit(Wworksched, &m->wsched)) {
432 433
			P9_DPRINTK(P9_DEBUG_MUX, "schedule write work %p\n", m);
			queue_work(p9_mux_wq, &m->wq);
434 435
		}
	}
436 437 438
}

/**
439
 * p9_poll_proc - polls all v9fs transports for new events and queues
440
 * 	the appropriate work to the work queue
441
 */
442
static int p9_poll_proc(void *a)
443
{
444 445
	struct p9_conn *m, *mtmp;
	struct p9_mux_poll_task *vpt;
446

447
	vpt = a;
448
	P9_DPRINTK(P9_DEBUG_MUX, "start %p %p\n", current, vpt);
449 450
	while (!kthread_should_stop()) {
		set_current_state(TASK_INTERRUPTIBLE);
451

452
		list_for_each_entry_safe(m, mtmp, &vpt->mux_list, mux_list) {
453
			p9_poll_mux(m);
454 455
		}

456
		P9_DPRINTK(P9_DEBUG_MUX, "sleeping...\n");
457 458
		schedule_timeout(SCHED_TIMEOUT * HZ);
	}
459

460
	__set_current_state(TASK_RUNNING);
461
	P9_DPRINTK(P9_DEBUG_MUX, "finish\n");
462 463
	return 0;
}
464

465
/**
466
 * p9_write_work - called when a transport can send some data
467
 */
468
static void p9_write_work(struct work_struct *work)
469 470
{
	int n, err;
471 472
	struct p9_conn *m;
	struct p9_req *req;
473

474
	m = container_of(work, struct p9_conn, wq);
475

476 477 478
	if (m->err < 0) {
		clear_bit(Wworksched, &m->wsched);
		return;
479 480
	}

481 482 483 484
	if (!m->wsize) {
		if (list_empty(&m->unsent_req_list)) {
			clear_bit(Wworksched, &m->wsched);
			return;
485 486
		}

487
		spin_lock(&m->lock);
488
again:
489
		req = list_entry(m->unsent_req_list.next, struct p9_req,
490 491
			       req_list);
		list_move_tail(&req->req_list, &m->req_list);
492 493 494
		if (req->err == ERREQFLUSH)
			goto again;

495 496
		m->wbuf = req->tcall->sdata;
		m->wsize = req->tcall->size;
497 498
		m->wpos = 0;
		spin_unlock(&m->lock);
499 500
	}

501 502
	P9_DPRINTK(P9_DEBUG_MUX, "mux %p pos %d size %d\n", m, m->wpos,
								m->wsize);
503 504
	clear_bit(Wpending, &m->wsched);
	err = m->trans->write(m->trans, m->wbuf + m->wpos, m->wsize - m->wpos);
505
	P9_DPRINTK(P9_DEBUG_MUX, "mux %p sent %d bytes\n", m, err);
506 507 508 509 510
	if (err == -EAGAIN) {
		clear_bit(Wworksched, &m->wsched);
		return;
	}

511
	if (err < 0)
512
		goto error;
513 514 515 516
	else if (err == 0) {
		err = -EREMOTEIO;
		goto error;
	}
517 518 519 520 521 522 523 524 525 526 527 528

	m->wpos += err;
	if (m->wpos == m->wsize)
		m->wpos = m->wsize = 0;

	if (m->wsize == 0 && !list_empty(&m->unsent_req_list)) {
		if (test_and_clear_bit(Wpending, &m->wsched))
			n = POLLOUT;
		else
			n = m->trans->poll(m->trans, NULL);

		if (n & POLLOUT) {
529 530
			P9_DPRINTK(P9_DEBUG_MUX, "schedule write work %p\n", m);
			queue_work(p9_mux_wq, &m->wq);
531 532 533 534
		} else
			clear_bit(Wworksched, &m->wsched);
	} else
		clear_bit(Wworksched, &m->wsched);
535

536 537
	return;

538 539
error:
	p9_conn_cancel(m, err);
540
	clear_bit(Wworksched, &m->wsched);
541 542
}

543
static void process_request(struct p9_conn *m, struct p9_req *req)
544
{
545
	int ecode;
546
	struct p9_str *ename;
547

548
	if (!req->err && req->rcall->id == P9_RERROR) {
549
		ecode = req->rcall->params.rerror.errno;
550
		ename = &req->rcall->params.rerror.error;
551

552 553
		P9_DPRINTK(P9_DEBUG_MUX, "Rerror %.*s\n", ename->len,
								ename->str);
554 555 556 557 558

		if (*m->extended)
			req->err = -ecode;

		if (!req->err) {
559
			req->err = p9_errstr2errno(ename->str, ename->len);
560 561

			if (!req->err) {	/* string match failed */
562
				PRINT_FCALL_ERROR("unknown error", req->rcall);
563 564 565 566 567 568
			}

			if (!req->err)
				req->err = -ESERVERFAULT;
		}
	} else if (req->tcall && req->rcall->id != req->tcall->id + 1) {
569 570 571
		P9_DPRINTK(P9_DEBUG_ERROR,
				"fcall mismatch: expected %d, got %d\n",
				req->tcall->id + 1, req->rcall->id);
572 573
		if (!req->err)
			req->err = -EIO;
574 575 576
	}
}

577
/**
578
 * p9_read_work - called when there is some data to be read from a transport
579
 */
580
static void p9_read_work(struct work_struct *work)
581
{
582
	int n, err;
583 584 585
	struct p9_conn *m;
	struct p9_req *req, *rptr, *rreq;
	struct p9_fcall *rcall;
586
	char *rbuf;
587

588
	m = container_of(work, struct p9_conn, rq);
589 590 591 592 593

	if (m->err < 0)
		return;

	rcall = NULL;
594
	P9_DPRINTK(P9_DEBUG_MUX, "start mux %p pos %d\n", m, m->rpos);
595 596 597

	if (!m->rcall) {
		m->rcall =
598
		    kmalloc(sizeof(struct p9_fcall) + m->msize, GFP_KERNEL);
599 600 601 602 603
		if (!m->rcall) {
			err = -ENOMEM;
			goto error;
		}

604
		m->rbuf = (char *)m->rcall + sizeof(struct p9_fcall);
605 606 607
		m->rpos = 0;
	}

608 609
	clear_bit(Rpending, &m->wsched);
	err = m->trans->read(m->trans, m->rbuf + m->rpos, m->msize - m->rpos);
610
	P9_DPRINTK(P9_DEBUG_MUX, "mux %p got %d bytes\n", m, err);
611 612 613 614
	if (err == -EAGAIN) {
		clear_bit(Rworksched, &m->wsched);
		return;
	}
615

616 617
	if (err <= 0)
		goto error;
618

619 620 621 622
	m->rpos += err;
	while (m->rpos > 4) {
		n = le32_to_cpu(*(__le32 *) m->rbuf);
		if (n >= m->msize) {
623
			P9_DPRINTK(P9_DEBUG_ERROR,
624 625 626 627 628 629
				"requested packet size too big: %d\n", n);
			err = -EIO;
			goto error;
		}

		if (m->rpos < n)
630
			break;
631

632
		err =
633
		    p9_deserialize_fcall(m->rbuf, n, m->rcall, *m->extended);
634
		if (err < 0) {
635
			goto error;
636 637
		}

638 639
#ifdef CONFIG_NET_9P_DEBUG
		if ((p9_debug_level&P9_DEBUG_FCALL) == P9_DEBUG_FCALL) {
640 641
			char buf[150];

642
			p9_printfcall(buf, sizeof(buf), m->rcall,
643 644 645
				*m->extended);
			printk(KERN_NOTICE ">>> %p %s\n", m, buf);
		}
646
#endif
647

648 649 650
		rcall = m->rcall;
		rbuf = m->rbuf;
		if (m->rpos > n) {
651
			m->rcall = kmalloc(sizeof(struct p9_fcall) + m->msize,
652 653 654 655 656 657
					   GFP_KERNEL);
			if (!m->rcall) {
				err = -ENOMEM;
				goto error;
			}

658
			m->rbuf = (char *)m->rcall + sizeof(struct p9_fcall);
659 660 661 662 663 664 665 666
			memmove(m->rbuf, rbuf + n, m->rpos - n);
			m->rpos -= n;
		} else {
			m->rcall = NULL;
			m->rbuf = NULL;
			m->rpos = 0;
		}

667 668
		P9_DPRINTK(P9_DEBUG_MUX, "mux %p fcall id %d tag %d\n", m,
							rcall->id, rcall->tag);
669 670 671 672 673 674

		req = NULL;
		spin_lock(&m->lock);
		list_for_each_entry_safe(rreq, rptr, &m->req_list, req_list) {
			if (rreq->tag == rcall->tag) {
				req = rreq;
675 676
				if (req->flush != Flushing)
					list_del(&req->req_list);
677
				break;
678 679
			}
		}
680
		spin_unlock(&m->lock);
681

682 683 684 685 686 687 688 689 690 691 692 693 694
		if (req) {
			req->rcall = rcall;
			process_request(m, req);

			if (req->flush != Flushing) {
				if (req->cb)
					(*req->cb) (req, req->cba);
				else
					kfree(req->rcall);

				wake_up(&m->equeue);
			}
		} else {
695 696 697 698
			if (err >= 0 && rcall->id != P9_RFLUSH)
				P9_DPRINTK(P9_DEBUG_ERROR,
				  "unexpected response mux %p id %d tag %d\n",
				  m, rcall->id, rcall->tag);
699 700 701 702
			kfree(rcall);
		}
	}

703 704 705 706 707 708 709
	if (!list_empty(&m->req_list)) {
		if (test_and_clear_bit(Rpending, &m->wsched))
			n = POLLIN;
		else
			n = m->trans->poll(m->trans, NULL);

		if (n & POLLIN) {
710 711
			P9_DPRINTK(P9_DEBUG_MUX, "schedule read work %p\n", m);
			queue_work(p9_mux_wq, &m->rq);
712 713 714 715
		} else
			clear_bit(Rworksched, &m->wsched);
	} else
		clear_bit(Rworksched, &m->wsched);
716

717
	return;
718

719 720
error:
	p9_conn_cancel(m, err);
721
	clear_bit(Rworksched, &m->wsched);
722 723 724
}

/**
725
 * p9_send_request - send 9P request
726 727
 * The function can sleep until the request is scheduled for sending.
 * The function can be interrupted. Return from the function is not
A
Andreas Mohr 已提交
728
 * a guarantee that the request is sent successfully. Can return errors
729
 * that can be retrieved by PTR_ERR macros.
730
 *
731 732 733 734
 * @m: mux data
 * @tc: request to be sent
 * @cb: callback function to call when response is received
 * @cba: parameter to pass to the callback function
735
 */
736 737 738
static struct p9_req *p9_send_request(struct p9_conn *m,
					  struct p9_fcall *tc,
					  p9_conn_req_callback cb, void *cba)
739 740
{
	int n;
741
	struct p9_req *req;
742

743
	P9_DPRINTK(P9_DEBUG_MUX, "mux %p task %p tcall %p id %d\n", m, current,
744 745 746 747
		tc, tc->id);
	if (m->err < 0)
		return ERR_PTR(m->err);

748
	req = kmalloc(sizeof(struct p9_req), GFP_KERNEL);
749 750
	if (!req)
		return ERR_PTR(-ENOMEM);
751

752 753
	if (tc->id == P9_TVERSION)
		n = P9_NOTAG;
754
	else
755
		n = p9_mux_get_tag(m);
756 757 758 759

	if (n < 0)
		return ERR_PTR(-ENOMEM);

760 761 762 763
	p9_set_tag(tc, n);

#ifdef CONFIG_NET_9P_DEBUG
	if ((p9_debug_level&P9_DEBUG_FCALL) == P9_DEBUG_FCALL) {
764 765
		char buf[150];

766
		p9_printfcall(buf, sizeof(buf), tc, *m->extended);
767 768
		printk(KERN_NOTICE "<<< %p %s\n", m, buf);
	}
769
#endif
770

771
	spin_lock_init(&req->lock);
772 773 774 775 776 777
	req->tag = n;
	req->tcall = tc;
	req->rcall = NULL;
	req->err = 0;
	req->cb = cb;
	req->cba = cba;
778
	req->flush = None;
779 780 781 782 783 784 785 786 787 788 789

	spin_lock(&m->lock);
	list_add_tail(&req->req_list, &m->unsent_req_list);
	spin_unlock(&m->lock);

	if (test_and_clear_bit(Wpending, &m->wsched))
		n = POLLOUT;
	else
		n = m->trans->poll(m->trans, NULL);

	if (n & POLLOUT && !test_and_set_bit(Wworksched, &m->wsched))
790
		queue_work(p9_mux_wq, &m->wq);
791 792 793 794

	return req;
}

795
static void p9_mux_free_request(struct p9_conn *m, struct p9_req *req)
796
{
797
	p9_mux_put_tag(m, req->tag);
798 799 800
	kfree(req);
}

801
static void p9_mux_flush_cb(struct p9_req *freq, void *a)
802
{
803
	p9_conn_req_callback cb;
804
	int tag;
805 806
	struct p9_conn *m;
	struct p9_req *req, *rreq, *rptr;
807 808

	m = a;
809
	P9_DPRINTK(P9_DEBUG_MUX, "mux %p tc %p rc %p err %d oldtag %d\n", m,
810 811
		freq->tcall, freq->rcall, freq->err,
		freq->tcall->params.tflush.oldtag);
812 813 814

	spin_lock(&m->lock);
	cb = NULL;
815 816 817 818 819
	tag = freq->tcall->params.tflush.oldtag;
	req = NULL;
	list_for_each_entry_safe(rreq, rptr, &m->req_list, req_list) {
		if (rreq->tag == tag) {
			req = rreq;
820 821 822 823
			list_del(&req->req_list);
			break;
		}
	}
824
	spin_unlock(&m->lock);
825

826 827 828 829 830 831 832 833 834 835 836 837
	if (req) {
		spin_lock(&req->lock);
		req->flush = Flushed;
		spin_unlock(&req->lock);

		if (req->cb)
			(*req->cb) (req, req->cba);
		else
			kfree(req->rcall);

		wake_up(&m->equeue);
	}
838

839 840
	kfree(freq->tcall);
	kfree(freq->rcall);
841
	p9_mux_free_request(m, freq);
842 843
}

844
static int
845
p9_mux_flush_request(struct p9_conn *m, struct p9_req *req)
846
{
847 848
	struct p9_fcall *fc;
	struct p9_req *rreq, *rptr;
849

850
	P9_DPRINTK(P9_DEBUG_MUX, "mux %p req %p tag %d\n", m, req, req->tag);
851

852 853 854 855
	/* if a response was received for a request, do nothing */
	spin_lock(&req->lock);
	if (req->rcall || req->err) {
		spin_unlock(&req->lock);
856 857
		P9_DPRINTK(P9_DEBUG_MUX,
			"mux %p req %p response already received\n", m, req);
858 859 860 861 862 863 864 865 866 867
		return 0;
	}

	req->flush = Flushing;
	spin_unlock(&req->lock);

	spin_lock(&m->lock);
	/* if the request is not sent yet, just remove it from the list */
	list_for_each_entry_safe(rreq, rptr, &m->unsent_req_list, req_list) {
		if (rreq->tag == req->tag) {
868 869
			P9_DPRINTK(P9_DEBUG_MUX,
			   "mux %p req %p request is not sent yet\n", m, req);
870 871 872 873 874 875 876 877 878 879 880
			list_del(&rreq->req_list);
			req->flush = Flushed;
			spin_unlock(&m->lock);
			if (req->cb)
				(*req->cb) (req, req->cba);
			return 0;
		}
	}
	spin_unlock(&m->lock);

	clear_thread_flag(TIF_SIGPENDING);
881 882
	fc = p9_create_tflush(req->tag);
	p9_send_request(m, fc, p9_mux_flush_cb, m);
883
	return 1;
884 885 886
}

static void
887
p9_conn_rpc_cb(struct p9_req *req, void *a)
888
{
889
	struct p9_mux_rpc *r;
890

891
	P9_DPRINTK(P9_DEBUG_MUX, "req %p r %p\n", req, a);
892
	r = a;
893 894 895
	r->rcall = req->rcall;
	r->err = req->err;

896
	if (req->flush != None && !req->err)
897 898
		r->err = -ERESTARTSYS;

899 900 901 902
	wake_up(&r->wqueue);
}

/**
903
 * p9_mux_rpc - sends 9P request and waits until a response is available.
904 905 906 907 908 909
 *	The function can be interrupted.
 * @m: mux data
 * @tc: request to be sent
 * @rc: pointer where a pointer to the response is stored
 */
int
910 911
p9_conn_rpc(struct p9_conn *m, struct p9_fcall *tc,
	     struct p9_fcall **rc)
912
{
913
	int err, sigpending;
914
	unsigned long flags;
915 916
	struct p9_req *req;
	struct p9_mux_rpc r;
917 918

	r.err = 0;
919
	r.tcall = tc;
920 921 922 923 924 925 926
	r.rcall = NULL;
	r.m = m;
	init_waitqueue_head(&r.wqueue);

	if (rc)
		*rc = NULL;

927 928 929 930 931 932
	sigpending = 0;
	if (signal_pending(current)) {
		sigpending = 1;
		clear_thread_flag(TIF_SIGPENDING);
	}

933
	req = p9_send_request(m, tc, p9_conn_rpc_cb, &r);
934 935
	if (IS_ERR(req)) {
		err = PTR_ERR(req);
936
		P9_DPRINTK(P9_DEBUG_MUX, "error %d\n", err);
937
		return err;
938 939 940 941 942 943
	}

	err = wait_event_interruptible(r.wqueue, r.rcall != NULL || r.err < 0);
	if (r.err < 0)
		err = r.err;

944 945 946
	if (err == -ERESTARTSYS && m->trans->status == Connected
							&& m->err == 0) {
		if (p9_mux_flush_request(m, req)) {
947 948 949 950 951
			/* wait until we get response of the flush message */
			do {
				clear_thread_flag(TIF_SIGPENDING);
				err = wait_event_interruptible(r.wqueue,
					r.rcall || r.err);
952 953
			} while (!r.rcall && !r.err && err == -ERESTARTSYS &&
				m->trans->status == Connected && !m->err);
954 955

			err = -ERESTARTSYS;
956 957 958
		}
		sigpending = 1;
	}
959

960
	if (sigpending) {
961 962 963
		spin_lock_irqsave(&current->sighand->siglock, flags);
		recalc_sigpending();
		spin_unlock_irqrestore(&current->sighand->siglock, flags);
964 965
	}

966 967 968
	if (rc)
		*rc = r.rcall;
	else
969
		kfree(r.rcall);
970

971
	p9_mux_free_request(m, req);
972 973
	if (err > 0)
		err = -EIO;
974 975 976

	return err;
}
977
EXPORT_SYMBOL(p9_conn_rpc);
978

979
#ifdef P9_NONBLOCK
980
/**
981
 * p9_conn_rpcnb - sends 9P request without waiting for response.
982 983 984 985 986
 * @m: mux data
 * @tc: request to be sent
 * @cb: callback function to be called when response arrives
 * @cba: value to pass to the callback function
 */
987 988
int p9_conn_rpcnb(struct p9_conn *m, struct p9_fcall *tc,
		   p9_conn_req_callback cb, void *a)
989 990
{
	int err;
991
	struct p9_req *req;
992

993
	req = p9_send_request(m, tc, cb, a);
994 995
	if (IS_ERR(req)) {
		err = PTR_ERR(req);
996
		P9_DPRINTK(P9_DEBUG_MUX, "error %d\n", err);
997 998
		return PTR_ERR(req);
	}
999

1000
	P9_DPRINTK(P9_DEBUG_MUX, "mux %p tc %p tag %d\n", m, tc, req->tag);
1001 1002
	return 0;
}
1003 1004
EXPORT_SYMBOL(p9_conn_rpcnb);
#endif /* P9_NONBLOCK */
1005 1006

/**
1007
 * p9_conn_cancel - cancel all pending requests with error
1008 1009 1010
 * @m: mux data
 * @err: error code
 */
1011
void p9_conn_cancel(struct p9_conn *m, int err)
1012
{
1013
	struct p9_req *req, *rtmp;
1014 1015
	LIST_HEAD(cancel_list);

1016
	P9_DPRINTK(P9_DEBUG_ERROR, "mux %p err %d\n", m, err);
1017 1018 1019 1020 1021
	m->err = err;
	spin_lock(&m->lock);
	list_for_each_entry_safe(req, rtmp, &m->req_list, req_list) {
		list_move(&req->req_list, &cancel_list);
	}
1022 1023 1024
	list_for_each_entry_safe(req, rtmp, &m->unsent_req_list, req_list) {
		list_move(&req->req_list, &cancel_list);
	}
1025 1026 1027 1028 1029 1030 1031 1032
	spin_unlock(&m->lock);

	list_for_each_entry_safe(req, rtmp, &cancel_list, req_list) {
		list_del(&req->req_list);
		if (!req->err)
			req->err = err;

		if (req->cb)
1033
			(*req->cb) (req, req->cba);
1034 1035 1036 1037 1038 1039
		else
			kfree(req->rcall);
	}

	wake_up(&m->equeue);
}
1040
EXPORT_SYMBOL(p9_conn_cancel);
1041

1042
static u16 p9_mux_get_tag(struct p9_conn *m)
1043 1044 1045
{
	int tag;

1046
	tag = p9_idpool_get(m->tagpool);
1047
	if (tag < 0)
1048
		return P9_NOTAG;
1049 1050 1051 1052
	else
		return (u16) tag;
}

1053
static void p9_mux_put_tag(struct p9_conn *m, u16 tag)
1054
{
1055 1056
	if (tag != P9_NOTAG && p9_idpool_check(tag, m->tagpool))
		p9_idpool_put(tag, m->tagpool);
1057
}