svc_xprt.c 37.9 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 unsigned int svc_rpc_per_connection_limit __read_mostly;
module_param(svc_rpc_per_connection_limit, uint, 0644);


28 29 30
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);
31
static void svc_age_temp_xprts(struct timer_list *t);
32
static void svc_delete_xprt(struct svc_xprt *xprt);
33 34 35 36 37 38 39 40

/* 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 已提交
41 42 43 44
/* List of registered transport classes */
static DEFINE_SPINLOCK(svc_xprt_class_lock);
static LIST_HEAD(svc_xprt_class_list);

45 46 47 48 49
/* 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.
50
 *	The "service mutex" protects svc_serv->sv_nrthread.
51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74
 *	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 已提交
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 102 103 104 105
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);

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

	spin_lock(&svc_xprt_class_lock);
117
	list_for_each_entry(xcl, &svc_xprt_class_list, xcl_list) {
118 119 120 121 122 123 124 125 126 127 128 129 130 131
		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 已提交
132 133 134 135 136
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;
137 138
	if (test_bit(XPT_CACHE_AUTH, &xprt->xpt_flags))
		svcauth_unix_info_release(xprt);
139
	put_cred(xprt->xpt_cred);
P
Pavel Emelyanov 已提交
140
	put_net(xprt->xpt_net);
141 142 143
	/* See comment on corresponding get in xs_setup_bc_tcp(): */
	if (xprt->xpt_bc_xprt)
		xprt_put(xprt->xpt_bc_xprt);
144 145
	if (xprt->xpt_bc_xps)
		xprt_switch_put(xprt->xpt_bc_xps);
T
Tom Tucker 已提交
146 147 148 149 150 151 152 153 154 155
	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 已提交
156 157 158 159
/*
 * Called by transport drivers to initialize the transport independent
 * portion of the transport instance.
 */
160 161
void svc_xprt_init(struct net *net, struct svc_xprt_class *xcl,
		   struct svc_xprt *xprt, struct svc_serv *serv)
T
Tom Tucker 已提交
162 163 164 165
{
	memset(xprt, 0, sizeof(*xprt));
	xprt->xpt_class = xcl;
	xprt->xpt_ops = xcl->xcl_ops;
T
Tom Tucker 已提交
166
	kref_init(&xprt->xpt_ref);
167
	xprt->xpt_server = serv;
168 169
	INIT_LIST_HEAD(&xprt->xpt_list);
	INIT_LIST_HEAD(&xprt->xpt_ready);
170
	INIT_LIST_HEAD(&xprt->xpt_deferred);
171
	INIT_LIST_HEAD(&xprt->xpt_users);
172
	mutex_init(&xprt->xpt_mutex);
173
	spin_lock_init(&xprt->xpt_lock);
174
	set_bit(XPT_BUSY, &xprt->xpt_flags);
175
	xprt->xpt_net = get_net(net);
176
	strcpy(xprt->xpt_remotebuf, "uninitialized");
T
Tom Tucker 已提交
177 178
}
EXPORT_SYMBOL_GPL(svc_xprt_init);
179

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

202 203
	switch (family) {
	case PF_INET:
204 205 206
		sap = (struct sockaddr *)&sin;
		len = sizeof(sin);
		break;
E
Eric Dumazet 已提交
207
#if IS_ENABLED(CONFIG_IPV6)
208
	case PF_INET6:
209 210 211
		sap = (struct sockaddr *)&sin6;
		len = sizeof(sin6);
		break;
E
Eric Dumazet 已提交
212
#endif
213 214 215 216
	default:
		return ERR_PTR(-EAFNOSUPPORT);
	}

217
	return xcl->xcl_ops->xpo_create(serv, net, sap, len, flags);
218 219
}

220 221 222 223 224 225 226 227 228 229
/*
 * 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)
{
230 231
	if (!test_bit(XPT_BUSY, &xprt->xpt_flags)) {
		WARN_ONCE(1, "xprt=0x%p already busy!", xprt);
232
		return;
233 234
	}

235
	/* As soon as we clear busy, the xprt could be closed and
236
	 * 'put', so we need a reference to call svc_enqueue_xprt with:
237 238
	 */
	svc_xprt_get(xprt);
239
	smp_mb__before_atomic();
240
	clear_bit(XPT_BUSY, &xprt->xpt_flags);
241
	xprt->xpt_server->sv_ops->svo_enqueue_xprt(xprt);
