blob: f911153339a964235510264ab41752cdca89afb1 [file] [log] [blame]
David Brazdil0f672f62019-12-10 10:32:29 +00001// SPDX-License-Identifier: GPL-2.0-only
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002/*
3 * linux/net/sunrpc/svc_xprt.c
4 *
5 * Author: Tom Tucker <tom@opengridcomputing.com>
6 */
7
8#include <linux/sched.h>
9#include <linux/errno.h>
10#include <linux/freezer.h>
11#include <linux/kthread.h>
12#include <linux/slab.h>
13#include <net/sock.h>
14#include <linux/sunrpc/addr.h>
15#include <linux/sunrpc/stats.h>
16#include <linux/sunrpc/svc_xprt.h>
17#include <linux/sunrpc/svcsock.h>
18#include <linux/sunrpc/xprt.h>
19#include <linux/module.h>
20#include <linux/netdevice.h>
21#include <trace/events/sunrpc.h>
22
23#define RPCDBG_FACILITY RPCDBG_SVCXPRT
24
25static unsigned int svc_rpc_per_connection_limit __read_mostly;
26module_param(svc_rpc_per_connection_limit, uint, 0644);
27
28
29static struct svc_deferred_req *svc_deferred_dequeue(struct svc_xprt *xprt);
30static int svc_deferred_recv(struct svc_rqst *rqstp);
31static struct cache_deferred_req *svc_defer(struct cache_req *req);
32static void svc_age_temp_xprts(struct timer_list *t);
33static void svc_delete_xprt(struct svc_xprt *xprt);
34
35/* apparently the "standard" is that clients close
36 * idle connections after 5 minutes, servers after
37 * 6 minutes
David Brazdil0f672f62019-12-10 10:32:29 +000038 * http://nfsv4bat.org/Documents/ConnectAThon/1996/nfstcp.pdf
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000039 */
40static int svc_conn_age_period = 6*60;
41
42/* List of registered transport classes */
43static DEFINE_SPINLOCK(svc_xprt_class_lock);
44static LIST_HEAD(svc_xprt_class_list);
45
46/* SMP locking strategy:
47 *
48 * svc_pool->sp_lock protects most of the fields of that pool.
49 * svc_serv->sv_lock protects sv_tempsocks, sv_permsocks, sv_tmpcnt.
50 * when both need to be taken (rare), svc_serv->sv_lock is first.
51 * The "service mutex" protects svc_serv->sv_nrthread.
52 * svc_sock->sk_lock protects the svc_sock->sk_deferred list
53 * and the ->sk_info_authunix cache.
54 *
55 * The XPT_BUSY bit in xprt->xpt_flags prevents a transport being
56 * enqueued multiply. During normal transport processing this bit
57 * is set by svc_xprt_enqueue and cleared by svc_xprt_received.
58 * Providers should not manipulate this bit directly.
59 *
60 * Some flags can be set to certain values at any time
61 * providing that certain rules are followed:
62 *
63 * XPT_CONN, XPT_DATA:
64 * - Can be set or cleared at any time.
65 * - After a set, svc_xprt_enqueue must be called to enqueue
66 * the transport for processing.
67 * - After a clear, the transport must be read/accepted.
68 * If this succeeds, it must be set again.
69 * XPT_CLOSE:
70 * - Can set at any time. It is never cleared.
71 * XPT_DEAD:
72 * - Can only be set while XPT_BUSY is held which ensures
73 * that no other thread will be using the transport or will
74 * try to set XPT_DEAD.
75 */
76int svc_reg_xprt_class(struct svc_xprt_class *xcl)
77{
78 struct svc_xprt_class *cl;
79 int res = -EEXIST;
80
81 dprintk("svc: Adding svc transport class '%s'\n", xcl->xcl_name);
82
83 INIT_LIST_HEAD(&xcl->xcl_list);
84 spin_lock(&svc_xprt_class_lock);
85 /* Make sure there isn't already a class with the same name */
86 list_for_each_entry(cl, &svc_xprt_class_list, xcl_list) {
87 if (strcmp(xcl->xcl_name, cl->xcl_name) == 0)
88 goto out;
89 }
90 list_add_tail(&xcl->xcl_list, &svc_xprt_class_list);
91 res = 0;
92out:
93 spin_unlock(&svc_xprt_class_lock);
94 return res;
95}
96EXPORT_SYMBOL_GPL(svc_reg_xprt_class);
97
98void svc_unreg_xprt_class(struct svc_xprt_class *xcl)
99{
100 dprintk("svc: Removing svc transport class '%s'\n", xcl->xcl_name);
101 spin_lock(&svc_xprt_class_lock);
102 list_del_init(&xcl->xcl_list);
103 spin_unlock(&svc_xprt_class_lock);
104}
105EXPORT_SYMBOL_GPL(svc_unreg_xprt_class);
106
Olivier Deprez0e641232021-09-23 10:07:05 +0200107/**
108 * svc_print_xprts - Format the transport list for printing
109 * @buf: target buffer for formatted address
110 * @maxlen: length of target buffer
111 *
112 * Fills in @buf with a string containing a list of transport names, each name
113 * terminated with '\n'. If the buffer is too small, some entries may be
114 * missing, but it is guaranteed that all lines in the output buffer are
115 * complete.
116 *
117 * Returns positive length of the filled-in string.
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000118 */
119int svc_print_xprts(char *buf, int maxlen)
120{
121 struct svc_xprt_class *xcl;
122 char tmpstr[80];
123 int len = 0;
124 buf[0] = '\0';
125
126 spin_lock(&svc_xprt_class_lock);
127 list_for_each_entry(xcl, &svc_xprt_class_list, xcl_list) {
128 int slen;
129
Olivier Deprez0e641232021-09-23 10:07:05 +0200130 slen = snprintf(tmpstr, sizeof(tmpstr), "%s %d\n",
131 xcl->xcl_name, xcl->xcl_max_payload);
132 if (slen >= sizeof(tmpstr) || len + slen >= maxlen)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000133 break;
134 len += slen;
135 strcat(buf, tmpstr);
136 }
137 spin_unlock(&svc_xprt_class_lock);
138
139 return len;
140}
141
142static void svc_xprt_free(struct kref *kref)
143{
144 struct svc_xprt *xprt =
145 container_of(kref, struct svc_xprt, xpt_ref);
146 struct module *owner = xprt->xpt_class->xcl_owner;
147 if (test_bit(XPT_CACHE_AUTH, &xprt->xpt_flags))
148 svcauth_unix_info_release(xprt);
David Brazdil0f672f62019-12-10 10:32:29 +0000149 put_cred(xprt->xpt_cred);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000150 put_net(xprt->xpt_net);
151 /* See comment on corresponding get in xs_setup_bc_tcp(): */
152 if (xprt->xpt_bc_xprt)
153 xprt_put(xprt->xpt_bc_xprt);
154 if (xprt->xpt_bc_xps)
155 xprt_switch_put(xprt->xpt_bc_xps);
156 xprt->xpt_ops->xpo_free(xprt);
157 module_put(owner);
158}
159
160void svc_xprt_put(struct svc_xprt *xprt)
161{
162 kref_put(&xprt->xpt_ref, svc_xprt_free);
163}
164EXPORT_SYMBOL_GPL(svc_xprt_put);
165
166/*
167 * Called by transport drivers to initialize the transport independent
168 * portion of the transport instance.
169 */
170void svc_xprt_init(struct net *net, struct svc_xprt_class *xcl,
171 struct svc_xprt *xprt, struct svc_serv *serv)
172{
173 memset(xprt, 0, sizeof(*xprt));
174 xprt->xpt_class = xcl;
175 xprt->xpt_ops = xcl->xcl_ops;
176 kref_init(&xprt->xpt_ref);
177 xprt->xpt_server = serv;
178 INIT_LIST_HEAD(&xprt->xpt_list);
179 INIT_LIST_HEAD(&xprt->xpt_ready);
180 INIT_LIST_HEAD(&xprt->xpt_deferred);
181 INIT_LIST_HEAD(&xprt->xpt_users);
182 mutex_init(&xprt->xpt_mutex);
183 spin_lock_init(&xprt->xpt_lock);
184 set_bit(XPT_BUSY, &xprt->xpt_flags);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000185 xprt->xpt_net = get_net(net);
186 strcpy(xprt->xpt_remotebuf, "uninitialized");
187}
188EXPORT_SYMBOL_GPL(svc_xprt_init);
189
190static struct svc_xprt *__svc_xpo_create(struct svc_xprt_class *xcl,
191 struct svc_serv *serv,
192 struct net *net,
193 const int family,
194 const unsigned short port,
195 int flags)
196{
197 struct sockaddr_in sin = {
198 .sin_family = AF_INET,
199 .sin_addr.s_addr = htonl(INADDR_ANY),
200 .sin_port = htons(port),
201 };
202#if IS_ENABLED(CONFIG_IPV6)
203 struct sockaddr_in6 sin6 = {
204 .sin6_family = AF_INET6,
205 .sin6_addr = IN6ADDR_ANY_INIT,
206 .sin6_port = htons(port),
207 };
208#endif
209 struct sockaddr *sap;
210 size_t len;
211
212 switch (family) {
213 case PF_INET:
214 sap = (struct sockaddr *)&sin;
215 len = sizeof(sin);
216 break;
217#if IS_ENABLED(CONFIG_IPV6)
218 case PF_INET6:
219 sap = (struct sockaddr *)&sin6;
220 len = sizeof(sin6);
221 break;
222#endif
223 default:
224 return ERR_PTR(-EAFNOSUPPORT);
225 }
226
227 return xcl->xcl_ops->xpo_create(serv, net, sap, len, flags);
228}
229
230/*
231 * svc_xprt_received conditionally queues the transport for processing
232 * by another thread. The caller must hold the XPT_BUSY bit and must
233 * not thereafter touch transport data.
234 *
235 * Note: XPT_DATA only gets cleared when a read-attempt finds no (or
236 * insufficient) data.
237 */
238static void svc_xprt_received(struct svc_xprt *xprt)
239{
240 if (!test_bit(XPT_BUSY, &xprt->xpt_flags)) {
241 WARN_ONCE(1, "xprt=0x%p already busy!", xprt);
242 return;
243 }
244
245 /* As soon as we clear busy, the xprt could be closed and
246 * 'put', so we need a reference to call svc_enqueue_xprt with:
247 */
248 svc_xprt_get(xprt);
249 smp_mb__before_atomic();
250 clear_bit(XPT_BUSY, &xprt->xpt_flags);
251 xprt->xpt_server->sv_ops->svo_enqueue_xprt(xprt);
252 svc_xprt_put(xprt);
253}
254
255void svc_add_new_perm_xprt(struct svc_serv *serv, struct svc_xprt *new)
256{
257 clear_bit(XPT_TEMP, &new->xpt_flags);
258 spin_lock_bh(&serv->sv_lock);
259 list_add(&new->xpt_list, &serv->sv_permsocks);
260 spin_unlock_bh(&serv->sv_lock);
261 svc_xprt_received(new);
262}
263
264static int _svc_create_xprt(struct svc_serv *serv, const char *xprt_name,
265 struct net *net, const int family,
David Brazdil0f672f62019-12-10 10:32:29 +0000266 const unsigned short port, int flags,
267 const struct cred *cred)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000268{
269 struct svc_xprt_class *xcl;
270
271 spin_lock(&svc_xprt_class_lock);
272 list_for_each_entry(xcl, &svc_xprt_class_list, xcl_list) {
273 struct svc_xprt *newxprt;
274 unsigned short newport;
275
276 if (strcmp(xprt_name, xcl->xcl_name))
277 continue;
278
279 if (!try_module_get(xcl->xcl_owner))
280 goto err;
281
282 spin_unlock(&svc_xprt_class_lock);
283 newxprt = __svc_xpo_create(xcl, serv, net, family, port, flags);
284 if (IS_ERR(newxprt)) {
285 module_put(xcl->xcl_owner);
286 return PTR_ERR(newxprt);
287 }
David Brazdil0f672f62019-12-10 10:32:29 +0000288 newxprt->xpt_cred = get_cred(cred);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000289 svc_add_new_perm_xprt(serv, newxprt);
290 newport = svc_xprt_local_port(newxprt);
291 return newport;
292 }
293 err:
294 spin_unlock(&svc_xprt_class_lock);
295 /* This errno is exposed to user space. Provide a reasonable
296 * perror msg for a bad transport. */
297 return -EPROTONOSUPPORT;
298}
299
300int svc_create_xprt(struct svc_serv *serv, const char *xprt_name,
301 struct net *net, const int family,
David Brazdil0f672f62019-12-10 10:32:29 +0000302 const unsigned short port, int flags,
303 const struct cred *cred)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000304{
305 int err;
306
307 dprintk("svc: creating transport %s[%d]\n", xprt_name, port);
David Brazdil0f672f62019-12-10 10:32:29 +0000308 err = _svc_create_xprt(serv, xprt_name, net, family, port, flags, cred);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000309 if (err == -EPROTONOSUPPORT) {
310 request_module("svc%s", xprt_name);
David Brazdil0f672f62019-12-10 10:32:29 +0000311 err = _svc_create_xprt(serv, xprt_name, net, family, port, flags, cred);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000312 }
David Brazdil0f672f62019-12-10 10:32:29 +0000313 if (err < 0)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000314 dprintk("svc: transport %s not found, err %d\n",
David Brazdil0f672f62019-12-10 10:32:29 +0000315 xprt_name, -err);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000316 return err;
317}
318EXPORT_SYMBOL_GPL(svc_create_xprt);
319
320/*
321 * Copy the local and remote xprt addresses to the rqstp structure
322 */
323void svc_xprt_copy_addrs(struct svc_rqst *rqstp, struct svc_xprt *xprt)
324{
325 memcpy(&rqstp->rq_addr, &xprt->xpt_remote, xprt->xpt_remotelen);
326 rqstp->rq_addrlen = xprt->xpt_remotelen;
327
328 /*
329 * Destination address in request is needed for binding the
330 * source address in RPC replies/callbacks later.
331 */
332 memcpy(&rqstp->rq_daddr, &xprt->xpt_local, xprt->xpt_locallen);
333 rqstp->rq_daddrlen = xprt->xpt_locallen;
334}
335EXPORT_SYMBOL_GPL(svc_xprt_copy_addrs);
336
337/**
338 * svc_print_addr - Format rq_addr field for printing
339 * @rqstp: svc_rqst struct containing address to print
340 * @buf: target buffer for formatted address
341 * @len: length of target buffer
342 *
343 */
344char *svc_print_addr(struct svc_rqst *rqstp, char *buf, size_t len)
345{
346 return __svc_print_addr(svc_addr(rqstp), buf, len);
347}
348EXPORT_SYMBOL_GPL(svc_print_addr);
349
350static bool svc_xprt_slots_in_range(struct svc_xprt *xprt)
351{
352 unsigned int limit = svc_rpc_per_connection_limit;
353 int nrqsts = atomic_read(&xprt->xpt_nr_rqsts);
354
355 return limit == 0 || (nrqsts >= 0 && nrqsts < limit);
356}
357
358static bool svc_xprt_reserve_slot(struct svc_rqst *rqstp, struct svc_xprt *xprt)
359{
360 if (!test_bit(RQ_DATA, &rqstp->rq_flags)) {
361 if (!svc_xprt_slots_in_range(xprt))
362 return false;
363 atomic_inc(&xprt->xpt_nr_rqsts);
364 set_bit(RQ_DATA, &rqstp->rq_flags);
365 }
366 return true;
367}
368
369static void svc_xprt_release_slot(struct svc_rqst *rqstp)
370{
371 struct svc_xprt *xprt = rqstp->rq_xprt;
372 if (test_and_clear_bit(RQ_DATA, &rqstp->rq_flags)) {
373 atomic_dec(&xprt->xpt_nr_rqsts);
David Brazdil0f672f62019-12-10 10:32:29 +0000374 smp_wmb(); /* See smp_rmb() in svc_xprt_ready() */
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000375 svc_xprt_enqueue(xprt);
376 }
377}
378
David Brazdil0f672f62019-12-10 10:32:29 +0000379static bool svc_xprt_ready(struct svc_xprt *xprt)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000380{
David Brazdil0f672f62019-12-10 10:32:29 +0000381 unsigned long xpt_flags;
382
383 /*
384 * If another cpu has recently updated xpt_flags,
385 * sk_sock->flags, xpt_reserved, or xpt_nr_rqsts, we need to
386 * know about it; otherwise it's possible that both that cpu and
387 * this one could call svc_xprt_enqueue() without either
388 * svc_xprt_enqueue() recognizing that the conditions below
389 * are satisfied, and we could stall indefinitely:
390 */
391 smp_rmb();
392 xpt_flags = READ_ONCE(xprt->xpt_flags);
393
394 if (xpt_flags & (BIT(XPT_CONN) | BIT(XPT_CLOSE)))
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000395 return true;
David Brazdil0f672f62019-12-10 10:32:29 +0000396 if (xpt_flags & (BIT(XPT_DATA) | BIT(XPT_DEFERRED))) {
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000397 if (xprt->xpt_ops->xpo_has_wspace(xprt) &&
398 svc_xprt_slots_in_range(xprt))
399 return true;
400 trace_svc_xprt_no_write_space(xprt);
401 return false;
402 }
403 return false;
404}
405
406void svc_xprt_do_enqueue(struct svc_xprt *xprt)
407{
408 struct svc_pool *pool;
409 struct svc_rqst *rqstp = NULL;
410 int cpu;
411
David Brazdil0f672f62019-12-10 10:32:29 +0000412 if (!svc_xprt_ready(xprt))
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000413 return;
414
415 /* Mark transport as busy. It will remain in this state until
416 * the provider calls svc_xprt_received. We update XPT_BUSY
417 * atomically because it also guards against trying to enqueue
418 * the transport twice.
419 */
420 if (test_and_set_bit(XPT_BUSY, &xprt->xpt_flags))
421 return;
422
423 cpu = get_cpu();
424 pool = svc_pool_for_cpu(xprt->xpt_server, cpu);
425
426 atomic_long_inc(&pool->sp_stats.packets);
427
428 spin_lock_bh(&pool->sp_lock);
429 list_add_tail(&xprt->xpt_ready, &pool->sp_sockets);
430 pool->sp_stats.sockets_queued++;
431 spin_unlock_bh(&pool->sp_lock);
432
433 /* find a thread for this xprt */
434 rcu_read_lock();
435 list_for_each_entry_rcu(rqstp, &pool->sp_all_threads, rq_all) {
436 if (test_and_set_bit(RQ_BUSY, &rqstp->rq_flags))
437 continue;
438 atomic_long_inc(&pool->sp_stats.threads_woken);
439 rqstp->rq_qtime = ktime_get();
440 wake_up_process(rqstp->rq_task);
441 goto out_unlock;
442 }
443 set_bit(SP_CONGESTED, &pool->sp_flags);
444 rqstp = NULL;
445out_unlock:
446 rcu_read_unlock();
447 put_cpu();
448 trace_svc_xprt_do_enqueue(xprt, rqstp);
449}
450EXPORT_SYMBOL_GPL(svc_xprt_do_enqueue);
451
452/*
453 * Queue up a transport with data pending. If there are idle nfsd
454 * processes, wake 'em up.
455 *
456 */
457void svc_xprt_enqueue(struct svc_xprt *xprt)
458{
459 if (test_bit(XPT_BUSY, &xprt->xpt_flags))
460 return;
461 xprt->xpt_server->sv_ops->svo_enqueue_xprt(xprt);
462}
463EXPORT_SYMBOL_GPL(svc_xprt_enqueue);
464
465/*
466 * Dequeue the first transport, if there is one.
467 */
468static struct svc_xprt *svc_xprt_dequeue(struct svc_pool *pool)
469{
470 struct svc_xprt *xprt = NULL;
471
472 if (list_empty(&pool->sp_sockets))
473 goto out;
474
475 spin_lock_bh(&pool->sp_lock);
476 if (likely(!list_empty(&pool->sp_sockets))) {
477 xprt = list_first_entry(&pool->sp_sockets,
478 struct svc_xprt, xpt_ready);
479 list_del_init(&xprt->xpt_ready);
480 svc_xprt_get(xprt);
481 }
482 spin_unlock_bh(&pool->sp_lock);
483out:
484 return xprt;
485}
486
487/**
488 * svc_reserve - change the space reserved for the reply to a request.
489 * @rqstp: The request in question
490 * @space: new max space to reserve
491 *
492 * Each request reserves some space on the output queue of the transport
493 * to make sure the reply fits. This function reduces that reserved
494 * space to be the amount of space used already, plus @space.
495 *
496 */
497void svc_reserve(struct svc_rqst *rqstp, int space)
498{
David Brazdil0f672f62019-12-10 10:32:29 +0000499 struct svc_xprt *xprt = rqstp->rq_xprt;
500
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000501 space += rqstp->rq_res.head[0].iov_len;
502
David Brazdil0f672f62019-12-10 10:32:29 +0000503 if (xprt && space < rqstp->rq_reserved) {
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000504 atomic_sub((rqstp->rq_reserved - space), &xprt->xpt_reserved);
505 rqstp->rq_reserved = space;
David Brazdil0f672f62019-12-10 10:32:29 +0000506 smp_wmb(); /* See smp_rmb() in svc_xprt_ready() */
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000507 svc_xprt_enqueue(xprt);
508 }
509}
510EXPORT_SYMBOL_GPL(svc_reserve);
511
512static void svc_xprt_release(struct svc_rqst *rqstp)
513{
514 struct svc_xprt *xprt = rqstp->rq_xprt;
515
516 xprt->xpt_ops->xpo_release_rqst(rqstp);
517
518 kfree(rqstp->rq_deferred);
519 rqstp->rq_deferred = NULL;
520
521 svc_free_res_pages(rqstp);
522 rqstp->rq_res.page_len = 0;
523 rqstp->rq_res.page_base = 0;
524
525 /* Reset response buffer and release
526 * the reservation.
527 * But first, check that enough space was reserved
528 * for the reply, otherwise we have a bug!
529 */
530 if ((rqstp->rq_res.len) > rqstp->rq_reserved)
531 printk(KERN_ERR "RPC request reserved %d but used %d\n",
532 rqstp->rq_reserved,
533 rqstp->rq_res.len);
534
535 rqstp->rq_res.head[0].iov_len = 0;
536 svc_reserve(rqstp, 0);
537 svc_xprt_release_slot(rqstp);
538 rqstp->rq_xprt = NULL;
539 svc_xprt_put(xprt);
540}
541
542/*
543 * Some svc_serv's will have occasional work to do, even when a xprt is not
544 * waiting to be serviced. This function is there to "kick" a task in one of
545 * those services so that it can wake up and do that work. Note that we only
546 * bother with pool 0 as we don't need to wake up more than one thread for
547 * this purpose.
548 */
549void svc_wake_up(struct svc_serv *serv)
550{
551 struct svc_rqst *rqstp;
552 struct svc_pool *pool;
553
554 pool = &serv->sv_pools[0];
555
556 rcu_read_lock();
557 list_for_each_entry_rcu(rqstp, &pool->sp_all_threads, rq_all) {
558 /* skip any that aren't queued */
559 if (test_bit(RQ_BUSY, &rqstp->rq_flags))
560 continue;
561 rcu_read_unlock();
562 wake_up_process(rqstp->rq_task);
563 trace_svc_wake_up(rqstp->rq_task->pid);
564 return;
565 }
566 rcu_read_unlock();
567
568 /* No free entries available */
569 set_bit(SP_TASK_PENDING, &pool->sp_flags);
570 smp_wmb();
571 trace_svc_wake_up(0);
572}
573EXPORT_SYMBOL_GPL(svc_wake_up);
574
575int svc_port_is_privileged(struct sockaddr *sin)
576{
577 switch (sin->sa_family) {
578 case AF_INET:
579 return ntohs(((struct sockaddr_in *)sin)->sin_port)
580 < PROT_SOCK;
581 case AF_INET6:
582 return ntohs(((struct sockaddr_in6 *)sin)->sin6_port)
583 < PROT_SOCK;
584 default:
585 return 0;
586 }
587}
588
589/*
590 * Make sure that we don't have too many active connections. If we have,
591 * something must be dropped. It's not clear what will happen if we allow
592 * "too many" connections, but when dealing with network-facing software,
593 * we have to code defensively. Here we do that by imposing hard limits.
594 *
595 * There's no point in trying to do random drop here for DoS
596 * prevention. The NFS clients does 1 reconnect in 15 seconds. An
597 * attacker can easily beat that.
598 *
599 * The only somewhat efficient mechanism would be if drop old
600 * connections from the same IP first. But right now we don't even
601 * record the client IP in svc_sock.
602 *
603 * single-threaded services that expect a lot of clients will probably
604 * need to set sv_maxconn to override the default value which is based
605 * on the number of threads
606 */
607static void svc_check_conn_limits(struct svc_serv *serv)
608{
609 unsigned int limit = serv->sv_maxconn ? serv->sv_maxconn :
610 (serv->sv_nrthreads+3) * 20;
611
612 if (serv->sv_tmpcnt > limit) {
613 struct svc_xprt *xprt = NULL;
614 spin_lock_bh(&serv->sv_lock);
615 if (!list_empty(&serv->sv_tempsocks)) {
616 /* Try to help the admin */
617 net_notice_ratelimited("%s: too many open connections, consider increasing the %s\n",
618 serv->sv_name, serv->sv_maxconn ?
619 "max number of connections" :
620 "number of threads");
621 /*
622 * Always select the oldest connection. It's not fair,
623 * but so is life
624 */
625 xprt = list_entry(serv->sv_tempsocks.prev,
626 struct svc_xprt,
627 xpt_list);
628 set_bit(XPT_CLOSE, &xprt->xpt_flags);
629 svc_xprt_get(xprt);
630 }
631 spin_unlock_bh(&serv->sv_lock);
632
633 if (xprt) {
634 svc_xprt_enqueue(xprt);
635 svc_xprt_put(xprt);
636 }
637 }
638}
639
640static int svc_alloc_arg(struct svc_rqst *rqstp)
641{
642 struct svc_serv *serv = rqstp->rq_server;
643 struct xdr_buf *arg;
644 int pages;
645 int i;
646
647 /* now allocate needed pages. If we get a failure, sleep briefly */
648 pages = (serv->sv_max_mesg + 2 * PAGE_SIZE) >> PAGE_SHIFT;
649 if (pages > RPCSVC_MAXPAGES) {
650 pr_warn_once("svc: warning: pages=%u > RPCSVC_MAXPAGES=%lu\n",
651 pages, RPCSVC_MAXPAGES);
652 /* use as many pages as possible */
653 pages = RPCSVC_MAXPAGES;
654 }
655 for (i = 0; i < pages ; i++)
656 while (rqstp->rq_pages[i] == NULL) {
657 struct page *p = alloc_page(GFP_KERNEL);
658 if (!p) {
659 set_current_state(TASK_INTERRUPTIBLE);
660 if (signalled() || kthread_should_stop()) {
661 set_current_state(TASK_RUNNING);
662 return -EINTR;
663 }
664 schedule_timeout(msecs_to_jiffies(500));
665 }
666 rqstp->rq_pages[i] = p;
667 }
668 rqstp->rq_page_end = &rqstp->rq_pages[i];
669 rqstp->rq_pages[i++] = NULL; /* this might be seen in nfs_read_actor */
670
671 /* Make arg->head point to first page and arg->pages point to rest */
672 arg = &rqstp->rq_arg;
673 arg->head[0].iov_base = page_address(rqstp->rq_pages[0]);
674 arg->head[0].iov_len = PAGE_SIZE;
675 arg->pages = rqstp->rq_pages + 1;
676 arg->page_base = 0;
677 /* save at least one page for response */
678 arg->page_len = (pages-2)*PAGE_SIZE;
679 arg->len = (pages-1)*PAGE_SIZE;
680 arg->tail[0].iov_len = 0;
681 return 0;
682}
683
684static bool
685rqst_should_sleep(struct svc_rqst *rqstp)
686{
687 struct svc_pool *pool = rqstp->rq_pool;
688
689 /* did someone call svc_wake_up? */
690 if (test_and_clear_bit(SP_TASK_PENDING, &pool->sp_flags))
691 return false;
692
693 /* was a socket queued? */
694 if (!list_empty(&pool->sp_sockets))
695 return false;
696
697 /* are we shutting down? */
698 if (signalled() || kthread_should_stop())
699 return false;
700
701 /* are we freezing? */
702 if (freezing(current))
703 return false;
704
705 return true;
706}
707
708static struct svc_xprt *svc_get_next_xprt(struct svc_rqst *rqstp, long timeout)
709{
710 struct svc_pool *pool = rqstp->rq_pool;
711 long time_left = 0;
712
713 /* rq_xprt should be clear on entry */
714 WARN_ON_ONCE(rqstp->rq_xprt);
715
716 rqstp->rq_xprt = svc_xprt_dequeue(pool);
717 if (rqstp->rq_xprt)
718 goto out_found;
719
720 /*
721 * We have to be able to interrupt this wait
722 * to bring down the daemons ...
723 */
724 set_current_state(TASK_INTERRUPTIBLE);
725 smp_mb__before_atomic();
726 clear_bit(SP_CONGESTED, &pool->sp_flags);
727 clear_bit(RQ_BUSY, &rqstp->rq_flags);
728 smp_mb__after_atomic();
729
730 if (likely(rqst_should_sleep(rqstp)))
731 time_left = schedule_timeout(timeout);
732 else
733 __set_current_state(TASK_RUNNING);
734
735 try_to_freeze();
736
737 set_bit(RQ_BUSY, &rqstp->rq_flags);
738 smp_mb__after_atomic();
739 rqstp->rq_xprt = svc_xprt_dequeue(pool);
740 if (rqstp->rq_xprt)
741 goto out_found;
742
743 if (!time_left)
744 atomic_long_inc(&pool->sp_stats.threads_timedout);
745
746 if (signalled() || kthread_should_stop())
747 return ERR_PTR(-EINTR);
748 return ERR_PTR(-EAGAIN);
749out_found:
750 /* Normally we will wait up to 5 seconds for any required
751 * cache information to be provided.
752 */
753 if (!test_bit(SP_CONGESTED, &pool->sp_flags))
754 rqstp->rq_chandle.thread_wait = 5*HZ;
755 else
756 rqstp->rq_chandle.thread_wait = 1*HZ;
757 trace_svc_xprt_dequeue(rqstp);
758 return rqstp->rq_xprt;
759}
760
761static void svc_add_new_temp_xprt(struct svc_serv *serv, struct svc_xprt *newxpt)
762{
763 spin_lock_bh(&serv->sv_lock);
764 set_bit(XPT_TEMP, &newxpt->xpt_flags);
765 list_add(&newxpt->xpt_list, &serv->sv_tempsocks);
766 serv->sv_tmpcnt++;
767 if (serv->sv_temptimer.function == NULL) {
768 /* setup timer to age temp transports */
769 serv->sv_temptimer.function = svc_age_temp_xprts;
770 mod_timer(&serv->sv_temptimer,
771 jiffies + svc_conn_age_period * HZ);
772 }
773 spin_unlock_bh(&serv->sv_lock);
774 svc_xprt_received(newxpt);
775}
776
777static int svc_handle_xprt(struct svc_rqst *rqstp, struct svc_xprt *xprt)
778{
779 struct svc_serv *serv = rqstp->rq_server;
780 int len = 0;
781
782 if (test_bit(XPT_CLOSE, &xprt->xpt_flags)) {
783 dprintk("svc_recv: found XPT_CLOSE\n");
784 if (test_and_clear_bit(XPT_KILL_TEMP, &xprt->xpt_flags))
785 xprt->xpt_ops->xpo_kill_temp_xprt(xprt);
786 svc_delete_xprt(xprt);
787 /* Leave XPT_BUSY set on the dead xprt: */
788 goto out;
789 }
790 if (test_bit(XPT_LISTENER, &xprt->xpt_flags)) {
791 struct svc_xprt *newxpt;
792 /*
793 * We know this module_get will succeed because the
794 * listener holds a reference too
795 */
796 __module_get(xprt->xpt_class->xcl_owner);
797 svc_check_conn_limits(xprt->xpt_server);
798 newxpt = xprt->xpt_ops->xpo_accept(xprt);
David Brazdil0f672f62019-12-10 10:32:29 +0000799 if (newxpt) {
800 newxpt->xpt_cred = get_cred(xprt->xpt_cred);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000801 svc_add_new_temp_xprt(serv, newxpt);
David Brazdil0f672f62019-12-10 10:32:29 +0000802 } else
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000803 module_put(xprt->xpt_class->xcl_owner);
804 } else if (svc_xprt_reserve_slot(rqstp, xprt)) {
805 /* XPT_DATA|XPT_DEFERRED case: */
806 dprintk("svc: server %p, pool %u, transport %p, inuse=%d\n",
807 rqstp, rqstp->rq_pool->sp_id, xprt,
808 kref_read(&xprt->xpt_ref));
809 rqstp->rq_deferred = svc_deferred_dequeue(xprt);
810 if (rqstp->rq_deferred)
811 len = svc_deferred_recv(rqstp);
812 else
813 len = xprt->xpt_ops->xpo_recvfrom(rqstp);
814 rqstp->rq_stime = ktime_get();
815 rqstp->rq_reserved = serv->sv_max_mesg;
816 atomic_add(rqstp->rq_reserved, &xprt->xpt_reserved);
817 }
818 /* clear XPT_BUSY: */
819 svc_xprt_received(xprt);
820out:
821 trace_svc_handle_xprt(xprt, len);
822 return len;
823}
824
825/*
826 * Receive the next request on any transport. This code is carefully
827 * organised not to touch any cachelines in the shared svc_serv
828 * structure, only cachelines in the local svc_pool.
829 */
830int svc_recv(struct svc_rqst *rqstp, long timeout)
831{
832 struct svc_xprt *xprt = NULL;
833 struct svc_serv *serv = rqstp->rq_server;
834 int len, err;
835
836 dprintk("svc: server %p waiting for data (to = %ld)\n",
837 rqstp, timeout);
838
839 if (rqstp->rq_xprt)
840 printk(KERN_ERR
841 "svc_recv: service %p, transport not NULL!\n",
842 rqstp);
843
844 err = svc_alloc_arg(rqstp);
845 if (err)
846 goto out;
847
848 try_to_freeze();
849 cond_resched();
850 err = -EINTR;
851 if (signalled() || kthread_should_stop())
852 goto out;
853
854 xprt = svc_get_next_xprt(rqstp, timeout);
855 if (IS_ERR(xprt)) {
856 err = PTR_ERR(xprt);
857 goto out;
858 }
859
860 len = svc_handle_xprt(rqstp, xprt);
861
862 /* No data, incomplete (TCP) read, or accept() */
863 err = -EAGAIN;
864 if (len <= 0)
865 goto out_release;
866
867 clear_bit(XPT_OLD, &xprt->xpt_flags);
868
869 xprt->xpt_ops->xpo_secure_port(rqstp);
870 rqstp->rq_chandle.defer = svc_defer;
871 rqstp->rq_xid = svc_getu32(&rqstp->rq_arg.head[0]);
872
873 if (serv->sv_stats)
874 serv->sv_stats->netcnt++;
875 trace_svc_recv(rqstp, len);
876 return len;
877out_release:
878 rqstp->rq_res.len = 0;
879 svc_xprt_release(rqstp);
880out:
881 return err;
882}
883EXPORT_SYMBOL_GPL(svc_recv);
884
885/*
886 * Drop request
887 */
888void svc_drop(struct svc_rqst *rqstp)
889{
890 trace_svc_drop(rqstp);
891 dprintk("svc: xprt %p dropped request\n", rqstp->rq_xprt);
892 svc_xprt_release(rqstp);
893}
894EXPORT_SYMBOL_GPL(svc_drop);
895
896/*
897 * Return reply to client.
898 */
899int svc_send(struct svc_rqst *rqstp)
900{
901 struct svc_xprt *xprt;
902 int len = -EFAULT;
903 struct xdr_buf *xb;
904
905 xprt = rqstp->rq_xprt;
906 if (!xprt)
907 goto out;
908
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000909 /* calculate over-all length */
910 xb = &rqstp->rq_res;
911 xb->len = xb->head[0].iov_len +
912 xb->page_len +
913 xb->tail[0].iov_len;
914
915 /* Grab mutex to serialize outgoing data. */
916 mutex_lock(&xprt->xpt_mutex);
917 trace_svc_stats_latency(rqstp);
918 if (test_bit(XPT_DEAD, &xprt->xpt_flags)
919 || test_bit(XPT_CLOSE, &xprt->xpt_flags))
920 len = -ENOTCONN;
921 else
922 len = xprt->xpt_ops->xpo_sendto(rqstp);
923 mutex_unlock(&xprt->xpt_mutex);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000924 trace_svc_send(rqstp, len);
925 svc_xprt_release(rqstp);
926
927 if (len == -ECONNREFUSED || len == -ENOTCONN || len == -EAGAIN)
928 len = 0;
929out:
930 return len;
931}
932
933/*
934 * Timer function to close old temporary transports, using
935 * a mark-and-sweep algorithm.
936 */
937static void svc_age_temp_xprts(struct timer_list *t)
938{
939 struct svc_serv *serv = from_timer(serv, t, sv_temptimer);
940 struct svc_xprt *xprt;
941 struct list_head *le, *next;
942
943 dprintk("svc_age_temp_xprts\n");
944
945 if (!spin_trylock_bh(&serv->sv_lock)) {
946 /* busy, try again 1 sec later */
947 dprintk("svc_age_temp_xprts: busy\n");
948 mod_timer(&serv->sv_temptimer, jiffies + HZ);
949 return;
950 }
951
952 list_for_each_safe(le, next, &serv->sv_tempsocks) {
953 xprt = list_entry(le, struct svc_xprt, xpt_list);
954
955 /* First time through, just mark it OLD. Second time
956 * through, close it. */
957 if (!test_and_set_bit(XPT_OLD, &xprt->xpt_flags))
958 continue;
959 if (kref_read(&xprt->xpt_ref) > 1 ||
960 test_bit(XPT_BUSY, &xprt->xpt_flags))
961 continue;
962 list_del_init(le);
963 set_bit(XPT_CLOSE, &xprt->xpt_flags);
964 dprintk("queuing xprt %p for closing\n", xprt);
965
966 /* a thread will dequeue and close it soon */
967 svc_xprt_enqueue(xprt);
968 }
969 spin_unlock_bh(&serv->sv_lock);
970
971 mod_timer(&serv->sv_temptimer, jiffies + svc_conn_age_period * HZ);
972}
973
974/* Close temporary transports whose xpt_local matches server_addr immediately
975 * instead of waiting for them to be picked up by the timer.
976 *
977 * This is meant to be called from a notifier_block that runs when an ip
978 * address is deleted.
979 */
980void svc_age_temp_xprts_now(struct svc_serv *serv, struct sockaddr *server_addr)
981{
982 struct svc_xprt *xprt;
983 struct list_head *le, *next;
984 LIST_HEAD(to_be_closed);
985
986 spin_lock_bh(&serv->sv_lock);
987 list_for_each_safe(le, next, &serv->sv_tempsocks) {
988 xprt = list_entry(le, struct svc_xprt, xpt_list);
989 if (rpc_cmp_addr(server_addr, (struct sockaddr *)
990 &xprt->xpt_local)) {
991 dprintk("svc_age_temp_xprts_now: found %p\n", xprt);
992 list_move(le, &to_be_closed);
993 }
994 }
995 spin_unlock_bh(&serv->sv_lock);
996
997 while (!list_empty(&to_be_closed)) {
998 le = to_be_closed.next;
999 list_del_init(le);
1000 xprt = list_entry(le, struct svc_xprt, xpt_list);
1001 set_bit(XPT_CLOSE, &xprt->xpt_flags);
1002 set_bit(XPT_KILL_TEMP, &xprt->xpt_flags);
1003 dprintk("svc_age_temp_xprts_now: queuing xprt %p for closing\n",
1004 xprt);
1005 svc_xprt_enqueue(xprt);
1006 }
1007}
1008EXPORT_SYMBOL_GPL(svc_age_temp_xprts_now);
1009
1010static void call_xpt_users(struct svc_xprt *xprt)
1011{
1012 struct svc_xpt_user *u;
1013
1014 spin_lock(&xprt->xpt_lock);
1015 while (!list_empty(&xprt->xpt_users)) {
1016 u = list_first_entry(&xprt->xpt_users, struct svc_xpt_user, list);
1017 list_del_init(&u->list);
1018 u->callback(u);
1019 }
1020 spin_unlock(&xprt->xpt_lock);
1021}
1022
1023/*
1024 * Remove a dead transport
1025 */
1026static void svc_delete_xprt(struct svc_xprt *xprt)
1027{
1028 struct svc_serv *serv = xprt->xpt_server;
1029 struct svc_deferred_req *dr;
1030
1031 /* Only do this once */
1032 if (test_and_set_bit(XPT_DEAD, &xprt->xpt_flags))
1033 BUG();
1034
1035 dprintk("svc: svc_delete_xprt(%p)\n", xprt);
1036 xprt->xpt_ops->xpo_detach(xprt);
Olivier Deprez0e641232021-09-23 10:07:05 +02001037 if (xprt->xpt_bc_xprt)
1038 xprt->xpt_bc_xprt->ops->close(xprt->xpt_bc_xprt);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001039
1040 spin_lock_bh(&serv->sv_lock);
1041 list_del_init(&xprt->xpt_list);
1042 WARN_ON_ONCE(!list_empty(&xprt->xpt_ready));
1043 if (test_bit(XPT_TEMP, &xprt->xpt_flags))
1044 serv->sv_tmpcnt--;
1045 spin_unlock_bh(&serv->sv_lock);
1046
1047 while ((dr = svc_deferred_dequeue(xprt)) != NULL)
1048 kfree(dr);
1049
1050 call_xpt_users(xprt);
1051 svc_xprt_put(xprt);
1052}
1053
1054void svc_close_xprt(struct svc_xprt *xprt)
1055{
1056 set_bit(XPT_CLOSE, &xprt->xpt_flags);
1057 if (test_and_set_bit(XPT_BUSY, &xprt->xpt_flags))
1058 /* someone else will have to effect the close */
1059 return;
1060 /*
1061 * We expect svc_close_xprt() to work even when no threads are
1062 * running (e.g., while configuring the server before starting
1063 * any threads), so if the transport isn't busy, we delete
1064 * it ourself:
1065 */
1066 svc_delete_xprt(xprt);
1067}
1068EXPORT_SYMBOL_GPL(svc_close_xprt);
1069
1070static int svc_close_list(struct svc_serv *serv, struct list_head *xprt_list, struct net *net)
1071{
1072 struct svc_xprt *xprt;
1073 int ret = 0;
1074
Olivier Deprez0e641232021-09-23 10:07:05 +02001075 spin_lock_bh(&serv->sv_lock);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001076 list_for_each_entry(xprt, xprt_list, xpt_list) {
1077 if (xprt->xpt_net != net)
1078 continue;
1079 ret++;
1080 set_bit(XPT_CLOSE, &xprt->xpt_flags);
1081 svc_xprt_enqueue(xprt);
1082 }
Olivier Deprez0e641232021-09-23 10:07:05 +02001083 spin_unlock_bh(&serv->sv_lock);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00001084 return ret;
1085}
1086
1087static struct svc_xprt *svc_dequeue_net(struct svc_serv *serv, struct net *net)
1088{
1089 struct svc_pool *pool;
1090 struct svc_xprt *xprt;
1091 struct svc_xprt *tmp;
1092 int i;
1093
1094 for (i = 0; i < serv->sv_nrpools; i++) {
1095 pool = &serv->sv_pools[i];
1096
1097 spin_lock_bh(&pool->sp_lock);
1098 list_for_each_entry_safe(xprt, tmp, &pool->sp_sockets, xpt_ready) {
1099 if (xprt->xpt_net != net)
1100 continue;
1101 list_del_init(&xprt->xpt_ready);
1102 spin_unlock_bh(&pool->sp_lock);
1103 return xprt;
1104 }
1105 spin_unlock_bh(&pool->sp_lock);
1106 }
1107 return NULL;
1108}
1109
1110static void svc_clean_up_xprts(struct svc_serv *serv, struct net *net)
1111{
1112 struct svc_xprt *xprt;
1113
1114 while ((xprt = svc_dequeue_net(serv, net))) {
1115 set_bit(XPT_CLOSE, &xprt->xpt_flags);
1116 svc_delete_xprt(xprt);
1117 }
1118}
1119
1120/*
1121 * Server threads may still be running (especially in the case where the
1122 * service is still running in other network namespaces).
1123 *
1124 * So we shut down sockets the same way we would on a running server, by
1125 * setting XPT_CLOSE, enqueuing, and letting a thread pick it up to do
1126 * the close. In the case there are no such other threads,
1127 * threads running, svc_clean_up_xprts() does a simple version of a
1128 * server's main event loop, and in the case where there are other
1129 * threads, we may need to wait a little while and then check again to
1130 * see if they're done.
1131 */
1132void svc_close_net(struct svc_serv *serv, struct net *net)
1133{
1134 int delay = 0;
1135
1136 while (svc_close_list(serv, &serv->sv_permsocks, net) +
1137 svc_close_list(serv, &serv->sv_tempsocks, net)) {
1138
1139 svc_clean_up_xprts(serv, net);
1140 msleep(delay++);
1141 }
1142}
1143
1144/*
1145 * Handle defer and revisit of requests
1146 */
1147
1148static void svc_revisit(struct cache_deferred_req *dreq, int too_many)
1149{
1150 struct svc_deferred_req *dr =
1151 container_of(dreq, struct svc_deferred_req, handle);
1152 struct svc_xprt *xprt = dr->xprt;
1153
1154 spin_lock(&xprt->xpt_lock);
1155 set_bit(XPT_DEFERRED, &xprt->xpt_flags);
1156 if (too_many || test_bit(XPT_DEAD, &xprt->xpt_flags)) {
1157 spin_unlock(&xprt->xpt_lock);
1158 dprintk("revisit canceled\n");
1159 svc_xprt_put(xprt);
1160 trace_svc_drop_deferred(dr);
1161 kfree(dr);
1162 return;
1163 }
1164 dprintk("revisit queued\n");
1165 dr->xprt = NULL;
1166 list_add(&dr->handle.recent, &xprt->xpt_deferred);
1167 spin_unlock(&xprt->xpt_lock);
1168 svc_xprt_enqueue(xprt);
1169 svc_xprt_put(xprt);
1170}
1171
1172/*
1173 * Save the request off for later processing. The request buffer looks
1174 * like this:
1175 *
1176 * <xprt-header><rpc-header><rpc-pagelist><rpc-tail>
1177 *
1178 * This code can only handle requests that consist of an xprt-header
1179 * and rpc-header.
1180 */
1181static struct cache_deferred_req *svc_defer(struct cache_req *req)
1182{
1183 struct svc_rqst *rqstp = container_of(req, struct svc_rqst, rq_chandle);
1184 struct svc_deferred_req *dr;
1185
1186 if (rqstp->rq_arg.page_len || !test_bit(RQ_USEDEFERRAL, &rqstp->rq_flags))
1187 return NULL; /* if more than a page, give up FIXME */
1188 if (rqstp->rq_deferred) {
1189 dr = rqstp->rq_deferred;
1190 rqstp->rq_deferred = NULL;
1191 } else {
1192 size_t skip;
1193 size_t size;
1194 /* FIXME maybe discard if size too large */
1195 size = sizeof(struct svc_deferred_req) + rqstp->rq_arg.len;
1196 dr = kmalloc(size, GFP_KERNEL);
1197 if (dr == NULL)
1198 return NULL;
1199
1200 dr->handle.owner = rqstp->rq_server;
1201 dr->prot = rqstp->rq_prot;
1202 memcpy(&dr->addr, &rqstp->rq_addr, rqstp->rq_addrlen);
1203 dr->addrlen = rqstp->rq_addrlen;
1204 dr->daddr = rqstp->rq_daddr;
1205 dr->argslen = rqstp->rq_arg.len >> 2;
1206 dr->xprt_hlen = rqstp->rq_xprt_hlen;
1207
1208 /* back up head to the start of the buffer and copy */
1209 skip = rqstp->rq_arg.len - rqstp->rq_arg.head[0].iov_len;
1210 memcpy(dr->args, rqstp->rq_arg.head[0].iov_base - skip,
1211 dr->argslen << 2);
1212 }
1213 svc_xprt_get(rqstp->rq_xprt);
1214 dr->xprt = rqstp->rq_xprt;
1215 set_bit(RQ_DROPME, &rqstp->rq_flags);
1216
1217 dr->handle.revisit = svc_revisit;
1218 trace_svc_defer(rqstp);
1219 return &dr->handle;
1220}
1221
1222/*
1223 * recv data from a deferred request into an active one
1224 */
1225static int svc_deferred_recv(struct svc_rqst *rqstp)
1226{
1227 struct svc_deferred_req *dr = rqstp->rq_deferred;
1228
1229 /* setup iov_base past transport header */
1230 rqstp->rq_arg.head[0].iov_base = dr->args + (dr->xprt_hlen>>2);
1231 /* The iov_len does not include the transport header bytes */
1232 rqstp->rq_arg.head[0].iov_len = (dr->argslen<<2) - dr->xprt_hlen;
1233 rqstp->rq_arg.page_len = 0;
1234 /* The rq_arg.len includes the transport header bytes */
1235 rqstp->rq_arg.len = dr->argslen<<2;
1236 rqstp->rq_prot = dr->prot;
1237 memcpy(&rqstp->rq_addr, &dr->addr, dr->addrlen);
1238 rqstp->rq_addrlen = dr->addrlen;
1239 /* Save off transport header len in case we get deferred again */
1240 rqstp->rq_xprt_hlen = dr->xprt_hlen;
1241 rqstp->rq_daddr = dr->daddr;
1242 rqstp->rq_respages = rqstp->rq_pages;
1243 return (dr->argslen<<2) - dr->xprt_hlen;
1244}
1245
1246
1247static struct svc_deferred_req *svc_deferred_dequeue(struct svc_xprt *xprt)
1248{
1249 struct svc_deferred_req *dr = NULL;
1250
1251 if (!test_bit(XPT_DEFERRED, &xprt->xpt_flags))
1252 return NULL;
1253 spin_lock(&xprt->xpt_lock);
1254 if (!list_empty(&xprt->xpt_deferred)) {
1255 dr = list_entry(xprt->xpt_deferred.next,
1256 struct svc_deferred_req,
1257 handle.recent);
1258 list_del_init(&dr->handle.recent);
1259 trace_svc_revisit_deferred(dr);
1260 } else
1261 clear_bit(XPT_DEFERRED, &xprt->xpt_flags);
1262 spin_unlock(&xprt->xpt_lock);
1263 return dr;
1264}
1265
1266/**
1267 * svc_find_xprt - find an RPC transport instance
1268 * @serv: pointer to svc_serv to search
1269 * @xcl_name: C string containing transport's class name
1270 * @net: owner net pointer
1271 * @af: Address family of transport's local address
1272 * @port: transport's IP port number
1273 *
1274 * Return the transport instance pointer for the endpoint accepting
1275 * connections/peer traffic from the specified transport class,
1276 * address family and port.
1277 *
1278 * Specifying 0 for the address family or port is effectively a
1279 * wild-card, and will result in matching the first transport in the
1280 * service's list that has a matching class name.
1281 */
1282struct svc_xprt *svc_find_xprt(struct svc_serv *serv, const char *xcl_name,
1283 struct net *net, const sa_family_t af,
1284 const unsigned short port)
1285{
1286 struct svc_xprt *xprt;
1287 struct svc_xprt *found = NULL;
1288
1289 /* Sanity check the args */
1290 if (serv == NULL || xcl_name == NULL)
1291 return found;
1292
1293 spin_lock_bh(&serv->sv_lock);
1294 list_for_each_entry(xprt, &serv->sv_permsocks, xpt_list) {
1295 if (xprt->xpt_net != net)
1296 continue;
1297 if (strcmp(xprt->xpt_class->xcl_name, xcl_name))
1298 continue;
1299 if (af != AF_UNSPEC && af != xprt->xpt_local.ss_family)
1300 continue;
1301 if (port != 0 && port != svc_xprt_local_port(xprt))
1302 continue;
1303 found = xprt;
1304 svc_xprt_get(xprt);
1305 break;
1306 }
1307 spin_unlock_bh(&serv->sv_lock);
1308 return found;
1309}
1310EXPORT_SYMBOL_GPL(svc_find_xprt);
1311
1312static int svc_one_xprt_name(const struct svc_xprt *xprt,
1313 char *pos, int remaining)
1314{
1315 int len;
1316
1317 len = snprintf(pos, remaining, "%s %u\n",
1318 xprt->xpt_class->xcl_name,
1319 svc_xprt_local_port(xprt));
1320 if (len >= remaining)
1321 return -ENAMETOOLONG;
1322 return len;
1323}
1324
1325/**
1326 * svc_xprt_names - format a buffer with a list of transport names
1327 * @serv: pointer to an RPC service
1328 * @buf: pointer to a buffer to be filled in
1329 * @buflen: length of buffer to be filled in
1330 *
1331 * Fills in @buf with a string containing a list of transport names,
1332 * each name terminated with '\n'.
1333 *
1334 * Returns positive length of the filled-in string on success; otherwise
1335 * a negative errno value is returned if an error occurs.
1336 */
1337int svc_xprt_names(struct svc_serv *serv, char *buf, const int buflen)
1338{
1339 struct svc_xprt *xprt;
1340 int len, totlen;
1341 char *pos;
1342
1343 /* Sanity check args */
1344 if (!serv)
1345 return 0;
1346
1347 spin_lock_bh(&serv->sv_lock);
1348
1349 pos = buf;
1350 totlen = 0;
1351 list_for_each_entry(xprt, &serv->sv_permsocks, xpt_list) {
1352 len = svc_one_xprt_name(xprt, pos, buflen - totlen);
1353 if (len < 0) {
1354 *buf = '\0';
1355 totlen = len;
1356 }
1357 if (len <= 0)
1358 break;
1359
1360 pos += len;
1361 totlen += len;
1362 }
1363
1364 spin_unlock_bh(&serv->sv_lock);
1365 return totlen;
1366}
1367EXPORT_SYMBOL_GPL(svc_xprt_names);
1368
1369
1370/*----------------------------------------------------------------------------*/
1371
1372static void *svc_pool_stats_start(struct seq_file *m, loff_t *pos)
1373{
1374 unsigned int pidx = (unsigned int)*pos;
1375 struct svc_serv *serv = m->private;
1376
1377 dprintk("svc_pool_stats_start, *pidx=%u\n", pidx);
1378
1379 if (!pidx)
1380 return SEQ_START_TOKEN;
1381 return (pidx > serv->sv_nrpools ? NULL : &serv->sv_pools[pidx-1]);
1382}
1383
1384static void *svc_pool_stats_next(struct seq_file *m, void *p, loff_t *pos)
1385{
1386 struct svc_pool *pool = p;
1387 struct svc_serv *serv = m->private;
1388
1389 dprintk("svc_pool_stats_next, *pos=%llu\n", *pos);
1390
1391 if (p == SEQ_START_TOKEN) {
1392 pool = &serv->sv_pools[0];
1393 } else {
1394 unsigned int pidx = (pool - &serv->sv_pools[0]);
1395 if (pidx < serv->sv_nrpools-1)
1396 pool = &serv->sv_pools[pidx+1];
1397 else
1398 pool = NULL;
1399 }
1400 ++*pos;
1401 return pool;
1402}
1403
1404static void svc_pool_stats_stop(struct seq_file *m, void *p)
1405{
1406}
1407
1408static int svc_pool_stats_show(struct seq_file *m, void *p)
1409{
1410 struct svc_pool *pool = p;
1411
1412 if (p == SEQ_START_TOKEN) {
1413 seq_puts(m, "# pool packets-arrived sockets-enqueued threads-woken threads-timedout\n");
1414 return 0;
1415 }
1416
1417 seq_printf(m, "%u %lu %lu %lu %lu\n",
1418 pool->sp_id,
1419 (unsigned long)atomic_long_read(&pool->sp_stats.packets),
1420 pool->sp_stats.sockets_queued,
1421 (unsigned long)atomic_long_read(&pool->sp_stats.threads_woken),
1422 (unsigned long)atomic_long_read(&pool->sp_stats.threads_timedout));
1423
1424 return 0;
1425}
1426
1427static const struct seq_operations svc_pool_stats_seq_ops = {
1428 .start = svc_pool_stats_start,
1429 .next = svc_pool_stats_next,
1430 .stop = svc_pool_stats_stop,
1431 .show = svc_pool_stats_show,
1432};
1433
1434int svc_pool_stats_open(struct svc_serv *serv, struct file *file)
1435{
1436 int err;
1437
1438 err = seq_open(file, &svc_pool_stats_seq_ops);
1439 if (!err)
1440 ((struct seq_file *) file->private_data)->private = serv;
1441 return err;
1442}
1443EXPORT_SYMBOL(svc_pool_stats_open);
1444
1445/*----------------------------------------------------------------------------*/