2009-02-24 08:30:30 -07:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2006 Oracle. 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
|
|
|
|
* OpenIB.org BSD 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.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
|
|
|
|
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
|
|
|
|
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
|
|
|
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
|
|
* SOFTWARE.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/in.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 02:04:11 -06:00
|
|
|
#include <linux/slab.h>
|
2009-02-24 08:30:30 -07:00
|
|
|
#include <linux/vmalloc.h>
|
2011-06-15 20:09:57 -06:00
|
|
|
#include <linux/ratelimit.h>
|
2009-02-24 08:30:30 -07:00
|
|
|
|
2016-06-13 10:44:26 -06:00
|
|
|
#include "rds_single_path.h"
|
2009-02-24 08:30:30 -07:00
|
|
|
#include "rds.h"
|
|
|
|
#include "ib.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set the selected protocol version
|
|
|
|
*/
|
|
|
|
static void rds_ib_set_protocol(struct rds_connection *conn, unsigned int version)
|
|
|
|
{
|
|
|
|
conn->c_version = version;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set up flow control
|
|
|
|
*/
|
|
|
|
static void rds_ib_set_flow_control(struct rds_connection *conn, u32 credits)
|
|
|
|
{
|
|
|
|
struct rds_ib_connection *ic = conn->c_transport_data;
|
|
|
|
|
|
|
|
if (rds_ib_sysctl_flow_control && credits != 0) {
|
|
|
|
/* We're doing flow control */
|
|
|
|
ic->i_flowctl = 1;
|
|
|
|
rds_ib_send_add_credits(conn, credits);
|
|
|
|
} else {
|
|
|
|
ic->i_flowctl = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Tune RNR behavior. Without flow control, we use a rather
|
|
|
|
* low timeout, but not the absolute minimum - this should
|
|
|
|
* be tunable.
|
|
|
|
*
|
|
|
|
* We already set the RNR retry count to 7 (which is the
|
|
|
|
* smallest infinite number :-) above.
|
|
|
|
* If flow control is off, we want to change this back to 0
|
|
|
|
* so that we learn quickly when our credit accounting is
|
|
|
|
* buggy.
|
|
|
|
*
|
|
|
|
* Caller passes in a qp_attr pointer - don't waste stack spacv
|
|
|
|
* by allocation this twice.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
rds_ib_tune_rnr(struct rds_ib_connection *ic, struct ib_qp_attr *attr)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
attr->min_rnr_timer = IB_RNR_TIMER_000_32;
|
|
|
|
ret = ib_modify_qp(ic->i_cm_id->qp, attr, IB_QP_MIN_RNR_TIMER);
|
|
|
|
if (ret)
|
|
|
|
printk(KERN_NOTICE "ib_modify_qp(IB_QP_MIN_RNR_TIMER): err=%d\n", -ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Connection established.
|
|
|
|
* We get here for both outgoing and incoming connection.
|
|
|
|
*/
|
|
|
|
void rds_ib_cm_connect_complete(struct rds_connection *conn, struct rdma_cm_event *event)
|
|
|
|
{
|
|
|
|
const struct rds_ib_connect_private *dp = NULL;
|
|
|
|
struct rds_ib_connection *ic = conn->c_transport_data;
|
|
|
|
struct ib_qp_attr qp_attr;
|
|
|
|
int err;
|
|
|
|
|
2009-07-17 07:13:23 -06:00
|
|
|
if (event->param.conn.private_data_len >= sizeof(*dp)) {
|
2009-02-24 08:30:30 -07:00
|
|
|
dp = event->param.conn.private_data;
|
|
|
|
|
2009-07-17 07:13:24 -06:00
|
|
|
/* make sure it isn't empty data */
|
|
|
|
if (dp->dp_protocol_major) {
|
|
|
|
rds_ib_set_protocol(conn,
|
2009-02-24 08:30:30 -07:00
|
|
|
RDS_PROTOCOL(dp->dp_protocol_major,
|
2009-07-17 07:13:24 -06:00
|
|
|
dp->dp_protocol_minor));
|
|
|
|
rds_ib_set_flow_control(conn, be32_to_cpu(dp->dp_credit));
|
|
|
|
}
|
2009-02-24 08:30:30 -07:00
|
|
|
}
|
|
|
|
|
2016-06-18 09:46:31 -06:00
|
|
|
if (conn->c_version < RDS_PROTOCOL(3, 1)) {
|
2016-03-14 08:43:55 -06:00
|
|
|
pr_notice("RDS/IB: Connection <%pI4,%pI4> version %u.%u no longer supported\n",
|
|
|
|
&conn->c_laddr, &conn->c_faddr,
|
|
|
|
RDS_PROTOCOL_MAJOR(conn->c_version),
|
|
|
|
RDS_PROTOCOL_MINOR(conn->c_version));
|
2018-02-03 05:26:51 -07:00
|
|
|
set_bit(RDS_DESTROY_PENDING, &conn->c_path[0].cp_flags);
|
2010-01-13 16:50:09 -07:00
|
|
|
rds_conn_destroy(conn);
|
|
|
|
return;
|
|
|
|
} else {
|
2016-07-09 19:31:38 -06:00
|
|
|
pr_notice("RDS/IB: %s conn connected <%pI4,%pI4> version %u.%u%s\n",
|
|
|
|
ic->i_active_side ? "Active" : "Passive",
|
2016-03-14 08:43:55 -06:00
|
|
|
&conn->c_laddr, &conn->c_faddr,
|
|
|
|
RDS_PROTOCOL_MAJOR(conn->c_version),
|
|
|
|
RDS_PROTOCOL_MINOR(conn->c_version),
|
|
|
|
ic->i_flowctl ? ", flow control" : "");
|
2010-01-13 16:50:09 -07:00
|
|
|
}
|
2009-02-24 08:30:30 -07:00
|
|
|
|
2016-09-29 12:07:11 -06:00
|
|
|
atomic_set(&ic->i_cq_quiesce, 0);
|
|
|
|
|
2016-07-09 19:31:38 -06:00
|
|
|
/* Init rings and fill recv. this needs to wait until protocol
|
|
|
|
* negotiation is complete, since ring layout is different
|
|
|
|
* from 3.1 to 4.1.
|
2009-07-17 07:13:29 -06:00
|
|
|
*/
|
|
|
|
rds_ib_send_init_ring(ic);
|
|
|
|
rds_ib_recv_init_ring(ic);
|
|
|
|
/* Post receive buffers - as a side effect, this will update
|
|
|
|
* the posted credit count. */
|
2015-08-22 16:45:26 -06:00
|
|
|
rds_ib_recv_refill(conn, 1, GFP_KERNEL);
|
2009-07-17 07:13:29 -06:00
|
|
|
|
2009-02-24 08:30:30 -07:00
|
|
|
/* Tune RNR behavior */
|
|
|
|
rds_ib_tune_rnr(ic, &qp_attr);
|
|
|
|
|
|
|
|
qp_attr.qp_state = IB_QPS_RTS;
|
|
|
|
err = ib_modify_qp(ic->i_cm_id->qp, &qp_attr, IB_QP_STATE);
|
|
|
|
if (err)
|
|
|
|
printk(KERN_NOTICE "ib_modify_qp(IB_QP_STATE, RTS): err=%d\n", err);
|
|
|
|
|
2010-05-18 16:48:51 -06:00
|
|
|
/* update ib_device with this local ipaddr */
|
|
|
|
err = rds_ib_update_ipaddr(ic->rds_ibdev, conn->c_laddr);
|
2009-02-24 08:30:30 -07:00
|
|
|
if (err)
|
2010-05-18 16:48:51 -06:00
|
|
|
printk(KERN_ERR "rds_ib_update_ipaddr failed (%d)\n",
|
|
|
|
err);
|
2009-02-24 08:30:30 -07:00
|
|
|
|
|
|
|
/* If the peer gave us the last packet it saw, process this as if
|
|
|
|
* we had received a regular ACK. */
|
2015-04-30 18:58:07 -06:00
|
|
|
if (dp) {
|
|
|
|
/* dp structure start is not guaranteed to be 8 bytes aligned.
|
|
|
|
* Since dp_ack_seq is 64-bit extended load operations can be
|
|
|
|
* used so go through get_unaligned to avoid unaligned errors.
|
|
|
|
*/
|
2015-05-04 09:51:38 -06:00
|
|
|
__be64 dp_ack_seq = get_unaligned(&dp->dp_ack_seq);
|
2015-04-30 18:58:07 -06:00
|
|
|
|
|
|
|
if (dp_ack_seq)
|
|
|
|
rds_send_drop_acked(conn, be64_to_cpu(dp_ack_seq),
|
|
|
|
NULL);
|
|
|
|
}
|
2009-02-24 08:30:30 -07:00
|
|
|
|
|
|
|
rds_connect_complete(conn);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void rds_ib_cm_fill_conn_param(struct rds_connection *conn,
|
|
|
|
struct rdma_conn_param *conn_param,
|
|
|
|
struct rds_ib_connect_private *dp,
|
2010-01-12 11:50:48 -07:00
|
|
|
u32 protocol_version,
|
|
|
|
u32 max_responder_resources,
|
|
|
|
u32 max_initiator_depth)
|
2009-02-24 08:30:30 -07:00
|
|
|
{
|
2010-01-12 11:50:48 -07:00
|
|
|
struct rds_ib_connection *ic = conn->c_transport_data;
|
2010-05-18 16:48:51 -06:00
|
|
|
struct rds_ib_device *rds_ibdev = ic->rds_ibdev;
|
2010-01-12 11:50:48 -07:00
|
|
|
|
2009-02-24 08:30:30 -07:00
|
|
|
memset(conn_param, 0, sizeof(struct rdma_conn_param));
|
2010-01-12 11:50:48 -07:00
|
|
|
|
|
|
|
conn_param->responder_resources =
|
|
|
|
min_t(u32, rds_ibdev->max_responder_resources, max_responder_resources);
|
|
|
|
conn_param->initiator_depth =
|
|
|
|
min_t(u32, rds_ibdev->max_initiator_depth, max_initiator_depth);
|
2009-07-17 07:13:22 -06:00
|
|
|
conn_param->retry_count = min_t(unsigned int, rds_ib_retry_count, 7);
|
2009-02-24 08:30:30 -07:00
|
|
|
conn_param->rnr_retry_count = 7;
|
|
|
|
|
|
|
|
if (dp) {
|
|
|
|
memset(dp, 0, sizeof(*dp));
|
|
|
|
dp->dp_saddr = conn->c_laddr;
|
|
|
|
dp->dp_daddr = conn->c_faddr;
|
|
|
|
dp->dp_protocol_major = RDS_PROTOCOL_MAJOR(protocol_version);
|
|
|
|
dp->dp_protocol_minor = RDS_PROTOCOL_MINOR(protocol_version);
|
|
|
|
dp->dp_protocol_minor_mask = cpu_to_be16(RDS_IB_SUPPORTED_PROTOCOLS);
|
2016-04-14 11:43:26 -06:00
|
|
|
dp->dp_ack_seq = cpu_to_be64(rds_ib_piggyb_ack(ic));
|
2009-02-24 08:30:30 -07:00
|
|
|
|
|
|
|
/* Advertise flow control */
|
|
|
|
if (ic->i_flowctl) {
|
|
|
|
unsigned int credits;
|
|
|
|
|
|
|
|
credits = IB_GET_POST_CREDITS(atomic_read(&ic->i_credits));
|
|
|
|
dp->dp_credit = cpu_to_be32(credits);
|
|
|
|
atomic_sub(IB_SET_POST_CREDITS(credits), &ic->i_credits);
|
|
|
|
}
|
|
|
|
|
|
|
|
conn_param->private_data = dp;
|
|
|
|
conn_param->private_data_len = sizeof(*dp);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void rds_ib_cq_event_handler(struct ib_event *event, void *data)
|
|
|
|
{
|
2010-07-14 15:01:21 -06:00
|
|
|
rdsdebug("event %u (%s) data %p\n",
|
2015-05-18 04:40:33 -06:00
|
|
|
event->event, ib_event_msg(event->event), data);
|
2009-02-24 08:30:30 -07:00
|
|
|
}
|
|
|
|
|
2015-09-06 00:18:51 -06:00
|
|
|
/* Plucking the oldest entry from the ring can be done concurrently with
|
|
|
|
* the thread refilling the ring. Each ring operation is protected by
|
|
|
|
* spinlocks and the transient state of refilling doesn't change the
|
|
|
|
* recording of which entry is oldest.
|
|
|
|
*
|
|
|
|
* This relies on IB only calling one cq comp_handler for each cq so that
|
|
|
|
* there will only be one caller of rds_recv_incoming() per RDS connection.
|
|
|
|
*/
|
|
|
|
static void rds_ib_cq_comp_handler_recv(struct ib_cq *cq, void *context)
|
|
|
|
{
|
|
|
|
struct rds_connection *conn = context;
|
|
|
|
struct rds_ib_connection *ic = conn->c_transport_data;
|
|
|
|
|
|
|
|
rdsdebug("conn %p cq %p\n", conn, cq);
|
|
|
|
|
|
|
|
rds_ib_stats_inc(s_ib_evt_handler_call);
|
|
|
|
|
|
|
|
tasklet_schedule(&ic->i_recv_tasklet);
|
|
|
|
}
|
|
|
|
|
2016-03-01 16:20:45 -07:00
|
|
|
static void poll_scq(struct rds_ib_connection *ic, struct ib_cq *cq,
|
|
|
|
struct ib_wc *wcs)
|
2015-09-06 00:18:51 -06:00
|
|
|
{
|
2016-03-01 16:20:45 -07:00
|
|
|
int nr, i;
|
2015-09-06 00:18:51 -06:00
|
|
|
struct ib_wc *wc;
|
|
|
|
|
|
|
|
while ((nr = ib_poll_cq(cq, RDS_IB_WC_MAX, wcs)) > 0) {
|
|
|
|
for (i = 0; i < nr; i++) {
|
|
|
|
wc = wcs + i;
|
|
|
|
rdsdebug("wc wr_id 0x%llx status %u byte_len %u imm_data %u\n",
|
|
|
|
(unsigned long long)wc->wr_id, wc->status,
|
|
|
|
wc->byte_len, be32_to_cpu(wc->ex.imm_data));
|
2015-09-06 00:18:51 -06:00
|
|
|
|
2016-03-01 16:20:54 -07:00
|
|
|
if (wc->wr_id <= ic->i_send_ring.w_nr ||
|
|
|
|
wc->wr_id == RDS_IB_ACK_WR_ID)
|
|
|
|
rds_ib_send_cqe_handler(ic, wc);
|
|
|
|
else
|
|
|
|
rds_ib_mr_cqe_handler(ic, wc);
|
|
|
|
|
2015-09-06 00:18:51 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-09-06 00:18:51 -06:00
|
|
|
static void rds_ib_tasklet_fn_send(unsigned long data)
|
|
|
|
{
|
|
|
|
struct rds_ib_connection *ic = (struct rds_ib_connection *)data;
|
|
|
|
struct rds_connection *conn = ic->conn;
|
|
|
|
|
|
|
|
rds_ib_stats_inc(s_ib_tasklet_call);
|
|
|
|
|
2016-09-29 12:07:11 -06:00
|
|
|
/* if cq has been already reaped, ignore incoming cq event */
|
|
|
|
if (atomic_read(&ic->i_cq_quiesce))
|
|
|
|
return;
|
|
|
|
|
2016-03-01 16:20:45 -07:00
|
|
|
poll_scq(ic, ic->i_send_cq, ic->i_send_wc);
|
2015-09-06 00:18:51 -06:00
|
|
|
ib_req_notify_cq(ic->i_send_cq, IB_CQ_NEXT_COMP);
|
2016-03-01 16:20:45 -07:00
|
|
|
poll_scq(ic, ic->i_send_cq, ic->i_send_wc);
|
2015-09-06 00:18:51 -06:00
|
|
|
|
|
|
|
if (rds_conn_up(conn) &&
|
|
|
|
(!test_bit(RDS_LL_SEND_FULL, &conn->c_flags) ||
|
|
|
|
test_bit(0, &conn->c_map_queued)))
|
2016-06-13 10:44:34 -06:00
|
|
|
rds_send_xmit(&ic->conn->c_path[0]);
|
2015-09-06 00:18:51 -06:00
|
|
|
}
|
|
|
|
|
2016-03-01 16:20:45 -07:00
|
|
|
static void poll_rcq(struct rds_ib_connection *ic, struct ib_cq *cq,
|
|
|
|
struct ib_wc *wcs,
|
|
|
|
struct rds_ib_ack_state *ack_state)
|
|
|
|
{
|
|
|
|
int nr, i;
|
|
|
|
struct ib_wc *wc;
|
|
|
|
|
|
|
|
while ((nr = ib_poll_cq(cq, RDS_IB_WC_MAX, wcs)) > 0) {
|
|
|
|
for (i = 0; i < nr; i++) {
|
|
|
|
wc = wcs + i;
|
|
|
|
rdsdebug("wc wr_id 0x%llx status %u byte_len %u imm_data %u\n",
|
|
|
|
(unsigned long long)wc->wr_id, wc->status,
|
|
|
|
wc->byte_len, be32_to_cpu(wc->ex.imm_data));
|
|
|
|
|
|
|
|
rds_ib_recv_cqe_handler(ic, wc, ack_state);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-09-06 00:18:51 -06:00
|
|
|
static void rds_ib_tasklet_fn_recv(unsigned long data)
|
|
|
|
{
|
|
|
|
struct rds_ib_connection *ic = (struct rds_ib_connection *)data;
|
|
|
|
struct rds_connection *conn = ic->conn;
|
|
|
|
struct rds_ib_device *rds_ibdev = ic->rds_ibdev;
|
|
|
|
struct rds_ib_ack_state state;
|
|
|
|
|
2015-09-19 12:01:09 -06:00
|
|
|
if (!rds_ibdev)
|
|
|
|
rds_conn_drop(conn);
|
2015-09-06 00:18:51 -06:00
|
|
|
|
|
|
|
rds_ib_stats_inc(s_ib_tasklet_call);
|
|
|
|
|
2016-09-29 12:07:11 -06:00
|
|
|
/* if cq has been already reaped, ignore incoming cq event */
|
|
|
|
if (atomic_read(&ic->i_cq_quiesce))
|
|
|
|
return;
|
|
|
|
|
2015-09-06 00:18:51 -06:00
|
|
|
memset(&state, 0, sizeof(state));
|
2016-03-01 16:20:45 -07:00
|
|
|
poll_rcq(ic, ic->i_recv_cq, ic->i_recv_wc, &state);
|
2015-09-06 00:18:51 -06:00
|
|
|
ib_req_notify_cq(ic->i_recv_cq, IB_CQ_SOLICITED);
|
2016-03-01 16:20:45 -07:00
|
|
|
poll_rcq(ic, ic->i_recv_cq, ic->i_recv_wc, &state);
|
2015-09-06 00:18:51 -06:00
|
|
|
|
|
|
|
if (state.ack_next_valid)
|
|
|
|
rds_ib_set_ack(ic, state.ack_next, state.ack_required);
|
|
|
|
if (state.ack_recv_valid && state.ack_recv > ic->i_ack_recv) {
|
|
|
|
rds_send_drop_acked(conn, state.ack_recv, NULL);
|
|
|
|
ic->i_ack_recv = state.ack_recv;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (rds_conn_up(conn))
|
|
|
|
rds_ib_attempt_ack(ic);
|
|
|
|
}
|
|
|
|
|
2009-02-24 08:30:30 -07:00
|
|
|
static void rds_ib_qp_event_handler(struct ib_event *event, void *data)
|
|
|
|
{
|
|
|
|
struct rds_connection *conn = data;
|
|
|
|
struct rds_ib_connection *ic = conn->c_transport_data;
|
|
|
|
|
2010-07-14 15:01:21 -06:00
|
|
|
rdsdebug("conn %p ic %p event %u (%s)\n", conn, ic, event->event,
|
2015-05-18 04:40:33 -06:00
|
|
|
ib_event_msg(event->event));
|
2009-02-24 08:30:30 -07:00
|
|
|
|
|
|
|
switch (event->event) {
|
|
|
|
case IB_EVENT_COMM_EST:
|
|
|
|
rdma_notify(ic->i_cm_id, IB_EVENT_COMM_EST);
|
|
|
|
break;
|
|
|
|
default:
|
2010-07-14 15:01:21 -06:00
|
|
|
rdsdebug("Fatal QP Event %u (%s) "
|
2009-07-17 07:13:31 -06:00
|
|
|
"- connection %pI4->%pI4, reconnecting\n",
|
2015-05-18 04:40:33 -06:00
|
|
|
event->event, ib_event_msg(event->event),
|
2010-07-14 15:01:21 -06:00
|
|
|
&conn->c_laddr, &conn->c_faddr);
|
2010-03-11 06:50:02 -07:00
|
|
|
rds_conn_drop(conn);
|
2009-02-24 08:30:30 -07:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-09-06 00:18:51 -06:00
|
|
|
static void rds_ib_cq_comp_handler_send(struct ib_cq *cq, void *context)
|
|
|
|
{
|
|
|
|
struct rds_connection *conn = context;
|
|
|
|
struct rds_ib_connection *ic = conn->c_transport_data;
|
|
|
|
|
|
|
|
rdsdebug("conn %p cq %p\n", conn, cq);
|
|
|
|
|
|
|
|
rds_ib_stats_inc(s_ib_evt_handler_call);
|
|
|
|
|
|
|
|
tasklet_schedule(&ic->i_send_tasklet);
|
|
|
|
}
|
|
|
|
|
2016-07-04 17:16:36 -06:00
|
|
|
static inline int ibdev_get_unused_vector(struct rds_ib_device *rds_ibdev)
|
|
|
|
{
|
|
|
|
int min = rds_ibdev->vector_load[rds_ibdev->dev->num_comp_vectors - 1];
|
|
|
|
int index = rds_ibdev->dev->num_comp_vectors - 1;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = rds_ibdev->dev->num_comp_vectors - 1; i >= 0; i--) {
|
|
|
|
if (rds_ibdev->vector_load[i] < min) {
|
|
|
|
index = i;
|
|
|
|
min = rds_ibdev->vector_load[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
rds_ibdev->vector_load[index]++;
|
|
|
|
return index;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void ibdev_put_vector(struct rds_ib_device *rds_ibdev, int index)
|
|
|
|
{
|
|
|
|
rds_ibdev->vector_load[index]--;
|
|
|
|
}
|
|
|
|
|
2009-02-24 08:30:30 -07:00
|
|
|
/*
|
|
|
|
* This needs to be very careful to not leave IS_ERR pointers around for
|
|
|
|
* cleanup to trip over.
|
|
|
|
*/
|
|
|
|
static int rds_ib_setup_qp(struct rds_connection *conn)
|
|
|
|
{
|
|
|
|
struct rds_ib_connection *ic = conn->c_transport_data;
|
|
|
|
struct ib_device *dev = ic->i_cm_id->device;
|
|
|
|
struct ib_qp_init_attr attr;
|
2015-06-11 07:35:21 -06:00
|
|
|
struct ib_cq_init_attr cq_attr = {};
|
2009-02-24 08:30:30 -07:00
|
|
|
struct rds_ib_device *rds_ibdev;
|
2016-03-01 16:20:53 -07:00
|
|
|
int ret, fr_queue_space;
|
2009-02-24 08:30:30 -07:00
|
|
|
|
2010-05-18 16:48:51 -06:00
|
|
|
/*
|
|
|
|
* It's normal to see a null device if an incoming connection races
|
|
|
|
* with device removal, so we don't print a warning.
|
2009-02-24 08:30:30 -07:00
|
|
|
*/
|
2010-05-18 16:48:51 -06:00
|
|
|
rds_ibdev = rds_ib_get_client_data(dev);
|
|
|
|
if (!rds_ibdev)
|
2009-02-24 08:30:30 -07:00
|
|
|
return -EOPNOTSUPP;
|
2010-05-18 16:48:51 -06:00
|
|
|
|
2016-03-01 16:20:53 -07:00
|
|
|
/* The fr_queue_space is currently set to 512, to add extra space on
|
|
|
|
* completion queue and send queue. This extra space is used for FRMR
|
|
|
|
* registration and invalidation work requests
|
|
|
|
*/
|
2016-03-08 10:19:01 -07:00
|
|
|
fr_queue_space = rds_ibdev->use_fastreg ?
|
|
|
|
(RDS_IB_DEFAULT_FR_WR + 1) +
|
|
|
|
(RDS_IB_DEFAULT_FR_INV_WR + 1)
|
|
|
|
: 0;
|
2016-03-01 16:20:53 -07:00
|
|
|
|
2010-05-18 16:48:51 -06:00
|
|
|
/* add the conn now so that connection establishment has the dev */
|
|
|
|
rds_ib_add_conn(rds_ibdev, conn);
|
2009-02-24 08:30:30 -07:00
|
|
|
|
|
|
|
if (rds_ibdev->max_wrs < ic->i_send_ring.w_nr + 1)
|
|
|
|
rds_ib_ring_resize(&ic->i_send_ring, rds_ibdev->max_wrs - 1);
|
|
|
|
if (rds_ibdev->max_wrs < ic->i_recv_ring.w_nr + 1)
|
|
|
|
rds_ib_ring_resize(&ic->i_recv_ring, rds_ibdev->max_wrs - 1);
|
|
|
|
|
|
|
|
/* Protection domain and memory range */
|
|
|
|
ic->i_pd = rds_ibdev->pd;
|
|
|
|
|
2016-07-04 17:16:36 -06:00
|
|
|
ic->i_scq_vector = ibdev_get_unused_vector(rds_ibdev);
|
2016-03-01 16:20:53 -07:00
|
|
|
cq_attr.cqe = ic->i_send_ring.w_nr + fr_queue_space + 1;
|
2016-07-04 17:16:36 -06:00
|
|
|
cq_attr.comp_vector = ic->i_scq_vector;
|
2015-09-06 00:18:51 -06:00
|
|
|
ic->i_send_cq = ib_create_cq(dev, rds_ib_cq_comp_handler_send,
|
2009-02-24 08:30:30 -07:00
|
|
|
rds_ib_cq_event_handler, conn,
|
2015-06-11 07:35:21 -06:00
|
|
|
&cq_attr);
|
2009-02-24 08:30:30 -07:00
|
|
|
if (IS_ERR(ic->i_send_cq)) {
|
|
|
|
ret = PTR_ERR(ic->i_send_cq);
|
|
|
|
ic->i_send_cq = NULL;
|
2016-07-04 17:16:36 -06:00
|
|
|
ibdev_put_vector(rds_ibdev, ic->i_scq_vector);
|
2009-02-24 08:30:30 -07:00
|
|
|
rdsdebug("ib_create_cq send failed: %d\n", ret);
|
2017-03-07 00:48:36 -07:00
|
|
|
goto rds_ibdev_out;
|
2009-02-24 08:30:30 -07:00
|
|
|
}
|
|
|
|
|
2016-07-04 17:16:36 -06:00
|
|
|
ic->i_rcq_vector = ibdev_get_unused_vector(rds_ibdev);
|
2015-06-11 07:35:21 -06:00
|
|
|
cq_attr.cqe = ic->i_recv_ring.w_nr;
|
2016-07-04 17:16:36 -06:00
|
|
|
cq_attr.comp_vector = ic->i_rcq_vector;
|
2015-09-06 00:18:51 -06:00
|
|
|
ic->i_recv_cq = ib_create_cq(dev, rds_ib_cq_comp_handler_recv,
|
2009-02-24 08:30:30 -07:00
|
|
|
rds_ib_cq_event_handler, conn,
|
2015-06-11 07:35:21 -06:00
|
|
|
&cq_attr);
|
2009-02-24 08:30:30 -07:00
|
|
|
if (IS_ERR(ic->i_recv_cq)) {
|
|
|
|
ret = PTR_ERR(ic->i_recv_cq);
|
|
|
|
ic->i_recv_cq = NULL;
|
2016-07-04 17:16:36 -06:00
|
|
|
ibdev_put_vector(rds_ibdev, ic->i_rcq_vector);
|
2009-02-24 08:30:30 -07:00
|
|
|
rdsdebug("ib_create_cq recv failed: %d\n", ret);
|
2017-03-07 00:48:36 -07:00
|
|
|
goto send_cq_out;
|
2009-02-24 08:30:30 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
ret = ib_req_notify_cq(ic->i_send_cq, IB_CQ_NEXT_COMP);
|
|
|
|
if (ret) {
|
|
|
|
rdsdebug("ib_req_notify_cq send failed: %d\n", ret);
|
2017-03-07 00:48:36 -07:00
|
|
|
goto recv_cq_out;
|
2009-02-24 08:30:30 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
ret = ib_req_notify_cq(ic->i_recv_cq, IB_CQ_SOLICITED);
|
|
|
|
if (ret) {
|
|
|
|
rdsdebug("ib_req_notify_cq recv failed: %d\n", ret);
|
2017-03-07 00:48:36 -07:00
|
|
|
goto recv_cq_out;
|
2009-02-24 08:30:30 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
/* XXX negotiate max send/recv with remote? */
|
|
|
|
memset(&attr, 0, sizeof(attr));
|
|
|
|
attr.event_handler = rds_ib_qp_event_handler;
|
|
|
|
attr.qp_context = conn;
|
|
|
|
/* + 1 to allow for the single ack message */
|
2016-03-01 16:20:53 -07:00
|
|
|
attr.cap.max_send_wr = ic->i_send_ring.w_nr + fr_queue_space + 1;
|
2009-02-24 08:30:30 -07:00
|
|
|
attr.cap.max_recv_wr = ic->i_recv_ring.w_nr + 1;
|
|
|
|
attr.cap.max_send_sge = rds_ibdev->max_sge;
|
|
|
|
attr.cap.max_recv_sge = RDS_IB_RECV_SGE;
|
|
|
|
attr.sq_sig_type = IB_SIGNAL_REQ_WR;
|
|
|
|
attr.qp_type = IB_QPT_RC;
|
|
|
|
attr.send_cq = ic->i_send_cq;
|
|
|
|
attr.recv_cq = ic->i_recv_cq;
|
2016-03-01 16:20:53 -07:00
|
|
|
atomic_set(&ic->i_fastreg_wrs, RDS_IB_DEFAULT_FR_WR);
|
2016-03-08 10:19:01 -07:00
|
|
|
atomic_set(&ic->i_fastunreg_wrs, RDS_IB_DEFAULT_FR_INV_WR);
|
2009-02-24 08:30:30 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* XXX this can fail if max_*_wr is too large? Are we supposed
|
|
|
|
* to back off until we get a value that the hardware can support?
|
|
|
|
*/
|
|
|
|
ret = rdma_create_qp(ic->i_cm_id, ic->i_pd, &attr);
|
|
|
|
if (ret) {
|
|
|
|
rdsdebug("rdma_create_qp failed: %d\n", ret);
|
2017-03-07 00:48:36 -07:00
|
|
|
goto recv_cq_out;
|
2009-02-24 08:30:30 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
ic->i_send_hdrs = ib_dma_alloc_coherent(dev,
|
|
|
|
ic->i_send_ring.w_nr *
|
|
|
|
sizeof(struct rds_header),
|
|
|
|
&ic->i_send_hdrs_dma, GFP_KERNEL);
|
2010-01-12 12:56:44 -07:00
|
|
|
if (!ic->i_send_hdrs) {
|
2009-02-24 08:30:30 -07:00
|
|
|
ret = -ENOMEM;
|
|
|
|
rdsdebug("ib_dma_alloc_coherent send failed\n");
|
2017-03-07 00:48:36 -07:00
|
|
|
goto qp_out;
|
2009-02-24 08:30:30 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
ic->i_recv_hdrs = ib_dma_alloc_coherent(dev,
|
|
|
|
ic->i_recv_ring.w_nr *
|
|
|
|
sizeof(struct rds_header),
|
|
|
|
&ic->i_recv_hdrs_dma, GFP_KERNEL);
|
2010-01-12 12:56:44 -07:00
|
|
|
if (!ic->i_recv_hdrs) {
|
2009-02-24 08:30:30 -07:00
|
|
|
ret = -ENOMEM;
|
|
|
|
rdsdebug("ib_dma_alloc_coherent recv failed\n");
|
2017-03-07 00:48:36 -07:00
|
|
|
goto send_hdrs_dma_out;
|
2009-02-24 08:30:30 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
ic->i_ack = ib_dma_alloc_coherent(dev, sizeof(struct rds_header),
|
|
|
|
&ic->i_ack_dma, GFP_KERNEL);
|
2010-01-12 12:56:44 -07:00
|
|
|
if (!ic->i_ack) {
|
2009-02-24 08:30:30 -07:00
|
|
|
ret = -ENOMEM;
|
|
|
|
rdsdebug("ib_dma_alloc_coherent ack failed\n");
|
2017-03-07 00:48:36 -07:00
|
|
|
goto recv_hdrs_dma_out;
|
2009-02-24 08:30:30 -07:00
|
|
|
}
|
|
|
|
|
treewide: Use array_size() in vzalloc_node()
The vzalloc_node() function has no 2-factor argument form, so
multiplication factors need to be wrapped in array_size(). This patch
replaces cases of:
vzalloc_node(a * b, node)
with:
vzalloc_node(array_size(a, b), node)
as well as handling cases of:
vzalloc_node(a * b * c, node)
with:
vzalloc_node(array3_size(a, b, c), node)
This does, however, attempt to ignore constant size factors like:
vzalloc_node(4 * 1024, node)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
vzalloc_node(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
vzalloc_node(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
vzalloc_node(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
vzalloc_node(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
vzalloc_node(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
vzalloc_node(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
vzalloc_node(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
vzalloc_node(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
vzalloc_node(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
vzalloc_node(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
vzalloc_node(
- sizeof(TYPE) * (COUNT_ID)
+ array_size(COUNT_ID, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(TYPE) * COUNT_ID
+ array_size(COUNT_ID, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(TYPE) * (COUNT_CONST)
+ array_size(COUNT_CONST, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(TYPE) * COUNT_CONST
+ array_size(COUNT_CONST, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(THING) * (COUNT_ID)
+ array_size(COUNT_ID, sizeof(THING))
, ...)
|
vzalloc_node(
- sizeof(THING) * COUNT_ID
+ array_size(COUNT_ID, sizeof(THING))
, ...)
|
vzalloc_node(
- sizeof(THING) * (COUNT_CONST)
+ array_size(COUNT_CONST, sizeof(THING))
, ...)
|
vzalloc_node(
- sizeof(THING) * COUNT_CONST
+ array_size(COUNT_CONST, sizeof(THING))
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
vzalloc_node(
- SIZE * COUNT
+ array_size(COUNT, SIZE)
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
vzalloc_node(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vzalloc_node(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vzalloc_node(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vzalloc_node(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
vzalloc_node(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
vzalloc_node(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
vzalloc_node(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
vzalloc_node(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
vzalloc_node(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
vzalloc_node(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
vzalloc_node(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc_node(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc_node(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc_node(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc_node(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc_node(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc_node(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc_node(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
vzalloc_node(C1 * C2 * C3, ...)
|
vzalloc_node(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants.
@@
expression E1, E2;
constant C1, C2;
@@
(
vzalloc_node(C1 * C2, ...)
|
vzalloc_node(
- E1 * E2
+ array_size(E1, E2)
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-12 15:27:52 -06:00
|
|
|
ic->i_sends = vzalloc_node(array_size(sizeof(struct rds_ib_send_work),
|
|
|
|
ic->i_send_ring.w_nr),
|
2010-04-23 11:49:53 -06:00
|
|
|
ibdev_to_node(dev));
|
2010-01-12 12:56:44 -07:00
|
|
|
if (!ic->i_sends) {
|
2009-02-24 08:30:30 -07:00
|
|
|
ret = -ENOMEM;
|
|
|
|
rdsdebug("send allocation failed\n");
|
2017-03-07 00:48:36 -07:00
|
|
|
goto ack_dma_out;
|
2009-02-24 08:30:30 -07:00
|
|
|
}
|
|
|
|
|
treewide: Use array_size() in vzalloc_node()
The vzalloc_node() function has no 2-factor argument form, so
multiplication factors need to be wrapped in array_size(). This patch
replaces cases of:
vzalloc_node(a * b, node)
with:
vzalloc_node(array_size(a, b), node)
as well as handling cases of:
vzalloc_node(a * b * c, node)
with:
vzalloc_node(array3_size(a, b, c), node)
This does, however, attempt to ignore constant size factors like:
vzalloc_node(4 * 1024, node)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
vzalloc_node(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
vzalloc_node(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
vzalloc_node(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
vzalloc_node(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
vzalloc_node(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
vzalloc_node(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
vzalloc_node(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
vzalloc_node(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
vzalloc_node(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
vzalloc_node(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
vzalloc_node(
- sizeof(TYPE) * (COUNT_ID)
+ array_size(COUNT_ID, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(TYPE) * COUNT_ID
+ array_size(COUNT_ID, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(TYPE) * (COUNT_CONST)
+ array_size(COUNT_CONST, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(TYPE) * COUNT_CONST
+ array_size(COUNT_CONST, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(THING) * (COUNT_ID)
+ array_size(COUNT_ID, sizeof(THING))
, ...)
|
vzalloc_node(
- sizeof(THING) * COUNT_ID
+ array_size(COUNT_ID, sizeof(THING))
, ...)
|
vzalloc_node(
- sizeof(THING) * (COUNT_CONST)
+ array_size(COUNT_CONST, sizeof(THING))
, ...)
|
vzalloc_node(
- sizeof(THING) * COUNT_CONST
+ array_size(COUNT_CONST, sizeof(THING))
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
vzalloc_node(
- SIZE * COUNT
+ array_size(COUNT, SIZE)
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
vzalloc_node(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc_node(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vzalloc_node(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vzalloc_node(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vzalloc_node(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
vzalloc_node(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
vzalloc_node(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
vzalloc_node(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
vzalloc_node(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
vzalloc_node(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
vzalloc_node(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
vzalloc_node(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc_node(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc_node(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc_node(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc_node(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc_node(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc_node(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc_node(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
vzalloc_node(C1 * C2 * C3, ...)
|
vzalloc_node(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants.
@@
expression E1, E2;
constant C1, C2;
@@
(
vzalloc_node(C1 * C2, ...)
|
vzalloc_node(
- E1 * E2
+ array_size(E1, E2)
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-12 15:27:52 -06:00
|
|
|
ic->i_recvs = vzalloc_node(array_size(sizeof(struct rds_ib_recv_work),
|
|
|
|
ic->i_recv_ring.w_nr),
|
2010-04-23 11:49:53 -06:00
|
|
|
ibdev_to_node(dev));
|
2010-01-12 12:56:44 -07:00
|
|
|
if (!ic->i_recvs) {
|
2009-02-24 08:30:30 -07:00
|
|
|
ret = -ENOMEM;
|
|
|
|
rdsdebug("recv allocation failed\n");
|
2017-03-07 00:48:36 -07:00
|
|
|
goto sends_out;
|
2009-02-24 08:30:30 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
rds_ib_recv_init_ack(ic);
|
|
|
|
|
2015-07-30 17:22:26 -06:00
|
|
|
rdsdebug("conn %p pd %p cq %p %p\n", conn, ic->i_pd,
|
2009-02-24 08:30:30 -07:00
|
|
|
ic->i_send_cq, ic->i_recv_cq);
|
|
|
|
|
2018-04-25 05:22:01 -06:00
|
|
|
goto out;
|
2017-03-07 00:48:36 -07:00
|
|
|
|
|
|
|
sends_out:
|
|
|
|
vfree(ic->i_sends);
|
|
|
|
ack_dma_out:
|
|
|
|
ib_dma_free_coherent(dev, sizeof(struct rds_header),
|
|
|
|
ic->i_ack, ic->i_ack_dma);
|
|
|
|
recv_hdrs_dma_out:
|
|
|
|
ib_dma_free_coherent(dev, ic->i_recv_ring.w_nr *
|
|
|
|
sizeof(struct rds_header),
|
|
|
|
ic->i_recv_hdrs, ic->i_recv_hdrs_dma);
|
|
|
|
send_hdrs_dma_out:
|
|
|
|
ib_dma_free_coherent(dev, ic->i_send_ring.w_nr *
|
|
|
|
sizeof(struct rds_header),
|
|
|
|
ic->i_send_hdrs, ic->i_send_hdrs_dma);
|
|
|
|
qp_out:
|
|
|
|
rdma_destroy_qp(ic->i_cm_id);
|
|
|
|
recv_cq_out:
|
|
|
|
if (!ib_destroy_cq(ic->i_recv_cq))
|
|
|
|
ic->i_recv_cq = NULL;
|
|
|
|
send_cq_out:
|
|
|
|
if (!ib_destroy_cq(ic->i_send_cq))
|
|
|
|
ic->i_send_cq = NULL;
|
|
|
|
rds_ibdev_out:
|
|
|
|
rds_ib_remove_conn(rds_ibdev, conn);
|
2018-04-25 05:22:01 -06:00
|
|
|
out:
|
2010-05-18 16:48:51 -06:00
|
|
|
rds_ib_dev_put(rds_ibdev);
|
2017-03-07 00:48:36 -07:00
|
|
|
|
2009-02-24 08:30:30 -07:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2009-07-17 07:13:23 -06:00
|
|
|
static u32 rds_ib_protocol_compatible(struct rdma_cm_event *event)
|
2009-02-24 08:30:30 -07:00
|
|
|
{
|
2009-07-17 07:13:23 -06:00
|
|
|
const struct rds_ib_connect_private *dp = event->param.conn.private_data;
|
2009-02-24 08:30:30 -07:00
|
|
|
u16 common;
|
|
|
|
u32 version = 0;
|
|
|
|
|
2009-07-17 07:13:23 -06:00
|
|
|
/*
|
|
|
|
* rdma_cm private data is odd - when there is any private data in the
|
2009-02-24 08:30:30 -07:00
|
|
|
* request, we will be given a pretty large buffer without telling us the
|
|
|
|
* original size. The only way to tell the difference is by looking at
|
|
|
|
* the contents, which are initialized to zero.
|
|
|
|
* If the protocol version fields aren't set, this is a connection attempt
|
|
|
|
* from an older version. This could could be 3.0 or 2.0 - we can't tell.
|
2009-07-17 07:13:23 -06:00
|
|
|
* We really should have changed this for OFED 1.3 :-(
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Be paranoid. RDS always has privdata */
|
|
|
|
if (!event->param.conn.private_data_len) {
|
|
|
|
printk(KERN_NOTICE "RDS incoming connection has no private data, "
|
|
|
|
"rejecting\n");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Even if len is crap *now* I still want to check it. -ASG */
|
2009-11-29 17:55:45 -07:00
|
|
|
if (event->param.conn.private_data_len < sizeof (*dp) ||
|
|
|
|
dp->dp_protocol_major == 0)
|
2009-02-24 08:30:30 -07:00
|
|
|
return RDS_PROTOCOL_3_0;
|
|
|
|
|
|
|
|
common = be16_to_cpu(dp->dp_protocol_minor_mask) & RDS_IB_SUPPORTED_PROTOCOLS;
|
|
|
|
if (dp->dp_protocol_major == 3 && common) {
|
|
|
|
version = RDS_PROTOCOL_3_0;
|
|
|
|
while ((common >>= 1) != 0)
|
|
|
|
version++;
|
2012-12-21 01:01:54 -07:00
|
|
|
} else
|
|
|
|
printk_ratelimited(KERN_NOTICE "RDS: Connection from %pI4 using incompatible protocol version %u.%u\n",
|
|
|
|
&dp->dp_saddr,
|
|
|
|
dp->dp_protocol_major,
|
|
|
|
dp->dp_protocol_minor);
|
2009-02-24 08:30:30 -07:00
|
|
|
return version;
|
|
|
|
}
|
|
|
|
|
|
|
|
int rds_ib_cm_handle_connect(struct rdma_cm_id *cm_id,
|
|
|
|
struct rdma_cm_event *event)
|
|
|
|
{
|
|
|
|
__be64 lguid = cm_id->route.path_rec->sgid.global.interface_id;
|
|
|
|
__be64 fguid = cm_id->route.path_rec->dgid.global.interface_id;
|
|
|
|
const struct rds_ib_connect_private *dp = event->param.conn.private_data;
|
|
|
|
struct rds_ib_connect_private dp_rep;
|
|
|
|
struct rds_connection *conn = NULL;
|
|
|
|
struct rds_ib_connection *ic = NULL;
|
|
|
|
struct rdma_conn_param conn_param;
|
|
|
|
u32 version;
|
2010-05-24 14:14:59 -06:00
|
|
|
int err = 1, destroy = 1;
|
2009-02-24 08:30:30 -07:00
|
|
|
|
|
|
|
/* Check whether the remote protocol version matches ours. */
|
2009-07-17 07:13:23 -06:00
|
|
|
version = rds_ib_protocol_compatible(event);
|
2009-02-24 08:30:30 -07:00
|
|
|
if (!version)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
rdsdebug("saddr %pI4 daddr %pI4 RDSv%u.%u lguid 0x%llx fguid "
|
|
|
|
"0x%llx\n", &dp->dp_saddr, &dp->dp_daddr,
|
|
|
|
RDS_PROTOCOL_MAJOR(version), RDS_PROTOCOL_MINOR(version),
|
|
|
|
(unsigned long long)be64_to_cpu(lguid),
|
|
|
|
(unsigned long long)be64_to_cpu(fguid));
|
|
|
|
|
2015-08-04 23:43:25 -06:00
|
|
|
/* RDS/IB is not currently netns aware, thus init_net */
|
|
|
|
conn = rds_conn_create(&init_net, dp->dp_daddr, dp->dp_saddr,
|
|
|
|
&rds_ib_transport, GFP_KERNEL);
|
2009-02-24 08:30:30 -07:00
|
|
|
if (IS_ERR(conn)) {
|
|
|
|
rdsdebug("rds_conn_create failed (%ld)\n", PTR_ERR(conn));
|
|
|
|
conn = NULL;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The connection request may occur while the
|
|
|
|
* previous connection exist, e.g. in case of failover.
|
|
|
|
* But as connections may be initiated simultaneously
|
|
|
|
* by both hosts, we have a random backoff mechanism -
|
|
|
|
* see the comment above rds_queue_reconnect()
|
|
|
|
*/
|
|
|
|
mutex_lock(&conn->c_cm_lock);
|
|
|
|
if (!rds_conn_transition(conn, RDS_CONN_DOWN, RDS_CONN_CONNECTING)) {
|
|
|
|
if (rds_conn_state(conn) == RDS_CONN_UP) {
|
|
|
|
rdsdebug("incoming connect while connecting\n");
|
|
|
|
rds_conn_drop(conn);
|
|
|
|
rds_ib_stats_inc(s_ib_listen_closed_stale);
|
|
|
|
} else
|
|
|
|
if (rds_conn_state(conn) == RDS_CONN_CONNECTING) {
|
|
|
|
/* Wait and see - our connect may still be succeeding */
|
|
|
|
rds_ib_stats_inc(s_ib_connect_raced);
|
|
|
|
}
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
ic = conn->c_transport_data;
|
|
|
|
|
|
|
|
rds_ib_set_protocol(conn, version);
|
|
|
|
rds_ib_set_flow_control(conn, be32_to_cpu(dp->dp_credit));
|
|
|
|
|
|
|
|
/* If the peer gave us the last packet it saw, process this as if
|
|
|
|
* we had received a regular ACK. */
|
|
|
|
if (dp->dp_ack_seq)
|
|
|
|
rds_send_drop_acked(conn, be64_to_cpu(dp->dp_ack_seq), NULL);
|
|
|
|
|
|
|
|
BUG_ON(cm_id->context);
|
|
|
|
BUG_ON(ic->i_cm_id);
|
|
|
|
|
|
|
|
ic->i_cm_id = cm_id;
|
|
|
|
cm_id->context = conn;
|
|
|
|
|
|
|
|
/* We got halfway through setting up the ib_connection, if we
|
|
|
|
* fail now, we have to take the long route out of this mess. */
|
|
|
|
destroy = 0;
|
|
|
|
|
|
|
|
err = rds_ib_setup_qp(conn);
|
|
|
|
if (err) {
|
|
|
|
rds_ib_conn_error(conn, "rds_ib_setup_qp failed (%d)\n", err);
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2010-01-12 11:50:48 -07:00
|
|
|
rds_ib_cm_fill_conn_param(conn, &conn_param, &dp_rep, version,
|
|
|
|
event->param.conn.responder_resources,
|
|
|
|
event->param.conn.initiator_depth);
|
2009-02-24 08:30:30 -07:00
|
|
|
|
|
|
|
/* rdma_accept() calls rdma_reject() internally if it fails */
|
2017-03-12 23:43:45 -06:00
|
|
|
if (rdma_accept(cm_id, &conn_param))
|
|
|
|
rds_ib_conn_error(conn, "rdma_accept failed\n");
|
2009-02-24 08:30:30 -07:00
|
|
|
|
|
|
|
out:
|
2010-05-24 14:14:59 -06:00
|
|
|
if (conn)
|
|
|
|
mutex_unlock(&conn->c_cm_lock);
|
|
|
|
if (err)
|
|
|
|
rdma_reject(cm_id, NULL, 0);
|
2009-02-24 08:30:30 -07:00
|
|
|
return destroy;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int rds_ib_cm_initiate_connect(struct rdma_cm_id *cm_id)
|
|
|
|
{
|
|
|
|
struct rds_connection *conn = cm_id->context;
|
|
|
|
struct rds_ib_connection *ic = conn->c_transport_data;
|
|
|
|
struct rdma_conn_param conn_param;
|
|
|
|
struct rds_ib_connect_private dp;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* If the peer doesn't do protocol negotiation, we must
|
|
|
|
* default to RDSv3.0 */
|
|
|
|
rds_ib_set_protocol(conn, RDS_PROTOCOL_3_0);
|
|
|
|
ic->i_flowctl = rds_ib_sysctl_flow_control; /* advertise flow control */
|
|
|
|
|
|
|
|
ret = rds_ib_setup_qp(conn);
|
|
|
|
if (ret) {
|
|
|
|
rds_ib_conn_error(conn, "rds_ib_setup_qp failed (%d)\n", ret);
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2010-01-12 11:50:48 -07:00
|
|
|
rds_ib_cm_fill_conn_param(conn, &conn_param, &dp, RDS_PROTOCOL_VERSION,
|
|
|
|
UINT_MAX, UINT_MAX);
|
2009-02-24 08:30:30 -07:00
|
|
|
ret = rdma_connect(cm_id, &conn_param);
|
|
|
|
if (ret)
|
|
|
|
rds_ib_conn_error(conn, "rdma_connect failed (%d)\n", ret);
|
|
|
|
|
|
|
|
out:
|
|
|
|
/* Beware - returning non-zero tells the rdma_cm to destroy
|
|
|
|
* the cm_id. We should certainly not do it as long as we still
|
|
|
|
* "own" the cm_id. */
|
|
|
|
if (ret) {
|
|
|
|
if (ic->i_cm_id == cm_id)
|
|
|
|
ret = 0;
|
|
|
|
}
|
2016-07-09 19:31:38 -06:00
|
|
|
ic->i_active_side = true;
|
2009-02-24 08:30:30 -07:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2016-06-30 17:11:16 -06:00
|
|
|
int rds_ib_conn_path_connect(struct rds_conn_path *cp)
|
2009-02-24 08:30:30 -07:00
|
|
|
{
|
2016-06-30 17:11:16 -06:00
|
|
|
struct rds_connection *conn = cp->cp_conn;
|
2009-02-24 08:30:30 -07:00
|
|
|
struct rds_ib_connection *ic = conn->c_transport_data;
|
|
|
|
struct sockaddr_in src, dest;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* XXX I wonder what affect the port space has */
|
|
|
|
/* delegate cm event handler to rdma_transport */
|
2015-10-22 06:20:10 -06:00
|
|
|
ic->i_cm_id = rdma_create_id(&init_net, rds_rdma_cm_event_handler, conn,
|
2010-04-01 11:08:41 -06:00
|
|
|
RDMA_PS_TCP, IB_QPT_RC);
|
2009-02-24 08:30:30 -07:00
|
|
|
if (IS_ERR(ic->i_cm_id)) {
|
|
|
|
ret = PTR_ERR(ic->i_cm_id);
|
|
|
|
ic->i_cm_id = NULL;
|
|
|
|
rdsdebug("rdma_create_id() failed: %d\n", ret);
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
rdsdebug("created cm id %p for conn %p\n", ic->i_cm_id, conn);
|
|
|
|
|
|
|
|
src.sin_family = AF_INET;
|
|
|
|
src.sin_addr.s_addr = (__force u32)conn->c_laddr;
|
|
|
|
src.sin_port = (__force u16)htons(0);
|
|
|
|
|
|
|
|
dest.sin_family = AF_INET;
|
|
|
|
dest.sin_addr.s_addr = (__force u32)conn->c_faddr;
|
|
|
|
dest.sin_port = (__force u16)htons(RDS_PORT);
|
|
|
|
|
|
|
|
ret = rdma_resolve_addr(ic->i_cm_id, (struct sockaddr *)&src,
|
|
|
|
(struct sockaddr *)&dest,
|
|
|
|
RDS_RDMA_RESOLVE_TIMEOUT_MS);
|
|
|
|
if (ret) {
|
|
|
|
rdsdebug("addr resolve failed for cm id %p: %d\n", ic->i_cm_id,
|
|
|
|
ret);
|
|
|
|
rdma_destroy_id(ic->i_cm_id);
|
|
|
|
ic->i_cm_id = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
out:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is so careful about only cleaning up resources that were built up
|
|
|
|
* so that it can be called at any point during startup. In fact it
|
|
|
|
* can be called multiple times for a given connection.
|
|
|
|
*/
|
2016-06-30 17:11:10 -06:00
|
|
|
void rds_ib_conn_path_shutdown(struct rds_conn_path *cp)
|
2009-02-24 08:30:30 -07:00
|
|
|
{
|
2016-06-30 17:11:10 -06:00
|
|
|
struct rds_connection *conn = cp->cp_conn;
|
2009-02-24 08:30:30 -07:00
|
|
|
struct rds_ib_connection *ic = conn->c_transport_data;
|
|
|
|
int err = 0;
|
|
|
|
|
|
|
|
rdsdebug("cm %p pd %p cq %p %p qp %p\n", ic->i_cm_id,
|
|
|
|
ic->i_pd, ic->i_send_cq, ic->i_recv_cq,
|
|
|
|
ic->i_cm_id ? ic->i_cm_id->qp : NULL);
|
|
|
|
|
|
|
|
if (ic->i_cm_id) {
|
|
|
|
struct ib_device *dev = ic->i_cm_id->device;
|
|
|
|
|
|
|
|
rdsdebug("disconnecting cm %p\n", ic->i_cm_id);
|
|
|
|
err = rdma_disconnect(ic->i_cm_id);
|
|
|
|
if (err) {
|
|
|
|
/* Actually this may happen quite frequently, when
|
|
|
|
* an outgoing connect raced with an incoming connect.
|
|
|
|
*/
|
|
|
|
rdsdebug("failed to disconnect, cm: %p err %d\n",
|
|
|
|
ic->i_cm_id, err);
|
|
|
|
}
|
|
|
|
|
2010-03-03 20:25:21 -07:00
|
|
|
/*
|
2010-07-14 14:55:35 -06:00
|
|
|
* We want to wait for tx and rx completion to finish
|
|
|
|
* before we tear down the connection, but we have to be
|
|
|
|
* careful not to get stuck waiting on a send ring that
|
|
|
|
* only has unsignaled sends in it. We've shutdown new
|
|
|
|
* sends before getting here so by waiting for signaled
|
|
|
|
* sends to complete we're ensured that there will be no
|
|
|
|
* more tx processing.
|
2010-03-03 20:25:21 -07:00
|
|
|
*/
|
2009-02-24 08:30:30 -07:00
|
|
|
wait_event(rds_ib_ring_empty_wait,
|
2010-07-14 14:55:35 -06:00
|
|
|
rds_ib_ring_empty(&ic->i_recv_ring) &&
|
2016-03-01 16:20:53 -07:00
|
|
|
(atomic_read(&ic->i_signaled_sends) == 0) &&
|
2016-03-08 10:19:01 -07:00
|
|
|
(atomic_read(&ic->i_fastreg_wrs) == RDS_IB_DEFAULT_FR_WR) &&
|
|
|
|
(atomic_read(&ic->i_fastunreg_wrs) == RDS_IB_DEFAULT_FR_INV_WR));
|
2015-09-06 00:18:51 -06:00
|
|
|
tasklet_kill(&ic->i_send_tasklet);
|
2010-07-14 14:55:35 -06:00
|
|
|
tasklet_kill(&ic->i_recv_tasklet);
|
2009-02-24 08:30:30 -07:00
|
|
|
|
2016-09-29 12:07:11 -06:00
|
|
|
atomic_set(&ic->i_cq_quiesce, 1);
|
|
|
|
|
2015-08-22 16:45:24 -06:00
|
|
|
/* first destroy the ib state that generates callbacks */
|
|
|
|
if (ic->i_cm_id->qp)
|
|
|
|
rdma_destroy_qp(ic->i_cm_id);
|
2016-07-04 17:16:36 -06:00
|
|
|
if (ic->i_send_cq) {
|
|
|
|
if (ic->rds_ibdev)
|
|
|
|
ibdev_put_vector(ic->rds_ibdev, ic->i_scq_vector);
|
2015-08-22 16:45:24 -06:00
|
|
|
ib_destroy_cq(ic->i_send_cq);
|
2016-07-04 17:16:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
if (ic->i_recv_cq) {
|
|
|
|
if (ic->rds_ibdev)
|
|
|
|
ibdev_put_vector(ic->rds_ibdev, ic->i_rcq_vector);
|
2015-08-22 16:45:24 -06:00
|
|
|
ib_destroy_cq(ic->i_recv_cq);
|
2016-07-04 17:16:36 -06:00
|
|
|
}
|
2015-08-22 16:45:24 -06:00
|
|
|
|
|
|
|
/* then free the resources that ib callbacks use */
|
2009-02-24 08:30:30 -07:00
|
|
|
if (ic->i_send_hdrs)
|
|
|
|
ib_dma_free_coherent(dev,
|
|
|
|
ic->i_send_ring.w_nr *
|
|
|
|
sizeof(struct rds_header),
|
|
|
|
ic->i_send_hdrs,
|
|
|
|
ic->i_send_hdrs_dma);
|
|
|
|
|
|
|
|
if (ic->i_recv_hdrs)
|
|
|
|
ib_dma_free_coherent(dev,
|
|
|
|
ic->i_recv_ring.w_nr *
|
|
|
|
sizeof(struct rds_header),
|
|
|
|
ic->i_recv_hdrs,
|
|
|
|
ic->i_recv_hdrs_dma);
|
|
|
|
|
|
|
|
if (ic->i_ack)
|
|
|
|
ib_dma_free_coherent(dev, sizeof(struct rds_header),
|
|
|
|
ic->i_ack, ic->i_ack_dma);
|
|
|
|
|
|
|
|
if (ic->i_sends)
|
|
|
|
rds_ib_send_clear_ring(ic);
|
|
|
|
if (ic->i_recvs)
|
|
|
|
rds_ib_recv_clear_ring(ic);
|
|
|
|
|
2015-08-22 16:45:32 -06:00
|
|
|
rdma_destroy_id(ic->i_cm_id);
|
|
|
|
|
2009-02-24 08:30:30 -07:00
|
|
|
/*
|
|
|
|
* Move connection back to the nodev list.
|
|
|
|
*/
|
2009-04-01 02:20:19 -06:00
|
|
|
if (ic->rds_ibdev)
|
|
|
|
rds_ib_remove_conn(ic->rds_ibdev, conn);
|
2009-02-24 08:30:30 -07:00
|
|
|
|
|
|
|
ic->i_cm_id = NULL;
|
|
|
|
ic->i_pd = NULL;
|
|
|
|
ic->i_send_cq = NULL;
|
|
|
|
ic->i_recv_cq = NULL;
|
|
|
|
ic->i_send_hdrs = NULL;
|
|
|
|
ic->i_recv_hdrs = NULL;
|
|
|
|
ic->i_ack = NULL;
|
|
|
|
}
|
|
|
|
BUG_ON(ic->rds_ibdev);
|
|
|
|
|
|
|
|
/* Clear pending transmit */
|
2010-03-01 15:03:09 -07:00
|
|
|
if (ic->i_data_op) {
|
|
|
|
struct rds_message *rm;
|
|
|
|
|
|
|
|
rm = container_of(ic->i_data_op, struct rds_message, data);
|
|
|
|
rds_message_put(rm);
|
|
|
|
ic->i_data_op = NULL;
|
2009-02-24 08:30:30 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Clear the ACK state */
|
|
|
|
clear_bit(IB_ACK_IN_FLIGHT, &ic->i_ack_flags);
|
2009-04-01 02:20:20 -06:00
|
|
|
#ifdef KERNEL_HAS_ATOMIC64
|
|
|
|
atomic64_set(&ic->i_ack_next, 0);
|
|
|
|
#else
|
|
|
|
ic->i_ack_next = 0;
|
|
|
|
#endif
|
2009-02-24 08:30:30 -07:00
|
|
|
ic->i_ack_recv = 0;
|
|
|
|
|
|
|
|
/* Clear flow control state */
|
|
|
|
ic->i_flowctl = 0;
|
|
|
|
atomic_set(&ic->i_credits, 0);
|
|
|
|
|
|
|
|
rds_ib_ring_init(&ic->i_send_ring, rds_ib_sysctl_max_send_wr);
|
|
|
|
rds_ib_ring_init(&ic->i_recv_ring, rds_ib_sysctl_max_recv_wr);
|
|
|
|
|
|
|
|
if (ic->i_ibinc) {
|
|
|
|
rds_inc_put(&ic->i_ibinc->ii_inc);
|
|
|
|
ic->i_ibinc = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
vfree(ic->i_sends);
|
|
|
|
ic->i_sends = NULL;
|
|
|
|
vfree(ic->i_recvs);
|
|
|
|
ic->i_recvs = NULL;
|
2016-07-09 19:31:38 -06:00
|
|
|
ic->i_active_side = false;
|
2009-02-24 08:30:30 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
int rds_ib_conn_alloc(struct rds_connection *conn, gfp_t gfp)
|
|
|
|
{
|
|
|
|
struct rds_ib_connection *ic;
|
|
|
|
unsigned long flags;
|
2010-05-26 23:05:37 -06:00
|
|
|
int ret;
|
2009-02-24 08:30:30 -07:00
|
|
|
|
|
|
|
/* XXX too lazy? */
|
2012-03-21 14:44:09 -06:00
|
|
|
ic = kzalloc(sizeof(struct rds_ib_connection), gfp);
|
2010-01-12 12:56:44 -07:00
|
|
|
if (!ic)
|
2009-02-24 08:30:30 -07:00
|
|
|
return -ENOMEM;
|
|
|
|
|
2010-05-26 23:05:37 -06:00
|
|
|
ret = rds_ib_recv_alloc_caches(ic);
|
|
|
|
if (ret) {
|
|
|
|
kfree(ic);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2009-02-24 08:30:30 -07:00
|
|
|
INIT_LIST_HEAD(&ic->ib_node);
|
2015-09-06 00:18:51 -06:00
|
|
|
tasklet_init(&ic->i_send_tasklet, rds_ib_tasklet_fn_send,
|
|
|
|
(unsigned long)ic);
|
2015-09-06 00:18:51 -06:00
|
|
|
tasklet_init(&ic->i_recv_tasklet, rds_ib_tasklet_fn_recv,
|
2015-09-06 00:18:51 -06:00
|
|
|
(unsigned long)ic);
|
2009-02-24 08:30:30 -07:00
|
|
|
mutex_init(&ic->i_recv_mutex);
|
2009-04-01 02:20:20 -06:00
|
|
|
#ifndef KERNEL_HAS_ATOMIC64
|
|
|
|
spin_lock_init(&ic->i_ack_lock);
|
|
|
|
#endif
|
2010-07-14 14:55:35 -06:00
|
|
|
atomic_set(&ic->i_signaled_sends, 0);
|
2009-02-24 08:30:30 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* rds_ib_conn_shutdown() waits for these to be emptied so they
|
|
|
|
* must be initialized before it can be called.
|
|
|
|
*/
|
|
|
|
rds_ib_ring_init(&ic->i_send_ring, rds_ib_sysctl_max_send_wr);
|
|
|
|
rds_ib_ring_init(&ic->i_recv_ring, rds_ib_sysctl_max_recv_wr);
|
|
|
|
|
|
|
|
ic->conn = conn;
|
|
|
|
conn->c_transport_data = ic;
|
|
|
|
|
|
|
|
spin_lock_irqsave(&ib_nodev_conns_lock, flags);
|
|
|
|
list_add_tail(&ic->ib_node, &ib_nodev_conns);
|
|
|
|
spin_unlock_irqrestore(&ib_nodev_conns_lock, flags);
|
|
|
|
|
|
|
|
|
|
|
|
rdsdebug("conn %p conn ic %p\n", conn, conn->c_transport_data);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-04-01 02:20:19 -06:00
|
|
|
/*
|
|
|
|
* Free a connection. Connection must be shut down and not set for reconnect.
|
|
|
|
*/
|
2009-02-24 08:30:30 -07:00
|
|
|
void rds_ib_conn_free(void *arg)
|
|
|
|
{
|
|
|
|
struct rds_ib_connection *ic = arg;
|
2009-04-01 02:20:19 -06:00
|
|
|
spinlock_t *lock_ptr;
|
|
|
|
|
2009-02-24 08:30:30 -07:00
|
|
|
rdsdebug("ic %p\n", ic);
|
2009-04-01 02:20:19 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Conn is either on a dev's list or on the nodev list.
|
|
|
|
* A race with shutdown() or connect() would cause problems
|
|
|
|
* (since rds_ibdev would change) but that should never happen.
|
|
|
|
*/
|
|
|
|
lock_ptr = ic->rds_ibdev ? &ic->rds_ibdev->spinlock : &ib_nodev_conns_lock;
|
|
|
|
|
|
|
|
spin_lock_irq(lock_ptr);
|
2009-02-24 08:30:30 -07:00
|
|
|
list_del(&ic->ib_node);
|
2009-04-01 02:20:19 -06:00
|
|
|
spin_unlock_irq(lock_ptr);
|
|
|
|
|
2010-05-26 23:05:37 -06:00
|
|
|
rds_ib_recv_free_caches(ic);
|
|
|
|
|
2009-02-24 08:30:30 -07:00
|
|
|
kfree(ic);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* An error occurred on the connection
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
__rds_ib_conn_error(struct rds_connection *conn, const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list ap;
|
|
|
|
|
|
|
|
rds_conn_drop(conn);
|
|
|
|
|
|
|
|
va_start(ap, fmt);
|
|
|
|
vprintk(fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
}
|