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>
23 #include <linux/rbtree.h>
24 #include <linux/socket.h>
26 #include <linux/atomic.h>
27 #include <asm/types.h>
28 #include <linux/spinlock.h>
29 #include <linux/net.h>
30 #include <linux/textsearch.h>
31 #include <net/checksum.h>
32 #include <linux/rcupdate.h>
33 #include <linux/hrtimer.h>
34 #include <linux/dma-mapping.h>
35 #include <linux/netdev_features.h>
36 #include <linux/sched.h>
37 #include <net/flow_dissector.h>
38 #include <linux/splice.h>
39 #include <linux/in6.h>
40 #include <linux/if_packet.h>
43 /* The interface for checksum offload between the stack and networking drivers
46 * A. IP checksum related features
48 * Drivers advertise checksum offload capabilities in the features of a device.
49 * From the stack's point of view these are capabilities offered by the driver,
50 * a driver typically only advertises features that it is capable of offloading
53 * The checksum related features are:
55 * NETIF_F_HW_CSUM - The driver (or its device) is able to compute one
56 * IP (one's complement) checksum for any combination
57 * of protocols or protocol layering. The checksum is
58 * computed and set in a packet per the CHECKSUM_PARTIAL
59 * interface (see below).
61 * NETIF_F_IP_CSUM - Driver (device) is only able to checksum plain
62 * TCP or UDP packets over IPv4. These are specifically
63 * unencapsulated packets of the form IPv4|TCP or
64 * IPv4|UDP where the Protocol field in the IPv4 header
65 * is TCP or UDP. The IPv4 header may contain IP options
66 * This feature cannot be set in features for a device
67 * with NETIF_F_HW_CSUM also set. This feature is being
68 * DEPRECATED (see below).
70 * NETIF_F_IPV6_CSUM - Driver (device) is only able to checksum plain
71 * TCP or UDP packets over IPv6. These are specifically
72 * unencapsulated packets of the form IPv6|TCP or
73 * IPv4|UDP where the Next Header field in the IPv6
74 * header is either TCP or UDP. IPv6 extension headers
75 * are not supported with this feature. This feature
76 * cannot be set in features for a device with
77 * NETIF_F_HW_CSUM also set. This feature is being
78 * DEPRECATED (see below).
80 * NETIF_F_RXCSUM - Driver (device) performs receive checksum offload.
81 * This flag is used only used to disable the RX checksum
82 * feature for a device. The stack will accept receive
83 * checksum indication in packets received on a device
84 * regardless of whether NETIF_F_RXCSUM is set.
86 * B. Checksumming of received packets by device. Indication of checksum
87 * verification is in set skb->ip_summed. Possible values are:
91 * Device did not checksum this packet e.g. due to lack of capabilities.
92 * The packet contains full (though not verified) checksum in packet but
93 * not in skb->csum. Thus, skb->csum is undefined in this case.
95 * CHECKSUM_UNNECESSARY:
97 * The hardware you're dealing with doesn't calculate the full checksum
98 * (as in CHECKSUM_COMPLETE), but it does parse headers and verify checksums
99 * for specific protocols. For such packets it will set CHECKSUM_UNNECESSARY
100 * if their checksums are okay. skb->csum is still undefined in this case
101 * though. A driver or device must never modify the checksum field in the
102 * packet even if checksum is verified.
104 * CHECKSUM_UNNECESSARY is applicable to following protocols:
105 * TCP: IPv6 and IPv4.
106 * UDP: IPv4 and IPv6. A device may apply CHECKSUM_UNNECESSARY to a
107 * zero UDP checksum for either IPv4 or IPv6, the networking stack
108 * may perform further validation in this case.
109 * GRE: only if the checksum is present in the header.
110 * SCTP: indicates the CRC in SCTP header has been validated.
112 * skb->csum_level indicates the number of consecutive checksums found in
113 * the packet minus one that have been verified as CHECKSUM_UNNECESSARY.
114 * For instance if a device receives an IPv6->UDP->GRE->IPv4->TCP packet
115 * and a device is able to verify the checksums for UDP (possibly zero),
116 * GRE (checksum flag is set), and TCP-- skb->csum_level would be set to
117 * two. If the device were only able to verify the UDP checksum and not
118 * GRE, either because it doesn't support GRE checksum of because GRE
119 * checksum is bad, skb->csum_level would be set to zero (TCP checksum is
120 * not considered in this case).
124 * This is the most generic way. The device supplied checksum of the _whole_
125 * packet as seen by netif_rx() and fills out in skb->csum. Meaning, the
126 * hardware doesn't need to parse L3/L4 headers to implement this.
128 * Note: Even if device supports only some protocols, but is able to produce
129 * skb->csum, it MUST use CHECKSUM_COMPLETE, not CHECKSUM_UNNECESSARY.
133 * A checksum is set up to be offloaded to a device as described in the
134 * output description for CHECKSUM_PARTIAL. This may occur on a packet
135 * received directly from another Linux OS, e.g., a virtualized Linux kernel
136 * on the same host, or it may be set in the input path in GRO or remote
137 * checksum offload. For the purposes of checksum verification, the checksum
138 * referred to by skb->csum_start + skb->csum_offset and any preceding
139 * checksums in the packet are considered verified. Any checksums in the
140 * packet that are after the checksum being offloaded are not considered to
143 * C. Checksumming on transmit for non-GSO. The stack requests checksum offload
144 * in the skb->ip_summed for a packet. Values are:
148 * The driver is required to checksum the packet as seen by hard_start_xmit()
149 * from skb->csum_start up to the end, and to record/write the checksum at
150 * offset skb->csum_start + skb->csum_offset. A driver may verify that the
151 * csum_start and csum_offset values are valid values given the length and
152 * offset of the packet, however they should not attempt to validate that the
153 * checksum refers to a legitimate transport layer checksum-- it is the
154 * purview of the stack to validate that csum_start and csum_offset are set
157 * When the stack requests checksum offload for a packet, the driver MUST
158 * ensure that the checksum is set correctly. A driver can either offload the
159 * checksum calculation to the device, or call skb_checksum_help (in the case
160 * that the device does not support offload for a particular checksum).
162 * NETIF_F_IP_CSUM and NETIF_F_IPV6_CSUM are being deprecated in favor of
163 * NETIF_F_HW_CSUM. New devices should use NETIF_F_HW_CSUM to indicate
164 * checksum offload capability. If a device has limited checksum capabilities
165 * (for instance can only perform NETIF_F_IP_CSUM or NETIF_F_IPV6_CSUM as
166 * described above) a helper function can be called to resolve
167 * CHECKSUM_PARTIAL. The helper functions are skb_csum_off_chk*. The helper
168 * function takes a spec argument that describes the protocol layer that is
169 * supported for checksum offload and can be called for each packet. If a
170 * packet does not match the specification for offload, skb_checksum_help
171 * is called to resolve the checksum.
175 * The skb was already checksummed by the protocol, or a checksum is not
178 * CHECKSUM_UNNECESSARY:
180 * This has the same meaning on as CHECKSUM_NONE for checksum offload on
184 * Not used in checksum output. If a driver observes a packet with this value
185 * set in skbuff, if should treat as CHECKSUM_NONE being set.
187 * D. Non-IP checksum (CRC) offloads
189 * NETIF_F_SCTP_CRC - This feature indicates that a device is capable of
190 * offloading the SCTP CRC in a packet. To perform this offload the stack
191 * will set ip_summed to CHECKSUM_PARTIAL and set csum_start and csum_offset
192 * accordingly. Note the there is no indication in the skbuff that the
193 * CHECKSUM_PARTIAL refers to an SCTP checksum, a driver that supports
194 * both IP checksum offload and SCTP CRC offload must verify which offload
195 * is configured for a packet presumably by inspecting packet headers.
197 * NETIF_F_FCOE_CRC - This feature indicates that a device is capable of
198 * offloading the FCOE CRC in a packet. To perform this offload the stack
199 * will set ip_summed to CHECKSUM_PARTIAL and set csum_start and csum_offset
200 * accordingly. Note the there is no indication in the skbuff that the
201 * CHECKSUM_PARTIAL refers to an FCOE checksum, a driver that supports
202 * both IP checksum offload and FCOE CRC offload must verify which offload
203 * is configured for a packet presumably by inspecting packet headers.
205 * E. Checksumming on output with GSO.
207 * In the case of a GSO packet (skb_is_gso(skb) is true), checksum offload
208 * is implied by the SKB_GSO_* flags in gso_type. Most obviously, if the
209 * gso_type is SKB_GSO_TCPV4 or SKB_GSO_TCPV6, TCP checksum offload as
210 * part of the GSO operation is implied. If a checksum is being offloaded
211 * with GSO then ip_summed is CHECKSUM_PARTIAL, csum_start and csum_offset
212 * are set to refer to the outermost checksum being offload (two offloaded
213 * checksums are possible with UDP encapsulation).
216 /* Don't change this without changing skb_csum_unnecessary! */
217 #define CHECKSUM_NONE 0
218 #define CHECKSUM_UNNECESSARY 1
219 #define CHECKSUM_COMPLETE 2
220 #define CHECKSUM_PARTIAL 3
222 /* Maximum value in skb->csum_level */
223 #define SKB_MAX_CSUM_LEVEL 3
225 #define SKB_DATA_ALIGN(X) ALIGN(X, SMP_CACHE_BYTES)
226 #define SKB_WITH_OVERHEAD(X) \
227 ((X) - SKB_DATA_ALIGN(sizeof(struct skb_shared_info)))
228 #define SKB_MAX_ORDER(X, ORDER) \
229 SKB_WITH_OVERHEAD((PAGE_SIZE << (ORDER)) - (X))
230 #define SKB_MAX_HEAD(X) (SKB_MAX_ORDER((X), 0))
231 #define SKB_MAX_ALLOC (SKB_MAX_ORDER(0, 2))
233 /* return minimum truesize of one skb containing X bytes of data */
234 #define SKB_TRUESIZE(X) ((X) + \
235 SKB_DATA_ALIGN(sizeof(struct sk_buff)) + \
236 SKB_DATA_ALIGN(sizeof(struct skb_shared_info)))
240 struct pipe_inode_info;
244 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
245 struct nf_conntrack {
250 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
251 struct nf_bridge_info {
254 BRNF_PROTO_UNCHANGED,
262 struct net_device *physindev;
264 /* always valid & non-NULL from FORWARD on, for physdev match */
265 struct net_device *physoutdev;
267 /* prerouting: detect dnat in orig/reply direction */
269 struct in6_addr ipv6_daddr;
271 /* after prerouting + nat detected: store original source
272 * mac since neigh resolution overwrites it, only used while
273 * skb is out in neigh layer.
275 char neigh_header[8];
280 struct sk_buff_head {
281 /* These two members must be first. */
282 struct sk_buff *next;
283 struct sk_buff *prev;
291 /* To allow 64K frame to be packed as single skb without frag_list we
292 * require 64K/PAGE_SIZE pages plus 1 additional page to allow for
293 * buffers which do not start on a page boundary.
295 * Since GRO uses frags we allocate at least 16 regardless of page
298 #if (65536/PAGE_SIZE + 1) < 16
299 #define MAX_SKB_FRAGS 16UL
301 #define MAX_SKB_FRAGS (65536/PAGE_SIZE + 1)
303 extern int sysctl_max_skb_frags;
305 /* Set skb_shinfo(skb)->gso_size to this in case you want skb_segment to
306 * segment using its current segmentation instead.
308 #define GSO_BY_FRAGS 0xFFFF
310 typedef struct skb_frag_struct skb_frag_t;
312 struct skb_frag_struct {
316 #if (BITS_PER_LONG > 32) || (PAGE_SIZE >= 65536)
325 static inline unsigned int skb_frag_size(const skb_frag_t *frag)
330 static inline void skb_frag_size_set(skb_frag_t *frag, unsigned int size)
335 static inline void skb_frag_size_add(skb_frag_t *frag, int delta)
340 static inline void skb_frag_size_sub(skb_frag_t *frag, int delta)
345 #define HAVE_HW_TIME_STAMP
348 * struct skb_shared_hwtstamps - hardware time stamps
349 * @hwtstamp: hardware time stamp transformed into duration
350 * since arbitrary point in time
352 * Software time stamps generated by ktime_get_real() are stored in
355 * hwtstamps can only be compared against other hwtstamps from
358 * This structure is attached to packets as part of the
359 * &skb_shared_info. Use skb_hwtstamps() to get a pointer.
361 struct skb_shared_hwtstamps {
365 /* Definitions for tx_flags in struct skb_shared_info */
367 /* generate hardware time stamp */
368 SKBTX_HW_TSTAMP = 1 << 0,
370 /* generate software time stamp when queueing packet to NIC */
371 SKBTX_SW_TSTAMP = 1 << 1,
373 /* device driver is going to provide hardware time stamp */
374 SKBTX_IN_PROGRESS = 1 << 2,
376 /* device driver supports TX zero-copy buffers */
377 SKBTX_DEV_ZEROCOPY = 1 << 3,
379 /* generate wifi status information (where possible) */
380 SKBTX_WIFI_STATUS = 1 << 4,
382 /* This indicates at least one fragment might be overwritten
383 * (as in vmsplice(), sendfile() ...)
384 * If we need to compute a TX checksum, we'll need to copy
385 * all frags to avoid possible bad checksum
387 SKBTX_SHARED_FRAG = 1 << 5,
389 /* generate software time stamp when entering packet scheduling */
390 SKBTX_SCHED_TSTAMP = 1 << 6,
393 #define SKBTX_ANY_SW_TSTAMP (SKBTX_SW_TSTAMP | \
395 #define SKBTX_ANY_TSTAMP (SKBTX_HW_TSTAMP | SKBTX_ANY_SW_TSTAMP)
398 * The callback notifies userspace to release buffers when skb DMA is done in
399 * lower device, the skb last reference should be 0 when calling this.
400 * The zerocopy_success argument is true if zero copy transmit occurred,
401 * false on data copy or out of memory error caused by data copy attempt.
402 * The ctx field is used to track device context.
403 * The desc field is used to track userspace buffer index.
406 void (*callback)(struct ubuf_info *, bool zerocopy_success);
411 /* This data is invariant across clones and lives at
412 * the end of the header data, ie. at skb->end.
414 struct skb_shared_info {
415 unsigned char nr_frags;
417 unsigned short gso_size;
418 /* Warning: this field is not always filled in (UFO)! */
419 unsigned short gso_segs;
420 unsigned short gso_type;
421 struct sk_buff *frag_list;
422 struct skb_shared_hwtstamps hwtstamps;
427 * Warning : all fields before dataref are cleared in __alloc_skb()
431 /* Intermediate layers must ensure that destructor_arg
432 * remains valid until skb destructor */
433 void * destructor_arg;
435 /* must be last field, see pskb_expand_head() */
436 skb_frag_t frags[MAX_SKB_FRAGS];
439 /* We divide dataref into two halves. The higher 16 bits hold references
440 * to the payload part of skb->data. The lower 16 bits hold references to
441 * the entire skb->data. A clone of a headerless skb holds the length of
442 * the header in skb->hdr_len.
444 * All users must obey the rule that the skb->data reference count must be
445 * greater than or equal to the payload reference count.
447 * Holding a reference to the payload part means that the user does not
448 * care about modifications to the header part of skb->data.
450 #define SKB_DATAREF_SHIFT 16
451 #define SKB_DATAREF_MASK ((1 << SKB_DATAREF_SHIFT) - 1)
455 SKB_FCLONE_UNAVAILABLE, /* skb has no fclone (from head_cache) */
456 SKB_FCLONE_ORIG, /* orig skb (from fclone_cache) */
457 SKB_FCLONE_CLONE, /* companion fclone skb (from fclone_cache) */
461 SKB_GSO_TCPV4 = 1 << 0,
462 SKB_GSO_UDP = 1 << 1,
464 /* This indicates the skb is from an untrusted source. */
465 SKB_GSO_DODGY = 1 << 2,
467 /* This indicates the tcp segment has CWR set. */
468 SKB_GSO_TCP_ECN = 1 << 3,
470 SKB_GSO_TCP_FIXEDID = 1 << 4,
472 SKB_GSO_TCPV6 = 1 << 5,
474 SKB_GSO_FCOE = 1 << 6,
476 SKB_GSO_GRE = 1 << 7,
478 SKB_GSO_GRE_CSUM = 1 << 8,
480 SKB_GSO_IPXIP4 = 1 << 9,
482 SKB_GSO_IPXIP6 = 1 << 10,
484 SKB_GSO_UDP_TUNNEL = 1 << 11,
486 SKB_GSO_UDP_TUNNEL_CSUM = 1 << 12,
488 SKB_GSO_PARTIAL = 1 << 13,
490 SKB_GSO_TUNNEL_REMCSUM = 1 << 14,
492 SKB_GSO_SCTP = 1 << 15,
495 #if BITS_PER_LONG > 32
496 #define NET_SKBUFF_DATA_USES_OFFSET 1
499 #ifdef NET_SKBUFF_DATA_USES_OFFSET
500 typedef unsigned int sk_buff_data_t;
502 typedef unsigned char *sk_buff_data_t;
506 * struct skb_mstamp - multi resolution time stamps
507 * @stamp_us: timestamp in us resolution
508 * @stamp_jiffies: timestamp in jiffies
521 * skb_mstamp_get - get current timestamp
522 * @cl: place to store timestamps
524 static inline void skb_mstamp_get(struct skb_mstamp *cl)
526 u64 val = local_clock();
528 do_div(val, NSEC_PER_USEC);
529 cl->stamp_us = (u32)val;
530 cl->stamp_jiffies = (u32)jiffies;
534 * skb_mstamp_delta - compute the difference in usec between two skb_mstamp
535 * @t1: pointer to newest sample
536 * @t0: pointer to oldest sample
538 static inline u32 skb_mstamp_us_delta(const struct skb_mstamp *t1,
539 const struct skb_mstamp *t0)
541 s32 delta_us = t1->stamp_us - t0->stamp_us;
542 u32 delta_jiffies = t1->stamp_jiffies - t0->stamp_jiffies;
544 /* If delta_us is negative, this might be because interval is too big,
545 * or local_clock() drift is too big : fallback using jiffies.
548 delta_jiffies >= (INT_MAX / (USEC_PER_SEC / HZ)))
550 delta_us = jiffies_to_usecs(delta_jiffies);
555 static inline bool skb_mstamp_after(const struct skb_mstamp *t1,
556 const struct skb_mstamp *t0)
558 s32 diff = t1->stamp_jiffies - t0->stamp_jiffies;
561 diff = t1->stamp_us - t0->stamp_us;
566 * struct sk_buff - socket buffer
567 * @next: Next buffer in list
568 * @prev: Previous buffer in list
569 * @tstamp: Time we arrived/left
570 * @rbnode: RB tree node, alternative to next/prev for netem/tcp
571 * @sk: Socket we are owned by
572 * @dev: Device we arrived on/are leaving by
573 * @cb: Control buffer. Free for use by every layer. Put private vars here
574 * @_skb_refdst: destination entry (with norefcount bit)
575 * @sp: the security path, used for xfrm
576 * @len: Length of actual data
577 * @data_len: Data length
578 * @mac_len: Length of link layer header
579 * @hdr_len: writable header length of cloned skb
580 * @csum: Checksum (must include start/offset pair)
581 * @csum_start: Offset from skb->head where checksumming should start
582 * @csum_offset: Offset from csum_start where checksum should be stored
583 * @priority: Packet queueing priority
584 * @ignore_df: allow local fragmentation
585 * @cloned: Head may be cloned (check refcnt to be sure)
586 * @ip_summed: Driver fed us an IP checksum
587 * @nohdr: Payload reference only, must not modify header
588 * @nfctinfo: Relationship of this skb to the connection
589 * @pkt_type: Packet class
590 * @fclone: skbuff clone status
591 * @ipvs_property: skbuff is owned by ipvs
592 * @peeked: this packet has been seen already, so stats have been
593 * done for it, don't do them again
594 * @nf_trace: netfilter packet trace flag
595 * @protocol: Packet protocol from driver
596 * @destructor: Destruct function
597 * @nfct: Associated connection, if any
598 * @nf_bridge: Saved data about a bridged frame - see br_netfilter.c
599 * @skb_iif: ifindex of device we arrived on
600 * @tc_index: Traffic control index
601 * @tc_verd: traffic control verdict
602 * @hash: the packet hash
603 * @queue_mapping: Queue mapping for multiqueue devices
604 * @xmit_more: More SKBs are pending for this queue
605 * @pfmemalloc: skbuff was allocated from PFMEMALLOC reserves
606 * @ndisc_nodetype: router type (from link layer)
607 * @ooo_okay: allow the mapping of a socket to a queue to be changed
608 * @l4_hash: indicate hash is a canonical 4-tuple hash over transport
610 * @sw_hash: indicates hash was computed in software stack
611 * @wifi_acked_valid: wifi_acked was set
612 * @wifi_acked: whether frame was acked on wifi or not
613 * @no_fcs: Request NIC to treat last 4 bytes as Ethernet FCS
614 * @napi_id: id of the NAPI struct this skb came from
615 * @secmark: security marking
616 * @mark: Generic packet mark
617 * @vlan_proto: vlan encapsulation protocol
618 * @vlan_tci: vlan tag control information
619 * @inner_protocol: Protocol (encapsulation)
620 * @inner_transport_header: Inner transport layer header (encapsulation)
621 * @inner_network_header: Network layer header (encapsulation)
622 * @inner_mac_header: Link layer header (encapsulation)
623 * @transport_header: Transport layer header
624 * @network_header: Network layer header
625 * @mac_header: Link layer header
626 * @tail: Tail pointer
628 * @head: Head of buffer
629 * @data: Data head pointer
630 * @truesize: Buffer size
631 * @users: User count - see {datagram,tcp}.c
637 /* These two members must be first. */
638 struct sk_buff *next;
639 struct sk_buff *prev;
643 struct skb_mstamp skb_mstamp;
646 struct rb_node rbnode; /* used in netem, ip4 defrag, and tcp stack */
651 int ip_defrag_offset;
654 struct net_device *dev;
657 * This is the control buffer. It is free to use for every
658 * layer. Please put your private variables there. If you
659 * want to keep them across layers you have to do a skb_clone()
660 * first. This is owned by whoever has the skb queued ATM.
662 char cb[48] __aligned(8);
664 unsigned long _skb_refdst;
665 void (*destructor)(struct sk_buff *skb);
669 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
670 struct nf_conntrack *nfct;
672 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
673 struct nf_bridge_info *nf_bridge;
680 /* Following fields are _not_ copied in __copy_skb_header()
681 * Note that queue_mapping is here mostly to fill a hole.
683 kmemcheck_bitfield_begin(flags1);
686 /* if you move cloned around you also must adapt those constants */
687 #ifdef __BIG_ENDIAN_BITFIELD
688 #define CLONED_MASK (1 << 7)
690 #define CLONED_MASK 1
692 #define CLONED_OFFSET() offsetof(struct sk_buff, __cloned_offset)
694 __u8 __cloned_offset[0];
702 kmemcheck_bitfield_end(flags1);
704 /* fields enclosed in headers_start/headers_end are copied
705 * using a single memcpy() in __copy_skb_header()
708 __u32 headers_start[0];
711 /* if you move pkt_type around you also must adapt those constants */
712 #ifdef __BIG_ENDIAN_BITFIELD
713 #define PKT_TYPE_MAX (7 << 5)
715 #define PKT_TYPE_MAX 7
717 #define PKT_TYPE_OFFSET() offsetof(struct sk_buff, __pkt_type_offset)
719 __u8 __pkt_type_offset[0];
729 __u8 wifi_acked_valid:1;
733 /* Indicates the inner headers are valid in the skbuff. */
734 __u8 encapsulation:1;
735 __u8 encap_hdr_csum:1;
737 __u8 csum_complete_sw:1;
740 #ifdef CONFIG_IPV6_NDISC_NODETYPE
741 __u8 ndisc_nodetype:2;
743 __u8 ipvs_property:1;
745 __u8 inner_protocol_type:1;
746 __u8 remcsum_offload:1;
747 #ifdef CONFIG_NET_SWITCHDEV
748 __u8 offload_fwd_mark:1;
750 /* 2, 4 or 5 bit hole */
752 #ifdef CONFIG_NET_SCHED
753 __u16 tc_index; /* traffic control index */
754 #ifdef CONFIG_NET_CLS_ACT
755 __u16 tc_verd; /* traffic control verdict */
771 #if defined(CONFIG_NET_RX_BUSY_POLL) || defined(CONFIG_XPS)
773 unsigned int napi_id;
774 unsigned int sender_cpu;
777 #ifdef CONFIG_NETWORK_SECMARK
783 __u32 reserved_tailroom;
787 __be16 inner_protocol;
791 __u16 inner_transport_header;
792 __u16 inner_network_header;
793 __u16 inner_mac_header;
796 __u16 transport_header;
797 __u16 network_header;
801 __u32 headers_end[0];
804 /* These elements must be at the end, see alloc_skb() for details. */
809 unsigned int truesize;
815 * Handling routines are only of interest to the kernel
817 #include <linux/slab.h>
820 #define SKB_ALLOC_FCLONE 0x01
821 #define SKB_ALLOC_RX 0x02
822 #define SKB_ALLOC_NAPI 0x04
824 /* Returns true if the skb was allocated from PFMEMALLOC reserves */
825 static inline bool skb_pfmemalloc(const struct sk_buff *skb)
827 return unlikely(skb->pfmemalloc);
831 * skb might have a dst pointer attached, refcounted or not.
832 * _skb_refdst low order bit is set if refcount was _not_ taken
834 #define SKB_DST_NOREF 1UL
835 #define SKB_DST_PTRMASK ~(SKB_DST_NOREF)
838 * skb_dst - returns skb dst_entry
841 * Returns skb dst_entry, regardless of reference taken or not.
843 static inline struct dst_entry *skb_dst(const struct sk_buff *skb)
845 /* If refdst was not refcounted, check we still are in a
846 * rcu_read_lock section
848 WARN_ON((skb->_skb_refdst & SKB_DST_NOREF) &&
849 !rcu_read_lock_held() &&
850 !rcu_read_lock_bh_held());
851 return (struct dst_entry *)(skb->_skb_refdst & SKB_DST_PTRMASK);
855 * skb_dst_set - sets skb dst
859 * Sets skb dst, assuming a reference was taken on dst and should
860 * be released by skb_dst_drop()
862 static inline void skb_dst_set(struct sk_buff *skb, struct dst_entry *dst)
864 skb->_skb_refdst = (unsigned long)dst;
868 * skb_dst_set_noref - sets skb dst, hopefully, without taking reference
872 * Sets skb dst, assuming a reference was not taken on dst.
873 * If dst entry is cached, we do not take reference and dst_release
874 * will be avoided by refdst_drop. If dst entry is not cached, we take
875 * reference, so that last dst_release can destroy the dst immediately.
877 static inline void skb_dst_set_noref(struct sk_buff *skb, struct dst_entry *dst)
879 WARN_ON(!rcu_read_lock_held() && !rcu_read_lock_bh_held());
880 skb->_skb_refdst = (unsigned long)dst | SKB_DST_NOREF;
884 * skb_dst_is_noref - Test if skb dst isn't refcounted
887 static inline bool skb_dst_is_noref(const struct sk_buff *skb)
889 return (skb->_skb_refdst & SKB_DST_NOREF) && skb_dst(skb);
892 static inline struct rtable *skb_rtable(const struct sk_buff *skb)
894 return (struct rtable *)skb_dst(skb);
897 /* For mangling skb->pkt_type from user space side from applications
898 * such as nft, tc, etc, we only allow a conservative subset of
899 * possible pkt_types to be set.
901 static inline bool skb_pkt_type_ok(u32 ptype)
903 return ptype <= PACKET_OTHERHOST;
906 void kfree_skb(struct sk_buff *skb);
907 void kfree_skb_list(struct sk_buff *segs);
908 void skb_tx_error(struct sk_buff *skb);
909 void consume_skb(struct sk_buff *skb);
910 void __kfree_skb(struct sk_buff *skb);
911 extern struct kmem_cache *skbuff_head_cache;
913 void kfree_skb_partial(struct sk_buff *skb, bool head_stolen);
914 bool skb_try_coalesce(struct sk_buff *to, struct sk_buff *from,
915 bool *fragstolen, int *delta_truesize);
917 struct sk_buff *__alloc_skb(unsigned int size, gfp_t priority, int flags,
919 struct sk_buff *__build_skb(void *data, unsigned int frag_size);
920 struct sk_buff *build_skb(void *data, unsigned int frag_size);
921 static inline struct sk_buff *alloc_skb(unsigned int size,
924 return __alloc_skb(size, priority, 0, NUMA_NO_NODE);
927 struct sk_buff *alloc_skb_with_frags(unsigned long header_len,
928 unsigned long data_len,
933 /* Layout of fast clones : [skb1][skb2][fclone_ref] */
934 struct sk_buff_fclones {
943 * skb_fclone_busy - check if fclone is busy
947 * Returns true if skb is a fast clone, and its clone is not freed.
948 * Some drivers call skb_orphan() in their ndo_start_xmit(),
949 * so we also check that this didnt happen.
951 static inline bool skb_fclone_busy(const struct sock *sk,
952 const struct sk_buff *skb)
954 const struct sk_buff_fclones *fclones;
956 fclones = container_of(skb, struct sk_buff_fclones, skb1);
958 return skb->fclone == SKB_FCLONE_ORIG &&
959 atomic_read(&fclones->fclone_ref) > 1 &&
960 fclones->skb2.sk == sk;
963 static inline struct sk_buff *alloc_skb_fclone(unsigned int size,
966 return __alloc_skb(size, priority, SKB_ALLOC_FCLONE, NUMA_NO_NODE);
969 struct sk_buff *__alloc_skb_head(gfp_t priority, int node);
970 static inline struct sk_buff *alloc_skb_head(gfp_t priority)
972 return __alloc_skb_head(priority, -1);
975 struct sk_buff *skb_morph(struct sk_buff *dst, struct sk_buff *src);
976 int skb_copy_ubufs(struct sk_buff *skb, gfp_t gfp_mask);
977 struct sk_buff *skb_clone(struct sk_buff *skb, gfp_t priority);
978 struct sk_buff *skb_copy(const struct sk_buff *skb, gfp_t priority);
979 struct sk_buff *__pskb_copy_fclone(struct sk_buff *skb, int headroom,
980 gfp_t gfp_mask, bool fclone);
981 static inline struct sk_buff *__pskb_copy(struct sk_buff *skb, int headroom,
984 return __pskb_copy_fclone(skb, headroom, gfp_mask, false);
987 int pskb_expand_head(struct sk_buff *skb, int nhead, int ntail, gfp_t gfp_mask);
988 struct sk_buff *skb_realloc_headroom(struct sk_buff *skb,
989 unsigned int headroom);
990 struct sk_buff *skb_copy_expand(const struct sk_buff *skb, int newheadroom,
991 int newtailroom, gfp_t priority);
992 int __must_check skb_to_sgvec_nomark(struct sk_buff *skb, struct scatterlist *sg,
993 int offset, int len);
994 int __must_check skb_to_sgvec(struct sk_buff *skb, struct scatterlist *sg,
995 int offset, int len);
996 int skb_cow_data(struct sk_buff *skb, int tailbits, struct sk_buff **trailer);
997 int skb_pad(struct sk_buff *skb, int pad);
998 #define dev_kfree_skb(a) consume_skb(a)
1000 int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb,
1001 int getfrag(void *from, char *to, int offset,
1002 int len, int odd, struct sk_buff *skb),
1003 void *from, int length);
1005 int skb_append_pagefrags(struct sk_buff *skb, struct page *page,
1006 int offset, size_t size);
1008 struct skb_seq_state {
1012 __u32 stepped_offset;
1013 struct sk_buff *root_skb;
1014 struct sk_buff *cur_skb;
1018 void skb_prepare_seq_read(struct sk_buff *skb, unsigned int from,
1019 unsigned int to, struct skb_seq_state *st);
1020 unsigned int skb_seq_read(unsigned int consumed, const u8 **data,
1021 struct skb_seq_state *st);
1022 void skb_abort_seq_read(struct skb_seq_state *st);
1024 unsigned int skb_find_text(struct sk_buff *skb, unsigned int from,
1025 unsigned int to, struct ts_config *config);
1028 * Packet hash types specify the type of hash in skb_set_hash.
1030 * Hash types refer to the protocol layer addresses which are used to
1031 * construct a packet's hash. The hashes are used to differentiate or identify
1032 * flows of the protocol layer for the hash type. Hash types are either
1033 * layer-2 (L2), layer-3 (L3), or layer-4 (L4).
1035 * Properties of hashes:
1037 * 1) Two packets in different flows have different hash values
1038 * 2) Two packets in the same flow should have the same hash value
1040 * A hash at a higher layer is considered to be more specific. A driver should
1041 * set the most specific hash possible.
1043 * A driver cannot indicate a more specific hash than the layer at which a hash
1044 * was computed. For instance an L3 hash cannot be set as an L4 hash.
1046 * A driver may indicate a hash level which is less specific than the
1047 * actual layer the hash was computed on. For instance, a hash computed
1048 * at L4 may be considered an L3 hash. This should only be done if the
1049 * driver can't unambiguously determine that the HW computed the hash at
1050 * the higher layer. Note that the "should" in the second property above
1053 enum pkt_hash_types {
1054 PKT_HASH_TYPE_NONE, /* Undefined type */
1055 PKT_HASH_TYPE_L2, /* Input: src_MAC, dest_MAC */
1056 PKT_HASH_TYPE_L3, /* Input: src_IP, dst_IP */
1057 PKT_HASH_TYPE_L4, /* Input: src_IP, dst_IP, src_port, dst_port */
1060 static inline void skb_clear_hash(struct sk_buff *skb)
1067 static inline void skb_clear_hash_if_not_l4(struct sk_buff *skb)
1070 skb_clear_hash(skb);
1074 __skb_set_hash(struct sk_buff *skb, __u32 hash, bool is_sw, bool is_l4)
1076 skb->l4_hash = is_l4;
1077 skb->sw_hash = is_sw;
1082 skb_set_hash(struct sk_buff *skb, __u32 hash, enum pkt_hash_types type)
1084 /* Used by drivers to set hash from HW */
1085 __skb_set_hash(skb, hash, false, type == PKT_HASH_TYPE_L4);
1089 __skb_set_sw_hash(struct sk_buff *skb, __u32 hash, bool is_l4)
1091 __skb_set_hash(skb, hash, true, is_l4);
1094 void __skb_get_hash(struct sk_buff *skb);
1095 u32 __skb_get_hash_symmetric(struct sk_buff *skb);
1096 u32 skb_get_poff(const struct sk_buff *skb);
1097 u32 __skb_get_poff(const struct sk_buff *skb, void *data,
1098 const struct flow_keys *keys, int hlen);
1099 __be32 __skb_flow_get_ports(const struct sk_buff *skb, int thoff, u8 ip_proto,
1100 void *data, int hlen_proto);
1102 static inline __be32 skb_flow_get_ports(const struct sk_buff *skb,
1103 int thoff, u8 ip_proto)
1105 return __skb_flow_get_ports(skb, thoff, ip_proto, NULL, 0);
1108 void skb_flow_dissector_init(struct flow_dissector *flow_dissector,
1109 const struct flow_dissector_key *key,
1110 unsigned int key_count);
1112 bool __skb_flow_dissect(const struct sk_buff *skb,
1113 struct flow_dissector *flow_dissector,
1114 void *target_container,
1115 void *data, __be16 proto, int nhoff, int hlen,
1116 unsigned int flags);
1118 static inline bool skb_flow_dissect(const struct sk_buff *skb,
1119 struct flow_dissector *flow_dissector,
1120 void *target_container, unsigned int flags)
1122 return __skb_flow_dissect(skb, flow_dissector, target_container,
1123 NULL, 0, 0, 0, flags);
1126 static inline bool skb_flow_dissect_flow_keys(const struct sk_buff *skb,
1127 struct flow_keys *flow,
1130 memset(flow, 0, sizeof(*flow));
1131 return __skb_flow_dissect(skb, &flow_keys_dissector, flow,
1132 NULL, 0, 0, 0, flags);
1135 static inline bool skb_flow_dissect_flow_keys_buf(struct flow_keys *flow,
1136 void *data, __be16 proto,
1137 int nhoff, int hlen,
1140 memset(flow, 0, sizeof(*flow));
1141 return __skb_flow_dissect(NULL, &flow_keys_buf_dissector, flow,
1142 data, proto, nhoff, hlen, flags);
1145 static inline __u32 skb_get_hash(struct sk_buff *skb)
1147 if (!skb->l4_hash && !skb->sw_hash)
1148 __skb_get_hash(skb);
1153 __u32 __skb_get_hash_flowi6(struct sk_buff *skb, const struct flowi6 *fl6);
1155 static inline __u32 skb_get_hash_flowi6(struct sk_buff *skb, const struct flowi6 *fl6)
1157 if (!skb->l4_hash && !skb->sw_hash) {
1158 struct flow_keys keys;
1159 __u32 hash = __get_hash_from_flowi6(fl6, &keys);
1161 __skb_set_sw_hash(skb, hash, flow_keys_have_l4(&keys));
1167 __u32 __skb_get_hash_flowi4(struct sk_buff *skb, const struct flowi4 *fl);
1169 static inline __u32 skb_get_hash_flowi4(struct sk_buff *skb, const struct flowi4 *fl4)
1171 if (!skb->l4_hash && !skb->sw_hash) {
1172 struct flow_keys keys;
1173 __u32 hash = __get_hash_from_flowi4(fl4, &keys);
1175 __skb_set_sw_hash(skb, hash, flow_keys_have_l4(&keys));
1181 __u32 skb_get_hash_perturb(const struct sk_buff *skb,
1182 const siphash_key_t *perturb);
1184 static inline __u32 skb_get_hash_raw(const struct sk_buff *skb)
1189 static inline void skb_copy_hash(struct sk_buff *to, const struct sk_buff *from)
1191 to->hash = from->hash;
1192 to->sw_hash = from->sw_hash;
1193 to->l4_hash = from->l4_hash;
1196 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1197 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
1199 return skb->head + skb->end;
1202 static inline unsigned int skb_end_offset(const struct sk_buff *skb)
1207 static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
1212 static inline unsigned int skb_end_offset(const struct sk_buff *skb)
1214 return skb->end - skb->head;
1219 #define skb_shinfo(SKB) ((struct skb_shared_info *)(skb_end_pointer(SKB)))
1221 static inline struct skb_shared_hwtstamps *skb_hwtstamps(struct sk_buff *skb)
1223 return &skb_shinfo(skb)->hwtstamps;
1227 * skb_queue_empty - check if a queue is empty
1230 * Returns true if the queue is empty, false otherwise.
1232 static inline int skb_queue_empty(const struct sk_buff_head *list)
1234 return list->next == (const struct sk_buff *) list;
1238 * skb_queue_is_last - check if skb is the last entry in the queue
1242 * Returns true if @skb is the last buffer on the list.
1244 static inline bool skb_queue_is_last(const struct sk_buff_head *list,
1245 const struct sk_buff *skb)
1247 return skb->next == (const struct sk_buff *) list;
1251 * skb_queue_is_first - check if skb is the first entry in the queue
1255 * Returns true if @skb is the first buffer on the list.
1257 static inline bool skb_queue_is_first(const struct sk_buff_head *list,
1258 const struct sk_buff *skb)
1260 return skb->prev == (const struct sk_buff *) list;
1264 * skb_queue_next - return the next packet in the queue
1266 * @skb: current buffer
1268 * Return the next packet in @list after @skb. It is only valid to
1269 * call this if skb_queue_is_last() evaluates to false.
1271 static inline struct sk_buff *skb_queue_next(const struct sk_buff_head *list,
1272 const struct sk_buff *skb)
1274 /* This BUG_ON may seem severe, but if we just return then we
1275 * are going to dereference garbage.
1277 BUG_ON(skb_queue_is_last(list, skb));
1282 * skb_queue_prev - return the prev packet in the queue
1284 * @skb: current buffer
1286 * Return the prev packet in @list before @skb. It is only valid to
1287 * call this if skb_queue_is_first() evaluates to false.
1289 static inline struct sk_buff *skb_queue_prev(const struct sk_buff_head *list,
1290 const struct sk_buff *skb)
1292 /* This BUG_ON may seem severe, but if we just return then we
1293 * are going to dereference garbage.
1295 BUG_ON(skb_queue_is_first(list, skb));
1300 * skb_get - reference buffer
1301 * @skb: buffer to reference
1303 * Makes another reference to a socket buffer and returns a pointer
1306 static inline struct sk_buff *skb_get(struct sk_buff *skb)
1308 atomic_inc(&skb->users);
1313 * If users == 1, we are the only owner and are can avoid redundant
1318 * skb_cloned - is the buffer a clone
1319 * @skb: buffer to check
1321 * Returns true if the buffer was generated with skb_clone() and is
1322 * one of multiple shared copies of the buffer. Cloned buffers are
1323 * shared data so must not be written to under normal circumstances.
1325 static inline int skb_cloned(const struct sk_buff *skb)
1327 return skb->cloned &&
1328 (atomic_read(&skb_shinfo(skb)->dataref) & SKB_DATAREF_MASK) != 1;
1331 static inline int skb_unclone(struct sk_buff *skb, gfp_t pri)
1333 might_sleep_if(gfpflags_allow_blocking(pri));
1335 if (skb_cloned(skb))
1336 return pskb_expand_head(skb, 0, 0, pri);
1342 * skb_header_cloned - is the header a clone
1343 * @skb: buffer to check
1345 * Returns true if modifying the header part of the buffer requires
1346 * the data to be copied.
1348 static inline int skb_header_cloned(const struct sk_buff *skb)
1355 dataref = atomic_read(&skb_shinfo(skb)->dataref);
1356 dataref = (dataref & SKB_DATAREF_MASK) - (dataref >> SKB_DATAREF_SHIFT);
1357 return dataref != 1;
1360 static inline int skb_header_unclone(struct sk_buff *skb, gfp_t pri)
1362 might_sleep_if(gfpflags_allow_blocking(pri));
1364 if (skb_header_cloned(skb))
1365 return pskb_expand_head(skb, 0, 0, pri);
1371 * skb_header_release - release reference to header
1372 * @skb: buffer to operate on
1374 * Drop a reference to the header part of the buffer. This is done
1375 * by acquiring a payload reference. You must not read from the header
1376 * part of skb->data after this.
1377 * Note : Check if you can use __skb_header_release() instead.
1379 static inline void skb_header_release(struct sk_buff *skb)
1383 atomic_add(1 << SKB_DATAREF_SHIFT, &skb_shinfo(skb)->dataref);
1387 * __skb_header_release - release reference to header
1388 * @skb: buffer to operate on
1390 * Variant of skb_header_release() assuming skb is private to caller.
1391 * We can avoid one atomic operation.
1393 static inline void __skb_header_release(struct sk_buff *skb)
1396 atomic_set(&skb_shinfo(skb)->dataref, 1 + (1 << SKB_DATAREF_SHIFT));
1401 * skb_shared - is the buffer shared
1402 * @skb: buffer to check
1404 * Returns true if more than one person has a reference to this
1407 static inline int skb_shared(const struct sk_buff *skb)
1409 return atomic_read(&skb->users) != 1;
1413 * skb_share_check - check if buffer is shared and if so clone it
1414 * @skb: buffer to check
1415 * @pri: priority for memory allocation
1417 * If the buffer is shared the buffer is cloned and the old copy
1418 * drops a reference. A new clone with a single reference is returned.
1419 * If the buffer is not shared the original buffer is returned. When
1420 * being called from interrupt status or with spinlocks held pri must
1423 * NULL is returned on a memory allocation failure.
1425 static inline struct sk_buff *skb_share_check(struct sk_buff *skb, gfp_t pri)
1427 might_sleep_if(gfpflags_allow_blocking(pri));
1428 if (skb_shared(skb)) {
1429 struct sk_buff *nskb = skb_clone(skb, pri);
1441 * Copy shared buffers into a new sk_buff. We effectively do COW on
1442 * packets to handle cases where we have a local reader and forward
1443 * and a couple of other messy ones. The normal one is tcpdumping
1444 * a packet thats being forwarded.
1448 * skb_unshare - make a copy of a shared buffer
1449 * @skb: buffer to check
1450 * @pri: priority for memory allocation
1452 * If the socket buffer is a clone then this function creates a new
1453 * copy of the data, drops a reference count on the old copy and returns
1454 * the new copy with the reference count at 1. If the buffer is not a clone
1455 * the original buffer is returned. When called with a spinlock held or
1456 * from interrupt state @pri must be %GFP_ATOMIC
1458 * %NULL is returned on a memory allocation failure.
1460 static inline struct sk_buff *skb_unshare(struct sk_buff *skb,
1463 might_sleep_if(gfpflags_allow_blocking(pri));
1464 if (skb_cloned(skb)) {
1465 struct sk_buff *nskb = skb_copy(skb, pri);
1467 /* Free our shared copy */
1478 * skb_peek - peek at the head of an &sk_buff_head
1479 * @list_: list to peek at
1481 * Peek an &sk_buff. Unlike most other operations you _MUST_
1482 * be careful with this one. A peek leaves the buffer on the
1483 * list and someone else may run off with it. You must hold
1484 * the appropriate locks or have a private queue to do this.
1486 * Returns %NULL for an empty list or a pointer to the head element.
1487 * The reference count is not incremented and the reference is therefore
1488 * volatile. Use with caution.
1490 static inline struct sk_buff *skb_peek(const struct sk_buff_head *list_)
1492 struct sk_buff *skb = list_->next;
1494 if (skb == (struct sk_buff *)list_)
1500 * skb_peek_next - peek skb following the given one from a queue
1501 * @skb: skb to start from
1502 * @list_: list to peek at
1504 * Returns %NULL when the end of the list is met or a pointer to the
1505 * next element. The reference count is not incremented and the
1506 * reference is therefore volatile. Use with caution.
1508 static inline struct sk_buff *skb_peek_next(struct sk_buff *skb,
1509 const struct sk_buff_head *list_)
1511 struct sk_buff *next = skb->next;
1513 if (next == (struct sk_buff *)list_)
1519 * skb_peek_tail - peek at the tail of an &sk_buff_head
1520 * @list_: list to peek at
1522 * Peek an &sk_buff. Unlike most other operations you _MUST_
1523 * be careful with this one. A peek leaves the buffer on the
1524 * list and someone else may run off with it. You must hold
1525 * the appropriate locks or have a private queue to do this.
1527 * Returns %NULL for an empty list or a pointer to the tail element.
1528 * The reference count is not incremented and the reference is therefore
1529 * volatile. Use with caution.
1531 static inline struct sk_buff *skb_peek_tail(const struct sk_buff_head *list_)
1533 struct sk_buff *skb = list_->prev;
1535 if (skb == (struct sk_buff *)list_)
1542 * skb_queue_len - get queue length
1543 * @list_: list to measure
1545 * Return the length of an &sk_buff queue.
1547 static inline __u32 skb_queue_len(const struct sk_buff_head *list_)
1553 * skb_queue_len_lockless - get queue length
1554 * @list_: list to measure
1556 * Return the length of an &sk_buff queue.
1557 * This variant can be used in lockless contexts.
1559 static inline __u32 skb_queue_len_lockless(const struct sk_buff_head *list_)
1561 return READ_ONCE(list_->qlen);
1565 * __skb_queue_head_init - initialize non-spinlock portions of sk_buff_head
1566 * @list: queue to initialize
1568 * This initializes only the list and queue length aspects of
1569 * an sk_buff_head object. This allows to initialize the list
1570 * aspects of an sk_buff_head without reinitializing things like
1571 * the spinlock. It can also be used for on-stack sk_buff_head
1572 * objects where the spinlock is known to not be used.
1574 static inline void __skb_queue_head_init(struct sk_buff_head *list)
1576 list->prev = list->next = (struct sk_buff *)list;
1581 * This function creates a split out lock class for each invocation;
1582 * this is needed for now since a whole lot of users of the skb-queue
1583 * infrastructure in drivers have different locking usage (in hardirq)
1584 * than the networking core (in softirq only). In the long run either the
1585 * network layer or drivers should need annotation to consolidate the
1586 * main types of usage into 3 classes.
1588 static inline void skb_queue_head_init(struct sk_buff_head *list)
1590 spin_lock_init(&list->lock);
1591 __skb_queue_head_init(list);
1594 static inline void skb_queue_head_init_class(struct sk_buff_head *list,
1595 struct lock_class_key *class)
1597 skb_queue_head_init(list);
1598 lockdep_set_class(&list->lock, class);
1602 * Insert an sk_buff on a list.
1604 * The "__skb_xxxx()" functions are the non-atomic ones that
1605 * can only be called with interrupts disabled.
1607 void skb_insert(struct sk_buff *old, struct sk_buff *newsk,
1608 struct sk_buff_head *list);
1609 static inline void __skb_insert(struct sk_buff *newsk,
1610 struct sk_buff *prev, struct sk_buff *next,
1611 struct sk_buff_head *list)
1615 next->prev = prev->next = newsk;
1616 WRITE_ONCE(list->qlen, list->qlen + 1);
1619 static inline void __skb_queue_splice(const struct sk_buff_head *list,
1620 struct sk_buff *prev,
1621 struct sk_buff *next)
1623 struct sk_buff *first = list->next;
1624 struct sk_buff *last = list->prev;
1634 * skb_queue_splice - join two skb lists, this is designed for stacks
1635 * @list: the new list to add
1636 * @head: the place to add it in the first list
1638 static inline void skb_queue_splice(const struct sk_buff_head *list,
1639 struct sk_buff_head *head)
1641 if (!skb_queue_empty(list)) {
1642 __skb_queue_splice(list, (struct sk_buff *) head, head->next);
1643 head->qlen += list->qlen;
1648 * skb_queue_splice_init - join two skb lists and reinitialise the emptied list
1649 * @list: the new list to add
1650 * @head: the place to add it in the first list
1652 * The list at @list is reinitialised
1654 static inline void skb_queue_splice_init(struct sk_buff_head *list,
1655 struct sk_buff_head *head)
1657 if (!skb_queue_empty(list)) {
1658 __skb_queue_splice(list, (struct sk_buff *) head, head->next);
1659 head->qlen += list->qlen;
1660 __skb_queue_head_init(list);
1665 * skb_queue_splice_tail - join two skb lists, each list being a queue
1666 * @list: the new list to add
1667 * @head: the place to add it in the first list
1669 static inline void skb_queue_splice_tail(const struct sk_buff_head *list,
1670 struct sk_buff_head *head)
1672 if (!skb_queue_empty(list)) {
1673 __skb_queue_splice(list, head->prev, (struct sk_buff *) head);
1674 head->qlen += list->qlen;
1679 * skb_queue_splice_tail_init - join two skb lists and reinitialise the emptied list
1680 * @list: the new list to add
1681 * @head: the place to add it in the first list
1683 * Each of the lists is a queue.
1684 * The list at @list is reinitialised
1686 static inline void skb_queue_splice_tail_init(struct sk_buff_head *list,
1687 struct sk_buff_head *head)
1689 if (!skb_queue_empty(list)) {
1690 __skb_queue_splice(list, head->prev, (struct sk_buff *) head);
1691 head->qlen += list->qlen;
1692 __skb_queue_head_init(list);
1697 * __skb_queue_after - queue a buffer at the list head
1698 * @list: list to use
1699 * @prev: place after this buffer
1700 * @newsk: buffer to queue
1702 * Queue a buffer int the middle of a list. This function takes no locks
1703 * and you must therefore hold required locks before calling it.
1705 * A buffer cannot be placed on two lists at the same time.
1707 static inline void __skb_queue_after(struct sk_buff_head *list,
1708 struct sk_buff *prev,
1709 struct sk_buff *newsk)
1711 __skb_insert(newsk, prev, prev->next, list);
1714 void skb_append(struct sk_buff *old, struct sk_buff *newsk,
1715 struct sk_buff_head *list);
1717 static inline void __skb_queue_before(struct sk_buff_head *list,
1718 struct sk_buff *next,
1719 struct sk_buff *newsk)
1721 __skb_insert(newsk, next->prev, next, list);
1725 * __skb_queue_head - queue a buffer at the list head
1726 * @list: list to use
1727 * @newsk: buffer to queue
1729 * Queue a buffer at the start of a list. This function takes no locks
1730 * and you must therefore hold required locks before calling it.
1732 * A buffer cannot be placed on two lists at the same time.
1734 void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk);
1735 static inline void __skb_queue_head(struct sk_buff_head *list,
1736 struct sk_buff *newsk)
1738 __skb_queue_after(list, (struct sk_buff *)list, newsk);
1742 * __skb_queue_tail - queue a buffer at the list tail
1743 * @list: list to use
1744 * @newsk: buffer to queue
1746 * Queue a buffer at the end of a list. This function takes no locks
1747 * and you must therefore hold required locks before calling it.
1749 * A buffer cannot be placed on two lists at the same time.
1751 void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk);
1752 static inline void __skb_queue_tail(struct sk_buff_head *list,
1753 struct sk_buff *newsk)
1755 __skb_queue_before(list, (struct sk_buff *)list, newsk);
1759 * remove sk_buff from list. _Must_ be called atomically, and with
1762 void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list);
1763 static inline void __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
1765 struct sk_buff *next, *prev;
1767 WRITE_ONCE(list->qlen, list->qlen - 1);
1770 skb->next = skb->prev = NULL;
1776 * __skb_dequeue - remove from the head of the queue
1777 * @list: list to dequeue from
1779 * Remove the head of the list. This function does not take any locks
1780 * so must be used with appropriate locks held only. The head item is
1781 * returned or %NULL if the list is empty.
1783 struct sk_buff *skb_dequeue(struct sk_buff_head *list);
1784 static inline struct sk_buff *__skb_dequeue(struct sk_buff_head *list)
1786 struct sk_buff *skb = skb_peek(list);
1788 __skb_unlink(skb, list);
1793 * __skb_dequeue_tail - remove from the tail of the queue
1794 * @list: list to dequeue from
1796 * Remove the tail of the list. This function does not take any locks
1797 * so must be used with appropriate locks held only. The tail item is
1798 * returned or %NULL if the list is empty.
1800 struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list);
1801 static inline struct sk_buff *__skb_dequeue_tail(struct sk_buff_head *list)
1803 struct sk_buff *skb = skb_peek_tail(list);
1805 __skb_unlink(skb, list);
1810 static inline bool skb_is_nonlinear(const struct sk_buff *skb)
1812 return skb->data_len;
1815 static inline unsigned int skb_headlen(const struct sk_buff *skb)
1817 return skb->len - skb->data_len;
1820 static inline int skb_pagelen(const struct sk_buff *skb)
1824 for (i = (int)skb_shinfo(skb)->nr_frags - 1; i >= 0; i--)
1825 len += skb_frag_size(&skb_shinfo(skb)->frags[i]);
1826 return len + skb_headlen(skb);
1830 * __skb_fill_page_desc - initialise a paged fragment in an skb
1831 * @skb: buffer containing fragment to be initialised
1832 * @i: paged fragment index to initialise
1833 * @page: the page to use for this fragment
1834 * @off: the offset to the data with @page
1835 * @size: the length of the data
1837 * Initialises the @i'th fragment of @skb to point to &size bytes at
1838 * offset @off within @page.
1840 * Does not take any additional reference on the fragment.
1842 static inline void __skb_fill_page_desc(struct sk_buff *skb, int i,
1843 struct page *page, int off, int size)
1845 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
1848 * Propagate page pfmemalloc to the skb if we can. The problem is
1849 * that not all callers have unique ownership of the page but rely
1850 * on page_is_pfmemalloc doing the right thing(tm).
1852 frag->page.p = page;
1853 frag->page_offset = off;
1854 skb_frag_size_set(frag, size);
1856 page = compound_head(page);
1857 if (page_is_pfmemalloc(page))
1858 skb->pfmemalloc = true;
1862 * skb_fill_page_desc - initialise a paged fragment in an skb
1863 * @skb: buffer containing fragment to be initialised
1864 * @i: paged fragment index to initialise
1865 * @page: the page to use for this fragment
1866 * @off: the offset to the data with @page
1867 * @size: the length of the data
1869 * As per __skb_fill_page_desc() -- initialises the @i'th fragment of
1870 * @skb to point to @size bytes at offset @off within @page. In
1871 * addition updates @skb such that @i is the last fragment.
1873 * Does not take any additional reference on the fragment.
1875 static inline void skb_fill_page_desc(struct sk_buff *skb, int i,
1876 struct page *page, int off, int size)
1878 __skb_fill_page_desc(skb, i, page, off, size);
1879 skb_shinfo(skb)->nr_frags = i + 1;
1882 void skb_add_rx_frag(struct sk_buff *skb, int i, struct page *page, int off,
1883 int size, unsigned int truesize);
1885 void skb_coalesce_rx_frag(struct sk_buff *skb, int i, int size,
1886 unsigned int truesize);
1888 #define SKB_PAGE_ASSERT(skb) BUG_ON(skb_shinfo(skb)->nr_frags)
1889 #define SKB_FRAG_ASSERT(skb) BUG_ON(skb_has_frag_list(skb))
1890 #define SKB_LINEAR_ASSERT(skb) BUG_ON(skb_is_nonlinear(skb))
1892 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1893 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
1895 return skb->head + skb->tail;
1898 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
1900 skb->tail = skb->data - skb->head;
1903 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
1905 skb_reset_tail_pointer(skb);
1906 skb->tail += offset;
1909 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1910 static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
1915 static inline void skb_reset_tail_pointer(struct sk_buff *skb)
1917 skb->tail = skb->data;
1920 static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
1922 skb->tail = skb->data + offset;
1925 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1928 * Add data to an sk_buff
1930 unsigned char *pskb_put(struct sk_buff *skb, struct sk_buff *tail, int len);
1931 unsigned char *skb_put(struct sk_buff *skb, unsigned int len);
1932 static inline unsigned char *__skb_put(struct sk_buff *skb, unsigned int len)
1934 unsigned char *tmp = skb_tail_pointer(skb);
1935 SKB_LINEAR_ASSERT(skb);
1941 unsigned char *skb_push(struct sk_buff *skb, unsigned int len);
1942 static inline unsigned char *__skb_push(struct sk_buff *skb, unsigned int len)
1949 unsigned char *skb_pull(struct sk_buff *skb, unsigned int len);
1950 static inline unsigned char *__skb_pull(struct sk_buff *skb, unsigned int len)
1953 BUG_ON(skb->len < skb->data_len);
1954 return skb->data += len;
1957 static inline unsigned char *skb_pull_inline(struct sk_buff *skb, unsigned int len)
1959 return unlikely(len > skb->len) ? NULL : __skb_pull(skb, len);
1962 unsigned char *__pskb_pull_tail(struct sk_buff *skb, int delta);
1964 static inline unsigned char *__pskb_pull(struct sk_buff *skb, unsigned int len)
1966 if (len > skb_headlen(skb) &&
1967 !__pskb_pull_tail(skb, len - skb_headlen(skb)))
1970 return skb->data += len;
1973 static inline unsigned char *pskb_pull(struct sk_buff *skb, unsigned int len)
1975 return unlikely(len > skb->len) ? NULL : __pskb_pull(skb, len);
1978 static inline int pskb_may_pull(struct sk_buff *skb, unsigned int len)
1980 if (likely(len <= skb_headlen(skb)))
1982 if (unlikely(len > skb->len))
1984 return __pskb_pull_tail(skb, len - skb_headlen(skb)) != NULL;
1988 * skb_headroom - bytes at buffer head
1989 * @skb: buffer to check
1991 * Return the number of bytes of free space at the head of an &sk_buff.
1993 static inline unsigned int skb_headroom(const struct sk_buff *skb)
1995 return skb->data - skb->head;
1999 * skb_tailroom - bytes at buffer end
2000 * @skb: buffer to check
2002 * Return the number of bytes of free space at the tail of an sk_buff
2004 static inline int skb_tailroom(const struct sk_buff *skb)
2006 return skb_is_nonlinear(skb) ? 0 : skb->end - skb->tail;
2010 * skb_availroom - bytes at buffer end
2011 * @skb: buffer to check
2013 * Return the number of bytes of free space at the tail of an sk_buff
2014 * allocated by sk_stream_alloc()
2016 static inline int skb_availroom(const struct sk_buff *skb)
2018 if (skb_is_nonlinear(skb))
2021 return skb->end - skb->tail - skb->reserved_tailroom;
2025 * skb_reserve - adjust headroom
2026 * @skb: buffer to alter
2027 * @len: bytes to move
2029 * Increase the headroom of an empty &sk_buff by reducing the tail
2030 * room. This is only allowed for an empty buffer.
2032 static inline void skb_reserve(struct sk_buff *skb, int len)
2039 * skb_tailroom_reserve - adjust reserved_tailroom
2040 * @skb: buffer to alter
2041 * @mtu: maximum amount of headlen permitted
2042 * @needed_tailroom: minimum amount of reserved_tailroom
2044 * Set reserved_tailroom so that headlen can be as large as possible but
2045 * not larger than mtu and tailroom cannot be smaller than
2047 * The required headroom should already have been reserved before using
2050 static inline void skb_tailroom_reserve(struct sk_buff *skb, unsigned int mtu,
2051 unsigned int needed_tailroom)
2053 SKB_LINEAR_ASSERT(skb);
2054 if (mtu < skb_tailroom(skb) - needed_tailroom)
2055 /* use at most mtu */
2056 skb->reserved_tailroom = skb_tailroom(skb) - mtu;
2058 /* use up to all available space */
2059 skb->reserved_tailroom = needed_tailroom;
2062 #define ENCAP_TYPE_ETHER 0
2063 #define ENCAP_TYPE_IPPROTO 1
2065 static inline void skb_set_inner_protocol(struct sk_buff *skb,
2068 skb->inner_protocol = protocol;
2069 skb->inner_protocol_type = ENCAP_TYPE_ETHER;
2072 static inline void skb_set_inner_ipproto(struct sk_buff *skb,
2075 skb->inner_ipproto = ipproto;
2076 skb->inner_protocol_type = ENCAP_TYPE_IPPROTO;
2079 static inline void skb_reset_inner_headers(struct sk_buff *skb)
2081 skb->inner_mac_header = skb->mac_header;
2082 skb->inner_network_header = skb->network_header;
2083 skb->inner_transport_header = skb->transport_header;
2086 static inline void skb_reset_mac_len(struct sk_buff *skb)
2088 skb->mac_len = skb->network_header - skb->mac_header;
2091 static inline unsigned char *skb_inner_transport_header(const struct sk_buff
2094 return skb->head + skb->inner_transport_header;
2097 static inline int skb_inner_transport_offset(const struct sk_buff *skb)
2099 return skb_inner_transport_header(skb) - skb->data;
2102 static inline void skb_reset_inner_transport_header(struct sk_buff *skb)
2104 skb->inner_transport_header = skb->data - skb->head;
2107 static inline void skb_set_inner_transport_header(struct sk_buff *skb,
2110 skb_reset_inner_transport_header(skb);
2111 skb->inner_transport_header += offset;
2114 static inline unsigned char *skb_inner_network_header(const struct sk_buff *skb)
2116 return skb->head + skb->inner_network_header;
2119 static inline void skb_reset_inner_network_header(struct sk_buff *skb)
2121 skb->inner_network_header = skb->data - skb->head;
2124 static inline void skb_set_inner_network_header(struct sk_buff *skb,
2127 skb_reset_inner_network_header(skb);
2128 skb->inner_network_header += offset;
2131 static inline unsigned char *skb_inner_mac_header(const struct sk_buff *skb)
2133 return skb->head + skb->inner_mac_header;
2136 static inline void skb_reset_inner_mac_header(struct sk_buff *skb)
2138 skb->inner_mac_header = skb->data - skb->head;
2141 static inline void skb_set_inner_mac_header(struct sk_buff *skb,
2144 skb_reset_inner_mac_header(skb);
2145 skb->inner_mac_header += offset;
2147 static inline bool skb_transport_header_was_set(const struct sk_buff *skb)
2149 return skb->transport_header != (typeof(skb->transport_header))~0U;
2152 static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
2154 return skb->head + skb->transport_header;
2157 static inline void skb_reset_transport_header(struct sk_buff *skb)
2159 skb->transport_header = skb->data - skb->head;
2162 static inline void skb_set_transport_header(struct sk_buff *skb,
2165 skb_reset_transport_header(skb);
2166 skb->transport_header += offset;
2169 static inline unsigned char *skb_network_header(const struct sk_buff *skb)
2171 return skb->head + skb->network_header;
2174 static inline void skb_reset_network_header(struct sk_buff *skb)
2176 skb->network_header = skb->data - skb->head;
2179 static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
2181 skb_reset_network_header(skb);
2182 skb->network_header += offset;
2185 static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
2187 return skb->head + skb->mac_header;
2190 static inline int skb_mac_header_was_set(const struct sk_buff *skb)
2192 return skb->mac_header != (typeof(skb->mac_header))~0U;
2195 static inline void skb_reset_mac_header(struct sk_buff *skb)
2197 skb->mac_header = skb->data - skb->head;
2200 static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
2202 skb_reset_mac_header(skb);
2203 skb->mac_header += offset;
2206 static inline void skb_pop_mac_header(struct sk_buff *skb)
2208 skb->mac_header = skb->network_header;
2211 static inline void skb_probe_transport_header(struct sk_buff *skb,
2212 const int offset_hint)
2214 struct flow_keys keys;
2216 if (skb_transport_header_was_set(skb))
2218 else if (skb_flow_dissect_flow_keys(skb, &keys, 0))
2219 skb_set_transport_header(skb, keys.control.thoff);
2221 skb_set_transport_header(skb, offset_hint);
2224 static inline void skb_mac_header_rebuild(struct sk_buff *skb)
2226 if (skb_mac_header_was_set(skb)) {
2227 const unsigned char *old_mac = skb_mac_header(skb);
2229 skb_set_mac_header(skb, -skb->mac_len);
2230 memmove(skb_mac_header(skb), old_mac, skb->mac_len);
2234 static inline int skb_checksum_start_offset(const struct sk_buff *skb)
2236 return skb->csum_start - skb_headroom(skb);
2239 static inline unsigned char *skb_checksum_start(const struct sk_buff *skb)
2241 return skb->head + skb->csum_start;
2244 static inline int skb_transport_offset(const struct sk_buff *skb)
2246 return skb_transport_header(skb) - skb->data;
2249 static inline u32 skb_network_header_len(const struct sk_buff *skb)
2251 return skb->transport_header - skb->network_header;
2254 static inline u32 skb_inner_network_header_len(const struct sk_buff *skb)
2256 return skb->inner_transport_header - skb->inner_network_header;
2259 static inline int skb_network_offset(const struct sk_buff *skb)
2261 return skb_network_header(skb) - skb->data;
2264 static inline int skb_inner_network_offset(const struct sk_buff *skb)
2266 return skb_inner_network_header(skb) - skb->data;
2269 static inline int pskb_network_may_pull(struct sk_buff *skb, unsigned int len)
2271 return pskb_may_pull(skb, skb_network_offset(skb) + len);
2275 * CPUs often take a performance hit when accessing unaligned memory
2276 * locations. The actual performance hit varies, it can be small if the
2277 * hardware handles it or large if we have to take an exception and fix it
2280 * Since an ethernet header is 14 bytes network drivers often end up with
2281 * the IP header at an unaligned offset. The IP header can be aligned by
2282 * shifting the start of the packet by 2 bytes. Drivers should do this
2285 * skb_reserve(skb, NET_IP_ALIGN);
2287 * The downside to this alignment of the IP header is that the DMA is now
2288 * unaligned. On some architectures the cost of an unaligned DMA is high
2289 * and this cost outweighs the gains made by aligning the IP header.
2291 * Since this trade off varies between architectures, we allow NET_IP_ALIGN
2294 #ifndef NET_IP_ALIGN
2295 #define NET_IP_ALIGN 2
2299 * The networking layer reserves some headroom in skb data (via
2300 * dev_alloc_skb). This is used to avoid having to reallocate skb data when
2301 * the header has to grow. In the default case, if the header has to grow
2302 * 32 bytes or less we avoid the reallocation.
2304 * Unfortunately this headroom changes the DMA alignment of the resulting
2305 * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive
2306 * on some architectures. An architecture can override this value,
2307 * perhaps setting it to a cacheline in size (since that will maintain
2308 * cacheline alignment of the DMA). It must be a power of 2.
2310 * Various parts of the networking layer expect at least 32 bytes of
2311 * headroom, you should not reduce this.
2313 * Using max(32, L1_CACHE_BYTES) makes sense (especially with RPS)
2314 * to reduce average number of cache lines per packet.
2315 * get_rps_cpus() for example only access one 64 bytes aligned block :
2316 * NET_IP_ALIGN(2) + ethernet_header(14) + IP_header(20/40) + ports(8)
2319 #define NET_SKB_PAD max(32, L1_CACHE_BYTES)
2322 int ___pskb_trim(struct sk_buff *skb, unsigned int len);
2324 static inline void __skb_set_length(struct sk_buff *skb, unsigned int len)
2326 if (unlikely(skb_is_nonlinear(skb))) {
2331 skb_set_tail_pointer(skb, len);
2334 static inline void __skb_trim(struct sk_buff *skb, unsigned int len)
2336 __skb_set_length(skb, len);
2339 void skb_trim(struct sk_buff *skb, unsigned int len);
2341 static inline int __pskb_trim(struct sk_buff *skb, unsigned int len)
2344 return ___pskb_trim(skb, len);
2345 __skb_trim(skb, len);
2349 static inline int pskb_trim(struct sk_buff *skb, unsigned int len)
2351 return (len < skb->len) ? __pskb_trim(skb, len) : 0;
2355 * pskb_trim_unique - remove end from a paged unique (not cloned) buffer
2356 * @skb: buffer to alter
2359 * This is identical to pskb_trim except that the caller knows that
2360 * the skb is not cloned so we should never get an error due to out-
2363 static inline void pskb_trim_unique(struct sk_buff *skb, unsigned int len)
2365 int err = pskb_trim(skb, len);
2369 static inline int __skb_grow(struct sk_buff *skb, unsigned int len)
2371 unsigned int diff = len - skb->len;
2373 if (skb_tailroom(skb) < diff) {
2374 int ret = pskb_expand_head(skb, 0, diff - skb_tailroom(skb),
2379 __skb_set_length(skb, len);
2384 * skb_orphan - orphan a buffer
2385 * @skb: buffer to orphan
2387 * If a buffer currently has an owner then we call the owner's
2388 * destructor function and make the @skb unowned. The buffer continues
2389 * to exist but is no longer charged to its former owner.
2391 static inline void skb_orphan(struct sk_buff *skb)
2393 if (skb->destructor) {
2394 skb->destructor(skb);
2395 skb->destructor = NULL;
2403 * skb_orphan_frags - orphan the frags contained in a buffer
2404 * @skb: buffer to orphan frags from
2405 * @gfp_mask: allocation mask for replacement pages
2407 * For each frag in the SKB which needs a destructor (i.e. has an
2408 * owner) create a copy of that frag and release the original
2409 * page by calling the destructor.
2411 static inline int skb_orphan_frags(struct sk_buff *skb, gfp_t gfp_mask)
2413 if (likely(!(skb_shinfo(skb)->tx_flags & SKBTX_DEV_ZEROCOPY)))
2415 return skb_copy_ubufs(skb, gfp_mask);
2419 * __skb_queue_purge - empty a list
2420 * @list: list to empty
2422 * Delete all buffers on an &sk_buff list. Each buffer is removed from
2423 * the list and one reference dropped. This function does not take the
2424 * list lock and the caller must hold the relevant locks to use it.
2426 void skb_queue_purge(struct sk_buff_head *list);
2427 static inline void __skb_queue_purge(struct sk_buff_head *list)
2429 struct sk_buff *skb;
2430 while ((skb = __skb_dequeue(list)) != NULL)
2434 unsigned int skb_rbtree_purge(struct rb_root *root);
2436 void *netdev_alloc_frag(unsigned int fragsz);
2438 struct sk_buff *__netdev_alloc_skb(struct net_device *dev, unsigned int length,
2442 * netdev_alloc_skb - allocate an skbuff for rx on a specific device
2443 * @dev: network device to receive on
2444 * @length: length to allocate
2446 * Allocate a new &sk_buff and assign it a usage count of one. The
2447 * buffer has unspecified headroom built in. Users should allocate
2448 * the headroom they think they need without accounting for the
2449 * built in space. The built in space is used for optimisations.
2451 * %NULL is returned if there is no free memory. Although this function
2452 * allocates memory it can be called from an interrupt.
2454 static inline struct sk_buff *netdev_alloc_skb(struct net_device *dev,
2455 unsigned int length)
2457 return __netdev_alloc_skb(dev, length, GFP_ATOMIC);
2460 /* legacy helper around __netdev_alloc_skb() */
2461 static inline struct sk_buff *__dev_alloc_skb(unsigned int length,
2464 return __netdev_alloc_skb(NULL, length, gfp_mask);
2467 /* legacy helper around netdev_alloc_skb() */
2468 static inline struct sk_buff *dev_alloc_skb(unsigned int length)
2470 return netdev_alloc_skb(NULL, length);
2474 static inline struct sk_buff *__netdev_alloc_skb_ip_align(struct net_device *dev,
2475 unsigned int length, gfp_t gfp)
2477 struct sk_buff *skb = __netdev_alloc_skb(dev, length + NET_IP_ALIGN, gfp);
2479 if (NET_IP_ALIGN && skb)
2480 skb_reserve(skb, NET_IP_ALIGN);
2484 static inline struct sk_buff *netdev_alloc_skb_ip_align(struct net_device *dev,
2485 unsigned int length)
2487 return __netdev_alloc_skb_ip_align(dev, length, GFP_ATOMIC);
2490 static inline void skb_free_frag(void *addr)
2492 __free_page_frag(addr);
2495 void *napi_alloc_frag(unsigned int fragsz);
2496 struct sk_buff *__napi_alloc_skb(struct napi_struct *napi,
2497 unsigned int length, gfp_t gfp_mask);
2498 static inline struct sk_buff *napi_alloc_skb(struct napi_struct *napi,
2499 unsigned int length)
2501 return __napi_alloc_skb(napi, length, GFP_ATOMIC);
2503 void napi_consume_skb(struct sk_buff *skb, int budget);
2505 void __kfree_skb_flush(void);
2506 void __kfree_skb_defer(struct sk_buff *skb);
2509 * __dev_alloc_pages - allocate page for network Rx
2510 * @gfp_mask: allocation priority. Set __GFP_NOMEMALLOC if not for network Rx
2511 * @order: size of the allocation
2513 * Allocate a new page.
2515 * %NULL is returned if there is no free memory.
2517 static inline struct page *__dev_alloc_pages(gfp_t gfp_mask,
2520 /* This piece of code contains several assumptions.
2521 * 1. This is for device Rx, therefor a cold page is preferred.
2522 * 2. The expectation is the user wants a compound page.
2523 * 3. If requesting a order 0 page it will not be compound
2524 * due to the check to see if order has a value in prep_new_page
2525 * 4. __GFP_MEMALLOC is ignored if __GFP_NOMEMALLOC is set due to
2526 * code in gfp_to_alloc_flags that should be enforcing this.
2528 gfp_mask |= __GFP_COLD | __GFP_COMP | __GFP_MEMALLOC;
2530 return alloc_pages_node(NUMA_NO_NODE, gfp_mask, order);
2533 static inline struct page *dev_alloc_pages(unsigned int order)
2535 return __dev_alloc_pages(GFP_ATOMIC | __GFP_NOWARN, order);
2539 * __dev_alloc_page - allocate a page for network Rx
2540 * @gfp_mask: allocation priority. Set __GFP_NOMEMALLOC if not for network Rx
2542 * Allocate a new page.
2544 * %NULL is returned if there is no free memory.
2546 static inline struct page *__dev_alloc_page(gfp_t gfp_mask)
2548 return __dev_alloc_pages(gfp_mask, 0);
2551 static inline struct page *dev_alloc_page(void)
2553 return dev_alloc_pages(0);
2557 * skb_propagate_pfmemalloc - Propagate pfmemalloc if skb is allocated after RX page
2558 * @page: The page that was allocated from skb_alloc_page
2559 * @skb: The skb that may need pfmemalloc set
2561 static inline void skb_propagate_pfmemalloc(struct page *page,
2562 struct sk_buff *skb)
2564 if (page_is_pfmemalloc(page))
2565 skb->pfmemalloc = true;
2569 * skb_frag_page - retrieve the page referred to by a paged fragment
2570 * @frag: the paged fragment
2572 * Returns the &struct page associated with @frag.
2574 static inline struct page *skb_frag_page(const skb_frag_t *frag)
2576 return frag->page.p;
2580 * __skb_frag_ref - take an addition reference on a paged fragment.
2581 * @frag: the paged fragment
2583 * Takes an additional reference on the paged fragment @frag.
2585 static inline void __skb_frag_ref(skb_frag_t *frag)
2587 get_page(skb_frag_page(frag));
2591 * skb_frag_ref - take an addition reference on a paged fragment of an skb.
2593 * @f: the fragment offset.
2595 * Takes an additional reference on the @f'th paged fragment of @skb.
2597 static inline void skb_frag_ref(struct sk_buff *skb, int f)
2599 __skb_frag_ref(&skb_shinfo(skb)->frags[f]);
2603 * __skb_frag_unref - release a reference on a paged fragment.
2604 * @frag: the paged fragment
2606 * Releases a reference on the paged fragment @frag.
2608 static inline void __skb_frag_unref(skb_frag_t *frag)
2610 put_page(skb_frag_page(frag));
2614 * skb_frag_unref - release a reference on a paged fragment of an skb.
2616 * @f: the fragment offset
2618 * Releases a reference on the @f'th paged fragment of @skb.
2620 static inline void skb_frag_unref(struct sk_buff *skb, int f)
2622 __skb_frag_unref(&skb_shinfo(skb)->frags[f]);
2626 * skb_frag_address - gets the address of the data contained in a paged fragment
2627 * @frag: the paged fragment buffer
2629 * Returns the address of the data within @frag. The page must already
2632 static inline void *skb_frag_address(const skb_frag_t *frag)
2634 return page_address(skb_frag_page(frag)) + frag->page_offset;
2638 * skb_frag_address_safe - gets the address of the data contained in a paged fragment
2639 * @frag: the paged fragment buffer
2641 * Returns the address of the data within @frag. Checks that the page
2642 * is mapped and returns %NULL otherwise.
2644 static inline void *skb_frag_address_safe(const skb_frag_t *frag)
2646 void *ptr = page_address(skb_frag_page(frag));
2650 return ptr + frag->page_offset;
2654 * __skb_frag_set_page - sets the page contained in a paged fragment
2655 * @frag: the paged fragment
2656 * @page: the page to set
2658 * Sets the fragment @frag to contain @page.
2660 static inline void __skb_frag_set_page(skb_frag_t *frag, struct page *page)
2662 frag->page.p = page;
2666 * skb_frag_set_page - sets the page contained in a paged fragment of an skb
2668 * @f: the fragment offset
2669 * @page: the page to set
2671 * Sets the @f'th fragment of @skb to contain @page.
2673 static inline void skb_frag_set_page(struct sk_buff *skb, int f,
2676 __skb_frag_set_page(&skb_shinfo(skb)->frags[f], page);
2679 bool skb_page_frag_refill(unsigned int sz, struct page_frag *pfrag, gfp_t prio);
2682 * skb_frag_dma_map - maps a paged fragment via the DMA API
2683 * @dev: the device to map the fragment to
2684 * @frag: the paged fragment to map
2685 * @offset: the offset within the fragment (starting at the
2686 * fragment's own offset)
2687 * @size: the number of bytes to map
2688 * @dir: the direction of the mapping (%PCI_DMA_*)
2690 * Maps the page associated with @frag to @device.
2692 static inline dma_addr_t skb_frag_dma_map(struct device *dev,
2693 const skb_frag_t *frag,
2694 size_t offset, size_t size,
2695 enum dma_data_direction dir)
2697 return dma_map_page(dev, skb_frag_page(frag),
2698 frag->page_offset + offset, size, dir);
2701 static inline struct sk_buff *pskb_copy(struct sk_buff *skb,
2704 return __pskb_copy(skb, skb_headroom(skb), gfp_mask);
2708 static inline struct sk_buff *pskb_copy_for_clone(struct sk_buff *skb,
2711 return __pskb_copy_fclone(skb, skb_headroom(skb), gfp_mask, true);
2716 * skb_clone_writable - is the header of a clone writable
2717 * @skb: buffer to check
2718 * @len: length up to which to write
2720 * Returns true if modifying the header part of the cloned buffer
2721 * does not requires the data to be copied.
2723 static inline int skb_clone_writable(const struct sk_buff *skb, unsigned int len)
2725 return !skb_header_cloned(skb) &&
2726 skb_headroom(skb) + len <= skb->hdr_len;
2729 static inline int skb_try_make_writable(struct sk_buff *skb,
2730 unsigned int write_len)
2732 return skb_cloned(skb) && !skb_clone_writable(skb, write_len) &&
2733 pskb_expand_head(skb, 0, 0, GFP_ATOMIC);
2736 static inline int __skb_cow(struct sk_buff *skb, unsigned int headroom,
2741 if (headroom > skb_headroom(skb))
2742 delta = headroom - skb_headroom(skb);
2744 if (delta || cloned)
2745 return pskb_expand_head(skb, ALIGN(delta, NET_SKB_PAD), 0,
2751 * skb_cow - copy header of skb when it is required
2752 * @skb: buffer to cow
2753 * @headroom: needed headroom
2755 * If the skb passed lacks sufficient headroom or its data part
2756 * is shared, data is reallocated. If reallocation fails, an error
2757 * is returned and original skb is not changed.
2759 * The result is skb with writable area skb->head...skb->tail
2760 * and at least @headroom of space at head.
2762 static inline int skb_cow(struct sk_buff *skb, unsigned int headroom)
2764 return __skb_cow(skb, headroom, skb_cloned(skb));
2768 * skb_cow_head - skb_cow but only making the head writable
2769 * @skb: buffer to cow
2770 * @headroom: needed headroom
2772 * This function is identical to skb_cow except that we replace the
2773 * skb_cloned check by skb_header_cloned. It should be used when
2774 * you only need to push on some header and do not need to modify
2777 static inline int skb_cow_head(struct sk_buff *skb, unsigned int headroom)
2779 return __skb_cow(skb, headroom, skb_header_cloned(skb));
2783 * skb_padto - pad an skbuff up to a minimal size
2784 * @skb: buffer to pad
2785 * @len: minimal length
2787 * Pads up a buffer to ensure the trailing bytes exist and are
2788 * blanked. If the buffer already contains sufficient data it
2789 * is untouched. Otherwise it is extended. Returns zero on
2790 * success. The skb is freed on error.
2792 static inline int skb_padto(struct sk_buff *skb, unsigned int len)
2794 unsigned int size = skb->len;
2795 if (likely(size >= len))
2797 return skb_pad(skb, len - size);
2801 * skb_put_padto - increase size and pad an skbuff up to a minimal size
2802 * @skb: buffer to pad
2803 * @len: minimal length
2805 * Pads up a buffer to ensure the trailing bytes exist and are
2806 * blanked. If the buffer already contains sufficient data it
2807 * is untouched. Otherwise it is extended. Returns zero on
2808 * success. The skb is freed on error.
2810 static inline int __must_check skb_put_padto(struct sk_buff *skb, unsigned int len)
2812 unsigned int size = skb->len;
2814 if (unlikely(size < len)) {
2816 if (skb_pad(skb, len))
2818 __skb_put(skb, len);
2823 static inline int skb_add_data(struct sk_buff *skb,
2824 struct iov_iter *from, int copy)
2826 const int off = skb->len;
2828 if (skb->ip_summed == CHECKSUM_NONE) {
2830 if (csum_and_copy_from_iter(skb_put(skb, copy), copy,
2831 &csum, from) == copy) {
2832 skb->csum = csum_block_add(skb->csum, csum, off);
2835 } else if (copy_from_iter(skb_put(skb, copy), copy, from) == copy)
2838 __skb_trim(skb, off);
2842 static inline bool skb_can_coalesce(struct sk_buff *skb, int i,
2843 const struct page *page, int off)
2846 const struct skb_frag_struct *frag = &skb_shinfo(skb)->frags[i - 1];
2848 return page == skb_frag_page(frag) &&
2849 off == frag->page_offset + skb_frag_size(frag);
2854 static inline int __skb_linearize(struct sk_buff *skb)
2856 return __pskb_pull_tail(skb, skb->data_len) ? 0 : -ENOMEM;
2860 * skb_linearize - convert paged skb to linear one
2861 * @skb: buffer to linarize
2863 * If there is no free memory -ENOMEM is returned, otherwise zero
2864 * is returned and the old skb data released.
2866 static inline int skb_linearize(struct sk_buff *skb)
2868 return skb_is_nonlinear(skb) ? __skb_linearize(skb) : 0;
2872 * skb_has_shared_frag - can any frag be overwritten
2873 * @skb: buffer to test
2875 * Return true if the skb has at least one frag that might be modified
2876 * by an external entity (as in vmsplice()/sendfile())
2878 static inline bool skb_has_shared_frag(const struct sk_buff *skb)
2880 return skb_is_nonlinear(skb) &&
2881 skb_shinfo(skb)->tx_flags & SKBTX_SHARED_FRAG;
2885 * skb_linearize_cow - make sure skb is linear and writable
2886 * @skb: buffer to process
2888 * If there is no free memory -ENOMEM is returned, otherwise zero
2889 * is returned and the old skb data released.
2891 static inline int skb_linearize_cow(struct sk_buff *skb)
2893 return skb_is_nonlinear(skb) || skb_cloned(skb) ?
2894 __skb_linearize(skb) : 0;
2897 static __always_inline void
2898 __skb_postpull_rcsum(struct sk_buff *skb, const void *start, unsigned int len,
2901 if (skb->ip_summed == CHECKSUM_COMPLETE)
2902 skb->csum = csum_block_sub(skb->csum,
2903 csum_partial(start, len, 0), off);
2904 else if (skb->ip_summed == CHECKSUM_PARTIAL &&
2905 skb_checksum_start_offset(skb) < 0)
2906 skb->ip_summed = CHECKSUM_NONE;
2910 * skb_postpull_rcsum - update checksum for received skb after pull
2911 * @skb: buffer to update
2912 * @start: start of data before pull
2913 * @len: length of data pulled
2915 * After doing a pull on a received packet, you need to call this to
2916 * update the CHECKSUM_COMPLETE checksum, or set ip_summed to
2917 * CHECKSUM_NONE so that it can be recomputed from scratch.
2919 static inline void skb_postpull_rcsum(struct sk_buff *skb,
2920 const void *start, unsigned int len)
2922 __skb_postpull_rcsum(skb, start, len, 0);
2925 static __always_inline void
2926 __skb_postpush_rcsum(struct sk_buff *skb, const void *start, unsigned int len,
2929 if (skb->ip_summed == CHECKSUM_COMPLETE)
2930 skb->csum = csum_block_add(skb->csum,
2931 csum_partial(start, len, 0), off);
2935 * skb_postpush_rcsum - update checksum for received skb after push
2936 * @skb: buffer to update
2937 * @start: start of data after push
2938 * @len: length of data pushed
2940 * After doing a push on a received packet, you need to call this to
2941 * update the CHECKSUM_COMPLETE checksum.
2943 static inline void skb_postpush_rcsum(struct sk_buff *skb,
2944 const void *start, unsigned int len)
2946 __skb_postpush_rcsum(skb, start, len, 0);
2949 unsigned char *skb_pull_rcsum(struct sk_buff *skb, unsigned int len);
2952 * skb_push_rcsum - push skb and update receive checksum
2953 * @skb: buffer to update
2954 * @len: length of data pulled
2956 * This function performs an skb_push on the packet and updates
2957 * the CHECKSUM_COMPLETE checksum. It should be used on
2958 * receive path processing instead of skb_push unless you know
2959 * that the checksum difference is zero (e.g., a valid IP header)
2960 * or you are setting ip_summed to CHECKSUM_NONE.
2962 static inline unsigned char *skb_push_rcsum(struct sk_buff *skb,
2966 skb_postpush_rcsum(skb, skb->data, len);
2970 int pskb_trim_rcsum_slow(struct sk_buff *skb, unsigned int len);
2972 * pskb_trim_rcsum - trim received skb and update checksum
2973 * @skb: buffer to trim
2976 * This is exactly the same as pskb_trim except that it ensures the
2977 * checksum of received packets are still valid after the operation.
2978 * It can change skb pointers.
2981 static inline int pskb_trim_rcsum(struct sk_buff *skb, unsigned int len)
2983 if (likely(len >= skb->len))
2985 return pskb_trim_rcsum_slow(skb, len);
2988 static inline int __skb_trim_rcsum(struct sk_buff *skb, unsigned int len)
2990 if (skb->ip_summed == CHECKSUM_COMPLETE)
2991 skb->ip_summed = CHECKSUM_NONE;
2992 __skb_trim(skb, len);
2996 static inline int __skb_grow_rcsum(struct sk_buff *skb, unsigned int len)
2998 if (skb->ip_summed == CHECKSUM_COMPLETE)
2999 skb->ip_summed = CHECKSUM_NONE;
3000 return __skb_grow(skb, len);
3003 #define rb_to_skb(rb) rb_entry_safe(rb, struct sk_buff, rbnode)
3005 #define rb_to_skb(rb) rb_entry_safe(rb, struct sk_buff, rbnode)
3006 #define skb_rb_first(root) rb_to_skb(rb_first(root))
3007 #define skb_rb_last(root) rb_to_skb(rb_last(root))
3008 #define skb_rb_next(skb) rb_to_skb(rb_next(&(skb)->rbnode))
3009 #define skb_rb_prev(skb) rb_to_skb(rb_prev(&(skb)->rbnode))
3011 #define skb_queue_walk(queue, skb) \
3012 for (skb = (queue)->next; \
3013 skb != (struct sk_buff *)(queue); \
3016 #define skb_queue_walk_safe(queue, skb, tmp) \
3017 for (skb = (queue)->next, tmp = skb->next; \
3018 skb != (struct sk_buff *)(queue); \
3019 skb = tmp, tmp = skb->next)
3021 #define skb_queue_walk_from(queue, skb) \
3022 for (; skb != (struct sk_buff *)(queue); \
3025 #define skb_rbtree_walk(skb, root) \
3026 for (skb = skb_rb_first(root); skb != NULL; \
3027 skb = skb_rb_next(skb))
3029 #define skb_rbtree_walk_from(skb) \
3030 for (; skb != NULL; \
3031 skb = skb_rb_next(skb))
3033 #define skb_rbtree_walk_from_safe(skb, tmp) \
3034 for (; tmp = skb ? skb_rb_next(skb) : NULL, (skb != NULL); \
3037 #define skb_queue_walk_from_safe(queue, skb, tmp) \
3038 for (tmp = skb->next; \
3039 skb != (struct sk_buff *)(queue); \
3040 skb = tmp, tmp = skb->next)
3042 #define skb_queue_reverse_walk(queue, skb) \
3043 for (skb = (queue)->prev; \
3044 skb != (struct sk_buff *)(queue); \
3047 #define skb_queue_reverse_walk_safe(queue, skb, tmp) \
3048 for (skb = (queue)->prev, tmp = skb->prev; \
3049 skb != (struct sk_buff *)(queue); \
3050 skb = tmp, tmp = skb->prev)
3052 #define skb_queue_reverse_walk_from_safe(queue, skb, tmp) \
3053 for (tmp = skb->prev; \
3054 skb != (struct sk_buff *)(queue); \
3055 skb = tmp, tmp = skb->prev)
3057 static inline bool skb_has_frag_list(const struct sk_buff *skb)
3059 return skb_shinfo(skb)->frag_list != NULL;
3062 static inline void skb_frag_list_init(struct sk_buff *skb)
3064 skb_shinfo(skb)->frag_list = NULL;
3067 #define skb_walk_frags(skb, iter) \
3068 for (iter = skb_shinfo(skb)->frag_list; iter; iter = iter->next)
3071 int __skb_wait_for_more_packets(struct sock *sk, int *err, long *timeo_p,
3072 const struct sk_buff *skb);
3073 struct sk_buff *__skb_try_recv_datagram(struct sock *sk, unsigned flags,
3074 int *peeked, int *off, int *err,
3075 struct sk_buff **last);
3076 struct sk_buff *__skb_recv_datagram(struct sock *sk, unsigned flags,
3077 int *peeked, int *off, int *err);
3078 struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags, int noblock,
3080 unsigned int datagram_poll(struct file *file, struct socket *sock,
3081 struct poll_table_struct *wait);
3082 int skb_copy_datagram_iter(const struct sk_buff *from, int offset,
3083 struct iov_iter *to, int size);
3084 static inline int skb_copy_datagram_msg(const struct sk_buff *from, int offset,
3085 struct msghdr *msg, int size)
3087 return skb_copy_datagram_iter(from, offset, &msg->msg_iter, size);
3089 int skb_copy_and_csum_datagram_msg(struct sk_buff *skb, int hlen,
3090 struct msghdr *msg);
3091 int skb_copy_datagram_from_iter(struct sk_buff *skb, int offset,
3092 struct iov_iter *from, int len);
3093 int zerocopy_sg_from_iter(struct sk_buff *skb, struct iov_iter *frm);
3094 void skb_free_datagram(struct sock *sk, struct sk_buff *skb);
3095 void __skb_free_datagram_locked(struct sock *sk, struct sk_buff *skb, int len);
3096 static inline void skb_free_datagram_locked(struct sock *sk,
3097 struct sk_buff *skb)
3099 __skb_free_datagram_locked(sk, skb, 0);
3101 int skb_kill_datagram(struct sock *sk, struct sk_buff *skb, unsigned int flags);
3102 int skb_copy_bits(const struct sk_buff *skb, int offset, void *to, int len);
3103 int skb_store_bits(struct sk_buff *skb, int offset, const void *from, int len);
3104 __wsum skb_copy_and_csum_bits(const struct sk_buff *skb, int offset, u8 *to,
3105 int len, __wsum csum);
3106 int skb_splice_bits(struct sk_buff *skb, struct sock *sk, unsigned int offset,
3107 struct pipe_inode_info *pipe, unsigned int len,
3108 unsigned int flags);
3109 void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to);
3110 unsigned int skb_zerocopy_headlen(const struct sk_buff *from);
3111 int skb_zerocopy(struct sk_buff *to, struct sk_buff *from,
3113 void skb_split(struct sk_buff *skb, struct sk_buff *skb1, const u32 len);
3114 int skb_shift(struct sk_buff *tgt, struct sk_buff *skb, int shiftlen);
3115 void skb_scrub_packet(struct sk_buff *skb, bool xnet);
3116 unsigned int skb_gso_transport_seglen(const struct sk_buff *skb);
3117 bool skb_gso_validate_mtu(const struct sk_buff *skb, unsigned int mtu);
3118 bool skb_gso_validate_mac_len(const struct sk_buff *skb, unsigned int len);
3119 struct sk_buff *skb_segment(struct sk_buff *skb, netdev_features_t features);
3120 struct sk_buff *skb_vlan_untag(struct sk_buff *skb);
3121 int skb_ensure_writable(struct sk_buff *skb, int write_len);
3122 int __skb_vlan_pop(struct sk_buff *skb, u16 *vlan_tci);
3123 int skb_vlan_pop(struct sk_buff *skb);
3124 int skb_vlan_push(struct sk_buff *skb, __be16 vlan_proto, u16 vlan_tci);
3125 struct sk_buff *pskb_extract(struct sk_buff *skb, int off, int to_copy,
3128 static inline int memcpy_from_msg(void *data, struct msghdr *msg, int len)
3130 return copy_from_iter(data, len, &msg->msg_iter) == len ? 0 : -EFAULT;
3133 static inline int memcpy_to_msg(struct msghdr *msg, void *data, int len)
3135 return copy_to_iter(data, len, &msg->msg_iter) == len ? 0 : -EFAULT;
3138 struct skb_checksum_ops {
3139 __wsum (*update)(const void *mem, int len, __wsum wsum);
3140 __wsum (*combine)(__wsum csum, __wsum csum2, int offset, int len);
3143 __wsum __skb_checksum(const struct sk_buff *skb, int offset, int len,
3144 __wsum csum, const struct skb_checksum_ops *ops);
3145 __wsum skb_checksum(const struct sk_buff *skb, int offset, int len,
3148 static inline void * __must_check
3149 __skb_header_pointer(const struct sk_buff *skb, int offset,
3150 int len, void *data, int hlen, void *buffer)
3152 if (hlen - offset >= len)
3153 return data + offset;
3156 skb_copy_bits(skb, offset, buffer, len) < 0)
3162 static inline void * __must_check
3163 skb_header_pointer(const struct sk_buff *skb, int offset, int len, void *buffer)
3165 return __skb_header_pointer(skb, offset, len, skb->data,
3166 skb_headlen(skb), buffer);
3170 * skb_needs_linearize - check if we need to linearize a given skb
3171 * depending on the given device features.
3172 * @skb: socket buffer to check
3173 * @features: net device features
3175 * Returns true if either:
3176 * 1. skb has frag_list and the device doesn't support FRAGLIST, or
3177 * 2. skb is fragmented and the device does not support SG.
3179 static inline bool skb_needs_linearize(struct sk_buff *skb,
3180 netdev_features_t features)
3182 return skb_is_nonlinear(skb) &&
3183 ((skb_has_frag_list(skb) && !(features & NETIF_F_FRAGLIST)) ||
3184 (skb_shinfo(skb)->nr_frags && !(features & NETIF_F_SG)));
3187 static inline void skb_copy_from_linear_data(const struct sk_buff *skb,
3189 const unsigned int len)
3191 memcpy(to, skb->data, len);
3194 static inline void skb_copy_from_linear_data_offset(const struct sk_buff *skb,
3195 const int offset, void *to,
3196 const unsigned int len)
3198 memcpy(to, skb->data + offset, len);
3201 static inline void skb_copy_to_linear_data(struct sk_buff *skb,
3203 const unsigned int len)
3205 memcpy(skb->data, from, len);
3208 static inline void skb_copy_to_linear_data_offset(struct sk_buff *skb,
3211 const unsigned int len)
3213 memcpy(skb->data + offset, from, len);
3216 void skb_init(void);
3218 static inline ktime_t skb_get_ktime(const struct sk_buff *skb)
3224 * skb_get_timestamp - get timestamp from a skb
3225 * @skb: skb to get stamp from
3226 * @stamp: pointer to struct timeval to store stamp in
3228 * Timestamps are stored in the skb as offsets to a base timestamp.
3229 * This function converts the offset back to a struct timeval and stores
3232 static inline void skb_get_timestamp(const struct sk_buff *skb,
3233 struct timeval *stamp)
3235 *stamp = ktime_to_timeval(skb->tstamp);
3238 static inline void skb_get_timestampns(const struct sk_buff *skb,
3239 struct timespec *stamp)
3241 *stamp = ktime_to_timespec(skb->tstamp);
3244 static inline void __net_timestamp(struct sk_buff *skb)
3246 skb->tstamp = ktime_get_real();
3249 static inline ktime_t net_timedelta(ktime_t t)
3251 return ktime_sub(ktime_get_real(), t);
3254 static inline ktime_t net_invalid_timestamp(void)
3256 return ktime_set(0, 0);
3259 struct sk_buff *skb_clone_sk(struct sk_buff *skb);
3261 #ifdef CONFIG_NETWORK_PHY_TIMESTAMPING
3263 void skb_clone_tx_timestamp(struct sk_buff *skb);
3264 bool skb_defer_rx_timestamp(struct sk_buff *skb);
3266 #else /* CONFIG_NETWORK_PHY_TIMESTAMPING */
3268 static inline void skb_clone_tx_timestamp(struct sk_buff *skb)
3272 static inline bool skb_defer_rx_timestamp(struct sk_buff *skb)
3277 #endif /* !CONFIG_NETWORK_PHY_TIMESTAMPING */
3280 * skb_complete_tx_timestamp() - deliver cloned skb with tx timestamps
3282 * PHY drivers may accept clones of transmitted packets for
3283 * timestamping via their phy_driver.txtstamp method. These drivers
3284 * must call this function to return the skb back to the stack with a
3287 * @skb: clone of the the original outgoing packet
3288 * @hwtstamps: hardware time stamps
3291 void skb_complete_tx_timestamp(struct sk_buff *skb,
3292 struct skb_shared_hwtstamps *hwtstamps);
3294 void __skb_tstamp_tx(struct sk_buff *orig_skb,
3295 struct skb_shared_hwtstamps *hwtstamps,
3296 struct sock *sk, int tstype);
3299 * skb_tstamp_tx - queue clone of skb with send time stamps
3300 * @orig_skb: the original outgoing packet
3301 * @hwtstamps: hardware time stamps, may be NULL if not available
3303 * If the skb has a socket associated, then this function clones the
3304 * skb (thus sharing the actual data and optional structures), stores
3305 * the optional hardware time stamping information (if non NULL) or
3306 * generates a software time stamp (otherwise), then queues the clone
3307 * to the error queue of the socket. Errors are silently ignored.
3309 void skb_tstamp_tx(struct sk_buff *orig_skb,
3310 struct skb_shared_hwtstamps *hwtstamps);
3312 static inline void sw_tx_timestamp(struct sk_buff *skb)
3314 if (skb_shinfo(skb)->tx_flags & SKBTX_SW_TSTAMP &&
3315 !(skb_shinfo(skb)->tx_flags & SKBTX_IN_PROGRESS))
3316 skb_tstamp_tx(skb, NULL);
3320 * skb_tx_timestamp() - Driver hook for transmit timestamping
3322 * Ethernet MAC Drivers should call this function in their hard_xmit()
3323 * function immediately before giving the sk_buff to the MAC hardware.
3325 * Specifically, one should make absolutely sure that this function is
3326 * called before TX completion of this packet can trigger. Otherwise
3327 * the packet could potentially already be freed.
3329 * @skb: A socket buffer.
3331 static inline void skb_tx_timestamp(struct sk_buff *skb)
3333 skb_clone_tx_timestamp(skb);
3334 sw_tx_timestamp(skb);
3338 * skb_complete_wifi_ack - deliver skb with wifi status
3340 * @skb: the original outgoing packet
3341 * @acked: ack status
3344 void skb_complete_wifi_ack(struct sk_buff *skb, bool acked);
3346 __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len);
3347 __sum16 __skb_checksum_complete(struct sk_buff *skb);
3349 static inline int skb_csum_unnecessary(const struct sk_buff *skb)
3351 return ((skb->ip_summed == CHECKSUM_UNNECESSARY) ||
3353 (skb->ip_summed == CHECKSUM_PARTIAL &&
3354 skb_checksum_start_offset(skb) >= 0));
3358 * skb_checksum_complete - Calculate checksum of an entire packet
3359 * @skb: packet to process
3361 * This function calculates the checksum over the entire packet plus
3362 * the value of skb->csum. The latter can be used to supply the
3363 * checksum of a pseudo header as used by TCP/UDP. It returns the
3366 * For protocols that contain complete checksums such as ICMP/TCP/UDP,
3367 * this function can be used to verify that checksum on received
3368 * packets. In that case the function should return zero if the
3369 * checksum is correct. In particular, this function will return zero
3370 * if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the
3371 * hardware has already verified the correctness of the checksum.
3373 static inline __sum16 skb_checksum_complete(struct sk_buff *skb)
3375 return skb_csum_unnecessary(skb) ?
3376 0 : __skb_checksum_complete(skb);
3379 static inline void __skb_decr_checksum_unnecessary(struct sk_buff *skb)
3381 if (skb->ip_summed == CHECKSUM_UNNECESSARY) {
3382 if (skb->csum_level == 0)
3383 skb->ip_summed = CHECKSUM_NONE;
3389 static inline void __skb_incr_checksum_unnecessary(struct sk_buff *skb)
3391 if (skb->ip_summed == CHECKSUM_UNNECESSARY) {
3392 if (skb->csum_level < SKB_MAX_CSUM_LEVEL)
3394 } else if (skb->ip_summed == CHECKSUM_NONE) {
3395 skb->ip_summed = CHECKSUM_UNNECESSARY;
3396 skb->csum_level = 0;
3400 static inline void __skb_mark_checksum_bad(struct sk_buff *skb)
3402 /* Mark current checksum as bad (typically called from GRO
3403 * path). In the case that ip_summed is CHECKSUM_NONE
3404 * this must be the first checksum encountered in the packet.
3405 * When ip_summed is CHECKSUM_UNNECESSARY, this is the first
3406 * checksum after the last one validated. For UDP, a zero
3407 * checksum can not be marked as bad.
3410 if (skb->ip_summed == CHECKSUM_NONE ||
3411 skb->ip_summed == CHECKSUM_UNNECESSARY)
3415 /* Check if we need to perform checksum complete validation.
3417 * Returns true if checksum complete is needed, false otherwise
3418 * (either checksum is unnecessary or zero checksum is allowed).
3420 static inline bool __skb_checksum_validate_needed(struct sk_buff *skb,
3424 if (skb_csum_unnecessary(skb) || (zero_okay && !check)) {
3425 skb->csum_valid = 1;
3426 __skb_decr_checksum_unnecessary(skb);
3433 /* For small packets <= CHECKSUM_BREAK peform checksum complete directly
3436 #define CHECKSUM_BREAK 76
3438 /* Unset checksum-complete
3440 * Unset checksum complete can be done when packet is being modified
3441 * (uncompressed for instance) and checksum-complete value is
3444 static inline void skb_checksum_complete_unset(struct sk_buff *skb)
3446 if (skb->ip_summed == CHECKSUM_COMPLETE)
3447 skb->ip_summed = CHECKSUM_NONE;
3450 /* Validate (init) checksum based on checksum complete.
3453 * 0: checksum is validated or try to in skb_checksum_complete. In the latter
3454 * case the ip_summed will not be CHECKSUM_UNNECESSARY and the pseudo
3455 * checksum is stored in skb->csum for use in __skb_checksum_complete
3456 * non-zero: value of invalid checksum
3459 static inline __sum16 __skb_checksum_validate_complete(struct sk_buff *skb,
3463 if (skb->ip_summed == CHECKSUM_COMPLETE) {
3464 if (!csum_fold(csum_add(psum, skb->csum))) {
3465 skb->csum_valid = 1;
3468 } else if (skb->csum_bad) {
3469 /* ip_summed == CHECKSUM_NONE in this case */
3470 return (__force __sum16)1;
3475 if (complete || skb->len <= CHECKSUM_BREAK) {
3478 csum = __skb_checksum_complete(skb);
3479 skb->csum_valid = !csum;
3486 static inline __wsum null_compute_pseudo(struct sk_buff *skb, int proto)
3491 /* Perform checksum validate (init). Note that this is a macro since we only
3492 * want to calculate the pseudo header which is an input function if necessary.
3493 * First we try to validate without any computation (checksum unnecessary) and
3494 * then calculate based on checksum complete calling the function to compute
3498 * 0: checksum is validated or try to in skb_checksum_complete
3499 * non-zero: value of invalid checksum
3501 #define __skb_checksum_validate(skb, proto, complete, \
3502 zero_okay, check, compute_pseudo) \
3504 __sum16 __ret = 0; \
3505 skb->csum_valid = 0; \
3506 if (__skb_checksum_validate_needed(skb, zero_okay, check)) \
3507 __ret = __skb_checksum_validate_complete(skb, \
3508 complete, compute_pseudo(skb, proto)); \
3512 #define skb_checksum_init(skb, proto, compute_pseudo) \
3513 __skb_checksum_validate(skb, proto, false, false, 0, compute_pseudo)
3515 #define skb_checksum_init_zero_check(skb, proto, check, compute_pseudo) \
3516 __skb_checksum_validate(skb, proto, false, true, check, compute_pseudo)
3518 #define skb_checksum_validate(skb, proto, compute_pseudo) \
3519 __skb_checksum_validate(skb, proto, true, false, 0, compute_pseudo)
3521 #define skb_checksum_validate_zero_check(skb, proto, check, \
3523 __skb_checksum_validate(skb, proto, true, true, check, compute_pseudo)
3525 #define skb_checksum_simple_validate(skb) \
3526 __skb_checksum_validate(skb, 0, true, false, 0, null_compute_pseudo)
3528 static inline bool __skb_checksum_convert_check(struct sk_buff *skb)
3530 return (skb->ip_summed == CHECKSUM_NONE &&
3531 skb->csum_valid && !skb->csum_bad);
3534 static inline void __skb_checksum_convert(struct sk_buff *skb,
3535 __sum16 check, __wsum pseudo)
3537 skb->csum = ~pseudo;
3538 skb->ip_summed = CHECKSUM_COMPLETE;
3541 #define skb_checksum_try_convert(skb, proto, check, compute_pseudo) \
3543 if (__skb_checksum_convert_check(skb)) \
3544 __skb_checksum_convert(skb, check, \
3545 compute_pseudo(skb, proto)); \
3548 static inline void skb_remcsum_adjust_partial(struct sk_buff *skb, void *ptr,
3549 u16 start, u16 offset)
3551 skb->ip_summed = CHECKSUM_PARTIAL;
3552 skb->csum_start = ((unsigned char *)ptr + start) - skb->head;
3553 skb->csum_offset = offset - start;
3556 /* Update skbuf and packet to reflect the remote checksum offload operation.
3557 * When called, ptr indicates the starting point for skb->csum when
3558 * ip_summed is CHECKSUM_COMPLETE. If we need create checksum complete
3559 * here, skb_postpull_rcsum is done so skb->csum start is ptr.
3561 static inline void skb_remcsum_process(struct sk_buff *skb, void *ptr,
3562 int start, int offset, bool nopartial)
3567 skb_remcsum_adjust_partial(skb, ptr, start, offset);
3571 if (unlikely(skb->ip_summed != CHECKSUM_COMPLETE)) {
3572 __skb_checksum_complete(skb);
3573 skb_postpull_rcsum(skb, skb->data, ptr - (void *)skb->data);
3576 delta = remcsum_adjust(ptr, skb->csum, start, offset);
3578 /* Adjust skb->csum since we changed the packet */
3579 skb->csum = csum_add(skb->csum, delta);
3582 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
3583 void nf_conntrack_destroy(struct nf_conntrack *nfct);
3584 static inline void nf_conntrack_put(struct nf_conntrack *nfct)
3586 if (nfct && atomic_dec_and_test(&nfct->use))
3587 nf_conntrack_destroy(nfct);
3589 static inline void nf_conntrack_get(struct nf_conntrack *nfct)
3592 atomic_inc(&nfct->use);
3595 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
3596 static inline void nf_bridge_put(struct nf_bridge_info *nf_bridge)
3598 if (nf_bridge && atomic_dec_and_test(&nf_bridge->use))
3601 static inline void nf_bridge_get(struct nf_bridge_info *nf_bridge)
3604 atomic_inc(&nf_bridge->use);
3606 #endif /* CONFIG_BRIDGE_NETFILTER */
3607 static inline void nf_reset(struct sk_buff *skb)
3609 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
3610 nf_conntrack_put(skb->nfct);
3613 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
3614 nf_bridge_put(skb->nf_bridge);
3615 skb->nf_bridge = NULL;
3619 static inline void nf_reset_trace(struct sk_buff *skb)
3621 #if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE) || defined(CONFIG_NF_TABLES)
3626 static inline void ipvs_reset(struct sk_buff *skb)
3628 #if IS_ENABLED(CONFIG_IP_VS)
3629 skb->ipvs_property = 0;
3633 /* Note: This doesn't put any conntrack and bridge info in dst. */
3634 static inline void __nf_copy(struct sk_buff *dst, const struct sk_buff *src,
3637 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
3638 dst->nfct = src->nfct;
3639 nf_conntrack_get(src->nfct);
3641 dst->nfctinfo = src->nfctinfo;
3643 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
3644 dst->nf_bridge = src->nf_bridge;
3645 nf_bridge_get(src->nf_bridge);
3647 #if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE) || defined(CONFIG_NF_TABLES)
3649 dst->nf_trace = src->nf_trace;
3653 static inline void nf_copy(struct sk_buff *dst, const struct sk_buff *src)
3655 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
3656 nf_conntrack_put(dst->nfct);
3658 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
3659 nf_bridge_put(dst->nf_bridge);
3661 __nf_copy(dst, src, true);
3664 #ifdef CONFIG_NETWORK_SECMARK
3665 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
3667 to->secmark = from->secmark;
3670 static inline void skb_init_secmark(struct sk_buff *skb)
3675 static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
3678 static inline void skb_init_secmark(struct sk_buff *skb)
3682 static inline bool skb_irq_freeable(const struct sk_buff *skb)
3684 return !skb->destructor &&
3685 #if IS_ENABLED(CONFIG_XFRM)
3688 #if IS_ENABLED(CONFIG_NF_CONNTRACK)
3691 !skb->_skb_refdst &&
3692 !skb_has_frag_list(skb);
3695 static inline void skb_set_queue_mapping(struct sk_buff *skb, u16 queue_mapping)
3697 skb->queue_mapping = queue_mapping;
3700 static inline u16 skb_get_queue_mapping(const struct sk_buff *skb)
3702 return skb->queue_mapping;
3705 static inline void skb_copy_queue_mapping(struct sk_buff *to, const struct sk_buff *from)
3707 to->queue_mapping = from->queue_mapping;
3710 static inline void skb_record_rx_queue(struct sk_buff *skb, u16 rx_queue)
3712 skb->queue_mapping = rx_queue + 1;
3715 static inline u16 skb_get_rx_queue(const struct sk_buff *skb)
3717 return skb->queue_mapping - 1;
3720 static inline bool skb_rx_queue_recorded(const struct sk_buff *skb)
3722 return skb->queue_mapping != 0;
3725 static inline struct sec_path *skb_sec_path(struct sk_buff *skb)
3734 /* Keeps track of mac header offset relative to skb->head.
3735 * It is useful for TSO of Tunneling protocol. e.g. GRE.
3736 * For non-tunnel skb it points to skb_mac_header() and for
3737 * tunnel skb it points to outer mac header.
3738 * Keeps track of level of encapsulation of network headers.
3749 #define SKB_SGO_CB_OFFSET 32
3750 #define SKB_GSO_CB(skb) ((struct skb_gso_cb *)((skb)->cb + SKB_SGO_CB_OFFSET))
3752 static inline int skb_tnl_header_len(const struct sk_buff *inner_skb)
3754 return (skb_mac_header(inner_skb) - inner_skb->head) -
3755 SKB_GSO_CB(inner_skb)->mac_offset;
3758 static inline int gso_pskb_expand_head(struct sk_buff *skb, int extra)
3760 int new_headroom, headroom;
3763 headroom = skb_headroom(skb);
3764 ret = pskb_expand_head(skb, extra, 0, GFP_ATOMIC);
3768 new_headroom = skb_headroom(skb);
3769 SKB_GSO_CB(skb)->mac_offset += (new_headroom - headroom);
3773 static inline void gso_reset_checksum(struct sk_buff *skb, __wsum res)
3775 /* Do not update partial checksums if remote checksum is enabled. */
3776 if (skb->remcsum_offload)
3779 SKB_GSO_CB(skb)->csum = res;
3780 SKB_GSO_CB(skb)->csum_start = skb_checksum_start(skb) - skb->head;
3783 /* Compute the checksum for a gso segment. First compute the checksum value
3784 * from the start of transport header to SKB_GSO_CB(skb)->csum_start, and
3785 * then add in skb->csum (checksum from csum_start to end of packet).
3786 * skb->csum and csum_start are then updated to reflect the checksum of the
3787 * resultant packet starting from the transport header-- the resultant checksum
3788 * is in the res argument (i.e. normally zero or ~ of checksum of a pseudo
3791 static inline __sum16 gso_make_checksum(struct sk_buff *skb, __wsum res)
3793 unsigned char *csum_start = skb_transport_header(skb);
3794 int plen = (skb->head + SKB_GSO_CB(skb)->csum_start) - csum_start;
3795 __wsum partial = SKB_GSO_CB(skb)->csum;
3797 SKB_GSO_CB(skb)->csum = res;
3798 SKB_GSO_CB(skb)->csum_start = csum_start - skb->head;
3800 return csum_fold(csum_partial(csum_start, plen, partial));
3803 static inline bool skb_is_gso(const struct sk_buff *skb)
3805 return skb_shinfo(skb)->gso_size;
3808 /* Note: Should be called only if skb_is_gso(skb) is true */
3809 static inline bool skb_is_gso_v6(const struct sk_buff *skb)
3811 return skb_shinfo(skb)->gso_type & SKB_GSO_TCPV6;
3814 static inline void skb_gso_reset(struct sk_buff *skb)
3816 skb_shinfo(skb)->gso_size = 0;
3817 skb_shinfo(skb)->gso_segs = 0;
3818 skb_shinfo(skb)->gso_type = 0;
3821 void __skb_warn_lro_forwarding(const struct sk_buff *skb);
3823 static inline bool skb_warn_if_lro(const struct sk_buff *skb)
3825 /* LRO sets gso_size but not gso_type, whereas if GSO is really
3826 * wanted then gso_type will be set. */
3827 const struct skb_shared_info *shinfo = skb_shinfo(skb);
3829 if (skb_is_nonlinear(skb) && shinfo->gso_size != 0 &&
3830 unlikely(shinfo->gso_type == 0)) {
3831 __skb_warn_lro_forwarding(skb);
3837 static inline void skb_forward_csum(struct sk_buff *skb)
3839 /* Unfortunately we don't support this one. Any brave souls? */
3840 if (skb->ip_summed == CHECKSUM_COMPLETE)
3841 skb->ip_summed = CHECKSUM_NONE;
3845 * skb_checksum_none_assert - make sure skb ip_summed is CHECKSUM_NONE
3846 * @skb: skb to check
3848 * fresh skbs have their ip_summed set to CHECKSUM_NONE.
3849 * Instead of forcing ip_summed to CHECKSUM_NONE, we can
3850 * use this helper, to document places where we make this assertion.
3852 static inline void skb_checksum_none_assert(const struct sk_buff *skb)
3855 BUG_ON(skb->ip_summed != CHECKSUM_NONE);
3859 bool skb_partial_csum_set(struct sk_buff *skb, u16 start, u16 off);
3861 int skb_checksum_setup(struct sk_buff *skb, bool recalculate);
3862 struct sk_buff *skb_checksum_trimmed(struct sk_buff *skb,
3863 unsigned int transport_len,
3864 __sum16(*skb_chkf)(struct sk_buff *skb));
3867 * skb_head_is_locked - Determine if the skb->head is locked down
3868 * @skb: skb to check
3870 * The head on skbs build around a head frag can be removed if they are
3871 * not cloned. This function returns true if the skb head is locked down
3872 * due to either being allocated via kmalloc, or by being a clone with
3873 * multiple references to the head.
3875 static inline bool skb_head_is_locked(const struct sk_buff *skb)
3877 return !skb->head_frag || skb_cloned(skb);
3881 * skb_gso_network_seglen - Return length of individual segments of a gso packet
3885 * skb_gso_network_seglen is used to determine the real size of the
3886 * individual segments, including Layer3 (IP, IPv6) and L4 headers (TCP/UDP).
3888 * The MAC/L2 header is not accounted for.
3890 static inline unsigned int skb_gso_network_seglen(const struct sk_buff *skb)
3892 unsigned int hdr_len = skb_transport_header(skb) -
3893 skb_network_header(skb);
3894 return hdr_len + skb_gso_transport_seglen(skb);
3898 * skb_gso_mac_seglen - Return length of individual segments of a gso packet
3902 * skb_gso_mac_seglen is used to determine the real size of the
3903 * individual segments, including MAC/L2, Layer3 (IP, IPv6) and L4
3904 * headers (TCP/UDP).
3906 static inline unsigned int skb_gso_mac_seglen(const struct sk_buff *skb)
3908 unsigned int hdr_len = skb_transport_header(skb) - skb_mac_header(skb);
3909 return hdr_len + skb_gso_transport_seglen(skb);
3912 /* Local Checksum Offload.
3913 * Compute outer checksum based on the assumption that the
3914 * inner checksum will be offloaded later.
3915 * See Documentation/networking/checksum-offloads.txt for
3916 * explanation of how this works.
3917 * Fill in outer checksum adjustment (e.g. with sum of outer
3918 * pseudo-header) before calling.
3919 * Also ensure that inner checksum is in linear data area.
3921 static inline __wsum lco_csum(struct sk_buff *skb)
3923 unsigned char *csum_start = skb_checksum_start(skb);
3924 unsigned char *l4_hdr = skb_transport_header(skb);
3927 /* Start with complement of inner checksum adjustment */
3928 partial = ~csum_unfold(*(__force __sum16 *)(csum_start +
3931 /* Add in checksum of our headers (incl. outer checksum
3932 * adjustment filled in by caller) and return result.
3934 return csum_partial(l4_hdr, csum_start - l4_hdr, partial);
3937 #endif /* __KERNEL__ */
3938 #endif /* _LINUX_SKBUFF_H */