iw_rdma.c 24 KB

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