2 * Definitions for the 'struct sk_buff' memory handlers.
5 * Alan Cox, <gw4pts@gw4pts.ampr.org>
6 * Florian La Roche, <rzsfl@rz.uni-sb.de>
8 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License
10 * as published by the Free Software Foundation; either version
11 * 2 of the License, or (at your option) any later version.
14 #ifndef _LINUX_SKBUFF_H
15 #define _LINUX_SKBUFF_H
17 #include <linux/kernel.h>
18 #include <linux/compiler.h>
19 #include <linux/time.h>
20 #include <linux/cache.h>
22 #include <asm/atomic.h>
23 #include <asm/types.h>
24 #include <linux/spinlock.h>
25 #include <linux/net.h>
26 #include <linux/textsearch.h>
27 #include <net/checksum.h>
28 #include <linux/rcupdate.h>
29 #include <linux/dmaengine.h>
30 #include <linux/hrtimer.h>
32 #define HAVE_ALLOC_SKB /* For the drivers to know */
33 #define HAVE_ALIGNABLE_SKB /* Ditto 8) */
35 /* Don't change this without changing skb_csum_unnecessary! */
36 #define CHECKSUM_NONE 0
37 #define CHECKSUM_UNNECESSARY 1
38 #define CHECKSUM_COMPLETE 2
39 #define CHECKSUM_PARTIAL 3
41 #define SKB_DATA_ALIGN(X) (((X) + (SMP_CACHE_BYTES - 1)) & \
42 ~(SMP_CACHE_BYTES - 1))
43 #define SKB_WITH_OVERHEAD(X) \
44 (((X) - sizeof(struct skb_shared_info)) & \
45 ~(SMP_CACHE_BYTES - 1))
46 #define SKB_MAX_ORDER(X, ORDER) \
47 SKB_WITH_OVERHEAD((PAGE_SIZE << (ORDER)) - (X))
48 #define SKB_MAX_HEAD(X) (SKB_MAX_ORDER((X), 0))
49 #define SKB_MAX_ALLOC (SKB_MAX_ORDER(0, 2))
51 /* A. Checksumming of received packets by device.
53 * NONE: device failed to checksum this packet.
54 * skb->csum is undefined.
56 * UNNECESSARY: device parsed packet and wouldbe verified checksum.
57 * skb->csum is undefined.
58 * It is bad option, but, unfortunately, many of vendors do this.
59 * Apparently with secret goal to sell you new device, when you
60 * will add new protocol to your host. F.e. IPv6. 8)
62 * COMPLETE: the most generic way. Device supplied checksum of _all_
63 * the packet as seen by netif_rx in skb->csum.
64 * NOTE: Even if device supports only some protocols, but
65 * is able to produce some skb->csum, it MUST use COMPLETE,
68 * B. Checksumming on output.
70 * NONE: skb is checksummed by protocol or csum is not required.
72 * PARTIAL: device is required to csum packet as seen by hard_start_xmit
73 * from skb->transport_header to the end and to record the checksum
74 * at skb->transport_header + skb->csum.
76 * Device must show its capabilities in dev->features, set
77 * at device setup time.
78 * NETIF_F_HW_CSUM - it is clever device, it is able to checksum
80 * NETIF_F_NO_CSUM - loopback or reliable single hop media.
81 * NETIF_F_IP_CSUM - device is dumb. It is able to csum only
82 * TCP/UDP over IPv4. Sigh. Vendors like this
83 * way by an unknown reason. Though, see comment above
84 * about CHECKSUM_UNNECESSARY. 8)
86 * Any questions? No questions, good. --ANK
92 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
98 #ifdef CONFIG_BRIDGE_NETFILTER
99 struct nf_bridge_info {
101 struct net_device *physindev;
102 struct net_device *physoutdev;
103 #if defined(CONFIG_VLAN_8021Q) || defined(CONFIG_VLAN_8021Q_MODULE)
104 struct net_device *netoutdev;
107 unsigned long data[32 / sizeof(unsigned long)];
111 struct sk_buff_head {
112 /* These two members must be first. */
113 struct sk_buff *next;
114 struct sk_buff *prev;
122 /* To allow 64K frame to be packed as single skb without frag_list */
123 #define MAX_SKB_FRAGS (65536/PAGE_SIZE + 2)
125 typedef struct skb_frag_struct skb_frag_t;
127 struct skb_frag_struct {
133 /* This data is invariant across clones and lives at
134 * the end of the header data, ie. at skb->end.
136 struct skb_shared_info {
138 unsigned short nr_frags;
139 unsigned short gso_size;
140 /* Warning: this field is not always filled in (UFO)! */
141 unsigned short gso_segs;
142 unsigned short gso_type;
144 struct sk_buff *frag_list;
145 skb_frag_t frags[MAX_SKB_FRAGS];
148 /* We divide dataref into two halves. The higher 16 bits hold references
149 * to the payload part of skb->data. The lower 16 bits hold references to
150 * the entire skb->data. A clone of a headerless skb holds the length of
151 * the header in skb->hdr_len.
153 * All users must obey the rule that the skb->data reference count must be
154 * greater than or equal to the payload reference count.
156 * Holding a reference to the payload part means that the user does not
157 * care about modifications to the header part of skb->data.
159 #define SKB_DATAREF_SHIFT 16
160 #define SKB_DATAREF_MASK ((1 << SKB_DATAREF_SHIFT) - 1)
164 SKB_FCLONE_UNAVAILABLE,
170 SKB_GSO_TCPV4 = 1 << 0,
171 SKB_GSO_UDP = 1 << 1,
173 /* This indicates the skb is from an untrusted source. */
174 SKB_GSO_DODGY = 1 << 2,
176 /* This indicates the tcp segment has CWR set. */
177 SKB_GSO_TCP_ECN = 1 << 3,
179 SKB_GSO_TCPV6 = 1 << 4,
182 #if BITS_PER_LONG > 32
183 #define NET_SKBUFF_DATA_USES_OFFSET 1
186 #ifdef NET_SKBUFF_DATA_USES_OFFSET
187 typedef unsigned int sk_buff_data_t;
189 typedef unsigned char *sk_buff_data_t;
193 * struct sk_buff - socket buffer
194 * @next: Next buffer in list
195 * @prev: Previous buffer in list
196 * @sk: Socket we are owned by
197 * @tstamp: Time we arrived
198 * @dev: Device we arrived on/are leaving by
199 * @iif: ifindex of device we arrived on
200 * @transport_header: Transport layer header
201 * @network_header: Network layer header
202 * @mac_header: Link layer header
203 * @dst: destination entry
204 * @sp: the security path, used for xfrm
205 * @cb: Control buffer. Free for use by every layer. Put private vars here
206 * @len: Length of actual data
207 * @data_len: Data length
208 * @mac_len: Length of link layer header
209 * @hdr_len: writable header length of cloned skb
210 * @csum: Checksum (must include start/offset pair)
211 * @csum_start: Offset from skb->head where checksumming should start
212 * @csum_offset: Offset from csum_start where checksum should be stored
213 * @local_df: allow local fragmentation
214 * @cloned: Head may be cloned (check refcnt to be sure)
215 * @nohdr: Payload reference only, must not modify header
216 * @pkt_type: Packet class
217 * @fclone: skbuff clone status
218 * @ip_summed: Driver fed us an IP checksum
219 * @priority: Packet queueing priority
220 * @users: User count - see {datagram,tcp}.c
221 * @protocol: Packet protocol from driver
222 * @truesize: Buffer size
223 * @head: Head of buffer
224 * @data: Data head pointer
225 * @tail: Tail pointer
227 * @destructor: Destruct function
228 * @mark: Generic packet mark
229 * @nfct: Associated connection, if any
230 * @ipvs_property: skbuff is owned by ipvs
231 * @nfctinfo: Relationship of this skb to the connection
232 * @nfct_reasm: netfilter conntrack re-assembly pointer
233 * @nf_bridge: Saved data about a bridged frame - see br_netfilter.c
234 * @tc_index: Traffic control index
235 * @tc_verd: traffic control verdict
236 * @dma_cookie: a cookie to one of several possible DMA operations
237 * done by skb DMA functions
238 * @secmark: security marking
242 /* These two members must be first. */
243 struct sk_buff *next;
244 struct sk_buff *prev;
248 struct net_device *dev;
250 /* 4 byte hole on 64 bit*/
252 struct dst_entry *dst;
256 * This is the control buffer. It is free to use for every
257 * layer. Please put your private variables there. If you
258 * want to keep them across layers you have to do a skb_clone()
259 * first. This is owned by whoever has the skb queued ATM.
285 void (*destructor)(struct sk_buff *skb);
286 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
287 struct nf_conntrack *nfct;
288 struct sk_buff *nfct_reasm;
290 #ifdef CONFIG_BRIDGE_NETFILTER
291 struct nf_bridge_info *nf_bridge;
293 #ifdef CONFIG_NET_SCHED
294 __u16 tc_index; /* traffic control index */
295 #ifdef CONFIG_NET_CLS_ACT
296 __u16 tc_verd; /* traffic control verdict */
299 #ifdef CONFIG_NET_DMA
300 dma_cookie_t dma_cookie;
302 #ifdef CONFIG_NETWORK_SECMARK
308 sk_buff_data_t transport_header;
309 sk_buff_data_t network_header;
310 sk_buff_data_t mac_header;
311 /* These elements must be at the end, see alloc_skb() for details. */
316 unsigned int truesize;
322 * Handling routines are only of interest to the kernel
324 #include <linux/slab.h>
326 #include <asm/system.h>
328 extern void kfree_skb(struct sk_buff *skb);
329 extern void __kfree_skb(struct sk_buff *skb);
330 extern struct sk_buff *__alloc_skb(unsigned int size,
331 gfp_t priority, int fclone, int node);
332 static inline struct sk_buff *alloc_skb(unsigned int size,
335 return __alloc_skb(size, priority, 0, -1);
338 static inline struct sk_buff *alloc_skb_fclone(unsigned int size,
341 return __alloc_skb(size, priority, 1, -1);
344 extern void kfree_skbmem(struct sk_buff *skb);
345 extern struct sk_buff *skb_clone(struct sk_buff *skb,
347 extern struct sk_buff *skb_copy(const struct sk_buff *skb,
349 extern struct sk_buff *pskb_copy(struct sk_buff *skb,
351 extern int pskb_expand_head(struct sk_buff *skb,
352 int nhead, int ntail,
354 extern struct sk_buff *skb_realloc_headroom(struct sk_buff *skb,
355 unsigned int headroom);
356 extern struct sk_buff *skb_copy_expand(const struct sk_buff *skb,
357 int newheadroom, int newtailroom,
359 extern int skb_to_sgvec(struct sk_buff *skb,
360 struct scatterlist *sg, int offset,
362 extern int skb_cow_data(struct sk_buff *skb, int tailbits,
363 struct sk_buff **trailer);
364 extern int skb_pad(struct sk_buff *skb, int pad);
365 #define dev_kfree_skb(a) kfree_skb(a)
366 extern void skb_over_panic(struct sk_buff *skb, int len,
368 extern void skb_under_panic(struct sk_buff *skb, int len,
370 extern void skb_truesize_bug(struct sk_buff *skb);
372 static inline void skb_truesize_check(struct sk_buff *skb)
374 if (unlikely((int)skb->truesize < sizeof(struct sk_buff) + skb->len))
375 skb_truesize_bug(skb);
378 extern int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb,
379 int getfrag(void *from, char *to, int offset,
380 int len,int odd, struct sk_buff *skb),
381 void *from, int length);
388 __u32 stepped_offset;
389 struct sk_buff *root_skb;
390 struct sk_buff *cur_skb;
394 extern void skb_prepare_seq_read(struct sk_buff *skb,
395 unsigned int from, unsigned int to,
396 struct skb_seq_state *st);
397 extern unsigned int skb_seq_read(unsigned int consumed, const u8 **data,
398 struct skb_seq_state *st);
399 extern void skb_abort_seq_read(struct skb_seq_state *st);
401 extern unsigned int skb_find_text(struct sk_buff *skb, unsigned int from,
402 unsigned int to, struct ts_config *config,
403 struct ts_state *state);
405 #ifdef NET_SKBUFF_DATA_USES_OFFSET
406 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
408 return skb->head + skb->end;
411 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
418 #define skb_shinfo(SKB) ((struct skb_shared_info *)(skb_end_pointer(SKB)))
421 * skb_queue_empty - check if a queue is empty
424 * Returns true if the queue is empty, false otherwise.
426 static inline int skb_queue_empty(const struct sk_buff_head *list)
428 return list->next == (struct sk_buff *)list;
432 * skb_get - reference buffer
433 * @skb: buffer to reference
435 * Makes another reference to a socket buffer and returns a pointer
438 static inline struct sk_buff *skb_get(struct sk_buff *skb)
440 atomic_inc(&skb->users);
445 * If users == 1, we are the only owner and are can avoid redundant
450 * skb_cloned - is the buffer a clone
451 * @skb: buffer to check
453 * Returns true if the buffer was generated with skb_clone() and is
454 * one of multiple shared copies of the buffer. Cloned buffers are
455 * shared data so must not be written to under normal circumstances.
457 static inline int skb_cloned(const struct sk_buff *skb)
459 return skb->cloned &&
460 (atomic_read(&skb_shinfo(skb)->dataref) & SKB_DATAREF_MASK) != 1;
464 * skb_header_cloned - is the header a clone
465 * @skb: buffer to check
467 * Returns true if modifying the header part of the buffer requires
468 * the data to be copied.
470 static inline int skb_header_cloned(const struct sk_buff *skb)
477 dataref = atomic_read(&skb_shinfo(skb)->dataref);
478 dataref = (dataref & SKB_DATAREF_MASK) - (dataref >> SKB_DATAREF_SHIFT);
483 * skb_header_release - release reference to header
484 * @skb: buffer to operate on
486 * Drop a reference to the header part of the buffer. This is done
487 * by acquiring a payload reference. You must not read from the header
488 * part of skb->data after this.
490 static inline void skb_header_release(struct sk_buff *skb)
494 atomic_add(1 << SKB_DATAREF_SHIFT, &skb_shinfo(skb)->dataref);
498 * skb_shared - is the buffer shared
499 * @skb: buffer to check
501 * Returns true if more than one person has a reference to this
504 static inline int skb_shared(const struct sk_buff *skb)
506 return atomic_read(&skb->users) != 1;
510 * skb_share_check - check if buffer is shared and if so clone it
511 * @skb: buffer to check
512 * @pri: priority for memory allocation
514 * If the buffer is shared the buffer is cloned and the old copy
515 * drops a reference. A new clone with a single reference is returned.
516 * If the buffer is not shared the original buffer is returned. When
517 * being called from interrupt status or with spinlocks held pri must
520 * NULL is returned on a memory allocation failure.
522 static inline struct sk_buff *skb_share_check(struct sk_buff *skb,
525 might_sleep_if(pri & __GFP_WAIT);
526 if (skb_shared(skb)) {
527 struct sk_buff *nskb = skb_clone(skb, pri);
535 * Copy shared buffers into a new sk_buff. We effectively do COW on
536 * packets to handle cases where we have a local reader and forward
537 * and a couple of other messy ones. The normal one is tcpdumping
538 * a packet thats being forwarded.
542 * skb_unshare - make a copy of a shared buffer
543 * @skb: buffer to check
544 * @pri: priority for memory allocation
546 * If the socket buffer is a clone then this function creates a new
547 * copy of the data, drops a reference count on the old copy and returns
548 * the new copy with the reference count at 1. If the buffer is not a clone
549 * the original buffer is returned. When called with a spinlock held or
550 * from interrupt state @pri must be %GFP_ATOMIC
552 * %NULL is returned on a memory allocation failure.
554 static inline struct sk_buff *skb_unshare(struct sk_buff *skb,
557 might_sleep_if(pri & __GFP_WAIT);
558 if (skb_cloned(skb)) {
559 struct sk_buff *nskb = skb_copy(skb, pri);
560 kfree_skb(skb); /* Free our shared copy */
568 * @list_: list to peek at
570 * Peek an &sk_buff. Unlike most other operations you _MUST_
571 * be careful with this one. A peek leaves the buffer on the
572 * list and someone else may run off with it. You must hold
573 * the appropriate locks or have a private queue to do this.
575 * Returns %NULL for an empty list or a pointer to the head element.
576 * The reference count is not incremented and the reference is therefore
577 * volatile. Use with caution.
579 static inline struct sk_buff *skb_peek(struct sk_buff_head *list_)
581 struct sk_buff *list = ((struct sk_buff *)list_)->next;
582 if (list == (struct sk_buff *)list_)
589 * @list_: list to peek at
591 * Peek an &sk_buff. Unlike most other operations you _MUST_
592 * be careful with this one. A peek leaves the buffer on the
593 * list and someone else may run off with it. You must hold
594 * the appropriate locks or have a private queue to do this.
596 * Returns %NULL for an empty list or a pointer to the tail element.
597 * The reference count is not incremented and the reference is therefore
598 * volatile. Use with caution.
600 static inline struct sk_buff *skb_peek_tail(struct sk_buff_head *list_)
602 struct sk_buff *list = ((struct sk_buff *)list_)->prev;
603 if (list == (struct sk_buff *)list_)
609 * skb_queue_len - get queue length
610 * @list_: list to measure
612 * Return the length of an &sk_buff queue.
614 static inline __u32 skb_queue_len(const struct sk_buff_head *list_)
620 * This function creates a split out lock class for each invocation;
621 * this is needed for now since a whole lot of users of the skb-queue
622 * infrastructure in drivers have different locking usage (in hardirq)
623 * than the networking core (in softirq only). In the long run either the
624 * network layer or drivers should need annotation to consolidate the
625 * main types of usage into 3 classes.
627 static inline void skb_queue_head_init(struct sk_buff_head *list)
629 spin_lock_init(&list->lock);
630 list->prev = list->next = (struct sk_buff *)list;
634 static inline void skb_queue_head_init_class(struct sk_buff_head *list,
635 struct lock_class_key *class)
637 skb_queue_head_init(list);
638 lockdep_set_class(&list->lock, class);
642 * Insert an sk_buff at the start of a list.
644 * The "__skb_xxxx()" functions are the non-atomic ones that
645 * can only be called with interrupts disabled.
649 * __skb_queue_after - queue a buffer at the list head
651 * @prev: place after this buffer
652 * @newsk: buffer to queue
654 * Queue a buffer int the middle of a list. This function takes no locks
655 * and you must therefore hold required locks before calling it.
657 * A buffer cannot be placed on two lists at the same time.
659 static inline void __skb_queue_after(struct sk_buff_head *list,
660 struct sk_buff *prev,
661 struct sk_buff *newsk)
663 struct sk_buff *next;
669 next->prev = prev->next = newsk;
673 * __skb_queue_head - queue a buffer at the list head
675 * @newsk: buffer to queue
677 * Queue a buffer at the start of a list. This function takes no locks
678 * and you must therefore hold required locks before calling it.
680 * A buffer cannot be placed on two lists at the same time.
682 extern void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk);
683 static inline void __skb_queue_head(struct sk_buff_head *list,
684 struct sk_buff *newsk)
686 __skb_queue_after(list, (struct sk_buff *)list, newsk);
690 * __skb_queue_tail - queue a buffer at the list tail
692 * @newsk: buffer to queue
694 * Queue a buffer at the end of a list. This function takes no locks
695 * and you must therefore hold required locks before calling it.
697 * A buffer cannot be placed on two lists at the same time.
699 extern void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk);
700 static inline void __skb_queue_tail(struct sk_buff_head *list,
701 struct sk_buff *newsk)
703 struct sk_buff *prev, *next;
706 next = (struct sk_buff *)list;
710 next->prev = prev->next = newsk;
715 * __skb_dequeue - remove from the head of the queue
716 * @list: list to dequeue from
718 * Remove the head of the list. This function does not take any locks
719 * so must be used with appropriate locks held only. The head item is
720 * returned or %NULL if the list is empty.
722 extern struct sk_buff *skb_dequeue(struct sk_buff_head *list);
723 static inline struct sk_buff *__skb_dequeue(struct sk_buff_head *list)
725 struct sk_buff *next, *prev, *result;
727 prev = (struct sk_buff *) list;
736 result->next = result->prev = NULL;
743 * Insert a packet on a list.
745 extern void skb_insert(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list);
746 static inline void __skb_insert(struct sk_buff *newsk,
747 struct sk_buff *prev, struct sk_buff *next,
748 struct sk_buff_head *list)
752 next->prev = prev->next = newsk;
757 * Place a packet after a given packet in a list.
759 extern void skb_append(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list);
760 static inline void __skb_append(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list)
762 __skb_insert(newsk, old, old->next, list);
766 * remove sk_buff from list. _Must_ be called atomically, and with
769 extern void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list);
770 static inline void __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
772 struct sk_buff *next, *prev;
777 skb->next = skb->prev = NULL;
783 /* XXX: more streamlined implementation */
786 * __skb_dequeue_tail - remove from the tail of the queue
787 * @list: list to dequeue from
789 * Remove the tail of the list. This function does not take any locks
790 * so must be used with appropriate locks held only. The tail item is
791 * returned or %NULL if the list is empty.
793 extern struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list);
794 static inline struct sk_buff *__skb_dequeue_tail(struct sk_buff_head *list)
796 struct sk_buff *skb = skb_peek_tail(list);
798 __skb_unlink(skb, list);
803 static inline int skb_is_nonlinear(const struct sk_buff *skb)
805 return skb->data_len;
808 static inline unsigned int skb_headlen(const struct sk_buff *skb)
810 return skb->len - skb->data_len;
813 static inline int skb_pagelen(const struct sk_buff *skb)
817 for (i = (int)skb_shinfo(skb)->nr_frags - 1; i >= 0; i--)
818 len += skb_shinfo(skb)->frags[i].size;
819 return len + skb_headlen(skb);
822 static inline void skb_fill_page_desc(struct sk_buff *skb, int i,
823 struct page *page, int off, int size)
825 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
828 frag->page_offset = off;
830 skb_shinfo(skb)->nr_frags = i + 1;
833 #define SKB_PAGE_ASSERT(skb) BUG_ON(skb_shinfo(skb)->nr_frags)
834 #define SKB_FRAG_ASSERT(skb) BUG_ON(skb_shinfo(skb)->frag_list)
835 #define SKB_LINEAR_ASSERT(skb) BUG_ON(skb_is_nonlinear(skb))
837 #ifdef NET_SKBUFF_DATA_USES_OFFSET
838 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
840 return skb->head + skb->tail;
843 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
845 skb->tail = skb->data - skb->head;
848 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
850 skb_reset_tail_pointer(skb);
853 #else /* NET_SKBUFF_DATA_USES_OFFSET */
854 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
859 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
861 skb->tail = skb->data;
864 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
866 skb->tail = skb->data + offset;
869 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
872 * Add data to an sk_buff
874 static inline unsigned char *__skb_put(struct sk_buff *skb, unsigned int len)
876 unsigned char *tmp = skb_tail_pointer(skb);
877 SKB_LINEAR_ASSERT(skb);
884 * skb_put - add data to a buffer
885 * @skb: buffer to use
886 * @len: amount of data to add
888 * This function extends the used data area of the buffer. If this would
889 * exceed the total buffer size the kernel will panic. A pointer to the
890 * first byte of the extra data is returned.
892 static inline unsigned char *skb_put(struct sk_buff *skb, unsigned int len)
894 unsigned char *tmp = skb_tail_pointer(skb);
895 SKB_LINEAR_ASSERT(skb);
898 if (unlikely(skb->tail > skb->end))
899 skb_over_panic(skb, len, current_text_addr());
903 static inline unsigned char *__skb_push(struct sk_buff *skb, unsigned int len)
911 * skb_push - add data to the start of a buffer
912 * @skb: buffer to use
913 * @len: amount of data to add
915 * This function extends the used data area of the buffer at the buffer
916 * start. If this would exceed the total buffer headroom the kernel will
917 * panic. A pointer to the first byte of the extra data is returned.
919 static inline unsigned char *skb_push(struct sk_buff *skb, unsigned int len)
923 if (unlikely(skb->data<skb->head))
924 skb_under_panic(skb, len, current_text_addr());
928 static inline unsigned char *__skb_pull(struct sk_buff *skb, unsigned int len)
931 BUG_ON(skb->len < skb->data_len);
932 return skb->data += len;
936 * skb_pull - remove data from the start of a buffer
937 * @skb: buffer to use
938 * @len: amount of data to remove
940 * This function removes data from the start of a buffer, returning
941 * the memory to the headroom. A pointer to the next data in the buffer
942 * is returned. Once the data has been pulled future pushes will overwrite
945 static inline unsigned char *skb_pull(struct sk_buff *skb, unsigned int len)
947 return unlikely(len > skb->len) ? NULL : __skb_pull(skb, len);
950 extern unsigned char *__pskb_pull_tail(struct sk_buff *skb, int delta);
952 static inline unsigned char *__pskb_pull(struct sk_buff *skb, unsigned int len)
954 if (len > skb_headlen(skb) &&
955 !__pskb_pull_tail(skb, len-skb_headlen(skb)))
958 return skb->data += len;
961 static inline unsigned char *pskb_pull(struct sk_buff *skb, unsigned int len)
963 return unlikely(len > skb->len) ? NULL : __pskb_pull(skb, len);
966 static inline int pskb_may_pull(struct sk_buff *skb, unsigned int len)
968 if (likely(len <= skb_headlen(skb)))
970 if (unlikely(len > skb->len))
972 return __pskb_pull_tail(skb, len-skb_headlen(skb)) != NULL;
976 * skb_headroom - bytes at buffer head
977 * @skb: buffer to check
979 * Return the number of bytes of free space at the head of an &sk_buff.
981 static inline int skb_headroom(const struct sk_buff *skb)
983 return skb->data - skb->head;
987 * skb_tailroom - bytes at buffer end
988 * @skb: buffer to check
990 * Return the number of bytes of free space at the tail of an sk_buff
992 static inline int skb_tailroom(const struct sk_buff *skb)
994 return skb_is_nonlinear(skb) ? 0 : skb->end - skb->tail;
998 * skb_reserve - adjust headroom
999 * @skb: buffer to alter
1000 * @len: bytes to move
1002 * Increase the headroom of an empty &sk_buff by reducing the tail
1003 * room. This is only allowed for an empty buffer.
1005 static inline void skb_reserve(struct sk_buff *skb, int len)
1011 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1012 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
1014 return skb->head + skb->transport_header;
1017 static inline void skb_reset_transport_header(struct sk_buff *skb)
1019 skb->transport_header = skb->data - skb->head;
1022 static inline void skb_set_transport_header(struct sk_buff *skb,
1025 skb_reset_transport_header(skb);
1026 skb->transport_header += offset;
1029 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
1031 return skb->head + skb->network_header;
1034 static inline void skb_reset_network_header(struct sk_buff *skb)
1036 skb->network_header = skb->data - skb->head;
1039 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1041 skb_reset_network_header(skb);
1042 skb->network_header += offset;
1045 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1047 return skb->head + skb->mac_header;
1050 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1052 return skb->mac_header != ~0U;
1055 static inline void skb_reset_mac_header(struct sk_buff *skb)
1057 skb->mac_header = skb->data - skb->head;
1060 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1062 skb_reset_mac_header(skb);
1063 skb->mac_header += offset;
1066 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1068 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
1070 return skb->transport_header;
1073 static inline void skb_reset_transport_header(struct sk_buff *skb)
1075 skb->transport_header = skb->data;
1078 static inline void skb_set_transport_header(struct sk_buff *skb,
1081 skb->transport_header = skb->data + offset;
1084 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
1086 return skb->network_header;
1089 static inline void skb_reset_network_header(struct sk_buff *skb)
1091 skb->network_header = skb->data;
1094 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1096 skb->network_header = skb->data + offset;
1099 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1101 return skb->mac_header;
1104 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1106 return skb->mac_header != NULL;
1109 static inline void skb_reset_mac_header(struct sk_buff *skb)
1111 skb->mac_header = skb->data;
1114 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1116 skb->mac_header = skb->data + offset;
1118 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1120 static inline int skb_transport_offset(const struct sk_buff *skb)
1122 return skb_transport_header(skb) - skb->data;
1125 static inline u32 skb_network_header_len(const struct sk_buff *skb)
1127 return skb->transport_header - skb->network_header;
1130 static inline int skb_network_offset(const struct sk_buff *skb)
1132 return skb_network_header(skb) - skb->data;
1136 * CPUs often take a performance hit when accessing unaligned memory
1137 * locations. The actual performance hit varies, it can be small if the
1138 * hardware handles it or large if we have to take an exception and fix it
1141 * Since an ethernet header is 14 bytes network drivers often end up with
1142 * the IP header at an unaligned offset. The IP header can be aligned by
1143 * shifting the start of the packet by 2 bytes. Drivers should do this
1146 * skb_reserve(NET_IP_ALIGN);
1148 * The downside to this alignment of the IP header is that the DMA is now
1149 * unaligned. On some architectures the cost of an unaligned DMA is high
1150 * and this cost outweighs the gains made by aligning the IP header.
1152 * Since this trade off varies between architectures, we allow NET_IP_ALIGN
1155 #ifndef NET_IP_ALIGN
1156 #define NET_IP_ALIGN 2
1160 * The networking layer reserves some headroom in skb data (via
1161 * dev_alloc_skb). This is used to avoid having to reallocate skb data when
1162 * the header has to grow. In the default case, if the header has to grow
1163 * 16 bytes or less we avoid the reallocation.
1165 * Unfortunately this headroom changes the DMA alignment of the resulting
1166 * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive
1167 * on some architectures. An architecture can override this value,
1168 * perhaps setting it to a cacheline in size (since that will maintain
1169 * cacheline alignment of the DMA). It must be a power of 2.
1171 * Various parts of the networking layer expect at least 16 bytes of
1172 * headroom, you should not reduce this.
1175 #define NET_SKB_PAD 16
1178 extern int ___pskb_trim(struct sk_buff *skb, unsigned int len);
1180 static inline void __skb_trim(struct sk_buff *skb, unsigned int len)
1182 if (unlikely(skb->data_len)) {
1187 skb_set_tail_pointer(skb, len);
1191 * skb_trim - remove end from a buffer
1192 * @skb: buffer to alter
1195 * Cut the length of a buffer down by removing data from the tail. If
1196 * the buffer is already under the length specified it is not modified.
1197 * The skb must be linear.
1199 static inline void skb_trim(struct sk_buff *skb, unsigned int len)
1202 __skb_trim(skb, len);
1206 static inline int __pskb_trim(struct sk_buff *skb, unsigned int len)
1209 return ___pskb_trim(skb, len);
1210 __skb_trim(skb, len);
1214 static inline int pskb_trim(struct sk_buff *skb, unsigned int len)
1216 return (len < skb->len) ? __pskb_trim(skb, len) : 0;
1220 * pskb_trim_unique - remove end from a paged unique (not cloned) buffer
1221 * @skb: buffer to alter
1224 * This is identical to pskb_trim except that the caller knows that
1225 * the skb is not cloned so we should never get an error due to out-
1228 static inline void pskb_trim_unique(struct sk_buff *skb, unsigned int len)
1230 int err = pskb_trim(skb, len);
1235 * skb_orphan - orphan a buffer
1236 * @skb: buffer to orphan
1238 * If a buffer currently has an owner then we call the owner's
1239 * destructor function and make the @skb unowned. The buffer continues
1240 * to exist but is no longer charged to its former owner.
1242 static inline void skb_orphan(struct sk_buff *skb)
1244 if (skb->destructor)
1245 skb->destructor(skb);
1246 skb->destructor = NULL;
1251 * __skb_queue_purge - empty a list
1252 * @list: list to empty
1254 * Delete all buffers on an &sk_buff list. Each buffer is removed from
1255 * the list and one reference dropped. This function does not take the
1256 * list lock and the caller must hold the relevant locks to use it.
1258 extern void skb_queue_purge(struct sk_buff_head *list);
1259 static inline void __skb_queue_purge(struct sk_buff_head *list)
1261 struct sk_buff *skb;
1262 while ((skb = __skb_dequeue(list)) != NULL)
1267 * __dev_alloc_skb - allocate an skbuff for receiving
1268 * @length: length to allocate
1269 * @gfp_mask: get_free_pages mask, passed to alloc_skb
1271 * Allocate a new &sk_buff and assign it a usage count of one. The
1272 * buffer has unspecified headroom built in. Users should allocate
1273 * the headroom they think they need without accounting for the
1274 * built in space. The built in space is used for optimisations.
1276 * %NULL is returned if there is no free memory.
1278 static inline struct sk_buff *__dev_alloc_skb(unsigned int length,
1281 struct sk_buff *skb = alloc_skb(length + NET_SKB_PAD, gfp_mask);
1283 skb_reserve(skb, NET_SKB_PAD);
1288 * dev_alloc_skb - allocate an skbuff for receiving
1289 * @length: length to allocate
1291 * Allocate a new &sk_buff and assign it a usage count of one. The
1292 * buffer has unspecified headroom built in. Users should allocate
1293 * the headroom they think they need without accounting for the
1294 * built in space. The built in space is used for optimisations.
1296 * %NULL is returned if there is no free memory. Although this function
1297 * allocates memory it can be called from an interrupt.
1299 static inline struct sk_buff *dev_alloc_skb(unsigned int length)
1301 return __dev_alloc_skb(length, GFP_ATOMIC);
1304 extern struct sk_buff *__netdev_alloc_skb(struct net_device *dev,
1305 unsigned int length, gfp_t gfp_mask);
1308 * netdev_alloc_skb - allocate an skbuff for rx on a specific device
1309 * @dev: network device to receive on
1310 * @length: length to allocate
1312 * Allocate a new &sk_buff and assign it a usage count of one. The
1313 * buffer has unspecified headroom built in. Users should allocate
1314 * the headroom they think they need without accounting for the
1315 * built in space. The built in space is used for optimisations.
1317 * %NULL is returned if there is no free memory. Although this function
1318 * allocates memory it can be called from an interrupt.
1320 static inline struct sk_buff *netdev_alloc_skb(struct net_device *dev,
1321 unsigned int length)
1323 return __netdev_alloc_skb(dev, length, GFP_ATOMIC);
1327 * skb_clone_writable - is the header of a clone writable
1328 * @skb: buffer to check
1329 * @len: length up to which to write
1331 * Returns true if modifying the header part of the cloned buffer
1332 * does not requires the data to be copied.
1334 static inline int skb_clone_writable(struct sk_buff *skb, int len)
1336 return !skb_header_cloned(skb) &&
1337 skb_headroom(skb) + len <= skb->hdr_len;
1341 * skb_cow - copy header of skb when it is required
1342 * @skb: buffer to cow
1343 * @headroom: needed headroom
1345 * If the skb passed lacks sufficient headroom or its data part
1346 * is shared, data is reallocated. If reallocation fails, an error
1347 * is returned and original skb is not changed.
1349 * The result is skb with writable area skb->head...skb->tail
1350 * and at least @headroom of space at head.
1352 static inline int skb_cow(struct sk_buff *skb, unsigned int headroom)
1354 int delta = (headroom > NET_SKB_PAD ? headroom : NET_SKB_PAD) -
1360 if (delta || skb_cloned(skb))
1361 return pskb_expand_head(skb, (delta + (NET_SKB_PAD-1)) &
1362 ~(NET_SKB_PAD-1), 0, GFP_ATOMIC);
1367 * skb_padto - pad an skbuff up to a minimal size
1368 * @skb: buffer to pad
1369 * @len: minimal length
1371 * Pads up a buffer to ensure the trailing bytes exist and are
1372 * blanked. If the buffer already contains sufficient data it
1373 * is untouched. Otherwise it is extended. Returns zero on
1374 * success. The skb is freed on error.
1377 static inline int skb_padto(struct sk_buff *skb, unsigned int len)
1379 unsigned int size = skb->len;
1380 if (likely(size >= len))
1382 return skb_pad(skb, len-size);
1385 static inline int skb_add_data(struct sk_buff *skb,
1386 char __user *from, int copy)
1388 const int off = skb->len;
1390 if (skb->ip_summed == CHECKSUM_NONE) {
1392 __wsum csum = csum_and_copy_from_user(from, skb_put(skb, copy),
1395 skb->csum = csum_block_add(skb->csum, csum, off);
1398 } else if (!copy_from_user(skb_put(skb, copy), from, copy))
1401 __skb_trim(skb, off);
1405 static inline int skb_can_coalesce(struct sk_buff *skb, int i,
1406 struct page *page, int off)
1409 struct skb_frag_struct *frag = &skb_shinfo(skb)->frags[i - 1];
1411 return page == frag->page &&
1412 off == frag->page_offset + frag->size;
1417 static inline int __skb_linearize(struct sk_buff *skb)
1419 return __pskb_pull_tail(skb, skb->data_len) ? 0 : -ENOMEM;
1423 * skb_linearize - convert paged skb to linear one
1424 * @skb: buffer to linarize
1426 * If there is no free memory -ENOMEM is returned, otherwise zero
1427 * is returned and the old skb data released.
1429 static inline int skb_linearize(struct sk_buff *skb)
1431 return skb_is_nonlinear(skb) ? __skb_linearize(skb) : 0;
1435 * skb_linearize_cow - make sure skb is linear and writable
1436 * @skb: buffer to process
1438 * If there is no free memory -ENOMEM is returned, otherwise zero
1439 * is returned and the old skb data released.
1441 static inline int skb_linearize_cow(struct sk_buff *skb)
1443 return skb_is_nonlinear(skb) || skb_cloned(skb) ?
1444 __skb_linearize(skb) : 0;
1448 * skb_postpull_rcsum - update checksum for received skb after pull
1449 * @skb: buffer to update
1450 * @start: start of data before pull
1451 * @len: length of data pulled
1453 * After doing a pull on a received packet, you need to call this to
1454 * update the CHECKSUM_COMPLETE checksum, or set ip_summed to
1455 * CHECKSUM_NONE so that it can be recomputed from scratch.
1458 static inline void skb_postpull_rcsum(struct sk_buff *skb,
1459 const void *start, unsigned int len)
1461 if (skb->ip_summed == CHECKSUM_COMPLETE)
1462 skb->csum = csum_sub(skb->csum, csum_partial(start, len, 0));
1465 unsigned char *skb_pull_rcsum(struct sk_buff *skb, unsigned int len);
1468 * pskb_trim_rcsum - trim received skb and update checksum
1469 * @skb: buffer to trim
1472 * This is exactly the same as pskb_trim except that it ensures the
1473 * checksum of received packets are still valid after the operation.
1476 static inline int pskb_trim_rcsum(struct sk_buff *skb, unsigned int len)
1478 if (likely(len >= skb->len))
1480 if (skb->ip_summed == CHECKSUM_COMPLETE)
1481 skb->ip_summed = CHECKSUM_NONE;
1482 return __pskb_trim(skb, len);
1485 #define skb_queue_walk(queue, skb) \
1486 for (skb = (queue)->next; \
1487 prefetch(skb->next), (skb != (struct sk_buff *)(queue)); \
1490 #define skb_queue_walk_safe(queue, skb, tmp) \
1491 for (skb = (queue)->next, tmp = skb->next; \
1492 skb != (struct sk_buff *)(queue); \
1493 skb = tmp, tmp = skb->next)
1495 #define skb_queue_reverse_walk(queue, skb) \
1496 for (skb = (queue)->prev; \
1497 prefetch(skb->prev), (skb != (struct sk_buff *)(queue)); \
1501 extern struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags,
1502 int noblock, int *err);
1503 extern unsigned int datagram_poll(struct file *file, struct socket *sock,
1504 struct poll_table_struct *wait);
1505 extern int skb_copy_datagram_iovec(const struct sk_buff *from,
1506 int offset, struct iovec *to,
1508 extern int skb_copy_and_csum_datagram_iovec(struct sk_buff *skb,
1511 extern void skb_free_datagram(struct sock *sk, struct sk_buff *skb);
1512 extern void skb_kill_datagram(struct sock *sk, struct sk_buff *skb,
1513 unsigned int flags);
1514 extern __wsum skb_checksum(const struct sk_buff *skb, int offset,
1515 int len, __wsum csum);
1516 extern int skb_copy_bits(const struct sk_buff *skb, int offset,
1518 extern int skb_store_bits(struct sk_buff *skb, int offset,
1519 const void *from, int len);
1520 extern __wsum skb_copy_and_csum_bits(const struct sk_buff *skb,
1521 int offset, u8 *to, int len,
1523 extern void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to);
1524 extern void skb_split(struct sk_buff *skb,
1525 struct sk_buff *skb1, const u32 len);
1527 extern struct sk_buff *skb_segment(struct sk_buff *skb, int features);
1529 static inline void *skb_header_pointer(const struct sk_buff *skb, int offset,
1530 int len, void *buffer)
1532 int hlen = skb_headlen(skb);
1534 if (hlen - offset >= len)
1535 return skb->data + offset;
1537 if (skb_copy_bits(skb, offset, buffer, len) < 0)
1543 static inline void skb_copy_from_linear_data(const struct sk_buff *skb,
1545 const unsigned int len)
1547 memcpy(to, skb->data, len);
1550 static inline void skb_copy_from_linear_data_offset(const struct sk_buff *skb,
1551 const int offset, void *to,
1552 const unsigned int len)
1554 memcpy(to, skb->data + offset, len);
1557 static inline void skb_copy_to_linear_data(struct sk_buff *skb,
1559 const unsigned int len)
1561 memcpy(skb->data, from, len);
1564 static inline void skb_copy_to_linear_data_offset(struct sk_buff *skb,
1567 const unsigned int len)
1569 memcpy(skb->data + offset, from, len);
1572 extern void skb_init(void);
1575 * skb_get_timestamp - get timestamp from a skb
1576 * @skb: skb to get stamp from
1577 * @stamp: pointer to struct timeval to store stamp in
1579 * Timestamps are stored in the skb as offsets to a base timestamp.
1580 * This function converts the offset back to a struct timeval and stores
1583 static inline void skb_get_timestamp(const struct sk_buff *skb, struct timeval *stamp)
1585 *stamp = ktime_to_timeval(skb->tstamp);
1588 static inline void __net_timestamp(struct sk_buff *skb)
1590 skb->tstamp = ktime_get_real();
1593 static inline ktime_t net_timedelta(ktime_t t)
1595 return ktime_sub(ktime_get_real(), t);
1598 static inline ktime_t net_invalid_timestamp(void)
1600 return ktime_set(0, 0);
1603 extern __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len);
1604 extern __sum16 __skb_checksum_complete(struct sk_buff *skb);
1606 static inline int skb_csum_unnecessary(const struct sk_buff *skb)
1608 return skb->ip_summed & CHECKSUM_UNNECESSARY;
1612 * skb_checksum_complete - Calculate checksum of an entire packet
1613 * @skb: packet to process
1615 * This function calculates the checksum over the entire packet plus
1616 * the value of skb->csum. The latter can be used to supply the
1617 * checksum of a pseudo header as used by TCP/UDP. It returns the
1620 * For protocols that contain complete checksums such as ICMP/TCP/UDP,
1621 * this function can be used to verify that checksum on received
1622 * packets. In that case the function should return zero if the
1623 * checksum is correct. In particular, this function will return zero
1624 * if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the
1625 * hardware has already verified the correctness of the checksum.
1627 static inline unsigned int skb_checksum_complete(struct sk_buff *skb)
1629 return skb_csum_unnecessary(skb) ?
1630 0 : __skb_checksum_complete(skb);
1633 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1634 extern void nf_conntrack_destroy(struct nf_conntrack *nfct);
1635 static inline void nf_conntrack_put(struct nf_conntrack *nfct)
1637 if (nfct && atomic_dec_and_test(&nfct->use))
1638 nf_conntrack_destroy(nfct);
1640 static inline void nf_conntrack_get(struct nf_conntrack *nfct)
1643 atomic_inc(&nfct->use);
1645 static inline void nf_conntrack_get_reasm(struct sk_buff *skb)
1648 atomic_inc(&skb->users);
1650 static inline void nf_conntrack_put_reasm(struct sk_buff *skb)
1656 #ifdef CONFIG_BRIDGE_NETFILTER
1657 static inline void nf_bridge_put(struct nf_bridge_info *nf_bridge)
1659 if (nf_bridge && atomic_dec_and_test(&nf_bridge->use))
1662 static inline void nf_bridge_get(struct nf_bridge_info *nf_bridge)
1665 atomic_inc(&nf_bridge->use);
1667 #endif /* CONFIG_BRIDGE_NETFILTER */
1668 static inline void nf_reset(struct sk_buff *skb)
1670 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1671 nf_conntrack_put(skb->nfct);
1673 nf_conntrack_put_reasm(skb->nfct_reasm);
1674 skb->nfct_reasm = NULL;
1676 #ifdef CONFIG_BRIDGE_NETFILTER
1677 nf_bridge_put(skb->nf_bridge);
1678 skb->nf_bridge = NULL;
1682 /* Note: This doesn't put any conntrack and bridge info in dst. */
1683 static inline void __nf_copy(struct sk_buff *dst, const struct sk_buff *src)
1685 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1686 dst->nfct = src->nfct;
1687 nf_conntrack_get(src->nfct);
1688 dst->nfctinfo = src->nfctinfo;
1689 dst->nfct_reasm = src->nfct_reasm;
1690 nf_conntrack_get_reasm(src->nfct_reasm);
1692 #ifdef CONFIG_BRIDGE_NETFILTER
1693 dst->nf_bridge = src->nf_bridge;
1694 nf_bridge_get(src->nf_bridge);
1698 static inline void nf_copy(struct sk_buff *dst, const struct sk_buff *src)
1700 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
1701 nf_conntrack_put(dst->nfct);
1702 nf_conntrack_put_reasm(dst->nfct_reasm);
1704 #ifdef CONFIG_BRIDGE_NETFILTER
1705 nf_bridge_put(dst->nf_bridge);
1707 __nf_copy(dst, src);
1710 #ifdef CONFIG_NETWORK_SECMARK
1711 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
1713 to->secmark = from->secmark;
1716 static inline void skb_init_secmark(struct sk_buff *skb)
1721 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
1724 static inline void skb_init_secmark(struct sk_buff *skb)
1728 static inline int skb_is_gso(const struct sk_buff *skb)
1730 return skb_shinfo(skb)->gso_size;
1733 static inline void skb_forward_csum(struct sk_buff *skb)
1735 /* Unfortunately we don't support this one. Any brave souls? */
1736 if (skb->ip_summed == CHECKSUM_COMPLETE)
1737 skb->ip_summed = CHECKSUM_NONE;
1740 #endif /* __KERNEL__ */
1741 #endif /* _LINUX_SKBUFF_H */