[deliverable/linux.git] / drivers / net / ethernet / mellanox / mlx5 / core / cq.c

/*
 * Copyright (c) 2013-2015, Mellanox Technologies. All rights reserved.
 *
 * This software is available to you under a choice of one of two
 * licenses.  You may choose to be licensed under the terms of the GNU
 * General Public License (GPL) Version 2, available from the file
 * COPYING in the main directory of this source tree, or the
 * OpenIB.org BSD license below:
 *
 *     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.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/hardirq.h>
#include <linux/mlx5/driver.h>
#include <linux/mlx5/cmd.h>
#include <rdma/ib_verbs.h>
#include <linux/mlx5/cq.h>
#include "mlx5_core.h"

#define TASKLET_MAX_TIME 2
#define TASKLET_MAX_TIME_JIFFIES msecs_to_jiffies(TASKLET_MAX_TIME)

void mlx5_cq_tasklet_cb(unsigned long data)
{
	unsigned long flags;
	unsigned long end = jiffies + TASKLET_MAX_TIME_JIFFIES;
	struct mlx5_eq_tasklet *ctx = (struct mlx5_eq_tasklet *)data;
	struct mlx5_core_cq *mcq;
	struct mlx5_core_cq *temp;

	spin_lock_irqsave(&ctx->lock, flags);
	list_splice_tail_init(&ctx->list, &ctx->process_list);
	spin_unlock_irqrestore(&ctx->lock, flags);

	list_for_each_entry_safe(mcq, temp, &ctx->process_list,
				 tasklet_ctx.list) {
		list_del_init(&mcq->tasklet_ctx.list);
		mcq->tasklet_ctx.comp(mcq);
		if (atomic_dec_and_test(&mcq->refcount))
			complete(&mcq->free);
		if (time_after(jiffies, end))
			break;
	}

	if (!list_empty(&ctx->process_list))
		tasklet_schedule(&ctx->task);
}

static void mlx5_add_cq_to_tasklet(struct mlx5_core_cq *cq)
{
	unsigned long flags;
	struct mlx5_eq_tasklet *tasklet_ctx = cq->tasklet_ctx.priv;

	spin_lock_irqsave(&tasklet_ctx->lock, flags);
	/* When migrating CQs between EQs will be implemented, please note
	 * that you need to sync this point. It is possible that
	 * while migrating a CQ, completions on the old EQs could
	 * still arrive.
	 */
	if (list_empty_careful(&cq->tasklet_ctx.list)) {
		atomic_inc(&cq->refcount);
		list_add_tail(&cq->tasklet_ctx.list, &tasklet_ctx->list);
	}
	spin_unlock_irqrestore(&tasklet_ctx->lock, flags);
}

void mlx5_cq_completion(struct mlx5_core_dev *dev, u32 cqn)
{
	struct mlx5_core_cq *cq;
	struct mlx5_cq_table *table = &dev->priv.cq_table;

	spin_lock(&table->lock);
	cq = radix_tree_lookup(&table->tree, cqn);
	if (likely(cq))
		atomic_inc(&cq->refcount);
	spin_unlock(&table->lock);

	if (!cq) {
		mlx5_core_warn(dev, "Completion event for bogus CQ 0x%x\n", cqn);
		return;
	}

	++cq->arm_sn;

	cq->comp(cq);

	if (atomic_dec_and_test(&cq->refcount))
		complete(&cq->free);
}

void mlx5_cq_event(struct mlx5_core_dev *dev, u32 cqn, int event_type)
{
	struct mlx5_cq_table *table = &dev->priv.cq_table;
	struct mlx5_core_cq *cq;

	spin_lock(&table->lock);

	cq = radix_tree_lookup(&table->tree, cqn);
	if (cq)
		atomic_inc(&cq->refcount);

	spin_unlock(&table->lock);

	if (!cq) {
		mlx5_core_warn(dev, "Async event for bogus CQ 0x%x\n", cqn);
		return;
	}

	cq->event(cq, event_type);

	if (atomic_dec_and_test(&cq->refcount))
		complete(&cq->free);
}

