srq.c 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363
  1. /*
  2. * Copyright (c) 2007 Cisco Systems, Inc. All rights reserved.
  3. * Copyright (c) 2007, 2008 Mellanox Technologies. All rights reserved.
  4. *
  5. * This software is available to you under a choice of one of two
  6. * licenses. You may choose to be licensed under the terms of the GNU
  7. * General Public License (GPL) Version 2, available from the file
  8. * COPYING in the main directory of this source tree, or the
  9. * OpenIB.org BSD license below:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * - Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  19. * - Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials
  22. * provided with the distribution.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  25. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  26. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  27. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  28. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  29. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  30. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  31. * SOFTWARE.
  32. */
  33. #include <linux/mlx4/qp.h>
  34. #include <linux/mlx4/srq.h>
  35. #include <linux/slab.h>
  36. #include "mlx4_ib.h"
  37. #include "user.h"
  38. static void *get_wqe(struct mlx4_ib_srq *srq, int n)
  39. {
  40. return mlx4_buf_offset(&srq->buf, n << srq->msrq.wqe_shift);
  41. }
  42. static void mlx4_ib_srq_event(struct mlx4_srq *srq, enum mlx4_event type)
  43. {
  44. struct ib_event event;
  45. struct ib_srq *ibsrq = &to_mibsrq(srq)->ibsrq;
  46. if (ibsrq->event_handler) {
  47. event.device = ibsrq->device;
  48. event.element.srq = ibsrq;
  49. switch (type) {
  50. case MLX4_EVENT_TYPE_SRQ_LIMIT:
  51. event.event = IB_EVENT_SRQ_LIMIT_REACHED;
  52. break;
  53. case MLX4_EVENT_TYPE_SRQ_CATAS_ERROR:
  54. event.event = IB_EVENT_SRQ_ERR;
  55. break;
  56. default:
  57. printk(KERN_WARNING "mlx4_ib: Unexpected event type %d "
  58. "on SRQ %06x\n", type, srq->srqn);
  59. return;
  60. }
  61. ibsrq->event_handler(&event, ibsrq->srq_context);
  62. }
  63. }
  64. struct ib_srq *mlx4_ib_create_srq(struct ib_pd *pd,
  65. struct ib_srq_init_attr *init_attr,
  66. struct ib_udata *udata)
  67. {
  68. struct mlx4_ib_dev *dev = to_mdev(pd->device);
  69. struct mlx4_ib_srq *srq;
  70. struct mlx4_wqe_srq_next_seg *next;
  71. struct mlx4_wqe_data_seg *scatter;
  72. int desc_size;
  73. int buf_size;
  74. int err;
  75. int i;
  76. if (init_attr->srq_type != IB_SRQT_BASIC)
  77. return ERR_PTR(-ENOSYS);
  78. /* Sanity check SRQ size before proceeding */
  79. if (init_attr->attr.max_wr >= dev->dev->caps.max_srq_wqes ||
  80. init_attr->attr.max_sge > dev->dev->caps.max_srq_sge)
  81. return ERR_PTR(-EINVAL);
  82. srq = kmalloc(sizeof *srq, GFP_KERNEL);
  83. if (!srq)
  84. return ERR_PTR(-ENOMEM);
  85. mutex_init(&srq->mutex);
  86. spin_lock_init(&srq->lock);
  87. srq->msrq.max = roundup_pow_of_two(init_attr->attr.max_wr + 1);
  88. srq->msrq.max_gs = init_attr->attr.max_sge;
  89. desc_size = max(32UL,
  90. roundup_pow_of_two(sizeof (struct mlx4_wqe_srq_next_seg) +
  91. srq->msrq.max_gs *
  92. sizeof (struct mlx4_wqe_data_seg)));
  93. srq->msrq.wqe_shift = ilog2(desc_size);
  94. buf_size = srq->msrq.max * desc_size;
  95. if (pd->uobject) {
  96. struct mlx4_ib_create_srq ucmd;
  97. if (ib_copy_from_udata(&ucmd, udata, sizeof ucmd)) {
  98. err = -EFAULT;
  99. goto err_srq;
  100. }
  101. srq->umem = ib_umem_get(pd->uobject->context, ucmd.buf_addr,
  102. buf_size, 0, 0);
  103. if (IS_ERR(srq->umem)) {
  104. err = PTR_ERR(srq->umem);
  105. goto err_srq;
  106. }
  107. err = mlx4_mtt_init(dev->dev, ib_umem_page_count(srq->umem),
  108. ilog2(srq->umem->page_size), &srq->mtt);
  109. if (err)
  110. goto err_buf;
  111. err = mlx4_ib_umem_write_mtt(dev, &srq->mtt, srq->umem);
  112. if (err)
  113. goto err_mtt;
  114. err = mlx4_ib_db_map_user(to_mucontext(pd->uobject->context),
  115. ucmd.db_addr, &srq->db);
  116. if (err)
  117. goto err_mtt;
  118. } else {
  119. err = mlx4_db_alloc(dev->dev, &srq->db, 0);
  120. if (err)
  121. goto err_srq;
  122. *srq->db.db = 0;
  123. if (mlx4_buf_alloc(dev->dev, buf_size, PAGE_SIZE * 2, &srq->buf)) {
  124. err = -ENOMEM;
  125. goto err_db;
  126. }
  127. srq->head = 0;
  128. srq->tail = srq->msrq.max - 1;
  129. srq->wqe_ctr = 0;
  130. for (i = 0; i < srq->msrq.max; ++i) {
  131. next = get_wqe(srq, i);
  132. next->next_wqe_index =
  133. cpu_to_be16((i + 1) & (srq->msrq.max - 1));
  134. for (scatter = (void *) (next + 1);
  135. (void *) scatter < (void *) next + desc_size;
  136. ++scatter)
  137. scatter->lkey = cpu_to_be32(MLX4_INVALID_LKEY);
  138. }
  139. err = mlx4_mtt_init(dev->dev, srq->buf.npages, srq->buf.page_shift,
  140. &srq->mtt);
  141. if (err)
  142. goto err_buf;
  143. err = mlx4_buf_write_mtt(dev->dev, &srq->mtt, &srq->buf);
  144. if (err)
  145. goto err_mtt;
  146. srq->wrid = kmalloc(srq->msrq.max * sizeof (u64), GFP_KERNEL);
  147. if (!srq->wrid) {
  148. err = -ENOMEM;
  149. goto err_mtt;
  150. }
  151. }
  152. err = mlx4_srq_alloc(dev->dev, to_mpd(pd)->pdn, &srq->mtt,
  153. srq->db.dma, &srq->msrq);
  154. if (err)
  155. goto err_wrid;
  156. srq->msrq.event = mlx4_ib_srq_event;
  157. if (pd->uobject)
  158. if (ib_copy_to_udata(udata, &srq->msrq.srqn, sizeof (__u32))) {
  159. err = -EFAULT;
  160. goto err_wrid;
  161. }
  162. init_attr->attr.max_wr = srq->msrq.max - 1;
  163. return &srq->ibsrq;
  164. err_wrid:
  165. if (pd->uobject)
  166. mlx4_ib_db_unmap_user(to_mucontext(pd->uobject->context), &srq->db);
  167. else
  168. kfree(srq->wrid);
  169. err_mtt:
  170. mlx4_mtt_cleanup(dev->dev, &srq->mtt);
  171. err_buf:
  172. if (pd->uobject)
  173. ib_umem_release(srq->umem);
  174. else
  175. mlx4_buf_free(dev->dev, buf_size, &srq->buf);
  176. err_db:
  177. if (!pd->uobject)
  178. mlx4_db_free(dev->dev, &srq->db);
  179. err_srq:
  180. kfree(srq);
  181. return ERR_PTR(err);
  182. }
  183. int mlx4_ib_modify_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr,
  184. enum ib_srq_attr_mask attr_mask, struct ib_udata *udata)
  185. {
  186. struct mlx4_ib_dev *dev = to_mdev(ibsrq->device);
  187. struct mlx4_ib_srq *srq = to_msrq(ibsrq);
  188. int ret;
  189. /* We don't support resizing SRQs (yet?) */
  190. if (attr_mask & IB_SRQ_MAX_WR)
  191. return -EINVAL;
  192. if (attr_mask & IB_SRQ_LIMIT) {
  193. if (attr->srq_limit >= srq->msrq.max)
  194. return -EINVAL;
  195. mutex_lock(&srq->mutex);
  196. ret = mlx4_srq_arm(dev->dev, &srq->msrq, attr->srq_limit);
  197. mutex_unlock(&srq->mutex);
  198. if (ret)
  199. return ret;
  200. }
  201. return 0;
  202. }
  203. int mlx4_ib_query_srq(struct ib_srq *ibsrq, struct ib_srq_attr *srq_attr)
  204. {
  205. struct mlx4_ib_dev *dev = to_mdev(ibsrq->device);
  206. struct mlx4_ib_srq *srq = to_msrq(ibsrq);
  207. int ret;
  208. int limit_watermark;
  209. ret = mlx4_srq_query(dev->dev, &srq->msrq, &limit_watermark);
  210. if (ret)
  211. return ret;
  212. srq_attr->srq_limit = limit_watermark;
  213. srq_attr->max_wr = srq->msrq.max - 1;
  214. srq_attr->max_sge = srq->msrq.max_gs;
  215. return 0;
  216. }
  217. int mlx4_ib_destroy_srq(struct ib_srq *srq)
  218. {
  219. struct mlx4_ib_dev *dev = to_mdev(srq->device);
  220. struct mlx4_ib_srq *msrq = to_msrq(srq);
  221. mlx4_srq_free(dev->dev, &msrq->msrq);
  222. mlx4_mtt_cleanup(dev->dev, &msrq->mtt);
  223. if (srq->uobject) {
  224. mlx4_ib_db_unmap_user(to_mucontext(srq->uobject->context), &msrq->db);
  225. ib_umem_release(msrq->umem);
  226. } else {
  227. kfree(msrq->wrid);
  228. mlx4_buf_free(dev->dev, msrq->msrq.max << msrq->msrq.wqe_shift,
  229. &msrq->buf);
  230. mlx4_db_free(dev->dev, &msrq->db);
  231. }
  232. kfree(msrq);
  233. return 0;
  234. }
  235. void mlx4_ib_free_srq_wqe(struct mlx4_ib_srq *srq, int wqe_index)
  236. {
  237. struct mlx4_wqe_srq_next_seg *next;
  238. /* always called with interrupts disabled. */
  239. spin_lock(&srq->lock);
  240. next = get_wqe(srq, srq->tail);
  241. next->next_wqe_index = cpu_to_be16(wqe_index);
  242. srq->tail = wqe_index;
  243. spin_unlock(&srq->lock);
  244. }
  245. int mlx4_ib_post_srq_recv(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
  246. struct ib_recv_wr **bad_wr)
  247. {
  248. struct mlx4_ib_srq *srq = to_msrq(ibsrq);
  249. struct mlx4_wqe_srq_next_seg *next;
  250. struct mlx4_wqe_data_seg *scat;
  251. unsigned long flags;
  252. int err = 0;
  253. int nreq;
  254. int i;
  255. spin_lock_irqsave(&srq->lock, flags);
  256. for (nreq = 0; wr; ++nreq, wr = wr->next) {
  257. if (unlikely(wr->num_sge > srq->msrq.max_gs)) {
  258. err = -EINVAL;
  259. *bad_wr = wr;
  260. break;
  261. }
  262. if (unlikely(srq->head == srq->tail)) {
  263. err = -ENOMEM;
  264. *bad_wr = wr;
  265. break;
  266. }
  267. srq->wrid[srq->head] = wr->wr_id;
  268. next = get_wqe(srq, srq->head);
  269. srq->head = be16_to_cpu(next->next_wqe_index);
  270. scat = (struct mlx4_wqe_data_seg *) (next + 1);
  271. for (i = 0; i < wr->num_sge; ++i) {
  272. scat[i].byte_count = cpu_to_be32(wr->sg_list[i].length);
  273. scat[i].lkey = cpu_to_be32(wr->sg_list[i].lkey);
  274. scat[i].addr = cpu_to_be64(wr->sg_list[i].addr);
  275. }
  276. if (i < srq->msrq.max_gs) {
  277. scat[i].byte_count = 0;
  278. scat[i].lkey = cpu_to_be32(MLX4_INVALID_LKEY);
  279. scat[i].addr = 0;
  280. }
  281. }
  282. if (likely(nreq)) {
  283. srq->wqe_ctr += nreq;
  284. /*
  285. * Make sure that descriptors are written before
  286. * doorbell record.
  287. */
  288. wmb();
  289. *srq->db.db = cpu_to_be32(srq->wqe_ctr);
  290. }
  291. spin_unlock_irqrestore(&srq->lock, flags);
  292. return err;
  293. }