cq.c 27 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114
  1. /*
  2. * Copyright (c) 2013, Mellanox Technologies inc. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. */
  32. #include <linux/kref.h>
  33. #include <rdma/ib_umem.h>
  34. #include "mlx5_ib.h"
  35. #include "user.h"
  36. static void mlx5_ib_cq_comp(struct mlx5_core_cq *cq)
  37. {
  38. struct ib_cq *ibcq = &to_mibcq(cq)->ibcq;
  39. ibcq->comp_handler(ibcq, ibcq->cq_context);
  40. }
  41. static void mlx5_ib_cq_event(struct mlx5_core_cq *mcq, enum mlx5_event type)
  42. {
  43. struct mlx5_ib_cq *cq = container_of(mcq, struct mlx5_ib_cq, mcq);
  44. struct mlx5_ib_dev *dev = to_mdev(cq->ibcq.device);
  45. struct ib_cq *ibcq = &cq->ibcq;
  46. struct ib_event event;
  47. if (type != MLX5_EVENT_TYPE_CQ_ERROR) {
  48. mlx5_ib_warn(dev, "Unexpected event type %d on CQ %06x\n",
  49. type, mcq->cqn);
  50. return;
  51. }
  52. if (ibcq->event_handler) {
  53. event.device = &dev->ib_dev;
  54. event.event = IB_EVENT_CQ_ERR;
  55. event.element.cq = ibcq;
  56. ibcq->event_handler(&event, ibcq->cq_context);
  57. }
  58. }
  59. static void *get_cqe_from_buf(struct mlx5_ib_cq_buf *buf, int n, int size)
  60. {
  61. return mlx5_buf_offset(&buf->buf, n * size);
  62. }
  63. static void *get_cqe(struct mlx5_ib_cq *cq, int n)
  64. {
  65. return get_cqe_from_buf(&cq->buf, n, cq->mcq.cqe_sz);
  66. }
  67. static u8 sw_ownership_bit(int n, int nent)
  68. {
  69. return (n & nent) ? 1 : 0;
  70. }
  71. static void *get_sw_cqe(struct mlx5_ib_cq *cq, int n)
  72. {
  73. void *cqe = get_cqe(cq, n & cq->ibcq.cqe);
  74. struct mlx5_cqe64 *cqe64;
  75. cqe64 = (cq->mcq.cqe_sz == 64) ? cqe : cqe + 64;
  76. if (likely((cqe64->op_own) >> 4 != MLX5_CQE_INVALID) &&
  77. !((cqe64->op_own & MLX5_CQE_OWNER_MASK) ^ !!(n & (cq->ibcq.cqe + 1)))) {
  78. return cqe;
  79. } else {
  80. return NULL;
  81. }
  82. }
  83. static void *next_cqe_sw(struct mlx5_ib_cq *cq)
  84. {
  85. return get_sw_cqe(cq, cq->mcq.cons_index);
  86. }
  87. static enum ib_wc_opcode get_umr_comp(struct mlx5_ib_wq *wq, int idx)
  88. {
  89. switch (wq->wr_data[idx]) {
  90. case MLX5_IB_WR_UMR:
  91. return 0;
  92. case IB_WR_LOCAL_INV:
  93. return IB_WC_LOCAL_INV;
  94. case IB_WR_FAST_REG_MR:
  95. return IB_WC_FAST_REG_MR;
  96. default:
  97. pr_warn("unknown completion status\n");
  98. return 0;
  99. }
  100. }
  101. static void handle_good_req(struct ib_wc *wc, struct mlx5_cqe64 *cqe,
  102. struct mlx5_ib_wq *wq, int idx)
  103. {
  104. wc->wc_flags = 0;
  105. switch (be32_to_cpu(cqe->sop_drop_qpn) >> 24) {
  106. case MLX5_OPCODE_RDMA_WRITE_IMM:
  107. wc->wc_flags |= IB_WC_WITH_IMM;
  108. case MLX5_OPCODE_RDMA_WRITE:
  109. wc->opcode = IB_WC_RDMA_WRITE;
  110. break;
  111. case MLX5_OPCODE_SEND_IMM:
  112. wc->wc_flags |= IB_WC_WITH_IMM;
  113. case MLX5_OPCODE_SEND:
  114. case MLX5_OPCODE_SEND_INVAL:
  115. wc->opcode = IB_WC_SEND;
  116. break;
  117. case MLX5_OPCODE_RDMA_READ:
  118. wc->opcode = IB_WC_RDMA_READ;
  119. wc->byte_len = be32_to_cpu(cqe->byte_cnt);
  120. break;
  121. case MLX5_OPCODE_ATOMIC_CS:
  122. wc->opcode = IB_WC_COMP_SWAP;
  123. wc->byte_len = 8;
  124. break;
  125. case MLX5_OPCODE_ATOMIC_FA:
  126. wc->opcode = IB_WC_FETCH_ADD;
  127. wc->byte_len = 8;
  128. break;
  129. case MLX5_OPCODE_ATOMIC_MASKED_CS:
  130. wc->opcode = IB_WC_MASKED_COMP_SWAP;
  131. wc->byte_len = 8;
  132. break;
  133. case MLX5_OPCODE_ATOMIC_MASKED_FA:
  134. wc->opcode = IB_WC_MASKED_FETCH_ADD;
  135. wc->byte_len = 8;
  136. break;
  137. case MLX5_OPCODE_BIND_MW:
  138. wc->opcode = IB_WC_BIND_MW;
  139. break;
  140. case MLX5_OPCODE_UMR:
  141. wc->opcode = get_umr_comp(wq, idx);
  142. break;
  143. }
  144. }
  145. enum {
  146. MLX5_GRH_IN_BUFFER = 1,
  147. MLX5_GRH_IN_CQE = 2,
  148. };
  149. static void handle_responder(struct ib_wc *wc, struct mlx5_cqe64 *cqe,
  150. struct mlx5_ib_qp *qp)
  151. {
  152. struct mlx5_ib_dev *dev = to_mdev(qp->ibqp.device);
  153. struct mlx5_ib_srq *srq;
  154. struct mlx5_ib_wq *wq;
  155. u16 wqe_ctr;
  156. u8 g;
  157. if (qp->ibqp.srq || qp->ibqp.xrcd) {
  158. struct mlx5_core_srq *msrq = NULL;
  159. if (qp->ibqp.xrcd) {
  160. msrq = mlx5_core_get_srq(&dev->mdev,
  161. be32_to_cpu(cqe->srqn));
  162. srq = to_mibsrq(msrq);
  163. } else {
  164. srq = to_msrq(qp->ibqp.srq);
  165. }
  166. if (srq) {
  167. wqe_ctr = be16_to_cpu(cqe->wqe_counter);
  168. wc->wr_id = srq->wrid[wqe_ctr];
  169. mlx5_ib_free_srq_wqe(srq, wqe_ctr);
  170. if (msrq && atomic_dec_and_test(&msrq->refcount))
  171. complete(&msrq->free);
  172. }
  173. } else {
  174. wq = &qp->rq;
  175. wc->wr_id = wq->wrid[wq->tail & (wq->wqe_cnt - 1)];
  176. ++wq->tail;
  177. }
  178. wc->byte_len = be32_to_cpu(cqe->byte_cnt);
  179. switch (cqe->op_own >> 4) {
  180. case MLX5_CQE_RESP_WR_IMM:
  181. wc->opcode = IB_WC_RECV_RDMA_WITH_IMM;
  182. wc->wc_flags = IB_WC_WITH_IMM;
  183. wc->ex.imm_data = cqe->imm_inval_pkey;
  184. break;
  185. case MLX5_CQE_RESP_SEND:
  186. wc->opcode = IB_WC_RECV;
  187. wc->wc_flags = 0;
  188. break;
  189. case MLX5_CQE_RESP_SEND_IMM:
  190. wc->opcode = IB_WC_RECV;
  191. wc->wc_flags = IB_WC_WITH_IMM;
  192. wc->ex.imm_data = cqe->imm_inval_pkey;
  193. break;
  194. case MLX5_CQE_RESP_SEND_INV:
  195. wc->opcode = IB_WC_RECV;
  196. wc->wc_flags = IB_WC_WITH_INVALIDATE;
  197. wc->ex.invalidate_rkey = be32_to_cpu(cqe->imm_inval_pkey);
  198. break;
  199. }
  200. wc->slid = be16_to_cpu(cqe->slid);
  201. wc->sl = (be32_to_cpu(cqe->flags_rqpn) >> 24) & 0xf;
  202. wc->src_qp = be32_to_cpu(cqe->flags_rqpn) & 0xffffff;
  203. wc->dlid_path_bits = cqe->ml_path;
  204. g = (be32_to_cpu(cqe->flags_rqpn) >> 28) & 3;
  205. wc->wc_flags |= g ? IB_WC_GRH : 0;
  206. wc->pkey_index = be32_to_cpu(cqe->imm_inval_pkey) & 0xffff;
  207. }
  208. static void dump_cqe(struct mlx5_ib_dev *dev, struct mlx5_err_cqe *cqe)
  209. {
  210. __be32 *p = (__be32 *)cqe;
  211. int i;
  212. mlx5_ib_warn(dev, "dump error cqe\n");
  213. for (i = 0; i < sizeof(*cqe) / 16; i++, p += 4)
  214. pr_info("%08x %08x %08x %08x\n", be32_to_cpu(p[0]),
  215. be32_to_cpu(p[1]), be32_to_cpu(p[2]),
  216. be32_to_cpu(p[3]));
  217. }
  218. static void mlx5_handle_error_cqe(struct mlx5_ib_dev *dev,
  219. struct mlx5_err_cqe *cqe,
  220. struct ib_wc *wc)
  221. {
  222. int dump = 1;
  223. switch (cqe->syndrome) {
  224. case MLX5_CQE_SYNDROME_LOCAL_LENGTH_ERR:
  225. wc->status = IB_WC_LOC_LEN_ERR;
  226. break;
  227. case MLX5_CQE_SYNDROME_LOCAL_QP_OP_ERR:
  228. wc->status = IB_WC_LOC_QP_OP_ERR;
  229. break;
  230. case MLX5_CQE_SYNDROME_LOCAL_PROT_ERR:
  231. wc->status = IB_WC_LOC_PROT_ERR;
  232. break;
  233. case MLX5_CQE_SYNDROME_WR_FLUSH_ERR:
  234. dump = 0;
  235. wc->status = IB_WC_WR_FLUSH_ERR;
  236. break;
  237. case MLX5_CQE_SYNDROME_MW_BIND_ERR:
  238. wc->status = IB_WC_MW_BIND_ERR;
  239. break;
  240. case MLX5_CQE_SYNDROME_BAD_RESP_ERR:
  241. wc->status = IB_WC_BAD_RESP_ERR;
  242. break;
  243. case MLX5_CQE_SYNDROME_LOCAL_ACCESS_ERR:
  244. wc->status = IB_WC_LOC_ACCESS_ERR;
  245. break;
  246. case MLX5_CQE_SYNDROME_REMOTE_INVAL_REQ_ERR:
  247. wc->status = IB_WC_REM_INV_REQ_ERR;
  248. break;
  249. case MLX5_CQE_SYNDROME_REMOTE_ACCESS_ERR:
  250. wc->status = IB_WC_REM_ACCESS_ERR;
  251. break;
  252. case MLX5_CQE_SYNDROME_REMOTE_OP_ERR:
  253. wc->status = IB_WC_REM_OP_ERR;
  254. break;
  255. case MLX5_CQE_SYNDROME_TRANSPORT_RETRY_EXC_ERR:
  256. wc->status = IB_WC_RETRY_EXC_ERR;
  257. dump = 0;
  258. break;
  259. case MLX5_CQE_SYNDROME_RNR_RETRY_EXC_ERR:
  260. wc->status = IB_WC_RNR_RETRY_EXC_ERR;
  261. dump = 0;
  262. break;
  263. case MLX5_CQE_SYNDROME_REMOTE_ABORTED_ERR:
  264. wc->status = IB_WC_REM_ABORT_ERR;
  265. break;
  266. default:
  267. wc->status = IB_WC_GENERAL_ERR;
  268. break;
  269. }
  270. wc->vendor_err = cqe->vendor_err_synd;
  271. if (dump)
  272. dump_cqe(dev, cqe);
  273. }
  274. static int is_atomic_response(struct mlx5_ib_qp *qp, uint16_t idx)
  275. {
  276. /* TBD: waiting decision
  277. */
  278. return 0;
  279. }
  280. static void *mlx5_get_atomic_laddr(struct mlx5_ib_qp *qp, uint16_t idx)
  281. {
  282. struct mlx5_wqe_data_seg *dpseg;
  283. void *addr;
  284. dpseg = mlx5_get_send_wqe(qp, idx) + sizeof(struct mlx5_wqe_ctrl_seg) +
  285. sizeof(struct mlx5_wqe_raddr_seg) +
  286. sizeof(struct mlx5_wqe_atomic_seg);
  287. addr = (void *)(unsigned long)be64_to_cpu(dpseg->addr);
  288. return addr;
  289. }
  290. static void handle_atomic(struct mlx5_ib_qp *qp, struct mlx5_cqe64 *cqe64,
  291. uint16_t idx)
  292. {
  293. void *addr;
  294. int byte_count;
  295. int i;
  296. if (!is_atomic_response(qp, idx))
  297. return;
  298. byte_count = be32_to_cpu(cqe64->byte_cnt);
  299. addr = mlx5_get_atomic_laddr(qp, idx);
  300. if (byte_count == 4) {
  301. *(uint32_t *)addr = be32_to_cpu(*((__be32 *)addr));
  302. } else {
  303. for (i = 0; i < byte_count; i += 8) {
  304. *(uint64_t *)addr = be64_to_cpu(*((__be64 *)addr));
  305. addr += 8;
  306. }
  307. }
  308. return;
  309. }
  310. static void handle_atomics(struct mlx5_ib_qp *qp, struct mlx5_cqe64 *cqe64,
  311. u16 tail, u16 head)
  312. {
  313. int idx;
  314. do {
  315. idx = tail & (qp->sq.wqe_cnt - 1);
  316. handle_atomic(qp, cqe64, idx);
  317. if (idx == head)
  318. break;
  319. tail = qp->sq.w_list[idx].next;
  320. } while (1);
  321. tail = qp->sq.w_list[idx].next;
  322. qp->sq.last_poll = tail;
  323. }
  324. static void free_cq_buf(struct mlx5_ib_dev *dev, struct mlx5_ib_cq_buf *buf)
  325. {
  326. mlx5_buf_free(&dev->mdev, &buf->buf);
  327. }
  328. static int mlx5_poll_one(struct mlx5_ib_cq *cq,
  329. struct mlx5_ib_qp **cur_qp,
  330. struct ib_wc *wc)
  331. {
  332. struct mlx5_ib_dev *dev = to_mdev(cq->ibcq.device);
  333. struct mlx5_err_cqe *err_cqe;
  334. struct mlx5_cqe64 *cqe64;
  335. struct mlx5_core_qp *mqp;
  336. struct mlx5_ib_wq *wq;
  337. uint8_t opcode;
  338. uint32_t qpn;
  339. u16 wqe_ctr;
  340. void *cqe;
  341. int idx;
  342. repoll:
  343. cqe = next_cqe_sw(cq);
  344. if (!cqe)
  345. return -EAGAIN;
  346. cqe64 = (cq->mcq.cqe_sz == 64) ? cqe : cqe + 64;
  347. ++cq->mcq.cons_index;
  348. /* Make sure we read CQ entry contents after we've checked the
  349. * ownership bit.
  350. */
  351. rmb();
  352. opcode = cqe64->op_own >> 4;
  353. if (unlikely(opcode == MLX5_CQE_RESIZE_CQ)) {
  354. if (likely(cq->resize_buf)) {
  355. free_cq_buf(dev, &cq->buf);
  356. cq->buf = *cq->resize_buf;
  357. kfree(cq->resize_buf);
  358. cq->resize_buf = NULL;
  359. goto repoll;
  360. } else {
  361. mlx5_ib_warn(dev, "unexpected resize cqe\n");
  362. }
  363. }
  364. qpn = ntohl(cqe64->sop_drop_qpn) & 0xffffff;
  365. if (!*cur_qp || (qpn != (*cur_qp)->ibqp.qp_num)) {
  366. /* We do not have to take the QP table lock here,
  367. * because CQs will be locked while QPs are removed
  368. * from the table.
  369. */
  370. mqp = __mlx5_qp_lookup(&dev->mdev, qpn);
  371. if (unlikely(!mqp)) {
  372. mlx5_ib_warn(dev, "CQE@CQ %06x for unknown QPN %6x\n",
  373. cq->mcq.cqn, qpn);
  374. return -EINVAL;
  375. }
  376. *cur_qp = to_mibqp(mqp);
  377. }
  378. wc->qp = &(*cur_qp)->ibqp;
  379. switch (opcode) {
  380. case MLX5_CQE_REQ:
  381. wq = &(*cur_qp)->sq;
  382. wqe_ctr = be16_to_cpu(cqe64->wqe_counter);
  383. idx = wqe_ctr & (wq->wqe_cnt - 1);
  384. handle_good_req(wc, cqe64, wq, idx);
  385. handle_atomics(*cur_qp, cqe64, wq->last_poll, idx);
  386. wc->wr_id = wq->wrid[idx];
  387. wq->tail = wq->wqe_head[idx] + 1;
  388. wc->status = IB_WC_SUCCESS;
  389. break;
  390. case MLX5_CQE_RESP_WR_IMM:
  391. case MLX5_CQE_RESP_SEND:
  392. case MLX5_CQE_RESP_SEND_IMM:
  393. case MLX5_CQE_RESP_SEND_INV:
  394. handle_responder(wc, cqe64, *cur_qp);
  395. wc->status = IB_WC_SUCCESS;
  396. break;
  397. case MLX5_CQE_RESIZE_CQ:
  398. break;
  399. case MLX5_CQE_REQ_ERR:
  400. case MLX5_CQE_RESP_ERR:
  401. err_cqe = (struct mlx5_err_cqe *)cqe64;
  402. mlx5_handle_error_cqe(dev, err_cqe, wc);
  403. mlx5_ib_dbg(dev, "%s error cqe on cqn 0x%x:\n",
  404. opcode == MLX5_CQE_REQ_ERR ?
  405. "Requestor" : "Responder", cq->mcq.cqn);
  406. mlx5_ib_dbg(dev, "syndrome 0x%x, vendor syndrome 0x%x\n",
  407. err_cqe->syndrome, err_cqe->vendor_err_synd);
  408. if (opcode == MLX5_CQE_REQ_ERR) {
  409. wq = &(*cur_qp)->sq;
  410. wqe_ctr = be16_to_cpu(cqe64->wqe_counter);
  411. idx = wqe_ctr & (wq->wqe_cnt - 1);
  412. wc->wr_id = wq->wrid[idx];
  413. wq->tail = wq->wqe_head[idx] + 1;
  414. } else {
  415. struct mlx5_ib_srq *srq;
  416. if ((*cur_qp)->ibqp.srq) {
  417. srq = to_msrq((*cur_qp)->ibqp.srq);
  418. wqe_ctr = be16_to_cpu(cqe64->wqe_counter);
  419. wc->wr_id = srq->wrid[wqe_ctr];
  420. mlx5_ib_free_srq_wqe(srq, wqe_ctr);
  421. } else {
  422. wq = &(*cur_qp)->rq;
  423. wc->wr_id = wq->wrid[wq->tail & (wq->wqe_cnt - 1)];
  424. ++wq->tail;
  425. }
  426. }
  427. break;
  428. }
  429. return 0;
  430. }
  431. int mlx5_ib_poll_cq(struct ib_cq *ibcq, int num_entries, struct ib_wc *wc)
  432. {
  433. struct mlx5_ib_cq *cq = to_mcq(ibcq);
  434. struct mlx5_ib_qp *cur_qp = NULL;
  435. unsigned long flags;
  436. int npolled;
  437. int err = 0;
  438. spin_lock_irqsave(&cq->lock, flags);
  439. for (npolled = 0; npolled < num_entries; npolled++) {
  440. err = mlx5_poll_one(cq, &cur_qp, wc + npolled);
  441. if (err)
  442. break;
  443. }
  444. if (npolled)
  445. mlx5_cq_set_ci(&cq->mcq);
  446. spin_unlock_irqrestore(&cq->lock, flags);
  447. if (err == 0 || err == -EAGAIN)
  448. return npolled;
  449. else
  450. return err;
  451. }
  452. int mlx5_ib_arm_cq(struct ib_cq *ibcq, enum ib_cq_notify_flags flags)
  453. {
  454. mlx5_cq_arm(&to_mcq(ibcq)->mcq,
  455. (flags & IB_CQ_SOLICITED_MASK) == IB_CQ_SOLICITED ?
  456. MLX5_CQ_DB_REQ_NOT_SOL : MLX5_CQ_DB_REQ_NOT,
  457. to_mdev(ibcq->device)->mdev.priv.uuari.uars[0].map,
  458. MLX5_GET_DOORBELL_LOCK(&to_mdev(ibcq->device)->mdev.priv.cq_uar_lock));
  459. return 0;
  460. }
  461. static int alloc_cq_buf(struct mlx5_ib_dev *dev, struct mlx5_ib_cq_buf *buf,
  462. int nent, int cqe_size)
  463. {
  464. int err;
  465. err = mlx5_buf_alloc(&dev->mdev, nent * cqe_size,
  466. PAGE_SIZE * 2, &buf->buf);
  467. if (err)
  468. return err;
  469. buf->cqe_size = cqe_size;
  470. buf->nent = nent;
  471. return 0;
  472. }
  473. static int create_cq_user(struct mlx5_ib_dev *dev, struct ib_udata *udata,
  474. struct ib_ucontext *context, struct mlx5_ib_cq *cq,
  475. int entries, struct mlx5_create_cq_mbox_in **cqb,
  476. int *cqe_size, int *index, int *inlen)
  477. {
  478. struct mlx5_ib_create_cq ucmd;
  479. int page_shift;
  480. int npages;
  481. int ncont;
  482. int err;
  483. if (ib_copy_from_udata(&ucmd, udata, sizeof(ucmd)))
  484. return -EFAULT;
  485. if (ucmd.cqe_size != 64 && ucmd.cqe_size != 128)
  486. return -EINVAL;
  487. *cqe_size = ucmd.cqe_size;
  488. cq->buf.umem = ib_umem_get(context, ucmd.buf_addr,
  489. entries * ucmd.cqe_size,
  490. IB_ACCESS_LOCAL_WRITE, 1);
  491. if (IS_ERR(cq->buf.umem)) {
  492. err = PTR_ERR(cq->buf.umem);
  493. return err;
  494. }
  495. err = mlx5_ib_db_map_user(to_mucontext(context), ucmd.db_addr,
  496. &cq->db);
  497. if (err)
  498. goto err_umem;
  499. mlx5_ib_cont_pages(cq->buf.umem, ucmd.buf_addr, &npages, &page_shift,
  500. &ncont, NULL);
  501. mlx5_ib_dbg(dev, "addr 0x%llx, size %u, npages %d, page_shift %d, ncont %d\n",
  502. ucmd.buf_addr, entries * ucmd.cqe_size, npages, page_shift, ncont);
  503. *inlen = sizeof(**cqb) + sizeof(*(*cqb)->pas) * ncont;
  504. *cqb = mlx5_vzalloc(*inlen);
  505. if (!*cqb) {
  506. err = -ENOMEM;
  507. goto err_db;
  508. }
  509. mlx5_ib_populate_pas(dev, cq->buf.umem, page_shift, (*cqb)->pas, 0);
  510. (*cqb)->ctx.log_pg_sz = page_shift - MLX5_ADAPTER_PAGE_SHIFT;
  511. *index = to_mucontext(context)->uuari.uars[0].index;
  512. return 0;
  513. err_db:
  514. mlx5_ib_db_unmap_user(to_mucontext(context), &cq->db);
  515. err_umem:
  516. ib_umem_release(cq->buf.umem);
  517. return err;
  518. }
  519. static void destroy_cq_user(struct mlx5_ib_cq *cq, struct ib_ucontext *context)
  520. {
  521. mlx5_ib_db_unmap_user(to_mucontext(context), &cq->db);
  522. ib_umem_release(cq->buf.umem);
  523. }
  524. static void init_cq_buf(struct mlx5_ib_cq *cq, struct mlx5_ib_cq_buf *buf)
  525. {
  526. int i;
  527. void *cqe;
  528. struct mlx5_cqe64 *cqe64;
  529. for (i = 0; i < buf->nent; i++) {
  530. cqe = get_cqe_from_buf(buf, i, buf->cqe_size);
  531. cqe64 = buf->cqe_size == 64 ? cqe : cqe + 64;
  532. cqe64->op_own = MLX5_CQE_INVALID << 4;
  533. }
  534. }
  535. static int create_cq_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq,
  536. int entries, int cqe_size,
  537. struct mlx5_create_cq_mbox_in **cqb,
  538. int *index, int *inlen)
  539. {
  540. int err;
  541. err = mlx5_db_alloc(&dev->mdev, &cq->db);
  542. if (err)
  543. return err;
  544. cq->mcq.set_ci_db = cq->db.db;
  545. cq->mcq.arm_db = cq->db.db + 1;
  546. *cq->mcq.set_ci_db = 0;
  547. *cq->mcq.arm_db = 0;
  548. cq->mcq.cqe_sz = cqe_size;
  549. err = alloc_cq_buf(dev, &cq->buf, entries, cqe_size);
  550. if (err)
  551. goto err_db;
  552. init_cq_buf(cq, &cq->buf);
  553. *inlen = sizeof(**cqb) + sizeof(*(*cqb)->pas) * cq->buf.buf.npages;
  554. *cqb = mlx5_vzalloc(*inlen);
  555. if (!*cqb) {
  556. err = -ENOMEM;
  557. goto err_buf;
  558. }
  559. mlx5_fill_page_array(&cq->buf.buf, (*cqb)->pas);
  560. (*cqb)->ctx.log_pg_sz = cq->buf.buf.page_shift - MLX5_ADAPTER_PAGE_SHIFT;
  561. *index = dev->mdev.priv.uuari.uars[0].index;
  562. return 0;
  563. err_buf:
  564. free_cq_buf(dev, &cq->buf);
  565. err_db:
  566. mlx5_db_free(&dev->mdev, &cq->db);
  567. return err;
  568. }
  569. static void destroy_cq_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq)
  570. {
  571. free_cq_buf(dev, &cq->buf);
  572. mlx5_db_free(&dev->mdev, &cq->db);
  573. }
  574. struct ib_cq *mlx5_ib_create_cq(struct ib_device *ibdev, int entries,
  575. int vector, struct ib_ucontext *context,
  576. struct ib_udata *udata)
  577. {
  578. struct mlx5_create_cq_mbox_in *cqb = NULL;
  579. struct mlx5_ib_dev *dev = to_mdev(ibdev);
  580. struct mlx5_ib_cq *cq;
  581. int uninitialized_var(index);
  582. int uninitialized_var(inlen);
  583. int cqe_size;
  584. int irqn;
  585. int eqn;
  586. int err;
  587. if (entries < 0)
  588. return ERR_PTR(-EINVAL);
  589. entries = roundup_pow_of_two(entries + 1);
  590. if (entries > dev->mdev.caps.max_cqes)
  591. return ERR_PTR(-EINVAL);
  592. cq = kzalloc(sizeof(*cq), GFP_KERNEL);
  593. if (!cq)
  594. return ERR_PTR(-ENOMEM);
  595. cq->ibcq.cqe = entries - 1;
  596. mutex_init(&cq->resize_mutex);
  597. spin_lock_init(&cq->lock);
  598. cq->resize_buf = NULL;
  599. cq->resize_umem = NULL;
  600. if (context) {
  601. err = create_cq_user(dev, udata, context, cq, entries,
  602. &cqb, &cqe_size, &index, &inlen);
  603. if (err)
  604. goto err_create;
  605. } else {
  606. /* for now choose 64 bytes till we have a proper interface */
  607. cqe_size = 64;
  608. err = create_cq_kernel(dev, cq, entries, cqe_size, &cqb,
  609. &index, &inlen);
  610. if (err)
  611. goto err_create;
  612. }
  613. cq->cqe_size = cqe_size;
  614. cqb->ctx.cqe_sz_flags = cqe_sz_to_mlx_sz(cqe_size) << 5;
  615. cqb->ctx.log_sz_usr_page = cpu_to_be32((ilog2(entries) << 24) | index);
  616. err = mlx5_vector2eqn(dev, vector, &eqn, &irqn);
  617. if (err)
  618. goto err_cqb;
  619. cqb->ctx.c_eqn = cpu_to_be16(eqn);
  620. cqb->ctx.db_record_addr = cpu_to_be64(cq->db.dma);
  621. err = mlx5_core_create_cq(&dev->mdev, &cq->mcq, cqb, inlen);
  622. if (err)
  623. goto err_cqb;
  624. mlx5_ib_dbg(dev, "cqn 0x%x\n", cq->mcq.cqn);
  625. cq->mcq.irqn = irqn;
  626. cq->mcq.comp = mlx5_ib_cq_comp;
  627. cq->mcq.event = mlx5_ib_cq_event;
  628. if (context)
  629. if (ib_copy_to_udata(udata, &cq->mcq.cqn, sizeof(__u32))) {
  630. err = -EFAULT;
  631. goto err_cmd;
  632. }
  633. mlx5_vfree(cqb);
  634. return &cq->ibcq;
  635. err_cmd:
  636. mlx5_core_destroy_cq(&dev->mdev, &cq->mcq);
  637. err_cqb:
  638. mlx5_vfree(cqb);
  639. if (context)
  640. destroy_cq_user(cq, context);
  641. else
  642. destroy_cq_kernel(dev, cq);
  643. err_create:
  644. kfree(cq);
  645. return ERR_PTR(err);
  646. }
  647. int mlx5_ib_destroy_cq(struct ib_cq *cq)
  648. {
  649. struct mlx5_ib_dev *dev = to_mdev(cq->device);
  650. struct mlx5_ib_cq *mcq = to_mcq(cq);
  651. struct ib_ucontext *context = NULL;
  652. if (cq->uobject)
  653. context = cq->uobject->context;
  654. mlx5_core_destroy_cq(&dev->mdev, &mcq->mcq);
  655. if (context)
  656. destroy_cq_user(mcq, context);
  657. else
  658. destroy_cq_kernel(dev, mcq);
  659. kfree(mcq);
  660. return 0;
  661. }
  662. static int is_equal_rsn(struct mlx5_cqe64 *cqe64, u32 rsn)
  663. {
  664. return rsn == (ntohl(cqe64->sop_drop_qpn) & 0xffffff);
  665. }
  666. void __mlx5_ib_cq_clean(struct mlx5_ib_cq *cq, u32 rsn, struct mlx5_ib_srq *srq)
  667. {
  668. struct mlx5_cqe64 *cqe64, *dest64;
  669. void *cqe, *dest;
  670. u32 prod_index;
  671. int nfreed = 0;
  672. u8 owner_bit;
  673. if (!cq)
  674. return;
  675. /* First we need to find the current producer index, so we
  676. * know where to start cleaning from. It doesn't matter if HW
  677. * adds new entries after this loop -- the QP we're worried
  678. * about is already in RESET, so the new entries won't come
  679. * from our QP and therefore don't need to be checked.
  680. */
  681. for (prod_index = cq->mcq.cons_index; get_sw_cqe(cq, prod_index); prod_index++)
  682. if (prod_index == cq->mcq.cons_index + cq->ibcq.cqe)
  683. break;
  684. /* Now sweep backwards through the CQ, removing CQ entries
  685. * that match our QP by copying older entries on top of them.
  686. */
  687. while ((int) --prod_index - (int) cq->mcq.cons_index >= 0) {
  688. cqe = get_cqe(cq, prod_index & cq->ibcq.cqe);
  689. cqe64 = (cq->mcq.cqe_sz == 64) ? cqe : cqe + 64;
  690. if (is_equal_rsn(cqe64, rsn)) {
  691. if (srq && (ntohl(cqe64->srqn) & 0xffffff))
  692. mlx5_ib_free_srq_wqe(srq, be16_to_cpu(cqe64->wqe_counter));
  693. ++nfreed;
  694. } else if (nfreed) {
  695. dest = get_cqe(cq, (prod_index + nfreed) & cq->ibcq.cqe);
  696. dest64 = (cq->mcq.cqe_sz == 64) ? dest : dest + 64;
  697. owner_bit = dest64->op_own & MLX5_CQE_OWNER_MASK;
  698. memcpy(dest, cqe, cq->mcq.cqe_sz);
  699. dest64->op_own = owner_bit |
  700. (dest64->op_own & ~MLX5_CQE_OWNER_MASK);
  701. }
  702. }
  703. if (nfreed) {
  704. cq->mcq.cons_index += nfreed;
  705. /* Make sure update of buffer contents is done before
  706. * updating consumer index.
  707. */
  708. wmb();
  709. mlx5_cq_set_ci(&cq->mcq);
  710. }
  711. }
  712. void mlx5_ib_cq_clean(struct mlx5_ib_cq *cq, u32 qpn, struct mlx5_ib_srq *srq)
  713. {
  714. if (!cq)
  715. return;
  716. spin_lock_irq(&cq->lock);
  717. __mlx5_ib_cq_clean(cq, qpn, srq);
  718. spin_unlock_irq(&cq->lock);
  719. }
  720. int mlx5_ib_modify_cq(struct ib_cq *cq, u16 cq_count, u16 cq_period)
  721. {
  722. struct mlx5_modify_cq_mbox_in *in;
  723. struct mlx5_ib_dev *dev = to_mdev(cq->device);
  724. struct mlx5_ib_cq *mcq = to_mcq(cq);
  725. int err;
  726. u32 fsel;
  727. if (!(dev->mdev.caps.flags & MLX5_DEV_CAP_FLAG_CQ_MODER))
  728. return -ENOSYS;
  729. in = kzalloc(sizeof(*in), GFP_KERNEL);
  730. if (!in)
  731. return -ENOMEM;
  732. in->cqn = cpu_to_be32(mcq->mcq.cqn);
  733. fsel = (MLX5_CQ_MODIFY_PERIOD | MLX5_CQ_MODIFY_COUNT);
  734. in->ctx.cq_period = cpu_to_be16(cq_period);
  735. in->ctx.cq_max_count = cpu_to_be16(cq_count);
  736. in->field_select = cpu_to_be32(fsel);
  737. err = mlx5_core_modify_cq(&dev->mdev, &mcq->mcq, in, sizeof(*in));
  738. kfree(in);
  739. if (err)
  740. mlx5_ib_warn(dev, "modify cq 0x%x failed\n", mcq->mcq.cqn);
  741. return err;
  742. }
  743. static int resize_user(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq,
  744. int entries, struct ib_udata *udata, int *npas,
  745. int *page_shift, int *cqe_size)
  746. {
  747. struct mlx5_ib_resize_cq ucmd;
  748. struct ib_umem *umem;
  749. int err;
  750. int npages;
  751. struct ib_ucontext *context = cq->buf.umem->context;
  752. err = ib_copy_from_udata(&ucmd, udata, sizeof(ucmd));
  753. if (err)
  754. return err;
  755. if (ucmd.reserved0 || ucmd.reserved1)
  756. return -EINVAL;
  757. umem = ib_umem_get(context, ucmd.buf_addr, entries * ucmd.cqe_size,
  758. IB_ACCESS_LOCAL_WRITE, 1);
  759. if (IS_ERR(umem)) {
  760. err = PTR_ERR(umem);
  761. return err;
  762. }
  763. mlx5_ib_cont_pages(umem, ucmd.buf_addr, &npages, page_shift,
  764. npas, NULL);
  765. cq->resize_umem = umem;
  766. *cqe_size = ucmd.cqe_size;
  767. return 0;
  768. }
  769. static void un_resize_user(struct mlx5_ib_cq *cq)
  770. {
  771. ib_umem_release(cq->resize_umem);
  772. }
  773. static int resize_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq,
  774. int entries, int cqe_size)
  775. {
  776. int err;
  777. cq->resize_buf = kzalloc(sizeof(*cq->resize_buf), GFP_KERNEL);
  778. if (!cq->resize_buf)
  779. return -ENOMEM;
  780. err = alloc_cq_buf(dev, cq->resize_buf, entries, cqe_size);
  781. if (err)
  782. goto ex;
  783. init_cq_buf(cq, cq->resize_buf);
  784. return 0;
  785. ex:
  786. kfree(cq->resize_buf);
  787. return err;
  788. }
  789. static void un_resize_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq)
  790. {
  791. free_cq_buf(dev, cq->resize_buf);
  792. cq->resize_buf = NULL;
  793. }
  794. static int copy_resize_cqes(struct mlx5_ib_cq *cq)
  795. {
  796. struct mlx5_ib_dev *dev = to_mdev(cq->ibcq.device);
  797. struct mlx5_cqe64 *scqe64;
  798. struct mlx5_cqe64 *dcqe64;
  799. void *start_cqe;
  800. void *scqe;
  801. void *dcqe;
  802. int ssize;
  803. int dsize;
  804. int i;
  805. u8 sw_own;
  806. ssize = cq->buf.cqe_size;
  807. dsize = cq->resize_buf->cqe_size;
  808. if (ssize != dsize) {
  809. mlx5_ib_warn(dev, "resize from different cqe size is not supported\n");
  810. return -EINVAL;
  811. }
  812. i = cq->mcq.cons_index;
  813. scqe = get_sw_cqe(cq, i);
  814. scqe64 = ssize == 64 ? scqe : scqe + 64;
  815. start_cqe = scqe;
  816. if (!scqe) {
  817. mlx5_ib_warn(dev, "expected cqe in sw ownership\n");
  818. return -EINVAL;
  819. }
  820. while ((scqe64->op_own >> 4) != MLX5_CQE_RESIZE_CQ) {
  821. dcqe = get_cqe_from_buf(cq->resize_buf,
  822. (i + 1) & (cq->resize_buf->nent),
  823. dsize);
  824. dcqe64 = dsize == 64 ? dcqe : dcqe + 64;
  825. sw_own = sw_ownership_bit(i + 1, cq->resize_buf->nent);
  826. memcpy(dcqe, scqe, dsize);
  827. dcqe64->op_own = (dcqe64->op_own & ~MLX5_CQE_OWNER_MASK) | sw_own;
  828. ++i;
  829. scqe = get_sw_cqe(cq, i);
  830. scqe64 = ssize == 64 ? scqe : scqe + 64;
  831. if (!scqe) {
  832. mlx5_ib_warn(dev, "expected cqe in sw ownership\n");
  833. return -EINVAL;
  834. }
  835. if (scqe == start_cqe) {
  836. pr_warn("resize CQ failed to get resize CQE, CQN 0x%x\n",
  837. cq->mcq.cqn);
  838. return -ENOMEM;
  839. }
  840. }
  841. ++cq->mcq.cons_index;
  842. return 0;
  843. }
  844. int mlx5_ib_resize_cq(struct ib_cq *ibcq, int entries, struct ib_udata *udata)
  845. {
  846. struct mlx5_ib_dev *dev = to_mdev(ibcq->device);
  847. struct mlx5_ib_cq *cq = to_mcq(ibcq);
  848. struct mlx5_modify_cq_mbox_in *in;
  849. int err;
  850. int npas;
  851. int page_shift;
  852. int inlen;
  853. int uninitialized_var(cqe_size);
  854. unsigned long flags;
  855. if (!(dev->mdev.caps.flags & MLX5_DEV_CAP_FLAG_RESIZE_CQ)) {
  856. pr_info("Firmware does not support resize CQ\n");
  857. return -ENOSYS;
  858. }
  859. if (entries < 1)
  860. return -EINVAL;
  861. entries = roundup_pow_of_two(entries + 1);
  862. if (entries > dev->mdev.caps.max_cqes + 1)
  863. return -EINVAL;
  864. if (entries == ibcq->cqe + 1)
  865. return 0;
  866. mutex_lock(&cq->resize_mutex);
  867. if (udata) {
  868. err = resize_user(dev, cq, entries, udata, &npas, &page_shift,
  869. &cqe_size);
  870. } else {
  871. cqe_size = 64;
  872. err = resize_kernel(dev, cq, entries, cqe_size);
  873. if (!err) {
  874. npas = cq->resize_buf->buf.npages;
  875. page_shift = cq->resize_buf->buf.page_shift;
  876. }
  877. }
  878. if (err)
  879. goto ex;
  880. inlen = sizeof(*in) + npas * sizeof(in->pas[0]);
  881. in = mlx5_vzalloc(inlen);
  882. if (!in) {
  883. err = -ENOMEM;
  884. goto ex_resize;
  885. }
  886. if (udata)
  887. mlx5_ib_populate_pas(dev, cq->resize_umem, page_shift,
  888. in->pas, 0);
  889. else
  890. mlx5_fill_page_array(&cq->resize_buf->buf, in->pas);
  891. in->field_select = cpu_to_be32(MLX5_MODIFY_CQ_MASK_LOG_SIZE |
  892. MLX5_MODIFY_CQ_MASK_PG_OFFSET |
  893. MLX5_MODIFY_CQ_MASK_PG_SIZE);
  894. in->ctx.log_pg_sz = page_shift - MLX5_ADAPTER_PAGE_SHIFT;
  895. in->ctx.cqe_sz_flags = cqe_sz_to_mlx_sz(cqe_size) << 5;
  896. in->ctx.page_offset = 0;
  897. in->ctx.log_sz_usr_page = cpu_to_be32(ilog2(entries) << 24);
  898. in->hdr.opmod = cpu_to_be16(MLX5_CQ_OPMOD_RESIZE);
  899. in->cqn = cpu_to_be32(cq->mcq.cqn);
  900. err = mlx5_core_modify_cq(&dev->mdev, &cq->mcq, in, inlen);
  901. if (err)
  902. goto ex_alloc;
  903. if (udata) {
  904. cq->ibcq.cqe = entries - 1;
  905. ib_umem_release(cq->buf.umem);
  906. cq->buf.umem = cq->resize_umem;
  907. cq->resize_umem = NULL;
  908. } else {
  909. struct mlx5_ib_cq_buf tbuf;
  910. int resized = 0;
  911. spin_lock_irqsave(&cq->lock, flags);
  912. if (cq->resize_buf) {
  913. err = copy_resize_cqes(cq);
  914. if (!err) {
  915. tbuf = cq->buf;
  916. cq->buf = *cq->resize_buf;
  917. kfree(cq->resize_buf);
  918. cq->resize_buf = NULL;
  919. resized = 1;
  920. }
  921. }
  922. cq->ibcq.cqe = entries - 1;
  923. spin_unlock_irqrestore(&cq->lock, flags);
  924. if (resized)
  925. free_cq_buf(dev, &tbuf);
  926. }
  927. mutex_unlock(&cq->resize_mutex);
  928. mlx5_vfree(in);
  929. return 0;
  930. ex_alloc:
  931. mlx5_vfree(in);
  932. ex_resize:
  933. if (udata)
  934. un_resize_user(cq);
  935. else
  936. un_resize_kernel(dev, cq);
  937. ex:
  938. mutex_unlock(&cq->resize_mutex);
  939. return err;
  940. }
  941. int mlx5_ib_get_cqe_size(struct mlx5_ib_dev *dev, struct ib_cq *ibcq)
  942. {
  943. struct mlx5_ib_cq *cq;
  944. if (!ibcq)
  945. return 128;
  946. cq = to_mcq(ibcq);
  947. return cq->cqe_size;
  948. }