2 * Copyright (c) 2016 Mellanox Technologies Ltd. All rights reserved.
3 * Copyright (c) 2015 System Fabric Works, 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
15 * - Redistributions of source code must retain the above
16 * copyright notice, this list of conditions and the following
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
37 /* info about object pools
38 * note that mr and mw share a single index space
39 * so that one can map an lkey to the correct type of object
41 struct rxe_type_info rxe_type_info[RXE_NUM_TYPES] = {
44 .size = sizeof(struct rxe_ucontext),
48 .size = sizeof(struct rxe_pd),
49 .flags = RXE_POOL_NO_ALLOC,
53 .size = sizeof(struct rxe_ah),
54 .flags = RXE_POOL_ATOMIC,
58 .size = sizeof(struct rxe_srq),
59 .flags = RXE_POOL_INDEX,
60 .min_index = RXE_MIN_SRQ_INDEX,
61 .max_index = RXE_MAX_SRQ_INDEX,
65 .size = sizeof(struct rxe_qp),
66 .cleanup = rxe_qp_cleanup,
67 .flags = RXE_POOL_INDEX,
68 .min_index = RXE_MIN_QP_INDEX,
69 .max_index = RXE_MAX_QP_INDEX,
73 .size = sizeof(struct rxe_cq),
74 .cleanup = rxe_cq_cleanup,
78 .size = sizeof(struct rxe_mem),
79 .cleanup = rxe_mem_cleanup,
80 .flags = RXE_POOL_INDEX,
81 .max_index = RXE_MAX_MR_INDEX,
82 .min_index = RXE_MIN_MR_INDEX,
86 .size = sizeof(struct rxe_mem),
87 .flags = RXE_POOL_INDEX,
88 .max_index = RXE_MAX_MW_INDEX,
89 .min_index = RXE_MIN_MW_INDEX,
93 .size = sizeof(struct rxe_mc_grp),
94 .cleanup = rxe_mc_cleanup,
95 .flags = RXE_POOL_KEY,
96 .key_offset = offsetof(struct rxe_mc_grp, mgid),
97 .key_size = sizeof(union ib_gid),
99 [RXE_TYPE_MC_ELEM] = {
100 .name = "rxe-mc_elem",
101 .size = sizeof(struct rxe_mc_elem),
102 .flags = RXE_POOL_ATOMIC,
106 static inline const char *pool_name(struct rxe_pool *pool)
108 return rxe_type_info[pool->type].name;
111 static inline struct kmem_cache *pool_cache(struct rxe_pool *pool)
113 return rxe_type_info[pool->type].cache;
116 static void rxe_cache_clean(size_t cnt)
119 struct rxe_type_info *type;
121 for (i = 0; i < cnt; i++) {
122 type = &rxe_type_info[i];
123 if (!(type->flags & RXE_POOL_NO_ALLOC)) {
124 kmem_cache_destroy(type->cache);
130 int rxe_cache_init(void)
135 struct rxe_type_info *type;
137 for (i = 0; i < RXE_NUM_TYPES; i++) {
138 type = &rxe_type_info[i];
139 size = ALIGN(type->size, RXE_POOL_ALIGN);
140 if (!(type->flags & RXE_POOL_NO_ALLOC)) {
142 kmem_cache_create(type->name, size,
144 RXE_POOL_CACHE_FLAGS, NULL);
146 pr_err("Unable to init kmem cache for %s\n",
162 void rxe_cache_exit(void)
164 rxe_cache_clean(RXE_NUM_TYPES);
167 static int rxe_pool_init_index(struct rxe_pool *pool, u32 max, u32 min)
172 if ((max - min + 1) < pool->max_elem) {
173 pr_warn("not enough indices for max_elem\n");
178 pool->max_index = max;
179 pool->min_index = min;
181 size = BITS_TO_LONGS(max - min + 1) * sizeof(long);
182 pool->table = kmalloc(size, GFP_KERNEL);
188 pool->table_size = size;
189 bitmap_zero(pool->table, max - min + 1);
197 struct rxe_pool *pool,
198 enum rxe_elem_type type,
199 unsigned int max_elem)
202 size_t size = rxe_type_info[type].size;
204 memset(pool, 0, sizeof(*pool));
208 pool->max_elem = max_elem;
209 pool->elem_size = ALIGN(size, RXE_POOL_ALIGN);
210 pool->flags = rxe_type_info[type].flags;
211 pool->tree = RB_ROOT;
212 pool->cleanup = rxe_type_info[type].cleanup;
214 atomic_set(&pool->num_elem, 0);
216 kref_init(&pool->ref_cnt);
218 rwlock_init(&pool->pool_lock);
220 if (rxe_type_info[type].flags & RXE_POOL_INDEX) {
221 err = rxe_pool_init_index(pool,
222 rxe_type_info[type].max_index,
223 rxe_type_info[type].min_index);
228 if (rxe_type_info[type].flags & RXE_POOL_KEY) {
229 pool->key_offset = rxe_type_info[type].key_offset;
230 pool->key_size = rxe_type_info[type].key_size;
233 pool->state = RXE_POOL_STATE_VALID;
239 static void rxe_pool_release(struct kref *kref)
241 struct rxe_pool *pool = container_of(kref, struct rxe_pool, ref_cnt);
243 pool->state = RXE_POOL_STATE_INVALID;
247 static void rxe_pool_put(struct rxe_pool *pool)
249 kref_put(&pool->ref_cnt, rxe_pool_release);
252 void rxe_pool_cleanup(struct rxe_pool *pool)
256 write_lock_irqsave(&pool->pool_lock, flags);
257 pool->state = RXE_POOL_STATE_INVALID;
258 if (atomic_read(&pool->num_elem) > 0)
259 pr_warn("%s pool destroyed with unfree'd elem\n",
261 write_unlock_irqrestore(&pool->pool_lock, flags);
266 static u32 alloc_index(struct rxe_pool *pool)
269 u32 range = pool->max_index - pool->min_index + 1;
271 index = find_next_zero_bit(pool->table, range, pool->last);
273 index = find_first_zero_bit(pool->table, range);
275 WARN_ON_ONCE(index >= range);
276 set_bit(index, pool->table);
278 return index + pool->min_index;
281 static void insert_index(struct rxe_pool *pool, struct rxe_pool_entry *new)
283 struct rb_node **link = &pool->tree.rb_node;
284 struct rb_node *parent = NULL;
285 struct rxe_pool_entry *elem;
289 elem = rb_entry(parent, struct rxe_pool_entry, node);
291 if (elem->index == new->index) {
292 pr_warn("element already exists!\n");
296 if (elem->index > new->index)
297 link = &(*link)->rb_left;
299 link = &(*link)->rb_right;
302 rb_link_node(&new->node, parent, link);
303 rb_insert_color(&new->node, &pool->tree);
308 static void insert_key(struct rxe_pool *pool, struct rxe_pool_entry *new)
310 struct rb_node **link = &pool->tree.rb_node;
311 struct rb_node *parent = NULL;
312 struct rxe_pool_entry *elem;
317 elem = rb_entry(parent, struct rxe_pool_entry, node);
319 cmp = memcmp((u8 *)elem + pool->key_offset,
320 (u8 *)new + pool->key_offset, pool->key_size);
323 pr_warn("key already exists!\n");
328 link = &(*link)->rb_left;
330 link = &(*link)->rb_right;
333 rb_link_node(&new->node, parent, link);
334 rb_insert_color(&new->node, &pool->tree);
339 void rxe_add_key(void *arg, void *key)
341 struct rxe_pool_entry *elem = arg;
342 struct rxe_pool *pool = elem->pool;
345 write_lock_irqsave(&pool->pool_lock, flags);
346 memcpy((u8 *)elem + pool->key_offset, key, pool->key_size);
347 insert_key(pool, elem);
348 write_unlock_irqrestore(&pool->pool_lock, flags);
351 void rxe_drop_key(void *arg)
353 struct rxe_pool_entry *elem = arg;
354 struct rxe_pool *pool = elem->pool;
357 write_lock_irqsave(&pool->pool_lock, flags);
358 rb_erase(&elem->node, &pool->tree);
359 write_unlock_irqrestore(&pool->pool_lock, flags);
362 void rxe_add_index(void *arg)
364 struct rxe_pool_entry *elem = arg;
365 struct rxe_pool *pool = elem->pool;
368 write_lock_irqsave(&pool->pool_lock, flags);
369 elem->index = alloc_index(pool);
370 insert_index(pool, elem);
371 write_unlock_irqrestore(&pool->pool_lock, flags);
374 void rxe_drop_index(void *arg)
376 struct rxe_pool_entry *elem = arg;
377 struct rxe_pool *pool = elem->pool;
380 write_lock_irqsave(&pool->pool_lock, flags);
381 clear_bit(elem->index - pool->min_index, pool->table);
382 rb_erase(&elem->node, &pool->tree);
383 write_unlock_irqrestore(&pool->pool_lock, flags);
386 void *rxe_alloc(struct rxe_pool *pool)
388 struct rxe_pool_entry *elem;
391 might_sleep_if(!(pool->flags & RXE_POOL_ATOMIC));
393 read_lock_irqsave(&pool->pool_lock, flags);
394 if (pool->state != RXE_POOL_STATE_VALID) {
395 read_unlock_irqrestore(&pool->pool_lock, flags);
398 kref_get(&pool->ref_cnt);
399 read_unlock_irqrestore(&pool->pool_lock, flags);
401 if (!ib_device_try_get(&pool->rxe->ib_dev))
404 if (atomic_inc_return(&pool->num_elem) > pool->max_elem)
407 elem = kmem_cache_zalloc(pool_cache(pool),
408 (pool->flags & RXE_POOL_ATOMIC) ?
409 GFP_ATOMIC : GFP_KERNEL);
414 kref_init(&elem->ref_cnt);
419 atomic_dec(&pool->num_elem);
420 ib_device_put(&pool->rxe->ib_dev);
426 int rxe_add_to_pool(struct rxe_pool *pool, struct rxe_pool_entry *elem)
430 might_sleep_if(!(pool->flags & RXE_POOL_ATOMIC));
432 read_lock_irqsave(&pool->pool_lock, flags);
433 if (pool->state != RXE_POOL_STATE_VALID) {
434 read_unlock_irqrestore(&pool->pool_lock, flags);
437 kref_get(&pool->ref_cnt);
438 read_unlock_irqrestore(&pool->pool_lock, flags);
440 if (!ib_device_try_get(&pool->rxe->ib_dev))
443 if (atomic_inc_return(&pool->num_elem) > pool->max_elem)
447 kref_init(&elem->ref_cnt);
452 atomic_dec(&pool->num_elem);
453 ib_device_put(&pool->rxe->ib_dev);
459 void rxe_elem_release(struct kref *kref)
461 struct rxe_pool_entry *elem =
462 container_of(kref, struct rxe_pool_entry, ref_cnt);
463 struct rxe_pool *pool = elem->pool;
468 if (!(pool->flags & RXE_POOL_NO_ALLOC))
469 kmem_cache_free(pool_cache(pool), elem);
470 atomic_dec(&pool->num_elem);
471 ib_device_put(&pool->rxe->ib_dev);
475 void *rxe_pool_get_index(struct rxe_pool *pool, u32 index)
477 struct rb_node *node = NULL;
478 struct rxe_pool_entry *elem = NULL;
481 read_lock_irqsave(&pool->pool_lock, flags);
483 if (pool->state != RXE_POOL_STATE_VALID)
486 node = pool->tree.rb_node;
489 elem = rb_entry(node, struct rxe_pool_entry, node);
491 if (elem->index > index)
492 node = node->rb_left;
493 else if (elem->index < index)
494 node = node->rb_right;
496 kref_get(&elem->ref_cnt);
502 read_unlock_irqrestore(&pool->pool_lock, flags);
503 return node ? elem : NULL;
506 void *rxe_pool_get_key(struct rxe_pool *pool, void *key)
508 struct rb_node *node = NULL;
509 struct rxe_pool_entry *elem = NULL;
513 read_lock_irqsave(&pool->pool_lock, flags);
515 if (pool->state != RXE_POOL_STATE_VALID)
518 node = pool->tree.rb_node;
521 elem = rb_entry(node, struct rxe_pool_entry, node);
523 cmp = memcmp((u8 *)elem + pool->key_offset,
524 key, pool->key_size);
527 node = node->rb_left;
529 node = node->rb_right;
535 kref_get(&elem->ref_cnt);
538 read_unlock_irqrestore(&pool->pool_lock, flags);
539 return node ? elem : NULL;