Merge tag 'for_linus' of git://git.kernel.org/pub/scm/linux/kernel/git/mst/vhost
[cris-mirror.git] / drivers / infiniband / core / fmr_pool.c
bloba0a9ed719031b93bd8d04c4c02368cbd9d7dc44a
1 /*
2 * Copyright (c) 2004 Topspin Communications. All rights reserved.
3 * Copyright (c) 2005 Sun Microsystems, Inc. All rights reserved.
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:
11 * Redistribution and use in source and binary forms, with or
12 * without modification, are permitted provided that the following
13 * conditions are met:
15 * - Redistributions of source code must retain the above
16 * copyright notice, this list of conditions and the following
17 * disclaimer.
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.
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.
34 #include <linux/errno.h>
35 #include <linux/spinlock.h>
36 #include <linux/export.h>
37 #include <linux/slab.h>
38 #include <linux/jhash.h>
39 #include <linux/kthread.h>
41 #include <rdma/ib_fmr_pool.h>
43 #include "core_priv.h"
45 #define PFX "fmr_pool: "
47 enum {
48 IB_FMR_MAX_REMAPS = 32,
50 IB_FMR_HASH_BITS = 8,
51 IB_FMR_HASH_SIZE = 1 << IB_FMR_HASH_BITS,
52 IB_FMR_HASH_MASK = IB_FMR_HASH_SIZE - 1
56 * If an FMR is not in use, then the list member will point to either
57 * its pool's free_list (if the FMR can be mapped again; that is,
58 * remap_count < pool->max_remaps) or its pool's dirty_list (if the
59 * FMR needs to be unmapped before being remapped). In either of
60 * these cases it is a bug if the ref_count is not 0. In other words,
61 * if ref_count is > 0, then the list member must not be linked into
62 * either free_list or dirty_list.
64 * The cache_node member is used to link the FMR into a cache bucket
65 * (if caching is enabled). This is independent of the reference
66 * count of the FMR. When a valid FMR is released, its ref_count is
67 * decremented, and if ref_count reaches 0, the FMR is placed in
68 * either free_list or dirty_list as appropriate. However, it is not
69 * removed from the cache and may be "revived" if a call to
70 * ib_fmr_register_physical() occurs before the FMR is remapped. In
71 * this case we just increment the ref_count and remove the FMR from
72 * free_list/dirty_list.
74 * Before we remap an FMR from free_list, we remove it from the cache
75 * (to prevent another user from obtaining a stale FMR). When an FMR
76 * is released, we add it to the tail of the free list, so that our
77 * cache eviction policy is "least recently used."
79 * All manipulation of ref_count, list and cache_node is protected by
80 * pool_lock to maintain consistency.
83 struct ib_fmr_pool {
84 spinlock_t pool_lock;
86 int pool_size;
87 int max_pages;
88 int max_remaps;
89 int dirty_watermark;
90 int dirty_len;
91 struct list_head free_list;
92 struct list_head dirty_list;
93 struct hlist_head *cache_bucket;
95 void (*flush_function)(struct ib_fmr_pool *pool,
96 void * arg);
97 void *flush_arg;
99 struct kthread_worker *worker;
100 struct kthread_work work;
102 atomic_t req_ser;
103 atomic_t flush_ser;
105 wait_queue_head_t force_wait;
108 static inline u32 ib_fmr_hash(u64 first_page)
110 return jhash_2words((u32) first_page, (u32) (first_page >> 32), 0) &
111 (IB_FMR_HASH_SIZE - 1);
114 /* Caller must hold pool_lock */
115 static inline struct ib_pool_fmr *ib_fmr_cache_lookup(struct ib_fmr_pool *pool,
116 u64 *page_list,
117 int page_list_len,
118 u64 io_virtual_address)
120 struct hlist_head *bucket;
121 struct ib_pool_fmr *fmr;
123 if (!pool->cache_bucket)
124 return NULL;
126 bucket = pool->cache_bucket + ib_fmr_hash(*page_list);
128 hlist_for_each_entry(fmr, bucket, cache_node)
129 if (io_virtual_address == fmr->io_virtual_address &&
130 page_list_len == fmr->page_list_len &&
131 !memcmp(page_list, fmr->page_list,
132 page_list_len * sizeof *page_list))
133 return fmr;
135 return NULL;
138 static void ib_fmr_batch_release(struct ib_fmr_pool *pool)
140 int ret;
141 struct ib_pool_fmr *fmr;
142 LIST_HEAD(unmap_list);
143 LIST_HEAD(fmr_list);
145 spin_lock_irq(&pool->pool_lock);
147 list_for_each_entry(fmr, &pool->dirty_list, list) {
148 hlist_del_init(&fmr->cache_node);
149 fmr->remap_count = 0;
150 list_add_tail(&fmr->fmr->list, &fmr_list);
152 #ifdef DEBUG
153 if (fmr->ref_count !=0) {
154 pr_warn(PFX "Unmapping FMR 0x%08x with ref count %d\n",
155 fmr, fmr->ref_count);
157 #endif
160 list_splice_init(&pool->dirty_list, &unmap_list);
161 pool->dirty_len = 0;
163 spin_unlock_irq(&pool->pool_lock);
165 if (list_empty(&unmap_list)) {
166 return;
169 ret = ib_unmap_fmr(&fmr_list);
170 if (ret)
171 pr_warn(PFX "ib_unmap_fmr returned %d\n", ret);
173 spin_lock_irq(&pool->pool_lock);
174 list_splice(&unmap_list, &pool->free_list);
175 spin_unlock_irq(&pool->pool_lock);
178 static void ib_fmr_cleanup_func(struct kthread_work *work)
180 struct ib_fmr_pool *pool = container_of(work, struct ib_fmr_pool, work);
182 ib_fmr_batch_release(pool);
183 atomic_inc(&pool->flush_ser);
184 wake_up_interruptible(&pool->force_wait);
186 if (pool->flush_function)
187 pool->flush_function(pool, pool->flush_arg);
189 if (atomic_read(&pool->flush_ser) - atomic_read(&pool->req_ser) < 0)
190 kthread_queue_work(pool->worker, &pool->work);
194 * ib_create_fmr_pool - Create an FMR pool
195 * @pd:Protection domain for FMRs
196 * @params:FMR pool parameters
198 * Create a pool of FMRs. Return value is pointer to new pool or
199 * error code if creation failed.
201 struct ib_fmr_pool *ib_create_fmr_pool(struct ib_pd *pd,
202 struct ib_fmr_pool_param *params)
204 struct ib_device *device;
205 struct ib_fmr_pool *pool;
206 int i;
207 int ret;
208 int max_remaps;
210 if (!params)
211 return ERR_PTR(-EINVAL);
213 device = pd->device;
214 if (!device->alloc_fmr || !device->dealloc_fmr ||
215 !device->map_phys_fmr || !device->unmap_fmr) {
216 pr_info(PFX "Device %s does not support FMRs\n", device->name);
217 return ERR_PTR(-ENOSYS);
220 if (!device->attrs.max_map_per_fmr)
221 max_remaps = IB_FMR_MAX_REMAPS;
222 else
223 max_remaps = device->attrs.max_map_per_fmr;
225 pool = kmalloc(sizeof *pool, GFP_KERNEL);
226 if (!pool)
227 return ERR_PTR(-ENOMEM);
229 pool->cache_bucket = NULL;
230 pool->flush_function = params->flush_function;
231 pool->flush_arg = params->flush_arg;
233 INIT_LIST_HEAD(&pool->free_list);
234 INIT_LIST_HEAD(&pool->dirty_list);
236 if (params->cache) {
237 pool->cache_bucket =
238 kmalloc(IB_FMR_HASH_SIZE * sizeof *pool->cache_bucket,
239 GFP_KERNEL);
240 if (!pool->cache_bucket) {
241 ret = -ENOMEM;
242 goto out_free_pool;
245 for (i = 0; i < IB_FMR_HASH_SIZE; ++i)
246 INIT_HLIST_HEAD(pool->cache_bucket + i);
249 pool->pool_size = 0;
250 pool->max_pages = params->max_pages_per_fmr;
251 pool->max_remaps = max_remaps;
252 pool->dirty_watermark = params->dirty_watermark;
253 pool->dirty_len = 0;
254 spin_lock_init(&pool->pool_lock);
255 atomic_set(&pool->req_ser, 0);
256 atomic_set(&pool->flush_ser, 0);
257 init_waitqueue_head(&pool->force_wait);
259 pool->worker = kthread_create_worker(0, "ib_fmr(%s)", device->name);
260 if (IS_ERR(pool->worker)) {
261 pr_warn(PFX "couldn't start cleanup kthread worker\n");
262 ret = PTR_ERR(pool->worker);
263 goto out_free_pool;
265 kthread_init_work(&pool->work, ib_fmr_cleanup_func);
268 struct ib_pool_fmr *fmr;
269 struct ib_fmr_attr fmr_attr = {
270 .max_pages = params->max_pages_per_fmr,
271 .max_maps = pool->max_remaps,
272 .page_shift = params->page_shift
274 int bytes_per_fmr = sizeof *fmr;
276 if (pool->cache_bucket)
277 bytes_per_fmr += params->max_pages_per_fmr * sizeof (u64);
279 for (i = 0; i < params->pool_size; ++i) {
280 fmr = kmalloc(bytes_per_fmr, GFP_KERNEL);
281 if (!fmr)
282 goto out_fail;
284 fmr->pool = pool;
285 fmr->remap_count = 0;
286 fmr->ref_count = 0;
287 INIT_HLIST_NODE(&fmr->cache_node);
289 fmr->fmr = ib_alloc_fmr(pd, params->access, &fmr_attr);
290 if (IS_ERR(fmr->fmr)) {
291 pr_warn(PFX "fmr_create failed for FMR %d\n",
293 kfree(fmr);
294 goto out_fail;
297 list_add_tail(&fmr->list, &pool->free_list);
298 ++pool->pool_size;
302 return pool;
304 out_free_pool:
305 kfree(pool->cache_bucket);
306 kfree(pool);
308 return ERR_PTR(ret);
310 out_fail:
311 ib_destroy_fmr_pool(pool);
313 return ERR_PTR(-ENOMEM);
315 EXPORT_SYMBOL(ib_create_fmr_pool);
318 * ib_destroy_fmr_pool - Free FMR pool
319 * @pool:FMR pool to free
321 * Destroy an FMR pool and free all associated resources.
323 void ib_destroy_fmr_pool(struct ib_fmr_pool *pool)
325 struct ib_pool_fmr *fmr;
326 struct ib_pool_fmr *tmp;
327 LIST_HEAD(fmr_list);
328 int i;
330 kthread_destroy_worker(pool->worker);
331 ib_fmr_batch_release(pool);
333 i = 0;
334 list_for_each_entry_safe(fmr, tmp, &pool->free_list, list) {
335 if (fmr->remap_count) {
336 INIT_LIST_HEAD(&fmr_list);
337 list_add_tail(&fmr->fmr->list, &fmr_list);
338 ib_unmap_fmr(&fmr_list);
340 ib_dealloc_fmr(fmr->fmr);
341 list_del(&fmr->list);
342 kfree(fmr);
343 ++i;
346 if (i < pool->pool_size)
347 pr_warn(PFX "pool still has %d regions registered\n",
348 pool->pool_size - i);
350 kfree(pool->cache_bucket);
351 kfree(pool);
353 EXPORT_SYMBOL(ib_destroy_fmr_pool);
356 * ib_flush_fmr_pool - Invalidate all unmapped FMRs
357 * @pool:FMR pool to flush
359 * Ensure that all unmapped FMRs are fully invalidated.
361 int ib_flush_fmr_pool(struct ib_fmr_pool *pool)
363 int serial;
364 struct ib_pool_fmr *fmr, *next;
367 * The free_list holds FMRs that may have been used
368 * but have not been remapped enough times to be dirty.
369 * Put them on the dirty list now so that the cleanup
370 * thread will reap them too.
372 spin_lock_irq(&pool->pool_lock);
373 list_for_each_entry_safe(fmr, next, &pool->free_list, list) {
374 if (fmr->remap_count > 0)
375 list_move(&fmr->list, &pool->dirty_list);
377 spin_unlock_irq(&pool->pool_lock);
379 serial = atomic_inc_return(&pool->req_ser);
380 kthread_queue_work(pool->worker, &pool->work);
382 if (wait_event_interruptible(pool->force_wait,
383 atomic_read(&pool->flush_ser) - serial >= 0))
384 return -EINTR;
386 return 0;
388 EXPORT_SYMBOL(ib_flush_fmr_pool);
391 * ib_fmr_pool_map_phys - Map an FMR from an FMR pool.
392 * @pool_handle: FMR pool to allocate FMR from
393 * @page_list: List of pages to map
394 * @list_len: Number of pages in @page_list
395 * @io_virtual_address: I/O virtual address for new FMR
397 struct ib_pool_fmr *ib_fmr_pool_map_phys(struct ib_fmr_pool *pool_handle,
398 u64 *page_list,
399 int list_len,
400 u64 io_virtual_address)
402 struct ib_fmr_pool *pool = pool_handle;
403 struct ib_pool_fmr *fmr;
404 unsigned long flags;
405 int result;
407 if (list_len < 1 || list_len > pool->max_pages)
408 return ERR_PTR(-EINVAL);
410 spin_lock_irqsave(&pool->pool_lock, flags);
411 fmr = ib_fmr_cache_lookup(pool,
412 page_list,
413 list_len,
414 io_virtual_address);
415 if (fmr) {
416 /* found in cache */
417 ++fmr->ref_count;
418 if (fmr->ref_count == 1) {
419 list_del(&fmr->list);
422 spin_unlock_irqrestore(&pool->pool_lock, flags);
424 return fmr;
427 if (list_empty(&pool->free_list)) {
428 spin_unlock_irqrestore(&pool->pool_lock, flags);
429 return ERR_PTR(-EAGAIN);
432 fmr = list_entry(pool->free_list.next, struct ib_pool_fmr, list);
433 list_del(&fmr->list);
434 hlist_del_init(&fmr->cache_node);
435 spin_unlock_irqrestore(&pool->pool_lock, flags);
437 result = ib_map_phys_fmr(fmr->fmr, page_list, list_len,
438 io_virtual_address);
440 if (result) {
441 spin_lock_irqsave(&pool->pool_lock, flags);
442 list_add(&fmr->list, &pool->free_list);
443 spin_unlock_irqrestore(&pool->pool_lock, flags);
445 pr_warn(PFX "fmr_map returns %d\n", result);
447 return ERR_PTR(result);
450 ++fmr->remap_count;
451 fmr->ref_count = 1;
453 if (pool->cache_bucket) {
454 fmr->io_virtual_address = io_virtual_address;
455 fmr->page_list_len = list_len;
456 memcpy(fmr->page_list, page_list, list_len * sizeof(*page_list));
458 spin_lock_irqsave(&pool->pool_lock, flags);
459 hlist_add_head(&fmr->cache_node,
460 pool->cache_bucket + ib_fmr_hash(fmr->page_list[0]));
461 spin_unlock_irqrestore(&pool->pool_lock, flags);
464 return fmr;
466 EXPORT_SYMBOL(ib_fmr_pool_map_phys);
469 * ib_fmr_pool_unmap - Unmap FMR
470 * @fmr:FMR to unmap
472 * Unmap an FMR. The FMR mapping may remain valid until the FMR is
473 * reused (or until ib_flush_fmr_pool() is called).
475 int ib_fmr_pool_unmap(struct ib_pool_fmr *fmr)
477 struct ib_fmr_pool *pool;
478 unsigned long flags;
480 pool = fmr->pool;
482 spin_lock_irqsave(&pool->pool_lock, flags);
484 --fmr->ref_count;
485 if (!fmr->ref_count) {
486 if (fmr->remap_count < pool->max_remaps) {
487 list_add_tail(&fmr->list, &pool->free_list);
488 } else {
489 list_add_tail(&fmr->list, &pool->dirty_list);
490 if (++pool->dirty_len >= pool->dirty_watermark) {
491 atomic_inc(&pool->req_ser);
492 kthread_queue_work(pool->worker, &pool->work);
497 #ifdef DEBUG
498 if (fmr->ref_count < 0)
499 pr_warn(PFX "FMR %p has ref count %d < 0\n",
500 fmr, fmr->ref_count);
501 #endif
503 spin_unlock_irqrestore(&pool->pool_lock, flags);
505 return 0;
507 EXPORT_SYMBOL(ib_fmr_pool_unmap);