svc_xprt.c 37.2 KB
Newer Older
T
Tom Tucker 已提交
1 2 3 4 5 6 7 8 9
/*
 * linux/net/sunrpc/svc_xprt.c
 *
 * Author: Tom Tucker <tom@opengridcomputing.com>
 */

#include <linux/sched.h>
#include <linux/errno.h>
#include <linux/freezer.h>
10
#include <linux/kthread.h>
11
#include <linux/slab.h>
T
Tom Tucker 已提交
12
#include <net/sock.h>
13
#include <linux/sunrpc/addr.h>
T
Tom Tucker 已提交
14 15
#include <linux/sunrpc/stats.h>
#include <linux/sunrpc/svc_xprt.h>
16
#include <linux/sunrpc/svcsock.h>
17
#include <linux/sunrpc/xprt.h>
18
#include <linux/module.h>
19
#include <linux/netdevice.h>
20
#include <trace/events/sunrpc.h>
T
Tom Tucker 已提交
21 22 23

#define RPCDBG_FACILITY	RPCDBG_SVCXPRT

24 25 26 27
static struct svc_deferred_req *svc_deferred_dequeue(struct svc_xprt *xprt);
static int svc_deferred_recv(struct svc_rqst *rqstp);
static struct cache_deferred_req *svc_defer(struct cache_req *req);
static void svc_age_temp_xprts(unsigned long closure);
28
static void svc_delete_xprt(struct svc_xprt *xprt);
29 30 31 32 33 34 35 36

/* apparently the "standard" is that clients close
 * idle connections after 5 minutes, servers after
 * 6 minutes
 *   http://www.connectathon.org/talks96/nfstcp.pdf
 */
static int svc_conn_age_period = 6*60;

T
Tom Tucker 已提交
37 38 39 40
/* List of registered transport classes */
static DEFINE_SPINLOCK(svc_xprt_class_lock);
static LIST_HEAD(svc_xprt_class_list);

41 42 43 44 45
/* SMP locking strategy:
 *
 *	svc_pool->sp_lock protects most of the fields of that pool.
 *	svc_serv->sv_lock protects sv_tempsocks, sv_permsocks, sv_tmpcnt.
 *	when both need to be taken (rare), svc_serv->sv_lock is first.
46
 *	The "service mutex" protects svc_serv->sv_nrthread.
47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70
 *	svc_sock->sk_lock protects the svc_sock->sk_deferred list
 *             and the ->sk_info_authunix cache.
 *
 *	The XPT_BUSY bit in xprt->xpt_flags prevents a transport being
 *	enqueued multiply. During normal transport processing this bit
 *	is set by svc_xprt_enqueue and cleared by svc_xprt_received.
 *	Providers should not manipulate this bit directly.
 *
 *	Some flags can be set to certain values at any time
 *	providing that certain rules are followed:
 *
 *	XPT_CONN, XPT_DATA:
 *		- Can be set or cleared at any time.
 *		- After a set, svc_xprt_enqueue must be called to enqueue
 *		  the transport for processing.
 *		- After a clear, the transport must be read/accepted.
 *		  If this succeeds, it must be set again.
 *	XPT_CLOSE:
 *		- Can set at any time. It is never cleared.
 *      XPT_DEAD:
 *		- Can only be set while XPT_BUSY is held which ensures
 *		  that no other thread will be using the transport or will
 *		  try to set XPT_DEAD.
 */
T
Tom Tucker 已提交
71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101
int svc_reg_xprt_class(struct svc_xprt_class *xcl)
{
	struct svc_xprt_class *cl;
	int res = -EEXIST;

	dprintk("svc: Adding svc transport class '%s'\n", xcl->xcl_name);

	INIT_LIST_HEAD(&xcl->xcl_list);
	spin_lock(&svc_xprt_class_lock);
	/* Make sure there isn't already a class with the same name */
	list_for_each_entry(cl, &svc_xprt_class_list, xcl_list) {
		if (strcmp(xcl->xcl_name, cl->xcl_name) == 0)
			goto out;
	}
	list_add_tail(&xcl->xcl_list, &svc_xprt_class_list);
	res = 0;
out:
	spin_unlock(&svc_xprt_class_lock);
	return res;
}
EXPORT_SYMBOL_GPL(svc_reg_xprt_class);

void svc_unreg_xprt_class(struct svc_xprt_class *xcl)
{
	dprintk("svc: Removing svc transport class '%s'\n", xcl->xcl_name);
	spin_lock(&svc_xprt_class_lock);
	list_del_init(&xcl->xcl_list);
	spin_unlock(&svc_xprt_class_lock);
}
EXPORT_SYMBOL_GPL(svc_unreg_xprt_class);

102 103 104 105 106
/*
 * Format the transport list for printing
 */
int svc_print_xprts(char *buf, int maxlen)
{
107
	struct svc_xprt_class *xcl;
108 109 110 111 112
	char tmpstr[80];
	int len = 0;
	buf[0] = '\0';

	spin_lock(&svc_xprt_class_lock);
113
	list_for_each_entry(xcl, &svc_xprt_class_list, xcl_list) {
114 115 116 117 118 119 120 121 122 123 124 125 126 127
		int slen;

		sprintf(tmpstr, "%s %d\n", xcl->xcl_name, xcl->xcl_max_payload);
		slen = strlen(tmpstr);
		if (len + slen > maxlen)
			break;
		len += slen;
		strcat(buf, tmpstr);
	}
	spin_unlock(&svc_xprt_class_lock);

	return len;
}

T
Tom Tucker 已提交
128 129 130 131 132
static void svc_xprt_free(struct kref *kref)
{
	struct svc_xprt *xprt =
		container_of(kref, struct svc_xprt, xpt_ref);
	struct module *owner = xprt->xpt_class->xcl_owner;
133 134
	if (test_bit(XPT_CACHE_AUTH, &xprt->xpt_flags))
		svcauth_unix_info_release(xprt);
P
Pavel Emelyanov 已提交
135
	put_net(xprt->xpt_net);
136 137 138
	/* See comment on corresponding get in xs_setup_bc_tcp(): */
	if (xprt->xpt_bc_xprt)
		xprt_put(xprt->xpt_bc_xprt);
T
Tom Tucker 已提交
139 140 141 142 143 144 145 146 147 148
	xprt->xpt_ops->xpo_free(xprt);
	module_put(owner);
}

void svc_xprt_put(struct svc_xprt *xprt)
{
	kref_put(&xprt->xpt_ref, svc_xprt_free);
}
EXPORT_SYMBOL_GPL(svc_xprt_put);

T
Tom Tucker 已提交
149 150 151 152
/*
 * Called by transport drivers to initialize the transport independent
 * portion of the transport instance.
 */
153 154
void svc_xprt_init(struct net *net, struct svc_xprt_class *xcl,
		   struct svc_xprt *xprt, struct svc_serv *serv)