int mlx5_core_create_cq(struct mlx5_core_dev *dev, struct mlx5_core_cq *cq,
			u32 *in, int inlen)
{
	struct mlx5_cq_table *table = &dev->priv.cq_table;
	u32 out[MLX5_ST_SZ_DW(create_cq_out)];
	u32 din[MLX5_ST_SZ_DW(destroy_cq_in)];
	u32 dout[MLX5_ST_SZ_DW(destroy_cq_out)];
	int eqn = MLX5_GET(cqc, MLX5_ADDR_OF(create_cq_in, in, cq_context),
			   c_eqn);
	struct mlx5_eq *eq;
	int err;

	eq = mlx5_eqn2eq(dev, eqn);
	if (IS_ERR(eq))
		return PTR_ERR(eq);

	memset(out, 0, sizeof(out));
	MLX5_SET(create_cq_in, in, opcode, MLX5_CMD_OP_CREATE_CQ);
	err = mlx5_cmd_exec(dev, in, inlen, out, sizeof(out));
	if (err)
		return err;

	cq->cqn = MLX5_GET(create_cq_out, out, cqn);
	cq->cons_index = 0;
	cq->arm_sn     = 0;
	atomic_set(&cq->refcount, 1);
	init_completion(&cq->free);
	if (!cq->comp)
		cq->comp = mlx5_add_cq_to_tasklet;
	/* assuming CQ will be deleted before the EQ */
	cq->tasklet_ctx.priv = &eq->tasklet_ctx;
	INIT_LIST_HEAD(&cq->tasklet_ctx.list);

	spin_lock_irq(&table->lock);
	err = radix_tree_insert(&table->tree, cq->cqn, cq);
	spin_unlock_irq(&table->lock);
	if (err)
		goto err_cmd;

	cq->pid = current->pid;
	err = mlx5_debug_cq_add(dev, cq);
	if (err)
		mlx5_core_dbg(dev, "failed adding CP 0x%x to debug file system\n",
			      cq->cqn);

	return 0;

err_cmd:
	memset(din, 0, sizeof(din));
	memset(dout, 0, sizeof(dout));
	MLX5_SET(destroy_cq_in, din, opcode, MLX5_CMD_OP_DESTROY_CQ);
	MLX5_SET(destroy_cq_in, din, cqn, cq->cqn);
	mlx5_cmd_exec(dev, din, sizeof(din), dout, sizeof(dout));
	return err;
}
EXPORT_SYMBOL(mlx5_core_create_cq);

int mlx5_core_destroy_cq(struct mlx5_core_dev *dev, struct mlx5_core_cq *cq)
{
	struct mlx5_cq_table *table = &dev->priv.cq_table;
	u32 out[MLX5_ST_SZ_DW(destroy_cq_out)] = {0};
	u32 in[MLX5_ST_SZ_DW(destroy_cq_in)] = {0};
	struct mlx5_core_cq *tmp;
	int err;

	spin_lock_irq(&table->lock);
	tmp = radix_tree_delete(&table->tree, cq->cqn);
	spin_unlock_irq(&table->lock);
	if (!tmp) {
		mlx5_core_warn(dev, "cq 0x%x not found in tree\n", cq->cqn);
		return -EINVAL;
	}
	if (tmp != cq) {
		mlx5_core_warn(dev, "corruption on srqn 0x%x\n", cq->cqn);
		return -EINVAL;
	}

	MLX5_SET(destroy_cq_in, in, opcode, MLX5_CMD_OP_DESTROY_CQ);
	MLX5_SET(destroy_cq_in, in, cqn, cq->cqn);
	err = mlx5_cmd_exec(dev, in, sizeof(in), out, sizeof(out));
	if (err)
		return err;

	synchronize_irq(cq->irqn);

	mlx5_debug_cq_remove(dev, cq);
	if (atomic_dec_and_test(&cq->refcount))
		complete(&cq->free);
	wait_for_completion(&cq->free);

	return 0;
}
EXPORT_SYMBOL(mlx5_core_destroy_cq);

