2015-07-30 19:17:43 +00:00
|
|
|
/*
|
2017-04-13 03:29:29 +00:00
|
|
|
* Copyright(c) 2015-2017 Intel Corporation.
|
2015-07-30 19:17:43 +00:00
|
|
|
*
|
|
|
|
* This file is provided under a dual BSD/GPLv2 license. When using or
|
|
|
|
* redistributing this file, you may do so under either license.
|
|
|
|
*
|
|
|
|
* GPL LICENSE SUMMARY
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of version 2 of the GNU General Public License as
|
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful, but
|
|
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* General Public License for more details.
|
|
|
|
*
|
|
|
|
* BSD LICENSE
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
*
|
|
|
|
* - Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* - Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in
|
|
|
|
* the documentation and/or other materials provided with the
|
|
|
|
* distribution.
|
|
|
|
* - Neither the name of Intel Corporation nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived
|
|
|
|
* from this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
#include <linux/poll.h>
|
|
|
|
#include <linux/cdev.h>
|
|
|
|
#include <linux/vmalloc.h>
|
|
|
|
#include <linux/io.h>
|
2017-02-08 17:51:29 +00:00
|
|
|
#include <linux/sched/mm.h>
|
2015-07-30 19:17:43 +00:00
|
|
|
|
2016-04-11 01:13:13 +00:00
|
|
|
#include <rdma/ib.h>
|
|
|
|
|
2015-07-30 19:17:43 +00:00
|
|
|
#include "hfi.h"
|
|
|
|
#include "pio.h"
|
|
|
|
#include "device.h"
|
|
|
|
#include "common.h"
|
|
|
|
#include "trace.h"
|
|
|
|
#include "user_sdma.h"
|
2015-10-30 22:58:43 +00:00
|
|
|
#include "user_exp_rcv.h"
|
staging/rdma/hfi1: Add support for enabling/disabling PCIe ASPM
hfi1 HW has a high PCIe ASPM L1 exit latency and also advertises an
acceptable latency less than actual ASPM latencies. Additional
mechanisms than those provided by BIOS/OS are therefore required to
enable/disable ASPM for hfi1 to provide acceptable power/performance
trade offs. This patch adds this support.
By means of a module parameter ASPM can be either (a) always enabled
(power save mode) (b) always disabled (performance mode) (c)
enabled/disabled dynamically. The dynamic mode implements two
heuristics to alleviate possible problems with high ASPM L1 exit
latency. ASPM is normally enabled but is disabled if (a) there are any
active user space PSM contexts, or (b) for verbs, ASPM is disabled as
interrupt activity for a context starts to increase.
A few more points about the verbs implementation. In order to reduce
lock/cache contention between multiple verbs contexts, some processing
is done at the context layer before contending for device layer
locks. ASPM is disabled when two interrupts for a context happen
within 1 millisec. A timer is scheduled which will re-enable ASPM
after 1 second should the interrupt activity cease. Normally, every
interrupt, or interrupt-pair should push the timer out
further. However, since this might increase the processing load per
interrupt, pushing the timer out is postponed for half a second. If
after half a second we get two interrupts within 1 millisec the timer
is pushed out by another second.
Finally, the kernel ASPM API is not used in this patch. This is
because this patch does several non-standard things as SW workarounds
for HW issues. As mentioned above, it enables ASPM even when advertised
actual latencies are greater than acceptable latencies. Also, whereas
the kernel API only allows drivers to disable ASPM from driver probe,
this patch enables/disables ASPM directly from interrupt context. Due
to these reasons the kernel ASPM API was not used.
Reviewed-by: Mike Marciniszyn <mike.marciniszyn@intel.com>
Reviewed-by: Dean Luick <dean.luick@intel.com>
Reviewed-by: Ira Weiny <ira.weiny@intel.com>
Signed-off-by: Ashutosh Dixit <ashutosh.dixit@intel.com>
Signed-off-by: Doug Ledford <dledford@redhat.com>
2016-02-03 22:33:06 +00:00
|
|
|
#include "aspm.h"
|
2016-03-08 19:14:20 +00:00
|
|
|
#include "mmu_rb.h"
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
#undef pr_fmt
|
|
|
|
#define pr_fmt(fmt) DRIVER_NAME ": " fmt
|
|
|
|
|
|
|
|
#define SEND_CTXT_HALT_TIMEOUT 1000 /* msecs */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* File operation functions
|
|
|
|
*/
|
|
|
|
static int hfi1_file_open(struct inode *, struct file *);
|
|
|
|
static int hfi1_file_close(struct inode *, struct file *);
|
|
|
|
static ssize_t hfi1_write_iter(struct kiocb *, struct iov_iter *);
|
|
|
|
static unsigned int hfi1_poll(struct file *, struct poll_table_struct *);
|
|
|
|
static int hfi1_file_mmap(struct file *, struct vm_area_struct *);
|
|
|
|
|
|
|
|
static u64 kvirt_to_phys(void *);
|
|
|
|
static int assign_ctxt(struct file *, struct hfi1_user_info *);
|
|
|
|
static int init_subctxts(struct hfi1_ctxtdata *, const struct hfi1_user_info *);
|
|
|
|
static int user_init(struct file *);
|
|
|
|
static int get_ctxt_info(struct file *, void __user *, __u32);
|
|
|
|
static int get_base_info(struct file *, void __user *, __u32);
|
|
|
|
static int setup_ctxt(struct file *);
|
|
|
|
static int setup_subctxt(struct hfi1_ctxtdata *);
|
2016-05-19 12:25:50 +00:00
|
|
|
static int get_user_context(struct file *, struct hfi1_user_info *, int);
|
2015-07-30 19:17:43 +00:00
|
|
|
static int find_shared_ctxt(struct file *, const struct hfi1_user_info *);
|
|
|
|
static int allocate_ctxt(struct file *, struct hfi1_devdata *,
|
|
|
|
struct hfi1_user_info *);
|
|
|
|
static unsigned int poll_urgent(struct file *, struct poll_table_struct *);
|
|
|
|
static unsigned int poll_next(struct file *, struct poll_table_struct *);
|
|
|
|
static int user_event_ack(struct hfi1_ctxtdata *, int, unsigned long);
|
|
|
|
static int set_ctxt_pkey(struct hfi1_ctxtdata *, unsigned, u16);
|
|
|
|
static int manage_rcvq(struct hfi1_ctxtdata *, unsigned, int);
|
2017-02-24 22:56:41 +00:00
|
|
|
static int vma_fault(struct vm_fault *);
|
2016-05-19 12:26:24 +00:00
|
|
|
static long hfi1_file_ioctl(struct file *fp, unsigned int cmd,
|
|
|
|
unsigned long arg);
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
static const struct file_operations hfi1_file_ops = {
|
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.write_iter = hfi1_write_iter,
|
|
|
|
.open = hfi1_file_open,
|
|
|
|
.release = hfi1_file_close,
|
2016-05-19 12:26:24 +00:00
|
|
|
.unlocked_ioctl = hfi1_file_ioctl,
|
2015-07-30 19:17:43 +00:00
|
|
|
.poll = hfi1_poll,
|
|
|
|
.mmap = hfi1_file_mmap,
|
|
|
|
.llseek = noop_llseek,
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct vm_operations_struct vm_ops = {
|
|
|
|
.fault = vma_fault,
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Types of memories mapped into user processes' space
|
|
|
|
*/
|
|
|
|
enum mmap_types {
|
|
|
|
PIO_BUFS = 1,
|
|
|
|
PIO_BUFS_SOP,
|
|
|
|
PIO_CRED,
|
|
|
|
RCV_HDRQ,
|
|
|
|
RCV_EGRBUF,
|
|
|
|
UREGS,
|
|
|
|
EVENTS,
|
|
|
|
STATUS,
|
|
|
|
RTAIL,
|
|
|
|
SUBCTXT_UREGS,
|
|
|
|
SUBCTXT_RCV_HDRQ,
|
|
|
|
SUBCTXT_EGRBUF,
|
|
|
|
SDMA_COMP
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Masks and offsets defining the mmap tokens
|
|
|
|
*/
|
|
|
|
#define HFI1_MMAP_OFFSET_MASK 0xfffULL
|
|
|
|
#define HFI1_MMAP_OFFSET_SHIFT 0
|
|
|
|
#define HFI1_MMAP_SUBCTXT_MASK 0xfULL
|
|
|
|
#define HFI1_MMAP_SUBCTXT_SHIFT 12
|
|
|
|
#define HFI1_MMAP_CTXT_MASK 0xffULL
|
|
|
|
#define HFI1_MMAP_CTXT_SHIFT 16
|
|
|
|
#define HFI1_MMAP_TYPE_MASK 0xfULL
|
|
|
|
#define HFI1_MMAP_TYPE_SHIFT 24
|
|
|
|
#define HFI1_MMAP_MAGIC_MASK 0xffffffffULL
|
|
|
|
#define HFI1_MMAP_MAGIC_SHIFT 32
|
|
|
|
|
|
|
|
#define HFI1_MMAP_MAGIC 0xdabbad00
|
|
|
|
|
|
|
|
#define HFI1_MMAP_TOKEN_SET(field, val) \
|
|
|
|
(((val) & HFI1_MMAP_##field##_MASK) << HFI1_MMAP_##field##_SHIFT)
|
|
|
|
#define HFI1_MMAP_TOKEN_GET(field, token) \
|
|
|
|
(((token) >> HFI1_MMAP_##field##_SHIFT) & HFI1_MMAP_##field##_MASK)
|
|
|
|
#define HFI1_MMAP_TOKEN(type, ctxt, subctxt, addr) \
|
|
|
|
(HFI1_MMAP_TOKEN_SET(MAGIC, HFI1_MMAP_MAGIC) | \
|
|
|
|
HFI1_MMAP_TOKEN_SET(TYPE, type) | \
|
|
|
|
HFI1_MMAP_TOKEN_SET(CTXT, ctxt) | \
|
|
|
|
HFI1_MMAP_TOKEN_SET(SUBCTXT, subctxt) | \
|
2015-10-03 02:34:59 +00:00
|
|
|
HFI1_MMAP_TOKEN_SET(OFFSET, (offset_in_page(addr))))
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
#define dbg(fmt, ...) \
|
|
|
|
pr_info(fmt, ##__VA_ARGS__)
|
|
|
|
|
|
|
|
static inline int is_valid_mmap(u64 token)
|
|
|
|
{
|
|
|
|
return (HFI1_MMAP_TOKEN_GET(MAGIC, token) == HFI1_MMAP_MAGIC);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int hfi1_file_open(struct inode *inode, struct file *fp)
|
|
|
|
{
|
2016-07-28 16:27:35 +00:00
|
|
|
struct hfi1_filedata *fd;
|
2016-05-19 12:26:44 +00:00
|
|
|
struct hfi1_devdata *dd = container_of(inode->i_cdev,
|
|
|
|
struct hfi1_devdata,
|
|
|
|
user_cdev);
|
|
|
|
|
2016-10-25 15:57:55 +00:00
|
|
|
if (!atomic_inc_not_zero(&dd->user_refcount))
|
|
|
|
return -ENXIO;
|
|
|
|
|
2016-05-19 12:26:44 +00:00
|
|
|
/* Just take a ref now. Not all opens result in a context assign */
|
|
|
|
kobject_get(&dd->kobj);
|
|
|
|
|
2015-07-30 19:17:43 +00:00
|
|
|
/* The real work is performed later in assign_ctxt() */
|
2016-07-28 16:27:35 +00:00
|
|
|
|
|
|
|
fd = kzalloc(sizeof(*fd), GFP_KERNEL);
|
|
|
|
|
2016-07-28 19:21:19 +00:00
|
|
|
if (fd) {
|
|
|
|
fd->rec_cpu_num = -1; /* no cpu affinity by default */
|
|
|
|
fd->mm = current->mm;
|
2017-02-27 22:30:07 +00:00
|
|
|
mmgrab(fd->mm);
|
2016-10-25 15:57:55 +00:00
|
|
|
fp->private_data = fd;
|
|
|
|
} else {
|
|
|
|
fp->private_data = NULL;
|
|
|
|
|
|
|
|
if (atomic_dec_and_test(&dd->user_refcount))
|
|
|
|
complete(&dd->user_comp);
|
2016-07-28 16:27:35 +00:00
|
|
|
|
2016-10-25 15:57:55 +00:00
|
|
|
return -ENOMEM;
|
|
|
|
}
|
2016-07-28 16:27:35 +00:00
|
|
|
|
2016-10-25 15:57:55 +00:00
|
|
|
return 0;
|
2015-07-30 19:17:43 +00:00
|
|
|
}
|
|
|
|
|
2016-05-19 12:26:24 +00:00
|
|
|
static long hfi1_file_ioctl(struct file *fp, unsigned int cmd,
|
|
|
|
unsigned long arg)
|
|
|
|
{
|
|
|
|
struct hfi1_filedata *fd = fp->private_data;
|
|
|
|
struct hfi1_ctxtdata *uctxt = fd->uctxt;
|
|
|
|
struct hfi1_user_info uinfo;
|
|
|
|
struct hfi1_tid_info tinfo;
|
|
|
|
int ret = 0;
|
|
|
|
unsigned long addr;
|
|
|
|
int uval = 0;
|
|
|
|
unsigned long ul_uval = 0;
|
|
|
|
u16 uval16 = 0;
|
|
|
|
|
2016-05-19 12:26:37 +00:00
|
|
|
hfi1_cdbg(IOCTL, "IOCTL recv: 0x%x", cmd);
|
2016-05-19 12:26:24 +00:00
|
|
|
if (cmd != HFI1_IOCTL_ASSIGN_CTXT &&
|
|
|
|
cmd != HFI1_IOCTL_GET_VERS &&
|
|
|
|
!uctxt)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
switch (cmd) {
|
|
|
|
case HFI1_IOCTL_ASSIGN_CTXT:
|
2016-06-09 14:51:33 +00:00
|
|
|
if (uctxt)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2016-05-19 12:26:24 +00:00
|
|
|
if (copy_from_user(&uinfo,
|
|
|
|
(struct hfi1_user_info __user *)arg,
|
|
|
|
sizeof(uinfo)))
|
|
|
|
return -EFAULT;
|
|
|
|
|
|
|
|
ret = assign_ctxt(fp, &uinfo);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
2016-08-10 05:34:27 +00:00
|
|
|
ret = setup_ctxt(fp);
|
2016-05-19 12:26:24 +00:00
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
ret = user_init(fp);
|
|
|
|
break;
|
|
|
|
case HFI1_IOCTL_CTXT_INFO:
|
|
|
|
ret = get_ctxt_info(fp, (void __user *)(unsigned long)arg,
|
|
|
|
sizeof(struct hfi1_ctxt_info));
|
|
|
|
break;
|
|
|
|
case HFI1_IOCTL_USER_INFO:
|
|
|
|
ret = get_base_info(fp, (void __user *)(unsigned long)arg,
|
|
|
|
sizeof(struct hfi1_base_info));
|
|
|
|
break;
|
|
|
|
case HFI1_IOCTL_CREDIT_UPD:
|
2016-07-23 06:30:52 +00:00
|
|
|
if (uctxt)
|
2016-05-19 12:26:24 +00:00
|
|
|
sc_return_credits(uctxt->sc);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case HFI1_IOCTL_TID_UPDATE:
|
|
|
|
if (copy_from_user(&tinfo,
|
|
|
|
(struct hfi11_tid_info __user *)arg,
|
|
|
|
sizeof(tinfo)))
|
|
|
|
return -EFAULT;
|
|
|
|
|
|
|
|
ret = hfi1_user_exp_rcv_setup(fp, &tinfo);
|
|
|
|
if (!ret) {
|
|
|
|
/*
|
|
|
|
* Copy the number of tidlist entries we used
|
|
|
|
* and the length of the buffer we registered.
|
|
|
|
* These fields are adjacent in the structure so
|
|
|
|
* we can copy them at the same time.
|
|
|
|
*/
|
|
|
|
addr = arg + offsetof(struct hfi1_tid_info, tidcnt);
|
|
|
|
if (copy_to_user((void __user *)addr, &tinfo.tidcnt,
|
|
|
|
sizeof(tinfo.tidcnt) +
|
|
|
|
sizeof(tinfo.length)))
|
|
|
|
ret = -EFAULT;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case HFI1_IOCTL_TID_FREE:
|
|
|
|
if (copy_from_user(&tinfo,
|
|
|
|
(struct hfi11_tid_info __user *)arg,
|
|
|
|
sizeof(tinfo)))
|
|
|
|
return -EFAULT;
|
|
|
|
|
|
|
|
ret = hfi1_user_exp_rcv_clear(fp, &tinfo);
|
|
|
|
if (ret)
|
|
|
|
break;
|
|
|
|
addr = arg + offsetof(struct hfi1_tid_info, tidcnt);
|
|
|
|
if (copy_to_user((void __user *)addr, &tinfo.tidcnt,
|
|
|
|
sizeof(tinfo.tidcnt)))
|
|
|
|
ret = -EFAULT;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case HFI1_IOCTL_TID_INVAL_READ:
|
|
|
|
if (copy_from_user(&tinfo,
|
|
|
|
(struct hfi11_tid_info __user *)arg,
|
|
|
|
sizeof(tinfo)))
|
|
|
|
return -EFAULT;
|
|
|
|
|
|
|
|
ret = hfi1_user_exp_rcv_invalid(fp, &tinfo);
|
|
|
|
if (ret)
|
|
|
|
break;
|
|
|
|
addr = arg + offsetof(struct hfi1_tid_info, tidcnt);
|
|
|
|
if (copy_to_user((void __user *)addr, &tinfo.tidcnt,
|
|
|
|
sizeof(tinfo.tidcnt)))
|
|
|
|
ret = -EFAULT;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case HFI1_IOCTL_RECV_CTRL:
|
|
|
|
ret = get_user(uval, (int __user *)arg);
|
|
|
|
if (ret != 0)
|
|
|
|
return -EFAULT;
|
|
|
|
ret = manage_rcvq(uctxt, fd->subctxt, uval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case HFI1_IOCTL_POLL_TYPE:
|
|
|
|
ret = get_user(uval, (int __user *)arg);
|
|
|
|
if (ret != 0)
|
|
|
|
return -EFAULT;
|
|
|
|
uctxt->poll_type = (typeof(uctxt->poll_type))uval;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case HFI1_IOCTL_ACK_EVENT:
|
|
|
|
ret = get_user(ul_uval, (unsigned long __user *)arg);
|
|
|
|
if (ret != 0)
|
|
|
|
return -EFAULT;
|
|
|
|
ret = user_event_ack(uctxt, fd->subctxt, ul_uval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case HFI1_IOCTL_SET_PKEY:
|
|
|
|
ret = get_user(uval16, (u16 __user *)arg);
|
|
|
|
if (ret != 0)
|
|
|
|
return -EFAULT;
|
|
|
|
if (HFI1_CAP_IS_USET(PKEY_CHECK))
|
|
|
|
ret = set_ctxt_pkey(uctxt, fd->subctxt, uval16);
|
|
|
|
else
|
|
|
|
return -EPERM;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case HFI1_IOCTL_CTXT_RESET: {
|
|
|
|
struct send_context *sc;
|
|
|
|
struct hfi1_devdata *dd;
|
|
|
|
|
|
|
|
if (!uctxt || !uctxt->dd || !uctxt->sc)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* There is no protection here. User level has to
|
|
|
|
* guarantee that no one will be writing to the send
|
|
|
|
* context while it is being re-initialized.
|
|
|
|
* If user level breaks that guarantee, it will break
|
|
|
|
* it's own context and no one else's.
|
|
|
|
*/
|
|
|
|
dd = uctxt->dd;
|
|
|
|
sc = uctxt->sc;
|
|
|
|
/*
|
|
|
|
* Wait until the interrupt handler has marked the
|
|
|
|
* context as halted or frozen. Report error if we time
|
|
|
|
* out.
|
|
|
|
*/
|
|
|
|
wait_event_interruptible_timeout(
|
|
|
|
sc->halt_wait, (sc->flags & SCF_HALTED),
|
|
|
|
msecs_to_jiffies(SEND_CTXT_HALT_TIMEOUT));
|
|
|
|
if (!(sc->flags & SCF_HALTED))
|
|
|
|
return -ENOLCK;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the send context was halted due to a Freeze,
|
|
|
|
* wait until the device has been "unfrozen" before
|
|
|
|
* resetting the context.
|
|
|
|
*/
|
|
|
|
if (sc->flags & SCF_FROZEN) {
|
|
|
|
wait_event_interruptible_timeout(
|
|
|
|
dd->event_queue,
|
|
|
|
!(ACCESS_ONCE(dd->flags) & HFI1_FROZEN),
|
|
|
|
msecs_to_jiffies(SEND_CTXT_HALT_TIMEOUT));
|
|
|
|
if (dd->flags & HFI1_FROZEN)
|
|
|
|
return -ENOLCK;
|
|
|
|
|
|
|
|
if (dd->flags & HFI1_FORCED_FREEZE)
|
|
|
|
/*
|
|
|
|
* Don't allow context reset if we are into
|
|
|
|
* forced freeze
|
|
|
|
*/
|
|
|
|
return -ENODEV;
|
|
|
|
|
|
|
|
sc_disable(sc);
|
|
|
|
ret = sc_enable(sc);
|
|
|
|
hfi1_rcvctrl(dd, HFI1_RCVCTRL_CTXT_ENB,
|
|
|
|
uctxt->ctxt);
|
|
|
|
} else {
|
|
|
|
ret = sc_restart(sc);
|
|
|
|
}
|
|
|
|
if (!ret)
|
|
|
|
sc_return_credits(sc);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case HFI1_IOCTL_GET_VERS:
|
|
|
|
uval = HFI1_USER_SWVERSION;
|
|
|
|
if (put_user(uval, (int __user *)arg))
|
|
|
|
return -EFAULT;
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2015-07-30 19:17:43 +00:00
|
|
|
static ssize_t hfi1_write_iter(struct kiocb *kiocb, struct iov_iter *from)
|
|
|
|
{
|
2015-10-30 22:58:40 +00:00
|
|
|
struct hfi1_filedata *fd = kiocb->ki_filp->private_data;
|
|
|
|
struct hfi1_user_sdma_pkt_q *pq = fd->pq;
|
|
|
|
struct hfi1_user_sdma_comp_q *cq = fd->cq;
|
2016-07-01 23:00:55 +00:00
|
|
|
int done = 0, reqs = 0;
|
2015-07-30 19:17:43 +00:00
|
|
|
unsigned long dim = from->nr_segs;
|
|
|
|
|
2016-07-01 23:00:55 +00:00
|
|
|
if (!cq || !pq)
|
|
|
|
return -EIO;
|
2015-07-30 19:17:43 +00:00
|
|
|
|
2016-07-01 23:00:55 +00:00
|
|
|
if (!iter_is_iovec(from) || !dim)
|
|
|
|
return -EINVAL;
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
hfi1_cdbg(SDMA, "SDMA request from %u:%u (%lu)",
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->uctxt->ctxt, fd->subctxt, dim);
|
2015-07-30 19:17:43 +00:00
|
|
|
|
2016-07-01 23:00:55 +00:00
|
|
|
if (atomic_read(&pq->n_reqs) == pq->n_max_reqs)
|
|
|
|
return -ENOSPC;
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
while (dim) {
|
2016-07-01 23:00:55 +00:00
|
|
|
int ret;
|
2015-07-30 19:17:43 +00:00
|
|
|
unsigned long count = 0;
|
|
|
|
|
|
|
|
ret = hfi1_user_sdma_process_request(
|
|
|
|
kiocb->ki_filp, (struct iovec *)(from->iov + done),
|
|
|
|
dim, &count);
|
2016-07-01 23:00:55 +00:00
|
|
|
if (ret) {
|
|
|
|
reqs = ret;
|
|
|
|
break;
|
|
|
|
}
|
2015-07-30 19:17:43 +00:00
|
|
|
dim -= count;
|
|
|
|
done += count;
|
|
|
|
reqs++;
|
|
|
|
}
|
2016-07-01 23:00:55 +00:00
|
|
|
|
|
|
|
return reqs;
|
2015-07-30 19:17:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int hfi1_file_mmap(struct file *fp, struct vm_area_struct *vma)
|
|
|
|
{
|
2015-10-30 22:58:40 +00:00
|
|
|
struct hfi1_filedata *fd = fp->private_data;
|
|
|
|
struct hfi1_ctxtdata *uctxt = fd->uctxt;
|
2015-07-30 19:17:43 +00:00
|
|
|
struct hfi1_devdata *dd;
|
2016-09-06 11:35:54 +00:00
|
|
|
unsigned long flags;
|
2015-07-30 19:17:43 +00:00
|
|
|
u64 token = vma->vm_pgoff << PAGE_SHIFT,
|
|
|
|
memaddr = 0;
|
2016-09-06 11:35:54 +00:00
|
|
|
void *memvirt = NULL;
|
2015-07-30 19:17:43 +00:00
|
|
|
u8 subctxt, mapio = 0, vmf = 0, type;
|
|
|
|
ssize_t memlen = 0;
|
|
|
|
int ret = 0;
|
|
|
|
u16 ctxt;
|
|
|
|
|
|
|
|
if (!is_valid_mmap(token) || !uctxt ||
|
|
|
|
!(vma->vm_flags & VM_SHARED)) {
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
dd = uctxt->dd;
|
|
|
|
ctxt = HFI1_MMAP_TOKEN_GET(CTXT, token);
|
|
|
|
subctxt = HFI1_MMAP_TOKEN_GET(SUBCTXT, token);
|
|
|
|
type = HFI1_MMAP_TOKEN_GET(TYPE, token);
|
2015-10-30 22:58:40 +00:00
|
|
|
if (ctxt != uctxt->ctxt || subctxt != fd->subctxt) {
|
2015-07-30 19:17:43 +00:00
|
|
|
ret = -EINVAL;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
flags = vma->vm_flags;
|
|
|
|
|
|
|
|
switch (type) {
|
|
|
|
case PIO_BUFS:
|
|
|
|
case PIO_BUFS_SOP:
|
|
|
|
memaddr = ((dd->physaddr + TXE_PIO_SEND) +
|
|
|
|
/* chip pio base */
|
2015-10-16 16:39:08 +00:00
|
|
|
(uctxt->sc->hw_context * BIT(16))) +
|
2015-07-30 19:17:43 +00:00
|
|
|
/* 64K PIO space / ctxt */
|
|
|
|
(type == PIO_BUFS_SOP ?
|
|
|
|
(TXE_PIO_SIZE / 2) : 0); /* sop? */
|
|
|
|
/*
|
|
|
|
* Map only the amount allocated to the context, not the
|
|
|
|
* entire available context's PIO space.
|
|
|
|
*/
|
2016-03-04 17:15:00 +00:00
|
|
|
memlen = PAGE_ALIGN(uctxt->sc->credits * PIO_BLOCK_SIZE);
|
2015-07-30 19:17:43 +00:00
|
|
|
flags &= ~VM_MAYREAD;
|
|
|
|
flags |= VM_DONTCOPY | VM_DONTEXPAND;
|
|
|
|
vma->vm_page_prot = pgprot_writecombine(vma->vm_page_prot);
|
|
|
|
mapio = 1;
|
|
|
|
break;
|
|
|
|
case PIO_CRED:
|
|
|
|
if (flags & VM_WRITE) {
|
|
|
|
ret = -EPERM;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* The credit return location for this context could be on the
|
|
|
|
* second or third page allocated for credit returns (if number
|
|
|
|
* of enabled contexts > 64 and 128 respectively).
|
|
|
|
*/
|
2016-09-06 11:35:54 +00:00
|
|
|
memvirt = dd->cr_base[uctxt->numa_id].va;
|
|
|
|
memaddr = virt_to_phys(memvirt) +
|
2015-07-30 19:17:43 +00:00
|
|
|
(((u64)uctxt->sc->hw_free -
|
|
|
|
(u64)dd->cr_base[uctxt->numa_id].va) & PAGE_MASK);
|
|
|
|
memlen = PAGE_SIZE;
|
|
|
|
flags &= ~VM_MAYWRITE;
|
|
|
|
flags |= VM_DONTCOPY | VM_DONTEXPAND;
|
|
|
|
/*
|
|
|
|
* The driver has already allocated memory for credit
|
|
|
|
* returns and programmed it into the chip. Has that
|
|
|
|
* memory been flagged as non-cached?
|
|
|
|
*/
|
|
|
|
/* vma->vm_page_prot = pgprot_noncached(vma->vm_page_prot); */
|
|
|
|
mapio = 1;
|
|
|
|
break;
|
|
|
|
case RCV_HDRQ:
|
|
|
|
memlen = uctxt->rcvhdrq_size;
|
2016-09-06 11:35:54 +00:00
|
|
|
memvirt = uctxt->rcvhdrq;
|
2015-07-30 19:17:43 +00:00
|
|
|
break;
|
|
|
|
case RCV_EGRBUF: {
|
|
|
|
unsigned long addr;
|
|
|
|
int i;
|
|
|
|
/*
|
|
|
|
* The RcvEgr buffer need to be handled differently
|
|
|
|
* as multiple non-contiguous pages need to be mapped
|
|
|
|
* into the user process.
|
|
|
|
*/
|
|
|
|
memlen = uctxt->egrbufs.size;
|
|
|
|
if ((vma->vm_end - vma->vm_start) != memlen) {
|
|
|
|
dd_dev_err(dd, "Eager buffer map size invalid (%lu != %lu)\n",
|
|
|
|
(vma->vm_end - vma->vm_start), memlen);
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
if (vma->vm_flags & VM_WRITE) {
|
|
|
|
ret = -EPERM;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
vma->vm_flags &= ~VM_MAYWRITE;
|
|
|
|
addr = vma->vm_start;
|
|
|
|
for (i = 0 ; i < uctxt->egrbufs.numbufs; i++) {
|
2016-09-06 11:35:54 +00:00
|
|
|
memlen = uctxt->egrbufs.buffers[i].len;
|
|
|
|
memvirt = uctxt->egrbufs.buffers[i].addr;
|
2015-07-30 19:17:43 +00:00
|
|
|
ret = remap_pfn_range(
|
|
|
|
vma, addr,
|
2016-09-06 11:35:54 +00:00
|
|
|
/*
|
|
|
|
* virt_to_pfn() does the same, but
|
|
|
|
* it's not available on x86_64
|
|
|
|
* when CONFIG_MMU is enabled.
|
|
|
|
*/
|
|
|
|
PFN_DOWN(__pa(memvirt)),
|
|
|
|
memlen,
|
2015-07-30 19:17:43 +00:00
|
|
|
vma->vm_page_prot);
|
|
|
|
if (ret < 0)
|
|
|
|
goto done;
|
2016-09-06 11:35:54 +00:00
|
|
|
addr += memlen;
|
2015-07-30 19:17:43 +00:00
|
|
|
}
|
|
|
|
ret = 0;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
case UREGS:
|
|
|
|
/*
|
|
|
|
* Map only the page that contains this context's user
|
|
|
|
* registers.
|
|
|
|
*/
|
|
|
|
memaddr = (unsigned long)
|
|
|
|
(dd->physaddr + RXE_PER_CONTEXT_USER)
|
|
|
|
+ (uctxt->ctxt * RXE_PER_CONTEXT_SIZE);
|
|
|
|
/*
|
|
|
|
* TidFlow table is on the same page as the rest of the
|
|
|
|
* user registers.
|
|
|
|
*/
|
|
|
|
memlen = PAGE_SIZE;
|
|
|
|
flags |= VM_DONTCOPY | VM_DONTEXPAND;
|
|
|
|
vma->vm_page_prot = pgprot_noncached(vma->vm_page_prot);
|
|
|
|
mapio = 1;
|
|
|
|
break;
|
|
|
|
case EVENTS:
|
|
|
|
/*
|
|
|
|
* Use the page where this context's flags are. User level
|
|
|
|
* knows where it's own bitmap is within the page.
|
|
|
|
*/
|
2015-10-26 14:28:39 +00:00
|
|
|
memaddr = (unsigned long)(dd->events +
|
2017-04-13 03:29:29 +00:00
|
|
|
((uctxt->ctxt - dd->first_dyn_alloc_ctxt) *
|
|
|
|
HFI1_MAX_SHARED_CTXTS)) & PAGE_MASK;
|
2015-07-30 19:17:43 +00:00
|
|
|
memlen = PAGE_SIZE;
|
|
|
|
/*
|
|
|
|
* v3.7 removes VM_RESERVED but the effect is kept by
|
|
|
|
* using VM_IO.
|
|
|
|
*/
|
|
|
|
flags |= VM_IO | VM_DONTEXPAND;
|
|
|
|
vmf = 1;
|
|
|
|
break;
|
|
|
|
case STATUS:
|
2017-04-09 17:17:24 +00:00
|
|
|
if (flags & (unsigned long)(VM_WRITE | VM_EXEC)) {
|
|
|
|
ret = -EPERM;
|
|
|
|
goto done;
|
|
|
|
}
|
2015-07-30 19:17:43 +00:00
|
|
|
memaddr = kvirt_to_phys((void *)dd->status);
|
|
|
|
memlen = PAGE_SIZE;
|
|
|
|
flags |= VM_IO | VM_DONTEXPAND;
|
|
|
|
break;
|
|
|
|
case RTAIL:
|
|
|
|
if (!HFI1_CAP_IS_USET(DMA_RTAIL)) {
|
|
|
|
/*
|
|
|
|
* If the memory allocation failed, the context alloc
|
|
|
|
* also would have failed, so we would never get here
|
|
|
|
*/
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
if (flags & VM_WRITE) {
|
|
|
|
ret = -EPERM;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
memlen = PAGE_SIZE;
|
2016-09-06 11:35:54 +00:00
|
|
|
memvirt = (void *)uctxt->rcvhdrtail_kvaddr;
|
2015-07-30 19:17:43 +00:00
|
|
|
flags &= ~VM_MAYWRITE;
|
|
|
|
break;
|
|
|
|
case SUBCTXT_UREGS:
|
|
|
|
memaddr = (u64)uctxt->subctxt_uregbase;
|
|
|
|
memlen = PAGE_SIZE;
|
|
|
|
flags |= VM_IO | VM_DONTEXPAND;
|
|
|
|
vmf = 1;
|
|
|
|
break;
|
|
|
|
case SUBCTXT_RCV_HDRQ:
|
|
|
|
memaddr = (u64)uctxt->subctxt_rcvhdr_base;
|
|
|
|
memlen = uctxt->rcvhdrq_size * uctxt->subctxt_cnt;
|
|
|
|
flags |= VM_IO | VM_DONTEXPAND;
|
|
|
|
vmf = 1;
|
|
|
|
break;
|
|
|
|
case SUBCTXT_EGRBUF:
|
|
|
|
memaddr = (u64)uctxt->subctxt_rcvegrbuf;
|
|
|
|
memlen = uctxt->egrbufs.size * uctxt->subctxt_cnt;
|
|
|
|
flags |= VM_IO | VM_DONTEXPAND;
|
|
|
|
flags &= ~VM_MAYWRITE;
|
|
|
|
vmf = 1;
|
|
|
|
break;
|
|
|
|
case SDMA_COMP: {
|
2015-10-30 22:58:40 +00:00
|
|
|
struct hfi1_user_sdma_comp_q *cq = fd->cq;
|
2015-07-30 19:17:43 +00:00
|
|
|
|
2015-10-30 22:58:40 +00:00
|
|
|
if (!cq) {
|
2015-07-30 19:17:43 +00:00
|
|
|
ret = -EFAULT;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
memaddr = (u64)cq->comps;
|
2016-03-04 17:15:00 +00:00
|
|
|
memlen = PAGE_ALIGN(sizeof(*cq->comps) * cq->nentries);
|
2015-07-30 19:17:43 +00:00
|
|
|
flags |= VM_IO | VM_DONTEXPAND;
|
|
|
|
vmf = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
ret = -EINVAL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((vma->vm_end - vma->vm_start) != memlen) {
|
|
|
|
hfi1_cdbg(PROC, "%u:%u Memory size mismatch %lu:%lu",
|
2015-10-30 22:58:40 +00:00
|
|
|
uctxt->ctxt, fd->subctxt,
|
2015-07-30 19:17:43 +00:00
|
|
|
(vma->vm_end - vma->vm_start), memlen);
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
vma->vm_flags = flags;
|
2015-11-07 01:06:56 +00:00
|
|
|
hfi1_cdbg(PROC,
|
|
|
|
"%u:%u type:%u io/vf:%d/%d, addr:0x%llx, len:%lu(%lu), flags:0x%lx\n",
|
|
|
|
ctxt, subctxt, type, mapio, vmf, memaddr, memlen,
|
2015-07-30 19:17:43 +00:00
|
|
|
vma->vm_end - vma->vm_start, vma->vm_flags);
|
|
|
|
if (vmf) {
|
2016-09-06 11:35:54 +00:00
|
|
|
vma->vm_pgoff = PFN_DOWN(memaddr);
|
2015-07-30 19:17:43 +00:00
|
|
|
vma->vm_ops = &vm_ops;
|
|
|
|
ret = 0;
|
|
|
|
} else if (mapio) {
|
2016-09-06 11:35:54 +00:00
|
|
|
ret = io_remap_pfn_range(vma, vma->vm_start,
|
|
|
|
PFN_DOWN(memaddr),
|
|
|
|
memlen,
|
2015-07-30 19:17:43 +00:00
|
|
|
vma->vm_page_prot);
|
2016-09-06 11:35:54 +00:00
|
|
|
} else if (memvirt) {
|
|
|
|
ret = remap_pfn_range(vma, vma->vm_start,
|
|
|
|
PFN_DOWN(__pa(memvirt)),
|
|
|
|
memlen,
|
|
|
|
vma->vm_page_prot);
|
2015-07-30 19:17:43 +00:00
|
|
|
} else {
|
2016-09-06 11:35:54 +00:00
|
|
|
ret = remap_pfn_range(vma, vma->vm_start,
|
|
|
|
PFN_DOWN(memaddr),
|
|
|
|
memlen,
|
2015-07-30 19:17:43 +00:00
|
|
|
vma->vm_page_prot);
|
|
|
|
}
|
|
|
|
done:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Local (non-chip) user memory is not mapped right away but as it is
|
|
|
|
* accessed by the user-level code.
|
|
|
|
*/
|
2017-02-24 22:56:41 +00:00
|
|
|
static int vma_fault(struct vm_fault *vmf)
|
2015-07-30 19:17:43 +00:00
|
|
|
{
|
|
|
|
struct page *page;
|
|
|
|
|
|
|
|
page = vmalloc_to_page((void *)(vmf->pgoff << PAGE_SHIFT));
|
|
|
|
if (!page)
|
|
|
|
return VM_FAULT_SIGBUS;
|
|
|
|
|
|
|
|
get_page(page);
|
|
|
|
vmf->page = page;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned int hfi1_poll(struct file *fp, struct poll_table_struct *pt)
|
|
|
|
{
|
|
|
|
struct hfi1_ctxtdata *uctxt;
|
|
|
|
unsigned pollflag;
|
|
|
|
|
2015-10-30 22:58:40 +00:00
|
|
|
uctxt = ((struct hfi1_filedata *)fp->private_data)->uctxt;
|
2015-07-30 19:17:43 +00:00
|
|
|
if (!uctxt)
|
|
|
|
pollflag = POLLERR;
|
|
|
|
else if (uctxt->poll_type == HFI1_POLL_TYPE_URGENT)
|
|
|
|
pollflag = poll_urgent(fp, pt);
|
|
|
|
else if (uctxt->poll_type == HFI1_POLL_TYPE_ANYRCV)
|
|
|
|
pollflag = poll_next(fp, pt);
|
|
|
|
else /* invalid */
|
|
|
|
pollflag = POLLERR;
|
|
|
|
|
|
|
|
return pollflag;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int hfi1_file_close(struct inode *inode, struct file *fp)
|
|
|
|
{
|
|
|
|
struct hfi1_filedata *fdata = fp->private_data;
|
|
|
|
struct hfi1_ctxtdata *uctxt = fdata->uctxt;
|
2016-05-19 12:26:44 +00:00
|
|
|
struct hfi1_devdata *dd = container_of(inode->i_cdev,
|
|
|
|
struct hfi1_devdata,
|
|
|
|
user_cdev);
|
2015-07-30 19:17:43 +00:00
|
|
|
unsigned long flags, *ev;
|
|
|
|
|
|
|
|
fp->private_data = NULL;
|
|
|
|
|
|
|
|
if (!uctxt)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
hfi1_cdbg(PROC, "freeing ctxt %u:%u", uctxt->ctxt, fdata->subctxt);
|
|
|
|
mutex_lock(&hfi1_mutex);
|
|
|
|
|
|
|
|
flush_wc();
|
|
|
|
/* drain user sdma queue */
|
2015-12-08 22:10:10 +00:00
|
|
|
hfi1_user_sdma_free_queues(fdata);
|
2015-07-30 19:17:43 +00:00
|
|
|
|
2016-02-03 22:33:40 +00:00
|
|
|
/* release the cpu */
|
IB/hfi1: Refine user process affinity algorithm
When performing process affinity recommendations for MPI ranks, the current
algorithm doesn't take into account multiple HFI units. Also, real
cores and HT cores are not distinguished from one another. Therefore,
all HT cores are recommended to be assigned first within the local NUMA
node before recommending the assignments of cores in other NUMA nodes.
It's ideal to assign all real cores across all NUMA nodes first, then all
HT 1 cores, then all HT 2 cores, and so on to balance CPU workload. CPU
cores in other NUMA nodes could be running interrupt handlers, and this is
not taken into account.
To balance the CPU workload for user processes, the following
recommendation algorithm is used:
For each user process that is opening a context on HFI Y:
a) If all cores are assigned to user processes, start assignments all
over from the first core
b) Assign real cores first, then HT cores (First set of HT cores on
all physical cores, then second set of HT cores, and, so on) in the
following order:
1. Same NUMA node as HFI Y and not running an IRQ handler
2. Same NUMA node as HFI Y and running an IRQ handler
3. Different NUMA node to HFI Y and not running an IRQ handler
4. Different NUMA node to HFI Y and running an IRQ handler
c) Mark core as assigned in the global affinity structure. As user
processes are done, remove core assignments from global affinity
structure.
This implementation allows an arbitrary number of HT cores and provides
support for multiple HFIs.
This is being included in the kernel rather than user space due to the
fact that user space has no way of knowing the CPU recommendations for
contexts running as part of other jobs.
Reviewed-by: Ira Weiny <ira.weiny@intel.com>
Reviewed-by: Mitko Haralanov <mitko.haralanov@intel.com>
Reviewed-by: Dennis Dalessandro <dennis.dalessandro@intel.com>
Signed-off-by: Sebastian Sanchez <sebastian.sanchez@intel.com>
Signed-off-by: Doug Ledford <dledford@redhat.com>
2016-07-25 14:54:57 +00:00
|
|
|
hfi1_put_proc_affinity(fdata->rec_cpu_num);
|
2016-02-03 22:33:40 +00:00
|
|
|
|
2017-05-04 12:14:34 +00:00
|
|
|
/* clean up rcv side */
|
|
|
|
hfi1_user_exp_rcv_free(fdata);
|
|
|
|
|
2015-07-30 19:17:43 +00:00
|
|
|
/*
|
|
|
|
* Clear any left over, unhandled events so the next process that
|
|
|
|
* gets this context doesn't get confused.
|
|
|
|
*/
|
2017-04-13 03:29:29 +00:00
|
|
|
ev = dd->events + ((uctxt->ctxt - dd->first_dyn_alloc_ctxt) *
|
2015-07-30 19:17:43 +00:00
|
|
|
HFI1_MAX_SHARED_CTXTS) + fdata->subctxt;
|
|
|
|
*ev = 0;
|
|
|
|
|
|
|
|
if (--uctxt->cnt) {
|
|
|
|
uctxt->active_slaves &= ~(1 << fdata->subctxt);
|
|
|
|
mutex_unlock(&hfi1_mutex);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
spin_lock_irqsave(&dd->uctxt_lock, flags);
|
|
|
|
/*
|
|
|
|
* Disable receive context and interrupt available, reset all
|
|
|
|
* RcvCtxtCtrl bits to default values.
|
|
|
|
*/
|
|
|
|
hfi1_rcvctrl(dd, HFI1_RCVCTRL_CTXT_DIS |
|
|
|
|
HFI1_RCVCTRL_TIDFLOW_DIS |
|
|
|
|
HFI1_RCVCTRL_INTRAVAIL_DIS |
|
2016-02-03 22:32:49 +00:00
|
|
|
HFI1_RCVCTRL_TAILUPD_DIS |
|
2015-07-30 19:17:43 +00:00
|
|
|
HFI1_RCVCTRL_ONE_PKT_EGR_DIS |
|
|
|
|
HFI1_RCVCTRL_NO_RHQ_DROP_DIS |
|
|
|
|
HFI1_RCVCTRL_NO_EGR_DROP_DIS, uctxt->ctxt);
|
|
|
|
/* Clear the context's J_KEY */
|
|
|
|
hfi1_clear_ctxt_jkey(dd, uctxt->ctxt);
|
|
|
|
/*
|
|
|
|
* Reset context integrity checks to default.
|
|
|
|
* (writes to CSRs probably belong in chip.c)
|
|
|
|
*/
|
|
|
|
write_kctxt_csr(dd, uctxt->sc->hw_context, SEND_CTXT_CHECK_ENABLE,
|
|
|
|
hfi1_pkt_default_send_ctxt_mask(dd, uctxt->sc->type));
|
|
|
|
sc_disable(uctxt->sc);
|
|
|
|
spin_unlock_irqrestore(&dd->uctxt_lock, flags);
|
|
|
|
|
|
|
|
dd->rcd[uctxt->ctxt] = NULL;
|
2016-04-20 13:05:36 +00:00
|
|
|
|
2017-05-04 12:14:34 +00:00
|
|
|
hfi1_user_exp_rcv_grp_free(uctxt);
|
2016-04-20 13:05:36 +00:00
|
|
|
hfi1_clear_ctxt_pkey(dd, uctxt->ctxt);
|
|
|
|
|
2015-07-30 19:17:43 +00:00
|
|
|
uctxt->rcvwait_to = 0;
|
|
|
|
uctxt->piowait_to = 0;
|
|
|
|
uctxt->rcvnowait = 0;
|
|
|
|
uctxt->pionowait = 0;
|
|
|
|
uctxt->event_flags = 0;
|
|
|
|
|
|
|
|
hfi1_stats.sps_ctxts--;
|
staging/rdma/hfi1: Add support for enabling/disabling PCIe ASPM
hfi1 HW has a high PCIe ASPM L1 exit latency and also advertises an
acceptable latency less than actual ASPM latencies. Additional
mechanisms than those provided by BIOS/OS are therefore required to
enable/disable ASPM for hfi1 to provide acceptable power/performance
trade offs. This patch adds this support.
By means of a module parameter ASPM can be either (a) always enabled
(power save mode) (b) always disabled (performance mode) (c)
enabled/disabled dynamically. The dynamic mode implements two
heuristics to alleviate possible problems with high ASPM L1 exit
latency. ASPM is normally enabled but is disabled if (a) there are any
active user space PSM contexts, or (b) for verbs, ASPM is disabled as
interrupt activity for a context starts to increase.
A few more points about the verbs implementation. In order to reduce
lock/cache contention between multiple verbs contexts, some processing
is done at the context layer before contending for device layer
locks. ASPM is disabled when two interrupts for a context happen
within 1 millisec. A timer is scheduled which will re-enable ASPM
after 1 second should the interrupt activity cease. Normally, every
interrupt, or interrupt-pair should push the timer out
further. However, since this might increase the processing load per
interrupt, pushing the timer out is postponed for half a second. If
after half a second we get two interrupts within 1 millisec the timer
is pushed out by another second.
Finally, the kernel ASPM API is not used in this patch. This is
because this patch does several non-standard things as SW workarounds
for HW issues. As mentioned above, it enables ASPM even when advertised
actual latencies are greater than acceptable latencies. Also, whereas
the kernel API only allows drivers to disable ASPM from driver probe,
this patch enables/disables ASPM directly from interrupt context. Due
to these reasons the kernel ASPM API was not used.
Reviewed-by: Mike Marciniszyn <mike.marciniszyn@intel.com>
Reviewed-by: Dean Luick <dean.luick@intel.com>
Reviewed-by: Ira Weiny <ira.weiny@intel.com>
Signed-off-by: Ashutosh Dixit <ashutosh.dixit@intel.com>
Signed-off-by: Doug Ledford <dledford@redhat.com>
2016-02-03 22:33:06 +00:00
|
|
|
if (++dd->freectxts == dd->num_user_contexts)
|
|
|
|
aspm_enable_all(dd);
|
2015-07-30 19:17:43 +00:00
|
|
|
mutex_unlock(&hfi1_mutex);
|
|
|
|
hfi1_free_ctxtdata(dd, uctxt);
|
|
|
|
done:
|
2016-08-16 20:27:03 +00:00
|
|
|
mmdrop(fdata->mm);
|
2016-05-19 12:26:44 +00:00
|
|
|
kobject_put(&dd->kobj);
|
2016-10-25 15:57:55 +00:00
|
|
|
|
|
|
|
if (atomic_dec_and_test(&dd->user_refcount))
|
|
|
|
complete(&dd->user_comp);
|
|
|
|
|
2015-07-30 19:17:43 +00:00
|
|
|
kfree(fdata);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Convert kernel *virtual* addresses to physical addresses.
|
|
|
|
* This is used to vmalloc'ed addresses.
|
|
|
|
*/
|
|
|
|
static u64 kvirt_to_phys(void *addr)
|
|
|
|
{
|
|
|
|
struct page *page;
|
|
|
|
u64 paddr = 0;
|
|
|
|
|
|
|
|
page = vmalloc_to_page(addr);
|
|
|
|
if (page)
|
|
|
|
paddr = page_to_pfn(page) << PAGE_SHIFT;
|
|
|
|
|
|
|
|
return paddr;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int assign_ctxt(struct file *fp, struct hfi1_user_info *uinfo)
|
|
|
|
{
|
|
|
|
int i_minor, ret = 0;
|
2016-05-19 12:25:50 +00:00
|
|
|
unsigned int swmajor, swminor;
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
swmajor = uinfo->userversion >> 16;
|
|
|
|
if (swmajor != HFI1_USER_SWMAJOR) {
|
|
|
|
ret = -ENODEV;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
swminor = uinfo->userversion & 0xffff;
|
|
|
|
|
|
|
|
mutex_lock(&hfi1_mutex);
|
|
|
|
/* First, lets check if we need to setup a shared context? */
|
2016-02-03 22:33:40 +00:00
|
|
|
if (uinfo->subctxt_cnt) {
|
|
|
|
struct hfi1_filedata *fd = fp->private_data;
|
|
|
|
|
2015-07-30 19:17:43 +00:00
|
|
|
ret = find_shared_ctxt(fp, uinfo);
|
2016-02-03 22:33:40 +00:00
|
|
|
if (ret < 0)
|
|
|
|
goto done_unlock;
|
IB/hfi1: Refine user process affinity algorithm
When performing process affinity recommendations for MPI ranks, the current
algorithm doesn't take into account multiple HFI units. Also, real
cores and HT cores are not distinguished from one another. Therefore,
all HT cores are recommended to be assigned first within the local NUMA
node before recommending the assignments of cores in other NUMA nodes.
It's ideal to assign all real cores across all NUMA nodes first, then all
HT 1 cores, then all HT 2 cores, and so on to balance CPU workload. CPU
cores in other NUMA nodes could be running interrupt handlers, and this is
not taken into account.
To balance the CPU workload for user processes, the following
recommendation algorithm is used:
For each user process that is opening a context on HFI Y:
a) If all cores are assigned to user processes, start assignments all
over from the first core
b) Assign real cores first, then HT cores (First set of HT cores on
all physical cores, then second set of HT cores, and, so on) in the
following order:
1. Same NUMA node as HFI Y and not running an IRQ handler
2. Same NUMA node as HFI Y and running an IRQ handler
3. Different NUMA node to HFI Y and not running an IRQ handler
4. Different NUMA node to HFI Y and running an IRQ handler
c) Mark core as assigned in the global affinity structure. As user
processes are done, remove core assignments from global affinity
structure.
This implementation allows an arbitrary number of HT cores and provides
support for multiple HFIs.
This is being included in the kernel rather than user space due to the
fact that user space has no way of knowing the CPU recommendations for
contexts running as part of other jobs.
Reviewed-by: Ira Weiny <ira.weiny@intel.com>
Reviewed-by: Mitko Haralanov <mitko.haralanov@intel.com>
Reviewed-by: Dennis Dalessandro <dennis.dalessandro@intel.com>
Signed-off-by: Sebastian Sanchez <sebastian.sanchez@intel.com>
Signed-off-by: Doug Ledford <dledford@redhat.com>
2016-07-25 14:54:57 +00:00
|
|
|
if (ret) {
|
|
|
|
fd->rec_cpu_num =
|
|
|
|
hfi1_get_proc_affinity(fd->uctxt->numa_id);
|
|
|
|
}
|
2016-02-03 22:33:40 +00:00
|
|
|
}
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* We execute the following block if we couldn't find a
|
|
|
|
* shared context or if context sharing is not required.
|
|
|
|
*/
|
|
|
|
if (!ret) {
|
|
|
|
i_minor = iminor(file_inode(fp)) - HFI1_USER_MINOR_BASE;
|
2016-05-19 12:25:50 +00:00
|
|
|
ret = get_user_context(fp, uinfo, i_minor);
|
2015-07-30 19:17:43 +00:00
|
|
|
}
|
2016-02-03 22:33:40 +00:00
|
|
|
done_unlock:
|
2015-07-30 19:17:43 +00:00
|
|
|
mutex_unlock(&hfi1_mutex);
|
|
|
|
done:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int get_user_context(struct file *fp, struct hfi1_user_info *uinfo,
|
2016-05-19 12:25:50 +00:00
|
|
|
int devno)
|
2015-07-30 19:17:43 +00:00
|
|
|
{
|
|
|
|
struct hfi1_devdata *dd = NULL;
|
2016-05-19 12:25:50 +00:00
|
|
|
int devmax, npresent, nup;
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
devmax = hfi1_count_units(&npresent, &nup);
|
2016-05-19 12:25:50 +00:00
|
|
|
if (!npresent)
|
|
|
|
return -ENXIO;
|
|
|
|
|
|
|
|
if (!nup)
|
|
|
|
return -ENETDOWN;
|
|
|
|
|
|
|
|
dd = hfi1_lookup(devno);
|
|
|
|
if (!dd)
|
|
|
|
return -ENODEV;
|
|
|
|
else if (!dd->freectxts)
|
|
|
|
return -EBUSY;
|
|
|
|
|
|
|
|
return allocate_ctxt(fp, dd, uinfo);
|
2015-07-30 19:17:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int find_shared_ctxt(struct file *fp,
|
|
|
|
const struct hfi1_user_info *uinfo)
|
|
|
|
{
|
|
|
|
int devmax, ndev, i;
|
|
|
|
int ret = 0;
|
2015-10-30 22:58:40 +00:00
|
|
|
struct hfi1_filedata *fd = fp->private_data;
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
devmax = hfi1_count_units(NULL, NULL);
|
|
|
|
|
|
|
|
for (ndev = 0; ndev < devmax; ndev++) {
|
|
|
|
struct hfi1_devdata *dd = hfi1_lookup(ndev);
|
|
|
|
|
|
|
|
if (!(dd && (dd->flags & HFI1_PRESENT) && dd->kregbase))
|
|
|
|
continue;
|
2017-04-13 03:29:29 +00:00
|
|
|
for (i = dd->first_dyn_alloc_ctxt;
|
|
|
|
i < dd->num_rcv_contexts; i++) {
|
2015-07-30 19:17:43 +00:00
|
|
|
struct hfi1_ctxtdata *uctxt = dd->rcd[i];
|
|
|
|
|
|
|
|
/* Skip ctxts which are not yet open */
|
|
|
|
if (!uctxt || !uctxt->cnt)
|
|
|
|
continue;
|
2017-04-13 03:29:29 +00:00
|
|
|
|
|
|
|
/* Skip dynamically allocted kernel contexts */
|
|
|
|
if (uctxt->sc && (uctxt->sc->type == SC_KERNEL))
|
|
|
|
continue;
|
|
|
|
|
2015-07-30 19:17:43 +00:00
|
|
|
/* Skip ctxt if it doesn't match the requested one */
|
|
|
|
if (memcmp(uctxt->uuid, uinfo->uuid,
|
|
|
|
sizeof(uctxt->uuid)) ||
|
2015-10-26 14:28:33 +00:00
|
|
|
uctxt->jkey != generate_jkey(current_uid()) ||
|
2015-07-30 19:17:43 +00:00
|
|
|
uctxt->subctxt_id != uinfo->subctxt_id ||
|
|
|
|
uctxt->subctxt_cnt != uinfo->subctxt_cnt)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* Verify the sharing process matches the master */
|
|
|
|
if (uctxt->userversion != uinfo->userversion ||
|
|
|
|
uctxt->cnt >= uctxt->subctxt_cnt) {
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto done;
|
|
|
|
}
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->uctxt = uctxt;
|
|
|
|
fd->subctxt = uctxt->cnt++;
|
|
|
|
uctxt->active_slaves |= 1 << fd->subctxt;
|
2015-07-30 19:17:43 +00:00
|
|
|
ret = 1;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
done:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int allocate_ctxt(struct file *fp, struct hfi1_devdata *dd,
|
|
|
|
struct hfi1_user_info *uinfo)
|
|
|
|
{
|
2015-10-30 22:58:40 +00:00
|
|
|
struct hfi1_filedata *fd = fp->private_data;
|
2015-07-30 19:17:43 +00:00
|
|
|
struct hfi1_ctxtdata *uctxt;
|
|
|
|
unsigned ctxt;
|
2016-02-03 22:33:40 +00:00
|
|
|
int ret, numa;
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
if (dd->flags & HFI1_FROZEN) {
|
|
|
|
/*
|
|
|
|
* Pick an error that is unique from all other errors
|
|
|
|
* that are returned so the user process knows that
|
|
|
|
* it tried to allocate while the SPC was frozen. It
|
|
|
|
* it should be able to retry with success in a short
|
|
|
|
* while.
|
|
|
|
*/
|
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
|
2017-04-13 03:29:29 +00:00
|
|
|
for (ctxt = dd->first_dyn_alloc_ctxt;
|
|
|
|
ctxt < dd->num_rcv_contexts; ctxt++)
|
2015-07-30 19:17:43 +00:00
|
|
|
if (!dd->rcd[ctxt])
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (ctxt == dd->num_rcv_contexts)
|
|
|
|
return -EBUSY;
|
|
|
|
|
IB/hfi1: Refine user process affinity algorithm
When performing process affinity recommendations for MPI ranks, the current
algorithm doesn't take into account multiple HFI units. Also, real
cores and HT cores are not distinguished from one another. Therefore,
all HT cores are recommended to be assigned first within the local NUMA
node before recommending the assignments of cores in other NUMA nodes.
It's ideal to assign all real cores across all NUMA nodes first, then all
HT 1 cores, then all HT 2 cores, and so on to balance CPU workload. CPU
cores in other NUMA nodes could be running interrupt handlers, and this is
not taken into account.
To balance the CPU workload for user processes, the following
recommendation algorithm is used:
For each user process that is opening a context on HFI Y:
a) If all cores are assigned to user processes, start assignments all
over from the first core
b) Assign real cores first, then HT cores (First set of HT cores on
all physical cores, then second set of HT cores, and, so on) in the
following order:
1. Same NUMA node as HFI Y and not running an IRQ handler
2. Same NUMA node as HFI Y and running an IRQ handler
3. Different NUMA node to HFI Y and not running an IRQ handler
4. Different NUMA node to HFI Y and running an IRQ handler
c) Mark core as assigned in the global affinity structure. As user
processes are done, remove core assignments from global affinity
structure.
This implementation allows an arbitrary number of HT cores and provides
support for multiple HFIs.
This is being included in the kernel rather than user space due to the
fact that user space has no way of knowing the CPU recommendations for
contexts running as part of other jobs.
Reviewed-by: Ira Weiny <ira.weiny@intel.com>
Reviewed-by: Mitko Haralanov <mitko.haralanov@intel.com>
Reviewed-by: Dennis Dalessandro <dennis.dalessandro@intel.com>
Signed-off-by: Sebastian Sanchez <sebastian.sanchez@intel.com>
Signed-off-by: Doug Ledford <dledford@redhat.com>
2016-07-25 14:54:57 +00:00
|
|
|
/*
|
|
|
|
* If we don't have a NUMA node requested, preference is towards
|
|
|
|
* device NUMA node.
|
|
|
|
*/
|
|
|
|
fd->rec_cpu_num = hfi1_get_proc_affinity(dd->node);
|
2016-02-03 22:33:40 +00:00
|
|
|
if (fd->rec_cpu_num != -1)
|
|
|
|
numa = cpu_to_node(fd->rec_cpu_num);
|
|
|
|
else
|
|
|
|
numa = numa_node_id();
|
|
|
|
uctxt = hfi1_create_ctxtdata(dd->pport, ctxt, numa);
|
2015-07-30 19:17:43 +00:00
|
|
|
if (!uctxt) {
|
|
|
|
dd_dev_err(dd,
|
|
|
|
"Unable to allocate ctxtdata memory, failing open\n");
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
2016-02-03 22:33:40 +00:00
|
|
|
hfi1_cdbg(PROC, "[%u:%u] pid %u assigned to CPU %d (NUMA %u)",
|
|
|
|
uctxt->ctxt, fd->subctxt, current->pid, fd->rec_cpu_num,
|
|
|
|
uctxt->numa_id);
|
|
|
|
|
2015-07-30 19:17:43 +00:00
|
|
|
/*
|
|
|
|
* Allocate and enable a PIO send context.
|
|
|
|
*/
|
|
|
|
uctxt->sc = sc_alloc(dd, SC_USER, uctxt->rcvhdrqentsize,
|
2016-02-03 22:33:49 +00:00
|
|
|
uctxt->dd->node);
|
2016-09-25 14:42:23 +00:00
|
|
|
if (!uctxt->sc) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto ctxdata_free;
|
|
|
|
}
|
2015-11-07 01:06:56 +00:00
|
|
|
hfi1_cdbg(PROC, "allocated send context %u(%u)\n", uctxt->sc->sw_index,
|
|
|
|
uctxt->sc->hw_context);
|
2015-07-30 19:17:43 +00:00
|
|
|
ret = sc_enable(uctxt->sc);
|
|
|
|
if (ret)
|
2016-09-25 14:42:23 +00:00
|
|
|
goto ctxdata_free;
|
|
|
|
|
2015-07-30 19:17:43 +00:00
|
|
|
/*
|
|
|
|
* Setup shared context resources if the user-level has requested
|
|
|
|
* shared contexts and this is the 'master' process.
|
|
|
|
* This has to be done here so the rest of the sub-contexts find the
|
|
|
|
* proper master.
|
|
|
|
*/
|
2015-10-30 22:58:40 +00:00
|
|
|
if (uinfo->subctxt_cnt && !fd->subctxt) {
|
2015-07-30 19:17:43 +00:00
|
|
|
ret = init_subctxts(uctxt, uinfo);
|
|
|
|
/*
|
|
|
|
* On error, we don't need to disable and de-allocate the
|
|
|
|
* send context because it will be done during file close
|
|
|
|
*/
|
|
|
|
if (ret)
|
2016-09-25 14:42:23 +00:00
|
|
|
goto ctxdata_free;
|
2015-07-30 19:17:43 +00:00
|
|
|
}
|
|
|
|
uctxt->userversion = uinfo->userversion;
|
2016-07-28 19:21:13 +00:00
|
|
|
uctxt->flags = hfi1_cap_mask; /* save current flag state */
|
2015-07-30 19:17:43 +00:00
|
|
|
init_waitqueue_head(&uctxt->wait);
|
|
|
|
strlcpy(uctxt->comm, current->comm, sizeof(uctxt->comm));
|
|
|
|
memcpy(uctxt->uuid, uinfo->uuid, sizeof(uctxt->uuid));
|
|
|
|
uctxt->jkey = generate_jkey(current_uid());
|
|
|
|
INIT_LIST_HEAD(&uctxt->sdma_queues);
|
|
|
|
spin_lock_init(&uctxt->sdma_qlock);
|
|
|
|
hfi1_stats.sps_ctxts++;
|
staging/rdma/hfi1: Add support for enabling/disabling PCIe ASPM
hfi1 HW has a high PCIe ASPM L1 exit latency and also advertises an
acceptable latency less than actual ASPM latencies. Additional
mechanisms than those provided by BIOS/OS are therefore required to
enable/disable ASPM for hfi1 to provide acceptable power/performance
trade offs. This patch adds this support.
By means of a module parameter ASPM can be either (a) always enabled
(power save mode) (b) always disabled (performance mode) (c)
enabled/disabled dynamically. The dynamic mode implements two
heuristics to alleviate possible problems with high ASPM L1 exit
latency. ASPM is normally enabled but is disabled if (a) there are any
active user space PSM contexts, or (b) for verbs, ASPM is disabled as
interrupt activity for a context starts to increase.
A few more points about the verbs implementation. In order to reduce
lock/cache contention between multiple verbs contexts, some processing
is done at the context layer before contending for device layer
locks. ASPM is disabled when two interrupts for a context happen
within 1 millisec. A timer is scheduled which will re-enable ASPM
after 1 second should the interrupt activity cease. Normally, every
interrupt, or interrupt-pair should push the timer out
further. However, since this might increase the processing load per
interrupt, pushing the timer out is postponed for half a second. If
after half a second we get two interrupts within 1 millisec the timer
is pushed out by another second.
Finally, the kernel ASPM API is not used in this patch. This is
because this patch does several non-standard things as SW workarounds
for HW issues. As mentioned above, it enables ASPM even when advertised
actual latencies are greater than acceptable latencies. Also, whereas
the kernel API only allows drivers to disable ASPM from driver probe,
this patch enables/disables ASPM directly from interrupt context. Due
to these reasons the kernel ASPM API was not used.
Reviewed-by: Mike Marciniszyn <mike.marciniszyn@intel.com>
Reviewed-by: Dean Luick <dean.luick@intel.com>
Reviewed-by: Ira Weiny <ira.weiny@intel.com>
Signed-off-by: Ashutosh Dixit <ashutosh.dixit@intel.com>
Signed-off-by: Doug Ledford <dledford@redhat.com>
2016-02-03 22:33:06 +00:00
|
|
|
/*
|
|
|
|
* Disable ASPM when there are open user/PSM contexts to avoid
|
|
|
|
* issues with ASPM L1 exit latency
|
|
|
|
*/
|
|
|
|
if (dd->freectxts-- == dd->num_user_contexts)
|
|
|
|
aspm_disable_all(dd);
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->uctxt = uctxt;
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
return 0;
|
2016-09-25 14:42:23 +00:00
|
|
|
|
|
|
|
ctxdata_free:
|
|
|
|
dd->rcd[ctxt] = NULL;
|
|
|
|
hfi1_free_ctxtdata(dd, uctxt);
|
|
|
|
return ret;
|
2015-07-30 19:17:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int init_subctxts(struct hfi1_ctxtdata *uctxt,
|
|
|
|
const struct hfi1_user_info *uinfo)
|
|
|
|
{
|
|
|
|
unsigned num_subctxts;
|
|
|
|
|
|
|
|
num_subctxts = uinfo->subctxt_cnt;
|
2016-02-05 16:57:50 +00:00
|
|
|
if (num_subctxts > HFI1_MAX_SHARED_CTXTS)
|
|
|
|
return -EINVAL;
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
uctxt->subctxt_cnt = uinfo->subctxt_cnt;
|
|
|
|
uctxt->subctxt_id = uinfo->subctxt_id;
|
|
|
|
uctxt->active_slaves = 1;
|
|
|
|
uctxt->redirect_seq_cnt = 1;
|
|
|
|
set_bit(HFI1_CTXT_MASTER_UNINIT, &uctxt->event_flags);
|
2016-02-05 16:57:50 +00:00
|
|
|
|
|
|
|
return 0;
|
2015-07-30 19:17:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int setup_subctxt(struct hfi1_ctxtdata *uctxt)
|
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
unsigned num_subctxts = uctxt->subctxt_cnt;
|
|
|
|
|
|
|
|
uctxt->subctxt_uregbase = vmalloc_user(PAGE_SIZE);
|
|
|
|
if (!uctxt->subctxt_uregbase) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto bail;
|
|
|
|
}
|
|
|
|
/* We can take the size of the RcvHdr Queue from the master */
|
|
|
|
uctxt->subctxt_rcvhdr_base = vmalloc_user(uctxt->rcvhdrq_size *
|
|
|
|
num_subctxts);
|
|
|
|
if (!uctxt->subctxt_rcvhdr_base) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto bail_ureg;
|
|
|
|
}
|
|
|
|
|
|
|
|
uctxt->subctxt_rcvegrbuf = vmalloc_user(uctxt->egrbufs.size *
|
|
|
|
num_subctxts);
|
|
|
|
if (!uctxt->subctxt_rcvegrbuf) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto bail_rhdr;
|
|
|
|
}
|
|
|
|
goto bail;
|
|
|
|
bail_rhdr:
|
|
|
|
vfree(uctxt->subctxt_rcvhdr_base);
|
|
|
|
bail_ureg:
|
|
|
|
vfree(uctxt->subctxt_uregbase);
|
|
|
|
uctxt->subctxt_uregbase = NULL;
|
|
|
|
bail:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int user_init(struct file *fp)
|
|
|
|
{
|
|
|
|
unsigned int rcvctrl_ops = 0;
|
2015-10-30 22:58:40 +00:00
|
|
|
struct hfi1_filedata *fd = fp->private_data;
|
|
|
|
struct hfi1_ctxtdata *uctxt = fd->uctxt;
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
/* make sure that the context has already been setup */
|
2016-04-20 13:05:36 +00:00
|
|
|
if (!test_bit(HFI1_CTXT_SETUP_DONE, &uctxt->event_flags))
|
|
|
|
return -EFAULT;
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
/* initialize poll variables... */
|
|
|
|
uctxt->urgent = 0;
|
|
|
|
uctxt->urgent_poll = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Now enable the ctxt for receive.
|
|
|
|
* For chips that are set to DMA the tail register to memory
|
|
|
|
* when they change (and when the update bit transitions from
|
|
|
|
* 0 to 1. So for those chips, we turn it off and then back on.
|
|
|
|
* This will (very briefly) affect any other open ctxts, but the
|
|
|
|
* duration is very short, and therefore isn't an issue. We
|
|
|
|
* explicitly set the in-memory tail copy to 0 beforehand, so we
|
|
|
|
* don't have to wait to be sure the DMA update has happened
|
|
|
|
* (chip resets head/tail to 0 on transition to enable).
|
|
|
|
*/
|
|
|
|
if (uctxt->rcvhdrtail_kvaddr)
|
|
|
|
clear_rcvhdrtail(uctxt);
|
|
|
|
|
|
|
|
/* Setup J_KEY before enabling the context */
|
|
|
|
hfi1_set_ctxt_jkey(uctxt->dd, uctxt->ctxt, uctxt->jkey);
|
|
|
|
|
|
|
|
rcvctrl_ops = HFI1_RCVCTRL_CTXT_ENB;
|
2016-07-28 19:21:13 +00:00
|
|
|
if (HFI1_CAP_UGET_MASK(uctxt->flags, HDRSUPP))
|
2015-07-30 19:17:43 +00:00
|
|
|
rcvctrl_ops |= HFI1_RCVCTRL_TIDFLOW_ENB;
|
|
|
|
/*
|
|
|
|
* Ignore the bit in the flags for now until proper
|
|
|
|
* support for multiple packet per rcv array entry is
|
|
|
|
* added.
|
|
|
|
*/
|
2016-07-28 19:21:13 +00:00
|
|
|
if (!HFI1_CAP_UGET_MASK(uctxt->flags, MULTI_PKT_EGR))
|
2015-07-30 19:17:43 +00:00
|
|
|
rcvctrl_ops |= HFI1_RCVCTRL_ONE_PKT_EGR_ENB;
|
2016-07-28 19:21:13 +00:00
|
|
|
if (HFI1_CAP_UGET_MASK(uctxt->flags, NODROP_EGR_FULL))
|
2015-07-30 19:17:43 +00:00
|
|
|
rcvctrl_ops |= HFI1_RCVCTRL_NO_EGR_DROP_ENB;
|
2016-07-28 19:21:13 +00:00
|
|
|
if (HFI1_CAP_UGET_MASK(uctxt->flags, NODROP_RHQ_FULL))
|
2015-07-30 19:17:43 +00:00
|
|
|
rcvctrl_ops |= HFI1_RCVCTRL_NO_RHQ_DROP_ENB;
|
2016-02-03 22:32:49 +00:00
|
|
|
/*
|
|
|
|
* The RcvCtxtCtrl.TailUpd bit has to be explicitly written.
|
|
|
|
* We can't rely on the correct value to be set from prior
|
|
|
|
* uses of the chip or ctxt. Therefore, add the rcvctrl op
|
|
|
|
* for both cases.
|
|
|
|
*/
|
2016-07-28 19:21:13 +00:00
|
|
|
if (HFI1_CAP_UGET_MASK(uctxt->flags, DMA_RTAIL))
|
2015-07-30 19:17:43 +00:00
|
|
|
rcvctrl_ops |= HFI1_RCVCTRL_TAILUPD_ENB;
|
2016-02-03 22:32:49 +00:00
|
|
|
else
|
|
|
|
rcvctrl_ops |= HFI1_RCVCTRL_TAILUPD_DIS;
|
2015-07-30 19:17:43 +00:00
|
|
|
hfi1_rcvctrl(uctxt->dd, rcvctrl_ops, uctxt->ctxt);
|
|
|
|
|
|
|
|
/* Notify any waiting slaves */
|
|
|
|
if (uctxt->subctxt_cnt) {
|
|
|
|
clear_bit(HFI1_CTXT_MASTER_UNINIT, &uctxt->event_flags);
|
|
|
|
wake_up(&uctxt->wait);
|
|
|
|
}
|
|
|
|
|
2016-04-20 13:05:36 +00:00
|
|
|
return 0;
|
2015-07-30 19:17:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int get_ctxt_info(struct file *fp, void __user *ubase, __u32 len)
|
|
|
|
{
|
|
|
|
struct hfi1_ctxt_info cinfo;
|
|
|
|
struct hfi1_filedata *fd = fp->private_data;
|
2015-10-30 22:58:40 +00:00
|
|
|
struct hfi1_ctxtdata *uctxt = fd->uctxt;
|
2015-07-30 19:17:43 +00:00
|
|
|
int ret = 0;
|
|
|
|
|
2015-09-16 06:42:25 +00:00
|
|
|
memset(&cinfo, 0, sizeof(cinfo));
|
2016-07-28 19:21:13 +00:00
|
|
|
cinfo.runtime_flags = (((uctxt->flags >> HFI1_CAP_MISC_SHIFT) &
|
|
|
|
HFI1_CAP_MISC_MASK) << HFI1_CAP_USER_SHIFT) |
|
|
|
|
HFI1_CAP_UGET_MASK(uctxt->flags, MASK) |
|
|
|
|
HFI1_CAP_KGET_MASK(uctxt->flags, K2U);
|
2016-07-28 19:21:21 +00:00
|
|
|
/* adjust flag if this fd is not able to cache */
|
|
|
|
if (!fd->handler)
|
|
|
|
cinfo.runtime_flags |= HFI1_CAP_TID_UNMAP; /* no caching */
|
|
|
|
|
2015-07-30 19:17:43 +00:00
|
|
|
cinfo.num_active = hfi1_count_active_units();
|
|
|
|
cinfo.unit = uctxt->dd->unit;
|
|
|
|
cinfo.ctxt = uctxt->ctxt;
|
2015-10-30 22:58:40 +00:00
|
|
|
cinfo.subctxt = fd->subctxt;
|
2015-07-30 19:17:43 +00:00
|
|
|
cinfo.rcvtids = roundup(uctxt->egrbufs.alloced,
|
|
|
|
uctxt->dd->rcv_entries.group_size) +
|
|
|
|
uctxt->expected_count;
|
|
|
|
cinfo.credits = uctxt->sc->credits;
|
|
|
|
cinfo.numa_node = uctxt->numa_id;
|
|
|
|
cinfo.rec_cpu = fd->rec_cpu_num;
|
|
|
|
cinfo.send_ctxt = uctxt->sc->hw_context;
|
|
|
|
|
|
|
|
cinfo.egrtids = uctxt->egrbufs.alloced;
|
|
|
|
cinfo.rcvhdrq_cnt = uctxt->rcvhdrq_cnt;
|
|
|
|
cinfo.rcvhdrq_entsize = uctxt->rcvhdrqentsize << 2;
|
2015-10-30 22:58:40 +00:00
|
|
|
cinfo.sdma_ring_size = fd->cq->nentries;
|
2015-07-30 19:17:43 +00:00
|
|
|
cinfo.rcvegr_size = uctxt->egrbufs.rcvtid_size;
|
|
|
|
|
2015-10-30 22:58:40 +00:00
|
|
|
trace_hfi1_ctxt_info(uctxt->dd, uctxt->ctxt, fd->subctxt, cinfo);
|
2015-07-30 19:17:43 +00:00
|
|
|
if (copy_to_user(ubase, &cinfo, sizeof(cinfo)))
|
|
|
|
ret = -EFAULT;
|
2016-07-28 19:21:13 +00:00
|
|
|
|
2015-07-30 19:17:43 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int setup_ctxt(struct file *fp)
|
|
|
|
{
|
2015-10-30 22:58:40 +00:00
|
|
|
struct hfi1_filedata *fd = fp->private_data;
|
|
|
|
struct hfi1_ctxtdata *uctxt = fd->uctxt;
|
2015-07-30 19:17:43 +00:00
|
|
|
struct hfi1_devdata *dd = uctxt->dd;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
/*
|
2016-04-20 13:05:36 +00:00
|
|
|
* Context should be set up only once, including allocation and
|
2015-07-30 19:17:43 +00:00
|
|
|
* programming of eager buffers. This is done if context sharing
|
|
|
|
* is not requested or by the master process.
|
|
|
|
*/
|
2015-10-30 22:58:40 +00:00
|
|
|
if (!uctxt->subctxt_cnt || !fd->subctxt) {
|
2015-07-30 19:17:43 +00:00
|
|
|
ret = hfi1_init_ctxt(uctxt->sc);
|
|
|
|
if (ret)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
/* Now allocate the RcvHdr queue and eager buffers. */
|
|
|
|
ret = hfi1_create_rcvhdrq(dd, uctxt);
|
|
|
|
if (ret)
|
|
|
|
goto done;
|
|
|
|
ret = hfi1_setup_eagerbufs(uctxt);
|
|
|
|
if (ret)
|
|
|
|
goto done;
|
2015-10-30 22:58:40 +00:00
|
|
|
if (uctxt->subctxt_cnt && !fd->subctxt) {
|
2015-07-30 19:17:43 +00:00
|
|
|
ret = setup_subctxt(uctxt);
|
|
|
|
if (ret)
|
|
|
|
goto done;
|
|
|
|
}
|
2016-04-20 13:05:36 +00:00
|
|
|
} else {
|
|
|
|
ret = wait_event_interruptible(uctxt->wait, !test_bit(
|
|
|
|
HFI1_CTXT_MASTER_UNINIT,
|
|
|
|
&uctxt->event_flags));
|
|
|
|
if (ret)
|
|
|
|
goto done;
|
2015-07-30 19:17:43 +00:00
|
|
|
}
|
2016-04-20 13:05:36 +00:00
|
|
|
|
2015-07-30 19:17:43 +00:00
|
|
|
ret = hfi1_user_sdma_alloc_queues(uctxt, fp);
|
2016-04-20 13:05:36 +00:00
|
|
|
if (ret)
|
|
|
|
goto done;
|
|
|
|
/*
|
|
|
|
* Expected receive has to be setup for all processes (including
|
|
|
|
* shared contexts). However, it has to be done after the master
|
|
|
|
* context has been fully configured as it depends on the
|
|
|
|
* eager/expected split of the RcvArray entries.
|
|
|
|
* Setting it up here ensures that the subcontexts will be waiting
|
|
|
|
* (due to the above wait_event_interruptible() until the master
|
|
|
|
* is setup.
|
|
|
|
*/
|
|
|
|
ret = hfi1_user_exp_rcv_init(fp);
|
2015-07-30 19:17:43 +00:00
|
|
|
if (ret)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
set_bit(HFI1_CTXT_SETUP_DONE, &uctxt->event_flags);
|
|
|
|
done:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int get_base_info(struct file *fp, void __user *ubase, __u32 len)
|
|
|
|
{
|
|
|
|
struct hfi1_base_info binfo;
|
2015-10-30 22:58:40 +00:00
|
|
|
struct hfi1_filedata *fd = fp->private_data;
|
|
|
|
struct hfi1_ctxtdata *uctxt = fd->uctxt;
|
2015-07-30 19:17:43 +00:00
|
|
|
struct hfi1_devdata *dd = uctxt->dd;
|
|
|
|
ssize_t sz;
|
|
|
|
unsigned offset;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
trace_hfi1_uctxtdata(uctxt->dd, uctxt);
|
|
|
|
|
|
|
|
memset(&binfo, 0, sizeof(binfo));
|
|
|
|
binfo.hw_version = dd->revision;
|
|
|
|
binfo.sw_version = HFI1_KERN_SWVERSION;
|
|
|
|
binfo.bthqp = kdeth_qp;
|
|
|
|
binfo.jkey = uctxt->jkey;
|
|
|
|
/*
|
|
|
|
* If more than 64 contexts are enabled the allocated credit
|
|
|
|
* return will span two or three contiguous pages. Since we only
|
|
|
|
* map the page containing the context's credit return address,
|
|
|
|
* we need to calculate the offset in the proper page.
|
|
|
|
*/
|
|
|
|
offset = ((u64)uctxt->sc->hw_free -
|
|
|
|
(u64)dd->cr_base[uctxt->numa_id].va) % PAGE_SIZE;
|
|
|
|
binfo.sc_credits_addr = HFI1_MMAP_TOKEN(PIO_CRED, uctxt->ctxt,
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->subctxt, offset);
|
2015-07-30 19:17:43 +00:00
|
|
|
binfo.pio_bufbase = HFI1_MMAP_TOKEN(PIO_BUFS, uctxt->ctxt,
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->subctxt,
|
2015-07-30 19:17:43 +00:00
|
|
|
uctxt->sc->base_addr);
|
|
|
|
binfo.pio_bufbase_sop = HFI1_MMAP_TOKEN(PIO_BUFS_SOP,
|
|
|
|
uctxt->ctxt,
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->subctxt,
|
2015-07-30 19:17:43 +00:00
|
|
|
uctxt->sc->base_addr);
|
|
|
|
binfo.rcvhdr_bufbase = HFI1_MMAP_TOKEN(RCV_HDRQ, uctxt->ctxt,
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->subctxt,
|
2015-07-30 19:17:43 +00:00
|
|
|
uctxt->rcvhdrq);
|
|
|
|
binfo.rcvegr_bufbase = HFI1_MMAP_TOKEN(RCV_EGRBUF, uctxt->ctxt,
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->subctxt,
|
2016-09-06 11:35:54 +00:00
|
|
|
uctxt->egrbufs.rcvtids[0].dma);
|
2015-07-30 19:17:43 +00:00
|
|
|
binfo.sdma_comp_bufbase = HFI1_MMAP_TOKEN(SDMA_COMP, uctxt->ctxt,
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->subctxt, 0);
|
2015-07-30 19:17:43 +00:00
|
|
|
/*
|
|
|
|
* user regs are at
|
|
|
|
* (RXE_PER_CONTEXT_USER + (ctxt * RXE_PER_CONTEXT_SIZE))
|
|
|
|
*/
|
|
|
|
binfo.user_regbase = HFI1_MMAP_TOKEN(UREGS, uctxt->ctxt,
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->subctxt, 0);
|
2017-04-13 03:29:29 +00:00
|
|
|
offset = offset_in_page((((uctxt->ctxt - dd->first_dyn_alloc_ctxt) *
|
2015-10-30 22:58:40 +00:00
|
|
|
HFI1_MAX_SHARED_CTXTS) + fd->subctxt) *
|
2015-10-03 02:34:59 +00:00
|
|
|
sizeof(*dd->events));
|
2015-07-30 19:17:43 +00:00
|
|
|
binfo.events_bufbase = HFI1_MMAP_TOKEN(EVENTS, uctxt->ctxt,
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->subctxt,
|
2015-07-30 19:17:43 +00:00
|
|
|
offset);
|
|
|
|
binfo.status_bufbase = HFI1_MMAP_TOKEN(STATUS, uctxt->ctxt,
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->subctxt,
|
2015-07-30 19:17:43 +00:00
|
|
|
dd->status);
|
|
|
|
if (HFI1_CAP_IS_USET(DMA_RTAIL))
|
|
|
|
binfo.rcvhdrtail_base = HFI1_MMAP_TOKEN(RTAIL, uctxt->ctxt,
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->subctxt, 0);
|
2015-07-30 19:17:43 +00:00
|
|
|
if (uctxt->subctxt_cnt) {
|
|
|
|
binfo.subctxt_uregbase = HFI1_MMAP_TOKEN(SUBCTXT_UREGS,
|
|
|
|
uctxt->ctxt,
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->subctxt, 0);
|
2015-07-30 19:17:43 +00:00
|
|
|
binfo.subctxt_rcvhdrbuf = HFI1_MMAP_TOKEN(SUBCTXT_RCV_HDRQ,
|
|
|
|
uctxt->ctxt,
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->subctxt, 0);
|
2015-07-30 19:17:43 +00:00
|
|
|
binfo.subctxt_rcvegrbuf = HFI1_MMAP_TOKEN(SUBCTXT_EGRBUF,
|
|
|
|
uctxt->ctxt,
|
2015-10-30 22:58:40 +00:00
|
|
|
fd->subctxt, 0);
|
2015-07-30 19:17:43 +00:00
|
|
|
}
|
|
|
|
sz = (len < sizeof(binfo)) ? len : sizeof(binfo);
|
|
|
|
if (copy_to_user(ubase, &binfo, sz))
|
|
|
|
ret = -EFAULT;
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned int poll_urgent(struct file *fp,
|
|
|
|
struct poll_table_struct *pt)
|
|
|
|
{
|
2015-10-30 22:58:40 +00:00
|
|
|
struct hfi1_filedata *fd = fp->private_data;
|
|
|
|
struct hfi1_ctxtdata *uctxt = fd->uctxt;
|
2015-07-30 19:17:43 +00:00
|
|
|
struct hfi1_devdata *dd = uctxt->dd;
|
|
|
|
unsigned pollflag;
|
|
|
|
|
|
|
|
poll_wait(fp, &uctxt->wait, pt);
|
|
|
|
|
|
|
|
spin_lock_irq(&dd->uctxt_lock);
|
|
|
|
if (uctxt->urgent != uctxt->urgent_poll) {
|
|
|
|
pollflag = POLLIN | POLLRDNORM;
|
|
|
|
uctxt->urgent_poll = uctxt->urgent;
|
|
|
|
} else {
|
|
|
|
pollflag = 0;
|
|
|
|
set_bit(HFI1_CTXT_WAITING_URG, &uctxt->event_flags);
|
|
|
|
}
|
|
|
|
spin_unlock_irq(&dd->uctxt_lock);
|
|
|
|
|
|
|
|
return pollflag;
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned int poll_next(struct file *fp,
|
|
|
|
struct poll_table_struct *pt)
|
|
|
|
{
|
2015-10-30 22:58:40 +00:00
|
|
|
struct hfi1_filedata *fd = fp->private_data;
|
|
|
|
struct hfi1_ctxtdata *uctxt = fd->uctxt;
|
2015-07-30 19:17:43 +00:00
|
|
|
struct hfi1_devdata *dd = uctxt->dd;
|
|
|
|
unsigned pollflag;
|
|
|
|
|
|
|
|
poll_wait(fp, &uctxt->wait, pt);
|
|
|
|
|
|
|
|
spin_lock_irq(&dd->uctxt_lock);
|
|
|
|
if (hdrqempty(uctxt)) {
|
|
|
|
set_bit(HFI1_CTXT_WAITING_RCV, &uctxt->event_flags);
|
|
|
|
hfi1_rcvctrl(dd, HFI1_RCVCTRL_INTRAVAIL_ENB, uctxt->ctxt);
|
|
|
|
pollflag = 0;
|
2016-02-15 04:22:00 +00:00
|
|
|
} else {
|
2015-07-30 19:17:43 +00:00
|
|
|
pollflag = POLLIN | POLLRDNORM;
|
2016-02-15 04:22:00 +00:00
|
|
|
}
|
2015-07-30 19:17:43 +00:00
|
|
|
spin_unlock_irq(&dd->uctxt_lock);
|
|
|
|
|
|
|
|
return pollflag;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Find all user contexts in use, and set the specified bit in their
|
|
|
|
* event mask.
|
|
|
|
* See also find_ctxt() for a similar use, that is specific to send buffers.
|
|
|
|
*/
|
|
|
|
int hfi1_set_uevent_bits(struct hfi1_pportdata *ppd, const int evtbit)
|
|
|
|
{
|
|
|
|
struct hfi1_ctxtdata *uctxt;
|
|
|
|
struct hfi1_devdata *dd = ppd->dd;
|
|
|
|
unsigned ctxt;
|
|
|
|
int ret = 0;
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
if (!dd->events) {
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
spin_lock_irqsave(&dd->uctxt_lock, flags);
|
2017-04-13 03:29:29 +00:00
|
|
|
for (ctxt = dd->first_dyn_alloc_ctxt; ctxt < dd->num_rcv_contexts;
|
2015-07-30 19:17:43 +00:00
|
|
|
ctxt++) {
|
|
|
|
uctxt = dd->rcd[ctxt];
|
|
|
|
if (uctxt) {
|
|
|
|
unsigned long *evs = dd->events +
|
2017-04-13 03:29:29 +00:00
|
|
|
(uctxt->ctxt - dd->first_dyn_alloc_ctxt) *
|
2015-07-30 19:17:43 +00:00
|
|
|
HFI1_MAX_SHARED_CTXTS;
|
|
|
|
int i;
|
|
|
|
/*
|
|
|
|
* subctxt_cnt is 0 if not shared, so do base
|
|
|
|
* separately, first, then remaining subctxt, if any
|
|
|
|
*/
|
|
|
|
set_bit(evtbit, evs);
|
|
|
|
for (i = 1; i < uctxt->subctxt_cnt; i++)
|
|
|
|
set_bit(evtbit, evs + i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
spin_unlock_irqrestore(&dd->uctxt_lock, flags);
|
|
|
|
done:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* manage_rcvq - manage a context's receive queue
|
|
|
|
* @uctxt: the context
|
|
|
|
* @subctxt: the sub-context
|
|
|
|
* @start_stop: action to carry out
|
|
|
|
*
|
|
|
|
* start_stop == 0 disables receive on the context, for use in queue
|
|
|
|
* overflow conditions. start_stop==1 re-enables, to be used to
|
|
|
|
* re-init the software copy of the head register
|
|
|
|
*/
|
|
|
|
static int manage_rcvq(struct hfi1_ctxtdata *uctxt, unsigned subctxt,
|
|
|
|
int start_stop)
|
|
|
|
{
|
|
|
|
struct hfi1_devdata *dd = uctxt->dd;
|
|
|
|
unsigned int rcvctrl_op;
|
|
|
|
|
|
|
|
if (subctxt)
|
|
|
|
goto bail;
|
|
|
|
/* atomically clear receive enable ctxt. */
|
|
|
|
if (start_stop) {
|
|
|
|
/*
|
|
|
|
* On enable, force in-memory copy of the tail register to
|
|
|
|
* 0, so that protocol code doesn't have to worry about
|
|
|
|
* whether or not the chip has yet updated the in-memory
|
|
|
|
* copy or not on return from the system call. The chip
|
|
|
|
* always resets it's tail register back to 0 on a
|
|
|
|
* transition from disabled to enabled.
|
|
|
|
*/
|
|
|
|
if (uctxt->rcvhdrtail_kvaddr)
|
|
|
|
clear_rcvhdrtail(uctxt);
|
|
|
|
rcvctrl_op = HFI1_RCVCTRL_CTXT_ENB;
|
2016-02-15 04:22:00 +00:00
|
|
|
} else {
|
2015-07-30 19:17:43 +00:00
|
|
|
rcvctrl_op = HFI1_RCVCTRL_CTXT_DIS;
|
2016-02-15 04:22:00 +00:00
|
|
|
}
|
2015-07-30 19:17:43 +00:00
|
|
|
hfi1_rcvctrl(dd, rcvctrl_op, uctxt->ctxt);
|
|
|
|
/* always; new head should be equal to new tail; see above */
|
|
|
|
bail:
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* clear the event notifier events for this context.
|
|
|
|
* User process then performs actions appropriate to bit having been
|
|
|
|
* set, if desired, and checks again in future.
|
|
|
|
*/
|
|
|
|
static int user_event_ack(struct hfi1_ctxtdata *uctxt, int subctxt,
|
|
|
|
unsigned long events)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
struct hfi1_devdata *dd = uctxt->dd;
|
|
|
|
unsigned long *evs;
|
|
|
|
|
|
|
|
if (!dd->events)
|
|
|
|
return 0;
|
|
|
|
|
2017-04-13 03:29:29 +00:00
|
|
|
evs = dd->events + ((uctxt->ctxt - dd->first_dyn_alloc_ctxt) *
|
2015-07-30 19:17:43 +00:00
|
|
|
HFI1_MAX_SHARED_CTXTS) + subctxt;
|
|
|
|
|
|
|
|
for (i = 0; i <= _HFI1_MAX_EVENT_BIT; i++) {
|
|
|
|
if (!test_bit(i, &events))
|
|
|
|
continue;
|
|
|
|
clear_bit(i, evs);
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int set_ctxt_pkey(struct hfi1_ctxtdata *uctxt, unsigned subctxt,
|
|
|
|
u16 pkey)
|
|
|
|
{
|
|
|
|
int ret = -ENOENT, i, intable = 0;
|
|
|
|
struct hfi1_pportdata *ppd = uctxt->ppd;
|
|
|
|
struct hfi1_devdata *dd = uctxt->dd;
|
|
|
|
|
|
|
|
if (pkey == LIM_MGMT_P_KEY || pkey == FULL_MGMT_P_KEY) {
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE(ppd->pkeys); i++)
|
|
|
|
if (pkey == ppd->pkeys[i]) {
|
|
|
|
intable = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (intable)
|
|
|
|
ret = hfi1_set_ctxt_pkey(dd, uctxt->ctxt, pkey);
|
|
|
|
done:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void user_remove(struct hfi1_devdata *dd)
|
|
|
|
{
|
|
|
|
|
|
|
|
hfi1_cdev_cleanup(&dd->user_cdev, &dd->user_device);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int user_add(struct hfi1_devdata *dd)
|
|
|
|
{
|
|
|
|
char name[10];
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
snprintf(name, sizeof(name), "%s_%d", class_name(), dd->unit);
|
2016-05-19 12:25:50 +00:00
|
|
|
ret = hfi1_cdev_init(dd->unit, name, &hfi1_file_ops,
|
2015-09-17 17:47:49 +00:00
|
|
|
&dd->user_cdev, &dd->user_device,
|
2016-05-19 12:26:44 +00:00
|
|
|
true, &dd->kobj);
|
2015-07-30 19:17:43 +00:00
|
|
|
if (ret)
|
2016-05-19 12:25:57 +00:00
|
|
|
user_remove(dd);
|
2015-07-30 19:17:43 +00:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Create per-unit files in /dev
|
|
|
|
*/
|
|
|
|
int hfi1_device_create(struct hfi1_devdata *dd)
|
|
|
|
{
|
2016-05-19 12:26:10 +00:00
|
|
|
return user_add(dd);
|
2015-07-30 19:17:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Remove per-unit files in /dev
|
|
|
|
* void, core kernel returns no errors for this stuff
|
|
|
|
*/
|
|
|
|
void hfi1_device_remove(struct hfi1_devdata *dd)
|
|
|
|
{
|
|
|
|
user_remove(dd);
|
|
|
|
}
|