cq.c 29 KB

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