cq.c 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185
  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. mlx5_cq_arm(&to_mcq(ibcq)->mcq,
  510. (flags & IB_CQ_SOLICITED_MASK) == IB_CQ_SOLICITED ?
  511. MLX5_CQ_DB_REQ_NOT_SOL : MLX5_CQ_DB_REQ_NOT,
  512. to_mdev(ibcq->device)->mdev->priv.uuari.uars[0].map,
  513. MLX5_GET_DOORBELL_LOCK(&to_mdev(ibcq->device)->mdev->priv.cq_uar_lock));
  514. return 0;
  515. }
  516. static int alloc_cq_buf(struct mlx5_ib_dev *dev, struct mlx5_ib_cq_buf *buf,
  517. int nent, int cqe_size)
  518. {
  519. int err;
  520. err = mlx5_buf_alloc(dev->mdev, nent * cqe_size,
  521. PAGE_SIZE * 2, &buf->buf);
  522. if (err)
  523. return err;
  524. buf->cqe_size = cqe_size;
  525. buf->nent = nent;
  526. return 0;
  527. }
  528. static int create_cq_user(struct mlx5_ib_dev *dev, struct ib_udata *udata,
  529. struct ib_ucontext *context, struct mlx5_ib_cq *cq,
  530. int entries, struct mlx5_create_cq_mbox_in **cqb,
  531. int *cqe_size, int *index, int *inlen)
  532. {
  533. struct mlx5_ib_create_cq ucmd;
  534. size_t ucmdlen;
  535. int page_shift;
  536. int npages;
  537. int ncont;
  538. int err;
  539. ucmdlen =
  540. (udata->inlen - sizeof(struct ib_uverbs_cmd_hdr) <
  541. sizeof(ucmd)) ? (sizeof(ucmd) -
  542. sizeof(ucmd.reserved)) : sizeof(ucmd);
  543. if (ib_copy_from_udata(&ucmd, udata, ucmdlen))
  544. return -EFAULT;
  545. if (ucmdlen == sizeof(ucmd) &&
  546. ucmd.reserved != 0)
  547. return -EINVAL;
  548. if (ucmd.cqe_size != 64 && ucmd.cqe_size != 128)
  549. return -EINVAL;
  550. *cqe_size = ucmd.cqe_size;
  551. cq->buf.umem = ib_umem_get(context, ucmd.buf_addr,
  552. entries * ucmd.cqe_size,
  553. IB_ACCESS_LOCAL_WRITE, 1);
  554. if (IS_ERR(cq->buf.umem)) {
  555. err = PTR_ERR(cq->buf.umem);
  556. return err;
  557. }
  558. err = mlx5_ib_db_map_user(to_mucontext(context), ucmd.db_addr,
  559. &cq->db);
  560. if (err)
  561. goto err_umem;
  562. mlx5_ib_cont_pages(cq->buf.umem, ucmd.buf_addr, &npages, &page_shift,
  563. &ncont, NULL);
  564. mlx5_ib_dbg(dev, "addr 0x%llx, size %u, npages %d, page_shift %d, ncont %d\n",
  565. ucmd.buf_addr, entries * ucmd.cqe_size, npages, page_shift, ncont);
  566. *inlen = sizeof(**cqb) + sizeof(*(*cqb)->pas) * ncont;
  567. *cqb = mlx5_vzalloc(*inlen);
  568. if (!*cqb) {
  569. err = -ENOMEM;
  570. goto err_db;
  571. }
  572. mlx5_ib_populate_pas(dev, cq->buf.umem, page_shift, (*cqb)->pas, 0);
  573. (*cqb)->ctx.log_pg_sz = page_shift - MLX5_ADAPTER_PAGE_SHIFT;
  574. *index = to_mucontext(context)->uuari.uars[0].index;
  575. return 0;
  576. err_db:
  577. mlx5_ib_db_unmap_user(to_mucontext(context), &cq->db);
  578. err_umem:
  579. ib_umem_release(cq->buf.umem);
  580. return err;
  581. }
  582. static void destroy_cq_user(struct mlx5_ib_cq *cq, struct ib_ucontext *context)
  583. {
  584. mlx5_ib_db_unmap_user(to_mucontext(context), &cq->db);
  585. ib_umem_release(cq->buf.umem);
  586. }
  587. static void init_cq_buf(struct mlx5_ib_cq *cq, struct mlx5_ib_cq_buf *buf)
  588. {
  589. int i;
  590. void *cqe;
  591. struct mlx5_cqe64 *cqe64;
  592. for (i = 0; i < buf->nent; i++) {
  593. cqe = get_cqe_from_buf(buf, i, buf->cqe_size);
  594. cqe64 = buf->cqe_size == 64 ? cqe : cqe + 64;
  595. cqe64->op_own = MLX5_CQE_INVALID << 4;
  596. }
  597. }
  598. static int create_cq_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq,
  599. int entries, int cqe_size,
  600. struct mlx5_create_cq_mbox_in **cqb,
  601. int *index, int *inlen)
  602. {
  603. int err;
  604. err = mlx5_db_alloc(dev->mdev, &cq->db);
  605. if (err)
  606. return err;
  607. cq->mcq.set_ci_db = cq->db.db;
  608. cq->mcq.arm_db = cq->db.db + 1;
  609. cq->mcq.cqe_sz = cqe_size;
  610. err = alloc_cq_buf(dev, &cq->buf, entries, cqe_size);
  611. if (err)
  612. goto err_db;
  613. init_cq_buf(cq, &cq->buf);
  614. *inlen = sizeof(**cqb) + sizeof(*(*cqb)->pas) * cq->buf.buf.npages;
  615. *cqb = mlx5_vzalloc(*inlen);
  616. if (!*cqb) {
  617. err = -ENOMEM;
  618. goto err_buf;
  619. }
  620. mlx5_fill_page_array(&cq->buf.buf, (*cqb)->pas);
  621. (*cqb)->ctx.log_pg_sz = cq->buf.buf.page_shift - MLX5_ADAPTER_PAGE_SHIFT;
  622. *index = dev->mdev->priv.uuari.uars[0].index;
  623. return 0;
  624. err_buf:
  625. free_cq_buf(dev, &cq->buf);
  626. err_db:
  627. mlx5_db_free(dev->mdev, &cq->db);
  628. return err;
  629. }
  630. static void destroy_cq_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq)
  631. {
  632. free_cq_buf(dev, &cq->buf);
  633. mlx5_db_free(dev->mdev, &cq->db);
  634. }
  635. struct ib_cq *mlx5_ib_create_cq(struct ib_device *ibdev, int entries,
  636. int vector, struct ib_ucontext *context,
  637. struct ib_udata *udata)
  638. {
  639. struct mlx5_create_cq_mbox_in *cqb = NULL;
  640. struct mlx5_ib_dev *dev = to_mdev(ibdev);
  641. struct mlx5_ib_cq *cq;
  642. int uninitialized_var(index);
  643. int uninitialized_var(inlen);
  644. int cqe_size;
  645. int irqn;
  646. int eqn;
  647. int err;
  648. if (entries < 0)
  649. return ERR_PTR(-EINVAL);
  650. entries = roundup_pow_of_two(entries + 1);
  651. if (entries > dev->mdev->caps.gen.max_cqes)
  652. return ERR_PTR(-EINVAL);
  653. cq = kzalloc(sizeof(*cq), GFP_KERNEL);
  654. if (!cq)
  655. return ERR_PTR(-ENOMEM);
  656. cq->ibcq.cqe = entries - 1;
  657. mutex_init(&cq->resize_mutex);
  658. spin_lock_init(&cq->lock);
  659. cq->resize_buf = NULL;
  660. cq->resize_umem = NULL;
  661. if (context) {
  662. err = create_cq_user(dev, udata, context, cq, entries,
  663. &cqb, &cqe_size, &index, &inlen);
  664. if (err)
  665. goto err_create;
  666. } else {
  667. /* for now choose 64 bytes till we have a proper interface */
  668. cqe_size = 64;
  669. err = create_cq_kernel(dev, cq, entries, cqe_size, &cqb,
  670. &index, &inlen);
  671. if (err)
  672. goto err_create;
  673. }
  674. cq->cqe_size = cqe_size;
  675. cqb->ctx.cqe_sz_flags = cqe_sz_to_mlx_sz(cqe_size) << 5;
  676. cqb->ctx.log_sz_usr_page = cpu_to_be32((ilog2(entries) << 24) | index);
  677. err = mlx5_vector2eqn(dev, vector, &eqn, &irqn);
  678. if (err)
  679. goto err_cqb;
  680. cqb->ctx.c_eqn = cpu_to_be16(eqn);
  681. cqb->ctx.db_record_addr = cpu_to_be64(cq->db.dma);
  682. err = mlx5_core_create_cq(dev->mdev, &cq->mcq, cqb, inlen);
  683. if (err)
  684. goto err_cqb;
  685. mlx5_ib_dbg(dev, "cqn 0x%x\n", cq->mcq.cqn);
  686. cq->mcq.irqn = irqn;
  687. cq->mcq.comp = mlx5_ib_cq_comp;
  688. cq->mcq.event = mlx5_ib_cq_event;
  689. if (context)
  690. if (ib_copy_to_udata(udata, &cq->mcq.cqn, sizeof(__u32))) {
  691. err = -EFAULT;
  692. goto err_cmd;
  693. }
  694. kvfree(cqb);
  695. return &cq->ibcq;
  696. err_cmd:
  697. mlx5_core_destroy_cq(dev->mdev, &cq->mcq);
  698. err_cqb:
  699. kvfree(cqb);
  700. if (context)
  701. destroy_cq_user(cq, context);
  702. else
  703. destroy_cq_kernel(dev, cq);
  704. err_create:
  705. kfree(cq);
  706. return ERR_PTR(err);
  707. }
  708. int mlx5_ib_destroy_cq(struct ib_cq *cq)
  709. {
  710. struct mlx5_ib_dev *dev = to_mdev(cq->device);
  711. struct mlx5_ib_cq *mcq = to_mcq(cq);
  712. struct ib_ucontext *context = NULL;
  713. if (cq->uobject)
  714. context = cq->uobject->context;
  715. mlx5_core_destroy_cq(dev->mdev, &mcq->mcq);
  716. if (context)
  717. destroy_cq_user(mcq, context);
  718. else
  719. destroy_cq_kernel(dev, mcq);
  720. kfree(mcq);
  721. return 0;
  722. }
  723. static int is_equal_rsn(struct mlx5_cqe64 *cqe64, u32 rsn)
  724. {
  725. return rsn == (ntohl(cqe64->sop_drop_qpn) & 0xffffff);
  726. }
  727. void __mlx5_ib_cq_clean(struct mlx5_ib_cq *cq, u32 rsn, struct mlx5_ib_srq *srq)
  728. {
  729. struct mlx5_cqe64 *cqe64, *dest64;
  730. void *cqe, *dest;
  731. u32 prod_index;
  732. int nfreed = 0;
  733. u8 owner_bit;
  734. if (!cq)
  735. return;
  736. /* First we need to find the current producer index, so we
  737. * know where to start cleaning from. It doesn't matter if HW
  738. * adds new entries after this loop -- the QP we're worried
  739. * about is already in RESET, so the new entries won't come
  740. * from our QP and therefore don't need to be checked.
  741. */
  742. for (prod_index = cq->mcq.cons_index; get_sw_cqe(cq, prod_index); prod_index++)
  743. if (prod_index == cq->mcq.cons_index + cq->ibcq.cqe)
  744. break;
  745. /* Now sweep backwards through the CQ, removing CQ entries
  746. * that match our QP by copying older entries on top of them.
  747. */
  748. while ((int) --prod_index - (int) cq->mcq.cons_index >= 0) {
  749. cqe = get_cqe(cq, prod_index & cq->ibcq.cqe);
  750. cqe64 = (cq->mcq.cqe_sz == 64) ? cqe : cqe + 64;
  751. if (is_equal_rsn(cqe64, rsn)) {
  752. if (srq && (ntohl(cqe64->srqn) & 0xffffff))
  753. mlx5_ib_free_srq_wqe(srq, be16_to_cpu(cqe64->wqe_counter));
  754. ++nfreed;
  755. } else if (nfreed) {
  756. dest = get_cqe(cq, (prod_index + nfreed) & cq->ibcq.cqe);
  757. dest64 = (cq->mcq.cqe_sz == 64) ? dest : dest + 64;
  758. owner_bit = dest64->op_own & MLX5_CQE_OWNER_MASK;
  759. memcpy(dest, cqe, cq->mcq.cqe_sz);
  760. dest64->op_own = owner_bit |
  761. (dest64->op_own & ~MLX5_CQE_OWNER_MASK);
  762. }
  763. }
  764. if (nfreed) {
  765. cq->mcq.cons_index += nfreed;
  766. /* Make sure update of buffer contents is done before
  767. * updating consumer index.
  768. */
  769. wmb();
  770. mlx5_cq_set_ci(&cq->mcq);
  771. }
  772. }
  773. void mlx5_ib_cq_clean(struct mlx5_ib_cq *cq, u32 qpn, struct mlx5_ib_srq *srq)
  774. {
  775. if (!cq)
  776. return;
  777. spin_lock_irq(&cq->lock);
  778. __mlx5_ib_cq_clean(cq, qpn, srq);
  779. spin_unlock_irq(&cq->lock);
  780. }
  781. int mlx5_ib_modify_cq(struct ib_cq *cq, u16 cq_count, u16 cq_period)
  782. {
  783. struct mlx5_modify_cq_mbox_in *in;
  784. struct mlx5_ib_dev *dev = to_mdev(cq->device);
  785. struct mlx5_ib_cq *mcq = to_mcq(cq);
  786. int err;
  787. u32 fsel;
  788. if (!(dev->mdev->caps.gen.flags & MLX5_DEV_CAP_FLAG_CQ_MODER))
  789. return -ENOSYS;
  790. in = kzalloc(sizeof(*in), GFP_KERNEL);
  791. if (!in)
  792. return -ENOMEM;
  793. in->cqn = cpu_to_be32(mcq->mcq.cqn);
  794. fsel = (MLX5_CQ_MODIFY_PERIOD | MLX5_CQ_MODIFY_COUNT);
  795. in->ctx.cq_period = cpu_to_be16(cq_period);
  796. in->ctx.cq_max_count = cpu_to_be16(cq_count);
  797. in->field_select = cpu_to_be32(fsel);
  798. err = mlx5_core_modify_cq(dev->mdev, &mcq->mcq, in, sizeof(*in));
  799. kfree(in);
  800. if (err)
  801. mlx5_ib_warn(dev, "modify cq 0x%x failed\n", mcq->mcq.cqn);
  802. return err;
  803. }
  804. static int resize_user(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq,
  805. int entries, struct ib_udata *udata, int *npas,
  806. int *page_shift, int *cqe_size)
  807. {
  808. struct mlx5_ib_resize_cq ucmd;
  809. struct ib_umem *umem;
  810. int err;
  811. int npages;
  812. struct ib_ucontext *context = cq->buf.umem->context;
  813. err = ib_copy_from_udata(&ucmd, udata, sizeof(ucmd));
  814. if (err)
  815. return err;
  816. if (ucmd.reserved0 || ucmd.reserved1)
  817. return -EINVAL;
  818. umem = ib_umem_get(context, ucmd.buf_addr, entries * ucmd.cqe_size,
  819. IB_ACCESS_LOCAL_WRITE, 1);
  820. if (IS_ERR(umem)) {
  821. err = PTR_ERR(umem);
  822. return err;
  823. }
  824. mlx5_ib_cont_pages(umem, ucmd.buf_addr, &npages, page_shift,
  825. npas, NULL);
  826. cq->resize_umem = umem;
  827. *cqe_size = ucmd.cqe_size;
  828. return 0;
  829. }
  830. static void un_resize_user(struct mlx5_ib_cq *cq)
  831. {
  832. ib_umem_release(cq->resize_umem);
  833. }
  834. static int resize_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq,
  835. int entries, int cqe_size)
  836. {
  837. int err;
  838. cq->resize_buf = kzalloc(sizeof(*cq->resize_buf), GFP_KERNEL);
  839. if (!cq->resize_buf)
  840. return -ENOMEM;
  841. err = alloc_cq_buf(dev, cq->resize_buf, entries, cqe_size);
  842. if (err)
  843. goto ex;
  844. init_cq_buf(cq, cq->resize_buf);
  845. return 0;
  846. ex:
  847. kfree(cq->resize_buf);
  848. return err;
  849. }
  850. static void un_resize_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq)
  851. {
  852. free_cq_buf(dev, cq->resize_buf);
  853. cq->resize_buf = NULL;
  854. }
  855. static int copy_resize_cqes(struct mlx5_ib_cq *cq)
  856. {
  857. struct mlx5_ib_dev *dev = to_mdev(cq->ibcq.device);
  858. struct mlx5_cqe64 *scqe64;
  859. struct mlx5_cqe64 *dcqe64;
  860. void *start_cqe;
  861. void *scqe;
  862. void *dcqe;
  863. int ssize;
  864. int dsize;
  865. int i;
  866. u8 sw_own;
  867. ssize = cq->buf.cqe_size;
  868. dsize = cq->resize_buf->cqe_size;
  869. if (ssize != dsize) {
  870. mlx5_ib_warn(dev, "resize from different cqe size is not supported\n");
  871. return -EINVAL;
  872. }
  873. i = cq->mcq.cons_index;
  874. scqe = get_sw_cqe(cq, i);
  875. scqe64 = ssize == 64 ? scqe : scqe + 64;
  876. start_cqe = scqe;
  877. if (!scqe) {
  878. mlx5_ib_warn(dev, "expected cqe in sw ownership\n");
  879. return -EINVAL;
  880. }
  881. while ((scqe64->op_own >> 4) != MLX5_CQE_RESIZE_CQ) {
  882. dcqe = get_cqe_from_buf(cq->resize_buf,
  883. (i + 1) & (cq->resize_buf->nent),
  884. dsize);
  885. dcqe64 = dsize == 64 ? dcqe : dcqe + 64;
  886. sw_own = sw_ownership_bit(i + 1, cq->resize_buf->nent);
  887. memcpy(dcqe, scqe, dsize);
  888. dcqe64->op_own = (dcqe64->op_own & ~MLX5_CQE_OWNER_MASK) | sw_own;
  889. ++i;
  890. scqe = get_sw_cqe(cq, i);
  891. scqe64 = ssize == 64 ? scqe : scqe + 64;
  892. if (!scqe) {
  893. mlx5_ib_warn(dev, "expected cqe in sw ownership\n");
  894. return -EINVAL;
  895. }
  896. if (scqe == start_cqe) {
  897. pr_warn("resize CQ failed to get resize CQE, CQN 0x%x\n",
  898. cq->mcq.cqn);
  899. return -ENOMEM;
  900. }
  901. }
  902. ++cq->mcq.cons_index;
  903. return 0;
  904. }
  905. int mlx5_ib_resize_cq(struct ib_cq *ibcq, int entries, struct ib_udata *udata)
  906. {
  907. struct mlx5_ib_dev *dev = to_mdev(ibcq->device);
  908. struct mlx5_ib_cq *cq = to_mcq(ibcq);
  909. struct mlx5_modify_cq_mbox_in *in;
  910. int err;
  911. int npas;
  912. int page_shift;
  913. int inlen;
  914. int uninitialized_var(cqe_size);
  915. unsigned long flags;
  916. if (!(dev->mdev->caps.gen.flags & MLX5_DEV_CAP_FLAG_RESIZE_CQ)) {
  917. pr_info("Firmware does not support resize CQ\n");
  918. return -ENOSYS;
  919. }
  920. if (entries < 1)
  921. return -EINVAL;
  922. entries = roundup_pow_of_two(entries + 1);
  923. if (entries > dev->mdev->caps.gen.max_cqes + 1)
  924. return -EINVAL;
  925. if (entries == ibcq->cqe + 1)
  926. return 0;
  927. mutex_lock(&cq->resize_mutex);
  928. if (udata) {
  929. err = resize_user(dev, cq, entries, udata, &npas, &page_shift,
  930. &cqe_size);
  931. } else {
  932. cqe_size = 64;
  933. err = resize_kernel(dev, cq, entries, cqe_size);
  934. if (!err) {
  935. npas = cq->resize_buf->buf.npages;
  936. page_shift = cq->resize_buf->buf.page_shift;
  937. }
  938. }
  939. if (err)
  940. goto ex;
  941. inlen = sizeof(*in) + npas * sizeof(in->pas[0]);
  942. in = mlx5_vzalloc(inlen);
  943. if (!in) {
  944. err = -ENOMEM;
  945. goto ex_resize;
  946. }
  947. if (udata)
  948. mlx5_ib_populate_pas(dev, cq->resize_umem, page_shift,
  949. in->pas, 0);
  950. else
  951. mlx5_fill_page_array(&cq->resize_buf->buf, in->pas);
  952. in->field_select = cpu_to_be32(MLX5_MODIFY_CQ_MASK_LOG_SIZE |
  953. MLX5_MODIFY_CQ_MASK_PG_OFFSET |
  954. MLX5_MODIFY_CQ_MASK_PG_SIZE);
  955. in->ctx.log_pg_sz = page_shift - MLX5_ADAPTER_PAGE_SHIFT;
  956. in->ctx.cqe_sz_flags = cqe_sz_to_mlx_sz(cqe_size) << 5;
  957. in->ctx.page_offset = 0;
  958. in->ctx.log_sz_usr_page = cpu_to_be32(ilog2(entries) << 24);
  959. in->hdr.opmod = cpu_to_be16(MLX5_CQ_OPMOD_RESIZE);
  960. in->cqn = cpu_to_be32(cq->mcq.cqn);
  961. err = mlx5_core_modify_cq(dev->mdev, &cq->mcq, in, inlen);
  962. if (err)
  963. goto ex_alloc;
  964. if (udata) {
  965. cq->ibcq.cqe = entries - 1;
  966. ib_umem_release(cq->buf.umem);
  967. cq->buf.umem = cq->resize_umem;
  968. cq->resize_umem = NULL;
  969. } else {
  970. struct mlx5_ib_cq_buf tbuf;
  971. int resized = 0;
  972. spin_lock_irqsave(&cq->lock, flags);
  973. if (cq->resize_buf) {
  974. err = copy_resize_cqes(cq);
  975. if (!err) {
  976. tbuf = cq->buf;
  977. cq->buf = *cq->resize_buf;
  978. kfree(cq->resize_buf);
  979. cq->resize_buf = NULL;
  980. resized = 1;
  981. }
  982. }
  983. cq->ibcq.cqe = entries - 1;
  984. spin_unlock_irqrestore(&cq->lock, flags);
  985. if (resized)
  986. free_cq_buf(dev, &tbuf);
  987. }
  988. mutex_unlock(&cq->resize_mutex);
  989. kvfree(in);
  990. return 0;
  991. ex_alloc:
  992. kvfree(in);
  993. ex_resize:
  994. if (udata)
  995. un_resize_user(cq);
  996. else
  997. un_resize_kernel(dev, cq);
  998. ex:
  999. mutex_unlock(&cq->resize_mutex);
  1000. return err;
  1001. }
  1002. int mlx5_ib_get_cqe_size(struct mlx5_ib_dev *dev, struct ib_cq *ibcq)
  1003. {
  1004. struct mlx5_ib_cq *cq;
  1005. if (!ibcq)
  1006. return 128;
  1007. cq = to_mcq(ibcq);
  1008. return cq->cqe_size;
  1009. }