cq.c 29 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187
  1. /*
  2. * Copyright (c) 2013, Mellanox Technologies inc. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. */
  32. #include <linux/kref.h>
  33. #include <rdma/ib_umem.h>
  34. #include <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. int 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.set_ci_db = 0;
  610. *cq->mcq.arm_db = 0;
  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, int entries,
  638. int vector, struct ib_ucontext *context,
  639. struct ib_udata *udata)
  640. {
  641. struct mlx5_create_cq_mbox_in *cqb = NULL;
  642. struct mlx5_ib_dev *dev = to_mdev(ibdev);
  643. struct mlx5_ib_cq *cq;
  644. int uninitialized_var(index);
  645. int uninitialized_var(inlen);
  646. int cqe_size;
  647. int irqn;
  648. int eqn;
  649. int err;
  650. if (entries < 0)
  651. return ERR_PTR(-EINVAL);
  652. entries = roundup_pow_of_two(entries + 1);
  653. if (entries > dev->mdev.caps.max_cqes)
  654. return ERR_PTR(-EINVAL);
  655. cq = kzalloc(sizeof(*cq), GFP_KERNEL);
  656. if (!cq)
  657. return ERR_PTR(-ENOMEM);
  658. cq->ibcq.cqe = entries - 1;
  659. mutex_init(&cq->resize_mutex);
  660. spin_lock_init(&cq->lock);
  661. cq->resize_buf = NULL;
  662. cq->resize_umem = NULL;
  663. if (context) {
  664. err = create_cq_user(dev, udata, context, cq, entries,
  665. &cqb, &cqe_size, &index, &inlen);
  666. if (err)
  667. goto err_create;
  668. } else {
  669. /* for now choose 64 bytes till we have a proper interface */
  670. cqe_size = 64;
  671. err = create_cq_kernel(dev, cq, entries, cqe_size, &cqb,
  672. &index, &inlen);
  673. if (err)
  674. goto err_create;
  675. }
  676. cq->cqe_size = cqe_size;
  677. cqb->ctx.cqe_sz_flags = cqe_sz_to_mlx_sz(cqe_size) << 5;
  678. cqb->ctx.log_sz_usr_page = cpu_to_be32((ilog2(entries) << 24) | index);
  679. err = mlx5_vector2eqn(dev, vector, &eqn, &irqn);
  680. if (err)
  681. goto err_cqb;
  682. cqb->ctx.c_eqn = cpu_to_be16(eqn);
  683. cqb->ctx.db_record_addr = cpu_to_be64(cq->db.dma);
  684. err = mlx5_core_create_cq(&dev->mdev, &cq->mcq, cqb, inlen);
  685. if (err)
  686. goto err_cqb;
  687. mlx5_ib_dbg(dev, "cqn 0x%x\n", cq->mcq.cqn);
  688. cq->mcq.irqn = irqn;
  689. cq->mcq.comp = mlx5_ib_cq_comp;
  690. cq->mcq.event = mlx5_ib_cq_event;
  691. if (context)
  692. if (ib_copy_to_udata(udata, &cq->mcq.cqn, sizeof(__u32))) {
  693. err = -EFAULT;
  694. goto err_cmd;
  695. }
  696. mlx5_vfree(cqb);
  697. return &cq->ibcq;
  698. err_cmd:
  699. mlx5_core_destroy_cq(&dev->mdev, &cq->mcq);
  700. err_cqb:
  701. mlx5_vfree(cqb);
  702. if (context)
  703. destroy_cq_user(cq, context);
  704. else
  705. destroy_cq_kernel(dev, cq);
  706. err_create:
  707. kfree(cq);
  708. return ERR_PTR(err);
  709. }
  710. int mlx5_ib_destroy_cq(struct ib_cq *cq)
  711. {
  712. struct mlx5_ib_dev *dev = to_mdev(cq->device);
  713. struct mlx5_ib_cq *mcq = to_mcq(cq);
  714. struct ib_ucontext *context = NULL;
  715. if (cq->uobject)
  716. context = cq->uobject->context;
  717. mlx5_core_destroy_cq(&dev->mdev, &mcq->mcq);
  718. if (context)
  719. destroy_cq_user(mcq, context);
  720. else
  721. destroy_cq_kernel(dev, mcq);
  722. kfree(mcq);
  723. return 0;
  724. }
  725. static int is_equal_rsn(struct mlx5_cqe64 *cqe64, u32 rsn)
  726. {
  727. return rsn == (ntohl(cqe64->sop_drop_qpn) & 0xffffff);
  728. }
  729. void __mlx5_ib_cq_clean(struct mlx5_ib_cq *cq, u32 rsn, struct mlx5_ib_srq *srq)
  730. {
  731. struct mlx5_cqe64 *cqe64, *dest64;
  732. void *cqe, *dest;
  733. u32 prod_index;
  734. int nfreed = 0;
  735. u8 owner_bit;
  736. if (!cq)
  737. return;
  738. /* First we need to find the current producer index, so we
  739. * know where to start cleaning from. It doesn't matter if HW
  740. * adds new entries after this loop -- the QP we're worried
  741. * about is already in RESET, so the new entries won't come
  742. * from our QP and therefore don't need to be checked.
  743. */
  744. for (prod_index = cq->mcq.cons_index; get_sw_cqe(cq, prod_index); prod_index++)
  745. if (prod_index == cq->mcq.cons_index + cq->ibcq.cqe)
  746. break;
  747. /* Now sweep backwards through the CQ, removing CQ entries
  748. * that match our QP by copying older entries on top of them.
  749. */
  750. while ((int) --prod_index - (int) cq->mcq.cons_index >= 0) {
  751. cqe = get_cqe(cq, prod_index & cq->ibcq.cqe);
  752. cqe64 = (cq->mcq.cqe_sz == 64) ? cqe : cqe + 64;
  753. if (is_equal_rsn(cqe64, rsn)) {
  754. if (srq && (ntohl(cqe64->srqn) & 0xffffff))
  755. mlx5_ib_free_srq_wqe(srq, be16_to_cpu(cqe64->wqe_counter));
  756. ++nfreed;
  757. } else if (nfreed) {
  758. dest = get_cqe(cq, (prod_index + nfreed) & cq->ibcq.cqe);
  759. dest64 = (cq->mcq.cqe_sz == 64) ? dest : dest + 64;
  760. owner_bit = dest64->op_own & MLX5_CQE_OWNER_MASK;
  761. memcpy(dest, cqe, cq->mcq.cqe_sz);
  762. dest64->op_own = owner_bit |
  763. (dest64->op_own & ~MLX5_CQE_OWNER_MASK);
  764. }
  765. }
  766. if (nfreed) {
  767. cq->mcq.cons_index += nfreed;
  768. /* Make sure update of buffer contents is done before
  769. * updating consumer index.
  770. */
  771. wmb();
  772. mlx5_cq_set_ci(&cq->mcq);
  773. }
  774. }
  775. void mlx5_ib_cq_clean(struct mlx5_ib_cq *cq, u32 qpn, struct mlx5_ib_srq *srq)
  776. {
  777. if (!cq)
  778. return;
  779. spin_lock_irq(&cq->lock);
  780. __mlx5_ib_cq_clean(cq, qpn, srq);
  781. spin_unlock_irq(&cq->lock);
  782. }
  783. int mlx5_ib_modify_cq(struct ib_cq *cq, u16 cq_count, u16 cq_period)
  784. {
  785. struct mlx5_modify_cq_mbox_in *in;
  786. struct mlx5_ib_dev *dev = to_mdev(cq->device);
  787. struct mlx5_ib_cq *mcq = to_mcq(cq);
  788. int err;
  789. u32 fsel;
  790. if (!(dev->mdev.caps.flags & MLX5_DEV_CAP_FLAG_CQ_MODER))
  791. return -ENOSYS;
  792. in = kzalloc(sizeof(*in), GFP_KERNEL);
  793. if (!in)
  794. return -ENOMEM;
  795. in->cqn = cpu_to_be32(mcq->mcq.cqn);
  796. fsel = (MLX5_CQ_MODIFY_PERIOD | MLX5_CQ_MODIFY_COUNT);
  797. in->ctx.cq_period = cpu_to_be16(cq_period);
  798. in->ctx.cq_max_count = cpu_to_be16(cq_count);
  799. in->field_select = cpu_to_be32(fsel);
  800. err = mlx5_core_modify_cq(&dev->mdev, &mcq->mcq, in, sizeof(*in));
  801. kfree(in);
  802. if (err)
  803. mlx5_ib_warn(dev, "modify cq 0x%x failed\n", mcq->mcq.cqn);
  804. return err;
  805. }
  806. static int resize_user(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq,
  807. int entries, struct ib_udata *udata, int *npas,
  808. int *page_shift, int *cqe_size)
  809. {
  810. struct mlx5_ib_resize_cq ucmd;
  811. struct ib_umem *umem;
  812. int err;
  813. int npages;
  814. struct ib_ucontext *context = cq->buf.umem->context;
  815. err = ib_copy_from_udata(&ucmd, udata, sizeof(ucmd));
  816. if (err)
  817. return err;
  818. if (ucmd.reserved0 || ucmd.reserved1)
  819. return -EINVAL;
  820. umem = ib_umem_get(context, ucmd.buf_addr, entries * ucmd.cqe_size,
  821. IB_ACCESS_LOCAL_WRITE, 1);
  822. if (IS_ERR(umem)) {
  823. err = PTR_ERR(umem);
  824. return err;
  825. }
  826. mlx5_ib_cont_pages(umem, ucmd.buf_addr, &npages, page_shift,
  827. npas, NULL);
  828. cq->resize_umem = umem;
  829. *cqe_size = ucmd.cqe_size;
  830. return 0;
  831. }
  832. static void un_resize_user(struct mlx5_ib_cq *cq)
  833. {
  834. ib_umem_release(cq->resize_umem);
  835. }
  836. static int resize_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq,
  837. int entries, int cqe_size)
  838. {
  839. int err;
  840. cq->resize_buf = kzalloc(sizeof(*cq->resize_buf), GFP_KERNEL);
  841. if (!cq->resize_buf)
  842. return -ENOMEM;
  843. err = alloc_cq_buf(dev, cq->resize_buf, entries, cqe_size);
  844. if (err)
  845. goto ex;
  846. init_cq_buf(cq, cq->resize_buf);
  847. return 0;
  848. ex:
  849. kfree(cq->resize_buf);
  850. return err;
  851. }
  852. static void un_resize_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq)
  853. {
  854. free_cq_buf(dev, cq->resize_buf);
  855. cq->resize_buf = NULL;
  856. }
  857. static int copy_resize_cqes(struct mlx5_ib_cq *cq)
  858. {
  859. struct mlx5_ib_dev *dev = to_mdev(cq->ibcq.device);
  860. struct mlx5_cqe64 *scqe64;
  861. struct mlx5_cqe64 *dcqe64;
  862. void *start_cqe;
  863. void *scqe;
  864. void *dcqe;
  865. int ssize;
  866. int dsize;
  867. int i;
  868. u8 sw_own;
  869. ssize = cq->buf.cqe_size;
  870. dsize = cq->resize_buf->cqe_size;
  871. if (ssize != dsize) {
  872. mlx5_ib_warn(dev, "resize from different cqe size is not supported\n");
  873. return -EINVAL;
  874. }
  875. i = cq->mcq.cons_index;
  876. scqe = get_sw_cqe(cq, i);
  877. scqe64 = ssize == 64 ? scqe : scqe + 64;
  878. start_cqe = scqe;
  879. if (!scqe) {
  880. mlx5_ib_warn(dev, "expected cqe in sw ownership\n");
  881. return -EINVAL;
  882. }
  883. while ((scqe64->op_own >> 4) != MLX5_CQE_RESIZE_CQ) {
  884. dcqe = get_cqe_from_buf(cq->resize_buf,
  885. (i + 1) & (cq->resize_buf->nent),
  886. dsize);
  887. dcqe64 = dsize == 64 ? dcqe : dcqe + 64;
  888. sw_own = sw_ownership_bit(i + 1, cq->resize_buf->nent);
  889. memcpy(dcqe, scqe, dsize);
  890. dcqe64->op_own = (dcqe64->op_own & ~MLX5_CQE_OWNER_MASK) | sw_own;
  891. ++i;
  892. scqe = get_sw_cqe(cq, i);
  893. scqe64 = ssize == 64 ? scqe : scqe + 64;
  894. if (!scqe) {
  895. mlx5_ib_warn(dev, "expected cqe in sw ownership\n");
  896. return -EINVAL;
  897. }
  898. if (scqe == start_cqe) {
  899. pr_warn("resize CQ failed to get resize CQE, CQN 0x%x\n",
  900. cq->mcq.cqn);
  901. return -ENOMEM;
  902. }
  903. }
  904. ++cq->mcq.cons_index;
  905. return 0;
  906. }
  907. int mlx5_ib_resize_cq(struct ib_cq *ibcq, int entries, struct ib_udata *udata)
  908. {
  909. struct mlx5_ib_dev *dev = to_mdev(ibcq->device);
  910. struct mlx5_ib_cq *cq = to_mcq(ibcq);
  911. struct mlx5_modify_cq_mbox_in *in;
  912. int err;
  913. int npas;
  914. int page_shift;
  915. int inlen;
  916. int uninitialized_var(cqe_size);
  917. unsigned long flags;
  918. if (!(dev->mdev.caps.flags & MLX5_DEV_CAP_FLAG_RESIZE_CQ)) {
  919. pr_info("Firmware does not support resize CQ\n");
  920. return -ENOSYS;
  921. }
  922. if (entries < 1)
  923. return -EINVAL;
  924. entries = roundup_pow_of_two(entries + 1);
  925. if (entries > dev->mdev.caps.max_cqes + 1)
  926. return -EINVAL;
  927. if (entries == ibcq->cqe + 1)
  928. return 0;
  929. mutex_lock(&cq->resize_mutex);
  930. if (udata) {
  931. err = resize_user(dev, cq, entries, udata, &npas, &page_shift,
  932. &cqe_size);
  933. } else {
  934. cqe_size = 64;
  935. err = resize_kernel(dev, cq, entries, cqe_size);
  936. if (!err) {
  937. npas = cq->resize_buf->buf.npages;
  938. page_shift = cq->resize_buf->buf.page_shift;
  939. }
  940. }
  941. if (err)
  942. goto ex;
  943. inlen = sizeof(*in) + npas * sizeof(in->pas[0]);
  944. in = mlx5_vzalloc(inlen);
  945. if (!in) {
  946. err = -ENOMEM;
  947. goto ex_resize;
  948. }
  949. if (udata)
  950. mlx5_ib_populate_pas(dev, cq->resize_umem, page_shift,
  951. in->pas, 0);
  952. else
  953. mlx5_fill_page_array(&cq->resize_buf->buf, in->pas);
  954. in->field_select = cpu_to_be32(MLX5_MODIFY_CQ_MASK_LOG_SIZE |
  955. MLX5_MODIFY_CQ_MASK_PG_OFFSET |
  956. MLX5_MODIFY_CQ_MASK_PG_SIZE);
  957. in->ctx.log_pg_sz = page_shift - MLX5_ADAPTER_PAGE_SHIFT;
  958. in->ctx.cqe_sz_flags = cqe_sz_to_mlx_sz(cqe_size) << 5;
  959. in->ctx.page_offset = 0;
  960. in->ctx.log_sz_usr_page = cpu_to_be32(ilog2(entries) << 24);
  961. in->hdr.opmod = cpu_to_be16(MLX5_CQ_OPMOD_RESIZE);
  962. in->cqn = cpu_to_be32(cq->mcq.cqn);
  963. err = mlx5_core_modify_cq(&dev->mdev, &cq->mcq, in, inlen);
  964. if (err)
  965. goto ex_alloc;
  966. if (udata) {
  967. cq->ibcq.cqe = entries - 1;
  968. ib_umem_release(cq->buf.umem);
  969. cq->buf.umem = cq->resize_umem;
  970. cq->resize_umem = NULL;
  971. } else {
  972. struct mlx5_ib_cq_buf tbuf;
  973. int resized = 0;
  974. spin_lock_irqsave(&cq->lock, flags);
  975. if (cq->resize_buf) {
  976. err = copy_resize_cqes(cq);
  977. if (!err) {
  978. tbuf = cq->buf;
  979. cq->buf = *cq->resize_buf;
  980. kfree(cq->resize_buf);
  981. cq->resize_buf = NULL;
  982. resized = 1;
  983. }
  984. }
  985. cq->ibcq.cqe = entries - 1;
  986. spin_unlock_irqrestore(&cq->lock, flags);
  987. if (resized)
  988. free_cq_buf(dev, &tbuf);
  989. }
  990. mutex_unlock(&cq->resize_mutex);
  991. mlx5_vfree(in);
  992. return 0;
  993. ex_alloc:
  994. mlx5_vfree(in);
  995. ex_resize:
  996. if (udata)
  997. un_resize_user(cq);
  998. else
  999. un_resize_kernel(dev, cq);
  1000. ex:
  1001. mutex_unlock(&cq->resize_mutex);
  1002. return err;
  1003. }
  1004. int mlx5_ib_get_cqe_size(struct mlx5_ib_dev *dev, struct ib_cq *ibcq)
  1005. {
  1006. struct mlx5_ib_cq *cq;
  1007. if (!ibcq)
  1008. return 128;
  1009. cq = to_mcq(ibcq);
  1010. return cq->cqe_size;
  1011. }