T
Tom Tucker 已提交
155 156 157 158
{
	memset(xprt, 0, sizeof(*xprt));
	xprt->xpt_class = xcl;
	xprt->xpt_ops = xcl->xcl_ops;
T
Tom Tucker 已提交
159
	kref_init(&xprt->xpt_ref);
160
	xprt->xpt_server = serv;
161 162
	INIT_LIST_HEAD(&xprt->xpt_list);
	INIT_LIST_HEAD(&xprt->xpt_ready);
163
	INIT_LIST_HEAD(&xprt->xpt_deferred);
164
	INIT_LIST_HEAD(&xprt->xpt_users);
165
	mutex_init(&xprt->xpt_mutex);
166
	spin_lock_init(&xprt->xpt_lock);
167
	set_bit(XPT_BUSY, &xprt->xpt_flags);
168
	rpc_init_wait_queue(&xprt->xpt_bc_pending, "xpt_bc_pending");
169
	xprt->xpt_net = get_net(net);
T
Tom Tucker 已提交
170 171
}
EXPORT_SYMBOL_GPL(svc_xprt_init);
172

173 174
static struct svc_xprt *__svc_xpo_create(struct svc_xprt_class *xcl,
					 struct svc_serv *serv,
175
					 struct net *net,
176 177 178
					 const int family,
					 const unsigned short port,
					 int flags)
179 180 181
{
	struct sockaddr_in sin = {
		.sin_family		= AF_INET,
A
Al Viro 已提交
182
		.sin_addr.s_addr	= htonl(INADDR_ANY),
183 184
		.sin_port		= htons(port),
	};
E
Eric Dumazet 已提交
185
#if IS_ENABLED(CONFIG_IPV6)
186 187 188 189 190
	struct sockaddr_in6 sin6 = {
		.sin6_family		= AF_INET6,
		.sin6_addr		= IN6ADDR_ANY_INIT,
		.sin6_port		= htons(port),
	};
E
Eric Dumazet 已提交
191
#endif
192 193 194
	struct sockaddr *sap;
	size_t len;

195 196
	switch (family) {
	case PF_INET:
197 198 199
		sap = (struct sockaddr *)&sin;
		len = sizeof(sin);
		break;
E
Eric Dumazet 已提交
200
#if IS_ENABLED(CONFIG_IPV6)
201
	case PF_INET6:
202 203 204
		sap = (struct sockaddr *)&sin6;
		len = sizeof(sin6);
		break;
E
Eric Dumazet 已提交
205
#endif
206 207 208 209
	default:
		return ERR_PTR(-EAFNOSUPPORT);
	}

210
	return xcl->xcl_ops->xpo_create(serv, net, sap, len, flags);
211 212
}

213 214 215 216 217 218 219 220 221 222
/*
 * svc_xprt_received conditionally queues the transport for processing
 * by another thread. The caller must hold the XPT_BUSY bit and must
 * not thereafter touch transport data.
 *
 * Note: XPT_DATA only gets cleared when a read-attempt finds no (or
 * insufficient) data.
 */
static void svc_xprt_received(struct svc_xprt *xprt)
{
223 224
	if (!test_bit(XPT_BUSY, &xprt->xpt_flags)) {
		WARN_ONCE(1, "xprt=0x%p already busy!", xprt);
225
		return;
226 227
	}

228
	/* As soon as we clear busy, the xprt could be closed and
229
	 * 'put', so we need a reference to call svc_enqueue_xprt with:
230 231
	 */
	svc_xprt_get(xprt);
232
	smp_mb__before_atomic();
233
	clear_bit(XPT_BUSY, &xprt->xpt_flags);
234
	xprt->xpt_server->sv_ops->svo_enqueue_xprt(xprt);
235 236 237
	svc_xprt_put(xprt);
}

238 239 240 241 242 243 244 245 246
void svc_add_new_perm_xprt(struct svc_serv *serv, struct svc_xprt *new)
{
	clear_bit(XPT_TEMP, &new->xpt_flags);
	spin_lock_bh(&serv->sv_lock);
	list_add(&new->xpt_list, &serv->sv_permsocks);
	spin_unlock_bh(&serv->sv_lock);
	svc_xprt_received(new);
}

247
int svc_create_xprt(struct svc_serv *serv, const char *xprt_name,
248 249
		    struct net *net, const int family,
		    const unsigned short port, int flags)
250 251 252
{
	struct svc_xprt_class *xcl;

253 254 255
	dprintk("svc: creating transport %s[%d]\n", xprt_name, port);
	spin_lock(&svc_xprt_class_lock);
	list_for_each_entry(xcl, &svc_xprt_class_list, xcl_list) {
256
		struct svc_xprt *newxprt;
257
		unsigned short newport;
258 259 260 261 262 263 264 265

		if (strcmp(xprt_name, xcl->xcl_name))
			continue;

		if (!try_module_get(xcl->xcl_owner))
			goto err;

		spin_unlock(&svc_xprt_class_lock);
266
		newxprt = __svc_xpo_create(xcl, serv, net, family, port, flags);
267 268 269
		if (IS_ERR(newxprt)) {
			module_put(xcl->xcl_owner);
			return PTR_ERR(newxprt);
270
		}
271
		svc_add_new_perm_xprt(serv, newxprt);
272 273
		newport = svc_xprt_local_port(newxprt);
		return newport;
274
	}
275
 err:
276 277
	spin_unlock(&svc_xprt_class_lock);
	dprintk("svc: transport %s not found\n", xprt_name);
278 279 280 281

	/* This errno is exposed to user space.  Provide a reasonable
	 * perror msg for a bad transport. */
	return -EPROTONOSUPPORT;
282 283
}
EXPORT_SYMBOL_GPL(svc_create_xprt);
284 285 286 287 288 289 290 291 292 293 294 295 296

/*
 * Copy the local and remote xprt addresses to the rqstp structure
 */
void svc_xprt_copy_addrs(struct svc_rqst *rqstp, struct svc_xprt *xprt)
{
	memcpy(&rqstp->rq_addr, &xprt->xpt_remote, xprt->xpt_remotelen);
	rqstp->rq_addrlen = xprt->xpt_remotelen;

	/*
	 * Destination address in request is needed for binding the
	 * source address in RPC replies/callbacks later.
	 */
297 298
	memcpy(&rqstp->rq_daddr, &xprt->xpt_local, xprt->xpt_locallen);
	rqstp->rq_daddrlen = xprt->xpt_locallen;
299 300 301
}
EXPORT_SYMBOL_GPL(svc_xprt_copy_addrs);

302 303 304 305 306 307 308 309 310 311 312 313 314
/**
 * svc_print_addr - Format rq_addr field for printing
 * @rqstp: svc_rqst struct containing address to print
 * @buf: target buffer for formatted address
 * @len: length of target buffer
 *
 */
char *svc_print_addr(struct svc_rqst *rqstp, char *buf, size_t len)
{
	return __svc_print_addr(svc_addr(rqstp), buf, len);
}
EXPORT_SYMBOL_GPL(svc_print_addr);

J
J. Bruce Fields 已提交
315 316 317 318 319 320 321 322 323
static bool svc_xprt_has_something_to_do(struct svc_xprt *xprt)
{
	if (xprt->xpt_flags & ((1<<XPT_CONN)|(1<<XPT_CLOSE)))
		return true;
	if (xprt->xpt_flags & ((1<<XPT_DATA)|(1<<XPT_DEFERRED)))
		return xprt->xpt_ops->xpo_has_wspace(xprt);
	return false;
}

