blob: 65a6c6429a53ed3750007f07205cb772827c74e4 [file] [log] [blame]
Thomas Gleixner1accad52022-06-07 16:11:20 +02001// SPDX-License-Identifier: GPL-2.0-only
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -04002/******************************************************************************
3
4(c) 2007 Network Appliance, Inc. All Rights Reserved.
5(c) 2009 NetApp. All Rights Reserved.
6
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -04007
8******************************************************************************/
9
10#include <linux/tcp.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090011#include <linux/slab.h>
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040012#include <linux/sunrpc/xprt.h>
Paul Gortmakerbc3b2d72011-07-15 11:47:34 -040013#include <linux/export.h>
Trond Myklebust09acfea2012-03-11 15:22:54 -040014#include <linux/sunrpc/bc_xprt.h>
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040015
Jeff Laytonf895b252014-11-17 16:58:04 -050016#if IS_ENABLED(CONFIG_SUNRPC_DEBUG)
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040017#define RPCDBG_FACILITY RPCDBG_TRANS
18#endif
19
Trond Myklebust7402a4f2019-07-16 13:51:29 -040020#define BC_MAX_SLOTS 64U
21
22unsigned int xprt_bc_max_slots(struct rpc_xprt *xprt)
23{
24 return BC_MAX_SLOTS;
25}
26
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040027/*
28 * Helper routines that track the number of preallocation elements
29 * on the transport.
30 */
31static inline int xprt_need_to_requeue(struct rpc_xprt *xprt)
32{
Trond Myklebust7402a4f2019-07-16 13:51:29 -040033 return xprt->bc_alloc_count < xprt->bc_alloc_max;
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040034}
35
36/*
37 * Free the preallocated rpc_rqst structure and the memory
38 * buffers hanging off of it.
39 */
40static void xprt_free_allocation(struct rpc_rqst *req)
41{
42 struct xdr_buf *xbufp;
43
44 dprintk("RPC: free allocations for req= %p\n", req);
Weston Andros Adamsonf30dfbb2012-10-23 10:43:33 -040045 WARN_ON_ONCE(test_bit(RPC_BC_PA_IN_USE, &req->rq_bc_pa_state));
Trond Myklebust88de6af2015-06-01 15:10:25 -040046 xbufp = &req->rq_rcv_buf;
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040047 free_page((unsigned long)xbufp->head[0].iov_base);
48 xbufp = &req->rq_snd_buf;
49 free_page((unsigned long)xbufp->head[0].iov_base);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040050 kfree(req);
51}
52
Trond Myklebust6622e3a2022-07-27 12:27:54 -040053static void xprt_bc_reinit_xdr_buf(struct xdr_buf *buf)
54{
55 buf->head[0].iov_len = PAGE_SIZE;
56 buf->tail[0].iov_len = 0;
57 buf->pages = NULL;
58 buf->page_len = 0;
59 buf->flags = 0;
60 buf->len = 0;
61 buf->buflen = PAGE_SIZE;
62}
63
Trond Myklebust1dddda82015-06-01 15:05:38 -040064static int xprt_alloc_xdr_buf(struct xdr_buf *buf, gfp_t gfp_flags)
65{
66 struct page *page;
67 /* Preallocate one XDR receive buffer */
68 page = alloc_page(gfp_flags);
69 if (page == NULL)
70 return -ENOMEM;
Chuck Leverb9c5bc02016-09-15 10:55:12 -040071 xdr_buf_init(buf, page_address(page), PAGE_SIZE);
Trond Myklebust1dddda82015-06-01 15:05:38 -040072 return 0;
73}
74
Trond Myklebustb2648012022-03-21 13:20:16 -040075static struct rpc_rqst *xprt_alloc_bc_req(struct rpc_xprt *xprt)
Trond Myklebust1dddda82015-06-01 15:05:38 -040076{
Trond Myklebustb2648012022-03-21 13:20:16 -040077 gfp_t gfp_flags = GFP_KERNEL | __GFP_NORETRY | __GFP_NOWARN;
Trond Myklebust1dddda82015-06-01 15:05:38 -040078 struct rpc_rqst *req;
79
80 /* Pre-allocate one backchannel rpc_rqst */
81 req = kzalloc(sizeof(*req), gfp_flags);
82 if (req == NULL)
83 return NULL;
84
85 req->rq_xprt = xprt;
Trond Myklebust1dddda82015-06-01 15:05:38 -040086 INIT_LIST_HEAD(&req->rq_bc_list);
87
88 /* Preallocate one XDR receive buffer */
89 if (xprt_alloc_xdr_buf(&req->rq_rcv_buf, gfp_flags) < 0) {
90 printk(KERN_ERR "Failed to create bc receive xbuf\n");
91 goto out_free;
92 }
93 req->rq_rcv_buf.len = PAGE_SIZE;
94
95 /* Preallocate one XDR send buffer */
96 if (xprt_alloc_xdr_buf(&req->rq_snd_buf, gfp_flags) < 0) {
97 printk(KERN_ERR "Failed to create bc snd xbuf\n");
98 goto out_free;
99 }
100 return req;
101out_free:
102 xprt_free_allocation(req);
103 return NULL;
104}
105
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400106/*
107 * Preallocate up to min_reqs structures and related buffers for use
108 * by the backchannel. This function can be called multiple times
109 * when creating new sessions that use the same rpc_xprt. The
110 * preallocated buffers are added to the pool of resources used by
Randy Dunlap1cc52132020-08-22 18:07:38 -0700111 * the rpc_xprt. Any one of these resources may be used by an
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400112 * incoming callback request. It's up to the higher levels in the
113 * stack to enforce that the maximum number of session slots is not
114 * being exceeded.
115 *
116 * Some callback arguments can be large. For example, a pNFS server
117 * using multiple deviceids. The list can be unbound, but the client
118 * has the ability to tell the server the maximum size of the callback
119 * requests. Each deviceID is 16 bytes, so allocate one page
120 * for the arguments to have enough room to receive a number of these
121 * deviceIDs. The NFS client indicates to the pNFS server that its
122 * callback requests can be up to 4096 bytes in size.
123 */
124int xprt_setup_backchannel(struct rpc_xprt *xprt, unsigned int min_reqs)
125{
Chuck Lever42e5c3e2015-10-24 17:27:35 -0400126 if (!xprt->ops->bc_setup)
127 return 0;
128 return xprt->ops->bc_setup(xprt, min_reqs);
129}
130EXPORT_SYMBOL_GPL(xprt_setup_backchannel);
131
132int xprt_setup_bc(struct rpc_xprt *xprt, unsigned int min_reqs)
133{
Trond Myklebust1dddda82015-06-01 15:05:38 -0400134 struct rpc_rqst *req;
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400135 struct list_head tmp_list;
136 int i;
137
138 dprintk("RPC: setup backchannel transport\n");
139
Trond Myklebust7402a4f2019-07-16 13:51:29 -0400140 if (min_reqs > BC_MAX_SLOTS)
141 min_reqs = BC_MAX_SLOTS;
142
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400143 /*
144 * We use a temporary list to keep track of the preallocated
145 * buffers. Once we're done building the list we splice it
146 * into the backchannel preallocation list off of the rpc_xprt
147 * struct. This helps minimize the amount of time the list
148 * lock is held on the rpc_xprt struct. It also makes cleanup
149 * easier in case of memory allocation errors.
150 */
151 INIT_LIST_HEAD(&tmp_list);
152 for (i = 0; i < min_reqs; i++) {
153 /* Pre-allocate one backchannel rpc_rqst */
Trond Myklebustb2648012022-03-21 13:20:16 -0400154 req = xprt_alloc_bc_req(xprt);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400155 if (req == NULL) {
156 printk(KERN_ERR "Failed to create bc rpc_rqst\n");
157 goto out_free;
158 }
159
160 /* Add the allocated buffer to the tmp list */
161 dprintk("RPC: adding req= %p\n", req);
162 list_add(&req->rq_bc_pa_list, &tmp_list);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400163 }
164
165 /*
166 * Add the temporary list to the backchannel preallocation list
167 */
Trond Myklebustc89091c2017-08-16 12:09:44 -0400168 spin_lock(&xprt->bc_pa_lock);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400169 list_splice(&tmp_list, &xprt->bc_pa_list);
Trond Myklebust7402a4f2019-07-16 13:51:29 -0400170 xprt->bc_alloc_count += min_reqs;
171 xprt->bc_alloc_max += min_reqs;
172 atomic_add(min_reqs, &xprt->bc_slot_count);
Trond Myklebustc89091c2017-08-16 12:09:44 -0400173 spin_unlock(&xprt->bc_pa_lock);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400174
175 dprintk("RPC: setup backchannel transport done\n");
176 return 0;
177
178out_free:
179 /*
180 * Memory allocation failed, free the temporary list
181 */
Trond Myklebust1dddda82015-06-01 15:05:38 -0400182 while (!list_empty(&tmp_list)) {
183 req = list_first_entry(&tmp_list,
184 struct rpc_rqst,
185 rq_bc_pa_list);
Trond Myklebust62835672014-02-11 13:56:54 -0500186 list_del(&req->rq_bc_pa_list);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400187 xprt_free_allocation(req);
Trond Myklebust62835672014-02-11 13:56:54 -0500188 }
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400189
190 dprintk("RPC: setup backchannel transport failed\n");
Weston Andros Adamsond24bab92012-11-01 11:21:53 -0400191 return -ENOMEM;
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400192}
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400193
Ben Hutchings2c530402012-07-10 10:55:09 +0000194/**
195 * xprt_destroy_backchannel - Destroys the backchannel preallocated structures.
196 * @xprt: the transport holding the preallocated strucures
Chuck Leveracf0a392018-12-19 11:00:22 -0500197 * @max_reqs: the maximum number of preallocated structures to destroy
Ben Hutchings2c530402012-07-10 10:55:09 +0000198 *
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400199 * Since these structures may have been allocated by multiple calls
200 * to xprt_setup_backchannel, we only destroy up to the maximum number
201 * of reqs specified by the caller.
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400202 */
203void xprt_destroy_backchannel(struct rpc_xprt *xprt, unsigned int max_reqs)
204{
Chuck Lever42e5c3e2015-10-24 17:27:35 -0400205 if (xprt->ops->bc_destroy)
206 xprt->ops->bc_destroy(xprt, max_reqs);
207}
208EXPORT_SYMBOL_GPL(xprt_destroy_backchannel);
209
210void xprt_destroy_bc(struct rpc_xprt *xprt, unsigned int max_reqs)
211{
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400212 struct rpc_rqst *req = NULL, *tmp = NULL;
213
214 dprintk("RPC: destroy backchannel transport\n");
215
Weston Andros Adamsonc4ded8d2012-10-23 10:43:34 -0400216 if (max_reqs == 0)
217 goto out;
218
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400219 spin_lock_bh(&xprt->bc_pa_lock);
Trond Myklebust669996a2019-10-17 09:02:21 -0400220 xprt->bc_alloc_max -= min(max_reqs, xprt->bc_alloc_max);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400221 list_for_each_entry_safe(req, tmp, &xprt->bc_pa_list, rq_bc_pa_list) {
222 dprintk("RPC: req=%p\n", req);
Trond Myklebust62835672014-02-11 13:56:54 -0500223 list_del(&req->rq_bc_pa_list);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400224 xprt_free_allocation(req);
Trond Myklebust7402a4f2019-07-16 13:51:29 -0400225 xprt->bc_alloc_count--;
226 atomic_dec(&xprt->bc_slot_count);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400227 if (--max_reqs == 0)
228 break;
229 }
230 spin_unlock_bh(&xprt->bc_pa_lock);
231
Weston Andros Adamsonc4ded8d2012-10-23 10:43:34 -0400232out:
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400233 dprintk("RPC: backchannel list empty= %s\n",
234 list_empty(&xprt->bc_pa_list) ? "true" : "false");
235}
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400236
Trond Myklebust0d1bf342019-03-02 13:12:22 -0500237static struct rpc_rqst *xprt_get_bc_request(struct rpc_xprt *xprt, __be32 xid,
238 struct rpc_rqst *new)
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400239{
Trond Myklebust2ea24492014-02-10 11:18:39 -0500240 struct rpc_rqst *req = NULL;
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400241
242 dprintk("RPC: allocate a backchannel request\n");
Trond Myklebust0d2a9702015-06-04 15:37:10 -0400243 if (list_empty(&xprt->bc_pa_list)) {
Trond Myklebust0d1bf342019-03-02 13:12:22 -0500244 if (!new)
Trond Myklebust0d2a9702015-06-04 15:37:10 -0400245 goto not_found;
Trond Myklebust7402a4f2019-07-16 13:51:29 -0400246 if (atomic_read(&xprt->bc_slot_count) >= BC_MAX_SLOTS)
247 goto not_found;
Trond Myklebust0d1bf342019-03-02 13:12:22 -0500248 list_add_tail(&new->rq_bc_pa_list, &xprt->bc_pa_list);
Trond Myklebust68514472015-07-22 16:31:17 -0400249 xprt->bc_alloc_count++;
Trond Myklebust7402a4f2019-07-16 13:51:29 -0400250 atomic_inc(&xprt->bc_slot_count);
Trond Myklebust0d2a9702015-06-04 15:37:10 -0400251 }
Trond Myklebust2ea24492014-02-10 11:18:39 -0500252 req = list_first_entry(&xprt->bc_pa_list, struct rpc_rqst,
253 rq_bc_pa_list);
254 req->rq_reply_bytes_recvd = 0;
Trond Myklebust2ea24492014-02-10 11:18:39 -0500255 memcpy(&req->rq_private_buf, &req->rq_rcv_buf,
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400256 sizeof(req->rq_private_buf));
Trond Myklebust2ea24492014-02-10 11:18:39 -0500257 req->rq_xid = xid;
258 req->rq_connect_cookie = xprt->connect_cookie;
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400259 dprintk("RPC: backchannel req=%p\n", req);
Trond Myklebust0d1bf342019-03-02 13:12:22 -0500260not_found:
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400261 return req;
262}
263
264/*
265 * Return the preallocated rpc_rqst structure and XDR buffers
266 * associated with this rpc_task.
267 */
268void xprt_free_bc_request(struct rpc_rqst *req)
269{
270 struct rpc_xprt *xprt = req->rq_xprt;
271
Chuck Lever42e5c3e2015-10-24 17:27:35 -0400272 xprt->ops->bc_free_rqst(req);
273}
274
275void xprt_free_bc_rqst(struct rpc_rqst *req)
276{
277 struct rpc_xprt *xprt = req->rq_xprt;
278
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400279 dprintk("RPC: free backchannel req=%p\n", req);
280
Trond Myklebust2ea24492014-02-10 11:18:39 -0500281 req->rq_connect_cookie = xprt->connect_cookie - 1;
Peter Zijlstra4e857c52014-03-17 18:06:10 +0100282 smp_mb__before_atomic();
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400283 clear_bit(RPC_BC_PA_IN_USE, &req->rq_bc_pa_state);
Peter Zijlstra4e857c52014-03-17 18:06:10 +0100284 smp_mb__after_atomic();
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400285
Trond Myklebust0d2a9702015-06-04 15:37:10 -0400286 /*
287 * Return it to the list of preallocations so that it
288 * may be reused by a new callback request.
289 */
290 spin_lock_bh(&xprt->bc_pa_lock);
291 if (xprt_need_to_requeue(xprt)) {
Trond Myklebust6622e3a2022-07-27 12:27:54 -0400292 xprt_bc_reinit_xdr_buf(&req->rq_snd_buf);
293 xprt_bc_reinit_xdr_buf(&req->rq_rcv_buf);
294 req->rq_rcv_buf.len = PAGE_SIZE;
Trond Myklebust0d2a9702015-06-04 15:37:10 -0400295 list_add_tail(&req->rq_bc_pa_list, &xprt->bc_pa_list);
296 xprt->bc_alloc_count++;
Trond Myklebust7402a4f2019-07-16 13:51:29 -0400297 atomic_inc(&xprt->bc_slot_count);
Trond Myklebust0d2a9702015-06-04 15:37:10 -0400298 req = NULL;
299 }
300 spin_unlock_bh(&xprt->bc_pa_lock);
301 if (req != NULL) {
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400302 /*
303 * The last remaining session was destroyed while this
304 * entry was in use. Free the entry and don't attempt
305 * to add back to the list because there is no need to
306 * have anymore preallocated entries.
307 */
308 dprintk("RPC: Last session removed req=%p\n", req);
309 xprt_free_allocation(req);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400310 }
Trond Myklebust875f0702019-10-17 09:02:19 -0400311 xprt_put(xprt);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400312}
313
Trond Myklebust2ea24492014-02-10 11:18:39 -0500314/*
315 * One or more rpc_rqst structure have been preallocated during the
316 * backchannel setup. Buffer space for the send and private XDR buffers
317 * has been preallocated as well. Use xprt_alloc_bc_request to allocate
318 * to this request. Use xprt_free_bc_request to return it.
319 *
320 * We know that we're called in soft interrupt context, grab the spin_lock
321 * since there is no need to grab the bottom half spin_lock.
322 *
323 * Return an available rpc_rqst, otherwise NULL if non are available.
324 */
325struct rpc_rqst *xprt_lookup_bc_request(struct rpc_xprt *xprt, __be32 xid)
326{
Trond Myklebust0d1bf342019-03-02 13:12:22 -0500327 struct rpc_rqst *req, *new = NULL;
Trond Myklebust2ea24492014-02-10 11:18:39 -0500328
Trond Myklebust0d1bf342019-03-02 13:12:22 -0500329 do {
330 spin_lock(&xprt->bc_pa_lock);
331 list_for_each_entry(req, &xprt->bc_pa_list, rq_bc_pa_list) {
332 if (req->rq_connect_cookie != xprt->connect_cookie)
333 continue;
334 if (req->rq_xid == xid)
335 goto found;
336 }
337 req = xprt_get_bc_request(xprt, xid, new);
Trond Myklebust2ea24492014-02-10 11:18:39 -0500338found:
Trond Myklebust0d1bf342019-03-02 13:12:22 -0500339 spin_unlock(&xprt->bc_pa_lock);
340 if (new) {
341 if (req != new)
Trond Myklebust875f0702019-10-17 09:02:19 -0400342 xprt_free_allocation(new);
Trond Myklebust0d1bf342019-03-02 13:12:22 -0500343 break;
344 } else if (req)
345 break;
Trond Myklebustb2648012022-03-21 13:20:16 -0400346 new = xprt_alloc_bc_req(xprt);
Trond Myklebust0d1bf342019-03-02 13:12:22 -0500347 } while (new);
Trond Myklebust2ea24492014-02-10 11:18:39 -0500348 return req;
349}
350
351/*
352 * Add callback request to callback list. The callback
353 * service sleeps on the sv_cb_waitq waiting for new
354 * requests. Wake it up after adding enqueing the
355 * request.
356 */
357void xprt_complete_bc_request(struct rpc_rqst *req, uint32_t copied)
358{
359 struct rpc_xprt *xprt = req->rq_xprt;
360 struct svc_serv *bc_serv = xprt->bc_serv;
361
Chuck Lever813b00d2015-02-13 13:08:25 -0500362 spin_lock(&xprt->bc_pa_lock);
363 list_del(&req->rq_bc_pa_list);
Trond Myklebust7402a4f2019-07-16 13:51:29 -0400364 xprt->bc_alloc_count--;
Chuck Lever813b00d2015-02-13 13:08:25 -0500365 spin_unlock(&xprt->bc_pa_lock);
366
Trond Myklebust2ea24492014-02-10 11:18:39 -0500367 req->rq_private_buf.len = copied;
368 set_bit(RPC_BC_PA_IN_USE, &req->rq_bc_pa_state);
369
370 dprintk("RPC: add callback request to list\n");
Trond Myklebust875f0702019-10-17 09:02:19 -0400371 xprt_get(xprt);
Trond Myklebust2ea24492014-02-10 11:18:39 -0500372 spin_lock(&bc_serv->sv_cb_lock);
Trond Myklebust2ea24492014-02-10 11:18:39 -0500373 list_add(&req->rq_bc_list, &bc_serv->sv_cb_list);
374 wake_up(&bc_serv->sv_cb_waitq);
375 spin_unlock(&bc_serv->sv_cb_lock);
376}