skbuff.h 61.3 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
/*
 *	Definitions for the 'struct sk_buff' memory handlers.
 *
 *	Authors:
 *		Alan Cox, <gw4pts@gw4pts.ampr.org>
 *		Florian La Roche, <rzsfl@rz.uni-sb.de>
 *
 *	This program is free software; you can redistribute it and/or
 *	modify it under the terms of the GNU General Public License
 *	as published by the Free Software Foundation; either version
 *	2 of the License, or (at your option) any later version.
 */

#ifndef _LINUX_SKBUFF_H
#define _LINUX_SKBUFF_H

#include <linux/kernel.h>
18
#include <linux/kmemcheck.h>
L
Linus Torvalds 已提交
19 20 21 22 23 24 25 26
#include <linux/compiler.h>
#include <linux/time.h>
#include <linux/cache.h>

#include <asm/atomic.h>
#include <asm/types.h>
#include <linux/spinlock.h>
#include <linux/net.h>
27
#include <linux/textsearch.h>
L
Linus Torvalds 已提交
28
#include <net/checksum.h>
29
#include <linux/rcupdate.h>
30
#include <linux/dmaengine.h>
31
#include <linux/hrtimer.h>
L
Linus Torvalds 已提交
32

33
/* Don't change this without changing skb_csum_unnecessary! */
L
Linus Torvalds 已提交
34
#define CHECKSUM_NONE 0
35 36 37
#define CHECKSUM_UNNECESSARY 1
#define CHECKSUM_COMPLETE 2
#define CHECKSUM_PARTIAL 3
L
Linus Torvalds 已提交
38 39 40

#define SKB_DATA_ALIGN(X)	(((X) + (SMP_CACHE_BYTES - 1)) & \
				 ~(SMP_CACHE_BYTES - 1))
41
#define SKB_WITH_OVERHEAD(X)	\
42
	((X) - SKB_DATA_ALIGN(sizeof(struct skb_shared_info)))
43 44
#define SKB_MAX_ORDER(X, ORDER) \
	SKB_WITH_OVERHEAD((PAGE_SIZE << (ORDER)) - (X))
L
Linus Torvalds 已提交
45 46 47 48 49 50 51 52 53 54 55 56 57 58
#define SKB_MAX_HEAD(X)		(SKB_MAX_ORDER((X), 0))
#define SKB_MAX_ALLOC		(SKB_MAX_ORDER(0, 2))

/* A. Checksumming of received packets by device.
 *
 *	NONE: device failed to checksum this packet.
 *		skb->csum is undefined.
 *
 *	UNNECESSARY: device parsed packet and wouldbe verified checksum.
 *		skb->csum is undefined.
 *	      It is bad option, but, unfortunately, many of vendors do this.
 *	      Apparently with secret goal to sell you new device, when you
 *	      will add new protocol to your host. F.e. IPv6. 8)
 *
59
 *	COMPLETE: the most generic way. Device supplied checksum of _all_
L
Linus Torvalds 已提交
60 61
 *	    the packet as seen by netif_rx in skb->csum.
 *	    NOTE: Even if device supports only some protocols, but
62
 *	    is able to produce some skb->csum, it MUST use COMPLETE,
L
Linus Torvalds 已提交
63 64
 *	    not UNNECESSARY.
 *
65 66 67 68 69 70 71
 *	PARTIAL: identical to the case for output below.  This may occur
 *	    on a packet received directly from another Linux OS, e.g.,
 *	    a virtualised Linux kernel on the same host.  The packet can
 *	    be treated in the same way as UNNECESSARY except that on
 *	    output (i.e., forwarding) the checksum must be filled in
 *	    by the OS or the hardware.
 *
L
Linus Torvalds 已提交
72 73 74 75
 * B. Checksumming on output.
 *
 *	NONE: skb is checksummed by protocol or csum is not required.
 *
76
 *	PARTIAL: device is required to csum packet as seen by hard_start_xmit
77 78
 *	from skb->csum_start to the end and to record the checksum
 *	at skb->csum_start + skb->csum_offset.
L
Linus Torvalds 已提交
79 80 81 82 83 84 85 86 87 88
 *
 *	Device must show its capabilities in dev->features, set
 *	at device setup time.
 *	NETIF_F_HW_CSUM	- it is clever device, it is able to checksum
 *			  everything.
 *	NETIF_F_NO_CSUM - loopback or reliable single hop media.
 *	NETIF_F_IP_CSUM - device is dumb. It is able to csum only
 *			  TCP/UDP over IPv4. Sigh. Vendors like this
 *			  way by an unknown reason. Though, see comment above
 *			  about CHECKSUM_UNNECESSARY. 8)
89
 *	NETIF_F_IPV6_CSUM about as dumb as the last one but does IPv6 instead.
L
Linus Torvalds 已提交
90 91 92 93 94
 *
 *	Any questions? No questions, good. 		--ANK
 */

struct net_device;
95
struct scatterlist;
J
Jens Axboe 已提交
96
struct pipe_inode_info;
L
Linus Torvalds 已提交
97

98
#if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
L
Linus Torvalds 已提交
99 100 101
struct nf_conntrack {
	atomic_t use;
};
102
#endif
L
Linus Torvalds 已提交
103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131

#ifdef CONFIG_BRIDGE_NETFILTER
struct nf_bridge_info {
	atomic_t use;
	struct net_device *physindev;
	struct net_device *physoutdev;
	unsigned int mask;
	unsigned long data[32 / sizeof(unsigned long)];
};
#endif

struct sk_buff_head {
	/* These two members must be first. */
	struct sk_buff	*next;
	struct sk_buff	*prev;

	__u32		qlen;
	spinlock_t	lock;
};

struct sk_buff;

/* To allow 64K frame to be packed as single skb without frag_list */
#define MAX_SKB_FRAGS (65536/PAGE_SIZE + 2)

typedef struct skb_frag_struct skb_frag_t;

struct skb_frag_struct {
	struct page *page;
132
#if (BITS_PER_LONG > 32) || (PAGE_SIZE >= 65536)
133 134
	__u32 page_offset;
	__u32 size;
135 136 137 138
#else
	__u16 page_offset;
	__u16 size;
#endif
L
Linus Torvalds 已提交
139 140
};

141 142 143
#define HAVE_HW_TIME_STAMP

/**
144
 * struct skb_shared_hwtstamps - hardware time stamps
145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170
 * @hwtstamp:	hardware time stamp transformed into duration
 *		since arbitrary point in time
 * @syststamp:	hwtstamp transformed to system time base
 *
 * Software time stamps generated by ktime_get_real() are stored in
 * skb->tstamp. The relation between the different kinds of time
 * stamps is as follows:
 *
 * syststamp and tstamp can be compared against each other in
 * arbitrary combinations.  The accuracy of a
 * syststamp/tstamp/"syststamp from other device" comparison is
 * limited by the accuracy of the transformation into system time
 * base. This depends on the device driver and its underlying
 * hardware.
 *
 * hwtstamps can only be compared against other hwtstamps from
 * the same device.
 *
 * This structure is attached to packets as part of the
 * &skb_shared_info. Use skb_hwtstamps() to get a pointer.
 */
struct skb_shared_hwtstamps {
	ktime_t	hwtstamp;
	ktime_t	syststamp;
};

171 172 173 174 175 176 177 178 179 180 181 182 183
/* Definitions for tx_flags in struct skb_shared_info */
enum {
	/* generate hardware time stamp */
	SKBTX_HW_TSTAMP = 1 << 0,

	/* generate software time stamp */
	SKBTX_SW_TSTAMP = 1 << 1,

	/* device driver is going to provide hardware time stamp */
	SKBTX_IN_PROGRESS = 1 << 2,

	/* ensure the originating sk reference is available on driver level */
	SKBTX_DRV_NEEDS_SK_REF = 1 << 3,
184 185
};

L
Linus Torvalds 已提交
186 187 188 189
/* This data is invariant across clones and lives at
 * the end of the header data, ie. at skb->end.
 */
struct skb_shared_info {
B
Benjamin LaHaise 已提交
190
	unsigned short	nr_frags;
191 192 193 194
	unsigned short	gso_size;
	/* Warning: this field is not always filled in (UFO)! */
	unsigned short	gso_segs;
	unsigned short  gso_type;
A
Al Viro 已提交
195
	__be32          ip6_frag_id;
196
	__u8		tx_flags;
L
Linus Torvalds 已提交
197
	struct sk_buff	*frag_list;
198
	struct skb_shared_hwtstamps hwtstamps;
E
Eric Dumazet 已提交
199 200 201 202 203 204

	/*
	 * Warning : all fields before dataref are cleared in __alloc_skb()
	 */
	atomic_t	dataref;

J
Johann Baudy 已提交
205 206 207
	/* Intermediate layers must ensure that destructor_arg
	 * remains valid until skb destructor */
	void *		destructor_arg;
208 209
	/* must be last field, see pskb_expand_head() */
	skb_frag_t	frags[MAX_SKB_FRAGS];
L
Linus Torvalds 已提交
210 211 212 213
};

/* We divide dataref into two halves.  The higher 16 bits hold references
 * to the payload part of skb->data.  The lower 16 bits hold references to
214 215
 * the entire skb->data.  A clone of a headerless skb holds the length of
 * the header in skb->hdr_len.
L
Linus Torvalds 已提交
216 217 218 219 220 221 222 223 224 225
 *
 * All users must obey the rule that the skb->data reference count must be
 * greater than or equal to the payload reference count.
 *
 * Holding a reference to the payload part means that the user does not
 * care about modifications to the header part of skb->data.
 */
#define SKB_DATAREF_SHIFT 16
#define SKB_DATAREF_MASK ((1 << SKB_DATAREF_SHIFT) - 1)

226 227 228 229 230 231 232

enum {
	SKB_FCLONE_UNAVAILABLE,
	SKB_FCLONE_ORIG,
	SKB_FCLONE_CLONE,
};

233 234
enum {
	SKB_GSO_TCPV4 = 1 << 0,
H
Herbert Xu 已提交
235
	SKB_GSO_UDP = 1 << 1,
236 237 238

	/* This indicates the skb is from an untrusted source. */
	SKB_GSO_DODGY = 1 << 2,
M
Michael Chan 已提交
239 240

	/* This indicates the tcp segment has CWR set. */
H
Herbert Xu 已提交
241 242 243
	SKB_GSO_TCP_ECN = 1 << 3,

	SKB_GSO_TCPV6 = 1 << 4,
244 245

	SKB_GSO_FCOE = 1 << 5,
246 247
};

248 249 250 251 252 253 254 255 256 257
#if BITS_PER_LONG > 32
#define NET_SKBUFF_DATA_USES_OFFSET 1
#endif

#ifdef NET_SKBUFF_DATA_USES_OFFSET
typedef unsigned int sk_buff_data_t;
#else
typedef unsigned char *sk_buff_data_t;
#endif

