srq.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497
  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/module.h>
  33. #include <linux/mlx5/qp.h>
  34. #include <linux/mlx5/srq.h>
  35. #include <linux/slab.h>
  36. #include <rdma/ib_umem.h>
  37. #include <rdma/ib_user_verbs.h>
  38. #include "mlx5_ib.h"
  39. /* not supported currently */
  40. static int srq_signature;
  41. static void *get_wqe(struct mlx5_ib_srq *srq, int n)
  42. {
  43. return mlx5_buf_offset(&srq->buf, n << srq->msrq.wqe_shift);
  44. }
  45. static void mlx5_ib_srq_event(struct mlx5_core_srq *srq, enum mlx5_event type)
  46. {
  47. struct ib_event event;
  48. struct ib_srq *ibsrq = &to_mibsrq(srq)->ibsrq;
  49. if (ibsrq->event_handler) {
  50. event.device = ibsrq->device;
  51. event.element.srq = ibsrq;
  52. switch (type) {
  53. case MLX5_EVENT_TYPE_SRQ_RQ_LIMIT:
  54. event.event = IB_EVENT_SRQ_LIMIT_REACHED;
  55. break;
  56. case MLX5_EVENT_TYPE_SRQ_CATAS_ERROR:
  57. event.event = IB_EVENT_SRQ_ERR;
  58. break;
  59. default:
  60. pr_warn("mlx5_ib: Unexpected event type %d on SRQ %06x\n",
  61. type, srq->srqn);
  62. return;
  63. }
  64. ibsrq->event_handler(&event, ibsrq->srq_context);
  65. }
  66. }
  67. static int create_srq_user(struct ib_pd *pd, struct mlx5_ib_srq *srq,
  68. struct mlx5_srq_attr *in,
  69. struct ib_udata *udata, int buf_size)
  70. {
  71. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  72. struct mlx5_ib_create_srq ucmd = {};
  73. size_t ucmdlen;
  74. int err;
  75. int npages;
  76. int page_shift;
  77. int ncont;
  78. u32 offset;
  79. u32 uidx = MLX5_IB_DEFAULT_UIDX;
  80. ucmdlen = min(udata->inlen, sizeof(ucmd));
  81. if (ib_copy_from_udata(&ucmd, udata, ucmdlen)) {
  82. mlx5_ib_dbg(dev, "failed copy udata\n");
  83. return -EFAULT;
  84. }
  85. if (ucmd.reserved0 || ucmd.reserved1)
  86. return -EINVAL;
  87. if (udata->inlen > sizeof(ucmd) &&
  88. !ib_is_udata_cleared(udata, sizeof(ucmd),
  89. udata->inlen - sizeof(ucmd)))
  90. return -EINVAL;
  91. if (in->type == IB_SRQT_XRC) {
  92. err = get_srq_user_index(to_mucontext(pd->uobject->context),
  93. &ucmd, udata->inlen, &uidx);
  94. if (err)
  95. return err;
  96. }
  97. srq->wq_sig = !!(ucmd.flags & MLX5_SRQ_FLAG_SIGNATURE);
  98. srq->umem = ib_umem_get(pd->uobject->context, ucmd.buf_addr, buf_size,
  99. 0, 0);
  100. if (IS_ERR(srq->umem)) {
  101. mlx5_ib_dbg(dev, "failed umem get, size %d\n", buf_size);
  102. err = PTR_ERR(srq->umem);
  103. return err;
  104. }
  105. mlx5_ib_cont_pages(srq->umem, ucmd.buf_addr, 0, &npages,
  106. &page_shift, &ncont, NULL);
  107. err = mlx5_ib_get_buf_offset(ucmd.buf_addr, page_shift,
  108. &offset);
  109. if (err) {
  110. mlx5_ib_warn(dev, "bad offset\n");
  111. goto err_umem;
  112. }
  113. in->pas = mlx5_vzalloc(sizeof(*in->pas) * ncont);
  114. if (!in->pas) {
  115. err = -ENOMEM;
  116. goto err_umem;
  117. }
  118. mlx5_ib_populate_pas(dev, srq->umem, page_shift, in->pas, 0);
  119. err = mlx5_ib_db_map_user(to_mucontext(pd->uobject->context),
  120. ucmd.db_addr, &srq->db);
  121. if (err) {
  122. mlx5_ib_dbg(dev, "map doorbell failed\n");
  123. goto err_in;
  124. }
  125. in->log_page_size = page_shift - MLX5_ADAPTER_PAGE_SHIFT;
  126. in->page_offset = offset;
  127. if (MLX5_CAP_GEN(dev->mdev, cqe_version) == MLX5_CQE_VERSION_V1 &&
  128. in->type == IB_SRQT_XRC)
  129. in->user_index = uidx;
  130. return 0;
  131. err_in:
  132. kvfree(in->pas);
  133. err_umem:
  134. ib_umem_release(srq->umem);
  135. return err;
  136. }
  137. static int create_srq_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_srq *srq,
  138. struct mlx5_srq_attr *in, int buf_size)
  139. {
  140. int err;
  141. int i;
  142. struct mlx5_wqe_srq_next_seg *next;
  143. int page_shift;
  144. int npages;
  145. err = mlx5_db_alloc(dev->mdev, &srq->db);
  146. if (err) {
  147. mlx5_ib_warn(dev, "alloc dbell rec failed\n");
  148. return err;
  149. }
  150. if (mlx5_buf_alloc(dev->mdev, buf_size, &srq->buf)) {
  151. mlx5_ib_dbg(dev, "buf alloc failed\n");
  152. err = -ENOMEM;
  153. goto err_db;
  154. }
  155. page_shift = srq->buf.page_shift;
  156. srq->head = 0;
  157. srq->tail = srq->msrq.max - 1;
  158. srq->wqe_ctr = 0;
  159. for (i = 0; i < srq->msrq.max; i++) {
  160. next = get_wqe(srq, i);
  161. next->next_wqe_index =
  162. cpu_to_be16((i + 1) & (srq->msrq.max - 1));
  163. }
  164. npages = DIV_ROUND_UP(srq->buf.npages, 1 << (page_shift - PAGE_SHIFT));
  165. mlx5_ib_dbg(dev, "buf_size %d, page_shift %d, npages %d, calc npages %d\n",
  166. buf_size, page_shift, srq->buf.npages, npages);
  167. in->pas = mlx5_vzalloc(sizeof(*in->pas) * npages);
  168. if (!in->pas) {
  169. err = -ENOMEM;
  170. goto err_buf;
  171. }
  172. mlx5_fill_page_array(&srq->buf, in->pas);
  173. srq->wrid = kmalloc(srq->msrq.max * sizeof(u64), GFP_KERNEL);
  174. if (!srq->wrid) {
  175. err = -ENOMEM;
  176. goto err_in;
  177. }
  178. srq->wq_sig = !!srq_signature;
  179. in->log_page_size = page_shift - MLX5_ADAPTER_PAGE_SHIFT;
  180. if (MLX5_CAP_GEN(dev->mdev, cqe_version) == MLX5_CQE_VERSION_V1 &&
  181. in->type == IB_SRQT_XRC)
  182. in->user_index = MLX5_IB_DEFAULT_UIDX;
  183. return 0;
  184. err_in:
  185. kvfree(in->pas);
  186. err_buf:
  187. mlx5_buf_free(dev->mdev, &srq->buf);
  188. err_db:
  189. mlx5_db_free(dev->mdev, &srq->db);
  190. return err;
  191. }
  192. static void destroy_srq_user(struct ib_pd *pd, struct mlx5_ib_srq *srq)
  193. {
  194. mlx5_ib_db_unmap_user(to_mucontext(pd->uobject->context), &srq->db);
  195. ib_umem_release(srq->umem);
  196. }
  197. static void destroy_srq_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_srq *srq)
  198. {
  199. kfree(srq->wrid);
  200. mlx5_buf_free(dev->mdev, &srq->buf);
  201. mlx5_db_free(dev->mdev, &srq->db);
  202. }
  203. struct ib_srq *mlx5_ib_create_srq(struct ib_pd *pd,
  204. struct ib_srq_init_attr *init_attr,
  205. struct ib_udata *udata)
  206. {
  207. struct mlx5_ib_dev *dev = to_mdev(pd->device);
  208. struct mlx5_ib_srq *srq;
  209. int desc_size;
  210. int buf_size;
  211. int err;
  212. struct mlx5_srq_attr in = {0};
  213. __u32 max_srq_wqes = 1 << MLX5_CAP_GEN(dev->mdev, log_max_srq_sz);
  214. /* Sanity check SRQ size before proceeding */
  215. if (init_attr->attr.max_wr >= max_srq_wqes) {
  216. mlx5_ib_dbg(dev, "max_wr %d, cap %d\n",
  217. init_attr->attr.max_wr,
  218. max_srq_wqes);
  219. return ERR_PTR(-EINVAL);
  220. }
  221. srq = kmalloc(sizeof(*srq), GFP_KERNEL);
  222. if (!srq)
  223. return ERR_PTR(-ENOMEM);
  224. mutex_init(&srq->mutex);
  225. spin_lock_init(&srq->lock);
  226. srq->msrq.max = roundup_pow_of_two(init_attr->attr.max_wr + 1);
  227. srq->msrq.max_gs = init_attr->attr.max_sge;
  228. desc_size = sizeof(struct mlx5_wqe_srq_next_seg) +
  229. srq->msrq.max_gs * sizeof(struct mlx5_wqe_data_seg);
  230. desc_size = roundup_pow_of_two(desc_size);
  231. desc_size = max_t(int, 32, desc_size);
  232. srq->msrq.max_avail_gather = (desc_size - sizeof(struct mlx5_wqe_srq_next_seg)) /
  233. sizeof(struct mlx5_wqe_data_seg);
  234. srq->msrq.wqe_shift = ilog2(desc_size);
  235. buf_size = srq->msrq.max * desc_size;
  236. mlx5_ib_dbg(dev, "desc_size 0x%x, req wr 0x%x, srq size 0x%x, max_gs 0x%x, max_avail_gather 0x%x\n",
  237. desc_size, init_attr->attr.max_wr, srq->msrq.max, srq->msrq.max_gs,
  238. srq->msrq.max_avail_gather);
  239. in.type = init_attr->srq_type;
  240. if (pd->uobject)
  241. err = create_srq_user(pd, srq, &in, udata, buf_size);
  242. else
  243. err = create_srq_kernel(dev, srq, &in, buf_size);
  244. if (err) {
  245. mlx5_ib_warn(dev, "create srq %s failed, err %d\n",
  246. pd->uobject ? "user" : "kernel", err);
  247. goto err_srq;
  248. }
  249. in.log_size = ilog2(srq->msrq.max);
  250. in.wqe_shift = srq->msrq.wqe_shift - 4;
  251. if (srq->wq_sig)
  252. in.flags |= MLX5_SRQ_FLAG_WQ_SIG;
  253. if (init_attr->srq_type == IB_SRQT_XRC) {
  254. in.xrcd = to_mxrcd(init_attr->ext.xrc.xrcd)->xrcdn;
  255. in.cqn = to_mcq(init_attr->ext.xrc.cq)->mcq.cqn;
  256. } else if (init_attr->srq_type == IB_SRQT_BASIC) {
  257. in.xrcd = to_mxrcd(dev->devr.x0)->xrcdn;
  258. in.cqn = to_mcq(dev->devr.c0)->mcq.cqn;
  259. }
  260. in.pd = to_mpd(pd)->pdn;
  261. in.db_record = srq->db.dma;
  262. err = mlx5_core_create_srq(dev->mdev, &srq->msrq, &in);
  263. kvfree(in.pas);
  264. if (err) {
  265. mlx5_ib_dbg(dev, "create SRQ failed, err %d\n", err);
  266. goto err_usr_kern_srq;
  267. }
  268. mlx5_ib_dbg(dev, "create SRQ with srqn 0x%x\n", srq->msrq.srqn);
  269. srq->msrq.event = mlx5_ib_srq_event;
  270. srq->ibsrq.ext.xrc.srq_num = srq->msrq.srqn;
  271. if (pd->uobject)
  272. if (ib_copy_to_udata(udata, &srq->msrq.srqn, sizeof(__u32))) {
  273. mlx5_ib_dbg(dev, "copy to user failed\n");
  274. err = -EFAULT;
  275. goto err_core;
  276. }
  277. init_attr->attr.max_wr = srq->msrq.max - 1;
  278. return &srq->ibsrq;
  279. err_core:
  280. mlx5_core_destroy_srq(dev->mdev, &srq->msrq);
  281. err_usr_kern_srq:
  282. if (pd->uobject)
  283. destroy_srq_user(pd, srq);
  284. else
  285. destroy_srq_kernel(dev, srq);
  286. err_srq:
  287. kfree(srq);
  288. return ERR_PTR(err);
  289. }
  290. int mlx5_ib_modify_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr,
  291. enum ib_srq_attr_mask attr_mask, struct ib_udata *udata)
  292. {
  293. struct mlx5_ib_dev *dev = to_mdev(ibsrq->device);
  294. struct mlx5_ib_srq *srq = to_msrq(ibsrq);
  295. int ret;
  296. /* We don't support resizing SRQs yet */
  297. if (attr_mask & IB_SRQ_MAX_WR)
  298. return -EINVAL;
  299. if (attr_mask & IB_SRQ_LIMIT) {
  300. if (attr->srq_limit >= srq->msrq.max)
  301. return -EINVAL;
  302. mutex_lock(&srq->mutex);
  303. ret = mlx5_core_arm_srq(dev->mdev, &srq->msrq, attr->srq_limit, 1);
  304. mutex_unlock(&srq->mutex);
  305. if (ret)
  306. return ret;
  307. }
  308. return 0;
  309. }
  310. int mlx5_ib_query_srq(struct ib_srq *ibsrq, struct ib_srq_attr *srq_attr)
  311. {
  312. struct mlx5_ib_dev *dev = to_mdev(ibsrq->device);
  313. struct mlx5_ib_srq *srq = to_msrq(ibsrq);
  314. int ret;
  315. struct mlx5_srq_attr *out;
  316. out = kzalloc(sizeof(*out), GFP_KERNEL);
  317. if (!out)
  318. return -ENOMEM;
  319. ret = mlx5_core_query_srq(dev->mdev, &srq->msrq, out);
  320. if (ret)
  321. goto out_box;
  322. srq_attr->srq_limit = out->lwm;
  323. srq_attr->max_wr = srq->msrq.max - 1;
  324. srq_attr->max_sge = srq->msrq.max_gs;
  325. out_box:
  326. kfree(out);
  327. return ret;
  328. }
  329. int mlx5_ib_destroy_srq(struct ib_srq *srq)
  330. {
  331. struct mlx5_ib_dev *dev = to_mdev(srq->device);
  332. struct mlx5_ib_srq *msrq = to_msrq(srq);
  333. mlx5_core_destroy_srq(dev->mdev, &msrq->msrq);
  334. if (srq->uobject) {
  335. mlx5_ib_db_unmap_user(to_mucontext(srq->uobject->context), &msrq->db);
  336. ib_umem_release(msrq->umem);
  337. } else {
  338. destroy_srq_kernel(dev, msrq);
  339. }
  340. kfree(srq);
  341. return 0;
  342. }
  343. void mlx5_ib_free_srq_wqe(struct mlx5_ib_srq *srq, int wqe_index)
  344. {
  345. struct mlx5_wqe_srq_next_seg *next;
  346. /* always called with interrupts disabled. */
  347. spin_lock(&srq->lock);
  348. next = get_wqe(srq, srq->tail);
  349. next->next_wqe_index = cpu_to_be16(wqe_index);
  350. srq->tail = wqe_index;
  351. spin_unlock(&srq->lock);
  352. }
  353. int mlx5_ib_post_srq_recv(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
  354. struct ib_recv_wr **bad_wr)
  355. {
  356. struct mlx5_ib_srq *srq = to_msrq(ibsrq);
  357. struct mlx5_wqe_srq_next_seg *next;
  358. struct mlx5_wqe_data_seg *scat;
  359. struct mlx5_ib_dev *dev = to_mdev(ibsrq->device);
  360. struct mlx5_core_dev *mdev = dev->mdev;
  361. unsigned long flags;
  362. int err = 0;
  363. int nreq;
  364. int i;
  365. spin_lock_irqsave(&srq->lock, flags);
  366. if (mdev->state == MLX5_DEVICE_STATE_INTERNAL_ERROR) {
  367. err = -EIO;
  368. *bad_wr = wr;
  369. goto out;
  370. }
  371. for (nreq = 0; wr; nreq++, wr = wr->next) {
  372. if (unlikely(wr->num_sge > srq->msrq.max_gs)) {
  373. err = -EINVAL;
  374. *bad_wr = wr;
  375. break;
  376. }
  377. if (unlikely(srq->head == srq->tail)) {
  378. err = -ENOMEM;
  379. *bad_wr = wr;
  380. break;
  381. }
  382. srq->wrid[srq->head] = wr->wr_id;
  383. next = get_wqe(srq, srq->head);
  384. srq->head = be16_to_cpu(next->next_wqe_index);
  385. scat = (struct mlx5_wqe_data_seg *)(next + 1);
  386. for (i = 0; i < wr->num_sge; i++) {
  387. scat[i].byte_count = cpu_to_be32(wr->sg_list[i].length);
  388. scat[i].lkey = cpu_to_be32(wr->sg_list[i].lkey);
  389. scat[i].addr = cpu_to_be64(wr->sg_list[i].addr);
  390. }
  391. if (i < srq->msrq.max_avail_gather) {
  392. scat[i].byte_count = 0;
  393. scat[i].lkey = cpu_to_be32(MLX5_INVALID_LKEY);
  394. scat[i].addr = 0;
  395. }
  396. }
  397. if (likely(nreq)) {
  398. srq->wqe_ctr += nreq;
  399. /* Make sure that descriptors are written before
  400. * doorbell record.
  401. */
  402. wmb();
  403. *srq->db.db = cpu_to_be32(srq->wqe_ctr);
  404. }
  405. out:
  406. spin_unlock_irqrestore(&srq->lock, flags);
  407. return err;
  408. }