242 243 244
	svc_xprt_put(xprt);
}

245 246 247 248 249 250 251 252 253
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);
}

254 255
static int _svc_create_xprt(struct svc_serv *serv, const char *xprt_name,
			    struct net *net, const int family,
256 257
			    const unsigned short port, int flags,
			    const struct cred *cred)
258 259 260
{
	struct svc_xprt_class *xcl;

261 262
	spin_lock(&svc_xprt_class_lock);
	list_for_each_entry(xcl, &svc_xprt_class_list, xcl_list) {
263
		struct svc_xprt *newxprt;
264
		unsigned short newport;
265 266 267 268 269 270 271 272

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

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

		spin_unlock(&svc_xprt_class_lock);
273
		newxprt = __svc_xpo_create(xcl, serv, net, family, port, flags);
274 275 276
		if (IS_ERR(newxprt)) {
			module_put(xcl->xcl_owner);
			return PTR_ERR(newxprt);
277
		}
278
		newxprt->xpt_cred = get_cred(cred);
279
		svc_add_new_perm_xprt(serv, newxprt);
280 281
		newport = svc_xprt_local_port(newxprt);
		return newport;
282
	}
283
 err:
284
	spin_unlock(&svc_xprt_class_lock);
285 286 287
	/* This errno is exposed to user space.  Provide a reasonable
	 * perror msg for a bad transport. */
	return -EPROTONOSUPPORT;
288
}
J
J. Bruce Fields 已提交
289 290 291

int svc_create_xprt(struct svc_serv *serv, const char *xprt_name,
		    struct net *net, const int family,
292 293
		    const unsigned short port, int flags,
		    const struct cred *cred)
J
J. Bruce Fields 已提交
294 295 296 297
{
	int err;

	dprintk("svc: creating transport %s[%d]\n", xprt_name, port);
298
	err = _svc_create_xprt(serv, xprt_name, net, family, port, flags, cred);
J
J. Bruce Fields 已提交
299 300
	if (err == -EPROTONOSUPPORT) {
		request_module("svc%s", xprt_name);
301
		err = _svc_create_xprt(serv, xprt_name, net, family, port, flags, cred);
J
J. Bruce Fields 已提交
302
	}
303
	if (err < 0)
J
J. Bruce Fields 已提交
304
		dprintk("svc: transport %s not found, err %d\n",
305
			xprt_name, -err);
J
J. Bruce Fields 已提交
306 307
	return err;
}
308
EXPORT_SYMBOL_GPL(svc_create_xprt);
309 310 311 312 313 314 315 316 317 318 319 320 321

/*
 * 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.
	 */
322 323
	memcpy(&rqstp->rq_daddr, &xprt->xpt_local, xprt->xpt_locallen);
	rqstp->rq_daddrlen = xprt->xpt_locallen;
324 325 326
}
EXPORT_SYMBOL_GPL(svc_xprt_copy_addrs);

327 328 329 330 331 332 333 334 335 336 337 338 339
/**
 * 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);

340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363
static bool svc_xprt_slots_in_range(struct svc_xprt *xprt)
{
	unsigned int limit = svc_rpc_per_connection_limit;
	int nrqsts = atomic_read(&xprt->xpt_nr_rqsts);

	return limit == 0 || (nrqsts >= 0 && nrqsts < limit);
}

static bool svc_xprt_reserve_slot(struct svc_rqst *rqstp, struct svc_xprt *xprt)
{
	if (!test_bit(RQ_DATA, &rqstp->rq_flags)) {
		if (!svc_xprt_slots_in_range(xprt))
			return false;
		atomic_inc(&xprt->xpt_nr_rqsts);
		set_bit(RQ_DATA, &rqstp->rq_flags);
	}
	return true;
}

static void svc_xprt_release_slot(struct svc_rqst *rqstp)
{
	struct svc_xprt	*xprt = rqstp->rq_xprt;
	if (test_and_clear_bit(RQ_DATA, &rqstp->rq_flags)) {
		atomic_dec(&xprt->xpt_nr_rqsts);
364
		smp_wmb(); /* See smp_rmb() in svc_xprt_ready() */
365 366 367 368
		svc_xprt_enqueue(xprt);
	}
}

