2018-05-08 03:26:55 +08:00
|
|
|
// SPDX-License-Identifier: GPL-2.0 OR BSD-3-Clause
|
2007-12-13 06:13:23 +08:00
|
|
|
/*
|
2018-05-08 03:27:21 +08:00
|
|
|
* Copyright (c) 2016-2018 Oracle. All rights reserved.
|
2014-05-29 04:12:01 +08:00
|
|
|
* Copyright (c) 2014 Open Grid Computing, Inc. All rights reserved.
|
2007-12-13 06:13:23 +08:00
|
|
|
* Copyright (c) 2005-2006 Network Appliance, Inc. All rights reserved.
|
|
|
|
*
|
|
|
|
* This software is available to you under a choice of one of two
|
|
|
|
* licenses. You may choose to be licensed under the terms of the GNU
|
|
|
|
* General Public License (GPL) Version 2, available from the file
|
|
|
|
* COPYING in the main directory of this source tree, or the BSD-type
|
|
|
|
* license below:
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
*
|
|
|
|
* Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* Redistributions in binary form must reproduce the above
|
|
|
|
* copyright notice, this list of conditions and the following
|
|
|
|
* disclaimer in the documentation and/or other materials provided
|
|
|
|
* with the distribution.
|
|
|
|
*
|
|
|
|
* Neither the name of the Network Appliance, Inc. nor the names of
|
|
|
|
* its contributors may be used to endorse or promote products
|
|
|
|
* derived from this software without specific prior written
|
|
|
|
* permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* Author: Tom Tucker <tom@opengridcomputing.com>
|
|
|
|
*/
|
|
|
|
|
2017-06-24 05:18:33 +08:00
|
|
|
/* Operation
|
|
|
|
*
|
|
|
|
* The main entry point is svc_rdma_recvfrom. This is called from
|
|
|
|
* svc_recv when the transport indicates there is incoming data to
|
|
|
|
* be read. "Data Ready" is signaled when an RDMA Receive completes,
|
|
|
|
* or when a set of RDMA Reads complete.
|
|
|
|
*
|
|
|
|
* An svc_rqst is passed in. This structure contains an array of
|
|
|
|
* free pages (rq_pages) that will contain the incoming RPC message.
|
|
|
|
*
|
|
|
|
* Short messages are moved directly into svc_rqst::rq_arg, and
|
|
|
|
* the RPC Call is ready to be processed by the Upper Layer.
|
|
|
|
* svc_rdma_recvfrom returns the length of the RPC Call message,
|
|
|
|
* completing the reception of the RPC Call.
|
|
|
|
*
|
|
|
|
* However, when an incoming message has Read chunks,
|
|
|
|
* svc_rdma_recvfrom must post RDMA Reads to pull the RPC Call's
|
|
|
|
* data payload from the client. svc_rdma_recvfrom sets up the
|
|
|
|
* RDMA Reads using pages in svc_rqst::rq_pages, which are
|
2018-05-08 03:27:21 +08:00
|
|
|
* transferred to an svc_rdma_recv_ctxt for the duration of the
|
2017-06-24 05:18:33 +08:00
|
|
|
* I/O. svc_rdma_recvfrom then returns zero, since the RPC message
|
|
|
|
* is still not yet ready.
|
|
|
|
*
|
|
|
|
* When the Read chunk payloads have become available on the
|
|
|
|
* server, "Data Ready" is raised again, and svc_recv calls
|
|
|
|
* svc_rdma_recvfrom again. This second call may use a different
|
|
|
|
* svc_rqst than the first one, thus any information that needs
|
|
|
|
* to be preserved across these two calls is kept in an
|
2018-05-08 03:27:21 +08:00
|
|
|
* svc_rdma_recv_ctxt.
|
2017-06-24 05:18:33 +08:00
|
|
|
*
|
|
|
|
* The second call to svc_rdma_recvfrom performs final assembly
|
|
|
|
* of the RPC Call message, using the RDMA Read sink pages kept in
|
2018-05-08 03:27:21 +08:00
|
|
|
* the svc_rdma_recv_ctxt. The xdr_buf is copied from the
|
|
|
|
* svc_rdma_recv_ctxt to the second svc_rqst. The second call returns
|
2017-06-24 05:18:33 +08:00
|
|
|
* the length of the completed RPC Call message.
|
|
|
|
*
|
|
|
|
* Page Management
|
|
|
|
*
|
|
|
|
* Pages under I/O must be transferred from the first svc_rqst to an
|
2018-05-08 03:27:21 +08:00
|
|
|
* svc_rdma_recv_ctxt before the first svc_rdma_recvfrom call returns.
|
2017-06-24 05:18:33 +08:00
|
|
|
*
|
|
|
|
* The first svc_rqst supplies pages for RDMA Reads. These are moved
|
|
|
|
* from rqstp::rq_pages into ctxt::pages. The consumed elements of
|
|
|
|
* the rq_pages array are set to NULL and refilled with the first
|
|
|
|
* svc_rdma_recvfrom call returns.
|
|
|
|
*
|
|
|
|
* During the second svc_rdma_recvfrom call, RDMA Read sink pages
|
2018-05-08 03:27:21 +08:00
|
|
|
* are transferred from the svc_rdma_recv_ctxt to the second svc_rqst
|
2017-06-24 05:18:33 +08:00
|
|
|
* (see rdma_read_complete() below).
|
|
|
|
*/
|
|
|
|
|
2018-05-08 03:27:11 +08:00
|
|
|
#include <linux/spinlock.h>
|
2007-12-13 06:13:23 +08:00
|
|
|
#include <asm/unaligned.h>
|
|
|
|
#include <rdma/ib_verbs.h>
|
|
|
|
#include <rdma/rdma_cm.h>
|
2017-06-24 05:18:33 +08:00
|
|
|
|
|
|
|
#include <linux/sunrpc/xdr.h>
|
|
|
|
#include <linux/sunrpc/debug.h>
|
|
|
|
#include <linux/sunrpc/rpc_rdma.h>
|
2007-12-13 06:13:23 +08:00
|
|
|
#include <linux/sunrpc/svc_rdma.h>
|
|
|
|
|
2018-05-08 03:27:11 +08:00
|
|
|
#include "xprt_rdma.h"
|
|
|
|
#include <trace/events/rpcrdma.h>
|
|
|
|
|
2007-12-13 06:13:23 +08:00
|
|
|
#define RPCDBG_FACILITY RPCDBG_SVCXPRT
|
|
|
|
|
2018-05-08 03:27:21 +08:00
|
|
|
static void svc_rdma_wc_receive(struct ib_cq *cq, struct ib_wc *wc);
|
|
|
|
|
|
|
|
static inline struct svc_rdma_recv_ctxt *
|
|
|
|
svc_rdma_next_recv_ctxt(struct list_head *list)
|
|
|
|
{
|
|
|
|
return list_first_entry_or_null(list, struct svc_rdma_recv_ctxt,
|
|
|
|
rc_list);
|
|
|
|
}
|
|
|
|
|
2018-05-08 03:27:43 +08:00
|
|
|
static struct svc_rdma_recv_ctxt *
|
|
|
|
svc_rdma_recv_ctxt_alloc(struct svcxprt_rdma *rdma)
|
|
|
|
{
|
|
|
|
struct svc_rdma_recv_ctxt *ctxt;
|
|
|
|
dma_addr_t addr;
|
|
|
|
void *buffer;
|
|
|
|
|
|
|
|
ctxt = kmalloc(sizeof(*ctxt), GFP_KERNEL);
|
|
|
|
if (!ctxt)
|
|
|
|
goto fail0;
|
|
|
|
buffer = kmalloc(rdma->sc_max_req_size, GFP_KERNEL);
|
|
|
|
if (!buffer)
|
|
|
|
goto fail1;
|
|
|
|
addr = ib_dma_map_single(rdma->sc_pd->device, buffer,
|
|
|
|
rdma->sc_max_req_size, DMA_FROM_DEVICE);
|
|
|
|
if (ib_dma_mapping_error(rdma->sc_pd->device, addr))
|
|
|
|
goto fail2;
|
|
|
|
|
|
|
|
ctxt->rc_recv_wr.next = NULL;
|
|
|
|
ctxt->rc_recv_wr.wr_cqe = &ctxt->rc_cqe;
|
|
|
|
ctxt->rc_recv_wr.sg_list = &ctxt->rc_recv_sge;
|
|
|
|
ctxt->rc_recv_wr.num_sge = 1;
|
|
|
|
ctxt->rc_cqe.done = svc_rdma_wc_receive;
|
|
|
|
ctxt->rc_recv_sge.addr = addr;
|
|
|
|
ctxt->rc_recv_sge.length = rdma->sc_max_req_size;
|
|
|
|
ctxt->rc_recv_sge.lkey = rdma->sc_pd->local_dma_lkey;
|
|
|
|
ctxt->rc_recv_buf = buffer;
|
2018-05-08 03:27:48 +08:00
|
|
|
ctxt->rc_temp = false;
|
2018-05-08 03:27:43 +08:00
|
|
|
return ctxt;
|
|
|
|
|
|
|
|
fail2:
|
|
|
|
kfree(buffer);
|
|
|
|
fail1:
|
|
|
|
kfree(ctxt);
|
|
|
|
fail0:
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2018-05-08 03:27:48 +08:00
|
|
|
static void svc_rdma_recv_ctxt_destroy(struct svcxprt_rdma *rdma,
|
|
|
|
struct svc_rdma_recv_ctxt *ctxt)
|
|
|
|
{
|
|
|
|
ib_dma_unmap_single(rdma->sc_pd->device, ctxt->rc_recv_sge.addr,
|
|
|
|
ctxt->rc_recv_sge.length, DMA_FROM_DEVICE);
|
|
|
|
kfree(ctxt->rc_recv_buf);
|
|
|
|
kfree(ctxt);
|
|
|
|
}
|
|
|
|
|
2018-05-08 03:27:21 +08:00
|
|
|
/**
|
|
|
|
* svc_rdma_recv_ctxts_destroy - Release all recv_ctxt's for an xprt
|
|
|
|
* @rdma: svcxprt_rdma being torn down
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
void svc_rdma_recv_ctxts_destroy(struct svcxprt_rdma *rdma)
|
|
|
|
{
|
|
|
|
struct svc_rdma_recv_ctxt *ctxt;
|
2019-08-17 05:49:38 +08:00
|
|
|
struct llist_node *node;
|
2018-05-08 03:27:21 +08:00
|
|
|
|
2019-08-17 05:49:38 +08:00
|
|
|
while ((node = llist_del_first(&rdma->sc_recv_ctxts))) {
|
|
|
|
ctxt = llist_entry(node, struct svc_rdma_recv_ctxt, rc_node);
|
2018-05-08 03:27:48 +08:00
|
|
|
svc_rdma_recv_ctxt_destroy(rdma, ctxt);
|
2018-05-08 03:27:21 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct svc_rdma_recv_ctxt *
|
|
|
|
svc_rdma_recv_ctxt_get(struct svcxprt_rdma *rdma)
|
|
|
|
{
|
|
|
|
struct svc_rdma_recv_ctxt *ctxt;
|
2019-08-17 05:49:38 +08:00
|
|
|
struct llist_node *node;
|
2018-05-08 03:27:21 +08:00
|
|
|
|
2019-08-17 05:49:38 +08:00
|
|
|
node = llist_del_first(&rdma->sc_recv_ctxts);
|
|
|
|
if (!node)
|
2018-05-08 03:27:21 +08:00
|
|
|
goto out_empty;
|
2019-08-17 05:49:38 +08:00
|
|
|
ctxt = llist_entry(node, struct svc_rdma_recv_ctxt, rc_node);
|
2018-05-08 03:27:21 +08:00
|
|
|
|
|
|
|
out:
|
|
|
|
ctxt->rc_page_count = 0;
|
|
|
|
return ctxt;
|
|
|
|
|
|
|
|
out_empty:
|
2018-05-08 03:27:43 +08:00
|
|
|
ctxt = svc_rdma_recv_ctxt_alloc(rdma);
|
2018-05-08 03:27:21 +08:00
|
|
|
if (!ctxt)
|
|
|
|
return NULL;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* svc_rdma_recv_ctxt_put - Return recv_ctxt to free list
|
|
|
|
* @rdma: controlling svcxprt_rdma
|
|
|
|
* @ctxt: object to return to the free list
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
void svc_rdma_recv_ctxt_put(struct svcxprt_rdma *rdma,
|
2018-05-08 03:27:32 +08:00
|
|
|
struct svc_rdma_recv_ctxt *ctxt)
|
2018-05-08 03:27:21 +08:00
|
|
|
{
|
|
|
|
unsigned int i;
|
|
|
|
|
2018-05-08 03:27:32 +08:00
|
|
|
for (i = 0; i < ctxt->rc_page_count; i++)
|
|
|
|
put_page(ctxt->rc_pages[i]);
|
2018-05-08 03:27:48 +08:00
|
|
|
|
2019-08-17 05:49:38 +08:00
|
|
|
if (!ctxt->rc_temp)
|
|
|
|
llist_add(&ctxt->rc_node, &rdma->sc_recv_ctxts);
|
|
|
|
else
|
2018-05-08 03:27:48 +08:00
|
|
|
svc_rdma_recv_ctxt_destroy(rdma, ctxt);
|
2018-05-08 03:27:21 +08:00
|
|
|
}
|
|
|
|
|
2018-05-08 03:27:48 +08:00
|
|
|
static int __svc_rdma_post_recv(struct svcxprt_rdma *rdma,
|
|
|
|
struct svc_rdma_recv_ctxt *ctxt)
|
2018-05-08 03:27:21 +08:00
|
|
|
{
|
2018-05-08 03:27:43 +08:00
|
|
|
int ret;
|
2018-05-08 03:27:21 +08:00
|
|
|
|
|
|
|
svc_xprt_get(&rdma->sc_xprt);
|
2018-07-19 00:25:31 +08:00
|
|
|
ret = ib_post_recv(rdma->sc_qp, &ctxt->rc_recv_wr, NULL);
|
2018-05-08 03:27:21 +08:00
|
|
|
trace_svcrdma_post_recv(&ctxt->rc_recv_wr, ret);
|
|
|
|
if (ret)
|
|
|
|
goto err_post;
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
err_post:
|
2018-05-08 03:27:32 +08:00
|
|
|
svc_rdma_recv_ctxt_put(rdma, ctxt);
|
2018-05-08 03:27:21 +08:00
|
|
|
svc_xprt_put(&rdma->sc_xprt);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2018-05-08 03:27:48 +08:00
|
|
|
static int svc_rdma_post_recv(struct svcxprt_rdma *rdma)
|
|
|
|
{
|
|
|
|
struct svc_rdma_recv_ctxt *ctxt;
|
|
|
|
|
|
|
|
ctxt = svc_rdma_recv_ctxt_get(rdma);
|
|
|
|
if (!ctxt)
|
|
|
|
return -ENOMEM;
|
|
|
|
return __svc_rdma_post_recv(rdma, ctxt);
|
|
|
|
}
|
|
|
|
|
2018-05-08 03:27:21 +08:00
|
|
|
/**
|
|
|
|
* svc_rdma_post_recvs - Post initial set of Recv WRs
|
|
|
|
* @rdma: fresh svcxprt_rdma
|
|
|
|
*
|
|
|
|
* Returns true if successful, otherwise false.
|
|
|
|
*/
|
|
|
|
bool svc_rdma_post_recvs(struct svcxprt_rdma *rdma)
|
|
|
|
{
|
2018-05-08 03:27:48 +08:00
|
|
|
struct svc_rdma_recv_ctxt *ctxt;
|
2018-05-08 03:27:21 +08:00
|
|
|
unsigned int i;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
for (i = 0; i < rdma->sc_max_requests; i++) {
|
2018-05-08 03:27:48 +08:00
|
|
|
ctxt = svc_rdma_recv_ctxt_get(rdma);
|
|
|
|
if (!ctxt)
|
2018-05-15 01:20:06 +08:00
|
|
|
return false;
|
2018-05-08 03:27:48 +08:00
|
|
|
ctxt->rc_temp = true;
|
|
|
|
ret = __svc_rdma_post_recv(rdma, ctxt);
|
2019-02-07 01:00:57 +08:00
|
|
|
if (ret)
|
2018-05-08 03:27:21 +08:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* svc_rdma_wc_receive - Invoked by RDMA provider for each polled Receive WC
|
|
|
|
* @cq: Completion Queue context
|
|
|
|
* @wc: Work Completion object
|
|
|
|
*
|
|
|
|
* NB: The svc_xprt/svcxprt_rdma is pinned whenever it's possible that
|
|
|
|
* the Receive completion handler could be running.
|
|
|
|
*/
|
|
|
|
static void svc_rdma_wc_receive(struct ib_cq *cq, struct ib_wc *wc)
|
|
|
|
{
|
|
|
|
struct svcxprt_rdma *rdma = cq->cq_context;
|
|
|
|
struct ib_cqe *cqe = wc->wr_cqe;
|
|
|
|
struct svc_rdma_recv_ctxt *ctxt;
|
|
|
|
|
|
|
|
trace_svcrdma_wc_receive(wc);
|
|
|
|
|
|
|
|
/* WARNING: Only wc->wr_cqe and wc->status are reliable */
|
|
|
|
ctxt = container_of(cqe, struct svc_rdma_recv_ctxt, rc_cqe);
|
|
|
|
|
|
|
|
if (wc->status != IB_WC_SUCCESS)
|
|
|
|
goto flushed;
|
|
|
|
|
|
|
|
if (svc_rdma_post_recv(rdma))
|
|
|
|
goto post_err;
|
|
|
|
|
|
|
|
/* All wc fields are now known to be valid */
|
|
|
|
ctxt->rc_byte_len = wc->byte_len;
|
2018-05-08 03:27:43 +08:00
|
|
|
ib_dma_sync_single_for_cpu(rdma->sc_pd->device,
|
|
|
|
ctxt->rc_recv_sge.addr,
|
|
|
|
wc->byte_len, DMA_FROM_DEVICE);
|
|
|
|
|
2018-05-08 03:27:21 +08:00
|
|
|
spin_lock(&rdma->sc_rq_dto_lock);
|
|
|
|
list_add_tail(&ctxt->rc_list, &rdma->sc_rq_dto_q);
|
svcrpc: fix unlikely races preventing queueing of sockets
In the rpc server, When something happens that might be reason to wake
up a thread to do something, what we do is
- modify xpt_flags, sk_sock->flags, xpt_reserved, or
xpt_nr_rqsts to indicate the new situation
- call svc_xprt_enqueue() to decide whether to wake up a thread.
svc_xprt_enqueue may require multiple conditions to be true before
queueing up a thread to handle the xprt. In the SMP case, one of the
other CPU's may have set another required condition, and in that case,
although both CPUs run svc_xprt_enqueue(), it's possible that neither
call sees the writes done by the other CPU in time, and neither one
recognizes that all the required conditions have been set. A socket
could therefore be ignored indefinitely.
Add memory barries to ensure that any svc_xprt_enqueue() call will
always see the conditions changed by other CPUs before deciding to
ignore a socket.
I've never seen this race reported. In the unlikely event it happens,
another event will usually come along and the problem will fix itself.
So I don't think this is worth backporting to stable.
Chuck tried this patch and said "I don't see any performance
regressions, but my server has only a single last-level CPU cache."
Tested-by: Chuck Lever <chuck.lever@oracle.com>
Signed-off-by: J. Bruce Fields <bfields@redhat.com>
2019-01-12 04:36:40 +08:00
|
|
|
/* Note the unlock pairs with the smp_rmb in svc_xprt_ready: */
|
2018-05-08 03:27:21 +08:00
|
|
|
set_bit(XPT_DATA, &rdma->sc_xprt.xpt_flags);
|
svcrpc: fix unlikely races preventing queueing of sockets
In the rpc server, When something happens that might be reason to wake
up a thread to do something, what we do is
- modify xpt_flags, sk_sock->flags, xpt_reserved, or
xpt_nr_rqsts to indicate the new situation
- call svc_xprt_enqueue() to decide whether to wake up a thread.
svc_xprt_enqueue may require multiple conditions to be true before
queueing up a thread to handle the xprt. In the SMP case, one of the
other CPU's may have set another required condition, and in that case,
although both CPUs run svc_xprt_enqueue(), it's possible that neither
call sees the writes done by the other CPU in time, and neither one
recognizes that all the required conditions have been set. A socket
could therefore be ignored indefinitely.
Add memory barries to ensure that any svc_xprt_enqueue() call will
always see the conditions changed by other CPUs before deciding to
ignore a socket.
I've never seen this race reported. In the unlikely event it happens,
another event will usually come along and the problem will fix itself.
So I don't think this is worth backporting to stable.
Chuck tried this patch and said "I don't see any performance
regressions, but my server has only a single last-level CPU cache."
Tested-by: Chuck Lever <chuck.lever@oracle.com>
Signed-off-by: J. Bruce Fields <bfields@redhat.com>
2019-01-12 04:36:40 +08:00
|
|
|
spin_unlock(&rdma->sc_rq_dto_lock);
|
2018-05-08 03:27:21 +08:00
|
|
|
if (!test_bit(RDMAXPRT_CONN_PENDING, &rdma->sc_flags))
|
|
|
|
svc_xprt_enqueue(&rdma->sc_xprt);
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
flushed:
|
|
|
|
post_err:
|
2018-05-08 03:27:32 +08:00
|
|
|
svc_rdma_recv_ctxt_put(rdma, ctxt);
|
2018-05-08 03:27:21 +08:00
|
|
|
set_bit(XPT_CLOSE, &rdma->sc_xprt.xpt_flags);
|
|
|
|
svc_xprt_enqueue(&rdma->sc_xprt);
|
|
|
|
out:
|
|
|
|
svc_xprt_put(&rdma->sc_xprt);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* svc_rdma_flush_recv_queues - Drain pending Receive work
|
|
|
|
* @rdma: svcxprt_rdma being shut down
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
void svc_rdma_flush_recv_queues(struct svcxprt_rdma *rdma)
|
|
|
|
{
|
|
|
|
struct svc_rdma_recv_ctxt *ctxt;
|
|
|
|
|
|
|
|
while ((ctxt = svc_rdma_next_recv_ctxt(&rdma->sc_read_complete_q))) {
|
|
|
|
list_del(&ctxt->rc_list);
|
2018-05-08 03:27:32 +08:00
|
|
|
svc_rdma_recv_ctxt_put(rdma, ctxt);
|
2018-05-08 03:27:21 +08:00
|
|
|
}
|
|
|
|
while ((ctxt = svc_rdma_next_recv_ctxt(&rdma->sc_rq_dto_q))) {
|
|
|
|
list_del(&ctxt->rc_list);
|
2018-05-08 03:27:32 +08:00
|
|
|
svc_rdma_recv_ctxt_put(rdma, ctxt);
|
2018-05-08 03:27:21 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-03-21 05:05:20 +08:00
|
|
|
static void svc_rdma_build_arg_xdr(struct svc_rqst *rqstp,
|
2018-05-08 03:27:21 +08:00
|
|
|
struct svc_rdma_recv_ctxt *ctxt)
|
2007-12-13 06:13:23 +08:00
|
|
|
{
|
2018-05-08 03:27:43 +08:00
|
|
|
struct xdr_buf *arg = &rqstp->rq_arg;
|
|
|
|
|
|
|
|
arg->head[0].iov_base = ctxt->rc_recv_buf;
|
|
|
|
arg->head[0].iov_len = ctxt->rc_byte_len;
|
|
|
|
arg->tail[0].iov_base = NULL;
|
|
|
|
arg->tail[0].iov_len = 0;
|
|
|
|
arg->page_len = 0;
|
|
|
|
arg->page_base = 0;
|
|
|
|
arg->buflen = ctxt->rc_byte_len;
|
|
|
|
arg->len = ctxt->rc_byte_len;
|
2007-12-13 06:13:23 +08:00
|
|
|
}
|
|
|
|
|
2017-06-24 05:17:52 +08:00
|
|
|
/* This accommodates the largest possible Write chunk,
|
|
|
|
* in one segment.
|
|
|
|
*/
|
|
|
|
#define MAX_BYTES_WRITE_SEG ((u32)(RPCSVC_MAXPAGES << PAGE_SHIFT))
|
|
|
|
|
2017-06-24 05:17:44 +08:00
|
|
|
/* This accommodates the largest possible Position-Zero
|
|
|
|
* Read chunk or Reply chunk, in one segment.
|
|
|
|
*/
|
|
|
|
#define MAX_BYTES_SPECIAL_SEG ((u32)((RPCSVC_MAXPAGES + 2) << PAGE_SHIFT))
|
|
|
|
|
|
|
|
/* Sanity check the Read list.
|
|
|
|
*
|
|
|
|
* Implementation limits:
|
|
|
|
* - This implementation supports only one Read chunk.
|
|
|
|
*
|
|
|
|
* Sanity checks:
|
|
|
|
* - Read list does not overflow buffer.
|
|
|
|
* - Segment size limited by largest NFS data payload.
|
|
|
|
*
|
|
|
|
* The segment count is limited to how many segments can
|
|
|
|
* fit in the transport header without overflowing the
|
|
|
|
* buffer. That's about 40 Read segments for a 1KB inline
|
|
|
|
* threshold.
|
|
|
|
*
|
|
|
|
* Returns pointer to the following Write list.
|
|
|
|
*/
|
|
|
|
static __be32 *xdr_check_read_list(__be32 *p, const __be32 *end)
|
2017-06-24 05:17:35 +08:00
|
|
|
{
|
2017-06-24 05:17:44 +08:00
|
|
|
u32 position;
|
|
|
|
bool first;
|
2017-06-24 05:17:35 +08:00
|
|
|
|
2017-06-24 05:17:44 +08:00
|
|
|
first = true;
|
2017-06-24 05:17:35 +08:00
|
|
|
while (*p++ != xdr_zero) {
|
2017-06-24 05:17:44 +08:00
|
|
|
if (first) {
|
|
|
|
position = be32_to_cpup(p++);
|
|
|
|
first = false;
|
|
|
|
} else if (be32_to_cpup(p++) != position) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
p++; /* handle */
|
|
|
|
if (be32_to_cpup(p++) > MAX_BYTES_SPECIAL_SEG)
|
|
|
|
return NULL;
|
|
|
|
p += 2; /* offset */
|
|
|
|
|
|
|
|
if (p > end)
|
2017-06-24 05:17:35 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2017-06-24 05:17:52 +08:00
|
|
|
/* The segment count is limited to how many segments can
|
|
|
|
* fit in the transport header without overflowing the
|
|
|
|
* buffer. That's about 60 Write segments for a 1KB inline
|
|
|
|
* threshold.
|
|
|
|
*/
|
|
|
|
static __be32 *xdr_check_write_chunk(__be32 *p, const __be32 *end,
|
|
|
|
u32 maxlen)
|
2017-06-24 05:17:35 +08:00
|
|
|
{
|
2017-06-24 05:17:52 +08:00
|
|
|
u32 i, segcount;
|
|
|
|
|
|
|
|
segcount = be32_to_cpup(p++);
|
|
|
|
for (i = 0; i < segcount; i++) {
|
|
|
|
p++; /* handle */
|
|
|
|
if (be32_to_cpup(p++) > maxlen)
|
|
|
|
return NULL;
|
|
|
|
p += 2; /* offset */
|
|
|
|
|
|
|
|
if (p > end)
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return p;
|
|
|
|
}
|
2017-06-24 05:17:35 +08:00
|
|
|
|
2017-06-24 05:17:52 +08:00
|
|
|
/* Sanity check the Write list.
|
|
|
|
*
|
|
|
|
* Implementation limits:
|
|
|
|
* - This implementation supports only one Write chunk.
|
|
|
|
*
|
|
|
|
* Sanity checks:
|
|
|
|
* - Write list does not overflow buffer.
|
|
|
|
* - Segment size limited by largest NFS data payload.
|
|
|
|
*
|
|
|
|
* Returns pointer to the following Reply chunk.
|
|
|
|
*/
|
|
|
|
static __be32 *xdr_check_write_list(__be32 *p, const __be32 *end)
|
|
|
|
{
|
|
|
|
u32 chcount;
|
|
|
|
|
|
|
|
chcount = 0;
|
2017-06-24 05:17:35 +08:00
|
|
|
while (*p++ != xdr_zero) {
|
2017-06-24 05:17:52 +08:00
|
|
|
p = xdr_check_write_chunk(p, end, MAX_BYTES_WRITE_SEG);
|
|
|
|
if (!p)
|
|
|
|
return NULL;
|
|
|
|
if (chcount++ > 1)
|
2017-06-24 05:17:35 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2017-06-24 05:18:00 +08:00
|
|
|
/* Sanity check the Reply chunk.
|
|
|
|
*
|
|
|
|
* Sanity checks:
|
|
|
|
* - Reply chunk does not overflow buffer.
|
|
|
|
* - Segment size limited by largest NFS data payload.
|
|
|
|
*
|
|
|
|
* Returns pointer to the following RPC header.
|
|
|
|
*/
|
|
|
|
static __be32 *xdr_check_reply_chunk(__be32 *p, const __be32 *end)
|
2017-06-24 05:17:35 +08:00
|
|
|
{
|
|
|
|
if (*p++ != xdr_zero) {
|
2017-06-24 05:18:00 +08:00
|
|
|
p = xdr_check_write_chunk(p, end, MAX_BYTES_SPECIAL_SEG);
|
|
|
|
if (!p)
|
2017-06-24 05:17:35 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2018-11-28 00:11:35 +08:00
|
|
|
/* RPC-over-RDMA Version One private extension: Remote Invalidation.
|
|
|
|
* Responder's choice: requester signals it can handle Send With
|
|
|
|
* Invalidate, and responder chooses one R_key to invalidate.
|
|
|
|
*
|
|
|
|
* If there is exactly one distinct R_key in the received transport
|
|
|
|
* header, set rc_inv_rkey to that R_key. Otherwise, set it to zero.
|
|
|
|
*
|
|
|
|
* Perform this operation while the received transport header is
|
|
|
|
* still in the CPU cache.
|
|
|
|
*/
|
|
|
|
static void svc_rdma_get_inv_rkey(struct svcxprt_rdma *rdma,
|
|
|
|
struct svc_rdma_recv_ctxt *ctxt)
|
|
|
|
{
|
|
|
|
__be32 inv_rkey, *p;
|
|
|
|
u32 i, segcount;
|
|
|
|
|
|
|
|
ctxt->rc_inv_rkey = 0;
|
|
|
|
|
|
|
|
if (!rdma->sc_snd_w_inv)
|
|
|
|
return;
|
|
|
|
|
|
|
|
inv_rkey = xdr_zero;
|
|
|
|
p = ctxt->rc_recv_buf;
|
|
|
|
p += rpcrdma_fixed_maxsz;
|
|
|
|
|
|
|
|
/* Read list */
|
|
|
|
while (*p++ != xdr_zero) {
|
|
|
|
p++; /* position */
|
|
|
|
if (inv_rkey == xdr_zero)
|
|
|
|
inv_rkey = *p;
|
|
|
|
else if (inv_rkey != *p)
|
|
|
|
return;
|
|
|
|
p += 4;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Write list */
|
|
|
|
while (*p++ != xdr_zero) {
|
|
|
|
segcount = be32_to_cpup(p++);
|
|
|
|
for (i = 0; i < segcount; i++) {
|
|
|
|
if (inv_rkey == xdr_zero)
|
|
|
|
inv_rkey = *p;
|
|
|
|
else if (inv_rkey != *p)
|
|
|
|
return;
|
|
|
|
p += 4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Reply chunk */
|
|
|
|
if (*p++ != xdr_zero) {
|
|
|
|
segcount = be32_to_cpup(p++);
|
|
|
|
for (i = 0; i < segcount; i++) {
|
|
|
|
if (inv_rkey == xdr_zero)
|
|
|
|
inv_rkey = *p;
|
|
|
|
else if (inv_rkey != *p)
|
|
|
|
return;
|
|
|
|
p += 4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ctxt->rc_inv_rkey = be32_to_cpu(inv_rkey);
|
|
|
|
}
|
|
|
|
|
2017-06-24 05:17:35 +08:00
|
|
|
/* On entry, xdr->head[0].iov_base points to first byte in the
|
|
|
|
* RPC-over-RDMA header.
|
|
|
|
*
|
|
|
|
* On successful exit, head[0] points to first byte past the
|
|
|
|
* RPC-over-RDMA header. For RDMA_MSG, this is the RPC message.
|
|
|
|
* The length of the RPC-over-RDMA header is returned.
|
|
|
|
*
|
|
|
|
* Assumptions:
|
|
|
|
* - The transport header is entirely contained in the head iovec.
|
|
|
|
*/
|
|
|
|
static int svc_rdma_xdr_decode_req(struct xdr_buf *rq_arg)
|
|
|
|
{
|
|
|
|
__be32 *p, *end, *rdma_argp;
|
|
|
|
unsigned int hdr_len;
|
|
|
|
|
|
|
|
/* Verify that there's enough bytes for header + something */
|
|
|
|
if (rq_arg->len <= RPCRDMA_HDRLEN_ERR)
|
|
|
|
goto out_short;
|
|
|
|
|
|
|
|
rdma_argp = rq_arg->head[0].iov_base;
|
|
|
|
if (*(rdma_argp + 1) != rpcrdma_version)
|
|
|
|
goto out_version;
|
|
|
|
|
|
|
|
switch (*(rdma_argp + 3)) {
|
|
|
|
case rdma_msg:
|
|
|
|
break;
|
|
|
|
case rdma_nomsg:
|
|
|
|
break;
|
|
|
|
|
|
|
|
case rdma_done:
|
|
|
|
goto out_drop;
|
|
|
|
|
|
|
|
case rdma_error:
|
|
|
|
goto out_drop;
|
|
|
|
|
|
|
|
default:
|
|
|
|
goto out_proc;
|
|
|
|
}
|
|
|
|
|
|
|
|
end = (__be32 *)((unsigned long)rdma_argp + rq_arg->len);
|
|
|
|
p = xdr_check_read_list(rdma_argp + 4, end);
|
|
|
|
if (!p)
|
|
|
|
goto out_inval;
|
|
|
|
p = xdr_check_write_list(p, end);
|
|
|
|
if (!p)
|
|
|
|
goto out_inval;
|
|
|
|
p = xdr_check_reply_chunk(p, end);
|
|
|
|
if (!p)
|
|
|
|
goto out_inval;
|
|
|
|
if (p > end)
|
|
|
|
goto out_inval;
|
|
|
|
|
|
|
|
rq_arg->head[0].iov_base = p;
|
|
|
|
hdr_len = (unsigned long)p - (unsigned long)rdma_argp;
|
|
|
|
rq_arg->head[0].iov_len -= hdr_len;
|
2017-06-24 05:18:41 +08:00
|
|
|
rq_arg->len -= hdr_len;
|
2018-05-08 03:27:11 +08:00
|
|
|
trace_svcrdma_decode_rqst(rdma_argp, hdr_len);
|
2017-06-24 05:17:35 +08:00
|
|
|
return hdr_len;
|
|
|
|
|
|
|
|
out_short:
|
2018-05-08 03:27:11 +08:00
|
|
|
trace_svcrdma_decode_short(rq_arg->len);
|
2017-06-24 05:17:35 +08:00
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
out_version:
|
2018-05-08 03:27:11 +08:00
|
|
|
trace_svcrdma_decode_badvers(rdma_argp);
|
2017-06-24 05:17:35 +08:00
|
|
|
return -EPROTONOSUPPORT;
|
|
|
|
|
|
|
|
out_drop:
|
2018-05-08 03:27:11 +08:00
|
|
|
trace_svcrdma_decode_drop(rdma_argp);
|
2017-06-24 05:17:35 +08:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
out_proc:
|
2018-05-08 03:27:11 +08:00
|
|
|
trace_svcrdma_decode_badproc(rdma_argp);
|
2017-06-24 05:17:35 +08:00
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
out_inval:
|
2018-05-08 03:27:11 +08:00
|
|
|
trace_svcrdma_decode_parse(rdma_argp);
|
2017-06-24 05:17:35 +08:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
2016-05-04 22:53:39 +08:00
|
|
|
static void rdma_read_complete(struct svc_rqst *rqstp,
|
2018-05-08 03:27:21 +08:00
|
|
|
struct svc_rdma_recv_ctxt *head)
|
2007-12-13 06:13:23 +08:00
|
|
|
{
|
|
|
|
int page_no;
|
|
|
|
|
2018-05-08 03:27:32 +08:00
|
|
|
/* Move Read chunk pages to rqstp so that they will be released
|
|
|
|
* when svc_process is done with them.
|
|
|
|
*/
|
2018-05-08 03:27:21 +08:00
|
|
|
for (page_no = 0; page_no < head->rc_page_count; page_no++) {
|
2007-12-13 06:13:23 +08:00
|
|
|
put_page(rqstp->rq_pages[page_no]);
|
2018-05-08 03:27:21 +08:00
|
|
|
rqstp->rq_pages[page_no] = head->rc_pages[page_no];
|
2007-12-13 06:13:23 +08:00
|
|
|
}
|
2018-05-08 03:27:32 +08:00
|
|
|
head->rc_page_count = 0;
|
2015-01-14 00:03:37 +08:00
|
|
|
|
2007-12-13 06:13:23 +08:00
|
|
|
/* Point rq_arg.pages past header */
|
2018-05-08 03:27:21 +08:00
|
|
|
rqstp->rq_arg.pages = &rqstp->rq_pages[head->rc_hdr_count];
|
|
|
|
rqstp->rq_arg.page_len = head->rc_arg.page_len;
|
2007-12-13 06:13:23 +08:00
|
|
|
|
|
|
|
/* rq_respages starts after the last arg page */
|
2015-10-12 22:53:39 +08:00
|
|
|
rqstp->rq_respages = &rqstp->rq_pages[page_no];
|
2014-03-26 04:14:57 +08:00
|
|
|
rqstp->rq_next_page = rqstp->rq_respages + 1;
|
2007-12-13 06:13:23 +08:00
|
|
|
|
|
|
|
/* Rebuild rq_arg head and tail. */
|
2018-05-08 03:27:21 +08:00
|
|
|
rqstp->rq_arg.head[0] = head->rc_arg.head[0];
|
|
|
|
rqstp->rq_arg.tail[0] = head->rc_arg.tail[0];
|
|
|
|
rqstp->rq_arg.len = head->rc_arg.len;
|
|
|
|
rqstp->rq_arg.buflen = head->rc_arg.buflen;
|
2007-12-13 06:13:23 +08:00
|
|
|
}
|
|
|
|
|
2017-04-10 01:06:33 +08:00
|
|
|
static void svc_rdma_send_error(struct svcxprt_rdma *xprt,
|
|
|
|
__be32 *rdma_argp, int status)
|
|
|
|
{
|
2018-05-08 03:28:04 +08:00
|
|
|
struct svc_rdma_send_ctxt *ctxt;
|
2017-04-10 01:06:33 +08:00
|
|
|
unsigned int length;
|
2018-05-08 03:28:25 +08:00
|
|
|
__be32 *p;
|
2017-04-10 01:06:33 +08:00
|
|
|
int ret;
|
|
|
|
|
2018-05-08 03:28:25 +08:00
|
|
|
ctxt = svc_rdma_send_ctxt_get(xprt);
|
|
|
|
if (!ctxt)
|
2017-04-10 01:06:33 +08:00
|
|
|
return;
|
|
|
|
|
2018-05-08 03:28:25 +08:00
|
|
|
p = ctxt->sc_xprt_buf;
|
2017-04-10 01:06:33 +08:00
|
|
|
*p++ = *rdma_argp;
|
|
|
|
*p++ = *(rdma_argp + 1);
|
|
|
|
*p++ = xprt->sc_fc_credits;
|
|
|
|
*p++ = rdma_error;
|
2018-05-08 03:27:11 +08:00
|
|
|
switch (status) {
|
|
|
|
case -EPROTONOSUPPORT:
|
2017-04-10 01:06:33 +08:00
|
|
|
*p++ = err_vers;
|
|
|
|
*p++ = rpcrdma_version;
|
|
|
|
*p++ = rpcrdma_version;
|
2018-05-08 03:27:11 +08:00
|
|
|
trace_svcrdma_err_vers(*rdma_argp);
|
|
|
|
break;
|
|
|
|
default:
|
2017-04-10 01:06:33 +08:00
|
|
|
*p++ = err_chunk;
|
2018-05-08 03:27:11 +08:00
|
|
|
trace_svcrdma_err_chunk(*rdma_argp);
|
2017-04-10 01:06:33 +08:00
|
|
|
}
|
2018-05-08 03:28:25 +08:00
|
|
|
length = (unsigned long)p - (unsigned long)ctxt->sc_xprt_buf;
|
|
|
|
svc_rdma_sync_reply_hdr(xprt, ctxt, length);
|
2017-04-10 01:06:33 +08:00
|
|
|
|
2018-05-08 03:28:15 +08:00
|
|
|
ctxt->sc_send_wr.opcode = IB_WR_SEND;
|
|
|
|
ret = svc_rdma_send(xprt, &ctxt->sc_send_wr);
|
2018-05-08 03:28:04 +08:00
|
|
|
if (ret)
|
|
|
|
svc_rdma_send_ctxt_put(xprt, ctxt);
|
2017-04-10 01:06:33 +08:00
|
|
|
}
|
|
|
|
|
2016-01-08 03:50:10 +08:00
|
|
|
/* By convention, backchannel calls arrive via rdma_msg type
|
|
|
|
* messages, and never populate the chunk lists. This makes
|
|
|
|
* the RPC/RDMA header small and fixed in size, so it is
|
|
|
|
* straightforward to check the RPC header's direction field.
|
|
|
|
*/
|
2017-04-10 01:06:49 +08:00
|
|
|
static bool svc_rdma_is_backchannel_reply(struct svc_xprt *xprt,
|
|
|
|
__be32 *rdma_resp)
|
2016-01-08 03:50:10 +08:00
|
|
|
{
|
2017-04-10 01:06:49 +08:00
|
|
|
__be32 *p;
|
2016-01-08 03:50:10 +08:00
|
|
|
|
|
|
|
if (!xprt->xpt_bc_xprt)
|
|
|
|
return false;
|
|
|
|
|
2017-04-10 01:06:49 +08:00
|
|
|
p = rdma_resp + 3;
|
|
|
|
if (*p++ != rdma_msg)
|
2016-01-08 03:50:10 +08:00
|
|
|
return false;
|
2017-04-10 01:06:49 +08:00
|
|
|
|
|
|
|
if (*p++ != xdr_zero)
|
2016-01-08 03:50:10 +08:00
|
|
|
return false;
|
2017-04-10 01:06:49 +08:00
|
|
|
if (*p++ != xdr_zero)
|
2016-01-08 03:50:10 +08:00
|
|
|
return false;
|
2017-04-10 01:06:49 +08:00
|
|
|
if (*p++ != xdr_zero)
|
2016-01-08 03:50:10 +08:00
|
|
|
return false;
|
|
|
|
|
2017-04-10 01:06:49 +08:00
|
|
|
/* XID sanity */
|
|
|
|
if (*p++ != *rdma_resp)
|
2016-01-08 03:50:10 +08:00
|
|
|
return false;
|
|
|
|
/* call direction */
|
2017-04-10 01:06:49 +08:00
|
|
|
if (*p == cpu_to_be32(RPC_CALL))
|
2016-01-08 03:50:10 +08:00
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2017-06-24 05:18:33 +08:00
|
|
|
/**
|
|
|
|
* svc_rdma_recvfrom - Receive an RPC call
|
|
|
|
* @rqstp: request structure into which to receive an RPC Call
|
|
|
|
*
|
|
|
|
* Returns:
|
|
|
|
* The positive number of bytes in the RPC Call message,
|
|
|
|
* %0 if there were no Calls ready to return,
|
|
|
|
* %-EINVAL if the Read chunk data is too large,
|
|
|
|
* %-ENOMEM if rdma_rw context pool was exhausted,
|
|
|
|
* %-ENOTCONN if posting failed (connection is lost),
|
|
|
|
* %-EIO if rdma_rw initialization failed (DMA mapping, etc).
|
|
|
|
*
|
|
|
|
* Called in a loop when XPT_DATA is set. XPT_DATA is cleared only
|
|
|
|
* when there are no remaining ctxt's to process.
|
|
|
|
*
|
|
|
|
* The next ctxt is removed from the "receive" lists.
|
|
|
|
*
|
|
|
|
* - If the ctxt completes a Read, then finish assembling the Call
|
|
|
|
* message and return the number of bytes in the message.
|
|
|
|
*
|
|
|
|
* - If the ctxt completes a Receive, then construct the Call
|
|
|
|
* message from the contents of the Receive buffer.
|
|
|
|
*
|
|
|
|
* - If there are no Read chunks in this message, then finish
|
|
|
|
* assembling the Call message and return the number of bytes
|
|
|
|
* in the message.
|
|
|
|
*
|
|
|
|
* - If there are Read chunks in this message, post Read WRs to
|
|
|
|
* pull that payload and return 0.
|
2007-12-13 06:13:23 +08:00
|
|
|
*/
|
|
|
|
int svc_rdma_recvfrom(struct svc_rqst *rqstp)
|
|
|
|
{
|
|
|
|
struct svc_xprt *xprt = rqstp->rq_xprt;
|
|
|
|
struct svcxprt_rdma *rdma_xprt =
|
|
|
|
container_of(xprt, struct svcxprt_rdma, sc_xprt);
|
2018-05-08 03:27:21 +08:00
|
|
|
struct svc_rdma_recv_ctxt *ctxt;
|
2017-06-24 05:18:33 +08:00
|
|
|
__be32 *p;
|
2017-06-24 05:18:08 +08:00
|
|
|
int ret;
|
2007-12-13 06:13:23 +08:00
|
|
|
|
2017-02-08 00:59:04 +08:00
|
|
|
spin_lock(&rdma_xprt->sc_rq_dto_lock);
|
2018-05-08 03:27:21 +08:00
|
|
|
ctxt = svc_rdma_next_recv_ctxt(&rdma_xprt->sc_read_complete_q);
|
|
|
|
if (ctxt) {
|
|
|
|
list_del(&ctxt->rc_list);
|
2017-02-08 00:59:04 +08:00
|
|
|
spin_unlock(&rdma_xprt->sc_rq_dto_lock);
|
2016-05-04 22:53:39 +08:00
|
|
|
rdma_read_complete(rqstp, ctxt);
|
|
|
|
goto complete;
|
2018-05-08 03:27:21 +08:00
|
|
|
}
|
|
|
|
ctxt = svc_rdma_next_recv_ctxt(&rdma_xprt->sc_rq_dto_q);
|
|
|
|
if (!ctxt) {
|
2017-06-24 05:18:08 +08:00
|
|
|
/* No new incoming requests, terminate the loop */
|
2007-12-13 06:13:23 +08:00
|
|
|
clear_bit(XPT_DATA, &xprt->xpt_flags);
|
2017-06-24 05:18:08 +08:00
|
|
|
spin_unlock(&rdma_xprt->sc_rq_dto_lock);
|
|
|
|
return 0;
|
2007-12-13 06:13:23 +08:00
|
|
|
}
|
2018-05-08 03:27:21 +08:00
|
|
|
list_del(&ctxt->rc_list);
|
2017-02-08 00:59:04 +08:00
|
|
|
spin_unlock(&rdma_xprt->sc_rq_dto_lock);
|
2017-06-24 05:18:08 +08:00
|
|
|
|
2007-12-13 06:13:23 +08:00
|
|
|
atomic_inc(&rdma_stat_recv);
|
|
|
|
|
2018-03-21 05:05:20 +08:00
|
|
|
svc_rdma_build_arg_xdr(rqstp, ctxt);
|
2007-12-13 06:13:23 +08:00
|
|
|
|
2018-07-27 23:18:54 +08:00
|
|
|
/* Prevent svc_xprt_release from releasing pages in rq_pages
|
|
|
|
* if we return 0 or an error.
|
|
|
|
*/
|
|
|
|
rqstp->rq_respages = rqstp->rq_pages;
|
|
|
|
rqstp->rq_next_page = rqstp->rq_respages;
|
|
|
|
|
2017-06-24 05:18:33 +08:00
|
|
|
p = (__be32 *)rqstp->rq_arg.head[0].iov_base;
|
2016-05-04 22:53:47 +08:00
|
|
|
ret = svc_rdma_xdr_decode_req(&rqstp->rq_arg);
|
2016-03-02 02:06:38 +08:00
|
|
|
if (ret < 0)
|
|
|
|
goto out_err;
|
2016-03-02 02:06:56 +08:00
|
|
|
if (ret == 0)
|
|
|
|
goto out_drop;
|
2016-03-02 02:06:38 +08:00
|
|
|
rqstp->rq_xprt_hlen = ret;
|
2007-12-13 06:13:23 +08:00
|
|
|
|
2017-06-24 05:18:33 +08:00
|
|
|
if (svc_rdma_is_backchannel_reply(xprt, p)) {
|
|
|
|
ret = svc_rdma_handle_bc_reply(xprt->xpt_bc_xprt, p,
|
2016-01-08 03:50:10 +08:00
|
|
|
&rqstp->rq_arg);
|
2018-05-08 03:27:32 +08:00
|
|
|
svc_rdma_recv_ctxt_put(rdma_xprt, ctxt);
|
2016-01-08 03:50:10 +08:00
|
|
|
return ret;
|
|
|
|
}
|
2018-11-28 00:11:35 +08:00
|
|
|
svc_rdma_get_inv_rkey(rdma_xprt, ctxt);
|
2016-01-08 03:50:10 +08:00
|
|
|
|
2017-06-24 05:18:33 +08:00
|
|
|
p += rpcrdma_fixed_maxsz;
|
|
|
|
if (*p != xdr_zero)
|
|
|
|
goto out_readchunk;
|
2007-12-13 06:13:23 +08:00
|
|
|
|
2016-05-04 22:53:39 +08:00
|
|
|
complete:
|
2018-05-08 03:27:37 +08:00
|
|
|
rqstp->rq_xprt_ctxt = ctxt;
|
2007-12-13 06:13:23 +08:00
|
|
|
rqstp->rq_prot = IPPROTO_MAX;
|
|
|
|
svc_xprt_copy_addrs(rqstp, xprt);
|
2017-06-24 05:18:41 +08:00
|
|
|
return rqstp->rq_arg.len;
|
2007-12-13 06:13:23 +08:00
|
|
|
|
2017-06-24 05:18:33 +08:00
|
|
|
out_readchunk:
|
|
|
|
ret = svc_rdma_recv_read_chunk(rdma_xprt, rqstp, ctxt, p);
|
|
|
|
if (ret < 0)
|
|
|
|
goto out_postfail;
|
|
|
|
return 0;
|
|
|
|
|
2016-03-02 02:06:38 +08:00
|
|
|
out_err:
|
2017-06-24 05:18:33 +08:00
|
|
|
svc_rdma_send_error(rdma_xprt, p, ret);
|
2018-05-08 03:27:32 +08:00
|
|
|
svc_rdma_recv_ctxt_put(rdma_xprt, ctxt);
|
2016-03-02 02:06:38 +08:00
|
|
|
return 0;
|
|
|
|
|
2017-06-24 05:18:33 +08:00
|
|
|
out_postfail:
|
|
|
|
if (ret == -EINVAL)
|
|
|
|
svc_rdma_send_error(rdma_xprt, p, ret);
|
2018-05-08 03:27:32 +08:00
|
|
|
svc_rdma_recv_ctxt_put(rdma_xprt, ctxt);
|
2017-06-24 05:18:33 +08:00
|
|
|
return ret;
|
2016-01-08 03:50:10 +08:00
|
|
|
|
2016-03-02 02:06:56 +08:00
|
|
|
out_drop:
|
2018-05-08 03:27:32 +08:00
|
|
|
svc_rdma_recv_ctxt_put(rdma_xprt, ctxt);
|
2018-01-04 04:42:18 +08:00
|
|
|
return 0;
|
2007-12-13 06:13:23 +08:00
|
|
|
}
|