324
void svc_xprt_do_enqueue(struct svc_xprt *xprt)
325 326
{
	struct svc_pool *pool;
327
	struct svc_rqst	*rqstp = NULL;
328
	int cpu;
329
	bool queued = false;
330

J
J. Bruce Fields 已提交
331
	if (!svc_xprt_has_something_to_do(xprt))
332
		goto out;
333 334 335 336 337 338 339 340 341

	/* Mark transport as busy. It will remain in this state until
	 * the provider calls svc_xprt_received. We update XPT_BUSY
	 * atomically because it also guards against trying to enqueue
	 * the transport twice.
	 */
	if (test_and_set_bit(XPT_BUSY, &xprt->xpt_flags)) {
		/* Don't enqueue transport while already enqueued */
		dprintk("svc: transport %p busy, not enqueued\n", xprt);
342
		goto out;
343 344
	}

345 346 347
	cpu = get_cpu();
	pool = svc_pool_for_cpu(xprt->xpt_server, cpu);

348
	atomic_long_inc(&pool->sp_stats.packets);
349

350 351 352 353 354 355 356 357 358 359 360 361 362
redo_search:
	/* find a thread for this xprt */
	rcu_read_lock();
	list_for_each_entry_rcu(rqstp, &pool->sp_all_threads, rq_all) {
		/* Do a lockless check first */
		if (test_bit(RQ_BUSY, &rqstp->rq_flags))
			continue;

		/*
		 * Once the xprt has been queued, it can only be dequeued by
		 * the task that intends to service it. All we can do at that
		 * point is to try to wake this thread back up so that it can
		 * do so.
363
		 */
364 365 366 367 368 369 370 371 372 373 374 375 376 377 378
		if (!queued) {
			spin_lock_bh(&rqstp->rq_lock);
			if (test_and_set_bit(RQ_BUSY, &rqstp->rq_flags)) {
				/* already busy, move on... */
				spin_unlock_bh(&rqstp->rq_lock);
				continue;
			}

			/* this one will do */
			rqstp->rq_xprt = xprt;
			svc_xprt_get(xprt);
			spin_unlock_bh(&rqstp->rq_lock);
		}
		rcu_read_unlock();

379
		atomic_long_inc(&pool->sp_stats.threads_woken);
380 381
		wake_up_process(rqstp->rq_task);
		put_cpu();
382
		goto out;
383 384 385 386 387 388 389 390 391 392 393
	}
	rcu_read_unlock();

	/*
	 * We didn't find an idle thread to use, so we need to queue the xprt.
	 * Do so and then search again. If we find one, we can't hook this one
	 * up to it directly but we can wake the thread up in the hopes that it
	 * will pick it up once it searches for a xprt to service.
	 */
	if (!queued) {
		queued = true;
394
		dprintk("svc: transport %p put into queue\n", xprt);
395
		spin_lock_bh(&pool->sp_lock);
396
		list_add_tail(&xprt->xpt_ready, &pool->sp_sockets);
397
		pool->sp_stats.sockets_queued++;
398 399
		spin_unlock_bh(&pool->sp_lock);
		goto redo_search;
400
	}
401
	rqstp = NULL;
402
	put_cpu();
403 404
out:
	trace_svc_xprt_do_enqueue(xprt, rqstp);
405
}
406
EXPORT_SYMBOL_GPL(svc_xprt_do_enqueue);
407 408 409 410 411 412 413 414 415 416

/*
 * Queue up a transport with data pending. If there are idle nfsd
 * processes, wake 'em up.
 *
 */
void svc_xprt_enqueue(struct svc_xprt *xprt)
{
	if (test_bit(XPT_BUSY, &xprt->xpt_flags))
		return;
417
	xprt->xpt_server->sv_ops->svo_enqueue_xprt(xprt);
418
}
419 420 421
EXPORT_SYMBOL_GPL(svc_xprt_enqueue);

/*
422
 * Dequeue the first transport, if there is one.
423 424 425
 */
static struct svc_xprt *svc_xprt_dequeue(struct svc_pool *pool)
{
426
	struct svc_xprt	*xprt = NULL;
427 428

	if (list_empty(&pool->sp_sockets))
429
		goto out;
430

431 432 433 434 435 436
	spin_lock_bh(&pool->sp_lock);
	if (likely(!list_empty(&pool->sp_sockets))) {
		xprt = list_first_entry(&pool->sp_sockets,
					struct svc_xprt, xpt_ready);
		list_del_init(&xprt->xpt_ready);
		svc_xprt_get(xprt);
437

438 439 440 441
		dprintk("svc: transport %p dequeued, inuse=%d\n",
			xprt, atomic_read(&xprt->xpt_ref.refcount));
	}
	spin_unlock_bh(&pool->sp_lock);
442 443
out:
	trace_svc_xprt_dequeue(xprt);
444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465
	return xprt;
}

/**
 * svc_reserve - change the space reserved for the reply to a request.
 * @rqstp:  The request in question
 * @space: new max space to reserve
 *
 * Each request reserves some space on the output queue of the transport
 * to make sure the reply fits.  This function reduces that reserved
 * space to be the amount of space used already, plus @space.
 *
 */
void svc_reserve(struct svc_rqst *rqstp, int space)
{
	space += rqstp->rq_res.head[0].iov_len;

	if (space < rqstp->rq_reserved) {
		struct svc_xprt *xprt = rqstp->rq_xprt;
		atomic_sub((rqstp->rq_reserved - space), &xprt->xpt_reserved);
		rqstp->rq_reserved = space;

466 467
		if (xprt->xpt_ops->xpo_adjust_wspace)
			xprt->xpt_ops->xpo_adjust_wspace(xprt);
468 469 470
		svc_xprt_enqueue(xprt);
	}
}
471
EXPORT_SYMBOL_GPL(svc_reserve);
472 473 474 475 476 477 478

static void svc_xprt_release(struct svc_rqst *rqstp)
{
	struct svc_xprt	*xprt = rqstp->rq_xprt;

	rqstp->rq_xprt->xpt_ops->xpo_release_rqst(rqstp);

479 480 481
	kfree(rqstp->rq_deferred);
	rqstp->rq_deferred = NULL;

482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503
	svc_free_res_pages(rqstp);
	rqstp->rq_res.page_len = 0;
	rqstp->rq_res.page_base = 0;

	/* Reset response buffer and release
	 * the reservation.
	 * But first, check that enough space was reserved
	 * for the reply, otherwise we have a bug!
	 */
	if ((rqstp->rq_res.len) >  rqstp->rq_reserved)
		printk(KERN_ERR "RPC request reserved %d but used %d\n",
		       rqstp->rq_reserved,
		       rqstp->rq_res.len);

	rqstp->rq_res.head[0].iov_len = 0;
	svc_reserve(rqstp, 0);
	rqstp->rq_xprt = NULL;

	svc_xprt_put(xprt);
}

/*
504 505 506 507 508
 * Some svc_serv's will have occasional work to do, even when a xprt is not
 * waiting to be serviced. This function is there to "kick" a task in one of
 * those services so that it can wake up and do that work. Note that we only
 * bother with pool 0 as we don't need to wake up more than one thread for
 * this purpose.
509 510 511 512 513 514
 */
