srq.c 13 KB

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