eq.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842
  1. /*
  2. * Copyright (c) 2005, 2006, 2007, 2008 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/interrupt.h>
  34. #include <linux/slab.h>
  35. #include <linux/mm.h>
  36. #include <linux/dma-mapping.h>
  37. #include <linux/mlx4/cmd.h>
  38. #include "mlx4.h"
  39. #include "fw.h"
  40. enum {
  41. MLX4_IRQNAME_SIZE = 32
  42. };
  43. enum {
  44. MLX4_NUM_ASYNC_EQE = 0x100,
  45. MLX4_NUM_SPARE_EQE = 0x80,
  46. MLX4_EQ_ENTRY_SIZE = 0x20
  47. };
  48. /*
  49. * Must be packed because start is 64 bits but only aligned to 32 bits.
  50. */
  51. struct mlx4_eq_context {
  52. __be32 flags;
  53. u16 reserved1[3];
  54. __be16 page_offset;
  55. u8 log_eq_size;
  56. u8 reserved2[4];
  57. u8 eq_period;
  58. u8 reserved3;
  59. u8 eq_max_count;
  60. u8 reserved4[3];
  61. u8 intr;
  62. u8 log_page_size;
  63. u8 reserved5[2];
  64. u8 mtt_base_addr_h;
  65. __be32 mtt_base_addr_l;
  66. u32 reserved6[2];
  67. __be32 consumer_index;
  68. __be32 producer_index;
  69. u32 reserved7[4];
  70. };
  71. #define MLX4_EQ_STATUS_OK ( 0 << 28)
  72. #define MLX4_EQ_STATUS_WRITE_FAIL (10 << 28)
  73. #define MLX4_EQ_OWNER_SW ( 0 << 24)
  74. #define MLX4_EQ_OWNER_HW ( 1 << 24)
  75. #define MLX4_EQ_FLAG_EC ( 1 << 18)
  76. #define MLX4_EQ_FLAG_OI ( 1 << 17)
  77. #define MLX4_EQ_STATE_ARMED ( 9 << 8)
  78. #define MLX4_EQ_STATE_FIRED (10 << 8)
  79. #define MLX4_EQ_STATE_ALWAYS_ARMED (11 << 8)
  80. #define MLX4_ASYNC_EVENT_MASK ((1ull << MLX4_EVENT_TYPE_PATH_MIG) | \
  81. (1ull << MLX4_EVENT_TYPE_COMM_EST) | \
  82. (1ull << MLX4_EVENT_TYPE_SQ_DRAINED) | \
  83. (1ull << MLX4_EVENT_TYPE_CQ_ERROR) | \
  84. (1ull << MLX4_EVENT_TYPE_WQ_CATAS_ERROR) | \
  85. (1ull << MLX4_EVENT_TYPE_EEC_CATAS_ERROR) | \
  86. (1ull << MLX4_EVENT_TYPE_PATH_MIG_FAILED) | \
  87. (1ull << MLX4_EVENT_TYPE_WQ_INVAL_REQ_ERROR) | \
  88. (1ull << MLX4_EVENT_TYPE_WQ_ACCESS_ERROR) | \
  89. (1ull << MLX4_EVENT_TYPE_PORT_CHANGE) | \
  90. (1ull << MLX4_EVENT_TYPE_ECC_DETECT) | \
  91. (1ull << MLX4_EVENT_TYPE_SRQ_CATAS_ERROR) | \
  92. (1ull << MLX4_EVENT_TYPE_SRQ_QP_LAST_WQE) | \
  93. (1ull << MLX4_EVENT_TYPE_SRQ_LIMIT) | \
  94. (1ull << MLX4_EVENT_TYPE_CMD))
  95. struct mlx4_eqe {
  96. u8 reserved1;
  97. u8 type;
  98. u8 reserved2;
  99. u8 subtype;
  100. union {
  101. u32 raw[6];
  102. struct {
  103. __be32 cqn;
  104. } __packed comp;
  105. struct {
  106. u16 reserved1;
  107. __be16 token;
  108. u32 reserved2;
  109. u8 reserved3[3];
  110. u8 status;
  111. __be64 out_param;
  112. } __packed cmd;
  113. struct {
  114. __be32 qpn;
  115. } __packed qp;
  116. struct {
  117. __be32 srqn;
  118. } __packed srq;
  119. struct {
  120. __be32 cqn;
  121. u32 reserved1;
  122. u8 reserved2[3];
  123. u8 syndrome;
  124. } __packed cq_err;
  125. struct {
  126. u32 reserved1[2];
  127. __be32 port;
  128. } __packed port_change;
  129. } event;
  130. u8 reserved3[3];
  131. u8 owner;
  132. } __packed;
  133. static void eq_set_ci(struct mlx4_eq *eq, int req_not)
  134. {
  135. __raw_writel((__force u32) cpu_to_be32((eq->cons_index & 0xffffff) |
  136. req_not << 31),
  137. eq->doorbell);
  138. /* We still want ordering, just not swabbing, so add a barrier */
  139. mb();
  140. }
  141. static struct mlx4_eqe *get_eqe(struct mlx4_eq *eq, u32 entry)
  142. {
  143. unsigned long off = (entry & (eq->nent - 1)) * MLX4_EQ_ENTRY_SIZE;
  144. return eq->page_list[off / PAGE_SIZE].buf + off % PAGE_SIZE;
  145. }
  146. static struct mlx4_eqe *next_eqe_sw(struct mlx4_eq *eq)
  147. {
  148. struct mlx4_eqe *eqe = get_eqe(eq, eq->cons_index);
  149. return !!(eqe->owner & 0x80) ^ !!(eq->cons_index & eq->nent) ? NULL : eqe;
  150. }
  151. static int mlx4_eq_int(struct mlx4_dev *dev, struct mlx4_eq *eq)
  152. {
  153. struct mlx4_eqe *eqe;
  154. int cqn;
  155. int eqes_found = 0;
  156. int set_ci = 0;
  157. int port;
  158. while ((eqe = next_eqe_sw(eq))) {
  159. /*
  160. * Make sure we read EQ entry contents after we've
  161. * checked the ownership bit.
  162. */
  163. rmb();
  164. switch (eqe->type) {
  165. case MLX4_EVENT_TYPE_COMP:
  166. cqn = be32_to_cpu(eqe->event.comp.cqn) & 0xffffff;
  167. mlx4_cq_completion(dev, cqn);
  168. break;
  169. case MLX4_EVENT_TYPE_PATH_MIG:
  170. case MLX4_EVENT_TYPE_COMM_EST:
  171. case MLX4_EVENT_TYPE_SQ_DRAINED:
  172. case MLX4_EVENT_TYPE_SRQ_QP_LAST_WQE:
  173. case MLX4_EVENT_TYPE_WQ_CATAS_ERROR:
  174. case MLX4_EVENT_TYPE_PATH_MIG_FAILED:
  175. case MLX4_EVENT_TYPE_WQ_INVAL_REQ_ERROR:
  176. case MLX4_EVENT_TYPE_WQ_ACCESS_ERROR:
  177. mlx4_qp_event(dev, be32_to_cpu(eqe->event.qp.qpn) & 0xffffff,
  178. eqe->type);
  179. break;
  180. case MLX4_EVENT_TYPE_SRQ_LIMIT:
  181. case MLX4_EVENT_TYPE_SRQ_CATAS_ERROR:
  182. mlx4_srq_event(dev, be32_to_cpu(eqe->event.srq.srqn) & 0xffffff,
  183. eqe->type);
  184. break;
  185. case MLX4_EVENT_TYPE_CMD:
  186. mlx4_cmd_event(dev,
  187. be16_to_cpu(eqe->event.cmd.token),
  188. eqe->event.cmd.status,
  189. be64_to_cpu(eqe->event.cmd.out_param));
  190. break;
  191. case MLX4_EVENT_TYPE_PORT_CHANGE:
  192. port = be32_to_cpu(eqe->event.port_change.port) >> 28;
  193. if (eqe->subtype == MLX4_PORT_CHANGE_SUBTYPE_DOWN) {
  194. mlx4_dispatch_event(dev, MLX4_DEV_EVENT_PORT_DOWN,
  195. port);
  196. mlx4_priv(dev)->sense.do_sense_port[port] = 1;
  197. } else {
  198. mlx4_dispatch_event(dev, MLX4_DEV_EVENT_PORT_UP,
  199. port);
  200. mlx4_priv(dev)->sense.do_sense_port[port] = 0;
  201. }
  202. break;
  203. case MLX4_EVENT_TYPE_CQ_ERROR:
  204. mlx4_warn(dev, "CQ %s on CQN %06x\n",
  205. eqe->event.cq_err.syndrome == 1 ?
  206. "overrun" : "access violation",
  207. be32_to_cpu(eqe->event.cq_err.cqn) & 0xffffff);
  208. mlx4_cq_event(dev, be32_to_cpu(eqe->event.cq_err.cqn),
  209. eqe->type);
  210. break;
  211. case MLX4_EVENT_TYPE_EQ_OVERFLOW:
  212. mlx4_warn(dev, "EQ overrun on EQN %d\n", eq->eqn);
  213. break;
  214. case MLX4_EVENT_TYPE_EEC_CATAS_ERROR:
  215. case MLX4_EVENT_TYPE_ECC_DETECT:
  216. default:
  217. mlx4_warn(dev, "Unhandled event %02x(%02x) on EQ %d at index %u\n",
  218. eqe->type, eqe->subtype, eq->eqn, eq->cons_index);
  219. break;
  220. }
  221. ++eq->cons_index;
  222. eqes_found = 1;
  223. ++set_ci;
  224. /*
  225. * The HCA will think the queue has overflowed if we
  226. * don't tell it we've been processing events. We
  227. * create our EQs with MLX4_NUM_SPARE_EQE extra
  228. * entries, so we must update our consumer index at
  229. * least that often.
  230. */
  231. if (unlikely(set_ci >= MLX4_NUM_SPARE_EQE)) {
  232. eq_set_ci(eq, 0);
  233. set_ci = 0;
  234. }
  235. }
  236. eq_set_ci(eq, 1);
  237. return eqes_found;
  238. }
  239. static irqreturn_t mlx4_interrupt(int irq, void *dev_ptr)
  240. {
  241. struct mlx4_dev *dev = dev_ptr;
  242. struct mlx4_priv *priv = mlx4_priv(dev);
  243. int work = 0;
  244. int i;
  245. writel(priv->eq_table.clr_mask, priv->eq_table.clr_int);
  246. for (i = 0; i < dev->caps.num_comp_vectors + 1; ++i)
  247. work |= mlx4_eq_int(dev, &priv->eq_table.eq[i]);
  248. return IRQ_RETVAL(work);
  249. }
  250. static irqreturn_t mlx4_msi_x_interrupt(int irq, void *eq_ptr)
  251. {
  252. struct mlx4_eq *eq = eq_ptr;
  253. struct mlx4_dev *dev = eq->dev;
  254. mlx4_eq_int(dev, eq);
  255. /* MSI-X vectors always belong to us */
  256. return IRQ_HANDLED;
  257. }
  258. static int mlx4_MAP_EQ(struct mlx4_dev *dev, u64 event_mask, int unmap,
  259. int eq_num)
  260. {
  261. return mlx4_cmd(dev, event_mask, (unmap << 31) | eq_num,
  262. 0, MLX4_CMD_MAP_EQ, MLX4_CMD_TIME_CLASS_B);
  263. }
  264. static int mlx4_SW2HW_EQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  265. int eq_num)
  266. {
  267. return mlx4_cmd(dev, mailbox->dma, eq_num, 0, MLX4_CMD_SW2HW_EQ,
  268. MLX4_CMD_TIME_CLASS_A);
  269. }
  270. static int mlx4_HW2SW_EQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  271. int eq_num)
  272. {
  273. return mlx4_cmd_box(dev, 0, mailbox->dma, eq_num, 0, MLX4_CMD_HW2SW_EQ,
  274. MLX4_CMD_TIME_CLASS_A);
  275. }
  276. static int mlx4_num_eq_uar(struct mlx4_dev *dev)
  277. {
  278. /*
  279. * Each UAR holds 4 EQ doorbells. To figure out how many UARs
  280. * we need to map, take the difference of highest index and
  281. * the lowest index we'll use and add 1.
  282. */
  283. return (dev->caps.num_comp_vectors + 1 + dev->caps.reserved_eqs +
  284. dev->caps.comp_pool)/4 - dev->caps.reserved_eqs/4 + 1;
  285. }
  286. static void __iomem *mlx4_get_eq_uar(struct mlx4_dev *dev, struct mlx4_eq *eq)
  287. {
  288. struct mlx4_priv *priv = mlx4_priv(dev);
  289. int index;
  290. index = eq->eqn / 4 - dev->caps.reserved_eqs / 4;
  291. if (!priv->eq_table.uar_map[index]) {
  292. priv->eq_table.uar_map[index] =
  293. ioremap(pci_resource_start(dev->pdev, 2) +
  294. ((eq->eqn / 4) << PAGE_SHIFT),
  295. PAGE_SIZE);
  296. if (!priv->eq_table.uar_map[index]) {
  297. mlx4_err(dev, "Couldn't map EQ doorbell for EQN 0x%06x\n",
  298. eq->eqn);
  299. return NULL;
  300. }
  301. }
  302. return priv->eq_table.uar_map[index] + 0x800 + 8 * (eq->eqn % 4);
  303. }
  304. static int mlx4_create_eq(struct mlx4_dev *dev, int nent,
  305. u8 intr, struct mlx4_eq *eq)
  306. {
  307. struct mlx4_priv *priv = mlx4_priv(dev);
  308. struct mlx4_cmd_mailbox *mailbox;
  309. struct mlx4_eq_context *eq_context;
  310. int npages;
  311. u64 *dma_list = NULL;
  312. dma_addr_t t;
  313. u64 mtt_addr;
  314. int err = -ENOMEM;
  315. int i;
  316. eq->dev = dev;
  317. eq->nent = roundup_pow_of_two(max(nent, 2));
  318. npages = PAGE_ALIGN(eq->nent * MLX4_EQ_ENTRY_SIZE) / PAGE_SIZE;
  319. eq->page_list = kmalloc(npages * sizeof *eq->page_list,
  320. GFP_KERNEL);
  321. if (!eq->page_list)
  322. goto err_out;
  323. for (i = 0; i < npages; ++i)
  324. eq->page_list[i].buf = NULL;
  325. dma_list = kmalloc(npages * sizeof *dma_list, GFP_KERNEL);
  326. if (!dma_list)
  327. goto err_out_free;
  328. mailbox = mlx4_alloc_cmd_mailbox(dev);
  329. if (IS_ERR(mailbox))
  330. goto err_out_free;
  331. eq_context = mailbox->buf;
  332. for (i = 0; i < npages; ++i) {
  333. eq->page_list[i].buf = dma_alloc_coherent(&dev->pdev->dev,
  334. PAGE_SIZE, &t, GFP_KERNEL);
  335. if (!eq->page_list[i].buf)
  336. goto err_out_free_pages;
  337. dma_list[i] = t;
  338. eq->page_list[i].map = t;
  339. memset(eq->page_list[i].buf, 0, PAGE_SIZE);
  340. }
  341. eq->eqn = mlx4_bitmap_alloc(&priv->eq_table.bitmap);
  342. if (eq->eqn == -1)
  343. goto err_out_free_pages;
  344. eq->doorbell = mlx4_get_eq_uar(dev, eq);
  345. if (!eq->doorbell) {
  346. err = -ENOMEM;
  347. goto err_out_free_eq;
  348. }
  349. err = mlx4_mtt_init(dev, npages, PAGE_SHIFT, &eq->mtt);
  350. if (err)
  351. goto err_out_free_eq;
  352. err = mlx4_write_mtt(dev, &eq->mtt, 0, npages, dma_list);
  353. if (err)
  354. goto err_out_free_mtt;
  355. memset(eq_context, 0, sizeof *eq_context);
  356. eq_context->flags = cpu_to_be32(MLX4_EQ_STATUS_OK |
  357. MLX4_EQ_STATE_ARMED);
  358. eq_context->log_eq_size = ilog2(eq->nent);
  359. eq_context->intr = intr;
  360. eq_context->log_page_size = PAGE_SHIFT - MLX4_ICM_PAGE_SHIFT;
  361. mtt_addr = mlx4_mtt_addr(dev, &eq->mtt);
  362. eq_context->mtt_base_addr_h = mtt_addr >> 32;
  363. eq_context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
  364. err = mlx4_SW2HW_EQ(dev, mailbox, eq->eqn);
  365. if (err) {
  366. mlx4_warn(dev, "SW2HW_EQ failed (%d)\n", err);
  367. goto err_out_free_mtt;
  368. }
  369. kfree(dma_list);
  370. mlx4_free_cmd_mailbox(dev, mailbox);
  371. eq->cons_index = 0;
  372. return err;
  373. err_out_free_mtt:
  374. mlx4_mtt_cleanup(dev, &eq->mtt);
  375. err_out_free_eq:
  376. mlx4_bitmap_free(&priv->eq_table.bitmap, eq->eqn);
  377. err_out_free_pages:
  378. for (i = 0; i < npages; ++i)
  379. if (eq->page_list[i].buf)
  380. dma_free_coherent(&dev->pdev->dev, PAGE_SIZE,
  381. eq->page_list[i].buf,
  382. eq->page_list[i].map);
  383. mlx4_free_cmd_mailbox(dev, mailbox);
  384. err_out_free:
  385. kfree(eq->page_list);
  386. kfree(dma_list);
  387. err_out:
  388. return err;
  389. }
  390. static void mlx4_free_eq(struct mlx4_dev *dev,
  391. struct mlx4_eq *eq)
  392. {
  393. struct mlx4_priv *priv = mlx4_priv(dev);
  394. struct mlx4_cmd_mailbox *mailbox;
  395. int err;
  396. int npages = PAGE_ALIGN(MLX4_EQ_ENTRY_SIZE * eq->nent) / PAGE_SIZE;
  397. int i;
  398. mailbox = mlx4_alloc_cmd_mailbox(dev);
  399. if (IS_ERR(mailbox))
  400. return;
  401. err = mlx4_HW2SW_EQ(dev, mailbox, eq->eqn);
  402. if (err)
  403. mlx4_warn(dev, "HW2SW_EQ failed (%d)\n", err);
  404. if (0) {
  405. mlx4_dbg(dev, "Dumping EQ context %02x:\n", eq->eqn);
  406. for (i = 0; i < sizeof (struct mlx4_eq_context) / 4; ++i) {
  407. if (i % 4 == 0)
  408. pr_cont("[%02x] ", i * 4);
  409. pr_cont(" %08x", be32_to_cpup(mailbox->buf + i * 4));
  410. if ((i + 1) % 4 == 0)
  411. pr_cont("\n");
  412. }
  413. }
  414. mlx4_mtt_cleanup(dev, &eq->mtt);
  415. for (i = 0; i < npages; ++i)
  416. pci_free_consistent(dev->pdev, PAGE_SIZE,
  417. eq->page_list[i].buf,
  418. eq->page_list[i].map);
  419. kfree(eq->page_list);
  420. mlx4_bitmap_free(&priv->eq_table.bitmap, eq->eqn);
  421. mlx4_free_cmd_mailbox(dev, mailbox);
  422. }
  423. static void mlx4_free_irqs(struct mlx4_dev *dev)
  424. {
  425. struct mlx4_eq_table *eq_table = &mlx4_priv(dev)->eq_table;
  426. struct mlx4_priv *priv = mlx4_priv(dev);
  427. int i, vec;
  428. if (eq_table->have_irq)
  429. free_irq(dev->pdev->irq, dev);
  430. for (i = 0; i < dev->caps.num_comp_vectors + 1; ++i)
  431. if (eq_table->eq[i].have_irq) {
  432. free_irq(eq_table->eq[i].irq, eq_table->eq + i);
  433. eq_table->eq[i].have_irq = 0;
  434. }
  435. for (i = 0; i < dev->caps.comp_pool; i++) {
  436. /*
  437. * Freeing the assigned irq's
  438. * all bits should be 0, but we need to validate
  439. */
  440. if (priv->msix_ctl.pool_bm & 1ULL << i) {
  441. /* NO need protecting*/
  442. vec = dev->caps.num_comp_vectors + 1 + i;
  443. free_irq(priv->eq_table.eq[vec].irq,
  444. &priv->eq_table.eq[vec]);
  445. }
  446. }
  447. kfree(eq_table->irq_names);
  448. }
  449. static int mlx4_map_clr_int(struct mlx4_dev *dev)
  450. {
  451. struct mlx4_priv *priv = mlx4_priv(dev);
  452. priv->clr_base = ioremap(pci_resource_start(dev->pdev, priv->fw.clr_int_bar) +
  453. priv->fw.clr_int_base, MLX4_CLR_INT_SIZE);
  454. if (!priv->clr_base) {
  455. mlx4_err(dev, "Couldn't map interrupt clear register, aborting.\n");
  456. return -ENOMEM;
  457. }
  458. return 0;
  459. }
  460. static void mlx4_unmap_clr_int(struct mlx4_dev *dev)
  461. {
  462. struct mlx4_priv *priv = mlx4_priv(dev);
  463. iounmap(priv->clr_base);
  464. }
  465. int mlx4_alloc_eq_table(struct mlx4_dev *dev)
  466. {
  467. struct mlx4_priv *priv = mlx4_priv(dev);
  468. priv->eq_table.eq = kcalloc(dev->caps.num_eqs - dev->caps.reserved_eqs,
  469. sizeof *priv->eq_table.eq, GFP_KERNEL);
  470. if (!priv->eq_table.eq)
  471. return -ENOMEM;
  472. return 0;
  473. }
  474. void mlx4_free_eq_table(struct mlx4_dev *dev)
  475. {
  476. kfree(mlx4_priv(dev)->eq_table.eq);
  477. }
  478. int mlx4_init_eq_table(struct mlx4_dev *dev)
  479. {
  480. struct mlx4_priv *priv = mlx4_priv(dev);
  481. int err;
  482. int i;
  483. priv->eq_table.uar_map = kcalloc(sizeof *priv->eq_table.uar_map,
  484. mlx4_num_eq_uar(dev), GFP_KERNEL);
  485. if (!priv->eq_table.uar_map) {
  486. err = -ENOMEM;
  487. goto err_out_free;
  488. }
  489. err = mlx4_bitmap_init(&priv->eq_table.bitmap, dev->caps.num_eqs,
  490. dev->caps.num_eqs - 1, dev->caps.reserved_eqs, 0);
  491. if (err)
  492. goto err_out_free;
  493. for (i = 0; i < mlx4_num_eq_uar(dev); ++i)
  494. priv->eq_table.uar_map[i] = NULL;
  495. err = mlx4_map_clr_int(dev);
  496. if (err)
  497. goto err_out_bitmap;
  498. priv->eq_table.clr_mask =
  499. swab32(1 << (priv->eq_table.inta_pin & 31));
  500. priv->eq_table.clr_int = priv->clr_base +
  501. (priv->eq_table.inta_pin < 32 ? 4 : 0);
  502. priv->eq_table.irq_names =
  503. kmalloc(MLX4_IRQNAME_SIZE * (dev->caps.num_comp_vectors + 1 +
  504. dev->caps.comp_pool),
  505. GFP_KERNEL);
  506. if (!priv->eq_table.irq_names) {
  507. err = -ENOMEM;
  508. goto err_out_bitmap;
  509. }
  510. for (i = 0; i < dev->caps.num_comp_vectors; ++i) {
  511. err = mlx4_create_eq(dev, dev->caps.num_cqs -
  512. dev->caps.reserved_cqs +
  513. MLX4_NUM_SPARE_EQE,
  514. (dev->flags & MLX4_FLAG_MSI_X) ? i : 0,
  515. &priv->eq_table.eq[i]);
  516. if (err) {
  517. --i;
  518. goto err_out_unmap;
  519. }
  520. }
  521. err = mlx4_create_eq(dev, MLX4_NUM_ASYNC_EQE + MLX4_NUM_SPARE_EQE,
  522. (dev->flags & MLX4_FLAG_MSI_X) ? dev->caps.num_comp_vectors : 0,
  523. &priv->eq_table.eq[dev->caps.num_comp_vectors]);
  524. if (err)
  525. goto err_out_comp;
  526. /*if additional completion vectors poolsize is 0 this loop will not run*/
  527. for (i = dev->caps.num_comp_vectors + 1;
  528. i < dev->caps.num_comp_vectors + dev->caps.comp_pool + 1; ++i) {
  529. err = mlx4_create_eq(dev, dev->caps.num_cqs -
  530. dev->caps.reserved_cqs +
  531. MLX4_NUM_SPARE_EQE,
  532. (dev->flags & MLX4_FLAG_MSI_X) ? i : 0,
  533. &priv->eq_table.eq[i]);
  534. if (err) {
  535. --i;
  536. goto err_out_unmap;
  537. }
  538. }
  539. if (dev->flags & MLX4_FLAG_MSI_X) {
  540. const char *eq_name;
  541. for (i = 0; i < dev->caps.num_comp_vectors + 1; ++i) {
  542. if (i < dev->caps.num_comp_vectors) {
  543. snprintf(priv->eq_table.irq_names +
  544. i * MLX4_IRQNAME_SIZE,
  545. MLX4_IRQNAME_SIZE,
  546. "mlx4-comp-%d@pci:%s", i,
  547. pci_name(dev->pdev));
  548. } else {
  549. snprintf(priv->eq_table.irq_names +
  550. i * MLX4_IRQNAME_SIZE,
  551. MLX4_IRQNAME_SIZE,
  552. "mlx4-async@pci:%s",
  553. pci_name(dev->pdev));
  554. }
  555. eq_name = priv->eq_table.irq_names +
  556. i * MLX4_IRQNAME_SIZE;
  557. err = request_irq(priv->eq_table.eq[i].irq,
  558. mlx4_msi_x_interrupt, 0, eq_name,
  559. priv->eq_table.eq + i);
  560. if (err)
  561. goto err_out_async;
  562. priv->eq_table.eq[i].have_irq = 1;
  563. }
  564. } else {
  565. snprintf(priv->eq_table.irq_names,
  566. MLX4_IRQNAME_SIZE,
  567. DRV_NAME "@pci:%s",
  568. pci_name(dev->pdev));
  569. err = request_irq(dev->pdev->irq, mlx4_interrupt,
  570. IRQF_SHARED, priv->eq_table.irq_names, dev);
  571. if (err)
  572. goto err_out_async;
  573. priv->eq_table.have_irq = 1;
  574. }
  575. err = mlx4_MAP_EQ(dev, MLX4_ASYNC_EVENT_MASK, 0,
  576. priv->eq_table.eq[dev->caps.num_comp_vectors].eqn);
  577. if (err)
  578. mlx4_warn(dev, "MAP_EQ for async EQ %d failed (%d)\n",
  579. priv->eq_table.eq[dev->caps.num_comp_vectors].eqn, err);
  580. for (i = 0; i < dev->caps.num_comp_vectors + 1; ++i)
  581. eq_set_ci(&priv->eq_table.eq[i], 1);
  582. return 0;
  583. err_out_async:
  584. mlx4_free_eq(dev, &priv->eq_table.eq[dev->caps.num_comp_vectors]);
  585. err_out_comp:
  586. i = dev->caps.num_comp_vectors - 1;
  587. err_out_unmap:
  588. while (i >= 0) {
  589. mlx4_free_eq(dev, &priv->eq_table.eq[i]);
  590. --i;
  591. }
  592. mlx4_unmap_clr_int(dev);
  593. mlx4_free_irqs(dev);
  594. err_out_bitmap:
  595. mlx4_bitmap_cleanup(&priv->eq_table.bitmap);
  596. err_out_free:
  597. kfree(priv->eq_table.uar_map);
  598. return err;
  599. }
  600. void mlx4_cleanup_eq_table(struct mlx4_dev *dev)
  601. {
  602. struct mlx4_priv *priv = mlx4_priv(dev);
  603. int i;
  604. mlx4_MAP_EQ(dev, MLX4_ASYNC_EVENT_MASK, 1,
  605. priv->eq_table.eq[dev->caps.num_comp_vectors].eqn);
  606. mlx4_free_irqs(dev);
  607. for (i = 0; i < dev->caps.num_comp_vectors + dev->caps.comp_pool + 1; ++i)
  608. mlx4_free_eq(dev, &priv->eq_table.eq[i]);
  609. mlx4_unmap_clr_int(dev);
  610. for (i = 0; i < mlx4_num_eq_uar(dev); ++i)
  611. if (priv->eq_table.uar_map[i])
  612. iounmap(priv->eq_table.uar_map[i]);
  613. mlx4_bitmap_cleanup(&priv->eq_table.bitmap);
  614. kfree(priv->eq_table.uar_map);
  615. }
  616. /* A test that verifies that we can accept interrupts on all
  617. * the irq vectors of the device.
  618. * Interrupts are checked using the NOP command.
  619. */
  620. int mlx4_test_interrupts(struct mlx4_dev *dev)
  621. {
  622. struct mlx4_priv *priv = mlx4_priv(dev);
  623. int i;
  624. int err;
  625. err = mlx4_NOP(dev);
  626. /* When not in MSI_X, there is only one irq to check */
  627. if (!(dev->flags & MLX4_FLAG_MSI_X))
  628. return err;
  629. /* A loop over all completion vectors, for each vector we will check
  630. * whether it works by mapping command completions to that vector
  631. * and performing a NOP command
  632. */
  633. for(i = 0; !err && (i < dev->caps.num_comp_vectors); ++i) {
  634. /* Temporary use polling for command completions */
  635. mlx4_cmd_use_polling(dev);
  636. /* Map the new eq to handle all asyncronous events */
  637. err = mlx4_MAP_EQ(dev, MLX4_ASYNC_EVENT_MASK, 0,
  638. priv->eq_table.eq[i].eqn);
  639. if (err) {
  640. mlx4_warn(dev, "Failed mapping eq for interrupt test\n");
  641. mlx4_cmd_use_events(dev);
  642. break;
  643. }
  644. /* Go back to using events */
  645. mlx4_cmd_use_events(dev);
  646. err = mlx4_NOP(dev);
  647. }
  648. /* Return to default */
  649. mlx4_MAP_EQ(dev, MLX4_ASYNC_EVENT_MASK, 0,
  650. priv->eq_table.eq[dev->caps.num_comp_vectors].eqn);
  651. return err;
  652. }
  653. EXPORT_SYMBOL(mlx4_test_interrupts);
  654. int mlx4_assign_eq(struct mlx4_dev *dev, char* name, int * vector)
  655. {
  656. struct mlx4_priv *priv = mlx4_priv(dev);
  657. int vec = 0, err = 0, i;
  658. spin_lock(&priv->msix_ctl.pool_lock);
  659. for (i = 0; !vec && i < dev->caps.comp_pool; i++) {
  660. if (~priv->msix_ctl.pool_bm & 1ULL << i) {
  661. priv->msix_ctl.pool_bm |= 1ULL << i;
  662. vec = dev->caps.num_comp_vectors + 1 + i;
  663. snprintf(priv->eq_table.irq_names +
  664. vec * MLX4_IRQNAME_SIZE,
  665. MLX4_IRQNAME_SIZE, "%s", name);
  666. err = request_irq(priv->eq_table.eq[vec].irq,
  667. mlx4_msi_x_interrupt, 0,
  668. &priv->eq_table.irq_names[vec<<5],
  669. priv->eq_table.eq + vec);
  670. if (err) {
  671. /*zero out bit by fliping it*/
  672. priv->msix_ctl.pool_bm ^= 1 << i;
  673. vec = 0;
  674. continue;
  675. /*we dont want to break here*/
  676. }
  677. eq_set_ci(&priv->eq_table.eq[vec], 1);
  678. }
  679. }
  680. spin_unlock(&priv->msix_ctl.pool_lock);
  681. if (vec) {
  682. *vector = vec;
  683. } else {
  684. *vector = 0;
  685. err = (i == dev->caps.comp_pool) ? -ENOSPC : err;
  686. }
  687. return err;
  688. }
  689. EXPORT_SYMBOL(mlx4_assign_eq);
  690. void mlx4_release_eq(struct mlx4_dev *dev, int vec)
  691. {
  692. struct mlx4_priv *priv = mlx4_priv(dev);
  693. /*bm index*/
  694. int i = vec - dev->caps.num_comp_vectors - 1;
  695. if (likely(i >= 0)) {
  696. /*sanity check , making sure were not trying to free irq's
  697. Belonging to a legacy EQ*/
  698. spin_lock(&priv->msix_ctl.pool_lock);
  699. if (priv->msix_ctl.pool_bm & 1ULL << i) {
  700. free_irq(priv->eq_table.eq[vec].irq,
  701. &priv->eq_table.eq[vec]);
  702. priv->msix_ctl.pool_bm &= ~(1ULL << i);
  703. }
  704. spin_unlock(&priv->msix_ctl.pool_lock);
  705. }
  706. }
  707. EXPORT_SYMBOL(mlx4_release_eq);