369
static bool svc_xprt_ready(struct svc_xprt *xprt)
J
J. Bruce Fields 已提交
370
{
371 372
	unsigned long xpt_flags;

373 374 375 376 377 378 379 380 381
	/*
	 * If another cpu has recently updated xpt_flags,
	 * sk_sock->flags, xpt_reserved, or xpt_nr_rqsts, we need to
	 * know about it; otherwise it's possible that both that cpu and
	 * this one could call svc_xprt_enqueue() without either
	 * svc_xprt_enqueue() recognizing that the conditions below
	 * are satisfied, and we could stall indefinitely:
	 */
	smp_rmb();
382 383 384
	xpt_flags = READ_ONCE(xprt->xpt_flags);

	if (xpt_flags & (BIT(XPT_CONN) | BIT(XPT_CLOSE)))
J
J. Bruce Fields 已提交
385
		return true;
386
	if (xpt_flags & (BIT(XPT_DATA) | BIT(XPT_DEFERRED))) {
387 388
		if (xprt->xpt_ops->xpo_has_wspace(xprt) &&
		    svc_xprt_slots_in_range(xprt))
389 390 391 392
			return true;
		trace_svc_xprt_no_write_space(xprt);
		return false;
	}
J
J. Bruce Fields 已提交
393 394 395
	return false;
}

396
void svc_xprt_do_enqueue(struct svc_xprt *xprt)
397 398
{
	struct svc_pool *pool;
399
	struct svc_rqst	*rqstp = NULL;
400 401
	int cpu;

402
	if (!svc_xprt_ready(xprt))
403
		return;
404 405 406 407 408 409

	/* 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.
	 */
410 411
	if (test_and_set_bit(XPT_BUSY, &xprt->xpt_flags))
		return;
412

413 414 415
	cpu = get_cpu();
	pool = svc_pool_for_cpu(xprt->xpt_server, cpu);

416
	atomic_long_inc(&pool->sp_stats.packets);
417

418 419 420 421 422
	spin_lock_bh(&pool->sp_lock);
	list_add_tail(&xprt->xpt_ready, &pool->sp_sockets);
	pool->sp_stats.sockets_queued++;
	spin_unlock_bh(&pool->sp_lock);

423 424 425
	/* find a thread for this xprt */
	rcu_read_lock();
	list_for_each_entry_rcu(rqstp, &pool->sp_all_threads, rq_all) {
426
		if (test_and_set_bit(RQ_BUSY, &rqstp->rq_flags))
427
			continue;
428
		atomic_long_inc(&pool->sp_stats.threads_woken);
C
Chuck Lever 已提交
429
		rqstp->rq_qtime = ktime_get();
430
		wake_up_process(rqstp->rq_task);
431
		goto out_unlock;
432
	}
433
	set_bit(SP_CONGESTED, &pool->sp_flags);
434
	rqstp = NULL;
435 436
out_unlock:
	rcu_read_unlock();
437
	put_cpu();
438
	trace_svc_xprt_do_enqueue(xprt, rqstp);
439
}
440
EXPORT_SYMBOL_GPL(svc_xprt_do_enqueue);
441 442 443 444 445 446 447 448 449 450

/*
 * 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;
451
	xprt->xpt_server->sv_ops->svo_enqueue_xprt(xprt);
452
}
453 454 455
EXPORT_SYMBOL_GPL(svc_xprt_enqueue);

/*
456
 * Dequeue the first transport, if there is one.
457 458 459
 */
static struct svc_xprt *svc_xprt_dequeue(struct svc_pool *pool)
{
460
	struct svc_xprt	*xprt = NULL;
461 462

	if (list_empty(&pool->sp_sockets))
463
		goto out;
464

465 466 467 468 469 470 471 472
	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);
	}
	spin_unlock_bh(&pool->sp_lock);
473
out:
474 475 476 477 478 479 480 481 482 483 484 485 486 487 488
	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)
{
489 490
	struct svc_xprt *xprt = rqstp->rq_xprt;

491 492
	space += rqstp->rq_res.head[0].iov_len;

493
	if (xprt && space < rqstp->rq_reserved) {
494 495
		atomic_sub((rqstp->rq_reserved - space), &xprt->xpt_reserved);
		rqstp->rq_reserved = space;
496
		smp_wmb(); /* See smp_rmb() in svc_xprt_ready() */
497 498 499
		svc_xprt_enqueue(xprt);
	}
}
500
EXPORT_SYMBOL_GPL(svc_reserve);
501 502 503 504 505

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

506
	xprt->xpt_ops->xpo_release_rqst(rqstp);
507

