xdp.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /* net/core/xdp.c
  3. *
  4. * Copyright (c) 2017 Jesper Dangaard Brouer, Red Hat Inc.
  5. */
  6. #include <linux/bpf.h>
  7. #include <linux/filter.h>
  8. #include <linux/types.h>
  9. #include <linux/mm.h>
  10. #include <linux/netdevice.h>
  11. #include <linux/slab.h>
  12. #include <linux/idr.h>
  13. #include <linux/rhashtable.h>
  14. #include <linux/bug.h>
  15. #include <net/page_pool.h>
  16. #include <net/xdp.h>
  17. #include <net/xdp_priv.h> /* struct xdp_mem_allocator */
  18. #include <trace/events/xdp.h>
  19. #include <net/xdp_sock_drv.h>
  20. #define REG_STATE_NEW 0x0
  21. #define REG_STATE_REGISTERED 0x1
  22. #define REG_STATE_UNREGISTERED 0x2
  23. #define REG_STATE_UNUSED 0x3
  24. static DEFINE_IDA(mem_id_pool);
  25. static DEFINE_MUTEX(mem_id_lock);
  26. #define MEM_ID_MAX 0xFFFE
  27. #define MEM_ID_MIN 1
  28. static int mem_id_next = MEM_ID_MIN;
  29. static bool mem_id_init; /* false */
  30. static struct rhashtable *mem_id_ht;
  31. static u32 xdp_mem_id_hashfn(const void *data, u32 len, u32 seed)
  32. {
  33. const u32 *k = data;
  34. const u32 key = *k;
  35. BUILD_BUG_ON(sizeof_field(struct xdp_mem_allocator, mem.id)
  36. != sizeof(u32));
  37. /* Use cyclic increasing ID as direct hash key */
  38. return key;
  39. }
  40. static int xdp_mem_id_cmp(struct rhashtable_compare_arg *arg,
  41. const void *ptr)
  42. {
  43. const struct xdp_mem_allocator *xa = ptr;
  44. u32 mem_id = *(u32 *)arg->key;
  45. return xa->mem.id != mem_id;
  46. }
  47. static const struct rhashtable_params mem_id_rht_params = {
  48. .nelem_hint = 64,
  49. .head_offset = offsetof(struct xdp_mem_allocator, node),
  50. .key_offset = offsetof(struct xdp_mem_allocator, mem.id),
  51. .key_len = sizeof_field(struct xdp_mem_allocator, mem.id),
  52. .max_size = MEM_ID_MAX,
  53. .min_size = 8,
  54. .automatic_shrinking = true,
  55. .hashfn = xdp_mem_id_hashfn,
  56. .obj_cmpfn = xdp_mem_id_cmp,
  57. };
  58. static void __xdp_mem_allocator_rcu_free(struct rcu_head *rcu)
  59. {
  60. struct xdp_mem_allocator *xa;
  61. xa = container_of(rcu, struct xdp_mem_allocator, rcu);
  62. /* Allow this ID to be reused */
  63. ida_simple_remove(&mem_id_pool, xa->mem.id);
  64. kfree(xa);
  65. }
  66. static void mem_xa_remove(struct xdp_mem_allocator *xa)
  67. {
  68. trace_mem_disconnect(xa);
  69. if (!rhashtable_remove_fast(mem_id_ht, &xa->node, mem_id_rht_params))
  70. call_rcu(&xa->rcu, __xdp_mem_allocator_rcu_free);
  71. }
  72. static void mem_allocator_disconnect(void *allocator)
  73. {
  74. struct xdp_mem_allocator *xa;
  75. struct rhashtable_iter iter;
  76. mutex_lock(&mem_id_lock);
  77. rhashtable_walk_enter(mem_id_ht, &iter);
  78. do {
  79. rhashtable_walk_start(&iter);
  80. while ((xa = rhashtable_walk_next(&iter)) && !IS_ERR(xa)) {
  81. if (xa->allocator == allocator)
  82. mem_xa_remove(xa);
  83. }
  84. rhashtable_walk_stop(&iter);
  85. } while (xa == ERR_PTR(-EAGAIN));
  86. rhashtable_walk_exit(&iter);
  87. mutex_unlock(&mem_id_lock);
  88. }
  89. void xdp_unreg_mem_model(struct xdp_mem_info *mem)
  90. {
  91. struct xdp_mem_allocator *xa;
  92. int type = mem->type;
  93. int id = mem->id;
  94. /* Reset mem info to defaults */
  95. mem->id = 0;
  96. mem->type = 0;
  97. if (id == 0)
  98. return;
  99. if (type == MEM_TYPE_PAGE_POOL) {
  100. rcu_read_lock();
  101. xa = rhashtable_lookup(mem_id_ht, &id, mem_id_rht_params);
  102. page_pool_destroy(xa->page_pool);
  103. rcu_read_unlock();
  104. }
  105. }
  106. EXPORT_SYMBOL_GPL(xdp_unreg_mem_model);
  107. void xdp_rxq_info_unreg_mem_model(struct xdp_rxq_info *xdp_rxq)
  108. {
  109. if (xdp_rxq->reg_state != REG_STATE_REGISTERED) {
  110. WARN(1, "Missing register, driver bug");
  111. return;
  112. }
  113. xdp_unreg_mem_model(&xdp_rxq->mem);
  114. }
  115. EXPORT_SYMBOL_GPL(xdp_rxq_info_unreg_mem_model);
  116. void xdp_rxq_info_unreg(struct xdp_rxq_info *xdp_rxq)
  117. {
  118. /* Simplify driver cleanup code paths, allow unreg "unused" */
  119. if (xdp_rxq->reg_state == REG_STATE_UNUSED)
  120. return;
  121. xdp_rxq_info_unreg_mem_model(xdp_rxq);
  122. xdp_rxq->reg_state = REG_STATE_UNREGISTERED;
  123. xdp_rxq->dev = NULL;
  124. }
  125. EXPORT_SYMBOL_GPL(xdp_rxq_info_unreg);
  126. static void xdp_rxq_info_init(struct xdp_rxq_info *xdp_rxq)
  127. {
  128. memset(xdp_rxq, 0, sizeof(*xdp_rxq));
  129. }
  130. /* Returns 0 on success, negative on failure */
  131. int __xdp_rxq_info_reg(struct xdp_rxq_info *xdp_rxq,
  132. struct net_device *dev, u32 queue_index,
  133. unsigned int napi_id, u32 frag_size)
  134. {
  135. if (!dev) {
  136. WARN(1, "Missing net_device from driver");
  137. return -ENODEV;
  138. }
  139. if (xdp_rxq->reg_state == REG_STATE_UNUSED) {
  140. WARN(1, "Driver promised not to register this");
  141. return -EINVAL;
  142. }
  143. if (xdp_rxq->reg_state == REG_STATE_REGISTERED) {
  144. WARN(1, "Missing unregister, handled but fix driver");
  145. xdp_rxq_info_unreg(xdp_rxq);
  146. }
  147. /* State either UNREGISTERED or NEW */
  148. xdp_rxq_info_init(xdp_rxq);
  149. xdp_rxq->dev = dev;
  150. xdp_rxq->queue_index = queue_index;
  151. xdp_rxq->napi_id = napi_id;
  152. xdp_rxq->frag_size = frag_size;
  153. xdp_rxq->reg_state = REG_STATE_REGISTERED;
  154. return 0;
  155. }
  156. EXPORT_SYMBOL_GPL(__xdp_rxq_info_reg);
  157. void xdp_rxq_info_unused(struct xdp_rxq_info *xdp_rxq)
  158. {
  159. xdp_rxq->reg_state = REG_STATE_UNUSED;
  160. }
  161. EXPORT_SYMBOL_GPL(xdp_rxq_info_unused);
  162. bool xdp_rxq_info_is_reg(struct xdp_rxq_info *xdp_rxq)
  163. {
  164. return (xdp_rxq->reg_state == REG_STATE_REGISTERED);
  165. }
  166. EXPORT_SYMBOL_GPL(xdp_rxq_info_is_reg);
  167. static int __mem_id_init_hash_table(void)
  168. {
  169. struct rhashtable *rht;
  170. int ret;
  171. if (unlikely(mem_id_init))
  172. return 0;
  173. rht = kzalloc(sizeof(*rht), GFP_KERNEL);
  174. if (!rht)
  175. return -ENOMEM;
  176. ret = rhashtable_init(rht, &mem_id_rht_params);
  177. if (ret < 0) {
  178. kfree(rht);
  179. return ret;
  180. }
  181. mem_id_ht = rht;
  182. smp_mb(); /* mutex lock should provide enough pairing */
  183. mem_id_init = true;
  184. return 0;
  185. }
  186. /* Allocate a cyclic ID that maps to allocator pointer.
  187. * See: https://www.kernel.org/doc/html/latest/core-api/idr.html
  188. *
  189. * Caller must lock mem_id_lock.
  190. */
  191. static int __mem_id_cyclic_get(gfp_t gfp)
  192. {
  193. int retries = 1;
  194. int id;
  195. again:
  196. id = ida_simple_get(&mem_id_pool, mem_id_next, MEM_ID_MAX, gfp);
  197. if (id < 0) {
  198. if (id == -ENOSPC) {
  199. /* Cyclic allocator, reset next id */
  200. if (retries--) {
  201. mem_id_next = MEM_ID_MIN;
  202. goto again;
  203. }
  204. }
  205. return id; /* errno */
  206. }
  207. mem_id_next = id + 1;
  208. return id;
  209. }
  210. static bool __is_supported_mem_type(enum xdp_mem_type type)
  211. {
  212. if (type == MEM_TYPE_PAGE_POOL)
  213. return is_page_pool_compiled_in();
  214. if (type >= MEM_TYPE_MAX)
  215. return false;
  216. return true;
  217. }
  218. static struct xdp_mem_allocator *__xdp_reg_mem_model(struct xdp_mem_info *mem,
  219. enum xdp_mem_type type,
  220. void *allocator)
  221. {
  222. struct xdp_mem_allocator *xdp_alloc;
  223. gfp_t gfp = GFP_KERNEL;
  224. int id, errno, ret;
  225. void *ptr;
  226. if (!__is_supported_mem_type(type))
  227. return ERR_PTR(-EOPNOTSUPP);
  228. mem->type = type;
  229. if (!allocator) {
  230. if (type == MEM_TYPE_PAGE_POOL)
  231. return ERR_PTR(-EINVAL); /* Setup time check page_pool req */
  232. return NULL;
  233. }
  234. /* Delay init of rhashtable to save memory if feature isn't used */
  235. if (!mem_id_init) {
  236. mutex_lock(&mem_id_lock);
  237. ret = __mem_id_init_hash_table();
  238. mutex_unlock(&mem_id_lock);
  239. if (ret < 0) {
  240. WARN_ON(1);
  241. return ERR_PTR(ret);
  242. }
  243. }
  244. xdp_alloc = kzalloc(sizeof(*xdp_alloc), gfp);
  245. if (!xdp_alloc)
  246. return ERR_PTR(-ENOMEM);
  247. mutex_lock(&mem_id_lock);
  248. id = __mem_id_cyclic_get(gfp);
  249. if (id < 0) {
  250. errno = id;
  251. goto err;
  252. }
  253. mem->id = id;
  254. xdp_alloc->mem = *mem;
  255. xdp_alloc->allocator = allocator;
  256. /* Insert allocator into ID lookup table */
  257. ptr = rhashtable_insert_slow(mem_id_ht, &id, &xdp_alloc->node);
  258. if (IS_ERR(ptr)) {
  259. ida_simple_remove(&mem_id_pool, mem->id);
  260. mem->id = 0;
  261. errno = PTR_ERR(ptr);
  262. goto err;
  263. }
  264. if (type == MEM_TYPE_PAGE_POOL)
  265. page_pool_use_xdp_mem(allocator, mem_allocator_disconnect, mem);
  266. mutex_unlock(&mem_id_lock);
  267. return xdp_alloc;
  268. err:
  269. mutex_unlock(&mem_id_lock);
  270. kfree(xdp_alloc);
  271. return ERR_PTR(errno);
  272. }
  273. int xdp_reg_mem_model(struct xdp_mem_info *mem,
  274. enum xdp_mem_type type, void *allocator)
  275. {
  276. struct xdp_mem_allocator *xdp_alloc;
  277. xdp_alloc = __xdp_reg_mem_model(mem, type, allocator);
  278. if (IS_ERR(xdp_alloc))
  279. return PTR_ERR(xdp_alloc);
  280. return 0;
  281. }
  282. EXPORT_SYMBOL_GPL(xdp_reg_mem_model);
  283. int xdp_rxq_info_reg_mem_model(struct xdp_rxq_info *xdp_rxq,
  284. enum xdp_mem_type type, void *allocator)
  285. {
  286. struct xdp_mem_allocator *xdp_alloc;
  287. if (xdp_rxq->reg_state != REG_STATE_REGISTERED) {
  288. WARN(1, "Missing register, driver bug");
  289. return -EFAULT;
  290. }
  291. xdp_alloc = __xdp_reg_mem_model(&xdp_rxq->mem, type, allocator);
  292. if (IS_ERR(xdp_alloc))
  293. return PTR_ERR(xdp_alloc);
  294. if (trace_mem_connect_enabled() && xdp_alloc)
  295. trace_mem_connect(xdp_alloc, xdp_rxq);
  296. return 0;
  297. }
  298. EXPORT_SYMBOL_GPL(xdp_rxq_info_reg_mem_model);
  299. /* XDP RX runs under NAPI protection, and in different delivery error
  300. * scenarios (e.g. queue full), it is possible to return the xdp_frame
  301. * while still leveraging this protection. The @napi_direct boolean
  302. * is used for those calls sites. Thus, allowing for faster recycling
  303. * of xdp_frames/pages in those cases.
  304. */
  305. void __xdp_return(void *data, struct xdp_mem_info *mem, bool napi_direct,
  306. struct xdp_buff *xdp)
  307. {
  308. struct page *page;
  309. switch (mem->type) {
  310. case MEM_TYPE_PAGE_POOL:
  311. page = virt_to_head_page(data);
  312. if (napi_direct && xdp_return_frame_no_direct())
  313. napi_direct = false;
  314. /* No need to check ((page->pp_magic & ~0x3UL) == PP_SIGNATURE)
  315. * as mem->type knows this a page_pool page
  316. */
  317. page_pool_put_full_page(page->pp, page, napi_direct);
  318. break;
  319. case MEM_TYPE_PAGE_SHARED:
  320. page_frag_free(data);
  321. break;
  322. case MEM_TYPE_PAGE_ORDER0:
  323. page = virt_to_page(data); /* Assumes order0 page*/
  324. put_page(page);
  325. break;
  326. case MEM_TYPE_XSK_BUFF_POOL:
  327. /* NB! Only valid from an xdp_buff! */
  328. xsk_buff_free(xdp);
  329. break;
  330. default:
  331. /* Not possible, checked in xdp_rxq_info_reg_mem_model() */
  332. WARN(1, "Incorrect XDP memory type (%d) usage", mem->type);
  333. break;
  334. }
  335. }
  336. void xdp_return_frame(struct xdp_frame *xdpf)
  337. {
  338. struct skb_shared_info *sinfo;
  339. int i;
  340. if (likely(!xdp_frame_has_frags(xdpf)))
  341. goto out;
  342. sinfo = xdp_get_shared_info_from_frame(xdpf);
  343. for (i = 0; i < sinfo->nr_frags; i++) {
  344. struct page *page = skb_frag_page(&sinfo->frags[i]);
  345. __xdp_return(page_address(page), &xdpf->mem, false, NULL);
  346. }
  347. out:
  348. __xdp_return(xdpf->data, &xdpf->mem, false, NULL);
  349. }
  350. EXPORT_SYMBOL_GPL(xdp_return_frame);
  351. void xdp_return_frame_rx_napi(struct xdp_frame *xdpf)
  352. {
  353. struct skb_shared_info *sinfo;
  354. int i;
  355. if (likely(!xdp_frame_has_frags(xdpf)))
  356. goto out;
  357. sinfo = xdp_get_shared_info_from_frame(xdpf);
  358. for (i = 0; i < sinfo->nr_frags; i++) {
  359. struct page *page = skb_frag_page(&sinfo->frags[i]);
  360. __xdp_return(page_address(page), &xdpf->mem, true, NULL);
  361. }
  362. out:
  363. __xdp_return(xdpf->data, &xdpf->mem, true, NULL);
  364. }
  365. EXPORT_SYMBOL_GPL(xdp_return_frame_rx_napi);
  366. /* XDP bulk APIs introduce a defer/flush mechanism to return
  367. * pages belonging to the same xdp_mem_allocator object
  368. * (identified via the mem.id field) in bulk to optimize
  369. * I-cache and D-cache.
  370. * The bulk queue size is set to 16 to be aligned to how
  371. * XDP_REDIRECT bulking works. The bulk is flushed when
  372. * it is full or when mem.id changes.
  373. * xdp_frame_bulk is usually stored/allocated on the function
  374. * call-stack to avoid locking penalties.
  375. */
  376. void xdp_flush_frame_bulk(struct xdp_frame_bulk *bq)
  377. {
  378. struct xdp_mem_allocator *xa = bq->xa;
  379. if (unlikely(!xa || !bq->count))
  380. return;
  381. page_pool_put_page_bulk(xa->page_pool, bq->q, bq->count);
  382. /* bq->xa is not cleared to save lookup, if mem.id same in next bulk */
  383. bq->count = 0;
  384. }
  385. EXPORT_SYMBOL_GPL(xdp_flush_frame_bulk);
  386. /* Must be called with rcu_read_lock held */
  387. void xdp_return_frame_bulk(struct xdp_frame *xdpf,
  388. struct xdp_frame_bulk *bq)
  389. {
  390. struct xdp_mem_info *mem = &xdpf->mem;
  391. struct xdp_mem_allocator *xa;
  392. if (mem->type != MEM_TYPE_PAGE_POOL) {
  393. xdp_return_frame(xdpf);
  394. return;
  395. }
  396. xa = bq->xa;
  397. if (unlikely(!xa)) {
  398. xa = rhashtable_lookup(mem_id_ht, &mem->id, mem_id_rht_params);
  399. bq->count = 0;
  400. bq->xa = xa;
  401. }
  402. if (bq->count == XDP_BULK_QUEUE_SIZE)
  403. xdp_flush_frame_bulk(bq);
  404. if (unlikely(mem->id != xa->mem.id)) {
  405. xdp_flush_frame_bulk(bq);
  406. bq->xa = rhashtable_lookup(mem_id_ht, &mem->id, mem_id_rht_params);
  407. }
  408. if (unlikely(xdp_frame_has_frags(xdpf))) {
  409. struct skb_shared_info *sinfo;
  410. int i;
  411. sinfo = xdp_get_shared_info_from_frame(xdpf);
  412. for (i = 0; i < sinfo->nr_frags; i++) {
  413. skb_frag_t *frag = &sinfo->frags[i];
  414. bq->q[bq->count++] = skb_frag_address(frag);
  415. if (bq->count == XDP_BULK_QUEUE_SIZE)
  416. xdp_flush_frame_bulk(bq);
  417. }
  418. }
  419. bq->q[bq->count++] = xdpf->data;
  420. }
  421. EXPORT_SYMBOL_GPL(xdp_return_frame_bulk);
  422. void xdp_return_buff(struct xdp_buff *xdp)
  423. {
  424. struct skb_shared_info *sinfo;
  425. int i;
  426. if (likely(!xdp_buff_has_frags(xdp)))
  427. goto out;
  428. sinfo = xdp_get_shared_info_from_buff(xdp);
  429. for (i = 0; i < sinfo->nr_frags; i++) {
  430. struct page *page = skb_frag_page(&sinfo->frags[i]);
  431. __xdp_return(page_address(page), &xdp->rxq->mem, true, xdp);
  432. }
  433. out:
  434. __xdp_return(xdp->data, &xdp->rxq->mem, true, xdp);
  435. }
  436. EXPORT_SYMBOL_GPL(xdp_return_buff);
  437. /* Only called for MEM_TYPE_PAGE_POOL see xdp.h */
  438. void __xdp_release_frame(void *data, struct xdp_mem_info *mem)
  439. {
  440. struct xdp_mem_allocator *xa;
  441. struct page *page;
  442. rcu_read_lock();
  443. xa = rhashtable_lookup(mem_id_ht, &mem->id, mem_id_rht_params);
  444. page = virt_to_head_page(data);
  445. if (xa)
  446. page_pool_release_page(xa->page_pool, page);
  447. rcu_read_unlock();
  448. }
  449. EXPORT_SYMBOL_GPL(__xdp_release_frame);
  450. void xdp_attachment_setup(struct xdp_attachment_info *info,
  451. struct netdev_bpf *bpf)
  452. {
  453. if (info->prog)
  454. bpf_prog_put(info->prog);
  455. info->prog = bpf->prog;
  456. info->flags = bpf->flags;
  457. }
  458. EXPORT_SYMBOL_GPL(xdp_attachment_setup);
  459. struct xdp_frame *xdp_convert_zc_to_xdp_frame(struct xdp_buff *xdp)
  460. {
  461. unsigned int metasize, totsize;
  462. void *addr, *data_to_copy;
  463. struct xdp_frame *xdpf;
  464. struct page *page;
  465. /* Clone into a MEM_TYPE_PAGE_ORDER0 xdp_frame. */
  466. metasize = xdp_data_meta_unsupported(xdp) ? 0 :
  467. xdp->data - xdp->data_meta;
  468. totsize = xdp->data_end - xdp->data + metasize;
  469. if (sizeof(*xdpf) + totsize > PAGE_SIZE)
  470. return NULL;
  471. page = dev_alloc_page();
  472. if (!page)
  473. return NULL;
  474. addr = page_to_virt(page);
  475. xdpf = addr;
  476. memset(xdpf, 0, sizeof(*xdpf));
  477. addr += sizeof(*xdpf);
  478. data_to_copy = metasize ? xdp->data_meta : xdp->data;
  479. memcpy(addr, data_to_copy, totsize);
  480. xdpf->data = addr + metasize;
  481. xdpf->len = totsize - metasize;
  482. xdpf->headroom = 0;
  483. xdpf->metasize = metasize;
  484. xdpf->frame_sz = PAGE_SIZE;
  485. xdpf->mem.type = MEM_TYPE_PAGE_ORDER0;
  486. xsk_buff_free(xdp);
  487. return xdpf;
  488. }
  489. EXPORT_SYMBOL_GPL(xdp_convert_zc_to_xdp_frame);
  490. /* Used by XDP_WARN macro, to avoid inlining WARN() in fast-path */
  491. void xdp_warn(const char *msg, const char *func, const int line)
  492. {
  493. WARN(1, "XDP_WARN: %s(line:%d): %s\n", func, line, msg);
  494. };
  495. EXPORT_SYMBOL_GPL(xdp_warn);
  496. int xdp_alloc_skb_bulk(void **skbs, int n_skb, gfp_t gfp)
  497. {
  498. n_skb = kmem_cache_alloc_bulk(skbuff_head_cache, gfp,
  499. n_skb, skbs);
  500. if (unlikely(!n_skb))
  501. return -ENOMEM;
  502. return 0;
  503. }
  504. EXPORT_SYMBOL_GPL(xdp_alloc_skb_bulk);
  505. struct sk_buff *__xdp_build_skb_from_frame(struct xdp_frame *xdpf,
  506. struct sk_buff *skb,
  507. struct net_device *dev)
  508. {
  509. struct skb_shared_info *sinfo = xdp_get_shared_info_from_frame(xdpf);
  510. unsigned int headroom, frame_size;
  511. void *hard_start;
  512. u8 nr_frags;
  513. /* xdp frags frame */
  514. if (unlikely(xdp_frame_has_frags(xdpf)))
  515. nr_frags = sinfo->nr_frags;
  516. /* Part of headroom was reserved to xdpf */
  517. headroom = sizeof(*xdpf) + xdpf->headroom;
  518. /* Memory size backing xdp_frame data already have reserved
  519. * room for build_skb to place skb_shared_info in tailroom.
  520. */
  521. frame_size = xdpf->frame_sz;
  522. hard_start = xdpf->data - headroom;
  523. skb = build_skb_around(skb, hard_start, frame_size);
  524. if (unlikely(!skb))
  525. return NULL;
  526. skb_reserve(skb, headroom);
  527. __skb_put(skb, xdpf->len);
  528. if (xdpf->metasize)
  529. skb_metadata_set(skb, xdpf->metasize);
  530. if (unlikely(xdp_frame_has_frags(xdpf)))
  531. xdp_update_skb_shared_info(skb, nr_frags,
  532. sinfo->xdp_frags_size,
  533. nr_frags * xdpf->frame_sz,
  534. xdp_frame_is_frag_pfmemalloc(xdpf));
  535. /* Essential SKB info: protocol and skb->dev */
  536. skb->protocol = eth_type_trans(skb, dev);
  537. /* Optional SKB info, currently missing:
  538. * - HW checksum info (skb->ip_summed)
  539. * - HW RX hash (skb_set_hash)
  540. * - RX ring dev queue index (skb_record_rx_queue)
  541. */
  542. /* Until page_pool get SKB return path, release DMA here */
  543. xdp_release_frame(xdpf);
  544. /* Allow SKB to reuse area used by xdp_frame */
  545. xdp_scrub_frame(xdpf);
  546. return skb;
  547. }
  548. EXPORT_SYMBOL_GPL(__xdp_build_skb_from_frame);
  549. struct sk_buff *xdp_build_skb_from_frame(struct xdp_frame *xdpf,
  550. struct net_device *dev)
  551. {
  552. struct sk_buff *skb;
  553. skb = kmem_cache_alloc(skbuff_head_cache, GFP_ATOMIC);
  554. if (unlikely(!skb))
  555. return NULL;
  556. memset(skb, 0, offsetof(struct sk_buff, tail));
  557. return __xdp_build_skb_from_frame(xdpf, skb, dev);
  558. }
  559. EXPORT_SYMBOL_GPL(xdp_build_skb_from_frame);
  560. struct xdp_frame *xdpf_clone(struct xdp_frame *xdpf)
  561. {
  562. unsigned int headroom, totalsize;
  563. struct xdp_frame *nxdpf;
  564. struct page *page;
  565. void *addr;
  566. headroom = xdpf->headroom + sizeof(*xdpf);
  567. totalsize = headroom + xdpf->len;
  568. if (unlikely(totalsize > PAGE_SIZE))
  569. return NULL;
  570. page = dev_alloc_page();
  571. if (!page)
  572. return NULL;
  573. addr = page_to_virt(page);
  574. memcpy(addr, xdpf, totalsize);
  575. nxdpf = addr;
  576. nxdpf->data = addr + headroom;
  577. nxdpf->frame_sz = PAGE_SIZE;
  578. nxdpf->mem.type = MEM_TYPE_PAGE_ORDER0;
  579. nxdpf->mem.id = 0;
  580. return nxdpf;
  581. }