xdp.c 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363
  1. /* net/core/xdp.c
  2. *
  3. * Copyright (c) 2017 Jesper Dangaard Brouer, Red Hat Inc.
  4. * Released under terms in GPL version 2. See COPYING.
  5. */
  6. #include <linux/types.h>
  7. #include <linux/mm.h>
  8. #include <linux/slab.h>
  9. #include <linux/idr.h>
  10. #include <linux/rhashtable.h>
  11. #include <net/page_pool.h>
  12. #include <net/xdp.h>
  13. #define REG_STATE_NEW 0x0
  14. #define REG_STATE_REGISTERED 0x1
  15. #define REG_STATE_UNREGISTERED 0x2
  16. #define REG_STATE_UNUSED 0x3
  17. static DEFINE_IDA(mem_id_pool);
  18. static DEFINE_MUTEX(mem_id_lock);
  19. #define MEM_ID_MAX 0xFFFE
  20. #define MEM_ID_MIN 1
  21. static int mem_id_next = MEM_ID_MIN;
  22. static bool mem_id_init; /* false */
  23. static struct rhashtable *mem_id_ht;
  24. struct xdp_mem_allocator {
  25. struct xdp_mem_info mem;
  26. union {
  27. void *allocator;
  28. struct page_pool *page_pool;
  29. };
  30. struct rhash_head node;
  31. struct rcu_head rcu;
  32. };
  33. static u32 xdp_mem_id_hashfn(const void *data, u32 len, u32 seed)
  34. {
  35. const u32 *k = data;
  36. const u32 key = *k;
  37. BUILD_BUG_ON(FIELD_SIZEOF(struct xdp_mem_allocator, mem.id)
  38. != sizeof(u32));
  39. /* Use cyclic increasing ID as direct hash key, see rht_bucket_index */
  40. return key << RHT_HASH_RESERVED_SPACE;
  41. }
  42. static int xdp_mem_id_cmp(struct rhashtable_compare_arg *arg,
  43. const void *ptr)
  44. {
  45. const struct xdp_mem_allocator *xa = ptr;
  46. u32 mem_id = *(u32 *)arg->key;
  47. return xa->mem.id != mem_id;
  48. }
  49. static const struct rhashtable_params mem_id_rht_params = {
  50. .nelem_hint = 64,
  51. .head_offset = offsetof(struct xdp_mem_allocator, node),
  52. .key_offset = offsetof(struct xdp_mem_allocator, mem.id),
  53. .key_len = FIELD_SIZEOF(struct xdp_mem_allocator, mem.id),
  54. .max_size = MEM_ID_MAX,
  55. .min_size = 8,
  56. .automatic_shrinking = true,
  57. .hashfn = xdp_mem_id_hashfn,
  58. .obj_cmpfn = xdp_mem_id_cmp,
  59. };
  60. static void __xdp_mem_allocator_rcu_free(struct rcu_head *rcu)
  61. {
  62. struct xdp_mem_allocator *xa;
  63. xa = container_of(rcu, struct xdp_mem_allocator, rcu);
  64. /* Allow this ID to be reused */
  65. ida_simple_remove(&mem_id_pool, xa->mem.id);
  66. /* Notice, driver is expected to free the *allocator,
  67. * e.g. page_pool, and MUST also use RCU free.
  68. */
  69. /* Poison memory */
  70. xa->mem.id = 0xFFFF;
  71. xa->mem.type = 0xF0F0;
  72. xa->allocator = (void *)0xDEAD9001;
  73. kfree(xa);
  74. }
  75. static void __xdp_rxq_info_unreg_mem_model(struct xdp_rxq_info *xdp_rxq)
  76. {
  77. struct xdp_mem_allocator *xa;
  78. int id = xdp_rxq->mem.id;
  79. int err;
  80. if (id == 0)
  81. return;
  82. mutex_lock(&mem_id_lock);
  83. xa = rhashtable_lookup(mem_id_ht, &id, mem_id_rht_params);
  84. if (!xa) {
  85. mutex_unlock(&mem_id_lock);
  86. return;
  87. }
  88. err = rhashtable_remove_fast(mem_id_ht, &xa->node, mem_id_rht_params);
  89. WARN_ON(err);
  90. call_rcu(&xa->rcu, __xdp_mem_allocator_rcu_free);
  91. mutex_unlock(&mem_id_lock);
  92. }
  93. void xdp_rxq_info_unreg(struct xdp_rxq_info *xdp_rxq)
  94. {
  95. /* Simplify driver cleanup code paths, allow unreg "unused" */
  96. if (xdp_rxq->reg_state == REG_STATE_UNUSED)
  97. return;
  98. WARN(!(xdp_rxq->reg_state == REG_STATE_REGISTERED), "Driver BUG");
  99. __xdp_rxq_info_unreg_mem_model(xdp_rxq);
  100. xdp_rxq->reg_state = REG_STATE_UNREGISTERED;
  101. xdp_rxq->dev = NULL;
  102. /* Reset mem info to defaults */
  103. xdp_rxq->mem.id = 0;
  104. xdp_rxq->mem.type = 0;
  105. }
  106. EXPORT_SYMBOL_GPL(xdp_rxq_info_unreg);
  107. static void xdp_rxq_info_init(struct xdp_rxq_info *xdp_rxq)
  108. {
  109. memset(xdp_rxq, 0, sizeof(*xdp_rxq));
  110. }
  111. /* Returns 0 on success, negative on failure */
  112. int xdp_rxq_info_reg(struct xdp_rxq_info *xdp_rxq,
  113. struct net_device *dev, u32 queue_index)
  114. {
  115. if (xdp_rxq->reg_state == REG_STATE_UNUSED) {
  116. WARN(1, "Driver promised not to register this");
  117. return -EINVAL;
  118. }
  119. if (xdp_rxq->reg_state == REG_STATE_REGISTERED) {
  120. WARN(1, "Missing unregister, handled but fix driver");
  121. xdp_rxq_info_unreg(xdp_rxq);
  122. }
  123. if (!dev) {
  124. WARN(1, "Missing net_device from driver");
  125. return -ENODEV;
  126. }
  127. /* State either UNREGISTERED or NEW */
  128. xdp_rxq_info_init(xdp_rxq);
  129. xdp_rxq->dev = dev;
  130. xdp_rxq->queue_index = queue_index;
  131. xdp_rxq->reg_state = REG_STATE_REGISTERED;
  132. return 0;
  133. }
  134. EXPORT_SYMBOL_GPL(xdp_rxq_info_reg);
  135. void xdp_rxq_info_unused(struct xdp_rxq_info *xdp_rxq)
  136. {
  137. xdp_rxq->reg_state = REG_STATE_UNUSED;
  138. }
  139. EXPORT_SYMBOL_GPL(xdp_rxq_info_unused);
  140. bool xdp_rxq_info_is_reg(struct xdp_rxq_info *xdp_rxq)
  141. {
  142. return (xdp_rxq->reg_state == REG_STATE_REGISTERED);
  143. }
  144. EXPORT_SYMBOL_GPL(xdp_rxq_info_is_reg);
  145. static int __mem_id_init_hash_table(void)
  146. {
  147. struct rhashtable *rht;
  148. int ret;
  149. if (unlikely(mem_id_init))
  150. return 0;
  151. rht = kzalloc(sizeof(*rht), GFP_KERNEL);
  152. if (!rht)
  153. return -ENOMEM;
  154. ret = rhashtable_init(rht, &mem_id_rht_params);
  155. if (ret < 0) {
  156. kfree(rht);
  157. return ret;
  158. }
  159. mem_id_ht = rht;
  160. smp_mb(); /* mutex lock should provide enough pairing */
  161. mem_id_init = true;
  162. return 0;
  163. }
  164. /* Allocate a cyclic ID that maps to allocator pointer.
  165. * See: https://www.kernel.org/doc/html/latest/core-api/idr.html
  166. *
  167. * Caller must lock mem_id_lock.
  168. */
  169. static int __mem_id_cyclic_get(gfp_t gfp)
  170. {
  171. int retries = 1;
  172. int id;
  173. again:
  174. id = ida_simple_get(&mem_id_pool, mem_id_next, MEM_ID_MAX, gfp);
  175. if (id < 0) {
  176. if (id == -ENOSPC) {
  177. /* Cyclic allocator, reset next id */
  178. if (retries--) {
  179. mem_id_next = MEM_ID_MIN;
  180. goto again;
  181. }
  182. }
  183. return id; /* errno */
  184. }
  185. mem_id_next = id + 1;
  186. return id;
  187. }
  188. static bool __is_supported_mem_type(enum xdp_mem_type type)
  189. {
  190. if (type == MEM_TYPE_PAGE_POOL)
  191. return is_page_pool_compiled_in();
  192. if (type >= MEM_TYPE_MAX)
  193. return false;
  194. return true;
  195. }
  196. int xdp_rxq_info_reg_mem_model(struct xdp_rxq_info *xdp_rxq,
  197. enum xdp_mem_type type, void *allocator)
  198. {
  199. struct xdp_mem_allocator *xdp_alloc;
  200. gfp_t gfp = GFP_KERNEL;
  201. int id, errno, ret;
  202. void *ptr;
  203. if (xdp_rxq->reg_state != REG_STATE_REGISTERED) {
  204. WARN(1, "Missing register, driver bug");
  205. return -EFAULT;
  206. }
  207. if (!__is_supported_mem_type(type))
  208. return -EOPNOTSUPP;
  209. xdp_rxq->mem.type = type;
  210. if (!allocator) {
  211. if (type == MEM_TYPE_PAGE_POOL)
  212. return -EINVAL; /* Setup time check page_pool req */
  213. return 0;
  214. }
  215. /* Delay init of rhashtable to save memory if feature isn't used */
  216. if (!mem_id_init) {
  217. mutex_lock(&mem_id_lock);
  218. ret = __mem_id_init_hash_table();
  219. mutex_unlock(&mem_id_lock);
  220. if (ret < 0) {
  221. WARN_ON(1);
  222. return ret;
  223. }
  224. }
  225. xdp_alloc = kzalloc(sizeof(*xdp_alloc), gfp);
  226. if (!xdp_alloc)
  227. return -ENOMEM;
  228. mutex_lock(&mem_id_lock);
  229. id = __mem_id_cyclic_get(gfp);
  230. if (id < 0) {
  231. errno = id;
  232. goto err;
  233. }
  234. xdp_rxq->mem.id = id;
  235. xdp_alloc->mem = xdp_rxq->mem;
  236. xdp_alloc->allocator = allocator;
  237. /* Insert allocator into ID lookup table */
  238. ptr = rhashtable_insert_slow(mem_id_ht, &id, &xdp_alloc->node);
  239. if (IS_ERR(ptr)) {
  240. errno = PTR_ERR(ptr);
  241. goto err;
  242. }
  243. mutex_unlock(&mem_id_lock);
  244. return 0;
  245. err:
  246. mutex_unlock(&mem_id_lock);
  247. kfree(xdp_alloc);
  248. return errno;
  249. }
  250. EXPORT_SYMBOL_GPL(xdp_rxq_info_reg_mem_model);
  251. /* XDP RX runs under NAPI protection, and in different delivery error
  252. * scenarios (e.g. queue full), it is possible to return the xdp_frame
  253. * while still leveraging this protection. The @napi_direct boolian
  254. * is used for those calls sites. Thus, allowing for faster recycling
  255. * of xdp_frames/pages in those cases.
  256. */
  257. static void __xdp_return(void *data, struct xdp_mem_info *mem, bool napi_direct)
  258. {
  259. struct xdp_mem_allocator *xa;
  260. struct page *page;
  261. switch (mem->type) {
  262. case MEM_TYPE_PAGE_POOL:
  263. rcu_read_lock();
  264. /* mem->id is valid, checked in xdp_rxq_info_reg_mem_model() */
  265. xa = rhashtable_lookup(mem_id_ht, &mem->id, mem_id_rht_params);
  266. page = virt_to_head_page(data);
  267. if (xa)
  268. page_pool_put_page(xa->page_pool, page, napi_direct);
  269. else
  270. put_page(page);
  271. rcu_read_unlock();
  272. break;
  273. case MEM_TYPE_PAGE_SHARED:
  274. page_frag_free(data);
  275. break;
  276. case MEM_TYPE_PAGE_ORDER0:
  277. page = virt_to_page(data); /* Assumes order0 page*/
  278. put_page(page);
  279. break;
  280. default:
  281. /* Not possible, checked in xdp_rxq_info_reg_mem_model() */
  282. break;
  283. }
  284. }
  285. void xdp_return_frame(struct xdp_frame *xdpf)
  286. {
  287. __xdp_return(xdpf->data, &xdpf->mem, false);
  288. }
  289. EXPORT_SYMBOL_GPL(xdp_return_frame);
  290. void xdp_return_frame_rx_napi(struct xdp_frame *xdpf)
  291. {
  292. __xdp_return(xdpf->data, &xdpf->mem, true);
  293. }
  294. EXPORT_SYMBOL_GPL(xdp_return_frame_rx_napi);
  295. void xdp_return_buff(struct xdp_buff *xdp)
  296. {
  297. __xdp_return(xdp->data, &xdp->rxq->mem, true);
  298. }
  299. EXPORT_SYMBOL_GPL(xdp_return_buff);