int mlx5_core_query_cq(struct mlx5_core_dev *dev, struct mlx5_core_cq *cq,
		       u32 *out, int outlen)
{
	u32 in[MLX5_ST_SZ_DW(query_cq_in)] = {0};

	MLX5_SET(query_cq_in, in, opcode, MLX5_CMD_OP_QUERY_CQ);
	MLX5_SET(query_cq_in, in, cqn, cq->cqn);
	return mlx5_cmd_exec(dev, in, sizeof(in), out, outlen);
}
EXPORT_SYMBOL(mlx5_core_query_cq);

int mlx5_core_modify_cq(struct mlx5_core_dev *dev, struct mlx5_core_cq *cq,
			u32 *in, int inlen)
{
	u32 out[MLX5_ST_SZ_DW(modify_cq_out)] = {0};

	MLX5_SET(modify_cq_in, in, opcode, MLX5_CMD_OP_MODIFY_CQ);
	return mlx5_cmd_exec(dev, in, inlen, out, sizeof(out));
}
EXPORT_SYMBOL(mlx5_core_modify_cq);

int mlx5_core_modify_cq_moderation(struct mlx5_core_dev *dev,
				   struct mlx5_core_cq *cq,
				   u16 cq_period,
				   u16 cq_max_count)
{
	u32 in[MLX5_ST_SZ_DW(modify_cq_in)] = {0};
	void *cqc;

	MLX5_SET(modify_cq_in, in, cqn, cq->cqn);
	cqc = MLX5_ADDR_OF(modify_cq_in, in, cq_context);
	MLX5_SET(cqc, cqc, cq_period, cq_period);
	MLX5_SET(cqc, cqc, cq_max_count, cq_max_count);
	MLX5_SET(modify_cq_in, in,
		 modify_field_select_resize_field_select.modify_field_select.modify_field_select,
		 MLX5_CQ_MODIFY_PERIOD | MLX5_CQ_MODIFY_COUNT);

	return mlx5_core_modify_cq(dev, cq, in, sizeof(in));
}
EXPORT_SYMBOL(mlx5_core_modify_cq_moderation);

int mlx5_init_cq_table(struct mlx5_core_dev *dev)
{
	struct mlx5_cq_table *table = &dev->priv.cq_table;
	int err;

	memset(table, 0, sizeof(*table));
	spin_lock_init(&table->lock);
	INIT_RADIX_TREE(&table->tree, GFP_ATOMIC);
	err = mlx5_cq_debugfs_init(dev);

	return err;
}

void mlx5_cleanup_cq_table(struct mlx5_core_dev *dev)
{
	mlx5_cq_debugfs_cleanup(dev);
}
Commit	Line	Data
e126ba97	1	/*
302bdf68	2	* Copyright (c) 2013-2015, Mellanox Technologies. All rights reserved.
e126ba97 EC	3	*
	4	* This software is available to you under a choice of one of two
	5	* licenses. You may choose to be licensed under the terms of the GNU
	6	* General Public License (GPL) Version 2, available from the file
	7	* COPYING in the main directory of this source tree, or the
	8	* OpenIB.org BSD license below:
	9	*
	10	* Redistribution and use in source and binary forms, with or
	11	* without modification, are permitted provided that the following
	12	* conditions are met:
	13	*
	14	* - Redistributions of source code must retain the above
	15	* copyright notice, this list of conditions and the following
	16	* disclaimer.
	17	*
	18	* - Redistributions in binary form must reproduce the above
	19	* copyright notice, this list of conditions and the following
	20	* disclaimer in the documentation and/or other materials
	21	* provided with the distribution.
	22	*
	23	* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
	24	* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
	25	* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
	26	* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
	27	* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
	28	* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
	29	* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
	30	* SOFTWARE.
	31	*/
	32
	33	#include <linux/kernel.h>
	34	#include <linux/module.h>
	35	#include <linux/hardirq.h>
	36	#include <linux/mlx5/driver.h>
	37	#include <linux/mlx5/cmd.h>
	38	#include <rdma/ib_verbs.h>
	39	#include <linux/mlx5/cq.h>
	40	#include "mlx5_core.h"
	41
