[mirror_ubuntu-jammy-kernel.git] / drivers / infiniband / hw / vmw_pvrdma / pvrdma_cq.c

/*
 * 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"

/**
 * pvrdma_req_notify_cq - request notification for a completion queue
 * @ibcq: the completion queue
 * @notify_flags: notification flags
 *
 * @return: 0 for success.
 */
int pvrdma_req_notify_cq(struct ib_cq *ibcq,
			 enum ib_cq_notify_flags notify_flags)
{
	struct pvrdma_dev *dev = to_vdev(ibcq->device);
	struct pvrdma_cq *cq = to_vcq(ibcq);
	u32 val = cq->cq_handle;
	unsigned long flags;
	int has_data = 0;

	val |= (notify_flags & IB_CQ_SOLICITED_MASK) == IB_CQ_SOLICITED ?
		PVRDMA_UAR_CQ_ARM_SOL : PVRDMA_UAR_CQ_ARM;

	spin_lock_irqsave(&cq->cq_lock, flags);

	pvrdma_write_uar_cq(dev, val);

	if (notify_flags & IB_CQ_REPORT_MISSED_EVENTS) {
		unsigned int head;

		has_data = pvrdma_idx_ring_has_data(&cq->ring_state->rx,
						    cq->ibcq.cqe, &head);
		if (unlikely(has_data == PVRDMA_INVALID_IDX))
			dev_err(&dev->pdev->dev, "CQ ring state invalid\n");
	}

	spin_unlock_irqrestore(&cq->cq_lock, flags);

	return has_data;
}

/**
 * pvrdma_create_cq - create completion queue
 * @ibdev: the device
 * @attr: completion queue attributes
 * @context: user context
 * @udata: user data
 *
 * @return: ib_cq completion queue pointer on success,
 *          otherwise returns negative errno.
 */
struct ib_cq *pvrdma_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 pvrdma_dev *dev = to_vdev(ibdev);
	struct pvrdma_cq *cq;
	int ret;
	int npages;
	unsigned long flags;
	union pvrdma_cmd_req req;
	union pvrdma_cmd_resp rsp;
	struct pvrdma_cmd_create_cq *cmd = &req.create_cq;
	struct pvrdma_cmd_create_cq_resp *resp = &rsp.create_cq_resp;
	struct pvrdma_create_cq ucmd;

	BUILD_BUG_ON(sizeof(struct pvrdma_cqe) != 64);

	entries = roundup_pow_of_two(entries);
	if (entries < 1 || entries > dev->dsr->caps.max_cqe)
		return ERR_PTR(-EINVAL);

	if (!atomic_add_unless(&dev->num_cqs, 1, dev->dsr->caps.max_cq))
		return ERR_PTR(-ENOMEM);

	cq = kzalloc(sizeof(*cq), GFP_KERNEL);
	if (!cq) {
		atomic_dec(&dev->num_cqs);
		return ERR_PTR(-ENOMEM);
	}

	cq->ibcq.cqe = entries;

	if (context) {
		if (ib_copy_from_udata(&ucmd, udata, sizeof(ucmd))) {
			ret = -EFAULT;
			goto err_cq;
		}

		cq->umem = ib_umem_get(context, ucmd.buf_addr, ucmd.buf_size,
				       IB_ACCESS_LOCAL_WRITE, 1);
		if (IS_ERR(cq->umem)) {
			ret = PTR_ERR(cq->umem);
			goto err_cq;
		}

		npages = ib_umem_page_count(cq->umem);
	} else {
		cq->is_kernel = true;

		/* One extra page for shared ring state */
		npages = 1 + (entries * sizeof(struct pvrdma_cqe) +
			      PAGE_SIZE - 1) / PAGE_SIZE;

		/* Skip header page. */
		cq->offset = PAGE_SIZE;
	}

	if (npages < 0 || npages > PVRDMA_PAGE_DIR_MAX_PAGES) {
		dev_warn(&dev->pdev->dev,
			 "overflow pages in completion queue\n");
		ret = -EINVAL;
		goto err_umem;
	}

	ret = pvrdma_page_dir_init(dev, &cq->pdir, npages, cq->is_kernel);
	if (ret) {
		dev_warn(&dev->pdev->dev,
			 "could not allocate page directory\n");
		goto err_umem;
	}

	/* Ring state is always the first page. Set in library for user cq. */
	if (cq->is_kernel)
		cq->ring_state = cq->pdir.pages[0];
	else
		pvrdma_page_dir_insert_umem(&cq->pdir, cq->umem, 0);

	atomic_set(&cq->refcnt, 1);
	init_completion(&cq->free);
	spin_lock_init(&cq->cq_lock);

	memset(cmd, 0, sizeof(*cmd));
	cmd->hdr.cmd = PVRDMA_CMD_CREATE_CQ;
	cmd->nchunks = npages;
	cmd->ctx_handle = (context) ?
		(u64)to_vucontext(context)->ctx_handle : 0;
	cmd->cqe = entries;
	cmd->pdir_dma = cq->pdir.dir_dma;
	ret = pvrdma_cmd_post(dev, &req, &rsp, PVRDMA_CMD_CREATE_CQ_RESP);
	if (ret < 0) {
		dev_warn(&dev->pdev->dev,
			 "could not create completion queue, error: %d\n", ret);
		goto err_page_dir;
	}

	cq->ibcq.cqe = resp->cqe;
	cq->cq_handle = resp->cq_handle;
	spin_lock_irqsave(&dev->cq_tbl_lock, flags);
	dev->cq_tbl[cq->cq_handle % dev->dsr->caps.max_cq] = cq;
	spin_unlock_irqrestore(&dev->cq_tbl_lock, flags);

	if (context) {
		cq->uar = &(to_vucontext(context)->uar);

		/* Copy udata back. */
		if (ib_copy_to_udata(udata, &cq->cq_handle, sizeof(__u32))) {
			dev_warn(&dev->pdev->dev,
				 "failed to copy back udata\n");
			pvrdma_destroy_cq(&cq->ibcq);
			return ERR_PTR(-EINVAL);
		}
	}

	return &cq->ibcq;

