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 struct sk_buff
*frag_list
;
150 skb_frag_t frags
[MAX_SKB_FRAGS
];
153 /* We divide dataref into two halves. The higher 16 bits hold references
154 * to the payload part of skb->data. The lower 16 bits hold references to
155 * the entire skb->data. A clone of a headerless skb holds the length of
156 * the header in skb->hdr_len.
158 * All users must obey the rule that the skb->data reference count must be
159 * greater than or equal to the payload reference count.
161 * Holding a reference to the payload part means that the user does not
162 * care about modifications to the header part of skb->data.
164 #define SKB_DATAREF_SHIFT 16
165 #define SKB_DATAREF_MASK ((1 << SKB_DATAREF_SHIFT) - 1)
169 SKB_FCLONE_UNAVAILABLE
,
175 SKB_GSO_TCPV4
= 1 << 0,
176 SKB_GSO_UDP
= 1 << 1,
178 /* This indicates the skb is from an untrusted source. */
179 SKB_GSO_DODGY
= 1 << 2,
181 /* This indicates the tcp segment has CWR set. */
182 SKB_GSO_TCP_ECN
= 1 << 3,
184 SKB_GSO_TCPV6
= 1 << 4,
187 #if BITS_PER_LONG > 32
188 #define NET_SKBUFF_DATA_USES_OFFSET 1
191 #ifdef NET_SKBUFF_DATA_USES_OFFSET
192 typedef unsigned int sk_buff_data_t
;
194 typedef unsigned char *sk_buff_data_t
;
198 * struct sk_buff - socket buffer
199 * @next: Next buffer in list
200 * @prev: Previous buffer in list
201 * @sk: Socket we are owned by
202 * @tstamp: Time we arrived
203 * @dev: Device we arrived on/are leaving by
204 * @transport_header: Transport layer header
205 * @network_header: Network layer header
206 * @mac_header: Link layer header
207 * @dst: destination entry
208 * @sp: the security path, used for xfrm
209 * @cb: Control buffer. Free for use by every layer. Put private vars here
210 * @len: Length of actual data
211 * @data_len: Data length
212 * @mac_len: Length of link layer header
213 * @hdr_len: writable header length of cloned skb
214 * @csum: Checksum (must include start/offset pair)
215 * @csum_start: Offset from skb->head where checksumming should start
216 * @csum_offset: Offset from csum_start where checksum should be stored
217 * @local_df: allow local fragmentation
218 * @cloned: Head may be cloned (check refcnt to be sure)
219 * @nohdr: Payload reference only, must not modify header
220 * @pkt_type: Packet class
221 * @fclone: skbuff clone status
222 * @ip_summed: Driver fed us an IP checksum
223 * @priority: Packet queueing priority
224 * @users: User count - see {datagram,tcp}.c
225 * @protocol: Packet protocol from driver
226 * @truesize: Buffer size
227 * @head: Head of buffer
228 * @data: Data head pointer
229 * @tail: Tail pointer
231 * @destructor: Destruct function
232 * @mark: Generic packet mark
233 * @nfct: Associated connection, if any
234 * @ipvs_property: skbuff is owned by ipvs
235 * @peeked: this packet has been seen already, so stats have been
236 * done for it, don't do them again
237 * @nf_trace: netfilter packet trace flag
238 * @nfctinfo: Relationship of this skb to the connection
239 * @nfct_reasm: netfilter conntrack re-assembly pointer
240 * @nf_bridge: Saved data about a bridged frame - see br_netfilter.c
241 * @iif: ifindex of device we arrived on
242 * @queue_mapping: Queue mapping for multiqueue devices
243 * @tc_index: Traffic control index
244 * @tc_verd: traffic control verdict
245 * @ndisc_nodetype: router type (from link layer)
246 * @dma_cookie: a cookie to one of several possible DMA operations
247 * done by skb DMA functions
248 * @secmark: security marking
249 * @vlan_tci: vlan tag control information
253 /* These two members must be first. */
254 struct sk_buff
*next
;
255 struct sk_buff
*prev
;
259 struct net_device
*dev
;
262 struct dst_entry
*dst
;
263 struct rtable
*rtable
;
268 * This is the control buffer. It is free to use for every
269 * layer. Please put your private variables there. If you
270 * want to keep them across layers you have to do a skb_clone()
271 * first. This is owned by whoever has the skb queued ATM.
299 void (*destructor
)(struct sk_buff
*skb
);
300 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
301 struct nf_conntrack
*nfct
;
302 struct sk_buff
*nfct_reasm
;
304 #ifdef CONFIG_BRIDGE_NETFILTER
305 struct nf_bridge_info
*nf_bridge
;
310 #ifdef CONFIG_NET_SCHED
311 __u16 tc_index
; /* traffic control index */
312 #ifdef CONFIG_NET_CLS_ACT
313 __u16 tc_verd
; /* traffic control verdict */
316 #ifdef CONFIG_IPV6_NDISC_NODETYPE
317 __u8 ndisc_nodetype
:2;
319 #if defined(CONFIG_MAC80211) || defined(CONFIG_MAC80211_MODULE)
320 __u8 do_not_encrypt
:1;
322 /* 0/13/14 bit hole */
324 #ifdef CONFIG_NET_DMA
325 dma_cookie_t dma_cookie
;
327 #ifdef CONFIG_NETWORK_SECMARK
335 sk_buff_data_t transport_header
;
336 sk_buff_data_t network_header
;
337 sk_buff_data_t mac_header
;
338 /* These elements must be at the end, see alloc_skb() for details. */
343 unsigned int truesize
;
349 * Handling routines are only of interest to the kernel
351 #include <linux/slab.h>
353 #include <asm/system.h>
355 extern void kfree_skb(struct sk_buff
*skb
);
356 extern void __kfree_skb(struct sk_buff
*skb
);
357 extern struct sk_buff
*__alloc_skb(unsigned int size
,
358 gfp_t priority
, int fclone
, int node
);
359 static inline struct sk_buff
*alloc_skb(unsigned int size
,
362 return __alloc_skb(size
, priority
, 0, -1);
365 static inline struct sk_buff
*alloc_skb_fclone(unsigned int size
,
368 return __alloc_skb(size
, priority
, 1, -1);
371 extern struct sk_buff
*skb_morph(struct sk_buff
*dst
, struct sk_buff
*src
);
372 extern struct sk_buff
*skb_clone(struct sk_buff
*skb
,
374 extern struct sk_buff
*skb_copy(const struct sk_buff
*skb
,
376 extern struct sk_buff
*pskb_copy(struct sk_buff
*skb
,
378 extern int pskb_expand_head(struct sk_buff
*skb
,
379 int nhead
, int ntail
,
381 extern struct sk_buff
*skb_realloc_headroom(struct sk_buff
*skb
,
382 unsigned int headroom
);
383 extern struct sk_buff
*skb_copy_expand(const struct sk_buff
*skb
,
384 int newheadroom
, int newtailroom
,
386 extern int skb_to_sgvec(struct sk_buff
*skb
,
387 struct scatterlist
*sg
, int offset
,
389 extern int skb_cow_data(struct sk_buff
*skb
, int tailbits
,
390 struct sk_buff
**trailer
);
391 extern int skb_pad(struct sk_buff
*skb
, int pad
);
392 #define dev_kfree_skb(a) kfree_skb(a)
393 extern void skb_over_panic(struct sk_buff
*skb
, int len
,
395 extern void skb_under_panic(struct sk_buff
*skb
, int len
,
397 extern void skb_truesize_bug(struct sk_buff
*skb
);
399 static inline void skb_truesize_check(struct sk_buff
*skb
)
401 int len
= sizeof(struct sk_buff
) + skb
->len
;
403 if (unlikely((int)skb
->truesize
< len
))
404 skb_truesize_bug(skb
);
407 extern int skb_append_datato_frags(struct sock
*sk
, struct sk_buff
*skb
,
408 int getfrag(void *from
, char *to
, int offset
,
409 int len
,int odd
, struct sk_buff
*skb
),
410 void *from
, int length
);
417 __u32 stepped_offset
;
418 struct sk_buff
*root_skb
;
419 struct sk_buff
*cur_skb
;
423 extern void skb_prepare_seq_read(struct sk_buff
*skb
,
424 unsigned int from
, unsigned int to
,
425 struct skb_seq_state
*st
);
426 extern unsigned int skb_seq_read(unsigned int consumed
, const u8
**data
,
427 struct skb_seq_state
*st
);
428 extern void skb_abort_seq_read(struct skb_seq_state
*st
);
430 extern unsigned int skb_find_text(struct sk_buff
*skb
, unsigned int from
,
431 unsigned int to
, struct ts_config
*config
,
432 struct ts_state
*state
);
434 #ifdef NET_SKBUFF_DATA_USES_OFFSET
435 static inline unsigned char *skb_end_pointer(const struct sk_buff
*skb
)
437 return skb
->head
+ skb
->end
;
440 static inline unsigned char *skb_end_pointer(const struct sk_buff
*skb
)
447 #define skb_shinfo(SKB) ((struct skb_shared_info *)(skb_end_pointer(SKB)))
450 * skb_queue_empty - check if a queue is empty
453 * Returns true if the queue is empty, false otherwise.
455 static inline int skb_queue_empty(const struct sk_buff_head
*list
)
457 return list
->next
== (struct sk_buff
*)list
;
461 * skb_get - reference buffer
462 * @skb: buffer to reference
464 * Makes another reference to a socket buffer and returns a pointer
467 static inline struct sk_buff
*skb_get(struct sk_buff
*skb
)
469 atomic_inc(&skb
->users
);
474 * If users == 1, we are the only owner and are can avoid redundant
479 * skb_cloned - is the buffer a clone
480 * @skb: buffer to check
482 * Returns true if the buffer was generated with skb_clone() and is
483 * one of multiple shared copies of the buffer. Cloned buffers are
484 * shared data so must not be written to under normal circumstances.
486 static inline int skb_cloned(const struct sk_buff
*skb
)
488 return skb
->cloned
&&
489 (atomic_read(&skb_shinfo(skb
)->dataref
) & SKB_DATAREF_MASK
) != 1;
493 * skb_header_cloned - is the header a clone
494 * @skb: buffer to check
496 * Returns true if modifying the header part of the buffer requires
497 * the data to be copied.
499 static inline int skb_header_cloned(const struct sk_buff
*skb
)
506 dataref
= atomic_read(&skb_shinfo(skb
)->dataref
);
507 dataref
= (dataref
& SKB_DATAREF_MASK
) - (dataref
>> SKB_DATAREF_SHIFT
);
512 * skb_header_release - release reference to header
513 * @skb: buffer to operate on
515 * Drop a reference to the header part of the buffer. This is done
516 * by acquiring a payload reference. You must not read from the header
517 * part of skb->data after this.
519 static inline void skb_header_release(struct sk_buff
*skb
)
523 atomic_add(1 << SKB_DATAREF_SHIFT
, &skb_shinfo(skb
)->dataref
);
527 * skb_shared - is the buffer shared
528 * @skb: buffer to check
530 * Returns true if more than one person has a reference to this
533 static inline int skb_shared(const struct sk_buff
*skb
)
535 return atomic_read(&skb
->users
) != 1;
539 * skb_share_check - check if buffer is shared and if so clone it
540 * @skb: buffer to check
541 * @pri: priority for memory allocation
543 * If the buffer is shared the buffer is cloned and the old copy
544 * drops a reference. A new clone with a single reference is returned.
545 * If the buffer is not shared the original buffer is returned. When
546 * being called from interrupt status or with spinlocks held pri must
549 * NULL is returned on a memory allocation failure.
551 static inline struct sk_buff
*skb_share_check(struct sk_buff
*skb
,
554 might_sleep_if(pri
& __GFP_WAIT
);
555 if (skb_shared(skb
)) {
556 struct sk_buff
*nskb
= skb_clone(skb
, pri
);
564 * Copy shared buffers into a new sk_buff. We effectively do COW on
565 * packets to handle cases where we have a local reader and forward
566 * and a couple of other messy ones. The normal one is tcpdumping
567 * a packet thats being forwarded.
571 * skb_unshare - make a copy of a shared buffer
572 * @skb: buffer to check
573 * @pri: priority for memory allocation
575 * If the socket buffer is a clone then this function creates a new
576 * copy of the data, drops a reference count on the old copy and returns
577 * the new copy with the reference count at 1. If the buffer is not a clone
578 * the original buffer is returned. When called with a spinlock held or
579 * from interrupt state @pri must be %GFP_ATOMIC
581 * %NULL is returned on a memory allocation failure.
583 static inline struct sk_buff
*skb_unshare(struct sk_buff
*skb
,
586 might_sleep_if(pri
& __GFP_WAIT
);
587 if (skb_cloned(skb
)) {
588 struct sk_buff
*nskb
= skb_copy(skb
, pri
);
589 kfree_skb(skb
); /* Free our shared copy */
597 * @list_: list to peek at
599 * Peek an &sk_buff. Unlike most other operations you _MUST_
600 * be careful with this one. A peek leaves the buffer on the
601 * list and someone else may run off with it. You must hold
602 * the appropriate locks or have a private queue to do this.
604 * Returns %NULL for an empty list or a pointer to the head element.
605 * The reference count is not incremented and the reference is therefore
606 * volatile. Use with caution.
608 static inline struct sk_buff
*skb_peek(struct sk_buff_head
*list_
)
610 struct sk_buff
*list
= ((struct sk_buff
*)list_
)->next
;
611 if (list
== (struct sk_buff
*)list_
)
618 * @list_: list to peek at
620 * Peek an &sk_buff. Unlike most other operations you _MUST_
621 * be careful with this one. A peek leaves the buffer on the
622 * list and someone else may run off with it. You must hold
623 * the appropriate locks or have a private queue to do this.
625 * Returns %NULL for an empty list or a pointer to the tail element.
626 * The reference count is not incremented and the reference is therefore
627 * volatile. Use with caution.
629 static inline struct sk_buff
*skb_peek_tail(struct sk_buff_head
*list_
)
631 struct sk_buff
*list
= ((struct sk_buff
*)list_
)->prev
;
632 if (list
== (struct sk_buff
*)list_
)
638 * skb_queue_len - get queue length
639 * @list_: list to measure
641 * Return the length of an &sk_buff queue.
643 static inline __u32
skb_queue_len(const struct sk_buff_head
*list_
)
649 * This function creates a split out lock class for each invocation;
650 * this is needed for now since a whole lot of users of the skb-queue
651 * infrastructure in drivers have different locking usage (in hardirq)
652 * than the networking core (in softirq only). In the long run either the
653 * network layer or drivers should need annotation to consolidate the
654 * main types of usage into 3 classes.
656 static inline void skb_queue_head_init(struct sk_buff_head
*list
)
658 spin_lock_init(&list
->lock
);
659 list
->prev
= list
->next
= (struct sk_buff
*)list
;
663 static inline void skb_queue_head_init_class(struct sk_buff_head
*list
,
664 struct lock_class_key
*class)
666 skb_queue_head_init(list
);
667 lockdep_set_class(&list
->lock
, class);
671 * Insert an sk_buff on a list.
673 * The "__skb_xxxx()" functions are the non-atomic ones that
674 * can only be called with interrupts disabled.
676 extern void skb_insert(struct sk_buff
*old
, struct sk_buff
*newsk
, struct sk_buff_head
*list
);
677 static inline void __skb_insert(struct sk_buff
*newsk
,
678 struct sk_buff
*prev
, struct sk_buff
*next
,
679 struct sk_buff_head
*list
)
683 next
->prev
= prev
->next
= newsk
;
688 * __skb_queue_after - queue a buffer at the list head
690 * @prev: place after this buffer
691 * @newsk: buffer to queue
693 * Queue a buffer int the middle of a list. This function takes no locks
694 * and you must therefore hold required locks before calling it.
696 * A buffer cannot be placed on two lists at the same time.
698 static inline void __skb_queue_after(struct sk_buff_head
*list
,
699 struct sk_buff
*prev
,
700 struct sk_buff
*newsk
)
702 __skb_insert(newsk
, prev
, prev
->next
, list
);
705 extern void skb_append(struct sk_buff
*old
, struct sk_buff
*newsk
,
706 struct sk_buff_head
*list
);
708 static inline void __skb_queue_before(struct sk_buff_head
*list
,
709 struct sk_buff
*next
,
710 struct sk_buff
*newsk
)
712 __skb_insert(newsk
, next
->prev
, next
, list
);
716 * __skb_queue_head - queue a buffer at the list head
718 * @newsk: buffer to queue
720 * Queue a buffer at the start of a list. This function takes no locks
721 * and you must therefore hold required locks before calling it.
723 * A buffer cannot be placed on two lists at the same time.
725 extern void skb_queue_head(struct sk_buff_head
*list
, struct sk_buff
*newsk
);
726 static inline void __skb_queue_head(struct sk_buff_head
*list
,
727 struct sk_buff
*newsk
)
729 __skb_queue_after(list
, (struct sk_buff
*)list
, newsk
);
733 * __skb_queue_tail - queue a buffer at the list tail
735 * @newsk: buffer to queue
737 * Queue a buffer at the end of a list. This function takes no locks
738 * and you must therefore hold required locks before calling it.
740 * A buffer cannot be placed on two lists at the same time.
742 extern void skb_queue_tail(struct sk_buff_head
*list
, struct sk_buff
*newsk
);
743 static inline void __skb_queue_tail(struct sk_buff_head
*list
,
744 struct sk_buff
*newsk
)
746 __skb_queue_before(list
, (struct sk_buff
*)list
, newsk
);
750 * remove sk_buff from list. _Must_ be called atomically, and with
753 extern void skb_unlink(struct sk_buff
*skb
, struct sk_buff_head
*list
);
754 static inline void __skb_unlink(struct sk_buff
*skb
, struct sk_buff_head
*list
)
756 struct sk_buff
*next
, *prev
;
761 skb
->next
= skb
->prev
= NULL
;
767 * __skb_dequeue - remove from the head of the queue
768 * @list: list to dequeue from
770 * Remove the head of the list. This function does not take any locks
771 * so must be used with appropriate locks held only. The head item is
772 * returned or %NULL if the list is empty.
774 extern struct sk_buff
*skb_dequeue(struct sk_buff_head
*list
);
775 static inline struct sk_buff
*__skb_dequeue(struct sk_buff_head
*list
)
777 struct sk_buff
*skb
= skb_peek(list
);
779 __skb_unlink(skb
, list
);
784 * __skb_dequeue_tail - remove from the tail of the queue
785 * @list: list to dequeue from
787 * Remove the tail of the list. This function does not take any locks
788 * so must be used with appropriate locks held only. The tail item is
789 * returned or %NULL if the list is empty.
791 extern struct sk_buff
*skb_dequeue_tail(struct sk_buff_head
*list
);
792 static inline struct sk_buff
*__skb_dequeue_tail(struct sk_buff_head
*list
)
794 struct sk_buff
*skb
= skb_peek_tail(list
);
796 __skb_unlink(skb
, list
);
801 static inline int skb_is_nonlinear(const struct sk_buff
*skb
)
803 return skb
->data_len
;
806 static inline unsigned int skb_headlen(const struct sk_buff
*skb
)
808 return skb
->len
- skb
->data_len
;
811 static inline int skb_pagelen(const struct sk_buff
*skb
)
815 for (i
= (int)skb_shinfo(skb
)->nr_frags
- 1; i
>= 0; i
--)
816 len
+= skb_shinfo(skb
)->frags
[i
].size
;
817 return len
+ skb_headlen(skb
);
820 static inline void skb_fill_page_desc(struct sk_buff
*skb
, int i
,
821 struct page
*page
, int off
, int size
)
823 skb_frag_t
*frag
= &skb_shinfo(skb
)->frags
[i
];
826 frag
->page_offset
= off
;
828 skb_shinfo(skb
)->nr_frags
= i
+ 1;
831 #define SKB_PAGE_ASSERT(skb) BUG_ON(skb_shinfo(skb)->nr_frags)
832 #define SKB_FRAG_ASSERT(skb) BUG_ON(skb_shinfo(skb)->frag_list)
833 #define SKB_LINEAR_ASSERT(skb) BUG_ON(skb_is_nonlinear(skb))
835 #ifdef NET_SKBUFF_DATA_USES_OFFSET
836 static inline unsigned char *skb_tail_pointer(const struct sk_buff
*skb
)
838 return skb
->head
+ skb
->tail
;
841 static inline void skb_reset_tail_pointer(struct sk_buff
*skb
)
843 skb
->tail
= skb
->data
- skb
->head
;
846 static inline void skb_set_tail_pointer(struct sk_buff
*skb
, const int offset
)
848 skb_reset_tail_pointer(skb
);
851 #else /* NET_SKBUFF_DATA_USES_OFFSET */
852 static inline unsigned char *skb_tail_pointer(const struct sk_buff
*skb
)
857 static inline void skb_reset_tail_pointer(struct sk_buff
*skb
)
859 skb
->tail
= skb
->data
;
862 static inline void skb_set_tail_pointer(struct sk_buff
*skb
, const int offset
)
864 skb
->tail
= skb
->data
+ offset
;
867 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
870 * Add data to an sk_buff
872 extern unsigned char *skb_put(struct sk_buff
*skb
, unsigned int len
);
873 static inline unsigned char *__skb_put(struct sk_buff
*skb
, unsigned int len
)
875 unsigned char *tmp
= skb_tail_pointer(skb
);
876 SKB_LINEAR_ASSERT(skb
);
882 extern unsigned char *skb_push(struct sk_buff
*skb
, unsigned int len
);
883 static inline unsigned char *__skb_push(struct sk_buff
*skb
, unsigned int len
)
890 extern unsigned char *skb_pull(struct sk_buff
*skb
, unsigned int len
);
891 static inline unsigned char *__skb_pull(struct sk_buff
*skb
, unsigned int len
)
894 BUG_ON(skb
->len
< skb
->data_len
);
895 return skb
->data
+= len
;
898 extern unsigned char *__pskb_pull_tail(struct sk_buff
*skb
, int delta
);
900 static inline unsigned char *__pskb_pull(struct sk_buff
*skb
, unsigned int len
)
902 if (len
> skb_headlen(skb
) &&
903 !__pskb_pull_tail(skb
, len
-skb_headlen(skb
)))
906 return skb
->data
+= len
;
909 static inline unsigned char *pskb_pull(struct sk_buff
*skb
, unsigned int len
)
911 return unlikely(len
> skb
->len
) ? NULL
: __pskb_pull(skb
, len
);
914 static inline int pskb_may_pull(struct sk_buff
*skb
, unsigned int len
)
916 if (likely(len
<= skb_headlen(skb
)))
918 if (unlikely(len
> skb
->len
))
920 return __pskb_pull_tail(skb
, len
-skb_headlen(skb
)) != NULL
;
924 * skb_headroom - bytes at buffer head
925 * @skb: buffer to check
927 * Return the number of bytes of free space at the head of an &sk_buff.
929 static inline unsigned int skb_headroom(const struct sk_buff
*skb
)
931 return skb
->data
- skb
->head
;
935 * skb_tailroom - bytes at buffer end
936 * @skb: buffer to check
938 * Return the number of bytes of free space at the tail of an sk_buff
940 static inline int skb_tailroom(const struct sk_buff
*skb
)
942 return skb_is_nonlinear(skb
) ? 0 : skb
->end
- skb
->tail
;
946 * skb_reserve - adjust headroom
947 * @skb: buffer to alter
948 * @len: bytes to move
950 * Increase the headroom of an empty &sk_buff by reducing the tail
951 * room. This is only allowed for an empty buffer.
953 static inline void skb_reserve(struct sk_buff
*skb
, int len
)
959 #ifdef NET_SKBUFF_DATA_USES_OFFSET
960 static inline unsigned char *skb_transport_header(const struct sk_buff
*skb
)
962 return skb
->head
+ skb
->transport_header
;
965 static inline void skb_reset_transport_header(struct sk_buff
*skb
)
967 skb
->transport_header
= skb
->data
- skb
->head
;
970 static inline void skb_set_transport_header(struct sk_buff
*skb
,
973 skb_reset_transport_header(skb
);
974 skb
->transport_header
+= offset
;
977 static inline unsigned char *skb_network_header(const struct sk_buff
*skb
)
979 return skb
->head
+ skb
->network_header
;
982 static inline void skb_reset_network_header(struct sk_buff
*skb
)
984 skb
->network_header
= skb
->data
- skb
->head
;
987 static inline void skb_set_network_header(struct sk_buff
*skb
, const int offset
)
989 skb_reset_network_header(skb
);
990 skb
->network_header
+= offset
;
993 static inline unsigned char *skb_mac_header(const struct sk_buff
*skb
)
995 return skb
->head
+ skb
->mac_header
;
998 static inline int skb_mac_header_was_set(const struct sk_buff
*skb
)
1000 return skb
->mac_header
!= ~0U;
1003 static inline void skb_reset_mac_header(struct sk_buff
*skb
)
1005 skb
->mac_header
= skb
->data
- skb
->head
;
1008 static inline void skb_set_mac_header(struct sk_buff
*skb
, const int offset
)
1010 skb_reset_mac_header(skb
);
1011 skb
->mac_header
+= offset
;
1014 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1016 static inline unsigned char *skb_transport_header(const struct sk_buff
*skb
)
1018 return skb
->transport_header
;
1021 static inline void skb_reset_transport_header(struct sk_buff
*skb
)
1023 skb
->transport_header
= skb
->data
;
1026 static inline void skb_set_transport_header(struct sk_buff
*skb
,
1029 skb
->transport_header
= skb
->data
+ offset
;
1032 static inline unsigned char *skb_network_header(const struct sk_buff
*skb
)
1034 return skb
->network_header
;
1037 static inline void skb_reset_network_header(struct sk_buff
*skb
)
1039 skb
->network_header
= skb
->data
;
1042 static inline void skb_set_network_header(struct sk_buff
*skb
, const int offset
)
1044 skb
->network_header
= skb
->data
+ offset
;
1047 static inline unsigned char *skb_mac_header(const struct sk_buff
*skb
)
1049 return skb
->mac_header
;
1052 static inline int skb_mac_header_was_set(const struct sk_buff
*skb
)
1054 return skb
->mac_header
!= NULL
;
1057 static inline void skb_reset_mac_header(struct sk_buff
*skb
)
1059 skb
->mac_header
= skb
->data
;
1062 static inline void skb_set_mac_header(struct sk_buff
*skb
, const int offset
)
1064 skb
->mac_header
= skb
->data
+ offset
;
1066 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1068 static inline int skb_transport_offset(const struct sk_buff
*skb
)
1070 return skb_transport_header(skb
) - skb
->data
;
1073 static inline u32
skb_network_header_len(const struct sk_buff
*skb
)
1075 return skb
->transport_header
- skb
->network_header
;
1078 static inline int skb_network_offset(const struct sk_buff
*skb
)
1080 return skb_network_header(skb
) - skb
->data
;
1084 * CPUs often take a performance hit when accessing unaligned memory
1085 * locations. The actual performance hit varies, it can be small if the
1086 * hardware handles it or large if we have to take an exception and fix it
1089 * Since an ethernet header is 14 bytes network drivers often end up with
1090 * the IP header at an unaligned offset. The IP header can be aligned by
1091 * shifting the start of the packet by 2 bytes. Drivers should do this
1094 * skb_reserve(NET_IP_ALIGN);
1096 * The downside to this alignment of the IP header is that the DMA is now
1097 * unaligned. On some architectures the cost of an unaligned DMA is high
1098 * and this cost outweighs the gains made by aligning the IP header.
1100 * Since this trade off varies between architectures, we allow NET_IP_ALIGN
1103 #ifndef NET_IP_ALIGN
1104 #define NET_IP_ALIGN 2
1108 * The networking layer reserves some headroom in skb data (via
1109 * dev_alloc_skb). This is used to avoid having to reallocate skb data when
1110 * the header has to grow. In the default case, if the header has to grow
1111 * 16 bytes or less we avoid the reallocation.
1113 * Unfortunately this headroom changes the DMA alignment of the resulting
1114 * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive
1115 * on some architectures. An architecture can override this value,
1116 * perhaps setting it to a cacheline in size (since that will maintain
1117 * cacheline alignment of the DMA). It must be a power of 2.
1119 * Various parts of the networking layer expect at least 16 bytes of
1120 * headroom, you should not reduce this.
1123 #define NET_SKB_PAD 16
1126 extern int ___pskb_trim(struct sk_buff
*skb
, unsigned int len
);
1128 static inline void __skb_trim(struct sk_buff
*skb
, unsigned int len
)
1130 if (unlikely(skb
->data_len
)) {
1135 skb_set_tail_pointer(skb
, len
);
1138 extern void skb_trim(struct sk_buff
*skb
, unsigned int len
);
1140 static inline int __pskb_trim(struct sk_buff
*skb
, unsigned int len
)
1143 return ___pskb_trim(skb
, len
);
1144 __skb_trim(skb
, len
);
1148 static inline int pskb_trim(struct sk_buff
*skb
, unsigned int len
)
1150 return (len
< skb
->len
) ? __pskb_trim(skb
, len
) : 0;
1154 * pskb_trim_unique - remove end from a paged unique (not cloned) buffer
1155 * @skb: buffer to alter
1158 * This is identical to pskb_trim except that the caller knows that
1159 * the skb is not cloned so we should never get an error due to out-
1162 static inline void pskb_trim_unique(struct sk_buff
*skb
, unsigned int len
)
1164 int err
= pskb_trim(skb
, len
);
1169 * skb_orphan - orphan a buffer
1170 * @skb: buffer to orphan
1172 * If a buffer currently has an owner then we call the owner's
1173 * destructor function and make the @skb unowned. The buffer continues
1174 * to exist but is no longer charged to its former owner.
1176 static inline void skb_orphan(struct sk_buff
*skb
)
1178 if (skb
->destructor
)
1179 skb
->destructor(skb
);
1180 skb
->destructor
= NULL
;
1185 * __skb_queue_purge - empty a list
1186 * @list: list to empty
1188 * Delete all buffers on an &sk_buff list. Each buffer is removed from
1189 * the list and one reference dropped. This function does not take the
1190 * list lock and the caller must hold the relevant locks to use it.
1192 extern void skb_queue_purge(struct sk_buff_head
*list
);
1193 static inline void __skb_queue_purge(struct sk_buff_head
*list
)
1195 struct sk_buff
*skb
;
1196 while ((skb
= __skb_dequeue(list
)) != NULL
)
1201 * __dev_alloc_skb - allocate an skbuff for receiving
1202 * @length: length to allocate
1203 * @gfp_mask: get_free_pages mask, passed to alloc_skb
1205 * Allocate a new &sk_buff and assign it a usage count of one. The
1206 * buffer has unspecified headroom built in. Users should allocate
1207 * the headroom they think they need without accounting for the
1208 * built in space. The built in space is used for optimisations.
1210 * %NULL is returned if there is no free memory.
1212 static inline struct sk_buff
*__dev_alloc_skb(unsigned int length
,
1215 struct sk_buff
*skb
= alloc_skb(length
+ NET_SKB_PAD
, gfp_mask
);
1217 skb_reserve(skb
, NET_SKB_PAD
);
1221 extern struct sk_buff
*dev_alloc_skb(unsigned int length
);
1223 extern struct sk_buff
*__netdev_alloc_skb(struct net_device
*dev
,
1224 unsigned int length
, gfp_t gfp_mask
);
1227 * netdev_alloc_skb - allocate an skbuff for rx on a specific device
1228 * @dev: network device to receive on
1229 * @length: length to allocate
1231 * Allocate a new &sk_buff and assign it a usage count of one. The
1232 * buffer has unspecified headroom built in. Users should allocate
1233 * the headroom they think they need without accounting for the
1234 * built in space. The built in space is used for optimisations.
1236 * %NULL is returned if there is no free memory. Although this function
1237 * allocates memory it can be called from an interrupt.
1239 static inline struct sk_buff
*netdev_alloc_skb(struct net_device
*dev
,
1240 unsigned int length
)
1242 return __netdev_alloc_skb(dev
, length
, GFP_ATOMIC
);
1246 * skb_clone_writable - is the header of a clone writable
1247 * @skb: buffer to check
1248 * @len: length up to which to write
1250 * Returns true if modifying the header part of the cloned buffer
1251 * does not requires the data to be copied.
1253 static inline int skb_clone_writable(struct sk_buff
*skb
, unsigned int len
)
1255 return !skb_header_cloned(skb
) &&
1256 skb_headroom(skb
) + len
<= skb
->hdr_len
;
1259 static inline int __skb_cow(struct sk_buff
*skb
, unsigned int headroom
,
1264 if (headroom
< NET_SKB_PAD
)
1265 headroom
= NET_SKB_PAD
;
1266 if (headroom
> skb_headroom(skb
))
1267 delta
= headroom
- skb_headroom(skb
);
1269 if (delta
|| cloned
)
1270 return pskb_expand_head(skb
, ALIGN(delta
, NET_SKB_PAD
), 0,
1276 * skb_cow - copy header of skb when it is required
1277 * @skb: buffer to cow
1278 * @headroom: needed headroom
1280 * If the skb passed lacks sufficient headroom or its data part
1281 * is shared, data is reallocated. If reallocation fails, an error
1282 * is returned and original skb is not changed.
1284 * The result is skb with writable area skb->head...skb->tail
1285 * and at least @headroom of space at head.
1287 static inline int skb_cow(struct sk_buff
*skb
, unsigned int headroom
)
1289 return __skb_cow(skb
, headroom
, skb_cloned(skb
));
1293 * skb_cow_head - skb_cow but only making the head writable
1294 * @skb: buffer to cow
1295 * @headroom: needed headroom
1297 * This function is identical to skb_cow except that we replace the
1298 * skb_cloned check by skb_header_cloned. It should be used when
1299 * you only need to push on some header and do not need to modify
1302 static inline int skb_cow_head(struct sk_buff
*skb
, unsigned int headroom
)
1304 return __skb_cow(skb
, headroom
, skb_header_cloned(skb
));
1308 * skb_padto - pad an skbuff up to a minimal size
1309 * @skb: buffer to pad
1310 * @len: minimal length
1312 * Pads up a buffer to ensure the trailing bytes exist and are
1313 * blanked. If the buffer already contains sufficient data it
1314 * is untouched. Otherwise it is extended. Returns zero on
1315 * success. The skb is freed on error.
1318 static inline int skb_padto(struct sk_buff
*skb
, unsigned int len
)
1320 unsigned int size
= skb
->len
;
1321 if (likely(size
>= len
))
1323 return skb_pad(skb
, len
-size
);
1326 static inline int skb_add_data(struct sk_buff
*skb
,
1327 char __user
*from
, int copy
)
1329 const int off
= skb
->len
;
1331 if (skb
->ip_summed
== CHECKSUM_NONE
) {
1333 __wsum csum
= csum_and_copy_from_user(from
, skb_put(skb
, copy
),
1336 skb
->csum
= csum_block_add(skb
->csum
, csum
, off
);
1339 } else if (!copy_from_user(skb_put(skb
, copy
), from
, copy
))
1342 __skb_trim(skb
, off
);
1346 static inline int skb_can_coalesce(struct sk_buff
*skb
, int i
,
1347 struct page
*page
, int off
)
1350 struct skb_frag_struct
*frag
= &skb_shinfo(skb
)->frags
[i
- 1];
1352 return page
== frag
->page
&&
1353 off
== frag
->page_offset
+ frag
->size
;
1358 static inline int __skb_linearize(struct sk_buff
*skb
)
1360 return __pskb_pull_tail(skb
, skb
->data_len
) ? 0 : -ENOMEM
;
1364 * skb_linearize - convert paged skb to linear one
1365 * @skb: buffer to linarize
1367 * If there is no free memory -ENOMEM is returned, otherwise zero
1368 * is returned and the old skb data released.
1370 static inline int skb_linearize(struct sk_buff
*skb
)
1372 return skb_is_nonlinear(skb
) ? __skb_linearize(skb
) : 0;
1376 * skb_linearize_cow - make sure skb is linear and writable
1377 * @skb: buffer to process
1379 * If there is no free memory -ENOMEM is returned, otherwise zero
1380 * is returned and the old skb data released.
1382 static inline int skb_linearize_cow(struct sk_buff
*skb
)
1384 return skb_is_nonlinear(skb
) || skb_cloned(skb
) ?
1385 __skb_linearize(skb
) : 0;
1389 * skb_postpull_rcsum - update checksum for received skb after pull
1390 * @skb: buffer to update
1391 * @start: start of data before pull
1392 * @len: length of data pulled
1394 * After doing a pull on a received packet, you need to call this to
1395 * update the CHECKSUM_COMPLETE checksum, or set ip_summed to
1396 * CHECKSUM_NONE so that it can be recomputed from scratch.
1399 static inline void skb_postpull_rcsum(struct sk_buff
*skb
,
1400 const void *start
, unsigned int len
)
1402 if (skb
->ip_summed
== CHECKSUM_COMPLETE
)
1403 skb
->csum
= csum_sub(skb
->csum
, csum_partial(start
, len
, 0));
1406 unsigned char *skb_pull_rcsum(struct sk_buff
*skb
, unsigned int len
);
1409 * pskb_trim_rcsum - trim received skb and update checksum
1410 * @skb: buffer to trim
1413 * This is exactly the same as pskb_trim except that it ensures the
1414 * checksum of received packets are still valid after the operation.
1417 static inline int pskb_trim_rcsum(struct sk_buff
*skb
, unsigned int len
)
1419 if (likely(len
>= skb
->len
))
1421 if (skb
->ip_summed
== CHECKSUM_COMPLETE
)
1422 skb
->ip_summed
= CHECKSUM_NONE
;
1423 return __pskb_trim(skb
, len
);
1426 #define skb_queue_walk(queue, skb) \
1427 for (skb = (queue)->next; \
1428 prefetch(skb->next), (skb != (struct sk_buff *)(queue)); \
1431 #define skb_queue_walk_safe(queue, skb, tmp) \
1432 for (skb = (queue)->next, tmp = skb->next; \
1433 skb != (struct sk_buff *)(queue); \
1434 skb = tmp, tmp = skb->next)
1436 #define skb_queue_reverse_walk(queue, skb) \
1437 for (skb = (queue)->prev; \
1438 prefetch(skb->prev), (skb != (struct sk_buff *)(queue)); \
1442 extern struct sk_buff
*__skb_recv_datagram(struct sock
*sk
, unsigned flags
,
1443 int *peeked
, int *err
);
1444 extern struct sk_buff
*skb_recv_datagram(struct sock
*sk
, unsigned flags
,
1445 int noblock
, int *err
);
1446 extern unsigned int datagram_poll(struct file
*file
, struct socket
*sock
,
1447 struct poll_table_struct
*wait
);
1448 extern int skb_copy_datagram_iovec(const struct sk_buff
*from
,
1449 int offset
, struct iovec
*to
,
1451 extern int skb_copy_and_csum_datagram_iovec(struct sk_buff
*skb
,
1454 extern void skb_free_datagram(struct sock
*sk
, struct sk_buff
*skb
);
1455 extern int skb_kill_datagram(struct sock
*sk
, struct sk_buff
*skb
,
1456 unsigned int flags
);
1457 extern __wsum
skb_checksum(const struct sk_buff
*skb
, int offset
,
1458 int len
, __wsum csum
);
1459 extern int skb_copy_bits(const struct sk_buff
*skb
, int offset
,
1461 extern int skb_store_bits(struct sk_buff
*skb
, int offset
,
1462 const void *from
, int len
);
1463 extern __wsum
skb_copy_and_csum_bits(const struct sk_buff
*skb
,
1464 int offset
, u8
*to
, int len
,
1466 extern int skb_splice_bits(struct sk_buff
*skb
,
1467 unsigned int offset
,
1468 struct pipe_inode_info
*pipe
,
1470 unsigned int flags
);
1471 extern void skb_copy_and_csum_dev(const struct sk_buff
*skb
, u8
*to
);
1472 extern void skb_split(struct sk_buff
*skb
,
1473 struct sk_buff
*skb1
, const u32 len
);
1475 extern struct sk_buff
*skb_segment(struct sk_buff
*skb
, int features
);
1477 static inline void *skb_header_pointer(const struct sk_buff
*skb
, int offset
,
1478 int len
, void *buffer
)
1480 int hlen
= skb_headlen(skb
);
1482 if (hlen
- offset
>= len
)
1483 return skb
->data
+ offset
;
1485 if (skb_copy_bits(skb
, offset
, buffer
, len
) < 0)
1491 static inline void skb_copy_from_linear_data(const struct sk_buff
*skb
,
1493 const unsigned int len
)
1495 memcpy(to
, skb
->data
, len
);
1498 static inline void skb_copy_from_linear_data_offset(const struct sk_buff
*skb
,
1499 const int offset
, void *to
,
1500 const unsigned int len
)
1502 memcpy(to
, skb
->data
+ offset
, len
);
1505 static inline void skb_copy_to_linear_data(struct sk_buff
*skb
,
1507 const unsigned int len
)
1509 memcpy(skb
->data
, from
, len
);
1512 static inline void skb_copy_to_linear_data_offset(struct sk_buff
*skb
,
1515 const unsigned int len
)
1517 memcpy(skb
->data
+ offset
, from
, len
);
1520 extern void skb_init(void);
1523 * skb_get_timestamp - get timestamp from a skb
1524 * @skb: skb to get stamp from
1525 * @stamp: pointer to struct timeval to store stamp in
1527 * Timestamps are stored in the skb as offsets to a base timestamp.
1528 * This function converts the offset back to a struct timeval and stores
1531 static inline void skb_get_timestamp(const struct sk_buff
*skb
, struct timeval
*stamp
)
1533 *stamp
= ktime_to_timeval(skb
->tstamp
);
1536 static inline void __net_timestamp(struct sk_buff
*skb
)
1538 skb
->tstamp
= ktime_get_real();
1541 static inline ktime_t
net_timedelta(ktime_t t
)
1543 return ktime_sub(ktime_get_real(), t
);
1546 static inline ktime_t
net_invalid_timestamp(void)
1548 return ktime_set(0, 0);
1551 extern __sum16
__skb_checksum_complete_head(struct sk_buff
*skb
, int len
);
1552 extern __sum16
__skb_checksum_complete(struct sk_buff
*skb
);
1554 static inline int skb_csum_unnecessary(const struct sk_buff
*skb
)
1556 return skb
->ip_summed
& CHECKSUM_UNNECESSARY
;
1560 * skb_checksum_complete - Calculate checksum of an entire packet
1561 * @skb: packet to process
1563 * This function calculates the checksum over the entire packet plus
1564 * the value of skb->csum. The latter can be used to supply the
1565 * checksum of a pseudo header as used by TCP/UDP. It returns the
1568 * For protocols that contain complete checksums such as ICMP/TCP/UDP,
1569 * this function can be used to verify that checksum on received
1570 * packets. In that case the function should return zero if the
1571 * checksum is correct. In particular, this function will return zero
1572 * if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the
1573 * hardware has already verified the correctness of the checksum.
1575 static inline __sum16
skb_checksum_complete(struct sk_buff
*skb
)
1577 return skb_csum_unnecessary(skb
) ?
1578 0 : __skb_checksum_complete(skb
);
1581 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1582 extern void nf_conntrack_destroy(struct nf_conntrack
*nfct
);
1583 static inline void nf_conntrack_put(struct nf_conntrack
*nfct
)
1585 if (nfct
&& atomic_dec_and_test(&nfct
->use
))
1586 nf_conntrack_destroy(nfct
);
1588 static inline void nf_conntrack_get(struct nf_conntrack
*nfct
)
1591 atomic_inc(&nfct
->use
);
1593 static inline void nf_conntrack_get_reasm(struct sk_buff
*skb
)
1596 atomic_inc(&skb
->users
);
1598 static inline void nf_conntrack_put_reasm(struct sk_buff
*skb
)
1604 #ifdef CONFIG_BRIDGE_NETFILTER
1605 static inline void nf_bridge_put(struct nf_bridge_info
*nf_bridge
)
1607 if (nf_bridge
&& atomic_dec_and_test(&nf_bridge
->use
))
1610 static inline void nf_bridge_get(struct nf_bridge_info
*nf_bridge
)
1613 atomic_inc(&nf_bridge
->use
);
1615 #endif /* CONFIG_BRIDGE_NETFILTER */
1616 static inline void nf_reset(struct sk_buff
*skb
)
1618 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1619 nf_conntrack_put(skb
->nfct
);
1621 nf_conntrack_put_reasm(skb
->nfct_reasm
);
1622 skb
->nfct_reasm
= NULL
;
1624 #ifdef CONFIG_BRIDGE_NETFILTER
1625 nf_bridge_put(skb
->nf_bridge
);
1626 skb
->nf_bridge
= NULL
;
1630 /* Note: This doesn't put any conntrack and bridge info in dst. */
1631 static inline void __nf_copy(struct sk_buff
*dst
, const struct sk_buff
*src
)
1633 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1634 dst
->nfct
= src
->nfct
;
1635 nf_conntrack_get(src
->nfct
);
1636 dst
->nfctinfo
= src
->nfctinfo
;
1637 dst
->nfct_reasm
= src
->nfct_reasm
;
1638 nf_conntrack_get_reasm(src
->nfct_reasm
);
1640 #ifdef CONFIG_BRIDGE_NETFILTER
1641 dst
->nf_bridge
= src
->nf_bridge
;
1642 nf_bridge_get(src
->nf_bridge
);
1646 static inline void nf_copy(struct sk_buff
*dst
, const struct sk_buff
*src
)
1648 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1649 nf_conntrack_put(dst
->nfct
);
1650 nf_conntrack_put_reasm(dst
->nfct_reasm
);
1652 #ifdef CONFIG_BRIDGE_NETFILTER
1653 nf_bridge_put(dst
->nf_bridge
);
1655 __nf_copy(dst
, src
);
1658 #ifdef CONFIG_NETWORK_SECMARK
1659 static inline void skb_copy_secmark(struct sk_buff
*to
, const struct sk_buff
*from
)
1661 to
->secmark
= from
->secmark
;
1664 static inline void skb_init_secmark(struct sk_buff
*skb
)
1669 static inline void skb_copy_secmark(struct sk_buff
*to
, const struct sk_buff
*from
)
1672 static inline void skb_init_secmark(struct sk_buff
*skb
)
1676 static inline void skb_set_queue_mapping(struct sk_buff
*skb
, u16 queue_mapping
)
1678 skb
->queue_mapping
= queue_mapping
;
1681 static inline u16
skb_get_queue_mapping(struct sk_buff
*skb
)
1683 return skb
->queue_mapping
;
1686 static inline void skb_copy_queue_mapping(struct sk_buff
*to
, const struct sk_buff
*from
)
1688 to
->queue_mapping
= from
->queue_mapping
;
1691 static inline int skb_is_gso(const struct sk_buff
*skb
)
1693 return skb_shinfo(skb
)->gso_size
;
1696 static inline int skb_is_gso_v6(const struct sk_buff
*skb
)
1698 return skb_shinfo(skb
)->gso_type
& SKB_GSO_TCPV6
;
1701 extern void __skb_warn_lro_forwarding(const struct sk_buff
*skb
);
1703 static inline bool skb_warn_if_lro(const struct sk_buff
*skb
)
1705 /* LRO sets gso_size but not gso_type, whereas if GSO is really
1706 * wanted then gso_type will be set. */
1707 struct skb_shared_info
*shinfo
= skb_shinfo(skb
);
1708 if (shinfo
->gso_size
!= 0 && unlikely(shinfo
->gso_type
== 0)) {
1709 __skb_warn_lro_forwarding(skb
);
1715 static inline void skb_forward_csum(struct sk_buff
*skb
)
1717 /* Unfortunately we don't support this one. Any brave souls? */
1718 if (skb
->ip_summed
== CHECKSUM_COMPLETE
)
1719 skb
->ip_summed
= CHECKSUM_NONE
;
1722 bool skb_partial_csum_set(struct sk_buff
*skb
, u16 start
, u16 off
);
1723 #endif /* __KERNEL__ */
1724 #endif /* _LINUX_SKBUFF_H */