1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * Routines having to do with the 'struct sk_buff' memory handlers.
5 * Authors: Alan Cox <alan@lxorguk.ukuu.org.uk>
6 * Florian La Roche <rzsfl@rz.uni-sb.de>
9 * Alan Cox : Fixed the worst of the load
11 * Dave Platt : Interrupt stacking fix.
12 * Richard Kooijman : Timestamp fixes.
13 * Alan Cox : Changed buffer format.
14 * Alan Cox : destructor hook for AF_UNIX etc.
15 * Linus Torvalds : Better skb_clone.
16 * Alan Cox : Added skb_copy.
17 * Alan Cox : Added all the changed routines Linus
18 * only put in the headers
19 * Ray VanTassle : Fixed --skb->lock in free
20 * Alan Cox : skb_copy copy arp field
21 * Andi Kleen : slabified it.
22 * Robert Olsson : Removed skb_head_pool
25 * The __skb_ routines should be called with interrupts
26 * disabled, or you better be *real* sure that the operation is atomic
27 * with respect to whatever list is being frobbed (e.g. via lock_sock()
28 * or via disabling bottom half handlers, etc).
32 * The functions in this file will not compile correctly with gcc 2.4.x
35 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
37 #include <linux/module.h>
38 #include <linux/types.h>
39 #include <linux/kernel.h>
41 #include <linux/interrupt.h>
43 #include <linux/inet.h>
44 #include <linux/slab.h>
45 #include <linux/tcp.h>
46 #include <linux/udp.h>
47 #include <linux/sctp.h>
48 #include <linux/netdevice.h>
49 #ifdef CONFIG_NET_CLS_ACT
50 #include <net/pkt_sched.h>
52 #include <linux/string.h>
53 #include <linux/skbuff.h>
54 #include <linux/splice.h>
55 #include <linux/cache.h>
56 #include <linux/rtnetlink.h>
57 #include <linux/init.h>
58 #include <linux/scatterlist.h>
59 #include <linux/errqueue.h>
60 #include <linux/prefetch.h>
61 #include <linux/if_vlan.h>
62 #include <linux/mpls.h>
64 #include <net/protocol.h>
67 #include <net/checksum.h>
68 #include <net/ip6_checksum.h>
72 #include <linux/uaccess.h>
73 #include <trace/events/skb.h>
74 #include <linux/highmem.h>
75 #include <linux/capability.h>
76 #include <linux/user_namespace.h>
77 #include <linux/indirect_call_wrapper.h>
81 struct kmem_cache *skbuff_head_cache __ro_after_init;
82 static struct kmem_cache *skbuff_fclone_cache __ro_after_init;
83 #ifdef CONFIG_SKB_EXTENSIONS
84 static struct kmem_cache *skbuff_ext_cache __ro_after_init;
86 int sysctl_max_skb_frags __read_mostly = MAX_SKB_FRAGS;
87 EXPORT_SYMBOL(sysctl_max_skb_frags);
90 * skb_panic - private function for out-of-line support
94 * @msg: skb_over_panic or skb_under_panic
96 * Out-of-line support for skb_put() and skb_push().
97 * Called via the wrapper skb_over_panic() or skb_under_panic().
98 * Keep out of line to prevent kernel bloat.
99 * __builtin_return_address is not used because it is not always reliable.
101 static void skb_panic(struct sk_buff *skb, unsigned int sz, void *addr,
104 pr_emerg("%s: text:%p len:%d put:%d head:%p data:%p tail:%#lx end:%#lx dev:%s\n",
105 msg, addr, skb->len, sz, skb->head, skb->data,
106 (unsigned long)skb->tail, (unsigned long)skb->end,
107 skb->dev ? skb->dev->name : "<NULL>");
111 static void skb_over_panic(struct sk_buff *skb, unsigned int sz, void *addr)
113 skb_panic(skb, sz, addr, __func__);
116 static void skb_under_panic(struct sk_buff *skb, unsigned int sz, void *addr)
118 skb_panic(skb, sz, addr, __func__);
122 * kmalloc_reserve is a wrapper around kmalloc_node_track_caller that tells
123 * the caller if emergency pfmemalloc reserves are being used. If it is and
124 * the socket is later found to be SOCK_MEMALLOC then PFMEMALLOC reserves
125 * may be used. Otherwise, the packet data may be discarded until enough
128 #define kmalloc_reserve(size, gfp, node, pfmemalloc) \
129 __kmalloc_reserve(size, gfp, node, _RET_IP_, pfmemalloc)
131 static void *__kmalloc_reserve(size_t size, gfp_t flags, int node,
132 unsigned long ip, bool *pfmemalloc)
135 bool ret_pfmemalloc = false;
138 * Try a regular allocation, when that fails and we're not entitled
139 * to the reserves, fail.
141 obj = kmalloc_node_track_caller(size,
142 flags | __GFP_NOMEMALLOC | __GFP_NOWARN,
144 if (obj || !(gfp_pfmemalloc_allowed(flags)))
147 /* Try again but now we are using pfmemalloc reserves */
148 ret_pfmemalloc = true;
149 obj = kmalloc_node_track_caller(size, flags, node);
153 *pfmemalloc = ret_pfmemalloc;
158 /* Allocate a new skbuff. We do this ourselves so we can fill in a few
159 * 'private' fields and also do memory statistics to find all the
165 * __alloc_skb - allocate a network buffer
166 * @size: size to allocate
167 * @gfp_mask: allocation mask
168 * @flags: If SKB_ALLOC_FCLONE is set, allocate from fclone cache
169 * instead of head cache and allocate a cloned (child) skb.
170 * If SKB_ALLOC_RX is set, __GFP_MEMALLOC will be used for
171 * allocations in case the data is required for writeback
172 * @node: numa node to allocate memory on
174 * Allocate a new &sk_buff. The returned buffer has no headroom and a
175 * tail room of at least size bytes. The object has a reference count
176 * of one. The return is the buffer. On a failure the return is %NULL.
178 * Buffers may only be allocated from interrupts using a @gfp_mask of
181 struct sk_buff *__alloc_skb(unsigned int size, gfp_t gfp_mask,
184 struct kmem_cache *cache;
185 struct skb_shared_info *shinfo;
190 cache = (flags & SKB_ALLOC_FCLONE)
191 ? skbuff_fclone_cache : skbuff_head_cache;
193 if (sk_memalloc_socks() && (flags & SKB_ALLOC_RX))
194 gfp_mask |= __GFP_MEMALLOC;
197 skb = kmem_cache_alloc_node(cache, gfp_mask & ~__GFP_DMA, node);
202 /* We do our best to align skb_shared_info on a separate cache
203 * line. It usually works because kmalloc(X > SMP_CACHE_BYTES) gives
204 * aligned memory blocks, unless SLUB/SLAB debug is enabled.
205 * Both skb->head and skb_shared_info are cache line aligned.
207 size = SKB_DATA_ALIGN(size);
208 size += SKB_DATA_ALIGN(sizeof(struct skb_shared_info));
209 data = kmalloc_reserve(size, gfp_mask, node, &pfmemalloc);
212 /* kmalloc(size) might give us more room than requested.
213 * Put skb_shared_info exactly at the end of allocated zone,
214 * to allow max possible filling before reallocation.
216 size = SKB_WITH_OVERHEAD(ksize(data));
217 prefetchw(data + size);
220 * Only clear those fields we need to clear, not those that we will
221 * actually initialise below. Hence, don't put any more fields after
222 * the tail pointer in struct sk_buff!
224 memset(skb, 0, offsetof(struct sk_buff, tail));
225 /* Account for allocated memory : skb + skb->head */
226 skb->truesize = SKB_TRUESIZE(size);
227 skb->pfmemalloc = pfmemalloc;
228 refcount_set(&skb->users, 1);
231 skb_reset_tail_pointer(skb);
232 skb->end = skb->tail + size;
233 skb->mac_header = (typeof(skb->mac_header))~0U;
234 skb->transport_header = (typeof(skb->transport_header))~0U;
236 /* make sure we initialize shinfo sequentially */
237 shinfo = skb_shinfo(skb);
238 memset(shinfo, 0, offsetof(struct skb_shared_info, dataref));
239 atomic_set(&shinfo->dataref, 1);
241 if (flags & SKB_ALLOC_FCLONE) {
242 struct sk_buff_fclones *fclones;
244 fclones = container_of(skb, struct sk_buff_fclones, skb1);
246 skb->fclone = SKB_FCLONE_ORIG;
247 refcount_set(&fclones->fclone_ref, 1);
249 fclones->skb2.fclone = SKB_FCLONE_CLONE;
254 kmem_cache_free(cache, skb);
258 EXPORT_SYMBOL(__alloc_skb);
260 /* Caller must provide SKB that is memset cleared */
261 static struct sk_buff *__build_skb_around(struct sk_buff *skb,
262 void *data, unsigned int frag_size)
264 struct skb_shared_info *shinfo;
265 unsigned int size = frag_size ? : ksize(data);
267 size -= SKB_DATA_ALIGN(sizeof(struct skb_shared_info));
269 /* Assumes caller memset cleared SKB */
270 skb->truesize = SKB_TRUESIZE(size);
271 refcount_set(&skb->users, 1);
274 skb_reset_tail_pointer(skb);
275 skb->end = skb->tail + size;
276 skb->mac_header = (typeof(skb->mac_header))~0U;
277 skb->transport_header = (typeof(skb->transport_header))~0U;
279 /* make sure we initialize shinfo sequentially */
280 shinfo = skb_shinfo(skb);
281 memset(shinfo, 0, offsetof(struct skb_shared_info, dataref));
282 atomic_set(&shinfo->dataref, 1);
288 * __build_skb - build a network buffer
289 * @data: data buffer provided by caller
290 * @frag_size: size of data, or 0 if head was kmalloced
292 * Allocate a new &sk_buff. Caller provides space holding head and
293 * skb_shared_info. @data must have been allocated by kmalloc() only if
294 * @frag_size is 0, otherwise data should come from the page allocator
296 * The return is the new skb buffer.
297 * On a failure the return is %NULL, and @data is not freed.
299 * Before IO, driver allocates only data buffer where NIC put incoming frame
300 * Driver should add room at head (NET_SKB_PAD) and
301 * MUST add room at tail (SKB_DATA_ALIGN(skb_shared_info))
302 * After IO, driver calls build_skb(), to allocate sk_buff and populate it
303 * before giving packet to stack.
304 * RX rings only contains data buffers, not full skbs.
306 struct sk_buff *__build_skb(void *data, unsigned int frag_size)
310 skb = kmem_cache_alloc(skbuff_head_cache, GFP_ATOMIC);
314 memset(skb, 0, offsetof(struct sk_buff, tail));
316 return __build_skb_around(skb, data, frag_size);
319 /* build_skb() is wrapper over __build_skb(), that specifically
320 * takes care of skb->head and skb->pfmemalloc
321 * This means that if @frag_size is not zero, then @data must be backed
322 * by a page fragment, not kmalloc() or vmalloc()
324 struct sk_buff *build_skb(void *data, unsigned int frag_size)
326 struct sk_buff *skb = __build_skb(data, frag_size);
328 if (skb && frag_size) {
330 if (page_is_pfmemalloc(virt_to_head_page(data)))
335 EXPORT_SYMBOL(build_skb);
338 * build_skb_around - build a network buffer around provided skb
339 * @skb: sk_buff provide by caller, must be memset cleared
340 * @data: data buffer provided by caller
341 * @frag_size: size of data, or 0 if head was kmalloced
343 struct sk_buff *build_skb_around(struct sk_buff *skb,
344 void *data, unsigned int frag_size)
349 skb = __build_skb_around(skb, data, frag_size);
351 if (skb && frag_size) {
353 if (page_is_pfmemalloc(virt_to_head_page(data)))
358 EXPORT_SYMBOL(build_skb_around);
360 #define NAPI_SKB_CACHE_SIZE 64
362 struct napi_alloc_cache {
363 struct page_frag_cache page;
364 unsigned int skb_count;
365 void *skb_cache[NAPI_SKB_CACHE_SIZE];
368 static DEFINE_PER_CPU(struct page_frag_cache, netdev_alloc_cache);
369 static DEFINE_PER_CPU(struct napi_alloc_cache, napi_alloc_cache);
371 static void *__napi_alloc_frag(unsigned int fragsz, gfp_t gfp_mask)
373 struct napi_alloc_cache *nc = this_cpu_ptr(&napi_alloc_cache);
375 return page_frag_alloc(&nc->page, fragsz, gfp_mask);
378 void *napi_alloc_frag(unsigned int fragsz)
380 fragsz = SKB_DATA_ALIGN(fragsz);
382 return __napi_alloc_frag(fragsz, GFP_ATOMIC);
384 EXPORT_SYMBOL(napi_alloc_frag);
387 * netdev_alloc_frag - allocate a page fragment
388 * @fragsz: fragment size
390 * Allocates a frag from a page for receive buffer.
391 * Uses GFP_ATOMIC allocations.
393 void *netdev_alloc_frag(unsigned int fragsz)
395 struct page_frag_cache *nc;
398 fragsz = SKB_DATA_ALIGN(fragsz);
399 if (in_irq() || irqs_disabled()) {
400 nc = this_cpu_ptr(&netdev_alloc_cache);
401 data = page_frag_alloc(nc, fragsz, GFP_ATOMIC);
404 data = __napi_alloc_frag(fragsz, GFP_ATOMIC);
409 EXPORT_SYMBOL(netdev_alloc_frag);
412 * __netdev_alloc_skb - allocate an skbuff for rx on a specific device
413 * @dev: network device to receive on
414 * @len: length to allocate
415 * @gfp_mask: get_free_pages mask, passed to alloc_skb
417 * Allocate a new &sk_buff and assign it a usage count of one. The
418 * buffer has NET_SKB_PAD headroom built in. Users should allocate
419 * the headroom they think they need without accounting for the
420 * built in space. The built in space is used for optimisations.
422 * %NULL is returned if there is no free memory.
424 struct sk_buff *__netdev_alloc_skb(struct net_device *dev, unsigned int len,
427 struct page_frag_cache *nc;
434 /* If requested length is either too small or too big,
435 * we use kmalloc() for skb->head allocation.
437 if (len <= SKB_WITH_OVERHEAD(1024) ||
438 len > SKB_WITH_OVERHEAD(PAGE_SIZE) ||
439 (gfp_mask & (__GFP_DIRECT_RECLAIM | GFP_DMA))) {
440 skb = __alloc_skb(len, gfp_mask, SKB_ALLOC_RX, NUMA_NO_NODE);
446 len += SKB_DATA_ALIGN(sizeof(struct skb_shared_info));
447 len = SKB_DATA_ALIGN(len);
449 if (sk_memalloc_socks())
450 gfp_mask |= __GFP_MEMALLOC;
452 if (in_irq() || irqs_disabled()) {
453 nc = this_cpu_ptr(&netdev_alloc_cache);
454 data = page_frag_alloc(nc, len, gfp_mask);
455 pfmemalloc = nc->pfmemalloc;
458 nc = this_cpu_ptr(&napi_alloc_cache.page);
459 data = page_frag_alloc(nc, len, gfp_mask);
460 pfmemalloc = nc->pfmemalloc;
467 skb = __build_skb(data, len);
468 if (unlikely(!skb)) {
473 /* use OR instead of assignment to avoid clearing of bits in mask */
479 skb_reserve(skb, NET_SKB_PAD);
485 EXPORT_SYMBOL(__netdev_alloc_skb);
488 * __napi_alloc_skb - allocate skbuff for rx in a specific NAPI instance
489 * @napi: napi instance this buffer was allocated for
490 * @len: length to allocate
491 * @gfp_mask: get_free_pages mask, passed to alloc_skb and alloc_pages
493 * Allocate a new sk_buff for use in NAPI receive. This buffer will
494 * attempt to allocate the head from a special reserved region used
495 * only for NAPI Rx allocation. By doing this we can save several
496 * CPU cycles by avoiding having to disable and re-enable IRQs.
498 * %NULL is returned if there is no free memory.
500 struct sk_buff *__napi_alloc_skb(struct napi_struct *napi, unsigned int len,
503 struct napi_alloc_cache *nc;
507 len += NET_SKB_PAD + NET_IP_ALIGN;
509 /* If requested length is either too small or too big,
510 * we use kmalloc() for skb->head allocation.
512 if (len <= SKB_WITH_OVERHEAD(1024) ||
513 len > SKB_WITH_OVERHEAD(PAGE_SIZE) ||
514 (gfp_mask & (__GFP_DIRECT_RECLAIM | GFP_DMA))) {
515 skb = __alloc_skb(len, gfp_mask, SKB_ALLOC_RX, NUMA_NO_NODE);
521 nc = this_cpu_ptr(&napi_alloc_cache);
522 len += SKB_DATA_ALIGN(sizeof(struct skb_shared_info));
523 len = SKB_DATA_ALIGN(len);
525 if (sk_memalloc_socks())
526 gfp_mask |= __GFP_MEMALLOC;
528 data = page_frag_alloc(&nc->page, len, gfp_mask);
532 skb = __build_skb(data, len);
533 if (unlikely(!skb)) {
538 /* use OR instead of assignment to avoid clearing of bits in mask */
539 if (nc->page.pfmemalloc)
544 skb_reserve(skb, NET_SKB_PAD + NET_IP_ALIGN);
545 skb->dev = napi->dev;
550 EXPORT_SYMBOL(__napi_alloc_skb);
552 void skb_add_rx_frag(struct sk_buff *skb, int i, struct page *page, int off,
553 int size, unsigned int truesize)
555 skb_fill_page_desc(skb, i, page, off, size);
557 skb->data_len += size;
558 skb->truesize += truesize;
560 EXPORT_SYMBOL(skb_add_rx_frag);
562 void skb_coalesce_rx_frag(struct sk_buff *skb, int i, int size,
563 unsigned int truesize)
565 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
567 skb_frag_size_add(frag, size);
569 skb->data_len += size;
570 skb->truesize += truesize;
572 EXPORT_SYMBOL(skb_coalesce_rx_frag);
574 static void skb_drop_list(struct sk_buff **listp)
576 kfree_skb_list(*listp);
580 static inline void skb_drop_fraglist(struct sk_buff *skb)
582 skb_drop_list(&skb_shinfo(skb)->frag_list);
585 static void skb_clone_fraglist(struct sk_buff *skb)
587 struct sk_buff *list;
589 skb_walk_frags(skb, list)
593 static void skb_free_head(struct sk_buff *skb)
595 unsigned char *head = skb->head;
603 static void skb_release_data(struct sk_buff *skb)
605 struct skb_shared_info *shinfo = skb_shinfo(skb);
609 atomic_sub_return(skb->nohdr ? (1 << SKB_DATAREF_SHIFT) + 1 : 1,
613 for (i = 0; i < shinfo->nr_frags; i++)
614 __skb_frag_unref(&shinfo->frags[i]);
616 if (shinfo->frag_list)
617 kfree_skb_list(shinfo->frag_list);
619 skb_zcopy_clear(skb, true);
624 * Free an skbuff by memory without cleaning the state.
626 static void kfree_skbmem(struct sk_buff *skb)
628 struct sk_buff_fclones *fclones;
630 switch (skb->fclone) {
631 case SKB_FCLONE_UNAVAILABLE:
632 kmem_cache_free(skbuff_head_cache, skb);
635 case SKB_FCLONE_ORIG:
636 fclones = container_of(skb, struct sk_buff_fclones, skb1);
638 /* We usually free the clone (TX completion) before original skb
639 * This test would have no chance to be true for the clone,
640 * while here, branch prediction will be good.
642 if (refcount_read(&fclones->fclone_ref) == 1)
646 default: /* SKB_FCLONE_CLONE */
647 fclones = container_of(skb, struct sk_buff_fclones, skb2);
650 if (!refcount_dec_and_test(&fclones->fclone_ref))
653 kmem_cache_free(skbuff_fclone_cache, fclones);
656 void skb_release_head_state(struct sk_buff *skb)
659 if (skb->destructor) {
661 skb->destructor(skb);
663 #if IS_ENABLED(CONFIG_NF_CONNTRACK)
664 nf_conntrack_put(skb_nfct(skb));
669 /* Free everything but the sk_buff shell. */
670 static void skb_release_all(struct sk_buff *skb)
672 skb_release_head_state(skb);
673 if (likely(skb->head))
674 skb_release_data(skb);
678 * __kfree_skb - private function
681 * Free an sk_buff. Release anything attached to the buffer.
682 * Clean the state. This is an internal helper function. Users should
683 * always call kfree_skb
686 void __kfree_skb(struct sk_buff *skb)
688 skb_release_all(skb);
691 EXPORT_SYMBOL(__kfree_skb);
694 * kfree_skb - free an sk_buff
695 * @skb: buffer to free
697 * Drop a reference to the buffer and free it if the usage count has
700 void kfree_skb(struct sk_buff *skb)
705 trace_kfree_skb(skb, __builtin_return_address(0));
708 EXPORT_SYMBOL(kfree_skb);
710 void kfree_skb_list(struct sk_buff *segs)
713 struct sk_buff *next = segs->next;
719 EXPORT_SYMBOL(kfree_skb_list);
721 /* Dump skb information and contents.
723 * Must only be called from net_ratelimit()-ed paths.
725 * Dumps up to can_dump_full whole packets if full_pkt, headers otherwise.
727 void skb_dump(const char *level, const struct sk_buff *skb, bool full_pkt)
729 static atomic_t can_dump_full = ATOMIC_INIT(5);
730 struct skb_shared_info *sh = skb_shinfo(skb);
731 struct net_device *dev = skb->dev;
732 struct sock *sk = skb->sk;
733 struct sk_buff *list_skb;
734 bool has_mac, has_trans;
735 int headroom, tailroom;
739 full_pkt = atomic_dec_if_positive(&can_dump_full) >= 0;
744 len = min_t(int, skb->len, MAX_HEADER + 128);
746 headroom = skb_headroom(skb);
747 tailroom = skb_tailroom(skb);
749 has_mac = skb_mac_header_was_set(skb);
750 has_trans = skb_transport_header_was_set(skb);
752 printk("%sskb len=%u headroom=%u headlen=%u tailroom=%u\n"
753 "mac=(%d,%d) net=(%d,%d) trans=%d\n"
754 "shinfo(txflags=%u nr_frags=%u gso(size=%hu type=%u segs=%hu))\n"
755 "csum(0x%x ip_summed=%u complete_sw=%u valid=%u level=%u)\n"
756 "hash(0x%x sw=%u l4=%u) proto=0x%04x pkttype=%u iif=%d\n",
757 level, skb->len, headroom, skb_headlen(skb), tailroom,
758 has_mac ? skb->mac_header : -1,
759 has_mac ? skb_mac_header_len(skb) : -1,
761 has_trans ? skb_network_header_len(skb) : -1,
762 has_trans ? skb->transport_header : -1,
763 sh->tx_flags, sh->nr_frags,
764 sh->gso_size, sh->gso_type, sh->gso_segs,
765 skb->csum, skb->ip_summed, skb->csum_complete_sw,
766 skb->csum_valid, skb->csum_level,
767 skb->hash, skb->sw_hash, skb->l4_hash,
768 ntohs(skb->protocol), skb->pkt_type, skb->skb_iif);
771 printk("%sdev name=%s feat=%pNF\n",
772 level, dev->name, &dev->features);
774 printk("%ssk family=%hu type=%u proto=%u\n",
775 level, sk->sk_family, sk->sk_type, sk->sk_protocol);
777 if (full_pkt && headroom)
778 print_hex_dump(level, "skb headroom: ", DUMP_PREFIX_OFFSET,
779 16, 1, skb->head, headroom, false);
781 seg_len = min_t(int, skb_headlen(skb), len);
783 print_hex_dump(level, "skb linear: ", DUMP_PREFIX_OFFSET,
784 16, 1, skb->data, seg_len, false);
787 if (full_pkt && tailroom)
788 print_hex_dump(level, "skb tailroom: ", DUMP_PREFIX_OFFSET,
789 16, 1, skb_tail_pointer(skb), tailroom, false);
791 for (i = 0; len && i < skb_shinfo(skb)->nr_frags; i++) {
792 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
793 u32 p_off, p_len, copied;
797 skb_frag_foreach_page(frag, skb_frag_off(frag),
798 skb_frag_size(frag), p, p_off, p_len,
800 seg_len = min_t(int, p_len, len);
801 vaddr = kmap_atomic(p);
802 print_hex_dump(level, "skb frag: ",
804 16, 1, vaddr + p_off, seg_len, false);
805 kunmap_atomic(vaddr);
812 if (full_pkt && skb_has_frag_list(skb)) {
813 printk("skb fraglist:\n");
814 skb_walk_frags(skb, list_skb)
815 skb_dump(level, list_skb, true);
818 EXPORT_SYMBOL(skb_dump);
821 * skb_tx_error - report an sk_buff xmit error
822 * @skb: buffer that triggered an error
824 * Report xmit error if a device callback is tracking this skb.
825 * skb must be freed afterwards.
827 void skb_tx_error(struct sk_buff *skb)
829 skb_zcopy_clear(skb, true);
831 EXPORT_SYMBOL(skb_tx_error);
834 * consume_skb - free an skbuff
835 * @skb: buffer to free
837 * Drop a ref to the buffer and free it if the usage count has hit zero
838 * Functions identically to kfree_skb, but kfree_skb assumes that the frame
839 * is being dropped after a failure and notes that
841 void consume_skb(struct sk_buff *skb)
846 trace_consume_skb(skb);
849 EXPORT_SYMBOL(consume_skb);
852 * consume_stateless_skb - free an skbuff, assuming it is stateless
853 * @skb: buffer to free
855 * Alike consume_skb(), but this variant assumes that this is the last
856 * skb reference and all the head states have been already dropped
858 void __consume_stateless_skb(struct sk_buff *skb)
860 trace_consume_skb(skb);
861 skb_release_data(skb);
865 void __kfree_skb_flush(void)
867 struct napi_alloc_cache *nc = this_cpu_ptr(&napi_alloc_cache);
869 /* flush skb_cache if containing objects */
871 kmem_cache_free_bulk(skbuff_head_cache, nc->skb_count,
877 static inline void _kfree_skb_defer(struct sk_buff *skb)
879 struct napi_alloc_cache *nc = this_cpu_ptr(&napi_alloc_cache);
881 /* drop skb->head and call any destructors for packet */
882 skb_release_all(skb);
884 /* record skb to CPU local list */
885 nc->skb_cache[nc->skb_count++] = skb;
888 /* SLUB writes into objects when freeing */
892 /* flush skb_cache if it is filled */
893 if (unlikely(nc->skb_count == NAPI_SKB_CACHE_SIZE)) {
894 kmem_cache_free_bulk(skbuff_head_cache, NAPI_SKB_CACHE_SIZE,
899 void __kfree_skb_defer(struct sk_buff *skb)
901 _kfree_skb_defer(skb);
904 void napi_consume_skb(struct sk_buff *skb, int budget)
909 /* Zero budget indicate non-NAPI context called us, like netpoll */
910 if (unlikely(!budget)) {
911 dev_consume_skb_any(skb);
918 /* if reaching here SKB is ready to free */
919 trace_consume_skb(skb);
921 /* if SKB is a clone, don't handle this case */
922 if (skb->fclone != SKB_FCLONE_UNAVAILABLE) {
927 _kfree_skb_defer(skb);
929 EXPORT_SYMBOL(napi_consume_skb);
931 /* Make sure a field is enclosed inside headers_start/headers_end section */
932 #define CHECK_SKB_FIELD(field) \
933 BUILD_BUG_ON(offsetof(struct sk_buff, field) < \
934 offsetof(struct sk_buff, headers_start)); \
935 BUILD_BUG_ON(offsetof(struct sk_buff, field) > \
936 offsetof(struct sk_buff, headers_end)); \
938 static void __copy_skb_header(struct sk_buff *new, const struct sk_buff *old)
940 new->tstamp = old->tstamp;
941 /* We do not copy old->sk */
943 memcpy(new->cb, old->cb, sizeof(old->cb));
944 skb_dst_copy(new, old);
945 __skb_ext_copy(new, old);
946 __nf_copy(new, old, false);
948 /* Note : this field could be in headers_start/headers_end section
949 * It is not yet because we do not want to have a 16 bit hole
951 new->queue_mapping = old->queue_mapping;
953 memcpy(&new->headers_start, &old->headers_start,
954 offsetof(struct sk_buff, headers_end) -
955 offsetof(struct sk_buff, headers_start));
956 CHECK_SKB_FIELD(protocol);
957 CHECK_SKB_FIELD(csum);
958 CHECK_SKB_FIELD(hash);
959 CHECK_SKB_FIELD(priority);
960 CHECK_SKB_FIELD(skb_iif);
961 CHECK_SKB_FIELD(vlan_proto);
962 CHECK_SKB_FIELD(vlan_tci);
963 CHECK_SKB_FIELD(transport_header);
964 CHECK_SKB_FIELD(network_header);
965 CHECK_SKB_FIELD(mac_header);
966 CHECK_SKB_FIELD(inner_protocol);
967 CHECK_SKB_FIELD(inner_transport_header);
968 CHECK_SKB_FIELD(inner_network_header);
969 CHECK_SKB_FIELD(inner_mac_header);
970 CHECK_SKB_FIELD(mark);
971 #ifdef CONFIG_NETWORK_SECMARK
972 CHECK_SKB_FIELD(secmark);
974 #ifdef CONFIG_NET_RX_BUSY_POLL
975 CHECK_SKB_FIELD(napi_id);
978 CHECK_SKB_FIELD(sender_cpu);
980 #ifdef CONFIG_NET_SCHED
981 CHECK_SKB_FIELD(tc_index);
987 * You should not add any new code to this function. Add it to
988 * __copy_skb_header above instead.
990 static struct sk_buff *__skb_clone(struct sk_buff *n, struct sk_buff *skb)
992 #define C(x) n->x = skb->x
994 n->next = n->prev = NULL;
996 __copy_skb_header(n, skb);
1001 n->hdr_len = skb->nohdr ? skb_headroom(skb) : skb->hdr_len;
1006 n->destructor = NULL;
1013 refcount_set(&n->users, 1);
1015 atomic_inc(&(skb_shinfo(skb)->dataref));
1023 * alloc_skb_for_msg() - allocate sk_buff to wrap frag list forming a msg
1024 * @first: first sk_buff of the msg
1026 struct sk_buff *alloc_skb_for_msg(struct sk_buff *first)
1030 n = alloc_skb(0, GFP_ATOMIC);
1034 n->len = first->len;
1035 n->data_len = first->len;
1036 n->truesize = first->truesize;
1038 skb_shinfo(n)->frag_list = first;
1040 __copy_skb_header(n, first);
1041 n->destructor = NULL;
1045 EXPORT_SYMBOL_GPL(alloc_skb_for_msg);
1048 * skb_morph - morph one skb into another
1049 * @dst: the skb to receive the contents
1050 * @src: the skb to supply the contents
1052 * This is identical to skb_clone except that the target skb is
1053 * supplied by the user.
1055 * The target skb is returned upon exit.
1057 struct sk_buff *skb_morph(struct sk_buff *dst, struct sk_buff *src)
1059 skb_release_all(dst);
1060 return __skb_clone(dst, src);
1062 EXPORT_SYMBOL_GPL(skb_morph);
1064 int mm_account_pinned_pages(struct mmpin *mmp, size_t size)
1066 unsigned long max_pg, num_pg, new_pg, old_pg;
1067 struct user_struct *user;
1069 if (capable(CAP_IPC_LOCK) || !size)
1072 num_pg = (size >> PAGE_SHIFT) + 2; /* worst case */
1073 max_pg = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
1074 user = mmp->user ? : current_user();
1077 old_pg = atomic_long_read(&user->locked_vm);
1078 new_pg = old_pg + num_pg;
1079 if (new_pg > max_pg)
1081 } while (atomic_long_cmpxchg(&user->locked_vm, old_pg, new_pg) !=
1085 mmp->user = get_uid(user);
1086 mmp->num_pg = num_pg;
1088 mmp->num_pg += num_pg;
1093 EXPORT_SYMBOL_GPL(mm_account_pinned_pages);
1095 void mm_unaccount_pinned_pages(struct mmpin *mmp)
1098 atomic_long_sub(mmp->num_pg, &mmp->user->locked_vm);
1099 free_uid(mmp->user);
1102 EXPORT_SYMBOL_GPL(mm_unaccount_pinned_pages);
1104 struct ubuf_info *sock_zerocopy_alloc(struct sock *sk, size_t size)
1106 struct ubuf_info *uarg;
1107 struct sk_buff *skb;
1109 WARN_ON_ONCE(!in_task());
1111 skb = sock_omalloc(sk, 0, GFP_KERNEL);
1115 BUILD_BUG_ON(sizeof(*uarg) > sizeof(skb->cb));
1116 uarg = (void *)skb->cb;
1117 uarg->mmp.user = NULL;
1119 if (mm_account_pinned_pages(&uarg->mmp, size)) {
1124 uarg->callback = sock_zerocopy_callback;
1125 uarg->id = ((u32)atomic_inc_return(&sk->sk_zckey)) - 1;
1127 uarg->bytelen = size;
1129 refcount_set(&uarg->refcnt, 1);
1134 EXPORT_SYMBOL_GPL(sock_zerocopy_alloc);
1136 static inline struct sk_buff *skb_from_uarg(struct ubuf_info *uarg)
1138 return container_of((void *)uarg, struct sk_buff, cb);
1141 struct ubuf_info *sock_zerocopy_realloc(struct sock *sk, size_t size,
1142 struct ubuf_info *uarg)
1145 const u32 byte_limit = 1 << 19; /* limit to a few TSO */
1148 /* realloc only when socket is locked (TCP, UDP cork),
1149 * so uarg->len and sk_zckey access is serialized
1151 if (!sock_owned_by_user(sk)) {
1156 bytelen = uarg->bytelen + size;
1157 if (uarg->len == USHRT_MAX - 1 || bytelen > byte_limit) {
1158 /* TCP can create new skb to attach new uarg */
1159 if (sk->sk_type == SOCK_STREAM)
1164 next = (u32)atomic_read(&sk->sk_zckey);
1165 if ((u32)(uarg->id + uarg->len) == next) {
1166 if (mm_account_pinned_pages(&uarg->mmp, size))
1169 uarg->bytelen = bytelen;
1170 atomic_set(&sk->sk_zckey, ++next);
1172 /* no extra ref when appending to datagram (MSG_MORE) */
1173 if (sk->sk_type == SOCK_STREAM)
1174 sock_zerocopy_get(uarg);
1181 return sock_zerocopy_alloc(sk, size);
1183 EXPORT_SYMBOL_GPL(sock_zerocopy_realloc);
1185 static bool skb_zerocopy_notify_extend(struct sk_buff *skb, u32 lo, u16 len)
1187 struct sock_exterr_skb *serr = SKB_EXT_ERR(skb);
1191 old_lo = serr->ee.ee_info;
1192 old_hi = serr->ee.ee_data;
1193 sum_len = old_hi - old_lo + 1ULL + len;
1195 if (sum_len >= (1ULL << 32))
1198 if (lo != old_hi + 1)
1201 serr->ee.ee_data += len;
1205 void sock_zerocopy_callback(struct ubuf_info *uarg, bool success)
1207 struct sk_buff *tail, *skb = skb_from_uarg(uarg);
1208 struct sock_exterr_skb *serr;
1209 struct sock *sk = skb->sk;
1210 struct sk_buff_head *q;
1211 unsigned long flags;
1215 mm_unaccount_pinned_pages(&uarg->mmp);
1217 /* if !len, there was only 1 call, and it was aborted
1218 * so do not queue a completion notification
1220 if (!uarg->len || sock_flag(sk, SOCK_DEAD))
1225 hi = uarg->id + len - 1;
1227 serr = SKB_EXT_ERR(skb);
1228 memset(serr, 0, sizeof(*serr));
1229 serr->ee.ee_errno = 0;
1230 serr->ee.ee_origin = SO_EE_ORIGIN_ZEROCOPY;
1231 serr->ee.ee_data = hi;
1232 serr->ee.ee_info = lo;
1234 serr->ee.ee_code |= SO_EE_CODE_ZEROCOPY_COPIED;
1236 q = &sk->sk_error_queue;
1237 spin_lock_irqsave(&q->lock, flags);
1238 tail = skb_peek_tail(q);
1239 if (!tail || SKB_EXT_ERR(tail)->ee.ee_origin != SO_EE_ORIGIN_ZEROCOPY ||
1240 !skb_zerocopy_notify_extend(tail, lo, len)) {
1241 __skb_queue_tail(q, skb);
1244 spin_unlock_irqrestore(&q->lock, flags);
1246 sk->sk_error_report(sk);
1252 EXPORT_SYMBOL_GPL(sock_zerocopy_callback);
1254 void sock_zerocopy_put(struct ubuf_info *uarg)
1256 if (uarg && refcount_dec_and_test(&uarg->refcnt)) {
1258 uarg->callback(uarg, uarg->zerocopy);
1260 consume_skb(skb_from_uarg(uarg));
1263 EXPORT_SYMBOL_GPL(sock_zerocopy_put);
1265 void sock_zerocopy_put_abort(struct ubuf_info *uarg, bool have_uref)
1268 struct sock *sk = skb_from_uarg(uarg)->sk;
1270 atomic_dec(&sk->sk_zckey);
1274 sock_zerocopy_put(uarg);
1277 EXPORT_SYMBOL_GPL(sock_zerocopy_put_abort);
1279 int skb_zerocopy_iter_dgram(struct sk_buff *skb, struct msghdr *msg, int len)
1281 return __zerocopy_sg_from_iter(skb->sk, skb, &msg->msg_iter, len);
1283 EXPORT_SYMBOL_GPL(skb_zerocopy_iter_dgram);
1285 int skb_zerocopy_iter_stream(struct sock *sk, struct sk_buff *skb,
1286 struct msghdr *msg, int len,
1287 struct ubuf_info *uarg)
1289 struct ubuf_info *orig_uarg = skb_zcopy(skb);
1290 struct iov_iter orig_iter = msg->msg_iter;
1291 int err, orig_len = skb->len;
1293 /* An skb can only point to one uarg. This edge case happens when
1294 * TCP appends to an skb, but zerocopy_realloc triggered a new alloc.
1296 if (orig_uarg && uarg != orig_uarg)
1299 err = __zerocopy_sg_from_iter(sk, skb, &msg->msg_iter, len);
1300 if (err == -EFAULT || (err == -EMSGSIZE && skb->len == orig_len)) {
1301 struct sock *save_sk = skb->sk;
1303 /* Streams do not free skb on error. Reset to prev state. */
1304 msg->msg_iter = orig_iter;
1306 ___pskb_trim(skb, orig_len);
1311 skb_zcopy_set(skb, uarg, NULL);
1312 return skb->len - orig_len;
1314 EXPORT_SYMBOL_GPL(skb_zerocopy_iter_stream);
1316 static int skb_zerocopy_clone(struct sk_buff *nskb, struct sk_buff *orig,
1319 if (skb_zcopy(orig)) {
1320 if (skb_zcopy(nskb)) {
1321 /* !gfp_mask callers are verified to !skb_zcopy(nskb) */
1326 if (skb_uarg(nskb) == skb_uarg(orig))
1328 if (skb_copy_ubufs(nskb, GFP_ATOMIC))
1331 skb_zcopy_set(nskb, skb_uarg(orig), NULL);
1337 * skb_copy_ubufs - copy userspace skb frags buffers to kernel
1338 * @skb: the skb to modify
1339 * @gfp_mask: allocation priority
1341 * This must be called on SKBTX_DEV_ZEROCOPY skb.
1342 * It will copy all frags into kernel and drop the reference
1343 * to userspace pages.
1345 * If this function is called from an interrupt gfp_mask() must be
1348 * Returns 0 on success or a negative error code on failure
1349 * to allocate kernel memory to copy to.
1351 int skb_copy_ubufs(struct sk_buff *skb, gfp_t gfp_mask)
1353 int num_frags = skb_shinfo(skb)->nr_frags;
1354 struct page *page, *head = NULL;
1358 if (skb_shared(skb) || skb_unclone(skb, gfp_mask))
1364 new_frags = (__skb_pagelen(skb) + PAGE_SIZE - 1) >> PAGE_SHIFT;
1365 for (i = 0; i < new_frags; i++) {
1366 page = alloc_page(gfp_mask);
1369 struct page *next = (struct page *)page_private(head);
1375 set_page_private(page, (unsigned long)head);
1381 for (i = 0; i < num_frags; i++) {
1382 skb_frag_t *f = &skb_shinfo(skb)->frags[i];
1383 u32 p_off, p_len, copied;
1387 skb_frag_foreach_page(f, skb_frag_off(f), skb_frag_size(f),
1388 p, p_off, p_len, copied) {
1390 vaddr = kmap_atomic(p);
1392 while (done < p_len) {
1393 if (d_off == PAGE_SIZE) {
1395 page = (struct page *)page_private(page);
1397 copy = min_t(u32, PAGE_SIZE - d_off, p_len - done);
1398 memcpy(page_address(page) + d_off,
1399 vaddr + p_off + done, copy);
1403 kunmap_atomic(vaddr);
1407 /* skb frags release userspace buffers */
1408 for (i = 0; i < num_frags; i++)
1409 skb_frag_unref(skb, i);
1411 /* skb frags point to kernel buffers */
1412 for (i = 0; i < new_frags - 1; i++) {
1413 __skb_fill_page_desc(skb, i, head, 0, PAGE_SIZE);
1414 head = (struct page *)page_private(head);
1416 __skb_fill_page_desc(skb, new_frags - 1, head, 0, d_off);
1417 skb_shinfo(skb)->nr_frags = new_frags;
1420 skb_zcopy_clear(skb, false);
1423 EXPORT_SYMBOL_GPL(skb_copy_ubufs);
1426 * skb_clone - duplicate an sk_buff
1427 * @skb: buffer to clone
1428 * @gfp_mask: allocation priority
1430 * Duplicate an &sk_buff. The new one is not owned by a socket. Both
1431 * copies share the same packet data but not structure. The new
1432 * buffer has a reference count of 1. If the allocation fails the
1433 * function returns %NULL otherwise the new buffer is returned.
1435 * If this function is called from an interrupt gfp_mask() must be
1439 struct sk_buff *skb_clone(struct sk_buff *skb, gfp_t gfp_mask)
1441 struct sk_buff_fclones *fclones = container_of(skb,
1442 struct sk_buff_fclones,
1446 if (skb_orphan_frags(skb, gfp_mask))
1449 if (skb->fclone == SKB_FCLONE_ORIG &&
1450 refcount_read(&fclones->fclone_ref) == 1) {
1452 refcount_set(&fclones->fclone_ref, 2);
1454 if (skb_pfmemalloc(skb))
1455 gfp_mask |= __GFP_MEMALLOC;
1457 n = kmem_cache_alloc(skbuff_head_cache, gfp_mask);
1461 n->fclone = SKB_FCLONE_UNAVAILABLE;
1464 return __skb_clone(n, skb);
1466 EXPORT_SYMBOL(skb_clone);
1468 void skb_headers_offset_update(struct sk_buff *skb, int off)
1470 /* Only adjust this if it actually is csum_start rather than csum */
1471 if (skb->ip_summed == CHECKSUM_PARTIAL)
1472 skb->csum_start += off;
1473 /* {transport,network,mac}_header and tail are relative to skb->head */
1474 skb->transport_header += off;
1475 skb->network_header += off;
1476 if (skb_mac_header_was_set(skb))
1477 skb->mac_header += off;
1478 skb->inner_transport_header += off;
1479 skb->inner_network_header += off;
1480 skb->inner_mac_header += off;
1482 EXPORT_SYMBOL(skb_headers_offset_update);
1484 void skb_copy_header(struct sk_buff *new, const struct sk_buff *old)
1486 __copy_skb_header(new, old);
1488 skb_shinfo(new)->gso_size = skb_shinfo(old)->gso_size;
1489 skb_shinfo(new)->gso_segs = skb_shinfo(old)->gso_segs;
1490 skb_shinfo(new)->gso_type = skb_shinfo(old)->gso_type;
1492 EXPORT_SYMBOL(skb_copy_header);
1494 static inline int skb_alloc_rx_flag(const struct sk_buff *skb)
1496 if (skb_pfmemalloc(skb))
1497 return SKB_ALLOC_RX;
1502 * skb_copy - create private copy of an sk_buff
1503 * @skb: buffer to copy
1504 * @gfp_mask: allocation priority
1506 * Make a copy of both an &sk_buff and its data. This is used when the
1507 * caller wishes to modify the data and needs a private copy of the
1508 * data to alter. Returns %NULL on failure or the pointer to the buffer
1509 * on success. The returned buffer has a reference count of 1.
1511 * As by-product this function converts non-linear &sk_buff to linear
1512 * one, so that &sk_buff becomes completely private and caller is allowed
1513 * to modify all the data of returned buffer. This means that this
1514 * function is not recommended for use in circumstances when only
1515 * header is going to be modified. Use pskb_copy() instead.
1518 struct sk_buff *skb_copy(const struct sk_buff *skb, gfp_t gfp_mask)
1520 int headerlen = skb_headroom(skb);
1521 unsigned int size = skb_end_offset(skb) + skb->data_len;
1522 struct sk_buff *n = __alloc_skb(size, gfp_mask,
1523 skb_alloc_rx_flag(skb), NUMA_NO_NODE);
1528 /* Set the data pointer */
1529 skb_reserve(n, headerlen);
1530 /* Set the tail pointer and length */
1531 skb_put(n, skb->len);
1533 BUG_ON(skb_copy_bits(skb, -headerlen, n->head, headerlen + skb->len));
1535 skb_copy_header(n, skb);
1538 EXPORT_SYMBOL(skb_copy);
1541 * __pskb_copy_fclone - create copy of an sk_buff with private head.
1542 * @skb: buffer to copy
1543 * @headroom: headroom of new skb
1544 * @gfp_mask: allocation priority
1545 * @fclone: if true allocate the copy of the skb from the fclone
1546 * cache instead of the head cache; it is recommended to set this
1547 * to true for the cases where the copy will likely be cloned
1549 * Make a copy of both an &sk_buff and part of its data, located
1550 * in header. Fragmented data remain shared. This is used when
1551 * the caller wishes to modify only header of &sk_buff and needs
1552 * private copy of the header to alter. Returns %NULL on failure
1553 * or the pointer to the buffer on success.
1554 * The returned buffer has a reference count of 1.
1557 struct sk_buff *__pskb_copy_fclone(struct sk_buff *skb, int headroom,
1558 gfp_t gfp_mask, bool fclone)
1560 unsigned int size = skb_headlen(skb) + headroom;
1561 int flags = skb_alloc_rx_flag(skb) | (fclone ? SKB_ALLOC_FCLONE : 0);
1562 struct sk_buff *n = __alloc_skb(size, gfp_mask, flags, NUMA_NO_NODE);
1567 /* Set the data pointer */
1568 skb_reserve(n, headroom);
1569 /* Set the tail pointer and length */
1570 skb_put(n, skb_headlen(skb));
1571 /* Copy the bytes */
1572 skb_copy_from_linear_data(skb, n->data, n->len);
1574 n->truesize += skb->data_len;
1575 n->data_len = skb->data_len;
1578 if (skb_shinfo(skb)->nr_frags) {
1581 if (skb_orphan_frags(skb, gfp_mask) ||
1582 skb_zerocopy_clone(n, skb, gfp_mask)) {
1587 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1588 skb_shinfo(n)->frags[i] = skb_shinfo(skb)->frags[i];
1589 skb_frag_ref(skb, i);
1591 skb_shinfo(n)->nr_frags = i;
1594 if (skb_has_frag_list(skb)) {
1595 skb_shinfo(n)->frag_list = skb_shinfo(skb)->frag_list;
1596 skb_clone_fraglist(n);
1599 skb_copy_header(n, skb);
1603 EXPORT_SYMBOL(__pskb_copy_fclone);
1606 * pskb_expand_head - reallocate header of &sk_buff
1607 * @skb: buffer to reallocate
1608 * @nhead: room to add at head
1609 * @ntail: room to add at tail
1610 * @gfp_mask: allocation priority
1612 * Expands (or creates identical copy, if @nhead and @ntail are zero)
1613 * header of @skb. &sk_buff itself is not changed. &sk_buff MUST have
1614 * reference count of 1. Returns zero in the case of success or error,
1615 * if expansion failed. In the last case, &sk_buff is not changed.
1617 * All the pointers pointing into skb header may change and must be
1618 * reloaded after call to this function.
1621 int pskb_expand_head(struct sk_buff *skb, int nhead, int ntail,
1624 int i, osize = skb_end_offset(skb);
1625 int size = osize + nhead + ntail;
1631 BUG_ON(skb_shared(skb));
1633 size = SKB_DATA_ALIGN(size);
1635 if (skb_pfmemalloc(skb))
1636 gfp_mask |= __GFP_MEMALLOC;
1637 data = kmalloc_reserve(size + SKB_DATA_ALIGN(sizeof(struct skb_shared_info)),
1638 gfp_mask, NUMA_NO_NODE, NULL);
1641 size = SKB_WITH_OVERHEAD(ksize(data));
1643 /* Copy only real data... and, alas, header. This should be
1644 * optimized for the cases when header is void.
1646 memcpy(data + nhead, skb->head, skb_tail_pointer(skb) - skb->head);
1648 memcpy((struct skb_shared_info *)(data + size),
1650 offsetof(struct skb_shared_info, frags[skb_shinfo(skb)->nr_frags]));
1653 * if shinfo is shared we must drop the old head gracefully, but if it
1654 * is not we can just drop the old head and let the existing refcount
1655 * be since all we did is relocate the values
1657 if (skb_cloned(skb)) {
1658 if (skb_orphan_frags(skb, gfp_mask))
1661 refcount_inc(&skb_uarg(skb)->refcnt);
1662 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++)
1663 skb_frag_ref(skb, i);
1665 if (skb_has_frag_list(skb))
1666 skb_clone_fraglist(skb);
1668 skb_release_data(skb);
1672 off = (data + nhead) - skb->head;
1677 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1681 skb->end = skb->head + size;
1684 skb_headers_offset_update(skb, nhead);
1688 atomic_set(&skb_shinfo(skb)->dataref, 1);
1690 skb_metadata_clear(skb);
1692 /* It is not generally safe to change skb->truesize.
1693 * For the moment, we really care of rx path, or
1694 * when skb is orphaned (not attached to a socket).
1696 if (!skb->sk || skb->destructor == sock_edemux)
1697 skb->truesize += size - osize;
1706 EXPORT_SYMBOL(pskb_expand_head);
1708 /* Make private copy of skb with writable head and some headroom */
1710 struct sk_buff *skb_realloc_headroom(struct sk_buff *skb, unsigned int headroom)
1712 struct sk_buff *skb2;
1713 int delta = headroom - skb_headroom(skb);
1716 skb2 = pskb_copy(skb, GFP_ATOMIC);
1718 skb2 = skb_clone(skb, GFP_ATOMIC);
1719 if (skb2 && pskb_expand_head(skb2, SKB_DATA_ALIGN(delta), 0,
1727 EXPORT_SYMBOL(skb_realloc_headroom);
1730 * skb_copy_expand - copy and expand sk_buff
1731 * @skb: buffer to copy
1732 * @newheadroom: new free bytes at head
1733 * @newtailroom: new free bytes at tail
1734 * @gfp_mask: allocation priority
1736 * Make a copy of both an &sk_buff and its data and while doing so
1737 * allocate additional space.
1739 * This is used when the caller wishes to modify the data and needs a
1740 * private copy of the data to alter as well as more space for new fields.
1741 * Returns %NULL on failure or the pointer to the buffer
1742 * on success. The returned buffer has a reference count of 1.
1744 * You must pass %GFP_ATOMIC as the allocation priority if this function
1745 * is called from an interrupt.
1747 struct sk_buff *skb_copy_expand(const struct sk_buff *skb,
1748 int newheadroom, int newtailroom,
1752 * Allocate the copy buffer
1754 struct sk_buff *n = __alloc_skb(newheadroom + skb->len + newtailroom,
1755 gfp_mask, skb_alloc_rx_flag(skb),
1757 int oldheadroom = skb_headroom(skb);
1758 int head_copy_len, head_copy_off;
1763 skb_reserve(n, newheadroom);
1765 /* Set the tail pointer and length */
1766 skb_put(n, skb->len);
1768 head_copy_len = oldheadroom;
1770 if (newheadroom <= head_copy_len)
1771 head_copy_len = newheadroom;
1773 head_copy_off = newheadroom - head_copy_len;
1775 /* Copy the linear header and data. */
1776 BUG_ON(skb_copy_bits(skb, -head_copy_len, n->head + head_copy_off,
1777 skb->len + head_copy_len));
1779 skb_copy_header(n, skb);
1781 skb_headers_offset_update(n, newheadroom - oldheadroom);
1785 EXPORT_SYMBOL(skb_copy_expand);
1788 * __skb_pad - zero pad the tail of an skb
1789 * @skb: buffer to pad
1790 * @pad: space to pad
1791 * @free_on_error: free buffer on error
1793 * Ensure that a buffer is followed by a padding area that is zero
1794 * filled. Used by network drivers which may DMA or transfer data
1795 * beyond the buffer end onto the wire.
1797 * May return error in out of memory cases. The skb is freed on error
1798 * if @free_on_error is true.
1801 int __skb_pad(struct sk_buff *skb, int pad, bool free_on_error)
1806 /* If the skbuff is non linear tailroom is always zero.. */
1807 if (!skb_cloned(skb) && skb_tailroom(skb) >= pad) {
1808 memset(skb->data+skb->len, 0, pad);
1812 ntail = skb->data_len + pad - (skb->end - skb->tail);
1813 if (likely(skb_cloned(skb) || ntail > 0)) {
1814 err = pskb_expand_head(skb, 0, ntail, GFP_ATOMIC);
1819 /* FIXME: The use of this function with non-linear skb's really needs
1822 err = skb_linearize(skb);
1826 memset(skb->data + skb->len, 0, pad);
1834 EXPORT_SYMBOL(__skb_pad);
1837 * pskb_put - add data to the tail of a potentially fragmented buffer
1838 * @skb: start of the buffer to use
1839 * @tail: tail fragment of the buffer to use
1840 * @len: amount of data to add
1842 * This function extends the used data area of the potentially
1843 * fragmented buffer. @tail must be the last fragment of @skb -- or
1844 * @skb itself. If this would exceed the total buffer size the kernel
1845 * will panic. A pointer to the first byte of the extra data is
1849 void *pskb_put(struct sk_buff *skb, struct sk_buff *tail, int len)
1852 skb->data_len += len;
1855 return skb_put(tail, len);
1857 EXPORT_SYMBOL_GPL(pskb_put);
1860 * skb_put - add data to a buffer
1861 * @skb: buffer to use
1862 * @len: amount of data to add
1864 * This function extends the used data area of the buffer. If this would
1865 * exceed the total buffer size the kernel will panic. A pointer to the
1866 * first byte of the extra data is returned.
1868 void *skb_put(struct sk_buff *skb, unsigned int len)
1870 void *tmp = skb_tail_pointer(skb);
1871 SKB_LINEAR_ASSERT(skb);
1874 if (unlikely(skb->tail > skb->end))
1875 skb_over_panic(skb, len, __builtin_return_address(0));
1878 EXPORT_SYMBOL(skb_put);
1881 * skb_push - add data to the start of a buffer
1882 * @skb: buffer to use
1883 * @len: amount of data to add
1885 * This function extends the used data area of the buffer at the buffer
1886 * start. If this would exceed the total buffer headroom the kernel will
1887 * panic. A pointer to the first byte of the extra data is returned.
1889 void *skb_push(struct sk_buff *skb, unsigned int len)
1893 if (unlikely(skb->data < skb->head))
1894 skb_under_panic(skb, len, __builtin_return_address(0));
1897 EXPORT_SYMBOL(skb_push);
1900 * skb_pull - remove data from the start of a buffer
1901 * @skb: buffer to use
1902 * @len: amount of data to remove
1904 * This function removes data from the start of a buffer, returning
1905 * the memory to the headroom. A pointer to the next data in the buffer
1906 * is returned. Once the data has been pulled future pushes will overwrite
1909 void *skb_pull(struct sk_buff *skb, unsigned int len)
1911 return skb_pull_inline(skb, len);
1913 EXPORT_SYMBOL(skb_pull);
1916 * skb_trim - remove end from a buffer
1917 * @skb: buffer to alter
1920 * Cut the length of a buffer down by removing data from the tail. If
1921 * the buffer is already under the length specified it is not modified.
1922 * The skb must be linear.
1924 void skb_trim(struct sk_buff *skb, unsigned int len)
1927 __skb_trim(skb, len);
1929 EXPORT_SYMBOL(skb_trim);
1931 /* Trims skb to length len. It can change skb pointers.
1934 int ___pskb_trim(struct sk_buff *skb, unsigned int len)
1936 struct sk_buff **fragp;
1937 struct sk_buff *frag;
1938 int offset = skb_headlen(skb);
1939 int nfrags = skb_shinfo(skb)->nr_frags;
1943 if (skb_cloned(skb) &&
1944 unlikely((err = pskb_expand_head(skb, 0, 0, GFP_ATOMIC))))
1951 for (; i < nfrags; i++) {
1952 int end = offset + skb_frag_size(&skb_shinfo(skb)->frags[i]);
1959 skb_frag_size_set(&skb_shinfo(skb)->frags[i++], len - offset);
1962 skb_shinfo(skb)->nr_frags = i;
1964 for (; i < nfrags; i++)
1965 skb_frag_unref(skb, i);
1967 if (skb_has_frag_list(skb))
1968 skb_drop_fraglist(skb);
1972 for (fragp = &skb_shinfo(skb)->frag_list; (frag = *fragp);
1973 fragp = &frag->next) {
1974 int end = offset + frag->len;
1976 if (skb_shared(frag)) {
1977 struct sk_buff *nfrag;
1979 nfrag = skb_clone(frag, GFP_ATOMIC);
1980 if (unlikely(!nfrag))
1983 nfrag->next = frag->next;
1995 unlikely((err = pskb_trim(frag, len - offset))))
1999 skb_drop_list(&frag->next);
2004 if (len > skb_headlen(skb)) {
2005 skb->data_len -= skb->len - len;
2010 skb_set_tail_pointer(skb, len);
2013 if (!skb->sk || skb->destructor == sock_edemux)
2017 EXPORT_SYMBOL(___pskb_trim);
2019 /* Note : use pskb_trim_rcsum() instead of calling this directly
2021 int pskb_trim_rcsum_slow(struct sk_buff *skb, unsigned int len)
2023 if (skb->ip_summed == CHECKSUM_COMPLETE) {
2024 int delta = skb->len - len;
2026 skb->csum = csum_block_sub(skb->csum,
2027 skb_checksum(skb, len, delta, 0),
2029 } else if (skb->ip_summed == CHECKSUM_PARTIAL) {
2030 int hdlen = (len > skb_headlen(skb)) ? skb_headlen(skb) : len;
2031 int offset = skb_checksum_start_offset(skb) + skb->csum_offset;
2033 if (offset + sizeof(__sum16) > hdlen)
2036 return __pskb_trim(skb, len);
2038 EXPORT_SYMBOL(pskb_trim_rcsum_slow);
2041 * __pskb_pull_tail - advance tail of skb header
2042 * @skb: buffer to reallocate
2043 * @delta: number of bytes to advance tail
2045 * The function makes a sense only on a fragmented &sk_buff,
2046 * it expands header moving its tail forward and copying necessary
2047 * data from fragmented part.
2049 * &sk_buff MUST have reference count of 1.
2051 * Returns %NULL (and &sk_buff does not change) if pull failed
2052 * or value of new tail of skb in the case of success.
2054 * All the pointers pointing into skb header may change and must be
2055 * reloaded after call to this function.
2058 /* Moves tail of skb head forward, copying data from fragmented part,
2059 * when it is necessary.
2060 * 1. It may fail due to malloc failure.
2061 * 2. It may change skb pointers.
2063 * It is pretty complicated. Luckily, it is called only in exceptional cases.
2065 void *__pskb_pull_tail(struct sk_buff *skb, int delta)
2067 /* If skb has not enough free space at tail, get new one
2068 * plus 128 bytes for future expansions. If we have enough
2069 * room at tail, reallocate without expansion only if skb is cloned.
2071 int i, k, eat = (skb->tail + delta) - skb->end;
2073 if (eat > 0 || skb_cloned(skb)) {
2074 if (pskb_expand_head(skb, 0, eat > 0 ? eat + 128 : 0,
2079 BUG_ON(skb_copy_bits(skb, skb_headlen(skb),
2080 skb_tail_pointer(skb), delta));
2082 /* Optimization: no fragments, no reasons to preestimate
2083 * size of pulled pages. Superb.
2085 if (!skb_has_frag_list(skb))
2088 /* Estimate size of pulled pages. */
2090 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
2091 int size = skb_frag_size(&skb_shinfo(skb)->frags[i]);
2098 /* If we need update frag list, we are in troubles.
2099 * Certainly, it is possible to add an offset to skb data,
2100 * but taking into account that pulling is expected to
2101 * be very rare operation, it is worth to fight against
2102 * further bloating skb head and crucify ourselves here instead.
2103 * Pure masohism, indeed. 8)8)
2106 struct sk_buff *list = skb_shinfo(skb)->frag_list;
2107 struct sk_buff *clone = NULL;
2108 struct sk_buff *insp = NULL;
2111 if (list->len <= eat) {
2112 /* Eaten as whole. */
2117 /* Eaten partially. */
2119 if (skb_shared(list)) {
2120 /* Sucks! We need to fork list. :-( */
2121 clone = skb_clone(list, GFP_ATOMIC);
2127 /* This may be pulled without
2131 if (!pskb_pull(list, eat)) {
2139 /* Free pulled out fragments. */
2140 while ((list = skb_shinfo(skb)->frag_list) != insp) {
2141 skb_shinfo(skb)->frag_list = list->next;
2144 /* And insert new clone at head. */
2147 skb_shinfo(skb)->frag_list = clone;
2150 /* Success! Now we may commit changes to skb data. */
2155 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
2156 int size = skb_frag_size(&skb_shinfo(skb)->frags[i]);
2159 skb_frag_unref(skb, i);
2162 skb_frag_t *frag = &skb_shinfo(skb)->frags[k];
2164 *frag = skb_shinfo(skb)->frags[i];
2166 skb_frag_off_add(frag, eat);
2167 skb_frag_size_sub(frag, eat);
2175 skb_shinfo(skb)->nr_frags = k;
2179 skb->data_len -= delta;
2182 skb_zcopy_clear(skb, false);
2184 return skb_tail_pointer(skb);
2186 EXPORT_SYMBOL(__pskb_pull_tail);
2189 * skb_copy_bits - copy bits from skb to kernel buffer
2191 * @offset: offset in source
2192 * @to: destination buffer
2193 * @len: number of bytes to copy
2195 * Copy the specified number of bytes from the source skb to the
2196 * destination buffer.
2199 * If its prototype is ever changed,
2200 * check arch/{*}/net/{*}.S files,
2201 * since it is called from BPF assembly code.
2203 int skb_copy_bits(const struct sk_buff *skb, int offset, void *to, int len)
2205 int start = skb_headlen(skb);
2206 struct sk_buff *frag_iter;
2209 if (offset > (int)skb->len - len)
2213 if ((copy = start - offset) > 0) {
2216 skb_copy_from_linear_data_offset(skb, offset, to, copy);
2217 if ((len -= copy) == 0)
2223 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
2225 skb_frag_t *f = &skb_shinfo(skb)->frags[i];
2227 WARN_ON(start > offset + len);
2229 end = start + skb_frag_size(f);
2230 if ((copy = end - offset) > 0) {
2231 u32 p_off, p_len, copied;
2238 skb_frag_foreach_page(f,
2239 skb_frag_off(f) + offset - start,
2240 copy, p, p_off, p_len, copied) {
2241 vaddr = kmap_atomic(p);
2242 memcpy(to + copied, vaddr + p_off, p_len);
2243 kunmap_atomic(vaddr);
2246 if ((len -= copy) == 0)
2254 skb_walk_frags(skb, frag_iter) {
2257 WARN_ON(start > offset + len);
2259 end = start + frag_iter->len;
2260 if ((copy = end - offset) > 0) {
2263 if (skb_copy_bits(frag_iter, offset - start, to, copy))
2265 if ((len -= copy) == 0)
2279 EXPORT_SYMBOL(skb_copy_bits);
2282 * Callback from splice_to_pipe(), if we need to release some pages
2283 * at the end of the spd in case we error'ed out in filling the pipe.
2285 static void sock_spd_release(struct splice_pipe_desc *spd, unsigned int i)
2287 put_page(spd->pages[i]);
2290 static struct page *linear_to_page(struct page *page, unsigned int *len,
2291 unsigned int *offset,
2294 struct page_frag *pfrag = sk_page_frag(sk);
2296 if (!sk_page_frag_refill(sk, pfrag))
2299 *len = min_t(unsigned int, *len, pfrag->size - pfrag->offset);
2301 memcpy(page_address(pfrag->page) + pfrag->offset,
2302 page_address(page) + *offset, *len);
2303 *offset = pfrag->offset;
2304 pfrag->offset += *len;
2309 static bool spd_can_coalesce(const struct splice_pipe_desc *spd,
2311 unsigned int offset)
2313 return spd->nr_pages &&
2314 spd->pages[spd->nr_pages - 1] == page &&
2315 (spd->partial[spd->nr_pages - 1].offset +
2316 spd->partial[spd->nr_pages - 1].len == offset);
2320 * Fill page/offset/length into spd, if it can hold more pages.
2322 static bool spd_fill_page(struct splice_pipe_desc *spd,
2323 struct pipe_inode_info *pipe, struct page *page,
2324 unsigned int *len, unsigned int offset,
2328 if (unlikely(spd->nr_pages == MAX_SKB_FRAGS))
2332 page = linear_to_page(page, len, &offset, sk);
2336 if (spd_can_coalesce(spd, page, offset)) {
2337 spd->partial[spd->nr_pages - 1].len += *len;
2341 spd->pages[spd->nr_pages] = page;
2342 spd->partial[spd->nr_pages].len = *len;
2343 spd->partial[spd->nr_pages].offset = offset;
2349 static bool __splice_segment(struct page *page, unsigned int poff,
2350 unsigned int plen, unsigned int *off,
2352 struct splice_pipe_desc *spd, bool linear,
2354 struct pipe_inode_info *pipe)
2359 /* skip this segment if already processed */
2365 /* ignore any bits we already processed */
2371 unsigned int flen = min(*len, plen);
2373 if (spd_fill_page(spd, pipe, page, &flen, poff,
2379 } while (*len && plen);
2385 * Map linear and fragment data from the skb to spd. It reports true if the
2386 * pipe is full or if we already spliced the requested length.
2388 static bool __skb_splice_bits(struct sk_buff *skb, struct pipe_inode_info *pipe,
2389 unsigned int *offset, unsigned int *len,
2390 struct splice_pipe_desc *spd, struct sock *sk)
2393 struct sk_buff *iter;
2395 /* map the linear part :
2396 * If skb->head_frag is set, this 'linear' part is backed by a
2397 * fragment, and if the head is not shared with any clones then
2398 * we can avoid a copy since we own the head portion of this page.
2400 if (__splice_segment(virt_to_page(skb->data),
2401 (unsigned long) skb->data & (PAGE_SIZE - 1),
2404 skb_head_is_locked(skb),
2409 * then map the fragments
2411 for (seg = 0; seg < skb_shinfo(skb)->nr_frags; seg++) {
2412 const skb_frag_t *f = &skb_shinfo(skb)->frags[seg];
2414 if (__splice_segment(skb_frag_page(f),
2415 skb_frag_off(f), skb_frag_size(f),
2416 offset, len, spd, false, sk, pipe))
2420 skb_walk_frags(skb, iter) {
2421 if (*offset >= iter->len) {
2422 *offset -= iter->len;
2425 /* __skb_splice_bits() only fails if the output has no room
2426 * left, so no point in going over the frag_list for the error
2429 if (__skb_splice_bits(iter, pipe, offset, len, spd, sk))
2437 * Map data from the skb to a pipe. Should handle both the linear part,
2438 * the fragments, and the frag list.
2440 int skb_splice_bits(struct sk_buff *skb, struct sock *sk, unsigned int offset,
2441 struct pipe_inode_info *pipe, unsigned int tlen,
2444 struct partial_page partial[MAX_SKB_FRAGS];
2445 struct page *pages[MAX_SKB_FRAGS];
2446 struct splice_pipe_desc spd = {
2449 .nr_pages_max = MAX_SKB_FRAGS,
2450 .ops = &nosteal_pipe_buf_ops,
2451 .spd_release = sock_spd_release,
2455 __skb_splice_bits(skb, pipe, &offset, &tlen, &spd, sk);
2458 ret = splice_to_pipe(pipe, &spd);
2462 EXPORT_SYMBOL_GPL(skb_splice_bits);
2464 /* Send skb data on a socket. Socket must be locked. */
2465 int skb_send_sock_locked(struct sock *sk, struct sk_buff *skb, int offset,
2468 unsigned int orig_len = len;
2469 struct sk_buff *head = skb;
2470 unsigned short fragidx;
2475 /* Deal with head data */
2476 while (offset < skb_headlen(skb) && len) {
2480 slen = min_t(int, len, skb_headlen(skb) - offset);
2481 kv.iov_base = skb->data + offset;
2483 memset(&msg, 0, sizeof(msg));
2484 msg.msg_flags = MSG_DONTWAIT;
2486 ret = kernel_sendmsg_locked(sk, &msg, &kv, 1, slen);
2494 /* All the data was skb head? */
2498 /* Make offset relative to start of frags */
2499 offset -= skb_headlen(skb);
2501 /* Find where we are in frag list */
2502 for (fragidx = 0; fragidx < skb_shinfo(skb)->nr_frags; fragidx++) {
2503 skb_frag_t *frag = &skb_shinfo(skb)->frags[fragidx];
2505 if (offset < skb_frag_size(frag))
2508 offset -= skb_frag_size(frag);
2511 for (; len && fragidx < skb_shinfo(skb)->nr_frags; fragidx++) {
2512 skb_frag_t *frag = &skb_shinfo(skb)->frags[fragidx];
2514 slen = min_t(size_t, len, skb_frag_size(frag) - offset);
2517 ret = kernel_sendpage_locked(sk, skb_frag_page(frag),
2518 skb_frag_off(frag) + offset,
2519 slen, MSG_DONTWAIT);
2532 /* Process any frag lists */
2535 if (skb_has_frag_list(skb)) {
2536 skb = skb_shinfo(skb)->frag_list;
2539 } else if (skb->next) {
2546 return orig_len - len;
2549 return orig_len == len ? ret : orig_len - len;
2551 EXPORT_SYMBOL_GPL(skb_send_sock_locked);
2554 * skb_store_bits - store bits from kernel buffer to skb
2555 * @skb: destination buffer
2556 * @offset: offset in destination
2557 * @from: source buffer
2558 * @len: number of bytes to copy
2560 * Copy the specified number of bytes from the source buffer to the
2561 * destination skb. This function handles all the messy bits of
2562 * traversing fragment lists and such.
2565 int skb_store_bits(struct sk_buff *skb, int offset, const void *from, int len)
2567 int start = skb_headlen(skb);
2568 struct sk_buff *frag_iter;
2571 if (offset > (int)skb->len - len)
2574 if ((copy = start - offset) > 0) {
2577 skb_copy_to_linear_data_offset(skb, offset, from, copy);
2578 if ((len -= copy) == 0)
2584 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
2585 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
2588 WARN_ON(start > offset + len);
2590 end = start + skb_frag_size(frag);
2591 if ((copy = end - offset) > 0) {
2592 u32 p_off, p_len, copied;
2599 skb_frag_foreach_page(frag,
2600 skb_frag_off(frag) + offset - start,
2601 copy, p, p_off, p_len, copied) {
2602 vaddr = kmap_atomic(p);
2603 memcpy(vaddr + p_off, from + copied, p_len);
2604 kunmap_atomic(vaddr);
2607 if ((len -= copy) == 0)
2615 skb_walk_frags(skb, frag_iter) {
2618 WARN_ON(start > offset + len);
2620 end = start + frag_iter->len;
2621 if ((copy = end - offset) > 0) {
2624 if (skb_store_bits(frag_iter, offset - start,
2627 if ((len -= copy) == 0)
2640 EXPORT_SYMBOL(skb_store_bits);
2642 /* Checksum skb data. */
2643 __wsum __skb_checksum(const struct sk_buff *skb, int offset, int len,
2644 __wsum csum, const struct skb_checksum_ops *ops)
2646 int start = skb_headlen(skb);
2647 int i, copy = start - offset;
2648 struct sk_buff *frag_iter;
2651 /* Checksum header. */
2655 csum = INDIRECT_CALL_1(ops->update, csum_partial_ext,
2656 skb->data + offset, copy, csum);
2657 if ((len -= copy) == 0)
2663 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
2665 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
2667 WARN_ON(start > offset + len);
2669 end = start + skb_frag_size(frag);
2670 if ((copy = end - offset) > 0) {
2671 u32 p_off, p_len, copied;
2679 skb_frag_foreach_page(frag,
2680 skb_frag_off(frag) + offset - start,
2681 copy, p, p_off, p_len, copied) {
2682 vaddr = kmap_atomic(p);
2683 csum2 = INDIRECT_CALL_1(ops->update,
2685 vaddr + p_off, p_len, 0);
2686 kunmap_atomic(vaddr);
2687 csum = INDIRECT_CALL_1(ops->combine,
2688 csum_block_add_ext, csum,
2700 skb_walk_frags(skb, frag_iter) {
2703 WARN_ON(start > offset + len);
2705 end = start + frag_iter->len;
2706 if ((copy = end - offset) > 0) {
2710 csum2 = __skb_checksum(frag_iter, offset - start,
2712 csum = INDIRECT_CALL_1(ops->combine, csum_block_add_ext,
2713 csum, csum2, pos, copy);
2714 if ((len -= copy) == 0)
2725 EXPORT_SYMBOL(__skb_checksum);
2727 __wsum skb_checksum(const struct sk_buff *skb, int offset,
2728 int len, __wsum csum)
2730 const struct skb_checksum_ops ops = {
2731 .update = csum_partial_ext,
2732 .combine = csum_block_add_ext,
2735 return __skb_checksum(skb, offset, len, csum, &ops);
2737 EXPORT_SYMBOL(skb_checksum);
2739 /* Both of above in one bottle. */
2741 __wsum skb_copy_and_csum_bits(const struct sk_buff *skb, int offset,
2742 u8 *to, int len, __wsum csum)
2744 int start = skb_headlen(skb);
2745 int i, copy = start - offset;
2746 struct sk_buff *frag_iter;
2753 csum = csum_partial_copy_nocheck(skb->data + offset, to,
2755 if ((len -= copy) == 0)
2762 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
2765 WARN_ON(start > offset + len);
2767 end = start + skb_frag_size(&skb_shinfo(skb)->frags[i]);
2768 if ((copy = end - offset) > 0) {
2769 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
2770 u32 p_off, p_len, copied;
2778 skb_frag_foreach_page(frag,
2779 skb_frag_off(frag) + offset - start,
2780 copy, p, p_off, p_len, copied) {
2781 vaddr = kmap_atomic(p);
2782 csum2 = csum_partial_copy_nocheck(vaddr + p_off,
2785 kunmap_atomic(vaddr);
2786 csum = csum_block_add(csum, csum2, pos);
2798 skb_walk_frags(skb, frag_iter) {
2802 WARN_ON(start > offset + len);
2804 end = start + frag_iter->len;
2805 if ((copy = end - offset) > 0) {
2808 csum2 = skb_copy_and_csum_bits(frag_iter,
2811 csum = csum_block_add(csum, csum2, pos);
2812 if ((len -= copy) == 0)
2823 EXPORT_SYMBOL(skb_copy_and_csum_bits);
2825 __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len)
2829 sum = csum_fold(skb_checksum(skb, 0, len, skb->csum));
2830 /* See comments in __skb_checksum_complete(). */
2832 if (unlikely(skb->ip_summed == CHECKSUM_COMPLETE) &&
2833 !skb->csum_complete_sw)
2834 netdev_rx_csum_fault(skb->dev, skb);
2836 if (!skb_shared(skb))
2837 skb->csum_valid = !sum;
2840 EXPORT_SYMBOL(__skb_checksum_complete_head);
2842 /* This function assumes skb->csum already holds pseudo header's checksum,
2843 * which has been changed from the hardware checksum, for example, by
2844 * __skb_checksum_validate_complete(). And, the original skb->csum must
2845 * have been validated unsuccessfully for CHECKSUM_COMPLETE case.
2847 * It returns non-zero if the recomputed checksum is still invalid, otherwise
2848 * zero. The new checksum is stored back into skb->csum unless the skb is
2851 __sum16 __skb_checksum_complete(struct sk_buff *skb)
2856 csum = skb_checksum(skb, 0, skb->len, 0);
2858 sum = csum_fold(csum_add(skb->csum, csum));
2859 /* This check is inverted, because we already knew the hardware
2860 * checksum is invalid before calling this function. So, if the
2861 * re-computed checksum is valid instead, then we have a mismatch
2862 * between the original skb->csum and skb_checksum(). This means either
2863 * the original hardware checksum is incorrect or we screw up skb->csum
2864 * when moving skb->data around.
2867 if (unlikely(skb->ip_summed == CHECKSUM_COMPLETE) &&
2868 !skb->csum_complete_sw)
2869 netdev_rx_csum_fault(skb->dev, skb);
2872 if (!skb_shared(skb)) {
2873 /* Save full packet checksum */
2875 skb->ip_summed = CHECKSUM_COMPLETE;
2876 skb->csum_complete_sw = 1;
2877 skb->csum_valid = !sum;
2882 EXPORT_SYMBOL(__skb_checksum_complete);
2884 static __wsum warn_crc32c_csum_update(const void *buff, int len, __wsum sum)
2886 net_warn_ratelimited(
2887 "%s: attempt to compute crc32c without libcrc32c.ko\n",
2892 static __wsum warn_crc32c_csum_combine(__wsum csum, __wsum csum2,
2893 int offset, int len)
2895 net_warn_ratelimited(
2896 "%s: attempt to compute crc32c without libcrc32c.ko\n",
2901 static const struct skb_checksum_ops default_crc32c_ops = {
2902 .update = warn_crc32c_csum_update,
2903 .combine = warn_crc32c_csum_combine,
2906 const struct skb_checksum_ops *crc32c_csum_stub __read_mostly =
2907 &default_crc32c_ops;
2908 EXPORT_SYMBOL(crc32c_csum_stub);
2911 * skb_zerocopy_headlen - Calculate headroom needed for skb_zerocopy()
2912 * @from: source buffer
2914 * Calculates the amount of linear headroom needed in the 'to' skb passed
2915 * into skb_zerocopy().
2918 skb_zerocopy_headlen(const struct sk_buff *from)
2920 unsigned int hlen = 0;
2922 if (!from->head_frag ||
2923 skb_headlen(from) < L1_CACHE_BYTES ||
2924 skb_shinfo(from)->nr_frags >= MAX_SKB_FRAGS) {
2925 hlen = skb_headlen(from);
2930 if (skb_has_frag_list(from))
2935 EXPORT_SYMBOL_GPL(skb_zerocopy_headlen);
2938 * skb_zerocopy - Zero copy skb to skb
2939 * @to: destination buffer
2940 * @from: source buffer
2941 * @len: number of bytes to copy from source buffer
2942 * @hlen: size of linear headroom in destination buffer
2944 * Copies up to `len` bytes from `from` to `to` by creating references
2945 * to the frags in the source buffer.
2947 * The `hlen` as calculated by skb_zerocopy_headlen() specifies the
2948 * headroom in the `to` buffer.
2951 * 0: everything is OK
2952 * -ENOMEM: couldn't orphan frags of @from due to lack of memory
2953 * -EFAULT: skb_copy_bits() found some problem with skb geometry
2956 skb_zerocopy(struct sk_buff *to, struct sk_buff *from, int len, int hlen)
2959 int plen = 0; /* length of skb->head fragment */
2962 unsigned int offset;
2964 BUG_ON(!from->head_frag && !hlen);
2966 /* dont bother with small payloads */
2967 if (len <= skb_tailroom(to))
2968 return skb_copy_bits(from, 0, skb_put(to, len), len);
2971 ret = skb_copy_bits(from, 0, skb_put(to, hlen), hlen);
2976 plen = min_t(int, skb_headlen(from), len);
2978 page = virt_to_head_page(from->head);
2979 offset = from->data - (unsigned char *)page_address(page);
2980 __skb_fill_page_desc(to, 0, page, offset, plen);
2987 to->truesize += len + plen;
2988 to->len += len + plen;
2989 to->data_len += len + plen;
2991 if (unlikely(skb_orphan_frags(from, GFP_ATOMIC))) {
2995 skb_zerocopy_clone(to, from, GFP_ATOMIC);
2997 for (i = 0; i < skb_shinfo(from)->nr_frags; i++) {
3002 skb_shinfo(to)->frags[j] = skb_shinfo(from)->frags[i];
3003 size = min_t(int, skb_frag_size(&skb_shinfo(to)->frags[j]),
3005 skb_frag_size_set(&skb_shinfo(to)->frags[j], size);
3007 skb_frag_ref(to, j);
3010 skb_shinfo(to)->nr_frags = j;
3014 EXPORT_SYMBOL_GPL(skb_zerocopy);
3016 void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to)
3021 if (skb->ip_summed == CHECKSUM_PARTIAL)
3022 csstart = skb_checksum_start_offset(skb);
3024 csstart = skb_headlen(skb);
3026 BUG_ON(csstart > skb_headlen(skb));
3028 skb_copy_from_linear_data(skb, to, csstart);
3031 if (csstart != skb->len)
3032 csum = skb_copy_and_csum_bits(skb, csstart, to + csstart,
3033 skb->len - csstart, 0);
3035 if (skb->ip_summed == CHECKSUM_PARTIAL) {
3036 long csstuff = csstart + skb->csum_offset;
3038 *((__sum16 *)(to + csstuff)) = csum_fold(csum);
3041 EXPORT_SYMBOL(skb_copy_and_csum_dev);
3044 * skb_dequeue - remove from the head of the queue
3045 * @list: list to dequeue from
3047 * Remove the head of the list. The list lock is taken so the function
3048 * may be used safely with other locking list functions. The head item is
3049 * returned or %NULL if the list is empty.
3052 struct sk_buff *skb_dequeue(struct sk_buff_head *list)
3054 unsigned long flags;
3055 struct sk_buff *result;
3057 spin_lock_irqsave(&list->lock, flags);
3058 result = __skb_dequeue(list);
3059 spin_unlock_irqrestore(&list->lock, flags);
3062 EXPORT_SYMBOL(skb_dequeue);
3065 * skb_dequeue_tail - remove from the tail of the queue
3066 * @list: list to dequeue from
3068 * Remove the tail of the list. The list lock is taken so the function
3069 * may be used safely with other locking list functions. The tail item is
3070 * returned or %NULL if the list is empty.
3072 struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list)
3074 unsigned long flags;
3075 struct sk_buff *result;
3077 spin_lock_irqsave(&list->lock, flags);
3078 result = __skb_dequeue_tail(list);
3079 spin_unlock_irqrestore(&list->lock, flags);
3082 EXPORT_SYMBOL(skb_dequeue_tail);
3085 * skb_queue_purge - empty a list
3086 * @list: list to empty
3088 * Delete all buffers on an &sk_buff list. Each buffer is removed from
3089 * the list and one reference dropped. This function takes the list
3090 * lock and is atomic with respect to other list locking functions.
3092 void skb_queue_purge(struct sk_buff_head *list)
3094 struct sk_buff *skb;
3095 while ((skb = skb_dequeue(list)) != NULL)
3098 EXPORT_SYMBOL(skb_queue_purge);
3101 * skb_rbtree_purge - empty a skb rbtree
3102 * @root: root of the rbtree to empty
3103 * Return value: the sum of truesizes of all purged skbs.
3105 * Delete all buffers on an &sk_buff rbtree. Each buffer is removed from
3106 * the list and one reference dropped. This function does not take
3107 * any lock. Synchronization should be handled by the caller (e.g., TCP
3108 * out-of-order queue is protected by the socket lock).
3110 unsigned int skb_rbtree_purge(struct rb_root *root)
3112 struct rb_node *p = rb_first(root);
3113 unsigned int sum = 0;
3116 struct sk_buff *skb = rb_entry(p, struct sk_buff, rbnode);
3119 rb_erase(&skb->rbnode, root);
3120 sum += skb->truesize;
3127 * skb_queue_head - queue a buffer at the list head
3128 * @list: list to use
3129 * @newsk: buffer to queue
3131 * Queue a buffer at the start of the list. This function takes the
3132 * list lock and can be used safely with other locking &sk_buff functions
3135 * A buffer cannot be placed on two lists at the same time.
3137 void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk)
3139 unsigned long flags;
3141 spin_lock_irqsave(&list->lock, flags);
3142 __skb_queue_head(list, newsk);
3143 spin_unlock_irqrestore(&list->lock, flags);
3145 EXPORT_SYMBOL(skb_queue_head);
3148 * skb_queue_tail - queue a buffer at the list tail
3149 * @list: list to use
3150 * @newsk: buffer to queue
3152 * Queue a buffer at the tail of the list. This function takes the
3153 * list lock and can be used safely with other locking &sk_buff functions
3156 * A buffer cannot be placed on two lists at the same time.
3158 void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk)
3160 unsigned long flags;
3162 spin_lock_irqsave(&list->lock, flags);
3163 __skb_queue_tail(list, newsk);
3164 spin_unlock_irqrestore(&list->lock, flags);
3166 EXPORT_SYMBOL(skb_queue_tail);
3169 * skb_unlink - remove a buffer from a list
3170 * @skb: buffer to remove
3171 * @list: list to use
3173 * Remove a packet from a list. The list locks are taken and this
3174 * function is atomic with respect to other list locked calls
3176 * You must know what list the SKB is on.
3178 void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
3180 unsigned long flags;
3182 spin_lock_irqsave(&list->lock, flags);
3183 __skb_unlink(skb, list);
3184 spin_unlock_irqrestore(&list->lock, flags);
3186 EXPORT_SYMBOL(skb_unlink);
3189 * skb_append - append a buffer
3190 * @old: buffer to insert after
3191 * @newsk: buffer to insert
3192 * @list: list to use
3194 * Place a packet after a given packet in a list. The list locks are taken
3195 * and this function is atomic with respect to other list locked calls.
3196 * A buffer cannot be placed on two lists at the same time.
3198 void skb_append(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list)
3200 unsigned long flags;
3202 spin_lock_irqsave(&list->lock, flags);
3203 __skb_queue_after(list, old, newsk);
3204 spin_unlock_irqrestore(&list->lock, flags);
3206 EXPORT_SYMBOL(skb_append);
3208 static inline void skb_split_inside_header(struct sk_buff *skb,
3209 struct sk_buff* skb1,
3210 const u32 len, const int pos)
3214 skb_copy_from_linear_data_offset(skb, len, skb_put(skb1, pos - len),
3216 /* And move data appendix as is. */
3217 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++)
3218 skb_shinfo(skb1)->frags[i] = skb_shinfo(skb)->frags[i];
3220 skb_shinfo(skb1)->nr_frags = skb_shinfo(skb)->nr_frags;
3221 skb_shinfo(skb)->nr_frags = 0;
3222 skb1->data_len = skb->data_len;
3223 skb1->len += skb1->data_len;
3226 skb_set_tail_pointer(skb, len);
3229 static inline void skb_split_no_header(struct sk_buff *skb,
3230 struct sk_buff* skb1,
3231 const u32 len, int pos)
3234 const int nfrags = skb_shinfo(skb)->nr_frags;
3236 skb_shinfo(skb)->nr_frags = 0;
3237 skb1->len = skb1->data_len = skb->len - len;
3239 skb->data_len = len - pos;
3241 for (i = 0; i < nfrags; i++) {
3242 int size = skb_frag_size(&skb_shinfo(skb)->frags[i]);
3244 if (pos + size > len) {
3245 skb_shinfo(skb1)->frags[k] = skb_shinfo(skb)->frags[i];
3249 * We have two variants in this case:
3250 * 1. Move all the frag to the second
3251 * part, if it is possible. F.e.
3252 * this approach is mandatory for TUX,
3253 * where splitting is expensive.
3254 * 2. Split is accurately. We make this.
3256 skb_frag_ref(skb, i);
3257 skb_frag_off_add(&skb_shinfo(skb1)->frags[0], len - pos);
3258 skb_frag_size_sub(&skb_shinfo(skb1)->frags[0], len - pos);
3259 skb_frag_size_set(&skb_shinfo(skb)->frags[i], len - pos);
3260 skb_shinfo(skb)->nr_frags++;
3264 skb_shinfo(skb)->nr_frags++;
3267 skb_shinfo(skb1)->nr_frags = k;
3271 * skb_split - Split fragmented skb to two parts at length len.
3272 * @skb: the buffer to split
3273 * @skb1: the buffer to receive the second part
3274 * @len: new length for skb
3276 void skb_split(struct sk_buff *skb, struct sk_buff *skb1, const u32 len)
3278 int pos = skb_headlen(skb);
3280 skb_shinfo(skb1)->tx_flags |= skb_shinfo(skb)->tx_flags &
3282 skb_zerocopy_clone(skb1, skb, 0);
3283 if (len < pos) /* Split line is inside header. */
3284 skb_split_inside_header(skb, skb1, len, pos);
3285 else /* Second chunk has no header, nothing to copy. */
3286 skb_split_no_header(skb, skb1, len, pos);
3288 EXPORT_SYMBOL(skb_split);
3290 /* Shifting from/to a cloned skb is a no-go.
3292 * Caller cannot keep skb_shinfo related pointers past calling here!
3294 static int skb_prepare_for_shift(struct sk_buff *skb)
3298 if (skb_cloned(skb)) {
3299 /* Save and restore truesize: pskb_expand_head() may reallocate
3300 * memory where ksize(kmalloc(S)) != ksize(kmalloc(S)), but we
3301 * cannot change truesize at this point.
3303 unsigned int save_truesize = skb->truesize;
3305 ret = pskb_expand_head(skb, 0, 0, GFP_ATOMIC);
3306 skb->truesize = save_truesize;
3312 * skb_shift - Shifts paged data partially from skb to another
3313 * @tgt: buffer into which tail data gets added
3314 * @skb: buffer from which the paged data comes from
3315 * @shiftlen: shift up to this many bytes
3317 * Attempts to shift up to shiftlen worth of bytes, which may be less than
3318 * the length of the skb, from skb to tgt. Returns number bytes shifted.
3319 * It's up to caller to free skb if everything was shifted.
3321 * If @tgt runs out of frags, the whole operation is aborted.
3323 * Skb cannot include anything else but paged data while tgt is allowed
3324 * to have non-paged data as well.
3326 * TODO: full sized shift could be optimized but that would need
3327 * specialized skb free'er to handle frags without up-to-date nr_frags.
3329 int skb_shift(struct sk_buff *tgt, struct sk_buff *skb, int shiftlen)
3331 int from, to, merge, todo;
3332 skb_frag_t *fragfrom, *fragto;
3334 BUG_ON(shiftlen > skb->len);
3336 if (skb_headlen(skb))
3338 if (skb_zcopy(tgt) || skb_zcopy(skb))
3343 to = skb_shinfo(tgt)->nr_frags;
3344 fragfrom = &skb_shinfo(skb)->frags[from];
3346 /* Actual merge is delayed until the point when we know we can
3347 * commit all, so that we don't have to undo partial changes
3350 !skb_can_coalesce(tgt, to, skb_frag_page(fragfrom),
3351 skb_frag_off(fragfrom))) {
3356 todo -= skb_frag_size(fragfrom);
3358 if (skb_prepare_for_shift(skb) ||
3359 skb_prepare_for_shift(tgt))
3362 /* All previous frag pointers might be stale! */
3363 fragfrom = &skb_shinfo(skb)->frags[from];
3364 fragto = &skb_shinfo(tgt)->frags[merge];
3366 skb_frag_size_add(fragto, shiftlen);
3367 skb_frag_size_sub(fragfrom, shiftlen);
3368 skb_frag_off_add(fragfrom, shiftlen);
3376 /* Skip full, not-fitting skb to avoid expensive operations */
3377 if ((shiftlen == skb->len) &&
3378 (skb_shinfo(skb)->nr_frags - from) > (MAX_SKB_FRAGS - to))
3381 if (skb_prepare_for_shift(skb) || skb_prepare_for_shift(tgt))
3384 while ((todo > 0) && (from < skb_shinfo(skb)->nr_frags)) {
3385 if (to == MAX_SKB_FRAGS)
3388 fragfrom = &skb_shinfo(skb)->frags[from];
3389 fragto = &skb_shinfo(tgt)->frags[to];
3391 if (todo >= skb_frag_size(fragfrom)) {
3392 *fragto = *fragfrom;
3393 todo -= skb_frag_size(fragfrom);
3398 __skb_frag_ref(fragfrom);
3399 skb_frag_page_copy(fragto, fragfrom);
3400 skb_frag_off_copy(fragto, fragfrom);
3401 skb_frag_size_set(fragto, todo);
3403 skb_frag_off_add(fragfrom, todo);
3404 skb_frag_size_sub(fragfrom, todo);
3412 /* Ready to "commit" this state change to tgt */
3413 skb_shinfo(tgt)->nr_frags = to;
3416 fragfrom = &skb_shinfo(skb)->frags[0];
3417 fragto = &skb_shinfo(tgt)->frags[merge];
3419 skb_frag_size_add(fragto, skb_frag_size(fragfrom));
3420 __skb_frag_unref(fragfrom);
3423 /* Reposition in the original skb */
3425 while (from < skb_shinfo(skb)->nr_frags)
3426 skb_shinfo(skb)->frags[to++] = skb_shinfo(skb)->frags[from++];
3427 skb_shinfo(skb)->nr_frags = to;
3429 BUG_ON(todo > 0 && !skb_shinfo(skb)->nr_frags);
3432 /* Most likely the tgt won't ever need its checksum anymore, skb on
3433 * the other hand might need it if it needs to be resent
3435 tgt->ip_summed = CHECKSUM_PARTIAL;
3436 skb->ip_summed = CHECKSUM_PARTIAL;
3438 /* Yak, is it really working this way? Some helper please? */
3439 skb->len -= shiftlen;
3440 skb->data_len -= shiftlen;
3441 skb->truesize -= shiftlen;
3442 tgt->len += shiftlen;
3443 tgt->data_len += shiftlen;
3444 tgt->truesize += shiftlen;
3450 * skb_prepare_seq_read - Prepare a sequential read of skb data
3451 * @skb: the buffer to read
3452 * @from: lower offset of data to be read
3453 * @to: upper offset of data to be read
3454 * @st: state variable
3456 * Initializes the specified state variable. Must be called before
3457 * invoking skb_seq_read() for the first time.
3459 void skb_prepare_seq_read(struct sk_buff *skb, unsigned int from,
3460 unsigned int to, struct skb_seq_state *st)
3462 st->lower_offset = from;
3463 st->upper_offset = to;
3464 st->root_skb = st->cur_skb = skb;
3465 st->frag_idx = st->stepped_offset = 0;
3466 st->frag_data = NULL;
3468 EXPORT_SYMBOL(skb_prepare_seq_read);
3471 * skb_seq_read - Sequentially read skb data
3472 * @consumed: number of bytes consumed by the caller so far
3473 * @data: destination pointer for data to be returned
3474 * @st: state variable
3476 * Reads a block of skb data at @consumed relative to the
3477 * lower offset specified to skb_prepare_seq_read(). Assigns
3478 * the head of the data block to @data and returns the length
3479 * of the block or 0 if the end of the skb data or the upper
3480 * offset has been reached.
3482 * The caller is not required to consume all of the data
3483 * returned, i.e. @consumed is typically set to the number
3484 * of bytes already consumed and the next call to
3485 * skb_seq_read() will return the remaining part of the block.
3487 * Note 1: The size of each block of data returned can be arbitrary,
3488 * this limitation is the cost for zerocopy sequential
3489 * reads of potentially non linear data.
3491 * Note 2: Fragment lists within fragments are not implemented
3492 * at the moment, state->root_skb could be replaced with
3493 * a stack for this purpose.
3495 unsigned int skb_seq_read(unsigned int consumed, const u8 **data,
3496 struct skb_seq_state *st)
3498 unsigned int block_limit, abs_offset = consumed + st->lower_offset;
3501 if (unlikely(abs_offset >= st->upper_offset)) {
3502 if (st->frag_data) {
3503 kunmap_atomic(st->frag_data);
3504 st->frag_data = NULL;
3510 block_limit = skb_headlen(st->cur_skb) + st->stepped_offset;
3512 if (abs_offset < block_limit && !st->frag_data) {
3513 *data = st->cur_skb->data + (abs_offset - st->stepped_offset);
3514 return block_limit - abs_offset;
3517 if (st->frag_idx == 0 && !st->frag_data)
3518 st->stepped_offset += skb_headlen(st->cur_skb);
3520 while (st->frag_idx < skb_shinfo(st->cur_skb)->nr_frags) {
3521 frag = &skb_shinfo(st->cur_skb)->frags[st->frag_idx];
3522 block_limit = skb_frag_size(frag) + st->stepped_offset;
3524 if (abs_offset < block_limit) {
3526 st->frag_data = kmap_atomic(skb_frag_page(frag));
3528 *data = (u8 *) st->frag_data + skb_frag_off(frag) +
3529 (abs_offset - st->stepped_offset);
3531 return block_limit - abs_offset;
3534 if (st->frag_data) {
3535 kunmap_atomic(st->frag_data);
3536 st->frag_data = NULL;
3540 st->stepped_offset += skb_frag_size(frag);
3543 if (st->frag_data) {
3544 kunmap_atomic(st->frag_data);
3545 st->frag_data = NULL;
3548 if (st->root_skb == st->cur_skb && skb_has_frag_list(st->root_skb)) {
3549 st->cur_skb = skb_shinfo(st->root_skb)->frag_list;
3552 } else if (st->cur_skb->next) {
3553 st->cur_skb = st->cur_skb->next;
3560 EXPORT_SYMBOL(skb_seq_read);
3563 * skb_abort_seq_read - Abort a sequential read of skb data
3564 * @st: state variable
3566 * Must be called if skb_seq_read() was not called until it
3569 void skb_abort_seq_read(struct skb_seq_state *st)
3572 kunmap_atomic(st->frag_data);
3574 EXPORT_SYMBOL(skb_abort_seq_read);
3576 #define TS_SKB_CB(state) ((struct skb_seq_state *) &((state)->cb))
3578 static unsigned int skb_ts_get_next_block(unsigned int offset, const u8 **text,
3579 struct ts_config *conf,
3580 struct ts_state *state)
3582 return skb_seq_read(offset, text, TS_SKB_CB(state));
3585 static void skb_ts_finish(struct ts_config *conf, struct ts_state *state)
3587 skb_abort_seq_read(TS_SKB_CB(state));
3591 * skb_find_text - Find a text pattern in skb data
3592 * @skb: the buffer to look in
3593 * @from: search offset
3595 * @config: textsearch configuration
3597 * Finds a pattern in the skb data according to the specified
3598 * textsearch configuration. Use textsearch_next() to retrieve
3599 * subsequent occurrences of the pattern. Returns the offset
3600 * to the first occurrence or UINT_MAX if no match was found.
3602 unsigned int skb_find_text(struct sk_buff *skb, unsigned int from,
3603 unsigned int to, struct ts_config *config)
3605 struct ts_state state;
3608 config->get_next_block = skb_ts_get_next_block;
3609 config->finish = skb_ts_finish;
3611 skb_prepare_seq_read(skb, from, to, TS_SKB_CB(&state));
3613 ret = textsearch_find(config, &state);
3614 return (ret <= to - from ? ret : UINT_MAX);
3616 EXPORT_SYMBOL(skb_find_text);
3618 int skb_append_pagefrags(struct sk_buff *skb, struct page *page,
3619 int offset, size_t size)
3621 int i = skb_shinfo(skb)->nr_frags;
3623 if (skb_can_coalesce(skb, i, page, offset)) {
3624 skb_frag_size_add(&skb_shinfo(skb)->frags[i - 1], size);
3625 } else if (i < MAX_SKB_FRAGS) {
3627 skb_fill_page_desc(skb, i, page, offset, size);
3634 EXPORT_SYMBOL_GPL(skb_append_pagefrags);
3637 * skb_pull_rcsum - pull skb and update receive checksum
3638 * @skb: buffer to update
3639 * @len: length of data pulled
3641 * This function performs an skb_pull on the packet and updates
3642 * the CHECKSUM_COMPLETE checksum. It should be used on
3643 * receive path processing instead of skb_pull unless you know
3644 * that the checksum difference is zero (e.g., a valid IP header)
3645 * or you are setting ip_summed to CHECKSUM_NONE.
3647 void *skb_pull_rcsum(struct sk_buff *skb, unsigned int len)
3649 unsigned char *data = skb->data;
3651 BUG_ON(len > skb->len);
3652 __skb_pull(skb, len);
3653 skb_postpull_rcsum(skb, data, len);
3656 EXPORT_SYMBOL_GPL(skb_pull_rcsum);
3658 static inline skb_frag_t skb_head_frag_to_page_desc(struct sk_buff *frag_skb)
3660 skb_frag_t head_frag;
3663 page = virt_to_head_page(frag_skb->head);
3664 __skb_frag_set_page(&head_frag, page);
3665 skb_frag_off_set(&head_frag, frag_skb->data -
3666 (unsigned char *)page_address(page));
3667 skb_frag_size_set(&head_frag, skb_headlen(frag_skb));
3672 * skb_segment - Perform protocol segmentation on skb.
3673 * @head_skb: buffer to segment
3674 * @features: features for the output path (see dev->features)
3676 * This function performs segmentation on the given skb. It returns
3677 * a pointer to the first in a list of new skbs for the segments.
3678 * In case of error it returns ERR_PTR(err).
3680 struct sk_buff *skb_segment(struct sk_buff *head_skb,
3681 netdev_features_t features)
3683 struct sk_buff *segs = NULL;
3684 struct sk_buff *tail = NULL;
3685 struct sk_buff *list_skb = skb_shinfo(head_skb)->frag_list;
3686 skb_frag_t *frag = skb_shinfo(head_skb)->frags;
3687 unsigned int mss = skb_shinfo(head_skb)->gso_size;
3688 unsigned int doffset = head_skb->data - skb_mac_header(head_skb);
3689 struct sk_buff *frag_skb = head_skb;
3690 unsigned int offset = doffset;
3691 unsigned int tnl_hlen = skb_tnl_header_len(head_skb);
3692 unsigned int partial_segs = 0;
3693 unsigned int headroom;
3694 unsigned int len = head_skb->len;
3697 int nfrags = skb_shinfo(head_skb)->nr_frags;
3703 if (list_skb && !list_skb->head_frag && skb_headlen(list_skb) &&
3704 (skb_shinfo(head_skb)->gso_type & SKB_GSO_DODGY)) {
3705 /* gso_size is untrusted, and we have a frag_list with a linear
3706 * non head_frag head.
3708 * (we assume checking the first list_skb member suffices;
3709 * i.e if either of the list_skb members have non head_frag
3710 * head, then the first one has too).
3712 * If head_skb's headlen does not fit requested gso_size, it
3713 * means that the frag_list members do NOT terminate on exact
3714 * gso_size boundaries. Hence we cannot perform skb_frag_t page
3715 * sharing. Therefore we must fallback to copying the frag_list
3716 * skbs; we do so by disabling SG.
3718 if (mss != GSO_BY_FRAGS && mss != skb_headlen(head_skb))
3719 features &= ~NETIF_F_SG;
3722 __skb_push(head_skb, doffset);
3723 proto = skb_network_protocol(head_skb, &dummy);
3724 if (unlikely(!proto))
3725 return ERR_PTR(-EINVAL);
3727 sg = !!(features & NETIF_F_SG);
3728 csum = !!can_checksum_protocol(features, proto);
3730 if (sg && csum && (mss != GSO_BY_FRAGS)) {
3731 if (!(features & NETIF_F_GSO_PARTIAL)) {
3732 struct sk_buff *iter;
3733 unsigned int frag_len;
3736 !net_gso_ok(features, skb_shinfo(head_skb)->gso_type))
3739 /* If we get here then all the required
3740 * GSO features except frag_list are supported.
3741 * Try to split the SKB to multiple GSO SKBs
3742 * with no frag_list.
3743 * Currently we can do that only when the buffers don't
3744 * have a linear part and all the buffers except
3745 * the last are of the same length.
3747 frag_len = list_skb->len;
3748 skb_walk_frags(head_skb, iter) {
3749 if (frag_len != iter->len && iter->next)
3751 if (skb_headlen(iter) && !iter->head_frag)
3757 if (len != frag_len)
3761 /* GSO partial only requires that we trim off any excess that
3762 * doesn't fit into an MSS sized block, so take care of that
3765 partial_segs = len / mss;
3766 if (partial_segs > 1)
3767 mss *= partial_segs;
3773 headroom = skb_headroom(head_skb);
3774 pos = skb_headlen(head_skb);
3777 struct sk_buff *nskb;
3778 skb_frag_t *nskb_frag;
3782 if (unlikely(mss == GSO_BY_FRAGS)) {
3783 len = list_skb->len;
3785 len = head_skb->len - offset;
3790 hsize = skb_headlen(head_skb) - offset;
3793 if (hsize > len || !sg)
3796 if (!hsize && i >= nfrags && skb_headlen(list_skb) &&
3797 (skb_headlen(list_skb) == len || sg)) {
3798 BUG_ON(skb_headlen(list_skb) > len);
3801 nfrags = skb_shinfo(list_skb)->nr_frags;
3802 frag = skb_shinfo(list_skb)->frags;
3803 frag_skb = list_skb;
3804 pos += skb_headlen(list_skb);
3806 while (pos < offset + len) {
3807 BUG_ON(i >= nfrags);
3809 size = skb_frag_size(frag);
3810 if (pos + size > offset + len)
3818 nskb = skb_clone(list_skb, GFP_ATOMIC);
3819 list_skb = list_skb->next;
3821 if (unlikely(!nskb))
3824 if (unlikely(pskb_trim(nskb, len))) {
3829 hsize = skb_end_offset(nskb);
3830 if (skb_cow_head(nskb, doffset + headroom)) {
3835 nskb->truesize += skb_end_offset(nskb) - hsize;
3836 skb_release_head_state(nskb);
3837 __skb_push(nskb, doffset);
3839 nskb = __alloc_skb(hsize + doffset + headroom,
3840 GFP_ATOMIC, skb_alloc_rx_flag(head_skb),
3843 if (unlikely(!nskb))
3846 skb_reserve(nskb, headroom);
3847 __skb_put(nskb, doffset);
3856 __copy_skb_header(nskb, head_skb);
3858 skb_headers_offset_update(nskb, skb_headroom(nskb) - headroom);
3859 skb_reset_mac_len(nskb);
3861 skb_copy_from_linear_data_offset(head_skb, -tnl_hlen,
3862 nskb->data - tnl_hlen,
3863 doffset + tnl_hlen);
3865 if (nskb->len == len + doffset)
3866 goto perform_csum_check;
3869 if (!nskb->remcsum_offload)
3870 nskb->ip_summed = CHECKSUM_NONE;
3871 SKB_GSO_CB(nskb)->csum =
3872 skb_copy_and_csum_bits(head_skb, offset,
3875 SKB_GSO_CB(nskb)->csum_start =
3876 skb_headroom(nskb) + doffset;
3880 nskb_frag = skb_shinfo(nskb)->frags;
3882 skb_copy_from_linear_data_offset(head_skb, offset,
3883 skb_put(nskb, hsize), hsize);
3885 skb_shinfo(nskb)->tx_flags |= skb_shinfo(head_skb)->tx_flags &
3888 if (skb_orphan_frags(frag_skb, GFP_ATOMIC) ||
3889 skb_zerocopy_clone(nskb, frag_skb, GFP_ATOMIC))
3892 while (pos < offset + len) {
3895 nfrags = skb_shinfo(list_skb)->nr_frags;
3896 frag = skb_shinfo(list_skb)->frags;
3897 frag_skb = list_skb;
3898 if (!skb_headlen(list_skb)) {
3901 BUG_ON(!list_skb->head_frag);
3903 /* to make room for head_frag. */
3907 if (skb_orphan_frags(frag_skb, GFP_ATOMIC) ||
3908 skb_zerocopy_clone(nskb, frag_skb,
3912 list_skb = list_skb->next;
3915 if (unlikely(skb_shinfo(nskb)->nr_frags >=
3917 net_warn_ratelimited(
3918 "skb_segment: too many frags: %u %u\n",
3924 *nskb_frag = (i < 0) ? skb_head_frag_to_page_desc(frag_skb) : *frag;
3925 __skb_frag_ref(nskb_frag);
3926 size = skb_frag_size(nskb_frag);
3929 skb_frag_off_add(nskb_frag, offset - pos);
3930 skb_frag_size_sub(nskb_frag, offset - pos);
3933 skb_shinfo(nskb)->nr_frags++;
3935 if (pos + size <= offset + len) {
3940 skb_frag_size_sub(nskb_frag, pos + size - (offset + len));
3948 nskb->data_len = len - hsize;
3949 nskb->len += nskb->data_len;
3950 nskb->truesize += nskb->data_len;
3954 if (skb_has_shared_frag(nskb) &&
3955 __skb_linearize(nskb))
3958 if (!nskb->remcsum_offload)
3959 nskb->ip_summed = CHECKSUM_NONE;
3960 SKB_GSO_CB(nskb)->csum =
3961 skb_checksum(nskb, doffset,
3962 nskb->len - doffset, 0);
3963 SKB_GSO_CB(nskb)->csum_start =
3964 skb_headroom(nskb) + doffset;
3966 } while ((offset += len) < head_skb->len);
3968 /* Some callers want to get the end of the list.
3969 * Put it in segs->prev to avoid walking the list.
3970 * (see validate_xmit_skb_list() for example)
3975 struct sk_buff *iter;
3976 int type = skb_shinfo(head_skb)->gso_type;
3977 unsigned short gso_size = skb_shinfo(head_skb)->gso_size;
3979 /* Update type to add partial and then remove dodgy if set */
3980 type |= (features & NETIF_F_GSO_PARTIAL) / NETIF_F_GSO_PARTIAL * SKB_GSO_PARTIAL;
3981 type &= ~SKB_GSO_DODGY;
3983 /* Update GSO info and prepare to start updating headers on
3984 * our way back down the stack of protocols.
3986 for (iter = segs; iter; iter = iter->next) {
3987 skb_shinfo(iter)->gso_size = gso_size;
3988 skb_shinfo(iter)->gso_segs = partial_segs;
3989 skb_shinfo(iter)->gso_type = type;
3990 SKB_GSO_CB(iter)->data_offset = skb_headroom(iter) + doffset;
3993 if (tail->len - doffset <= gso_size)
3994 skb_shinfo(tail)->gso_size = 0;
3995 else if (tail != segs)
3996 skb_shinfo(tail)->gso_segs = DIV_ROUND_UP(tail->len - doffset, gso_size);
3999 /* Following permits correct backpressure, for protocols
4000 * using skb_set_owner_w().
4001 * Idea is to tranfert ownership from head_skb to last segment.
4003 if (head_skb->destructor == sock_wfree) {
4004 swap(tail->truesize, head_skb->truesize);
4005 swap(tail->destructor, head_skb->destructor);
4006 swap(tail->sk, head_skb->sk);
4011 kfree_skb_list(segs);
4012 return ERR_PTR(err);
4014 EXPORT_SYMBOL_GPL(skb_segment);
4016 int skb_gro_receive(struct sk_buff *p, struct sk_buff *skb)
4018 struct skb_shared_info *pinfo, *skbinfo = skb_shinfo(skb);
4019 unsigned int offset = skb_gro_offset(skb);
4020 unsigned int headlen = skb_headlen(skb);
4021 unsigned int len = skb_gro_len(skb);
4022 unsigned int delta_truesize;
4025 if (unlikely(p->len + len >= 65536 || NAPI_GRO_CB(skb)->flush))
4028 lp = NAPI_GRO_CB(p)->last;
4029 pinfo = skb_shinfo(lp);
4031 if (headlen <= offset) {
4034 int i = skbinfo->nr_frags;
4035 int nr_frags = pinfo->nr_frags + i;
4037 if (nr_frags > MAX_SKB_FRAGS)
4041 pinfo->nr_frags = nr_frags;
4042 skbinfo->nr_frags = 0;
4044 frag = pinfo->frags + nr_frags;
4045 frag2 = skbinfo->frags + i;
4050 skb_frag_off_add(frag, offset);
4051 skb_frag_size_sub(frag, offset);
4053 /* all fragments truesize : remove (head size + sk_buff) */
4054 delta_truesize = skb->truesize -
4055 SKB_TRUESIZE(skb_end_offset(skb));
4057 skb->truesize -= skb->data_len;
4058 skb->len -= skb->data_len;
4061 NAPI_GRO_CB(skb)->free = NAPI_GRO_FREE;
4063 } else if (skb->head_frag) {
4064 int nr_frags = pinfo->nr_frags;
4065 skb_frag_t *frag = pinfo->frags + nr_frags;
4066 struct page *page = virt_to_head_page(skb->head);
4067 unsigned int first_size = headlen - offset;
4068 unsigned int first_offset;
4070 if (nr_frags + 1 + skbinfo->nr_frags > MAX_SKB_FRAGS)
4073 first_offset = skb->data -
4074 (unsigned char *)page_address(page) +
4077 pinfo->nr_frags = nr_frags + 1 + skbinfo->nr_frags;
4079 __skb_frag_set_page(frag, page);
4080 skb_frag_off_set(frag, first_offset);
4081 skb_frag_size_set(frag, first_size);
4083 memcpy(frag + 1, skbinfo->frags, sizeof(*frag) * skbinfo->nr_frags);
4084 /* We dont need to clear skbinfo->nr_frags here */
4086 delta_truesize = skb->truesize - SKB_DATA_ALIGN(sizeof(struct sk_buff));
4087 NAPI_GRO_CB(skb)->free = NAPI_GRO_FREE_STOLEN_HEAD;
4092 delta_truesize = skb->truesize;
4093 if (offset > headlen) {
4094 unsigned int eat = offset - headlen;
4096 skb_frag_off_add(&skbinfo->frags[0], eat);
4097 skb_frag_size_sub(&skbinfo->frags[0], eat);
4098 skb->data_len -= eat;
4103 __skb_pull(skb, offset);
4105 if (NAPI_GRO_CB(p)->last == p)
4106 skb_shinfo(p)->frag_list = skb;
4108 NAPI_GRO_CB(p)->last->next = skb;
4109 NAPI_GRO_CB(p)->last = skb;
4110 __skb_header_release(skb);
4114 NAPI_GRO_CB(p)->count++;
4116 p->truesize += delta_truesize;
4119 lp->data_len += len;
4120 lp->truesize += delta_truesize;
4123 NAPI_GRO_CB(skb)->same_flow = 1;
4126 EXPORT_SYMBOL_GPL(skb_gro_receive);
4128 #ifdef CONFIG_SKB_EXTENSIONS
4129 #define SKB_EXT_ALIGN_VALUE 8
4130 #define SKB_EXT_CHUNKSIZEOF(x) (ALIGN((sizeof(x)), SKB_EXT_ALIGN_VALUE) / SKB_EXT_ALIGN_VALUE)
4132 static const u8 skb_ext_type_len[] = {
4133 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
4134 [SKB_EXT_BRIDGE_NF] = SKB_EXT_CHUNKSIZEOF(struct nf_bridge_info),
4137 [SKB_EXT_SEC_PATH] = SKB_EXT_CHUNKSIZEOF(struct sec_path),
4139 #if IS_ENABLED(CONFIG_NET_TC_SKB_EXT)
4140 [TC_SKB_EXT] = SKB_EXT_CHUNKSIZEOF(struct tc_skb_ext),
4144 static __always_inline unsigned int skb_ext_total_length(void)
4146 return SKB_EXT_CHUNKSIZEOF(struct skb_ext) +
4147 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
4148 skb_ext_type_len[SKB_EXT_BRIDGE_NF] +
4151 skb_ext_type_len[SKB_EXT_SEC_PATH] +
4153 #if IS_ENABLED(CONFIG_NET_TC_SKB_EXT)
4154 skb_ext_type_len[TC_SKB_EXT] +
4159 static void skb_extensions_init(void)
4161 BUILD_BUG_ON(SKB_EXT_NUM >= 8);
4162 BUILD_BUG_ON(skb_ext_total_length() > 255);
4164 skbuff_ext_cache = kmem_cache_create("skbuff_ext_cache",
4165 SKB_EXT_ALIGN_VALUE * skb_ext_total_length(),
4167 SLAB_HWCACHE_ALIGN|SLAB_PANIC,
4171 static void skb_extensions_init(void) {}
4174 void __init skb_init(void)
4176 skbuff_head_cache = kmem_cache_create_usercopy("skbuff_head_cache",
4177 sizeof(struct sk_buff),
4179 SLAB_HWCACHE_ALIGN|SLAB_PANIC,
4180 offsetof(struct sk_buff, cb),
4181 sizeof_field(struct sk_buff, cb),
4183 skbuff_fclone_cache = kmem_cache_create("skbuff_fclone_cache",
4184 sizeof(struct sk_buff_fclones),
4186 SLAB_HWCACHE_ALIGN|SLAB_PANIC,
4188 skb_extensions_init();
4192 __skb_to_sgvec(struct sk_buff *skb, struct scatterlist *sg, int offset, int len,
4193 unsigned int recursion_level)
4195 int start = skb_headlen(skb);
4196 int i, copy = start - offset;
4197 struct sk_buff *frag_iter;
4200 if (unlikely(recursion_level >= 24))
4206 sg_set_buf(sg, skb->data + offset, copy);
4208 if ((len -= copy) == 0)
4213 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
4216 WARN_ON(start > offset + len);
4218 end = start + skb_frag_size(&skb_shinfo(skb)->frags[i]);
4219 if ((copy = end - offset) > 0) {
4220 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
4221 if (unlikely(elt && sg_is_last(&sg[elt - 1])))
4226 sg_set_page(&sg[elt], skb_frag_page(frag), copy,
4227 skb_frag_off(frag) + offset - start);
4236 skb_walk_frags(skb, frag_iter) {
4239 WARN_ON(start > offset + len);
4241 end = start + frag_iter->len;
4242 if ((copy = end - offset) > 0) {
4243 if (unlikely(elt && sg_is_last(&sg[elt - 1])))
4248 ret = __skb_to_sgvec(frag_iter, sg+elt, offset - start,
4249 copy, recursion_level + 1);
4250 if (unlikely(ret < 0))
4253 if ((len -= copy) == 0)
4264 * skb_to_sgvec - Fill a scatter-gather list from a socket buffer
4265 * @skb: Socket buffer containing the buffers to be mapped
4266 * @sg: The scatter-gather list to map into
4267 * @offset: The offset into the buffer's contents to start mapping
4268 * @len: Length of buffer space to be mapped
4270 * Fill the specified scatter-gather list with mappings/pointers into a
4271 * region of the buffer space attached to a socket buffer. Returns either
4272 * the number of scatterlist items used, or -EMSGSIZE if the contents
4275 int skb_to_sgvec(struct sk_buff *skb, struct scatterlist *sg, int offset, int len)
4277 int nsg = __skb_to_sgvec(skb, sg, offset, len, 0);
4282 sg_mark_end(&sg[nsg - 1]);
4286 EXPORT_SYMBOL_GPL(skb_to_sgvec);
4288 /* As compared with skb_to_sgvec, skb_to_sgvec_nomark only map skb to given
4289 * sglist without mark the sg which contain last skb data as the end.
4290 * So the caller can mannipulate sg list as will when padding new data after
4291 * the first call without calling sg_unmark_end to expend sg list.
4293 * Scenario to use skb_to_sgvec_nomark:
4295 * 2. skb_to_sgvec_nomark(payload1)
4296 * 3. skb_to_sgvec_nomark(payload2)
4298 * This is equivalent to:
4300 * 2. skb_to_sgvec(payload1)
4302 * 4. skb_to_sgvec(payload2)
4304 * When mapping mutilple payload conditionally, skb_to_sgvec_nomark
4305 * is more preferable.
4307 int skb_to_sgvec_nomark(struct sk_buff *skb, struct scatterlist *sg,
4308 int offset, int len)
4310 return __skb_to_sgvec(skb, sg, offset, len, 0);
4312 EXPORT_SYMBOL_GPL(skb_to_sgvec_nomark);
4317 * skb_cow_data - Check that a socket buffer's data buffers are writable
4318 * @skb: The socket buffer to check.
4319 * @tailbits: Amount of trailing space to be added
4320 * @trailer: Returned pointer to the skb where the @tailbits space begins
4322 * Make sure that the data buffers attached to a socket buffer are
4323 * writable. If they are not, private copies are made of the data buffers
4324 * and the socket buffer is set to use these instead.
4326 * If @tailbits is given, make sure that there is space to write @tailbits
4327 * bytes of data beyond current end of socket buffer. @trailer will be
4328 * set to point to the skb in which this space begins.
4330 * The number of scatterlist elements required to completely map the
4331 * COW'd and extended socket buffer will be returned.
4333 int skb_cow_data(struct sk_buff *skb, int tailbits, struct sk_buff **trailer)
4337 struct sk_buff *skb1, **skb_p;
4339 /* If skb is cloned or its head is paged, reallocate
4340 * head pulling out all the pages (pages are considered not writable
4341 * at the moment even if they are anonymous).
4343 if ((skb_cloned(skb) || skb_shinfo(skb)->nr_frags) &&
4344 __pskb_pull_tail(skb, skb_pagelen(skb)-skb_headlen(skb)) == NULL)
4347 /* Easy case. Most of packets will go this way. */
4348 if (!skb_has_frag_list(skb)) {
4349 /* A little of trouble, not enough of space for trailer.
4350 * This should not happen, when stack is tuned to generate
4351 * good frames. OK, on miss we reallocate and reserve even more
4352 * space, 128 bytes is fair. */
4354 if (skb_tailroom(skb) < tailbits &&
4355 pskb_expand_head(skb, 0, tailbits-skb_tailroom(skb)+128, GFP_ATOMIC))
4363 /* Misery. We are in troubles, going to mincer fragments... */
4366 skb_p = &skb_shinfo(skb)->frag_list;
4369 while ((skb1 = *skb_p) != NULL) {
4372 /* The fragment is partially pulled by someone,
4373 * this can happen on input. Copy it and everything
4376 if (skb_shared(skb1))
4379 /* If the skb is the last, worry about trailer. */
4381 if (skb1->next == NULL && tailbits) {
4382 if (skb_shinfo(skb1)->nr_frags ||
4383 skb_has_frag_list(skb1) ||
4384 skb_tailroom(skb1) < tailbits)
4385 ntail = tailbits + 128;
4391 skb_shinfo(skb1)->nr_frags ||
4392 skb_has_frag_list(skb1)) {
4393 struct sk_buff *skb2;
4395 /* Fuck, we are miserable poor guys... */
4397 skb2 = skb_copy(skb1, GFP_ATOMIC);
4399 skb2 = skb_copy_expand(skb1,
4403 if (unlikely(skb2 == NULL))
4407 skb_set_owner_w(skb2, skb1->sk);
4409 /* Looking around. Are we still alive?
4410 * OK, link new skb, drop old one */
4412 skb2->next = skb1->next;
4419 skb_p = &skb1->next;
4424 EXPORT_SYMBOL_GPL(skb_cow_data);
4426 static void sock_rmem_free(struct sk_buff *skb)
4428 struct sock *sk = skb->sk;
4430 atomic_sub(skb->truesize, &sk->sk_rmem_alloc);
4433 static void skb_set_err_queue(struct sk_buff *skb)
4435 /* pkt_type of skbs received on local sockets is never PACKET_OUTGOING.
4436 * So, it is safe to (mis)use it to mark skbs on the error queue.
4438 skb->pkt_type = PACKET_OUTGOING;
4439 BUILD_BUG_ON(PACKET_OUTGOING == 0);
4443 * Note: We dont mem charge error packets (no sk_forward_alloc changes)
4445 int sock_queue_err_skb(struct sock *sk, struct sk_buff *skb)
4447 if (atomic_read(&sk->sk_rmem_alloc) + skb->truesize >=
4448 (unsigned int)READ_ONCE(sk->sk_rcvbuf))
4453 skb->destructor = sock_rmem_free;
4454 atomic_add(skb->truesize, &sk->sk_rmem_alloc);
4455 skb_set_err_queue(skb);
4457 /* before exiting rcu section, make sure dst is refcounted */
4460 skb_queue_tail(&sk->sk_error_queue, skb);
4461 if (!sock_flag(sk, SOCK_DEAD))
4462 sk->sk_error_report(sk);
4465 EXPORT_SYMBOL(sock_queue_err_skb);
4467 static bool is_icmp_err_skb(const struct sk_buff *skb)
4469 return skb && (SKB_EXT_ERR(skb)->ee.ee_origin == SO_EE_ORIGIN_ICMP ||
4470 SKB_EXT_ERR(skb)->ee.ee_origin == SO_EE_ORIGIN_ICMP6);
4473 struct sk_buff *sock_dequeue_err_skb(struct sock *sk)
4475 struct sk_buff_head *q = &sk->sk_error_queue;
4476 struct sk_buff *skb, *skb_next = NULL;
4477 bool icmp_next = false;
4478 unsigned long flags;
4480 spin_lock_irqsave(&q->lock, flags);
4481 skb = __skb_dequeue(q);
4482 if (skb && (skb_next = skb_peek(q))) {
4483 icmp_next = is_icmp_err_skb(skb_next);
4485 sk->sk_err = SKB_EXT_ERR(skb_next)->ee.ee_errno;
4487 spin_unlock_irqrestore(&q->lock, flags);
4489 if (is_icmp_err_skb(skb) && !icmp_next)
4493 sk->sk_error_report(sk);
4497 EXPORT_SYMBOL(sock_dequeue_err_skb);
4500 * skb_clone_sk - create clone of skb, and take reference to socket
4501 * @skb: the skb to clone
4503 * This function creates a clone of a buffer that holds a reference on
4504 * sk_refcnt. Buffers created via this function are meant to be
4505 * returned using sock_queue_err_skb, or free via kfree_skb.
4507 * When passing buffers allocated with this function to sock_queue_err_skb
4508 * it is necessary to wrap the call with sock_hold/sock_put in order to
4509 * prevent the socket from being released prior to being enqueued on
4510 * the sk_error_queue.
4512 struct sk_buff *skb_clone_sk(struct sk_buff *skb)
4514 struct sock *sk = skb->sk;
4515 struct sk_buff *clone;
4517 if (!sk || !refcount_inc_not_zero(&sk->sk_refcnt))
4520 clone = skb_clone(skb, GFP_ATOMIC);
4527 clone->destructor = sock_efree;
4531 EXPORT_SYMBOL(skb_clone_sk);
4533 static void __skb_complete_tx_timestamp(struct sk_buff *skb,
4538 struct sock_exterr_skb *serr;
4541 BUILD_BUG_ON(sizeof(struct sock_exterr_skb) > sizeof(skb->cb));
4543 serr = SKB_EXT_ERR(skb);
4544 memset(serr, 0, sizeof(*serr));
4545 serr->ee.ee_errno = ENOMSG;
4546 serr->ee.ee_origin = SO_EE_ORIGIN_TIMESTAMPING;
4547 serr->ee.ee_info = tstype;
4548 serr->opt_stats = opt_stats;
4549 serr->header.h4.iif = skb->dev ? skb->dev->ifindex : 0;
4550 if (sk->sk_tsflags & SOF_TIMESTAMPING_OPT_ID) {
4551 serr->ee.ee_data = skb_shinfo(skb)->tskey;
4552 if (sk->sk_protocol == IPPROTO_TCP &&
4553 sk->sk_type == SOCK_STREAM)
4554 serr->ee.ee_data -= sk->sk_tskey;
4557 err = sock_queue_err_skb(sk, skb);
4563 static bool skb_may_tx_timestamp(struct sock *sk, bool tsonly)
4567 if (likely(sysctl_tstamp_allow_data || tsonly))
4570 read_lock_bh(&sk->sk_callback_lock);
4571 ret = sk->sk_socket && sk->sk_socket->file &&
4572 file_ns_capable(sk->sk_socket->file, &init_user_ns, CAP_NET_RAW);
4573 read_unlock_bh(&sk->sk_callback_lock);
4577 void skb_complete_tx_timestamp(struct sk_buff *skb,
4578 struct skb_shared_hwtstamps *hwtstamps)
4580 struct sock *sk = skb->sk;
4582 if (!skb_may_tx_timestamp(sk, false))
4585 /* Take a reference to prevent skb_orphan() from freeing the socket,
4586 * but only if the socket refcount is not zero.
4588 if (likely(refcount_inc_not_zero(&sk->sk_refcnt))) {
4589 *skb_hwtstamps(skb) = *hwtstamps;
4590 __skb_complete_tx_timestamp(skb, sk, SCM_TSTAMP_SND, false);
4598 EXPORT_SYMBOL_GPL(skb_complete_tx_timestamp);
4600 void __skb_tstamp_tx(struct sk_buff *orig_skb,
4601 struct skb_shared_hwtstamps *hwtstamps,
4602 struct sock *sk, int tstype)
4604 struct sk_buff *skb;
4605 bool tsonly, opt_stats = false;
4610 if (!hwtstamps && !(sk->sk_tsflags & SOF_TIMESTAMPING_OPT_TX_SWHW) &&
4611 skb_shinfo(orig_skb)->tx_flags & SKBTX_IN_PROGRESS)
4614 tsonly = sk->sk_tsflags & SOF_TIMESTAMPING_OPT_TSONLY;
4615 if (!skb_may_tx_timestamp(sk, tsonly))
4620 if ((sk->sk_tsflags & SOF_TIMESTAMPING_OPT_STATS) &&
4621 sk->sk_protocol == IPPROTO_TCP &&
4622 sk->sk_type == SOCK_STREAM) {
4623 skb = tcp_get_timestamping_opt_stats(sk);
4627 skb = alloc_skb(0, GFP_ATOMIC);
4629 skb = skb_clone(orig_skb, GFP_ATOMIC);
4635 skb_shinfo(skb)->tx_flags |= skb_shinfo(orig_skb)->tx_flags &
4637 skb_shinfo(skb)->tskey = skb_shinfo(orig_skb)->tskey;
4641 *skb_hwtstamps(skb) = *hwtstamps;
4643 skb->tstamp = ktime_get_real();
4645 __skb_complete_tx_timestamp(skb, sk, tstype, opt_stats);
4647 EXPORT_SYMBOL_GPL(__skb_tstamp_tx);
4649 void skb_tstamp_tx(struct sk_buff *orig_skb,
4650 struct skb_shared_hwtstamps *hwtstamps)
4652 return __skb_tstamp_tx(orig_skb, hwtstamps, orig_skb->sk,
4655 EXPORT_SYMBOL_GPL(skb_tstamp_tx);
4657 void skb_complete_wifi_ack(struct sk_buff *skb, bool acked)
4659 struct sock *sk = skb->sk;
4660 struct sock_exterr_skb *serr;
4663 skb->wifi_acked_valid = 1;
4664 skb->wifi_acked = acked;
4666 serr = SKB_EXT_ERR(skb);
4667 memset(serr, 0, sizeof(*serr));
4668 serr->ee.ee_errno = ENOMSG;
4669 serr->ee.ee_origin = SO_EE_ORIGIN_TXSTATUS;
4671 /* Take a reference to prevent skb_orphan() from freeing the socket,
4672 * but only if the socket refcount is not zero.
4674 if (likely(refcount_inc_not_zero(&sk->sk_refcnt))) {
4675 err = sock_queue_err_skb(sk, skb);
4681 EXPORT_SYMBOL_GPL(skb_complete_wifi_ack);
4684 * skb_partial_csum_set - set up and verify partial csum values for packet
4685 * @skb: the skb to set
4686 * @start: the number of bytes after skb->data to start checksumming.
4687 * @off: the offset from start to place the checksum.
4689 * For untrusted partially-checksummed packets, we need to make sure the values
4690 * for skb->csum_start and skb->csum_offset are valid so we don't oops.
4692 * This function checks and sets those values and skb->ip_summed: if this
4693 * returns false you should drop the packet.
4695 bool skb_partial_csum_set(struct sk_buff *skb, u16 start, u16 off)
4697 u32 csum_end = (u32)start + (u32)off + sizeof(__sum16);
4698 u32 csum_start = skb_headroom(skb) + (u32)start;
4700 if (unlikely(csum_start > U16_MAX || csum_end > skb_headlen(skb))) {
4701 net_warn_ratelimited("bad partial csum: csum=%u/%u headroom=%u headlen=%u\n",
4702 start, off, skb_headroom(skb), skb_headlen(skb));
4705 skb->ip_summed = CHECKSUM_PARTIAL;
4706 skb->csum_start = csum_start;
4707 skb->csum_offset = off;
4708 skb_set_transport_header(skb, start);
4711 EXPORT_SYMBOL_GPL(skb_partial_csum_set);
4713 static int skb_maybe_pull_tail(struct sk_buff *skb, unsigned int len,
4716 if (skb_headlen(skb) >= len)
4719 /* If we need to pullup then pullup to the max, so we
4720 * won't need to do it again.
4725 if (__pskb_pull_tail(skb, max - skb_headlen(skb)) == NULL)
4728 if (skb_headlen(skb) < len)
4734 #define MAX_TCP_HDR_LEN (15 * 4)
4736 static __sum16 *skb_checksum_setup_ip(struct sk_buff *skb,
4737 typeof(IPPROTO_IP) proto,
4744 err = skb_maybe_pull_tail(skb, off + sizeof(struct tcphdr),
4745 off + MAX_TCP_HDR_LEN);
4746 if (!err && !skb_partial_csum_set(skb, off,
4747 offsetof(struct tcphdr,
4750 return err ? ERR_PTR(err) : &tcp_hdr(skb)->check;
4753 err = skb_maybe_pull_tail(skb, off + sizeof(struct udphdr),
4754 off + sizeof(struct udphdr));
4755 if (!err && !skb_partial_csum_set(skb, off,
4756 offsetof(struct udphdr,
4759 return err ? ERR_PTR(err) : &udp_hdr(skb)->check;
4762 return ERR_PTR(-EPROTO);
4765 /* This value should be large enough to cover a tagged ethernet header plus
4766 * maximally sized IP and TCP or UDP headers.
4768 #define MAX_IP_HDR_LEN 128
4770 static int skb_checksum_setup_ipv4(struct sk_buff *skb, bool recalculate)
4779 err = skb_maybe_pull_tail(skb,
4780 sizeof(struct iphdr),
4785 if (ip_hdr(skb)->frag_off & htons(IP_OFFSET | IP_MF))
4788 off = ip_hdrlen(skb);
4795 csum = skb_checksum_setup_ip(skb, ip_hdr(skb)->protocol, off);
4797 return PTR_ERR(csum);
4800 *csum = ~csum_tcpudp_magic(ip_hdr(skb)->saddr,
4803 ip_hdr(skb)->protocol, 0);
4810 /* This value should be large enough to cover a tagged ethernet header plus
4811 * an IPv6 header, all options, and a maximal TCP or UDP header.
4813 #define MAX_IPV6_HDR_LEN 256
4815 #define OPT_HDR(type, skb, off) \
4816 (type *)(skb_network_header(skb) + (off))
4818 static int skb_checksum_setup_ipv6(struct sk_buff *skb, bool recalculate)
4831 off = sizeof(struct ipv6hdr);
4833 err = skb_maybe_pull_tail(skb, off, MAX_IPV6_HDR_LEN);
4837 nexthdr = ipv6_hdr(skb)->nexthdr;
4839 len = sizeof(struct ipv6hdr) + ntohs(ipv6_hdr(skb)->payload_len);
4840 while (off <= len && !done) {
4842 case IPPROTO_DSTOPTS:
4843 case IPPROTO_HOPOPTS:
4844 case IPPROTO_ROUTING: {
4845 struct ipv6_opt_hdr *hp;
4847 err = skb_maybe_pull_tail(skb,
4849 sizeof(struct ipv6_opt_hdr),
4854 hp = OPT_HDR(struct ipv6_opt_hdr, skb, off);
4855 nexthdr = hp->nexthdr;
4856 off += ipv6_optlen(hp);
4860 struct ip_auth_hdr *hp;
4862 err = skb_maybe_pull_tail(skb,
4864 sizeof(struct ip_auth_hdr),
4869 hp = OPT_HDR(struct ip_auth_hdr, skb, off);
4870 nexthdr = hp->nexthdr;
4871 off += ipv6_authlen(hp);
4874 case IPPROTO_FRAGMENT: {
4875 struct frag_hdr *hp;
4877 err = skb_maybe_pull_tail(skb,
4879 sizeof(struct frag_hdr),
4884 hp = OPT_HDR(struct frag_hdr, skb, off);
4886 if (hp->frag_off & htons(IP6_OFFSET | IP6_MF))
4889 nexthdr = hp->nexthdr;
4890 off += sizeof(struct frag_hdr);
4901 if (!done || fragment)
4904 csum = skb_checksum_setup_ip(skb, nexthdr, off);
4906 return PTR_ERR(csum);
4909 *csum = ~csum_ipv6_magic(&ipv6_hdr(skb)->saddr,
4910 &ipv6_hdr(skb)->daddr,
4911 skb->len - off, nexthdr, 0);
4919 * skb_checksum_setup - set up partial checksum offset
4920 * @skb: the skb to set up
4921 * @recalculate: if true the pseudo-header checksum will be recalculated
4923 int skb_checksum_setup(struct sk_buff *skb, bool recalculate)
4927 switch (skb->protocol) {
4928 case htons(ETH_P_IP):
4929 err = skb_checksum_setup_ipv4(skb, recalculate);
4932 case htons(ETH_P_IPV6):
4933 err = skb_checksum_setup_ipv6(skb, recalculate);
4943 EXPORT_SYMBOL(skb_checksum_setup);
4946 * skb_checksum_maybe_trim - maybe trims the given skb
4947 * @skb: the skb to check
4948 * @transport_len: the data length beyond the network header
4950 * Checks whether the given skb has data beyond the given transport length.
4951 * If so, returns a cloned skb trimmed to this transport length.
4952 * Otherwise returns the provided skb. Returns NULL in error cases
4953 * (e.g. transport_len exceeds skb length or out-of-memory).
4955 * Caller needs to set the skb transport header and free any returned skb if it
4956 * differs from the provided skb.
4958 static struct sk_buff *skb_checksum_maybe_trim(struct sk_buff *skb,
4959 unsigned int transport_len)
4961 struct sk_buff *skb_chk;
4962 unsigned int len = skb_transport_offset(skb) + transport_len;
4967 else if (skb->len == len)
4970 skb_chk = skb_clone(skb, GFP_ATOMIC);
4974 ret = pskb_trim_rcsum(skb_chk, len);
4984 * skb_checksum_trimmed - validate checksum of an skb
4985 * @skb: the skb to check
4986 * @transport_len: the data length beyond the network header
4987 * @skb_chkf: checksum function to use
4989 * Applies the given checksum function skb_chkf to the provided skb.
4990 * Returns a checked and maybe trimmed skb. Returns NULL on error.
4992 * If the skb has data beyond the given transport length, then a
4993 * trimmed & cloned skb is checked and returned.
4995 * Caller needs to set the skb transport header and free any returned skb if it
4996 * differs from the provided skb.
4998 struct sk_buff *skb_checksum_trimmed(struct sk_buff *skb,
4999 unsigned int transport_len,
5000 __sum16(*skb_chkf)(struct sk_buff *skb))
5002 struct sk_buff *skb_chk;
5003 unsigned int offset = skb_transport_offset(skb);
5006 skb_chk = skb_checksum_maybe_trim(skb, transport_len);
5010 if (!pskb_may_pull(skb_chk, offset))
5013 skb_pull_rcsum(skb_chk, offset);
5014 ret = skb_chkf(skb_chk);
5015 skb_push_rcsum(skb_chk, offset);
5023 if (skb_chk && skb_chk != skb)
5029 EXPORT_SYMBOL(skb_checksum_trimmed);
5031 void __skb_warn_lro_forwarding(const struct sk_buff *skb)
5033 net_warn_ratelimited("%s: received packets cannot be forwarded while LRO is enabled\n",
5036 EXPORT_SYMBOL(__skb_warn_lro_forwarding);
5038 void kfree_skb_partial(struct sk_buff *skb, bool head_stolen)
5041 skb_release_head_state(skb);
5042 kmem_cache_free(skbuff_head_cache, skb);
5047 EXPORT_SYMBOL(kfree_skb_partial);
5050 * skb_try_coalesce - try to merge skb to prior one
5052 * @from: buffer to add
5053 * @fragstolen: pointer to boolean
5054 * @delta_truesize: how much more was allocated than was requested
5056 bool skb_try_coalesce(struct sk_buff *to, struct sk_buff *from,
5057 bool *fragstolen, int *delta_truesize)
5059 struct skb_shared_info *to_shinfo, *from_shinfo;
5060 int i, delta, len = from->len;
5062 *fragstolen = false;
5067 if (len <= skb_tailroom(to)) {
5069 BUG_ON(skb_copy_bits(from, 0, skb_put(to, len), len));
5070 *delta_truesize = 0;
5074 to_shinfo = skb_shinfo(to);
5075 from_shinfo = skb_shinfo(from);
5076 if (to_shinfo->frag_list || from_shinfo->frag_list)
5078 if (skb_zcopy(to) || skb_zcopy(from))
5081 if (skb_headlen(from) != 0) {
5083 unsigned int offset;
5085 if (to_shinfo->nr_frags +
5086 from_shinfo->nr_frags >= MAX_SKB_FRAGS)
5089 if (skb_head_is_locked(from))
5092 delta = from->truesize - SKB_DATA_ALIGN(sizeof(struct sk_buff));
5094 page = virt_to_head_page(from->head);
5095 offset = from->data - (unsigned char *)page_address(page);
5097 skb_fill_page_desc(to, to_shinfo->nr_frags,
5098 page, offset, skb_headlen(from));
5101 if (to_shinfo->nr_frags +
5102 from_shinfo->nr_frags > MAX_SKB_FRAGS)
5105 delta = from->truesize - SKB_TRUESIZE(skb_end_offset(from));
5108 WARN_ON_ONCE(delta < len);
5110 memcpy(to_shinfo->frags + to_shinfo->nr_frags,
5112 from_shinfo->nr_frags * sizeof(skb_frag_t));
5113 to_shinfo->nr_frags += from_shinfo->nr_frags;
5115 if (!skb_cloned(from))
5116 from_shinfo->nr_frags = 0;
5118 /* if the skb is not cloned this does nothing
5119 * since we set nr_frags to 0.
5121 for (i = 0; i < from_shinfo->nr_frags; i++)
5122 __skb_frag_ref(&from_shinfo->frags[i]);
5124 to->truesize += delta;
5126 to->data_len += len;
5128 *delta_truesize = delta;
5131 EXPORT_SYMBOL(skb_try_coalesce);
5134 * skb_scrub_packet - scrub an skb
5136 * @skb: buffer to clean
5137 * @xnet: packet is crossing netns
5139 * skb_scrub_packet can be used after encapsulating or decapsulting a packet
5140 * into/from a tunnel. Some information have to be cleared during these
5142 * skb_scrub_packet can also be used to clean a skb before injecting it in
5143 * another namespace (@xnet == true). We have to clear all information in the
5144 * skb that could impact namespace isolation.
5146 void skb_scrub_packet(struct sk_buff *skb, bool xnet)
5148 skb->pkt_type = PACKET_HOST;
5154 nf_reset_trace(skb);
5156 #ifdef CONFIG_NET_SWITCHDEV
5157 skb->offload_fwd_mark = 0;
5158 skb->offload_l3_fwd_mark = 0;
5168 EXPORT_SYMBOL_GPL(skb_scrub_packet);
5171 * skb_gso_transport_seglen - Return length of individual segments of a gso packet
5175 * skb_gso_transport_seglen is used to determine the real size of the
5176 * individual segments, including Layer4 headers (TCP/UDP).
5178 * The MAC/L2 or network (IP, IPv6) headers are not accounted for.
5180 static unsigned int skb_gso_transport_seglen(const struct sk_buff *skb)
5182 const struct skb_shared_info *shinfo = skb_shinfo(skb);
5183 unsigned int thlen = 0;
5185 if (skb->encapsulation) {
5186 thlen = skb_inner_transport_header(skb) -
5187 skb_transport_header(skb);
5189 if (likely(shinfo->gso_type & (SKB_GSO_TCPV4 | SKB_GSO_TCPV6)))
5190 thlen += inner_tcp_hdrlen(skb);
5191 } else if (likely(shinfo->gso_type & (SKB_GSO_TCPV4 | SKB_GSO_TCPV6))) {
5192 thlen = tcp_hdrlen(skb);
5193 } else if (unlikely(skb_is_gso_sctp(skb))) {
5194 thlen = sizeof(struct sctphdr);
5195 } else if (shinfo->gso_type & SKB_GSO_UDP_L4) {
5196 thlen = sizeof(struct udphdr);
5198 /* UFO sets gso_size to the size of the fragmentation
5199 * payload, i.e. the size of the L4 (UDP) header is already
5202 return thlen + shinfo->gso_size;
5206 * skb_gso_network_seglen - Return length of individual segments of a gso packet
5210 * skb_gso_network_seglen is used to determine the real size of the
5211 * individual segments, including Layer3 (IP, IPv6) and L4 headers (TCP/UDP).
5213 * The MAC/L2 header is not accounted for.
5215 static unsigned int skb_gso_network_seglen(const struct sk_buff *skb)
5217 unsigned int hdr_len = skb_transport_header(skb) -
5218 skb_network_header(skb);
5220 return hdr_len + skb_gso_transport_seglen(skb);
5224 * skb_gso_mac_seglen - Return length of individual segments of a gso packet
5228 * skb_gso_mac_seglen is used to determine the real size of the
5229 * individual segments, including MAC/L2, Layer3 (IP, IPv6) and L4
5230 * headers (TCP/UDP).
5232 static unsigned int skb_gso_mac_seglen(const struct sk_buff *skb)
5234 unsigned int hdr_len = skb_transport_header(skb) - skb_mac_header(skb);
5236 return hdr_len + skb_gso_transport_seglen(skb);
5240 * skb_gso_size_check - check the skb size, considering GSO_BY_FRAGS
5242 * There are a couple of instances where we have a GSO skb, and we
5243 * want to determine what size it would be after it is segmented.
5245 * We might want to check:
5246 * - L3+L4+payload size (e.g. IP forwarding)
5247 * - L2+L3+L4+payload size (e.g. sanity check before passing to driver)
5249 * This is a helper to do that correctly considering GSO_BY_FRAGS.
5253 * @seg_len: The segmented length (from skb_gso_*_seglen). In the
5254 * GSO_BY_FRAGS case this will be [header sizes + GSO_BY_FRAGS].
5256 * @max_len: The maximum permissible length.
5258 * Returns true if the segmented length <= max length.
5260 static inline bool skb_gso_size_check(const struct sk_buff *skb,
5261 unsigned int seg_len,
5262 unsigned int max_len) {
5263 const struct skb_shared_info *shinfo = skb_shinfo(skb);
5264 const struct sk_buff *iter;
5266 if (shinfo->gso_size != GSO_BY_FRAGS)
5267 return seg_len <= max_len;
5269 /* Undo this so we can re-use header sizes */
5270 seg_len -= GSO_BY_FRAGS;
5272 skb_walk_frags(skb, iter) {
5273 if (seg_len + skb_headlen(iter) > max_len)
5281 * skb_gso_validate_network_len - Will a split GSO skb fit into a given MTU?
5284 * @mtu: MTU to validate against
5286 * skb_gso_validate_network_len validates if a given skb will fit a
5287 * wanted MTU once split. It considers L3 headers, L4 headers, and the
5290 bool skb_gso_validate_network_len(const struct sk_buff *skb, unsigned int mtu)
5292 return skb_gso_size_check(skb, skb_gso_network_seglen(skb), mtu);
5294 EXPORT_SYMBOL_GPL(skb_gso_validate_network_len);
5297 * skb_gso_validate_mac_len - Will a split GSO skb fit in a given length?
5300 * @len: length to validate against
5302 * skb_gso_validate_mac_len validates if a given skb will fit a wanted
5303 * length once split, including L2, L3 and L4 headers and the payload.
5305 bool skb_gso_validate_mac_len(const struct sk_buff *skb, unsigned int len)
5307 return skb_gso_size_check(skb, skb_gso_mac_seglen(skb), len);
5309 EXPORT_SYMBOL_GPL(skb_gso_validate_mac_len);
5311 static struct sk_buff *skb_reorder_vlan_header(struct sk_buff *skb)
5313 int mac_len, meta_len;
5316 if (skb_cow(skb, skb_headroom(skb)) < 0) {
5321 mac_len = skb->data - skb_mac_header(skb);
5322 if (likely(mac_len > VLAN_HLEN + ETH_TLEN)) {
5323 memmove(skb_mac_header(skb) + VLAN_HLEN, skb_mac_header(skb),
5324 mac_len - VLAN_HLEN - ETH_TLEN);
5327 meta_len = skb_metadata_len(skb);
5329 meta = skb_metadata_end(skb) - meta_len;
5330 memmove(meta + VLAN_HLEN, meta, meta_len);
5333 skb->mac_header += VLAN_HLEN;
5337 struct sk_buff *skb_vlan_untag(struct sk_buff *skb)
5339 struct vlan_hdr *vhdr;
5342 if (unlikely(skb_vlan_tag_present(skb))) {
5343 /* vlan_tci is already set-up so leave this for another time */
5347 skb = skb_share_check(skb, GFP_ATOMIC);
5350 /* We may access the two bytes after vlan_hdr in vlan_set_encap_proto(). */
5351 if (unlikely(!pskb_may_pull(skb, VLAN_HLEN + sizeof(unsigned short))))
5354 vhdr = (struct vlan_hdr *)skb->data;
5355 vlan_tci = ntohs(vhdr->h_vlan_TCI);
5356 __vlan_hwaccel_put_tag(skb, skb->protocol, vlan_tci);
5358 skb_pull_rcsum(skb, VLAN_HLEN);
5359 vlan_set_encap_proto(skb, vhdr);
5361 skb = skb_reorder_vlan_header(skb);
5365 skb_reset_network_header(skb);
5366 skb_reset_transport_header(skb);
5367 skb_reset_mac_len(skb);
5375 EXPORT_SYMBOL(skb_vlan_untag);
5377 int skb_ensure_writable(struct sk_buff *skb, int write_len)
5379 if (!pskb_may_pull(skb, write_len))
5382 if (!skb_cloned(skb) || skb_clone_writable(skb, write_len))
5385 return pskb_expand_head(skb, 0, 0, GFP_ATOMIC);
5387 EXPORT_SYMBOL(skb_ensure_writable);
5389 /* remove VLAN header from packet and update csum accordingly.
5390 * expects a non skb_vlan_tag_present skb with a vlan tag payload
5392 int __skb_vlan_pop(struct sk_buff *skb, u16 *vlan_tci)
5394 struct vlan_hdr *vhdr;
5395 int offset = skb->data - skb_mac_header(skb);
5398 if (WARN_ONCE(offset,
5399 "__skb_vlan_pop got skb with skb->data not at mac header (offset %d)\n",
5404 err = skb_ensure_writable(skb, VLAN_ETH_HLEN);
5408 skb_postpull_rcsum(skb, skb->data + (2 * ETH_ALEN), VLAN_HLEN);
5410 vhdr = (struct vlan_hdr *)(skb->data + ETH_HLEN);
5411 *vlan_tci = ntohs(vhdr->h_vlan_TCI);
5413 memmove(skb->data + VLAN_HLEN, skb->data, 2 * ETH_ALEN);
5414 __skb_pull(skb, VLAN_HLEN);
5416 vlan_set_encap_proto(skb, vhdr);
5417 skb->mac_header += VLAN_HLEN;
5419 if (skb_network_offset(skb) < ETH_HLEN)
5420 skb_set_network_header(skb, ETH_HLEN);
5422 skb_reset_mac_len(skb);
5426 EXPORT_SYMBOL(__skb_vlan_pop);
5428 /* Pop a vlan tag either from hwaccel or from payload.
5429 * Expects skb->data at mac header.
5431 int skb_vlan_pop(struct sk_buff *skb)
5437 if (likely(skb_vlan_tag_present(skb))) {
5438 __vlan_hwaccel_clear_tag(skb);
5440 if (unlikely(!eth_type_vlan(skb->protocol)))
5443 err = __skb_vlan_pop(skb, &vlan_tci);
5447 /* move next vlan tag to hw accel tag */
5448 if (likely(!eth_type_vlan(skb->protocol)))
5451 vlan_proto = skb->protocol;
5452 err = __skb_vlan_pop(skb, &vlan_tci);
5456 __vlan_hwaccel_put_tag(skb, vlan_proto, vlan_tci);
5459 EXPORT_SYMBOL(skb_vlan_pop);
5461 /* Push a vlan tag either into hwaccel or into payload (if hwaccel tag present).
5462 * Expects skb->data at mac header.
5464 int skb_vlan_push(struct sk_buff *skb, __be16 vlan_proto, u16 vlan_tci)
5466 if (skb_vlan_tag_present(skb)) {
5467 int offset = skb->data - skb_mac_header(skb);
5470 if (WARN_ONCE(offset,
5471 "skb_vlan_push got skb with skb->data not at mac header (offset %d)\n",
5476 err = __vlan_insert_tag(skb, skb->vlan_proto,
5477 skb_vlan_tag_get(skb));
5481 skb->protocol = skb->vlan_proto;
5482 skb->mac_len += VLAN_HLEN;
5484 skb_postpush_rcsum(skb, skb->data + (2 * ETH_ALEN), VLAN_HLEN);
5486 __vlan_hwaccel_put_tag(skb, vlan_proto, vlan_tci);
5489 EXPORT_SYMBOL(skb_vlan_push);
5491 /* Update the ethertype of hdr and the skb csum value if required. */
5492 static void skb_mod_eth_type(struct sk_buff *skb, struct ethhdr *hdr,
5495 if (skb->ip_summed == CHECKSUM_COMPLETE) {
5496 __be16 diff[] = { ~hdr->h_proto, ethertype };
5498 skb->csum = csum_partial((char *)diff, sizeof(diff), skb->csum);
5501 hdr->h_proto = ethertype;
5505 * skb_mpls_push() - push a new MPLS header after the mac header
5508 * @mpls_lse: MPLS label stack entry to push
5509 * @mpls_proto: ethertype of the new MPLS header (expects 0x8847 or 0x8848)
5510 * @mac_len: length of the MAC header
5512 * Expects skb->data at mac header.
5514 * Returns 0 on success, -errno otherwise.
5516 int skb_mpls_push(struct sk_buff *skb, __be32 mpls_lse, __be16 mpls_proto,
5517 int mac_len, bool ethernet)
5519 struct mpls_shim_hdr *lse;
5522 if (unlikely(!eth_p_mpls(mpls_proto)))
5525 /* Networking stack does not allow simultaneous Tunnel and MPLS GSO. */
5526 if (skb->encapsulation)
5529 err = skb_cow_head(skb, MPLS_HLEN);
5533 if (!skb->inner_protocol) {
5534 skb_set_inner_network_header(skb, mac_len);
5535 skb_set_inner_protocol(skb, skb->protocol);
5538 skb_push(skb, MPLS_HLEN);
5539 memmove(skb_mac_header(skb) - MPLS_HLEN, skb_mac_header(skb),
5541 skb_reset_mac_header(skb);
5542 skb_set_network_header(skb, mac_len);
5544 lse = mpls_hdr(skb);
5545 lse->label_stack_entry = mpls_lse;
5546 skb_postpush_rcsum(skb, lse, MPLS_HLEN);
5548 if (ethernet && mac_len >= ETH_HLEN)
5549 skb_mod_eth_type(skb, eth_hdr(skb), mpls_proto);
5550 skb->protocol = mpls_proto;
5554 EXPORT_SYMBOL_GPL(skb_mpls_push);
5557 * skb_mpls_pop() - pop the outermost MPLS header
5560 * @next_proto: ethertype of header after popped MPLS header
5561 * @mac_len: length of the MAC header
5562 * @ethernet: flag to indicate if ethernet header is present in packet
5564 * Expects skb->data at mac header.
5566 * Returns 0 on success, -errno otherwise.
5568 int skb_mpls_pop(struct sk_buff *skb, __be16 next_proto, int mac_len,
5573 if (unlikely(!eth_p_mpls(skb->protocol)))
5576 err = skb_ensure_writable(skb, mac_len + MPLS_HLEN);
5580 skb_postpull_rcsum(skb, mpls_hdr(skb), MPLS_HLEN);
5581 memmove(skb_mac_header(skb) + MPLS_HLEN, skb_mac_header(skb),
5584 __skb_pull(skb, MPLS_HLEN);
5585 skb_reset_mac_header(skb);
5586 skb_set_network_header(skb, mac_len);
5588 if (ethernet && mac_len >= ETH_HLEN) {
5591 /* use mpls_hdr() to get ethertype to account for VLANs. */
5592 hdr = (struct ethhdr *)((void *)mpls_hdr(skb) - ETH_HLEN);
5593 skb_mod_eth_type(skb, hdr, next_proto);
5595 skb->protocol = next_proto;
5599 EXPORT_SYMBOL_GPL(skb_mpls_pop);
5602 * skb_mpls_update_lse() - modify outermost MPLS header and update csum
5605 * @mpls_lse: new MPLS label stack entry to update to
5607 * Expects skb->data at mac header.
5609 * Returns 0 on success, -errno otherwise.
5611 int skb_mpls_update_lse(struct sk_buff *skb, __be32 mpls_lse)
5615 if (unlikely(!eth_p_mpls(skb->protocol)))
5618 err = skb_ensure_writable(skb, skb->mac_len + MPLS_HLEN);
5622 if (skb->ip_summed == CHECKSUM_COMPLETE) {
5623 __be32 diff[] = { ~mpls_hdr(skb)->label_stack_entry, mpls_lse };
5625 skb->csum = csum_partial((char *)diff, sizeof(diff), skb->csum);
5628 mpls_hdr(skb)->label_stack_entry = mpls_lse;
5632 EXPORT_SYMBOL_GPL(skb_mpls_update_lse);
5635 * skb_mpls_dec_ttl() - decrement the TTL of the outermost MPLS header
5639 * Expects skb->data at mac header.
5641 * Returns 0 on success, -errno otherwise.
5643 int skb_mpls_dec_ttl(struct sk_buff *skb)
5648 if (unlikely(!eth_p_mpls(skb->protocol)))
5651 if (!pskb_may_pull(skb, skb_network_offset(skb) + MPLS_HLEN))
5654 lse = be32_to_cpu(mpls_hdr(skb)->label_stack_entry);
5655 ttl = (lse & MPLS_LS_TTL_MASK) >> MPLS_LS_TTL_SHIFT;
5659 lse &= ~MPLS_LS_TTL_MASK;
5660 lse |= ttl << MPLS_LS_TTL_SHIFT;
5662 return skb_mpls_update_lse(skb, cpu_to_be32(lse));
5664 EXPORT_SYMBOL_GPL(skb_mpls_dec_ttl);
5667 * alloc_skb_with_frags - allocate skb with page frags
5669 * @header_len: size of linear part
5670 * @data_len: needed length in frags
5671 * @max_page_order: max page order desired.
5672 * @errcode: pointer to error code if any
5673 * @gfp_mask: allocation mask
5675 * This can be used to allocate a paged skb, given a maximal order for frags.
5677 struct sk_buff *alloc_skb_with_frags(unsigned long header_len,
5678 unsigned long data_len,
5683 int npages = (data_len + (PAGE_SIZE - 1)) >> PAGE_SHIFT;
5684 unsigned long chunk;
5685 struct sk_buff *skb;
5689 *errcode = -EMSGSIZE;
5690 /* Note this test could be relaxed, if we succeed to allocate
5691 * high order pages...
5693 if (npages > MAX_SKB_FRAGS)
5696 *errcode = -ENOBUFS;
5697 skb = alloc_skb(header_len, gfp_mask);
5701 skb->truesize += npages << PAGE_SHIFT;
5703 for (i = 0; npages > 0; i++) {
5704 int order = max_page_order;
5707 if (npages >= 1 << order) {
5708 page = alloc_pages((gfp_mask & ~__GFP_DIRECT_RECLAIM) |
5714 /* Do not retry other high order allocations */
5720 page = alloc_page(gfp_mask);
5724 chunk = min_t(unsigned long, data_len,
5725 PAGE_SIZE << order);
5726 skb_fill_page_desc(skb, i, page, 0, chunk);
5728 npages -= 1 << order;
5736 EXPORT_SYMBOL(alloc_skb_with_frags);
5738 /* carve out the first off bytes from skb when off < headlen */
5739 static int pskb_carve_inside_header(struct sk_buff *skb, const u32 off,
5740 const int headlen, gfp_t gfp_mask)
5743 int size = skb_end_offset(skb);
5744 int new_hlen = headlen - off;
5747 size = SKB_DATA_ALIGN(size);
5749 if (skb_pfmemalloc(skb))
5750 gfp_mask |= __GFP_MEMALLOC;
5751 data = kmalloc_reserve(size +
5752 SKB_DATA_ALIGN(sizeof(struct skb_shared_info)),
5753 gfp_mask, NUMA_NO_NODE, NULL);
5757 size = SKB_WITH_OVERHEAD(ksize(data));
5759 /* Copy real data, and all frags */
5760 skb_copy_from_linear_data_offset(skb, off, data, new_hlen);
5763 memcpy((struct skb_shared_info *)(data + size),
5765 offsetof(struct skb_shared_info,
5766 frags[skb_shinfo(skb)->nr_frags]));
5767 if (skb_cloned(skb)) {
5768 /* drop the old head gracefully */
5769 if (skb_orphan_frags(skb, gfp_mask)) {
5773 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++)
5774 skb_frag_ref(skb, i);
5775 if (skb_has_frag_list(skb))
5776 skb_clone_fraglist(skb);
5777 skb_release_data(skb);
5779 /* we can reuse existing recount- all we did was
5788 #ifdef NET_SKBUFF_DATA_USES_OFFSET
5791 skb->end = skb->head + size;
5793 skb_set_tail_pointer(skb, skb_headlen(skb));
5794 skb_headers_offset_update(skb, 0);
5798 atomic_set(&skb_shinfo(skb)->dataref, 1);
5803 static int pskb_carve(struct sk_buff *skb, const u32 off, gfp_t gfp);
5805 /* carve out the first eat bytes from skb's frag_list. May recurse into
5808 static int pskb_carve_frag_list(struct sk_buff *skb,
5809 struct skb_shared_info *shinfo, int eat,
5812 struct sk_buff *list = shinfo->frag_list;
5813 struct sk_buff *clone = NULL;
5814 struct sk_buff *insp = NULL;
5818 pr_err("Not enough bytes to eat. Want %d\n", eat);
5821 if (list->len <= eat) {
5822 /* Eaten as whole. */
5827 /* Eaten partially. */
5828 if (skb_shared(list)) {
5829 clone = skb_clone(list, gfp_mask);
5835 /* This may be pulled without problems. */
5838 if (pskb_carve(list, eat, gfp_mask) < 0) {
5846 /* Free pulled out fragments. */
5847 while ((list = shinfo->frag_list) != insp) {
5848 shinfo->frag_list = list->next;
5851 /* And insert new clone at head. */
5854 shinfo->frag_list = clone;
5859 /* carve off first len bytes from skb. Split line (off) is in the
5860 * non-linear part of skb
5862 static int pskb_carve_inside_nonlinear(struct sk_buff *skb, const u32 off,
5863 int pos, gfp_t gfp_mask)
5866 int size = skb_end_offset(skb);
5868 const int nfrags = skb_shinfo(skb)->nr_frags;
5869 struct skb_shared_info *shinfo;
5871 size = SKB_DATA_ALIGN(size);
5873 if (skb_pfmemalloc(skb))
5874 gfp_mask |= __GFP_MEMALLOC;
5875 data = kmalloc_reserve(size +
5876 SKB_DATA_ALIGN(sizeof(struct skb_shared_info)),
5877 gfp_mask, NUMA_NO_NODE, NULL);
5881 size = SKB_WITH_OVERHEAD(ksize(data));
5883 memcpy((struct skb_shared_info *)(data + size),
5884 skb_shinfo(skb), offsetof(struct skb_shared_info,
5885 frags[skb_shinfo(skb)->nr_frags]));
5886 if (skb_orphan_frags(skb, gfp_mask)) {
5890 shinfo = (struct skb_shared_info *)(data + size);
5891 for (i = 0; i < nfrags; i++) {
5892 int fsize = skb_frag_size(&skb_shinfo(skb)->frags[i]);
5894 if (pos + fsize > off) {
5895 shinfo->frags[k] = skb_shinfo(skb)->frags[i];
5899 * We have two variants in this case:
5900 * 1. Move all the frag to the second
5901 * part, if it is possible. F.e.
5902 * this approach is mandatory for TUX,
5903 * where splitting is expensive.
5904 * 2. Split is accurately. We make this.
5906 skb_frag_off_add(&shinfo->frags[0], off - pos);
5907 skb_frag_size_sub(&shinfo->frags[0], off - pos);
5909 skb_frag_ref(skb, i);
5914 shinfo->nr_frags = k;
5915 if (skb_has_frag_list(skb))
5916 skb_clone_fraglist(skb);
5918 /* split line is in frag list */
5919 if (k == 0 && pskb_carve_frag_list(skb, shinfo, off - pos, gfp_mask)) {
5920 /* skb_frag_unref() is not needed here as shinfo->nr_frags = 0. */
5921 if (skb_has_frag_list(skb))
5922 kfree_skb_list(skb_shinfo(skb)->frag_list);
5926 skb_release_data(skb);
5931 #ifdef NET_SKBUFF_DATA_USES_OFFSET
5934 skb->end = skb->head + size;
5936 skb_reset_tail_pointer(skb);
5937 skb_headers_offset_update(skb, 0);
5942 skb->data_len = skb->len;
5943 atomic_set(&skb_shinfo(skb)->dataref, 1);
5947 /* remove len bytes from the beginning of the skb */
5948 static int pskb_carve(struct sk_buff *skb, const u32 len, gfp_t gfp)
5950 int headlen = skb_headlen(skb);
5953 return pskb_carve_inside_header(skb, len, headlen, gfp);
5955 return pskb_carve_inside_nonlinear(skb, len, headlen, gfp);
5958 /* Extract to_copy bytes starting at off from skb, and return this in
5961 struct sk_buff *pskb_extract(struct sk_buff *skb, int off,
5962 int to_copy, gfp_t gfp)
5964 struct sk_buff *clone = skb_clone(skb, gfp);
5969 if (pskb_carve(clone, off, gfp) < 0 ||
5970 pskb_trim(clone, to_copy)) {
5976 EXPORT_SYMBOL(pskb_extract);
5979 * skb_condense - try to get rid of fragments/frag_list if possible
5982 * Can be used to save memory before skb is added to a busy queue.
5983 * If packet has bytes in frags and enough tail room in skb->head,
5984 * pull all of them, so that we can free the frags right now and adjust
5987 * We do not reallocate skb->head thus can not fail.
5988 * Caller must re-evaluate skb->truesize if needed.
5990 void skb_condense(struct sk_buff *skb)
5992 if (skb->data_len) {
5993 if (skb->data_len > skb->end - skb->tail ||
5997 /* Nice, we can free page frag(s) right now */
5998 __pskb_pull_tail(skb, skb->data_len);
6000 /* At this point, skb->truesize might be over estimated,
6001 * because skb had a fragment, and fragments do not tell
6003 * When we pulled its content into skb->head, fragment
6004 * was freed, but __pskb_pull_tail() could not possibly
6005 * adjust skb->truesize, not knowing the frag truesize.
6007 skb->truesize = SKB_TRUESIZE(skb_end_offset(skb));
6010 #ifdef CONFIG_SKB_EXTENSIONS
6011 static void *skb_ext_get_ptr(struct skb_ext *ext, enum skb_ext_id id)
6013 return (void *)ext + (ext->offset[id] * SKB_EXT_ALIGN_VALUE);
6016 static struct skb_ext *skb_ext_alloc(void)
6018 struct skb_ext *new = kmem_cache_alloc(skbuff_ext_cache, GFP_ATOMIC);
6021 memset(new->offset, 0, sizeof(new->offset));
6022 refcount_set(&new->refcnt, 1);
6028 static struct skb_ext *skb_ext_maybe_cow(struct skb_ext *old,
6029 unsigned int old_active)
6031 struct skb_ext *new;
6033 if (refcount_read(&old->refcnt) == 1)
6036 new = kmem_cache_alloc(skbuff_ext_cache, GFP_ATOMIC);
6040 memcpy(new, old, old->chunks * SKB_EXT_ALIGN_VALUE);
6041 refcount_set(&new->refcnt, 1);
6044 if (old_active & (1 << SKB_EXT_SEC_PATH)) {
6045 struct sec_path *sp = skb_ext_get_ptr(old, SKB_EXT_SEC_PATH);
6048 for (i = 0; i < sp->len; i++)
6049 xfrm_state_hold(sp->xvec[i]);
6057 * skb_ext_add - allocate space for given extension, COW if needed
6059 * @id: extension to allocate space for
6061 * Allocates enough space for the given extension.
6062 * If the extension is already present, a pointer to that extension
6065 * If the skb was cloned, COW applies and the returned memory can be
6066 * modified without changing the extension space of clones buffers.
6068 * Returns pointer to the extension or NULL on allocation failure.
6070 void *skb_ext_add(struct sk_buff *skb, enum skb_ext_id id)
6072 struct skb_ext *new, *old = NULL;
6073 unsigned int newlen, newoff;
6075 if (skb->active_extensions) {
6076 old = skb->extensions;
6078 new = skb_ext_maybe_cow(old, skb->active_extensions);
6082 if (__skb_ext_exist(new, id))
6085 newoff = new->chunks;
6087 newoff = SKB_EXT_CHUNKSIZEOF(*new);
6089 new = skb_ext_alloc();
6094 newlen = newoff + skb_ext_type_len[id];
6095 new->chunks = newlen;
6096 new->offset[id] = newoff;
6098 skb->extensions = new;
6099 skb->active_extensions |= 1 << id;
6100 return skb_ext_get_ptr(new, id);
6102 EXPORT_SYMBOL(skb_ext_add);
6105 static void skb_ext_put_sp(struct sec_path *sp)
6109 for (i = 0; i < sp->len; i++)
6110 xfrm_state_put(sp->xvec[i]);
6114 void __skb_ext_del(struct sk_buff *skb, enum skb_ext_id id)
6116 struct skb_ext *ext = skb->extensions;
6118 skb->active_extensions &= ~(1 << id);
6119 if (skb->active_extensions == 0) {
6120 skb->extensions = NULL;
6123 } else if (id == SKB_EXT_SEC_PATH &&
6124 refcount_read(&ext->refcnt) == 1) {
6125 struct sec_path *sp = skb_ext_get_ptr(ext, SKB_EXT_SEC_PATH);
6132 EXPORT_SYMBOL(__skb_ext_del);
6134 void __skb_ext_put(struct skb_ext *ext)
6136 /* If this is last clone, nothing can increment
6137 * it after check passes. Avoids one atomic op.
6139 if (refcount_read(&ext->refcnt) == 1)
6142 if (!refcount_dec_and_test(&ext->refcnt))
6146 if (__skb_ext_exist(ext, SKB_EXT_SEC_PATH))
6147 skb_ext_put_sp(skb_ext_get_ptr(ext, SKB_EXT_SEC_PATH));
6150 kmem_cache_free(skbuff_ext_cache, ext);
6152 EXPORT_SYMBOL(__skb_ext_put);
6153 #endif /* CONFIG_SKB_EXTENSIONS */