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) - SKB_DATA_ALIGN(sizeof(struct skb_shared_info)))
45 #define SKB_MAX_ORDER(X, ORDER) \
46 SKB_WITH_OVERHEAD((PAGE_SIZE << (ORDER)) - (X))
47 #define SKB_MAX_HEAD(X) (SKB_MAX_ORDER((X), 0))
48 #define SKB_MAX_ALLOC (SKB_MAX_ORDER(0, 2))
50 /* A. Checksumming of received packets by device.
52 * NONE: device failed to checksum this packet.
53 * skb->csum is undefined.
55 * UNNECESSARY: device parsed packet and wouldbe verified checksum.
56 * skb->csum is undefined.
57 * It is bad option, but, unfortunately, many of vendors do this.
58 * Apparently with secret goal to sell you new device, when you
59 * will add new protocol to your host. F.e. IPv6. 8)
61 * COMPLETE: the most generic way. Device supplied checksum of _all_
62 * the packet as seen by netif_rx in skb->csum.
63 * NOTE: Even if device supports only some protocols, but
64 * is able to produce some skb->csum, it MUST use COMPLETE,
67 * PARTIAL: identical to the case for output below. This may occur
68 * on a packet received directly from another Linux OS, e.g.,
69 * a virtualised Linux kernel on the same host. The packet can
70 * be treated in the same way as UNNECESSARY except that on
71 * output (i.e., forwarding) the checksum must be filled in
72 * by the OS or the hardware.
74 * B. Checksumming on output.
76 * NONE: skb is checksummed by protocol or csum is not required.
78 * PARTIAL: device is required to csum packet as seen by hard_start_xmit
79 * from skb->csum_start to the end and to record the checksum
80 * at skb->csum_start + skb->csum_offset.
82 * Device must show its capabilities in dev->features, set
83 * at device setup time.
84 * NETIF_F_HW_CSUM - it is clever device, it is able to checksum
86 * NETIF_F_NO_CSUM - loopback or reliable single hop media.
87 * NETIF_F_IP_CSUM - device is dumb. It is able to csum only
88 * TCP/UDP over IPv4. Sigh. Vendors like this
89 * way by an unknown reason. Though, see comment above
90 * about CHECKSUM_UNNECESSARY. 8)
91 * NETIF_F_IPV6_CSUM about as dumb as the last one but does IPv6 instead.
93 * Any questions? No questions, good. --ANK
98 struct pipe_inode_info;
100 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
101 struct nf_conntrack {
106 #ifdef CONFIG_BRIDGE_NETFILTER
107 struct nf_bridge_info {
109 struct net_device *physindev;
110 struct net_device *physoutdev;
112 unsigned long data[32 / sizeof(unsigned long)];
116 struct sk_buff_head {
117 /* These two members must be first. */
118 struct sk_buff *next;
119 struct sk_buff *prev;
127 /* To allow 64K frame to be packed as single skb without frag_list */
128 #define MAX_SKB_FRAGS (65536/PAGE_SIZE + 2)
130 typedef struct skb_frag_struct skb_frag_t;
132 struct skb_frag_struct {
138 /* This data is invariant across clones and lives at
139 * the end of the header data, ie. at skb->end.
141 struct skb_shared_info {
143 unsigned short nr_frags;
144 unsigned short gso_size;
145 /* Warning: this field is not always filled in (UFO)! */
146 unsigned short gso_segs;
147 unsigned short gso_type;
149 #ifdef CONFIG_HAS_DMA
150 unsigned int num_dma_maps;
152 struct sk_buff *frag_list;
153 skb_frag_t frags[MAX_SKB_FRAGS];
154 #ifdef CONFIG_HAS_DMA
155 dma_addr_t dma_maps[MAX_SKB_FRAGS + 1];
159 /* We divide dataref into two halves. The higher 16 bits hold references
160 * to the payload part of skb->data. The lower 16 bits hold references to
161 * the entire skb->data. A clone of a headerless skb holds the length of
162 * the header in skb->hdr_len.
164 * All users must obey the rule that the skb->data reference count must be
165 * greater than or equal to the payload reference count.
167 * Holding a reference to the payload part means that the user does not
168 * care about modifications to the header part of skb->data.
170 #define SKB_DATAREF_SHIFT 16
171 #define SKB_DATAREF_MASK ((1 << SKB_DATAREF_SHIFT) - 1)
175 SKB_FCLONE_UNAVAILABLE,
181 SKB_GSO_TCPV4 = 1 << 0,
182 SKB_GSO_UDP = 1 << 1,
184 /* This indicates the skb is from an untrusted source. */
185 SKB_GSO_DODGY = 1 << 2,
187 /* This indicates the tcp segment has CWR set. */
188 SKB_GSO_TCP_ECN = 1 << 3,
190 SKB_GSO_TCPV6 = 1 << 4,
193 #if BITS_PER_LONG > 32
194 #define NET_SKBUFF_DATA_USES_OFFSET 1
197 #ifdef NET_SKBUFF_DATA_USES_OFFSET
198 typedef unsigned int sk_buff_data_t;
200 typedef unsigned char *sk_buff_data_t;
204 * struct sk_buff - socket buffer
205 * @next: Next buffer in list
206 * @prev: Previous buffer in list
207 * @sk: Socket we are owned by
208 * @tstamp: Time we arrived
209 * @dev: Device we arrived on/are leaving by
210 * @transport_header: Transport layer header
211 * @network_header: Network layer header
212 * @mac_header: Link layer header
213 * @dst: destination entry
214 * @sp: the security path, used for xfrm
215 * @cb: Control buffer. Free for use by every layer. Put private vars here
216 * @len: Length of actual data
217 * @data_len: Data length
218 * @mac_len: Length of link layer header
219 * @hdr_len: writable header length of cloned skb
220 * @csum: Checksum (must include start/offset pair)
221 * @csum_start: Offset from skb->head where checksumming should start
222 * @csum_offset: Offset from csum_start where checksum should be stored
223 * @local_df: allow local fragmentation
224 * @cloned: Head may be cloned (check refcnt to be sure)
225 * @nohdr: Payload reference only, must not modify header
226 * @pkt_type: Packet class
227 * @fclone: skbuff clone status
228 * @ip_summed: Driver fed us an IP checksum
229 * @priority: Packet queueing priority
230 * @users: User count - see {datagram,tcp}.c
231 * @protocol: Packet protocol from driver
232 * @truesize: Buffer size
233 * @head: Head of buffer
234 * @data: Data head pointer
235 * @tail: Tail pointer
237 * @destructor: Destruct function
238 * @mark: Generic packet mark
239 * @nfct: Associated connection, if any
240 * @ipvs_property: skbuff is owned by ipvs
241 * @peeked: this packet has been seen already, so stats have been
242 * done for it, don't do them again
243 * @nf_trace: netfilter packet trace flag
244 * @nfctinfo: Relationship of this skb to the connection
245 * @nfct_reasm: netfilter conntrack re-assembly pointer
246 * @nf_bridge: Saved data about a bridged frame - see br_netfilter.c
247 * @iif: ifindex of device we arrived on
248 * @queue_mapping: Queue mapping for multiqueue devices
249 * @tc_index: Traffic control index
250 * @tc_verd: traffic control verdict
251 * @ndisc_nodetype: router type (from link layer)
252 * @do_not_encrypt: set to prevent encryption of this frame
253 * @dma_cookie: a cookie to one of several possible DMA operations
254 * done by skb DMA functions
255 * @secmark: security marking
256 * @vlan_tci: vlan tag control information
260 /* These two members must be first. */
261 struct sk_buff *next;
262 struct sk_buff *prev;
266 struct net_device *dev;
269 struct dst_entry *dst;
270 struct rtable *rtable;
275 * This is the control buffer. It is free to use for every
276 * layer. Please put your private variables there. If you
277 * want to keep them across layers you have to do a skb_clone()
278 * first. This is owned by whoever has the skb queued ATM.
306 void (*destructor)(struct sk_buff *skb);
307 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
308 struct nf_conntrack *nfct;
309 struct sk_buff *nfct_reasm;
311 #ifdef CONFIG_BRIDGE_NETFILTER
312 struct nf_bridge_info *nf_bridge;
317 #ifdef CONFIG_NET_SCHED
318 __u16 tc_index; /* traffic control index */
319 #ifdef CONFIG_NET_CLS_ACT
320 __u16 tc_verd; /* traffic control verdict */
323 #ifdef CONFIG_IPV6_NDISC_NODETYPE
324 __u8 ndisc_nodetype:2;
326 #if defined(CONFIG_MAC80211) || defined(CONFIG_MAC80211_MODULE)
327 __u8 do_not_encrypt:1;
329 /* 0/13/14 bit hole */
331 #ifdef CONFIG_NET_DMA
332 dma_cookie_t dma_cookie;
334 #ifdef CONFIG_NETWORK_SECMARK
342 sk_buff_data_t transport_header;
343 sk_buff_data_t network_header;
344 sk_buff_data_t mac_header;
345 /* These elements must be at the end, see alloc_skb() for details. */
350 unsigned int truesize;
356 * Handling routines are only of interest to the kernel
358 #include <linux/slab.h>
360 #include <asm/system.h>
362 extern void kfree_skb(struct sk_buff *skb);
363 extern void __kfree_skb(struct sk_buff *skb);
364 extern struct sk_buff *__alloc_skb(unsigned int size,
365 gfp_t priority, int fclone, int node);
366 static inline struct sk_buff *alloc_skb(unsigned int size,
369 return __alloc_skb(size, priority, 0, -1);
372 static inline struct sk_buff *alloc_skb_fclone(unsigned int size,
375 return __alloc_skb(size, priority, 1, -1);
378 extern struct sk_buff *skb_morph(struct sk_buff *dst, struct sk_buff *src);
379 extern struct sk_buff *skb_clone(struct sk_buff *skb,
381 extern struct sk_buff *skb_copy(const struct sk_buff *skb,
383 extern struct sk_buff *pskb_copy(struct sk_buff *skb,
385 extern int pskb_expand_head(struct sk_buff *skb,
386 int nhead, int ntail,
388 extern struct sk_buff *skb_realloc_headroom(struct sk_buff *skb,
389 unsigned int headroom);
390 extern struct sk_buff *skb_copy_expand(const struct sk_buff *skb,
391 int newheadroom, int newtailroom,
393 extern int skb_to_sgvec(struct sk_buff *skb,
394 struct scatterlist *sg, int offset,
396 extern int skb_cow_data(struct sk_buff *skb, int tailbits,
397 struct sk_buff **trailer);
398 extern int skb_pad(struct sk_buff *skb, int pad);
399 #define dev_kfree_skb(a) kfree_skb(a)
400 extern void skb_over_panic(struct sk_buff *skb, int len,
402 extern void skb_under_panic(struct sk_buff *skb, int len,
404 extern void skb_truesize_bug(struct sk_buff *skb);
406 static inline void skb_truesize_check(struct sk_buff *skb)
408 int len = sizeof(struct sk_buff) + skb->len;
410 if (unlikely((int)skb->truesize < len))
411 skb_truesize_bug(skb);
414 extern int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb,
415 int getfrag(void *from, char *to, int offset,
416 int len,int odd, struct sk_buff *skb),
417 void *from, int length);
424 __u32 stepped_offset;
425 struct sk_buff *root_skb;
426 struct sk_buff *cur_skb;
430 extern void skb_prepare_seq_read(struct sk_buff *skb,
431 unsigned int from, unsigned int to,
432 struct skb_seq_state *st);
433 extern unsigned int skb_seq_read(unsigned int consumed, const u8 **data,
434 struct skb_seq_state *st);
435 extern void skb_abort_seq_read(struct skb_seq_state *st);
437 extern unsigned int skb_find_text(struct sk_buff *skb, unsigned int from,
438 unsigned int to, struct ts_config *config,
439 struct ts_state *state);
441 #ifdef NET_SKBUFF_DATA_USES_OFFSET
442 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
444 return skb->head + skb->end;
447 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
454 #define skb_shinfo(SKB) ((struct skb_shared_info *)(skb_end_pointer(SKB)))
457 * skb_queue_empty - check if a queue is empty
460 * Returns true if the queue is empty, false otherwise.
462 static inline int skb_queue_empty(const struct sk_buff_head *list)
464 return list->next == (struct sk_buff *)list;
468 * skb_get - reference buffer
469 * @skb: buffer to reference
471 * Makes another reference to a socket buffer and returns a pointer
474 static inline struct sk_buff *skb_get(struct sk_buff *skb)
476 atomic_inc(&skb->users);
481 * If users == 1, we are the only owner and are can avoid redundant
486 * skb_cloned - is the buffer a clone
487 * @skb: buffer to check
489 * Returns true if the buffer was generated with skb_clone() and is
490 * one of multiple shared copies of the buffer. Cloned buffers are
491 * shared data so must not be written to under normal circumstances.
493 static inline int skb_cloned(const struct sk_buff *skb)
495 return skb->cloned &&
496 (atomic_read(&skb_shinfo(skb)->dataref) & SKB_DATAREF_MASK) != 1;
500 * skb_header_cloned - is the header a clone
501 * @skb: buffer to check
503 * Returns true if modifying the header part of the buffer requires
504 * the data to be copied.
506 static inline int skb_header_cloned(const struct sk_buff *skb)
513 dataref = atomic_read(&skb_shinfo(skb)->dataref);
514 dataref = (dataref & SKB_DATAREF_MASK) - (dataref >> SKB_DATAREF_SHIFT);
519 * skb_header_release - release reference to header
520 * @skb: buffer to operate on
522 * Drop a reference to the header part of the buffer. This is done
523 * by acquiring a payload reference. You must not read from the header
524 * part of skb->data after this.
526 static inline void skb_header_release(struct sk_buff *skb)
530 atomic_add(1 << SKB_DATAREF_SHIFT, &skb_shinfo(skb)->dataref);
534 * skb_shared - is the buffer shared
535 * @skb: buffer to check
537 * Returns true if more than one person has a reference to this
540 static inline int skb_shared(const struct sk_buff *skb)
542 return atomic_read(&skb->users) != 1;
546 * skb_share_check - check if buffer is shared and if so clone it
547 * @skb: buffer to check
548 * @pri: priority for memory allocation
550 * If the buffer is shared the buffer is cloned and the old copy
551 * drops a reference. A new clone with a single reference is returned.
552 * If the buffer is not shared the original buffer is returned. When
553 * being called from interrupt status or with spinlocks held pri must
556 * NULL is returned on a memory allocation failure.
558 static inline struct sk_buff *skb_share_check(struct sk_buff *skb,
561 might_sleep_if(pri & __GFP_WAIT);
562 if (skb_shared(skb)) {
563 struct sk_buff *nskb = skb_clone(skb, pri);
571 * Copy shared buffers into a new sk_buff. We effectively do COW on
572 * packets to handle cases where we have a local reader and forward
573 * and a couple of other messy ones. The normal one is tcpdumping
574 * a packet thats being forwarded.
578 * skb_unshare - make a copy of a shared buffer
579 * @skb: buffer to check
580 * @pri: priority for memory allocation
582 * If the socket buffer is a clone then this function creates a new
583 * copy of the data, drops a reference count on the old copy and returns
584 * the new copy with the reference count at 1. If the buffer is not a clone
585 * the original buffer is returned. When called with a spinlock held or
586 * from interrupt state @pri must be %GFP_ATOMIC
588 * %NULL is returned on a memory allocation failure.
590 static inline struct sk_buff *skb_unshare(struct sk_buff *skb,
593 might_sleep_if(pri & __GFP_WAIT);
594 if (skb_cloned(skb)) {
595 struct sk_buff *nskb = skb_copy(skb, pri);
596 kfree_skb(skb); /* Free our shared copy */
604 * @list_: list to peek at
606 * Peek an &sk_buff. Unlike most other operations you _MUST_
607 * be careful with this one. A peek leaves the buffer on the
608 * list and someone else may run off with it. You must hold
609 * the appropriate locks or have a private queue to do this.
611 * Returns %NULL for an empty list or a pointer to the head element.
612 * The reference count is not incremented and the reference is therefore
613 * volatile. Use with caution.
615 static inline struct sk_buff *skb_peek(struct sk_buff_head *list_)
617 struct sk_buff *list = ((struct sk_buff *)list_)->next;
618 if (list == (struct sk_buff *)list_)
625 * @list_: list to peek at
627 * Peek an &sk_buff. Unlike most other operations you _MUST_
628 * be careful with this one. A peek leaves the buffer on the
629 * list and someone else may run off with it. You must hold
630 * the appropriate locks or have a private queue to do this.
632 * Returns %NULL for an empty list or a pointer to the tail element.
633 * The reference count is not incremented and the reference is therefore
634 * volatile. Use with caution.
636 static inline struct sk_buff *skb_peek_tail(struct sk_buff_head *list_)
638 struct sk_buff *list = ((struct sk_buff *)list_)->prev;
639 if (list == (struct sk_buff *)list_)
645 * skb_queue_len - get queue length
646 * @list_: list to measure
648 * Return the length of an &sk_buff queue.
650 static inline __u32 skb_queue_len(const struct sk_buff_head *list_)
656 * This function creates a split out lock class for each invocation;
657 * this is needed for now since a whole lot of users of the skb-queue
658 * infrastructure in drivers have different locking usage (in hardirq)
659 * than the networking core (in softirq only). In the long run either the
660 * network layer or drivers should need annotation to consolidate the
661 * main types of usage into 3 classes.
663 static inline void skb_queue_head_init(struct sk_buff_head *list)
665 spin_lock_init(&list->lock);
666 list->prev = list->next = (struct sk_buff *)list;
670 static inline void skb_queue_head_init_class(struct sk_buff_head *list,
671 struct lock_class_key *class)
673 skb_queue_head_init(list);
674 lockdep_set_class(&list->lock, class);
678 * Insert an sk_buff on a list.
680 * The "__skb_xxxx()" functions are the non-atomic ones that
681 * can only be called with interrupts disabled.
683 extern void skb_insert(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list);
684 static inline void __skb_insert(struct sk_buff *newsk,
685 struct sk_buff *prev, struct sk_buff *next,
686 struct sk_buff_head *list)
690 next->prev = prev->next = newsk;
695 * __skb_queue_after - queue a buffer at the list head
697 * @prev: place after this buffer
698 * @newsk: buffer to queue
700 * Queue a buffer int the middle of a list. This function takes no locks
701 * and you must therefore hold required locks before calling it.
703 * A buffer cannot be placed on two lists at the same time.
705 static inline void __skb_queue_after(struct sk_buff_head *list,
706 struct sk_buff *prev,
707 struct sk_buff *newsk)
709 __skb_insert(newsk, prev, prev->next, list);
712 extern void skb_append(struct sk_buff *old, struct sk_buff *newsk,
713 struct sk_buff_head *list);
715 static inline void __skb_queue_before(struct sk_buff_head *list,
716 struct sk_buff *next,
717 struct sk_buff *newsk)
719 __skb_insert(newsk, next->prev, next, list);
723 * __skb_queue_head - queue a buffer at the list head
725 * @newsk: buffer to queue
727 * Queue a buffer at the start of a list. This function takes no locks
728 * and you must therefore hold required locks before calling it.
730 * A buffer cannot be placed on two lists at the same time.
732 extern void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk);
733 static inline void __skb_queue_head(struct sk_buff_head *list,
734 struct sk_buff *newsk)
736 __skb_queue_after(list, (struct sk_buff *)list, newsk);
740 * __skb_queue_tail - queue a buffer at the list tail
742 * @newsk: buffer to queue
744 * Queue a buffer at the end of a list. This function takes no locks
745 * and you must therefore hold required locks before calling it.
747 * A buffer cannot be placed on two lists at the same time.
749 extern void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk);
750 static inline void __skb_queue_tail(struct sk_buff_head *list,
751 struct sk_buff *newsk)
753 __skb_queue_before(list, (struct sk_buff *)list, newsk);
757 * remove sk_buff from list. _Must_ be called atomically, and with
760 extern void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list);
761 static inline void __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
763 struct sk_buff *next, *prev;
768 skb->next = skb->prev = NULL;
774 * __skb_dequeue - remove from the head of the queue
775 * @list: list to dequeue from
777 * Remove the head of the list. This function does not take any locks
778 * so must be used with appropriate locks held only. The head item is
779 * returned or %NULL if the list is empty.
781 extern struct sk_buff *skb_dequeue(struct sk_buff_head *list);
782 static inline struct sk_buff *__skb_dequeue(struct sk_buff_head *list)
784 struct sk_buff *skb = skb_peek(list);
786 __skb_unlink(skb, list);
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 extern unsigned char *skb_put(struct sk_buff *skb, unsigned int len);
880 static inline unsigned char *__skb_put(struct sk_buff *skb, unsigned int len)
882 unsigned char *tmp = skb_tail_pointer(skb);
883 SKB_LINEAR_ASSERT(skb);
889 extern unsigned char *skb_push(struct sk_buff *skb, unsigned int len);
890 static inline unsigned char *__skb_push(struct sk_buff *skb, unsigned int len)
897 extern unsigned char *skb_pull(struct sk_buff *skb, unsigned int len);
898 static inline unsigned char *__skb_pull(struct sk_buff *skb, unsigned int len)
901 BUG_ON(skb->len < skb->data_len);
902 return skb->data += len;
905 extern unsigned char *__pskb_pull_tail(struct sk_buff *skb, int delta);
907 static inline unsigned char *__pskb_pull(struct sk_buff *skb, unsigned int len)
909 if (len > skb_headlen(skb) &&
910 !__pskb_pull_tail(skb, len - skb_headlen(skb)))
913 return skb->data += len;
916 static inline unsigned char *pskb_pull(struct sk_buff *skb, unsigned int len)
918 return unlikely(len > skb->len) ? NULL : __pskb_pull(skb, len);
921 static inline int pskb_may_pull(struct sk_buff *skb, unsigned int len)
923 if (likely(len <= skb_headlen(skb)))
925 if (unlikely(len > skb->len))
927 return __pskb_pull_tail(skb, len - skb_headlen(skb)) != NULL;
931 * skb_headroom - bytes at buffer head
932 * @skb: buffer to check
934 * Return the number of bytes of free space at the head of an &sk_buff.
936 static inline unsigned int skb_headroom(const struct sk_buff *skb)
938 return skb->data - skb->head;
942 * skb_tailroom - bytes at buffer end
943 * @skb: buffer to check
945 * Return the number of bytes of free space at the tail of an sk_buff
947 static inline int skb_tailroom(const struct sk_buff *skb)
949 return skb_is_nonlinear(skb) ? 0 : skb->end - skb->tail;
953 * skb_reserve - adjust headroom
954 * @skb: buffer to alter
955 * @len: bytes to move
957 * Increase the headroom of an empty &sk_buff by reducing the tail
958 * room. This is only allowed for an empty buffer.
960 static inline void skb_reserve(struct sk_buff *skb, int len)
966 #ifdef NET_SKBUFF_DATA_USES_OFFSET
967 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
969 return skb->head + skb->transport_header;
972 static inline void skb_reset_transport_header(struct sk_buff *skb)
974 skb->transport_header = skb->data - skb->head;
977 static inline void skb_set_transport_header(struct sk_buff *skb,
980 skb_reset_transport_header(skb);
981 skb->transport_header += offset;
984 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
986 return skb->head + skb->network_header;
989 static inline void skb_reset_network_header(struct sk_buff *skb)
991 skb->network_header = skb->data - skb->head;
994 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
996 skb_reset_network_header(skb);
997 skb->network_header += offset;
1000 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1002 return skb->head + skb->mac_header;
1005 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1007 return skb->mac_header != ~0U;
1010 static inline void skb_reset_mac_header(struct sk_buff *skb)
1012 skb->mac_header = skb->data - skb->head;
1015 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1017 skb_reset_mac_header(skb);
1018 skb->mac_header += offset;
1021 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1023 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
1025 return skb->transport_header;
1028 static inline void skb_reset_transport_header(struct sk_buff *skb)
1030 skb->transport_header = skb->data;
1033 static inline void skb_set_transport_header(struct sk_buff *skb,
1036 skb->transport_header = skb->data + offset;
1039 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
1041 return skb->network_header;
1044 static inline void skb_reset_network_header(struct sk_buff *skb)
1046 skb->network_header = skb->data;
1049 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1051 skb->network_header = skb->data + offset;
1054 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1056 return skb->mac_header;
1059 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1061 return skb->mac_header != NULL;
1064 static inline void skb_reset_mac_header(struct sk_buff *skb)
1066 skb->mac_header = skb->data;
1069 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1071 skb->mac_header = skb->data + offset;
1073 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1075 static inline int skb_transport_offset(const struct sk_buff *skb)
1077 return skb_transport_header(skb) - skb->data;
1080 static inline u32 skb_network_header_len(const struct sk_buff *skb)
1082 return skb->transport_header - skb->network_header;
1085 static inline int skb_network_offset(const struct sk_buff *skb)
1087 return skb_network_header(skb) - skb->data;
1091 * CPUs often take a performance hit when accessing unaligned memory
1092 * locations. The actual performance hit varies, it can be small if the
1093 * hardware handles it or large if we have to take an exception and fix it
1096 * Since an ethernet header is 14 bytes network drivers often end up with
1097 * the IP header at an unaligned offset. The IP header can be aligned by
1098 * shifting the start of the packet by 2 bytes. Drivers should do this
1101 * skb_reserve(NET_IP_ALIGN);
1103 * The downside to this alignment of the IP header is that the DMA is now
1104 * unaligned. On some architectures the cost of an unaligned DMA is high
1105 * and this cost outweighs the gains made by aligning the IP header.
1107 * Since this trade off varies between architectures, we allow NET_IP_ALIGN
1110 #ifndef NET_IP_ALIGN
1111 #define NET_IP_ALIGN 2
1115 * The networking layer reserves some headroom in skb data (via
1116 * dev_alloc_skb). This is used to avoid having to reallocate skb data when
1117 * the header has to grow. In the default case, if the header has to grow
1118 * 16 bytes or less we avoid the reallocation.
1120 * Unfortunately this headroom changes the DMA alignment of the resulting
1121 * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive
1122 * on some architectures. An architecture can override this value,
1123 * perhaps setting it to a cacheline in size (since that will maintain
1124 * cacheline alignment of the DMA). It must be a power of 2.
1126 * Various parts of the networking layer expect at least 16 bytes of
1127 * headroom, you should not reduce this.
1130 #define NET_SKB_PAD 16
1133 extern int ___pskb_trim(struct sk_buff *skb, unsigned int len);
1135 static inline void __skb_trim(struct sk_buff *skb, unsigned int len)
1137 if (unlikely(skb->data_len)) {
1142 skb_set_tail_pointer(skb, len);
1145 extern void skb_trim(struct sk_buff *skb, unsigned int len);
1147 static inline int __pskb_trim(struct sk_buff *skb, unsigned int len)
1150 return ___pskb_trim(skb, len);
1151 __skb_trim(skb, len);
1155 static inline int pskb_trim(struct sk_buff *skb, unsigned int len)
1157 return (len < skb->len) ? __pskb_trim(skb, len) : 0;
1161 * pskb_trim_unique - remove end from a paged unique (not cloned) buffer
1162 * @skb: buffer to alter
1165 * This is identical to pskb_trim except that the caller knows that
1166 * the skb is not cloned so we should never get an error due to out-
1169 static inline void pskb_trim_unique(struct sk_buff *skb, unsigned int len)
1171 int err = pskb_trim(skb, len);
1176 * skb_orphan - orphan a buffer
1177 * @skb: buffer to orphan
1179 * If a buffer currently has an owner then we call the owner's
1180 * destructor function and make the @skb unowned. The buffer continues
1181 * to exist but is no longer charged to its former owner.
1183 static inline void skb_orphan(struct sk_buff *skb)
1185 if (skb->destructor)
1186 skb->destructor(skb);
1187 skb->destructor = NULL;
1192 * __skb_queue_purge - empty a list
1193 * @list: list to empty
1195 * Delete all buffers on an &sk_buff list. Each buffer is removed from
1196 * the list and one reference dropped. This function does not take the
1197 * list lock and the caller must hold the relevant locks to use it.
1199 extern void skb_queue_purge(struct sk_buff_head *list);
1200 static inline void __skb_queue_purge(struct sk_buff_head *list)
1202 struct sk_buff *skb;
1203 while ((skb = __skb_dequeue(list)) != NULL)
1208 * __dev_alloc_skb - allocate an skbuff for receiving
1209 * @length: length to allocate
1210 * @gfp_mask: get_free_pages mask, passed to alloc_skb
1212 * Allocate a new &sk_buff and assign it a usage count of one. The
1213 * buffer has unspecified headroom built in. Users should allocate
1214 * the headroom they think they need without accounting for the
1215 * built in space. The built in space is used for optimisations.
1217 * %NULL is returned if there is no free memory.
1219 static inline struct sk_buff *__dev_alloc_skb(unsigned int length,
1222 struct sk_buff *skb = alloc_skb(length + NET_SKB_PAD, gfp_mask);
1224 skb_reserve(skb, NET_SKB_PAD);
1228 extern struct sk_buff *dev_alloc_skb(unsigned int length);
1230 extern struct sk_buff *__netdev_alloc_skb(struct net_device *dev,
1231 unsigned int length, gfp_t gfp_mask);
1234 * netdev_alloc_skb - allocate an skbuff for rx on a specific device
1235 * @dev: network device to receive on
1236 * @length: length to allocate
1238 * Allocate a new &sk_buff and assign it a usage count of one. The
1239 * buffer has unspecified headroom built in. Users should allocate
1240 * the headroom they think they need without accounting for the
1241 * built in space. The built in space is used for optimisations.
1243 * %NULL is returned if there is no free memory. Although this function
1244 * allocates memory it can be called from an interrupt.
1246 static inline struct sk_buff *netdev_alloc_skb(struct net_device *dev,
1247 unsigned int length)
1249 return __netdev_alloc_skb(dev, length, GFP_ATOMIC);
1253 * skb_clone_writable - is the header of a clone writable
1254 * @skb: buffer to check
1255 * @len: length up to which to write
1257 * Returns true if modifying the header part of the cloned buffer
1258 * does not requires the data to be copied.
1260 static inline int skb_clone_writable(struct sk_buff *skb, unsigned int len)
1262 return !skb_header_cloned(skb) &&
1263 skb_headroom(skb) + len <= skb->hdr_len;
1266 static inline int __skb_cow(struct sk_buff *skb, unsigned int headroom,
1271 if (headroom < NET_SKB_PAD)
1272 headroom = NET_SKB_PAD;
1273 if (headroom > skb_headroom(skb))
1274 delta = headroom - skb_headroom(skb);
1276 if (delta || cloned)
1277 return pskb_expand_head(skb, ALIGN(delta, NET_SKB_PAD), 0,
1283 * skb_cow - copy header of skb when it is required
1284 * @skb: buffer to cow
1285 * @headroom: needed headroom
1287 * If the skb passed lacks sufficient headroom or its data part
1288 * is shared, data is reallocated. If reallocation fails, an error
1289 * is returned and original skb is not changed.
1291 * The result is skb with writable area skb->head...skb->tail
1292 * and at least @headroom of space at head.
1294 static inline int skb_cow(struct sk_buff *skb, unsigned int headroom)
1296 return __skb_cow(skb, headroom, skb_cloned(skb));
1300 * skb_cow_head - skb_cow but only making the head writable
1301 * @skb: buffer to cow
1302 * @headroom: needed headroom
1304 * This function is identical to skb_cow except that we replace the
1305 * skb_cloned check by skb_header_cloned. It should be used when
1306 * you only need to push on some header and do not need to modify
1309 static inline int skb_cow_head(struct sk_buff *skb, unsigned int headroom)
1311 return __skb_cow(skb, headroom, skb_header_cloned(skb));
1315 * skb_padto - pad an skbuff up to a minimal size
1316 * @skb: buffer to pad
1317 * @len: minimal length
1319 * Pads up a buffer to ensure the trailing bytes exist and are
1320 * blanked. If the buffer already contains sufficient data it
1321 * is untouched. Otherwise it is extended. Returns zero on
1322 * success. The skb is freed on error.
1325 static inline int skb_padto(struct sk_buff *skb, unsigned int len)
1327 unsigned int size = skb->len;
1328 if (likely(size >= len))
1330 return skb_pad(skb, len - size);
1333 static inline int skb_add_data(struct sk_buff *skb,
1334 char __user *from, int copy)
1336 const int off = skb->len;
1338 if (skb->ip_summed == CHECKSUM_NONE) {
1340 __wsum csum = csum_and_copy_from_user(from, skb_put(skb, copy),
1343 skb->csum = csum_block_add(skb->csum, csum, off);
1346 } else if (!copy_from_user(skb_put(skb, copy), from, copy))
1349 __skb_trim(skb, off);
1353 static inline int skb_can_coalesce(struct sk_buff *skb, int i,
1354 struct page *page, int off)
1357 struct skb_frag_struct *frag = &skb_shinfo(skb)->frags[i - 1];
1359 return page == frag->page &&
1360 off == frag->page_offset + frag->size;
1365 static inline int __skb_linearize(struct sk_buff *skb)
1367 return __pskb_pull_tail(skb, skb->data_len) ? 0 : -ENOMEM;
1371 * skb_linearize - convert paged skb to linear one
1372 * @skb: buffer to linarize
1374 * If there is no free memory -ENOMEM is returned, otherwise zero
1375 * is returned and the old skb data released.
1377 static inline int skb_linearize(struct sk_buff *skb)
1379 return skb_is_nonlinear(skb) ? __skb_linearize(skb) : 0;
1383 * skb_linearize_cow - make sure skb is linear and writable
1384 * @skb: buffer to process
1386 * If there is no free memory -ENOMEM is returned, otherwise zero
1387 * is returned and the old skb data released.
1389 static inline int skb_linearize_cow(struct sk_buff *skb)
1391 return skb_is_nonlinear(skb) || skb_cloned(skb) ?
1392 __skb_linearize(skb) : 0;
1396 * skb_postpull_rcsum - update checksum for received skb after pull
1397 * @skb: buffer to update
1398 * @start: start of data before pull
1399 * @len: length of data pulled
1401 * After doing a pull on a received packet, you need to call this to
1402 * update the CHECKSUM_COMPLETE checksum, or set ip_summed to
1403 * CHECKSUM_NONE so that it can be recomputed from scratch.
1406 static inline void skb_postpull_rcsum(struct sk_buff *skb,
1407 const void *start, unsigned int len)
1409 if (skb->ip_summed == CHECKSUM_COMPLETE)
1410 skb->csum = csum_sub(skb->csum, csum_partial(start, len, 0));
1413 unsigned char *skb_pull_rcsum(struct sk_buff *skb, unsigned int len);
1416 * pskb_trim_rcsum - trim received skb and update checksum
1417 * @skb: buffer to trim
1420 * This is exactly the same as pskb_trim except that it ensures the
1421 * checksum of received packets are still valid after the operation.
1424 static inline int pskb_trim_rcsum(struct sk_buff *skb, unsigned int len)
1426 if (likely(len >= skb->len))
1428 if (skb->ip_summed == CHECKSUM_COMPLETE)
1429 skb->ip_summed = CHECKSUM_NONE;
1430 return __pskb_trim(skb, len);
1433 #define skb_queue_walk(queue, skb) \
1434 for (skb = (queue)->next; \
1435 prefetch(skb->next), (skb != (struct sk_buff *)(queue)); \
1438 #define skb_queue_walk_safe(queue, skb, tmp) \
1439 for (skb = (queue)->next, tmp = skb->next; \
1440 skb != (struct sk_buff *)(queue); \
1441 skb = tmp, tmp = skb->next)
1443 #define skb_queue_reverse_walk(queue, skb) \
1444 for (skb = (queue)->prev; \
1445 prefetch(skb->prev), (skb != (struct sk_buff *)(queue)); \
1449 extern struct sk_buff *__skb_recv_datagram(struct sock *sk, unsigned flags,
1450 int *peeked, int *err);
1451 extern struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags,
1452 int noblock, int *err);
1453 extern unsigned int datagram_poll(struct file *file, struct socket *sock,
1454 struct poll_table_struct *wait);
1455 extern int skb_copy_datagram_iovec(const struct sk_buff *from,
1456 int offset, struct iovec *to,
1458 extern int skb_copy_and_csum_datagram_iovec(struct sk_buff *skb,
1461 extern int skb_copy_datagram_from_iovec(struct sk_buff *skb,
1465 extern void skb_free_datagram(struct sock *sk, struct sk_buff *skb);
1466 extern int skb_kill_datagram(struct sock *sk, struct sk_buff *skb,
1467 unsigned int flags);
1468 extern __wsum skb_checksum(const struct sk_buff *skb, int offset,
1469 int len, __wsum csum);
1470 extern int skb_copy_bits(const struct sk_buff *skb, int offset,
1472 extern int skb_store_bits(struct sk_buff *skb, int offset,
1473 const void *from, int len);
1474 extern __wsum skb_copy_and_csum_bits(const struct sk_buff *skb,
1475 int offset, u8 *to, int len,
1477 extern int skb_splice_bits(struct sk_buff *skb,
1478 unsigned int offset,
1479 struct pipe_inode_info *pipe,
1481 unsigned int flags);
1482 extern void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to);
1483 extern void skb_split(struct sk_buff *skb,
1484 struct sk_buff *skb1, const u32 len);
1486 extern struct sk_buff *skb_segment(struct sk_buff *skb, int features);
1488 static inline void *skb_header_pointer(const struct sk_buff *skb, int offset,
1489 int len, void *buffer)
1491 int hlen = skb_headlen(skb);
1493 if (hlen - offset >= len)
1494 return skb->data + offset;
1496 if (skb_copy_bits(skb, offset, buffer, len) < 0)
1502 static inline void skb_copy_from_linear_data(const struct sk_buff *skb,
1504 const unsigned int len)
1506 memcpy(to, skb->data, len);
1509 static inline void skb_copy_from_linear_data_offset(const struct sk_buff *skb,
1510 const int offset, void *to,
1511 const unsigned int len)
1513 memcpy(to, skb->data + offset, len);
1516 static inline void skb_copy_to_linear_data(struct sk_buff *skb,
1518 const unsigned int len)
1520 memcpy(skb->data, from, len);
1523 static inline void skb_copy_to_linear_data_offset(struct sk_buff *skb,
1526 const unsigned int len)
1528 memcpy(skb->data + offset, from, len);
1531 extern void skb_init(void);
1534 * skb_get_timestamp - get timestamp from a skb
1535 * @skb: skb to get stamp from
1536 * @stamp: pointer to struct timeval to store stamp in
1538 * Timestamps are stored in the skb as offsets to a base timestamp.
1539 * This function converts the offset back to a struct timeval and stores
1542 static inline void skb_get_timestamp(const struct sk_buff *skb, struct timeval *stamp)
1544 *stamp = ktime_to_timeval(skb->tstamp);
1547 static inline void __net_timestamp(struct sk_buff *skb)
1549 skb->tstamp = ktime_get_real();
1552 static inline ktime_t net_timedelta(ktime_t t)
1554 return ktime_sub(ktime_get_real(), t);
1557 static inline ktime_t net_invalid_timestamp(void)
1559 return ktime_set(0, 0);
1562 extern __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len);
1563 extern __sum16 __skb_checksum_complete(struct sk_buff *skb);
1565 static inline int skb_csum_unnecessary(const struct sk_buff *skb)
1567 return skb->ip_summed & CHECKSUM_UNNECESSARY;
1571 * skb_checksum_complete - Calculate checksum of an entire packet
1572 * @skb: packet to process
1574 * This function calculates the checksum over the entire packet plus
1575 * the value of skb->csum. The latter can be used to supply the
1576 * checksum of a pseudo header as used by TCP/UDP. It returns the
1579 * For protocols that contain complete checksums such as ICMP/TCP/UDP,
1580 * this function can be used to verify that checksum on received
1581 * packets. In that case the function should return zero if the
1582 * checksum is correct. In particular, this function will return zero
1583 * if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the
1584 * hardware has already verified the correctness of the checksum.
1586 static inline __sum16 skb_checksum_complete(struct sk_buff *skb)
1588 return skb_csum_unnecessary(skb) ?
1589 0 : __skb_checksum_complete(skb);
1592 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1593 extern void nf_conntrack_destroy(struct nf_conntrack *nfct);
1594 static inline void nf_conntrack_put(struct nf_conntrack *nfct)
1596 if (nfct && atomic_dec_and_test(&nfct->use))
1597 nf_conntrack_destroy(nfct);
1599 static inline void nf_conntrack_get(struct nf_conntrack *nfct)
1602 atomic_inc(&nfct->use);
1604 static inline void nf_conntrack_get_reasm(struct sk_buff *skb)
1607 atomic_inc(&skb->users);
1609 static inline void nf_conntrack_put_reasm(struct sk_buff *skb)
1615 #ifdef CONFIG_BRIDGE_NETFILTER
1616 static inline void nf_bridge_put(struct nf_bridge_info *nf_bridge)
1618 if (nf_bridge && atomic_dec_and_test(&nf_bridge->use))
1621 static inline void nf_bridge_get(struct nf_bridge_info *nf_bridge)
1624 atomic_inc(&nf_bridge->use);
1626 #endif /* CONFIG_BRIDGE_NETFILTER */
1627 static inline void nf_reset(struct sk_buff *skb)
1629 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1630 nf_conntrack_put(skb->nfct);
1632 nf_conntrack_put_reasm(skb->nfct_reasm);
1633 skb->nfct_reasm = NULL;
1635 #ifdef CONFIG_BRIDGE_NETFILTER
1636 nf_bridge_put(skb->nf_bridge);
1637 skb->nf_bridge = NULL;
1641 /* Note: This doesn't put any conntrack and bridge info in dst. */
1642 static inline void __nf_copy(struct sk_buff *dst, const struct sk_buff *src)
1644 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1645 dst->nfct = src->nfct;
1646 nf_conntrack_get(src->nfct);
1647 dst->nfctinfo = src->nfctinfo;
1648 dst->nfct_reasm = src->nfct_reasm;
1649 nf_conntrack_get_reasm(src->nfct_reasm);
1651 #ifdef CONFIG_BRIDGE_NETFILTER
1652 dst->nf_bridge = src->nf_bridge;
1653 nf_bridge_get(src->nf_bridge);
1657 static inline void nf_copy(struct sk_buff *dst, const struct sk_buff *src)
1659 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1660 nf_conntrack_put(dst->nfct);
1661 nf_conntrack_put_reasm(dst->nfct_reasm);
1663 #ifdef CONFIG_BRIDGE_NETFILTER
1664 nf_bridge_put(dst->nf_bridge);
1666 __nf_copy(dst, src);
1669 #ifdef CONFIG_NETWORK_SECMARK
1670 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
1672 to->secmark = from->secmark;
1675 static inline void skb_init_secmark(struct sk_buff *skb)
1680 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
1683 static inline void skb_init_secmark(struct sk_buff *skb)
1687 static inline void skb_set_queue_mapping(struct sk_buff *skb, u16 queue_mapping)
1689 skb->queue_mapping = queue_mapping;
1692 static inline u16 skb_get_queue_mapping(struct sk_buff *skb)
1694 return skb->queue_mapping;
1697 static inline void skb_copy_queue_mapping(struct sk_buff *to, const struct sk_buff *from)
1699 to->queue_mapping = from->queue_mapping;
1702 static inline int skb_is_gso(const struct sk_buff *skb)
1704 return skb_shinfo(skb)->gso_size;
1707 static inline int skb_is_gso_v6(const struct sk_buff *skb)
1709 return skb_shinfo(skb)->gso_type & SKB_GSO_TCPV6;
1712 extern void __skb_warn_lro_forwarding(const struct sk_buff *skb);
1714 static inline bool skb_warn_if_lro(const struct sk_buff *skb)
1716 /* LRO sets gso_size but not gso_type, whereas if GSO is really
1717 * wanted then gso_type will be set. */
1718 struct skb_shared_info *shinfo = skb_shinfo(skb);
1719 if (shinfo->gso_size != 0 && unlikely(shinfo->gso_type == 0)) {
1720 __skb_warn_lro_forwarding(skb);
1726 static inline void skb_forward_csum(struct sk_buff *skb)
1728 /* Unfortunately we don't support this one. Any brave souls? */
1729 if (skb->ip_summed == CHECKSUM_COMPLETE)
1730 skb->ip_summed = CHECKSUM_NONE;
1733 bool skb_partial_csum_set(struct sk_buff *skb, u16 start, u16 off);
1734 #endif /* __KERNEL__ */
1735 #endif /* _LINUX_SKBUFF_H */