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/bug.h>
22 #include <linux/cache.h>
24 #include <linux/atomic.h>
25 #include <asm/types.h>
26 #include <linux/spinlock.h>
27 #include <linux/net.h>
28 #include <linux/textsearch.h>
29 #include <net/checksum.h>
30 #include <linux/rcupdate.h>
31 #include <linux/dmaengine.h>
32 #include <linux/hrtimer.h>
33 #include <linux/dma-mapping.h>
34 #include <linux/netdev_features.h>
36 /* Don't change this without changing skb_csum_unnecessary! */
37 #define CHECKSUM_NONE 0
38 #define CHECKSUM_UNNECESSARY 1
39 #define CHECKSUM_COMPLETE 2
40 #define CHECKSUM_PARTIAL 3
42 #define SKB_DATA_ALIGN(X) (((X) + (SMP_CACHE_BYTES - 1)) & \
43 ~(SMP_CACHE_BYTES - 1))
44 #define SKB_WITH_OVERHEAD(X) \
45 ((X) - SKB_DATA_ALIGN(sizeof(struct skb_shared_info)))
46 #define SKB_MAX_ORDER(X, ORDER) \
47 SKB_WITH_OVERHEAD((PAGE_SIZE << (ORDER)) - (X))
48 #define SKB_MAX_HEAD(X) (SKB_MAX_ORDER((X), 0))
49 #define SKB_MAX_ALLOC (SKB_MAX_ORDER(0, 2))
51 /* return minimum truesize of one skb containing X bytes of data */
52 #define SKB_TRUESIZE(X) ((X) + \
53 SKB_DATA_ALIGN(sizeof(struct sk_buff)) + \
54 SKB_DATA_ALIGN(sizeof(struct skb_shared_info)))
56 /* A. Checksumming of received packets by device.
58 * NONE: device failed to checksum this packet.
59 * skb->csum is undefined.
61 * UNNECESSARY: device parsed packet and wouldbe verified checksum.
62 * skb->csum is undefined.
63 * It is bad option, but, unfortunately, many of vendors do this.
64 * Apparently with secret goal to sell you new device, when you
65 * will add new protocol to your host. F.e. IPv6. 8)
67 * COMPLETE: the most generic way. Device supplied checksum of _all_
68 * the packet as seen by netif_rx in skb->csum.
69 * NOTE: Even if device supports only some protocols, but
70 * is able to produce some skb->csum, it MUST use COMPLETE,
73 * PARTIAL: identical to the case for output below. This may occur
74 * on a packet received directly from another Linux OS, e.g.,
75 * a virtualised Linux kernel on the same host. The packet can
76 * be treated in the same way as UNNECESSARY except that on
77 * output (i.e., forwarding) the checksum must be filled in
78 * by the OS or the hardware.
80 * B. Checksumming on output.
82 * NONE: skb is checksummed by protocol or csum is not required.
84 * PARTIAL: device is required to csum packet as seen by hard_start_xmit
85 * from skb->csum_start to the end and to record the checksum
86 * at skb->csum_start + skb->csum_offset.
88 * Device must show its capabilities in dev->features, set
89 * at device setup time.
90 * NETIF_F_HW_CSUM - it is clever device, it is able to checksum
92 * NETIF_F_IP_CSUM - device is dumb. It is able to csum only
93 * TCP/UDP over IPv4. Sigh. Vendors like this
94 * way by an unknown reason. Though, see comment above
95 * about CHECKSUM_UNNECESSARY. 8)
96 * NETIF_F_IPV6_CSUM about as dumb as the last one but does IPv6 instead.
98 * UNNECESSARY: device will do per protocol specific csum. Protocol drivers
99 * that do not want net to perform the checksum calculation should use
100 * this flag in their outgoing skbs.
101 * NETIF_F_FCOE_CRC this indicates the device can do FCoE FC CRC
102 * offload. Correspondingly, the FCoE protocol driver
103 * stack should use CHECKSUM_UNNECESSARY.
105 * Any questions? No questions, good. --ANK
110 struct pipe_inode_info;
112 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
113 struct nf_conntrack {
118 #ifdef CONFIG_BRIDGE_NETFILTER
119 struct nf_bridge_info {
122 struct net_device *physindev;
123 struct net_device *physoutdev;
124 unsigned long data[32 / sizeof(unsigned long)];
128 struct sk_buff_head {
129 /* These two members must be first. */
130 struct sk_buff *next;
131 struct sk_buff *prev;
139 /* To allow 64K frame to be packed as single skb without frag_list we
140 * require 64K/PAGE_SIZE pages plus 1 additional page to allow for
141 * buffers which do not start on a page boundary.
143 * Since GRO uses frags we allocate at least 16 regardless of page
146 #if (65536/PAGE_SIZE + 1) < 16
147 #define MAX_SKB_FRAGS 16UL
149 #define MAX_SKB_FRAGS (65536/PAGE_SIZE + 1)
152 typedef struct skb_frag_struct skb_frag_t;
154 struct skb_frag_struct {
158 #if (BITS_PER_LONG > 32) || (PAGE_SIZE >= 65536)
167 static inline unsigned int skb_frag_size(const skb_frag_t *frag)
172 static inline void skb_frag_size_set(skb_frag_t *frag, unsigned int size)
177 static inline void skb_frag_size_add(skb_frag_t *frag, int delta)
182 static inline void skb_frag_size_sub(skb_frag_t *frag, int delta)
187 #define HAVE_HW_TIME_STAMP
190 * struct skb_shared_hwtstamps - hardware time stamps
191 * @hwtstamp: hardware time stamp transformed into duration
192 * since arbitrary point in time
193 * @syststamp: hwtstamp transformed to system time base
195 * Software time stamps generated by ktime_get_real() are stored in
196 * skb->tstamp. The relation between the different kinds of time
197 * stamps is as follows:
199 * syststamp and tstamp can be compared against each other in
200 * arbitrary combinations. The accuracy of a
201 * syststamp/tstamp/"syststamp from other device" comparison is
202 * limited by the accuracy of the transformation into system time
203 * base. This depends on the device driver and its underlying
206 * hwtstamps can only be compared against other hwtstamps from
209 * This structure is attached to packets as part of the
210 * &skb_shared_info. Use skb_hwtstamps() to get a pointer.
212 struct skb_shared_hwtstamps {
217 /* Definitions for tx_flags in struct skb_shared_info */
219 /* generate hardware time stamp */
220 SKBTX_HW_TSTAMP = 1 << 0,
222 /* generate software time stamp */
223 SKBTX_SW_TSTAMP = 1 << 1,
225 /* device driver is going to provide hardware time stamp */
226 SKBTX_IN_PROGRESS = 1 << 2,
228 /* ensure the originating sk reference is available on driver level */
229 SKBTX_DRV_NEEDS_SK_REF = 1 << 3,
231 /* device driver supports TX zero-copy buffers */
232 SKBTX_DEV_ZEROCOPY = 1 << 4,
234 /* generate wifi status information (where possible) */
235 SKBTX_WIFI_STATUS = 1 << 5,
239 * The callback notifies userspace to release buffers when skb DMA is done in
240 * lower device, the skb last reference should be 0 when calling this.
241 * The ctx field is used to track device context.
242 * The desc field is used to track userspace buffer index.
245 void (*callback)(struct ubuf_info *);
250 /* This data is invariant across clones and lives at
251 * the end of the header data, ie. at skb->end.
253 struct skb_shared_info {
254 unsigned char nr_frags;
256 unsigned short gso_size;
257 /* Warning: this field is not always filled in (UFO)! */
258 unsigned short gso_segs;
259 unsigned short gso_type;
260 struct sk_buff *frag_list;
261 struct skb_shared_hwtstamps hwtstamps;
265 * Warning : all fields before dataref are cleared in __alloc_skb()
269 /* Intermediate layers must ensure that destructor_arg
270 * remains valid until skb destructor */
271 void * destructor_arg;
273 /* must be last field, see pskb_expand_head() */
274 skb_frag_t frags[MAX_SKB_FRAGS];
277 /* We divide dataref into two halves. The higher 16 bits hold references
278 * to the payload part of skb->data. The lower 16 bits hold references to
279 * the entire skb->data. A clone of a headerless skb holds the length of
280 * the header in skb->hdr_len.
282 * All users must obey the rule that the skb->data reference count must be
283 * greater than or equal to the payload reference count.
285 * Holding a reference to the payload part means that the user does not
286 * care about modifications to the header part of skb->data.
288 #define SKB_DATAREF_SHIFT 16
289 #define SKB_DATAREF_MASK ((1 << SKB_DATAREF_SHIFT) - 1)
293 SKB_FCLONE_UNAVAILABLE,
299 SKB_GSO_TCPV4 = 1 << 0,
300 SKB_GSO_UDP = 1 << 1,
302 /* This indicates the skb is from an untrusted source. */
303 SKB_GSO_DODGY = 1 << 2,
305 /* This indicates the tcp segment has CWR set. */
306 SKB_GSO_TCP_ECN = 1 << 3,
308 SKB_GSO_TCPV6 = 1 << 4,
310 SKB_GSO_FCOE = 1 << 5,
313 #if BITS_PER_LONG > 32
314 #define NET_SKBUFF_DATA_USES_OFFSET 1
317 #ifdef NET_SKBUFF_DATA_USES_OFFSET
318 typedef unsigned int sk_buff_data_t;
320 typedef unsigned char *sk_buff_data_t;
323 #if defined(CONFIG_NF_DEFRAG_IPV4) || defined(CONFIG_NF_DEFRAG_IPV4_MODULE) || \
324 defined(CONFIG_NF_DEFRAG_IPV6) || defined(CONFIG_NF_DEFRAG_IPV6_MODULE)
325 #define NET_SKBUFF_NF_DEFRAG_NEEDED 1
329 * struct sk_buff - socket buffer
330 * @next: Next buffer in list
331 * @prev: Previous buffer in list
332 * @tstamp: Time we arrived
333 * @sk: Socket we are owned by
334 * @dev: Device we arrived on/are leaving by
335 * @cb: Control buffer. Free for use by every layer. Put private vars here
336 * @_skb_refdst: destination entry (with norefcount bit)
337 * @sp: the security path, used for xfrm
338 * @len: Length of actual data
339 * @data_len: Data length
340 * @mac_len: Length of link layer header
341 * @hdr_len: writable header length of cloned skb
342 * @csum: Checksum (must include start/offset pair)
343 * @csum_start: Offset from skb->head where checksumming should start
344 * @csum_offset: Offset from csum_start where checksum should be stored
345 * @priority: Packet queueing priority
346 * @local_df: allow local fragmentation
347 * @cloned: Head may be cloned (check refcnt to be sure)
348 * @ip_summed: Driver fed us an IP checksum
349 * @nohdr: Payload reference only, must not modify header
350 * @nfctinfo: Relationship of this skb to the connection
351 * @pkt_type: Packet class
352 * @fclone: skbuff clone status
353 * @ipvs_property: skbuff is owned by ipvs
354 * @peeked: this packet has been seen already, so stats have been
355 * done for it, don't do them again
356 * @nf_trace: netfilter packet trace flag
357 * @protocol: Packet protocol from driver
358 * @destructor: Destruct function
359 * @nfct: Associated connection, if any
360 * @nfct_reasm: netfilter conntrack re-assembly pointer
361 * @nf_bridge: Saved data about a bridged frame - see br_netfilter.c
362 * @skb_iif: ifindex of device we arrived on
363 * @tc_index: Traffic control index
364 * @tc_verd: traffic control verdict
365 * @rxhash: the packet hash computed on receive
366 * @queue_mapping: Queue mapping for multiqueue devices
367 * @ndisc_nodetype: router type (from link layer)
368 * @ooo_okay: allow the mapping of a socket to a queue to be changed
369 * @l4_rxhash: indicate rxhash is a canonical 4-tuple hash over transport
371 * @wifi_acked_valid: wifi_acked was set
372 * @wifi_acked: whether frame was acked on wifi or not
373 * @no_fcs: Request NIC to treat last 4 bytes as Ethernet FCS
374 * @dma_cookie: a cookie to one of several possible DMA operations
375 * done by skb DMA functions
376 * @secmark: security marking
377 * @mark: Generic packet mark
378 * @dropcount: total number of sk_receive_queue overflows
379 * @vlan_tci: vlan tag control information
380 * @transport_header: Transport layer header
381 * @network_header: Network layer header
382 * @mac_header: Link layer header
383 * @tail: Tail pointer
385 * @head: Head of buffer
386 * @data: Data head pointer
387 * @truesize: Buffer size
388 * @users: User count - see {datagram,tcp}.c
392 /* These two members must be first. */
393 struct sk_buff *next;
394 struct sk_buff *prev;
399 struct net_device *dev;
402 * This is the control buffer. It is free to use for every
403 * layer. Please put your private variables there. If you
404 * want to keep them across layers you have to do a skb_clone()
405 * first. This is owned by whoever has the skb queued ATM.
407 char cb[48] __aligned(8);
409 unsigned long _skb_refdst;
425 kmemcheck_bitfield_begin(flags1);
436 kmemcheck_bitfield_end(flags1);
439 void (*destructor)(struct sk_buff *skb);
440 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
441 struct nf_conntrack *nfct;
443 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
444 struct sk_buff *nfct_reasm;
446 #ifdef CONFIG_BRIDGE_NETFILTER
447 struct nf_bridge_info *nf_bridge;
456 #ifdef CONFIG_NET_SCHED
457 __u16 tc_index; /* traffic control index */
458 #ifdef CONFIG_NET_CLS_ACT
459 __u16 tc_verd; /* traffic control verdict */
464 kmemcheck_bitfield_begin(flags2);
465 #ifdef CONFIG_IPV6_NDISC_NODETYPE
466 __u8 ndisc_nodetype:2;
470 __u8 wifi_acked_valid:1;
474 /* 8/10 bit hole (depending on ndisc_nodetype presence) */
475 kmemcheck_bitfield_end(flags2);
477 #ifdef CONFIG_NET_DMA
478 dma_cookie_t dma_cookie;
480 #ifdef CONFIG_NETWORK_SECMARK
489 sk_buff_data_t transport_header;
490 sk_buff_data_t network_header;
491 sk_buff_data_t mac_header;
492 /* These elements must be at the end, see alloc_skb() for details. */
497 unsigned int truesize;
503 * Handling routines are only of interest to the kernel
505 #include <linux/slab.h>
509 * skb might have a dst pointer attached, refcounted or not.
510 * _skb_refdst low order bit is set if refcount was _not_ taken
512 #define SKB_DST_NOREF 1UL
513 #define SKB_DST_PTRMASK ~(SKB_DST_NOREF)
516 * skb_dst - returns skb dst_entry
519 * Returns skb dst_entry, regardless of reference taken or not.
521 static inline struct dst_entry *skb_dst(const struct sk_buff *skb)
523 /* If refdst was not refcounted, check we still are in a
524 * rcu_read_lock section
526 WARN_ON((skb->_skb_refdst & SKB_DST_NOREF) &&
527 !rcu_read_lock_held() &&
528 !rcu_read_lock_bh_held());
529 return (struct dst_entry *)(skb->_skb_refdst & SKB_DST_PTRMASK);
533 * skb_dst_set - sets skb dst
537 * Sets skb dst, assuming a reference was taken on dst and should
538 * be released by skb_dst_drop()
540 static inline void skb_dst_set(struct sk_buff *skb, struct dst_entry *dst)
542 skb->_skb_refdst = (unsigned long)dst;
545 extern void skb_dst_set_noref(struct sk_buff *skb, struct dst_entry *dst);
548 * skb_dst_is_noref - Test if skb dst isn't refcounted
551 static inline bool skb_dst_is_noref(const struct sk_buff *skb)
553 return (skb->_skb_refdst & SKB_DST_NOREF) && skb_dst(skb);
556 static inline struct rtable *skb_rtable(const struct sk_buff *skb)
558 return (struct rtable *)skb_dst(skb);
561 extern void kfree_skb(struct sk_buff *skb);
562 extern void consume_skb(struct sk_buff *skb);
563 extern void __kfree_skb(struct sk_buff *skb);
564 extern struct sk_buff *__alloc_skb(unsigned int size,
565 gfp_t priority, int fclone, int node);
566 extern struct sk_buff *build_skb(void *data, unsigned int frag_size);
567 static inline struct sk_buff *alloc_skb(unsigned int size,
570 return __alloc_skb(size, priority, 0, NUMA_NO_NODE);
573 static inline struct sk_buff *alloc_skb_fclone(unsigned int size,
576 return __alloc_skb(size, priority, 1, NUMA_NO_NODE);
579 extern void skb_recycle(struct sk_buff *skb);
580 extern bool skb_recycle_check(struct sk_buff *skb, int skb_size);
582 extern struct sk_buff *skb_morph(struct sk_buff *dst, struct sk_buff *src);
583 extern int skb_copy_ubufs(struct sk_buff *skb, gfp_t gfp_mask);
584 extern struct sk_buff *skb_clone(struct sk_buff *skb,
586 extern struct sk_buff *skb_copy(const struct sk_buff *skb,
588 extern struct sk_buff *__pskb_copy(struct sk_buff *skb,
589 int headroom, gfp_t gfp_mask);
591 extern int pskb_expand_head(struct sk_buff *skb,
592 int nhead, int ntail,
594 extern struct sk_buff *skb_realloc_headroom(struct sk_buff *skb,
595 unsigned int headroom);
596 extern struct sk_buff *skb_copy_expand(const struct sk_buff *skb,
597 int newheadroom, int newtailroom,
599 extern int skb_to_sgvec(struct sk_buff *skb,
600 struct scatterlist *sg, int offset,
602 extern int skb_cow_data(struct sk_buff *skb, int tailbits,
603 struct sk_buff **trailer);
604 extern int skb_pad(struct sk_buff *skb, int pad);
605 #define dev_kfree_skb(a) consume_skb(a)
607 extern int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb,
608 int getfrag(void *from, char *to, int offset,
609 int len,int odd, struct sk_buff *skb),
610 void *from, int length);
612 struct skb_seq_state {
616 __u32 stepped_offset;
617 struct sk_buff *root_skb;
618 struct sk_buff *cur_skb;
622 extern void skb_prepare_seq_read(struct sk_buff *skb,
623 unsigned int from, unsigned int to,
624 struct skb_seq_state *st);
625 extern unsigned int skb_seq_read(unsigned int consumed, const u8 **data,
626 struct skb_seq_state *st);
627 extern void skb_abort_seq_read(struct skb_seq_state *st);
629 extern unsigned int skb_find_text(struct sk_buff *skb, unsigned int from,
630 unsigned int to, struct ts_config *config,
631 struct ts_state *state);
633 extern void __skb_get_rxhash(struct sk_buff *skb);
634 static inline __u32 skb_get_rxhash(struct sk_buff *skb)
637 __skb_get_rxhash(skb);
642 #ifdef NET_SKBUFF_DATA_USES_OFFSET
643 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
645 return skb->head + skb->end;
648 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
655 #define skb_shinfo(SKB) ((struct skb_shared_info *)(skb_end_pointer(SKB)))
657 static inline struct skb_shared_hwtstamps *skb_hwtstamps(struct sk_buff *skb)
659 return &skb_shinfo(skb)->hwtstamps;
663 * skb_queue_empty - check if a queue is empty
666 * Returns true if the queue is empty, false otherwise.
668 static inline int skb_queue_empty(const struct sk_buff_head *list)
670 return list->next == (struct sk_buff *)list;
674 * skb_queue_is_last - check if skb is the last entry in the queue
678 * Returns true if @skb is the last buffer on the list.
680 static inline bool skb_queue_is_last(const struct sk_buff_head *list,
681 const struct sk_buff *skb)
683 return skb->next == (struct sk_buff *)list;
687 * skb_queue_is_first - check if skb is the first entry in the queue
691 * Returns true if @skb is the first buffer on the list.
693 static inline bool skb_queue_is_first(const struct sk_buff_head *list,
694 const struct sk_buff *skb)
696 return skb->prev == (struct sk_buff *)list;
700 * skb_queue_next - return the next packet in the queue
702 * @skb: current buffer
704 * Return the next packet in @list after @skb. It is only valid to
705 * call this if skb_queue_is_last() evaluates to false.
707 static inline struct sk_buff *skb_queue_next(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_last(list, skb));
718 * skb_queue_prev - return the prev packet in the queue
720 * @skb: current buffer
722 * Return the prev packet in @list before @skb. It is only valid to
723 * call this if skb_queue_is_first() evaluates to false.
725 static inline struct sk_buff *skb_queue_prev(const struct sk_buff_head *list,
726 const struct sk_buff *skb)
728 /* This BUG_ON may seem severe, but if we just return then we
729 * are going to dereference garbage.
731 BUG_ON(skb_queue_is_first(list, skb));
736 * skb_get - reference buffer
737 * @skb: buffer to reference
739 * Makes another reference to a socket buffer and returns a pointer
742 static inline struct sk_buff *skb_get(struct sk_buff *skb)
744 atomic_inc(&skb->users);
749 * If users == 1, we are the only owner and are can avoid redundant
754 * skb_cloned - is the buffer a clone
755 * @skb: buffer to check
757 * Returns true if the buffer was generated with skb_clone() and is
758 * one of multiple shared copies of the buffer. Cloned buffers are
759 * shared data so must not be written to under normal circumstances.
761 static inline int skb_cloned(const struct sk_buff *skb)
763 return skb->cloned &&
764 (atomic_read(&skb_shinfo(skb)->dataref) & SKB_DATAREF_MASK) != 1;
768 * skb_header_cloned - is the header a clone
769 * @skb: buffer to check
771 * Returns true if modifying the header part of the buffer requires
772 * the data to be copied.
774 static inline int skb_header_cloned(const struct sk_buff *skb)
781 dataref = atomic_read(&skb_shinfo(skb)->dataref);
782 dataref = (dataref & SKB_DATAREF_MASK) - (dataref >> SKB_DATAREF_SHIFT);
787 * skb_header_release - release reference to header
788 * @skb: buffer to operate on
790 * Drop a reference to the header part of the buffer. This is done
791 * by acquiring a payload reference. You must not read from the header
792 * part of skb->data after this.
794 static inline void skb_header_release(struct sk_buff *skb)
798 atomic_add(1 << SKB_DATAREF_SHIFT, &skb_shinfo(skb)->dataref);
802 * skb_shared - is the buffer shared
803 * @skb: buffer to check
805 * Returns true if more than one person has a reference to this
808 static inline int skb_shared(const struct sk_buff *skb)
810 return atomic_read(&skb->users) != 1;
814 * skb_share_check - check if buffer is shared and if so clone it
815 * @skb: buffer to check
816 * @pri: priority for memory allocation
818 * If the buffer is shared the buffer is cloned and the old copy
819 * drops a reference. A new clone with a single reference is returned.
820 * If the buffer is not shared the original buffer is returned. When
821 * being called from interrupt status or with spinlocks held pri must
824 * NULL is returned on a memory allocation failure.
826 static inline struct sk_buff *skb_share_check(struct sk_buff *skb,
829 might_sleep_if(pri & __GFP_WAIT);
830 if (skb_shared(skb)) {
831 struct sk_buff *nskb = skb_clone(skb, pri);
839 * Copy shared buffers into a new sk_buff. We effectively do COW on
840 * packets to handle cases where we have a local reader and forward
841 * and a couple of other messy ones. The normal one is tcpdumping
842 * a packet thats being forwarded.
846 * skb_unshare - make a copy of a shared buffer
847 * @skb: buffer to check
848 * @pri: priority for memory allocation
850 * If the socket buffer is a clone then this function creates a new
851 * copy of the data, drops a reference count on the old copy and returns
852 * the new copy with the reference count at 1. If the buffer is not a clone
853 * the original buffer is returned. When called with a spinlock held or
854 * from interrupt state @pri must be %GFP_ATOMIC
856 * %NULL is returned on a memory allocation failure.
858 static inline struct sk_buff *skb_unshare(struct sk_buff *skb,
861 might_sleep_if(pri & __GFP_WAIT);
862 if (skb_cloned(skb)) {
863 struct sk_buff *nskb = skb_copy(skb, pri);
864 kfree_skb(skb); /* Free our shared copy */
871 * skb_peek - peek at the head of an &sk_buff_head
872 * @list_: list to peek at
874 * Peek an &sk_buff. Unlike most other operations you _MUST_
875 * be careful with this one. A peek leaves the buffer on the
876 * list and someone else may run off with it. You must hold
877 * the appropriate locks or have a private queue to do this.
879 * Returns %NULL for an empty list or a pointer to the head element.
880 * The reference count is not incremented and the reference is therefore
881 * volatile. Use with caution.
883 static inline struct sk_buff *skb_peek(const struct sk_buff_head *list_)
885 struct sk_buff *list = ((const struct sk_buff *)list_)->next;
886 if (list == (struct sk_buff *)list_)
892 * skb_peek_next - peek skb following the given one from a queue
893 * @skb: skb to start from
894 * @list_: list to peek at
896 * Returns %NULL when the end of the list is met or a pointer to the
897 * next element. The reference count is not incremented and the
898 * reference is therefore volatile. Use with caution.
900 static inline struct sk_buff *skb_peek_next(struct sk_buff *skb,
901 const struct sk_buff_head *list_)
903 struct sk_buff *next = skb->next;
904 if (next == (struct sk_buff *)list_)
910 * skb_peek_tail - peek at the tail of an &sk_buff_head
911 * @list_: list to peek at
913 * Peek an &sk_buff. Unlike most other operations you _MUST_
914 * be careful with this one. A peek leaves the buffer on the
915 * list and someone else may run off with it. You must hold
916 * the appropriate locks or have a private queue to do this.
918 * Returns %NULL for an empty list or a pointer to the tail element.
919 * The reference count is not incremented and the reference is therefore
920 * volatile. Use with caution.
922 static inline struct sk_buff *skb_peek_tail(const struct sk_buff_head *list_)
924 struct sk_buff *list = ((const struct sk_buff *)list_)->prev;
925 if (list == (struct sk_buff *)list_)
931 * skb_queue_len - get queue length
932 * @list_: list to measure
934 * Return the length of an &sk_buff queue.
936 static inline __u32 skb_queue_len(const struct sk_buff_head *list_)
942 * __skb_queue_head_init - initialize non-spinlock portions of sk_buff_head
943 * @list: queue to initialize
945 * This initializes only the list and queue length aspects of
946 * an sk_buff_head object. This allows to initialize the list
947 * aspects of an sk_buff_head without reinitializing things like
948 * the spinlock. It can also be used for on-stack sk_buff_head
949 * objects where the spinlock is known to not be used.
951 static inline void __skb_queue_head_init(struct sk_buff_head *list)
953 list->prev = list->next = (struct sk_buff *)list;
958 * This function creates a split out lock class for each invocation;
959 * this is needed for now since a whole lot of users of the skb-queue
960 * infrastructure in drivers have different locking usage (in hardirq)
961 * than the networking core (in softirq only). In the long run either the
962 * network layer or drivers should need annotation to consolidate the
963 * main types of usage into 3 classes.
965 static inline void skb_queue_head_init(struct sk_buff_head *list)
967 spin_lock_init(&list->lock);
968 __skb_queue_head_init(list);
971 static inline void skb_queue_head_init_class(struct sk_buff_head *list,
972 struct lock_class_key *class)
974 skb_queue_head_init(list);
975 lockdep_set_class(&list->lock, class);
979 * Insert an sk_buff on a list.
981 * The "__skb_xxxx()" functions are the non-atomic ones that
982 * can only be called with interrupts disabled.
984 extern void skb_insert(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list);
985 static inline void __skb_insert(struct sk_buff *newsk,
986 struct sk_buff *prev, struct sk_buff *next,
987 struct sk_buff_head *list)
991 next->prev = prev->next = newsk;
995 static inline void __skb_queue_splice(const struct sk_buff_head *list,
996 struct sk_buff *prev,
997 struct sk_buff *next)
999 struct sk_buff *first = list->next;
1000 struct sk_buff *last = list->prev;
1010 * skb_queue_splice - join two skb lists, this is designed for stacks
1011 * @list: the new list to add
1012 * @head: the place to add it in the first list
1014 static inline void skb_queue_splice(const struct sk_buff_head *list,
1015 struct sk_buff_head *head)
1017 if (!skb_queue_empty(list)) {
1018 __skb_queue_splice(list, (struct sk_buff *) head, head->next);
1019 head->qlen += list->qlen;
1024 * skb_queue_splice - join two skb lists and reinitialise the emptied list
1025 * @list: the new list to add
1026 * @head: the place to add it in the first list
1028 * The list at @list is reinitialised
1030 static inline void skb_queue_splice_init(struct sk_buff_head *list,
1031 struct sk_buff_head *head)
1033 if (!skb_queue_empty(list)) {
1034 __skb_queue_splice(list, (struct sk_buff *) head, head->next);
1035 head->qlen += list->qlen;
1036 __skb_queue_head_init(list);
1041 * skb_queue_splice_tail - join two skb lists, each list being a queue
1042 * @list: the new list to add
1043 * @head: the place to add it in the first list
1045 static inline void skb_queue_splice_tail(const struct sk_buff_head *list,
1046 struct sk_buff_head *head)
1048 if (!skb_queue_empty(list)) {
1049 __skb_queue_splice(list, head->prev, (struct sk_buff *) head);
1050 head->qlen += list->qlen;
1055 * skb_queue_splice_tail - join two skb lists and reinitialise the emptied list
1056 * @list: the new list to add
1057 * @head: the place to add it in the first list
1059 * Each of the lists is a queue.
1060 * The list at @list is reinitialised
1062 static inline void skb_queue_splice_tail_init(struct sk_buff_head *list,
1063 struct sk_buff_head *head)
1065 if (!skb_queue_empty(list)) {
1066 __skb_queue_splice(list, head->prev, (struct sk_buff *) head);
1067 head->qlen += list->qlen;
1068 __skb_queue_head_init(list);
1073 * __skb_queue_after - queue a buffer at the list head
1074 * @list: list to use
1075 * @prev: place after this buffer
1076 * @newsk: buffer to queue
1078 * Queue a buffer int the middle of a list. This function takes no locks
1079 * and you must therefore hold required locks before calling it.
1081 * A buffer cannot be placed on two lists at the same time.
1083 static inline void __skb_queue_after(struct sk_buff_head *list,
1084 struct sk_buff *prev,
1085 struct sk_buff *newsk)
1087 __skb_insert(newsk, prev, prev->next, list);
1090 extern void skb_append(struct sk_buff *old, struct sk_buff *newsk,
1091 struct sk_buff_head *list);
1093 static inline void __skb_queue_before(struct sk_buff_head *list,
1094 struct sk_buff *next,
1095 struct sk_buff *newsk)
1097 __skb_insert(newsk, next->prev, next, list);
1101 * __skb_queue_head - queue a buffer at the list head
1102 * @list: list to use
1103 * @newsk: buffer to queue
1105 * Queue a buffer at the start of a list. This function takes no locks
1106 * and you must therefore hold required locks before calling it.
1108 * A buffer cannot be placed on two lists at the same time.
1110 extern void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk);
1111 static inline void __skb_queue_head(struct sk_buff_head *list,
1112 struct sk_buff *newsk)
1114 __skb_queue_after(list, (struct sk_buff *)list, newsk);
1118 * __skb_queue_tail - queue a buffer at the list tail
1119 * @list: list to use
1120 * @newsk: buffer to queue
1122 * Queue a buffer at the end of a list. This function takes no locks
1123 * and you must therefore hold required locks before calling it.
1125 * A buffer cannot be placed on two lists at the same time.
1127 extern void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk);
1128 static inline void __skb_queue_tail(struct sk_buff_head *list,
1129 struct sk_buff *newsk)
1131 __skb_queue_before(list, (struct sk_buff *)list, newsk);
1135 * remove sk_buff from list. _Must_ be called atomically, and with
1138 extern void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list);
1139 static inline void __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
1141 struct sk_buff *next, *prev;
1146 skb->next = skb->prev = NULL;
1152 * __skb_dequeue - remove from the head of the queue
1153 * @list: list to dequeue from
1155 * Remove the head of the list. This function does not take any locks
1156 * so must be used with appropriate locks held only. The head item is
1157 * returned or %NULL if the list is empty.
1159 extern struct sk_buff *skb_dequeue(struct sk_buff_head *list);
1160 static inline struct sk_buff *__skb_dequeue(struct sk_buff_head *list)
1162 struct sk_buff *skb = skb_peek(list);
1164 __skb_unlink(skb, list);
1169 * __skb_dequeue_tail - remove from the tail of the queue
1170 * @list: list to dequeue from
1172 * Remove the tail of the list. This function does not take any locks
1173 * so must be used with appropriate locks held only. The tail item is
1174 * returned or %NULL if the list is empty.
1176 extern struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list);
1177 static inline struct sk_buff *__skb_dequeue_tail(struct sk_buff_head *list)
1179 struct sk_buff *skb = skb_peek_tail(list);
1181 __skb_unlink(skb, list);
1186 static inline bool skb_is_nonlinear(const struct sk_buff *skb)
1188 return skb->data_len;
1191 static inline unsigned int skb_headlen(const struct sk_buff *skb)
1193 return skb->len - skb->data_len;
1196 static inline int skb_pagelen(const struct sk_buff *skb)
1200 for (i = (int)skb_shinfo(skb)->nr_frags - 1; i >= 0; i--)
1201 len += skb_frag_size(&skb_shinfo(skb)->frags[i]);
1202 return len + skb_headlen(skb);
1206 * __skb_fill_page_desc - initialise a paged fragment in an skb
1207 * @skb: buffer containing fragment to be initialised
1208 * @i: paged fragment index to initialise
1209 * @page: the page to use for this fragment
1210 * @off: the offset to the data with @page
1211 * @size: the length of the data
1213 * Initialises the @i'th fragment of @skb to point to &size bytes at
1214 * offset @off within @page.
1216 * Does not take any additional reference on the fragment.
1218 static inline void __skb_fill_page_desc(struct sk_buff *skb, int i,
1219 struct page *page, int off, int size)
1221 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
1223 frag->page.p = page;
1224 frag->page_offset = off;
1225 skb_frag_size_set(frag, size);
1229 * skb_fill_page_desc - initialise a paged fragment in an skb
1230 * @skb: buffer containing fragment to be initialised
1231 * @i: paged fragment index to initialise
1232 * @page: the page to use for this fragment
1233 * @off: the offset to the data with @page
1234 * @size: the length of the data
1236 * As per __skb_fill_page_desc() -- initialises the @i'th fragment of
1237 * @skb to point to &size bytes at offset @off within @page. In
1238 * addition updates @skb such that @i is the last fragment.
1240 * Does not take any additional reference on the fragment.
1242 static inline void skb_fill_page_desc(struct sk_buff *skb, int i,
1243 struct page *page, int off, int size)
1245 __skb_fill_page_desc(skb, i, page, off, size);
1246 skb_shinfo(skb)->nr_frags = i + 1;
1249 extern void skb_add_rx_frag(struct sk_buff *skb, int i, struct page *page,
1250 int off, int size, unsigned int truesize);
1252 #define SKB_PAGE_ASSERT(skb) BUG_ON(skb_shinfo(skb)->nr_frags)
1253 #define SKB_FRAG_ASSERT(skb) BUG_ON(skb_has_frag_list(skb))
1254 #define SKB_LINEAR_ASSERT(skb) BUG_ON(skb_is_nonlinear(skb))
1256 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1257 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
1259 return skb->head + skb->tail;
1262 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
1264 skb->tail = skb->data - skb->head;
1267 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
1269 skb_reset_tail_pointer(skb);
1270 skb->tail += offset;
1272 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1273 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
1278 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
1280 skb->tail = skb->data;
1283 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
1285 skb->tail = skb->data + offset;
1288 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1291 * Add data to an sk_buff
1293 extern unsigned char *skb_put(struct sk_buff *skb, unsigned int len);
1294 static inline unsigned char *__skb_put(struct sk_buff *skb, unsigned int len)
1296 unsigned char *tmp = skb_tail_pointer(skb);
1297 SKB_LINEAR_ASSERT(skb);
1303 extern unsigned char *skb_push(struct sk_buff *skb, unsigned int len);
1304 static inline unsigned char *__skb_push(struct sk_buff *skb, unsigned int len)
1311 extern unsigned char *skb_pull(struct sk_buff *skb, unsigned int len);
1312 static inline unsigned char *__skb_pull(struct sk_buff *skb, unsigned int len)
1315 BUG_ON(skb->len < skb->data_len);
1316 return skb->data += len;
1319 static inline unsigned char *skb_pull_inline(struct sk_buff *skb, unsigned int len)
1321 return unlikely(len > skb->len) ? NULL : __skb_pull(skb, len);
1324 extern unsigned char *__pskb_pull_tail(struct sk_buff *skb, int delta);
1326 static inline unsigned char *__pskb_pull(struct sk_buff *skb, unsigned int len)
1328 if (len > skb_headlen(skb) &&
1329 !__pskb_pull_tail(skb, len - skb_headlen(skb)))
1332 return skb->data += len;
1335 static inline unsigned char *pskb_pull(struct sk_buff *skb, unsigned int len)
1337 return unlikely(len > skb->len) ? NULL : __pskb_pull(skb, len);
1340 static inline int pskb_may_pull(struct sk_buff *skb, unsigned int len)
1342 if (likely(len <= skb_headlen(skb)))
1344 if (unlikely(len > skb->len))
1346 return __pskb_pull_tail(skb, len - skb_headlen(skb)) != NULL;
1350 * skb_headroom - bytes at buffer head
1351 * @skb: buffer to check
1353 * Return the number of bytes of free space at the head of an &sk_buff.
1355 static inline unsigned int skb_headroom(const struct sk_buff *skb)
1357 return skb->data - skb->head;
1361 * skb_tailroom - bytes at buffer end
1362 * @skb: buffer to check
1364 * Return the number of bytes of free space at the tail of an sk_buff
1366 static inline int skb_tailroom(const struct sk_buff *skb)
1368 return skb_is_nonlinear(skb) ? 0 : skb->end - skb->tail;
1372 * skb_availroom - bytes at buffer end
1373 * @skb: buffer to check
1375 * Return the number of bytes of free space at the tail of an sk_buff
1376 * allocated by sk_stream_alloc()
1378 static inline int skb_availroom(const struct sk_buff *skb)
1380 return skb_is_nonlinear(skb) ? 0 : skb->avail_size - skb->len;
1384 * skb_reserve - adjust headroom
1385 * @skb: buffer to alter
1386 * @len: bytes to move
1388 * Increase the headroom of an empty &sk_buff by reducing the tail
1389 * room. This is only allowed for an empty buffer.
1391 static inline void skb_reserve(struct sk_buff *skb, int len)
1397 static inline void skb_reset_mac_len(struct sk_buff *skb)
1399 skb->mac_len = skb->network_header - skb->mac_header;
1402 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1403 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
1405 return skb->head + skb->transport_header;
1408 static inline void skb_reset_transport_header(struct sk_buff *skb)
1410 skb->transport_header = skb->data - skb->head;
1413 static inline void skb_set_transport_header(struct sk_buff *skb,
1416 skb_reset_transport_header(skb);
1417 skb->transport_header += offset;
1420 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
1422 return skb->head + skb->network_header;
1425 static inline void skb_reset_network_header(struct sk_buff *skb)
1427 skb->network_header = skb->data - skb->head;
1430 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1432 skb_reset_network_header(skb);
1433 skb->network_header += offset;
1436 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1438 return skb->head + skb->mac_header;
1441 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1443 return skb->mac_header != ~0U;
1446 static inline void skb_reset_mac_header(struct sk_buff *skb)
1448 skb->mac_header = skb->data - skb->head;
1451 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1453 skb_reset_mac_header(skb);
1454 skb->mac_header += offset;
1457 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1459 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
1461 return skb->transport_header;
1464 static inline void skb_reset_transport_header(struct sk_buff *skb)
1466 skb->transport_header = skb->data;
1469 static inline void skb_set_transport_header(struct sk_buff *skb,
1472 skb->transport_header = skb->data + offset;
1475 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
1477 return skb->network_header;
1480 static inline void skb_reset_network_header(struct sk_buff *skb)
1482 skb->network_header = skb->data;
1485 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
1487 skb->network_header = skb->data + offset;
1490 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1492 return skb->mac_header;
1495 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1497 return skb->mac_header != NULL;
1500 static inline void skb_reset_mac_header(struct sk_buff *skb)
1502 skb->mac_header = skb->data;
1505 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
1507 skb->mac_header = skb->data + offset;
1509 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1511 static inline void skb_mac_header_rebuild(struct sk_buff *skb)
1513 if (skb_mac_header_was_set(skb)) {
1514 const unsigned char *old_mac = skb_mac_header(skb);
1516 skb_set_mac_header(skb, -skb->mac_len);
1517 memmove(skb_mac_header(skb), old_mac, skb->mac_len);
1521 static inline int skb_checksum_start_offset(const struct sk_buff *skb)
1523 return skb->csum_start - skb_headroom(skb);
1526 static inline int skb_transport_offset(const struct sk_buff *skb)
1528 return skb_transport_header(skb) - skb->data;
1531 static inline u32 skb_network_header_len(const struct sk_buff *skb)
1533 return skb->transport_header - skb->network_header;
1536 static inline int skb_network_offset(const struct sk_buff *skb)
1538 return skb_network_header(skb) - skb->data;
1541 static inline int pskb_network_may_pull(struct sk_buff *skb, unsigned int len)
1543 return pskb_may_pull(skb, skb_network_offset(skb) + len);
1547 * CPUs often take a performance hit when accessing unaligned memory
1548 * locations. The actual performance hit varies, it can be small if the
1549 * hardware handles it or large if we have to take an exception and fix it
1552 * Since an ethernet header is 14 bytes network drivers often end up with
1553 * the IP header at an unaligned offset. The IP header can be aligned by
1554 * shifting the start of the packet by 2 bytes. Drivers should do this
1557 * skb_reserve(skb, NET_IP_ALIGN);
1559 * The downside to this alignment of the IP header is that the DMA is now
1560 * unaligned. On some architectures the cost of an unaligned DMA is high
1561 * and this cost outweighs the gains made by aligning the IP header.
1563 * Since this trade off varies between architectures, we allow NET_IP_ALIGN
1566 #ifndef NET_IP_ALIGN
1567 #define NET_IP_ALIGN 2
1571 * The networking layer reserves some headroom in skb data (via
1572 * dev_alloc_skb). This is used to avoid having to reallocate skb data when
1573 * the header has to grow. In the default case, if the header has to grow
1574 * 32 bytes or less we avoid the reallocation.
1576 * Unfortunately this headroom changes the DMA alignment of the resulting
1577 * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive
1578 * on some architectures. An architecture can override this value,
1579 * perhaps setting it to a cacheline in size (since that will maintain
1580 * cacheline alignment of the DMA). It must be a power of 2.
1582 * Various parts of the networking layer expect at least 32 bytes of
1583 * headroom, you should not reduce this.
1585 * Using max(32, L1_CACHE_BYTES) makes sense (especially with RPS)
1586 * to reduce average number of cache lines per packet.
1587 * get_rps_cpus() for example only access one 64 bytes aligned block :
1588 * NET_IP_ALIGN(2) + ethernet_header(14) + IP_header(20/40) + ports(8)
1591 #define NET_SKB_PAD max(32, L1_CACHE_BYTES)
1594 extern int ___pskb_trim(struct sk_buff *skb, unsigned int len);
1596 static inline void __skb_trim(struct sk_buff *skb, unsigned int len)
1598 if (unlikely(skb_is_nonlinear(skb))) {
1603 skb_set_tail_pointer(skb, len);
1606 extern void skb_trim(struct sk_buff *skb, unsigned int len);
1608 static inline int __pskb_trim(struct sk_buff *skb, unsigned int len)
1611 return ___pskb_trim(skb, len);
1612 __skb_trim(skb, len);
1616 static inline int pskb_trim(struct sk_buff *skb, unsigned int len)
1618 return (len < skb->len) ? __pskb_trim(skb, len) : 0;
1622 * pskb_trim_unique - remove end from a paged unique (not cloned) buffer
1623 * @skb: buffer to alter
1626 * This is identical to pskb_trim except that the caller knows that
1627 * the skb is not cloned so we should never get an error due to out-
1630 static inline void pskb_trim_unique(struct sk_buff *skb, unsigned int len)
1632 int err = pskb_trim(skb, len);
1637 * skb_orphan - orphan a buffer
1638 * @skb: buffer to orphan
1640 * If a buffer currently has an owner then we call the owner's
1641 * destructor function and make the @skb unowned. The buffer continues
1642 * to exist but is no longer charged to its former owner.
1644 static inline void skb_orphan(struct sk_buff *skb)
1646 if (skb->destructor)
1647 skb->destructor(skb);
1648 skb->destructor = NULL;
1653 * __skb_queue_purge - empty a list
1654 * @list: list to empty
1656 * Delete all buffers on an &sk_buff list. Each buffer is removed from
1657 * the list and one reference dropped. This function does not take the
1658 * list lock and the caller must hold the relevant locks to use it.
1660 extern void skb_queue_purge(struct sk_buff_head *list);
1661 static inline void __skb_queue_purge(struct sk_buff_head *list)
1663 struct sk_buff *skb;
1664 while ((skb = __skb_dequeue(list)) != NULL)
1669 * __dev_alloc_skb - allocate an skbuff for receiving
1670 * @length: length to allocate
1671 * @gfp_mask: get_free_pages mask, passed to alloc_skb
1673 * Allocate a new &sk_buff and assign it a usage count of one. The
1674 * buffer has unspecified headroom built in. Users should allocate
1675 * the headroom they think they need without accounting for the
1676 * built in space. The built in space is used for optimisations.
1678 * %NULL is returned if there is no free memory.
1680 static inline struct sk_buff *__dev_alloc_skb(unsigned int length,
1683 struct sk_buff *skb = alloc_skb(length + NET_SKB_PAD, gfp_mask);
1685 skb_reserve(skb, NET_SKB_PAD);
1689 extern struct sk_buff *dev_alloc_skb(unsigned int length);
1691 extern struct sk_buff *__netdev_alloc_skb(struct net_device *dev,
1692 unsigned int length, gfp_t gfp_mask);
1695 * netdev_alloc_skb - allocate an skbuff for rx on a specific device
1696 * @dev: network device to receive on
1697 * @length: length to allocate
1699 * Allocate a new &sk_buff and assign it a usage count of one. The
1700 * buffer has unspecified headroom built in. Users should allocate
1701 * the headroom they think they need without accounting for the
1702 * built in space. The built in space is used for optimisations.
1704 * %NULL is returned if there is no free memory. Although this function
1705 * allocates memory it can be called from an interrupt.
1707 static inline struct sk_buff *netdev_alloc_skb(struct net_device *dev,
1708 unsigned int length)
1710 return __netdev_alloc_skb(dev, length, GFP_ATOMIC);
1713 static inline struct sk_buff *__netdev_alloc_skb_ip_align(struct net_device *dev,
1714 unsigned int length, gfp_t gfp)
1716 struct sk_buff *skb = __netdev_alloc_skb(dev, length + NET_IP_ALIGN, gfp);
1718 if (NET_IP_ALIGN && skb)
1719 skb_reserve(skb, NET_IP_ALIGN);
1723 static inline struct sk_buff *netdev_alloc_skb_ip_align(struct net_device *dev,
1724 unsigned int length)
1726 return __netdev_alloc_skb_ip_align(dev, length, GFP_ATOMIC);
1730 * skb_frag_page - retrieve the page refered to by a paged fragment
1731 * @frag: the paged fragment
1733 * Returns the &struct page associated with @frag.
1735 static inline struct page *skb_frag_page(const skb_frag_t *frag)
1737 return frag->page.p;
1741 * __skb_frag_ref - take an addition reference on a paged fragment.
1742 * @frag: the paged fragment
1744 * Takes an additional reference on the paged fragment @frag.
1746 static inline void __skb_frag_ref(skb_frag_t *frag)
1748 get_page(skb_frag_page(frag));
1752 * skb_frag_ref - take an addition reference on a paged fragment of an skb.
1754 * @f: the fragment offset.
1756 * Takes an additional reference on the @f'th paged fragment of @skb.
1758 static inline void skb_frag_ref(struct sk_buff *skb, int f)
1760 __skb_frag_ref(&skb_shinfo(skb)->frags[f]);
1764 * __skb_frag_unref - release a reference on a paged fragment.
1765 * @frag: the paged fragment
1767 * Releases a reference on the paged fragment @frag.
1769 static inline void __skb_frag_unref(skb_frag_t *frag)
1771 put_page(skb_frag_page(frag));
1775 * skb_frag_unref - release a reference on a paged fragment of an skb.
1777 * @f: the fragment offset
1779 * Releases a reference on the @f'th paged fragment of @skb.
1781 static inline void skb_frag_unref(struct sk_buff *skb, int f)
1783 __skb_frag_unref(&skb_shinfo(skb)->frags[f]);
1787 * skb_frag_address - gets the address of the data contained in a paged fragment
1788 * @frag: the paged fragment buffer
1790 * Returns the address of the data within @frag. The page must already
1793 static inline void *skb_frag_address(const skb_frag_t *frag)
1795 return page_address(skb_frag_page(frag)) + frag->page_offset;
1799 * skb_frag_address_safe - gets the address of the data contained in a paged fragment
1800 * @frag: the paged fragment buffer
1802 * Returns the address of the data within @frag. Checks that the page
1803 * is mapped and returns %NULL otherwise.
1805 static inline void *skb_frag_address_safe(const skb_frag_t *frag)
1807 void *ptr = page_address(skb_frag_page(frag));
1811 return ptr + frag->page_offset;
1815 * __skb_frag_set_page - sets the page contained in a paged fragment
1816 * @frag: the paged fragment
1817 * @page: the page to set
1819 * Sets the fragment @frag to contain @page.
1821 static inline void __skb_frag_set_page(skb_frag_t *frag, struct page *page)
1823 frag->page.p = page;
1827 * skb_frag_set_page - sets the page contained in a paged fragment of an skb
1829 * @f: the fragment offset
1830 * @page: the page to set
1832 * Sets the @f'th fragment of @skb to contain @page.
1834 static inline void skb_frag_set_page(struct sk_buff *skb, int f,
1837 __skb_frag_set_page(&skb_shinfo(skb)->frags[f], page);
1841 * skb_frag_dma_map - maps a paged fragment via the DMA API
1842 * @dev: the device to map the fragment to
1843 * @frag: the paged fragment to map
1844 * @offset: the offset within the fragment (starting at the
1845 * fragment's own offset)
1846 * @size: the number of bytes to map
1847 * @dir: the direction of the mapping (%PCI_DMA_*)
1849 * Maps the page associated with @frag to @device.
1851 static inline dma_addr_t skb_frag_dma_map(struct device *dev,
1852 const skb_frag_t *frag,
1853 size_t offset, size_t size,
1854 enum dma_data_direction dir)
1856 return dma_map_page(dev, skb_frag_page(frag),
1857 frag->page_offset + offset, size, dir);
1860 static inline struct sk_buff *pskb_copy(struct sk_buff *skb,
1863 return __pskb_copy(skb, skb_headroom(skb), gfp_mask);
1867 * skb_clone_writable - is the header of a clone writable
1868 * @skb: buffer to check
1869 * @len: length up to which to write
1871 * Returns true if modifying the header part of the cloned buffer
1872 * does not requires the data to be copied.
1874 static inline int skb_clone_writable(const struct sk_buff *skb, unsigned int len)
1876 return !skb_header_cloned(skb) &&
1877 skb_headroom(skb) + len <= skb->hdr_len;
1880 static inline int __skb_cow(struct sk_buff *skb, unsigned int headroom,
1885 if (headroom < NET_SKB_PAD)
1886 headroom = NET_SKB_PAD;
1887 if (headroom > skb_headroom(skb))
1888 delta = headroom - skb_headroom(skb);
1890 if (delta || cloned)
1891 return pskb_expand_head(skb, ALIGN(delta, NET_SKB_PAD), 0,
1897 * skb_cow - copy header of skb when it is required
1898 * @skb: buffer to cow
1899 * @headroom: needed headroom
1901 * If the skb passed lacks sufficient headroom or its data part
1902 * is shared, data is reallocated. If reallocation fails, an error
1903 * is returned and original skb is not changed.
1905 * The result is skb with writable area skb->head...skb->tail
1906 * and at least @headroom of space at head.
1908 static inline int skb_cow(struct sk_buff *skb, unsigned int headroom)
1910 return __skb_cow(skb, headroom, skb_cloned(skb));
1914 * skb_cow_head - skb_cow but only making the head writable
1915 * @skb: buffer to cow
1916 * @headroom: needed headroom
1918 * This function is identical to skb_cow except that we replace the
1919 * skb_cloned check by skb_header_cloned. It should be used when
1920 * you only need to push on some header and do not need to modify
1923 static inline int skb_cow_head(struct sk_buff *skb, unsigned int headroom)
1925 return __skb_cow(skb, headroom, skb_header_cloned(skb));
1929 * skb_padto - pad an skbuff up to a minimal size
1930 * @skb: buffer to pad
1931 * @len: minimal length
1933 * Pads up a buffer to ensure the trailing bytes exist and are
1934 * blanked. If the buffer already contains sufficient data it
1935 * is untouched. Otherwise it is extended. Returns zero on
1936 * success. The skb is freed on error.
1939 static inline int skb_padto(struct sk_buff *skb, unsigned int len)
1941 unsigned int size = skb->len;
1942 if (likely(size >= len))
1944 return skb_pad(skb, len - size);
1947 static inline int skb_add_data(struct sk_buff *skb,
1948 char __user *from, int copy)
1950 const int off = skb->len;
1952 if (skb->ip_summed == CHECKSUM_NONE) {
1954 __wsum csum = csum_and_copy_from_user(from, skb_put(skb, copy),
1957 skb->csum = csum_block_add(skb->csum, csum, off);
1960 } else if (!copy_from_user(skb_put(skb, copy), from, copy))
1963 __skb_trim(skb, off);
1967 static inline bool skb_can_coalesce(struct sk_buff *skb, int i,
1968 const struct page *page, int off)
1971 const struct skb_frag_struct *frag = &skb_shinfo(skb)->frags[i - 1];
1973 return page == skb_frag_page(frag) &&
1974 off == frag->page_offset + skb_frag_size(frag);
1979 static inline int __skb_linearize(struct sk_buff *skb)
1981 return __pskb_pull_tail(skb, skb->data_len) ? 0 : -ENOMEM;
1985 * skb_linearize - convert paged skb to linear one
1986 * @skb: buffer to linarize
1988 * If there is no free memory -ENOMEM is returned, otherwise zero
1989 * is returned and the old skb data released.
1991 static inline int skb_linearize(struct sk_buff *skb)
1993 return skb_is_nonlinear(skb) ? __skb_linearize(skb) : 0;
1997 * skb_linearize_cow - make sure skb is linear and writable
1998 * @skb: buffer to process
2000 * If there is no free memory -ENOMEM is returned, otherwise zero
2001 * is returned and the old skb data released.
2003 static inline int skb_linearize_cow(struct sk_buff *skb)
2005 return skb_is_nonlinear(skb) || skb_cloned(skb) ?
2006 __skb_linearize(skb) : 0;
2010 * skb_postpull_rcsum - update checksum for received skb after pull
2011 * @skb: buffer to update
2012 * @start: start of data before pull
2013 * @len: length of data pulled
2015 * After doing a pull on a received packet, you need to call this to
2016 * update the CHECKSUM_COMPLETE checksum, or set ip_summed to
2017 * CHECKSUM_NONE so that it can be recomputed from scratch.
2020 static inline void skb_postpull_rcsum(struct sk_buff *skb,
2021 const void *start, unsigned int len)
2023 if (skb->ip_summed == CHECKSUM_COMPLETE)
2024 skb->csum = csum_sub(skb->csum, csum_partial(start, len, 0));
2027 unsigned char *skb_pull_rcsum(struct sk_buff *skb, unsigned int len);
2030 * pskb_trim_rcsum - trim received skb and update checksum
2031 * @skb: buffer to trim
2034 * This is exactly the same as pskb_trim except that it ensures the
2035 * checksum of received packets are still valid after the operation.
2038 static inline int pskb_trim_rcsum(struct sk_buff *skb, unsigned int len)
2040 if (likely(len >= skb->len))
2042 if (skb->ip_summed == CHECKSUM_COMPLETE)
2043 skb->ip_summed = CHECKSUM_NONE;
2044 return __pskb_trim(skb, len);
2047 #define skb_queue_walk(queue, skb) \
2048 for (skb = (queue)->next; \
2049 skb != (struct sk_buff *)(queue); \
2052 #define skb_queue_walk_safe(queue, skb, tmp) \
2053 for (skb = (queue)->next, tmp = skb->next; \
2054 skb != (struct sk_buff *)(queue); \
2055 skb = tmp, tmp = skb->next)
2057 #define skb_queue_walk_from(queue, skb) \
2058 for (; skb != (struct sk_buff *)(queue); \
2061 #define skb_queue_walk_from_safe(queue, skb, tmp) \
2062 for (tmp = skb->next; \
2063 skb != (struct sk_buff *)(queue); \
2064 skb = tmp, tmp = skb->next)
2066 #define skb_queue_reverse_walk(queue, skb) \
2067 for (skb = (queue)->prev; \
2068 skb != (struct sk_buff *)(queue); \
2071 #define skb_queue_reverse_walk_safe(queue, skb, tmp) \
2072 for (skb = (queue)->prev, tmp = skb->prev; \
2073 skb != (struct sk_buff *)(queue); \
2074 skb = tmp, tmp = skb->prev)
2076 #define skb_queue_reverse_walk_from_safe(queue, skb, tmp) \
2077 for (tmp = skb->prev; \
2078 skb != (struct sk_buff *)(queue); \
2079 skb = tmp, tmp = skb->prev)
2081 static inline bool skb_has_frag_list(const struct sk_buff *skb)
2083 return skb_shinfo(skb)->frag_list != NULL;
2086 static inline void skb_frag_list_init(struct sk_buff *skb)
2088 skb_shinfo(skb)->frag_list = NULL;
2091 static inline void skb_frag_add_head(struct sk_buff *skb, struct sk_buff *frag)
2093 frag->next = skb_shinfo(skb)->frag_list;
2094 skb_shinfo(skb)->frag_list = frag;
2097 #define skb_walk_frags(skb, iter) \
2098 for (iter = skb_shinfo(skb)->frag_list; iter; iter = iter->next)
2100 extern struct sk_buff *__skb_recv_datagram(struct sock *sk, unsigned flags,
2101 int *peeked, int *off, int *err);
2102 extern struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags,
2103 int noblock, int *err);
2104 extern unsigned int datagram_poll(struct file *file, struct socket *sock,
2105 struct poll_table_struct *wait);
2106 extern int skb_copy_datagram_iovec(const struct sk_buff *from,
2107 int offset, struct iovec *to,
2109 extern int skb_copy_and_csum_datagram_iovec(struct sk_buff *skb,
2112 extern int skb_copy_datagram_from_iovec(struct sk_buff *skb,
2114 const struct iovec *from,
2117 extern int skb_copy_datagram_const_iovec(const struct sk_buff *from,
2119 const struct iovec *to,
2122 extern void skb_free_datagram(struct sock *sk, struct sk_buff *skb);
2123 extern void skb_free_datagram_locked(struct sock *sk,
2124 struct sk_buff *skb);
2125 extern int skb_kill_datagram(struct sock *sk, struct sk_buff *skb,
2126 unsigned int flags);
2127 extern __wsum skb_checksum(const struct sk_buff *skb, int offset,
2128 int len, __wsum csum);
2129 extern int skb_copy_bits(const struct sk_buff *skb, int offset,
2131 extern int skb_store_bits(struct sk_buff *skb, int offset,
2132 const void *from, int len);
2133 extern __wsum skb_copy_and_csum_bits(const struct sk_buff *skb,
2134 int offset, u8 *to, int len,
2136 extern int skb_splice_bits(struct sk_buff *skb,
2137 unsigned int offset,
2138 struct pipe_inode_info *pipe,
2140 unsigned int flags);
2141 extern void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to);
2142 extern void skb_split(struct sk_buff *skb,
2143 struct sk_buff *skb1, const u32 len);
2144 extern int skb_shift(struct sk_buff *tgt, struct sk_buff *skb,
2147 extern struct sk_buff *skb_segment(struct sk_buff *skb,
2148 netdev_features_t features);
2150 static inline void *skb_header_pointer(const struct sk_buff *skb, int offset,
2151 int len, void *buffer)
2153 int hlen = skb_headlen(skb);
2155 if (hlen - offset >= len)
2156 return skb->data + offset;
2158 if (skb_copy_bits(skb, offset, buffer, len) < 0)
2164 static inline void skb_copy_from_linear_data(const struct sk_buff *skb,
2166 const unsigned int len)
2168 memcpy(to, skb->data, len);
2171 static inline void skb_copy_from_linear_data_offset(const struct sk_buff *skb,
2172 const int offset, void *to,
2173 const unsigned int len)
2175 memcpy(to, skb->data + offset, len);
2178 static inline void skb_copy_to_linear_data(struct sk_buff *skb,
2180 const unsigned int len)
2182 memcpy(skb->data, from, len);
2185 static inline void skb_copy_to_linear_data_offset(struct sk_buff *skb,
2188 const unsigned int len)
2190 memcpy(skb->data + offset, from, len);
2193 extern void skb_init(void);
2195 static inline ktime_t skb_get_ktime(const struct sk_buff *skb)
2201 * skb_get_timestamp - get timestamp from a skb
2202 * @skb: skb to get stamp from
2203 * @stamp: pointer to struct timeval to store stamp in
2205 * Timestamps are stored in the skb as offsets to a base timestamp.
2206 * This function converts the offset back to a struct timeval and stores
2209 static inline void skb_get_timestamp(const struct sk_buff *skb,
2210 struct timeval *stamp)
2212 *stamp = ktime_to_timeval(skb->tstamp);
2215 static inline void skb_get_timestampns(const struct sk_buff *skb,
2216 struct timespec *stamp)
2218 *stamp = ktime_to_timespec(skb->tstamp);
2221 static inline void __net_timestamp(struct sk_buff *skb)
2223 skb->tstamp = ktime_get_real();
2226 static inline ktime_t net_timedelta(ktime_t t)
2228 return ktime_sub(ktime_get_real(), t);
2231 static inline ktime_t net_invalid_timestamp(void)
2233 return ktime_set(0, 0);
2236 extern void skb_timestamping_init(void);
2238 #ifdef CONFIG_NETWORK_PHY_TIMESTAMPING
2240 extern void skb_clone_tx_timestamp(struct sk_buff *skb);
2241 extern bool skb_defer_rx_timestamp(struct sk_buff *skb);
2243 #else /* CONFIG_NETWORK_PHY_TIMESTAMPING */
2245 static inline void skb_clone_tx_timestamp(struct sk_buff *skb)
2249 static inline bool skb_defer_rx_timestamp(struct sk_buff *skb)
2254 #endif /* !CONFIG_NETWORK_PHY_TIMESTAMPING */
2257 * skb_complete_tx_timestamp() - deliver cloned skb with tx timestamps
2259 * PHY drivers may accept clones of transmitted packets for
2260 * timestamping via their phy_driver.txtstamp method. These drivers
2261 * must call this function to return the skb back to the stack, with
2262 * or without a timestamp.
2264 * @skb: clone of the the original outgoing packet
2265 * @hwtstamps: hardware time stamps, may be NULL if not available
2268 void skb_complete_tx_timestamp(struct sk_buff *skb,
2269 struct skb_shared_hwtstamps *hwtstamps);
2272 * skb_tstamp_tx - queue clone of skb with send time stamps
2273 * @orig_skb: the original outgoing packet
2274 * @hwtstamps: hardware time stamps, may be NULL if not available
2276 * If the skb has a socket associated, then this function clones the
2277 * skb (thus sharing the actual data and optional structures), stores
2278 * the optional hardware time stamping information (if non NULL) or
2279 * generates a software time stamp (otherwise), then queues the clone
2280 * to the error queue of the socket. Errors are silently ignored.
2282 extern void skb_tstamp_tx(struct sk_buff *orig_skb,
2283 struct skb_shared_hwtstamps *hwtstamps);
2285 static inline void sw_tx_timestamp(struct sk_buff *skb)
2287 if (skb_shinfo(skb)->tx_flags & SKBTX_SW_TSTAMP &&
2288 !(skb_shinfo(skb)->tx_flags & SKBTX_IN_PROGRESS))
2289 skb_tstamp_tx(skb, NULL);
2293 * skb_tx_timestamp() - Driver hook for transmit timestamping
2295 * Ethernet MAC Drivers should call this function in their hard_xmit()
2296 * function immediately before giving the sk_buff to the MAC hardware.
2298 * @skb: A socket buffer.
2300 static inline void skb_tx_timestamp(struct sk_buff *skb)
2302 skb_clone_tx_timestamp(skb);
2303 sw_tx_timestamp(skb);
2307 * skb_complete_wifi_ack - deliver skb with wifi status
2309 * @skb: the original outgoing packet
2310 * @acked: ack status
2313 void skb_complete_wifi_ack(struct sk_buff *skb, bool acked);
2315 extern __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len);
2316 extern __sum16 __skb_checksum_complete(struct sk_buff *skb);
2318 static inline int skb_csum_unnecessary(const struct sk_buff *skb)
2320 return skb->ip_summed & CHECKSUM_UNNECESSARY;
2324 * skb_checksum_complete - Calculate checksum of an entire packet
2325 * @skb: packet to process
2327 * This function calculates the checksum over the entire packet plus
2328 * the value of skb->csum. The latter can be used to supply the
2329 * checksum of a pseudo header as used by TCP/UDP. It returns the
2332 * For protocols that contain complete checksums such as ICMP/TCP/UDP,
2333 * this function can be used to verify that checksum on received
2334 * packets. In that case the function should return zero if the
2335 * checksum is correct. In particular, this function will return zero
2336 * if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the
2337 * hardware has already verified the correctness of the checksum.
2339 static inline __sum16 skb_checksum_complete(struct sk_buff *skb)
2341 return skb_csum_unnecessary(skb) ?
2342 0 : __skb_checksum_complete(skb);
2345 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2346 extern void nf_conntrack_destroy(struct nf_conntrack *nfct);
2347 static inline void nf_conntrack_put(struct nf_conntrack *nfct)
2349 if (nfct && atomic_dec_and_test(&nfct->use))
2350 nf_conntrack_destroy(nfct);
2352 static inline void nf_conntrack_get(struct nf_conntrack *nfct)
2355 atomic_inc(&nfct->use);
2358 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2359 static inline void nf_conntrack_get_reasm(struct sk_buff *skb)
2362 atomic_inc(&skb->users);
2364 static inline void nf_conntrack_put_reasm(struct sk_buff *skb)
2370 #ifdef CONFIG_BRIDGE_NETFILTER
2371 static inline void nf_bridge_put(struct nf_bridge_info *nf_bridge)
2373 if (nf_bridge && atomic_dec_and_test(&nf_bridge->use))
2376 static inline void nf_bridge_get(struct nf_bridge_info *nf_bridge)
2379 atomic_inc(&nf_bridge->use);
2381 #endif /* CONFIG_BRIDGE_NETFILTER */
2382 static inline void nf_reset(struct sk_buff *skb)
2384 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2385 nf_conntrack_put(skb->nfct);
2388 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2389 nf_conntrack_put_reasm(skb->nfct_reasm);
2390 skb->nfct_reasm = NULL;
2392 #ifdef CONFIG_BRIDGE_NETFILTER
2393 nf_bridge_put(skb->nf_bridge);
2394 skb->nf_bridge = NULL;
2398 /* Note: This doesn't put any conntrack and bridge info in dst. */
2399 static inline void __nf_copy(struct sk_buff *dst, const struct sk_buff *src)
2401 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2402 dst->nfct = src->nfct;
2403 nf_conntrack_get(src->nfct);
2404 dst->nfctinfo = src->nfctinfo;
2406 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2407 dst->nfct_reasm = src->nfct_reasm;
2408 nf_conntrack_get_reasm(src->nfct_reasm);
2410 #ifdef CONFIG_BRIDGE_NETFILTER
2411 dst->nf_bridge = src->nf_bridge;
2412 nf_bridge_get(src->nf_bridge);
2416 static inline void nf_copy(struct sk_buff *dst, const struct sk_buff *src)
2418 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2419 nf_conntrack_put(dst->nfct);
2421 #ifdef NET_SKBUFF_NF_DEFRAG_NEEDED
2422 nf_conntrack_put_reasm(dst->nfct_reasm);
2424 #ifdef CONFIG_BRIDGE_NETFILTER
2425 nf_bridge_put(dst->nf_bridge);
2427 __nf_copy(dst, src);
2430 #ifdef CONFIG_NETWORK_SECMARK
2431 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
2433 to->secmark = from->secmark;
2436 static inline void skb_init_secmark(struct sk_buff *skb)
2441 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
2444 static inline void skb_init_secmark(struct sk_buff *skb)
2448 static inline void skb_set_queue_mapping(struct sk_buff *skb, u16 queue_mapping)
2450 skb->queue_mapping = queue_mapping;
2453 static inline u16 skb_get_queue_mapping(const struct sk_buff *skb)
2455 return skb->queue_mapping;
2458 static inline void skb_copy_queue_mapping(struct sk_buff *to, const struct sk_buff *from)
2460 to->queue_mapping = from->queue_mapping;
2463 static inline void skb_record_rx_queue(struct sk_buff *skb, u16 rx_queue)
2465 skb->queue_mapping = rx_queue + 1;
2468 static inline u16 skb_get_rx_queue(const struct sk_buff *skb)
2470 return skb->queue_mapping - 1;
2473 static inline bool skb_rx_queue_recorded(const struct sk_buff *skb)
2475 return skb->queue_mapping != 0;
2478 extern u16 __skb_tx_hash(const struct net_device *dev,
2479 const struct sk_buff *skb,
2480 unsigned int num_tx_queues);
2483 static inline struct sec_path *skb_sec_path(struct sk_buff *skb)
2488 static inline struct sec_path *skb_sec_path(struct sk_buff *skb)
2494 static inline bool skb_is_gso(const struct sk_buff *skb)
2496 return skb_shinfo(skb)->gso_size;
2499 static inline bool skb_is_gso_v6(const struct sk_buff *skb)
2501 return skb_shinfo(skb)->gso_type & SKB_GSO_TCPV6;
2504 extern void __skb_warn_lro_forwarding(const struct sk_buff *skb);
2506 static inline bool skb_warn_if_lro(const struct sk_buff *skb)
2508 /* LRO sets gso_size but not gso_type, whereas if GSO is really
2509 * wanted then gso_type will be set. */
2510 const struct skb_shared_info *shinfo = skb_shinfo(skb);
2512 if (skb_is_nonlinear(skb) && shinfo->gso_size != 0 &&
2513 unlikely(shinfo->gso_type == 0)) {
2514 __skb_warn_lro_forwarding(skb);
2520 static inline void skb_forward_csum(struct sk_buff *skb)
2522 /* Unfortunately we don't support this one. Any brave souls? */
2523 if (skb->ip_summed == CHECKSUM_COMPLETE)
2524 skb->ip_summed = CHECKSUM_NONE;
2528 * skb_checksum_none_assert - make sure skb ip_summed is CHECKSUM_NONE
2529 * @skb: skb to check
2531 * fresh skbs have their ip_summed set to CHECKSUM_NONE.
2532 * Instead of forcing ip_summed to CHECKSUM_NONE, we can
2533 * use this helper, to document places where we make this assertion.
2535 static inline void skb_checksum_none_assert(const struct sk_buff *skb)
2538 BUG_ON(skb->ip_summed != CHECKSUM_NONE);
2542 bool skb_partial_csum_set(struct sk_buff *skb, u16 start, u16 off);
2544 static inline bool skb_is_recycleable(const struct sk_buff *skb, int skb_size)
2546 if (irqs_disabled())
2549 if (skb_shinfo(skb)->tx_flags & SKBTX_DEV_ZEROCOPY)
2552 if (skb_is_nonlinear(skb) || skb->fclone != SKB_FCLONE_UNAVAILABLE)
2555 skb_size = SKB_DATA_ALIGN(skb_size + NET_SKB_PAD);
2556 if (skb_end_pointer(skb) - skb->head < skb_size)
2559 if (skb_shared(skb) || skb_cloned(skb))
2564 #endif /* __KERNEL__ */
2565 #endif /* _LINUX_SKBUFF_H */