x86: merge sched_clock handling
[linux/fpc-iii.git] / drivers / net / mlx4 / cq.c
blob95e87a2f8896f97ca5110613fdcd2a6527ccfc5f
1 /*
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
16 * conditions are met:
18 * - Redistributions of source code must retain the above
19 * copyright notice, this list of conditions and the following
20 * disclaimer.
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
34 * SOFTWARE.
37 #include <linux/init.h>
38 #include <linux/hardirq.h>
40 #include <linux/mlx4/cmd.h>
41 #include <linux/mlx4/cq.h>
43 #include "mlx4.h"
44 #include "icm.h"
46 struct mlx4_cq_context {
47 __be32 flags;
48 u16 reserved1[3];
49 __be16 page_offset;
50 __be32 logsize_usrpage;
51 __be16 cq_period;
52 __be16 cq_max_count;
53 u8 reserved2[3];
54 u8 comp_eqn;
55 u8 log_page_size;
56 u8 reserved3[2];
57 u8 mtt_base_addr_h;
58 __be32 mtt_base_addr_l;
59 __be32 last_notified_index;
60 __be32 solicit_producer_index;
61 __be32 consumer_index;
62 __be32 producer_index;
63 u32 reserved4[2];
64 __be64 db_rec_addr;
67 #define MLX4_CQ_STATUS_OK ( 0 << 28)
68 #define MLX4_CQ_STATUS_OVERFLOW ( 9 << 28)
69 #define MLX4_CQ_STATUS_WRITE_FAIL (10 << 28)
70 #define MLX4_CQ_FLAG_CC ( 1 << 18)
71 #define MLX4_CQ_FLAG_OI ( 1 << 17)
72 #define MLX4_CQ_STATE_ARMED ( 9 << 8)
73 #define MLX4_CQ_STATE_ARMED_SOL ( 6 << 8)
74 #define MLX4_EQ_STATE_FIRED (10 << 8)
76 void mlx4_cq_completion(struct mlx4_dev *dev, u32 cqn)
78 struct mlx4_cq *cq;
80 cq = radix_tree_lookup(&mlx4_priv(dev)->cq_table.tree,
81 cqn & (dev->caps.num_cqs - 1));
82 if (!cq) {
83 mlx4_warn(dev, "Completion event for bogus CQ %08x\n", cqn);
84 return;
87 ++cq->arm_sn;
89 cq->comp(cq);
92 void mlx4_cq_event(struct mlx4_dev *dev, u32 cqn, int event_type)
94 struct mlx4_cq_table *cq_table = &mlx4_priv(dev)->cq_table;
95 struct mlx4_cq *cq;
97 spin_lock(&cq_table->lock);
99 cq = radix_tree_lookup(&cq_table->tree, cqn & (dev->caps.num_cqs - 1));
100 if (cq)
101 atomic_inc(&cq->refcount);
103 spin_unlock(&cq_table->lock);
105 if (!cq) {
106 mlx4_warn(dev, "Async event for bogus CQ %08x\n", cqn);
107 return;
110 cq->event(cq, event_type);
112 if (atomic_dec_and_test(&cq->refcount))
113 complete(&cq->free);
116 static int mlx4_SW2HW_CQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
117 int cq_num)
119 return mlx4_cmd(dev, mailbox->dma, cq_num, 0, MLX4_CMD_SW2HW_CQ,
120 MLX4_CMD_TIME_CLASS_A);
123 static int mlx4_MODIFY_CQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
124 int cq_num, u32 opmod)
126 return mlx4_cmd(dev, mailbox->dma, cq_num, opmod, MLX4_CMD_MODIFY_CQ,
127 MLX4_CMD_TIME_CLASS_A);
130 static int mlx4_HW2SW_CQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
131 int cq_num)
133 return mlx4_cmd_box(dev, 0, mailbox ? mailbox->dma : 0, cq_num,
134 mailbox ? 0 : 1, MLX4_CMD_HW2SW_CQ,
135 MLX4_CMD_TIME_CLASS_A);
138 int mlx4_cq_modify(struct mlx4_dev *dev, struct mlx4_cq *cq,
139 u16 count, u16 period)
141 struct mlx4_cmd_mailbox *mailbox;
142 struct mlx4_cq_context *cq_context;
143 int err;
145 mailbox = mlx4_alloc_cmd_mailbox(dev);
146 if (IS_ERR(mailbox))
147 return PTR_ERR(mailbox);
149 cq_context = mailbox->buf;
150 memset(cq_context, 0, sizeof *cq_context);
152 cq_context->cq_max_count = cpu_to_be16(count);
153 cq_context->cq_period = cpu_to_be16(period);
155 err = mlx4_MODIFY_CQ(dev, mailbox, cq->cqn, 1);
157 mlx4_free_cmd_mailbox(dev, mailbox);
158 return err;
160 EXPORT_SYMBOL_GPL(mlx4_cq_modify);
162 int mlx4_cq_resize(struct mlx4_dev *dev, struct mlx4_cq *cq,
163 int entries, struct mlx4_mtt *mtt)
165 struct mlx4_cmd_mailbox *mailbox;
166 struct mlx4_cq_context *cq_context;
167 u64 mtt_addr;
168 int err;
170 mailbox = mlx4_alloc_cmd_mailbox(dev);
171 if (IS_ERR(mailbox))
172 return PTR_ERR(mailbox);
174 cq_context = mailbox->buf;
175 memset(cq_context, 0, sizeof *cq_context);
177 cq_context->logsize_usrpage = cpu_to_be32(ilog2(entries) << 24);
178 cq_context->log_page_size = mtt->page_shift - 12;
179 mtt_addr = mlx4_mtt_addr(dev, mtt);
180 cq_context->mtt_base_addr_h = mtt_addr >> 32;
181 cq_context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
183 err = mlx4_MODIFY_CQ(dev, mailbox, cq->cqn, 0);
185 mlx4_free_cmd_mailbox(dev, mailbox);
186 return err;
188 EXPORT_SYMBOL_GPL(mlx4_cq_resize);
190 int mlx4_cq_alloc(struct mlx4_dev *dev, int nent, struct mlx4_mtt *mtt,
191 struct mlx4_uar *uar, u64 db_rec, struct mlx4_cq *cq,
192 int collapsed)
194 struct mlx4_priv *priv = mlx4_priv(dev);
195 struct mlx4_cq_table *cq_table = &priv->cq_table;
196 struct mlx4_cmd_mailbox *mailbox;
197 struct mlx4_cq_context *cq_context;
198 u64 mtt_addr;
199 int err;
201 cq->cqn = mlx4_bitmap_alloc(&cq_table->bitmap);
202 if (cq->cqn == -1)
203 return -ENOMEM;
205 err = mlx4_table_get(dev, &cq_table->table, cq->cqn);
206 if (err)
207 goto err_out;
209 err = mlx4_table_get(dev, &cq_table->cmpt_table, cq->cqn);
210 if (err)
211 goto err_put;
213 spin_lock_irq(&cq_table->lock);
214 err = radix_tree_insert(&cq_table->tree, cq->cqn, cq);
215 spin_unlock_irq(&cq_table->lock);
216 if (err)
217 goto err_cmpt_put;
219 mailbox = mlx4_alloc_cmd_mailbox(dev);
220 if (IS_ERR(mailbox)) {
221 err = PTR_ERR(mailbox);
222 goto err_radix;
225 cq_context = mailbox->buf;
226 memset(cq_context, 0, sizeof *cq_context);
228 cq_context->flags = cpu_to_be32(!!collapsed << 18);
229 cq_context->logsize_usrpage = cpu_to_be32((ilog2(nent) << 24) | uar->index);
230 cq_context->comp_eqn = priv->eq_table.eq[MLX4_EQ_COMP].eqn;
231 cq_context->log_page_size = mtt->page_shift - MLX4_ICM_PAGE_SHIFT;
233 mtt_addr = mlx4_mtt_addr(dev, mtt);
234 cq_context->mtt_base_addr_h = mtt_addr >> 32;
235 cq_context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
236 cq_context->db_rec_addr = cpu_to_be64(db_rec);
238 err = mlx4_SW2HW_CQ(dev, mailbox, cq->cqn);
239 mlx4_free_cmd_mailbox(dev, mailbox);
240 if (err)
241 goto err_radix;
243 cq->cons_index = 0;
244 cq->arm_sn = 1;
245 cq->uar = uar;
246 atomic_set(&cq->refcount, 1);
247 init_completion(&cq->free);
249 return 0;
251 err_radix:
252 spin_lock_irq(&cq_table->lock);
253 radix_tree_delete(&cq_table->tree, cq->cqn);
254 spin_unlock_irq(&cq_table->lock);
256 err_cmpt_put:
257 mlx4_table_put(dev, &cq_table->cmpt_table, cq->cqn);
259 err_put:
260 mlx4_table_put(dev, &cq_table->table, cq->cqn);
262 err_out:
263 mlx4_bitmap_free(&cq_table->bitmap, cq->cqn);
265 return err;
267 EXPORT_SYMBOL_GPL(mlx4_cq_alloc);
269 void mlx4_cq_free(struct mlx4_dev *dev, struct mlx4_cq *cq)
271 struct mlx4_priv *priv = mlx4_priv(dev);
272 struct mlx4_cq_table *cq_table = &priv->cq_table;
273 int err;
275 err = mlx4_HW2SW_CQ(dev, NULL, cq->cqn);
276 if (err)
277 mlx4_warn(dev, "HW2SW_CQ failed (%d) for CQN %06x\n", err, cq->cqn);
279 synchronize_irq(priv->eq_table.eq[MLX4_EQ_COMP].irq);
281 spin_lock_irq(&cq_table->lock);
282 radix_tree_delete(&cq_table->tree, cq->cqn);
283 spin_unlock_irq(&cq_table->lock);
285 if (atomic_dec_and_test(&cq->refcount))
286 complete(&cq->free);
287 wait_for_completion(&cq->free);
289 mlx4_table_put(dev, &cq_table->table, cq->cqn);
290 mlx4_bitmap_free(&cq_table->bitmap, cq->cqn);
292 EXPORT_SYMBOL_GPL(mlx4_cq_free);
294 int mlx4_init_cq_table(struct mlx4_dev *dev)
296 struct mlx4_cq_table *cq_table = &mlx4_priv(dev)->cq_table;
297 int err;
299 spin_lock_init(&cq_table->lock);
300 INIT_RADIX_TREE(&cq_table->tree, GFP_ATOMIC);
302 err = mlx4_bitmap_init(&cq_table->bitmap, dev->caps.num_cqs,
303 dev->caps.num_cqs - 1, dev->caps.reserved_cqs);
304 if (err)
305 return err;
307 return 0;
310 void mlx4_cleanup_cq_table(struct mlx4_dev *dev)
312 /* Nothing to do to clean up radix_tree */
313 mlx4_bitmap_cleanup(&mlx4_priv(dev)->cq_table.bitmap);