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