svc_xprt.c 35.0 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 13 14
#include <net/sock.h>
#include <linux/sunrpc/stats.h>
#include <linux/sunrpc/svc_xprt.h>
15
#include <linux/sunrpc/svcsock.h>
16
#include <linux/sunrpc/xprt.h>
17
#include <linux/module.h>
18
#include <trace/events/sunrpc.h>
T
Tom Tucker 已提交
19 20 21

#define RPCDBG_FACILITY	RPCDBG_SVCXPRT

22 23 24 25
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);
26
static void svc_delete_xprt(struct svc_xprt *xprt);
27
static void svc_xprt_do_enqueue(struct svc_xprt *xprt);
28 29 30 31 32 33 34 35

/* 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 已提交
36 37 38 39
/* List of registered transport classes */
static DEFINE_SPINLOCK(svc_xprt_class_lock);
static LIST_HEAD(svc_xprt_class_list);

40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70
/* 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.
 *	BKL protects svc_serv->sv_nrthread.
 *	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 225
	WARN_ON_ONCE(!test_bit(XPT_BUSY, &xprt->xpt_flags));
	if (!test_bit(XPT_BUSY, &xprt->xpt_flags))
		return;
226
	/* As soon as we clear busy, the xprt could be closed and
227
	 * 'put', so we need a reference to call svc_xprt_do_enqueue with:
228 229
	 */
	svc_xprt_get(xprt);
230
	smp_mb__before_atomic();
231
	clear_bit(XPT_BUSY, &xprt->xpt_flags);
232
	svc_xprt_do_enqueue(xprt);
233 234 235
	svc_xprt_put(xprt);
}

236 237 238 239 240 241 242 243 244
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);
}

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

251 252 253
	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) {
254
		struct svc_xprt *newxprt;
255
		unsigned short newport;
256 257 258 259 260 261 262 263

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

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

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

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

/*
 * 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.
	 */
295 296
	memcpy(&rqstp->rq_daddr, &xprt->xpt_local, xprt->xpt_locallen);
	rqstp->rq_daddrlen = xprt->xpt_locallen;
297 298 299
}
EXPORT_SYMBOL_GPL(svc_xprt_copy_addrs);

300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331
/**
 * 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);

/*
 * Queue up an idle server thread.  Must have pool->sp_lock held.
 * Note: this is really a stack rather than a queue, so that we only
 * use as many different threads as we need, and the rest don't pollute
 * the cache.
 */
static void svc_thread_enqueue(struct svc_pool *pool, struct svc_rqst *rqstp)
{
	list_add(&rqstp->rq_list, &pool->sp_threads);
}

/*
 * Dequeue an nfsd thread.  Must have pool->sp_lock held.
 */
static void svc_thread_dequeue(struct svc_pool *pool, struct svc_rqst *rqstp)
{
	list_del(&rqstp->rq_list);
}

J
J. Bruce Fields 已提交
332 333 334 335 336 337 338 339 340
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;
}

341
static void svc_xprt_do_enqueue(struct svc_xprt *xprt)
342 343 344 345 346
{
	struct svc_pool *pool;
	struct svc_rqst	*rqstp;
	int cpu;

J
J. Bruce Fields 已提交
347
	if (!svc_xprt_has_something_to_do(xprt))
348 349 350 351 352 353 354 355 356 357
		return;

	/* 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);
358
		return;
359 360
	}

361 362 363 364 365 366
	cpu = get_cpu();
	pool = svc_pool_for_cpu(xprt->xpt_server, cpu);
	spin_lock_bh(&pool->sp_lock);

	pool->sp_stats.packets++;

367
	if (!list_empty(&pool->sp_threads)) {
368 369 370 371 372 373 374 375 376 377
		rqstp = list_entry(pool->sp_threads.next,
				   struct svc_rqst,
				   rq_list);
		dprintk("svc: transport %p served by daemon %p\n",
			xprt, rqstp);
		svc_thread_dequeue(pool, rqstp);
		if (rqstp->rq_xprt)
			printk(KERN_ERR
				"svc_xprt_enqueue: server %p, rq_xprt=%p!\n",
				rqstp, rqstp->rq_xprt);
378 379 380 381 382
		/* Note the order of the following 3 lines:
		 * We want to assign xprt to rqstp->rq_xprt only _after_
		 * we've woken up the process, so that we don't race with
		 * the lockless check in svc_get_next_xprt().
		 */
383
		svc_xprt_get(xprt);
384 385
		wake_up_process(rqstp->rq_task);
		rqstp->rq_xprt = xprt;
386
		pool->sp_stats.threads_woken++;
387 388 389
	} else {
		dprintk("svc: transport %p put into queue\n", xprt);
		list_add_tail(&xprt->xpt_ready, &pool->sp_sockets);
390
		pool->sp_stats.sockets_queued++;
391 392 393
	}

	spin_unlock_bh(&pool->sp_lock);
