2 * Routines having to do with the 'struct sk_buff' memory handlers.
8 * Alan Cox : Fixed the worst of the load
10 * Dave Platt : Interrupt stacking fix.
11 * Richard Kooijman : Timestamp fixes.
12 * Alan Cox : Changed buffer format.
13 * Alan Cox : destructor hook for AF_UNIX etc.
14 * Linus Torvalds : Better skb_clone.
15 * Alan Cox : Added skb_copy.
16 * Alan Cox : Added all the changed routines Linus
17 * only put in the headers
18 * Ray VanTassle : Fixed --skb->lock in free
19 * Alan Cox : skb_copy copy arp field
20 * Andi Kleen : slabified it.
21 * Robert Olsson : Removed skb_head_pool
24 * The __skb_ routines should be called with interrupts
25 * disabled, or you better be *real* sure that the operation is atomic
26 * with respect to whatever list is being frobbed (e.g. via lock_sock()
27 * or via disabling bottom half handlers, etc).
29 * This program is free software; you can redistribute it and/or
30 * modify it under the terms of the GNU General Public License
31 * as published by the Free Software Foundation; either version
32 * 2 of the License, or (at your option) any later version.
36 * The functions in this file will not compile correctly with gcc 2.4.x
39 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
41 #include <linux/module.h>
42 #include <linux/types.h>
43 #include <linux/kernel.h>
45 #include <linux/interrupt.h>
47 #include <linux/inet.h>
48 #include <linux/slab.h>
49 #include <linux/tcp.h>
50 #include <linux/udp.h>
51 #include <linux/sctp.h>
52 #include <linux/netdevice.h>
53 #ifdef CONFIG_NET_CLS_ACT
54 #include <net/pkt_sched.h>
56 #include <linux/string.h>
57 #include <linux/skbuff.h>
58 #include <linux/splice.h>
59 #include <linux/cache.h>
60 #include <linux/rtnetlink.h>
61 #include <linux/init.h>
62 #include <linux/scatterlist.h>
63 #include <linux/errqueue.h>
64 #include <linux/prefetch.h>
65 #include <linux/if_vlan.h>
67 #include <net/protocol.h>
70 #include <net/checksum.h>
71 #include <net/ip6_checksum.h>
74 #include <linux/uaccess.h>
75 #include <trace/events/skb.h>
76 #include <linux/highmem.h>
77 #include <linux/capability.h>
78 #include <linux/user_namespace.h>
80 struct kmem_cache *skbuff_head_cache __ro_after_init;
81 static struct kmem_cache *skbuff_fclone_cache __ro_after_init;
82 int sysctl_max_skb_frags __read_mostly = MAX_SKB_FRAGS;
83 EXPORT_SYMBOL(sysctl_max_skb_frags);
86 * skb_panic - private function for out-of-line support
90 * @msg: skb_over_panic or skb_under_panic
92 * Out-of-line support for skb_put() and skb_push().
93 * Called via the wrapper skb_over_panic() or skb_under_panic().
94 * Keep out of line to prevent kernel bloat.
95 * __builtin_return_address is not used because it is not always reliable.
97 static void skb_panic(struct sk_buff *skb, unsigned int sz, void *addr,
100 pr_emerg("%s: text:%p len:%d put:%d head:%p data:%p tail:%#lx end:%#lx dev:%s\n",
101 msg, addr, skb->len, sz, skb->head, skb->data,
102 (unsigned long)skb->tail, (unsigned long)skb->end,
103 skb->dev ? skb->dev->name : "<NULL>");
107 static void skb_over_panic(struct sk_buff *skb, unsigned int sz, void *addr)
109 skb_panic(skb, sz, addr, __func__);
112 static void skb_under_panic(struct sk_buff *skb, unsigned int sz, void *addr)
114 skb_panic(skb, sz, addr, __func__);
118 * kmalloc_reserve is a wrapper around kmalloc_node_track_caller that tells
119 * the caller if emergency pfmemalloc reserves are being used. If it is and
120 * the socket is later found to be SOCK_MEMALLOC then PFMEMALLOC reserves
121 * may be used. Otherwise, the packet data may be discarded until enough
124 #define kmalloc_reserve(size, gfp, node, pfmemalloc) \
125 __kmalloc_reserve(size, gfp, node, _RET_IP_, pfmemalloc)
127 static void *__kmalloc_reserve(size_t size, gfp_t flags, int node,
128 unsigned long ip, bool *pfmemalloc)
131 bool ret_pfmemalloc = false;
134 * Try a regular allocation, when that fails and we're not entitled
135 * to the reserves, fail.
137 obj = kmalloc_node_track_caller(size,
138 flags | __GFP_NOMEMALLOC | __GFP_NOWARN,
140 if (obj || !(gfp_pfmemalloc_allowed(flags)))
143 /* Try again but now we are using pfmemalloc reserves */
144 ret_pfmemalloc = true;
145 obj = kmalloc_node_track_caller(size, flags, node);
149 *pfmemalloc = ret_pfmemalloc;
154 /* Allocate a new skbuff. We do this ourselves so we can fill in a few
155 * 'private' fields and also do memory statistics to find all the
161 * __alloc_skb - allocate a network buffer
162 * @size: size to allocate
163 * @gfp_mask: allocation mask
164 * @flags: If SKB_ALLOC_FCLONE is set, allocate from fclone cache
165 * instead of head cache and allocate a cloned (child) skb.
166 * If SKB_ALLOC_RX is set, __GFP_MEMALLOC will be used for
167 * allocations in case the data is required for writeback
168 * @node: numa node to allocate memory on
170 * Allocate a new &sk_buff. The returned buffer has no headroom and a
171 * tail room of at least size bytes. The object has a reference count
172 * of one. The return is the buffer. On a failure the return is %NULL.
174 * Buffers may only be allocated from interrupts using a @gfp_mask of
177 struct sk_buff *__alloc_skb(unsigned int size, gfp_t gfp_mask,
180 struct kmem_cache *cache;
181 struct skb_shared_info *shinfo;
186 cache = (flags & SKB_ALLOC_FCLONE)
187 ? skbuff_fclone_cache : skbuff_head_cache;
189 if (sk_memalloc_socks() && (flags & SKB_ALLOC_RX))
190 gfp_mask |= __GFP_MEMALLOC;
193 skb = kmem_cache_alloc_node(cache, gfp_mask & ~__GFP_DMA, node);
198 /* We do our best to align skb_shared_info on a separate cache
199 * line. It usually works because kmalloc(X > SMP_CACHE_BYTES) gives
200 * aligned memory blocks, unless SLUB/SLAB debug is enabled.
201 * Both skb->head and skb_shared_info are cache line aligned.
203 size = SKB_DATA_ALIGN(size);
204 size += SKB_DATA_ALIGN(sizeof(struct skb_shared_info));
205 data = kmalloc_reserve(size, gfp_mask, node, &pfmemalloc);
208 /* kmalloc(size) might give us more room than requested.
209 * Put skb_shared_info exactly at the end of allocated zone,
210 * to allow max possible filling before reallocation.
212 size = SKB_WITH_OVERHEAD(ksize(data));
213 prefetchw(data + size);
216 * Only clear those fields we need to clear, not those that we will
217 * actually initialise below. Hence, don't put any more fields after
218 * the tail pointer in struct sk_buff!
220 memset(skb, 0, offsetof(struct sk_buff, tail));
221 /* Account for allocated memory : skb + skb->head */
222 skb->truesize = SKB_TRUESIZE(size);
223 skb->pfmemalloc = pfmemalloc;
224 refcount_set(&skb->users, 1);
227 skb_reset_tail_pointer(skb);
228 skb->end = skb->tail + size;
229 skb->mac_header = (typeof(skb->mac_header))~0U;
230 skb->transport_header = (typeof(skb->transport_header))~0U;
232 /* make sure we initialize shinfo sequentially */
233 shinfo = skb_shinfo(skb);
234 memset(shinfo, 0, offsetof(struct skb_shared_info, dataref));
235 atomic_set(&shinfo->dataref, 1);
237 if (flags & SKB_ALLOC_FCLONE) {
238 struct sk_buff_fclones *fclones;
240 fclones = container_of(skb, struct sk_buff_fclones, skb1);
242 skb->fclone = SKB_FCLONE_ORIG;
243 refcount_set(&fclones->fclone_ref, 1);
245 fclones->skb2.fclone = SKB_FCLONE_CLONE;
250 kmem_cache_free(cache, skb);
254 EXPORT_SYMBOL(__alloc_skb);
257 * __build_skb - build a network buffer
258 * @data: data buffer provided by caller
259 * @frag_size: size of data, or 0 if head was kmalloced
261 * Allocate a new &sk_buff. Caller provides space holding head and
262 * skb_shared_info. @data must have been allocated by kmalloc() only if
263 * @frag_size is 0, otherwise data should come from the page allocator
265 * The return is the new skb buffer.
266 * On a failure the return is %NULL, and @data is not freed.
268 * Before IO, driver allocates only data buffer where NIC put incoming frame
269 * Driver should add room at head (NET_SKB_PAD) and
270 * MUST add room at tail (SKB_DATA_ALIGN(skb_shared_info))
271 * After IO, driver calls build_skb(), to allocate sk_buff and populate it
272 * before giving packet to stack.
273 * RX rings only contains data buffers, not full skbs.
275 struct sk_buff *__build_skb(void *data, unsigned int frag_size)
277 struct skb_shared_info *shinfo;
279 unsigned int size = frag_size ? : ksize(data);
281 skb = kmem_cache_alloc(skbuff_head_cache, GFP_ATOMIC);
285 size -= SKB_DATA_ALIGN(sizeof(struct skb_shared_info));
287 memset(skb, 0, offsetof(struct sk_buff, tail));
288 skb->truesize = SKB_TRUESIZE(size);
289 refcount_set(&skb->users, 1);
292 skb_reset_tail_pointer(skb);
293 skb->end = skb->tail + size;
294 skb->mac_header = (typeof(skb->mac_header))~0U;
295 skb->transport_header = (typeof(skb->transport_header))~0U;
297 /* make sure we initialize shinfo sequentially */
298 shinfo = skb_shinfo(skb);
299 memset(shinfo, 0, offsetof(struct skb_shared_info, dataref));
300 atomic_set(&shinfo->dataref, 1);
305 /* build_skb() is wrapper over __build_skb(), that specifically
306 * takes care of skb->head and skb->pfmemalloc
307 * This means that if @frag_size is not zero, then @data must be backed
308 * by a page fragment, not kmalloc() or vmalloc()
310 struct sk_buff *build_skb(void *data, unsigned int frag_size)
312 struct sk_buff *skb = __build_skb(data, frag_size);
314 if (skb && frag_size) {
316 if (page_is_pfmemalloc(virt_to_head_page(data)))
321 EXPORT_SYMBOL(build_skb);
323 #define NAPI_SKB_CACHE_SIZE 64
325 struct napi_alloc_cache {
326 struct page_frag_cache page;
327 unsigned int skb_count;
328 void *skb_cache[NAPI_SKB_CACHE_SIZE];
331 static DEFINE_PER_CPU(struct page_frag_cache, netdev_alloc_cache);
332 static DEFINE_PER_CPU(struct napi_alloc_cache, napi_alloc_cache);
334 static void *__netdev_alloc_frag(unsigned int fragsz, gfp_t gfp_mask)
336 struct page_frag_cache *nc;
340 local_irq_save(flags);
341 nc = this_cpu_ptr(&netdev_alloc_cache);
342 data = page_frag_alloc(nc, fragsz, gfp_mask);
343 local_irq_restore(flags);
348 * netdev_alloc_frag - allocate a page fragment
349 * @fragsz: fragment size
351 * Allocates a frag from a page for receive buffer.
352 * Uses GFP_ATOMIC allocations.
354 void *netdev_alloc_frag(unsigned int fragsz)
356 return __netdev_alloc_frag(fragsz, GFP_ATOMIC);
358 EXPORT_SYMBOL(netdev_alloc_frag);
360 static void *__napi_alloc_frag(unsigned int fragsz, gfp_t gfp_mask)
362 struct napi_alloc_cache *nc = this_cpu_ptr(&napi_alloc_cache);
364 return page_frag_alloc(&nc->page, fragsz, gfp_mask);
367 void *napi_alloc_frag(unsigned int fragsz)
369 return __napi_alloc_frag(fragsz, GFP_ATOMIC);
371 EXPORT_SYMBOL(napi_alloc_frag);
374 * __netdev_alloc_skb - allocate an skbuff for rx on a specific device
375 * @dev: network device to receive on
376 * @len: length to allocate
377 * @gfp_mask: get_free_pages mask, passed to alloc_skb
379 * Allocate a new &sk_buff and assign it a usage count of one. The
380 * buffer has NET_SKB_PAD headroom built in. Users should allocate
381 * the headroom they think they need without accounting for the
382 * built in space. The built in space is used for optimisations.
384 * %NULL is returned if there is no free memory.
386 struct sk_buff *__netdev_alloc_skb(struct net_device *dev, unsigned int len,
389 struct page_frag_cache *nc;
397 if ((len > SKB_WITH_OVERHEAD(PAGE_SIZE)) ||
398 (gfp_mask & (__GFP_DIRECT_RECLAIM | GFP_DMA))) {
399 skb = __alloc_skb(len, gfp_mask, SKB_ALLOC_RX, NUMA_NO_NODE);
405 len += SKB_DATA_ALIGN(sizeof(struct skb_shared_info));
406 len = SKB_DATA_ALIGN(len);
408 if (sk_memalloc_socks())
409 gfp_mask |= __GFP_MEMALLOC;
411 local_irq_save(flags);
413 nc = this_cpu_ptr(&netdev_alloc_cache);
414 data = page_frag_alloc(nc, len, gfp_mask);
415 pfmemalloc = nc->pfmemalloc;
417 local_irq_restore(flags);
422 skb = __build_skb(data, len);
423 if (unlikely(!skb)) {
428 /* use OR instead of assignment to avoid clearing of bits in mask */
434 skb_reserve(skb, NET_SKB_PAD);
440 EXPORT_SYMBOL(__netdev_alloc_skb);
443 * __napi_alloc_skb - allocate skbuff for rx in a specific NAPI instance
444 * @napi: napi instance this buffer was allocated for
445 * @len: length to allocate
446 * @gfp_mask: get_free_pages mask, passed to alloc_skb and alloc_pages
448 * Allocate a new sk_buff for use in NAPI receive. This buffer will
449 * attempt to allocate the head from a special reserved region used
450 * only for NAPI Rx allocation. By doing this we can save several
451 * CPU cycles by avoiding having to disable and re-enable IRQs.
453 * %NULL is returned if there is no free memory.
455 struct sk_buff *__napi_alloc_skb(struct napi_struct *napi, unsigned int len,
458 struct napi_alloc_cache *nc = this_cpu_ptr(&napi_alloc_cache);
462 len += NET_SKB_PAD + NET_IP_ALIGN;
464 if ((len > SKB_WITH_OVERHEAD(PAGE_SIZE)) ||
465 (gfp_mask & (__GFP_DIRECT_RECLAIM | GFP_DMA))) {
466 skb = __alloc_skb(len, gfp_mask, SKB_ALLOC_RX, NUMA_NO_NODE);
472 len += SKB_DATA_ALIGN(sizeof(struct skb_shared_info));
473 len = SKB_DATA_ALIGN(len);
475 if (sk_memalloc_socks())
476 gfp_mask |= __GFP_MEMALLOC;
478 data = page_frag_alloc(&nc->page, len, gfp_mask);
482 skb = __build_skb(data, len);
483 if (unlikely(!skb)) {
488 /* use OR instead of assignment to avoid clearing of bits in mask */
489 if (nc->page.pfmemalloc)
494 skb_reserve(skb, NET_SKB_PAD + NET_IP_ALIGN);
495 skb->dev = napi->dev;
500 EXPORT_SYMBOL(__napi_alloc_skb);
502 void skb_add_rx_frag(struct sk_buff *skb, int i, struct page *page, int off,
503 int size, unsigned int truesize)
505 skb_fill_page_desc(skb, i, page, off, size);
507 skb->data_len += size;
508 skb->truesize += truesize;
510 EXPORT_SYMBOL(skb_add_rx_frag);
512 void skb_coalesce_rx_frag(struct sk_buff *skb, int i, int size,
513 unsigned int truesize)
515 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
517 skb_frag_size_add(frag, size);
519 skb->data_len += size;
520 skb->truesize += truesize;
522 EXPORT_SYMBOL(skb_coalesce_rx_frag);
524 static void skb_drop_list(struct sk_buff **listp)
526 kfree_skb_list(*listp);
530 static inline void skb_drop_fraglist(struct sk_buff *skb)
532 skb_drop_list(&skb_shinfo(skb)->frag_list);
535 static void skb_clone_fraglist(struct sk_buff *skb)
537 struct sk_buff *list;
539 skb_walk_frags(skb, list)
543 static void skb_free_head(struct sk_buff *skb)
545 unsigned char *head = skb->head;
553 static void skb_release_data(struct sk_buff *skb)
555 struct skb_shared_info *shinfo = skb_shinfo(skb);
559 atomic_sub_return(skb->nohdr ? (1 << SKB_DATAREF_SHIFT) + 1 : 1,
563 for (i = 0; i < shinfo->nr_frags; i++)
564 __skb_frag_unref(&shinfo->frags[i]);
566 if (shinfo->frag_list)
567 kfree_skb_list(shinfo->frag_list);
569 skb_zcopy_clear(skb, true);
574 * Free an skbuff by memory without cleaning the state.
576 static void kfree_skbmem(struct sk_buff *skb)
578 struct sk_buff_fclones *fclones;
580 switch (skb->fclone) {
581 case SKB_FCLONE_UNAVAILABLE:
582 kmem_cache_free(skbuff_head_cache, skb);
585 case SKB_FCLONE_ORIG:
586 fclones = container_of(skb, struct sk_buff_fclones, skb1);
588 /* We usually free the clone (TX completion) before original skb
589 * This test would have no chance to be true for the clone,
590 * while here, branch prediction will be good.
592 if (refcount_read(&fclones->fclone_ref) == 1)
596 default: /* SKB_FCLONE_CLONE */
597 fclones = container_of(skb, struct sk_buff_fclones, skb2);
600 if (!refcount_dec_and_test(&fclones->fclone_ref))
603 kmem_cache_free(skbuff_fclone_cache, fclones);
606 void skb_release_head_state(struct sk_buff *skb)
610 if (skb->destructor) {
612 skb->destructor(skb);
614 #if IS_ENABLED(CONFIG_NF_CONNTRACK)
615 nf_conntrack_put(skb_nfct(skb));
617 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
618 nf_bridge_put(skb->nf_bridge);
622 /* Free everything but the sk_buff shell. */
623 static void skb_release_all(struct sk_buff *skb)
625 skb_release_head_state(skb);
626 if (likely(skb->head))
627 skb_release_data(skb);
631 * __kfree_skb - private function
634 * Free an sk_buff. Release anything attached to the buffer.
635 * Clean the state. This is an internal helper function. Users should
636 * always call kfree_skb
639 void __kfree_skb(struct sk_buff *skb)
641 skb_release_all(skb);
644 EXPORT_SYMBOL(__kfree_skb);
647 * kfree_skb - free an sk_buff
648 * @skb: buffer to free
650 * Drop a reference to the buffer and free it if the usage count has
653 void kfree_skb(struct sk_buff *skb)
658 trace_kfree_skb(skb, __builtin_return_address(0));
661 EXPORT_SYMBOL(kfree_skb);
663 void kfree_skb_list(struct sk_buff *segs)
666 struct sk_buff *next = segs->next;
672 EXPORT_SYMBOL(kfree_skb_list);
675 * skb_tx_error - report an sk_buff xmit error
676 * @skb: buffer that triggered an error
678 * Report xmit error if a device callback is tracking this skb.
679 * skb must be freed afterwards.
681 void skb_tx_error(struct sk_buff *skb)
683 skb_zcopy_clear(skb, true);
685 EXPORT_SYMBOL(skb_tx_error);
688 * consume_skb - free an skbuff
689 * @skb: buffer to free
691 * Drop a ref to the buffer and free it if the usage count has hit zero
692 * Functions identically to kfree_skb, but kfree_skb assumes that the frame
693 * is being dropped after a failure and notes that
695 void consume_skb(struct sk_buff *skb)
700 trace_consume_skb(skb);
703 EXPORT_SYMBOL(consume_skb);
706 * consume_stateless_skb - free an skbuff, assuming it is stateless
707 * @skb: buffer to free
709 * Alike consume_skb(), but this variant assumes that this is the last
710 * skb reference and all the head states have been already dropped
712 void __consume_stateless_skb(struct sk_buff *skb)
714 trace_consume_skb(skb);
715 skb_release_data(skb);
719 void __kfree_skb_flush(void)
721 struct napi_alloc_cache *nc = this_cpu_ptr(&napi_alloc_cache);
723 /* flush skb_cache if containing objects */
725 kmem_cache_free_bulk(skbuff_head_cache, nc->skb_count,
731 static inline void _kfree_skb_defer(struct sk_buff *skb)
733 struct napi_alloc_cache *nc = this_cpu_ptr(&napi_alloc_cache);
735 /* drop skb->head and call any destructors for packet */
736 skb_release_all(skb);
738 /* record skb to CPU local list */
739 nc->skb_cache[nc->skb_count++] = skb;
742 /* SLUB writes into objects when freeing */
746 /* flush skb_cache if it is filled */
747 if (unlikely(nc->skb_count == NAPI_SKB_CACHE_SIZE)) {
748 kmem_cache_free_bulk(skbuff_head_cache, NAPI_SKB_CACHE_SIZE,
753 void __kfree_skb_defer(struct sk_buff *skb)
755 _kfree_skb_defer(skb);
758 void napi_consume_skb(struct sk_buff *skb, int budget)
763 /* Zero budget indicate non-NAPI context called us, like netpoll */
764 if (unlikely(!budget)) {
765 dev_consume_skb_any(skb);
772 /* if reaching here SKB is ready to free */
773 trace_consume_skb(skb);
775 /* if SKB is a clone, don't handle this case */
776 if (skb->fclone != SKB_FCLONE_UNAVAILABLE) {
781 _kfree_skb_defer(skb);
783 EXPORT_SYMBOL(napi_consume_skb);
785 /* Make sure a field is enclosed inside headers_start/headers_end section */
786 #define CHECK_SKB_FIELD(field) \
787 BUILD_BUG_ON(offsetof(struct sk_buff, field) < \
788 offsetof(struct sk_buff, headers_start)); \
789 BUILD_BUG_ON(offsetof(struct sk_buff, field) > \
790 offsetof(struct sk_buff, headers_end)); \
792 static void __copy_skb_header(struct sk_buff *new, const struct sk_buff *old)
794 new->tstamp = old->tstamp;
795 /* We do not copy old->sk */
797 memcpy(new->cb, old->cb, sizeof(old->cb));
798 skb_dst_copy(new, old);
800 new->sp = secpath_get(old->sp);
802 __nf_copy(new, old, false);
804 /* Note : this field could be in headers_start/headers_end section
805 * It is not yet because we do not want to have a 16 bit hole
807 new->queue_mapping = old->queue_mapping;
809 memcpy(&new->headers_start, &old->headers_start,
810 offsetof(struct sk_buff, headers_end) -
811 offsetof(struct sk_buff, headers_start));
812 CHECK_SKB_FIELD(protocol);
813 CHECK_SKB_FIELD(csum);
814 CHECK_SKB_FIELD(hash);
815 CHECK_SKB_FIELD(priority);
816 CHECK_SKB_FIELD(skb_iif);
817 CHECK_SKB_FIELD(vlan_proto);
818 CHECK_SKB_FIELD(vlan_tci);
819 CHECK_SKB_FIELD(transport_header);
820 CHECK_SKB_FIELD(network_header);
821 CHECK_SKB_FIELD(mac_header);
822 CHECK_SKB_FIELD(inner_protocol);
823 CHECK_SKB_FIELD(inner_transport_header);
824 CHECK_SKB_FIELD(inner_network_header);
825 CHECK_SKB_FIELD(inner_mac_header);
826 CHECK_SKB_FIELD(mark);
827 #ifdef CONFIG_NETWORK_SECMARK
828 CHECK_SKB_FIELD(secmark);
830 #ifdef CONFIG_NET_RX_BUSY_POLL
831 CHECK_SKB_FIELD(napi_id);
834 CHECK_SKB_FIELD(sender_cpu);
836 #ifdef CONFIG_NET_SCHED
837 CHECK_SKB_FIELD(tc_index);
843 * You should not add any new code to this function. Add it to
844 * __copy_skb_header above instead.
846 static struct sk_buff *__skb_clone(struct sk_buff *n, struct sk_buff *skb)
848 #define C(x) n->x = skb->x
850 n->next = n->prev = NULL;
852 __copy_skb_header(n, skb);
857 n->hdr_len = skb->nohdr ? skb_headroom(skb) : skb->hdr_len;
860 n->destructor = NULL;
867 refcount_set(&n->users, 1);
869 atomic_inc(&(skb_shinfo(skb)->dataref));
877 * skb_morph - morph one skb into another
878 * @dst: the skb to receive the contents
879 * @src: the skb to supply the contents
881 * This is identical to skb_clone except that the target skb is
882 * supplied by the user.
884 * The target skb is returned upon exit.
886 struct sk_buff *skb_morph(struct sk_buff *dst, struct sk_buff *src)
888 skb_release_all(dst);
889 return __skb_clone(dst, src);
891 EXPORT_SYMBOL_GPL(skb_morph);
893 int mm_account_pinned_pages(struct mmpin *mmp, size_t size)
895 unsigned long max_pg, num_pg, new_pg, old_pg;
896 struct user_struct *user;
898 if (capable(CAP_IPC_LOCK) || !size)
901 num_pg = (size >> PAGE_SHIFT) + 2; /* worst case */
902 max_pg = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
903 user = mmp->user ? : current_user();
906 old_pg = atomic_long_read(&user->locked_vm);
907 new_pg = old_pg + num_pg;
910 } while (atomic_long_cmpxchg(&user->locked_vm, old_pg, new_pg) !=
914 mmp->user = get_uid(user);
915 mmp->num_pg = num_pg;
917 mmp->num_pg += num_pg;
922 EXPORT_SYMBOL_GPL(mm_account_pinned_pages);
924 void mm_unaccount_pinned_pages(struct mmpin *mmp)
927 atomic_long_sub(mmp->num_pg, &mmp->user->locked_vm);
931 EXPORT_SYMBOL_GPL(mm_unaccount_pinned_pages);
933 struct ubuf_info *sock_zerocopy_alloc(struct sock *sk, size_t size)
935 struct ubuf_info *uarg;
938 WARN_ON_ONCE(!in_task());
940 if (!sock_flag(sk, SOCK_ZEROCOPY))
943 skb = sock_omalloc(sk, 0, GFP_KERNEL);
947 BUILD_BUG_ON(sizeof(*uarg) > sizeof(skb->cb));
948 uarg = (void *)skb->cb;
949 uarg->mmp.user = NULL;
951 if (mm_account_pinned_pages(&uarg->mmp, size)) {
956 uarg->callback = sock_zerocopy_callback;
957 uarg->id = ((u32)atomic_inc_return(&sk->sk_zckey)) - 1;
959 uarg->bytelen = size;
961 refcount_set(&uarg->refcnt, 1);
966 EXPORT_SYMBOL_GPL(sock_zerocopy_alloc);
968 static inline struct sk_buff *skb_from_uarg(struct ubuf_info *uarg)
970 return container_of((void *)uarg, struct sk_buff, cb);
973 struct ubuf_info *sock_zerocopy_realloc(struct sock *sk, size_t size,
974 struct ubuf_info *uarg)
977 const u32 byte_limit = 1 << 19; /* limit to a few TSO */
980 /* realloc only when socket is locked (TCP, UDP cork),
981 * so uarg->len and sk_zckey access is serialized
983 if (!sock_owned_by_user(sk)) {
988 bytelen = uarg->bytelen + size;
989 if (uarg->len == USHRT_MAX - 1 || bytelen > byte_limit) {
990 /* TCP can create new skb to attach new uarg */
991 if (sk->sk_type == SOCK_STREAM)
996 next = (u32)atomic_read(&sk->sk_zckey);
997 if ((u32)(uarg->id + uarg->len) == next) {
998 if (mm_account_pinned_pages(&uarg->mmp, size))
1001 uarg->bytelen = bytelen;
1002 atomic_set(&sk->sk_zckey, ++next);
1003 sock_zerocopy_get(uarg);
1009 return sock_zerocopy_alloc(sk, size);
1011 EXPORT_SYMBOL_GPL(sock_zerocopy_realloc);
1013 static bool skb_zerocopy_notify_extend(struct sk_buff *skb, u32 lo, u16 len)
1015 struct sock_exterr_skb *serr = SKB_EXT_ERR(skb);
1019 old_lo = serr->ee.ee_info;
1020 old_hi = serr->ee.ee_data;
1021 sum_len = old_hi - old_lo + 1ULL + len;
1023 if (sum_len >= (1ULL << 32))
1026 if (lo != old_hi + 1)
1029 serr->ee.ee_data += len;
1033 void sock_zerocopy_callback(struct ubuf_info *uarg, bool success)
1035 struct sk_buff *tail, *skb = skb_from_uarg(uarg);
1036 struct sock_exterr_skb *serr;
1037 struct sock *sk = skb->sk;
1038 struct sk_buff_head *q;
1039 unsigned long flags;
1043 mm_unaccount_pinned_pages(&uarg->mmp);
1045 /* if !len, there was only 1 call, and it was aborted
1046 * so do not queue a completion notification
1048 if (!uarg->len || sock_flag(sk, SOCK_DEAD))
1053 hi = uarg->id + len - 1;
1055 serr = SKB_EXT_ERR(skb);
1056 memset(serr, 0, sizeof(*serr));
1057 serr->ee.ee_errno = 0;
1058 serr->ee.ee_origin = SO_EE_ORIGIN_ZEROCOPY;
1059 serr->ee.ee_data = hi;
1060 serr->ee.ee_info = lo;
1062 serr->ee.ee_code |= SO_EE_CODE_ZEROCOPY_COPIED;
1064 q = &sk->sk_error_queue;
1065 spin_lock_irqsave(&q->lock, flags);
1066 tail = skb_peek_tail(q);
1067 if (!tail || SKB_EXT_ERR(tail)->ee.ee_origin != SO_EE_ORIGIN_ZEROCOPY ||
1068 !skb_zerocopy_notify_extend(tail, lo, len)) {
1069 __skb_queue_tail(q, skb);
1072 spin_unlock_irqrestore(&q->lock, flags);
1074 sk->sk_error_report(sk);
1080 EXPORT_SYMBOL_GPL(sock_zerocopy_callback);
1082 void sock_zerocopy_put(struct ubuf_info *uarg)
1084 if (uarg && refcount_dec_and_test(&uarg->refcnt)) {
1086 uarg->callback(uarg, uarg->zerocopy);
1088 consume_skb(skb_from_uarg(uarg));
1091 EXPORT_SYMBOL_GPL(sock_zerocopy_put);
1093 void sock_zerocopy_put_abort(struct ubuf_info *uarg)
1096 struct sock *sk = skb_from_uarg(uarg)->sk;
1098 atomic_dec(&sk->sk_zckey);
1101 sock_zerocopy_put(uarg);
1104 EXPORT_SYMBOL_GPL(sock_zerocopy_put_abort);
1106 extern int __zerocopy_sg_from_iter(struct sock *sk, struct sk_buff *skb,
1107 struct iov_iter *from, size_t length);
1109 int skb_zerocopy_iter_stream(struct sock *sk, struct sk_buff *skb,
1110 struct msghdr *msg, int len,
1111 struct ubuf_info *uarg)
1113 struct ubuf_info *orig_uarg = skb_zcopy(skb);
1114 struct iov_iter orig_iter = msg->msg_iter;
1115 int err, orig_len = skb->len;
1117 /* An skb can only point to one uarg. This edge case happens when
1118 * TCP appends to an skb, but zerocopy_realloc triggered a new alloc.
1120 if (orig_uarg && uarg != orig_uarg)
1123 err = __zerocopy_sg_from_iter(sk, skb, &msg->msg_iter, len);
1124 if (err == -EFAULT || (err == -EMSGSIZE && skb->len == orig_len)) {
1125 struct sock *save_sk = skb->sk;
1127 /* Streams do not free skb on error. Reset to prev state. */
1128 msg->msg_iter = orig_iter;
1130 ___pskb_trim(skb, orig_len);
1135 skb_zcopy_set(skb, uarg);
1136 return skb->len - orig_len;
1138 EXPORT_SYMBOL_GPL(skb_zerocopy_iter_stream);
1140 static int skb_zerocopy_clone(struct sk_buff *nskb, struct sk_buff *orig,
1143 if (skb_zcopy(orig)) {
1144 if (skb_zcopy(nskb)) {
1145 /* !gfp_mask callers are verified to !skb_zcopy(nskb) */
1150 if (skb_uarg(nskb) == skb_uarg(orig))
1152 if (skb_copy_ubufs(nskb, GFP_ATOMIC))
1155 skb_zcopy_set(nskb, skb_uarg(orig));
1161 * skb_copy_ubufs - copy userspace skb frags buffers to kernel
1162 * @skb: the skb to modify
1163 * @gfp_mask: allocation priority
1165 * This must be called on SKBTX_DEV_ZEROCOPY skb.
1166 * It will copy all frags into kernel and drop the reference
1167 * to userspace pages.
1169 * If this function is called from an interrupt gfp_mask() must be
1172 * Returns 0 on success or a negative error code on failure
1173 * to allocate kernel memory to copy to.
1175 int skb_copy_ubufs(struct sk_buff *skb, gfp_t gfp_mask)
1177 int num_frags = skb_shinfo(skb)->nr_frags;
1178 struct page *page, *head = NULL;
1182 if (skb_shared(skb) || skb_unclone(skb, gfp_mask))
1188 new_frags = (__skb_pagelen(skb) + PAGE_SIZE - 1) >> PAGE_SHIFT;
1189 for (i = 0; i < new_frags; i++) {
1190 page = alloc_page(gfp_mask);
1193 struct page *next = (struct page *)page_private(head);
1199 set_page_private(page, (unsigned long)head);
1205 for (i = 0; i < num_frags; i++) {
1206 skb_frag_t *f = &skb_shinfo(skb)->frags[i];
1207 u32 p_off, p_len, copied;
1211 skb_frag_foreach_page(f, f->page_offset, skb_frag_size(f),
1212 p, p_off, p_len, copied) {
1214 vaddr = kmap_atomic(p);
1216 while (done < p_len) {
1217 if (d_off == PAGE_SIZE) {
1219 page = (struct page *)page_private(page);
1221 copy = min_t(u32, PAGE_SIZE - d_off, p_len - done);
1222 memcpy(page_address(page) + d_off,
1223 vaddr + p_off + done, copy);
1227 kunmap_atomic(vaddr);
1231 /* skb frags release userspace buffers */
1232 for (i = 0; i < num_frags; i++)
1233 skb_frag_unref(skb, i);
1235 /* skb frags point to kernel buffers */
1236 for (i = 0; i < new_frags - 1; i++) {
1237 __skb_fill_page_desc(skb, i, head, 0, PAGE_SIZE);
1238 head = (struct page *)page_private(head);
1240 __skb_fill_page_desc(skb, new_frags - 1, head, 0, d_off);
1241 skb_shinfo(skb)->nr_frags = new_frags;
1244 skb_zcopy_clear(skb, false);
1247 EXPORT_SYMBOL_GPL(skb_copy_ubufs);
1250 * skb_clone - duplicate an sk_buff
1251 * @skb: buffer to clone
1252 * @gfp_mask: allocation priority
1254 * Duplicate an &sk_buff. The new one is not owned by a socket. Both
1255 * copies share the same packet data but not structure. The new
1256 * buffer has a reference count of 1. If the allocation fails the
1257 * function returns %NULL otherwise the new buffer is returned.
1259 * If this function is called from an interrupt gfp_mask() must be
1263 struct sk_buff *skb_clone(struct sk_buff *skb, gfp_t gfp_mask)
1265 struct sk_buff_fclones *fclones = container_of(skb,
1266 struct sk_buff_fclones,
1270 if (skb_orphan_frags(skb, gfp_mask))
1273 if (skb->fclone == SKB_FCLONE_ORIG &&
1274 refcount_read(&fclones->fclone_ref) == 1) {
1276 refcount_set(&fclones->fclone_ref, 2);
1278 if (skb_pfmemalloc(skb))
1279 gfp_mask |= __GFP_MEMALLOC;
1281 n = kmem_cache_alloc(skbuff_head_cache, gfp_mask);
1285 n->fclone = SKB_FCLONE_UNAVAILABLE;
1288 return __skb_clone(n, skb);
1290 EXPORT_SYMBOL(skb_clone);
1292 static void skb_headers_offset_update(struct sk_buff *skb, int off)
1294 /* Only adjust this if it actually is csum_start rather than csum */
1295 if (skb->ip_summed == CHECKSUM_PARTIAL)
1296 skb->csum_start += off;
1297 /* {transport,network,mac}_header and tail are relative to skb->head */
1298 skb->transport_header += off;
1299 skb->network_header += off;
1300 if (skb_mac_header_was_set(skb))
1301 skb->mac_header += off;
1302 skb->inner_transport_header += off;
1303 skb->inner_network_header += off;
1304 skb->inner_mac_header += off;
1307 static void copy_skb_header(struct sk_buff *new, const struct sk_buff *old)
1309 __copy_skb_header(new, old);
1311 skb_shinfo(new)->gso_size = skb_shinfo(old)->gso_size;
1312 skb_shinfo(new)->gso_segs = skb_shinfo(old)->gso_segs;
1313 skb_shinfo(new)->gso_type = skb_shinfo(old)->gso_type;
1316 static inline int skb_alloc_rx_flag(const struct sk_buff *skb)
1318 if (skb_pfmemalloc(skb))
1319 return SKB_ALLOC_RX;
1324 * skb_copy - create private copy of an sk_buff
1325 * @skb: buffer to copy
1326 * @gfp_mask: allocation priority
1328 * Make a copy of both an &sk_buff and its data. This is used when the
1329 * caller wishes to modify the data and needs a private copy of the
1330 * data to alter. Returns %NULL on failure or the pointer to the buffer
1331 * on success. The returned buffer has a reference count of 1.
1333 * As by-product this function converts non-linear &sk_buff to linear
1334 * one, so that &sk_buff becomes completely private and caller is allowed
1335 * to modify all the data of returned buffer. This means that this
1336 * function is not recommended for use in circumstances when only
1337 * header is going to be modified. Use pskb_copy() instead.
1340 struct sk_buff *skb_copy(const struct sk_buff *skb, gfp_t gfp_mask)
1342 int headerlen = skb_headroom(skb);
1343 unsigned int size = skb_end_offset(skb) + skb->data_len;
1344 struct sk_buff *n = __alloc_skb(size, gfp_mask,
1345 skb_alloc_rx_flag(skb), NUMA_NO_NODE);
1350 /* Set the data pointer */
1351 skb_reserve(n, headerlen);
1352 /* Set the tail pointer and length */
1353 skb_put(n, skb->len);
1355 BUG_ON(skb_copy_bits(skb, -headerlen, n->head, headerlen + skb->len));
1357 copy_skb_header(n, skb);
1360 EXPORT_SYMBOL(skb_copy);
1363 * __pskb_copy_fclone - create copy of an sk_buff with private head.
1364 * @skb: buffer to copy
1365 * @headroom: headroom of new skb
1366 * @gfp_mask: allocation priority
1367 * @fclone: if true allocate the copy of the skb from the fclone
1368 * cache instead of the head cache; it is recommended to set this
1369 * to true for the cases where the copy will likely be cloned
1371 * Make a copy of both an &sk_buff and part of its data, located
1372 * in header. Fragmented data remain shared. This is used when
1373 * the caller wishes to modify only header of &sk_buff and needs
1374 * private copy of the header to alter. Returns %NULL on failure
1375 * or the pointer to the buffer on success.
1376 * The returned buffer has a reference count of 1.
1379 struct sk_buff *__pskb_copy_fclone(struct sk_buff *skb, int headroom,
1380 gfp_t gfp_mask, bool fclone)
1382 unsigned int size = skb_headlen(skb) + headroom;
1383 int flags = skb_alloc_rx_flag(skb) | (fclone ? SKB_ALLOC_FCLONE : 0);
1384 struct sk_buff *n = __alloc_skb(size, gfp_mask, flags, NUMA_NO_NODE);
1389 /* Set the data pointer */
1390 skb_reserve(n, headroom);
1391 /* Set the tail pointer and length */
1392 skb_put(n, skb_headlen(skb));
1393 /* Copy the bytes */
1394 skb_copy_from_linear_data(skb, n->data, n->len);
1396 n->truesize += skb->data_len;
1397 n->data_len = skb->data_len;
1400 if (skb_shinfo(skb)->nr_frags) {
1403 if (skb_orphan_frags(skb, gfp_mask) ||
1404 skb_zerocopy_clone(n, skb, gfp_mask)) {
1409 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1410 skb_shinfo(n)->frags[i] = skb_shinfo(skb)->frags[i];
1411 skb_frag_ref(skb, i);
1413 skb_shinfo(n)->nr_frags = i;
1416 if (skb_has_frag_list(skb)) {
1417 skb_shinfo(n)->frag_list = skb_shinfo(skb)->frag_list;
1418 skb_clone_fraglist(n);
1421 copy_skb_header(n, skb);
1425 EXPORT_SYMBOL(__pskb_copy_fclone);
1428 * pskb_expand_head - reallocate header of &sk_buff
1429 * @skb: buffer to reallocate
1430 * @nhead: room to add at head
1431 * @ntail: room to add at tail
1432 * @gfp_mask: allocation priority
1434 * Expands (or creates identical copy, if @nhead and @ntail are zero)
1435 * header of @skb. &sk_buff itself is not changed. &sk_buff MUST have
1436 * reference count of 1. Returns zero in the case of success or error,
1437 * if expansion failed. In the last case, &sk_buff is not changed.
1439 * All the pointers pointing into skb header may change and must be
1440 * reloaded after call to this function.
1443 int pskb_expand_head(struct sk_buff *skb, int nhead, int ntail,
1446 int i, osize = skb_end_offset(skb);
1447 int size = osize + nhead + ntail;
1453 BUG_ON(skb_shared(skb));
1455 size = SKB_DATA_ALIGN(size);
1457 if (skb_pfmemalloc(skb))
1458 gfp_mask |= __GFP_MEMALLOC;
1459 data = kmalloc_reserve(size + SKB_DATA_ALIGN(sizeof(struct skb_shared_info)),
1460 gfp_mask, NUMA_NO_NODE, NULL);
1463 size = SKB_WITH_OVERHEAD(ksize(data));
1465 /* Copy only real data... and, alas, header. This should be
1466 * optimized for the cases when header is void.
1468 memcpy(data + nhead, skb->head, skb_tail_pointer(skb) - skb->head);
1470 memcpy((struct skb_shared_info *)(data + size),
1472 offsetof(struct skb_shared_info, frags[skb_shinfo(skb)->nr_frags]));
1475 * if shinfo is shared we must drop the old head gracefully, but if it
1476 * is not we can just drop the old head and let the existing refcount
1477 * be since all we did is relocate the values
1479 if (skb_cloned(skb)) {
1480 if (skb_orphan_frags(skb, gfp_mask))
1483 refcount_inc(&skb_uarg(skb)->refcnt);
1484 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++)
1485 skb_frag_ref(skb, i);
1487 if (skb_has_frag_list(skb))
1488 skb_clone_fraglist(skb);
1490 skb_release_data(skb);
1494 off = (data + nhead) - skb->head;
1499 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1503 skb->end = skb->head + size;
1506 skb_headers_offset_update(skb, nhead);
1510 atomic_set(&skb_shinfo(skb)->dataref, 1);
1512 skb_metadata_clear(skb);
1514 /* It is not generally safe to change skb->truesize.
1515 * For the moment, we really care of rx path, or
1516 * when skb is orphaned (not attached to a socket).
1518 if (!skb->sk || skb->destructor == sock_edemux)
1519 skb->truesize += size - osize;
1528 EXPORT_SYMBOL(pskb_expand_head);
1530 /* Make private copy of skb with writable head and some headroom */
1532 struct sk_buff *skb_realloc_headroom(struct sk_buff *skb, unsigned int headroom)
1534 struct sk_buff *skb2;
1535 int delta = headroom - skb_headroom(skb);
1538 skb2 = pskb_copy(skb, GFP_ATOMIC);
1540 skb2 = skb_clone(skb, GFP_ATOMIC);
1541 if (skb2 && pskb_expand_head(skb2, SKB_DATA_ALIGN(delta), 0,
1549 EXPORT_SYMBOL(skb_realloc_headroom);
1552 * skb_copy_expand - copy and expand sk_buff
1553 * @skb: buffer to copy
1554 * @newheadroom: new free bytes at head
1555 * @newtailroom: new free bytes at tail
1556 * @gfp_mask: allocation priority
1558 * Make a copy of both an &sk_buff and its data and while doing so
1559 * allocate additional space.
1561 * This is used when the caller wishes to modify the data and needs a
1562 * private copy of the data to alter as well as more space for new fields.
1563 * Returns %NULL on failure or the pointer to the buffer
1564 * on success. The returned buffer has a reference count of 1.
1566 * You must pass %GFP_ATOMIC as the allocation priority if this function
1567 * is called from an interrupt.
1569 struct sk_buff *skb_copy_expand(const struct sk_buff *skb,
1570 int newheadroom, int newtailroom,
1574 * Allocate the copy buffer
1576 struct sk_buff *n = __alloc_skb(newheadroom + skb->len + newtailroom,
1577 gfp_mask, skb_alloc_rx_flag(skb),
1579 int oldheadroom = skb_headroom(skb);
1580 int head_copy_len, head_copy_off;
1585 skb_reserve(n, newheadroom);
1587 /* Set the tail pointer and length */
1588 skb_put(n, skb->len);
1590 head_copy_len = oldheadroom;
1592 if (newheadroom <= head_copy_len)
1593 head_copy_len = newheadroom;
1595 head_copy_off = newheadroom - head_copy_len;
1597 /* Copy the linear header and data. */
1598 BUG_ON(skb_copy_bits(skb, -head_copy_len, n->head + head_copy_off,
1599 skb->len + head_copy_len));
1601 copy_skb_header(n, skb);
1603 skb_headers_offset_update(n, newheadroom - oldheadroom);
1607 EXPORT_SYMBOL(skb_copy_expand);
1610 * __skb_pad - zero pad the tail of an skb
1611 * @skb: buffer to pad
1612 * @pad: space to pad
1613 * @free_on_error: free buffer on error
1615 * Ensure that a buffer is followed by a padding area that is zero
1616 * filled. Used by network drivers which may DMA or transfer data
1617 * beyond the buffer end onto the wire.
1619 * May return error in out of memory cases. The skb is freed on error
1620 * if @free_on_error is true.
1623 int __skb_pad(struct sk_buff *skb, int pad, bool free_on_error)
1628 /* If the skbuff is non linear tailroom is always zero.. */
1629 if (!skb_cloned(skb) && skb_tailroom(skb) >= pad) {
1630 memset(skb->data+skb->len, 0, pad);
1634 ntail = skb->data_len + pad - (skb->end - skb->tail);
1635 if (likely(skb_cloned(skb) || ntail > 0)) {
1636 err = pskb_expand_head(skb, 0, ntail, GFP_ATOMIC);
1641 /* FIXME: The use of this function with non-linear skb's really needs
1644 err = skb_linearize(skb);
1648 memset(skb->data + skb->len, 0, pad);
1656 EXPORT_SYMBOL(__skb_pad);
1659 * pskb_put - add data to the tail of a potentially fragmented buffer
1660 * @skb: start of the buffer to use
1661 * @tail: tail fragment of the buffer to use
1662 * @len: amount of data to add
1664 * This function extends the used data area of the potentially
1665 * fragmented buffer. @tail must be the last fragment of @skb -- or
1666 * @skb itself. If this would exceed the total buffer size the kernel
1667 * will panic. A pointer to the first byte of the extra data is
1671 void *pskb_put(struct sk_buff *skb, struct sk_buff *tail, int len)
1674 skb->data_len += len;
1677 return skb_put(tail, len);
1679 EXPORT_SYMBOL_GPL(pskb_put);
1682 * skb_put - add data to a buffer
1683 * @skb: buffer to use
1684 * @len: amount of data to add
1686 * This function extends the used data area of the buffer. If this would
1687 * exceed the total buffer size the kernel will panic. A pointer to the
1688 * first byte of the extra data is returned.
1690 void *skb_put(struct sk_buff *skb, unsigned int len)
1692 void *tmp = skb_tail_pointer(skb);
1693 SKB_LINEAR_ASSERT(skb);
1696 if (unlikely(skb->tail > skb->end))
1697 skb_over_panic(skb, len, __builtin_return_address(0));
1700 EXPORT_SYMBOL(skb_put);
1703 * skb_push - add data to the start of a buffer
1704 * @skb: buffer to use
1705 * @len: amount of data to add
1707 * This function extends the used data area of the buffer at the buffer
1708 * start. If this would exceed the total buffer headroom the kernel will
1709 * panic. A pointer to the first byte of the extra data is returned.
1711 void *skb_push(struct sk_buff *skb, unsigned int len)
1715 if (unlikely(skb->data<skb->head))
1716 skb_under_panic(skb, len, __builtin_return_address(0));
1719 EXPORT_SYMBOL(skb_push);
1722 * skb_pull - remove data from the start of a buffer
1723 * @skb: buffer to use
1724 * @len: amount of data to remove
1726 * This function removes data from the start of a buffer, returning
1727 * the memory to the headroom. A pointer to the next data in the buffer
1728 * is returned. Once the data has been pulled future pushes will overwrite
1731 void *skb_pull(struct sk_buff *skb, unsigned int len)
1733 return skb_pull_inline(skb, len);
1735 EXPORT_SYMBOL(skb_pull);
1738 * skb_trim - remove end from a buffer
1739 * @skb: buffer to alter
1742 * Cut the length of a buffer down by removing data from the tail. If
1743 * the buffer is already under the length specified it is not modified.
1744 * The skb must be linear.
1746 void skb_trim(struct sk_buff *skb, unsigned int len)
1749 __skb_trim(skb, len);
1751 EXPORT_SYMBOL(skb_trim);
1753 /* Trims skb to length len. It can change skb pointers.
1756 int ___pskb_trim(struct sk_buff *skb, unsigned int len)
1758 struct sk_buff **fragp;
1759 struct sk_buff *frag;
1760 int offset = skb_headlen(skb);
1761 int nfrags = skb_shinfo(skb)->nr_frags;
1765 if (skb_cloned(skb) &&
1766 unlikely((err = pskb_expand_head(skb, 0, 0, GFP_ATOMIC))))
1773 for (; i < nfrags; i++) {
1774 int end = offset + skb_frag_size(&skb_shinfo(skb)->frags[i]);
1781 skb_frag_size_set(&skb_shinfo(skb)->frags[i++], len - offset);
1784 skb_shinfo(skb)->nr_frags = i;
1786 for (; i < nfrags; i++)
1787 skb_frag_unref(skb, i);
1789 if (skb_has_frag_list(skb))
1790 skb_drop_fraglist(skb);
1794 for (fragp = &skb_shinfo(skb)->frag_list; (frag = *fragp);
1795 fragp = &frag->next) {
1796 int end = offset + frag->len;
1798 if (skb_shared(frag)) {
1799 struct sk_buff *nfrag;
1801 nfrag = skb_clone(frag, GFP_ATOMIC);
1802 if (unlikely(!nfrag))
1805 nfrag->next = frag->next;
1817 unlikely((err = pskb_trim(frag, len - offset))))
1821 skb_drop_list(&frag->next);
1826 if (len > skb_headlen(skb)) {
1827 skb->data_len -= skb->len - len;
1832 skb_set_tail_pointer(skb, len);
1835 if (!skb->sk || skb->destructor == sock_edemux)
1839 EXPORT_SYMBOL(___pskb_trim);
1842 * __pskb_pull_tail - advance tail of skb header
1843 * @skb: buffer to reallocate
1844 * @delta: number of bytes to advance tail
1846 * The function makes a sense only on a fragmented &sk_buff,
1847 * it expands header moving its tail forward and copying necessary
1848 * data from fragmented part.
1850 * &sk_buff MUST have reference count of 1.
1852 * Returns %NULL (and &sk_buff does not change) if pull failed
1853 * or value of new tail of skb in the case of success.
1855 * All the pointers pointing into skb header may change and must be
1856 * reloaded after call to this function.
1859 /* Moves tail of skb head forward, copying data from fragmented part,
1860 * when it is necessary.
1861 * 1. It may fail due to malloc failure.
1862 * 2. It may change skb pointers.
1864 * It is pretty complicated. Luckily, it is called only in exceptional cases.
1866 void *__pskb_pull_tail(struct sk_buff *skb, int delta)
1868 /* If skb has not enough free space at tail, get new one
1869 * plus 128 bytes for future expansions. If we have enough
1870 * room at tail, reallocate without expansion only if skb is cloned.
1872 int i, k, eat = (skb->tail + delta) - skb->end;
1874 if (eat > 0 || skb_cloned(skb)) {
1875 if (pskb_expand_head(skb, 0, eat > 0 ? eat + 128 : 0,
1880 BUG_ON(skb_copy_bits(skb, skb_headlen(skb),
1881 skb_tail_pointer(skb), delta));
1883 /* Optimization: no fragments, no reasons to preestimate
1884 * size of pulled pages. Superb.
1886 if (!skb_has_frag_list(skb))
1889 /* Estimate size of pulled pages. */
1891 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1892 int size = skb_frag_size(&skb_shinfo(skb)->frags[i]);
1899 /* If we need update frag list, we are in troubles.
1900 * Certainly, it is possible to add an offset to skb data,
1901 * but taking into account that pulling is expected to
1902 * be very rare operation, it is worth to fight against
1903 * further bloating skb head and crucify ourselves here instead.
1904 * Pure masohism, indeed. 8)8)
1907 struct sk_buff *list = skb_shinfo(skb)->frag_list;
1908 struct sk_buff *clone = NULL;
1909 struct sk_buff *insp = NULL;
1914 if (list->len <= eat) {
1915 /* Eaten as whole. */
1920 /* Eaten partially. */
1922 if (skb_shared(list)) {
1923 /* Sucks! We need to fork list. :-( */
1924 clone = skb_clone(list, GFP_ATOMIC);
1930 /* This may be pulled without
1934 if (!pskb_pull(list, eat)) {
1942 /* Free pulled out fragments. */
1943 while ((list = skb_shinfo(skb)->frag_list) != insp) {
1944 skb_shinfo(skb)->frag_list = list->next;
1947 /* And insert new clone at head. */
1950 skb_shinfo(skb)->frag_list = clone;
1953 /* Success! Now we may commit changes to skb data. */
1958 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1959 int size = skb_frag_size(&skb_shinfo(skb)->frags[i]);
1962 skb_frag_unref(skb, i);
1965 skb_shinfo(skb)->frags[k] = skb_shinfo(skb)->frags[i];
1967 skb_shinfo(skb)->frags[k].page_offset += eat;
1968 skb_frag_size_sub(&skb_shinfo(skb)->frags[k], eat);
1976 skb_shinfo(skb)->nr_frags = k;
1980 skb->data_len -= delta;
1983 skb_zcopy_clear(skb, false);
1985 return skb_tail_pointer(skb);
1987 EXPORT_SYMBOL(__pskb_pull_tail);
1990 * skb_copy_bits - copy bits from skb to kernel buffer
1992 * @offset: offset in source
1993 * @to: destination buffer
1994 * @len: number of bytes to copy
1996 * Copy the specified number of bytes from the source skb to the
1997 * destination buffer.
2000 * If its prototype is ever changed,
2001 * check arch/{*}/net/{*}.S files,
2002 * since it is called from BPF assembly code.
2004 int skb_copy_bits(const struct sk_buff *skb, int offset, void *to, int len)
2006 int start = skb_headlen(skb);
2007 struct sk_buff *frag_iter;
2010 if (offset > (int)skb->len - len)
2014 if ((copy = start - offset) > 0) {
2017 skb_copy_from_linear_data_offset(skb, offset, to, copy);
2018 if ((len -= copy) == 0)
2024 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
2026 skb_frag_t *f = &skb_shinfo(skb)->frags[i];
2028 WARN_ON(start > offset + len);
2030 end = start + skb_frag_size(f);
2031 if ((copy = end - offset) > 0) {
2032 u32 p_off, p_len, copied;
2039 skb_frag_foreach_page(f,
2040 f->page_offset + offset - start,
2041 copy, p, p_off, p_len, copied) {
2042 vaddr = kmap_atomic(p);
2043 memcpy(to + copied, vaddr + p_off, p_len);
2044 kunmap_atomic(vaddr);
2047 if ((len -= copy) == 0)
2055 skb_walk_frags(skb, frag_iter) {
2058 WARN_ON(start > offset + len);
2060 end = start + frag_iter->len;
2061 if ((copy = end - offset) > 0) {
2064 if (skb_copy_bits(frag_iter, offset - start, to, copy))
2066 if ((len -= copy) == 0)
2080 EXPORT_SYMBOL(skb_copy_bits);
2083 * Callback from splice_to_pipe(), if we need to release some pages
2084 * at the end of the spd in case we error'ed out in filling the pipe.
2086 static void sock_spd_release(struct splice_pipe_desc *spd, unsigned int i)
2088 put_page(spd->pages[i]);
2091 static struct page *linear_to_page(struct page *page, unsigned int *len,
2092 unsigned int *offset,
2095 struct page_frag *pfrag = sk_page_frag(sk);
2097 if (!sk_page_frag_refill(sk, pfrag))
2100 *len = min_t(unsigned int, *len, pfrag->size - pfrag->offset);
2102 memcpy(page_address(pfrag->page) + pfrag->offset,
2103 page_address(page) + *offset, *len);
2104 *offset = pfrag->offset;
2105 pfrag->offset += *len;
2110 static bool spd_can_coalesce(const struct splice_pipe_desc *spd,
2112 unsigned int offset)
2114 return spd->nr_pages &&
2115 spd->pages[spd->nr_pages - 1] == page &&
2116 (spd->partial[spd->nr_pages - 1].offset +
2117 spd->partial[spd->nr_pages - 1].len == offset);
2121 * Fill page/offset/length into spd, if it can hold more pages.
2123 static bool spd_fill_page(struct splice_pipe_desc *spd,
2124 struct pipe_inode_info *pipe, struct page *page,
2125 unsigned int *len, unsigned int offset,
2129 if (unlikely(spd->nr_pages == MAX_SKB_FRAGS))
2133 page = linear_to_page(page, len, &offset, sk);
2137 if (spd_can_coalesce(spd, page, offset)) {
2138 spd->partial[spd->nr_pages - 1].len += *len;
2142 spd->pages[spd->nr_pages] = page;
2143 spd->partial[spd->nr_pages].len = *len;
2144 spd->partial[spd->nr_pages].offset = offset;
2150 static bool __splice_segment(struct page *page, unsigned int poff,
2151 unsigned int plen, unsigned int *off,
2153 struct splice_pipe_desc *spd, bool linear,
2155 struct pipe_inode_info *pipe)
2160 /* skip this segment if already processed */
2166 /* ignore any bits we already processed */
2172 unsigned int flen = min(*len, plen);
2174 if (spd_fill_page(spd, pipe, page, &flen, poff,
2180 } while (*len && plen);
2186 * Map linear and fragment data from the skb to spd. It reports true if the
2187 * pipe is full or if we already spliced the requested length.
2189 static bool __skb_splice_bits(struct sk_buff *skb, struct pipe_inode_info *pipe,
2190 unsigned int *offset, unsigned int *len,
2191 struct splice_pipe_desc *spd, struct sock *sk)
2194 struct sk_buff *iter;
2196 /* map the linear part :
2197 * If skb->head_frag is set, this 'linear' part is backed by a
2198 * fragment, and if the head is not shared with any clones then
2199 * we can avoid a copy since we own the head portion of this page.
2201 if (__splice_segment(virt_to_page(skb->data),
2202 (unsigned long) skb->data & (PAGE_SIZE - 1),
2205 skb_head_is_locked(skb),
2210 * then map the fragments
2212 for (seg = 0; seg < skb_shinfo(skb)->nr_frags; seg++) {
2213 const skb_frag_t *f = &skb_shinfo(skb)->frags[seg];
2215 if (__splice_segment(skb_frag_page(f),
2216 f->page_offset, skb_frag_size(f),
2217 offset, len, spd, false, sk, pipe))
2221 skb_walk_frags(skb, iter) {
2222 if (*offset >= iter->len) {
2223 *offset -= iter->len;
2226 /* __skb_splice_bits() only fails if the output has no room
2227 * left, so no point in going over the frag_list for the error
2230 if (__skb_splice_bits(iter, pipe, offset, len, spd, sk))
2238 * Map data from the skb to a pipe. Should handle both the linear part,
2239 * the fragments, and the frag list.
2241 int skb_splice_bits(struct sk_buff *skb, struct sock *sk, unsigned int offset,
2242 struct pipe_inode_info *pipe, unsigned int tlen,
2245 struct partial_page partial[MAX_SKB_FRAGS];
2246 struct page *pages[MAX_SKB_FRAGS];
2247 struct splice_pipe_desc spd = {
2250 .nr_pages_max = MAX_SKB_FRAGS,
2251 .ops = &nosteal_pipe_buf_ops,
2252 .spd_release = sock_spd_release,
2256 __skb_splice_bits(skb, pipe, &offset, &tlen, &spd, sk);
2259 ret = splice_to_pipe(pipe, &spd);
2263 EXPORT_SYMBOL_GPL(skb_splice_bits);
2265 /* Send skb data on a socket. Socket must be locked. */
2266 int skb_send_sock_locked(struct sock *sk, struct sk_buff *skb, int offset,
2269 unsigned int orig_len = len;
2270 struct sk_buff *head = skb;
2271 unsigned short fragidx;
2276 /* Deal with head data */
2277 while (offset < skb_headlen(skb) && len) {
2281 slen = min_t(int, len, skb_headlen(skb) - offset);
2282 kv.iov_base = skb->data + offset;
2284 memset(&msg, 0, sizeof(msg));
2286 ret = kernel_sendmsg_locked(sk, &msg, &kv, 1, slen);
2294 /* All the data was skb head? */
2298 /* Make offset relative to start of frags */
2299 offset -= skb_headlen(skb);
2301 /* Find where we are in frag list */
2302 for (fragidx = 0; fragidx < skb_shinfo(skb)->nr_frags; fragidx++) {
2303 skb_frag_t *frag = &skb_shinfo(skb)->frags[fragidx];
2305 if (offset < frag->size)
2308 offset -= frag->size;
2311 for (; len && fragidx < skb_shinfo(skb)->nr_frags; fragidx++) {
2312 skb_frag_t *frag = &skb_shinfo(skb)->frags[fragidx];
2314 slen = min_t(size_t, len, frag->size - offset);
2317 ret = kernel_sendpage_locked(sk, frag->page.p,
2318 frag->page_offset + offset,
2319 slen, MSG_DONTWAIT);
2332 /* Process any frag lists */
2335 if (skb_has_frag_list(skb)) {
2336 skb = skb_shinfo(skb)->frag_list;
2339 } else if (skb->next) {
2346 return orig_len - len;
2349 return orig_len == len ? ret : orig_len - len;
2351 EXPORT_SYMBOL_GPL(skb_send_sock_locked);
2353 /* Send skb data on a socket. */
2354 int skb_send_sock(struct sock *sk, struct sk_buff *skb, int offset, int len)
2359 ret = skb_send_sock_locked(sk, skb, offset, len);
2364 EXPORT_SYMBOL_GPL(skb_send_sock);
2367 * skb_store_bits - store bits from kernel buffer to skb
2368 * @skb: destination buffer
2369 * @offset: offset in destination
2370 * @from: source buffer
2371 * @len: number of bytes to copy
2373 * Copy the specified number of bytes from the source buffer to the
2374 * destination skb. This function handles all the messy bits of
2375 * traversing fragment lists and such.
2378 int skb_store_bits(struct sk_buff *skb, int offset, const void *from, int len)
2380 int start = skb_headlen(skb);
2381 struct sk_buff *frag_iter;
2384 if (offset > (int)skb->len - len)
2387 if ((copy = start - offset) > 0) {
2390 skb_copy_to_linear_data_offset(skb, offset, from, copy);
2391 if ((len -= copy) == 0)
2397 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
2398 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
2401 WARN_ON(start > offset + len);
2403 end = start + skb_frag_size(frag);
2404 if ((copy = end - offset) > 0) {
2405 u32 p_off, p_len, copied;
2412 skb_frag_foreach_page(frag,
2413 frag->page_offset + offset - start,
2414 copy, p, p_off, p_len, copied) {
2415 vaddr = kmap_atomic(p);
2416 memcpy(vaddr + p_off, from + copied, p_len);
2417 kunmap_atomic(vaddr);
2420 if ((len -= copy) == 0)
2428 skb_walk_frags(skb, frag_iter) {
2431 WARN_ON(start > offset + len);
2433 end = start + frag_iter->len;
2434 if ((copy = end - offset) > 0) {
2437 if (skb_store_bits(frag_iter, offset - start,
2440 if ((len -= copy) == 0)
2453 EXPORT_SYMBOL(skb_store_bits);
2455 /* Checksum skb data. */
2456 __wsum __skb_checksum(const struct sk_buff *skb, int offset, int len,
2457 __wsum csum, const struct skb_checksum_ops *ops)
2459 int start = skb_headlen(skb);
2460 int i, copy = start - offset;
2461 struct sk_buff *frag_iter;
2464 /* Checksum header. */
2468 csum = ops->update(skb->data + offset, copy, csum);
2469 if ((len -= copy) == 0)
2475 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
2477 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
2479 WARN_ON(start > offset + len);
2481 end = start + skb_frag_size(frag);
2482 if ((copy = end - offset) > 0) {
2483 u32 p_off, p_len, copied;
2491 skb_frag_foreach_page(frag,
2492 frag->page_offset + offset - start,
2493 copy, p, p_off, p_len, copied) {
2494 vaddr = kmap_atomic(p);
2495 csum2 = ops->update(vaddr + p_off, p_len, 0);
2496 kunmap_atomic(vaddr);
2497 csum = ops->combine(csum, csum2, pos, p_len);
2508 skb_walk_frags(skb, frag_iter) {
2511 WARN_ON(start > offset + len);
2513 end = start + frag_iter->len;
2514 if ((copy = end - offset) > 0) {
2518 csum2 = __skb_checksum(frag_iter, offset - start,
2520 csum = ops->combine(csum, csum2, pos, copy);
2521 if ((len -= copy) == 0)
2532 EXPORT_SYMBOL(__skb_checksum);
2534 __wsum skb_checksum(const struct sk_buff *skb, int offset,
2535 int len, __wsum csum)
2537 const struct skb_checksum_ops ops = {
2538 .update = csum_partial_ext,
2539 .combine = csum_block_add_ext,
2542 return __skb_checksum(skb, offset, len, csum, &ops);
2544 EXPORT_SYMBOL(skb_checksum);
2546 /* Both of above in one bottle. */
2548 __wsum skb_copy_and_csum_bits(const struct sk_buff *skb, int offset,
2549 u8 *to, int len, __wsum csum)
2551 int start = skb_headlen(skb);
2552 int i, copy = start - offset;
2553 struct sk_buff *frag_iter;
2560 csum = csum_partial_copy_nocheck(skb->data + offset, to,
2562 if ((len -= copy) == 0)
2569 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
2572 WARN_ON(start > offset + len);
2574 end = start + skb_frag_size(&skb_shinfo(skb)->frags[i]);
2575 if ((copy = end - offset) > 0) {
2576 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
2577 u32 p_off, p_len, copied;
2585 skb_frag_foreach_page(frag,
2586 frag->page_offset + offset - start,
2587 copy, p, p_off, p_len, copied) {
2588 vaddr = kmap_atomic(p);
2589 csum2 = csum_partial_copy_nocheck(vaddr + p_off,
2592 kunmap_atomic(vaddr);
2593 csum = csum_block_add(csum, csum2, pos);
2605 skb_walk_frags(skb, frag_iter) {
2609 WARN_ON(start > offset + len);
2611 end = start + frag_iter->len;
2612 if ((copy = end - offset) > 0) {
2615 csum2 = skb_copy_and_csum_bits(frag_iter,
2618 csum = csum_block_add(csum, csum2, pos);
2619 if ((len -= copy) == 0)
2630 EXPORT_SYMBOL(skb_copy_and_csum_bits);
2632 static __wsum warn_crc32c_csum_update(const void *buff, int len, __wsum sum)
2634 net_warn_ratelimited(
2635 "%s: attempt to compute crc32c without libcrc32c.ko\n",
2640 static __wsum warn_crc32c_csum_combine(__wsum csum, __wsum csum2,
2641 int offset, int len)
2643 net_warn_ratelimited(
2644 "%s: attempt to compute crc32c without libcrc32c.ko\n",
2649 static const struct skb_checksum_ops default_crc32c_ops = {
2650 .update = warn_crc32c_csum_update,
2651 .combine = warn_crc32c_csum_combine,
2654 const struct skb_checksum_ops *crc32c_csum_stub __read_mostly =
2655 &default_crc32c_ops;
2656 EXPORT_SYMBOL(crc32c_csum_stub);
2659 * skb_zerocopy_headlen - Calculate headroom needed for skb_zerocopy()
2660 * @from: source buffer
2662 * Calculates the amount of linear headroom needed in the 'to' skb passed
2663 * into skb_zerocopy().
2666 skb_zerocopy_headlen(const struct sk_buff *from)
2668 unsigned int hlen = 0;
2670 if (!from->head_frag ||
2671 skb_headlen(from) < L1_CACHE_BYTES ||
2672 skb_shinfo(from)->nr_frags >= MAX_SKB_FRAGS)
2673 hlen = skb_headlen(from);
2675 if (skb_has_frag_list(from))
2680 EXPORT_SYMBOL_GPL(skb_zerocopy_headlen);
2683 * skb_zerocopy - Zero copy skb to skb
2684 * @to: destination buffer
2685 * @from: source buffer
2686 * @len: number of bytes to copy from source buffer
2687 * @hlen: size of linear headroom in destination buffer
2689 * Copies up to `len` bytes from `from` to `to` by creating references
2690 * to the frags in the source buffer.
2692 * The `hlen` as calculated by skb_zerocopy_headlen() specifies the
2693 * headroom in the `to` buffer.
2696 * 0: everything is OK
2697 * -ENOMEM: couldn't orphan frags of @from due to lack of memory
2698 * -EFAULT: skb_copy_bits() found some problem with skb geometry
2701 skb_zerocopy(struct sk_buff *to, struct sk_buff *from, int len, int hlen)
2704 int plen = 0; /* length of skb->head fragment */
2707 unsigned int offset;
2709 BUG_ON(!from->head_frag && !hlen);
2711 /* dont bother with small payloads */
2712 if (len <= skb_tailroom(to))
2713 return skb_copy_bits(from, 0, skb_put(to, len), len);
2716 ret = skb_copy_bits(from, 0, skb_put(to, hlen), hlen);
2721 plen = min_t(int, skb_headlen(from), len);
2723 page = virt_to_head_page(from->head);
2724 offset = from->data - (unsigned char *)page_address(page);
2725 __skb_fill_page_desc(to, 0, page, offset, plen);
2732 to->truesize += len + plen;
2733 to->len += len + plen;
2734 to->data_len += len + plen;
2736 if (unlikely(skb_orphan_frags(from, GFP_ATOMIC))) {
2740 skb_zerocopy_clone(to, from, GFP_ATOMIC);
2742 for (i = 0; i < skb_shinfo(from)->nr_frags; i++) {
2745 skb_shinfo(to)->frags[j] = skb_shinfo(from)->frags[i];
2746 skb_shinfo(to)->frags[j].size = min_t(int, skb_shinfo(to)->frags[j].size, len);
2747 len -= skb_shinfo(to)->frags[j].size;
2748 skb_frag_ref(to, j);
2751 skb_shinfo(to)->nr_frags = j;
2755 EXPORT_SYMBOL_GPL(skb_zerocopy);
2757 void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to)
2762 if (skb->ip_summed == CHECKSUM_PARTIAL)
2763 csstart = skb_checksum_start_offset(skb);
2765 csstart = skb_headlen(skb);
2767 BUG_ON(csstart > skb_headlen(skb));
2769 skb_copy_from_linear_data(skb, to, csstart);
2772 if (csstart != skb->len)
2773 csum = skb_copy_and_csum_bits(skb, csstart, to + csstart,
2774 skb->len - csstart, 0);
2776 if (skb->ip_summed == CHECKSUM_PARTIAL) {
2777 long csstuff = csstart + skb->csum_offset;
2779 *((__sum16 *)(to + csstuff)) = csum_fold(csum);
2782 EXPORT_SYMBOL(skb_copy_and_csum_dev);
2785 * skb_dequeue - remove from the head of the queue
2786 * @list: list to dequeue from
2788 * Remove the head of the list. The list lock is taken so the function
2789 * may be used safely with other locking list functions. The head item is
2790 * returned or %NULL if the list is empty.
2793 struct sk_buff *skb_dequeue(struct sk_buff_head *list)
2795 unsigned long flags;
2796 struct sk_buff *result;
2798 spin_lock_irqsave(&list->lock, flags);
2799 result = __skb_dequeue(list);
2800 spin_unlock_irqrestore(&list->lock, flags);
2803 EXPORT_SYMBOL(skb_dequeue);
2806 * skb_dequeue_tail - remove from the tail of the queue
2807 * @list: list to dequeue from
2809 * Remove the tail of the list. The list lock is taken so the function
2810 * may be used safely with other locking list functions. The tail item is
2811 * returned or %NULL if the list is empty.
2813 struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list)
2815 unsigned long flags;
2816 struct sk_buff *result;
2818 spin_lock_irqsave(&list->lock, flags);
2819 result = __skb_dequeue_tail(list);
2820 spin_unlock_irqrestore(&list->lock, flags);
2823 EXPORT_SYMBOL(skb_dequeue_tail);
2826 * skb_queue_purge - empty a list
2827 * @list: list to empty
2829 * Delete all buffers on an &sk_buff list. Each buffer is removed from
2830 * the list and one reference dropped. This function takes the list
2831 * lock and is atomic with respect to other list locking functions.
2833 void skb_queue_purge(struct sk_buff_head *list)
2835 struct sk_buff *skb;
2836 while ((skb = skb_dequeue(list)) != NULL)
2839 EXPORT_SYMBOL(skb_queue_purge);
2842 * skb_rbtree_purge - empty a skb rbtree
2843 * @root: root of the rbtree to empty
2845 * Delete all buffers on an &sk_buff rbtree. Each buffer is removed from
2846 * the list and one reference dropped. This function does not take
2847 * any lock. Synchronization should be handled by the caller (e.g., TCP
2848 * out-of-order queue is protected by the socket lock).
2850 void skb_rbtree_purge(struct rb_root *root)
2852 struct rb_node *p = rb_first(root);
2855 struct sk_buff *skb = rb_entry(p, struct sk_buff, rbnode);
2858 rb_erase(&skb->rbnode, root);
2864 * skb_queue_head - queue a buffer at the list head
2865 * @list: list to use
2866 * @newsk: buffer to queue
2868 * Queue a buffer at the start of the list. This function takes the
2869 * list lock and can be used safely with other locking &sk_buff functions
2872 * A buffer cannot be placed on two lists at the same time.
2874 void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk)
2876 unsigned long flags;
2878 spin_lock_irqsave(&list->lock, flags);
2879 __skb_queue_head(list, newsk);
2880 spin_unlock_irqrestore(&list->lock, flags);
2882 EXPORT_SYMBOL(skb_queue_head);
2885 * skb_queue_tail - queue a buffer at the list tail
2886 * @list: list to use
2887 * @newsk: buffer to queue
2889 * Queue a buffer at the tail of the list. This function takes the
2890 * list lock and can be used safely with other locking &sk_buff functions
2893 * A buffer cannot be placed on two lists at the same time.
2895 void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk)
2897 unsigned long flags;
2899 spin_lock_irqsave(&list->lock, flags);
2900 __skb_queue_tail(list, newsk);
2901 spin_unlock_irqrestore(&list->lock, flags);
2903 EXPORT_SYMBOL(skb_queue_tail);
2906 * skb_unlink - remove a buffer from a list
2907 * @skb: buffer to remove
2908 * @list: list to use
2910 * Remove a packet from a list. The list locks are taken and this
2911 * function is atomic with respect to other list locked calls
2913 * You must know what list the SKB is on.
2915 void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
2917 unsigned long flags;
2919 spin_lock_irqsave(&list->lock, flags);
2920 __skb_unlink(skb, list);
2921 spin_unlock_irqrestore(&list->lock, flags);
2923 EXPORT_SYMBOL(skb_unlink);
2926 * skb_append - append a buffer
2927 * @old: buffer to insert after
2928 * @newsk: buffer to insert
2929 * @list: list to use
2931 * Place a packet after a given packet in a list. The list locks are taken
2932 * and this function is atomic with respect to other list locked calls.
2933 * A buffer cannot be placed on two lists at the same time.
2935 void skb_append(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list)
2937 unsigned long flags;
2939 spin_lock_irqsave(&list->lock, flags);
2940 __skb_queue_after(list, old, newsk);
2941 spin_unlock_irqrestore(&list->lock, flags);
2943 EXPORT_SYMBOL(skb_append);
2946 * skb_insert - insert a buffer
2947 * @old: buffer to insert before
2948 * @newsk: buffer to insert
2949 * @list: list to use
2951 * Place a packet before a given packet in a list. The list locks are
2952 * taken and this function is atomic with respect to other list locked
2955 * A buffer cannot be placed on two lists at the same time.
2957 void skb_insert(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list)
2959 unsigned long flags;
2961 spin_lock_irqsave(&list->lock, flags);
2962 __skb_insert(newsk, old->prev, old, list);
2963 spin_unlock_irqrestore(&list->lock, flags);
2965 EXPORT_SYMBOL(skb_insert);
2967 static inline void skb_split_inside_header(struct sk_buff *skb,
2968 struct sk_buff* skb1,
2969 const u32 len, const int pos)
2973 skb_copy_from_linear_data_offset(skb, len, skb_put(skb1, pos - len),
2975 /* And move data appendix as is. */
2976 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++)
2977 skb_shinfo(skb1)->frags[i] = skb_shinfo(skb)->frags[i];
2979 skb_shinfo(skb1)->nr_frags = skb_shinfo(skb)->nr_frags;
2980 skb_shinfo(skb)->nr_frags = 0;
2981 skb1->data_len = skb->data_len;
2982 skb1->len += skb1->data_len;
2985 skb_set_tail_pointer(skb, len);
2988 static inline void skb_split_no_header(struct sk_buff *skb,
2989 struct sk_buff* skb1,
2990 const u32 len, int pos)
2993 const int nfrags = skb_shinfo(skb)->nr_frags;
2995 skb_shinfo(skb)->nr_frags = 0;
2996 skb1->len = skb1->data_len = skb->len - len;
2998 skb->data_len = len - pos;
3000 for (i = 0; i < nfrags; i++) {
3001 int size = skb_frag_size(&skb_shinfo(skb)->frags[i]);
3003 if (pos + size > len) {
3004 skb_shinfo(skb1)->frags[k] = skb_shinfo(skb)->frags[i];
3008 * We have two variants in this case:
3009 * 1. Move all the frag to the second
3010 * part, if it is possible. F.e.
3011 * this approach is mandatory for TUX,
3012 * where splitting is expensive.
3013 * 2. Split is accurately. We make this.
3015 skb_frag_ref(skb, i);
3016 skb_shinfo(skb1)->frags[0].page_offset += len - pos;
3017 skb_frag_size_sub(&skb_shinfo(skb1)->frags[0], len - pos);
3018 skb_frag_size_set(&skb_shinfo(skb)->frags[i], len - pos);
3019 skb_shinfo(skb)->nr_frags++;
3023 skb_shinfo(skb)->nr_frags++;
3026 skb_shinfo(skb1)->nr_frags = k;
3030 * skb_split - Split fragmented skb to two parts at length len.
3031 * @skb: the buffer to split
3032 * @skb1: the buffer to receive the second part
3033 * @len: new length for skb
3035 void skb_split(struct sk_buff *skb, struct sk_buff *skb1, const u32 len)
3037 int pos = skb_headlen(skb);
3039 skb_shinfo(skb1)->tx_flags |= skb_shinfo(skb)->tx_flags &
3041 skb_zerocopy_clone(skb1, skb, 0);
3042 if (len < pos) /* Split line is inside header. */
3043 skb_split_inside_header(skb, skb1, len, pos);
3044 else /* Second chunk has no header, nothing to copy. */
3045 skb_split_no_header(skb, skb1, len, pos);
3047 EXPORT_SYMBOL(skb_split);
3049 /* Shifting from/to a cloned skb is a no-go.
3051 * Caller cannot keep skb_shinfo related pointers past calling here!
3053 static int skb_prepare_for_shift(struct sk_buff *skb)
3055 return skb_cloned(skb) && pskb_expand_head(skb, 0, 0, GFP_ATOMIC);
3059 * skb_shift - Shifts paged data partially from skb to another
3060 * @tgt: buffer into which tail data gets added
3061 * @skb: buffer from which the paged data comes from
3062 * @shiftlen: shift up to this many bytes
3064 * Attempts to shift up to shiftlen worth of bytes, which may be less than
3065 * the length of the skb, from skb to tgt. Returns number bytes shifted.
3066 * It's up to caller to free skb if everything was shifted.
3068 * If @tgt runs out of frags, the whole operation is aborted.
3070 * Skb cannot include anything else but paged data while tgt is allowed
3071 * to have non-paged data as well.
3073 * TODO: full sized shift could be optimized but that would need
3074 * specialized skb free'er to handle frags without up-to-date nr_frags.
3076 int skb_shift(struct sk_buff *tgt, struct sk_buff *skb, int shiftlen)
3078 int from, to, merge, todo;
3079 struct skb_frag_struct *fragfrom, *fragto;
3081 BUG_ON(shiftlen > skb->len);
3083 if (skb_headlen(skb))
3085 if (skb_zcopy(tgt) || skb_zcopy(skb))
3090 to = skb_shinfo(tgt)->nr_frags;
3091 fragfrom = &skb_shinfo(skb)->frags[from];
3093 /* Actual merge is delayed until the point when we know we can
3094 * commit all, so that we don't have to undo partial changes
3097 !skb_can_coalesce(tgt, to, skb_frag_page(fragfrom),
3098 fragfrom->page_offset)) {
3103 todo -= skb_frag_size(fragfrom);
3105 if (skb_prepare_for_shift(skb) ||
3106 skb_prepare_for_shift(tgt))
3109 /* All previous frag pointers might be stale! */
3110 fragfrom = &skb_shinfo(skb)->frags[from];
3111 fragto = &skb_shinfo(tgt)->frags[merge];
3113 skb_frag_size_add(fragto, shiftlen);
3114 skb_frag_size_sub(fragfrom, shiftlen);
3115 fragfrom->page_offset += shiftlen;
3123 /* Skip full, not-fitting skb to avoid expensive operations */
3124 if ((shiftlen == skb->len) &&
3125 (skb_shinfo(skb)->nr_frags - from) > (MAX_SKB_FRAGS - to))
3128 if (skb_prepare_for_shift(skb) || skb_prepare_for_shift(tgt))
3131 while ((todo > 0) && (from < skb_shinfo(skb)->nr_frags)) {
3132 if (to == MAX_SKB_FRAGS)
3135 fragfrom = &skb_shinfo(skb)->frags[from];
3136 fragto = &skb_shinfo(tgt)->frags[to];
3138 if (todo >= skb_frag_size(fragfrom)) {
3139 *fragto = *fragfrom;
3140 todo -= skb_frag_size(fragfrom);
3145 __skb_frag_ref(fragfrom);
3146 fragto->page = fragfrom->page;
3147 fragto->page_offset = fragfrom->page_offset;
3148 skb_frag_size_set(fragto, todo);
3150 fragfrom->page_offset += todo;
3151 skb_frag_size_sub(fragfrom, todo);
3159 /* Ready to "commit" this state change to tgt */
3160 skb_shinfo(tgt)->nr_frags = to;
3163 fragfrom = &skb_shinfo(skb)->frags[0];
3164 fragto = &skb_shinfo(tgt)->frags[merge];
3166 skb_frag_size_add(fragto, skb_frag_size(fragfrom));
3167 __skb_frag_unref(fragfrom);
3170 /* Reposition in the original skb */
3172 while (from < skb_shinfo(skb)->nr_frags)
3173 skb_shinfo(skb)->frags[to++] = skb_shinfo(skb)->frags[from++];
3174 skb_shinfo(skb)->nr_frags = to;
3176 BUG_ON(todo > 0 && !skb_shinfo(skb)->nr_frags);
3179 /* Most likely the tgt won't ever need its checksum anymore, skb on
3180 * the other hand might need it if it needs to be resent
3182 tgt->ip_summed = CHECKSUM_PARTIAL;
3183 skb->ip_summed = CHECKSUM_PARTIAL;
3185 /* Yak, is it really working this way? Some helper please? */
3186 skb->len -= shiftlen;
3187 skb->data_len -= shiftlen;
3188 skb->truesize -= shiftlen;
3189 tgt->len += shiftlen;
3190 tgt->data_len += shiftlen;
3191 tgt->truesize += shiftlen;
3197 * skb_prepare_seq_read - Prepare a sequential read of skb data
3198 * @skb: the buffer to read
3199 * @from: lower offset of data to be read
3200 * @to: upper offset of data to be read
3201 * @st: state variable
3203 * Initializes the specified state variable. Must be called before
3204 * invoking skb_seq_read() for the first time.
3206 void skb_prepare_seq_read(struct sk_buff *skb, unsigned int from,
3207 unsigned int to, struct skb_seq_state *st)
3209 st->lower_offset = from;
3210 st->upper_offset = to;
3211 st->root_skb = st->cur_skb = skb;
3212 st->frag_idx = st->stepped_offset = 0;
3213 st->frag_data = NULL;
3215 EXPORT_SYMBOL(skb_prepare_seq_read);
3218 * skb_seq_read - Sequentially read skb data
3219 * @consumed: number of bytes consumed by the caller so far
3220 * @data: destination pointer for data to be returned
3221 * @st: state variable
3223 * Reads a block of skb data at @consumed relative to the
3224 * lower offset specified to skb_prepare_seq_read(). Assigns
3225 * the head of the data block to @data and returns the length
3226 * of the block or 0 if the end of the skb data or the upper
3227 * offset has been reached.
3229 * The caller is not required to consume all of the data
3230 * returned, i.e. @consumed is typically set to the number
3231 * of bytes already consumed and the next call to
3232 * skb_seq_read() will return the remaining part of the block.
3234 * Note 1: The size of each block of data returned can be arbitrary,
3235 * this limitation is the cost for zerocopy sequential
3236 * reads of potentially non linear data.
3238 * Note 2: Fragment lists within fragments are not implemented
3239 * at the moment, state->root_skb could be replaced with
3240 * a stack for this purpose.
3242 unsigned int skb_seq_read(unsigned int consumed, const u8 **data,
3243 struct skb_seq_state *st)
3245 unsigned int block_limit, abs_offset = consumed + st->lower_offset;
3248 if (unlikely(abs_offset >= st->upper_offset)) {
3249 if (st->frag_data) {
3250 kunmap_atomic(st->frag_data);
3251 st->frag_data = NULL;
3257 block_limit = skb_headlen(st->cur_skb) + st->stepped_offset;
3259 if (abs_offset < block_limit && !st->frag_data) {
3260 *data = st->cur_skb->data + (abs_offset - st->stepped_offset);
3261 return block_limit - abs_offset;
3264 if (st->frag_idx == 0 && !st->frag_data)
3265 st->stepped_offset += skb_headlen(st->cur_skb);
3267 while (st->frag_idx < skb_shinfo(st->cur_skb)->nr_frags) {
3268 frag = &skb_shinfo(st->cur_skb)->frags[st->frag_idx];
3269 block_limit = skb_frag_size(frag) + st->stepped_offset;
3271 if (abs_offset < block_limit) {
3273 st->frag_data = kmap_atomic(skb_frag_page(frag));
3275 *data = (u8 *) st->frag_data + frag->page_offset +
3276 (abs_offset - st->stepped_offset);
3278 return block_limit - abs_offset;
3281 if (st->frag_data) {
3282 kunmap_atomic(st->frag_data);
3283 st->frag_data = NULL;
3287 st->stepped_offset += skb_frag_size(frag);
3290 if (st->frag_data) {
3291 kunmap_atomic(st->frag_data);
3292 st->frag_data = NULL;
3295 if (st->root_skb == st->cur_skb && skb_has_frag_list(st->root_skb)) {
3296 st->cur_skb = skb_shinfo(st->root_skb)->frag_list;
3299 } else if (st->cur_skb->next) {
3300 st->cur_skb = st->cur_skb->next;
3307 EXPORT_SYMBOL(skb_seq_read);
3310 * skb_abort_seq_read - Abort a sequential read of skb data
3311 * @st: state variable
3313 * Must be called if skb_seq_read() was not called until it
3316 void skb_abort_seq_read(struct skb_seq_state *st)
3319 kunmap_atomic(st->frag_data);
3321 EXPORT_SYMBOL(skb_abort_seq_read);
3323 #define TS_SKB_CB(state) ((struct skb_seq_state *) &((state)->cb))
3325 static unsigned int skb_ts_get_next_block(unsigned int offset, const u8 **text,
3326 struct ts_config *conf,
3327 struct ts_state *state)
3329 return skb_seq_read(offset, text, TS_SKB_CB(state));
3332 static void skb_ts_finish(struct ts_config *conf, struct ts_state *state)
3334 skb_abort_seq_read(TS_SKB_CB(state));
3338 * skb_find_text - Find a text pattern in skb data
3339 * @skb: the buffer to look in
3340 * @from: search offset
3342 * @config: textsearch configuration
3344 * Finds a pattern in the skb data according to the specified
3345 * textsearch configuration. Use textsearch_next() to retrieve
3346 * subsequent occurrences of the pattern. Returns the offset
3347 * to the first occurrence or UINT_MAX if no match was found.
3349 unsigned int skb_find_text(struct sk_buff *skb, unsigned int from,
3350 unsigned int to, struct ts_config *config)
3352 struct ts_state state;
3355 config->get_next_block = skb_ts_get_next_block;
3356 config->finish = skb_ts_finish;
3358 skb_prepare_seq_read(skb, from, to, TS_SKB_CB(&state));
3360 ret = textsearch_find(config, &state);
3361 return (ret <= to - from ? ret : UINT_MAX);
3363 EXPORT_SYMBOL(skb_find_text);
3366 * skb_append_datato_frags - append the user data to a skb
3367 * @sk: sock structure
3368 * @skb: skb structure to be appended with user data.
3369 * @getfrag: call back function to be used for getting the user data
3370 * @from: pointer to user message iov
3371 * @length: length of the iov message
3373 * Description: This procedure append the user data in the fragment part
3374 * of the skb if any page alloc fails user this procedure returns -ENOMEM
3376 int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb,
3377 int (*getfrag)(void *from, char *to, int offset,
3378 int len, int odd, struct sk_buff *skb),
3379 void *from, int length)
3381 int frg_cnt = skb_shinfo(skb)->nr_frags;
3385 struct page_frag *pfrag = ¤t->task_frag;
3388 /* Return error if we don't have space for new frag */
3389 if (frg_cnt >= MAX_SKB_FRAGS)
3392 if (!sk_page_frag_refill(sk, pfrag))
3395 /* copy the user data to page */
3396 copy = min_t(int, length, pfrag->size - pfrag->offset);
3398 ret = getfrag(from, page_address(pfrag->page) + pfrag->offset,
3399 offset, copy, 0, skb);
3403 /* copy was successful so update the size parameters */
3404 skb_fill_page_desc(skb, frg_cnt, pfrag->page, pfrag->offset,
3407 pfrag->offset += copy;
3408 get_page(pfrag->page);
3410 skb->truesize += copy;
3411 refcount_add(copy, &sk->sk_wmem_alloc);
3413 skb->data_len += copy;
3417 } while (length > 0);
3421 EXPORT_SYMBOL(skb_append_datato_frags);
3423 int skb_append_pagefrags(struct sk_buff *skb, struct page *page,
3424 int offset, size_t size)
3426 int i = skb_shinfo(skb)->nr_frags;
3428 if (skb_can_coalesce(skb, i, page, offset)) {
3429 skb_frag_size_add(&skb_shinfo(skb)->frags[i - 1], size);
3430 } else if (i < MAX_SKB_FRAGS) {
3432 skb_fill_page_desc(skb, i, page, offset, size);
3439 EXPORT_SYMBOL_GPL(skb_append_pagefrags);
3442 * skb_pull_rcsum - pull skb and update receive checksum
3443 * @skb: buffer to update
3444 * @len: length of data pulled
3446 * This function performs an skb_pull on the packet and updates
3447 * the CHECKSUM_COMPLETE checksum. It should be used on
3448 * receive path processing instead of skb_pull unless you know
3449 * that the checksum difference is zero (e.g., a valid IP header)
3450 * or you are setting ip_summed to CHECKSUM_NONE.
3452 void *skb_pull_rcsum(struct sk_buff *skb, unsigned int len)
3454 unsigned char *data = skb->data;
3456 BUG_ON(len > skb->len);
3457 __skb_pull(skb, len);
3458 skb_postpull_rcsum(skb, data, len);
3461 EXPORT_SYMBOL_GPL(skb_pull_rcsum);
3463 static inline skb_frag_t skb_head_frag_to_page_desc(struct sk_buff *frag_skb)
3465 skb_frag_t head_frag;
3468 page = virt_to_head_page(frag_skb->head);
3469 head_frag.page.p = page;
3470 head_frag.page_offset = frag_skb->data -
3471 (unsigned char *)page_address(page);
3472 head_frag.size = skb_headlen(frag_skb);
3477 * skb_segment - Perform protocol segmentation on skb.
3478 * @head_skb: buffer to segment
3479 * @features: features for the output path (see dev->features)
3481 * This function performs segmentation on the given skb. It returns
3482 * a pointer to the first in a list of new skbs for the segments.
3483 * In case of error it returns ERR_PTR(err).
3485 struct sk_buff *skb_segment(struct sk_buff *head_skb,
3486 netdev_features_t features)
3488 struct sk_buff *segs = NULL;
3489 struct sk_buff *tail = NULL;
3490 struct sk_buff *list_skb = skb_shinfo(head_skb)->frag_list;
3491 skb_frag_t *frag = skb_shinfo(head_skb)->frags;
3492 unsigned int mss = skb_shinfo(head_skb)->gso_size;
3493 unsigned int doffset = head_skb->data - skb_mac_header(head_skb);
3494 struct sk_buff *frag_skb = head_skb;
3495 unsigned int offset = doffset;
3496 unsigned int tnl_hlen = skb_tnl_header_len(head_skb);
3497 unsigned int partial_segs = 0;
3498 unsigned int headroom;
3499 unsigned int len = head_skb->len;
3502 int nfrags = skb_shinfo(head_skb)->nr_frags;
3508 __skb_push(head_skb, doffset);
3509 proto = skb_network_protocol(head_skb, &dummy);
3510 if (unlikely(!proto))
3511 return ERR_PTR(-EINVAL);
3513 sg = !!(features & NETIF_F_SG);
3514 csum = !!can_checksum_protocol(features, proto);
3516 if (sg && csum && (mss != GSO_BY_FRAGS)) {
3517 if (!(features & NETIF_F_GSO_PARTIAL)) {
3518 struct sk_buff *iter;
3519 unsigned int frag_len;
3522 !net_gso_ok(features, skb_shinfo(head_skb)->gso_type))
3525 /* If we get here then all the required
3526 * GSO features except frag_list are supported.
3527 * Try to split the SKB to multiple GSO SKBs
3528 * with no frag_list.
3529 * Currently we can do that only when the buffers don't
3530 * have a linear part and all the buffers except
3531 * the last are of the same length.
3533 frag_len = list_skb->len;
3534 skb_walk_frags(head_skb, iter) {
3535 if (frag_len != iter->len && iter->next)
3537 if (skb_headlen(iter) && !iter->head_frag)
3543 if (len != frag_len)
3547 /* GSO partial only requires that we trim off any excess that
3548 * doesn't fit into an MSS sized block, so take care of that
3551 partial_segs = len / mss;
3552 if (partial_segs > 1)
3553 mss *= partial_segs;
3559 headroom = skb_headroom(head_skb);
3560 pos = skb_headlen(head_skb);
3563 struct sk_buff *nskb;
3564 skb_frag_t *nskb_frag;
3568 if (unlikely(mss == GSO_BY_FRAGS)) {
3569 len = list_skb->len;
3571 len = head_skb->len - offset;
3576 hsize = skb_headlen(head_skb) - offset;
3579 if (hsize > len || !sg)
3582 if (!hsize && i >= nfrags && skb_headlen(list_skb) &&
3583 (skb_headlen(list_skb) == len || sg)) {
3584 BUG_ON(skb_headlen(list_skb) > len);
3587 nfrags = skb_shinfo(list_skb)->nr_frags;
3588 frag = skb_shinfo(list_skb)->frags;
3589 frag_skb = list_skb;
3590 pos += skb_headlen(list_skb);
3592 while (pos < offset + len) {
3593 BUG_ON(i >= nfrags);
3595 size = skb_frag_size(frag);
3596 if (pos + size > offset + len)
3604 nskb = skb_clone(list_skb, GFP_ATOMIC);
3605 list_skb = list_skb->next;
3607 if (unlikely(!nskb))
3610 if (unlikely(pskb_trim(nskb, len))) {
3615 hsize = skb_end_offset(nskb);
3616 if (skb_cow_head(nskb, doffset + headroom)) {
3621 nskb->truesize += skb_end_offset(nskb) - hsize;
3622 skb_release_head_state(nskb);
3623 __skb_push(nskb, doffset);
3625 nskb = __alloc_skb(hsize + doffset + headroom,
3626 GFP_ATOMIC, skb_alloc_rx_flag(head_skb),
3629 if (unlikely(!nskb))
3632 skb_reserve(nskb, headroom);
3633 __skb_put(nskb, doffset);
3642 __copy_skb_header(nskb, head_skb);
3644 skb_headers_offset_update(nskb, skb_headroom(nskb) - headroom);
3645 skb_reset_mac_len(nskb);
3647 skb_copy_from_linear_data_offset(head_skb, -tnl_hlen,
3648 nskb->data - tnl_hlen,
3649 doffset + tnl_hlen);
3651 if (nskb->len == len + doffset)
3652 goto perform_csum_check;
3655 if (!nskb->remcsum_offload)
3656 nskb->ip_summed = CHECKSUM_NONE;
3657 SKB_GSO_CB(nskb)->csum =
3658 skb_copy_and_csum_bits(head_skb, offset,
3661 SKB_GSO_CB(nskb)->csum_start =
3662 skb_headroom(nskb) + doffset;
3666 nskb_frag = skb_shinfo(nskb)->frags;
3668 skb_copy_from_linear_data_offset(head_skb, offset,
3669 skb_put(nskb, hsize), hsize);
3671 skb_shinfo(nskb)->tx_flags |= skb_shinfo(head_skb)->tx_flags &
3674 if (skb_orphan_frags(frag_skb, GFP_ATOMIC) ||
3675 skb_zerocopy_clone(nskb, frag_skb, GFP_ATOMIC))
3678 while (pos < offset + len) {
3681 nfrags = skb_shinfo(list_skb)->nr_frags;
3682 frag = skb_shinfo(list_skb)->frags;
3683 frag_skb = list_skb;
3684 if (!skb_headlen(list_skb)) {
3687 BUG_ON(!list_skb->head_frag);
3689 /* to make room for head_frag. */
3693 if (skb_orphan_frags(frag_skb, GFP_ATOMIC) ||
3694 skb_zerocopy_clone(nskb, frag_skb,
3698 list_skb = list_skb->next;
3701 if (unlikely(skb_shinfo(nskb)->nr_frags >=
3703 net_warn_ratelimited(
3704 "skb_segment: too many frags: %u %u\n",
3709 *nskb_frag = (i < 0) ? skb_head_frag_to_page_desc(frag_skb) : *frag;
3710 __skb_frag_ref(nskb_frag);
3711 size = skb_frag_size(nskb_frag);
3714 nskb_frag->page_offset += offset - pos;
3715 skb_frag_size_sub(nskb_frag, offset - pos);
3718 skb_shinfo(nskb)->nr_frags++;
3720 if (pos + size <= offset + len) {
3725 skb_frag_size_sub(nskb_frag, pos + size - (offset + len));
3733 nskb->data_len = len - hsize;
3734 nskb->len += nskb->data_len;
3735 nskb->truesize += nskb->data_len;
3739 if (skb_has_shared_frag(nskb)) {
3740 err = __skb_linearize(nskb);
3744 if (!nskb->remcsum_offload)
3745 nskb->ip_summed = CHECKSUM_NONE;
3746 SKB_GSO_CB(nskb)->csum =
3747 skb_checksum(nskb, doffset,
3748 nskb->len - doffset, 0);
3749 SKB_GSO_CB(nskb)->csum_start =
3750 skb_headroom(nskb) + doffset;
3752 } while ((offset += len) < head_skb->len);
3754 /* Some callers want to get the end of the list.
3755 * Put it in segs->prev to avoid walking the list.
3756 * (see validate_xmit_skb_list() for example)
3761 struct sk_buff *iter;
3762 int type = skb_shinfo(head_skb)->gso_type;
3763 unsigned short gso_size = skb_shinfo(head_skb)->gso_size;
3765 /* Update type to add partial and then remove dodgy if set */
3766 type |= (features & NETIF_F_GSO_PARTIAL) / NETIF_F_GSO_PARTIAL * SKB_GSO_PARTIAL;
3767 type &= ~SKB_GSO_DODGY;
3769 /* Update GSO info and prepare to start updating headers on
3770 * our way back down the stack of protocols.
3772 for (iter = segs; iter; iter = iter->next) {
3773 skb_shinfo(iter)->gso_size = gso_size;
3774 skb_shinfo(iter)->gso_segs = partial_segs;
3775 skb_shinfo(iter)->gso_type = type;
3776 SKB_GSO_CB(iter)->data_offset = skb_headroom(iter) + doffset;
3779 if (tail->len - doffset <= gso_size)
3780 skb_shinfo(tail)->gso_size = 0;
3781 else if (tail != segs)
3782 skb_shinfo(tail)->gso_segs = DIV_ROUND_UP(tail->len - doffset, gso_size);
3785 /* Following permits correct backpressure, for protocols
3786 * using skb_set_owner_w().
3787 * Idea is to tranfert ownership from head_skb to last segment.
3789 if (head_skb->destructor == sock_wfree) {
3790 swap(tail->truesize, head_skb->truesize);
3791 swap(tail->destructor, head_skb->destructor);
3792 swap(tail->sk, head_skb->sk);
3797 kfree_skb_list(segs);
3798 return ERR_PTR(err);
3800 EXPORT_SYMBOL_GPL(skb_segment);
3802 int skb_gro_receive(struct sk_buff **head, struct sk_buff *skb)
3804 struct skb_shared_info *pinfo, *skbinfo = skb_shinfo(skb);
3805 unsigned int offset = skb_gro_offset(skb);
3806 unsigned int headlen = skb_headlen(skb);
3807 unsigned int len = skb_gro_len(skb);
3808 struct sk_buff *lp, *p = *head;
3809 unsigned int delta_truesize;
3811 if (unlikely(p->len + len >= 65536))
3814 lp = NAPI_GRO_CB(p)->last;
3815 pinfo = skb_shinfo(lp);
3817 if (headlen <= offset) {
3820 int i = skbinfo->nr_frags;
3821 int nr_frags = pinfo->nr_frags + i;
3823 if (nr_frags > MAX_SKB_FRAGS)
3827 pinfo->nr_frags = nr_frags;
3828 skbinfo->nr_frags = 0;
3830 frag = pinfo->frags + nr_frags;
3831 frag2 = skbinfo->frags + i;
3836 frag->page_offset += offset;
3837 skb_frag_size_sub(frag, offset);
3839 /* all fragments truesize : remove (head size + sk_buff) */
3840 delta_truesize = skb->truesize -
3841 SKB_TRUESIZE(skb_end_offset(skb));
3843 skb->truesize -= skb->data_len;
3844 skb->len -= skb->data_len;
3847 NAPI_GRO_CB(skb)->free = NAPI_GRO_FREE;
3849 } else if (skb->head_frag) {
3850 int nr_frags = pinfo->nr_frags;
3851 skb_frag_t *frag = pinfo->frags + nr_frags;
3852 struct page *page = virt_to_head_page(skb->head);
3853 unsigned int first_size = headlen - offset;
3854 unsigned int first_offset;
3856 if (nr_frags + 1 + skbinfo->nr_frags > MAX_SKB_FRAGS)
3859 first_offset = skb->data -
3860 (unsigned char *)page_address(page) +
3863 pinfo->nr_frags = nr_frags + 1 + skbinfo->nr_frags;
3865 frag->page.p = page;
3866 frag->page_offset = first_offset;
3867 skb_frag_size_set(frag, first_size);
3869 memcpy(frag + 1, skbinfo->frags, sizeof(*frag) * skbinfo->nr_frags);
3870 /* We dont need to clear skbinfo->nr_frags here */
3872 delta_truesize = skb->truesize - SKB_DATA_ALIGN(sizeof(struct sk_buff));
3873 NAPI_GRO_CB(skb)->free = NAPI_GRO_FREE_STOLEN_HEAD;
3878 delta_truesize = skb->truesize;
3879 if (offset > headlen) {
3880 unsigned int eat = offset - headlen;
3882 skbinfo->frags[0].page_offset += eat;
3883 skb_frag_size_sub(&skbinfo->frags[0], eat);
3884 skb->data_len -= eat;
3889 __skb_pull(skb, offset);
3891 if (NAPI_GRO_CB(p)->last == p)
3892 skb_shinfo(p)->frag_list = skb;
3894 NAPI_GRO_CB(p)->last->next = skb;
3895 NAPI_GRO_CB(p)->last = skb;
3896 __skb_header_release(skb);
3900 NAPI_GRO_CB(p)->count++;
3902 p->truesize += delta_truesize;
3905 lp->data_len += len;
3906 lp->truesize += delta_truesize;
3909 NAPI_GRO_CB(skb)->same_flow = 1;
3912 EXPORT_SYMBOL_GPL(skb_gro_receive);
3914 void __init skb_init(void)
3916 skbuff_head_cache = kmem_cache_create_usercopy("skbuff_head_cache",
3917 sizeof(struct sk_buff),
3919 SLAB_HWCACHE_ALIGN|SLAB_PANIC,
3920 offsetof(struct sk_buff, cb),
3921 sizeof_field(struct sk_buff, cb),
3923 skbuff_fclone_cache = kmem_cache_create("skbuff_fclone_cache",
3924 sizeof(struct sk_buff_fclones),
3926 SLAB_HWCACHE_ALIGN|SLAB_PANIC,
3931 __skb_to_sgvec(struct sk_buff *skb, struct scatterlist *sg, int offset, int len,
3932 unsigned int recursion_level)
3934 int start = skb_headlen(skb);
3935 int i, copy = start - offset;
3936 struct sk_buff *frag_iter;
3939 if (unlikely(recursion_level >= 24))
3945 sg_set_buf(sg, skb->data + offset, copy);
3947 if ((len -= copy) == 0)
3952 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
3955 WARN_ON(start > offset + len);
3957 end = start + skb_frag_size(&skb_shinfo(skb)->frags[i]);
3958 if ((copy = end - offset) > 0) {
3959 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
3960 if (unlikely(elt && sg_is_last(&sg[elt - 1])))
3965 sg_set_page(&sg[elt], skb_frag_page(frag), copy,
3966 frag->page_offset+offset-start);
3975 skb_walk_frags(skb, frag_iter) {
3978 WARN_ON(start > offset + len);
3980 end = start + frag_iter->len;
3981 if ((copy = end - offset) > 0) {
3982 if (unlikely(elt && sg_is_last(&sg[elt - 1])))
3987 ret = __skb_to_sgvec(frag_iter, sg+elt, offset - start,
3988 copy, recursion_level + 1);
3989 if (unlikely(ret < 0))
3992 if ((len -= copy) == 0)
4003 * skb_to_sgvec - Fill a scatter-gather list from a socket buffer
4004 * @skb: Socket buffer containing the buffers to be mapped
4005 * @sg: The scatter-gather list to map into
4006 * @offset: The offset into the buffer's contents to start mapping
4007 * @len: Length of buffer space to be mapped
4009 * Fill the specified scatter-gather list with mappings/pointers into a
4010 * region of the buffer space attached to a socket buffer. Returns either
4011 * the number of scatterlist items used, or -EMSGSIZE if the contents
4014 int skb_to_sgvec(struct sk_buff *skb, struct scatterlist *sg, int offset, int len)
4016 int nsg = __skb_to_sgvec(skb, sg, offset, len, 0);
4021 sg_mark_end(&sg[nsg - 1]);
4025 EXPORT_SYMBOL_GPL(skb_to_sgvec);
4027 /* As compared with skb_to_sgvec, skb_to_sgvec_nomark only map skb to given
4028 * sglist without mark the sg which contain last skb data as the end.
4029 * So the caller can mannipulate sg list as will when padding new data after
4030 * the first call without calling sg_unmark_end to expend sg list.
4032 * Scenario to use skb_to_sgvec_nomark:
4034 * 2. skb_to_sgvec_nomark(payload1)
4035 * 3. skb_to_sgvec_nomark(payload2)
4037 * This is equivalent to:
4039 * 2. skb_to_sgvec(payload1)
4041 * 4. skb_to_sgvec(payload2)
4043 * When mapping mutilple payload conditionally, skb_to_sgvec_nomark
4044 * is more preferable.
4046 int skb_to_sgvec_nomark(struct sk_buff *skb, struct scatterlist *sg,
4047 int offset, int len)
4049 return __skb_to_sgvec(skb, sg, offset, len, 0);
4051 EXPORT_SYMBOL_GPL(skb_to_sgvec_nomark);
4056 * skb_cow_data - Check that a socket buffer's data buffers are writable
4057 * @skb: The socket buffer to check.
4058 * @tailbits: Amount of trailing space to be added
4059 * @trailer: Returned pointer to the skb where the @tailbits space begins
4061 * Make sure that the data buffers attached to a socket buffer are
4062 * writable. If they are not, private copies are made of the data buffers
4063 * and the socket buffer is set to use these instead.
4065 * If @tailbits is given, make sure that there is space to write @tailbits
4066 * bytes of data beyond current end of socket buffer. @trailer will be
4067 * set to point to the skb in which this space begins.
4069 * The number of scatterlist elements required to completely map the
4070 * COW'd and extended socket buffer will be returned.
4072 int skb_cow_data(struct sk_buff *skb, int tailbits, struct sk_buff **trailer)
4076 struct sk_buff *skb1, **skb_p;
4078 /* If skb is cloned or its head is paged, reallocate
4079 * head pulling out all the pages (pages are considered not writable
4080 * at the moment even if they are anonymous).
4082 if ((skb_cloned(skb) || skb_shinfo(skb)->nr_frags) &&
4083 __pskb_pull_tail(skb, skb_pagelen(skb)-skb_headlen(skb)) == NULL)
4086 /* Easy case. Most of packets will go this way. */
4087 if (!skb_has_frag_list(skb)) {
4088 /* A little of trouble, not enough of space for trailer.
4089 * This should not happen, when stack is tuned to generate
4090 * good frames. OK, on miss we reallocate and reserve even more
4091 * space, 128 bytes is fair. */
4093 if (skb_tailroom(skb) < tailbits &&
4094 pskb_expand_head(skb, 0, tailbits-skb_tailroom(skb)+128, GFP_ATOMIC))
4102 /* Misery. We are in troubles, going to mincer fragments... */
4105 skb_p = &skb_shinfo(skb)->frag_list;
4108 while ((skb1 = *skb_p) != NULL) {
4111 /* The fragment is partially pulled by someone,
4112 * this can happen on input. Copy it and everything
4115 if (skb_shared(skb1))
4118 /* If the skb is the last, worry about trailer. */
4120 if (skb1->next == NULL && tailbits) {
4121 if (skb_shinfo(skb1)->nr_frags ||
4122 skb_has_frag_list(skb1) ||
4123 skb_tailroom(skb1) < tailbits)
4124 ntail = tailbits + 128;
4130 skb_shinfo(skb1)->nr_frags ||
4131 skb_has_frag_list(skb1)) {
4132 struct sk_buff *skb2;
4134 /* Fuck, we are miserable poor guys... */
4136 skb2 = skb_copy(skb1, GFP_ATOMIC);
4138 skb2 = skb_copy_expand(skb1,
4142 if (unlikely(skb2 == NULL))
4146 skb_set_owner_w(skb2, skb1->sk);
4148 /* Looking around. Are we still alive?
4149 * OK, link new skb, drop old one */
4151 skb2->next = skb1->next;
4158 skb_p = &skb1->next;
4163 EXPORT_SYMBOL_GPL(skb_cow_data);
4165 static void sock_rmem_free(struct sk_buff *skb)
4167 struct sock *sk = skb->sk;
4169 atomic_sub(skb->truesize, &sk->sk_rmem_alloc);
4172 static void skb_set_err_queue(struct sk_buff *skb)
4174 /* pkt_type of skbs received on local sockets is never PACKET_OUTGOING.
4175 * So, it is safe to (mis)use it to mark skbs on the error queue.
4177 skb->pkt_type = PACKET_OUTGOING;
4178 BUILD_BUG_ON(PACKET_OUTGOING == 0);
4182 * Note: We dont mem charge error packets (no sk_forward_alloc changes)
4184 int sock_queue_err_skb(struct sock *sk, struct sk_buff *skb)
4186 if (atomic_read(&sk->sk_rmem_alloc) + skb->truesize >=
4187 (unsigned int)sk->sk_rcvbuf)
4192 skb->destructor = sock_rmem_free;
4193 atomic_add(skb->truesize, &sk->sk_rmem_alloc);
4194 skb_set_err_queue(skb);
4196 /* before exiting rcu section, make sure dst is refcounted */
4199 skb_queue_tail(&sk->sk_error_queue, skb);
4200 if (!sock_flag(sk, SOCK_DEAD))
4201 sk->sk_error_report(sk);
4204 EXPORT_SYMBOL(sock_queue_err_skb);
4206 static bool is_icmp_err_skb(const struct sk_buff *skb)
4208 return skb && (SKB_EXT_ERR(skb)->ee.ee_origin == SO_EE_ORIGIN_ICMP ||
4209 SKB_EXT_ERR(skb)->ee.ee_origin == SO_EE_ORIGIN_ICMP6);
4212 struct sk_buff *sock_dequeue_err_skb(struct sock *sk)
4214 struct sk_buff_head *q = &sk->sk_error_queue;
4215 struct sk_buff *skb, *skb_next = NULL;
4216 bool icmp_next = false;
4217 unsigned long flags;
4219 spin_lock_irqsave(&q->lock, flags);
4220 skb = __skb_dequeue(q);
4221 if (skb && (skb_next = skb_peek(q))) {
4222 icmp_next = is_icmp_err_skb(skb_next);
4224 sk->sk_err = SKB_EXT_ERR(skb_next)->ee.ee_origin;
4226 spin_unlock_irqrestore(&q->lock, flags);
4228 if (is_icmp_err_skb(skb) && !icmp_next)
4232 sk->sk_error_report(sk);
4236 EXPORT_SYMBOL(sock_dequeue_err_skb);
4239 * skb_clone_sk - create clone of skb, and take reference to socket
4240 * @skb: the skb to clone
4242 * This function creates a clone of a buffer that holds a reference on
4243 * sk_refcnt. Buffers created via this function are meant to be
4244 * returned using sock_queue_err_skb, or free via kfree_skb.
4246 * When passing buffers allocated with this function to sock_queue_err_skb
4247 * it is necessary to wrap the call with sock_hold/sock_put in order to
4248 * prevent the socket from being released prior to being enqueued on
4249 * the sk_error_queue.
4251 struct sk_buff *skb_clone_sk(struct sk_buff *skb)
4253 struct sock *sk = skb->sk;
4254 struct sk_buff *clone;
4256 if (!sk || !refcount_inc_not_zero(&sk->sk_refcnt))
4259 clone = skb_clone(skb, GFP_ATOMIC);
4266 clone->destructor = sock_efree;
4270 EXPORT_SYMBOL(skb_clone_sk);
4272 static void __skb_complete_tx_timestamp(struct sk_buff *skb,
4277 struct sock_exterr_skb *serr;
4280 BUILD_BUG_ON(sizeof(struct sock_exterr_skb) > sizeof(skb->cb));
4282 serr = SKB_EXT_ERR(skb);
4283 memset(serr, 0, sizeof(*serr));
4284 serr->ee.ee_errno = ENOMSG;
4285 serr->ee.ee_origin = SO_EE_ORIGIN_TIMESTAMPING;
4286 serr->ee.ee_info = tstype;
4287 serr->opt_stats = opt_stats;
4288 serr->header.h4.iif = skb->dev ? skb->dev->ifindex : 0;
4289 if (sk->sk_tsflags & SOF_TIMESTAMPING_OPT_ID) {
4290 serr->ee.ee_data = skb_shinfo(skb)->tskey;
4291 if (sk->sk_protocol == IPPROTO_TCP &&
4292 sk->sk_type == SOCK_STREAM)
4293 serr->ee.ee_data -= sk->sk_tskey;
4296 err = sock_queue_err_skb(sk, skb);
4302 static bool skb_may_tx_timestamp(struct sock *sk, bool tsonly)
4306 if (likely(sysctl_tstamp_allow_data || tsonly))
4309 read_lock_bh(&sk->sk_callback_lock);
4310 ret = sk->sk_socket && sk->sk_socket->file &&
4311 file_ns_capable(sk->sk_socket->file, &init_user_ns, CAP_NET_RAW);
4312 read_unlock_bh(&sk->sk_callback_lock);
4316 void skb_complete_tx_timestamp(struct sk_buff *skb,
4317 struct skb_shared_hwtstamps *hwtstamps)
4319 struct sock *sk = skb->sk;
4321 if (!skb_may_tx_timestamp(sk, false))
4324 /* Take a reference to prevent skb_orphan() from freeing the socket,
4325 * but only if the socket refcount is not zero.
4327 if (likely(refcount_inc_not_zero(&sk->sk_refcnt))) {
4328 *skb_hwtstamps(skb) = *hwtstamps;
4329 __skb_complete_tx_timestamp(skb, sk, SCM_TSTAMP_SND, false);
4337 EXPORT_SYMBOL_GPL(skb_complete_tx_timestamp);
4339 void __skb_tstamp_tx(struct sk_buff *orig_skb,
4340 struct skb_shared_hwtstamps *hwtstamps,
4341 struct sock *sk, int tstype)
4343 struct sk_buff *skb;
4344 bool tsonly, opt_stats = false;
4349 if (!hwtstamps && !(sk->sk_tsflags & SOF_TIMESTAMPING_OPT_TX_SWHW) &&
4350 skb_shinfo(orig_skb)->tx_flags & SKBTX_IN_PROGRESS)
4353 tsonly = sk->sk_tsflags & SOF_TIMESTAMPING_OPT_TSONLY;
4354 if (!skb_may_tx_timestamp(sk, tsonly))
4359 if ((sk->sk_tsflags & SOF_TIMESTAMPING_OPT_STATS) &&
4360 sk->sk_protocol == IPPROTO_TCP &&
4361 sk->sk_type == SOCK_STREAM) {
4362 skb = tcp_get_timestamping_opt_stats(sk);
4366 skb = alloc_skb(0, GFP_ATOMIC);
4368 skb = skb_clone(orig_skb, GFP_ATOMIC);
4374 skb_shinfo(skb)->tx_flags |= skb_shinfo(orig_skb)->tx_flags &
4376 skb_shinfo(skb)->tskey = skb_shinfo(orig_skb)->tskey;
4380 *skb_hwtstamps(skb) = *hwtstamps;
4382 skb->tstamp = ktime_get_real();
4384 __skb_complete_tx_timestamp(skb, sk, tstype, opt_stats);
4386 EXPORT_SYMBOL_GPL(__skb_tstamp_tx);
4388 void skb_tstamp_tx(struct sk_buff *orig_skb,
4389 struct skb_shared_hwtstamps *hwtstamps)
4391 return __skb_tstamp_tx(orig_skb, hwtstamps, orig_skb->sk,
4394 EXPORT_SYMBOL_GPL(skb_tstamp_tx);
4396 void skb_complete_wifi_ack(struct sk_buff *skb, bool acked)
4398 struct sock *sk = skb->sk;
4399 struct sock_exterr_skb *serr;
4402 skb->wifi_acked_valid = 1;
4403 skb->wifi_acked = acked;
4405 serr = SKB_EXT_ERR(skb);
4406 memset(serr, 0, sizeof(*serr));
4407 serr->ee.ee_errno = ENOMSG;
4408 serr->ee.ee_origin = SO_EE_ORIGIN_TXSTATUS;
4410 /* Take a reference to prevent skb_orphan() from freeing the socket,
4411 * but only if the socket refcount is not zero.
4413 if (likely(refcount_inc_not_zero(&sk->sk_refcnt))) {
4414 err = sock_queue_err_skb(sk, skb);
4420 EXPORT_SYMBOL_GPL(skb_complete_wifi_ack);
4423 * skb_partial_csum_set - set up and verify partial csum values for packet
4424 * @skb: the skb to set
4425 * @start: the number of bytes after skb->data to start checksumming.
4426 * @off: the offset from start to place the checksum.
4428 * For untrusted partially-checksummed packets, we need to make sure the values
4429 * for skb->csum_start and skb->csum_offset are valid so we don't oops.
4431 * This function checks and sets those values and skb->ip_summed: if this
4432 * returns false you should drop the packet.
4434 bool skb_partial_csum_set(struct sk_buff *skb, u16 start, u16 off)
4436 if (unlikely(start > skb_headlen(skb)) ||
4437 unlikely((int)start + off > skb_headlen(skb) - 2)) {
4438 net_warn_ratelimited("bad partial csum: csum=%u/%u len=%u\n",
4439 start, off, skb_headlen(skb));
4442 skb->ip_summed = CHECKSUM_PARTIAL;
4443 skb->csum_start = skb_headroom(skb) + start;
4444 skb->csum_offset = off;
4445 skb_set_transport_header(skb, start);
4448 EXPORT_SYMBOL_GPL(skb_partial_csum_set);
4450 static int skb_maybe_pull_tail(struct sk_buff *skb, unsigned int len,
4453 if (skb_headlen(skb) >= len)
4456 /* If we need to pullup then pullup to the max, so we
4457 * won't need to do it again.
4462 if (__pskb_pull_tail(skb, max - skb_headlen(skb)) == NULL)
4465 if (skb_headlen(skb) < len)
4471 #define MAX_TCP_HDR_LEN (15 * 4)
4473 static __sum16 *skb_checksum_setup_ip(struct sk_buff *skb,
4474 typeof(IPPROTO_IP) proto,
4481 err = skb_maybe_pull_tail(skb, off + sizeof(struct tcphdr),
4482 off + MAX_TCP_HDR_LEN);
4483 if (!err && !skb_partial_csum_set(skb, off,
4484 offsetof(struct tcphdr,
4487 return err ? ERR_PTR(err) : &tcp_hdr(skb)->check;
4490 err = skb_maybe_pull_tail(skb, off + sizeof(struct udphdr),
4491 off + sizeof(struct udphdr));
4492 if (!err && !skb_partial_csum_set(skb, off,
4493 offsetof(struct udphdr,
4496 return err ? ERR_PTR(err) : &udp_hdr(skb)->check;
4499 return ERR_PTR(-EPROTO);
4502 /* This value should be large enough to cover a tagged ethernet header plus
4503 * maximally sized IP and TCP or UDP headers.
4505 #define MAX_IP_HDR_LEN 128
4507 static int skb_checksum_setup_ipv4(struct sk_buff *skb, bool recalculate)
4516 err = skb_maybe_pull_tail(skb,
4517 sizeof(struct iphdr),
4522 if (ip_hdr(skb)->frag_off & htons(IP_OFFSET | IP_MF))
4525 off = ip_hdrlen(skb);
4532 csum = skb_checksum_setup_ip(skb, ip_hdr(skb)->protocol, off);
4534 return PTR_ERR(csum);
4537 *csum = ~csum_tcpudp_magic(ip_hdr(skb)->saddr,
4540 ip_hdr(skb)->protocol, 0);
4547 /* This value should be large enough to cover a tagged ethernet header plus
4548 * an IPv6 header, all options, and a maximal TCP or UDP header.
4550 #define MAX_IPV6_HDR_LEN 256
4552 #define OPT_HDR(type, skb, off) \
4553 (type *)(skb_network_header(skb) + (off))
4555 static int skb_checksum_setup_ipv6(struct sk_buff *skb, bool recalculate)
4568 off = sizeof(struct ipv6hdr);
4570 err = skb_maybe_pull_tail(skb, off, MAX_IPV6_HDR_LEN);
4574 nexthdr = ipv6_hdr(skb)->nexthdr;
4576 len = sizeof(struct ipv6hdr) + ntohs(ipv6_hdr(skb)->payload_len);
4577 while (off <= len && !done) {
4579 case IPPROTO_DSTOPTS:
4580 case IPPROTO_HOPOPTS:
4581 case IPPROTO_ROUTING: {
4582 struct ipv6_opt_hdr *hp;
4584 err = skb_maybe_pull_tail(skb,
4586 sizeof(struct ipv6_opt_hdr),
4591 hp = OPT_HDR(struct ipv6_opt_hdr, skb, off);
4592 nexthdr = hp->nexthdr;
4593 off += ipv6_optlen(hp);
4597 struct ip_auth_hdr *hp;
4599 err = skb_maybe_pull_tail(skb,
4601 sizeof(struct ip_auth_hdr),
4606 hp = OPT_HDR(struct ip_auth_hdr, skb, off);
4607 nexthdr = hp->nexthdr;
4608 off += ipv6_authlen(hp);
4611 case IPPROTO_FRAGMENT: {
4612 struct frag_hdr *hp;
4614 err = skb_maybe_pull_tail(skb,
4616 sizeof(struct frag_hdr),
4621 hp = OPT_HDR(struct frag_hdr, skb, off);
4623 if (hp->frag_off & htons(IP6_OFFSET | IP6_MF))
4626 nexthdr = hp->nexthdr;
4627 off += sizeof(struct frag_hdr);
4638 if (!done || fragment)
4641 csum = skb_checksum_setup_ip(skb, nexthdr, off);
4643 return PTR_ERR(csum);
4646 *csum = ~csum_ipv6_magic(&ipv6_hdr(skb)->saddr,
4647 &ipv6_hdr(skb)->daddr,
4648 skb->len - off, nexthdr, 0);
4656 * skb_checksum_setup - set up partial checksum offset
4657 * @skb: the skb to set up
4658 * @recalculate: if true the pseudo-header checksum will be recalculated
4660 int skb_checksum_setup(struct sk_buff *skb, bool recalculate)
4664 switch (skb->protocol) {
4665 case htons(ETH_P_IP):
4666 err = skb_checksum_setup_ipv4(skb, recalculate);
4669 case htons(ETH_P_IPV6):
4670 err = skb_checksum_setup_ipv6(skb, recalculate);
4680 EXPORT_SYMBOL(skb_checksum_setup);
4683 * skb_checksum_maybe_trim - maybe trims the given skb
4684 * @skb: the skb to check
4685 * @transport_len: the data length beyond the network header
4687 * Checks whether the given skb has data beyond the given transport length.
4688 * If so, returns a cloned skb trimmed to this transport length.
4689 * Otherwise returns the provided skb. Returns NULL in error cases
4690 * (e.g. transport_len exceeds skb length or out-of-memory).
4692 * Caller needs to set the skb transport header and free any returned skb if it
4693 * differs from the provided skb.
4695 static struct sk_buff *skb_checksum_maybe_trim(struct sk_buff *skb,
4696 unsigned int transport_len)
4698 struct sk_buff *skb_chk;
4699 unsigned int len = skb_transport_offset(skb) + transport_len;
4704 else if (skb->len == len)
4707 skb_chk = skb_clone(skb, GFP_ATOMIC);
4711 ret = pskb_trim_rcsum(skb_chk, len);
4721 * skb_checksum_trimmed - validate checksum of an skb
4722 * @skb: the skb to check
4723 * @transport_len: the data length beyond the network header
4724 * @skb_chkf: checksum function to use
4726 * Applies the given checksum function skb_chkf to the provided skb.
4727 * Returns a checked and maybe trimmed skb. Returns NULL on error.
4729 * If the skb has data beyond the given transport length, then a
4730 * trimmed & cloned skb is checked and returned.
4732 * Caller needs to set the skb transport header and free any returned skb if it
4733 * differs from the provided skb.
4735 struct sk_buff *skb_checksum_trimmed(struct sk_buff *skb,
4736 unsigned int transport_len,
4737 __sum16(*skb_chkf)(struct sk_buff *skb))
4739 struct sk_buff *skb_chk;
4740 unsigned int offset = skb_transport_offset(skb);
4743 skb_chk = skb_checksum_maybe_trim(skb, transport_len);
4747 if (!pskb_may_pull(skb_chk, offset))
4750 skb_pull_rcsum(skb_chk, offset);
4751 ret = skb_chkf(skb_chk);
4752 skb_push_rcsum(skb_chk, offset);
4760 if (skb_chk && skb_chk != skb)
4766 EXPORT_SYMBOL(skb_checksum_trimmed);
4768 void __skb_warn_lro_forwarding(const struct sk_buff *skb)
4770 net_warn_ratelimited("%s: received packets cannot be forwarded while LRO is enabled\n",
4773 EXPORT_SYMBOL(__skb_warn_lro_forwarding);
4775 void kfree_skb_partial(struct sk_buff *skb, bool head_stolen)
4778 skb_release_head_state(skb);
4779 kmem_cache_free(skbuff_head_cache, skb);
4784 EXPORT_SYMBOL(kfree_skb_partial);
4787 * skb_try_coalesce - try to merge skb to prior one
4789 * @from: buffer to add
4790 * @fragstolen: pointer to boolean
4791 * @delta_truesize: how much more was allocated than was requested
4793 bool skb_try_coalesce(struct sk_buff *to, struct sk_buff *from,
4794 bool *fragstolen, int *delta_truesize)
4796 struct skb_shared_info *to_shinfo, *from_shinfo;
4797 int i, delta, len = from->len;
4799 *fragstolen = false;
4804 if (len <= skb_tailroom(to)) {
4806 BUG_ON(skb_copy_bits(from, 0, skb_put(to, len), len));
4807 *delta_truesize = 0;
4811 to_shinfo = skb_shinfo(to);
4812 from_shinfo = skb_shinfo(from);
4813 if (to_shinfo->frag_list || from_shinfo->frag_list)
4815 if (skb_zcopy(to) || skb_zcopy(from))
4818 if (skb_headlen(from) != 0) {
4820 unsigned int offset;
4822 if (to_shinfo->nr_frags +
4823 from_shinfo->nr_frags >= MAX_SKB_FRAGS)
4826 if (skb_head_is_locked(from))
4829 delta = from->truesize - SKB_DATA_ALIGN(sizeof(struct sk_buff));
4831 page = virt_to_head_page(from->head);
4832 offset = from->data - (unsigned char *)page_address(page);
4834 skb_fill_page_desc(to, to_shinfo->nr_frags,
4835 page, offset, skb_headlen(from));
4838 if (to_shinfo->nr_frags +
4839 from_shinfo->nr_frags > MAX_SKB_FRAGS)
4842 delta = from->truesize - SKB_TRUESIZE(skb_end_offset(from));
4845 WARN_ON_ONCE(delta < len);
4847 memcpy(to_shinfo->frags + to_shinfo->nr_frags,
4849 from_shinfo->nr_frags * sizeof(skb_frag_t));
4850 to_shinfo->nr_frags += from_shinfo->nr_frags;
4852 if (!skb_cloned(from))
4853 from_shinfo->nr_frags = 0;
4855 /* if the skb is not cloned this does nothing
4856 * since we set nr_frags to 0.
4858 for (i = 0; i < from_shinfo->nr_frags; i++)
4859 __skb_frag_ref(&from_shinfo->frags[i]);
4861 to->truesize += delta;
4863 to->data_len += len;
4865 *delta_truesize = delta;
4868 EXPORT_SYMBOL(skb_try_coalesce);
4871 * skb_scrub_packet - scrub an skb
4873 * @skb: buffer to clean
4874 * @xnet: packet is crossing netns
4876 * skb_scrub_packet can be used after encapsulating or decapsulting a packet
4877 * into/from a tunnel. Some information have to be cleared during these
4879 * skb_scrub_packet can also be used to clean a skb before injecting it in
4880 * another namespace (@xnet == true). We have to clear all information in the
4881 * skb that could impact namespace isolation.
4883 void skb_scrub_packet(struct sk_buff *skb, bool xnet)
4886 skb->pkt_type = PACKET_HOST;
4892 nf_reset_trace(skb);
4901 EXPORT_SYMBOL_GPL(skb_scrub_packet);
4904 * skb_gso_transport_seglen - Return length of individual segments of a gso packet
4908 * skb_gso_transport_seglen is used to determine the real size of the
4909 * individual segments, including Layer4 headers (TCP/UDP).
4911 * The MAC/L2 or network (IP, IPv6) headers are not accounted for.
4913 static unsigned int skb_gso_transport_seglen(const struct sk_buff *skb)
4915 const struct skb_shared_info *shinfo = skb_shinfo(skb);
4916 unsigned int thlen = 0;
4918 if (skb->encapsulation) {
4919 thlen = skb_inner_transport_header(skb) -
4920 skb_transport_header(skb);
4922 if (likely(shinfo->gso_type & (SKB_GSO_TCPV4 | SKB_GSO_TCPV6)))
4923 thlen += inner_tcp_hdrlen(skb);
4924 } else if (likely(shinfo->gso_type & (SKB_GSO_TCPV4 | SKB_GSO_TCPV6))) {
4925 thlen = tcp_hdrlen(skb);
4926 } else if (unlikely(skb_is_gso_sctp(skb))) {
4927 thlen = sizeof(struct sctphdr);
4929 /* UFO sets gso_size to the size of the fragmentation
4930 * payload, i.e. the size of the L4 (UDP) header is already
4933 return thlen + shinfo->gso_size;
4937 * skb_gso_network_seglen - Return length of individual segments of a gso packet
4941 * skb_gso_network_seglen is used to determine the real size of the
4942 * individual segments, including Layer3 (IP, IPv6) and L4 headers (TCP/UDP).
4944 * The MAC/L2 header is not accounted for.
4946 static unsigned int skb_gso_network_seglen(const struct sk_buff *skb)
4948 unsigned int hdr_len = skb_transport_header(skb) -
4949 skb_network_header(skb);
4951 return hdr_len + skb_gso_transport_seglen(skb);
4955 * skb_gso_mac_seglen - Return length of individual segments of a gso packet
4959 * skb_gso_mac_seglen is used to determine the real size of the
4960 * individual segments, including MAC/L2, Layer3 (IP, IPv6) and L4
4961 * headers (TCP/UDP).
4963 static unsigned int skb_gso_mac_seglen(const struct sk_buff *skb)
4965 unsigned int hdr_len = skb_transport_header(skb) - skb_mac_header(skb);
4967 return hdr_len + skb_gso_transport_seglen(skb);
4971 * skb_gso_size_check - check the skb size, considering GSO_BY_FRAGS
4973 * There are a couple of instances where we have a GSO skb, and we
4974 * want to determine what size it would be after it is segmented.
4976 * We might want to check:
4977 * - L3+L4+payload size (e.g. IP forwarding)
4978 * - L2+L3+L4+payload size (e.g. sanity check before passing to driver)
4980 * This is a helper to do that correctly considering GSO_BY_FRAGS.
4982 * @seg_len: The segmented length (from skb_gso_*_seglen). In the
4983 * GSO_BY_FRAGS case this will be [header sizes + GSO_BY_FRAGS].
4985 * @max_len: The maximum permissible length.
4987 * Returns true if the segmented length <= max length.
4989 static inline bool skb_gso_size_check(const struct sk_buff *skb,
4990 unsigned int seg_len,
4991 unsigned int max_len) {
4992 const struct skb_shared_info *shinfo = skb_shinfo(skb);
4993 const struct sk_buff *iter;
4995 if (shinfo->gso_size != GSO_BY_FRAGS)
4996 return seg_len <= max_len;
4998 /* Undo this so we can re-use header sizes */
4999 seg_len -= GSO_BY_FRAGS;
5001 skb_walk_frags(skb, iter) {
5002 if (seg_len + skb_headlen(iter) > max_len)
5010 * skb_gso_validate_network_len - Will a split GSO skb fit into a given MTU?
5013 * @mtu: MTU to validate against
5015 * skb_gso_validate_network_len validates if a given skb will fit a
5016 * wanted MTU once split. It considers L3 headers, L4 headers, and the
5019 bool skb_gso_validate_network_len(const struct sk_buff *skb, unsigned int mtu)
5021 return skb_gso_size_check(skb, skb_gso_network_seglen(skb), mtu);
5023 EXPORT_SYMBOL_GPL(skb_gso_validate_network_len);
5026 * skb_gso_validate_mac_len - Will a split GSO skb fit in a given length?
5029 * @len: length to validate against
5031 * skb_gso_validate_mac_len validates if a given skb will fit a wanted
5032 * length once split, including L2, L3 and L4 headers and the payload.
5034 bool skb_gso_validate_mac_len(const struct sk_buff *skb, unsigned int len)
5036 return skb_gso_size_check(skb, skb_gso_mac_seglen(skb), len);
5038 EXPORT_SYMBOL_GPL(skb_gso_validate_mac_len);
5040 static struct sk_buff *skb_reorder_vlan_header(struct sk_buff *skb)
5044 if (skb_cow(skb, skb_headroom(skb)) < 0) {
5049 mac_len = skb->data - skb_mac_header(skb);
5050 if (likely(mac_len > VLAN_HLEN + ETH_TLEN)) {
5051 memmove(skb_mac_header(skb) + VLAN_HLEN, skb_mac_header(skb),
5052 mac_len - VLAN_HLEN - ETH_TLEN);
5054 skb->mac_header += VLAN_HLEN;
5058 struct sk_buff *skb_vlan_untag(struct sk_buff *skb)
5060 struct vlan_hdr *vhdr;
5063 if (unlikely(skb_vlan_tag_present(skb))) {
5064 /* vlan_tci is already set-up so leave this for another time */
5068 skb = skb_share_check(skb, GFP_ATOMIC);
5072 if (unlikely(!pskb_may_pull(skb, VLAN_HLEN)))
5075 vhdr = (struct vlan_hdr *)skb->data;
5076 vlan_tci = ntohs(vhdr->h_vlan_TCI);
5077 __vlan_hwaccel_put_tag(skb, skb->protocol, vlan_tci);
5079 skb_pull_rcsum(skb, VLAN_HLEN);
5080 vlan_set_encap_proto(skb, vhdr);
5082 skb = skb_reorder_vlan_header(skb);
5086 skb_reset_network_header(skb);
5087 skb_reset_transport_header(skb);
5088 skb_reset_mac_len(skb);
5096 EXPORT_SYMBOL(skb_vlan_untag);
5098 int skb_ensure_writable(struct sk_buff *skb, int write_len)
5100 if (!pskb_may_pull(skb, write_len))
5103 if (!skb_cloned(skb) || skb_clone_writable(skb, write_len))
5106 return pskb_expand_head(skb, 0, 0, GFP_ATOMIC);
5108 EXPORT_SYMBOL(skb_ensure_writable);
5110 /* remove VLAN header from packet and update csum accordingly.
5111 * expects a non skb_vlan_tag_present skb with a vlan tag payload
5113 int __skb_vlan_pop(struct sk_buff *skb, u16 *vlan_tci)
5115 struct vlan_hdr *vhdr;
5116 int offset = skb->data - skb_mac_header(skb);
5119 if (WARN_ONCE(offset,
5120 "__skb_vlan_pop got skb with skb->data not at mac header (offset %d)\n",
5125 err = skb_ensure_writable(skb, VLAN_ETH_HLEN);
5129 skb_postpull_rcsum(skb, skb->data + (2 * ETH_ALEN), VLAN_HLEN);
5131 vhdr = (struct vlan_hdr *)(skb->data + ETH_HLEN);
5132 *vlan_tci = ntohs(vhdr->h_vlan_TCI);
5134 memmove(skb->data + VLAN_HLEN, skb->data, 2 * ETH_ALEN);
5135 __skb_pull(skb, VLAN_HLEN);
5137 vlan_set_encap_proto(skb, vhdr);
5138 skb->mac_header += VLAN_HLEN;
5140 if (skb_network_offset(skb) < ETH_HLEN)
5141 skb_set_network_header(skb, ETH_HLEN);
5143 skb_reset_mac_len(skb);
5147 EXPORT_SYMBOL(__skb_vlan_pop);
5149 /* Pop a vlan tag either from hwaccel or from payload.
5150 * Expects skb->data at mac header.
5152 int skb_vlan_pop(struct sk_buff *skb)
5158 if (likely(skb_vlan_tag_present(skb))) {
5161 if (unlikely(!eth_type_vlan(skb->protocol)))
5164 err = __skb_vlan_pop(skb, &vlan_tci);
5168 /* move next vlan tag to hw accel tag */
5169 if (likely(!eth_type_vlan(skb->protocol)))
5172 vlan_proto = skb->protocol;
5173 err = __skb_vlan_pop(skb, &vlan_tci);
5177 __vlan_hwaccel_put_tag(skb, vlan_proto, vlan_tci);
5180 EXPORT_SYMBOL(skb_vlan_pop);
5182 /* Push a vlan tag either into hwaccel or into payload (if hwaccel tag present).
5183 * Expects skb->data at mac header.
5185 int skb_vlan_push(struct sk_buff *skb, __be16 vlan_proto, u16 vlan_tci)
5187 if (skb_vlan_tag_present(skb)) {
5188 int offset = skb->data - skb_mac_header(skb);
5191 if (WARN_ONCE(offset,
5192 "skb_vlan_push got skb with skb->data not at mac header (offset %d)\n",
5197 err = __vlan_insert_tag(skb, skb->vlan_proto,
5198 skb_vlan_tag_get(skb));
5202 skb->protocol = skb->vlan_proto;
5203 skb->mac_len += VLAN_HLEN;
5205 skb_postpush_rcsum(skb, skb->data + (2 * ETH_ALEN), VLAN_HLEN);
5207 __vlan_hwaccel_put_tag(skb, vlan_proto, vlan_tci);
5210 EXPORT_SYMBOL(skb_vlan_push);
5213 * alloc_skb_with_frags - allocate skb with page frags
5215 * @header_len: size of linear part
5216 * @data_len: needed length in frags
5217 * @max_page_order: max page order desired.
5218 * @errcode: pointer to error code if any
5219 * @gfp_mask: allocation mask
5221 * This can be used to allocate a paged skb, given a maximal order for frags.
5223 struct sk_buff *alloc_skb_with_frags(unsigned long header_len,
5224 unsigned long data_len,
5229 int npages = (data_len + (PAGE_SIZE - 1)) >> PAGE_SHIFT;
5230 unsigned long chunk;
5231 struct sk_buff *skb;
5236 *errcode = -EMSGSIZE;
5237 /* Note this test could be relaxed, if we succeed to allocate
5238 * high order pages...
5240 if (npages > MAX_SKB_FRAGS)
5243 gfp_head = gfp_mask;
5244 if (gfp_head & __GFP_DIRECT_RECLAIM)
5245 gfp_head |= __GFP_RETRY_MAYFAIL;
5247 *errcode = -ENOBUFS;
5248 skb = alloc_skb(header_len, gfp_head);
5252 skb->truesize += npages << PAGE_SHIFT;
5254 for (i = 0; npages > 0; i++) {
5255 int order = max_page_order;
5258 if (npages >= 1 << order) {
5259 page = alloc_pages((gfp_mask & ~__GFP_DIRECT_RECLAIM) |
5266 /* Do not retry other high order allocations */
5272 page = alloc_page(gfp_mask);
5276 chunk = min_t(unsigned long, data_len,
5277 PAGE_SIZE << order);
5278 skb_fill_page_desc(skb, i, page, 0, chunk);
5280 npages -= 1 << order;
5288 EXPORT_SYMBOL(alloc_skb_with_frags);
5290 /* carve out the first off bytes from skb when off < headlen */
5291 static int pskb_carve_inside_header(struct sk_buff *skb, const u32 off,
5292 const int headlen, gfp_t gfp_mask)
5295 int size = skb_end_offset(skb);
5296 int new_hlen = headlen - off;
5299 size = SKB_DATA_ALIGN(size);
5301 if (skb_pfmemalloc(skb))
5302 gfp_mask |= __GFP_MEMALLOC;
5303 data = kmalloc_reserve(size +
5304 SKB_DATA_ALIGN(sizeof(struct skb_shared_info)),
5305 gfp_mask, NUMA_NO_NODE, NULL);
5309 size = SKB_WITH_OVERHEAD(ksize(data));
5311 /* Copy real data, and all frags */
5312 skb_copy_from_linear_data_offset(skb, off, data, new_hlen);
5315 memcpy((struct skb_shared_info *)(data + size),
5317 offsetof(struct skb_shared_info,
5318 frags[skb_shinfo(skb)->nr_frags]));
5319 if (skb_cloned(skb)) {
5320 /* drop the old head gracefully */
5321 if (skb_orphan_frags(skb, gfp_mask)) {
5325 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++)
5326 skb_frag_ref(skb, i);
5327 if (skb_has_frag_list(skb))
5328 skb_clone_fraglist(skb);
5329 skb_release_data(skb);
5331 /* we can reuse existing recount- all we did was
5340 #ifdef NET_SKBUFF_DATA_USES_OFFSET
5343 skb->end = skb->head + size;
5345 skb_set_tail_pointer(skb, skb_headlen(skb));
5346 skb_headers_offset_update(skb, 0);
5350 atomic_set(&skb_shinfo(skb)->dataref, 1);
5355 static int pskb_carve(struct sk_buff *skb, const u32 off, gfp_t gfp);
5357 /* carve out the first eat bytes from skb's frag_list. May recurse into
5360 static int pskb_carve_frag_list(struct sk_buff *skb,
5361 struct skb_shared_info *shinfo, int eat,
5364 struct sk_buff *list = shinfo->frag_list;
5365 struct sk_buff *clone = NULL;
5366 struct sk_buff *insp = NULL;
5370 pr_err("Not enough bytes to eat. Want %d\n", eat);
5373 if (list->len <= eat) {
5374 /* Eaten as whole. */
5379 /* Eaten partially. */
5380 if (skb_shared(list)) {
5381 clone = skb_clone(list, gfp_mask);
5387 /* This may be pulled without problems. */
5390 if (pskb_carve(list, eat, gfp_mask) < 0) {
5398 /* Free pulled out fragments. */
5399 while ((list = shinfo->frag_list) != insp) {
5400 shinfo->frag_list = list->next;
5403 /* And insert new clone at head. */
5406 shinfo->frag_list = clone;
5411 /* carve off first len bytes from skb. Split line (off) is in the
5412 * non-linear part of skb
5414 static int pskb_carve_inside_nonlinear(struct sk_buff *skb, const u32 off,
5415 int pos, gfp_t gfp_mask)
5418 int size = skb_end_offset(skb);
5420 const int nfrags = skb_shinfo(skb)->nr_frags;
5421 struct skb_shared_info *shinfo;
5423 size = SKB_DATA_ALIGN(size);
5425 if (skb_pfmemalloc(skb))
5426 gfp_mask |= __GFP_MEMALLOC;
5427 data = kmalloc_reserve(size +
5428 SKB_DATA_ALIGN(sizeof(struct skb_shared_info)),
5429 gfp_mask, NUMA_NO_NODE, NULL);
5433 size = SKB_WITH_OVERHEAD(ksize(data));
5435 memcpy((struct skb_shared_info *)(data + size),
5436 skb_shinfo(skb), offsetof(struct skb_shared_info,
5437 frags[skb_shinfo(skb)->nr_frags]));
5438 if (skb_orphan_frags(skb, gfp_mask)) {
5442 shinfo = (struct skb_shared_info *)(data + size);
5443 for (i = 0; i < nfrags; i++) {
5444 int fsize = skb_frag_size(&skb_shinfo(skb)->frags[i]);
5446 if (pos + fsize > off) {
5447 shinfo->frags[k] = skb_shinfo(skb)->frags[i];
5451 * We have two variants in this case:
5452 * 1. Move all the frag to the second
5453 * part, if it is possible. F.e.
5454 * this approach is mandatory for TUX,
5455 * where splitting is expensive.
5456 * 2. Split is accurately. We make this.
5458 shinfo->frags[0].page_offset += off - pos;
5459 skb_frag_size_sub(&shinfo->frags[0], off - pos);
5461 skb_frag_ref(skb, i);
5466 shinfo->nr_frags = k;
5467 if (skb_has_frag_list(skb))
5468 skb_clone_fraglist(skb);
5471 /* split line is in frag list */
5472 pskb_carve_frag_list(skb, shinfo, off - pos, gfp_mask);
5474 skb_release_data(skb);
5479 #ifdef NET_SKBUFF_DATA_USES_OFFSET
5482 skb->end = skb->head + size;
5484 skb_reset_tail_pointer(skb);
5485 skb_headers_offset_update(skb, 0);
5490 skb->data_len = skb->len;
5491 atomic_set(&skb_shinfo(skb)->dataref, 1);
5495 /* remove len bytes from the beginning of the skb */
5496 static int pskb_carve(struct sk_buff *skb, const u32 len, gfp_t gfp)
5498 int headlen = skb_headlen(skb);
5501 return pskb_carve_inside_header(skb, len, headlen, gfp);
5503 return pskb_carve_inside_nonlinear(skb, len, headlen, gfp);
5506 /* Extract to_copy bytes starting at off from skb, and return this in
5509 struct sk_buff *pskb_extract(struct sk_buff *skb, int off,
5510 int to_copy, gfp_t gfp)
5512 struct sk_buff *clone = skb_clone(skb, gfp);
5517 if (pskb_carve(clone, off, gfp) < 0 ||
5518 pskb_trim(clone, to_copy)) {
5524 EXPORT_SYMBOL(pskb_extract);
5527 * skb_condense - try to get rid of fragments/frag_list if possible
5530 * Can be used to save memory before skb is added to a busy queue.
5531 * If packet has bytes in frags and enough tail room in skb->head,
5532 * pull all of them, so that we can free the frags right now and adjust
5535 * We do not reallocate skb->head thus can not fail.
5536 * Caller must re-evaluate skb->truesize if needed.
5538 void skb_condense(struct sk_buff *skb)
5540 if (skb->data_len) {
5541 if (skb->data_len > skb->end - skb->tail ||
5545 /* Nice, we can free page frag(s) right now */
5546 __pskb_pull_tail(skb, skb->data_len);
5548 /* At this point, skb->truesize might be over estimated,
5549 * because skb had a fragment, and fragments do not tell
5551 * When we pulled its content into skb->head, fragment
5552 * was freed, but __pskb_pull_tail() could not possibly
5553 * adjust skb->truesize, not knowing the frag truesize.
5555 skb->truesize = SKB_TRUESIZE(skb_end_offset(skb));