cq.c 34 KB

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