Commit | Line | Data |
---|---|---|
1d8206b9 TT |
1 | /* |
2 | * linux/net/sunrpc/svc_xprt.c | |
3 | * | |
4 | * Author: Tom Tucker <tom@opengridcomputing.com> | |
5 | */ | |
6 | ||
7 | #include <linux/sched.h> | |
8 | #include <linux/errno.h> | |
1d8206b9 | 9 | #include <linux/freezer.h> |
7086721f | 10 | #include <linux/kthread.h> |
5a0e3ad6 | 11 | #include <linux/slab.h> |
1d8206b9 | 12 | #include <net/sock.h> |
1d8206b9 TT |
13 | #include <linux/sunrpc/stats.h> |
14 | #include <linux/sunrpc/svc_xprt.h> | |
dcf1a357 | 15 | #include <linux/sunrpc/svcsock.h> |
99de8ea9 | 16 | #include <linux/sunrpc/xprt.h> |
3a9a231d | 17 | #include <linux/module.h> |
1d8206b9 TT |
18 | |
19 | #define RPCDBG_FACILITY RPCDBG_SVCXPRT | |
20 | ||
0f0257ea TT |
21 | static struct svc_deferred_req *svc_deferred_dequeue(struct svc_xprt *xprt); |
22 | static int svc_deferred_recv(struct svc_rqst *rqstp); | |
23 | static struct cache_deferred_req *svc_defer(struct cache_req *req); | |
24 | static void svc_age_temp_xprts(unsigned long closure); | |
7710ec36 | 25 | static void svc_delete_xprt(struct svc_xprt *xprt); |
0971374e | 26 | static void svc_xprt_do_enqueue(struct svc_xprt *xprt); |
0f0257ea TT |
27 | |
28 | /* apparently the "standard" is that clients close | |
29 | * idle connections after 5 minutes, servers after | |
30 | * 6 minutes | |
31 | * http://www.connectathon.org/talks96/nfstcp.pdf | |
32 | */ | |
33 | static int svc_conn_age_period = 6*60; | |
34 | ||
1d8206b9 TT |
35 | /* List of registered transport classes */ |
36 | static DEFINE_SPINLOCK(svc_xprt_class_lock); | |
37 | static LIST_HEAD(svc_xprt_class_list); | |
38 | ||
0f0257ea TT |
39 | /* SMP locking strategy: |
40 | * | |
41 | * svc_pool->sp_lock protects most of the fields of that pool. | |
42 | * svc_serv->sv_lock protects sv_tempsocks, sv_permsocks, sv_tmpcnt. | |
43 | * when both need to be taken (rare), svc_serv->sv_lock is first. | |
44 | * BKL protects svc_serv->sv_nrthread. | |
45 | * svc_sock->sk_lock protects the svc_sock->sk_deferred list | |
46 | * and the ->sk_info_authunix cache. | |
47 | * | |
48 | * The XPT_BUSY bit in xprt->xpt_flags prevents a transport being | |
49 | * enqueued multiply. During normal transport processing this bit | |
50 | * is set by svc_xprt_enqueue and cleared by svc_xprt_received. | |
51 | * Providers should not manipulate this bit directly. | |
52 | * | |
53 | * Some flags can be set to certain values at any time | |
54 | * providing that certain rules are followed: | |
55 | * | |
56 | * XPT_CONN, XPT_DATA: | |
57 | * - Can be set or cleared at any time. | |
58 | * - After a set, svc_xprt_enqueue must be called to enqueue | |
59 | * the transport for processing. | |
60 | * - After a clear, the transport must be read/accepted. | |
61 | * If this succeeds, it must be set again. | |
62 | * XPT_CLOSE: | |
63 | * - Can set at any time. It is never cleared. | |
64 | * XPT_DEAD: | |
65 | * - Can only be set while XPT_BUSY is held which ensures | |
66 | * that no other thread will be using the transport or will | |
67 | * try to set XPT_DEAD. | |
68 | */ | |
69 | ||
1d8206b9 TT |
70 | int svc_reg_xprt_class(struct svc_xprt_class *xcl) |
71 | { | |
72 | struct svc_xprt_class *cl; | |
73 | int res = -EEXIST; | |
74 | ||
75 | dprintk("svc: Adding svc transport class '%s'\n", xcl->xcl_name); | |
76 | ||
77 | INIT_LIST_HEAD(&xcl->xcl_list); | |
78 | spin_lock(&svc_xprt_class_lock); | |
79 | /* Make sure there isn't already a class with the same name */ | |
80 | list_for_each_entry(cl, &svc_xprt_class_list, xcl_list) { | |
81 | if (strcmp(xcl->xcl_name, cl->xcl_name) == 0) | |
82 | goto out; | |
83 | } | |
84 | list_add_tail(&xcl->xcl_list, &svc_xprt_class_list); | |
85 | res = 0; | |
86 | out: | |
87 | spin_unlock(&svc_xprt_class_lock); | |
88 | return res; | |
89 | } | |
90 | EXPORT_SYMBOL_GPL(svc_reg_xprt_class); | |
91 | ||
92 | void svc_unreg_xprt_class(struct svc_xprt_class *xcl) | |
93 | { | |
94 | dprintk("svc: Removing svc transport class '%s'\n", xcl->xcl_name); | |
95 | spin_lock(&svc_xprt_class_lock); | |
96 | list_del_init(&xcl->xcl_list); | |
97 | spin_unlock(&svc_xprt_class_lock); | |
98 | } | |
99 | EXPORT_SYMBOL_GPL(svc_unreg_xprt_class); | |
100 | ||
dc9a16e4 TT |
101 | /* |
102 | * Format the transport list for printing | |
103 | */ | |
104 | int svc_print_xprts(char *buf, int maxlen) | |
105 | { | |
8f3a6de3 | 106 | struct svc_xprt_class *xcl; |
dc9a16e4 TT |
107 | char tmpstr[80]; |
108 | int len = 0; | |
109 | buf[0] = '\0'; | |
110 | ||
111 | spin_lock(&svc_xprt_class_lock); | |
8f3a6de3 | 112 | list_for_each_entry(xcl, &svc_xprt_class_list, xcl_list) { |
dc9a16e4 | 113 | int slen; |
dc9a16e4 TT |
114 | |
115 | sprintf(tmpstr, "%s %d\n", xcl->xcl_name, xcl->xcl_max_payload); | |
116 | slen = strlen(tmpstr); | |
117 | if (len + slen > maxlen) | |
118 | break; | |
119 | len += slen; | |
120 | strcat(buf, tmpstr); | |
121 | } | |
122 | spin_unlock(&svc_xprt_class_lock); | |
123 | ||
124 | return len; | |
125 | } | |
126 | ||
e1b3157f TT |
127 | static void svc_xprt_free(struct kref *kref) |
128 | { | |
129 | struct svc_xprt *xprt = | |
130 | container_of(kref, struct svc_xprt, xpt_ref); | |
131 | struct module *owner = xprt->xpt_class->xcl_owner; | |
e3bfca01 PE |
132 | if (test_bit(XPT_CACHE_AUTH, &xprt->xpt_flags)) |
133 | svcauth_unix_info_release(xprt); | |
4fb8518b | 134 | put_net(xprt->xpt_net); |
99de8ea9 BF |
135 | /* See comment on corresponding get in xs_setup_bc_tcp(): */ |
136 | if (xprt->xpt_bc_xprt) | |
137 | xprt_put(xprt->xpt_bc_xprt); | |
e1b3157f TT |
138 | xprt->xpt_ops->xpo_free(xprt); |
139 | module_put(owner); | |
140 | } | |
141 | ||
142 | void svc_xprt_put(struct svc_xprt *xprt) | |
143 | { | |
144 | kref_put(&xprt->xpt_ref, svc_xprt_free); | |
145 | } | |
146 | EXPORT_SYMBOL_GPL(svc_xprt_put); | |
147 | ||
1d8206b9 TT |
148 | /* |
149 | * Called by transport drivers to initialize the transport independent | |
150 | * portion of the transport instance. | |
151 | */ | |
bd4620dd SK |
152 | void svc_xprt_init(struct net *net, struct svc_xprt_class *xcl, |
153 | struct svc_xprt *xprt, struct svc_serv *serv) | |
1d8206b9 TT |
154 | { |
155 | memset(xprt, 0, sizeof(*xprt)); | |
156 | xprt->xpt_class = xcl; | |
157 | xprt->xpt_ops = xcl->xcl_ops; | |
e1b3157f | 158 | kref_init(&xprt->xpt_ref); |
bb5cf160 | 159 | xprt->xpt_server = serv; |
7a182083 TT |
160 | INIT_LIST_HEAD(&xprt->xpt_list); |
161 | INIT_LIST_HEAD(&xprt->xpt_ready); | |
8c7b0172 | 162 | INIT_LIST_HEAD(&xprt->xpt_deferred); |
edc7a894 | 163 | INIT_LIST_HEAD(&xprt->xpt_users); |
a50fea26 | 164 | mutex_init(&xprt->xpt_mutex); |
def13d74 | 165 | spin_lock_init(&xprt->xpt_lock); |
4e5caaa5 | 166 | set_bit(XPT_BUSY, &xprt->xpt_flags); |
4cfc7e60 | 167 | rpc_init_wait_queue(&xprt->xpt_bc_pending, "xpt_bc_pending"); |
bd4620dd | 168 | xprt->xpt_net = get_net(net); |
1d8206b9 TT |
169 | } |
170 | EXPORT_SYMBOL_GPL(svc_xprt_init); | |
b700cbb1 | 171 | |
5dd248f6 CL |
172 | static struct svc_xprt *__svc_xpo_create(struct svc_xprt_class *xcl, |
173 | struct svc_serv *serv, | |
62832c03 | 174 | struct net *net, |
9652ada3 CL |
175 | const int family, |
176 | const unsigned short port, | |
177 | int flags) | |
b700cbb1 | 178 | { |
b700cbb1 TT |
179 | struct sockaddr_in sin = { |
180 | .sin_family = AF_INET, | |
e6f1cebf | 181 | .sin_addr.s_addr = htonl(INADDR_ANY), |
b700cbb1 TT |
182 | .sin_port = htons(port), |
183 | }; | |
dfd56b8b | 184 | #if IS_ENABLED(CONFIG_IPV6) |
5dd248f6 CL |
185 | struct sockaddr_in6 sin6 = { |
186 | .sin6_family = AF_INET6, | |
187 | .sin6_addr = IN6ADDR_ANY_INIT, | |
188 | .sin6_port = htons(port), | |
189 | }; | |
dfd56b8b | 190 | #endif |
5dd248f6 CL |
191 | struct sockaddr *sap; |
192 | size_t len; | |
193 | ||
9652ada3 CL |
194 | switch (family) { |
195 | case PF_INET: | |
5dd248f6 CL |
196 | sap = (struct sockaddr *)&sin; |
197 | len = sizeof(sin); | |
198 | break; | |
dfd56b8b | 199 | #if IS_ENABLED(CONFIG_IPV6) |
9652ada3 | 200 | case PF_INET6: |
5dd248f6 CL |
201 | sap = (struct sockaddr *)&sin6; |
202 | len = sizeof(sin6); | |
203 | break; | |
dfd56b8b | 204 | #endif |
5dd248f6 CL |
205 | default: |
206 | return ERR_PTR(-EAFNOSUPPORT); | |
207 | } | |
208 | ||
62832c03 | 209 | return xcl->xcl_ops->xpo_create(serv, net, sap, len, flags); |
5dd248f6 CL |
210 | } |
211 | ||
6741019c BF |
212 | /* |
213 | * svc_xprt_received conditionally queues the transport for processing | |
214 | * by another thread. The caller must hold the XPT_BUSY bit and must | |
215 | * not thereafter touch transport data. | |
216 | * | |
217 | * Note: XPT_DATA only gets cleared when a read-attempt finds no (or | |
218 | * insufficient) data. | |
219 | */ | |
220 | static void svc_xprt_received(struct svc_xprt *xprt) | |
221 | { | |
ff1fdb9b WAA |
222 | WARN_ON_ONCE(!test_bit(XPT_BUSY, &xprt->xpt_flags)); |
223 | if (!test_bit(XPT_BUSY, &xprt->xpt_flags)) | |
224 | return; | |
6741019c | 225 | /* As soon as we clear busy, the xprt could be closed and |
0971374e | 226 | * 'put', so we need a reference to call svc_xprt_do_enqueue with: |
6741019c BF |
227 | */ |
228 | svc_xprt_get(xprt); | |
0971374e | 229 | smp_mb__before_atomic(); |
6741019c | 230 | clear_bit(XPT_BUSY, &xprt->xpt_flags); |
0971374e | 231 | svc_xprt_do_enqueue(xprt); |
6741019c BF |
232 | svc_xprt_put(xprt); |
233 | } | |
234 | ||
39b55301 BF |
235 | void svc_add_new_perm_xprt(struct svc_serv *serv, struct svc_xprt *new) |
236 | { | |
237 | clear_bit(XPT_TEMP, &new->xpt_flags); | |
238 | spin_lock_bh(&serv->sv_lock); | |
239 | list_add(&new->xpt_list, &serv->sv_permsocks); | |
240 | spin_unlock_bh(&serv->sv_lock); | |
241 | svc_xprt_received(new); | |
242 | } | |
243 | ||
9652ada3 | 244 | int svc_create_xprt(struct svc_serv *serv, const char *xprt_name, |
fc5d00b0 PE |
245 | struct net *net, const int family, |
246 | const unsigned short port, int flags) | |
5dd248f6 CL |
247 | { |
248 | struct svc_xprt_class *xcl; | |
249 | ||
b700cbb1 TT |
250 | dprintk("svc: creating transport %s[%d]\n", xprt_name, port); |
251 | spin_lock(&svc_xprt_class_lock); | |
252 | list_for_each_entry(xcl, &svc_xprt_class_list, xcl_list) { | |
4e5caaa5 | 253 | struct svc_xprt *newxprt; |
ed2849d3 | 254 | unsigned short newport; |
4e5caaa5 TT |
255 | |
256 | if (strcmp(xprt_name, xcl->xcl_name)) | |
257 | continue; | |
258 | ||
259 | if (!try_module_get(xcl->xcl_owner)) | |
260 | goto err; | |
261 | ||
262 | spin_unlock(&svc_xprt_class_lock); | |
62832c03 | 263 | newxprt = __svc_xpo_create(xcl, serv, net, family, port, flags); |
4e5caaa5 TT |
264 | if (IS_ERR(newxprt)) { |
265 | module_put(xcl->xcl_owner); | |
266 | return PTR_ERR(newxprt); | |
b700cbb1 | 267 | } |
39b55301 | 268 | svc_add_new_perm_xprt(serv, newxprt); |
ed2849d3 | 269 | newport = svc_xprt_local_port(newxprt); |
ed2849d3 | 270 | return newport; |
b700cbb1 | 271 | } |
4e5caaa5 | 272 | err: |
b700cbb1 TT |
273 | spin_unlock(&svc_xprt_class_lock); |
274 | dprintk("svc: transport %s not found\n", xprt_name); | |
68717908 CL |
275 | |
276 | /* This errno is exposed to user space. Provide a reasonable | |
277 | * perror msg for a bad transport. */ | |
278 | return -EPROTONOSUPPORT; | |
b700cbb1 TT |
279 | } |
280 | EXPORT_SYMBOL_GPL(svc_create_xprt); | |
9dbc240f TT |
281 | |
282 | /* | |
283 | * Copy the local and remote xprt addresses to the rqstp structure | |
284 | */ | |
285 | void svc_xprt_copy_addrs(struct svc_rqst *rqstp, struct svc_xprt *xprt) | |
286 | { | |
9dbc240f TT |
287 | memcpy(&rqstp->rq_addr, &xprt->xpt_remote, xprt->xpt_remotelen); |
288 | rqstp->rq_addrlen = xprt->xpt_remotelen; | |
289 | ||
290 | /* | |
291 | * Destination address in request is needed for binding the | |
292 | * source address in RPC replies/callbacks later. | |
293 | */ | |
849a1cf1 MJ |
294 | memcpy(&rqstp->rq_daddr, &xprt->xpt_local, xprt->xpt_locallen); |
295 | rqstp->rq_daddrlen = xprt->xpt_locallen; | |
9dbc240f TT |
296 | } |
297 | EXPORT_SYMBOL_GPL(svc_xprt_copy_addrs); | |
298 | ||
0f0257ea TT |
299 | /** |
300 | * svc_print_addr - Format rq_addr field for printing | |
301 | * @rqstp: svc_rqst struct containing address to print | |
302 | * @buf: target buffer for formatted address | |
303 | * @len: length of target buffer | |
304 | * | |
305 | */ | |
306 | char *svc_print_addr(struct svc_rqst *rqstp, char *buf, size_t len) | |
307 | { | |
308 | return __svc_print_addr(svc_addr(rqstp), buf, len); | |
309 | } | |
310 | EXPORT_SYMBOL_GPL(svc_print_addr); | |
311 | ||
312 | /* | |
313 | * Queue up an idle server thread. Must have pool->sp_lock held. | |
314 | * Note: this is really a stack rather than a queue, so that we only | |
315 | * use as many different threads as we need, and the rest don't pollute | |
316 | * the cache. | |
317 | */ | |
318 | static void svc_thread_enqueue(struct svc_pool *pool, struct svc_rqst *rqstp) | |
319 | { | |
320 | list_add(&rqstp->rq_list, &pool->sp_threads); | |
321 | } | |
322 | ||
323 | /* | |
324 | * Dequeue an nfsd thread. Must have pool->sp_lock held. | |
325 | */ | |
326 | static void svc_thread_dequeue(struct svc_pool *pool, struct svc_rqst *rqstp) | |
327 | { | |
328 | list_del(&rqstp->rq_list); | |
329 | } | |
330 | ||
9c335c0b BF |
331 | static bool svc_xprt_has_something_to_do(struct svc_xprt *xprt) |
332 | { | |
333 | if (xprt->xpt_flags & ((1<<XPT_CONN)|(1<<XPT_CLOSE))) | |
334 | return true; | |
335 | if (xprt->xpt_flags & ((1<<XPT_DATA)|(1<<XPT_DEFERRED))) | |
336 | return xprt->xpt_ops->xpo_has_wspace(xprt); | |
337 | return false; | |
338 | } | |
339 | ||
0971374e | 340 | static void svc_xprt_do_enqueue(struct svc_xprt *xprt) |
0f0257ea | 341 | { |
0f0257ea TT |
342 | struct svc_pool *pool; |
343 | struct svc_rqst *rqstp; | |
344 | int cpu; | |
345 | ||
9c335c0b | 346 | if (!svc_xprt_has_something_to_do(xprt)) |
0f0257ea | 347 | return; |
0f0257ea | 348 | |
0f0257ea TT |
349 | /* Mark transport as busy. It will remain in this state until |
350 | * the provider calls svc_xprt_received. We update XPT_BUSY | |
351 | * atomically because it also guards against trying to enqueue | |
352 | * the transport twice. | |
353 | */ | |
354 | if (test_and_set_bit(XPT_BUSY, &xprt->xpt_flags)) { | |
355 | /* Don't enqueue transport while already enqueued */ | |
356 | dprintk("svc: transport %p busy, not enqueued\n", xprt); | |
0c0746d0 | 357 | return; |
0f0257ea | 358 | } |
0f0257ea | 359 | |
0c0746d0 TM |
360 | cpu = get_cpu(); |
361 | pool = svc_pool_for_cpu(xprt->xpt_server, cpu); | |
362 | spin_lock_bh(&pool->sp_lock); | |
363 | ||
364 | pool->sp_stats.packets++; | |
365 | ||
78c210ef | 366 | if (!list_empty(&pool->sp_threads)) { |
0f0257ea TT |
367 | rqstp = list_entry(pool->sp_threads.next, |
368 | struct svc_rqst, | |
369 | rq_list); | |
370 | dprintk("svc: transport %p served by daemon %p\n", | |
371 | xprt, rqstp); | |
372 | svc_thread_dequeue(pool, rqstp); | |
373 | if (rqstp->rq_xprt) | |
374 | printk(KERN_ERR | |
375 | "svc_xprt_enqueue: server %p, rq_xprt=%p!\n", | |
376 | rqstp, rqstp->rq_xprt); | |
983c6844 TM |
377 | /* Note the order of the following 3 lines: |
378 | * We want to assign xprt to rqstp->rq_xprt only _after_ | |
379 | * we've woken up the process, so that we don't race with | |
380 | * the lockless check in svc_get_next_xprt(). | |
381 | */ | |
0f0257ea | 382 | svc_xprt_get(xprt); |
983c6844 TM |
383 | wake_up_process(rqstp->rq_task); |
384 | rqstp->rq_xprt = xprt; | |
03cf6c9f | 385 | pool->sp_stats.threads_woken++; |
0f0257ea TT |
386 | } else { |
387 | dprintk("svc: transport %p put into queue\n", xprt); | |
388 | list_add_tail(&xprt->xpt_ready, &pool->sp_sockets); | |
03cf6c9f | 389 | pool->sp_stats.sockets_queued++; |
0f0257ea TT |
390 | } |
391 | ||
0f0257ea | 392 | spin_unlock_bh(&pool->sp_lock); |
983c6844 | 393 | put_cpu(); |
0f0257ea | 394 | } |
0971374e TM |
395 | |
396 | /* | |
397 | * Queue up a transport with data pending. If there are idle nfsd | |
398 | * processes, wake 'em up. | |
399 | * | |
400 | */ | |
401 | void svc_xprt_enqueue(struct svc_xprt *xprt) | |
402 | { | |
403 | if (test_bit(XPT_BUSY, &xprt->xpt_flags)) | |
404 | return; | |
405 | svc_xprt_do_enqueue(xprt); | |
406 | } | |
0f0257ea TT |
407 | EXPORT_SYMBOL_GPL(svc_xprt_enqueue); |
408 | ||
409 | /* | |
410 | * Dequeue the first transport. Must be called with the pool->sp_lock held. | |
411 | */ | |
412 | static struct svc_xprt *svc_xprt_dequeue(struct svc_pool *pool) | |
413 | { | |
414 | struct svc_xprt *xprt; | |
415 | ||
416 | if (list_empty(&pool->sp_sockets)) | |
417 | return NULL; | |
418 | ||
419 | xprt = list_entry(pool->sp_sockets.next, | |
420 | struct svc_xprt, xpt_ready); | |
421 | list_del_init(&xprt->xpt_ready); | |
422 | ||
423 | dprintk("svc: transport %p dequeued, inuse=%d\n", | |
424 | xprt, atomic_read(&xprt->xpt_ref.refcount)); | |
425 | ||
426 | return xprt; | |
427 | } | |
428 | ||
0f0257ea TT |
429 | /** |
430 | * svc_reserve - change the space reserved for the reply to a request. | |
431 | * @rqstp: The request in question | |
432 | * @space: new max space to reserve | |
433 | * | |
434 | * Each request reserves some space on the output queue of the transport | |
435 | * to make sure the reply fits. This function reduces that reserved | |
436 | * space to be the amount of space used already, plus @space. | |
437 | * | |
438 | */ | |
439 | void svc_reserve(struct svc_rqst *rqstp, int space) | |
440 | { | |
441 | space += rqstp->rq_res.head[0].iov_len; | |
442 | ||
443 | if (space < rqstp->rq_reserved) { | |
444 | struct svc_xprt *xprt = rqstp->rq_xprt; | |
445 | atomic_sub((rqstp->rq_reserved - space), &xprt->xpt_reserved); | |
446 | rqstp->rq_reserved = space; | |
447 | ||
51877680 TM |
448 | if (xprt->xpt_ops->xpo_adjust_wspace) |
449 | xprt->xpt_ops->xpo_adjust_wspace(xprt); | |
0f0257ea TT |
450 | svc_xprt_enqueue(xprt); |
451 | } | |
452 | } | |
24c3767e | 453 | EXPORT_SYMBOL_GPL(svc_reserve); |
0f0257ea TT |
454 | |
455 | static void svc_xprt_release(struct svc_rqst *rqstp) | |
456 | { | |
457 | struct svc_xprt *xprt = rqstp->rq_xprt; | |
458 | ||
459 | rqstp->rq_xprt->xpt_ops->xpo_release_rqst(rqstp); | |
460 | ||
2779e3ae TT |
461 | kfree(rqstp->rq_deferred); |
462 | rqstp->rq_deferred = NULL; | |
463 | ||
0f0257ea TT |
464 | svc_free_res_pages(rqstp); |
465 | rqstp->rq_res.page_len = 0; | |
466 | rqstp->rq_res.page_base = 0; | |
467 | ||
468 | /* Reset response buffer and release | |
469 | * the reservation. | |
470 | * But first, check that enough space was reserved | |
471 | * for the reply, otherwise we have a bug! | |
472 | */ | |
473 | if ((rqstp->rq_res.len) > rqstp->rq_reserved) | |
474 | printk(KERN_ERR "RPC request reserved %d but used %d\n", | |
475 | rqstp->rq_reserved, | |
476 | rqstp->rq_res.len); | |
477 | ||
478 | rqstp->rq_res.head[0].iov_len = 0; | |
479 | svc_reserve(rqstp, 0); | |
480 | rqstp->rq_xprt = NULL; | |
481 | ||
482 | svc_xprt_put(xprt); | |
483 | } | |
484 | ||
485 | /* | |
486 | * External function to wake up a server waiting for data | |
487 | * This really only makes sense for services like lockd | |
488 | * which have exactly one thread anyway. | |
489 | */ | |
490 | void svc_wake_up(struct svc_serv *serv) | |
491 | { | |
492 | struct svc_rqst *rqstp; | |
493 | unsigned int i; | |
494 | struct svc_pool *pool; | |
495 | ||
496 | for (i = 0; i < serv->sv_nrpools; i++) { | |
497 | pool = &serv->sv_pools[i]; | |
498 | ||
499 | spin_lock_bh(&pool->sp_lock); | |
500 | if (!list_empty(&pool->sp_threads)) { | |
501 | rqstp = list_entry(pool->sp_threads.next, | |
502 | struct svc_rqst, | |
503 | rq_list); | |
504 | dprintk("svc: daemon %p woken up.\n", rqstp); | |
505 | /* | |
506 | svc_thread_dequeue(pool, rqstp); | |
507 | rqstp->rq_xprt = NULL; | |
508 | */ | |
983c6844 | 509 | wake_up_process(rqstp->rq_task); |
35525b79 AS |
510 | } else |
511 | pool->sp_task_pending = 1; | |
0f0257ea TT |
512 | spin_unlock_bh(&pool->sp_lock); |
513 | } | |
514 | } | |
24c3767e | 515 | EXPORT_SYMBOL_GPL(svc_wake_up); |
0f0257ea TT |
516 | |
517 | int svc_port_is_privileged(struct sockaddr *sin) | |
518 | { | |
519 | switch (sin->sa_family) { | |
520 | case AF_INET: | |
521 | return ntohs(((struct sockaddr_in *)sin)->sin_port) | |
522 | < PROT_SOCK; | |
523 | case AF_INET6: | |
524 | return ntohs(((struct sockaddr_in6 *)sin)->sin6_port) | |
525 | < PROT_SOCK; | |
526 | default: | |
527 | return 0; | |
528 | } | |
529 | } | |
530 | ||
531 | /* | |
c9233eb7 JL |
532 | * Make sure that we don't have too many active connections. If we have, |
533 | * something must be dropped. It's not clear what will happen if we allow | |
534 | * "too many" connections, but when dealing with network-facing software, | |
535 | * we have to code defensively. Here we do that by imposing hard limits. | |
0f0257ea TT |
536 | * |
537 | * There's no point in trying to do random drop here for DoS | |
538 | * prevention. The NFS clients does 1 reconnect in 15 seconds. An | |
539 | * attacker can easily beat that. | |
540 | * | |
541 | * The only somewhat efficient mechanism would be if drop old | |
542 | * connections from the same IP first. But right now we don't even | |
543 | * record the client IP in svc_sock. | |
c9233eb7 JL |
544 | * |
545 | * single-threaded services that expect a lot of clients will probably | |
546 | * need to set sv_maxconn to override the default value which is based | |
547 | * on the number of threads | |
0f0257ea TT |
548 | */ |
549 | static void svc_check_conn_limits(struct svc_serv *serv) | |
550 | { | |
c9233eb7 JL |
551 | unsigned int limit = serv->sv_maxconn ? serv->sv_maxconn : |
552 | (serv->sv_nrthreads+3) * 20; | |
553 | ||
554 | if (serv->sv_tmpcnt > limit) { | |
0f0257ea TT |
555 | struct svc_xprt *xprt = NULL; |
556 | spin_lock_bh(&serv->sv_lock); | |
557 | if (!list_empty(&serv->sv_tempsocks)) { | |
e87cc472 JP |
558 | /* Try to help the admin */ |
559 | net_notice_ratelimited("%s: too many open connections, consider increasing the %s\n", | |
560 | serv->sv_name, serv->sv_maxconn ? | |
561 | "max number of connections" : | |
562 | "number of threads"); | |
0f0257ea TT |
563 | /* |
564 | * Always select the oldest connection. It's not fair, | |
565 | * but so is life | |
566 | */ | |
567 | xprt = list_entry(serv->sv_tempsocks.prev, | |
568 | struct svc_xprt, | |
569 | xpt_list); | |
570 | set_bit(XPT_CLOSE, &xprt->xpt_flags); | |
571 | svc_xprt_get(xprt); | |
572 | } | |
573 | spin_unlock_bh(&serv->sv_lock); | |
574 | ||
575 | if (xprt) { | |
576 | svc_xprt_enqueue(xprt); | |
577 | svc_xprt_put(xprt); | |
578 | } | |
579 | } | |
580 | } | |
581 | ||
e1d83ee6 | 582 | static int svc_alloc_arg(struct svc_rqst *rqstp) |
0f0257ea | 583 | { |
6797fa5a BF |
584 | struct svc_serv *serv = rqstp->rq_server; |
585 | struct xdr_buf *arg; | |
586 | int pages; | |
587 | int i; | |
0f0257ea TT |
588 | |
589 | /* now allocate needed pages. If we get a failure, sleep briefly */ | |
590 | pages = (serv->sv_max_mesg + PAGE_SIZE) / PAGE_SIZE; | |
b25cd058 WAA |
591 | WARN_ON_ONCE(pages >= RPCSVC_MAXPAGES); |
592 | if (pages >= RPCSVC_MAXPAGES) | |
593 | /* use as many pages as possible */ | |
594 | pages = RPCSVC_MAXPAGES - 1; | |
0f0257ea TT |
595 | for (i = 0; i < pages ; i++) |
596 | while (rqstp->rq_pages[i] == NULL) { | |
597 | struct page *p = alloc_page(GFP_KERNEL); | |
598 | if (!p) { | |
7b54fe61 JL |
599 | set_current_state(TASK_INTERRUPTIBLE); |
600 | if (signalled() || kthread_should_stop()) { | |
601 | set_current_state(TASK_RUNNING); | |
7086721f | 602 | return -EINTR; |
7b54fe61 JL |
603 | } |
604 | schedule_timeout(msecs_to_jiffies(500)); | |
0f0257ea TT |
605 | } |
606 | rqstp->rq_pages[i] = p; | |
607 | } | |
2825a7f9 | 608 | rqstp->rq_page_end = &rqstp->rq_pages[i]; |
0f0257ea | 609 | rqstp->rq_pages[i++] = NULL; /* this might be seen in nfs_read_actor */ |
0f0257ea TT |
610 | |
611 | /* Make arg->head point to first page and arg->pages point to rest */ | |
612 | arg = &rqstp->rq_arg; | |
613 | arg->head[0].iov_base = page_address(rqstp->rq_pages[0]); | |
614 | arg->head[0].iov_len = PAGE_SIZE; | |
615 | arg->pages = rqstp->rq_pages + 1; | |
616 | arg->page_base = 0; | |
617 | /* save at least one page for response */ | |
618 | arg->page_len = (pages-2)*PAGE_SIZE; | |
619 | arg->len = (pages-1)*PAGE_SIZE; | |
620 | arg->tail[0].iov_len = 0; | |
6797fa5a BF |
621 | return 0; |
622 | } | |
0f0257ea | 623 | |
e1d83ee6 | 624 | static struct svc_xprt *svc_get_next_xprt(struct svc_rqst *rqstp, long timeout) |
6797fa5a BF |
625 | { |
626 | struct svc_xprt *xprt; | |
627 | struct svc_pool *pool = rqstp->rq_pool; | |
a4aa8054 | 628 | long time_left = 0; |
0f0257ea | 629 | |
f16b6e8d N |
630 | /* Normally we will wait up to 5 seconds for any required |
631 | * cache information to be provided. | |
632 | */ | |
633 | rqstp->rq_chandle.thread_wait = 5*HZ; | |
634 | ||
0f0257ea TT |
635 | spin_lock_bh(&pool->sp_lock); |
636 | xprt = svc_xprt_dequeue(pool); | |
637 | if (xprt) { | |
638 | rqstp->rq_xprt = xprt; | |
639 | svc_xprt_get(xprt); | |
f16b6e8d N |
640 | |
641 | /* As there is a shortage of threads and this request | |
6610f720 | 642 | * had to be queued, don't allow the thread to wait so |
f16b6e8d N |
643 | * long for cache updates. |
644 | */ | |
645 | rqstp->rq_chandle.thread_wait = 1*HZ; | |
35525b79 | 646 | pool->sp_task_pending = 0; |
0f0257ea | 647 | } else { |
35525b79 AS |
648 | if (pool->sp_task_pending) { |
649 | pool->sp_task_pending = 0; | |
106f359c TM |
650 | xprt = ERR_PTR(-EAGAIN); |
651 | goto out; | |
35525b79 | 652 | } |
0f0257ea TT |
653 | /* |
654 | * We have to be able to interrupt this wait | |
655 | * to bring down the daemons ... | |
656 | */ | |
657 | set_current_state(TASK_INTERRUPTIBLE); | |
7086721f | 658 | |
983c6844 TM |
659 | /* No data pending. Go to sleep */ |
660 | svc_thread_enqueue(pool, rqstp); | |
0f0257ea TT |
661 | spin_unlock_bh(&pool->sp_lock); |
662 | ||
a4aa8054 TM |
663 | if (!(signalled() || kthread_should_stop())) { |
664 | time_left = schedule_timeout(timeout); | |
665 | __set_current_state(TASK_RUNNING); | |
0f0257ea | 666 | |
a4aa8054 | 667 | try_to_freeze(); |
0f0257ea | 668 | |
a4aa8054 TM |
669 | xprt = rqstp->rq_xprt; |
670 | if (xprt != NULL) | |
671 | return xprt; | |
672 | } else | |
673 | __set_current_state(TASK_RUNNING); | |
106f359c TM |
674 | |
675 | spin_lock_bh(&pool->sp_lock); | |
03cf6c9f GB |
676 | if (!time_left) |
677 | pool->sp_stats.threads_timedout++; | |
0f0257ea TT |
678 | |
679 | xprt = rqstp->rq_xprt; | |
680 | if (!xprt) { | |
681 | svc_thread_dequeue(pool, rqstp); | |
682 | spin_unlock_bh(&pool->sp_lock); | |
683 | dprintk("svc: server %p, no data yet\n", rqstp); | |
7086721f | 684 | if (signalled() || kthread_should_stop()) |
6797fa5a | 685 | return ERR_PTR(-EINTR); |
7086721f | 686 | else |
6797fa5a | 687 | return ERR_PTR(-EAGAIN); |
0f0257ea TT |
688 | } |
689 | } | |
106f359c | 690 | out: |
0f0257ea | 691 | spin_unlock_bh(&pool->sp_lock); |
6797fa5a BF |
692 | return xprt; |
693 | } | |
694 | ||
e1d83ee6 | 695 | static void svc_add_new_temp_xprt(struct svc_serv *serv, struct svc_xprt *newxpt) |
65b2e665 BF |
696 | { |
697 | spin_lock_bh(&serv->sv_lock); | |
698 | set_bit(XPT_TEMP, &newxpt->xpt_flags); | |
699 | list_add(&newxpt->xpt_list, &serv->sv_tempsocks); | |
700 | serv->sv_tmpcnt++; | |
701 | if (serv->sv_temptimer.function == NULL) { | |
702 | /* setup timer to age temp transports */ | |
703 | setup_timer(&serv->sv_temptimer, svc_age_temp_xprts, | |
704 | (unsigned long)serv); | |
705 | mod_timer(&serv->sv_temptimer, | |
706 | jiffies + svc_conn_age_period * HZ); | |
707 | } | |
708 | spin_unlock_bh(&serv->sv_lock); | |
709 | svc_xprt_received(newxpt); | |
710 | } | |
711 | ||
6797fa5a BF |
712 | static int svc_handle_xprt(struct svc_rqst *rqstp, struct svc_xprt *xprt) |
713 | { | |
714 | struct svc_serv *serv = rqstp->rq_server; | |
715 | int len = 0; | |
0f0257ea | 716 | |
1b644b6e BF |
717 | if (test_bit(XPT_CLOSE, &xprt->xpt_flags)) { |
718 | dprintk("svc_recv: found XPT_CLOSE\n"); | |
719 | svc_delete_xprt(xprt); | |
ca7896cd | 720 | /* Leave XPT_BUSY set on the dead xprt: */ |
6797fa5a | 721 | return 0; |
ca7896cd BF |
722 | } |
723 | if (test_bit(XPT_LISTENER, &xprt->xpt_flags)) { | |
0f0257ea | 724 | struct svc_xprt *newxpt; |
65b2e665 BF |
725 | /* |
726 | * We know this module_get will succeed because the | |
727 | * listener holds a reference too | |
728 | */ | |
729 | __module_get(xprt->xpt_class->xcl_owner); | |
730 | svc_check_conn_limits(xprt->xpt_server); | |
0f0257ea | 731 | newxpt = xprt->xpt_ops->xpo_accept(xprt); |
65b2e665 BF |
732 | if (newxpt) |
733 | svc_add_new_temp_xprt(serv, newxpt); | |
c789102c TM |
734 | else |
735 | module_put(xprt->xpt_class->xcl_owner); | |
9e5b208d | 736 | } else { |
6797fa5a | 737 | /* XPT_DATA|XPT_DEFERRED case: */ |
0f0257ea | 738 | dprintk("svc: server %p, pool %u, transport %p, inuse=%d\n", |
6797fa5a | 739 | rqstp, rqstp->rq_pool->sp_id, xprt, |
0f0257ea TT |
740 | atomic_read(&xprt->xpt_ref.refcount)); |
741 | rqstp->rq_deferred = svc_deferred_dequeue(xprt); | |
ca7896cd | 742 | if (rqstp->rq_deferred) |
0f0257ea | 743 | len = svc_deferred_recv(rqstp); |
ca7896cd | 744 | else |
0f0257ea TT |
745 | len = xprt->xpt_ops->xpo_recvfrom(rqstp); |
746 | dprintk("svc: got len=%d\n", len); | |
d10f27a7 BF |
747 | rqstp->rq_reserved = serv->sv_max_mesg; |
748 | atomic_add(rqstp->rq_reserved, &xprt->xpt_reserved); | |
0f0257ea | 749 | } |
6797fa5a | 750 | /* clear XPT_BUSY: */ |
ca7896cd | 751 | svc_xprt_received(xprt); |
6797fa5a BF |
752 | return len; |
753 | } | |
754 | ||
755 | /* | |
756 | * Receive the next request on any transport. This code is carefully | |
757 | * organised not to touch any cachelines in the shared svc_serv | |
758 | * structure, only cachelines in the local svc_pool. | |
759 | */ | |
760 | int svc_recv(struct svc_rqst *rqstp, long timeout) | |
761 | { | |
762 | struct svc_xprt *xprt = NULL; | |
763 | struct svc_serv *serv = rqstp->rq_server; | |
764 | int len, err; | |
765 | ||
766 | dprintk("svc: server %p waiting for data (to = %ld)\n", | |
767 | rqstp, timeout); | |
768 | ||
769 | if (rqstp->rq_xprt) | |
770 | printk(KERN_ERR | |
771 | "svc_recv: service %p, transport not NULL!\n", | |
772 | rqstp); | |
983c6844 TM |
773 | |
774 | /* Make sure the task pointer is set! */ | |
775 | if (WARN_ON_ONCE(!rqstp->rq_task)) | |
776 | rqstp->rq_task = current_task; | |
6797fa5a BF |
777 | |
778 | err = svc_alloc_arg(rqstp); | |
779 | if (err) | |
780 | return err; | |
781 | ||
782 | try_to_freeze(); | |
783 | cond_resched(); | |
784 | if (signalled() || kthread_should_stop()) | |
785 | return -EINTR; | |
786 | ||
787 | xprt = svc_get_next_xprt(rqstp, timeout); | |
788 | if (IS_ERR(xprt)) | |
789 | return PTR_ERR(xprt); | |
790 | ||
791 | len = svc_handle_xprt(rqstp, xprt); | |
0f0257ea TT |
792 | |
793 | /* No data, incomplete (TCP) read, or accept() */ | |
9f9d2ebe | 794 | if (len <= 0) |
ca7896cd BF |
795 | goto out; |
796 | ||
0f0257ea TT |
797 | clear_bit(XPT_OLD, &xprt->xpt_flags); |
798 | ||
16e4d93f | 799 | rqstp->rq_secure = xprt->xpt_ops->xpo_secure_port(rqstp); |
0f0257ea TT |
800 | rqstp->rq_chandle.defer = svc_defer; |
801 | ||
802 | if (serv->sv_stats) | |
803 | serv->sv_stats->netcnt++; | |
804 | return len; | |
ca7896cd BF |
805 | out: |
806 | rqstp->rq_res.len = 0; | |
807 | svc_xprt_release(rqstp); | |
808 | return -EAGAIN; | |
0f0257ea | 809 | } |
24c3767e | 810 | EXPORT_SYMBOL_GPL(svc_recv); |
0f0257ea TT |
811 | |
812 | /* | |
813 | * Drop request | |
814 | */ | |
815 | void svc_drop(struct svc_rqst *rqstp) | |
816 | { | |
817 | dprintk("svc: xprt %p dropped request\n", rqstp->rq_xprt); | |
818 | svc_xprt_release(rqstp); | |
819 | } | |
24c3767e | 820 | EXPORT_SYMBOL_GPL(svc_drop); |
0f0257ea TT |
821 | |
822 | /* | |
823 | * Return reply to client. | |
824 | */ | |
825 | int svc_send(struct svc_rqst *rqstp) | |
826 | { | |
827 | struct svc_xprt *xprt; | |
828 | int len; | |
829 | struct xdr_buf *xb; | |
830 | ||
831 | xprt = rqstp->rq_xprt; | |
832 | if (!xprt) | |
833 | return -EFAULT; | |
834 | ||
835 | /* release the receive skb before sending the reply */ | |
836 | rqstp->rq_xprt->xpt_ops->xpo_release_rqst(rqstp); | |
837 | ||
838 | /* calculate over-all length */ | |
839 | xb = &rqstp->rq_res; | |
840 | xb->len = xb->head[0].iov_len + | |
841 | xb->page_len + | |
842 | xb->tail[0].iov_len; | |
843 | ||
844 | /* Grab mutex to serialize outgoing data. */ | |
845 | mutex_lock(&xprt->xpt_mutex); | |
f06f00a2 BF |
846 | if (test_bit(XPT_DEAD, &xprt->xpt_flags) |
847 | || test_bit(XPT_CLOSE, &xprt->xpt_flags)) | |
0f0257ea TT |
848 | len = -ENOTCONN; |
849 | else | |
850 | len = xprt->xpt_ops->xpo_sendto(rqstp); | |
851 | mutex_unlock(&xprt->xpt_mutex); | |
4cfc7e60 | 852 | rpc_wake_up(&xprt->xpt_bc_pending); |
0f0257ea TT |
853 | svc_xprt_release(rqstp); |
854 | ||
855 | if (len == -ECONNREFUSED || len == -ENOTCONN || len == -EAGAIN) | |
856 | return 0; | |
857 | return len; | |
858 | } | |
859 | ||
860 | /* | |
861 | * Timer function to close old temporary transports, using | |
862 | * a mark-and-sweep algorithm. | |
863 | */ | |
864 | static void svc_age_temp_xprts(unsigned long closure) | |
865 | { | |
866 | struct svc_serv *serv = (struct svc_serv *)closure; | |
867 | struct svc_xprt *xprt; | |
868 | struct list_head *le, *next; | |
0f0257ea TT |
869 | |
870 | dprintk("svc_age_temp_xprts\n"); | |
871 | ||
872 | if (!spin_trylock_bh(&serv->sv_lock)) { | |
873 | /* busy, try again 1 sec later */ | |
874 | dprintk("svc_age_temp_xprts: busy\n"); | |
875 | mod_timer(&serv->sv_temptimer, jiffies + HZ); | |
876 | return; | |
877 | } | |
878 | ||
879 | list_for_each_safe(le, next, &serv->sv_tempsocks) { | |
880 | xprt = list_entry(le, struct svc_xprt, xpt_list); | |
881 | ||
882 | /* First time through, just mark it OLD. Second time | |
883 | * through, close it. */ | |
884 | if (!test_and_set_bit(XPT_OLD, &xprt->xpt_flags)) | |
885 | continue; | |
f64f9e71 JP |
886 | if (atomic_read(&xprt->xpt_ref.refcount) > 1 || |
887 | test_bit(XPT_BUSY, &xprt->xpt_flags)) | |
0f0257ea | 888 | continue; |
e75bafbf | 889 | list_del_init(le); |
0f0257ea TT |
890 | set_bit(XPT_CLOSE, &xprt->xpt_flags); |
891 | set_bit(XPT_DETACHED, &xprt->xpt_flags); | |
0f0257ea TT |
892 | dprintk("queuing xprt %p for closing\n", xprt); |
893 | ||
894 | /* a thread will dequeue and close it soon */ | |
895 | svc_xprt_enqueue(xprt); | |
0f0257ea | 896 | } |
e75bafbf | 897 | spin_unlock_bh(&serv->sv_lock); |
0f0257ea TT |
898 | |
899 | mod_timer(&serv->sv_temptimer, jiffies + svc_conn_age_period * HZ); | |
900 | } | |
901 | ||
edc7a894 BF |
902 | static void call_xpt_users(struct svc_xprt *xprt) |
903 | { | |
904 | struct svc_xpt_user *u; | |
905 | ||
906 | spin_lock(&xprt->xpt_lock); | |
907 | while (!list_empty(&xprt->xpt_users)) { | |
908 | u = list_first_entry(&xprt->xpt_users, struct svc_xpt_user, list); | |
909 | list_del(&u->list); | |
910 | u->callback(u); | |
911 | } | |
912 | spin_unlock(&xprt->xpt_lock); | |
913 | } | |
914 | ||
0f0257ea TT |
915 | /* |
916 | * Remove a dead transport | |
917 | */ | |
7710ec36 | 918 | static void svc_delete_xprt(struct svc_xprt *xprt) |
0f0257ea TT |
919 | { |
920 | struct svc_serv *serv = xprt->xpt_server; | |
22945e4a TT |
921 | struct svc_deferred_req *dr; |
922 | ||
923 | /* Only do this once */ | |
924 | if (test_and_set_bit(XPT_DEAD, &xprt->xpt_flags)) | |
ac9303eb | 925 | BUG(); |
0f0257ea TT |
926 | |
927 | dprintk("svc: svc_delete_xprt(%p)\n", xprt); | |
928 | xprt->xpt_ops->xpo_detach(xprt); | |
929 | ||
930 | spin_lock_bh(&serv->sv_lock); | |
931 | if (!test_and_set_bit(XPT_DETACHED, &xprt->xpt_flags)) | |
932 | list_del_init(&xprt->xpt_list); | |
01047298 | 933 | WARN_ON_ONCE(!list_empty(&xprt->xpt_ready)); |
22945e4a TT |
934 | if (test_bit(XPT_TEMP, &xprt->xpt_flags)) |
935 | serv->sv_tmpcnt--; | |
788e69e5 | 936 | spin_unlock_bh(&serv->sv_lock); |
22945e4a | 937 | |
ab1b18f7 | 938 | while ((dr = svc_deferred_dequeue(xprt)) != NULL) |
22945e4a | 939 | kfree(dr); |
22945e4a | 940 | |
edc7a894 | 941 | call_xpt_users(xprt); |
22945e4a | 942 | svc_xprt_put(xprt); |
0f0257ea TT |
943 | } |
944 | ||
945 | void svc_close_xprt(struct svc_xprt *xprt) | |
946 | { | |
947 | set_bit(XPT_CLOSE, &xprt->xpt_flags); | |
948 | if (test_and_set_bit(XPT_BUSY, &xprt->xpt_flags)) | |
949 | /* someone else will have to effect the close */ | |
950 | return; | |
b1763316 BF |
951 | /* |
952 | * We expect svc_close_xprt() to work even when no threads are | |
953 | * running (e.g., while configuring the server before starting | |
954 | * any threads), so if the transport isn't busy, we delete | |
955 | * it ourself: | |
956 | */ | |
0f0257ea | 957 | svc_delete_xprt(xprt); |
0f0257ea | 958 | } |
a217813f | 959 | EXPORT_SYMBOL_GPL(svc_close_xprt); |
0f0257ea | 960 | |
cc630d9f | 961 | static int svc_close_list(struct svc_serv *serv, struct list_head *xprt_list, struct net *net) |
0f0257ea TT |
962 | { |
963 | struct svc_xprt *xprt; | |
cc630d9f | 964 | int ret = 0; |
0f0257ea | 965 | |
719f8bcc | 966 | spin_lock(&serv->sv_lock); |
b4f36f88 | 967 | list_for_each_entry(xprt, xprt_list, xpt_list) { |
7b147f1f SK |
968 | if (xprt->xpt_net != net) |
969 | continue; | |
cc630d9f | 970 | ret++; |
0f0257ea | 971 | set_bit(XPT_CLOSE, &xprt->xpt_flags); |
cc630d9f | 972 | svc_xprt_enqueue(xprt); |
0f0257ea | 973 | } |
719f8bcc | 974 | spin_unlock(&serv->sv_lock); |
cc630d9f | 975 | return ret; |
0f0257ea TT |
976 | } |
977 | ||
cc630d9f | 978 | static struct svc_xprt *svc_dequeue_net(struct svc_serv *serv, struct net *net) |
0f0257ea | 979 | { |
b4f36f88 | 980 | struct svc_pool *pool; |
0f0257ea TT |
981 | struct svc_xprt *xprt; |
982 | struct svc_xprt *tmp; | |
b4f36f88 BF |
983 | int i; |
984 | ||
b4f36f88 BF |
985 | for (i = 0; i < serv->sv_nrpools; i++) { |
986 | pool = &serv->sv_pools[i]; | |
987 | ||
988 | spin_lock_bh(&pool->sp_lock); | |
6f513365 | 989 | list_for_each_entry_safe(xprt, tmp, &pool->sp_sockets, xpt_ready) { |
7b147f1f SK |
990 | if (xprt->xpt_net != net) |
991 | continue; | |
b4f36f88 | 992 | list_del_init(&xprt->xpt_ready); |
cc630d9f BF |
993 | spin_unlock_bh(&pool->sp_lock); |
994 | return xprt; | |
b4f36f88 BF |
995 | } |
996 | spin_unlock_bh(&pool->sp_lock); | |
997 | } | |
cc630d9f | 998 | return NULL; |
6f513365 SK |
999 | } |
1000 | ||
cc630d9f | 1001 | static void svc_clean_up_xprts(struct svc_serv *serv, struct net *net) |
6f513365 SK |
1002 | { |
1003 | struct svc_xprt *xprt; | |
719f8bcc | 1004 | |
cc630d9f BF |
1005 | while ((xprt = svc_dequeue_net(serv, net))) { |
1006 | set_bit(XPT_CLOSE, &xprt->xpt_flags); | |
719f8bcc | 1007 | svc_delete_xprt(xprt); |
cc630d9f | 1008 | } |
3a22bf50 SK |
1009 | } |
1010 | ||
cc630d9f BF |
1011 | /* |
1012 | * Server threads may still be running (especially in the case where the | |
1013 | * service is still running in other network namespaces). | |
1014 | * | |
1015 | * So we shut down sockets the same way we would on a running server, by | |
1016 | * setting XPT_CLOSE, enqueuing, and letting a thread pick it up to do | |
1017 | * the close. In the case there are no such other threads, | |
1018 | * threads running, svc_clean_up_xprts() does a simple version of a | |
1019 | * server's main event loop, and in the case where there are other | |
1020 | * threads, we may need to wait a little while and then check again to | |
1021 | * see if they're done. | |
1022 | */ | |
7b147f1f | 1023 | void svc_close_net(struct svc_serv *serv, struct net *net) |
3a22bf50 | 1024 | { |
cc630d9f | 1025 | int delay = 0; |
6f513365 | 1026 | |
cc630d9f BF |
1027 | while (svc_close_list(serv, &serv->sv_permsocks, net) + |
1028 | svc_close_list(serv, &serv->sv_tempsocks, net)) { | |
1029 | ||
1030 | svc_clean_up_xprts(serv, net); | |
1031 | msleep(delay++); | |
1032 | } | |
0f0257ea TT |
1033 | } |
1034 | ||
1035 | /* | |
1036 | * Handle defer and revisit of requests | |
1037 | */ | |
1038 | ||
1039 | static void svc_revisit(struct cache_deferred_req *dreq, int too_many) | |
1040 | { | |
1041 | struct svc_deferred_req *dr = | |
1042 | container_of(dreq, struct svc_deferred_req, handle); | |
1043 | struct svc_xprt *xprt = dr->xprt; | |
1044 | ||
22945e4a TT |
1045 | spin_lock(&xprt->xpt_lock); |
1046 | set_bit(XPT_DEFERRED, &xprt->xpt_flags); | |
1047 | if (too_many || test_bit(XPT_DEAD, &xprt->xpt_flags)) { | |
1048 | spin_unlock(&xprt->xpt_lock); | |
1049 | dprintk("revisit canceled\n"); | |
0f0257ea TT |
1050 | svc_xprt_put(xprt); |
1051 | kfree(dr); | |
1052 | return; | |
1053 | } | |
1054 | dprintk("revisit queued\n"); | |
1055 | dr->xprt = NULL; | |
0f0257ea TT |
1056 | list_add(&dr->handle.recent, &xprt->xpt_deferred); |
1057 | spin_unlock(&xprt->xpt_lock); | |
0f0257ea TT |
1058 | svc_xprt_enqueue(xprt); |
1059 | svc_xprt_put(xprt); | |
1060 | } | |
1061 | ||
260c1d12 TT |
1062 | /* |
1063 | * Save the request off for later processing. The request buffer looks | |
1064 | * like this: | |
1065 | * | |
1066 | * <xprt-header><rpc-header><rpc-pagelist><rpc-tail> | |
1067 | * | |
1068 | * This code can only handle requests that consist of an xprt-header | |
1069 | * and rpc-header. | |
1070 | */ | |
0f0257ea TT |
1071 | static struct cache_deferred_req *svc_defer(struct cache_req *req) |
1072 | { | |
1073 | struct svc_rqst *rqstp = container_of(req, struct svc_rqst, rq_chandle); | |
0f0257ea TT |
1074 | struct svc_deferred_req *dr; |
1075 | ||
2f425878 | 1076 | if (rqstp->rq_arg.page_len || !rqstp->rq_usedeferral) |
0f0257ea TT |
1077 | return NULL; /* if more than a page, give up FIXME */ |
1078 | if (rqstp->rq_deferred) { | |
1079 | dr = rqstp->rq_deferred; | |
1080 | rqstp->rq_deferred = NULL; | |
1081 | } else { | |
260c1d12 TT |
1082 | size_t skip; |
1083 | size_t size; | |
0f0257ea | 1084 | /* FIXME maybe discard if size too large */ |
260c1d12 | 1085 | size = sizeof(struct svc_deferred_req) + rqstp->rq_arg.len; |
0f0257ea TT |
1086 | dr = kmalloc(size, GFP_KERNEL); |
1087 | if (dr == NULL) | |
1088 | return NULL; | |
1089 | ||
1090 | dr->handle.owner = rqstp->rq_server; | |
1091 | dr->prot = rqstp->rq_prot; | |
1092 | memcpy(&dr->addr, &rqstp->rq_addr, rqstp->rq_addrlen); | |
1093 | dr->addrlen = rqstp->rq_addrlen; | |
1094 | dr->daddr = rqstp->rq_daddr; | |
1095 | dr->argslen = rqstp->rq_arg.len >> 2; | |
260c1d12 TT |
1096 | dr->xprt_hlen = rqstp->rq_xprt_hlen; |
1097 | ||
1098 | /* back up head to the start of the buffer and copy */ | |
1099 | skip = rqstp->rq_arg.len - rqstp->rq_arg.head[0].iov_len; | |
1100 | memcpy(dr->args, rqstp->rq_arg.head[0].iov_base - skip, | |
1101 | dr->argslen << 2); | |
0f0257ea TT |
1102 | } |
1103 | svc_xprt_get(rqstp->rq_xprt); | |
1104 | dr->xprt = rqstp->rq_xprt; | |
9e701c61 | 1105 | rqstp->rq_dropme = true; |
0f0257ea TT |
1106 | |
1107 | dr->handle.revisit = svc_revisit; | |
1108 | return &dr->handle; | |
1109 | } | |
1110 | ||
1111 | /* | |
1112 | * recv data from a deferred request into an active one | |
1113 | */ | |
1114 | static int svc_deferred_recv(struct svc_rqst *rqstp) | |
1115 | { | |
1116 | struct svc_deferred_req *dr = rqstp->rq_deferred; | |
1117 | ||
260c1d12 TT |
1118 | /* setup iov_base past transport header */ |
1119 | rqstp->rq_arg.head[0].iov_base = dr->args + (dr->xprt_hlen>>2); | |
1120 | /* The iov_len does not include the transport header bytes */ | |
1121 | rqstp->rq_arg.head[0].iov_len = (dr->argslen<<2) - dr->xprt_hlen; | |
0f0257ea | 1122 | rqstp->rq_arg.page_len = 0; |
260c1d12 TT |
1123 | /* The rq_arg.len includes the transport header bytes */ |
1124 | rqstp->rq_arg.len = dr->argslen<<2; | |
0f0257ea TT |
1125 | rqstp->rq_prot = dr->prot; |
1126 | memcpy(&rqstp->rq_addr, &dr->addr, dr->addrlen); | |
1127 | rqstp->rq_addrlen = dr->addrlen; | |
260c1d12 TT |
1128 | /* Save off transport header len in case we get deferred again */ |
1129 | rqstp->rq_xprt_hlen = dr->xprt_hlen; | |
0f0257ea TT |
1130 | rqstp->rq_daddr = dr->daddr; |
1131 | rqstp->rq_respages = rqstp->rq_pages; | |
260c1d12 | 1132 | return (dr->argslen<<2) - dr->xprt_hlen; |
0f0257ea TT |
1133 | } |
1134 | ||
1135 | ||
1136 | static struct svc_deferred_req *svc_deferred_dequeue(struct svc_xprt *xprt) | |
1137 | { | |
1138 | struct svc_deferred_req *dr = NULL; | |
1139 | ||
1140 | if (!test_bit(XPT_DEFERRED, &xprt->xpt_flags)) | |
1141 | return NULL; | |
1142 | spin_lock(&xprt->xpt_lock); | |
0f0257ea TT |
1143 | if (!list_empty(&xprt->xpt_deferred)) { |
1144 | dr = list_entry(xprt->xpt_deferred.next, | |
1145 | struct svc_deferred_req, | |
1146 | handle.recent); | |
1147 | list_del_init(&dr->handle.recent); | |
62bac4af BF |
1148 | } else |
1149 | clear_bit(XPT_DEFERRED, &xprt->xpt_flags); | |
0f0257ea TT |
1150 | spin_unlock(&xprt->xpt_lock); |
1151 | return dr; | |
1152 | } | |
7fcb98d5 | 1153 | |
156e6209 CL |
1154 | /** |
1155 | * svc_find_xprt - find an RPC transport instance | |
1156 | * @serv: pointer to svc_serv to search | |
1157 | * @xcl_name: C string containing transport's class name | |
4cb54ca2 | 1158 | * @net: owner net pointer |
156e6209 CL |
1159 | * @af: Address family of transport's local address |
1160 | * @port: transport's IP port number | |
1161 | * | |
7fcb98d5 TT |
1162 | * Return the transport instance pointer for the endpoint accepting |
1163 | * connections/peer traffic from the specified transport class, | |
1164 | * address family and port. | |
1165 | * | |
1166 | * Specifying 0 for the address family or port is effectively a | |
1167 | * wild-card, and will result in matching the first transport in the | |
1168 | * service's list that has a matching class name. | |
1169 | */ | |
156e6209 | 1170 | struct svc_xprt *svc_find_xprt(struct svc_serv *serv, const char *xcl_name, |
4cb54ca2 SK |
1171 | struct net *net, const sa_family_t af, |
1172 | const unsigned short port) | |
7fcb98d5 TT |
1173 | { |
1174 | struct svc_xprt *xprt; | |
1175 | struct svc_xprt *found = NULL; | |
1176 | ||
1177 | /* Sanity check the args */ | |
156e6209 | 1178 | if (serv == NULL || xcl_name == NULL) |
7fcb98d5 TT |
1179 | return found; |
1180 | ||
1181 | spin_lock_bh(&serv->sv_lock); | |
1182 | list_for_each_entry(xprt, &serv->sv_permsocks, xpt_list) { | |
4cb54ca2 SK |
1183 | if (xprt->xpt_net != net) |
1184 | continue; | |
7fcb98d5 TT |
1185 | if (strcmp(xprt->xpt_class->xcl_name, xcl_name)) |
1186 | continue; | |
1187 | if (af != AF_UNSPEC && af != xprt->xpt_local.ss_family) | |
1188 | continue; | |
156e6209 | 1189 | if (port != 0 && port != svc_xprt_local_port(xprt)) |
7fcb98d5 TT |
1190 | continue; |
1191 | found = xprt; | |
a217813f | 1192 | svc_xprt_get(xprt); |
7fcb98d5 TT |
1193 | break; |
1194 | } | |
1195 | spin_unlock_bh(&serv->sv_lock); | |
1196 | return found; | |
1197 | } | |
1198 | EXPORT_SYMBOL_GPL(svc_find_xprt); | |
9571af18 | 1199 | |
335c54bd CL |
1200 | static int svc_one_xprt_name(const struct svc_xprt *xprt, |
1201 | char *pos, int remaining) | |
1202 | { | |
1203 | int len; | |
1204 | ||
1205 | len = snprintf(pos, remaining, "%s %u\n", | |
1206 | xprt->xpt_class->xcl_name, | |
1207 | svc_xprt_local_port(xprt)); | |
1208 | if (len >= remaining) | |
1209 | return -ENAMETOOLONG; | |
1210 | return len; | |
1211 | } | |
1212 | ||
1213 | /** | |
1214 | * svc_xprt_names - format a buffer with a list of transport names | |
1215 | * @serv: pointer to an RPC service | |
1216 | * @buf: pointer to a buffer to be filled in | |
1217 | * @buflen: length of buffer to be filled in | |
1218 | * | |
1219 | * Fills in @buf with a string containing a list of transport names, | |
1220 | * each name terminated with '\n'. | |
1221 | * | |
1222 | * Returns positive length of the filled-in string on success; otherwise | |
1223 | * a negative errno value is returned if an error occurs. | |
9571af18 | 1224 | */ |
335c54bd | 1225 | int svc_xprt_names(struct svc_serv *serv, char *buf, const int buflen) |
9571af18 TT |
1226 | { |
1227 | struct svc_xprt *xprt; | |
335c54bd CL |
1228 | int len, totlen; |
1229 | char *pos; | |
9571af18 TT |
1230 | |
1231 | /* Sanity check args */ | |
1232 | if (!serv) | |
1233 | return 0; | |
1234 | ||
1235 | spin_lock_bh(&serv->sv_lock); | |
335c54bd CL |
1236 | |
1237 | pos = buf; | |
1238 | totlen = 0; | |
9571af18 | 1239 | list_for_each_entry(xprt, &serv->sv_permsocks, xpt_list) { |
335c54bd CL |
1240 | len = svc_one_xprt_name(xprt, pos, buflen - totlen); |
1241 | if (len < 0) { | |
1242 | *buf = '\0'; | |
1243 | totlen = len; | |
1244 | } | |
1245 | if (len <= 0) | |
9571af18 | 1246 | break; |
335c54bd CL |
1247 | |
1248 | pos += len; | |
9571af18 TT |
1249 | totlen += len; |
1250 | } | |
335c54bd | 1251 | |
9571af18 TT |
1252 | spin_unlock_bh(&serv->sv_lock); |
1253 | return totlen; | |
1254 | } | |
1255 | EXPORT_SYMBOL_GPL(svc_xprt_names); | |
03cf6c9f GB |
1256 | |
1257 | ||
1258 | /*----------------------------------------------------------------------------*/ | |
1259 | ||
1260 | static void *svc_pool_stats_start(struct seq_file *m, loff_t *pos) | |
1261 | { | |
1262 | unsigned int pidx = (unsigned int)*pos; | |
1263 | struct svc_serv *serv = m->private; | |
1264 | ||
1265 | dprintk("svc_pool_stats_start, *pidx=%u\n", pidx); | |
1266 | ||
03cf6c9f GB |
1267 | if (!pidx) |
1268 | return SEQ_START_TOKEN; | |
1269 | return (pidx > serv->sv_nrpools ? NULL : &serv->sv_pools[pidx-1]); | |
1270 | } | |
1271 | ||
1272 | static void *svc_pool_stats_next(struct seq_file *m, void *p, loff_t *pos) | |
1273 | { | |
1274 | struct svc_pool *pool = p; | |
1275 | struct svc_serv *serv = m->private; | |
1276 | ||
1277 | dprintk("svc_pool_stats_next, *pos=%llu\n", *pos); | |
1278 | ||
1279 | if (p == SEQ_START_TOKEN) { | |
1280 | pool = &serv->sv_pools[0]; | |
1281 | } else { | |
1282 | unsigned int pidx = (pool - &serv->sv_pools[0]); | |
1283 | if (pidx < serv->sv_nrpools-1) | |
1284 | pool = &serv->sv_pools[pidx+1]; | |
1285 | else | |
1286 | pool = NULL; | |
1287 | } | |
1288 | ++*pos; | |
1289 | return pool; | |
1290 | } | |
1291 | ||
1292 | static void svc_pool_stats_stop(struct seq_file *m, void *p) | |
1293 | { | |
03cf6c9f GB |
1294 | } |
1295 | ||
1296 | static int svc_pool_stats_show(struct seq_file *m, void *p) | |
1297 | { | |
1298 | struct svc_pool *pool = p; | |
1299 | ||
1300 | if (p == SEQ_START_TOKEN) { | |
78c210ef | 1301 | seq_puts(m, "# pool packets-arrived sockets-enqueued threads-woken threads-timedout\n"); |
03cf6c9f GB |
1302 | return 0; |
1303 | } | |
1304 | ||
78c210ef | 1305 | seq_printf(m, "%u %lu %lu %lu %lu\n", |
03cf6c9f GB |
1306 | pool->sp_id, |
1307 | pool->sp_stats.packets, | |
1308 | pool->sp_stats.sockets_queued, | |
1309 | pool->sp_stats.threads_woken, | |
03cf6c9f GB |
1310 | pool->sp_stats.threads_timedout); |
1311 | ||
1312 | return 0; | |
1313 | } | |
1314 | ||
1315 | static const struct seq_operations svc_pool_stats_seq_ops = { | |
1316 | .start = svc_pool_stats_start, | |
1317 | .next = svc_pool_stats_next, | |
1318 | .stop = svc_pool_stats_stop, | |
1319 | .show = svc_pool_stats_show, | |
1320 | }; | |
1321 | ||
1322 | int svc_pool_stats_open(struct svc_serv *serv, struct file *file) | |
1323 | { | |
1324 | int err; | |
1325 | ||
1326 | err = seq_open(file, &svc_pool_stats_seq_ops); | |
1327 | if (!err) | |
1328 | ((struct seq_file *) file->private_data)->private = serv; | |
1329 | return err; | |
1330 | } | |
1331 | EXPORT_SYMBOL(svc_pool_stats_open); | |
1332 | ||
1333 | /*----------------------------------------------------------------------------*/ |