eq.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656
  1. /*
  2. * Copyright (c) 2005 Mellanox Technologies. All rights reserved.
  3. * Copyright (c) 2005, 2006, 2007 Cisco Systems, Inc. All rights reserved.
  4. *
  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:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * - Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  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.
  23. *
  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
  31. * SOFTWARE.
  32. */
  33. #include <linux/init.h>
  34. #include <linux/interrupt.h>
  35. #include <linux/dma-mapping.h>
  36. #include <linux/mlx4/cmd.h>
  37. #include "mlx4.h"
  38. #include "fw.h"
  39. enum {
  40. MLX4_NUM_ASYNC_EQE = 0x100,
  41. MLX4_NUM_SPARE_EQE = 0x80,
  42. MLX4_EQ_ENTRY_SIZE = 0x20
  43. };
  44. /*
  45. * Must be packed because start is 64 bits but only aligned to 32 bits.
  46. */
  47. struct mlx4_eq_context {
  48. __be32 flags;
  49. u16 reserved1[3];
  50. __be16 page_offset;
  51. u8 log_eq_size;
  52. u8 reserved2[4];
  53. u8 eq_period;
  54. u8 reserved3;
  55. u8 eq_max_count;
  56. u8 reserved4[3];
  57. u8 intr;
  58. u8 log_page_size;
  59. u8 reserved5[2];
  60. u8 mtt_base_addr_h;
  61. __be32 mtt_base_addr_l;
  62. u32 reserved6[2];
  63. __be32 consumer_index;
  64. __be32 producer_index;
  65. u32 reserved7[4];
  66. };
  67. #define MLX4_EQ_STATUS_OK ( 0 << 28)
  68. #define MLX4_EQ_STATUS_WRITE_FAIL (10 << 28)
  69. #define MLX4_EQ_OWNER_SW ( 0 << 24)
  70. #define MLX4_EQ_OWNER_HW ( 1 << 24)
  71. #define MLX4_EQ_FLAG_EC ( 1 << 18)
  72. #define MLX4_EQ_FLAG_OI ( 1 << 17)
  73. #define MLX4_EQ_STATE_ARMED ( 9 << 8)
  74. #define MLX4_EQ_STATE_FIRED (10 << 8)
  75. #define MLX4_EQ_STATE_ALWAYS_ARMED (11 << 8)
  76. #define MLX4_ASYNC_EVENT_MASK ((1ull << MLX4_EVENT_TYPE_PATH_MIG) | \
  77. (1ull << MLX4_EVENT_TYPE_COMM_EST) | \
  78. (1ull << MLX4_EVENT_TYPE_SQ_DRAINED) | \
  79. (1ull << MLX4_EVENT_TYPE_CQ_ERROR) | \
  80. (1ull << MLX4_EVENT_TYPE_WQ_CATAS_ERROR) | \
  81. (1ull << MLX4_EVENT_TYPE_EEC_CATAS_ERROR) | \
  82. (1ull << MLX4_EVENT_TYPE_PATH_MIG_FAILED) | \
  83. (1ull << MLX4_EVENT_TYPE_WQ_INVAL_REQ_ERROR) | \
  84. (1ull << MLX4_EVENT_TYPE_WQ_ACCESS_ERROR) | \
  85. (1ull << MLX4_EVENT_TYPE_PORT_CHANGE) | \
  86. (1ull << MLX4_EVENT_TYPE_ECC_DETECT) | \
  87. (1ull << MLX4_EVENT_TYPE_SRQ_CATAS_ERROR) | \
  88. (1ull << MLX4_EVENT_TYPE_SRQ_QP_LAST_WQE) | \
  89. (1ull << MLX4_EVENT_TYPE_SRQ_LIMIT) | \
  90. (1ull << MLX4_EVENT_TYPE_CMD))
  91. struct mlx4_eqe {
  92. u8 reserved1;
  93. u8 type;
  94. u8 reserved2;
  95. u8 subtype;
  96. union {
  97. u32 raw[6];
  98. struct {
  99. __be32 cqn;
  100. } __attribute__((packed)) comp;
  101. struct {
  102. u16 reserved1;
  103. __be16 token;
  104. u32 reserved2;
  105. u8 reserved3[3];
  106. u8 status;
  107. __be64 out_param;
  108. } __attribute__((packed)) cmd;
  109. struct {
  110. __be32 qpn;
  111. } __attribute__((packed)) qp;
  112. struct {
  113. __be32 srqn;
  114. } __attribute__((packed)) srq;
  115. struct {
  116. __be32 cqn;
  117. u32 reserved1;
  118. u8 reserved2[3];
  119. u8 syndrome;
  120. } __attribute__((packed)) cq_err;
  121. struct {
  122. u32 reserved1[2];
  123. __be32 port;
  124. } __attribute__((packed)) port_change;
  125. } event;
  126. u8 reserved3[3];
  127. u8 owner;
  128. } __attribute__((packed));
  129. static void eq_set_ci(struct mlx4_eq *eq, int req_not)
  130. {
  131. __raw_writel((__force u32) cpu_to_be32((eq->cons_index & 0xffffff) |
  132. req_not << 31),
  133. eq->doorbell);
  134. /* We still want ordering, just not swabbing, so add a barrier */
  135. mb();
  136. }
  137. static struct mlx4_eqe *get_eqe(struct mlx4_eq *eq, u32 entry)
  138. {
  139. unsigned long off = (entry & (eq->nent - 1)) * MLX4_EQ_ENTRY_SIZE;
  140. return eq->page_list[off / PAGE_SIZE].buf + off % PAGE_SIZE;
  141. }
  142. static struct mlx4_eqe *next_eqe_sw(struct mlx4_eq *eq)
  143. {
  144. struct mlx4_eqe *eqe = get_eqe(eq, eq->cons_index);
  145. return !!(eqe->owner & 0x80) ^ !!(eq->cons_index & eq->nent) ? NULL : eqe;
  146. }
  147. static int mlx4_eq_int(struct mlx4_dev *dev, struct mlx4_eq *eq)
  148. {
  149. struct mlx4_eqe *eqe;
  150. int cqn;
  151. int eqes_found = 0;
  152. int set_ci = 0;
  153. while ((eqe = next_eqe_sw(eq))) {
  154. /*
  155. * Make sure we read EQ entry contents after we've
  156. * checked the ownership bit.
  157. */
  158. rmb();
  159. switch (eqe->type) {
  160. case MLX4_EVENT_TYPE_COMP:
  161. cqn = be32_to_cpu(eqe->event.comp.cqn) & 0xffffff;
  162. mlx4_cq_completion(dev, cqn);
  163. break;
  164. case MLX4_EVENT_TYPE_PATH_MIG:
  165. case MLX4_EVENT_TYPE_COMM_EST:
  166. case MLX4_EVENT_TYPE_SQ_DRAINED:
  167. case MLX4_EVENT_TYPE_SRQ_QP_LAST_WQE:
  168. case MLX4_EVENT_TYPE_WQ_CATAS_ERROR:
  169. case MLX4_EVENT_TYPE_PATH_MIG_FAILED:
  170. case MLX4_EVENT_TYPE_WQ_INVAL_REQ_ERROR:
  171. case MLX4_EVENT_TYPE_WQ_ACCESS_ERROR:
  172. mlx4_qp_event(dev, be32_to_cpu(eqe->event.qp.qpn) & 0xffffff,
  173. eqe->type);
  174. break;
  175. case MLX4_EVENT_TYPE_SRQ_LIMIT:
  176. case MLX4_EVENT_TYPE_SRQ_CATAS_ERROR:
  177. mlx4_srq_event(dev, be32_to_cpu(eqe->event.srq.srqn) & 0xffffff,
  178. eqe->type);
  179. break;
  180. case MLX4_EVENT_TYPE_CMD:
  181. mlx4_cmd_event(dev,
  182. be16_to_cpu(eqe->event.cmd.token),
  183. eqe->event.cmd.status,
  184. be64_to_cpu(eqe->event.cmd.out_param));
  185. break;
  186. case MLX4_EVENT_TYPE_PORT_CHANGE:
  187. mlx4_dispatch_event(dev, eqe->type, eqe->subtype,
  188. be32_to_cpu(eqe->event.port_change.port) >> 28);
  189. break;
  190. case MLX4_EVENT_TYPE_CQ_ERROR:
  191. mlx4_warn(dev, "CQ %s on CQN %06x\n",
  192. eqe->event.cq_err.syndrome == 1 ?
  193. "overrun" : "access violation",
  194. be32_to_cpu(eqe->event.cq_err.cqn) & 0xffffff);
  195. mlx4_cq_event(dev, be32_to_cpu(eqe->event.cq_err.cqn),
  196. eqe->type);
  197. break;
  198. case MLX4_EVENT_TYPE_EQ_OVERFLOW:
  199. mlx4_warn(dev, "EQ overrun on EQN %d\n", eq->eqn);
  200. break;
  201. case MLX4_EVENT_TYPE_EEC_CATAS_ERROR:
  202. case MLX4_EVENT_TYPE_ECC_DETECT:
  203. default:
  204. mlx4_warn(dev, "Unhandled event %02x(%02x) on EQ %d at index %u\n",
  205. eqe->type, eqe->subtype, eq->eqn, eq->cons_index);
  206. break;
  207. };
  208. ++eq->cons_index;
  209. eqes_found = 1;
  210. ++set_ci;
  211. /*
  212. * The HCA will think the queue has overflowed if we
  213. * don't tell it we've been processing events. We
  214. * create our EQs with MLX4_NUM_SPARE_EQE extra
  215. * entries, so we must update our consumer index at
  216. * least that often.
  217. */
  218. if (unlikely(set_ci >= MLX4_NUM_SPARE_EQE)) {
  219. /*
  220. * Conditional on hca_type is OK here because
  221. * this is a rare case, not the fast path.
  222. */
  223. eq_set_ci(eq, 0);
  224. set_ci = 0;
  225. }
  226. }
  227. eq_set_ci(eq, 1);
  228. return eqes_found;
  229. }
  230. static irqreturn_t mlx4_interrupt(int irq, void *dev_ptr)
  231. {
  232. struct mlx4_dev *dev = dev_ptr;
  233. struct mlx4_priv *priv = mlx4_priv(dev);
  234. int work = 0;
  235. int i;
  236. writel(priv->eq_table.clr_mask, priv->eq_table.clr_int);
  237. for (i = 0; i < MLX4_NUM_EQ; ++i)
  238. work |= mlx4_eq_int(dev, &priv->eq_table.eq[i]);
  239. return IRQ_RETVAL(work);
  240. }
  241. static irqreturn_t mlx4_msi_x_interrupt(int irq, void *eq_ptr)
  242. {
  243. struct mlx4_eq *eq = eq_ptr;
  244. struct mlx4_dev *dev = eq->dev;
  245. mlx4_eq_int(dev, eq);
  246. /* MSI-X vectors always belong to us */
  247. return IRQ_HANDLED;
  248. }
  249. static int mlx4_MAP_EQ(struct mlx4_dev *dev, u64 event_mask, int unmap,
  250. int eq_num)
  251. {
  252. return mlx4_cmd(dev, event_mask, (unmap << 31) | eq_num,
  253. 0, MLX4_CMD_MAP_EQ, MLX4_CMD_TIME_CLASS_B);
  254. }
  255. static int mlx4_SW2HW_EQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  256. int eq_num)
  257. {
  258. return mlx4_cmd(dev, mailbox->dma, eq_num, 0, MLX4_CMD_SW2HW_EQ,
  259. MLX4_CMD_TIME_CLASS_A);
  260. }
  261. static int mlx4_HW2SW_EQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  262. int eq_num)
  263. {
  264. return mlx4_cmd_box(dev, 0, mailbox->dma, eq_num, 0, MLX4_CMD_HW2SW_EQ,
  265. MLX4_CMD_TIME_CLASS_A);
  266. }
  267. static void __iomem *mlx4_get_eq_uar(struct mlx4_dev *dev, struct mlx4_eq *eq)
  268. {
  269. struct mlx4_priv *priv = mlx4_priv(dev);
  270. int index;
  271. index = eq->eqn / 4 - dev->caps.reserved_eqs / 4;
  272. if (!priv->eq_table.uar_map[index]) {
  273. priv->eq_table.uar_map[index] =
  274. ioremap(pci_resource_start(dev->pdev, 2) +
  275. ((eq->eqn / 4) << PAGE_SHIFT),
  276. PAGE_SIZE);
  277. if (!priv->eq_table.uar_map[index]) {
  278. mlx4_err(dev, "Couldn't map EQ doorbell for EQN 0x%06x\n",
  279. eq->eqn);
  280. return NULL;
  281. }
  282. }
  283. return priv->eq_table.uar_map[index] + 0x800 + 8 * (eq->eqn % 4);
  284. }
  285. static int mlx4_create_eq(struct mlx4_dev *dev, int nent,
  286. u8 intr, struct mlx4_eq *eq)
  287. {
  288. struct mlx4_priv *priv = mlx4_priv(dev);
  289. struct mlx4_cmd_mailbox *mailbox;
  290. struct mlx4_eq_context *eq_context;
  291. int npages;
  292. u64 *dma_list = NULL;
  293. dma_addr_t t;
  294. u64 mtt_addr;
  295. int err = -ENOMEM;
  296. int i;
  297. eq->dev = dev;
  298. eq->nent = roundup_pow_of_two(max(nent, 2));
  299. npages = PAGE_ALIGN(eq->nent * MLX4_EQ_ENTRY_SIZE) / PAGE_SIZE;
  300. eq->page_list = kmalloc(npages * sizeof *eq->page_list,
  301. GFP_KERNEL);
  302. if (!eq->page_list)
  303. goto err_out;
  304. for (i = 0; i < npages; ++i)
  305. eq->page_list[i].buf = NULL;
  306. dma_list = kmalloc(npages * sizeof *dma_list, GFP_KERNEL);
  307. if (!dma_list)
  308. goto err_out_free;
  309. mailbox = mlx4_alloc_cmd_mailbox(dev);
  310. if (IS_ERR(mailbox))
  311. goto err_out_free;
  312. eq_context = mailbox->buf;
  313. for (i = 0; i < npages; ++i) {
  314. eq->page_list[i].buf = dma_alloc_coherent(&dev->pdev->dev,
  315. PAGE_SIZE, &t, GFP_KERNEL);
  316. if (!eq->page_list[i].buf)
  317. goto err_out_free_pages;
  318. dma_list[i] = t;
  319. eq->page_list[i].map = t;
  320. memset(eq->page_list[i].buf, 0, PAGE_SIZE);
  321. }
  322. eq->eqn = mlx4_bitmap_alloc(&priv->eq_table.bitmap);
  323. if (eq->eqn == -1)
  324. goto err_out_free_pages;
  325. eq->doorbell = mlx4_get_eq_uar(dev, eq);
  326. if (!eq->doorbell) {
  327. err = -ENOMEM;
  328. goto err_out_free_eq;
  329. }
  330. err = mlx4_mtt_init(dev, npages, PAGE_SHIFT, &eq->mtt);
  331. if (err)
  332. goto err_out_free_eq;
  333. err = mlx4_write_mtt(dev, &eq->mtt, 0, npages, dma_list);
  334. if (err)
  335. goto err_out_free_mtt;
  336. memset(eq_context, 0, sizeof *eq_context);
  337. eq_context->flags = cpu_to_be32(MLX4_EQ_STATUS_OK |
  338. MLX4_EQ_STATE_ARMED);
  339. eq_context->log_eq_size = ilog2(eq->nent);
  340. eq_context->intr = intr;
  341. eq_context->log_page_size = PAGE_SHIFT - MLX4_ICM_PAGE_SHIFT;
  342. mtt_addr = mlx4_mtt_addr(dev, &eq->mtt);
  343. eq_context->mtt_base_addr_h = mtt_addr >> 32;
  344. eq_context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
  345. err = mlx4_SW2HW_EQ(dev, mailbox, eq->eqn);
  346. if (err) {
  347. mlx4_warn(dev, "SW2HW_EQ failed (%d)\n", err);
  348. goto err_out_free_mtt;
  349. }
  350. kfree(dma_list);
  351. mlx4_free_cmd_mailbox(dev, mailbox);
  352. eq->cons_index = 0;
  353. return err;
  354. err_out_free_mtt:
  355. mlx4_mtt_cleanup(dev, &eq->mtt);
  356. err_out_free_eq:
  357. mlx4_bitmap_free(&priv->eq_table.bitmap, eq->eqn);
  358. err_out_free_pages:
  359. for (i = 0; i < npages; ++i)
  360. if (eq->page_list[i].buf)
  361. dma_free_coherent(&dev->pdev->dev, PAGE_SIZE,
  362. eq->page_list[i].buf,
  363. eq->page_list[i].map);
  364. mlx4_free_cmd_mailbox(dev, mailbox);
  365. err_out_free:
  366. kfree(eq->page_list);
  367. kfree(dma_list);
  368. err_out:
  369. return err;
  370. }
  371. static void mlx4_free_eq(struct mlx4_dev *dev,
  372. struct mlx4_eq *eq)
  373. {
  374. struct mlx4_priv *priv = mlx4_priv(dev);
  375. struct mlx4_cmd_mailbox *mailbox;
  376. int err;
  377. int npages = PAGE_ALIGN(MLX4_EQ_ENTRY_SIZE * eq->nent) / PAGE_SIZE;
  378. int i;
  379. mailbox = mlx4_alloc_cmd_mailbox(dev);
  380. if (IS_ERR(mailbox))
  381. return;
  382. err = mlx4_HW2SW_EQ(dev, mailbox, eq->eqn);
  383. if (err)
  384. mlx4_warn(dev, "HW2SW_EQ failed (%d)\n", err);
  385. if (0) {
  386. mlx4_dbg(dev, "Dumping EQ context %02x:\n", eq->eqn);
  387. for (i = 0; i < sizeof (struct mlx4_eq_context) / 4; ++i) {
  388. if (i % 4 == 0)
  389. printk("[%02x] ", i * 4);
  390. printk(" %08x", be32_to_cpup(mailbox->buf + i * 4));
  391. if ((i + 1) % 4 == 0)
  392. printk("\n");
  393. }
  394. }
  395. mlx4_mtt_cleanup(dev, &eq->mtt);
  396. for (i = 0; i < npages; ++i)
  397. pci_free_consistent(dev->pdev, PAGE_SIZE,
  398. eq->page_list[i].buf,
  399. eq->page_list[i].map);
  400. kfree(eq->page_list);
  401. mlx4_bitmap_free(&priv->eq_table.bitmap, eq->eqn);
  402. mlx4_free_cmd_mailbox(dev, mailbox);
  403. }
  404. static void mlx4_free_irqs(struct mlx4_dev *dev)
  405. {
  406. struct mlx4_eq_table *eq_table = &mlx4_priv(dev)->eq_table;
  407. int i;
  408. if (eq_table->have_irq)
  409. free_irq(dev->pdev->irq, dev);
  410. for (i = 0; i < MLX4_NUM_EQ; ++i)
  411. if (eq_table->eq[i].have_irq)
  412. free_irq(eq_table->eq[i].irq, eq_table->eq + i);
  413. }
  414. static int mlx4_map_clr_int(struct mlx4_dev *dev)
  415. {
  416. struct mlx4_priv *priv = mlx4_priv(dev);
  417. priv->clr_base = ioremap(pci_resource_start(dev->pdev, priv->fw.clr_int_bar) +
  418. priv->fw.clr_int_base, MLX4_CLR_INT_SIZE);
  419. if (!priv->clr_base) {
  420. mlx4_err(dev, "Couldn't map interrupt clear register, aborting.\n");
  421. return -ENOMEM;
  422. }
  423. return 0;
  424. }
  425. static void mlx4_unmap_clr_int(struct mlx4_dev *dev)
  426. {
  427. struct mlx4_priv *priv = mlx4_priv(dev);
  428. iounmap(priv->clr_base);
  429. }
  430. int mlx4_map_eq_icm(struct mlx4_dev *dev, u64 icm_virt)
  431. {
  432. struct mlx4_priv *priv = mlx4_priv(dev);
  433. int ret;
  434. /*
  435. * We assume that mapping one page is enough for the whole EQ
  436. * context table. This is fine with all current HCAs, because
  437. * we only use 32 EQs and each EQ uses 64 bytes of context
  438. * memory, or 1 KB total.
  439. */
  440. priv->eq_table.icm_virt = icm_virt;
  441. priv->eq_table.icm_page = alloc_page(GFP_HIGHUSER);
  442. if (!priv->eq_table.icm_page)
  443. return -ENOMEM;
  444. priv->eq_table.icm_dma = pci_map_page(dev->pdev, priv->eq_table.icm_page, 0,
  445. PAGE_SIZE, PCI_DMA_BIDIRECTIONAL);
  446. if (pci_dma_mapping_error(priv->eq_table.icm_dma)) {
  447. __free_page(priv->eq_table.icm_page);
  448. return -ENOMEM;
  449. }
  450. ret = mlx4_MAP_ICM_page(dev, priv->eq_table.icm_dma, icm_virt);
  451. if (ret) {
  452. pci_unmap_page(dev->pdev, priv->eq_table.icm_dma, PAGE_SIZE,
  453. PCI_DMA_BIDIRECTIONAL);
  454. __free_page(priv->eq_table.icm_page);
  455. }
  456. return ret;
  457. }
  458. void mlx4_unmap_eq_icm(struct mlx4_dev *dev)
  459. {
  460. struct mlx4_priv *priv = mlx4_priv(dev);
  461. mlx4_UNMAP_ICM(dev, priv->eq_table.icm_virt, 1);
  462. pci_unmap_page(dev->pdev, priv->eq_table.icm_dma, PAGE_SIZE,
  463. PCI_DMA_BIDIRECTIONAL);
  464. __free_page(priv->eq_table.icm_page);
  465. }
  466. int mlx4_init_eq_table(struct mlx4_dev *dev)
  467. {
  468. struct mlx4_priv *priv = mlx4_priv(dev);
  469. int err;
  470. int i;
  471. err = mlx4_bitmap_init(&priv->eq_table.bitmap, dev->caps.num_eqs,
  472. dev->caps.num_eqs - 1, dev->caps.reserved_eqs);
  473. if (err)
  474. return err;
  475. for (i = 0; i < ARRAY_SIZE(priv->eq_table.uar_map); ++i)
  476. priv->eq_table.uar_map[i] = NULL;
  477. err = mlx4_map_clr_int(dev);
  478. if (err)
  479. goto err_out_free;
  480. priv->eq_table.clr_mask =
  481. swab32(1 << (priv->eq_table.inta_pin & 31));
  482. priv->eq_table.clr_int = priv->clr_base +
  483. (priv->eq_table.inta_pin < 32 ? 4 : 0);
  484. err = mlx4_create_eq(dev, dev->caps.num_cqs + MLX4_NUM_SPARE_EQE,
  485. (dev->flags & MLX4_FLAG_MSI_X) ? MLX4_EQ_COMP : 0,
  486. &priv->eq_table.eq[MLX4_EQ_COMP]);
  487. if (err)
  488. goto err_out_unmap;
  489. err = mlx4_create_eq(dev, MLX4_NUM_ASYNC_EQE + MLX4_NUM_SPARE_EQE,
  490. (dev->flags & MLX4_FLAG_MSI_X) ? MLX4_EQ_ASYNC : 0,
  491. &priv->eq_table.eq[MLX4_EQ_ASYNC]);
  492. if (err)
  493. goto err_out_comp;
  494. if (dev->flags & MLX4_FLAG_MSI_X) {
  495. static const char *eq_name[] = {
  496. [MLX4_EQ_COMP] = DRV_NAME " (comp)",
  497. [MLX4_EQ_ASYNC] = DRV_NAME " (async)"
  498. };
  499. for (i = 0; i < MLX4_NUM_EQ; ++i) {
  500. err = request_irq(priv->eq_table.eq[i].irq,
  501. mlx4_msi_x_interrupt,
  502. 0, eq_name[i], priv->eq_table.eq + i);
  503. if (err)
  504. goto err_out_async;
  505. priv->eq_table.eq[i].have_irq = 1;
  506. }
  507. } else {
  508. err = request_irq(dev->pdev->irq, mlx4_interrupt,
  509. IRQF_SHARED, DRV_NAME, dev);
  510. if (err)
  511. goto err_out_async;
  512. priv->eq_table.have_irq = 1;
  513. }
  514. err = mlx4_MAP_EQ(dev, MLX4_ASYNC_EVENT_MASK, 0,
  515. priv->eq_table.eq[MLX4_EQ_ASYNC].eqn);
  516. if (err)
  517. mlx4_warn(dev, "MAP_EQ for async EQ %d failed (%d)\n",
  518. priv->eq_table.eq[MLX4_EQ_ASYNC].eqn, err);
  519. for (i = 0; i < MLX4_NUM_EQ; ++i)
  520. eq_set_ci(&priv->eq_table.eq[i], 1);
  521. return 0;
  522. err_out_async:
  523. mlx4_free_eq(dev, &priv->eq_table.eq[MLX4_EQ_ASYNC]);
  524. err_out_comp:
  525. mlx4_free_eq(dev, &priv->eq_table.eq[MLX4_EQ_COMP]);
  526. err_out_unmap:
  527. mlx4_unmap_clr_int(dev);
  528. mlx4_free_irqs(dev);
  529. err_out_free:
  530. mlx4_bitmap_cleanup(&priv->eq_table.bitmap);
  531. return err;
  532. }
  533. void mlx4_cleanup_eq_table(struct mlx4_dev *dev)
  534. {
  535. struct mlx4_priv *priv = mlx4_priv(dev);
  536. int i;
  537. mlx4_MAP_EQ(dev, MLX4_ASYNC_EVENT_MASK, 1,
  538. priv->eq_table.eq[MLX4_EQ_ASYNC].eqn);
  539. mlx4_free_irqs(dev);
  540. for (i = 0; i < MLX4_NUM_EQ; ++i)
  541. mlx4_free_eq(dev, &priv->eq_table.eq[i]);
  542. mlx4_unmap_clr_int(dev);
  543. for (i = 0; i < ARRAY_SIZE(priv->eq_table.uar_map); ++i)
  544. if (priv->eq_table.uar_map[i])
  545. iounmap(priv->eq_table.uar_map[i]);
  546. mlx4_bitmap_cleanup(&priv->eq_table.bitmap);
  547. }