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>
34 /* Don't change this without changing skb_csum_unnecessary! */
35 #define CHECKSUM_NONE 0
36 #define CHECKSUM_UNNECESSARY 1
37 #define CHECKSUM_COMPLETE 2
38 #define CHECKSUM_PARTIAL 3
40 #define SKB_DATA_ALIGN(X) (((X) + (SMP_CACHE_BYTES - 1)) & \
41 ~(SMP_CACHE_BYTES - 1))
42 #define SKB_WITH_OVERHEAD(X) \
43 ((X) - SKB_DATA_ALIGN(sizeof(struct skb_shared_info)))
44 #define SKB_MAX_ORDER(X, ORDER) \
45 SKB_WITH_OVERHEAD((PAGE_SIZE << (ORDER)) - (X))
46 #define SKB_MAX_HEAD(X) (SKB_MAX_ORDER((X), 0))
47 #define SKB_MAX_ALLOC (SKB_MAX_ORDER(0, 2))
49 /* return minimum truesize of one skb containing X bytes of data */
50 #define SKB_TRUESIZE(X) ((X) + \
51 SKB_DATA_ALIGN(sizeof(struct sk_buff)) + \
52 SKB_DATA_ALIGN(sizeof(struct skb_shared_info)))
54 /* A. Checksumming of received packets by device.
56 * NONE: device failed to checksum this packet.
57 * skb->csum is undefined.
59 * UNNECESSARY: device parsed packet and wouldbe verified checksum.
60 * skb->csum is undefined.
61 * It is bad option, but, unfortunately, many of vendors do this.
62 * Apparently with secret goal to sell you new device, when you
63 * will add new protocol to your host. F.e. IPv6. 8)
65 * COMPLETE: the most generic way. Device supplied checksum of _all_
66 * the packet as seen by netif_rx in skb->csum.
67 * NOTE: Even if device supports only some protocols, but
68 * is able to produce some skb->csum, it MUST use COMPLETE,
71 * PARTIAL: identical to the case for output below. This may occur
72 * on a packet received directly from another Linux OS, e.g.,
73 * a virtualised Linux kernel on the same host. The packet can
74 * be treated in the same way as UNNECESSARY except that on
75 * output (i.e., forwarding) the checksum must be filled in
76 * by the OS or the hardware.
78 * B. Checksumming on output.
80 * NONE: skb is checksummed by protocol or csum is not required.
82 * PARTIAL: device is required to csum packet as seen by hard_start_xmit
83 * from skb->csum_start to the end and to record the checksum
84 * at skb->csum_start + skb->csum_offset.
86 * Device must show its capabilities in dev->features, set
87 * at device setup time.
88 * NETIF_F_HW_CSUM - it is clever device, it is able to checksum
90 * NETIF_F_NO_CSUM - loopback or reliable single hop media.
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. Since
132 * GRO uses frags we allocate at least 16 regardless of page size.
134 #if (65536/PAGE_SIZE + 2) < 16
135 #define MAX_SKB_FRAGS 16UL
137 #define MAX_SKB_FRAGS (65536/PAGE_SIZE + 2)
140 typedef struct skb_frag_struct skb_frag_t;
142 struct skb_frag_struct {
146 #if (BITS_PER_LONG > 32) || (PAGE_SIZE >= 65536)
155 static inline unsigned int skb_frag_size(const skb_frag_t *frag)
160 static inline void skb_frag_size_set(skb_frag_t *frag, unsigned int size)
165 static inline void skb_frag_size_add(skb_frag_t *frag, int delta)
170 static inline void skb_frag_size_sub(skb_frag_t *frag, int delta)
175 #define HAVE_HW_TIME_STAMP
178 * struct skb_shared_hwtstamps - hardware time stamps
179 * @hwtstamp: hardware time stamp transformed into duration
180 * since arbitrary point in time
181 * @syststamp: hwtstamp transformed to system time base
183 * Software time stamps generated by ktime_get_real() are stored in
184 * skb->tstamp. The relation between the different kinds of time
185 * stamps is as follows:
187 * syststamp and tstamp can be compared against each other in
188 * arbitrary combinations. The accuracy of a
189 * syststamp/tstamp/"syststamp from other device" comparison is
190 * limited by the accuracy of the transformation into system time
191 * base. This depends on the device driver and its underlying
194 * hwtstamps can only be compared against other hwtstamps from
197 * This structure is attached to packets as part of the
198 * &skb_shared_info. Use skb_hwtstamps() to get a pointer.
200 struct skb_shared_hwtstamps {
205 /* Definitions for tx_flags in struct skb_shared_info */
207 /* generate hardware time stamp */
208 SKBTX_HW_TSTAMP = 1 << 0,
210 /* generate software time stamp */
211 SKBTX_SW_TSTAMP = 1 << 1,
213 /* device driver is going to provide hardware time stamp */
214 SKBTX_IN_PROGRESS = 1 << 2,
216 /* device driver supports TX zero-copy buffers */
217 SKBTX_DEV_ZEROCOPY = 1 << 3,
221 * The callback notifies userspace to release buffers when skb DMA is done in
222 * lower device, the skb last reference should be 0 when calling this.
223 * The desc is used to track userspace buffer index.
226 void (*callback)(void *);
231 /* This data is invariant across clones and lives at
232 * the end of the header data, ie. at skb->end.
234 struct skb_shared_info {
235 unsigned short nr_frags;
236 unsigned short gso_size;
237 /* Warning: this field is not always filled in (UFO)! */
238 unsigned short gso_segs;
239 unsigned short gso_type;
242 struct sk_buff *frag_list;
243 struct skb_shared_hwtstamps hwtstamps;
246 * Warning : all fields before dataref are cleared in __alloc_skb()
250 /* Intermediate layers must ensure that destructor_arg
251 * remains valid until skb destructor */
252 void * destructor_arg;
254 /* must be last field, see pskb_expand_head() */
255 skb_frag_t frags[MAX_SKB_FRAGS];
258 /* We divide dataref into two halves. The higher 16 bits hold references
259 * to the payload part of skb->data. The lower 16 bits hold references to
260 * the entire skb->data. A clone of a headerless skb holds the length of
261 * the header in skb->hdr_len.
263 * All users must obey the rule that the skb->data reference count must be
264 * greater than or equal to the payload reference count.
266 * Holding a reference to the payload part means that the user does not
267 * care about modifications to the header part of skb->data.
269 #define SKB_DATAREF_SHIFT 16
270 #define SKB_DATAREF_MASK ((1 << SKB_DATAREF_SHIFT) - 1)
274 SKB_FCLONE_UNAVAILABLE,
280 SKB_GSO_TCPV4 = 1 << 0,
281 SKB_GSO_UDP = 1 << 1,
283 /* This indicates the skb is from an untrusted source. */
284 SKB_GSO_DODGY = 1 << 2,
286 /* This indicates the tcp segment has CWR set. */
287 SKB_GSO_TCP_ECN = 1 << 3,
289 SKB_GSO_TCPV6 = 1 << 4,
291 SKB_GSO_FCOE = 1 << 5,
294 #if BITS_PER_LONG > 32
295 #define NET_SKBUFF_DATA_USES_OFFSET 1
298 #ifdef NET_SKBUFF_DATA_USES_OFFSET
299 typedef unsigned int sk_buff_data_t;
301 typedef unsigned char *sk_buff_data_t;
304 #if defined(CONFIG_NF_DEFRAG_IPV4) || defined(CONFIG_NF_DEFRAG_IPV4_MODULE) || \
305 defined(CONFIG_NF_DEFRAG_IPV6) || defined(CONFIG_NF_DEFRAG_IPV6_MODULE)
306 #define NET_SKBUFF_NF_DEFRAG_NEEDED 1
310 * struct sk_buff - socket buffer
311 * @next: Next buffer in list
312 * @prev: Previous buffer in list
313 * @tstamp: Time we arrived
314 * @sk: Socket we are owned by
315 * @dev: Device we arrived on/are leaving by
316 * @cb: Control buffer. Free for use by every layer. Put private vars here
317 * @_skb_refdst: destination entry (with norefcount bit)
318 * @sp: the security path, used for xfrm
319 * @len: Length of actual data
320 * @data_len: Data length
321 * @mac_len: Length of link layer header
322 * @hdr_len: writable header length of cloned skb
323 * @csum: Checksum (must include start/offset pair)
324 * @csum_start: Offset from skb->head where checksumming should start
325 * @csum_offset: Offset from csum_start where checksum should be stored
326 * @priority: Packet queueing priority
327 * @local_df: allow local fragmentation
328 * @cloned: Head may be cloned (check refcnt to be sure)
329 * @ip_summed: Driver fed us an IP checksum
330 * @nohdr: Payload reference only, must not modify header
331 * @nfctinfo: Relationship of this skb to the connection
332 * @pkt_type: Packet class
333 * @fclone: skbuff clone status
334 * @ipvs_property: skbuff is owned by ipvs
335 * @peeked: this packet has been seen already, so stats have been
336 * done for it, don't do them again
337 * @nf_trace: netfilter packet trace flag
338 * @protocol: Packet protocol from driver
339 * @destructor: Destruct function
340 * @nfct: Associated connection, if any
341 * @nfct_reasm: netfilter conntrack re-assembly pointer
342 * @nf_bridge: Saved data about a bridged frame - see br_netfilter.c
343 * @skb_iif: ifindex of device we arrived on
344 * @tc_index: Traffic control index
345 * @tc_verd: traffic control verdict
346 * @rxhash: the packet hash computed on receive
347 * @queue_mapping: Queue mapping for multiqueue devices
348 * @ndisc_nodetype: router type (from link layer)
349 * @ooo_okay: allow the mapping of a socket to a queue to be changed
350 * @l4_rxhash: indicate rxhash is a canonical 4-tuple hash over transport
352 * @dma_cookie: a cookie to one of several possible DMA operations
353 * done by skb DMA functions
354 * @secmark: security marking
355 * @mark: Generic packet mark
356 * @dropcount: total number of sk_receive_queue overflows
357 * @vlan_tci: vlan tag control information
358 * @transport_header: Transport layer header
359 * @network_header: Network layer header
360 * @mac_header: Link layer header
361 * @tail: Tail pointer
363 * @head: Head of buffer
364 * @data: Data head pointer
365 * @truesize: Buffer size
366 * @users: User count - see {datagram,tcp}.c
370 /* These two members must be first. */
371 struct sk_buff *next;
372 struct sk_buff *prev;
377 struct net_device *dev;
380 * This is the control buffer. It is free to use for every
381 * layer. Please put your private variables there. If you
382 * want to keep them across layers you have to do a skb_clone()
383 * first. This is owned by whoever has the skb queued ATM.
385 char cb[48] __aligned(8);
387 unsigned long _skb_refdst;
403 kmemcheck_bitfield_begin(flags1);
414 kmemcheck_bitfield_end(flags1);
417 void (*destructor)(struct sk_buff *skb);
418 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
419 struct nf_conntrack *nfct;
421 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
422 struct sk_buff *nfct_reasm;
424 #ifdef CONFIG_BRIDGE_NETFILTER
425 struct nf_bridge_info *nf_bridge;
429 #ifdef CONFIG_NET_SCHED
430 __u16 tc_index; /* traffic control index */
431 #ifdef CONFIG_NET_CLS_ACT
432 __u16 tc_verd; /* traffic control verdict */
439 kmemcheck_bitfield_begin(flags2);
440 #ifdef CONFIG_IPV6_NDISC_NODETYPE
441 __u8 ndisc_nodetype:2;
445 kmemcheck_bitfield_end(flags2);
449 #ifdef CONFIG_NET_DMA
450 dma_cookie_t dma_cookie;
452 #ifdef CONFIG_NETWORK_SECMARK
458 __u32 reserved_tailroom;
463 sk_buff_data_t transport_header;
464 sk_buff_data_t network_header;
465 sk_buff_data_t mac_header;
466 /* These elements must be at the end, see alloc_skb() for details. */
471 unsigned int truesize;
477 * Handling routines are only of interest to the kernel
479 #include <linux/slab.h>
481 #include <asm/system.h>
484 * skb might have a dst pointer attached, refcounted or not.
485 * _skb_refdst low order bit is set if refcount was _not_ taken
487 #define SKB_DST_NOREF 1UL
488 #define SKB_DST_PTRMASK ~(SKB_DST_NOREF)
491 * skb_dst - returns skb dst_entry
494 * Returns skb dst_entry, regardless of reference taken or not.
496 static inline struct dst_entry *skb_dst(const struct sk_buff *skb)
498 /* If refdst was not refcounted, check we still are in a
499 * rcu_read_lock section
501 WARN_ON((skb->_skb_refdst & SKB_DST_NOREF) &&
502 !rcu_read_lock_held() &&
503 !rcu_read_lock_bh_held());
504 return (struct dst_entry *)(skb->_skb_refdst & SKB_DST_PTRMASK);
508 * skb_dst_set - sets skb dst
512 * Sets skb dst, assuming a reference was taken on dst and should
513 * be released by skb_dst_drop()
515 static inline void skb_dst_set(struct sk_buff *skb, struct dst_entry *dst)
517 skb->_skb_refdst = (unsigned long)dst;
520 extern void skb_dst_set_noref(struct sk_buff *skb, struct dst_entry *dst);
523 * skb_dst_is_noref - Test if skb dst isn't refcounted
526 static inline bool skb_dst_is_noref(const struct sk_buff *skb)
528 return (skb->_skb_refdst & SKB_DST_NOREF) && skb_dst(skb);
531 static inline struct rtable *skb_rtable(const struct sk_buff *skb)
533 return (struct rtable *)skb_dst(skb);
536 extern void kfree_skb(struct sk_buff *skb);
537 extern void consume_skb(struct sk_buff *skb);
538 extern void __kfree_skb(struct sk_buff *skb);
539 extern struct sk_buff *__alloc_skb(unsigned int size,
540 gfp_t priority, int fclone, int node);
541 static inline struct sk_buff *alloc_skb(unsigned int size,
544 return __alloc_skb(size, priority, 0, NUMA_NO_NODE);
547 static inline struct sk_buff *alloc_skb_fclone(unsigned int size,
550 return __alloc_skb(size, priority, 1, NUMA_NO_NODE);
553 extern void skb_recycle(struct sk_buff *skb);
554 extern bool skb_recycle_check(struct sk_buff *skb, int skb_size);
556 extern struct sk_buff *skb_morph(struct sk_buff *dst, struct sk_buff *src);
557 extern int skb_copy_ubufs(struct sk_buff *skb, gfp_t gfp_mask);
558 extern struct sk_buff *skb_clone(struct sk_buff *skb,
560 extern struct sk_buff *skb_copy(const struct sk_buff *skb,
562 extern struct sk_buff *pskb_copy(struct sk_buff *skb,
564 extern int pskb_expand_head(struct sk_buff *skb,
565 int nhead, int ntail,
567 extern struct sk_buff *skb_realloc_headroom(struct sk_buff *skb,
568 unsigned int headroom);
569 extern struct sk_buff *skb_copy_expand(const struct sk_buff *skb,
570 int newheadroom, int newtailroom,
572 extern int skb_to_sgvec(struct sk_buff *skb,
573 struct scatterlist *sg, int offset,
575 extern int skb_cow_data(struct sk_buff *skb, int tailbits,
576 struct sk_buff **trailer);
577 extern int skb_pad(struct sk_buff *skb, int pad);
578 #define dev_kfree_skb(a) consume_skb(a)
580 extern int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb,
581 int getfrag(void *from, char *to, int offset,
582 int len,int odd, struct sk_buff *skb),
583 void *from, int length);
585 struct skb_seq_state {
589 __u32 stepped_offset;
590 struct sk_buff *root_skb;
591 struct sk_buff *cur_skb;
595 extern void skb_prepare_seq_read(struct sk_buff *skb,
596 unsigned int from, unsigned int to,
597 struct skb_seq_state *st);
598 extern unsigned int skb_seq_read(unsigned int consumed, const u8 **data,
599 struct skb_seq_state *st);
600 extern void skb_abort_seq_read(struct skb_seq_state *st);
602 extern unsigned int skb_find_text(struct sk_buff *skb, unsigned int from,
603 unsigned int to, struct ts_config *config,
604 struct ts_state *state);
606 extern void __skb_get_rxhash(struct sk_buff *skb);
607 static inline __u32 skb_get_rxhash(struct sk_buff *skb)
610 __skb_get_rxhash(skb);
615 #ifdef NET_SKBUFF_DATA_USES_OFFSET
616 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
618 return skb->head + skb->end;
621 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
628 #define skb_shinfo(SKB) ((struct skb_shared_info *)(skb_end_pointer(SKB)))
630 static inline struct skb_shared_hwtstamps *skb_hwtstamps(struct sk_buff *skb)
632 return &skb_shinfo(skb)->hwtstamps;
636 * skb_queue_empty - check if a queue is empty
639 * Returns true if the queue is empty, false otherwise.
641 static inline int skb_queue_empty(const struct sk_buff_head *list)
643 return list->next == (struct sk_buff *)list;
647 * skb_queue_is_last - check if skb is the last entry in the queue
651 * Returns true if @skb is the last buffer on the list.
653 static inline bool skb_queue_is_last(const struct sk_buff_head *list,
654 const struct sk_buff *skb)
656 return skb->next == (struct sk_buff *)list;
660 * skb_queue_is_first - check if skb is the first entry in the queue
664 * Returns true if @skb is the first buffer on the list.
666 static inline bool skb_queue_is_first(const struct sk_buff_head *list,
667 const struct sk_buff *skb)
669 return skb->prev == (struct sk_buff *)list;
673 * skb_queue_next - return the next packet in the queue
675 * @skb: current buffer
677 * Return the next packet in @list after @skb. It is only valid to
678 * call this if skb_queue_is_last() evaluates to false.
680 static inline struct sk_buff *skb_queue_next(const struct sk_buff_head *list,
681 const struct sk_buff *skb)
683 /* This BUG_ON may seem severe, but if we just return then we
684 * are going to dereference garbage.
686 BUG_ON(skb_queue_is_last(list, skb));
691 * skb_queue_prev - return the prev packet in the queue
693 * @skb: current buffer
695 * Return the prev packet in @list before @skb. It is only valid to
696 * call this if skb_queue_is_first() evaluates to false.
698 static inline struct sk_buff *skb_queue_prev(const struct sk_buff_head *list,
699 const struct sk_buff *skb)
701 /* This BUG_ON may seem severe, but if we just return then we
702 * are going to dereference garbage.
704 BUG_ON(skb_queue_is_first(list, skb));
709 * skb_get - reference buffer
710 * @skb: buffer to reference
712 * Makes another reference to a socket buffer and returns a pointer
715 static inline struct sk_buff *skb_get(struct sk_buff *skb)
717 atomic_inc(&skb->users);
722 * If users == 1, we are the only owner and are can avoid redundant
727 * skb_cloned - is the buffer a clone
728 * @skb: buffer to check
730 * Returns true if the buffer was generated with skb_clone() and is
731 * one of multiple shared copies of the buffer. Cloned buffers are
732 * shared data so must not be written to under normal circumstances.
734 static inline int skb_cloned(const struct sk_buff *skb)
736 return skb->cloned &&
737 (atomic_read(&skb_shinfo(skb)->dataref) & SKB_DATAREF_MASK) != 1;
741 * skb_header_cloned - is the header a clone
742 * @skb: buffer to check
744 * Returns true if modifying the header part of the buffer requires
745 * the data to be copied.
747 static inline int skb_header_cloned(const struct sk_buff *skb)
754 dataref = atomic_read(&skb_shinfo(skb)->dataref);
755 dataref = (dataref & SKB_DATAREF_MASK) - (dataref >> SKB_DATAREF_SHIFT);
760 * skb_header_release - release reference to header
761 * @skb: buffer to operate on
763 * Drop a reference to the header part of the buffer. This is done
764 * by acquiring a payload reference. You must not read from the header
765 * part of skb->data after this.
767 static inline void skb_header_release(struct sk_buff *skb)
771 atomic_add(1 << SKB_DATAREF_SHIFT, &skb_shinfo(skb)->dataref);
775 * skb_shared - is the buffer shared
776 * @skb: buffer to check
778 * Returns true if more than one person has a reference to this
781 static inline int skb_shared(const struct sk_buff *skb)
783 return atomic_read(&skb->users) != 1;
787 * skb_share_check - check if buffer is shared and if so clone it
788 * @skb: buffer to check
789 * @pri: priority for memory allocation
791 * If the buffer is shared the buffer is cloned and the old copy
792 * drops a reference. A new clone with a single reference is returned.
793 * If the buffer is not shared the original buffer is returned. When
794 * being called from interrupt status or with spinlocks held pri must
797 * NULL is returned on a memory allocation failure.
799 static inline struct sk_buff *skb_share_check(struct sk_buff *skb,
802 might_sleep_if(pri & __GFP_WAIT);
803 if (skb_shared(skb)) {
804 struct sk_buff *nskb = skb_clone(skb, pri);
812 * Copy shared buffers into a new sk_buff. We effectively do COW on
813 * packets to handle cases where we have a local reader and forward
814 * and a couple of other messy ones. The normal one is tcpdumping
815 * a packet thats being forwarded.
819 * skb_unshare - make a copy of a shared buffer
820 * @skb: buffer to check
821 * @pri: priority for memory allocation
823 * If the socket buffer is a clone then this function creates a new
824 * copy of the data, drops a reference count on the old copy and returns
825 * the new copy with the reference count at 1. If the buffer is not a clone
826 * the original buffer is returned. When called with a spinlock held or
827 * from interrupt state @pri must be %GFP_ATOMIC
829 * %NULL is returned on a memory allocation failure.
831 static inline struct sk_buff *skb_unshare(struct sk_buff *skb,
834 might_sleep_if(pri & __GFP_WAIT);
835 if (skb_cloned(skb)) {
836 struct sk_buff *nskb = skb_copy(skb, pri);
837 kfree_skb(skb); /* Free our shared copy */
844 * skb_peek - peek at the head of an &sk_buff_head
845 * @list_: list to peek at
847 * Peek an &sk_buff. Unlike most other operations you _MUST_
848 * be careful with this one. A peek leaves the buffer on the
849 * list and someone else may run off with it. You must hold
850 * the appropriate locks or have a private queue to do this.
852 * Returns %NULL for an empty list or a pointer to the head element.
853 * The reference count is not incremented and the reference is therefore
854 * volatile. Use with caution.
856 static inline struct sk_buff *skb_peek(const struct sk_buff_head *list_)
858 struct sk_buff *list = ((const struct sk_buff *)list_)->next;
859 if (list == (struct sk_buff *)list_)
865 * skb_peek_tail - peek at the tail of an &sk_buff_head
866 * @list_: list to peek at
868 * Peek an &sk_buff. Unlike most other operations you _MUST_
869 * be careful with this one. A peek leaves the buffer on the
870 * list and someone else may run off with it. You must hold
871 * the appropriate locks or have a private queue to do this.
873 * Returns %NULL for an empty list or a pointer to the tail element.
874 * The reference count is not incremented and the reference is therefore
875 * volatile. Use with caution.
877 static inline struct sk_buff *skb_peek_tail(const struct sk_buff_head *list_)
879 struct sk_buff *list = ((const struct sk_buff *)list_)->prev;
880 if (list == (struct sk_buff *)list_)
886 * skb_queue_len - get queue length
887 * @list_: list to measure
889 * Return the length of an &sk_buff queue.
891 static inline __u32 skb_queue_len(const struct sk_buff_head *list_)
897 * __skb_queue_head_init - initialize non-spinlock portions of sk_buff_head
898 * @list: queue to initialize
900 * This initializes only the list and queue length aspects of
901 * an sk_buff_head object. This allows to initialize the list
902 * aspects of an sk_buff_head without reinitializing things like
903 * the spinlock. It can also be used for on-stack sk_buff_head
904 * objects where the spinlock is known to not be used.
906 static inline void __skb_queue_head_init(struct sk_buff_head *list)
908 list->prev = list->next = (struct sk_buff *)list;
913 * This function creates a split out lock class for each invocation;
914 * this is needed for now since a whole lot of users of the skb-queue
915 * infrastructure in drivers have different locking usage (in hardirq)
916 * than the networking core (in softirq only). In the long run either the
917 * network layer or drivers should need annotation to consolidate the
918 * main types of usage into 3 classes.
920 static inline void skb_queue_head_init(struct sk_buff_head *list)
922 spin_lock_init(&list->lock);
923 __skb_queue_head_init(list);
926 static inline void skb_queue_head_init_class(struct sk_buff_head *list,
927 struct lock_class_key *class)
929 skb_queue_head_init(list);
930 lockdep_set_class(&list->lock, class);
934 * Insert an sk_buff on a list.
936 * The "__skb_xxxx()" functions are the non-atomic ones that
937 * can only be called with interrupts disabled.
939 extern void skb_insert(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list);
940 static inline void __skb_insert(struct sk_buff *newsk,
941 struct sk_buff *prev, struct sk_buff *next,
942 struct sk_buff_head *list)
946 next->prev = prev->next = newsk;
950 static inline void __skb_queue_splice(const struct sk_buff_head *list,
951 struct sk_buff *prev,
952 struct sk_buff *next)
954 struct sk_buff *first = list->next;
955 struct sk_buff *last = list->prev;
965 * skb_queue_splice - join two skb lists, this is designed for stacks
966 * @list: the new list to add
967 * @head: the place to add it in the first list
969 static inline void skb_queue_splice(const struct sk_buff_head *list,
970 struct sk_buff_head *head)
972 if (!skb_queue_empty(list)) {
973 __skb_queue_splice(list, (struct sk_buff *) head, head->next);
974 head->qlen += list->qlen;
979 * skb_queue_splice - join two skb lists and reinitialise the emptied list
980 * @list: the new list to add
981 * @head: the place to add it in the first list
983 * The list at @list is reinitialised
985 static inline void skb_queue_splice_init(struct sk_buff_head *list,
986 struct sk_buff_head *head)
988 if (!skb_queue_empty(list)) {
989 __skb_queue_splice(list, (struct sk_buff *) head, head->next);
990 head->qlen += list->qlen;
991 __skb_queue_head_init(list);
996 * skb_queue_splice_tail - join two skb lists, each list being a queue
997 * @list: the new list to add
998 * @head: the place to add it in the first list
1000 static inline void skb_queue_splice_tail(const struct sk_buff_head *list,
1001 struct sk_buff_head *head)
1003 if (!skb_queue_empty(list)) {
1004 __skb_queue_splice(list, head->prev, (struct sk_buff *) head);
1005 head->qlen += list->qlen;
1010 * skb_queue_splice_tail - join two skb lists and reinitialise the emptied list
1011 * @list: the new list to add
1012 * @head: the place to add it in the first list
1014 * Each of the lists is a queue.
1015 * The list at @list is reinitialised
1017 static inline void skb_queue_splice_tail_init(struct sk_buff_head *list,
1018 struct sk_buff_head *head)
1020 if (!skb_queue_empty(list)) {
1021 __skb_queue_splice(list, head->prev, (struct sk_buff *) head);
1022 head->qlen += list->qlen;
1023 __skb_queue_head_init(list);
1028 * __skb_queue_after - queue a buffer at the list head
1029 * @list: list to use
1030 * @prev: place after this buffer
1031 * @newsk: buffer to queue
1033 * Queue a buffer int the middle of a list. This function takes no locks
1034 * and you must therefore hold required locks before calling it.
1036 * A buffer cannot be placed on two lists at the same time.
1038 static inline void __skb_queue_after(struct sk_buff_head *list,
1039 struct sk_buff *prev,
1040 struct sk_buff *newsk)
1042 __skb_insert(newsk, prev, prev->next, list);
1045 extern void skb_append(struct sk_buff *old, struct sk_buff *newsk,
1046 struct sk_buff_head *list);
1048 static inline void __skb_queue_before(struct sk_buff_head *list,
1049 struct sk_buff *next,
1050 struct sk_buff *newsk)
1052 __skb_insert(newsk, next->prev, next, list);
1056 * __skb_queue_head - queue a buffer at the list head
1057 * @list: list to use
1058 * @newsk: buffer to queue
1060 * Queue a buffer at the start of a list. This function takes no locks
1061 * and you must therefore hold required locks before calling it.
1063 * A buffer cannot be placed on two lists at the same time.
1065 extern void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk);
1066 static inline void __skb_queue_head(struct sk_buff_head *list,
1067 struct sk_buff *newsk)
1069 __skb_queue_after(list, (struct sk_buff *)list, newsk);
1073 * __skb_queue_tail - queue a buffer at the list tail
1074 * @list: list to use
1075 * @newsk: buffer to queue
1077 * Queue a buffer at the end of a list. This function takes no locks
1078 * and you must therefore hold required locks before calling it.
1080 * A buffer cannot be placed on two lists at the same time.
1082 extern void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk);
1083 static inline void __skb_queue_tail(struct sk_buff_head *list,
1084 struct sk_buff *newsk)
1086 __skb_queue_before(list, (struct sk_buff *)list, newsk);
1090 * remove sk_buff from list. _Must_ be called atomically, and with
1093 extern void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list);
1094 static inline void __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
1096 struct sk_buff *next, *prev;
1101 skb->next = skb->prev = NULL;
1107 * __skb_dequeue - remove from the head of the queue
1108 * @list: list to dequeue from
1110 * Remove the head of the list. This function does not take any locks
1111 * so must be used with appropriate locks held only. The head item is
1112 * returned or %NULL if the list is empty.
1114 extern struct sk_buff *skb_dequeue(struct sk_buff_head *list);
1115 static inline struct sk_buff *__skb_dequeue(struct sk_buff_head *list)
1117 struct sk_buff *skb = skb_peek(list);
1119 __skb_unlink(skb, list);
1124 * __skb_dequeue_tail - remove from the tail of the queue
1125 * @list: list to dequeue from
1127 * Remove the tail of the list. This function does not take any locks
1128 * so must be used with appropriate locks held only. The tail item is
1129 * returned or %NULL if the list is empty.
1131 extern struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list);
1132 static inline struct sk_buff *__skb_dequeue_tail(struct sk_buff_head *list)
1134 struct sk_buff *skb = skb_peek_tail(list);
1136 __skb_unlink(skb, list);
1141 static inline int skb_is_nonlinear(const struct sk_buff *skb)
1143 return skb->data_len;
1146 static inline unsigned int skb_headlen(const struct sk_buff *skb)
1148 return skb->len - skb->data_len;
1151 static inline int skb_pagelen(const struct sk_buff *skb)
1155 for (i = (int)skb_shinfo(skb)->nr_frags - 1; i >= 0; i--)
1156 len += skb_frag_size(&skb_shinfo(skb)->frags[i]);
1157 return len + skb_headlen(skb);
1161 * __skb_fill_page_desc - initialise a paged fragment in an skb
1162 * @skb: buffer containing fragment to be initialised
1163 * @i: paged fragment index to initialise
1164 * @page: the page to use for this fragment
1165 * @off: the offset to the data with @page
1166 * @size: the length of the data
1168 * Initialises the @i'th fragment of @skb to point to &size bytes at
1169 * offset @off within @page.
1171 * Does not take any additional reference on the fragment.
1173 static inline void __skb_fill_page_desc(struct sk_buff *skb, int i,
1174 struct page *page, int off, int size)
1176 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
1178 frag->page.p = page;
1179 frag->page_offset = off;
1180 skb_frag_size_set(frag, size);
1184 * skb_fill_page_desc - initialise a paged fragment in an skb
1185 * @skb: buffer containing fragment to be initialised
1186 * @i: paged fragment index to initialise
1187 * @page: the page to use for this fragment
1188 * @off: the offset to the data with @page
1189 * @size: the length of the data
1191 * As per __skb_fill_page_desc() -- initialises the @i'th fragment of
1192 * @skb to point to &size bytes at offset @off within @page. In
1193 * addition updates @skb such that @i is the last fragment.
1195 * Does not take any additional reference on the fragment.
1197 static inline void skb_fill_page_desc(struct sk_buff *skb, int i,
1198 struct page *page, int off, int size)
1200 __skb_fill_page_desc(skb, i, page, off, size);
1201 skb_shinfo(skb)->nr_frags = i + 1;
1204 extern void skb_add_rx_frag(struct sk_buff *skb, int i, struct page *page,
1207 #define SKB_PAGE_ASSERT(skb) BUG_ON(skb_shinfo(skb)->nr_frags)
1208 #define SKB_FRAG_ASSERT(skb) BUG_ON(skb_has_frag_list(skb))
1209 #define SKB_LINEAR_ASSERT(skb) BUG_ON(skb_is_nonlinear(skb))
1211 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1212 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
1214 return skb->head + skb->tail;
1217 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
1219 skb->tail = skb->data - skb->head;
1222 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
1224 skb_reset_tail_pointer(skb);
1225 skb->tail += offset;
1227 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1228 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
1233 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
1235 skb->tail = skb->data;
1238 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
1240 skb->tail = skb->data + offset;
1243 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1246 * Add data to an sk_buff
1248 extern unsigned char *skb_put(struct sk_buff *skb, unsigned int len);
1249 static inline unsigned char *__skb_put(struct sk_buff *skb, unsigned int len)
1251 unsigned char *tmp = skb_tail_pointer(skb);
1252 SKB_LINEAR_ASSERT(skb);
1258 extern unsigned char *skb_push(struct sk_buff *skb, unsigned int len);
1259 static inline unsigned char *__skb_push(struct sk_buff *skb, unsigned int len)
1266 extern unsigned char *skb_pull(struct sk_buff *skb, unsigned int len);
1267 static inline unsigned char *__skb_pull(struct sk_buff *skb, unsigned int len)
1270 BUG_ON(skb->len < skb->data_len);
1271 return skb->data += len;
1274 static inline unsigned char *skb_pull_inline(struct sk_buff *skb, unsigned int len)
1276 return unlikely(len > skb->len) ? NULL : __skb_pull(skb, len);
1279 extern unsigned char *__pskb_pull_tail(struct sk_buff *skb, int delta);
1281 static inline unsigned char *__pskb_pull(struct sk_buff *skb, unsigned int len)
1283 if (len > skb_headlen(skb) &&
1284 !__pskb_pull_tail(skb, len - skb_headlen(skb)))
1287 return skb->data += len;
1290 static inline unsigned char *pskb_pull(struct sk_buff *skb, unsigned int len)
1292 return unlikely(len > skb->len) ? NULL : __pskb_pull(skb, len);
1295 static inline int pskb_may_pull(struct sk_buff *skb, unsigned int len)
1297 if (likely(len <= skb_headlen(skb)))
1299 if (unlikely(len > skb->len))
1301 return __pskb_pull_tail(skb, len - skb_headlen(skb)) != NULL;
1305 * skb_headroom - bytes at buffer head
1306 * @skb: buffer to check
1308 * Return the number of bytes of free space at the head of an &sk_buff.
1310 static inline unsigned int skb_headroom(const struct sk_buff *skb)
1312 return skb->data - skb->head;
1316 * skb_tailroom - bytes at buffer end
1317 * @skb: buffer to check
1319 * Return the number of bytes of free space at the tail of an sk_buff
1321 static inline int skb_tailroom(const struct sk_buff *skb)
1323 return skb_is_nonlinear(skb) ? 0 : skb->end - skb->tail;
1327 * skb_availroom - bytes at buffer end
1328 * @skb: buffer to check
1330 * Return the number of bytes of free space at the tail of an sk_buff
1331 * allocated by sk_stream_alloc()
1333 static inline int skb_availroom(const struct sk_buff *skb)
1335 if (skb_is_nonlinear(skb))
1338 return skb->end - skb->tail - skb->reserved_tailroom;
1342 * skb_reserve - adjust headroom
1343 * @skb: buffer to alter
1344 * @len: bytes to move
1346 * Increase the headroom of an empty &sk_buff by reducing the tail
1347 * room. This is only allowed for an empty buffer.
1349 static inline void skb_reserve(struct sk_buff *skb, int len)
1355 static inline void skb_reset_mac_len(struct sk_buff *skb)
1357 skb->mac_len = skb->network_header - skb->mac_header;
1360 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1361 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
1363 return skb->head + skb->transport_header;
1366 static inline void skb_reset_transport_header(struct sk_buff *skb)
1368 skb->transport_header = skb->data - skb->head;
1371 static inline void skb_set_transport_header(struct sk_buff *skb,
1374 skb_reset_transport_header(skb);
1375 skb->transport_header += offset;
1378 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
1380 return skb->head + skb->network_header;
1383 static inline void skb_reset_network_header(struct sk_buff *skb)
1385 skb->network_header = skb->data - skb->head;
1388 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1390 skb_reset_network_header(skb);
1391 skb->network_header += offset;
1394 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1396 return skb->head + skb->mac_header;
1399 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1401 return skb->mac_header != ~0U;
1404 static inline void skb_reset_mac_header(struct sk_buff *skb)
1406 skb->mac_header = skb->data - skb->head;
1409 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1411 skb_reset_mac_header(skb);
1412 skb->mac_header += offset;
1415 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1417 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
1419 return skb->transport_header;
1422 static inline void skb_reset_transport_header(struct sk_buff *skb)
1424 skb->transport_header = skb->data;
1427 static inline void skb_set_transport_header(struct sk_buff *skb,
1430 skb->transport_header = skb->data + offset;
1433 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
1435 return skb->network_header;
1438 static inline void skb_reset_network_header(struct sk_buff *skb)
1440 skb->network_header = skb->data;
1443 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1445 skb->network_header = skb->data + offset;
1448 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1450 return skb->mac_header;
1453 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1455 return skb->mac_header != NULL;
1458 static inline void skb_reset_mac_header(struct sk_buff *skb)
1460 skb->mac_header = skb->data;
1463 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1465 skb->mac_header = skb->data + offset;
1467 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1469 static inline void skb_mac_header_rebuild(struct sk_buff *skb)
1471 if (skb_mac_header_was_set(skb)) {
1472 const unsigned char *old_mac = skb_mac_header(skb);
1474 skb_set_mac_header(skb, -skb->mac_len);
1475 memmove(skb_mac_header(skb), old_mac, skb->mac_len);
1479 static inline int skb_checksum_start_offset(const struct sk_buff *skb)
1481 return skb->csum_start - skb_headroom(skb);
1484 static inline int skb_transport_offset(const struct sk_buff *skb)
1486 return skb_transport_header(skb) - skb->data;
1489 static inline u32 skb_network_header_len(const struct sk_buff *skb)
1491 return skb->transport_header - skb->network_header;
1494 static inline int skb_network_offset(const struct sk_buff *skb)
1496 return skb_network_header(skb) - skb->data;
1499 static inline int pskb_network_may_pull(struct sk_buff *skb, unsigned int len)
1501 return pskb_may_pull(skb, skb_network_offset(skb) + len);
1505 * CPUs often take a performance hit when accessing unaligned memory
1506 * locations. The actual performance hit varies, it can be small if the
1507 * hardware handles it or large if we have to take an exception and fix it
1510 * Since an ethernet header is 14 bytes network drivers often end up with
1511 * the IP header at an unaligned offset. The IP header can be aligned by
1512 * shifting the start of the packet by 2 bytes. Drivers should do this
1515 * skb_reserve(skb, NET_IP_ALIGN);
1517 * The downside to this alignment of the IP header is that the DMA is now
1518 * unaligned. On some architectures the cost of an unaligned DMA is high
1519 * and this cost outweighs the gains made by aligning the IP header.
1521 * Since this trade off varies between architectures, we allow NET_IP_ALIGN
1524 #ifndef NET_IP_ALIGN
1525 #define NET_IP_ALIGN 2
1529 * The networking layer reserves some headroom in skb data (via
1530 * dev_alloc_skb). This is used to avoid having to reallocate skb data when
1531 * the header has to grow. In the default case, if the header has to grow
1532 * 32 bytes or less we avoid the reallocation.
1534 * Unfortunately this headroom changes the DMA alignment of the resulting
1535 * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive
1536 * on some architectures. An architecture can override this value,
1537 * perhaps setting it to a cacheline in size (since that will maintain
1538 * cacheline alignment of the DMA). It must be a power of 2.
1540 * Various parts of the networking layer expect at least 32 bytes of
1541 * headroom, you should not reduce this.
1543 * Using max(32, L1_CACHE_BYTES) makes sense (especially with RPS)
1544 * to reduce average number of cache lines per packet.
1545 * get_rps_cpus() for example only access one 64 bytes aligned block :
1546 * NET_IP_ALIGN(2) + ethernet_header(14) + IP_header(20/40) + ports(8)
1549 #define NET_SKB_PAD max(32, L1_CACHE_BYTES)
1552 extern int ___pskb_trim(struct sk_buff *skb, unsigned int len);
1554 static inline void __skb_trim(struct sk_buff *skb, unsigned int len)
1556 if (unlikely(skb_is_nonlinear(skb))) {
1561 skb_set_tail_pointer(skb, len);
1564 extern void skb_trim(struct sk_buff *skb, unsigned int len);
1566 static inline int __pskb_trim(struct sk_buff *skb, unsigned int len)
1569 return ___pskb_trim(skb, len);
1570 __skb_trim(skb, len);
1574 static inline int pskb_trim(struct sk_buff *skb, unsigned int len)
1576 return (len < skb->len) ? __pskb_trim(skb, len) : 0;
1580 * pskb_trim_unique - remove end from a paged unique (not cloned) buffer
1581 * @skb: buffer to alter
1584 * This is identical to pskb_trim except that the caller knows that
1585 * the skb is not cloned so we should never get an error due to out-
1588 static inline void pskb_trim_unique(struct sk_buff *skb, unsigned int len)
1590 int err = pskb_trim(skb, len);
1595 * skb_orphan - orphan a buffer
1596 * @skb: buffer to orphan
1598 * If a buffer currently has an owner then we call the owner's
1599 * destructor function and make the @skb unowned. The buffer continues
1600 * to exist but is no longer charged to its former owner.
1602 static inline void skb_orphan(struct sk_buff *skb)
1604 if (skb->destructor)
1605 skb->destructor(skb);
1606 skb->destructor = NULL;
1611 * __skb_queue_purge - empty a list
1612 * @list: list to empty
1614 * Delete all buffers on an &sk_buff list. Each buffer is removed from
1615 * the list and one reference dropped. This function does not take the
1616 * list lock and the caller must hold the relevant locks to use it.
1618 extern void skb_queue_purge(struct sk_buff_head *list);
1619 static inline void __skb_queue_purge(struct sk_buff_head *list)
1621 struct sk_buff *skb;
1622 while ((skb = __skb_dequeue(list)) != NULL)
1627 * __dev_alloc_skb - allocate an skbuff for receiving
1628 * @length: length to allocate
1629 * @gfp_mask: get_free_pages mask, passed to alloc_skb
1631 * Allocate a new &sk_buff and assign it a usage count of one. The
1632 * buffer has unspecified headroom built in. Users should allocate
1633 * the headroom they think they need without accounting for the
1634 * built in space. The built in space is used for optimisations.
1636 * %NULL is returned if there is no free memory.
1638 static inline struct sk_buff *__dev_alloc_skb(unsigned int length,
1641 struct sk_buff *skb = alloc_skb(length + NET_SKB_PAD, gfp_mask);
1643 skb_reserve(skb, NET_SKB_PAD);
1647 extern struct sk_buff *dev_alloc_skb(unsigned int length);
1649 extern struct sk_buff *__netdev_alloc_skb(struct net_device *dev,
1650 unsigned int length, gfp_t gfp_mask);
1653 * netdev_alloc_skb - allocate an skbuff for rx on a specific device
1654 * @dev: network device to receive on
1655 * @length: length to allocate
1657 * Allocate a new &sk_buff and assign it a usage count of one. The
1658 * buffer has unspecified headroom built in. Users should allocate
1659 * the headroom they think they need without accounting for the
1660 * built in space. The built in space is used for optimisations.
1662 * %NULL is returned if there is no free memory. Although this function
1663 * allocates memory it can be called from an interrupt.
1665 static inline struct sk_buff *netdev_alloc_skb(struct net_device *dev,
1666 unsigned int length)
1668 return __netdev_alloc_skb(dev, length, GFP_ATOMIC);
1671 static inline struct sk_buff *__netdev_alloc_skb_ip_align(struct net_device *dev,
1672 unsigned int length, gfp_t gfp)
1674 struct sk_buff *skb = __netdev_alloc_skb(dev, length + NET_IP_ALIGN, gfp);
1676 if (NET_IP_ALIGN && skb)
1677 skb_reserve(skb, NET_IP_ALIGN);
1681 static inline struct sk_buff *netdev_alloc_skb_ip_align(struct net_device *dev,
1682 unsigned int length)
1684 return __netdev_alloc_skb_ip_align(dev, length, GFP_ATOMIC);
1688 * __netdev_alloc_page - allocate a page for ps-rx on a specific device
1689 * @dev: network device to receive on
1690 * @gfp_mask: alloc_pages_node mask
1692 * Allocate a new page. dev currently unused.
1694 * %NULL is returned if there is no free memory.
1696 static inline struct page *__netdev_alloc_page(struct net_device *dev, gfp_t gfp_mask)
1698 return alloc_pages_node(NUMA_NO_NODE, gfp_mask, 0);
1702 * netdev_alloc_page - allocate a page for ps-rx on a specific device
1703 * @dev: network device to receive on
1705 * Allocate a new page. dev currently unused.
1707 * %NULL is returned if there is no free memory.
1709 static inline struct page *netdev_alloc_page(struct net_device *dev)
1711 return __netdev_alloc_page(dev, GFP_ATOMIC);
1714 static inline void netdev_free_page(struct net_device *dev, struct page *page)
1720 * skb_frag_page - retrieve the page refered to by a paged fragment
1721 * @frag: the paged fragment
1723 * Returns the &struct page associated with @frag.
1725 static inline struct page *skb_frag_page(const skb_frag_t *frag)
1727 return frag->page.p;
1731 * __skb_frag_ref - take an addition reference on a paged fragment.
1732 * @frag: the paged fragment
1734 * Takes an additional reference on the paged fragment @frag.
1736 static inline void __skb_frag_ref(skb_frag_t *frag)
1738 get_page(skb_frag_page(frag));
1742 * skb_frag_ref - take an addition reference on a paged fragment of an skb.
1744 * @f: the fragment offset.
1746 * Takes an additional reference on the @f'th paged fragment of @skb.
1748 static inline void skb_frag_ref(struct sk_buff *skb, int f)
1750 __skb_frag_ref(&skb_shinfo(skb)->frags[f]);
1754 * __skb_frag_unref - release a reference on a paged fragment.
1755 * @frag: the paged fragment
1757 * Releases a reference on the paged fragment @frag.
1759 static inline void __skb_frag_unref(skb_frag_t *frag)
1761 put_page(skb_frag_page(frag));
1765 * skb_frag_unref - release a reference on a paged fragment of an skb.
1767 * @f: the fragment offset
1769 * Releases a reference on the @f'th paged fragment of @skb.
1771 static inline void skb_frag_unref(struct sk_buff *skb, int f)
1773 __skb_frag_unref(&skb_shinfo(skb)->frags[f]);
1777 * skb_frag_address - gets the address of the data contained in a paged fragment
1778 * @frag: the paged fragment buffer
1780 * Returns the address of the data within @frag. The page must already
1783 static inline void *skb_frag_address(const skb_frag_t *frag)
1785 return page_address(skb_frag_page(frag)) + frag->page_offset;
1789 * skb_frag_address_safe - gets the address of the data contained in a paged fragment
1790 * @frag: the paged fragment buffer
1792 * Returns the address of the data within @frag. Checks that the page
1793 * is mapped and returns %NULL otherwise.
1795 static inline void *skb_frag_address_safe(const skb_frag_t *frag)
1797 void *ptr = page_address(skb_frag_page(frag));
1801 return ptr + frag->page_offset;
1805 * __skb_frag_set_page - sets the page contained in a paged fragment
1806 * @frag: the paged fragment
1807 * @page: the page to set
1809 * Sets the fragment @frag to contain @page.
1811 static inline void __skb_frag_set_page(skb_frag_t *frag, struct page *page)
1813 frag->page.p = page;
1817 * skb_frag_set_page - sets the page contained in a paged fragment of an skb
1819 * @f: the fragment offset
1820 * @page: the page to set
1822 * Sets the @f'th fragment of @skb to contain @page.
1824 static inline void skb_frag_set_page(struct sk_buff *skb, int f,
1827 __skb_frag_set_page(&skb_shinfo(skb)->frags[f], page);
1831 * skb_frag_dma_map - maps a paged fragment via the DMA API
1832 * @dev: the device to map the fragment to
1833 * @frag: the paged fragment to map
1834 * @offset: the offset within the fragment (starting at the
1835 * fragment's own offset)
1836 * @size: the number of bytes to map
1837 * @dir: the direction of the mapping (%PCI_DMA_*)
1839 * Maps the page associated with @frag to @device.
1841 static inline dma_addr_t skb_frag_dma_map(struct device *dev,
1842 const skb_frag_t *frag,
1843 size_t offset, size_t size,
1844 enum dma_data_direction dir)
1846 return dma_map_page(dev, skb_frag_page(frag),
1847 frag->page_offset + offset, size, dir);
1851 * skb_clone_writable - is the header of a clone writable
1852 * @skb: buffer to check
1853 * @len: length up to which to write
1855 * Returns true if modifying the header part of the cloned buffer
1856 * does not requires the data to be copied.
1858 static inline int skb_clone_writable(const struct sk_buff *skb, unsigned int len)
1860 return !skb_header_cloned(skb) &&
1861 skb_headroom(skb) + len <= skb->hdr_len;
1864 static inline int __skb_cow(struct sk_buff *skb, unsigned int headroom,
1869 if (headroom > skb_headroom(skb))
1870 delta = headroom - skb_headroom(skb);
1872 if (delta || cloned)
1873 return pskb_expand_head(skb, ALIGN(delta, NET_SKB_PAD), 0,
1879 * skb_cow - copy header of skb when it is required
1880 * @skb: buffer to cow
1881 * @headroom: needed headroom
1883 * If the skb passed lacks sufficient headroom or its data part
1884 * is shared, data is reallocated. If reallocation fails, an error
1885 * is returned and original skb is not changed.
1887 * The result is skb with writable area skb->head...skb->tail
1888 * and at least @headroom of space at head.
1890 static inline int skb_cow(struct sk_buff *skb, unsigned int headroom)
1892 return __skb_cow(skb, headroom, skb_cloned(skb));
1896 * skb_cow_head - skb_cow but only making the head writable
1897 * @skb: buffer to cow
1898 * @headroom: needed headroom
1900 * This function is identical to skb_cow except that we replace the
1901 * skb_cloned check by skb_header_cloned. It should be used when
1902 * you only need to push on some header and do not need to modify
1905 static inline int skb_cow_head(struct sk_buff *skb, unsigned int headroom)
1907 return __skb_cow(skb, headroom, skb_header_cloned(skb));
1911 * skb_padto - pad an skbuff up to a minimal size
1912 * @skb: buffer to pad
1913 * @len: minimal length
1915 * Pads up a buffer to ensure the trailing bytes exist and are
1916 * blanked. If the buffer already contains sufficient data it
1917 * is untouched. Otherwise it is extended. Returns zero on
1918 * success. The skb is freed on error.
1921 static inline int skb_padto(struct sk_buff *skb, unsigned int len)
1923 unsigned int size = skb->len;
1924 if (likely(size >= len))
1926 return skb_pad(skb, len - size);
1929 static inline int skb_add_data(struct sk_buff *skb,
1930 char __user *from, int copy)
1932 const int off = skb->len;
1934 if (skb->ip_summed == CHECKSUM_NONE) {
1936 __wsum csum = csum_and_copy_from_user(from, skb_put(skb, copy),
1939 skb->csum = csum_block_add(skb->csum, csum, off);
1942 } else if (!copy_from_user(skb_put(skb, copy), from, copy))
1945 __skb_trim(skb, off);
1949 static inline int skb_can_coalesce(struct sk_buff *skb, int i,
1950 const struct page *page, int off)
1953 const struct skb_frag_struct *frag = &skb_shinfo(skb)->frags[i - 1];
1955 return page == skb_frag_page(frag) &&
1956 off == frag->page_offset + skb_frag_size(frag);
1961 static inline int __skb_linearize(struct sk_buff *skb)
1963 return __pskb_pull_tail(skb, skb->data_len) ? 0 : -ENOMEM;
1967 * skb_linearize - convert paged skb to linear one
1968 * @skb: buffer to linarize
1970 * If there is no free memory -ENOMEM is returned, otherwise zero
1971 * is returned and the old skb data released.
1973 static inline int skb_linearize(struct sk_buff *skb)
1975 return skb_is_nonlinear(skb) ? __skb_linearize(skb) : 0;
1979 * skb_linearize_cow - make sure skb is linear and writable
1980 * @skb: buffer to process
1982 * If there is no free memory -ENOMEM is returned, otherwise zero
1983 * is returned and the old skb data released.
1985 static inline int skb_linearize_cow(struct sk_buff *skb)
1987 return skb_is_nonlinear(skb) || skb_cloned(skb) ?
1988 __skb_linearize(skb) : 0;
1992 * skb_postpull_rcsum - update checksum for received skb after pull
1993 * @skb: buffer to update
1994 * @start: start of data before pull
1995 * @len: length of data pulled
1997 * After doing a pull on a received packet, you need to call this to
1998 * update the CHECKSUM_COMPLETE checksum, or set ip_summed to
1999 * CHECKSUM_NONE so that it can be recomputed from scratch.
2002 static inline void skb_postpull_rcsum(struct sk_buff *skb,
2003 const void *start, unsigned int len)
2005 if (skb->ip_summed == CHECKSUM_COMPLETE)
2006 skb->csum = csum_sub(skb->csum, csum_partial(start, len, 0));
2009 unsigned char *skb_pull_rcsum(struct sk_buff *skb, unsigned int len);
2012 * pskb_trim_rcsum - trim received skb and update checksum
2013 * @skb: buffer to trim
2016 * This is exactly the same as pskb_trim except that it ensures the
2017 * checksum of received packets are still valid after the operation.
2020 static inline int pskb_trim_rcsum(struct sk_buff *skb, unsigned int len)
2022 if (likely(len >= skb->len))
2024 if (skb->ip_summed == CHECKSUM_COMPLETE)
2025 skb->ip_summed = CHECKSUM_NONE;
2026 return __pskb_trim(skb, len);
2029 #define skb_queue_walk(queue, skb) \
2030 for (skb = (queue)->next; \
2031 skb != (struct sk_buff *)(queue); \
2034 #define skb_queue_walk_safe(queue, skb, tmp) \
2035 for (skb = (queue)->next, tmp = skb->next; \
2036 skb != (struct sk_buff *)(queue); \
2037 skb = tmp, tmp = skb->next)
2039 #define skb_queue_walk_from(queue, skb) \
2040 for (; skb != (struct sk_buff *)(queue); \
2043 #define skb_queue_walk_from_safe(queue, skb, tmp) \
2044 for (tmp = skb->next; \
2045 skb != (struct sk_buff *)(queue); \
2046 skb = tmp, tmp = skb->next)
2048 #define skb_queue_reverse_walk(queue, skb) \
2049 for (skb = (queue)->prev; \
2050 skb != (struct sk_buff *)(queue); \
2053 #define skb_queue_reverse_walk_safe(queue, skb, tmp) \
2054 for (skb = (queue)->prev, tmp = skb->prev; \
2055 skb != (struct sk_buff *)(queue); \
2056 skb = tmp, tmp = skb->prev)
2058 #define skb_queue_reverse_walk_from_safe(queue, skb, tmp) \
2059 for (tmp = skb->prev; \
2060 skb != (struct sk_buff *)(queue); \
2061 skb = tmp, tmp = skb->prev)
2063 static inline bool skb_has_frag_list(const struct sk_buff *skb)
2065 return skb_shinfo(skb)->frag_list != NULL;
2068 static inline void skb_frag_list_init(struct sk_buff *skb)
2070 skb_shinfo(skb)->frag_list = NULL;
2073 static inline void skb_frag_add_head(struct sk_buff *skb, struct sk_buff *frag)
2075 frag->next = skb_shinfo(skb)->frag_list;
2076 skb_shinfo(skb)->frag_list = frag;
2079 #define skb_walk_frags(skb, iter) \
2080 for (iter = skb_shinfo(skb)->frag_list; iter; iter = iter->next)
2082 extern struct sk_buff *__skb_recv_datagram(struct sock *sk, unsigned flags,
2083 int *peeked, int *err);
2084 extern struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags,
2085 int noblock, int *err);
2086 extern unsigned int datagram_poll(struct file *file, struct socket *sock,
2087 struct poll_table_struct *wait);
2088 extern int skb_copy_datagram_iovec(const struct sk_buff *from,
2089 int offset, struct iovec *to,
2091 extern int skb_copy_and_csum_datagram_iovec(struct sk_buff *skb,
2094 extern int skb_copy_datagram_from_iovec(struct sk_buff *skb,
2096 const struct iovec *from,
2099 extern int skb_copy_datagram_const_iovec(const struct sk_buff *from,
2101 const struct iovec *to,
2104 extern void skb_free_datagram(struct sock *sk, struct sk_buff *skb);
2105 extern void skb_free_datagram_locked(struct sock *sk,
2106 struct sk_buff *skb);
2107 extern int skb_kill_datagram(struct sock *sk, struct sk_buff *skb,
2108 unsigned int flags);
2109 extern __wsum skb_checksum(const struct sk_buff *skb, int offset,
2110 int len, __wsum csum);
2111 extern int skb_copy_bits(const struct sk_buff *skb, int offset,
2113 extern int skb_store_bits(struct sk_buff *skb, int offset,
2114 const void *from, int len);
2115 extern __wsum skb_copy_and_csum_bits(const struct sk_buff *skb,
2116 int offset, u8 *to, int len,
2118 extern int skb_splice_bits(struct sk_buff *skb,
2119 unsigned int offset,
2120 struct pipe_inode_info *pipe,
2122 unsigned int flags);
2123 extern void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to);
2124 extern void skb_split(struct sk_buff *skb,
2125 struct sk_buff *skb1, const u32 len);
2126 extern int skb_shift(struct sk_buff *tgt, struct sk_buff *skb,
2129 extern struct sk_buff *skb_segment(struct sk_buff *skb, u32 features);
2131 static inline void *skb_header_pointer(const struct sk_buff *skb, int offset,
2132 int len, void *buffer)
2134 int hlen = skb_headlen(skb);
2136 if (hlen - offset >= len)
2137 return skb->data + offset;
2139 if (skb_copy_bits(skb, offset, buffer, len) < 0)
2145 static inline void skb_copy_from_linear_data(const struct sk_buff *skb,
2147 const unsigned int len)
2149 memcpy(to, skb->data, len);
2152 static inline void skb_copy_from_linear_data_offset(const struct sk_buff *skb,
2153 const int offset, void *to,
2154 const unsigned int len)
2156 memcpy(to, skb->data + offset, len);
2159 static inline void skb_copy_to_linear_data(struct sk_buff *skb,
2161 const unsigned int len)
2163 memcpy(skb->data, from, len);
2166 static inline void skb_copy_to_linear_data_offset(struct sk_buff *skb,
2169 const unsigned int len)
2171 memcpy(skb->data + offset, from, len);
2174 extern void skb_init(void);
2176 static inline ktime_t skb_get_ktime(const struct sk_buff *skb)
2182 * skb_get_timestamp - get timestamp from a skb
2183 * @skb: skb to get stamp from
2184 * @stamp: pointer to struct timeval to store stamp in
2186 * Timestamps are stored in the skb as offsets to a base timestamp.
2187 * This function converts the offset back to a struct timeval and stores
2190 static inline void skb_get_timestamp(const struct sk_buff *skb,
2191 struct timeval *stamp)
2193 *stamp = ktime_to_timeval(skb->tstamp);
2196 static inline void skb_get_timestampns(const struct sk_buff *skb,
2197 struct timespec *stamp)
2199 *stamp = ktime_to_timespec(skb->tstamp);
2202 static inline void __net_timestamp(struct sk_buff *skb)
2204 skb->tstamp = ktime_get_real();
2207 static inline ktime_t net_timedelta(ktime_t t)
2209 return ktime_sub(ktime_get_real(), t);
2212 static inline ktime_t net_invalid_timestamp(void)
2214 return ktime_set(0, 0);
2217 extern void skb_timestamping_init(void);
2219 #ifdef CONFIG_NETWORK_PHY_TIMESTAMPING
2221 extern void skb_clone_tx_timestamp(struct sk_buff *skb);
2222 extern bool skb_defer_rx_timestamp(struct sk_buff *skb);
2224 #else /* CONFIG_NETWORK_PHY_TIMESTAMPING */
2226 static inline void skb_clone_tx_timestamp(struct sk_buff *skb)
2230 static inline bool skb_defer_rx_timestamp(struct sk_buff *skb)
2235 #endif /* !CONFIG_NETWORK_PHY_TIMESTAMPING */
2238 * skb_complete_tx_timestamp() - deliver cloned skb with tx timestamps
2240 * PHY drivers may accept clones of transmitted packets for
2241 * timestamping via their phy_driver.txtstamp method. These drivers
2242 * must call this function to return the skb back to the stack, with
2243 * or without a timestamp.
2245 * @skb: clone of the the original outgoing packet
2246 * @hwtstamps: hardware time stamps, may be NULL if not available
2249 void skb_complete_tx_timestamp(struct sk_buff *skb,
2250 struct skb_shared_hwtstamps *hwtstamps);
2253 * skb_tstamp_tx - queue clone of skb with send time stamps
2254 * @orig_skb: the original outgoing packet
2255 * @hwtstamps: hardware time stamps, may be NULL if not available
2257 * If the skb has a socket associated, then this function clones the
2258 * skb (thus sharing the actual data and optional structures), stores
2259 * the optional hardware time stamping information (if non NULL) or
2260 * generates a software time stamp (otherwise), then queues the clone
2261 * to the error queue of the socket. Errors are silently ignored.
2263 extern void skb_tstamp_tx(struct sk_buff *orig_skb,
2264 struct skb_shared_hwtstamps *hwtstamps);
2266 static inline void sw_tx_timestamp(struct sk_buff *skb)
2268 if (skb_shinfo(skb)->tx_flags & SKBTX_SW_TSTAMP &&
2269 !(skb_shinfo(skb)->tx_flags & SKBTX_IN_PROGRESS))
2270 skb_tstamp_tx(skb, NULL);
2274 * skb_tx_timestamp() - Driver hook for transmit timestamping
2276 * Ethernet MAC Drivers should call this function in their hard_xmit()
2277 * function immediately before giving the sk_buff to the MAC hardware.
2279 * @skb: A socket buffer.
2281 static inline void skb_tx_timestamp(struct sk_buff *skb)
2283 skb_clone_tx_timestamp(skb);
2284 sw_tx_timestamp(skb);
2287 extern __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len);
2288 extern __sum16 __skb_checksum_complete(struct sk_buff *skb);
2290 static inline int skb_csum_unnecessary(const struct sk_buff *skb)
2292 return skb->ip_summed & CHECKSUM_UNNECESSARY;
2296 * skb_checksum_complete - Calculate checksum of an entire packet
2297 * @skb: packet to process
2299 * This function calculates the checksum over the entire packet plus
2300 * the value of skb->csum. The latter can be used to supply the
2301 * checksum of a pseudo header as used by TCP/UDP. It returns the
2304 * For protocols that contain complete checksums such as ICMP/TCP/UDP,
2305 * this function can be used to verify that checksum on received
2306 * packets. In that case the function should return zero if the
2307 * checksum is correct. In particular, this function will return zero
2308 * if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the
2309 * hardware has already verified the correctness of the checksum.
2311 static inline __sum16 skb_checksum_complete(struct sk_buff *skb)
2313 return skb_csum_unnecessary(skb) ?
2314 0 : __skb_checksum_complete(skb);
2317 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2318 extern void nf_conntrack_destroy(struct nf_conntrack *nfct);
2319 static inline void nf_conntrack_put(struct nf_conntrack *nfct)
2321 if (nfct && atomic_dec_and_test(&nfct->use))
2322 nf_conntrack_destroy(nfct);
2324 static inline void nf_conntrack_get(struct nf_conntrack *nfct)
2327 atomic_inc(&nfct->use);
2330 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2331 static inline void nf_conntrack_get_reasm(struct sk_buff *skb)
2334 atomic_inc(&skb->users);
2336 static inline void nf_conntrack_put_reasm(struct sk_buff *skb)
2342 #ifdef CONFIG_BRIDGE_NETFILTER
2343 static inline void nf_bridge_put(struct nf_bridge_info *nf_bridge)
2345 if (nf_bridge && atomic_dec_and_test(&nf_bridge->use))
2348 static inline void nf_bridge_get(struct nf_bridge_info *nf_bridge)
2351 atomic_inc(&nf_bridge->use);
2353 #endif /* CONFIG_BRIDGE_NETFILTER */
2354 static inline void nf_reset(struct sk_buff *skb)
2356 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2357 nf_conntrack_put(skb->nfct);
2360 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2361 nf_conntrack_put_reasm(skb->nfct_reasm);
2362 skb->nfct_reasm = NULL;
2364 #ifdef CONFIG_BRIDGE_NETFILTER
2365 nf_bridge_put(skb->nf_bridge);
2366 skb->nf_bridge = NULL;
2370 static inline void nf_reset_trace(struct sk_buff *skb)
2372 #if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE)
2377 /* Note: This doesn't put any conntrack and bridge info in dst. */
2378 static inline void __nf_copy(struct sk_buff *dst, const struct sk_buff *src)
2380 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2381 dst->nfct = src->nfct;
2382 nf_conntrack_get(src->nfct);
2383 dst->nfctinfo = src->nfctinfo;
2385 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2386 dst->nfct_reasm = src->nfct_reasm;
2387 nf_conntrack_get_reasm(src->nfct_reasm);
2389 #ifdef CONFIG_BRIDGE_NETFILTER
2390 dst->nf_bridge = src->nf_bridge;
2391 nf_bridge_get(src->nf_bridge);
2395 static inline void nf_copy(struct sk_buff *dst, const struct sk_buff *src)
2397 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2398 nf_conntrack_put(dst->nfct);
2400 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2401 nf_conntrack_put_reasm(dst->nfct_reasm);
2403 #ifdef CONFIG_BRIDGE_NETFILTER
2404 nf_bridge_put(dst->nf_bridge);
2406 __nf_copy(dst, src);
2409 #ifdef CONFIG_NETWORK_SECMARK
2410 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
2412 to->secmark = from->secmark;
2415 static inline void skb_init_secmark(struct sk_buff *skb)
2420 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
2423 static inline void skb_init_secmark(struct sk_buff *skb)
2427 static inline void skb_set_queue_mapping(struct sk_buff *skb, u16 queue_mapping)
2429 skb->queue_mapping = queue_mapping;
2432 static inline u16 skb_get_queue_mapping(const struct sk_buff *skb)
2434 return skb->queue_mapping;
2437 static inline void skb_copy_queue_mapping(struct sk_buff *to, const struct sk_buff *from)
2439 to->queue_mapping = from->queue_mapping;
2442 static inline void skb_record_rx_queue(struct sk_buff *skb, u16 rx_queue)
2444 skb->queue_mapping = rx_queue + 1;
2447 static inline u16 skb_get_rx_queue(const struct sk_buff *skb)
2449 return skb->queue_mapping - 1;
2452 static inline bool skb_rx_queue_recorded(const struct sk_buff *skb)
2454 return skb->queue_mapping != 0;
2457 extern u16 __skb_tx_hash(const struct net_device *dev,
2458 const struct sk_buff *skb,
2459 unsigned int num_tx_queues);
2462 static inline struct sec_path *skb_sec_path(struct sk_buff *skb)
2467 static inline struct sec_path *skb_sec_path(struct sk_buff *skb)
2473 static inline int skb_is_gso(const struct sk_buff *skb)
2475 return skb_shinfo(skb)->gso_size;
2478 static inline int skb_is_gso_v6(const struct sk_buff *skb)
2480 return skb_shinfo(skb)->gso_type & SKB_GSO_TCPV6;
2483 extern void __skb_warn_lro_forwarding(const struct sk_buff *skb);
2485 static inline bool skb_warn_if_lro(const struct sk_buff *skb)
2487 /* LRO sets gso_size but not gso_type, whereas if GSO is really
2488 * wanted then gso_type will be set. */
2489 const struct skb_shared_info *shinfo = skb_shinfo(skb);
2491 if (skb_is_nonlinear(skb) && shinfo->gso_size != 0 &&
2492 unlikely(shinfo->gso_type == 0)) {
2493 __skb_warn_lro_forwarding(skb);
2499 static inline void skb_forward_csum(struct sk_buff *skb)
2501 /* Unfortunately we don't support this one. Any brave souls? */
2502 if (skb->ip_summed == CHECKSUM_COMPLETE)
2503 skb->ip_summed = CHECKSUM_NONE;
2507 * skb_checksum_none_assert - make sure skb ip_summed is CHECKSUM_NONE
2508 * @skb: skb to check
2510 * fresh skbs have their ip_summed set to CHECKSUM_NONE.
2511 * Instead of forcing ip_summed to CHECKSUM_NONE, we can
2512 * use this helper, to document places where we make this assertion.
2514 static inline void skb_checksum_none_assert(const struct sk_buff *skb)
2517 BUG_ON(skb->ip_summed != CHECKSUM_NONE);
2521 bool skb_partial_csum_set(struct sk_buff *skb, u16 start, u16 off);
2523 static inline bool skb_is_recycleable(const struct sk_buff *skb, int skb_size)
2525 if (irqs_disabled())
2528 if (skb_shinfo(skb)->tx_flags & SKBTX_DEV_ZEROCOPY)
2531 if (skb_is_nonlinear(skb) || skb->fclone != SKB_FCLONE_UNAVAILABLE)
2534 skb_size = SKB_DATA_ALIGN(skb_size + NET_SKB_PAD);
2535 if (skb_end_pointer(skb) - skb->head < skb_size)
2538 if (skb_shared(skb) || skb_cloned(skb))
2543 #endif /* __KERNEL__ */
2544 #endif /* _LINUX_SKBUFF_H */