508 509 510
	kfree(rqstp->rq_deferred);
	rqstp->rq_deferred = NULL;

511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526
	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);
527
	svc_xprt_release_slot(rqstp);
528 529 530 531 532
	rqstp->rq_xprt = NULL;
	svc_xprt_put(xprt);
}

/*
533 534 535 536 537
 * 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.
538 539 540 541 542 543
 */
void svc_wake_up(struct svc_serv *serv)
{
	struct svc_rqst	*rqstp;
	struct svc_pool *pool;

544 545
	pool = &serv->sv_pools[0];

546 547 548 549 550 551
	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();
552
		wake_up_process(rqstp->rq_task);
553
		trace_svc_wake_up(rqstp->rq_task->pid);
554 555 556 557 558 559 560
		return;
	}
	rcu_read_unlock();

	/* No free entries available */
	set_bit(SP_TASK_PENDING, &pool->sp_flags);
	smp_wmb();
561
	trace_svc_wake_up(0);
562
}
563
EXPORT_SYMBOL_GPL(svc_wake_up);
564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579

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

/*
580 581 582 583
 * 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.
584 585 586 587 588 589 590 591
 *
 * 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.
592 593 594 595
 *
 * 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
596 597 598
 */
static void svc_check_conn_limits(struct svc_serv *serv)
{
599 600 601 602
	unsigned int limit = serv->sv_maxconn ? serv->sv_maxconn :
				(serv->sv_nrthreads+3) * 20;

	if (serv->sv_tmpcnt > limit) {
603 604 605
		struct svc_xprt *xprt = NULL;
		spin_lock_bh(&serv->sv_lock);
		if (!list_empty(&serv->sv_tempsocks)) {
606 607 608 609 610
			/* 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");
611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629
			/*
			 * 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);
		}
	}
}

630
static int svc_alloc_arg(struct svc_rqst *rqstp)
631
{
J
J. Bruce Fields 已提交
632 633 634 635
	struct svc_serv *serv = rqstp->rq_server;
	struct xdr_buf *arg;
	int pages;
	int i;
636 637

	/* now allocate needed pages.  If we get a failure, sleep briefly */
638 639 640 641
	pages = (serv->sv_max_mesg + 2 * PAGE_SIZE) >> PAGE_SHIFT;
	if (pages > RPCSVC_MAXPAGES) {
		pr_warn_once("svc: warning: pages=%u > RPCSVC_MAXPAGES=%lu\n",
			     pages, RPCSVC_MAXPAGES);
642
		/* use as many pages as possible */
643 644
		pages = RPCSVC_MAXPAGES;
	}
645 646 647 648
	for (i = 0; i < pages ; i++)
		while (rqstp->rq_pages[i] == NULL) {
			struct page *p = alloc_page(GFP_KERNEL);
			if (!p) {
649 650 651
				set_current_state(TASK_INTERRUPTIBLE);
				if (signalled() || kthread_should_stop()) {
					set_current_state(TASK_RUNNING);
652
					return -EINTR;
653 654
				}
				schedule_timeout(msecs_to_jiffies(500));
655 656 657
			}
			rqstp->rq_pages[i] = p;
		}
658
	rqstp->rq_page_end = &rqstp->rq_pages[i];
659 660 661 662 663 664 665 666 667 668 669 670
	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 已提交
671 672
	return 0;
}
673

674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697
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;
}

698
static struct svc_xprt *svc_get_next_xprt(struct svc_rqst *rqstp, long timeout)
J
J. Bruce Fields 已提交
699 700
{
	struct svc_pool		*pool = rqstp->rq_pool;
701
	long			time_left = 0;
702

703 704 705
	/* rq_xprt should be clear on entry */
	WARN_ON_ONCE(rqstp->rq_xprt);

706 707 708
	rqstp->rq_xprt = svc_xprt_dequeue(pool);
	if (rqstp->rq_xprt)
		goto out_found;
709

710 711 712 713 714
	/*
	 * We have to be able to interrupt this wait
	 * to bring down the daemons ...
	 */
	set_current_state(TASK_INTERRUPTIBLE);
715 716
	smp_mb__before_atomic();
	clear_bit(SP_CONGESTED, &pool->sp_flags);
717
	clear_bit(RQ_BUSY, &rqstp->rq_flags);
718
	smp_mb__after_atomic();
719

720 721 722 723
	if (likely(rqst_should_sleep(rqstp)))
		time_left = schedule_timeout(timeout);
	else
		__set_current_state(TASK_RUNNING);
724

725
	try_to_freeze();
726

727
	set_bit(RQ_BUSY, &rqstp->rq_flags);
728 729 730 731
	smp_mb__after_atomic();
	rqstp->rq_xprt = svc_xprt_dequeue(pool);
	if (rqstp->rq_xprt)
		goto out_found;
732 733 734 735 736 737 738

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

	if (signalled() || kthread_should_stop())
		return ERR_PTR(-EINTR);
	return ERR_PTR(-EAGAIN);
739 740 741 742 743 744 745 746
out_found:
	/* Normally we will wait up to 5 seconds for any required
	 * cache information to be provided.
	 */
	if (!test_bit(SP_CONGESTED, &pool->sp_flags))
		rqstp->rq_chandle.thread_wait = 5*HZ;
	else
		rqstp->rq_chandle.thread_wait = 1*HZ;
C
Chuck Lever 已提交
747
	trace_svc_xprt_dequeue(rqstp);
748
	return rqstp->rq_xprt;
J
J. Bruce Fields 已提交
749 750
}

751
static void svc_add_new_temp_xprt(struct svc_serv *serv, struct svc_xprt *newxpt)
752 753 754 755 756 757 758
{
	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 */
759
		serv->sv_temptimer.function = svc_age_temp_xprts;
760 761 762 763 764 765 766
		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 已提交
767 768 769 770
static int svc_handle_xprt(struct svc_rqst *rqstp, struct svc_xprt *xprt)
{
	struct svc_serv *serv = rqstp->rq_server;
	int len = 0;
771

772 773
	if (test_bit(XPT_CLOSE, &xprt->xpt_flags)) {
		dprintk("svc_recv: found XPT_CLOSE\n");
774 775
		if (test_and_clear_bit(XPT_KILL_TEMP, &xprt->xpt_flags))
			xprt->xpt_ops->xpo_kill_temp_xprt(xprt);
776
		svc_delete_xprt(xprt);
777
		/* Leave XPT_BUSY set on the dead xprt: */
778
		goto out;
779 780
	}
	if (test_bit(XPT_LISTENER, &xprt->xpt_flags)) {
781
		struct svc_xprt *newxpt;
782 783 784 785 786 787
		/*
		 * 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);
788
		newxpt = xprt->xpt_ops->xpo_accept(xprt);
789 790
		if (newxpt)
			svc_add_new_temp_xprt(serv, newxpt);
791 792
		else
			module_put(xprt->xpt_class->xcl_owner);
793
	} else if (svc_xprt_reserve_slot(rqstp, xprt)) {
J
J. Bruce Fields 已提交
794
		/* XPT_DATA|XPT_DEFERRED case: */
795
		dprintk("svc: server %p, pool %u, transport %p, inuse=%d\n",
J
J. Bruce Fields 已提交
796
			rqstp, rqstp->rq_pool->sp_id, xprt,
797
			kref_read(&xprt->xpt_ref));
798
		rqstp->rq_deferred = svc_deferred_dequeue(xprt);
799
		if (rqstp->rq_deferred)
800
			len = svc_deferred_recv(rqstp);
801
		else
802
			len = xprt->xpt_ops->xpo_recvfrom(rqstp);
803
		rqstp->rq_stime = ktime_get();
804 805
		rqstp->rq_reserved = serv->sv_max_mesg;
		atomic_add(rqstp->rq_reserved, &xprt->xpt_reserved);
806
	}
J
J. Bruce Fields 已提交
807
	/* clear XPT_BUSY: */
808
	svc_xprt_received(xprt);
809 810
out:
	trace_svc_handle_xprt(xprt, len);
J
J. Bruce Fields 已提交
811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831
	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);
832

J
J. Bruce Fields 已提交
833 834
	err = svc_alloc_arg(rqstp);
	if (err)
835
		goto out;
J
J. Bruce Fields 已提交
836 837 838

	try_to_freeze();
	cond_resched();
839
	err = -EINTR;
J
J. Bruce Fields 已提交
840
	if (signalled() || kthread_should_stop())
841
		goto out;
J
J. Bruce Fields 已提交
842 843

	xprt = svc_get_next_xprt(rqstp, timeout);
844 845 846 847
	if (IS_ERR(xprt)) {
		err = PTR_ERR(xprt);
		goto out;
	}
J
J. Bruce Fields 已提交
848 849

	len = svc_handle_xprt(rqstp, xprt);
850 851

	/* No data, incomplete (TCP) read, or accept() */
852
	err = -EAGAIN;
853
	if (len <= 0)
854
		goto out_release;
855

856 857
	clear_bit(XPT_OLD, &xprt->xpt_flags);

C
Chuck Lever 已提交
858
	xprt->xpt_ops->xpo_secure_port(rqstp);
859
	rqstp->rq_chandle.defer = svc_defer;
860
	rqstp->rq_xid = svc_getu32(&rqstp->rq_arg.head[0]);
861 862 863

	if (serv->sv_stats)
		serv->sv_stats->netcnt++;
864
	trace_svc_recv(rqstp, len);
865
	return len;
866
out_release:
867 868
	rqstp->rq_res.len = 0;
	svc_xprt_release(rqstp);
869 870
out:
	return err;
871
}
872
EXPORT_SYMBOL_GPL(svc_recv);
873 874 875 876 877 878

/*
 * Drop request
 */
void svc_drop(struct svc_rqst *rqstp)
{
879
	trace_svc_drop(rqstp);
880 881 882
	dprintk("svc: xprt %p dropped request\n", rqstp->rq_xprt);
	svc_xprt_release(rqstp);
}
883
EXPORT_SYMBOL_GPL(svc_drop);
884 885 886 887 888 889 890

/*
 * Return reply to client.
 */
int svc_send(struct svc_rqst *rqstp)
{
	struct svc_xprt	*xprt;
891
	int		len = -EFAULT;
892 893 894 895
	struct xdr_buf	*xb;

	xprt = rqstp->rq_xprt;
	if (!xprt)
896
		goto out;
897 898

	/* release the receive skb before sending the reply */
899
	xprt->xpt_ops->xpo_release_rqst(rqstp);
900 901 902 903 904 905 906 907 908

	/* 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);
909
	trace_svc_stats_latency(rqstp);
910 911
	if (test_bit(XPT_DEAD, &xprt->xpt_flags)
			|| test_bit(XPT_CLOSE, &xprt->xpt_flags))
912 913 914 915
		len = -ENOTCONN;
	else
		len = xprt->xpt_ops->xpo_sendto(rqstp);
	mutex_unlock(&xprt->xpt_mutex);
916
	trace_svc_send(rqstp, len);
917 918 919
	svc_xprt_release(rqstp);

	if (len == -ECONNREFUSED || len == -ENOTCONN || len == -EAGAIN)
920 921
		len = 0;
out:
922 923 924 925 926 927 928
	return len;
}

/*
 * Timer function to close old temporary transports, using
 * a mark-and-sweep algorithm.
 */
929
static void svc_age_temp_xprts(struct timer_list *t)
930
{
931
	struct svc_serv *serv = from_timer(serv, t, sv_temptimer);
932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950
	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;
951
		if (kref_read(&xprt->xpt_ref) > 1 ||
952
		    test_bit(XPT_BUSY, &xprt->xpt_flags))
953
			continue;
954
		list_del_init(le);
955 956 957 958 959 960
		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);
	}
961
	spin_unlock_bh(&serv->sv_lock);
962 963 964 965

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

966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992
/* 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 list_head *le, *next;
	LIST_HEAD(to_be_closed);

	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);
993 994 995 996 997
		set_bit(XPT_CLOSE, &xprt->xpt_flags);
		set_bit(XPT_KILL_TEMP, &xprt->xpt_flags);
		dprintk("svc_age_temp_xprts_now: queuing xprt %p for closing\n",
				xprt);
		svc_xprt_enqueue(xprt);
998 999 1000 1001
	}
}
EXPORT_SYMBOL_GPL(svc_age_temp_xprts_now);

1002 1003 1004 1005 1006 1007 1008
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);
1009
		list_del_init(&u->list);
1010 1011 1012 1013 1014
		u->callback(u);
	}
	spin_unlock(&xprt->xpt_lock);
}

1015 1016 1017
/*
 * Remove a dead transport
 */
1018
static void svc_delete_xprt(struct svc_xprt *xprt)
1019 1020
{
	struct svc_serv	*serv = xprt->xpt_server;
1021 1022 1023 1024
	struct svc_deferred_req *dr;

	/* Only do this once */
	if (test_and_set_bit(XPT_DEAD, &xprt->xpt_flags))
1025
		BUG();
1026 1027 1028 1029 1030

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

	spin_lock_bh(&serv->sv_lock);
1031
	list_del_init(&xprt->xpt_list);
1032
	WARN_ON_ONCE(!list_empty(&xprt->xpt_ready));
1033 1034
	if (test_bit(XPT_TEMP, &xprt->xpt_flags))
		serv->sv_tmpcnt--;
1035
	spin_unlock_bh(&serv->sv_lock);
1036

1037
	while ((dr = svc_deferred_dequeue(xprt)) != NULL)
1038 1039
		kfree(dr);

1040
	call_xpt_users(xprt);
1041
	svc_xprt_put(xprt);
1042 1043 1044 1045 1046 1047 1048 1049
}

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 已提交
1050 1051 1052 1053 1054 1055
	/*
	 * 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:
	 */
1056 1057
	svc_delete_xprt(xprt);
}
1058
EXPORT_SYMBOL_GPL(svc_close_xprt);
1059

