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