cq.c 33 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387
  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 <rdma/ib_cache.h>
  36. #include "mlx5_ib.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_REG_MR:
  96. return IB_WC_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_UMR:
  139. wc->opcode = get_umr_comp(wq, idx);
  140. break;
  141. }
  142. }
  143. enum {
  144. MLX5_GRH_IN_BUFFER = 1,
  145. MLX5_GRH_IN_CQE = 2,
  146. };
  147. static void handle_responder(struct ib_wc *wc, struct mlx5_cqe64 *cqe,
  148. struct mlx5_ib_qp *qp)
  149. {
  150. enum rdma_link_layer ll = rdma_port_get_link_layer(qp->ibqp.device, 1);
  151. struct mlx5_ib_dev *dev = to_mdev(qp->ibqp.device);
  152. struct mlx5_ib_srq *srq;
  153. struct mlx5_ib_wq *wq;
  154. u16 wqe_ctr;
  155. u8 g;
  156. if (qp->ibqp.srq || qp->ibqp.xrcd) {
  157. struct mlx5_core_srq *msrq = NULL;
  158. if (qp->ibqp.xrcd) {
  159. msrq = mlx5_core_get_srq(dev->mdev,
  160. be32_to_cpu(cqe->srqn));
  161. srq = to_mibsrq(msrq);
  162. } else {
  163. srq = to_msrq(qp->ibqp.srq);
  164. }
  165. if (srq) {
  166. wqe_ctr = be16_to_cpu(cqe->wqe_counter);
  167. wc->wr_id = srq->wrid[wqe_ctr];
  168. mlx5_ib_free_srq_wqe(srq, wqe_ctr);
  169. if (msrq && atomic_dec_and_test(&msrq->refcount))
  170. complete(&msrq->free);
  171. }
  172. } else {
  173. wq = &qp->rq;
  174. wc->wr_id = wq->wrid[wq->tail & (wq->wqe_cnt - 1)];
  175. ++wq->tail;
  176. }
  177. wc->byte_len = be32_to_cpu(cqe->byte_cnt);
  178. switch (cqe->op_own >> 4) {
  179. case MLX5_CQE_RESP_WR_IMM:
  180. wc->opcode = IB_WC_RECV_RDMA_WITH_IMM;
  181. wc->wc_flags = IB_WC_WITH_IMM;
  182. wc->ex.imm_data = cqe->imm_inval_pkey;
  183. break;
  184. case MLX5_CQE_RESP_SEND:
  185. wc->opcode = IB_WC_RECV;
  186. wc->wc_flags = IB_WC_IP_CSUM_OK;
  187. if (unlikely(!((cqe->hds_ip_ext & CQE_L3_OK) &&
  188. (cqe->hds_ip_ext & CQE_L4_OK))))
  189. wc->wc_flags = 0;
  190. break;
  191. case MLX5_CQE_RESP_SEND_IMM:
  192. wc->opcode = IB_WC_RECV;
  193. wc->wc_flags = IB_WC_WITH_IMM;
  194. wc->ex.imm_data = cqe->imm_inval_pkey;
  195. break;
  196. case MLX5_CQE_RESP_SEND_INV:
  197. wc->opcode = IB_WC_RECV;
  198. wc->wc_flags = IB_WC_WITH_INVALIDATE;
  199. wc->ex.invalidate_rkey = be32_to_cpu(cqe->imm_inval_pkey);
  200. break;
  201. }
  202. wc->slid = be16_to_cpu(cqe->slid);
  203. wc->sl = (be32_to_cpu(cqe->flags_rqpn) >> 24) & 0xf;
  204. wc->src_qp = be32_to_cpu(cqe->flags_rqpn) & 0xffffff;
  205. wc->dlid_path_bits = cqe->ml_path;
  206. g = (be32_to_cpu(cqe->flags_rqpn) >> 28) & 3;
  207. wc->wc_flags |= g ? IB_WC_GRH : 0;
  208. if (unlikely(is_qp1(qp->ibqp.qp_type))) {
  209. u16 pkey = be32_to_cpu(cqe->imm_inval_pkey) & 0xffff;
  210. ib_find_cached_pkey(&dev->ib_dev, qp->port, pkey,
  211. &wc->pkey_index);
  212. } else {
  213. wc->pkey_index = 0;
  214. }
  215. if (ll != IB_LINK_LAYER_ETHERNET)
  216. return;
  217. switch (wc->sl & 0x3) {
  218. case MLX5_CQE_ROCE_L3_HEADER_TYPE_GRH:
  219. wc->network_hdr_type = RDMA_NETWORK_IB;
  220. break;
  221. case MLX5_CQE_ROCE_L3_HEADER_TYPE_IPV6:
  222. wc->network_hdr_type = RDMA_NETWORK_IPV6;
  223. break;
  224. case MLX5_CQE_ROCE_L3_HEADER_TYPE_IPV4:
  225. wc->network_hdr_type = RDMA_NETWORK_IPV4;
  226. break;
  227. }
  228. wc->wc_flags |= IB_WC_WITH_NETWORK_HDR_TYPE;
  229. }
  230. static void dump_cqe(struct mlx5_ib_dev *dev, struct mlx5_err_cqe *cqe)
  231. {
  232. __be32 *p = (__be32 *)cqe;
  233. int i;
  234. mlx5_ib_warn(dev, "dump error cqe\n");
  235. for (i = 0; i < sizeof(*cqe) / 16; i++, p += 4)
  236. pr_info("%08x %08x %08x %08x\n", be32_to_cpu(p[0]),
  237. be32_to_cpu(p[1]), be32_to_cpu(p[2]),
  238. be32_to_cpu(p[3]));
  239. }
  240. static void mlx5_handle_error_cqe(struct mlx5_ib_dev *dev,
  241. struct mlx5_err_cqe *cqe,
  242. struct ib_wc *wc)
  243. {
  244. int dump = 1;
  245. switch (cqe->syndrome) {
  246. case MLX5_CQE_SYNDROME_LOCAL_LENGTH_ERR:
  247. wc->status = IB_WC_LOC_LEN_ERR;
  248. break;
  249. case MLX5_CQE_SYNDROME_LOCAL_QP_OP_ERR:
  250. wc->status = IB_WC_LOC_QP_OP_ERR;
  251. break;
  252. case MLX5_CQE_SYNDROME_LOCAL_PROT_ERR:
  253. wc->status = IB_WC_LOC_PROT_ERR;
  254. break;
  255. case MLX5_CQE_SYNDROME_WR_FLUSH_ERR:
  256. dump = 0;
  257. wc->status = IB_WC_WR_FLUSH_ERR;
  258. break;
  259. case MLX5_CQE_SYNDROME_MW_BIND_ERR:
  260. wc->status = IB_WC_MW_BIND_ERR;
  261. break;
  262. case MLX5_CQE_SYNDROME_BAD_RESP_ERR:
  263. wc->status = IB_WC_BAD_RESP_ERR;
  264. break;
  265. case MLX5_CQE_SYNDROME_LOCAL_ACCESS_ERR:
  266. wc->status = IB_WC_LOC_ACCESS_ERR;
  267. break;
  268. case MLX5_CQE_SYNDROME_REMOTE_INVAL_REQ_ERR:
  269. wc->status = IB_WC_REM_INV_REQ_ERR;
  270. break;
  271. case MLX5_CQE_SYNDROME_REMOTE_ACCESS_ERR:
  272. wc->status = IB_WC_REM_ACCESS_ERR;
  273. break;
  274. case MLX5_CQE_SYNDROME_REMOTE_OP_ERR:
  275. wc->status = IB_WC_REM_OP_ERR;
  276. break;
  277. case MLX5_CQE_SYNDROME_TRANSPORT_RETRY_EXC_ERR:
  278. wc->status = IB_WC_RETRY_EXC_ERR;
  279. dump = 0;
  280. break;
  281. case MLX5_CQE_SYNDROME_RNR_RETRY_EXC_ERR:
  282. wc->status = IB_WC_RNR_RETRY_EXC_ERR;
  283. dump = 0;
  284. break;
  285. case MLX5_CQE_SYNDROME_REMOTE_ABORTED_ERR:
  286. wc->status = IB_WC_REM_ABORT_ERR;
  287. break;
  288. default:
  289. wc->status = IB_WC_GENERAL_ERR;
  290. break;
  291. }
  292. wc->vendor_err = cqe->vendor_err_synd;
  293. if (dump)
  294. dump_cqe(dev, cqe);
  295. }
  296. static int is_atomic_response(struct mlx5_ib_qp *qp, uint16_t idx)
  297. {
  298. /* TBD: waiting decision
  299. */
  300. return 0;
  301. }
  302. static void *mlx5_get_atomic_laddr(struct mlx5_ib_qp *qp, uint16_t idx)
  303. {
  304. struct mlx5_wqe_data_seg *dpseg;
  305. void *addr;
  306. dpseg = mlx5_get_send_wqe(qp, idx) + sizeof(struct mlx5_wqe_ctrl_seg) +
  307. sizeof(struct mlx5_wqe_raddr_seg) +
  308. sizeof(struct mlx5_wqe_atomic_seg);
  309. addr = (void *)(unsigned long)be64_to_cpu(dpseg->addr);
  310. return addr;
  311. }
  312. static void handle_atomic(struct mlx5_ib_qp *qp, struct mlx5_cqe64 *cqe64,
  313. uint16_t idx)
  314. {
  315. void *addr;
  316. int byte_count;
  317. int i;
  318. if (!is_atomic_response(qp, idx))
  319. return;
  320. byte_count = be32_to_cpu(cqe64->byte_cnt);
  321. addr = mlx5_get_atomic_laddr(qp, idx);
  322. if (byte_count == 4) {
  323. *(uint32_t *)addr = be32_to_cpu(*((__be32 *)addr));
  324. } else {
  325. for (i = 0; i < byte_count; i += 8) {
  326. *(uint64_t *)addr = be64_to_cpu(*((__be64 *)addr));
  327. addr += 8;
  328. }
  329. }
  330. return;
  331. }
  332. static void handle_atomics(struct mlx5_ib_qp *qp, struct mlx5_cqe64 *cqe64,
  333. u16 tail, u16 head)
  334. {
  335. u16 idx;
  336. do {
  337. idx = tail & (qp->sq.wqe_cnt - 1);
  338. handle_atomic(qp, cqe64, idx);
  339. if (idx == head)
  340. break;
  341. tail = qp->sq.w_list[idx].next;
  342. } while (1);
  343. tail = qp->sq.w_list[idx].next;
  344. qp->sq.last_poll = tail;
  345. }
  346. static void free_cq_buf(struct mlx5_ib_dev *dev, struct mlx5_ib_cq_buf *buf)
  347. {
  348. mlx5_buf_free(dev->mdev, &buf->buf);
  349. }
  350. static void get_sig_err_item(struct mlx5_sig_err_cqe *cqe,
  351. struct ib_sig_err *item)
  352. {
  353. u16 syndrome = be16_to_cpu(cqe->syndrome);
  354. #define GUARD_ERR (1 << 13)
  355. #define APPTAG_ERR (1 << 12)
  356. #define REFTAG_ERR (1 << 11)
  357. if (syndrome & GUARD_ERR) {
  358. item->err_type = IB_SIG_BAD_GUARD;
  359. item->expected = be32_to_cpu(cqe->expected_trans_sig) >> 16;
  360. item->actual = be32_to_cpu(cqe->actual_trans_sig) >> 16;
  361. } else
  362. if (syndrome & REFTAG_ERR) {
  363. item->err_type = IB_SIG_BAD_REFTAG;
  364. item->expected = be32_to_cpu(cqe->expected_reftag);
  365. item->actual = be32_to_cpu(cqe->actual_reftag);
  366. } else
  367. if (syndrome & APPTAG_ERR) {
  368. item->err_type = IB_SIG_BAD_APPTAG;
  369. item->expected = be32_to_cpu(cqe->expected_trans_sig) & 0xffff;
  370. item->actual = be32_to_cpu(cqe->actual_trans_sig) & 0xffff;
  371. } else {
  372. pr_err("Got signature completion error with bad syndrome %04x\n",
  373. syndrome);
  374. }
  375. item->sig_err_offset = be64_to_cpu(cqe->err_offset);
  376. item->key = be32_to_cpu(cqe->mkey);
  377. }
  378. static void sw_send_comp(struct mlx5_ib_qp *qp, int num_entries,
  379. struct ib_wc *wc, int *npolled)
  380. {
  381. struct mlx5_ib_wq *wq;
  382. unsigned int cur;
  383. unsigned int idx;
  384. int np;
  385. int i;
  386. wq = &qp->sq;
  387. cur = wq->head - wq->tail;
  388. np = *npolled;
  389. if (cur == 0)
  390. return;
  391. for (i = 0; i < cur && np < num_entries; i++) {
  392. idx = wq->last_poll & (wq->wqe_cnt - 1);
  393. wc->wr_id = wq->wrid[idx];
  394. wc->status = IB_WC_WR_FLUSH_ERR;
  395. wc->vendor_err = MLX5_CQE_SYNDROME_WR_FLUSH_ERR;
  396. wq->tail++;
  397. np++;
  398. wc->qp = &qp->ibqp;
  399. wc++;
  400. wq->last_poll = wq->w_list[idx].next;
  401. }
  402. *npolled = np;
  403. }
  404. static void sw_recv_comp(struct mlx5_ib_qp *qp, int num_entries,
  405. struct ib_wc *wc, int *npolled)
  406. {
  407. struct mlx5_ib_wq *wq;
  408. unsigned int cur;
  409. int np;
  410. int i;
  411. wq = &qp->rq;
  412. cur = wq->head - wq->tail;
  413. np = *npolled;
  414. if (cur == 0)
  415. return;
  416. for (i = 0; i < cur && np < num_entries; i++) {
  417. wc->wr_id = wq->wrid[wq->tail & (wq->wqe_cnt - 1)];
  418. wc->status = IB_WC_WR_FLUSH_ERR;
  419. wc->vendor_err = MLX5_CQE_SYNDROME_WR_FLUSH_ERR;
  420. wq->tail++;
  421. np++;
  422. wc->qp = &qp->ibqp;
  423. wc++;
  424. }
  425. *npolled = np;
  426. }
  427. static void mlx5_ib_poll_sw_comp(struct mlx5_ib_cq *cq, int num_entries,
  428. struct ib_wc *wc, int *npolled)
  429. {
  430. struct mlx5_ib_qp *qp;
  431. *npolled = 0;
  432. /* Find uncompleted WQEs belonging to that cq and retrun mmics ones */
  433. list_for_each_entry(qp, &cq->list_send_qp, cq_send_list) {
  434. sw_send_comp(qp, num_entries, wc + *npolled, npolled);
  435. if (*npolled >= num_entries)
  436. return;
  437. }
  438. list_for_each_entry(qp, &cq->list_recv_qp, cq_recv_list) {
  439. sw_recv_comp(qp, num_entries, wc + *npolled, npolled);
  440. if (*npolled >= num_entries)
  441. return;
  442. }
  443. }
  444. static int mlx5_poll_one(struct mlx5_ib_cq *cq,
  445. struct mlx5_ib_qp **cur_qp,
  446. struct ib_wc *wc)
  447. {
  448. struct mlx5_ib_dev *dev = to_mdev(cq->ibcq.device);
  449. struct mlx5_err_cqe *err_cqe;
  450. struct mlx5_cqe64 *cqe64;
  451. struct mlx5_core_qp *mqp;
  452. struct mlx5_ib_wq *wq;
  453. struct mlx5_sig_err_cqe *sig_err_cqe;
  454. struct mlx5_core_mkey *mmkey;
  455. struct mlx5_ib_mr *mr;
  456. uint8_t opcode;
  457. uint32_t qpn;
  458. u16 wqe_ctr;
  459. void *cqe;
  460. int idx;
  461. repoll:
  462. cqe = next_cqe_sw(cq);
  463. if (!cqe)
  464. return -EAGAIN;
  465. cqe64 = (cq->mcq.cqe_sz == 64) ? cqe : cqe + 64;
  466. ++cq->mcq.cons_index;
  467. /* Make sure we read CQ entry contents after we've checked the
  468. * ownership bit.
  469. */
  470. rmb();
  471. opcode = cqe64->op_own >> 4;
  472. if (unlikely(opcode == MLX5_CQE_RESIZE_CQ)) {
  473. if (likely(cq->resize_buf)) {
  474. free_cq_buf(dev, &cq->buf);
  475. cq->buf = *cq->resize_buf;
  476. kfree(cq->resize_buf);
  477. cq->resize_buf = NULL;
  478. goto repoll;
  479. } else {
  480. mlx5_ib_warn(dev, "unexpected resize cqe\n");
  481. }
  482. }
  483. qpn = ntohl(cqe64->sop_drop_qpn) & 0xffffff;
  484. if (!*cur_qp || (qpn != (*cur_qp)->ibqp.qp_num)) {
  485. /* We do not have to take the QP table lock here,
  486. * because CQs will be locked while QPs are removed
  487. * from the table.
  488. */
  489. mqp = __mlx5_qp_lookup(dev->mdev, qpn);
  490. *cur_qp = to_mibqp(mqp);
  491. }
  492. wc->qp = &(*cur_qp)->ibqp;
  493. switch (opcode) {
  494. case MLX5_CQE_REQ:
  495. wq = &(*cur_qp)->sq;
  496. wqe_ctr = be16_to_cpu(cqe64->wqe_counter);
  497. idx = wqe_ctr & (wq->wqe_cnt - 1);
  498. handle_good_req(wc, cqe64, wq, idx);
  499. handle_atomics(*cur_qp, cqe64, wq->last_poll, idx);
  500. wc->wr_id = wq->wrid[idx];
  501. wq->tail = wq->wqe_head[idx] + 1;
  502. wc->status = IB_WC_SUCCESS;
  503. break;
  504. case MLX5_CQE_RESP_WR_IMM:
  505. case MLX5_CQE_RESP_SEND:
  506. case MLX5_CQE_RESP_SEND_IMM:
  507. case MLX5_CQE_RESP_SEND_INV:
  508. handle_responder(wc, cqe64, *cur_qp);
  509. wc->status = IB_WC_SUCCESS;
  510. break;
  511. case MLX5_CQE_RESIZE_CQ:
  512. break;
  513. case MLX5_CQE_REQ_ERR:
  514. case MLX5_CQE_RESP_ERR:
  515. err_cqe = (struct mlx5_err_cqe *)cqe64;
  516. mlx5_handle_error_cqe(dev, err_cqe, wc);
  517. mlx5_ib_dbg(dev, "%s error cqe on cqn 0x%x:\n",
  518. opcode == MLX5_CQE_REQ_ERR ?
  519. "Requestor" : "Responder", cq->mcq.cqn);
  520. mlx5_ib_dbg(dev, "syndrome 0x%x, vendor syndrome 0x%x\n",
  521. err_cqe->syndrome, err_cqe->vendor_err_synd);
  522. if (opcode == MLX5_CQE_REQ_ERR) {
  523. wq = &(*cur_qp)->sq;
  524. wqe_ctr = be16_to_cpu(cqe64->wqe_counter);
  525. idx = wqe_ctr & (wq->wqe_cnt - 1);
  526. wc->wr_id = wq->wrid[idx];
  527. wq->tail = wq->wqe_head[idx] + 1;
  528. } else {
  529. struct mlx5_ib_srq *srq;
  530. if ((*cur_qp)->ibqp.srq) {
  531. srq = to_msrq((*cur_qp)->ibqp.srq);
  532. wqe_ctr = be16_to_cpu(cqe64->wqe_counter);
  533. wc->wr_id = srq->wrid[wqe_ctr];
  534. mlx5_ib_free_srq_wqe(srq, wqe_ctr);
  535. } else {
  536. wq = &(*cur_qp)->rq;
  537. wc->wr_id = wq->wrid[wq->tail & (wq->wqe_cnt - 1)];
  538. ++wq->tail;
  539. }
  540. }
  541. break;
  542. case MLX5_CQE_SIG_ERR:
  543. sig_err_cqe = (struct mlx5_sig_err_cqe *)cqe64;
  544. read_lock(&dev->mdev->priv.mkey_table.lock);
  545. mmkey = __mlx5_mr_lookup(dev->mdev,
  546. mlx5_base_mkey(be32_to_cpu(sig_err_cqe->mkey)));
  547. mr = to_mibmr(mmkey);
  548. get_sig_err_item(sig_err_cqe, &mr->sig->err_item);
  549. mr->sig->sig_err_exists = true;
  550. mr->sig->sigerr_count++;
  551. mlx5_ib_warn(dev, "CQN: 0x%x Got SIGERR on key: 0x%x err_type %x err_offset %llx expected %x actual %x\n",
  552. cq->mcq.cqn, mr->sig->err_item.key,
  553. mr->sig->err_item.err_type,
  554. mr->sig->err_item.sig_err_offset,
  555. mr->sig->err_item.expected,
  556. mr->sig->err_item.actual);
  557. read_unlock(&dev->mdev->priv.mkey_table.lock);
  558. goto repoll;
  559. }
  560. return 0;
  561. }
  562. static int poll_soft_wc(struct mlx5_ib_cq *cq, int num_entries,
  563. struct ib_wc *wc)
  564. {
  565. struct mlx5_ib_dev *dev = to_mdev(cq->ibcq.device);
  566. struct mlx5_ib_wc *soft_wc, *next;
  567. int npolled = 0;
  568. list_for_each_entry_safe(soft_wc, next, &cq->wc_list, list) {
  569. if (npolled >= num_entries)
  570. break;
  571. mlx5_ib_dbg(dev, "polled software generated completion on CQ 0x%x\n",
  572. cq->mcq.cqn);
  573. wc[npolled++] = soft_wc->wc;
  574. list_del(&soft_wc->list);
  575. kfree(soft_wc);
  576. }
  577. return npolled;
  578. }
  579. int mlx5_ib_poll_cq(struct ib_cq *ibcq, int num_entries, struct ib_wc *wc)
  580. {
  581. struct mlx5_ib_cq *cq = to_mcq(ibcq);
  582. struct mlx5_ib_qp *cur_qp = NULL;
  583. struct mlx5_ib_dev *dev = to_mdev(cq->ibcq.device);
  584. struct mlx5_core_dev *mdev = dev->mdev;
  585. unsigned long flags;
  586. int soft_polled = 0;
  587. int npolled;
  588. spin_lock_irqsave(&cq->lock, flags);
  589. if (mdev->state == MLX5_DEVICE_STATE_INTERNAL_ERROR) {
  590. mlx5_ib_poll_sw_comp(cq, num_entries, wc, &npolled);
  591. goto out;
  592. }
  593. if (unlikely(!list_empty(&cq->wc_list)))
  594. soft_polled = poll_soft_wc(cq, num_entries, wc);
  595. for (npolled = 0; npolled < num_entries - soft_polled; npolled++) {
  596. if (mlx5_poll_one(cq, &cur_qp, wc + soft_polled + npolled))
  597. break;
  598. }
  599. if (npolled)
  600. mlx5_cq_set_ci(&cq->mcq);
  601. out:
  602. spin_unlock_irqrestore(&cq->lock, flags);
  603. return soft_polled + npolled;
  604. }
  605. int mlx5_ib_arm_cq(struct ib_cq *ibcq, enum ib_cq_notify_flags flags)
  606. {
  607. struct mlx5_core_dev *mdev = to_mdev(ibcq->device)->mdev;
  608. struct mlx5_ib_cq *cq = to_mcq(ibcq);
  609. void __iomem *uar_page = mdev->priv.uuari.uars[0].map;
  610. unsigned long irq_flags;
  611. int ret = 0;
  612. spin_lock_irqsave(&cq->lock, irq_flags);
  613. if (cq->notify_flags != IB_CQ_NEXT_COMP)
  614. cq->notify_flags = flags & IB_CQ_SOLICITED_MASK;
  615. if ((flags & IB_CQ_REPORT_MISSED_EVENTS) && !list_empty(&cq->wc_list))
  616. ret = 1;
  617. spin_unlock_irqrestore(&cq->lock, irq_flags);
  618. mlx5_cq_arm(&cq->mcq,
  619. (flags & IB_CQ_SOLICITED_MASK) == IB_CQ_SOLICITED ?
  620. MLX5_CQ_DB_REQ_NOT_SOL : MLX5_CQ_DB_REQ_NOT,
  621. uar_page,
  622. MLX5_GET_DOORBELL_LOCK(&mdev->priv.cq_uar_lock),
  623. to_mcq(ibcq)->mcq.cons_index);
  624. return ret;
  625. }
  626. static int alloc_cq_buf(struct mlx5_ib_dev *dev, struct mlx5_ib_cq_buf *buf,
  627. int nent, int cqe_size)
  628. {
  629. int err;
  630. err = mlx5_buf_alloc(dev->mdev, nent * cqe_size, &buf->buf);
  631. if (err)
  632. return err;
  633. buf->cqe_size = cqe_size;
  634. buf->nent = nent;
  635. return 0;
  636. }
  637. static int create_cq_user(struct mlx5_ib_dev *dev, struct ib_udata *udata,
  638. struct ib_ucontext *context, struct mlx5_ib_cq *cq,
  639. int entries, u32 **cqb,
  640. int *cqe_size, int *index, int *inlen)
  641. {
  642. struct mlx5_ib_create_cq ucmd;
  643. size_t ucmdlen;
  644. int page_shift;
  645. __be64 *pas;
  646. int npages;
  647. int ncont;
  648. void *cqc;
  649. int err;
  650. ucmdlen =
  651. (udata->inlen - sizeof(struct ib_uverbs_cmd_hdr) <
  652. sizeof(ucmd)) ? (sizeof(ucmd) -
  653. sizeof(ucmd.reserved)) : sizeof(ucmd);
  654. if (ib_copy_from_udata(&ucmd, udata, ucmdlen))
  655. return -EFAULT;
  656. if (ucmdlen == sizeof(ucmd) &&
  657. ucmd.reserved != 0)
  658. return -EINVAL;
  659. if (ucmd.cqe_size != 64 && ucmd.cqe_size != 128)
  660. return -EINVAL;
  661. *cqe_size = ucmd.cqe_size;
  662. cq->buf.umem = ib_umem_get(context, ucmd.buf_addr,
  663. entries * ucmd.cqe_size,
  664. IB_ACCESS_LOCAL_WRITE, 1);
  665. if (IS_ERR(cq->buf.umem)) {
  666. err = PTR_ERR(cq->buf.umem);
  667. return err;
  668. }
  669. err = mlx5_ib_db_map_user(to_mucontext(context), ucmd.db_addr,
  670. &cq->db);
  671. if (err)
  672. goto err_umem;
  673. mlx5_ib_cont_pages(cq->buf.umem, ucmd.buf_addr, &npages, &page_shift,
  674. &ncont, NULL);
  675. mlx5_ib_dbg(dev, "addr 0x%llx, size %u, npages %d, page_shift %d, ncont %d\n",
  676. ucmd.buf_addr, entries * ucmd.cqe_size, npages, page_shift, ncont);
  677. *inlen = MLX5_ST_SZ_BYTES(create_cq_in) +
  678. MLX5_FLD_SZ_BYTES(create_cq_in, pas[0]) * ncont;
  679. *cqb = mlx5_vzalloc(*inlen);
  680. if (!*cqb) {
  681. err = -ENOMEM;
  682. goto err_db;
  683. }
  684. pas = (__be64 *)MLX5_ADDR_OF(create_cq_in, *cqb, pas);
  685. mlx5_ib_populate_pas(dev, cq->buf.umem, page_shift, pas, 0);
  686. cqc = MLX5_ADDR_OF(create_cq_in, *cqb, cq_context);
  687. MLX5_SET(cqc, cqc, log_page_size,
  688. page_shift - MLX5_ADAPTER_PAGE_SHIFT);
  689. *index = to_mucontext(context)->uuari.uars[0].index;
  690. return 0;
  691. err_db:
  692. mlx5_ib_db_unmap_user(to_mucontext(context), &cq->db);
  693. err_umem:
  694. ib_umem_release(cq->buf.umem);
  695. return err;
  696. }
  697. static void destroy_cq_user(struct mlx5_ib_cq *cq, struct ib_ucontext *context)
  698. {
  699. mlx5_ib_db_unmap_user(to_mucontext(context), &cq->db);
  700. ib_umem_release(cq->buf.umem);
  701. }
  702. static void init_cq_buf(struct mlx5_ib_cq *cq, struct mlx5_ib_cq_buf *buf)
  703. {
  704. int i;
  705. void *cqe;
  706. struct mlx5_cqe64 *cqe64;
  707. for (i = 0; i < buf->nent; i++) {
  708. cqe = get_cqe_from_buf(buf, i, buf->cqe_size);
  709. cqe64 = buf->cqe_size == 64 ? cqe : cqe + 64;
  710. cqe64->op_own = MLX5_CQE_INVALID << 4;
  711. }
  712. }
  713. static int create_cq_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq,
  714. int entries, int cqe_size,
  715. u32 **cqb, int *index, int *inlen)
  716. {
  717. __be64 *pas;
  718. void *cqc;
  719. int err;
  720. err = mlx5_db_alloc(dev->mdev, &cq->db);
  721. if (err)
  722. return err;
  723. cq->mcq.set_ci_db = cq->db.db;
  724. cq->mcq.arm_db = cq->db.db + 1;
  725. cq->mcq.cqe_sz = cqe_size;
  726. err = alloc_cq_buf(dev, &cq->buf, entries, cqe_size);
  727. if (err)
  728. goto err_db;
  729. init_cq_buf(cq, &cq->buf);
  730. *inlen = MLX5_ST_SZ_BYTES(create_cq_in) +
  731. MLX5_FLD_SZ_BYTES(create_cq_in, pas[0]) * cq->buf.buf.npages;
  732. *cqb = mlx5_vzalloc(*inlen);
  733. if (!*cqb) {
  734. err = -ENOMEM;
  735. goto err_buf;
  736. }
  737. pas = (__be64 *)MLX5_ADDR_OF(create_cq_in, *cqb, pas);
  738. mlx5_fill_page_array(&cq->buf.buf, pas);
  739. cqc = MLX5_ADDR_OF(create_cq_in, *cqb, cq_context);
  740. MLX5_SET(cqc, cqc, log_page_size,
  741. cq->buf.buf.page_shift - MLX5_ADAPTER_PAGE_SHIFT);
  742. *index = dev->mdev->priv.uuari.uars[0].index;
  743. return 0;
  744. err_buf:
  745. free_cq_buf(dev, &cq->buf);
  746. err_db:
  747. mlx5_db_free(dev->mdev, &cq->db);
  748. return err;
  749. }
  750. static void destroy_cq_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq)
  751. {
  752. free_cq_buf(dev, &cq->buf);
  753. mlx5_db_free(dev->mdev, &cq->db);
  754. }
  755. static void notify_soft_wc_handler(struct work_struct *work)
  756. {
  757. struct mlx5_ib_cq *cq = container_of(work, struct mlx5_ib_cq,
  758. notify_work);
  759. cq->ibcq.comp_handler(&cq->ibcq, cq->ibcq.cq_context);
  760. }
  761. struct ib_cq *mlx5_ib_create_cq(struct ib_device *ibdev,
  762. const struct ib_cq_init_attr *attr,
  763. struct ib_ucontext *context,
  764. struct ib_udata *udata)
  765. {
  766. int entries = attr->cqe;
  767. int vector = attr->comp_vector;
  768. struct mlx5_ib_dev *dev = to_mdev(ibdev);
  769. struct mlx5_ib_cq *cq;
  770. int uninitialized_var(index);
  771. int uninitialized_var(inlen);
  772. u32 *cqb = NULL;
  773. void *cqc;
  774. int cqe_size;
  775. unsigned int irqn;
  776. int eqn;
  777. int err;
  778. if (entries < 0 ||
  779. (entries > (1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz))))
  780. return ERR_PTR(-EINVAL);
  781. if (check_cq_create_flags(attr->flags))
  782. return ERR_PTR(-EOPNOTSUPP);
  783. entries = roundup_pow_of_two(entries + 1);
  784. if (entries > (1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz)))
  785. return ERR_PTR(-EINVAL);
  786. cq = kzalloc(sizeof(*cq), GFP_KERNEL);
  787. if (!cq)
  788. return ERR_PTR(-ENOMEM);
  789. cq->ibcq.cqe = entries - 1;
  790. mutex_init(&cq->resize_mutex);
  791. spin_lock_init(&cq->lock);
  792. cq->resize_buf = NULL;
  793. cq->resize_umem = NULL;
  794. cq->create_flags = attr->flags;
  795. INIT_LIST_HEAD(&cq->list_send_qp);
  796. INIT_LIST_HEAD(&cq->list_recv_qp);
  797. if (context) {
  798. err = create_cq_user(dev, udata, context, cq, entries,
  799. &cqb, &cqe_size, &index, &inlen);
  800. if (err)
  801. goto err_create;
  802. } else {
  803. cqe_size = cache_line_size() == 128 ? 128 : 64;
  804. err = create_cq_kernel(dev, cq, entries, cqe_size, &cqb,
  805. &index, &inlen);
  806. if (err)
  807. goto err_create;
  808. INIT_WORK(&cq->notify_work, notify_soft_wc_handler);
  809. }
  810. err = mlx5_vector2eqn(dev->mdev, vector, &eqn, &irqn);
  811. if (err)
  812. goto err_cqb;
  813. cq->cqe_size = cqe_size;
  814. cqc = MLX5_ADDR_OF(create_cq_in, cqb, cq_context);
  815. MLX5_SET(cqc, cqc, cqe_sz, cqe_sz_to_mlx_sz(cqe_size));
  816. MLX5_SET(cqc, cqc, log_cq_size, ilog2(entries));
  817. MLX5_SET(cqc, cqc, uar_page, index);
  818. MLX5_SET(cqc, cqc, c_eqn, eqn);
  819. MLX5_SET64(cqc, cqc, dbr_addr, cq->db.dma);
  820. if (cq->create_flags & IB_CQ_FLAGS_IGNORE_OVERRUN)
  821. MLX5_SET(cqc, cqc, oi, 1);
  822. err = mlx5_core_create_cq(dev->mdev, &cq->mcq, cqb, inlen);
  823. if (err)
  824. goto err_cqb;
  825. mlx5_ib_dbg(dev, "cqn 0x%x\n", cq->mcq.cqn);
  826. cq->mcq.irqn = irqn;
  827. if (context)
  828. cq->mcq.tasklet_ctx.comp = mlx5_ib_cq_comp;
  829. else
  830. cq->mcq.comp = mlx5_ib_cq_comp;
  831. cq->mcq.event = mlx5_ib_cq_event;
  832. INIT_LIST_HEAD(&cq->wc_list);
  833. if (context)
  834. if (ib_copy_to_udata(udata, &cq->mcq.cqn, sizeof(__u32))) {
  835. err = -EFAULT;
  836. goto err_cmd;
  837. }
  838. kvfree(cqb);
  839. return &cq->ibcq;
  840. err_cmd:
  841. mlx5_core_destroy_cq(dev->mdev, &cq->mcq);
  842. err_cqb:
  843. kvfree(cqb);
  844. if (context)
  845. destroy_cq_user(cq, context);
  846. else
  847. destroy_cq_kernel(dev, cq);
  848. err_create:
  849. kfree(cq);
  850. return ERR_PTR(err);
  851. }
  852. int mlx5_ib_destroy_cq(struct ib_cq *cq)
  853. {
  854. struct mlx5_ib_dev *dev = to_mdev(cq->device);
  855. struct mlx5_ib_cq *mcq = to_mcq(cq);
  856. struct ib_ucontext *context = NULL;
  857. if (cq->uobject)
  858. context = cq->uobject->context;
  859. mlx5_core_destroy_cq(dev->mdev, &mcq->mcq);
  860. if (context)
  861. destroy_cq_user(mcq, context);
  862. else
  863. destroy_cq_kernel(dev, mcq);
  864. kfree(mcq);
  865. return 0;
  866. }
  867. static int is_equal_rsn(struct mlx5_cqe64 *cqe64, u32 rsn)
  868. {
  869. return rsn == (ntohl(cqe64->sop_drop_qpn) & 0xffffff);
  870. }
  871. void __mlx5_ib_cq_clean(struct mlx5_ib_cq *cq, u32 rsn, struct mlx5_ib_srq *srq)
  872. {
  873. struct mlx5_cqe64 *cqe64, *dest64;
  874. void *cqe, *dest;
  875. u32 prod_index;
  876. int nfreed = 0;
  877. u8 owner_bit;
  878. if (!cq)
  879. return;
  880. /* First we need to find the current producer index, so we
  881. * know where to start cleaning from. It doesn't matter if HW
  882. * adds new entries after this loop -- the QP we're worried
  883. * about is already in RESET, so the new entries won't come
  884. * from our QP and therefore don't need to be checked.
  885. */
  886. for (prod_index = cq->mcq.cons_index; get_sw_cqe(cq, prod_index); prod_index++)
  887. if (prod_index == cq->mcq.cons_index + cq->ibcq.cqe)
  888. break;
  889. /* Now sweep backwards through the CQ, removing CQ entries
  890. * that match our QP by copying older entries on top of them.
  891. */
  892. while ((int) --prod_index - (int) cq->mcq.cons_index >= 0) {
  893. cqe = get_cqe(cq, prod_index & cq->ibcq.cqe);
  894. cqe64 = (cq->mcq.cqe_sz == 64) ? cqe : cqe + 64;
  895. if (is_equal_rsn(cqe64, rsn)) {
  896. if (srq && (ntohl(cqe64->srqn) & 0xffffff))
  897. mlx5_ib_free_srq_wqe(srq, be16_to_cpu(cqe64->wqe_counter));
  898. ++nfreed;
  899. } else if (nfreed) {
  900. dest = get_cqe(cq, (prod_index + nfreed) & cq->ibcq.cqe);
  901. dest64 = (cq->mcq.cqe_sz == 64) ? dest : dest + 64;
  902. owner_bit = dest64->op_own & MLX5_CQE_OWNER_MASK;
  903. memcpy(dest, cqe, cq->mcq.cqe_sz);
  904. dest64->op_own = owner_bit |
  905. (dest64->op_own & ~MLX5_CQE_OWNER_MASK);
  906. }
  907. }
  908. if (nfreed) {
  909. cq->mcq.cons_index += nfreed;
  910. /* Make sure update of buffer contents is done before
  911. * updating consumer index.
  912. */
  913. wmb();
  914. mlx5_cq_set_ci(&cq->mcq);
  915. }
  916. }
  917. void mlx5_ib_cq_clean(struct mlx5_ib_cq *cq, u32 qpn, struct mlx5_ib_srq *srq)
  918. {
  919. if (!cq)
  920. return;
  921. spin_lock_irq(&cq->lock);
  922. __mlx5_ib_cq_clean(cq, qpn, srq);
  923. spin_unlock_irq(&cq->lock);
  924. }
  925. int mlx5_ib_modify_cq(struct ib_cq *cq, u16 cq_count, u16 cq_period)
  926. {
  927. struct mlx5_ib_dev *dev = to_mdev(cq->device);
  928. struct mlx5_ib_cq *mcq = to_mcq(cq);
  929. int err;
  930. if (!MLX5_CAP_GEN(dev->mdev, cq_moderation))
  931. return -ENOSYS;
  932. err = mlx5_core_modify_cq_moderation(dev->mdev, &mcq->mcq,
  933. cq_period, cq_count);
  934. if (err)
  935. mlx5_ib_warn(dev, "modify cq 0x%x failed\n", mcq->mcq.cqn);
  936. return err;
  937. }
  938. static int resize_user(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq,
  939. int entries, struct ib_udata *udata, int *npas,
  940. int *page_shift, int *cqe_size)
  941. {
  942. struct mlx5_ib_resize_cq ucmd;
  943. struct ib_umem *umem;
  944. int err;
  945. int npages;
  946. struct ib_ucontext *context = cq->buf.umem->context;
  947. err = ib_copy_from_udata(&ucmd, udata, sizeof(ucmd));
  948. if (err)
  949. return err;
  950. if (ucmd.reserved0 || ucmd.reserved1)
  951. return -EINVAL;
  952. umem = ib_umem_get(context, ucmd.buf_addr, entries * ucmd.cqe_size,
  953. IB_ACCESS_LOCAL_WRITE, 1);
  954. if (IS_ERR(umem)) {
  955. err = PTR_ERR(umem);
  956. return err;
  957. }
  958. mlx5_ib_cont_pages(umem, ucmd.buf_addr, &npages, page_shift,
  959. npas, NULL);
  960. cq->resize_umem = umem;
  961. *cqe_size = ucmd.cqe_size;
  962. return 0;
  963. }
  964. static void un_resize_user(struct mlx5_ib_cq *cq)
  965. {
  966. ib_umem_release(cq->resize_umem);
  967. }
  968. static int resize_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq,
  969. int entries, int cqe_size)
  970. {
  971. int err;
  972. cq->resize_buf = kzalloc(sizeof(*cq->resize_buf), GFP_KERNEL);
  973. if (!cq->resize_buf)
  974. return -ENOMEM;
  975. err = alloc_cq_buf(dev, cq->resize_buf, entries, cqe_size);
  976. if (err)
  977. goto ex;
  978. init_cq_buf(cq, cq->resize_buf);
  979. return 0;
  980. ex:
  981. kfree(cq->resize_buf);
  982. return err;
  983. }
  984. static void un_resize_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq)
  985. {
  986. free_cq_buf(dev, cq->resize_buf);
  987. cq->resize_buf = NULL;
  988. }
  989. static int copy_resize_cqes(struct mlx5_ib_cq *cq)
  990. {
  991. struct mlx5_ib_dev *dev = to_mdev(cq->ibcq.device);
  992. struct mlx5_cqe64 *scqe64;
  993. struct mlx5_cqe64 *dcqe64;
  994. void *start_cqe;
  995. void *scqe;
  996. void *dcqe;
  997. int ssize;
  998. int dsize;
  999. int i;
  1000. u8 sw_own;
  1001. ssize = cq->buf.cqe_size;
  1002. dsize = cq->resize_buf->cqe_size;
  1003. if (ssize != dsize) {
  1004. mlx5_ib_warn(dev, "resize from different cqe size is not supported\n");
  1005. return -EINVAL;
  1006. }
  1007. i = cq->mcq.cons_index;
  1008. scqe = get_sw_cqe(cq, i);
  1009. scqe64 = ssize == 64 ? scqe : scqe + 64;
  1010. start_cqe = scqe;
  1011. if (!scqe) {
  1012. mlx5_ib_warn(dev, "expected cqe in sw ownership\n");
  1013. return -EINVAL;
  1014. }
  1015. while ((scqe64->op_own >> 4) != MLX5_CQE_RESIZE_CQ) {
  1016. dcqe = get_cqe_from_buf(cq->resize_buf,
  1017. (i + 1) & (cq->resize_buf->nent),
  1018. dsize);
  1019. dcqe64 = dsize == 64 ? dcqe : dcqe + 64;
  1020. sw_own = sw_ownership_bit(i + 1, cq->resize_buf->nent);
  1021. memcpy(dcqe, scqe, dsize);
  1022. dcqe64->op_own = (dcqe64->op_own & ~MLX5_CQE_OWNER_MASK) | sw_own;
  1023. ++i;
  1024. scqe = get_sw_cqe(cq, i);
  1025. scqe64 = ssize == 64 ? scqe : scqe + 64;
  1026. if (!scqe) {
  1027. mlx5_ib_warn(dev, "expected cqe in sw ownership\n");
  1028. return -EINVAL;
  1029. }
  1030. if (scqe == start_cqe) {
  1031. pr_warn("resize CQ failed to get resize CQE, CQN 0x%x\n",
  1032. cq->mcq.cqn);
  1033. return -ENOMEM;
  1034. }
  1035. }
  1036. ++cq->mcq.cons_index;
  1037. return 0;
  1038. }
  1039. int mlx5_ib_resize_cq(struct ib_cq *ibcq, int entries, struct ib_udata *udata)
  1040. {
  1041. struct mlx5_ib_dev *dev = to_mdev(ibcq->device);
  1042. struct mlx5_ib_cq *cq = to_mcq(ibcq);
  1043. void *cqc;
  1044. u32 *in;
  1045. int err;
  1046. int npas;
  1047. __be64 *pas;
  1048. int page_shift;
  1049. int inlen;
  1050. int uninitialized_var(cqe_size);
  1051. unsigned long flags;
  1052. if (!MLX5_CAP_GEN(dev->mdev, cq_resize)) {
  1053. pr_info("Firmware does not support resize CQ\n");
  1054. return -ENOSYS;
  1055. }
  1056. if (entries < 1 ||
  1057. entries > (1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz))) {
  1058. mlx5_ib_warn(dev, "wrong entries number %d, max %d\n",
  1059. entries,
  1060. 1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz));
  1061. return -EINVAL;
  1062. }
  1063. entries = roundup_pow_of_two(entries + 1);
  1064. if (entries > (1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz)) + 1)
  1065. return -EINVAL;
  1066. if (entries == ibcq->cqe + 1)
  1067. return 0;
  1068. mutex_lock(&cq->resize_mutex);
  1069. if (udata) {
  1070. err = resize_user(dev, cq, entries, udata, &npas, &page_shift,
  1071. &cqe_size);
  1072. } else {
  1073. cqe_size = 64;
  1074. err = resize_kernel(dev, cq, entries, cqe_size);
  1075. if (!err) {
  1076. npas = cq->resize_buf->buf.npages;
  1077. page_shift = cq->resize_buf->buf.page_shift;
  1078. }
  1079. }
  1080. if (err)
  1081. goto ex;
  1082. inlen = MLX5_ST_SZ_BYTES(modify_cq_in) +
  1083. MLX5_FLD_SZ_BYTES(modify_cq_in, pas[0]) * npas;
  1084. in = mlx5_vzalloc(inlen);
  1085. if (!in) {
  1086. err = -ENOMEM;
  1087. goto ex_resize;
  1088. }
  1089. pas = (__be64 *)MLX5_ADDR_OF(modify_cq_in, in, pas);
  1090. if (udata)
  1091. mlx5_ib_populate_pas(dev, cq->resize_umem, page_shift,
  1092. pas, 0);
  1093. else
  1094. mlx5_fill_page_array(&cq->resize_buf->buf, pas);
  1095. MLX5_SET(modify_cq_in, in,
  1096. modify_field_select_resize_field_select.resize_field_select.resize_field_select,
  1097. MLX5_MODIFY_CQ_MASK_LOG_SIZE |
  1098. MLX5_MODIFY_CQ_MASK_PG_OFFSET |
  1099. MLX5_MODIFY_CQ_MASK_PG_SIZE);
  1100. cqc = MLX5_ADDR_OF(modify_cq_in, in, cq_context);
  1101. MLX5_SET(cqc, cqc, log_page_size,
  1102. page_shift - MLX5_ADAPTER_PAGE_SHIFT);
  1103. MLX5_SET(cqc, cqc, cqe_sz, cqe_sz_to_mlx_sz(cqe_size));
  1104. MLX5_SET(cqc, cqc, log_cq_size, ilog2(entries));
  1105. MLX5_SET(modify_cq_in, in, op_mod, MLX5_CQ_OPMOD_RESIZE);
  1106. MLX5_SET(modify_cq_in, in, cqn, cq->mcq.cqn);
  1107. err = mlx5_core_modify_cq(dev->mdev, &cq->mcq, in, inlen);
  1108. if (err)
  1109. goto ex_alloc;
  1110. if (udata) {
  1111. cq->ibcq.cqe = entries - 1;
  1112. ib_umem_release(cq->buf.umem);
  1113. cq->buf.umem = cq->resize_umem;
  1114. cq->resize_umem = NULL;
  1115. } else {
  1116. struct mlx5_ib_cq_buf tbuf;
  1117. int resized = 0;
  1118. spin_lock_irqsave(&cq->lock, flags);
  1119. if (cq->resize_buf) {
  1120. err = copy_resize_cqes(cq);
  1121. if (!err) {
  1122. tbuf = cq->buf;
  1123. cq->buf = *cq->resize_buf;
  1124. kfree(cq->resize_buf);
  1125. cq->resize_buf = NULL;
  1126. resized = 1;
  1127. }
  1128. }
  1129. cq->ibcq.cqe = entries - 1;
  1130. spin_unlock_irqrestore(&cq->lock, flags);
  1131. if (resized)
  1132. free_cq_buf(dev, &tbuf);
  1133. }
  1134. mutex_unlock(&cq->resize_mutex);
  1135. kvfree(in);
  1136. return 0;
  1137. ex_alloc:
  1138. kvfree(in);
  1139. ex_resize:
  1140. if (udata)
  1141. un_resize_user(cq);
  1142. else
  1143. un_resize_kernel(dev, cq);
  1144. ex:
  1145. mutex_unlock(&cq->resize_mutex);
  1146. return err;
  1147. }
  1148. int mlx5_ib_get_cqe_size(struct mlx5_ib_dev *dev, struct ib_cq *ibcq)
  1149. {
  1150. struct mlx5_ib_cq *cq;
  1151. if (!ibcq)
  1152. return 128;
  1153. cq = to_mcq(ibcq);
  1154. return cq->cqe_size;
  1155. }
  1156. /* Called from atomic context */
  1157. int mlx5_ib_generate_wc(struct ib_cq *ibcq, struct ib_wc *wc)
  1158. {
  1159. struct mlx5_ib_wc *soft_wc;
  1160. struct mlx5_ib_cq *cq = to_mcq(ibcq);
  1161. unsigned long flags;
  1162. soft_wc = kmalloc(sizeof(*soft_wc), GFP_ATOMIC);
  1163. if (!soft_wc)
  1164. return -ENOMEM;
  1165. soft_wc->wc = *wc;
  1166. spin_lock_irqsave(&cq->lock, flags);
  1167. list_add_tail(&soft_wc->list, &cq->wc_list);
  1168. if (cq->notify_flags == IB_CQ_NEXT_COMP ||
  1169. wc->status != IB_WC_SUCCESS) {
  1170. cq->notify_flags = 0;
  1171. schedule_work(&cq->notify_work);
  1172. }
  1173. spin_unlock_irqrestore(&cq->lock, flags);
  1174. return 0;
  1175. }