mirror of
https://github.com/BobTheBlinker/android_kernel_motorola_sm6375.git
synced 2026-10-28 02:32:09 -04:00
IB/rdmavt: Add completion queue functions
Brings in completion queue functionality. A kthread worker is added to the rvt_dev_info to serve as a worker for completion queues. Reviewed-by: Mike Marciniszyn <[email protected]> Reviewed-by: Harish Chegondi <[email protected]> Signed-off-by: Dennis Dalessandro <[email protected]> Signed-off-by: Doug Ledford <[email protected]>
This commit is contained in:
parent
47c7ea6d8e
commit
6f6387ae75
5 changed files with 561 additions and 7 deletions
|
|
@ -138,6 +138,8 @@ struct rvt_ibport {
|
|||
/* TODO: Move sm_ah and smi_ah into here as well*/
|
||||
};
|
||||
|
||||
#define RVT_CQN_MAX 16 /* maximum length of cq name */
|
||||
|
||||
/*
|
||||
* Things that are driver specific, module parameters in hfi1 and qib
|
||||
*/
|
||||
|
|
@ -190,6 +192,8 @@ struct rvt_driver_params {
|
|||
int nports;
|
||||
int npkeys;
|
||||
u8 qos_shift;
|
||||
char cq_name[RVT_CQN_MAX];
|
||||
int node;
|
||||
};
|
||||
|
||||
/* Protection domain */
|
||||
|
|
@ -281,6 +285,11 @@ struct rvt_dev_info {
|
|||
spinlock_t mmap_offset_lock; /* protect mmap_offset */
|
||||
u32 mmap_offset;
|
||||
spinlock_t pending_lock; /* protect pending mmap list */
|
||||
|
||||
/* CQ */
|
||||
struct kthread_worker *worker; /* per device cq worker */
|
||||
u32 n_cqs_allocated; /* number of CQs allocated for device */
|
||||
spinlock_t n_cqs_lock; /* protect count of in use cqs */
|
||||
};
|
||||
|
||||
static inline struct rvt_pd *ibpd_to_rvtpd(struct ib_pd *ibpd)
|
||||
|
|
|
|||
99
include/rdma/rdmavt_cq.h
Normal file
99
include/rdma/rdmavt_cq.h
Normal file
|
|
@ -0,0 +1,99 @@
|
|||
#ifndef DEF_RDMAVT_INCCQ_H
|
||||
#define DEF_RDMAVT_INCCQ_H
|
||||
|
||||
/*
|
||||
*
|
||||
* 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
|
||||
*
|
||||
* Copyright(c) 2016 Intel Corporation.
|
||||
*
|
||||
* 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
|
||||
*
|
||||
* Copyright(c) 2015 Intel Corporation.
|
||||
*
|
||||
* 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/kthread.h>
|
||||
#include <rdma/ib_user_verbs.h>
|
||||
|
||||
/*
|
||||
* Define an ib_cq_notify value that is not valid so we know when CQ
|
||||
* notifications are armed.
|
||||
*/
|
||||
#define RVT_CQ_NONE (IB_CQ_NEXT_COMP + 1)
|
||||
|
||||
/*
|
||||
* This structure is used to contain the head pointer, tail pointer,
|
||||
* and completion queue entries as a single memory allocation so
|
||||
* it can be mmap'ed into user space.
|
||||
*/
|
||||
struct rvt_cq_wc {
|
||||
u32 head; /* index of next entry to fill */
|
||||
u32 tail; /* index of next ib_poll_cq() entry */
|
||||
union {
|
||||
/* these are actually size ibcq.cqe + 1 */
|
||||
struct ib_uverbs_wc uqueue[0];
|
||||
struct ib_wc kqueue[0];
|
||||
};
|
||||
};
|
||||
|
||||
/*
|
||||
* The completion queue structure.
|
||||
*/
|
||||
struct rvt_cq {
|
||||
struct ib_cq ibcq;
|
||||
struct kthread_work comptask;
|
||||
spinlock_t lock; /* protect changes in this struct */
|
||||
u8 notify;
|
||||
u8 triggered;
|
||||
struct rvt_dev_info *rdi;
|
||||
struct rvt_cq_wc *queue;
|
||||
struct rvt_mmap_info *ip;
|
||||
};
|
||||
|
||||
static inline struct rvt_cq *ibcq_to_rvtcq(struct ib_cq *ibcq)
|
||||
{
|
||||
return container_of(ibcq, struct rvt_cq, ibcq);
|
||||
}
|
||||
|
||||
void rvt_cq_enter(struct rvt_cq *cq, struct ib_wc *entry, bool solicited);
|
||||
|
||||
#endif /* DEF_RDMAVT_INCCQH */
|
||||
Loading…
Reference in a new issue