1060
static int svc_close_list(struct svc_serv *serv, struct list_head *xprt_list, struct net *net)
1061 1062
{
	struct svc_xprt *xprt;
1063
	int ret = 0;
1064

1065
	spin_lock(&serv->sv_lock);
1066
	list_for_each_entry(xprt, xprt_list, xpt_list) {
1067 1068
		if (xprt->xpt_net != net)
			continue;
1069
		ret++;
1070
		set_bit(XPT_CLOSE, &xprt->xpt_flags);
1071
		svc_xprt_enqueue(xprt);
1072
	}
1073
	spin_unlock(&serv->sv_lock);
1074
	return ret;
1075 1076
}

1077
static struct svc_xprt *svc_dequeue_net(struct svc_serv *serv, struct net *net)
1078
{
1079
	struct svc_pool *pool;
1080 1081
	struct svc_xprt *xprt;
	struct svc_xprt *tmp;
1082 1083 1084 1085 1086 1087
	int i;

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

		spin_lock_bh(&pool->sp_lock);
1088
		list_for_each_entry_safe(xprt, tmp, &pool->sp_sockets, xpt_ready) {
1089 1090
			if (xprt->xpt_net != net)
				continue;
1091
			list_del_init(&xprt->xpt_ready);
1092 1093
			spin_unlock_bh(&pool->sp_lock);
			return xprt;
1094 1095 1096
		}
		spin_unlock_bh(&pool->sp_lock);
	}
