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 #ifdef CONFIG_HAS_DMA
363 #include <linux/dma-mapping.h>
364 extern int skb_dma_map(struct device *dev, struct sk_buff *skb,
365 enum dma_data_direction dir);
366 extern void skb_dma_unmap(struct device *dev, struct sk_buff *skb,
367 enum dma_data_direction dir);
370 extern void kfree_skb(struct sk_buff *skb);
371 extern void __kfree_skb(struct sk_buff *skb);
372 extern struct sk_buff *__alloc_skb(unsigned int size,
373 gfp_t priority, int fclone, int node);
374 static inline struct sk_buff *alloc_skb(unsigned int size,
377 return __alloc_skb(size, priority, 0, -1);
380 static inline struct sk_buff *alloc_skb_fclone(unsigned int size,
383 return __alloc_skb(size, priority, 1, -1);
386 extern struct sk_buff *skb_morph(struct sk_buff *dst, struct sk_buff *src);
387 extern struct sk_buff *skb_clone(struct sk_buff *skb,
389 extern struct sk_buff *skb_copy(const struct sk_buff *skb,
391 extern struct sk_buff *pskb_copy(struct sk_buff *skb,
393 extern int pskb_expand_head(struct sk_buff *skb,
394 int nhead, int ntail,
396 extern struct sk_buff *skb_realloc_headroom(struct sk_buff *skb,
397 unsigned int headroom);
398 extern struct sk_buff *skb_copy_expand(const struct sk_buff *skb,
399 int newheadroom, int newtailroom,
401 extern int skb_to_sgvec(struct sk_buff *skb,
402 struct scatterlist *sg, int offset,
404 extern int skb_cow_data(struct sk_buff *skb, int tailbits,
405 struct sk_buff **trailer);
406 extern int skb_pad(struct sk_buff *skb, int pad);
407 #define dev_kfree_skb(a) kfree_skb(a)
408 extern void skb_over_panic(struct sk_buff *skb, int len,
410 extern void skb_under_panic(struct sk_buff *skb, int len,
412 extern void skb_truesize_bug(struct sk_buff *skb);
414 static inline void skb_truesize_check(struct sk_buff *skb)
416 int len = sizeof(struct sk_buff) + skb->len;
418 if (unlikely((int)skb->truesize < len))
419 skb_truesize_bug(skb);
422 extern int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb,
423 int getfrag(void *from, char *to, int offset,
424 int len,int odd, struct sk_buff *skb),
425 void *from, int length);
432 __u32 stepped_offset;
433 struct sk_buff *root_skb;
434 struct sk_buff *cur_skb;
438 extern void skb_prepare_seq_read(struct sk_buff *skb,
439 unsigned int from, unsigned int to,
440 struct skb_seq_state *st);
441 extern unsigned int skb_seq_read(unsigned int consumed, const u8 **data,
442 struct skb_seq_state *st);
443 extern void skb_abort_seq_read(struct skb_seq_state *st);
445 extern unsigned int skb_find_text(struct sk_buff *skb, unsigned int from,
446 unsigned int to, struct ts_config *config,
447 struct ts_state *state);
449 #ifdef NET_SKBUFF_DATA_USES_OFFSET
450 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
452 return skb->head + skb->end;
455 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
462 #define skb_shinfo(SKB) ((struct skb_shared_info *)(skb_end_pointer(SKB)))
465 * skb_queue_empty - check if a queue is empty
468 * Returns true if the queue is empty, false otherwise.
470 static inline int skb_queue_empty(const struct sk_buff_head *list)
472 return list->next == (struct sk_buff *)list;
476 * skb_get - reference buffer
477 * @skb: buffer to reference
479 * Makes another reference to a socket buffer and returns a pointer
482 static inline struct sk_buff *skb_get(struct sk_buff *skb)
484 atomic_inc(&skb->users);
489 * If users == 1, we are the only owner and are can avoid redundant
494 * skb_cloned - is the buffer a clone
495 * @skb: buffer to check
497 * Returns true if the buffer was generated with skb_clone() and is
498 * one of multiple shared copies of the buffer. Cloned buffers are
499 * shared data so must not be written to under normal circumstances.
501 static inline int skb_cloned(const struct sk_buff *skb)
503 return skb->cloned &&
504 (atomic_read(&skb_shinfo(skb)->dataref) & SKB_DATAREF_MASK) != 1;
508 * skb_header_cloned - is the header a clone
509 * @skb: buffer to check
511 * Returns true if modifying the header part of the buffer requires
512 * the data to be copied.
514 static inline int skb_header_cloned(const struct sk_buff *skb)
521 dataref = atomic_read(&skb_shinfo(skb)->dataref);
522 dataref = (dataref & SKB_DATAREF_MASK) - (dataref >> SKB_DATAREF_SHIFT);
527 * skb_header_release - release reference to header
528 * @skb: buffer to operate on
530 * Drop a reference to the header part of the buffer. This is done
531 * by acquiring a payload reference. You must not read from the header
532 * part of skb->data after this.
534 static inline void skb_header_release(struct sk_buff *skb)
538 atomic_add(1 << SKB_DATAREF_SHIFT, &skb_shinfo(skb)->dataref);
542 * skb_shared - is the buffer shared
543 * @skb: buffer to check
545 * Returns true if more than one person has a reference to this
548 static inline int skb_shared(const struct sk_buff *skb)
550 return atomic_read(&skb->users) != 1;
554 * skb_share_check - check if buffer is shared and if so clone it
555 * @skb: buffer to check
556 * @pri: priority for memory allocation
558 * If the buffer is shared the buffer is cloned and the old copy
559 * drops a reference. A new clone with a single reference is returned.
560 * If the buffer is not shared the original buffer is returned. When
561 * being called from interrupt status or with spinlocks held pri must
564 * NULL is returned on a memory allocation failure.
566 static inline struct sk_buff *skb_share_check(struct sk_buff *skb,
569 might_sleep_if(pri & __GFP_WAIT);
570 if (skb_shared(skb)) {
571 struct sk_buff *nskb = skb_clone(skb, pri);
579 * Copy shared buffers into a new sk_buff. We effectively do COW on
580 * packets to handle cases where we have a local reader and forward
581 * and a couple of other messy ones. The normal one is tcpdumping
582 * a packet thats being forwarded.
586 * skb_unshare - make a copy of a shared buffer
587 * @skb: buffer to check
588 * @pri: priority for memory allocation
590 * If the socket buffer is a clone then this function creates a new
591 * copy of the data, drops a reference count on the old copy and returns
592 * the new copy with the reference count at 1. If the buffer is not a clone
593 * the original buffer is returned. When called with a spinlock held or
594 * from interrupt state @pri must be %GFP_ATOMIC
596 * %NULL is returned on a memory allocation failure.
598 static inline struct sk_buff *skb_unshare(struct sk_buff *skb,
601 might_sleep_if(pri & __GFP_WAIT);
602 if (skb_cloned(skb)) {
603 struct sk_buff *nskb = skb_copy(skb, pri);
604 kfree_skb(skb); /* Free our shared copy */
612 * @list_: list to peek at
614 * Peek an &sk_buff. Unlike most other operations you _MUST_
615 * be careful with this one. A peek leaves the buffer on the
616 * list and someone else may run off with it. You must hold
617 * the appropriate locks or have a private queue to do this.
619 * Returns %NULL for an empty list or a pointer to the head element.
620 * The reference count is not incremented and the reference is therefore
621 * volatile. Use with caution.
623 static inline struct sk_buff *skb_peek(struct sk_buff_head *list_)
625 struct sk_buff *list = ((struct sk_buff *)list_)->next;
626 if (list == (struct sk_buff *)list_)
633 * @list_: list to peek at
635 * Peek an &sk_buff. Unlike most other operations you _MUST_
636 * be careful with this one. A peek leaves the buffer on the
637 * list and someone else may run off with it. You must hold
638 * the appropriate locks or have a private queue to do this.
640 * Returns %NULL for an empty list or a pointer to the tail element.
641 * The reference count is not incremented and the reference is therefore
642 * volatile. Use with caution.
644 static inline struct sk_buff *skb_peek_tail(struct sk_buff_head *list_)
646 struct sk_buff *list = ((struct sk_buff *)list_)->prev;
647 if (list == (struct sk_buff *)list_)
653 * skb_queue_len - get queue length
654 * @list_: list to measure
656 * Return the length of an &sk_buff queue.
658 static inline __u32 skb_queue_len(const struct sk_buff_head *list_)
664 * This function creates a split out lock class for each invocation;
665 * this is needed for now since a whole lot of users of the skb-queue
666 * infrastructure in drivers have different locking usage (in hardirq)
667 * than the networking core (in softirq only). In the long run either the
668 * network layer or drivers should need annotation to consolidate the
669 * main types of usage into 3 classes.
671 static inline void skb_queue_head_init(struct sk_buff_head *list)
673 spin_lock_init(&list->lock);
674 list->prev = list->next = (struct sk_buff *)list;
678 static inline void skb_queue_head_init_class(struct sk_buff_head *list,
679 struct lock_class_key *class)
681 skb_queue_head_init(list);
682 lockdep_set_class(&list->lock, class);
686 * Insert an sk_buff on a list.
688 * The "__skb_xxxx()" functions are the non-atomic ones that
689 * can only be called with interrupts disabled.
691 extern void skb_insert(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list);
692 static inline void __skb_insert(struct sk_buff *newsk,
693 struct sk_buff *prev, struct sk_buff *next,
694 struct sk_buff_head *list)
698 next->prev = prev->next = newsk;
703 * __skb_queue_after - queue a buffer at the list head
705 * @prev: place after this buffer
706 * @newsk: buffer to queue
708 * Queue a buffer int the middle of a list. This function takes no locks
709 * and you must therefore hold required locks before calling it.
711 * A buffer cannot be placed on two lists at the same time.
713 static inline void __skb_queue_after(struct sk_buff_head *list,
714 struct sk_buff *prev,
715 struct sk_buff *newsk)
717 __skb_insert(newsk, prev, prev->next, list);
720 extern void skb_append(struct sk_buff *old, struct sk_buff *newsk,
721 struct sk_buff_head *list);
723 static inline void __skb_queue_before(struct sk_buff_head *list,
724 struct sk_buff *next,
725 struct sk_buff *newsk)
727 __skb_insert(newsk, next->prev, next, list);
731 * __skb_queue_head - queue a buffer at the list head
733 * @newsk: buffer to queue
735 * Queue a buffer at the start of a list. This function takes no locks
736 * and you must therefore hold required locks before calling it.
738 * A buffer cannot be placed on two lists at the same time.
740 extern void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk);
741 static inline void __skb_queue_head(struct sk_buff_head *list,
742 struct sk_buff *newsk)
744 __skb_queue_after(list, (struct sk_buff *)list, newsk);
748 * __skb_queue_tail - queue a buffer at the list tail
750 * @newsk: buffer to queue
752 * Queue a buffer at the end of a list. This function takes no locks
753 * and you must therefore hold required locks before calling it.
755 * A buffer cannot be placed on two lists at the same time.
757 extern void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk);
758 static inline void __skb_queue_tail(struct sk_buff_head *list,
759 struct sk_buff *newsk)
761 __skb_queue_before(list, (struct sk_buff *)list, newsk);
765 * remove sk_buff from list. _Must_ be called atomically, and with
768 extern void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list);
769 static inline void __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
771 struct sk_buff *next, *prev;
776 skb->next = skb->prev = NULL;
782 * __skb_dequeue - remove from the head of the queue
783 * @list: list to dequeue from
785 * Remove the head of the list. This function does not take any locks
786 * so must be used with appropriate locks held only. The head item is
787 * returned or %NULL if the list is empty.
789 extern struct sk_buff *skb_dequeue(struct sk_buff_head *list);
790 static inline struct sk_buff *__skb_dequeue(struct sk_buff_head *list)
792 struct sk_buff *skb = skb_peek(list);
794 __skb_unlink(skb, list);
799 * __skb_dequeue_tail - remove from the tail of the queue
800 * @list: list to dequeue from
802 * Remove the tail of the list. This function does not take any locks
803 * so must be used with appropriate locks held only. The tail item is
804 * returned or %NULL if the list is empty.
806 extern struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list);
807 static inline struct sk_buff *__skb_dequeue_tail(struct sk_buff_head *list)
809 struct sk_buff *skb = skb_peek_tail(list);
811 __skb_unlink(skb, list);
816 static inline int skb_is_nonlinear(const struct sk_buff *skb)
818 return skb->data_len;
821 static inline unsigned int skb_headlen(const struct sk_buff *skb)
823 return skb->len - skb->data_len;
826 static inline int skb_pagelen(const struct sk_buff *skb)
830 for (i = (int)skb_shinfo(skb)->nr_frags - 1; i >= 0; i--)
831 len += skb_shinfo(skb)->frags[i].size;
832 return len + skb_headlen(skb);
835 static inline void skb_fill_page_desc(struct sk_buff *skb, int i,
836 struct page *page, int off, int size)
838 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
841 frag->page_offset = off;
843 skb_shinfo(skb)->nr_frags = i + 1;
846 #define SKB_PAGE_ASSERT(skb) BUG_ON(skb_shinfo(skb)->nr_frags)
847 #define SKB_FRAG_ASSERT(skb) BUG_ON(skb_shinfo(skb)->frag_list)
848 #define SKB_LINEAR_ASSERT(skb) BUG_ON(skb_is_nonlinear(skb))
850 #ifdef NET_SKBUFF_DATA_USES_OFFSET
851 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
853 return skb->head + skb->tail;
856 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
858 skb->tail = skb->data - skb->head;
861 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
863 skb_reset_tail_pointer(skb);
866 #else /* NET_SKBUFF_DATA_USES_OFFSET */
867 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
872 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
874 skb->tail = skb->data;
877 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
879 skb->tail = skb->data + offset;
882 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
885 * Add data to an sk_buff
887 extern unsigned char *skb_put(struct sk_buff *skb, unsigned int len);
888 static inline unsigned char *__skb_put(struct sk_buff *skb, unsigned int len)
890 unsigned char *tmp = skb_tail_pointer(skb);
891 SKB_LINEAR_ASSERT(skb);
897 extern unsigned char *skb_push(struct sk_buff *skb, unsigned int len);
898 static inline unsigned char *__skb_push(struct sk_buff *skb, unsigned int len)
905 extern unsigned char *skb_pull(struct sk_buff *skb, unsigned int len);
906 static inline unsigned char *__skb_pull(struct sk_buff *skb, unsigned int len)
909 BUG_ON(skb->len < skb->data_len);
910 return skb->data += len;
913 extern unsigned char *__pskb_pull_tail(struct sk_buff *skb, int delta);
915 static inline unsigned char *__pskb_pull(struct sk_buff *skb, unsigned int len)
917 if (len > skb_headlen(skb) &&
918 !__pskb_pull_tail(skb, len - skb_headlen(skb)))
921 return skb->data += len;
924 static inline unsigned char *pskb_pull(struct sk_buff *skb, unsigned int len)
926 return unlikely(len > skb->len) ? NULL : __pskb_pull(skb, len);
929 static inline int pskb_may_pull(struct sk_buff *skb, unsigned int len)
931 if (likely(len <= skb_headlen(skb)))
933 if (unlikely(len > skb->len))
935 return __pskb_pull_tail(skb, len - skb_headlen(skb)) != NULL;
939 * skb_headroom - bytes at buffer head
940 * @skb: buffer to check
942 * Return the number of bytes of free space at the head of an &sk_buff.
944 static inline unsigned int skb_headroom(const struct sk_buff *skb)
946 return skb->data - skb->head;
950 * skb_tailroom - bytes at buffer end
951 * @skb: buffer to check
953 * Return the number of bytes of free space at the tail of an sk_buff
955 static inline int skb_tailroom(const struct sk_buff *skb)
957 return skb_is_nonlinear(skb) ? 0 : skb->end - skb->tail;
961 * skb_reserve - adjust headroom
962 * @skb: buffer to alter
963 * @len: bytes to move
965 * Increase the headroom of an empty &sk_buff by reducing the tail
966 * room. This is only allowed for an empty buffer.
968 static inline void skb_reserve(struct sk_buff *skb, int len)
974 #ifdef NET_SKBUFF_DATA_USES_OFFSET
975 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
977 return skb->head + skb->transport_header;
980 static inline void skb_reset_transport_header(struct sk_buff *skb)
982 skb->transport_header = skb->data - skb->head;
985 static inline void skb_set_transport_header(struct sk_buff *skb,
988 skb_reset_transport_header(skb);
989 skb->transport_header += offset;
992 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
994 return skb->head + skb->network_header;
997 static inline void skb_reset_network_header(struct sk_buff *skb)
999 skb->network_header = skb->data - skb->head;
1002 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1004 skb_reset_network_header(skb);
1005 skb->network_header += offset;
1008 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1010 return skb->head + skb->mac_header;
1013 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1015 return skb->mac_header != ~0U;
1018 static inline void skb_reset_mac_header(struct sk_buff *skb)
1020 skb->mac_header = skb->data - skb->head;
1023 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1025 skb_reset_mac_header(skb);
1026 skb->mac_header += offset;
1029 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1031 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
1033 return skb->transport_header;
1036 static inline void skb_reset_transport_header(struct sk_buff *skb)
1038 skb->transport_header = skb->data;
1041 static inline void skb_set_transport_header(struct sk_buff *skb,
1044 skb->transport_header = skb->data + offset;
1047 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
1049 return skb->network_header;
1052 static inline void skb_reset_network_header(struct sk_buff *skb)
1054 skb->network_header = skb->data;
1057 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1059 skb->network_header = skb->data + offset;
1062 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1064 return skb->mac_header;
1067 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1069 return skb->mac_header != NULL;
1072 static inline void skb_reset_mac_header(struct sk_buff *skb)
1074 skb->mac_header = skb->data;
1077 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1079 skb->mac_header = skb->data + offset;
1081 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1083 static inline int skb_transport_offset(const struct sk_buff *skb)
1085 return skb_transport_header(skb) - skb->data;
1088 static inline u32 skb_network_header_len(const struct sk_buff *skb)
1090 return skb->transport_header - skb->network_header;
1093 static inline int skb_network_offset(const struct sk_buff *skb)
1095 return skb_network_header(skb) - skb->data;
1099 * CPUs often take a performance hit when accessing unaligned memory
1100 * locations. The actual performance hit varies, it can be small if the
1101 * hardware handles it or large if we have to take an exception and fix it
1104 * Since an ethernet header is 14 bytes network drivers often end up with
1105 * the IP header at an unaligned offset. The IP header can be aligned by
1106 * shifting the start of the packet by 2 bytes. Drivers should do this
1109 * skb_reserve(NET_IP_ALIGN);
1111 * The downside to this alignment of the IP header is that the DMA is now
1112 * unaligned. On some architectures the cost of an unaligned DMA is high
1113 * and this cost outweighs the gains made by aligning the IP header.
1115 * Since this trade off varies between architectures, we allow NET_IP_ALIGN
1118 #ifndef NET_IP_ALIGN
1119 #define NET_IP_ALIGN 2
1123 * The networking layer reserves some headroom in skb data (via
1124 * dev_alloc_skb). This is used to avoid having to reallocate skb data when
1125 * the header has to grow. In the default case, if the header has to grow
1126 * 16 bytes or less we avoid the reallocation.
1128 * Unfortunately this headroom changes the DMA alignment of the resulting
1129 * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive
1130 * on some architectures. An architecture can override this value,
1131 * perhaps setting it to a cacheline in size (since that will maintain
1132 * cacheline alignment of the DMA). It must be a power of 2.
1134 * Various parts of the networking layer expect at least 16 bytes of
1135 * headroom, you should not reduce this.
1138 #define NET_SKB_PAD 16
1141 extern int ___pskb_trim(struct sk_buff *skb, unsigned int len);
1143 static inline void __skb_trim(struct sk_buff *skb, unsigned int len)
1145 if (unlikely(skb->data_len)) {
1150 skb_set_tail_pointer(skb, len);
1153 extern void skb_trim(struct sk_buff *skb, unsigned int len);
1155 static inline int __pskb_trim(struct sk_buff *skb, unsigned int len)
1158 return ___pskb_trim(skb, len);
1159 __skb_trim(skb, len);
1163 static inline int pskb_trim(struct sk_buff *skb, unsigned int len)
1165 return (len < skb->len) ? __pskb_trim(skb, len) : 0;
1169 * pskb_trim_unique - remove end from a paged unique (not cloned) buffer
1170 * @skb: buffer to alter
1173 * This is identical to pskb_trim except that the caller knows that
1174 * the skb is not cloned so we should never get an error due to out-
1177 static inline void pskb_trim_unique(struct sk_buff *skb, unsigned int len)
1179 int err = pskb_trim(skb, len);
1184 * skb_orphan - orphan a buffer
1185 * @skb: buffer to orphan
1187 * If a buffer currently has an owner then we call the owner's
1188 * destructor function and make the @skb unowned. The buffer continues
1189 * to exist but is no longer charged to its former owner.
1191 static inline void skb_orphan(struct sk_buff *skb)
1193 if (skb->destructor)
1194 skb->destructor(skb);
1195 skb->destructor = NULL;
1200 * __skb_queue_purge - empty a list
1201 * @list: list to empty
1203 * Delete all buffers on an &sk_buff list. Each buffer is removed from
1204 * the list and one reference dropped. This function does not take the
1205 * list lock and the caller must hold the relevant locks to use it.
1207 extern void skb_queue_purge(struct sk_buff_head *list);
1208 static inline void __skb_queue_purge(struct sk_buff_head *list)
1210 struct sk_buff *skb;
1211 while ((skb = __skb_dequeue(list)) != NULL)
1216 * __dev_alloc_skb - allocate an skbuff for receiving
1217 * @length: length to allocate
1218 * @gfp_mask: get_free_pages mask, passed to alloc_skb
1220 * Allocate a new &sk_buff and assign it a usage count of one. The
1221 * buffer has unspecified headroom built in. Users should allocate
1222 * the headroom they think they need without accounting for the
1223 * built in space. The built in space is used for optimisations.
1225 * %NULL is returned if there is no free memory.
1227 static inline struct sk_buff *__dev_alloc_skb(unsigned int length,
1230 struct sk_buff *skb = alloc_skb(length + NET_SKB_PAD, gfp_mask);
1232 skb_reserve(skb, NET_SKB_PAD);
1236 extern struct sk_buff *dev_alloc_skb(unsigned int length);
1238 extern struct sk_buff *__netdev_alloc_skb(struct net_device *dev,
1239 unsigned int length, gfp_t gfp_mask);
1242 * netdev_alloc_skb - allocate an skbuff for rx on a specific device
1243 * @dev: network device to receive on
1244 * @length: length to allocate
1246 * Allocate a new &sk_buff and assign it a usage count of one. The
1247 * buffer has unspecified headroom built in. Users should allocate
1248 * the headroom they think they need without accounting for the
1249 * built in space. The built in space is used for optimisations.
1251 * %NULL is returned if there is no free memory. Although this function
1252 * allocates memory it can be called from an interrupt.
1254 static inline struct sk_buff *netdev_alloc_skb(struct net_device *dev,
1255 unsigned int length)
1257 return __netdev_alloc_skb(dev, length, GFP_ATOMIC);
1261 * skb_clone_writable - is the header of a clone writable
1262 * @skb: buffer to check
1263 * @len: length up to which to write
1265 * Returns true if modifying the header part of the cloned buffer
1266 * does not requires the data to be copied.
1268 static inline int skb_clone_writable(struct sk_buff *skb, unsigned int len)
1270 return !skb_header_cloned(skb) &&
1271 skb_headroom(skb) + len <= skb->hdr_len;
1274 static inline int __skb_cow(struct sk_buff *skb, unsigned int headroom,
1279 if (headroom < NET_SKB_PAD)
1280 headroom = NET_SKB_PAD;
1281 if (headroom > skb_headroom(skb))
1282 delta = headroom - skb_headroom(skb);
1284 if (delta || cloned)
1285 return pskb_expand_head(skb, ALIGN(delta, NET_SKB_PAD), 0,
1291 * skb_cow - copy header of skb when it is required
1292 * @skb: buffer to cow
1293 * @headroom: needed headroom
1295 * If the skb passed lacks sufficient headroom or its data part
1296 * is shared, data is reallocated. If reallocation fails, an error
1297 * is returned and original skb is not changed.
1299 * The result is skb with writable area skb->head...skb->tail
1300 * and at least @headroom of space at head.
1302 static inline int skb_cow(struct sk_buff *skb, unsigned int headroom)
1304 return __skb_cow(skb, headroom, skb_cloned(skb));
1308 * skb_cow_head - skb_cow but only making the head writable
1309 * @skb: buffer to cow
1310 * @headroom: needed headroom
1312 * This function is identical to skb_cow except that we replace the
1313 * skb_cloned check by skb_header_cloned. It should be used when
1314 * you only need to push on some header and do not need to modify
1317 static inline int skb_cow_head(struct sk_buff *skb, unsigned int headroom)
1319 return __skb_cow(skb, headroom, skb_header_cloned(skb));
1323 * skb_padto - pad an skbuff up to a minimal size
1324 * @skb: buffer to pad
1325 * @len: minimal length
1327 * Pads up a buffer to ensure the trailing bytes exist and are
1328 * blanked. If the buffer already contains sufficient data it
1329 * is untouched. Otherwise it is extended. Returns zero on
1330 * success. The skb is freed on error.
1333 static inline int skb_padto(struct sk_buff *skb, unsigned int len)
1335 unsigned int size = skb->len;
1336 if (likely(size >= len))
1338 return skb_pad(skb, len - size);
1341 static inline int skb_add_data(struct sk_buff *skb,
1342 char __user *from, int copy)
1344 const int off = skb->len;
1346 if (skb->ip_summed == CHECKSUM_NONE) {
1348 __wsum csum = csum_and_copy_from_user(from, skb_put(skb, copy),
1351 skb->csum = csum_block_add(skb->csum, csum, off);
1354 } else if (!copy_from_user(skb_put(skb, copy), from, copy))
1357 __skb_trim(skb, off);
1361 static inline int skb_can_coalesce(struct sk_buff *skb, int i,
1362 struct page *page, int off)
1365 struct skb_frag_struct *frag = &skb_shinfo(skb)->frags[i - 1];
1367 return page == frag->page &&
1368 off == frag->page_offset + frag->size;
1373 static inline int __skb_linearize(struct sk_buff *skb)
1375 return __pskb_pull_tail(skb, skb->data_len) ? 0 : -ENOMEM;
1379 * skb_linearize - convert paged skb to linear one
1380 * @skb: buffer to linarize
1382 * If there is no free memory -ENOMEM is returned, otherwise zero
1383 * is returned and the old skb data released.
1385 static inline int skb_linearize(struct sk_buff *skb)
1387 return skb_is_nonlinear(skb) ? __skb_linearize(skb) : 0;
1391 * skb_linearize_cow - make sure skb is linear and writable
1392 * @skb: buffer to process
1394 * If there is no free memory -ENOMEM is returned, otherwise zero
1395 * is returned and the old skb data released.
1397 static inline int skb_linearize_cow(struct sk_buff *skb)
1399 return skb_is_nonlinear(skb) || skb_cloned(skb) ?
1400 __skb_linearize(skb) : 0;
1404 * skb_postpull_rcsum - update checksum for received skb after pull
1405 * @skb: buffer to update
1406 * @start: start of data before pull
1407 * @len: length of data pulled
1409 * After doing a pull on a received packet, you need to call this to
1410 * update the CHECKSUM_COMPLETE checksum, or set ip_summed to
1411 * CHECKSUM_NONE so that it can be recomputed from scratch.
1414 static inline void skb_postpull_rcsum(struct sk_buff *skb,
1415 const void *start, unsigned int len)
1417 if (skb->ip_summed == CHECKSUM_COMPLETE)
1418 skb->csum = csum_sub(skb->csum, csum_partial(start, len, 0));
1421 unsigned char *skb_pull_rcsum(struct sk_buff *skb, unsigned int len);
1424 * pskb_trim_rcsum - trim received skb and update checksum
1425 * @skb: buffer to trim
1428 * This is exactly the same as pskb_trim except that it ensures the
1429 * checksum of received packets are still valid after the operation.
1432 static inline int pskb_trim_rcsum(struct sk_buff *skb, unsigned int len)
1434 if (likely(len >= skb->len))
1436 if (skb->ip_summed == CHECKSUM_COMPLETE)
1437 skb->ip_summed = CHECKSUM_NONE;
1438 return __pskb_trim(skb, len);
1441 #define skb_queue_walk(queue, skb) \
1442 for (skb = (queue)->next; \
1443 prefetch(skb->next), (skb != (struct sk_buff *)(queue)); \
1446 #define skb_queue_walk_safe(queue, skb, tmp) \
1447 for (skb = (queue)->next, tmp = skb->next; \
1448 skb != (struct sk_buff *)(queue); \
1449 skb = tmp, tmp = skb->next)
1451 #define skb_queue_reverse_walk(queue, skb) \
1452 for (skb = (queue)->prev; \
1453 prefetch(skb->prev), (skb != (struct sk_buff *)(queue)); \
1457 extern struct sk_buff *__skb_recv_datagram(struct sock *sk, unsigned flags,
1458 int *peeked, int *err);
1459 extern struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags,
1460 int noblock, int *err);
1461 extern unsigned int datagram_poll(struct file *file, struct socket *sock,
1462 struct poll_table_struct *wait);
1463 extern int skb_copy_datagram_iovec(const struct sk_buff *from,
1464 int offset, struct iovec *to,
1466 extern int skb_copy_and_csum_datagram_iovec(struct sk_buff *skb,
1469 extern int skb_copy_datagram_from_iovec(struct sk_buff *skb,
1473 extern void skb_free_datagram(struct sock *sk, struct sk_buff *skb);
1474 extern int skb_kill_datagram(struct sock *sk, struct sk_buff *skb,
1475 unsigned int flags);
1476 extern __wsum skb_checksum(const struct sk_buff *skb, int offset,
1477 int len, __wsum csum);
1478 extern int skb_copy_bits(const struct sk_buff *skb, int offset,
1480 extern int skb_store_bits(struct sk_buff *skb, int offset,
1481 const void *from, int len);
1482 extern __wsum skb_copy_and_csum_bits(const struct sk_buff *skb,
1483 int offset, u8 *to, int len,
1485 extern int skb_splice_bits(struct sk_buff *skb,
1486 unsigned int offset,
1487 struct pipe_inode_info *pipe,
1489 unsigned int flags);
1490 extern void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to);
1491 extern void skb_split(struct sk_buff *skb,
1492 struct sk_buff *skb1, const u32 len);
1494 extern struct sk_buff *skb_segment(struct sk_buff *skb, int features);
1496 static inline void *skb_header_pointer(const struct sk_buff *skb, int offset,
1497 int len, void *buffer)
1499 int hlen = skb_headlen(skb);
1501 if (hlen - offset >= len)
1502 return skb->data + offset;
1504 if (skb_copy_bits(skb, offset, buffer, len) < 0)
1510 static inline void skb_copy_from_linear_data(const struct sk_buff *skb,
1512 const unsigned int len)
1514 memcpy(to, skb->data, len);
1517 static inline void skb_copy_from_linear_data_offset(const struct sk_buff *skb,
1518 const int offset, void *to,
1519 const unsigned int len)
1521 memcpy(to, skb->data + offset, len);
1524 static inline void skb_copy_to_linear_data(struct sk_buff *skb,
1526 const unsigned int len)
1528 memcpy(skb->data, from, len);
1531 static inline void skb_copy_to_linear_data_offset(struct sk_buff *skb,
1534 const unsigned int len)
1536 memcpy(skb->data + offset, from, len);
1539 extern void skb_init(void);
1542 * skb_get_timestamp - get timestamp from a skb
1543 * @skb: skb to get stamp from
1544 * @stamp: pointer to struct timeval to store stamp in
1546 * Timestamps are stored in the skb as offsets to a base timestamp.
1547 * This function converts the offset back to a struct timeval and stores
1550 static inline void skb_get_timestamp(const struct sk_buff *skb, struct timeval *stamp)
1552 *stamp = ktime_to_timeval(skb->tstamp);
1555 static inline void __net_timestamp(struct sk_buff *skb)
1557 skb->tstamp = ktime_get_real();
1560 static inline ktime_t net_timedelta(ktime_t t)
1562 return ktime_sub(ktime_get_real(), t);
1565 static inline ktime_t net_invalid_timestamp(void)
1567 return ktime_set(0, 0);
1570 extern __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len);
1571 extern __sum16 __skb_checksum_complete(struct sk_buff *skb);
1573 static inline int skb_csum_unnecessary(const struct sk_buff *skb)
1575 return skb->ip_summed & CHECKSUM_UNNECESSARY;
1579 * skb_checksum_complete - Calculate checksum of an entire packet
1580 * @skb: packet to process
1582 * This function calculates the checksum over the entire packet plus
1583 * the value of skb->csum. The latter can be used to supply the
1584 * checksum of a pseudo header as used by TCP/UDP. It returns the
1587 * For protocols that contain complete checksums such as ICMP/TCP/UDP,
1588 * this function can be used to verify that checksum on received
1589 * packets. In that case the function should return zero if the
1590 * checksum is correct. In particular, this function will return zero
1591 * if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the
1592 * hardware has already verified the correctness of the checksum.
1594 static inline __sum16 skb_checksum_complete(struct sk_buff *skb)
1596 return skb_csum_unnecessary(skb) ?
1597 0 : __skb_checksum_complete(skb);
1600 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1601 extern void nf_conntrack_destroy(struct nf_conntrack *nfct);
1602 static inline void nf_conntrack_put(struct nf_conntrack *nfct)
1604 if (nfct && atomic_dec_and_test(&nfct->use))
1605 nf_conntrack_destroy(nfct);
1607 static inline void nf_conntrack_get(struct nf_conntrack *nfct)
1610 atomic_inc(&nfct->use);
1612 static inline void nf_conntrack_get_reasm(struct sk_buff *skb)
1615 atomic_inc(&skb->users);
1617 static inline void nf_conntrack_put_reasm(struct sk_buff *skb)
1623 #ifdef CONFIG_BRIDGE_NETFILTER
1624 static inline void nf_bridge_put(struct nf_bridge_info *nf_bridge)
1626 if (nf_bridge && atomic_dec_and_test(&nf_bridge->use))
1629 static inline void nf_bridge_get(struct nf_bridge_info *nf_bridge)
1632 atomic_inc(&nf_bridge->use);
1634 #endif /* CONFIG_BRIDGE_NETFILTER */
1635 static inline void nf_reset(struct sk_buff *skb)
1637 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1638 nf_conntrack_put(skb->nfct);
1640 nf_conntrack_put_reasm(skb->nfct_reasm);
1641 skb->nfct_reasm = NULL;
1643 #ifdef CONFIG_BRIDGE_NETFILTER
1644 nf_bridge_put(skb->nf_bridge);
1645 skb->nf_bridge = NULL;
1649 /* Note: This doesn't put any conntrack and bridge info in dst. */
1650 static inline void __nf_copy(struct sk_buff *dst, const struct sk_buff *src)
1652 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1653 dst->nfct = src->nfct;
1654 nf_conntrack_get(src->nfct);
1655 dst->nfctinfo = src->nfctinfo;
1656 dst->nfct_reasm = src->nfct_reasm;
1657 nf_conntrack_get_reasm(src->nfct_reasm);
1659 #ifdef CONFIG_BRIDGE_NETFILTER
1660 dst->nf_bridge = src->nf_bridge;
1661 nf_bridge_get(src->nf_bridge);
1665 static inline void nf_copy(struct sk_buff *dst, const struct sk_buff *src)
1667 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1668 nf_conntrack_put(dst->nfct);
1669 nf_conntrack_put_reasm(dst->nfct_reasm);
1671 #ifdef CONFIG_BRIDGE_NETFILTER
1672 nf_bridge_put(dst->nf_bridge);
1674 __nf_copy(dst, src);
1677 #ifdef CONFIG_NETWORK_SECMARK
1678 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
1680 to->secmark = from->secmark;
1683 static inline void skb_init_secmark(struct sk_buff *skb)
1688 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
1691 static inline void skb_init_secmark(struct sk_buff *skb)
1695 static inline void skb_set_queue_mapping(struct sk_buff *skb, u16 queue_mapping)
1697 skb->queue_mapping = queue_mapping;
1700 static inline u16 skb_get_queue_mapping(struct sk_buff *skb)
1702 return skb->queue_mapping;
1705 static inline void skb_copy_queue_mapping(struct sk_buff *to, const struct sk_buff *from)
1707 to->queue_mapping = from->queue_mapping;
1710 static inline int skb_is_gso(const struct sk_buff *skb)
1712 return skb_shinfo(skb)->gso_size;
1715 static inline int skb_is_gso_v6(const struct sk_buff *skb)
1717 return skb_shinfo(skb)->gso_type & SKB_GSO_TCPV6;
1720 extern void __skb_warn_lro_forwarding(const struct sk_buff *skb);
1722 static inline bool skb_warn_if_lro(const struct sk_buff *skb)
1724 /* LRO sets gso_size but not gso_type, whereas if GSO is really
1725 * wanted then gso_type will be set. */
1726 struct skb_shared_info *shinfo = skb_shinfo(skb);
1727 if (shinfo->gso_size != 0 && unlikely(shinfo->gso_type == 0)) {
1728 __skb_warn_lro_forwarding(skb);
1734 static inline void skb_forward_csum(struct sk_buff *skb)
1736 /* Unfortunately we don't support this one. Any brave souls? */
1737 if (skb->ip_summed == CHECKSUM_COMPLETE)
1738 skb->ip_summed = CHECKSUM_NONE;
1741 bool skb_partial_csum_set(struct sk_buff *skb, u16 start, u16 off);
1742 #endif /* __KERNEL__ */
1743 #endif /* _LINUX_SKBUFF_H */