iw_rdma.c 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837
  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/ratelimit.h>
  36. #include "rds.h"
  37. #include "iw.h"
  38. /*
  39. * This is stored as mr->r_trans_private.
  40. */
  41. struct rds_iw_mr {
  42. struct rds_iw_device *device;
  43. struct rds_iw_mr_pool *pool;
  44. struct rdma_cm_id *cm_id;
  45. struct ib_mr *mr;
  46. struct rds_iw_mapping mapping;
  47. unsigned char remap_count;
  48. };
  49. /*
  50. * Our own little MR pool
  51. */
  52. struct rds_iw_mr_pool {
  53. struct rds_iw_device *device; /* back ptr to the device that owns us */
  54. struct mutex flush_lock; /* serialize fmr invalidate */
  55. struct work_struct flush_worker; /* flush worker */
  56. spinlock_t list_lock; /* protect variables below */
  57. atomic_t item_count; /* total # of MRs */
  58. atomic_t dirty_count; /* # dirty of MRs */
  59. struct list_head dirty_list; /* dirty mappings */
  60. struct list_head clean_list; /* unused & unamapped MRs */
  61. atomic_t free_pinned; /* memory pinned by free MRs */
  62. unsigned long max_message_size; /* in pages */
  63. unsigned long max_items;
  64. unsigned long max_items_soft;
  65. unsigned long max_free_pinned;
  66. int max_pages;
  67. };
  68. static void rds_iw_flush_mr_pool(struct rds_iw_mr_pool *pool, int free_all);
  69. static void rds_iw_mr_pool_flush_worker(struct work_struct *work);
  70. static int rds_iw_init_reg(struct rds_iw_mr_pool *pool, struct rds_iw_mr *ibmr);
  71. static int rds_iw_map_reg(struct rds_iw_mr_pool *pool,
  72. struct rds_iw_mr *ibmr,
  73. struct scatterlist *sg, unsigned int nents);
  74. static void rds_iw_free_fastreg(struct rds_iw_mr_pool *pool, struct rds_iw_mr *ibmr);
  75. static unsigned int rds_iw_unmap_fastreg_list(struct rds_iw_mr_pool *pool,
  76. struct list_head *unmap_list,
  77. struct list_head *kill_list,
  78. int *unpinned);
  79. static void rds_iw_destroy_fastreg(struct rds_iw_mr_pool *pool, struct rds_iw_mr *ibmr);
  80. static int rds_iw_get_device(struct sockaddr_in *src, struct sockaddr_in *dst,
  81. struct rds_iw_device **rds_iwdev,
  82. struct rdma_cm_id **cm_id)
  83. {
  84. struct rds_iw_device *iwdev;
  85. struct rds_iw_cm_id *i_cm_id;
  86. *rds_iwdev = NULL;
  87. *cm_id = NULL;
  88. list_for_each_entry(iwdev, &rds_iw_devices, list) {
  89. spin_lock_irq(&iwdev->spinlock);
  90. list_for_each_entry(i_cm_id, &iwdev->cm_id_list, list) {
  91. struct sockaddr_in *src_addr, *dst_addr;
  92. src_addr = (struct sockaddr_in *)&i_cm_id->cm_id->route.addr.src_addr;
  93. dst_addr = (struct sockaddr_in *)&i_cm_id->cm_id->route.addr.dst_addr;
  94. rdsdebug("local ipaddr = %x port %d, "
  95. "remote ipaddr = %x port %d"
  96. "..looking for %x port %d, "
  97. "remote ipaddr = %x port %d\n",
  98. src_addr->sin_addr.s_addr,
  99. src_addr->sin_port,
  100. dst_addr->sin_addr.s_addr,
  101. dst_addr->sin_port,
  102. src->sin_addr.s_addr,
  103. src->sin_port,
  104. dst->sin_addr.s_addr,
  105. dst->sin_port);
  106. #ifdef WORKING_TUPLE_DETECTION
  107. if (src_addr->sin_addr.s_addr == src->sin_addr.s_addr &&
  108. src_addr->sin_port == src->sin_port &&
  109. dst_addr->sin_addr.s_addr == dst->sin_addr.s_addr &&
  110. dst_addr->sin_port == dst->sin_port) {
  111. #else
  112. /* FIXME - needs to compare the local and remote
  113. * ipaddr/port tuple, but the ipaddr is the only
  114. * available information in the rds_sock (as the rest are
  115. * zero'ed. It doesn't appear to be properly populated
  116. * during connection setup...
  117. */
  118. if (src_addr->sin_addr.s_addr == src->sin_addr.s_addr) {
  119. #endif
  120. spin_unlock_irq(&iwdev->spinlock);
  121. *rds_iwdev = iwdev;
  122. *cm_id = i_cm_id->cm_id;
  123. return 0;
  124. }
  125. }
  126. spin_unlock_irq(&iwdev->spinlock);
  127. }
  128. return 1;
  129. }
  130. static int rds_iw_add_cm_id(struct rds_iw_device *rds_iwdev, struct rdma_cm_id *cm_id)
  131. {
  132. struct rds_iw_cm_id *i_cm_id;
  133. i_cm_id = kmalloc(sizeof *i_cm_id, GFP_KERNEL);
  134. if (!i_cm_id)
  135. return -ENOMEM;
  136. i_cm_id->cm_id = cm_id;
  137. spin_lock_irq(&rds_iwdev->spinlock);
  138. list_add_tail(&i_cm_id->list, &rds_iwdev->cm_id_list);
  139. spin_unlock_irq(&rds_iwdev->spinlock);
  140. return 0;
  141. }
  142. static void rds_iw_remove_cm_id(struct rds_iw_device *rds_iwdev,
  143. struct rdma_cm_id *cm_id)
  144. {
  145. struct rds_iw_cm_id *i_cm_id;
  146. spin_lock_irq(&rds_iwdev->spinlock);
  147. list_for_each_entry(i_cm_id, &rds_iwdev->cm_id_list, list) {
  148. if (i_cm_id->cm_id == cm_id) {
  149. list_del(&i_cm_id->list);
  150. kfree(i_cm_id);
  151. break;
  152. }
  153. }
  154. spin_unlock_irq(&rds_iwdev->spinlock);
  155. }
  156. int rds_iw_update_cm_id(struct rds_iw_device *rds_iwdev, struct rdma_cm_id *cm_id)
  157. {
  158. struct sockaddr_in *src_addr, *dst_addr;
  159. struct rds_iw_device *rds_iwdev_old;
  160. struct rdma_cm_id *pcm_id;
  161. int rc;
  162. src_addr = (struct sockaddr_in *)&cm_id->route.addr.src_addr;
  163. dst_addr = (struct sockaddr_in *)&cm_id->route.addr.dst_addr;
  164. rc = rds_iw_get_device(src_addr, dst_addr, &rds_iwdev_old, &pcm_id);
  165. if (rc)
  166. rds_iw_remove_cm_id(rds_iwdev, cm_id);
  167. return rds_iw_add_cm_id(rds_iwdev, cm_id);
  168. }
  169. void rds_iw_add_conn(struct rds_iw_device *rds_iwdev, struct rds_connection *conn)
  170. {
  171. struct rds_iw_connection *ic = conn->c_transport_data;
  172. /* conn was previously on the nodev_conns_list */
  173. spin_lock_irq(&iw_nodev_conns_lock);
  174. BUG_ON(list_empty(&iw_nodev_conns));
  175. BUG_ON(list_empty(&ic->iw_node));
  176. list_del(&ic->iw_node);
  177. spin_lock(&rds_iwdev->spinlock);
  178. list_add_tail(&ic->iw_node, &rds_iwdev->conn_list);
  179. spin_unlock(&rds_iwdev->spinlock);
  180. spin_unlock_irq(&iw_nodev_conns_lock);
  181. ic->rds_iwdev = rds_iwdev;
  182. }
  183. void rds_iw_remove_conn(struct rds_iw_device *rds_iwdev, struct rds_connection *conn)
  184. {
  185. struct rds_iw_connection *ic = conn->c_transport_data;
  186. /* place conn on nodev_conns_list */
  187. spin_lock(&iw_nodev_conns_lock);
  188. spin_lock_irq(&rds_iwdev->spinlock);
  189. BUG_ON(list_empty(&ic->iw_node));
  190. list_del(&ic->iw_node);
  191. spin_unlock_irq(&rds_iwdev->spinlock);
  192. list_add_tail(&ic->iw_node, &iw_nodev_conns);
  193. spin_unlock(&iw_nodev_conns_lock);
  194. rds_iw_remove_cm_id(ic->rds_iwdev, ic->i_cm_id);
  195. ic->rds_iwdev = NULL;
  196. }
  197. void __rds_iw_destroy_conns(struct list_head *list, spinlock_t *list_lock)
  198. {
  199. struct rds_iw_connection *ic, *_ic;
  200. LIST_HEAD(tmp_list);
  201. /* avoid calling conn_destroy with irqs off */
  202. spin_lock_irq(list_lock);
  203. list_splice(list, &tmp_list);
  204. INIT_LIST_HEAD(list);
  205. spin_unlock_irq(list_lock);
  206. list_for_each_entry_safe(ic, _ic, &tmp_list, iw_node)
  207. rds_conn_destroy(ic->conn);
  208. }
  209. static void rds_iw_set_scatterlist(struct rds_iw_scatterlist *sg,
  210. struct scatterlist *list, unsigned int sg_len)
  211. {
  212. sg->list = list;
  213. sg->len = sg_len;
  214. sg->dma_len = 0;
  215. sg->dma_npages = 0;
  216. sg->bytes = 0;
  217. }
  218. static int rds_iw_map_scatterlist(struct rds_iw_device *rds_iwdev,
  219. struct rds_iw_scatterlist *sg)
  220. {
  221. struct ib_device *dev = rds_iwdev->dev;
  222. int i, ret;
  223. WARN_ON(sg->dma_len);
  224. sg->dma_len = ib_dma_map_sg(dev, sg->list, sg->len, DMA_BIDIRECTIONAL);
  225. if (unlikely(!sg->dma_len)) {
  226. printk(KERN_WARNING "RDS/IW: dma_map_sg failed!\n");
  227. return -EBUSY;
  228. }
  229. sg->bytes = 0;
  230. sg->dma_npages = 0;
  231. ret = -EINVAL;
  232. for (i = 0; i < sg->dma_len; ++i) {
  233. unsigned int dma_len = ib_sg_dma_len(dev, &sg->list[i]);
  234. u64 dma_addr = ib_sg_dma_address(dev, &sg->list[i]);
  235. u64 end_addr;
  236. sg->bytes += dma_len;
  237. end_addr = dma_addr + dma_len;
  238. if (dma_addr & PAGE_MASK) {
  239. if (i > 0)
  240. goto out_unmap;
  241. dma_addr &= ~PAGE_MASK;
  242. }
  243. if (end_addr & PAGE_MASK) {
  244. if (i < sg->dma_len - 1)
  245. goto out_unmap;
  246. end_addr = (end_addr + PAGE_MASK) & ~PAGE_MASK;
  247. }
  248. sg->dma_npages += (end_addr - dma_addr) >> PAGE_SHIFT;
  249. }
  250. /* Now gather the dma addrs into one list */
  251. if (sg->dma_npages > fastreg_message_size)
  252. goto out_unmap;
  253. return 0;
  254. out_unmap:
  255. ib_dma_unmap_sg(rds_iwdev->dev, sg->list, sg->len, DMA_BIDIRECTIONAL);
  256. sg->dma_len = 0;
  257. return ret;
  258. }
  259. struct rds_iw_mr_pool *rds_iw_create_mr_pool(struct rds_iw_device *rds_iwdev)
  260. {
  261. struct rds_iw_mr_pool *pool;
  262. pool = kzalloc(sizeof(*pool), GFP_KERNEL);
  263. if (!pool) {
  264. printk(KERN_WARNING "RDS/IW: rds_iw_create_mr_pool alloc error\n");
  265. return ERR_PTR(-ENOMEM);
  266. }
  267. pool->device = rds_iwdev;
  268. INIT_LIST_HEAD(&pool->dirty_list);
  269. INIT_LIST_HEAD(&pool->clean_list);
  270. mutex_init(&pool->flush_lock);
  271. spin_lock_init(&pool->list_lock);
  272. INIT_WORK(&pool->flush_worker, rds_iw_mr_pool_flush_worker);
  273. pool->max_message_size = fastreg_message_size;
  274. pool->max_items = fastreg_pool_size;
  275. pool->max_free_pinned = pool->max_items * pool->max_message_size / 4;
  276. pool->max_pages = fastreg_message_size;
  277. /* We never allow more than max_items MRs to be allocated.
  278. * When we exceed more than max_items_soft, we start freeing
  279. * items more aggressively.
  280. * Make sure that max_items > max_items_soft > max_items / 2
  281. */
  282. pool->max_items_soft = pool->max_items * 3 / 4;
  283. return pool;
  284. }
  285. void rds_iw_get_mr_info(struct rds_iw_device *rds_iwdev, struct rds_info_rdma_connection *iinfo)
  286. {
  287. struct rds_iw_mr_pool *pool = rds_iwdev->mr_pool;
  288. iinfo->rdma_mr_max = pool->max_items;
  289. iinfo->rdma_mr_size = pool->max_pages;
  290. }
  291. void rds_iw_destroy_mr_pool(struct rds_iw_mr_pool *pool)
  292. {
  293. flush_workqueue(rds_wq);
  294. rds_iw_flush_mr_pool(pool, 1);
  295. BUG_ON(atomic_read(&pool->item_count));
  296. BUG_ON(atomic_read(&pool->free_pinned));
  297. kfree(pool);
  298. }
  299. static inline struct rds_iw_mr *rds_iw_reuse_fmr(struct rds_iw_mr_pool *pool)
  300. {
  301. struct rds_iw_mr *ibmr = NULL;
  302. unsigned long flags;
  303. spin_lock_irqsave(&pool->list_lock, flags);
  304. if (!list_empty(&pool->clean_list)) {
  305. ibmr = list_entry(pool->clean_list.next, struct rds_iw_mr, mapping.m_list);
  306. list_del_init(&ibmr->mapping.m_list);
  307. }
  308. spin_unlock_irqrestore(&pool->list_lock, flags);
  309. return ibmr;
  310. }
  311. static struct rds_iw_mr *rds_iw_alloc_mr(struct rds_iw_device *rds_iwdev)
  312. {
  313. struct rds_iw_mr_pool *pool = rds_iwdev->mr_pool;
  314. struct rds_iw_mr *ibmr = NULL;
  315. int err = 0, iter = 0;
  316. while (1) {
  317. ibmr = rds_iw_reuse_fmr(pool);
  318. if (ibmr)
  319. return ibmr;
  320. /* No clean MRs - now we have the choice of either
  321. * allocating a fresh MR up to the limit imposed by the
  322. * driver, or flush any dirty unused MRs.
  323. * We try to avoid stalling in the send path if possible,
  324. * so we allocate as long as we're allowed to.
  325. *
  326. * We're fussy with enforcing the FMR limit, though. If the driver
  327. * tells us we can't use more than N fmrs, we shouldn't start
  328. * arguing with it */
  329. if (atomic_inc_return(&pool->item_count) <= pool->max_items)
  330. break;
  331. atomic_dec(&pool->item_count);
  332. if (++iter > 2) {
  333. rds_iw_stats_inc(s_iw_rdma_mr_pool_depleted);
  334. return ERR_PTR(-EAGAIN);
  335. }
  336. /* We do have some empty MRs. Flush them out. */
  337. rds_iw_stats_inc(s_iw_rdma_mr_pool_wait);
  338. rds_iw_flush_mr_pool(pool, 0);
  339. }
  340. ibmr = kzalloc(sizeof(*ibmr), GFP_KERNEL);
  341. if (!ibmr) {
  342. err = -ENOMEM;
  343. goto out_no_cigar;
  344. }
  345. spin_lock_init(&ibmr->mapping.m_lock);
  346. INIT_LIST_HEAD(&ibmr->mapping.m_list);
  347. ibmr->mapping.m_mr = ibmr;
  348. err = rds_iw_init_reg(pool, ibmr);
  349. if (err)
  350. goto out_no_cigar;
  351. rds_iw_stats_inc(s_iw_rdma_mr_alloc);
  352. return ibmr;
  353. out_no_cigar:
  354. if (ibmr) {
  355. rds_iw_destroy_fastreg(pool, ibmr);
  356. kfree(ibmr);
  357. }
  358. atomic_dec(&pool->item_count);
  359. return ERR_PTR(err);
  360. }
  361. void rds_iw_sync_mr(void *trans_private, int direction)
  362. {
  363. struct rds_iw_mr *ibmr = trans_private;
  364. struct rds_iw_device *rds_iwdev = ibmr->device;
  365. switch (direction) {
  366. case DMA_FROM_DEVICE:
  367. ib_dma_sync_sg_for_cpu(rds_iwdev->dev, ibmr->mapping.m_sg.list,
  368. ibmr->mapping.m_sg.dma_len, DMA_BIDIRECTIONAL);
  369. break;
  370. case DMA_TO_DEVICE:
  371. ib_dma_sync_sg_for_device(rds_iwdev->dev, ibmr->mapping.m_sg.list,
  372. ibmr->mapping.m_sg.dma_len, DMA_BIDIRECTIONAL);
  373. break;
  374. }
  375. }
  376. /*
  377. * Flush our pool of MRs.
  378. * At a minimum, all currently unused MRs are unmapped.
  379. * If the number of MRs allocated exceeds the limit, we also try
  380. * to free as many MRs as needed to get back to this limit.
  381. */
  382. static void rds_iw_flush_mr_pool(struct rds_iw_mr_pool *pool, int free_all)
  383. {
  384. struct rds_iw_mr *ibmr, *next;
  385. LIST_HEAD(unmap_list);
  386. LIST_HEAD(kill_list);
  387. unsigned long flags;
  388. unsigned int nfreed = 0, ncleaned = 0, unpinned = 0;
  389. rds_iw_stats_inc(s_iw_rdma_mr_pool_flush);
  390. mutex_lock(&pool->flush_lock);
  391. spin_lock_irqsave(&pool->list_lock, flags);
  392. /* Get the list of all mappings to be destroyed */
  393. list_splice_init(&pool->dirty_list, &unmap_list);
  394. if (free_all)
  395. list_splice_init(&pool->clean_list, &kill_list);
  396. spin_unlock_irqrestore(&pool->list_lock, flags);
  397. /* Batched invalidate of dirty MRs.
  398. * For FMR based MRs, the mappings on the unmap list are
  399. * actually members of an ibmr (ibmr->mapping). They either
  400. * migrate to the kill_list, or have been cleaned and should be
  401. * moved to the clean_list.
  402. * For fastregs, they will be dynamically allocated, and
  403. * will be destroyed by the unmap function.
  404. */
  405. if (!list_empty(&unmap_list)) {
  406. ncleaned = rds_iw_unmap_fastreg_list(pool, &unmap_list,
  407. &kill_list, &unpinned);
  408. /* If we've been asked to destroy all MRs, move those
  409. * that were simply cleaned to the kill list */
  410. if (free_all)
  411. list_splice_init(&unmap_list, &kill_list);
  412. }
  413. /* Destroy any MRs that are past their best before date */
  414. list_for_each_entry_safe(ibmr, next, &kill_list, mapping.m_list) {
  415. rds_iw_stats_inc(s_iw_rdma_mr_free);
  416. list_del(&ibmr->mapping.m_list);
  417. rds_iw_destroy_fastreg(pool, ibmr);
  418. kfree(ibmr);
  419. nfreed++;
  420. }
  421. /* Anything that remains are laundered ibmrs, which we can add
  422. * back to the clean list. */
  423. if (!list_empty(&unmap_list)) {
  424. spin_lock_irqsave(&pool->list_lock, flags);
  425. list_splice(&unmap_list, &pool->clean_list);
  426. spin_unlock_irqrestore(&pool->list_lock, flags);
  427. }
  428. atomic_sub(unpinned, &pool->free_pinned);
  429. atomic_sub(ncleaned, &pool->dirty_count);
  430. atomic_sub(nfreed, &pool->item_count);
  431. mutex_unlock(&pool->flush_lock);
  432. }
  433. static void rds_iw_mr_pool_flush_worker(struct work_struct *work)
  434. {
  435. struct rds_iw_mr_pool *pool = container_of(work, struct rds_iw_mr_pool, flush_worker);
  436. rds_iw_flush_mr_pool(pool, 0);
  437. }
  438. void rds_iw_free_mr(void *trans_private, int invalidate)
  439. {
  440. struct rds_iw_mr *ibmr = trans_private;
  441. struct rds_iw_mr_pool *pool = ibmr->device->mr_pool;
  442. rdsdebug("RDS/IW: free_mr nents %u\n", ibmr->mapping.m_sg.len);
  443. if (!pool)
  444. return;
  445. /* Return it to the pool's free list */
  446. rds_iw_free_fastreg(pool, ibmr);
  447. /* If we've pinned too many pages, request a flush */
  448. if (atomic_read(&pool->free_pinned) >= pool->max_free_pinned ||
  449. atomic_read(&pool->dirty_count) >= pool->max_items / 10)
  450. queue_work(rds_wq, &pool->flush_worker);
  451. if (invalidate) {
  452. if (likely(!in_interrupt())) {
  453. rds_iw_flush_mr_pool(pool, 0);
  454. } else {
  455. /* We get here if the user created a MR marked
  456. * as use_once and invalidate at the same time. */
  457. queue_work(rds_wq, &pool->flush_worker);
  458. }
  459. }
  460. }
  461. void rds_iw_flush_mrs(void)
  462. {
  463. struct rds_iw_device *rds_iwdev;
  464. list_for_each_entry(rds_iwdev, &rds_iw_devices, list) {
  465. struct rds_iw_mr_pool *pool = rds_iwdev->mr_pool;
  466. if (pool)
  467. rds_iw_flush_mr_pool(pool, 0);
  468. }
  469. }
  470. void *rds_iw_get_mr(struct scatterlist *sg, unsigned long nents,
  471. struct rds_sock *rs, u32 *key_ret)
  472. {
  473. struct rds_iw_device *rds_iwdev;
  474. struct rds_iw_mr *ibmr = NULL;
  475. struct rdma_cm_id *cm_id;
  476. struct sockaddr_in src = {
  477. .sin_addr.s_addr = rs->rs_bound_addr,
  478. .sin_port = rs->rs_bound_port,
  479. };
  480. struct sockaddr_in dst = {
  481. .sin_addr.s_addr = rs->rs_conn_addr,
  482. .sin_port = rs->rs_conn_port,
  483. };
  484. int ret;
  485. ret = rds_iw_get_device(&src, &dst, &rds_iwdev, &cm_id);
  486. if (ret || !cm_id) {
  487. ret = -ENODEV;
  488. goto out;
  489. }
  490. if (!rds_iwdev->mr_pool) {
  491. ret = -ENODEV;
  492. goto out;
  493. }
  494. ibmr = rds_iw_alloc_mr(rds_iwdev);
  495. if (IS_ERR(ibmr))
  496. return ibmr;
  497. ibmr->cm_id = cm_id;
  498. ibmr->device = rds_iwdev;
  499. ret = rds_iw_map_reg(rds_iwdev->mr_pool, ibmr, sg, nents);
  500. if (ret == 0)
  501. *key_ret = ibmr->mr->rkey;
  502. else
  503. printk(KERN_WARNING "RDS/IW: failed to map mr (errno=%d)\n", ret);
  504. out:
  505. if (ret) {
  506. if (ibmr)
  507. rds_iw_free_mr(ibmr, 0);
  508. ibmr = ERR_PTR(ret);
  509. }
  510. return ibmr;
  511. }
  512. /*
  513. * iWARP reg handling
  514. *
  515. * The life cycle of a fastreg registration is a bit different from
  516. * FMRs.
  517. * The idea behind fastreg is to have one MR, to which we bind different
  518. * mappings over time. To avoid stalling on the expensive map and invalidate
  519. * operations, these operations are pipelined on the same send queue on
  520. * which we want to send the message containing the r_key.
  521. *
  522. * This creates a bit of a problem for us, as we do not have the destination
  523. * IP in GET_MR, so the connection must be setup prior to the GET_MR call for
  524. * RDMA to be correctly setup. If a fastreg request is present, rds_iw_xmit
  525. * will try to queue a LOCAL_INV (if needed) and a REG_MR work request
  526. * before queuing the SEND. When completions for these arrive, they are
  527. * dispatched to the MR has a bit set showing that RDMa can be performed.
  528. *
  529. * There is another interesting aspect that's related to invalidation.
  530. * The application can request that a mapping is invalidated in FREE_MR.
  531. * The expectation there is that this invalidation step includes ALL
  532. * PREVIOUSLY FREED MRs.
  533. */
  534. static int rds_iw_init_reg(struct rds_iw_mr_pool *pool,
  535. struct rds_iw_mr *ibmr)
  536. {
  537. struct rds_iw_device *rds_iwdev = pool->device;
  538. struct ib_mr *mr;
  539. int err;
  540. mr = ib_alloc_mr(rds_iwdev->pd, IB_MR_TYPE_MEM_REG,
  541. pool->max_message_size);
  542. if (IS_ERR(mr)) {
  543. err = PTR_ERR(mr);
  544. printk(KERN_WARNING "RDS/IW: ib_alloc_mr failed (err=%d)\n", err);
  545. return err;
  546. }
  547. ibmr->mr = mr;
  548. return 0;
  549. }
  550. static int rds_iw_rdma_reg_mr(struct rds_iw_mapping *mapping)
  551. {
  552. struct rds_iw_mr *ibmr = mapping->m_mr;
  553. struct rds_iw_scatterlist *m_sg = &mapping->m_sg;
  554. struct ib_reg_wr reg_wr;
  555. struct ib_send_wr *failed_wr;
  556. int ret, n;
  557. n = ib_map_mr_sg_zbva(ibmr->mr, m_sg->list, m_sg->len, PAGE_SIZE);
  558. if (unlikely(n != m_sg->len))
  559. return n < 0 ? n : -EINVAL;
  560. reg_wr.wr.next = NULL;
  561. reg_wr.wr.opcode = IB_WR_REG_MR;
  562. reg_wr.wr.wr_id = RDS_IW_REG_WR_ID;
  563. reg_wr.wr.num_sge = 0;
  564. reg_wr.mr = ibmr->mr;
  565. reg_wr.key = mapping->m_rkey;
  566. reg_wr.access = IB_ACCESS_LOCAL_WRITE |
  567. IB_ACCESS_REMOTE_READ |
  568. IB_ACCESS_REMOTE_WRITE;
  569. /*
  570. * Perform a WR for the reg_mr. Each individual page
  571. * in the sg list is added to the fast reg page list and placed
  572. * inside the reg_mr WR. The key used is a rolling 8bit
  573. * counter, which should guarantee uniqueness.
  574. */
  575. ib_update_fast_reg_key(ibmr->mr, ibmr->remap_count++);
  576. mapping->m_rkey = ibmr->mr->rkey;
  577. failed_wr = &reg_wr.wr;
  578. ret = ib_post_send(ibmr->cm_id->qp, &reg_wr.wr, &failed_wr);
  579. BUG_ON(failed_wr != &reg_wr.wr);
  580. if (ret)
  581. printk_ratelimited(KERN_WARNING "RDS/IW: %s:%d ib_post_send returned %d\n",
  582. __func__, __LINE__, ret);
  583. return ret;
  584. }
  585. static int rds_iw_rdma_fastreg_inv(struct rds_iw_mr *ibmr)
  586. {
  587. struct ib_send_wr s_wr, *failed_wr;
  588. int ret = 0;
  589. if (!ibmr->cm_id->qp || !ibmr->mr)
  590. goto out;
  591. memset(&s_wr, 0, sizeof(s_wr));
  592. s_wr.wr_id = RDS_IW_LOCAL_INV_WR_ID;
  593. s_wr.opcode = IB_WR_LOCAL_INV;
  594. s_wr.ex.invalidate_rkey = ibmr->mr->rkey;
  595. s_wr.send_flags = IB_SEND_SIGNALED;
  596. failed_wr = &s_wr;
  597. ret = ib_post_send(ibmr->cm_id->qp, &s_wr, &failed_wr);
  598. if (ret) {
  599. printk_ratelimited(KERN_WARNING "RDS/IW: %s:%d ib_post_send returned %d\n",
  600. __func__, __LINE__, ret);
  601. goto out;
  602. }
  603. out:
  604. return ret;
  605. }
  606. static int rds_iw_map_reg(struct rds_iw_mr_pool *pool,
  607. struct rds_iw_mr *ibmr,
  608. struct scatterlist *sg,
  609. unsigned int sg_len)
  610. {
  611. struct rds_iw_device *rds_iwdev = pool->device;
  612. struct rds_iw_mapping *mapping = &ibmr->mapping;
  613. u64 *dma_pages;
  614. int ret = 0;
  615. rds_iw_set_scatterlist(&mapping->m_sg, sg, sg_len);
  616. ret = rds_iw_map_scatterlist(rds_iwdev, &mapping->m_sg);
  617. if (ret) {
  618. dma_pages = NULL;
  619. goto out;
  620. }
  621. if (mapping->m_sg.dma_len > pool->max_message_size) {
  622. ret = -EMSGSIZE;
  623. goto out;
  624. }
  625. ret = rds_iw_rdma_reg_mr(mapping);
  626. if (ret)
  627. goto out;
  628. rds_iw_stats_inc(s_iw_rdma_mr_used);
  629. out:
  630. kfree(dma_pages);
  631. return ret;
  632. }
  633. /*
  634. * "Free" a fastreg MR.
  635. */
  636. static void rds_iw_free_fastreg(struct rds_iw_mr_pool *pool,
  637. struct rds_iw_mr *ibmr)
  638. {
  639. unsigned long flags;
  640. int ret;
  641. if (!ibmr->mapping.m_sg.dma_len)
  642. return;
  643. ret = rds_iw_rdma_fastreg_inv(ibmr);
  644. if (ret)
  645. return;
  646. /* Try to post the LOCAL_INV WR to the queue. */
  647. spin_lock_irqsave(&pool->list_lock, flags);
  648. list_add_tail(&ibmr->mapping.m_list, &pool->dirty_list);
  649. atomic_add(ibmr->mapping.m_sg.len, &pool->free_pinned);
  650. atomic_inc(&pool->dirty_count);
  651. spin_unlock_irqrestore(&pool->list_lock, flags);
  652. }
  653. static unsigned int rds_iw_unmap_fastreg_list(struct rds_iw_mr_pool *pool,
  654. struct list_head *unmap_list,
  655. struct list_head *kill_list,
  656. int *unpinned)
  657. {
  658. struct rds_iw_mapping *mapping, *next;
  659. unsigned int ncleaned = 0;
  660. LIST_HEAD(laundered);
  661. /* Batched invalidation of fastreg MRs.
  662. * Why do we do it this way, even though we could pipeline unmap
  663. * and remap? The reason is the application semantics - when the
  664. * application requests an invalidation of MRs, it expects all
  665. * previously released R_Keys to become invalid.
  666. *
  667. * If we implement MR reuse naively, we risk memory corruption
  668. * (this has actually been observed). So the default behavior
  669. * requires that a MR goes through an explicit unmap operation before
  670. * we can reuse it again.
  671. *
  672. * We could probably improve on this a little, by allowing immediate
  673. * reuse of a MR on the same socket (eg you could add small
  674. * cache of unused MRs to strct rds_socket - GET_MR could grab one
  675. * of these without requiring an explicit invalidate).
  676. */
  677. while (!list_empty(unmap_list)) {
  678. unsigned long flags;
  679. spin_lock_irqsave(&pool->list_lock, flags);
  680. list_for_each_entry_safe(mapping, next, unmap_list, m_list) {
  681. *unpinned += mapping->m_sg.len;
  682. list_move(&mapping->m_list, &laundered);
  683. ncleaned++;
  684. }
  685. spin_unlock_irqrestore(&pool->list_lock, flags);
  686. }
  687. /* Move all laundered mappings back to the unmap list.
  688. * We do not kill any WRs right now - it doesn't seem the
  689. * fastreg API has a max_remap limit. */
  690. list_splice_init(&laundered, unmap_list);
  691. return ncleaned;
  692. }
  693. static void rds_iw_destroy_fastreg(struct rds_iw_mr_pool *pool,
  694. struct rds_iw_mr *ibmr)
  695. {
  696. if (ibmr->mr)
  697. ib_dereg_mr(ibmr->mr);
  698. }