L
Linus Torvalds 已提交
258 259 260 261 262
/** 
 *	struct sk_buff - socket buffer
 *	@next: Next buffer in list
 *	@prev: Previous buffer in list
 *	@sk: Socket we are owned by
H
Herbert Xu 已提交
263
 *	@tstamp: Time we arrived
L
Linus Torvalds 已提交
264
 *	@dev: Device we arrived on/are leaving by
R
Randy Dunlap 已提交
265
 *	@transport_header: Transport layer header
266 267
 *	@network_header: Network layer header
 *	@mac_header: Link layer header
E
Eric Dumazet 已提交
268
 *	@_skb_refdst: destination entry (with norefcount bit)
269
 *	@sp: the security path, used for xfrm
L
Linus Torvalds 已提交
270 271 272 273
 *	@cb: Control buffer. Free for use by every layer. Put private vars here
 *	@len: Length of actual data
 *	@data_len: Data length
 *	@mac_len: Length of link layer header
274
 *	@hdr_len: writable header length of cloned skb
275 276 277
 *	@csum: Checksum (must include start/offset pair)
 *	@csum_start: Offset from skb->head where checksumming should start
 *	@csum_offset: Offset from csum_start where checksum should be stored
278
 *	@local_df: allow local fragmentation
L
Linus Torvalds 已提交
279 280 281
 *	@cloned: Head may be cloned (check refcnt to be sure)
 *	@nohdr: Payload reference only, must not modify header
 *	@pkt_type: Packet class
282
 *	@fclone: skbuff clone status
L
Linus Torvalds 已提交
283 284 285 286 287 288 289 290 291 292
 *	@ip_summed: Driver fed us an IP checksum
 *	@priority: Packet queueing priority
 *	@users: User count - see {datagram,tcp}.c
 *	@protocol: Packet protocol from driver
 *	@truesize: Buffer size 
 *	@head: Head of buffer
 *	@data: Data head pointer
 *	@tail: Tail pointer
 *	@end: End pointer
 *	@destructor: Destruct function
T
Thomas Graf 已提交
293
 *	@mark: Generic packet mark
L
Linus Torvalds 已提交
294
 *	@nfct: Associated connection, if any
295
 *	@ipvs_property: skbuff is owned by ipvs
296 297
 *	@peeked: this packet has been seen already, so stats have been
 *		done for it, don't do them again
298
 *	@nf_trace: netfilter packet trace flag
L
Linus Torvalds 已提交
299
 *	@nfctinfo: Relationship of this skb to the connection
R
Randy Dunlap 已提交
300
 *	@nfct_reasm: netfilter conntrack re-assembly pointer
L
Linus Torvalds 已提交
301
 *	@nf_bridge: Saved data about a bridged frame - see br_netfilter.c
302
 *	@skb_iif: ifindex of device we arrived on
T
Tom Herbert 已提交
303
 *	@rxhash: the packet hash computed on receive
304
 *	@queue_mapping: Queue mapping for multiqueue devices
L
Linus Torvalds 已提交
305 306
 *	@tc_index: Traffic control index
 *	@tc_verd: traffic control verdict
307
 *	@ndisc_nodetype: router type (from link layer)
R
Randy Dunlap 已提交
308 309
 *	@dma_cookie: a cookie to one of several possible DMA operations
 *		done by skb DMA functions
310
 *	@secmark: security marking
311
 *	@vlan_tci: vlan tag control information
L
Linus Torvalds 已提交
312 313 314 315 316 317 318
 */

struct sk_buff {
	/* These two members must be first. */
	struct sk_buff		*next;
	struct sk_buff		*prev;

319
	ktime_t			tstamp;
320 321

	struct sock		*sk;
L
Linus Torvalds 已提交
322 323 324 325 326 327 328 329
	struct net_device	*dev;

	/*
	 * This is the control buffer. It is free to use for every
	 * layer. Please put your private variables there. If you
	 * want to keep them across layers you have to do a skb_clone()
	 * first. This is owned by whoever has the skb queued ATM.
	 */
330
	char			cb[48] __aligned(8);
L
Linus Torvalds 已提交
331

E
Eric Dumazet 已提交
332
	unsigned long		_skb_refdst;
333 334 335
#ifdef CONFIG_XFRM
	struct	sec_path	*sp;
#endif
L
Linus Torvalds 已提交
336
	unsigned int		len,
337 338 339
				data_len;
	__u16			mac_len,
				hdr_len;
A
Al Viro 已提交
340 341
	union {
		__wsum		csum;
342 343 344 345
		struct {
			__u16	csum_start;
			__u16	csum_offset;
		};
A
Al Viro 已提交
346
	};
L
Linus Torvalds 已提交
347
	__u32			priority;
348
	kmemcheck_bitfield_begin(flags1);
349 350 351
	__u8			local_df:1,
				cloned:1,
				ip_summed:2,
352 353
				nohdr:1,
				nfctinfo:3;
354
	__u8			pkt_type:3,
355
				fclone:2,
356
				ipvs_property:1,
357
				peeked:1,
358
				nf_trace:1;
359
	kmemcheck_bitfield_end(flags1);
E
Eric Dumazet 已提交
360
	__be16			protocol;
L
Linus Torvalds 已提交
361 362

	void			(*destructor)(struct sk_buff *skb);
363
#if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
364
	struct nf_conntrack	*nfct;
365 366
	struct sk_buff		*nfct_reasm;
#endif
L
Linus Torvalds 已提交
367 368 369
#ifdef CONFIG_BRIDGE_NETFILTER
	struct nf_bridge_info	*nf_bridge;
#endif
370

371
	int			skb_iif;
L
Linus Torvalds 已提交
372
#ifdef CONFIG_NET_SCHED
373
	__u16			tc_index;	/* traffic control index */
L
Linus Torvalds 已提交
374
#ifdef CONFIG_NET_CLS_ACT
375
	__u16			tc_verd;	/* traffic control verdict */
L
Linus Torvalds 已提交
376 377
#endif
#endif
378

T
Tom Herbert 已提交
379 380
	__u32			rxhash;

381
	kmemcheck_bitfield_begin(flags2);
E
Eric Dumazet 已提交
382
	__u16			queue_mapping:16;
383
#ifdef CONFIG_IPV6_NDISC_NODETYPE
384 385 386 387
	__u8			ndisc_nodetype:2,
				deliver_no_wcard:1;
#else
	__u8			deliver_no_wcard:1;
388
#endif
389 390
	kmemcheck_bitfield_end(flags2);

391
	/* 0/14 bit hole */
392

393 394 395
#ifdef CONFIG_NET_DMA
	dma_cookie_t		dma_cookie;
#endif
396 397 398
#ifdef CONFIG_NETWORK_SECMARK
	__u32			secmark;
#endif
399 400 401 402
	union {
		__u32		mark;
		__u32		dropcount;
	};
L
Linus Torvalds 已提交
403

404 405
	__u16			vlan_tci;

406 407 408
	sk_buff_data_t		transport_header;
	sk_buff_data_t		network_header;
	sk_buff_data_t		mac_header;
L
Linus Torvalds 已提交
409
	/* These elements must be at the end, see alloc_skb() for details.  */
410
	sk_buff_data_t		tail;
411
	sk_buff_data_t		end;
L
Linus Torvalds 已提交
412
	unsigned char		*head,
413
				*data;
414 415
	unsigned int		truesize;
	atomic_t		users;
L
Linus Torvalds 已提交
416 417 418 419 420 421 422 423 424 425
};

#ifdef __KERNEL__
/*
 *	Handling routines are only of interest to the kernel
 */
#include <linux/slab.h>

#include <asm/system.h>

E
Eric Dumazet 已提交
426 427 428 429 430 431 432 433 434 435 436 437 438
/*
 * skb might have a dst pointer attached, refcounted or not.
 * _skb_refdst low order bit is set if refcount was _not_ taken
 */
#define SKB_DST_NOREF	1UL
#define SKB_DST_PTRMASK	~(SKB_DST_NOREF)

/**
 * skb_dst - returns skb dst_entry
 * @skb: buffer
 *
 * Returns skb dst_entry, regardless of reference taken or not.
 */
E
Eric Dumazet 已提交
439 440
static inline struct dst_entry *skb_dst(const struct sk_buff *skb)
{
E
Eric Dumazet 已提交
441 442 443 444 445 446 447
	/* If refdst was not refcounted, check we still are in a 
	 * rcu_read_lock section
	 */
	WARN_ON((skb->_skb_refdst & SKB_DST_NOREF) &&
		!rcu_read_lock_held() &&
		!rcu_read_lock_bh_held());
	return (struct dst_entry *)(skb->_skb_refdst & SKB_DST_PTRMASK);
E
Eric Dumazet 已提交
448 449
}

E
Eric Dumazet 已提交
450 451 452 453 454 455 456 457
/**
 * skb_dst_set - sets skb dst
 * @skb: buffer
 * @dst: dst entry
 *
 * Sets skb dst, assuming a reference was taken on dst and should
 * be released by skb_dst_drop()
 */
E
Eric Dumazet 已提交
458 459
static inline void skb_dst_set(struct sk_buff *skb, struct dst_entry *dst)
{
E
Eric Dumazet 已提交
460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483
	skb->_skb_refdst = (unsigned long)dst;
}

/**
 * skb_dst_set_noref - sets skb dst, without a reference
 * @skb: buffer
 * @dst: dst entry
 *
 * Sets skb dst, assuming a reference was not taken on dst
 * skb_dst_drop() should not dst_release() this dst
 */
static inline void skb_dst_set_noref(struct sk_buff *skb, struct dst_entry *dst)
{
	WARN_ON(!rcu_read_lock_held() && !rcu_read_lock_bh_held());
	skb->_skb_refdst = (unsigned long)dst | SKB_DST_NOREF;
}

/**
 * skb_dst_is_noref - Test if skb dst isnt refcounted
 * @skb: buffer
 */
static inline bool skb_dst_is_noref(const struct sk_buff *skb)
{
	return (skb->_skb_refdst & SKB_DST_NOREF) && skb_dst(skb);
E
Eric Dumazet 已提交
484 485
}

E
Eric Dumazet 已提交
486 487
static inline struct rtable *skb_rtable(const struct sk_buff *skb)
{
E
Eric Dumazet 已提交
488
	return (struct rtable *)skb_dst(skb);
E
Eric Dumazet 已提交
489 490
}

491
extern void kfree_skb(struct sk_buff *skb);
492
extern void consume_skb(struct sk_buff *skb);
L
Linus Torvalds 已提交
493
extern void	       __kfree_skb(struct sk_buff *skb);
494
extern struct sk_buff *__alloc_skb(unsigned int size,
495
				   gfp_t priority, int fclone, int node);
496
static inline struct sk_buff *alloc_skb(unsigned int size,
A
Al Viro 已提交
497
					gfp_t priority)
