srq.c 12 KB

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