net/core/xdp.c

54 	const struct xdp_mem_allocator *xa = ptr;
57 	return xa->mem.id != mem_id;
74 	struct xdp_mem_allocator *xa;
76 	xa = container_of(rcu, struct xdp_mem_allocator, rcu);
79 	ida_free(&mem_id_pool, xa->mem.id);
81 	kfree(xa);
84 static void mem_xa_remove(struct xdp_mem_allocator *xa)
86 	trace_mem_disconnect(xa);
88 	if (!rhashtable_remove_fast(mem_id_ht, &xa->node, mem_id_rht_params))
89 		call_rcu(&xa->rcu, __xdp_mem_allocator_rcu_free);
94 	struct xdp_mem_allocator *xa;
103 		while ((xa = rhashtable_walk_next(&iter)) && !IS_ERR(xa)) {
104 			if (xa->allocator == allocator)
105 				mem_xa_remove(xa);
110 	} while (xa == ERR_PTR(-EAGAIN));
118 	struct xdp_mem_allocator *xa;
131 		xa = rhashtable_lookup(mem_id_ht, &id, mem_id_rht_params);
132 		page_pool_destroy(xa->page_pool);
461 	struct xdp_mem_allocator *xa = bq->xa;
463 	if (unlikely(!xa || !bq->count))
466 	page_pool_put_page_bulk(xa->page_pool, bq->q, bq->count);
467 	/* bq->xa is not cleared to save lookup, if mem.id same in next bulk */
477 	struct xdp_mem_allocator *xa;
484 	xa = bq->xa;
485 	if (unlikely(!xa)) {
486 		xa = rhashtable_lookup(mem_id_ht, &mem->id, mem_id_rht_params);
488 		bq->xa = xa;
494 	if (unlikely(mem->id != xa->mem.id)) {
496 		bq->xa = rhashtable_lookup(mem_id_ht, &mem->id, mem_id_rht_params);