2 * Definitions for the 'struct sk_buff' memory handlers.
5 * Alan Cox, <gw4pts@gw4pts.ampr.org>
6 * Florian La Roche, <rzsfl@rz.uni-sb.de>
8 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License
10 * as published by the Free Software Foundation; either version
11 * 2 of the License, or (at your option) any later version.
14 #ifndef _LINUX_SKBUFF_H
15 #define _LINUX_SKBUFF_H
17 #include <linux/config.h>
18 #include <linux/kernel.h>
19 #include <linux/compiler.h>
20 #include <linux/time.h>
21 #include <linux/cache.h>
23 #include <asm/atomic.h>
24 #include <asm/types.h>
25 #include <linux/spinlock.h>
27 #include <linux/highmem.h>
28 #include <linux/poll.h>
29 #include <linux/net.h>
30 #include <net/checksum.h>
32 #define HAVE_ALLOC_SKB /* For the drivers to know */
33 #define HAVE_ALIGNABLE_SKB /* Ditto 8) */
34 #define SLAB_SKB /* Slabified skbuffs */
36 #define CHECKSUM_NONE 0
38 #define CHECKSUM_UNNECESSARY 2
40 #define SKB_DATA_ALIGN(X) (((X) + (SMP_CACHE_BYTES - 1)) & \
41 ~(SMP_CACHE_BYTES - 1))
42 #define SKB_MAX_ORDER(X, ORDER) (((PAGE_SIZE << (ORDER)) - (X) - \
43 sizeof(struct skb_shared_info)) & \
44 ~(SMP_CACHE_BYTES - 1))
45 #define SKB_MAX_HEAD(X) (SKB_MAX_ORDER((X), 0))
46 #define SKB_MAX_ALLOC (SKB_MAX_ORDER(0, 2))
48 /* A. Checksumming of received packets by device.
50 * NONE: device failed to checksum this packet.
51 * skb->csum is undefined.
53 * UNNECESSARY: device parsed packet and wouldbe verified checksum.
54 * skb->csum is undefined.
55 * It is bad option, but, unfortunately, many of vendors do this.
56 * Apparently with secret goal to sell you new device, when you
57 * will add new protocol to your host. F.e. IPv6. 8)
59 * HW: the most generic way. Device supplied checksum of _all_
60 * the packet as seen by netif_rx in skb->csum.
61 * NOTE: Even if device supports only some protocols, but
62 * is able to produce some skb->csum, it MUST use HW,
65 * B. Checksumming on output.
67 * NONE: skb is checksummed by protocol or csum is not required.
69 * HW: device is required to csum packet as seen by hard_start_xmit
70 * from skb->h.raw to the end and to record the checksum
71 * at skb->h.raw+skb->csum.
73 * Device must show its capabilities in dev->features, set
74 * at device setup time.
75 * NETIF_F_HW_CSUM - it is clever device, it is able to checksum
77 * NETIF_F_NO_CSUM - loopback or reliable single hop media.
78 * NETIF_F_IP_CSUM - device is dumb. It is able to csum only
79 * TCP/UDP over IPv4. Sigh. Vendors like this
80 * way by an unknown reason. Though, see comment above
81 * about CHECKSUM_UNNECESSARY. 8)
83 * Any questions? No questions, good. --ANK
87 #define NET_CALLER(arg) (*(((void **)&arg) - 1))
89 #define NET_CALLER(arg) __builtin_return_address(0)
92 #ifdef CONFIG_NETFILTER
95 void (*destroy)(struct nf_conntrack *);
99 struct nf_conntrack *master;
102 #ifdef CONFIG_BRIDGE_NETFILTER
103 struct nf_bridge_info {
105 struct net_device *physindev;
106 struct net_device *physoutdev;
107 #if defined(CONFIG_VLAN_8021Q) || defined(CONFIG_VLAN_8021Q_MODULE)
108 struct net_device *netoutdev;
111 unsigned long data[32 / sizeof(unsigned long)];
117 struct sk_buff_head {
118 /* These two members must be first. */
119 struct sk_buff *next;
120 struct sk_buff *prev;
128 /* To allow 64K frame to be packed as single skb without frag_list */
129 #define MAX_SKB_FRAGS (65536/PAGE_SIZE + 2)
131 typedef struct skb_frag_struct skb_frag_t;
133 struct skb_frag_struct {
139 /* This data is invariant across clones and lives at
140 * the end of the header data, ie. at skb->end.
142 struct skb_shared_info {
144 unsigned int nr_frags;
145 unsigned short tso_size;
146 unsigned short tso_segs;
147 struct sk_buff *frag_list;
148 skb_frag_t frags[MAX_SKB_FRAGS];
152 * struct sk_buff - socket buffer
153 * @next: Next buffer in list
154 * @prev: Previous buffer in list
155 * @list: List we are on
156 * @sk: Socket we are owned by
157 * @stamp: Time we arrived
158 * @dev: Device we arrived on/are leaving by
159 * @input_dev: Device we arrived on
160 * @real_dev: The real device we are using
161 * @h: Transport layer header
162 * @nh: Network layer header
163 * @mac: Link layer header
164 * @dst: FIXME: Describe this field
165 * @cb: Control buffer. Free for use by every layer. Put private vars here
166 * @len: Length of actual data
167 * @data_len: Data length
168 * @mac_len: Length of link layer header
170 * @__unused: Dead field, may be reused
171 * @cloned: Head may be cloned (check refcnt to be sure)
172 * @pkt_type: Packet class
173 * @ip_summed: Driver fed us an IP checksum
174 * @priority: Packet queueing priority
175 * @users: User count - see {datagram,tcp}.c
176 * @protocol: Packet protocol from driver
177 * @security: Security level of packet
178 * @truesize: Buffer size
179 * @head: Head of buffer
180 * @data: Data head pointer
181 * @tail: Tail pointer
183 * @destructor: Destruct function
184 * @nfmark: Can be used for communication between hooks
185 * @nfcache: Cache info
186 * @nfct: Associated connection, if any
187 * @nf_debug: Netfilter debugging
188 * @nf_bridge: Saved data about a bridged frame - see br_netfilter.c
189 * @private: Data which is private to the HIPPI implementation
190 * @tc_index: Traffic control index
194 /* These two members must be first. */
195 struct sk_buff *next;
196 struct sk_buff *prev;
198 struct sk_buff_head *list;
200 struct timeval stamp;
201 struct net_device *dev;
202 struct net_device *input_dev;
203 struct net_device *real_dev;
208 struct icmphdr *icmph;
209 struct igmphdr *igmph;
211 struct ipv6hdr *ipv6h;
217 struct ipv6hdr *ipv6h;
223 struct ethhdr *ethernet;
227 struct dst_entry *dst;
231 * This is the control buffer. It is free to use for every
232 * layer. Please put your private variables there. If you
233 * want to keep them across layers you have to do a skb_clone()
234 * first. This is owned by whoever has the skb queued ATM.
242 unsigned char local_df,
247 unsigned short protocol,
250 void (*destructor)(struct sk_buff *skb);
251 #ifdef CONFIG_NETFILTER
252 unsigned long nfmark;
254 struct nf_ct_info *nfct;
255 #ifdef CONFIG_NETFILTER_DEBUG
256 unsigned int nf_debug;
258 #ifdef CONFIG_BRIDGE_NETFILTER
259 struct nf_bridge_info *nf_bridge;
261 #endif /* CONFIG_NETFILTER */
262 #if defined(CONFIG_HIPPI)
267 #ifdef CONFIG_NET_SCHED
268 __u32 tc_index; /* traffic control index */
269 #ifdef CONFIG_NET_CLS_ACT
270 __u32 tc_verd; /* traffic control verdict */
271 __u32 tc_classid; /* traffic control classid */
275 xid_t xid; /* VServer context ID */
278 /* These elements must be at the end, see alloc_skb() for details. */
279 unsigned int truesize;
289 * Handling routines are only of interest to the kernel
291 #include <linux/slab.h>
293 #include <asm/system.h>
295 extern void __kfree_skb(struct sk_buff *skb);
296 extern struct sk_buff *alloc_skb(unsigned int size, int priority);
297 extern void kfree_skbmem(struct sk_buff *skb);
298 extern struct sk_buff *skb_clone(struct sk_buff *skb, int priority);
299 extern struct sk_buff *skb_copy(const struct sk_buff *skb, int priority);
300 extern struct sk_buff *pskb_copy(struct sk_buff *skb, int gfp_mask);
301 extern int pskb_expand_head(struct sk_buff *skb,
302 int nhead, int ntail, int gfp_mask);
303 extern struct sk_buff *skb_realloc_headroom(struct sk_buff *skb,
304 unsigned int headroom);
305 extern struct sk_buff *skb_copy_expand(const struct sk_buff *skb,
306 int newheadroom, int newtailroom,
308 extern struct sk_buff * skb_pad(struct sk_buff *skb, int pad);
309 #define dev_kfree_skb(a) kfree_skb(a)
310 extern void skb_over_panic(struct sk_buff *skb, int len,
312 extern void skb_under_panic(struct sk_buff *skb, int len,
316 #define skb_shinfo(SKB) ((struct skb_shared_info *)((SKB)->end))
319 * skb_queue_empty - check if a queue is empty
322 * Returns true if the queue is empty, false otherwise.
324 static inline int skb_queue_empty(const struct sk_buff_head *list)
326 return list->next == (struct sk_buff *)list;
330 * skb_get - reference buffer
331 * @skb: buffer to reference
333 * Makes another reference to a socket buffer and returns a pointer
336 static inline struct sk_buff *skb_get(struct sk_buff *skb)
338 atomic_inc(&skb->users);
343 * If users == 1, we are the only owner and are can avoid redundant
348 * kfree_skb - free an sk_buff
349 * @skb: buffer to free
351 * Drop a reference to the buffer and free it if the usage count has
354 static inline void kfree_skb(struct sk_buff *skb)
356 if (atomic_read(&skb->users) == 1 || atomic_dec_and_test(&skb->users))
360 /* Use this if you didn't touch the skb state [for fast switching] */
361 static inline void kfree_skb_fast(struct sk_buff *skb)
363 if (atomic_read(&skb->users) == 1 || atomic_dec_and_test(&skb->users))
368 * skb_cloned - is the buffer a clone
369 * @skb: buffer to check
371 * Returns true if the buffer was generated with skb_clone() and is
372 * one of multiple shared copies of the buffer. Cloned buffers are
373 * shared data so must not be written to under normal circumstances.
375 static inline int skb_cloned(const struct sk_buff *skb)
377 return skb->cloned && atomic_read(&skb_shinfo(skb)->dataref) != 1;
381 * skb_shared - is the buffer shared
382 * @skb: buffer to check
384 * Returns true if more than one person has a reference to this
387 static inline int skb_shared(const struct sk_buff *skb)
389 return atomic_read(&skb->users) != 1;
393 * skb_share_check - check if buffer is shared and if so clone it
394 * @skb: buffer to check
395 * @pri: priority for memory allocation
397 * If the buffer is shared the buffer is cloned and the old copy
398 * drops a reference. A new clone with a single reference is returned.
399 * If the buffer is not shared the original buffer is returned. When
400 * being called from interrupt status or with spinlocks held pri must
403 * NULL is returned on a memory allocation failure.
405 static inline struct sk_buff *skb_share_check(struct sk_buff *skb, int pri)
407 might_sleep_if(pri & __GFP_WAIT);
408 if (skb_shared(skb)) {
409 struct sk_buff *nskb = skb_clone(skb, pri);
417 * Copy shared buffers into a new sk_buff. We effectively do COW on
418 * packets to handle cases where we have a local reader and forward
419 * and a couple of other messy ones. The normal one is tcpdumping
420 * a packet thats being forwarded.
424 * skb_unshare - make a copy of a shared buffer
425 * @skb: buffer to check
426 * @pri: priority for memory allocation
428 * If the socket buffer is a clone then this function creates a new
429 * copy of the data, drops a reference count on the old copy and returns
430 * the new copy with the reference count at 1. If the buffer is not a clone
431 * the original buffer is returned. When called with a spinlock held or
432 * from interrupt state @pri must be %GFP_ATOMIC
434 * %NULL is returned on a memory allocation failure.
436 static inline struct sk_buff *skb_unshare(struct sk_buff *skb, int pri)
438 might_sleep_if(pri & __GFP_WAIT);
439 if (skb_cloned(skb)) {
440 struct sk_buff *nskb = skb_copy(skb, pri);
441 kfree_skb(skb); /* Free our shared copy */
449 * @list_: list to peek at
451 * Peek an &sk_buff. Unlike most other operations you _MUST_
452 * be careful with this one. A peek leaves the buffer on the
453 * list and someone else may run off with it. You must hold
454 * the appropriate locks or have a private queue to do this.
456 * Returns %NULL for an empty list or a pointer to the head element.
457 * The reference count is not incremented and the reference is therefore
458 * volatile. Use with caution.
460 static inline struct sk_buff *skb_peek(struct sk_buff_head *list_)
462 struct sk_buff *list = ((struct sk_buff *)list_)->next;
463 if (list == (struct sk_buff *)list_)
470 * @list_: list to peek at
472 * Peek an &sk_buff. Unlike most other operations you _MUST_
473 * be careful with this one. A peek leaves the buffer on the
474 * list and someone else may run off with it. You must hold
475 * the appropriate locks or have a private queue to do this.
477 * Returns %NULL for an empty list or a pointer to the tail element.
478 * The reference count is not incremented and the reference is therefore
479 * volatile. Use with caution.
481 static inline struct sk_buff *skb_peek_tail(struct sk_buff_head *list_)
483 struct sk_buff *list = ((struct sk_buff *)list_)->prev;
484 if (list == (struct sk_buff *)list_)
490 * skb_queue_len - get queue length
491 * @list_: list to measure
493 * Return the length of an &sk_buff queue.
495 static inline __u32 skb_queue_len(const struct sk_buff_head *list_)
500 static inline void skb_queue_head_init(struct sk_buff_head *list)
502 spin_lock_init(&list->lock);
503 list->prev = list->next = (struct sk_buff *)list;
508 * Insert an sk_buff at the start of a list.
510 * The "__skb_xxxx()" functions are the non-atomic ones that
511 * can only be called with interrupts disabled.
515 * __skb_queue_head - queue a buffer at the list head
517 * @newsk: buffer to queue
519 * Queue a buffer at the start of a list. This function takes no locks
520 * and you must therefore hold required locks before calling it.
522 * A buffer cannot be placed on two lists at the same time.
524 extern void skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk);
525 static inline void __skb_queue_head(struct sk_buff_head *list,
526 struct sk_buff *newsk)
528 struct sk_buff *prev, *next;
532 prev = (struct sk_buff *)list;
536 next->prev = prev->next = newsk;
540 * __skb_queue_tail - queue a buffer at the list tail
542 * @newsk: buffer to queue
544 * Queue a buffer at the end of a list. This function takes no locks
545 * and you must therefore hold required locks before calling it.
547 * A buffer cannot be placed on two lists at the same time.
549 extern void skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk);
550 static inline void __skb_queue_tail(struct sk_buff_head *list,
551 struct sk_buff *newsk)
553 struct sk_buff *prev, *next;
557 next = (struct sk_buff *)list;
561 next->prev = prev->next = newsk;
566 * __skb_dequeue - remove from the head of the queue
567 * @list: list to dequeue from
569 * Remove the head of the list. This function does not take any locks
570 * so must be used with appropriate locks held only. The head item is
571 * returned or %NULL if the list is empty.
573 extern struct sk_buff *skb_dequeue(struct sk_buff_head *list);
574 static inline struct sk_buff *__skb_dequeue(struct sk_buff_head *list)
576 struct sk_buff *next, *prev, *result;
578 prev = (struct sk_buff *) list;
587 result->next = result->prev = NULL;
595 * Insert a packet on a list.
597 extern void skb_insert(struct sk_buff *old, struct sk_buff *newsk);
598 static inline void __skb_insert(struct sk_buff *newsk,
599 struct sk_buff *prev, struct sk_buff *next,
600 struct sk_buff_head *list)
604 next->prev = prev->next = newsk;
610 * Place a packet after a given packet in a list.
612 extern void skb_append(struct sk_buff *old, struct sk_buff *newsk);
613 static inline void __skb_append(struct sk_buff *old, struct sk_buff *newsk)
615 __skb_insert(newsk, old, old->next, old->list);
619 * remove sk_buff from list. _Must_ be called atomically, and with
622 extern void skb_unlink(struct sk_buff *skb);
623 static inline void __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list)
625 struct sk_buff *next, *prev;
630 skb->next = skb->prev = NULL;
637 /* XXX: more streamlined implementation */
640 * __skb_dequeue_tail - remove from the tail of the queue
641 * @list: list to dequeue from
643 * Remove the tail of the list. This function does not take any locks
644 * so must be used with appropriate locks held only. The tail item is
645 * returned or %NULL if the list is empty.
647 extern struct sk_buff *skb_dequeue_tail(struct sk_buff_head *list);
648 static inline struct sk_buff *__skb_dequeue_tail(struct sk_buff_head *list)
650 struct sk_buff *skb = skb_peek_tail(list);
652 __skb_unlink(skb, list);
657 static inline int skb_is_nonlinear(const struct sk_buff *skb)
659 return skb->data_len;
662 static inline unsigned int skb_headlen(const struct sk_buff *skb)
664 return skb->len - skb->data_len;
667 static inline int skb_pagelen(const struct sk_buff *skb)
671 for (i = (int)skb_shinfo(skb)->nr_frags - 1; i >= 0; i--)
672 len += skb_shinfo(skb)->frags[i].size;
673 return len + skb_headlen(skb);
676 static inline void skb_fill_page_desc(struct sk_buff *skb, int i,
677 struct page *page, int off, int size)
679 skb_frag_t *frag = &skb_shinfo(skb)->frags[i];
682 frag->page_offset = off;
684 skb_shinfo(skb)->nr_frags = i + 1;
687 #define SKB_PAGE_ASSERT(skb) BUG_ON(skb_shinfo(skb)->nr_frags)
688 #define SKB_FRAG_ASSERT(skb) BUG_ON(skb_shinfo(skb)->frag_list)
689 #define SKB_LINEAR_ASSERT(skb) BUG_ON(skb_is_nonlinear(skb))
692 * Add data to an sk_buff
694 static inline unsigned char *__skb_put(struct sk_buff *skb, unsigned int len)
696 unsigned char *tmp = skb->tail;
697 SKB_LINEAR_ASSERT(skb);
704 * skb_put - add data to a buffer
705 * @skb: buffer to use
706 * @len: amount of data to add
708 * This function extends the used data area of the buffer. If this would
709 * exceed the total buffer size the kernel will panic. A pointer to the
710 * first byte of the extra data is returned.
712 static inline unsigned char *skb_put(struct sk_buff *skb, unsigned int len)
714 unsigned char *tmp = skb->tail;
715 SKB_LINEAR_ASSERT(skb);
718 if (unlikely(skb->tail>skb->end))
719 skb_over_panic(skb, len, current_text_addr());
723 static inline unsigned char *__skb_push(struct sk_buff *skb, unsigned int len)
731 * skb_push - add data to the start of a buffer
732 * @skb: buffer to use
733 * @len: amount of data to add
735 * This function extends the used data area of the buffer at the buffer
736 * start. If this would exceed the total buffer headroom the kernel will
737 * panic. A pointer to the first byte of the extra data is returned.
739 static inline unsigned char *skb_push(struct sk_buff *skb, unsigned int len)
743 if (unlikely(skb->data<skb->head))
744 skb_under_panic(skb, len, current_text_addr());
748 static inline unsigned char *__skb_pull(struct sk_buff *skb, unsigned int len)
751 BUG_ON(skb->len < skb->data_len);
752 return skb->data += len;
756 * skb_pull - remove data from the start of a buffer
757 * @skb: buffer to use
758 * @len: amount of data to remove
760 * This function removes data from the start of a buffer, returning
761 * the memory to the headroom. A pointer to the next data in the buffer
762 * is returned. Once the data has been pulled future pushes will overwrite
765 static inline unsigned char *skb_pull(struct sk_buff *skb, unsigned int len)
767 return unlikely(len > skb->len) ? NULL : __skb_pull(skb, len);
770 extern unsigned char *__pskb_pull_tail(struct sk_buff *skb, int delta);
772 static inline unsigned char *__pskb_pull(struct sk_buff *skb, unsigned int len)
774 if (len > skb_headlen(skb) &&
775 !__pskb_pull_tail(skb, len-skb_headlen(skb)))
778 return skb->data += len;
781 static inline unsigned char *pskb_pull(struct sk_buff *skb, unsigned int len)
783 return unlikely(len > skb->len) ? NULL : __pskb_pull(skb, len);
786 static inline int pskb_may_pull(struct sk_buff *skb, unsigned int len)
788 if (likely(len <= skb_headlen(skb)))
790 if (unlikely(len > skb->len))
792 return __pskb_pull_tail(skb, len-skb_headlen(skb)) != NULL;
796 * skb_headroom - bytes at buffer head
797 * @skb: buffer to check
799 * Return the number of bytes of free space at the head of an &sk_buff.
801 static inline int skb_headroom(const struct sk_buff *skb)
803 return skb->data - skb->head;
807 * skb_tailroom - bytes at buffer end
808 * @skb: buffer to check
810 * Return the number of bytes of free space at the tail of an sk_buff
812 static inline int skb_tailroom(const struct sk_buff *skb)
814 return skb_is_nonlinear(skb) ? 0 : skb->end - skb->tail;
818 * skb_reserve - adjust headroom
819 * @skb: buffer to alter
820 * @len: bytes to move
822 * Increase the headroom of an empty &sk_buff by reducing the tail
823 * room. This is only allowed for an empty buffer.
825 static inline void skb_reserve(struct sk_buff *skb, unsigned int len)
832 * CPUs often take a performance hit when accessing unaligned memory
833 * locations. The actual performance hit varies, it can be small if the
834 * hardware handles it or large if we have to take an exception and fix it
837 * Since an ethernet header is 14 bytes network drivers often end up with
838 * the IP header at an unaligned offset. The IP header can be aligned by
839 * shifting the start of the packet by 2 bytes. Drivers should do this
842 * skb_reserve(NET_IP_ALIGN);
844 * The downside to this alignment of the IP header is that the DMA is now
845 * unaligned. On some architectures the cost of an unaligned DMA is high
846 * and this cost outweighs the gains made by aligning the IP header.
848 * Since this trade off varies between architectures, we allow NET_IP_ALIGN
852 #define NET_IP_ALIGN 2
855 extern int ___pskb_trim(struct sk_buff *skb, unsigned int len, int realloc);
857 static inline void __skb_trim(struct sk_buff *skb, unsigned int len)
859 if (!skb->data_len) {
861 skb->tail = skb->data + len;
863 ___pskb_trim(skb, len, 0);
867 * skb_trim - remove end from a buffer
868 * @skb: buffer to alter
871 * Cut the length of a buffer down by removing data from the tail. If
872 * the buffer is already under the length specified it is not modified.
874 static inline void skb_trim(struct sk_buff *skb, unsigned int len)
877 __skb_trim(skb, len);
881 static inline int __pskb_trim(struct sk_buff *skb, unsigned int len)
883 if (!skb->data_len) {
885 skb->tail = skb->data+len;
888 return ___pskb_trim(skb, len, 1);
891 static inline int pskb_trim(struct sk_buff *skb, unsigned int len)
893 return (len < skb->len) ? __pskb_trim(skb, len) : 0;
897 * skb_orphan - orphan a buffer
898 * @skb: buffer to orphan
900 * If a buffer currently has an owner then we call the owner's
901 * destructor function and make the @skb unowned. The buffer continues
902 * to exist but is no longer charged to its former owner.
904 static inline void skb_orphan(struct sk_buff *skb)
907 skb->destructor(skb);
908 skb->destructor = NULL;
913 * __skb_queue_purge - empty a list
914 * @list: list to empty
916 * Delete all buffers on an &sk_buff list. Each buffer is removed from
917 * the list and one reference dropped. This function does not take the
918 * list lock and the caller must hold the relevant locks to use it.
920 extern void skb_queue_purge(struct sk_buff_head *list);
921 static inline void __skb_queue_purge(struct sk_buff_head *list)
924 while ((skb = __skb_dequeue(list)) != NULL)
929 * __dev_alloc_skb - allocate an skbuff for sending
930 * @length: length to allocate
931 * @gfp_mask: get_free_pages mask, passed to alloc_skb
933 * Allocate a new &sk_buff and assign it a usage count of one. The
934 * buffer has unspecified headroom built in. Users should allocate
935 * the headroom they think they need without accounting for the
936 * built in space. The built in space is used for optimisations.
938 * %NULL is returned in there is no free memory.
940 static inline struct sk_buff *__dev_alloc_skb(unsigned int length,
943 struct sk_buff *skb = alloc_skb(length + 16, gfp_mask);
945 skb_reserve(skb, 16);
950 * dev_alloc_skb - allocate an skbuff for sending
951 * @length: length to allocate
953 * Allocate a new &sk_buff and assign it a usage count of one. The
954 * buffer has unspecified headroom built in. Users should allocate
955 * the headroom they think they need without accounting for the
956 * built in space. The built in space is used for optimisations.
958 * %NULL is returned in there is no free memory. Although this function
959 * allocates memory it can be called from an interrupt.
961 static inline struct sk_buff *dev_alloc_skb(unsigned int length)
963 return __dev_alloc_skb(length, GFP_ATOMIC);
967 * skb_cow - copy header of skb when it is required
968 * @skb: buffer to cow
969 * @headroom: needed headroom
971 * If the skb passed lacks sufficient headroom or its data part
972 * is shared, data is reallocated. If reallocation fails, an error
973 * is returned and original skb is not changed.
975 * The result is skb with writable area skb->head...skb->tail
976 * and at least @headroom of space at head.
978 static inline int skb_cow(struct sk_buff *skb, unsigned int headroom)
980 int delta = (headroom > 16 ? headroom : 16) - skb_headroom(skb);
985 if (delta || skb_cloned(skb))
986 return pskb_expand_head(skb, (delta + 15) & ~15, 0, GFP_ATOMIC);
991 * skb_padto - pad an skbuff up to a minimal size
992 * @skb: buffer to pad
993 * @len: minimal length
995 * Pads up a buffer to ensure the trailing bytes exist and are
996 * blanked. If the buffer already contains sufficient data it
997 * is untouched. Returns the buffer, which may be a replacement
998 * for the original, or NULL for out of memory - in which case
999 * the original buffer is still freed.
1002 static inline struct sk_buff *skb_padto(struct sk_buff *skb, unsigned int len)
1004 unsigned int size = skb->len;
1005 if (likely(size >= len))
1007 return skb_pad(skb, len-size);
1010 static inline int skb_add_data(struct sk_buff *skb,
1011 char __user *from, int copy)
1013 const int off = skb->len;
1015 if (skb->ip_summed == CHECKSUM_NONE) {
1017 unsigned int csum = csum_and_copy_from_user(from,
1021 skb->csum = csum_block_add(skb->csum, csum, off);
1024 } else if (!copy_from_user(skb_put(skb, copy), from, copy))
1027 __skb_trim(skb, off);
1031 static inline int skb_can_coalesce(struct sk_buff *skb, int i,
1032 struct page *page, int off)
1035 struct skb_frag_struct *frag = &skb_shinfo(skb)->frags[i - 1];
1037 return page == frag->page &&
1038 off == frag->page_offset + frag->size;
1044 * skb_linearize - convert paged skb to linear one
1045 * @skb: buffer to linarize
1046 * @gfp: allocation mode
1048 * If there is no free memory -ENOMEM is returned, otherwise zero
1049 * is returned and the old skb data released.
1051 extern int __skb_linearize(struct sk_buff *skb, int gfp);
1052 static inline int skb_linearize(struct sk_buff *skb, int gfp)
1054 return __skb_linearize(skb, gfp);
1057 static inline void *kmap_skb_frag(const skb_frag_t *frag)
1059 #ifdef CONFIG_HIGHMEM
1064 return kmap_atomic(frag->page, KM_SKB_DATA_SOFTIRQ);
1067 static inline void kunmap_skb_frag(void *vaddr)
1069 kunmap_atomic(vaddr, KM_SKB_DATA_SOFTIRQ);
1070 #ifdef CONFIG_HIGHMEM
1075 #define skb_queue_walk(queue, skb) \
1076 for (skb = (queue)->next, prefetch(skb->next); \
1077 (skb != (struct sk_buff *)(queue)); \
1078 skb = skb->next, prefetch(skb->next))
1081 extern struct sk_buff *skb_recv_datagram(struct sock *sk, unsigned flags,
1082 int noblock, int *err);
1083 extern unsigned int datagram_poll(struct file *file, struct socket *sock,
1084 struct poll_table_struct *wait);
1085 extern int skb_copy_datagram(const struct sk_buff *from,
1086 int offset, char __user *to, int size);
1087 extern int skb_copy_datagram_iovec(const struct sk_buff *from,
1088 int offset, struct iovec *to,
1090 extern int skb_copy_and_csum_datagram(const struct sk_buff *skb,
1091 int offset, u8 __user *to,
1092 int len, unsigned int *csump);
1093 extern int skb_copy_and_csum_datagram_iovec(const
1094 struct sk_buff *skb,
1097 extern void skb_free_datagram(struct sock *sk, struct sk_buff *skb);
1098 extern unsigned int skb_checksum(const struct sk_buff *skb, int offset,
1099 int len, unsigned int csum);
1100 extern int skb_copy_bits(const struct sk_buff *skb, int offset,
1102 extern unsigned int skb_copy_and_csum_bits(const struct sk_buff *skb,
1103 int offset, u8 *to, int len,
1105 extern void skb_copy_and_csum_dev(const struct sk_buff *skb, u8 *to);
1106 extern void skb_split(struct sk_buff *skb,
1107 struct sk_buff *skb1, const u32 len);
1109 extern void skb_init(void);
1110 extern void skb_add_mtu(int mtu);
1113 /* Iteration functions set these */
1114 unsigned char *data;
1117 /* Private to iteration */
1118 unsigned int nextfrag;
1119 struct sk_buff *fraglist;
1122 /* Keep iterating until skb_iter_next returns false. */
1123 extern void skb_iter_first(const struct sk_buff *skb, struct skb_iter *i);
1124 extern int skb_iter_next(const struct sk_buff *skb, struct skb_iter *i);
1125 /* Call this if aborting loop before !skb_iter_next */
1126 extern void skb_iter_abort(const struct sk_buff *skb, struct skb_iter *i);
1128 struct tux_req_struct;
1130 #ifdef CONFIG_NETFILTER
1131 static inline void nf_conntrack_put(struct nf_ct_info *nfct)
1133 if (nfct && atomic_dec_and_test(&nfct->master->use))
1134 nfct->master->destroy(nfct->master);
1136 static inline void nf_conntrack_get(struct nf_ct_info *nfct)
1139 atomic_inc(&nfct->master->use);
1141 static inline void nf_reset(struct sk_buff *skb)
1143 nf_conntrack_put(skb->nfct);
1145 #ifdef CONFIG_NETFILTER_DEBUG
1150 #ifdef CONFIG_BRIDGE_NETFILTER
1151 static inline void nf_bridge_put(struct nf_bridge_info *nf_bridge)
1153 if (nf_bridge && atomic_dec_and_test(&nf_bridge->use))
1156 static inline void nf_bridge_get(struct nf_bridge_info *nf_bridge)
1159 atomic_inc(&nf_bridge->use);
1161 #endif /* CONFIG_BRIDGE_NETFILTER */
1162 #else /* CONFIG_NETFILTER */
1163 static inline void nf_reset(struct sk_buff *skb) {}
1164 #endif /* CONFIG_NETFILTER */
1166 #endif /* __KERNEL__ */
1167 #endif /* _LINUX_SKBUFF_H */