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/compiler.h>
19 #include <linux/time.h>
20 #include <linux/bug.h>
21 #include <linux/cache.h>
22 #include <linux/rbtree.h>
23 #include <linux/socket.h>
24 #include <linux/refcount.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 <linux/sched/clock.h>
38 #include <net/flow_dissector.h>
39 #include <linux/splice.h>
40 #include <linux/in6.h>
41 #include <linux/if_packet.h>
44 /* The interface for checksum offload between the stack and networking drivers
47 * A. IP checksum related features
49 * Drivers advertise checksum offload capabilities in the features of a device.
50 * From the stack's point of view these are capabilities offered by the driver,
51 * a driver typically only advertises features that it is capable of offloading
54 * The checksum related features are:
56 * NETIF_F_HW_CSUM - The driver (or its device) is able to compute one
57 * IP (one's complement) checksum for any combination
58 * of protocols or protocol layering. The checksum is
59 * computed and set in a packet per the CHECKSUM_PARTIAL
60 * interface (see below).
62 * NETIF_F_IP_CSUM - Driver (device) is only able to checksum plain
63 * TCP or UDP packets over IPv4. These are specifically
64 * unencapsulated packets of the form IPv4|TCP or
65 * IPv4|UDP where the Protocol field in the IPv4 header
66 * is TCP or UDP. The IPv4 header may contain IP options
67 * This feature cannot be set in features for a device
68 * with NETIF_F_HW_CSUM also set. This feature is being
69 * DEPRECATED (see below).
71 * NETIF_F_IPV6_CSUM - Driver (device) is only able to checksum plain
72 * TCP or UDP packets over IPv6. These are specifically
73 * unencapsulated packets of the form IPv6|TCP or
74 * IPv4|UDP where the Next Header field in the IPv6
75 * header is either TCP or UDP. IPv6 extension headers
76 * are not supported with this feature. This feature
77 * cannot be set in features for a device with
78 * NETIF_F_HW_CSUM also set. This feature is being
79 * DEPRECATED (see below).
81 * NETIF_F_RXCSUM - Driver (device) performs receive checksum offload.
82 * This flag is used only used to disable the RX checksum
83 * feature for a device. The stack will accept receive
84 * checksum indication in packets received on a device
85 * regardless of whether NETIF_F_RXCSUM is set.
87 * B. Checksumming of received packets by device. Indication of checksum
88 * verification is in set skb->ip_summed. Possible values are:
92 * Device did not checksum this packet e.g. due to lack of capabilities.
93 * The packet contains full (though not verified) checksum in packet but
94 * not in skb->csum. Thus, skb->csum is undefined in this case.
96 * CHECKSUM_UNNECESSARY:
98 * The hardware you're dealing with doesn't calculate the full checksum
99 * (as in CHECKSUM_COMPLETE), but it does parse headers and verify checksums
100 * for specific protocols. For such packets it will set CHECKSUM_UNNECESSARY
101 * if their checksums are okay. skb->csum is still undefined in this case
102 * though. A driver or device must never modify the checksum field in the
103 * packet even if checksum is verified.
105 * CHECKSUM_UNNECESSARY is applicable to following protocols:
106 * TCP: IPv6 and IPv4.
107 * UDP: IPv4 and IPv6. A device may apply CHECKSUM_UNNECESSARY to a
108 * zero UDP checksum for either IPv4 or IPv6, the networking stack
109 * may perform further validation in this case.
110 * GRE: only if the checksum is present in the header.
111 * SCTP: indicates the CRC in SCTP header has been validated.
112 * FCOE: indicates the CRC in FC frame has been validated.
114 * skb->csum_level indicates the number of consecutive checksums found in
115 * the packet minus one that have been verified as CHECKSUM_UNNECESSARY.
116 * For instance if a device receives an IPv6->UDP->GRE->IPv4->TCP packet
117 * and a device is able to verify the checksums for UDP (possibly zero),
118 * GRE (checksum flag is set), and TCP-- skb->csum_level would be set to
119 * two. If the device were only able to verify the UDP checksum and not
120 * GRE, either because it doesn't support GRE checksum of because GRE
121 * checksum is bad, skb->csum_level would be set to zero (TCP checksum is
122 * not considered in this case).
126 * This is the most generic way. The device supplied checksum of the _whole_
127 * packet as seen by netif_rx() and fills out in skb->csum. Meaning, the
128 * hardware doesn't need to parse L3/L4 headers to implement this.
131 * - Even if device supports only some protocols, but is able to produce
132 * skb->csum, it MUST use CHECKSUM_COMPLETE, not CHECKSUM_UNNECESSARY.
133 * - CHECKSUM_COMPLETE is not applicable to SCTP and FCoE protocols.
137 * A checksum is set up to be offloaded to a device as described in the
138 * output description for CHECKSUM_PARTIAL. This may occur on a packet
139 * received directly from another Linux OS, e.g., a virtualized Linux kernel
140 * on the same host, or it may be set in the input path in GRO or remote
141 * checksum offload. For the purposes of checksum verification, the checksum
142 * referred to by skb->csum_start + skb->csum_offset and any preceding
143 * checksums in the packet are considered verified. Any checksums in the
144 * packet that are after the checksum being offloaded are not considered to
147 * C. Checksumming on transmit for non-GSO. The stack requests checksum offload
148 * in the skb->ip_summed for a packet. Values are:
152 * The driver is required to checksum the packet as seen by hard_start_xmit()
153 * from skb->csum_start up to the end, and to record/write the checksum at
154 * offset skb->csum_start + skb->csum_offset. A driver may verify that the
155 * csum_start and csum_offset values are valid values given the length and
156 * offset of the packet, however they should not attempt to validate that the
157 * checksum refers to a legitimate transport layer checksum-- it is the
158 * purview of the stack to validate that csum_start and csum_offset are set
161 * When the stack requests checksum offload for a packet, the driver MUST
162 * ensure that the checksum is set correctly. A driver can either offload the
163 * checksum calculation to the device, or call skb_checksum_help (in the case
164 * that the device does not support offload for a particular checksum).
166 * NETIF_F_IP_CSUM and NETIF_F_IPV6_CSUM are being deprecated in favor of
167 * NETIF_F_HW_CSUM. New devices should use NETIF_F_HW_CSUM to indicate
168 * checksum offload capability.
169 * skb_csum_hwoffload_help() can be called to resolve CHECKSUM_PARTIAL based
170 * on network device checksumming capabilities: if a packet does not match
171 * them, skb_checksum_help or skb_crc32c_help (depending on the value of
172 * csum_not_inet, see item D.) is called to resolve the checksum.
176 * The skb was already checksummed by the protocol, or a checksum is not
179 * CHECKSUM_UNNECESSARY:
181 * This has the same meaning on as CHECKSUM_NONE for checksum offload on
185 * Not used in checksum output. If a driver observes a packet with this value
186 * set in skbuff, if should treat as CHECKSUM_NONE being set.
188 * D. Non-IP checksum (CRC) offloads
190 * NETIF_F_SCTP_CRC - This feature indicates that a device is capable of
191 * offloading the SCTP CRC in a packet. To perform this offload the stack
192 * will set set csum_start and csum_offset accordingly, set ip_summed to
193 * CHECKSUM_PARTIAL and set csum_not_inet to 1, to provide an indication in
194 * the skbuff that the CHECKSUM_PARTIAL refers to CRC32c.
195 * A driver that supports both IP checksum offload and SCTP CRC32c offload
196 * must verify which offload is configured for a packet by testing the
197 * value of skb->csum_not_inet; skb_crc32c_csum_help is provided to resolve
198 * CHECKSUM_PARTIAL on skbs where csum_not_inet is set to 1.
200 * NETIF_F_FCOE_CRC - This feature indicates that a device is capable of
201 * offloading the FCOE CRC in a packet. To perform this offload the stack
202 * will set ip_summed to CHECKSUM_PARTIAL and set csum_start and csum_offset
203 * accordingly. Note the there is no indication in the skbuff that the
204 * CHECKSUM_PARTIAL refers to an FCOE checksum, a driver that supports
205 * both IP checksum offload and FCOE CRC offload must verify which offload
206 * is configured for a packet presumably by inspecting packet headers.
208 * E. Checksumming on output with GSO.
210 * In the case of a GSO packet (skb_is_gso(skb) is true), checksum offload
211 * is implied by the SKB_GSO_* flags in gso_type. Most obviously, if the
212 * gso_type is SKB_GSO_TCPV4 or SKB_GSO_TCPV6, TCP checksum offload as
213 * part of the GSO operation is implied. If a checksum is being offloaded
214 * with GSO then ip_summed is CHECKSUM_PARTIAL, csum_start and csum_offset
215 * are set to refer to the outermost checksum being offload (two offloaded
216 * checksums are possible with UDP encapsulation).
219 /* Don't change this without changing skb_csum_unnecessary! */
220 #define CHECKSUM_NONE 0
221 #define CHECKSUM_UNNECESSARY 1
222 #define CHECKSUM_COMPLETE 2
223 #define CHECKSUM_PARTIAL 3
225 /* Maximum value in skb->csum_level */
226 #define SKB_MAX_CSUM_LEVEL 3
228 #define SKB_DATA_ALIGN(X) ALIGN(X, SMP_CACHE_BYTES)
229 #define SKB_WITH_OVERHEAD(X) \
230 ((X) - SKB_DATA_ALIGN(sizeof(struct skb_shared_info)))
231 #define SKB_MAX_ORDER(X, ORDER) \
232 SKB_WITH_OVERHEAD((PAGE_SIZE << (ORDER)) - (X))
233 #define SKB_MAX_HEAD(X) (SKB_MAX_ORDER((X), 0))
234 #define SKB_MAX_ALLOC (SKB_MAX_ORDER(0, 2))
236 /* return minimum truesize of one skb containing X bytes of data */
237 #define SKB_TRUESIZE(X) ((X) + \
238 SKB_DATA_ALIGN(sizeof(struct sk_buff)) + \
239 SKB_DATA_ALIGN(sizeof(struct skb_shared_info)))
243 struct pipe_inode_info
;
247 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
248 struct nf_conntrack
{
253 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
254 struct nf_bridge_info
{
257 BRNF_PROTO_UNCHANGED
,
265 struct net_device
*physindev
;
267 /* always valid & non-NULL from FORWARD on, for physdev match */
268 struct net_device
*physoutdev
;
270 /* prerouting: detect dnat in orig/reply direction */
272 struct in6_addr ipv6_daddr
;
274 /* after prerouting + nat detected: store original source
275 * mac since neigh resolution overwrites it, only used while
276 * skb is out in neigh layer.
278 char neigh_header
[8];
283 struct sk_buff_head
{
284 /* These two members must be first. */
285 struct sk_buff
*next
;
286 struct sk_buff
*prev
;
294 /* To allow 64K frame to be packed as single skb without frag_list we
295 * require 64K/PAGE_SIZE pages plus 1 additional page to allow for
296 * buffers which do not start on a page boundary.
298 * Since GRO uses frags we allocate at least 16 regardless of page
301 #if (65536/PAGE_SIZE + 1) < 16
302 #define MAX_SKB_FRAGS 16UL
304 #define MAX_SKB_FRAGS (65536/PAGE_SIZE + 1)
306 extern int sysctl_max_skb_frags
;
308 /* Set skb_shinfo(skb)->gso_size to this in case you want skb_segment to
309 * segment using its current segmentation instead.
311 #define GSO_BY_FRAGS 0xFFFF
313 typedef struct skb_frag_struct skb_frag_t
;
315 struct skb_frag_struct
{
319 #if (BITS_PER_LONG > 32) || (PAGE_SIZE >= 65536)
328 static inline unsigned int skb_frag_size(const skb_frag_t
*frag
)
333 static inline void skb_frag_size_set(skb_frag_t
*frag
, unsigned int size
)
338 static inline void skb_frag_size_add(skb_frag_t
*frag
, int delta
)
343 static inline void skb_frag_size_sub(skb_frag_t
*frag
, int delta
)
348 static inline bool skb_frag_must_loop(struct page
*p
)
350 #if defined(CONFIG_HIGHMEM)
358 * skb_frag_foreach_page - loop over pages in a fragment
360 * @f: skb frag to operate on
361 * @f_off: offset from start of f->page.p
362 * @f_len: length from f_off to loop over
363 * @p: (temp var) current page
364 * @p_off: (temp var) offset from start of current page,
365 * non-zero only on first page.
366 * @p_len: (temp var) length in current page,
367 * < PAGE_SIZE only on first and last page.
368 * @copied: (temp var) length so far, excluding current p_len.
370 * A fragment can hold a compound page, in which case per-page
371 * operations, notably kmap_atomic, must be called for each
374 #define skb_frag_foreach_page(f, f_off, f_len, p, p_off, p_len, copied) \
375 for (p = skb_frag_page(f) + ((f_off) >> PAGE_SHIFT), \
376 p_off = (f_off) & (PAGE_SIZE - 1), \
377 p_len = skb_frag_must_loop(p) ? \
378 min_t(u32, f_len, PAGE_SIZE - p_off) : f_len, \
381 copied += p_len, p++, p_off = 0, \
382 p_len = min_t(u32, f_len - copied, PAGE_SIZE)) \
384 #define HAVE_HW_TIME_STAMP
387 * struct skb_shared_hwtstamps - hardware time stamps
388 * @hwtstamp: hardware time stamp transformed into duration
389 * since arbitrary point in time
391 * Software time stamps generated by ktime_get_real() are stored in
394 * hwtstamps can only be compared against other hwtstamps from
397 * This structure is attached to packets as part of the
398 * &skb_shared_info. Use skb_hwtstamps() to get a pointer.
400 struct skb_shared_hwtstamps
{
404 /* Definitions for tx_flags in struct skb_shared_info */
406 /* generate hardware time stamp */
407 SKBTX_HW_TSTAMP
= 1 << 0,
409 /* generate software time stamp when queueing packet to NIC */
410 SKBTX_SW_TSTAMP
= 1 << 1,
412 /* device driver is going to provide hardware time stamp */
413 SKBTX_IN_PROGRESS
= 1 << 2,
415 /* device driver supports TX zero-copy buffers */
416 SKBTX_DEV_ZEROCOPY
= 1 << 3,
418 /* generate wifi status information (where possible) */
419 SKBTX_WIFI_STATUS
= 1 << 4,
421 /* This indicates at least one fragment might be overwritten
422 * (as in vmsplice(), sendfile() ...)
423 * If we need to compute a TX checksum, we'll need to copy
424 * all frags to avoid possible bad checksum
426 SKBTX_SHARED_FRAG
= 1 << 5,
428 /* generate software time stamp when entering packet scheduling */
429 SKBTX_SCHED_TSTAMP
= 1 << 6,
432 #define SKBTX_ZEROCOPY_FRAG (SKBTX_DEV_ZEROCOPY | SKBTX_SHARED_FRAG)
433 #define SKBTX_ANY_SW_TSTAMP (SKBTX_SW_TSTAMP | \
435 #define SKBTX_ANY_TSTAMP (SKBTX_HW_TSTAMP | SKBTX_ANY_SW_TSTAMP)
438 * The callback notifies userspace to release buffers when skb DMA is done in
439 * lower device, the skb last reference should be 0 when calling this.
440 * The zerocopy_success argument is true if zero copy transmit occurred,
441 * false on data copy or out of memory error caused by data copy attempt.
442 * The ctx field is used to track device context.
443 * The desc field is used to track userspace buffer index.
446 void (*callback
)(struct ubuf_info
*, bool zerocopy_success
);
462 struct user_struct
*user
;
467 #define skb_uarg(SKB) ((struct ubuf_info *)(skb_shinfo(SKB)->destructor_arg))
469 struct ubuf_info
*sock_zerocopy_alloc(struct sock
*sk
, size_t size
);
470 struct ubuf_info
*sock_zerocopy_realloc(struct sock
*sk
, size_t size
,
471 struct ubuf_info
*uarg
);
473 static inline void sock_zerocopy_get(struct ubuf_info
*uarg
)
475 refcount_inc(&uarg
->refcnt
);
478 void sock_zerocopy_put(struct ubuf_info
*uarg
);
479 void sock_zerocopy_put_abort(struct ubuf_info
*uarg
);
481 void sock_zerocopy_callback(struct ubuf_info
*uarg
, bool success
);
483 int skb_zerocopy_iter_stream(struct sock
*sk
, struct sk_buff
*skb
,
484 struct msghdr
*msg
, int len
,
485 struct ubuf_info
*uarg
);
487 /* This data is invariant across clones and lives at
488 * the end of the header data, ie. at skb->end.
490 struct skb_shared_info
{
495 unsigned short gso_size
;
496 /* Warning: this field is not always filled in (UFO)! */
497 unsigned short gso_segs
;
498 struct sk_buff
*frag_list
;
499 struct skb_shared_hwtstamps hwtstamps
;
500 unsigned int gso_type
;
504 * Warning : all fields before dataref are cleared in __alloc_skb()
508 /* Intermediate layers must ensure that destructor_arg
509 * remains valid until skb destructor */
510 void * destructor_arg
;
512 /* must be last field, see pskb_expand_head() */
513 skb_frag_t frags
[MAX_SKB_FRAGS
];
516 /* We divide dataref into two halves. The higher 16 bits hold references
517 * to the payload part of skb->data. The lower 16 bits hold references to
518 * the entire skb->data. A clone of a headerless skb holds the length of
519 * the header in skb->hdr_len.
521 * All users must obey the rule that the skb->data reference count must be
522 * greater than or equal to the payload reference count.
524 * Holding a reference to the payload part means that the user does not
525 * care about modifications to the header part of skb->data.
527 #define SKB_DATAREF_SHIFT 16
528 #define SKB_DATAREF_MASK ((1 << SKB_DATAREF_SHIFT) - 1)
532 SKB_FCLONE_UNAVAILABLE
, /* skb has no fclone (from head_cache) */
533 SKB_FCLONE_ORIG
, /* orig skb (from fclone_cache) */
534 SKB_FCLONE_CLONE
, /* companion fclone skb (from fclone_cache) */
538 SKB_GSO_TCPV4
= 1 << 0,
540 /* This indicates the skb is from an untrusted source. */
541 SKB_GSO_DODGY
= 1 << 1,
543 /* This indicates the tcp segment has CWR set. */
544 SKB_GSO_TCP_ECN
= 1 << 2,
546 SKB_GSO_TCP_FIXEDID
= 1 << 3,
548 SKB_GSO_TCPV6
= 1 << 4,
550 SKB_GSO_FCOE
= 1 << 5,
552 SKB_GSO_GRE
= 1 << 6,
554 SKB_GSO_GRE_CSUM
= 1 << 7,
556 SKB_GSO_IPXIP4
= 1 << 8,
558 SKB_GSO_IPXIP6
= 1 << 9,
560 SKB_GSO_UDP_TUNNEL
= 1 << 10,
562 SKB_GSO_UDP_TUNNEL_CSUM
= 1 << 11,
564 SKB_GSO_PARTIAL
= 1 << 12,
566 SKB_GSO_TUNNEL_REMCSUM
= 1 << 13,
568 SKB_GSO_SCTP
= 1 << 14,
570 SKB_GSO_ESP
= 1 << 15,
572 SKB_GSO_UDP
= 1 << 16,
575 #if BITS_PER_LONG > 32
576 #define NET_SKBUFF_DATA_USES_OFFSET 1
579 #ifdef NET_SKBUFF_DATA_USES_OFFSET
580 typedef unsigned int sk_buff_data_t
;
582 typedef unsigned char *sk_buff_data_t
;
586 * struct sk_buff - socket buffer
587 * @next: Next buffer in list
588 * @prev: Previous buffer in list
589 * @tstamp: Time we arrived/left
590 * @rbnode: RB tree node, alternative to next/prev for netem/tcp
591 * @sk: Socket we are owned by
592 * @dev: Device we arrived on/are leaving by
593 * @cb: Control buffer. Free for use by every layer. Put private vars here
594 * @_skb_refdst: destination entry (with norefcount bit)
595 * @sp: the security path, used for xfrm
596 * @len: Length of actual data
597 * @data_len: Data length
598 * @mac_len: Length of link layer header
599 * @hdr_len: writable header length of cloned skb
600 * @csum: Checksum (must include start/offset pair)
601 * @csum_start: Offset from skb->head where checksumming should start
602 * @csum_offset: Offset from csum_start where checksum should be stored
603 * @priority: Packet queueing priority
604 * @ignore_df: allow local fragmentation
605 * @cloned: Head may be cloned (check refcnt to be sure)
606 * @ip_summed: Driver fed us an IP checksum
607 * @nohdr: Payload reference only, must not modify header
608 * @pkt_type: Packet class
609 * @fclone: skbuff clone status
610 * @ipvs_property: skbuff is owned by ipvs
611 * @tc_skip_classify: do not classify packet. set by IFB device
612 * @tc_at_ingress: used within tc_classify to distinguish in/egress
613 * @tc_redirected: packet was redirected by a tc action
614 * @tc_from_ingress: if tc_redirected, tc_at_ingress at time of redirect
615 * @peeked: this packet has been seen already, so stats have been
616 * done for it, don't do them again
617 * @nf_trace: netfilter packet trace flag
618 * @protocol: Packet protocol from driver
619 * @destructor: Destruct function
620 * @tcp_tsorted_anchor: list structure for TCP (tp->tsorted_sent_queue)
621 * @_nfct: Associated connection, if any (with nfctinfo bits)
622 * @nf_bridge: Saved data about a bridged frame - see br_netfilter.c
623 * @skb_iif: ifindex of device we arrived on
624 * @tc_index: Traffic control index
625 * @hash: the packet hash
626 * @queue_mapping: Queue mapping for multiqueue devices
627 * @xmit_more: More SKBs are pending for this queue
628 * @pfmemalloc: skbuff was allocated from PFMEMALLOC reserves
629 * @ndisc_nodetype: router type (from link layer)
630 * @ooo_okay: allow the mapping of a socket to a queue to be changed
631 * @l4_hash: indicate hash is a canonical 4-tuple hash over transport
633 * @sw_hash: indicates hash was computed in software stack
634 * @wifi_acked_valid: wifi_acked was set
635 * @wifi_acked: whether frame was acked on wifi or not
636 * @no_fcs: Request NIC to treat last 4 bytes as Ethernet FCS
637 * @csum_not_inet: use CRC32c to resolve CHECKSUM_PARTIAL
638 * @dst_pending_confirm: need to confirm neighbour
639 * @napi_id: id of the NAPI struct this skb came from
640 * @secmark: security marking
641 * @mark: Generic packet mark
642 * @vlan_proto: vlan encapsulation protocol
643 * @vlan_tci: vlan tag control information
644 * @inner_protocol: Protocol (encapsulation)
645 * @inner_transport_header: Inner transport layer header (encapsulation)
646 * @inner_network_header: Network layer header (encapsulation)
647 * @inner_mac_header: Link layer header (encapsulation)
648 * @transport_header: Transport layer header
649 * @network_header: Network layer header
650 * @mac_header: Link layer header
651 * @tail: Tail pointer
653 * @head: Head of buffer
654 * @data: Data head pointer
655 * @truesize: Buffer size
656 * @users: User count - see {datagram,tcp}.c
662 /* These two members must be first. */
663 struct sk_buff
*next
;
664 struct sk_buff
*prev
;
667 struct net_device
*dev
;
668 /* Some protocols might use this space to store information,
669 * while device pointer would be NULL.
670 * UDP receive path is one user.
672 unsigned long dev_scratch
;
673 int ip_defrag_offset
;
676 struct rb_node rbnode
; /* used in netem & tcp stack */
685 * This is the control buffer. It is free to use for every
686 * layer. Please put your private variables there. If you
687 * want to keep them across layers you have to do a skb_clone()
688 * first. This is owned by whoever has the skb queued ATM.
690 char cb
[48] __aligned(8);
694 unsigned long _skb_refdst
;
695 void (*destructor
)(struct sk_buff
*skb
);
697 struct list_head tcp_tsorted_anchor
;
703 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
706 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
707 struct nf_bridge_info
*nf_bridge
;
714 /* Following fields are _not_ copied in __copy_skb_header()
715 * Note that queue_mapping is here mostly to fill a hole.
719 /* if you move cloned around you also must adapt those constants */
720 #ifdef __BIG_ENDIAN_BITFIELD
721 #define CLONED_MASK (1 << 7)
723 #define CLONED_MASK 1
725 #define CLONED_OFFSET() offsetof(struct sk_buff, __cloned_offset)
727 __u8 __cloned_offset
[0];
736 /* fields enclosed in headers_start/headers_end are copied
737 * using a single memcpy() in __copy_skb_header()
740 __u32 headers_start
[0];
743 /* if you move pkt_type around you also must adapt those constants */
744 #ifdef __BIG_ENDIAN_BITFIELD
745 #define PKT_TYPE_MAX (7 << 5)
747 #define PKT_TYPE_MAX 7
749 #define PKT_TYPE_OFFSET() offsetof(struct sk_buff, __pkt_type_offset)
751 __u8 __pkt_type_offset
[0];
760 __u8 wifi_acked_valid
:1;
763 /* Indicates the inner headers are valid in the skbuff. */
764 __u8 encapsulation
:1;
765 __u8 encap_hdr_csum
:1;
768 __u8 csum_complete_sw
:1;
770 __u8 csum_not_inet
:1;
771 __u8 dst_pending_confirm
:1;
772 #ifdef CONFIG_IPV6_NDISC_NODETYPE
773 __u8 ndisc_nodetype
:2;
775 __u8 ipvs_property
:1;
777 __u8 inner_protocol_type
:1;
778 __u8 remcsum_offload
:1;
779 #ifdef CONFIG_NET_SWITCHDEV
780 __u8 offload_fwd_mark
:1;
781 __u8 offload_mr_fwd_mark
:1;
783 #ifdef CONFIG_NET_CLS_ACT
784 __u8 tc_skip_classify
:1;
785 __u8 tc_at_ingress
:1;
786 __u8 tc_redirected
:1;
787 __u8 tc_from_ingress
:1;
790 #ifdef CONFIG_NET_SCHED
791 __u16 tc_index
; /* traffic control index */
806 #if defined(CONFIG_NET_RX_BUSY_POLL) || defined(CONFIG_XPS)
808 unsigned int napi_id
;
809 unsigned int sender_cpu
;
812 #ifdef CONFIG_NETWORK_SECMARK
818 __u32 reserved_tailroom
;
822 __be16 inner_protocol
;
826 __u16 inner_transport_header
;
827 __u16 inner_network_header
;
828 __u16 inner_mac_header
;
831 __u16 transport_header
;
832 __u16 network_header
;
836 __u32 headers_end
[0];
839 /* These elements must be at the end, see alloc_skb() for details. */
844 unsigned int truesize
;
850 * Handling routines are only of interest to the kernel
852 #include <linux/slab.h>
855 #define SKB_ALLOC_FCLONE 0x01
856 #define SKB_ALLOC_RX 0x02
857 #define SKB_ALLOC_NAPI 0x04
859 /* Returns true if the skb was allocated from PFMEMALLOC reserves */
860 static inline bool skb_pfmemalloc(const struct sk_buff
*skb
)
862 return unlikely(skb
->pfmemalloc
);
866 * skb might have a dst pointer attached, refcounted or not.
867 * _skb_refdst low order bit is set if refcount was _not_ taken
869 #define SKB_DST_NOREF 1UL
870 #define SKB_DST_PTRMASK ~(SKB_DST_NOREF)
872 #define SKB_NFCT_PTRMASK ~(7UL)
874 * skb_dst - returns skb dst_entry
877 * Returns skb dst_entry, regardless of reference taken or not.
879 static inline struct dst_entry
*skb_dst(const struct sk_buff
*skb
)
881 /* If refdst was not refcounted, check we still are in a
882 * rcu_read_lock section
884 WARN_ON((skb
->_skb_refdst
& SKB_DST_NOREF
) &&
885 !rcu_read_lock_held() &&
886 !rcu_read_lock_bh_held());
887 return (struct dst_entry
*)(skb
->_skb_refdst
& SKB_DST_PTRMASK
);
891 * skb_dst_set - sets skb dst
895 * Sets skb dst, assuming a reference was taken on dst and should
896 * be released by skb_dst_drop()
898 static inline void skb_dst_set(struct sk_buff
*skb
, struct dst_entry
*dst
)
900 skb
->_skb_refdst
= (unsigned long)dst
;
904 * skb_dst_set_noref - sets skb dst, hopefully, without taking reference
908 * Sets skb dst, assuming a reference was not taken on dst.
909 * If dst entry is cached, we do not take reference and dst_release
910 * will be avoided by refdst_drop. If dst entry is not cached, we take
911 * reference, so that last dst_release can destroy the dst immediately.
913 static inline void skb_dst_set_noref(struct sk_buff
*skb
, struct dst_entry
*dst
)
915 WARN_ON(!rcu_read_lock_held() && !rcu_read_lock_bh_held());
916 skb
->_skb_refdst
= (unsigned long)dst
| SKB_DST_NOREF
;
920 * skb_dst_is_noref - Test if skb dst isn't refcounted
923 static inline bool skb_dst_is_noref(const struct sk_buff
*skb
)
925 return (skb
->_skb_refdst
& SKB_DST_NOREF
) && skb_dst(skb
);
928 static inline struct rtable
*skb_rtable(const struct sk_buff
*skb
)
930 return (struct rtable
*)skb_dst(skb
);
933 /* For mangling skb->pkt_type from user space side from applications
934 * such as nft, tc, etc, we only allow a conservative subset of
935 * possible pkt_types to be set.
937 static inline bool skb_pkt_type_ok(u32 ptype
)
939 return ptype
<= PACKET_OTHERHOST
;
942 static inline unsigned int skb_napi_id(const struct sk_buff
*skb
)
944 #ifdef CONFIG_NET_RX_BUSY_POLL
951 /* decrement the reference count and return true if we can free the skb */
952 static inline bool skb_unref(struct sk_buff
*skb
)
956 if (likely(refcount_read(&skb
->users
) == 1))
958 else if (likely(!refcount_dec_and_test(&skb
->users
)))
964 void skb_release_head_state(struct sk_buff
*skb
);
965 void kfree_skb(struct sk_buff
*skb
);
966 void kfree_skb_list(struct sk_buff
*segs
);
967 void skb_tx_error(struct sk_buff
*skb
);
968 void consume_skb(struct sk_buff
*skb
);
969 void __consume_stateless_skb(struct sk_buff
*skb
);
970 void __kfree_skb(struct sk_buff
*skb
);
971 extern struct kmem_cache
*skbuff_head_cache
;
973 void kfree_skb_partial(struct sk_buff
*skb
, bool head_stolen
);
974 bool skb_try_coalesce(struct sk_buff
*to
, struct sk_buff
*from
,
975 bool *fragstolen
, int *delta_truesize
);
977 struct sk_buff
*__alloc_skb(unsigned int size
, gfp_t priority
, int flags
,
979 struct sk_buff
*__build_skb(void *data
, unsigned int frag_size
);
980 struct sk_buff
*build_skb(void *data
, unsigned int frag_size
);
981 static inline struct sk_buff
*alloc_skb(unsigned int size
,
984 return __alloc_skb(size
, priority
, 0, NUMA_NO_NODE
);
987 struct sk_buff
*alloc_skb_with_frags(unsigned long header_len
,
988 unsigned long data_len
,
993 /* Layout of fast clones : [skb1][skb2][fclone_ref] */
994 struct sk_buff_fclones
{
999 refcount_t fclone_ref
;
1003 * skb_fclone_busy - check if fclone is busy
1007 * Returns true if skb is a fast clone, and its clone is not freed.
1008 * Some drivers call skb_orphan() in their ndo_start_xmit(),
1009 * so we also check that this didnt happen.
1011 static inline bool skb_fclone_busy(const struct sock
*sk
,
1012 const struct sk_buff
*skb
)
1014 const struct sk_buff_fclones
*fclones
;
1016 fclones
= container_of(skb
, struct sk_buff_fclones
, skb1
);
1018 return skb
->fclone
== SKB_FCLONE_ORIG
&&
1019 refcount_read(&fclones
->fclone_ref
) > 1 &&
1020 fclones
->skb2
.sk
== sk
;
1023 static inline struct sk_buff
*alloc_skb_fclone(unsigned int size
,
1026 return __alloc_skb(size
, priority
, SKB_ALLOC_FCLONE
, NUMA_NO_NODE
);
1029 struct sk_buff
*skb_morph(struct sk_buff
*dst
, struct sk_buff
*src
);
1030 int skb_copy_ubufs(struct sk_buff
*skb
, gfp_t gfp_mask
);
1031 struct sk_buff
*skb_clone(struct sk_buff
*skb
, gfp_t priority
);
1032 struct sk_buff
*skb_copy(const struct sk_buff
*skb
, gfp_t priority
);
1033 struct sk_buff
*__pskb_copy_fclone(struct sk_buff
*skb
, int headroom
,
1034 gfp_t gfp_mask
, bool fclone
);
1035 static inline struct sk_buff
*__pskb_copy(struct sk_buff
*skb
, int headroom
,
1038 return __pskb_copy_fclone(skb
, headroom
, gfp_mask
, false);
1041 int pskb_expand_head(struct sk_buff
*skb
, int nhead
, int ntail
, gfp_t gfp_mask
);
1042 struct sk_buff
*skb_realloc_headroom(struct sk_buff
*skb
,
1043 unsigned int headroom
);
1044 struct sk_buff
*skb_copy_expand(const struct sk_buff
*skb
, int newheadroom
,
1045 int newtailroom
, gfp_t priority
);
1046 int __must_check
skb_to_sgvec_nomark(struct sk_buff
*skb
, struct scatterlist
*sg
,
1047 int offset
, int len
);
1048 int __must_check
skb_to_sgvec(struct sk_buff
*skb
, struct scatterlist
*sg
,
1049 int offset
, int len
);
1050 int skb_cow_data(struct sk_buff
*skb
, int tailbits
, struct sk_buff
**trailer
);
1051 int __skb_pad(struct sk_buff
*skb
, int pad
, bool free_on_error
);
1054 * skb_pad - zero pad the tail of an skb
1055 * @skb: buffer to pad
1056 * @pad: space to pad
1058 * Ensure that a buffer is followed by a padding area that is zero
1059 * filled. Used by network drivers which may DMA or transfer data
1060 * beyond the buffer end onto the wire.
1062 * May return error in out of memory cases. The skb is freed on error.
1064 static inline int skb_pad(struct sk_buff
*skb
, int pad
)
1066 return __skb_pad(skb
, pad
, true);
1068 #define dev_kfree_skb(a) consume_skb(a)
1070 int skb_append_datato_frags(struct sock
*sk
, struct sk_buff
*skb
,
1071 int getfrag(void *from
, char *to
, int offset
,
1072 int len
, int odd
, struct sk_buff
*skb
),
1073 void *from
, int length
);
1075 int skb_append_pagefrags(struct sk_buff
*skb
, struct page
*page
,
1076 int offset
, size_t size
);
1078 struct skb_seq_state
{
1082 __u32 stepped_offset
;
1083 struct sk_buff
*root_skb
;
1084 struct sk_buff
*cur_skb
;
1088 void skb_prepare_seq_read(struct sk_buff
*skb
, unsigned int from
,
1089 unsigned int to
, struct skb_seq_state
*st
);
1090 unsigned int skb_seq_read(unsigned int consumed
, const u8
**data
,
1091 struct skb_seq_state
*st
);
1092 void skb_abort_seq_read(struct skb_seq_state
*st
);
1094 unsigned int skb_find_text(struct sk_buff
*skb
, unsigned int from
,
1095 unsigned int to
, struct ts_config
*config
);
1098 * Packet hash types specify the type of hash in skb_set_hash.
1100 * Hash types refer to the protocol layer addresses which are used to
1101 * construct a packet's hash. The hashes are used to differentiate or identify
1102 * flows of the protocol layer for the hash type. Hash types are either
1103 * layer-2 (L2), layer-3 (L3), or layer-4 (L4).
1105 * Properties of hashes:
1107 * 1) Two packets in different flows have different hash values
1108 * 2) Two packets in the same flow should have the same hash value
1110 * A hash at a higher layer is considered to be more specific. A driver should
1111 * set the most specific hash possible.
1113 * A driver cannot indicate a more specific hash than the layer at which a hash
1114 * was computed. For instance an L3 hash cannot be set as an L4 hash.
1116 * A driver may indicate a hash level which is less specific than the
1117 * actual layer the hash was computed on. For instance, a hash computed
1118 * at L4 may be considered an L3 hash. This should only be done if the
1119 * driver can't unambiguously determine that the HW computed the hash at
1120 * the higher layer. Note that the "should" in the second property above
1123 enum pkt_hash_types
{
1124 PKT_HASH_TYPE_NONE
, /* Undefined type */
1125 PKT_HASH_TYPE_L2
, /* Input: src_MAC, dest_MAC */
1126 PKT_HASH_TYPE_L3
, /* Input: src_IP, dst_IP */
1127 PKT_HASH_TYPE_L4
, /* Input: src_IP, dst_IP, src_port, dst_port */
1130 static inline void skb_clear_hash(struct sk_buff
*skb
)
1137 static inline void skb_clear_hash_if_not_l4(struct sk_buff
*skb
)
1140 skb_clear_hash(skb
);
1144 __skb_set_hash(struct sk_buff
*skb
, __u32 hash
, bool is_sw
, bool is_l4
)
1146 skb
->l4_hash
= is_l4
;
1147 skb
->sw_hash
= is_sw
;
1152 skb_set_hash(struct sk_buff
*skb
, __u32 hash
, enum pkt_hash_types type
)
1154 /* Used by drivers to set hash from HW */
1155 __skb_set_hash(skb
, hash
, false, type
== PKT_HASH_TYPE_L4
);
1159 __skb_set_sw_hash(struct sk_buff
*skb
, __u32 hash
, bool is_l4
)
1161 __skb_set_hash(skb
, hash
, true, is_l4
);
1164 void __skb_get_hash(struct sk_buff
*skb
);
1165 u32
__skb_get_hash_symmetric(const struct sk_buff
*skb
);
1166 u32
skb_get_poff(const struct sk_buff
*skb
);
1167 u32
__skb_get_poff(const struct sk_buff
*skb
, void *data
,
1168 const struct flow_keys
*keys
, int hlen
);
1169 __be32
__skb_flow_get_ports(const struct sk_buff
*skb
, int thoff
, u8 ip_proto
,
1170 void *data
, int hlen_proto
);
1172 static inline __be32
skb_flow_get_ports(const struct sk_buff
*skb
,
1173 int thoff
, u8 ip_proto
)
1175 return __skb_flow_get_ports(skb
, thoff
, ip_proto
, NULL
, 0);
1178 void skb_flow_dissector_init(struct flow_dissector
*flow_dissector
,
1179 const struct flow_dissector_key
*key
,
1180 unsigned int key_count
);
1182 bool __skb_flow_dissect(const struct sk_buff
*skb
,
1183 struct flow_dissector
*flow_dissector
,
1184 void *target_container
,
1185 void *data
, __be16 proto
, int nhoff
, int hlen
,
1186 unsigned int flags
);
1188 static inline bool skb_flow_dissect(const struct sk_buff
*skb
,
1189 struct flow_dissector
*flow_dissector
,
1190 void *target_container
, unsigned int flags
)
1192 return __skb_flow_dissect(skb
, flow_dissector
, target_container
,
1193 NULL
, 0, 0, 0, flags
);
1196 static inline bool skb_flow_dissect_flow_keys(const struct sk_buff
*skb
,
1197 struct flow_keys
*flow
,
1200 memset(flow
, 0, sizeof(*flow
));
1201 return __skb_flow_dissect(skb
, &flow_keys_dissector
, flow
,
1202 NULL
, 0, 0, 0, flags
);
1205 static inline bool skb_flow_dissect_flow_keys_buf(struct flow_keys
*flow
,
1206 void *data
, __be16 proto
,
1207 int nhoff
, int hlen
,
1210 memset(flow
, 0, sizeof(*flow
));
1211 return __skb_flow_dissect(NULL
, &flow_keys_buf_dissector
, flow
,
1212 data
, proto
, nhoff
, hlen
, flags
);
1215 static inline __u32
skb_get_hash(struct sk_buff
*skb
)
1217 if (!skb
->l4_hash
&& !skb
->sw_hash
)
1218 __skb_get_hash(skb
);
1223 static inline __u32
skb_get_hash_flowi6(struct sk_buff
*skb
, const struct flowi6
*fl6
)
1225 if (!skb
->l4_hash
&& !skb
->sw_hash
) {
1226 struct flow_keys keys
;
1227 __u32 hash
= __get_hash_from_flowi6(fl6
, &keys
);
1229 __skb_set_sw_hash(skb
, hash
, flow_keys_have_l4(&keys
));
1235 __u32
skb_get_hash_perturb(const struct sk_buff
*skb
, u32 perturb
);
1237 static inline __u32
skb_get_hash_raw(const struct sk_buff
*skb
)
1242 static inline void skb_copy_hash(struct sk_buff
*to
, const struct sk_buff
*from
)
1244 to
->hash
= from
->hash
;
1245 to
->sw_hash
= from
->sw_hash
;
1246 to
->l4_hash
= from
->l4_hash
;
1249 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1250 static inline unsigned char *skb_end_pointer(const struct sk_buff
*skb
)
1252 return skb
->head
+ skb
->end
;
1255 static inline unsigned int skb_end_offset(const struct sk_buff
*skb
)
1260 static inline unsigned char *skb_end_pointer(const struct sk_buff
*skb
)
1265 static inline unsigned int skb_end_offset(const struct sk_buff
*skb
)
1267 return skb
->end
- skb
->head
;
1272 #define skb_shinfo(SKB) ((struct skb_shared_info *)(skb_end_pointer(SKB)))
1274 static inline struct skb_shared_hwtstamps
*skb_hwtstamps(struct sk_buff
*skb
)
1276 return &skb_shinfo(skb
)->hwtstamps
;
1279 static inline struct ubuf_info
*skb_zcopy(struct sk_buff
*skb
)
1281 bool is_zcopy
= skb
&& skb_shinfo(skb
)->tx_flags
& SKBTX_DEV_ZEROCOPY
;
1283 return is_zcopy
? skb_uarg(skb
) : NULL
;
1286 static inline void skb_zcopy_set(struct sk_buff
*skb
, struct ubuf_info
*uarg
)
1288 if (skb
&& uarg
&& !skb_zcopy(skb
)) {
1289 sock_zerocopy_get(uarg
);
1290 skb_shinfo(skb
)->destructor_arg
= uarg
;
1291 skb_shinfo(skb
)->tx_flags
|= SKBTX_ZEROCOPY_FRAG
;
1295 /* Release a reference on a zerocopy structure */
1296 static inline void skb_zcopy_clear(struct sk_buff
*skb
, bool zerocopy
)
1298 struct ubuf_info
*uarg
= skb_zcopy(skb
);
1301 if (uarg
->callback
== sock_zerocopy_callback
) {
1302 uarg
->zerocopy
= uarg
->zerocopy
&& zerocopy
;
1303 sock_zerocopy_put(uarg
);
1305 uarg
->callback(uarg
, zerocopy
);
1308 skb_shinfo(skb
)->tx_flags
&= ~SKBTX_ZEROCOPY_FRAG
;
1312 /* Abort a zerocopy operation and revert zckey on error in send syscall */
1313 static inline void skb_zcopy_abort(struct sk_buff
*skb
)
1315 struct ubuf_info
*uarg
= skb_zcopy(skb
);
1318 sock_zerocopy_put_abort(uarg
);
1319 skb_shinfo(skb
)->tx_flags
&= ~SKBTX_ZEROCOPY_FRAG
;
1324 * skb_queue_empty - check if a queue is empty
1327 * Returns true if the queue is empty, false otherwise.
1329 static inline int skb_queue_empty(const struct sk_buff_head
*list
)
1331 return list
->next
== (const struct sk_buff
*) list
;
1335 * skb_queue_is_last - check if skb is the last entry in the queue
1339 * Returns true if @skb is the last buffer on the list.
1341 static inline bool skb_queue_is_last(const struct sk_buff_head
*list
,
1342 const struct sk_buff
*skb
)
1344 return skb
->next
== (const struct sk_buff
*) list
;
1348 * skb_queue_is_first - check if skb is the first entry in the queue
1352 * Returns true if @skb is the first buffer on the list.
1354 static inline bool skb_queue_is_first(const struct sk_buff_head
*list
,
1355 const struct sk_buff
*skb
)
1357 return skb
->prev
== (const struct sk_buff
*) list
;
1361 * skb_queue_next - return the next packet in the queue
1363 * @skb: current buffer
1365 * Return the next packet in @list after @skb. It is only valid to
1366 * call this if skb_queue_is_last() evaluates to false.
1368 static inline struct sk_buff
*skb_queue_next(const struct sk_buff_head
*list
,
1369 const struct sk_buff
*skb
)
1371 /* This BUG_ON may seem severe, but if we just return then we
1372 * are going to dereference garbage.
1374 BUG_ON(skb_queue_is_last(list
, skb
));
1379 * skb_queue_prev - return the prev packet in the queue
1381 * @skb: current buffer
1383 * Return the prev packet in @list before @skb. It is only valid to
1384 * call this if skb_queue_is_first() evaluates to false.
1386 static inline struct sk_buff
*skb_queue_prev(const struct sk_buff_head
*list
,
1387 const struct sk_buff
*skb
)
1389 /* This BUG_ON may seem severe, but if we just return then we
1390 * are going to dereference garbage.
1392 BUG_ON(skb_queue_is_first(list
, skb
));
1397 * skb_get - reference buffer
1398 * @skb: buffer to reference
1400 * Makes another reference to a socket buffer and returns a pointer
1403 static inline struct sk_buff
*skb_get(struct sk_buff
*skb
)
1405 refcount_inc(&skb
->users
);
1410 * If users == 1, we are the only owner and can avoid redundant atomic changes.
1414 * skb_cloned - is the buffer a clone
1415 * @skb: buffer to check
1417 * Returns true if the buffer was generated with skb_clone() and is
1418 * one of multiple shared copies of the buffer. Cloned buffers are
1419 * shared data so must not be written to under normal circumstances.
1421 static inline int skb_cloned(const struct sk_buff
*skb
)
1423 return skb
->cloned
&&
1424 (atomic_read(&skb_shinfo(skb
)->dataref
) & SKB_DATAREF_MASK
) != 1;
1427 static inline int skb_unclone(struct sk_buff
*skb
, gfp_t pri
)
1429 might_sleep_if(gfpflags_allow_blocking(pri
));
1431 if (skb_cloned(skb
))
1432 return pskb_expand_head(skb
, 0, 0, pri
);
1438 * skb_header_cloned - is the header a clone
1439 * @skb: buffer to check
1441 * Returns true if modifying the header part of the buffer requires
1442 * the data to be copied.
1444 static inline int skb_header_cloned(const struct sk_buff
*skb
)
1451 dataref
= atomic_read(&skb_shinfo(skb
)->dataref
);
1452 dataref
= (dataref
& SKB_DATAREF_MASK
) - (dataref
>> SKB_DATAREF_SHIFT
);
1453 return dataref
!= 1;
1456 static inline int skb_header_unclone(struct sk_buff
*skb
, gfp_t pri
)
1458 might_sleep_if(gfpflags_allow_blocking(pri
));
1460 if (skb_header_cloned(skb
))
1461 return pskb_expand_head(skb
, 0, 0, pri
);
1467 * __skb_header_release - release reference to header
1468 * @skb: buffer to operate on
1470 static inline void __skb_header_release(struct sk_buff
*skb
)
1473 atomic_set(&skb_shinfo(skb
)->dataref
, 1 + (1 << SKB_DATAREF_SHIFT
));
1478 * skb_shared - is the buffer shared
1479 * @skb: buffer to check
1481 * Returns true if more than one person has a reference to this
1484 static inline int skb_shared(const struct sk_buff
*skb
)
1486 return refcount_read(&skb
->users
) != 1;
1490 * skb_share_check - check if buffer is shared and if so clone it
1491 * @skb: buffer to check
1492 * @pri: priority for memory allocation
1494 * If the buffer is shared the buffer is cloned and the old copy
1495 * drops a reference. A new clone with a single reference is returned.
1496 * If the buffer is not shared the original buffer is returned. When
1497 * being called from interrupt status or with spinlocks held pri must
1500 * NULL is returned on a memory allocation failure.
1502 static inline struct sk_buff
*skb_share_check(struct sk_buff
*skb
, gfp_t pri
)
1504 might_sleep_if(gfpflags_allow_blocking(pri
));
1505 if (skb_shared(skb
)) {
1506 struct sk_buff
*nskb
= skb_clone(skb
, pri
);
1518 * Copy shared buffers into a new sk_buff. We effectively do COW on
1519 * packets to handle cases where we have a local reader and forward
1520 * and a couple of other messy ones. The normal one is tcpdumping
1521 * a packet thats being forwarded.
1525 * skb_unshare - make a copy of a shared buffer
1526 * @skb: buffer to check
1527 * @pri: priority for memory allocation
1529 * If the socket buffer is a clone then this function creates a new
1530 * copy of the data, drops a reference count on the old copy and returns
1531 * the new copy with the reference count at 1. If the buffer is not a clone
1532 * the original buffer is returned. When called with a spinlock held or
1533 * from interrupt state @pri must be %GFP_ATOMIC
1535 * %NULL is returned on a memory allocation failure.
1537 static inline struct sk_buff
*skb_unshare(struct sk_buff
*skb
,
1540 might_sleep_if(gfpflags_allow_blocking(pri
));
1541 if (skb_cloned(skb
)) {
1542 struct sk_buff
*nskb
= skb_copy(skb
, pri
);
1544 /* Free our shared copy */
1555 * skb_peek - peek at the head of an &sk_buff_head
1556 * @list_: list to peek at
1558 * Peek an &sk_buff. Unlike most other operations you _MUST_
1559 * be careful with this one. A peek leaves the buffer on the
1560 * list and someone else may run off with it. You must hold
1561 * the appropriate locks or have a private queue to do this.
1563 * Returns %NULL for an empty list or a pointer to the head element.
1564 * The reference count is not incremented and the reference is therefore
1565 * volatile. Use with caution.
1567 static inline struct sk_buff
*skb_peek(const struct sk_buff_head
*list_
)
1569 struct sk_buff
*skb
= list_
->next
;
1571 if (skb
== (struct sk_buff
*)list_
)
1577 * skb_peek_next - peek skb following the given one from a queue
1578 * @skb: skb to start from
1579 * @list_: list to peek at
1581 * Returns %NULL when the end of the list is met or a pointer to the
1582 * next element. The reference count is not incremented and the
1583 * reference is therefore volatile. Use with caution.
1585 static inline struct sk_buff
*skb_peek_next(struct sk_buff
*skb
,
1586 const struct sk_buff_head
*list_
)
1588 struct sk_buff
*next
= skb
->next
;
1590 if (next
== (struct sk_buff
*)list_
)
1596 * skb_peek_tail - peek at the tail of an &sk_buff_head
1597 * @list_: list to peek at
1599 * Peek an &sk_buff. Unlike most other operations you _MUST_
1600 * be careful with this one. A peek leaves the buffer on the
1601 * list and someone else may run off with it. You must hold
1602 * the appropriate locks or have a private queue to do this.
1604 * Returns %NULL for an empty list or a pointer to the tail element.
1605 * The reference count is not incremented and the reference is therefore
1606 * volatile. Use with caution.
1608 static inline struct sk_buff
*skb_peek_tail(const struct sk_buff_head
*list_
)
1610 struct sk_buff
*skb
= list_
->prev
;
1612 if (skb
== (struct sk_buff
*)list_
)
1619 * skb_queue_len - get queue length
1620 * @list_: list to measure
1622 * Return the length of an &sk_buff queue.
1624 static inline __u32
skb_queue_len(const struct sk_buff_head
*list_
)
1630 * __skb_queue_head_init - initialize non-spinlock portions of sk_buff_head
1631 * @list: queue to initialize
1633 * This initializes only the list and queue length aspects of
1634 * an sk_buff_head object. This allows to initialize the list
1635 * aspects of an sk_buff_head without reinitializing things like
1636 * the spinlock. It can also be used for on-stack sk_buff_head
1637 * objects where the spinlock is known to not be used.
1639 static inline void __skb_queue_head_init(struct sk_buff_head
*list
)
1641 list
->prev
= list
->next
= (struct sk_buff
*)list
;
1646 * This function creates a split out lock class for each invocation;
1647 * this is needed for now since a whole lot of users of the skb-queue
1648 * infrastructure in drivers have different locking usage (in hardirq)
1649 * than the networking core (in softirq only). In the long run either the
1650 * network layer or drivers should need annotation to consolidate the
1651 * main types of usage into 3 classes.
1653 static inline void skb_queue_head_init(struct sk_buff_head
*list
)
1655 spin_lock_init(&list
->lock
);
1656 __skb_queue_head_init(list
);
1659 static inline void skb_queue_head_init_class(struct sk_buff_head
*list
,
1660 struct lock_class_key
*class)
1662 skb_queue_head_init(list
);
1663 lockdep_set_class(&list
->lock
, class);
1667 * Insert an sk_buff on a list.
1669 * The "__skb_xxxx()" functions are the non-atomic ones that
1670 * can only be called with interrupts disabled.
1672 void skb_insert(struct sk_buff
*old
, struct sk_buff
*newsk
,
1673 struct sk_buff_head
*list
);
1674 static inline void __skb_insert(struct sk_buff
*newsk
,
1675 struct sk_buff
*prev
, struct sk_buff
*next
,
1676 struct sk_buff_head
*list
)
1680 next
->prev
= prev
->next
= newsk
;
1684 static inline void __skb_queue_splice(const struct sk_buff_head
*list
,
1685 struct sk_buff
*prev
,
1686 struct sk_buff
*next
)
1688 struct sk_buff
*first
= list
->next
;
1689 struct sk_buff
*last
= list
->prev
;
1699 * skb_queue_splice - join two skb lists, this is designed for stacks
1700 * @list: the new list to add
1701 * @head: the place to add it in the first list
1703 static inline void skb_queue_splice(const struct sk_buff_head
*list
,
1704 struct sk_buff_head
*head
)
1706 if (!skb_queue_empty(list
)) {
1707 __skb_queue_splice(list
, (struct sk_buff
*) head
, head
->next
);
1708 head
->qlen
+= list
->qlen
;
1713 * skb_queue_splice_init - join two skb lists and reinitialise the emptied list
1714 * @list: the new list to add
1715 * @head: the place to add it in the first list
1717 * The list at @list is reinitialised
1719 static inline void skb_queue_splice_init(struct sk_buff_head
*list
,
1720 struct sk_buff_head
*head
)
1722 if (!skb_queue_empty(list
)) {
1723 __skb_queue_splice(list
, (struct sk_buff
*) head
, head
->next
);
1724 head
->qlen
+= list
->qlen
;
1725 __skb_queue_head_init(list
);
1730 * skb_queue_splice_tail - join two skb lists, each list being a queue
1731 * @list: the new list to add
1732 * @head: the place to add it in the first list
1734 static inline void skb_queue_splice_tail(const struct sk_buff_head
*list
,
1735 struct sk_buff_head
*head
)
1737 if (!skb_queue_empty(list
)) {
1738 __skb_queue_splice(list
, head
->prev
, (struct sk_buff
*) head
);
1739 head
->qlen
+= list
->qlen
;
1744 * skb_queue_splice_tail_init - join two skb lists and reinitialise the emptied list
1745 * @list: the new list to add
1746 * @head: the place to add it in the first list
1748 * Each of the lists is a queue.
1749 * The list at @list is reinitialised
1751 static inline void skb_queue_splice_tail_init(struct sk_buff_head
*list
,
1752 struct sk_buff_head
*head
)
1754 if (!skb_queue_empty(list
)) {
1755 __skb_queue_splice(list
, head
->prev
, (struct sk_buff
*) head
);
1756 head
->qlen
+= list
->qlen
;
1757 __skb_queue_head_init(list
);
1762 * __skb_queue_after - queue a buffer at the list head
1763 * @list: list to use
1764 * @prev: place after this buffer
1765 * @newsk: buffer to queue
1767 * Queue a buffer int the middle of a list. This function takes no locks
1768 * and you must therefore hold required locks before calling it.
1770 * A buffer cannot be placed on two lists at the same time.
1772 static inline void __skb_queue_after(struct sk_buff_head
*list
,
1773 struct sk_buff
*prev
,
1774 struct sk_buff
*newsk
)
1776 __skb_insert(newsk
, prev
, prev
->next
, list
);
1779 void skb_append(struct sk_buff
*old
, struct sk_buff
*newsk
,
1780 struct sk_buff_head
*list
);
1782 static inline void __skb_queue_before(struct sk_buff_head
*list
,
1783 struct sk_buff
*next
,
1784 struct sk_buff
*newsk
)
1786 __skb_insert(newsk
, next
->prev
, next
, list
);
1790 * __skb_queue_head - queue a buffer at the list head
1791 * @list: list to use
1792 * @newsk: buffer to queue
1794 * Queue a buffer at the start of a list. This function takes no locks
1795 * and you must therefore hold required locks before calling it.
1797 * A buffer cannot be placed on two lists at the same time.
1799 void skb_queue_head(struct sk_buff_head
*list
, struct sk_buff
*newsk
);
1800 static inline void __skb_queue_head(struct sk_buff_head
*list
,
1801 struct sk_buff
*newsk
)
1803 __skb_queue_after(list
, (struct sk_buff
*)list
, newsk
);
1807 * __skb_queue_tail - queue a buffer at the list tail
1808 * @list: list to use
1809 * @newsk: buffer to queue
1811 * Queue a buffer at the end of a list. This function takes no locks
1812 * and you must therefore hold required locks before calling it.
1814 * A buffer cannot be placed on two lists at the same time.
1816 void skb_queue_tail(struct sk_buff_head
*list
, struct sk_buff
*newsk
);
1817 static inline void __skb_queue_tail(struct sk_buff_head
*list
,
1818 struct sk_buff
*newsk
)
1820 __skb_queue_before(list
, (struct sk_buff
*)list
, newsk
);
1824 * remove sk_buff from list. _Must_ be called atomically, and with
1827 void skb_unlink(struct sk_buff
*skb
, struct sk_buff_head
*list
);
1828 static inline void __skb_unlink(struct sk_buff
*skb
, struct sk_buff_head
*list
)
1830 struct sk_buff
*next
, *prev
;
1835 skb
->next
= skb
->prev
= NULL
;
1841 * __skb_dequeue - remove from the head of the queue
1842 * @list: list to dequeue from
1844 * Remove the head of the list. This function does not take any locks
1845 * so must be used with appropriate locks held only. The head item is
1846 * returned or %NULL if the list is empty.
1848 struct sk_buff
*skb_dequeue(struct sk_buff_head
*list
);
1849 static inline struct sk_buff
*__skb_dequeue(struct sk_buff_head
*list
)
1851 struct sk_buff
*skb
= skb_peek(list
);
1853 __skb_unlink(skb
, list
);
1858 * __skb_dequeue_tail - remove from the tail of the queue
1859 * @list: list to dequeue from
1861 * Remove the tail of the list. This function does not take any locks
1862 * so must be used with appropriate locks held only. The tail item is
1863 * returned or %NULL if the list is empty.
1865 struct sk_buff
*skb_dequeue_tail(struct sk_buff_head
*list
);
1866 static inline struct sk_buff
*__skb_dequeue_tail(struct sk_buff_head
*list
)
1868 struct sk_buff
*skb
= skb_peek_tail(list
);
1870 __skb_unlink(skb
, list
);
1875 static inline bool skb_is_nonlinear(const struct sk_buff
*skb
)
1877 return skb
->data_len
;
1880 static inline unsigned int skb_headlen(const struct sk_buff
*skb
)
1882 return skb
->len
- skb
->data_len
;
1885 static inline unsigned int __skb_pagelen(const struct sk_buff
*skb
)
1887 unsigned int i
, len
= 0;
1889 for (i
= skb_shinfo(skb
)->nr_frags
- 1; (int)i
>= 0; i
--)
1890 len
+= skb_frag_size(&skb_shinfo(skb
)->frags
[i
]);
1894 static inline unsigned int skb_pagelen(const struct sk_buff
*skb
)
1896 return skb_headlen(skb
) + __skb_pagelen(skb
);
1900 * __skb_fill_page_desc - initialise a paged fragment in an skb
1901 * @skb: buffer containing fragment to be initialised
1902 * @i: paged fragment index to initialise
1903 * @page: the page to use for this fragment
1904 * @off: the offset to the data with @page
1905 * @size: the length of the data
1907 * Initialises the @i'th fragment of @skb to point to &size bytes at
1908 * offset @off within @page.
1910 * Does not take any additional reference on the fragment.
1912 static inline void __skb_fill_page_desc(struct sk_buff
*skb
, int i
,
1913 struct page
*page
, int off
, int size
)
1915 skb_frag_t
*frag
= &skb_shinfo(skb
)->frags
[i
];
1918 * Propagate page pfmemalloc to the skb if we can. The problem is
1919 * that not all callers have unique ownership of the page but rely
1920 * on page_is_pfmemalloc doing the right thing(tm).
1922 frag
->page
.p
= page
;
1923 frag
->page_offset
= off
;
1924 skb_frag_size_set(frag
, size
);
1926 page
= compound_head(page
);
1927 if (page_is_pfmemalloc(page
))
1928 skb
->pfmemalloc
= true;
1932 * skb_fill_page_desc - initialise a paged fragment in an skb
1933 * @skb: buffer containing fragment to be initialised
1934 * @i: paged fragment index to initialise
1935 * @page: the page to use for this fragment
1936 * @off: the offset to the data with @page
1937 * @size: the length of the data
1939 * As per __skb_fill_page_desc() -- initialises the @i'th fragment of
1940 * @skb to point to @size bytes at offset @off within @page. In
1941 * addition updates @skb such that @i is the last fragment.
1943 * Does not take any additional reference on the fragment.
1945 static inline void skb_fill_page_desc(struct sk_buff
*skb
, int i
,
1946 struct page
*page
, int off
, int size
)
1948 __skb_fill_page_desc(skb
, i
, page
, off
, size
);
1949 skb_shinfo(skb
)->nr_frags
= i
+ 1;
1952 void skb_add_rx_frag(struct sk_buff
*skb
, int i
, struct page
*page
, int off
,
1953 int size
, unsigned int truesize
);
1955 void skb_coalesce_rx_frag(struct sk_buff
*skb
, int i
, int size
,
1956 unsigned int truesize
);
1958 #define SKB_PAGE_ASSERT(skb) BUG_ON(skb_shinfo(skb)->nr_frags)
1959 #define SKB_FRAG_ASSERT(skb) BUG_ON(skb_has_frag_list(skb))
1960 #define SKB_LINEAR_ASSERT(skb) BUG_ON(skb_is_nonlinear(skb))
1962 #ifdef NET_SKBUFF_DATA_USES_OFFSET
1963 static inline unsigned char *skb_tail_pointer(const struct sk_buff
*skb
)
1965 return skb
->head
+ skb
->tail
;
1968 static inline void skb_reset_tail_pointer(struct sk_buff
*skb
)
1970 skb
->tail
= skb
->data
- skb
->head
;
1973 static inline void skb_set_tail_pointer(struct sk_buff
*skb
, const int offset
)
1975 skb_reset_tail_pointer(skb
);
1976 skb
->tail
+= offset
;
1979 #else /* NET_SKBUFF_DATA_USES_OFFSET */
1980 static inline unsigned char *skb_tail_pointer(const struct sk_buff
*skb
)
1985 static inline void skb_reset_tail_pointer(struct sk_buff
*skb
)
1987 skb
->tail
= skb
->data
;
1990 static inline void skb_set_tail_pointer(struct sk_buff
*skb
, const int offset
)
1992 skb
->tail
= skb
->data
+ offset
;
1995 #endif /* NET_SKBUFF_DATA_USES_OFFSET */
1998 * Add data to an sk_buff
2000 void *pskb_put(struct sk_buff
*skb
, struct sk_buff
*tail
, int len
);
2001 void *skb_put(struct sk_buff
*skb
, unsigned int len
);
2002 static inline void *__skb_put(struct sk_buff
*skb
, unsigned int len
)
2004 void *tmp
= skb_tail_pointer(skb
);
2005 SKB_LINEAR_ASSERT(skb
);
2011 static inline void *__skb_put_zero(struct sk_buff
*skb
, unsigned int len
)
2013 void *tmp
= __skb_put(skb
, len
);
2015 memset(tmp
, 0, len
);
2019 static inline void *__skb_put_data(struct sk_buff
*skb
, const void *data
,
2022 void *tmp
= __skb_put(skb
, len
);
2024 memcpy(tmp
, data
, len
);
2028 static inline void __skb_put_u8(struct sk_buff
*skb
, u8 val
)
2030 *(u8
*)__skb_put(skb
, 1) = val
;
2033 static inline void *skb_put_zero(struct sk_buff
*skb
, unsigned int len
)
2035 void *tmp
= skb_put(skb
, len
);
2037 memset(tmp
, 0, len
);
2042 static inline void *skb_put_data(struct sk_buff
*skb
, const void *data
,
2045 void *tmp
= skb_put(skb
, len
);
2047 memcpy(tmp
, data
, len
);
2052 static inline void skb_put_u8(struct sk_buff
*skb
, u8 val
)
2054 *(u8
*)skb_put(skb
, 1) = val
;
2057 void *skb_push(struct sk_buff
*skb
, unsigned int len
);
2058 static inline void *__skb_push(struct sk_buff
*skb
, unsigned int len
)
2065 void *skb_pull(struct sk_buff
*skb
, unsigned int len
);
2066 static inline void *__skb_pull(struct sk_buff
*skb
, unsigned int len
)
2069 BUG_ON(skb
->len
< skb
->data_len
);
2070 return skb
->data
+= len
;
2073 static inline void *skb_pull_inline(struct sk_buff
*skb
, unsigned int len
)
2075 return unlikely(len
> skb
->len
) ? NULL
: __skb_pull(skb
, len
);
2078 void *__pskb_pull_tail(struct sk_buff
*skb
, int delta
);
2080 static inline void *__pskb_pull(struct sk_buff
*skb
, unsigned int len
)
2082 if (len
> skb_headlen(skb
) &&
2083 !__pskb_pull_tail(skb
, len
- skb_headlen(skb
)))
2086 return skb
->data
+= len
;
2089 static inline void *pskb_pull(struct sk_buff
*skb
, unsigned int len
)
2091 return unlikely(len
> skb
->len
) ? NULL
: __pskb_pull(skb
, len
);
2094 static inline int pskb_may_pull(struct sk_buff
*skb
, unsigned int len
)
2096 if (likely(len
<= skb_headlen(skb
)))
2098 if (unlikely(len
> skb
->len
))
2100 return __pskb_pull_tail(skb
, len
- skb_headlen(skb
)) != NULL
;
2103 void skb_condense(struct sk_buff
*skb
);
2106 * skb_headroom - bytes at buffer head
2107 * @skb: buffer to check
2109 * Return the number of bytes of free space at the head of an &sk_buff.
2111 static inline unsigned int skb_headroom(const struct sk_buff
*skb
)
2113 return skb
->data
- skb
->head
;
2117 * skb_tailroom - bytes at buffer end
2118 * @skb: buffer to check
2120 * Return the number of bytes of free space at the tail of an sk_buff
2122 static inline int skb_tailroom(const struct sk_buff
*skb
)
2124 return skb_is_nonlinear(skb
) ? 0 : skb
->end
- skb
->tail
;
2128 * skb_availroom - bytes at buffer end
2129 * @skb: buffer to check
2131 * Return the number of bytes of free space at the tail of an sk_buff
2132 * allocated by sk_stream_alloc()
2134 static inline int skb_availroom(const struct sk_buff
*skb
)
2136 if (skb_is_nonlinear(skb
))
2139 return skb
->end
- skb
->tail
- skb
->reserved_tailroom
;
2143 * skb_reserve - adjust headroom
2144 * @skb: buffer to alter
2145 * @len: bytes to move
2147 * Increase the headroom of an empty &sk_buff by reducing the tail
2148 * room. This is only allowed for an empty buffer.
2150 static inline void skb_reserve(struct sk_buff
*skb
, int len
)
2157 * skb_tailroom_reserve - adjust reserved_tailroom
2158 * @skb: buffer to alter
2159 * @mtu: maximum amount of headlen permitted
2160 * @needed_tailroom: minimum amount of reserved_tailroom
2162 * Set reserved_tailroom so that headlen can be as large as possible but
2163 * not larger than mtu and tailroom cannot be smaller than
2165 * The required headroom should already have been reserved before using
2168 static inline void skb_tailroom_reserve(struct sk_buff
*skb
, unsigned int mtu
,
2169 unsigned int needed_tailroom
)
2171 SKB_LINEAR_ASSERT(skb
);
2172 if (mtu
< skb_tailroom(skb
) - needed_tailroom
)
2173 /* use at most mtu */
2174 skb
->reserved_tailroom
= skb_tailroom(skb
) - mtu
;
2176 /* use up to all available space */
2177 skb
->reserved_tailroom
= needed_tailroom
;
2180 #define ENCAP_TYPE_ETHER 0
2181 #define ENCAP_TYPE_IPPROTO 1
2183 static inline void skb_set_inner_protocol(struct sk_buff
*skb
,
2186 skb
->inner_protocol
= protocol
;
2187 skb
->inner_protocol_type
= ENCAP_TYPE_ETHER
;
2190 static inline void skb_set_inner_ipproto(struct sk_buff
*skb
,
2193 skb
->inner_ipproto
= ipproto
;
2194 skb
->inner_protocol_type
= ENCAP_TYPE_IPPROTO
;
2197 static inline void skb_reset_inner_headers(struct sk_buff
*skb
)
2199 skb
->inner_mac_header
= skb
->mac_header
;
2200 skb
->inner_network_header
= skb
->network_header
;
2201 skb
->inner_transport_header
= skb
->transport_header
;
2204 static inline void skb_reset_mac_len(struct sk_buff
*skb
)
2206 skb
->mac_len
= skb
->network_header
- skb
->mac_header
;
2209 static inline unsigned char *skb_inner_transport_header(const struct sk_buff
2212 return skb
->head
+ skb
->inner_transport_header
;
2215 static inline int skb_inner_transport_offset(const struct sk_buff
*skb
)
2217 return skb_inner_transport_header(skb
) - skb
->data
;
2220 static inline void skb_reset_inner_transport_header(struct sk_buff
*skb
)
2222 skb
->inner_transport_header
= skb
->data
- skb
->head
;
2225 static inline void skb_set_inner_transport_header(struct sk_buff
*skb
,
2228 skb_reset_inner_transport_header(skb
);
2229 skb
->inner_transport_header
+= offset
;
2232 static inline unsigned char *skb_inner_network_header(const struct sk_buff
*skb
)
2234 return skb
->head
+ skb
->inner_network_header
;
2237 static inline void skb_reset_inner_network_header(struct sk_buff
*skb
)
2239 skb
->inner_network_header
= skb
->data
- skb
->head
;
2242 static inline void skb_set_inner_network_header(struct sk_buff
*skb
,
2245 skb_reset_inner_network_header(skb
);
2246 skb
->inner_network_header
+= offset
;
2249 static inline unsigned char *skb_inner_mac_header(const struct sk_buff
*skb
)
2251 return skb
->head
+ skb
->inner_mac_header
;
2254 static inline void skb_reset_inner_mac_header(struct sk_buff
*skb
)
2256 skb
->inner_mac_header
= skb
->data
- skb
->head
;
2259 static inline void skb_set_inner_mac_header(struct sk_buff
*skb
,
2262 skb_reset_inner_mac_header(skb
);
2263 skb
->inner_mac_header
+= offset
;
2265 static inline bool skb_transport_header_was_set(const struct sk_buff
*skb
)
2267 return skb
->transport_header
!= (typeof(skb
->transport_header
))~0U;
2270 static inline unsigned char *skb_transport_header(const struct sk_buff
*skb
)
2272 return skb
->head
+ skb
->transport_header
;
2275 static inline void skb_reset_transport_header(struct sk_buff
*skb
)
2277 skb
->transport_header
= skb
->data
- skb
->head
;
2280 static inline void skb_set_transport_header(struct sk_buff
*skb
,
2283 skb_reset_transport_header(skb
);
2284 skb
->transport_header
+= offset
;
2287 static inline unsigned char *skb_network_header(const struct sk_buff
*skb
)
2289 return skb
->head
+ skb
->network_header
;
2292 static inline void skb_reset_network_header(struct sk_buff
*skb
)
2294 skb
->network_header
= skb
->data
- skb
->head
;
2297 static inline void skb_set_network_header(struct sk_buff
*skb
, const int offset
)
2299 skb_reset_network_header(skb
);
2300 skb
->network_header
+= offset
;
2303 static inline unsigned char *skb_mac_header(const struct sk_buff
*skb
)
2305 return skb
->head
+ skb
->mac_header
;
2308 static inline int skb_mac_offset(const struct sk_buff
*skb
)
2310 return skb_mac_header(skb
) - skb
->data
;
2313 static inline u32
skb_mac_header_len(const struct sk_buff
*skb
)
2315 return skb
->network_header
- skb
->mac_header
;
2318 static inline int skb_mac_header_was_set(const struct sk_buff
*skb
)
2320 return skb
->mac_header
!= (typeof(skb
->mac_header
))~0U;
2323 static inline void skb_reset_mac_header(struct sk_buff
*skb
)
2325 skb
->mac_header
= skb
->data
- skb
->head
;
2328 static inline void skb_set_mac_header(struct sk_buff
*skb
, const int offset
)
2330 skb_reset_mac_header(skb
);
2331 skb
->mac_header
+= offset
;
2334 static inline void skb_pop_mac_header(struct sk_buff
*skb
)
2336 skb
->mac_header
= skb
->network_header
;
2339 static inline void skb_probe_transport_header(struct sk_buff
*skb
,
2340 const int offset_hint
)
2342 struct flow_keys keys
;
2344 if (skb_transport_header_was_set(skb
))
2346 else if (skb_flow_dissect_flow_keys(skb
, &keys
, 0))
2347 skb_set_transport_header(skb
, keys
.control
.thoff
);
2349 skb_set_transport_header(skb
, offset_hint
);
2352 static inline void skb_mac_header_rebuild(struct sk_buff
*skb
)
2354 if (skb_mac_header_was_set(skb
)) {
2355 const unsigned char *old_mac
= skb_mac_header(skb
);
2357 skb_set_mac_header(skb
, -skb
->mac_len
);
2358 memmove(skb_mac_header(skb
), old_mac
, skb
->mac_len
);
2362 static inline int skb_checksum_start_offset(const struct sk_buff
*skb
)
2364 return skb
->csum_start
- skb_headroom(skb
);
2367 static inline unsigned char *skb_checksum_start(const struct sk_buff
*skb
)
2369 return skb
->head
+ skb
->csum_start
;
2372 static inline int skb_transport_offset(const struct sk_buff
*skb
)
2374 return skb_transport_header(skb
) - skb
->data
;
2377 static inline u32
skb_network_header_len(const struct sk_buff
*skb
)
2379 return skb
->transport_header
- skb
->network_header
;
2382 static inline u32
skb_inner_network_header_len(const struct sk_buff
*skb
)
2384 return skb
->inner_transport_header
- skb
->inner_network_header
;
2387 static inline int skb_network_offset(const struct sk_buff
*skb
)
2389 return skb_network_header(skb
) - skb
->data
;
2392 static inline int skb_inner_network_offset(const struct sk_buff
*skb
)
2394 return skb_inner_network_header(skb
) - skb
->data
;
2397 static inline int pskb_network_may_pull(struct sk_buff
*skb
, unsigned int len
)
2399 return pskb_may_pull(skb
, skb_network_offset(skb
) + len
);
2403 * CPUs often take a performance hit when accessing unaligned memory
2404 * locations. The actual performance hit varies, it can be small if the
2405 * hardware handles it or large if we have to take an exception and fix it
2408 * Since an ethernet header is 14 bytes network drivers often end up with
2409 * the IP header at an unaligned offset. The IP header can be aligned by
2410 * shifting the start of the packet by 2 bytes. Drivers should do this
2413 * skb_reserve(skb, NET_IP_ALIGN);
2415 * The downside to this alignment of the IP header is that the DMA is now
2416 * unaligned. On some architectures the cost of an unaligned DMA is high
2417 * and this cost outweighs the gains made by aligning the IP header.
2419 * Since this trade off varies between architectures, we allow NET_IP_ALIGN
2422 #ifndef NET_IP_ALIGN
2423 #define NET_IP_ALIGN 2
2427 * The networking layer reserves some headroom in skb data (via
2428 * dev_alloc_skb). This is used to avoid having to reallocate skb data when
2429 * the header has to grow. In the default case, if the header has to grow
2430 * 32 bytes or less we avoid the reallocation.
2432 * Unfortunately this headroom changes the DMA alignment of the resulting
2433 * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive
2434 * on some architectures. An architecture can override this value,
2435 * perhaps setting it to a cacheline in size (since that will maintain
2436 * cacheline alignment of the DMA). It must be a power of 2.
2438 * Various parts of the networking layer expect at least 32 bytes of
2439 * headroom, you should not reduce this.
2441 * Using max(32, L1_CACHE_BYTES) makes sense (especially with RPS)
2442 * to reduce average number of cache lines per packet.
2443 * get_rps_cpus() for example only access one 64 bytes aligned block :
2444 * NET_IP_ALIGN(2) + ethernet_header(14) + IP_header(20/40) + ports(8)
2447 #define NET_SKB_PAD max(32, L1_CACHE_BYTES)
2450 int ___pskb_trim(struct sk_buff
*skb
, unsigned int len
);
2452 static inline void __skb_set_length(struct sk_buff
*skb
, unsigned int len
)
2454 if (unlikely(skb_is_nonlinear(skb
))) {
2459 skb_set_tail_pointer(skb
, len
);
2462 static inline void __skb_trim(struct sk_buff
*skb
, unsigned int len
)
2464 __skb_set_length(skb
, len
);
2467 void skb_trim(struct sk_buff
*skb
, unsigned int len
);
2469 static inline int __pskb_trim(struct sk_buff
*skb
, unsigned int len
)
2472 return ___pskb_trim(skb
, len
);
2473 __skb_trim(skb
, len
);
2477 static inline int pskb_trim(struct sk_buff
*skb
, unsigned int len
)
2479 return (len
< skb
->len
) ? __pskb_trim(skb
, len
) : 0;
2483 * pskb_trim_unique - remove end from a paged unique (not cloned) buffer
2484 * @skb: buffer to alter
2487 * This is identical to pskb_trim except that the caller knows that
2488 * the skb is not cloned so we should never get an error due to out-
2491 static inline void pskb_trim_unique(struct sk_buff
*skb
, unsigned int len
)
2493 int err
= pskb_trim(skb
, len
);
2497 static inline int __skb_grow(struct sk_buff
*skb
, unsigned int len
)
2499 unsigned int diff
= len
- skb
->len
;
2501 if (skb_tailroom(skb
) < diff
) {
2502 int ret
= pskb_expand_head(skb
, 0, diff
- skb_tailroom(skb
),
2507 __skb_set_length(skb
, len
);
2512 * skb_orphan - orphan a buffer
2513 * @skb: buffer to orphan
2515 * If a buffer currently has an owner then we call the owner's
2516 * destructor function and make the @skb unowned. The buffer continues
2517 * to exist but is no longer charged to its former owner.
2519 static inline void skb_orphan(struct sk_buff
*skb
)
2521 if (skb
->destructor
) {
2522 skb
->destructor(skb
);
2523 skb
->destructor
= NULL
;
2531 * skb_orphan_frags - orphan the frags contained in a buffer
2532 * @skb: buffer to orphan frags from
2533 * @gfp_mask: allocation mask for replacement pages
2535 * For each frag in the SKB which needs a destructor (i.e. has an
2536 * owner) create a copy of that frag and release the original
2537 * page by calling the destructor.
2539 static inline int skb_orphan_frags(struct sk_buff
*skb
, gfp_t gfp_mask
)
2541 if (likely(!skb_zcopy(skb
)))
2543 if (skb_uarg(skb
)->callback
== sock_zerocopy_callback
)
2545 return skb_copy_ubufs(skb
, gfp_mask
);
2548 /* Frags must be orphaned, even if refcounted, if skb might loop to rx path */
2549 static inline int skb_orphan_frags_rx(struct sk_buff
*skb
, gfp_t gfp_mask
)
2551 if (likely(!skb_zcopy(skb
)))
2553 return skb_copy_ubufs(skb
, gfp_mask
);
2557 * __skb_queue_purge - empty a list
2558 * @list: list to empty
2560 * Delete all buffers on an &sk_buff list. Each buffer is removed from
2561 * the list and one reference dropped. This function does not take the
2562 * list lock and the caller must hold the relevant locks to use it.
2564 void skb_queue_purge(struct sk_buff_head
*list
);
2565 static inline void __skb_queue_purge(struct sk_buff_head
*list
)
2567 struct sk_buff
*skb
;
2568 while ((skb
= __skb_dequeue(list
)) != NULL
)
2572 unsigned int skb_rbtree_purge(struct rb_root
*root
);
2574 void *netdev_alloc_frag(unsigned int fragsz
);
2576 struct sk_buff
*__netdev_alloc_skb(struct net_device
*dev
, unsigned int length
,
2580 * netdev_alloc_skb - allocate an skbuff for rx on a specific device
2581 * @dev: network device to receive on
2582 * @length: length to allocate
2584 * Allocate a new &sk_buff and assign it a usage count of one. The
2585 * buffer has unspecified headroom built in. Users should allocate
2586 * the headroom they think they need without accounting for the
2587 * built in space. The built in space is used for optimisations.
2589 * %NULL is returned if there is no free memory. Although this function
2590 * allocates memory it can be called from an interrupt.
2592 static inline struct sk_buff
*netdev_alloc_skb(struct net_device
*dev
,
2593 unsigned int length
)
2595 return __netdev_alloc_skb(dev
, length
, GFP_ATOMIC
);
2598 /* legacy helper around __netdev_alloc_skb() */
2599 static inline struct sk_buff
*__dev_alloc_skb(unsigned int length
,
2602 return __netdev_alloc_skb(NULL
, length
, gfp_mask
);
2605 /* legacy helper around netdev_alloc_skb() */
2606 static inline struct sk_buff
*dev_alloc_skb(unsigned int length
)
2608 return netdev_alloc_skb(NULL
, length
);
2612 static inline struct sk_buff
*__netdev_alloc_skb_ip_align(struct net_device
*dev
,
2613 unsigned int length
, gfp_t gfp
)
2615 struct sk_buff
*skb
= __netdev_alloc_skb(dev
, length
+ NET_IP_ALIGN
, gfp
);
2617 if (NET_IP_ALIGN
&& skb
)
2618 skb_reserve(skb
, NET_IP_ALIGN
);
2622 static inline struct sk_buff
*netdev_alloc_skb_ip_align(struct net_device
*dev
,
2623 unsigned int length
)
2625 return __netdev_alloc_skb_ip_align(dev
, length
, GFP_ATOMIC
);
2628 static inline void skb_free_frag(void *addr
)
2630 page_frag_free(addr
);
2633 void *napi_alloc_frag(unsigned int fragsz
);
2634 struct sk_buff
*__napi_alloc_skb(struct napi_struct
*napi
,
2635 unsigned int length
, gfp_t gfp_mask
);
2636 static inline struct sk_buff
*napi_alloc_skb(struct napi_struct
*napi
,
2637 unsigned int length
)
2639 return __napi_alloc_skb(napi
, length
, GFP_ATOMIC
);
2641 void napi_consume_skb(struct sk_buff
*skb
, int budget
);
2643 void __kfree_skb_flush(void);
2644 void __kfree_skb_defer(struct sk_buff
*skb
);
2647 * __dev_alloc_pages - allocate page for network Rx
2648 * @gfp_mask: allocation priority. Set __GFP_NOMEMALLOC if not for network Rx
2649 * @order: size of the allocation
2651 * Allocate a new page.
2653 * %NULL is returned if there is no free memory.
2655 static inline struct page
*__dev_alloc_pages(gfp_t gfp_mask
,
2658 /* This piece of code contains several assumptions.
2659 * 1. This is for device Rx, therefor a cold page is preferred.
2660 * 2. The expectation is the user wants a compound page.
2661 * 3. If requesting a order 0 page it will not be compound
2662 * due to the check to see if order has a value in prep_new_page
2663 * 4. __GFP_MEMALLOC is ignored if __GFP_NOMEMALLOC is set due to
2664 * code in gfp_to_alloc_flags that should be enforcing this.
2666 gfp_mask
|= __GFP_COMP
| __GFP_MEMALLOC
;
2668 return alloc_pages_node(NUMA_NO_NODE
, gfp_mask
, order
);
2671 static inline struct page
*dev_alloc_pages(unsigned int order
)
2673 return __dev_alloc_pages(GFP_ATOMIC
| __GFP_NOWARN
, order
);
2677 * __dev_alloc_page - allocate a page for network Rx
2678 * @gfp_mask: allocation priority. Set __GFP_NOMEMALLOC if not for network Rx
2680 * Allocate a new page.
2682 * %NULL is returned if there is no free memory.
2684 static inline struct page
*__dev_alloc_page(gfp_t gfp_mask
)
2686 return __dev_alloc_pages(gfp_mask
, 0);
2689 static inline struct page
*dev_alloc_page(void)
2691 return dev_alloc_pages(0);
2695 * skb_propagate_pfmemalloc - Propagate pfmemalloc if skb is allocated after RX page
2696 * @page: The page that was allocated from skb_alloc_page
2697 * @skb: The skb that may need pfmemalloc set
2699 static inline void skb_propagate_pfmemalloc(struct page
*page
,
2700 struct sk_buff
*skb
)
2702 if (page_is_pfmemalloc(page
))
2703 skb
->pfmemalloc
= true;
2707 * skb_frag_page - retrieve the page referred to by a paged fragment
2708 * @frag: the paged fragment
2710 * Returns the &struct page associated with @frag.
2712 static inline struct page
*skb_frag_page(const skb_frag_t
*frag
)
2714 return frag
->page
.p
;
2718 * __skb_frag_ref - take an addition reference on a paged fragment.
2719 * @frag: the paged fragment
2721 * Takes an additional reference on the paged fragment @frag.
2723 static inline void __skb_frag_ref(skb_frag_t
*frag
)
2725 get_page(skb_frag_page(frag
));
2729 * skb_frag_ref - take an addition reference on a paged fragment of an skb.
2731 * @f: the fragment offset.
2733 * Takes an additional reference on the @f'th paged fragment of @skb.
2735 static inline void skb_frag_ref(struct sk_buff
*skb
, int f
)
2737 __skb_frag_ref(&skb_shinfo(skb
)->frags
[f
]);
2741 * __skb_frag_unref - release a reference on a paged fragment.
2742 * @frag: the paged fragment
2744 * Releases a reference on the paged fragment @frag.
2746 static inline void __skb_frag_unref(skb_frag_t
*frag
)
2748 put_page(skb_frag_page(frag
));
2752 * skb_frag_unref - release a reference on a paged fragment of an skb.
2754 * @f: the fragment offset
2756 * Releases a reference on the @f'th paged fragment of @skb.
2758 static inline void skb_frag_unref(struct sk_buff
*skb
, int f
)
2760 __skb_frag_unref(&skb_shinfo(skb
)->frags
[f
]);
2764 * skb_frag_address - gets the address of the data contained in a paged fragment
2765 * @frag: the paged fragment buffer
2767 * Returns the address of the data within @frag. The page must already
2770 static inline void *skb_frag_address(const skb_frag_t
*frag
)
2772 return page_address(skb_frag_page(frag
)) + frag
->page_offset
;
2776 * skb_frag_address_safe - gets the address of the data contained in a paged fragment
2777 * @frag: the paged fragment buffer
2779 * Returns the address of the data within @frag. Checks that the page
2780 * is mapped and returns %NULL otherwise.
2782 static inline void *skb_frag_address_safe(const skb_frag_t
*frag
)
2784 void *ptr
= page_address(skb_frag_page(frag
));
2788 return ptr
+ frag
->page_offset
;
2792 * __skb_frag_set_page - sets the page contained in a paged fragment
2793 * @frag: the paged fragment
2794 * @page: the page to set
2796 * Sets the fragment @frag to contain @page.
2798 static inline void __skb_frag_set_page(skb_frag_t
*frag
, struct page
*page
)
2800 frag
->page
.p
= page
;
2804 * skb_frag_set_page - sets the page contained in a paged fragment of an skb
2806 * @f: the fragment offset
2807 * @page: the page to set
2809 * Sets the @f'th fragment of @skb to contain @page.
2811 static inline void skb_frag_set_page(struct sk_buff
*skb
, int f
,
2814 __skb_frag_set_page(&skb_shinfo(skb
)->frags
[f
], page
);
2817 bool skb_page_frag_refill(unsigned int sz
, struct page_frag
*pfrag
, gfp_t prio
);
2820 * skb_frag_dma_map - maps a paged fragment via the DMA API
2821 * @dev: the device to map the fragment to
2822 * @frag: the paged fragment to map
2823 * @offset: the offset within the fragment (starting at the
2824 * fragment's own offset)
2825 * @size: the number of bytes to map
2826 * @dir: the direction of the mapping (``PCI_DMA_*``)
2828 * Maps the page associated with @frag to @device.
2830 static inline dma_addr_t
skb_frag_dma_map(struct device
*dev
,
2831 const skb_frag_t
*frag
,
2832 size_t offset
, size_t size
,
2833 enum dma_data_direction dir
)
2835 return dma_map_page(dev
, skb_frag_page(frag
),
2836 frag
->page_offset
+ offset
, size
, dir
);
2839 static inline struct sk_buff
*pskb_copy(struct sk_buff
*skb
,
2842 return __pskb_copy(skb
, skb_headroom(skb
), gfp_mask
);
2846 static inline struct sk_buff
*pskb_copy_for_clone(struct sk_buff
*skb
,
2849 return __pskb_copy_fclone(skb
, skb_headroom(skb
), gfp_mask
, true);
2854 * skb_clone_writable - is the header of a clone writable
2855 * @skb: buffer to check
2856 * @len: length up to which to write
2858 * Returns true if modifying the header part of the cloned buffer
2859 * does not requires the data to be copied.
2861 static inline int skb_clone_writable(const struct sk_buff
*skb
, unsigned int len
)
2863 return !skb_header_cloned(skb
) &&
2864 skb_headroom(skb
) + len
<= skb
->hdr_len
;
2867 static inline int skb_try_make_writable(struct sk_buff
*skb
,
2868 unsigned int write_len
)
2870 return skb_cloned(skb
) && !skb_clone_writable(skb
, write_len
) &&
2871 pskb_expand_head(skb
, 0, 0, GFP_ATOMIC
);
2874 static inline int __skb_cow(struct sk_buff
*skb
, unsigned int headroom
,
2879 if (headroom
> skb_headroom(skb
))
2880 delta
= headroom
- skb_headroom(skb
);
2882 if (delta
|| cloned
)
2883 return pskb_expand_head(skb
, ALIGN(delta
, NET_SKB_PAD
), 0,
2889 * skb_cow - copy header of skb when it is required
2890 * @skb: buffer to cow
2891 * @headroom: needed headroom
2893 * If the skb passed lacks sufficient headroom or its data part
2894 * is shared, data is reallocated. If reallocation fails, an error
2895 * is returned and original skb is not changed.
2897 * The result is skb with writable area skb->head...skb->tail
2898 * and at least @headroom of space at head.
2900 static inline int skb_cow(struct sk_buff
*skb
, unsigned int headroom
)
2902 return __skb_cow(skb
, headroom
, skb_cloned(skb
));
2906 * skb_cow_head - skb_cow but only making the head writable
2907 * @skb: buffer to cow
2908 * @headroom: needed headroom
2910 * This function is identical to skb_cow except that we replace the
2911 * skb_cloned check by skb_header_cloned. It should be used when
2912 * you only need to push on some header and do not need to modify
2915 static inline int skb_cow_head(struct sk_buff
*skb
, unsigned int headroom
)
2917 return __skb_cow(skb
, headroom
, skb_header_cloned(skb
));
2921 * skb_padto - pad an skbuff up to a minimal size
2922 * @skb: buffer to pad
2923 * @len: minimal length
2925 * Pads up a buffer to ensure the trailing bytes exist and are
2926 * blanked. If the buffer already contains sufficient data it
2927 * is untouched. Otherwise it is extended. Returns zero on
2928 * success. The skb is freed on error.
2930 static inline int skb_padto(struct sk_buff
*skb
, unsigned int len
)
2932 unsigned int size
= skb
->len
;
2933 if (likely(size
>= len
))
2935 return skb_pad(skb
, len
- size
);
2939 * skb_put_padto - increase size and pad an skbuff up to a minimal size
2940 * @skb: buffer to pad
2941 * @len: minimal length
2942 * @free_on_error: free buffer on error
2944 * Pads up a buffer to ensure the trailing bytes exist and are
2945 * blanked. If the buffer already contains sufficient data it
2946 * is untouched. Otherwise it is extended. Returns zero on
2947 * success. The skb is freed on error if @free_on_error is true.
2949 static inline int __skb_put_padto(struct sk_buff
*skb
, unsigned int len
,
2952 unsigned int size
= skb
->len
;
2954 if (unlikely(size
< len
)) {
2956 if (__skb_pad(skb
, len
, free_on_error
))
2958 __skb_put(skb
, len
);
2964 * skb_put_padto - increase size and pad an skbuff up to a minimal size
2965 * @skb: buffer to pad
2966 * @len: minimal length
2968 * Pads up a buffer to ensure the trailing bytes exist and are
2969 * blanked. If the buffer already contains sufficient data it
2970 * is untouched. Otherwise it is extended. Returns zero on
2971 * success. The skb is freed on error.
2973 static inline int skb_put_padto(struct sk_buff
*skb
, unsigned int len
)
2975 return __skb_put_padto(skb
, len
, true);
2978 static inline int skb_add_data(struct sk_buff
*skb
,
2979 struct iov_iter
*from
, int copy
)
2981 const int off
= skb
->len
;
2983 if (skb
->ip_summed
== CHECKSUM_NONE
) {
2985 if (csum_and_copy_from_iter_full(skb_put(skb
, copy
), copy
,
2987 skb
->csum
= csum_block_add(skb
->csum
, csum
, off
);
2990 } else if (copy_from_iter_full(skb_put(skb
, copy
), copy
, from
))
2993 __skb_trim(skb
, off
);
2997 static inline bool skb_can_coalesce(struct sk_buff
*skb
, int i
,
2998 const struct page
*page
, int off
)
3003 const struct skb_frag_struct
*frag
= &skb_shinfo(skb
)->frags
[i
- 1];
3005 return page
== skb_frag_page(frag
) &&
3006 off
== frag
->page_offset
+ skb_frag_size(frag
);
3011 static inline int __skb_linearize(struct sk_buff
*skb
)
3013 return __pskb_pull_tail(skb
, skb
->data_len
) ? 0 : -ENOMEM
;
3017 * skb_linearize - convert paged skb to linear one
3018 * @skb: buffer to linarize
3020 * If there is no free memory -ENOMEM is returned, otherwise zero
3021 * is returned and the old skb data released.
3023 static inline int skb_linearize(struct sk_buff
*skb
)
3025 return skb_is_nonlinear(skb
) ? __skb_linearize(skb
) : 0;
3029 * skb_has_shared_frag - can any frag be overwritten
3030 * @skb: buffer to test
3032 * Return true if the skb has at least one frag that might be modified
3033 * by an external entity (as in vmsplice()/sendfile())
3035 static inline bool skb_has_shared_frag(const struct sk_buff
*skb
)
3037 return skb_is_nonlinear(skb
) &&
3038 skb_shinfo(skb
)->tx_flags
& SKBTX_SHARED_FRAG
;
3042 * skb_linearize_cow - make sure skb is linear and writable
3043 * @skb: buffer to process
3045 * If there is no free memory -ENOMEM is returned, otherwise zero
3046 * is returned and the old skb data released.
3048 static inline int skb_linearize_cow(struct sk_buff
*skb
)
3050 return skb_is_nonlinear(skb
) || skb_cloned(skb
) ?
3051 __skb_linearize(skb
) : 0;
3054 static __always_inline
void
3055 __skb_postpull_rcsum(struct sk_buff
*skb
, const void *start
, unsigned int len
,
3058 if (skb
->ip_summed
== CHECKSUM_COMPLETE
)
3059 skb
->csum
= csum_block_sub(skb
->csum
,
3060 csum_partial(start
, len
, 0), off
);
3061 else if (skb
->ip_summed
== CHECKSUM_PARTIAL
&&
3062 skb_checksum_start_offset(skb
) < 0)
3063 skb
->ip_summed
= CHECKSUM_NONE
;
3067 * skb_postpull_rcsum - update checksum for received skb after pull
3068 * @skb: buffer to update
3069 * @start: start of data before pull
3070 * @len: length of data pulled
3072 * After doing a pull on a received packet, you need to call this to
3073 * update the CHECKSUM_COMPLETE checksum, or set ip_summed to
3074 * CHECKSUM_NONE so that it can be recomputed from scratch.
3076 static inline void skb_postpull_rcsum(struct sk_buff
*skb
,
3077 const void *start
, unsigned int len
)
3079 __skb_postpull_rcsum(skb
, start
, len
, 0);
3082 static __always_inline
void
3083 __skb_postpush_rcsum(struct sk_buff
*skb
, const void *start
, unsigned int len
,
3086 if (skb
->ip_summed
== CHECKSUM_COMPLETE
)
3087 skb
->csum
= csum_block_add(skb
->csum
,
3088 csum_partial(start
, len
, 0), off
);
3092 * skb_postpush_rcsum - update checksum for received skb after push
3093 * @skb: buffer to update
3094 * @start: start of data after push
3095 * @len: length of data pushed
3097 * After doing a push on a received packet, you need to call this to
3098 * update the CHECKSUM_COMPLETE checksum.
3100 static inline void skb_postpush_rcsum(struct sk_buff
*skb
,
3101 const void *start
, unsigned int len
)
3103 __skb_postpush_rcsum(skb
, start
, len
, 0);
3106 void *skb_pull_rcsum(struct sk_buff
*skb
, unsigned int len
);
3109 * skb_push_rcsum - push skb and update receive checksum
3110 * @skb: buffer to update
3111 * @len: length of data pulled
3113 * This function performs an skb_push on the packet and updates
3114 * the CHECKSUM_COMPLETE checksum. It should be used on
3115 * receive path processing instead of skb_push unless you know
3116 * that the checksum difference is zero (e.g., a valid IP header)
3117 * or you are setting ip_summed to CHECKSUM_NONE.
3119 static inline void *skb_push_rcsum(struct sk_buff
*skb
, unsigned int len
)
3122 skb_postpush_rcsum(skb
, skb
->data
, len
);
3127 * pskb_trim_rcsum - trim received skb and update checksum
3128 * @skb: buffer to trim
3131 * This is exactly the same as pskb_trim except that it ensures the
3132 * checksum of received packets are still valid after the operation.
3135 static inline int pskb_trim_rcsum(struct sk_buff
*skb
, unsigned int len
)
3137 if (likely(len
>= skb
->len
))
3139 if (skb
->ip_summed
== CHECKSUM_COMPLETE
)
3140 skb
->ip_summed
= CHECKSUM_NONE
;
3141 return __pskb_trim(skb
, len
);
3144 static inline int __skb_trim_rcsum(struct sk_buff
*skb
, unsigned int len
)
3146 if (skb
->ip_summed
== CHECKSUM_COMPLETE
)
3147 skb
->ip_summed
= CHECKSUM_NONE
;
3148 __skb_trim(skb
, len
);
3152 static inline int __skb_grow_rcsum(struct sk_buff
*skb
, unsigned int len
)
3154 if (skb
->ip_summed
== CHECKSUM_COMPLETE
)
3155 skb
->ip_summed
= CHECKSUM_NONE
;
3156 return __skb_grow(skb
, len
);
3159 #define rb_to_skb(rb) rb_entry_safe(rb, struct sk_buff, rbnode)
3160 #define skb_rb_first(root) rb_to_skb(rb_first(root))
3161 #define skb_rb_last(root) rb_to_skb(rb_last(root))
3162 #define skb_rb_next(skb) rb_to_skb(rb_next(&(skb)->rbnode))
3163 #define skb_rb_prev(skb) rb_to_skb(rb_prev(&(skb)->rbnode))
3165 #define skb_queue_walk(queue, skb) \
3166 for (skb = (queue)->next; \
3167 skb != (struct sk_buff *)(queue); \
3170 #define skb_queue_walk_safe(queue, skb, tmp) \
3171 for (skb = (queue)->next, tmp = skb->next; \
3172 skb != (struct sk_buff *)(queue); \
3173 skb = tmp, tmp = skb->next)
3175 #define skb_queue_walk_from(queue, skb) \
3176 for (; skb != (struct sk_buff *)(queue); \
3179 #define skb_rbtree_walk(skb, root) \
3180 for (skb = skb_rb_first(root); skb != NULL; \
3181 skb = skb_rb_next(skb))
3183 #define skb_rbtree_walk_from(skb) \
3184 for (; skb != NULL; \
3185 skb = skb_rb_next(skb))
3187 #define skb_rbtree_walk_from_safe(skb, tmp) \
3188 for (; tmp = skb ? skb_rb_next(skb) : NULL, (skb != NULL); \
3191 #define skb_queue_walk_from_safe(queue, skb, tmp) \
3192 for (tmp = skb->next; \
3193 skb != (struct sk_buff *)(queue); \
3194 skb = tmp, tmp = skb->next)
3196 #define skb_queue_reverse_walk(queue, skb) \
3197 for (skb = (queue)->prev; \
3198 skb != (struct sk_buff *)(queue); \
3201 #define skb_queue_reverse_walk_safe(queue, skb, tmp) \
3202 for (skb = (queue)->prev, tmp = skb->prev; \
3203 skb != (struct sk_buff *)(queue); \
3204 skb = tmp, tmp = skb->prev)
3206 #define skb_queue_reverse_walk_from_safe(queue, skb, tmp) \
3207 for (tmp = skb->prev; \
3208 skb != (struct sk_buff *)(queue); \
3209 skb = tmp, tmp = skb->prev)
3211 static inline bool skb_has_frag_list(const struct sk_buff
*skb
)
3213 return skb_shinfo(skb
)->frag_list
!= NULL
;
3216 static inline void skb_frag_list_init(struct sk_buff
*skb
)
3218 skb_shinfo(skb
)->frag_list
= NULL
;
3221 #define skb_walk_frags(skb, iter) \
3222 for (iter = skb_shinfo(skb)->frag_list; iter; iter = iter->next)
3225 int __skb_wait_for_more_packets(struct sock
*sk
, int *err
, long *timeo_p
,
3226 const struct sk_buff
*skb
);
3227 struct sk_buff
*__skb_try_recv_from_queue(struct sock
*sk
,
3228 struct sk_buff_head
*queue
,
3230 void (*destructor
)(struct sock
*sk
,
3231 struct sk_buff
*skb
),
3232 int *peeked
, int *off
, int *err
,
3233 struct sk_buff
**last
);
3234 struct sk_buff
*__skb_try_recv_datagram(struct sock
*sk
, unsigned flags
,
3235 void (*destructor
)(struct sock
*sk
,
3236 struct sk_buff
*skb
),
3237 int *peeked
, int *off
, int *err
,
3238 struct sk_buff
**last
);
3239 struct sk_buff
*__skb_recv_datagram(struct sock
*sk
, unsigned flags
,
3240 void (*destructor
)(struct sock
*sk
,
3241 struct sk_buff
*skb
),
3242 int *peeked
, int *off
, int *err
);
3243 struct sk_buff
*skb_recv_datagram(struct sock
*sk
, unsigned flags
, int noblock
,
3245 unsigned int datagram_poll(struct file
*file
, struct socket
*sock
,
3246 struct poll_table_struct
*wait
);
3247 int skb_copy_datagram_iter(const struct sk_buff
*from
, int offset
,
3248 struct iov_iter
*to
, int size
);
3249 static inline int skb_copy_datagram_msg(const struct sk_buff
*from
, int offset
,
3250 struct msghdr
*msg
, int size
)
3252 return skb_copy_datagram_iter(from
, offset
, &msg
->msg_iter
, size
);
3254 int skb_copy_and_csum_datagram_msg(struct sk_buff
*skb
, int hlen
,
3255 struct msghdr
*msg
);
3256 int skb_copy_datagram_from_iter(struct sk_buff
*skb
, int offset
,
3257 struct iov_iter
*from
, int len
);
3258 int zerocopy_sg_from_iter(struct sk_buff
*skb
, struct iov_iter
*frm
);
3259 void skb_free_datagram(struct sock
*sk
, struct sk_buff
*skb
);
3260 void __skb_free_datagram_locked(struct sock
*sk
, struct sk_buff
*skb
, int len
);
3261 static inline void skb_free_datagram_locked(struct sock
*sk
,
3262 struct sk_buff
*skb
)
3264 __skb_free_datagram_locked(sk
, skb
, 0);
3266 int skb_kill_datagram(struct sock
*sk
, struct sk_buff
*skb
, unsigned int flags
);
3267 int skb_copy_bits(const struct sk_buff
*skb
, int offset
, void *to
, int len
);
3268 int skb_store_bits(struct sk_buff
*skb
, int offset
, const void *from
, int len
);
3269 __wsum
skb_copy_and_csum_bits(const struct sk_buff
*skb
, int offset
, u8
*to
,
3270 int len
, __wsum csum
);
3271 int skb_splice_bits(struct sk_buff
*skb
, struct sock
*sk
, unsigned int offset
,
3272 struct pipe_inode_info
*pipe
, unsigned int len
,
3273 unsigned int flags
);
3274 int skb_send_sock_locked(struct sock
*sk
, struct sk_buff
*skb
, int offset
,
3276 int skb_send_sock(struct sock
*sk
, struct sk_buff
*skb
, int offset
, int len
);
3277 void skb_copy_and_csum_dev(const struct sk_buff
*skb
, u8
*to
);
3278 unsigned int skb_zerocopy_headlen(const struct sk_buff
*from
);
3279 int skb_zerocopy(struct sk_buff
*to
, struct sk_buff
*from
,
3281 void skb_split(struct sk_buff
*skb
, struct sk_buff
*skb1
, const u32 len
);
3282 int skb_shift(struct sk_buff
*tgt
, struct sk_buff
*skb
, int shiftlen
);
3283 void skb_scrub_packet(struct sk_buff
*skb
, bool xnet
);
3284 unsigned int skb_gso_transport_seglen(const struct sk_buff
*skb
);
3285 bool skb_gso_validate_mtu(const struct sk_buff
*skb
, unsigned int mtu
);
3286 bool skb_gso_validate_mac_len(const struct sk_buff
*skb
, unsigned int len
);
3287 struct sk_buff
*skb_segment(struct sk_buff
*skb
, netdev_features_t features
);
3288 struct sk_buff
*skb_vlan_untag(struct sk_buff
*skb
);
3289 int skb_ensure_writable(struct sk_buff
*skb
, int write_len
);
3290 int __skb_vlan_pop(struct sk_buff
*skb
, u16
*vlan_tci
);
3291 int skb_vlan_pop(struct sk_buff
*skb
);
3292 int skb_vlan_push(struct sk_buff
*skb
, __be16 vlan_proto
, u16 vlan_tci
);
3293 struct sk_buff
*pskb_extract(struct sk_buff
*skb
, int off
, int to_copy
,
3296 static inline int memcpy_from_msg(void *data
, struct msghdr
*msg
, int len
)
3298 return copy_from_iter_full(data
, len
, &msg
->msg_iter
) ? 0 : -EFAULT
;
3301 static inline int memcpy_to_msg(struct msghdr
*msg
, void *data
, int len
)
3303 return copy_to_iter(data
, len
, &msg
->msg_iter
) == len
? 0 : -EFAULT
;
3306 struct skb_checksum_ops
{
3307 __wsum (*update
)(const void *mem
, int len
, __wsum wsum
);
3308 __wsum (*combine
)(__wsum csum
, __wsum csum2
, int offset
, int len
);
3311 extern const struct skb_checksum_ops
*crc32c_csum_stub __read_mostly
;
3313 __wsum
__skb_checksum(const struct sk_buff
*skb
, int offset
, int len
,
3314 __wsum csum
, const struct skb_checksum_ops
*ops
);
3315 __wsum
skb_checksum(const struct sk_buff
*skb
, int offset
, int len
,
3318 static inline void * __must_check
3319 __skb_header_pointer(const struct sk_buff
*skb
, int offset
,
3320 int len
, void *data
, int hlen
, void *buffer
)
3322 if (hlen
- offset
>= len
)
3323 return data
+ offset
;
3326 skb_copy_bits(skb
, offset
, buffer
, len
) < 0)
3332 static inline void * __must_check
3333 skb_header_pointer(const struct sk_buff
*skb
, int offset
, int len
, void *buffer
)
3335 return __skb_header_pointer(skb
, offset
, len
, skb
->data
,
3336 skb_headlen(skb
), buffer
);
3340 * skb_needs_linearize - check if we need to linearize a given skb
3341 * depending on the given device features.
3342 * @skb: socket buffer to check
3343 * @features: net device features
3345 * Returns true if either:
3346 * 1. skb has frag_list and the device doesn't support FRAGLIST, or
3347 * 2. skb is fragmented and the device does not support SG.
3349 static inline bool skb_needs_linearize(struct sk_buff
*skb
,
3350 netdev_features_t features
)
3352 return skb_is_nonlinear(skb
) &&
3353 ((skb_has_frag_list(skb
) && !(features
& NETIF_F_FRAGLIST
)) ||
3354 (skb_shinfo(skb
)->nr_frags
&& !(features
& NETIF_F_SG
)));
3357 static inline void skb_copy_from_linear_data(const struct sk_buff
*skb
,
3359 const unsigned int len
)
3361 memcpy(to
, skb
->data
, len
);
3364 static inline void skb_copy_from_linear_data_offset(const struct sk_buff
*skb
,
3365 const int offset
, void *to
,
3366 const unsigned int len
)
3368 memcpy(to
, skb
->data
+ offset
, len
);
3371 static inline void skb_copy_to_linear_data(struct sk_buff
*skb
,
3373 const unsigned int len
)
3375 memcpy(skb
->data
, from
, len
);
3378 static inline void skb_copy_to_linear_data_offset(struct sk_buff
*skb
,
3381 const unsigned int len
)
3383 memcpy(skb
->data
+ offset
, from
, len
);
3386 void skb_init(void);
3388 static inline ktime_t
skb_get_ktime(const struct sk_buff
*skb
)
3394 * skb_get_timestamp - get timestamp from a skb
3395 * @skb: skb to get stamp from
3396 * @stamp: pointer to struct timeval to store stamp in
3398 * Timestamps are stored in the skb as offsets to a base timestamp.
3399 * This function converts the offset back to a struct timeval and stores
3402 static inline void skb_get_timestamp(const struct sk_buff
*skb
,
3403 struct timeval
*stamp
)
3405 *stamp
= ktime_to_timeval(skb
->tstamp
);
3408 static inline void skb_get_timestampns(const struct sk_buff
*skb
,
3409 struct timespec
*stamp
)
3411 *stamp
= ktime_to_timespec(skb
->tstamp
);
3414 static inline void __net_timestamp(struct sk_buff
*skb
)
3416 skb
->tstamp
= ktime_get_real();
3419 static inline ktime_t
net_timedelta(ktime_t t
)
3421 return ktime_sub(ktime_get_real(), t
);
3424 static inline ktime_t
net_invalid_timestamp(void)
3429 static inline u8
skb_metadata_len(const struct sk_buff
*skb
)
3431 return skb_shinfo(skb
)->meta_len
;
3434 static inline void *skb_metadata_end(const struct sk_buff
*skb
)
3436 return skb_mac_header(skb
);
3439 static inline bool __skb_metadata_differs(const struct sk_buff
*skb_a
,
3440 const struct sk_buff
*skb_b
,
3443 const void *a
= skb_metadata_end(skb_a
);
3444 const void *b
= skb_metadata_end(skb_b
);
3445 /* Using more efficient varaiant than plain call to memcmp(). */
3446 #if defined(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) && BITS_PER_LONG == 64
3450 #define __it(x, op) (x -= sizeof(u##op))
3451 #define __it_diff(a, b, op) (*(u##op *)__it(a, op)) ^ (*(u##op *)__it(b, op))
3452 case 32: diffs
|= __it_diff(a
, b
, 64);
3453 case 24: diffs
|= __it_diff(a
, b
, 64);
3454 case 16: diffs
|= __it_diff(a
, b
, 64);
3455 case 8: diffs
|= __it_diff(a
, b
, 64);
3457 case 28: diffs
|= __it_diff(a
, b
, 64);
3458 case 20: diffs
|= __it_diff(a
, b
, 64);
3459 case 12: diffs
|= __it_diff(a
, b
, 64);
3460 case 4: diffs
|= __it_diff(a
, b
, 32);
3465 return memcmp(a
- meta_len
, b
- meta_len
, meta_len
);
3469 static inline bool skb_metadata_differs(const struct sk_buff
*skb_a
,
3470 const struct sk_buff
*skb_b
)
3472 u8 len_a
= skb_metadata_len(skb_a
);
3473 u8 len_b
= skb_metadata_len(skb_b
);
3475 if (!(len_a
| len_b
))
3478 return len_a
!= len_b
?
3479 true : __skb_metadata_differs(skb_a
, skb_b
, len_a
);
3482 static inline void skb_metadata_set(struct sk_buff
*skb
, u8 meta_len
)
3484 skb_shinfo(skb
)->meta_len
= meta_len
;
3487 static inline void skb_metadata_clear(struct sk_buff
*skb
)
3489 skb_metadata_set(skb
, 0);
3492 struct sk_buff
*skb_clone_sk(struct sk_buff
*skb
);
3494 #ifdef CONFIG_NETWORK_PHY_TIMESTAMPING
3496 void skb_clone_tx_timestamp(struct sk_buff
*skb
);
3497 bool skb_defer_rx_timestamp(struct sk_buff
*skb
);
3499 #else /* CONFIG_NETWORK_PHY_TIMESTAMPING */
3501 static inline void skb_clone_tx_timestamp(struct sk_buff
*skb
)
3505 static inline bool skb_defer_rx_timestamp(struct sk_buff
*skb
)
3510 #endif /* !CONFIG_NETWORK_PHY_TIMESTAMPING */
3513 * skb_complete_tx_timestamp() - deliver cloned skb with tx timestamps
3515 * PHY drivers may accept clones of transmitted packets for
3516 * timestamping via their phy_driver.txtstamp method. These drivers
3517 * must call this function to return the skb back to the stack with a
3520 * @skb: clone of the the original outgoing packet
3521 * @hwtstamps: hardware time stamps
3524 void skb_complete_tx_timestamp(struct sk_buff
*skb
,
3525 struct skb_shared_hwtstamps
*hwtstamps
);
3527 void __skb_tstamp_tx(struct sk_buff
*orig_skb
,
3528 struct skb_shared_hwtstamps
*hwtstamps
,
3529 struct sock
*sk
, int tstype
);
3532 * skb_tstamp_tx - queue clone of skb with send time stamps
3533 * @orig_skb: the original outgoing packet
3534 * @hwtstamps: hardware time stamps, may be NULL if not available
3536 * If the skb has a socket associated, then this function clones the
3537 * skb (thus sharing the actual data and optional structures), stores
3538 * the optional hardware time stamping information (if non NULL) or
3539 * generates a software time stamp (otherwise), then queues the clone
3540 * to the error queue of the socket. Errors are silently ignored.
3542 void skb_tstamp_tx(struct sk_buff
*orig_skb
,
3543 struct skb_shared_hwtstamps
*hwtstamps
);
3546 * skb_tx_timestamp() - Driver hook for transmit timestamping
3548 * Ethernet MAC Drivers should call this function in their hard_xmit()
3549 * function immediately before giving the sk_buff to the MAC hardware.
3551 * Specifically, one should make absolutely sure that this function is
3552 * called before TX completion of this packet can trigger. Otherwise
3553 * the packet could potentially already be freed.
3555 * @skb: A socket buffer.
3557 static inline void skb_tx_timestamp(struct sk_buff
*skb
)
3559 skb_clone_tx_timestamp(skb
);
3560 if (skb_shinfo(skb
)->tx_flags
& SKBTX_SW_TSTAMP
)
3561 skb_tstamp_tx(skb
, NULL
);
3565 * skb_complete_wifi_ack - deliver skb with wifi status
3567 * @skb: the original outgoing packet
3568 * @acked: ack status
3571 void skb_complete_wifi_ack(struct sk_buff
*skb
, bool acked
);
3573 __sum16
__skb_checksum_complete_head(struct sk_buff
*skb
, int len
);
3574 __sum16
__skb_checksum_complete(struct sk_buff
*skb
);
3576 static inline int skb_csum_unnecessary(const struct sk_buff
*skb
)
3578 return ((skb
->ip_summed
== CHECKSUM_UNNECESSARY
) ||
3580 (skb
->ip_summed
== CHECKSUM_PARTIAL
&&
3581 skb_checksum_start_offset(skb
) >= 0));
3585 * skb_checksum_complete - Calculate checksum of an entire packet
3586 * @skb: packet to process
3588 * This function calculates the checksum over the entire packet plus
3589 * the value of skb->csum. The latter can be used to supply the
3590 * checksum of a pseudo header as used by TCP/UDP. It returns the
3593 * For protocols that contain complete checksums such as ICMP/TCP/UDP,
3594 * this function can be used to verify that checksum on received
3595 * packets. In that case the function should return zero if the
3596 * checksum is correct. In particular, this function will return zero
3597 * if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the
3598 * hardware has already verified the correctness of the checksum.
3600 static inline __sum16
skb_checksum_complete(struct sk_buff
*skb
)
3602 return skb_csum_unnecessary(skb
) ?
3603 0 : __skb_checksum_complete(skb
);
3606 static inline void __skb_decr_checksum_unnecessary(struct sk_buff
*skb
)
3608 if (skb
->ip_summed
== CHECKSUM_UNNECESSARY
) {
3609 if (skb
->csum_level
== 0)
3610 skb
->ip_summed
= CHECKSUM_NONE
;
3616 static inline void __skb_incr_checksum_unnecessary(struct sk_buff
*skb
)
3618 if (skb
->ip_summed
== CHECKSUM_UNNECESSARY
) {
3619 if (skb
->csum_level
< SKB_MAX_CSUM_LEVEL
)
3621 } else if (skb
->ip_summed
== CHECKSUM_NONE
) {
3622 skb
->ip_summed
= CHECKSUM_UNNECESSARY
;
3623 skb
->csum_level
= 0;
3627 /* Check if we need to perform checksum complete validation.
3629 * Returns true if checksum complete is needed, false otherwise
3630 * (either checksum is unnecessary or zero checksum is allowed).
3632 static inline bool __skb_checksum_validate_needed(struct sk_buff
*skb
,
3636 if (skb_csum_unnecessary(skb
) || (zero_okay
&& !check
)) {
3637 skb
->csum_valid
= 1;
3638 __skb_decr_checksum_unnecessary(skb
);
3645 /* For small packets <= CHECKSUM_BREAK peform checksum complete directly
3648 #define CHECKSUM_BREAK 76
3650 /* Unset checksum-complete
3652 * Unset checksum complete can be done when packet is being modified
3653 * (uncompressed for instance) and checksum-complete value is
3656 static inline void skb_checksum_complete_unset(struct sk_buff
*skb
)
3658 if (skb
->ip_summed
== CHECKSUM_COMPLETE
)
3659 skb
->ip_summed
= CHECKSUM_NONE
;
3662 /* Validate (init) checksum based on checksum complete.
3665 * 0: checksum is validated or try to in skb_checksum_complete. In the latter
3666 * case the ip_summed will not be CHECKSUM_UNNECESSARY and the pseudo
3667 * checksum is stored in skb->csum for use in __skb_checksum_complete
3668 * non-zero: value of invalid checksum
3671 static inline __sum16
__skb_checksum_validate_complete(struct sk_buff
*skb
,
3675 if (skb
->ip_summed
== CHECKSUM_COMPLETE
) {
3676 if (!csum_fold(csum_add(psum
, skb
->csum
))) {
3677 skb
->csum_valid
= 1;
3684 if (complete
|| skb
->len
<= CHECKSUM_BREAK
) {
3687 csum
= __skb_checksum_complete(skb
);
3688 skb
->csum_valid
= !csum
;
3695 static inline __wsum
null_compute_pseudo(struct sk_buff
*skb
, int proto
)
3700 /* Perform checksum validate (init). Note that this is a macro since we only
3701 * want to calculate the pseudo header which is an input function if necessary.
3702 * First we try to validate without any computation (checksum unnecessary) and
3703 * then calculate based on checksum complete calling the function to compute
3707 * 0: checksum is validated or try to in skb_checksum_complete
3708 * non-zero: value of invalid checksum
3710 #define __skb_checksum_validate(skb, proto, complete, \
3711 zero_okay, check, compute_pseudo) \
3713 __sum16 __ret = 0; \
3714 skb->csum_valid = 0; \
3715 if (__skb_checksum_validate_needed(skb, zero_okay, check)) \
3716 __ret = __skb_checksum_validate_complete(skb, \
3717 complete, compute_pseudo(skb, proto)); \
3721 #define skb_checksum_init(skb, proto, compute_pseudo) \
3722 __skb_checksum_validate(skb, proto, false, false, 0, compute_pseudo)
3724 #define skb_checksum_init_zero_check(skb, proto, check, compute_pseudo) \
3725 __skb_checksum_validate(skb, proto, false, true, check, compute_pseudo)
3727 #define skb_checksum_validate(skb, proto, compute_pseudo) \
3728 __skb_checksum_validate(skb, proto, true, false, 0, compute_pseudo)
3730 #define skb_checksum_validate_zero_check(skb, proto, check, \
3732 __skb_checksum_validate(skb, proto, true, true, check, compute_pseudo)
3734 #define skb_checksum_simple_validate(skb) \
3735 __skb_checksum_validate(skb, 0, true, false, 0, null_compute_pseudo)
3737 static inline bool __skb_checksum_convert_check(struct sk_buff
*skb
)
3739 return (skb
->ip_summed
== CHECKSUM_NONE
&& skb
->csum_valid
);
3742 static inline void __skb_checksum_convert(struct sk_buff
*skb
,
3743 __sum16 check
, __wsum pseudo
)
3745 skb
->csum
= ~pseudo
;
3746 skb
->ip_summed
= CHECKSUM_COMPLETE
;
3749 #define skb_checksum_try_convert(skb, proto, check, compute_pseudo) \
3751 if (__skb_checksum_convert_check(skb)) \
3752 __skb_checksum_convert(skb, check, \
3753 compute_pseudo(skb, proto)); \
3756 static inline void skb_remcsum_adjust_partial(struct sk_buff
*skb
, void *ptr
,
3757 u16 start
, u16 offset
)
3759 skb
->ip_summed
= CHECKSUM_PARTIAL
;
3760 skb
->csum_start
= ((unsigned char *)ptr
+ start
) - skb
->head
;
3761 skb
->csum_offset
= offset
- start
;
3764 /* Update skbuf and packet to reflect the remote checksum offload operation.
3765 * When called, ptr indicates the starting point for skb->csum when
3766 * ip_summed is CHECKSUM_COMPLETE. If we need create checksum complete
3767 * here, skb_postpull_rcsum is done so skb->csum start is ptr.
3769 static inline void skb_remcsum_process(struct sk_buff
*skb
, void *ptr
,
3770 int start
, int offset
, bool nopartial
)
3775 skb_remcsum_adjust_partial(skb
, ptr
, start
, offset
);
3779 if (unlikely(skb
->ip_summed
!= CHECKSUM_COMPLETE
)) {
3780 __skb_checksum_complete(skb
);
3781 skb_postpull_rcsum(skb
, skb
->data
, ptr
- (void *)skb
->data
);
3784 delta
= remcsum_adjust(ptr
, skb
->csum
, start
, offset
);
3786 /* Adjust skb->csum since we changed the packet */
3787 skb
->csum
= csum_add(skb
->csum
, delta
);
3790 static inline struct nf_conntrack
*skb_nfct(const struct sk_buff
*skb
)
3792 #if IS_ENABLED(CONFIG_NF_CONNTRACK)
3793 return (void *)(skb
->_nfct
& SKB_NFCT_PTRMASK
);
3799 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
3800 void nf_conntrack_destroy(struct nf_conntrack
*nfct
);
3801 static inline void nf_conntrack_put(struct nf_conntrack
*nfct
)
3803 if (nfct
&& atomic_dec_and_test(&nfct
->use
))
3804 nf_conntrack_destroy(nfct
);
3806 static inline void nf_conntrack_get(struct nf_conntrack
*nfct
)
3809 atomic_inc(&nfct
->use
);
3812 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
3813 static inline void nf_bridge_put(struct nf_bridge_info
*nf_bridge
)
3815 if (nf_bridge
&& refcount_dec_and_test(&nf_bridge
->use
))
3818 static inline void nf_bridge_get(struct nf_bridge_info
*nf_bridge
)
3821 refcount_inc(&nf_bridge
->use
);
3823 #endif /* CONFIG_BRIDGE_NETFILTER */
3824 static inline void nf_reset(struct sk_buff
*skb
)
3826 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
3827 nf_conntrack_put(skb_nfct(skb
));
3830 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
3831 nf_bridge_put(skb
->nf_bridge
);
3832 skb
->nf_bridge
= NULL
;
3836 static inline void nf_reset_trace(struct sk_buff
*skb
)
3838 #if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE) || defined(CONFIG_NF_TABLES)
3843 static inline void ipvs_reset(struct sk_buff
*skb
)
3845 #if IS_ENABLED(CONFIG_IP_VS)
3846 skb
->ipvs_property
= 0;
3850 /* Note: This doesn't put any conntrack and bridge info in dst. */
3851 static inline void __nf_copy(struct sk_buff
*dst
, const struct sk_buff
*src
,
3854 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
3855 dst
->_nfct
= src
->_nfct
;
3856 nf_conntrack_get(skb_nfct(src
));
3858 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
3859 dst
->nf_bridge
= src
->nf_bridge
;
3860 nf_bridge_get(src
->nf_bridge
);
3862 #if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE) || defined(CONFIG_NF_TABLES)
3864 dst
->nf_trace
= src
->nf_trace
;
3868 static inline void nf_copy(struct sk_buff
*dst
, const struct sk_buff
*src
)
3870 #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
3871 nf_conntrack_put(skb_nfct(dst
));
3873 #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER)
3874 nf_bridge_put(dst
->nf_bridge
);
3876 __nf_copy(dst
, src
, true);
3879 #ifdef CONFIG_NETWORK_SECMARK
3880 static inline void skb_copy_secmark(struct sk_buff
*to
, const struct sk_buff
*from
)
3882 to
->secmark
= from
->secmark
;
3885 static inline void skb_init_secmark(struct sk_buff
*skb
)
3890 static inline void skb_copy_secmark(struct sk_buff
*to
, const struct sk_buff
*from
)
3893 static inline void skb_init_secmark(struct sk_buff
*skb
)
3897 static inline bool skb_irq_freeable(const struct sk_buff
*skb
)
3899 return !skb
->destructor
&&
3900 #if IS_ENABLED(CONFIG_XFRM)
3904 !skb
->_skb_refdst
&&
3905 !skb_has_frag_list(skb
);
3908 static inline void skb_set_queue_mapping(struct sk_buff
*skb
, u16 queue_mapping
)
3910 skb
->queue_mapping
= queue_mapping
;
3913 static inline u16
skb_get_queue_mapping(const struct sk_buff
*skb
)
3915 return skb
->queue_mapping
;
3918 static inline void skb_copy_queue_mapping(struct sk_buff
*to
, const struct sk_buff
*from
)
3920 to
->queue_mapping
= from
->queue_mapping
;
3923 static inline void skb_record_rx_queue(struct sk_buff
*skb
, u16 rx_queue
)
3925 skb
->queue_mapping
= rx_queue
+ 1;
3928 static inline u16
skb_get_rx_queue(const struct sk_buff
*skb
)
3930 return skb
->queue_mapping
- 1;
3933 static inline bool skb_rx_queue_recorded(const struct sk_buff
*skb
)
3935 return skb
->queue_mapping
!= 0;
3938 static inline void skb_set_dst_pending_confirm(struct sk_buff
*skb
, u32 val
)
3940 skb
->dst_pending_confirm
= val
;
3943 static inline bool skb_get_dst_pending_confirm(const struct sk_buff
*skb
)
3945 return skb
->dst_pending_confirm
!= 0;
3948 static inline struct sec_path
*skb_sec_path(struct sk_buff
*skb
)
3957 /* Keeps track of mac header offset relative to skb->head.
3958 * It is useful for TSO of Tunneling protocol. e.g. GRE.
3959 * For non-tunnel skb it points to skb_mac_header() and for
3960 * tunnel skb it points to outer mac header.
3961 * Keeps track of level of encapsulation of network headers.
3972 #define SKB_SGO_CB_OFFSET 32
3973 #define SKB_GSO_CB(skb) ((struct skb_gso_cb *)((skb)->cb + SKB_SGO_CB_OFFSET))
3975 static inline int skb_tnl_header_len(const struct sk_buff
*inner_skb
)
3977 return (skb_mac_header(inner_skb
) - inner_skb
->head
) -
3978 SKB_GSO_CB(inner_skb
)->mac_offset
;
3981 static inline int gso_pskb_expand_head(struct sk_buff
*skb
, int extra
)
3983 int new_headroom
, headroom
;
3986 headroom
= skb_headroom(skb
);
3987 ret
= pskb_expand_head(skb
, extra
, 0, GFP_ATOMIC
);
3991 new_headroom
= skb_headroom(skb
);
3992 SKB_GSO_CB(skb
)->mac_offset
+= (new_headroom
- headroom
);
3996 static inline void gso_reset_checksum(struct sk_buff
*skb
, __wsum res
)
3998 /* Do not update partial checksums if remote checksum is enabled. */
3999 if (skb
->remcsum_offload
)
4002 SKB_GSO_CB(skb
)->csum
= res
;
4003 SKB_GSO_CB(skb
)->csum_start
= skb_checksum_start(skb
) - skb
->head
;
4006 /* Compute the checksum for a gso segment. First compute the checksum value
4007 * from the start of transport header to SKB_GSO_CB(skb)->csum_start, and
4008 * then add in skb->csum (checksum from csum_start to end of packet).
4009 * skb->csum and csum_start are then updated to reflect the checksum of the
4010 * resultant packet starting from the transport header-- the resultant checksum
4011 * is in the res argument (i.e. normally zero or ~ of checksum of a pseudo
4014 static inline __sum16
gso_make_checksum(struct sk_buff
*skb
, __wsum res
)
4016 unsigned char *csum_start
= skb_transport_header(skb
);
4017 int plen
= (skb
->head
+ SKB_GSO_CB(skb
)->csum_start
) - csum_start
;
4018 __wsum partial
= SKB_GSO_CB(skb
)->csum
;
4020 SKB_GSO_CB(skb
)->csum
= res
;
4021 SKB_GSO_CB(skb
)->csum_start
= csum_start
- skb
->head
;
4023 return csum_fold(csum_partial(csum_start
, plen
, partial
));
4026 static inline bool skb_is_gso(const struct sk_buff
*skb
)
4028 return skb_shinfo(skb
)->gso_size
;
4031 /* Note: Should be called only if skb_is_gso(skb) is true */
4032 static inline bool skb_is_gso_v6(const struct sk_buff
*skb
)
4034 return skb_shinfo(skb
)->gso_type
& SKB_GSO_TCPV6
;
4037 static inline void skb_gso_reset(struct sk_buff
*skb
)
4039 skb_shinfo(skb
)->gso_size
= 0;
4040 skb_shinfo(skb
)->gso_segs
= 0;
4041 skb_shinfo(skb
)->gso_type
= 0;
4044 void __skb_warn_lro_forwarding(const struct sk_buff
*skb
);
4046 static inline bool skb_warn_if_lro(const struct sk_buff
*skb
)
4048 /* LRO sets gso_size but not gso_type, whereas if GSO is really
4049 * wanted then gso_type will be set. */
4050 const struct skb_shared_info
*shinfo
= skb_shinfo(skb
);
4052 if (skb_is_nonlinear(skb
) && shinfo
->gso_size
!= 0 &&
4053 unlikely(shinfo
->gso_type
== 0)) {
4054 __skb_warn_lro_forwarding(skb
);
4060 static inline void skb_forward_csum(struct sk_buff
*skb
)
4062 /* Unfortunately we don't support this one. Any brave souls? */
4063 if (skb
->ip_summed
== CHECKSUM_COMPLETE
)
4064 skb
->ip_summed
= CHECKSUM_NONE
;
4068 * skb_checksum_none_assert - make sure skb ip_summed is CHECKSUM_NONE
4069 * @skb: skb to check
4071 * fresh skbs have their ip_summed set to CHECKSUM_NONE.
4072 * Instead of forcing ip_summed to CHECKSUM_NONE, we can
4073 * use this helper, to document places where we make this assertion.
4075 static inline void skb_checksum_none_assert(const struct sk_buff
*skb
)
4078 BUG_ON(skb
->ip_summed
!= CHECKSUM_NONE
);
4082 bool skb_partial_csum_set(struct sk_buff
*skb
, u16 start
, u16 off
);
4084 int skb_checksum_setup(struct sk_buff
*skb
, bool recalculate
);
4085 struct sk_buff
*skb_checksum_trimmed(struct sk_buff
*skb
,
4086 unsigned int transport_len
,
4087 __sum16(*skb_chkf
)(struct sk_buff
*skb
));
4090 * skb_head_is_locked - Determine if the skb->head is locked down
4091 * @skb: skb to check
4093 * The head on skbs build around a head frag can be removed if they are
4094 * not cloned. This function returns true if the skb head is locked down
4095 * due to either being allocated via kmalloc, or by being a clone with
4096 * multiple references to the head.
4098 static inline bool skb_head_is_locked(const struct sk_buff
*skb
)
4100 return !skb
->head_frag
|| skb_cloned(skb
);
4104 * skb_gso_network_seglen - Return length of individual segments of a gso packet
4108 * skb_gso_network_seglen is used to determine the real size of the
4109 * individual segments, including Layer3 (IP, IPv6) and L4 headers (TCP/UDP).
4111 * The MAC/L2 header is not accounted for.
4113 static inline unsigned int skb_gso_network_seglen(const struct sk_buff
*skb
)
4115 unsigned int hdr_len
= skb_transport_header(skb
) -
4116 skb_network_header(skb
);
4117 return hdr_len
+ skb_gso_transport_seglen(skb
);
4121 * skb_gso_mac_seglen - Return length of individual segments of a gso packet
4125 * skb_gso_mac_seglen is used to determine the real size of the
4126 * individual segments, including MAC/L2, Layer3 (IP, IPv6) and L4
4127 * headers (TCP/UDP).
4129 static inline unsigned int skb_gso_mac_seglen(const struct sk_buff
*skb
)
4131 unsigned int hdr_len
= skb_transport_header(skb
) - skb_mac_header(skb
);
4132 return hdr_len
+ skb_gso_transport_seglen(skb
);
4135 /* Local Checksum Offload.
4136 * Compute outer checksum based on the assumption that the
4137 * inner checksum will be offloaded later.
4138 * See Documentation/networking/checksum-offloads.txt for
4139 * explanation of how this works.
4140 * Fill in outer checksum adjustment (e.g. with sum of outer
4141 * pseudo-header) before calling.
4142 * Also ensure that inner checksum is in linear data area.
4144 static inline __wsum
lco_csum(struct sk_buff
*skb
)
4146 unsigned char *csum_start
= skb_checksum_start(skb
);
4147 unsigned char *l4_hdr
= skb_transport_header(skb
);
4150 /* Start with complement of inner checksum adjustment */
4151 partial
= ~csum_unfold(*(__force __sum16
*)(csum_start
+
4154 /* Add in checksum of our headers (incl. outer checksum
4155 * adjustment filled in by caller) and return result.
4157 return csum_partial(l4_hdr
, csum_start
- l4_hdr
, partial
);
4160 #endif /* __KERNEL__ */
4161 #endif /* _LINUX_SKBUFF_H */