void svc_wake_up(struct svc_serv *serv)
{
	struct svc_rqst	*rqstp;
	struct svc_pool *pool;

515 516
	pool = &serv->sv_pools[0];

517 518 519 520 521 522
	rcu_read_lock();
	list_for_each_entry_rcu(rqstp, &pool->sp_all_threads, rq_all) {
		/* skip any that aren't queued */
		if (test_bit(RQ_BUSY, &rqstp->rq_flags))
			continue;
		rcu_read_unlock();
523 524
		dprintk("svc: daemon %p woken up.\n", rqstp);
		wake_up_process(rqstp->rq_task);
525
		trace_svc_wake_up(rqstp->rq_task->pid);
526 527 528 529 530 531 532
		return;
	}
	rcu_read_unlock();

	/* No free entries available */
	set_bit(SP_TASK_PENDING, &pool->sp_flags);
	smp_wmb();
533
	trace_svc_wake_up(0);
534
}
535
EXPORT_SYMBOL_GPL(svc_wake_up);
536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551

int svc_port_is_privileged(struct sockaddr *sin)
{
	switch (sin->sa_family) {
	case AF_INET:
		return ntohs(((struct sockaddr_in *)sin)->sin_port)
			< PROT_SOCK;
	case AF_INET6:
		return ntohs(((struct sockaddr_in6 *)sin)->sin6_port)
			< PROT_SOCK;
	default:
		return 0;
	}
}

/*
552 553 554 555
 * Make sure that we don't have too many active connections. If we have,
 * something must be dropped. It's not clear what will happen if we allow
 * "too many" connections, but when dealing with network-facing software,
 * we have to code defensively. Here we do that by imposing hard limits.
556 557 558 559 560 561 562 563
 *
 * There's no point in trying to do random drop here for DoS
 * prevention. The NFS clients does 1 reconnect in 15 seconds. An
 * attacker can easily beat that.
 *
 * The only somewhat efficient mechanism would be if drop old
 * connections from the same IP first. But right now we don't even
 * record the client IP in svc_sock.
564 565 566 567
 *
 * single-threaded services that expect a lot of clients will probably
 * need to set sv_maxconn to override the default value which is based
 * on the number of threads
568 569 570
 */
static void svc_check_conn_limits(struct svc_serv *serv)
{
571 572 573 574
	unsigned int limit = serv->sv_maxconn ? serv->sv_maxconn :
				(serv->sv_nrthreads+3) * 20;

	if (serv->sv_tmpcnt > limit) {
575 576 577
		struct svc_xprt *xprt = NULL;
		spin_lock_bh(&serv->sv_lock);
		if (!list_empty(&serv->sv_tempsocks)) {
578 579 580 581 582
			/* Try to help the admin */
			net_notice_ratelimited("%s: too many open connections, consider increasing the %s\n",
					       serv->sv_name, serv->sv_maxconn ?
					       "max number of connections" :
					       "number of threads");
583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601
			/*
			 * Always select the oldest connection. It's not fair,
			 * but so is life
			 */
			xprt = list_entry(serv->sv_tempsocks.prev,
					  struct svc_xprt,
					  xpt_list);
			set_bit(XPT_CLOSE, &xprt->xpt_flags);
			svc_xprt_get(xprt);
		}
		spin_unlock_bh(&serv->sv_lock);

		if (xprt) {
			svc_xprt_enqueue(xprt);
			svc_xprt_put(xprt);
		}
	}
}

602
static int svc_alloc_arg(struct svc_rqst *rqstp)
603
{
J
J. Bruce Fields 已提交
604 605 606 607
	struct svc_serv *serv = rqstp->rq_server;
	struct xdr_buf *arg;
	int pages;
	int i;
608 609 610

	/* now allocate needed pages.  If we get a failure, sleep briefly */
	pages = (serv->sv_max_mesg + PAGE_SIZE) / PAGE_SIZE;
611 612 613 614
	WARN_ON_ONCE(pages >= RPCSVC_MAXPAGES);
	if (pages >= RPCSVC_MAXPAGES)
		/* use as many pages as possible */
		pages = RPCSVC_MAXPAGES - 1;
615 616 617 618
	for (i = 0; i < pages ; i++)
		while (rqstp->rq_pages[i] == NULL) {
			struct page *p = alloc_page(GFP_KERNEL);
			if (!p) {
619 620 621
				set_current_state(TASK_INTERRUPTIBLE);
				if (signalled() || kthread_should_stop()) {
					set_current_state(TASK_RUNNING);
622
					return -EINTR;
623 624
				}
				schedule_timeout(msecs_to_jiffies(500));
625 626 627
			}
			rqstp->rq_pages[i] = p;
		}
628
	rqstp->rq_page_end = &rqstp->rq_pages[i];
629 630 631 632 633 634 635 636 637 638 639 640
	rqstp->rq_pages[i++] = NULL; /* this might be seen in nfs_read_actor */

	/* Make arg->head point to first page and arg->pages point to rest */
	arg = &rqstp->rq_arg;
	arg->head[0].iov_base = page_address(rqstp->rq_pages[0]);
	arg->head[0].iov_len = PAGE_SIZE;
	arg->pages = rqstp->rq_pages + 1;
	arg->page_base = 0;
	/* save at least one page for response */
	arg->page_len = (pages-2)*PAGE_SIZE;
	arg->len = (pages-1)*PAGE_SIZE;
	arg->tail[0].iov_len = 0;
J
J. Bruce Fields 已提交
641 642
	return 0;
}
643

644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667
static bool
rqst_should_sleep(struct svc_rqst *rqstp)
{
	struct svc_pool		*pool = rqstp->rq_pool;

	/* did someone call svc_wake_up? */
	if (test_and_clear_bit(SP_TASK_PENDING, &pool->sp_flags))
		return false;

	/* was a socket queued? */
	if (!list_empty(&pool->sp_sockets))
		return false;

	/* are we shutting down? */
	if (signalled() || kthread_should_stop())
		return false;

	/* are we freezing? */
	if (freezing(current))
		return false;

	return true;
}

