mirror of
https://github.com/torvalds/linux.git
synced 2024-11-18 18:11:56 +00:00
5136bfea7e
When a completion queue is full, the associated queue pairs are not put into the error state. According to the IBTA specification, this is a violation. Quote from IBTA spec: C9-218: A Requester Class F error occurs when the CQ is inaccessible or full and an attempt is made to complete a WQE. The Affected QP shall be moved to the error state and affiliated asynchronous errors generated as described in 11.6.3.1 Affiliated Asynchronous Events on page 678. The current WQE and any subsequent WQEs are left in an unknown state. C11-37: The CI shall generate a CQ Error when a CQ overrun is detected. This condition will result in an Affiliated Asynchronous Error for any associated Work Queues when they attempt to use that CQ. Completions can no longer be added to the CQ. It is not guaranteed that completions present in the CQ at the time the error occurred can be retrieved. Possible causes include a CQ overrun or a CQ protection error. Put the qp in error state when cq is full. Implement a state called full to continue to put other associated QPs in error state. Reviewed-by: Mike Marciniszyn <mike.marciniszyn@intel.com> Reviewed-by: Michael J. Ruhl <michael.j.ruhl@intel.com> Signed-off-by: Kamenee Arumugam <kamenee.arumugam@intel.com> Signed-off-by: Dennis Dalessandro <dennis.dalessandro@intel.com> Signed-off-by: Jason Gunthorpe <jgg@mellanox.com>
112 lines
3.8 KiB
C
112 lines
3.8 KiB
C
#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 - 2018 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)
|
|
|
|
/*
|
|
* Define read macro that apply smp_load_acquire memory barrier
|
|
* when reading indice of circular buffer that mmaped to user space.
|
|
*/
|
|
#define RDMA_READ_UAPI_ATOMIC(member) smp_load_acquire(&(member).val)
|
|
|
|
/*
|
|
* Define write macro that uses smp_store_release memory barrier
|
|
* when writing indice of circular buffer that mmaped to user space.
|
|
*/
|
|
#define RDMA_WRITE_UAPI_ATOMIC(member, x) smp_store_release(&(member).val, x)
|
|
#include <rdma/rvt-abi.h>
|
|
|
|
/*
|
|
* 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_k_cq_wc {
|
|
u32 head; /* index of next entry to fill */
|
|
u32 tail; /* index of next ib_poll_cq() entry */
|
|
struct ib_wc kqueue[];
|
|
};
|
|
|
|
/*
|
|
* The completion queue structure.
|
|
*/
|
|
struct rvt_cq {
|
|
struct ib_cq ibcq;
|
|
struct work_struct comptask;
|
|
spinlock_t lock; /* protect changes in this struct */
|
|
u8 notify;
|
|
u8 triggered;
|
|
u8 cq_full;
|
|
int comp_vector_cpu;
|
|
struct rvt_dev_info *rdi;
|
|
struct rvt_cq_wc *queue;
|
|
struct rvt_mmap_info *ip;
|
|
struct rvt_k_cq_wc *kqueue;
|
|
};
|
|
|
|
static inline struct rvt_cq *ibcq_to_rvtcq(struct ib_cq *ibcq)
|
|
{
|
|
return container_of(ibcq, struct rvt_cq, ibcq);
|
|
}
|
|
|
|
bool rvt_cq_enter(struct rvt_cq *cq, struct ib_wc *entry, bool solicited);
|
|
|
|
#endif /* DEF_RDMAVT_INCCQH */
|