cq.c 29 KB

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