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