2010-05-24 12:44:54 +08:00
|
|
|
/*
|
2013-03-15 02:13:41 +08:00
|
|
|
* Copyright (c) 2012, 2013 Intel Corporation. All rights reserved.
|
2012-07-19 21:03:56 +08:00
|
|
|
* Copyright (c) 2006 - 2012 QLogic Corporation. All rights reserved.
|
2010-05-24 12:44:54 +08:00
|
|
|
* Copyright (c) 2003, 2004, 2005, 2006 PathScale, 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
|
|
|
|
* 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/pci.h>
|
|
|
|
#include <linux/netdevice.h>
|
|
|
|
#include <linux/vmalloc.h>
|
|
|
|
#include <linux/delay.h>
|
2011-05-28 03:35:46 +08:00
|
|
|
#include <linux/module.h>
|
2012-07-19 21:04:25 +08:00
|
|
|
#include <linux/printk.h>
|
2013-05-31 06:25:25 +08:00
|
|
|
#ifdef CONFIG_INFINIBAND_QIB_DCA
|
|
|
|
#include <linux/dca.h>
|
|
|
|
#endif
|
2016-01-23 04:44:29 +08:00
|
|
|
#include <rdma/rdma_vt.h>
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
#include "qib.h"
|
|
|
|
#include "qib_common.h"
|
2012-07-19 21:04:04 +08:00
|
|
|
#include "qib_mad.h"
|
2013-06-16 05:07:03 +08:00
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
|
|
#include "qib_debugfs.h"
|
|
|
|
#include "qib_verbs.h"
|
|
|
|
#endif
|
2010-05-24 12:44:54 +08:00
|
|
|
|
2012-07-19 21:04:25 +08:00
|
|
|
#undef pr_fmt
|
|
|
|
#define pr_fmt(fmt) QIB_DRV_NAME ": " fmt
|
|
|
|
|
2010-05-24 12:44:54 +08:00
|
|
|
/*
|
|
|
|
* min buffers we want to have per context, after driver
|
|
|
|
*/
|
|
|
|
#define QIB_MIN_USER_CTXT_BUFCNT 7
|
|
|
|
|
|
|
|
#define QLOGIC_IB_R_SOFTWARE_MASK 0xFF
|
|
|
|
#define QLOGIC_IB_R_SOFTWARE_SHIFT 24
|
|
|
|
#define QLOGIC_IB_R_EMULATOR_MASK (1ULL<<62)
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Number of ctxts we are configured to use (to allow for more pio
|
|
|
|
* buffers per ctxt, etc.) Zero means use chip value.
|
|
|
|
*/
|
|
|
|
ushort qib_cfgctxts;
|
|
|
|
module_param_named(cfgctxts, qib_cfgctxts, ushort, S_IRUGO);
|
|
|
|
MODULE_PARM_DESC(cfgctxts, "Set max number of contexts to use");
|
|
|
|
|
2013-05-29 00:57:33 +08:00
|
|
|
unsigned qib_numa_aware;
|
|
|
|
module_param_named(numa_aware, qib_numa_aware, uint, S_IRUGO);
|
|
|
|
MODULE_PARM_DESC(numa_aware,
|
|
|
|
"0 -> PSM allocation close to HCA, 1 -> PSM allocation local to process");
|
|
|
|
|
2010-05-24 12:44:54 +08:00
|
|
|
/*
|
|
|
|
* If set, do not write to any regs if avoidable, hack to allow
|
|
|
|
* check for deranged default register values.
|
|
|
|
*/
|
|
|
|
ushort qib_mini_init;
|
|
|
|
module_param_named(mini_init, qib_mini_init, ushort, S_IRUGO);
|
|
|
|
MODULE_PARM_DESC(mini_init, "If set, do minimal diag init");
|
|
|
|
|
|
|
|
unsigned qib_n_krcv_queues;
|
|
|
|
module_param_named(krcvqs, qib_n_krcv_queues, uint, S_IRUGO);
|
|
|
|
MODULE_PARM_DESC(krcvqs, "number of kernel receive queues per IB port");
|
|
|
|
|
2012-07-19 21:04:04 +08:00
|
|
|
unsigned qib_cc_table_size;
|
|
|
|
module_param_named(cc_table_size, qib_cc_table_size, uint, S_IRUGO);
|
|
|
|
MODULE_PARM_DESC(cc_table_size, "Congestion control table entries 0 (CCA disabled - default), min = 128, max = 1984");
|
2010-05-24 12:44:54 +08:00
|
|
|
|
2017-10-05 08:45:35 +08:00
|
|
|
static void verify_interrupt(struct timer_list *);
|
2010-05-24 12:44:54 +08:00
|
|
|
|
2019-02-21 08:21:00 +08:00
|
|
|
DEFINE_XARRAY_FLAGS(qib_dev_table, XA_FLAGS_ALLOC | XA_FLAGS_LOCK_IRQ);
|
2010-05-24 12:44:54 +08:00
|
|
|
u32 qib_cpulist_count;
|
|
|
|
unsigned long *qib_cpulist;
|
|
|
|
|
|
|
|
/* set number of contexts we'll actually use */
|
|
|
|
void qib_set_ctxtcnt(struct qib_devdata *dd)
|
|
|
|
{
|
2011-01-11 09:42:20 +08:00
|
|
|
if (!qib_cfgctxts) {
|
2010-07-22 06:46:11 +08:00
|
|
|
dd->cfgctxts = dd->first_user_ctxt + num_online_cpus();
|
2011-01-11 09:42:20 +08:00
|
|
|
if (dd->cfgctxts > dd->ctxtcnt)
|
|
|
|
dd->cfgctxts = dd->ctxtcnt;
|
|
|
|
} else if (qib_cfgctxts < dd->num_pports)
|
2010-05-24 12:44:54 +08:00
|
|
|
dd->cfgctxts = dd->ctxtcnt;
|
|
|
|
else if (qib_cfgctxts <= dd->ctxtcnt)
|
|
|
|
dd->cfgctxts = qib_cfgctxts;
|
|
|
|
else
|
|
|
|
dd->cfgctxts = dd->ctxtcnt;
|
2012-05-08 02:03:02 +08:00
|
|
|
dd->freectxts = (dd->first_user_ctxt > dd->cfgctxts) ? 0 :
|
|
|
|
dd->cfgctxts - dd->first_user_ctxt;
|
2010-05-24 12:44:54 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Common code for creating the receive context array.
|
|
|
|
*/
|
|
|
|
int qib_create_ctxts(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
unsigned i;
|
2013-05-29 00:57:33 +08:00
|
|
|
int local_node_id = pcibus_to_node(dd->pcidev->bus);
|
|
|
|
|
|
|
|
if (local_node_id < 0)
|
|
|
|
local_node_id = numa_node_id();
|
|
|
|
dd->assigned_node_id = local_node_id;
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Allocate full ctxtcnt array, rather than just cfgctxts, because
|
|
|
|
* cleanup iterates across all possible ctxts.
|
|
|
|
*/
|
2015-01-16 23:52:18 +08:00
|
|
|
dd->rcd = kcalloc(dd->ctxtcnt, sizeof(*dd->rcd), GFP_KERNEL);
|
2016-11-03 22:44:18 +08:00
|
|
|
if (!dd->rcd)
|
2014-03-18 02:07:16 +08:00
|
|
|
return -ENOMEM;
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
/* create (one or more) kctxt */
|
|
|
|
for (i = 0; i < dd->first_user_ctxt; ++i) {
|
|
|
|
struct qib_pportdata *ppd;
|
|
|
|
struct qib_ctxtdata *rcd;
|
|
|
|
|
|
|
|
if (dd->skip_kctxt_mask & (1 << i))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
ppd = dd->pport + (i % dd->num_pports);
|
2013-05-29 00:57:33 +08:00
|
|
|
|
|
|
|
rcd = qib_create_ctxtdata(ppd, i, dd->assigned_node_id);
|
2010-05-24 12:44:54 +08:00
|
|
|
if (!rcd) {
|
2012-07-19 21:04:25 +08:00
|
|
|
qib_dev_err(dd,
|
|
|
|
"Unable to allocate ctxtdata for Kernel ctxt, failing\n");
|
2014-03-18 02:07:16 +08:00
|
|
|
kfree(dd->rcd);
|
|
|
|
dd->rcd = NULL;
|
|
|
|
return -ENOMEM;
|
2010-05-24 12:44:54 +08:00
|
|
|
}
|
|
|
|
rcd->pkeys[0] = QIB_DEFAULT_P_KEY;
|
|
|
|
rcd->seq_cnt = 1;
|
|
|
|
}
|
2014-03-18 02:07:16 +08:00
|
|
|
return 0;
|
2010-05-24 12:44:54 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Common code for user and kernel context setup.
|
|
|
|
*/
|
2013-05-29 00:57:33 +08:00
|
|
|
struct qib_ctxtdata *qib_create_ctxtdata(struct qib_pportdata *ppd, u32 ctxt,
|
|
|
|
int node_id)
|
2010-05-24 12:44:54 +08:00
|
|
|
{
|
|
|
|
struct qib_devdata *dd = ppd->dd;
|
|
|
|
struct qib_ctxtdata *rcd;
|
|
|
|
|
2013-05-29 00:57:33 +08:00
|
|
|
rcd = kzalloc_node(sizeof(*rcd), GFP_KERNEL, node_id);
|
2010-05-24 12:44:54 +08:00
|
|
|
if (rcd) {
|
|
|
|
INIT_LIST_HEAD(&rcd->qp_wait_list);
|
2013-05-29 00:57:33 +08:00
|
|
|
rcd->node_id = node_id;
|
2010-05-24 12:44:54 +08:00
|
|
|
rcd->ppd = ppd;
|
|
|
|
rcd->dd = dd;
|
|
|
|
rcd->cnt = 1;
|
|
|
|
rcd->ctxt = ctxt;
|
|
|
|
dd->rcd[ctxt] = rcd;
|
2013-06-16 05:07:03 +08:00
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
|
|
if (ctxt < dd->first_user_ctxt) { /* N/A for PSM contexts */
|
|
|
|
rcd->opstats = kzalloc_node(sizeof(*rcd->opstats),
|
|
|
|
GFP_KERNEL, node_id);
|
|
|
|
if (!rcd->opstats) {
|
|
|
|
kfree(rcd);
|
|
|
|
qib_dev_err(dd,
|
|
|
|
"Unable to allocate per ctxt stats buffer\n");
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
2010-05-24 12:44:54 +08:00
|
|
|
dd->f_init_ctxt(rcd);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* To avoid wasting a lot of memory, we allocate 32KB chunks
|
|
|
|
* of physically contiguous memory, advance through it until
|
|
|
|
* used up and then allocate more. Of course, we need
|
|
|
|
* memory to store those extra pointers, now. 32KB seems to
|
|
|
|
* be the most that is "safe" under memory pressure
|
|
|
|
* (creating large files and then copying them over
|
|
|
|
* NFS while doing lots of MPI jobs). The OOM killer can
|
|
|
|
* get invoked, even though we say we can sleep and this can
|
|
|
|
* cause significant system problems....
|
|
|
|
*/
|
|
|
|
rcd->rcvegrbuf_size = 0x8000;
|
|
|
|
rcd->rcvegrbufs_perchunk =
|
|
|
|
rcd->rcvegrbuf_size / dd->rcvegrbufsize;
|
|
|
|
rcd->rcvegrbuf_chunks = (rcd->rcvegrcnt +
|
|
|
|
rcd->rcvegrbufs_perchunk - 1) /
|
|
|
|
rcd->rcvegrbufs_perchunk;
|
2011-09-24 01:16:39 +08:00
|
|
|
rcd->rcvegrbufs_perchunk_shift =
|
|
|
|
ilog2(rcd->rcvegrbufs_perchunk);
|
2010-05-24 12:44:54 +08:00
|
|
|
}
|
|
|
|
return rcd;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Common code for initializing the physical port structure.
|
|
|
|
*/
|
2014-03-07 21:40:55 +08:00
|
|
|
int qib_init_pportdata(struct qib_pportdata *ppd, struct qib_devdata *dd,
|
2010-05-24 12:44:54 +08:00
|
|
|
u8 hw_pidx, u8 port)
|
|
|
|
{
|
2012-07-19 21:04:04 +08:00
|
|
|
int size;
|
2015-01-17 00:23:31 +08:00
|
|
|
|
2010-05-24 12:44:54 +08:00
|
|
|
ppd->dd = dd;
|
|
|
|
ppd->hw_pidx = hw_pidx;
|
|
|
|
ppd->port = port; /* IB port number, not index */
|
|
|
|
|
|
|
|
spin_lock_init(&ppd->sdma_lock);
|
|
|
|
spin_lock_init(&ppd->lflags_lock);
|
2014-03-07 21:40:55 +08:00
|
|
|
spin_lock_init(&ppd->cc_shadow_lock);
|
2010-05-24 12:44:54 +08:00
|
|
|
init_waitqueue_head(&ppd->state_wait);
|
|
|
|
|
2017-10-05 08:45:35 +08:00
|
|
|
timer_setup(&ppd->symerr_clear_timer, qib_clear_symerror_on_linkup, 0);
|
2012-07-19 21:03:56 +08:00
|
|
|
|
|
|
|
ppd->qib_wq = NULL;
|
2014-03-07 21:40:55 +08:00
|
|
|
ppd->ibport_data.pmastats =
|
|
|
|
alloc_percpu(struct qib_pma_counters);
|
|
|
|
if (!ppd->ibport_data.pmastats)
|
|
|
|
return -ENOMEM;
|
2016-01-23 04:56:02 +08:00
|
|
|
ppd->ibport_data.rvp.rc_acks = alloc_percpu(u64);
|
|
|
|
ppd->ibport_data.rvp.rc_qacks = alloc_percpu(u64);
|
|
|
|
ppd->ibport_data.rvp.rc_delayed_comp = alloc_percpu(u64);
|
|
|
|
if (!(ppd->ibport_data.rvp.rc_acks) ||
|
|
|
|
!(ppd->ibport_data.rvp.rc_qacks) ||
|
|
|
|
!(ppd->ibport_data.rvp.rc_delayed_comp))
|
|
|
|
return -ENOMEM;
|
2012-07-19 21:04:04 +08:00
|
|
|
|
|
|
|
if (qib_cc_table_size < IB_CCT_MIN_ENTRIES)
|
|
|
|
goto bail;
|
|
|
|
|
|
|
|
ppd->cc_supported_table_entries = min(max_t(int, qib_cc_table_size,
|
|
|
|
IB_CCT_MIN_ENTRIES), IB_CCT_ENTRIES*IB_CC_TABLE_CAP_DEFAULT);
|
|
|
|
|
|
|
|
ppd->cc_max_table_entries =
|
|
|
|
ppd->cc_supported_table_entries/IB_CCT_ENTRIES;
|
|
|
|
|
|
|
|
size = IB_CC_TABLE_CAP_DEFAULT * sizeof(struct ib_cc_table_entry)
|
|
|
|
* IB_CCT_ENTRIES;
|
|
|
|
ppd->ccti_entries = kzalloc(size, GFP_KERNEL);
|
2016-11-03 22:44:18 +08:00
|
|
|
if (!ppd->ccti_entries)
|
2012-07-19 21:04:04 +08:00
|
|
|
goto bail;
|
|
|
|
|
|
|
|
size = IB_CC_CCS_ENTRIES * sizeof(struct ib_cc_congestion_entry);
|
|
|
|
ppd->congestion_entries = kzalloc(size, GFP_KERNEL);
|
2016-11-03 22:44:18 +08:00
|
|
|
if (!ppd->congestion_entries)
|
2012-07-19 21:04:04 +08:00
|
|
|
goto bail_1;
|
|
|
|
|
|
|
|
size = sizeof(struct cc_table_shadow);
|
|
|
|
ppd->ccti_entries_shadow = kzalloc(size, GFP_KERNEL);
|
2016-11-03 22:44:18 +08:00
|
|
|
if (!ppd->ccti_entries_shadow)
|
2012-07-19 21:04:04 +08:00
|
|
|
goto bail_2;
|
|
|
|
|
|
|
|
size = sizeof(struct ib_cc_congestion_setting_attr);
|
|
|
|
ppd->congestion_entries_shadow = kzalloc(size, GFP_KERNEL);
|
2016-11-03 22:44:18 +08:00
|
|
|
if (!ppd->congestion_entries_shadow)
|
2012-07-19 21:04:04 +08:00
|
|
|
goto bail_3;
|
|
|
|
|
2014-03-07 21:40:55 +08:00
|
|
|
return 0;
|
2012-07-19 21:04:04 +08:00
|
|
|
|
|
|
|
bail_3:
|
|
|
|
kfree(ppd->ccti_entries_shadow);
|
|
|
|
ppd->ccti_entries_shadow = NULL;
|
|
|
|
bail_2:
|
|
|
|
kfree(ppd->congestion_entries);
|
|
|
|
ppd->congestion_entries = NULL;
|
|
|
|
bail_1:
|
|
|
|
kfree(ppd->ccti_entries);
|
|
|
|
ppd->ccti_entries = NULL;
|
|
|
|
bail:
|
|
|
|
/* User is intentionally disabling the congestion control agent */
|
|
|
|
if (!qib_cc_table_size)
|
2014-03-07 21:40:55 +08:00
|
|
|
return 0;
|
2012-07-19 21:04:04 +08:00
|
|
|
|
|
|
|
if (qib_cc_table_size < IB_CCT_MIN_ENTRIES) {
|
|
|
|
qib_cc_table_size = 0;
|
|
|
|
qib_dev_err(dd,
|
|
|
|
"Congestion Control table size %d less than minimum %d for port %d\n",
|
|
|
|
qib_cc_table_size, IB_CCT_MIN_ENTRIES, port);
|
|
|
|
}
|
|
|
|
|
|
|
|
qib_dev_err(dd, "Congestion Control Agent disabled for port %d\n",
|
|
|
|
port);
|
2014-03-07 21:40:55 +08:00
|
|
|
return 0;
|
2010-05-24 12:44:54 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static int init_pioavailregs(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
int ret, pidx;
|
|
|
|
u64 *status_page;
|
|
|
|
|
|
|
|
dd->pioavailregs_dma = dma_alloc_coherent(
|
|
|
|
&dd->pcidev->dev, PAGE_SIZE, &dd->pioavailregs_phys,
|
|
|
|
GFP_KERNEL);
|
|
|
|
if (!dd->pioavailregs_dma) {
|
2012-07-19 21:04:25 +08:00
|
|
|
qib_dev_err(dd,
|
|
|
|
"failed to allocate PIOavail reg area in memory\n");
|
2010-05-24 12:44:54 +08:00
|
|
|
ret = -ENOMEM;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We really want L2 cache aligned, but for current CPUs of
|
|
|
|
* interest, they are the same.
|
|
|
|
*/
|
|
|
|
status_page = (u64 *)
|
|
|
|
((char *) dd->pioavailregs_dma +
|
|
|
|
((2 * L1_CACHE_BYTES +
|
|
|
|
dd->pioavregs * sizeof(u64)) & ~L1_CACHE_BYTES));
|
|
|
|
/* device status comes first, for backwards compatibility */
|
|
|
|
dd->devstatusp = status_page;
|
|
|
|
*status_page++ = 0;
|
|
|
|
for (pidx = 0; pidx < dd->num_pports; ++pidx) {
|
|
|
|
dd->pport[pidx].statusp = status_page;
|
|
|
|
*status_page++ = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Setup buffer to hold freeze and other messages, accessible to
|
|
|
|
* apps, following statusp. This is per-unit, not per port.
|
|
|
|
*/
|
|
|
|
dd->freezemsg = (char *) status_page;
|
|
|
|
*dd->freezemsg = 0;
|
|
|
|
/* length of msg buffer is "whatever is left" */
|
|
|
|
ret = (char *) status_page - (char *) dd->pioavailregs_dma;
|
|
|
|
dd->freezelen = PAGE_SIZE - ret;
|
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
|
|
|
|
done:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* init_shadow_tids - allocate the shadow TID array
|
|
|
|
* @dd: the qlogic_ib device
|
|
|
|
*
|
|
|
|
* allocate the shadow TID array, so we can qib_munlock previous
|
|
|
|
* entries. It may make more sense to move the pageshadow to the
|
|
|
|
* ctxt data structure, so we only allocate memory for ctxts actually
|
|
|
|
* in use, since we at 8k per ctxt, now.
|
|
|
|
* We don't want failures here to prevent use of the driver/chip,
|
|
|
|
* so no return value.
|
|
|
|
*/
|
|
|
|
static void init_shadow_tids(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
struct page **pages;
|
|
|
|
dma_addr_t *addrs;
|
|
|
|
|
treewide: Use array_size() in vzalloc()
The vzalloc() function has no 2-factor argument form, so multiplication
factors need to be wrapped in array_size(). This patch replaces cases of:
vzalloc(a * b)
with:
vzalloc(array_size(a, b))
as well as handling cases of:
vzalloc(a * b * c)
with:
vzalloc(array3_size(a, b, c))
This does, however, attempt to ignore constant size factors like:
vzalloc(4 * 1024)
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(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
vzalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
vzalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
vzalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
vzalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
vzalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
vzalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
vzalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
vzalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
vzalloc(
- 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(
- sizeof(TYPE) * (COUNT_ID)
+ array_size(COUNT_ID, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(TYPE) * COUNT_ID
+ array_size(COUNT_ID, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(TYPE) * (COUNT_CONST)
+ array_size(COUNT_CONST, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(TYPE) * COUNT_CONST
+ array_size(COUNT_CONST, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(THING) * (COUNT_ID)
+ array_size(COUNT_ID, sizeof(THING))
, ...)
|
vzalloc(
- sizeof(THING) * COUNT_ID
+ array_size(COUNT_ID, sizeof(THING))
, ...)
|
vzalloc(
- sizeof(THING) * (COUNT_CONST)
+ array_size(COUNT_CONST, sizeof(THING))
, ...)
|
vzalloc(
- sizeof(THING) * COUNT_CONST
+ array_size(COUNT_CONST, sizeof(THING))
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
vzalloc(
- 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(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vzalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vzalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vzalloc(
- 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(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
vzalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
vzalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
vzalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
vzalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
vzalloc(
- 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(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc(
- 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(C1 * C2 * C3, ...)
|
vzalloc(
- 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(C1 * C2, ...)
|
vzalloc(
- E1 * E2
+ array_size(E1, E2)
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-13 05:27:37 +08:00
|
|
|
pages = vzalloc(array_size(sizeof(struct page *),
|
|
|
|
dd->cfgctxts * dd->rcvtidcnt));
|
2016-11-03 22:44:18 +08:00
|
|
|
if (!pages)
|
2010-05-24 12:44:54 +08:00
|
|
|
goto bail;
|
|
|
|
|
treewide: Use array_size() in vzalloc()
The vzalloc() function has no 2-factor argument form, so multiplication
factors need to be wrapped in array_size(). This patch replaces cases of:
vzalloc(a * b)
with:
vzalloc(array_size(a, b))
as well as handling cases of:
vzalloc(a * b * c)
with:
vzalloc(array3_size(a, b, c))
This does, however, attempt to ignore constant size factors like:
vzalloc(4 * 1024)
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(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
vzalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
vzalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
vzalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
vzalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
vzalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
vzalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
vzalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
vzalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
vzalloc(
- 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(
- sizeof(TYPE) * (COUNT_ID)
+ array_size(COUNT_ID, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(TYPE) * COUNT_ID
+ array_size(COUNT_ID, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(TYPE) * (COUNT_CONST)
+ array_size(COUNT_CONST, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(TYPE) * COUNT_CONST
+ array_size(COUNT_CONST, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(THING) * (COUNT_ID)
+ array_size(COUNT_ID, sizeof(THING))
, ...)
|
vzalloc(
- sizeof(THING) * COUNT_ID
+ array_size(COUNT_ID, sizeof(THING))
, ...)
|
vzalloc(
- sizeof(THING) * (COUNT_CONST)
+ array_size(COUNT_CONST, sizeof(THING))
, ...)
|
vzalloc(
- sizeof(THING) * COUNT_CONST
+ array_size(COUNT_CONST, sizeof(THING))
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
vzalloc(
- 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(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vzalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vzalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vzalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vzalloc(
- 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(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
vzalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
vzalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
vzalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
vzalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
vzalloc(
- 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(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vzalloc(
- 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(C1 * C2 * C3, ...)
|
vzalloc(
- 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(C1 * C2, ...)
|
vzalloc(
- E1 * E2
+ array_size(E1, E2)
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-13 05:27:37 +08:00
|
|
|
addrs = vzalloc(array_size(sizeof(dma_addr_t),
|
|
|
|
dd->cfgctxts * dd->rcvtidcnt));
|
2016-11-03 22:44:18 +08:00
|
|
|
if (!addrs)
|
2010-05-24 12:44:54 +08:00
|
|
|
goto bail_free;
|
|
|
|
|
|
|
|
dd->pageshadow = pages;
|
|
|
|
dd->physshadow = addrs;
|
|
|
|
return;
|
|
|
|
|
|
|
|
bail_free:
|
|
|
|
vfree(pages);
|
|
|
|
bail:
|
|
|
|
dd->pageshadow = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Do initialization for device that is only needed on
|
|
|
|
* first detect, not on resets.
|
|
|
|
*/
|
|
|
|
static int loadtime_init(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
if (((dd->revision >> QLOGIC_IB_R_SOFTWARE_SHIFT) &
|
|
|
|
QLOGIC_IB_R_SOFTWARE_MASK) != QIB_CHIP_SWVERSION) {
|
2012-07-19 21:04:25 +08:00
|
|
|
qib_dev_err(dd,
|
2017-07-03 17:23:47 +08:00
|
|
|
"Driver only handles version %d, chip swversion is %d (%llx), failing\n",
|
2012-07-19 21:04:25 +08:00
|
|
|
QIB_CHIP_SWVERSION,
|
|
|
|
(int)(dd->revision >>
|
2010-05-24 12:44:54 +08:00
|
|
|
QLOGIC_IB_R_SOFTWARE_SHIFT) &
|
2012-07-19 21:04:25 +08:00
|
|
|
QLOGIC_IB_R_SOFTWARE_MASK,
|
|
|
|
(unsigned long long) dd->revision);
|
2010-05-24 12:44:54 +08:00
|
|
|
ret = -ENOSYS;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (dd->revision & QLOGIC_IB_R_EMULATOR_MASK)
|
|
|
|
qib_devinfo(dd->pcidev, "%s", dd->boardversion);
|
|
|
|
|
|
|
|
spin_lock_init(&dd->pioavail_lock);
|
|
|
|
spin_lock_init(&dd->sendctrl_lock);
|
|
|
|
spin_lock_init(&dd->uctxt_lock);
|
|
|
|
spin_lock_init(&dd->qib_diag_trans_lock);
|
|
|
|
spin_lock_init(&dd->eep_st_lock);
|
|
|
|
mutex_init(&dd->eep_lock);
|
|
|
|
|
|
|
|
if (qib_mini_init)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
ret = init_pioavailregs(dd);
|
|
|
|
init_shadow_tids(dd);
|
|
|
|
|
|
|
|
qib_get_eeprom_info(dd);
|
|
|
|
|
|
|
|
/* setup time (don't start yet) to verify we got interrupt */
|
2017-10-05 08:45:35 +08:00
|
|
|
timer_setup(&dd->intrchk_timer, verify_interrupt, 0);
|
2010-05-24 12:44:54 +08:00
|
|
|
done:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* init_after_reset - re-initialize after a reset
|
|
|
|
* @dd: the qlogic_ib device
|
|
|
|
*
|
|
|
|
* sanity check at least some of the values after reset, and
|
2011-03-31 09:57:33 +08:00
|
|
|
* ensure no receive or transmit (explicitly, in case reset
|
2010-05-24 12:44:54 +08:00
|
|
|
* failed
|
|
|
|
*/
|
|
|
|
static int init_after_reset(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Ensure chip does no sends or receives, tail updates, or
|
|
|
|
* pioavail updates while we re-initialize. This is mostly
|
|
|
|
* for the driver data structures, not chip registers.
|
|
|
|
*/
|
|
|
|
for (i = 0; i < dd->num_pports; ++i) {
|
|
|
|
/*
|
|
|
|
* ctxt == -1 means "all contexts". Only really safe for
|
|
|
|
* _dis_abling things, as here.
|
|
|
|
*/
|
|
|
|
dd->f_rcvctrl(dd->pport + i, QIB_RCVCTRL_CTXT_DIS |
|
|
|
|
QIB_RCVCTRL_INTRAVAIL_DIS |
|
|
|
|
QIB_RCVCTRL_TAILUPD_DIS, -1);
|
|
|
|
/* Redundant across ports for some, but no big deal. */
|
|
|
|
dd->f_sendctrl(dd->pport + i, QIB_SENDCTRL_SEND_DIS |
|
|
|
|
QIB_SENDCTRL_AVAIL_DIS);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void enable_chip(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
u64 rcvmask;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Enable PIO send, and update of PIOavail regs to memory.
|
|
|
|
*/
|
|
|
|
for (i = 0; i < dd->num_pports; ++i)
|
|
|
|
dd->f_sendctrl(dd->pport + i, QIB_SENDCTRL_SEND_ENB |
|
|
|
|
QIB_SENDCTRL_AVAIL_ENB);
|
|
|
|
/*
|
|
|
|
* Enable kernel ctxts' receive and receive interrupt.
|
|
|
|
* Other ctxts done as user opens and inits them.
|
|
|
|
*/
|
|
|
|
rcvmask = QIB_RCVCTRL_CTXT_ENB | QIB_RCVCTRL_INTRAVAIL_ENB;
|
|
|
|
rcvmask |= (dd->flags & QIB_NODMA_RTAIL) ?
|
|
|
|
QIB_RCVCTRL_TAILUPD_DIS : QIB_RCVCTRL_TAILUPD_ENB;
|
|
|
|
for (i = 0; dd->rcd && i < dd->first_user_ctxt; ++i) {
|
|
|
|
struct qib_ctxtdata *rcd = dd->rcd[i];
|
|
|
|
|
|
|
|
if (rcd)
|
|
|
|
dd->f_rcvctrl(rcd->ppd, rcvmask, i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-10-05 08:45:35 +08:00
|
|
|
static void verify_interrupt(struct timer_list *t)
|
2010-05-24 12:44:54 +08:00
|
|
|
{
|
2017-10-05 08:45:35 +08:00
|
|
|
struct qib_devdata *dd = from_timer(dd, t, intrchk_timer);
|
2014-03-07 21:40:49 +08:00
|
|
|
u64 int_counter;
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
if (!dd)
|
|
|
|
return; /* being torn down */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we don't have a lid or any interrupts, let the user know and
|
|
|
|
* don't bother checking again.
|
|
|
|
*/
|
2014-03-07 21:40:49 +08:00
|
|
|
int_counter = qib_int_counter(dd) - dd->z_int_counter;
|
|
|
|
if (int_counter == 0) {
|
2010-05-24 12:44:54 +08:00
|
|
|
if (!dd->f_intr_fallback(dd))
|
2012-07-19 21:04:25 +08:00
|
|
|
dev_err(&dd->pcidev->dev,
|
|
|
|
"No interrupts detected, not usable.\n");
|
2010-05-24 12:44:54 +08:00
|
|
|
else /* re-arm the timer to see if fallback works */
|
|
|
|
mod_timer(&dd->intrchk_timer, jiffies + HZ/2);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void init_piobuf_state(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
int i, pidx;
|
|
|
|
u32 uctxts;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Ensure all buffers are free, and fifos empty. Buffers
|
|
|
|
* are common, so only do once for port 0.
|
|
|
|
*
|
|
|
|
* After enable and qib_chg_pioavailkernel so we can safely
|
|
|
|
* enable pioavail updates and PIOENABLE. After this, packets
|
|
|
|
* are ready and able to go out.
|
|
|
|
*/
|
|
|
|
dd->f_sendctrl(dd->pport, QIB_SENDCTRL_DISARM_ALL);
|
|
|
|
for (pidx = 0; pidx < dd->num_pports; ++pidx)
|
|
|
|
dd->f_sendctrl(dd->pport + pidx, QIB_SENDCTRL_FLUSH);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If not all sendbufs are used, add the one to each of the lower
|
|
|
|
* numbered contexts. pbufsctxt and lastctxt_piobuf are
|
|
|
|
* calculated in chip-specific code because it may cause some
|
|
|
|
* chip-specific adjustments to be made.
|
|
|
|
*/
|
|
|
|
uctxts = dd->cfgctxts - dd->first_user_ctxt;
|
|
|
|
dd->ctxts_extrabuf = dd->pbufsctxt ?
|
|
|
|
dd->lastctxt_piobuf - (dd->pbufsctxt * uctxts) : 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set up the shadow copies of the piobufavail registers,
|
|
|
|
* which we compare against the chip registers for now, and
|
|
|
|
* the in memory DMA'ed copies of the registers.
|
|
|
|
* By now pioavail updates to memory should have occurred, so
|
|
|
|
* copy them into our working/shadow registers; this is in
|
|
|
|
* case something went wrong with abort, but mostly to get the
|
|
|
|
* initial values of the generation bit correct.
|
|
|
|
*/
|
|
|
|
for (i = 0; i < dd->pioavregs; i++) {
|
|
|
|
__le64 tmp;
|
|
|
|
|
|
|
|
tmp = dd->pioavailregs_dma[i];
|
|
|
|
/*
|
|
|
|
* Don't need to worry about pioavailkernel here
|
|
|
|
* because we will call qib_chg_pioavailkernel() later
|
|
|
|
* in initialization, to busy out buffers as needed.
|
|
|
|
*/
|
|
|
|
dd->pioavailshadow[i] = le64_to_cpu(tmp);
|
|
|
|
}
|
|
|
|
while (i < ARRAY_SIZE(dd->pioavailshadow))
|
|
|
|
dd->pioavailshadow[i++] = 0; /* for debugging sanity */
|
|
|
|
|
|
|
|
/* after pioavailshadow is setup */
|
|
|
|
qib_chg_pioavailkernel(dd, 0, dd->piobcnt2k + dd->piobcnt4k,
|
|
|
|
TXCHK_CHG_TYPE_KERN, NULL);
|
|
|
|
dd->f_initvl15_bufs(dd);
|
|
|
|
}
|
|
|
|
|
2012-07-19 21:03:56 +08:00
|
|
|
/**
|
|
|
|
* qib_create_workqueues - create per port workqueues
|
|
|
|
* @dd: the qlogic_ib device
|
|
|
|
*/
|
|
|
|
static int qib_create_workqueues(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
int pidx;
|
|
|
|
struct qib_pportdata *ppd;
|
|
|
|
|
|
|
|
for (pidx = 0; pidx < dd->num_pports; ++pidx) {
|
|
|
|
ppd = dd->pport + pidx;
|
|
|
|
if (!ppd->qib_wq) {
|
|
|
|
char wq_name[8]; /* 3 + 2 + 1 + 1 + 1 */
|
2015-01-17 00:23:31 +08:00
|
|
|
|
2012-07-19 21:03:56 +08:00
|
|
|
snprintf(wq_name, sizeof(wq_name), "qib%d_%d",
|
|
|
|
dd->unit, pidx);
|
2016-08-16 02:08:47 +08:00
|
|
|
ppd->qib_wq = alloc_ordered_workqueue(wq_name,
|
|
|
|
WQ_MEM_RECLAIM);
|
2012-07-19 21:03:56 +08:00
|
|
|
if (!ppd->qib_wq)
|
|
|
|
goto wq_error;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
wq_error:
|
2012-07-19 21:04:25 +08:00
|
|
|
pr_err("create_singlethread_workqueue failed for port %d\n",
|
|
|
|
pidx + 1);
|
2012-07-19 21:03:56 +08:00
|
|
|
for (pidx = 0; pidx < dd->num_pports; ++pidx) {
|
|
|
|
ppd = dd->pport + pidx;
|
|
|
|
if (ppd->qib_wq) {
|
|
|
|
destroy_workqueue(ppd->qib_wq);
|
|
|
|
ppd->qib_wq = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
2014-03-07 21:40:55 +08:00
|
|
|
static void qib_free_pportdata(struct qib_pportdata *ppd)
|
|
|
|
{
|
|
|
|
free_percpu(ppd->ibport_data.pmastats);
|
2016-01-23 04:56:02 +08:00
|
|
|
free_percpu(ppd->ibport_data.rvp.rc_acks);
|
|
|
|
free_percpu(ppd->ibport_data.rvp.rc_qacks);
|
|
|
|
free_percpu(ppd->ibport_data.rvp.rc_delayed_comp);
|
2014-03-07 21:40:55 +08:00
|
|
|
ppd->ibport_data.pmastats = NULL;
|
|
|
|
}
|
|
|
|
|
2010-05-24 12:44:54 +08:00
|
|
|
/**
|
|
|
|
* qib_init - do the actual initialization sequence on the chip
|
|
|
|
* @dd: the qlogic_ib device
|
|
|
|
* @reinit: reinitializing, so don't allocate new memory
|
|
|
|
*
|
|
|
|
* Do the actual initialization sequence on the chip. This is done
|
|
|
|
* both from the init routine called from the PCI infrastructure, and
|
|
|
|
* when we reset the chip, or detect that it was reset internally,
|
|
|
|
* or it's administratively re-enabled.
|
|
|
|
*
|
|
|
|
* Memory allocation here and in called routines is only done in
|
|
|
|
* the first case (reinit == 0). We have to be careful, because even
|
|
|
|
* without memory allocation, we need to re-write all the chip registers
|
|
|
|
* TIDs, etc. after the reset or enable has completed.
|
|
|
|
*/
|
|
|
|
int qib_init(struct qib_devdata *dd, int reinit)
|
|
|
|
{
|
|
|
|
int ret = 0, pidx, lastfail = 0;
|
|
|
|
u32 portok = 0;
|
|
|
|
unsigned i;
|
|
|
|
struct qib_ctxtdata *rcd;
|
|
|
|
struct qib_pportdata *ppd;
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
/* Set linkstate to unknown, so we can watch for a transition. */
|
|
|
|
for (pidx = 0; pidx < dd->num_pports; ++pidx) {
|
|
|
|
ppd = dd->pport + pidx;
|
|
|
|
spin_lock_irqsave(&ppd->lflags_lock, flags);
|
|
|
|
ppd->lflags &= ~(QIBL_LINKACTIVE | QIBL_LINKARMED |
|
|
|
|
QIBL_LINKDOWN | QIBL_LINKINIT |
|
|
|
|
QIBL_LINKV);
|
|
|
|
spin_unlock_irqrestore(&ppd->lflags_lock, flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (reinit)
|
|
|
|
ret = init_after_reset(dd);
|
|
|
|
else
|
|
|
|
ret = loadtime_init(dd);
|
|
|
|
if (ret)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
/* Bypass most chip-init, to get to device creation */
|
|
|
|
if (qib_mini_init)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
ret = dd->f_late_initreg(dd);
|
|
|
|
if (ret)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
/* dd->rcd can be NULL if early init failed */
|
|
|
|
for (i = 0; dd->rcd && i < dd->first_user_ctxt; ++i) {
|
|
|
|
/*
|
|
|
|
* Set up the (kernel) rcvhdr queue and egr TIDs. If doing
|
|
|
|
* re-init, the simplest way to handle this is to free
|
|
|
|
* existing, and re-allocate.
|
|
|
|
* Need to re-create rest of ctxt 0 ctxtdata as well.
|
|
|
|
*/
|
|
|
|
rcd = dd->rcd[i];
|
|
|
|
if (!rcd)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
lastfail = qib_create_rcvhdrq(dd, rcd);
|
|
|
|
if (!lastfail)
|
|
|
|
lastfail = qib_setup_eagerbufs(rcd);
|
2018-03-04 00:24:57 +08:00
|
|
|
if (lastfail)
|
2012-07-19 21:04:25 +08:00
|
|
|
qib_dev_err(dd,
|
|
|
|
"failed to allocate kernel ctxt's rcvhdrq and/or egr bufs\n");
|
2010-05-24 12:44:54 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
for (pidx = 0; pidx < dd->num_pports; ++pidx) {
|
|
|
|
int mtu;
|
2015-01-17 00:23:31 +08:00
|
|
|
|
2010-05-24 12:44:54 +08:00
|
|
|
if (lastfail)
|
|
|
|
ret = lastfail;
|
|
|
|
ppd = dd->pport + pidx;
|
|
|
|
mtu = ib_mtu_enum_to_int(qib_ibmtu);
|
|
|
|
if (mtu == -1) {
|
|
|
|
mtu = QIB_DEFAULT_MTU;
|
|
|
|
qib_ibmtu = 0; /* don't leave invalid value */
|
|
|
|
}
|
|
|
|
/* set max we can ever have for this driver load */
|
|
|
|
ppd->init_ibmaxlen = min(mtu > 2048 ?
|
|
|
|
dd->piosize4k : dd->piosize2k,
|
|
|
|
dd->rcvegrbufsize +
|
|
|
|
(dd->rcvhdrentsize << 2));
|
|
|
|
/*
|
|
|
|
* Have to initialize ibmaxlen, but this will normally
|
|
|
|
* change immediately in qib_set_mtu().
|
|
|
|
*/
|
|
|
|
ppd->ibmaxlen = ppd->init_ibmaxlen;
|
|
|
|
qib_set_mtu(ppd, mtu);
|
|
|
|
|
|
|
|
spin_lock_irqsave(&ppd->lflags_lock, flags);
|
|
|
|
ppd->lflags |= QIBL_IB_LINK_DISABLED;
|
|
|
|
spin_unlock_irqrestore(&ppd->lflags_lock, flags);
|
|
|
|
|
|
|
|
lastfail = dd->f_bringup_serdes(ppd);
|
|
|
|
if (lastfail) {
|
|
|
|
qib_devinfo(dd->pcidev,
|
|
|
|
"Failed to bringup IB port %u\n", ppd->port);
|
|
|
|
lastfail = -ENETDOWN;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
portok++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!portok) {
|
|
|
|
/* none of the ports initialized */
|
|
|
|
if (!ret && lastfail)
|
|
|
|
ret = lastfail;
|
|
|
|
else if (!ret)
|
|
|
|
ret = -ENETDOWN;
|
|
|
|
/* but continue on, so we can debug cause */
|
|
|
|
}
|
|
|
|
|
|
|
|
enable_chip(dd);
|
|
|
|
|
|
|
|
init_piobuf_state(dd);
|
|
|
|
|
|
|
|
done:
|
|
|
|
if (!ret) {
|
|
|
|
/* chip is OK for user apps; mark it as initialized */
|
|
|
|
for (pidx = 0; pidx < dd->num_pports; ++pidx) {
|
|
|
|
ppd = dd->pport + pidx;
|
|
|
|
/*
|
|
|
|
* Set status even if port serdes is not initialized
|
|
|
|
* so that diags will work.
|
|
|
|
*/
|
|
|
|
*ppd->statusp |= QIB_STATUS_CHIP_PRESENT |
|
|
|
|
QIB_STATUS_INITTED;
|
|
|
|
if (!ppd->link_speed_enabled)
|
|
|
|
continue;
|
|
|
|
if (dd->flags & QIB_HAS_SEND_DMA)
|
|
|
|
ret = qib_setup_sdma(ppd);
|
2017-10-05 08:45:35 +08:00
|
|
|
timer_setup(&ppd->hol_timer, qib_hol_event, 0);
|
2010-05-24 12:44:54 +08:00
|
|
|
ppd->hol_state = QIB_HOL_UP;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* now we can enable all interrupts from the chip */
|
|
|
|
dd->f_set_intr_state(dd, 1);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Setup to verify we get an interrupt, and fallback
|
|
|
|
* to an alternate if necessary and possible.
|
|
|
|
*/
|
|
|
|
mod_timer(&dd->intrchk_timer, jiffies + HZ/2);
|
|
|
|
/* start stats retrieval timer */
|
|
|
|
mod_timer(&dd->stats_timer, jiffies + HZ * ACTIVITY_TIMER);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* if ret is non-zero, we probably should do some cleanup here... */
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* These next two routines are placeholders in case we don't have per-arch
|
|
|
|
* code for controlling write combining. If explicit control of write
|
|
|
|
* combining is not available, performance will probably be awful.
|
|
|
|
*/
|
|
|
|
|
|
|
|
int __attribute__((weak)) qib_enable_wc(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
return -EOPNOTSUPP;
|
|
|
|
}
|
|
|
|
|
|
|
|
void __attribute__((weak)) qib_disable_wc(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
struct qib_devdata *qib_lookup(int unit)
|
|
|
|
{
|
2019-02-21 08:21:00 +08:00
|
|
|
return xa_load(&qib_dev_table, unit);
|
2010-05-24 12:44:54 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Stop the timers during unit shutdown, or after an error late
|
|
|
|
* in initialization.
|
|
|
|
*/
|
|
|
|
static void qib_stop_timers(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
struct qib_pportdata *ppd;
|
|
|
|
int pidx;
|
|
|
|
|
2017-10-05 08:45:35 +08:00
|
|
|
if (dd->stats_timer.function)
|
2010-05-24 12:44:54 +08:00
|
|
|
del_timer_sync(&dd->stats_timer);
|
2017-10-05 08:45:35 +08:00
|
|
|
if (dd->intrchk_timer.function)
|
2010-05-24 12:44:54 +08:00
|
|
|
del_timer_sync(&dd->intrchk_timer);
|
|
|
|
for (pidx = 0; pidx < dd->num_pports; ++pidx) {
|
|
|
|
ppd = dd->pport + pidx;
|
2017-10-05 08:45:35 +08:00
|
|
|
if (ppd->hol_timer.function)
|
2010-05-24 12:44:54 +08:00
|
|
|
del_timer_sync(&ppd->hol_timer);
|
2017-10-05 08:45:35 +08:00
|
|
|
if (ppd->led_override_timer.function) {
|
2010-05-24 12:44:54 +08:00
|
|
|
del_timer_sync(&ppd->led_override_timer);
|
|
|
|
atomic_set(&ppd->led_override_timer_active, 0);
|
|
|
|
}
|
2017-10-05 08:45:35 +08:00
|
|
|
if (ppd->symerr_clear_timer.function)
|
2010-05-24 12:44:54 +08:00
|
|
|
del_timer_sync(&ppd->symerr_clear_timer);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qib_shutdown_device - shut down a device
|
|
|
|
* @dd: the qlogic_ib device
|
|
|
|
*
|
|
|
|
* This is called to make the device quiet when we are about to
|
|
|
|
* unload the driver, and also when the device is administratively
|
|
|
|
* disabled. It does not free any data structures.
|
|
|
|
* Everything it does has to be setup again by qib_init(dd, 1)
|
|
|
|
*/
|
|
|
|
static void qib_shutdown_device(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
struct qib_pportdata *ppd;
|
|
|
|
unsigned pidx;
|
|
|
|
|
2018-05-02 21:43:15 +08:00
|
|
|
if (dd->flags & QIB_SHUTDOWN)
|
|
|
|
return;
|
|
|
|
dd->flags |= QIB_SHUTDOWN;
|
|
|
|
|
2010-05-24 12:44:54 +08:00
|
|
|
for (pidx = 0; pidx < dd->num_pports; ++pidx) {
|
|
|
|
ppd = dd->pport + pidx;
|
|
|
|
|
|
|
|
spin_lock_irq(&ppd->lflags_lock);
|
|
|
|
ppd->lflags &= ~(QIBL_LINKDOWN | QIBL_LINKINIT |
|
|
|
|
QIBL_LINKARMED | QIBL_LINKACTIVE |
|
|
|
|
QIBL_LINKV);
|
|
|
|
spin_unlock_irq(&ppd->lflags_lock);
|
|
|
|
*ppd->statusp &= ~(QIB_STATUS_IB_CONF | QIB_STATUS_IB_READY);
|
|
|
|
}
|
|
|
|
dd->flags &= ~QIB_INITTED;
|
|
|
|
|
|
|
|
/* mask interrupts, but not errors */
|
|
|
|
dd->f_set_intr_state(dd, 0);
|
|
|
|
|
|
|
|
for (pidx = 0; pidx < dd->num_pports; ++pidx) {
|
|
|
|
ppd = dd->pport + pidx;
|
|
|
|
dd->f_rcvctrl(ppd, QIB_RCVCTRL_TAILUPD_DIS |
|
|
|
|
QIB_RCVCTRL_CTXT_DIS |
|
|
|
|
QIB_RCVCTRL_INTRAVAIL_DIS |
|
|
|
|
QIB_RCVCTRL_PKEY_ENB, -1);
|
|
|
|
/*
|
|
|
|
* Gracefully stop all sends allowing any in progress to
|
|
|
|
* trickle out first.
|
|
|
|
*/
|
|
|
|
dd->f_sendctrl(ppd, QIB_SENDCTRL_CLEAR);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Enough for anything that's going to trickle out to have actually
|
|
|
|
* done so.
|
|
|
|
*/
|
|
|
|
udelay(20);
|
|
|
|
|
|
|
|
for (pidx = 0; pidx < dd->num_pports; ++pidx) {
|
|
|
|
ppd = dd->pport + pidx;
|
|
|
|
dd->f_setextled(ppd, 0); /* make sure LEDs are off */
|
|
|
|
|
|
|
|
if (dd->flags & QIB_HAS_SEND_DMA)
|
|
|
|
qib_teardown_sdma(ppd);
|
|
|
|
|
|
|
|
dd->f_sendctrl(ppd, QIB_SENDCTRL_AVAIL_DIS |
|
|
|
|
QIB_SENDCTRL_SEND_DIS);
|
|
|
|
/*
|
|
|
|
* Clear SerdesEnable.
|
|
|
|
* We can't count on interrupts since we are stopping.
|
|
|
|
*/
|
|
|
|
dd->f_quiet_serdes(ppd);
|
2012-07-19 21:03:56 +08:00
|
|
|
|
|
|
|
if (ppd->qib_wq) {
|
|
|
|
destroy_workqueue(ppd->qib_wq);
|
|
|
|
ppd->qib_wq = NULL;
|
|
|
|
}
|
2014-03-07 21:40:55 +08:00
|
|
|
qib_free_pportdata(ppd);
|
2010-05-24 12:44:54 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qib_free_ctxtdata - free a context's allocated data
|
|
|
|
* @dd: the qlogic_ib device
|
|
|
|
* @rcd: the ctxtdata structure
|
|
|
|
*
|
|
|
|
* free up any allocated data for a context
|
|
|
|
* This should not touch anything that would affect a simultaneous
|
|
|
|
* re-allocation of context data, because it is called after qib_mutex
|
|
|
|
* is released (and can be called from reinit as well).
|
|
|
|
* It should never change any chip state, or global driver state.
|
|
|
|
*/
|
|
|
|
void qib_free_ctxtdata(struct qib_devdata *dd, struct qib_ctxtdata *rcd)
|
|
|
|
{
|
|
|
|
if (!rcd)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (rcd->rcvhdrq) {
|
|
|
|
dma_free_coherent(&dd->pcidev->dev, rcd->rcvhdrq_size,
|
|
|
|
rcd->rcvhdrq, rcd->rcvhdrq_phys);
|
|
|
|
rcd->rcvhdrq = NULL;
|
|
|
|
if (rcd->rcvhdrtail_kvaddr) {
|
|
|
|
dma_free_coherent(&dd->pcidev->dev, PAGE_SIZE,
|
|
|
|
rcd->rcvhdrtail_kvaddr,
|
|
|
|
rcd->rcvhdrqtailaddr_phys);
|
|
|
|
rcd->rcvhdrtail_kvaddr = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (rcd->rcvegrbuf) {
|
|
|
|
unsigned e;
|
|
|
|
|
|
|
|
for (e = 0; e < rcd->rcvegrbuf_chunks; e++) {
|
|
|
|
void *base = rcd->rcvegrbuf[e];
|
|
|
|
size_t size = rcd->rcvegrbuf_size;
|
|
|
|
|
|
|
|
dma_free_coherent(&dd->pcidev->dev, size,
|
|
|
|
base, rcd->rcvegrbuf_phys[e]);
|
|
|
|
}
|
|
|
|
kfree(rcd->rcvegrbuf);
|
|
|
|
rcd->rcvegrbuf = NULL;
|
|
|
|
kfree(rcd->rcvegrbuf_phys);
|
|
|
|
rcd->rcvegrbuf_phys = NULL;
|
|
|
|
rcd->rcvegrbuf_chunks = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
kfree(rcd->tid_pg_list);
|
|
|
|
vfree(rcd->user_event_mask);
|
|
|
|
vfree(rcd->subctxt_uregbase);
|
|
|
|
vfree(rcd->subctxt_rcvegrbuf);
|
|
|
|
vfree(rcd->subctxt_rcvhdr_base);
|
2013-06-16 05:07:03 +08:00
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
|
|
kfree(rcd->opstats);
|
|
|
|
rcd->opstats = NULL;
|
|
|
|
#endif
|
2010-05-24 12:44:54 +08:00
|
|
|
kfree(rcd);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Perform a PIO buffer bandwidth write test, to verify proper system
|
|
|
|
* configuration. Even when all the setup calls work, occasionally
|
|
|
|
* BIOS or other issues can prevent write combining from working, or
|
|
|
|
* can cause other bandwidth problems to the chip.
|
|
|
|
*
|
|
|
|
* This test simply writes the same buffer over and over again, and
|
|
|
|
* measures close to the peak bandwidth to the chip (not testing
|
|
|
|
* data bandwidth to the wire). On chips that use an address-based
|
|
|
|
* trigger to send packets to the wire, this is easy. On chips that
|
|
|
|
* use a count to trigger, we want to make sure that the packet doesn't
|
|
|
|
* go out on the wire, or trigger flow control checks.
|
|
|
|
*/
|
|
|
|
static void qib_verify_pioperf(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
u32 pbnum, cnt, lcnt;
|
|
|
|
u32 __iomem *piobuf;
|
|
|
|
u32 *addr;
|
|
|
|
u64 msecs, emsecs;
|
|
|
|
|
|
|
|
piobuf = dd->f_getsendbuf(dd->pport, 0ULL, &pbnum);
|
|
|
|
if (!piobuf) {
|
|
|
|
qib_devinfo(dd->pcidev,
|
|
|
|
"No PIObufs for checking perf, skipping\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Enough to give us a reasonable test, less than piobuf size, and
|
|
|
|
* likely multiple of store buffer length.
|
|
|
|
*/
|
|
|
|
cnt = 1024;
|
|
|
|
|
|
|
|
addr = vmalloc(cnt);
|
2016-11-03 22:44:18 +08:00
|
|
|
if (!addr)
|
2010-05-24 12:44:54 +08:00
|
|
|
goto done;
|
|
|
|
|
|
|
|
preempt_disable(); /* we want reasonably accurate elapsed time */
|
|
|
|
msecs = 1 + jiffies_to_msecs(jiffies);
|
|
|
|
for (lcnt = 0; lcnt < 10000U; lcnt++) {
|
|
|
|
/* wait until we cross msec boundary */
|
|
|
|
if (jiffies_to_msecs(jiffies) >= msecs)
|
|
|
|
break;
|
|
|
|
udelay(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
dd->f_set_armlaunch(dd, 0);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* length 0, no dwords actually sent
|
|
|
|
*/
|
|
|
|
writeq(0, piobuf);
|
|
|
|
qib_flush_wc();
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is only roughly accurate, since even with preempt we
|
|
|
|
* still take interrupts that could take a while. Running for
|
|
|
|
* >= 5 msec seems to get us "close enough" to accurate values.
|
|
|
|
*/
|
|
|
|
msecs = jiffies_to_msecs(jiffies);
|
|
|
|
for (emsecs = lcnt = 0; emsecs <= 5UL; lcnt++) {
|
|
|
|
qib_pio_copy(piobuf + 64, addr, cnt >> 2);
|
|
|
|
emsecs = jiffies_to_msecs(jiffies) - msecs;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* 1 GiB/sec, slightly over IB SDR line rate */
|
|
|
|
if (lcnt < (emsecs * 1024U))
|
|
|
|
qib_dev_err(dd,
|
2012-07-19 21:04:25 +08:00
|
|
|
"Performance problem: bandwidth to PIO buffers is only %u MiB/sec\n",
|
2010-05-24 12:44:54 +08:00
|
|
|
lcnt / (u32) emsecs);
|
|
|
|
|
|
|
|
preempt_enable();
|
|
|
|
|
|
|
|
vfree(addr);
|
|
|
|
|
|
|
|
done:
|
|
|
|
/* disarm piobuf, so it's available again */
|
|
|
|
dd->f_sendctrl(dd->pport, QIB_SENDCTRL_DISARM_BUF(pbnum));
|
|
|
|
qib_sendbuf_done(dd, pbnum);
|
|
|
|
dd->f_set_armlaunch(dd, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
void qib_free_devdata(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
|
2019-02-21 08:21:00 +08:00
|
|
|
xa_lock_irqsave(&qib_dev_table, flags);
|
|
|
|
__xa_erase(&qib_dev_table, dd->unit);
|
|
|
|
xa_unlock_irqrestore(&qib_dev_table, flags);
|
2010-05-24 12:44:54 +08:00
|
|
|
|
2013-06-16 05:07:03 +08:00
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
|
|
qib_dbg_ibdev_exit(&dd->verbs_dev);
|
|
|
|
#endif
|
2014-03-07 21:40:49 +08:00
|
|
|
free_percpu(dd->int_counter);
|
2016-04-20 21:05:24 +08:00
|
|
|
rvt_dealloc_device(&dd->verbs_dev.rdi);
|
2010-05-24 12:44:54 +08:00
|
|
|
}
|
|
|
|
|
2014-03-07 21:40:49 +08:00
|
|
|
u64 qib_int_counter(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
int cpu;
|
|
|
|
u64 int_counter = 0;
|
|
|
|
|
|
|
|
for_each_possible_cpu(cpu)
|
|
|
|
int_counter += *per_cpu_ptr(dd->int_counter, cpu);
|
|
|
|
return int_counter;
|
|
|
|
}
|
|
|
|
|
|
|
|
u64 qib_sps_ints(void)
|
|
|
|
{
|
2019-02-21 08:21:00 +08:00
|
|
|
unsigned long index, flags;
|
2014-03-07 21:40:49 +08:00
|
|
|
struct qib_devdata *dd;
|
|
|
|
u64 sps_ints = 0;
|
|
|
|
|
2019-02-21 08:21:00 +08:00
|
|
|
xa_lock_irqsave(&qib_dev_table, flags);
|
|
|
|
xa_for_each(&qib_dev_table, index, dd) {
|
2014-03-07 21:40:49 +08:00
|
|
|
sps_ints += qib_int_counter(dd);
|
|
|
|
}
|
2019-02-21 08:21:00 +08:00
|
|
|
xa_unlock_irqrestore(&qib_dev_table, flags);
|
2014-03-07 21:40:49 +08:00
|
|
|
return sps_ints;
|
|
|
|
}
|
|
|
|
|
2010-05-24 12:44:54 +08:00
|
|
|
/*
|
|
|
|
* Allocate our primary per-unit data structure. Must be done via verbs
|
|
|
|
* allocator, because the verbs cleanup process both does cleanup and
|
|
|
|
* free of the data structure.
|
|
|
|
* "extra" is for chip-specific data.
|
|
|
|
*/
|
|
|
|
struct qib_devdata *qib_alloc_devdata(struct pci_dev *pdev, size_t extra)
|
|
|
|
{
|
|
|
|
struct qib_devdata *dd;
|
2016-01-23 05:07:23 +08:00
|
|
|
int ret, nports;
|
2010-05-24 12:44:54 +08:00
|
|
|
|
2016-01-23 05:07:23 +08:00
|
|
|
/* extra is * number of ports */
|
|
|
|
nports = extra / sizeof(struct qib_pportdata);
|
|
|
|
dd = (struct qib_devdata *)rvt_alloc_device(sizeof(*dd) + extra,
|
|
|
|
nports);
|
2014-03-07 21:32:31 +08:00
|
|
|
if (!dd)
|
|
|
|
return ERR_PTR(-ENOMEM);
|
2010-05-24 12:44:54 +08:00
|
|
|
|
2019-02-21 08:21:00 +08:00
|
|
|
ret = xa_alloc_irq(&qib_dev_table, &dd->unit, dd, xa_limit_32b,
|
|
|
|
GFP_KERNEL);
|
2010-05-24 12:44:54 +08:00
|
|
|
if (ret < 0) {
|
|
|
|
qib_early_err(&pdev->dev,
|
|
|
|
"Could not allocate unit ID: error %d\n", -ret);
|
|
|
|
goto bail;
|
|
|
|
}
|
2017-12-19 11:56:37 +08:00
|
|
|
rvt_set_ibdev_name(&dd->verbs_dev.rdi, "%s%d", "qib", dd->unit);
|
|
|
|
|
2014-03-07 21:40:49 +08:00
|
|
|
dd->int_counter = alloc_percpu(u64);
|
|
|
|
if (!dd->int_counter) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
qib_early_err(&pdev->dev,
|
|
|
|
"Could not allocate per-cpu int_counter\n");
|
|
|
|
goto bail;
|
|
|
|
}
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
if (!qib_cpulist_count) {
|
|
|
|
u32 count = num_online_cpus();
|
2015-01-17 00:23:31 +08:00
|
|
|
|
treewide: kzalloc() -> kcalloc()
The kzalloc() function has a 2-factor argument form, kcalloc(). This
patch replaces cases of:
kzalloc(a * b, gfp)
with:
kcalloc(a * b, gfp)
as well as handling cases of:
kzalloc(a * b * c, gfp)
with:
kzalloc(array3_size(a, b, c), gfp)
as it's slightly less ugly than:
kzalloc_array(array_size(a, b), c, gfp)
This does, however, attempt to ignore constant size factors like:
kzalloc(4 * 1024, gfp)
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;
@@
(
kzalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kzalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kzalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kzalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kzalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kzalloc(
- 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;
@@
(
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kzalloc
+ kcalloc
(
- SIZE * COUNT
+ COUNT, SIZE
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
kzalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- 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;
@@
(
kzalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kzalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kzalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kzalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kzalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kzalloc(
- 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;
@@
(
kzalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- 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;
@@
(
kzalloc(C1 * C2 * C3, ...)
|
kzalloc(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants,
// keeping sizeof() as the second factor argument.
@@
expression THING, E1, E2;
type TYPE;
constant C1, C2, C3;
@@
(
kzalloc(sizeof(THING) * C2, ...)
|
kzalloc(sizeof(TYPE) * C2, ...)
|
kzalloc(C1 * C2 * C3, ...)
|
kzalloc(C1 * C2, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- (E1) * E2
+ E1, E2
, ...)
|
- kzalloc
+ kcalloc
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kzalloc
+ kcalloc
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-13 05:03:40 +08:00
|
|
|
qib_cpulist = kcalloc(BITS_TO_LONGS(count), sizeof(long),
|
|
|
|
GFP_KERNEL);
|
2010-05-24 12:44:54 +08:00
|
|
|
if (qib_cpulist)
|
|
|
|
qib_cpulist_count = count;
|
|
|
|
}
|
2014-03-07 21:32:31 +08:00
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
|
|
qib_dbg_ibdev_init(&dd->verbs_dev);
|
|
|
|
#endif
|
2010-05-24 12:44:54 +08:00
|
|
|
return dd;
|
2014-03-07 21:32:31 +08:00
|
|
|
bail:
|
|
|
|
if (!list_empty(&dd->list))
|
|
|
|
list_del_init(&dd->list);
|
2016-04-20 21:05:24 +08:00
|
|
|
rvt_dealloc_device(&dd->verbs_dev.rdi);
|
2015-01-16 23:52:18 +08:00
|
|
|
return ERR_PTR(ret);
|
2010-05-24 12:44:54 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Called from freeze mode handlers, and from PCI error
|
|
|
|
* reporting code. Should be paranoid about state of
|
|
|
|
* system and data structures.
|
|
|
|
*/
|
|
|
|
void qib_disable_after_error(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
if (dd->flags & QIB_INITTED) {
|
|
|
|
u32 pidx;
|
|
|
|
|
|
|
|
dd->flags &= ~QIB_INITTED;
|
|
|
|
if (dd->pport)
|
|
|
|
for (pidx = 0; pidx < dd->num_pports; ++pidx) {
|
|
|
|
struct qib_pportdata *ppd;
|
|
|
|
|
|
|
|
ppd = dd->pport + pidx;
|
|
|
|
if (dd->flags & QIB_PRESENT) {
|
|
|
|
qib_set_linkstate(ppd,
|
|
|
|
QIB_IB_LINKDOWN_DISABLE);
|
|
|
|
dd->f_setextled(ppd, 0);
|
|
|
|
}
|
|
|
|
*ppd->statusp &= ~QIB_STATUS_IB_READY;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Mark as having had an error for driver, and also
|
|
|
|
* for /sys and status word mapped to user programs.
|
|
|
|
* This marks unit as not usable, until reset.
|
|
|
|
*/
|
|
|
|
if (dd->devstatusp)
|
|
|
|
*dd->devstatusp |= QIB_STATUS_HWERROR;
|
|
|
|
}
|
|
|
|
|
2012-12-22 07:08:40 +08:00
|
|
|
static void qib_remove_one(struct pci_dev *);
|
|
|
|
static int qib_init_one(struct pci_dev *, const struct pci_device_id *);
|
2018-05-02 21:43:15 +08:00
|
|
|
static void qib_shutdown_one(struct pci_dev *);
|
2010-05-24 12:44:54 +08:00
|
|
|
|
2013-03-15 02:13:41 +08:00
|
|
|
#define DRIVER_LOAD_MSG "Intel " QIB_DRV_NAME " loaded: "
|
2010-05-24 12:44:54 +08:00
|
|
|
#define PFX QIB_DRV_NAME ": "
|
|
|
|
|
2014-08-08 21:56:03 +08:00
|
|
|
static const struct pci_device_id qib_pci_tbl[] = {
|
2010-05-24 12:44:54 +08:00
|
|
|
{ PCI_DEVICE(PCI_VENDOR_ID_PATHSCALE, PCI_DEVICE_ID_QLOGIC_IB_6120) },
|
|
|
|
{ PCI_DEVICE(PCI_VENDOR_ID_QLOGIC, PCI_DEVICE_ID_QLOGIC_IB_7220) },
|
|
|
|
{ PCI_DEVICE(PCI_VENDOR_ID_QLOGIC, PCI_DEVICE_ID_QLOGIC_IB_7322) },
|
|
|
|
{ 0, }
|
|
|
|
};
|
|
|
|
|
|
|
|
MODULE_DEVICE_TABLE(pci, qib_pci_tbl);
|
|
|
|
|
2013-08-08 02:47:38 +08:00
|
|
|
static struct pci_driver qib_driver = {
|
2010-05-24 12:44:54 +08:00
|
|
|
.name = QIB_DRV_NAME,
|
|
|
|
.probe = qib_init_one,
|
2012-12-22 07:08:40 +08:00
|
|
|
.remove = qib_remove_one,
|
2018-05-02 21:43:15 +08:00
|
|
|
.shutdown = qib_shutdown_one,
|
2010-05-24 12:44:54 +08:00
|
|
|
.id_table = qib_pci_tbl,
|
|
|
|
.err_handler = &qib_pci_err_handler,
|
|
|
|
};
|
|
|
|
|
2013-05-31 06:25:25 +08:00
|
|
|
#ifdef CONFIG_INFINIBAND_QIB_DCA
|
|
|
|
|
|
|
|
static int qib_notify_dca(struct notifier_block *, unsigned long, void *);
|
|
|
|
static struct notifier_block dca_notifier = {
|
|
|
|
.notifier_call = qib_notify_dca,
|
|
|
|
.next = NULL,
|
|
|
|
.priority = 0
|
|
|
|
};
|
|
|
|
|
|
|
|
static int qib_notify_dca_device(struct device *device, void *data)
|
|
|
|
{
|
|
|
|
struct qib_devdata *dd = dev_get_drvdata(device);
|
|
|
|
unsigned long event = *(unsigned long *)data;
|
|
|
|
|
|
|
|
return dd->f_notify_dca(dd, event);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int qib_notify_dca(struct notifier_block *nb, unsigned long event,
|
|
|
|
void *p)
|
|
|
|
{
|
|
|
|
int rval;
|
|
|
|
|
|
|
|
rval = driver_for_each_device(&qib_driver.driver, NULL,
|
|
|
|
&event, qib_notify_dca_device);
|
|
|
|
return rval ? NOTIFY_BAD : NOTIFY_DONE;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2010-05-24 12:44:54 +08:00
|
|
|
/*
|
|
|
|
* Do all the generic driver unit- and chip-independent memory
|
|
|
|
* allocation and initialization.
|
|
|
|
*/
|
2014-05-30 03:46:09 +08:00
|
|
|
static int __init qib_ib_init(void)
|
2010-05-24 12:44:54 +08:00
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = qib_dev_init();
|
|
|
|
if (ret)
|
|
|
|
goto bail;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* These must be called before the driver is registered with
|
|
|
|
* the PCI subsystem.
|
|
|
|
*/
|
2013-05-31 06:25:25 +08:00
|
|
|
#ifdef CONFIG_INFINIBAND_QIB_DCA
|
|
|
|
dca_register_notify(&dca_notifier);
|
2013-06-16 05:07:03 +08:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
|
|
qib_dbg_init();
|
2013-05-31 06:25:25 +08:00
|
|
|
#endif
|
2010-05-24 12:44:54 +08:00
|
|
|
ret = pci_register_driver(&qib_driver);
|
|
|
|
if (ret < 0) {
|
2012-07-19 21:04:25 +08:00
|
|
|
pr_err("Unable to register driver: error %d\n", -ret);
|
2013-06-05 03:05:37 +08:00
|
|
|
goto bail_dev;
|
2010-05-24 12:44:54 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* not fatal if it doesn't work */
|
|
|
|
if (qib_init_qibfs())
|
2012-07-19 21:04:25 +08:00
|
|
|
pr_err("Unable to register ipathfs\n");
|
2010-05-24 12:44:54 +08:00
|
|
|
goto bail; /* all OK */
|
|
|
|
|
2013-06-05 03:05:37 +08:00
|
|
|
bail_dev:
|
2013-05-31 06:25:25 +08:00
|
|
|
#ifdef CONFIG_INFINIBAND_QIB_DCA
|
|
|
|
dca_unregister_notify(&dca_notifier);
|
2013-06-16 05:07:03 +08:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
|
|
qib_dbg_exit();
|
2013-05-31 06:25:25 +08:00
|
|
|
#endif
|
2010-05-24 12:44:54 +08:00
|
|
|
qib_dev_cleanup();
|
|
|
|
bail:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2014-05-30 03:46:09 +08:00
|
|
|
module_init(qib_ib_init);
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Do the non-unit driver cleanup, memory free, etc. at unload.
|
|
|
|
*/
|
2014-05-30 03:46:09 +08:00
|
|
|
static void __exit qib_ib_cleanup(void)
|
2010-05-24 12:44:54 +08:00
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = qib_exit_qibfs();
|
|
|
|
if (ret)
|
2012-07-19 21:04:25 +08:00
|
|
|
pr_err(
|
|
|
|
"Unable to cleanup counter filesystem: error %d\n",
|
|
|
|
-ret);
|
2010-05-24 12:44:54 +08:00
|
|
|
|
2013-05-31 06:25:25 +08:00
|
|
|
#ifdef CONFIG_INFINIBAND_QIB_DCA
|
|
|
|
dca_unregister_notify(&dca_notifier);
|
|
|
|
#endif
|
2010-05-24 12:44:54 +08:00
|
|
|
pci_unregister_driver(&qib_driver);
|
2013-06-16 05:07:03 +08:00
|
|
|
#ifdef CONFIG_DEBUG_FS
|
|
|
|
qib_dbg_exit();
|
|
|
|
#endif
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
qib_cpulist_count = 0;
|
|
|
|
kfree(qib_cpulist);
|
|
|
|
|
2019-02-21 08:21:00 +08:00
|
|
|
WARN_ON(!xa_empty(&qib_dev_table));
|
2010-05-24 12:44:54 +08:00
|
|
|
qib_dev_cleanup();
|
|
|
|
}
|
|
|
|
|
2014-05-30 03:46:09 +08:00
|
|
|
module_exit(qib_ib_cleanup);
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
/* this can only be called after a successful initialization */
|
|
|
|
static void cleanup_device_data(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
int ctxt;
|
|
|
|
int pidx;
|
|
|
|
struct qib_ctxtdata **tmp;
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
/* users can't do anything more with chip */
|
2012-07-19 21:04:04 +08:00
|
|
|
for (pidx = 0; pidx < dd->num_pports; ++pidx) {
|
2010-05-24 12:44:54 +08:00
|
|
|
if (dd->pport[pidx].statusp)
|
|
|
|
*dd->pport[pidx].statusp &= ~QIB_STATUS_CHIP_PRESENT;
|
|
|
|
|
2012-07-19 21:04:04 +08:00
|
|
|
spin_lock(&dd->pport[pidx].cc_shadow_lock);
|
|
|
|
|
|
|
|
kfree(dd->pport[pidx].congestion_entries);
|
|
|
|
dd->pport[pidx].congestion_entries = NULL;
|
|
|
|
kfree(dd->pport[pidx].ccti_entries);
|
|
|
|
dd->pport[pidx].ccti_entries = NULL;
|
|
|
|
kfree(dd->pport[pidx].ccti_entries_shadow);
|
|
|
|
dd->pport[pidx].ccti_entries_shadow = NULL;
|
|
|
|
kfree(dd->pport[pidx].congestion_entries_shadow);
|
|
|
|
dd->pport[pidx].congestion_entries_shadow = NULL;
|
|
|
|
|
|
|
|
spin_unlock(&dd->pport[pidx].cc_shadow_lock);
|
|
|
|
}
|
|
|
|
|
2015-04-23 02:38:24 +08:00
|
|
|
qib_disable_wc(dd);
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
if (dd->pioavailregs_dma) {
|
|
|
|
dma_free_coherent(&dd->pcidev->dev, PAGE_SIZE,
|
|
|
|
(void *) dd->pioavailregs_dma,
|
|
|
|
dd->pioavailregs_phys);
|
|
|
|
dd->pioavailregs_dma = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (dd->pageshadow) {
|
|
|
|
struct page **tmpp = dd->pageshadow;
|
|
|
|
dma_addr_t *tmpd = dd->physshadow;
|
2013-07-04 01:50:28 +08:00
|
|
|
int i;
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
for (ctxt = 0; ctxt < dd->cfgctxts; ctxt++) {
|
|
|
|
int ctxt_tidbase = ctxt * dd->rcvtidcnt;
|
|
|
|
int maxtid = ctxt_tidbase + dd->rcvtidcnt;
|
|
|
|
|
|
|
|
for (i = ctxt_tidbase; i < maxtid; i++) {
|
|
|
|
if (!tmpp[i])
|
|
|
|
continue;
|
|
|
|
pci_unmap_page(dd->pcidev, tmpd[i],
|
|
|
|
PAGE_SIZE, PCI_DMA_FROMDEVICE);
|
|
|
|
qib_release_user_pages(&tmpp[i], 1);
|
|
|
|
tmpp[i] = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
dd->pageshadow = NULL;
|
|
|
|
vfree(tmpp);
|
2013-07-04 01:50:28 +08:00
|
|
|
dd->physshadow = NULL;
|
|
|
|
vfree(tmpd);
|
2010-05-24 12:44:54 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Free any resources still in use (usually just kernel contexts)
|
|
|
|
* at unload; we do for ctxtcnt, because that's what we allocate.
|
|
|
|
* We acquire lock to be really paranoid that rcd isn't being
|
|
|
|
* accessed from some interrupt-related code (that should not happen,
|
|
|
|
* but best to be sure).
|
|
|
|
*/
|
|
|
|
spin_lock_irqsave(&dd->uctxt_lock, flags);
|
|
|
|
tmp = dd->rcd;
|
|
|
|
dd->rcd = NULL;
|
|
|
|
spin_unlock_irqrestore(&dd->uctxt_lock, flags);
|
|
|
|
for (ctxt = 0; tmp && ctxt < dd->ctxtcnt; ctxt++) {
|
|
|
|
struct qib_ctxtdata *rcd = tmp[ctxt];
|
|
|
|
|
|
|
|
tmp[ctxt] = NULL; /* debugging paranoia */
|
|
|
|
qib_free_ctxtdata(dd, rcd);
|
|
|
|
}
|
|
|
|
kfree(tmp);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Clean up on unit shutdown, or error during unit load after
|
|
|
|
* successful initialization.
|
|
|
|
*/
|
|
|
|
static void qib_postinit_cleanup(struct qib_devdata *dd)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Clean up chip-specific stuff.
|
|
|
|
* We check for NULL here, because it's outside
|
|
|
|
* the kregbase check, and we need to call it
|
|
|
|
* after the free_irq. Thus it's possible that
|
|
|
|
* the function pointers were never initialized.
|
|
|
|
*/
|
|
|
|
if (dd->f_cleanup)
|
|
|
|
dd->f_cleanup(dd);
|
|
|
|
|
|
|
|
qib_pcie_ddcleanup(dd);
|
|
|
|
|
|
|
|
cleanup_device_data(dd);
|
|
|
|
|
|
|
|
qib_free_devdata(dd);
|
|
|
|
}
|
|
|
|
|
2012-12-22 07:08:40 +08:00
|
|
|
static int qib_init_one(struct pci_dev *pdev, const struct pci_device_id *ent)
|
2010-05-24 12:44:54 +08:00
|
|
|
{
|
|
|
|
int ret, j, pidx, initfail;
|
|
|
|
struct qib_devdata *dd = NULL;
|
|
|
|
|
|
|
|
ret = qib_pcie_init(pdev, ent);
|
|
|
|
if (ret)
|
|
|
|
goto bail;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Do device-specific initialiation, function table setup, dd
|
|
|
|
* allocation, etc.
|
|
|
|
*/
|
|
|
|
switch (ent->device) {
|
|
|
|
case PCI_DEVICE_ID_QLOGIC_IB_6120:
|
2010-05-26 03:22:33 +08:00
|
|
|
#ifdef CONFIG_PCI_MSI
|
2010-05-24 12:44:54 +08:00
|
|
|
dd = qib_init_iba6120_funcs(pdev, ent);
|
2010-05-26 03:22:33 +08:00
|
|
|
#else
|
2012-07-19 21:04:25 +08:00
|
|
|
qib_early_err(&pdev->dev,
|
2013-03-15 02:13:41 +08:00
|
|
|
"Intel PCIE device 0x%x cannot work if CONFIG_PCI_MSI is not enabled\n",
|
2012-07-19 21:04:25 +08:00
|
|
|
ent->device);
|
2010-10-23 06:29:46 +08:00
|
|
|
dd = ERR_PTR(-ENODEV);
|
2010-05-26 03:22:33 +08:00
|
|
|
#endif
|
2010-05-24 12:44:54 +08:00
|
|
|
break;
|
|
|
|
|
|
|
|
case PCI_DEVICE_ID_QLOGIC_IB_7220:
|
|
|
|
dd = qib_init_iba7220_funcs(pdev, ent);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PCI_DEVICE_ID_QLOGIC_IB_7322:
|
|
|
|
dd = qib_init_iba7322_funcs(pdev, ent);
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
2012-07-19 21:04:25 +08:00
|
|
|
qib_early_err(&pdev->dev,
|
2013-03-15 02:13:41 +08:00
|
|
|
"Failing on unknown Intel deviceid 0x%x\n",
|
2012-07-19 21:04:25 +08:00
|
|
|
ent->device);
|
2010-05-24 12:44:54 +08:00
|
|
|
ret = -ENODEV;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (IS_ERR(dd))
|
|
|
|
ret = PTR_ERR(dd);
|
|
|
|
if (ret)
|
|
|
|
goto bail; /* error already printed */
|
|
|
|
|
2012-07-19 21:03:56 +08:00
|
|
|
ret = qib_create_workqueues(dd);
|
|
|
|
if (ret)
|
|
|
|
goto bail;
|
|
|
|
|
2010-05-24 12:44:54 +08:00
|
|
|
/* do the generic initialization */
|
|
|
|
initfail = qib_init(dd, 0);
|
|
|
|
|
|
|
|
ret = qib_register_ib_device(dd);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Now ready for use. this should be cleared whenever we
|
|
|
|
* detect a reset, or initiate one. If earlier failure,
|
|
|
|
* we still create devices, so diags, etc. can be used
|
|
|
|
* to determine cause of problem.
|
|
|
|
*/
|
|
|
|
if (!qib_mini_init && !initfail && !ret)
|
|
|
|
dd->flags |= QIB_INITTED;
|
|
|
|
|
|
|
|
j = qib_device_create(dd);
|
|
|
|
if (j)
|
|
|
|
qib_dev_err(dd, "Failed to create /dev devices: %d\n", -j);
|
|
|
|
j = qibfs_add(dd);
|
|
|
|
if (j)
|
|
|
|
qib_dev_err(dd, "Failed filesystem setup for counters: %d\n",
|
|
|
|
-j);
|
|
|
|
|
|
|
|
if (qib_mini_init || initfail || ret) {
|
|
|
|
qib_stop_timers(dd);
|
2010-10-19 23:24:36 +08:00
|
|
|
flush_workqueue(ib_wq);
|
2010-05-24 12:44:54 +08:00
|
|
|
for (pidx = 0; pidx < dd->num_pports; ++pidx)
|
|
|
|
dd->f_quiet_serdes(dd->pport + pidx);
|
2010-07-02 04:25:45 +08:00
|
|
|
if (qib_mini_init)
|
|
|
|
goto bail;
|
|
|
|
if (!j) {
|
|
|
|
(void) qibfs_remove(dd);
|
|
|
|
qib_device_remove(dd);
|
|
|
|
}
|
|
|
|
if (!ret)
|
|
|
|
qib_unregister_ib_device(dd);
|
|
|
|
qib_postinit_cleanup(dd);
|
2010-05-24 12:44:54 +08:00
|
|
|
if (initfail)
|
|
|
|
ret = initfail;
|
|
|
|
goto bail;
|
|
|
|
}
|
|
|
|
|
2015-04-23 02:38:24 +08:00
|
|
|
ret = qib_enable_wc(dd);
|
|
|
|
if (ret) {
|
|
|
|
qib_dev_err(dd,
|
|
|
|
"Write combining not enabled (err %d): performance may be poor\n",
|
|
|
|
-ret);
|
|
|
|
ret = 0;
|
2010-05-24 12:44:54 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
qib_verify_pioperf(dd);
|
|
|
|
bail:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2012-12-22 07:08:40 +08:00
|
|
|
static void qib_remove_one(struct pci_dev *pdev)
|
2010-05-24 12:44:54 +08:00
|
|
|
{
|
|
|
|
struct qib_devdata *dd = pci_get_drvdata(pdev);
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* unregister from IB core */
|
|
|
|
qib_unregister_ib_device(dd);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Disable the IB link, disable interrupts on the device,
|
|
|
|
* clear dma engines, etc.
|
|
|
|
*/
|
|
|
|
if (!qib_mini_init)
|
|
|
|
qib_shutdown_device(dd);
|
|
|
|
|
|
|
|
qib_stop_timers(dd);
|
|
|
|
|
2010-10-19 23:24:36 +08:00
|
|
|
/* wait until all of our (qsfp) queue_work() calls complete */
|
|
|
|
flush_workqueue(ib_wq);
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
ret = qibfs_remove(dd);
|
|
|
|
if (ret)
|
|
|
|
qib_dev_err(dd, "Failed counters filesystem cleanup: %d\n",
|
|
|
|
-ret);
|
|
|
|
|
|
|
|
qib_device_remove(dd);
|
|
|
|
|
|
|
|
qib_postinit_cleanup(dd);
|
|
|
|
}
|
|
|
|
|
2018-05-02 21:43:15 +08:00
|
|
|
static void qib_shutdown_one(struct pci_dev *pdev)
|
|
|
|
{
|
|
|
|
struct qib_devdata *dd = pci_get_drvdata(pdev);
|
|
|
|
|
|
|
|
qib_shutdown_device(dd);
|
|
|
|
}
|
|
|
|
|
2010-05-24 12:44:54 +08:00
|
|
|
/**
|
|
|
|
* qib_create_rcvhdrq - create a receive header queue
|
|
|
|
* @dd: the qlogic_ib device
|
|
|
|
* @rcd: the context data
|
|
|
|
*
|
|
|
|
* This must be contiguous memory (from an i/o perspective), and must be
|
|
|
|
* DMA'able (which means for some systems, it will go through an IOMMU,
|
|
|
|
* or be forced into a low address range).
|
|
|
|
*/
|
|
|
|
int qib_create_rcvhdrq(struct qib_devdata *dd, struct qib_ctxtdata *rcd)
|
|
|
|
{
|
|
|
|
unsigned amt;
|
2013-05-29 00:57:33 +08:00
|
|
|
int old_node_id;
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
if (!rcd->rcvhdrq) {
|
|
|
|
dma_addr_t phys_hdrqtail;
|
|
|
|
gfp_t gfp_flags;
|
|
|
|
|
|
|
|
amt = ALIGN(dd->rcvhdrcnt * dd->rcvhdrentsize *
|
|
|
|
sizeof(u32), PAGE_SIZE);
|
|
|
|
gfp_flags = (rcd->ctxt >= dd->first_user_ctxt) ?
|
|
|
|
GFP_USER : GFP_KERNEL;
|
2013-05-29 00:57:33 +08:00
|
|
|
|
|
|
|
old_node_id = dev_to_node(&dd->pcidev->dev);
|
|
|
|
set_dev_node(&dd->pcidev->dev, rcd->node_id);
|
2010-05-24 12:44:54 +08:00
|
|
|
rcd->rcvhdrq = dma_alloc_coherent(
|
|
|
|
&dd->pcidev->dev, amt, &rcd->rcvhdrq_phys,
|
|
|
|
gfp_flags | __GFP_COMP);
|
2013-05-29 00:57:33 +08:00
|
|
|
set_dev_node(&dd->pcidev->dev, old_node_id);
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
if (!rcd->rcvhdrq) {
|
2012-07-19 21:04:25 +08:00
|
|
|
qib_dev_err(dd,
|
|
|
|
"attempt to allocate %d bytes for ctxt %u rcvhdrq failed\n",
|
|
|
|
amt, rcd->ctxt);
|
2010-05-24 12:44:54 +08:00
|
|
|
goto bail;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (rcd->ctxt >= dd->first_user_ctxt) {
|
|
|
|
rcd->user_event_mask = vmalloc_user(PAGE_SIZE);
|
|
|
|
if (!rcd->user_event_mask)
|
|
|
|
goto bail_free_hdrq;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!(dd->flags & QIB_NODMA_RTAIL)) {
|
2013-05-29 00:57:33 +08:00
|
|
|
set_dev_node(&dd->pcidev->dev, rcd->node_id);
|
2010-05-24 12:44:54 +08:00
|
|
|
rcd->rcvhdrtail_kvaddr = dma_alloc_coherent(
|
|
|
|
&dd->pcidev->dev, PAGE_SIZE, &phys_hdrqtail,
|
|
|
|
gfp_flags);
|
2013-05-29 00:57:33 +08:00
|
|
|
set_dev_node(&dd->pcidev->dev, old_node_id);
|
2010-05-24 12:44:54 +08:00
|
|
|
if (!rcd->rcvhdrtail_kvaddr)
|
|
|
|
goto bail_free;
|
|
|
|
rcd->rcvhdrqtailaddr_phys = phys_hdrqtail;
|
|
|
|
}
|
|
|
|
|
|
|
|
rcd->rcvhdrq_size = amt;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* clear for security and sanity on each use */
|
|
|
|
memset(rcd->rcvhdrq, 0, rcd->rcvhdrq_size);
|
|
|
|
if (rcd->rcvhdrtail_kvaddr)
|
|
|
|
memset(rcd->rcvhdrtail_kvaddr, 0, PAGE_SIZE);
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
bail_free:
|
2012-07-19 21:04:25 +08:00
|
|
|
qib_dev_err(dd,
|
|
|
|
"attempt to allocate 1 page for ctxt %u rcvhdrqtailaddr failed\n",
|
|
|
|
rcd->ctxt);
|
2010-05-24 12:44:54 +08:00
|
|
|
vfree(rcd->user_event_mask);
|
|
|
|
rcd->user_event_mask = NULL;
|
|
|
|
bail_free_hdrq:
|
|
|
|
dma_free_coherent(&dd->pcidev->dev, amt, rcd->rcvhdrq,
|
|
|
|
rcd->rcvhdrq_phys);
|
|
|
|
rcd->rcvhdrq = NULL;
|
|
|
|
bail:
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* allocate eager buffers, both kernel and user contexts.
|
|
|
|
* @rcd: the context we are setting up.
|
|
|
|
*
|
|
|
|
* Allocate the eager TID buffers and program them into hip.
|
|
|
|
* They are no longer completely contiguous, we do multiple allocation
|
|
|
|
* calls. Otherwise we get the OOM code involved, by asking for too
|
|
|
|
* much per call, with disastrous results on some kernels.
|
|
|
|
*/
|
|
|
|
int qib_setup_eagerbufs(struct qib_ctxtdata *rcd)
|
|
|
|
{
|
|
|
|
struct qib_devdata *dd = rcd->dd;
|
|
|
|
unsigned e, egrcnt, egrperchunk, chunk, egrsize, egroff;
|
|
|
|
size_t size;
|
|
|
|
gfp_t gfp_flags;
|
2013-05-29 00:57:33 +08:00
|
|
|
int old_node_id;
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* GFP_USER, but without GFP_FS, so buffer cache can be
|
|
|
|
* coalesced (we hope); otherwise, even at order 4,
|
|
|
|
* heavy filesystem activity makes these fail, and we can
|
|
|
|
* use compound pages.
|
|
|
|
*/
|
2015-11-07 08:28:28 +08:00
|
|
|
gfp_flags = __GFP_RECLAIM | __GFP_IO | __GFP_COMP;
|
2010-05-24 12:44:54 +08:00
|
|
|
|
|
|
|
egrcnt = rcd->rcvegrcnt;
|
|
|
|
egroff = rcd->rcvegr_tid_base;
|
|
|
|
egrsize = dd->rcvegrbufsize;
|
|
|
|
|
|
|
|
chunk = rcd->rcvegrbuf_chunks;
|
|
|
|
egrperchunk = rcd->rcvegrbufs_perchunk;
|
|
|
|
size = rcd->rcvegrbuf_size;
|
|
|
|
if (!rcd->rcvegrbuf) {
|
|
|
|
rcd->rcvegrbuf =
|
treewide: kzalloc_node() -> kcalloc_node()
The kzalloc_node() function has a 2-factor argument form, kcalloc_node(). This
patch replaces cases of:
kzalloc_node(a * b, gfp, node)
with:
kcalloc_node(a * b, gfp, node)
as well as handling cases of:
kzalloc_node(a * b * c, gfp, node)
with:
kzalloc_node(array3_size(a, b, c), gfp, node)
as it's slightly less ugly than:
kcalloc_node(array_size(a, b), c, gfp, node)
This does, however, attempt to ignore constant size factors like:
kzalloc_node(4 * 1024, gfp, 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;
@@
(
kzalloc_node(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kzalloc_node(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kzalloc_node(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kzalloc_node(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kzalloc_node(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kzalloc_node(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kzalloc_node(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kzalloc_node(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kzalloc_node(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kzalloc_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;
@@
(
- kzalloc_node
+ kcalloc_node
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kzalloc_node
+ kcalloc_node
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kzalloc_node
+ kcalloc_node
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kzalloc_node
+ kcalloc_node
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kzalloc_node
+ kcalloc_node
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kzalloc_node
+ kcalloc_node
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kzalloc_node
+ kcalloc_node
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kzalloc_node
+ kcalloc_node
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kzalloc_node
+ kcalloc_node
(
- SIZE * COUNT
+ COUNT, SIZE
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
kzalloc_node(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc_node(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc_node(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc_node(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc_node(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc_node(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc_node(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc_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;
@@
(
kzalloc_node(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kzalloc_node(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kzalloc_node(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kzalloc_node(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kzalloc_node(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kzalloc_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;
@@
(
kzalloc_node(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc_node(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc_node(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc_node(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc_node(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc_node(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc_node(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc_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;
@@
(
kzalloc_node(C1 * C2 * C3, ...)
|
kzalloc_node(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc_node(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc_node(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc_node(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants,
// keeping sizeof() as the second factor argument.
@@
expression THING, E1, E2;
type TYPE;
constant C1, C2, C3;
@@
(
kzalloc_node(sizeof(THING) * C2, ...)
|
kzalloc_node(sizeof(TYPE) * C2, ...)
|
kzalloc_node(C1 * C2 * C3, ...)
|
kzalloc_node(C1 * C2, ...)
|
- kzalloc_node
+ kcalloc_node
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kzalloc_node
+ kcalloc_node
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kzalloc_node
+ kcalloc_node
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kzalloc_node
+ kcalloc_node
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kzalloc_node
+ kcalloc_node
(
- (E1) * E2
+ E1, E2
, ...)
|
- kzalloc_node
+ kcalloc_node
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kzalloc_node
+ kcalloc_node
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-13 05:04:20 +08:00
|
|
|
kcalloc_node(chunk, sizeof(rcd->rcvegrbuf[0]),
|
|
|
|
GFP_KERNEL, rcd->node_id);
|
2010-05-24 12:44:54 +08:00
|
|
|
if (!rcd->rcvegrbuf)
|
|
|
|
goto bail;
|
|
|
|
}
|
|
|
|
if (!rcd->rcvegrbuf_phys) {
|
|
|
|
rcd->rcvegrbuf_phys =
|
2017-11-16 09:32:37 +08:00
|
|
|
kmalloc_array_node(chunk,
|
|
|
|
sizeof(rcd->rcvegrbuf_phys[0]),
|
|
|
|
GFP_KERNEL, rcd->node_id);
|
2010-05-24 12:44:54 +08:00
|
|
|
if (!rcd->rcvegrbuf_phys)
|
|
|
|
goto bail_rcvegrbuf;
|
|
|
|
}
|
|
|
|
for (e = 0; e < rcd->rcvegrbuf_chunks; e++) {
|
|
|
|
if (rcd->rcvegrbuf[e])
|
|
|
|
continue;
|
2013-05-29 00:57:33 +08:00
|
|
|
|
|
|
|
old_node_id = dev_to_node(&dd->pcidev->dev);
|
|
|
|
set_dev_node(&dd->pcidev->dev, rcd->node_id);
|
2010-05-24 12:44:54 +08:00
|
|
|
rcd->rcvegrbuf[e] =
|
|
|
|
dma_alloc_coherent(&dd->pcidev->dev, size,
|
|
|
|
&rcd->rcvegrbuf_phys[e],
|
|
|
|
gfp_flags);
|
2013-05-29 00:57:33 +08:00
|
|
|
set_dev_node(&dd->pcidev->dev, old_node_id);
|
2010-05-24 12:44:54 +08:00
|
|
|
if (!rcd->rcvegrbuf[e])
|
|
|
|
goto bail_rcvegrbuf_phys;
|
|
|
|
}
|
|
|
|
|
|
|
|
rcd->rcvegr_phys = rcd->rcvegrbuf_phys[0];
|
|
|
|
|
|
|
|
for (e = chunk = 0; chunk < rcd->rcvegrbuf_chunks; chunk++) {
|
|
|
|
dma_addr_t pa = rcd->rcvegrbuf_phys[chunk];
|
|
|
|
unsigned i;
|
|
|
|
|
2010-06-18 07:13:59 +08:00
|
|
|
/* clear for security and sanity on each use */
|
|
|
|
memset(rcd->rcvegrbuf[chunk], 0, size);
|
|
|
|
|
2010-05-24 12:44:54 +08:00
|
|
|
for (i = 0; e < egrcnt && i < egrperchunk; e++, i++) {
|
|
|
|
dd->f_put_tid(dd, e + egroff +
|
|
|
|
(u64 __iomem *)
|
|
|
|
((char __iomem *)
|
|
|
|
dd->kregbase +
|
|
|
|
dd->rcvegrbase),
|
|
|
|
RCVHQ_RCV_TYPE_EAGER, pa);
|
|
|
|
pa += egrsize;
|
|
|
|
}
|
|
|
|
cond_resched(); /* don't hog the cpu */
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
bail_rcvegrbuf_phys:
|
|
|
|
for (e = 0; e < rcd->rcvegrbuf_chunks && rcd->rcvegrbuf[e]; e++)
|
|
|
|
dma_free_coherent(&dd->pcidev->dev, size,
|
|
|
|
rcd->rcvegrbuf[e], rcd->rcvegrbuf_phys[e]);
|
|
|
|
kfree(rcd->rcvegrbuf_phys);
|
|
|
|
rcd->rcvegrbuf_phys = NULL;
|
|
|
|
bail_rcvegrbuf:
|
|
|
|
kfree(rcd->rcvegrbuf);
|
|
|
|
rcd->rcvegrbuf = NULL;
|
|
|
|
bail:
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
2010-06-18 07:13:44 +08:00
|
|
|
/*
|
|
|
|
* Note: Changes to this routine should be mirrored
|
|
|
|
* for the diagnostics routine qib_remap_ioaddr32().
|
|
|
|
* There is also related code for VL15 buffers in qib_init_7322_variables().
|
|
|
|
* The teardown code that unmaps is in qib_pcie_ddcleanup()
|
|
|
|
*/
|
2010-05-24 12:44:54 +08:00
|
|
|
int init_chip_wc_pat(struct qib_devdata *dd, u32 vl15buflen)
|
|
|
|
{
|
|
|
|
u64 __iomem *qib_kregbase = NULL;
|
|
|
|
void __iomem *qib_piobase = NULL;
|
|
|
|
u64 __iomem *qib_userbase = NULL;
|
|
|
|
u64 qib_kreglen;
|
|
|
|
u64 qib_pio2koffset = dd->piobufbase & 0xffffffff;
|
|
|
|
u64 qib_pio4koffset = dd->piobufbase >> 32;
|
|
|
|
u64 qib_pio2klen = dd->piobcnt2k * dd->palign;
|
|
|
|
u64 qib_pio4klen = dd->piobcnt4k * dd->align4k;
|
|
|
|
u64 qib_physaddr = dd->physaddr;
|
|
|
|
u64 qib_piolen;
|
|
|
|
u64 qib_userlen = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Free the old mapping because the kernel will try to reuse the
|
|
|
|
* old mapping and not create a new mapping with the
|
|
|
|
* write combining attribute.
|
|
|
|
*/
|
|
|
|
iounmap(dd->kregbase);
|
|
|
|
dd->kregbase = NULL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Assumes chip address space looks like:
|
|
|
|
* - kregs + sregs + cregs + uregs (in any order)
|
|
|
|
* - piobufs (2K and 4K bufs in either order)
|
|
|
|
* or:
|
|
|
|
* - kregs + sregs + cregs (in any order)
|
|
|
|
* - piobufs (2K and 4K bufs in either order)
|
|
|
|
* - uregs
|
|
|
|
*/
|
|
|
|
if (dd->piobcnt4k == 0) {
|
|
|
|
qib_kreglen = qib_pio2koffset;
|
|
|
|
qib_piolen = qib_pio2klen;
|
|
|
|
} else if (qib_pio2koffset < qib_pio4koffset) {
|
|
|
|
qib_kreglen = qib_pio2koffset;
|
|
|
|
qib_piolen = qib_pio4koffset + qib_pio4klen - qib_kreglen;
|
|
|
|
} else {
|
|
|
|
qib_kreglen = qib_pio4koffset;
|
|
|
|
qib_piolen = qib_pio2koffset + qib_pio2klen - qib_kreglen;
|
|
|
|
}
|
|
|
|
qib_piolen += vl15buflen;
|
|
|
|
/* Map just the configured ports (not all hw ports) */
|
|
|
|
if (dd->uregbase > qib_kreglen)
|
|
|
|
qib_userlen = dd->ureg_align * dd->cfgctxts;
|
|
|
|
|
|
|
|
/* Sanity checks passed, now create the new mappings */
|
|
|
|
qib_kregbase = ioremap_nocache(qib_physaddr, qib_kreglen);
|
|
|
|
if (!qib_kregbase)
|
|
|
|
goto bail;
|
|
|
|
|
|
|
|
qib_piobase = ioremap_wc(qib_physaddr + qib_kreglen, qib_piolen);
|
|
|
|
if (!qib_piobase)
|
|
|
|
goto bail_kregbase;
|
|
|
|
|
|
|
|
if (qib_userlen) {
|
|
|
|
qib_userbase = ioremap_nocache(qib_physaddr + dd->uregbase,
|
|
|
|
qib_userlen);
|
|
|
|
if (!qib_userbase)
|
|
|
|
goto bail_piobase;
|
|
|
|
}
|
|
|
|
|
|
|
|
dd->kregbase = qib_kregbase;
|
|
|
|
dd->kregend = (u64 __iomem *)
|
|
|
|
((char __iomem *) qib_kregbase + qib_kreglen);
|
|
|
|
dd->piobase = qib_piobase;
|
|
|
|
dd->pio2kbase = (void __iomem *)
|
|
|
|
(((char __iomem *) dd->piobase) +
|
|
|
|
qib_pio2koffset - qib_kreglen);
|
|
|
|
if (dd->piobcnt4k)
|
|
|
|
dd->pio4kbase = (void __iomem *)
|
|
|
|
(((char __iomem *) dd->piobase) +
|
|
|
|
qib_pio4koffset - qib_kreglen);
|
|
|
|
if (qib_userlen)
|
|
|
|
/* ureg will now be accessed relative to dd->userbase */
|
|
|
|
dd->userbase = qib_userbase;
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
bail_piobase:
|
|
|
|
iounmap(qib_piobase);
|
|
|
|
bail_kregbase:
|
|
|
|
iounmap(qib_kregbase);
|
|
|
|
bail:
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|