2 * Copyright (c) 2005, 2006, 2007, 2008 Mellanox Technologies. All rights reserved.
3 * Copyright (c) 2005, 2006, 2007 Cisco Systems, Inc. All rights reserved.
5 * This software is available to you under a choice of one of two
6 * licenses. You may choose to be licensed under the terms of the GNU
7 * General Public License (GPL) Version 2, available from the file
8 * COPYING in the main directory of this source tree, or the
9 * OpenIB.org BSD license below:
11 * Redistribution and use in source and binary forms, with or
12 * without modification, are permitted provided that the following
15 * - Redistributions of source code must retain the above
16 * copyright notice, this list of conditions and the following
19 * - Redistributions in binary form must reproduce the above
20 * copyright notice, this list of conditions and the following
21 * disclaimer in the documentation and/or other materials
22 * provided with the distribution.
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
28 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
29 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
30 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
34 #include <linux/interrupt.h>
35 #include <linux/slab.h>
36 #include <linux/export.h>
38 #include <linux/dma-mapping.h>
40 #include <linux/mlx4/cmd.h>
46 MLX4_IRQNAME_SIZE = 32
50 MLX4_NUM_ASYNC_EQE = 0x100,
51 MLX4_NUM_SPARE_EQE = 0x80,
52 MLX4_EQ_ENTRY_SIZE = 0x20
56 * Must be packed because start is 64 bits but only aligned to 32 bits.
58 struct mlx4_eq_context {
72 __be32 mtt_base_addr_l;
74 __be32 consumer_index;
75 __be32 producer_index;
79 #define MLX4_EQ_STATUS_OK ( 0 << 28)
80 #define MLX4_EQ_STATUS_WRITE_FAIL (10 << 28)
81 #define MLX4_EQ_OWNER_SW ( 0 << 24)
82 #define MLX4_EQ_OWNER_HW ( 1 << 24)
83 #define MLX4_EQ_FLAG_EC ( 1 << 18)
84 #define MLX4_EQ_FLAG_OI ( 1 << 17)
85 #define MLX4_EQ_STATE_ARMED ( 9 << 8)
86 #define MLX4_EQ_STATE_FIRED (10 << 8)
87 #define MLX4_EQ_STATE_ALWAYS_ARMED (11 << 8)
89 #define MLX4_ASYNC_EVENT_MASK ((1ull << MLX4_EVENT_TYPE_PATH_MIG) | \
90 (1ull << MLX4_EVENT_TYPE_COMM_EST) | \
91 (1ull << MLX4_EVENT_TYPE_SQ_DRAINED) | \
92 (1ull << MLX4_EVENT_TYPE_CQ_ERROR) | \
93 (1ull << MLX4_EVENT_TYPE_WQ_CATAS_ERROR) | \
94 (1ull << MLX4_EVENT_TYPE_EEC_CATAS_ERROR) | \
95 (1ull << MLX4_EVENT_TYPE_PATH_MIG_FAILED) | \
96 (1ull << MLX4_EVENT_TYPE_WQ_INVAL_REQ_ERROR) | \
97 (1ull << MLX4_EVENT_TYPE_WQ_ACCESS_ERROR) | \
98 (1ull << MLX4_EVENT_TYPE_PORT_CHANGE) | \
99 (1ull << MLX4_EVENT_TYPE_ECC_DETECT) | \
100 (1ull << MLX4_EVENT_TYPE_SRQ_CATAS_ERROR) | \
101 (1ull << MLX4_EVENT_TYPE_SRQ_QP_LAST_WQE) | \
102 (1ull << MLX4_EVENT_TYPE_SRQ_LIMIT) | \
103 (1ull << MLX4_EVENT_TYPE_CMD))
105 static void eq_set_ci(struct mlx4_eq *eq, int req_not)
107 __raw_writel((__force u32) cpu_to_be32((eq->cons_index & 0xffffff) |
110 /* We still want ordering, just not swabbing, so add a barrier */
114 static struct mlx4_eqe *get_eqe(struct mlx4_eq *eq, u32 entry)
116 unsigned long off = (entry & (eq->nent - 1)) * MLX4_EQ_ENTRY_SIZE;
117 return eq->page_list[off / PAGE_SIZE].buf + off % PAGE_SIZE;
120 static struct mlx4_eqe *next_eqe_sw(struct mlx4_eq *eq)
122 struct mlx4_eqe *eqe = get_eqe(eq, eq->cons_index);
123 return !!(eqe->owner & 0x80) ^ !!(eq->cons_index & eq->nent) ? NULL : eqe;
126 static int mlx4_eq_int(struct mlx4_dev *dev, struct mlx4_eq *eq)
128 struct mlx4_eqe *eqe;
134 while ((eqe = next_eqe_sw(eq))) {
136 * Make sure we read EQ entry contents after we've
137 * checked the ownership bit.
142 case MLX4_EVENT_TYPE_COMP:
143 cqn = be32_to_cpu(eqe->event.comp.cqn) & 0xffffff;
144 mlx4_cq_completion(dev, cqn);
147 case MLX4_EVENT_TYPE_PATH_MIG:
148 case MLX4_EVENT_TYPE_COMM_EST:
149 case MLX4_EVENT_TYPE_SQ_DRAINED:
150 case MLX4_EVENT_TYPE_SRQ_QP_LAST_WQE:
151 case MLX4_EVENT_TYPE_WQ_CATAS_ERROR:
152 case MLX4_EVENT_TYPE_PATH_MIG_FAILED:
153 case MLX4_EVENT_TYPE_WQ_INVAL_REQ_ERROR:
154 case MLX4_EVENT_TYPE_WQ_ACCESS_ERROR:
155 mlx4_qp_event(dev, be32_to_cpu(eqe->event.qp.qpn) & 0xffffff,
159 case MLX4_EVENT_TYPE_SRQ_LIMIT:
160 case MLX4_EVENT_TYPE_SRQ_CATAS_ERROR:
161 mlx4_srq_event(dev, be32_to_cpu(eqe->event.srq.srqn) & 0xffffff,
165 case MLX4_EVENT_TYPE_CMD:
167 be16_to_cpu(eqe->event.cmd.token),
168 eqe->event.cmd.status,
169 be64_to_cpu(eqe->event.cmd.out_param));
172 case MLX4_EVENT_TYPE_PORT_CHANGE:
173 port = be32_to_cpu(eqe->event.port_change.port) >> 28;
174 if (eqe->subtype == MLX4_PORT_CHANGE_SUBTYPE_DOWN) {
175 mlx4_dispatch_event(dev, MLX4_DEV_EVENT_PORT_DOWN,
177 mlx4_priv(dev)->sense.do_sense_port[port] = 1;
179 mlx4_dispatch_event(dev, MLX4_DEV_EVENT_PORT_UP,
181 mlx4_priv(dev)->sense.do_sense_port[port] = 0;
185 case MLX4_EVENT_TYPE_CQ_ERROR:
186 mlx4_warn(dev, "CQ %s on CQN %06x\n",
187 eqe->event.cq_err.syndrome == 1 ?
188 "overrun" : "access violation",
189 be32_to_cpu(eqe->event.cq_err.cqn) & 0xffffff);
190 mlx4_cq_event(dev, be32_to_cpu(eqe->event.cq_err.cqn),
194 case MLX4_EVENT_TYPE_EQ_OVERFLOW:
195 mlx4_warn(dev, "EQ overrun on EQN %d\n", eq->eqn);
198 case MLX4_EVENT_TYPE_EEC_CATAS_ERROR:
199 case MLX4_EVENT_TYPE_ECC_DETECT:
201 mlx4_warn(dev, "Unhandled event %02x(%02x) on EQ %d at index %u\n",
202 eqe->type, eqe->subtype, eq->eqn, eq->cons_index);
211 * The HCA will think the queue has overflowed if we
212 * don't tell it we've been processing events. We
213 * create our EQs with MLX4_NUM_SPARE_EQE extra
214 * entries, so we must update our consumer index at
217 if (unlikely(set_ci >= MLX4_NUM_SPARE_EQE)) {
228 static irqreturn_t mlx4_interrupt(int irq, void *dev_ptr)
230 struct mlx4_dev *dev = dev_ptr;
231 struct mlx4_priv *priv = mlx4_priv(dev);
235 writel(priv->eq_table.clr_mask, priv->eq_table.clr_int);
237 for (i = 0; i < dev->caps.num_comp_vectors + 1; ++i)
238 work |= mlx4_eq_int(dev, &priv->eq_table.eq[i]);
240 return IRQ_RETVAL(work);
243 static irqreturn_t mlx4_msi_x_interrupt(int irq, void *eq_ptr)
245 struct mlx4_eq *eq = eq_ptr;
246 struct mlx4_dev *dev = eq->dev;
248 mlx4_eq_int(dev, eq);
250 /* MSI-X vectors always belong to us */
254 static int mlx4_MAP_EQ(struct mlx4_dev *dev, u64 event_mask, int unmap,
257 return mlx4_cmd(dev, event_mask, (unmap << 31) | eq_num,
258 0, MLX4_CMD_MAP_EQ, MLX4_CMD_TIME_CLASS_B,
262 static int mlx4_SW2HW_EQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
265 return mlx4_cmd(dev, mailbox->dma, eq_num, 0, MLX4_CMD_SW2HW_EQ,
266 MLX4_CMD_TIME_CLASS_A,
270 static int mlx4_HW2SW_EQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
273 return mlx4_cmd_box(dev, 0, mailbox->dma, eq_num, 0, MLX4_CMD_HW2SW_EQ,
274 MLX4_CMD_TIME_CLASS_A,
278 static int mlx4_num_eq_uar(struct mlx4_dev *dev)
281 * Each UAR holds 4 EQ doorbells. To figure out how many UARs
282 * we need to map, take the difference of highest index and
283 * the lowest index we'll use and add 1.
285 return (dev->caps.num_comp_vectors + 1 + dev->caps.reserved_eqs +
286 dev->caps.comp_pool)/4 - dev->caps.reserved_eqs/4 + 1;
289 static void __iomem *mlx4_get_eq_uar(struct mlx4_dev *dev, struct mlx4_eq *eq)
291 struct mlx4_priv *priv = mlx4_priv(dev);
294 index = eq->eqn / 4 - dev->caps.reserved_eqs / 4;
296 if (!priv->eq_table.uar_map[index]) {
297 priv->eq_table.uar_map[index] =
298 ioremap(pci_resource_start(dev->pdev, 2) +
299 ((eq->eqn / 4) << PAGE_SHIFT),
301 if (!priv->eq_table.uar_map[index]) {
302 mlx4_err(dev, "Couldn't map EQ doorbell for EQN 0x%06x\n",
308 return priv->eq_table.uar_map[index] + 0x800 + 8 * (eq->eqn % 4);
311 static int mlx4_create_eq(struct mlx4_dev *dev, int nent,
312 u8 intr, struct mlx4_eq *eq)
314 struct mlx4_priv *priv = mlx4_priv(dev);
315 struct mlx4_cmd_mailbox *mailbox;
316 struct mlx4_eq_context *eq_context;
318 u64 *dma_list = NULL;
325 eq->nent = roundup_pow_of_two(max(nent, 2));
326 npages = PAGE_ALIGN(eq->nent * MLX4_EQ_ENTRY_SIZE) / PAGE_SIZE;
328 eq->page_list = kmalloc(npages * sizeof *eq->page_list,
333 for (i = 0; i < npages; ++i)
334 eq->page_list[i].buf = NULL;
336 dma_list = kmalloc(npages * sizeof *dma_list, GFP_KERNEL);
340 mailbox = mlx4_alloc_cmd_mailbox(dev);
343 eq_context = mailbox->buf;
345 for (i = 0; i < npages; ++i) {
346 eq->page_list[i].buf = dma_alloc_coherent(&dev->pdev->dev,
347 PAGE_SIZE, &t, GFP_KERNEL);
348 if (!eq->page_list[i].buf)
349 goto err_out_free_pages;
352 eq->page_list[i].map = t;
354 memset(eq->page_list[i].buf, 0, PAGE_SIZE);
357 eq->eqn = mlx4_bitmap_alloc(&priv->eq_table.bitmap);
359 goto err_out_free_pages;
361 eq->doorbell = mlx4_get_eq_uar(dev, eq);
364 goto err_out_free_eq;
367 err = mlx4_mtt_init(dev, npages, PAGE_SHIFT, &eq->mtt);
369 goto err_out_free_eq;
371 err = mlx4_write_mtt(dev, &eq->mtt, 0, npages, dma_list);
373 goto err_out_free_mtt;
375 memset(eq_context, 0, sizeof *eq_context);
376 eq_context->flags = cpu_to_be32(MLX4_EQ_STATUS_OK |
377 MLX4_EQ_STATE_ARMED);
378 eq_context->log_eq_size = ilog2(eq->nent);
379 eq_context->intr = intr;
380 eq_context->log_page_size = PAGE_SHIFT - MLX4_ICM_PAGE_SHIFT;
382 mtt_addr = mlx4_mtt_addr(dev, &eq->mtt);
383 eq_context->mtt_base_addr_h = mtt_addr >> 32;
384 eq_context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
386 err = mlx4_SW2HW_EQ(dev, mailbox, eq->eqn);
388 mlx4_warn(dev, "SW2HW_EQ failed (%d)\n", err);
389 goto err_out_free_mtt;
393 mlx4_free_cmd_mailbox(dev, mailbox);
400 mlx4_mtt_cleanup(dev, &eq->mtt);
403 mlx4_bitmap_free(&priv->eq_table.bitmap, eq->eqn);
406 for (i = 0; i < npages; ++i)
407 if (eq->page_list[i].buf)
408 dma_free_coherent(&dev->pdev->dev, PAGE_SIZE,
409 eq->page_list[i].buf,
410 eq->page_list[i].map);
412 mlx4_free_cmd_mailbox(dev, mailbox);
415 kfree(eq->page_list);
422 static void mlx4_free_eq(struct mlx4_dev *dev,
425 struct mlx4_priv *priv = mlx4_priv(dev);
426 struct mlx4_cmd_mailbox *mailbox;
428 int npages = PAGE_ALIGN(MLX4_EQ_ENTRY_SIZE * eq->nent) / PAGE_SIZE;
431 mailbox = mlx4_alloc_cmd_mailbox(dev);
435 err = mlx4_HW2SW_EQ(dev, mailbox, eq->eqn);
437 mlx4_warn(dev, "HW2SW_EQ failed (%d)\n", err);
440 mlx4_dbg(dev, "Dumping EQ context %02x:\n", eq->eqn);
441 for (i = 0; i < sizeof (struct mlx4_eq_context) / 4; ++i) {
443 pr_cont("[%02x] ", i * 4);
444 pr_cont(" %08x", be32_to_cpup(mailbox->buf + i * 4));
445 if ((i + 1) % 4 == 0)
450 mlx4_mtt_cleanup(dev, &eq->mtt);
451 for (i = 0; i < npages; ++i)
452 dma_free_coherent(&dev->pdev->dev, PAGE_SIZE,
453 eq->page_list[i].buf,
454 eq->page_list[i].map);
456 kfree(eq->page_list);
457 mlx4_bitmap_free(&priv->eq_table.bitmap, eq->eqn);
458 mlx4_free_cmd_mailbox(dev, mailbox);
461 static void mlx4_free_irqs(struct mlx4_dev *dev)
463 struct mlx4_eq_table *eq_table = &mlx4_priv(dev)->eq_table;
464 struct mlx4_priv *priv = mlx4_priv(dev);
467 if (eq_table->have_irq)
468 free_irq(dev->pdev->irq, dev);
470 for (i = 0; i < dev->caps.num_comp_vectors + 1; ++i)
471 if (eq_table->eq[i].have_irq) {
472 free_irq(eq_table->eq[i].irq, eq_table->eq + i);
473 eq_table->eq[i].have_irq = 0;
476 for (i = 0; i < dev->caps.comp_pool; i++) {
478 * Freeing the assigned irq's
479 * all bits should be 0, but we need to validate
481 if (priv->msix_ctl.pool_bm & 1ULL << i) {
482 /* NO need protecting*/
483 vec = dev->caps.num_comp_vectors + 1 + i;
484 free_irq(priv->eq_table.eq[vec].irq,
485 &priv->eq_table.eq[vec]);
490 kfree(eq_table->irq_names);
493 static int mlx4_map_clr_int(struct mlx4_dev *dev)
495 struct mlx4_priv *priv = mlx4_priv(dev);
497 priv->clr_base = ioremap(pci_resource_start(dev->pdev, priv->fw.clr_int_bar) +
498 priv->fw.clr_int_base, MLX4_CLR_INT_SIZE);
499 if (!priv->clr_base) {
500 mlx4_err(dev, "Couldn't map interrupt clear register, aborting.\n");
507 static void mlx4_unmap_clr_int(struct mlx4_dev *dev)
509 struct mlx4_priv *priv = mlx4_priv(dev);
511 iounmap(priv->clr_base);
514 int mlx4_alloc_eq_table(struct mlx4_dev *dev)
516 struct mlx4_priv *priv = mlx4_priv(dev);
518 priv->eq_table.eq = kcalloc(dev->caps.num_eqs - dev->caps.reserved_eqs,
519 sizeof *priv->eq_table.eq, GFP_KERNEL);
520 if (!priv->eq_table.eq)
526 void mlx4_free_eq_table(struct mlx4_dev *dev)
528 kfree(mlx4_priv(dev)->eq_table.eq);
531 int mlx4_init_eq_table(struct mlx4_dev *dev)
533 struct mlx4_priv *priv = mlx4_priv(dev);
537 priv->eq_table.uar_map = kcalloc(sizeof *priv->eq_table.uar_map,
538 mlx4_num_eq_uar(dev), GFP_KERNEL);
539 if (!priv->eq_table.uar_map) {
544 err = mlx4_bitmap_init(&priv->eq_table.bitmap, dev->caps.num_eqs,
545 dev->caps.num_eqs - 1, dev->caps.reserved_eqs, 0);
549 for (i = 0; i < mlx4_num_eq_uar(dev); ++i)
550 priv->eq_table.uar_map[i] = NULL;
552 err = mlx4_map_clr_int(dev);
556 priv->eq_table.clr_mask =
557 swab32(1 << (priv->eq_table.inta_pin & 31));
558 priv->eq_table.clr_int = priv->clr_base +
559 (priv->eq_table.inta_pin < 32 ? 4 : 0);
561 priv->eq_table.irq_names =
562 kmalloc(MLX4_IRQNAME_SIZE * (dev->caps.num_comp_vectors + 1 +
563 dev->caps.comp_pool),
565 if (!priv->eq_table.irq_names) {
570 for (i = 0; i < dev->caps.num_comp_vectors; ++i) {
571 err = mlx4_create_eq(dev, dev->caps.num_cqs -
572 dev->caps.reserved_cqs +
574 (dev->flags & MLX4_FLAG_MSI_X) ? i : 0,
575 &priv->eq_table.eq[i]);
582 err = mlx4_create_eq(dev, MLX4_NUM_ASYNC_EQE + MLX4_NUM_SPARE_EQE,
583 (dev->flags & MLX4_FLAG_MSI_X) ? dev->caps.num_comp_vectors : 0,
584 &priv->eq_table.eq[dev->caps.num_comp_vectors]);
588 /*if additional completion vectors poolsize is 0 this loop will not run*/
589 for (i = dev->caps.num_comp_vectors + 1;
590 i < dev->caps.num_comp_vectors + dev->caps.comp_pool + 1; ++i) {
592 err = mlx4_create_eq(dev, dev->caps.num_cqs -
593 dev->caps.reserved_cqs +
595 (dev->flags & MLX4_FLAG_MSI_X) ? i : 0,
596 &priv->eq_table.eq[i]);
604 if (dev->flags & MLX4_FLAG_MSI_X) {
607 for (i = 0; i < dev->caps.num_comp_vectors + 1; ++i) {
608 if (i < dev->caps.num_comp_vectors) {
609 snprintf(priv->eq_table.irq_names +
610 i * MLX4_IRQNAME_SIZE,
612 "mlx4-comp-%d@pci:%s", i,
613 pci_name(dev->pdev));
615 snprintf(priv->eq_table.irq_names +
616 i * MLX4_IRQNAME_SIZE,
619 pci_name(dev->pdev));
622 eq_name = priv->eq_table.irq_names +
623 i * MLX4_IRQNAME_SIZE;
624 err = request_irq(priv->eq_table.eq[i].irq,
625 mlx4_msi_x_interrupt, 0, eq_name,
626 priv->eq_table.eq + i);
630 priv->eq_table.eq[i].have_irq = 1;
633 snprintf(priv->eq_table.irq_names,
636 pci_name(dev->pdev));
637 err = request_irq(dev->pdev->irq, mlx4_interrupt,
638 IRQF_SHARED, priv->eq_table.irq_names, dev);
642 priv->eq_table.have_irq = 1;
645 err = mlx4_MAP_EQ(dev, MLX4_ASYNC_EVENT_MASK, 0,
646 priv->eq_table.eq[dev->caps.num_comp_vectors].eqn);
648 mlx4_warn(dev, "MAP_EQ for async EQ %d failed (%d)\n",
649 priv->eq_table.eq[dev->caps.num_comp_vectors].eqn, err);
651 for (i = 0; i < dev->caps.num_comp_vectors + 1; ++i)
652 eq_set_ci(&priv->eq_table.eq[i], 1);
657 mlx4_free_eq(dev, &priv->eq_table.eq[dev->caps.num_comp_vectors]);
660 i = dev->caps.num_comp_vectors - 1;
664 mlx4_free_eq(dev, &priv->eq_table.eq[i]);
667 mlx4_unmap_clr_int(dev);
671 mlx4_bitmap_cleanup(&priv->eq_table.bitmap);
674 kfree(priv->eq_table.uar_map);
679 void mlx4_cleanup_eq_table(struct mlx4_dev *dev)
681 struct mlx4_priv *priv = mlx4_priv(dev);
684 mlx4_MAP_EQ(dev, MLX4_ASYNC_EVENT_MASK, 1,
685 priv->eq_table.eq[dev->caps.num_comp_vectors].eqn);
689 for (i = 0; i < dev->caps.num_comp_vectors + dev->caps.comp_pool + 1; ++i)
690 mlx4_free_eq(dev, &priv->eq_table.eq[i]);
692 mlx4_unmap_clr_int(dev);
694 for (i = 0; i < mlx4_num_eq_uar(dev); ++i)
695 if (priv->eq_table.uar_map[i])
696 iounmap(priv->eq_table.uar_map[i]);
698 mlx4_bitmap_cleanup(&priv->eq_table.bitmap);
700 kfree(priv->eq_table.uar_map);
703 /* A test that verifies that we can accept interrupts on all
704 * the irq vectors of the device.
705 * Interrupts are checked using the NOP command.
707 int mlx4_test_interrupts(struct mlx4_dev *dev)
709 struct mlx4_priv *priv = mlx4_priv(dev);
714 /* When not in MSI_X, there is only one irq to check */
715 if (!(dev->flags & MLX4_FLAG_MSI_X))
718 /* A loop over all completion vectors, for each vector we will check
719 * whether it works by mapping command completions to that vector
720 * and performing a NOP command
722 for(i = 0; !err && (i < dev->caps.num_comp_vectors); ++i) {
723 /* Temporary use polling for command completions */
724 mlx4_cmd_use_polling(dev);
726 /* Map the new eq to handle all asyncronous events */
727 err = mlx4_MAP_EQ(dev, MLX4_ASYNC_EVENT_MASK, 0,
728 priv->eq_table.eq[i].eqn);
730 mlx4_warn(dev, "Failed mapping eq for interrupt test\n");
731 mlx4_cmd_use_events(dev);
735 /* Go back to using events */
736 mlx4_cmd_use_events(dev);
740 /* Return to default */
741 mlx4_MAP_EQ(dev, MLX4_ASYNC_EVENT_MASK, 0,
742 priv->eq_table.eq[dev->caps.num_comp_vectors].eqn);
745 EXPORT_SYMBOL(mlx4_test_interrupts);
747 int mlx4_assign_eq(struct mlx4_dev *dev, char* name, int * vector)
750 struct mlx4_priv *priv = mlx4_priv(dev);
751 int vec = 0, err = 0, i;
753 spin_lock(&priv->msix_ctl.pool_lock);
754 for (i = 0; !vec && i < dev->caps.comp_pool; i++) {
755 if (~priv->msix_ctl.pool_bm & 1ULL << i) {
756 priv->msix_ctl.pool_bm |= 1ULL << i;
757 vec = dev->caps.num_comp_vectors + 1 + i;
758 snprintf(priv->eq_table.irq_names +
759 vec * MLX4_IRQNAME_SIZE,
760 MLX4_IRQNAME_SIZE, "%s", name);
761 err = request_irq(priv->eq_table.eq[vec].irq,
762 mlx4_msi_x_interrupt, 0,
763 &priv->eq_table.irq_names[vec<<5],
764 priv->eq_table.eq + vec);
766 /*zero out bit by fliping it*/
767 priv->msix_ctl.pool_bm ^= 1 << i;
770 /*we dont want to break here*/
772 eq_set_ci(&priv->eq_table.eq[vec], 1);
775 spin_unlock(&priv->msix_ctl.pool_lock);
781 err = (i == dev->caps.comp_pool) ? -ENOSPC : err;
785 EXPORT_SYMBOL(mlx4_assign_eq);
787 void mlx4_release_eq(struct mlx4_dev *dev, int vec)
789 struct mlx4_priv *priv = mlx4_priv(dev);
791 int i = vec - dev->caps.num_comp_vectors - 1;
793 if (likely(i >= 0)) {
794 /*sanity check , making sure were not trying to free irq's
795 Belonging to a legacy EQ*/
796 spin_lock(&priv->msix_ctl.pool_lock);
797 if (priv->msix_ctl.pool_bm & 1ULL << i) {
798 free_irq(priv->eq_table.eq[vec].irq,
799 &priv->eq_table.eq[vec]);
800 priv->msix_ctl.pool_bm &= ~(1ULL << i);
802 spin_unlock(&priv->msix_ctl.pool_lock);
806 EXPORT_SYMBOL(mlx4_release_eq);