err_page_dir:
	pvrdma_page_dir_cleanup(dev, &cq->pdir);
err_umem:
	if (context)
		ib_umem_release(cq->umem);
err_cq:
	atomic_dec(&dev->num_cqs);
	kfree(cq);

	return ERR_PTR(ret);
}

static void pvrdma_free_cq(struct pvrdma_dev *dev, struct pvrdma_cq *cq)
{
	if (atomic_dec_and_test(&cq->refcnt))
		complete(&cq->free);
	wait_for_completion(&cq->free);

	if (!cq->is_kernel)
		ib_umem_release(cq->umem);

	pvrdma_page_dir_cleanup(dev, &cq->pdir);
	kfree(cq);
}

/**
 * pvrdma_destroy_cq - destroy completion queue
 * @cq: the completion queue to destroy.
 *
 * @return: 0 for success.
 */
int pvrdma_destroy_cq(struct ib_cq *cq)
{
	struct pvrdma_cq *vcq = to_vcq(cq);
	union pvrdma_cmd_req req;
	struct pvrdma_cmd_destroy_cq *cmd = &req.destroy_cq;
	struct pvrdma_dev *dev = to_vdev(cq->device);
	unsigned long flags;
	int ret;

	memset(cmd, 0, sizeof(*cmd));
	cmd->hdr.cmd = PVRDMA_CMD_DESTROY_CQ;
	cmd->cq_handle = vcq->cq_handle;

	ret = pvrdma_cmd_post(dev, &req, NULL, 0);
	if (ret < 0)
		dev_warn(&dev->pdev->dev,
			 "could not destroy completion queue, error: %d\n",
			 ret);

	/* free cq's resources */
	spin_lock_irqsave(&dev->cq_tbl_lock, flags);
	dev->cq_tbl[vcq->cq_handle] = NULL;
	spin_unlock_irqrestore(&dev->cq_tbl_lock, flags);

	pvrdma_free_cq(dev, vcq);
	atomic_dec(&dev->num_cqs);

	return ret;
}