668
static struct svc_xprt *svc_get_next_xprt(struct svc_rqst *rqstp, long timeout)
J
J. Bruce Fields 已提交
669 670 671
{
	struct svc_xprt *xprt;
	struct svc_pool		*pool = rqstp->rq_pool;
672
	long			time_left = 0;
673

674 675 676
	/* rq_xprt should be clear on entry */
	WARN_ON_ONCE(rqstp->rq_xprt);

677 678 679 680 681
	/* Normally we will wait up to 5 seconds for any required
	 * cache information to be provided.
	 */
	rqstp->rq_chandle.thread_wait = 5*HZ;

682 683 684
	xprt = svc_xprt_dequeue(pool);
	if (xprt) {
		rqstp->rq_xprt = xprt;
685 686

		/* As there is a shortage of threads and this request
J
J. Bruce Fields 已提交
687
		 * had to be queued, don't allow the thread to wait so
688 689 690
		 * long for cache updates.
		 */
		rqstp->rq_chandle.thread_wait = 1*HZ;
691
		clear_bit(SP_TASK_PENDING, &pool->sp_flags);
692 693
		return xprt;
	}
694

695 696 697 698 699 700 701
	/*
	 * We have to be able to interrupt this wait
	 * to bring down the daemons ...
	 */
	set_current_state(TASK_INTERRUPTIBLE);
	clear_bit(RQ_BUSY, &rqstp->rq_flags);
	smp_mb();
702

703 704 705 706
	if (likely(rqst_should_sleep(rqstp)))
		time_left = schedule_timeout(timeout);
	else
		__set_current_state(TASK_RUNNING);
707

708
	try_to_freeze();
709

710 711 712
	spin_lock_bh(&rqstp->rq_lock);
	set_bit(RQ_BUSY, &rqstp->rq_flags);
	spin_unlock_bh(&rqstp->rq_lock);
713

714 715 716 717 718 719 720 721 722 723
	xprt = rqstp->rq_xprt;
	if (xprt != NULL)
		return xprt;

	if (!time_left)
		atomic_long_inc(&pool->sp_stats.threads_timedout);

	if (signalled() || kthread_should_stop())
		return ERR_PTR(-EINTR);
	return ERR_PTR(-EAGAIN);
J
J. Bruce Fields 已提交
724 725
}

726
static void svc_add_new_temp_xprt(struct svc_serv *serv, struct svc_xprt *newxpt)
727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742
{
	spin_lock_bh(&serv->sv_lock);
	set_bit(XPT_TEMP, &newxpt->xpt_flags);
	list_add(&newxpt->xpt_list, &serv->sv_tempsocks);
	serv->sv_tmpcnt++;
	if (serv->sv_temptimer.function == NULL) {
		/* setup timer to age temp transports */
		setup_timer(&serv->sv_temptimer, svc_age_temp_xprts,
			    (unsigned long)serv);
		mod_timer(&serv->sv_temptimer,
			  jiffies + svc_conn_age_period * HZ);
	}
	spin_unlock_bh(&serv->sv_lock);
	svc_xprt_received(newxpt);
}

J
J. Bruce Fields 已提交
743 744 745 746
static int svc_handle_xprt(struct svc_rqst *rqstp, struct svc_xprt *xprt)
{
	struct svc_serv *serv = rqstp->rq_server;
	int len = 0;
747

748 749 750
	if (test_bit(XPT_CLOSE, &xprt->xpt_flags)) {
		dprintk("svc_recv: found XPT_CLOSE\n");
		svc_delete_xprt(xprt);
751
		/* Leave XPT_BUSY set on the dead xprt: */
752
		goto out;
753 754
	}
	if (test_bit(XPT_LISTENER, &xprt->xpt_flags)) {
755
		struct svc_xprt *newxpt;
756 757 758 759 760 761
		/*
		 * We know this module_get will succeed because the
		 * listener holds a reference too
		 */
		__module_get(xprt->xpt_class->xcl_owner);
		svc_check_conn_limits(xprt->xpt_server);
762
		newxpt = xprt->xpt_ops->xpo_accept(xprt);
763 764
		if (newxpt)
			svc_add_new_temp_xprt(serv, newxpt);
765 766
		else
			module_put(xprt->xpt_class->xcl_owner);
767
	} else {
J
J. Bruce Fields 已提交
768
		/* XPT_DATA|XPT_DEFERRED case: */
769
		dprintk("svc: server %p, pool %u, transport %p, inuse=%d\n",
J
J. Bruce Fields 已提交
770
			rqstp, rqstp->rq_pool->sp_id, xprt,
771 772
			atomic_read(&xprt->xpt_ref.refcount));
		rqstp->rq_deferred = svc_deferred_dequeue(xprt);
773
		if (rqstp->rq_deferred)
774
			len = svc_deferred_recv(rqstp);
775
		else
776 777
			len = xprt->xpt_ops->xpo_recvfrom(rqstp);
		dprintk("svc: got len=%d\n", len);
778 779
		rqstp->rq_reserved = serv->sv_max_mesg;
		atomic_add(rqstp->rq_reserved, &xprt->xpt_reserved);
780
	}
J
J. Bruce Fields 已提交
781
	/* clear XPT_BUSY: */
782
	svc_xprt_received(xprt);
783 784
out:
	trace_svc_handle_xprt(xprt, len);
J
J. Bruce Fields 已提交
785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805
	return len;
}

/*
 * Receive the next request on any transport.  This code is carefully
 * organised not to touch any cachelines in the shared svc_serv
 * structure, only cachelines in the local svc_pool.
 */
int svc_recv(struct svc_rqst *rqstp, long timeout)
{
	struct svc_xprt		*xprt = NULL;
	struct svc_serv		*serv = rqstp->rq_server;
	int			len, err;

	dprintk("svc: server %p waiting for data (to = %ld)\n",
		rqstp, timeout);

	if (rqstp->rq_xprt)
		printk(KERN_ERR
			"svc_recv: service %p, transport not NULL!\n",
			 rqstp);
806

J
J. Bruce Fields 已提交
807 808
	err = svc_alloc_arg(rqstp);
	if (err)
809
		goto out;
J
J. Bruce Fields 已提交
810 811 812

	try_to_freeze();
	cond_resched();
813
	err = -EINTR;
J
J. Bruce Fields 已提交
814
	if (signalled() || kthread_should_stop())
815
		goto out;
J
J. Bruce Fields 已提交
816 817

	xprt = svc_get_next_xprt(rqstp, timeout);
818 819 820 821
	if (IS_ERR(xprt)) {
		err = PTR_ERR(xprt);
		goto out;
	}
J
J. Bruce Fields 已提交
822 823

	len = svc_handle_xprt(rqstp, xprt);
824 825

	/* No data, incomplete (TCP) read, or accept() */
826
	err = -EAGAIN;
827
	if (len <= 0)
828
		goto out_release;
829

830 831
	clear_bit(XPT_OLD, &xprt->xpt_flags);

832 833 834 835
	if (xprt->xpt_ops->xpo_secure_port(rqstp))
		set_bit(RQ_SECURE, &rqstp->rq_flags);
	else
		clear_bit(RQ_SECURE, &rqstp->rq_flags);
836
	rqstp->rq_chandle.defer = svc_defer;
837
	rqstp->rq_xid = svc_getu32(&rqstp->rq_arg.head[0]);
838 839 840

	if (serv->sv_stats)
		serv->sv_stats->netcnt++;
841
	trace_svc_recv(rqstp, len);
842
	return len;
843
out_release:
844 845
	rqstp->rq_res.len = 0;
	svc_xprt_release(rqstp);
846 847 848
out:
	trace_svc_recv(rqstp, err);
	return err;
849
}
850
EXPORT_SYMBOL_GPL(svc_recv);
851 852 853 854 855 856 857 858 859

/*
 * Drop request
 */
void svc_drop(struct svc_rqst *rqstp)
{
	dprintk("svc: xprt %p dropped request\n", rqstp->rq_xprt);
	svc_xprt_release(rqstp);
}
860
EXPORT_SYMBOL_GPL(svc_drop);
861 862 863 864 865 866 867

/*
 * Return reply to client.
 */
