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 #define CHECKSUM_NONE 0
36 #define CHECKSUM_PARTIAL 1
37 #define CHECKSUM_UNNECESSARY 2
38 #define CHECKSUM_COMPLETE 3
40 #define SKB_DATA_ALIGN(X) (((X) + (SMP_CACHE_BYTES - 1)) & \
41 ~(SMP_CACHE_BYTES - 1))
42 #define SKB_WITH_OVERHEAD(X) \
43 (((X) - sizeof(struct skb_shared_info)) & \
44 ~(SMP_CACHE_BYTES - 1))
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 * B. Checksumming on output.
69 * NONE: skb is checksummed by protocol or csum is not required.
71 * PARTIAL: device is required to csum packet as seen by hard_start_xmit
72 * from skb->transport_header to the end and to record the checksum
73 * at skb->transport_header + skb->csum.
75 * Device must show its capabilities in dev->features, set
76 * at device setup time.
77 * NETIF_F_HW_CSUM - it is clever device, it is able to checksum
79 * NETIF_F_NO_CSUM - loopback or reliable single hop media.
80 * NETIF_F_IP_CSUM - device is dumb. It is able to csum only
81 * TCP/UDP over IPv4. Sigh. Vendors like this
82 * way by an unknown reason. Though, see comment above
83 * about CHECKSUM_UNNECESSARY. 8)
85 * Any questions? No questions, good. --ANK
90 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
96 #ifdef CONFIG_BRIDGE_NETFILTER
97 struct nf_bridge_info
{
99 struct net_device
*physindev
;
100 struct net_device
*physoutdev
;
101 #if defined(CONFIG_VLAN_8021Q) || defined(CONFIG_VLAN_8021Q_MODULE)
102 struct net_device
*netoutdev
;
105 unsigned long data
[32 / sizeof(unsigned long)];
109 struct sk_buff_head
{
110 /* These two members must be first. */
111 struct sk_buff
*next
;
112 struct sk_buff
*prev
;
120 /* To allow 64K frame to be packed as single skb without frag_list */
121 #define MAX_SKB_FRAGS (65536/PAGE_SIZE + 2)
123 typedef struct skb_frag_struct skb_frag_t
;
125 struct skb_frag_struct
{
131 /* This data is invariant across clones and lives at
132 * the end of the header data, ie. at skb->end.
134 struct skb_shared_info
{
136 unsigned short nr_frags
;
137 unsigned short gso_size
;
138 /* Warning: this field is not always filled in (UFO)! */
139 unsigned short gso_segs
;
140 unsigned short gso_type
;
142 struct sk_buff
*frag_list
;
143 skb_frag_t frags
[MAX_SKB_FRAGS
];
146 /* We divide dataref into two halves. The higher 16 bits hold references
147 * to the payload part of skb->data. The lower 16 bits hold references to
148 * the entire skb->data. It is up to the users of the skb to agree on
149 * where the payload starts.
151 * All users must obey the rule that the skb->data reference count must be
152 * greater than or equal to the payload reference count.
154 * Holding a reference to the payload part means that the user does not
155 * care about modifications to the header part of skb->data.
157 #define SKB_DATAREF_SHIFT 16
158 #define SKB_DATAREF_MASK ((1 << SKB_DATAREF_SHIFT) - 1)
162 SKB_FCLONE_UNAVAILABLE
,
168 SKB_GSO_TCPV4
= 1 << 0,
169 SKB_GSO_UDP
= 1 << 1,
171 /* This indicates the skb is from an untrusted source. */
172 SKB_GSO_DODGY
= 1 << 2,
174 /* This indicates the tcp segment has CWR set. */
175 SKB_GSO_TCP_ECN
= 1 << 3,
177 SKB_GSO_TCPV6
= 1 << 4,
180 #if BITS_PER_LONG > 32
181 #define NET_SKBUFF_DATA_USES_OFFSET 1
184 #ifdef NET_SKBUFF_DATA_USES_OFFSET
185 typedef unsigned int sk_buff_data_t
;
187 typedef unsigned char *sk_buff_data_t
;
191 * struct sk_buff - socket buffer
192 * @next: Next buffer in list
193 * @prev: Previous buffer in list
194 * @sk: Socket we are owned by
195 * @tstamp: Time we arrived
196 * @dev: Device we arrived on/are leaving by
197 * @iif: ifindex of device we arrived on
198 * @h: Transport layer header
199 * @network_header: Network layer header
200 * @mac_header: Link layer header
201 * @dst: destination entry
202 * @sp: the security path, used for xfrm
203 * @cb: Control buffer. Free for use by every layer. Put private vars here
204 * @len: Length of actual data
205 * @data_len: Data length
206 * @mac_len: Length of link layer header
208 * @local_df: allow local fragmentation
209 * @cloned: Head may be cloned (check refcnt to be sure)
210 * @nohdr: Payload reference only, must not modify header
211 * @pkt_type: Packet class
212 * @fclone: skbuff clone status
213 * @ip_summed: Driver fed us an IP checksum
214 * @priority: Packet queueing priority
215 * @users: User count - see {datagram,tcp}.c
216 * @protocol: Packet protocol from driver
217 * @truesize: Buffer size
218 * @head: Head of buffer
219 * @data: Data head pointer
220 * @tail: Tail pointer
222 * @destructor: Destruct function
223 * @mark: Generic packet mark
224 * @nfct: Associated connection, if any
225 * @ipvs_property: skbuff is owned by ipvs
226 * @nfctinfo: Relationship of this skb to the connection
227 * @nfct_reasm: netfilter conntrack re-assembly pointer
228 * @nf_bridge: Saved data about a bridged frame - see br_netfilter.c
229 * @tc_index: Traffic control index
230 * @tc_verd: traffic control verdict
231 * @dma_cookie: a cookie to one of several possible DMA operations
232 * done by skb DMA functions
233 * @secmark: security marking
237 /* These two members must be first. */
238 struct sk_buff
*next
;
239 struct sk_buff
*prev
;
243 struct net_device
*dev
;
245 /* 4 byte hole on 64 bit*/
247 struct dst_entry
*dst
;
251 * This is the control buffer. It is free to use for every
252 * layer. Please put your private variables there. If you
253 * want to keep them across layers you have to do a skb_clone()
254 * first. This is owned by whoever has the skb queued ATM.
276 void (*destructor
)(struct sk_buff
*skb
);
277 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
278 struct nf_conntrack
*nfct
;
279 struct sk_buff
*nfct_reasm
;
281 #ifdef CONFIG_BRIDGE_NETFILTER
282 struct nf_bridge_info
*nf_bridge
;
284 #ifdef CONFIG_NET_SCHED
285 __u16 tc_index
; /* traffic control index */
286 #ifdef CONFIG_NET_CLS_ACT
287 __u16 tc_verd
; /* traffic control verdict */
290 #ifdef CONFIG_NET_DMA
291 dma_cookie_t dma_cookie
;
293 #ifdef CONFIG_NETWORK_SECMARK
299 sk_buff_data_t transport_header
;
300 sk_buff_data_t network_header
;
301 sk_buff_data_t mac_header
;
302 /* These elements must be at the end, see alloc_skb() for details. */
307 unsigned int truesize
;
313 * Handling routines are only of interest to the kernel
315 #include <linux/slab.h>
317 #include <asm/system.h>
319 extern void kfree_skb(struct sk_buff
*skb
);
320 extern void __kfree_skb(struct sk_buff
*skb
);
321 extern struct sk_buff
*__alloc_skb(unsigned int size
,
322 gfp_t priority
, int fclone
, int node
);
323 static inline struct sk_buff
*alloc_skb(unsigned int size
,
326 return __alloc_skb(size
, priority
, 0, -1);
329 static inline struct sk_buff
*alloc_skb_fclone(unsigned int size
,
332 return __alloc_skb(size
, priority
, 1, -1);
335 extern void kfree_skbmem(struct sk_buff
*skb
);
336 extern struct sk_buff
*skb_clone(struct sk_buff
*skb
,
338 extern struct sk_buff
*skb_copy(const struct sk_buff
*skb
,
340 extern struct sk_buff
*pskb_copy(struct sk_buff
*skb
,
342 extern int pskb_expand_head(struct sk_buff
*skb
,
343 int nhead
, int ntail
,
345 extern struct sk_buff
*skb_realloc_headroom(struct sk_buff
*skb
,
346 unsigned int headroom
);
347 extern struct sk_buff
*skb_copy_expand(const struct sk_buff
*skb
,
348 int newheadroom
, int newtailroom
,
350 extern int skb_pad(struct sk_buff
*skb
, int pad
);
351 #define dev_kfree_skb(a) kfree_skb(a)
352 extern void skb_over_panic(struct sk_buff
*skb
, int len
,
354 extern void skb_under_panic(struct sk_buff
*skb
, int len
,
356 extern void skb_truesize_bug(struct sk_buff
*skb
);
358 static inline void skb_truesize_check(struct sk_buff
*skb
)
360 if (unlikely((int)skb
->truesize
< sizeof(struct sk_buff
) + skb
->len
))
361 skb_truesize_bug(skb
);
364 extern int skb_append_datato_frags(struct sock
*sk
, struct sk_buff
*skb
,
365 int getfrag(void *from
, char *to
, int offset
,
366 int len
,int odd
, struct sk_buff
*skb
),
367 void *from
, int length
);
374 __u32 stepped_offset
;
375 struct sk_buff
*root_skb
;
376 struct sk_buff
*cur_skb
;
380 extern void skb_prepare_seq_read(struct sk_buff
*skb
,
381 unsigned int from
, unsigned int to
,
382 struct skb_seq_state
*st
);
383 extern unsigned int skb_seq_read(unsigned int consumed
, const u8
**data
,
384 struct skb_seq_state
*st
);
385 extern void skb_abort_seq_read(struct skb_seq_state
*st
);
387 extern unsigned int skb_find_text(struct sk_buff
*skb
, unsigned int from
,
388 unsigned int to
, struct ts_config
*config
,
389 struct ts_state
*state
);
391 #ifdef NET_SKBUFF_DATA_USES_OFFSET
392 static inline unsigned char *skb_end_pointer(const struct sk_buff
*skb
)
394 return skb
->head
+ skb
->end
;
397 static inline unsigned char *skb_end_pointer(const struct sk_buff
*skb
)
404 #define skb_shinfo(SKB) ((struct skb_shared_info *)(skb_end_pointer(SKB)))
407 * skb_queue_empty - check if a queue is empty
410 * Returns true if the queue is empty, false otherwise.
412 static inline int skb_queue_empty(const struct sk_buff_head
*list
)
414 return list
->next
== (struct sk_buff
*)list
;
418 * skb_get - reference buffer
419 * @skb: buffer to reference
421 * Makes another reference to a socket buffer and returns a pointer
424 static inline struct sk_buff
*skb_get(struct sk_buff
*skb
)
426 atomic_inc(&skb
->users
);
431 * If users == 1, we are the only owner and are can avoid redundant
436 * skb_cloned - is the buffer a clone
437 * @skb: buffer to check
439 * Returns true if the buffer was generated with skb_clone() and is
440 * one of multiple shared copies of the buffer. Cloned buffers are
441 * shared data so must not be written to under normal circumstances.
443 static inline int skb_cloned(const struct sk_buff
*skb
)
445 return skb
->cloned
&&
446 (atomic_read(&skb_shinfo(skb
)->dataref
) & SKB_DATAREF_MASK
) != 1;
450 * skb_header_cloned - is the header a clone
451 * @skb: buffer to check
453 * Returns true if modifying the header part of the buffer requires
454 * the data to be copied.
456 static inline int skb_header_cloned(const struct sk_buff
*skb
)
463 dataref
= atomic_read(&skb_shinfo(skb
)->dataref
);
464 dataref
= (dataref
& SKB_DATAREF_MASK
) - (dataref
>> SKB_DATAREF_SHIFT
);
469 * skb_header_release - release reference to header
470 * @skb: buffer to operate on
472 * Drop a reference to the header part of the buffer. This is done
473 * by acquiring a payload reference. You must not read from the header
474 * part of skb->data after this.
476 static inline void skb_header_release(struct sk_buff
*skb
)
480 atomic_add(1 << SKB_DATAREF_SHIFT
, &skb_shinfo(skb
)->dataref
);
484 * skb_shared - is the buffer shared
485 * @skb: buffer to check
487 * Returns true if more than one person has a reference to this
490 static inline int skb_shared(const struct sk_buff
*skb
)
492 return atomic_read(&skb
->users
) != 1;
496 * skb_share_check - check if buffer is shared and if so clone it
497 * @skb: buffer to check
498 * @pri: priority for memory allocation
500 * If the buffer is shared the buffer is cloned and the old copy
501 * drops a reference. A new clone with a single reference is returned.
502 * If the buffer is not shared the original buffer is returned. When
503 * being called from interrupt status or with spinlocks held pri must
506 * NULL is returned on a memory allocation failure.
508 static inline struct sk_buff
*skb_share_check(struct sk_buff
*skb
,
511 might_sleep_if(pri
& __GFP_WAIT
);
512 if (skb_shared(skb
)) {
513 struct sk_buff
*nskb
= skb_clone(skb
, pri
);
521 * Copy shared buffers into a new sk_buff. We effectively do COW on
522 * packets to handle cases where we have a local reader and forward
523 * and a couple of other messy ones. The normal one is tcpdumping
524 * a packet thats being forwarded.
528 * skb_unshare - make a copy of a shared buffer
529 * @skb: buffer to check
530 * @pri: priority for memory allocation
532 * If the socket buffer is a clone then this function creates a new
533 * copy of the data, drops a reference count on the old copy and returns
534 * the new copy with the reference count at 1. If the buffer is not a clone
535 * the original buffer is returned. When called with a spinlock held or
536 * from interrupt state @pri must be %GFP_ATOMIC
538 * %NULL is returned on a memory allocation failure.
540 static inline struct sk_buff
*skb_unshare(struct sk_buff
*skb
,
543 might_sleep_if(pri
& __GFP_WAIT
);
544 if (skb_cloned(skb
)) {
545 struct sk_buff
*nskb
= skb_copy(skb
, pri
);
546 kfree_skb(skb
); /* Free our shared copy */
554 * @list_: list to peek at
556 * Peek an &sk_buff. Unlike most other operations you _MUST_
557 * be careful with this one. A peek leaves the buffer on the
558 * list and someone else may run off with it. You must hold
559 * the appropriate locks or have a private queue to do this.
561 * Returns %NULL for an empty list or a pointer to the head element.
562 * The reference count is not incremented and the reference is therefore
563 * volatile. Use with caution.
565 static inline struct sk_buff
*skb_peek(struct sk_buff_head
*list_
)
567 struct sk_buff
*list
= ((struct sk_buff
*)list_
)->next
;
568 if (list
== (struct sk_buff
*)list_
)
575 * @list_: list to peek at
577 * Peek an &sk_buff. Unlike most other operations you _MUST_
578 * be careful with this one. A peek leaves the buffer on the
579 * list and someone else may run off with it. You must hold
580 * the appropriate locks or have a private queue to do this.
582 * Returns %NULL for an empty list or a pointer to the tail element.
583 * The reference count is not incremented and the reference is therefore
584 * volatile. Use with caution.
586 static inline struct sk_buff
*skb_peek_tail(struct sk_buff_head
*list_
)
588 struct sk_buff
*list
= ((struct sk_buff
*)list_
)->prev
;
589 if (list
== (struct sk_buff
*)list_
)
595 * skb_queue_len - get queue length
596 * @list_: list to measure
598 * Return the length of an &sk_buff queue.
600 static inline __u32
skb_queue_len(const struct sk_buff_head
*list_
)
606 * This function creates a split out lock class for each invocation;
607 * this is needed for now since a whole lot of users of the skb-queue
608 * infrastructure in drivers have different locking usage (in hardirq)
609 * than the networking core (in softirq only). In the long run either the
610 * network layer or drivers should need annotation to consolidate the
611 * main types of usage into 3 classes.
613 static inline void skb_queue_head_init(struct sk_buff_head
*list
)
615 spin_lock_init(&list
->lock
);
616 list
->prev
= list
->next
= (struct sk_buff
*)list
;
620 static inline void skb_queue_head_init_class(struct sk_buff_head
*list
,
621 struct lock_class_key
*class)
623 skb_queue_head_init(list
);
624 lockdep_set_class(&list
->lock
, class);
628 * Insert an sk_buff at the start of a list.
630 * The "__skb_xxxx()" functions are the non-atomic ones that
631 * can only be called with interrupts disabled.
635 * __skb_queue_after - queue a buffer at the list head
637 * @prev: place after this buffer
638 * @newsk: buffer to queue
640 * Queue a buffer int the middle of a list. This function takes no locks
641 * and you must therefore hold required locks before calling it.
643 * A buffer cannot be placed on two lists at the same time.
645 static inline void __skb_queue_after(struct sk_buff_head
*list
,
646 struct sk_buff
*prev
,
647 struct sk_buff
*newsk
)
649 struct sk_buff
*next
;
655 next
->prev
= prev
->next
= newsk
;
659 * __skb_queue_head - queue a buffer at the list head
661 * @newsk: buffer to queue
663 * Queue a buffer at the start of a list. This function takes no locks
664 * and you must therefore hold required locks before calling it.
666 * A buffer cannot be placed on two lists at the same time.
668 extern void skb_queue_head(struct sk_buff_head
*list
, struct sk_buff
*newsk
);
669 static inline void __skb_queue_head(struct sk_buff_head
*list
,
670 struct sk_buff
*newsk
)
672 __skb_queue_after(list
, (struct sk_buff
*)list
, newsk
);
676 * __skb_queue_tail - queue a buffer at the list tail
678 * @newsk: buffer to queue
680 * Queue a buffer at the end of a list. This function takes no locks
681 * and you must therefore hold required locks before calling it.
683 * A buffer cannot be placed on two lists at the same time.
685 extern void skb_queue_tail(struct sk_buff_head
*list
, struct sk_buff
*newsk
);
686 static inline void __skb_queue_tail(struct sk_buff_head
*list
,
687 struct sk_buff
*newsk
)
689 struct sk_buff
*prev
, *next
;
692 next
= (struct sk_buff
*)list
;
696 next
->prev
= prev
->next
= newsk
;
701 * __skb_dequeue - remove from the head of the queue
702 * @list: list to dequeue from
704 * Remove the head of the list. This function does not take any locks
705 * so must be used with appropriate locks held only. The head item is
706 * returned or %NULL if the list is empty.
708 extern struct sk_buff
*skb_dequeue(struct sk_buff_head
*list
);
709 static inline struct sk_buff
*__skb_dequeue(struct sk_buff_head
*list
)
711 struct sk_buff
*next
, *prev
, *result
;
713 prev
= (struct sk_buff
*) list
;
722 result
->next
= result
->prev
= NULL
;
729 * Insert a packet on a list.
731 extern void skb_insert(struct sk_buff
*old
, struct sk_buff
*newsk
, struct sk_buff_head
*list
);
732 static inline void __skb_insert(struct sk_buff
*newsk
,
733 struct sk_buff
*prev
, struct sk_buff
*next
,
734 struct sk_buff_head
*list
)
738 next
->prev
= prev
->next
= newsk
;
743 * Place a packet after a given packet in a list.
745 extern void skb_append(struct sk_buff
*old
, struct sk_buff
*newsk
, struct sk_buff_head
*list
);
746 static inline void __skb_append(struct sk_buff
*old
, struct sk_buff
*newsk
, struct sk_buff_head
*list
)
748 __skb_insert(newsk
, old
, old
->next
, list
);
752 * remove sk_buff from list. _Must_ be called atomically, and with
755 extern void skb_unlink(struct sk_buff
*skb
, struct sk_buff_head
*list
);
756 static inline void __skb_unlink(struct sk_buff
*skb
, struct sk_buff_head
*list
)
758 struct sk_buff
*next
, *prev
;
763 skb
->next
= skb
->prev
= NULL
;
769 /* XXX: more streamlined implementation */
772 * __skb_dequeue_tail - remove from the tail of the queue
773 * @list: list to dequeue from
775 * Remove the tail of the list. This function does not take any locks
776 * so must be used with appropriate locks held only. The tail item is
777 * returned or %NULL if the list is empty.
779 extern struct sk_buff
*skb_dequeue_tail(struct sk_buff_head
*list
);
780 static inline struct sk_buff
*__skb_dequeue_tail(struct sk_buff_head
*list
)
782 struct sk_buff
*skb
= skb_peek_tail(list
);
784 __skb_unlink(skb
, list
);
789 static inline int skb_is_nonlinear(const struct sk_buff
*skb
)
791 return skb
->data_len
;
794 static inline unsigned int skb_headlen(const struct sk_buff
*skb
)
796 return skb
->len
- skb
->data_len
;
799 static inline int skb_pagelen(const struct sk_buff
*skb
)
803 for (i
= (int)skb_shinfo(skb
)->nr_frags
- 1; i
>= 0; i
--)
804 len
+= skb_shinfo(skb
)->frags
[i
].size
;
805 return len
+ skb_headlen(skb
);
808 static inline void skb_fill_page_desc(struct sk_buff
*skb
, int i
,
809 struct page
*page
, int off
, int size
)
811 skb_frag_t
*frag
= &skb_shinfo(skb
)->frags
[i
];
814 frag
->page_offset
= off
;
816 skb_shinfo(skb
)->nr_frags
= i
+ 1;
819 #define SKB_PAGE_ASSERT(skb) BUG_ON(skb_shinfo(skb)->nr_frags)
820 #define SKB_FRAG_ASSERT(skb) BUG_ON(skb_shinfo(skb)->frag_list)
821 #define SKB_LINEAR_ASSERT(skb) BUG_ON(skb_is_nonlinear(skb))
823 #ifdef NET_SKBUFF_DATA_USES_OFFSET
824 static inline unsigned char *skb_tail_pointer(const struct sk_buff
*skb
)
826 return skb
->head
+ skb
->tail
;
829 static inline void skb_reset_tail_pointer(struct sk_buff
*skb
)
831 skb
->tail
= skb
->data
- skb
->head
;
834 static inline void skb_set_tail_pointer(struct sk_buff
*skb
, const int offset
)
836 skb_reset_tail_pointer(skb
);
839 #else /* NET_SKBUFF_DATA_USES_OFFSET */
840 static inline unsigned char *skb_tail_pointer(const struct sk_buff
*skb
)
845 static inline void skb_reset_tail_pointer(struct sk_buff
*skb
)
847 skb
->tail
= skb
->data
;
850 static inline void skb_set_tail_pointer(struct sk_buff
*skb
, const int offset
)
852 skb
->tail
= skb
->data
+ offset
;
855 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
858 * Add data to an sk_buff
860 static inline unsigned char *__skb_put(struct sk_buff
*skb
, unsigned int len
)
862 unsigned char *tmp
= skb_tail_pointer(skb
);
863 SKB_LINEAR_ASSERT(skb
);
870 * skb_put - add data to a buffer
871 * @skb: buffer to use
872 * @len: amount of data to add
874 * This function extends the used data area of the buffer. If this would
875 * exceed the total buffer size the kernel will panic. A pointer to the
876 * first byte of the extra data is returned.
878 static inline unsigned char *skb_put(struct sk_buff
*skb
, unsigned int len
)
880 unsigned char *tmp
= skb_tail_pointer(skb
);
881 SKB_LINEAR_ASSERT(skb
);
884 if (unlikely(skb
->tail
> skb
->end
))
885 skb_over_panic(skb
, len
, current_text_addr());
889 static inline unsigned char *__skb_push(struct sk_buff
*skb
, unsigned int len
)
897 * skb_push - add data to the start of a buffer
898 * @skb: buffer to use
899 * @len: amount of data to add
901 * This function extends the used data area of the buffer at the buffer
902 * start. If this would exceed the total buffer headroom the kernel will
903 * panic. A pointer to the first byte of the extra data is returned.
905 static inline unsigned char *skb_push(struct sk_buff
*skb
, unsigned int len
)
909 if (unlikely(skb
->data
<skb
->head
))
910 skb_under_panic(skb
, len
, current_text_addr());
914 static inline unsigned char *__skb_pull(struct sk_buff
*skb
, unsigned int len
)
917 BUG_ON(skb
->len
< skb
->data_len
);
918 return skb
->data
+= len
;
922 * skb_pull - remove data from the start of a buffer
923 * @skb: buffer to use
924 * @len: amount of data to remove
926 * This function removes data from the start of a buffer, returning
927 * the memory to the headroom. A pointer to the next data in the buffer
928 * is returned. Once the data has been pulled future pushes will overwrite
931 static inline unsigned char *skb_pull(struct sk_buff
*skb
, unsigned int len
)
933 return unlikely(len
> skb
->len
) ? NULL
: __skb_pull(skb
, len
);
936 extern unsigned char *__pskb_pull_tail(struct sk_buff
*skb
, int delta
);
938 static inline unsigned char *__pskb_pull(struct sk_buff
*skb
, unsigned int len
)
940 if (len
> skb_headlen(skb
) &&
941 !__pskb_pull_tail(skb
, len
-skb_headlen(skb
)))
944 return skb
->data
+= len
;
947 static inline unsigned char *pskb_pull(struct sk_buff
*skb
, unsigned int len
)
949 return unlikely(len
> skb
->len
) ? NULL
: __pskb_pull(skb
, len
);
952 static inline int pskb_may_pull(struct sk_buff
*skb
, unsigned int len
)
954 if (likely(len
<= skb_headlen(skb
)))
956 if (unlikely(len
> skb
->len
))
958 return __pskb_pull_tail(skb
, len
-skb_headlen(skb
)) != NULL
;
962 * skb_headroom - bytes at buffer head
963 * @skb: buffer to check
965 * Return the number of bytes of free space at the head of an &sk_buff.
967 static inline int skb_headroom(const struct sk_buff
*skb
)
969 return skb
->data
- skb
->head
;
973 * skb_tailroom - bytes at buffer end
974 * @skb: buffer to check
976 * Return the number of bytes of free space at the tail of an sk_buff
978 static inline int skb_tailroom(const struct sk_buff
*skb
)
980 return skb_is_nonlinear(skb
) ? 0 : skb
->end
- skb
->tail
;
984 * skb_reserve - adjust headroom
985 * @skb: buffer to alter
986 * @len: bytes to move
988 * Increase the headroom of an empty &sk_buff by reducing the tail
989 * room. This is only allowed for an empty buffer.
991 static inline void skb_reserve(struct sk_buff
*skb
, int len
)
997 #ifdef NET_SKBUFF_DATA_USES_OFFSET
998 static inline unsigned char *skb_transport_header(const struct sk_buff
*skb
)
1000 return skb
->head
+ skb
->transport_header
;
1003 static inline void skb_reset_transport_header(struct sk_buff
*skb
)
1005 skb
->transport_header
= skb
->data
- skb
->head
;
1008 static inline void skb_set_transport_header(struct sk_buff
*skb
,
1011 skb_reset_transport_header(skb
);
1012 skb
->transport_header
+= offset
;
1015 static inline unsigned char *skb_network_header(const struct sk_buff
*skb
)
1017 return skb
->head
+ skb
->network_header
;
1020 static inline void skb_reset_network_header(struct sk_buff
*skb
)
1022 skb
->network_header
= skb
->data
- skb
->head
;
1025 static inline void skb_set_network_header(struct sk_buff
*skb
, const int offset
)
1027 skb_reset_network_header(skb
);
1028 skb
->network_header
+= offset
;
1031 static inline unsigned char *skb_mac_header(const struct sk_buff
*skb
)
1033 return skb
->head
+ skb
->mac_header
;
1036 static inline int skb_mac_header_was_set(const struct sk_buff
*skb
)
1038 return skb
->mac_header
!= ~0U;
1041 static inline void skb_reset_mac_header(struct sk_buff
*skb
)
1043 skb
->mac_header
= skb
->data
- skb
->head
;
1046 static inline void skb_set_mac_header(struct sk_buff
*skb
, const int offset
)
1048 skb_reset_mac_header(skb
);
1049 skb
->mac_header
+= offset
;
1052 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1054 static inline unsigned char *skb_transport_header(const struct sk_buff
*skb
)
1056 return skb
->transport_header
;
1059 static inline void skb_reset_transport_header(struct sk_buff
*skb
)
1061 skb
->transport_header
= skb
->data
;
1064 static inline void skb_set_transport_header(struct sk_buff
*skb
,
1067 skb
->transport_header
= skb
->data
+ offset
;
1070 static inline unsigned char *skb_network_header(const struct sk_buff
*skb
)
1072 return skb
->network_header
;
1075 static inline void skb_reset_network_header(struct sk_buff
*skb
)
1077 skb
->network_header
= skb
->data
;
1080 static inline void skb_set_network_header(struct sk_buff
*skb
, const int offset
)
1082 skb
->network_header
= skb
->data
+ offset
;
1085 static inline unsigned char *skb_mac_header(const struct sk_buff
*skb
)
1087 return skb
->mac_header
;
1090 static inline int skb_mac_header_was_set(const struct sk_buff
*skb
)
1092 return skb
->mac_header
!= NULL
;
1095 static inline void skb_reset_mac_header(struct sk_buff
*skb
)
1097 skb
->mac_header
= skb
->data
;
1100 static inline void skb_set_mac_header(struct sk_buff
*skb
, const int offset
)
1102 skb
->mac_header
= skb
->data
+ offset
;
1104 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1106 static inline int skb_transport_offset(const struct sk_buff
*skb
)
1108 return skb_transport_header(skb
) - skb
->data
;
1111 static inline u32
skb_network_header_len(const struct sk_buff
*skb
)
1113 return skb
->transport_header
- skb
->network_header
;
1116 static inline int skb_network_offset(const struct sk_buff
*skb
)
1118 return skb_network_header(skb
) - skb
->data
;
1122 * CPUs often take a performance hit when accessing unaligned memory
1123 * locations. The actual performance hit varies, it can be small if the
1124 * hardware handles it or large if we have to take an exception and fix it
1127 * Since an ethernet header is 14 bytes network drivers often end up with
1128 * the IP header at an unaligned offset. The IP header can be aligned by
1129 * shifting the start of the packet by 2 bytes. Drivers should do this
1132 * skb_reserve(NET_IP_ALIGN);
1134 * The downside to this alignment of the IP header is that the DMA is now
1135 * unaligned. On some architectures the cost of an unaligned DMA is high
1136 * and this cost outweighs the gains made by aligning the IP header.
1138 * Since this trade off varies between architectures, we allow NET_IP_ALIGN
1141 #ifndef NET_IP_ALIGN
1142 #define NET_IP_ALIGN 2
1146 * The networking layer reserves some headroom in skb data (via
1147 * dev_alloc_skb). This is used to avoid having to reallocate skb data when
1148 * the header has to grow. In the default case, if the header has to grow
1149 * 16 bytes or less we avoid the reallocation.
1151 * Unfortunately this headroom changes the DMA alignment of the resulting
1152 * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive
1153 * on some architectures. An architecture can override this value,
1154 * perhaps setting it to a cacheline in size (since that will maintain
1155 * cacheline alignment of the DMA). It must be a power of 2.
1157 * Various parts of the networking layer expect at least 16 bytes of
1158 * headroom, you should not reduce this.
1161 #define NET_SKB_PAD 16
1164 extern int ___pskb_trim(struct sk_buff
*skb
, unsigned int len
);
1166 static inline void __skb_trim(struct sk_buff
*skb
, unsigned int len
)
1168 if (unlikely(skb
->data_len
)) {
1173 skb_set_tail_pointer(skb
, len
);
1177 * skb_trim - remove end from a buffer
1178 * @skb: buffer to alter
1181 * Cut the length of a buffer down by removing data from the tail. If
1182 * the buffer is already under the length specified it is not modified.
1183 * The skb must be linear.
1185 static inline void skb_trim(struct sk_buff
*skb
, unsigned int len
)
1188 __skb_trim(skb
, len
);
1192 static inline int __pskb_trim(struct sk_buff
*skb
, unsigned int len
)
1195 return ___pskb_trim(skb
, len
);
1196 __skb_trim(skb
, len
);
1200 static inline int pskb_trim(struct sk_buff
*skb
, unsigned int len
)
1202 return (len
< skb
->len
) ? __pskb_trim(skb
, len
) : 0;
1206 * pskb_trim_unique - remove end from a paged unique (not cloned) buffer
1207 * @skb: buffer to alter
1210 * This is identical to pskb_trim except that the caller knows that
1211 * the skb is not cloned so we should never get an error due to out-
1214 static inline void pskb_trim_unique(struct sk_buff
*skb
, unsigned int len
)
1216 int err
= pskb_trim(skb
, len
);
1221 * skb_orphan - orphan a buffer
1222 * @skb: buffer to orphan
1224 * If a buffer currently has an owner then we call the owner's
1225 * destructor function and make the @skb unowned. The buffer continues
1226 * to exist but is no longer charged to its former owner.
1228 static inline void skb_orphan(struct sk_buff
*skb
)
1230 if (skb
->destructor
)
1231 skb
->destructor(skb
);
1232 skb
->destructor
= NULL
;
1237 * __skb_queue_purge - empty a list
1238 * @list: list to empty
1240 * Delete all buffers on an &sk_buff list. Each buffer is removed from
1241 * the list and one reference dropped. This function does not take the
1242 * list lock and the caller must hold the relevant locks to use it.
1244 extern void skb_queue_purge(struct sk_buff_head
*list
);
1245 static inline void __skb_queue_purge(struct sk_buff_head
*list
)
1247 struct sk_buff
*skb
;
1248 while ((skb
= __skb_dequeue(list
)) != NULL
)
1253 * __dev_alloc_skb - allocate an skbuff for receiving
1254 * @length: length to allocate
1255 * @gfp_mask: get_free_pages mask, passed to alloc_skb
1257 * Allocate a new &sk_buff and assign it a usage count of one. The
1258 * buffer has unspecified headroom built in. Users should allocate
1259 * the headroom they think they need without accounting for the
1260 * built in space. The built in space is used for optimisations.
1262 * %NULL is returned if there is no free memory.
1264 static inline struct sk_buff
*__dev_alloc_skb(unsigned int length
,
1267 struct sk_buff
*skb
= alloc_skb(length
+ NET_SKB_PAD
, gfp_mask
);
1269 skb_reserve(skb
, NET_SKB_PAD
);
1274 * dev_alloc_skb - allocate an skbuff for receiving
1275 * @length: length to allocate
1277 * Allocate a new &sk_buff and assign it a usage count of one. The
1278 * buffer has unspecified headroom built in. Users should allocate
1279 * the headroom they think they need without accounting for the
1280 * built in space. The built in space is used for optimisations.
1282 * %NULL is returned if there is no free memory. Although this function
1283 * allocates memory it can be called from an interrupt.
1285 static inline struct sk_buff
*dev_alloc_skb(unsigned int length
)
1287 return __dev_alloc_skb(length
, GFP_ATOMIC
);
1290 extern struct sk_buff
*__netdev_alloc_skb(struct net_device
*dev
,
1291 unsigned int length
, gfp_t gfp_mask
);
1294 * netdev_alloc_skb - allocate an skbuff for rx on a specific device
1295 * @dev: network device to receive on
1296 * @length: length to allocate
1298 * Allocate a new &sk_buff and assign it a usage count of one. The
1299 * buffer has unspecified headroom built in. Users should allocate
1300 * the headroom they think they need without accounting for the
1301 * built in space. The built in space is used for optimisations.
1303 * %NULL is returned if there is no free memory. Although this function
1304 * allocates memory it can be called from an interrupt.
1306 static inline struct sk_buff
*netdev_alloc_skb(struct net_device
*dev
,
1307 unsigned int length
)
1309 return __netdev_alloc_skb(dev
, length
, GFP_ATOMIC
);
1313 * skb_cow - copy header of skb when it is required
1314 * @skb: buffer to cow
1315 * @headroom: needed headroom
1317 * If the skb passed lacks sufficient headroom or its data part
1318 * is shared, data is reallocated. If reallocation fails, an error
1319 * is returned and original skb is not changed.
1321 * The result is skb with writable area skb->head...skb->tail
1322 * and at least @headroom of space at head.
1324 static inline int skb_cow(struct sk_buff
*skb
, unsigned int headroom
)
1326 int delta
= (headroom
> NET_SKB_PAD
? headroom
: NET_SKB_PAD
) -
1332 if (delta
|| skb_cloned(skb
))
1333 return pskb_expand_head(skb
, (delta
+ (NET_SKB_PAD
-1)) &
1334 ~(NET_SKB_PAD
-1), 0, GFP_ATOMIC
);
1339 * skb_padto - pad an skbuff up to a minimal size
1340 * @skb: buffer to pad
1341 * @len: minimal length
1343 * Pads up a buffer to ensure the trailing bytes exist and are
1344 * blanked. If the buffer already contains sufficient data it
1345 * is untouched. Otherwise it is extended. Returns zero on
1346 * success. The skb is freed on error.
1349 static inline int skb_padto(struct sk_buff
*skb
, unsigned int len
)
1351 unsigned int size
= skb
->len
;
1352 if (likely(size
>= len
))
1354 return skb_pad(skb
, len
-size
);
1357 static inline int skb_add_data(struct sk_buff
*skb
,
1358 char __user
*from
, int copy
)
1360 const int off
= skb
->len
;
1362 if (skb
->ip_summed
== CHECKSUM_NONE
) {
1364 __wsum csum
= csum_and_copy_from_user(from
, skb_put(skb
, copy
),
1367 skb
->csum
= csum_block_add(skb
->csum
, csum
, off
);
1370 } else if (!copy_from_user(skb_put(skb
, copy
), from
, copy
))
1373 __skb_trim(skb
, off
);
1377 static inline int skb_can_coalesce(struct sk_buff
*skb
, int i
,
1378 struct page
*page
, int off
)
1381 struct skb_frag_struct
*frag
= &skb_shinfo(skb
)->frags
[i
- 1];
1383 return page
== frag
->page
&&
1384 off
== frag
->page_offset
+ frag
->size
;
1389 static inline int __skb_linearize(struct sk_buff
*skb
)
1391 return __pskb_pull_tail(skb
, skb
->data_len
) ? 0 : -ENOMEM
;
1395 * skb_linearize - convert paged skb to linear one
1396 * @skb: buffer to linarize
1398 * If there is no free memory -ENOMEM is returned, otherwise zero
1399 * is returned and the old skb data released.
1401 static inline int skb_linearize(struct sk_buff
*skb
)
1403 return skb_is_nonlinear(skb
) ? __skb_linearize(skb
) : 0;
1407 * skb_linearize_cow - make sure skb is linear and writable
1408 * @skb: buffer to process
1410 * If there is no free memory -ENOMEM is returned, otherwise zero
1411 * is returned and the old skb data released.
1413 static inline int skb_linearize_cow(struct sk_buff
*skb
)
1415 return skb_is_nonlinear(skb
) || skb_cloned(skb
) ?
1416 __skb_linearize(skb
) : 0;
1420 * skb_postpull_rcsum - update checksum for received skb after pull
1421 * @skb: buffer to update
1422 * @start: start of data before pull
1423 * @len: length of data pulled
1425 * After doing a pull on a received packet, you need to call this to
1426 * update the CHECKSUM_COMPLETE checksum, or set ip_summed to
1427 * CHECKSUM_NONE so that it can be recomputed from scratch.
1430 static inline void skb_postpull_rcsum(struct sk_buff
*skb
,
1431 const void *start
, unsigned int len
)
1433 if (skb
->ip_summed
== CHECKSUM_COMPLETE
)
1434 skb
->csum
= csum_sub(skb
->csum
, csum_partial(start
, len
, 0));
1437 unsigned char *skb_pull_rcsum(struct sk_buff
*skb
, unsigned int len
);
1440 * pskb_trim_rcsum - trim received skb and update checksum
1441 * @skb: buffer to trim
1444 * This is exactly the same as pskb_trim except that it ensures the
1445 * checksum of received packets are still valid after the operation.
1448 static inline int pskb_trim_rcsum(struct sk_buff
*skb
, unsigned int len
)
1450 if (likely(len
>= skb
->len
))
1452 if (skb
->ip_summed
== CHECKSUM_COMPLETE
)
1453 skb
->ip_summed
= CHECKSUM_NONE
;
1454 return __pskb_trim(skb
, len
);
1457 #define skb_queue_walk(queue, skb) \
1458 for (skb = (queue)->next; \
1459 prefetch(skb->next), (skb != (struct sk_buff *)(queue)); \
1462 #define skb_queue_reverse_walk(queue, skb) \
1463 for (skb = (queue)->prev; \
1464 prefetch(skb->prev), (skb != (struct sk_buff *)(queue)); \
1468 extern struct sk_buff
*skb_recv_datagram(struct sock
*sk
, unsigned flags
,
1469 int noblock
, int *err
);
1470 extern unsigned int datagram_poll(struct file
*file
, struct socket
*sock
,
1471 struct poll_table_struct
*wait
);
1472 extern int skb_copy_datagram_iovec(const struct sk_buff
*from
,
1473 int offset
, struct iovec
*to
,
1475 extern int skb_copy_and_csum_datagram_iovec(struct sk_buff
*skb
,
1478 extern void skb_free_datagram(struct sock
*sk
, struct sk_buff
*skb
);
1479 extern void skb_kill_datagram(struct sock
*sk
, struct sk_buff
*skb
,
1480 unsigned int flags
);
1481 extern __wsum
skb_checksum(const struct sk_buff
*skb
, int offset
,
1482 int len
, __wsum csum
);
1483 extern int skb_copy_bits(const struct sk_buff
*skb
, int offset
,
1485 extern int skb_store_bits(const struct sk_buff
*skb
, int offset
,
1486 void *from
, int len
);
1487 extern __wsum
skb_copy_and_csum_bits(const struct sk_buff
*skb
,
1488 int offset
, u8
*to
, int len
,
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 extern void skb_init(void);
1527 * skb_get_timestamp - get timestamp from a skb
1528 * @skb: skb to get stamp from
1529 * @stamp: pointer to struct timeval to store stamp in
1531 * Timestamps are stored in the skb as offsets to a base timestamp.
1532 * This function converts the offset back to a struct timeval and stores
1535 static inline void skb_get_timestamp(const struct sk_buff
*skb
, struct timeval
*stamp
)
1537 *stamp
= ktime_to_timeval(skb
->tstamp
);
1540 static inline void __net_timestamp(struct sk_buff
*skb
)
1542 skb
->tstamp
= ktime_get_real();
1546 extern __sum16
__skb_checksum_complete_head(struct sk_buff
*skb
, int len
);
1547 extern __sum16
__skb_checksum_complete(struct sk_buff
*skb
);
1550 * skb_checksum_complete - Calculate checksum of an entire packet
1551 * @skb: packet to process
1553 * This function calculates the checksum over the entire packet plus
1554 * the value of skb->csum. The latter can be used to supply the
1555 * checksum of a pseudo header as used by TCP/UDP. It returns the
1558 * For protocols that contain complete checksums such as ICMP/TCP/UDP,
1559 * this function can be used to verify that checksum on received
1560 * packets. In that case the function should return zero if the
1561 * checksum is correct. In particular, this function will return zero
1562 * if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the
1563 * hardware has already verified the correctness of the checksum.
1565 static inline unsigned int skb_checksum_complete(struct sk_buff
*skb
)
1567 return skb
->ip_summed
!= CHECKSUM_UNNECESSARY
&&
1568 __skb_checksum_complete(skb
);
1571 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1572 extern void nf_conntrack_destroy(struct nf_conntrack
*nfct
);
1573 static inline void nf_conntrack_put(struct nf_conntrack
*nfct
)
1575 if (nfct
&& atomic_dec_and_test(&nfct
->use
))
1576 nf_conntrack_destroy(nfct
);
1578 static inline void nf_conntrack_get(struct nf_conntrack
*nfct
)
1581 atomic_inc(&nfct
->use
);
1583 static inline void nf_conntrack_get_reasm(struct sk_buff
*skb
)
1586 atomic_inc(&skb
->users
);
1588 static inline void nf_conntrack_put_reasm(struct sk_buff
*skb
)
1594 #ifdef CONFIG_BRIDGE_NETFILTER
1595 static inline void nf_bridge_put(struct nf_bridge_info
*nf_bridge
)
1597 if (nf_bridge
&& atomic_dec_and_test(&nf_bridge
->use
))
1600 static inline void nf_bridge_get(struct nf_bridge_info
*nf_bridge
)
1603 atomic_inc(&nf_bridge
->use
);
1605 #endif /* CONFIG_BRIDGE_NETFILTER */
1606 static inline void nf_reset(struct sk_buff
*skb
)
1608 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1609 nf_conntrack_put(skb
->nfct
);
1611 nf_conntrack_put_reasm(skb
->nfct_reasm
);
1612 skb
->nfct_reasm
= NULL
;
1614 #ifdef CONFIG_BRIDGE_NETFILTER
1615 nf_bridge_put(skb
->nf_bridge
);
1616 skb
->nf_bridge
= NULL
;
1620 /* Note: This doesn't put any conntrack and bridge info in dst. */
1621 static inline void __nf_copy(struct sk_buff
*dst
, const struct sk_buff
*src
)
1623 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1624 dst
->nfct
= src
->nfct
;
1625 nf_conntrack_get(src
->nfct
);
1626 dst
->nfctinfo
= src
->nfctinfo
;
1627 dst
->nfct_reasm
= src
->nfct_reasm
;
1628 nf_conntrack_get_reasm(src
->nfct_reasm
);
1630 #ifdef CONFIG_BRIDGE_NETFILTER
1631 dst
->nf_bridge
= src
->nf_bridge
;
1632 nf_bridge_get(src
->nf_bridge
);
1636 static inline void nf_copy(struct sk_buff
*dst
, const struct sk_buff
*src
)
1638 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1639 nf_conntrack_put(dst
->nfct
);
1640 nf_conntrack_put_reasm(dst
->nfct_reasm
);
1642 #ifdef CONFIG_BRIDGE_NETFILTER
1643 nf_bridge_put(dst
->nf_bridge
);
1645 __nf_copy(dst
, src
);
1648 #ifdef CONFIG_NETWORK_SECMARK
1649 static inline void skb_copy_secmark(struct sk_buff
*to
, const struct sk_buff
*from
)
1651 to
->secmark
= from
->secmark
;
1654 static inline void skb_init_secmark(struct sk_buff
*skb
)
1659 static inline void skb_copy_secmark(struct sk_buff
*to
, const struct sk_buff
*from
)
1662 static inline void skb_init_secmark(struct sk_buff
*skb
)
1666 static inline int skb_is_gso(const struct sk_buff
*skb
)
1668 return skb_shinfo(skb
)->gso_size
;
1671 static inline void skb_forward_csum(struct sk_buff
*skb
)
1673 /* Unfortunately we don't support this one. Any brave souls? */
1674 if (skb
->ip_summed
== CHECKSUM_COMPLETE
)
1675 skb
->ip_summed
= CHECKSUM_NONE
;
1678 #endif /* __KERNEL__ */
1679 #endif /* _LINUX_SKBUFF_H */