/**
 * pvrdma_modify_cq - modify the CQ moderation parameters
 * @ibcq: the CQ to modify
 * @cq_count: number of CQEs that will trigger an event
 * @cq_period: max period of time in usec before triggering an event
 *
 * @return: -EOPNOTSUPP as CQ resize is not supported.
 */
int pvrdma_modify_cq(struct ib_cq *cq, u16 cq_count, u16 cq_period)
{
	return -EOPNOTSUPP;
}

static inline struct pvrdma_cqe *get_cqe(struct pvrdma_cq *cq, int i)
{
	return (struct pvrdma_cqe *)pvrdma_page_dir_get_ptr(
					&cq->pdir,
					cq->offset +
					sizeof(struct pvrdma_cqe) * i);
}

void _pvrdma_flush_cqe(struct pvrdma_qp *qp, struct pvrdma_cq *cq)
{
	unsigned int head;
	int has_data;

	if (!cq->is_kernel)
		return;

	/* Lock held */
	has_data = pvrdma_idx_ring_has_data(&cq->ring_state->rx,
					    cq->ibcq.cqe, &head);
	if (unlikely(has_data > 0)) {
		int items;
		int curr;
		int tail = pvrdma_idx(&cq->ring_state->rx.prod_tail,
				      cq->ibcq.cqe);
		struct pvrdma_cqe *cqe;
		struct pvrdma_cqe *curr_cqe;

		items = (tail > head) ? (tail - head) :
			(cq->ibcq.cqe - head + tail);
		curr = --tail;
		while (items-- > 0) {
			if (curr < 0)
				curr = cq->ibcq.cqe - 1;
			if (tail < 0)
				tail = cq->ibcq.cqe - 1;
			curr_cqe = get_cqe(cq, curr);
			if ((curr_cqe->qp & 0xFFFF) != qp->qp_handle) {
				if (curr != tail) {
					cqe = get_cqe(cq, tail);
					*cqe = *curr_cqe;
				}
				tail--;
			} else {
				pvrdma_idx_ring_inc(
					&cq->ring_state->rx.cons_head,
					cq->ibcq.cqe);
			}
			curr--;
		}
	}
}

static int pvrdma_poll_one(struct pvrdma_cq *cq, struct pvrdma_qp **cur_qp,
			   struct ib_wc *wc)
{
	struct pvrdma_dev *dev = to_vdev(cq->ibcq.device);
	int has_data;
	unsigned int head;
	bool tried = false;
	struct pvrdma_cqe *cqe;

retry:
	has_data = pvrdma_idx_ring_has_data(&cq->ring_state->rx,
					    cq->ibcq.cqe, &head);
	if (has_data == 0) {
		if (tried)
			return -EAGAIN;

		pvrdma_write_uar_cq(dev, cq->cq_handle | PVRDMA_UAR_CQ_POLL);

		tried = true;
		goto retry;
	} else if (has_data == PVRDMA_INVALID_IDX) {
		dev_err(&dev->pdev->dev, "CQ ring state invalid\n");
		return -EAGAIN;
	}

	cqe = get_cqe(cq, head);

	/* Ensure cqe is valid. */
	rmb();
	if (dev->qp_tbl[cqe->qp & 0xffff])
		*cur_qp = (struct pvrdma_qp *)dev->qp_tbl[cqe->qp & 0xffff];
	else
		return -EAGAIN;

	wc->opcode = pvrdma_wc_opcode_to_ib(cqe->opcode);
	wc->status = pvrdma_wc_status_to_ib(cqe->status);
	wc->wr_id = cqe->wr_id;
	wc->qp = &(*cur_qp)->ibqp;
	wc->byte_len = cqe->byte_len;
	wc->ex.imm_data = cqe->imm_data;
	wc->src_qp = cqe->src_qp;
	wc->wc_flags = pvrdma_wc_flags_to_ib(cqe->wc_flags);
	wc->pkey_index = cqe->pkey_index;
	wc->slid = cqe->slid;
	wc->sl = cqe->sl;
	wc->dlid_path_bits = cqe->dlid_path_bits;
	wc->port_num = cqe->port_num;
	wc->vendor_err = cqe->vendor_err;
	wc->network_hdr_type = cqe->network_hdr_type;