int svc_send(struct svc_rqst *rqstp)
{
	struct svc_xprt	*xprt;
868
	int		len = -EFAULT;
869 870 871 872
	struct xdr_buf	*xb;

	xprt = rqstp->rq_xprt;
	if (!xprt)
873
		goto out;
874 875 876 877 878 879 880 881 882 883 884 885

	/* release the receive skb before sending the reply */
	rqstp->rq_xprt->xpt_ops->xpo_release_rqst(rqstp);

	/* calculate over-all length */
	xb = &rqstp->rq_res;
	xb->len = xb->head[0].iov_len +
		xb->page_len +
		xb->tail[0].iov_len;

	/* Grab mutex to serialize outgoing data. */
	mutex_lock(&xprt->xpt_mutex);
886 887
	if (test_bit(XPT_DEAD, &xprt->xpt_flags)
			|| test_bit(XPT_CLOSE, &xprt->xpt_flags))
888 889 890 891
		len = -ENOTCONN;
	else
		len = xprt->xpt_ops->xpo_sendto(rqstp);
	mutex_unlock(&xprt->xpt_mutex);
892
	rpc_wake_up(&xprt->xpt_bc_pending);
893 894 895
	svc_xprt_release(rqstp);

	if (len == -ECONNREFUSED || len == -ENOTCONN || len == -EAGAIN)
896 897 898
		len = 0;
out:
	trace_svc_send(rqstp, len);
899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927
	return len;
}

/*
 * Timer function to close old temporary transports, using
 * a mark-and-sweep algorithm.
 */
static void svc_age_temp_xprts(unsigned long closure)
{
	struct svc_serv *serv = (struct svc_serv *)closure;
	struct svc_xprt *xprt;
	struct list_head *le, *next;

	dprintk("svc_age_temp_xprts\n");

	if (!spin_trylock_bh(&serv->sv_lock)) {
		/* busy, try again 1 sec later */
		dprintk("svc_age_temp_xprts: busy\n");
		mod_timer(&serv->sv_temptimer, jiffies + HZ);
		return;
	}

	list_for_each_safe(le, next, &serv->sv_tempsocks) {
		xprt = list_entry(le, struct svc_xprt, xpt_list);

		/* First time through, just mark it OLD. Second time
		 * through, close it. */
		if (!test_and_set_bit(XPT_OLD, &xprt->xpt_flags))
			continue;
928 929
		if (atomic_read(&xprt->xpt_ref.refcount) > 1 ||
		    test_bit(XPT_BUSY, &xprt->xpt_flags))
930
			continue;
931
		list_del_init(le);
932 933 934 935 936 937
		set_bit(XPT_CLOSE, &xprt->xpt_flags);
		dprintk("queuing xprt %p for closing\n", xprt);

		/* a thread will dequeue and close it soon */
		svc_xprt_enqueue(xprt);
	}
938
	spin_unlock_bh(&serv->sv_lock);
939 940 941 942

	mod_timer(&serv->sv_temptimer, jiffies + svc_conn_age_period * HZ);
}

943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985
/* Close temporary transports whose xpt_local matches server_addr immediately
 * instead of waiting for them to be picked up by the timer.
 *
 * This is meant to be called from a notifier_block that runs when an ip
 * address is deleted.
 */
void svc_age_temp_xprts_now(struct svc_serv *serv, struct sockaddr *server_addr)
{
	struct svc_xprt *xprt;
	struct svc_sock *svsk;
	struct socket *sock;
	struct list_head *le, *next;
	LIST_HEAD(to_be_closed);
	struct linger no_linger = {
		.l_onoff = 1,
		.l_linger = 0,
	};

	spin_lock_bh(&serv->sv_lock);
	list_for_each_safe(le, next, &serv->sv_tempsocks) {
		xprt = list_entry(le, struct svc_xprt, xpt_list);
		if (rpc_cmp_addr(server_addr, (struct sockaddr *)
				&xprt->xpt_local)) {
			dprintk("svc_age_temp_xprts_now: found %p\n", xprt);
			list_move(le, &to_be_closed);
		}
	}
	spin_unlock_bh(&serv->sv_lock);

	while (!list_empty(&to_be_closed)) {
		le = to_be_closed.next;
		list_del_init(le);
		xprt = list_entry(le, struct svc_xprt, xpt_list);
		dprintk("svc_age_temp_xprts_now: closing %p\n", xprt);
		svsk = container_of(xprt, struct svc_sock, sk_xprt);
		sock = svsk->sk_sock;
		kernel_setsockopt(sock, SOL_SOCKET, SO_LINGER,
				  (char *)&no_linger, sizeof(no_linger));
		svc_close_xprt(xprt);
	}
}
EXPORT_SYMBOL_GPL(svc_age_temp_xprts_now);

986 987 988 989 990 991 992 993 994 995 996 997 998
static void call_xpt_users(struct svc_xprt *xprt)
{
	struct svc_xpt_user *u;

	spin_lock(&xprt->xpt_lock);
	while (!list_empty(&xprt->xpt_users)) {
		u = list_first_entry(&xprt->xpt_users, struct svc_xpt_user, list);
		list_del(&u->list);
		u->callback(u);
	}
	spin_unlock(&xprt->xpt_lock);
}

999 1000 1001
/*
 * Remove a dead transport
 */
1002
static void svc_delete_xprt(struct svc_xprt *xprt)
1003 1004
{
	struct svc_serv	*serv = xprt->xpt_server;
1005 1006 1007 1008
	struct svc_deferred_req *dr;

	/* Only do this once */
	if (test_and_set_bit(XPT_DEAD, &xprt->xpt_flags))
1009
		BUG();
1010 1011 1012 1013 1014

	dprintk("svc: svc_delete_xprt(%p)\n", xprt);
	xprt->xpt_ops->xpo_detach(xprt);

	spin_lock_bh(&serv->sv_lock);
1015
	list_del_init(&xprt->xpt_list);
1016
	WARN_ON_ONCE(!list_empty(&xprt->xpt_ready));
1017 1018
	if (test_bit(XPT_TEMP, &xprt->xpt_flags))
		serv->sv_tmpcnt--;
1019
	spin_unlock_bh(&serv->sv_lock);
1020

1021
	while ((dr = svc_deferred_dequeue(xprt)) != NULL)
1022 1023
		kfree(dr);

1024
	call_xpt_users(xprt);
1025
	svc_xprt_put(xprt);
1026 1027 1028 1029 1030 1031 1032 1033
}

void svc_close_xprt(struct svc_xprt *xprt)
{
	set_bit(XPT_CLOSE, &xprt->xpt_flags);
	if (test_and_set_bit(XPT_BUSY, &xprt->xpt_flags))
		/* someone else will have to effect the close */
		return;
J
J. Bruce Fields 已提交
1034 1035 1036 1037 1038 1039
	/*
	 * We expect svc_close_xprt() to work even when no threads are
	 * running (e.g., while configuring the server before starting
	 * any threads), so if the transport isn't busy, we delete
	 * it ourself:
	 */
1040 1041
	svc_delete_xprt(xprt);
}
1042
EXPORT_SYMBOL_GPL(svc_close_xprt);
1043

