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/kmemcheck.h>
19 #include <linux/compiler.h>
20 #include <linux/time.h>
21 #include <linux/cache.h>
23 #include <linux/atomic.h>
24 #include <asm/types.h>
25 #include <linux/spinlock.h>
26 #include <linux/net.h>
27 #include <linux/textsearch.h>
28 #include <net/checksum.h>
29 #include <linux/rcupdate.h>
30 #include <linux/dmaengine.h>
31 #include <linux/hrtimer.h>
32 #include <linux/dma-mapping.h>
33 #include <linux/netdev_features.h>
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 /* return minimum truesize of one skb containing X bytes of data */
51 #define SKB_TRUESIZE(X) ((X) + \
52 SKB_DATA_ALIGN(sizeof(struct sk_buff)) + \
53 SKB_DATA_ALIGN(sizeof(struct skb_shared_info)))
55 /* A. Checksumming of received packets by device.
57 * NONE: device failed to checksum this packet.
58 * skb->csum is undefined.
60 * UNNECESSARY: device parsed packet and wouldbe verified checksum.
61 * skb->csum is undefined.
62 * It is bad option, but, unfortunately, many of vendors do this.
63 * Apparently with secret goal to sell you new device, when you
64 * will add new protocol to your host. F.e. IPv6. 8)
66 * COMPLETE: the most generic way. Device supplied checksum of _all_
67 * the packet as seen by netif_rx in skb->csum.
68 * NOTE: Even if device supports only some protocols, but
69 * is able to produce some skb->csum, it MUST use COMPLETE,
72 * PARTIAL: identical to the case for output below. This may occur
73 * on a packet received directly from another Linux OS, e.g.,
74 * a virtualised Linux kernel on the same host. The packet can
75 * be treated in the same way as UNNECESSARY except that on
76 * output (i.e., forwarding) the checksum must be filled in
77 * by the OS or the hardware.
79 * B. Checksumming on output.
81 * NONE: skb is checksummed by protocol or csum is not required.
83 * PARTIAL: device is required to csum packet as seen by hard_start_xmit
84 * from skb->csum_start to the end and to record the checksum
85 * at skb->csum_start + skb->csum_offset.
87 * Device must show its capabilities in dev->features, set
88 * at device setup time.
89 * NETIF_F_HW_CSUM - it is clever device, it is able to checksum
91 * NETIF_F_IP_CSUM - device is dumb. It is able to csum only
92 * TCP/UDP over IPv4. Sigh. Vendors like this
93 * way by an unknown reason. Though, see comment above
94 * about CHECKSUM_UNNECESSARY. 8)
95 * NETIF_F_IPV6_CSUM about as dumb as the last one but does IPv6 instead.
97 * Any questions? No questions, good. --ANK
102 struct pipe_inode_info;
104 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
105 struct nf_conntrack {
110 #ifdef CONFIG_BRIDGE_NETFILTER
111 struct nf_bridge_info {
113 struct net_device *physindev;
114 struct net_device *physoutdev;
116 unsigned long data[32 / sizeof(unsigned long)];
120 struct sk_buff_head {
121 /* These two members must be first. */
122 struct sk_buff *next;
123 struct sk_buff *prev;
131 /* To allow 64K frame to be packed as single skb without frag_list we
132 * require 64K/PAGE_SIZE pages plus 1 additional page to allow for
133 * buffers which do not start on a page boundary.
135 * Since GRO uses frags we allocate at least 16 regardless of page
138 #if (65536/PAGE_SIZE + 1) < 16
139 #define MAX_SKB_FRAGS 16UL
141 #define MAX_SKB_FRAGS (65536/PAGE_SIZE + 1)
144 typedef struct skb_frag_struct skb_frag_t;
146 struct skb_frag_struct {
150 #if (BITS_PER_LONG > 32) || (PAGE_SIZE >= 65536)
159 static inline unsigned int skb_frag_size(const skb_frag_t *frag)
164 static inline void skb_frag_size_set(skb_frag_t *frag, unsigned int size)
169 static inline void skb_frag_size_add(skb_frag_t *frag, int delta)
174 static inline void skb_frag_size_sub(skb_frag_t *frag, int delta)
179 #define HAVE_HW_TIME_STAMP
182 * struct skb_shared_hwtstamps - hardware time stamps
183 * @hwtstamp: hardware time stamp transformed into duration
184 * since arbitrary point in time
185 * @syststamp: hwtstamp transformed to system time base
187 * Software time stamps generated by ktime_get_real() are stored in
188 * skb->tstamp. The relation between the different kinds of time
189 * stamps is as follows:
191 * syststamp and tstamp can be compared against each other in
192 * arbitrary combinations. The accuracy of a
193 * syststamp/tstamp/"syststamp from other device" comparison is
194 * limited by the accuracy of the transformation into system time
195 * base. This depends on the device driver and its underlying
198 * hwtstamps can only be compared against other hwtstamps from
201 * This structure is attached to packets as part of the
202 * &skb_shared_info. Use skb_hwtstamps() to get a pointer.
204 struct skb_shared_hwtstamps {
209 /* Definitions for tx_flags in struct skb_shared_info */
211 /* generate hardware time stamp */
212 SKBTX_HW_TSTAMP = 1 << 0,
214 /* generate software time stamp */
215 SKBTX_SW_TSTAMP = 1 << 1,
217 /* device driver is going to provide hardware time stamp */
218 SKBTX_IN_PROGRESS = 1 << 2,
220 /* ensure the originating sk reference is available on driver level */
221 SKBTX_DRV_NEEDS_SK_REF = 1 << 3,
223 /* device driver supports TX zero-copy buffers */
224 SKBTX_DEV_ZEROCOPY = 1 << 4,
226 /* generate wifi status information (where possible) */
227 SKBTX_WIFI_STATUS = 1 << 5,
231 * The callback notifies userspace to release buffers when skb DMA is done in
232 * lower device, the skb last reference should be 0 when calling this.
233 * The desc is used to track userspace buffer index.
236 void (*callback)(void *);
241 /* This data is invariant across clones and lives at
242 * the end of the header data, ie. at skb->end.
244 struct skb_shared_info {
245 unsigned char nr_frags;
247 unsigned short gso_size;
248 /* Warning: this field is not always filled in (UFO)! */
249 unsigned short gso_segs;
250 unsigned short gso_type;
251 struct sk_buff *frag_list;
252 struct skb_shared_hwtstamps hwtstamps;
256 * Warning : all fields before dataref are cleared in __alloc_skb()
260 /* Intermediate layers must ensure that destructor_arg
261 * remains valid until skb destructor */
262 void * destructor_arg;
264 /* must be last field, see pskb_expand_head() */
265 skb_frag_t frags[MAX_SKB_FRAGS];
268 /* We divide dataref into two halves. The higher 16 bits hold references
269 * to the payload part of skb->data. The lower 16 bits hold references to
270 * the entire skb->data. A clone of a headerless skb holds the length of
271 * the header in skb->hdr_len.
273 * All users must obey the rule that the skb->data reference count must be
274 * greater than or equal to the payload reference count.
276 * Holding a reference to the payload part means that the user does not
277 * care about modifications to the header part of skb->data.
279 #define SKB_DATAREF_SHIFT 16
280 #define SKB_DATAREF_MASK ((1 << SKB_DATAREF_SHIFT) - 1)
284 SKB_FCLONE_UNAVAILABLE,
290 SKB_GSO_TCPV4 = 1 << 0,
291 SKB_GSO_UDP = 1 << 1,
293 /* This indicates the skb is from an untrusted source. */
294 SKB_GSO_DODGY = 1 << 2,
296 /* This indicates the tcp segment has CWR set. */
297 SKB_GSO_TCP_ECN = 1 << 3,
299 SKB_GSO_TCPV6 = 1 << 4,
301 SKB_GSO_FCOE = 1 << 5,
304 #if BITS_PER_LONG > 32
305 #define NET_SKBUFF_DATA_USES_OFFSET 1
308 #ifdef NET_SKBUFF_DATA_USES_OFFSET
309 typedef unsigned int sk_buff_data_t;
311 typedef unsigned char *sk_buff_data_t;
314 #if defined(CONFIG_NF_DEFRAG_IPV4) || defined(CONFIG_NF_DEFRAG_IPV4_MODULE) || \
315 defined(CONFIG_NF_DEFRAG_IPV6) || defined(CONFIG_NF_DEFRAG_IPV6_MODULE)
316 #define NET_SKBUFF_NF_DEFRAG_NEEDED 1
320 * struct sk_buff - socket buffer
321 * @next: Next buffer in list
322 * @prev: Previous buffer in list
323 * @tstamp: Time we arrived
324 * @sk: Socket we are owned by
325 * @dev: Device we arrived on/are leaving by
326 * @cb: Control buffer. Free for use by every layer. Put private vars here
327 * @_skb_refdst: destination entry (with norefcount bit)
328 * @sp: the security path, used for xfrm
329 * @len: Length of actual data
330 * @data_len: Data length
331 * @mac_len: Length of link layer header
332 * @hdr_len: writable header length of cloned skb
333 * @csum: Checksum (must include start/offset pair)
334 * @csum_start: Offset from skb->head where checksumming should start
335 * @csum_offset: Offset from csum_start where checksum should be stored
336 * @priority: Packet queueing priority
337 * @local_df: allow local fragmentation
338 * @cloned: Head may be cloned (check refcnt to be sure)
339 * @ip_summed: Driver fed us an IP checksum
340 * @nohdr: Payload reference only, must not modify header
341 * @nfctinfo: Relationship of this skb to the connection
342 * @pkt_type: Packet class
343 * @fclone: skbuff clone status
344 * @ipvs_property: skbuff is owned by ipvs
345 * @peeked: this packet has been seen already, so stats have been
346 * done for it, don't do them again
347 * @nf_trace: netfilter packet trace flag
348 * @protocol: Packet protocol from driver
349 * @destructor: Destruct function
350 * @nfct: Associated connection, if any
351 * @nfct_reasm: netfilter conntrack re-assembly pointer
352 * @nf_bridge: Saved data about a bridged frame - see br_netfilter.c
353 * @skb_iif: ifindex of device we arrived on
354 * @tc_index: Traffic control index
355 * @tc_verd: traffic control verdict
356 * @rxhash: the packet hash computed on receive
357 * @queue_mapping: Queue mapping for multiqueue devices
358 * @ndisc_nodetype: router type (from link layer)
359 * @ooo_okay: allow the mapping of a socket to a queue to be changed
360 * @l4_rxhash: indicate rxhash is a canonical 4-tuple hash over transport
362 * @wifi_acked_valid: wifi_acked was set
363 * @wifi_acked: whether frame was acked on wifi or not
364 * @dma_cookie: a cookie to one of several possible DMA operations
365 * done by skb DMA functions
366 * @secmark: security marking
367 * @mark: Generic packet mark
368 * @dropcount: total number of sk_receive_queue overflows
369 * @vlan_tci: vlan tag control information
370 * @transport_header: Transport layer header
371 * @network_header: Network layer header
372 * @mac_header: Link layer header
373 * @tail: Tail pointer
375 * @head: Head of buffer
376 * @data: Data head pointer
377 * @truesize: Buffer size
378 * @users: User count - see {datagram,tcp}.c
382 /* These two members must be first. */
383 struct sk_buff *next;
384 struct sk_buff *prev;
389 struct net_device *dev;
392 * This is the control buffer. It is free to use for every
393 * layer. Please put your private variables there. If you
394 * want to keep them across layers you have to do a skb_clone()
395 * first. This is owned by whoever has the skb queued ATM.
397 char cb[48] __aligned(8);
399 unsigned long _skb_refdst;
415 kmemcheck_bitfield_begin(flags1);
426 kmemcheck_bitfield_end(flags1);
429 void (*destructor)(struct sk_buff *skb);
430 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
431 struct nf_conntrack *nfct;
433 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
434 struct sk_buff *nfct_reasm;
436 #ifdef CONFIG_BRIDGE_NETFILTER
437 struct nf_bridge_info *nf_bridge;
446 #ifdef CONFIG_NET_SCHED
447 __u16 tc_index; /* traffic control index */
448 #ifdef CONFIG_NET_CLS_ACT
449 __u16 tc_verd; /* traffic control verdict */
454 kmemcheck_bitfield_begin(flags2);
455 #ifdef CONFIG_IPV6_NDISC_NODETYPE
456 __u8 ndisc_nodetype:2;
460 __u8 wifi_acked_valid:1;
462 /* 10/12 bit hole (depending on ndisc_nodetype presence) */
463 kmemcheck_bitfield_end(flags2);
465 #ifdef CONFIG_NET_DMA
466 dma_cookie_t dma_cookie;
468 #ifdef CONFIG_NETWORK_SECMARK
476 sk_buff_data_t transport_header;
477 sk_buff_data_t network_header;
478 sk_buff_data_t mac_header;
479 /* These elements must be at the end, see alloc_skb() for details. */
484 unsigned int truesize;
490 * Handling routines are only of interest to the kernel
492 #include <linux/slab.h>
494 #include <asm/system.h>
497 * skb might have a dst pointer attached, refcounted or not.
498 * _skb_refdst low order bit is set if refcount was _not_ taken
500 #define SKB_DST_NOREF 1UL
501 #define SKB_DST_PTRMASK ~(SKB_DST_NOREF)
504 * skb_dst - returns skb dst_entry
507 * Returns skb dst_entry, regardless of reference taken or not.
509 static inline struct dst_entry *skb_dst(const struct sk_buff *skb)
511 /* If refdst was not refcounted, check we still are in a
512 * rcu_read_lock section
514 WARN_ON((skb->_skb_refdst & SKB_DST_NOREF) &&
515 !rcu_read_lock_held() &&
516 !rcu_read_lock_bh_held());
517 return (struct dst_entry *)(skb->_skb_refdst & SKB_DST_PTRMASK);
521 * skb_dst_set - sets skb dst
525 * Sets skb dst, assuming a reference was taken on dst and should
526 * be released by skb_dst_drop()
528 static inline void skb_dst_set(struct sk_buff *skb, struct dst_entry *dst)
530 skb->_skb_refdst = (unsigned long)dst;
533 extern void skb_dst_set_noref(struct sk_buff *skb, struct dst_entry *dst);
536 * skb_dst_is_noref - Test if skb dst isn't refcounted
539 static inline bool skb_dst_is_noref(const struct sk_buff *skb)
541 return (skb->_skb_refdst & SKB_DST_NOREF) && skb_dst(skb);
544 static inline struct rtable *skb_rtable(const struct sk_buff *skb)
546 return (struct rtable *)skb_dst(skb);
549 extern void kfree_skb(struct sk_buff *skb);
550 extern void consume_skb(struct sk_buff *skb);
551 extern void __kfree_skb(struct sk_buff *skb);
552 extern struct sk_buff *__alloc_skb(unsigned int size,
553 gfp_t priority, int fclone, int node);
554 extern struct sk_buff *build_skb(void *data);
555 static inline struct sk_buff *alloc_skb(unsigned int size,
558 return __alloc_skb(size, priority, 0, NUMA_NO_NODE);
561 static inline struct sk_buff *alloc_skb_fclone(unsigned int size,
564 return __alloc_skb(size, priority, 1, NUMA_NO_NODE);
567 extern void skb_recycle(struct sk_buff *skb);
568 extern bool skb_recycle_check(struct sk_buff *skb, int skb_size);
570 extern struct sk_buff *skb_morph(struct sk_buff *dst, struct sk_buff *src);
571 extern int skb_copy_ubufs(struct sk_buff *skb, gfp_t gfp_mask);
572 extern struct sk_buff *skb_clone(struct sk_buff *skb,
574 extern struct sk_buff *skb_copy(const struct sk_buff *skb,
576 extern struct sk_buff *__pskb_copy(struct sk_buff *skb,
577 int headroom, gfp_t gfp_mask);
579 extern int pskb_expand_head(struct sk_buff *skb,
580 int nhead, int ntail,
582 extern struct sk_buff *skb_realloc_headroom(struct sk_buff *skb,
583 unsigned int headroom);
584 extern struct sk_buff *skb_copy_expand(const struct sk_buff *skb,
585 int newheadroom, int newtailroom,
587 extern int skb_to_sgvec(struct sk_buff *skb,
588 struct scatterlist *sg, int offset,
590 extern int skb_cow_data(struct sk_buff *skb, int tailbits,
591 struct sk_buff **trailer);
592 extern int skb_pad(struct sk_buff *skb, int pad);
593 #define dev_kfree_skb(a) consume_skb(a)
595 extern int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb,
596 int getfrag(void *from, char *to, int offset,
597 int len,int odd, struct sk_buff *skb),
598 void *from, int length);
600 struct skb_seq_state {
604 __u32 stepped_offset;
605 struct sk_buff *root_skb;
606 struct sk_buff *cur_skb;
610 extern void skb_prepare_seq_read(struct sk_buff *skb,
611 unsigned int from, unsigned int to,
612 struct skb_seq_state *st);
613 extern unsigned int skb_seq_read(unsigned int consumed, const u8 **data,
614 struct skb_seq_state *st);
615 extern void skb_abort_seq_read(struct skb_seq_state *st);
617 extern unsigned int skb_find_text(struct sk_buff *skb, unsigned int from,
618 unsigned int to, struct ts_config *config,
619 struct ts_state *state);
621 extern void __skb_get_rxhash(struct sk_buff *skb);
622 static inline __u32 skb_get_rxhash(struct sk_buff *skb)
625 __skb_get_rxhash(skb);
630 #ifdef NET_SKBUFF_DATA_USES_OFFSET
631 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
633 return skb->head + skb->end;
636 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
643 #define skb_shinfo(SKB) ((struct skb_shared_info *)(skb_end_pointer(SKB)))
645 static inline struct skb_shared_hwtstamps *skb_hwtstamps(struct sk_buff *skb)
647 return &skb_shinfo(skb)->hwtstamps;
651 * skb_queue_empty - check if a queue is empty
654 * Returns true if the queue is empty, false otherwise.
656 static inline int skb_queue_empty(const struct sk_buff_head *list)
658 return list->next == (struct sk_buff *)list;
662 * skb_queue_is_last - check if skb is the last entry in the queue
666 * Returns true if @skb is the last buffer on the list.
668 static inline bool skb_queue_is_last(const struct sk_buff_head *list,
669 const struct sk_buff *skb)
671 return skb->next == (struct sk_buff *)list;
675 * skb_queue_is_first - check if skb is the first entry in the queue
679 * Returns true if @skb is the first buffer on the list.
681 static inline bool skb_queue_is_first(const struct sk_buff_head *list,
682 const struct sk_buff *skb)
684 return skb->prev == (struct sk_buff *)list;
688 * skb_queue_next - return the next packet in the queue
690 * @skb: current buffer
692 * Return the next packet in @list after @skb. It is only valid to
693 * call this if skb_queue_is_last() evaluates to false.
695 static inline struct sk_buff *skb_queue_next(const struct sk_buff_head *list,
696 const struct sk_buff *skb)
698 /* This BUG_ON may seem severe, but if we just return then we
699 * are going to dereference garbage.
701 BUG_ON(skb_queue_is_last(list, skb));
706 * skb_queue_prev - return the prev packet in the queue
708 * @skb: current buffer
710 * Return the prev packet in @list before @skb. It is only valid to
711 * call this if skb_queue_is_first() evaluates to false.
713 static inline struct sk_buff *skb_queue_prev(const struct sk_buff_head *list,
714 const struct sk_buff *skb)
716 /* This BUG_ON may seem severe, but if we just return then we
717 * are going to dereference garbage.
719 BUG_ON(skb_queue_is_first(list, skb));
724 * skb_get - reference buffer
725 * @skb: buffer to reference
727 * Makes another reference to a socket buffer and returns a pointer
730 static inline struct sk_buff *skb_get(struct sk_buff *skb)
732 atomic_inc(&skb->users);
737 * If users == 1, we are the only owner and are can avoid redundant
742 * skb_cloned - is the buffer a clone
743 * @skb: buffer to check
745 * Returns true if the buffer was generated with skb_clone() and is
746 * one of multiple shared copies of the buffer. Cloned buffers are
747 * shared data so must not be written to under normal circumstances.
749 static inline int skb_cloned(const struct sk_buff *skb)
751 return skb->cloned &&
752 (atomic_read(&skb_shinfo(skb)->dataref) & SKB_DATAREF_MASK) != 1;
756 * skb_header_cloned - is the header a clone
757 * @skb: buffer to check
759 * Returns true if modifying the header part of the buffer requires
760 * the data to be copied.
762 static inline int skb_header_cloned(const struct sk_buff *skb)
769 dataref = atomic_read(&skb_shinfo(skb)->dataref);
770 dataref = (dataref & SKB_DATAREF_MASK) - (dataref >> SKB_DATAREF_SHIFT);
775 * skb_header_release - release reference to header
776 * @skb: buffer to operate on
778 * Drop a reference to the header part of the buffer. This is done
779 * by acquiring a payload reference. You must not read from the header
780 * part of skb->data after this.
782 static inline void skb_header_release(struct sk_buff *skb)
786 atomic_add(1 << SKB_DATAREF_SHIFT, &skb_shinfo(skb)->dataref);
790 * skb_shared - is the buffer shared
791 * @skb: buffer to check
793 * Returns true if more than one person has a reference to this
796 static inline int skb_shared(const struct sk_buff *skb)
798 return atomic_read(&skb->users) != 1;
802 * skb_share_check - check if buffer is shared and if so clone it
803 * @skb: buffer to check
804 * @pri: priority for memory allocation
806 * If the buffer is shared the buffer is cloned and the old copy
807 * drops a reference. A new clone with a single reference is returned.
808 * If the buffer is not shared the original buffer is returned. When
809 * being called from interrupt status or with spinlocks held pri must
812 * NULL is returned on a memory allocation failure.
814 static inline struct sk_buff *skb_share_check(struct sk_buff *skb,
817 might_sleep_if(pri & __GFP_WAIT);
818 if (skb_shared(skb)) {
819 struct sk_buff *nskb = skb_clone(skb, pri);
827 * Copy shared buffers into a new sk_buff. We effectively do COW on
828 * packets to handle cases where we have a local reader and forward
829 * and a couple of other messy ones. The normal one is tcpdumping
830 * a packet thats being forwarded.
834 * skb_unshare - make a copy of a shared buffer
835 * @skb: buffer to check
836 * @pri: priority for memory allocation
838 * If the socket buffer is a clone then this function creates a new
839 * copy of the data, drops a reference count on the old copy and returns
840 * the new copy with the reference count at 1. If the buffer is not a clone
841 * the original buffer is returned. When called with a spinlock held or
842 * from interrupt state @pri must be %GFP_ATOMIC
844 * %NULL is returned on a memory allocation failure.
846 static inline struct sk_buff *skb_unshare(struct sk_buff *skb,
849 might_sleep_if(pri & __GFP_WAIT);
850 if (skb_cloned(skb)) {
851 struct sk_buff *nskb = skb_copy(skb, pri);
852 kfree_skb(skb); /* Free our shared copy */
859 * skb_peek - peek at the head of an &sk_buff_head
860 * @list_: list to peek at
862 * Peek an &sk_buff. Unlike most other operations you _MUST_
863 * be careful with this one. A peek leaves the buffer on the
864 * list and someone else may run off with it. You must hold
865 * the appropriate locks or have a private queue to do this.
867 * Returns %NULL for an empty list or a pointer to the head element.
868 * The reference count is not incremented and the reference is therefore
869 * volatile. Use with caution.
871 static inline struct sk_buff *skb_peek(const struct sk_buff_head *list_)
873 struct sk_buff *list = ((const struct sk_buff *)list_)->next;
874 if (list == (struct sk_buff *)list_)
880 * skb_peek_next - peek skb following the given one from a queue
881 * @skb: skb to start from
882 * @list_: list to peek at
884 * Returns %NULL when the end of the list is met or a pointer to the
885 * next element. The reference count is not incremented and the
886 * reference is therefore volatile. Use with caution.
888 static inline struct sk_buff *skb_peek_next(struct sk_buff *skb,
889 const struct sk_buff_head *list_)
891 struct sk_buff *next = skb->next;
892 if (next == (struct sk_buff *)list_)
898 * skb_peek_tail - peek at the tail of an &sk_buff_head
899 * @list_: list to peek at
901 * Peek an &sk_buff. Unlike most other operations you _MUST_
902 * be careful with this one. A peek leaves the buffer on the
903 * list and someone else may run off with it. You must hold
904 * the appropriate locks or have a private queue to do this.
906 * Returns %NULL for an empty list or a pointer to the tail element.
907 * The reference count is not incremented and the reference is therefore
908 * volatile. Use with caution.
910 static inline struct sk_buff *skb_peek_tail(const struct sk_buff_head *list_)
912 struct sk_buff *list = ((const struct sk_buff *)list_)->prev;
913 if (list == (struct sk_buff *)list_)
919 * skb_queue_len - get queue length
920 * @list_: list to measure
922 * Return the length of an &sk_buff queue.
924 static inline __u32 skb_queue_len(const struct sk_buff_head *list_)
930 * __skb_queue_head_init - initialize non-spinlock portions of sk_buff_head
931 * @list: queue to initialize
933 * This initializes only the list and queue length aspects of
934 * an sk_buff_head object. This allows to initialize the list
935 * aspects of an sk_buff_head without reinitializing things like
936 * the spinlock. It can also be used for on-stack sk_buff_head
937 * objects where the spinlock is known to not be used.
939 static inline void __skb_queue_head_init(struct sk_buff_head *list)
941 list->prev = list->next = (struct sk_buff *)list;
946 * This function creates a split out lock class for each invocation;
947 * this is needed for now since a whole lot of users of the skb-queue
948 * infrastructure in drivers have different locking usage (in hardirq)
949 * than the networking core (in softirq only). In the long run either the
950 * network layer or drivers should need annotation to consolidate the
951 * main types of usage into 3 classes.
953 static inline void skb_queue_head_init(struct sk_buff_head *list)
955 spin_lock_init(&list->lock);
956 __skb_queue_head_init(list);
959 static inline void skb_queue_head_init_class(struct sk_buff_head *list,
960 struct lock_class_key *class)
962 skb_queue_head_init(list);
963 lockdep_set_class(&list->lock, class);
967 * Insert an sk_buff on a list.
969 * The "__skb_xxxx()" functions are the non-atomic ones that
970 * can only be called with interrupts disabled.
972 extern void skb_insert(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list);
973 static inline void __skb_insert(struct sk_buff *newsk,
974 struct sk_buff *prev, struct sk_buff *next,
975 struct sk_buff_head *list)
979 next->prev = prev->next = newsk;
983 static inline void __skb_queue_splice(const struct sk_buff_head *list,
984 struct sk_buff *prev,
985 struct sk_buff *next)
987 struct sk_buff *first = list->next;
988 struct sk_buff *last = list->prev;
998 * skb_queue_splice - join two skb lists, this is designed for stacks
999 * @list: the new list to add
1000 * @head: the place to add it in the first list
1002 static inline void skb_queue_splice(const struct sk_buff_head *list,
1003 struct sk_buff_head *head)
1005 if (!skb_queue_empty(list)) {
1006 __skb_queue_splice(list, (struct sk_buff *) head, head->next);
1007 head->qlen += list->qlen;
1012 * skb_queue_splice - join two skb lists and reinitialise the emptied list
1013 * @list: the new list to add
1014 * @head: the place to add it in the first list
1016 * The list at @list is reinitialised
1018 static inline void skb_queue_splice_init(struct sk_buff_head *list,
1019 struct sk_buff_head *head)
1021 if (!skb_queue_empty(list)) {
1022 __skb_queue_splice(list, (struct sk_buff *) head, head->next);
1023 head->qlen += list->qlen;
1024 __skb_queue_head_init(list);
1029 * skb_queue_splice_tail - join two skb lists, each list being a queue
1030 * @list: the new list to add
1031 * @head: the place to add it in the first list
1033 static inline void skb_queue_splice_tail(const struct sk_buff_head *list,
1034 struct sk_buff_head *head)
1036 if (!skb_queue_empty(list)) {
1037 __skb_queue_splice(list, head->prev, (struct sk_buff *) head);
1038 head->qlen += list->qlen;
1043 * skb_queue_splice_tail - join two skb lists and reinitialise the emptied list
1044 * @list: the new list to add
1045 * @head: the place to add it in the first list
1047 * Each of the lists is a queue.
1048 * The list at @list is reinitialised
1050 static inline void skb_queue_splice_tail_init(struct sk_buff_head *list,
1051 struct sk_buff_head *head)
1053 if (!skb_queue_empty(list)) {
1054 __skb_queue_splice(list, head->prev, (struct sk_buff *) head);
1055 head->qlen += list->qlen;
1056 __skb_queue_head_init(list);
1061 * __skb_queue_after - queue a buffer at the list head
1062 * @list: list to use
1063 * @prev: place after this buffer
1064 * @newsk: buffer to queue
1066 * Queue a buffer int the middle of a list. This function takes no locks
1067 * and you must therefore hold required locks before calling it.
1069 * A buffer cannot be placed on two lists at the same time.
1071 static inline void __skb_queue_after(struct sk_buff_head *list,
1072 struct sk_buff *prev,
1073 struct sk_buff *newsk)
1075 __skb_insert(newsk, prev, prev->next, list);
1078 extern void skb_append(struct sk_buff *old, struct sk_buff *newsk,
1079 struct sk_buff_head *list);
1081 static inline void __skb_queue_before(struct sk_buff_head *list,
1082 struct sk_buff *next,
1083 struct sk_buff *newsk)
1085 __skb_insert(newsk, next->prev, next, list);
1089 * __skb_queue_head - queue a buffer at the list head
1090 * @list: list to use
1091 * @newsk: buffer to queue
1093 * Queue a buffer at the start of a list. This function takes no locks
1094 * and you must therefore hold required locks before calling it.
1096 * A buffer cannot be placed on two lists at the same time.
1098 extern void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk);
1099 static inline void __skb_queue_head(struct sk_buff_head *list,
1100 struct sk_buff *newsk)
1102 __skb_queue_after(list, (struct sk_buff *)list, newsk);
1106 * __skb_queue_tail - queue a buffer at the list tail
1107 * @list: list to use
1108 * @newsk: buffer to queue
1110 * Queue a buffer at the end of a list. This function takes no locks
1111 * and you must therefore hold required locks before calling it.
1113 * A buffer cannot be placed on two lists at the same time.
1115 extern void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk);
1116 static inline void __skb_queue_tail(struct sk_buff_head *list,
1117 struct sk_buff *newsk)
1119 __skb_queue_before(list, (struct sk_buff *)list, newsk);
1123 * remove sk_buff from list. _Must_ be called atomically, and with
1126 extern void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list);
1127 static inline void __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
1129 struct sk_buff *next, *prev;
1134 skb->next = skb->prev = NULL;
1140 * __skb_dequeue - remove from the head of the queue
1141 * @list: list to dequeue from
1143 * Remove the head of the list. This function does not take any locks
1144 * so must be used with appropriate locks held only. The head item is
1145 * returned or %NULL if the list is empty.
1147 extern struct sk_buff *skb_dequeue(struct sk_buff_head *list);
1148 static inline struct sk_buff *__skb_dequeue(struct sk_buff_head *list)
1150 struct sk_buff *skb = skb_peek(list);
1152 __skb_unlink(skb, list);
1157 * __skb_dequeue_tail - remove from the tail of the queue
1158 * @list: list to dequeue from
1160 * Remove the tail of the list. This function does not take any locks
1161 * so must be used with appropriate locks held only. The tail item is
1162 * returned or %NULL if the list is empty.
1164 extern struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list);
1165 static inline struct sk_buff *__skb_dequeue_tail(struct sk_buff_head *list)
1167 struct sk_buff *skb = skb_peek_tail(list);
1169 __skb_unlink(skb, list);
1174 static inline int skb_is_nonlinear(const struct sk_buff *skb)
1176 return skb->data_len;
1179 static inline unsigned int skb_headlen(const struct sk_buff *skb)
1181 return skb->len - skb->data_len;
1184 static inline int skb_pagelen(const struct sk_buff *skb)
1188 for (i = (int)skb_shinfo(skb)->nr_frags - 1; i >= 0; i--)
1189 len += skb_frag_size(&skb_shinfo(skb)->frags[i]);
1190 return len + skb_headlen(skb);
1194 * __skb_fill_page_desc - initialise a paged fragment in an skb
1195 * @skb: buffer containing fragment to be initialised
1196 * @i: paged fragment index to initialise
1197 * @page: the page to use for this fragment
1198 * @off: the offset to the data with @page
1199 * @size: the length of the data
1201 * Initialises the @i'th fragment of @skb to point to &size bytes at
1202 * offset @off within @page.
1204 * Does not take any additional reference on the fragment.
1206 static inline void __skb_fill_page_desc(struct sk_buff *skb, int i,
1207 struct page *page, int off, int size)
1209 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
1211 frag->page.p = page;
1212 frag->page_offset = off;
1213 skb_frag_size_set(frag, size);
1217 * skb_fill_page_desc - initialise a paged fragment in an skb
1218 * @skb: buffer containing fragment to be initialised
1219 * @i: paged fragment index to initialise
1220 * @page: the page to use for this fragment
1221 * @off: the offset to the data with @page
1222 * @size: the length of the data
1224 * As per __skb_fill_page_desc() -- initialises the @i'th fragment of
1225 * @skb to point to &size bytes at offset @off within @page. In
1226 * addition updates @skb such that @i is the last fragment.
1228 * Does not take any additional reference on the fragment.
1230 static inline void skb_fill_page_desc(struct sk_buff *skb, int i,
1231 struct page *page, int off, int size)
1233 __skb_fill_page_desc(skb, i, page, off, size);
1234 skb_shinfo(skb)->nr_frags = i + 1;
1237 extern void skb_add_rx_frag(struct sk_buff *skb, int i, struct page *page,
1240 #define SKB_PAGE_ASSERT(skb) BUG_ON(skb_shinfo(skb)->nr_frags)
1241 #define SKB_FRAG_ASSERT(skb) BUG_ON(skb_has_frag_list(skb))
1242 #define SKB_LINEAR_ASSERT(skb) BUG_ON(skb_is_nonlinear(skb))
1244 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1245 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
1247 return skb->head + skb->tail;
1250 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
1252 skb->tail = skb->data - skb->head;
1255 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
1257 skb_reset_tail_pointer(skb);
1258 skb->tail += offset;
1260 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1261 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
1266 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
1268 skb->tail = skb->data;
1271 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
1273 skb->tail = skb->data + offset;
1276 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1279 * Add data to an sk_buff
1281 extern unsigned char *skb_put(struct sk_buff *skb, unsigned int len);
1282 static inline unsigned char *__skb_put(struct sk_buff *skb, unsigned int len)
1284 unsigned char *tmp = skb_tail_pointer(skb);
1285 SKB_LINEAR_ASSERT(skb);
1291 extern unsigned char *skb_push(struct sk_buff *skb, unsigned int len);
1292 static inline unsigned char *__skb_push(struct sk_buff *skb, unsigned int len)
1299 extern unsigned char *skb_pull(struct sk_buff *skb, unsigned int len);
1300 static inline unsigned char *__skb_pull(struct sk_buff *skb, unsigned int len)
1303 BUG_ON(skb->len < skb->data_len);
1304 return skb->data += len;
1307 static inline unsigned char *skb_pull_inline(struct sk_buff *skb, unsigned int len)
1309 return unlikely(len > skb->len) ? NULL : __skb_pull(skb, len);
1312 extern unsigned char *__pskb_pull_tail(struct sk_buff *skb, int delta);
1314 static inline unsigned char *__pskb_pull(struct sk_buff *skb, unsigned int len)
1316 if (len > skb_headlen(skb) &&
1317 !__pskb_pull_tail(skb, len - skb_headlen(skb)))
1320 return skb->data += len;
1323 static inline unsigned char *pskb_pull(struct sk_buff *skb, unsigned int len)
1325 return unlikely(len > skb->len) ? NULL : __pskb_pull(skb, len);
1328 static inline int pskb_may_pull(struct sk_buff *skb, unsigned int len)
1330 if (likely(len <= skb_headlen(skb)))
1332 if (unlikely(len > skb->len))
1334 return __pskb_pull_tail(skb, len - skb_headlen(skb)) != NULL;
1338 * skb_headroom - bytes at buffer head
1339 * @skb: buffer to check
1341 * Return the number of bytes of free space at the head of an &sk_buff.
1343 static inline unsigned int skb_headroom(const struct sk_buff *skb)
1345 return skb->data - skb->head;
1349 * skb_tailroom - bytes at buffer end
1350 * @skb: buffer to check
1352 * Return the number of bytes of free space at the tail of an sk_buff
1354 static inline int skb_tailroom(const struct sk_buff *skb)
1356 return skb_is_nonlinear(skb) ? 0 : skb->end - skb->tail;
1360 * skb_reserve - adjust headroom
1361 * @skb: buffer to alter
1362 * @len: bytes to move
1364 * Increase the headroom of an empty &sk_buff by reducing the tail
1365 * room. This is only allowed for an empty buffer.
1367 static inline void skb_reserve(struct sk_buff *skb, int len)
1373 static inline void skb_reset_mac_len(struct sk_buff *skb)
1375 skb->mac_len = skb->network_header - skb->mac_header;
1378 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1379 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
1381 return skb->head + skb->transport_header;
1384 static inline void skb_reset_transport_header(struct sk_buff *skb)
1386 skb->transport_header = skb->data - skb->head;
1389 static inline void skb_set_transport_header(struct sk_buff *skb,
1392 skb_reset_transport_header(skb);
1393 skb->transport_header += offset;
1396 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
1398 return skb->head + skb->network_header;
1401 static inline void skb_reset_network_header(struct sk_buff *skb)
1403 skb->network_header = skb->data - skb->head;
1406 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1408 skb_reset_network_header(skb);
1409 skb->network_header += offset;
1412 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1414 return skb->head + skb->mac_header;
1417 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1419 return skb->mac_header != ~0U;
1422 static inline void skb_reset_mac_header(struct sk_buff *skb)
1424 skb->mac_header = skb->data - skb->head;
1427 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1429 skb_reset_mac_header(skb);
1430 skb->mac_header += offset;
1433 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1435 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
1437 return skb->transport_header;
1440 static inline void skb_reset_transport_header(struct sk_buff *skb)
1442 skb->transport_header = skb->data;
1445 static inline void skb_set_transport_header(struct sk_buff *skb,
1448 skb->transport_header = skb->data + offset;
1451 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
1453 return skb->network_header;
1456 static inline void skb_reset_network_header(struct sk_buff *skb)
1458 skb->network_header = skb->data;
1461 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1463 skb->network_header = skb->data + offset;
1466 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1468 return skb->mac_header;
1471 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1473 return skb->mac_header != NULL;
1476 static inline void skb_reset_mac_header(struct sk_buff *skb)
1478 skb->mac_header = skb->data;
1481 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1483 skb->mac_header = skb->data + offset;
1485 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1487 static inline int skb_checksum_start_offset(const struct sk_buff *skb)
1489 return skb->csum_start - skb_headroom(skb);
1492 static inline int skb_transport_offset(const struct sk_buff *skb)
1494 return skb_transport_header(skb) - skb->data;
1497 static inline u32 skb_network_header_len(const struct sk_buff *skb)
1499 return skb->transport_header - skb->network_header;
1502 static inline int skb_network_offset(const struct sk_buff *skb)
1504 return skb_network_header(skb) - skb->data;
1507 static inline int pskb_network_may_pull(struct sk_buff *skb, unsigned int len)
1509 return pskb_may_pull(skb, skb_network_offset(skb) + len);
1513 * CPUs often take a performance hit when accessing unaligned memory
1514 * locations. The actual performance hit varies, it can be small if the
1515 * hardware handles it or large if we have to take an exception and fix it
1518 * Since an ethernet header is 14 bytes network drivers often end up with
1519 * the IP header at an unaligned offset. The IP header can be aligned by
1520 * shifting the start of the packet by 2 bytes. Drivers should do this
1523 * skb_reserve(skb, NET_IP_ALIGN);
1525 * The downside to this alignment of the IP header is that the DMA is now
1526 * unaligned. On some architectures the cost of an unaligned DMA is high
1527 * and this cost outweighs the gains made by aligning the IP header.
1529 * Since this trade off varies between architectures, we allow NET_IP_ALIGN
1532 #ifndef NET_IP_ALIGN
1533 #define NET_IP_ALIGN 2
1537 * The networking layer reserves some headroom in skb data (via
1538 * dev_alloc_skb). This is used to avoid having to reallocate skb data when
1539 * the header has to grow. In the default case, if the header has to grow
1540 * 32 bytes or less we avoid the reallocation.
1542 * Unfortunately this headroom changes the DMA alignment of the resulting
1543 * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive
1544 * on some architectures. An architecture can override this value,
1545 * perhaps setting it to a cacheline in size (since that will maintain
1546 * cacheline alignment of the DMA). It must be a power of 2.
1548 * Various parts of the networking layer expect at least 32 bytes of
1549 * headroom, you should not reduce this.
1551 * Using max(32, L1_CACHE_BYTES) makes sense (especially with RPS)
1552 * to reduce average number of cache lines per packet.
1553 * get_rps_cpus() for example only access one 64 bytes aligned block :
1554 * NET_IP_ALIGN(2) + ethernet_header(14) + IP_header(20/40) + ports(8)
1557 #define NET_SKB_PAD max(32, L1_CACHE_BYTES)
1560 extern int ___pskb_trim(struct sk_buff *skb, unsigned int len);
1562 static inline void __skb_trim(struct sk_buff *skb, unsigned int len)
1564 if (unlikely(skb_is_nonlinear(skb))) {
1569 skb_set_tail_pointer(skb, len);
1572 extern void skb_trim(struct sk_buff *skb, unsigned int len);
1574 static inline int __pskb_trim(struct sk_buff *skb, unsigned int len)
1577 return ___pskb_trim(skb, len);
1578 __skb_trim(skb, len);
1582 static inline int pskb_trim(struct sk_buff *skb, unsigned int len)
1584 return (len < skb->len) ? __pskb_trim(skb, len) : 0;
1588 * pskb_trim_unique - remove end from a paged unique (not cloned) buffer
1589 * @skb: buffer to alter
1592 * This is identical to pskb_trim except that the caller knows that
1593 * the skb is not cloned so we should never get an error due to out-
1596 static inline void pskb_trim_unique(struct sk_buff *skb, unsigned int len)
1598 int err = pskb_trim(skb, len);
1603 * skb_orphan - orphan a buffer
1604 * @skb: buffer to orphan
1606 * If a buffer currently has an owner then we call the owner's
1607 * destructor function and make the @skb unowned. The buffer continues
1608 * to exist but is no longer charged to its former owner.
1610 static inline void skb_orphan(struct sk_buff *skb)
1612 if (skb->destructor)
1613 skb->destructor(skb);
1614 skb->destructor = NULL;
1619 * __skb_queue_purge - empty a list
1620 * @list: list to empty
1622 * Delete all buffers on an &sk_buff list. Each buffer is removed from
1623 * the list and one reference dropped. This function does not take the
1624 * list lock and the caller must hold the relevant locks to use it.
1626 extern void skb_queue_purge(struct sk_buff_head *list);
1627 static inline void __skb_queue_purge(struct sk_buff_head *list)
1629 struct sk_buff *skb;
1630 while ((skb = __skb_dequeue(list)) != NULL)
1635 * __dev_alloc_skb - allocate an skbuff for receiving
1636 * @length: length to allocate
1637 * @gfp_mask: get_free_pages mask, passed to alloc_skb
1639 * Allocate a new &sk_buff and assign it a usage count of one. The
1640 * buffer has unspecified headroom built in. Users should allocate
1641 * the headroom they think they need without accounting for the
1642 * built in space. The built in space is used for optimisations.
1644 * %NULL is returned if there is no free memory.
1646 static inline struct sk_buff *__dev_alloc_skb(unsigned int length,
1649 struct sk_buff *skb = alloc_skb(length + NET_SKB_PAD, gfp_mask);
1651 skb_reserve(skb, NET_SKB_PAD);
1655 extern struct sk_buff *dev_alloc_skb(unsigned int length);
1657 extern struct sk_buff *__netdev_alloc_skb(struct net_device *dev,
1658 unsigned int length, gfp_t gfp_mask);
1661 * netdev_alloc_skb - allocate an skbuff for rx on a specific device
1662 * @dev: network device to receive on
1663 * @length: length to allocate
1665 * Allocate a new &sk_buff and assign it a usage count of one. The
1666 * buffer has unspecified headroom built in. Users should allocate
1667 * the headroom they think they need without accounting for the
1668 * built in space. The built in space is used for optimisations.
1670 * %NULL is returned if there is no free memory. Although this function
1671 * allocates memory it can be called from an interrupt.
1673 static inline struct sk_buff *netdev_alloc_skb(struct net_device *dev,
1674 unsigned int length)
1676 return __netdev_alloc_skb(dev, length, GFP_ATOMIC);
1679 static inline struct sk_buff *__netdev_alloc_skb_ip_align(struct net_device *dev,
1680 unsigned int length, gfp_t gfp)
1682 struct sk_buff *skb = __netdev_alloc_skb(dev, length + NET_IP_ALIGN, gfp);
1684 if (NET_IP_ALIGN && skb)
1685 skb_reserve(skb, NET_IP_ALIGN);
1689 static inline struct sk_buff *netdev_alloc_skb_ip_align(struct net_device *dev,
1690 unsigned int length)
1692 return __netdev_alloc_skb_ip_align(dev, length, GFP_ATOMIC);
1696 * skb_frag_page - retrieve the page refered to by a paged fragment
1697 * @frag: the paged fragment
1699 * Returns the &struct page associated with @frag.
1701 static inline struct page *skb_frag_page(const skb_frag_t *frag)
1703 return frag->page.p;
1707 * __skb_frag_ref - take an addition reference on a paged fragment.
1708 * @frag: the paged fragment
1710 * Takes an additional reference on the paged fragment @frag.
1712 static inline void __skb_frag_ref(skb_frag_t *frag)
1714 get_page(skb_frag_page(frag));
1718 * skb_frag_ref - take an addition reference on a paged fragment of an skb.
1720 * @f: the fragment offset.
1722 * Takes an additional reference on the @f'th paged fragment of @skb.
1724 static inline void skb_frag_ref(struct sk_buff *skb, int f)
1726 __skb_frag_ref(&skb_shinfo(skb)->frags[f]);
1730 * __skb_frag_unref - release a reference on a paged fragment.
1731 * @frag: the paged fragment
1733 * Releases a reference on the paged fragment @frag.
1735 static inline void __skb_frag_unref(skb_frag_t *frag)
1737 put_page(skb_frag_page(frag));
1741 * skb_frag_unref - release a reference on a paged fragment of an skb.
1743 * @f: the fragment offset
1745 * Releases a reference on the @f'th paged fragment of @skb.
1747 static inline void skb_frag_unref(struct sk_buff *skb, int f)
1749 __skb_frag_unref(&skb_shinfo(skb)->frags[f]);
1753 * skb_frag_address - gets the address of the data contained in a paged fragment
1754 * @frag: the paged fragment buffer
1756 * Returns the address of the data within @frag. The page must already
1759 static inline void *skb_frag_address(const skb_frag_t *frag)
1761 return page_address(skb_frag_page(frag)) + frag->page_offset;
1765 * skb_frag_address_safe - gets the address of the data contained in a paged fragment
1766 * @frag: the paged fragment buffer
1768 * Returns the address of the data within @frag. Checks that the page
1769 * is mapped and returns %NULL otherwise.
1771 static inline void *skb_frag_address_safe(const skb_frag_t *frag)
1773 void *ptr = page_address(skb_frag_page(frag));
1777 return ptr + frag->page_offset;
1781 * __skb_frag_set_page - sets the page contained in a paged fragment
1782 * @frag: the paged fragment
1783 * @page: the page to set
1785 * Sets the fragment @frag to contain @page.
1787 static inline void __skb_frag_set_page(skb_frag_t *frag, struct page *page)
1789 frag->page.p = page;
1793 * skb_frag_set_page - sets the page contained in a paged fragment of an skb
1795 * @f: the fragment offset
1796 * @page: the page to set
1798 * Sets the @f'th fragment of @skb to contain @page.
1800 static inline void skb_frag_set_page(struct sk_buff *skb, int f,
1803 __skb_frag_set_page(&skb_shinfo(skb)->frags[f], page);
1807 * skb_frag_dma_map - maps a paged fragment via the DMA API
1808 * @dev: the device to map the fragment to
1809 * @frag: the paged fragment to map
1810 * @offset: the offset within the fragment (starting at the
1811 * fragment's own offset)
1812 * @size: the number of bytes to map
1813 * @dir: the direction of the mapping (%PCI_DMA_*)
1815 * Maps the page associated with @frag to @device.
1817 static inline dma_addr_t skb_frag_dma_map(struct device *dev,
1818 const skb_frag_t *frag,
1819 size_t offset, size_t size,
1820 enum dma_data_direction dir)
1822 return dma_map_page(dev, skb_frag_page(frag),
1823 frag->page_offset + offset, size, dir);
1826 static inline struct sk_buff *pskb_copy(struct sk_buff *skb,
1829 return __pskb_copy(skb, skb_headroom(skb), gfp_mask);
1833 * skb_clone_writable - is the header of a clone writable
1834 * @skb: buffer to check
1835 * @len: length up to which to write
1837 * Returns true if modifying the header part of the cloned buffer
1838 * does not requires the data to be copied.
1840 static inline int skb_clone_writable(const struct sk_buff *skb, unsigned int len)
1842 return !skb_header_cloned(skb) &&
1843 skb_headroom(skb) + len <= skb->hdr_len;
1846 static inline int __skb_cow(struct sk_buff *skb, unsigned int headroom,
1851 if (headroom < NET_SKB_PAD)
1852 headroom = NET_SKB_PAD;
1853 if (headroom > skb_headroom(skb))
1854 delta = headroom - skb_headroom(skb);
1856 if (delta || cloned)
1857 return pskb_expand_head(skb, ALIGN(delta, NET_SKB_PAD), 0,
1863 * skb_cow - copy header of skb when it is required
1864 * @skb: buffer to cow
1865 * @headroom: needed headroom
1867 * If the skb passed lacks sufficient headroom or its data part
1868 * is shared, data is reallocated. If reallocation fails, an error
1869 * is returned and original skb is not changed.
1871 * The result is skb with writable area skb->head...skb->tail
1872 * and at least @headroom of space at head.
1874 static inline int skb_cow(struct sk_buff *skb, unsigned int headroom)
1876 return __skb_cow(skb, headroom, skb_cloned(skb));
1880 * skb_cow_head - skb_cow but only making the head writable
1881 * @skb: buffer to cow
1882 * @headroom: needed headroom
1884 * This function is identical to skb_cow except that we replace the
1885 * skb_cloned check by skb_header_cloned. It should be used when
1886 * you only need to push on some header and do not need to modify
1889 static inline int skb_cow_head(struct sk_buff *skb, unsigned int headroom)
1891 return __skb_cow(skb, headroom, skb_header_cloned(skb));
1895 * skb_padto - pad an skbuff up to a minimal size
1896 * @skb: buffer to pad
1897 * @len: minimal length
1899 * Pads up a buffer to ensure the trailing bytes exist and are
1900 * blanked. If the buffer already contains sufficient data it
1901 * is untouched. Otherwise it is extended. Returns zero on
1902 * success. The skb is freed on error.
1905 static inline int skb_padto(struct sk_buff *skb, unsigned int len)
1907 unsigned int size = skb->len;
1908 if (likely(size >= len))
1910 return skb_pad(skb, len - size);
1913 static inline int skb_add_data(struct sk_buff *skb,
1914 char __user *from, int copy)
1916 const int off = skb->len;
1918 if (skb->ip_summed == CHECKSUM_NONE) {
1920 __wsum csum = csum_and_copy_from_user(from, skb_put(skb, copy),
1923 skb->csum = csum_block_add(skb->csum, csum, off);
1926 } else if (!copy_from_user(skb_put(skb, copy), from, copy))
1929 __skb_trim(skb, off);
1933 static inline int skb_can_coalesce(struct sk_buff *skb, int i,
1934 const struct page *page, int off)
1937 const struct skb_frag_struct *frag = &skb_shinfo(skb)->frags[i - 1];
1939 return page == skb_frag_page(frag) &&
1940 off == frag->page_offset + skb_frag_size(frag);
1945 static inline int __skb_linearize(struct sk_buff *skb)
1947 return __pskb_pull_tail(skb, skb->data_len) ? 0 : -ENOMEM;
1951 * skb_linearize - convert paged skb to linear one
1952 * @skb: buffer to linarize
1954 * If there is no free memory -ENOMEM is returned, otherwise zero
1955 * is returned and the old skb data released.
1957 static inline int skb_linearize(struct sk_buff *skb)
1959 return skb_is_nonlinear(skb) ? __skb_linearize(skb) : 0;
1963 * skb_linearize_cow - make sure skb is linear and writable
1964 * @skb: buffer to process
1966 * If there is no free memory -ENOMEM is returned, otherwise zero
1967 * is returned and the old skb data released.
1969 static inline int skb_linearize_cow(struct sk_buff *skb)
1971 return skb_is_nonlinear(skb) || skb_cloned(skb) ?
1972 __skb_linearize(skb) : 0;
1976 * skb_postpull_rcsum - update checksum for received skb after pull
1977 * @skb: buffer to update
1978 * @start: start of data before pull
1979 * @len: length of data pulled
1981 * After doing a pull on a received packet, you need to call this to
1982 * update the CHECKSUM_COMPLETE checksum, or set ip_summed to
1983 * CHECKSUM_NONE so that it can be recomputed from scratch.
1986 static inline void skb_postpull_rcsum(struct sk_buff *skb,
1987 const void *start, unsigned int len)
1989 if (skb->ip_summed == CHECKSUM_COMPLETE)
1990 skb->csum = csum_sub(skb->csum, csum_partial(start, len, 0));
1993 unsigned char *skb_pull_rcsum(struct sk_buff *skb, unsigned int len);
1996 * pskb_trim_rcsum - trim received skb and update checksum
1997 * @skb: buffer to trim
2000 * This is exactly the same as pskb_trim except that it ensures the
2001 * checksum of received packets are still valid after the operation.
2004 static inline int pskb_trim_rcsum(struct sk_buff *skb, unsigned int len)
2006 if (likely(len >= skb->len))
2008 if (skb->ip_summed == CHECKSUM_COMPLETE)
2009 skb->ip_summed = CHECKSUM_NONE;
2010 return __pskb_trim(skb, len);
2013 #define skb_queue_walk(queue, skb) \
2014 for (skb = (queue)->next; \
2015 skb != (struct sk_buff *)(queue); \
2018 #define skb_queue_walk_safe(queue, skb, tmp) \
2019 for (skb = (queue)->next, tmp = skb->next; \
2020 skb != (struct sk_buff *)(queue); \
2021 skb = tmp, tmp = skb->next)
2023 #define skb_queue_walk_from(queue, skb) \
2024 for (; skb != (struct sk_buff *)(queue); \
2027 #define skb_queue_walk_from_safe(queue, skb, tmp) \
2028 for (tmp = skb->next; \
2029 skb != (struct sk_buff *)(queue); \
2030 skb = tmp, tmp = skb->next)
2032 #define skb_queue_reverse_walk(queue, skb) \
2033 for (skb = (queue)->prev; \
2034 skb != (struct sk_buff *)(queue); \
2037 #define skb_queue_reverse_walk_safe(queue, skb, tmp) \
2038 for (skb = (queue)->prev, tmp = skb->prev; \
2039 skb != (struct sk_buff *)(queue); \
2040 skb = tmp, tmp = skb->prev)
2042 #define skb_queue_reverse_walk_from_safe(queue, skb, tmp) \
2043 for (tmp = skb->prev; \
2044 skb != (struct sk_buff *)(queue); \
2045 skb = tmp, tmp = skb->prev)
2047 static inline bool skb_has_frag_list(const struct sk_buff *skb)
2049 return skb_shinfo(skb)->frag_list != NULL;
2052 static inline void skb_frag_list_init(struct sk_buff *skb)
2054 skb_shinfo(skb)->frag_list = NULL;
2057 static inline void skb_frag_add_head(struct sk_buff *skb, struct sk_buff *frag)
2059 frag->next = skb_shinfo(skb)->frag_list;
2060 skb_shinfo(skb)->frag_list = frag;
2063 #define skb_walk_frags(skb, iter) \
2064 for (iter = skb_shinfo(skb)->frag_list; iter; iter = iter->next)
2066 extern struct sk_buff *__skb_recv_datagram(struct sock *sk, unsigned flags,
2067 int *peeked, int *off, int *err);
2068 extern struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags,
2069 int noblock, int *err);
2070 extern unsigned int datagram_poll(struct file *file, struct socket *sock,
2071 struct poll_table_struct *wait);
2072 extern int skb_copy_datagram_iovec(const struct sk_buff *from,
2073 int offset, struct iovec *to,
2075 extern int skb_copy_and_csum_datagram_iovec(struct sk_buff *skb,
2078 extern int skb_copy_datagram_from_iovec(struct sk_buff *skb,
2080 const struct iovec *from,
2083 extern int skb_copy_datagram_const_iovec(const struct sk_buff *from,
2085 const struct iovec *to,
2088 extern void skb_free_datagram(struct sock *sk, struct sk_buff *skb);
2089 extern void skb_free_datagram_locked(struct sock *sk,
2090 struct sk_buff *skb);
2091 extern int skb_kill_datagram(struct sock *sk, struct sk_buff *skb,
2092 unsigned int flags);
2093 extern __wsum skb_checksum(const struct sk_buff *skb, int offset,
2094 int len, __wsum csum);
2095 extern int skb_copy_bits(const struct sk_buff *skb, int offset,
2097 extern int skb_store_bits(struct sk_buff *skb, int offset,
2098 const void *from, int len);
2099 extern __wsum skb_copy_and_csum_bits(const struct sk_buff *skb,
2100 int offset, u8 *to, int len,
2102 extern int skb_splice_bits(struct sk_buff *skb,
2103 unsigned int offset,
2104 struct pipe_inode_info *pipe,
2106 unsigned int flags);
2107 extern void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to);
2108 extern void skb_split(struct sk_buff *skb,
2109 struct sk_buff *skb1, const u32 len);
2110 extern int skb_shift(struct sk_buff *tgt, struct sk_buff *skb,
2113 extern struct sk_buff *skb_segment(struct sk_buff *skb,
2114 netdev_features_t features);
2116 static inline void *skb_header_pointer(const struct sk_buff *skb, int offset,
2117 int len, void *buffer)
2119 int hlen = skb_headlen(skb);
2121 if (hlen - offset >= len)
2122 return skb->data + offset;
2124 if (skb_copy_bits(skb, offset, buffer, len) < 0)
2130 static inline void skb_copy_from_linear_data(const struct sk_buff *skb,
2132 const unsigned int len)
2134 memcpy(to, skb->data, len);
2137 static inline void skb_copy_from_linear_data_offset(const struct sk_buff *skb,
2138 const int offset, void *to,
2139 const unsigned int len)
2141 memcpy(to, skb->data + offset, len);
2144 static inline void skb_copy_to_linear_data(struct sk_buff *skb,
2146 const unsigned int len)
2148 memcpy(skb->data, from, len);
2151 static inline void skb_copy_to_linear_data_offset(struct sk_buff *skb,
2154 const unsigned int len)
2156 memcpy(skb->data + offset, from, len);
2159 extern void skb_init(void);
2161 static inline ktime_t skb_get_ktime(const struct sk_buff *skb)
2167 * skb_get_timestamp - get timestamp from a skb
2168 * @skb: skb to get stamp from
2169 * @stamp: pointer to struct timeval to store stamp in
2171 * Timestamps are stored in the skb as offsets to a base timestamp.
2172 * This function converts the offset back to a struct timeval and stores
2175 static inline void skb_get_timestamp(const struct sk_buff *skb,
2176 struct timeval *stamp)
2178 *stamp = ktime_to_timeval(skb->tstamp);
2181 static inline void skb_get_timestampns(const struct sk_buff *skb,
2182 struct timespec *stamp)
2184 *stamp = ktime_to_timespec(skb->tstamp);
2187 static inline void __net_timestamp(struct sk_buff *skb)
2189 skb->tstamp = ktime_get_real();
2192 static inline ktime_t net_timedelta(ktime_t t)
2194 return ktime_sub(ktime_get_real(), t);
2197 static inline ktime_t net_invalid_timestamp(void)
2199 return ktime_set(0, 0);
2202 extern void skb_timestamping_init(void);
2204 #ifdef CONFIG_NETWORK_PHY_TIMESTAMPING
2206 extern void skb_clone_tx_timestamp(struct sk_buff *skb);
2207 extern bool skb_defer_rx_timestamp(struct sk_buff *skb);
2209 #else /* CONFIG_NETWORK_PHY_TIMESTAMPING */
2211 static inline void skb_clone_tx_timestamp(struct sk_buff *skb)
2215 static inline bool skb_defer_rx_timestamp(struct sk_buff *skb)
2220 #endif /* !CONFIG_NETWORK_PHY_TIMESTAMPING */
2223 * skb_complete_tx_timestamp() - deliver cloned skb with tx timestamps
2225 * PHY drivers may accept clones of transmitted packets for
2226 * timestamping via their phy_driver.txtstamp method. These drivers
2227 * must call this function to return the skb back to the stack, with
2228 * or without a timestamp.
2230 * @skb: clone of the the original outgoing packet
2231 * @hwtstamps: hardware time stamps, may be NULL if not available
2234 void skb_complete_tx_timestamp(struct sk_buff *skb,
2235 struct skb_shared_hwtstamps *hwtstamps);
2238 * skb_tstamp_tx - queue clone of skb with send time stamps
2239 * @orig_skb: the original outgoing packet
2240 * @hwtstamps: hardware time stamps, may be NULL if not available
2242 * If the skb has a socket associated, then this function clones the
2243 * skb (thus sharing the actual data and optional structures), stores
2244 * the optional hardware time stamping information (if non NULL) or
2245 * generates a software time stamp (otherwise), then queues the clone
2246 * to the error queue of the socket. Errors are silently ignored.
2248 extern void skb_tstamp_tx(struct sk_buff *orig_skb,
2249 struct skb_shared_hwtstamps *hwtstamps);
2251 static inline void sw_tx_timestamp(struct sk_buff *skb)
2253 if (skb_shinfo(skb)->tx_flags & SKBTX_SW_TSTAMP &&
2254 !(skb_shinfo(skb)->tx_flags & SKBTX_IN_PROGRESS))
2255 skb_tstamp_tx(skb, NULL);
2259 * skb_tx_timestamp() - Driver hook for transmit timestamping
2261 * Ethernet MAC Drivers should call this function in their hard_xmit()
2262 * function immediately before giving the sk_buff to the MAC hardware.
2264 * @skb: A socket buffer.
2266 static inline void skb_tx_timestamp(struct sk_buff *skb)
2268 skb_clone_tx_timestamp(skb);
2269 sw_tx_timestamp(skb);
2273 * skb_complete_wifi_ack - deliver skb with wifi status
2275 * @skb: the original outgoing packet
2276 * @acked: ack status
2279 void skb_complete_wifi_ack(struct sk_buff *skb, bool acked);
2281 extern __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len);
2282 extern __sum16 __skb_checksum_complete(struct sk_buff *skb);
2284 static inline int skb_csum_unnecessary(const struct sk_buff *skb)
2286 return skb->ip_summed & CHECKSUM_UNNECESSARY;
2290 * skb_checksum_complete - Calculate checksum of an entire packet
2291 * @skb: packet to process
2293 * This function calculates the checksum over the entire packet plus
2294 * the value of skb->csum. The latter can be used to supply the
2295 * checksum of a pseudo header as used by TCP/UDP. It returns the
2298 * For protocols that contain complete checksums such as ICMP/TCP/UDP,
2299 * this function can be used to verify that checksum on received
2300 * packets. In that case the function should return zero if the
2301 * checksum is correct. In particular, this function will return zero
2302 * if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the
2303 * hardware has already verified the correctness of the checksum.
2305 static inline __sum16 skb_checksum_complete(struct sk_buff *skb)
2307 return skb_csum_unnecessary(skb) ?
2308 0 : __skb_checksum_complete(skb);
2311 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2312 extern void nf_conntrack_destroy(struct nf_conntrack *nfct);
2313 static inline void nf_conntrack_put(struct nf_conntrack *nfct)
2315 if (nfct && atomic_dec_and_test(&nfct->use))
2316 nf_conntrack_destroy(nfct);
2318 static inline void nf_conntrack_get(struct nf_conntrack *nfct)
2321 atomic_inc(&nfct->use);
2324 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2325 static inline void nf_conntrack_get_reasm(struct sk_buff *skb)
2328 atomic_inc(&skb->users);
2330 static inline void nf_conntrack_put_reasm(struct sk_buff *skb)
2336 #ifdef CONFIG_BRIDGE_NETFILTER
2337 static inline void nf_bridge_put(struct nf_bridge_info *nf_bridge)
2339 if (nf_bridge && atomic_dec_and_test(&nf_bridge->use))
2342 static inline void nf_bridge_get(struct nf_bridge_info *nf_bridge)
2345 atomic_inc(&nf_bridge->use);
2347 #endif /* CONFIG_BRIDGE_NETFILTER */
2348 static inline void nf_reset(struct sk_buff *skb)
2350 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2351 nf_conntrack_put(skb->nfct);
2354 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2355 nf_conntrack_put_reasm(skb->nfct_reasm);
2356 skb->nfct_reasm = NULL;
2358 #ifdef CONFIG_BRIDGE_NETFILTER
2359 nf_bridge_put(skb->nf_bridge);
2360 skb->nf_bridge = NULL;
2364 /* Note: This doesn't put any conntrack and bridge info in dst. */
2365 static inline void __nf_copy(struct sk_buff *dst, const struct sk_buff *src)
2367 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2368 dst->nfct = src->nfct;
2369 nf_conntrack_get(src->nfct);
2370 dst->nfctinfo = src->nfctinfo;
2372 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2373 dst->nfct_reasm = src->nfct_reasm;
2374 nf_conntrack_get_reasm(src->nfct_reasm);
2376 #ifdef CONFIG_BRIDGE_NETFILTER
2377 dst->nf_bridge = src->nf_bridge;
2378 nf_bridge_get(src->nf_bridge);
2382 static inline void nf_copy(struct sk_buff *dst, const struct sk_buff *src)
2384 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2385 nf_conntrack_put(dst->nfct);
2387 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2388 nf_conntrack_put_reasm(dst->nfct_reasm);
2390 #ifdef CONFIG_BRIDGE_NETFILTER
2391 nf_bridge_put(dst->nf_bridge);
2393 __nf_copy(dst, src);
2396 #ifdef CONFIG_NETWORK_SECMARK
2397 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
2399 to->secmark = from->secmark;
2402 static inline void skb_init_secmark(struct sk_buff *skb)
2407 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
2410 static inline void skb_init_secmark(struct sk_buff *skb)
2414 static inline void skb_set_queue_mapping(struct sk_buff *skb, u16 queue_mapping)
2416 skb->queue_mapping = queue_mapping;
2419 static inline u16 skb_get_queue_mapping(const struct sk_buff *skb)
2421 return skb->queue_mapping;
2424 static inline void skb_copy_queue_mapping(struct sk_buff *to, const struct sk_buff *from)
2426 to->queue_mapping = from->queue_mapping;
2429 static inline void skb_record_rx_queue(struct sk_buff *skb, u16 rx_queue)
2431 skb->queue_mapping = rx_queue + 1;
2434 static inline u16 skb_get_rx_queue(const struct sk_buff *skb)
2436 return skb->queue_mapping - 1;
2439 static inline bool skb_rx_queue_recorded(const struct sk_buff *skb)
2441 return skb->queue_mapping != 0;
2444 extern u16 __skb_tx_hash(const struct net_device *dev,
2445 const struct sk_buff *skb,
2446 unsigned int num_tx_queues);
2449 static inline struct sec_path *skb_sec_path(struct sk_buff *skb)
2454 static inline struct sec_path *skb_sec_path(struct sk_buff *skb)
2460 static inline int skb_is_gso(const struct sk_buff *skb)
2462 return skb_shinfo(skb)->gso_size;
2465 static inline int skb_is_gso_v6(const struct sk_buff *skb)
2467 return skb_shinfo(skb)->gso_type & SKB_GSO_TCPV6;
2470 extern void __skb_warn_lro_forwarding(const struct sk_buff *skb);
2472 static inline bool skb_warn_if_lro(const struct sk_buff *skb)
2474 /* LRO sets gso_size but not gso_type, whereas if GSO is really
2475 * wanted then gso_type will be set. */
2476 const struct skb_shared_info *shinfo = skb_shinfo(skb);
2478 if (skb_is_nonlinear(skb) && shinfo->gso_size != 0 &&
2479 unlikely(shinfo->gso_type == 0)) {
2480 __skb_warn_lro_forwarding(skb);
2486 static inline void skb_forward_csum(struct sk_buff *skb)
2488 /* Unfortunately we don't support this one. Any brave souls? */
2489 if (skb->ip_summed == CHECKSUM_COMPLETE)
2490 skb->ip_summed = CHECKSUM_NONE;
2494 * skb_checksum_none_assert - make sure skb ip_summed is CHECKSUM_NONE
2495 * @skb: skb to check
2497 * fresh skbs have their ip_summed set to CHECKSUM_NONE.
2498 * Instead of forcing ip_summed to CHECKSUM_NONE, we can
2499 * use this helper, to document places where we make this assertion.
2501 static inline void skb_checksum_none_assert(const struct sk_buff *skb)
2504 BUG_ON(skb->ip_summed != CHECKSUM_NONE);
2508 bool skb_partial_csum_set(struct sk_buff *skb, u16 start, u16 off);
2510 static inline bool skb_is_recycleable(const struct sk_buff *skb, int skb_size)
2512 if (irqs_disabled())
2515 if (skb_shinfo(skb)->tx_flags & SKBTX_DEV_ZEROCOPY)
2518 if (skb_is_nonlinear(skb) || skb->fclone != SKB_FCLONE_UNAVAILABLE)
2521 skb_size = SKB_DATA_ALIGN(skb_size + NET_SKB_PAD);
2522 if (skb_end_pointer(skb) - skb->head < skb_size)
2525 if (skb_shared(skb) || skb_cloned(skb))
2530 #endif /* __KERNEL__ */
2531 #endif /* _LINUX_SKBUFF_H */