	/* Update shared ring state */
	pvrdma_idx_ring_inc(&cq->ring_state->rx.cons_head, cq->ibcq.cqe);

	return 0;
}

/**
 * pvrdma_poll_cq - poll for work completion queue entries
 * @ibcq: completion queue
 * @num_entries: the maximum number of entries
 * @entry: pointer to work completion array
 *
 * @return: number of polled completion entries
 */
int pvrdma_poll_cq(struct ib_cq *ibcq, int num_entries, struct ib_wc *wc)
{
	struct pvrdma_cq *cq = to_vcq(ibcq);
	struct pvrdma_qp *cur_qp = NULL;
	unsigned long flags;
	int npolled;

	if (num_entries < 1 || wc == NULL)
		return 0;

	spin_lock_irqsave(&cq->cq_lock, flags);
	for (npolled = 0; npolled < num_entries; ++npolled) {
		if (pvrdma_poll_one(cq, &cur_qp, wc + npolled))
			break;
	}

	spin_unlock_irqrestore(&cq->cq_lock, flags);

	/* Ensure we do not return errors from poll_cq */
	return npolled;
}

/**
 * pvrdma_resize_cq - resize CQ
 * @ibcq: the completion queue
 * @entries: CQ entries
 * @udata: user data
 *
 * @return: -EOPNOTSUPP as CQ resize is not supported.
 */