498
{
499
	return __alloc_skb(size, priority, 0, -1);
500 501 502
}

static inline struct sk_buff *alloc_skb_fclone(unsigned int size,
A
Al Viro 已提交
503
					       gfp_t priority)
504
{
505
	return __alloc_skb(size, priority, 1, -1);
506 507
}

508
extern bool skb_recycle_check(struct sk_buff *skb, int skb_size);
509

H
Herbert Xu 已提交
510
extern struct sk_buff *skb_morph(struct sk_buff *dst, struct sk_buff *src);
V
Victor Fusco 已提交
511
extern struct sk_buff *skb_clone(struct sk_buff *skb,
A
Al Viro 已提交
512
				 gfp_t priority);
V
Victor Fusco 已提交
513
extern struct sk_buff *skb_copy(const struct sk_buff *skb,
A
Al Viro 已提交
514
				gfp_t priority);
V
Victor Fusco 已提交
515
extern struct sk_buff *pskb_copy(struct sk_buff *skb,
A
Al Viro 已提交
516
				 gfp_t gfp_mask);
L
Linus Torvalds 已提交
517
extern int	       pskb_expand_head(struct sk_buff *skb,
V
Victor Fusco 已提交
518
					int nhead, int ntail,
A
Al Viro 已提交
519
					gfp_t gfp_mask);
L
Linus Torvalds 已提交
520 521 522 523
extern struct sk_buff *skb_realloc_headroom(struct sk_buff *skb,
					    unsigned int headroom);
extern struct sk_buff *skb_copy_expand(const struct sk_buff *skb,
				       int newheadroom, int newtailroom,
A
Al Viro 已提交
524
				       gfp_t priority);
525 526 527 528 529
extern int	       skb_to_sgvec(struct sk_buff *skb,
				    struct scatterlist *sg, int offset,
				    int len);
extern int	       skb_cow_data(struct sk_buff *skb, int tailbits,
				    struct sk_buff **trailer);
530
extern int	       skb_pad(struct sk_buff *skb, int pad);
531
#define dev_kfree_skb(a)	consume_skb(a)
L
Linus Torvalds 已提交
532

533 534 535 536 537
extern int skb_append_datato_frags(struct sock *sk, struct sk_buff *skb,
			int getfrag(void *from, char *to, int offset,
			int len,int odd, struct sk_buff *skb),
			void *from, int length);

E
Eric Dumazet 已提交
538
struct skb_seq_state {
539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554
	__u32		lower_offset;
	__u32		upper_offset;
	__u32		frag_idx;
	__u32		stepped_offset;
	struct sk_buff	*root_skb;
	struct sk_buff	*cur_skb;
	__u8		*frag_data;
};

extern void	      skb_prepare_seq_read(struct sk_buff *skb,
					   unsigned int from, unsigned int to,
					   struct skb_seq_state *st);
extern unsigned int   skb_seq_read(unsigned int consumed, const u8 **data,
				   struct skb_seq_state *st);
extern void	      skb_abort_seq_read(struct skb_seq_state *st);

555 556 557 558
extern unsigned int   skb_find_text(struct sk_buff *skb, unsigned int from,
				    unsigned int to, struct ts_config *config,
				    struct ts_state *state);

559 560 561 562 563 564 565 566 567
extern __u32 __skb_get_rxhash(struct sk_buff *skb);
static inline __u32 skb_get_rxhash(struct sk_buff *skb)
{
	if (!skb->rxhash)
		skb->rxhash = __skb_get_rxhash(skb);

	return skb->rxhash;
}

568 569 570 571 572 573 574 575 576 577 578 579
#ifdef NET_SKBUFF_DATA_USES_OFFSET
static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
{
	return skb->head + skb->end;
}
#else
static inline unsigned char *skb_end_pointer(const struct sk_buff *skb)
{
	return skb->end;
}
#endif

L
Linus Torvalds 已提交
580
/* Internal */
581
#define skb_shinfo(SKB)	((struct skb_shared_info *)(skb_end_pointer(SKB)))
L
Linus Torvalds 已提交
582

583 584 585 586 587
static inline struct skb_shared_hwtstamps *skb_hwtstamps(struct sk_buff *skb)
{
	return &skb_shinfo(skb)->hwtstamps;
}

L
Linus Torvalds 已提交
588 589 590 591 592 593 594 595 596 597 598
/**
 *	skb_queue_empty - check if a queue is empty
 *	@list: queue head
 *
 *	Returns true if the queue is empty, false otherwise.
 */
static inline int skb_queue_empty(const struct sk_buff_head *list)
{
	return list->next == (struct sk_buff *)list;
}

D
David S. Miller 已提交
599 600 601 602 603 604 605 606 607 608
/**
 *	skb_queue_is_last - check if skb is the last entry in the queue
 *	@list: queue head
 *	@skb: buffer
 *
 *	Returns true if @skb is the last buffer on the list.
 */
static inline bool skb_queue_is_last(const struct sk_buff_head *list,
				     const struct sk_buff *skb)
{
E
Eric Dumazet 已提交
609
	return skb->next == (struct sk_buff *)list;
D
David S. Miller 已提交
610 611
}

612 613 614 615 616 617 618 619 620 621
/**
 *	skb_queue_is_first - check if skb is the first entry in the queue
 *	@list: queue head
 *	@skb: buffer
 *
 *	Returns true if @skb is the first buffer on the list.
 */
static inline bool skb_queue_is_first(const struct sk_buff_head *list,
				      const struct sk_buff *skb)
{
E
Eric Dumazet 已提交
622
	return skb->prev == (struct sk_buff *)list;
623 624
}

D
David S. Miller 已提交
625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642
/**
 *	skb_queue_next - return the next packet in the queue
 *	@list: queue head
 *	@skb: current buffer
 *
 *	Return the next packet in @list after @skb.  It is only valid to
 *	call this if skb_queue_is_last() evaluates to false.
 */
static inline struct sk_buff *skb_queue_next(const struct sk_buff_head *list,
					     const struct sk_buff *skb)
{
	/* This BUG_ON may seem severe, but if we just return then we
	 * are going to dereference garbage.
	 */
	BUG_ON(skb_queue_is_last(list, skb));
	return skb->next;
}

643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660
/**
 *	skb_queue_prev - return the prev packet in the queue
 *	@list: queue head
 *	@skb: current buffer
 *
 *	Return the prev packet in @list before @skb.  It is only valid to
 *	call this if skb_queue_is_first() evaluates to false.
 */
static inline struct sk_buff *skb_queue_prev(const struct sk_buff_head *list,
					     const struct sk_buff *skb)
{
	/* This BUG_ON may seem severe, but if we just return then we
	 * are going to dereference garbage.
	 */
	BUG_ON(skb_queue_is_first(list, skb));
	return skb->prev;
}

L
Linus Torvalds 已提交
661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751
/**
 *	skb_get - reference buffer
 *	@skb: buffer to reference
 *
 *	Makes another reference to a socket buffer and returns a pointer
 *	to the buffer.
 */
static inline struct sk_buff *skb_get(struct sk_buff *skb)
{
	atomic_inc(&skb->users);
	return skb;
}

/*
 * If users == 1, we are the only owner and are can avoid redundant
 * atomic change.
 */

/**
 *	skb_cloned - is the buffer a clone
 *	@skb: buffer to check
 *
 *	Returns true if the buffer was generated with skb_clone() and is
 *	one of multiple shared copies of the buffer. Cloned buffers are
 *	shared data so must not be written to under normal circumstances.
 */
static inline int skb_cloned(const struct sk_buff *skb)
{
	return skb->cloned &&
	       (atomic_read(&skb_shinfo(skb)->dataref) & SKB_DATAREF_MASK) != 1;
}

/**
 *	skb_header_cloned - is the header a clone
 *	@skb: buffer to check
 *
 *	Returns true if modifying the header part of the buffer requires
 *	the data to be copied.
 */
static inline int skb_header_cloned(const struct sk_buff *skb)
{
	int dataref;

	if (!skb->cloned)
		return 0;

	dataref = atomic_read(&skb_shinfo(skb)->dataref);
	dataref = (dataref & SKB_DATAREF_MASK) - (dataref >> SKB_DATAREF_SHIFT);
	return dataref != 1;
}

/**
 *	skb_header_release - release reference to header
 *	@skb: buffer to operate on
 *
 *	Drop a reference to the header part of the buffer.  This is done
 *	by acquiring a payload reference.  You must not read from the header
 *	part of skb->data after this.
 */
static inline void skb_header_release(struct sk_buff *skb)
{
	BUG_ON(skb->nohdr);
	skb->nohdr = 1;
	atomic_add(1 << SKB_DATAREF_SHIFT, &skb_shinfo(skb)->dataref);
}

/**
 *	skb_shared - is the buffer shared
 *	@skb: buffer to check
 *
 *	Returns true if more than one person has a reference to this
 *	buffer.
 */
static inline int skb_shared(const struct sk_buff *skb)
{
	return atomic_read(&skb->users) != 1;
}

/**
 *	skb_share_check - check if buffer is shared and if so clone it
 *	@skb: buffer to check
 *	@pri: priority for memory allocation
 *
 *	If the buffer is shared the buffer is cloned and the old copy
 *	drops a reference. A new clone with a single reference is returned.
 *	If the buffer is not shared the original buffer is returned. When
 *	being called from interrupt status or with spinlocks held pri must
 *	be GFP_ATOMIC.
 *
 *	NULL is returned on a memory allocation failure.
 */
V
Victor Fusco 已提交
752
static inline struct sk_buff *skb_share_check(struct sk_buff *skb,
A
Al Viro 已提交
753
					      gfp_t pri)
L
Linus Torvalds 已提交
754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783
{
	might_sleep_if(pri & __GFP_WAIT);
	if (skb_shared(skb)) {
		struct sk_buff *nskb = skb_clone(skb, pri);
		kfree_skb(skb);
		skb = nskb;
	}
	return skb;
}

/*
 *	Copy shared buffers into a new sk_buff. We effectively do COW on
 *	packets to handle cases where we have a local reader and forward
 *	and a couple of other messy ones. The normal one is tcpdumping
 *	a packet thats being forwarded.
 */

/**
 *	skb_unshare - make a copy of a shared buffer
 *	@skb: buffer to check
 *	@pri: priority for memory allocation
 *
 *	If the socket buffer is a clone then this function creates a new
 *	copy of the data, drops a reference count on the old copy and returns
 *	the new copy with the reference count at 1. If the buffer is not a clone
 *	the original buffer is returned. When called with a spinlock held or
 *	from interrupt state @pri must be %GFP_ATOMIC
 *
 *	%NULL is returned on a memory allocation failure.
 */
784
static inline struct sk_buff *skb_unshare(struct sk_buff *skb,
A
Al Viro 已提交
785
					  gfp_t pri)
