ib_rdma.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661
  1. /*
  2. * Copyright (c) 2006 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. */
  33. #include <linux/kernel.h>
  34. #include <linux/slab.h>
  35. #include <linux/rculist.h>
  36. #include "rds.h"
  37. #include "ib.h"
  38. /*
  39. * This is stored as mr->r_trans_private.
  40. */
  41. struct rds_ib_mr {
  42. struct rds_ib_device *device;
  43. struct rds_ib_mr_pool *pool;
  44. struct ib_fmr *fmr;
  45. struct list_head list;
  46. unsigned int remap_count;
  47. struct scatterlist *sg;
  48. unsigned int sg_len;
  49. u64 *dma;
  50. int sg_dma_len;
  51. };
  52. /*
  53. * Our own little FMR pool
  54. */
  55. struct rds_ib_mr_pool {
  56. struct mutex flush_lock; /* serialize fmr invalidate */
  57. struct work_struct flush_worker; /* flush worker */
  58. spinlock_t list_lock; /* protect variables below */
  59. atomic_t item_count; /* total # of MRs */
  60. atomic_t dirty_count; /* # dirty of MRs */
  61. struct list_head drop_list; /* MRs that have reached their max_maps limit */
  62. struct list_head free_list; /* unused MRs */
  63. struct list_head clean_list; /* unused & unamapped MRs */
  64. atomic_t free_pinned; /* memory pinned by free MRs */
  65. unsigned long max_items;
  66. unsigned long max_items_soft;
  67. unsigned long max_free_pinned;
  68. struct ib_fmr_attr fmr_attr;
  69. };
  70. static int rds_ib_flush_mr_pool(struct rds_ib_mr_pool *pool, int free_all);
  71. static void rds_ib_teardown_mr(struct rds_ib_mr *ibmr);
  72. static void rds_ib_mr_pool_flush_worker(struct work_struct *work);
  73. static struct rds_ib_device *rds_ib_get_device(__be32 ipaddr)
  74. {
  75. struct rds_ib_device *rds_ibdev;
  76. struct rds_ib_ipaddr *i_ipaddr;
  77. list_for_each_entry(rds_ibdev, &rds_ib_devices, list) {
  78. rcu_read_lock();
  79. list_for_each_entry_rcu(i_ipaddr, &rds_ibdev->ipaddr_list, list) {
  80. if (i_ipaddr->ipaddr == ipaddr) {
  81. atomic_inc(&rds_ibdev->refcount);
  82. rcu_read_unlock();
  83. return rds_ibdev;
  84. }
  85. }
  86. rcu_read_unlock();
  87. }
  88. return NULL;
  89. }
  90. static int rds_ib_add_ipaddr(struct rds_ib_device *rds_ibdev, __be32 ipaddr)
  91. {
  92. struct rds_ib_ipaddr *i_ipaddr;
  93. i_ipaddr = kmalloc(sizeof *i_ipaddr, GFP_KERNEL);
  94. if (!i_ipaddr)
  95. return -ENOMEM;
  96. i_ipaddr->ipaddr = ipaddr;
  97. spin_lock_irq(&rds_ibdev->spinlock);
  98. list_add_tail_rcu(&i_ipaddr->list, &rds_ibdev->ipaddr_list);
  99. spin_unlock_irq(&rds_ibdev->spinlock);
  100. return 0;
  101. }
  102. static void rds_ib_remove_ipaddr(struct rds_ib_device *rds_ibdev, __be32 ipaddr)
  103. {
  104. struct rds_ib_ipaddr *i_ipaddr;
  105. struct rds_ib_ipaddr *to_free = NULL;
  106. spin_lock_irq(&rds_ibdev->spinlock);
  107. list_for_each_entry_rcu(i_ipaddr, &rds_ibdev->ipaddr_list, list) {
  108. if (i_ipaddr->ipaddr == ipaddr) {
  109. list_del_rcu(&i_ipaddr->list);
  110. to_free = i_ipaddr;
  111. break;
  112. }
  113. }
  114. spin_unlock_irq(&rds_ibdev->spinlock);
  115. if (to_free) {
  116. synchronize_rcu();
  117. kfree(to_free);
  118. }
  119. }
  120. int rds_ib_update_ipaddr(struct rds_ib_device *rds_ibdev, __be32 ipaddr)
  121. {
  122. struct rds_ib_device *rds_ibdev_old;
  123. rds_ibdev_old = rds_ib_get_device(ipaddr);
  124. if (rds_ibdev_old) {
  125. rds_ib_remove_ipaddr(rds_ibdev_old, ipaddr);
  126. rds_ib_dev_put(rds_ibdev_old);
  127. }
  128. return rds_ib_add_ipaddr(rds_ibdev, ipaddr);
  129. }
  130. void rds_ib_add_conn(struct rds_ib_device *rds_ibdev, struct rds_connection *conn)
  131. {
  132. struct rds_ib_connection *ic = conn->c_transport_data;
  133. /* conn was previously on the nodev_conns_list */
  134. spin_lock_irq(&ib_nodev_conns_lock);
  135. BUG_ON(list_empty(&ib_nodev_conns));
  136. BUG_ON(list_empty(&ic->ib_node));
  137. list_del(&ic->ib_node);
  138. spin_lock_irq(&rds_ibdev->spinlock);
  139. list_add_tail(&ic->ib_node, &rds_ibdev->conn_list);
  140. spin_unlock_irq(&rds_ibdev->spinlock);
  141. spin_unlock_irq(&ib_nodev_conns_lock);
  142. ic->rds_ibdev = rds_ibdev;
  143. atomic_inc(&rds_ibdev->refcount);
  144. }
  145. void rds_ib_remove_conn(struct rds_ib_device *rds_ibdev, struct rds_connection *conn)
  146. {
  147. struct rds_ib_connection *ic = conn->c_transport_data;
  148. /* place conn on nodev_conns_list */
  149. spin_lock(&ib_nodev_conns_lock);
  150. spin_lock_irq(&rds_ibdev->spinlock);
  151. BUG_ON(list_empty(&ic->ib_node));
  152. list_del(&ic->ib_node);
  153. spin_unlock_irq(&rds_ibdev->spinlock);
  154. list_add_tail(&ic->ib_node, &ib_nodev_conns);
  155. spin_unlock(&ib_nodev_conns_lock);
  156. ic->rds_ibdev = NULL;
  157. rds_ib_dev_put(rds_ibdev);
  158. }
  159. void __rds_ib_destroy_conns(struct list_head *list, spinlock_t *list_lock)
  160. {
  161. struct rds_ib_connection *ic, *_ic;
  162. LIST_HEAD(tmp_list);
  163. /* avoid calling conn_destroy with irqs off */
  164. spin_lock_irq(list_lock);
  165. list_splice(list, &tmp_list);
  166. INIT_LIST_HEAD(list);
  167. spin_unlock_irq(list_lock);
  168. list_for_each_entry_safe(ic, _ic, &tmp_list, ib_node)
  169. rds_conn_destroy(ic->conn);
  170. }
  171. struct rds_ib_mr_pool *rds_ib_create_mr_pool(struct rds_ib_device *rds_ibdev)
  172. {
  173. struct rds_ib_mr_pool *pool;
  174. pool = kzalloc(sizeof(*pool), GFP_KERNEL);
  175. if (!pool)
  176. return ERR_PTR(-ENOMEM);
  177. INIT_LIST_HEAD(&pool->free_list);
  178. INIT_LIST_HEAD(&pool->drop_list);
  179. INIT_LIST_HEAD(&pool->clean_list);
  180. mutex_init(&pool->flush_lock);
  181. spin_lock_init(&pool->list_lock);
  182. INIT_WORK(&pool->flush_worker, rds_ib_mr_pool_flush_worker);
  183. pool->fmr_attr.max_pages = fmr_message_size;
  184. pool->fmr_attr.max_maps = rds_ibdev->fmr_max_remaps;
  185. pool->fmr_attr.page_shift = PAGE_SHIFT;
  186. pool->max_free_pinned = rds_ibdev->max_fmrs * fmr_message_size / 4;
  187. /* We never allow more than max_items MRs to be allocated.
  188. * When we exceed more than max_items_soft, we start freeing
  189. * items more aggressively.
  190. * Make sure that max_items > max_items_soft > max_items / 2
  191. */
  192. pool->max_items_soft = rds_ibdev->max_fmrs * 3 / 4;
  193. pool->max_items = rds_ibdev->max_fmrs;
  194. return pool;
  195. }
  196. void rds_ib_get_mr_info(struct rds_ib_device *rds_ibdev, struct rds_info_rdma_connection *iinfo)
  197. {
  198. struct rds_ib_mr_pool *pool = rds_ibdev->mr_pool;
  199. iinfo->rdma_mr_max = pool->max_items;
  200. iinfo->rdma_mr_size = pool->fmr_attr.max_pages;
  201. }
  202. void rds_ib_destroy_mr_pool(struct rds_ib_mr_pool *pool)
  203. {
  204. cancel_work_sync(&pool->flush_worker);
  205. rds_ib_flush_mr_pool(pool, 1);
  206. WARN_ON(atomic_read(&pool->item_count));
  207. WARN_ON(atomic_read(&pool->free_pinned));
  208. kfree(pool);
  209. }
  210. static inline struct rds_ib_mr *rds_ib_reuse_fmr(struct rds_ib_mr_pool *pool)
  211. {
  212. struct rds_ib_mr *ibmr = NULL;
  213. unsigned long flags;
  214. spin_lock_irqsave(&pool->list_lock, flags);
  215. if (!list_empty(&pool->clean_list)) {
  216. ibmr = list_entry(pool->clean_list.next, struct rds_ib_mr, list);
  217. list_del_init(&ibmr->list);
  218. }
  219. spin_unlock_irqrestore(&pool->list_lock, flags);
  220. return ibmr;
  221. }
  222. static struct rds_ib_mr *rds_ib_alloc_fmr(struct rds_ib_device *rds_ibdev)
  223. {
  224. struct rds_ib_mr_pool *pool = rds_ibdev->mr_pool;
  225. struct rds_ib_mr *ibmr = NULL;
  226. int err = 0, iter = 0;
  227. while (1) {
  228. ibmr = rds_ib_reuse_fmr(pool);
  229. if (ibmr)
  230. return ibmr;
  231. /* No clean MRs - now we have the choice of either
  232. * allocating a fresh MR up to the limit imposed by the
  233. * driver, or flush any dirty unused MRs.
  234. * We try to avoid stalling in the send path if possible,
  235. * so we allocate as long as we're allowed to.
  236. *
  237. * We're fussy with enforcing the FMR limit, though. If the driver
  238. * tells us we can't use more than N fmrs, we shouldn't start
  239. * arguing with it */
  240. if (atomic_inc_return(&pool->item_count) <= pool->max_items)
  241. break;
  242. atomic_dec(&pool->item_count);
  243. if (++iter > 2) {
  244. rds_ib_stats_inc(s_ib_rdma_mr_pool_depleted);
  245. return ERR_PTR(-EAGAIN);
  246. }
  247. /* We do have some empty MRs. Flush them out. */
  248. rds_ib_stats_inc(s_ib_rdma_mr_pool_wait);
  249. rds_ib_flush_mr_pool(pool, 0);
  250. }
  251. ibmr = kzalloc_node(sizeof(*ibmr), GFP_KERNEL, rdsibdev_to_node(rds_ibdev));
  252. if (!ibmr) {
  253. err = -ENOMEM;
  254. goto out_no_cigar;
  255. }
  256. memset(ibmr, 0, sizeof(*ibmr));
  257. ibmr->fmr = ib_alloc_fmr(rds_ibdev->pd,
  258. (IB_ACCESS_LOCAL_WRITE |
  259. IB_ACCESS_REMOTE_READ |
  260. IB_ACCESS_REMOTE_WRITE|
  261. IB_ACCESS_REMOTE_ATOMIC),
  262. &pool->fmr_attr);
  263. if (IS_ERR(ibmr->fmr)) {
  264. err = PTR_ERR(ibmr->fmr);
  265. ibmr->fmr = NULL;
  266. printk(KERN_WARNING "RDS/IB: ib_alloc_fmr failed (err=%d)\n", err);
  267. goto out_no_cigar;
  268. }
  269. rds_ib_stats_inc(s_ib_rdma_mr_alloc);
  270. return ibmr;
  271. out_no_cigar:
  272. if (ibmr) {
  273. if (ibmr->fmr)
  274. ib_dealloc_fmr(ibmr->fmr);
  275. kfree(ibmr);
  276. }
  277. atomic_dec(&pool->item_count);
  278. return ERR_PTR(err);
  279. }
  280. static int rds_ib_map_fmr(struct rds_ib_device *rds_ibdev, struct rds_ib_mr *ibmr,
  281. struct scatterlist *sg, unsigned int nents)
  282. {
  283. struct ib_device *dev = rds_ibdev->dev;
  284. struct scatterlist *scat = sg;
  285. u64 io_addr = 0;
  286. u64 *dma_pages;
  287. u32 len;
  288. int page_cnt, sg_dma_len;
  289. int i, j;
  290. int ret;
  291. sg_dma_len = ib_dma_map_sg(dev, sg, nents,
  292. DMA_BIDIRECTIONAL);
  293. if (unlikely(!sg_dma_len)) {
  294. printk(KERN_WARNING "RDS/IB: dma_map_sg failed!\n");
  295. return -EBUSY;
  296. }
  297. len = 0;
  298. page_cnt = 0;
  299. for (i = 0; i < sg_dma_len; ++i) {
  300. unsigned int dma_len = ib_sg_dma_len(dev, &scat[i]);
  301. u64 dma_addr = ib_sg_dma_address(dev, &scat[i]);
  302. if (dma_addr & ~PAGE_MASK) {
  303. if (i > 0)
  304. return -EINVAL;
  305. else
  306. ++page_cnt;
  307. }
  308. if ((dma_addr + dma_len) & ~PAGE_MASK) {
  309. if (i < sg_dma_len - 1)
  310. return -EINVAL;
  311. else
  312. ++page_cnt;
  313. }
  314. len += dma_len;
  315. }
  316. page_cnt += len >> PAGE_SHIFT;
  317. if (page_cnt > fmr_message_size)
  318. return -EINVAL;
  319. dma_pages = kmalloc_node(sizeof(u64) * page_cnt, GFP_ATOMIC,
  320. rdsibdev_to_node(rds_ibdev));
  321. if (!dma_pages)
  322. return -ENOMEM;
  323. page_cnt = 0;
  324. for (i = 0; i < sg_dma_len; ++i) {
  325. unsigned int dma_len = ib_sg_dma_len(dev, &scat[i]);
  326. u64 dma_addr = ib_sg_dma_address(dev, &scat[i]);
  327. for (j = 0; j < dma_len; j += PAGE_SIZE)
  328. dma_pages[page_cnt++] =
  329. (dma_addr & PAGE_MASK) + j;
  330. }
  331. ret = ib_map_phys_fmr(ibmr->fmr,
  332. dma_pages, page_cnt, io_addr);
  333. if (ret)
  334. goto out;
  335. /* Success - we successfully remapped the MR, so we can
  336. * safely tear down the old mapping. */
  337. rds_ib_teardown_mr(ibmr);
  338. ibmr->sg = scat;
  339. ibmr->sg_len = nents;
  340. ibmr->sg_dma_len = sg_dma_len;
  341. ibmr->remap_count++;
  342. rds_ib_stats_inc(s_ib_rdma_mr_used);
  343. ret = 0;
  344. out:
  345. kfree(dma_pages);
  346. return ret;
  347. }
  348. void rds_ib_sync_mr(void *trans_private, int direction)
  349. {
  350. struct rds_ib_mr *ibmr = trans_private;
  351. struct rds_ib_device *rds_ibdev = ibmr->device;
  352. switch (direction) {
  353. case DMA_FROM_DEVICE:
  354. ib_dma_sync_sg_for_cpu(rds_ibdev->dev, ibmr->sg,
  355. ibmr->sg_dma_len, DMA_BIDIRECTIONAL);
  356. break;
  357. case DMA_TO_DEVICE:
  358. ib_dma_sync_sg_for_device(rds_ibdev->dev, ibmr->sg,
  359. ibmr->sg_dma_len, DMA_BIDIRECTIONAL);
  360. break;
  361. }
  362. }
  363. static void __rds_ib_teardown_mr(struct rds_ib_mr *ibmr)
  364. {
  365. struct rds_ib_device *rds_ibdev = ibmr->device;
  366. if (ibmr->sg_dma_len) {
  367. ib_dma_unmap_sg(rds_ibdev->dev,
  368. ibmr->sg, ibmr->sg_len,
  369. DMA_BIDIRECTIONAL);
  370. ibmr->sg_dma_len = 0;
  371. }
  372. /* Release the s/g list */
  373. if (ibmr->sg_len) {
  374. unsigned int i;
  375. for (i = 0; i < ibmr->sg_len; ++i) {
  376. struct page *page = sg_page(&ibmr->sg[i]);
  377. /* FIXME we need a way to tell a r/w MR
  378. * from a r/o MR */
  379. BUG_ON(irqs_disabled());
  380. set_page_dirty(page);
  381. put_page(page);
  382. }
  383. kfree(ibmr->sg);
  384. ibmr->sg = NULL;
  385. ibmr->sg_len = 0;
  386. }
  387. }
  388. static void rds_ib_teardown_mr(struct rds_ib_mr *ibmr)
  389. {
  390. unsigned int pinned = ibmr->sg_len;
  391. __rds_ib_teardown_mr(ibmr);
  392. if (pinned) {
  393. struct rds_ib_device *rds_ibdev = ibmr->device;
  394. struct rds_ib_mr_pool *pool = rds_ibdev->mr_pool;
  395. atomic_sub(pinned, &pool->free_pinned);
  396. }
  397. }
  398. static inline unsigned int rds_ib_flush_goal(struct rds_ib_mr_pool *pool, int free_all)
  399. {
  400. unsigned int item_count;
  401. item_count = atomic_read(&pool->item_count);
  402. if (free_all)
  403. return item_count;
  404. return 0;
  405. }
  406. /*
  407. * Flush our pool of MRs.
  408. * At a minimum, all currently unused MRs are unmapped.
  409. * If the number of MRs allocated exceeds the limit, we also try
  410. * to free as many MRs as needed to get back to this limit.
  411. */
  412. static int rds_ib_flush_mr_pool(struct rds_ib_mr_pool *pool, int free_all)
  413. {
  414. struct rds_ib_mr *ibmr, *next;
  415. LIST_HEAD(unmap_list);
  416. LIST_HEAD(fmr_list);
  417. unsigned long unpinned = 0;
  418. unsigned long flags;
  419. unsigned int nfreed = 0, ncleaned = 0, free_goal;
  420. int ret = 0;
  421. rds_ib_stats_inc(s_ib_rdma_mr_pool_flush);
  422. mutex_lock(&pool->flush_lock);
  423. spin_lock_irqsave(&pool->list_lock, flags);
  424. /* Get the list of all MRs to be dropped. Ordering matters -
  425. * we want to put drop_list ahead of free_list. */
  426. list_splice_init(&pool->free_list, &unmap_list);
  427. list_splice_init(&pool->drop_list, &unmap_list);
  428. if (free_all)
  429. list_splice_init(&pool->clean_list, &unmap_list);
  430. spin_unlock_irqrestore(&pool->list_lock, flags);
  431. free_goal = rds_ib_flush_goal(pool, free_all);
  432. if (list_empty(&unmap_list))
  433. goto out;
  434. /* String all ib_mr's onto one list and hand them to ib_unmap_fmr */
  435. list_for_each_entry(ibmr, &unmap_list, list)
  436. list_add(&ibmr->fmr->list, &fmr_list);
  437. ret = ib_unmap_fmr(&fmr_list);
  438. if (ret)
  439. printk(KERN_WARNING "RDS/IB: ib_unmap_fmr failed (err=%d)\n", ret);
  440. /* Now we can destroy the DMA mapping and unpin any pages */
  441. list_for_each_entry_safe(ibmr, next, &unmap_list, list) {
  442. unpinned += ibmr->sg_len;
  443. __rds_ib_teardown_mr(ibmr);
  444. if (nfreed < free_goal || ibmr->remap_count >= pool->fmr_attr.max_maps) {
  445. rds_ib_stats_inc(s_ib_rdma_mr_free);
  446. list_del(&ibmr->list);
  447. ib_dealloc_fmr(ibmr->fmr);
  448. kfree(ibmr);
  449. nfreed++;
  450. }
  451. ncleaned++;
  452. }
  453. spin_lock_irqsave(&pool->list_lock, flags);
  454. list_splice(&unmap_list, &pool->clean_list);
  455. spin_unlock_irqrestore(&pool->list_lock, flags);
  456. atomic_sub(unpinned, &pool->free_pinned);
  457. atomic_sub(ncleaned, &pool->dirty_count);
  458. atomic_sub(nfreed, &pool->item_count);
  459. out:
  460. mutex_unlock(&pool->flush_lock);
  461. return ret;
  462. }
  463. static void rds_ib_mr_pool_flush_worker(struct work_struct *work)
  464. {
  465. struct rds_ib_mr_pool *pool = container_of(work, struct rds_ib_mr_pool, flush_worker);
  466. rds_ib_flush_mr_pool(pool, 0);
  467. }
  468. void rds_ib_free_mr(void *trans_private, int invalidate)
  469. {
  470. struct rds_ib_mr *ibmr = trans_private;
  471. struct rds_ib_device *rds_ibdev = ibmr->device;
  472. struct rds_ib_mr_pool *pool = rds_ibdev->mr_pool;
  473. unsigned long flags;
  474. rdsdebug("RDS/IB: free_mr nents %u\n", ibmr->sg_len);
  475. /* Return it to the pool's free list */
  476. spin_lock_irqsave(&pool->list_lock, flags);
  477. if (ibmr->remap_count >= pool->fmr_attr.max_maps)
  478. list_add(&ibmr->list, &pool->drop_list);
  479. else
  480. list_add(&ibmr->list, &pool->free_list);
  481. atomic_add(ibmr->sg_len, &pool->free_pinned);
  482. atomic_inc(&pool->dirty_count);
  483. spin_unlock_irqrestore(&pool->list_lock, flags);
  484. /* If we've pinned too many pages, request a flush */
  485. if (atomic_read(&pool->free_pinned) >= pool->max_free_pinned ||
  486. atomic_read(&pool->dirty_count) >= pool->max_items / 10)
  487. queue_work(rds_wq, &pool->flush_worker);
  488. if (invalidate) {
  489. if (likely(!in_interrupt())) {
  490. rds_ib_flush_mr_pool(pool, 0);
  491. } else {
  492. /* We get here if the user created a MR marked
  493. * as use_once and invalidate at the same time. */
  494. queue_work(rds_wq, &pool->flush_worker);
  495. }
  496. }
  497. rds_ib_dev_put(rds_ibdev);
  498. }
  499. void rds_ib_flush_mrs(void)
  500. {
  501. struct rds_ib_device *rds_ibdev;
  502. list_for_each_entry(rds_ibdev, &rds_ib_devices, list) {
  503. struct rds_ib_mr_pool *pool = rds_ibdev->mr_pool;
  504. if (pool)
  505. rds_ib_flush_mr_pool(pool, 0);
  506. }
  507. }
  508. void *rds_ib_get_mr(struct scatterlist *sg, unsigned long nents,
  509. struct rds_sock *rs, u32 *key_ret)
  510. {
  511. struct rds_ib_device *rds_ibdev;
  512. struct rds_ib_mr *ibmr = NULL;
  513. int ret;
  514. rds_ibdev = rds_ib_get_device(rs->rs_bound_addr);
  515. if (!rds_ibdev) {
  516. ret = -ENODEV;
  517. goto out;
  518. }
  519. if (!rds_ibdev->mr_pool) {
  520. ret = -ENODEV;
  521. goto out;
  522. }
  523. ibmr = rds_ib_alloc_fmr(rds_ibdev);
  524. if (IS_ERR(ibmr))
  525. return ibmr;
  526. ret = rds_ib_map_fmr(rds_ibdev, ibmr, sg, nents);
  527. if (ret == 0)
  528. *key_ret = ibmr->fmr->rkey;
  529. else
  530. printk(KERN_WARNING "RDS/IB: map_fmr failed (errno=%d)\n", ret);
  531. ibmr->device = rds_ibdev;
  532. rds_ibdev = NULL;
  533. out:
  534. if (ret) {
  535. if (ibmr)
  536. rds_ib_free_mr(ibmr, 0);
  537. ibmr = ERR_PTR(ret);
  538. }
  539. if (rds_ibdev)
  540. rds_ib_dev_put(rds_ibdev);
  541. return ibmr;
  542. }