2 * Routines having to do with the 'struct sk_buff' memory handlers.
4 * Authors: Alan Cox <alan@lxorguk.ukuu.org.uk>
5 * Florian La Roche <rzsfl@rz.uni-sb.de>
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>
44 #include <linux/kmemcheck.h>
46 #include <linux/interrupt.h>
48 #include <linux/inet.h>
49 #include <linux/slab.h>
50 #include <linux/netdevice.h>
51 #ifdef CONFIG_NET_CLS_ACT
52 #include <net/pkt_sched.h>
54 #include <linux/string.h>
55 #include <linux/skbuff.h>
56 #include <linux/splice.h>
57 #include <linux/cache.h>
58 #include <linux/rtnetlink.h>
59 #include <linux/init.h>
60 #include <linux/scatterlist.h>
61 #include <linux/errqueue.h>
62 #include <linux/prefetch.h>
64 #include <net/protocol.h>
67 #include <net/checksum.h>
68 #include <net/ip6_checksum.h>
71 #include <asm/uaccess.h>
72 #include <trace/events/skb.h>
73 #include <linux/highmem.h>
75 struct kmem_cache *skbuff_head_cache __read_mostly;
76 static struct kmem_cache *skbuff_fclone_cache __read_mostly;
79 * skb_panic - private function for out-of-line support
83 * @msg: skb_over_panic or skb_under_panic
85 * Out-of-line support for skb_put() and skb_push().
86 * Called via the wrapper skb_over_panic() or skb_under_panic().
87 * Keep out of line to prevent kernel bloat.
88 * __builtin_return_address is not used because it is not always reliable.
90 static void skb_panic(struct sk_buff *skb, unsigned int sz, void *addr,
93 pr_emerg("%s: text:%p len:%d put:%d head:%p data:%p tail:%#lx end:%#lx dev:%s\n",
94 msg, addr, skb->len, sz, skb->head, skb->data,
95 (unsigned long)skb->tail, (unsigned long)skb->end,
96 skb->dev ? skb->dev->name : "<NULL>");
100 static void skb_over_panic(struct sk_buff *skb, unsigned int sz, void *addr)
102 skb_panic(skb, sz, addr, __func__);
105 static void skb_under_panic(struct sk_buff *skb, unsigned int sz, void *addr)
107 skb_panic(skb, sz, addr, __func__);
111 * kmalloc_reserve is a wrapper around kmalloc_node_track_caller that tells
112 * the caller if emergency pfmemalloc reserves are being used. If it is and
113 * the socket is later found to be SOCK_MEMALLOC then PFMEMALLOC reserves
114 * may be used. Otherwise, the packet data may be discarded until enough
117 #define kmalloc_reserve(size, gfp, node, pfmemalloc) \
118 __kmalloc_reserve(size, gfp, node, _RET_IP_, pfmemalloc)
120 static void *__kmalloc_reserve(size_t size, gfp_t flags, int node,
121 unsigned long ip, bool *pfmemalloc)
124 bool ret_pfmemalloc = false;
127 * Try a regular allocation, when that fails and we're not entitled
128 * to the reserves, fail.
130 obj = kmalloc_node_track_caller(size,
131 flags | __GFP_NOMEMALLOC | __GFP_NOWARN,
133 if (obj || !(gfp_pfmemalloc_allowed(flags)))
136 /* Try again but now we are using pfmemalloc reserves */
137 ret_pfmemalloc = true;
138 obj = kmalloc_node_track_caller(size, flags, node);
142 *pfmemalloc = ret_pfmemalloc;
147 /* Allocate a new skbuff. We do this ourselves so we can fill in a few
148 * 'private' fields and also do memory statistics to find all the
153 struct sk_buff *__alloc_skb_head(gfp_t gfp_mask, int node)
158 skb = kmem_cache_alloc_node(skbuff_head_cache,
159 gfp_mask & ~__GFP_DMA, node);
164 * Only clear those fields we need to clear, not those that we will
165 * actually initialise below. Hence, don't put any more fields after
166 * the tail pointer in struct sk_buff!
168 memset(skb, 0, offsetof(struct sk_buff, tail));
170 skb->truesize = sizeof(struct sk_buff);
171 atomic_set(&skb->users, 1);
173 skb->mac_header = (typeof(skb->mac_header))~0U;
179 * __alloc_skb - allocate a network buffer
180 * @size: size to allocate
181 * @gfp_mask: allocation mask
182 * @flags: If SKB_ALLOC_FCLONE is set, allocate from fclone cache
183 * instead of head cache and allocate a cloned (child) skb.
184 * If SKB_ALLOC_RX is set, __GFP_MEMALLOC will be used for
185 * allocations in case the data is required for writeback
186 * @node: numa node to allocate memory on
188 * Allocate a new &sk_buff. The returned buffer has no headroom and a
189 * tail room of at least size bytes. The object has a reference count
190 * of one. The return is the buffer. On a failure the return is %NULL.
192 * Buffers may only be allocated from interrupts using a @gfp_mask of
195 struct sk_buff *__alloc_skb(unsigned int size, gfp_t gfp_mask,
198 struct kmem_cache *cache;
199 struct skb_shared_info *shinfo;
204 cache = (flags & SKB_ALLOC_FCLONE)
205 ? skbuff_fclone_cache : skbuff_head_cache;
207 if (sk_memalloc_socks() && (flags & SKB_ALLOC_RX))
208 gfp_mask |= __GFP_MEMALLOC;
211 skb = kmem_cache_alloc_node(cache, gfp_mask & ~__GFP_DMA, node);
216 /* We do our best to align skb_shared_info on a separate cache
217 * line. It usually works because kmalloc(X > SMP_CACHE_BYTES) gives
218 * aligned memory blocks, unless SLUB/SLAB debug is enabled.
219 * Both skb->head and skb_shared_info are cache line aligned.
221 size = SKB_DATA_ALIGN(size);
222 size += SKB_DATA_ALIGN(sizeof(struct skb_shared_info));
223 data = kmalloc_reserve(size, gfp_mask, node, &pfmemalloc);
226 /* kmalloc(size) might give us more room than requested.
227 * Put skb_shared_info exactly at the end of allocated zone,
228 * to allow max possible filling before reallocation.
230 size = SKB_WITH_OVERHEAD(ksize(data));
231 prefetchw(data + size);
234 * Only clear those fields we need to clear, not those that we will
235 * actually initialise below. Hence, don't put any more fields after
236 * the tail pointer in struct sk_buff!
238 memset(skb, 0, offsetof(struct sk_buff, tail));
239 /* Account for allocated memory : skb + skb->head */
240 skb->truesize = SKB_TRUESIZE(size);
241 skb->pfmemalloc = pfmemalloc;
242 atomic_set(&skb->users, 1);
245 skb_reset_tail_pointer(skb);
246 skb->end = skb->tail + size;
247 skb->mac_header = (typeof(skb->mac_header))~0U;
248 skb->transport_header = (typeof(skb->transport_header))~0U;
250 /* make sure we initialize shinfo sequentially */
251 shinfo = skb_shinfo(skb);
252 memset(shinfo, 0, offsetof(struct skb_shared_info, dataref));
253 atomic_set(&shinfo->dataref, 1);
254 kmemcheck_annotate_variable(shinfo->destructor_arg);
256 if (flags & SKB_ALLOC_FCLONE) {
257 struct sk_buff *child = skb + 1;
258 atomic_t *fclone_ref = (atomic_t *) (child + 1);
260 kmemcheck_annotate_bitfield(child, flags1);
261 kmemcheck_annotate_bitfield(child, flags2);
262 skb->fclone = SKB_FCLONE_ORIG;
263 atomic_set(fclone_ref, 1);
265 child->fclone = SKB_FCLONE_UNAVAILABLE;
266 child->pfmemalloc = pfmemalloc;
271 kmem_cache_free(cache, skb);
275 EXPORT_SYMBOL(__alloc_skb);
278 * build_skb - build a network buffer
279 * @data: data buffer provided by caller
280 * @frag_size: size of fragment, or 0 if head was kmalloced
282 * Allocate a new &sk_buff. Caller provides space holding head and
283 * skb_shared_info. @data must have been allocated by kmalloc() only if
284 * @frag_size is 0, otherwise data should come from the page allocator.
285 * The return is the new skb buffer.
286 * On a failure the return is %NULL, and @data is not freed.
288 * Before IO, driver allocates only data buffer where NIC put incoming frame
289 * Driver should add room at head (NET_SKB_PAD) and
290 * MUST add room at tail (SKB_DATA_ALIGN(skb_shared_info))
291 * After IO, driver calls build_skb(), to allocate sk_buff and populate it
292 * before giving packet to stack.
293 * RX rings only contains data buffers, not full skbs.
295 struct sk_buff *build_skb(void *data, unsigned int frag_size)
297 struct skb_shared_info *shinfo;
299 unsigned int size = frag_size ? : ksize(data);
301 skb = kmem_cache_alloc(skbuff_head_cache, GFP_ATOMIC);
305 size -= SKB_DATA_ALIGN(sizeof(struct skb_shared_info));
307 memset(skb, 0, offsetof(struct sk_buff, tail));
308 skb->truesize = SKB_TRUESIZE(size);
309 skb->head_frag = frag_size != 0;
310 atomic_set(&skb->users, 1);
313 skb_reset_tail_pointer(skb);
314 skb->end = skb->tail + size;
315 skb->mac_header = (typeof(skb->mac_header))~0U;
316 skb->transport_header = (typeof(skb->transport_header))~0U;
318 /* make sure we initialize shinfo sequentially */
319 shinfo = skb_shinfo(skb);
320 memset(shinfo, 0, offsetof(struct skb_shared_info, dataref));
321 atomic_set(&shinfo->dataref, 1);
322 kmemcheck_annotate_variable(shinfo->destructor_arg);
326 EXPORT_SYMBOL(build_skb);
328 struct netdev_alloc_cache {
329 struct page_frag frag;
330 /* we maintain a pagecount bias, so that we dont dirty cache line
331 * containing page->_count every time we allocate a fragment.
333 unsigned int pagecnt_bias;
335 static DEFINE_PER_CPU(struct netdev_alloc_cache, netdev_alloc_cache);
337 static void *__netdev_alloc_frag(unsigned int fragsz, gfp_t gfp_mask)
339 struct netdev_alloc_cache *nc;
344 local_irq_save(flags);
345 nc = &__get_cpu_var(netdev_alloc_cache);
346 if (unlikely(!nc->frag.page)) {
348 for (order = NETDEV_FRAG_PAGE_MAX_ORDER; ;) {
349 gfp_t gfp = gfp_mask;
352 gfp |= __GFP_COMP | __GFP_NOWARN;
353 nc->frag.page = alloc_pages(gfp, order);
354 if (likely(nc->frag.page))
359 nc->frag.size = PAGE_SIZE << order;
361 atomic_set(&nc->frag.page->_count, NETDEV_PAGECNT_MAX_BIAS);
362 nc->pagecnt_bias = NETDEV_PAGECNT_MAX_BIAS;
366 if (nc->frag.offset + fragsz > nc->frag.size) {
367 /* avoid unnecessary locked operations if possible */
368 if ((atomic_read(&nc->frag.page->_count) == nc->pagecnt_bias) ||
369 atomic_sub_and_test(nc->pagecnt_bias, &nc->frag.page->_count))
374 data = page_address(nc->frag.page) + nc->frag.offset;
375 nc->frag.offset += fragsz;
378 local_irq_restore(flags);
383 * netdev_alloc_frag - allocate a page fragment
384 * @fragsz: fragment size
386 * Allocates a frag from a page for receive buffer.
387 * Uses GFP_ATOMIC allocations.
389 void *netdev_alloc_frag(unsigned int fragsz)
391 return __netdev_alloc_frag(fragsz, GFP_ATOMIC | __GFP_COLD);
393 EXPORT_SYMBOL(netdev_alloc_frag);
396 * __netdev_alloc_skb - allocate an skbuff for rx on a specific device
397 * @dev: network device to receive on
398 * @length: length to allocate
399 * @gfp_mask: get_free_pages mask, passed to alloc_skb
401 * Allocate a new &sk_buff and assign it a usage count of one. The
402 * buffer has unspecified headroom built in. Users should allocate
403 * the headroom they think they need without accounting for the
404 * built in space. The built in space is used for optimisations.
406 * %NULL is returned if there is no free memory.
408 struct sk_buff *__netdev_alloc_skb(struct net_device *dev,
409 unsigned int length, gfp_t gfp_mask)
411 struct sk_buff *skb = NULL;
412 unsigned int fragsz = SKB_DATA_ALIGN(length + NET_SKB_PAD) +
413 SKB_DATA_ALIGN(sizeof(struct skb_shared_info));
415 if (fragsz <= PAGE_SIZE && !(gfp_mask & (__GFP_WAIT | GFP_DMA))) {
418 if (sk_memalloc_socks())
419 gfp_mask |= __GFP_MEMALLOC;
421 data = __netdev_alloc_frag(fragsz, gfp_mask);
424 skb = build_skb(data, fragsz);
426 put_page(virt_to_head_page(data));
429 skb = __alloc_skb(length + NET_SKB_PAD, gfp_mask,
430 SKB_ALLOC_RX, NUMA_NO_NODE);
433 skb_reserve(skb, NET_SKB_PAD);
438 EXPORT_SYMBOL(__netdev_alloc_skb);
440 void skb_add_rx_frag(struct sk_buff *skb, int i, struct page *page, int off,
441 int size, unsigned int truesize)
443 skb_fill_page_desc(skb, i, page, off, size);
445 skb->data_len += size;
446 skb->truesize += truesize;
448 EXPORT_SYMBOL(skb_add_rx_frag);
450 void skb_coalesce_rx_frag(struct sk_buff *skb, int i, int size,
451 unsigned int truesize)
453 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
455 skb_frag_size_add(frag, size);
457 skb->data_len += size;
458 skb->truesize += truesize;
460 EXPORT_SYMBOL(skb_coalesce_rx_frag);
462 static void skb_drop_list(struct sk_buff **listp)
464 kfree_skb_list(*listp);
468 static inline void skb_drop_fraglist(struct sk_buff *skb)
470 skb_drop_list(&skb_shinfo(skb)->frag_list);
473 static void skb_clone_fraglist(struct sk_buff *skb)
475 struct sk_buff *list;
477 skb_walk_frags(skb, list)
481 static void skb_free_head(struct sk_buff *skb)
484 put_page(virt_to_head_page(skb->head));
489 static void skb_release_data(struct sk_buff *skb)
492 !atomic_sub_return(skb->nohdr ? (1 << SKB_DATAREF_SHIFT) + 1 : 1,
493 &skb_shinfo(skb)->dataref)) {
494 if (skb_shinfo(skb)->nr_frags) {
496 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++)
497 skb_frag_unref(skb, i);
501 * If skb buf is from userspace, we need to notify the caller
502 * the lower device DMA has done;
504 if (skb_shinfo(skb)->tx_flags & SKBTX_DEV_ZEROCOPY) {
505 struct ubuf_info *uarg;
507 uarg = skb_shinfo(skb)->destructor_arg;
509 uarg->callback(uarg, true);
512 if (skb_has_frag_list(skb))
513 skb_drop_fraglist(skb);
520 * Free an skbuff by memory without cleaning the state.
522 static void kfree_skbmem(struct sk_buff *skb)
524 struct sk_buff *other;
525 atomic_t *fclone_ref;
527 switch (skb->fclone) {
528 case SKB_FCLONE_UNAVAILABLE:
529 kmem_cache_free(skbuff_head_cache, skb);
532 case SKB_FCLONE_ORIG:
533 fclone_ref = (atomic_t *) (skb + 2);
534 if (atomic_dec_and_test(fclone_ref))
535 kmem_cache_free(skbuff_fclone_cache, skb);
538 case SKB_FCLONE_CLONE:
539 fclone_ref = (atomic_t *) (skb + 1);
542 /* The clone portion is available for
543 * fast-cloning again.
545 skb->fclone = SKB_FCLONE_UNAVAILABLE;
547 if (atomic_dec_and_test(fclone_ref))
548 kmem_cache_free(skbuff_fclone_cache, other);
553 static void skb_release_head_state(struct sk_buff *skb)
557 secpath_put(skb->sp);
559 if (skb->destructor) {
561 skb->destructor(skb);
563 #if IS_ENABLED(CONFIG_NF_CONNTRACK)
564 nf_conntrack_put(skb->nfct);
566 #ifdef CONFIG_BRIDGE_NETFILTER
567 nf_bridge_put(skb->nf_bridge);
569 /* XXX: IS this still necessary? - JHS */
570 #ifdef CONFIG_NET_SCHED
572 #ifdef CONFIG_NET_CLS_ACT
578 /* Free everything but the sk_buff shell. */
579 static void skb_release_all(struct sk_buff *skb)
581 skb_release_head_state(skb);
582 if (likely(skb->head))
583 skb_release_data(skb);
587 * __kfree_skb - private function
590 * Free an sk_buff. Release anything attached to the buffer.
591 * Clean the state. This is an internal helper function. Users should
592 * always call kfree_skb
595 void __kfree_skb(struct sk_buff *skb)
597 skb_release_all(skb);
600 EXPORT_SYMBOL(__kfree_skb);
603 * kfree_skb - free an sk_buff
604 * @skb: buffer to free
606 * Drop a reference to the buffer and free it if the usage count has
609 void kfree_skb(struct sk_buff *skb)
613 if (likely(atomic_read(&skb->users) == 1))
615 else if (likely(!atomic_dec_and_test(&skb->users)))
617 trace_kfree_skb(skb, __builtin_return_address(0));
620 EXPORT_SYMBOL(kfree_skb);
622 void kfree_skb_list(struct sk_buff *segs)
625 struct sk_buff *next = segs->next;
631 EXPORT_SYMBOL(kfree_skb_list);
634 * skb_tx_error - report an sk_buff xmit error
635 * @skb: buffer that triggered an error
637 * Report xmit error if a device callback is tracking this skb.
638 * skb must be freed afterwards.
640 void skb_tx_error(struct sk_buff *skb)
642 if (skb_shinfo(skb)->tx_flags & SKBTX_DEV_ZEROCOPY) {
643 struct ubuf_info *uarg;
645 uarg = skb_shinfo(skb)->destructor_arg;
647 uarg->callback(uarg, false);
648 skb_shinfo(skb)->tx_flags &= ~SKBTX_DEV_ZEROCOPY;
651 EXPORT_SYMBOL(skb_tx_error);
654 * consume_skb - free an skbuff
655 * @skb: buffer to free
657 * Drop a ref to the buffer and free it if the usage count has hit zero
658 * Functions identically to kfree_skb, but kfree_skb assumes that the frame
659 * is being dropped after a failure and notes that
661 void consume_skb(struct sk_buff *skb)
665 if (likely(atomic_read(&skb->users) == 1))
667 else if (likely(!atomic_dec_and_test(&skb->users)))
669 trace_consume_skb(skb);
672 EXPORT_SYMBOL(consume_skb);
674 static void __copy_skb_header(struct sk_buff *new, const struct sk_buff *old)
676 new->tstamp = old->tstamp;
678 new->transport_header = old->transport_header;
679 new->network_header = old->network_header;
680 new->mac_header = old->mac_header;
681 new->inner_protocol = old->inner_protocol;
682 new->inner_transport_header = old->inner_transport_header;
683 new->inner_network_header = old->inner_network_header;
684 new->inner_mac_header = old->inner_mac_header;
685 skb_dst_copy(new, old);
686 skb_copy_hash(new, old);
687 new->ooo_okay = old->ooo_okay;
688 new->no_fcs = old->no_fcs;
689 new->encapsulation = old->encapsulation;
691 new->sp = secpath_get(old->sp);
693 memcpy(new->cb, old->cb, sizeof(old->cb));
694 new->csum = old->csum;
695 new->local_df = old->local_df;
696 new->pkt_type = old->pkt_type;
697 new->ip_summed = old->ip_summed;
698 skb_copy_queue_mapping(new, old);
699 new->priority = old->priority;
700 #if IS_ENABLED(CONFIG_IP_VS)
701 new->ipvs_property = old->ipvs_property;
703 new->pfmemalloc = old->pfmemalloc;
704 new->protocol = old->protocol;
705 new->mark = old->mark;
706 new->skb_iif = old->skb_iif;
708 #if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE)
709 new->nf_trace = old->nf_trace;
711 #ifdef CONFIG_NET_SCHED
712 new->tc_index = old->tc_index;
713 #ifdef CONFIG_NET_CLS_ACT
714 new->tc_verd = old->tc_verd;
717 new->vlan_proto = old->vlan_proto;
718 new->vlan_tci = old->vlan_tci;
720 skb_copy_secmark(new, old);
722 #ifdef CONFIG_NET_RX_BUSY_POLL
723 new->napi_id = old->napi_id;
728 * You should not add any new code to this function. Add it to
729 * __copy_skb_header above instead.
731 static struct sk_buff *__skb_clone(struct sk_buff *n, struct sk_buff *skb)
733 #define C(x) n->x = skb->x
735 n->next = n->prev = NULL;
737 __copy_skb_header(n, skb);
742 n->hdr_len = skb->nohdr ? skb_headroom(skb) : skb->hdr_len;
745 n->destructor = NULL;
752 atomic_set(&n->users, 1);
754 atomic_inc(&(skb_shinfo(skb)->dataref));
762 * skb_morph - morph one skb into another
763 * @dst: the skb to receive the contents
764 * @src: the skb to supply the contents
766 * This is identical to skb_clone except that the target skb is
767 * supplied by the user.
769 * The target skb is returned upon exit.
771 struct sk_buff *skb_morph(struct sk_buff *dst, struct sk_buff *src)
773 skb_release_all(dst);
774 return __skb_clone(dst, src);
776 EXPORT_SYMBOL_GPL(skb_morph);
779 * skb_copy_ubufs - copy userspace skb frags buffers to kernel
780 * @skb: the skb to modify
781 * @gfp_mask: allocation priority
783 * This must be called on SKBTX_DEV_ZEROCOPY skb.
784 * It will copy all frags into kernel and drop the reference
785 * to userspace pages.
787 * If this function is called from an interrupt gfp_mask() must be
790 * Returns 0 on success or a negative error code on failure
791 * to allocate kernel memory to copy to.
793 int skb_copy_ubufs(struct sk_buff *skb, gfp_t gfp_mask)
796 int num_frags = skb_shinfo(skb)->nr_frags;
797 struct page *page, *head = NULL;
798 struct ubuf_info *uarg = skb_shinfo(skb)->destructor_arg;
800 for (i = 0; i < num_frags; i++) {
802 skb_frag_t *f = &skb_shinfo(skb)->frags[i];
804 page = alloc_page(gfp_mask);
807 struct page *next = (struct page *)page_private(head);
813 vaddr = kmap_atomic(skb_frag_page(f));
814 memcpy(page_address(page),
815 vaddr + f->page_offset, skb_frag_size(f));
816 kunmap_atomic(vaddr);
817 set_page_private(page, (unsigned long)head);
821 /* skb frags release userspace buffers */
822 for (i = 0; i < num_frags; i++)
823 skb_frag_unref(skb, i);
825 uarg->callback(uarg, false);
827 /* skb frags point to kernel buffers */
828 for (i = num_frags - 1; i >= 0; i--) {
829 __skb_fill_page_desc(skb, i, head, 0,
830 skb_shinfo(skb)->frags[i].size);
831 head = (struct page *)page_private(head);
834 skb_shinfo(skb)->tx_flags &= ~SKBTX_DEV_ZEROCOPY;
837 EXPORT_SYMBOL_GPL(skb_copy_ubufs);
840 * skb_clone - duplicate an sk_buff
841 * @skb: buffer to clone
842 * @gfp_mask: allocation priority
844 * Duplicate an &sk_buff. The new one is not owned by a socket. Both
845 * copies share the same packet data but not structure. The new
846 * buffer has a reference count of 1. If the allocation fails the
847 * function returns %NULL otherwise the new buffer is returned.
849 * If this function is called from an interrupt gfp_mask() must be
853 struct sk_buff *skb_clone(struct sk_buff *skb, gfp_t gfp_mask)
857 if (skb_orphan_frags(skb, gfp_mask))
861 if (skb->fclone == SKB_FCLONE_ORIG &&
862 n->fclone == SKB_FCLONE_UNAVAILABLE) {
863 atomic_t *fclone_ref = (atomic_t *) (n + 1);
864 n->fclone = SKB_FCLONE_CLONE;
865 atomic_inc(fclone_ref);
867 if (skb_pfmemalloc(skb))
868 gfp_mask |= __GFP_MEMALLOC;
870 n = kmem_cache_alloc(skbuff_head_cache, gfp_mask);
874 kmemcheck_annotate_bitfield(n, flags1);
875 kmemcheck_annotate_bitfield(n, flags2);
876 n->fclone = SKB_FCLONE_UNAVAILABLE;
879 return __skb_clone(n, skb);
881 EXPORT_SYMBOL(skb_clone);
883 static void skb_headers_offset_update(struct sk_buff *skb, int off)
885 /* Only adjust this if it actually is csum_start rather than csum */
886 if (skb->ip_summed == CHECKSUM_PARTIAL)
887 skb->csum_start += off;
888 /* {transport,network,mac}_header and tail are relative to skb->head */
889 skb->transport_header += off;
890 skb->network_header += off;
891 if (skb_mac_header_was_set(skb))
892 skb->mac_header += off;
893 skb->inner_transport_header += off;
894 skb->inner_network_header += off;
895 skb->inner_mac_header += off;
898 static void copy_skb_header(struct sk_buff *new, const struct sk_buff *old)
900 __copy_skb_header(new, old);
902 skb_shinfo(new)->gso_size = skb_shinfo(old)->gso_size;
903 skb_shinfo(new)->gso_segs = skb_shinfo(old)->gso_segs;
904 skb_shinfo(new)->gso_type = skb_shinfo(old)->gso_type;
907 static inline int skb_alloc_rx_flag(const struct sk_buff *skb)
909 if (skb_pfmemalloc(skb))
915 * skb_copy - create private copy of an sk_buff
916 * @skb: buffer to copy
917 * @gfp_mask: allocation priority
919 * Make a copy of both an &sk_buff and its data. This is used when the
920 * caller wishes to modify the data and needs a private copy of the
921 * data to alter. Returns %NULL on failure or the pointer to the buffer
922 * on success. The returned buffer has a reference count of 1.
924 * As by-product this function converts non-linear &sk_buff to linear
925 * one, so that &sk_buff becomes completely private and caller is allowed
926 * to modify all the data of returned buffer. This means that this
927 * function is not recommended for use in circumstances when only
928 * header is going to be modified. Use pskb_copy() instead.
931 struct sk_buff *skb_copy(const struct sk_buff *skb, gfp_t gfp_mask)
933 int headerlen = skb_headroom(skb);
934 unsigned int size = skb_end_offset(skb) + skb->data_len;
935 struct sk_buff *n = __alloc_skb(size, gfp_mask,
936 skb_alloc_rx_flag(skb), NUMA_NO_NODE);
941 /* Set the data pointer */
942 skb_reserve(n, headerlen);
943 /* Set the tail pointer and length */
944 skb_put(n, skb->len);
946 if (skb_copy_bits(skb, -headerlen, n->head, headerlen + skb->len))
949 copy_skb_header(n, skb);
952 EXPORT_SYMBOL(skb_copy);
955 * __pskb_copy - create copy of an sk_buff with private head.
956 * @skb: buffer to copy
957 * @headroom: headroom of new skb
958 * @gfp_mask: allocation priority
960 * Make a copy of both an &sk_buff and part of its data, located
961 * in header. Fragmented data remain shared. This is used when
962 * the caller wishes to modify only header of &sk_buff and needs
963 * private copy of the header to alter. Returns %NULL on failure
964 * or the pointer to the buffer on success.
965 * The returned buffer has a reference count of 1.
968 struct sk_buff *__pskb_copy(struct sk_buff *skb, int headroom, gfp_t gfp_mask)
970 unsigned int size = skb_headlen(skb) + headroom;
971 struct sk_buff *n = __alloc_skb(size, gfp_mask,
972 skb_alloc_rx_flag(skb), NUMA_NO_NODE);
977 /* Set the data pointer */
978 skb_reserve(n, headroom);
979 /* Set the tail pointer and length */
980 skb_put(n, skb_headlen(skb));
982 skb_copy_from_linear_data(skb, n->data, n->len);
984 n->truesize += skb->data_len;
985 n->data_len = skb->data_len;
988 if (skb_shinfo(skb)->nr_frags) {
991 if (skb_orphan_frags(skb, gfp_mask)) {
996 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
997 skb_shinfo(n)->frags[i] = skb_shinfo(skb)->frags[i];
998 skb_frag_ref(skb, i);
1000 skb_shinfo(n)->nr_frags = i;
1003 if (skb_has_frag_list(skb)) {
1004 skb_shinfo(n)->frag_list = skb_shinfo(skb)->frag_list;
1005 skb_clone_fraglist(n);
1008 copy_skb_header(n, skb);
1012 EXPORT_SYMBOL(__pskb_copy);
1015 * pskb_expand_head - reallocate header of &sk_buff
1016 * @skb: buffer to reallocate
1017 * @nhead: room to add at head
1018 * @ntail: room to add at tail
1019 * @gfp_mask: allocation priority
1021 * Expands (or creates identical copy, if @nhead and @ntail are zero)
1022 * header of @skb. &sk_buff itself is not changed. &sk_buff MUST have
1023 * reference count of 1. Returns zero in the case of success or error,
1024 * if expansion failed. In the last case, &sk_buff is not changed.
1026 * All the pointers pointing into skb header may change and must be
1027 * reloaded after call to this function.
1030 int pskb_expand_head(struct sk_buff *skb, int nhead, int ntail,
1035 int size = nhead + skb_end_offset(skb) + ntail;
1040 if (skb_shared(skb))
1043 size = SKB_DATA_ALIGN(size);
1045 if (skb_pfmemalloc(skb))
1046 gfp_mask |= __GFP_MEMALLOC;
1047 data = kmalloc_reserve(size + SKB_DATA_ALIGN(sizeof(struct skb_shared_info)),
1048 gfp_mask, NUMA_NO_NODE, NULL);
1051 size = SKB_WITH_OVERHEAD(ksize(data));
1053 /* Copy only real data... and, alas, header. This should be
1054 * optimized for the cases when header is void.
1056 memcpy(data + nhead, skb->head, skb_tail_pointer(skb) - skb->head);
1058 memcpy((struct skb_shared_info *)(data + size),
1060 offsetof(struct skb_shared_info, frags[skb_shinfo(skb)->nr_frags]));
1063 * if shinfo is shared we must drop the old head gracefully, but if it
1064 * is not we can just drop the old head and let the existing refcount
1065 * be since all we did is relocate the values
1067 if (skb_cloned(skb)) {
1068 /* copy this zero copy skb frags */
1069 if (skb_orphan_frags(skb, gfp_mask))
1071 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++)
1072 skb_frag_ref(skb, i);
1074 if (skb_has_frag_list(skb))
1075 skb_clone_fraglist(skb);
1077 skb_release_data(skb);
1081 off = (data + nhead) - skb->head;
1086 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1090 skb->end = skb->head + size;
1093 skb_headers_offset_update(skb, nhead);
1097 atomic_set(&skb_shinfo(skb)->dataref, 1);
1105 EXPORT_SYMBOL(pskb_expand_head);
1107 /* Make private copy of skb with writable head and some headroom */
1109 struct sk_buff *skb_realloc_headroom(struct sk_buff *skb, unsigned int headroom)
1111 struct sk_buff *skb2;
1112 int delta = headroom - skb_headroom(skb);
1115 skb2 = pskb_copy(skb, GFP_ATOMIC);
1117 skb2 = skb_clone(skb, GFP_ATOMIC);
1118 if (skb2 && pskb_expand_head(skb2, SKB_DATA_ALIGN(delta), 0,
1126 EXPORT_SYMBOL(skb_realloc_headroom);
1129 * skb_copy_expand - copy and expand sk_buff
1130 * @skb: buffer to copy
1131 * @newheadroom: new free bytes at head
1132 * @newtailroom: new free bytes at tail
1133 * @gfp_mask: allocation priority
1135 * Make a copy of both an &sk_buff and its data and while doing so
1136 * allocate additional space.
1138 * This is used when the caller wishes to modify the data and needs a
1139 * private copy of the data to alter as well as more space for new fields.
1140 * Returns %NULL on failure or the pointer to the buffer
1141 * on success. The returned buffer has a reference count of 1.
1143 * You must pass %GFP_ATOMIC as the allocation priority if this function
1144 * is called from an interrupt.
1146 struct sk_buff *skb_copy_expand(const struct sk_buff *skb,
1147 int newheadroom, int newtailroom,
1151 * Allocate the copy buffer
1153 struct sk_buff *n = __alloc_skb(newheadroom + skb->len + newtailroom,
1154 gfp_mask, skb_alloc_rx_flag(skb),
1156 int oldheadroom = skb_headroom(skb);
1157 int head_copy_len, head_copy_off;
1162 skb_reserve(n, newheadroom);
1164 /* Set the tail pointer and length */
1165 skb_put(n, skb->len);
1167 head_copy_len = oldheadroom;
1169 if (newheadroom <= head_copy_len)
1170 head_copy_len = newheadroom;
1172 head_copy_off = newheadroom - head_copy_len;
1174 /* Copy the linear header and data. */
1175 if (skb_copy_bits(skb, -head_copy_len, n->head + head_copy_off,
1176 skb->len + head_copy_len))
1179 copy_skb_header(n, skb);
1181 skb_headers_offset_update(n, newheadroom - oldheadroom);
1185 EXPORT_SYMBOL(skb_copy_expand);
1188 * skb_pad - zero pad the tail of an skb
1189 * @skb: buffer to pad
1190 * @pad: space to pad
1192 * Ensure that a buffer is followed by a padding area that is zero
1193 * filled. Used by network drivers which may DMA or transfer data
1194 * beyond the buffer end onto the wire.
1196 * May return error in out of memory cases. The skb is freed on error.
1199 int skb_pad(struct sk_buff *skb, int pad)
1204 /* If the skbuff is non linear tailroom is always zero.. */
1205 if (!skb_cloned(skb) && skb_tailroom(skb) >= pad) {
1206 memset(skb->data+skb->len, 0, pad);
1210 ntail = skb->data_len + pad - (skb->end - skb->tail);
1211 if (likely(skb_cloned(skb) || ntail > 0)) {
1212 err = pskb_expand_head(skb, 0, ntail, GFP_ATOMIC);
1217 /* FIXME: The use of this function with non-linear skb's really needs
1220 err = skb_linearize(skb);
1224 memset(skb->data + skb->len, 0, pad);
1231 EXPORT_SYMBOL(skb_pad);
1234 * pskb_put - add data to the tail of a potentially fragmented buffer
1235 * @skb: start of the buffer to use
1236 * @tail: tail fragment of the buffer to use
1237 * @len: amount of data to add
1239 * This function extends the used data area of the potentially
1240 * fragmented buffer. @tail must be the last fragment of @skb -- or
1241 * @skb itself. If this would exceed the total buffer size the kernel
1242 * will panic. A pointer to the first byte of the extra data is
1246 unsigned char *pskb_put(struct sk_buff *skb, struct sk_buff *tail, int len)
1249 skb->data_len += len;
1252 return skb_put(tail, len);
1254 EXPORT_SYMBOL_GPL(pskb_put);
1257 * skb_put - add data to a buffer
1258 * @skb: buffer to use
1259 * @len: amount of data to add
1261 * This function extends the used data area of the buffer. If this would
1262 * exceed the total buffer size the kernel will panic. A pointer to the
1263 * first byte of the extra data is returned.
1265 unsigned char *skb_put(struct sk_buff *skb, unsigned int len)
1267 unsigned char *tmp = skb_tail_pointer(skb);
1268 SKB_LINEAR_ASSERT(skb);
1271 if (unlikely(skb->tail > skb->end))
1272 skb_over_panic(skb, len, __builtin_return_address(0));
1275 EXPORT_SYMBOL(skb_put);
1278 * skb_push - add data to the start of a buffer
1279 * @skb: buffer to use
1280 * @len: amount of data to add
1282 * This function extends the used data area of the buffer at the buffer
1283 * start. If this would exceed the total buffer headroom the kernel will
1284 * panic. A pointer to the first byte of the extra data is returned.
1286 unsigned char *skb_push(struct sk_buff *skb, unsigned int len)
1290 if (unlikely(skb->data<skb->head))
1291 skb_under_panic(skb, len, __builtin_return_address(0));
1294 EXPORT_SYMBOL(skb_push);
1297 * skb_pull - remove data from the start of a buffer
1298 * @skb: buffer to use
1299 * @len: amount of data to remove
1301 * This function removes data from the start of a buffer, returning
1302 * the memory to the headroom. A pointer to the next data in the buffer
1303 * is returned. Once the data has been pulled future pushes will overwrite
1306 unsigned char *skb_pull(struct sk_buff *skb, unsigned int len)
1308 return skb_pull_inline(skb, len);
1310 EXPORT_SYMBOL(skb_pull);
1313 * skb_trim - remove end from a buffer
1314 * @skb: buffer to alter
1317 * Cut the length of a buffer down by removing data from the tail. If
1318 * the buffer is already under the length specified it is not modified.
1319 * The skb must be linear.
1321 void skb_trim(struct sk_buff *skb, unsigned int len)
1324 __skb_trim(skb, len);
1326 EXPORT_SYMBOL(skb_trim);
1328 /* Trims skb to length len. It can change skb pointers.
1331 int ___pskb_trim(struct sk_buff *skb, unsigned int len)
1333 struct sk_buff **fragp;
1334 struct sk_buff *frag;
1335 int offset = skb_headlen(skb);
1336 int nfrags = skb_shinfo(skb)->nr_frags;
1340 if (skb_cloned(skb) &&
1341 unlikely((err = pskb_expand_head(skb, 0, 0, GFP_ATOMIC))))
1348 for (; i < nfrags; i++) {
1349 int end = offset + skb_frag_size(&skb_shinfo(skb)->frags[i]);
1356 skb_frag_size_set(&skb_shinfo(skb)->frags[i++], len - offset);
1359 skb_shinfo(skb)->nr_frags = i;
1361 for (; i < nfrags; i++)
1362 skb_frag_unref(skb, i);
1364 if (skb_has_frag_list(skb))
1365 skb_drop_fraglist(skb);
1369 for (fragp = &skb_shinfo(skb)->frag_list; (frag = *fragp);
1370 fragp = &frag->next) {
1371 int end = offset + frag->len;
1373 if (skb_shared(frag)) {
1374 struct sk_buff *nfrag;
1376 nfrag = skb_clone(frag, GFP_ATOMIC);
1377 if (unlikely(!nfrag))
1380 nfrag->next = frag->next;
1392 unlikely((err = pskb_trim(frag, len - offset))))
1396 skb_drop_list(&frag->next);
1401 if (len > skb_headlen(skb)) {
1402 skb->data_len -= skb->len - len;
1407 skb_set_tail_pointer(skb, len);
1412 EXPORT_SYMBOL(___pskb_trim);
1415 * __pskb_pull_tail - advance tail of skb header
1416 * @skb: buffer to reallocate
1417 * @delta: number of bytes to advance tail
1419 * The function makes a sense only on a fragmented &sk_buff,
1420 * it expands header moving its tail forward and copying necessary
1421 * data from fragmented part.
1423 * &sk_buff MUST have reference count of 1.
1425 * Returns %NULL (and &sk_buff does not change) if pull failed
1426 * or value of new tail of skb in the case of success.
1428 * All the pointers pointing into skb header may change and must be
1429 * reloaded after call to this function.
1432 /* Moves tail of skb head forward, copying data from fragmented part,
1433 * when it is necessary.
1434 * 1. It may fail due to malloc failure.
1435 * 2. It may change skb pointers.
1437 * It is pretty complicated. Luckily, it is called only in exceptional cases.
1439 unsigned char *__pskb_pull_tail(struct sk_buff *skb, int delta)
1441 /* If skb has not enough free space at tail, get new one
1442 * plus 128 bytes for future expansions. If we have enough
1443 * room at tail, reallocate without expansion only if skb is cloned.
1445 int i, k, eat = (skb->tail + delta) - skb->end;
1447 if (eat > 0 || skb_cloned(skb)) {
1448 if (pskb_expand_head(skb, 0, eat > 0 ? eat + 128 : 0,
1453 if (skb_copy_bits(skb, skb_headlen(skb), skb_tail_pointer(skb), delta))
1456 /* Optimization: no fragments, no reasons to preestimate
1457 * size of pulled pages. Superb.
1459 if (!skb_has_frag_list(skb))
1462 /* Estimate size of pulled pages. */
1464 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1465 int size = skb_frag_size(&skb_shinfo(skb)->frags[i]);
1472 /* If we need update frag list, we are in troubles.
1473 * Certainly, it possible to add an offset to skb data,
1474 * but taking into account that pulling is expected to
1475 * be very rare operation, it is worth to fight against
1476 * further bloating skb head and crucify ourselves here instead.
1477 * Pure masohism, indeed. 8)8)
1480 struct sk_buff *list = skb_shinfo(skb)->frag_list;
1481 struct sk_buff *clone = NULL;
1482 struct sk_buff *insp = NULL;
1487 if (list->len <= eat) {
1488 /* Eaten as whole. */
1493 /* Eaten partially. */
1495 if (skb_shared(list)) {
1496 /* Sucks! We need to fork list. :-( */
1497 clone = skb_clone(list, GFP_ATOMIC);
1503 /* This may be pulled without
1507 if (!pskb_pull(list, eat)) {
1515 /* Free pulled out fragments. */
1516 while ((list = skb_shinfo(skb)->frag_list) != insp) {
1517 skb_shinfo(skb)->frag_list = list->next;
1520 /* And insert new clone at head. */
1523 skb_shinfo(skb)->frag_list = clone;
1526 /* Success! Now we may commit changes to skb data. */
1531 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1532 int size = skb_frag_size(&skb_shinfo(skb)->frags[i]);
1535 skb_frag_unref(skb, i);
1538 skb_shinfo(skb)->frags[k] = skb_shinfo(skb)->frags[i];
1540 skb_shinfo(skb)->frags[k].page_offset += eat;
1541 skb_frag_size_sub(&skb_shinfo(skb)->frags[k], eat);
1547 skb_shinfo(skb)->nr_frags = k;
1550 skb->data_len -= delta;
1552 return skb_tail_pointer(skb);
1554 EXPORT_SYMBOL(__pskb_pull_tail);
1557 * skb_copy_bits - copy bits from skb to kernel buffer
1559 * @offset: offset in source
1560 * @to: destination buffer
1561 * @len: number of bytes to copy
1563 * Copy the specified number of bytes from the source skb to the
1564 * destination buffer.
1567 * If its prototype is ever changed,
1568 * check arch/{*}/net/{*}.S files,
1569 * since it is called from BPF assembly code.
1571 int skb_copy_bits(const struct sk_buff *skb, int offset, void *to, int len)
1573 int start = skb_headlen(skb);
1574 struct sk_buff *frag_iter;
1577 if (offset > (int)skb->len - len)
1581 if ((copy = start - offset) > 0) {
1584 skb_copy_from_linear_data_offset(skb, offset, to, copy);
1585 if ((len -= copy) == 0)
1591 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1593 skb_frag_t *f = &skb_shinfo(skb)->frags[i];
1595 WARN_ON(start > offset + len);
1597 end = start + skb_frag_size(f);
1598 if ((copy = end - offset) > 0) {
1604 vaddr = kmap_atomic(skb_frag_page(f));
1606 vaddr + f->page_offset + offset - start,
1608 kunmap_atomic(vaddr);
1610 if ((len -= copy) == 0)
1618 skb_walk_frags(skb, frag_iter) {
1621 WARN_ON(start > offset + len);
1623 end = start + frag_iter->len;
1624 if ((copy = end - offset) > 0) {
1627 if (skb_copy_bits(frag_iter, offset - start, to, copy))
1629 if ((len -= copy) == 0)
1643 EXPORT_SYMBOL(skb_copy_bits);
1646 * Callback from splice_to_pipe(), if we need to release some pages
1647 * at the end of the spd in case we error'ed out in filling the pipe.
1649 static void sock_spd_release(struct splice_pipe_desc *spd, unsigned int i)
1651 put_page(spd->pages[i]);
1654 static struct page *linear_to_page(struct page *page, unsigned int *len,
1655 unsigned int *offset,
1658 struct page_frag *pfrag = sk_page_frag(sk);
1660 if (!sk_page_frag_refill(sk, pfrag))
1663 *len = min_t(unsigned int, *len, pfrag->size - pfrag->offset);
1665 memcpy(page_address(pfrag->page) + pfrag->offset,
1666 page_address(page) + *offset, *len);
1667 *offset = pfrag->offset;
1668 pfrag->offset += *len;
1673 static bool spd_can_coalesce(const struct splice_pipe_desc *spd,
1675 unsigned int offset)
1677 return spd->nr_pages &&
1678 spd->pages[spd->nr_pages - 1] == page &&
1679 (spd->partial[spd->nr_pages - 1].offset +
1680 spd->partial[spd->nr_pages - 1].len == offset);
1684 * Fill page/offset/length into spd, if it can hold more pages.
1686 static bool spd_fill_page(struct splice_pipe_desc *spd,
1687 struct pipe_inode_info *pipe, struct page *page,
1688 unsigned int *len, unsigned int offset,
1692 if (unlikely(spd->nr_pages == MAX_SKB_FRAGS))
1696 page = linear_to_page(page, len, &offset, sk);
1700 if (spd_can_coalesce(spd, page, offset)) {
1701 spd->partial[spd->nr_pages - 1].len += *len;
1705 spd->pages[spd->nr_pages] = page;
1706 spd->partial[spd->nr_pages].len = *len;
1707 spd->partial[spd->nr_pages].offset = offset;
1713 static bool __splice_segment(struct page *page, unsigned int poff,
1714 unsigned int plen, unsigned int *off,
1716 struct splice_pipe_desc *spd, bool linear,
1718 struct pipe_inode_info *pipe)
1723 /* skip this segment if already processed */
1729 /* ignore any bits we already processed */
1735 unsigned int flen = min(*len, plen);
1737 if (spd_fill_page(spd, pipe, page, &flen, poff,
1743 } while (*len && plen);
1749 * Map linear and fragment data from the skb to spd. It reports true if the
1750 * pipe is full or if we already spliced the requested length.
1752 static bool __skb_splice_bits(struct sk_buff *skb, struct pipe_inode_info *pipe,
1753 unsigned int *offset, unsigned int *len,
1754 struct splice_pipe_desc *spd, struct sock *sk)
1758 /* map the linear part :
1759 * If skb->head_frag is set, this 'linear' part is backed by a
1760 * fragment, and if the head is not shared with any clones then
1761 * we can avoid a copy since we own the head portion of this page.
1763 if (__splice_segment(virt_to_page(skb->data),
1764 (unsigned long) skb->data & (PAGE_SIZE - 1),
1767 skb_head_is_locked(skb),
1772 * then map the fragments
1774 for (seg = 0; seg < skb_shinfo(skb)->nr_frags; seg++) {
1775 const skb_frag_t *f = &skb_shinfo(skb)->frags[seg];
1777 if (__splice_segment(skb_frag_page(f),
1778 f->page_offset, skb_frag_size(f),
1779 offset, len, spd, false, sk, pipe))
1787 * Map data from the skb to a pipe. Should handle both the linear part,
1788 * the fragments, and the frag list. It does NOT handle frag lists within
1789 * the frag list, if such a thing exists. We'd probably need to recurse to
1790 * handle that cleanly.
1792 int skb_splice_bits(struct sk_buff *skb, unsigned int offset,
1793 struct pipe_inode_info *pipe, unsigned int tlen,
1796 struct partial_page partial[MAX_SKB_FRAGS];
1797 struct page *pages[MAX_SKB_FRAGS];
1798 struct splice_pipe_desc spd = {
1801 .nr_pages_max = MAX_SKB_FRAGS,
1803 .ops = &nosteal_pipe_buf_ops,
1804 .spd_release = sock_spd_release,
1806 struct sk_buff *frag_iter;
1807 struct sock *sk = skb->sk;
1811 * __skb_splice_bits() only fails if the output has no room left,
1812 * so no point in going over the frag_list for the error case.
1814 if (__skb_splice_bits(skb, pipe, &offset, &tlen, &spd, sk))
1820 * now see if we have a frag_list to map
1822 skb_walk_frags(skb, frag_iter) {
1825 if (__skb_splice_bits(frag_iter, pipe, &offset, &tlen, &spd, sk))
1832 * Drop the socket lock, otherwise we have reverse
1833 * locking dependencies between sk_lock and i_mutex
1834 * here as compared to sendfile(). We enter here
1835 * with the socket lock held, and splice_to_pipe() will
1836 * grab the pipe inode lock. For sendfile() emulation,
1837 * we call into ->sendpage() with the i_mutex lock held
1838 * and networking will grab the socket lock.
1841 ret = splice_to_pipe(pipe, &spd);
1849 * skb_store_bits - store bits from kernel buffer to skb
1850 * @skb: destination buffer
1851 * @offset: offset in destination
1852 * @from: source buffer
1853 * @len: number of bytes to copy
1855 * Copy the specified number of bytes from the source buffer to the
1856 * destination skb. This function handles all the messy bits of
1857 * traversing fragment lists and such.
1860 int skb_store_bits(struct sk_buff *skb, int offset, const void *from, int len)
1862 int start = skb_headlen(skb);
1863 struct sk_buff *frag_iter;
1866 if (offset > (int)skb->len - len)
1869 if ((copy = start - offset) > 0) {
1872 skb_copy_to_linear_data_offset(skb, offset, from, copy);
1873 if ((len -= copy) == 0)
1879 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1880 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
1883 WARN_ON(start > offset + len);
1885 end = start + skb_frag_size(frag);
1886 if ((copy = end - offset) > 0) {
1892 vaddr = kmap_atomic(skb_frag_page(frag));
1893 memcpy(vaddr + frag->page_offset + offset - start,
1895 kunmap_atomic(vaddr);
1897 if ((len -= copy) == 0)
1905 skb_walk_frags(skb, frag_iter) {
1908 WARN_ON(start > offset + len);
1910 end = start + frag_iter->len;
1911 if ((copy = end - offset) > 0) {
1914 if (skb_store_bits(frag_iter, offset - start,
1917 if ((len -= copy) == 0)
1930 EXPORT_SYMBOL(skb_store_bits);
1932 /* Checksum skb data. */
1933 __wsum __skb_checksum(const struct sk_buff *skb, int offset, int len,
1934 __wsum csum, const struct skb_checksum_ops *ops)
1936 int start = skb_headlen(skb);
1937 int i, copy = start - offset;
1938 struct sk_buff *frag_iter;
1941 /* Checksum header. */
1945 csum = ops->update(skb->data + offset, copy, csum);
1946 if ((len -= copy) == 0)
1952 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1954 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
1956 WARN_ON(start > offset + len);
1958 end = start + skb_frag_size(frag);
1959 if ((copy = end - offset) > 0) {
1965 vaddr = kmap_atomic(skb_frag_page(frag));
1966 csum2 = ops->update(vaddr + frag->page_offset +
1967 offset - start, copy, 0);
1968 kunmap_atomic(vaddr);
1969 csum = ops->combine(csum, csum2, pos, copy);
1978 skb_walk_frags(skb, frag_iter) {
1981 WARN_ON(start > offset + len);
1983 end = start + frag_iter->len;
1984 if ((copy = end - offset) > 0) {
1988 csum2 = __skb_checksum(frag_iter, offset - start,
1990 csum = ops->combine(csum, csum2, pos, copy);
1991 if ((len -= copy) == 0)
2002 EXPORT_SYMBOL(__skb_checksum);
2004 __wsum skb_checksum(const struct sk_buff *skb, int offset,
2005 int len, __wsum csum)
2007 const struct skb_checksum_ops ops = {
2008 .update = csum_partial_ext,
2009 .combine = csum_block_add_ext,
2012 return __skb_checksum(skb, offset, len, csum, &ops);
2014 EXPORT_SYMBOL(skb_checksum);
2016 /* Both of above in one bottle. */
2018 __wsum skb_copy_and_csum_bits(const struct sk_buff *skb, int offset,
2019 u8 *to, int len, __wsum csum)
2021 int start = skb_headlen(skb);
2022 int i, copy = start - offset;
2023 struct sk_buff *frag_iter;
2030 csum = csum_partial_copy_nocheck(skb->data + offset, to,
2032 if ((len -= copy) == 0)
2039 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
2042 WARN_ON(start > offset + len);
2044 end = start + skb_frag_size(&skb_shinfo(skb)->frags[i]);
2045 if ((copy = end - offset) > 0) {
2048 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
2052 vaddr = kmap_atomic(skb_frag_page(frag));
2053 csum2 = csum_partial_copy_nocheck(vaddr +
2057 kunmap_atomic(vaddr);
2058 csum = csum_block_add(csum, csum2, pos);
2068 skb_walk_frags(skb, frag_iter) {
2072 WARN_ON(start > offset + len);
2074 end = start + frag_iter->len;
2075 if ((copy = end - offset) > 0) {
2078 csum2 = skb_copy_and_csum_bits(frag_iter,
2081 csum = csum_block_add(csum, csum2, pos);
2082 if ((len -= copy) == 0)
2093 EXPORT_SYMBOL(skb_copy_and_csum_bits);
2096 * skb_zerocopy_headlen - Calculate headroom needed for skb_zerocopy()
2097 * @from: source buffer
2099 * Calculates the amount of linear headroom needed in the 'to' skb passed
2100 * into skb_zerocopy().
2103 skb_zerocopy_headlen(const struct sk_buff *from)
2105 unsigned int hlen = 0;
2107 if (!from->head_frag ||
2108 skb_headlen(from) < L1_CACHE_BYTES ||
2109 skb_shinfo(from)->nr_frags >= MAX_SKB_FRAGS)
2110 hlen = skb_headlen(from);
2112 if (skb_has_frag_list(from))
2117 EXPORT_SYMBOL_GPL(skb_zerocopy_headlen);
2120 * skb_zerocopy - Zero copy skb to skb
2121 * @to: destination buffer
2122 * @source: source buffer
2123 * @len: number of bytes to copy from source buffer
2124 * @hlen: size of linear headroom in destination buffer
2126 * Copies up to `len` bytes from `from` to `to` by creating references
2127 * to the frags in the source buffer.
2129 * The `hlen` as calculated by skb_zerocopy_headlen() specifies the
2130 * headroom in the `to` buffer.
2133 skb_zerocopy(struct sk_buff *to, const struct sk_buff *from, int len, int hlen)
2136 int plen = 0; /* length of skb->head fragment */
2138 unsigned int offset;
2140 BUG_ON(!from->head_frag && !hlen);
2142 /* dont bother with small payloads */
2143 if (len <= skb_tailroom(to)) {
2144 skb_copy_bits(from, 0, skb_put(to, len), len);
2149 skb_copy_bits(from, 0, skb_put(to, hlen), hlen);
2152 plen = min_t(int, skb_headlen(from), len);
2154 page = virt_to_head_page(from->head);
2155 offset = from->data - (unsigned char *)page_address(page);
2156 __skb_fill_page_desc(to, 0, page, offset, plen);
2163 to->truesize += len + plen;
2164 to->len += len + plen;
2165 to->data_len += len + plen;
2167 for (i = 0; i < skb_shinfo(from)->nr_frags; i++) {
2170 skb_shinfo(to)->frags[j] = skb_shinfo(from)->frags[i];
2171 skb_shinfo(to)->frags[j].size = min_t(int, skb_shinfo(to)->frags[j].size, len);
2172 len -= skb_shinfo(to)->frags[j].size;
2173 skb_frag_ref(to, j);
2176 skb_shinfo(to)->nr_frags = j;
2178 EXPORT_SYMBOL_GPL(skb_zerocopy);
2180 void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to)
2185 if (skb->ip_summed == CHECKSUM_PARTIAL)
2186 csstart = skb_checksum_start_offset(skb);
2188 csstart = skb_headlen(skb);
2190 BUG_ON(csstart > skb_headlen(skb));
2192 skb_copy_from_linear_data(skb, to, csstart);
2195 if (csstart != skb->len)
2196 csum = skb_copy_and_csum_bits(skb, csstart, to + csstart,
2197 skb->len - csstart, 0);
2199 if (skb->ip_summed == CHECKSUM_PARTIAL) {
2200 long csstuff = csstart + skb->csum_offset;
2202 *((__sum16 *)(to + csstuff)) = csum_fold(csum);
2205 EXPORT_SYMBOL(skb_copy_and_csum_dev);
2208 * skb_dequeue - remove from the head of the queue
2209 * @list: list to dequeue from
2211 * Remove the head of the list. The list lock is taken so the function
2212 * may be used safely with other locking list functions. The head item is
2213 * returned or %NULL if the list is empty.
2216 struct sk_buff *skb_dequeue(struct sk_buff_head *list)
2218 unsigned long flags;
2219 struct sk_buff *result;
2221 spin_lock_irqsave(&list->lock, flags);
2222 result = __skb_dequeue(list);
2223 spin_unlock_irqrestore(&list->lock, flags);
2226 EXPORT_SYMBOL(skb_dequeue);
2229 * skb_dequeue_tail - remove from the tail of the queue
2230 * @list: list to dequeue from
2232 * Remove the tail of the list. The list lock is taken so the function
2233 * may be used safely with other locking list functions. The tail item is
2234 * returned or %NULL if the list is empty.
2236 struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list)
2238 unsigned long flags;
2239 struct sk_buff *result;
2241 spin_lock_irqsave(&list->lock, flags);
2242 result = __skb_dequeue_tail(list);
2243 spin_unlock_irqrestore(&list->lock, flags);
2246 EXPORT_SYMBOL(skb_dequeue_tail);
2249 * skb_queue_purge - empty a list
2250 * @list: list to empty
2252 * Delete all buffers on an &sk_buff list. Each buffer is removed from
2253 * the list and one reference dropped. This function takes the list
2254 * lock and is atomic with respect to other list locking functions.
2256 void skb_queue_purge(struct sk_buff_head *list)
2258 struct sk_buff *skb;
2259 while ((skb = skb_dequeue(list)) != NULL)
2262 EXPORT_SYMBOL(skb_queue_purge);
2265 * skb_queue_head - queue a buffer at the list head
2266 * @list: list to use
2267 * @newsk: buffer to queue
2269 * Queue a buffer at the start of the list. This function takes the
2270 * list lock and can be used safely with other locking &sk_buff functions
2273 * A buffer cannot be placed on two lists at the same time.
2275 void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk)
2277 unsigned long flags;
2279 spin_lock_irqsave(&list->lock, flags);
2280 __skb_queue_head(list, newsk);
2281 spin_unlock_irqrestore(&list->lock, flags);
2283 EXPORT_SYMBOL(skb_queue_head);
2286 * skb_queue_tail - queue a buffer at the list tail
2287 * @list: list to use
2288 * @newsk: buffer to queue
2290 * Queue a buffer at the tail of the list. This function takes the
2291 * list lock and can be used safely with other locking &sk_buff functions
2294 * A buffer cannot be placed on two lists at the same time.
2296 void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk)
2298 unsigned long flags;
2300 spin_lock_irqsave(&list->lock, flags);
2301 __skb_queue_tail(list, newsk);
2302 spin_unlock_irqrestore(&list->lock, flags);
2304 EXPORT_SYMBOL(skb_queue_tail);
2307 * skb_unlink - remove a buffer from a list
2308 * @skb: buffer to remove
2309 * @list: list to use
2311 * Remove a packet from a list. The list locks are taken and this
2312 * function is atomic with respect to other list locked calls
2314 * You must know what list the SKB is on.
2316 void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
2318 unsigned long flags;
2320 spin_lock_irqsave(&list->lock, flags);
2321 __skb_unlink(skb, list);
2322 spin_unlock_irqrestore(&list->lock, flags);
2324 EXPORT_SYMBOL(skb_unlink);
2327 * skb_append - append a buffer
2328 * @old: buffer to insert after
2329 * @newsk: buffer to insert
2330 * @list: list to use
2332 * Place a packet after a given packet in a list. The list locks are taken
2333 * and this function is atomic with respect to other list locked calls.
2334 * A buffer cannot be placed on two lists at the same time.
2336 void skb_append(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list)
2338 unsigned long flags;
2340 spin_lock_irqsave(&list->lock, flags);
2341 __skb_queue_after(list, old, newsk);
2342 spin_unlock_irqrestore(&list->lock, flags);
2344 EXPORT_SYMBOL(skb_append);
2347 * skb_insert - insert a buffer
2348 * @old: buffer to insert before
2349 * @newsk: buffer to insert
2350 * @list: list to use
2352 * Place a packet before a given packet in a list. The list locks are
2353 * taken and this function is atomic with respect to other list locked
2356 * A buffer cannot be placed on two lists at the same time.
2358 void skb_insert(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list)
2360 unsigned long flags;
2362 spin_lock_irqsave(&list->lock, flags);
2363 __skb_insert(newsk, old->prev, old, list);
2364 spin_unlock_irqrestore(&list->lock, flags);
2366 EXPORT_SYMBOL(skb_insert);
2368 static inline void skb_split_inside_header(struct sk_buff *skb,
2369 struct sk_buff* skb1,
2370 const u32 len, const int pos)
2374 skb_copy_from_linear_data_offset(skb, len, skb_put(skb1, pos - len),
2376 /* And move data appendix as is. */
2377 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++)
2378 skb_shinfo(skb1)->frags[i] = skb_shinfo(skb)->frags[i];
2380 skb_shinfo(skb1)->nr_frags = skb_shinfo(skb)->nr_frags;
2381 skb_shinfo(skb)->nr_frags = 0;
2382 skb1->data_len = skb->data_len;
2383 skb1->len += skb1->data_len;
2386 skb_set_tail_pointer(skb, len);
2389 static inline void skb_split_no_header(struct sk_buff *skb,
2390 struct sk_buff* skb1,
2391 const u32 len, int pos)
2394 const int nfrags = skb_shinfo(skb)->nr_frags;
2396 skb_shinfo(skb)->nr_frags = 0;
2397 skb1->len = skb1->data_len = skb->len - len;
2399 skb->data_len = len - pos;
2401 for (i = 0; i < nfrags; i++) {
2402 int size = skb_frag_size(&skb_shinfo(skb)->frags[i]);
2404 if (pos + size > len) {
2405 skb_shinfo(skb1)->frags[k] = skb_shinfo(skb)->frags[i];
2409 * We have two variants in this case:
2410 * 1. Move all the frag to the second
2411 * part, if it is possible. F.e.
2412 * this approach is mandatory for TUX,
2413 * where splitting is expensive.
2414 * 2. Split is accurately. We make this.
2416 skb_frag_ref(skb, i);
2417 skb_shinfo(skb1)->frags[0].page_offset += len - pos;
2418 skb_frag_size_sub(&skb_shinfo(skb1)->frags[0], len - pos);
2419 skb_frag_size_set(&skb_shinfo(skb)->frags[i], len - pos);
2420 skb_shinfo(skb)->nr_frags++;
2424 skb_shinfo(skb)->nr_frags++;
2427 skb_shinfo(skb1)->nr_frags = k;
2431 * skb_split - Split fragmented skb to two parts at length len.
2432 * @skb: the buffer to split
2433 * @skb1: the buffer to receive the second part
2434 * @len: new length for skb
2436 void skb_split(struct sk_buff *skb, struct sk_buff *skb1, const u32 len)
2438 int pos = skb_headlen(skb);
2440 skb_shinfo(skb1)->tx_flags = skb_shinfo(skb)->tx_flags & SKBTX_SHARED_FRAG;
2441 if (len < pos) /* Split line is inside header. */
2442 skb_split_inside_header(skb, skb1, len, pos);
2443 else /* Second chunk has no header, nothing to copy. */
2444 skb_split_no_header(skb, skb1, len, pos);
2446 EXPORT_SYMBOL(skb_split);
2448 /* Shifting from/to a cloned skb is a no-go.
2450 * Caller cannot keep skb_shinfo related pointers past calling here!
2452 static int skb_prepare_for_shift(struct sk_buff *skb)
2454 return skb_cloned(skb) && pskb_expand_head(skb, 0, 0, GFP_ATOMIC);
2458 * skb_shift - Shifts paged data partially from skb to another
2459 * @tgt: buffer into which tail data gets added
2460 * @skb: buffer from which the paged data comes from
2461 * @shiftlen: shift up to this many bytes
2463 * Attempts to shift up to shiftlen worth of bytes, which may be less than
2464 * the length of the skb, from skb to tgt. Returns number bytes shifted.
2465 * It's up to caller to free skb if everything was shifted.
2467 * If @tgt runs out of frags, the whole operation is aborted.
2469 * Skb cannot include anything else but paged data while tgt is allowed
2470 * to have non-paged data as well.
2472 * TODO: full sized shift could be optimized but that would need
2473 * specialized skb free'er to handle frags without up-to-date nr_frags.
2475 int skb_shift(struct sk_buff *tgt, struct sk_buff *skb, int shiftlen)
2477 int from, to, merge, todo;
2478 struct skb_frag_struct *fragfrom, *fragto;
2480 BUG_ON(shiftlen > skb->len);
2481 BUG_ON(skb_headlen(skb)); /* Would corrupt stream */
2485 to = skb_shinfo(tgt)->nr_frags;
2486 fragfrom = &skb_shinfo(skb)->frags[from];
2488 /* Actual merge is delayed until the point when we know we can
2489 * commit all, so that we don't have to undo partial changes
2492 !skb_can_coalesce(tgt, to, skb_frag_page(fragfrom),
2493 fragfrom->page_offset)) {
2498 todo -= skb_frag_size(fragfrom);
2500 if (skb_prepare_for_shift(skb) ||
2501 skb_prepare_for_shift(tgt))
2504 /* All previous frag pointers might be stale! */
2505 fragfrom = &skb_shinfo(skb)->frags[from];
2506 fragto = &skb_shinfo(tgt)->frags[merge];
2508 skb_frag_size_add(fragto, shiftlen);
2509 skb_frag_size_sub(fragfrom, shiftlen);
2510 fragfrom->page_offset += shiftlen;
2518 /* Skip full, not-fitting skb to avoid expensive operations */
2519 if ((shiftlen == skb->len) &&
2520 (skb_shinfo(skb)->nr_frags - from) > (MAX_SKB_FRAGS - to))
2523 if (skb_prepare_for_shift(skb) || skb_prepare_for_shift(tgt))
2526 while ((todo > 0) && (from < skb_shinfo(skb)->nr_frags)) {
2527 if (to == MAX_SKB_FRAGS)
2530 fragfrom = &skb_shinfo(skb)->frags[from];
2531 fragto = &skb_shinfo(tgt)->frags[to];
2533 if (todo >= skb_frag_size(fragfrom)) {
2534 *fragto = *fragfrom;
2535 todo -= skb_frag_size(fragfrom);
2540 __skb_frag_ref(fragfrom);
2541 fragto->page = fragfrom->page;
2542 fragto->page_offset = fragfrom->page_offset;
2543 skb_frag_size_set(fragto, todo);
2545 fragfrom->page_offset += todo;
2546 skb_frag_size_sub(fragfrom, todo);
2554 /* Ready to "commit" this state change to tgt */
2555 skb_shinfo(tgt)->nr_frags = to;
2558 fragfrom = &skb_shinfo(skb)->frags[0];
2559 fragto = &skb_shinfo(tgt)->frags[merge];
2561 skb_frag_size_add(fragto, skb_frag_size(fragfrom));
2562 __skb_frag_unref(fragfrom);
2565 /* Reposition in the original skb */
2567 while (from < skb_shinfo(skb)->nr_frags)
2568 skb_shinfo(skb)->frags[to++] = skb_shinfo(skb)->frags[from++];
2569 skb_shinfo(skb)->nr_frags = to;
2571 BUG_ON(todo > 0 && !skb_shinfo(skb)->nr_frags);
2574 /* Most likely the tgt won't ever need its checksum anymore, skb on
2575 * the other hand might need it if it needs to be resent
2577 tgt->ip_summed = CHECKSUM_PARTIAL;
2578 skb->ip_summed = CHECKSUM_PARTIAL;
2580 /* Yak, is it really working this way? Some helper please? */
2581 skb->len -= shiftlen;
2582 skb->data_len -= shiftlen;
2583 skb->truesize -= shiftlen;
2584 tgt->len += shiftlen;
2585 tgt->data_len += shiftlen;
2586 tgt->truesize += shiftlen;
2592 * skb_prepare_seq_read - Prepare a sequential read of skb data
2593 * @skb: the buffer to read
2594 * @from: lower offset of data to be read
2595 * @to: upper offset of data to be read
2596 * @st: state variable
2598 * Initializes the specified state variable. Must be called before
2599 * invoking skb_seq_read() for the first time.
2601 void skb_prepare_seq_read(struct sk_buff *skb, unsigned int from,
2602 unsigned int to, struct skb_seq_state *st)
2604 st->lower_offset = from;
2605 st->upper_offset = to;
2606 st->root_skb = st->cur_skb = skb;
2607 st->frag_idx = st->stepped_offset = 0;
2608 st->frag_data = NULL;
2610 EXPORT_SYMBOL(skb_prepare_seq_read);
2613 * skb_seq_read - Sequentially read skb data
2614 * @consumed: number of bytes consumed by the caller so far
2615 * @data: destination pointer for data to be returned
2616 * @st: state variable
2618 * Reads a block of skb data at @consumed relative to the
2619 * lower offset specified to skb_prepare_seq_read(). Assigns
2620 * the head of the data block to @data and returns the length
2621 * of the block or 0 if the end of the skb data or the upper
2622 * offset has been reached.
2624 * The caller is not required to consume all of the data
2625 * returned, i.e. @consumed is typically set to the number
2626 * of bytes already consumed and the next call to
2627 * skb_seq_read() will return the remaining part of the block.
2629 * Note 1: The size of each block of data returned can be arbitrary,
2630 * this limitation is the cost for zerocopy seqeuental
2631 * reads of potentially non linear data.
2633 * Note 2: Fragment lists within fragments are not implemented
2634 * at the moment, state->root_skb could be replaced with
2635 * a stack for this purpose.
2637 unsigned int skb_seq_read(unsigned int consumed, const u8 **data,
2638 struct skb_seq_state *st)
2640 unsigned int block_limit, abs_offset = consumed + st->lower_offset;
2643 if (unlikely(abs_offset >= st->upper_offset)) {
2644 if (st->frag_data) {
2645 kunmap_atomic(st->frag_data);
2646 st->frag_data = NULL;
2652 block_limit = skb_headlen(st->cur_skb) + st->stepped_offset;
2654 if (abs_offset < block_limit && !st->frag_data) {
2655 *data = st->cur_skb->data + (abs_offset - st->stepped_offset);
2656 return block_limit - abs_offset;
2659 if (st->frag_idx == 0 && !st->frag_data)
2660 st->stepped_offset += skb_headlen(st->cur_skb);
2662 while (st->frag_idx < skb_shinfo(st->cur_skb)->nr_frags) {
2663 frag = &skb_shinfo(st->cur_skb)->frags[st->frag_idx];
2664 block_limit = skb_frag_size(frag) + st->stepped_offset;
2666 if (abs_offset < block_limit) {
2668 st->frag_data = kmap_atomic(skb_frag_page(frag));
2670 *data = (u8 *) st->frag_data + frag->page_offset +
2671 (abs_offset - st->stepped_offset);
2673 return block_limit - abs_offset;
2676 if (st->frag_data) {
2677 kunmap_atomic(st->frag_data);
2678 st->frag_data = NULL;
2682 st->stepped_offset += skb_frag_size(frag);
2685 if (st->frag_data) {
2686 kunmap_atomic(st->frag_data);
2687 st->frag_data = NULL;
2690 if (st->root_skb == st->cur_skb && skb_has_frag_list(st->root_skb)) {
2691 st->cur_skb = skb_shinfo(st->root_skb)->frag_list;
2694 } else if (st->cur_skb->next) {
2695 st->cur_skb = st->cur_skb->next;
2702 EXPORT_SYMBOL(skb_seq_read);
2705 * skb_abort_seq_read - Abort a sequential read of skb data
2706 * @st: state variable
2708 * Must be called if skb_seq_read() was not called until it
2711 void skb_abort_seq_read(struct skb_seq_state *st)
2714 kunmap_atomic(st->frag_data);
2716 EXPORT_SYMBOL(skb_abort_seq_read);
2718 #define TS_SKB_CB(state) ((struct skb_seq_state *) &((state)->cb))
2720 static unsigned int skb_ts_get_next_block(unsigned int offset, const u8 **text,
2721 struct ts_config *conf,
2722 struct ts_state *state)
2724 return skb_seq_read(offset, text, TS_SKB_CB(state));
2727 static void skb_ts_finish(struct ts_config *conf, struct ts_state *state)
2729 skb_abort_seq_read(TS_SKB_CB(state));
2733 * skb_find_text - Find a text pattern in skb data
2734 * @skb: the buffer to look in
2735 * @from: search offset
2737 * @config: textsearch configuration
2738 * @state: uninitialized textsearch state variable
2740 * Finds a pattern in the skb data according to the specified
2741 * textsearch configuration. Use textsearch_next() to retrieve
2742 * subsequent occurrences of the pattern. Returns the offset
2743 * to the first occurrence or UINT_MAX if no match was found.
2745 unsigned int skb_find_text(struct sk_buff *skb, unsigned int from,
2746 unsigned int to, struct ts_config *config,
2747 struct ts_state *state)
2751 config->get_next_block = skb_ts_get_next_block;
2752 config->finish = skb_ts_finish;
2754 skb_prepare_seq_read(skb, from, to, TS_SKB_CB(state));
2756 ret = textsearch_find(config, state);
2757 return (ret <= to - from ? ret : UINT_MAX);
2759 EXPORT_SYMBOL(skb_find_text);
2762 * skb_append_datato_frags - append the user data to a skb
2763 * @sk: sock structure
2764 * @skb: skb structure to be appened with user data.
2765 * @getfrag: call back function to be used for getting the user data
2766 * @from: pointer to user message iov
2767 * @length: length of the iov message
2769 * Description: This procedure append the user data in the fragment part
2770 * of the skb if any page alloc fails user this procedure returns -ENOMEM
2772 int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb,
2773 int (*getfrag)(void *from, char *to, int offset,
2774 int len, int odd, struct sk_buff *skb),
2775 void *from, int length)
2777 int frg_cnt = skb_shinfo(skb)->nr_frags;
2781 struct page_frag *pfrag = ¤t->task_frag;
2784 /* Return error if we don't have space for new frag */
2785 if (frg_cnt >= MAX_SKB_FRAGS)
2788 if (!sk_page_frag_refill(sk, pfrag))
2791 /* copy the user data to page */
2792 copy = min_t(int, length, pfrag->size - pfrag->offset);
2794 ret = getfrag(from, page_address(pfrag->page) + pfrag->offset,
2795 offset, copy, 0, skb);
2799 /* copy was successful so update the size parameters */
2800 skb_fill_page_desc(skb, frg_cnt, pfrag->page, pfrag->offset,
2803 pfrag->offset += copy;
2804 get_page(pfrag->page);
2806 skb->truesize += copy;
2807 atomic_add(copy, &sk->sk_wmem_alloc);
2809 skb->data_len += copy;
2813 } while (length > 0);
2817 EXPORT_SYMBOL(skb_append_datato_frags);
2820 * skb_pull_rcsum - pull skb and update receive checksum
2821 * @skb: buffer to update
2822 * @len: length of data pulled
2824 * This function performs an skb_pull on the packet and updates
2825 * the CHECKSUM_COMPLETE checksum. It should be used on
2826 * receive path processing instead of skb_pull unless you know
2827 * that the checksum difference is zero (e.g., a valid IP header)
2828 * or you are setting ip_summed to CHECKSUM_NONE.
2830 unsigned char *skb_pull_rcsum(struct sk_buff *skb, unsigned int len)
2832 BUG_ON(len > skb->len);
2834 BUG_ON(skb->len < skb->data_len);
2835 skb_postpull_rcsum(skb, skb->data, len);
2836 return skb->data += len;
2838 EXPORT_SYMBOL_GPL(skb_pull_rcsum);
2841 * skb_segment - Perform protocol segmentation on skb.
2842 * @skb: buffer to segment
2843 * @features: features for the output path (see dev->features)
2845 * This function performs segmentation on the given skb. It returns
2846 * a pointer to the first in a list of new skbs for the segments.
2847 * In case of error it returns ERR_PTR(err).
2849 struct sk_buff *skb_segment(struct sk_buff *skb, netdev_features_t features)
2851 struct sk_buff *segs = NULL;
2852 struct sk_buff *tail = NULL;
2853 struct sk_buff *fskb = skb_shinfo(skb)->frag_list;
2854 skb_frag_t *skb_frag = skb_shinfo(skb)->frags;
2855 unsigned int mss = skb_shinfo(skb)->gso_size;
2856 unsigned int doffset = skb->data - skb_mac_header(skb);
2857 unsigned int offset = doffset;
2858 unsigned int tnl_hlen = skb_tnl_header_len(skb);
2859 unsigned int headroom;
2863 int sg = !!(features & NETIF_F_SG);
2864 int nfrags = skb_shinfo(skb)->nr_frags;
2869 proto = skb_network_protocol(skb);
2870 if (unlikely(!proto))
2871 return ERR_PTR(-EINVAL);
2873 csum = !!can_checksum_protocol(features, proto);
2874 __skb_push(skb, doffset);
2875 headroom = skb_headroom(skb);
2876 pos = skb_headlen(skb);
2879 struct sk_buff *nskb;
2884 len = skb->len - offset;
2888 hsize = skb_headlen(skb) - offset;
2891 if (hsize > len || !sg)
2894 if (!hsize && i >= nfrags && skb_headlen(fskb) &&
2895 (skb_headlen(fskb) == len || sg)) {
2896 BUG_ON(skb_headlen(fskb) > len);
2899 nfrags = skb_shinfo(fskb)->nr_frags;
2900 skb_frag = skb_shinfo(fskb)->frags;
2901 pos += skb_headlen(fskb);
2903 while (pos < offset + len) {
2904 BUG_ON(i >= nfrags);
2906 size = skb_frag_size(skb_frag);
2907 if (pos + size > offset + len)
2915 nskb = skb_clone(fskb, GFP_ATOMIC);
2918 if (unlikely(!nskb))
2921 if (unlikely(pskb_trim(nskb, len))) {
2926 hsize = skb_end_offset(nskb);
2927 if (skb_cow_head(nskb, doffset + headroom)) {
2932 nskb->truesize += skb_end_offset(nskb) - hsize;
2933 skb_release_head_state(nskb);
2934 __skb_push(nskb, doffset);
2936 nskb = __alloc_skb(hsize + doffset + headroom,
2937 GFP_ATOMIC, skb_alloc_rx_flag(skb),
2940 if (unlikely(!nskb))
2943 skb_reserve(nskb, headroom);
2944 __skb_put(nskb, doffset);
2953 __copy_skb_header(nskb, skb);
2954 nskb->mac_len = skb->mac_len;
2956 skb_headers_offset_update(nskb, skb_headroom(nskb) - headroom);
2958 skb_copy_from_linear_data_offset(skb, -tnl_hlen,
2959 nskb->data - tnl_hlen,
2960 doffset + tnl_hlen);
2962 if (nskb->len == len + doffset)
2963 goto perform_csum_check;
2966 nskb->ip_summed = CHECKSUM_NONE;
2967 nskb->csum = skb_copy_and_csum_bits(skb, offset,
2973 frag = skb_shinfo(nskb)->frags;
2975 skb_copy_from_linear_data_offset(skb, offset,
2976 skb_put(nskb, hsize), hsize);
2978 skb_shinfo(nskb)->tx_flags = skb_shinfo(skb)->tx_flags & SKBTX_SHARED_FRAG;
2980 while (pos < offset + len) {
2982 BUG_ON(skb_headlen(fskb));
2985 nfrags = skb_shinfo(fskb)->nr_frags;
2986 skb_frag = skb_shinfo(fskb)->frags;
2993 if (unlikely(skb_shinfo(nskb)->nr_frags >=
2995 net_warn_ratelimited(
2996 "skb_segment: too many frags: %u %u\n",
3002 __skb_frag_ref(frag);
3003 size = skb_frag_size(frag);
3006 frag->page_offset += offset - pos;
3007 skb_frag_size_sub(frag, offset - pos);
3010 skb_shinfo(nskb)->nr_frags++;
3012 if (pos + size <= offset + len) {
3017 skb_frag_size_sub(frag, pos + size - (offset + len));
3025 nskb->data_len = len - hsize;
3026 nskb->len += nskb->data_len;
3027 nskb->truesize += nskb->data_len;
3031 nskb->csum = skb_checksum(nskb, doffset,
3032 nskb->len - doffset, 0);
3033 nskb->ip_summed = CHECKSUM_NONE;
3035 } while ((offset += len) < skb->len);
3040 kfree_skb_list(segs);
3041 return ERR_PTR(err);
3043 EXPORT_SYMBOL_GPL(skb_segment);
3045 int skb_gro_receive(struct sk_buff **head, struct sk_buff *skb)
3047 struct skb_shared_info *pinfo, *skbinfo = skb_shinfo(skb);
3048 unsigned int offset = skb_gro_offset(skb);
3049 unsigned int headlen = skb_headlen(skb);
3050 struct sk_buff *nskb, *lp, *p = *head;
3051 unsigned int len = skb_gro_len(skb);
3052 unsigned int delta_truesize;
3053 unsigned int headroom;
3055 if (unlikely(p->len + len >= 65536))
3058 lp = NAPI_GRO_CB(p)->last ?: p;
3059 pinfo = skb_shinfo(lp);
3061 if (headlen <= offset) {
3064 int i = skbinfo->nr_frags;
3065 int nr_frags = pinfo->nr_frags + i;
3067 if (nr_frags > MAX_SKB_FRAGS)
3071 pinfo->nr_frags = nr_frags;
3072 skbinfo->nr_frags = 0;
3074 frag = pinfo->frags + nr_frags;
3075 frag2 = skbinfo->frags + i;
3080 frag->page_offset += offset;
3081 skb_frag_size_sub(frag, offset);
3083 /* all fragments truesize : remove (head size + sk_buff) */
3084 delta_truesize = skb->truesize -
3085 SKB_TRUESIZE(skb_end_offset(skb));
3087 skb->truesize -= skb->data_len;
3088 skb->len -= skb->data_len;
3091 NAPI_GRO_CB(skb)->free = NAPI_GRO_FREE;
3093 } else if (skb->head_frag) {
3094 int nr_frags = pinfo->nr_frags;
3095 skb_frag_t *frag = pinfo->frags + nr_frags;
3096 struct page *page = virt_to_head_page(skb->head);
3097 unsigned int first_size = headlen - offset;
3098 unsigned int first_offset;
3100 if (nr_frags + 1 + skbinfo->nr_frags > MAX_SKB_FRAGS)
3103 first_offset = skb->data -
3104 (unsigned char *)page_address(page) +
3107 pinfo->nr_frags = nr_frags + 1 + skbinfo->nr_frags;
3109 frag->page.p = page;
3110 frag->page_offset = first_offset;
3111 skb_frag_size_set(frag, first_size);
3113 memcpy(frag + 1, skbinfo->frags, sizeof(*frag) * skbinfo->nr_frags);
3114 /* We dont need to clear skbinfo->nr_frags here */
3116 delta_truesize = skb->truesize - SKB_DATA_ALIGN(sizeof(struct sk_buff));
3117 NAPI_GRO_CB(skb)->free = NAPI_GRO_FREE_STOLEN_HEAD;
3120 if (pinfo->frag_list)
3122 if (skb_gro_len(p) != pinfo->gso_size)
3125 headroom = skb_headroom(p);
3126 nskb = alloc_skb(headroom + skb_gro_offset(p), GFP_ATOMIC);
3127 if (unlikely(!nskb))
3130 __copy_skb_header(nskb, p);
3131 nskb->mac_len = p->mac_len;
3133 skb_reserve(nskb, headroom);
3134 __skb_put(nskb, skb_gro_offset(p));
3136 skb_set_mac_header(nskb, skb_mac_header(p) - p->data);
3137 skb_set_network_header(nskb, skb_network_offset(p));
3138 skb_set_transport_header(nskb, skb_transport_offset(p));
3140 __skb_pull(p, skb_gro_offset(p));
3141 memcpy(skb_mac_header(nskb), skb_mac_header(p),
3142 p->data - skb_mac_header(p));
3144 skb_shinfo(nskb)->frag_list = p;
3145 skb_shinfo(nskb)->gso_size = pinfo->gso_size;
3146 pinfo->gso_size = 0;
3147 skb_header_release(p);
3148 NAPI_GRO_CB(nskb)->last = p;
3150 nskb->data_len += p->len;
3151 nskb->truesize += p->truesize;
3152 nskb->len += p->len;
3155 nskb->next = p->next;
3161 delta_truesize = skb->truesize;
3162 if (offset > headlen) {
3163 unsigned int eat = offset - headlen;
3165 skbinfo->frags[0].page_offset += eat;
3166 skb_frag_size_sub(&skbinfo->frags[0], eat);
3167 skb->data_len -= eat;
3172 __skb_pull(skb, offset);
3174 if (!NAPI_GRO_CB(p)->last)
3175 skb_shinfo(p)->frag_list = skb;
3177 NAPI_GRO_CB(p)->last->next = skb;
3178 NAPI_GRO_CB(p)->last = skb;
3179 skb_header_release(skb);
3183 NAPI_GRO_CB(p)->count++;
3185 p->truesize += delta_truesize;
3188 lp->data_len += len;
3189 lp->truesize += delta_truesize;
3192 NAPI_GRO_CB(skb)->same_flow = 1;
3195 EXPORT_SYMBOL_GPL(skb_gro_receive);
3197 void __init skb_init(void)
3199 skbuff_head_cache = kmem_cache_create("skbuff_head_cache",
3200 sizeof(struct sk_buff),
3202 SLAB_HWCACHE_ALIGN|SLAB_PANIC,
3204 skbuff_fclone_cache = kmem_cache_create("skbuff_fclone_cache",
3205 (2*sizeof(struct sk_buff)) +
3208 SLAB_HWCACHE_ALIGN|SLAB_PANIC,
3213 * skb_to_sgvec - Fill a scatter-gather list from a socket buffer
3214 * @skb: Socket buffer containing the buffers to be mapped
3215 * @sg: The scatter-gather list to map into
3216 * @offset: The offset into the buffer's contents to start mapping
3217 * @len: Length of buffer space to be mapped
3219 * Fill the specified scatter-gather list with mappings/pointers into a
3220 * region of the buffer space attached to a socket buffer.
3223 __skb_to_sgvec(struct sk_buff *skb, struct scatterlist *sg, int offset, int len)
3225 int start = skb_headlen(skb);
3226 int i, copy = start - offset;
3227 struct sk_buff *frag_iter;
3233 sg_set_buf(sg, skb->data + offset, copy);
3235 if ((len -= copy) == 0)
3240 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
3243 WARN_ON(start > offset + len);
3245 end = start + skb_frag_size(&skb_shinfo(skb)->frags[i]);
3246 if ((copy = end - offset) > 0) {
3247 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
3251 sg_set_page(&sg[elt], skb_frag_page(frag), copy,
3252 frag->page_offset+offset-start);
3261 skb_walk_frags(skb, frag_iter) {
3264 WARN_ON(start > offset + len);
3266 end = start + frag_iter->len;
3267 if ((copy = end - offset) > 0) {
3270 elt += __skb_to_sgvec(frag_iter, sg+elt, offset - start,
3272 if ((len -= copy) == 0)
3282 int skb_to_sgvec(struct sk_buff *skb, struct scatterlist *sg, int offset, int len)
3284 int nsg = __skb_to_sgvec(skb, sg, offset, len);
3286 sg_mark_end(&sg[nsg - 1]);
3290 EXPORT_SYMBOL_GPL(skb_to_sgvec);
3293 * skb_cow_data - Check that a socket buffer's data buffers are writable
3294 * @skb: The socket buffer to check.
3295 * @tailbits: Amount of trailing space to be added
3296 * @trailer: Returned pointer to the skb where the @tailbits space begins
3298 * Make sure that the data buffers attached to a socket buffer are
3299 * writable. If they are not, private copies are made of the data buffers
3300 * and the socket buffer is set to use these instead.
3302 * If @tailbits is given, make sure that there is space to write @tailbits
3303 * bytes of data beyond current end of socket buffer. @trailer will be
3304 * set to point to the skb in which this space begins.
3306 * The number of scatterlist elements required to completely map the
3307 * COW'd and extended socket buffer will be returned.
3309 int skb_cow_data(struct sk_buff *skb, int tailbits, struct sk_buff **trailer)
3313 struct sk_buff *skb1, **skb_p;
3315 /* If skb is cloned or its head is paged, reallocate
3316 * head pulling out all the pages (pages are considered not writable
3317 * at the moment even if they are anonymous).
3319 if ((skb_cloned(skb) || skb_shinfo(skb)->nr_frags) &&
3320 __pskb_pull_tail(skb, skb_pagelen(skb)-skb_headlen(skb)) == NULL)
3323 /* Easy case. Most of packets will go this way. */
3324 if (!skb_has_frag_list(skb)) {
3325 /* A little of trouble, not enough of space for trailer.
3326 * This should not happen, when stack is tuned to generate
3327 * good frames. OK, on miss we reallocate and reserve even more
3328 * space, 128 bytes is fair. */
3330 if (skb_tailroom(skb) < tailbits &&
3331 pskb_expand_head(skb, 0, tailbits-skb_tailroom(skb)+128, GFP_ATOMIC))
3339 /* Misery. We are in troubles, going to mincer fragments... */
3342 skb_p = &skb_shinfo(skb)->frag_list;
3345 while ((skb1 = *skb_p) != NULL) {
3348 /* The fragment is partially pulled by someone,
3349 * this can happen on input. Copy it and everything
3352 if (skb_shared(skb1))
3355 /* If the skb is the last, worry about trailer. */
3357 if (skb1->next == NULL && tailbits) {
3358 if (skb_shinfo(skb1)->nr_frags ||
3359 skb_has_frag_list(skb1) ||
3360 skb_tailroom(skb1) < tailbits)
3361 ntail = tailbits + 128;
3367 skb_shinfo(skb1)->nr_frags ||
3368 skb_has_frag_list(skb1)) {
3369 struct sk_buff *skb2;
3371 /* Fuck, we are miserable poor guys... */
3373 skb2 = skb_copy(skb1, GFP_ATOMIC);
3375 skb2 = skb_copy_expand(skb1,
3379 if (unlikely(skb2 == NULL))
3383 skb_set_owner_w(skb2, skb1->sk);
3385 /* Looking around. Are we still alive?
3386 * OK, link new skb, drop old one */
3388 skb2->next = skb1->next;
3395 skb_p = &skb1->next;
3400 EXPORT_SYMBOL_GPL(skb_cow_data);
3402 static void sock_rmem_free(struct sk_buff *skb)
3404 struct sock *sk = skb->sk;
3406 atomic_sub(skb->truesize, &sk->sk_rmem_alloc);
3410 * Note: We dont mem charge error packets (no sk_forward_alloc changes)
3412 int sock_queue_err_skb(struct sock *sk, struct sk_buff *skb)
3416 if (atomic_read(&sk->sk_rmem_alloc) + skb->truesize >=
3417 (unsigned int)sk->sk_rcvbuf)
3422 skb->destructor = sock_rmem_free;
3423 atomic_add(skb->truesize, &sk->sk_rmem_alloc);
3425 /* before exiting rcu section, make sure dst is refcounted */
3428 skb_queue_tail(&sk->sk_error_queue, skb);
3429 if (!sock_flag(sk, SOCK_DEAD))
3430 sk->sk_data_ready(sk, len);
3433 EXPORT_SYMBOL(sock_queue_err_skb);
3435 void skb_tstamp_tx(struct sk_buff *orig_skb,
3436 struct skb_shared_hwtstamps *hwtstamps)
3438 struct sock *sk = orig_skb->sk;
3439 struct sock_exterr_skb *serr;
3440 struct sk_buff *skb;
3447 *skb_hwtstamps(orig_skb) =
3451 * no hardware time stamps available,
3452 * so keep the shared tx_flags and only
3453 * store software time stamp
3455 orig_skb->tstamp = ktime_get_real();
3458 skb = skb_clone(orig_skb, GFP_ATOMIC);
3462 serr = SKB_EXT_ERR(skb);
3463 memset(serr, 0, sizeof(*serr));
3464 serr->ee.ee_errno = ENOMSG;
3465 serr->ee.ee_origin = SO_EE_ORIGIN_TIMESTAMPING;
3467 err = sock_queue_err_skb(sk, skb);
3472 EXPORT_SYMBOL_GPL(skb_tstamp_tx);
3474 void skb_complete_wifi_ack(struct sk_buff *skb, bool acked)
3476 struct sock *sk = skb->sk;
3477 struct sock_exterr_skb *serr;
3480 skb->wifi_acked_valid = 1;
3481 skb->wifi_acked = acked;
3483 serr = SKB_EXT_ERR(skb);
3484 memset(serr, 0, sizeof(*serr));
3485 serr->ee.ee_errno = ENOMSG;
3486 serr->ee.ee_origin = SO_EE_ORIGIN_TXSTATUS;
3488 err = sock_queue_err_skb(sk, skb);
3492 EXPORT_SYMBOL_GPL(skb_complete_wifi_ack);
3496 * skb_partial_csum_set - set up and verify partial csum values for packet
3497 * @skb: the skb to set
3498 * @start: the number of bytes after skb->data to start checksumming.
3499 * @off: the offset from start to place the checksum.
3501 * For untrusted partially-checksummed packets, we need to make sure the values
3502 * for skb->csum_start and skb->csum_offset are valid so we don't oops.
3504 * This function checks and sets those values and skb->ip_summed: if this
3505 * returns false you should drop the packet.
3507 bool skb_partial_csum_set(struct sk_buff *skb, u16 start, u16 off)
3509 if (unlikely(start > skb_headlen(skb)) ||
3510 unlikely((int)start + off > skb_headlen(skb) - 2)) {
3511 net_warn_ratelimited("bad partial csum: csum=%u/%u len=%u\n",
3512 start, off, skb_headlen(skb));
3515 skb->ip_summed = CHECKSUM_PARTIAL;
3516 skb->csum_start = skb_headroom(skb) + start;
3517 skb->csum_offset = off;
3518 skb_set_transport_header(skb, start);
3521 EXPORT_SYMBOL_GPL(skb_partial_csum_set);
3523 static int skb_maybe_pull_tail(struct sk_buff *skb, unsigned int len,
3526 if (skb_headlen(skb) >= len)
3529 /* If we need to pullup then pullup to the max, so we
3530 * won't need to do it again.
3535 if (__pskb_pull_tail(skb, max - skb_headlen(skb)) == NULL)
3538 if (skb_headlen(skb) < len)
3544 /* This value should be large enough to cover a tagged ethernet header plus
3545 * maximally sized IP and TCP or UDP headers.
3547 #define MAX_IP_HDR_LEN 128
3549 static int skb_checksum_setup_ip(struct sk_buff *skb, bool recalculate)
3557 err = skb_maybe_pull_tail(skb,
3558 sizeof(struct iphdr),
3563 if (ip_hdr(skb)->frag_off & htons(IP_OFFSET | IP_MF))
3566 off = ip_hdrlen(skb);
3573 switch (ip_hdr(skb)->protocol) {
3575 err = skb_maybe_pull_tail(skb,
3576 off + sizeof(struct tcphdr),
3581 if (!skb_partial_csum_set(skb, off,
3582 offsetof(struct tcphdr, check))) {
3588 tcp_hdr(skb)->check =
3589 ~csum_tcpudp_magic(ip_hdr(skb)->saddr,
3595 err = skb_maybe_pull_tail(skb,
3596 off + sizeof(struct udphdr),
3601 if (!skb_partial_csum_set(skb, off,
3602 offsetof(struct udphdr, check))) {
3608 udp_hdr(skb)->check =
3609 ~csum_tcpudp_magic(ip_hdr(skb)->saddr,
3624 /* This value should be large enough to cover a tagged ethernet header plus
3625 * an IPv6 header, all options, and a maximal TCP or UDP header.
3627 #define MAX_IPV6_HDR_LEN 256
3629 #define OPT_HDR(type, skb, off) \
3630 (type *)(skb_network_header(skb) + (off))
3632 static int skb_checksum_setup_ipv6(struct sk_buff *skb, bool recalculate)
3644 off = sizeof(struct ipv6hdr);
3646 err = skb_maybe_pull_tail(skb, off, MAX_IPV6_HDR_LEN);
3650 nexthdr = ipv6_hdr(skb)->nexthdr;
3652 len = sizeof(struct ipv6hdr) + ntohs(ipv6_hdr(skb)->payload_len);
3653 while (off <= len && !done) {
3655 case IPPROTO_DSTOPTS:
3656 case IPPROTO_HOPOPTS:
3657 case IPPROTO_ROUTING: {
3658 struct ipv6_opt_hdr *hp;
3660 err = skb_maybe_pull_tail(skb,
3662 sizeof(struct ipv6_opt_hdr),
3667 hp = OPT_HDR(struct ipv6_opt_hdr, skb, off);
3668 nexthdr = hp->nexthdr;
3669 off += ipv6_optlen(hp);
3673 struct ip_auth_hdr *hp;
3675 err = skb_maybe_pull_tail(skb,
3677 sizeof(struct ip_auth_hdr),
3682 hp = OPT_HDR(struct ip_auth_hdr, skb, off);
3683 nexthdr = hp->nexthdr;
3684 off += ipv6_authlen(hp);
3687 case IPPROTO_FRAGMENT: {
3688 struct frag_hdr *hp;
3690 err = skb_maybe_pull_tail(skb,
3692 sizeof(struct frag_hdr),
3697 hp = OPT_HDR(struct frag_hdr, skb, off);
3699 if (hp->frag_off & htons(IP6_OFFSET | IP6_MF))
3702 nexthdr = hp->nexthdr;
3703 off += sizeof(struct frag_hdr);
3714 if (!done || fragment)
3719 err = skb_maybe_pull_tail(skb,
3720 off + sizeof(struct tcphdr),
3725 if (!skb_partial_csum_set(skb, off,
3726 offsetof(struct tcphdr, check))) {
3732 tcp_hdr(skb)->check =
3733 ~csum_ipv6_magic(&ipv6_hdr(skb)->saddr,
3734 &ipv6_hdr(skb)->daddr,
3739 err = skb_maybe_pull_tail(skb,
3740 off + sizeof(struct udphdr),
3745 if (!skb_partial_csum_set(skb, off,
3746 offsetof(struct udphdr, check))) {
3752 udp_hdr(skb)->check =
3753 ~csum_ipv6_magic(&ipv6_hdr(skb)->saddr,
3754 &ipv6_hdr(skb)->daddr,
3769 * skb_checksum_setup - set up partial checksum offset
3770 * @skb: the skb to set up
3771 * @recalculate: if true the pseudo-header checksum will be recalculated
3773 int skb_checksum_setup(struct sk_buff *skb, bool recalculate)
3777 switch (skb->protocol) {
3778 case htons(ETH_P_IP):
3779 err = skb_checksum_setup_ip(skb, recalculate);
3782 case htons(ETH_P_IPV6):
3783 err = skb_checksum_setup_ipv6(skb, recalculate);
3793 EXPORT_SYMBOL(skb_checksum_setup);
3795 void __skb_warn_lro_forwarding(const struct sk_buff *skb)
3797 net_warn_ratelimited("%s: received packets cannot be forwarded while LRO is enabled\n",
3800 EXPORT_SYMBOL(__skb_warn_lro_forwarding);
3802 void kfree_skb_partial(struct sk_buff *skb, bool head_stolen)
3805 skb_release_head_state(skb);
3806 kmem_cache_free(skbuff_head_cache, skb);
3811 EXPORT_SYMBOL(kfree_skb_partial);
3814 * skb_try_coalesce - try to merge skb to prior one
3816 * @from: buffer to add
3817 * @fragstolen: pointer to boolean
3818 * @delta_truesize: how much more was allocated than was requested
3820 bool skb_try_coalesce(struct sk_buff *to, struct sk_buff *from,
3821 bool *fragstolen, int *delta_truesize)
3823 int i, delta, len = from->len;
3825 *fragstolen = false;
3830 if (len <= skb_tailroom(to)) {
3831 BUG_ON(skb_copy_bits(from, 0, skb_put(to, len), len));
3832 *delta_truesize = 0;
3836 if (skb_has_frag_list(to) || skb_has_frag_list(from))
3839 if (skb_headlen(from) != 0) {
3841 unsigned int offset;
3843 if (skb_shinfo(to)->nr_frags +
3844 skb_shinfo(from)->nr_frags >= MAX_SKB_FRAGS)
3847 if (skb_head_is_locked(from))
3850 delta = from->truesize - SKB_DATA_ALIGN(sizeof(struct sk_buff));
3852 page = virt_to_head_page(from->head);
3853 offset = from->data - (unsigned char *)page_address(page);
3855 skb_fill_page_desc(to, skb_shinfo(to)->nr_frags,
3856 page, offset, skb_headlen(from));
3859 if (skb_shinfo(to)->nr_frags +
3860 skb_shinfo(from)->nr_frags > MAX_SKB_FRAGS)
3863 delta = from->truesize - SKB_TRUESIZE(skb_end_offset(from));
3866 WARN_ON_ONCE(delta < len);
3868 memcpy(skb_shinfo(to)->frags + skb_shinfo(to)->nr_frags,
3869 skb_shinfo(from)->frags,
3870 skb_shinfo(from)->nr_frags * sizeof(skb_frag_t));
3871 skb_shinfo(to)->nr_frags += skb_shinfo(from)->nr_frags;
3873 if (!skb_cloned(from))
3874 skb_shinfo(from)->nr_frags = 0;
3876 /* if the skb is not cloned this does nothing
3877 * since we set nr_frags to 0.
3879 for (i = 0; i < skb_shinfo(from)->nr_frags; i++)
3880 skb_frag_ref(from, i);
3882 to->truesize += delta;
3884 to->data_len += len;
3886 *delta_truesize = delta;
3889 EXPORT_SYMBOL(skb_try_coalesce);
3892 * skb_scrub_packet - scrub an skb
3894 * @skb: buffer to clean
3895 * @xnet: packet is crossing netns
3897 * skb_scrub_packet can be used after encapsulating or decapsulting a packet
3898 * into/from a tunnel. Some information have to be cleared during these
3900 * skb_scrub_packet can also be used to clean a skb before injecting it in
3901 * another namespace (@xnet == true). We have to clear all information in the
3902 * skb that could impact namespace isolation.
3904 void skb_scrub_packet(struct sk_buff *skb, bool xnet)
3908 skb->tstamp.tv64 = 0;
3909 skb->pkt_type = PACKET_HOST;
3916 nf_reset_trace(skb);
3918 EXPORT_SYMBOL_GPL(skb_scrub_packet);