1097
	return NULL;
1098 1099
}

1100
static void svc_clean_up_xprts(struct svc_serv *serv, struct net *net)
1101 1102
{
	struct svc_xprt *xprt;
1103

1104 1105
	while ((xprt = svc_dequeue_net(serv, net))) {
		set_bit(XPT_CLOSE, &xprt->xpt_flags);
1106
		svc_delete_xprt(xprt);
1107
	}
1108 1109
}

1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121
/*
 * 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.
 */
1122
void svc_close_net(struct svc_serv *serv, struct net *net)
1123
{
1124
	int delay = 0;
1125

1126 1127 1128 1129 1130 1131
	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++);
	}
1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143
}

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

1144 1145 1146 1147 1148
	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");
1149
		svc_xprt_put(xprt);
1150
		trace_svc_drop_deferred(dr);
1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161
		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);
}

1162 1163 1164 1165 1166 1167 1168 1169 1170
/*
 * 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.
 */
1171 1172 1173 1174 1175
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;

1176
	if (rqstp->rq_arg.page_len || !test_bit(RQ_USEDEFERRAL, &rqstp->rq_flags))
1177 1178 1179 1180 1181
		return NULL; /* if more than a page, give up FIXME */
	if (rqstp->rq_deferred) {
		dr = rqstp->rq_deferred;
		rqstp->rq_deferred = NULL;
	} else {
1182 1183
		size_t skip;
		size_t size;
1184
		/* FIXME maybe discard if size too large */
1185
		size = sizeof(struct svc_deferred_req) + rqstp->rq_arg.len;
1186 1187 1188 1189 1190 1191 1192 1193 1194 1195
		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;
1196 1197 1198 1199 1200 1201
		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);
