You've already forked linux-apfs
mirror of
https://github.com/linux-apfs/linux-apfs.git
synced 2026-05-01 15:00:59 -07:00
staging/rdma: remove deprecated ipath driver
This driver was moved to staging for eventual deletion. Time to complete that task. Signed-off-by: Doug Ledford <dledford@redhat.com>
This commit is contained in:
Doug Ledford
@@ -5795,12 +5795,6 @@ M: Juanjo Ciarlante <jjciarla@raiz.uncu.edu.ar>
|
|||||||
S: Maintained
|
S: Maintained
|
||||||
F: net/ipv4/netfilter/ipt_MASQUERADE.c
|
F: net/ipv4/netfilter/ipt_MASQUERADE.c
|
||||||
|
|
||||||
IPATH DRIVER
|
|
||||||
M: Mike Marciniszyn <infinipath@intel.com>
|
|
||||||
L: linux-rdma@vger.kernel.org
|
|
||||||
S: Maintained
|
|
||||||
F: drivers/staging/rdma/ipath/
|
|
||||||
|
|
||||||
IPMI SUBSYSTEM
|
IPMI SUBSYSTEM
|
||||||
M: Corey Minyard <minyard@acm.org>
|
M: Corey Minyard <minyard@acm.org>
|
||||||
L: openipmi-developer@lists.sourceforge.net (moderated for non-subscribers)
|
L: openipmi-developer@lists.sourceforge.net (moderated for non-subscribers)
|
||||||
|
|||||||
@@ -24,6 +24,4 @@ if STAGING_RDMA
|
|||||||
|
|
||||||
source "drivers/staging/rdma/hfi1/Kconfig"
|
source "drivers/staging/rdma/hfi1/Kconfig"
|
||||||
|
|
||||||
source "drivers/staging/rdma/ipath/Kconfig"
|
|
||||||
|
|
||||||
endif
|
endif
|
||||||
|
|||||||
@@ -1,3 +1,2 @@
|
|||||||
# Entries for RDMA_STAGING tree
|
# Entries for RDMA_STAGING tree
|
||||||
obj-$(CONFIG_INFINIBAND_HFI1) += hfi1/
|
obj-$(CONFIG_INFINIBAND_HFI1) += hfi1/
|
||||||
obj-$(CONFIG_INFINIBAND_IPATH) += ipath/
|
|
||||||
|
|||||||
@@ -1,16 +0,0 @@
|
|||||||
config INFINIBAND_IPATH
|
|
||||||
tristate "QLogic HTX HCA support"
|
|
||||||
depends on 64BIT && NET && HT_IRQ
|
|
||||||
---help---
|
|
||||||
This is a driver for the deprecated QLogic Hyper-Transport
|
|
||||||
IB host channel adapter (model QHT7140),
|
|
||||||
including InfiniBand verbs support. This driver allows these
|
|
||||||
devices to be used with both kernel upper level protocols such
|
|
||||||
as IP-over-InfiniBand as well as with userspace applications
|
|
||||||
(in conjunction with InfiniBand userspace access).
|
|
||||||
For QLogic PCIe QLE based cards, use the QIB driver instead.
|
|
||||||
|
|
||||||
If you have this hardware you will need to boot with PAT disabled
|
|
||||||
on your x86-64 systems, use the nopat kernel parameter.
|
|
||||||
|
|
||||||
Note that this driver will soon be removed entirely from the kernel.
|
|
||||||
@@ -1,37 +0,0 @@
|
|||||||
ccflags-y := -DIPATH_IDSTR='"QLogic kernel.org driver"' \
|
|
||||||
-DIPATH_KERN_TYPE=0
|
|
||||||
|
|
||||||
obj-$(CONFIG_INFINIBAND_IPATH) += ib_ipath.o
|
|
||||||
|
|
||||||
ib_ipath-y := \
|
|
||||||
ipath_cq.o \
|
|
||||||
ipath_diag.o \
|
|
||||||
ipath_dma.o \
|
|
||||||
ipath_driver.o \
|
|
||||||
ipath_eeprom.o \
|
|
||||||
ipath_file_ops.o \
|
|
||||||
ipath_fs.o \
|
|
||||||
ipath_init_chip.o \
|
|
||||||
ipath_intr.o \
|
|
||||||
ipath_keys.o \
|
|
||||||
ipath_mad.o \
|
|
||||||
ipath_mmap.o \
|
|
||||||
ipath_mr.o \
|
|
||||||
ipath_qp.o \
|
|
||||||
ipath_rc.o \
|
|
||||||
ipath_ruc.o \
|
|
||||||
ipath_sdma.o \
|
|
||||||
ipath_srq.o \
|
|
||||||
ipath_stats.o \
|
|
||||||
ipath_sysfs.o \
|
|
||||||
ipath_uc.o \
|
|
||||||
ipath_ud.o \
|
|
||||||
ipath_user_pages.o \
|
|
||||||
ipath_user_sdma.o \
|
|
||||||
ipath_verbs_mcast.o \
|
|
||||||
ipath_verbs.o
|
|
||||||
|
|
||||||
ib_ipath-$(CONFIG_HT_IRQ) += ipath_iba6110.o
|
|
||||||
|
|
||||||
ib_ipath-$(CONFIG_X86_64) += ipath_wc_x86_64.o
|
|
||||||
ib_ipath-$(CONFIG_PPC64) += ipath_wc_ppc64.o
|
|
||||||
@@ -1,5 +0,0 @@
|
|||||||
The ipath driver has been moved to staging in preparation for its removal in a
|
|
||||||
few releases. The driver will be deleted during the 4.6 merge window.
|
|
||||||
|
|
||||||
Contact Dennis Dalessandro <dennis.dalessandro@intel.com> and
|
|
||||||
Cc: linux-rdma@vger.kernel.org
|
|
||||||
File diff suppressed because it is too large
Load Diff
@@ -1,483 +0,0 @@
|
|||||||
/*
|
|
||||||
* Copyright (c) 2006, 2007 QLogic Corporation. All rights reserved.
|
|
||||||
* Copyright (c) 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/err.h>
|
|
||||||
#include <linux/slab.h>
|
|
||||||
#include <linux/vmalloc.h>
|
|
||||||
|
|
||||||
#include "ipath_verbs.h"
|
|
||||||
|
|
||||||
/**
|
|
||||||
* ipath_cq_enter - add a new entry to the completion queue
|
|
||||||
* @cq: completion queue
|
|
||||||
* @entry: work completion entry to add
|
|
||||||
* @sig: true if @entry is a solicitated entry
|
|
||||||
*
|
|
||||||
* This may be called with qp->s_lock held.
|
|
||||||
*/
|
|
||||||
void ipath_cq_enter(struct ipath_cq *cq, struct ib_wc *entry, int solicited)
|
|
||||||
{
|
|
||||||
struct ipath_cq_wc *wc;
|
|
||||||
unsigned long flags;
|
|
||||||
u32 head;
|
|
||||||
u32 next;
|
|
||||||
|
|
||||||
spin_lock_irqsave(&cq->lock, flags);
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Note that the head pointer might be writable by user processes.
|
|
||||||
* Take care to verify it is a sane value.
|
|
||||||
*/
|
|
||||||
wc = cq->queue;
|
|
||||||
head = wc->head;
|
|
||||||
if (head >= (unsigned) cq->ibcq.cqe) {
|
|
||||||
head = cq->ibcq.cqe;
|
|
||||||
next = 0;
|
|
||||||
} else
|
|
||||||
next = head + 1;
|
|
||||||
if (unlikely(next == wc->tail)) {
|
|
||||||
spin_unlock_irqrestore(&cq->lock, flags);
|
|
||||||
if (cq->ibcq.event_handler) {
|
|
||||||
struct ib_event ev;
|
|
||||||
|
|
||||||
ev.device = cq->ibcq.device;
|
|
||||||
ev.element.cq = &cq->ibcq;
|
|
||||||
ev.event = IB_EVENT_CQ_ERR;
|
|
||||||
cq->ibcq.event_handler(&ev, cq->ibcq.cq_context);
|
|
||||||
}
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
if (cq->ip) {
|
|
||||||
wc->uqueue[head].wr_id = entry->wr_id;
|
|
||||||
wc->uqueue[head].status = entry->status;
|
|
||||||
wc->uqueue[head].opcode = entry->opcode;
|
|
||||||
wc->uqueue[head].vendor_err = entry->vendor_err;
|
|
||||||
wc->uqueue[head].byte_len = entry->byte_len;
|
|
||||||
wc->uqueue[head].ex.imm_data = (__u32 __force) entry->ex.imm_data;
|
|
||||||
wc->uqueue[head].qp_num = entry->qp->qp_num;
|
|
||||||
wc->uqueue[head].src_qp = entry->src_qp;
|
|
||||||
wc->uqueue[head].wc_flags = entry->wc_flags;
|
|
||||||
wc->uqueue[head].pkey_index = entry->pkey_index;
|
|
||||||
wc->uqueue[head].slid = entry->slid;
|
|
||||||
wc->uqueue[head].sl = entry->sl;
|
|
||||||
wc->uqueue[head].dlid_path_bits = entry->dlid_path_bits;
|
|
||||||
wc->uqueue[head].port_num = entry->port_num;
|
|
||||||
/* Make sure entry is written before the head index. */
|
|
||||||
smp_wmb();
|
|
||||||
} else
|
|
||||||
wc->kqueue[head] = *entry;
|
|
||||||
wc->head = next;
|
|
||||||
|
|
||||||
if (cq->notify == IB_CQ_NEXT_COMP ||
|
|
||||||
(cq->notify == IB_CQ_SOLICITED && solicited)) {
|
|
||||||
cq->notify = IB_CQ_NONE;
|
|
||||||
cq->triggered++;
|
|
||||||
/*
|
|
||||||
* This will cause send_complete() to be called in
|
|
||||||
* another thread.
|
|
||||||
*/
|
|
||||||
tasklet_hi_schedule(&cq->comptask);
|
|
||||||
}
|
|
||||||
|
|
||||||
spin_unlock_irqrestore(&cq->lock, flags);
|
|
||||||
|
|
||||||
if (entry->status != IB_WC_SUCCESS)
|
|
||||||
to_idev(cq->ibcq.device)->n_wqe_errs++;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* ipath_poll_cq - poll for work completion entries
|
|
||||||
* @ibcq: the completion queue to poll
|
|
||||||
* @num_entries: the maximum number of entries to return
|
|
||||||
* @entry: pointer to array where work completions are placed
|
|
||||||
*
|
|
||||||
* Returns the number of completion entries polled.
|
|
||||||
*
|
|
||||||
* This may be called from interrupt context. Also called by ib_poll_cq()
|
|
||||||
* in the generic verbs code.
|
|
||||||
*/
|
|
||||||
int ipath_poll_cq(struct ib_cq *ibcq, int num_entries, struct ib_wc *entry)
|
|
||||||
{
|
|
||||||
struct ipath_cq *cq = to_icq(ibcq);
|
|
||||||
struct ipath_cq_wc *wc;
|
|
||||||
unsigned long flags;
|
|
||||||
int npolled;
|
|
||||||
u32 tail;
|
|
||||||
|
|
||||||
/* The kernel can only poll a kernel completion queue */
|
|
||||||
if (cq->ip) {
|
|
||||||
npolled = -EINVAL;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
spin_lock_irqsave(&cq->lock, flags);
|
|
||||||
|
|
||||||
wc = cq->queue;
|
|
||||||
tail = wc->tail;
|
|
||||||
if (tail > (u32) cq->ibcq.cqe)
|
|
||||||
tail = (u32) cq->ibcq.cqe;
|
|
||||||
for (npolled = 0; npolled < num_entries; ++npolled, ++entry) {
|
|
||||||
if (tail == wc->head)
|
|
||||||
break;
|
|
||||||
/* The kernel doesn't need a RMB since it has the lock. */
|
|
||||||
*entry = wc->kqueue[tail];
|
|
||||||
if (tail >= cq->ibcq.cqe)
|
|
||||||
tail = 0;
|
|
||||||
else
|
|
||||||
tail++;
|
|
||||||
}
|
|
||||||
wc->tail = tail;
|
|
||||||
|
|
||||||
spin_unlock_irqrestore(&cq->lock, flags);
|
|
||||||
|
|
||||||
bail:
|
|
||||||
return npolled;
|
|
||||||
}
|
|
||||||
|
|
||||||
static void send_complete(unsigned long data)
|
|
||||||
{
|
|
||||||
struct ipath_cq *cq = (struct ipath_cq *)data;
|
|
||||||
|
|
||||||
/*
|
|
||||||
* The completion handler will most likely rearm the notification
|
|
||||||
* and poll for all pending entries. If a new completion entry
|
|
||||||
* is added while we are in this routine, tasklet_hi_schedule()
|
|
||||||
* won't call us again until we return so we check triggered to
|
|
||||||
* see if we need to call the handler again.
|
|
||||||
*/
|
|
||||||
for (;;) {
|
|
||||||
u8 triggered = cq->triggered;
|
|
||||||
|
|
||||||
cq->ibcq.comp_handler(&cq->ibcq, cq->ibcq.cq_context);
|
|
||||||
|
|
||||||
if (cq->triggered == triggered)
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* ipath_create_cq - create a completion queue
|
|
||||||
* @ibdev: the device this completion queue is attached to
|
|
||||||
* @attr: creation attributes
|
|
||||||
* @context: unused by the InfiniPath driver
|
|
||||||
* @udata: unused by the InfiniPath driver
|
|
||||||
*
|
|
||||||
* Returns a pointer to the completion queue or negative errno values
|
|
||||||
* for failure.
|
|
||||||
*
|
|
||||||
* Called by ib_create_cq() in the generic verbs code.
|
|
||||||
*/
|
|
||||||
struct ib_cq *ipath_create_cq(struct ib_device *ibdev,
|
|
||||||
const struct ib_cq_init_attr *attr,
|
|
||||||
struct ib_ucontext *context,
|
|
||||||
struct ib_udata *udata)
|
|
||||||
{
|
|
||||||
int entries = attr->cqe;
|
|
||||||
struct ipath_ibdev *dev = to_idev(ibdev);
|
|
||||||
struct ipath_cq *cq;
|
|
||||||
struct ipath_cq_wc *wc;
|
|
||||||
struct ib_cq *ret;
|
|
||||||
u32 sz;
|
|
||||||
|
|
||||||
if (attr->flags)
|
|
||||||
return ERR_PTR(-EINVAL);
|
|
||||||
|
|
||||||
if (entries < 1 || entries > ib_ipath_max_cqes) {
|
|
||||||
ret = ERR_PTR(-EINVAL);
|
|
||||||
goto done;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Allocate the completion queue structure. */
|
|
||||||
cq = kmalloc(sizeof(*cq), GFP_KERNEL);
|
|
||||||
if (!cq) {
|
|
||||||
ret = ERR_PTR(-ENOMEM);
|
|
||||||
goto done;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Allocate the completion queue entries and head/tail pointers.
|
|
||||||
* This is allocated separately so that it can be resized and
|
|
||||||
* also mapped into user space.
|
|
||||||
* We need to use vmalloc() in order to support mmap and large
|
|
||||||
* numbers of entries.
|
|
||||||
*/
|
|
||||||
sz = sizeof(*wc);
|
|
||||||
if (udata && udata->outlen >= sizeof(__u64))
|
|
||||||
sz += sizeof(struct ib_uverbs_wc) * (entries + 1);
|
|
||||||
else
|
|
||||||
sz += sizeof(struct ib_wc) * (entries + 1);
|
|
||||||
wc = vmalloc_user(sz);
|
|
||||||
if (!wc) {
|
|
||||||
ret = ERR_PTR(-ENOMEM);
|
|
||||||
goto bail_cq;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Return the address of the WC as the offset to mmap.
|
|
||||||
* See ipath_mmap() for details.
|
|
||||||
*/
|
|
||||||
if (udata && udata->outlen >= sizeof(__u64)) {
|
|
||||||
int err;
|
|
||||||
|
|
||||||
cq->ip = ipath_create_mmap_info(dev, sz, context, wc);
|
|
||||||
if (!cq->ip) {
|
|
||||||
ret = ERR_PTR(-ENOMEM);
|
|
||||||
goto bail_wc;
|
|
||||||
}
|
|
||||||
|
|
||||||
err = ib_copy_to_udata(udata, &cq->ip->offset,
|
|
||||||
sizeof(cq->ip->offset));
|
|
||||||
if (err) {
|
|
||||||
ret = ERR_PTR(err);
|
|
||||||
goto bail_ip;
|
|
||||||
}
|
|
||||||
} else
|
|
||||||
cq->ip = NULL;
|
|
||||||
|
|
||||||
spin_lock(&dev->n_cqs_lock);
|
|
||||||
if (dev->n_cqs_allocated == ib_ipath_max_cqs) {
|
|
||||||
spin_unlock(&dev->n_cqs_lock);
|
|
||||||
ret = ERR_PTR(-ENOMEM);
|
|
||||||
goto bail_ip;
|
|
||||||
}
|
|
||||||
|
|
||||||
dev->n_cqs_allocated++;
|
|
||||||
spin_unlock(&dev->n_cqs_lock);
|
|
||||||
|
|
||||||
if (cq->ip) {
|
|
||||||
spin_lock_irq(&dev->pending_lock);
|
|
||||||
list_add(&cq->ip->pending_mmaps, &dev->pending_mmaps);
|
|
||||||
spin_unlock_irq(&dev->pending_lock);
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
* ib_create_cq() will initialize cq->ibcq except for cq->ibcq.cqe.
|
|
||||||
* The number of entries should be >= the number requested or return
|
|
||||||
* an error.
|
|
||||||
*/
|
|
||||||
cq->ibcq.cqe = entries;
|
|
||||||
cq->notify = IB_CQ_NONE;
|
|
||||||
cq->triggered = 0;
|
|
||||||
spin_lock_init(&cq->lock);
|
|
||||||
tasklet_init(&cq->comptask, send_complete, (unsigned long)cq);
|
|
||||||
wc->head = 0;
|
|
||||||
wc->tail = 0;
|
|
||||||
cq->queue = wc;
|
|
||||||
|
|
||||||
ret = &cq->ibcq;
|
|
||||||
|
|
||||||
goto done;
|
|
||||||
|
|
||||||
bail_ip:
|
|
||||||
kfree(cq->ip);
|
|
||||||
bail_wc:
|
|
||||||
vfree(wc);
|
|
||||||
bail_cq:
|
|
||||||
kfree(cq);
|
|
||||||
done:
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* ipath_destroy_cq - destroy a completion queue
|
|
||||||
* @ibcq: the completion queue to destroy.
|
|
||||||
*
|
|
||||||
* Returns 0 for success.
|
|
||||||
*
|
|
||||||
* Called by ib_destroy_cq() in the generic verbs code.
|
|
||||||
*/
|
|
||||||
int ipath_destroy_cq(struct ib_cq *ibcq)
|
|
||||||
{
|
|
||||||
struct ipath_ibdev *dev = to_idev(ibcq->device);
|
|
||||||
struct ipath_cq *cq = to_icq(ibcq);
|
|
||||||
|
|
||||||
tasklet_kill(&cq->comptask);
|
|
||||||
spin_lock(&dev->n_cqs_lock);
|
|
||||||
dev->n_cqs_allocated--;
|
|
||||||
spin_unlock(&dev->n_cqs_lock);
|
|
||||||
if (cq->ip)
|
|
||||||
kref_put(&cq->ip->ref, ipath_release_mmap_info);
|
|
||||||
else
|
|
||||||
vfree(cq->queue);
|
|
||||||
kfree(cq);
|
|
||||||
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* ipath_req_notify_cq - change the notification type for a completion queue
|
|
||||||
* @ibcq: the completion queue
|
|
||||||
* @notify_flags: the type of notification to request
|
|
||||||
*
|
|
||||||
* Returns 0 for success.
|
|
||||||
*
|
|
||||||
* This may be called from interrupt context. Also called by
|
|
||||||
* ib_req_notify_cq() in the generic verbs code.
|
|
||||||
*/
|
|
||||||
int ipath_req_notify_cq(struct ib_cq *ibcq, enum ib_cq_notify_flags notify_flags)
|
|
||||||
{
|
|
||||||
struct ipath_cq *cq = to_icq(ibcq);
|
|
||||||
unsigned long flags;
|
|
||||||
int ret = 0;
|
|
||||||
|
|
||||||
spin_lock_irqsave(&cq->lock, flags);
|
|
||||||
/*
|
|
||||||
* Don't change IB_CQ_NEXT_COMP to IB_CQ_SOLICITED but allow
|
|
||||||
* any other transitions (see C11-31 and C11-32 in ch. 11.4.2.2).
|
|
||||||
*/
|
|
||||||
if (cq->notify != IB_CQ_NEXT_COMP)
|
|
||||||
cq->notify = notify_flags & IB_CQ_SOLICITED_MASK;
|
|
||||||
|
|
||||||
if ((notify_flags & IB_CQ_REPORT_MISSED_EVENTS) &&
|
|
||||||
cq->queue->head != cq->queue->tail)
|
|
||||||
ret = 1;
|
|
||||||
|
|
||||||
spin_unlock_irqrestore(&cq->lock, flags);
|
|
||||||
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* ipath_resize_cq - change the size of the CQ
|
|
||||||
* @ibcq: the completion queue
|
|
||||||
*
|
|
||||||
* Returns 0 for success.
|
|
||||||
*/
|
|
||||||
int ipath_resize_cq(struct ib_cq *ibcq, int cqe, struct ib_udata *udata)
|
|
||||||
{
|
|
||||||
struct ipath_cq *cq = to_icq(ibcq);
|
|
||||||
struct ipath_cq_wc *old_wc;
|
|
||||||
struct ipath_cq_wc *wc;
|
|
||||||
u32 head, tail, n;
|
|
||||||
int ret;
|
|
||||||
u32 sz;
|
|
||||||
|
|
||||||
if (cqe < 1 || cqe > ib_ipath_max_cqes) {
|
|
||||||
ret = -EINVAL;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Need to use vmalloc() if we want to support large #s of entries.
|
|
||||||
*/
|
|
||||||
sz = sizeof(*wc);
|
|
||||||
if (udata && udata->outlen >= sizeof(__u64))
|
|
||||||
sz += sizeof(struct ib_uverbs_wc) * (cqe + 1);
|
|
||||||
else
|
|
||||||
sz += sizeof(struct ib_wc) * (cqe + 1);
|
|
||||||
wc = vmalloc_user(sz);
|
|
||||||
if (!wc) {
|
|
||||||
ret = -ENOMEM;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Check that we can write the offset to mmap. */
|
|
||||||
if (udata && udata->outlen >= sizeof(__u64)) {
|
|
||||||
__u64 offset = 0;
|
|
||||||
|
|
||||||
ret = ib_copy_to_udata(udata, &offset, sizeof(offset));
|
|
||||||
if (ret)
|
|
||||||
goto bail_free;
|
|
||||||
}
|
|
||||||
|
|
||||||
spin_lock_irq(&cq->lock);
|
|
||||||
/*
|
|
||||||
* Make sure head and tail are sane since they
|
|
||||||
* might be user writable.
|
|
||||||
*/
|
|
||||||
old_wc = cq->queue;
|
|
||||||
head = old_wc->head;
|
|
||||||
if (head > (u32) cq->ibcq.cqe)
|
|
||||||
head = (u32) cq->ibcq.cqe;
|
|
||||||
tail = old_wc->tail;
|
|
||||||
if (tail > (u32) cq->ibcq.cqe)
|
|
||||||
tail = (u32) cq->ibcq.cqe;
|
|
||||||
if (head < tail)
|
|
||||||
n = cq->ibcq.cqe + 1 + head - tail;
|
|
||||||
else
|
|
||||||
n = head - tail;
|
|
||||||
if (unlikely((u32)cqe < n)) {
|
|
||||||
ret = -EINVAL;
|
|
||||||
goto bail_unlock;
|
|
||||||
}
|
|
||||||
for (n = 0; tail != head; n++) {
|
|
||||||
if (cq->ip)
|
|
||||||
wc->uqueue[n] = old_wc->uqueue[tail];
|
|
||||||
else
|
|
||||||
wc->kqueue[n] = old_wc->kqueue[tail];
|
|
||||||
if (tail == (u32) cq->ibcq.cqe)
|
|
||||||
tail = 0;
|
|
||||||
else
|
|
||||||
tail++;
|
|
||||||
}
|
|
||||||
cq->ibcq.cqe = cqe;
|
|
||||||
wc->head = n;
|
|
||||||
wc->tail = 0;
|
|
||||||
cq->queue = wc;
|
|
||||||
spin_unlock_irq(&cq->lock);
|
|
||||||
|
|
||||||
vfree(old_wc);
|
|
||||||
|
|
||||||
if (cq->ip) {
|
|
||||||
struct ipath_ibdev *dev = to_idev(ibcq->device);
|
|
||||||
struct ipath_mmap_info *ip = cq->ip;
|
|
||||||
|
|
||||||
ipath_update_mmap_info(dev, ip, sz, wc);
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Return the offset to mmap.
|
|
||||||
* See ipath_mmap() for details.
|
|
||||||
*/
|
|
||||||
if (udata && udata->outlen >= sizeof(__u64)) {
|
|
||||||
ret = ib_copy_to_udata(udata, &ip->offset,
|
|
||||||
sizeof(ip->offset));
|
|
||||||
if (ret)
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
spin_lock_irq(&dev->pending_lock);
|
|
||||||
if (list_empty(&ip->pending_mmaps))
|
|
||||||
list_add(&ip->pending_mmaps, &dev->pending_mmaps);
|
|
||||||
spin_unlock_irq(&dev->pending_lock);
|
|
||||||
}
|
|
||||||
|
|
||||||
ret = 0;
|
|
||||||
goto bail;
|
|
||||||
|
|
||||||
bail_unlock:
|
|
||||||
spin_unlock_irq(&cq->lock);
|
|
||||||
bail_free:
|
|
||||||
vfree(wc);
|
|
||||||
bail:
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
@@ -1,99 +0,0 @@
|
|||||||
/*
|
|
||||||
* Copyright (c) 2006, 2007 QLogic Corporation. All rights reserved.
|
|
||||||
* 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.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef _IPATH_DEBUG_H
|
|
||||||
#define _IPATH_DEBUG_H
|
|
||||||
|
|
||||||
#ifndef _IPATH_DEBUGGING /* debugging enabled or not */
|
|
||||||
#define _IPATH_DEBUGGING 1
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#if _IPATH_DEBUGGING
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Mask values for debugging. The scheme allows us to compile out any
|
|
||||||
* of the debug tracing stuff, and if compiled in, to enable or disable
|
|
||||||
* dynamically. This can be set at modprobe time also:
|
|
||||||
* modprobe infinipath.ko infinipath_debug=7
|
|
||||||
*/
|
|
||||||
|
|
||||||
#define __IPATH_INFO 0x1 /* generic low verbosity stuff */
|
|
||||||
#define __IPATH_DBG 0x2 /* generic debug */
|
|
||||||
#define __IPATH_TRSAMPLE 0x8 /* generate trace buffer sample entries */
|
|
||||||
/* leave some low verbosity spots open */
|
|
||||||
#define __IPATH_VERBDBG 0x40 /* very verbose debug */
|
|
||||||
#define __IPATH_PKTDBG 0x80 /* print packet data */
|
|
||||||
/* print process startup (init)/exit messages */
|
|
||||||
#define __IPATH_PROCDBG 0x100
|
|
||||||
/* print mmap/fault stuff, not using VDBG any more */
|
|
||||||
#define __IPATH_MMDBG 0x200
|
|
||||||
#define __IPATH_ERRPKTDBG 0x400
|
|
||||||
#define __IPATH_USER_SEND 0x1000 /* use user mode send */
|
|
||||||
#define __IPATH_KERNEL_SEND 0x2000 /* use kernel mode send */
|
|
||||||
#define __IPATH_EPKTDBG 0x4000 /* print ethernet packet data */
|
|
||||||
#define __IPATH_IPATHDBG 0x10000 /* Ethernet (IPATH) gen debug */
|
|
||||||
#define __IPATH_IPATHWARN 0x20000 /* Ethernet (IPATH) warnings */
|
|
||||||
#define __IPATH_IPATHERR 0x40000 /* Ethernet (IPATH) errors */
|
|
||||||
#define __IPATH_IPATHPD 0x80000 /* Ethernet (IPATH) packet dump */
|
|
||||||
#define __IPATH_IPATHTABLE 0x100000 /* Ethernet (IPATH) table dump */
|
|
||||||
#define __IPATH_LINKVERBDBG 0x200000 /* very verbose linkchange debug */
|
|
||||||
|
|
||||||
#else /* _IPATH_DEBUGGING */
|
|
||||||
|
|
||||||
/*
|
|
||||||
* define all of these even with debugging off, for the few places that do
|
|
||||||
* if(infinipath_debug & _IPATH_xyzzy), but in a way that will make the
|
|
||||||
* compiler eliminate the code
|
|
||||||
*/
|
|
||||||
|
|
||||||
#define __IPATH_INFO 0x0 /* generic low verbosity stuff */
|
|
||||||
#define __IPATH_DBG 0x0 /* generic debug */
|
|
||||||
#define __IPATH_TRSAMPLE 0x0 /* generate trace buffer sample entries */
|
|
||||||
#define __IPATH_VERBDBG 0x0 /* very verbose debug */
|
|
||||||
#define __IPATH_PKTDBG 0x0 /* print packet data */
|
|
||||||
#define __IPATH_PROCDBG 0x0 /* process startup (init)/exit messages */
|
|
||||||
/* print mmap/fault stuff, not using VDBG any more */
|
|
||||||
#define __IPATH_MMDBG 0x0
|
|
||||||
#define __IPATH_EPKTDBG 0x0 /* print ethernet packet data */
|
|
||||||
#define __IPATH_IPATHDBG 0x0 /* Ethernet (IPATH) table dump on */
|
|
||||||
#define __IPATH_IPATHWARN 0x0 /* Ethernet (IPATH) warnings on */
|
|
||||||
#define __IPATH_IPATHERR 0x0 /* Ethernet (IPATH) errors on */
|
|
||||||
#define __IPATH_IPATHPD 0x0 /* Ethernet (IPATH) packet dump on */
|
|
||||||
#define __IPATH_IPATHTABLE 0x0 /* Ethernet (IPATH) packet dump on */
|
|
||||||
#define __IPATH_LINKVERBDBG 0x0 /* very verbose linkchange debug */
|
|
||||||
|
|
||||||
#endif /* _IPATH_DEBUGGING */
|
|
||||||
|
|
||||||
#define __IPATH_VERBOSEDBG __IPATH_VERBDBG
|
|
||||||
|
|
||||||
#endif /* _IPATH_DEBUG_H */
|
|
||||||
File diff suppressed because it is too large
Load Diff
@@ -1,179 +0,0 @@
|
|||||||
/*
|
|
||||||
* Copyright (c) 2006 QLogic, Corporation. 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/scatterlist.h>
|
|
||||||
#include <linux/gfp.h>
|
|
||||||
#include <rdma/ib_verbs.h>
|
|
||||||
|
|
||||||
#include "ipath_verbs.h"
|
|
||||||
|
|
||||||
#define BAD_DMA_ADDRESS ((u64) 0)
|
|
||||||
|
|
||||||
/*
|
|
||||||
* The following functions implement driver specific replacements
|
|
||||||
* for the ib_dma_*() functions.
|
|
||||||
*
|
|
||||||
* These functions return kernel virtual addresses instead of
|
|
||||||
* device bus addresses since the driver uses the CPU to copy
|
|
||||||
* data instead of using hardware DMA.
|
|
||||||
*/
|
|
||||||
|
|
||||||
static int ipath_mapping_error(struct ib_device *dev, u64 dma_addr)
|
|
||||||
{
|
|
||||||
return dma_addr == BAD_DMA_ADDRESS;
|
|
||||||
}
|
|
||||||
|
|
||||||
static u64 ipath_dma_map_single(struct ib_device *dev,
|
|
||||||
void *cpu_addr, size_t size,
|
|
||||||
enum dma_data_direction direction)
|
|
||||||
{
|
|
||||||
BUG_ON(!valid_dma_direction(direction));
|
|
||||||
return (u64) cpu_addr;
|
|
||||||
}
|
|
||||||
|
|
||||||
static void ipath_dma_unmap_single(struct ib_device *dev,
|
|
||||||
u64 addr, size_t size,
|
|
||||||
enum dma_data_direction direction)
|
|
||||||
{
|
|
||||||
BUG_ON(!valid_dma_direction(direction));
|
|
||||||
}
|
|
||||||
|
|
||||||
static u64 ipath_dma_map_page(struct ib_device *dev,
|
|
||||||
struct page *page,
|
|
||||||
unsigned long offset,
|
|
||||||
size_t size,
|
|
||||||
enum dma_data_direction direction)
|
|
||||||
{
|
|
||||||
u64 addr;
|
|
||||||
|
|
||||||
BUG_ON(!valid_dma_direction(direction));
|
|
||||||
|
|
||||||
if (offset + size > PAGE_SIZE) {
|
|
||||||
addr = BAD_DMA_ADDRESS;
|
|
||||||
goto done;
|
|
||||||
}
|
|
||||||
|
|
||||||
addr = (u64) page_address(page);
|
|
||||||
if (addr)
|
|
||||||
addr += offset;
|
|
||||||
/* TODO: handle highmem pages */
|
|
||||||
|
|
||||||
done:
|
|
||||||
return addr;
|
|
||||||
}
|
|
||||||
|
|
||||||
static void ipath_dma_unmap_page(struct ib_device *dev,
|
|
||||||
u64 addr, size_t size,
|
|
||||||
enum dma_data_direction direction)
|
|
||||||
{
|
|
||||||
BUG_ON(!valid_dma_direction(direction));
|
|
||||||
}
|
|
||||||
|
|
||||||
static int ipath_map_sg(struct ib_device *dev, struct scatterlist *sgl,
|
|
||||||
int nents, enum dma_data_direction direction)
|
|
||||||
{
|
|
||||||
struct scatterlist *sg;
|
|
||||||
u64 addr;
|
|
||||||
int i;
|
|
||||||
int ret = nents;
|
|
||||||
|
|
||||||
BUG_ON(!valid_dma_direction(direction));
|
|
||||||
|
|
||||||
for_each_sg(sgl, sg, nents, i) {
|
|
||||||
addr = (u64) page_address(sg_page(sg));
|
|
||||||
/* TODO: handle highmem pages */
|
|
||||||
if (!addr) {
|
|
||||||
ret = 0;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
sg->dma_address = addr + sg->offset;
|
|
||||||
#ifdef CONFIG_NEED_SG_DMA_LENGTH
|
|
||||||
sg->dma_length = sg->length;
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
static void ipath_unmap_sg(struct ib_device *dev,
|
|
||||||
struct scatterlist *sg, int nents,
|
|
||||||
enum dma_data_direction direction)
|
|
||||||
{
|
|
||||||
BUG_ON(!valid_dma_direction(direction));
|
|
||||||
}
|
|
||||||
|
|
||||||
static void ipath_sync_single_for_cpu(struct ib_device *dev,
|
|
||||||
u64 addr,
|
|
||||||
size_t size,
|
|
||||||
enum dma_data_direction dir)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
static void ipath_sync_single_for_device(struct ib_device *dev,
|
|
||||||
u64 addr,
|
|
||||||
size_t size,
|
|
||||||
enum dma_data_direction dir)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
static void *ipath_dma_alloc_coherent(struct ib_device *dev, size_t size,
|
|
||||||
u64 *dma_handle, gfp_t flag)
|
|
||||||
{
|
|
||||||
struct page *p;
|
|
||||||
void *addr = NULL;
|
|
||||||
|
|
||||||
p = alloc_pages(flag, get_order(size));
|
|
||||||
if (p)
|
|
||||||
addr = page_address(p);
|
|
||||||
if (dma_handle)
|
|
||||||
*dma_handle = (u64) addr;
|
|
||||||
return addr;
|
|
||||||
}
|
|
||||||
|
|
||||||
static void ipath_dma_free_coherent(struct ib_device *dev, size_t size,
|
|
||||||
void *cpu_addr, u64 dma_handle)
|
|
||||||
{
|
|
||||||
free_pages((unsigned long) cpu_addr, get_order(size));
|
|
||||||
}
|
|
||||||
|
|
||||||
struct ib_dma_mapping_ops ipath_dma_mapping_ops = {
|
|
||||||
.mapping_error = ipath_mapping_error,
|
|
||||||
.map_single = ipath_dma_map_single,
|
|
||||||
.unmap_single = ipath_dma_unmap_single,
|
|
||||||
.map_page = ipath_dma_map_page,
|
|
||||||
.unmap_page = ipath_dma_unmap_page,
|
|
||||||
.map_sg = ipath_map_sg,
|
|
||||||
.unmap_sg = ipath_unmap_sg,
|
|
||||||
.sync_single_for_cpu = ipath_sync_single_for_cpu,
|
|
||||||
.sync_single_for_device = ipath_sync_single_for_device,
|
|
||||||
.alloc_coherent = ipath_dma_alloc_coherent,
|
|
||||||
.free_coherent = ipath_dma_free_coherent
|
|
||||||
};
|
|
||||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
@@ -1,415 +0,0 @@
|
|||||||
/*
|
|
||||||
* Copyright (c) 2006, 2007 QLogic Corporation. All rights reserved.
|
|
||||||
* Copyright (c) 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/module.h>
|
|
||||||
#include <linux/fs.h>
|
|
||||||
#include <linux/mount.h>
|
|
||||||
#include <linux/pagemap.h>
|
|
||||||
#include <linux/init.h>
|
|
||||||
#include <linux/namei.h>
|
|
||||||
#include <linux/slab.h>
|
|
||||||
|
|
||||||
#include "ipath_kernel.h"
|
|
||||||
|
|
||||||
#define IPATHFS_MAGIC 0x726a77
|
|
||||||
|
|
||||||
static struct super_block *ipath_super;
|
|
||||||
|
|
||||||
static int ipathfs_mknod(struct inode *dir, struct dentry *dentry,
|
|
||||||
umode_t mode, const struct file_operations *fops,
|
|
||||||
void *data)
|
|
||||||
{
|
|
||||||
int error;
|
|
||||||
struct inode *inode = new_inode(dir->i_sb);
|
|
||||||
|
|
||||||
if (!inode) {
|
|
||||||
error = -EPERM;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
inode->i_ino = get_next_ino();
|
|
||||||
inode->i_mode = mode;
|
|
||||||
inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME;
|
|
||||||
inode->i_private = data;
|
|
||||||
if (S_ISDIR(mode)) {
|
|
||||||
inode->i_op = &simple_dir_inode_operations;
|
|
||||||
inc_nlink(inode);
|
|
||||||
inc_nlink(dir);
|
|
||||||
}
|
|
||||||
|
|
||||||
inode->i_fop = fops;
|
|
||||||
|
|
||||||
d_instantiate(dentry, inode);
|
|
||||||
error = 0;
|
|
||||||
|
|
||||||
bail:
|
|
||||||
return error;
|
|
||||||
}
|
|
||||||
|
|
||||||
static int create_file(const char *name, umode_t mode,
|
|
||||||
struct dentry *parent, struct dentry **dentry,
|
|
||||||
const struct file_operations *fops, void *data)
|
|
||||||
{
|
|
||||||
int error;
|
|
||||||
|
|
||||||
inode_lock(d_inode(parent));
|
|
||||||
*dentry = lookup_one_len(name, parent, strlen(name));
|
|
||||||
if (!IS_ERR(*dentry))
|
|
||||||
error = ipathfs_mknod(d_inode(parent), *dentry,
|
|
||||||
mode, fops, data);
|
|
||||||
else
|
|
||||||
error = PTR_ERR(*dentry);
|
|
||||||
inode_unlock(d_inode(parent));
|
|
||||||
|
|
||||||
return error;
|
|
||||||
}
|
|
||||||
|
|
||||||
static ssize_t atomic_stats_read(struct file *file, char __user *buf,
|
|
||||||
size_t count, loff_t *ppos)
|
|
||||||
{
|
|
||||||
return simple_read_from_buffer(buf, count, ppos, &ipath_stats,
|
|
||||||
sizeof ipath_stats);
|
|
||||||
}
|
|
||||||
|
|
||||||
static const struct file_operations atomic_stats_ops = {
|
|
||||||
.read = atomic_stats_read,
|
|
||||||
.llseek = default_llseek,
|
|
||||||
};
|
|
||||||
|
|
||||||
static ssize_t atomic_counters_read(struct file *file, char __user *buf,
|
|
||||||
size_t count, loff_t *ppos)
|
|
||||||
{
|
|
||||||
struct infinipath_counters counters;
|
|
||||||
struct ipath_devdata *dd;
|
|
||||||
|
|
||||||
dd = file_inode(file)->i_private;
|
|
||||||
dd->ipath_f_read_counters(dd, &counters);
|
|
||||||
|
|
||||||
return simple_read_from_buffer(buf, count, ppos, &counters,
|
|
||||||
sizeof counters);
|
|
||||||
}
|
|
||||||
|
|
||||||
static const struct file_operations atomic_counters_ops = {
|
|
||||||
.read = atomic_counters_read,
|
|
||||||
.llseek = default_llseek,
|
|
||||||
};
|
|
||||||
|
|
||||||
static ssize_t flash_read(struct file *file, char __user *buf,
|
|
||||||
size_t count, loff_t *ppos)
|
|
||||||
{
|
|
||||||
struct ipath_devdata *dd;
|
|
||||||
ssize_t ret;
|
|
||||||
loff_t pos;
|
|
||||||
char *tmp;
|
|
||||||
|
|
||||||
pos = *ppos;
|
|
||||||
|
|
||||||
if ( pos < 0) {
|
|
||||||
ret = -EINVAL;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (pos >= sizeof(struct ipath_flash)) {
|
|
||||||
ret = 0;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (count > sizeof(struct ipath_flash) - pos)
|
|
||||||
count = sizeof(struct ipath_flash) - pos;
|
|
||||||
|
|
||||||
tmp = kmalloc(count, GFP_KERNEL);
|
|
||||||
if (!tmp) {
|
|
||||||
ret = -ENOMEM;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
dd = file_inode(file)->i_private;
|
|
||||||
if (ipath_eeprom_read(dd, pos, tmp, count)) {
|
|
||||||
ipath_dev_err(dd, "failed to read from flash\n");
|
|
||||||
ret = -ENXIO;
|
|
||||||
goto bail_tmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (copy_to_user(buf, tmp, count)) {
|
|
||||||
ret = -EFAULT;
|
|
||||||
goto bail_tmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
*ppos = pos + count;
|
|
||||||
ret = count;
|
|
||||||
|
|
||||||
bail_tmp:
|
|
||||||
kfree(tmp);
|
|
||||||
|
|
||||||
bail:
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
static ssize_t flash_write(struct file *file, const char __user *buf,
|
|
||||||
size_t count, loff_t *ppos)
|
|
||||||
{
|
|
||||||
struct ipath_devdata *dd;
|
|
||||||
ssize_t ret;
|
|
||||||
loff_t pos;
|
|
||||||
char *tmp;
|
|
||||||
|
|
||||||
pos = *ppos;
|
|
||||||
|
|
||||||
if (pos != 0) {
|
|
||||||
ret = -EINVAL;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (count != sizeof(struct ipath_flash)) {
|
|
||||||
ret = -EINVAL;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
tmp = memdup_user(buf, count);
|
|
||||||
if (IS_ERR(tmp))
|
|
||||||
return PTR_ERR(tmp);
|
|
||||||
|
|
||||||
dd = file_inode(file)->i_private;
|
|
||||||
if (ipath_eeprom_write(dd, pos, tmp, count)) {
|
|
||||||
ret = -ENXIO;
|
|
||||||
ipath_dev_err(dd, "failed to write to flash\n");
|
|
||||||
goto bail_tmp;
|
|
||||||
}
|
|
||||||
|
|
||||||
*ppos = pos + count;
|
|
||||||
ret = count;
|
|
||||||
|
|
||||||
bail_tmp:
|
|
||||||
kfree(tmp);
|
|
||||||
|
|
||||||
bail:
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
static const struct file_operations flash_ops = {
|
|
||||||
.read = flash_read,
|
|
||||||
.write = flash_write,
|
|
||||||
.llseek = default_llseek,
|
|
||||||
};
|
|
||||||
|
|
||||||
static int create_device_files(struct super_block *sb,
|
|
||||||
struct ipath_devdata *dd)
|
|
||||||
{
|
|
||||||
struct dentry *dir, *tmp;
|
|
||||||
char unit[10];
|
|
||||||
int ret;
|
|
||||||
|
|
||||||
snprintf(unit, sizeof unit, "%02d", dd->ipath_unit);
|
|
||||||
ret = create_file(unit, S_IFDIR|S_IRUGO|S_IXUGO, sb->s_root, &dir,
|
|
||||||
&simple_dir_operations, dd);
|
|
||||||
if (ret) {
|
|
||||||
printk(KERN_ERR "create_file(%s) failed: %d\n", unit, ret);
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
ret = create_file("atomic_counters", S_IFREG|S_IRUGO, dir, &tmp,
|
|
||||||
&atomic_counters_ops, dd);
|
|
||||||
if (ret) {
|
|
||||||
printk(KERN_ERR "create_file(%s/atomic_counters) "
|
|
||||||
"failed: %d\n", unit, ret);
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
ret = create_file("flash", S_IFREG|S_IWUSR|S_IRUGO, dir, &tmp,
|
|
||||||
&flash_ops, dd);
|
|
||||||
if (ret) {
|
|
||||||
printk(KERN_ERR "create_file(%s/flash) "
|
|
||||||
"failed: %d\n", unit, ret);
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
bail:
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
static int remove_file(struct dentry *parent, char *name)
|
|
||||||
{
|
|
||||||
struct dentry *tmp;
|
|
||||||
int ret;
|
|
||||||
|
|
||||||
tmp = lookup_one_len(name, parent, strlen(name));
|
|
||||||
|
|
||||||
if (IS_ERR(tmp)) {
|
|
||||||
ret = PTR_ERR(tmp);
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
spin_lock(&tmp->d_lock);
|
|
||||||
if (simple_positive(tmp)) {
|
|
||||||
dget_dlock(tmp);
|
|
||||||
__d_drop(tmp);
|
|
||||||
spin_unlock(&tmp->d_lock);
|
|
||||||
simple_unlink(d_inode(parent), tmp);
|
|
||||||
} else
|
|
||||||
spin_unlock(&tmp->d_lock);
|
|
||||||
|
|
||||||
ret = 0;
|
|
||||||
bail:
|
|
||||||
/*
|
|
||||||
* We don't expect clients to care about the return value, but
|
|
||||||
* it's there if they need it.
|
|
||||||
*/
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
static int remove_device_files(struct super_block *sb,
|
|
||||||
struct ipath_devdata *dd)
|
|
||||||
{
|
|
||||||
struct dentry *dir, *root;
|
|
||||||
char unit[10];
|
|
||||||
int ret;
|
|
||||||
|
|
||||||
root = dget(sb->s_root);
|
|
||||||
inode_lock(d_inode(root));
|
|
||||||
snprintf(unit, sizeof unit, "%02d", dd->ipath_unit);
|
|
||||||
dir = lookup_one_len(unit, root, strlen(unit));
|
|
||||||
|
|
||||||
if (IS_ERR(dir)) {
|
|
||||||
ret = PTR_ERR(dir);
|
|
||||||
printk(KERN_ERR "Lookup of %s failed\n", unit);
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
remove_file(dir, "flash");
|
|
||||||
remove_file(dir, "atomic_counters");
|
|
||||||
d_delete(dir);
|
|
||||||
ret = simple_rmdir(d_inode(root), dir);
|
|
||||||
|
|
||||||
bail:
|
|
||||||
inode_unlock(d_inode(root));
|
|
||||||
dput(root);
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
static int ipathfs_fill_super(struct super_block *sb, void *data,
|
|
||||||
int silent)
|
|
||||||
{
|
|
||||||
struct ipath_devdata *dd, *tmp;
|
|
||||||
unsigned long flags;
|
|
||||||
int ret;
|
|
||||||
|
|
||||||
static struct tree_descr files[] = {
|
|
||||||
[2] = {"atomic_stats", &atomic_stats_ops, S_IRUGO},
|
|
||||||
{""},
|
|
||||||
};
|
|
||||||
|
|
||||||
ret = simple_fill_super(sb, IPATHFS_MAGIC, files);
|
|
||||||
if (ret) {
|
|
||||||
printk(KERN_ERR "simple_fill_super failed: %d\n", ret);
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
spin_lock_irqsave(&ipath_devs_lock, flags);
|
|
||||||
|
|
||||||
list_for_each_entry_safe(dd, tmp, &ipath_dev_list, ipath_list) {
|
|
||||||
spin_unlock_irqrestore(&ipath_devs_lock, flags);
|
|
||||||
ret = create_device_files(sb, dd);
|
|
||||||
if (ret)
|
|
||||||
goto bail;
|
|
||||||
spin_lock_irqsave(&ipath_devs_lock, flags);
|
|
||||||
}
|
|
||||||
|
|
||||||
spin_unlock_irqrestore(&ipath_devs_lock, flags);
|
|
||||||
|
|
||||||
bail:
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
static struct dentry *ipathfs_mount(struct file_system_type *fs_type,
|
|
||||||
int flags, const char *dev_name, void *data)
|
|
||||||
{
|
|
||||||
struct dentry *ret;
|
|
||||||
ret = mount_single(fs_type, flags, data, ipathfs_fill_super);
|
|
||||||
if (!IS_ERR(ret))
|
|
||||||
ipath_super = ret->d_sb;
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
static void ipathfs_kill_super(struct super_block *s)
|
|
||||||
{
|
|
||||||
kill_litter_super(s);
|
|
||||||
ipath_super = NULL;
|
|
||||||
}
|
|
||||||
|
|
||||||
int ipathfs_add_device(struct ipath_devdata *dd)
|
|
||||||
{
|
|
||||||
int ret;
|
|
||||||
|
|
||||||
if (ipath_super == NULL) {
|
|
||||||
ret = 0;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
ret = create_device_files(ipath_super, dd);
|
|
||||||
|
|
||||||
bail:
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
int ipathfs_remove_device(struct ipath_devdata *dd)
|
|
||||||
{
|
|
||||||
int ret;
|
|
||||||
|
|
||||||
if (ipath_super == NULL) {
|
|
||||||
ret = 0;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
ret = remove_device_files(ipath_super, dd);
|
|
||||||
|
|
||||||
bail:
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
static struct file_system_type ipathfs_fs_type = {
|
|
||||||
.owner = THIS_MODULE,
|
|
||||||
.name = "ipathfs",
|
|
||||||
.mount = ipathfs_mount,
|
|
||||||
.kill_sb = ipathfs_kill_super,
|
|
||||||
};
|
|
||||||
MODULE_ALIAS_FS("ipathfs");
|
|
||||||
|
|
||||||
int __init ipath_init_ipathfs(void)
|
|
||||||
{
|
|
||||||
return register_filesystem(&ipathfs_fs_type);
|
|
||||||
}
|
|
||||||
|
|
||||||
void __exit ipath_exit_ipathfs(void)
|
|
||||||
{
|
|
||||||
unregister_filesystem(&ipathfs_fs_type);
|
|
||||||
}
|
|
||||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
@@ -1,270 +0,0 @@
|
|||||||
/*
|
|
||||||
* Copyright (c) 2006, 2007 QLogic Corporation. All rights reserved.
|
|
||||||
* Copyright (c) 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 <asm/io.h>
|
|
||||||
|
|
||||||
#include "ipath_verbs.h"
|
|
||||||
#include "ipath_kernel.h"
|
|
||||||
|
|
||||||
/**
|
|
||||||
* ipath_alloc_lkey - allocate an lkey
|
|
||||||
* @rkt: lkey table in which to allocate the lkey
|
|
||||||
* @mr: memory region that this lkey protects
|
|
||||||
*
|
|
||||||
* Returns 1 if successful, otherwise returns 0.
|
|
||||||
*/
|
|
||||||
|
|
||||||
int ipath_alloc_lkey(struct ipath_lkey_table *rkt, struct ipath_mregion *mr)
|
|
||||||
{
|
|
||||||
unsigned long flags;
|
|
||||||
u32 r;
|
|
||||||
u32 n;
|
|
||||||
int ret;
|
|
||||||
|
|
||||||
spin_lock_irqsave(&rkt->lock, flags);
|
|
||||||
|
|
||||||
/* Find the next available LKEY */
|
|
||||||
r = n = rkt->next;
|
|
||||||
for (;;) {
|
|
||||||
if (rkt->table[r] == NULL)
|
|
||||||
break;
|
|
||||||
r = (r + 1) & (rkt->max - 1);
|
|
||||||
if (r == n) {
|
|
||||||
spin_unlock_irqrestore(&rkt->lock, flags);
|
|
||||||
ipath_dbg("LKEY table full\n");
|
|
||||||
ret = 0;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
rkt->next = (r + 1) & (rkt->max - 1);
|
|
||||||
/*
|
|
||||||
* Make sure lkey is never zero which is reserved to indicate an
|
|
||||||
* unrestricted LKEY.
|
|
||||||
*/
|
|
||||||
rkt->gen++;
|
|
||||||
mr->lkey = (r << (32 - ib_ipath_lkey_table_size)) |
|
|
||||||
((((1 << (24 - ib_ipath_lkey_table_size)) - 1) & rkt->gen)
|
|
||||||
<< 8);
|
|
||||||
if (mr->lkey == 0) {
|
|
||||||
mr->lkey |= 1 << 8;
|
|
||||||
rkt->gen++;
|
|
||||||
}
|
|
||||||
rkt->table[r] = mr;
|
|
||||||
spin_unlock_irqrestore(&rkt->lock, flags);
|
|
||||||
|
|
||||||
ret = 1;
|
|
||||||
|
|
||||||
bail:
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* ipath_free_lkey - free an lkey
|
|
||||||
* @rkt: table from which to free the lkey
|
|
||||||
* @lkey: lkey id to free
|
|
||||||
*/
|
|
||||||
void ipath_free_lkey(struct ipath_lkey_table *rkt, u32 lkey)
|
|
||||||
{
|
|
||||||
unsigned long flags;
|
|
||||||
u32 r;
|
|
||||||
|
|
||||||
if (lkey == 0)
|
|
||||||
return;
|
|
||||||
r = lkey >> (32 - ib_ipath_lkey_table_size);
|
|
||||||
spin_lock_irqsave(&rkt->lock, flags);
|
|
||||||
rkt->table[r] = NULL;
|
|
||||||
spin_unlock_irqrestore(&rkt->lock, flags);
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* ipath_lkey_ok - check IB SGE for validity and initialize
|
|
||||||
* @rkt: table containing lkey to check SGE against
|
|
||||||
* @isge: outgoing internal SGE
|
|
||||||
* @sge: SGE to check
|
|
||||||
* @acc: access flags
|
|
||||||
*
|
|
||||||
* Return 1 if valid and successful, otherwise returns 0.
|
|
||||||
*
|
|
||||||
* Check the IB SGE for validity and initialize our internal version
|
|
||||||
* of it.
|
|
||||||
*/
|
|
||||||
int ipath_lkey_ok(struct ipath_qp *qp, struct ipath_sge *isge,
|
|
||||||
struct ib_sge *sge, int acc)
|
|
||||||
{
|
|
||||||
struct ipath_lkey_table *rkt = &to_idev(qp->ibqp.device)->lk_table;
|
|
||||||
struct ipath_mregion *mr;
|
|
||||||
unsigned n, m;
|
|
||||||
size_t off;
|
|
||||||
int ret;
|
|
||||||
|
|
||||||
/*
|
|
||||||
* We use LKEY == zero for kernel virtual addresses
|
|
||||||
* (see ipath_get_dma_mr and ipath_dma.c).
|
|
||||||
*/
|
|
||||||
if (sge->lkey == 0) {
|
|
||||||
/* always a kernel port, no locking needed */
|
|
||||||
struct ipath_pd *pd = to_ipd(qp->ibqp.pd);
|
|
||||||
|
|
||||||
if (pd->user) {
|
|
||||||
ret = 0;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
isge->mr = NULL;
|
|
||||||
isge->vaddr = (void *) sge->addr;
|
|
||||||
isge->length = sge->length;
|
|
||||||
isge->sge_length = sge->length;
|
|
||||||
ret = 1;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
mr = rkt->table[(sge->lkey >> (32 - ib_ipath_lkey_table_size))];
|
|
||||||
if (unlikely(mr == NULL || mr->lkey != sge->lkey ||
|
|
||||||
qp->ibqp.pd != mr->pd)) {
|
|
||||||
ret = 0;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
off = sge->addr - mr->user_base;
|
|
||||||
if (unlikely(sge->addr < mr->user_base ||
|
|
||||||
off + sge->length > mr->length ||
|
|
||||||
(mr->access_flags & acc) != acc)) {
|
|
||||||
ret = 0;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
off += mr->offset;
|
|
||||||
m = 0;
|
|
||||||
n = 0;
|
|
||||||
while (off >= mr->map[m]->segs[n].length) {
|
|
||||||
off -= mr->map[m]->segs[n].length;
|
|
||||||
n++;
|
|
||||||
if (n >= IPATH_SEGSZ) {
|
|
||||||
m++;
|
|
||||||
n = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
isge->mr = mr;
|
|
||||||
isge->vaddr = mr->map[m]->segs[n].vaddr + off;
|
|
||||||
isge->length = mr->map[m]->segs[n].length - off;
|
|
||||||
isge->sge_length = sge->length;
|
|
||||||
isge->m = m;
|
|
||||||
isge->n = n;
|
|
||||||
|
|
||||||
ret = 1;
|
|
||||||
|
|
||||||
bail:
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* ipath_rkey_ok - check the IB virtual address, length, and RKEY
|
|
||||||
* @dev: infiniband device
|
|
||||||
* @ss: SGE state
|
|
||||||
* @len: length of data
|
|
||||||
* @vaddr: virtual address to place data
|
|
||||||
* @rkey: rkey to check
|
|
||||||
* @acc: access flags
|
|
||||||
*
|
|
||||||
* Return 1 if successful, otherwise 0.
|
|
||||||
*/
|
|
||||||
int ipath_rkey_ok(struct ipath_qp *qp, struct ipath_sge_state *ss,
|
|
||||||
u32 len, u64 vaddr, u32 rkey, int acc)
|
|
||||||
{
|
|
||||||
struct ipath_ibdev *dev = to_idev(qp->ibqp.device);
|
|
||||||
struct ipath_lkey_table *rkt = &dev->lk_table;
|
|
||||||
struct ipath_sge *sge = &ss->sge;
|
|
||||||
struct ipath_mregion *mr;
|
|
||||||
unsigned n, m;
|
|
||||||
size_t off;
|
|
||||||
int ret;
|
|
||||||
|
|
||||||
/*
|
|
||||||
* We use RKEY == zero for kernel virtual addresses
|
|
||||||
* (see ipath_get_dma_mr and ipath_dma.c).
|
|
||||||
*/
|
|
||||||
if (rkey == 0) {
|
|
||||||
/* always a kernel port, no locking needed */
|
|
||||||
struct ipath_pd *pd = to_ipd(qp->ibqp.pd);
|
|
||||||
|
|
||||||
if (pd->user) {
|
|
||||||
ret = 0;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
sge->mr = NULL;
|
|
||||||
sge->vaddr = (void *) vaddr;
|
|
||||||
sge->length = len;
|
|
||||||
sge->sge_length = len;
|
|
||||||
ss->sg_list = NULL;
|
|
||||||
ss->num_sge = 1;
|
|
||||||
ret = 1;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
mr = rkt->table[(rkey >> (32 - ib_ipath_lkey_table_size))];
|
|
||||||
if (unlikely(mr == NULL || mr->lkey != rkey ||
|
|
||||||
qp->ibqp.pd != mr->pd)) {
|
|
||||||
ret = 0;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
off = vaddr - mr->iova;
|
|
||||||
if (unlikely(vaddr < mr->iova || off + len > mr->length ||
|
|
||||||
(mr->access_flags & acc) == 0)) {
|
|
||||||
ret = 0;
|
|
||||||
goto bail;
|
|
||||||
}
|
|
||||||
|
|
||||||
off += mr->offset;
|
|
||||||
m = 0;
|
|
||||||
n = 0;
|
|
||||||
while (off >= mr->map[m]->segs[n].length) {
|
|
||||||
off -= mr->map[m]->segs[n].length;
|
|
||||||
n++;
|
|
||||||
if (n >= IPATH_SEGSZ) {
|
|
||||||
m++;
|
|
||||||
n = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
sge->mr = mr;
|
|
||||||
sge->vaddr = mr->map[m]->segs[n].vaddr + off;
|
|
||||||
sge->length = mr->map[m]->segs[n].length - off;
|
|
||||||
sge->sge_length = len;
|
|
||||||
sge->m = m;
|
|
||||||
sge->n = n;
|
|
||||||
ss->sg_list = NULL;
|
|
||||||
ss->num_sge = 1;
|
|
||||||
|
|
||||||
ret = 1;
|
|
||||||
|
|
||||||
bail:
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user