L
Linus Torvalds 已提交
786 787 788 789 790 791 792 793 794 795 796
{
	might_sleep_if(pri & __GFP_WAIT);
	if (skb_cloned(skb)) {
		struct sk_buff *nskb = skb_copy(skb, pri);
		kfree_skb(skb);	/* Free our shared copy */
		skb = nskb;
	}
	return skb;
}

/**
797
 *	skb_peek - peek at the head of an &sk_buff_head
L
Linus Torvalds 已提交
798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817
 *	@list_: list to peek at
 *
 *	Peek an &sk_buff. Unlike most other operations you _MUST_
 *	be careful with this one. A peek leaves the buffer on the
 *	list and someone else may run off with it. You must hold
 *	the appropriate locks or have a private queue to do this.
 *
 *	Returns %NULL for an empty list or a pointer to the head element.
 *	The reference count is not incremented and the reference is therefore
 *	volatile. Use with caution.
 */
static inline struct sk_buff *skb_peek(struct sk_buff_head *list_)
{
	struct sk_buff *list = ((struct sk_buff *)list_)->next;
	if (list == (struct sk_buff *)list_)
		list = NULL;
	return list;
}

/**
818
 *	skb_peek_tail - peek at the tail of an &sk_buff_head
L
Linus Torvalds 已提交
819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848
 *	@list_: list to peek at
 *
 *	Peek an &sk_buff. Unlike most other operations you _MUST_
 *	be careful with this one. A peek leaves the buffer on the
 *	list and someone else may run off with it. You must hold
 *	the appropriate locks or have a private queue to do this.
 *
 *	Returns %NULL for an empty list or a pointer to the tail element.
 *	The reference count is not incremented and the reference is therefore
 *	volatile. Use with caution.
 */
static inline struct sk_buff *skb_peek_tail(struct sk_buff_head *list_)
{
	struct sk_buff *list = ((struct sk_buff *)list_)->prev;
	if (list == (struct sk_buff *)list_)
		list = NULL;
	return list;
}

/**
 *	skb_queue_len	- get queue length
 *	@list_: list to measure
 *
 *	Return the length of an &sk_buff queue.
 */
static inline __u32 skb_queue_len(const struct sk_buff_head *list_)
{
	return list_->qlen;
}

849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864
/**
 *	__skb_queue_head_init - initialize non-spinlock portions of sk_buff_head
 *	@list: queue to initialize
 *
 *	This initializes only the list and queue length aspects of
 *	an sk_buff_head object.  This allows to initialize the list
 *	aspects of an sk_buff_head without reinitializing things like
 *	the spinlock.  It can also be used for on-stack sk_buff_head
 *	objects where the spinlock is known to not be used.
 */
static inline void __skb_queue_head_init(struct sk_buff_head *list)
{
	list->prev = list->next = (struct sk_buff *)list;
	list->qlen = 0;
}

865 866 867 868 869 870 871 872
/*
 * This function creates a split out lock class for each invocation;
 * this is needed for now since a whole lot of users of the skb-queue
 * infrastructure in drivers have different locking usage (in hardirq)
 * than the networking core (in softirq only). In the long run either the
 * network layer or drivers should need annotation to consolidate the
 * main types of usage into 3 classes.
 */
L
Linus Torvalds 已提交
873 874 875
static inline void skb_queue_head_init(struct sk_buff_head *list)
{
	spin_lock_init(&list->lock);
876
	__skb_queue_head_init(list);
L
Linus Torvalds 已提交
877 878
}

879 880 881 882 883 884 885
static inline void skb_queue_head_init_class(struct sk_buff_head *list,
		struct lock_class_key *class)
{
	skb_queue_head_init(list);
	lockdep_set_class(&list->lock, class);
}

L
Linus Torvalds 已提交
886
/*
887
 *	Insert an sk_buff on a list.
L
Linus Torvalds 已提交
888 889 890 891
 *
 *	The "__skb_xxxx()" functions are the non-atomic ones that
 *	can only be called with interrupts disabled.
 */
892 893 894 895 896 897 898 899 900 901
extern void        skb_insert(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list);
static inline void __skb_insert(struct sk_buff *newsk,
				struct sk_buff *prev, struct sk_buff *next,
				struct sk_buff_head *list)
{
	newsk->next = next;
	newsk->prev = prev;
	next->prev  = prev->next = newsk;
	list->qlen++;
}
L
Linus Torvalds 已提交
902

903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926
static inline void __skb_queue_splice(const struct sk_buff_head *list,
				      struct sk_buff *prev,
				      struct sk_buff *next)
{
	struct sk_buff *first = list->next;
	struct sk_buff *last = list->prev;

	first->prev = prev;
	prev->next = first;

	last->next = next;
	next->prev = last;
}

/**
 *	skb_queue_splice - join two skb lists, this is designed for stacks
 *	@list: the new list to add
 *	@head: the place to add it in the first list
 */
static inline void skb_queue_splice(const struct sk_buff_head *list,
				    struct sk_buff_head *head)
{
	if (!skb_queue_empty(list)) {
		__skb_queue_splice(list, (struct sk_buff *) head, head->next);
927
		head->qlen += list->qlen;
928 929 930 931 932 933 934 935 936 937 938 939 940 941 942
	}
}

/**
 *	skb_queue_splice - join two skb lists and reinitialise the emptied list
 *	@list: the new list to add
 *	@head: the place to add it in the first list
 *
 *	The list at @list is reinitialised
 */
static inline void skb_queue_splice_init(struct sk_buff_head *list,
					 struct sk_buff_head *head)
{
	if (!skb_queue_empty(list)) {
		__skb_queue_splice(list, (struct sk_buff *) head, head->next);
943
		head->qlen += list->qlen;
944 945 946 947 948 949 950 951 952 953 954 955 956 957
		__skb_queue_head_init(list);
	}
}

/**
 *	skb_queue_splice_tail - join two skb lists, each list being a queue
 *	@list: the new list to add
 *	@head: the place to add it in the first list
 */
static inline void skb_queue_splice_tail(const struct sk_buff_head *list,
					 struct sk_buff_head *head)
{
	if (!skb_queue_empty(list)) {
		__skb_queue_splice(list, head->prev, (struct sk_buff *) head);
958
		head->qlen += list->qlen;
959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974
	}
}

/**
 *	skb_queue_splice_tail - join two skb lists and reinitialise the emptied list
 *	@list: the new list to add
 *	@head: the place to add it in the first list
 *
 *	Each of the lists is a queue.
 *	The list at @list is reinitialised
 */
static inline void skb_queue_splice_tail_init(struct sk_buff_head *list,
					      struct sk_buff_head *head)
{
	if (!skb_queue_empty(list)) {
		__skb_queue_splice(list, head->prev, (struct sk_buff *) head);
975
		head->qlen += list->qlen;
976 977 978 979
		__skb_queue_head_init(list);
	}
}

L
Linus Torvalds 已提交
980
/**
981
 *	__skb_queue_after - queue a buffer at the list head
L
Linus Torvalds 已提交
982
 *	@list: list to use
983
 *	@prev: place after this buffer
L
Linus Torvalds 已提交
984 985
 *	@newsk: buffer to queue
 *
986
 *	Queue a buffer int the middle of a list. This function takes no locks
L
Linus Torvalds 已提交
987 988 989 990
 *	and you must therefore hold required locks before calling it.
 *
 *	A buffer cannot be placed on two lists at the same time.
 */
991 992 993
static inline void __skb_queue_after(struct sk_buff_head *list,
				     struct sk_buff *prev,
				     struct sk_buff *newsk)
L
Linus Torvalds 已提交
994
{
995
	__skb_insert(newsk, prev, prev->next, list);
L
Linus Torvalds 已提交
996 997
}

998 999 1000
extern void skb_append(struct sk_buff *old, struct sk_buff *newsk,
		       struct sk_buff_head *list);

1001 1002 1003 1004 1005 1006 1007
static inline void __skb_queue_before(struct sk_buff_head *list,
				      struct sk_buff *next,
				      struct sk_buff *newsk)
{
	__skb_insert(newsk, next->prev, next, list);
}

1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024
/**
 *	__skb_queue_head - queue a buffer at the list head
 *	@list: list to use
 *	@newsk: buffer to queue
 *
 *	Queue a buffer at the start of a list. This function takes no locks
 *	and you must therefore hold required locks before calling it.
 *
 *	A buffer cannot be placed on two lists at the same time.
 */
extern void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk);
static inline void __skb_queue_head(struct sk_buff_head *list,
				    struct sk_buff *newsk)
{
	__skb_queue_after(list, (struct sk_buff *)list, newsk);
}

L
Linus Torvalds 已提交
1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038
/**
 *	__skb_queue_tail - queue a buffer at the list tail
 *	@list: list to use
 *	@newsk: buffer to queue
 *
 *	Queue a buffer at the end of a list. This function takes no locks
 *	and you must therefore hold required locks before calling it.
 *
 *	A buffer cannot be placed on two lists at the same time.
 */
extern void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk);
static inline void __skb_queue_tail(struct sk_buff_head *list,
				   struct sk_buff *newsk)
{
1039
	__skb_queue_before(list, (struct sk_buff *)list, newsk);
L
Linus Torvalds 已提交
1040 1041 1042 1043 1044 1045
}

/*
 * remove sk_buff from list. _Must_ be called atomically, and with
 * the list known..
 */
D
David S. Miller 已提交
1046
extern void	   skb_unlink(struct sk_buff *skb, struct sk_buff_head *list);
L
Linus Torvalds 已提交
1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058
static inline void __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
{
	struct sk_buff *next, *prev;

	list->qlen--;
	next	   = skb->next;
	prev	   = skb->prev;
	skb->next  = skb->prev = NULL;
	next->prev = prev;
	prev->next = next;
}

1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074
/**
 *	__skb_dequeue - remove from the head of the queue
 *	@list: list to dequeue from
 *
 *	Remove the head of the list. This function does not take any locks
 *	so must be used with appropriate locks held only. The head item is
 *	returned or %NULL if the list is empty.
 */
extern struct sk_buff *skb_dequeue(struct sk_buff_head *list);
static inline struct sk_buff *__skb_dequeue(struct sk_buff_head *list)
{
	struct sk_buff *skb = skb_peek(list);
	if (skb)
		__skb_unlink(skb, list);
	return skb;
}
L
Linus Torvalds 已提交
1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123

/**
 *	__skb_dequeue_tail - remove from the tail of the queue
 *	@list: list to dequeue from
 *
 *	Remove the tail of the list. This function does not take any locks
 *	so must be used with appropriate locks held only. The tail item is
 *	returned or %NULL if the list is empty.
 */
extern struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list);
static inline struct sk_buff *__skb_dequeue_tail(struct sk_buff_head *list)
{
	struct sk_buff *skb = skb_peek_tail(list);
	if (skb)
		__skb_unlink(skb, list);
	return skb;
}


