blob: c2c68a15b59de07c9837599d959174b55ae353ba [file] [log] [blame]
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -04001/******************************************************************************
2
3(c) 2007 Network Appliance, Inc. All Rights Reserved.
4(c) 2009 NetApp. All Rights Reserved.
5
6NetApp provides this source code under the GPL v2 License.
7The GPL v2 license is available at
8http://opensource.org/licenses/gpl-license.php.
9
10THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
11"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
12LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
13A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
14CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
15EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
16PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
17PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
18LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
19NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
20SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
21
22******************************************************************************/
23
24#include <linux/tcp.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090025#include <linux/slab.h>
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040026#include <linux/sunrpc/xprt.h>
Paul Gortmakerbc3b2d72011-07-15 11:47:34 -040027#include <linux/export.h>
Trond Myklebust09acfea2012-03-11 15:22:54 -040028#include <linux/sunrpc/bc_xprt.h>
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040029
Jeff Laytonf895b252014-11-17 16:58:04 -050030#if IS_ENABLED(CONFIG_SUNRPC_DEBUG)
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040031#define RPCDBG_FACILITY RPCDBG_TRANS
32#endif
33
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040034/*
35 * Helper routines that track the number of preallocation elements
36 * on the transport.
37 */
38static inline int xprt_need_to_requeue(struct rpc_xprt *xprt)
39{
Trond Myklebust0d2a9702015-06-04 15:37:10 -040040 return xprt->bc_alloc_count < atomic_read(&xprt->bc_free_slots);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040041}
42
43static inline void xprt_inc_alloc_count(struct rpc_xprt *xprt, unsigned int n)
44{
Trond Myklebust0d2a9702015-06-04 15:37:10 -040045 atomic_add(n, &xprt->bc_free_slots);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040046 xprt->bc_alloc_count += n;
47}
48
49static inline int xprt_dec_alloc_count(struct rpc_xprt *xprt, unsigned int n)
50{
Trond Myklebust0d2a9702015-06-04 15:37:10 -040051 atomic_sub(n, &xprt->bc_free_slots);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040052 return xprt->bc_alloc_count -= n;
53}
54
55/*
56 * Free the preallocated rpc_rqst structure and the memory
57 * buffers hanging off of it.
58 */
59static void xprt_free_allocation(struct rpc_rqst *req)
60{
61 struct xdr_buf *xbufp;
62
63 dprintk("RPC: free allocations for req= %p\n", req);
Weston Andros Adamsonf30dfbb2012-10-23 10:43:33 -040064 WARN_ON_ONCE(test_bit(RPC_BC_PA_IN_USE, &req->rq_bc_pa_state));
Trond Myklebust88de6af2015-06-01 15:10:25 -040065 xbufp = &req->rq_rcv_buf;
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040066 free_page((unsigned long)xbufp->head[0].iov_base);
67 xbufp = &req->rq_snd_buf;
68 free_page((unsigned long)xbufp->head[0].iov_base);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -040069 kfree(req);
70}
71
Trond Myklebust1dddda82015-06-01 15:05:38 -040072static int xprt_alloc_xdr_buf(struct xdr_buf *buf, gfp_t gfp_flags)
73{
74 struct page *page;
75 /* Preallocate one XDR receive buffer */
76 page = alloc_page(gfp_flags);
77 if (page == NULL)
78 return -ENOMEM;
Chuck Leverb9c5bc02016-09-15 10:55:12 -040079 xdr_buf_init(buf, page_address(page), PAGE_SIZE);
Trond Myklebust1dddda82015-06-01 15:05:38 -040080 return 0;
81}
82
83static
84struct rpc_rqst *xprt_alloc_bc_req(struct rpc_xprt *xprt, gfp_t gfp_flags)
85{
86 struct rpc_rqst *req;
87
88 /* Pre-allocate one backchannel rpc_rqst */
89 req = kzalloc(sizeof(*req), gfp_flags);
90 if (req == NULL)
91 return NULL;
92
93 req->rq_xprt = xprt;
94 INIT_LIST_HEAD(&req->rq_list);
95 INIT_LIST_HEAD(&req->rq_bc_list);
96
97 /* Preallocate one XDR receive buffer */
98 if (xprt_alloc_xdr_buf(&req->rq_rcv_buf, gfp_flags) < 0) {
99 printk(KERN_ERR "Failed to create bc receive xbuf\n");
100 goto out_free;
101 }
102 req->rq_rcv_buf.len = PAGE_SIZE;
103
104 /* Preallocate one XDR send buffer */
105 if (xprt_alloc_xdr_buf(&req->rq_snd_buf, gfp_flags) < 0) {
106 printk(KERN_ERR "Failed to create bc snd xbuf\n");
107 goto out_free;
108 }
109 return req;
110out_free:
111 xprt_free_allocation(req);
112 return NULL;
113}
114
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400115/*
116 * Preallocate up to min_reqs structures and related buffers for use
117 * by the backchannel. This function can be called multiple times
118 * when creating new sessions that use the same rpc_xprt. The
119 * preallocated buffers are added to the pool of resources used by
120 * the rpc_xprt. Anyone of these resources may be used used by an
121 * incoming callback request. It's up to the higher levels in the
122 * stack to enforce that the maximum number of session slots is not
123 * being exceeded.
124 *
125 * Some callback arguments can be large. For example, a pNFS server
126 * using multiple deviceids. The list can be unbound, but the client
127 * has the ability to tell the server the maximum size of the callback
128 * requests. Each deviceID is 16 bytes, so allocate one page
129 * for the arguments to have enough room to receive a number of these
130 * deviceIDs. The NFS client indicates to the pNFS server that its
131 * callback requests can be up to 4096 bytes in size.
132 */
133int xprt_setup_backchannel(struct rpc_xprt *xprt, unsigned int min_reqs)
134{
Chuck Lever42e5c3e2015-10-24 17:27:35 -0400135 if (!xprt->ops->bc_setup)
136 return 0;
137 return xprt->ops->bc_setup(xprt, min_reqs);
138}
139EXPORT_SYMBOL_GPL(xprt_setup_backchannel);
140
141int xprt_setup_bc(struct rpc_xprt *xprt, unsigned int min_reqs)
142{
Trond Myklebust1dddda82015-06-01 15:05:38 -0400143 struct rpc_rqst *req;
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400144 struct list_head tmp_list;
145 int i;
146
147 dprintk("RPC: setup backchannel transport\n");
148
149 /*
150 * We use a temporary list to keep track of the preallocated
151 * buffers. Once we're done building the list we splice it
152 * into the backchannel preallocation list off of the rpc_xprt
153 * struct. This helps minimize the amount of time the list
154 * lock is held on the rpc_xprt struct. It also makes cleanup
155 * easier in case of memory allocation errors.
156 */
157 INIT_LIST_HEAD(&tmp_list);
158 for (i = 0; i < min_reqs; i++) {
159 /* Pre-allocate one backchannel rpc_rqst */
Trond Myklebust1dddda82015-06-01 15:05:38 -0400160 req = xprt_alloc_bc_req(xprt, GFP_KERNEL);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400161 if (req == NULL) {
162 printk(KERN_ERR "Failed to create bc rpc_rqst\n");
163 goto out_free;
164 }
165
166 /* Add the allocated buffer to the tmp list */
167 dprintk("RPC: adding req= %p\n", req);
168 list_add(&req->rq_bc_pa_list, &tmp_list);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400169 }
170
171 /*
172 * Add the temporary list to the backchannel preallocation list
173 */
Trond Myklebustc89091c2017-08-16 12:09:44 -0400174 spin_lock(&xprt->bc_pa_lock);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400175 list_splice(&tmp_list, &xprt->bc_pa_list);
176 xprt_inc_alloc_count(xprt, min_reqs);
Trond Myklebustc89091c2017-08-16 12:09:44 -0400177 spin_unlock(&xprt->bc_pa_lock);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400178
179 dprintk("RPC: setup backchannel transport done\n");
180 return 0;
181
182out_free:
183 /*
184 * Memory allocation failed, free the temporary list
185 */
Trond Myklebust1dddda82015-06-01 15:05:38 -0400186 while (!list_empty(&tmp_list)) {
187 req = list_first_entry(&tmp_list,
188 struct rpc_rqst,
189 rq_bc_pa_list);
Trond Myklebust62835672014-02-11 13:56:54 -0500190 list_del(&req->rq_bc_pa_list);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400191 xprt_free_allocation(req);
Trond Myklebust62835672014-02-11 13:56:54 -0500192 }
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400193
194 dprintk("RPC: setup backchannel transport failed\n");
Weston Andros Adamsond24bab92012-11-01 11:21:53 -0400195 return -ENOMEM;
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400196}
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400197
Ben Hutchings2c530402012-07-10 10:55:09 +0000198/**
199 * xprt_destroy_backchannel - Destroys the backchannel preallocated structures.
200 * @xprt: the transport holding the preallocated strucures
201 * @max_reqs the maximum number of preallocated structures to destroy
202 *
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400203 * Since these structures may have been allocated by multiple calls
204 * to xprt_setup_backchannel, we only destroy up to the maximum number
205 * of reqs specified by the caller.
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400206 */
207void xprt_destroy_backchannel(struct rpc_xprt *xprt, unsigned int max_reqs)
208{
Chuck Lever42e5c3e2015-10-24 17:27:35 -0400209 if (xprt->ops->bc_destroy)
210 xprt->ops->bc_destroy(xprt, max_reqs);
211}
212EXPORT_SYMBOL_GPL(xprt_destroy_backchannel);
213
214void xprt_destroy_bc(struct rpc_xprt *xprt, unsigned int max_reqs)
215{
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400216 struct rpc_rqst *req = NULL, *tmp = NULL;
217
218 dprintk("RPC: destroy backchannel transport\n");
219
Weston Andros Adamsonc4ded8d2012-10-23 10:43:34 -0400220 if (max_reqs == 0)
221 goto out;
222
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400223 spin_lock_bh(&xprt->bc_pa_lock);
224 xprt_dec_alloc_count(xprt, max_reqs);
225 list_for_each_entry_safe(req, tmp, &xprt->bc_pa_list, rq_bc_pa_list) {
226 dprintk("RPC: req=%p\n", req);
Trond Myklebust62835672014-02-11 13:56:54 -0500227 list_del(&req->rq_bc_pa_list);
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400228 xprt_free_allocation(req);
229 if (--max_reqs == 0)
230 break;
231 }
232 spin_unlock_bh(&xprt->bc_pa_lock);
233
Weston Andros Adamsonc4ded8d2012-10-23 10:43:34 -0400234out:
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400235 dprintk("RPC: backchannel list empty= %s\n",
236 list_empty(&xprt->bc_pa_list) ? "true" : "false");
237}
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400238
Trond Myklebust2ea24492014-02-10 11:18:39 -0500239static struct rpc_rqst *xprt_alloc_bc_request(struct rpc_xprt *xprt, __be32 xid)
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400240{
Trond Myklebust2ea24492014-02-10 11:18:39 -0500241 struct rpc_rqst *req = NULL;
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400242
243 dprintk("RPC: allocate a backchannel request\n");
Trond Myklebust0d2a9702015-06-04 15:37:10 -0400244 if (atomic_read(&xprt->bc_free_slots) <= 0)
Trond Myklebust2ea24492014-02-10 11:18:39 -0500245 goto not_found;
Trond Myklebust0d2a9702015-06-04 15:37:10 -0400246 if (list_empty(&xprt->bc_pa_list)) {
247 req = xprt_alloc_bc_req(xprt, GFP_ATOMIC);
248 if (!req)
249 goto not_found;
Trond Myklebust68514472015-07-22 16:31:17 -0400250 list_add_tail(&req->rq_bc_pa_list, &xprt->bc_pa_list);
251 xprt->bc_alloc_count++;
Trond Myklebust0d2a9702015-06-04 15:37:10 -0400252 }
Trond Myklebust2ea24492014-02-10 11:18:39 -0500253 req = list_first_entry(&xprt->bc_pa_list, struct rpc_rqst,
254 rq_bc_pa_list);
255 req->rq_reply_bytes_recvd = 0;
256 req->rq_bytes_sent = 0;
257 memcpy(&req->rq_private_buf, &req->rq_rcv_buf,
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400258 sizeof(req->rq_private_buf));
Trond Myklebust2ea24492014-02-10 11:18:39 -0500259 req->rq_xid = xid;
260 req->rq_connect_cookie = xprt->connect_cookie;
261not_found:
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400262 dprintk("RPC: backchannel req=%p\n", req);
263 return req;
264}
265
266/*
267 * Return the preallocated rpc_rqst structure and XDR buffers
268 * associated with this rpc_task.
269 */
270void xprt_free_bc_request(struct rpc_rqst *req)
271{
272 struct rpc_xprt *xprt = req->rq_xprt;
273
Chuck Lever42e5c3e2015-10-24 17:27:35 -0400274 xprt->ops->bc_free_rqst(req);
275}
276
277void xprt_free_bc_rqst(struct rpc_rqst *req)
278{
279 struct rpc_xprt *xprt = req->rq_xprt;
280
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400281 dprintk("RPC: free backchannel req=%p\n", req);
282
Trond Myklebust2ea24492014-02-10 11:18:39 -0500283 req->rq_connect_cookie = xprt->connect_cookie - 1;
Peter Zijlstra4e857c52014-03-17 18:06:10 +0100284 smp_mb__before_atomic();
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400285 clear_bit(RPC_BC_PA_IN_USE, &req->rq_bc_pa_state);
Peter Zijlstra4e857c52014-03-17 18:06:10 +0100286 smp_mb__after_atomic();
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400287
Trond Myklebust0d2a9702015-06-04 15:37:10 -0400288 /*
289 * Return it to the list of preallocations so that it
290 * may be reused by a new callback request.
291 */
292 spin_lock_bh(&xprt->bc_pa_lock);
293 if (xprt_need_to_requeue(xprt)) {
294 list_add_tail(&req->rq_bc_pa_list, &xprt->bc_pa_list);
295 xprt->bc_alloc_count++;
296 req = NULL;
297 }
298 spin_unlock_bh(&xprt->bc_pa_lock);
299 if (req != NULL) {
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400300 /*
301 * The last remaining session was destroyed while this
302 * entry was in use. Free the entry and don't attempt
303 * to add back to the list because there is no need to
304 * have anymore preallocated entries.
305 */
306 dprintk("RPC: Last session removed req=%p\n", req);
307 xprt_free_allocation(req);
308 return;
309 }
Ricardo Labiagafb7a0b92009-04-01 09:23:00 -0400310}
311
Trond Myklebust2ea24492014-02-10 11:18:39 -0500312/*
313 * One or more rpc_rqst structure have been preallocated during the
314 * backchannel setup. Buffer space for the send and private XDR buffers
315 * has been preallocated as well. Use xprt_alloc_bc_request to allocate
316 * to this request. Use xprt_free_bc_request to return it.
317 *
318 * We know that we're called in soft interrupt context, grab the spin_lock
319 * since there is no need to grab the bottom half spin_lock.
320 *
321 * Return an available rpc_rqst, otherwise NULL if non are available.
322 */
323struct rpc_rqst *xprt_lookup_bc_request(struct rpc_xprt *xprt, __be32 xid)
324{
325 struct rpc_rqst *req;
326
327 spin_lock(&xprt->bc_pa_lock);
328 list_for_each_entry(req, &xprt->bc_pa_list, rq_bc_pa_list) {
329 if (req->rq_connect_cookie != xprt->connect_cookie)
330 continue;
331 if (req->rq_xid == xid)
332 goto found;
333 }
334 req = xprt_alloc_bc_request(xprt, xid);
335found:
336 spin_unlock(&xprt->bc_pa_lock);
337 return req;
338}
339
340/*
341 * Add callback request to callback list. The callback
342 * service sleeps on the sv_cb_waitq waiting for new
343 * requests. Wake it up after adding enqueing the
344 * request.
345 */
346void xprt_complete_bc_request(struct rpc_rqst *req, uint32_t copied)
347{
348 struct rpc_xprt *xprt = req->rq_xprt;
349 struct svc_serv *bc_serv = xprt->bc_serv;
350
Chuck Lever813b00d2015-02-13 13:08:25 -0500351 spin_lock(&xprt->bc_pa_lock);
352 list_del(&req->rq_bc_pa_list);
Trond Myklebust1980bd42015-07-22 17:05:32 -0400353 xprt_dec_alloc_count(xprt, 1);
Chuck Lever813b00d2015-02-13 13:08:25 -0500354 spin_unlock(&xprt->bc_pa_lock);
355
Trond Myklebust2ea24492014-02-10 11:18:39 -0500356 req->rq_private_buf.len = copied;
357 set_bit(RPC_BC_PA_IN_USE, &req->rq_bc_pa_state);
358
359 dprintk("RPC: add callback request to list\n");
360 spin_lock(&bc_serv->sv_cb_lock);
Trond Myklebust2ea24492014-02-10 11:18:39 -0500361 list_add(&req->rq_bc_list, &bc_serv->sv_cb_list);
362 wake_up(&bc_serv->sv_cb_waitq);
363 spin_unlock(&bc_serv->sv_cb_lock);
364}
365