1202 1203 1204
	}
	svc_xprt_get(rqstp->rq_xprt);
	dr->xprt = rqstp->rq_xprt;
1205
	set_bit(RQ_DROPME, &rqstp->rq_flags);
1206 1207

	dr->handle.revisit = svc_revisit;
1208
	trace_svc_defer(rqstp);
1209 1210 1211 1212 1213 1214 1215 1216 1217 1218
	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;

1219 1220 1221 1222
	/* 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;
1223
	rqstp->rq_arg.page_len = 0;
1224 1225
	/* The rq_arg.len includes the transport header bytes */
	rqstp->rq_arg.len     = dr->argslen<<2;
1226 1227 1228
	rqstp->rq_prot        = dr->prot;
	memcpy(&rqstp->rq_addr, &dr->addr, dr->addrlen);
	rqstp->rq_addrlen     = dr->addrlen;
1229 1230
	/* Save off transport header len in case we get deferred again */
	rqstp->rq_xprt_hlen   = dr->xprt_hlen;
1231 1232
	rqstp->rq_daddr       = dr->daddr;
	rqstp->rq_respages    = rqstp->rq_pages;
1233
	return (dr->argslen<<2) - dr->xprt_hlen;
1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248
}


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);
1249
		trace_svc_revisit_deferred(dr);