static inline int skb_is_nonlinear(const struct sk_buff *skb)
{
	return skb->data_len;
}

static inline unsigned int skb_headlen(const struct sk_buff *skb)
{
	return skb->len - skb->data_len;
}

static inline int skb_pagelen(const struct sk_buff *skb)
{
	int i, len = 0;

	for (i = (int)skb_shinfo(skb)->nr_frags - 1; i >= 0; i--)
		len += skb_shinfo(skb)->frags[i].size;
	return len + skb_headlen(skb);
}

static inline void skb_fill_page_desc(struct sk_buff *skb, int i,
				      struct page *page, int off, int size)
{
	skb_frag_t *frag = &skb_shinfo(skb)->frags[i];

	frag->page		  = page;
	frag->page_offset	  = off;
	frag->size		  = size;
	skb_shinfo(skb)->nr_frags = i + 1;
}

P
Peter Zijlstra 已提交
1124 1125 1126
extern void skb_add_rx_frag(struct sk_buff *skb, int i, struct page *page,
			    int off, int size);

L
Linus Torvalds 已提交
1127
#define SKB_PAGE_ASSERT(skb) 	BUG_ON(skb_shinfo(skb)->nr_frags)
1128
#define SKB_FRAG_ASSERT(skb) 	BUG_ON(skb_has_frag_list(skb))
L
Linus Torvalds 已提交
1129 1130
#define SKB_LINEAR_ASSERT(skb)  BUG_ON(skb_is_nonlinear(skb))

1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161
#ifdef NET_SKBUFF_DATA_USES_OFFSET
static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
{
	return skb->head + skb->tail;
}

static inline void skb_reset_tail_pointer(struct sk_buff *skb)
{
	skb->tail = skb->data - skb->head;
}

static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
{
	skb_reset_tail_pointer(skb);
	skb->tail += offset;
}
#else /* NET_SKBUFF_DATA_USES_OFFSET */
static inline unsigned char *skb_tail_pointer(const struct sk_buff *skb)
{
	return skb->tail;
}

static inline void skb_reset_tail_pointer(struct sk_buff *skb)
{
	skb->tail = skb->data;
}

static inline void skb_set_tail_pointer(struct sk_buff *skb, const int offset)
{
	skb->tail = skb->data + offset;
}
1162

1163 1164
#endif /* NET_SKBUFF_DATA_USES_OFFSET */

L
Linus Torvalds 已提交
1165 1166 1167
/*
 *	Add data to an sk_buff
 */
1168
extern unsigned char *skb_put(struct sk_buff *skb, unsigned int len);
L
Linus Torvalds 已提交
1169 1170
static inline unsigned char *__skb_put(struct sk_buff *skb, unsigned int len)
{
1171
	unsigned char *tmp = skb_tail_pointer(skb);
L
Linus Torvalds 已提交
1172 1173 1174 1175 1176 1177
	SKB_LINEAR_ASSERT(skb);
	skb->tail += len;
	skb->len  += len;
	return tmp;
}

1178
extern unsigned char *skb_push(struct sk_buff *skb, unsigned int len);
L
Linus Torvalds 已提交
1179 1180 1181 1182 1183 1184 1185
static inline unsigned char *__skb_push(struct sk_buff *skb, unsigned int len)
{
	skb->data -= len;
	skb->len  += len;
	return skb->data;
}

1186
extern unsigned char *skb_pull(struct sk_buff *skb, unsigned int len);
L
Linus Torvalds 已提交
1187 1188 1189 1190 1191 1192 1193
static inline unsigned char *__skb_pull(struct sk_buff *skb, unsigned int len)
{
	skb->len -= len;
	BUG_ON(skb->len < skb->data_len);
	return skb->data += len;
}

1194 1195 1196 1197 1198
static inline unsigned char *skb_pull_inline(struct sk_buff *skb, unsigned int len)
{
	return unlikely(len > skb->len) ? NULL : __skb_pull(skb, len);
}

L
Linus Torvalds 已提交
1199 1200 1201 1202 1203
extern unsigned char *__pskb_pull_tail(struct sk_buff *skb, int delta);

static inline unsigned char *__pskb_pull(struct sk_buff *skb, unsigned int len)
{
	if (len > skb_headlen(skb) &&
G
Gerrit Renker 已提交
1204
	    !__pskb_pull_tail(skb, len - skb_headlen(skb)))
L
Linus Torvalds 已提交
1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220
		return NULL;
	skb->len -= len;
	return skb->data += len;
}

static inline unsigned char *pskb_pull(struct sk_buff *skb, unsigned int len)
{
	return unlikely(len > skb->len) ? NULL : __pskb_pull(skb, len);
}

static inline int pskb_may_pull(struct sk_buff *skb, unsigned int len)
{
	if (likely(len <= skb_headlen(skb)))
		return 1;
	if (unlikely(len > skb->len))
		return 0;
G
Gerrit Renker 已提交
1221
	return __pskb_pull_tail(skb, len - skb_headlen(skb)) != NULL;
L
Linus Torvalds 已提交
1222 1223 1224 1225 1226 1227 1228 1229
}

/**
 *	skb_headroom - bytes at buffer head
 *	@skb: buffer to check
 *
 *	Return the number of bytes of free space at the head of an &sk_buff.
 */
1230
static inline unsigned int skb_headroom(const struct sk_buff *skb)
L
Linus Torvalds 已提交
1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242
{
	return skb->data - skb->head;
}

/**
 *	skb_tailroom - bytes at buffer end
 *	@skb: buffer to check
 *
 *	Return the number of bytes of free space at the tail of an sk_buff
 */
static inline int skb_tailroom(const struct sk_buff *skb)
{
1243
	return skb_is_nonlinear(skb) ? 0 : skb->end - skb->tail;
L
Linus Torvalds 已提交
1244 1245 1246 1247 1248 1249 1250 1251 1252 1253
}

/**
 *	skb_reserve - adjust headroom
 *	@skb: buffer to alter
 *	@len: bytes to move
 *
 *	Increase the headroom of an empty &sk_buff by reducing the tail
 *	room. This is only allowed for an empty buffer.
 */
1254
static inline void skb_reserve(struct sk_buff *skb, int len)
L
Linus Torvalds 已提交
1255 1256 1257 1258 1259
{
	skb->data += len;
	skb->tail += len;
}

1260
#ifdef NET_SKBUFF_DATA_USES_OFFSET
1261 1262
static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
{
1263
	return skb->head + skb->transport_header;
1264 1265
}

1266 1267
static inline void skb_reset_transport_header(struct sk_buff *skb)
{
1268
	skb->transport_header = skb->data - skb->head;
1269 1270
}

1271 1272 1273
static inline void skb_set_transport_header(struct sk_buff *skb,
					    const int offset)
{
1274 1275
	skb_reset_transport_header(skb);
	skb->transport_header += offset;
1276 1277
}

1278 1279
static inline unsigned char *skb_network_header(const struct sk_buff *skb)
{
1280
	return skb->head + skb->network_header;
1281 1282
}

1283 1284
static inline void skb_reset_network_header(struct sk_buff *skb)
{
1285
	skb->network_header = skb->data - skb->head;
1286 1287
}

1288 1289
static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
{
1290 1291
	skb_reset_network_header(skb);
	skb->network_header += offset;
1292 1293
}

1294
static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
1295
{
1296
	return skb->head + skb->mac_header;
1297 1298
}

1299
static inline int skb_mac_header_was_set(const struct sk_buff *skb)
1300
{
1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345
	return skb->mac_header != ~0U;
}

static inline void skb_reset_mac_header(struct sk_buff *skb)
{
	skb->mac_header = skb->data - skb->head;
}

static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
{
	skb_reset_mac_header(skb);
	skb->mac_header += offset;
}

#else /* NET_SKBUFF_DATA_USES_OFFSET */

static inline unsigned char *skb_transport_header(const struct sk_buff *skb)
{
	return skb->transport_header;
}

static inline void skb_reset_transport_header(struct sk_buff *skb)
{
	skb->transport_header = skb->data;
}

static inline void skb_set_transport_header(struct sk_buff *skb,
					    const int offset)
{
	skb->transport_header = skb->data + offset;
}

static inline unsigned char *skb_network_header(const struct sk_buff *skb)
{
	return skb->network_header;
}

static inline void skb_reset_network_header(struct sk_buff *skb)
{
	skb->network_header = skb->data;
}

static inline void skb_set_network_header(struct sk_buff *skb, const int offset)
{
	skb->network_header = skb->data + offset;
1346 1347
}

1348 1349
static inline unsigned char *skb_mac_header(const struct sk_buff *skb)
{
1350
	return skb->mac_header;
1351 1352 1353 1354
}

static inline int skb_mac_header_was_set(const struct sk_buff *skb)
{
1355
	return skb->mac_header != NULL;
1356 1357
}

1358 1359
static inline void skb_reset_mac_header(struct sk_buff *skb)
{
1360
	skb->mac_header = skb->data;
1361 1362
}

1363 1364
static inline void skb_set_mac_header(struct sk_buff *skb, const int offset)
{
1365
	skb->mac_header = skb->data + offset;
1366
}
1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382
#endif /* NET_SKBUFF_DATA_USES_OFFSET */

static inline int skb_transport_offset(const struct sk_buff *skb)
{
	return skb_transport_header(skb) - skb->data;
}

static inline u32 skb_network_header_len(const struct sk_buff *skb)
{
	return skb->transport_header - skb->network_header;
}

static inline int skb_network_offset(const struct sk_buff *skb)
{
	return skb_network_header(skb) - skb->data;
}
1383

1384 1385 1386 1387 1388
static inline int pskb_network_may_pull(struct sk_buff *skb, unsigned int len)
{
	return pskb_may_pull(skb, skb_network_offset(skb) + len);
}

L
Linus Torvalds 已提交
1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399
/*
 * CPUs often take a performance hit when accessing unaligned memory
 * locations. The actual performance hit varies, it can be small if the
 * hardware handles it or large if we have to take an exception and fix it
 * in software.
 *
 * Since an ethernet header is 14 bytes network drivers often end up with
 * the IP header at an unaligned offset. The IP header can be aligned by
 * shifting the start of the packet by 2 bytes. Drivers should do this
 * with:
 *
1400
 * skb_reserve(skb, NET_IP_ALIGN);
L
Linus Torvalds 已提交
1401 1402 1403 1404
 *
 * The downside to this alignment of the IP header is that the DMA is now
 * unaligned. On some architectures the cost of an unaligned DMA is high
 * and this cost outweighs the gains made by aligning the IP header.
1405
 *
L
Linus Torvalds 已提交
1406 1407 1408 1409 1410 1411 1412
 * Since this trade off varies between architectures, we allow NET_IP_ALIGN
 * to be overridden.
 */
#ifndef NET_IP_ALIGN
#define NET_IP_ALIGN	2
#endif