1044
static int svc_close_list(struct svc_serv *serv, struct list_head *xprt_list, struct net *net)
1045 1046
{
	struct svc_xprt *xprt;
1047
	int ret = 0;
1048

1049
	spin_lock(&serv->sv_lock);
1050
	list_for_each_entry(xprt, xprt_list, xpt_list) {
1051 1052
		if (xprt->xpt_net != net)
			continue;
1053
		ret++;
1054
		set_bit(XPT_CLOSE, &xprt->xpt_flags);
1055
		svc_xprt_enqueue(xprt);
1056
	}
1057
	spin_unlock(&serv->sv_lock);
1058
	return ret;
1059 1060
}

1061
static struct svc_xprt *svc_dequeue_net(struct svc_serv *serv, struct net *net)
1062
{
1063
	struct svc_pool *pool;
1064 1065
	struct svc_xprt *xprt;
	struct svc_xprt *tmp;
1066 1067 1068 1069 1070 1071
	int i;

	for (i = 0; i < serv->sv_nrpools; i++) {
		pool = &serv->sv_pools[i];

		spin_lock_bh(&pool->sp_lock);
1072
		list_for_each_entry_safe(xprt, tmp, &pool->sp_sockets, xpt_ready) {
1073 1074
			if (xprt->xpt_net != net)
				continue;
1075
			list_del_init(&xprt->xpt_ready);
1076 1077
			spin_unlock_bh(&pool->sp_lock);
			return xprt;
1078 1079 1080
		}
		spin_unlock_bh(&pool->sp_lock);
	}
1081
	return NULL;
1082 1083
}

1084
static void svc_clean_up_xprts(struct svc_serv *serv, struct net *net)
1085 1086
{
	struct svc_xprt *xprt;
1087

1088 1089
	while ((xprt = svc_dequeue_net(serv, net))) {
		set_bit(XPT_CLOSE, &xprt->xpt_flags);
1090
		svc_delete_xprt(xprt);
1091
	}
1092 1093
}

1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105
/*
 * Server threads may still be running (especially in the case where the
 * service is still running in other network namespaces).
 *
 * So we shut down sockets the same way we would on a running server, by
 * setting XPT_CLOSE, enqueuing, and letting a thread pick it up to do
 * the close.  In the case there are no such other threads,
 * threads running, svc_clean_up_xprts() does a simple version of a
 * server's main event loop, and in the case where there are other
 * threads, we may need to wait a little while and then check again to
 * see if they're done.
 */
1106
void svc_close_net(struct svc_serv *serv, struct net *net)
1107
{
1108
	int delay = 0;
1109

1110 1111 1112 1113 1114 1115
	while (svc_close_list(serv, &serv->sv_permsocks, net) +
	       svc_close_list(serv, &serv->sv_tempsocks, net)) {

		svc_clean_up_xprts(serv, net);
		msleep(delay++);
	}
1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127
}

/*
 * Handle defer and revisit of requests
 */

static void svc_revisit(struct cache_deferred_req *dreq, int too_many)
{
	struct svc_deferred_req *dr =
		container_of(dreq, struct svc_deferred_req, handle);
	struct svc_xprt *xprt = dr->xprt;

1128 1129 1130 1131 1132
	spin_lock(&xprt->xpt_lock);
	set_bit(XPT_DEFERRED, &xprt->xpt_flags);
	if (too_many || test_bit(XPT_DEAD, &xprt->xpt_flags)) {
		spin_unlock(&xprt->xpt_lock);
		dprintk("revisit canceled\n");
1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144
		svc_xprt_put(xprt);
		kfree(dr);
		return;
	}
	dprintk("revisit queued\n");
	dr->xprt = NULL;
	list_add(&dr->handle.recent, &xprt->xpt_deferred);
	spin_unlock(&xprt->xpt_lock);
	svc_xprt_enqueue(xprt);
	svc_xprt_put(xprt);
}

1145 1146 1147 1148 1149 1150 1151 1152 1153
/*
 * Save the request off for later processing. The request buffer looks
 * like this:
 *
 * <xprt-header><rpc-header><rpc-pagelist><rpc-tail>
 *
 * This code can only handle requests that consist of an xprt-header
 * and rpc-header.
 */
1154 1155 1156 1157 1158
static struct cache_deferred_req *svc_defer(struct cache_req *req)
{
	struct svc_rqst *rqstp = container_of(req, struct svc_rqst, rq_chandle);
	struct svc_deferred_req *dr;

1159
	if (rqstp->rq_arg.page_len || !test_bit(RQ_USEDEFERRAL, &rqstp->rq_flags))
1160 1161 1162 1163 1164
		return NULL; /* if more than a page, give up FIXME */
	if (rqstp->rq_deferred) {
		dr = rqstp->rq_deferred;
		rqstp->rq_deferred = NULL;
	} else {
1165 1166
		size_t skip;
		size_t size;
1167
		/* FIXME maybe discard if size too large */
1168
		size = sizeof(struct svc_deferred_req) + rqstp->rq_arg.len;
1169 1170 1171 1172 1173 1174 1175 1176 1177 1178
		dr = kmalloc(size, GFP_KERNEL);
		if (dr == NULL)
			return NULL;

		dr->handle.owner = rqstp->rq_server;
		dr->prot = rqstp->rq_prot;
		memcpy(&dr->addr, &rqstp->rq_addr, rqstp->rq_addrlen);
		dr->addrlen = rqstp->rq_addrlen;
		dr->daddr = rqstp->rq_daddr;
		dr->argslen = rqstp->rq_arg.len >> 2;
1179 1180 1181 1182 1183 1184
		dr->xprt_hlen = rqstp->rq_xprt_hlen;

		/* back up head to the start of the buffer and copy */
		skip = rqstp->rq_arg.len - rqstp->rq_arg.head[0].iov_len;
		memcpy(dr->args, rqstp->rq_arg.head[0].iov_base - skip,
		       dr->argslen << 2);
1185 1186 1187
	}
	svc_xprt_get(rqstp->rq_xprt);
	dr->xprt = rqstp->rq_xprt;
1188
	set_bit(RQ_DROPME, &rqstp->rq_flags);
1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200

	dr->handle.revisit = svc_revisit;
	return &dr->handle;
}

/*
 * recv data from a deferred request into an active one
 */
static int svc_deferred_recv(struct svc_rqst *rqstp)
{
	struct svc_deferred_req *dr = rqstp->rq_deferred;

1201 1202 1203 1204
	/* setup iov_base past transport header */
	rqstp->rq_arg.head[0].iov_base = dr->args + (dr->xprt_hlen>>2);
	/* The iov_len does not include the transport header bytes */
	rqstp->rq_arg.head[0].iov_len = (dr->argslen<<2) - dr->xprt_hlen;
1205
	rqstp->rq_arg.page_len = 0;
1206 1207
	/* The rq_arg.len includes the transport header bytes */
	rqstp->rq_arg.len     = dr->argslen<<2;
1208 1209 1210
	rqstp->rq_prot        = dr->prot;
	memcpy(&rqstp->rq_addr, &dr->addr, dr->addrlen);
	rqstp->rq_addrlen     = dr->addrlen;
1211 1212
	/* Save off transport header len in case we get deferred again */
	rqstp->rq_xprt_hlen   = dr->xprt_hlen;
1213 1214
	rqstp->rq_daddr       = dr->daddr;
	rqstp->rq_respages    = rqstp->rq_pages;
1215
	return (dr->argslen<<2) - dr->xprt_hlen;
1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230
}