int pvrdma_resize_cq(struct ib_cq *ibcq, int entries, struct ib_udata *udata)
{
	return -EOPNOTSUPP;
}
Commit	Line	Data
29c8d9eb AR	1	/*
	2	* Copyright (c) 2012-2016 VMware, Inc. All rights reserved.
	3	*
	4	* This program is free software; you can redistribute it and/or
	5	* modify it under the terms of EITHER the GNU General Public License
	6	* version 2 as published by the Free Software Foundation or the BSD
	7	* 2-Clause License. This program is distributed in the hope that it
	8	* will be useful, but WITHOUT ANY WARRANTY; WITHOUT EVEN THE IMPLIED
	9	* WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
	10	* See the GNU General Public License version 2 for more details at
	11	* http://www.gnu.org/licenses/old-licenses/gpl-2.0.en.html.
	12	*
	13	* You should have received a copy of the GNU General Public License
	14	* along with this program available in the file COPYING in the main
	15	* directory of this source tree.
	16	*
	17	* The BSD 2-Clause License
	18	*
	19	* Redistribution and use in source and binary forms, with or
	20	* without modification, are permitted provided that the following
	21	* conditions are met:
	22	*
	23	* - Redistributions of source code must retain the above
	24	* copyright notice, this list of conditions and the following
	25	* disclaimer.
	26	*
	27	* - Redistributions in binary form must reproduce the above
	28	* copyright notice, this list of conditions and the following
	29	* disclaimer in the documentation and/or other materials
	30	* provided with the distribution.
	31	*
	32	* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
	33	* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
	34	* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
	35	* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
	36	* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
	37	* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
	38	* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
	39	* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	40	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
	41	* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
	42	* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
	43	* OF THE POSSIBILITY OF SUCH DAMAGE.
	44	*/
	45
	46	#include <asm/page.h>
	47	#include <linux/io.h>
	48	#include <linux/wait.h>
	49	#include <rdma/ib_addr.h>
	50	#include <rdma/ib_smi.h>
	51	#include <rdma/ib_user_verbs.h>
	52
	53	#include "pvrdma.h"
	54
	55	/**
	56	* pvrdma_req_notify_cq - request notification for a completion queue
	57	* @ibcq: the completion queue
	58	* @notify_flags: notification flags
	59	*
	60	* @return: 0 for success.
	61	*/
	62	int pvrdma_req_notify_cq(struct ib_cq *ibcq,
	63	enum ib_cq_notify_flags notify_flags)
	64	{
65	struct pvrdma_dev *dev = to_vdev(ibcq->device);
66	struct pvrdma_cq *cq = to_vcq(ibcq);
67	u32 val = cq->cq_handle;
a7d2e039 BT	68	unsigned long flags;
a7d2e039 BT	69	int has_data = 0;
29c8d9eb AR	70
	71	val \|= (notify_flags & IB_CQ_SOLICITED_MASK) == IB_CQ_SOLICITED ?
	72	PVRDMA_UAR_CQ_ARM_SOL : PVRDMA_UAR_CQ_ARM;
	73
a7d2e039 BT	74	spin_lock_irqsave(&cq->cq_lock, flags);
a7d2e039 BT	75
29c8d9eb AR	76	pvrdma_write_uar_cq(dev, val);
29c8d9eb AR	77
a7d2e039 BT	78	if (notify_flags & IB_CQ_REPORT_MISSED_EVENTS) {
	79	unsigned int head;
	80
	81	has_data = pvrdma_idx_ring_has_data(&cq->ring_state->rx,
	82	cq->ibcq.cqe, &head);
	83	if (unlikely(has_data == PVRDMA_INVALID_IDX))
	84	dev_err(&dev->pdev->dev, "CQ ring state invalid\n");
	85	}
	86
	87	spin_unlock_irqrestore(&cq->cq_lock, flags);
	88
	89	return has_data;
29c8d9eb AR	90	}
	91
	92	/**
	93	* pvrdma_create_cq - create completion queue
	94	* @ibdev: the device
	95	* @attr: completion queue attributes
	96	* @context: user context
	97	* @udata: user data
	98	*
	99	* @return: ib_cq completion queue pointer on success,
	100	* otherwise returns negative errno.
	101	*/
	102	struct ib_cq pvrdma_create_cq(struct ib_device ibdev,
	103	const struct ib_cq_init_attr *attr,
	104	struct ib_ucontext *context,
	105	struct ib_udata *udata)
	106	{
	107	int entries = attr->cqe;
	108	struct pvrdma_dev *dev = to_vdev(ibdev);
	109	struct pvrdma_cq *cq;
	110	int ret;
	111	int npages;
	112	unsigned long flags;
	113	union pvrdma_cmd_req req;
	114	union pvrdma_cmd_resp rsp;
	115	struct pvrdma_cmd_create_cq *cmd = &req.create_cq;
	116	struct pvrdma_cmd_create_cq_resp *resp = &rsp.create_cq_resp;
	117	struct pvrdma_create_cq ucmd;
	118
	119	BUILD_BUG_ON(sizeof(struct pvrdma_cqe) != 64);
	120
	121	entries = roundup_pow_of_two(entries);
	122	if (entries < 1 \|\| entries > dev->dsr->caps.max_cqe)
	123	return ERR_PTR(-EINVAL);
	124
	125	if (!atomic_add_unless(&dev->num_cqs, 1, dev->dsr->caps.max_cq))
	126	return ERR_PTR(-ENOMEM);
	127
	128	cq = kzalloc(sizeof(*cq), GFP_KERNEL);
	129	if (!cq) {
	130	atomic_dec(&dev->num_cqs);
	131	return ERR_PTR(-ENOMEM);
	132	}
	133
	134	cq->ibcq.cqe = entries;
	135
	136	if (context) {
	137	if (ib_copy_from_udata(&ucmd, udata, sizeof(ucmd))) {
	138	ret = -EFAULT;
	139	goto err_cq;
	140	}
	141
	142	cq->umem = ib_umem_get(context, ucmd.buf_addr, ucmd.buf_size,
	143	IB_ACCESS_LOCAL_WRITE, 1);
	144	if (IS_ERR(cq->umem)) {
	145	ret = PTR_ERR(cq->umem);
	146	goto err_cq;
	147	}
	148
	149	npages = ib_umem_page_count(cq->umem);
	150	} else {
	151	cq->is_kernel = true;
	152
	153	/* One extra page for shared ring state */
154	npages = 1 + (entries * sizeof(struct pvrdma_cqe) +
155	PAGE_SIZE - 1) / PAGE_SIZE;
156
157	/* Skip header page. */
158	cq->offset = PAGE_SIZE;
159	}
160
161	if (npages < 0 \|\| npages > PVRDMA_PAGE_DIR_MAX_PAGES) {
162	dev_warn(&dev->pdev->dev,
163	"overflow pages in completion queue\n");
164	ret = -EINVAL;
165	goto err_umem;
166	}
167
168	ret = pvrdma_page_dir_init(dev, &cq->pdir, npages, cq->is_kernel);
169	if (ret) {
170	dev_warn(&dev->pdev->dev,
171	"could not allocate page directory\n");
172	goto err_umem;
173	}
174
175	/* Ring state is always the first page. Set in library for user cq. */
176	if (cq->is_kernel)
177	cq->ring_state = cq->pdir.pages[0];
178	else
179	pvrdma_page_dir_insert_umem(&cq->pdir, cq->umem, 0);
180
181	atomic_set(&cq->refcnt, 1);
e3524b26	182	init_completion(&cq->free);
29c8d9eb AR	183	spin_lock_init(&cq->cq_lock);
	184
	185	memset(cmd, 0, sizeof(*cmd));
	186	cmd->hdr.cmd = PVRDMA_CMD_CREATE_CQ;
	187	cmd->nchunks = npages;
	188	cmd->ctx_handle = (context) ?
	189	(u64)to_vucontext(context)->ctx_handle : 0;
	190	cmd->cqe = entries;
	191	cmd->pdir_dma = cq->pdir.dir_dma;
	192	ret = pvrdma_cmd_post(dev, &req, &rsp, PVRDMA_CMD_CREATE_CQ_RESP);
	193	if (ret < 0) {
	194	dev_warn(&dev->pdev->dev,
	195	"could not create completion queue, error: %d\n", ret);
	196	goto err_page_dir;
	197	}
	198
	199	cq->ibcq.cqe = resp->cqe;
	200	cq->cq_handle = resp->cq_handle;
	201	spin_lock_irqsave(&dev->cq_tbl_lock, flags);
	202	dev->cq_tbl[cq->cq_handle % dev->dsr->caps.max_cq] = cq;
	203	spin_unlock_irqrestore(&dev->cq_tbl_lock, flags);
	204
	205	if (context) {
	206	cq->uar = &(to_vucontext(context)->uar);
	207
	208	/* Copy udata back. */
	209	if (ib_copy_to_udata(udata, &cq->cq_handle, sizeof(__u32))) {
	210	dev_warn(&dev->pdev->dev,
	211	"failed to copy back udata\n");
	212	pvrdma_destroy_cq(&cq->ibcq);
	213	return ERR_PTR(-EINVAL);
	214	}
	215	}
	216
	217	return &cq->ibcq;
	218
	219	err_page_dir:
	220	pvrdma_page_dir_cleanup(dev, &cq->pdir);
	221	err_umem:
	222	if (context)
	223	ib_umem_release(cq->umem);
	224	err_cq:
	225	atomic_dec(&dev->num_cqs);
	226	kfree(cq);
	227
	228	return ERR_PTR(ret);
	229	}
	230
	231	static void pvrdma_free_cq(struct pvrdma_dev dev, struct pvrdma_cq cq)
	232	{
e3524b26 BT	233	if (atomic_dec_and_test(&cq->refcnt))
	234	complete(&cq->free);
	235	wait_for_completion(&cq->free);
29c8d9eb AR	236
	237	if (!cq->is_kernel)
	238	ib_umem_release(cq->umem);
	239
	240	pvrdma_page_dir_cleanup(dev, &cq->pdir);
	241	kfree(cq);
	242	}
	243
	244	/**
	245	* pvrdma_destroy_cq - destroy completion queue
	246	* @cq: the completion queue to destroy.
	247	*
	248	* @return: 0 for success.
	249	*/
	250	int pvrdma_destroy_cq(struct ib_cq *cq)
	251	{
	252	struct pvrdma_cq *vcq = to_vcq(cq);
	253	union pvrdma_cmd_req req;
	254	struct pvrdma_cmd_destroy_cq *cmd = &req.destroy_cq;
	255	struct pvrdma_dev *dev = to_vdev(cq->device);
	256	unsigned long flags;
	257	int ret;
	258
	259	memset(cmd, 0, sizeof(*cmd));
	260	cmd->hdr.cmd = PVRDMA_CMD_DESTROY_CQ;
	261	cmd->cq_handle = vcq->cq_handle;
	262
	263	ret = pvrdma_cmd_post(dev, &req, NULL, 0);
	264	if (ret < 0)
	265	dev_warn(&dev->pdev->dev,
	266	"could not destroy completion queue, error: %d\n",
	267	ret);
	268
	269	/* free cq's resources */
	270	spin_lock_irqsave(&dev->cq_tbl_lock, flags);
	271	dev->cq_tbl[vcq->cq_handle] = NULL;
	272	spin_unlock_irqrestore(&dev->cq_tbl_lock, flags);
	273
	274	pvrdma_free_cq(dev, vcq);
	275	atomic_dec(&dev->num_cqs);
	276
	277	return ret;
	278	}
	279
	280	/**
	281	* pvrdma_modify_cq - modify the CQ moderation parameters
	282	* @ibcq: the CQ to modify
	283	* @cq_count: number of CQEs that will trigger an event
	284	* @cq_period: max period of time in usec before triggering an event
	285	*
	286	* @return: -EOPNOTSUPP as CQ resize is not supported.
	287	*/
	288	int pvrdma_modify_cq(struct ib_cq *cq, u16 cq_count, u16 cq_period)
	289	{
	290	return -EOPNOTSUPP;
	291	}
	292
	293	static inline struct pvrdma_cqe get_cqe(struct pvrdma_cq cq, int i)
	294	{
	295	return (struct pvrdma_cqe *)pvrdma_page_dir_get_ptr(
	296	&cq->pdir,
	297	cq->offset +
	298	sizeof(struct pvrdma_cqe) * i);
	299	}
