srq.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360
  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. /* Sanity check SRQ size before proceeding */
  77. if (init_attr->attr.max_wr >= dev->dev->caps.max_srq_wqes ||
  78. init_attr->attr.max_sge > dev->dev->caps.max_srq_sge)
  79. return ERR_PTR(-EINVAL);
  80. srq = kmalloc(sizeof *srq, GFP_KERNEL);
  81. if (!srq)
  82. return ERR_PTR(-ENOMEM);
  83. mutex_init(&srq->mutex);
  84. spin_lock_init(&srq->lock);
  85. srq->msrq.max = roundup_pow_of_two(init_attr->attr.max_wr + 1);
  86. srq->msrq.max_gs = init_attr->attr.max_sge;
  87. desc_size = max(32UL,
  88. roundup_pow_of_two(sizeof (struct mlx4_wqe_srq_next_seg) +
  89. srq->msrq.max_gs *
  90. sizeof (struct mlx4_wqe_data_seg)));
  91. srq->msrq.wqe_shift = ilog2(desc_size);
  92. buf_size = srq->msrq.max * desc_size;
  93. if (pd->uobject) {
  94. struct mlx4_ib_create_srq ucmd;
  95. if (ib_copy_from_udata(&ucmd, udata, sizeof ucmd)) {
  96. err = -EFAULT;
  97. goto err_srq;
  98. }
  99. srq->umem = ib_umem_get(pd->uobject->context, ucmd.buf_addr,
  100. buf_size, 0, 0);
  101. if (IS_ERR(srq->umem)) {
  102. err = PTR_ERR(srq->umem);
  103. goto err_srq;
  104. }
  105. err = mlx4_mtt_init(dev->dev, ib_umem_page_count(srq->umem),
  106. ilog2(srq->umem->page_size), &srq->mtt);
  107. if (err)
  108. goto err_buf;
  109. err = mlx4_ib_umem_write_mtt(dev, &srq->mtt, srq->umem);
  110. if (err)
  111. goto err_mtt;
  112. err = mlx4_ib_db_map_user(to_mucontext(pd->uobject->context),
  113. ucmd.db_addr, &srq->db);
  114. if (err)
  115. goto err_mtt;
  116. } else {
  117. err = mlx4_db_alloc(dev->dev, &srq->db, 0);
  118. if (err)
  119. goto err_srq;
  120. *srq->db.db = 0;
  121. if (mlx4_buf_alloc(dev->dev, buf_size, PAGE_SIZE * 2, &srq->buf)) {
  122. err = -ENOMEM;
  123. goto err_db;
  124. }
  125. srq->head = 0;
  126. srq->tail = srq->msrq.max - 1;
  127. srq->wqe_ctr = 0;
  128. for (i = 0; i < srq->msrq.max; ++i) {
  129. next = get_wqe(srq, i);
  130. next->next_wqe_index =
  131. cpu_to_be16((i + 1) & (srq->msrq.max - 1));
  132. for (scatter = (void *) (next + 1);
  133. (void *) scatter < (void *) next + desc_size;
  134. ++scatter)
  135. scatter->lkey = cpu_to_be32(MLX4_INVALID_LKEY);
  136. }
  137. err = mlx4_mtt_init(dev->dev, srq->buf.npages, srq->buf.page_shift,
  138. &srq->mtt);
  139. if (err)
  140. goto err_buf;
  141. err = mlx4_buf_write_mtt(dev->dev, &srq->mtt, &srq->buf);
  142. if (err)
  143. goto err_mtt;
  144. srq->wrid = kmalloc(srq->msrq.max * sizeof (u64), GFP_KERNEL);
  145. if (!srq->wrid) {
  146. err = -ENOMEM;
  147. goto err_mtt;
  148. }
  149. }
  150. err = mlx4_srq_alloc(dev->dev, to_mpd(pd)->pdn, &srq->mtt,
  151. srq->db.dma, &srq->msrq);
  152. if (err)
  153. goto err_wrid;
  154. srq->msrq.event = mlx4_ib_srq_event;
  155. if (pd->uobject)
  156. if (ib_copy_to_udata(udata, &srq->msrq.srqn, sizeof (__u32))) {
  157. err = -EFAULT;
  158. goto err_wrid;
  159. }
  160. init_attr->attr.max_wr = srq->msrq.max - 1;
  161. return &srq->ibsrq;
  162. err_wrid:
  163. if (pd->uobject)
  164. mlx4_ib_db_unmap_user(to_mucontext(pd->uobject->context), &srq->db);
  165. else
  166. kfree(srq->wrid);
  167. err_mtt:
  168. mlx4_mtt_cleanup(dev->dev, &srq->mtt);
  169. err_buf:
  170. if (pd->uobject)
  171. ib_umem_release(srq->umem);
  172. else
  173. mlx4_buf_free(dev->dev, buf_size, &srq->buf);
  174. err_db:
  175. if (!pd->uobject)
  176. mlx4_db_free(dev->dev, &srq->db);
  177. err_srq:
  178. kfree(srq);
  179. return ERR_PTR(err);
  180. }
  181. int mlx4_ib_modify_srq(struct ib_srq *ibsrq, struct ib_srq_attr *attr,
  182. enum ib_srq_attr_mask attr_mask, struct ib_udata *udata)
  183. {
  184. struct mlx4_ib_dev *dev = to_mdev(ibsrq->device);
  185. struct mlx4_ib_srq *srq = to_msrq(ibsrq);
  186. int ret;
  187. /* We don't support resizing SRQs (yet?) */
  188. if (attr_mask & IB_SRQ_MAX_WR)
  189. return -EINVAL;
  190. if (attr_mask & IB_SRQ_LIMIT) {
  191. if (attr->srq_limit >= srq->msrq.max)
  192. return -EINVAL;
  193. mutex_lock(&srq->mutex);
  194. ret = mlx4_srq_arm(dev->dev, &srq->msrq, attr->srq_limit);
  195. mutex_unlock(&srq->mutex);
  196. if (ret)
  197. return ret;
  198. }
  199. return 0;
  200. }
  201. int mlx4_ib_query_srq(struct ib_srq *ibsrq, struct ib_srq_attr *srq_attr)
  202. {
  203. struct mlx4_ib_dev *dev = to_mdev(ibsrq->device);
  204. struct mlx4_ib_srq *srq = to_msrq(ibsrq);
  205. int ret;
  206. int limit_watermark;
  207. ret = mlx4_srq_query(dev->dev, &srq->msrq, &limit_watermark);
  208. if (ret)
  209. return ret;
  210. srq_attr->srq_limit = limit_watermark;
  211. srq_attr->max_wr = srq->msrq.max - 1;
  212. srq_attr->max_sge = srq->msrq.max_gs;
  213. return 0;
  214. }
  215. int mlx4_ib_destroy_srq(struct ib_srq *srq)
  216. {
  217. struct mlx4_ib_dev *dev = to_mdev(srq->device);
  218. struct mlx4_ib_srq *msrq = to_msrq(srq);
  219. mlx4_srq_free(dev->dev, &msrq->msrq);
  220. mlx4_mtt_cleanup(dev->dev, &msrq->mtt);
  221. if (srq->uobject) {
  222. mlx4_ib_db_unmap_user(to_mucontext(srq->uobject->context), &msrq->db);
  223. ib_umem_release(msrq->umem);
  224. } else {
  225. kfree(msrq->wrid);
  226. mlx4_buf_free(dev->dev, msrq->msrq.max << msrq->msrq.wqe_shift,
  227. &msrq->buf);
  228. mlx4_db_free(dev->dev, &msrq->db);
  229. }
  230. kfree(msrq);
  231. return 0;
  232. }
  233. void mlx4_ib_free_srq_wqe(struct mlx4_ib_srq *srq, int wqe_index)
  234. {
  235. struct mlx4_wqe_srq_next_seg *next;
  236. /* always called with interrupts disabled. */
  237. spin_lock(&srq->lock);
  238. next = get_wqe(srq, srq->tail);
  239. next->next_wqe_index = cpu_to_be16(wqe_index);
  240. srq->tail = wqe_index;
  241. spin_unlock(&srq->lock);
  242. }
  243. int mlx4_ib_post_srq_recv(struct ib_srq *ibsrq, struct ib_recv_wr *wr,
  244. struct ib_recv_wr **bad_wr)
  245. {
  246. struct mlx4_ib_srq *srq = to_msrq(ibsrq);
  247. struct mlx4_wqe_srq_next_seg *next;
  248. struct mlx4_wqe_data_seg *scat;
  249. unsigned long flags;
  250. int err = 0;
  251. int nreq;
  252. int i;
  253. spin_lock_irqsave(&srq->lock, flags);
  254. for (nreq = 0; wr; ++nreq, wr = wr->next) {
  255. if (unlikely(wr->num_sge > srq->msrq.max_gs)) {
  256. err = -EINVAL;
  257. *bad_wr = wr;
  258. break;
  259. }
  260. if (unlikely(srq->head == srq->tail)) {
  261. err = -ENOMEM;
  262. *bad_wr = wr;
  263. break;
  264. }
  265. srq->wrid[srq->head] = wr->wr_id;
  266. next = get_wqe(srq, srq->head);
  267. srq->head = be16_to_cpu(next->next_wqe_index);
  268. scat = (struct mlx4_wqe_data_seg *) (next + 1);
  269. for (i = 0; i < wr->num_sge; ++i) {
  270. scat[i].byte_count = cpu_to_be32(wr->sg_list[i].length);
  271. scat[i].lkey = cpu_to_be32(wr->sg_list[i].lkey);
  272. scat[i].addr = cpu_to_be64(wr->sg_list[i].addr);
  273. }
  274. if (i < srq->msrq.max_gs) {
  275. scat[i].byte_count = 0;
  276. scat[i].lkey = cpu_to_be32(MLX4_INVALID_LKEY);
  277. scat[i].addr = 0;
  278. }
  279. }
  280. if (likely(nreq)) {
  281. srq->wqe_ctr += nreq;
  282. /*
  283. * Make sure that descriptors are written before
  284. * doorbell record.
  285. */
  286. wmb();
  287. *srq->db.db = cpu_to_be32(srq->wqe_ctr);
  288. }
  289. spin_unlock_irqrestore(&srq->lock, flags);
  290. return err;
  291. }