/*
* Copyright (c) 2012-2016 VMware, Inc. All rights reserved.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of EITHER the GNU General Public License
* version 2 as published by the Free Software Foundation or the BSD
* 2-Clause License. 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 version 2 for more details at
* http://www.gnu.org/licenses/old-licenses/gpl-2.0.en.html.
*
* You should have received a copy of the GNU General Public License
* along with this program available in the file COPYING in the main
* directory of this source tree.
*
* The BSD 2-Clause 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.
*
* 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 HOLDER 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 <asm/page.h>
#include <linux/io.h>
#include <linux/wait.h>
#include <rdma/ib_addr.h>
#include <rdma/ib_smi.h>
#include <rdma/ib_user_verbs.h>
#include "pvrdma.h"
static void __pvrdma_destroy_qp(struct pvrdma_dev *dev,
struct pvrdma_qp *qp);
static inline void get_cqs(struct pvrdma_qp *qp, struct pvrdma_cq **send_cq,
struct pvrdma_cq **recv_cq)
{
*send_cq = to_vcq(qp->ibqp.send_cq);
*recv_cq = to_vcq(qp->ibqp.recv_cq);
}
static void pvrdma_lock_cqs(struct pvrdma_cq *scq, struct pvrdma_cq *rcq,
unsigned long *scq_flags,
unsigned long *rcq_flags)
__acquires(scq->cq_lock) __acquires(rcq->cq_lock)
{
if (scq == rcq) {
spin_lock_irqsave(&scq->cq_lock, *scq_flags);
__acquire(rcq->cq_lock);
} else if (scq->cq_handle < rcq->cq_handle) {
spin_lock_irqsave(&scq->cq_lock, *scq_flags);
spin_lock_irqsave_nested(&rcq->cq_lock, *rcq_flags,
SINGLE_DEPTH_NESTING);
} else {
spin_lock_irqsave(&rcq->cq_lock, *rcq_flags);
spin_lock_irqsave_nested(&scq->cq_lock, *scq_flags,
SINGLE_DEPTH_NESTING);
}
}
static void pvrdma_unlock_cqs(struct pvrdma_cq *scq, struct pvrdma_cq *rcq,
unsigned long *scq_flags,
unsigned long *rcq_flags)
__releases(scq->cq_lock) __releases(rcq->cq_lock)
{
if (scq == rcq) {
__release(rcq->cq_lock);
spin_unlock_irqrestore(&scq->cq_lock, *scq_flags);
} else if (scq->cq_handle < rcq->cq_handle) {
spin_unlock_irqrestore(&rcq->cq_lock, *rcq_flags);
spin_unlock_irqrestore(&scq->cq_lock, *scq_flags);
} else {
spin_unlock_irqrestore(&scq->cq_lock, *scq_flags);
spin_unlock_irqrestore(&rcq->cq_lock, *rcq_flags);
}
}
static void pvrdma_reset_qp(struct pvrdma_qp *qp)
{
struct pvrdma_cq *scq, *rcq;
unsigned long scq_flags, rcq_flags;
/* Clean up cqes */
get_cqs(qp, &scq, &rcq);
pvrdma_lock_cqs(scq, rcq, &scq_flags, &rcq_flags);
_pvrdma_flush_cqe(qp, scq);
if (scq != rcq)
_pvrdma_flush_cqe(qp, rcq);
pvrdma_unlock_cqs(scq, rcq, &scq_flags, &rcq_flags);
/*
* Reset queuepair. The checks are because usermode queuepairs won't
* have kernel ringstates.
*/
if (qp->rq.ring) {
atomic_set(&qp->rq.ring->cons_head, 0);
atomic_set(&qp->rq.ring->prod_tail, 0);
}
if (qp->sq.ring) {
atomic_set(&qp->sq.ring->cons_head, 0);
atomic_set(&