fmr_pool.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522
  1. /*
  2. * Copyright (c) 2004 Topspin Communications. All rights reserved.
  3. * Copyright (c) 2005 Sun Microsystems, Inc. All rights reserved.
  4. *
  5. * This software is available to you under a choice of one of two
  6. * licenses. You may choose to be licensed under the terms of the GNU
  7. * General Public License (GPL) Version 2, available from the file
  8. * COPYING in the main directory of this source tree, or the
  9. * OpenIB.org BSD license below:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * - Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  19. * - Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials
  22. * provided with the distribution.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  25. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  26. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  27. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  28. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  29. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  30. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  31. * SOFTWARE.
  32. */
  33. #include <linux/errno.h>
  34. #include <linux/spinlock.h>
  35. #include <linux/export.h>
  36. #include <linux/slab.h>
  37. #include <linux/jhash.h>
  38. #include <linux/kthread.h>
  39. #include <rdma/ib_fmr_pool.h>
  40. #include "core_priv.h"
  41. #define PFX "fmr_pool: "
  42. enum {
  43. IB_FMR_MAX_REMAPS = 32,
  44. IB_FMR_HASH_BITS = 8,
  45. IB_FMR_HASH_SIZE = 1 << IB_FMR_HASH_BITS,
  46. IB_FMR_HASH_MASK = IB_FMR_HASH_SIZE - 1
  47. };
  48. /*
  49. * If an FMR is not in use, then the list member will point to either
  50. * its pool's free_list (if the FMR can be mapped again; that is,
  51. * remap_count < pool->max_remaps) or its pool's dirty_list (if the
  52. * FMR needs to be unmapped before being remapped). In either of
  53. * these cases it is a bug if the ref_count is not 0. In other words,
  54. * if ref_count is > 0, then the list member must not be linked into
  55. * either free_list or dirty_list.
  56. *
  57. * The cache_node member is used to link the FMR into a cache bucket
  58. * (if caching is enabled). This is independent of the reference
  59. * count of the FMR. When a valid FMR is released, its ref_count is
  60. * decremented, and if ref_count reaches 0, the FMR is placed in
  61. * either free_list or dirty_list as appropriate. However, it is not
  62. * removed from the cache and may be "revived" if a call to
  63. * ib_fmr_register_physical() occurs before the FMR is remapped. In
  64. * this case we just increment the ref_count and remove the FMR from
  65. * free_list/dirty_list.
  66. *
  67. * Before we remap an FMR from free_list, we remove it from the cache
  68. * (to prevent another user from obtaining a stale FMR). When an FMR
  69. * is released, we add it to the tail of the free list, so that our
  70. * cache eviction policy is "least recently used."
  71. *
  72. * All manipulation of ref_count, list and cache_node is protected by
  73. * pool_lock to maintain consistency.
  74. */
  75. struct ib_fmr_pool {
  76. spinlock_t pool_lock;
  77. int pool_size;
  78. int max_pages;
  79. int max_remaps;
  80. int dirty_watermark;
  81. int dirty_len;
  82. struct list_head free_list;
  83. struct list_head dirty_list;
  84. struct hlist_head *cache_bucket;
  85. void (*flush_function)(struct ib_fmr_pool *pool,
  86. void * arg);
  87. void *flush_arg;
  88. struct task_struct *thread;
  89. atomic_t req_ser;
  90. atomic_t flush_ser;
  91. wait_queue_head_t force_wait;
  92. };
  93. static inline u32 ib_fmr_hash(u64 first_page)
  94. {
  95. return jhash_2words((u32) first_page, (u32) (first_page >> 32), 0) &
  96. (IB_FMR_HASH_SIZE - 1);
  97. }
  98. /* Caller must hold pool_lock */
  99. static inline struct ib_pool_fmr *ib_fmr_cache_lookup(struct ib_fmr_pool *pool,
  100. u64 *page_list,
  101. int page_list_len,
  102. u64 io_virtual_address)
  103. {
  104. struct hlist_head *bucket;
  105. struct ib_pool_fmr *fmr;
  106. if (!pool->cache_bucket)
  107. return NULL;
  108. bucket = pool->cache_bucket + ib_fmr_hash(*page_list);
  109. hlist_for_each_entry(fmr, bucket, cache_node)
  110. if (io_virtual_address == fmr->io_virtual_address &&
  111. page_list_len == fmr->page_list_len &&
  112. !memcmp(page_list, fmr->page_list,
  113. page_list_len * sizeof *page_list))
  114. return fmr;
  115. return NULL;
  116. }
  117. static void ib_fmr_batch_release(struct ib_fmr_pool *pool)
  118. {
  119. int ret;
  120. struct ib_pool_fmr *fmr;
  121. LIST_HEAD(unmap_list);
  122. LIST_HEAD(fmr_list);
  123. spin_lock_irq(&pool->pool_lock);
  124. list_for_each_entry(fmr, &pool->dirty_list, list) {
  125. hlist_del_init(&fmr->cache_node);
  126. fmr->remap_count = 0;
  127. list_add_tail(&fmr->fmr->list, &fmr_list);
  128. #ifdef DEBUG
  129. if (fmr->ref_count !=0) {
  130. pr_warn(PFX "Unmapping FMR 0x%08x with ref count %d\n",
  131. fmr, fmr->ref_count);
  132. }
  133. #endif
  134. }
  135. list_splice_init(&pool->dirty_list, &unmap_list);
  136. pool->dirty_len = 0;
  137. spin_unlock_irq(&pool->pool_lock);
  138. if (list_empty(&unmap_list)) {
  139. return;
  140. }
  141. ret = ib_unmap_fmr(&fmr_list);
  142. if (ret)
  143. pr_warn(PFX "ib_unmap_fmr returned %d\n", ret);
  144. spin_lock_irq(&pool->pool_lock);
  145. list_splice(&unmap_list, &pool->free_list);
  146. spin_unlock_irq(&pool->pool_lock);
  147. }
  148. static int ib_fmr_cleanup_thread(void *pool_ptr)
  149. {
  150. struct ib_fmr_pool *pool = pool_ptr;
  151. do {
  152. if (atomic_read(&pool->flush_ser) - atomic_read(&pool->req_ser) < 0) {
  153. ib_fmr_batch_release(pool);
  154. atomic_inc(&pool->flush_ser);
  155. wake_up_interruptible(&pool->force_wait);
  156. if (pool->flush_function)
  157. pool->flush_function(pool, pool->flush_arg);
  158. }
  159. set_current_state(TASK_INTERRUPTIBLE);
  160. if (atomic_read(&pool->flush_ser) - atomic_read(&pool->req_ser) >= 0 &&
  161. !kthread_should_stop())
  162. schedule();
  163. __set_current_state(TASK_RUNNING);
  164. } while (!kthread_should_stop());
  165. return 0;
  166. }
  167. /**
  168. * ib_create_fmr_pool - Create an FMR pool
  169. * @pd:Protection domain for FMRs
  170. * @params:FMR pool parameters
  171. *
  172. * Create a pool of FMRs. Return value is pointer to new pool or
  173. * error code if creation failed.
  174. */
  175. struct ib_fmr_pool *ib_create_fmr_pool(struct ib_pd *pd,
  176. struct ib_fmr_pool_param *params)
  177. {
  178. struct ib_device *device;
  179. struct ib_fmr_pool *pool;
  180. int i;
  181. int ret;
  182. int max_remaps;
  183. if (!params)
  184. return ERR_PTR(-EINVAL);
  185. device = pd->device;
  186. if (!device->alloc_fmr || !device->dealloc_fmr ||
  187. !device->map_phys_fmr || !device->unmap_fmr) {
  188. pr_info(PFX "Device %s does not support FMRs\n", device->name);
  189. return ERR_PTR(-ENOSYS);
  190. }
  191. if (!device->attrs.max_map_per_fmr)
  192. max_remaps = IB_FMR_MAX_REMAPS;
  193. else
  194. max_remaps = device->attrs.max_map_per_fmr;
  195. pool = kmalloc(sizeof *pool, GFP_KERNEL);
  196. if (!pool)
  197. return ERR_PTR(-ENOMEM);
  198. pool->cache_bucket = NULL;
  199. pool->flush_function = params->flush_function;
  200. pool->flush_arg = params->flush_arg;
  201. INIT_LIST_HEAD(&pool->free_list);
  202. INIT_LIST_HEAD(&pool->dirty_list);
  203. if (params->cache) {
  204. pool->cache_bucket =
  205. kmalloc(IB_FMR_HASH_SIZE * sizeof *pool->cache_bucket,
  206. GFP_KERNEL);
  207. if (!pool->cache_bucket) {
  208. pr_warn(PFX "Failed to allocate cache in pool\n");
  209. ret = -ENOMEM;
  210. goto out_free_pool;
  211. }
  212. for (i = 0; i < IB_FMR_HASH_SIZE; ++i)
  213. INIT_HLIST_HEAD(pool->cache_bucket + i);
  214. }
  215. pool->pool_size = 0;
  216. pool->max_pages = params->max_pages_per_fmr;
  217. pool->max_remaps = max_remaps;
  218. pool->dirty_watermark = params->dirty_watermark;
  219. pool->dirty_len = 0;
  220. spin_lock_init(&pool->pool_lock);
  221. atomic_set(&pool->req_ser, 0);
  222. atomic_set(&pool->flush_ser, 0);
  223. init_waitqueue_head(&pool->force_wait);
  224. pool->thread = kthread_run(ib_fmr_cleanup_thread,
  225. pool,
  226. "ib_fmr(%s)",
  227. device->name);
  228. if (IS_ERR(pool->thread)) {
  229. pr_warn(PFX "couldn't start cleanup thread\n");
  230. ret = PTR_ERR(pool->thread);
  231. goto out_free_pool;
  232. }
  233. {
  234. struct ib_pool_fmr *fmr;
  235. struct ib_fmr_attr fmr_attr = {
  236. .max_pages = params->max_pages_per_fmr,
  237. .max_maps = pool->max_remaps,
  238. .page_shift = params->page_shift
  239. };
  240. int bytes_per_fmr = sizeof *fmr;
  241. if (pool->cache_bucket)
  242. bytes_per_fmr += params->max_pages_per_fmr * sizeof (u64);
  243. for (i = 0; i < params->pool_size; ++i) {
  244. fmr = kmalloc(bytes_per_fmr, GFP_KERNEL);
  245. if (!fmr)
  246. goto out_fail;
  247. fmr->pool = pool;
  248. fmr->remap_count = 0;
  249. fmr->ref_count = 0;
  250. INIT_HLIST_NODE(&fmr->cache_node);
  251. fmr->fmr = ib_alloc_fmr(pd, params->access, &fmr_attr);
  252. if (IS_ERR(fmr->fmr)) {
  253. pr_warn(PFX "fmr_create failed for FMR %d\n",
  254. i);
  255. kfree(fmr);
  256. goto out_fail;
  257. }
  258. list_add_tail(&fmr->list, &pool->free_list);
  259. ++pool->pool_size;
  260. }
  261. }
  262. return pool;
  263. out_free_pool:
  264. kfree(pool->cache_bucket);
  265. kfree(pool);
  266. return ERR_PTR(ret);
  267. out_fail:
  268. ib_destroy_fmr_pool(pool);
  269. return ERR_PTR(-ENOMEM);
  270. }
  271. EXPORT_SYMBOL(ib_create_fmr_pool);
  272. /**
  273. * ib_destroy_fmr_pool - Free FMR pool
  274. * @pool:FMR pool to free
  275. *
  276. * Destroy an FMR pool and free all associated resources.
  277. */
  278. void ib_destroy_fmr_pool(struct ib_fmr_pool *pool)
  279. {
  280. struct ib_pool_fmr *fmr;
  281. struct ib_pool_fmr *tmp;
  282. LIST_HEAD(fmr_list);
  283. int i;
  284. kthread_stop(pool->thread);
  285. ib_fmr_batch_release(pool);
  286. i = 0;
  287. list_for_each_entry_safe(fmr, tmp, &pool->free_list, list) {
  288. if (fmr->remap_count) {
  289. INIT_LIST_HEAD(&fmr_list);
  290. list_add_tail(&fmr->fmr->list, &fmr_list);
  291. ib_unmap_fmr(&fmr_list);
  292. }
  293. ib_dealloc_fmr(fmr->fmr);
  294. list_del(&fmr->list);
  295. kfree(fmr);
  296. ++i;
  297. }
  298. if (i < pool->pool_size)
  299. pr_warn(PFX "pool still has %d regions registered\n",
  300. pool->pool_size - i);
  301. kfree(pool->cache_bucket);
  302. kfree(pool);
  303. }
  304. EXPORT_SYMBOL(ib_destroy_fmr_pool);
  305. /**
  306. * ib_flush_fmr_pool - Invalidate all unmapped FMRs
  307. * @pool:FMR pool to flush
  308. *
  309. * Ensure that all unmapped FMRs are fully invalidated.
  310. */
  311. int ib_flush_fmr_pool(struct ib_fmr_pool *pool)
  312. {
  313. int serial;
  314. struct ib_pool_fmr *fmr, *next;
  315. /*
  316. * The free_list holds FMRs that may have been used
  317. * but have not been remapped enough times to be dirty.
  318. * Put them on the dirty list now so that the cleanup
  319. * thread will reap them too.
  320. */
  321. spin_lock_irq(&pool->pool_lock);
  322. list_for_each_entry_safe(fmr, next, &pool->free_list, list) {
  323. if (fmr->remap_count > 0)
  324. list_move(&fmr->list, &pool->dirty_list);
  325. }
  326. spin_unlock_irq(&pool->pool_lock);
  327. serial = atomic_inc_return(&pool->req_ser);
  328. wake_up_process(pool->thread);
  329. if (wait_event_interruptible(pool->force_wait,
  330. atomic_read(&pool->flush_ser) - serial >= 0))
  331. return -EINTR;
  332. return 0;
  333. }
  334. EXPORT_SYMBOL(ib_flush_fmr_pool);
  335. /**
  336. * ib_fmr_pool_map_phys -
  337. * @pool:FMR pool to allocate FMR from
  338. * @page_list:List of pages to map
  339. * @list_len:Number of pages in @page_list
  340. * @io_virtual_address:I/O virtual address for new FMR
  341. *
  342. * Map an FMR from an FMR pool.
  343. */
  344. struct ib_pool_fmr *ib_fmr_pool_map_phys(struct ib_fmr_pool *pool_handle,
  345. u64 *page_list,
  346. int list_len,
  347. u64 io_virtual_address)
  348. {
  349. struct ib_fmr_pool *pool = pool_handle;
  350. struct ib_pool_fmr *fmr;
  351. unsigned long flags;
  352. int result;
  353. if (list_len < 1 || list_len > pool->max_pages)
  354. return ERR_PTR(-EINVAL);
  355. spin_lock_irqsave(&pool->pool_lock, flags);
  356. fmr = ib_fmr_cache_lookup(pool,
  357. page_list,
  358. list_len,
  359. io_virtual_address);
  360. if (fmr) {
  361. /* found in cache */
  362. ++fmr->ref_count;
  363. if (fmr->ref_count == 1) {
  364. list_del(&fmr->list);
  365. }
  366. spin_unlock_irqrestore(&pool->pool_lock, flags);
  367. return fmr;
  368. }
  369. if (list_empty(&pool->free_list)) {
  370. spin_unlock_irqrestore(&pool->pool_lock, flags);
  371. return ERR_PTR(-EAGAIN);
  372. }
  373. fmr = list_entry(pool->free_list.next, struct ib_pool_fmr, list);
  374. list_del(&fmr->list);
  375. hlist_del_init(&fmr->cache_node);
  376. spin_unlock_irqrestore(&pool->pool_lock, flags);
  377. result = ib_map_phys_fmr(fmr->fmr, page_list, list_len,
  378. io_virtual_address);
  379. if (result) {
  380. spin_lock_irqsave(&pool->pool_lock, flags);
  381. list_add(&fmr->list, &pool->free_list);
  382. spin_unlock_irqrestore(&pool->pool_lock, flags);
  383. pr_warn(PFX "fmr_map returns %d\n", result);
  384. return ERR_PTR(result);
  385. }
  386. ++fmr->remap_count;
  387. fmr->ref_count = 1;
  388. if (pool->cache_bucket) {
  389. fmr->io_virtual_address = io_virtual_address;
  390. fmr->page_list_len = list_len;
  391. memcpy(fmr->page_list, page_list, list_len * sizeof(*page_list));
  392. spin_lock_irqsave(&pool->pool_lock, flags);
  393. hlist_add_head(&fmr->cache_node,
  394. pool->cache_bucket + ib_fmr_hash(fmr->page_list[0]));
  395. spin_unlock_irqrestore(&pool->pool_lock, flags);
  396. }
  397. return fmr;
  398. }
  399. EXPORT_SYMBOL(ib_fmr_pool_map_phys);
  400. /**
  401. * ib_fmr_pool_unmap - Unmap FMR
  402. * @fmr:FMR to unmap
  403. *
  404. * Unmap an FMR. The FMR mapping may remain valid until the FMR is
  405. * reused (or until ib_flush_fmr_pool() is called).
  406. */
  407. int ib_fmr_pool_unmap(struct ib_pool_fmr *fmr)
  408. {
  409. struct ib_fmr_pool *pool;
  410. unsigned long flags;
  411. pool = fmr->pool;
  412. spin_lock_irqsave(&pool->pool_lock, flags);
  413. --fmr->ref_count;
  414. if (!fmr->ref_count) {
  415. if (fmr->remap_count < pool->max_remaps) {
  416. list_add_tail(&fmr->list, &pool->free_list);
  417. } else {
  418. list_add_tail(&fmr->list, &pool->dirty_list);
  419. if (++pool->dirty_len >= pool->dirty_watermark) {
  420. atomic_inc(&pool->req_ser);
  421. wake_up_process(pool->thread);
  422. }
  423. }
  424. }
  425. #ifdef DEBUG
  426. if (fmr->ref_count < 0)
  427. pr_warn(PFX "FMR %p has ref count %d < 0\n",
  428. fmr, fmr->ref_count);
  429. #endif
  430. spin_unlock_irqrestore(&pool->pool_lock, flags);
  431. return 0;
  432. }
  433. EXPORT_SYMBOL(ib_fmr_pool_unmap);