94c6825e MB	42	#define TASKLET_MAX_TIME 2
	43	#define TASKLET_MAX_TIME_JIFFIES msecs_to_jiffies(TASKLET_MAX_TIME)
	44
	45	void mlx5_cq_tasklet_cb(unsigned long data)
	46	{
	47	unsigned long flags;
	48	unsigned long end = jiffies + TASKLET_MAX_TIME_JIFFIES;
	49	struct mlx5_eq_tasklet ctx = (struct mlx5_eq_tasklet )data;
	50	struct mlx5_core_cq *mcq;
	51	struct mlx5_core_cq *temp;
	52
	53	spin_lock_irqsave(&ctx->lock, flags);
	54	list_splice_tail_init(&ctx->list, &ctx->process_list);
	55	spin_unlock_irqrestore(&ctx->lock, flags);
	56
	57	list_for_each_entry_safe(mcq, temp, &ctx->process_list,
	58	tasklet_ctx.list) {
	59	list_del_init(&mcq->tasklet_ctx.list);
	60	mcq->tasklet_ctx.comp(mcq);
	61	if (atomic_dec_and_test(&mcq->refcount))
	62	complete(&mcq->free);
	63	if (time_after(jiffies, end))
	64	break;
	65	}
	66
	67	if (!list_empty(&ctx->process_list))
	68	tasklet_schedule(&ctx->task);
	69	}
	70
	71	static void mlx5_add_cq_to_tasklet(struct mlx5_core_cq *cq)
	72	{
	73	unsigned long flags;
	74	struct mlx5_eq_tasklet *tasklet_ctx = cq->tasklet_ctx.priv;
	75
	76	spin_lock_irqsave(&tasklet_ctx->lock, flags);
	77	/* When migrating CQs between EQs will be implemented, please note
	78	* that you need to sync this point. It is possible that
	79	* while migrating a CQ, completions on the old EQs could
	80	* still arrive.
	81	*/
	82	if (list_empty_careful(&cq->tasklet_ctx.list)) {
	83	atomic_inc(&cq->refcount);
	84	list_add_tail(&cq->tasklet_ctx.list, &tasklet_ctx->list);
	85	}
	86	spin_unlock_irqrestore(&tasklet_ctx->lock, flags);
	87	}
	88
e126ba97 EC	89	void mlx5_cq_completion(struct mlx5_core_dev *dev, u32 cqn)
	90	{
	91	struct mlx5_core_cq *cq;
	92	struct mlx5_cq_table *table = &dev->priv.cq_table;
	93
	94	spin_lock(&table->lock);
	95	cq = radix_tree_lookup(&table->tree, cqn);
	96	if (likely(cq))
	97	atomic_inc(&cq->refcount);
	98	spin_unlock(&table->lock);
	99
	100	if (!cq) {
	101	mlx5_core_warn(dev, "Completion event for bogus CQ 0x%x\n", cqn);
	102	return;
	103	}
	104
	105	++cq->arm_sn;
	106
	107	cq->comp(cq);
	108
	109	if (atomic_dec_and_test(&cq->refcount))
	110	complete(&cq->free);
	111	}
	112
	113	void mlx5_cq_event(struct mlx5_core_dev *dev, u32 cqn, int event_type)
	114	{
	115	struct mlx5_cq_table *table = &dev->priv.cq_table;
	116	struct mlx5_core_cq *cq;
	117
	118	spin_lock(&table->lock);
	119
	120	cq = radix_tree_lookup(&table->tree, cqn);
	121	if (cq)
	122	atomic_inc(&cq->refcount);
	123
	124	spin_unlock(&table->lock);
	125
	126	if (!cq) {
	127	mlx5_core_warn(dev, "Async event for bogus CQ 0x%x\n", cqn);
	128	return;
	129	}
	130
	131	cq->event(cq, event_type);
	132
	133	if (atomic_dec_and_test(&cq->refcount))
	134	complete(&cq->free);
	135	}
	136