394
	put_cpu();
395
}
396 397 398 399 400 401 402 403 404 405 406 407

/*
 * 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;
	svc_xprt_do_enqueue(xprt);
}
408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448
EXPORT_SYMBOL_GPL(svc_xprt_enqueue);

/*
 * Dequeue the first transport.  Must be called with the pool->sp_lock held.
 */
static struct svc_xprt *svc_xprt_dequeue(struct svc_pool *pool)
{
	struct svc_xprt	*xprt;

	if (list_empty(&pool->sp_sockets))
		return NULL;

	xprt = list_entry(pool->sp_sockets.next,
			  struct svc_xprt, xpt_ready);
	list_del_init(&xprt->xpt_ready);

	dprintk("svc: transport %p dequeued, inuse=%d\n",
		xprt, atomic_read(&xprt->xpt_ref.refcount));

	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;

449 450
		if (xprt->xpt_ops->xpo_adjust_wspace)
			xprt->xpt_ops->xpo_adjust_wspace(xprt);
451 452 453
		svc_xprt_enqueue(xprt);
	}
}
454
EXPORT_SYMBOL_GPL(svc_reserve);
455 456 457 458 459 460 461

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);

462 463 464
	kfree(rqstp->rq_deferred);
	rqstp->rq_deferred = NULL;

465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509
	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);
}

/*
 * External function to wake up a server waiting for data
 * This really only makes sense for services like lockd
 * which have exactly one thread anyway.
 */
void svc_wake_up(struct svc_serv *serv)
{
	struct svc_rqst	*rqstp;
	unsigned int i;
	struct svc_pool *pool;

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

		spin_lock_bh(&pool->sp_lock);
		if (!list_empty(&pool->sp_threads)) {
			rqstp = list_entry(pool->sp_threads.next,
					   struct svc_rqst,
					   rq_list);
			dprintk("svc: daemon %p woken up.\n", rqstp);
			/*
			svc_thread_dequeue(pool, rqstp);
			rqstp->rq_xprt = NULL;
			 */
510
			wake_up_process(rqstp->rq_task);
511 512
		} else
			pool->sp_task_pending = 1;
513 514 515
		spin_unlock_bh(&pool->sp_lock);
	}
}
516
EXPORT_SYMBOL_GPL(svc_wake_up);
517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532

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;
	}
}

/*
533 534 535 536
 * 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.
537 538 539 540 541 542 543 544
 *
 * 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.
545 546 547 548
 *
 * 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
549 550 551
 */
