iw_rdma.c 24 KB

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