e126ba97	137	int mlx5_core_create_cq(struct mlx5_core_dev dev, struct mlx5_core_cq cq,
27827786	138	u32 *in, int inlen)
e126ba97	139	{
e126ba97	140	struct mlx5_cq_table *table = &dev->priv.cq_table;
27827786 SM	141	u32 out[MLX5_ST_SZ_DW(create_cq_out)];
	142	u32 din[MLX5_ST_SZ_DW(destroy_cq_in)];
	143	u32 dout[MLX5_ST_SZ_DW(destroy_cq_out)];
94c6825e MB	144	int eqn = MLX5_GET(cqc, MLX5_ADDR_OF(create_cq_in, in, cq_context),
	145	c_eqn);
	146	struct mlx5_eq *eq;
27827786	147	int err;
94c6825e MB	148
	149	eq = mlx5_eqn2eq(dev, eqn);
	150	if (IS_ERR(eq))
	151	return PTR_ERR(eq);
e126ba97	152
27827786 SM	153	memset(out, 0, sizeof(out));
	154	MLX5_SET(create_cq_in, in, opcode, MLX5_CMD_OP_CREATE_CQ);
	155	err = mlx5_cmd_exec(dev, in, inlen, out, sizeof(out));
e126ba97 EC	156	if (err)
	157	return err;
	158
27827786	159	cq->cqn = MLX5_GET(create_cq_out, out, cqn);
e126ba97 EC	160	cq->cons_index = 0;
	161	cq->arm_sn = 0;
	162	atomic_set(&cq->refcount, 1);
	163	init_completion(&cq->free);
94c6825e MB	164	if (!cq->comp)
	165	cq->comp = mlx5_add_cq_to_tasklet;
	166	/* assuming CQ will be deleted before the EQ */
	167	cq->tasklet_ctx.priv = &eq->tasklet_ctx;
	168	INIT_LIST_HEAD(&cq->tasklet_ctx.list);
e126ba97 EC	169
	170	spin_lock_irq(&table->lock);
	171	err = radix_tree_insert(&table->tree, cq->cqn, cq);
	172	spin_unlock_irq(&table->lock);
	173	if (err)
	174	goto err_cmd;
	175
	176	cq->pid = current->pid;
	177	err = mlx5_debug_cq_add(dev, cq);
	178	if (err)
	179	mlx5_core_dbg(dev, "failed adding CP 0x%x to debug file system\n",
	180	cq->cqn);
	181
	182	return 0;
	183
	184	err_cmd:
27827786 SM	185	memset(din, 0, sizeof(din));
	186	memset(dout, 0, sizeof(dout));
	187	MLX5_SET(destroy_cq_in, din, opcode, MLX5_CMD_OP_DESTROY_CQ);
	188	MLX5_SET(destroy_cq_in, din, cqn, cq->cqn);
c4f287c4 SM	189	mlx5_cmd_exec(dev, din, sizeof(din), dout, sizeof(dout));
c4f287c4 SM	190	return err;
e126ba97 EC	191	}
	192	EXPORT_SYMBOL(mlx5_core_create_cq);
	193
	194	int mlx5_core_destroy_cq(struct mlx5_core_dev dev, struct mlx5_core_cq cq)
	195	{
	196	struct mlx5_cq_table *table = &dev->priv.cq_table;
27827786 SM	197	u32 out[MLX5_ST_SZ_DW(destroy_cq_out)] = {0};
27827786 SM	198	u32 in[MLX5_ST_SZ_DW(destroy_cq_in)] = {0};
e126ba97 EC	199	struct mlx5_core_cq *tmp;
	200	int err;
	201
	202	spin_lock_irq(&table->lock);
	203	tmp = radix_tree_delete(&table->tree, cq->cqn);
	204	spin_unlock_irq(&table->lock);
	205	if (!tmp) {
	206	mlx5_core_warn(dev, "cq 0x%x not found in tree\n", cq->cqn);
	207	return -EINVAL;
	208	}
	209	if (tmp != cq) {
	210	mlx5_core_warn(dev, "corruption on srqn 0x%x\n", cq->cqn);
	211	return -EINVAL;
	212	}
	213
27827786 SM	214	MLX5_SET(destroy_cq_in, in, opcode, MLX5_CMD_OP_DESTROY_CQ);
	215	MLX5_SET(destroy_cq_in, in, cqn, cq->cqn);
	216	err = mlx5_cmd_exec(dev, in, sizeof(in), out, sizeof(out));
e126ba97 EC	217	if (err)
	218	return err;
	219
e126ba97 EC	220	synchronize_irq(cq->irqn);
	221
	222	mlx5_debug_cq_remove(dev, cq);
	223	if (atomic_dec_and_test(&cq->refcount))
	224	complete(&cq->free);
	225	wait_for_completion(&cq->free);
	226
	227	return 0;
	228	}
	229	EXPORT_SYMBOL(mlx5_core_destroy_cq);
	230
	231	int mlx5_core_query_cq(struct mlx5_core_dev dev, struct mlx5_core_cq cq,
27827786	232	u32 *out, int outlen)
e126ba97	233	{
27827786	234	u32 in[MLX5_ST_SZ_DW(query_cq_in)] = {0};
e126ba97	235
27827786 SM	236	MLX5_SET(query_cq_in, in, opcode, MLX5_CMD_OP_QUERY_CQ);
27827786 SM	237	MLX5_SET(query_cq_in, in, cqn, cq->cqn);
c4f287c4	238	return mlx5_cmd_exec(dev, in, sizeof(in), out, outlen);
e126ba97 EC	239	}
	240	EXPORT_SYMBOL(mlx5_core_query_cq);
	241