1413 1414 1415 1416
/*
 * The networking layer reserves some headroom in skb data (via
 * dev_alloc_skb). This is used to avoid having to reallocate skb data when
 * the header has to grow. In the default case, if the header has to grow
1417
 * 32 bytes or less we avoid the reallocation.
1418 1419 1420 1421 1422 1423 1424
 *
 * Unfortunately this headroom changes the DMA alignment of the resulting
 * network packet. As for NET_IP_ALIGN, this unaligned DMA is expensive
 * on some architectures. An architecture can override this value,
 * perhaps setting it to a cacheline in size (since that will maintain
 * cacheline alignment of the DMA). It must be a power of 2.
 *
1425
 * Various parts of the networking layer expect at least 32 bytes of
1426
 * headroom, you should not reduce this.
1427 1428 1429 1430
 *
 * Using max(32, L1_CACHE_BYTES) makes sense (especially with RPS)
 * to reduce average number of cache lines per packet.
 * get_rps_cpus() for example only access one 64 bytes aligned block :
1431
 * NET_IP_ALIGN(2) + ethernet_header(14) + IP_header(20/40) + ports(8)
1432 1433
 */
#ifndef NET_SKB_PAD
1434
#define NET_SKB_PAD	max(32, L1_CACHE_BYTES)
1435 1436
#endif

1437
extern int ___pskb_trim(struct sk_buff *skb, unsigned int len);
L
Linus Torvalds 已提交
1438 1439 1440

static inline void __skb_trim(struct sk_buff *skb, unsigned int len)
{
1441 1442 1443 1444
	if (unlikely(skb->data_len)) {
		WARN_ON(1);
		return;
	}
1445 1446
	skb->len = len;
	skb_set_tail_pointer(skb, len);
L
Linus Torvalds 已提交
1447 1448
}

1449
extern void skb_trim(struct sk_buff *skb, unsigned int len);
L
Linus Torvalds 已提交
1450 1451 1452

static inline int __pskb_trim(struct sk_buff *skb, unsigned int len)
{
1453 1454 1455 1456
	if (skb->data_len)
		return ___pskb_trim(skb, len);
	__skb_trim(skb, len);
	return 0;
L
Linus Torvalds 已提交
1457 1458 1459 1460 1461 1462 1463
}

static inline int pskb_trim(struct sk_buff *skb, unsigned int len)
{
	return (len < skb->len) ? __pskb_trim(skb, len) : 0;
}

1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478
/**
 *	pskb_trim_unique - remove end from a paged unique (not cloned) buffer
 *	@skb: buffer to alter
 *	@len: new length
 *
 *	This is identical to pskb_trim except that the caller knows that
 *	the skb is not cloned so we should never get an error due to out-
 *	of-memory.
 */
static inline void pskb_trim_unique(struct sk_buff *skb, unsigned int len)
{
	int err = pskb_trim(skb, len);
	BUG_ON(err);
}

L
Linus Torvalds 已提交
1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511
/**
 *	skb_orphan - orphan a buffer
 *	@skb: buffer to orphan
 *
 *	If a buffer currently has an owner then we call the owner's
 *	destructor function and make the @skb unowned. The buffer continues
 *	to exist but is no longer charged to its former owner.
 */
static inline void skb_orphan(struct sk_buff *skb)
{
	if (skb->destructor)
		skb->destructor(skb);
	skb->destructor = NULL;
	skb->sk		= NULL;
}

/**
 *	__skb_queue_purge - empty a list
 *	@list: list to empty
 *
 *	Delete all buffers on an &sk_buff list. Each buffer is removed from
 *	the list and one reference dropped. This function does not take the
 *	list lock and the caller must hold the relevant locks to use it.
 */
extern void skb_queue_purge(struct sk_buff_head *list);
static inline void __skb_queue_purge(struct sk_buff_head *list)
{
	struct sk_buff *skb;
	while ((skb = __skb_dequeue(list)) != NULL)
		kfree_skb(skb);
}

/**
1512
 *	__dev_alloc_skb - allocate an skbuff for receiving
L
Linus Torvalds 已提交
1513 1514 1515 1516 1517 1518 1519 1520
 *	@length: length to allocate
 *	@gfp_mask: get_free_pages mask, passed to alloc_skb
 *
 *	Allocate a new &sk_buff and assign it a usage count of one. The
 *	buffer has unspecified headroom built in. Users should allocate
 *	the headroom they think they need without accounting for the
 *	built in space. The built in space is used for optimisations.
 *
1521
 *	%NULL is returned if there is no free memory.
L
Linus Torvalds 已提交
1522 1523
 */
static inline struct sk_buff *__dev_alloc_skb(unsigned int length,
A
Al Viro 已提交
1524
					      gfp_t gfp_mask)
L
Linus Torvalds 已提交
1525
{
1526
	struct sk_buff *skb = alloc_skb(length + NET_SKB_PAD, gfp_mask);
L
Linus Torvalds 已提交
1527
	if (likely(skb))
1528
		skb_reserve(skb, NET_SKB_PAD);
L
Linus Torvalds 已提交
1529 1530 1531
	return skb;
}

1532
extern struct sk_buff *dev_alloc_skb(unsigned int length);
L
Linus Torvalds 已提交
1533

1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555
extern struct sk_buff *__netdev_alloc_skb(struct net_device *dev,
		unsigned int length, gfp_t gfp_mask);

/**
 *	netdev_alloc_skb - allocate an skbuff for rx on a specific device
 *	@dev: network device to receive on
 *	@length: length to allocate
 *
 *	Allocate a new &sk_buff and assign it a usage count of one. The
 *	buffer has unspecified headroom built in. Users should allocate
 *	the headroom they think they need without accounting for the
 *	built in space. The built in space is used for optimisations.
 *
 *	%NULL is returned if there is no free memory. Although this function
 *	allocates memory it can be called from an interrupt.
 */
static inline struct sk_buff *netdev_alloc_skb(struct net_device *dev,
		unsigned int length)
{
	return __netdev_alloc_skb(dev, length, GFP_ATOMIC);
}

1556 1557 1558 1559 1560 1561 1562 1563 1564 1565
static inline struct sk_buff *netdev_alloc_skb_ip_align(struct net_device *dev,
		unsigned int length)
{
	struct sk_buff *skb = netdev_alloc_skb(dev, length + NET_IP_ALIGN);

	if (NET_IP_ALIGN && skb)
		skb_reserve(skb, NET_IP_ALIGN);
	return skb;
}

P
Peter Zijlstra 已提交
1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585
extern struct page *__netdev_alloc_page(struct net_device *dev, gfp_t gfp_mask);

/**
 *	netdev_alloc_page - allocate a page for ps-rx on a specific device
 *	@dev: network device to receive on
 *
 * 	Allocate a new page node local to the specified device.
 *
 * 	%NULL is returned if there is no free memory.
 */
static inline struct page *netdev_alloc_page(struct net_device *dev)
{
	return __netdev_alloc_page(dev, GFP_ATOMIC);
}

static inline void netdev_free_page(struct net_device *dev, struct page *page)
{
	__free_page(page);
}

1586 1587 1588 1589 1590 1591 1592 1593
/**
 *	skb_clone_writable - is the header of a clone writable
 *	@skb: buffer to check
 *	@len: length up to which to write
 *
 *	Returns true if modifying the header part of the cloned buffer
 *	does not requires the data to be copied.
 */
1594
static inline int skb_clone_writable(struct sk_buff *skb, unsigned int len)
1595 1596 1597 1598 1599
{
	return !skb_header_cloned(skb) &&
	       skb_headroom(skb) + len <= skb->hdr_len;
}

H
Herbert Xu 已提交
1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615
static inline int __skb_cow(struct sk_buff *skb, unsigned int headroom,
			    int cloned)
{
	int delta = 0;

	if (headroom < NET_SKB_PAD)
		headroom = NET_SKB_PAD;
	if (headroom > skb_headroom(skb))
		delta = headroom - skb_headroom(skb);

	if (delta || cloned)
		return pskb_expand_head(skb, ALIGN(delta, NET_SKB_PAD), 0,
					GFP_ATOMIC);
	return 0;
}

L
Linus Torvalds 已提交
1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629
/**
 *	skb_cow - copy header of skb when it is required
 *	@skb: buffer to cow
 *	@headroom: needed headroom
 *
 *	If the skb passed lacks sufficient headroom or its data part
 *	is shared, data is reallocated. If reallocation fails, an error
 *	is returned and original skb is not changed.
 *
 *	The result is skb with writable area skb->head...skb->tail
 *	and at least @headroom of space at head.
 */
static inline int skb_cow(struct sk_buff *skb, unsigned int headroom)
{
H
Herbert Xu 已提交
1630 1631
	return __skb_cow(skb, headroom, skb_cloned(skb));
}
L
Linus Torvalds 已提交
1632

H
Herbert Xu 已提交
1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645
/**
 *	skb_cow_head - skb_cow but only making the head writable
 *	@skb: buffer to cow
 *	@headroom: needed headroom
 *
 *	This function is identical to skb_cow except that we replace the
 *	skb_cloned check by skb_header_cloned.  It should be used when
 *	you only need to push on some header and do not need to modify
 *	the data.
 */
static inline int skb_cow_head(struct sk_buff *skb, unsigned int headroom)
{
	return __skb_cow(skb, headroom, skb_header_cloned(skb));
L
Linus Torvalds 已提交
1646 1647 1648 1649 1650 1651 1652 1653 1654
}

/**
 *	skb_padto	- pad an skbuff up to a minimal size
 *	@skb: buffer to pad
 *	@len: minimal length
 *
 *	Pads up a buffer to ensure the trailing bytes exist and are
 *	blanked. If the buffer already contains sufficient data it
1655 1656
 *	is untouched. Otherwise it is extended. Returns zero on
 *	success. The skb is freed on error.
L
Linus Torvalds 已提交
1657 1658
 */
 
1659
static inline int skb_padto(struct sk_buff *skb, unsigned int len)
L
Linus Torvalds 已提交
1660 1661 1662
{
	unsigned int size = skb->len;
	if (likely(size >= len))
1663
		return 0;
G
Gerrit Renker 已提交
1664
	return skb_pad(skb, len - size);
L
Linus Torvalds 已提交
1665 1666 1667 1668 1669 1670 1671 1672 1673
}

static inline int skb_add_data(struct sk_buff *skb,
			       char __user *from, int copy)
{
	const int off = skb->len;

	if (skb->ip_summed == CHECKSUM_NONE) {
		int err = 0;
1674
		__wsum csum = csum_and_copy_from_user(from, skb_put(skb, copy),
L
Linus Torvalds 已提交
1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698
							    copy, 0, &err);
		if (!err) {
			skb->csum = csum_block_add(skb->csum, csum, off);
			return 0;
		}
	} else if (!copy_from_user(skb_put(skb, copy), from, copy))
		return 0;

	__skb_trim(skb, off);
	return -EFAULT;
}

