204 	struct rxe_pool_entry *elem;  in insert_index()  local
208 		elem = rb_entry(parent, struct rxe_pool_entry, node);  in insert_index()
210 		if (elem->index == new->index) {  in insert_index()
215 		if (elem->index > new->index)  in insert_index()
231 	struct rxe_pool_entry *elem;  in insert_key()  local
236 		elem = rb_entry(parent, struct rxe_pool_entry, node);  in insert_key()
238 		cmp = memcmp((u8 *)elem + pool->key_offset,  in insert_key()
260 	struct rxe_pool_entry *elem = arg;  in rxe_add_key()  local
261 	struct rxe_pool *pool = elem->pool;  in rxe_add_key()
265 	memcpy((u8 *)elem + pool->key_offset, key, pool->key_size);  in rxe_add_key()
266 	insert_key(pool, elem);  in rxe_add_key()
272 	struct rxe_pool_entry *elem = arg;  in rxe_drop_key()  local
273 	struct rxe_pool *pool = elem->pool;  in rxe_drop_key()
277 	rb_erase(&elem->node, &pool->tree);  in rxe_drop_key()
283 	struct rxe_pool_entry *elem = arg;  in rxe_add_index()  local
284 	struct rxe_pool *pool = elem->pool;  in rxe_add_index()
288 	elem->index = alloc_index(pool);  in rxe_add_index()
289 	insert_index(pool, elem);  in rxe_add_index()
295 	struct rxe_pool_entry *elem = arg;  in rxe_drop_index()  local
296 	struct rxe_pool *pool = elem->pool;  in rxe_drop_index()
300 	clear_bit(elem->index - pool->min_index, pool->table);  in rxe_drop_index()
301 	rb_erase(&elem->node, &pool->tree);  in rxe_drop_index()
307 	struct rxe_pool_entry *elem;  in rxe_alloc()  local
326 	elem = kzalloc(rxe_type_info[pool->type].size,  in rxe_alloc()
329 	if (!elem)  in rxe_alloc()
332 	elem->pool = pool;  in rxe_alloc()
333 	kref_init(&elem->ref_cnt);  in rxe_alloc()
335 	return elem;  in rxe_alloc()
345 int rxe_add_to_pool(struct rxe_pool *pool, struct rxe_pool_entry *elem)  in rxe_add_to_pool()  argument
365 	elem->pool = pool;  in rxe_add_to_pool()
366 	kref_init(&elem->ref_cnt);  in rxe_add_to_pool()
380 	struct rxe_pool_entry *elem =  in rxe_elem_release()  local
382 	struct rxe_pool *pool = elem->pool;  in rxe_elem_release()
385 		pool->cleanup(elem);  in rxe_elem_release()
388 		kfree(elem);  in rxe_elem_release()
397 	struct rxe_pool_entry *elem = NULL;  in rxe_pool_get_index()  local
408 		elem = rb_entry(node, struct rxe_pool_entry, node);  in rxe_pool_get_index()
410 		if (elem->index > index)  in rxe_pool_get_index()
412 		else if (elem->index < index)  in rxe_pool_get_index()
415 			kref_get(&elem->ref_cnt);  in rxe_pool_get_index()
422 	return node ? elem : NULL;  in rxe_pool_get_index()
428 	struct rxe_pool_entry *elem = NULL;  in rxe_pool_get_key()  local
440 		elem = rb_entry(node, struct rxe_pool_entry, node);  in rxe_pool_get_key()
442 		cmp = memcmp((u8 *)elem + pool->key_offset,  in rxe_pool_get_key()
454 		kref_get(&elem->ref_cnt);  in rxe_pool_get_key()
458 	return node ? elem : NULL;  in rxe_pool_get_key()