static void svc_check_conn_limits(struct svc_serv *serv)
{
552 553 554 555
	unsigned int limit = serv->sv_maxconn ? serv->sv_maxconn :
				(serv->sv_nrthreads+3) * 20;

	if (serv->sv_tmpcnt > limit) {
556 557 558
		struct svc_xprt *xprt = NULL;
		spin_lock_bh(&serv->sv_lock);
		if (!list_empty(&serv->sv_tempsocks)) {
559 560 561 562 563
			/* 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");
564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582
			/*
			 * 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);
		}
	}
}

583
static int svc_alloc_arg(struct svc_rqst *rqstp)
584
{
J
J. Bruce Fields 已提交
585 586 587 588
	struct svc_serv *serv = rqstp->rq_server;
	struct xdr_buf *arg;
	int pages;
	int i;
589 590 591

	/* now allocate needed pages.  If we get a failure, sleep briefly */
	pages = (serv->sv_max_mesg + PAGE_SIZE) / PAGE_SIZE;
592 593 594 595
	WARN_ON_ONCE(pages >= RPCSVC_MAXPAGES);
	if (pages >= RPCSVC_MAXPAGES)
		/* use as many pages as possible */
		pages = RPCSVC_MAXPAGES - 1;
596 597 598 599
	for (i = 0; i < pages ; i++)
		while (rqstp->rq_pages[i] == NULL) {
			struct page *p = alloc_page(GFP_KERNEL);
			if (!p) {
600 601 602
				set_current_state(TASK_INTERRUPTIBLE);
				if (signalled() || kthread_should_stop()) {
					set_current_state(TASK_RUNNING);
603
					return -EINTR;
604 605
				}
				schedule_timeout(msecs_to_jiffies(500));
606 607 608
			}
			rqstp->rq_pages[i] = p;
		}
609
	rqstp->rq_page_end = &rqstp->rq_pages[i];
610 611 612 613 614 615 616 617 618 619 620 621
	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 已提交
622 623
	return 0;
}
624

625
static struct svc_xprt *svc_get_next_xprt(struct svc_rqst *rqstp, long timeout)
J
J. Bruce Fields 已提交
626 627 628
{
	struct svc_xprt *xprt;
	struct svc_pool		*pool = rqstp->rq_pool;
629
	long			time_left = 0;
630

631 632 633 634 635
	/* Normally we will wait up to 5 seconds for any required
	 * cache information to be provided.
	 */
	rqstp->rq_chandle.thread_wait = 5*HZ;

636 637 638 639 640
	spin_lock_bh(&pool->sp_lock);
	xprt = svc_xprt_dequeue(pool);
	if (xprt) {
		rqstp->rq_xprt = xprt;
		svc_xprt_get(xprt);
641 642

		/* As there is a shortage of threads and this request
J
J. Bruce Fields 已提交
643
		 * had to be queued, don't allow the thread to wait so
644 645 646
		 * long for cache updates.
		 */
		rqstp->rq_chandle.thread_wait = 1*HZ;
647
		pool->sp_task_pending = 0;
648
	} else {
649 650
		if (pool->sp_task_pending) {
			pool->sp_task_pending = 0;
651 652
			xprt = ERR_PTR(-EAGAIN);
			goto out;
653
		}
654 655 656 657 658
		/*
		 * We have to be able to interrupt this wait
		 * to bring down the daemons ...
		 */
		set_current_state(TASK_INTERRUPTIBLE);
659

660 661
		/* No data pending. Go to sleep */
		svc_thread_enqueue(pool, rqstp);
662 663
		spin_unlock_bh(&pool->sp_lock);

664 665 666
		if (!(signalled() || kthread_should_stop())) {
			time_left = schedule_timeout(timeout);
			__set_current_state(TASK_RUNNING);
667

668
			try_to_freeze();
669

670 671 672 673 674
			xprt = rqstp->rq_xprt;
			if (xprt != NULL)
				return xprt;
		} else
			__set_current_state(TASK_RUNNING);
675 676

		spin_lock_bh(&pool->sp_lock);
677 678
		if (!time_left)
			pool->sp_stats.threads_timedout++;
679 680 681 682 683 684

		xprt = rqstp->rq_xprt;
		if (!xprt) {
			svc_thread_dequeue(pool, rqstp);
			spin_unlock_bh(&pool->sp_lock);
			dprintk("svc: server %p, no data yet\n", rqstp);
685
			if (signalled() || kthread_should_stop())
J
J. Bruce Fields 已提交
686
				return ERR_PTR(-EINTR);
687
			else
J
J. Bruce Fields 已提交
688
				return ERR_PTR(-EAGAIN);
689 690
		}
	}
691
out:
692
	spin_unlock_bh(&pool->sp_lock);
J
J. Bruce Fields 已提交
693 694 695
	return xprt;
}

696
static void svc_add_new_temp_xprt(struct svc_serv *serv, struct svc_xprt *newxpt)
697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712
{
	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 已提交
713 714 715 716
static int svc_handle_xprt(struct svc_rqst *rqstp, struct svc_xprt *xprt)
{
	struct svc_serv *serv = rqstp->rq_server;
	int len = 0;
717

718 719 720
	if (test_bit(XPT_CLOSE, &xprt->xpt_flags)) {
		dprintk("svc_recv: found XPT_CLOSE\n");
		svc_delete_xprt(xprt);
721
		/* Leave XPT_BUSY set on the dead xprt: */
J
J. Bruce Fields 已提交
722
		return 0;
723 724
	}
	if (test_bit(XPT_LISTENER, &xprt->xpt_flags)) {
725
		struct svc_xprt *newxpt;
726 727 728 729 730 731
		/*
		 * 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);
732
		newxpt = xprt->xpt_ops->xpo_accept(xprt);
733 734
		if (newxpt)
			svc_add_new_temp_xprt(serv, newxpt);
735 736
		else
			module_put(xprt->xpt_class->xcl_owner);
737
	} else {
J
J. Bruce Fields 已提交
738
		/* XPT_DATA|XPT_DEFERRED case: */
739
		dprintk("svc: server %p, pool %u, transport %p, inuse=%d\n",
J
J. Bruce Fields 已提交
740
			rqstp, rqstp->rq_pool->sp_id, xprt,
741 742
			atomic_read(&xprt->xpt_ref.refcount));
		rqstp->rq_deferred = svc_deferred_dequeue(xprt);
743
		if (rqstp->rq_deferred)
744
			len = svc_deferred_recv(rqstp);
745
		else
746 747
			len = xprt->xpt_ops->xpo_recvfrom(rqstp);
		dprintk("svc: got len=%d\n", len);
748 749
		rqstp->rq_reserved = serv->sv_max_mesg;
		atomic_add(rqstp->rq_reserved, &xprt->xpt_reserved);
750
	}
J
J. Bruce Fields 已提交
751
	/* clear XPT_BUSY: */
752
	svc_xprt_received(xprt);
J
J. Bruce Fields 已提交
753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773
	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);
774

J
J. Bruce Fields 已提交
775 776
	err = svc_alloc_arg(rqstp);
	if (err)
777
		goto out;
J
J. Bruce Fields 已提交
778 779 780

	try_to_freeze();
	cond_resched();
781
	err = -EINTR;
J
J. Bruce Fields 已提交
782
	if (signalled() || kthread_should_stop())
783
		goto out;
J
J. Bruce Fields 已提交
784 785

	xprt = svc_get_next_xprt(rqstp, timeout);
786 787 788 789
	if (IS_ERR(xprt)) {
		err = PTR_ERR(xprt);
		goto out;
	}
J
J. Bruce Fields 已提交
790 791

	len = svc_handle_xprt(rqstp, xprt);
792 793

	/* No data, incomplete (TCP) read, or accept() */
794
	err = -EAGAIN;
795
	if (len <= 0)
796
		goto out_release;
797

798 799
	clear_bit(XPT_OLD, &xprt->xpt_flags);

800
	rqstp->rq_secure = xprt->xpt_ops->xpo_secure_port(rqstp);
801
	rqstp->rq_chandle.defer = svc_defer;
802
	rqstp->rq_xid = svc_getu32(&rqstp->rq_arg.head[0]);
803 804 805

	if (serv->sv_stats)
		serv->sv_stats->netcnt++;
806
	trace_svc_recv(rqstp, len);
807
	return len;
808
out_release:
809 810
	rqstp->rq_res.len = 0;
	svc_xprt_release(rqstp);
811 812 813
out:
	trace_svc_recv(rqstp, err);
	return err;
814
}
815
EXPORT_SYMBOL_GPL(svc_recv);
816 817 818 819 820 821 822 823 824

/*
 * Drop request
 */
void svc_drop(struct svc_rqst *rqstp)
{
	dprintk("svc: xprt %p dropped request\n", rqstp->rq_xprt);
	svc_xprt_release(rqstp);
}
825
EXPORT_SYMBOL_GPL(svc_drop);
826 827 828 829 830 831 832

/*
 * Return reply to client.
 */
int svc_send(struct svc_rqst *rqstp)
{
	struct svc_xprt	*xprt;
833
	int		len = -EFAULT;
834 835 836 837
	struct xdr_buf	*xb;

	xprt = rqstp->rq_xprt;
	if (!xprt)
838
		goto out;
839 840 841 842 843 844 845 846 847 848 849 850

	/* 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);
851 852
	if (test_bit(XPT_DEAD, &xprt->xpt_flags)
			|| test_bit(XPT_CLOSE, &xprt->xpt_flags))
853 854 855 856
		len = -ENOTCONN;
	else
		len = xprt->xpt_ops->xpo_sendto(rqstp);
	mutex_unlock(&xprt->xpt_mutex);
857
	rpc_wake_up(&xprt->xpt_bc_pending);
858 859 860
	svc_xprt_release(rqstp);

	if (len == -ECONNREFUSED || len == -ENOTCONN || len == -EAGAIN)
861 862 863
		len = 0;
out:
	trace_svc_send(rqstp, len);
864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892
	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;
893 894
		if (atomic_read(&xprt->xpt_ref.refcount) > 1 ||
		    test_bit(XPT_BUSY, &xprt->xpt_flags))
895
			continue;
896
		list_del_init(le);
897 898 899 900 901 902
		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);
	}
903
	spin_unlock_bh(&serv->sv_lock);
904 905 906 907

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

908 909 910 911 912 913 914 915 916 917 918 919 920
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);
}

921 922 923
/*
 * Remove a dead transport
 */
924
static void svc_delete_xprt(struct svc_xprt *xprt)
925 926
{
	struct svc_serv	*serv = xprt->xpt_server;
927 928 929 930
	struct svc_deferred_req *dr;

	/* Only do this once */
	if (test_and_set_bit(XPT_DEAD, &xprt->xpt_flags))
931
		BUG();
932 933 934 935 936

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

	spin_lock_bh(&serv->sv_lock);
937
	list_del_init(&xprt->xpt_list);
938
	WARN_ON_ONCE(!list_empty(&xprt->xpt_ready));
939 940
	if (test_bit(XPT_TEMP, &xprt->xpt_flags))
		serv->sv_tmpcnt--;
941
	spin_unlock_bh(&serv->sv_lock);
942

943
	while ((dr = svc_deferred_dequeue(xprt)) != NULL)
944 945
		kfree(dr);

946
	call_xpt_users(xprt);
947
	svc_xprt_put(xprt);
948 949 950 951 952 953 954 955
}

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 已提交
956 957 958 959 960 961
	/*
	 * 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:
	 */
962 963
	svc_delete_xprt(xprt);
}
964
EXPORT_SYMBOL_GPL(svc_close_xprt);
965

966
static int svc_close_list(struct svc_serv *serv, struct list_head *xprt_list, struct net *net)
967 968
{
	struct svc_xprt *xprt;
969
	int ret = 0;
970

971
	spin_lock(&serv->sv_lock);
972
	list_for_each_entry(xprt, xprt_list, xpt_list) {
973 974
		if (xprt->xpt_net != net)
			continue;
975
		ret++;
976
		set_bit(XPT_CLOSE, &xprt->xpt_flags);
977
		svc_xprt_enqueue(xprt);
978
	}
979
	spin_unlock(&serv->sv_lock);
980
	return ret;
981 982
}

983
static struct svc_xprt *svc_dequeue_net(struct svc_serv *serv, struct net *net)
984
{
985
	struct svc_pool *pool;
986 987
	struct svc_xprt *xprt;
	struct svc_xprt *tmp;
988 989 990 991 992 993
	int i;

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

		spin_lock_bh(&pool->sp_lock);
994
		list_for_each_entry_safe(xprt, tmp, &pool->sp_sockets, xpt_ready) {
995 996
			if (xprt->xpt_net != net)
				continue;
997
			list_del_init(&xprt->xpt_ready);
998 999
			spin_unlock_bh(&pool->sp_lock);
			return xprt;
1000 1001 1002
		}
		spin_unlock_bh(&pool->sp_lock);
	}
1003
	return NULL;
1004 1005
}

1006
static void svc_clean_up_xprts(struct svc_serv *serv, struct net *net)
1007 1008
{
	struct svc_xprt *xprt;
1009

1010 1011
	while ((xprt = svc_dequeue_net(serv, net))) {
		set_bit(XPT_CLOSE, &xprt->xpt_flags);
1012
		svc_delete_xprt(xprt);
1013
	}
1014 1015
}

1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027
/*
 * 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.
 */
1028
void svc_close_net(struct svc_serv *serv, struct net *net)
1029
{
1030
	int delay = 0;
1031

1032 1033 1034 1035 1036 1037
	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++);
	}
