srq.c 12 KB

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