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 LT |
22 | #include <linux/cache.h> |
23 | ||
60063497 | 24 | #include <linux/atomic.h> |
1da177e4 LT |
25 | #include <asm/types.h> |
26 | #include <linux/spinlock.h> | |
1da177e4 | 27 | #include <linux/net.h> |
3fc7e8a6 | 28 | #include <linux/textsearch.h> |
1da177e4 | 29 | #include <net/checksum.h> |
a80958f4 | 30 | #include <linux/rcupdate.h> |
97fc2f08 | 31 | #include <linux/dmaengine.h> |
b7aa0bf7 | 32 | #include <linux/hrtimer.h> |
131ea667 | 33 | #include <linux/dma-mapping.h> |
c8f44aff | 34 | #include <linux/netdev_features.h> |
363ec392 | 35 | #include <linux/sched.h> |
5203cd28 | 36 | #include <net/flow_keys.h> |
1da177e4 | 37 | |
78ea85f1 DB |
38 | /* A. Checksumming of received packets by device. |
39 | * | |
40 | * CHECKSUM_NONE: | |
41 | * | |
42 | * Device failed to checksum this packet e.g. due to lack of capabilities. | |
43 | * The packet contains full (though not verified) checksum in packet but | |
44 | * not in skb->csum. Thus, skb->csum is undefined in this case. | |
45 | * | |
46 | * CHECKSUM_UNNECESSARY: | |
47 | * | |
48 | * The hardware you're dealing with doesn't calculate the full checksum | |
49 | * (as in CHECKSUM_COMPLETE), but it does parse headers and verify checksums | |
50 | * for specific protocols e.g. TCP/UDP/SCTP, then, for such packets it will | |
51 | * set CHECKSUM_UNNECESSARY if their checksums are okay. skb->csum is still | |
52 | * undefined in this case though. It is a bad option, but, unfortunately, | |
53 | * nowadays most vendors do this. Apparently with the secret goal to sell | |
54 | * you new devices, when you will add new protocol to your host, f.e. IPv6 8) | |
55 | * | |
56 | * CHECKSUM_COMPLETE: | |
57 | * | |
58 | * This is the most generic way. The device supplied checksum of the _whole_ | |
59 | * packet as seen by netif_rx() and fills out in skb->csum. Meaning, the | |
60 | * hardware doesn't need to parse L3/L4 headers to implement this. | |
61 | * | |
62 | * Note: Even if device supports only some protocols, but is able to produce | |
63 | * skb->csum, it MUST use CHECKSUM_COMPLETE, not CHECKSUM_UNNECESSARY. | |
64 | * | |
65 | * CHECKSUM_PARTIAL: | |
66 | * | |
67 | * This is identical to the case for output below. This may occur on a packet | |
68 | * received directly from another Linux OS, e.g., a virtualized Linux kernel | |
69 | * on the same host. The packet can be treated in the same way as | |
70 | * CHECKSUM_UNNECESSARY, except that on output (i.e., forwarding) the | |
71 | * checksum must be filled in by the OS or the hardware. | |
72 | * | |
73 | * B. Checksumming on output. | |
74 | * | |
75 | * CHECKSUM_NONE: | |
76 | * | |
77 | * The skb was already checksummed by the protocol, or a checksum is not | |
78 | * required. | |
79 | * | |
80 | * CHECKSUM_PARTIAL: | |
81 | * | |
82 | * The device is required to checksum the packet as seen by hard_start_xmit() | |
83 | * from skb->csum_start up to the end, and to record/write the checksum at | |
84 | * offset skb->csum_start + skb->csum_offset. | |
85 | * | |
86 | * The device must show its capabilities in dev->features, set up at device | |
87 | * setup time, e.g. netdev_features.h: | |
88 | * | |
89 | * NETIF_F_HW_CSUM - It's a clever device, it's able to checksum everything. | |
90 | * NETIF_F_IP_CSUM - Device is dumb, it's able to checksum only TCP/UDP over | |
91 | * IPv4. Sigh. Vendors like this way for an unknown reason. | |
92 | * Though, see comment above about CHECKSUM_UNNECESSARY. 8) | |
93 | * NETIF_F_IPV6_CSUM - About as dumb as the last one but does IPv6 instead. | |
94 | * NETIF_F_... - Well, you get the picture. | |
95 | * | |
96 | * CHECKSUM_UNNECESSARY: | |
97 | * | |
98 | * Normally, the device will do per protocol specific checksumming. Protocol | |
99 | * implementations that do not want the NIC to perform the checksum | |
100 | * calculation should use this flag in their outgoing skbs. | |
101 | * | |
102 | * NETIF_F_FCOE_CRC - This indicates that the device can do FCoE FC CRC | |
103 | * offload. Correspondingly, the FCoE protocol driver | |
104 | * stack should use CHECKSUM_UNNECESSARY. | |
105 | * | |
106 | * Any questions? No questions, good. --ANK | |
107 | */ | |
108 | ||
60476372 | 109 | /* Don't change this without changing skb_csum_unnecessary! */ |
78ea85f1 DB |
110 | #define CHECKSUM_NONE 0 |
111 | #define CHECKSUM_UNNECESSARY 1 | |
112 | #define CHECKSUM_COMPLETE 2 | |
113 | #define CHECKSUM_PARTIAL 3 | |
1da177e4 | 114 | |
0bec8c88 | 115 | #define SKB_DATA_ALIGN(X) ALIGN(X, SMP_CACHE_BYTES) |
fc910a27 | 116 | #define SKB_WITH_OVERHEAD(X) \ |
deea84b0 | 117 | ((X) - SKB_DATA_ALIGN(sizeof(struct skb_shared_info))) |
fc910a27 DM |
118 | #define SKB_MAX_ORDER(X, ORDER) \ |
119 | SKB_WITH_OVERHEAD((PAGE_SIZE << (ORDER)) - (X)) | |
1da177e4 LT |
120 | #define SKB_MAX_HEAD(X) (SKB_MAX_ORDER((X), 0)) |
121 | #define SKB_MAX_ALLOC (SKB_MAX_ORDER(0, 2)) | |
122 | ||
87fb4b7b ED |
123 | /* return minimum truesize of one skb containing X bytes of data */ |
124 | #define SKB_TRUESIZE(X) ((X) + \ | |
125 | SKB_DATA_ALIGN(sizeof(struct sk_buff)) + \ | |
126 | SKB_DATA_ALIGN(sizeof(struct skb_shared_info))) | |
127 | ||
1da177e4 | 128 | struct net_device; |
716ea3a7 | 129 | struct scatterlist; |
9c55e01c | 130 | struct pipe_inode_info; |
1da177e4 | 131 | |
5f79e0f9 | 132 | #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE) |
1da177e4 LT |
133 | struct nf_conntrack { |
134 | atomic_t use; | |
1da177e4 | 135 | }; |
5f79e0f9 | 136 | #endif |
1da177e4 LT |
137 | |
138 | #ifdef CONFIG_BRIDGE_NETFILTER | |
139 | struct nf_bridge_info { | |
bf1ac5ca ED |
140 | atomic_t use; |
141 | unsigned int mask; | |
142 | struct net_device *physindev; | |
143 | struct net_device *physoutdev; | |
144 | unsigned long data[32 / sizeof(unsigned long)]; | |
1da177e4 LT |
145 | }; |
146 | #endif | |
147 | ||
1da177e4 LT |
148 | struct sk_buff_head { |
149 | /* These two members must be first. */ | |
150 | struct sk_buff *next; | |
151 | struct sk_buff *prev; | |
152 | ||
153 | __u32 qlen; | |
154 | spinlock_t lock; | |
155 | }; | |
156 | ||
157 | struct sk_buff; | |
158 | ||
9d4dde52 IC |
159 | /* To allow 64K frame to be packed as single skb without frag_list we |
160 | * require 64K/PAGE_SIZE pages plus 1 additional page to allow for | |
161 | * buffers which do not start on a page boundary. | |
162 | * | |
163 | * Since GRO uses frags we allocate at least 16 regardless of page | |
164 | * size. | |
a715dea3 | 165 | */ |
9d4dde52 | 166 | #if (65536/PAGE_SIZE + 1) < 16 |
eec00954 | 167 | #define MAX_SKB_FRAGS 16UL |
a715dea3 | 168 | #else |
9d4dde52 | 169 | #define MAX_SKB_FRAGS (65536/PAGE_SIZE + 1) |
a715dea3 | 170 | #endif |
1da177e4 LT |
171 | |
172 | typedef struct skb_frag_struct skb_frag_t; | |
173 | ||
174 | struct skb_frag_struct { | |
a8605c60 IC |
175 | struct { |
176 | struct page *p; | |
177 | } page; | |
cb4dfe56 | 178 | #if (BITS_PER_LONG > 32) || (PAGE_SIZE >= 65536) |
a309bb07 DM |
179 | __u32 page_offset; |
180 | __u32 size; | |
cb4dfe56 ED |
181 | #else |
182 | __u16 page_offset; | |
183 | __u16 size; | |
184 | #endif | |
1da177e4 LT |
185 | }; |
186 | ||
9e903e08 ED |
187 | static inline unsigned int skb_frag_size(const skb_frag_t *frag) |
188 | { | |
189 | return frag->size; | |
190 | } | |
191 | ||
192 | static inline void skb_frag_size_set(skb_frag_t *frag, unsigned int size) | |
193 | { | |
194 | frag->size = size; | |
195 | } | |
196 | ||
197 | static inline void skb_frag_size_add(skb_frag_t *frag, int delta) | |
198 | { | |
199 | frag->size += delta; | |
200 | } | |
201 | ||
202 | static inline void skb_frag_size_sub(skb_frag_t *frag, int delta) | |
203 | { | |
204 | frag->size -= delta; | |
205 | } | |
206 | ||
ac45f602 PO |
207 | #define HAVE_HW_TIME_STAMP |
208 | ||
209 | /** | |
d3a21be8 | 210 | * struct skb_shared_hwtstamps - hardware time stamps |
ac45f602 PO |
211 | * @hwtstamp: hardware time stamp transformed into duration |
212 | * since arbitrary point in time | |
ac45f602 PO |
213 | * |
214 | * Software time stamps generated by ktime_get_real() are stored in | |
4d276eb6 | 215 | * skb->tstamp. |
ac45f602 PO |
216 | * |
217 | * hwtstamps can only be compared against other hwtstamps from | |
218 | * the same device. | |
219 | * | |
220 | * This structure is attached to packets as part of the | |
221 | * &skb_shared_info. Use skb_hwtstamps() to get a pointer. | |
222 | */ | |
223 | struct skb_shared_hwtstamps { | |
224 | ktime_t hwtstamp; | |
ac45f602 PO |
225 | }; |
226 | ||
2244d07b OH |
227 | /* Definitions for tx_flags in struct skb_shared_info */ |
228 | enum { | |
229 | /* generate hardware time stamp */ | |
230 | SKBTX_HW_TSTAMP = 1 << 0, | |
231 | ||
232 | /* generate software time stamp */ | |
233 | SKBTX_SW_TSTAMP = 1 << 1, | |
234 | ||
235 | /* device driver is going to provide hardware time stamp */ | |
236 | SKBTX_IN_PROGRESS = 1 << 2, | |
237 | ||
a6686f2f | 238 | /* device driver supports TX zero-copy buffers */ |
62b1a8ab | 239 | SKBTX_DEV_ZEROCOPY = 1 << 3, |
6e3e939f JB |
240 | |
241 | /* generate wifi status information (where possible) */ | |
62b1a8ab | 242 | SKBTX_WIFI_STATUS = 1 << 4, |
c9af6db4 PS |
243 | |
244 | /* This indicates at least one fragment might be overwritten | |
245 | * (as in vmsplice(), sendfile() ...) | |
246 | * If we need to compute a TX checksum, we'll need to copy | |
247 | * all frags to avoid possible bad checksum | |
248 | */ | |
249 | SKBTX_SHARED_FRAG = 1 << 5, | |
a6686f2f SM |
250 | }; |
251 | ||
f24b9be5 WB |
252 | #define SKBTX_ANY_SW_TSTAMP SKBTX_SW_TSTAMP |
253 | #define SKBTX_ANY_TSTAMP (SKBTX_HW_TSTAMP | SKBTX_ANY_SW_TSTAMP) | |
254 | ||
a6686f2f SM |
255 | /* |
256 | * The callback notifies userspace to release buffers when skb DMA is done in | |
257 | * lower device, the skb last reference should be 0 when calling this. | |
e19d6763 MT |
258 | * The zerocopy_success argument is true if zero copy transmit occurred, |
259 | * false on data copy or out of memory error caused by data copy attempt. | |
ca8f4fb2 MT |
260 | * The ctx field is used to track device context. |
261 | * The desc field is used to track userspace buffer index. | |
a6686f2f SM |
262 | */ |
263 | struct ubuf_info { | |
e19d6763 | 264 | void (*callback)(struct ubuf_info *, bool zerocopy_success); |
ca8f4fb2 | 265 | void *ctx; |
a6686f2f | 266 | unsigned long desc; |
ac45f602 PO |
267 | }; |
268 | ||
1da177e4 LT |
269 | /* This data is invariant across clones and lives at |
270 | * the end of the header data, ie. at skb->end. | |
271 | */ | |
272 | struct skb_shared_info { | |
9f42f126 IC |
273 | unsigned char nr_frags; |
274 | __u8 tx_flags; | |
7967168c HX |
275 | unsigned short gso_size; |
276 | /* Warning: this field is not always filled in (UFO)! */ | |
277 | unsigned short gso_segs; | |
278 | unsigned short gso_type; | |
1da177e4 | 279 | struct sk_buff *frag_list; |
ac45f602 | 280 | struct skb_shared_hwtstamps hwtstamps; |
09c2d251 | 281 | u32 tskey; |
9f42f126 | 282 | __be32 ip6_frag_id; |
ec7d2f2c ED |
283 | |
284 | /* | |
285 | * Warning : all fields before dataref are cleared in __alloc_skb() | |
286 | */ | |
287 | atomic_t dataref; | |
288 | ||
69e3c75f JB |
289 | /* Intermediate layers must ensure that destructor_arg |
290 | * remains valid until skb destructor */ | |
291 | void * destructor_arg; | |
a6686f2f | 292 | |
fed66381 ED |
293 | /* must be last field, see pskb_expand_head() */ |
294 | skb_frag_t frags[MAX_SKB_FRAGS]; | |
1da177e4 LT |
295 | }; |
296 | ||
297 | /* We divide dataref into two halves. The higher 16 bits hold references | |
298 | * to the payload part of skb->data. The lower 16 bits hold references to | |
334a8132 PM |
299 | * the entire skb->data. A clone of a headerless skb holds the length of |
300 | * the header in skb->hdr_len. | |
1da177e4 LT |
301 | * |
302 | * All users must obey the rule that the skb->data reference count must be | |
303 | * greater than or equal to the payload reference count. | |
304 | * | |
305 | * Holding a reference to the payload part means that the user does not | |
306 | * care about modifications to the header part of skb->data. | |
307 | */ | |
308 | #define SKB_DATAREF_SHIFT 16 | |
309 | #define SKB_DATAREF_MASK ((1 << SKB_DATAREF_SHIFT) - 1) | |
310 | ||
d179cd12 DM |
311 | |
312 | enum { | |
313 | SKB_FCLONE_UNAVAILABLE, | |
314 | SKB_FCLONE_ORIG, | |
315 | SKB_FCLONE_CLONE, | |
316 | }; | |
317 | ||
7967168c HX |
318 | enum { |
319 | SKB_GSO_TCPV4 = 1 << 0, | |
f83ef8c0 | 320 | SKB_GSO_UDP = 1 << 1, |
576a30eb HX |
321 | |
322 | /* This indicates the skb is from an untrusted source. */ | |
323 | SKB_GSO_DODGY = 1 << 2, | |
b0da8537 MC |
324 | |
325 | /* This indicates the tcp segment has CWR set. */ | |
f83ef8c0 HX |
326 | SKB_GSO_TCP_ECN = 1 << 3, |
327 | ||
328 | SKB_GSO_TCPV6 = 1 << 4, | |
01d5b2fc CL |
329 | |
330 | SKB_GSO_FCOE = 1 << 5, | |
68c33163 PS |
331 | |
332 | SKB_GSO_GRE = 1 << 6, | |
73136267 | 333 | |
4b28252c | 334 | SKB_GSO_GRE_CSUM = 1 << 7, |
0d89d203 | 335 | |
4b28252c | 336 | SKB_GSO_IPIP = 1 << 8, |
cb32f511 | 337 | |
4b28252c | 338 | SKB_GSO_SIT = 1 << 9, |
61c1db7f | 339 | |
4b28252c | 340 | SKB_GSO_UDP_TUNNEL = 1 << 10, |
0f4f4ffa TH |
341 | |
342 | SKB_GSO_UDP_TUNNEL_CSUM = 1 << 11, | |
4749c09c | 343 | |
4b28252c TH |
344 | SKB_GSO_MPLS = 1 << 12, |
345 | ||
7967168c HX |
346 | }; |
347 | ||
2e07fa9c ACM |
348 | #if BITS_PER_LONG > 32 |
349 | #define NET_SKBUFF_DATA_USES_OFFSET 1 | |
350 | #endif | |
351 | ||
352 | #ifdef NET_SKBUFF_DATA_USES_OFFSET | |
353 | typedef unsigned int sk_buff_data_t; | |
354 | #else | |
355 | typedef unsigned char *sk_buff_data_t; | |
356 | #endif | |
357 | ||
363ec392 ED |
358 | /** |
359 | * struct skb_mstamp - multi resolution time stamps | |
360 | * @stamp_us: timestamp in us resolution | |
361 | * @stamp_jiffies: timestamp in jiffies | |
362 | */ | |
363 | struct skb_mstamp { | |
364 | union { | |
365 | u64 v64; | |
366 | struct { | |
367 | u32 stamp_us; | |
368 | u32 stamp_jiffies; | |
369 | }; | |
370 | }; | |
371 | }; | |
372 | ||
373 | /** | |
374 | * skb_mstamp_get - get current timestamp | |
375 | * @cl: place to store timestamps | |
376 | */ | |
377 | static inline void skb_mstamp_get(struct skb_mstamp *cl) | |
378 | { | |
379 | u64 val = local_clock(); | |
380 | ||
381 | do_div(val, NSEC_PER_USEC); | |
382 | cl->stamp_us = (u32)val; | |
383 | cl->stamp_jiffies = (u32)jiffies; | |
384 | } | |
385 | ||
386 | /** | |
387 | * skb_mstamp_delta - compute the difference in usec between two skb_mstamp | |
388 | * @t1: pointer to newest sample | |
389 | * @t0: pointer to oldest sample | |
390 | */ | |
391 | static inline u32 skb_mstamp_us_delta(const struct skb_mstamp *t1, | |
392 | const struct skb_mstamp *t0) | |
393 | { | |
394 | s32 delta_us = t1->stamp_us - t0->stamp_us; | |
395 | u32 delta_jiffies = t1->stamp_jiffies - t0->stamp_jiffies; | |
396 | ||
397 | /* If delta_us is negative, this might be because interval is too big, | |
398 | * or local_clock() drift is too big : fallback using jiffies. | |
399 | */ | |
400 | if (delta_us <= 0 || | |
401 | delta_jiffies >= (INT_MAX / (USEC_PER_SEC / HZ))) | |
402 | ||
403 | delta_us = jiffies_to_usecs(delta_jiffies); | |
404 | ||
405 | return delta_us; | |
406 | } | |
407 | ||
408 | ||
1da177e4 LT |
409 | /** |
410 | * struct sk_buff - socket buffer | |
411 | * @next: Next buffer in list | |
412 | * @prev: Previous buffer in list | |
363ec392 | 413 | * @tstamp: Time we arrived/left |
d84e0bd7 | 414 | * @sk: Socket we are owned by |
1da177e4 | 415 | * @dev: Device we arrived on/are leaving by |
d84e0bd7 | 416 | * @cb: Control buffer. Free for use by every layer. Put private vars here |
7fee226a | 417 | * @_skb_refdst: destination entry (with norefcount bit) |
67be2dd1 | 418 | * @sp: the security path, used for xfrm |
1da177e4 LT |
419 | * @len: Length of actual data |
420 | * @data_len: Data length | |
421 | * @mac_len: Length of link layer header | |
334a8132 | 422 | * @hdr_len: writable header length of cloned skb |
663ead3b HX |
423 | * @csum: Checksum (must include start/offset pair) |
424 | * @csum_start: Offset from skb->head where checksumming should start | |
425 | * @csum_offset: Offset from csum_start where checksum should be stored | |
d84e0bd7 | 426 | * @priority: Packet queueing priority |
60ff7467 | 427 | * @ignore_df: allow local fragmentation |
1da177e4 | 428 | * @cloned: Head may be cloned (check refcnt to be sure) |
d84e0bd7 | 429 | * @ip_summed: Driver fed us an IP checksum |
1da177e4 | 430 | * @nohdr: Payload reference only, must not modify header |
d84e0bd7 | 431 | * @nfctinfo: Relationship of this skb to the connection |
1da177e4 | 432 | * @pkt_type: Packet class |
c83c2486 | 433 | * @fclone: skbuff clone status |
c83c2486 | 434 | * @ipvs_property: skbuff is owned by ipvs |
31729363 RD |
435 | * @peeked: this packet has been seen already, so stats have been |
436 | * done for it, don't do them again | |
ba9dda3a | 437 | * @nf_trace: netfilter packet trace flag |
d84e0bd7 DB |
438 | * @protocol: Packet protocol from driver |
439 | * @destructor: Destruct function | |
440 | * @nfct: Associated connection, if any | |
1da177e4 | 441 | * @nf_bridge: Saved data about a bridged frame - see br_netfilter.c |
8964be4a | 442 | * @skb_iif: ifindex of device we arrived on |
1da177e4 LT |
443 | * @tc_index: Traffic control index |
444 | * @tc_verd: traffic control verdict | |
61b905da | 445 | * @hash: the packet hash |
d84e0bd7 | 446 | * @queue_mapping: Queue mapping for multiqueue devices |
553a5672 | 447 | * @ndisc_nodetype: router type (from link layer) |
d84e0bd7 | 448 | * @ooo_okay: allow the mapping of a socket to a queue to be changed |
61b905da | 449 | * @l4_hash: indicate hash is a canonical 4-tuple hash over transport |
4ca2462e | 450 | * ports. |
a3b18ddb | 451 | * @sw_hash: indicates hash was computed in software stack |
6e3e939f JB |
452 | * @wifi_acked_valid: wifi_acked was set |
453 | * @wifi_acked: whether frame was acked on wifi or not | |
3bdc0eba | 454 | * @no_fcs: Request NIC to treat last 4 bytes as Ethernet FCS |
f4b8ea78 RD |
455 | * @dma_cookie: a cookie to one of several possible DMA operations |
456 | * done by skb DMA functions | |
06021292 | 457 | * @napi_id: id of the NAPI struct this skb came from |
984bc16c | 458 | * @secmark: security marking |
d84e0bd7 DB |
459 | * @mark: Generic packet mark |
460 | * @dropcount: total number of sk_receive_queue overflows | |
86a9bad3 | 461 | * @vlan_proto: vlan encapsulation protocol |
6aa895b0 | 462 | * @vlan_tci: vlan tag control information |
0d89d203 | 463 | * @inner_protocol: Protocol (encapsulation) |
6a674e9c JG |
464 | * @inner_transport_header: Inner transport layer header (encapsulation) |
465 | * @inner_network_header: Network layer header (encapsulation) | |
aefbd2b3 | 466 | * @inner_mac_header: Link layer header (encapsulation) |
d84e0bd7 DB |
467 | * @transport_header: Transport layer header |
468 | * @network_header: Network layer header | |
469 | * @mac_header: Link layer header | |
470 | * @tail: Tail pointer | |
471 | * @end: End pointer | |
472 | * @head: Head of buffer | |
473 | * @data: Data head pointer | |
474 | * @truesize: Buffer size | |
475 | * @users: User count - see {datagram,tcp}.c | |
1da177e4 LT |
476 | */ |
477 | ||
478 | struct sk_buff { | |
479 | /* These two members must be first. */ | |
480 | struct sk_buff *next; | |
481 | struct sk_buff *prev; | |
482 | ||
363ec392 ED |
483 | union { |
484 | ktime_t tstamp; | |
485 | struct skb_mstamp skb_mstamp; | |
486 | }; | |
da3f5cf1 FF |
487 | |
488 | struct sock *sk; | |
1da177e4 | 489 | struct net_device *dev; |
1da177e4 | 490 | |
1da177e4 LT |
491 | /* |
492 | * This is the control buffer. It is free to use for every | |
493 | * layer. Please put your private variables there. If you | |
494 | * want to keep them across layers you have to do a skb_clone() | |
495 | * first. This is owned by whoever has the skb queued ATM. | |
496 | */ | |
da3f5cf1 | 497 | char cb[48] __aligned(8); |
1da177e4 | 498 | |
7fee226a | 499 | unsigned long _skb_refdst; |
da3f5cf1 FF |
500 | #ifdef CONFIG_XFRM |
501 | struct sec_path *sp; | |
502 | #endif | |
1da177e4 | 503 | unsigned int len, |
334a8132 PM |
504 | data_len; |
505 | __u16 mac_len, | |
506 | hdr_len; | |
ff1dcadb AV |
507 | union { |
508 | __wsum csum; | |
663ead3b HX |
509 | struct { |
510 | __u16 csum_start; | |
511 | __u16 csum_offset; | |
512 | }; | |
ff1dcadb | 513 | }; |
1da177e4 | 514 | __u32 priority; |
fe55f6d5 | 515 | kmemcheck_bitfield_begin(flags1); |
60ff7467 | 516 | __u8 ignore_df:1, |
1cbb3380 TG |
517 | cloned:1, |
518 | ip_summed:2, | |
6869c4d8 HW |
519 | nohdr:1, |
520 | nfctinfo:3; | |
d179cd12 | 521 | __u8 pkt_type:3, |
b84f4cc9 | 522 | fclone:2, |
ba9dda3a | 523 | ipvs_property:1, |
a59322be | 524 | peeked:1, |
ba9dda3a | 525 | nf_trace:1; |
fe55f6d5 | 526 | kmemcheck_bitfield_end(flags1); |
4ab408de | 527 | __be16 protocol; |
1da177e4 LT |
528 | |
529 | void (*destructor)(struct sk_buff *skb); | |
9fb9cbb1 | 530 | #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE) |
5f79e0f9 | 531 | struct nf_conntrack *nfct; |
2fc72c7b | 532 | #endif |
1da177e4 LT |
533 | #ifdef CONFIG_BRIDGE_NETFILTER |
534 | struct nf_bridge_info *nf_bridge; | |
535 | #endif | |
f25f4e44 | 536 | |
8964be4a | 537 | int skb_iif; |
4031ae6e | 538 | |
61b905da | 539 | __u32 hash; |
4031ae6e | 540 | |
86a9bad3 | 541 | __be16 vlan_proto; |
4031ae6e AD |
542 | __u16 vlan_tci; |
543 | ||
1da177e4 | 544 | #ifdef CONFIG_NET_SCHED |
b6b99eb5 | 545 | __u16 tc_index; /* traffic control index */ |
1da177e4 | 546 | #ifdef CONFIG_NET_CLS_ACT |
b6b99eb5 | 547 | __u16 tc_verd; /* traffic control verdict */ |
1da177e4 | 548 | #endif |
1da177e4 | 549 | #endif |
fe55f6d5 | 550 | |
0a14842f | 551 | __u16 queue_mapping; |
fe55f6d5 | 552 | kmemcheck_bitfield_begin(flags2); |
de357cc0 | 553 | #ifdef CONFIG_IPV6_NDISC_NODETYPE |
8a4eb573 | 554 | __u8 ndisc_nodetype:2; |
d0f09804 | 555 | #endif |
c93bdd0e | 556 | __u8 pfmemalloc:1; |
3853b584 | 557 | __u8 ooo_okay:1; |
61b905da | 558 | __u8 l4_hash:1; |
a3b18ddb | 559 | __u8 sw_hash:1; |
6e3e939f JB |
560 | __u8 wifi_acked_valid:1; |
561 | __u8 wifi_acked:1; | |
3bdc0eba | 562 | __u8 no_fcs:1; |
d3836f21 | 563 | __u8 head_frag:1; |
6a674e9c JG |
564 | /* Encapsulation protocol and NIC drivers should use |
565 | * this flag to indicate to each other if the skb contains | |
566 | * encapsulated packet or not and maybe use the inner packet | |
567 | * headers if needed | |
568 | */ | |
569 | __u8 encapsulation:1; | |
7e2b10c1 | 570 | __u8 encap_hdr_csum:1; |
5d0c2b95 | 571 | __u8 csum_valid:1; |
7e3cead5 | 572 | __u8 csum_complete_sw:1; |
a3b18ddb | 573 | /* 2/4 bit hole (depending on ndisc_nodetype presence) */ |
fe55f6d5 VN |
574 | kmemcheck_bitfield_end(flags2); |
575 | ||
e0d1095a | 576 | #if defined CONFIG_NET_DMA || defined CONFIG_NET_RX_BUSY_POLL |
06021292 ET |
577 | union { |
578 | unsigned int napi_id; | |
579 | dma_cookie_t dma_cookie; | |
580 | }; | |
97fc2f08 | 581 | #endif |
984bc16c JM |
582 | #ifdef CONFIG_NETWORK_SECMARK |
583 | __u32 secmark; | |
584 | #endif | |
3b885787 NH |
585 | union { |
586 | __u32 mark; | |
587 | __u32 dropcount; | |
16fad69c | 588 | __u32 reserved_tailroom; |
3b885787 | 589 | }; |
1da177e4 | 590 | |
0d89d203 | 591 | __be16 inner_protocol; |
1a37e412 SH |
592 | __u16 inner_transport_header; |
593 | __u16 inner_network_header; | |
594 | __u16 inner_mac_header; | |
595 | __u16 transport_header; | |
596 | __u16 network_header; | |
597 | __u16 mac_header; | |
1da177e4 | 598 | /* These elements must be at the end, see alloc_skb() for details. */ |
27a884dc | 599 | sk_buff_data_t tail; |
4305b541 | 600 | sk_buff_data_t end; |
1da177e4 | 601 | unsigned char *head, |
4305b541 | 602 | *data; |
27a884dc ACM |
603 | unsigned int truesize; |
604 | atomic_t users; | |
1da177e4 LT |
605 | }; |
606 | ||
607 | #ifdef __KERNEL__ | |
608 | /* | |
609 | * Handling routines are only of interest to the kernel | |
610 | */ | |
611 | #include <linux/slab.h> | |
612 | ||
1da177e4 | 613 | |
c93bdd0e MG |
614 | #define SKB_ALLOC_FCLONE 0x01 |
615 | #define SKB_ALLOC_RX 0x02 | |
616 | ||
617 | /* Returns true if the skb was allocated from PFMEMALLOC reserves */ | |
618 | static inline bool skb_pfmemalloc(const struct sk_buff *skb) | |
619 | { | |
620 | return unlikely(skb->pfmemalloc); | |
621 | } | |
622 | ||
7fee226a ED |
623 | /* |
624 | * skb might have a dst pointer attached, refcounted or not. | |
625 | * _skb_refdst low order bit is set if refcount was _not_ taken | |
626 | */ | |
627 | #define SKB_DST_NOREF 1UL | |
628 | #define SKB_DST_PTRMASK ~(SKB_DST_NOREF) | |
629 | ||
630 | /** | |
631 | * skb_dst - returns skb dst_entry | |
632 | * @skb: buffer | |
633 | * | |
634 | * Returns skb dst_entry, regardless of reference taken or not. | |
635 | */ | |
adf30907 ED |
636 | static inline struct dst_entry *skb_dst(const struct sk_buff *skb) |
637 | { | |
7fee226a ED |
638 | /* If refdst was not refcounted, check we still are in a |
639 | * rcu_read_lock section | |
640 | */ | |
641 | WARN_ON((skb->_skb_refdst & SKB_DST_NOREF) && | |
642 | !rcu_read_lock_held() && | |
643 | !rcu_read_lock_bh_held()); | |
644 | return (struct dst_entry *)(skb->_skb_refdst & SKB_DST_PTRMASK); | |
adf30907 ED |
645 | } |
646 | ||
7fee226a ED |
647 | /** |
648 | * skb_dst_set - sets skb dst | |
649 | * @skb: buffer | |
650 | * @dst: dst entry | |
651 | * | |
652 | * Sets skb dst, assuming a reference was taken on dst and should | |
653 | * be released by skb_dst_drop() | |
654 | */ | |
adf30907 ED |
655 | static inline void skb_dst_set(struct sk_buff *skb, struct dst_entry *dst) |
656 | { | |
7fee226a ED |
657 | skb->_skb_refdst = (unsigned long)dst; |
658 | } | |
659 | ||
7965bd4d JP |
660 | void __skb_dst_set_noref(struct sk_buff *skb, struct dst_entry *dst, |
661 | bool force); | |
932bc4d7 JA |
662 | |
663 | /** | |
664 | * skb_dst_set_noref - sets skb dst, hopefully, without taking reference | |
665 | * @skb: buffer | |
666 | * @dst: dst entry | |
667 | * | |
668 | * Sets skb dst, assuming a reference was not taken on dst. | |
669 | * If dst entry is cached, we do not take reference and dst_release | |
670 | * will be avoided by refdst_drop. If dst entry is not cached, we take | |
671 | * reference, so that last dst_release can destroy the dst immediately. | |
672 | */ | |
673 | static inline void skb_dst_set_noref(struct sk_buff *skb, struct dst_entry *dst) | |
674 | { | |
675 | __skb_dst_set_noref(skb, dst, false); | |
676 | } | |
677 | ||
678 | /** | |
679 | * skb_dst_set_noref_force - sets skb dst, without taking reference | |
680 | * @skb: buffer | |
681 | * @dst: dst entry | |
682 | * | |
683 | * Sets skb dst, assuming a reference was not taken on dst. | |
684 | * No reference is taken and no dst_release will be called. While for | |
685 | * cached dsts deferred reclaim is a basic feature, for entries that are | |
686 | * not cached it is caller's job to guarantee that last dst_release for | |
687 | * provided dst happens when nobody uses it, eg. after a RCU grace period. | |
688 | */ | |
689 | static inline void skb_dst_set_noref_force(struct sk_buff *skb, | |
690 | struct dst_entry *dst) | |
691 | { | |
692 | __skb_dst_set_noref(skb, dst, true); | |
693 | } | |
7fee226a ED |
694 | |
695 | /** | |
25985edc | 696 | * skb_dst_is_noref - Test if skb dst isn't refcounted |
7fee226a ED |
697 | * @skb: buffer |
698 | */ | |
699 | static inline bool skb_dst_is_noref(const struct sk_buff *skb) | |
700 | { | |
701 | return (skb->_skb_refdst & SKB_DST_NOREF) && skb_dst(skb); | |
adf30907 ED |
702 | } |
703 | ||
511c3f92 ED |
704 | static inline struct rtable *skb_rtable(const struct sk_buff *skb) |
705 | { | |
adf30907 | 706 | return (struct rtable *)skb_dst(skb); |
511c3f92 ED |
707 | } |
708 | ||
7965bd4d JP |
709 | void kfree_skb(struct sk_buff *skb); |
710 | void kfree_skb_list(struct sk_buff *segs); | |
711 | void skb_tx_error(struct sk_buff *skb); | |
712 | void consume_skb(struct sk_buff *skb); | |
713 | void __kfree_skb(struct sk_buff *skb); | |
d7e8883c | 714 | extern struct kmem_cache *skbuff_head_cache; |
bad43ca8 | 715 | |
7965bd4d JP |
716 | void kfree_skb_partial(struct sk_buff *skb, bool head_stolen); |
717 | bool skb_try_coalesce(struct sk_buff *to, struct sk_buff *from, | |
718 | bool *fragstolen, int *delta_truesize); | |
bad43ca8 | 719 | |
7965bd4d JP |
720 | struct sk_buff *__alloc_skb(unsigned int size, gfp_t priority, int flags, |
721 | int node); | |
722 | struct sk_buff *build_skb(void *data, unsigned int frag_size); | |
d179cd12 | 723 | static inline struct sk_buff *alloc_skb(unsigned int size, |
dd0fc66f | 724 | gfp_t priority) |
d179cd12 | 725 | { |
564824b0 | 726 | return __alloc_skb(size, priority, 0, NUMA_NO_NODE); |
d179cd12 DM |
727 | } |
728 | ||
729 | static inline struct sk_buff *alloc_skb_fclone(unsigned int size, | |
dd0fc66f | 730 | gfp_t priority) |
d179cd12 | 731 | { |
c93bdd0e | 732 | return __alloc_skb(size, priority, SKB_ALLOC_FCLONE, NUMA_NO_NODE); |
d179cd12 DM |
733 | } |
734 | ||
7965bd4d | 735 | struct sk_buff *__alloc_skb_head(gfp_t priority, int node); |
0ebd0ac5 PM |
736 | static inline struct sk_buff *alloc_skb_head(gfp_t priority) |
737 | { | |
738 | return __alloc_skb_head(priority, -1); | |
739 | } | |
740 | ||
7965bd4d JP |
741 | struct sk_buff *skb_morph(struct sk_buff *dst, struct sk_buff *src); |
742 | int skb_copy_ubufs(struct sk_buff *skb, gfp_t gfp_mask); | |
743 | struct sk_buff *skb_clone(struct sk_buff *skb, gfp_t priority); | |
744 | struct sk_buff *skb_copy(const struct sk_buff *skb, gfp_t priority); | |
bad93e9d OP |
745 | struct sk_buff *__pskb_copy_fclone(struct sk_buff *skb, int headroom, |
746 | gfp_t gfp_mask, bool fclone); | |
747 | static inline struct sk_buff *__pskb_copy(struct sk_buff *skb, int headroom, | |
748 | gfp_t gfp_mask) | |
749 | { | |
750 | return __pskb_copy_fclone(skb, headroom, gfp_mask, false); | |
751 | } | |
7965bd4d JP |
752 | |
753 | int pskb_expand_head(struct sk_buff *skb, int nhead, int ntail, gfp_t gfp_mask); | |
754 | struct sk_buff *skb_realloc_headroom(struct sk_buff *skb, | |
755 | unsigned int headroom); | |
756 | struct sk_buff *skb_copy_expand(const struct sk_buff *skb, int newheadroom, | |
757 | int newtailroom, gfp_t priority); | |
25a91d8d FD |
758 | int skb_to_sgvec_nomark(struct sk_buff *skb, struct scatterlist *sg, |
759 | int offset, int len); | |
7965bd4d JP |
760 | int skb_to_sgvec(struct sk_buff *skb, struct scatterlist *sg, int offset, |
761 | int len); | |
762 | int skb_cow_data(struct sk_buff *skb, int tailbits, struct sk_buff **trailer); | |
763 | int skb_pad(struct sk_buff *skb, int pad); | |
ead2ceb0 | 764 | #define dev_kfree_skb(a) consume_skb(a) |
1da177e4 | 765 | |
7965bd4d JP |
766 | int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb, |
767 | int getfrag(void *from, char *to, int offset, | |
768 | int len, int odd, struct sk_buff *skb), | |
769 | void *from, int length); | |
e89e9cf5 | 770 | |
d94d9fee | 771 | struct skb_seq_state { |
677e90ed TG |
772 | __u32 lower_offset; |
773 | __u32 upper_offset; | |
774 | __u32 frag_idx; | |
775 | __u32 stepped_offset; | |
776 | struct sk_buff *root_skb; | |
777 | struct sk_buff *cur_skb; | |
778 | __u8 *frag_data; | |
779 | }; | |
780 | ||
7965bd4d JP |
781 | void skb_prepare_seq_read(struct sk_buff *skb, unsigned int from, |
782 | unsigned int to, struct skb_seq_state *st); | |
783 | unsigned int skb_seq_read(unsigned int consumed, const u8 **data, | |
784 | struct skb_seq_state *st); | |
785 | void skb_abort_seq_read(struct skb_seq_state *st); | |
677e90ed | 786 | |
7965bd4d JP |
787 | unsigned int skb_find_text(struct sk_buff *skb, unsigned int from, |
788 | unsigned int to, struct ts_config *config, | |
789 | struct ts_state *state); | |
3fc7e8a6 | 790 | |
09323cc4 TH |
791 | /* |
792 | * Packet hash types specify the type of hash in skb_set_hash. | |
793 | * | |
794 | * Hash types refer to the protocol layer addresses which are used to | |
795 | * construct a packet's hash. The hashes are used to differentiate or identify | |
796 | * flows of the protocol layer for the hash type. Hash types are either | |
797 | * layer-2 (L2), layer-3 (L3), or layer-4 (L4). | |
798 | * | |
799 | * Properties of hashes: | |
800 | * | |
801 | * 1) Two packets in different flows have different hash values | |
802 | * 2) Two packets in the same flow should have the same hash value | |
803 | * | |
804 | * A hash at a higher layer is considered to be more specific. A driver should | |
805 | * set the most specific hash possible. | |
806 | * | |
807 | * A driver cannot indicate a more specific hash than the layer at which a hash | |
808 | * was computed. For instance an L3 hash cannot be set as an L4 hash. | |
809 | * | |
810 | * A driver may indicate a hash level which is less specific than the | |
811 | * actual layer the hash was computed on. For instance, a hash computed | |
812 | * at L4 may be considered an L3 hash. This should only be done if the | |
813 | * driver can't unambiguously determine that the HW computed the hash at | |
814 | * the higher layer. Note that the "should" in the second property above | |
815 | * permits this. | |
816 | */ | |
817 | enum pkt_hash_types { | |
818 | PKT_HASH_TYPE_NONE, /* Undefined type */ | |
819 | PKT_HASH_TYPE_L2, /* Input: src_MAC, dest_MAC */ | |
820 | PKT_HASH_TYPE_L3, /* Input: src_IP, dst_IP */ | |
821 | PKT_HASH_TYPE_L4, /* Input: src_IP, dst_IP, src_port, dst_port */ | |
822 | }; | |
823 | ||
824 | static inline void | |
825 | skb_set_hash(struct sk_buff *skb, __u32 hash, enum pkt_hash_types type) | |
826 | { | |
61b905da | 827 | skb->l4_hash = (type == PKT_HASH_TYPE_L4); |
a3b18ddb | 828 | skb->sw_hash = 0; |
61b905da | 829 | skb->hash = hash; |
09323cc4 TH |
830 | } |
831 | ||
3958afa1 TH |
832 | void __skb_get_hash(struct sk_buff *skb); |
833 | static inline __u32 skb_get_hash(struct sk_buff *skb) | |
bfb564e7 | 834 | { |
a3b18ddb | 835 | if (!skb->l4_hash && !skb->sw_hash) |
3958afa1 | 836 | __skb_get_hash(skb); |
bfb564e7 | 837 | |
61b905da | 838 | return skb->hash; |
bfb564e7 KK |
839 | } |
840 | ||
57bdf7f4 TH |
841 | static inline __u32 skb_get_hash_raw(const struct sk_buff *skb) |
842 | { | |
61b905da | 843 | return skb->hash; |
57bdf7f4 TH |
844 | } |
845 | ||
7539fadc TH |
846 | static inline void skb_clear_hash(struct sk_buff *skb) |
847 | { | |
61b905da | 848 | skb->hash = 0; |
a3b18ddb | 849 | skb->sw_hash = 0; |
61b905da | 850 | skb->l4_hash = 0; |
7539fadc TH |
851 | } |
852 | ||
853 | static inline void skb_clear_hash_if_not_l4(struct sk_buff *skb) | |
854 | { | |
61b905da | 855 | if (!skb->l4_hash) |
7539fadc TH |
856 | skb_clear_hash(skb); |
857 | } | |
858 | ||
3df7a74e TH |
859 | static inline void skb_copy_hash(struct sk_buff *to, const struct sk_buff *from) |
860 | { | |
61b905da | 861 | to->hash = from->hash; |
a3b18ddb | 862 | to->sw_hash = from->sw_hash; |
61b905da | 863 | to->l4_hash = from->l4_hash; |
3df7a74e TH |
864 | }; |
865 | ||
4305b541 ACM |
866 | #ifdef NET_SKBUFF_DATA_USES_OFFSET |
867 | static inline unsigned char *skb_end_pointer(const struct sk_buff *skb) | |
868 | { | |
869 | return skb->head + skb->end; | |
870 | } | |
ec47ea82 AD |
871 | |
872 | static inline unsigned int skb_end_offset(const struct sk_buff *skb) | |
873 | { | |
874 | return skb->end; | |
875 | } | |
4305b541 ACM |
876 | #else |
877 | static inline unsigned char *skb_end_pointer(const struct sk_buff *skb) | |
878 | { | |
879 | return skb->end; | |
880 | } | |
ec47ea82 AD |
881 | |
882 | static inline unsigned int skb_end_offset(const struct sk_buff *skb) | |
883 | { | |
884 | return skb->end - skb->head; | |
885 | } | |
4305b541 ACM |
886 | #endif |
887 | ||
1da177e4 | 888 | /* Internal */ |
4305b541 | 889 | #define skb_shinfo(SKB) ((struct skb_shared_info *)(skb_end_pointer(SKB))) |
1da177e4 | 890 | |
ac45f602 PO |
891 | static inline struct skb_shared_hwtstamps *skb_hwtstamps(struct sk_buff *skb) |
892 | { | |
893 | return &skb_shinfo(skb)->hwtstamps; | |
894 | } | |
895 | ||
1da177e4 LT |
896 | /** |
897 | * skb_queue_empty - check if a queue is empty | |
898 | * @list: queue head | |
899 | * | |
900 | * Returns true if the queue is empty, false otherwise. | |
901 | */ | |
902 | static inline int skb_queue_empty(const struct sk_buff_head *list) | |
903 | { | |
fd44b93c | 904 | return list->next == (const struct sk_buff *) list; |
1da177e4 LT |
905 | } |
906 | ||
fc7ebb21 DM |
907 | /** |
908 | * skb_queue_is_last - check if skb is the last entry in the queue | |
909 | * @list: queue head | |
910 | * @skb: buffer | |
911 | * | |
912 | * Returns true if @skb is the last buffer on the list. | |
913 | */ | |
914 | static inline bool skb_queue_is_last(const struct sk_buff_head *list, | |
915 | const struct sk_buff *skb) | |
916 | { | |
fd44b93c | 917 | return skb->next == (const struct sk_buff *) list; |
fc7ebb21 DM |
918 | } |
919 | ||
832d11c5 IJ |
920 | /** |
921 | * skb_queue_is_first - check if skb is the first entry in the queue | |
922 | * @list: queue head | |
923 | * @skb: buffer | |
924 | * | |
925 | * Returns true if @skb is the first buffer on the list. | |
926 | */ | |
927 | static inline bool skb_queue_is_first(const struct sk_buff_head *list, | |
928 | const struct sk_buff *skb) | |
929 | { | |
fd44b93c | 930 | return skb->prev == (const struct sk_buff *) list; |
832d11c5 IJ |
931 | } |
932 | ||
249c8b42 DM |
933 | /** |
934 | * skb_queue_next - return the next packet in the queue | |
935 | * @list: queue head | |
936 | * @skb: current buffer | |
937 | * | |
938 | * Return the next packet in @list after @skb. It is only valid to | |
939 | * call this if skb_queue_is_last() evaluates to false. | |
940 | */ | |
941 | static inline struct sk_buff *skb_queue_next(const struct sk_buff_head *list, | |
942 | const struct sk_buff *skb) | |
943 | { | |
944 | /* This BUG_ON may seem severe, but if we just return then we | |
945 | * are going to dereference garbage. | |
946 | */ | |
947 | BUG_ON(skb_queue_is_last(list, skb)); | |
948 | return skb->next; | |
949 | } | |
950 | ||
832d11c5 IJ |
951 | /** |
952 | * skb_queue_prev - return the prev packet in the queue | |
953 | * @list: queue head | |
954 | * @skb: current buffer | |
955 | * | |
956 | * Return the prev packet in @list before @skb. It is only valid to | |
957 | * call this if skb_queue_is_first() evaluates to false. | |
958 | */ | |
959 | static inline struct sk_buff *skb_queue_prev(const struct sk_buff_head *list, | |
960 | const struct sk_buff *skb) | |
961 | { | |
962 | /* This BUG_ON may seem severe, but if we just return then we | |
963 | * are going to dereference garbage. | |
964 | */ | |
965 | BUG_ON(skb_queue_is_first(list, skb)); | |
966 | return skb->prev; | |
967 | } | |
968 | ||
1da177e4 LT |
969 | /** |
970 | * skb_get - reference buffer | |
971 | * @skb: buffer to reference | |
972 | * | |
973 | * Makes another reference to a socket buffer and returns a pointer | |
974 | * to the buffer. | |
975 | */ | |
976 | static inline struct sk_buff *skb_get(struct sk_buff *skb) | |
977 | { | |
978 | atomic_inc(&skb->users); | |
979 | return skb; | |
980 | } | |
981 | ||
982 | /* | |
983 | * If users == 1, we are the only owner and are can avoid redundant | |
984 | * atomic change. | |
985 | */ | |
986 | ||
1da177e4 LT |
987 | /** |
988 | * skb_cloned - is the buffer a clone | |
989 | * @skb: buffer to check | |
990 | * | |
991 | * Returns true if the buffer was generated with skb_clone() and is | |
992 | * one of multiple shared copies of the buffer. Cloned buffers are | |
993 | * shared data so must not be written to under normal circumstances. | |
994 | */ | |
995 | static inline int skb_cloned(const struct sk_buff *skb) | |
996 | { | |
997 | return skb->cloned && | |
998 | (atomic_read(&skb_shinfo(skb)->dataref) & SKB_DATAREF_MASK) != 1; | |
999 | } | |
1000 | ||
14bbd6a5 PS |
1001 | static inline int skb_unclone(struct sk_buff *skb, gfp_t pri) |
1002 | { | |
1003 | might_sleep_if(pri & __GFP_WAIT); | |
1004 | ||
1005 | if (skb_cloned(skb)) | |
1006 | return pskb_expand_head(skb, 0, 0, pri); | |
1007 | ||
1008 | return 0; | |
1009 | } | |
1010 | ||
1da177e4 LT |
1011 | /** |
1012 | * skb_header_cloned - is the header a clone | |
1013 | * @skb: buffer to check | |
1014 | * | |
1015 | * Returns true if modifying the header part of the buffer requires | |
1016 | * the data to be copied. | |
1017 | */ | |
1018 | static inline int skb_header_cloned(const struct sk_buff *skb) | |
1019 | { | |
1020 | int dataref; | |
1021 | ||
1022 | if (!skb->cloned) | |
1023 | return 0; | |
1024 | ||
1025 | dataref = atomic_read(&skb_shinfo(skb)->dataref); | |
1026 | dataref = (dataref & SKB_DATAREF_MASK) - (dataref >> SKB_DATAREF_SHIFT); | |
1027 | return dataref != 1; | |
1028 | } | |
1029 | ||
1030 | /** | |
1031 | * skb_header_release - release reference to header | |
1032 | * @skb: buffer to operate on | |
1033 | * | |
1034 | * Drop a reference to the header part of the buffer. This is done | |
1035 | * by acquiring a payload reference. You must not read from the header | |
1036 | * part of skb->data after this. | |
1037 | */ | |
1038 | static inline void skb_header_release(struct sk_buff *skb) | |
1039 | { | |
1040 | BUG_ON(skb->nohdr); | |
1041 | skb->nohdr = 1; | |
1042 | atomic_add(1 << SKB_DATAREF_SHIFT, &skb_shinfo(skb)->dataref); | |
1043 | } | |
1044 | ||
1045 | /** | |
1046 | * skb_shared - is the buffer shared | |
1047 | * @skb: buffer to check | |
1048 | * | |
1049 | * Returns true if more than one person has a reference to this | |
1050 | * buffer. | |
1051 | */ | |
1052 | static inline int skb_shared(const struct sk_buff *skb) | |
1053 | { | |
1054 | return atomic_read(&skb->users) != 1; | |
1055 | } | |
1056 | ||
1057 | /** | |
1058 | * skb_share_check - check if buffer is shared and if so clone it | |
1059 | * @skb: buffer to check | |
1060 | * @pri: priority for memory allocation | |
1061 | * | |
1062 | * If the buffer is shared the buffer is cloned and the old copy | |
1063 | * drops a reference. A new clone with a single reference is returned. | |
1064 | * If the buffer is not shared the original buffer is returned. When | |
1065 | * being called from interrupt status or with spinlocks held pri must | |
1066 | * be GFP_ATOMIC. | |
1067 | * | |
1068 | * NULL is returned on a memory allocation failure. | |
1069 | */ | |
47061bc4 | 1070 | static inline struct sk_buff *skb_share_check(struct sk_buff *skb, gfp_t pri) |
1da177e4 LT |
1071 | { |
1072 | might_sleep_if(pri & __GFP_WAIT); | |
1073 | if (skb_shared(skb)) { | |
1074 | struct sk_buff *nskb = skb_clone(skb, pri); | |
47061bc4 ED |
1075 | |
1076 | if (likely(nskb)) | |
1077 | consume_skb(skb); | |
1078 | else | |
1079 | kfree_skb(skb); | |
1da177e4 LT |
1080 | skb = nskb; |
1081 | } | |
1082 | return skb; | |
1083 | } | |
1084 | ||
1085 | /* | |
1086 | * Copy shared buffers into a new sk_buff. We effectively do COW on | |
1087 | * packets to handle cases where we have a local reader and forward | |
1088 | * and a couple of other messy ones. The normal one is tcpdumping | |
1089 | * a packet thats being forwarded. | |
1090 | */ | |
1091 | ||
1092 | /** | |
1093 | * skb_unshare - make a copy of a shared buffer | |
1094 | * @skb: buffer to check | |
1095 | * @pri: priority for memory allocation | |
1096 | * | |
1097 | * If the socket buffer is a clone then this function creates a new | |
1098 | * copy of the data, drops a reference count on the old copy and returns | |
1099 | * the new copy with the reference count at 1. If the buffer is not a clone | |
1100 | * the original buffer is returned. When called with a spinlock held or | |
1101 | * from interrupt state @pri must be %GFP_ATOMIC | |
1102 | * | |
1103 | * %NULL is returned on a memory allocation failure. | |
1104 | */ | |
e2bf521d | 1105 | static inline struct sk_buff *skb_unshare(struct sk_buff *skb, |
dd0fc66f | 1106 | gfp_t pri) |
1da177e4 LT |
1107 | { |
1108 | might_sleep_if(pri & __GFP_WAIT); | |
1109 | if (skb_cloned(skb)) { | |
1110 | struct sk_buff *nskb = skb_copy(skb, pri); | |
1111 | kfree_skb(skb); /* Free our shared copy */ | |
1112 | skb = nskb; | |
1113 | } | |
1114 | return skb; | |
1115 | } | |
1116 | ||
1117 | /** | |
1a5778aa | 1118 | * skb_peek - peek at the head of an &sk_buff_head |
1da177e4 LT |
1119 | * @list_: list to peek at |
1120 | * | |
1121 | * Peek an &sk_buff. Unlike most other operations you _MUST_ | |
1122 | * be careful with this one. A peek leaves the buffer on the | |
1123 | * list and someone else may run off with it. You must hold | |
1124 | * the appropriate locks or have a private queue to do this. | |
1125 | * | |
1126 | * Returns %NULL for an empty list or a pointer to the head element. | |
1127 | * The reference count is not incremented and the reference is therefore | |
1128 | * volatile. Use with caution. | |
1129 | */ | |
05bdd2f1 | 1130 | static inline struct sk_buff *skb_peek(const struct sk_buff_head *list_) |
1da177e4 | 1131 | { |
18d07000 ED |
1132 | struct sk_buff *skb = list_->next; |
1133 | ||
1134 | if (skb == (struct sk_buff *)list_) | |
1135 | skb = NULL; | |
1136 | return skb; | |
1da177e4 LT |
1137 | } |
1138 | ||
da5ef6e5 PE |
1139 | /** |
1140 | * skb_peek_next - peek skb following the given one from a queue | |
1141 | * @skb: skb to start from | |
1142 | * @list_: list to peek at | |
1143 | * | |
1144 | * Returns %NULL when the end of the list is met or a pointer to the | |
1145 | * next element. The reference count is not incremented and the | |
1146 | * reference is therefore volatile. Use with caution. | |
1147 | */ | |
1148 | static inline struct sk_buff *skb_peek_next(struct sk_buff *skb, | |
1149 | const struct sk_buff_head *list_) | |
1150 | { | |
1151 | struct sk_buff *next = skb->next; | |
18d07000 | 1152 | |
da5ef6e5 PE |
1153 | if (next == (struct sk_buff *)list_) |
1154 | next = NULL; | |
1155 | return next; | |
1156 | } | |
1157 | ||
1da177e4 | 1158 | /** |
1a5778aa | 1159 | * skb_peek_tail - peek at the tail of an &sk_buff_head |
1da177e4 LT |
1160 | * @list_: list to peek at |
1161 | * | |
1162 | * Peek an &sk_buff. Unlike most other operations you _MUST_ | |
1163 | * be careful with this one. A peek leaves the buffer on the | |
1164 | * list and someone else may run off with it. You must hold | |
1165 | * the appropriate locks or have a private queue to do this. | |
1166 | * | |
1167 | * Returns %NULL for an empty list or a pointer to the tail element. | |
1168 | * The reference count is not incremented and the reference is therefore | |
1169 | * volatile. Use with caution. | |
1170 | */ | |
05bdd2f1 | 1171 | static inline struct sk_buff *skb_peek_tail(const struct sk_buff_head *list_) |
1da177e4 | 1172 | { |
18d07000 ED |
1173 | struct sk_buff *skb = list_->prev; |
1174 | ||
1175 | if (skb == (struct sk_buff *)list_) | |
1176 | skb = NULL; | |
1177 | return skb; | |
1178 | ||
1da177e4 LT |
1179 | } |
1180 | ||
1181 | /** | |
1182 | * skb_queue_len - get queue length | |
1183 | * @list_: list to measure | |
1184 | * | |
1185 | * Return the length of an &sk_buff queue. | |
1186 | */ | |
1187 | static inline __u32 skb_queue_len(const struct sk_buff_head *list_) | |
1188 | { | |
1189 | return list_->qlen; | |
1190 | } | |
1191 | ||
67fed459 DM |
1192 | /** |
1193 | * __skb_queue_head_init - initialize non-spinlock portions of sk_buff_head | |
1194 | * @list: queue to initialize | |
1195 | * | |
1196 | * This initializes only the list and queue length aspects of | |
1197 | * an sk_buff_head object. This allows to initialize the list | |
1198 | * aspects of an sk_buff_head without reinitializing things like | |
1199 | * the spinlock. It can also be used for on-stack sk_buff_head | |
1200 | * objects where the spinlock is known to not be used. | |
1201 | */ | |
1202 | static inline void __skb_queue_head_init(struct sk_buff_head *list) | |
1203 | { | |
1204 | list->prev = list->next = (struct sk_buff *)list; | |
1205 | list->qlen = 0; | |
1206 | } | |
1207 | ||
76f10ad0 AV |
1208 | /* |
1209 | * This function creates a split out lock class for each invocation; | |
1210 | * this is needed for now since a whole lot of users of the skb-queue | |
1211 | * infrastructure in drivers have different locking usage (in hardirq) | |
1212 | * than the networking core (in softirq only). In the long run either the | |
1213 | * network layer or drivers should need annotation to consolidate the | |
1214 | * main types of usage into 3 classes. | |
1215 | */ | |
1da177e4 LT |
1216 | static inline void skb_queue_head_init(struct sk_buff_head *list) |
1217 | { | |
1218 | spin_lock_init(&list->lock); | |
67fed459 | 1219 | __skb_queue_head_init(list); |
1da177e4 LT |
1220 | } |
1221 | ||
c2ecba71 PE |
1222 | static inline void skb_queue_head_init_class(struct sk_buff_head *list, |
1223 | struct lock_class_key *class) | |
1224 | { | |
1225 | skb_queue_head_init(list); | |
1226 | lockdep_set_class(&list->lock, class); | |
1227 | } | |
1228 | ||
1da177e4 | 1229 | /* |
bf299275 | 1230 | * Insert an sk_buff on a list. |
1da177e4 LT |
1231 | * |
1232 | * The "__skb_xxxx()" functions are the non-atomic ones that | |
1233 | * can only be called with interrupts disabled. | |
1234 | */ | |
7965bd4d JP |
1235 | void skb_insert(struct sk_buff *old, struct sk_buff *newsk, |
1236 | struct sk_buff_head *list); | |
bf299275 GR |
1237 | static inline void __skb_insert(struct sk_buff *newsk, |
1238 | struct sk_buff *prev, struct sk_buff *next, | |
1239 | struct sk_buff_head *list) | |
1240 | { | |
1241 | newsk->next = next; | |
1242 | newsk->prev = prev; | |
1243 | next->prev = prev->next = newsk; | |
1244 | list->qlen++; | |
1245 | } | |
1da177e4 | 1246 | |
67fed459 DM |
1247 | static inline void __skb_queue_splice(const struct sk_buff_head *list, |
1248 | struct sk_buff *prev, | |
1249 | struct sk_buff *next) | |
1250 | { | |
1251 | struct sk_buff *first = list->next; | |
1252 | struct sk_buff *last = list->prev; | |
1253 | ||
1254 | first->prev = prev; | |
1255 | prev->next = first; | |
1256 | ||
1257 | last->next = next; | |
1258 | next->prev = last; | |
1259 | } | |
1260 | ||
1261 | /** | |
1262 | * skb_queue_splice - join two skb lists, this is designed for stacks | |
1263 | * @list: the new list to add | |
1264 | * @head: the place to add it in the first list | |
1265 | */ | |
1266 | static inline void skb_queue_splice(const struct sk_buff_head *list, | |
1267 | struct sk_buff_head *head) | |
1268 | { | |
1269 | if (!skb_queue_empty(list)) { | |
1270 | __skb_queue_splice(list, (struct sk_buff *) head, head->next); | |
1d4a31dd | 1271 | head->qlen += list->qlen; |
67fed459 DM |
1272 | } |
1273 | } | |
1274 | ||
1275 | /** | |
d9619496 | 1276 | * skb_queue_splice_init - join two skb lists and reinitialise the emptied list |
67fed459 DM |
1277 | * @list: the new list to add |
1278 | * @head: the place to add it in the first list | |
1279 | * | |
1280 | * The list at @list is reinitialised | |
1281 | */ | |
1282 | static inline void skb_queue_splice_init(struct sk_buff_head *list, | |
1283 | struct sk_buff_head *head) | |
1284 | { | |
1285 | if (!skb_queue_empty(list)) { | |
1286 | __skb_queue_splice(list, (struct sk_buff *) head, head->next); | |
1d4a31dd | 1287 | head->qlen += list->qlen; |
67fed459 DM |
1288 | __skb_queue_head_init(list); |
1289 | } | |
1290 | } | |
1291 | ||
1292 | /** | |
1293 | * skb_queue_splice_tail - join two skb lists, each list being a queue | |
1294 | * @list: the new list to add | |
1295 | * @head: the place to add it in the first list | |
1296 | */ | |
1297 | static inline void skb_queue_splice_tail(const struct sk_buff_head *list, | |
1298 | struct sk_buff_head *head) | |
1299 | { | |
1300 | if (!skb_queue_empty(list)) { | |
1301 | __skb_queue_splice(list, head->prev, (struct sk_buff *) head); | |
1d4a31dd | 1302 | head->qlen += list->qlen; |
67fed459 DM |
1303 | } |
1304 | } | |
1305 | ||
1306 | /** | |
d9619496 | 1307 | * skb_queue_splice_tail_init - join two skb lists and reinitialise the emptied list |
67fed459 DM |
1308 | * @list: the new list to add |
1309 | * @head: the place to add it in the first list | |
1310 | * | |
1311 | * Each of the lists is a queue. | |
1312 | * The list at @list is reinitialised | |
1313 | */ | |
1314 | static inline void skb_queue_splice_tail_init(struct sk_buff_head *list, | |
1315 | struct sk_buff_head *head) | |
1316 | { | |
1317 | if (!skb_queue_empty(list)) { | |
1318 | __skb_queue_splice(list, head->prev, (struct sk_buff *) head); | |
1d4a31dd | 1319 | head->qlen += list->qlen; |
67fed459 DM |
1320 | __skb_queue_head_init(list); |
1321 | } | |
1322 | } | |
1323 | ||
1da177e4 | 1324 | /** |
300ce174 | 1325 | * __skb_queue_after - queue a buffer at the list head |
1da177e4 | 1326 | * @list: list to use |
300ce174 | 1327 | * @prev: place after this buffer |
1da177e4 LT |
1328 | * @newsk: buffer to queue |
1329 | * | |
300ce174 | 1330 | * Queue a buffer int the middle of a list. This function takes no locks |
1da177e4 LT |
1331 | * and you must therefore hold required locks before calling it. |
1332 | * | |
1333 | * A buffer cannot be placed on two lists at the same time. | |
1334 | */ | |
300ce174 SH |
1335 | static inline void __skb_queue_after(struct sk_buff_head *list, |
1336 | struct sk_buff *prev, | |
1337 | struct sk_buff *newsk) | |
1da177e4 | 1338 | { |
bf299275 | 1339 | __skb_insert(newsk, prev, prev->next, list); |
1da177e4 LT |
1340 | } |
1341 | ||
7965bd4d JP |
1342 | void skb_append(struct sk_buff *old, struct sk_buff *newsk, |
1343 | struct sk_buff_head *list); | |
7de6c033 | 1344 | |
f5572855 GR |
1345 | static inline void __skb_queue_before(struct sk_buff_head *list, |
1346 | struct sk_buff *next, | |
1347 | struct sk_buff *newsk) | |
1348 | { | |
1349 | __skb_insert(newsk, next->prev, next, list); | |
1350 | } | |
1351 | ||
300ce174 SH |
1352 | /** |
1353 | * __skb_queue_head - queue a buffer at the list head | |
1354 | * @list: list to use | |
1355 | * @newsk: buffer to queue | |
1356 | * | |
1357 | * Queue a buffer at the start of a list. This function takes no locks | |
1358 | * and you must therefore hold required locks before calling it. | |
1359 | * | |
1360 | * A buffer cannot be placed on two lists at the same time. | |
1361 | */ | |
7965bd4d | 1362 | void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk); |
300ce174 SH |
1363 | static inline void __skb_queue_head(struct sk_buff_head *list, |
1364 | struct sk_buff *newsk) | |
1365 | { | |
1366 | __skb_queue_after(list, (struct sk_buff *)list, newsk); | |
1367 | } | |
1368 | ||
1da177e4 LT |
1369 | /** |
1370 | * __skb_queue_tail - queue a buffer at the list tail | |
1371 | * @list: list to use | |
1372 | * @newsk: buffer to queue | |
1373 | * | |
1374 | * Queue a buffer at the end of a list. This function takes no locks | |
1375 | * and you must therefore hold required locks before calling it. | |
1376 | * | |
1377 | * A buffer cannot be placed on two lists at the same time. | |
1378 | */ | |
7965bd4d | 1379 | void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk); |
1da177e4 LT |
1380 | static inline void __skb_queue_tail(struct sk_buff_head *list, |
1381 | struct sk_buff *newsk) | |
1382 | { | |
f5572855 | 1383 | __skb_queue_before(list, (struct sk_buff *)list, newsk); |
1da177e4 LT |
1384 | } |
1385 | ||
1da177e4 LT |
1386 | /* |
1387 | * remove sk_buff from list. _Must_ be called atomically, and with | |
1388 | * the list known.. | |
1389 | */ | |
7965bd4d | 1390 | void skb_unlink(struct sk_buff *skb, struct sk_buff_head *list); |
1da177e4 LT |
1391 | static inline void __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list) |
1392 | { | |
1393 | struct sk_buff *next, *prev; | |
1394 | ||
1395 | list->qlen--; | |
1396 | next = skb->next; | |
1397 | prev = skb->prev; | |
1398 | skb->next = skb->prev = NULL; | |
1da177e4 LT |
1399 | next->prev = prev; |
1400 | prev->next = next; | |
1401 | } | |
1402 | ||
f525c06d GR |
1403 | /** |
1404 | * __skb_dequeue - remove from the head of the queue | |
1405 | * @list: list to dequeue from | |
1406 | * | |
1407 | * Remove the head of the list. This function does not take any locks | |
1408 | * so must be used with appropriate locks held only. The head item is | |
1409 | * returned or %NULL if the list is empty. | |
1410 | */ | |
7965bd4d | 1411 | struct sk_buff *skb_dequeue(struct sk_buff_head *list); |
f525c06d GR |
1412 | static inline struct sk_buff *__skb_dequeue(struct sk_buff_head *list) |
1413 | { | |
1414 | struct sk_buff *skb = skb_peek(list); | |
1415 | if (skb) | |
1416 | __skb_unlink(skb, list); | |
1417 | return skb; | |
1418 | } | |
1da177e4 LT |
1419 | |
1420 | /** | |
1421 | * __skb_dequeue_tail - remove from the tail of the queue | |
1422 | * @list: list to dequeue from | |
1423 | * | |
1424 | * Remove the tail of the list. This function does not take any locks | |
1425 | * so must be used with appropriate locks held only. The tail item is | |
1426 | * returned or %NULL if the list is empty. | |
1427 | */ | |
7965bd4d | 1428 | struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list); |
1da177e4 LT |
1429 | static inline struct sk_buff *__skb_dequeue_tail(struct sk_buff_head *list) |
1430 | { | |
1431 | struct sk_buff *skb = skb_peek_tail(list); | |
1432 | if (skb) | |
1433 | __skb_unlink(skb, list); | |
1434 | return skb; | |
1435 | } | |
1436 | ||
1437 | ||
bdcc0924 | 1438 | static inline bool skb_is_nonlinear(const struct sk_buff *skb) |
1da177e4 LT |
1439 | { |
1440 | return skb->data_len; | |
1441 | } | |
1442 | ||
1443 | static inline unsigned int skb_headlen(const struct sk_buff *skb) | |
1444 | { | |
1445 | return skb->len - skb->data_len; | |
1446 | } | |
1447 | ||
1448 | static inline int skb_pagelen(const struct sk_buff *skb) | |
1449 | { | |
1450 | int i, len = 0; | |
1451 | ||
1452 | for (i = (int)skb_shinfo(skb)->nr_frags - 1; i >= 0; i--) | |
9e903e08 | 1453 | len += skb_frag_size(&skb_shinfo(skb)->frags[i]); |
1da177e4 LT |
1454 | return len + skb_headlen(skb); |
1455 | } | |
1456 | ||
131ea667 IC |
1457 | /** |
1458 | * __skb_fill_page_desc - initialise a paged fragment in an skb | |
1459 | * @skb: buffer containing fragment to be initialised | |
1460 | * @i: paged fragment index to initialise | |
1461 | * @page: the page to use for this fragment | |
1462 | * @off: the offset to the data with @page | |
1463 | * @size: the length of the data | |
1464 | * | |
1465 | * Initialises the @i'th fragment of @skb to point to &size bytes at | |
1466 | * offset @off within @page. | |
1467 | * | |
1468 | * Does not take any additional reference on the fragment. | |
1469 | */ | |
1470 | static inline void __skb_fill_page_desc(struct sk_buff *skb, int i, | |
1471 | struct page *page, int off, int size) | |
1da177e4 LT |
1472 | { |
1473 | skb_frag_t *frag = &skb_shinfo(skb)->frags[i]; | |
1474 | ||
c48a11c7 MG |
1475 | /* |
1476 | * Propagate page->pfmemalloc to the skb if we can. The problem is | |
1477 | * that not all callers have unique ownership of the page. If | |
1478 | * pfmemalloc is set, we check the mapping as a mapping implies | |
1479 | * page->index is set (index and pfmemalloc share space). | |
1480 | * If it's a valid mapping, we cannot use page->pfmemalloc but we | |
1481 | * do not lose pfmemalloc information as the pages would not be | |
1482 | * allocated using __GFP_MEMALLOC. | |
1483 | */ | |
a8605c60 | 1484 | frag->page.p = page; |
1da177e4 | 1485 | frag->page_offset = off; |
9e903e08 | 1486 | skb_frag_size_set(frag, size); |
cca7af38 PE |
1487 | |
1488 | page = compound_head(page); | |
1489 | if (page->pfmemalloc && !page->mapping) | |
1490 | skb->pfmemalloc = true; | |
131ea667 IC |
1491 | } |
1492 | ||
1493 | /** | |
1494 | * skb_fill_page_desc - initialise a paged fragment in an skb | |
1495 | * @skb: buffer containing fragment to be initialised | |
1496 | * @i: paged fragment index to initialise | |
1497 | * @page: the page to use for this fragment | |
1498 | * @off: the offset to the data with @page | |
1499 | * @size: the length of the data | |
1500 | * | |
1501 | * As per __skb_fill_page_desc() -- initialises the @i'th fragment of | |
bc32383c | 1502 | * @skb to point to @size bytes at offset @off within @page. In |
131ea667 IC |
1503 | * addition updates @skb such that @i is the last fragment. |
1504 | * | |
1505 | * Does not take any additional reference on the fragment. | |
1506 | */ | |
1507 | static inline void skb_fill_page_desc(struct sk_buff *skb, int i, | |
1508 | struct page *page, int off, int size) | |
1509 | { | |
1510 | __skb_fill_page_desc(skb, i, page, off, size); | |
1da177e4 LT |
1511 | skb_shinfo(skb)->nr_frags = i + 1; |
1512 | } | |
1513 | ||
7965bd4d JP |
1514 | void skb_add_rx_frag(struct sk_buff *skb, int i, struct page *page, int off, |
1515 | int size, unsigned int truesize); | |
654bed16 | 1516 | |
f8e617e1 JW |
1517 | void skb_coalesce_rx_frag(struct sk_buff *skb, int i, int size, |
1518 | unsigned int truesize); | |
1519 | ||
1da177e4 | 1520 | #define SKB_PAGE_ASSERT(skb) BUG_ON(skb_shinfo(skb)->nr_frags) |
21dc3301 | 1521 | #define SKB_FRAG_ASSERT(skb) BUG_ON(skb_has_frag_list(skb)) |
1da177e4 LT |
1522 | #define SKB_LINEAR_ASSERT(skb) BUG_ON(skb_is_nonlinear(skb)) |
1523 | ||
27a884dc ACM |
1524 | #ifdef NET_SKBUFF_DATA_USES_OFFSET |
1525 | static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb) | |
1526 | { | |
1527 | return skb->head + skb->tail; | |
1528 | } | |
1529 | ||
1530 | static inline void skb_reset_tail_pointer(struct sk_buff *skb) | |
1531 | { | |
1532 | skb->tail = skb->data - skb->head; | |
1533 | } | |
1534 | ||
1535 | static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset) | |
1536 | { | |
1537 | skb_reset_tail_pointer(skb); | |
1538 | skb->tail += offset; | |
1539 | } | |
7cc46190 | 1540 | |
27a884dc ACM |
1541 | #else /* NET_SKBUFF_DATA_USES_OFFSET */ |
1542 | static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb) | |
1543 | { | |
1544 | return skb->tail; | |
1545 | } | |
1546 | ||
1547 | static inline void skb_reset_tail_pointer(struct sk_buff *skb) | |
1548 | { | |
1549 | skb->tail = skb->data; | |
1550 | } | |
1551 | ||
1552 | static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset) | |
1553 | { | |
1554 | skb->tail = skb->data + offset; | |
1555 | } | |
4305b541 | 1556 | |
27a884dc ACM |
1557 | #endif /* NET_SKBUFF_DATA_USES_OFFSET */ |
1558 | ||
1da177e4 LT |
1559 | /* |
1560 | * Add data to an sk_buff | |
1561 | */ | |
0c7ddf36 | 1562 | unsigned char *pskb_put(struct sk_buff *skb, struct sk_buff *tail, int len); |
7965bd4d | 1563 | unsigned char *skb_put(struct sk_buff *skb, unsigned int len); |
1da177e4 LT |
1564 | static inline unsigned char *__skb_put(struct sk_buff *skb, unsigned int len) |
1565 | { | |
27a884dc | 1566 | unsigned char *tmp = skb_tail_pointer(skb); |
1da177e4 LT |
1567 | SKB_LINEAR_ASSERT(skb); |
1568 | skb->tail += len; | |
1569 | skb->len += len; | |
1570 | return tmp; | |
1571 | } | |
1572 | ||
7965bd4d | 1573 | unsigned char *skb_push(struct sk_buff *skb, unsigned int len); |
1da177e4 LT |
1574 | static inline unsigned char *__skb_push(struct sk_buff *skb, unsigned int len) |
1575 | { | |
1576 | skb->data -= len; | |
1577 | skb->len += len; | |
1578 | return skb->data; | |
1579 | } | |
1580 | ||
7965bd4d | 1581 | unsigned char *skb_pull(struct sk_buff *skb, unsigned int len); |
1da177e4 LT |
1582 | static inline unsigned char *__skb_pull(struct sk_buff *skb, unsigned int len) |
1583 | { | |
1584 | skb->len -= len; | |
1585 | BUG_ON(skb->len < skb->data_len); | |
1586 | return skb->data += len; | |
1587 | } | |
1588 | ||
47d29646 DM |
1589 | static inline unsigned char *skb_pull_inline(struct sk_buff *skb, unsigned int len) |
1590 | { | |
1591 | return unlikely(len > skb->len) ? NULL : __skb_pull(skb, len); | |
1592 | } | |
1593 | ||
7965bd4d | 1594 | unsigned char *__pskb_pull_tail(struct sk_buff *skb, int delta); |
1da177e4 LT |
1595 | |
1596 | static inline unsigned char *__pskb_pull(struct sk_buff *skb, unsigned int len) | |
1597 | { | |
1598 | if (len > skb_headlen(skb) && | |
987c402a | 1599 | !__pskb_pull_tail(skb, len - skb_headlen(skb))) |
1da177e4 LT |
1600 | return NULL; |
1601 | skb->len -= len; | |
1602 | return skb->data += len; | |
1603 | } | |
1604 | ||
1605 | static inline unsigned char *pskb_pull(struct sk_buff *skb, unsigned int len) | |
1606 | { | |
1607 | return unlikely(len > skb->len) ? NULL : __pskb_pull(skb, len); | |
1608 | } | |
1609 | ||
1610 | static inline int pskb_may_pull(struct sk_buff *skb, unsigned int len) | |
1611 | { | |
1612 | if (likely(len <= skb_headlen(skb))) | |
1613 | return 1; | |
1614 | if (unlikely(len > skb->len)) | |
1615 | return 0; | |
987c402a | 1616 | return __pskb_pull_tail(skb, len - skb_headlen(skb)) != NULL; |
1da177e4 LT |
1617 | } |
1618 | ||
1619 | /** | |
1620 | * skb_headroom - bytes at buffer head | |
1621 | * @skb: buffer to check | |
1622 | * | |
1623 | * Return the number of bytes of free space at the head of an &sk_buff. | |
1624 | */ | |
c2636b4d | 1625 | static inline unsigned int skb_headroom(const struct sk_buff *skb) |
1da177e4 LT |
1626 | { |
1627 | return skb->data - skb->head; | |
1628 | } | |
1629 | ||
1630 | /** | |
1631 | * skb_tailroom - bytes at buffer end | |
1632 | * @skb: buffer to check | |
1633 | * | |
1634 | * Return the number of bytes of free space at the tail of an sk_buff | |
1635 | */ | |
1636 | static inline int skb_tailroom(const struct sk_buff *skb) | |
1637 | { | |
4305b541 | 1638 | return skb_is_nonlinear(skb) ? 0 : skb->end - skb->tail; |
1da177e4 LT |
1639 | } |
1640 | ||
a21d4572 ED |
1641 | /** |
1642 | * skb_availroom - bytes at buffer end | |
1643 | * @skb: buffer to check | |
1644 | * | |
1645 | * Return the number of bytes of free space at the tail of an sk_buff | |
1646 | * allocated by sk_stream_alloc() | |
1647 | */ | |
1648 | static inline int skb_availroom(const struct sk_buff *skb) | |
1649 | { | |
16fad69c ED |
1650 | if (skb_is_nonlinear(skb)) |
1651 | return 0; | |
1652 | ||
1653 | return skb->end - skb->tail - skb->reserved_tailroom; | |
a21d4572 ED |
1654 | } |
1655 | ||
1da177e4 LT |
1656 | /** |
1657 | * skb_reserve - adjust headroom | |
1658 | * @skb: buffer to alter | |
1659 | * @len: bytes to move | |
1660 | * | |
1661 | * Increase the headroom of an empty &sk_buff by reducing the tail | |
1662 | * room. This is only allowed for an empty buffer. | |
1663 | */ | |
8243126c | 1664 | static inline void skb_reserve(struct sk_buff *skb, int len) |
1da177e4 LT |
1665 | { |
1666 | skb->data += len; | |
1667 | skb->tail += len; | |
1668 | } | |
1669 | ||
6a674e9c JG |
1670 | static inline void skb_reset_inner_headers(struct sk_buff *skb) |
1671 | { | |
aefbd2b3 | 1672 | skb->inner_mac_header = skb->mac_header; |
6a674e9c JG |
1673 | skb->inner_network_header = skb->network_header; |
1674 | skb->inner_transport_header = skb->transport_header; | |
1675 | } | |
1676 | ||
0b5c9db1 JP |
1677 | static inline void skb_reset_mac_len(struct sk_buff *skb) |
1678 | { | |
1679 | skb->mac_len = skb->network_header - skb->mac_header; | |
1680 | } | |
1681 | ||
6a674e9c JG |
1682 | static inline unsigned char *skb_inner_transport_header(const struct sk_buff |
1683 | *skb) | |
1684 | { | |
1685 | return skb->head + skb->inner_transport_header; | |
1686 | } | |
1687 | ||
1688 | static inline void skb_reset_inner_transport_header(struct sk_buff *skb) | |
1689 | { | |
1690 | skb->inner_transport_header = skb->data - skb->head; | |
1691 | } | |
1692 | ||
1693 | static inline void skb_set_inner_transport_header(struct sk_buff *skb, | |
1694 | const int offset) | |
1695 | { | |
1696 | skb_reset_inner_transport_header(skb); | |
1697 | skb->inner_transport_header += offset; | |
1698 | } | |
1699 | ||
1700 | static inline unsigned char *skb_inner_network_header(const struct sk_buff *skb) | |
1701 | { | |
1702 | return skb->head + skb->inner_network_header; | |
1703 | } | |
1704 | ||
1705 | static inline void skb_reset_inner_network_header(struct sk_buff *skb) | |
1706 | { | |
1707 | skb->inner_network_header = skb->data - skb->head; | |
1708 | } | |
1709 | ||
1710 | static inline void skb_set_inner_network_header(struct sk_buff *skb, | |
1711 | const int offset) | |
1712 | { | |
1713 | skb_reset_inner_network_header(skb); | |
1714 | skb->inner_network_header += offset; | |
1715 | } | |
1716 | ||
aefbd2b3 PS |
1717 | static inline unsigned char *skb_inner_mac_header(const struct sk_buff *skb) |
1718 | { | |
1719 | return skb->head + skb->inner_mac_header; | |
1720 | } | |
1721 | ||
1722 | static inline void skb_reset_inner_mac_header(struct sk_buff *skb) | |
1723 | { | |
1724 | skb->inner_mac_header = skb->data - skb->head; | |
1725 | } | |
1726 | ||
1727 | static inline void skb_set_inner_mac_header(struct sk_buff *skb, | |
1728 | const int offset) | |
1729 | { | |
1730 | skb_reset_inner_mac_header(skb); | |
1731 | skb->inner_mac_header += offset; | |
1732 | } | |
fda55eca ED |
1733 | static inline bool skb_transport_header_was_set(const struct sk_buff *skb) |
1734 | { | |
35d04610 | 1735 | return skb->transport_header != (typeof(skb->transport_header))~0U; |
fda55eca ED |
1736 | } |
1737 | ||
9c70220b ACM |
1738 | static inline unsigned char *skb_transport_header(const struct sk_buff *skb) |
1739 | { | |
2e07fa9c | 1740 | return skb->head + skb->transport_header; |
9c70220b ACM |
1741 | } |
1742 | ||
badff6d0 ACM |
1743 | static inline void skb_reset_transport_header(struct sk_buff *skb) |
1744 | { | |
2e07fa9c | 1745 | skb->transport_header = skb->data - skb->head; |
badff6d0 ACM |
1746 | } |
1747 | ||
967b05f6 ACM |
1748 | static inline void skb_set_transport_header(struct sk_buff *skb, |
1749 | const int offset) | |
1750 | { | |
2e07fa9c ACM |
1751 | skb_reset_transport_header(skb); |
1752 | skb->transport_header += offset; | |
ea2ae17d ACM |
1753 | } |
1754 | ||
d56f90a7 ACM |
1755 | static inline unsigned char *skb_network_header(const struct sk_buff *skb) |
1756 | { | |
2e07fa9c | 1757 | return skb->head + skb->network_header; |
d56f90a7 ACM |
1758 | } |
1759 | ||
c1d2bbe1 ACM |
1760 | static inline void skb_reset_network_header(struct sk_buff *skb) |
1761 | { | |
2e07fa9c | 1762 | skb->network_header = skb->data - skb->head; |
c1d2bbe1 ACM |
1763 | } |
1764 | ||
c14d2450 ACM |
1765 | static inline void skb_set_network_header(struct sk_buff *skb, const int offset) |
1766 | { | |
2e07fa9c ACM |
1767 | skb_reset_network_header(skb); |
1768 | skb->network_header += offset; | |
c14d2450 ACM |
1769 | } |
1770 | ||
2e07fa9c | 1771 | static inline unsigned char *skb_mac_header(const struct sk_buff *skb) |
bbe735e4 | 1772 | { |
2e07fa9c | 1773 | return skb->head + skb->mac_header; |
bbe735e4 ACM |
1774 | } |
1775 | ||
2e07fa9c | 1776 | static inline int skb_mac_header_was_set(const struct sk_buff *skb) |
cfe1fc77 | 1777 | { |
35d04610 | 1778 | return skb->mac_header != (typeof(skb->mac_header))~0U; |
2e07fa9c ACM |
1779 | } |
1780 | ||
1781 | static inline void skb_reset_mac_header(struct sk_buff *skb) | |
1782 | { | |
1783 | skb->mac_header = skb->data - skb->head; | |
1784 | } | |
1785 | ||
1786 | static inline void skb_set_mac_header(struct sk_buff *skb, const int offset) | |
1787 | { | |
1788 | skb_reset_mac_header(skb); | |
1789 | skb->mac_header += offset; | |
1790 | } | |
1791 | ||
0e3da5bb TT |
1792 | static inline void skb_pop_mac_header(struct sk_buff *skb) |
1793 | { | |
1794 | skb->mac_header = skb->network_header; | |
1795 | } | |
1796 | ||
fbbdb8f0 YX |
1797 | static inline void skb_probe_transport_header(struct sk_buff *skb, |
1798 | const int offset_hint) | |
1799 | { | |
1800 | struct flow_keys keys; | |
1801 | ||
1802 | if (skb_transport_header_was_set(skb)) | |
1803 | return; | |
1804 | else if (skb_flow_dissect(skb, &keys)) | |
1805 | skb_set_transport_header(skb, keys.thoff); | |
1806 | else | |
1807 | skb_set_transport_header(skb, offset_hint); | |
1808 | } | |
1809 | ||
03606895 ED |
1810 | static inline void skb_mac_header_rebuild(struct sk_buff *skb) |
1811 | { | |
1812 | if (skb_mac_header_was_set(skb)) { | |
1813 | const unsigned char *old_mac = skb_mac_header(skb); | |
1814 | ||
1815 | skb_set_mac_header(skb, -skb->mac_len); | |
1816 | memmove(skb_mac_header(skb), old_mac, skb->mac_len); | |
1817 | } | |
1818 | } | |
1819 | ||
04fb451e MM |
1820 | static inline int skb_checksum_start_offset(const struct sk_buff *skb) |
1821 | { | |
1822 | return skb->csum_start - skb_headroom(skb); | |
1823 | } | |
1824 | ||
2e07fa9c ACM |
1825 | static inline int skb_transport_offset(const struct sk_buff *skb) |
1826 | { | |
1827 | return skb_transport_header(skb) - skb->data; | |
1828 | } | |
1829 | ||
1830 | static inline u32 skb_network_header_len(const struct sk_buff *skb) | |
1831 | { | |
1832 | return skb->transport_header - skb->network_header; | |
1833 | } | |
1834 | ||
6a674e9c JG |
1835 | static inline u32 skb_inner_network_header_len(const struct sk_buff *skb) |
1836 | { | |
1837 | return skb->inner_transport_header - skb->inner_network_header; | |
1838 | } | |
1839 | ||
2e07fa9c ACM |
1840 | static inline int skb_network_offset(const struct sk_buff *skb) |
1841 | { | |
1842 | return skb_network_header(skb) - skb->data; | |
1843 | } | |
48d49d0c | 1844 | |
6a674e9c JG |
1845 | static inline int skb_inner_network_offset(const struct sk_buff *skb) |
1846 | { | |
1847 | return skb_inner_network_header(skb) - skb->data; | |
1848 | } | |
1849 | ||
f9599ce1 CG |
1850 | static inline int pskb_network_may_pull(struct sk_buff *skb, unsigned int len) |
1851 | { | |
1852 | return pskb_may_pull(skb, skb_network_offset(skb) + len); | |
1853 | } | |
1854 | ||
e5eb4e30 TH |
1855 | static inline void skb_pop_rcv_encapsulation(struct sk_buff *skb) |
1856 | { | |
1857 | /* Only continue with checksum unnecessary if device indicated | |
1858 | * it is valid across encapsulation (skb->encapsulation was set). | |
1859 | */ | |
1860 | if (skb->ip_summed == CHECKSUM_UNNECESSARY && !skb->encapsulation) | |
1861 | skb->ip_summed = CHECKSUM_NONE; | |
1862 | ||
1863 | skb->encapsulation = 0; | |
1864 | skb->csum_valid = 0; | |
1865 | } | |
1866 | ||
1da177e4 LT |
1867 | /* |
1868 | * CPUs often take a performance hit when accessing unaligned memory | |
1869 | * locations. The actual performance hit varies, it can be small if the | |
1870 | * hardware handles it or large if we have to take an exception and fix it | |
1871 | * in software. | |
1872 | * | |
1873 | * Since an ethernet header is 14 bytes network drivers often end up with | |
1874 | * the IP header at an unaligned offset. The IP header can be aligned by | |
1875 | * shifting the start of the packet by 2 bytes. Drivers should do this | |
1876 | * with: | |
1877 | * | |
8660c124 | 1878 | * skb_reserve(skb, NET_IP_ALIGN); |
1da177e4 LT |
1879 | * |
1880 | * The downside to this alignment of the IP header is that the DMA is now | |
1881 | * unaligned. On some architectures the cost of an unaligned DMA is high | |
1882 | * and this cost outweighs the gains made by aligning the IP header. | |
8660c124 | 1883 | * |
1da177e4 LT |
1884 | * Since this trade off varies between architectures, we allow NET_IP_ALIGN |
1885 | * to be overridden. | |
1886 | */ | |
1887 | #ifndef NET_IP_ALIGN | |
1888 | #define NET_IP_ALIGN 2 | |
1889 | #endif | |
1890 | ||
025be81e AB |
1891 | /* |
1892 | * The networking layer reserves some headroom in skb data (via | |
1893 | * dev_alloc_skb). This is used to avoid having to reallocate skb data when | |
1894 | * the header has to grow. In the default case, if the header has to grow | |
d6301d3d | 1895 | * 32 bytes or less we avoid the reallocation. |
025be81e AB |
1896 | * |
1897 | * Unfortunately this headroom changes the DMA alignment of the resulting | |
1898 | * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive | |
1899 | * on some architectures. An architecture can override this value, | |
1900 | * perhaps setting it to a cacheline in size (since that will maintain | |
1901 | * cacheline alignment of the DMA). It must be a power of 2. | |
1902 | * | |
d6301d3d | 1903 | * Various parts of the networking layer expect at least 32 bytes of |
025be81e | 1904 | * headroom, you should not reduce this. |
5933dd2f ED |
1905 | * |
1906 | * Using max(32, L1_CACHE_BYTES) makes sense (especially with RPS) | |
1907 | * to reduce average number of cache lines per packet. | |
1908 | * get_rps_cpus() for example only access one 64 bytes aligned block : | |
18e8c134 | 1909 | * NET_IP_ALIGN(2) + ethernet_header(14) + IP_header(20/40) + ports(8) |
025be81e AB |
1910 | */ |
1911 | #ifndef NET_SKB_PAD | |
5933dd2f | 1912 | #define NET_SKB_PAD max(32, L1_CACHE_BYTES) |
025be81e AB |
1913 | #endif |
1914 | ||
7965bd4d | 1915 | int ___pskb_trim(struct sk_buff *skb, unsigned int len); |
1da177e4 LT |
1916 | |
1917 | static inline void __skb_trim(struct sk_buff *skb, unsigned int len) | |
1918 | { | |
c4264f27 | 1919 | if (unlikely(skb_is_nonlinear(skb))) { |
3cc0e873 HX |
1920 | WARN_ON(1); |
1921 | return; | |
1922 | } | |
27a884dc ACM |
1923 | skb->len = len; |
1924 | skb_set_tail_pointer(skb, len); | |
1da177e4 LT |
1925 | } |
1926 | ||
7965bd4d | 1927 | void skb_trim(struct sk_buff *skb, unsigned int len); |
1da177e4 LT |
1928 | |
1929 | static inline int __pskb_trim(struct sk_buff *skb, unsigned int len) | |
1930 | { | |
3cc0e873 HX |
1931 | if (skb->data_len) |
1932 | return ___pskb_trim(skb, len); | |
1933 | __skb_trim(skb, len); | |
1934 | return 0; | |
1da177e4 LT |
1935 | } |
1936 | ||
1937 | static inline int pskb_trim(struct sk_buff *skb, unsigned int len) | |
1938 | { | |
1939 | return (len < skb->len) ? __pskb_trim(skb, len) : 0; | |
1940 | } | |
1941 | ||
e9fa4f7b HX |
1942 | /** |
1943 | * pskb_trim_unique - remove end from a paged unique (not cloned) buffer | |
1944 | * @skb: buffer to alter | |
1945 | * @len: new length | |
1946 | * | |
1947 | * This is identical to pskb_trim except that the caller knows that | |
1948 | * the skb is not cloned so we should never get an error due to out- | |
1949 | * of-memory. | |
1950 | */ | |
1951 | static inline void pskb_trim_unique(struct sk_buff *skb, unsigned int len) | |
1952 | { | |
1953 | int err = pskb_trim(skb, len); | |
1954 | BUG_ON(err); | |
1955 | } | |
1956 | ||
1da177e4 LT |
1957 | /** |
1958 | * skb_orphan - orphan a buffer | |
1959 | * @skb: buffer to orphan | |
1960 | * | |
1961 | * If a buffer currently has an owner then we call the owner's | |
1962 | * destructor function and make the @skb unowned. The buffer continues | |
1963 | * to exist but is no longer charged to its former owner. | |
1964 | */ | |
1965 | static inline void skb_orphan(struct sk_buff *skb) | |
1966 | { | |
c34a7612 | 1967 | if (skb->destructor) { |
1da177e4 | 1968 | skb->destructor(skb); |
c34a7612 ED |
1969 | skb->destructor = NULL; |
1970 | skb->sk = NULL; | |
376c7311 ED |
1971 | } else { |
1972 | BUG_ON(skb->sk); | |
c34a7612 | 1973 | } |
1da177e4 LT |
1974 | } |
1975 | ||
a353e0ce MT |
1976 | /** |
1977 | * skb_orphan_frags - orphan the frags contained in a buffer | |
1978 | * @skb: buffer to orphan frags from | |
1979 | * @gfp_mask: allocation mask for replacement pages | |
1980 | * | |
1981 | * For each frag in the SKB which needs a destructor (i.e. has an | |
1982 | * owner) create a copy of that frag and release the original | |
1983 | * page by calling the destructor. | |
1984 | */ | |
1985 | static inline int skb_orphan_frags(struct sk_buff *skb, gfp_t gfp_mask) | |
1986 | { | |
1987 | if (likely(!(skb_shinfo(skb)->tx_flags & SKBTX_DEV_ZEROCOPY))) | |
1988 | return 0; | |
1989 | return skb_copy_ubufs(skb, gfp_mask); | |
1990 | } | |
1991 | ||
1da177e4 LT |
1992 | /** |
1993 | * __skb_queue_purge - empty a list | |
1994 | * @list: list to empty | |
1995 | * | |
1996 | * Delete all buffers on an &sk_buff list. Each buffer is removed from | |
1997 | * the list and one reference dropped. This function does not take the | |
1998 | * list lock and the caller must hold the relevant locks to use it. | |
1999 | */ | |
7965bd4d | 2000 | void skb_queue_purge(struct sk_buff_head *list); |
1da177e4 LT |
2001 | static inline void __skb_queue_purge(struct sk_buff_head *list) |
2002 | { | |
2003 | struct sk_buff *skb; | |
2004 | while ((skb = __skb_dequeue(list)) != NULL) | |
2005 | kfree_skb(skb); | |
2006 | } | |
2007 | ||
e5e67305 AD |
2008 | #define NETDEV_FRAG_PAGE_MAX_ORDER get_order(32768) |
2009 | #define NETDEV_FRAG_PAGE_MAX_SIZE (PAGE_SIZE << NETDEV_FRAG_PAGE_MAX_ORDER) | |
2010 | #define NETDEV_PAGECNT_MAX_BIAS NETDEV_FRAG_PAGE_MAX_SIZE | |
2011 | ||
7965bd4d | 2012 | void *netdev_alloc_frag(unsigned int fragsz); |
1da177e4 | 2013 | |
7965bd4d JP |
2014 | struct sk_buff *__netdev_alloc_skb(struct net_device *dev, unsigned int length, |
2015 | gfp_t gfp_mask); | |
8af27456 CH |
2016 | |
2017 | /** | |
2018 | * netdev_alloc_skb - allocate an skbuff for rx on a specific device | |
2019 | * @dev: network device to receive on | |
2020 | * @length: length to allocate | |
2021 | * | |
2022 | * Allocate a new &sk_buff and assign it a usage count of one. The | |
2023 | * buffer has unspecified headroom built in. Users should allocate | |
2024 | * the headroom they think they need without accounting for the | |
2025 | * built in space. The built in space is used for optimisations. | |
2026 | * | |
2027 | * %NULL is returned if there is no free memory. Although this function | |
2028 | * allocates memory it can be called from an interrupt. | |
2029 | */ | |
2030 | static inline struct sk_buff *netdev_alloc_skb(struct net_device *dev, | |
6f532612 | 2031 | unsigned int length) |
8af27456 CH |
2032 | { |
2033 | return __netdev_alloc_skb(dev, length, GFP_ATOMIC); | |
2034 | } | |
2035 | ||
6f532612 ED |
2036 | /* legacy helper around __netdev_alloc_skb() */ |
2037 | static inline struct sk_buff *__dev_alloc_skb(unsigned int length, | |
2038 | gfp_t gfp_mask) | |
2039 | { | |
2040 | return __netdev_alloc_skb(NULL, length, gfp_mask); | |
2041 | } | |
2042 | ||
2043 | /* legacy helper around netdev_alloc_skb() */ | |
2044 | static inline struct sk_buff *dev_alloc_skb(unsigned int length) | |
2045 | { | |
2046 | return netdev_alloc_skb(NULL, length); | |
2047 | } | |
2048 | ||
2049 | ||
4915a0de ED |
2050 | static inline struct sk_buff *__netdev_alloc_skb_ip_align(struct net_device *dev, |
2051 | unsigned int length, gfp_t gfp) | |
61321bbd | 2052 | { |
4915a0de | 2053 | struct sk_buff *skb = __netdev_alloc_skb(dev, length + NET_IP_ALIGN, gfp); |
61321bbd ED |
2054 | |
2055 | if (NET_IP_ALIGN && skb) | |
2056 | skb_reserve(skb, NET_IP_ALIGN); | |
2057 | return skb; | |
2058 | } | |
2059 | ||
4915a0de ED |
2060 | static inline struct sk_buff *netdev_alloc_skb_ip_align(struct net_device *dev, |
2061 | unsigned int length) | |
2062 | { | |
2063 | return __netdev_alloc_skb_ip_align(dev, length, GFP_ATOMIC); | |
2064 | } | |
2065 | ||
bc6fc9fa FF |
2066 | /** |
2067 | * __skb_alloc_pages - allocate pages for ps-rx on a skb and preserve pfmemalloc data | |
0614002b MG |
2068 | * @gfp_mask: alloc_pages_node mask. Set __GFP_NOMEMALLOC if not for network packet RX |
2069 | * @skb: skb to set pfmemalloc on if __GFP_MEMALLOC is used | |
2070 | * @order: size of the allocation | |
2071 | * | |
2072 | * Allocate a new page. | |
2073 | * | |
2074 | * %NULL is returned if there is no free memory. | |
2075 | */ | |
2076 | static inline struct page *__skb_alloc_pages(gfp_t gfp_mask, | |
2077 | struct sk_buff *skb, | |
2078 | unsigned int order) | |
2079 | { | |
2080 | struct page *page; | |
2081 | ||
2082 | gfp_mask |= __GFP_COLD; | |
2083 | ||
2084 | if (!(gfp_mask & __GFP_NOMEMALLOC)) | |
2085 | gfp_mask |= __GFP_MEMALLOC; | |
2086 | ||
2087 | page = alloc_pages_node(NUMA_NO_NODE, gfp_mask, order); | |
2088 | if (skb && page && page->pfmemalloc) | |
2089 | skb->pfmemalloc = true; | |
2090 | ||
2091 | return page; | |
2092 | } | |
2093 | ||
2094 | /** | |
2095 | * __skb_alloc_page - allocate a page for ps-rx for a given skb and preserve pfmemalloc data | |
2096 | * @gfp_mask: alloc_pages_node mask. Set __GFP_NOMEMALLOC if not for network packet RX | |
2097 | * @skb: skb to set pfmemalloc on if __GFP_MEMALLOC is used | |
2098 | * | |
2099 | * Allocate a new page. | |
2100 | * | |
2101 | * %NULL is returned if there is no free memory. | |
2102 | */ | |
2103 | static inline struct page *__skb_alloc_page(gfp_t gfp_mask, | |
2104 | struct sk_buff *skb) | |
2105 | { | |
2106 | return __skb_alloc_pages(gfp_mask, skb, 0); | |
2107 | } | |
2108 | ||
2109 | /** | |
2110 | * skb_propagate_pfmemalloc - Propagate pfmemalloc if skb is allocated after RX page | |
2111 | * @page: The page that was allocated from skb_alloc_page | |
2112 | * @skb: The skb that may need pfmemalloc set | |
2113 | */ | |
2114 | static inline void skb_propagate_pfmemalloc(struct page *page, | |
2115 | struct sk_buff *skb) | |
2116 | { | |
2117 | if (page && page->pfmemalloc) | |
2118 | skb->pfmemalloc = true; | |
2119 | } | |
2120 | ||
131ea667 | 2121 | /** |
e227867f | 2122 | * skb_frag_page - retrieve the page referred to by a paged fragment |
131ea667 IC |
2123 | * @frag: the paged fragment |
2124 | * | |
2125 | * Returns the &struct page associated with @frag. | |
2126 | */ | |
2127 | static inline struct page *skb_frag_page(const skb_frag_t *frag) | |
2128 | { | |
a8605c60 | 2129 | return frag->page.p; |
131ea667 IC |
2130 | } |
2131 | ||
2132 | /** | |
2133 | * __skb_frag_ref - take an addition reference on a paged fragment. | |
2134 | * @frag: the paged fragment | |
2135 | * | |
2136 | * Takes an additional reference on the paged fragment @frag. | |
2137 | */ | |
2138 | static inline void __skb_frag_ref(skb_frag_t *frag) | |
2139 | { | |
2140 | get_page(skb_frag_page(frag)); | |
2141 | } | |
2142 | ||
2143 | /** | |
2144 | * skb_frag_ref - take an addition reference on a paged fragment of an skb. | |
2145 | * @skb: the buffer | |
2146 | * @f: the fragment offset. | |
2147 | * | |
2148 | * Takes an additional reference on the @f'th paged fragment of @skb. | |
2149 | */ | |
2150 | static inline void skb_frag_ref(struct sk_buff *skb, int f) | |
2151 | { | |
2152 | __skb_frag_ref(&skb_shinfo(skb)->frags[f]); | |
2153 | } | |
2154 | ||
2155 | /** | |
2156 | * __skb_frag_unref - release a reference on a paged fragment. | |
2157 | * @frag: the paged fragment | |
2158 | * | |
2159 | * Releases a reference on the paged fragment @frag. | |
2160 | */ | |
2161 | static inline void __skb_frag_unref(skb_frag_t *frag) | |
2162 | { | |
2163 | put_page(skb_frag_page(frag)); | |
2164 | } | |
2165 | ||
2166 | /** | |
2167 | * skb_frag_unref - release a reference on a paged fragment of an skb. | |
2168 | * @skb: the buffer | |
2169 | * @f: the fragment offset | |
2170 | * | |
2171 | * Releases a reference on the @f'th paged fragment of @skb. | |
2172 | */ | |
2173 | static inline void skb_frag_unref(struct sk_buff *skb, int f) | |
2174 | { | |
2175 | __skb_frag_unref(&skb_shinfo(skb)->frags[f]); | |
2176 | } | |
2177 | ||
2178 | /** | |
2179 | * skb_frag_address - gets the address of the data contained in a paged fragment | |
2180 | * @frag: the paged fragment buffer | |
2181 | * | |
2182 | * Returns the address of the data within @frag. The page must already | |
2183 | * be mapped. | |
2184 | */ | |
2185 | static inline void *skb_frag_address(const skb_frag_t *frag) | |
2186 | { | |
2187 | return page_address(skb_frag_page(frag)) + frag->page_offset; | |
2188 | } | |
2189 | ||
2190 | /** | |
2191 | * skb_frag_address_safe - gets the address of the data contained in a paged fragment | |
2192 | * @frag: the paged fragment buffer | |
2193 | * | |
2194 | * Returns the address of the data within @frag. Checks that the page | |
2195 | * is mapped and returns %NULL otherwise. | |
2196 | */ | |
2197 | static inline void *skb_frag_address_safe(const skb_frag_t *frag) | |
2198 | { | |
2199 | void *ptr = page_address(skb_frag_page(frag)); | |
2200 | if (unlikely(!ptr)) | |
2201 | return NULL; | |
2202 | ||
2203 | return ptr + frag->page_offset; | |
2204 | } | |
2205 | ||
2206 | /** | |
2207 | * __skb_frag_set_page - sets the page contained in a paged fragment | |
2208 | * @frag: the paged fragment | |
2209 | * @page: the page to set | |
2210 | * | |
2211 | * Sets the fragment @frag to contain @page. | |
2212 | */ | |
2213 | static inline void __skb_frag_set_page(skb_frag_t *frag, struct page *page) | |
2214 | { | |
a8605c60 | 2215 | frag->page.p = page; |
131ea667 IC |
2216 | } |
2217 | ||
2218 | /** | |
2219 | * skb_frag_set_page - sets the page contained in a paged fragment of an skb | |
2220 | * @skb: the buffer | |
2221 | * @f: the fragment offset | |
2222 | * @page: the page to set | |
2223 | * | |
2224 | * Sets the @f'th fragment of @skb to contain @page. | |
2225 | */ | |
2226 | static inline void skb_frag_set_page(struct sk_buff *skb, int f, | |
2227 | struct page *page) | |
2228 | { | |
2229 | __skb_frag_set_page(&skb_shinfo(skb)->frags[f], page); | |
2230 | } | |
2231 | ||
400dfd3a ED |
2232 | bool skb_page_frag_refill(unsigned int sz, struct page_frag *pfrag, gfp_t prio); |
2233 | ||
131ea667 IC |
2234 | /** |
2235 | * skb_frag_dma_map - maps a paged fragment via the DMA API | |
f83347df | 2236 | * @dev: the device to map the fragment to |
131ea667 IC |
2237 | * @frag: the paged fragment to map |
2238 | * @offset: the offset within the fragment (starting at the | |
2239 | * fragment's own offset) | |
2240 | * @size: the number of bytes to map | |
f83347df | 2241 | * @dir: the direction of the mapping (%PCI_DMA_*) |
131ea667 IC |
2242 | * |
2243 | * Maps the page associated with @frag to @device. | |
2244 | */ | |
2245 | static inline dma_addr_t skb_frag_dma_map(struct device *dev, | |
2246 | const skb_frag_t *frag, | |
2247 | size_t offset, size_t size, | |
2248 | enum dma_data_direction dir) | |
2249 | { | |
2250 | return dma_map_page(dev, skb_frag_page(frag), | |
2251 | frag->page_offset + offset, size, dir); | |
2252 | } | |
2253 | ||
117632e6 ED |
2254 | static inline struct sk_buff *pskb_copy(struct sk_buff *skb, |
2255 | gfp_t gfp_mask) | |
2256 | { | |
2257 | return __pskb_copy(skb, skb_headroom(skb), gfp_mask); | |
2258 | } | |
2259 | ||
bad93e9d OP |
2260 | |
2261 | static inline struct sk_buff *pskb_copy_for_clone(struct sk_buff *skb, | |
2262 | gfp_t gfp_mask) | |
2263 | { | |
2264 | return __pskb_copy_fclone(skb, skb_headroom(skb), gfp_mask, true); | |
2265 | } | |
2266 | ||
2267 | ||
334a8132 PM |
2268 | /** |
2269 | * skb_clone_writable - is the header of a clone writable | |
2270 | * @skb: buffer to check | |
2271 | * @len: length up to which to write | |
2272 | * | |
2273 | * Returns true if modifying the header part of the cloned buffer | |
2274 | * does not requires the data to be copied. | |
2275 | */ | |
05bdd2f1 | 2276 | static inline int skb_clone_writable(const struct sk_buff *skb, unsigned int len) |
334a8132 PM |
2277 | { |
2278 | return !skb_header_cloned(skb) && | |
2279 | skb_headroom(skb) + len <= skb->hdr_len; | |
2280 | } | |
2281 | ||
d9cc2048 HX |
2282 | static inline int __skb_cow(struct sk_buff *skb, unsigned int headroom, |
2283 | int cloned) | |
2284 | { | |
2285 | int delta = 0; | |
2286 | ||
d9cc2048 HX |
2287 | if (headroom > skb_headroom(skb)) |
2288 | delta = headroom - skb_headroom(skb); | |
2289 | ||
2290 | if (delta || cloned) | |
2291 | return pskb_expand_head(skb, ALIGN(delta, NET_SKB_PAD), 0, | |
2292 | GFP_ATOMIC); | |
2293 | return 0; | |
2294 | } | |
2295 | ||
1da177e4 LT |
2296 | /** |
2297 | * skb_cow - copy header of skb when it is required | |
2298 | * @skb: buffer to cow | |
2299 | * @headroom: needed headroom | |
2300 | * | |
2301 | * If the skb passed lacks sufficient headroom or its data part | |
2302 | * is shared, data is reallocated. If reallocation fails, an error | |
2303 | * is returned and original skb is not changed. | |
2304 | * | |
2305 | * The result is skb with writable area skb->head...skb->tail | |
2306 | * and at least @headroom of space at head. | |
2307 | */ | |
2308 | static inline int skb_cow(struct sk_buff *skb, unsigned int headroom) | |
2309 | { | |
d9cc2048 HX |
2310 | return __skb_cow(skb, headroom, skb_cloned(skb)); |
2311 | } | |
1da177e4 | 2312 | |
d9cc2048 HX |
2313 | /** |
2314 | * skb_cow_head - skb_cow but only making the head writable | |
2315 | * @skb: buffer to cow | |
2316 | * @headroom: needed headroom | |
2317 | * | |
2318 | * This function is identical to skb_cow except that we replace the | |
2319 | * skb_cloned check by skb_header_cloned. It should be used when | |
2320 | * you only need to push on some header and do not need to modify | |
2321 | * the data. | |
2322 | */ | |
2323 | static inline int skb_cow_head(struct sk_buff *skb, unsigned int headroom) | |
2324 | { | |
2325 | return __skb_cow(skb, headroom, skb_header_cloned(skb)); | |
1da177e4 LT |
2326 | } |
2327 | ||
2328 | /** | |
2329 | * skb_padto - pad an skbuff up to a minimal size | |
2330 | * @skb: buffer to pad | |
2331 | * @len: minimal length | |
2332 | * | |
2333 | * Pads up a buffer to ensure the trailing bytes exist and are | |
2334 | * blanked. If the buffer already contains sufficient data it | |
5b057c6b HX |
2335 | * is untouched. Otherwise it is extended. Returns zero on |
2336 | * success. The skb is freed on error. | |
1da177e4 LT |
2337 | */ |
2338 | ||
5b057c6b | 2339 | static inline int skb_padto(struct sk_buff *skb, unsigned int len) |
1da177e4 LT |
2340 | { |
2341 | unsigned int size = skb->len; | |
2342 | if (likely(size >= len)) | |
5b057c6b | 2343 | return 0; |
987c402a | 2344 | return skb_pad(skb, len - size); |
1da177e4 LT |
2345 | } |
2346 | ||
2347 | static inline int skb_add_data(struct sk_buff *skb, | |
2348 | char __user *from, int copy) | |
2349 | { | |
2350 | const int off = skb->len; | |
2351 | ||
2352 | if (skb->ip_summed == CHECKSUM_NONE) { | |
2353 | int err = 0; | |
5084205f | 2354 | __wsum csum = csum_and_copy_from_user(from, skb_put(skb, copy), |
1da177e4 LT |
2355 | copy, 0, &err); |
2356 | if (!err) { | |
2357 | skb->csum = csum_block_add(skb->csum, csum, off); | |
2358 | return 0; | |
2359 | } | |
2360 | } else if (!copy_from_user(skb_put(skb, copy), from, copy)) | |
2361 | return 0; | |
2362 | ||
2363 | __skb_trim(skb, off); | |
2364 | return -EFAULT; | |
2365 | } | |
2366 | ||
38ba0a65 ED |
2367 | static inline bool skb_can_coalesce(struct sk_buff *skb, int i, |
2368 | const struct page *page, int off) | |
1da177e4 LT |
2369 | { |
2370 | if (i) { | |
9e903e08 | 2371 | const struct skb_frag_struct *frag = &skb_shinfo(skb)->frags[i - 1]; |
1da177e4 | 2372 | |
ea2ab693 | 2373 | return page == skb_frag_page(frag) && |
9e903e08 | 2374 | off == frag->page_offset + skb_frag_size(frag); |
1da177e4 | 2375 | } |
38ba0a65 | 2376 | return false; |
1da177e4 LT |
2377 | } |
2378 | ||
364c6bad HX |
2379 | static inline int __skb_linearize(struct sk_buff *skb) |
2380 | { | |
2381 | return __pskb_pull_tail(skb, skb->data_len) ? 0 : -ENOMEM; | |
2382 | } | |
2383 | ||
1da177e4 LT |
2384 | /** |
2385 | * skb_linearize - convert paged skb to linear one | |
2386 | * @skb: buffer to linarize | |
1da177e4 LT |
2387 | * |
2388 | * If there is no free memory -ENOMEM is returned, otherwise zero | |
2389 | * is returned and the old skb data released. | |
2390 | */ | |
364c6bad HX |
2391 | static inline int skb_linearize(struct sk_buff *skb) |
2392 | { | |
2393 | return skb_is_nonlinear(skb) ? __skb_linearize(skb) : 0; | |
2394 | } | |
2395 | ||
cef401de ED |
2396 | /** |
2397 | * skb_has_shared_frag - can any frag be overwritten | |
2398 | * @skb: buffer to test | |
2399 | * | |
2400 | * Return true if the skb has at least one frag that might be modified | |
2401 | * by an external entity (as in vmsplice()/sendfile()) | |
2402 | */ | |
2403 | static inline bool skb_has_shared_frag(const struct sk_buff *skb) | |
2404 | { | |
c9af6db4 PS |
2405 | return skb_is_nonlinear(skb) && |
2406 | skb_shinfo(skb)->tx_flags & SKBTX_SHARED_FRAG; | |
cef401de ED |
2407 | } |
2408 | ||
364c6bad HX |
2409 | /** |
2410 | * skb_linearize_cow - make sure skb is linear and writable | |
2411 | * @skb: buffer to process | |
2412 | * | |
2413 | * If there is no free memory -ENOMEM is returned, otherwise zero | |
2414 | * is returned and the old skb data released. | |
2415 | */ | |
2416 | static inline int skb_linearize_cow(struct sk_buff *skb) | |
1da177e4 | 2417 | { |
364c6bad HX |
2418 | return skb_is_nonlinear(skb) || skb_cloned(skb) ? |
2419 | __skb_linearize(skb) : 0; | |
1da177e4 LT |
2420 | } |
2421 | ||
2422 | /** | |
2423 | * skb_postpull_rcsum - update checksum for received skb after pull | |
2424 | * @skb: buffer to update | |
2425 | * @start: start of data before pull | |
2426 | * @len: length of data pulled | |
2427 | * | |
2428 | * After doing a pull on a received packet, you need to call this to | |
84fa7933 PM |
2429 | * update the CHECKSUM_COMPLETE checksum, or set ip_summed to |
2430 | * CHECKSUM_NONE so that it can be recomputed from scratch. | |
1da177e4 LT |
2431 | */ |
2432 | ||
2433 | static inline void skb_postpull_rcsum(struct sk_buff *skb, | |
cbb042f9 | 2434 | const void *start, unsigned int len) |
1da177e4 | 2435 | { |
84fa7933 | 2436 | if (skb->ip_summed == CHECKSUM_COMPLETE) |
1da177e4 LT |
2437 | skb->csum = csum_sub(skb->csum, csum_partial(start, len, 0)); |
2438 | } | |
2439 | ||
cbb042f9 HX |
2440 | unsigned char *skb_pull_rcsum(struct sk_buff *skb, unsigned int len); |
2441 | ||
7ce5a27f DM |
2442 | /** |
2443 | * pskb_trim_rcsum - trim received skb and update checksum | |
2444 | * @skb: buffer to trim | |
2445 | * @len: new length | |
2446 | * | |
2447 | * This is exactly the same as pskb_trim except that it ensures the | |
2448 | * checksum of received packets are still valid after the operation. | |
2449 | */ | |
2450 | ||
2451 | static inline int pskb_trim_rcsum(struct sk_buff *skb, unsigned int len) | |
2452 | { | |
2453 | if (likely(len >= skb->len)) | |
2454 | return 0; | |
2455 | if (skb->ip_summed == CHECKSUM_COMPLETE) | |
2456 | skb->ip_summed = CHECKSUM_NONE; | |
2457 | return __pskb_trim(skb, len); | |
2458 | } | |
2459 | ||
1da177e4 LT |
2460 | #define skb_queue_walk(queue, skb) \ |
2461 | for (skb = (queue)->next; \ | |
a1e4891f | 2462 | skb != (struct sk_buff *)(queue); \ |
1da177e4 LT |
2463 | skb = skb->next) |
2464 | ||
46f8914e JC |
2465 | #define skb_queue_walk_safe(queue, skb, tmp) \ |
2466 | for (skb = (queue)->next, tmp = skb->next; \ | |
2467 | skb != (struct sk_buff *)(queue); \ | |
2468 | skb = tmp, tmp = skb->next) | |
2469 | ||
1164f52a | 2470 | #define skb_queue_walk_from(queue, skb) \ |
a1e4891f | 2471 | for (; skb != (struct sk_buff *)(queue); \ |
1164f52a DM |
2472 | skb = skb->next) |
2473 | ||
2474 | #define skb_queue_walk_from_safe(queue, skb, tmp) \ | |
2475 | for (tmp = skb->next; \ | |
2476 | skb != (struct sk_buff *)(queue); \ | |
2477 | skb = tmp, tmp = skb->next) | |
2478 | ||
300ce174 SH |
2479 | #define skb_queue_reverse_walk(queue, skb) \ |
2480 | for (skb = (queue)->prev; \ | |
a1e4891f | 2481 | skb != (struct sk_buff *)(queue); \ |
300ce174 SH |
2482 | skb = skb->prev) |
2483 | ||
686a2955 DM |
2484 | #define skb_queue_reverse_walk_safe(queue, skb, tmp) \ |
2485 | for (skb = (queue)->prev, tmp = skb->prev; \ | |
2486 | skb != (struct sk_buff *)(queue); \ | |
2487 | skb = tmp, tmp = skb->prev) | |
2488 | ||
2489 | #define skb_queue_reverse_walk_from_safe(queue, skb, tmp) \ | |
2490 | for (tmp = skb->prev; \ | |
2491 | skb != (struct sk_buff *)(queue); \ | |
2492 | skb = tmp, tmp = skb->prev) | |
1da177e4 | 2493 | |
21dc3301 | 2494 | static inline bool skb_has_frag_list(const struct sk_buff *skb) |
ee039871 DM |
2495 | { |
2496 | return skb_shinfo(skb)->frag_list != NULL; | |
2497 | } | |
2498 | ||
2499 | static inline void skb_frag_list_init(struct sk_buff *skb) | |
2500 | { | |
2501 | skb_shinfo(skb)->frag_list = NULL; | |
2502 | } | |
2503 | ||
2504 | static inline void skb_frag_add_head(struct sk_buff *skb, struct sk_buff *frag) | |
2505 | { | |
2506 | frag->next = skb_shinfo(skb)->frag_list; | |
2507 | skb_shinfo(skb)->frag_list = frag; | |
2508 | } | |
2509 | ||
2510 | #define skb_walk_frags(skb, iter) \ | |
2511 | for (iter = skb_shinfo(skb)->frag_list; iter; iter = iter->next) | |
2512 | ||
7965bd4d JP |
2513 | struct sk_buff *__skb_recv_datagram(struct sock *sk, unsigned flags, |
2514 | int *peeked, int *off, int *err); | |
2515 | struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags, int noblock, | |
2516 | int *err); | |
2517 | unsigned int datagram_poll(struct file *file, struct socket *sock, | |
2518 | struct poll_table_struct *wait); | |
2519 | int skb_copy_datagram_iovec(const struct sk_buff *from, int offset, | |
2520 | struct iovec *to, int size); | |
2521 | int skb_copy_and_csum_datagram_iovec(struct sk_buff *skb, int hlen, | |
2522 | struct iovec *iov); | |
2523 | int skb_copy_datagram_from_iovec(struct sk_buff *skb, int offset, | |
2524 | const struct iovec *from, int from_offset, | |
2525 | int len); | |
2526 | int zerocopy_sg_from_iovec(struct sk_buff *skb, const struct iovec *frm, | |
2527 | int offset, size_t count); | |
2528 | int skb_copy_datagram_const_iovec(const struct sk_buff *from, int offset, | |
2529 | const struct iovec *to, int to_offset, | |
2530 | int size); | |
2531 | void skb_free_datagram(struct sock *sk, struct sk_buff *skb); | |
2532 | void skb_free_datagram_locked(struct sock *sk, struct sk_buff *skb); | |
2533 | int skb_kill_datagram(struct sock *sk, struct sk_buff *skb, unsigned int flags); | |
7965bd4d JP |
2534 | int skb_copy_bits(const struct sk_buff *skb, int offset, void *to, int len); |
2535 | int skb_store_bits(struct sk_buff *skb, int offset, const void *from, int len); | |
2536 | __wsum skb_copy_and_csum_bits(const struct sk_buff *skb, int offset, u8 *to, | |
2537 | int len, __wsum csum); | |
2538 | int skb_splice_bits(struct sk_buff *skb, unsigned int offset, | |
2539 | struct pipe_inode_info *pipe, unsigned int len, | |
2540 | unsigned int flags); | |
2541 | void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to); | |
af2806f8 | 2542 | unsigned int skb_zerocopy_headlen(const struct sk_buff *from); |
36d5fe6a ZK |
2543 | int skb_zerocopy(struct sk_buff *to, struct sk_buff *from, |
2544 | int len, int hlen); | |
7965bd4d JP |
2545 | void skb_split(struct sk_buff *skb, struct sk_buff *skb1, const u32 len); |
2546 | int skb_shift(struct sk_buff *tgt, struct sk_buff *skb, int shiftlen); | |
2547 | void skb_scrub_packet(struct sk_buff *skb, bool xnet); | |
de960aa9 | 2548 | unsigned int skb_gso_transport_seglen(const struct sk_buff *skb); |
7965bd4d | 2549 | struct sk_buff *skb_segment(struct sk_buff *skb, netdev_features_t features); |
20380731 | 2550 | |
2817a336 DB |
2551 | struct skb_checksum_ops { |
2552 | __wsum (*update)(const void *mem, int len, __wsum wsum); | |
2553 | __wsum (*combine)(__wsum csum, __wsum csum2, int offset, int len); | |
2554 | }; | |
2555 | ||
2556 | __wsum __skb_checksum(const struct sk_buff *skb, int offset, int len, | |
2557 | __wsum csum, const struct skb_checksum_ops *ops); | |
2558 | __wsum skb_checksum(const struct sk_buff *skb, int offset, int len, | |
2559 | __wsum csum); | |
2560 | ||
1da177e4 LT |
2561 | static inline void *skb_header_pointer(const struct sk_buff *skb, int offset, |
2562 | int len, void *buffer) | |
2563 | { | |
2564 | int hlen = skb_headlen(skb); | |
2565 | ||
55820ee2 | 2566 | if (hlen - offset >= len) |
1da177e4 LT |
2567 | return skb->data + offset; |
2568 | ||
2569 | if (skb_copy_bits(skb, offset, buffer, len) < 0) | |
2570 | return NULL; | |
2571 | ||
2572 | return buffer; | |
2573 | } | |
2574 | ||
4262e5cc DB |
2575 | /** |
2576 | * skb_needs_linearize - check if we need to linearize a given skb | |
2577 | * depending on the given device features. | |
2578 | * @skb: socket buffer to check | |
2579 | * @features: net device features | |
2580 | * | |
2581 | * Returns true if either: | |
2582 | * 1. skb has frag_list and the device doesn't support FRAGLIST, or | |
2583 | * 2. skb is fragmented and the device does not support SG. | |
2584 | */ | |
2585 | static inline bool skb_needs_linearize(struct sk_buff *skb, | |
2586 | netdev_features_t features) | |
2587 | { | |
2588 | return skb_is_nonlinear(skb) && | |
2589 | ((skb_has_frag_list(skb) && !(features & NETIF_F_FRAGLIST)) || | |
2590 | (skb_shinfo(skb)->nr_frags && !(features & NETIF_F_SG))); | |
2591 | } | |
2592 | ||
d626f62b ACM |
2593 | static inline void skb_copy_from_linear_data(const struct sk_buff *skb, |
2594 | void *to, | |
2595 | const unsigned int len) | |
2596 | { | |
2597 | memcpy(to, skb->data, len); | |
2598 | } | |
2599 | ||
2600 | static inline void skb_copy_from_linear_data_offset(const struct sk_buff *skb, | |
2601 | const int offset, void *to, | |
2602 | const unsigned int len) | |
2603 | { | |
2604 | memcpy(to, skb->data + offset, len); | |
2605 | } | |
2606 | ||
27d7ff46 ACM |
2607 | static inline void skb_copy_to_linear_data(struct sk_buff *skb, |
2608 | const void *from, | |
2609 | const unsigned int len) | |
2610 | { | |
2611 | memcpy(skb->data, from, len); | |
2612 | } | |
2613 | ||
2614 | static inline void skb_copy_to_linear_data_offset(struct sk_buff *skb, | |
2615 | const int offset, | |
2616 | const void *from, | |
2617 | const unsigned int len) | |
2618 | { | |
2619 | memcpy(skb->data + offset, from, len); | |
2620 | } | |
2621 | ||
7965bd4d | 2622 | void skb_init(void); |
1da177e4 | 2623 | |
ac45f602 PO |
2624 | static inline ktime_t skb_get_ktime(const struct sk_buff *skb) |
2625 | { | |
2626 | return skb->tstamp; | |
2627 | } | |
2628 | ||
a61bbcf2 PM |
2629 | /** |
2630 | * skb_get_timestamp - get timestamp from a skb | |
2631 | * @skb: skb to get stamp from | |
2632 | * @stamp: pointer to struct timeval to store stamp in | |
2633 | * | |
2634 | * Timestamps are stored in the skb as offsets to a base timestamp. | |
2635 | * This function converts the offset back to a struct timeval and stores | |
2636 | * it in stamp. | |
2637 | */ | |
ac45f602 PO |
2638 | static inline void skb_get_timestamp(const struct sk_buff *skb, |
2639 | struct timeval *stamp) | |
a61bbcf2 | 2640 | { |
b7aa0bf7 | 2641 | *stamp = ktime_to_timeval(skb->tstamp); |
a61bbcf2 PM |
2642 | } |
2643 | ||
ac45f602 PO |
2644 | static inline void skb_get_timestampns(const struct sk_buff *skb, |
2645 | struct timespec *stamp) | |
2646 | { | |
2647 | *stamp = ktime_to_timespec(skb->tstamp); | |
2648 | } | |
2649 | ||
b7aa0bf7 | 2650 | static inline void __net_timestamp(struct sk_buff *skb) |
a61bbcf2 | 2651 | { |
b7aa0bf7 | 2652 | skb->tstamp = ktime_get_real(); |
a61bbcf2 PM |
2653 | } |
2654 | ||
164891aa SH |
2655 | static inline ktime_t net_timedelta(ktime_t t) |
2656 | { | |
2657 | return ktime_sub(ktime_get_real(), t); | |
2658 | } | |
2659 | ||
b9ce204f IJ |
2660 | static inline ktime_t net_invalid_timestamp(void) |
2661 | { | |
2662 | return ktime_set(0, 0); | |
2663 | } | |
a61bbcf2 | 2664 | |
c1f19b51 RC |
2665 | #ifdef CONFIG_NETWORK_PHY_TIMESTAMPING |
2666 | ||
7965bd4d JP |
2667 | void skb_clone_tx_timestamp(struct sk_buff *skb); |
2668 | bool skb_defer_rx_timestamp(struct sk_buff *skb); | |
c1f19b51 RC |
2669 | |
2670 | #else /* CONFIG_NETWORK_PHY_TIMESTAMPING */ | |
2671 | ||
2672 | static inline void skb_clone_tx_timestamp(struct sk_buff *skb) | |
2673 | { | |
2674 | } | |
2675 | ||
2676 | static inline bool skb_defer_rx_timestamp(struct sk_buff *skb) | |
2677 | { | |
2678 | return false; | |
2679 | } | |
2680 | ||
2681 | #endif /* !CONFIG_NETWORK_PHY_TIMESTAMPING */ | |
2682 | ||
2683 | /** | |
2684 | * skb_complete_tx_timestamp() - deliver cloned skb with tx timestamps | |
2685 | * | |
da92b194 RC |
2686 | * PHY drivers may accept clones of transmitted packets for |
2687 | * timestamping via their phy_driver.txtstamp method. These drivers | |
2688 | * must call this function to return the skb back to the stack, with | |
2689 | * or without a timestamp. | |
2690 | * | |
c1f19b51 | 2691 | * @skb: clone of the the original outgoing packet |
da92b194 | 2692 | * @hwtstamps: hardware time stamps, may be NULL if not available |
c1f19b51 RC |
2693 | * |
2694 | */ | |
2695 | void skb_complete_tx_timestamp(struct sk_buff *skb, | |
2696 | struct skb_shared_hwtstamps *hwtstamps); | |
2697 | ||
ac45f602 PO |
2698 | /** |
2699 | * skb_tstamp_tx - queue clone of skb with send time stamps | |
2700 | * @orig_skb: the original outgoing packet | |
2701 | * @hwtstamps: hardware time stamps, may be NULL if not available | |
2702 | * | |
2703 | * If the skb has a socket associated, then this function clones the | |
2704 | * skb (thus sharing the actual data and optional structures), stores | |
2705 | * the optional hardware time stamping information (if non NULL) or | |
2706 | * generates a software time stamp (otherwise), then queues the clone | |
2707 | * to the error queue of the socket. Errors are silently ignored. | |
2708 | */ | |
7965bd4d JP |
2709 | void skb_tstamp_tx(struct sk_buff *orig_skb, |
2710 | struct skb_shared_hwtstamps *hwtstamps); | |
ac45f602 | 2711 | |
4507a715 RC |
2712 | static inline void sw_tx_timestamp(struct sk_buff *skb) |
2713 | { | |
2244d07b OH |
2714 | if (skb_shinfo(skb)->tx_flags & SKBTX_SW_TSTAMP && |
2715 | !(skb_shinfo(skb)->tx_flags & SKBTX_IN_PROGRESS)) | |
4507a715 RC |
2716 | skb_tstamp_tx(skb, NULL); |
2717 | } | |
2718 | ||
2719 | /** | |
2720 | * skb_tx_timestamp() - Driver hook for transmit timestamping | |
2721 | * | |
2722 | * Ethernet MAC Drivers should call this function in their hard_xmit() | |
4ff75b7c | 2723 | * function immediately before giving the sk_buff to the MAC hardware. |
4507a715 | 2724 | * |
73409f3b DM |
2725 | * Specifically, one should make absolutely sure that this function is |
2726 | * called before TX completion of this packet can trigger. Otherwise | |
2727 | * the packet could potentially already be freed. | |
2728 | * | |
4507a715 RC |
2729 | * @skb: A socket buffer. |
2730 | */ | |
2731 | static inline void skb_tx_timestamp(struct sk_buff *skb) | |
2732 | { | |
c1f19b51 | 2733 | skb_clone_tx_timestamp(skb); |
4507a715 RC |
2734 | sw_tx_timestamp(skb); |
2735 | } | |
2736 | ||
6e3e939f JB |
2737 | /** |
2738 | * skb_complete_wifi_ack - deliver skb with wifi status | |
2739 | * | |
2740 | * @skb: the original outgoing packet | |
2741 | * @acked: ack status | |
2742 | * | |
2743 | */ | |
2744 | void skb_complete_wifi_ack(struct sk_buff *skb, bool acked); | |
2745 | ||
7965bd4d JP |
2746 | __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len); |
2747 | __sum16 __skb_checksum_complete(struct sk_buff *skb); | |
fb286bb2 | 2748 | |
60476372 HX |
2749 | static inline int skb_csum_unnecessary(const struct sk_buff *skb) |
2750 | { | |
5d0c2b95 | 2751 | return ((skb->ip_summed & CHECKSUM_UNNECESSARY) || skb->csum_valid); |
60476372 HX |
2752 | } |
2753 | ||
fb286bb2 HX |
2754 | /** |
2755 | * skb_checksum_complete - Calculate checksum of an entire packet | |
2756 | * @skb: packet to process | |
2757 | * | |
2758 | * This function calculates the checksum over the entire packet plus | |
2759 | * the value of skb->csum. The latter can be used to supply the | |
2760 | * checksum of a pseudo header as used by TCP/UDP. It returns the | |
2761 | * checksum. | |
2762 | * | |
2763 | * For protocols that contain complete checksums such as ICMP/TCP/UDP, | |
2764 | * this function can be used to verify that checksum on received | |
2765 | * packets. In that case the function should return zero if the | |
2766 | * checksum is correct. In particular, this function will return zero | |
2767 | * if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the | |
2768 | * hardware has already verified the correctness of the checksum. | |
2769 | */ | |
4381ca3c | 2770 | static inline __sum16 skb_checksum_complete(struct sk_buff *skb) |
fb286bb2 | 2771 | { |
60476372 HX |
2772 | return skb_csum_unnecessary(skb) ? |
2773 | 0 : __skb_checksum_complete(skb); | |
fb286bb2 HX |
2774 | } |
2775 | ||
76ba0aae TH |
2776 | /* Check if we need to perform checksum complete validation. |
2777 | * | |
2778 | * Returns true if checksum complete is needed, false otherwise | |
2779 | * (either checksum is unnecessary or zero checksum is allowed). | |
2780 | */ | |
2781 | static inline bool __skb_checksum_validate_needed(struct sk_buff *skb, | |
2782 | bool zero_okay, | |
2783 | __sum16 check) | |
2784 | { | |
5d0c2b95 TH |
2785 | if (skb_csum_unnecessary(skb) || (zero_okay && !check)) { |
2786 | skb->csum_valid = 1; | |
76ba0aae TH |
2787 | return false; |
2788 | } | |
2789 | ||
2790 | return true; | |
2791 | } | |
2792 | ||
2793 | /* For small packets <= CHECKSUM_BREAK peform checksum complete directly | |
2794 | * in checksum_init. | |
2795 | */ | |
2796 | #define CHECKSUM_BREAK 76 | |
2797 | ||
2798 | /* Validate (init) checksum based on checksum complete. | |
2799 | * | |
2800 | * Return values: | |
2801 | * 0: checksum is validated or try to in skb_checksum_complete. In the latter | |
2802 | * case the ip_summed will not be CHECKSUM_UNNECESSARY and the pseudo | |
2803 | * checksum is stored in skb->csum for use in __skb_checksum_complete | |
2804 | * non-zero: value of invalid checksum | |
2805 | * | |
2806 | */ | |
2807 | static inline __sum16 __skb_checksum_validate_complete(struct sk_buff *skb, | |
2808 | bool complete, | |
2809 | __wsum psum) | |
2810 | { | |
2811 | if (skb->ip_summed == CHECKSUM_COMPLETE) { | |
2812 | if (!csum_fold(csum_add(psum, skb->csum))) { | |
5d0c2b95 | 2813 | skb->csum_valid = 1; |
76ba0aae TH |
2814 | return 0; |
2815 | } | |
2816 | } | |
2817 | ||
2818 | skb->csum = psum; | |
2819 | ||
5d0c2b95 TH |
2820 | if (complete || skb->len <= CHECKSUM_BREAK) { |
2821 | __sum16 csum; | |
2822 | ||
2823 | csum = __skb_checksum_complete(skb); | |
2824 | skb->csum_valid = !csum; | |
2825 | return csum; | |
2826 | } | |
76ba0aae TH |
2827 | |
2828 | return 0; | |
2829 | } | |
2830 | ||
2831 | static inline __wsum null_compute_pseudo(struct sk_buff *skb, int proto) | |
2832 | { | |
2833 | return 0; | |
2834 | } | |
2835 | ||
2836 | /* Perform checksum validate (init). Note that this is a macro since we only | |
2837 | * want to calculate the pseudo header which is an input function if necessary. | |
2838 | * First we try to validate without any computation (checksum unnecessary) and | |
2839 | * then calculate based on checksum complete calling the function to compute | |
2840 | * pseudo header. | |
2841 | * | |
2842 | * Return values: | |
2843 | * 0: checksum is validated or try to in skb_checksum_complete | |
2844 | * non-zero: value of invalid checksum | |
2845 | */ | |
2846 | #define __skb_checksum_validate(skb, proto, complete, \ | |
2847 | zero_okay, check, compute_pseudo) \ | |
2848 | ({ \ | |
2849 | __sum16 __ret = 0; \ | |
5d0c2b95 | 2850 | skb->csum_valid = 0; \ |
76ba0aae TH |
2851 | if (__skb_checksum_validate_needed(skb, zero_okay, check)) \ |
2852 | __ret = __skb_checksum_validate_complete(skb, \ | |
2853 | complete, compute_pseudo(skb, proto)); \ | |
2854 | __ret; \ | |
2855 | }) | |
2856 | ||
2857 | #define skb_checksum_init(skb, proto, compute_pseudo) \ | |
2858 | __skb_checksum_validate(skb, proto, false, false, 0, compute_pseudo) | |
2859 | ||
2860 | #define skb_checksum_init_zero_check(skb, proto, check, compute_pseudo) \ | |
2861 | __skb_checksum_validate(skb, proto, false, true, check, compute_pseudo) | |
2862 | ||
2863 | #define skb_checksum_validate(skb, proto, compute_pseudo) \ | |
2864 | __skb_checksum_validate(skb, proto, true, false, 0, compute_pseudo) | |
2865 | ||
2866 | #define skb_checksum_validate_zero_check(skb, proto, check, \ | |
2867 | compute_pseudo) \ | |
2868 | __skb_checksum_validate_(skb, proto, true, true, check, compute_pseudo) | |
2869 | ||
2870 | #define skb_checksum_simple_validate(skb) \ | |
2871 | __skb_checksum_validate(skb, 0, true, false, 0, null_compute_pseudo) | |
2872 | ||
5f79e0f9 | 2873 | #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE) |
7965bd4d | 2874 | void nf_conntrack_destroy(struct nf_conntrack *nfct); |
1da177e4 LT |
2875 | static inline void nf_conntrack_put(struct nf_conntrack *nfct) |
2876 | { | |
2877 | if (nfct && atomic_dec_and_test(&nfct->use)) | |
de6e05c4 | 2878 | nf_conntrack_destroy(nfct); |
1da177e4 LT |
2879 | } |
2880 | static inline void nf_conntrack_get(struct nf_conntrack *nfct) | |
2881 | { | |
2882 | if (nfct) | |
2883 | atomic_inc(&nfct->use); | |
2884 | } | |
2fc72c7b | 2885 | #endif |
1da177e4 LT |
2886 | #ifdef CONFIG_BRIDGE_NETFILTER |
2887 | static inline void nf_bridge_put(struct nf_bridge_info *nf_bridge) | |
2888 | { | |
2889 | if (nf_bridge && atomic_dec_and_test(&nf_bridge->use)) | |
2890 | kfree(nf_bridge); | |
2891 | } | |
2892 | static inline void nf_bridge_get(struct nf_bridge_info *nf_bridge) | |
2893 | { | |
2894 | if (nf_bridge) | |
2895 | atomic_inc(&nf_bridge->use); | |
2896 | } | |
2897 | #endif /* CONFIG_BRIDGE_NETFILTER */ | |
a193a4ab PM |
2898 | static inline void nf_reset(struct sk_buff *skb) |
2899 | { | |
5f79e0f9 | 2900 | #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE) |
a193a4ab PM |
2901 | nf_conntrack_put(skb->nfct); |
2902 | skb->nfct = NULL; | |
2fc72c7b | 2903 | #endif |
a193a4ab PM |
2904 | #ifdef CONFIG_BRIDGE_NETFILTER |
2905 | nf_bridge_put(skb->nf_bridge); | |
2906 | skb->nf_bridge = NULL; | |
2907 | #endif | |
2908 | } | |
2909 | ||
124dff01 PM |
2910 | static inline void nf_reset_trace(struct sk_buff *skb) |
2911 | { | |
478b360a | 2912 | #if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE) || defined(CONFIG_NF_TABLES) |
130549fe G |
2913 | skb->nf_trace = 0; |
2914 | #endif | |
a193a4ab PM |
2915 | } |
2916 | ||
edda553c YK |
2917 | /* Note: This doesn't put any conntrack and bridge info in dst. */ |
2918 | static inline void __nf_copy(struct sk_buff *dst, const struct sk_buff *src) | |
2919 | { | |
5f79e0f9 | 2920 | #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE) |
edda553c YK |
2921 | dst->nfct = src->nfct; |
2922 | nf_conntrack_get(src->nfct); | |
2923 | dst->nfctinfo = src->nfctinfo; | |
2fc72c7b | 2924 | #endif |
edda553c YK |
2925 | #ifdef CONFIG_BRIDGE_NETFILTER |
2926 | dst->nf_bridge = src->nf_bridge; | |
2927 | nf_bridge_get(src->nf_bridge); | |
2928 | #endif | |
478b360a FW |
2929 | #if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE) || defined(CONFIG_NF_TABLES) |
2930 | dst->nf_trace = src->nf_trace; | |
2931 | #endif | |
edda553c YK |
2932 | } |
2933 | ||
e7ac05f3 YK |
2934 | static inline void nf_copy(struct sk_buff *dst, const struct sk_buff *src) |
2935 | { | |
e7ac05f3 | 2936 | #if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE) |
5f79e0f9 | 2937 | nf_conntrack_put(dst->nfct); |
2fc72c7b | 2938 | #endif |
e7ac05f3 YK |
2939 | #ifdef CONFIG_BRIDGE_NETFILTER |
2940 | nf_bridge_put(dst->nf_bridge); | |
2941 | #endif | |
2942 | __nf_copy(dst, src); | |
2943 | } | |
2944 | ||
984bc16c JM |
2945 | #ifdef CONFIG_NETWORK_SECMARK |
2946 | static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from) | |
2947 | { | |
2948 | to->secmark = from->secmark; | |
2949 | } | |
2950 | ||
2951 | static inline void skb_init_secmark(struct sk_buff *skb) | |
2952 | { | |
2953 | skb->secmark = 0; | |
2954 | } | |
2955 | #else | |
2956 | static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from) | |
2957 | { } | |
2958 | ||
2959 | static inline void skb_init_secmark(struct sk_buff *skb) | |
2960 | { } | |
2961 | #endif | |
2962 | ||
574f7194 EB |
2963 | static inline bool skb_irq_freeable(const struct sk_buff *skb) |
2964 | { | |
2965 | return !skb->destructor && | |
2966 | #if IS_ENABLED(CONFIG_XFRM) | |
2967 | !skb->sp && | |
2968 | #endif | |
2969 | #if IS_ENABLED(CONFIG_NF_CONNTRACK) | |
2970 | !skb->nfct && | |
2971 | #endif | |
2972 | !skb->_skb_refdst && | |
2973 | !skb_has_frag_list(skb); | |
2974 | } | |
2975 | ||
f25f4e44 PWJ |
2976 | static inline void skb_set_queue_mapping(struct sk_buff *skb, u16 queue_mapping) |
2977 | { | |
f25f4e44 | 2978 | skb->queue_mapping = queue_mapping; |
f25f4e44 PWJ |
2979 | } |
2980 | ||
9247744e | 2981 | static inline u16 skb_get_queue_mapping(const struct sk_buff *skb) |
4e3ab47a | 2982 | { |
4e3ab47a | 2983 | return skb->queue_mapping; |
4e3ab47a PE |
2984 | } |
2985 | ||
f25f4e44 PWJ |
2986 | static inline void skb_copy_queue_mapping(struct sk_buff *to, const struct sk_buff *from) |
2987 | { | |
f25f4e44 | 2988 | to->queue_mapping = from->queue_mapping; |
f25f4e44 PWJ |
2989 | } |
2990 | ||
d5a9e24a DM |
2991 | static inline void skb_record_rx_queue(struct sk_buff *skb, u16 rx_queue) |
2992 | { | |
2993 | skb->queue_mapping = rx_queue + 1; | |
2994 | } | |
2995 | ||
9247744e | 2996 | static inline u16 skb_get_rx_queue(const struct sk_buff *skb) |
d5a9e24a DM |
2997 | { |
2998 | return skb->queue_mapping - 1; | |
2999 | } | |
3000 | ||
9247744e | 3001 | static inline bool skb_rx_queue_recorded(const struct sk_buff *skb) |
d5a9e24a | 3002 | { |
a02cec21 | 3003 | return skb->queue_mapping != 0; |
d5a9e24a DM |
3004 | } |
3005 | ||
0e001614 | 3006 | u16 __skb_tx_hash(const struct net_device *dev, struct sk_buff *skb, |
7965bd4d | 3007 | unsigned int num_tx_queues); |
9247744e | 3008 | |
def8b4fa AD |
3009 | static inline struct sec_path *skb_sec_path(struct sk_buff *skb) |
3010 | { | |
0b3d8e08 | 3011 | #ifdef CONFIG_XFRM |
def8b4fa | 3012 | return skb->sp; |
def8b4fa | 3013 | #else |
def8b4fa | 3014 | return NULL; |
def8b4fa | 3015 | #endif |
0b3d8e08 | 3016 | } |
def8b4fa | 3017 | |
68c33163 PS |
3018 | /* Keeps track of mac header offset relative to skb->head. |
3019 | * It is useful for TSO of Tunneling protocol. e.g. GRE. | |
3020 | * For non-tunnel skb it points to skb_mac_header() and for | |
3347c960 ED |
3021 | * tunnel skb it points to outer mac header. |
3022 | * Keeps track of level of encapsulation of network headers. | |
3023 | */ | |
68c33163 | 3024 | struct skb_gso_cb { |
3347c960 ED |
3025 | int mac_offset; |
3026 | int encap_level; | |
7e2b10c1 | 3027 | __u16 csum_start; |
68c33163 PS |
3028 | }; |
3029 | #define SKB_GSO_CB(skb) ((struct skb_gso_cb *)(skb)->cb) | |
3030 | ||
3031 | static inline int skb_tnl_header_len(const struct sk_buff *inner_skb) | |
3032 | { | |
3033 | return (skb_mac_header(inner_skb) - inner_skb->head) - | |
3034 | SKB_GSO_CB(inner_skb)->mac_offset; | |
3035 | } | |
3036 | ||
1e2bd517 PS |
3037 | static inline int gso_pskb_expand_head(struct sk_buff *skb, int extra) |
3038 | { | |
3039 | int new_headroom, headroom; | |
3040 | int ret; | |
3041 | ||
3042 | headroom = skb_headroom(skb); | |
3043 | ret = pskb_expand_head(skb, extra, 0, GFP_ATOMIC); | |
3044 | if (ret) | |
3045 | return ret; | |
3046 | ||
3047 | new_headroom = skb_headroom(skb); | |
3048 | SKB_GSO_CB(skb)->mac_offset += (new_headroom - headroom); | |
3049 | return 0; | |
3050 | } | |
3051 | ||
7e2b10c1 TH |
3052 | /* Compute the checksum for a gso segment. First compute the checksum value |
3053 | * from the start of transport header to SKB_GSO_CB(skb)->csum_start, and | |
3054 | * then add in skb->csum (checksum from csum_start to end of packet). | |
3055 | * skb->csum and csum_start are then updated to reflect the checksum of the | |
3056 | * resultant packet starting from the transport header-- the resultant checksum | |
3057 | * is in the res argument (i.e. normally zero or ~ of checksum of a pseudo | |
3058 | * header. | |
3059 | */ | |
3060 | static inline __sum16 gso_make_checksum(struct sk_buff *skb, __wsum res) | |
3061 | { | |
3062 | int plen = SKB_GSO_CB(skb)->csum_start - skb_headroom(skb) - | |
3063 | skb_transport_offset(skb); | |
3064 | __u16 csum; | |
3065 | ||
3066 | csum = csum_fold(csum_partial(skb_transport_header(skb), | |
3067 | plen, skb->csum)); | |
3068 | skb->csum = res; | |
3069 | SKB_GSO_CB(skb)->csum_start -= plen; | |
3070 | ||
3071 | return csum; | |
3072 | } | |
3073 | ||
bdcc0924 | 3074 | static inline bool skb_is_gso(const struct sk_buff *skb) |
89114afd HX |
3075 | { |
3076 | return skb_shinfo(skb)->gso_size; | |
3077 | } | |
3078 | ||
36a8f39e | 3079 | /* Note: Should be called only if skb_is_gso(skb) is true */ |
bdcc0924 | 3080 | static inline bool skb_is_gso_v6(const struct sk_buff *skb) |
eabd7e35 BG |
3081 | { |
3082 | return skb_shinfo(skb)->gso_type & SKB_GSO_TCPV6; | |
3083 | } | |
3084 | ||
7965bd4d | 3085 | void __skb_warn_lro_forwarding(const struct sk_buff *skb); |
4497b076 BH |
3086 | |
3087 | static inline bool skb_warn_if_lro(const struct sk_buff *skb) | |
3088 | { | |
3089 | /* LRO sets gso_size but not gso_type, whereas if GSO is really | |
3090 | * wanted then gso_type will be set. */ | |
05bdd2f1 ED |
3091 | const struct skb_shared_info *shinfo = skb_shinfo(skb); |
3092 | ||
b78462eb AD |
3093 | if (skb_is_nonlinear(skb) && shinfo->gso_size != 0 && |
3094 | unlikely(shinfo->gso_type == 0)) { | |
4497b076 BH |
3095 | __skb_warn_lro_forwarding(skb); |
3096 | return true; | |
3097 | } | |
3098 | return false; | |
3099 | } | |
3100 | ||
35fc92a9 HX |
3101 | static inline void skb_forward_csum(struct sk_buff *skb) |
3102 | { | |
3103 | /* Unfortunately we don't support this one. Any brave souls? */ | |
3104 | if (skb->ip_summed == CHECKSUM_COMPLETE) | |
3105 | skb->ip_summed = CHECKSUM_NONE; | |
3106 | } | |
3107 | ||
bc8acf2c ED |
3108 | /** |
3109 | * skb_checksum_none_assert - make sure skb ip_summed is CHECKSUM_NONE | |
3110 | * @skb: skb to check | |
3111 | * | |
3112 | * fresh skbs have their ip_summed set to CHECKSUM_NONE. | |
3113 | * Instead of forcing ip_summed to CHECKSUM_NONE, we can | |
3114 | * use this helper, to document places where we make this assertion. | |
3115 | */ | |
05bdd2f1 | 3116 | static inline void skb_checksum_none_assert(const struct sk_buff *skb) |
bc8acf2c ED |
3117 | { |
3118 | #ifdef DEBUG | |
3119 | BUG_ON(skb->ip_summed != CHECKSUM_NONE); | |
3120 | #endif | |
3121 | } | |
3122 | ||
f35d9d8a | 3123 | bool skb_partial_csum_set(struct sk_buff *skb, u16 start, u16 off); |
a6686f2f | 3124 | |
ed1f50c3 PD |
3125 | int skb_checksum_setup(struct sk_buff *skb, bool recalculate); |
3126 | ||
f77668dc DB |
3127 | u32 __skb_get_poff(const struct sk_buff *skb); |
3128 | ||
3a7c1ee4 AD |
3129 | /** |
3130 | * skb_head_is_locked - Determine if the skb->head is locked down | |
3131 | * @skb: skb to check | |
3132 | * | |
3133 | * The head on skbs build around a head frag can be removed if they are | |
3134 | * not cloned. This function returns true if the skb head is locked down | |
3135 | * due to either being allocated via kmalloc, or by being a clone with | |
3136 | * multiple references to the head. | |
3137 | */ | |
3138 | static inline bool skb_head_is_locked(const struct sk_buff *skb) | |
3139 | { | |
3140 | return !skb->head_frag || skb_cloned(skb); | |
3141 | } | |
fe6cc55f FW |
3142 | |
3143 | /** | |
3144 | * skb_gso_network_seglen - Return length of individual segments of a gso packet | |
3145 | * | |
3146 | * @skb: GSO skb | |
3147 | * | |
3148 | * skb_gso_network_seglen is used to determine the real size of the | |
3149 | * individual segments, including Layer3 (IP, IPv6) and L4 headers (TCP/UDP). | |
3150 | * | |
3151 | * The MAC/L2 header is not accounted for. | |
3152 | */ | |
3153 | static inline unsigned int skb_gso_network_seglen(const struct sk_buff *skb) | |
3154 | { | |
3155 | unsigned int hdr_len = skb_transport_header(skb) - | |
3156 | skb_network_header(skb); | |
3157 | return hdr_len + skb_gso_transport_seglen(skb); | |
3158 | } | |
1da177e4 LT |
3159 | #endif /* __KERNEL__ */ |
3160 | #endif /* _LINUX_SKBUFF_H */ |