Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Definitions for the 'struct sk_buff' memory handlers. | |
3 | * | |
4 | * Authors: | |
5 | * Alan Cox, <gw4pts@gw4pts.ampr.org> | |
6 | * Florian La Roche, <rzsfl@rz.uni-sb.de> | |
7 | * | |
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. | |
12 | */ | |
13 | ||
14 | #ifndef _LINUX_SKBUFF_H | |
15 | #define _LINUX_SKBUFF_H | |
16 | ||
1da177e4 | 17 | #include <linux/kernel.h> |
fe55f6d5 | 18 | #include <linux/kmemcheck.h> |
1da177e4 LT |
19 | #include <linux/compiler.h> |
20 | #include <linux/time.h> | |
187f1882 | 21 | #include <linux/bug.h> |
1da177e4 | 22 | #include <linux/cache.h> |
56b17425 | 23 | #include <linux/rbtree.h> |
51f3d02b | 24 | #include <linux/socket.h> |
c1d1b437 | 25 | #include <linux/refcount.h> |
1da177e4 | 26 | |
60063497 | 27 | #include <linux/atomic.h> |
1da177e4 LT |
28 | #include <asm/types.h> |
29 | #include <linux/spinlock.h> | |
1da177e4 | 30 | #include <linux/net.h> |
3fc7e8a6 | 31 | #include <linux/textsearch.h> |
1da177e4 | 32 | #include <net/checksum.h> |
a80958f4 | 33 | #include <linux/rcupdate.h> |
b7aa0bf7 | 34 | #include <linux/hrtimer.h> |
131ea667 | 35 | #include <linux/dma-mapping.h> |
c8f44aff | 36 | #include <linux/netdev_features.h> |
363ec392 | 37 | #include <linux/sched.h> |
e6017571 | 38 | #include <linux/sched/clock.h> |
1bd758eb | 39 | #include <net/flow_dissector.h> |
a60e3cc7 | 40 | #include <linux/splice.h> |
72b31f72 | 41 | #include <linux/in6.h> |
8b10cab6 | 42 | #include <linux/if_packet.h> |
f70ea018 | 43 | #include <net/flow.h> |
1da177e4 | 44 | |
7a6ae71b TH |
45 | /* The interface for checksum offload between the stack and networking drivers |
46 | * is as follows... | |
47 | * | |
48 | * A. IP checksum related features | |
49 | * | |
50 | * Drivers advertise checksum offload capabilities in the features of a device. | |
51 | * From the stack's point of view these are capabilities offered by the driver, | |
52 | * a driver typically only advertises features that it is capable of offloading | |
53 | * to its device. | |
54 | * | |
55 | * The checksum related features are: | |
56 | * | |
57 | * NETIF_F_HW_CSUM - The driver (or its device) is able to compute one | |
58 | * IP (one's complement) checksum for any combination | |
59 | * of protocols or protocol layering. The checksum is | |
60 | * computed and set in a packet per the CHECKSUM_PARTIAL | |
61 | * interface (see below). | |
62 | * | |
63 | * NETIF_F_IP_CSUM - Driver (device) is only able to checksum plain | |
64 | * TCP or UDP packets over IPv4. These are specifically | |
65 | * unencapsulated packets of the form IPv4|TCP or | |
66 | * IPv4|UDP where the Protocol field in the IPv4 header | |
67 | * is TCP or UDP. The IPv4 header may contain IP options | |
68 | * This feature cannot be set in features for a device | |
69 | * with NETIF_F_HW_CSUM also set. This feature is being | |
70 | * DEPRECATED (see below). | |
71 | * | |
72 | * NETIF_F_IPV6_CSUM - Driver (device) is only able to checksum plain | |
73 | * TCP or UDP packets over IPv6. These are specifically | |
74 | * unencapsulated packets of the form IPv6|TCP or | |
75 | * IPv4|UDP where the Next Header field in the IPv6 | |
76 | * header is either TCP or UDP. IPv6 extension headers | |
77 | * are not supported with this feature. This feature | |
78 | * cannot be set in features for a device with | |
79 | * NETIF_F_HW_CSUM also set. This feature is being | |
80 | * DEPRECATED (see below). | |
81 | * | |
82 | * NETIF_F_RXCSUM - Driver (device) performs receive checksum offload. | |
83 | * This flag is used only used to disable the RX checksum | |
84 | * feature for a device. The stack will accept receive | |
85 | * checksum indication in packets received on a device | |
86 | * regardless of whether NETIF_F_RXCSUM is set. | |
87 | * | |
88 | * B. Checksumming of received packets by device. Indication of checksum | |
89 | * verification is in set skb->ip_summed. Possible values are: | |
78ea85f1 DB |
90 | * |
91 | * CHECKSUM_NONE: | |
92 | * | |
7a6ae71b | 93 | * Device did not checksum this packet e.g. due to lack of capabilities. |
78ea85f1 DB |
94 | * The packet contains full (though not verified) checksum in packet but |
95 | * not in skb->csum. Thus, skb->csum is undefined in this case. | |
96 | * | |
97 | * CHECKSUM_UNNECESSARY: | |
98 | * | |
99 | * The hardware you're dealing with doesn't calculate the full checksum | |
100 | * (as in CHECKSUM_COMPLETE), but it does parse headers and verify checksums | |
77cffe23 TH |
101 | * for specific protocols. For such packets it will set CHECKSUM_UNNECESSARY |
102 | * if their checksums are okay. skb->csum is still undefined in this case | |
7a6ae71b TH |
103 | * though. A driver or device must never modify the checksum field in the |
104 | * packet even if checksum is verified. | |
77cffe23 TH |
105 | * |
106 | * CHECKSUM_UNNECESSARY is applicable to following protocols: | |
107 | * TCP: IPv6 and IPv4. | |
108 | * UDP: IPv4 and IPv6. A device may apply CHECKSUM_UNNECESSARY to a | |
109 | * zero UDP checksum for either IPv4 or IPv6, the networking stack | |
110 | * may perform further validation in this case. | |
111 | * GRE: only if the checksum is present in the header. | |
112 | * SCTP: indicates the CRC in SCTP header has been validated. | |
b4759dcd | 113 | * FCOE: indicates the CRC in FC frame has been validated. |
77cffe23 TH |
114 | * |
115 | * skb->csum_level indicates the number of consecutive checksums found in | |
116 | * the packet minus one that have been verified as CHECKSUM_UNNECESSARY. | |
117 | * For instance if a device receives an IPv6->UDP->GRE->IPv4->TCP packet | |
118 | * and a device is able to verify the checksums for UDP (possibly zero), | |
119 | * GRE (checksum flag is set), and TCP-- skb->csum_level would be set to | |
120 | * two. If the device were only able to verify the UDP checksum and not | |
121 | * GRE, either because it doesn't support GRE checksum of because GRE | |
122 | * checksum is bad, skb->csum_level would be set to zero (TCP checksum is | |
123 | * not considered in this case). | |
78ea85f1 DB |
124 | * |
125 | * CHECKSUM_COMPLETE: | |
126 | * | |
127 | * This is the most generic way. The device supplied checksum of the _whole_ | |
128 | * packet as seen by netif_rx() and fills out in skb->csum. Meaning, the | |
129 | * hardware doesn't need to parse L3/L4 headers to implement this. | |
130 | * | |
b4759dcd DC |
131 | * Notes: |
132 | * - Even if device supports only some protocols, but is able to produce | |
133 | * skb->csum, it MUST use CHECKSUM_COMPLETE, not CHECKSUM_UNNECESSARY. | |
134 | * - CHECKSUM_COMPLETE is not applicable to SCTP and FCoE protocols. | |
78ea85f1 DB |
135 | * |
136 | * CHECKSUM_PARTIAL: | |
137 | * | |
6edec0e6 TH |
138 | * A checksum is set up to be offloaded to a device as described in the |
139 | * output description for CHECKSUM_PARTIAL. This may occur on a packet | |
78ea85f1 | 140 | * received directly from another Linux OS, e.g., a virtualized Linux kernel |
6edec0e6 TH |
141 | * on the same host, or it may be set in the input path in GRO or remote |
142 | * checksum offload. For the purposes of checksum verification, the checksum | |
143 | * referred to by skb->csum_start + skb->csum_offset and any preceding | |
144 | * checksums in the packet are considered verified. Any checksums in the | |
145 | * packet that are after the checksum being offloaded are not considered to | |
146 | * be verified. | |
78ea85f1 | 147 | * |
7a6ae71b TH |
148 | * C. Checksumming on transmit for non-GSO. The stack requests checksum offload |
149 | * in the skb->ip_summed for a packet. Values are: | |
78ea85f1 DB |
150 | * |
151 | * CHECKSUM_PARTIAL: | |
152 | * | |
7a6ae71b | 153 | * The driver is required to checksum the packet as seen by hard_start_xmit() |
78ea85f1 | 154 | * from skb->csum_start up to the end, and to record/write the checksum at |
7a6ae71b TH |
155 | * offset skb->csum_start + skb->csum_offset. A driver may verify that the |
156 | * csum_start and csum_offset values are valid values given the length and | |
157 | * offset of the packet, however they should not attempt to validate that the | |
158 | * checksum refers to a legitimate transport layer checksum-- it is the | |
159 | * purview of the stack to validate that csum_start and csum_offset are set | |
160 | * correctly. | |
161 | * | |
162 | * When the stack requests checksum offload for a packet, the driver MUST | |
163 | * ensure that the checksum is set correctly. A driver can either offload the | |
164 | * checksum calculation to the device, or call skb_checksum_help (in the case | |
165 | * that the device does not support offload for a particular checksum). | |
166 | * | |
167 | * NETIF_F_IP_CSUM and NETIF_F_IPV6_CSUM are being deprecated in favor of | |
168 | * NETIF_F_HW_CSUM. New devices should use NETIF_F_HW_CSUM to indicate | |
43c26a1a DC |
169 | * checksum offload capability. |
170 | * skb_csum_hwoffload_help() can be called to resolve CHECKSUM_PARTIAL based | |
171 | * on network device checksumming capabilities: if a packet does not match | |
172 | * them, skb_checksum_help or skb_crc32c_help (depending on the value of | |
173 | * csum_not_inet, see item D.) is called to resolve the checksum. | |
78ea85f1 | 174 | * |
7a6ae71b | 175 | * CHECKSUM_NONE: |
78ea85f1 | 176 | * |
7a6ae71b TH |
177 | * The skb was already checksummed by the protocol, or a checksum is not |
178 | * required. | |
78ea85f1 DB |
179 | * |
180 | * CHECKSUM_UNNECESSARY: | |
181 | * | |
7a6ae71b TH |
182 | * This has the same meaning on as CHECKSUM_NONE for checksum offload on |
183 | * output. | |
78ea85f1 | 184 | * |
7a6ae71b TH |
185 | * CHECKSUM_COMPLETE: |
186 | * Not used in checksum output. If a driver observes a packet with this value | |
187 | * set in skbuff, if should treat as CHECKSUM_NONE being set. | |
188 | * | |
189 | * D. Non-IP checksum (CRC) offloads | |
190 | * | |
191 | * NETIF_F_SCTP_CRC - This feature indicates that a device is capable of | |
192 | * offloading the SCTP CRC in a packet. To perform this offload the stack | |
dba00306 DC |
193 | * will set set csum_start and csum_offset accordingly, set ip_summed to |
194 | * CHECKSUM_PARTIAL and set csum_not_inet to 1, to provide an indication in | |
195 | * the skbuff that the CHECKSUM_PARTIAL refers to CRC32c. | |
196 | * A driver that supports both IP checksum offload and SCTP CRC32c offload | |
197 | * must verify which offload is configured for a packet by testing the | |
198 | * value of skb->csum_not_inet; skb_crc32c_csum_help is provided to resolve | |
199 | * CHECKSUM_PARTIAL on skbs where csum_not_inet is set to 1. | |
7a6ae71b TH |
200 | * |
201 | * NETIF_F_FCOE_CRC - This feature indicates that a device is capable of | |
202 | * offloading the FCOE CRC in a packet. To perform this offload the stack | |
203 | * will set ip_summed to CHECKSUM_PARTIAL and set csum_start and csum_offset | |
204 | * accordingly. Note the there is no indication in the skbuff that the | |
205 | * CHECKSUM_PARTIAL refers to an FCOE checksum, a driver that supports | |
206 | * both IP checksum offload and FCOE CRC offload must verify which offload | |
207 | * is configured for a packet presumably by inspecting packet headers. | |
208 | * | |
209 | * E. Checksumming on output with GSO. | |
210 | * | |
211 | * In the case of a GSO packet (skb_is_gso(skb) is true), checksum offload | |
212 | * is implied by the SKB_GSO_* flags in gso_type. Most obviously, if the | |
213 | * gso_type is SKB_GSO_TCPV4 or SKB_GSO_TCPV6, TCP checksum offload as | |
214 | * part of the GSO operation is implied. If a checksum is being offloaded | |
215 | * with GSO then ip_summed is CHECKSUM_PARTIAL, csum_start and csum_offset | |
216 | * are set to refer to the outermost checksum being offload (two offloaded | |
217 | * checksums are possible with UDP encapsulation). | |
78ea85f1 DB |
218 | */ |
219 | ||
60476372 | 220 | /* Don't change this without changing skb_csum_unnecessary! */ |
78ea85f1 DB |
221 | #define CHECKSUM_NONE 0 |
222 | #define CHECKSUM_UNNECESSARY 1 | |
223 | #define CHECKSUM_COMPLETE 2 | |
224 | #define CHECKSUM_PARTIAL 3 | |
1da177e4 | 225 | |
77cffe23 TH |
226 | /* Maximum value in skb->csum_level */ |
227 | #define SKB_MAX_CSUM_LEVEL 3 | |
228 | ||
0bec8c88 | 229 | #define SKB_DATA_ALIGN(X) ALIGN(X, SMP_CACHE_BYTES) |
fc910a27 | 230 | #define SKB_WITH_OVERHEAD(X) \ |
deea84b0 | 231 | ((X) - SKB_DATA_ALIGN(sizeof(struct skb_shared_info))) |
fc910a27 DM |
232 | #define SKB_MAX_ORDER(X, ORDER) \ |
233 | SKB_WITH_OVERHEAD((PAGE_SIZE << (ORDER)) - (X)) | |
1da177e4 LT |
234 | #define SKB_MAX_HEAD(X) (SKB_MAX_ORDER((X), 0)) |
235 | #define SKB_MAX_ALLOC (SKB_MAX_ORDER(0, 2)) | |
236 | ||
87fb4b7b ED |
237 | /* return minimum truesize of one skb containing X bytes of data */ |
238 | #define SKB_TRUESIZE(X) ((X) + \ | |
239 | SKB_DATA_ALIGN(sizeof(struct sk_buff)) + \ | |
240 | SKB_DATA_ALIGN(sizeof(struct skb_shared_info))) | |
241 | ||
1da177e4 | 242 | struct net_device; |
716ea3a7 | 243 | struct scatterlist; |
9c55e01c | 244 | struct pipe_inode_info; |
a8f820aa | 245 | struct iov_iter; |
fd11a83d | 246 | struct napi_struct; |
1da177e4 | 247 | |
5f79e0f9 | 248 | #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE) |
1da177e4 LT |
249 | struct nf_conntrack { |
250 | atomic_t use; | |
1da177e4 | 251 | }; |
5f79e0f9 | 252 | #endif |
1da177e4 | 253 | |
34666d46 | 254 | #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER) |
1da177e4 | 255 | struct nf_bridge_info { |
53869ceb | 256 | refcount_t use; |
3eaf4025 FW |
257 | enum { |
258 | BRNF_PROTO_UNCHANGED, | |
259 | BRNF_PROTO_8021Q, | |
260 | BRNF_PROTO_PPPOE | |
7fb48c5b | 261 | } orig_proto:8; |
72b1e5e4 FW |
262 | u8 pkt_otherhost:1; |
263 | u8 in_prerouting:1; | |
264 | u8 bridged_dnat:1; | |
411ffb4f | 265 | __u16 frag_max_size; |
bf1ac5ca | 266 | struct net_device *physindev; |
63cdbc06 FW |
267 | |
268 | /* always valid & non-NULL from FORWARD on, for physdev match */ | |
269 | struct net_device *physoutdev; | |
7fb48c5b | 270 | union { |
72b1e5e4 | 271 | /* prerouting: detect dnat in orig/reply direction */ |
72b31f72 BT |
272 | __be32 ipv4_daddr; |
273 | struct in6_addr ipv6_daddr; | |
72b1e5e4 FW |
274 | |
275 | /* after prerouting + nat detected: store original source | |
276 | * mac since neigh resolution overwrites it, only used while | |
277 | * skb is out in neigh layer. | |
278 | */ | |
279 | char neigh_header[8]; | |
72b31f72 | 280 | }; |
1da177e4 LT |
281 | }; |
282 | #endif | |
283 | ||
1da177e4 LT |
284 | struct sk_buff_head { |
285 | /* These two members must be first. */ | |
286 | struct sk_buff *next; | |
287 | struct sk_buff *prev; | |
288 | ||
289 | __u32 qlen; | |
290 | spinlock_t lock; | |
291 | }; | |
292 | ||
293 | struct sk_buff; | |
294 | ||
9d4dde52 IC |
295 | /* To allow 64K frame to be packed as single skb without frag_list we |
296 | * require 64K/PAGE_SIZE pages plus 1 additional page to allow for | |
297 | * buffers which do not start on a page boundary. | |
298 | * | |
299 | * Since GRO uses frags we allocate at least 16 regardless of page | |
300 | * size. | |
a715dea3 | 301 | */ |
9d4dde52 | 302 | #if (65536/PAGE_SIZE + 1) < 16 |
eec00954 | 303 | #define MAX_SKB_FRAGS 16UL |
a715dea3 | 304 | #else |
9d4dde52 | 305 | #define MAX_SKB_FRAGS (65536/PAGE_SIZE + 1) |
a715dea3 | 306 | #endif |
5f74f82e | 307 | extern int sysctl_max_skb_frags; |
1da177e4 | 308 | |
3953c46c MRL |
309 | /* Set skb_shinfo(skb)->gso_size to this in case you want skb_segment to |
310 | * segment using its current segmentation instead. | |
311 | */ | |
312 | #define GSO_BY_FRAGS 0xFFFF | |
313 | ||
1da177e4 LT |
314 | typedef struct skb_frag_struct skb_frag_t; |
315 | ||
316 | struct skb_frag_struct { | |
a8605c60 IC |
317 | struct { |
318 | struct page *p; | |
319 | } page; | |
cb4dfe56 | 320 | #if (BITS_PER_LONG > 32) || (PAGE_SIZE >= 65536) |
a309bb07 DM |
321 | __u32 page_offset; |
322 | __u32 size; | |
cb4dfe56 ED |
323 | #else |
324 | __u16 page_offset; | |
325 | __u16 size; | |
326 | #endif | |
1da177e4 LT |
327 | }; |
328 | ||
9e903e08 ED |
329 | static inline unsigned int skb_frag_size(const skb_frag_t *frag) |
330 | { | |
331 | return frag->size; | |
332 | } | |
333 | ||
334 | static inline void skb_frag_size_set(skb_frag_t *frag, unsigned int size) | |
335 | { | |
336 | frag->size = size; | |
337 | } | |
338 | ||
339 | static inline void skb_frag_size_add(skb_frag_t *frag, int delta) | |
340 | { | |
341 | frag->size += delta; | |
342 | } | |
343 | ||
344 | static inline void skb_frag_size_sub(skb_frag_t *frag, int delta) | |
345 | { | |
346 | frag->size -= delta; | |
347 | } | |
348 | ||
c613c209 WB |
349 | static inline bool skb_frag_must_loop(struct page *p) |
350 | { | |
351 | #if defined(CONFIG_HIGHMEM) | |
352 | if (PageHighMem(p)) | |
353 | return true; | |
354 | #endif | |
355 | return false; | |
356 | } | |
357 | ||
358 | /** | |
359 | * skb_frag_foreach_page - loop over pages in a fragment | |
360 | * | |
361 | * @f: skb frag to operate on | |
362 | * @f_off: offset from start of f->page.p | |
363 | * @f_len: length from f_off to loop over | |
364 | * @p: (temp var) current page | |
365 | * @p_off: (temp var) offset from start of current page, | |
366 | * non-zero only on first page. | |
367 | * @p_len: (temp var) length in current page, | |
368 | * < PAGE_SIZE only on first and last page. | |
369 | * @copied: (temp var) length so far, excluding current p_len. | |
370 | * | |
371 | * A fragment can hold a compound page, in which case per-page | |
372 | * operations, notably kmap_atomic, must be called for each | |
373 | * regular page. | |
374 | */ | |
375 | #define skb_frag_foreach_page(f, f_off, f_len, p, p_off, p_len, copied) \ | |
376 | for (p = skb_frag_page(f) + ((f_off) >> PAGE_SHIFT), \ | |
377 | p_off = (f_off) & (PAGE_SIZE - 1), \ | |
378 | p_len = skb_frag_must_loop(p) ? \ | |
379 | min_t(u32, f_len, PAGE_SIZE - p_off) : f_len, \ | |
380 | copied = 0; \ | |
381 | copied < f_len; \ | |
382 | copied += p_len, p++, p_off = 0, \ | |
383 | p_len = min_t(u32, f_len - copied, PAGE_SIZE)) \ | |
384 | ||
ac45f602 PO |
385 | #define HAVE_HW_TIME_STAMP |
386 | ||
387 | /** | |
d3a21be8 | 388 | * struct skb_shared_hwtstamps - hardware time stamps |
ac45f602 PO |
389 | * @hwtstamp: hardware time stamp transformed into duration |
390 | * since arbitrary point in time | |
ac45f602 PO |
391 | * |
392 | * Software time stamps generated by ktime_get_real() are stored in | |
4d276eb6 | 393 | * skb->tstamp. |
ac45f602 PO |
394 | * |
395 | * hwtstamps can only be compared against other hwtstamps from | |
396 | * the same device. | |
397 | * | |
398 | * This structure is attached to packets as part of the | |
399 | * &skb_shared_info. Use skb_hwtstamps() to get a pointer. | |
400 | */ | |
401 | struct skb_shared_hwtstamps { | |
402 | ktime_t hwtstamp; | |
ac45f602 PO |
403 | }; |
404 | ||
2244d07b OH |
405 | /* Definitions for tx_flags in struct skb_shared_info */ |
406 | enum { | |
407 | /* generate hardware time stamp */ | |
408 | SKBTX_HW_TSTAMP = 1 << 0, | |
409 | ||
e7fd2885 | 410 | /* generate software time stamp when queueing packet to NIC */ |
2244d07b OH |
411 | SKBTX_SW_TSTAMP = 1 << 1, |
412 | ||
413 | /* device driver is going to provide hardware time stamp */ | |
414 | SKBTX_IN_PROGRESS = 1 << 2, | |
415 | ||
a6686f2f | 416 | /* device driver supports TX zero-copy buffers */ |
62b1a8ab | 417 | SKBTX_DEV_ZEROCOPY = 1 << 3, |
6e3e939f JB |
418 | |
419 | /* generate wifi status information (where possible) */ | |
62b1a8ab | 420 | SKBTX_WIFI_STATUS = 1 << 4, |
c9af6db4 PS |
421 | |
422 | /* This indicates at least one fragment might be overwritten | |
423 | * (as in vmsplice(), sendfile() ...) | |
424 | * If we need to compute a TX checksum, we'll need to copy | |
425 | * all frags to avoid possible bad checksum | |
426 | */ | |
427 | SKBTX_SHARED_FRAG = 1 << 5, | |
e7fd2885 WB |
428 | |
429 | /* generate software time stamp when entering packet scheduling */ | |
430 | SKBTX_SCHED_TSTAMP = 1 << 6, | |
a6686f2f SM |
431 | }; |
432 | ||
52267790 | 433 | #define SKBTX_ZEROCOPY_FRAG (SKBTX_DEV_ZEROCOPY | SKBTX_SHARED_FRAG) |
e1c8a607 | 434 | #define SKBTX_ANY_SW_TSTAMP (SKBTX_SW_TSTAMP | \ |
0a2cf20c | 435 | SKBTX_SCHED_TSTAMP) |
f24b9be5 WB |
436 | #define SKBTX_ANY_TSTAMP (SKBTX_HW_TSTAMP | SKBTX_ANY_SW_TSTAMP) |
437 | ||
a6686f2f SM |
438 | /* |
439 | * The callback notifies userspace to release buffers when skb DMA is done in | |
440 | * lower device, the skb last reference should be 0 when calling this. | |
e19d6763 MT |
441 | * The zerocopy_success argument is true if zero copy transmit occurred, |
442 | * false on data copy or out of memory error caused by data copy attempt. | |
ca8f4fb2 MT |
443 | * The ctx field is used to track device context. |
444 | * The desc field is used to track userspace buffer index. | |
a6686f2f SM |
445 | */ |
446 | struct ubuf_info { | |
e19d6763 | 447 | void (*callback)(struct ubuf_info *, bool zerocopy_success); |
4ab6c99d WB |
448 | union { |
449 | struct { | |
450 | unsigned long desc; | |
451 | void *ctx; | |
452 | }; | |
453 | struct { | |
454 | u32 id; | |
455 | u16 len; | |
456 | u16 zerocopy:1; | |
457 | u32 bytelen; | |
458 | }; | |
459 | }; | |
c1d1b437 | 460 | refcount_t refcnt; |
a91dbff5 WB |
461 | |
462 | struct mmpin { | |
463 | struct user_struct *user; | |
464 | unsigned int num_pg; | |
465 | } mmp; | |
ac45f602 PO |
466 | }; |
467 | ||
52267790 WB |
468 | #define skb_uarg(SKB) ((struct ubuf_info *)(skb_shinfo(SKB)->destructor_arg)) |
469 | ||
470 | struct ubuf_info *sock_zerocopy_alloc(struct sock *sk, size_t size); | |
4ab6c99d WB |
471 | struct ubuf_info *sock_zerocopy_realloc(struct sock *sk, size_t size, |
472 | struct ubuf_info *uarg); | |
52267790 WB |
473 | |
474 | static inline void sock_zerocopy_get(struct ubuf_info *uarg) | |
475 | { | |
c1d1b437 | 476 | refcount_inc(&uarg->refcnt); |
52267790 WB |
477 | } |
478 | ||
479 | void sock_zerocopy_put(struct ubuf_info *uarg); | |
480 | void sock_zerocopy_put_abort(struct ubuf_info *uarg); | |
481 | ||
482 | void sock_zerocopy_callback(struct ubuf_info *uarg, bool success); | |
483 | ||
484 | int skb_zerocopy_iter_stream(struct sock *sk, struct sk_buff *skb, | |
485 | struct msghdr *msg, int len, | |
486 | struct ubuf_info *uarg); | |
487 | ||
1da177e4 LT |
488 | /* This data is invariant across clones and lives at |
489 | * the end of the header data, ie. at skb->end. | |
490 | */ | |
491 | struct skb_shared_info { | |
de8f3a83 DB |
492 | __u8 __unused; |
493 | __u8 meta_len; | |
494 | __u8 nr_frags; | |
9f42f126 | 495 | __u8 tx_flags; |
7967168c HX |
496 | unsigned short gso_size; |
497 | /* Warning: this field is not always filled in (UFO)! */ | |
498 | unsigned short gso_segs; | |
1da177e4 | 499 | struct sk_buff *frag_list; |
ac45f602 | 500 | struct skb_shared_hwtstamps hwtstamps; |
7f564528 | 501 | unsigned int gso_type; |
09c2d251 | 502 | u32 tskey; |
9f42f126 | 503 | __be32 ip6_frag_id; |
ec7d2f2c ED |
504 | |
505 | /* | |
506 | * Warning : all fields before dataref are cleared in __alloc_skb() | |
507 | */ | |
508 | atomic_t dataref; | |
509 | ||
69e3c75f JB |
510 | /* Intermediate layers must ensure that destructor_arg |
511 | * remains valid until skb destructor */ | |
512 | void * destructor_arg; | |
a6686f2f | 513 | |
fed66381 ED |
514 | /* must be last field, see pskb_expand_head() */ |
515 | skb_frag_t frags[MAX_SKB_FRAGS]; | |
1da177e4 LT |
516 | }; |
517 | ||
518 | /* We divide dataref into two halves. The higher 16 bits hold references | |
519 | * to the payload part of skb->data. The lower 16 bits hold references to | |
334a8132 PM |
520 | * the entire skb->data. A clone of a headerless skb holds the length of |
521 | * the header in skb->hdr_len. | |
1da177e4 LT |
522 | * |
523 | * All users must obey the rule that the skb->data reference count must be | |
524 | * greater than or equal to the payload reference count. | |
525 | * | |
526 | * Holding a reference to the payload part means that the user does not | |
527 | * care about modifications to the header part of skb->data. | |
528 | */ | |
529 | #define SKB_DATAREF_SHIFT 16 | |
530 | #define SKB_DATAREF_MASK ((1 << SKB_DATAREF_SHIFT) - 1) | |
531 | ||
d179cd12 DM |
532 | |
533 | enum { | |
c8753d55 VS |
534 | SKB_FCLONE_UNAVAILABLE, /* skb has no fclone (from head_cache) */ |
535 | SKB_FCLONE_ORIG, /* orig skb (from fclone_cache) */ | |
536 | SKB_FCLONE_CLONE, /* companion fclone skb (from fclone_cache) */ | |
d179cd12 DM |
537 | }; |
538 | ||
7967168c HX |
539 | enum { |
540 | SKB_GSO_TCPV4 = 1 << 0, | |
576a30eb HX |
541 | |
542 | /* This indicates the skb is from an untrusted source. */ | |
d9d30adf | 543 | SKB_GSO_DODGY = 1 << 1, |
b0da8537 MC |
544 | |
545 | /* This indicates the tcp segment has CWR set. */ | |
d9d30adf | 546 | SKB_GSO_TCP_ECN = 1 << 2, |
f83ef8c0 | 547 | |
d9d30adf | 548 | SKB_GSO_TCP_FIXEDID = 1 << 3, |
01d5b2fc | 549 | |
d9d30adf | 550 | SKB_GSO_TCPV6 = 1 << 4, |
68c33163 | 551 | |
d9d30adf | 552 | SKB_GSO_FCOE = 1 << 5, |
73136267 | 553 | |
d9d30adf | 554 | SKB_GSO_GRE = 1 << 6, |
0d89d203 | 555 | |
d9d30adf | 556 | SKB_GSO_GRE_CSUM = 1 << 7, |
cb32f511 | 557 | |
d9d30adf | 558 | SKB_GSO_IPXIP4 = 1 << 8, |
61c1db7f | 559 | |
d9d30adf | 560 | SKB_GSO_IPXIP6 = 1 << 9, |
0f4f4ffa | 561 | |
d9d30adf | 562 | SKB_GSO_UDP_TUNNEL = 1 << 10, |
4749c09c | 563 | |
d9d30adf | 564 | SKB_GSO_UDP_TUNNEL_CSUM = 1 << 11, |
cbc53e08 | 565 | |
d9d30adf | 566 | SKB_GSO_PARTIAL = 1 << 12, |
802ab55a | 567 | |
d9d30adf | 568 | SKB_GSO_TUNNEL_REMCSUM = 1 << 13, |
90017acc | 569 | |
d9d30adf | 570 | SKB_GSO_SCTP = 1 << 14, |
c7ef8f0c | 571 | |
d9d30adf | 572 | SKB_GSO_ESP = 1 << 15, |
7967168c HX |
573 | }; |
574 | ||
2e07fa9c ACM |
575 | #if BITS_PER_LONG > 32 |
576 | #define NET_SKBUFF_DATA_USES_OFFSET 1 | |
577 | #endif | |
578 | ||
579 | #ifdef NET_SKBUFF_DATA_USES_OFFSET | |
580 | typedef unsigned int sk_buff_data_t; | |
581 | #else | |
582 | typedef unsigned char *sk_buff_data_t; | |
583 | #endif | |
584 | ||
1da177e4 LT |
585 | /** |
586 | * struct sk_buff - socket buffer | |
587 | * @next: Next buffer in list | |
588 | * @prev: Previous buffer in list | |
363ec392 | 589 | * @tstamp: Time we arrived/left |
56b17425 | 590 | * @rbnode: RB tree node, alternative to next/prev for netem/tcp |
d84e0bd7 | 591 | * @sk: Socket we are owned by |
1da177e4 | 592 | * @dev: Device we arrived on/are leaving by |
d84e0bd7 | 593 | * @cb: Control buffer. Free for use by every layer. Put private vars here |
7fee226a | 594 | * @_skb_refdst: destination entry (with norefcount bit) |
67be2dd1 | 595 | * @sp: the security path, used for xfrm |
1da177e4 LT |
596 | * @len: Length of actual data |
597 | * @data_len: Data length | |
598 | * @mac_len: Length of link layer header | |
334a8132 | 599 | * @hdr_len: writable header length of cloned skb |
663ead3b HX |
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 | |
d84e0bd7 | 603 | * @priority: Packet queueing priority |
60ff7467 | 604 | * @ignore_df: allow local fragmentation |
1da177e4 | 605 | * @cloned: Head may be cloned (check refcnt to be sure) |
d84e0bd7 | 606 | * @ip_summed: Driver fed us an IP checksum |
1da177e4 LT |
607 | * @nohdr: Payload reference only, must not modify header |
608 | * @pkt_type: Packet class | |
c83c2486 | 609 | * @fclone: skbuff clone status |
c83c2486 | 610 | * @ipvs_property: skbuff is owned by ipvs |
e7246e12 | 611 | * @tc_skip_classify: do not classify packet. set by IFB device |
8dc07fdb | 612 | * @tc_at_ingress: used within tc_classify to distinguish in/egress |
bc31c905 WB |
613 | * @tc_redirected: packet was redirected by a tc action |
614 | * @tc_from_ingress: if tc_redirected, tc_at_ingress at time of redirect | |
31729363 RD |
615 | * @peeked: this packet has been seen already, so stats have been |
616 | * done for it, don't do them again | |
ba9dda3a | 617 | * @nf_trace: netfilter packet trace flag |
d84e0bd7 DB |
618 | * @protocol: Packet protocol from driver |
619 | * @destructor: Destruct function | |
a9e419dc | 620 | * @_nfct: Associated connection, if any (with nfctinfo bits) |
1da177e4 | 621 | * @nf_bridge: Saved data about a bridged frame - see br_netfilter.c |
8964be4a | 622 | * @skb_iif: ifindex of device we arrived on |
1da177e4 | 623 | * @tc_index: Traffic control index |
61b905da | 624 | * @hash: the packet hash |
d84e0bd7 | 625 | * @queue_mapping: Queue mapping for multiqueue devices |
0b725a2c | 626 | * @xmit_more: More SKBs are pending for this queue |
553a5672 | 627 | * @ndisc_nodetype: router type (from link layer) |
d84e0bd7 | 628 | * @ooo_okay: allow the mapping of a socket to a queue to be changed |
61b905da | 629 | * @l4_hash: indicate hash is a canonical 4-tuple hash over transport |
4ca2462e | 630 | * ports. |
a3b18ddb | 631 | * @sw_hash: indicates hash was computed in software stack |
6e3e939f JB |
632 | * @wifi_acked_valid: wifi_acked was set |
633 | * @wifi_acked: whether frame was acked on wifi or not | |
3bdc0eba | 634 | * @no_fcs: Request NIC to treat last 4 bytes as Ethernet FCS |
dba00306 | 635 | * @csum_not_inet: use CRC32c to resolve CHECKSUM_PARTIAL |
4ff06203 | 636 | * @dst_pending_confirm: need to confirm neighbour |
06021292 | 637 | * @napi_id: id of the NAPI struct this skb came from |
984bc16c | 638 | * @secmark: security marking |
d84e0bd7 | 639 | * @mark: Generic packet mark |
86a9bad3 | 640 | * @vlan_proto: vlan encapsulation protocol |
6aa895b0 | 641 | * @vlan_tci: vlan tag control information |
0d89d203 | 642 | * @inner_protocol: Protocol (encapsulation) |
6a674e9c JG |
643 | * @inner_transport_header: Inner transport layer header (encapsulation) |
644 | * @inner_network_header: Network layer header (encapsulation) | |
aefbd2b3 | 645 | * @inner_mac_header: Link layer header (encapsulation) |
d84e0bd7 DB |
646 | * @transport_header: Transport layer header |
647 | * @network_header: Network layer header | |
648 | * @mac_header: Link layer header | |
649 | * @tail: Tail pointer | |
650 | * @end: End pointer | |
651 | * @head: Head of buffer | |
652 | * @data: Data head pointer | |
653 | * @truesize: Buffer size | |
654 | * @users: User count - see {datagram,tcp}.c | |
1da177e4 LT |
655 | */ |
656 | ||
657 | struct sk_buff { | |
363ec392 | 658 | union { |
56b17425 ED |
659 | struct { |
660 | /* These two members must be first. */ | |
661 | struct sk_buff *next; | |
662 | struct sk_buff *prev; | |
663 | ||
664 | union { | |
bffa72cf ED |
665 | struct net_device *dev; |
666 | /* Some protocols might use this space to store information, | |
667 | * while device pointer would be NULL. | |
668 | * UDP receive path is one user. | |
669 | */ | |
670 | unsigned long dev_scratch; | |
56b17425 ED |
671 | }; |
672 | }; | |
673 | struct rb_node rbnode; /* used in netem & tcp stack */ | |
363ec392 | 674 | }; |
da3f5cf1 | 675 | struct sock *sk; |
1da177e4 | 676 | |
c84d9490 | 677 | union { |
bffa72cf ED |
678 | ktime_t tstamp; |
679 | u64 skb_mstamp; | |
c84d9490 | 680 | }; |
1da177e4 LT |
681 | /* |
682 | * This is the control buffer. It is free to use for every | |
683 | * layer. Please put your private variables there. If you | |
684 | * want to keep them across layers you have to do a skb_clone() | |
685 | * first. This is owned by whoever has the skb queued ATM. | |
686 | */ | |
da3f5cf1 | 687 | char cb[48] __aligned(8); |
1da177e4 | 688 | |
7fee226a | 689 | unsigned long _skb_refdst; |
b1937227 | 690 | void (*destructor)(struct sk_buff *skb); |
da3f5cf1 FF |
691 | #ifdef CONFIG_XFRM |
692 | struct sec_path *sp; | |
b1937227 ED |
693 | #endif |
694 | #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE) | |
a9e419dc | 695 | unsigned long _nfct; |
b1937227 | 696 | #endif |
85224844 | 697 | #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER) |
b1937227 | 698 | struct nf_bridge_info *nf_bridge; |
da3f5cf1 | 699 | #endif |
1da177e4 | 700 | unsigned int len, |
334a8132 PM |
701 | data_len; |
702 | __u16 mac_len, | |
703 | hdr_len; | |
b1937227 ED |
704 | |
705 | /* Following fields are _not_ copied in __copy_skb_header() | |
706 | * Note that queue_mapping is here mostly to fill a hole. | |
707 | */ | |
fe55f6d5 | 708 | kmemcheck_bitfield_begin(flags1); |
b1937227 | 709 | __u16 queue_mapping; |
36bbef52 DB |
710 | |
711 | /* if you move cloned around you also must adapt those constants */ | |
712 | #ifdef __BIG_ENDIAN_BITFIELD | |
713 | #define CLONED_MASK (1 << 7) | |
714 | #else | |
715 | #define CLONED_MASK 1 | |
716 | #endif | |
717 | #define CLONED_OFFSET() offsetof(struct sk_buff, __cloned_offset) | |
718 | ||
719 | __u8 __cloned_offset[0]; | |
b1937227 | 720 | __u8 cloned:1, |
6869c4d8 | 721 | nohdr:1, |
b84f4cc9 | 722 | fclone:2, |
a59322be | 723 | peeked:1, |
b1937227 | 724 | head_frag:1, |
36bbef52 DB |
725 | xmit_more:1, |
726 | __unused:1; /* one bit hole */ | |
fe55f6d5 | 727 | kmemcheck_bitfield_end(flags1); |
4031ae6e | 728 | |
b1937227 ED |
729 | /* fields enclosed in headers_start/headers_end are copied |
730 | * using a single memcpy() in __copy_skb_header() | |
731 | */ | |
ebcf34f3 | 732 | /* private: */ |
b1937227 | 733 | __u32 headers_start[0]; |
ebcf34f3 | 734 | /* public: */ |
4031ae6e | 735 | |
233577a2 HFS |
736 | /* if you move pkt_type around you also must adapt those constants */ |
737 | #ifdef __BIG_ENDIAN_BITFIELD | |
738 | #define PKT_TYPE_MAX (7 << 5) | |
739 | #else | |
740 | #define PKT_TYPE_MAX 7 | |
1da177e4 | 741 | #endif |
233577a2 | 742 | #define PKT_TYPE_OFFSET() offsetof(struct sk_buff, __pkt_type_offset) |
fe55f6d5 | 743 | |
233577a2 | 744 | __u8 __pkt_type_offset[0]; |
b1937227 | 745 | __u8 pkt_type:3; |
c93bdd0e | 746 | __u8 pfmemalloc:1; |
b1937227 | 747 | __u8 ignore_df:1; |
b1937227 ED |
748 | |
749 | __u8 nf_trace:1; | |
750 | __u8 ip_summed:2; | |
3853b584 | 751 | __u8 ooo_okay:1; |
61b905da | 752 | __u8 l4_hash:1; |
a3b18ddb | 753 | __u8 sw_hash:1; |
6e3e939f JB |
754 | __u8 wifi_acked_valid:1; |
755 | __u8 wifi_acked:1; | |
b1937227 | 756 | |
3bdc0eba | 757 | __u8 no_fcs:1; |
77cffe23 | 758 | /* Indicates the inner headers are valid in the skbuff. */ |
6a674e9c | 759 | __u8 encapsulation:1; |
7e2b10c1 | 760 | __u8 encap_hdr_csum:1; |
5d0c2b95 | 761 | __u8 csum_valid:1; |
7e3cead5 | 762 | __u8 csum_complete_sw:1; |
b1937227 | 763 | __u8 csum_level:2; |
dba00306 | 764 | __u8 csum_not_inet:1; |
fe55f6d5 | 765 | |
4ff06203 | 766 | __u8 dst_pending_confirm:1; |
b1937227 ED |
767 | #ifdef CONFIG_IPV6_NDISC_NODETYPE |
768 | __u8 ndisc_nodetype:2; | |
769 | #endif | |
770 | __u8 ipvs_property:1; | |
8bce6d7d | 771 | __u8 inner_protocol_type:1; |
e585f236 | 772 | __u8 remcsum_offload:1; |
6bc506b4 IS |
773 | #ifdef CONFIG_NET_SWITCHDEV |
774 | __u8 offload_fwd_mark:1; | |
abf4bb6b | 775 | __u8 offload_mr_fwd_mark:1; |
6bc506b4 | 776 | #endif |
e7246e12 WB |
777 | #ifdef CONFIG_NET_CLS_ACT |
778 | __u8 tc_skip_classify:1; | |
8dc07fdb | 779 | __u8 tc_at_ingress:1; |
bc31c905 WB |
780 | __u8 tc_redirected:1; |
781 | __u8 tc_from_ingress:1; | |
e7246e12 | 782 | #endif |
b1937227 ED |
783 | |
784 | #ifdef CONFIG_NET_SCHED | |
785 | __u16 tc_index; /* traffic control index */ | |
b1937227 | 786 | #endif |
fe55f6d5 | 787 | |
b1937227 ED |
788 | union { |
789 | __wsum csum; | |
790 | struct { | |
791 | __u16 csum_start; | |
792 | __u16 csum_offset; | |
793 | }; | |
794 | }; | |
795 | __u32 priority; | |
796 | int skb_iif; | |
797 | __u32 hash; | |
798 | __be16 vlan_proto; | |
799 | __u16 vlan_tci; | |
2bd82484 ED |
800 | #if defined(CONFIG_NET_RX_BUSY_POLL) || defined(CONFIG_XPS) |
801 | union { | |
802 | unsigned int napi_id; | |
803 | unsigned int sender_cpu; | |
804 | }; | |
97fc2f08 | 805 | #endif |
984bc16c | 806 | #ifdef CONFIG_NETWORK_SECMARK |
6bc506b4 | 807 | __u32 secmark; |
0c4f691f | 808 | #endif |
0c4f691f | 809 | |
3b885787 NH |
810 | union { |
811 | __u32 mark; | |
16fad69c | 812 | __u32 reserved_tailroom; |
3b885787 | 813 | }; |
1da177e4 | 814 | |
8bce6d7d TH |
815 | union { |
816 | __be16 inner_protocol; | |
817 | __u8 inner_ipproto; | |
818 | }; | |
819 | ||
1a37e412 SH |
820 | __u16 inner_transport_header; |
821 | __u16 inner_network_header; | |
822 | __u16 inner_mac_header; | |
b1937227 ED |
823 | |
824 | __be16 protocol; | |
1a37e412 SH |
825 | __u16 transport_header; |
826 | __u16 network_header; | |
827 | __u16 mac_header; | |
b1937227 | 828 | |
ebcf34f3 | 829 | /* private: */ |
b1937227 | 830 | __u32 headers_end[0]; |
ebcf34f3 | 831 | /* public: */ |
b1937227 | 832 | |
1da177e4 | 833 | /* These elements must be at the end, see alloc_skb() for details. */ |
27a884dc | 834 | sk_buff_data_t tail; |
4305b541 | 835 | sk_buff_data_t end; |
1da177e4 | 836 | unsigned char *head, |
4305b541 | 837 | *data; |
27a884dc | 838 | unsigned int truesize; |
63354797 | 839 | refcount_t users; |
1da177e4 LT |
840 | }; |
841 | ||
842 | #ifdef __KERNEL__ | |
843 | /* | |
844 | * Handling routines are only of interest to the kernel | |
845 | */ | |
846 | #include <linux/slab.h> | |
847 | ||
1da177e4 | 848 | |
c93bdd0e MG |
849 | #define SKB_ALLOC_FCLONE 0x01 |
850 | #define SKB_ALLOC_RX 0x02 | |
fd11a83d | 851 | #define SKB_ALLOC_NAPI 0x04 |
c93bdd0e MG |
852 | |
853 | /* Returns true if the skb was allocated from PFMEMALLOC reserves */ | |
854 | static inline bool skb_pfmemalloc(const struct sk_buff *skb) | |
855 | { | |
856 | return unlikely(skb->pfmemalloc); | |
857 | } | |
858 | ||
7fee226a ED |
859 | /* |
860 | * skb might have a dst pointer attached, refcounted or not. | |
861 | * _skb_refdst low order bit is set if refcount was _not_ taken | |
862 | */ | |
863 | #define SKB_DST_NOREF 1UL | |
864 | #define SKB_DST_PTRMASK ~(SKB_DST_NOREF) | |
865 | ||
a9e419dc | 866 | #define SKB_NFCT_PTRMASK ~(7UL) |
7fee226a ED |
867 | /** |
868 | * skb_dst - returns skb dst_entry | |
869 | * @skb: buffer | |
870 | * | |
871 | * Returns skb dst_entry, regardless of reference taken or not. | |
872 | */ | |
adf30907 ED |
873 | static inline struct dst_entry *skb_dst(const struct sk_buff *skb) |
874 | { | |
7fee226a ED |
875 | /* If refdst was not refcounted, check we still are in a |
876 | * rcu_read_lock section | |
877 | */ | |
878 | WARN_ON((skb->_skb_refdst & SKB_DST_NOREF) && | |
879 | !rcu_read_lock_held() && | |
880 | !rcu_read_lock_bh_held()); | |
881 | return (struct dst_entry *)(skb->_skb_refdst & SKB_DST_PTRMASK); | |
adf30907 ED |
882 | } |
883 | ||
7fee226a ED |
884 | /** |
885 | * skb_dst_set - sets skb dst | |
886 | * @skb: buffer | |
887 | * @dst: dst entry | |
888 | * | |
889 | * Sets skb dst, assuming a reference was taken on dst and should | |
890 | * be released by skb_dst_drop() | |
891 | */ | |
adf30907 ED |
892 | static inline void skb_dst_set(struct sk_buff *skb, struct dst_entry *dst) |
893 | { | |
7fee226a ED |
894 | skb->_skb_refdst = (unsigned long)dst; |
895 | } | |
896 | ||
932bc4d7 JA |
897 | /** |
898 | * skb_dst_set_noref - sets skb dst, hopefully, without taking reference | |
899 | * @skb: buffer | |
900 | * @dst: dst entry | |
901 | * | |
902 | * Sets skb dst, assuming a reference was not taken on dst. | |
903 | * If dst entry is cached, we do not take reference and dst_release | |
904 | * will be avoided by refdst_drop. If dst entry is not cached, we take | |
905 | * reference, so that last dst_release can destroy the dst immediately. | |
906 | */ | |
907 | static inline void skb_dst_set_noref(struct sk_buff *skb, struct dst_entry *dst) | |
908 | { | |
dbfc4fb7 HFS |
909 | WARN_ON(!rcu_read_lock_held() && !rcu_read_lock_bh_held()); |
910 | skb->_skb_refdst = (unsigned long)dst | SKB_DST_NOREF; | |
932bc4d7 | 911 | } |
7fee226a ED |
912 | |
913 | /** | |
25985edc | 914 | * skb_dst_is_noref - Test if skb dst isn't refcounted |
7fee226a ED |
915 | * @skb: buffer |
916 | */ | |
917 | static inline bool skb_dst_is_noref(const struct sk_buff *skb) | |
918 | { | |
919 | return (skb->_skb_refdst & SKB_DST_NOREF) && skb_dst(skb); | |
adf30907 ED |
920 | } |
921 | ||
511c3f92 ED |
922 | static inline struct rtable *skb_rtable(const struct sk_buff *skb) |
923 | { | |
adf30907 | 924 | return (struct rtable *)skb_dst(skb); |
511c3f92 ED |
925 | } |
926 | ||
8b10cab6 JHS |
927 | /* For mangling skb->pkt_type from user space side from applications |
928 | * such as nft, tc, etc, we only allow a conservative subset of | |
929 | * possible pkt_types to be set. | |
930 | */ | |
931 | static inline bool skb_pkt_type_ok(u32 ptype) | |
932 | { | |
933 | return ptype <= PACKET_OTHERHOST; | |
934 | } | |
935 | ||
90b602f8 ML |
936 | static inline unsigned int skb_napi_id(const struct sk_buff *skb) |
937 | { | |
938 | #ifdef CONFIG_NET_RX_BUSY_POLL | |
939 | return skb->napi_id; | |
940 | #else | |
941 | return 0; | |
942 | #endif | |
943 | } | |
944 | ||
3889a803 PA |
945 | /* decrement the reference count and return true if we can free the skb */ |
946 | static inline bool skb_unref(struct sk_buff *skb) | |
947 | { | |
948 | if (unlikely(!skb)) | |
949 | return false; | |
63354797 | 950 | if (likely(refcount_read(&skb->users) == 1)) |
3889a803 | 951 | smp_rmb(); |
63354797 | 952 | else if (likely(!refcount_dec_and_test(&skb->users))) |
3889a803 PA |
953 | return false; |
954 | ||
955 | return true; | |
956 | } | |
957 | ||
0a463c78 | 958 | void skb_release_head_state(struct sk_buff *skb); |
7965bd4d JP |
959 | void kfree_skb(struct sk_buff *skb); |
960 | void kfree_skb_list(struct sk_buff *segs); | |
961 | void skb_tx_error(struct sk_buff *skb); | |
962 | void consume_skb(struct sk_buff *skb); | |
ca2c1418 | 963 | void __consume_stateless_skb(struct sk_buff *skb); |
7965bd4d | 964 | void __kfree_skb(struct sk_buff *skb); |
d7e8883c | 965 | extern struct kmem_cache *skbuff_head_cache; |
bad43ca8 | 966 | |
7965bd4d JP |
967 | void kfree_skb_partial(struct sk_buff *skb, bool head_stolen); |
968 | bool skb_try_coalesce(struct sk_buff *to, struct sk_buff *from, | |
969 | bool *fragstolen, int *delta_truesize); | |
bad43ca8 | 970 | |
7965bd4d JP |
971 | struct sk_buff *__alloc_skb(unsigned int size, gfp_t priority, int flags, |
972 | int node); | |
2ea2f62c | 973 | struct sk_buff *__build_skb(void *data, unsigned int frag_size); |
7965bd4d | 974 | struct sk_buff *build_skb(void *data, unsigned int frag_size); |
d179cd12 | 975 | static inline struct sk_buff *alloc_skb(unsigned int size, |
dd0fc66f | 976 | gfp_t priority) |
d179cd12 | 977 | { |
564824b0 | 978 | return __alloc_skb(size, priority, 0, NUMA_NO_NODE); |
d179cd12 DM |
979 | } |
980 | ||
2e4e4410 ED |
981 | struct sk_buff *alloc_skb_with_frags(unsigned long header_len, |
982 | unsigned long data_len, | |
983 | int max_page_order, | |
984 | int *errcode, | |
985 | gfp_t gfp_mask); | |
986 | ||
d0bf4a9e ED |
987 | /* Layout of fast clones : [skb1][skb2][fclone_ref] */ |
988 | struct sk_buff_fclones { | |
989 | struct sk_buff skb1; | |
990 | ||
991 | struct sk_buff skb2; | |
992 | ||
2638595a | 993 | refcount_t fclone_ref; |
d0bf4a9e ED |
994 | }; |
995 | ||
996 | /** | |
997 | * skb_fclone_busy - check if fclone is busy | |
293de7de | 998 | * @sk: socket |
d0bf4a9e ED |
999 | * @skb: buffer |
1000 | * | |
bda13fed | 1001 | * Returns true if skb is a fast clone, and its clone is not freed. |
39bb5e62 ED |
1002 | * Some drivers call skb_orphan() in their ndo_start_xmit(), |
1003 | * so we also check that this didnt happen. | |
d0bf4a9e | 1004 | */ |
39bb5e62 ED |
1005 | static inline bool skb_fclone_busy(const struct sock *sk, |
1006 | const struct sk_buff *skb) | |
d0bf4a9e ED |
1007 | { |
1008 | const struct sk_buff_fclones *fclones; | |
1009 | ||
1010 | fclones = container_of(skb, struct sk_buff_fclones, skb1); | |
1011 | ||
1012 | return skb->fclone == SKB_FCLONE_ORIG && | |
2638595a | 1013 | refcount_read(&fclones->fclone_ref) > 1 && |
39bb5e62 | 1014 | fclones->skb2.sk == sk; |
d0bf4a9e ED |
1015 | } |
1016 | ||
d179cd12 | 1017 | static inline struct sk_buff *alloc_skb_fclone(unsigned int size, |
dd0fc66f | 1018 | gfp_t priority) |
d179cd12 | 1019 | { |
c93bdd0e | 1020 | return __alloc_skb(size, priority, SKB_ALLOC_FCLONE, NUMA_NO_NODE); |
d179cd12 DM |
1021 | } |
1022 | ||
7965bd4d JP |
1023 | struct sk_buff *skb_morph(struct sk_buff *dst, struct sk_buff *src); |
1024 | int skb_copy_ubufs(struct sk_buff *skb, gfp_t gfp_mask); | |
1025 | struct sk_buff *skb_clone(struct sk_buff *skb, gfp_t priority); | |
1026 | struct sk_buff *skb_copy(const struct sk_buff *skb, gfp_t priority); | |
bad93e9d OP |
1027 | struct sk_buff *__pskb_copy_fclone(struct sk_buff *skb, int headroom, |
1028 | gfp_t gfp_mask, bool fclone); | |
1029 | static inline struct sk_buff *__pskb_copy(struct sk_buff *skb, int headroom, | |
1030 | gfp_t gfp_mask) | |
1031 | { | |
1032 | return __pskb_copy_fclone(skb, headroom, gfp_mask, false); | |
1033 | } | |
7965bd4d JP |
1034 | |
1035 | int pskb_expand_head(struct sk_buff *skb, int nhead, int ntail, gfp_t gfp_mask); | |
1036 | struct sk_buff *skb_realloc_headroom(struct sk_buff *skb, | |
1037 | unsigned int headroom); | |
1038 | struct sk_buff *skb_copy_expand(const struct sk_buff *skb, int newheadroom, | |
1039 | int newtailroom, gfp_t priority); | |
48a1df65 JD |
1040 | int __must_check skb_to_sgvec_nomark(struct sk_buff *skb, struct scatterlist *sg, |
1041 | int offset, int len); | |
1042 | int __must_check skb_to_sgvec(struct sk_buff *skb, struct scatterlist *sg, | |
1043 | int offset, int len); | |
7965bd4d | 1044 | int skb_cow_data(struct sk_buff *skb, int tailbits, struct sk_buff **trailer); |
cd0a137a FF |
1045 | int __skb_pad(struct sk_buff *skb, int pad, bool free_on_error); |
1046 | ||
1047 | /** | |
1048 | * skb_pad - zero pad the tail of an skb | |
1049 | * @skb: buffer to pad | |
1050 | * @pad: space to pad | |
1051 | * | |
1052 | * Ensure that a buffer is followed by a padding area that is zero | |
1053 | * filled. Used by network drivers which may DMA or transfer data | |
1054 | * beyond the buffer end onto the wire. | |
1055 | * | |
1056 | * May return error in out of memory cases. The skb is freed on error. | |
1057 | */ | |
1058 | static inline int skb_pad(struct sk_buff *skb, int pad) | |
1059 | { | |
1060 | return __skb_pad(skb, pad, true); | |
1061 | } | |
ead2ceb0 | 1062 | #define dev_kfree_skb(a) consume_skb(a) |
1da177e4 | 1063 | |
7965bd4d JP |
1064 | int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb, |
1065 | int getfrag(void *from, char *to, int offset, | |
1066 | int len, int odd, struct sk_buff *skb), | |
1067 | void *from, int length); | |
e89e9cf5 | 1068 | |
be12a1fe HFS |
1069 | int skb_append_pagefrags(struct sk_buff *skb, struct page *page, |
1070 | int offset, size_t size); | |
1071 | ||
d94d9fee | 1072 | struct skb_seq_state { |
677e90ed TG |
1073 | __u32 lower_offset; |
1074 | __u32 upper_offset; | |
1075 | __u32 frag_idx; | |
1076 | __u32 stepped_offset; | |
1077 | struct sk_buff *root_skb; | |
1078 | struct sk_buff *cur_skb; | |
1079 | __u8 *frag_data; | |
1080 | }; | |
1081 | ||
7965bd4d JP |
1082 | void skb_prepare_seq_read(struct sk_buff *skb, unsigned int from, |
1083 | unsigned int to, struct skb_seq_state *st); | |
1084 | unsigned int skb_seq_read(unsigned int consumed, const u8 **data, | |
1085 | struct skb_seq_state *st); | |
1086 | void skb_abort_seq_read(struct skb_seq_state *st); | |
677e90ed | 1087 | |
7965bd4d | 1088 | unsigned int skb_find_text(struct sk_buff *skb, unsigned int from, |
059a2440 | 1089 | unsigned int to, struct ts_config *config); |
3fc7e8a6 | 1090 | |
09323cc4 TH |
1091 | /* |
1092 | * Packet hash types specify the type of hash in skb_set_hash. | |
1093 | * | |
1094 | * Hash types refer to the protocol layer addresses which are used to | |
1095 | * construct a packet's hash. The hashes are used to differentiate or identify | |
1096 | * flows of the protocol layer for the hash type. Hash types are either | |
1097 | * layer-2 (L2), layer-3 (L3), or layer-4 (L4). | |
1098 | * | |
1099 | * Properties of hashes: | |
1100 | * | |
1101 | * 1) Two packets in different flows have different hash values | |
1102 | * 2) Two packets in the same flow should have the same hash value | |
1103 | * | |
1104 | * A hash at a higher layer is considered to be more specific. A driver should | |
1105 | * set the most specific hash possible. | |
1106 | * | |
1107 | * A driver cannot indicate a more specific hash than the layer at which a hash | |
1108 | * was computed. For instance an L3 hash cannot be set as an L4 hash. | |
1109 | * | |
1110 | * A driver may indicate a hash level which is less specific than the | |
1111 | * actual layer the hash was computed on. For instance, a hash computed | |
1112 | * at L4 may be considered an L3 hash. This should only be done if the | |
1113 | * driver can't unambiguously determine that the HW computed the hash at | |
1114 | * the higher layer. Note that the "should" in the second property above | |
1115 | * permits this. | |
1116 | */ | |
1117 | enum pkt_hash_types { | |
1118 | PKT_HASH_TYPE_NONE, /* Undefined type */ | |
1119 | PKT_HASH_TYPE_L2, /* Input: src_MAC, dest_MAC */ | |
1120 | PKT_HASH_TYPE_L3, /* Input: src_IP, dst_IP */ | |
1121 | PKT_HASH_TYPE_L4, /* Input: src_IP, dst_IP, src_port, dst_port */ | |
1122 | }; | |
1123 | ||
bcc83839 | 1124 | static inline void skb_clear_hash(struct sk_buff *skb) |
09323cc4 | 1125 | { |
bcc83839 | 1126 | skb->hash = 0; |
a3b18ddb | 1127 | skb->sw_hash = 0; |
bcc83839 TH |
1128 | skb->l4_hash = 0; |
1129 | } | |
1130 | ||
1131 | static inline void skb_clear_hash_if_not_l4(struct sk_buff *skb) | |
1132 | { | |
1133 | if (!skb->l4_hash) | |
1134 | skb_clear_hash(skb); | |
1135 | } | |
1136 | ||
1137 | static inline void | |
1138 | __skb_set_hash(struct sk_buff *skb, __u32 hash, bool is_sw, bool is_l4) | |
1139 | { | |
1140 | skb->l4_hash = is_l4; | |
1141 | skb->sw_hash = is_sw; | |
61b905da | 1142 | skb->hash = hash; |
09323cc4 TH |
1143 | } |
1144 | ||
bcc83839 TH |
1145 | static inline void |
1146 | skb_set_hash(struct sk_buff *skb, __u32 hash, enum pkt_hash_types type) | |
1147 | { | |
1148 | /* Used by drivers to set hash from HW */ | |
1149 | __skb_set_hash(skb, hash, false, type == PKT_HASH_TYPE_L4); | |
1150 | } | |
1151 | ||
1152 | static inline void | |
1153 | __skb_set_sw_hash(struct sk_buff *skb, __u32 hash, bool is_l4) | |
1154 | { | |
1155 | __skb_set_hash(skb, hash, true, is_l4); | |
1156 | } | |
1157 | ||
e5276937 | 1158 | void __skb_get_hash(struct sk_buff *skb); |
b917783c | 1159 | u32 __skb_get_hash_symmetric(const struct sk_buff *skb); |
e5276937 TH |
1160 | u32 skb_get_poff(const struct sk_buff *skb); |
1161 | u32 __skb_get_poff(const struct sk_buff *skb, void *data, | |
1162 | const struct flow_keys *keys, int hlen); | |
1163 | __be32 __skb_flow_get_ports(const struct sk_buff *skb, int thoff, u8 ip_proto, | |
1164 | void *data, int hlen_proto); | |
1165 | ||
1166 | static inline __be32 skb_flow_get_ports(const struct sk_buff *skb, | |
1167 | int thoff, u8 ip_proto) | |
1168 | { | |
1169 | return __skb_flow_get_ports(skb, thoff, ip_proto, NULL, 0); | |
1170 | } | |
1171 | ||
1172 | void skb_flow_dissector_init(struct flow_dissector *flow_dissector, | |
1173 | const struct flow_dissector_key *key, | |
1174 | unsigned int key_count); | |
1175 | ||
1176 | bool __skb_flow_dissect(const struct sk_buff *skb, | |
1177 | struct flow_dissector *flow_dissector, | |
1178 | void *target_container, | |
cd79a238 TH |
1179 | void *data, __be16 proto, int nhoff, int hlen, |
1180 | unsigned int flags); | |
e5276937 TH |
1181 | |
1182 | static inline bool skb_flow_dissect(const struct sk_buff *skb, | |
1183 | struct flow_dissector *flow_dissector, | |
cd79a238 | 1184 | void *target_container, unsigned int flags) |
e5276937 TH |
1185 | { |
1186 | return __skb_flow_dissect(skb, flow_dissector, target_container, | |
cd79a238 | 1187 | NULL, 0, 0, 0, flags); |
e5276937 TH |
1188 | } |
1189 | ||
1190 | static inline bool skb_flow_dissect_flow_keys(const struct sk_buff *skb, | |
cd79a238 TH |
1191 | struct flow_keys *flow, |
1192 | unsigned int flags) | |
e5276937 TH |
1193 | { |
1194 | memset(flow, 0, sizeof(*flow)); | |
1195 | return __skb_flow_dissect(skb, &flow_keys_dissector, flow, | |
cd79a238 | 1196 | NULL, 0, 0, 0, flags); |
e5276937 TH |
1197 | } |
1198 | ||
1199 | static inline bool skb_flow_dissect_flow_keys_buf(struct flow_keys *flow, | |
1200 | void *data, __be16 proto, | |
cd79a238 TH |
1201 | int nhoff, int hlen, |
1202 | unsigned int flags) | |
e5276937 TH |
1203 | { |
1204 | memset(flow, 0, sizeof(*flow)); | |
1205 | return __skb_flow_dissect(NULL, &flow_keys_buf_dissector, flow, | |
cd79a238 | 1206 | data, proto, nhoff, hlen, flags); |
e5276937 TH |
1207 | } |
1208 | ||
3958afa1 | 1209 | static inline __u32 skb_get_hash(struct sk_buff *skb) |
bfb564e7 | 1210 | { |
a3b18ddb | 1211 | if (!skb->l4_hash && !skb->sw_hash) |
3958afa1 | 1212 | __skb_get_hash(skb); |
bfb564e7 | 1213 | |
61b905da | 1214 | return skb->hash; |
bfb564e7 KK |
1215 | } |
1216 | ||
20a17bf6 | 1217 | static inline __u32 skb_get_hash_flowi6(struct sk_buff *skb, const struct flowi6 *fl6) |
f70ea018 | 1218 | { |
c6cc1ca7 TH |
1219 | if (!skb->l4_hash && !skb->sw_hash) { |
1220 | struct flow_keys keys; | |
de4c1f8b | 1221 | __u32 hash = __get_hash_from_flowi6(fl6, &keys); |
c6cc1ca7 | 1222 | |
de4c1f8b | 1223 | __skb_set_sw_hash(skb, hash, flow_keys_have_l4(&keys)); |
c6cc1ca7 | 1224 | } |
f70ea018 TH |
1225 | |
1226 | return skb->hash; | |
1227 | } | |
1228 | ||
50fb7992 TH |
1229 | __u32 skb_get_hash_perturb(const struct sk_buff *skb, u32 perturb); |
1230 | ||
57bdf7f4 TH |
1231 | static inline __u32 skb_get_hash_raw(const struct sk_buff *skb) |
1232 | { | |
61b905da | 1233 | return skb->hash; |
57bdf7f4 TH |
1234 | } |
1235 | ||
3df7a74e TH |
1236 | static inline void skb_copy_hash(struct sk_buff *to, const struct sk_buff *from) |
1237 | { | |
61b905da | 1238 | to->hash = from->hash; |
a3b18ddb | 1239 | to->sw_hash = from->sw_hash; |
61b905da | 1240 | to->l4_hash = from->l4_hash; |
3df7a74e TH |
1241 | }; |
1242 | ||
4305b541 ACM |
1243 | #ifdef NET_SKBUFF_DATA_USES_OFFSET |
1244 | static inline unsigned char *skb_end_pointer(const struct sk_buff *skb) | |
1245 | { | |
1246 | return skb->head + skb->end; | |
1247 | } | |
ec47ea82 AD |
1248 | |
1249 | static inline unsigned int skb_end_offset(const struct sk_buff *skb) | |
1250 | { | |
1251 | return skb->end; | |
1252 | } | |
4305b541 ACM |
1253 | #else |
1254 | static inline unsigned char *skb_end_pointer(const struct sk_buff *skb) | |
1255 | { | |
1256 | return skb->end; | |
1257 | } | |
ec47ea82 AD |
1258 | |
1259 | static inline unsigned int skb_end_offset(const struct sk_buff *skb) | |
1260 | { | |
1261 | return skb->end - skb->head; | |
1262 | } | |
4305b541 ACM |
1263 | #endif |
1264 | ||
1da177e4 | 1265 | /* Internal */ |
4305b541 | 1266 | #define skb_shinfo(SKB) ((struct skb_shared_info *)(skb_end_pointer(SKB))) |
1da177e4 | 1267 | |
ac45f602 PO |
1268 | static inline struct skb_shared_hwtstamps *skb_hwtstamps(struct sk_buff *skb) |
1269 | { | |
1270 | return &skb_shinfo(skb)->hwtstamps; | |
1271 | } | |
1272 | ||
52267790 WB |
1273 | static inline struct ubuf_info *skb_zcopy(struct sk_buff *skb) |
1274 | { | |
1275 | bool is_zcopy = skb && skb_shinfo(skb)->tx_flags & SKBTX_DEV_ZEROCOPY; | |
1276 | ||
1277 | return is_zcopy ? skb_uarg(skb) : NULL; | |
1278 | } | |
1279 | ||
1280 | static inline void skb_zcopy_set(struct sk_buff *skb, struct ubuf_info *uarg) | |
1281 | { | |
1282 | if (skb && uarg && !skb_zcopy(skb)) { | |
1283 | sock_zerocopy_get(uarg); | |
1284 | skb_shinfo(skb)->destructor_arg = uarg; | |
1285 | skb_shinfo(skb)->tx_flags |= SKBTX_ZEROCOPY_FRAG; | |
1286 | } | |
1287 | } | |
1288 | ||
1289 | /* Release a reference on a zerocopy structure */ | |
1290 | static inline void skb_zcopy_clear(struct sk_buff *skb, bool zerocopy) | |
1291 | { | |
1292 | struct ubuf_info *uarg = skb_zcopy(skb); | |
1293 | ||
1294 | if (uarg) { | |
0a4a060b WB |
1295 | if (uarg->callback == sock_zerocopy_callback) { |
1296 | uarg->zerocopy = uarg->zerocopy && zerocopy; | |
1297 | sock_zerocopy_put(uarg); | |
1298 | } else { | |
1299 | uarg->callback(uarg, zerocopy); | |
1300 | } | |
1301 | ||
52267790 WB |
1302 | skb_shinfo(skb)->tx_flags &= ~SKBTX_ZEROCOPY_FRAG; |
1303 | } | |
1304 | } | |
1305 | ||
1306 | /* Abort a zerocopy operation and revert zckey on error in send syscall */ | |
1307 | static inline void skb_zcopy_abort(struct sk_buff *skb) | |
1308 | { | |
1309 | struct ubuf_info *uarg = skb_zcopy(skb); | |
1310 | ||
1311 | if (uarg) { | |
1312 | sock_zerocopy_put_abort(uarg); | |
1313 | skb_shinfo(skb)->tx_flags &= ~SKBTX_ZEROCOPY_FRAG; | |
1314 | } | |
1315 | } | |
1316 | ||
1da177e4 LT |
1317 | /** |
1318 | * skb_queue_empty - check if a queue is empty | |
1319 | * @list: queue head | |
1320 | * | |
1321 | * Returns true if the queue is empty, false otherwise. | |
1322 | */ | |
1323 | static inline int skb_queue_empty(const struct sk_buff_head *list) | |
1324 | { | |
fd44b93c | 1325 | return list->next == (const struct sk_buff *) list; |
1da177e4 LT |
1326 | } |
1327 | ||
fc7ebb21 DM |
1328 | /** |
1329 | * skb_queue_is_last - check if skb is the last entry in the queue | |
1330 | * @list: queue head | |
1331 | * @skb: buffer | |
1332 | * | |
1333 | * Returns true if @skb is the last buffer on the list. | |
1334 | */ | |
1335 | static inline bool skb_queue_is_last(const struct sk_buff_head *list, | |
1336 | const struct sk_buff *skb) | |
1337 | { | |
fd44b93c | 1338 | return skb->next == (const struct sk_buff *) list; |
fc7ebb21 DM |
1339 | } |
1340 | ||
832d11c5 IJ |
1341 | /** |
1342 | * skb_queue_is_first - check if skb is the first entry in the queue | |
1343 | * @list: queue head | |
1344 | * @skb: buffer | |
1345 | * | |
1346 | * Returns true if @skb is the first buffer on the list. | |
1347 | */ | |
1348 | static inline bool skb_queue_is_first(const struct sk_buff_head *list, | |
1349 | const struct sk_buff *skb) | |
1350 | { | |
fd44b93c | 1351 | return skb->prev == (const struct sk_buff *) list; |
832d11c5 IJ |
1352 | } |
1353 | ||
249c8b42 DM |
1354 | /** |
1355 | * skb_queue_next - return the next packet in the queue | |
1356 | * @list: queue head | |
1357 | * @skb: current buffer | |
1358 | * | |
1359 | * Return the next packet in @list after @skb. It is only valid to | |
1360 | * call this if skb_queue_is_last() evaluates to false. | |
1361 | */ | |
1362 | static inline struct sk_buff *skb_queue_next(const struct sk_buff_head *list, | |
1363 | const struct sk_buff *skb) | |
1364 | { | |
1365 | /* This BUG_ON may seem severe, but if we just return then we | |
1366 | * are going to dereference garbage. | |
1367 | */ | |
1368 | BUG_ON(skb_queue_is_last(list, skb)); | |
1369 | return skb->next; | |
1370 | } | |
1371 | ||
832d11c5 IJ |
1372 | /** |
1373 | * skb_queue_prev - return the prev packet in the queue | |
1374 | * @list: queue head | |
1375 | * @skb: current buffer | |
1376 | * | |
1377 | * Return the prev packet in @list before @skb. It is only valid to | |
1378 | * call this if skb_queue_is_first() evaluates to false. | |
1379 | */ | |
1380 | static inline struct sk_buff *skb_queue_prev(const struct sk_buff_head *list, | |
1381 | const struct sk_buff *skb) | |
1382 | { | |
1383 | /* This BUG_ON may seem severe, but if we just return then we | |
1384 | * are going to dereference garbage. | |
1385 | */ | |
1386 | BUG_ON(skb_queue_is_first(list, skb)); | |
1387 | return skb->prev; | |
1388 | } | |
1389 | ||
1da177e4 LT |
1390 | /** |
1391 | * skb_get - reference buffer | |
1392 | * @skb: buffer to reference | |
1393 | * | |
1394 | * Makes another reference to a socket buffer and returns a pointer | |
1395 | * to the buffer. | |
1396 | */ | |
1397 | static inline struct sk_buff *skb_get(struct sk_buff *skb) | |
1398 | { | |
63354797 | 1399 | refcount_inc(&skb->users); |
1da177e4 LT |
1400 | return skb; |
1401 | } | |
1402 | ||
1403 | /* | |
1404 | * If users == 1, we are the only owner and are can avoid redundant | |
1405 | * atomic change. | |
1406 | */ | |
1407 | ||
1da177e4 LT |
1408 | /** |
1409 | * skb_cloned - is the buffer a clone | |
1410 | * @skb: buffer to check | |
1411 | * | |
1412 | * Returns true if the buffer was generated with skb_clone() and is | |
1413 | * one of multiple shared copies of the buffer. Cloned buffers are | |
1414 | * shared data so must not be written to under normal circumstances. | |
1415 | */ | |
1416 | static inline int skb_cloned(const struct sk_buff *skb) | |
1417 | { | |
1418 | return skb->cloned && | |
1419 | (atomic_read(&skb_shinfo(skb)->dataref) & SKB_DATAREF_MASK) != 1; | |
1420 | } | |
1421 | ||
14bbd6a5 PS |
1422 | static inline int skb_unclone(struct sk_buff *skb, gfp_t pri) |
1423 | { | |
d0164adc | 1424 | might_sleep_if(gfpflags_allow_blocking(pri)); |
14bbd6a5 PS |
1425 | |
1426 | if (skb_cloned(skb)) | |
1427 | return pskb_expand_head(skb, 0, 0, pri); | |
1428 | ||
1429 | return 0; | |
1430 | } | |
1431 | ||
1da177e4 LT |
1432 | /** |
1433 | * skb_header_cloned - is the header a clone | |
1434 | * @skb: buffer to check | |
1435 | * | |
1436 | * Returns true if modifying the header part of the buffer requires | |
1437 | * the data to be copied. | |
1438 | */ | |
1439 | static inline int skb_header_cloned(const struct sk_buff *skb) | |
1440 | { | |
1441 | int dataref; | |
1442 | ||
1443 | if (!skb->cloned) | |
1444 | return 0; | |
1445 | ||
1446 | dataref = atomic_read(&skb_shinfo(skb)->dataref); | |
1447 | dataref = (dataref & SKB_DATAREF_MASK) - (dataref >> SKB_DATAREF_SHIFT); | |
1448 | return dataref != 1; | |
1449 | } | |
1450 | ||
9580bf2e ED |
1451 | static inline int skb_header_unclone(struct sk_buff *skb, gfp_t pri) |
1452 | { | |
1453 | might_sleep_if(gfpflags_allow_blocking(pri)); | |
1454 | ||
1455 | if (skb_header_cloned(skb)) | |
1456 | return pskb_expand_head(skb, 0, 0, pri); | |
1457 | ||
1458 | return 0; | |
1459 | } | |
1460 | ||
f4a775d1 ED |
1461 | /** |
1462 | * __skb_header_release - release reference to header | |
1463 | * @skb: buffer to operate on | |
f4a775d1 ED |
1464 | */ |
1465 | static inline void __skb_header_release(struct sk_buff *skb) | |
1466 | { | |
1467 | skb->nohdr = 1; | |
1468 | atomic_set(&skb_shinfo(skb)->dataref, 1 + (1 << SKB_DATAREF_SHIFT)); | |
1469 | } | |
1470 | ||
1471 | ||
1da177e4 LT |
1472 | /** |
1473 | * skb_shared - is the buffer shared | |
1474 | * @skb: buffer to check | |
1475 | * | |
1476 | * Returns true if more than one person has a reference to this | |
1477 | * buffer. | |
1478 | */ | |
1479 | static inline int skb_shared(const struct sk_buff *skb) | |
1480 | { | |
63354797 | 1481 | return refcount_read(&skb->users) != 1; |
1da177e4 LT |
1482 | } |
1483 | ||
1484 | /** | |
1485 | * skb_share_check - check if buffer is shared and if so clone it | |
1486 | * @skb: buffer to check | |
1487 | * @pri: priority for memory allocation | |
1488 | * | |
1489 | * If the buffer is shared the buffer is cloned and the old copy | |
1490 | * drops a reference. A new clone with a single reference is returned. | |
1491 | * If the buffer is not shared the original buffer is returned. When | |
1492 | * being called from interrupt status or with spinlocks held pri must | |
1493 | * be GFP_ATOMIC. | |
1494 | * | |
1495 | * NULL is returned on a memory allocation failure. | |
1496 | */ | |
47061bc4 | 1497 | static inline struct sk_buff *skb_share_check(struct sk_buff *skb, gfp_t pri) |
1da177e4 | 1498 | { |
d0164adc | 1499 | might_sleep_if(gfpflags_allow_blocking(pri)); |
1da177e4 LT |
1500 | if (skb_shared(skb)) { |
1501 | struct sk_buff *nskb = skb_clone(skb, pri); | |
47061bc4 ED |
1502 | |
1503 | if (likely(nskb)) | |
1504 | consume_skb(skb); | |
1505 | else | |
1506 | kfree_skb(skb); | |
1da177e4 LT |
1507 | skb = nskb; |
1508 | } | |
1509 | return skb; | |
1510 | } | |
1511 | ||
1512 | /* | |
1513 | * Copy shared buffers into a new sk_buff. We effectively do COW on | |
1514 | * packets to handle cases where we have a local reader and forward | |
1515 | * and a couple of other messy ones. The normal one is tcpdumping | |
1516 | * a packet thats being forwarded. | |
1517 | */ | |
1518 | ||
1519 | /** | |
1520 | * skb_unshare - make a copy of a shared buffer | |
1521 | * @skb: buffer to check | |
1522 | * @pri: priority for memory allocation | |
1523 | * | |
1524 | * If the socket buffer is a clone then this function creates a new | |
1525 | * copy of the data, drops a reference count on the old copy and returns | |
1526 | * the new copy with the reference count at 1. If the buffer is not a clone | |
1527 | * the original buffer is returned. When called with a spinlock held or | |
1528 | * from interrupt state @pri must be %GFP_ATOMIC | |
1529 | * | |
1530 | * %NULL is returned on a memory allocation failure. | |
1531 | */ | |
e2bf521d | 1532 | static inline struct sk_buff *skb_unshare(struct sk_buff *skb, |
dd0fc66f | 1533 | gfp_t pri) |
1da177e4 | 1534 | { |
d0164adc | 1535 | might_sleep_if(gfpflags_allow_blocking(pri)); |
1da177e4 LT |
1536 | if (skb_cloned(skb)) { |
1537 | struct sk_buff *nskb = skb_copy(skb, pri); | |
31eff81e AA |
1538 | |
1539 | /* Free our shared copy */ | |
1540 | if (likely(nskb)) | |
1541 | consume_skb(skb); | |
1542 | else | |
1543 | kfree_skb(skb); | |
1da177e4 LT |
1544 | skb = nskb; |
1545 | } | |
1546 | return skb; | |
1547 | } | |
1548 | ||
1549 | /** | |
1a5778aa | 1550 | * skb_peek - peek at the head of an &sk_buff_head |
1da177e4 LT |
1551 | * @list_: list to peek at |
1552 | * | |
1553 | * Peek an &sk_buff. Unlike most other operations you _MUST_ | |
1554 | * be careful with this one. A peek leaves the buffer on the | |
1555 | * list and someone else may run off with it. You must hold | |
1556 | * the appropriate locks or have a private queue to do this. | |
1557 | * | |
1558 | * Returns %NULL for an empty list or a pointer to the head element. | |
1559 | * The reference count is not incremented and the reference is therefore | |
1560 | * volatile. Use with caution. | |
1561 | */ | |
05bdd2f1 | 1562 | static inline struct sk_buff *skb_peek(const struct sk_buff_head *list_) |
1da177e4 | 1563 | { |
18d07000 ED |
1564 | struct sk_buff *skb = list_->next; |
1565 | ||
1566 | if (skb == (struct sk_buff *)list_) | |
1567 | skb = NULL; | |
1568 | return skb; | |
1da177e4 LT |
1569 | } |
1570 | ||
da5ef6e5 PE |
1571 | /** |
1572 | * skb_peek_next - peek skb following the given one from a queue | |
1573 | * @skb: skb to start from | |
1574 | * @list_: list to peek at | |
1575 | * | |
1576 | * Returns %NULL when the end of the list is met or a pointer to the | |
1577 | * next element. The reference count is not incremented and the | |
1578 | * reference is therefore volatile. Use with caution. | |
1579 | */ | |
1580 | static inline struct sk_buff *skb_peek_next(struct sk_buff *skb, | |
1581 | const struct sk_buff_head *list_) | |
1582 | { | |
1583 | struct sk_buff *next = skb->next; | |
18d07000 | 1584 | |
da5ef6e5 PE |
1585 | if (next == (struct sk_buff *)list_) |
1586 | next = NULL; | |
1587 | return next; | |
1588 | } | |
1589 | ||
1da177e4 | 1590 | /** |
1a5778aa | 1591 | * skb_peek_tail - peek at the tail of an &sk_buff_head |
1da177e4 LT |
1592 | * @list_: list to peek at |
1593 | * | |
1594 | * Peek an &sk_buff. Unlike most other operations you _MUST_ | |
1595 | * be careful with this one. A peek leaves the buffer on the | |
1596 | * list and someone else may run off with it. You must hold | |
1597 | * the appropriate locks or have a private queue to do this. | |
1598 | * | |
1599 | * Returns %NULL for an empty list or a pointer to the tail element. | |
1600 | * The reference count is not incremented and the reference is therefore | |
1601 | * volatile. Use with caution. | |
1602 | */ | |
05bdd2f1 | 1603 | static inline struct sk_buff *skb_peek_tail(const struct sk_buff_head *list_) |
1da177e4 | 1604 | { |
18d07000 ED |
1605 | struct sk_buff *skb = list_->prev; |
1606 | ||
1607 | if (skb == (struct sk_buff *)list_) | |
1608 | skb = NULL; | |
1609 | return skb; | |
1610 | ||
1da177e4 LT |
1611 | } |
1612 | ||
1613 | /** | |
1614 | * skb_queue_len - get queue length | |
1615 | * @list_: list to measure | |
1616 | * | |
1617 | * Return the length of an &sk_buff queue. | |
1618 | */ | |
1619 | static inline __u32 skb_queue_len(const struct sk_buff_head *list_) | |
1620 | { | |
1621 | return list_->qlen; | |
1622 | } | |
1623 | ||
67fed459 DM |
1624 | /** |
1625 | * __skb_queue_head_init - initialize non-spinlock portions of sk_buff_head | |
1626 | * @list: queue to initialize | |
1627 | * | |
1628 | * This initializes only the list and queue length aspects of | |
1629 | * an sk_buff_head object. This allows to initialize the list | |
1630 | * aspects of an sk_buff_head without reinitializing things like | |
1631 | * the spinlock. It can also be used for on-stack sk_buff_head | |
1632 | * objects where the spinlock is known to not be used. | |
1633 | */ | |
1634 | static inline void __skb_queue_head_init(struct sk_buff_head *list) | |
1635 | { | |
1636 | list->prev = list->next = (struct sk_buff *)list; | |
1637 | list->qlen = 0; | |
1638 | } | |
1639 | ||
76f10ad0 AV |
1640 | /* |
1641 | * This function creates a split out lock class for each invocation; | |
1642 | * this is needed for now since a whole lot of users of the skb-queue | |
1643 | * infrastructure in drivers have different locking usage (in hardirq) | |
1644 | * than the networking core (in softirq only). In the long run either the | |
1645 | * network layer or drivers should need annotation to consolidate the | |
1646 | * main types of usage into 3 classes. | |
1647 | */ | |
1da177e4 LT |
1648 | static inline void skb_queue_head_init(struct sk_buff_head *list) |
1649 | { | |
1650 | spin_lock_init(&list->lock); | |
67fed459 | 1651 | __skb_queue_head_init(list); |
1da177e4 LT |
1652 | } |
1653 | ||
c2ecba71 PE |
1654 | static inline void skb_queue_head_init_class(struct sk_buff_head *list, |
1655 | struct lock_class_key *class) | |
1656 | { | |
1657 | skb_queue_head_init(list); | |
1658 | lockdep_set_class(&list->lock, class); | |
1659 | } | |
1660 | ||
1da177e4 | 1661 | /* |
bf299275 | 1662 | * Insert an sk_buff on a list. |
1da177e4 LT |
1663 | * |
1664 | * The "__skb_xxxx()" functions are the non-atomic ones that | |
1665 | * can only be called with interrupts disabled. | |
1666 | */ | |
7965bd4d JP |
1667 | void skb_insert(struct sk_buff *old, struct sk_buff *newsk, |
1668 | struct sk_buff_head *list); | |
bf299275 GR |
1669 | static inline void __skb_insert(struct sk_buff *newsk, |
1670 | struct sk_buff *prev, struct sk_buff *next, | |
1671 | struct sk_buff_head *list) | |
1672 | { | |
1673 | newsk->next = next; | |
1674 | newsk->prev = prev; | |
1675 | next->prev = prev->next = newsk; | |
1676 | list->qlen++; | |
1677 | } | |
1da177e4 | 1678 | |
67fed459 DM |
1679 | static inline void __skb_queue_splice(const struct sk_buff_head *list, |
1680 | struct sk_buff *prev, | |
1681 | struct sk_buff *next) | |
1682 | { | |
1683 | struct sk_buff *first = list->next; | |
1684 | struct sk_buff *last = list->prev; | |
1685 | ||
1686 | first->prev = prev; | |
1687 | prev->next = first; | |
1688 | ||
1689 | last->next = next; | |
1690 | next->prev = last; | |
1691 | } | |
1692 | ||
1693 | /** | |
1694 | * skb_queue_splice - join two skb lists, this is designed for stacks | |
1695 | * @list: the new list to add | |
1696 | * @head: the place to add it in the first list | |
1697 | */ | |
1698 | static inline void skb_queue_splice(const struct sk_buff_head *list, | |
1699 | struct sk_buff_head *head) | |
1700 | { | |
1701 | if (!skb_queue_empty(list)) { | |
1702 | __skb_queue_splice(list, (struct sk_buff *) head, head->next); | |
1d4a31dd | 1703 | head->qlen += list->qlen; |
67fed459 DM |
1704 | } |
1705 | } | |
1706 | ||
1707 | /** | |
d9619496 | 1708 | * skb_queue_splice_init - join two skb lists and reinitialise the emptied list |
67fed459 DM |
1709 | * @list: the new list to add |
1710 | * @head: the place to add it in the first list | |
1711 | * | |
1712 | * The list at @list is reinitialised | |
1713 | */ | |
1714 | static inline void skb_queue_splice_init(struct sk_buff_head *list, | |
1715 | struct sk_buff_head *head) | |
1716 | { | |
1717 | if (!skb_queue_empty(list)) { | |
1718 | __skb_queue_splice(list, (struct sk_buff *) head, head->next); | |
1d4a31dd | 1719 | head->qlen += list->qlen; |
67fed459 DM |
1720 | __skb_queue_head_init(list); |
1721 | } | |
1722 | } | |
1723 | ||
1724 | /** | |
1725 | * skb_queue_splice_tail - join two skb lists, each list being a queue | |
1726 | * @list: the new list to add | |
1727 | * @head: the place to add it in the first list | |
1728 | */ | |
1729 | static inline void skb_queue_splice_tail(const struct sk_buff_head *list, | |
1730 | struct sk_buff_head *head) | |
1731 | { | |
1732 | if (!skb_queue_empty(list)) { | |
1733 | __skb_queue_splice(list, head->prev, (struct sk_buff *) head); | |
1d4a31dd | 1734 | head->qlen += list->qlen; |
67fed459 DM |
1735 | } |
1736 | } | |
1737 | ||
1738 | /** | |
d9619496 | 1739 | * skb_queue_splice_tail_init - join two skb lists and reinitialise the emptied list |
67fed459 DM |
1740 | * @list: the new list to add |
1741 | * @head: the place to add it in the first list | |
1742 | * | |
1743 | * Each of the lists is a queue. | |
1744 | * The list at @list is reinitialised | |
1745 | */ | |
1746 | static inline void skb_queue_splice_tail_init(struct sk_buff_head *list, | |
1747 | struct sk_buff_head *head) | |
1748 | { | |
1749 | if (!skb_queue_empty(list)) { | |
1750 | __skb_queue_splice(list, head->prev, (struct sk_buff *) head); | |
1d4a31dd | 1751 | head->qlen += list->qlen; |
67fed459 DM |
1752 | __skb_queue_head_init(list); |
1753 | } | |
1754 | } | |
1755 | ||
1da177e4 | 1756 | /** |
300ce174 | 1757 | * __skb_queue_after - queue a buffer at the list head |
1da177e4 | 1758 | * @list: list to use |
300ce174 | 1759 | * @prev: place after this buffer |
1da177e4 LT |
1760 | * @newsk: buffer to queue |
1761 | * | |
300ce174 | 1762 | * Queue a buffer int the middle of a list. This function takes no locks |
1da177e4 LT |
1763 | * and you must therefore hold required locks before calling it. |
1764 | * | |
1765 | * A buffer cannot be placed on two lists at the same time. | |
1766 | */ | |
300ce174 SH |
1767 | static inline void __skb_queue_after(struct sk_buff_head *list, |
1768 | struct sk_buff *prev, | |
1769 | struct sk_buff *newsk) | |
1da177e4 | 1770 | { |
bf299275 | 1771 | __skb_insert(newsk, prev, prev->next, list); |
1da177e4 LT |
1772 | } |
1773 | ||
7965bd4d JP |
1774 | void skb_append(struct sk_buff *old, struct sk_buff *newsk, |
1775 | struct sk_buff_head *list); | |
7de6c033 | 1776 | |
f5572855 GR |
1777 | static inline void __skb_queue_before(struct sk_buff_head *list, |
1778 | struct sk_buff *next, | |
1779 | struct sk_buff *newsk) | |
1780 | { | |
1781 | __skb_insert(newsk, next->prev, next, list); | |
1782 | } | |
1783 | ||
300ce174 SH |
1784 | /** |
1785 | * __skb_queue_head - queue a buffer at the list head | |
1786 | * @list: list to use | |
1787 | * @newsk: buffer to queue | |
1788 | * | |
1789 | * Queue a buffer at the start of a list. This function takes no locks | |
1790 | * and you must therefore hold required locks before calling it. | |
1791 | * | |
1792 | * A buffer cannot be placed on two lists at the same time. | |
1793 | */ | |
7965bd4d | 1794 | void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk); |
300ce174 SH |
1795 | static inline void __skb_queue_head(struct sk_buff_head *list, |
1796 | struct sk_buff *newsk) | |
1797 | { | |
1798 | __skb_queue_after(list, (struct sk_buff *)list, newsk); | |
1799 | } | |
1800 | ||
1da177e4 LT |
1801 | /** |
1802 | * __skb_queue_tail - queue a buffer at the list tail | |
1803 | * @list: list to use | |
1804 | * @newsk: buffer to queue | |
1805 | * | |
1806 | * Queue a buffer at the end of a list. This function takes no locks | |
1807 | * and you must therefore hold required locks before calling it. | |
1808 | * | |
1809 | * A buffer cannot be placed on two lists at the same time. | |
1810 | */ | |
7965bd4d | 1811 | void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk); |
1da177e4 LT |
1812 | static inline void __skb_queue_tail(struct sk_buff_head *list, |
1813 | struct sk_buff *newsk) | |
1814 | { | |
f5572855 | 1815 | __skb_queue_before(list, (struct sk_buff *)list, newsk); |
1da177e4 LT |
1816 | } |
1817 | ||
1da177e4 LT |
1818 | /* |
1819 | * remove sk_buff from list. _Must_ be called atomically, and with | |
1820 | * the list known.. | |
1821 | */ | |
7965bd4d | 1822 | void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list); |
1da177e4 LT |
1823 | static inline void __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list) |
1824 | { | |
1825 | struct sk_buff *next, *prev; | |
1826 | ||
1827 | list->qlen--; | |
1828 | next = skb->next; | |
1829 | prev = skb->prev; | |
1830 | skb->next = skb->prev = NULL; | |
1da177e4 LT |
1831 | next->prev = prev; |
1832 | prev->next = next; | |
1833 | } | |
1834 | ||
f525c06d GR |
1835 | /** |
1836 | * __skb_dequeue - remove from the head of the queue | |
1837 | * @list: list to dequeue from | |
1838 | * | |
1839 | * Remove the head of the list. This function does not take any locks | |
1840 | * so must be used with appropriate locks held only. The head item is | |
1841 | * returned or %NULL if the list is empty. | |
1842 | */ | |
7965bd4d | 1843 | struct sk_buff *skb_dequeue(struct sk_buff_head *list); |
f525c06d GR |
1844 | static inline struct sk_buff *__skb_dequeue(struct sk_buff_head *list) |
1845 | { | |
1846 | struct sk_buff *skb = skb_peek(list); | |
1847 | if (skb) | |
1848 | __skb_unlink(skb, list); | |
1849 | return skb; | |
1850 | } | |
1da177e4 LT |
1851 | |
1852 | /** | |
1853 | * __skb_dequeue_tail - remove from the tail of the queue | |
1854 | * @list: list to dequeue from | |
1855 | * | |
1856 | * Remove the tail of the list. This function does not take any locks | |
1857 | * so must be used with appropriate locks held only. The tail item is | |
1858 | * returned or %NULL if the list is empty. | |
1859 | */ | |
7965bd4d | 1860 | struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list); |
1da177e4 LT |
1861 | static inline struct sk_buff *__skb_dequeue_tail(struct sk_buff_head *list) |
1862 | { | |
1863 | struct sk_buff *skb = skb_peek_tail(list); | |
1864 | if (skb) | |
1865 | __skb_unlink(skb, list); | |
1866 | return skb; | |
1867 | } | |
1868 | ||
1869 | ||
bdcc0924 | 1870 | static inline bool skb_is_nonlinear(const struct sk_buff *skb) |
1da177e4 LT |
1871 | { |
1872 | return skb->data_len; | |
1873 | } | |
1874 | ||
1875 | static inline unsigned int skb_headlen(const struct sk_buff *skb) | |
1876 | { | |
1877 | return skb->len - skb->data_len; | |
1878 | } | |
1879 | ||
3ece7826 | 1880 | static inline unsigned int __skb_pagelen(const struct sk_buff *skb) |
1da177e4 | 1881 | { |
c72d8cda | 1882 | unsigned int i, len = 0; |
1da177e4 | 1883 | |
c72d8cda | 1884 | for (i = skb_shinfo(skb)->nr_frags - 1; (int)i >= 0; i--) |
9e903e08 | 1885 | len += skb_frag_size(&skb_shinfo(skb)->frags[i]); |
3ece7826 WB |
1886 | return len; |
1887 | } | |
1888 | ||
1889 | static inline unsigned int skb_pagelen(const struct sk_buff *skb) | |
1890 | { | |
1891 | return skb_headlen(skb) + __skb_pagelen(skb); | |
1da177e4 LT |
1892 | } |
1893 | ||
131ea667 IC |
1894 | /** |
1895 | * __skb_fill_page_desc - initialise a paged fragment in an skb | |
1896 | * @skb: buffer containing fragment to be initialised | |
1897 | * @i: paged fragment index to initialise | |
1898 | * @page: the page to use for this fragment | |
1899 | * @off: the offset to the data with @page | |
1900 | * @size: the length of the data | |
1901 | * | |
1902 | * Initialises the @i'th fragment of @skb to point to &size bytes at | |
1903 | * offset @off within @page. | |
1904 | * | |
1905 | * Does not take any additional reference on the fragment. | |
1906 | */ | |
1907 | static inline void __skb_fill_page_desc(struct sk_buff *skb, int i, | |
1908 | struct page *page, int off, int size) | |
1da177e4 LT |
1909 | { |
1910 | skb_frag_t *frag = &skb_shinfo(skb)->frags[i]; | |
1911 | ||
c48a11c7 | 1912 | /* |
2f064f34 MH |
1913 | * Propagate page pfmemalloc to the skb if we can. The problem is |
1914 | * that not all callers have unique ownership of the page but rely | |
1915 | * on page_is_pfmemalloc doing the right thing(tm). | |
c48a11c7 | 1916 | */ |
a8605c60 | 1917 | frag->page.p = page; |
1da177e4 | 1918 | frag->page_offset = off; |
9e903e08 | 1919 | skb_frag_size_set(frag, size); |
cca7af38 PE |
1920 | |
1921 | page = compound_head(page); | |
2f064f34 | 1922 | if (page_is_pfmemalloc(page)) |
cca7af38 | 1923 | skb->pfmemalloc = true; |
131ea667 IC |
1924 | } |
1925 | ||
1926 | /** | |
1927 | * skb_fill_page_desc - initialise a paged fragment in an skb | |
1928 | * @skb: buffer containing fragment to be initialised | |
1929 | * @i: paged fragment index to initialise | |
1930 | * @page: the page to use for this fragment | |
1931 | * @off: the offset to the data with @page | |
1932 | * @size: the length of the data | |
1933 | * | |
1934 | * As per __skb_fill_page_desc() -- initialises the @i'th fragment of | |
bc32383c | 1935 | * @skb to point to @size bytes at offset @off within @page. In |
131ea667 IC |
1936 | * addition updates @skb such that @i is the last fragment. |
1937 | * | |
1938 | * Does not take any additional reference on the fragment. | |
1939 | */ | |
1940 | static inline void skb_fill_page_desc(struct sk_buff *skb, int i, | |
1941 | struct page *page, int off, int size) | |
1942 | { | |
1943 | __skb_fill_page_desc(skb, i, page, off, size); | |
1da177e4 LT |
1944 | skb_shinfo(skb)->nr_frags = i + 1; |
1945 | } | |
1946 | ||
7965bd4d JP |
1947 | void skb_add_rx_frag(struct sk_buff *skb, int i, struct page *page, int off, |
1948 | int size, unsigned int truesize); | |
654bed16 | 1949 | |
f8e617e1 JW |
1950 | void skb_coalesce_rx_frag(struct sk_buff *skb, int i, int size, |
1951 | unsigned int truesize); | |
1952 | ||
1da177e4 | 1953 | #define SKB_PAGE_ASSERT(skb) BUG_ON(skb_shinfo(skb)->nr_frags) |
21dc3301 | 1954 | #define SKB_FRAG_ASSERT(skb) BUG_ON(skb_has_frag_list(skb)) |
1da177e4 LT |
1955 | #define SKB_LINEAR_ASSERT(skb) BUG_ON(skb_is_nonlinear(skb)) |
1956 | ||
27a884dc ACM |
1957 | #ifdef NET_SKBUFF_DATA_USES_OFFSET |
1958 | static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb) | |
1959 | { | |
1960 | return skb->head + skb->tail; | |
1961 | } | |
1962 | ||
1963 | static inline void skb_reset_tail_pointer(struct sk_buff *skb) | |
1964 | { | |
1965 | skb->tail = skb->data - skb->head; | |
1966 | } | |
1967 | ||
1968 | static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset) | |
1969 | { | |
1970 | skb_reset_tail_pointer(skb); | |
1971 | skb->tail += offset; | |
1972 | } | |
7cc46190 | 1973 | |
27a884dc ACM |
1974 | #else /* NET_SKBUFF_DATA_USES_OFFSET */ |
1975 | static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb) | |
1976 | { | |
1977 | return skb->tail; | |
1978 | } | |
1979 | ||
1980 | static inline void skb_reset_tail_pointer(struct sk_buff *skb) | |
1981 | { | |
1982 | skb->tail = skb->data; | |
1983 | } | |
1984 | ||
1985 | static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset) | |
1986 | { | |
1987 | skb->tail = skb->data + offset; | |
1988 | } | |
4305b541 | 1989 | |
27a884dc ACM |
1990 | #endif /* NET_SKBUFF_DATA_USES_OFFSET */ |
1991 | ||
1da177e4 LT |
1992 | /* |
1993 | * Add data to an sk_buff | |
1994 | */ | |
4df864c1 JB |
1995 | void *pskb_put(struct sk_buff *skb, struct sk_buff *tail, int len); |
1996 | void *skb_put(struct sk_buff *skb, unsigned int len); | |
1997 | static inline void *__skb_put(struct sk_buff *skb, unsigned int len) | |
1da177e4 | 1998 | { |
4df864c1 | 1999 | void *tmp = skb_tail_pointer(skb); |
1da177e4 LT |
2000 | SKB_LINEAR_ASSERT(skb); |
2001 | skb->tail += len; | |
2002 | skb->len += len; | |
2003 | return tmp; | |
2004 | } | |
2005 | ||
de77b966 | 2006 | static inline void *__skb_put_zero(struct sk_buff *skb, unsigned int len) |
2007 | { | |
2008 | void *tmp = __skb_put(skb, len); | |
2009 | ||
2010 | memset(tmp, 0, len); | |
2011 | return tmp; | |
2012 | } | |
2013 | ||
2014 | static inline void *__skb_put_data(struct sk_buff *skb, const void *data, | |
2015 | unsigned int len) | |
2016 | { | |
2017 | void *tmp = __skb_put(skb, len); | |
2018 | ||
2019 | memcpy(tmp, data, len); | |
2020 | return tmp; | |
2021 | } | |
2022 | ||
2023 | static inline void __skb_put_u8(struct sk_buff *skb, u8 val) | |
2024 | { | |
2025 | *(u8 *)__skb_put(skb, 1) = val; | |
2026 | } | |
2027 | ||
83ad357d | 2028 | static inline void *skb_put_zero(struct sk_buff *skb, unsigned int len) |
e45a79da | 2029 | { |
83ad357d | 2030 | void *tmp = skb_put(skb, len); |
e45a79da JB |
2031 | |
2032 | memset(tmp, 0, len); | |
2033 | ||
2034 | return tmp; | |
2035 | } | |
2036 | ||
59ae1d12 JB |
2037 | static inline void *skb_put_data(struct sk_buff *skb, const void *data, |
2038 | unsigned int len) | |
2039 | { | |
2040 | void *tmp = skb_put(skb, len); | |
2041 | ||
2042 | memcpy(tmp, data, len); | |
2043 | ||
2044 | return tmp; | |
2045 | } | |
2046 | ||
634fef61 JB |
2047 | static inline void skb_put_u8(struct sk_buff *skb, u8 val) |
2048 | { | |
2049 | *(u8 *)skb_put(skb, 1) = val; | |
2050 | } | |
2051 | ||
d58ff351 JB |
2052 | void *skb_push(struct sk_buff *skb, unsigned int len); |
2053 | static inline void *__skb_push(struct sk_buff *skb, unsigned int len) | |
1da177e4 LT |
2054 | { |
2055 | skb->data -= len; | |
2056 | skb->len += len; | |
2057 | return skb->data; | |
2058 | } | |
2059 | ||
af72868b JB |
2060 | void *skb_pull(struct sk_buff *skb, unsigned int len); |
2061 | static inline void *__skb_pull(struct sk_buff *skb, unsigned int len) | |
1da177e4 LT |
2062 | { |
2063 | skb->len -= len; | |
2064 | BUG_ON(skb->len < skb->data_len); | |
2065 | return skb->data += len; | |
2066 | } | |
2067 | ||
af72868b | 2068 | static inline void *skb_pull_inline(struct sk_buff *skb, unsigned int len) |
47d29646 DM |
2069 | { |
2070 | return unlikely(len > skb->len) ? NULL : __skb_pull(skb, len); | |
2071 | } | |
2072 | ||
af72868b | 2073 | void *__pskb_pull_tail(struct sk_buff *skb, int delta); |
1da177e4 | 2074 | |
af72868b | 2075 | static inline void *__pskb_pull(struct sk_buff *skb, unsigned int len) |
1da177e4 LT |
2076 | { |
2077 | if (len > skb_headlen(skb) && | |
987c402a | 2078 | !__pskb_pull_tail(skb, len - skb_headlen(skb))) |
1da177e4 LT |
2079 | return NULL; |
2080 | skb->len -= len; | |
2081 | return skb->data += len; | |
2082 | } | |
2083 | ||
af72868b | 2084 | static inline void *pskb_pull(struct sk_buff *skb, unsigned int len) |
1da177e4 LT |
2085 | { |
2086 | return unlikely(len > skb->len) ? NULL : __pskb_pull(skb, len); | |
2087 | } | |
2088 | ||
2089 | static inline int pskb_may_pull(struct sk_buff *skb, unsigned int len) | |
2090 | { | |
2091 | if (likely(len <= skb_headlen(skb))) | |
2092 | return 1; | |
2093 | if (unlikely(len > skb->len)) | |
2094 | return 0; | |
987c402a | 2095 | return __pskb_pull_tail(skb, len - skb_headlen(skb)) != NULL; |
1da177e4 LT |
2096 | } |
2097 | ||
c8c8b127 ED |
2098 | void skb_condense(struct sk_buff *skb); |
2099 | ||
1da177e4 LT |
2100 | /** |
2101 | * skb_headroom - bytes at buffer head | |
2102 | * @skb: buffer to check | |
2103 | * | |
2104 | * Return the number of bytes of free space at the head of an &sk_buff. | |
2105 | */ | |
c2636b4d | 2106 | static inline unsigned int skb_headroom(const struct sk_buff *skb) |
1da177e4 LT |
2107 | { |
2108 | return skb->data - skb->head; | |
2109 | } | |
2110 | ||
2111 | /** | |
2112 | * skb_tailroom - bytes at buffer end | |
2113 | * @skb: buffer to check | |
2114 | * | |
2115 | * Return the number of bytes of free space at the tail of an sk_buff | |
2116 | */ | |
2117 | static inline int skb_tailroom(const struct sk_buff *skb) | |
2118 | { | |
4305b541 | 2119 | return skb_is_nonlinear(skb) ? 0 : skb->end - skb->tail; |
1da177e4 LT |
2120 | } |
2121 | ||
a21d4572 ED |
2122 | /** |
2123 | * skb_availroom - bytes at buffer end | |
2124 | * @skb: buffer to check | |
2125 | * | |
2126 | * Return the number of bytes of free space at the tail of an sk_buff | |
2127 | * allocated by sk_stream_alloc() | |
2128 | */ | |
2129 | static inline int skb_availroom(const struct sk_buff *skb) | |
2130 | { | |
16fad69c ED |
2131 | if (skb_is_nonlinear(skb)) |
2132 | return 0; | |
2133 | ||
2134 | return skb->end - skb->tail - skb->reserved_tailroom; | |
a21d4572 ED |
2135 | } |
2136 | ||
1da177e4 LT |
2137 | /** |
2138 | * skb_reserve - adjust headroom | |
2139 | * @skb: buffer to alter | |
2140 | * @len: bytes to move | |
2141 | * | |
2142 | * Increase the headroom of an empty &sk_buff by reducing the tail | |
2143 | * room. This is only allowed for an empty buffer. | |
2144 | */ | |
8243126c | 2145 | static inline void skb_reserve(struct sk_buff *skb, int len) |
1da177e4 LT |
2146 | { |
2147 | skb->data += len; | |
2148 | skb->tail += len; | |
2149 | } | |
2150 | ||
1837b2e2 BP |
2151 | /** |
2152 | * skb_tailroom_reserve - adjust reserved_tailroom | |
2153 | * @skb: buffer to alter | |
2154 | * @mtu: maximum amount of headlen permitted | |
2155 | * @needed_tailroom: minimum amount of reserved_tailroom | |
2156 | * | |
2157 | * Set reserved_tailroom so that headlen can be as large as possible but | |
2158 | * not larger than mtu and tailroom cannot be smaller than | |
2159 | * needed_tailroom. | |
2160 | * The required headroom should already have been reserved before using | |
2161 | * this function. | |
2162 | */ | |
2163 | static inline void skb_tailroom_reserve(struct sk_buff *skb, unsigned int mtu, | |
2164 | unsigned int needed_tailroom) | |
2165 | { | |
2166 | SKB_LINEAR_ASSERT(skb); | |
2167 | if (mtu < skb_tailroom(skb) - needed_tailroom) | |
2168 | /* use at most mtu */ | |
2169 | skb->reserved_tailroom = skb_tailroom(skb) - mtu; | |
2170 | else | |
2171 | /* use up to all available space */ | |
2172 | skb->reserved_tailroom = needed_tailroom; | |
2173 | } | |
2174 | ||
8bce6d7d TH |
2175 | #define ENCAP_TYPE_ETHER 0 |
2176 | #define ENCAP_TYPE_IPPROTO 1 | |
2177 | ||
2178 | static inline void skb_set_inner_protocol(struct sk_buff *skb, | |
2179 | __be16 protocol) | |
2180 | { | |
2181 | skb->inner_protocol = protocol; | |
2182 | skb->inner_protocol_type = ENCAP_TYPE_ETHER; | |
2183 | } | |
2184 | ||
2185 | static inline void skb_set_inner_ipproto(struct sk_buff *skb, | |
2186 | __u8 ipproto) | |
2187 | { | |
2188 | skb->inner_ipproto = ipproto; | |
2189 | skb->inner_protocol_type = ENCAP_TYPE_IPPROTO; | |
2190 | } | |
2191 | ||
6a674e9c JG |
2192 | static inline void skb_reset_inner_headers(struct sk_buff *skb) |
2193 | { | |
aefbd2b3 | 2194 | skb->inner_mac_header = skb->mac_header; |
6a674e9c JG |
2195 | skb->inner_network_header = skb->network_header; |
2196 | skb->inner_transport_header = skb->transport_header; | |
2197 | } | |
2198 | ||
0b5c9db1 JP |
2199 | static inline void skb_reset_mac_len(struct sk_buff *skb) |
2200 | { | |
2201 | skb->mac_len = skb->network_header - skb->mac_header; | |
2202 | } | |
2203 | ||
6a674e9c JG |
2204 | static inline unsigned char *skb_inner_transport_header(const struct sk_buff |
2205 | *skb) | |
2206 | { | |
2207 | return skb->head + skb->inner_transport_header; | |
2208 | } | |
2209 | ||
55dc5a9f TH |
2210 | static inline int skb_inner_transport_offset(const struct sk_buff *skb) |
2211 | { | |
2212 | return skb_inner_transport_header(skb) - skb->data; | |
2213 | } | |
2214 | ||
6a674e9c JG |
2215 | static inline void skb_reset_inner_transport_header(struct sk_buff *skb) |
2216 | { | |
2217 | skb->inner_transport_header = skb->data - skb->head; | |
2218 | } | |
2219 | ||
2220 | static inline void skb_set_inner_transport_header(struct sk_buff *skb, | |
2221 | const int offset) | |
2222 | { | |
2223 | skb_reset_inner_transport_header(skb); | |
2224 | skb->inner_transport_header += offset; | |
2225 | } | |
2226 | ||
2227 | static inline unsigned char *skb_inner_network_header(const struct sk_buff *skb) | |
2228 | { | |
2229 | return skb->head + skb->inner_network_header; | |
2230 | } | |
2231 | ||
2232 | static inline void skb_reset_inner_network_header(struct sk_buff *skb) | |
2233 | { | |
2234 | skb->inner_network_header = skb->data - skb->head; | |
2235 | } | |
2236 | ||
2237 | static inline void skb_set_inner_network_header(struct sk_buff *skb, | |
2238 | const int offset) | |
2239 | { | |
2240 | skb_reset_inner_network_header(skb); | |
2241 | skb->inner_network_header += offset; | |
2242 | } | |
2243 | ||
aefbd2b3 PS |
2244 | static inline unsigned char *skb_inner_mac_header(const struct sk_buff *skb) |
2245 | { | |
2246 | return skb->head + skb->inner_mac_header; | |
2247 | } | |
2248 | ||
2249 | static inline void skb_reset_inner_mac_header(struct sk_buff *skb) | |
2250 | { | |
2251 | skb->inner_mac_header = skb->data - skb->head; | |
2252 | } | |
2253 | ||
2254 | static inline void skb_set_inner_mac_header(struct sk_buff *skb, | |
2255 | const int offset) | |
2256 | { | |
2257 | skb_reset_inner_mac_header(skb); | |
2258 | skb->inner_mac_header += offset; | |
2259 | } | |
fda55eca ED |
2260 | static inline bool skb_transport_header_was_set(const struct sk_buff *skb) |
2261 | { | |
35d04610 | 2262 | return skb->transport_header != (typeof(skb->transport_header))~0U; |
fda55eca ED |
2263 | } |
2264 | ||
9c70220b ACM |
2265 | static inline unsigned char *skb_transport_header(const struct sk_buff *skb) |
2266 | { | |
2e07fa9c | 2267 | return skb->head + skb->transport_header; |
9c70220b ACM |
2268 | } |
2269 | ||
badff6d0 ACM |
2270 | static inline void skb_reset_transport_header(struct sk_buff *skb) |
2271 | { | |
2e07fa9c | 2272 | skb->transport_header = skb->data - skb->head; |
badff6d0 ACM |
2273 | } |
2274 | ||
967b05f6 ACM |
2275 | static inline void skb_set_transport_header(struct sk_buff *skb, |
2276 | const int offset) | |
2277 | { | |
2e07fa9c ACM |
2278 | skb_reset_transport_header(skb); |
2279 | skb->transport_header += offset; | |
ea2ae17d ACM |
2280 | } |
2281 | ||
d56f90a7 ACM |
2282 | static inline unsigned char *skb_network_header(const struct sk_buff *skb) |
2283 | { | |
2e07fa9c | 2284 | return skb->head + skb->network_header; |
d56f90a7 ACM |
2285 | } |
2286 | ||
c1d2bbe1 ACM |
2287 | static inline void skb_reset_network_header(struct sk_buff *skb) |
2288 | { | |
2e07fa9c | 2289 | skb->network_header = skb->data - skb->head; |
c1d2bbe1 ACM |
2290 | } |
2291 | ||
c14d2450 ACM |
2292 | static inline void skb_set_network_header(struct sk_buff *skb, const int offset) |
2293 | { | |
2e07fa9c ACM |
2294 | skb_reset_network_header(skb); |
2295 | skb->network_header += offset; | |
c14d2450 ACM |
2296 | } |
2297 | ||
2e07fa9c | 2298 | static inline unsigned char *skb_mac_header(const struct sk_buff *skb) |
bbe735e4 | 2299 | { |
2e07fa9c | 2300 | return skb->head + skb->mac_header; |
bbe735e4 ACM |
2301 | } |
2302 | ||
ea6da4fd AV |
2303 | static inline int skb_mac_offset(const struct sk_buff *skb) |
2304 | { | |
2305 | return skb_mac_header(skb) - skb->data; | |
2306 | } | |
2307 | ||
0daf4349 DB |
2308 | static inline u32 skb_mac_header_len(const struct sk_buff *skb) |
2309 | { | |
2310 | return skb->network_header - skb->mac_header; | |
2311 | } | |
2312 | ||
2e07fa9c | 2313 | static inline int skb_mac_header_was_set(const struct sk_buff *skb) |
cfe1fc77 | 2314 | { |
35d04610 | 2315 | return skb->mac_header != (typeof(skb->mac_header))~0U; |
2e07fa9c ACM |
2316 | } |
2317 | ||
2318 | static inline void skb_reset_mac_header(struct sk_buff *skb) | |
2319 | { | |
2320 | skb->mac_header = skb->data - skb->head; | |
2321 | } | |
2322 | ||
2323 | static inline void skb_set_mac_header(struct sk_buff *skb, const int offset) | |
2324 | { | |
2325 | skb_reset_mac_header(skb); | |
2326 | skb->mac_header += offset; | |
2327 | } | |
2328 | ||
0e3da5bb TT |
2329 | static inline void skb_pop_mac_header(struct sk_buff *skb) |
2330 | { | |
2331 | skb->mac_header = skb->network_header; | |
2332 | } | |
2333 | ||
fbbdb8f0 YX |
2334 | static inline void skb_probe_transport_header(struct sk_buff *skb, |
2335 | const int offset_hint) | |
2336 | { | |
2337 | struct flow_keys keys; | |
2338 | ||
2339 | if (skb_transport_header_was_set(skb)) | |
2340 | return; | |
cd79a238 | 2341 | else if (skb_flow_dissect_flow_keys(skb, &keys, 0)) |
42aecaa9 | 2342 | skb_set_transport_header(skb, keys.control.thoff); |
fbbdb8f0 YX |
2343 | else |
2344 | skb_set_transport_header(skb, offset_hint); | |
2345 | } | |
2346 | ||
03606895 ED |
2347 | static inline void skb_mac_header_rebuild(struct sk_buff *skb) |
2348 | { | |
2349 | if (skb_mac_header_was_set(skb)) { | |
2350 | const unsigned char *old_mac = skb_mac_header(skb); | |
2351 | ||
2352 | skb_set_mac_header(skb, -skb->mac_len); | |
2353 | memmove(skb_mac_header(skb), old_mac, skb->mac_len); | |
2354 | } | |
2355 | } | |
2356 | ||
04fb451e MM |
2357 | static inline int skb_checksum_start_offset(const struct sk_buff *skb) |
2358 | { | |
2359 | return skb->csum_start - skb_headroom(skb); | |
2360 | } | |
2361 | ||
08b64fcc AD |
2362 | static inline unsigned char *skb_checksum_start(const struct sk_buff *skb) |
2363 | { | |
2364 | return skb->head + skb->csum_start; | |
2365 | } | |
2366 | ||
2e07fa9c ACM |
2367 | static inline int skb_transport_offset(const struct sk_buff *skb) |
2368 | { | |
2369 | return skb_transport_header(skb) - skb->data; | |
2370 | } | |
2371 | ||
2372 | static inline u32 skb_network_header_len(const struct sk_buff *skb) | |
2373 | { | |
2374 | return skb->transport_header - skb->network_header; | |
2375 | } | |
2376 | ||
6a674e9c JG |
2377 | static inline u32 skb_inner_network_header_len(const struct sk_buff *skb) |
2378 | { | |
2379 | return skb->inner_transport_header - skb->inner_network_header; | |
2380 | } | |
2381 | ||
2e07fa9c ACM |
2382 | static inline int skb_network_offset(const struct sk_buff *skb) |
2383 | { | |
2384 | return skb_network_header(skb) - skb->data; | |
2385 | } | |
48d49d0c | 2386 | |
6a674e9c JG |
2387 | static inline int skb_inner_network_offset(const struct sk_buff *skb) |
2388 | { | |
2389 | return skb_inner_network_header(skb) - skb->data; | |
2390 | } | |
2391 | ||
f9599ce1 CG |
2392 | static inline int pskb_network_may_pull(struct sk_buff *skb, unsigned int len) |
2393 | { | |
2394 | return pskb_may_pull(skb, skb_network_offset(skb) + len); | |
2395 | } | |
2396 | ||
1da177e4 LT |
2397 | /* |
2398 | * CPUs often take a performance hit when accessing unaligned memory | |
2399 | * locations. The actual performance hit varies, it can be small if the | |
2400 | * hardware handles it or large if we have to take an exception and fix it | |
2401 | * in software. | |
2402 | * | |
2403 | * Since an ethernet header is 14 bytes network drivers often end up with | |
2404 | * the IP header at an unaligned offset. The IP header can be aligned by | |
2405 | * shifting the start of the packet by 2 bytes. Drivers should do this | |
2406 | * with: | |
2407 | * | |
8660c124 | 2408 | * skb_reserve(skb, NET_IP_ALIGN); |
1da177e4 LT |
2409 | * |
2410 | * The downside to this alignment of the IP header is that the DMA is now | |
2411 | * unaligned. On some architectures the cost of an unaligned DMA is high | |
2412 | * and this cost outweighs the gains made by aligning the IP header. | |
8660c124 | 2413 | * |
1da177e4 LT |
2414 | * Since this trade off varies between architectures, we allow NET_IP_ALIGN |
2415 | * to be overridden. | |
2416 | */ | |
2417 | #ifndef NET_IP_ALIGN | |
2418 | #define NET_IP_ALIGN 2 | |
2419 | #endif | |
2420 | ||
025be81e AB |
2421 | /* |
2422 | * The networking layer reserves some headroom in skb data (via | |
2423 | * dev_alloc_skb). This is used to avoid having to reallocate skb data when | |
2424 | * the header has to grow. In the default case, if the header has to grow | |
d6301d3d | 2425 | * 32 bytes or less we avoid the reallocation. |
025be81e AB |
2426 | * |
2427 | * Unfortunately this headroom changes the DMA alignment of the resulting | |
2428 | * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive | |
2429 | * on some architectures. An architecture can override this value, | |
2430 | * perhaps setting it to a cacheline in size (since that will maintain | |
2431 | * cacheline alignment of the DMA). It must be a power of 2. | |
2432 | * | |
d6301d3d | 2433 | * Various parts of the networking layer expect at least 32 bytes of |
025be81e | 2434 | * headroom, you should not reduce this. |
5933dd2f ED |
2435 | * |
2436 | * Using max(32, L1_CACHE_BYTES) makes sense (especially with RPS) | |
2437 | * to reduce average number of cache lines per packet. | |
2438 | * get_rps_cpus() for example only access one 64 bytes aligned block : | |
18e8c134 | 2439 | * NET_IP_ALIGN(2) + ethernet_header(14) + IP_header(20/40) + ports(8) |
025be81e AB |
2440 | */ |
2441 | #ifndef NET_SKB_PAD | |
5933dd2f | 2442 | #define NET_SKB_PAD max(32, L1_CACHE_BYTES) |
025be81e AB |
2443 | #endif |
2444 | ||
7965bd4d | 2445 | int ___pskb_trim(struct sk_buff *skb, unsigned int len); |
1da177e4 | 2446 | |
5293efe6 | 2447 | static inline void __skb_set_length(struct sk_buff *skb, unsigned int len) |
1da177e4 | 2448 | { |
c4264f27 | 2449 | if (unlikely(skb_is_nonlinear(skb))) { |
3cc0e873 HX |
2450 | WARN_ON(1); |
2451 | return; | |
2452 | } | |
27a884dc ACM |
2453 | skb->len = len; |
2454 | skb_set_tail_pointer(skb, len); | |
1da177e4 LT |
2455 | } |
2456 | ||
5293efe6 DB |
2457 | static inline void __skb_trim(struct sk_buff *skb, unsigned int len) |
2458 | { | |
2459 | __skb_set_length(skb, len); | |
2460 | } | |
2461 | ||
7965bd4d | 2462 | void skb_trim(struct sk_buff *skb, unsigned int len); |
1da177e4 LT |
2463 | |
2464 | static inline int __pskb_trim(struct sk_buff *skb, unsigned int len) | |
2465 | { | |
3cc0e873 HX |
2466 | if (skb->data_len) |
2467 | return ___pskb_trim(skb, len); | |
2468 | __skb_trim(skb, len); | |
2469 | return 0; | |
1da177e4 LT |
2470 | } |
2471 | ||
2472 | static inline int pskb_trim(struct sk_buff *skb, unsigned int len) | |
2473 | { | |
2474 | return (len < skb->len) ? __pskb_trim(skb, len) : 0; | |
2475 | } | |
2476 | ||
e9fa4f7b HX |
2477 | /** |
2478 | * pskb_trim_unique - remove end from a paged unique (not cloned) buffer | |
2479 | * @skb: buffer to alter | |
2480 | * @len: new length | |
2481 | * | |
2482 | * This is identical to pskb_trim except that the caller knows that | |
2483 | * the skb is not cloned so we should never get an error due to out- | |
2484 | * of-memory. | |
2485 | */ | |
2486 | static inline void pskb_trim_unique(struct sk_buff *skb, unsigned int len) | |
2487 | { | |
2488 | int err = pskb_trim(skb, len); | |
2489 | BUG_ON(err); | |
2490 | } | |
2491 | ||
5293efe6 DB |
2492 | static inline int __skb_grow(struct sk_buff *skb, unsigned int len) |
2493 | { | |
2494 | unsigned int diff = len - skb->len; | |
2495 | ||
2496 | if (skb_tailroom(skb) < diff) { | |
2497 | int ret = pskb_expand_head(skb, 0, diff - skb_tailroom(skb), | |
2498 | GFP_ATOMIC); | |
2499 | if (ret) | |
2500 | return ret; | |
2501 | } | |
2502 | __skb_set_length(skb, len); | |
2503 | return 0; | |
2504 | } | |
2505 | ||
1da177e4 LT |
2506 | /** |
2507 | * skb_orphan - orphan a buffer | |
2508 | * @skb: buffer to orphan | |
2509 | * | |
2510 | * If a buffer currently has an owner then we call the owner's | |
2511 | * destructor function and make the @skb unowned. The buffer continues | |
2512 | * to exist but is no longer charged to its former owner. | |
2513 | */ | |
2514 | static inline void skb_orphan(struct sk_buff *skb) | |
2515 | { | |
c34a7612 | 2516 | if (skb->destructor) { |
1da177e4 | 2517 | skb->destructor(skb); |
c34a7612 ED |
2518 | skb->destructor = NULL; |
2519 | skb->sk = NULL; | |
376c7311 ED |
2520 | } else { |
2521 | BUG_ON(skb->sk); | |
c34a7612 | 2522 | } |
1da177e4 LT |
2523 | } |
2524 | ||
a353e0ce MT |
2525 | /** |
2526 | * skb_orphan_frags - orphan the frags contained in a buffer | |
2527 | * @skb: buffer to orphan frags from | |
2528 | * @gfp_mask: allocation mask for replacement pages | |
2529 | * | |
2530 | * For each frag in the SKB which needs a destructor (i.e. has an | |
2531 | * owner) create a copy of that frag and release the original | |
2532 | * page by calling the destructor. | |
2533 | */ | |
2534 | static inline int skb_orphan_frags(struct sk_buff *skb, gfp_t gfp_mask) | |
2535 | { | |
1f8b977a WB |
2536 | if (likely(!skb_zcopy(skb))) |
2537 | return 0; | |
2538 | if (skb_uarg(skb)->callback == sock_zerocopy_callback) | |
2539 | return 0; | |
2540 | return skb_copy_ubufs(skb, gfp_mask); | |
2541 | } | |
2542 | ||
2543 | /* Frags must be orphaned, even if refcounted, if skb might loop to rx path */ | |
2544 | static inline int skb_orphan_frags_rx(struct sk_buff *skb, gfp_t gfp_mask) | |
2545 | { | |
2546 | if (likely(!skb_zcopy(skb))) | |
a353e0ce MT |
2547 | return 0; |
2548 | return skb_copy_ubufs(skb, gfp_mask); | |
2549 | } | |
2550 | ||
1da177e4 LT |
2551 | /** |
2552 | * __skb_queue_purge - empty a list | |
2553 | * @list: list to empty | |
2554 | * | |
2555 | * Delete all buffers on an &sk_buff list. Each buffer is removed from | |
2556 | * the list and one reference dropped. This function does not take the | |
2557 | * list lock and the caller must hold the relevant locks to use it. | |
2558 | */ | |
7965bd4d | 2559 | void skb_queue_purge(struct sk_buff_head *list); |
1da177e4 LT |
2560 | static inline void __skb_queue_purge(struct sk_buff_head *list) |
2561 | { | |
2562 | struct sk_buff *skb; | |
2563 | while ((skb = __skb_dequeue(list)) != NULL) | |
2564 | kfree_skb(skb); | |
2565 | } | |
2566 | ||
9f5afeae YW |
2567 | void skb_rbtree_purge(struct rb_root *root); |
2568 | ||
7965bd4d | 2569 | void *netdev_alloc_frag(unsigned int fragsz); |
1da177e4 | 2570 | |
7965bd4d JP |
2571 | struct sk_buff *__netdev_alloc_skb(struct net_device *dev, unsigned int length, |
2572 | gfp_t gfp_mask); | |
8af27456 CH |
2573 | |
2574 | /** | |
2575 | * netdev_alloc_skb - allocate an skbuff for rx on a specific device | |
2576 | * @dev: network device to receive on | |
2577 | * @length: length to allocate | |
2578 | * | |
2579 | * Allocate a new &sk_buff and assign it a usage count of one. The | |
2580 | * buffer has unspecified headroom built in. Users should allocate | |
2581 | * the headroom they think they need without accounting for the | |
2582 | * built in space. The built in space is used for optimisations. | |
2583 | * | |
2584 | * %NULL is returned if there is no free memory. Although this function | |
2585 | * allocates memory it can be called from an interrupt. | |
2586 | */ | |
2587 | static inline struct sk_buff *netdev_alloc_skb(struct net_device *dev, | |
6f532612 | 2588 | unsigned int length) |
8af27456 CH |
2589 | { |
2590 | return __netdev_alloc_skb(dev, length, GFP_ATOMIC); | |
2591 | } | |
2592 | ||
6f532612 ED |
2593 | /* legacy helper around __netdev_alloc_skb() */ |
2594 | static inline struct sk_buff *__dev_alloc_skb(unsigned int length, | |
2595 | gfp_t gfp_mask) | |
2596 | { | |
2597 | return __netdev_alloc_skb(NULL, length, gfp_mask); | |
2598 | } | |
2599 | ||
2600 | /* legacy helper around netdev_alloc_skb() */ | |
2601 | static inline struct sk_buff *dev_alloc_skb(unsigned int length) | |
2602 | { | |
2603 | return netdev_alloc_skb(NULL, length); | |
2604 | } | |
2605 | ||
2606 | ||
4915a0de ED |
2607 | static inline struct sk_buff *__netdev_alloc_skb_ip_align(struct net_device *dev, |
2608 | unsigned int length, gfp_t gfp) | |
61321bbd | 2609 | { |
4915a0de | 2610 | struct sk_buff *skb = __netdev_alloc_skb(dev, length + NET_IP_ALIGN, gfp); |
61321bbd ED |
2611 | |
2612 | if (NET_IP_ALIGN && skb) | |
2613 | skb_reserve(skb, NET_IP_ALIGN); | |
2614 | return skb; | |
2615 | } | |
2616 | ||
4915a0de ED |
2617 | static inline struct sk_buff *netdev_alloc_skb_ip_align(struct net_device *dev, |
2618 | unsigned int length) | |
2619 | { | |
2620 | return __netdev_alloc_skb_ip_align(dev, length, GFP_ATOMIC); | |
2621 | } | |
2622 | ||
181edb2b AD |
2623 | static inline void skb_free_frag(void *addr) |
2624 | { | |
8c2dd3e4 | 2625 | page_frag_free(addr); |
181edb2b AD |
2626 | } |
2627 | ||
ffde7328 | 2628 | void *napi_alloc_frag(unsigned int fragsz); |
fd11a83d AD |
2629 | struct sk_buff *__napi_alloc_skb(struct napi_struct *napi, |
2630 | unsigned int length, gfp_t gfp_mask); | |
2631 | static inline struct sk_buff *napi_alloc_skb(struct napi_struct *napi, | |
2632 | unsigned int length) | |
2633 | { | |
2634 | return __napi_alloc_skb(napi, length, GFP_ATOMIC); | |
2635 | } | |
795bb1c0 JDB |
2636 | void napi_consume_skb(struct sk_buff *skb, int budget); |
2637 | ||
2638 | void __kfree_skb_flush(void); | |
15fad714 | 2639 | void __kfree_skb_defer(struct sk_buff *skb); |
ffde7328 | 2640 | |
71dfda58 AD |
2641 | /** |
2642 | * __dev_alloc_pages - allocate page for network Rx | |
2643 | * @gfp_mask: allocation priority. Set __GFP_NOMEMALLOC if not for network Rx | |
2644 | * @order: size of the allocation | |
2645 | * | |
2646 | * Allocate a new page. | |
2647 | * | |
2648 | * %NULL is returned if there is no free memory. | |
2649 | */ | |
2650 | static inline struct page *__dev_alloc_pages(gfp_t gfp_mask, | |
2651 | unsigned int order) | |
2652 | { | |
2653 | /* This piece of code contains several assumptions. | |
2654 | * 1. This is for device Rx, therefor a cold page is preferred. | |
2655 | * 2. The expectation is the user wants a compound page. | |
2656 | * 3. If requesting a order 0 page it will not be compound | |
2657 | * due to the check to see if order has a value in prep_new_page | |
2658 | * 4. __GFP_MEMALLOC is ignored if __GFP_NOMEMALLOC is set due to | |
2659 | * code in gfp_to_alloc_flags that should be enforcing this. | |
2660 | */ | |
2661 | gfp_mask |= __GFP_COLD | __GFP_COMP | __GFP_MEMALLOC; | |
2662 | ||
2663 | return alloc_pages_node(NUMA_NO_NODE, gfp_mask, order); | |
2664 | } | |
2665 | ||
2666 | static inline struct page *dev_alloc_pages(unsigned int order) | |
2667 | { | |
95829b3a | 2668 | return __dev_alloc_pages(GFP_ATOMIC | __GFP_NOWARN, order); |
71dfda58 AD |
2669 | } |
2670 | ||
2671 | /** | |
2672 | * __dev_alloc_page - allocate a page for network Rx | |
2673 | * @gfp_mask: allocation priority. Set __GFP_NOMEMALLOC if not for network Rx | |
2674 | * | |
2675 | * Allocate a new page. | |
2676 | * | |
2677 | * %NULL is returned if there is no free memory. | |
2678 | */ | |
2679 | static inline struct page *__dev_alloc_page(gfp_t gfp_mask) | |
2680 | { | |
2681 | return __dev_alloc_pages(gfp_mask, 0); | |
2682 | } | |
2683 | ||
2684 | static inline struct page *dev_alloc_page(void) | |
2685 | { | |
95829b3a | 2686 | return dev_alloc_pages(0); |
71dfda58 AD |
2687 | } |
2688 | ||
0614002b MG |
2689 | /** |
2690 | * skb_propagate_pfmemalloc - Propagate pfmemalloc if skb is allocated after RX page | |
2691 | * @page: The page that was allocated from skb_alloc_page | |
2692 | * @skb: The skb that may need pfmemalloc set | |
2693 | */ | |
2694 | static inline void skb_propagate_pfmemalloc(struct page *page, | |
2695 | struct sk_buff *skb) | |
2696 | { | |
2f064f34 | 2697 | if (page_is_pfmemalloc(page)) |
0614002b MG |
2698 | skb->pfmemalloc = true; |
2699 | } | |
2700 | ||
131ea667 | 2701 | /** |
e227867f | 2702 | * skb_frag_page - retrieve the page referred to by a paged fragment |
131ea667 IC |
2703 | * @frag: the paged fragment |
2704 | * | |
2705 | * Returns the &struct page associated with @frag. | |
2706 | */ | |
2707 | static inline struct page *skb_frag_page(const skb_frag_t *frag) | |
2708 | { | |
a8605c60 | 2709 | return frag->page.p; |
131ea667 IC |
2710 | } |
2711 | ||
2712 | /** | |
2713 | * __skb_frag_ref - take an addition reference on a paged fragment. | |
2714 | * @frag: the paged fragment | |
2715 | * | |
2716 | * Takes an additional reference on the paged fragment @frag. | |
2717 | */ | |
2718 | static inline void __skb_frag_ref(skb_frag_t *frag) | |
2719 | { | |
2720 | get_page(skb_frag_page(frag)); | |
2721 | } | |
2722 | ||
2723 | /** | |
2724 | * skb_frag_ref - take an addition reference on a paged fragment of an skb. | |
2725 | * @skb: the buffer | |
2726 | * @f: the fragment offset. | |
2727 | * | |
2728 | * Takes an additional reference on the @f'th paged fragment of @skb. | |
2729 | */ | |
2730 | static inline void skb_frag_ref(struct sk_buff *skb, int f) | |
2731 | { | |
2732 | __skb_frag_ref(&skb_shinfo(skb)->frags[f]); | |
2733 | } | |
2734 | ||
2735 | /** | |
2736 | * __skb_frag_unref - release a reference on a paged fragment. | |
2737 | * @frag: the paged fragment | |
2738 | * | |
2739 | * Releases a reference on the paged fragment @frag. | |
2740 | */ | |
2741 | static inline void __skb_frag_unref(skb_frag_t *frag) | |
2742 | { | |
2743 | put_page(skb_frag_page(frag)); | |
2744 | } | |
2745 | ||
2746 | /** | |
2747 | * skb_frag_unref - release a reference on a paged fragment of an skb. | |
2748 | * @skb: the buffer | |
2749 | * @f: the fragment offset | |
2750 | * | |
2751 | * Releases a reference on the @f'th paged fragment of @skb. | |
2752 | */ | |
2753 | static inline void skb_frag_unref(struct sk_buff *skb, int f) | |
2754 | { | |
2755 | __skb_frag_unref(&skb_shinfo(skb)->frags[f]); | |
2756 | } | |
2757 | ||
2758 | /** | |
2759 | * skb_frag_address - gets the address of the data contained in a paged fragment | |
2760 | * @frag: the paged fragment buffer | |
2761 | * | |
2762 | * Returns the address of the data within @frag. The page must already | |
2763 | * be mapped. | |
2764 | */ | |
2765 | static inline void *skb_frag_address(const skb_frag_t *frag) | |
2766 | { | |
2767 | return page_address(skb_frag_page(frag)) + frag->page_offset; | |
2768 | } | |
2769 | ||
2770 | /** | |
2771 | * skb_frag_address_safe - gets the address of the data contained in a paged fragment | |
2772 | * @frag: the paged fragment buffer | |
2773 | * | |
2774 | * Returns the address of the data within @frag. Checks that the page | |
2775 | * is mapped and returns %NULL otherwise. | |
2776 | */ | |
2777 | static inline void *skb_frag_address_safe(const skb_frag_t *frag) | |
2778 | { | |
2779 | void *ptr = page_address(skb_frag_page(frag)); | |
2780 | if (unlikely(!ptr)) | |
2781 | return NULL; | |
2782 | ||
2783 | return ptr + frag->page_offset; | |
2784 | } | |
2785 | ||
2786 | /** | |
2787 | * __skb_frag_set_page - sets the page contained in a paged fragment | |
2788 | * @frag: the paged fragment | |
2789 | * @page: the page to set | |
2790 | * | |
2791 | * Sets the fragment @frag to contain @page. | |
2792 | */ | |
2793 | static inline void __skb_frag_set_page(skb_frag_t *frag, struct page *page) | |
2794 | { | |
a8605c60 | 2795 | frag->page.p = page; |
131ea667 IC |
2796 | } |
2797 | ||
2798 | /** | |
2799 | * skb_frag_set_page - sets the page contained in a paged fragment of an skb | |
2800 | * @skb: the buffer | |
2801 | * @f: the fragment offset | |
2802 | * @page: the page to set | |
2803 | * | |
2804 | * Sets the @f'th fragment of @skb to contain @page. | |
2805 | */ | |
2806 | static inline void skb_frag_set_page(struct sk_buff *skb, int f, | |
2807 | struct page *page) | |
2808 | { | |
2809 | __skb_frag_set_page(&skb_shinfo(skb)->frags[f], page); | |
2810 | } | |
2811 | ||
400dfd3a ED |
2812 | bool skb_page_frag_refill(unsigned int sz, struct page_frag *pfrag, gfp_t prio); |
2813 | ||
131ea667 IC |
2814 | /** |
2815 | * skb_frag_dma_map - maps a paged fragment via the DMA API | |
f83347df | 2816 | * @dev: the device to map the fragment to |
131ea667 IC |
2817 | * @frag: the paged fragment to map |
2818 | * @offset: the offset within the fragment (starting at the | |
2819 | * fragment's own offset) | |
2820 | * @size: the number of bytes to map | |
771b00a8 | 2821 | * @dir: the direction of the mapping (``PCI_DMA_*``) |
131ea667 IC |
2822 | * |
2823 | * Maps the page associated with @frag to @device. | |
2824 | */ | |
2825 | static inline dma_addr_t skb_frag_dma_map(struct device *dev, | |
2826 | const skb_frag_t *frag, | |
2827 | size_t offset, size_t size, | |
2828 | enum dma_data_direction dir) | |
2829 | { | |
2830 | return dma_map_page(dev, skb_frag_page(frag), | |
2831 | frag->page_offset + offset, size, dir); | |
2832 | } | |
2833 | ||
117632e6 ED |
2834 | static inline struct sk_buff *pskb_copy(struct sk_buff *skb, |
2835 | gfp_t gfp_mask) | |
2836 | { | |
2837 | return __pskb_copy(skb, skb_headroom(skb), gfp_mask); | |
2838 | } | |
2839 | ||
bad93e9d OP |
2840 | |
2841 | static inline struct sk_buff *pskb_copy_for_clone(struct sk_buff *skb, | |
2842 | gfp_t gfp_mask) | |
2843 | { | |
2844 | return __pskb_copy_fclone(skb, skb_headroom(skb), gfp_mask, true); | |
2845 | } | |
2846 | ||
2847 | ||
334a8132 PM |
2848 | /** |
2849 | * skb_clone_writable - is the header of a clone writable | |
2850 | * @skb: buffer to check | |
2851 | * @len: length up to which to write | |
2852 | * | |
2853 | * Returns true if modifying the header part of the cloned buffer | |
2854 | * does not requires the data to be copied. | |
2855 | */ | |
05bdd2f1 | 2856 | static inline int skb_clone_writable(const struct sk_buff *skb, unsigned int len) |
334a8132 PM |
2857 | { |
2858 | return !skb_header_cloned(skb) && | |
2859 | skb_headroom(skb) + len <= skb->hdr_len; | |
2860 | } | |
2861 | ||
3697649f DB |
2862 | static inline int skb_try_make_writable(struct sk_buff *skb, |
2863 | unsigned int write_len) | |
2864 | { | |
2865 | return skb_cloned(skb) && !skb_clone_writable(skb, write_len) && | |
2866 | pskb_expand_head(skb, 0, 0, GFP_ATOMIC); | |
2867 | } | |
2868 | ||
d9cc2048 HX |
2869 | static inline int __skb_cow(struct sk_buff *skb, unsigned int headroom, |
2870 | int cloned) | |
2871 | { | |
2872 | int delta = 0; | |
2873 | ||
d9cc2048 HX |
2874 | if (headroom > skb_headroom(skb)) |
2875 | delta = headroom - skb_headroom(skb); | |
2876 | ||
2877 | if (delta || cloned) | |
2878 | return pskb_expand_head(skb, ALIGN(delta, NET_SKB_PAD), 0, | |
2879 | GFP_ATOMIC); | |
2880 | return 0; | |
2881 | } | |
2882 | ||
1da177e4 LT |
2883 | /** |
2884 | * skb_cow - copy header of skb when it is required | |
2885 | * @skb: buffer to cow | |
2886 | * @headroom: needed headroom | |
2887 | * | |
2888 | * If the skb passed lacks sufficient headroom or its data part | |
2889 | * is shared, data is reallocated. If reallocation fails, an error | |
2890 | * is returned and original skb is not changed. | |
2891 | * | |
2892 | * The result is skb with writable area skb->head...skb->tail | |
2893 | * and at least @headroom of space at head. | |
2894 | */ | |
2895 | static inline int skb_cow(struct sk_buff *skb, unsigned int headroom) | |
2896 | { | |
d9cc2048 HX |
2897 | return __skb_cow(skb, headroom, skb_cloned(skb)); |
2898 | } | |
1da177e4 | 2899 | |
d9cc2048 HX |
2900 | /** |
2901 | * skb_cow_head - skb_cow but only making the head writable | |
2902 | * @skb: buffer to cow | |
2903 | * @headroom: needed headroom | |
2904 | * | |
2905 | * This function is identical to skb_cow except that we replace the | |
2906 | * skb_cloned check by skb_header_cloned. It should be used when | |
2907 | * you only need to push on some header and do not need to modify | |
2908 | * the data. | |
2909 | */ | |
2910 | static inline int skb_cow_head(struct sk_buff *skb, unsigned int headroom) | |
2911 | { | |
2912 | return __skb_cow(skb, headroom, skb_header_cloned(skb)); | |
1da177e4 LT |
2913 | } |
2914 | ||
2915 | /** | |
2916 | * skb_padto - pad an skbuff up to a minimal size | |
2917 | * @skb: buffer to pad | |
2918 | * @len: minimal length | |
2919 | * | |
2920 | * Pads up a buffer to ensure the trailing bytes exist and are | |
2921 | * blanked. If the buffer already contains sufficient data it | |
5b057c6b HX |
2922 | * is untouched. Otherwise it is extended. Returns zero on |
2923 | * success. The skb is freed on error. | |
1da177e4 | 2924 | */ |
5b057c6b | 2925 | static inline int skb_padto(struct sk_buff *skb, unsigned int len) |
1da177e4 LT |
2926 | { |
2927 | unsigned int size = skb->len; | |
2928 | if (likely(size >= len)) | |
5b057c6b | 2929 | return 0; |
987c402a | 2930 | return skb_pad(skb, len - size); |
1da177e4 LT |
2931 | } |
2932 | ||
9c0c1124 AD |
2933 | /** |
2934 | * skb_put_padto - increase size and pad an skbuff up to a minimal size | |
2935 | * @skb: buffer to pad | |
2936 | * @len: minimal length | |
cd0a137a | 2937 | * @free_on_error: free buffer on error |
9c0c1124 AD |
2938 | * |
2939 | * Pads up a buffer to ensure the trailing bytes exist and are | |
2940 | * blanked. If the buffer already contains sufficient data it | |
2941 | * is untouched. Otherwise it is extended. Returns zero on | |
cd0a137a | 2942 | * success. The skb is freed on error if @free_on_error is true. |
9c0c1124 | 2943 | */ |
cd0a137a FF |
2944 | static inline int __skb_put_padto(struct sk_buff *skb, unsigned int len, |
2945 | bool free_on_error) | |
9c0c1124 AD |
2946 | { |
2947 | unsigned int size = skb->len; | |
2948 | ||
2949 | if (unlikely(size < len)) { | |
2950 | len -= size; | |
cd0a137a | 2951 | if (__skb_pad(skb, len, free_on_error)) |
9c0c1124 AD |
2952 | return -ENOMEM; |
2953 | __skb_put(skb, len); | |
2954 | } | |
2955 | return 0; | |
2956 | } | |
2957 | ||
cd0a137a FF |
2958 | /** |
2959 | * skb_put_padto - increase size and pad an skbuff up to a minimal size | |
2960 | * @skb: buffer to pad | |
2961 | * @len: minimal length | |
2962 | * | |
2963 | * Pads up a buffer to ensure the trailing bytes exist and are | |
2964 | * blanked. If the buffer already contains sufficient data it | |
2965 | * is untouched. Otherwise it is extended. Returns zero on | |
2966 | * success. The skb is freed on error. | |
2967 | */ | |
2968 | static inline int skb_put_padto(struct sk_buff *skb, unsigned int len) | |
2969 | { | |
2970 | return __skb_put_padto(skb, len, true); | |
2971 | } | |
2972 | ||
1da177e4 | 2973 | static inline int skb_add_data(struct sk_buff *skb, |
af2b040e | 2974 | struct iov_iter *from, int copy) |
1da177e4 LT |
2975 | { |
2976 | const int off = skb->len; | |
2977 | ||
2978 | if (skb->ip_summed == CHECKSUM_NONE) { | |
af2b040e | 2979 | __wsum csum = 0; |
15e6cb46 AV |
2980 | if (csum_and_copy_from_iter_full(skb_put(skb, copy), copy, |
2981 | &csum, from)) { | |
1da177e4 LT |
2982 | skb->csum = csum_block_add(skb->csum, csum, off); |
2983 | return 0; | |
2984 | } | |
15e6cb46 | 2985 | } else if (copy_from_iter_full(skb_put(skb, copy), copy, from)) |
1da177e4 LT |
2986 | return 0; |
2987 | ||
2988 | __skb_trim(skb, off); | |
2989 | return -EFAULT; | |
2990 | } | |
2991 | ||
38ba0a65 ED |
2992 | static inline bool skb_can_coalesce(struct sk_buff *skb, int i, |
2993 | const struct page *page, int off) | |
1da177e4 | 2994 | { |
1f8b977a WB |
2995 | if (skb_zcopy(skb)) |
2996 | return false; | |
1da177e4 | 2997 | if (i) { |
9e903e08 | 2998 | const struct skb_frag_struct *frag = &skb_shinfo(skb)->frags[i - 1]; |
1da177e4 | 2999 | |
ea2ab693 | 3000 | return page == skb_frag_page(frag) && |
9e903e08 | 3001 | off == frag->page_offset + skb_frag_size(frag); |
1da177e4 | 3002 | } |
38ba0a65 | 3003 | return false; |
1da177e4 LT |
3004 | } |
3005 | ||
364c6bad HX |
3006 | static inline int __skb_linearize(struct sk_buff *skb) |
3007 | { | |
3008 | return __pskb_pull_tail(skb, skb->data_len) ? 0 : -ENOMEM; | |
3009 | } | |
3010 | ||
1da177e4 LT |
3011 | /** |
3012 | * skb_linearize - convert paged skb to linear one | |
3013 | * @skb: buffer to linarize | |
1da177e4 LT |
3014 | * |
3015 | * If there is no free memory -ENOMEM is returned, otherwise zero | |
3016 | * is returned and the old skb data released. | |
3017 | */ | |
364c6bad HX |
3018 | static inline int skb_linearize(struct sk_buff *skb) |
3019 | { | |
3020 | return skb_is_nonlinear(skb) ? __skb_linearize(skb) : 0; | |
3021 | } | |
3022 | ||
cef401de ED |
3023 | /** |
3024 | * skb_has_shared_frag - can any frag be overwritten | |
3025 | * @skb: buffer to test | |
3026 | * | |
3027 | * Return true if the skb has at least one frag that might be modified | |
3028 | * by an external entity (as in vmsplice()/sendfile()) | |
3029 | */ | |
3030 | static inline bool skb_has_shared_frag(const struct sk_buff *skb) | |
3031 | { | |
c9af6db4 PS |
3032 | return skb_is_nonlinear(skb) && |
3033 | skb_shinfo(skb)->tx_flags & SKBTX_SHARED_FRAG; | |
cef401de ED |
3034 | } |
3035 | ||
364c6bad HX |
3036 | /** |
3037 | * skb_linearize_cow - make sure skb is linear and writable | |
3038 | * @skb: buffer to process | |
3039 | * | |
3040 | * If there is no free memory -ENOMEM is returned, otherwise zero | |
3041 | * is returned and the old skb data released. | |
3042 | */ | |
3043 | static inline int skb_linearize_cow(struct sk_buff *skb) | |
1da177e4 | 3044 | { |
364c6bad HX |
3045 | return skb_is_nonlinear(skb) || skb_cloned(skb) ? |
3046 | __skb_linearize(skb) : 0; | |
1da177e4 LT |
3047 | } |
3048 | ||
479ffccc DB |
3049 | static __always_inline void |
3050 | __skb_postpull_rcsum(struct sk_buff *skb, const void *start, unsigned int len, | |
3051 | unsigned int off) | |
3052 | { | |
3053 | if (skb->ip_summed == CHECKSUM_COMPLETE) | |
3054 | skb->csum = csum_block_sub(skb->csum, | |
3055 | csum_partial(start, len, 0), off); | |
3056 | else if (skb->ip_summed == CHECKSUM_PARTIAL && | |
3057 | skb_checksum_start_offset(skb) < 0) | |
3058 | skb->ip_summed = CHECKSUM_NONE; | |
3059 | } | |
3060 | ||
1da177e4 LT |
3061 | /** |
3062 | * skb_postpull_rcsum - update checksum for received skb after pull | |
3063 | * @skb: buffer to update | |
3064 | * @start: start of data before pull | |
3065 | * @len: length of data pulled | |
3066 | * | |
3067 | * After doing a pull on a received packet, you need to call this to | |
84fa7933 PM |
3068 | * update the CHECKSUM_COMPLETE checksum, or set ip_summed to |
3069 | * CHECKSUM_NONE so that it can be recomputed from scratch. | |
1da177e4 | 3070 | */ |
1da177e4 | 3071 | static inline void skb_postpull_rcsum(struct sk_buff *skb, |
cbb042f9 | 3072 | const void *start, unsigned int len) |
1da177e4 | 3073 | { |
479ffccc | 3074 | __skb_postpull_rcsum(skb, start, len, 0); |
1da177e4 LT |
3075 | } |
3076 | ||
479ffccc DB |
3077 | static __always_inline void |
3078 | __skb_postpush_rcsum(struct sk_buff *skb, const void *start, unsigned int len, | |
3079 | unsigned int off) | |
3080 | { | |
3081 | if (skb->ip_summed == CHECKSUM_COMPLETE) | |
3082 | skb->csum = csum_block_add(skb->csum, | |
3083 | csum_partial(start, len, 0), off); | |
3084 | } | |
cbb042f9 | 3085 | |
479ffccc DB |
3086 | /** |
3087 | * skb_postpush_rcsum - update checksum for received skb after push | |
3088 | * @skb: buffer to update | |
3089 | * @start: start of data after push | |
3090 | * @len: length of data pushed | |
3091 | * | |
3092 | * After doing a push on a received packet, you need to call this to | |
3093 | * update the CHECKSUM_COMPLETE checksum. | |
3094 | */ | |
f8ffad69 DB |
3095 | static inline void skb_postpush_rcsum(struct sk_buff *skb, |
3096 | const void *start, unsigned int len) | |
3097 | { | |
479ffccc | 3098 | __skb_postpush_rcsum(skb, start, len, 0); |
f8ffad69 DB |
3099 | } |
3100 | ||
af72868b | 3101 | void *skb_pull_rcsum(struct sk_buff *skb, unsigned int len); |
479ffccc | 3102 | |
82a31b92 WC |
3103 | /** |
3104 | * skb_push_rcsum - push skb and update receive checksum | |
3105 | * @skb: buffer to update | |
3106 | * @len: length of data pulled | |
3107 | * | |
3108 | * This function performs an skb_push on the packet and updates | |
3109 | * the CHECKSUM_COMPLETE checksum. It should be used on | |
3110 | * receive path processing instead of skb_push unless you know | |
3111 | * that the checksum difference is zero (e.g., a valid IP header) | |
3112 | * or you are setting ip_summed to CHECKSUM_NONE. | |
3113 | */ | |
d58ff351 | 3114 | static inline void *skb_push_rcsum(struct sk_buff *skb, unsigned int len) |
82a31b92 WC |
3115 | { |
3116 | skb_push(skb, len); | |
3117 | skb_postpush_rcsum(skb, skb->data, len); | |
3118 | return skb->data; | |
3119 | } | |
3120 | ||
7ce5a27f DM |
3121 | /** |
3122 | * pskb_trim_rcsum - trim received skb and update checksum | |
3123 | * @skb: buffer to trim | |
3124 | * @len: new length | |
3125 | * | |
3126 | * This is exactly the same as pskb_trim except that it ensures the | |
3127 | * checksum of received packets are still valid after the operation. | |
3128 | */ | |
3129 | ||
3130 | static inline int pskb_trim_rcsum(struct sk_buff *skb, unsigned int len) | |
3131 | { | |
3132 | if (likely(len >= skb->len)) | |
3133 | return 0; | |
3134 | if (skb->ip_summed == CHECKSUM_COMPLETE) | |
3135 | skb->ip_summed = CHECKSUM_NONE; | |
3136 | return __pskb_trim(skb, len); | |
3137 | } | |
3138 | ||
5293efe6 DB |
3139 | static inline int __skb_trim_rcsum(struct sk_buff *skb, unsigned int len) |
3140 | { | |
3141 | if (skb->ip_summed == CHECKSUM_COMPLETE) | |
3142 | skb->ip_summed = CHECKSUM_NONE; | |
3143 | __skb_trim(skb, len); | |
3144 | return 0; | |
3145 | } | |
3146 | ||
3147 | static inline int __skb_grow_rcsum(struct sk_buff *skb, unsigned int len) | |
3148 | { | |
3149 | if (skb->ip_summed == CHECKSUM_COMPLETE) | |
3150 | skb->ip_summed = CHECKSUM_NONE; | |
3151 | return __skb_grow(skb, len); | |
3152 | } | |
3153 | ||
1da177e4 LT |
3154 | #define skb_queue_walk(queue, skb) \ |
3155 | for (skb = (queue)->next; \ | |
a1e4891f | 3156 | skb != (struct sk_buff *)(queue); \ |
1da177e4 LT |
3157 | skb = skb->next) |
3158 | ||
46f8914e JC |
3159 | #define skb_queue_walk_safe(queue, skb, tmp) \ |
3160 | for (skb = (queue)->next, tmp = skb->next; \ | |
3161 | skb != (struct sk_buff *)(queue); \ | |
3162 | skb = tmp, tmp = skb->next) | |
3163 | ||
1164f52a | 3164 | #define skb_queue_walk_from(queue, skb) \ |
a1e4891f | 3165 | for (; skb != (struct sk_buff *)(queue); \ |
1164f52a DM |
3166 | skb = skb->next) |
3167 | ||
3168 | #define skb_queue_walk_from_safe(queue, skb, tmp) \ | |
3169 | for (tmp = skb->next; \ | |
3170 | skb != (struct sk_buff *)(queue); \ | |
3171 | skb = tmp, tmp = skb->next) | |
3172 | ||
300ce174 SH |
3173 | #define skb_queue_reverse_walk(queue, skb) \ |
3174 | for (skb = (queue)->prev; \ | |
a1e4891f | 3175 | skb != (struct sk_buff *)(queue); \ |
300ce174 SH |
3176 | skb = skb->prev) |
3177 | ||
686a2955 DM |
3178 | #define skb_queue_reverse_walk_safe(queue, skb, tmp) \ |
3179 | for (skb = (queue)->prev, tmp = skb->prev; \ | |
3180 | skb != (struct sk_buff *)(queue); \ | |
3181 | skb = tmp, tmp = skb->prev) | |
3182 | ||
3183 | #define skb_queue_reverse_walk_from_safe(queue, skb, tmp) \ | |
3184 | for (tmp = skb->prev; \ | |
3185 | skb != (struct sk_buff *)(queue); \ | |
3186 | skb = tmp, tmp = skb->prev) | |
1da177e4 | 3187 | |
21dc3301 | 3188 | static inline bool skb_has_frag_list(const struct sk_buff *skb) |
ee039871 DM |
3189 | { |
3190 | return skb_shinfo(skb)->frag_list != NULL; | |
3191 | } | |
3192 | ||
3193 | static inline void skb_frag_list_init(struct sk_buff *skb) | |
3194 | { | |
3195 | skb_shinfo(skb)->frag_list = NULL; | |
3196 | } | |
3197 | ||
ee039871 DM |
3198 | #define skb_walk_frags(skb, iter) \ |
3199 | for (iter = skb_shinfo(skb)->frag_list; iter; iter = iter->next) | |
3200 | ||
ea3793ee RW |
3201 | |
3202 | int __skb_wait_for_more_packets(struct sock *sk, int *err, long *timeo_p, | |
3203 | const struct sk_buff *skb); | |
65101aec PA |
3204 | struct sk_buff *__skb_try_recv_from_queue(struct sock *sk, |
3205 | struct sk_buff_head *queue, | |
3206 | unsigned int flags, | |
3207 | void (*destructor)(struct sock *sk, | |
3208 | struct sk_buff *skb), | |
3209 | int *peeked, int *off, int *err, | |
3210 | struct sk_buff **last); | |
ea3793ee | 3211 | struct sk_buff *__skb_try_recv_datagram(struct sock *sk, unsigned flags, |
7c13f97f PA |
3212 | void (*destructor)(struct sock *sk, |
3213 | struct sk_buff *skb), | |
ea3793ee RW |
3214 | int *peeked, int *off, int *err, |
3215 | struct sk_buff **last); | |
7965bd4d | 3216 | struct sk_buff *__skb_recv_datagram(struct sock *sk, unsigned flags, |
7c13f97f PA |
3217 | void (*destructor)(struct sock *sk, |
3218 | struct sk_buff *skb), | |
7965bd4d JP |
3219 | int *peeked, int *off, int *err); |
3220 | struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags, int noblock, | |
3221 | int *err); | |
3222 | unsigned int datagram_poll(struct file *file, struct socket *sock, | |
3223 | struct poll_table_struct *wait); | |
c0371da6 AV |
3224 | int skb_copy_datagram_iter(const struct sk_buff *from, int offset, |
3225 | struct iov_iter *to, int size); | |
51f3d02b DM |
3226 | static inline int skb_copy_datagram_msg(const struct sk_buff *from, int offset, |
3227 | struct msghdr *msg, int size) | |
3228 | { | |
e5a4b0bb | 3229 | return skb_copy_datagram_iter(from, offset, &msg->msg_iter, size); |
227158db | 3230 | } |
e5a4b0bb AV |
3231 | int skb_copy_and_csum_datagram_msg(struct sk_buff *skb, int hlen, |
3232 | struct msghdr *msg); | |
3a654f97 AV |
3233 | int skb_copy_datagram_from_iter(struct sk_buff *skb, int offset, |
3234 | struct iov_iter *from, int len); | |
3a654f97 | 3235 | int zerocopy_sg_from_iter(struct sk_buff *skb, struct iov_iter *frm); |
7965bd4d | 3236 | void skb_free_datagram(struct sock *sk, struct sk_buff *skb); |
627d2d6b | 3237 | void __skb_free_datagram_locked(struct sock *sk, struct sk_buff *skb, int len); |
3238 | static inline void skb_free_datagram_locked(struct sock *sk, | |
3239 | struct sk_buff *skb) | |
3240 | { | |
3241 | __skb_free_datagram_locked(sk, skb, 0); | |
3242 | } | |
7965bd4d | 3243 | int skb_kill_datagram(struct sock *sk, struct sk_buff *skb, unsigned int flags); |
7965bd4d JP |
3244 | int skb_copy_bits(const struct sk_buff *skb, int offset, void *to, int len); |
3245 | int skb_store_bits(struct sk_buff *skb, int offset, const void *from, int len); | |
3246 | __wsum skb_copy_and_csum_bits(const struct sk_buff *skb, int offset, u8 *to, | |
3247 | int len, __wsum csum); | |
a60e3cc7 | 3248 | int skb_splice_bits(struct sk_buff *skb, struct sock *sk, unsigned int offset, |
7965bd4d | 3249 | struct pipe_inode_info *pipe, unsigned int len, |
25869262 | 3250 | unsigned int flags); |
20bf50de TH |
3251 | int skb_send_sock_locked(struct sock *sk, struct sk_buff *skb, int offset, |
3252 | int len); | |
3253 | int skb_send_sock(struct sock *sk, struct sk_buff *skb, int offset, int len); | |
7965bd4d | 3254 | void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to); |
af2806f8 | 3255 | unsigned int skb_zerocopy_headlen(const struct sk_buff *from); |
36d5fe6a ZK |
3256 | int skb_zerocopy(struct sk_buff *to, struct sk_buff *from, |
3257 | int len, int hlen); | |
7965bd4d JP |
3258 | void skb_split(struct sk_buff *skb, struct sk_buff *skb1, const u32 len); |
3259 | int skb_shift(struct sk_buff *tgt, struct sk_buff *skb, int shiftlen); | |
3260 | void skb_scrub_packet(struct sk_buff *skb, bool xnet); | |
de960aa9 | 3261 | unsigned int skb_gso_transport_seglen(const struct sk_buff *skb); |
ae7ef81e | 3262 | bool skb_gso_validate_mtu(const struct sk_buff *skb, unsigned int mtu); |
7965bd4d | 3263 | struct sk_buff *skb_segment(struct sk_buff *skb, netdev_features_t features); |
0d5501c1 | 3264 | struct sk_buff *skb_vlan_untag(struct sk_buff *skb); |
e2195121 | 3265 | int skb_ensure_writable(struct sk_buff *skb, int write_len); |
bfca4c52 | 3266 | int __skb_vlan_pop(struct sk_buff *skb, u16 *vlan_tci); |
93515d53 JP |
3267 | int skb_vlan_pop(struct sk_buff *skb); |
3268 | int skb_vlan_push(struct sk_buff *skb, __be16 vlan_proto, u16 vlan_tci); | |
6fa01ccd SV |
3269 | struct sk_buff *pskb_extract(struct sk_buff *skb, int off, int to_copy, |
3270 | gfp_t gfp); | |
20380731 | 3271 | |
6ce8e9ce AV |
3272 | static inline int memcpy_from_msg(void *data, struct msghdr *msg, int len) |
3273 | { | |
3073f070 | 3274 | return copy_from_iter_full(data, len, &msg->msg_iter) ? 0 : -EFAULT; |
6ce8e9ce AV |
3275 | } |
3276 | ||
7eab8d9e AV |
3277 | static inline int memcpy_to_msg(struct msghdr *msg, void *data, int len) |
3278 | { | |
e5a4b0bb | 3279 | return copy_to_iter(data, len, &msg->msg_iter) == len ? 0 : -EFAULT; |
7eab8d9e AV |
3280 | } |
3281 | ||
2817a336 DB |
3282 | struct skb_checksum_ops { |
3283 | __wsum (*update)(const void *mem, int len, __wsum wsum); | |
3284 | __wsum (*combine)(__wsum csum, __wsum csum2, int offset, int len); | |
3285 | }; | |
3286 | ||
9617813d DC |
3287 | extern const struct skb_checksum_ops *crc32c_csum_stub __read_mostly; |
3288 | ||
2817a336 DB |
3289 | __wsum __skb_checksum(const struct sk_buff *skb, int offset, int len, |
3290 | __wsum csum, const struct skb_checksum_ops *ops); | |
3291 | __wsum skb_checksum(const struct sk_buff *skb, int offset, int len, | |
3292 | __wsum csum); | |
3293 | ||
1e98a0f0 ED |
3294 | static inline void * __must_check |
3295 | __skb_header_pointer(const struct sk_buff *skb, int offset, | |
3296 | int len, void *data, int hlen, void *buffer) | |
1da177e4 | 3297 | { |
55820ee2 | 3298 | if (hlen - offset >= len) |
690e36e7 | 3299 | return data + offset; |
1da177e4 | 3300 | |
690e36e7 DM |
3301 | if (!skb || |
3302 | skb_copy_bits(skb, offset, buffer, len) < 0) | |
1da177e4 LT |
3303 | return NULL; |
3304 | ||
3305 | return buffer; | |
3306 | } | |
3307 | ||
1e98a0f0 ED |
3308 | static inline void * __must_check |
3309 | skb_header_pointer(const struct sk_buff *skb, int offset, int len, void *buffer) | |
690e36e7 DM |
3310 | { |
3311 | return __skb_header_pointer(skb, offset, len, skb->data, | |
3312 | skb_headlen(skb), buffer); | |
3313 | } | |
3314 | ||
4262e5cc DB |
3315 | /** |
3316 | * skb_needs_linearize - check if we need to linearize a given skb | |
3317 | * depending on the given device features. | |
3318 | * @skb: socket buffer to check | |
3319 | * @features: net device features | |
3320 | * | |
3321 | * Returns true if either: | |
3322 | * 1. skb has frag_list and the device doesn't support FRAGLIST, or | |
3323 | * 2. skb is fragmented and the device does not support SG. | |
3324 | */ | |
3325 | static inline bool skb_needs_linearize(struct sk_buff *skb, | |
3326 | netdev_features_t features) | |
3327 | { | |
3328 | return skb_is_nonlinear(skb) && | |
3329 | ((skb_has_frag_list(skb) && !(features & NETIF_F_FRAGLIST)) || | |
3330 | (skb_shinfo(skb)->nr_frags && !(features & NETIF_F_SG))); | |
3331 | } | |
3332 | ||
d626f62b ACM |
3333 | static inline void skb_copy_from_linear_data(const struct sk_buff *skb, |
3334 | void *to, | |
3335 | const unsigned int len) | |
3336 | { | |
3337 | memcpy(to, skb->data, len); | |
3338 | } | |
3339 | ||
3340 | static inline void skb_copy_from_linear_data_offset(const struct sk_buff *skb, | |
3341 | const int offset, void *to, | |
3342 | const unsigned int len) | |
3343 | { | |
3344 | memcpy(to, skb->data + offset, len); | |
3345 | } | |
3346 | ||
27d7ff46 ACM |
3347 | static inline void skb_copy_to_linear_data(struct sk_buff *skb, |
3348 | const void *from, | |
3349 | const unsigned int len) | |
3350 | { | |
3351 | memcpy(skb->data, from, len); | |
3352 | } | |
3353 | ||
3354 | static inline void skb_copy_to_linear_data_offset(struct sk_buff *skb, | |
3355 | const int offset, | |
3356 | const void *from, | |
3357 | const unsigned int len) | |
3358 | { | |
3359 | memcpy(skb->data + offset, from, len); | |
3360 | } | |
3361 | ||
7965bd4d | 3362 | void skb_init(void); |
1da177e4 | 3363 | |
ac45f602 PO |
3364 | static inline ktime_t skb_get_ktime(const struct sk_buff *skb) |
3365 | { | |
3366 | return skb->tstamp; | |
3367 | } | |
3368 | ||
a61bbcf2 PM |
3369 | /** |
3370 | * skb_get_timestamp - get timestamp from a skb | |
3371 | * @skb: skb to get stamp from | |
3372 | * @stamp: pointer to struct timeval to store stamp in | |
3373 | * | |
3374 | * Timestamps are stored in the skb as offsets to a base timestamp. | |
3375 | * This function converts the offset back to a struct timeval and stores | |
3376 | * it in stamp. | |
3377 | */ | |
ac45f602 PO |
3378 | static inline void skb_get_timestamp(const struct sk_buff *skb, |
3379 | struct timeval *stamp) | |
a61bbcf2 | 3380 | { |
b7aa0bf7 | 3381 | *stamp = ktime_to_timeval(skb->tstamp); |
a61bbcf2 PM |
3382 | } |
3383 | ||
ac45f602 PO |
3384 | static inline void skb_get_timestampns(const struct sk_buff *skb, |
3385 | struct timespec *stamp) | |
3386 | { | |
3387 | *stamp = ktime_to_timespec(skb->tstamp); | |
3388 | } | |
3389 | ||
b7aa0bf7 | 3390 | static inline void __net_timestamp(struct sk_buff *skb) |
a61bbcf2 | 3391 | { |
b7aa0bf7 | 3392 | skb->tstamp = ktime_get_real(); |
a61bbcf2 PM |
3393 | } |
3394 | ||
164891aa SH |
3395 | static inline ktime_t net_timedelta(ktime_t t) |
3396 | { | |
3397 | return ktime_sub(ktime_get_real(), t); | |
3398 | } | |
3399 | ||
b9ce204f IJ |
3400 | static inline ktime_t net_invalid_timestamp(void) |
3401 | { | |
8b0e1953 | 3402 | return 0; |
b9ce204f | 3403 | } |
a61bbcf2 | 3404 | |
de8f3a83 DB |
3405 | static inline u8 skb_metadata_len(const struct sk_buff *skb) |
3406 | { | |
3407 | return skb_shinfo(skb)->meta_len; | |
3408 | } | |
3409 | ||
3410 | static inline void *skb_metadata_end(const struct sk_buff *skb) | |
3411 | { | |
3412 | return skb_mac_header(skb); | |
3413 | } | |
3414 | ||
3415 | static inline bool __skb_metadata_differs(const struct sk_buff *skb_a, | |
3416 | const struct sk_buff *skb_b, | |
3417 | u8 meta_len) | |
3418 | { | |
3419 | const void *a = skb_metadata_end(skb_a); | |
3420 | const void *b = skb_metadata_end(skb_b); | |
3421 | /* Using more efficient varaiant than plain call to memcmp(). */ | |
3422 | #if defined(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) && BITS_PER_LONG == 64 | |
3423 | u64 diffs = 0; | |
3424 | ||
3425 | switch (meta_len) { | |
3426 | #define __it(x, op) (x -= sizeof(u##op)) | |
3427 | #define __it_diff(a, b, op) (*(u##op *)__it(a, op)) ^ (*(u##op *)__it(b, op)) | |
3428 | case 32: diffs |= __it_diff(a, b, 64); | |
3429 | case 24: diffs |= __it_diff(a, b, 64); | |
3430 | case 16: diffs |= __it_diff(a, b, 64); | |
3431 | case 8: diffs |= __it_diff(a, b, 64); | |
3432 | break; | |
3433 | case 28: diffs |= __it_diff(a, b, 64); | |
3434 | case 20: diffs |= __it_diff(a, b, 64); | |
3435 | case 12: diffs |= __it_diff(a, b, 64); | |
3436 | case 4: diffs |= __it_diff(a, b, 32); | |
3437 | break; | |
3438 | } | |
3439 | return diffs; | |
3440 | #else | |
3441 | return memcmp(a - meta_len, b - meta_len, meta_len); | |
3442 | #endif | |
3443 | } | |
3444 | ||
3445 | static inline bool skb_metadata_differs(const struct sk_buff *skb_a, | |
3446 | const struct sk_buff *skb_b) | |
3447 | { | |
3448 | u8 len_a = skb_metadata_len(skb_a); | |
3449 | u8 len_b = skb_metadata_len(skb_b); | |
3450 | ||
3451 | if (!(len_a | len_b)) | |
3452 | return false; | |
3453 | ||
3454 | return len_a != len_b ? | |
3455 | true : __skb_metadata_differs(skb_a, skb_b, len_a); | |
3456 | } | |
3457 | ||
3458 | static inline void skb_metadata_set(struct sk_buff *skb, u8 meta_len) | |
3459 | { | |
3460 | skb_shinfo(skb)->meta_len = meta_len; | |
3461 | } | |
3462 | ||
3463 | static inline void skb_metadata_clear(struct sk_buff *skb) | |
3464 | { | |
3465 | skb_metadata_set(skb, 0); | |
3466 | } | |
3467 | ||
62bccb8c AD |
3468 | struct sk_buff *skb_clone_sk(struct sk_buff *skb); |
3469 | ||
c1f19b51 RC |
3470 | #ifdef CONFIG_NETWORK_PHY_TIMESTAMPING |
3471 | ||
7965bd4d JP |
3472 | void skb_clone_tx_timestamp(struct sk_buff *skb); |
3473 | bool skb_defer_rx_timestamp(struct sk_buff *skb); | |
c1f19b51 RC |
3474 | |
3475 | #else /* CONFIG_NETWORK_PHY_TIMESTAMPING */ | |
3476 | ||
3477 | static inline void skb_clone_tx_timestamp(struct sk_buff *skb) | |
3478 | { | |
3479 | } | |
3480 | ||
3481 | static inline bool skb_defer_rx_timestamp(struct sk_buff *skb) | |
3482 | { | |
3483 | return false; | |
3484 | } | |
3485 | ||
3486 | #endif /* !CONFIG_NETWORK_PHY_TIMESTAMPING */ | |
3487 | ||
3488 | /** | |
3489 | * skb_complete_tx_timestamp() - deliver cloned skb with tx timestamps | |
3490 | * | |
da92b194 RC |
3491 | * PHY drivers may accept clones of transmitted packets for |
3492 | * timestamping via their phy_driver.txtstamp method. These drivers | |
7a76a021 BP |
3493 | * must call this function to return the skb back to the stack with a |
3494 | * timestamp. | |
da92b194 | 3495 | * |
c1f19b51 | 3496 | * @skb: clone of the the original outgoing packet |
7a76a021 | 3497 | * @hwtstamps: hardware time stamps |
c1f19b51 RC |
3498 | * |
3499 | */ | |
3500 | void skb_complete_tx_timestamp(struct sk_buff *skb, | |
3501 | struct skb_shared_hwtstamps *hwtstamps); | |
3502 | ||
e7fd2885 WB |
3503 | void __skb_tstamp_tx(struct sk_buff *orig_skb, |
3504 | struct skb_shared_hwtstamps *hwtstamps, | |
3505 | struct sock *sk, int tstype); | |
3506 | ||
ac45f602 PO |
3507 | /** |
3508 | * skb_tstamp_tx - queue clone of skb with send time stamps | |
3509 | * @orig_skb: the original outgoing packet | |
3510 | * @hwtstamps: hardware time stamps, may be NULL if not available | |
3511 | * | |
3512 | * If the skb has a socket associated, then this function clones the | |
3513 | * skb (thus sharing the actual data and optional structures), stores | |
3514 | * the optional hardware time stamping information (if non NULL) or | |
3515 | * generates a software time stamp (otherwise), then queues the clone | |
3516 | * to the error queue of the socket. Errors are silently ignored. | |
3517 | */ | |
7965bd4d JP |
3518 | void skb_tstamp_tx(struct sk_buff *orig_skb, |
3519 | struct skb_shared_hwtstamps *hwtstamps); | |
ac45f602 | 3520 | |
4507a715 RC |
3521 | /** |
3522 | * skb_tx_timestamp() - Driver hook for transmit timestamping | |
3523 | * | |
3524 | * Ethernet MAC Drivers should call this function in their hard_xmit() | |
4ff75b7c | 3525 | * function immediately before giving the sk_buff to the MAC hardware. |
4507a715 | 3526 | * |
73409f3b DM |
3527 | * Specifically, one should make absolutely sure that this function is |
3528 | * called before TX completion of this packet can trigger. Otherwise | |
3529 | * the packet could potentially already be freed. | |
3530 | * | |
4507a715 RC |
3531 | * @skb: A socket buffer. |
3532 | */ | |
3533 | static inline void skb_tx_timestamp(struct sk_buff *skb) | |
3534 | { | |
c1f19b51 | 3535 | skb_clone_tx_timestamp(skb); |
b50a5c70 ML |
3536 | if (skb_shinfo(skb)->tx_flags & SKBTX_SW_TSTAMP) |
3537 | skb_tstamp_tx(skb, NULL); | |
4507a715 RC |
3538 | } |
3539 | ||
6e3e939f JB |
3540 | /** |
3541 | * skb_complete_wifi_ack - deliver skb with wifi status | |
3542 | * | |
3543 | * @skb: the original outgoing packet | |
3544 | * @acked: ack status | |
3545 | * | |
3546 | */ | |
3547 | void skb_complete_wifi_ack(struct sk_buff *skb, bool acked); | |
3548 | ||
7965bd4d JP |
3549 | __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len); |
3550 | __sum16 __skb_checksum_complete(struct sk_buff *skb); | |
fb286bb2 | 3551 | |
60476372 HX |
3552 | static inline int skb_csum_unnecessary(const struct sk_buff *skb) |
3553 | { | |
6edec0e6 TH |
3554 | return ((skb->ip_summed == CHECKSUM_UNNECESSARY) || |
3555 | skb->csum_valid || | |
3556 | (skb->ip_summed == CHECKSUM_PARTIAL && | |
3557 | skb_checksum_start_offset(skb) >= 0)); | |
60476372 HX |
3558 | } |
3559 | ||
fb286bb2 HX |
3560 | /** |
3561 | * skb_checksum_complete - Calculate checksum of an entire packet | |
3562 | * @skb: packet to process | |
3563 | * | |
3564 | * This function calculates the checksum over the entire packet plus | |
3565 | * the value of skb->csum. The latter can be used to supply the | |
3566 | * checksum of a pseudo header as used by TCP/UDP. It returns the | |
3567 | * checksum. | |
3568 | * | |
3569 | * For protocols that contain complete checksums such as ICMP/TCP/UDP, | |
3570 | * this function can be used to verify that checksum on received | |
3571 | * packets. In that case the function should return zero if the | |
3572 | * checksum is correct. In particular, this function will return zero | |
3573 | * if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the | |
3574 | * hardware has already verified the correctness of the checksum. | |
3575 | */ | |
4381ca3c | 3576 | static inline __sum16 skb_checksum_complete(struct sk_buff *skb) |
fb286bb2 | 3577 | { |
60476372 HX |
3578 | return skb_csum_unnecessary(skb) ? |
3579 | 0 : __skb_checksum_complete(skb); | |
fb286bb2 HX |
3580 | } |
3581 | ||
77cffe23 TH |
3582 | static inline void __skb_decr_checksum_unnecessary(struct sk_buff *skb) |
3583 | { | |
3584 | if (skb->ip_summed == CHECKSUM_UNNECESSARY) { | |
3585 | if (skb->csum_level == 0) | |
3586 | skb->ip_summed = CHECKSUM_NONE; | |
3587 | else | |
3588 | skb->csum_level--; | |
3589 | } | |
3590 | } | |
3591 | ||
3592 | static inline void __skb_incr_checksum_unnecessary(struct sk_buff *skb) | |
3593 | { | |
3594 | if (skb->ip_summed == CHECKSUM_UNNECESSARY) { | |
3595 | if (skb->csum_level < SKB_MAX_CSUM_LEVEL) | |
3596 | skb->csum_level++; | |
3597 | } else if (skb->ip_summed == CHECKSUM_NONE) { | |
3598 | skb->ip_summed = CHECKSUM_UNNECESSARY; | |
3599 | skb->csum_level = 0; | |
3600 | } | |
3601 | } | |
3602 | ||
76ba0aae TH |
3603 | /* Check if we need to perform checksum complete validation. |
3604 | * | |
3605 | * Returns true if checksum complete is needed, false otherwise | |
3606 | * (either checksum is unnecessary or zero checksum is allowed). | |
3607 | */ | |
3608 | static inline bool __skb_checksum_validate_needed(struct sk_buff *skb, | |
3609 | bool zero_okay, | |
3610 | __sum16 check) | |
3611 | { | |
5d0c2b95 TH |
3612 | if (skb_csum_unnecessary(skb) || (zero_okay && !check)) { |
3613 | skb->csum_valid = 1; | |
77cffe23 | 3614 | __skb_decr_checksum_unnecessary(skb); |
76ba0aae TH |
3615 | return false; |
3616 | } | |
3617 | ||
3618 | return true; | |
3619 | } | |
3620 | ||
3621 | /* For small packets <= CHECKSUM_BREAK peform checksum complete directly | |
3622 | * in checksum_init. | |
3623 | */ | |
3624 | #define CHECKSUM_BREAK 76 | |
3625 | ||
4e18b9ad TH |
3626 | /* Unset checksum-complete |
3627 | * | |
3628 | * Unset checksum complete can be done when packet is being modified | |
3629 | * (uncompressed for instance) and checksum-complete value is | |
3630 | * invalidated. | |
3631 | */ | |
3632 | static inline void skb_checksum_complete_unset(struct sk_buff *skb) | |
3633 | { | |
3634 | if (skb->ip_summed == CHECKSUM_COMPLETE) | |
3635 | skb->ip_summed = CHECKSUM_NONE; | |
3636 | } | |
3637 | ||
76ba0aae TH |
3638 | /* Validate (init) checksum based on checksum complete. |
3639 | * | |
3640 | * Return values: | |
3641 | * 0: checksum is validated or try to in skb_checksum_complete. In the latter | |
3642 | * case the ip_summed will not be CHECKSUM_UNNECESSARY and the pseudo | |
3643 | * checksum is stored in skb->csum for use in __skb_checksum_complete | |
3644 | * non-zero: value of invalid checksum | |
3645 | * | |
3646 | */ | |
3647 | static inline __sum16 __skb_checksum_validate_complete(struct sk_buff *skb, | |
3648 | bool complete, | |
3649 | __wsum psum) | |
3650 | { | |
3651 | if (skb->ip_summed == CHECKSUM_COMPLETE) { | |
3652 | if (!csum_fold(csum_add(psum, skb->csum))) { | |
5d0c2b95 | 3653 | skb->csum_valid = 1; |
76ba0aae TH |
3654 | return 0; |
3655 | } | |
3656 | } | |
3657 | ||
3658 | skb->csum = psum; | |
3659 | ||
5d0c2b95 TH |
3660 | if (complete || skb->len <= CHECKSUM_BREAK) { |
3661 | __sum16 csum; | |
3662 | ||
3663 | csum = __skb_checksum_complete(skb); | |
3664 | skb->csum_valid = !csum; | |
3665 | return csum; | |
3666 | } | |
76ba0aae TH |
3667 | |
3668 | return 0; | |
3669 | } | |
3670 | ||
3671 | static inline __wsum null_compute_pseudo(struct sk_buff *skb, int proto) | |
3672 | { | |
3673 | return 0; | |
3674 | } | |
3675 | ||
3676 | /* Perform checksum validate (init). Note that this is a macro since we only | |
3677 | * want to calculate the pseudo header which is an input function if necessary. | |
3678 | * First we try to validate without any computation (checksum unnecessary) and | |
3679 | * then calculate based on checksum complete calling the function to compute | |
3680 | * pseudo header. | |
3681 | * | |
3682 | * Return values: | |
3683 | * 0: checksum is validated or try to in skb_checksum_complete | |
3684 | * non-zero: value of invalid checksum | |
3685 | */ | |
3686 | #define __skb_checksum_validate(skb, proto, complete, \ | |
3687 | zero_okay, check, compute_pseudo) \ | |
3688 | ({ \ | |
3689 | __sum16 __ret = 0; \ | |
5d0c2b95 | 3690 | skb->csum_valid = 0; \ |
76ba0aae TH |
3691 | if (__skb_checksum_validate_needed(skb, zero_okay, check)) \ |
3692 | __ret = __skb_checksum_validate_complete(skb, \ | |
3693 | complete, compute_pseudo(skb, proto)); \ | |
3694 | __ret; \ | |
3695 | }) | |
3696 | ||
3697 | #define skb_checksum_init(skb, proto, compute_pseudo) \ | |
3698 | __skb_checksum_validate(skb, proto, false, false, 0, compute_pseudo) | |
3699 | ||
3700 | #define skb_checksum_init_zero_check(skb, proto, check, compute_pseudo) \ | |
3701 | __skb_checksum_validate(skb, proto, false, true, check, compute_pseudo) | |
3702 | ||
3703 | #define skb_checksum_validate(skb, proto, compute_pseudo) \ | |
3704 | __skb_checksum_validate(skb, proto, true, false, 0, compute_pseudo) | |
3705 | ||
3706 | #define skb_checksum_validate_zero_check(skb, proto, check, \ | |
3707 | compute_pseudo) \ | |
096a4cfa | 3708 | __skb_checksum_validate(skb, proto, true, true, check, compute_pseudo) |
76ba0aae TH |
3709 | |
3710 | #define skb_checksum_simple_validate(skb) \ | |
3711 | __skb_checksum_validate(skb, 0, true, false, 0, null_compute_pseudo) | |
3712 | ||
d96535a1 TH |
3713 | static inline bool __skb_checksum_convert_check(struct sk_buff *skb) |
3714 | { | |
219f1d79 | 3715 | return (skb->ip_summed == CHECKSUM_NONE && skb->csum_valid); |
d96535a1 TH |
3716 | } |
3717 | ||
3718 | static inline void __skb_checksum_convert(struct sk_buff *skb, | |
3719 | __sum16 check, __wsum pseudo) | |
3720 | { | |
3721 | skb->csum = ~pseudo; | |
3722 | skb->ip_summed = CHECKSUM_COMPLETE; | |
3723 | } | |
3724 | ||
3725 | #define skb_checksum_try_convert(skb, proto, check, compute_pseudo) \ | |
3726 | do { \ | |
3727 | if (__skb_checksum_convert_check(skb)) \ | |
3728 | __skb_checksum_convert(skb, check, \ | |
3729 | compute_pseudo(skb, proto)); \ | |
3730 | } while (0) | |
3731 | ||
15e2396d TH |
3732 | static inline void skb_remcsum_adjust_partial(struct sk_buff *skb, void *ptr, |
3733 | u16 start, u16 offset) | |
3734 | { | |
3735 | skb->ip_summed = CHECKSUM_PARTIAL; | |
3736 | skb->csum_start = ((unsigned char *)ptr + start) - skb->head; | |
3737 | skb->csum_offset = offset - start; | |
3738 | } | |
3739 | ||
dcdc8994 TH |
3740 | /* Update skbuf and packet to reflect the remote checksum offload operation. |
3741 | * When called, ptr indicates the starting point for skb->csum when | |
3742 | * ip_summed is CHECKSUM_COMPLETE. If we need create checksum complete | |
3743 | * here, skb_postpull_rcsum is done so skb->csum start is ptr. | |
3744 | */ | |
3745 | static inline void skb_remcsum_process(struct sk_buff *skb, void *ptr, | |
15e2396d | 3746 | int start, int offset, bool nopartial) |
dcdc8994 TH |
3747 | { |
3748 | __wsum delta; | |
3749 | ||
15e2396d TH |
3750 | if (!nopartial) { |
3751 | skb_remcsum_adjust_partial(skb, ptr, start, offset); | |
3752 | return; | |
3753 | } | |
3754 | ||
dcdc8994 TH |
3755 | if (unlikely(skb->ip_summed != CHECKSUM_COMPLETE)) { |
3756 | __skb_checksum_complete(skb); | |
3757 | skb_postpull_rcsum(skb, skb->data, ptr - (void *)skb->data); | |
3758 | } | |
3759 | ||
3760 | delta = remcsum_adjust(ptr, skb->csum, start, offset); | |
3761 | ||
3762 | /* Adjust skb->csum since we changed the packet */ | |
3763 | skb->csum = csum_add(skb->csum, delta); | |
3764 | } | |
3765 | ||
cb9c6836 FW |
3766 | static inline struct nf_conntrack *skb_nfct(const struct sk_buff *skb) |
3767 | { | |
3768 | #if IS_ENABLED(CONFIG_NF_CONNTRACK) | |
a9e419dc | 3769 | return (void *)(skb->_nfct & SKB_NFCT_PTRMASK); |
cb9c6836 FW |
3770 | #else |
3771 | return NULL; | |
3772 | #endif | |
3773 | } | |
3774 | ||
5f79e0f9 | 3775 | #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE) |
7965bd4d | 3776 | void nf_conntrack_destroy(struct nf_conntrack *nfct); |
1da177e4 LT |
3777 | static inline void nf_conntrack_put(struct nf_conntrack *nfct) |
3778 | { | |
3779 | if (nfct && atomic_dec_and_test(&nfct->use)) | |
de6e05c4 | 3780 | nf_conntrack_destroy(nfct); |
1da177e4 LT |
3781 | } |
3782 | static inline void nf_conntrack_get(struct nf_conntrack *nfct) | |
3783 | { | |
3784 | if (nfct) | |
3785 | atomic_inc(&nfct->use); | |
3786 | } | |
2fc72c7b | 3787 | #endif |
34666d46 | 3788 | #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER) |
1da177e4 LT |
3789 | static inline void nf_bridge_put(struct nf_bridge_info *nf_bridge) |
3790 | { | |
53869ceb | 3791 | if (nf_bridge && refcount_dec_and_test(&nf_bridge->use)) |
1da177e4 LT |
3792 | kfree(nf_bridge); |
3793 | } | |
3794 | static inline void nf_bridge_get(struct nf_bridge_info *nf_bridge) | |
3795 | { | |
3796 | if (nf_bridge) | |
53869ceb | 3797 | refcount_inc(&nf_bridge->use); |
1da177e4 LT |
3798 | } |
3799 | #endif /* CONFIG_BRIDGE_NETFILTER */ | |
a193a4ab PM |
3800 | static inline void nf_reset(struct sk_buff *skb) |
3801 | { | |
5f79e0f9 | 3802 | #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE) |
a9e419dc FW |
3803 | nf_conntrack_put(skb_nfct(skb)); |
3804 | skb->_nfct = 0; | |
2fc72c7b | 3805 | #endif |
34666d46 | 3806 | #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER) |
a193a4ab PM |
3807 | nf_bridge_put(skb->nf_bridge); |
3808 | skb->nf_bridge = NULL; | |
3809 | #endif | |
3810 | } | |
3811 | ||
124dff01 PM |
3812 | static inline void nf_reset_trace(struct sk_buff *skb) |
3813 | { | |
478b360a | 3814 | #if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE) || defined(CONFIG_NF_TABLES) |
130549fe G |
3815 | skb->nf_trace = 0; |
3816 | #endif | |
a193a4ab PM |
3817 | } |
3818 | ||
edda553c | 3819 | /* Note: This doesn't put any conntrack and bridge info in dst. */ |
b1937227 ED |
3820 | static inline void __nf_copy(struct sk_buff *dst, const struct sk_buff *src, |
3821 | bool copy) | |
edda553c | 3822 | { |
5f79e0f9 | 3823 | #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE) |
a9e419dc FW |
3824 | dst->_nfct = src->_nfct; |
3825 | nf_conntrack_get(skb_nfct(src)); | |
2fc72c7b | 3826 | #endif |
34666d46 | 3827 | #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER) |
edda553c YK |
3828 | dst->nf_bridge = src->nf_bridge; |
3829 | nf_bridge_get(src->nf_bridge); | |
3830 | #endif | |
478b360a | 3831 | #if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE) || defined(CONFIG_NF_TABLES) |
b1937227 ED |
3832 | if (copy) |
3833 | dst->nf_trace = src->nf_trace; | |
478b360a | 3834 | #endif |
edda553c YK |
3835 | } |
3836 | ||
e7ac05f3 YK |
3837 | static inline void nf_copy(struct sk_buff *dst, const struct sk_buff *src) |
3838 | { | |
e7ac05f3 | 3839 | #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE) |
a9e419dc | 3840 | nf_conntrack_put(skb_nfct(dst)); |
2fc72c7b | 3841 | #endif |
34666d46 | 3842 | #if IS_ENABLED(CONFIG_BRIDGE_NETFILTER) |
e7ac05f3 YK |
3843 | nf_bridge_put(dst->nf_bridge); |
3844 | #endif | |
b1937227 | 3845 | __nf_copy(dst, src, true); |
e7ac05f3 YK |
3846 | } |
3847 | ||
984bc16c JM |
3848 | #ifdef CONFIG_NETWORK_SECMARK |
3849 | static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from) | |
3850 | { | |
3851 | to->secmark = from->secmark; | |
3852 | } | |
3853 | ||
3854 | static inline void skb_init_secmark(struct sk_buff *skb) | |
3855 | { | |
3856 | skb->secmark = 0; | |
3857 | } | |
3858 | #else | |
3859 | static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from) | |
3860 | { } | |
3861 | ||
3862 | static inline void skb_init_secmark(struct sk_buff *skb) | |
3863 | { } | |
3864 | #endif | |
3865 | ||
574f7194 EB |
3866 | static inline bool skb_irq_freeable(const struct sk_buff *skb) |
3867 | { | |
3868 | return !skb->destructor && | |
3869 | #if IS_ENABLED(CONFIG_XFRM) | |
3870 | !skb->sp && | |
3871 | #endif | |
cb9c6836 | 3872 | !skb_nfct(skb) && |
574f7194 EB |
3873 | !skb->_skb_refdst && |
3874 | !skb_has_frag_list(skb); | |
3875 | } | |
3876 | ||
f25f4e44 PWJ |
3877 | static inline void skb_set_queue_mapping(struct sk_buff *skb, u16 queue_mapping) |
3878 | { | |
f25f4e44 | 3879 | skb->queue_mapping = queue_mapping; |
f25f4e44 PWJ |
3880 | } |
3881 | ||
9247744e | 3882 | static inline u16 skb_get_queue_mapping(const struct sk_buff *skb) |
4e3ab47a | 3883 | { |
4e3ab47a | 3884 | return skb->queue_mapping; |
4e3ab47a PE |
3885 | } |
3886 | ||
f25f4e44 PWJ |
3887 | static inline void skb_copy_queue_mapping(struct sk_buff *to, const struct sk_buff *from) |
3888 | { | |
f25f4e44 | 3889 | to->queue_mapping = from->queue_mapping; |
f25f4e44 PWJ |
3890 | } |
3891 | ||
d5a9e24a DM |
3892 | static inline void skb_record_rx_queue(struct sk_buff *skb, u16 rx_queue) |
3893 | { | |
3894 | skb->queue_mapping = rx_queue + 1; | |
3895 | } | |
3896 | ||
9247744e | 3897 | static inline u16 skb_get_rx_queue(const struct sk_buff *skb) |
d5a9e24a DM |
3898 | { |
3899 | return skb->queue_mapping - 1; | |
3900 | } | |
3901 | ||
9247744e | 3902 | static inline bool skb_rx_queue_recorded(const struct sk_buff *skb) |
d5a9e24a | 3903 | { |
a02cec21 | 3904 | return skb->queue_mapping != 0; |
d5a9e24a DM |
3905 | } |
3906 | ||
4ff06203 JA |
3907 | static inline void skb_set_dst_pending_confirm(struct sk_buff *skb, u32 val) |
3908 | { | |
3909 | skb->dst_pending_confirm = val; | |
3910 | } | |
3911 | ||
3912 | static inline bool skb_get_dst_pending_confirm(const struct sk_buff *skb) | |
3913 | { | |
3914 | return skb->dst_pending_confirm != 0; | |
3915 | } | |
3916 | ||
def8b4fa AD |
3917 | static inline struct sec_path *skb_sec_path(struct sk_buff *skb) |
3918 | { | |
0b3d8e08 | 3919 | #ifdef CONFIG_XFRM |
def8b4fa | 3920 | return skb->sp; |
def8b4fa | 3921 | #else |
def8b4fa | 3922 | return NULL; |
def8b4fa | 3923 | #endif |
0b3d8e08 | 3924 | } |
def8b4fa | 3925 | |
68c33163 PS |
3926 | /* Keeps track of mac header offset relative to skb->head. |
3927 | * It is useful for TSO of Tunneling protocol. e.g. GRE. | |
3928 | * For non-tunnel skb it points to skb_mac_header() and for | |
3347c960 ED |
3929 | * tunnel skb it points to outer mac header. |
3930 | * Keeps track of level of encapsulation of network headers. | |
3931 | */ | |
68c33163 | 3932 | struct skb_gso_cb { |
802ab55a AD |
3933 | union { |
3934 | int mac_offset; | |
3935 | int data_offset; | |
3936 | }; | |
3347c960 | 3937 | int encap_level; |
76443456 | 3938 | __wsum csum; |
7e2b10c1 | 3939 | __u16 csum_start; |
68c33163 | 3940 | }; |
9207f9d4 KK |
3941 | #define SKB_SGO_CB_OFFSET 32 |
3942 | #define SKB_GSO_CB(skb) ((struct skb_gso_cb *)((skb)->cb + SKB_SGO_CB_OFFSET)) | |
68c33163 PS |
3943 | |
3944 | static inline int skb_tnl_header_len(const struct sk_buff *inner_skb) | |
3945 | { | |
3946 | return (skb_mac_header(inner_skb) - inner_skb->head) - | |
3947 | SKB_GSO_CB(inner_skb)->mac_offset; | |
3948 | } | |
3949 | ||
1e2bd517 PS |
3950 | static inline int gso_pskb_expand_head(struct sk_buff *skb, int extra) |
3951 | { | |
3952 | int new_headroom, headroom; | |
3953 | int ret; | |
3954 | ||
3955 | headroom = skb_headroom(skb); | |
3956 | ret = pskb_expand_head(skb, extra, 0, GFP_ATOMIC); | |
3957 | if (ret) | |
3958 | return ret; | |
3959 | ||
3960 | new_headroom = skb_headroom(skb); | |
3961 | SKB_GSO_CB(skb)->mac_offset += (new_headroom - headroom); | |
3962 | return 0; | |
3963 | } | |
3964 | ||
08b64fcc AD |
3965 | static inline void gso_reset_checksum(struct sk_buff *skb, __wsum res) |
3966 | { | |
3967 | /* Do not update partial checksums if remote checksum is enabled. */ | |
3968 | if (skb->remcsum_offload) | |
3969 | return; | |
3970 | ||
3971 | SKB_GSO_CB(skb)->csum = res; | |
3972 | SKB_GSO_CB(skb)->csum_start = skb_checksum_start(skb) - skb->head; | |
3973 | } | |
3974 | ||
7e2b10c1 TH |
3975 | /* Compute the checksum for a gso segment. First compute the checksum value |
3976 | * from the start of transport header to SKB_GSO_CB(skb)->csum_start, and | |
3977 | * then add in skb->csum (checksum from csum_start to end of packet). | |
3978 | * skb->csum and csum_start are then updated to reflect the checksum of the | |
3979 | * resultant packet starting from the transport header-- the resultant checksum | |
3980 | * is in the res argument (i.e. normally zero or ~ of checksum of a pseudo | |
3981 | * header. | |
3982 | */ | |
3983 | static inline __sum16 gso_make_checksum(struct sk_buff *skb, __wsum res) | |
3984 | { | |
76443456 AD |
3985 | unsigned char *csum_start = skb_transport_header(skb); |
3986 | int plen = (skb->head + SKB_GSO_CB(skb)->csum_start) - csum_start; | |
3987 | __wsum partial = SKB_GSO_CB(skb)->csum; | |
7e2b10c1 | 3988 | |
76443456 AD |
3989 | SKB_GSO_CB(skb)->csum = res; |
3990 | SKB_GSO_CB(skb)->csum_start = csum_start - skb->head; | |
7e2b10c1 | 3991 | |
76443456 | 3992 | return csum_fold(csum_partial(csum_start, plen, partial)); |
7e2b10c1 TH |
3993 | } |
3994 | ||
bdcc0924 | 3995 | static inline bool skb_is_gso(const struct sk_buff *skb) |
89114afd HX |
3996 | { |
3997 | return skb_shinfo(skb)->gso_size; | |
3998 | } | |
3999 | ||
36a8f39e | 4000 | /* Note: Should be called only if skb_is_gso(skb) is true */ |
bdcc0924 | 4001 | static inline bool skb_is_gso_v6(const struct sk_buff *skb) |
eabd7e35 BG |
4002 | { |
4003 | return skb_shinfo(skb)->gso_type & SKB_GSO_TCPV6; | |
4004 | } | |
4005 | ||
5293efe6 DB |
4006 | static inline void skb_gso_reset(struct sk_buff *skb) |
4007 | { | |
4008 | skb_shinfo(skb)->gso_size = 0; | |
4009 | skb_shinfo(skb)->gso_segs = 0; | |
4010 | skb_shinfo(skb)->gso_type = 0; | |
4011 | } | |
4012 | ||
7965bd4d | 4013 | void __skb_warn_lro_forwarding(const struct sk_buff *skb); |
4497b076 BH |
4014 | |
4015 | static inline bool skb_warn_if_lro(const struct sk_buff *skb) | |
4016 | { | |
4017 | /* LRO sets gso_size but not gso_type, whereas if GSO is really | |
4018 | * wanted then gso_type will be set. */ | |
05bdd2f1 ED |
4019 | const struct skb_shared_info *shinfo = skb_shinfo(skb); |
4020 | ||
b78462eb AD |
4021 | if (skb_is_nonlinear(skb) && shinfo->gso_size != 0 && |
4022 | unlikely(shinfo->gso_type == 0)) { | |
4497b076 BH |
4023 | __skb_warn_lro_forwarding(skb); |
4024 | return true; | |
4025 | } | |
4026 | return false; | |
4027 | } | |
4028 | ||
35fc92a9 HX |
4029 | static inline void skb_forward_csum(struct sk_buff *skb) |
4030 | { | |
4031 | /* Unfortunately we don't support this one. Any brave souls? */ | |
4032 | if (skb->ip_summed == CHECKSUM_COMPLETE) | |
4033 | skb->ip_summed = CHECKSUM_NONE; | |
4034 | } | |
4035 | ||
bc8acf2c ED |
4036 | /** |
4037 | * skb_checksum_none_assert - make sure skb ip_summed is CHECKSUM_NONE | |
4038 | * @skb: skb to check | |
4039 | * | |
4040 | * fresh skbs have their ip_summed set to CHECKSUM_NONE. | |
4041 | * Instead of forcing ip_summed to CHECKSUM_NONE, we can | |
4042 | * use this helper, to document places where we make this assertion. | |
4043 | */ | |
05bdd2f1 | 4044 | static inline void skb_checksum_none_assert(const struct sk_buff *skb) |
bc8acf2c ED |
4045 | { |
4046 | #ifdef DEBUG | |
4047 | BUG_ON(skb->ip_summed != CHECKSUM_NONE); | |
4048 | #endif | |
4049 | } | |
4050 | ||
f35d9d8a | 4051 | bool skb_partial_csum_set(struct sk_buff *skb, u16 start, u16 off); |
a6686f2f | 4052 | |
ed1f50c3 | 4053 | int skb_checksum_setup(struct sk_buff *skb, bool recalculate); |
9afd85c9 LL |
4054 | struct sk_buff *skb_checksum_trimmed(struct sk_buff *skb, |
4055 | unsigned int transport_len, | |
4056 | __sum16(*skb_chkf)(struct sk_buff *skb)); | |
ed1f50c3 | 4057 | |
3a7c1ee4 AD |
4058 | /** |
4059 | * skb_head_is_locked - Determine if the skb->head is locked down | |
4060 | * @skb: skb to check | |
4061 | * | |
4062 | * The head on skbs build around a head frag can be removed if they are | |
4063 | * not cloned. This function returns true if the skb head is locked down | |
4064 | * due to either being allocated via kmalloc, or by being a clone with | |
4065 | * multiple references to the head. | |
4066 | */ | |
4067 | static inline bool skb_head_is_locked(const struct sk_buff *skb) | |
4068 | { | |
4069 | return !skb->head_frag || skb_cloned(skb); | |
4070 | } | |
fe6cc55f FW |
4071 | |
4072 | /** | |
4073 | * skb_gso_network_seglen - Return length of individual segments of a gso packet | |
4074 | * | |
4075 | * @skb: GSO skb | |
4076 | * | |
4077 | * skb_gso_network_seglen is used to determine the real size of the | |
4078 | * individual segments, including Layer3 (IP, IPv6) and L4 headers (TCP/UDP). | |
4079 | * | |
4080 | * The MAC/L2 header is not accounted for. | |
4081 | */ | |
4082 | static inline unsigned int skb_gso_network_seglen(const struct sk_buff *skb) | |
4083 | { | |
4084 | unsigned int hdr_len = skb_transport_header(skb) - | |
4085 | skb_network_header(skb); | |
4086 | return hdr_len + skb_gso_transport_seglen(skb); | |
4087 | } | |
ee122c79 | 4088 | |
179bc67f EC |
4089 | /* Local Checksum Offload. |
4090 | * Compute outer checksum based on the assumption that the | |
4091 | * inner checksum will be offloaded later. | |
e8ae7b00 EC |
4092 | * See Documentation/networking/checksum-offloads.txt for |
4093 | * explanation of how this works. | |
179bc67f EC |
4094 | * Fill in outer checksum adjustment (e.g. with sum of outer |
4095 | * pseudo-header) before calling. | |
4096 | * Also ensure that inner checksum is in linear data area. | |
4097 | */ | |
4098 | static inline __wsum lco_csum(struct sk_buff *skb) | |
4099 | { | |
9e74a6da AD |
4100 | unsigned char *csum_start = skb_checksum_start(skb); |
4101 | unsigned char *l4_hdr = skb_transport_header(skb); | |
4102 | __wsum partial; | |
179bc67f EC |
4103 | |
4104 | /* Start with complement of inner checksum adjustment */ | |
9e74a6da AD |
4105 | partial = ~csum_unfold(*(__force __sum16 *)(csum_start + |
4106 | skb->csum_offset)); | |
4107 | ||
179bc67f | 4108 | /* Add in checksum of our headers (incl. outer checksum |
9e74a6da | 4109 | * adjustment filled in by caller) and return result. |
179bc67f | 4110 | */ |
9e74a6da | 4111 | return csum_partial(l4_hdr, csum_start - l4_hdr, partial); |
179bc67f EC |
4112 | } |
4113 | ||
1da177e4 LT |
4114 | #endif /* __KERNEL__ */ |
4115 | #endif /* _LINUX_SKBUFF_H */ |