cq.c 36 KB

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