static inline int skb_can_coalesce(struct sk_buff *skb, int i,
				   struct page *page, int off)
{
	if (i) {
		struct skb_frag_struct *frag = &skb_shinfo(skb)->frags[i - 1];

		return page == frag->page &&
		       off == frag->page_offset + frag->size;
	}
	return 0;
}

H
Herbert Xu 已提交
1699 1700 1701 1702 1703
static inline int __skb_linearize(struct sk_buff *skb)
{
	return __pskb_pull_tail(skb, skb->data_len) ? 0 : -ENOMEM;
}

L
Linus Torvalds 已提交
1704 1705 1706 1707 1708 1709 1710
/**
 *	skb_linearize - convert paged skb to linear one
 *	@skb: buffer to linarize
 *
 *	If there is no free memory -ENOMEM is returned, otherwise zero
 *	is returned and the old skb data released.
 */
H
Herbert Xu 已提交
1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723
static inline int skb_linearize(struct sk_buff *skb)
{
	return skb_is_nonlinear(skb) ? __skb_linearize(skb) : 0;
}

/**
 *	skb_linearize_cow - make sure skb is linear and writable
 *	@skb: buffer to process
 *
 *	If there is no free memory -ENOMEM is returned, otherwise zero
 *	is returned and the old skb data released.
 */
static inline int skb_linearize_cow(struct sk_buff *skb)
L
Linus Torvalds 已提交
1724
{
H
Herbert Xu 已提交
1725 1726
	return skb_is_nonlinear(skb) || skb_cloned(skb) ?
	       __skb_linearize(skb) : 0;
L
Linus Torvalds 已提交
1727 1728 1729 1730 1731 1732 1733 1734 1735
}

/**
 *	skb_postpull_rcsum - update checksum for received skb after pull
 *	@skb: buffer to update
 *	@start: start of data before pull
 *	@len: length of data pulled
 *
 *	After doing a pull on a received packet, you need to call this to
1736 1737
 *	update the CHECKSUM_COMPLETE checksum, or set ip_summed to
 *	CHECKSUM_NONE so that it can be recomputed from scratch.
L
Linus Torvalds 已提交
1738 1739 1740
 */

static inline void skb_postpull_rcsum(struct sk_buff *skb,
1741
				      const void *start, unsigned int len)
L
Linus Torvalds 已提交
1742
{
1743
	if (skb->ip_summed == CHECKSUM_COMPLETE)
L
Linus Torvalds 已提交
1744 1745 1746
		skb->csum = csum_sub(skb->csum, csum_partial(start, len, 0));
}

1747 1748
unsigned char *skb_pull_rcsum(struct sk_buff *skb, unsigned int len);

L
Linus Torvalds 已提交
1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759
/**
 *	pskb_trim_rcsum - trim received skb and update checksum
 *	@skb: buffer to trim
 *	@len: new length
 *
 *	This is exactly the same as pskb_trim except that it ensures the
 *	checksum of received packets are still valid after the operation.
 */

static inline int pskb_trim_rcsum(struct sk_buff *skb, unsigned int len)
{
1760
	if (likely(len >= skb->len))
L
Linus Torvalds 已提交
1761
		return 0;
1762
	if (skb->ip_summed == CHECKSUM_COMPLETE)
L
Linus Torvalds 已提交
1763 1764 1765 1766 1767 1768 1769 1770 1771
		skb->ip_summed = CHECKSUM_NONE;
	return __pskb_trim(skb, len);
}

#define skb_queue_walk(queue, skb) \
		for (skb = (queue)->next;					\
		     prefetch(skb->next), (skb != (struct sk_buff *)(queue));	\
		     skb = skb->next)

1772 1773 1774 1775 1776
#define skb_queue_walk_safe(queue, skb, tmp)					\
		for (skb = (queue)->next, tmp = skb->next;			\
		     skb != (struct sk_buff *)(queue);				\
		     skb = tmp, tmp = skb->next)

1777 1778 1779 1780 1781 1782 1783 1784 1785
#define skb_queue_walk_from(queue, skb)						\
		for (; prefetch(skb->next), (skb != (struct sk_buff *)(queue));	\
		     skb = skb->next)

#define skb_queue_walk_from_safe(queue, skb, tmp)				\
		for (tmp = skb->next;						\
		     skb != (struct sk_buff *)(queue);				\
		     skb = tmp, tmp = skb->next)

1786 1787 1788 1789 1790
#define skb_queue_reverse_walk(queue, skb) \
		for (skb = (queue)->prev;					\
		     prefetch(skb->prev), (skb != (struct sk_buff *)(queue));	\
		     skb = skb->prev)

L
Linus Torvalds 已提交
1791

1792
static inline bool skb_has_frag_list(const struct sk_buff *skb)
1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810
{
	return skb_shinfo(skb)->frag_list != NULL;
}

static inline void skb_frag_list_init(struct sk_buff *skb)
{
	skb_shinfo(skb)->frag_list = NULL;
}

static inline void skb_frag_add_head(struct sk_buff *skb, struct sk_buff *frag)
{
	frag->next = skb_shinfo(skb)->frag_list;
	skb_shinfo(skb)->frag_list = frag;
}

#define skb_walk_frags(skb, iter)	\
	for (iter = skb_shinfo(skb)->frag_list; iter; iter = iter->next)

1811 1812
extern struct sk_buff *__skb_recv_datagram(struct sock *sk, unsigned flags,
					   int *peeked, int *err);
L
Linus Torvalds 已提交
1813 1814 1815 1816 1817 1818 1819
extern struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags,
					 int noblock, int *err);
extern unsigned int    datagram_poll(struct file *file, struct socket *sock,
				     struct poll_table_struct *wait);
extern int	       skb_copy_datagram_iovec(const struct sk_buff *from,
					       int offset, struct iovec *to,
					       int size);
1820
extern int	       skb_copy_and_csum_datagram_iovec(struct sk_buff *skb,
L
Linus Torvalds 已提交
1821 1822
							int hlen,
							struct iovec *iov);
1823 1824
extern int	       skb_copy_datagram_from_iovec(struct sk_buff *skb,
						    int offset,
1825 1826
						    const struct iovec *from,
						    int from_offset,
1827
						    int len);
1828 1829 1830 1831 1832
extern int	       skb_copy_datagram_const_iovec(const struct sk_buff *from,
						     int offset,
						     const struct iovec *to,
						     int to_offset,
						     int size);
L
Linus Torvalds 已提交
1833
extern void	       skb_free_datagram(struct sock *sk, struct sk_buff *skb);
1834 1835
extern void	       skb_free_datagram_locked(struct sock *sk,
						struct sk_buff *skb);
1836
extern int	       skb_kill_datagram(struct sock *sk, struct sk_buff *skb,
1837
					 unsigned int flags);
1838 1839
extern __wsum	       skb_checksum(const struct sk_buff *skb, int offset,
				    int len, __wsum csum);
L
Linus Torvalds 已提交
1840 1841
extern int	       skb_copy_bits(const struct sk_buff *skb, int offset,
				     void *to, int len);
1842 1843
extern int	       skb_store_bits(struct sk_buff *skb, int offset,
				      const void *from, int len);
1844
extern __wsum	       skb_copy_and_csum_bits(const struct sk_buff *skb,
L
Linus Torvalds 已提交
1845
					      int offset, u8 *to, int len,
1846
					      __wsum csum);
J
Jens Axboe 已提交
1847 1848 1849 1850 1851
extern int             skb_splice_bits(struct sk_buff *skb,
						unsigned int offset,
						struct pipe_inode_info *pipe,
						unsigned int len,
						unsigned int flags);
L
Linus Torvalds 已提交
1852 1853 1854
extern void	       skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to);
extern void	       skb_split(struct sk_buff *skb,
				 struct sk_buff *skb1, const u32 len);
1855 1856
extern int	       skb_shift(struct sk_buff *tgt, struct sk_buff *skb,
				 int shiftlen);
L
Linus Torvalds 已提交
1857

1858
extern struct sk_buff *skb_segment(struct sk_buff *skb, int features);
1859

L
Linus Torvalds 已提交
1860 1861 1862 1863 1864
static inline void *skb_header_pointer(const struct sk_buff *skb, int offset,
				       int len, void *buffer)
{
	int hlen = skb_headlen(skb);

1865
	if (hlen - offset >= len)
L
Linus Torvalds 已提交
1866 1867 1868 1869 1870 1871 1872 1873
		return skb->data + offset;

	if (skb_copy_bits(skb, offset, buffer, len) < 0)
		return NULL;

	return buffer;
}

1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887
static inline void skb_copy_from_linear_data(const struct sk_buff *skb,
					     void *to,
					     const unsigned int len)
{
	memcpy(to, skb->data, len);
}

static inline void skb_copy_from_linear_data_offset(const struct sk_buff *skb,
						    const int offset, void *to,
						    const unsigned int len)
{
	memcpy(to, skb->data + offset, len);
}

1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902
static inline void skb_copy_to_linear_data(struct sk_buff *skb,
					   const void *from,
					   const unsigned int len)
{
	memcpy(skb->data, from, len);
}

static inline void skb_copy_to_linear_data_offset(struct sk_buff *skb,
						  const int offset,
						  const void *from,
						  const unsigned int len)
{
	memcpy(skb->data + offset, from, len);
}

L
Linus Torvalds 已提交
1903 1904
extern void skb_init(void);

1905 1906 1907 1908 1909
static inline ktime_t skb_get_ktime(const struct sk_buff *skb)
{
	return skb->tstamp;
}

1910 1911 1912 1913 1914 1915 1916 1917 1918
/**
 *	skb_get_timestamp - get timestamp from a skb
 *	@skb: skb to get stamp from
 *	@stamp: pointer to struct timeval to store stamp in
 *
 *	Timestamps are stored in the skb as offsets to a base timestamp.
 *	This function converts the offset back to a struct timeval and stores
 *	it in stamp.
 */
1919 1920
static inline void skb_get_timestamp(const struct sk_buff *skb,
				     struct timeval *stamp)
1921
{
1922
	*stamp = ktime_to_timeval(skb->tstamp);
1923 1924
}

1925 1926 1927 1928 1929 1930
static inline void skb_get_timestampns(const struct sk_buff *skb,
				       struct timespec *stamp)
{
	*stamp = ktime_to_timespec(skb->tstamp);
}

1931
static inline void __net_timestamp(struct sk_buff *skb)
1932
{
1933
	skb->tstamp = ktime_get_real();
1934 1935
}

1936 1937 1938 1939 1940
static inline ktime_t net_timedelta(ktime_t t)
{
	return ktime_sub(ktime_get_real(), t);
}

1941 1942 1943 1944
static inline ktime_t net_invalid_timestamp(void)
{
	return ktime_set(0, 0);
}
1945

1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975
extern void skb_timestamping_init(void);