1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049
}

/*
 * 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;

1050 1051 1052 1053 1054
	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");
1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066
		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);
}

1067 1068 1069 1070 1071 1072 1073 1074 1075
/*
 * 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.
 */
1076 1077 1078 1079 1080
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;

1081
	if (rqstp->rq_arg.page_len || !rqstp->rq_usedeferral)
1082 1083 1084 1085 1086
		return NULL; /* if more than a page, give up FIXME */
	if (rqstp->rq_deferred) {
		dr = rqstp->rq_deferred;
		rqstp->rq_deferred = NULL;
	} else {
1087 1088
		size_t skip;
		size_t size;
1089
		/* FIXME maybe discard if size too large */
1090
		size = sizeof(struct svc_deferred_req) + rqstp->rq_arg.len;
1091 1092 1093 1094 1095 1096 1097 1098 1099 1100
		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;
1101 1102 1103 1104 1105 1106
		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);
1107 1108 1109
	}
	svc_xprt_get(rqstp->rq_xprt);
	dr->xprt = rqstp->rq_xprt;
1110
	rqstp->rq_dropme = true;
1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122

	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;

1123 1124 1125 1126
	/* 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;
1127
	rqstp->rq_arg.page_len = 0;
1128 1129
	/* The rq_arg.len includes the transport header bytes */
	rqstp->rq_arg.len     = dr->argslen<<2;