300
301	void _pvrdma_flush_cqe(struct pvrdma_qp qp, struct pvrdma_cq cq)
302	{
14d6c3a8	303	unsigned int head;
29c8d9eb AR	304	int has_data;
	305
	306	if (!cq->is_kernel)
	307	return;
	308
	309	/* Lock held */
	310	has_data = pvrdma_idx_ring_has_data(&cq->ring_state->rx,
	311	cq->ibcq.cqe, &head);
	312	if (unlikely(has_data > 0)) {
	313	int items;
	314	int curr;
	315	int tail = pvrdma_idx(&cq->ring_state->rx.prod_tail,
	316	cq->ibcq.cqe);
	317	struct pvrdma_cqe *cqe;
	318	struct pvrdma_cqe *curr_cqe;
	319
	320	items = (tail > head) ? (tail - head) :
	321	(cq->ibcq.cqe - head + tail);
	322	curr = --tail;
	323	while (items-- > 0) {
	324	if (curr < 0)
	325	curr = cq->ibcq.cqe - 1;
	326	if (tail < 0)
	327	tail = cq->ibcq.cqe - 1;
	328	curr_cqe = get_cqe(cq, curr);
	329	if ((curr_cqe->qp & 0xFFFF) != qp->qp_handle) {
	330	if (curr != tail) {
	331	cqe = get_cqe(cq, tail);
	332	cqe = curr_cqe;
	333	}
	334	tail--;
	335	} else {
	336	pvrdma_idx_ring_inc(
	337	&cq->ring_state->rx.cons_head,
	338	cq->ibcq.cqe);
	339	}
	340	curr--;
	341	}
	342	}
	343	}
	344
	345	static int pvrdma_poll_one(struct pvrdma_cq cq, struct pvrdma_qp *cur_qp,
	346	struct ib_wc *wc)
	347	{
	348	struct pvrdma_dev *dev = to_vdev(cq->ibcq.device);
	349	int has_data;
	350	unsigned int head;
	351	bool tried = false;
	352	struct pvrdma_cqe *cqe;
	353
	354	retry:
	355	has_data = pvrdma_idx_ring_has_data(&cq->ring_state->rx,
	356	cq->ibcq.cqe, &head);
	357	if (has_data == 0) {
	358	if (tried)
	359	return -EAGAIN;
	360
	361	pvrdma_write_uar_cq(dev, cq->cq_handle \| PVRDMA_UAR_CQ_POLL);
	362
	363	tried = true;
	364	goto retry;
	365	} else if (has_data == PVRDMA_INVALID_IDX) {
	366	dev_err(&dev->pdev->dev, "CQ ring state invalid\n");
	367	return -EAGAIN;
368	}
369
370	cqe = get_cqe(cq, head);
371
372	/* Ensure cqe is valid. */
373	rmb();
374	if (dev->qp_tbl[cqe->qp & 0xffff])
375	cur_qp = (struct pvrdma_qp )dev->qp_tbl[cqe->qp & 0xffff];
376	else
377	return -EAGAIN;
378
379	wc->opcode = pvrdma_wc_opcode_to_ib(cqe->opcode);
380	wc->status = pvrdma_wc_status_to_ib(cqe->status);
381	wc->wr_id = cqe->wr_id;
382	wc->qp = &(*cur_qp)->ibqp;
383	wc->byte_len = cqe->byte_len;
384	wc->ex.imm_data = cqe->imm_data;
385	wc->src_qp = cqe->src_qp;
386	wc->wc_flags = pvrdma_wc_flags_to_ib(cqe->wc_flags);
387	wc->pkey_index = cqe->pkey_index;
388	wc->slid = cqe->slid;
389	wc->sl = cqe->sl;
390	wc->dlid_path_bits = cqe->dlid_path_bits;
391	wc->port_num = cqe->port_num;
c67294b7	392	wc->vendor_err = cqe->vendor_err;
72f9b089	393	wc->network_hdr_type = cqe->network_hdr_type;
29c8d9eb AR	394
	395	/* Update shared ring state */
	396	pvrdma_idx_ring_inc(&cq->ring_state->rx.cons_head, cq->ibcq.cqe);
	397
	398	return 0;
	399	}
	400
	401	/**
	402	* pvrdma_poll_cq - poll for work completion queue entries
	403	* @ibcq: completion queue
	404	* @num_entries: the maximum number of entries
	405	* @entry: pointer to work completion array
	406	*
	407	* @return: number of polled completion entries
	408	*/
	409	int pvrdma_poll_cq(struct ib_cq ibcq, int num_entries, struct ib_wc wc)
	410	{
	411	struct pvrdma_cq *cq = to_vcq(ibcq);
	412	struct pvrdma_qp *cur_qp = NULL;
	413	unsigned long flags;
	414	int npolled;
	415
	416	if (num_entries < 1 \|\| wc == NULL)
	417	return 0;
	418
	419	spin_lock_irqsave(&cq->cq_lock, flags);
	420	for (npolled = 0; npolled < num_entries; ++npolled) {
	421	if (pvrdma_poll_one(cq, &cur_qp, wc + npolled))
	422	break;
	423	}
	424
	425	spin_unlock_irqrestore(&cq->cq_lock, flags);
	426
	427	/* Ensure we do not return errors from poll_cq */
	428	return npolled;
	429	}
	430
	431	/**
	432	* pvrdma_resize_cq - resize CQ
	433	* @ibcq: the completion queue
	434	* @entries: CQ entries
	435	* @udata: user data
	436	*
	437	* @return: -EOPNOTSUPP as CQ resize is not supported.
	438	*/
	439	int pvrdma_resize_cq(struct ib_cq ibcq, int entries, struct ib_udata udata)
	440	{
	441	return -EOPNOTSUPP;
	442	}