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