static struct svc_deferred_req *svc_deferred_dequeue(struct svc_xprt *xprt)
{
	struct svc_deferred_req *dr = NULL;

	if (!test_bit(XPT_DEFERRED, &xprt->xpt_flags))
		return NULL;
	spin_lock(&xprt->xpt_lock);
	if (!list_empty(&xprt->xpt_deferred)) {
		dr = list_entry(xprt->xpt_deferred.next,
				struct svc_deferred_req,
				handle.recent);
		list_del_init(&dr->handle.recent);
1231 1232
	} else
		clear_bit(XPT_DEFERRED, &xprt->xpt_flags);
1233 1234 1235
	spin_unlock(&xprt->xpt_lock);
	return dr;
}
1236

1237 1238 1239 1240
/**
 * svc_find_xprt - find an RPC transport instance
 * @serv: pointer to svc_serv to search
 * @xcl_name: C string containing transport's class name
1241
 * @net: owner net pointer
1242 1243 1244
 * @af: Address family of transport's local address
 * @port: transport's IP port number
 *
1245 1246 1247 1248 1249 1250 1251 1252
 * Return the transport instance pointer for the endpoint accepting
 * connections/peer traffic from the specified transport class,
 * address family and port.
 *
 * Specifying 0 for the address family or port is effectively a
 * wild-card, and will result in matching the first transport in the
 * service's list that has a matching class name.
 */
1253
struct svc_xprt *svc_find_xprt(struct svc_serv *serv, const char *xcl_name,
1254 1255
			       struct net *net, const sa_family_t af,
			       const unsigned short port)
1256 1257 1258 1259 1260
{
	struct svc_xprt *xprt;
	struct svc_xprt *found = NULL;

	/* Sanity check the args */
1261
	if (serv == NULL || xcl_name == NULL)
1262 1263 1264 1265
		return found;

	spin_lock_bh(&serv->sv_lock);
	list_for_each_entry(xprt, &serv->sv_permsocks, xpt_list) {
1266 1267
		if (xprt->xpt_net != net)
			continue;
1268 1269 1270 1271
		if (strcmp(xprt->xpt_class->xcl_name, xcl_name))
			continue;
		if (af != AF_UNSPEC && af != xprt->xpt_local.ss_family)
			continue;
1272
		if (port != 0 && port != svc_xprt_local_port(xprt))
1273 1274
			continue;
		found = xprt;
1275
		svc_xprt_get(xprt);
1276 1277 1278 1279 1280 1281
		break;
	}
	spin_unlock_bh(&serv->sv_lock);
	return found;
}
EXPORT_SYMBOL_GPL(svc_find_xprt);
1282

1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306
static int svc_one_xprt_name(const struct svc_xprt *xprt,
			     char *pos, int remaining)
{
	int len;

	len = snprintf(pos, remaining, "%s %u\n",
			xprt->xpt_class->xcl_name,
			svc_xprt_local_port(xprt));
	if (len >= remaining)
		return -ENAMETOOLONG;
	return len;
}

/**
 * svc_xprt_names - format a buffer with a list of transport names
 * @serv: pointer to an RPC service
 * @buf: pointer to a buffer to be filled in
 * @buflen: length of buffer to be filled in
 *
 * Fills in @buf with a string containing a list of transport names,
 * each name terminated with '\n'.
 *
 * Returns positive length of the filled-in string on success; otherwise
 * a negative errno value is returned if an error occurs.
1307
 */
1308
int svc_xprt_names(struct svc_serv *serv, char *buf, const int buflen)
1309 1310
{
	struct svc_xprt *xprt;
1311 1312
	int len, totlen;
	char *pos;
1313 1314 1315 1316 1317 1318

	/* Sanity check args */
	if (!serv)
		return 0;

	spin_lock_bh(&serv->sv_lock);
1319 1320 1321

	pos = buf;
	totlen = 0;
1322
	list_for_each_entry(xprt, &serv->sv_permsocks, xpt_list) {
1323 1324 1325 1326 1327 1328
		len = svc_one_xprt_name(xprt, pos, buflen - totlen);
		if (len < 0) {
			*buf = '\0';
			totlen = len;
		}
		if (len <= 0)
1329
			break;
1330 1331

		pos += len;
1332 1333
		totlen += len;
	}
1334

1335 1336 1337 1338
	spin_unlock_bh(&serv->sv_lock);
	return totlen;
}
EXPORT_SYMBOL_GPL(svc_xprt_names);
1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383


/*----------------------------------------------------------------------------*/

static void *svc_pool_stats_start(struct seq_file *m, loff_t *pos)
{
	unsigned int pidx = (unsigned int)*pos;
	struct svc_serv *serv = m->private;

	dprintk("svc_pool_stats_start, *pidx=%u\n", pidx);

	if (!pidx)
		return SEQ_START_TOKEN;
	return (pidx > serv->sv_nrpools ? NULL : &serv->sv_pools[pidx-1]);
}

static void *svc_pool_stats_next(struct seq_file *m, void *p, loff_t *pos)
{
	struct svc_pool *pool = p;
	struct svc_serv *serv = m->private;

	dprintk("svc_pool_stats_next, *pos=%llu\n", *pos);

	if (p == SEQ_START_TOKEN) {
		pool = &serv->sv_pools[0];
	} else {
		unsigned int pidx = (pool - &serv->sv_pools[0]);
		if (pidx < serv->sv_nrpools-1)
			pool = &serv->sv_pools[pidx+1];
		else
			pool = NULL;
	}
	++*pos;
	return pool;
}

static void svc_pool_stats_stop(struct seq_file *m, void *p)
{
}

static int svc_pool_stats_show(struct seq_file *m, void *p)
{
	struct svc_pool *pool = p;

	if (p == SEQ_START_TOKEN) {
1384
		seq_puts(m, "# pool packets-arrived sockets-enqueued threads-woken threads-timedout\n");
1385 1386 1387
		return 0;
	}

1388
	seq_printf(m, "%u %lu %lu %lu %lu\n",
1389
		pool->sp_id,
1390
		(unsigned long)atomic_long_read(&pool->sp_stats.packets),
1391
		pool->sp_stats.sockets_queued,
1392 1393
		(unsigned long)atomic_long_read(&pool->sp_stats.threads_woken),
		(unsigned long)atomic_long_read(&pool->sp_stats.threads_timedout));
1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416

	return 0;
}

static const struct seq_operations svc_pool_stats_seq_ops = {
	.start	= svc_pool_stats_start,
	.next	= svc_pool_stats_next,
	.stop	= svc_pool_stats_stop,
	.show	= svc_pool_stats_show,
};

int svc_pool_stats_open(struct svc_serv *serv, struct file *file)
{
	int err;

	err = seq_open(file, &svc_pool_stats_seq_ops);
	if (!err)
		((struct seq_file *) file->private_data)->private = serv;
	return err;
}
EXPORT_SYMBOL(svc_pool_stats_open);

/*----------------------------------------------------------------------------*/