2 * Definitions for the 'struct sk_buff' memory handlers.
5 * Alan Cox, <gw4pts@gw4pts.ampr.org>
6 * Florian La Roche, <rzsfl@rz.uni-sb.de>
8 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License
10 * as published by the Free Software Foundation; either version
11 * 2 of the License, or (at your option) any later version.
14 #ifndef _LINUX_SKBUFF_H
15 #define _LINUX_SKBUFF_H
17 #include <linux/kernel.h>
18 #include <linux/compiler.h>
19 #include <linux/time.h>
20 #include <linux/cache.h>
22 #include <asm/atomic.h>
23 #include <asm/types.h>
24 #include <linux/spinlock.h>
25 #include <linux/net.h>
26 #include <linux/textsearch.h>
27 #include <net/checksum.h>
28 #include <linux/rcupdate.h>
29 #include <linux/dmaengine.h>
30 #include <linux/hrtimer.h>
32 #define HAVE_ALLOC_SKB /* For the drivers to know */
33 #define HAVE_ALIGNABLE_SKB /* Ditto 8) */
35 /* Don't change this without changing skb_csum_unnecessary! */
36 #define CHECKSUM_NONE 0
37 #define CHECKSUM_UNNECESSARY 1
38 #define CHECKSUM_COMPLETE 2
39 #define CHECKSUM_PARTIAL 3
41 #define SKB_DATA_ALIGN(X) (((X) + (SMP_CACHE_BYTES - 1)) & \
42 ~(SMP_CACHE_BYTES - 1))
43 #define SKB_WITH_OVERHEAD(X) \
44 (((X) - sizeof(struct skb_shared_info)) & \
45 ~(SMP_CACHE_BYTES - 1))
46 #define SKB_MAX_ORDER(X, ORDER) \
47 SKB_WITH_OVERHEAD((PAGE_SIZE << (ORDER)) - (X))
48 #define SKB_MAX_HEAD(X) (SKB_MAX_ORDER((X), 0))
49 #define SKB_MAX_ALLOC (SKB_MAX_ORDER(0, 2))
51 /* A. Checksumming of received packets by device.
53 * NONE: device failed to checksum this packet.
54 * skb->csum is undefined.
56 * UNNECESSARY: device parsed packet and wouldbe verified checksum.
57 * skb->csum is undefined.
58 * It is bad option, but, unfortunately, many of vendors do this.
59 * Apparently with secret goal to sell you new device, when you
60 * will add new protocol to your host. F.e. IPv6. 8)
62 * COMPLETE: the most generic way. Device supplied checksum of _all_
63 * the packet as seen by netif_rx in skb->csum.
64 * NOTE: Even if device supports only some protocols, but
65 * is able to produce some skb->csum, it MUST use COMPLETE,
68 * B. Checksumming on output.
70 * NONE: skb is checksummed by protocol or csum is not required.
72 * PARTIAL: device is required to csum packet as seen by hard_start_xmit
73 * from skb->transport_header to the end and to record the checksum
74 * at skb->transport_header + skb->csum.
76 * Device must show its capabilities in dev->features, set
77 * at device setup time.
78 * NETIF_F_HW_CSUM - it is clever device, it is able to checksum
80 * NETIF_F_NO_CSUM - loopback or reliable single hop media.
81 * NETIF_F_IP_CSUM - device is dumb. It is able to csum only
82 * TCP/UDP over IPv4. Sigh. Vendors like this
83 * way by an unknown reason. Though, see comment above
84 * about CHECKSUM_UNNECESSARY. 8)
86 * Any questions? No questions, good. --ANK
92 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
98 #ifdef CONFIG_BRIDGE_NETFILTER
99 struct nf_bridge_info {
101 struct net_device *physindev;
102 struct net_device *physoutdev;
103 #if defined(CONFIG_VLAN_8021Q) || defined(CONFIG_VLAN_8021Q_MODULE)
104 struct net_device *netoutdev;
107 unsigned long data[32 / sizeof(unsigned long)];
111 struct sk_buff_head {
112 /* These two members must be first. */
113 struct sk_buff *next;
114 struct sk_buff *prev;
122 /* To allow 64K frame to be packed as single skb without frag_list */
123 #define MAX_SKB_FRAGS (65536/PAGE_SIZE + 2)
125 typedef struct skb_frag_struct skb_frag_t;
127 struct skb_frag_struct {
133 /* This data is invariant across clones and lives at
134 * the end of the header data, ie. at skb->end.
136 struct skb_shared_info {
138 unsigned short nr_frags;
139 unsigned short gso_size;
140 /* Warning: this field is not always filled in (UFO)! */
141 unsigned short gso_segs;
142 unsigned short gso_type;
144 struct sk_buff *frag_list;
145 skb_frag_t frags[MAX_SKB_FRAGS];
148 /* We divide dataref into two halves. The higher 16 bits hold references
149 * to the payload part of skb->data. The lower 16 bits hold references to
150 * the entire skb->data. A clone of a headerless skb holds the length of
151 * the header in skb->hdr_len.
153 * All users must obey the rule that the skb->data reference count must be
154 * greater than or equal to the payload reference count.
156 * Holding a reference to the payload part means that the user does not
157 * care about modifications to the header part of skb->data.
159 #define SKB_DATAREF_SHIFT 16
160 #define SKB_DATAREF_MASK ((1 << SKB_DATAREF_SHIFT) - 1)
164 SKB_FCLONE_UNAVAILABLE,
170 SKB_GSO_TCPV4 = 1 << 0,
171 SKB_GSO_UDP = 1 << 1,
173 /* This indicates the skb is from an untrusted source. */
174 SKB_GSO_DODGY = 1 << 2,
176 /* This indicates the tcp segment has CWR set. */
177 SKB_GSO_TCP_ECN = 1 << 3,
179 SKB_GSO_TCPV6 = 1 << 4,
182 #if BITS_PER_LONG > 32
183 #define NET_SKBUFF_DATA_USES_OFFSET 1
186 #ifdef NET_SKBUFF_DATA_USES_OFFSET
187 typedef unsigned int sk_buff_data_t;
189 typedef unsigned char *sk_buff_data_t;
193 * struct sk_buff - socket buffer
194 * @next: Next buffer in list
195 * @prev: Previous buffer in list
196 * @sk: Socket we are owned by
197 * @tstamp: Time we arrived
198 * @dev: Device we arrived on/are leaving by
199 * @transport_header: Transport layer header
200 * @network_header: Network layer header
201 * @mac_header: Link layer header
202 * @dst: destination entry
203 * @sp: the security path, used for xfrm
204 * @cb: Control buffer. Free for use by every layer. Put private vars here
205 * @len: Length of actual data
206 * @data_len: Data length
207 * @mac_len: Length of link layer header
208 * @hdr_len: writable header length of cloned skb
209 * @csum: Checksum (must include start/offset pair)
210 * @csum_start: Offset from skb->head where checksumming should start
211 * @csum_offset: Offset from csum_start where checksum should be stored
212 * @local_df: allow local fragmentation
213 * @cloned: Head may be cloned (check refcnt to be sure)
214 * @nohdr: Payload reference only, must not modify header
215 * @pkt_type: Packet class
216 * @fclone: skbuff clone status
217 * @ip_summed: Driver fed us an IP checksum
218 * @priority: Packet queueing priority
219 * @users: User count - see {datagram,tcp}.c
220 * @protocol: Packet protocol from driver
221 * @truesize: Buffer size
222 * @head: Head of buffer
223 * @data: Data head pointer
224 * @tail: Tail pointer
226 * @destructor: Destruct function
227 * @mark: Generic packet mark
228 * @nfct: Associated connection, if any
229 * @ipvs_property: skbuff is owned by ipvs
230 * @nfctinfo: Relationship of this skb to the connection
231 * @nfct_reasm: netfilter conntrack re-assembly pointer
232 * @nf_bridge: Saved data about a bridged frame - see br_netfilter.c
233 * @iif: ifindex of device we arrived on
234 * @queue_mapping: Queue mapping for multiqueue devices
235 * @tc_index: Traffic control index
236 * @tc_verd: traffic control verdict
237 * @dma_cookie: a cookie to one of several possible DMA operations
238 * done by skb DMA functions
239 * @secmark: security marking
243 /* These two members must be first. */
244 struct sk_buff *next;
245 struct sk_buff *prev;
249 struct net_device *dev;
251 struct dst_entry *dst;
255 * This is the control buffer. It is free to use for every
256 * layer. Please put your private variables there. If you
257 * want to keep them across layers you have to do a skb_clone()
258 * first. This is owned by whoever has the skb queued ATM.
284 void (*destructor)(struct sk_buff *skb);
285 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
286 struct nf_conntrack *nfct;
287 struct sk_buff *nfct_reasm;
289 #ifdef CONFIG_BRIDGE_NETFILTER
290 struct nf_bridge_info *nf_bridge;
296 #ifdef CONFIG_NET_SCHED
297 __u16 tc_index; /* traffic control index */
298 #ifdef CONFIG_NET_CLS_ACT
299 __u16 tc_verd; /* traffic control verdict */
304 #ifdef CONFIG_NET_DMA
305 dma_cookie_t dma_cookie;
307 #ifdef CONFIG_NETWORK_SECMARK
313 sk_buff_data_t transport_header;
314 sk_buff_data_t network_header;
315 sk_buff_data_t mac_header;
316 /* These elements must be at the end, see alloc_skb() for details. */
321 unsigned int truesize;
327 * Handling routines are only of interest to the kernel
329 #include <linux/slab.h>
331 #include <asm/system.h>
333 extern void kfree_skb(struct sk_buff *skb);
334 extern void __kfree_skb(struct sk_buff *skb);
335 extern struct sk_buff *__alloc_skb(unsigned int size,
336 gfp_t priority, int fclone, int node);
337 static inline struct sk_buff *alloc_skb(unsigned int size,
340 return __alloc_skb(size, priority, 0, -1);
343 static inline struct sk_buff *alloc_skb_fclone(unsigned int size,
346 return __alloc_skb(size, priority, 1, -1);
349 extern void kfree_skbmem(struct sk_buff *skb);
350 extern struct sk_buff *skb_clone(struct sk_buff *skb,
352 extern struct sk_buff *skb_copy(const struct sk_buff *skb,
354 extern struct sk_buff *pskb_copy(struct sk_buff *skb,
356 extern int pskb_expand_head(struct sk_buff *skb,
357 int nhead, int ntail,
359 extern struct sk_buff *skb_realloc_headroom(struct sk_buff *skb,
360 unsigned int headroom);
361 extern struct sk_buff *skb_copy_expand(const struct sk_buff *skb,
362 int newheadroom, int newtailroom,
364 extern int skb_to_sgvec(struct sk_buff *skb,
365 struct scatterlist *sg, int offset,
367 extern int skb_cow_data(struct sk_buff *skb, int tailbits,
368 struct sk_buff **trailer);
369 extern int skb_pad(struct sk_buff *skb, int pad);
370 #define dev_kfree_skb(a) kfree_skb(a)
371 extern void skb_over_panic(struct sk_buff *skb, int len,
373 extern void skb_under_panic(struct sk_buff *skb, int len,
375 extern void skb_truesize_bug(struct sk_buff *skb);
377 static inline void skb_truesize_check(struct sk_buff *skb)
379 if (unlikely((int)skb->truesize < sizeof(struct sk_buff) + skb->len))
380 skb_truesize_bug(skb);
383 extern int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb,
384 int getfrag(void *from, char *to, int offset,
385 int len,int odd, struct sk_buff *skb),
386 void *from, int length);
393 __u32 stepped_offset;
394 struct sk_buff *root_skb;
395 struct sk_buff *cur_skb;
399 extern void skb_prepare_seq_read(struct sk_buff *skb,
400 unsigned int from, unsigned int to,
401 struct skb_seq_state *st);
402 extern unsigned int skb_seq_read(unsigned int consumed, const u8 **data,
403 struct skb_seq_state *st);
404 extern void skb_abort_seq_read(struct skb_seq_state *st);
406 extern unsigned int skb_find_text(struct sk_buff *skb, unsigned int from,
407 unsigned int to, struct ts_config *config,
408 struct ts_state *state);
410 #ifdef NET_SKBUFF_DATA_USES_OFFSET
411 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
413 return skb->head + skb->end;
416 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
423 #define skb_shinfo(SKB) ((struct skb_shared_info *)(skb_end_pointer(SKB)))
426 * skb_queue_empty - check if a queue is empty
429 * Returns true if the queue is empty, false otherwise.
431 static inline int skb_queue_empty(const struct sk_buff_head *list)
433 return list->next == (struct sk_buff *)list;
437 * skb_get - reference buffer
438 * @skb: buffer to reference
440 * Makes another reference to a socket buffer and returns a pointer
443 static inline struct sk_buff *skb_get(struct sk_buff *skb)
445 atomic_inc(&skb->users);
450 * If users == 1, we are the only owner and are can avoid redundant
455 * skb_cloned - is the buffer a clone
456 * @skb: buffer to check
458 * Returns true if the buffer was generated with skb_clone() and is
459 * one of multiple shared copies of the buffer. Cloned buffers are
460 * shared data so must not be written to under normal circumstances.
462 static inline int skb_cloned(const struct sk_buff *skb)
464 return skb->cloned &&
465 (atomic_read(&skb_shinfo(skb)->dataref) & SKB_DATAREF_MASK) != 1;
469 * skb_header_cloned - is the header a clone
470 * @skb: buffer to check
472 * Returns true if modifying the header part of the buffer requires
473 * the data to be copied.
475 static inline int skb_header_cloned(const struct sk_buff *skb)
482 dataref = atomic_read(&skb_shinfo(skb)->dataref);
483 dataref = (dataref & SKB_DATAREF_MASK) - (dataref >> SKB_DATAREF_SHIFT);
488 * skb_header_release - release reference to header
489 * @skb: buffer to operate on
491 * Drop a reference to the header part of the buffer. This is done
492 * by acquiring a payload reference. You must not read from the header
493 * part of skb->data after this.
495 static inline void skb_header_release(struct sk_buff *skb)
499 atomic_add(1 << SKB_DATAREF_SHIFT, &skb_shinfo(skb)->dataref);
503 * skb_shared - is the buffer shared
504 * @skb: buffer to check
506 * Returns true if more than one person has a reference to this
509 static inline int skb_shared(const struct sk_buff *skb)
511 return atomic_read(&skb->users) != 1;
515 * skb_share_check - check if buffer is shared and if so clone it
516 * @skb: buffer to check
517 * @pri: priority for memory allocation
519 * If the buffer is shared the buffer is cloned and the old copy
520 * drops a reference. A new clone with a single reference is returned.
521 * If the buffer is not shared the original buffer is returned. When
522 * being called from interrupt status or with spinlocks held pri must
525 * NULL is returned on a memory allocation failure.
527 static inline struct sk_buff *skb_share_check(struct sk_buff *skb,
530 might_sleep_if(pri & __GFP_WAIT);
531 if (skb_shared(skb)) {
532 struct sk_buff *nskb = skb_clone(skb, pri);
540 * Copy shared buffers into a new sk_buff. We effectively do COW on
541 * packets to handle cases where we have a local reader and forward
542 * and a couple of other messy ones. The normal one is tcpdumping
543 * a packet thats being forwarded.
547 * skb_unshare - make a copy of a shared buffer
548 * @skb: buffer to check
549 * @pri: priority for memory allocation
551 * If the socket buffer is a clone then this function creates a new
552 * copy of the data, drops a reference count on the old copy and returns
553 * the new copy with the reference count at 1. If the buffer is not a clone
554 * the original buffer is returned. When called with a spinlock held or
555 * from interrupt state @pri must be %GFP_ATOMIC
557 * %NULL is returned on a memory allocation failure.
559 static inline struct sk_buff *skb_unshare(struct sk_buff *skb,
562 might_sleep_if(pri & __GFP_WAIT);
563 if (skb_cloned(skb)) {
564 struct sk_buff *nskb = skb_copy(skb, pri);
565 kfree_skb(skb); /* Free our shared copy */
573 * @list_: list to peek at
575 * Peek an &sk_buff. Unlike most other operations you _MUST_
576 * be careful with this one. A peek leaves the buffer on the
577 * list and someone else may run off with it. You must hold
578 * the appropriate locks or have a private queue to do this.
580 * Returns %NULL for an empty list or a pointer to the head element.
581 * The reference count is not incremented and the reference is therefore
582 * volatile. Use with caution.
584 static inline struct sk_buff *skb_peek(struct sk_buff_head *list_)
586 struct sk_buff *list = ((struct sk_buff *)list_)->next;
587 if (list == (struct sk_buff *)list_)
594 * @list_: list to peek at
596 * Peek an &sk_buff. Unlike most other operations you _MUST_
597 * be careful with this one. A peek leaves the buffer on the
598 * list and someone else may run off with it. You must hold
599 * the appropriate locks or have a private queue to do this.
601 * Returns %NULL for an empty list or a pointer to the tail element.
602 * The reference count is not incremented and the reference is therefore
603 * volatile. Use with caution.
605 static inline struct sk_buff *skb_peek_tail(struct sk_buff_head *list_)
607 struct sk_buff *list = ((struct sk_buff *)list_)->prev;
608 if (list == (struct sk_buff *)list_)
614 * skb_queue_len - get queue length
615 * @list_: list to measure
617 * Return the length of an &sk_buff queue.
619 static inline __u32 skb_queue_len(const struct sk_buff_head *list_)
625 * This function creates a split out lock class for each invocation;
626 * this is needed for now since a whole lot of users of the skb-queue
627 * infrastructure in drivers have different locking usage (in hardirq)
628 * than the networking core (in softirq only). In the long run either the
629 * network layer or drivers should need annotation to consolidate the
630 * main types of usage into 3 classes.
632 static inline void skb_queue_head_init(struct sk_buff_head *list)
634 spin_lock_init(&list->lock);
635 list->prev = list->next = (struct sk_buff *)list;
639 static inline void skb_queue_head_init_class(struct sk_buff_head *list,
640 struct lock_class_key *class)
642 skb_queue_head_init(list);
643 lockdep_set_class(&list->lock, class);
647 * Insert an sk_buff at the start of a list.
649 * The "__skb_xxxx()" functions are the non-atomic ones that
650 * can only be called with interrupts disabled.
654 * __skb_queue_after - queue a buffer at the list head
656 * @prev: place after this buffer
657 * @newsk: buffer to queue
659 * Queue a buffer int the middle of a list. This function takes no locks
660 * and you must therefore hold required locks before calling it.
662 * A buffer cannot be placed on two lists at the same time.
664 static inline void __skb_queue_after(struct sk_buff_head *list,
665 struct sk_buff *prev,
666 struct sk_buff *newsk)
668 struct sk_buff *next;
674 next->prev = prev->next = newsk;
678 * __skb_queue_head - queue a buffer at the list head
680 * @newsk: buffer to queue
682 * Queue a buffer at the start of a list. This function takes no locks
683 * and you must therefore hold required locks before calling it.
685 * A buffer cannot be placed on two lists at the same time.
687 extern void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk);
688 static inline void __skb_queue_head(struct sk_buff_head *list,
689 struct sk_buff *newsk)
691 __skb_queue_after(list, (struct sk_buff *)list, newsk);
695 * __skb_queue_tail - queue a buffer at the list tail
697 * @newsk: buffer to queue
699 * Queue a buffer at the end of a list. This function takes no locks
700 * and you must therefore hold required locks before calling it.
702 * A buffer cannot be placed on two lists at the same time.
704 extern void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk);
705 static inline void __skb_queue_tail(struct sk_buff_head *list,
706 struct sk_buff *newsk)
708 struct sk_buff *prev, *next;
711 next = (struct sk_buff *)list;
715 next->prev = prev->next = newsk;
720 * __skb_dequeue - remove from the head of the queue
721 * @list: list to dequeue from
723 * Remove the head of the list. This function does not take any locks
724 * so must be used with appropriate locks held only. The head item is
725 * returned or %NULL if the list is empty.
727 extern struct sk_buff *skb_dequeue(struct sk_buff_head *list);
728 static inline struct sk_buff *__skb_dequeue(struct sk_buff_head *list)
730 struct sk_buff *next, *prev, *result;
732 prev = (struct sk_buff *) list;
741 result->next = result->prev = NULL;
748 * Insert a packet on a list.
750 extern void skb_insert(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list);
751 static inline void __skb_insert(struct sk_buff *newsk,
752 struct sk_buff *prev, struct sk_buff *next,
753 struct sk_buff_head *list)
757 next->prev = prev->next = newsk;
762 * Place a packet after a given packet in a list.
764 extern void skb_append(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list);
765 static inline void __skb_append(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list)
767 __skb_insert(newsk, old, old->next, list);
771 * remove sk_buff from list. _Must_ be called atomically, and with
774 extern void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list);
775 static inline void __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
777 struct sk_buff *next, *prev;
782 skb->next = skb->prev = NULL;
788 /* XXX: more streamlined implementation */
791 * __skb_dequeue_tail - remove from the tail of the queue
792 * @list: list to dequeue from
794 * Remove the tail of the list. This function does not take any locks
795 * so must be used with appropriate locks held only. The tail item is
796 * returned or %NULL if the list is empty.
798 extern struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list);
799 static inline struct sk_buff *__skb_dequeue_tail(struct sk_buff_head *list)
801 struct sk_buff *skb = skb_peek_tail(list);
803 __skb_unlink(skb, list);
808 static inline int skb_is_nonlinear(const struct sk_buff *skb)
810 return skb->data_len;
813 static inline unsigned int skb_headlen(const struct sk_buff *skb)
815 return skb->len - skb->data_len;
818 static inline int skb_pagelen(const struct sk_buff *skb)
822 for (i = (int)skb_shinfo(skb)->nr_frags - 1; i >= 0; i--)
823 len += skb_shinfo(skb)->frags[i].size;
824 return len + skb_headlen(skb);
827 static inline void skb_fill_page_desc(struct sk_buff *skb, int i,
828 struct page *page, int off, int size)
830 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
833 frag->page_offset = off;
835 skb_shinfo(skb)->nr_frags = i + 1;
838 #define SKB_PAGE_ASSERT(skb) BUG_ON(skb_shinfo(skb)->nr_frags)
839 #define SKB_FRAG_ASSERT(skb) BUG_ON(skb_shinfo(skb)->frag_list)
840 #define SKB_LINEAR_ASSERT(skb) BUG_ON(skb_is_nonlinear(skb))
842 #ifdef NET_SKBUFF_DATA_USES_OFFSET
843 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
845 return skb->head + skb->tail;
848 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
850 skb->tail = skb->data - skb->head;
853 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
855 skb_reset_tail_pointer(skb);
858 #else /* NET_SKBUFF_DATA_USES_OFFSET */
859 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
864 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
866 skb->tail = skb->data;
869 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
871 skb->tail = skb->data + offset;
874 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
877 * Add data to an sk_buff
879 static inline unsigned char *__skb_put(struct sk_buff *skb, unsigned int len)
881 unsigned char *tmp = skb_tail_pointer(skb);
882 SKB_LINEAR_ASSERT(skb);
889 * skb_put - add data to a buffer
890 * @skb: buffer to use
891 * @len: amount of data to add
893 * This function extends the used data area of the buffer. If this would
894 * exceed the total buffer size the kernel will panic. A pointer to the
895 * first byte of the extra data is returned.
897 static inline unsigned char *skb_put(struct sk_buff *skb, unsigned int len)
899 unsigned char *tmp = skb_tail_pointer(skb);
900 SKB_LINEAR_ASSERT(skb);
903 if (unlikely(skb->tail > skb->end))
904 skb_over_panic(skb, len, current_text_addr());
908 static inline unsigned char *__skb_push(struct sk_buff *skb, unsigned int len)
916 * skb_push - add data to the start of a buffer
917 * @skb: buffer to use
918 * @len: amount of data to add
920 * This function extends the used data area of the buffer at the buffer
921 * start. If this would exceed the total buffer headroom the kernel will
922 * panic. A pointer to the first byte of the extra data is returned.
924 static inline unsigned char *skb_push(struct sk_buff *skb, unsigned int len)
928 if (unlikely(skb->data<skb->head))
929 skb_under_panic(skb, len, current_text_addr());
933 static inline unsigned char *__skb_pull(struct sk_buff *skb, unsigned int len)
936 BUG_ON(skb->len < skb->data_len);
937 return skb->data += len;
941 * skb_pull - remove data from the start of a buffer
942 * @skb: buffer to use
943 * @len: amount of data to remove
945 * This function removes data from the start of a buffer, returning
946 * the memory to the headroom. A pointer to the next data in the buffer
947 * is returned. Once the data has been pulled future pushes will overwrite
950 static inline unsigned char *skb_pull(struct sk_buff *skb, unsigned int len)
952 return unlikely(len > skb->len) ? NULL : __skb_pull(skb, len);
955 extern unsigned char *__pskb_pull_tail(struct sk_buff *skb, int delta);
957 static inline unsigned char *__pskb_pull(struct sk_buff *skb, unsigned int len)
959 if (len > skb_headlen(skb) &&
960 !__pskb_pull_tail(skb, len-skb_headlen(skb)))
963 return skb->data += len;
966 static inline unsigned char *pskb_pull(struct sk_buff *skb, unsigned int len)
968 return unlikely(len > skb->len) ? NULL : __pskb_pull(skb, len);
971 static inline int pskb_may_pull(struct sk_buff *skb, unsigned int len)
973 if (likely(len <= skb_headlen(skb)))
975 if (unlikely(len > skb->len))
977 return __pskb_pull_tail(skb, len-skb_headlen(skb)) != NULL;
981 * skb_headroom - bytes at buffer head
982 * @skb: buffer to check
984 * Return the number of bytes of free space at the head of an &sk_buff.
986 static inline int skb_headroom(const struct sk_buff *skb)
988 return skb->data - skb->head;
992 * skb_tailroom - bytes at buffer end
993 * @skb: buffer to check
995 * Return the number of bytes of free space at the tail of an sk_buff
997 static inline int skb_tailroom(const struct sk_buff *skb)
999 return skb_is_nonlinear(skb) ? 0 : skb->end - skb->tail;
1003 * skb_reserve - adjust headroom
1004 * @skb: buffer to alter
1005 * @len: bytes to move
1007 * Increase the headroom of an empty &sk_buff by reducing the tail
1008 * room. This is only allowed for an empty buffer.
1010 static inline void skb_reserve(struct sk_buff *skb, int len)
1016 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1017 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
1019 return skb->head + skb->transport_header;
1022 static inline void skb_reset_transport_header(struct sk_buff *skb)
1024 skb->transport_header = skb->data - skb->head;
1027 static inline void skb_set_transport_header(struct sk_buff *skb,
1030 skb_reset_transport_header(skb);
1031 skb->transport_header += offset;
1034 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
1036 return skb->head + skb->network_header;
1039 static inline void skb_reset_network_header(struct sk_buff *skb)
1041 skb->network_header = skb->data - skb->head;
1044 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1046 skb_reset_network_header(skb);
1047 skb->network_header += offset;
1050 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1052 return skb->head + skb->mac_header;
1055 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1057 return skb->mac_header != ~0U;
1060 static inline void skb_reset_mac_header(struct sk_buff *skb)
1062 skb->mac_header = skb->data - skb->head;
1065 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1067 skb_reset_mac_header(skb);
1068 skb->mac_header += offset;
1071 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1073 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
1075 return skb->transport_header;
1078 static inline void skb_reset_transport_header(struct sk_buff *skb)
1080 skb->transport_header = skb->data;
1083 static inline void skb_set_transport_header(struct sk_buff *skb,
1086 skb->transport_header = skb->data + offset;
1089 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
1091 return skb->network_header;
1094 static inline void skb_reset_network_header(struct sk_buff *skb)
1096 skb->network_header = skb->data;
1099 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1101 skb->network_header = skb->data + offset;
1104 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1106 return skb->mac_header;
1109 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1111 return skb->mac_header != NULL;
1114 static inline void skb_reset_mac_header(struct sk_buff *skb)
1116 skb->mac_header = skb->data;
1119 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1121 skb->mac_header = skb->data + offset;
1123 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1125 static inline int skb_transport_offset(const struct sk_buff *skb)
1127 return skb_transport_header(skb) - skb->data;
1130 static inline u32 skb_network_header_len(const struct sk_buff *skb)
1132 return skb->transport_header - skb->network_header;
1135 static inline int skb_network_offset(const struct sk_buff *skb)
1137 return skb_network_header(skb) - skb->data;
1141 * CPUs often take a performance hit when accessing unaligned memory
1142 * locations. The actual performance hit varies, it can be small if the
1143 * hardware handles it or large if we have to take an exception and fix it
1146 * Since an ethernet header is 14 bytes network drivers often end up with
1147 * the IP header at an unaligned offset. The IP header can be aligned by
1148 * shifting the start of the packet by 2 bytes. Drivers should do this
1151 * skb_reserve(NET_IP_ALIGN);
1153 * The downside to this alignment of the IP header is that the DMA is now
1154 * unaligned. On some architectures the cost of an unaligned DMA is high
1155 * and this cost outweighs the gains made by aligning the IP header.
1157 * Since this trade off varies between architectures, we allow NET_IP_ALIGN
1160 #ifndef NET_IP_ALIGN
1161 #define NET_IP_ALIGN 2
1165 * The networking layer reserves some headroom in skb data (via
1166 * dev_alloc_skb). This is used to avoid having to reallocate skb data when
1167 * the header has to grow. In the default case, if the header has to grow
1168 * 16 bytes or less we avoid the reallocation.
1170 * Unfortunately this headroom changes the DMA alignment of the resulting
1171 * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive
1172 * on some architectures. An architecture can override this value,
1173 * perhaps setting it to a cacheline in size (since that will maintain
1174 * cacheline alignment of the DMA). It must be a power of 2.
1176 * Various parts of the networking layer expect at least 16 bytes of
1177 * headroom, you should not reduce this.
1180 #define NET_SKB_PAD 16
1183 extern int ___pskb_trim(struct sk_buff *skb, unsigned int len);
1185 static inline void __skb_trim(struct sk_buff *skb, unsigned int len)
1187 if (unlikely(skb->data_len)) {
1192 skb_set_tail_pointer(skb, len);
1196 * skb_trim - remove end from a buffer
1197 * @skb: buffer to alter
1200 * Cut the length of a buffer down by removing data from the tail. If
1201 * the buffer is already under the length specified it is not modified.
1202 * The skb must be linear.
1204 static inline void skb_trim(struct sk_buff *skb, unsigned int len)
1207 __skb_trim(skb, len);
1211 static inline int __pskb_trim(struct sk_buff *skb, unsigned int len)
1214 return ___pskb_trim(skb, len);
1215 __skb_trim(skb, len);
1219 static inline int pskb_trim(struct sk_buff *skb, unsigned int len)
1221 return (len < skb->len) ? __pskb_trim(skb, len) : 0;
1225 * pskb_trim_unique - remove end from a paged unique (not cloned) buffer
1226 * @skb: buffer to alter
1229 * This is identical to pskb_trim except that the caller knows that
1230 * the skb is not cloned so we should never get an error due to out-
1233 static inline void pskb_trim_unique(struct sk_buff *skb, unsigned int len)
1235 int err = pskb_trim(skb, len);
1240 * skb_orphan - orphan a buffer
1241 * @skb: buffer to orphan
1243 * If a buffer currently has an owner then we call the owner's
1244 * destructor function and make the @skb unowned. The buffer continues
1245 * to exist but is no longer charged to its former owner.
1247 static inline void skb_orphan(struct sk_buff *skb)
1249 if (skb->destructor)
1250 skb->destructor(skb);
1251 skb->destructor = NULL;
1256 * __skb_queue_purge - empty a list
1257 * @list: list to empty
1259 * Delete all buffers on an &sk_buff list. Each buffer is removed from
1260 * the list and one reference dropped. This function does not take the
1261 * list lock and the caller must hold the relevant locks to use it.
1263 extern void skb_queue_purge(struct sk_buff_head *list);
1264 static inline void __skb_queue_purge(struct sk_buff_head *list)
1266 struct sk_buff *skb;
1267 while ((skb = __skb_dequeue(list)) != NULL)
1272 * __dev_alloc_skb - allocate an skbuff for receiving
1273 * @length: length to allocate
1274 * @gfp_mask: get_free_pages mask, passed to alloc_skb
1276 * Allocate a new &sk_buff and assign it a usage count of one. The
1277 * buffer has unspecified headroom built in. Users should allocate
1278 * the headroom they think they need without accounting for the
1279 * built in space. The built in space is used for optimisations.
1281 * %NULL is returned if there is no free memory.
1283 static inline struct sk_buff *__dev_alloc_skb(unsigned int length,
1286 struct sk_buff *skb = alloc_skb(length + NET_SKB_PAD, gfp_mask);
1288 skb_reserve(skb, NET_SKB_PAD);
1293 * dev_alloc_skb - allocate an skbuff for receiving
1294 * @length: length to allocate
1296 * Allocate a new &sk_buff and assign it a usage count of one. The
1297 * buffer has unspecified headroom built in. Users should allocate
1298 * the headroom they think they need without accounting for the
1299 * built in space. The built in space is used for optimisations.
1301 * %NULL is returned if there is no free memory. Although this function
1302 * allocates memory it can be called from an interrupt.
1304 static inline struct sk_buff *dev_alloc_skb(unsigned int length)
1306 return __dev_alloc_skb(length, GFP_ATOMIC);
1309 extern struct sk_buff *__netdev_alloc_skb(struct net_device *dev,
1310 unsigned int length, gfp_t gfp_mask);
1313 * netdev_alloc_skb - allocate an skbuff for rx on a specific device
1314 * @dev: network device to receive on
1315 * @length: length to allocate
1317 * Allocate a new &sk_buff and assign it a usage count of one. The
1318 * buffer has unspecified headroom built in. Users should allocate
1319 * the headroom they think they need without accounting for the
1320 * built in space. The built in space is used for optimisations.
1322 * %NULL is returned if there is no free memory. Although this function
1323 * allocates memory it can be called from an interrupt.
1325 static inline struct sk_buff *netdev_alloc_skb(struct net_device *dev,
1326 unsigned int length)
1328 return __netdev_alloc_skb(dev, length, GFP_ATOMIC);
1332 * skb_clone_writable - is the header of a clone writable
1333 * @skb: buffer to check
1334 * @len: length up to which to write
1336 * Returns true if modifying the header part of the cloned buffer
1337 * does not requires the data to be copied.
1339 static inline int skb_clone_writable(struct sk_buff *skb, int len)
1341 return !skb_header_cloned(skb) &&
1342 skb_headroom(skb) + len <= skb->hdr_len;
1346 * skb_cow - copy header of skb when it is required
1347 * @skb: buffer to cow
1348 * @headroom: needed headroom
1350 * If the skb passed lacks sufficient headroom or its data part
1351 * is shared, data is reallocated. If reallocation fails, an error
1352 * is returned and original skb is not changed.
1354 * The result is skb with writable area skb->head...skb->tail
1355 * and at least @headroom of space at head.
1357 static inline int skb_cow(struct sk_buff *skb, unsigned int headroom)
1359 int delta = (headroom > NET_SKB_PAD ? headroom : NET_SKB_PAD) -
1365 if (delta || skb_cloned(skb))
1366 return pskb_expand_head(skb, (delta + (NET_SKB_PAD-1)) &
1367 ~(NET_SKB_PAD-1), 0, GFP_ATOMIC);
1372 * skb_padto - pad an skbuff up to a minimal size
1373 * @skb: buffer to pad
1374 * @len: minimal length
1376 * Pads up a buffer to ensure the trailing bytes exist and are
1377 * blanked. If the buffer already contains sufficient data it
1378 * is untouched. Otherwise it is extended. Returns zero on
1379 * success. The skb is freed on error.
1382 static inline int skb_padto(struct sk_buff *skb, unsigned int len)
1384 unsigned int size = skb->len;
1385 if (likely(size >= len))
1387 return skb_pad(skb, len-size);
1390 static inline int skb_add_data(struct sk_buff *skb,
1391 char __user *from, int copy)
1393 const int off = skb->len;
1395 if (skb->ip_summed == CHECKSUM_NONE) {
1397 __wsum csum = csum_and_copy_from_user(from, skb_put(skb, copy),
1400 skb->csum = csum_block_add(skb->csum, csum, off);
1403 } else if (!copy_from_user(skb_put(skb, copy), from, copy))
1406 __skb_trim(skb, off);
1410 static inline int skb_can_coalesce(struct sk_buff *skb, int i,
1411 struct page *page, int off)
1414 struct skb_frag_struct *frag = &skb_shinfo(skb)->frags[i - 1];
1416 return page == frag->page &&
1417 off == frag->page_offset + frag->size;
1422 static inline int __skb_linearize(struct sk_buff *skb)
1424 return __pskb_pull_tail(skb, skb->data_len) ? 0 : -ENOMEM;
1428 * skb_linearize - convert paged skb to linear one
1429 * @skb: buffer to linarize
1431 * If there is no free memory -ENOMEM is returned, otherwise zero
1432 * is returned and the old skb data released.
1434 static inline int skb_linearize(struct sk_buff *skb)
1436 return skb_is_nonlinear(skb) ? __skb_linearize(skb) : 0;
1440 * skb_linearize_cow - make sure skb is linear and writable
1441 * @skb: buffer to process
1443 * If there is no free memory -ENOMEM is returned, otherwise zero
1444 * is returned and the old skb data released.
1446 static inline int skb_linearize_cow(struct sk_buff *skb)
1448 return skb_is_nonlinear(skb) || skb_cloned(skb) ?
1449 __skb_linearize(skb) : 0;
1453 * skb_postpull_rcsum - update checksum for received skb after pull
1454 * @skb: buffer to update
1455 * @start: start of data before pull
1456 * @len: length of data pulled
1458 * After doing a pull on a received packet, you need to call this to
1459 * update the CHECKSUM_COMPLETE checksum, or set ip_summed to
1460 * CHECKSUM_NONE so that it can be recomputed from scratch.
1463 static inline void skb_postpull_rcsum(struct sk_buff *skb,
1464 const void *start, unsigned int len)
1466 if (skb->ip_summed == CHECKSUM_COMPLETE)
1467 skb->csum = csum_sub(skb->csum, csum_partial(start, len, 0));
1470 unsigned char *skb_pull_rcsum(struct sk_buff *skb, unsigned int len);
1473 * pskb_trim_rcsum - trim received skb and update checksum
1474 * @skb: buffer to trim
1477 * This is exactly the same as pskb_trim except that it ensures the
1478 * checksum of received packets are still valid after the operation.
1481 static inline int pskb_trim_rcsum(struct sk_buff *skb, unsigned int len)
1483 if (likely(len >= skb->len))
1485 if (skb->ip_summed == CHECKSUM_COMPLETE)
1486 skb->ip_summed = CHECKSUM_NONE;
1487 return __pskb_trim(skb, len);
1490 #define skb_queue_walk(queue, skb) \
1491 for (skb = (queue)->next; \
1492 prefetch(skb->next), (skb != (struct sk_buff *)(queue)); \
1495 #define skb_queue_walk_safe(queue, skb, tmp) \
1496 for (skb = (queue)->next, tmp = skb->next; \
1497 skb != (struct sk_buff *)(queue); \
1498 skb = tmp, tmp = skb->next)
1500 #define skb_queue_reverse_walk(queue, skb) \
1501 for (skb = (queue)->prev; \
1502 prefetch(skb->prev), (skb != (struct sk_buff *)(queue)); \
1506 extern struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags,
1507 int noblock, int *err);
1508 extern unsigned int datagram_poll(struct file *file, struct socket *sock,
1509 struct poll_table_struct *wait);
1510 extern int skb_copy_datagram_iovec(const struct sk_buff *from,
1511 int offset, struct iovec *to,
1513 extern int skb_copy_and_csum_datagram_iovec(struct sk_buff *skb,
1516 extern void skb_free_datagram(struct sock *sk, struct sk_buff *skb);
1517 extern void skb_kill_datagram(struct sock *sk, struct sk_buff *skb,
1518 unsigned int flags);
1519 extern __wsum skb_checksum(const struct sk_buff *skb, int offset,
1520 int len, __wsum csum);
1521 extern int skb_copy_bits(const struct sk_buff *skb, int offset,
1523 extern int skb_store_bits(struct sk_buff *skb, int offset,
1524 const void *from, int len);
1525 extern __wsum skb_copy_and_csum_bits(const struct sk_buff *skb,
1526 int offset, u8 *to, int len,
1528 extern void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to);
1529 extern void skb_split(struct sk_buff *skb,
1530 struct sk_buff *skb1, const u32 len);
1532 extern struct sk_buff *skb_segment(struct sk_buff *skb, int features);
1534 static inline void *skb_header_pointer(const struct sk_buff *skb, int offset,
1535 int len, void *buffer)
1537 int hlen = skb_headlen(skb);
1539 if (hlen - offset >= len)
1540 return skb->data + offset;
1542 if (skb_copy_bits(skb, offset, buffer, len) < 0)
1548 static inline void skb_copy_from_linear_data(const struct sk_buff *skb,
1550 const unsigned int len)
1552 memcpy(to, skb->data, len);
1555 static inline void skb_copy_from_linear_data_offset(const struct sk_buff *skb,
1556 const int offset, void *to,
1557 const unsigned int len)
1559 memcpy(to, skb->data + offset, len);
1562 static inline void skb_copy_to_linear_data(struct sk_buff *skb,
1564 const unsigned int len)
1566 memcpy(skb->data, from, len);
1569 static inline void skb_copy_to_linear_data_offset(struct sk_buff *skb,
1572 const unsigned int len)
1574 memcpy(skb->data + offset, from, len);
1577 extern void skb_init(void);
1580 * skb_get_timestamp - get timestamp from a skb
1581 * @skb: skb to get stamp from
1582 * @stamp: pointer to struct timeval to store stamp in
1584 * Timestamps are stored in the skb as offsets to a base timestamp.
1585 * This function converts the offset back to a struct timeval and stores
1588 static inline void skb_get_timestamp(const struct sk_buff *skb, struct timeval *stamp)
1590 *stamp = ktime_to_timeval(skb->tstamp);
1593 static inline void __net_timestamp(struct sk_buff *skb)
1595 skb->tstamp = ktime_get_real();
1598 static inline ktime_t net_timedelta(ktime_t t)
1600 return ktime_sub(ktime_get_real(), t);
1603 static inline ktime_t net_invalid_timestamp(void)
1605 return ktime_set(0, 0);
1608 extern __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len);
1609 extern __sum16 __skb_checksum_complete(struct sk_buff *skb);
1611 static inline int skb_csum_unnecessary(const struct sk_buff *skb)
1613 return skb->ip_summed & CHECKSUM_UNNECESSARY;
1617 * skb_checksum_complete - Calculate checksum of an entire packet
1618 * @skb: packet to process
1620 * This function calculates the checksum over the entire packet plus
1621 * the value of skb->csum. The latter can be used to supply the
1622 * checksum of a pseudo header as used by TCP/UDP. It returns the
1625 * For protocols that contain complete checksums such as ICMP/TCP/UDP,
1626 * this function can be used to verify that checksum on received
1627 * packets. In that case the function should return zero if the
1628 * checksum is correct. In particular, this function will return zero
1629 * if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the
1630 * hardware has already verified the correctness of the checksum.
1632 static inline unsigned int skb_checksum_complete(struct sk_buff *skb)
1634 return skb_csum_unnecessary(skb) ?
1635 0 : __skb_checksum_complete(skb);
1638 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1639 extern void nf_conntrack_destroy(struct nf_conntrack *nfct);
1640 static inline void nf_conntrack_put(struct nf_conntrack *nfct)
1642 if (nfct && atomic_dec_and_test(&nfct->use))
1643 nf_conntrack_destroy(nfct);
1645 static inline void nf_conntrack_get(struct nf_conntrack *nfct)
1648 atomic_inc(&nfct->use);
1650 static inline void nf_conntrack_get_reasm(struct sk_buff *skb)
1653 atomic_inc(&skb->users);
1655 static inline void nf_conntrack_put_reasm(struct sk_buff *skb)
1661 #ifdef CONFIG_BRIDGE_NETFILTER
1662 static inline void nf_bridge_put(struct nf_bridge_info *nf_bridge)
1664 if (nf_bridge && atomic_dec_and_test(&nf_bridge->use))
1667 static inline void nf_bridge_get(struct nf_bridge_info *nf_bridge)
1670 atomic_inc(&nf_bridge->use);
1672 #endif /* CONFIG_BRIDGE_NETFILTER */
1673 static inline void nf_reset(struct sk_buff *skb)
1675 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1676 nf_conntrack_put(skb->nfct);
1678 nf_conntrack_put_reasm(skb->nfct_reasm);
1679 skb->nfct_reasm = NULL;
1681 #ifdef CONFIG_BRIDGE_NETFILTER
1682 nf_bridge_put(skb->nf_bridge);
1683 skb->nf_bridge = NULL;
1687 /* Note: This doesn't put any conntrack and bridge info in dst. */
1688 static inline void __nf_copy(struct sk_buff *dst, const struct sk_buff *src)
1690 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1691 dst->nfct = src->nfct;
1692 nf_conntrack_get(src->nfct);
1693 dst->nfctinfo = src->nfctinfo;
1694 dst->nfct_reasm = src->nfct_reasm;
1695 nf_conntrack_get_reasm(src->nfct_reasm);
1697 #ifdef CONFIG_BRIDGE_NETFILTER
1698 dst->nf_bridge = src->nf_bridge;
1699 nf_bridge_get(src->nf_bridge);
1703 static inline void nf_copy(struct sk_buff *dst, const struct sk_buff *src)
1705 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1706 nf_conntrack_put(dst->nfct);
1707 nf_conntrack_put_reasm(dst->nfct_reasm);
1709 #ifdef CONFIG_BRIDGE_NETFILTER
1710 nf_bridge_put(dst->nf_bridge);
1712 __nf_copy(dst, src);
1715 #ifdef CONFIG_NETWORK_SECMARK
1716 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
1718 to->secmark = from->secmark;
1721 static inline void skb_init_secmark(struct sk_buff *skb)
1726 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
1729 static inline void skb_init_secmark(struct sk_buff *skb)
1733 static inline void skb_set_queue_mapping(struct sk_buff *skb, u16 queue_mapping)
1735 #ifdef CONFIG_NETDEVICES_MULTIQUEUE
1736 skb->queue_mapping = queue_mapping;
1740 static inline void skb_copy_queue_mapping(struct sk_buff *to, const struct sk_buff *from)
1742 #ifdef CONFIG_NETDEVICES_MULTIQUEUE
1743 to->queue_mapping = from->queue_mapping;
1747 static inline int skb_is_gso(const struct sk_buff *skb)
1749 return skb_shinfo(skb)->gso_size;
1752 static inline void skb_forward_csum(struct sk_buff *skb)
1754 /* Unfortunately we don't support this one. Any brave souls? */
1755 if (skb->ip_summed == CHECKSUM_COMPLETE)
1756 skb->ip_summed = CHECKSUM_NONE;
1759 #endif /* __KERNEL__ */
1760 #endif /* _LINUX_SKBUFF_H */