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. 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 /* ensure the originating sk reference is available on driver level */
217 SKBTX_DRV_NEEDS_SK_REF = 1 << 3,
219 /* device driver supports TX zero-copy buffers */
220 SKBTX_DEV_ZEROCOPY = 1 << 4,
222 /* generate wifi status information (where possible) */
223 SKBTX_WIFI_STATUS = 1 << 5,
227 * The callback notifies userspace to release buffers when skb DMA is done in
228 * lower device, the skb last reference should be 0 when calling this.
229 * The desc is used to track userspace buffer index.
232 void (*callback)(void *);
237 /* This data is invariant across clones and lives at
238 * the end of the header data, ie. at skb->end.
240 struct skb_shared_info {
241 unsigned short nr_frags;
242 unsigned short gso_size;
243 /* Warning: this field is not always filled in (UFO)! */
244 unsigned short gso_segs;
245 unsigned short gso_type;
248 struct sk_buff *frag_list;
249 struct skb_shared_hwtstamps hwtstamps;
252 * Warning : all fields before dataref are cleared in __alloc_skb()
256 /* Intermediate layers must ensure that destructor_arg
257 * remains valid until skb destructor */
258 void * destructor_arg;
260 /* must be last field, see pskb_expand_head() */
261 skb_frag_t frags[MAX_SKB_FRAGS];
264 /* We divide dataref into two halves. The higher 16 bits hold references
265 * to the payload part of skb->data. The lower 16 bits hold references to
266 * the entire skb->data. A clone of a headerless skb holds the length of
267 * the header in skb->hdr_len.
269 * All users must obey the rule that the skb->data reference count must be
270 * greater than or equal to the payload reference count.
272 * Holding a reference to the payload part means that the user does not
273 * care about modifications to the header part of skb->data.
275 #define SKB_DATAREF_SHIFT 16
276 #define SKB_DATAREF_MASK ((1 << SKB_DATAREF_SHIFT) - 1)
280 SKB_FCLONE_UNAVAILABLE,
286 SKB_GSO_TCPV4 = 1 << 0,
287 SKB_GSO_UDP = 1 << 1,
289 /* This indicates the skb is from an untrusted source. */
290 SKB_GSO_DODGY = 1 << 2,
292 /* This indicates the tcp segment has CWR set. */
293 SKB_GSO_TCP_ECN = 1 << 3,
295 SKB_GSO_TCPV6 = 1 << 4,
297 SKB_GSO_FCOE = 1 << 5,
300 #if BITS_PER_LONG > 32
301 #define NET_SKBUFF_DATA_USES_OFFSET 1
304 #ifdef NET_SKBUFF_DATA_USES_OFFSET
305 typedef unsigned int sk_buff_data_t;
307 typedef unsigned char *sk_buff_data_t;
310 #if defined(CONFIG_NF_DEFRAG_IPV4) || defined(CONFIG_NF_DEFRAG_IPV4_MODULE) || \
311 defined(CONFIG_NF_DEFRAG_IPV6) || defined(CONFIG_NF_DEFRAG_IPV6_MODULE)
312 #define NET_SKBUFF_NF_DEFRAG_NEEDED 1
316 * struct sk_buff - socket buffer
317 * @next: Next buffer in list
318 * @prev: Previous buffer in list
319 * @tstamp: Time we arrived
320 * @sk: Socket we are owned by
321 * @dev: Device we arrived on/are leaving by
322 * @cb: Control buffer. Free for use by every layer. Put private vars here
323 * @_skb_refdst: destination entry (with norefcount bit)
324 * @sp: the security path, used for xfrm
325 * @len: Length of actual data
326 * @data_len: Data length
327 * @mac_len: Length of link layer header
328 * @hdr_len: writable header length of cloned skb
329 * @csum: Checksum (must include start/offset pair)
330 * @csum_start: Offset from skb->head where checksumming should start
331 * @csum_offset: Offset from csum_start where checksum should be stored
332 * @priority: Packet queueing priority
333 * @local_df: allow local fragmentation
334 * @cloned: Head may be cloned (check refcnt to be sure)
335 * @ip_summed: Driver fed us an IP checksum
336 * @nohdr: Payload reference only, must not modify header
337 * @nfctinfo: Relationship of this skb to the connection
338 * @pkt_type: Packet class
339 * @fclone: skbuff clone status
340 * @ipvs_property: skbuff is owned by ipvs
341 * @peeked: this packet has been seen already, so stats have been
342 * done for it, don't do them again
343 * @nf_trace: netfilter packet trace flag
344 * @protocol: Packet protocol from driver
345 * @destructor: Destruct function
346 * @nfct: Associated connection, if any
347 * @nfct_reasm: netfilter conntrack re-assembly pointer
348 * @nf_bridge: Saved data about a bridged frame - see br_netfilter.c
349 * @skb_iif: ifindex of device we arrived on
350 * @tc_index: Traffic control index
351 * @tc_verd: traffic control verdict
352 * @rxhash: the packet hash computed on receive
353 * @queue_mapping: Queue mapping for multiqueue devices
354 * @ndisc_nodetype: router type (from link layer)
355 * @ooo_okay: allow the mapping of a socket to a queue to be changed
356 * @l4_rxhash: indicate rxhash is a canonical 4-tuple hash over transport
358 * @wifi_acked_valid: wifi_acked was set
359 * @wifi_acked: whether frame was acked on wifi or not
360 * @dma_cookie: a cookie to one of several possible DMA operations
361 * done by skb DMA functions
362 * @secmark: security marking
363 * @mark: Generic packet mark
364 * @dropcount: total number of sk_receive_queue overflows
365 * @vlan_tci: vlan tag control information
366 * @transport_header: Transport layer header
367 * @network_header: Network layer header
368 * @mac_header: Link layer header
369 * @tail: Tail pointer
371 * @head: Head of buffer
372 * @data: Data head pointer
373 * @truesize: Buffer size
374 * @users: User count - see {datagram,tcp}.c
378 /* These two members must be first. */
379 struct sk_buff *next;
380 struct sk_buff *prev;
385 struct net_device *dev;
388 * This is the control buffer. It is free to use for every
389 * layer. Please put your private variables there. If you
390 * want to keep them across layers you have to do a skb_clone()
391 * first. This is owned by whoever has the skb queued ATM.
393 char cb[48] __aligned(8);
395 unsigned long _skb_refdst;
411 kmemcheck_bitfield_begin(flags1);
422 kmemcheck_bitfield_end(flags1);
425 void (*destructor)(struct sk_buff *skb);
426 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
427 struct nf_conntrack *nfct;
429 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
430 struct sk_buff *nfct_reasm;
432 #ifdef CONFIG_BRIDGE_NETFILTER
433 struct nf_bridge_info *nf_bridge;
437 #ifdef CONFIG_NET_SCHED
438 __u16 tc_index; /* traffic control index */
439 #ifdef CONFIG_NET_CLS_ACT
440 __u16 tc_verd; /* traffic control verdict */
447 kmemcheck_bitfield_begin(flags2);
448 #ifdef CONFIG_IPV6_NDISC_NODETYPE
449 __u8 ndisc_nodetype:2;
453 __u8 wifi_acked_valid:1;
455 /* 10/12 bit hole (depending on ndisc_nodetype presence) */
456 kmemcheck_bitfield_end(flags2);
458 #ifdef CONFIG_NET_DMA
459 dma_cookie_t dma_cookie;
461 #ifdef CONFIG_NETWORK_SECMARK
471 sk_buff_data_t transport_header;
472 sk_buff_data_t network_header;
473 sk_buff_data_t mac_header;
474 /* These elements must be at the end, see alloc_skb() for details. */
479 unsigned int truesize;
485 * Handling routines are only of interest to the kernel
487 #include <linux/slab.h>
489 #include <asm/system.h>
492 * skb might have a dst pointer attached, refcounted or not.
493 * _skb_refdst low order bit is set if refcount was _not_ taken
495 #define SKB_DST_NOREF 1UL
496 #define SKB_DST_PTRMASK ~(SKB_DST_NOREF)
499 * skb_dst - returns skb dst_entry
502 * Returns skb dst_entry, regardless of reference taken or not.
504 static inline struct dst_entry *skb_dst(const struct sk_buff *skb)
506 /* If refdst was not refcounted, check we still are in a
507 * rcu_read_lock section
509 WARN_ON((skb->_skb_refdst & SKB_DST_NOREF) &&
510 !rcu_read_lock_held() &&
511 !rcu_read_lock_bh_held());
512 return (struct dst_entry *)(skb->_skb_refdst & SKB_DST_PTRMASK);
516 * skb_dst_set - sets skb dst
520 * Sets skb dst, assuming a reference was taken on dst and should
521 * be released by skb_dst_drop()
523 static inline void skb_dst_set(struct sk_buff *skb, struct dst_entry *dst)
525 skb->_skb_refdst = (unsigned long)dst;
528 extern void skb_dst_set_noref(struct sk_buff *skb, struct dst_entry *dst);
531 * skb_dst_is_noref - Test if skb dst isn't refcounted
534 static inline bool skb_dst_is_noref(const struct sk_buff *skb)
536 return (skb->_skb_refdst & SKB_DST_NOREF) && skb_dst(skb);
539 static inline struct rtable *skb_rtable(const struct sk_buff *skb)
541 return (struct rtable *)skb_dst(skb);
544 extern void kfree_skb(struct sk_buff *skb);
545 extern void consume_skb(struct sk_buff *skb);
546 extern void __kfree_skb(struct sk_buff *skb);
547 extern struct sk_buff *__alloc_skb(unsigned int size,
548 gfp_t priority, int fclone, int node);
549 extern struct sk_buff *build_skb(void *data);
550 static inline struct sk_buff *alloc_skb(unsigned int size,
553 return __alloc_skb(size, priority, 0, NUMA_NO_NODE);
556 static inline struct sk_buff *alloc_skb_fclone(unsigned int size,
559 return __alloc_skb(size, priority, 1, NUMA_NO_NODE);
562 extern void skb_recycle(struct sk_buff *skb);
563 extern bool skb_recycle_check(struct sk_buff *skb, int skb_size);
565 extern struct sk_buff *skb_morph(struct sk_buff *dst, struct sk_buff *src);
566 extern int skb_copy_ubufs(struct sk_buff *skb, gfp_t gfp_mask);
567 extern struct sk_buff *skb_clone(struct sk_buff *skb,
569 extern struct sk_buff *skb_copy(const struct sk_buff *skb,
571 extern struct sk_buff *pskb_copy(struct sk_buff *skb,
573 extern int pskb_expand_head(struct sk_buff *skb,
574 int nhead, int ntail,
576 extern struct sk_buff *skb_realloc_headroom(struct sk_buff *skb,
577 unsigned int headroom);
578 extern struct sk_buff *skb_copy_expand(const struct sk_buff *skb,
579 int newheadroom, int newtailroom,
581 extern int skb_to_sgvec(struct sk_buff *skb,
582 struct scatterlist *sg, int offset,
584 extern int skb_cow_data(struct sk_buff *skb, int tailbits,
585 struct sk_buff **trailer);
586 extern int skb_pad(struct sk_buff *skb, int pad);
587 #define dev_kfree_skb(a) consume_skb(a)
589 extern int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb,
590 int getfrag(void *from, char *to, int offset,
591 int len,int odd, struct sk_buff *skb),
592 void *from, int length);
594 struct skb_seq_state {
598 __u32 stepped_offset;
599 struct sk_buff *root_skb;
600 struct sk_buff *cur_skb;
604 extern void skb_prepare_seq_read(struct sk_buff *skb,
605 unsigned int from, unsigned int to,
606 struct skb_seq_state *st);
607 extern unsigned int skb_seq_read(unsigned int consumed, const u8 **data,
608 struct skb_seq_state *st);
609 extern void skb_abort_seq_read(struct skb_seq_state *st);
611 extern unsigned int skb_find_text(struct sk_buff *skb, unsigned int from,
612 unsigned int to, struct ts_config *config,
613 struct ts_state *state);
615 extern void __skb_get_rxhash(struct sk_buff *skb);
616 static inline __u32 skb_get_rxhash(struct sk_buff *skb)
619 __skb_get_rxhash(skb);
624 #ifdef NET_SKBUFF_DATA_USES_OFFSET
625 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
627 return skb->head + skb->end;
630 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
637 #define skb_shinfo(SKB) ((struct skb_shared_info *)(skb_end_pointer(SKB)))
639 static inline struct skb_shared_hwtstamps *skb_hwtstamps(struct sk_buff *skb)
641 return &skb_shinfo(skb)->hwtstamps;
645 * skb_queue_empty - check if a queue is empty
648 * Returns true if the queue is empty, false otherwise.
650 static inline int skb_queue_empty(const struct sk_buff_head *list)
652 return list->next == (struct sk_buff *)list;
656 * skb_queue_is_last - check if skb is the last entry in the queue
660 * Returns true if @skb is the last buffer on the list.
662 static inline bool skb_queue_is_last(const struct sk_buff_head *list,
663 const struct sk_buff *skb)
665 return skb->next == (struct sk_buff *)list;
669 * skb_queue_is_first - check if skb is the first entry in the queue
673 * Returns true if @skb is the first buffer on the list.
675 static inline bool skb_queue_is_first(const struct sk_buff_head *list,
676 const struct sk_buff *skb)
678 return skb->prev == (struct sk_buff *)list;
682 * skb_queue_next - return the next packet in the queue
684 * @skb: current buffer
686 * Return the next packet in @list after @skb. It is only valid to
687 * call this if skb_queue_is_last() evaluates to false.
689 static inline struct sk_buff *skb_queue_next(const struct sk_buff_head *list,
690 const struct sk_buff *skb)
692 /* This BUG_ON may seem severe, but if we just return then we
693 * are going to dereference garbage.
695 BUG_ON(skb_queue_is_last(list, skb));
700 * skb_queue_prev - return the prev packet in the queue
702 * @skb: current buffer
704 * Return the prev packet in @list before @skb. It is only valid to
705 * call this if skb_queue_is_first() evaluates to false.
707 static inline struct sk_buff *skb_queue_prev(const struct sk_buff_head *list,
708 const struct sk_buff *skb)
710 /* This BUG_ON may seem severe, but if we just return then we
711 * are going to dereference garbage.
713 BUG_ON(skb_queue_is_first(list, skb));
718 * skb_get - reference buffer
719 * @skb: buffer to reference
721 * Makes another reference to a socket buffer and returns a pointer
724 static inline struct sk_buff *skb_get(struct sk_buff *skb)
726 atomic_inc(&skb->users);
731 * If users == 1, we are the only owner and are can avoid redundant
736 * skb_cloned - is the buffer a clone
737 * @skb: buffer to check
739 * Returns true if the buffer was generated with skb_clone() and is
740 * one of multiple shared copies of the buffer. Cloned buffers are
741 * shared data so must not be written to under normal circumstances.
743 static inline int skb_cloned(const struct sk_buff *skb)
745 return skb->cloned &&
746 (atomic_read(&skb_shinfo(skb)->dataref) & SKB_DATAREF_MASK) != 1;
750 * skb_header_cloned - is the header a clone
751 * @skb: buffer to check
753 * Returns true if modifying the header part of the buffer requires
754 * the data to be copied.
756 static inline int skb_header_cloned(const struct sk_buff *skb)
763 dataref = atomic_read(&skb_shinfo(skb)->dataref);
764 dataref = (dataref & SKB_DATAREF_MASK) - (dataref >> SKB_DATAREF_SHIFT);
769 * skb_header_release - release reference to header
770 * @skb: buffer to operate on
772 * Drop a reference to the header part of the buffer. This is done
773 * by acquiring a payload reference. You must not read from the header
774 * part of skb->data after this.
776 static inline void skb_header_release(struct sk_buff *skb)
780 atomic_add(1 << SKB_DATAREF_SHIFT, &skb_shinfo(skb)->dataref);
784 * skb_shared - is the buffer shared
785 * @skb: buffer to check
787 * Returns true if more than one person has a reference to this
790 static inline int skb_shared(const struct sk_buff *skb)
792 return atomic_read(&skb->users) != 1;
796 * skb_share_check - check if buffer is shared and if so clone it
797 * @skb: buffer to check
798 * @pri: priority for memory allocation
800 * If the buffer is shared the buffer is cloned and the old copy
801 * drops a reference. A new clone with a single reference is returned.
802 * If the buffer is not shared the original buffer is returned. When
803 * being called from interrupt status or with spinlocks held pri must
806 * NULL is returned on a memory allocation failure.
808 static inline struct sk_buff *skb_share_check(struct sk_buff *skb,
811 might_sleep_if(pri & __GFP_WAIT);
812 if (skb_shared(skb)) {
813 struct sk_buff *nskb = skb_clone(skb, pri);
821 * Copy shared buffers into a new sk_buff. We effectively do COW on
822 * packets to handle cases where we have a local reader and forward
823 * and a couple of other messy ones. The normal one is tcpdumping
824 * a packet thats being forwarded.
828 * skb_unshare - make a copy of a shared buffer
829 * @skb: buffer to check
830 * @pri: priority for memory allocation
832 * If the socket buffer is a clone then this function creates a new
833 * copy of the data, drops a reference count on the old copy and returns
834 * the new copy with the reference count at 1. If the buffer is not a clone
835 * the original buffer is returned. When called with a spinlock held or
836 * from interrupt state @pri must be %GFP_ATOMIC
838 * %NULL is returned on a memory allocation failure.
840 static inline struct sk_buff *skb_unshare(struct sk_buff *skb,
843 might_sleep_if(pri & __GFP_WAIT);
844 if (skb_cloned(skb)) {
845 struct sk_buff *nskb = skb_copy(skb, pri);
846 kfree_skb(skb); /* Free our shared copy */
853 * skb_peek - peek at the head of an &sk_buff_head
854 * @list_: list to peek at
856 * Peek an &sk_buff. Unlike most other operations you _MUST_
857 * be careful with this one. A peek leaves the buffer on the
858 * list and someone else may run off with it. You must hold
859 * the appropriate locks or have a private queue to do this.
861 * Returns %NULL for an empty list or a pointer to the head element.
862 * The reference count is not incremented and the reference is therefore
863 * volatile. Use with caution.
865 static inline struct sk_buff *skb_peek(const struct sk_buff_head *list_)
867 struct sk_buff *list = ((const struct sk_buff *)list_)->next;
868 if (list == (struct sk_buff *)list_)
874 * skb_peek_tail - peek at the tail of an &sk_buff_head
875 * @list_: list to peek at
877 * Peek an &sk_buff. Unlike most other operations you _MUST_
878 * be careful with this one. A peek leaves the buffer on the
879 * list and someone else may run off with it. You must hold
880 * the appropriate locks or have a private queue to do this.
882 * Returns %NULL for an empty list or a pointer to the tail element.
883 * The reference count is not incremented and the reference is therefore
884 * volatile. Use with caution.
886 static inline struct sk_buff *skb_peek_tail(const struct sk_buff_head *list_)
888 struct sk_buff *list = ((const struct sk_buff *)list_)->prev;
889 if (list == (struct sk_buff *)list_)
895 * skb_queue_len - get queue length
896 * @list_: list to measure
898 * Return the length of an &sk_buff queue.
900 static inline __u32 skb_queue_len(const struct sk_buff_head *list_)
906 * __skb_queue_head_init - initialize non-spinlock portions of sk_buff_head
907 * @list: queue to initialize
909 * This initializes only the list and queue length aspects of
910 * an sk_buff_head object. This allows to initialize the list
911 * aspects of an sk_buff_head without reinitializing things like
912 * the spinlock. It can also be used for on-stack sk_buff_head
913 * objects where the spinlock is known to not be used.
915 static inline void __skb_queue_head_init(struct sk_buff_head *list)
917 list->prev = list->next = (struct sk_buff *)list;
922 * This function creates a split out lock class for each invocation;
923 * this is needed for now since a whole lot of users of the skb-queue
924 * infrastructure in drivers have different locking usage (in hardirq)
925 * than the networking core (in softirq only). In the long run either the
926 * network layer or drivers should need annotation to consolidate the
927 * main types of usage into 3 classes.
929 static inline void skb_queue_head_init(struct sk_buff_head *list)
931 spin_lock_init(&list->lock);
932 __skb_queue_head_init(list);
935 static inline void skb_queue_head_init_class(struct sk_buff_head *list,
936 struct lock_class_key *class)
938 skb_queue_head_init(list);
939 lockdep_set_class(&list->lock, class);
943 * Insert an sk_buff on a list.
945 * The "__skb_xxxx()" functions are the non-atomic ones that
946 * can only be called with interrupts disabled.
948 extern void skb_insert(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list);
949 static inline void __skb_insert(struct sk_buff *newsk,
950 struct sk_buff *prev, struct sk_buff *next,
951 struct sk_buff_head *list)
955 next->prev = prev->next = newsk;
959 static inline void __skb_queue_splice(const struct sk_buff_head *list,
960 struct sk_buff *prev,
961 struct sk_buff *next)
963 struct sk_buff *first = list->next;
964 struct sk_buff *last = list->prev;
974 * skb_queue_splice - join two skb lists, this is designed for stacks
975 * @list: the new list to add
976 * @head: the place to add it in the first list
978 static inline void skb_queue_splice(const struct sk_buff_head *list,
979 struct sk_buff_head *head)
981 if (!skb_queue_empty(list)) {
982 __skb_queue_splice(list, (struct sk_buff *) head, head->next);
983 head->qlen += list->qlen;
988 * skb_queue_splice - join two skb lists and reinitialise the emptied list
989 * @list: the new list to add
990 * @head: the place to add it in the first list
992 * The list at @list is reinitialised
994 static inline void skb_queue_splice_init(struct sk_buff_head *list,
995 struct sk_buff_head *head)
997 if (!skb_queue_empty(list)) {
998 __skb_queue_splice(list, (struct sk_buff *) head, head->next);
999 head->qlen += list->qlen;
1000 __skb_queue_head_init(list);
1005 * skb_queue_splice_tail - join two skb lists, each list being a queue
1006 * @list: the new list to add
1007 * @head: the place to add it in the first list
1009 static inline void skb_queue_splice_tail(const struct sk_buff_head *list,
1010 struct sk_buff_head *head)
1012 if (!skb_queue_empty(list)) {
1013 __skb_queue_splice(list, head->prev, (struct sk_buff *) head);
1014 head->qlen += list->qlen;
1019 * skb_queue_splice_tail - join two skb lists and reinitialise the emptied list
1020 * @list: the new list to add
1021 * @head: the place to add it in the first list
1023 * Each of the lists is a queue.
1024 * The list at @list is reinitialised
1026 static inline void skb_queue_splice_tail_init(struct sk_buff_head *list,
1027 struct sk_buff_head *head)
1029 if (!skb_queue_empty(list)) {
1030 __skb_queue_splice(list, head->prev, (struct sk_buff *) head);
1031 head->qlen += list->qlen;
1032 __skb_queue_head_init(list);
1037 * __skb_queue_after - queue a buffer at the list head
1038 * @list: list to use
1039 * @prev: place after this buffer
1040 * @newsk: buffer to queue
1042 * Queue a buffer int the middle of a list. This function takes no locks
1043 * and you must therefore hold required locks before calling it.
1045 * A buffer cannot be placed on two lists at the same time.
1047 static inline void __skb_queue_after(struct sk_buff_head *list,
1048 struct sk_buff *prev,
1049 struct sk_buff *newsk)
1051 __skb_insert(newsk, prev, prev->next, list);
1054 extern void skb_append(struct sk_buff *old, struct sk_buff *newsk,
1055 struct sk_buff_head *list);
1057 static inline void __skb_queue_before(struct sk_buff_head *list,
1058 struct sk_buff *next,
1059 struct sk_buff *newsk)
1061 __skb_insert(newsk, next->prev, next, list);
1065 * __skb_queue_head - queue a buffer at the list head
1066 * @list: list to use
1067 * @newsk: buffer to queue
1069 * Queue a buffer at the start of a list. This function takes no locks
1070 * and you must therefore hold required locks before calling it.
1072 * A buffer cannot be placed on two lists at the same time.
1074 extern void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk);
1075 static inline void __skb_queue_head(struct sk_buff_head *list,
1076 struct sk_buff *newsk)
1078 __skb_queue_after(list, (struct sk_buff *)list, newsk);
1082 * __skb_queue_tail - queue a buffer at the list tail
1083 * @list: list to use
1084 * @newsk: buffer to queue
1086 * Queue a buffer at the end of a list. This function takes no locks
1087 * and you must therefore hold required locks before calling it.
1089 * A buffer cannot be placed on two lists at the same time.
1091 extern void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk);
1092 static inline void __skb_queue_tail(struct sk_buff_head *list,
1093 struct sk_buff *newsk)
1095 __skb_queue_before(list, (struct sk_buff *)list, newsk);
1099 * remove sk_buff from list. _Must_ be called atomically, and with
1102 extern void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list);
1103 static inline void __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
1105 struct sk_buff *next, *prev;
1110 skb->next = skb->prev = NULL;
1116 * __skb_dequeue - remove from the head of the queue
1117 * @list: list to dequeue from
1119 * Remove the head of the list. This function does not take any locks
1120 * so must be used with appropriate locks held only. The head item is
1121 * returned or %NULL if the list is empty.
1123 extern struct sk_buff *skb_dequeue(struct sk_buff_head *list);
1124 static inline struct sk_buff *__skb_dequeue(struct sk_buff_head *list)
1126 struct sk_buff *skb = skb_peek(list);
1128 __skb_unlink(skb, list);
1133 * __skb_dequeue_tail - remove from the tail of the queue
1134 * @list: list to dequeue from
1136 * Remove the tail of the list. This function does not take any locks
1137 * so must be used with appropriate locks held only. The tail item is
1138 * returned or %NULL if the list is empty.
1140 extern struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list);
1141 static inline struct sk_buff *__skb_dequeue_tail(struct sk_buff_head *list)
1143 struct sk_buff *skb = skb_peek_tail(list);
1145 __skb_unlink(skb, list);
1150 static inline int skb_is_nonlinear(const struct sk_buff *skb)
1152 return skb->data_len;
1155 static inline unsigned int skb_headlen(const struct sk_buff *skb)
1157 return skb->len - skb->data_len;
1160 static inline int skb_pagelen(const struct sk_buff *skb)
1164 for (i = (int)skb_shinfo(skb)->nr_frags - 1; i >= 0; i--)
1165 len += skb_frag_size(&skb_shinfo(skb)->frags[i]);
1166 return len + skb_headlen(skb);
1170 * __skb_fill_page_desc - initialise a paged fragment in an skb
1171 * @skb: buffer containing fragment to be initialised
1172 * @i: paged fragment index to initialise
1173 * @page: the page to use for this fragment
1174 * @off: the offset to the data with @page
1175 * @size: the length of the data
1177 * Initialises the @i'th fragment of @skb to point to &size bytes at
1178 * offset @off within @page.
1180 * Does not take any additional reference on the fragment.
1182 static inline void __skb_fill_page_desc(struct sk_buff *skb, int i,
1183 struct page *page, int off, int size)
1185 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
1187 frag->page.p = page;
1188 frag->page_offset = off;
1189 skb_frag_size_set(frag, size);
1193 * skb_fill_page_desc - initialise a paged fragment in an skb
1194 * @skb: buffer containing fragment to be initialised
1195 * @i: paged fragment index to initialise
1196 * @page: the page to use for this fragment
1197 * @off: the offset to the data with @page
1198 * @size: the length of the data
1200 * As per __skb_fill_page_desc() -- initialises the @i'th fragment of
1201 * @skb to point to &size bytes at offset @off within @page. In
1202 * addition updates @skb such that @i is the last fragment.
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_fill_page_desc(skb, i, page, off, size);
1210 skb_shinfo(skb)->nr_frags = i + 1;
1213 extern void skb_add_rx_frag(struct sk_buff *skb, int i, struct page *page,
1216 #define SKB_PAGE_ASSERT(skb) BUG_ON(skb_shinfo(skb)->nr_frags)
1217 #define SKB_FRAG_ASSERT(skb) BUG_ON(skb_has_frag_list(skb))
1218 #define SKB_LINEAR_ASSERT(skb) BUG_ON(skb_is_nonlinear(skb))
1220 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1221 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
1223 return skb->head + skb->tail;
1226 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
1228 skb->tail = skb->data - skb->head;
1231 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
1233 skb_reset_tail_pointer(skb);
1234 skb->tail += offset;
1236 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1237 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
1242 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
1244 skb->tail = skb->data;
1247 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
1249 skb->tail = skb->data + offset;
1252 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1255 * Add data to an sk_buff
1257 extern unsigned char *skb_put(struct sk_buff *skb, unsigned int len);
1258 static inline unsigned char *__skb_put(struct sk_buff *skb, unsigned int len)
1260 unsigned char *tmp = skb_tail_pointer(skb);
1261 SKB_LINEAR_ASSERT(skb);
1267 extern unsigned char *skb_push(struct sk_buff *skb, unsigned int len);
1268 static inline unsigned char *__skb_push(struct sk_buff *skb, unsigned int len)
1275 extern unsigned char *skb_pull(struct sk_buff *skb, unsigned int len);
1276 static inline unsigned char *__skb_pull(struct sk_buff *skb, unsigned int len)
1279 BUG_ON(skb->len < skb->data_len);
1280 return skb->data += len;
1283 static inline unsigned char *skb_pull_inline(struct sk_buff *skb, unsigned int len)
1285 return unlikely(len > skb->len) ? NULL : __skb_pull(skb, len);
1288 extern unsigned char *__pskb_pull_tail(struct sk_buff *skb, int delta);
1290 static inline unsigned char *__pskb_pull(struct sk_buff *skb, unsigned int len)
1292 if (len > skb_headlen(skb) &&
1293 !__pskb_pull_tail(skb, len - skb_headlen(skb)))
1296 return skb->data += len;
1299 static inline unsigned char *pskb_pull(struct sk_buff *skb, unsigned int len)
1301 return unlikely(len > skb->len) ? NULL : __pskb_pull(skb, len);
1304 static inline int pskb_may_pull(struct sk_buff *skb, unsigned int len)
1306 if (likely(len <= skb_headlen(skb)))
1308 if (unlikely(len > skb->len))
1310 return __pskb_pull_tail(skb, len - skb_headlen(skb)) != NULL;
1314 * skb_headroom - bytes at buffer head
1315 * @skb: buffer to check
1317 * Return the number of bytes of free space at the head of an &sk_buff.
1319 static inline unsigned int skb_headroom(const struct sk_buff *skb)
1321 return skb->data - skb->head;
1325 * skb_tailroom - bytes at buffer end
1326 * @skb: buffer to check
1328 * Return the number of bytes of free space at the tail of an sk_buff
1330 static inline int skb_tailroom(const struct sk_buff *skb)
1332 return skb_is_nonlinear(skb) ? 0 : skb->end - skb->tail;
1336 * skb_reserve - adjust headroom
1337 * @skb: buffer to alter
1338 * @len: bytes to move
1340 * Increase the headroom of an empty &sk_buff by reducing the tail
1341 * room. This is only allowed for an empty buffer.
1343 static inline void skb_reserve(struct sk_buff *skb, int len)
1349 static inline void skb_reset_mac_len(struct sk_buff *skb)
1351 skb->mac_len = skb->network_header - skb->mac_header;
1354 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1355 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
1357 return skb->head + skb->transport_header;
1360 static inline void skb_reset_transport_header(struct sk_buff *skb)
1362 skb->transport_header = skb->data - skb->head;
1365 static inline void skb_set_transport_header(struct sk_buff *skb,
1368 skb_reset_transport_header(skb);
1369 skb->transport_header += offset;
1372 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
1374 return skb->head + skb->network_header;
1377 static inline void skb_reset_network_header(struct sk_buff *skb)
1379 skb->network_header = skb->data - skb->head;
1382 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1384 skb_reset_network_header(skb);
1385 skb->network_header += offset;
1388 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1390 return skb->head + skb->mac_header;
1393 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1395 return skb->mac_header != ~0U;
1398 static inline void skb_reset_mac_header(struct sk_buff *skb)
1400 skb->mac_header = skb->data - skb->head;
1403 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1405 skb_reset_mac_header(skb);
1406 skb->mac_header += offset;
1409 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1411 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
1413 return skb->transport_header;
1416 static inline void skb_reset_transport_header(struct sk_buff *skb)
1418 skb->transport_header = skb->data;
1421 static inline void skb_set_transport_header(struct sk_buff *skb,
1424 skb->transport_header = skb->data + offset;
1427 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
1429 return skb->network_header;
1432 static inline void skb_reset_network_header(struct sk_buff *skb)
1434 skb->network_header = skb->data;
1437 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1439 skb->network_header = skb->data + offset;
1442 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1444 return skb->mac_header;
1447 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1449 return skb->mac_header != NULL;
1452 static inline void skb_reset_mac_header(struct sk_buff *skb)
1454 skb->mac_header = skb->data;
1457 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1459 skb->mac_header = skb->data + offset;
1461 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1463 static inline int skb_checksum_start_offset(const struct sk_buff *skb)
1465 return skb->csum_start - skb_headroom(skb);
1468 static inline int skb_transport_offset(const struct sk_buff *skb)
1470 return skb_transport_header(skb) - skb->data;
1473 static inline u32 skb_network_header_len(const struct sk_buff *skb)
1475 return skb->transport_header - skb->network_header;
1478 static inline int skb_network_offset(const struct sk_buff *skb)
1480 return skb_network_header(skb) - skb->data;
1483 static inline int pskb_network_may_pull(struct sk_buff *skb, unsigned int len)
1485 return pskb_may_pull(skb, skb_network_offset(skb) + len);
1489 * CPUs often take a performance hit when accessing unaligned memory
1490 * locations. The actual performance hit varies, it can be small if the
1491 * hardware handles it or large if we have to take an exception and fix it
1494 * Since an ethernet header is 14 bytes network drivers often end up with
1495 * the IP header at an unaligned offset. The IP header can be aligned by
1496 * shifting the start of the packet by 2 bytes. Drivers should do this
1499 * skb_reserve(skb, NET_IP_ALIGN);
1501 * The downside to this alignment of the IP header is that the DMA is now
1502 * unaligned. On some architectures the cost of an unaligned DMA is high
1503 * and this cost outweighs the gains made by aligning the IP header.
1505 * Since this trade off varies between architectures, we allow NET_IP_ALIGN
1508 #ifndef NET_IP_ALIGN
1509 #define NET_IP_ALIGN 2
1513 * The networking layer reserves some headroom in skb data (via
1514 * dev_alloc_skb). This is used to avoid having to reallocate skb data when
1515 * the header has to grow. In the default case, if the header has to grow
1516 * 32 bytes or less we avoid the reallocation.
1518 * Unfortunately this headroom changes the DMA alignment of the resulting
1519 * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive
1520 * on some architectures. An architecture can override this value,
1521 * perhaps setting it to a cacheline in size (since that will maintain
1522 * cacheline alignment of the DMA). It must be a power of 2.
1524 * Various parts of the networking layer expect at least 32 bytes of
1525 * headroom, you should not reduce this.
1527 * Using max(32, L1_CACHE_BYTES) makes sense (especially with RPS)
1528 * to reduce average number of cache lines per packet.
1529 * get_rps_cpus() for example only access one 64 bytes aligned block :
1530 * NET_IP_ALIGN(2) + ethernet_header(14) + IP_header(20/40) + ports(8)
1533 #define NET_SKB_PAD max(32, L1_CACHE_BYTES)
1536 extern int ___pskb_trim(struct sk_buff *skb, unsigned int len);
1538 static inline void __skb_trim(struct sk_buff *skb, unsigned int len)
1540 if (unlikely(skb_is_nonlinear(skb))) {
1545 skb_set_tail_pointer(skb, len);
1548 extern void skb_trim(struct sk_buff *skb, unsigned int len);
1550 static inline int __pskb_trim(struct sk_buff *skb, unsigned int len)
1553 return ___pskb_trim(skb, len);
1554 __skb_trim(skb, len);
1558 static inline int pskb_trim(struct sk_buff *skb, unsigned int len)
1560 return (len < skb->len) ? __pskb_trim(skb, len) : 0;
1564 * pskb_trim_unique - remove end from a paged unique (not cloned) buffer
1565 * @skb: buffer to alter
1568 * This is identical to pskb_trim except that the caller knows that
1569 * the skb is not cloned so we should never get an error due to out-
1572 static inline void pskb_trim_unique(struct sk_buff *skb, unsigned int len)
1574 int err = pskb_trim(skb, len);
1579 * skb_orphan - orphan a buffer
1580 * @skb: buffer to orphan
1582 * If a buffer currently has an owner then we call the owner's
1583 * destructor function and make the @skb unowned. The buffer continues
1584 * to exist but is no longer charged to its former owner.
1586 static inline void skb_orphan(struct sk_buff *skb)
1588 if (skb->destructor)
1589 skb->destructor(skb);
1590 skb->destructor = NULL;
1595 * __skb_queue_purge - empty a list
1596 * @list: list to empty
1598 * Delete all buffers on an &sk_buff list. Each buffer is removed from
1599 * the list and one reference dropped. This function does not take the
1600 * list lock and the caller must hold the relevant locks to use it.
1602 extern void skb_queue_purge(struct sk_buff_head *list);
1603 static inline void __skb_queue_purge(struct sk_buff_head *list)
1605 struct sk_buff *skb;
1606 while ((skb = __skb_dequeue(list)) != NULL)
1611 * __dev_alloc_skb - allocate an skbuff for receiving
1612 * @length: length to allocate
1613 * @gfp_mask: get_free_pages mask, passed to alloc_skb
1615 * Allocate a new &sk_buff and assign it a usage count of one. The
1616 * buffer has unspecified headroom built in. Users should allocate
1617 * the headroom they think they need without accounting for the
1618 * built in space. The built in space is used for optimisations.
1620 * %NULL is returned if there is no free memory.
1622 static inline struct sk_buff *__dev_alloc_skb(unsigned int length,
1625 struct sk_buff *skb = alloc_skb(length + NET_SKB_PAD, gfp_mask);
1627 skb_reserve(skb, NET_SKB_PAD);
1631 extern struct sk_buff *dev_alloc_skb(unsigned int length);
1633 extern struct sk_buff *__netdev_alloc_skb(struct net_device *dev,
1634 unsigned int length, gfp_t gfp_mask);
1637 * netdev_alloc_skb - allocate an skbuff for rx on a specific device
1638 * @dev: network device to receive on
1639 * @length: length to allocate
1641 * Allocate a new &sk_buff and assign it a usage count of one. The
1642 * buffer has unspecified headroom built in. Users should allocate
1643 * the headroom they think they need without accounting for the
1644 * built in space. The built in space is used for optimisations.
1646 * %NULL is returned if there is no free memory. Although this function
1647 * allocates memory it can be called from an interrupt.
1649 static inline struct sk_buff *netdev_alloc_skb(struct net_device *dev,
1650 unsigned int length)
1652 return __netdev_alloc_skb(dev, length, GFP_ATOMIC);
1655 static inline struct sk_buff *__netdev_alloc_skb_ip_align(struct net_device *dev,
1656 unsigned int length, gfp_t gfp)
1658 struct sk_buff *skb = __netdev_alloc_skb(dev, length + NET_IP_ALIGN, gfp);
1660 if (NET_IP_ALIGN && skb)
1661 skb_reserve(skb, NET_IP_ALIGN);
1665 static inline struct sk_buff *netdev_alloc_skb_ip_align(struct net_device *dev,
1666 unsigned int length)
1668 return __netdev_alloc_skb_ip_align(dev, length, GFP_ATOMIC);
1672 * __netdev_alloc_page - allocate a page for ps-rx on a specific device
1673 * @dev: network device to receive on
1674 * @gfp_mask: alloc_pages_node mask
1676 * Allocate a new page. dev currently unused.
1678 * %NULL is returned if there is no free memory.
1680 static inline struct page *__netdev_alloc_page(struct net_device *dev, gfp_t gfp_mask)
1682 return alloc_pages_node(NUMA_NO_NODE, gfp_mask, 0);
1686 * netdev_alloc_page - allocate a page for ps-rx on a specific device
1687 * @dev: network device to receive on
1689 * Allocate a new page. dev currently unused.
1691 * %NULL is returned if there is no free memory.
1693 static inline struct page *netdev_alloc_page(struct net_device *dev)
1695 return __netdev_alloc_page(dev, GFP_ATOMIC);
1698 static inline void netdev_free_page(struct net_device *dev, struct page *page)
1704 * skb_frag_page - retrieve the page refered to by a paged fragment
1705 * @frag: the paged fragment
1707 * Returns the &struct page associated with @frag.
1709 static inline struct page *skb_frag_page(const skb_frag_t *frag)
1711 return frag->page.p;
1715 * __skb_frag_ref - take an addition reference on a paged fragment.
1716 * @frag: the paged fragment
1718 * Takes an additional reference on the paged fragment @frag.
1720 static inline void __skb_frag_ref(skb_frag_t *frag)
1722 get_page(skb_frag_page(frag));
1726 * skb_frag_ref - take an addition reference on a paged fragment of an skb.
1728 * @f: the fragment offset.
1730 * Takes an additional reference on the @f'th paged fragment of @skb.
1732 static inline void skb_frag_ref(struct sk_buff *skb, int f)
1734 __skb_frag_ref(&skb_shinfo(skb)->frags[f]);
1738 * __skb_frag_unref - release a reference on a paged fragment.
1739 * @frag: the paged fragment
1741 * Releases a reference on the paged fragment @frag.
1743 static inline void __skb_frag_unref(skb_frag_t *frag)
1745 put_page(skb_frag_page(frag));
1749 * skb_frag_unref - release a reference on a paged fragment of an skb.
1751 * @f: the fragment offset
1753 * Releases a reference on the @f'th paged fragment of @skb.
1755 static inline void skb_frag_unref(struct sk_buff *skb, int f)
1757 __skb_frag_unref(&skb_shinfo(skb)->frags[f]);
1761 * skb_frag_address - gets the address of the data contained in a paged fragment
1762 * @frag: the paged fragment buffer
1764 * Returns the address of the data within @frag. The page must already
1767 static inline void *skb_frag_address(const skb_frag_t *frag)
1769 return page_address(skb_frag_page(frag)) + frag->page_offset;
1773 * skb_frag_address_safe - gets the address of the data contained in a paged fragment
1774 * @frag: the paged fragment buffer
1776 * Returns the address of the data within @frag. Checks that the page
1777 * is mapped and returns %NULL otherwise.
1779 static inline void *skb_frag_address_safe(const skb_frag_t *frag)
1781 void *ptr = page_address(skb_frag_page(frag));
1785 return ptr + frag->page_offset;
1789 * __skb_frag_set_page - sets the page contained in a paged fragment
1790 * @frag: the paged fragment
1791 * @page: the page to set
1793 * Sets the fragment @frag to contain @page.
1795 static inline void __skb_frag_set_page(skb_frag_t *frag, struct page *page)
1797 frag->page.p = page;
1801 * skb_frag_set_page - sets the page contained in a paged fragment of an skb
1803 * @f: the fragment offset
1804 * @page: the page to set
1806 * Sets the @f'th fragment of @skb to contain @page.
1808 static inline void skb_frag_set_page(struct sk_buff *skb, int f,
1811 __skb_frag_set_page(&skb_shinfo(skb)->frags[f], page);
1815 * skb_frag_dma_map - maps a paged fragment via the DMA API
1816 * @dev: the device to map the fragment to
1817 * @frag: the paged fragment to map
1818 * @offset: the offset within the fragment (starting at the
1819 * fragment's own offset)
1820 * @size: the number of bytes to map
1821 * @dir: the direction of the mapping (%PCI_DMA_*)
1823 * Maps the page associated with @frag to @device.
1825 static inline dma_addr_t skb_frag_dma_map(struct device *dev,
1826 const skb_frag_t *frag,
1827 size_t offset, size_t size,
1828 enum dma_data_direction dir)
1830 return dma_map_page(dev, skb_frag_page(frag),
1831 frag->page_offset + offset, size, dir);
1835 * skb_clone_writable - is the header of a clone writable
1836 * @skb: buffer to check
1837 * @len: length up to which to write
1839 * Returns true if modifying the header part of the cloned buffer
1840 * does not requires the data to be copied.
1842 static inline int skb_clone_writable(const struct sk_buff *skb, unsigned int len)
1844 return !skb_header_cloned(skb) &&
1845 skb_headroom(skb) + len <= skb->hdr_len;
1848 static inline int __skb_cow(struct sk_buff *skb, unsigned int headroom,
1853 if (headroom < NET_SKB_PAD)
1854 headroom = NET_SKB_PAD;
1855 if (headroom > skb_headroom(skb))
1856 delta = headroom - skb_headroom(skb);
1858 if (delta || cloned)
1859 return pskb_expand_head(skb, ALIGN(delta, NET_SKB_PAD), 0,
1865 * skb_cow - copy header of skb when it is required
1866 * @skb: buffer to cow
1867 * @headroom: needed headroom
1869 * If the skb passed lacks sufficient headroom or its data part
1870 * is shared, data is reallocated. If reallocation fails, an error
1871 * is returned and original skb is not changed.
1873 * The result is skb with writable area skb->head...skb->tail
1874 * and at least @headroom of space at head.
1876 static inline int skb_cow(struct sk_buff *skb, unsigned int headroom)
1878 return __skb_cow(skb, headroom, skb_cloned(skb));
1882 * skb_cow_head - skb_cow but only making the head writable
1883 * @skb: buffer to cow
1884 * @headroom: needed headroom
1886 * This function is identical to skb_cow except that we replace the
1887 * skb_cloned check by skb_header_cloned. It should be used when
1888 * you only need to push on some header and do not need to modify
1891 static inline int skb_cow_head(struct sk_buff *skb, unsigned int headroom)
1893 return __skb_cow(skb, headroom, skb_header_cloned(skb));
1897 * skb_padto - pad an skbuff up to a minimal size
1898 * @skb: buffer to pad
1899 * @len: minimal length
1901 * Pads up a buffer to ensure the trailing bytes exist and are
1902 * blanked. If the buffer already contains sufficient data it
1903 * is untouched. Otherwise it is extended. Returns zero on
1904 * success. The skb is freed on error.
1907 static inline int skb_padto(struct sk_buff *skb, unsigned int len)
1909 unsigned int size = skb->len;
1910 if (likely(size >= len))
1912 return skb_pad(skb, len - size);
1915 static inline int skb_add_data(struct sk_buff *skb,
1916 char __user *from, int copy)
1918 const int off = skb->len;
1920 if (skb->ip_summed == CHECKSUM_NONE) {
1922 __wsum csum = csum_and_copy_from_user(from, skb_put(skb, copy),
1925 skb->csum = csum_block_add(skb->csum, csum, off);
1928 } else if (!copy_from_user(skb_put(skb, copy), from, copy))
1931 __skb_trim(skb, off);
1935 static inline int skb_can_coalesce(struct sk_buff *skb, int i,
1936 const struct page *page, int off)
1939 const struct skb_frag_struct *frag = &skb_shinfo(skb)->frags[i - 1];
1941 return page == skb_frag_page(frag) &&
1942 off == frag->page_offset + skb_frag_size(frag);
1947 static inline int __skb_linearize(struct sk_buff *skb)
1949 return __pskb_pull_tail(skb, skb->data_len) ? 0 : -ENOMEM;
1953 * skb_linearize - convert paged skb to linear one
1954 * @skb: buffer to linarize
1956 * If there is no free memory -ENOMEM is returned, otherwise zero
1957 * is returned and the old skb data released.
1959 static inline int skb_linearize(struct sk_buff *skb)
1961 return skb_is_nonlinear(skb) ? __skb_linearize(skb) : 0;
1965 * skb_linearize_cow - make sure skb is linear and writable
1966 * @skb: buffer to process
1968 * If there is no free memory -ENOMEM is returned, otherwise zero
1969 * is returned and the old skb data released.
1971 static inline int skb_linearize_cow(struct sk_buff *skb)
1973 return skb_is_nonlinear(skb) || skb_cloned(skb) ?
1974 __skb_linearize(skb) : 0;
1978 * skb_postpull_rcsum - update checksum for received skb after pull
1979 * @skb: buffer to update
1980 * @start: start of data before pull
1981 * @len: length of data pulled
1983 * After doing a pull on a received packet, you need to call this to
1984 * update the CHECKSUM_COMPLETE checksum, or set ip_summed to
1985 * CHECKSUM_NONE so that it can be recomputed from scratch.
1988 static inline void skb_postpull_rcsum(struct sk_buff *skb,
1989 const void *start, unsigned int len)
1991 if (skb->ip_summed == CHECKSUM_COMPLETE)
1992 skb->csum = csum_sub(skb->csum, csum_partial(start, len, 0));
1995 unsigned char *skb_pull_rcsum(struct sk_buff *skb, unsigned int len);
1998 * pskb_trim_rcsum - trim received skb and update checksum
1999 * @skb: buffer to trim
2002 * This is exactly the same as pskb_trim except that it ensures the
2003 * checksum of received packets are still valid after the operation.
2006 static inline int pskb_trim_rcsum(struct sk_buff *skb, unsigned int len)
2008 if (likely(len >= skb->len))
2010 if (skb->ip_summed == CHECKSUM_COMPLETE)
2011 skb->ip_summed = CHECKSUM_NONE;
2012 return __pskb_trim(skb, len);
2015 #define skb_queue_walk(queue, skb) \
2016 for (skb = (queue)->next; \
2017 skb != (struct sk_buff *)(queue); \
2020 #define skb_queue_walk_safe(queue, skb, tmp) \
2021 for (skb = (queue)->next, tmp = skb->next; \
2022 skb != (struct sk_buff *)(queue); \
2023 skb = tmp, tmp = skb->next)
2025 #define skb_queue_walk_from(queue, skb) \
2026 for (; skb != (struct sk_buff *)(queue); \
2029 #define skb_queue_walk_from_safe(queue, skb, tmp) \
2030 for (tmp = skb->next; \
2031 skb != (struct sk_buff *)(queue); \
2032 skb = tmp, tmp = skb->next)
2034 #define skb_queue_reverse_walk(queue, skb) \
2035 for (skb = (queue)->prev; \
2036 skb != (struct sk_buff *)(queue); \
2039 #define skb_queue_reverse_walk_safe(queue, skb, tmp) \
2040 for (skb = (queue)->prev, tmp = skb->prev; \
2041 skb != (struct sk_buff *)(queue); \
2042 skb = tmp, tmp = skb->prev)
2044 #define skb_queue_reverse_walk_from_safe(queue, skb, tmp) \
2045 for (tmp = skb->prev; \
2046 skb != (struct sk_buff *)(queue); \
2047 skb = tmp, tmp = skb->prev)
2049 static inline bool skb_has_frag_list(const struct sk_buff *skb)
2051 return skb_shinfo(skb)->frag_list != NULL;
2054 static inline void skb_frag_list_init(struct sk_buff *skb)
2056 skb_shinfo(skb)->frag_list = NULL;
2059 static inline void skb_frag_add_head(struct sk_buff *skb, struct sk_buff *frag)
2061 frag->next = skb_shinfo(skb)->frag_list;
2062 skb_shinfo(skb)->frag_list = frag;
2065 #define skb_walk_frags(skb, iter) \
2066 for (iter = skb_shinfo(skb)->frag_list; iter; iter = iter->next)
2068 extern struct sk_buff *__skb_recv_datagram(struct sock *sk, unsigned flags,
2069 int *peeked, int *err);
2070 extern struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags,
2071 int noblock, int *err);
2072 extern unsigned int datagram_poll(struct file *file, struct socket *sock,
2073 struct poll_table_struct *wait);
2074 extern int skb_copy_datagram_iovec(const struct sk_buff *from,
2075 int offset, struct iovec *to,
2077 extern int skb_copy_and_csum_datagram_iovec(struct sk_buff *skb,
2080 extern int skb_copy_datagram_from_iovec(struct sk_buff *skb,
2082 const struct iovec *from,
2085 extern int skb_copy_datagram_const_iovec(const struct sk_buff *from,
2087 const struct iovec *to,
2090 extern void skb_free_datagram(struct sock *sk, struct sk_buff *skb);
2091 extern void skb_free_datagram_locked(struct sock *sk,
2092 struct sk_buff *skb);
2093 extern int skb_kill_datagram(struct sock *sk, struct sk_buff *skb,
2094 unsigned int flags);
2095 extern __wsum skb_checksum(const struct sk_buff *skb, int offset,
2096 int len, __wsum csum);
2097 extern int skb_copy_bits(const struct sk_buff *skb, int offset,
2099 extern int skb_store_bits(struct sk_buff *skb, int offset,
2100 const void *from, int len);
2101 extern __wsum skb_copy_and_csum_bits(const struct sk_buff *skb,
2102 int offset, u8 *to, int len,
2104 extern int skb_splice_bits(struct sk_buff *skb,
2105 unsigned int offset,
2106 struct pipe_inode_info *pipe,
2108 unsigned int flags);
2109 extern void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to);
2110 extern void skb_split(struct sk_buff *skb,
2111 struct sk_buff *skb1, const u32 len);
2112 extern int skb_shift(struct sk_buff *tgt, struct sk_buff *skb,
2115 extern struct sk_buff *skb_segment(struct sk_buff *skb,
2116 netdev_features_t features);
2118 static inline void *skb_header_pointer(const struct sk_buff *skb, int offset,
2119 int len, void *buffer)
2121 int hlen = skb_headlen(skb);
2123 if (hlen - offset >= len)
2124 return skb->data + offset;
2126 if (skb_copy_bits(skb, offset, buffer, len) < 0)
2132 static inline void skb_copy_from_linear_data(const struct sk_buff *skb,
2134 const unsigned int len)
2136 memcpy(to, skb->data, len);
2139 static inline void skb_copy_from_linear_data_offset(const struct sk_buff *skb,
2140 const int offset, void *to,
2141 const unsigned int len)
2143 memcpy(to, skb->data + offset, len);
2146 static inline void skb_copy_to_linear_data(struct sk_buff *skb,
2148 const unsigned int len)
2150 memcpy(skb->data, from, len);
2153 static inline void skb_copy_to_linear_data_offset(struct sk_buff *skb,
2156 const unsigned int len)
2158 memcpy(skb->data + offset, from, len);
2161 extern void skb_init(void);
2163 static inline ktime_t skb_get_ktime(const struct sk_buff *skb)
2169 * skb_get_timestamp - get timestamp from a skb
2170 * @skb: skb to get stamp from
2171 * @stamp: pointer to struct timeval to store stamp in
2173 * Timestamps are stored in the skb as offsets to a base timestamp.
2174 * This function converts the offset back to a struct timeval and stores
2177 static inline void skb_get_timestamp(const struct sk_buff *skb,
2178 struct timeval *stamp)
2180 *stamp = ktime_to_timeval(skb->tstamp);
2183 static inline void skb_get_timestampns(const struct sk_buff *skb,
2184 struct timespec *stamp)
2186 *stamp = ktime_to_timespec(skb->tstamp);
2189 static inline void __net_timestamp(struct sk_buff *skb)
2191 skb->tstamp = ktime_get_real();
2194 static inline ktime_t net_timedelta(ktime_t t)
2196 return ktime_sub(ktime_get_real(), t);
2199 static inline ktime_t net_invalid_timestamp(void)
2201 return ktime_set(0, 0);
2204 extern void skb_timestamping_init(void);
2206 #ifdef CONFIG_NETWORK_PHY_TIMESTAMPING
2208 extern void skb_clone_tx_timestamp(struct sk_buff *skb);
2209 extern bool skb_defer_rx_timestamp(struct sk_buff *skb);
2211 #else /* CONFIG_NETWORK_PHY_TIMESTAMPING */
2213 static inline void skb_clone_tx_timestamp(struct sk_buff *skb)
2217 static inline bool skb_defer_rx_timestamp(struct sk_buff *skb)
2222 #endif /* !CONFIG_NETWORK_PHY_TIMESTAMPING */
2225 * skb_complete_tx_timestamp() - deliver cloned skb with tx timestamps
2227 * PHY drivers may accept clones of transmitted packets for
2228 * timestamping via their phy_driver.txtstamp method. These drivers
2229 * must call this function to return the skb back to the stack, with
2230 * or without a timestamp.
2232 * @skb: clone of the the original outgoing packet
2233 * @hwtstamps: hardware time stamps, may be NULL if not available
2236 void skb_complete_tx_timestamp(struct sk_buff *skb,
2237 struct skb_shared_hwtstamps *hwtstamps);
2240 * skb_tstamp_tx - queue clone of skb with send time stamps
2241 * @orig_skb: the original outgoing packet
2242 * @hwtstamps: hardware time stamps, may be NULL if not available
2244 * If the skb has a socket associated, then this function clones the
2245 * skb (thus sharing the actual data and optional structures), stores
2246 * the optional hardware time stamping information (if non NULL) or
2247 * generates a software time stamp (otherwise), then queues the clone
2248 * to the error queue of the socket. Errors are silently ignored.
2250 extern void skb_tstamp_tx(struct sk_buff *orig_skb,
2251 struct skb_shared_hwtstamps *hwtstamps);
2253 static inline void sw_tx_timestamp(struct sk_buff *skb)
2255 if (skb_shinfo(skb)->tx_flags & SKBTX_SW_TSTAMP &&
2256 !(skb_shinfo(skb)->tx_flags & SKBTX_IN_PROGRESS))
2257 skb_tstamp_tx(skb, NULL);
2261 * skb_tx_timestamp() - Driver hook for transmit timestamping
2263 * Ethernet MAC Drivers should call this function in their hard_xmit()
2264 * function immediately before giving the sk_buff to the MAC hardware.
2266 * @skb: A socket buffer.
2268 static inline void skb_tx_timestamp(struct sk_buff *skb)
2270 skb_clone_tx_timestamp(skb);
2271 sw_tx_timestamp(skb);
2275 * skb_complete_wifi_ack - deliver skb with wifi status
2277 * @skb: the original outgoing packet
2278 * @acked: ack status
2281 void skb_complete_wifi_ack(struct sk_buff *skb, bool acked);
2283 extern __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len);
2284 extern __sum16 __skb_checksum_complete(struct sk_buff *skb);
2286 static inline int skb_csum_unnecessary(const struct sk_buff *skb)
2288 return skb->ip_summed & CHECKSUM_UNNECESSARY;
2292 * skb_checksum_complete - Calculate checksum of an entire packet
2293 * @skb: packet to process
2295 * This function calculates the checksum over the entire packet plus
2296 * the value of skb->csum. The latter can be used to supply the
2297 * checksum of a pseudo header as used by TCP/UDP. It returns the
2300 * For protocols that contain complete checksums such as ICMP/TCP/UDP,
2301 * this function can be used to verify that checksum on received
2302 * packets. In that case the function should return zero if the
2303 * checksum is correct. In particular, this function will return zero
2304 * if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the
2305 * hardware has already verified the correctness of the checksum.
2307 static inline __sum16 skb_checksum_complete(struct sk_buff *skb)
2309 return skb_csum_unnecessary(skb) ?
2310 0 : __skb_checksum_complete(skb);
2313 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2314 extern void nf_conntrack_destroy(struct nf_conntrack *nfct);
2315 static inline void nf_conntrack_put(struct nf_conntrack *nfct)
2317 if (nfct && atomic_dec_and_test(&nfct->use))
2318 nf_conntrack_destroy(nfct);
2320 static inline void nf_conntrack_get(struct nf_conntrack *nfct)
2323 atomic_inc(&nfct->use);
2326 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2327 static inline void nf_conntrack_get_reasm(struct sk_buff *skb)
2330 atomic_inc(&skb->users);
2332 static inline void nf_conntrack_put_reasm(struct sk_buff *skb)
2338 #ifdef CONFIG_BRIDGE_NETFILTER
2339 static inline void nf_bridge_put(struct nf_bridge_info *nf_bridge)
2341 if (nf_bridge && atomic_dec_and_test(&nf_bridge->use))
2344 static inline void nf_bridge_get(struct nf_bridge_info *nf_bridge)
2347 atomic_inc(&nf_bridge->use);
2349 #endif /* CONFIG_BRIDGE_NETFILTER */
2350 static inline void nf_reset(struct sk_buff *skb)
2352 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2353 nf_conntrack_put(skb->nfct);
2356 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2357 nf_conntrack_put_reasm(skb->nfct_reasm);
2358 skb->nfct_reasm = NULL;
2360 #ifdef CONFIG_BRIDGE_NETFILTER
2361 nf_bridge_put(skb->nf_bridge);
2362 skb->nf_bridge = NULL;
2366 /* Note: This doesn't put any conntrack and bridge info in dst. */
2367 static inline void __nf_copy(struct sk_buff *dst, const struct sk_buff *src)
2369 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2370 dst->nfct = src->nfct;
2371 nf_conntrack_get(src->nfct);
2372 dst->nfctinfo = src->nfctinfo;
2374 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2375 dst->nfct_reasm = src->nfct_reasm;
2376 nf_conntrack_get_reasm(src->nfct_reasm);
2378 #ifdef CONFIG_BRIDGE_NETFILTER
2379 dst->nf_bridge = src->nf_bridge;
2380 nf_bridge_get(src->nf_bridge);
2384 static inline void nf_copy(struct sk_buff *dst, const struct sk_buff *src)
2386 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2387 nf_conntrack_put(dst->nfct);
2389 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2390 nf_conntrack_put_reasm(dst->nfct_reasm);
2392 #ifdef CONFIG_BRIDGE_NETFILTER
2393 nf_bridge_put(dst->nf_bridge);
2395 __nf_copy(dst, src);
2398 #ifdef CONFIG_NETWORK_SECMARK
2399 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
2401 to->secmark = from->secmark;
2404 static inline void skb_init_secmark(struct sk_buff *skb)
2409 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
2412 static inline void skb_init_secmark(struct sk_buff *skb)
2416 static inline void skb_set_queue_mapping(struct sk_buff *skb, u16 queue_mapping)
2418 skb->queue_mapping = queue_mapping;
2421 static inline u16 skb_get_queue_mapping(const struct sk_buff *skb)
2423 return skb->queue_mapping;
2426 static inline void skb_copy_queue_mapping(struct sk_buff *to, const struct sk_buff *from)
2428 to->queue_mapping = from->queue_mapping;
2431 static inline void skb_record_rx_queue(struct sk_buff *skb, u16 rx_queue)
2433 skb->queue_mapping = rx_queue + 1;
2436 static inline u16 skb_get_rx_queue(const struct sk_buff *skb)
2438 return skb->queue_mapping - 1;
2441 static inline bool skb_rx_queue_recorded(const struct sk_buff *skb)
2443 return skb->queue_mapping != 0;
2446 extern u16 __skb_tx_hash(const struct net_device *dev,
2447 const struct sk_buff *skb,
2448 unsigned int num_tx_queues);
2451 static inline struct sec_path *skb_sec_path(struct sk_buff *skb)
2456 static inline struct sec_path *skb_sec_path(struct sk_buff *skb)
2462 static inline int skb_is_gso(const struct sk_buff *skb)
2464 return skb_shinfo(skb)->gso_size;
2467 static inline int skb_is_gso_v6(const struct sk_buff *skb)
2469 return skb_shinfo(skb)->gso_type & SKB_GSO_TCPV6;
2472 extern void __skb_warn_lro_forwarding(const struct sk_buff *skb);
2474 static inline bool skb_warn_if_lro(const struct sk_buff *skb)
2476 /* LRO sets gso_size but not gso_type, whereas if GSO is really
2477 * wanted then gso_type will be set. */
2478 const struct skb_shared_info *shinfo = skb_shinfo(skb);
2480 if (skb_is_nonlinear(skb) && shinfo->gso_size != 0 &&
2481 unlikely(shinfo->gso_type == 0)) {
2482 __skb_warn_lro_forwarding(skb);
2488 static inline void skb_forward_csum(struct sk_buff *skb)
2490 /* Unfortunately we don't support this one. Any brave souls? */
2491 if (skb->ip_summed == CHECKSUM_COMPLETE)
2492 skb->ip_summed = CHECKSUM_NONE;
2496 * skb_checksum_none_assert - make sure skb ip_summed is CHECKSUM_NONE
2497 * @skb: skb to check
2499 * fresh skbs have their ip_summed set to CHECKSUM_NONE.
2500 * Instead of forcing ip_summed to CHECKSUM_NONE, we can
2501 * use this helper, to document places where we make this assertion.
2503 static inline void skb_checksum_none_assert(const struct sk_buff *skb)
2506 BUG_ON(skb->ip_summed != CHECKSUM_NONE);
2510 bool skb_partial_csum_set(struct sk_buff *skb, u16 start, u16 off);
2512 static inline bool skb_is_recycleable(const struct sk_buff *skb, int skb_size)
2514 if (irqs_disabled())
2517 if (skb_shinfo(skb)->tx_flags & SKBTX_DEV_ZEROCOPY)
2520 if (skb_is_nonlinear(skb) || skb->fclone != SKB_FCLONE_UNAVAILABLE)
2523 skb_size = SKB_DATA_ALIGN(skb_size + NET_SKB_PAD);
2524 if (skb_end_pointer(skb) - skb->head < skb_size)
2527 if (skb_shared(skb) || skb_cloned(skb))
2532 #endif /* __KERNEL__ */
2533 #endif /* _LINUX_SKBUFF_H */