fmr_pool.c 14 KB

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