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. #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. struct hlist_node *pos;
  107. if (!pool->cache_bucket)
  108. return NULL;
  109. bucket = pool->cache_bucket + ib_fmr_hash(*page_list);
  110. hlist_for_each_entry(fmr, pos, bucket, cache_node)
  111. if (io_virtual_address == fmr->io_virtual_address &&
  112. page_list_len == fmr->page_list_len &&
  113. !memcmp(page_list, fmr->page_list,
  114. page_list_len * sizeof *page_list))
  115. return fmr;
  116. return NULL;
  117. }
  118. static void ib_fmr_batch_release(struct ib_fmr_pool *pool)
  119. {
  120. int ret;
  121. struct ib_pool_fmr *fmr;
  122. LIST_HEAD(unmap_list);
  123. LIST_HEAD(fmr_list);
  124. spin_lock_irq(&pool->pool_lock);
  125. list_for_each_entry(fmr, &pool->dirty_list, list) {
  126. hlist_del_init(&fmr->cache_node);
  127. fmr->remap_count = 0;
  128. list_add_tail(&fmr->fmr->list, &fmr_list);
  129. #ifdef DEBUG
  130. if (fmr->ref_count !=0) {
  131. printk(KERN_WARNING PFX "Unmapping FMR 0x%08x with ref count %d\n",
  132. fmr, fmr->ref_count);
  133. }
  134. #endif
  135. }
  136. list_splice_init(&pool->dirty_list, &unmap_list);
  137. pool->dirty_len = 0;
  138. spin_unlock_irq(&pool->pool_lock);
  139. if (list_empty(&unmap_list)) {
  140. return;
  141. }
  142. ret = ib_unmap_fmr(&fmr_list);
  143. if (ret)
  144. printk(KERN_WARNING PFX "ib_unmap_fmr returned %d\n", ret);
  145. spin_lock_irq(&pool->pool_lock);
  146. list_splice(&unmap_list, &pool->free_list);
  147. spin_unlock_irq(&pool->pool_lock);
  148. }
  149. static int ib_fmr_cleanup_thread(void *pool_ptr)
  150. {
  151. struct ib_fmr_pool *pool = pool_ptr;
  152. do {
  153. if (atomic_read(&pool->flush_ser) - atomic_read(&pool->req_ser) < 0) {
  154. ib_fmr_batch_release(pool);
  155. atomic_inc(&pool->flush_ser);
  156. wake_up_interruptible(&pool->force_wait);
  157. if (pool->flush_function)
  158. pool->flush_function(pool, pool->flush_arg);
  159. }
  160. set_current_state(TASK_INTERRUPTIBLE);
  161. if (atomic_read(&pool->flush_ser) - atomic_read(&pool->req_ser) >= 0 &&
  162. !kthread_should_stop())
  163. schedule();
  164. __set_current_state(TASK_RUNNING);
  165. } while (!kthread_should_stop());
  166. return 0;
  167. }
  168. /**
  169. * ib_create_fmr_pool - Create an FMR pool
  170. * @pd:Protection domain for FMRs
  171. * @params:FMR pool parameters
  172. *
  173. * Create a pool of FMRs. Return value is pointer to new pool or
  174. * error code if creation failed.
  175. */
  176. struct ib_fmr_pool *ib_create_fmr_pool(struct ib_pd *pd,
  177. struct ib_fmr_pool_param *params)
  178. {
  179. struct ib_device *device;
  180. struct ib_fmr_pool *pool;
  181. struct ib_device_attr *attr;
  182. int i;
  183. int ret;
  184. int max_remaps;
  185. if (!params)
  186. return ERR_PTR(-EINVAL);
  187. device = pd->device;
  188. if (!device->alloc_fmr || !device->dealloc_fmr ||
  189. !device->map_phys_fmr || !device->unmap_fmr) {
  190. printk(KERN_INFO PFX "Device %s does not support FMRs\n",
  191. device->name);
  192. return ERR_PTR(-ENOSYS);
  193. }
  194. attr = kmalloc(sizeof *attr, GFP_KERNEL);
  195. if (!attr) {
  196. printk(KERN_WARNING PFX "couldn't allocate device attr struct\n");
  197. return ERR_PTR(-ENOMEM);
  198. }
  199. ret = ib_query_device(device, attr);
  200. if (ret) {
  201. printk(KERN_WARNING PFX "couldn't query device: %d\n", ret);
  202. kfree(attr);
  203. return ERR_PTR(ret);
  204. }
  205. if (!attr->max_map_per_fmr)
  206. max_remaps = IB_FMR_MAX_REMAPS;
  207. else
  208. max_remaps = attr->max_map_per_fmr;
  209. kfree(attr);
  210. pool = kmalloc(sizeof *pool, GFP_KERNEL);
  211. if (!pool) {
  212. printk(KERN_WARNING PFX "couldn't allocate pool struct\n");
  213. return ERR_PTR(-ENOMEM);
  214. }
  215. pool->cache_bucket = NULL;
  216. pool->flush_function = params->flush_function;
  217. pool->flush_arg = params->flush_arg;
  218. INIT_LIST_HEAD(&pool->free_list);
  219. INIT_LIST_HEAD(&pool->dirty_list);
  220. if (params->cache) {
  221. pool->cache_bucket =
  222. kmalloc(IB_FMR_HASH_SIZE * sizeof *pool->cache_bucket,
  223. GFP_KERNEL);
  224. if (!pool->cache_bucket) {
  225. printk(KERN_WARNING PFX "Failed to allocate cache in pool\n");
  226. ret = -ENOMEM;
  227. goto out_free_pool;
  228. }
  229. for (i = 0; i < IB_FMR_HASH_SIZE; ++i)
  230. INIT_HLIST_HEAD(pool->cache_bucket + i);
  231. }
  232. pool->pool_size = 0;
  233. pool->max_pages = params->max_pages_per_fmr;
  234. pool->max_remaps = max_remaps;
  235. pool->dirty_watermark = params->dirty_watermark;
  236. pool->dirty_len = 0;
  237. spin_lock_init(&pool->pool_lock);
  238. atomic_set(&pool->req_ser, 0);
  239. atomic_set(&pool->flush_ser, 0);
  240. init_waitqueue_head(&pool->force_wait);
  241. pool->thread = kthread_run(ib_fmr_cleanup_thread,
  242. pool,
  243. "ib_fmr(%s)",
  244. device->name);
  245. if (IS_ERR(pool->thread)) {
  246. printk(KERN_WARNING PFX "couldn't start cleanup thread\n");
  247. ret = PTR_ERR(pool->thread);
  248. goto out_free_pool;
  249. }
  250. {
  251. struct ib_pool_fmr *fmr;
  252. struct ib_fmr_attr fmr_attr = {
  253. .max_pages = params->max_pages_per_fmr,
  254. .max_maps = pool->max_remaps,
  255. .page_shift = params->page_shift
  256. };
  257. int bytes_per_fmr = sizeof *fmr;
  258. if (pool->cache_bucket)
  259. bytes_per_fmr += params->max_pages_per_fmr * sizeof (u64);
  260. for (i = 0; i < params->pool_size; ++i) {
  261. fmr = kmalloc(bytes_per_fmr, GFP_KERNEL);
  262. if (!fmr) {
  263. printk(KERN_WARNING PFX "failed to allocate fmr "
  264. "struct for FMR %d\n", i);
  265. goto out_fail;
  266. }
  267. fmr->pool = pool;
  268. fmr->remap_count = 0;
  269. fmr->ref_count = 0;
  270. INIT_HLIST_NODE(&fmr->cache_node);
  271. fmr->fmr = ib_alloc_fmr(pd, params->access, &fmr_attr);
  272. if (IS_ERR(fmr->fmr)) {
  273. printk(KERN_WARNING PFX "fmr_create failed "
  274. "for FMR %d\n", i);
  275. kfree(fmr);
  276. goto out_fail;
  277. }
  278. list_add_tail(&fmr->list, &pool->free_list);
  279. ++pool->pool_size;
  280. }
  281. }
  282. return pool;
  283. out_free_pool:
  284. kfree(pool->cache_bucket);
  285. kfree(pool);
  286. return ERR_PTR(ret);
  287. out_fail:
  288. ib_destroy_fmr_pool(pool);
  289. return ERR_PTR(-ENOMEM);
  290. }
  291. EXPORT_SYMBOL(ib_create_fmr_pool);
  292. /**
  293. * ib_destroy_fmr_pool - Free FMR pool
  294. * @pool:FMR pool to free
  295. *
  296. * Destroy an FMR pool and free all associated resources.
  297. */
  298. void ib_destroy_fmr_pool(struct ib_fmr_pool *pool)
  299. {
  300. struct ib_pool_fmr *fmr;
  301. struct ib_pool_fmr *tmp;
  302. LIST_HEAD(fmr_list);
  303. int i;
  304. kthread_stop(pool->thread);
  305. ib_fmr_batch_release(pool);
  306. i = 0;
  307. list_for_each_entry_safe(fmr, tmp, &pool->free_list, list) {
  308. if (fmr->remap_count) {
  309. INIT_LIST_HEAD(&fmr_list);
  310. list_add_tail(&fmr->fmr->list, &fmr_list);
  311. ib_unmap_fmr(&fmr_list);
  312. }
  313. ib_dealloc_fmr(fmr->fmr);
  314. list_del(&fmr->list);
  315. kfree(fmr);
  316. ++i;
  317. }
  318. if (i < pool->pool_size)
  319. printk(KERN_WARNING PFX "pool still has %d regions registered\n",
  320. pool->pool_size - i);
  321. kfree(pool->cache_bucket);
  322. kfree(pool);
  323. }
  324. EXPORT_SYMBOL(ib_destroy_fmr_pool);
  325. /**
  326. * ib_flush_fmr_pool - Invalidate all unmapped FMRs
  327. * @pool:FMR pool to flush
  328. *
  329. * Ensure that all unmapped FMRs are fully invalidated.
  330. */
  331. int ib_flush_fmr_pool(struct ib_fmr_pool *pool)
  332. {
  333. int serial;
  334. struct ib_pool_fmr *fmr, *next;
  335. /*
  336. * The free_list holds FMRs that may have been used
  337. * but have not been remapped enough times to be dirty.
  338. * Put them on the dirty list now so that the cleanup
  339. * thread will reap them too.
  340. */
  341. spin_lock_irq(&pool->pool_lock);
  342. list_for_each_entry_safe(fmr, next, &pool->free_list, list) {
  343. if (fmr->remap_count > 0)
  344. list_move(&fmr->list, &pool->dirty_list);
  345. }
  346. spin_unlock_irq(&pool->pool_lock);
  347. serial = atomic_inc_return(&pool->req_ser);
  348. wake_up_process(pool->thread);
  349. if (wait_event_interruptible(pool->force_wait,
  350. atomic_read(&pool->flush_ser) - serial >= 0))
  351. return -EINTR;
  352. return 0;
  353. }
  354. EXPORT_SYMBOL(ib_flush_fmr_pool);
  355. /**
  356. * ib_fmr_pool_map_phys -
  357. * @pool:FMR pool to allocate FMR from
  358. * @page_list:List of pages to map
  359. * @list_len:Number of pages in @page_list
  360. * @io_virtual_address:I/O virtual address for new FMR
  361. *
  362. * Map an FMR from an FMR pool.
  363. */
  364. struct ib_pool_fmr *ib_fmr_pool_map_phys(struct ib_fmr_pool *pool_handle,
  365. u64 *page_list,
  366. int list_len,
  367. u64 io_virtual_address)
  368. {
  369. struct ib_fmr_pool *pool = pool_handle;
  370. struct ib_pool_fmr *fmr;
  371. unsigned long flags;
  372. int result;
  373. if (list_len < 1 || list_len > pool->max_pages)
  374. return ERR_PTR(-EINVAL);
  375. spin_lock_irqsave(&pool->pool_lock, flags);
  376. fmr = ib_fmr_cache_lookup(pool,
  377. page_list,
  378. list_len,
  379. io_virtual_address);
  380. if (fmr) {
  381. /* found in cache */
  382. ++fmr->ref_count;
  383. if (fmr->ref_count == 1) {
  384. list_del(&fmr->list);
  385. }
  386. spin_unlock_irqrestore(&pool->pool_lock, flags);
  387. return fmr;
  388. }
  389. if (list_empty(&pool->free_list)) {
  390. spin_unlock_irqrestore(&pool->pool_lock, flags);
  391. return ERR_PTR(-EAGAIN);
  392. }
  393. fmr = list_entry(pool->free_list.next, struct ib_pool_fmr, list);
  394. list_del(&fmr->list);
  395. hlist_del_init(&fmr->cache_node);
  396. spin_unlock_irqrestore(&pool->pool_lock, flags);
  397. result = ib_map_phys_fmr(fmr->fmr, page_list, list_len,
  398. io_virtual_address);
  399. if (result) {
  400. spin_lock_irqsave(&pool->pool_lock, flags);
  401. list_add(&fmr->list, &pool->free_list);
  402. spin_unlock_irqrestore(&pool->pool_lock, flags);
  403. printk(KERN_WARNING PFX "fmr_map returns %d\n", result);
  404. return ERR_PTR(result);
  405. }
  406. ++fmr->remap_count;
  407. fmr->ref_count = 1;
  408. if (pool->cache_bucket) {
  409. fmr->io_virtual_address = io_virtual_address;
  410. fmr->page_list_len = list_len;
  411. memcpy(fmr->page_list, page_list, list_len * sizeof(*page_list));
  412. spin_lock_irqsave(&pool->pool_lock, flags);
  413. hlist_add_head(&fmr->cache_node,
  414. pool->cache_bucket + ib_fmr_hash(fmr->page_list[0]));
  415. spin_unlock_irqrestore(&pool->pool_lock, flags);
  416. }
  417. return fmr;
  418. }
  419. EXPORT_SYMBOL(ib_fmr_pool_map_phys);
  420. /**
  421. * ib_fmr_pool_unmap - Unmap FMR
  422. * @fmr:FMR to unmap
  423. *
  424. * Unmap an FMR. The FMR mapping may remain valid until the FMR is
  425. * reused (or until ib_flush_fmr_pool() is called).
  426. */
  427. int ib_fmr_pool_unmap(struct ib_pool_fmr *fmr)
  428. {
  429. struct ib_fmr_pool *pool;
  430. unsigned long flags;
  431. pool = fmr->pool;
  432. spin_lock_irqsave(&pool->pool_lock, flags);
  433. --fmr->ref_count;
  434. if (!fmr->ref_count) {
  435. if (fmr->remap_count < pool->max_remaps) {
  436. list_add_tail(&fmr->list, &pool->free_list);
  437. } else {
  438. list_add_tail(&fmr->list, &pool->dirty_list);
  439. if (++pool->dirty_len >= pool->dirty_watermark) {
  440. atomic_inc(&pool->req_ser);
  441. wake_up_process(pool->thread);
  442. }
  443. }
  444. }
  445. #ifdef DEBUG
  446. if (fmr->ref_count < 0)
  447. printk(KERN_WARNING PFX "FMR %p has ref count %d < 0\n",
  448. fmr, fmr->ref_count);
  449. #endif
  450. spin_unlock_irqrestore(&pool->pool_lock, flags);
  451. return 0;
  452. }
  453. EXPORT_SYMBOL(ib_fmr_pool_unmap);