ib_frmr.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450
  1. /*
  2. * Copyright (c) 2016 Oracle. 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 "ib_mr.h"
  33. static inline void
  34. rds_transition_frwr_state(struct rds_ib_mr *ibmr,
  35. enum rds_ib_fr_state old_state,
  36. enum rds_ib_fr_state new_state)
  37. {
  38. if (cmpxchg(&ibmr->u.frmr.fr_state,
  39. old_state, new_state) == old_state &&
  40. old_state == FRMR_IS_INUSE) {
  41. /* enforce order of ibmr->u.frmr.fr_state update
  42. * before decrementing i_fastreg_inuse_count
  43. */
  44. smp_mb__before_atomic();
  45. atomic_dec(&ibmr->ic->i_fastreg_inuse_count);
  46. if (waitqueue_active(&rds_ib_ring_empty_wait))
  47. wake_up(&rds_ib_ring_empty_wait);
  48. }
  49. }
  50. static struct rds_ib_mr *rds_ib_alloc_frmr(struct rds_ib_device *rds_ibdev,
  51. int npages)
  52. {
  53. struct rds_ib_mr_pool *pool;
  54. struct rds_ib_mr *ibmr = NULL;
  55. struct rds_ib_frmr *frmr;
  56. int err = 0;
  57. if (npages <= RDS_MR_8K_MSG_SIZE)
  58. pool = rds_ibdev->mr_8k_pool;
  59. else
  60. pool = rds_ibdev->mr_1m_pool;
  61. ibmr = rds_ib_try_reuse_ibmr(pool);
  62. if (ibmr)
  63. return ibmr;
  64. ibmr = kzalloc_node(sizeof(*ibmr), GFP_KERNEL,
  65. rdsibdev_to_node(rds_ibdev));
  66. if (!ibmr) {
  67. err = -ENOMEM;
  68. goto out_no_cigar;
  69. }
  70. frmr = &ibmr->u.frmr;
  71. frmr->mr = ib_alloc_mr(rds_ibdev->pd, IB_MR_TYPE_MEM_REG,
  72. pool->max_pages);
  73. if (IS_ERR(frmr->mr)) {
  74. pr_warn("RDS/IB: %s failed to allocate MR", __func__);
  75. err = PTR_ERR(frmr->mr);
  76. goto out_no_cigar;
  77. }
  78. ibmr->pool = pool;
  79. if (pool->pool_type == RDS_IB_MR_8K_POOL)
  80. rds_ib_stats_inc(s_ib_rdma_mr_8k_alloc);
  81. else
  82. rds_ib_stats_inc(s_ib_rdma_mr_1m_alloc);
  83. if (atomic_read(&pool->item_count) > pool->max_items_soft)
  84. pool->max_items_soft = pool->max_items;
  85. frmr->fr_state = FRMR_IS_FREE;
  86. init_waitqueue_head(&frmr->fr_inv_done);
  87. init_waitqueue_head(&frmr->fr_reg_done);
  88. return ibmr;
  89. out_no_cigar:
  90. kfree(ibmr);
  91. atomic_dec(&pool->item_count);
  92. return ERR_PTR(err);
  93. }
  94. static void rds_ib_free_frmr(struct rds_ib_mr *ibmr, bool drop)
  95. {
  96. struct rds_ib_mr_pool *pool = ibmr->pool;
  97. if (drop)
  98. llist_add(&ibmr->llnode, &pool->drop_list);
  99. else
  100. llist_add(&ibmr->llnode, &pool->free_list);
  101. atomic_add(ibmr->sg_len, &pool->free_pinned);
  102. atomic_inc(&pool->dirty_count);
  103. /* If we've pinned too many pages, request a flush */
  104. if (atomic_read(&pool->free_pinned) >= pool->max_free_pinned ||
  105. atomic_read(&pool->dirty_count) >= pool->max_items / 5)
  106. queue_delayed_work(rds_ib_mr_wq, &pool->flush_worker, 10);
  107. }
  108. static int rds_ib_post_reg_frmr(struct rds_ib_mr *ibmr)
  109. {
  110. struct rds_ib_frmr *frmr = &ibmr->u.frmr;
  111. struct ib_reg_wr reg_wr;
  112. int ret, off = 0;
  113. while (atomic_dec_return(&ibmr->ic->i_fastreg_wrs) <= 0) {
  114. atomic_inc(&ibmr->ic->i_fastreg_wrs);
  115. cpu_relax();
  116. }
  117. ret = ib_map_mr_sg_zbva(frmr->mr, ibmr->sg, ibmr->sg_dma_len,
  118. &off, PAGE_SIZE);
  119. if (unlikely(ret != ibmr->sg_dma_len)) {
  120. ret = ret < 0 ? ret : -EINVAL;
  121. goto out_inc;
  122. }
  123. if (cmpxchg(&frmr->fr_state, FRMR_IS_FREE, FRMR_IS_INUSE) != FRMR_IS_FREE) {
  124. ret = -EBUSY;
  125. goto out_inc;
  126. }
  127. atomic_inc(&ibmr->ic->i_fastreg_inuse_count);
  128. /* Perform a WR for the fast_reg_mr. Each individual page
  129. * in the sg list is added to the fast reg page list and placed
  130. * inside the fast_reg_mr WR. The key used is a rolling 8bit
  131. * counter, which should guarantee uniqueness.
  132. */
  133. ib_update_fast_reg_key(frmr->mr, ibmr->remap_count++);
  134. frmr->fr_reg = true;
  135. memset(&reg_wr, 0, sizeof(reg_wr));
  136. reg_wr.wr.wr_id = (unsigned long)(void *)ibmr;
  137. reg_wr.wr.opcode = IB_WR_REG_MR;
  138. reg_wr.wr.num_sge = 0;
  139. reg_wr.mr = frmr->mr;
  140. reg_wr.key = frmr->mr->rkey;
  141. reg_wr.access = IB_ACCESS_LOCAL_WRITE |
  142. IB_ACCESS_REMOTE_READ |
  143. IB_ACCESS_REMOTE_WRITE;
  144. reg_wr.wr.send_flags = IB_SEND_SIGNALED;
  145. ret = ib_post_send(ibmr->ic->i_cm_id->qp, &reg_wr.wr, NULL);
  146. if (unlikely(ret)) {
  147. /* Failure here can be because of -ENOMEM as well */
  148. rds_transition_frwr_state(ibmr, FRMR_IS_INUSE, FRMR_IS_STALE);
  149. if (printk_ratelimit())
  150. pr_warn("RDS/IB: %s returned error(%d)\n",
  151. __func__, ret);
  152. goto out_inc;
  153. }
  154. /* Wait for the registration to complete in order to prevent an invalid
  155. * access error resulting from a race between the memory region already
  156. * being accessed while registration is still pending.
  157. */
  158. wait_event(frmr->fr_reg_done, !frmr->fr_reg);
  159. return ret;
  160. out_inc:
  161. atomic_inc(&ibmr->ic->i_fastreg_wrs);
  162. return ret;
  163. }
  164. static int rds_ib_map_frmr(struct rds_ib_device *rds_ibdev,
  165. struct rds_ib_mr_pool *pool,
  166. struct rds_ib_mr *ibmr,
  167. struct scatterlist *sg, unsigned int sg_len)
  168. {
  169. struct ib_device *dev = rds_ibdev->dev;
  170. struct rds_ib_frmr *frmr = &ibmr->u.frmr;
  171. int i;
  172. u32 len;
  173. int ret = 0;
  174. /* We want to teardown old ibmr values here and fill it up with
  175. * new sg values
  176. */
  177. rds_ib_teardown_mr(ibmr);
  178. ibmr->sg = sg;
  179. ibmr->sg_len = sg_len;
  180. ibmr->sg_dma_len = 0;
  181. frmr->sg_byte_len = 0;
  182. WARN_ON(ibmr->sg_dma_len);
  183. ibmr->sg_dma_len = ib_dma_map_sg(dev, ibmr->sg, ibmr->sg_len,
  184. DMA_BIDIRECTIONAL);
  185. if (unlikely(!ibmr->sg_dma_len)) {
  186. pr_warn("RDS/IB: %s failed!\n", __func__);
  187. return -EBUSY;
  188. }
  189. frmr->sg_byte_len = 0;
  190. frmr->dma_npages = 0;
  191. len = 0;
  192. ret = -EINVAL;
  193. for (i = 0; i < ibmr->sg_dma_len; ++i) {
  194. unsigned int dma_len = sg_dma_len(&ibmr->sg[i]);
  195. u64 dma_addr = sg_dma_address(&ibmr->sg[i]);
  196. frmr->sg_byte_len += dma_len;
  197. if (dma_addr & ~PAGE_MASK) {
  198. if (i > 0)
  199. goto out_unmap;
  200. else
  201. ++frmr->dma_npages;
  202. }
  203. if ((dma_addr + dma_len) & ~PAGE_MASK) {
  204. if (i < ibmr->sg_dma_len - 1)
  205. goto out_unmap;
  206. else
  207. ++frmr->dma_npages;
  208. }
  209. len += dma_len;
  210. }
  211. frmr->dma_npages += len >> PAGE_SHIFT;
  212. if (frmr->dma_npages > ibmr->pool->max_pages) {
  213. ret = -EMSGSIZE;
  214. goto out_unmap;
  215. }
  216. ret = rds_ib_post_reg_frmr(ibmr);
  217. if (ret)
  218. goto out_unmap;
  219. if (ibmr->pool->pool_type == RDS_IB_MR_8K_POOL)
  220. rds_ib_stats_inc(s_ib_rdma_mr_8k_used);
  221. else
  222. rds_ib_stats_inc(s_ib_rdma_mr_1m_used);
  223. return ret;
  224. out_unmap:
  225. ib_dma_unmap_sg(rds_ibdev->dev, ibmr->sg, ibmr->sg_len,
  226. DMA_BIDIRECTIONAL);
  227. ibmr->sg_dma_len = 0;
  228. return ret;
  229. }
  230. static int rds_ib_post_inv(struct rds_ib_mr *ibmr)
  231. {
  232. struct ib_send_wr *s_wr;
  233. struct rds_ib_frmr *frmr = &ibmr->u.frmr;
  234. struct rdma_cm_id *i_cm_id = ibmr->ic->i_cm_id;
  235. int ret = -EINVAL;
  236. if (!i_cm_id || !i_cm_id->qp || !frmr->mr)
  237. goto out;
  238. if (frmr->fr_state != FRMR_IS_INUSE)
  239. goto out;
  240. while (atomic_dec_return(&ibmr->ic->i_fastreg_wrs) <= 0) {
  241. atomic_inc(&ibmr->ic->i_fastreg_wrs);
  242. cpu_relax();
  243. }
  244. frmr->fr_inv = true;
  245. s_wr = &frmr->fr_wr;
  246. memset(s_wr, 0, sizeof(*s_wr));
  247. s_wr->wr_id = (unsigned long)(void *)ibmr;
  248. s_wr->opcode = IB_WR_LOCAL_INV;
  249. s_wr->ex.invalidate_rkey = frmr->mr->rkey;
  250. s_wr->send_flags = IB_SEND_SIGNALED;
  251. ret = ib_post_send(i_cm_id->qp, s_wr, NULL);
  252. if (unlikely(ret)) {
  253. rds_transition_frwr_state(ibmr, FRMR_IS_INUSE, FRMR_IS_STALE);
  254. frmr->fr_inv = false;
  255. /* enforce order of frmr->fr_inv update
  256. * before incrementing i_fastreg_wrs
  257. */
  258. smp_mb__before_atomic();
  259. atomic_inc(&ibmr->ic->i_fastreg_wrs);
  260. pr_err("RDS/IB: %s returned error(%d)\n", __func__, ret);
  261. goto out;
  262. }
  263. /* Wait for the FRMR_IS_FREE (or FRMR_IS_STALE) transition in order to
  264. * 1) avoid a silly bouncing between "clean_list" and "drop_list"
  265. * triggered by function "rds_ib_reg_frmr" as it is releases frmr
  266. * regions whose state is not "FRMR_IS_FREE" right away.
  267. * 2) prevents an invalid access error in a race
  268. * from a pending "IB_WR_LOCAL_INV" operation
  269. * with a teardown ("dma_unmap_sg", "put_page")
  270. * and de-registration ("ib_dereg_mr") of the corresponding
  271. * memory region.
  272. */
  273. wait_event(frmr->fr_inv_done, frmr->fr_state != FRMR_IS_INUSE);
  274. out:
  275. return ret;
  276. }
  277. void rds_ib_mr_cqe_handler(struct rds_ib_connection *ic, struct ib_wc *wc)
  278. {
  279. struct rds_ib_mr *ibmr = (void *)(unsigned long)wc->wr_id;
  280. struct rds_ib_frmr *frmr = &ibmr->u.frmr;
  281. if (wc->status != IB_WC_SUCCESS) {
  282. rds_transition_frwr_state(ibmr, FRMR_IS_INUSE, FRMR_IS_STALE);
  283. if (rds_conn_up(ic->conn))
  284. rds_ib_conn_error(ic->conn,
  285. "frmr completion <%pI4,%pI4> status %u(%s), vendor_err 0x%x, disconnecting and reconnecting\n",
  286. &ic->conn->c_laddr,
  287. &ic->conn->c_faddr,
  288. wc->status,
  289. ib_wc_status_msg(wc->status),
  290. wc->vendor_err);
  291. }
  292. if (frmr->fr_inv) {
  293. rds_transition_frwr_state(ibmr, FRMR_IS_INUSE, FRMR_IS_FREE);
  294. frmr->fr_inv = false;
  295. wake_up(&frmr->fr_inv_done);
  296. }
  297. if (frmr->fr_reg) {
  298. frmr->fr_reg = false;
  299. wake_up(&frmr->fr_reg_done);
  300. }
  301. /* enforce order of frmr->{fr_reg,fr_inv} update
  302. * before incrementing i_fastreg_wrs
  303. */
  304. smp_mb__before_atomic();
  305. atomic_inc(&ic->i_fastreg_wrs);
  306. }
  307. void rds_ib_unreg_frmr(struct list_head *list, unsigned int *nfreed,
  308. unsigned long *unpinned, unsigned int goal)
  309. {
  310. struct rds_ib_mr *ibmr, *next;
  311. struct rds_ib_frmr *frmr;
  312. int ret = 0, ret2;
  313. unsigned int freed = *nfreed;
  314. /* String all ib_mr's onto one list and hand them to ib_unmap_fmr */
  315. list_for_each_entry(ibmr, list, unmap_list) {
  316. if (ibmr->sg_dma_len) {
  317. ret2 = rds_ib_post_inv(ibmr);
  318. if (ret2 && !ret)
  319. ret = ret2;
  320. }
  321. }
  322. if (ret)
  323. pr_warn("RDS/IB: %s failed (err=%d)\n", __func__, ret);
  324. /* Now we can destroy the DMA mapping and unpin any pages */
  325. list_for_each_entry_safe(ibmr, next, list, unmap_list) {
  326. *unpinned += ibmr->sg_len;
  327. frmr = &ibmr->u.frmr;
  328. __rds_ib_teardown_mr(ibmr);
  329. if (freed < goal || frmr->fr_state == FRMR_IS_STALE) {
  330. /* Don't de-allocate if the MR is not free yet */
  331. if (frmr->fr_state == FRMR_IS_INUSE)
  332. continue;
  333. if (ibmr->pool->pool_type == RDS_IB_MR_8K_POOL)
  334. rds_ib_stats_inc(s_ib_rdma_mr_8k_free);
  335. else
  336. rds_ib_stats_inc(s_ib_rdma_mr_1m_free);
  337. list_del(&ibmr->unmap_list);
  338. if (frmr->mr)
  339. ib_dereg_mr(frmr->mr);
  340. kfree(ibmr);
  341. freed++;
  342. }
  343. }
  344. *nfreed = freed;
  345. }
  346. struct rds_ib_mr *rds_ib_reg_frmr(struct rds_ib_device *rds_ibdev,
  347. struct rds_ib_connection *ic,
  348. struct scatterlist *sg,
  349. unsigned long nents, u32 *key)
  350. {
  351. struct rds_ib_mr *ibmr = NULL;
  352. struct rds_ib_frmr *frmr;
  353. int ret;
  354. if (!ic) {
  355. /* TODO: Add FRWR support for RDS_GET_MR using proxy qp*/
  356. return ERR_PTR(-EOPNOTSUPP);
  357. }
  358. do {
  359. if (ibmr)
  360. rds_ib_free_frmr(ibmr, true);
  361. ibmr = rds_ib_alloc_frmr(rds_ibdev, nents);
  362. if (IS_ERR(ibmr))
  363. return ibmr;
  364. frmr = &ibmr->u.frmr;
  365. } while (frmr->fr_state != FRMR_IS_FREE);
  366. ibmr->ic = ic;
  367. ibmr->device = rds_ibdev;
  368. ret = rds_ib_map_frmr(rds_ibdev, ibmr->pool, ibmr, sg, nents);
  369. if (ret == 0) {
  370. *key = frmr->mr->rkey;
  371. } else {
  372. rds_ib_free_frmr(ibmr, false);
  373. ibmr = ERR_PTR(ret);
  374. }
  375. return ibmr;
  376. }
  377. void rds_ib_free_frmr_list(struct rds_ib_mr *ibmr)
  378. {
  379. struct rds_ib_mr_pool *pool = ibmr->pool;
  380. struct rds_ib_frmr *frmr = &ibmr->u.frmr;
  381. if (frmr->fr_state == FRMR_IS_STALE)
  382. llist_add(&ibmr->llnode, &pool->drop_list);
  383. else
  384. llist_add(&ibmr->llnode, &pool->free_list);
  385. }