Lines Matching full:pool
105 static inline const char *pool_name(struct rxe_pool *pool) in pool_name() argument
107 return rxe_type_info[pool->type].name; in pool_name()
110 static inline struct kmem_cache *pool_cache(struct rxe_pool *pool) in pool_cache() argument
112 return rxe_type_info[pool->type].cache; in pool_cache()
161 static int rxe_pool_init_index(struct rxe_pool *pool, u32 max, u32 min) in rxe_pool_init_index() argument
166 if ((max - min + 1) < pool->max_elem) { in rxe_pool_init_index()
172 pool->max_index = max; in rxe_pool_init_index()
173 pool->min_index = min; in rxe_pool_init_index()
176 pool->table = kmalloc(size, GFP_KERNEL); in rxe_pool_init_index()
177 if (!pool->table) { in rxe_pool_init_index()
182 pool->table_size = size; in rxe_pool_init_index()
183 bitmap_zero(pool->table, max - min + 1); in rxe_pool_init_index()
191 struct rxe_pool *pool, in rxe_pool_init() argument
198 memset(pool, 0, sizeof(*pool)); in rxe_pool_init()
200 pool->rxe = rxe; in rxe_pool_init()
201 pool->type = type; in rxe_pool_init()
202 pool->max_elem = max_elem; in rxe_pool_init()
203 pool->elem_size = ALIGN(size, RXE_POOL_ALIGN); in rxe_pool_init()
204 pool->flags = rxe_type_info[type].flags; in rxe_pool_init()
205 pool->tree = RB_ROOT; in rxe_pool_init()
206 pool->cleanup = rxe_type_info[type].cleanup; in rxe_pool_init()
208 atomic_set(&pool->num_elem, 0); in rxe_pool_init()
210 kref_init(&pool->ref_cnt); in rxe_pool_init()
212 spin_lock_init(&pool->pool_lock); in rxe_pool_init()
215 err = rxe_pool_init_index(pool, in rxe_pool_init()
223 pool->key_offset = rxe_type_info[type].key_offset; in rxe_pool_init()
224 pool->key_size = rxe_type_info[type].key_size; in rxe_pool_init()
227 pool->state = rxe_pool_valid; in rxe_pool_init()
235 struct rxe_pool *pool = container_of(kref, struct rxe_pool, ref_cnt); in rxe_pool_release() local
237 pool->state = rxe_pool_invalid; in rxe_pool_release()
238 kfree(pool->table); in rxe_pool_release()
241 static void rxe_pool_put(struct rxe_pool *pool) in rxe_pool_put() argument
243 kref_put(&pool->ref_cnt, rxe_pool_release); in rxe_pool_put()
246 int rxe_pool_cleanup(struct rxe_pool *pool) in rxe_pool_cleanup() argument
250 spin_lock_irqsave(&pool->pool_lock, flags); in rxe_pool_cleanup()
251 pool->state = rxe_pool_invalid; in rxe_pool_cleanup()
252 if (atomic_read(&pool->num_elem) > 0) in rxe_pool_cleanup()
253 pr_warn("%s pool destroyed with unfree'd elem\n", in rxe_pool_cleanup()
254 pool_name(pool)); in rxe_pool_cleanup()
255 spin_unlock_irqrestore(&pool->pool_lock, flags); in rxe_pool_cleanup()
257 rxe_pool_put(pool); in rxe_pool_cleanup()
262 static u32 alloc_index(struct rxe_pool *pool) in alloc_index() argument
265 u32 range = pool->max_index - pool->min_index + 1; in alloc_index()
267 index = find_next_zero_bit(pool->table, range, pool->last); in alloc_index()
269 index = find_first_zero_bit(pool->table, range); in alloc_index()
272 set_bit(index, pool->table); in alloc_index()
273 pool->last = index; in alloc_index()
274 return index + pool->min_index; in alloc_index()
277 static void insert_index(struct rxe_pool *pool, struct rxe_pool_entry *new) in insert_index() argument
279 struct rb_node **link = &pool->tree.rb_node; in insert_index()
299 rb_insert_color(&new->node, &pool->tree); in insert_index()
304 static void insert_key(struct rxe_pool *pool, struct rxe_pool_entry *new) in insert_key() argument
306 struct rb_node **link = &pool->tree.rb_node; in insert_key()
315 cmp = memcmp((u8 *)elem + pool->key_offset, in insert_key()
316 (u8 *)new + pool->key_offset, pool->key_size); in insert_key()
330 rb_insert_color(&new->node, &pool->tree); in insert_key()
338 struct rxe_pool *pool = elem->pool; in rxe_add_key() local
341 spin_lock_irqsave(&pool->pool_lock, flags); in rxe_add_key()
342 memcpy((u8 *)elem + pool->key_offset, key, pool->key_size); in rxe_add_key()
343 insert_key(pool, elem); in rxe_add_key()
344 spin_unlock_irqrestore(&pool->pool_lock, flags); in rxe_add_key()
350 struct rxe_pool *pool = elem->pool; in rxe_drop_key() local
353 spin_lock_irqsave(&pool->pool_lock, flags); in rxe_drop_key()
354 rb_erase(&elem->node, &pool->tree); in rxe_drop_key()
355 spin_unlock_irqrestore(&pool->pool_lock, flags); in rxe_drop_key()
361 struct rxe_pool *pool = elem->pool; in rxe_add_index() local
364 spin_lock_irqsave(&pool->pool_lock, flags); in rxe_add_index()
365 elem->index = alloc_index(pool); in rxe_add_index()
366 insert_index(pool, elem); in rxe_add_index()
367 spin_unlock_irqrestore(&pool->pool_lock, flags); in rxe_add_index()
373 struct rxe_pool *pool = elem->pool; in rxe_drop_index() local
376 spin_lock_irqsave(&pool->pool_lock, flags); in rxe_drop_index()
377 clear_bit(elem->index - pool->min_index, pool->table); in rxe_drop_index()
378 rb_erase(&elem->node, &pool->tree); in rxe_drop_index()
379 spin_unlock_irqrestore(&pool->pool_lock, flags); in rxe_drop_index()
382 void *rxe_alloc(struct rxe_pool *pool) in rxe_alloc() argument
387 might_sleep_if(!(pool->flags & RXE_POOL_ATOMIC)); in rxe_alloc()
389 spin_lock_irqsave(&pool->pool_lock, flags); in rxe_alloc()
390 if (pool->state != rxe_pool_valid) { in rxe_alloc()
391 spin_unlock_irqrestore(&pool->pool_lock, flags); in rxe_alloc()
394 kref_get(&pool->ref_cnt); in rxe_alloc()
395 spin_unlock_irqrestore(&pool->pool_lock, flags); in rxe_alloc()
397 kref_get(&pool->rxe->ref_cnt); in rxe_alloc()
399 if (atomic_inc_return(&pool->num_elem) > pool->max_elem) in rxe_alloc()
402 elem = kmem_cache_zalloc(pool_cache(pool), in rxe_alloc()
403 (pool->flags & RXE_POOL_ATOMIC) ? in rxe_alloc()
408 elem->pool = pool; in rxe_alloc()
414 atomic_dec(&pool->num_elem); in rxe_alloc()
415 rxe_dev_put(pool->rxe); in rxe_alloc()
416 rxe_pool_put(pool); in rxe_alloc()
424 struct rxe_pool *pool = elem->pool; in rxe_elem_release() local
426 if (pool->cleanup) in rxe_elem_release()
427 pool->cleanup(elem); in rxe_elem_release()
429 kmem_cache_free(pool_cache(pool), elem); in rxe_elem_release()
430 atomic_dec(&pool->num_elem); in rxe_elem_release()
431 rxe_dev_put(pool->rxe); in rxe_elem_release()
432 rxe_pool_put(pool); in rxe_elem_release()
435 void *rxe_pool_get_index(struct rxe_pool *pool, u32 index) in rxe_pool_get_index() argument
441 spin_lock_irqsave(&pool->pool_lock, flags); in rxe_pool_get_index()
443 if (pool->state != rxe_pool_valid) in rxe_pool_get_index()
446 node = pool->tree.rb_node; in rxe_pool_get_index()
463 spin_unlock_irqrestore(&pool->pool_lock, flags); in rxe_pool_get_index()
467 void *rxe_pool_get_key(struct rxe_pool *pool, void *key) in rxe_pool_get_key() argument
474 spin_lock_irqsave(&pool->pool_lock, flags); in rxe_pool_get_key()
476 if (pool->state != rxe_pool_valid) in rxe_pool_get_key()
479 node = pool->tree.rb_node; in rxe_pool_get_key()
484 cmp = memcmp((u8 *)elem + pool->key_offset, in rxe_pool_get_key()
485 key, pool->key_size); in rxe_pool_get_key()
499 spin_unlock_irqrestore(&pool->pool_lock, flags); in rxe_pool_get_key()