1130 1131 1132
	rqstp->rq_prot        = dr->prot;
	memcpy(&rqstp->rq_addr, &dr->addr, dr->addrlen);
	rqstp->rq_addrlen     = dr->addrlen;
1133 1134
	/* Save off transport header len in case we get deferred again */
	rqstp->rq_xprt_hlen   = dr->xprt_hlen;
1135 1136
	rqstp->rq_daddr       = dr->daddr;
	rqstp->rq_respages    = rqstp->rq_pages;
1137
	return (dr->argslen<<2) - dr->xprt_hlen;
1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152
}


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);
1153 1154
	} else
		clear_bit(XPT_DEFERRED, &xprt->xpt_flags);
1155 1156 1157
	spin_unlock(&xprt->xpt_lock);
	return dr;
}
1158

1159 1160 1161 1162
/**
 * svc_find_xprt - find an RPC transport instance
 * @serv: pointer to svc_serv to search
 * @xcl_name: C string containing transport's class name
1163
 * @net: owner net pointer
1164 1165 1166
 * @af: Address family of transport's local address
 * @port: transport's IP port number
 *
1167 1168 1169 1170 1171 1172 1173 1174
 * 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.
 */
1175
struct svc_xprt *svc_find_xprt(struct svc_serv *serv, const char *xcl_name,
1176 1177
			       struct net *net, const sa_family_t af,
			       const unsigned short port)
