diff options
Diffstat (limited to 'src/spdk/lib/rdma/rdma_verbs.c')
| -rw-r--r-- | src/spdk/lib/rdma/rdma_verbs.c | 167 |
1 files changed, 167 insertions, 0 deletions
diff --git a/src/spdk/lib/rdma/rdma_verbs.c b/src/spdk/lib/rdma/rdma_verbs.c new file mode 100644 index 000000000..66be5bf60 --- /dev/null +++ b/src/spdk/lib/rdma/rdma_verbs.c @@ -0,0 +1,167 @@ +/*- + * BSD LICENSE + * + * Copyright (c) Intel Corporation. All rights reserved. + * Copyright (c) Mellanox Technologies LTD. All rights reserved. + * + * 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 Intel Corporation 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. + */ + +#include <rdma/rdma_cma.h> + +#include "spdk/stdinc.h" +#include "spdk/string.h" +#include "spdk/likely.h" + +#include "spdk_internal/rdma.h" +#include "spdk_internal/log.h" + +struct spdk_rdma_qp * +spdk_rdma_qp_create(struct rdma_cm_id *cm_id, struct spdk_rdma_qp_init_attr *qp_attr) +{ + struct spdk_rdma_qp *spdk_rdma_qp; + int rc; + struct ibv_qp_init_attr attr = { + .qp_context = qp_attr->qp_context, + .send_cq = qp_attr->send_cq, + .recv_cq = qp_attr->recv_cq, + .srq = qp_attr->srq, + .cap = qp_attr->cap, + .qp_type = IBV_QPT_RC + }; + + spdk_rdma_qp = calloc(1, sizeof(*spdk_rdma_qp)); + if (!spdk_rdma_qp) { + SPDK_ERRLOG("qp memory allocation failed\n"); + return NULL; + } + + rc = rdma_create_qp(cm_id, qp_attr->pd, &attr); + if (rc) { + SPDK_ERRLOG("Failed to create qp, errno %s (%d)\n", spdk_strerror(errno), errno); + free(spdk_rdma_qp); + return NULL; + } + + qp_attr->cap = attr.cap; + spdk_rdma_qp->qp = cm_id->qp; + spdk_rdma_qp->cm_id = cm_id; + + return spdk_rdma_qp; +} + +int +spdk_rdma_qp_accept(struct spdk_rdma_qp *spdk_rdma_qp, struct rdma_conn_param *conn_param) +{ + assert(spdk_rdma_qp != NULL); + assert(spdk_rdma_qp->cm_id != NULL); + + return rdma_accept(spdk_rdma_qp->cm_id, conn_param); +} + +int +spdk_rdma_qp_complete_connect(struct spdk_rdma_qp *spdk_rdma_qp) +{ + /* Nothing to be done for Verbs */ + return 0; +} + +void +spdk_rdma_qp_destroy(struct spdk_rdma_qp *spdk_rdma_qp) +{ + assert(spdk_rdma_qp != NULL); + + if (spdk_rdma_qp->send_wrs.first != NULL) { + SPDK_WARNLOG("Destroying qpair with queued Work Requests\n"); + } + + if (spdk_rdma_qp->qp) { + rdma_destroy_qp(spdk_rdma_qp->cm_id); + } + + free(spdk_rdma_qp); +} + +int +spdk_rdma_qp_disconnect(struct spdk_rdma_qp *spdk_rdma_qp) +{ + int rc = 0; + + assert(spdk_rdma_qp != NULL); + + if (spdk_rdma_qp->cm_id) { + rc = rdma_disconnect(spdk_rdma_qp->cm_id); + if (rc) { + SPDK_ERRLOG("rdma_disconnect failed, errno %s (%d)\n", spdk_strerror(errno), errno); + } + } + + return rc; +} + +bool +spdk_rdma_qp_queue_send_wrs(struct spdk_rdma_qp *spdk_rdma_qp, struct ibv_send_wr *first) +{ + struct ibv_send_wr *last; + + assert(spdk_rdma_qp); + assert(first); + + last = first; + while (last->next != NULL) { + last = last->next; + } + + if (spdk_rdma_qp->send_wrs.first == NULL) { + spdk_rdma_qp->send_wrs.first = first; + spdk_rdma_qp->send_wrs.last = last; + return true; + } else { + spdk_rdma_qp->send_wrs.last->next = first; + spdk_rdma_qp->send_wrs.last = last; + return false; + } +} + +int +spdk_rdma_qp_flush_send_wrs(struct spdk_rdma_qp *spdk_rdma_qp, struct ibv_send_wr **bad_wr) +{ + int rc; + + assert(spdk_rdma_qp); + assert(bad_wr); + + if (spdk_unlikely(!spdk_rdma_qp->send_wrs.first)) { + return 0; + } + + rc = ibv_post_send(spdk_rdma_qp->qp, spdk_rdma_qp->send_wrs.first, bad_wr); + + spdk_rdma_qp->send_wrs.first = NULL; + + return rc; +} |