2 * Routines having to do with the 'struct sk_buff' memory handlers.
4 * Authors: Alan Cox <iiitac@pyr.swan.ac.uk>
5 * Florian La Roche <rzsfl@rz.uni-sb.de>
7 * Version: $Id: skbuff.c,v 1.90 2001/11/07 05:56:19 davem Exp $
10 * Alan Cox : Fixed the worst of the load
12 * Dave Platt : Interrupt stacking fix.
13 * Richard Kooijman : Timestamp fixes.
14 * Alan Cox : Changed buffer format.
15 * Alan Cox : destructor hook for AF_UNIX etc.
16 * Linus Torvalds : Better skb_clone.
17 * Alan Cox : Added skb_copy.
18 * Alan Cox : Added all the changed routines Linus
19 * only put in the headers
20 * Ray VanTassle : Fixed --skb->lock in free
21 * Alan Cox : skb_copy copy arp field
22 * Andi Kleen : slabified it.
23 * Robert Olsson : Removed skb_head_pool
26 * The __skb_ routines should be called with interrupts
27 * disabled, or you better be *real* sure that the operation is atomic
28 * with respect to whatever list is being frobbed (e.g. via lock_sock()
29 * or via disabling bottom half handlers, etc).
31 * This program is free software; you can redistribute it and/or
32 * modify it under the terms of the GNU General Public License
33 * as published by the Free Software Foundation; either version
34 * 2 of the License, or (at your option) any later version.
38 * The functions in this file will not compile correctly with gcc 2.4.x
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/netdevice.h>
50 #ifdef CONFIG_NET_CLS_ACT
51 #include <net/pkt_sched.h>
53 #include <linux/string.h>
54 #include <linux/skbuff.h>
55 #include <linux/cache.h>
56 #include <linux/rtnetlink.h>
57 #include <linux/init.h>
58 #include <linux/scatterlist.h>
60 #include <net/protocol.h>
63 #include <net/checksum.h>
66 #include <asm/uaccess.h>
67 #include <asm/system.h>
71 static struct kmem_cache *skbuff_head_cache __read_mostly;
72 static struct kmem_cache *skbuff_fclone_cache __read_mostly;
75 * Keep out-of-line to prevent kernel bloat.
76 * __builtin_return_address is not used because it is not always
81 * skb_over_panic - private function
86 * Out of line support code for skb_put(). Not user callable.
88 void skb_over_panic(struct sk_buff *skb, int sz, void *here)
90 printk(KERN_EMERG "skb_over_panic: text:%p len:%d put:%d head:%p "
91 "data:%p tail:%#lx end:%#lx dev:%s\n",
92 here, skb->len, sz, skb->head, skb->data,
93 (unsigned long)skb->tail, (unsigned long)skb->end,
94 skb->dev ? skb->dev->name : "<NULL>");
99 * skb_under_panic - private function
104 * Out of line support code for skb_push(). Not user callable.
107 void skb_under_panic(struct sk_buff *skb, int sz, void *here)
109 printk(KERN_EMERG "skb_under_panic: text:%p len:%d put:%d head:%p "
110 "data:%p tail:%#lx end:%#lx dev:%s\n",
111 here, skb->len, sz, skb->head, skb->data,
112 (unsigned long)skb->tail, (unsigned long)skb->end,
113 skb->dev ? skb->dev->name : "<NULL>");
117 void skb_truesize_bug(struct sk_buff *skb)
119 printk(KERN_ERR "SKB BUG: Invalid truesize (%u) "
120 "len=%u, sizeof(sk_buff)=%Zd\n",
121 skb->truesize, skb->len, sizeof(struct sk_buff));
123 EXPORT_SYMBOL(skb_truesize_bug);
125 /* Allocate a new skbuff. We do this ourselves so we can fill in a few
126 * 'private' fields and also do memory statistics to find all the
132 * __alloc_skb - allocate a network buffer
133 * @size: size to allocate
134 * @gfp_mask: allocation mask
135 * @fclone: allocate from fclone cache instead of head cache
136 * and allocate a cloned (child) skb
137 * @node: numa node to allocate memory on
139 * Allocate a new &sk_buff. The returned buffer has no headroom and a
140 * tail room of size bytes. The object has a reference count of one.
141 * The return is the buffer. On a failure the return is %NULL.
143 * Buffers may only be allocated from interrupts using a @gfp_mask of
146 struct sk_buff *__alloc_skb(unsigned int size, gfp_t gfp_mask,
147 int fclone, int node)
149 struct kmem_cache *cache;
150 struct skb_shared_info *shinfo;
154 cache = fclone ? skbuff_fclone_cache : skbuff_head_cache;
157 skb = kmem_cache_alloc_node(cache, gfp_mask & ~__GFP_DMA, node);
161 size = SKB_DATA_ALIGN(size);
162 data = kmalloc_node_track_caller(size + sizeof(struct skb_shared_info),
168 * See comment in sk_buff definition, just before the 'tail' member
170 memset(skb, 0, offsetof(struct sk_buff, tail));
171 skb->truesize = size + sizeof(struct sk_buff);
172 atomic_set(&skb->users, 1);
175 skb_reset_tail_pointer(skb);
176 skb->end = skb->tail + size;
177 /* make sure we initialize shinfo sequentially */
178 shinfo = skb_shinfo(skb);
179 atomic_set(&shinfo->dataref, 1);
180 shinfo->nr_frags = 0;
181 shinfo->gso_size = 0;
182 shinfo->gso_segs = 0;
183 shinfo->gso_type = 0;
184 shinfo->ip6_frag_id = 0;
185 shinfo->frag_list = NULL;
188 struct sk_buff *child = skb + 1;
189 atomic_t *fclone_ref = (atomic_t *) (child + 1);
191 skb->fclone = SKB_FCLONE_ORIG;
192 atomic_set(fclone_ref, 1);
194 child->fclone = SKB_FCLONE_UNAVAILABLE;
199 kmem_cache_free(cache, skb);
205 * __netdev_alloc_skb - allocate an skbuff for rx on a specific device
206 * @dev: network device to receive on
207 * @length: length to allocate
208 * @gfp_mask: get_free_pages mask, passed to alloc_skb
210 * Allocate a new &sk_buff and assign it a usage count of one. The
211 * buffer has unspecified headroom built in. Users should allocate
212 * the headroom they think they need without accounting for the
213 * built in space. The built in space is used for optimisations.
215 * %NULL is returned if there is no free memory.
217 struct sk_buff *__netdev_alloc_skb(struct net_device *dev,
218 unsigned int length, gfp_t gfp_mask)
220 int node = dev->dev.parent ? dev_to_node(dev->dev.parent) : -1;
223 skb = __alloc_skb(length + NET_SKB_PAD, gfp_mask, 0, node);
225 skb_reserve(skb, NET_SKB_PAD);
231 static void skb_drop_list(struct sk_buff **listp)
233 struct sk_buff *list = *listp;
238 struct sk_buff *this = list;
244 static inline void skb_drop_fraglist(struct sk_buff *skb)
246 skb_drop_list(&skb_shinfo(skb)->frag_list);
249 static void skb_clone_fraglist(struct sk_buff *skb)
251 struct sk_buff *list;
253 for (list = skb_shinfo(skb)->frag_list; list; list = list->next)
257 static void skb_release_data(struct sk_buff *skb)
260 !atomic_sub_return(skb->nohdr ? (1 << SKB_DATAREF_SHIFT) + 1 : 1,
261 &skb_shinfo(skb)->dataref)) {
262 if (skb_shinfo(skb)->nr_frags) {
264 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++)
265 put_page(skb_shinfo(skb)->frags[i].page);
268 if (skb_shinfo(skb)->frag_list)
269 skb_drop_fraglist(skb);
276 * Free an skbuff by memory without cleaning the state.
278 void kfree_skbmem(struct sk_buff *skb)
280 struct sk_buff *other;
281 atomic_t *fclone_ref;
283 skb_release_data(skb);
284 switch (skb->fclone) {
285 case SKB_FCLONE_UNAVAILABLE:
286 kmem_cache_free(skbuff_head_cache, skb);
289 case SKB_FCLONE_ORIG:
290 fclone_ref = (atomic_t *) (skb + 2);
291 if (atomic_dec_and_test(fclone_ref))
292 kmem_cache_free(skbuff_fclone_cache, skb);
295 case SKB_FCLONE_CLONE:
296 fclone_ref = (atomic_t *) (skb + 1);
299 /* The clone portion is available for
300 * fast-cloning again.
302 skb->fclone = SKB_FCLONE_UNAVAILABLE;
304 if (atomic_dec_and_test(fclone_ref))
305 kmem_cache_free(skbuff_fclone_cache, other);
311 * __kfree_skb - private function
314 * Free an sk_buff. Release anything attached to the buffer.
315 * Clean the state. This is an internal helper function. Users should
316 * always call kfree_skb
319 void __kfree_skb(struct sk_buff *skb)
321 dst_release(skb->dst);
323 secpath_put(skb->sp);
325 if (skb->destructor) {
327 skb->destructor(skb);
329 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
330 nf_conntrack_put(skb->nfct);
331 nf_conntrack_put_reasm(skb->nfct_reasm);
333 #ifdef CONFIG_BRIDGE_NETFILTER
334 nf_bridge_put(skb->nf_bridge);
336 /* XXX: IS this still necessary? - JHS */
337 #ifdef CONFIG_NET_SCHED
339 #ifdef CONFIG_NET_CLS_ACT
348 * kfree_skb - free an sk_buff
349 * @skb: buffer to free
351 * Drop a reference to the buffer and free it if the usage count has
354 void kfree_skb(struct sk_buff *skb)
358 if (likely(atomic_read(&skb->users) == 1))
360 else if (likely(!atomic_dec_and_test(&skb->users)))
366 * skb_clone - duplicate an sk_buff
367 * @skb: buffer to clone
368 * @gfp_mask: allocation priority
370 * Duplicate an &sk_buff. The new one is not owned by a socket. Both
371 * copies share the same packet data but not structure. The new
372 * buffer has a reference count of 1. If the allocation fails the
373 * function returns %NULL otherwise the new buffer is returned.
375 * If this function is called from an interrupt gfp_mask() must be
379 struct sk_buff *skb_clone(struct sk_buff *skb, gfp_t gfp_mask)
384 if (skb->fclone == SKB_FCLONE_ORIG &&
385 n->fclone == SKB_FCLONE_UNAVAILABLE) {
386 atomic_t *fclone_ref = (atomic_t *) (n + 1);
387 n->fclone = SKB_FCLONE_CLONE;
388 atomic_inc(fclone_ref);
390 n = kmem_cache_alloc(skbuff_head_cache, gfp_mask);
393 n->fclone = SKB_FCLONE_UNAVAILABLE;
396 #define C(x) n->x = skb->x
398 n->next = n->prev = NULL;
409 secpath_get(skb->sp);
411 memcpy(n->cb, skb->cb, sizeof(skb->cb));
422 #if defined(CONFIG_IP_VS) || defined(CONFIG_IP_VS_MODULE)
426 n->destructor = NULL;
429 #ifdef CONFIG_NET_SCHED
431 #ifdef CONFIG_NET_CLS_ACT
432 n->tc_verd = SET_TC_VERD(skb->tc_verd,0);
433 n->tc_verd = CLR_TC_OK2MUNGE(n->tc_verd);
434 n->tc_verd = CLR_TC_MUNGED(n->tc_verd);
437 skb_copy_secmark(n, skb);
440 atomic_set(&n->users, 1);
446 atomic_inc(&(skb_shinfo(skb)->dataref));
452 static void copy_skb_header(struct sk_buff *new, const struct sk_buff *old)
454 #ifndef NET_SKBUFF_DATA_USES_OFFSET
456 * Shift between the two data areas in bytes
458 unsigned long offset = new->data - old->data;
462 new->priority = old->priority;
463 new->protocol = old->protocol;
464 new->dst = dst_clone(old->dst);
466 new->sp = secpath_get(old->sp);
468 new->transport_header = old->transport_header;
469 new->network_header = old->network_header;
470 new->mac_header = old->mac_header;
471 #ifndef NET_SKBUFF_DATA_USES_OFFSET
472 /* {transport,network,mac}_header are relative to skb->head */
473 new->transport_header += offset;
474 new->network_header += offset;
475 new->mac_header += offset;
477 memcpy(new->cb, old->cb, sizeof(old->cb));
478 new->local_df = old->local_df;
479 new->fclone = SKB_FCLONE_UNAVAILABLE;
480 new->pkt_type = old->pkt_type;
481 new->tstamp = old->tstamp;
482 new->destructor = NULL;
483 new->mark = old->mark;
485 #if defined(CONFIG_IP_VS) || defined(CONFIG_IP_VS_MODULE)
486 new->ipvs_property = old->ipvs_property;
488 #ifdef CONFIG_NET_SCHED
489 #ifdef CONFIG_NET_CLS_ACT
490 new->tc_verd = old->tc_verd;
492 new->tc_index = old->tc_index;
494 skb_copy_secmark(new, old);
495 atomic_set(&new->users, 1);
496 skb_shinfo(new)->gso_size = skb_shinfo(old)->gso_size;
497 skb_shinfo(new)->gso_segs = skb_shinfo(old)->gso_segs;
498 skb_shinfo(new)->gso_type = skb_shinfo(old)->gso_type;
502 * skb_copy - create private copy of an sk_buff
503 * @skb: buffer to copy
504 * @gfp_mask: allocation priority
506 * Make a copy of both an &sk_buff and its data. This is used when the
507 * caller wishes to modify the data and needs a private copy of the
508 * data to alter. Returns %NULL on failure or the pointer to the buffer
509 * on success. The returned buffer has a reference count of 1.
511 * As by-product this function converts non-linear &sk_buff to linear
512 * one, so that &sk_buff becomes completely private and caller is allowed
513 * to modify all the data of returned buffer. This means that this
514 * function is not recommended for use in circumstances when only
515 * header is going to be modified. Use pskb_copy() instead.
518 struct sk_buff *skb_copy(const struct sk_buff *skb, gfp_t gfp_mask)
520 int headerlen = skb->data - skb->head;
522 * Allocate the copy buffer
525 #ifdef NET_SKBUFF_DATA_USES_OFFSET
526 n = alloc_skb(skb->end + skb->data_len, gfp_mask);
528 n = alloc_skb(skb->end - skb->head + skb->data_len, gfp_mask);
533 /* Set the data pointer */
534 skb_reserve(n, headerlen);
535 /* Set the tail pointer and length */
536 skb_put(n, skb->len);
538 n->ip_summed = skb->ip_summed;
540 if (skb_copy_bits(skb, -headerlen, n->head, headerlen + skb->len))
543 copy_skb_header(n, skb);
549 * pskb_copy - create copy of an sk_buff with private head.
550 * @skb: buffer to copy
551 * @gfp_mask: allocation priority
553 * Make a copy of both an &sk_buff and part of its data, located
554 * in header. Fragmented data remain shared. This is used when
555 * the caller wishes to modify only header of &sk_buff and needs
556 * private copy of the header to alter. Returns %NULL on failure
557 * or the pointer to the buffer on success.
558 * The returned buffer has a reference count of 1.
561 struct sk_buff *pskb_copy(struct sk_buff *skb, gfp_t gfp_mask)
564 * Allocate the copy buffer
567 #ifdef NET_SKBUFF_DATA_USES_OFFSET
568 n = alloc_skb(skb->end, gfp_mask);
570 n = alloc_skb(skb->end - skb->head, gfp_mask);
575 /* Set the data pointer */
576 skb_reserve(n, skb->data - skb->head);
577 /* Set the tail pointer and length */
578 skb_put(n, skb_headlen(skb));
580 skb_copy_from_linear_data(skb, n->data, n->len);
582 n->ip_summed = skb->ip_summed;
584 n->truesize += skb->data_len;
585 n->data_len = skb->data_len;
588 if (skb_shinfo(skb)->nr_frags) {
591 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
592 skb_shinfo(n)->frags[i] = skb_shinfo(skb)->frags[i];
593 get_page(skb_shinfo(n)->frags[i].page);
595 skb_shinfo(n)->nr_frags = i;
598 if (skb_shinfo(skb)->frag_list) {
599 skb_shinfo(n)->frag_list = skb_shinfo(skb)->frag_list;
600 skb_clone_fraglist(n);
603 copy_skb_header(n, skb);
609 * pskb_expand_head - reallocate header of &sk_buff
610 * @skb: buffer to reallocate
611 * @nhead: room to add at head
612 * @ntail: room to add at tail
613 * @gfp_mask: allocation priority
615 * Expands (or creates identical copy, if &nhead and &ntail are zero)
616 * header of skb. &sk_buff itself is not changed. &sk_buff MUST have
617 * reference count of 1. Returns zero in the case of success or error,
618 * if expansion failed. In the last case, &sk_buff is not changed.
620 * All the pointers pointing into skb header may change and must be
621 * reloaded after call to this function.
624 int pskb_expand_head(struct sk_buff *skb, int nhead, int ntail,
629 #ifdef NET_SKBUFF_DATA_USES_OFFSET
630 int size = nhead + skb->end + ntail;
632 int size = nhead + (skb->end - skb->head) + ntail;
639 size = SKB_DATA_ALIGN(size);
641 data = kmalloc(size + sizeof(struct skb_shared_info), gfp_mask);
645 /* Copy only real data... and, alas, header. This should be
646 * optimized for the cases when header is void. */
647 memcpy(data + nhead, skb->head,
648 #ifdef NET_SKBUFF_DATA_USES_OFFSET
651 skb->tail - skb->head);
653 memcpy(data + size, skb_end_pointer(skb),
654 sizeof(struct skb_shared_info));
656 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++)
657 get_page(skb_shinfo(skb)->frags[i].page);
659 if (skb_shinfo(skb)->frag_list)
660 skb_clone_fraglist(skb);
662 skb_release_data(skb);
664 off = (data + nhead) - skb->head;
668 #ifdef NET_SKBUFF_DATA_USES_OFFSET
671 skb->end = skb->head + size;
672 /* {transport,network,mac}_header and tail are relative to skb->head */
674 skb->transport_header += off;
675 skb->network_header += off;
676 skb->mac_header += off;
680 atomic_set(&skb_shinfo(skb)->dataref, 1);
687 /* Make private copy of skb with writable head and some headroom */
689 struct sk_buff *skb_realloc_headroom(struct sk_buff *skb, unsigned int headroom)
691 struct sk_buff *skb2;
692 int delta = headroom - skb_headroom(skb);
695 skb2 = pskb_copy(skb, GFP_ATOMIC);
697 skb2 = skb_clone(skb, GFP_ATOMIC);
698 if (skb2 && pskb_expand_head(skb2, SKB_DATA_ALIGN(delta), 0,
709 * skb_copy_expand - copy and expand sk_buff
710 * @skb: buffer to copy
711 * @newheadroom: new free bytes at head
712 * @newtailroom: new free bytes at tail
713 * @gfp_mask: allocation priority
715 * Make a copy of both an &sk_buff and its data and while doing so
716 * allocate additional space.
718 * This is used when the caller wishes to modify the data and needs a
719 * private copy of the data to alter as well as more space for new fields.
720 * Returns %NULL on failure or the pointer to the buffer
721 * on success. The returned buffer has a reference count of 1.
723 * You must pass %GFP_ATOMIC as the allocation priority if this function
724 * is called from an interrupt.
726 * BUG ALERT: ip_summed is not copied. Why does this work? Is it used
727 * only by netfilter in the cases when checksum is recalculated? --ANK
729 struct sk_buff *skb_copy_expand(const struct sk_buff *skb,
730 int newheadroom, int newtailroom,
734 * Allocate the copy buffer
736 struct sk_buff *n = alloc_skb(newheadroom + skb->len + newtailroom,
738 int head_copy_len, head_copy_off;
743 skb_reserve(n, newheadroom);
745 /* Set the tail pointer and length */
746 skb_put(n, skb->len);
748 head_copy_len = skb_headroom(skb);
750 if (newheadroom <= head_copy_len)
751 head_copy_len = newheadroom;
753 head_copy_off = newheadroom - head_copy_len;
755 /* Copy the linear header and data. */
756 if (skb_copy_bits(skb, -head_copy_len, n->head + head_copy_off,
757 skb->len + head_copy_len))
760 copy_skb_header(n, skb);
766 * skb_pad - zero pad the tail of an skb
767 * @skb: buffer to pad
770 * Ensure that a buffer is followed by a padding area that is zero
771 * filled. Used by network drivers which may DMA or transfer data
772 * beyond the buffer end onto the wire.
774 * May return error in out of memory cases. The skb is freed on error.
777 int skb_pad(struct sk_buff *skb, int pad)
782 /* If the skbuff is non linear tailroom is always zero.. */
783 if (!skb_cloned(skb) && skb_tailroom(skb) >= pad) {
784 memset(skb->data+skb->len, 0, pad);
788 ntail = skb->data_len + pad - (skb->end - skb->tail);
789 if (likely(skb_cloned(skb) || ntail > 0)) {
790 err = pskb_expand_head(skb, 0, ntail, GFP_ATOMIC);
795 /* FIXME: The use of this function with non-linear skb's really needs
798 err = skb_linearize(skb);
802 memset(skb->data + skb->len, 0, pad);
810 /* Trims skb to length len. It can change skb pointers.
813 int ___pskb_trim(struct sk_buff *skb, unsigned int len)
815 struct sk_buff **fragp;
816 struct sk_buff *frag;
817 int offset = skb_headlen(skb);
818 int nfrags = skb_shinfo(skb)->nr_frags;
822 if (skb_cloned(skb) &&
823 unlikely((err = pskb_expand_head(skb, 0, 0, GFP_ATOMIC))))
830 for (; i < nfrags; i++) {
831 int end = offset + skb_shinfo(skb)->frags[i].size;
838 skb_shinfo(skb)->frags[i++].size = len - offset;
841 skb_shinfo(skb)->nr_frags = i;
843 for (; i < nfrags; i++)
844 put_page(skb_shinfo(skb)->frags[i].page);
846 if (skb_shinfo(skb)->frag_list)
847 skb_drop_fraglist(skb);
851 for (fragp = &skb_shinfo(skb)->frag_list; (frag = *fragp);
852 fragp = &frag->next) {
853 int end = offset + frag->len;
855 if (skb_shared(frag)) {
856 struct sk_buff *nfrag;
858 nfrag = skb_clone(frag, GFP_ATOMIC);
859 if (unlikely(!nfrag))
862 nfrag->next = frag->next;
874 unlikely((err = pskb_trim(frag, len - offset))))
878 skb_drop_list(&frag->next);
883 if (len > skb_headlen(skb)) {
884 skb->data_len -= skb->len - len;
889 skb_set_tail_pointer(skb, len);
896 * __pskb_pull_tail - advance tail of skb header
897 * @skb: buffer to reallocate
898 * @delta: number of bytes to advance tail
900 * The function makes a sense only on a fragmented &sk_buff,
901 * it expands header moving its tail forward and copying necessary
902 * data from fragmented part.
904 * &sk_buff MUST have reference count of 1.
906 * Returns %NULL (and &sk_buff does not change) if pull failed
907 * or value of new tail of skb in the case of success.
909 * All the pointers pointing into skb header may change and must be
910 * reloaded after call to this function.
913 /* Moves tail of skb head forward, copying data from fragmented part,
914 * when it is necessary.
915 * 1. It may fail due to malloc failure.
916 * 2. It may change skb pointers.
918 * It is pretty complicated. Luckily, it is called only in exceptional cases.
920 unsigned char *__pskb_pull_tail(struct sk_buff *skb, int delta)
922 /* If skb has not enough free space at tail, get new one
923 * plus 128 bytes for future expansions. If we have enough
924 * room at tail, reallocate without expansion only if skb is cloned.
926 int i, k, eat = (skb->tail + delta) - skb->end;
928 if (eat > 0 || skb_cloned(skb)) {
929 if (pskb_expand_head(skb, 0, eat > 0 ? eat + 128 : 0,
934 if (skb_copy_bits(skb, skb_headlen(skb), skb_tail_pointer(skb), delta))
937 /* Optimization: no fragments, no reasons to preestimate
938 * size of pulled pages. Superb.
940 if (!skb_shinfo(skb)->frag_list)
943 /* Estimate size of pulled pages. */
945 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
946 if (skb_shinfo(skb)->frags[i].size >= eat)
948 eat -= skb_shinfo(skb)->frags[i].size;
951 /* If we need update frag list, we are in troubles.
952 * Certainly, it possible to add an offset to skb data,
953 * but taking into account that pulling is expected to
954 * be very rare operation, it is worth to fight against
955 * further bloating skb head and crucify ourselves here instead.
956 * Pure masohism, indeed. 8)8)
959 struct sk_buff *list = skb_shinfo(skb)->frag_list;
960 struct sk_buff *clone = NULL;
961 struct sk_buff *insp = NULL;
966 if (list->len <= eat) {
967 /* Eaten as whole. */
972 /* Eaten partially. */
974 if (skb_shared(list)) {
975 /* Sucks! We need to fork list. :-( */
976 clone = skb_clone(list, GFP_ATOMIC);
982 /* This may be pulled without
986 if (!pskb_pull(list, eat)) {
995 /* Free pulled out fragments. */
996 while ((list = skb_shinfo(skb)->frag_list) != insp) {
997 skb_shinfo(skb)->frag_list = list->next;
1000 /* And insert new clone at head. */
1003 skb_shinfo(skb)->frag_list = clone;
1006 /* Success! Now we may commit changes to skb data. */
1011 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1012 if (skb_shinfo(skb)->frags[i].size <= eat) {
1013 put_page(skb_shinfo(skb)->frags[i].page);
1014 eat -= skb_shinfo(skb)->frags[i].size;
1016 skb_shinfo(skb)->frags[k] = skb_shinfo(skb)->frags[i];
1018 skb_shinfo(skb)->frags[k].page_offset += eat;
1019 skb_shinfo(skb)->frags[k].size -= eat;
1025 skb_shinfo(skb)->nr_frags = k;
1028 skb->data_len -= delta;
1030 return skb_tail_pointer(skb);
1033 /* Copy some data bits from skb to kernel buffer. */
1035 int skb_copy_bits(const struct sk_buff *skb, int offset, void *to, int len)
1038 int start = skb_headlen(skb);
1040 if (offset > (int)skb->len - len)
1044 if ((copy = start - offset) > 0) {
1047 skb_copy_from_linear_data_offset(skb, offset, to, copy);
1048 if ((len -= copy) == 0)
1054 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1057 BUG_TRAP(start <= offset + len);
1059 end = start + skb_shinfo(skb)->frags[i].size;
1060 if ((copy = end - offset) > 0) {
1066 vaddr = kmap_skb_frag(&skb_shinfo(skb)->frags[i]);
1068 vaddr + skb_shinfo(skb)->frags[i].page_offset+
1069 offset - start, copy);
1070 kunmap_skb_frag(vaddr);
1072 if ((len -= copy) == 0)
1080 if (skb_shinfo(skb)->frag_list) {
1081 struct sk_buff *list = skb_shinfo(skb)->frag_list;
1083 for (; list; list = list->next) {
1086 BUG_TRAP(start <= offset + len);
1088 end = start + list->len;
1089 if ((copy = end - offset) > 0) {
1092 if (skb_copy_bits(list, offset - start,
1095 if ((len -= copy) == 0)
1111 * skb_store_bits - store bits from kernel buffer to skb
1112 * @skb: destination buffer
1113 * @offset: offset in destination
1114 * @from: source buffer
1115 * @len: number of bytes to copy
1117 * Copy the specified number of bytes from the source buffer to the
1118 * destination skb. This function handles all the messy bits of
1119 * traversing fragment lists and such.
1122 int skb_store_bits(const struct sk_buff *skb, int offset, void *from, int len)
1125 int start = skb_headlen(skb);
1127 if (offset > (int)skb->len - len)
1130 if ((copy = start - offset) > 0) {
1133 skb_copy_to_linear_data_offset(skb, offset, from, copy);
1134 if ((len -= copy) == 0)
1140 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1141 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
1144 BUG_TRAP(start <= offset + len);
1146 end = start + frag->size;
1147 if ((copy = end - offset) > 0) {
1153 vaddr = kmap_skb_frag(frag);
1154 memcpy(vaddr + frag->page_offset + offset - start,
1156 kunmap_skb_frag(vaddr);
1158 if ((len -= copy) == 0)
1166 if (skb_shinfo(skb)->frag_list) {
1167 struct sk_buff *list = skb_shinfo(skb)->frag_list;
1169 for (; list; list = list->next) {
1172 BUG_TRAP(start <= offset + len);
1174 end = start + list->len;
1175 if ((copy = end - offset) > 0) {
1178 if (skb_store_bits(list, offset - start,
1181 if ((len -= copy) == 0)
1196 EXPORT_SYMBOL(skb_store_bits);
1198 /* Checksum skb data. */
1200 __wsum skb_checksum(const struct sk_buff *skb, int offset,
1201 int len, __wsum csum)
1203 int start = skb_headlen(skb);
1204 int i, copy = start - offset;
1207 /* Checksum header. */
1211 csum = csum_partial(skb->data + offset, copy, csum);
1212 if ((len -= copy) == 0)
1218 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1221 BUG_TRAP(start <= offset + len);
1223 end = start + skb_shinfo(skb)->frags[i].size;
1224 if ((copy = end - offset) > 0) {
1227 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
1231 vaddr = kmap_skb_frag(frag);
1232 csum2 = csum_partial(vaddr + frag->page_offset +
1233 offset - start, copy, 0);
1234 kunmap_skb_frag(vaddr);
1235 csum = csum_block_add(csum, csum2, pos);
1244 if (skb_shinfo(skb)->frag_list) {
1245 struct sk_buff *list = skb_shinfo(skb)->frag_list;
1247 for (; list; list = list->next) {
1250 BUG_TRAP(start <= offset + len);
1252 end = start + list->len;
1253 if ((copy = end - offset) > 0) {
1257 csum2 = skb_checksum(list, offset - start,
1259 csum = csum_block_add(csum, csum2, pos);
1260 if ((len -= copy) == 0)
1273 /* Both of above in one bottle. */
1275 __wsum skb_copy_and_csum_bits(const struct sk_buff *skb, int offset,
1276 u8 *to, int len, __wsum csum)
1278 int start = skb_headlen(skb);
1279 int i, copy = start - offset;
1286 csum = csum_partial_copy_nocheck(skb->data + offset, to,
1288 if ((len -= copy) == 0)
1295 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
1298 BUG_TRAP(start <= offset + len);
1300 end = start + skb_shinfo(skb)->frags[i].size;
1301 if ((copy = end - offset) > 0) {
1304 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
1308 vaddr = kmap_skb_frag(frag);
1309 csum2 = csum_partial_copy_nocheck(vaddr +
1313 kunmap_skb_frag(vaddr);
1314 csum = csum_block_add(csum, csum2, pos);
1324 if (skb_shinfo(skb)->frag_list) {
1325 struct sk_buff *list = skb_shinfo(skb)->frag_list;
1327 for (; list; list = list->next) {
1331 BUG_TRAP(start <= offset + len);
1333 end = start + list->len;
1334 if ((copy = end - offset) > 0) {
1337 csum2 = skb_copy_and_csum_bits(list,
1340 csum = csum_block_add(csum, csum2, pos);
1341 if ((len -= copy) == 0)
1354 void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to)
1359 if (skb->ip_summed == CHECKSUM_PARTIAL)
1360 csstart = skb_transport_offset(skb);
1362 csstart = skb_headlen(skb);
1364 BUG_ON(csstart > skb_headlen(skb));
1366 skb_copy_from_linear_data(skb, to, csstart);
1369 if (csstart != skb->len)
1370 csum = skb_copy_and_csum_bits(skb, csstart, to + csstart,
1371 skb->len - csstart, 0);
1373 if (skb->ip_summed == CHECKSUM_PARTIAL) {
1374 long csstuff = csstart + skb->csum_offset;
1376 *((__sum16 *)(to + csstuff)) = csum_fold(csum);
1381 * skb_dequeue - remove from the head of the queue
1382 * @list: list to dequeue from
1384 * Remove the head of the list. The list lock is taken so the function
1385 * may be used safely with other locking list functions. The head item is
1386 * returned or %NULL if the list is empty.
1389 struct sk_buff *skb_dequeue(struct sk_buff_head *list)
1391 unsigned long flags;
1392 struct sk_buff *result;
1394 spin_lock_irqsave(&list->lock, flags);
1395 result = __skb_dequeue(list);
1396 spin_unlock_irqrestore(&list->lock, flags);
1401 * skb_dequeue_tail - remove from the tail of the queue
1402 * @list: list to dequeue from
1404 * Remove the tail of the list. The list lock is taken so the function
1405 * may be used safely with other locking list functions. The tail item is
1406 * returned or %NULL if the list is empty.
1408 struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list)
1410 unsigned long flags;
1411 struct sk_buff *result;
1413 spin_lock_irqsave(&list->lock, flags);
1414 result = __skb_dequeue_tail(list);
1415 spin_unlock_irqrestore(&list->lock, flags);
1420 * skb_queue_purge - empty a list
1421 * @list: list to empty
1423 * Delete all buffers on an &sk_buff list. Each buffer is removed from
1424 * the list and one reference dropped. This function takes the list
1425 * lock and is atomic with respect to other list locking functions.
1427 void skb_queue_purge(struct sk_buff_head *list)
1429 struct sk_buff *skb;
1430 while ((skb = skb_dequeue(list)) != NULL)
1435 * skb_queue_head - queue a buffer at the list head
1436 * @list: list to use
1437 * @newsk: buffer to queue
1439 * Queue a buffer at the start of the list. This function takes the
1440 * list lock and can be used safely with other locking &sk_buff functions
1443 * A buffer cannot be placed on two lists at the same time.
1445 void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk)
1447 unsigned long flags;
1449 spin_lock_irqsave(&list->lock, flags);
1450 __skb_queue_head(list, newsk);
1451 spin_unlock_irqrestore(&list->lock, flags);
1455 * skb_queue_tail - queue a buffer at the list tail
1456 * @list: list to use
1457 * @newsk: buffer to queue
1459 * Queue a buffer at the tail of the list. This function takes the
1460 * list lock and can be used safely with other locking &sk_buff functions
1463 * A buffer cannot be placed on two lists at the same time.
1465 void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk)
1467 unsigned long flags;
1469 spin_lock_irqsave(&list->lock, flags);
1470 __skb_queue_tail(list, newsk);
1471 spin_unlock_irqrestore(&list->lock, flags);
1475 * skb_unlink - remove a buffer from a list
1476 * @skb: buffer to remove
1477 * @list: list to use
1479 * Remove a packet from a list. The list locks are taken and this
1480 * function is atomic with respect to other list locked calls
1482 * You must know what list the SKB is on.
1484 void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
1486 unsigned long flags;
1488 spin_lock_irqsave(&list->lock, flags);
1489 __skb_unlink(skb, list);
1490 spin_unlock_irqrestore(&list->lock, flags);
1494 * skb_append - append a buffer
1495 * @old: buffer to insert after
1496 * @newsk: buffer to insert
1497 * @list: list to use
1499 * Place a packet after a given packet in a list. The list locks are taken
1500 * and this function is atomic with respect to other list locked calls.
1501 * A buffer cannot be placed on two lists at the same time.
1503 void skb_append(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list)
1505 unsigned long flags;
1507 spin_lock_irqsave(&list->lock, flags);
1508 __skb_append(old, newsk, list);
1509 spin_unlock_irqrestore(&list->lock, flags);
1514 * skb_insert - insert a buffer
1515 * @old: buffer to insert before
1516 * @newsk: buffer to insert
1517 * @list: list to use
1519 * Place a packet before a given packet in a list. The list locks are
1520 * taken and this function is atomic with respect to other list locked
1523 * A buffer cannot be placed on two lists at the same time.
1525 void skb_insert(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list)
1527 unsigned long flags;
1529 spin_lock_irqsave(&list->lock, flags);
1530 __skb_insert(newsk, old->prev, old, list);
1531 spin_unlock_irqrestore(&list->lock, flags);
1534 static inline void skb_split_inside_header(struct sk_buff *skb,
1535 struct sk_buff* skb1,
1536 const u32 len, const int pos)
1540 skb_copy_from_linear_data_offset(skb, len, skb_put(skb1, pos - len),
1542 /* And move data appendix as is. */
1543 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++)
1544 skb_shinfo(skb1)->frags[i] = skb_shinfo(skb)->frags[i];
1546 skb_shinfo(skb1)->nr_frags = skb_shinfo(skb)->nr_frags;
1547 skb_shinfo(skb)->nr_frags = 0;
1548 skb1->data_len = skb->data_len;
1549 skb1->len += skb1->data_len;
1552 skb_set_tail_pointer(skb, len);
1555 static inline void skb_split_no_header(struct sk_buff *skb,
1556 struct sk_buff* skb1,
1557 const u32 len, int pos)
1560 const int nfrags = skb_shinfo(skb)->nr_frags;
1562 skb_shinfo(skb)->nr_frags = 0;
1563 skb1->len = skb1->data_len = skb->len - len;
1565 skb->data_len = len - pos;
1567 for (i = 0; i < nfrags; i++) {
1568 int size = skb_shinfo(skb)->frags[i].size;
1570 if (pos + size > len) {
1571 skb_shinfo(skb1)->frags[k] = skb_shinfo(skb)->frags[i];
1575 * We have two variants in this case:
1576 * 1. Move all the frag to the second
1577 * part, if it is possible. F.e.
1578 * this approach is mandatory for TUX,
1579 * where splitting is expensive.
1580 * 2. Split is accurately. We make this.
1582 get_page(skb_shinfo(skb)->frags[i].page);
1583 skb_shinfo(skb1)->frags[0].page_offset += len - pos;
1584 skb_shinfo(skb1)->frags[0].size -= len - pos;
1585 skb_shinfo(skb)->frags[i].size = len - pos;
1586 skb_shinfo(skb)->nr_frags++;
1590 skb_shinfo(skb)->nr_frags++;
1593 skb_shinfo(skb1)->nr_frags = k;
1597 * skb_split - Split fragmented skb to two parts at length len.
1598 * @skb: the buffer to split
1599 * @skb1: the buffer to receive the second part
1600 * @len: new length for skb
1602 void skb_split(struct sk_buff *skb, struct sk_buff *skb1, const u32 len)
1604 int pos = skb_headlen(skb);
1606 if (len < pos) /* Split line is inside header. */
1607 skb_split_inside_header(skb, skb1, len, pos);
1608 else /* Second chunk has no header, nothing to copy. */
1609 skb_split_no_header(skb, skb1, len, pos);
1613 * skb_prepare_seq_read - Prepare a sequential read of skb data
1614 * @skb: the buffer to read
1615 * @from: lower offset of data to be read
1616 * @to: upper offset of data to be read
1617 * @st: state variable
1619 * Initializes the specified state variable. Must be called before
1620 * invoking skb_seq_read() for the first time.
1622 void skb_prepare_seq_read(struct sk_buff *skb, unsigned int from,
1623 unsigned int to, struct skb_seq_state *st)
1625 st->lower_offset = from;
1626 st->upper_offset = to;
1627 st->root_skb = st->cur_skb = skb;
1628 st->frag_idx = st->stepped_offset = 0;
1629 st->frag_data = NULL;
1633 * skb_seq_read - Sequentially read skb data
1634 * @consumed: number of bytes consumed by the caller so far
1635 * @data: destination pointer for data to be returned
1636 * @st: state variable
1638 * Reads a block of skb data at &consumed relative to the
1639 * lower offset specified to skb_prepare_seq_read(). Assigns
1640 * the head of the data block to &data and returns the length
1641 * of the block or 0 if the end of the skb data or the upper
1642 * offset has been reached.
1644 * The caller is not required to consume all of the data
1645 * returned, i.e. &consumed is typically set to the number
1646 * of bytes already consumed and the next call to
1647 * skb_seq_read() will return the remaining part of the block.
1649 * Note: The size of each block of data returned can be arbitary,
1650 * this limitation is the cost for zerocopy seqeuental
1651 * reads of potentially non linear data.
1653 * Note: Fragment lists within fragments are not implemented
1654 * at the moment, state->root_skb could be replaced with
1655 * a stack for this purpose.
1657 unsigned int skb_seq_read(unsigned int consumed, const u8 **data,
1658 struct skb_seq_state *st)
1660 unsigned int block_limit, abs_offset = consumed + st->lower_offset;
1663 if (unlikely(abs_offset >= st->upper_offset))
1667 block_limit = skb_headlen(st->cur_skb);
1669 if (abs_offset < block_limit) {
1670 *data = st->cur_skb->data + abs_offset;
1671 return block_limit - abs_offset;
1674 if (st->frag_idx == 0 && !st->frag_data)
1675 st->stepped_offset += skb_headlen(st->cur_skb);
1677 while (st->frag_idx < skb_shinfo(st->cur_skb)->nr_frags) {
1678 frag = &skb_shinfo(st->cur_skb)->frags[st->frag_idx];
1679 block_limit = frag->size + st->stepped_offset;
1681 if (abs_offset < block_limit) {
1683 st->frag_data = kmap_skb_frag(frag);
1685 *data = (u8 *) st->frag_data + frag->page_offset +
1686 (abs_offset - st->stepped_offset);
1688 return block_limit - abs_offset;
1691 if (st->frag_data) {
1692 kunmap_skb_frag(st->frag_data);
1693 st->frag_data = NULL;
1697 st->stepped_offset += frag->size;
1700 if (st->cur_skb->next) {
1701 st->cur_skb = st->cur_skb->next;
1704 } else if (st->root_skb == st->cur_skb &&
1705 skb_shinfo(st->root_skb)->frag_list) {
1706 st->cur_skb = skb_shinfo(st->root_skb)->frag_list;
1714 * skb_abort_seq_read - Abort a sequential read of skb data
1715 * @st: state variable
1717 * Must be called if skb_seq_read() was not called until it
1720 void skb_abort_seq_read(struct skb_seq_state *st)
1723 kunmap_skb_frag(st->frag_data);
1726 #define TS_SKB_CB(state) ((struct skb_seq_state *) &((state)->cb))
1728 static unsigned int skb_ts_get_next_block(unsigned int offset, const u8 **text,
1729 struct ts_config *conf,
1730 struct ts_state *state)
1732 return skb_seq_read(offset, text, TS_SKB_CB(state));
1735 static void skb_ts_finish(struct ts_config *conf, struct ts_state *state)
1737 skb_abort_seq_read(TS_SKB_CB(state));
1741 * skb_find_text - Find a text pattern in skb data
1742 * @skb: the buffer to look in
1743 * @from: search offset
1745 * @config: textsearch configuration
1746 * @state: uninitialized textsearch state variable
1748 * Finds a pattern in the skb data according to the specified
1749 * textsearch configuration. Use textsearch_next() to retrieve
1750 * subsequent occurrences of the pattern. Returns the offset
1751 * to the first occurrence or UINT_MAX if no match was found.
1753 unsigned int skb_find_text(struct sk_buff *skb, unsigned int from,
1754 unsigned int to, struct ts_config *config,
1755 struct ts_state *state)
1759 config->get_next_block = skb_ts_get_next_block;
1760 config->finish = skb_ts_finish;
1762 skb_prepare_seq_read(skb, from, to, TS_SKB_CB(state));
1764 ret = textsearch_find(config, state);
1765 return (ret <= to - from ? ret : UINT_MAX);
1769 * skb_append_datato_frags: - append the user data to a skb
1770 * @sk: sock structure
1771 * @skb: skb structure to be appened with user data.
1772 * @getfrag: call back function to be used for getting the user data
1773 * @from: pointer to user message iov
1774 * @length: length of the iov message
1776 * Description: This procedure append the user data in the fragment part
1777 * of the skb if any page alloc fails user this procedure returns -ENOMEM
1779 int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb,
1780 int (*getfrag)(void *from, char *to, int offset,
1781 int len, int odd, struct sk_buff *skb),
1782 void *from, int length)
1785 skb_frag_t *frag = NULL;
1786 struct page *page = NULL;
1792 /* Return error if we don't have space for new frag */
1793 frg_cnt = skb_shinfo(skb)->nr_frags;
1794 if (frg_cnt >= MAX_SKB_FRAGS)
1797 /* allocate a new page for next frag */
1798 page = alloc_pages(sk->sk_allocation, 0);
1800 /* If alloc_page fails just return failure and caller will
1801 * free previous allocated pages by doing kfree_skb()
1806 /* initialize the next frag */
1807 sk->sk_sndmsg_page = page;
1808 sk->sk_sndmsg_off = 0;
1809 skb_fill_page_desc(skb, frg_cnt, page, 0, 0);
1810 skb->truesize += PAGE_SIZE;
1811 atomic_add(PAGE_SIZE, &sk->sk_wmem_alloc);
1813 /* get the new initialized frag */
1814 frg_cnt = skb_shinfo(skb)->nr_frags;
1815 frag = &skb_shinfo(skb)->frags[frg_cnt - 1];
1817 /* copy the user data to page */
1818 left = PAGE_SIZE - frag->page_offset;
1819 copy = (length > left)? left : length;
1821 ret = getfrag(from, (page_address(frag->page) +
1822 frag->page_offset + frag->size),
1823 offset, copy, 0, skb);
1827 /* copy was successful so update the size parameters */
1828 sk->sk_sndmsg_off += copy;
1831 skb->data_len += copy;
1835 } while (length > 0);
1841 * skb_pull_rcsum - pull skb and update receive checksum
1842 * @skb: buffer to update
1843 * @start: start of data before pull
1844 * @len: length of data pulled
1846 * This function performs an skb_pull on the packet and updates
1847 * update the CHECKSUM_COMPLETE checksum. It should be used on
1848 * receive path processing instead of skb_pull unless you know
1849 * that the checksum difference is zero (e.g., a valid IP header)
1850 * or you are setting ip_summed to CHECKSUM_NONE.
1852 unsigned char *skb_pull_rcsum(struct sk_buff *skb, unsigned int len)
1854 BUG_ON(len > skb->len);
1856 BUG_ON(skb->len < skb->data_len);
1857 skb_postpull_rcsum(skb, skb->data, len);
1858 return skb->data += len;
1861 EXPORT_SYMBOL_GPL(skb_pull_rcsum);
1864 * skb_segment - Perform protocol segmentation on skb.
1865 * @skb: buffer to segment
1866 * @features: features for the output path (see dev->features)
1868 * This function performs segmentation on the given skb. It returns
1869 * the segment at the given position. It returns NULL if there are
1870 * no more segments to generate, or when an error is encountered.
1872 struct sk_buff *skb_segment(struct sk_buff *skb, int features)
1874 struct sk_buff *segs = NULL;
1875 struct sk_buff *tail = NULL;
1876 unsigned int mss = skb_shinfo(skb)->gso_size;
1877 unsigned int doffset = skb->data - skb_mac_header(skb);
1878 unsigned int offset = doffset;
1879 unsigned int headroom;
1881 int sg = features & NETIF_F_SG;
1882 int nfrags = skb_shinfo(skb)->nr_frags;
1887 __skb_push(skb, doffset);
1888 headroom = skb_headroom(skb);
1889 pos = skb_headlen(skb);
1892 struct sk_buff *nskb;
1898 len = skb->len - offset;
1902 hsize = skb_headlen(skb) - offset;
1905 if (hsize > len || !sg)
1908 nskb = alloc_skb(hsize + doffset + headroom, GFP_ATOMIC);
1909 if (unlikely(!nskb))
1918 nskb->dev = skb->dev;
1919 nskb->priority = skb->priority;
1920 nskb->protocol = skb->protocol;
1921 nskb->dst = dst_clone(skb->dst);
1922 memcpy(nskb->cb, skb->cb, sizeof(skb->cb));
1923 nskb->pkt_type = skb->pkt_type;
1924 nskb->mac_len = skb->mac_len;
1926 skb_reserve(nskb, headroom);
1927 skb_reset_mac_header(nskb);
1928 skb_set_network_header(nskb, skb->mac_len);
1929 nskb->transport_header = (nskb->network_header +
1930 skb_network_header_len(skb));
1931 skb_copy_from_linear_data(skb, skb_put(nskb, doffset),
1934 nskb->csum = skb_copy_and_csum_bits(skb, offset,
1940 frag = skb_shinfo(nskb)->frags;
1943 nskb->ip_summed = CHECKSUM_PARTIAL;
1944 nskb->csum = skb->csum;
1945 skb_copy_from_linear_data_offset(skb, offset,
1946 skb_put(nskb, hsize), hsize);
1948 while (pos < offset + len) {
1949 BUG_ON(i >= nfrags);
1951 *frag = skb_shinfo(skb)->frags[i];
1952 get_page(frag->page);
1956 frag->page_offset += offset - pos;
1957 frag->size -= offset - pos;
1962 if (pos + size <= offset + len) {
1966 frag->size -= pos + size - (offset + len);
1973 skb_shinfo(nskb)->nr_frags = k;
1974 nskb->data_len = len - hsize;
1975 nskb->len += nskb->data_len;
1976 nskb->truesize += nskb->data_len;
1977 } while ((offset += len) < skb->len);
1982 while ((skb = segs)) {
1986 return ERR_PTR(err);
1989 EXPORT_SYMBOL_GPL(skb_segment);
1991 void __init skb_init(void)
1993 skbuff_head_cache = kmem_cache_create("skbuff_head_cache",
1994 sizeof(struct sk_buff),
1996 SLAB_HWCACHE_ALIGN|SLAB_PANIC,
1998 skbuff_fclone_cache = kmem_cache_create("skbuff_fclone_cache",
1999 (2*sizeof(struct sk_buff)) +
2002 SLAB_HWCACHE_ALIGN|SLAB_PANIC,
2007 * skb_to_sgvec - Fill a scatter-gather list from a socket buffer
2008 * @skb: Socket buffer containing the buffers to be mapped
2009 * @sg: The scatter-gather list to map into
2010 * @offset: The offset into the buffer's contents to start mapping
2011 * @len: Length of buffer space to be mapped
2013 * Fill the specified scatter-gather list with mappings/pointers into a
2014 * region of the buffer space attached to a socket buffer.
2017 skb_to_sgvec(struct sk_buff *skb, struct scatterlist *sg, int offset, int len)
2019 int start = skb_headlen(skb);
2020 int i, copy = start - offset;
2026 sg[elt].page = virt_to_page(skb->data + offset);
2027 sg[elt].offset = (unsigned long)(skb->data + offset) % PAGE_SIZE;
2028 sg[elt].length = copy;
2030 if ((len -= copy) == 0)
2035 for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
2038 BUG_TRAP(start <= offset + len);
2040 end = start + skb_shinfo(skb)->frags[i].size;
2041 if ((copy = end - offset) > 0) {
2042 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
2046 sg[elt].page = frag->page;
2047 sg[elt].offset = frag->page_offset+offset-start;
2048 sg[elt].length = copy;
2057 if (skb_shinfo(skb)->frag_list) {
2058 struct sk_buff *list = skb_shinfo(skb)->frag_list;
2060 for (; list; list = list->next) {
2063 BUG_TRAP(start <= offset + len);
2065 end = start + list->len;
2066 if ((copy = end - offset) > 0) {
2069 elt += skb_to_sgvec(list, sg+elt, offset - start, copy);
2070 if ((len -= copy) == 0)
2082 * skb_cow_data - Check that a socket buffer's data buffers are writable
2083 * @skb: The socket buffer to check.
2084 * @tailbits: Amount of trailing space to be added
2085 * @trailer: Returned pointer to the skb where the @tailbits space begins
2087 * Make sure that the data buffers attached to a socket buffer are
2088 * writable. If they are not, private copies are made of the data buffers
2089 * and the socket buffer is set to use these instead.
2091 * If @tailbits is given, make sure that there is space to write @tailbits
2092 * bytes of data beyond current end of socket buffer. @trailer will be
2093 * set to point to the skb in which this space begins.
2095 * The number of scatterlist elements required to completely map the
2096 * COW'd and extended socket buffer will be returned.
2098 int skb_cow_data(struct sk_buff *skb, int tailbits, struct sk_buff **trailer)
2102 struct sk_buff *skb1, **skb_p;
2104 /* If skb is cloned or its head is paged, reallocate
2105 * head pulling out all the pages (pages are considered not writable
2106 * at the moment even if they are anonymous).
2108 if ((skb_cloned(skb) || skb_shinfo(skb)->nr_frags) &&
2109 __pskb_pull_tail(skb, skb_pagelen(skb)-skb_headlen(skb)) == NULL)
2112 /* Easy case. Most of packets will go this way. */
2113 if (!skb_shinfo(skb)->frag_list) {
2114 /* A little of trouble, not enough of space for trailer.
2115 * This should not happen, when stack is tuned to generate
2116 * good frames. OK, on miss we reallocate and reserve even more
2117 * space, 128 bytes is fair. */
2119 if (skb_tailroom(skb) < tailbits &&
2120 pskb_expand_head(skb, 0, tailbits-skb_tailroom(skb)+128, GFP_ATOMIC))
2128 /* Misery. We are in troubles, going to mincer fragments... */
2131 skb_p = &skb_shinfo(skb)->frag_list;
2134 while ((skb1 = *skb_p) != NULL) {
2137 /* The fragment is partially pulled by someone,
2138 * this can happen on input. Copy it and everything
2141 if (skb_shared(skb1))
2144 /* If the skb is the last, worry about trailer. */
2146 if (skb1->next == NULL && tailbits) {
2147 if (skb_shinfo(skb1)->nr_frags ||
2148 skb_shinfo(skb1)->frag_list ||
2149 skb_tailroom(skb1) < tailbits)
2150 ntail = tailbits + 128;
2156 skb_shinfo(skb1)->nr_frags ||
2157 skb_shinfo(skb1)->frag_list) {
2158 struct sk_buff *skb2;
2160 /* Fuck, we are miserable poor guys... */
2162 skb2 = skb_copy(skb1, GFP_ATOMIC);
2164 skb2 = skb_copy_expand(skb1,
2168 if (unlikely(skb2 == NULL))
2172 skb_set_owner_w(skb2, skb1->sk);
2174 /* Looking around. Are we still alive?
2175 * OK, link new skb, drop old one */
2177 skb2->next = skb1->next;
2184 skb_p = &skb1->next;
2190 EXPORT_SYMBOL(___pskb_trim);
2191 EXPORT_SYMBOL(__kfree_skb);
2192 EXPORT_SYMBOL(kfree_skb);
2193 EXPORT_SYMBOL(__pskb_pull_tail);
2194 EXPORT_SYMBOL(__alloc_skb);
2195 EXPORT_SYMBOL(__netdev_alloc_skb);
2196 EXPORT_SYMBOL(pskb_copy);
2197 EXPORT_SYMBOL(pskb_expand_head);
2198 EXPORT_SYMBOL(skb_checksum);
2199 EXPORT_SYMBOL(skb_clone);
2200 EXPORT_SYMBOL(skb_clone_fraglist);
2201 EXPORT_SYMBOL(skb_copy);
2202 EXPORT_SYMBOL(skb_copy_and_csum_bits);
2203 EXPORT_SYMBOL(skb_copy_and_csum_dev);
2204 EXPORT_SYMBOL(skb_copy_bits);
2205 EXPORT_SYMBOL(skb_copy_expand);
2206 EXPORT_SYMBOL(skb_over_panic);
2207 EXPORT_SYMBOL(skb_pad);
2208 EXPORT_SYMBOL(skb_realloc_headroom);
2209 EXPORT_SYMBOL(skb_under_panic);
2210 EXPORT_SYMBOL(skb_dequeue);
2211 EXPORT_SYMBOL(skb_dequeue_tail);
2212 EXPORT_SYMBOL(skb_insert);
2213 EXPORT_SYMBOL(skb_queue_purge);
2214 EXPORT_SYMBOL(skb_queue_head);
2215 EXPORT_SYMBOL(skb_queue_tail);
2216 EXPORT_SYMBOL(skb_unlink);
2217 EXPORT_SYMBOL(skb_append);
2218 EXPORT_SYMBOL(skb_split);
2219 EXPORT_SYMBOL(skb_prepare_seq_read);
2220 EXPORT_SYMBOL(skb_seq_read);
2221 EXPORT_SYMBOL(skb_abort_seq_read);
2222 EXPORT_SYMBOL(skb_find_text);
2223 EXPORT_SYMBOL(skb_append_datato_frags);
2225 EXPORT_SYMBOL_GPL(skb_to_sgvec);
2226 EXPORT_SYMBOL_GPL(skb_cow_data);