2 * Copyright (c) 2004, 2005 Topspin Communications. All rights reserved.
3 * Copyright (c) 2005 Sun Microsystems, Inc. All rights reserved.
4 * Copyright (c) 2005, 2006, 2007 Cisco Systems, Inc. All rights reserved.
5 * Copyright (c) 2005 Mellanox Technologies. All rights reserved.
6 * Copyright (c) 2004 Voltaire, Inc. All rights reserved.
8 * This software is available to you under a choice of one of two
9 * licenses. You may choose to be licensed under the terms of the GNU
10 * General Public License (GPL) Version 2, available from the file
11 * COPYING in the main directory of this source tree, or the
12 * OpenIB.org BSD license below:
14 * Redistribution and use in source and binary forms, with or
15 * without modification, are permitted provided that the following
18 * - Redistributions of source code must retain the above
19 * copyright notice, this list of conditions and the following
22 * - Redistributions in binary form must reproduce the above
23 * copyright notice, this list of conditions and the following
24 * disclaimer in the documentation and/or other materials
25 * provided with the distribution.
27 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
28 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
29 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
30 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
31 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
32 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
33 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
37 #include <linux/init.h>
38 #include <linux/hardirq.h>
40 #include <linux/mlx4/cmd.h>
45 struct mlx4_cq_context {
49 __be32 logsize_usrpage;
59 __be32 mtt_base_addr_l;
60 __be32 last_notified_index;
61 __be32 solicit_producer_index;
62 __be32 consumer_index;
63 __be32 producer_index;
68 #define MLX4_CQ_STATUS_OK ( 0 << 28)
69 #define MLX4_CQ_STATUS_OVERFLOW ( 9 << 28)
70 #define MLX4_CQ_STATUS_WRITE_FAIL (10 << 28)
71 #define MLX4_CQ_FLAG_CC ( 1 << 18)
72 #define MLX4_CQ_FLAG_OI ( 1 << 17)
73 #define MLX4_CQ_STATE_ARMED ( 9 << 8)
74 #define MLX4_CQ_STATE_ARMED_SOL ( 6 << 8)
75 #define MLX4_EQ_STATE_FIRED (10 << 8)
77 void mlx4_cq_completion(struct mlx4_dev *dev, u32 cqn)
81 cq = radix_tree_lookup(&mlx4_priv(dev)->cq_table.tree,
82 cqn & (dev->caps.num_cqs - 1));
84 mlx4_warn(dev, "Completion event for bogus CQ %08x\n", cqn);
93 void mlx4_cq_event(struct mlx4_dev *dev, u32 cqn, int event_type)
95 struct mlx4_cq_table *cq_table = &mlx4_priv(dev)->cq_table;
98 spin_lock(&cq_table->lock);
100 cq = radix_tree_lookup(&cq_table->tree, cqn & (dev->caps.num_cqs - 1));
102 atomic_inc(&cq->refcount);
104 spin_unlock(&cq_table->lock);
107 mlx4_warn(dev, "Async event for bogus CQ %08x\n", cqn);
111 cq->event(cq, event_type);
113 if (atomic_dec_and_test(&cq->refcount))
117 static int mlx4_SW2HW_CQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
120 return mlx4_cmd(dev, mailbox->dma, cq_num, 0, MLX4_CMD_SW2HW_CQ,
121 MLX4_CMD_TIME_CLASS_A);
124 static int mlx4_HW2SW_CQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
127 return mlx4_cmd_box(dev, 0, mailbox ? mailbox->dma : 0, cq_num,
128 mailbox ? 0 : 1, MLX4_CMD_HW2SW_CQ,
129 MLX4_CMD_TIME_CLASS_A);
132 int mlx4_cq_alloc(struct mlx4_dev *dev, int nent, struct mlx4_mtt *mtt,
133 struct mlx4_uar *uar, u64 db_rec, struct mlx4_cq *cq)
135 struct mlx4_priv *priv = mlx4_priv(dev);
136 struct mlx4_cq_table *cq_table = &priv->cq_table;
137 struct mlx4_cmd_mailbox *mailbox;
138 struct mlx4_cq_context *cq_context;
142 cq->cqn = mlx4_bitmap_alloc(&cq_table->bitmap);
146 err = mlx4_table_get(dev, &cq_table->table, cq->cqn);
150 err = mlx4_table_get(dev, &cq_table->cmpt_table, cq->cqn);
154 spin_lock_irq(&cq_table->lock);
155 err = radix_tree_insert(&cq_table->tree, cq->cqn, cq);
156 spin_unlock_irq(&cq_table->lock);
160 mailbox = mlx4_alloc_cmd_mailbox(dev);
161 if (IS_ERR(mailbox)) {
162 err = PTR_ERR(mailbox);
166 cq_context = mailbox->buf;
167 memset(cq_context, 0, sizeof *cq_context);
169 cq_context->logsize_usrpage = cpu_to_be32((ilog2(nent) << 24) | uar->index);
170 cq_context->comp_eqn = priv->eq_table.eq[MLX4_EQ_COMP].eqn;
171 cq_context->log_page_size = mtt->page_shift - MLX4_ICM_PAGE_SHIFT;
173 mtt_addr = mlx4_mtt_addr(dev, mtt);
174 cq_context->mtt_base_addr_h = mtt_addr >> 32;
175 cq_context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
176 cq_context->db_rec_addr = cpu_to_be64(db_rec);
178 err = mlx4_SW2HW_CQ(dev, mailbox, cq->cqn);
179 mlx4_free_cmd_mailbox(dev, mailbox);
186 atomic_set(&cq->refcount, 1);
187 init_completion(&cq->free);
192 spin_lock_irq(&cq_table->lock);
193 radix_tree_delete(&cq_table->tree, cq->cqn);
194 spin_unlock_irq(&cq_table->lock);
197 mlx4_table_put(dev, &cq_table->cmpt_table, cq->cqn);
200 mlx4_table_put(dev, &cq_table->table, cq->cqn);
203 mlx4_bitmap_free(&cq_table->bitmap, cq->cqn);
207 EXPORT_SYMBOL_GPL(mlx4_cq_alloc);
209 void mlx4_cq_free(struct mlx4_dev *dev, struct mlx4_cq *cq)
211 struct mlx4_priv *priv = mlx4_priv(dev);
212 struct mlx4_cq_table *cq_table = &priv->cq_table;
215 err = mlx4_HW2SW_CQ(dev, NULL, cq->cqn);
217 mlx4_warn(dev, "HW2SW_CQ failed (%d) for CQN %06x\n", err, cq->cqn);
219 synchronize_irq(priv->eq_table.eq[MLX4_EQ_COMP].irq);
221 spin_lock_irq(&cq_table->lock);
222 radix_tree_delete(&cq_table->tree, cq->cqn);
223 spin_unlock_irq(&cq_table->lock);
225 if (atomic_dec_and_test(&cq->refcount))
227 wait_for_completion(&cq->free);
229 mlx4_table_put(dev, &cq_table->table, cq->cqn);
230 mlx4_bitmap_free(&cq_table->bitmap, cq->cqn);
232 EXPORT_SYMBOL_GPL(mlx4_cq_free);
234 int mlx4_init_cq_table(struct mlx4_dev *dev)
236 struct mlx4_cq_table *cq_table = &mlx4_priv(dev)->cq_table;
239 spin_lock_init(&cq_table->lock);
240 INIT_RADIX_TREE(&cq_table->tree, GFP_ATOMIC);
242 err = mlx4_bitmap_init(&cq_table->bitmap, dev->caps.num_cqs,
243 dev->caps.num_cqs - 1, dev->caps.reserved_cqs);
250 void mlx4_cleanup_cq_table(struct mlx4_dev *dev)
252 /* Nothing to do to clean up radix_tree */
253 mlx4_bitmap_cleanup(&mlx4_priv(dev)->cq_table.bitmap);