e126ba97	242	int mlx5_core_modify_cq(struct mlx5_core_dev dev, struct mlx5_core_cq cq,
27827786	243	u32 *in, int inlen)
e126ba97	244	{
27827786	245	u32 out[MLX5_ST_SZ_DW(modify_cq_out)] = {0};
3bdb31f6	246
27827786	247	MLX5_SET(modify_cq_in, in, opcode, MLX5_CMD_OP_MODIFY_CQ);
c4f287c4	248	return mlx5_cmd_exec(dev, in, inlen, out, sizeof(out));
e126ba97	249	}
3bdb31f6	250	EXPORT_SYMBOL(mlx5_core_modify_cq);
e126ba97	251
90b3e38d RS	252	int mlx5_core_modify_cq_moderation(struct mlx5_core_dev *dev,
	253	struct mlx5_core_cq *cq,
	254	u16 cq_period,
	255	u16 cq_max_count)
	256	{
27827786 SM	257	u32 in[MLX5_ST_SZ_DW(modify_cq_in)] = {0};
	258	void *cqc;
	259
	260	MLX5_SET(modify_cq_in, in, cqn, cq->cqn);
	261	cqc = MLX5_ADDR_OF(modify_cq_in, in, cq_context);
	262	MLX5_SET(cqc, cqc, cq_period, cq_period);
	263	MLX5_SET(cqc, cqc, cq_max_count, cq_max_count);
	264	MLX5_SET(modify_cq_in, in,
	265	modify_field_select_resize_field_select.modify_field_select.modify_field_select,
	266	MLX5_CQ_MODIFY_PERIOD \| MLX5_CQ_MODIFY_COUNT);
	267
	268	return mlx5_core_modify_cq(dev, cq, in, sizeof(in));
90b3e38d	269	}
27827786	270	EXPORT_SYMBOL(mlx5_core_modify_cq_moderation);
90b3e38d	271
e126ba97 EC	272	int mlx5_init_cq_table(struct mlx5_core_dev *dev)
	273	{
	274	struct mlx5_cq_table *table = &dev->priv.cq_table;
	275	int err;
	276
a31208b1	277	memset(table, 0, sizeof(*table));
e126ba97 EC	278	spin_lock_init(&table->lock);
	279	INIT_RADIX_TREE(&table->tree, GFP_ATOMIC);
	280	err = mlx5_cq_debugfs_init(dev);
	281
	282	return err;
	283	}
	284
	285	void mlx5_cleanup_cq_table(struct mlx5_core_dev *dev)
	286	{
	287	mlx5_cq_debugfs_cleanup(dev);
	288	}