#ifdef CONFIG_NETWORK_PHY_TIMESTAMPING

extern void skb_clone_tx_timestamp(struct sk_buff *skb);
extern bool skb_defer_rx_timestamp(struct sk_buff *skb);

#else /* CONFIG_NETWORK_PHY_TIMESTAMPING */

static inline void skb_clone_tx_timestamp(struct sk_buff *skb)
{
}

static inline bool skb_defer_rx_timestamp(struct sk_buff *skb)
{
	return false;
}

#endif /* !CONFIG_NETWORK_PHY_TIMESTAMPING */

/**
 * skb_complete_tx_timestamp() - deliver cloned skb with tx timestamps
 *
 * @skb: clone of the the original outgoing packet
 * @hwtstamps: hardware time stamps
 *
 */
void skb_complete_tx_timestamp(struct sk_buff *skb,
			       struct skb_shared_hwtstamps *hwtstamps);

1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989
/**
 * skb_tstamp_tx - queue clone of skb with send time stamps
 * @orig_skb:	the original outgoing packet
 * @hwtstamps:	hardware time stamps, may be NULL if not available
 *
 * If the skb has a socket associated, then this function clones the
 * skb (thus sharing the actual data and optional structures), stores
 * the optional hardware time stamping information (if non NULL) or
 * generates a software time stamp (otherwise), then queues the clone
 * to the error queue of the socket.  Errors are silently ignored.
 */
extern void skb_tstamp_tx(struct sk_buff *orig_skb,
			struct skb_shared_hwtstamps *hwtstamps);

1990 1991
static inline void sw_tx_timestamp(struct sk_buff *skb)
{
1992 1993
	if (skb_shinfo(skb)->tx_flags & SKBTX_SW_TSTAMP &&
	    !(skb_shinfo(skb)->tx_flags & SKBTX_IN_PROGRESS))
1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007
		skb_tstamp_tx(skb, NULL);
}

/**
 * skb_tx_timestamp() - Driver hook for transmit timestamping
 *
 * Ethernet MAC Drivers should call this function in their hard_xmit()
 * function as soon as possible after giving the sk_buff to the MAC
 * hardware, but before freeing the sk_buff.
 *
 * @skb: A socket buffer.
 */
static inline void skb_tx_timestamp(struct sk_buff *skb)
{
2008
	skb_clone_tx_timestamp(skb);
2009 2010 2011
	sw_tx_timestamp(skb);
}

2012
extern __sum16 __skb_checksum_complete_head(struct sk_buff *skb, int len);
2013
extern __sum16 __skb_checksum_complete(struct sk_buff *skb);
2014

2015 2016 2017 2018 2019
static inline int skb_csum_unnecessary(const struct sk_buff *skb)
{
	return skb->ip_summed & CHECKSUM_UNNECESSARY;
}

2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035
/**
 *	skb_checksum_complete - Calculate checksum of an entire packet
 *	@skb: packet to process
 *
 *	This function calculates the checksum over the entire packet plus
 *	the value of skb->csum.  The latter can be used to supply the
 *	checksum of a pseudo header as used by TCP/UDP.  It returns the
 *	checksum.
 *
 *	For protocols that contain complete checksums such as ICMP/TCP/UDP,
 *	this function can be used to verify that checksum on received
 *	packets.  In that case the function should return zero if the
 *	checksum is correct.  In particular, this function will return zero
 *	if skb->ip_summed is CHECKSUM_UNNECESSARY which indicates that the
 *	hardware has already verified the correctness of the checksum.
 */
2036
static inline __sum16 skb_checksum_complete(struct sk_buff *skb)
2037
{
2038 2039
	return skb_csum_unnecessary(skb) ?
	       0 : __skb_checksum_complete(skb);
2040 2041
}

2042
#if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2043
extern void nf_conntrack_destroy(struct nf_conntrack *nfct);
L
Linus Torvalds 已提交
2044 2045 2046
static inline void nf_conntrack_put(struct nf_conntrack *nfct)
{
	if (nfct && atomic_dec_and_test(&nfct->use))
2047
		nf_conntrack_destroy(nfct);
L
Linus Torvalds 已提交
2048 2049 2050 2051 2052 2053
}
static inline void nf_conntrack_get(struct nf_conntrack *nfct)
{
	if (nfct)
		atomic_inc(&nfct->use);
}
2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064
static inline void nf_conntrack_get_reasm(struct sk_buff *skb)
{
	if (skb)
		atomic_inc(&skb->users);
}
static inline void nf_conntrack_put_reasm(struct sk_buff *skb)
{
	if (skb)
		kfree_skb(skb);
}
#endif
L
Linus Torvalds 已提交
2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076
#ifdef CONFIG_BRIDGE_NETFILTER
static inline void nf_bridge_put(struct nf_bridge_info *nf_bridge)
{
	if (nf_bridge && atomic_dec_and_test(&nf_bridge->use))
		kfree(nf_bridge);
}
static inline void nf_bridge_get(struct nf_bridge_info *nf_bridge)
{
	if (nf_bridge)
		atomic_inc(&nf_bridge->use);
}
#endif /* CONFIG_BRIDGE_NETFILTER */
2077 2078
static inline void nf_reset(struct sk_buff *skb)
{
2079
#if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090
	nf_conntrack_put(skb->nfct);
	skb->nfct = NULL;
	nf_conntrack_put_reasm(skb->nfct_reasm);
	skb->nfct_reasm = NULL;
#endif
#ifdef CONFIG_BRIDGE_NETFILTER
	nf_bridge_put(skb->nf_bridge);
	skb->nf_bridge = NULL;
#endif
}

2091 2092 2093
/* Note: This doesn't put any conntrack and bridge info in dst. */
static inline void __nf_copy(struct sk_buff *dst, const struct sk_buff *src)
{
2094
#if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106
	dst->nfct = src->nfct;
	nf_conntrack_get(src->nfct);
	dst->nfctinfo = src->nfctinfo;
	dst->nfct_reasm = src->nfct_reasm;
	nf_conntrack_get_reasm(src->nfct_reasm);
#endif
#ifdef CONFIG_BRIDGE_NETFILTER
	dst->nf_bridge  = src->nf_bridge;
	nf_bridge_get(src->nf_bridge);
#endif
}

2107 2108 2109
static inline void nf_copy(struct sk_buff *dst, const struct sk_buff *src)
{
#if defined(CONFIG_NF_CONNTRACK) || defined(CONFIG_NF_CONNTRACK_MODULE)
2110
	nf_conntrack_put(dst->nfct);
2111 2112 2113 2114 2115 2116 2117 2118
	nf_conntrack_put_reasm(dst->nfct_reasm);
#endif
#ifdef CONFIG_BRIDGE_NETFILTER
	nf_bridge_put(dst->nf_bridge);
#endif
	__nf_copy(dst, src);
}

2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136
#ifdef CONFIG_NETWORK_SECMARK
static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
{
	to->secmark = from->secmark;
}

static inline void skb_init_secmark(struct sk_buff *skb)
{
	skb->secmark = 0;
}
#else
static inline void skb_copy_secmark(struct sk_buff *to, const struct sk_buff *from)
{ }

static inline void skb_init_secmark(struct sk_buff *skb)
{ }
#endif

2137 2138 2139 2140 2141
static inline void skb_set_queue_mapping(struct sk_buff *skb, u16 queue_mapping)
{
	skb->queue_mapping = queue_mapping;
}

2142
static inline u16 skb_get_queue_mapping(const struct sk_buff *skb)
2143 2144 2145 2146
{
	return skb->queue_mapping;
}

2147 2148 2149 2150 2151
static inline void skb_copy_queue_mapping(struct sk_buff *to, const struct sk_buff *from)
{
	to->queue_mapping = from->queue_mapping;
}

2152 2153 2154 2155 2156
static inline void skb_record_rx_queue(struct sk_buff *skb, u16 rx_queue)
{
	skb->queue_mapping = rx_queue + 1;
}

2157
static inline u16 skb_get_rx_queue(const struct sk_buff *skb)
2158 2159 2160 2161
{
	return skb->queue_mapping - 1;
}

2162
static inline bool skb_rx_queue_recorded(const struct sk_buff *skb)
2163
{
E
Eric Dumazet 已提交
2164
	return skb->queue_mapping != 0;
2165 2166
}

2167 2168 2169
extern u16 skb_tx_hash(const struct net_device *dev,
		       const struct sk_buff *skb);

2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181
#ifdef CONFIG_XFRM
static inline struct sec_path *skb_sec_path(struct sk_buff *skb)
{
	return skb->sp;
}
#else
static inline struct sec_path *skb_sec_path(struct sk_buff *skb)
{
	return NULL;
}
#endif

H
Herbert Xu 已提交
2182 2183 2184 2185 2186
static inline int skb_is_gso(const struct sk_buff *skb)
{
	return skb_shinfo(skb)->gso_size;
}

B
Brice Goglin 已提交
2187 2188 2189 2190 2191
static inline int skb_is_gso_v6(const struct sk_buff *skb)
{
	return skb_shinfo(skb)->gso_type & SKB_GSO_TCPV6;
}

2192 2193 2194 2195 2196 2197 2198
extern void __skb_warn_lro_forwarding(const struct sk_buff *skb);

static inline bool skb_warn_if_lro(const struct sk_buff *skb)
{
	/* LRO sets gso_size but not gso_type, whereas if GSO is really
	 * wanted then gso_type will be set. */
	struct skb_shared_info *shinfo = skb_shinfo(skb);
2199 2200
	if (skb_is_nonlinear(skb) && shinfo->gso_size != 0 &&
	    unlikely(shinfo->gso_type == 0)) {
2201 2202 2203 2204 2205 2206
		__skb_warn_lro_forwarding(skb);
		return true;
	}
	return false;
}

2207 2208 2209 2210 2211 2212 2213
static inline void skb_forward_csum(struct sk_buff *skb)
{
	/* Unfortunately we don't support this one.  Any brave souls? */
	if (skb->ip_summed == CHECKSUM_COMPLETE)
		skb->ip_summed = CHECKSUM_NONE;
}

2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228
/**
 * skb_checksum_none_assert - make sure skb ip_summed is CHECKSUM_NONE
 * @skb: skb to check
 *
 * fresh skbs have their ip_summed set to CHECKSUM_NONE.
 * Instead of forcing ip_summed to CHECKSUM_NONE, we can
 * use this helper, to document places where we make this assertion.
 */
static inline void skb_checksum_none_assert(struct sk_buff *skb)
{
#ifdef DEBUG
	BUG_ON(skb->ip_summed != CHECKSUM_NONE);
#endif
}

2229
bool skb_partial_csum_set(struct sk_buff *skb, u16 start, u16 off);
L
Linus Torvalds 已提交
2230 2231
#endif	/* __KERNEL__ */
#endif	/* _LINUX_SKBUFF_H */