1250 1251
	} else
		clear_bit(XPT_DEFERRED, &xprt->xpt_flags);
1252 1253 1254
	spin_unlock(&xprt->xpt_lock);
	return dr;
}
1255

1256 1257 1258 1259
/**
 * svc_find_xprt - find an RPC transport instance
 * @serv: pointer to svc_serv to search
 * @xcl_name: C string containing transport's class name
1260
 * @net: owner net pointer
1261 1262 1263
 * @af: Address family of transport's local address
 * @port: transport's IP port number
 *
1264 1265 1266 1267 1268 1269 1270 1271
 * 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.
 */
1272
struct svc_xprt *svc_find_xprt(struct svc_serv *serv, const char *xcl_name,
1273 1274
			       struct net *net, const sa_family_t af,
			       const unsigned short port)
1275 1276 1277 1278 1279
{
	struct svc_xprt *xprt;
	struct svc_xprt *found = NULL;

	/* Sanity check the args */
1280
	if (serv == NULL || xcl_name == NULL)
1281 1282 1283 1284
		return found;

	spin_lock_bh(&serv->sv_lock);
	list_for_each_entry(xprt, &serv->sv_permsocks, xpt_list) {
1285 1286
		if (xprt->xpt_net != net)
			continue;
1287 1288 1289 1290
		if (strcmp(xprt->xpt_class->xcl_name, xcl_name))
			continue;
		if (af != AF_UNSPEC && af != xprt->xpt_local.ss_family)
			continue;
1291
		if (port != 0 && port != svc_xprt_local_port(xprt))
1292 1293
			continue;
		found = xprt;
1294
		svc_xprt_get(xprt);
1295 1296 1297 1298 1299 1300
		break;
	}
	spin_unlock_bh(&serv->sv_lock);
	return found;
}
EXPORT_SYMBOL_GPL(svc_find_xprt);
1301

1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325
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.
1326
 */
1327
int svc_xprt_names(struct svc_serv *serv, char *buf, const int buflen)
1328 1329
{
	struct svc_xprt *xprt;
1330 1331
	int len, totlen;
	char *pos;
1332 1333 1334 1335 1336 1337

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

	spin_lock_bh(&serv->sv_lock);
1338 1339 1340

	pos = buf;
	totlen = 0;
1341
	list_for_each_entry(xprt, &serv->sv_permsocks, xpt_list) {
1342 1343 1344 1345 1346 1347
		len = svc_one_xprt_name(xprt, pos, buflen - totlen);
		if (len < 0) {
			*buf = '\0';
			totlen = len;
		}
		if (len <= 0)
1348
			break;
1349 1350

		pos += len;
1351 1352
		totlen += len;
	}
1353

1354 1355 1356 1357
	spin_unlock_bh(&serv->sv_lock);
	return totlen;
}
EXPORT_SYMBOL_GPL(svc_xprt_names);
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 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402


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

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) {
1403
		seq_puts(m, "# pool packets-arrived sockets-enqueued threads-woken threads-timedout\n");
1404 1405 1406
		return 0;
	}

1407
	seq_printf(m, "%u %lu %lu %lu %lu\n",
1408
		pool->sp_id,
1409
		(unsigned long)atomic_long_read(&pool->sp_stats.packets),
1410
		pool->sp_stats.sockets_queued,
1411 1412
		(unsigned long)atomic_long_read(&pool->sp_stats.threads_woken),
		(unsigned long)atomic_long_read(&pool->sp_stats.threads_timedout));
1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435

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

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