1178 1179 1180 1181 1182
{
	struct svc_xprt *xprt;
	struct svc_xprt *found = NULL;

	/* Sanity check the args */
1183
	if (serv == NULL || xcl_name == NULL)
1184 1185 1186 1187
		return found;

	spin_lock_bh(&serv->sv_lock);
	list_for_each_entry(xprt, &serv->sv_permsocks, xpt_list) {
1188 1189
		if (xprt->xpt_net != net)
			continue;
1190 1191 1192 1193
		if (strcmp(xprt->xpt_class->xcl_name, xcl_name))
			continue;
		if (af != AF_UNSPEC && af != xprt->xpt_local.ss_family)
			continue;
1194
		if (port != 0 && port != svc_xprt_local_port(xprt))
1195 1196
			continue;
		found = xprt;
1197
		svc_xprt_get(xprt);
1198 1199 1200 1201 1202 1203
		break;
	}
	spin_unlock_bh(&serv->sv_lock);
	return found;
}
EXPORT_SYMBOL_GPL(svc_find_xprt);
1204

1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228
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.
1229
 */
1230
int svc_xprt_names(struct svc_serv *serv, char *buf, const int buflen)
1231 1232
{
	struct svc_xprt *xprt;
1233 1234
	int len, totlen;
	char *pos;
1235 1236 1237 1238 1239 1240

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

	spin_lock_bh(&serv->sv_lock);
1241 1242 1243

	pos = buf;
	totlen = 0;
1244
	list_for_each_entry(xprt, &serv->sv_permsocks, xpt_list) {
1245 1246 1247 1248 1249 1250
		len = svc_one_xprt_name(xprt, pos, buflen - totlen);
		if (len < 0) {
			*buf = '\0';
			totlen = len;
		}
		if (len <= 0)
1251
			break;
1252 1253

		pos += len;
1254 1255
		totlen += len;
	}
1256

1257 1258 1259 1260
	spin_unlock_bh(&serv->sv_lock);
	return totlen;
}
EXPORT_SYMBOL_GPL(svc_xprt_names);
1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305


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

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) {
1306
		seq_puts(m, "# pool packets-arrived sockets-enqueued threads-woken threads-timedout\n");
1307 1308 1309
		return 0;
	}

1310
	seq_printf(m, "%u %lu %lu %lu %lu\n",
1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338
		pool->sp_id,
		pool->sp_stats.packets,
		pool->sp_stats.sockets_queued,
		pool->sp_stats.threads_woken,
		pool->sp_stats.threads_timedout);

	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);

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