blob: b89680d2693befc81052e743052f4dbf580c8cb3 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * INET An implementation of the TCP/IP protocol suite for the LINUX
3 * operating system. INET is implemented using the BSD Socket
4 * interface as the means of communication with the user level.
5 *
6 * Definitions for the AF_INET socket handler.
7 *
8 * Version: @(#)sock.h 1.0.4 05/13/93
9 *
Jesper Juhl02c30a82005-05-05 16:16:16 -070010 * Authors: Ross Biro
Linus Torvalds1da177e2005-04-16 15:20:36 -070011 * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
12 * Corey Minyard <wf-rch!minyard@relay.EU.net>
13 * Florian La Roche <flla@stud.uni-sb.de>
14 *
15 * Fixes:
16 * Alan Cox : Volatiles in skbuff pointers. See
17 * skbuff comments. May be overdone,
18 * better to prove they can be removed
19 * than the reverse.
20 * Alan Cox : Added a zapped field for tcp to note
21 * a socket is reset and must stay shut up
22 * Alan Cox : New fields for options
23 * Pauline Middelink : identd support
24 * Alan Cox : Eliminate low level recv/recvfrom
25 * David S. Miller : New socket lookup architecture.
26 * Steve Whitehouse: Default routines for sock_ops
27 * Arnaldo C. Melo : removed net_pinfo, tp_pinfo and made
28 * protinfo be just a void pointer, as the
29 * protocol specific parts were moved to
30 * respective headers and ipv4/v6, etc now
31 * use private slabcaches for its socks
32 * Pedro Hortas : New flags field for socket options
33 *
34 *
35 * This program is free software; you can redistribute it and/or
36 * modify it under the terms of the GNU General Public License
37 * as published by the Free Software Foundation; either version
38 * 2 of the License, or (at your option) any later version.
39 */
40#ifndef _SOCK_H
41#define _SOCK_H
42
Ilpo Järvinen172589c2007-08-28 15:50:33 -070043#include <linux/kernel.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070044#include <linux/list.h>
45#include <linux/timer.h>
46#include <linux/cache.h>
47#include <linux/module.h>
Ingo Molnara5b5bb92006-07-03 00:25:35 -070048#include <linux/lockdep.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070049#include <linux/netdevice.h>
Arnaldo Carvalho de Meloebb53d72007-11-21 22:08:50 +080050#include <linux/pcounter.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070051#include <linux/skbuff.h> /* struct sk_buff */
Al Virod7fe0f22006-12-03 23:15:30 -050052#include <linux/mm.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070053#include <linux/security.h>
54
55#include <linux/filter.h>
56
57#include <asm/atomic.h>
58#include <net/dst.h>
59#include <net/checksum.h>
60
61/*
62 * This structure really needs to be cleaned up.
63 * Most of it is for TCP, and not used by any of
64 * the other protocols.
65 */
66
67/* Define this to get the SOCK_DBG debugging facility. */
68#define SOCK_DEBUGGING
69#ifdef SOCK_DEBUGGING
70#define SOCK_DEBUG(sk, msg...) do { if ((sk) && sock_flag((sk), SOCK_DBG)) \
71 printk(KERN_DEBUG msg); } while (0)
72#else
Stephen Hemminger4cd90292008-03-21 15:54:53 -070073/* Validate arguments and do nothing */
74static void inline int __attribute__ ((format (printf, 2, 3)))
75SOCK_DEBUG(struct sock *sk, const char *msg, ...)
76{
77}
Linus Torvalds1da177e2005-04-16 15:20:36 -070078#endif
79
80/* This is the per-socket lock. The spinlock provides a synchronization
81 * between user contexts and software interrupt processing, whereas the
82 * mini-semaphore synchronizes multiple users amongst themselves.
83 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070084typedef struct {
85 spinlock_t slock;
John Heffnerd2e91172007-09-12 10:44:19 +020086 int owned;
Linus Torvalds1da177e2005-04-16 15:20:36 -070087 wait_queue_head_t wq;
Ingo Molnara5b5bb92006-07-03 00:25:35 -070088 /*
89 * We express the mutex-alike socket_lock semantics
90 * to the lock validator by explicitly managing
91 * the slock as a lock variant (in addition to
92 * the slock itself):
93 */
94#ifdef CONFIG_DEBUG_LOCK_ALLOC
95 struct lockdep_map dep_map;
96#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070097} socket_lock_t;
98
Linus Torvalds1da177e2005-04-16 15:20:36 -070099struct sock;
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700100struct proto;
Denis V. Lunev0eeb8ff2007-12-04 01:15:45 -0800101struct net;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700102
103/**
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700104 * struct sock_common - minimal network layer representation of sockets
105 * @skc_family: network address family
106 * @skc_state: Connection state
107 * @skc_reuse: %SO_REUSEADDR setting
108 * @skc_bound_dev_if: bound device index if != 0
109 * @skc_node: main hash linkage for various protocol lookup tables
110 * @skc_bind_node: bind hash linkage for various protocol lookup tables
111 * @skc_refcnt: reference count
Eric Dumazet81c3d542005-10-03 14:13:38 -0700112 * @skc_hash: hash value used with various protocol lookup tables
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700113 * @skc_prot: protocol handlers inside a network family
Eric W. Biederman07feaeb2007-09-12 11:58:02 +0200114 * @skc_net: reference to the network namespace of this socket
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700115 *
116 * This is the minimal network layer representation of sockets, the header
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700117 * for struct sock and struct inet_timewait_sock.
118 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700119struct sock_common {
120 unsigned short skc_family;
121 volatile unsigned char skc_state;
122 unsigned char skc_reuse;
123 int skc_bound_dev_if;
124 struct hlist_node skc_node;
125 struct hlist_node skc_bind_node;
126 atomic_t skc_refcnt;
Eric Dumazet81c3d542005-10-03 14:13:38 -0700127 unsigned int skc_hash;
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700128 struct proto *skc_prot;
Eric W. Biederman07feaeb2007-09-12 11:58:02 +0200129 struct net *skc_net;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700130};
131
132/**
133 * struct sock - network layer representation of sockets
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700134 * @__sk_common: shared layout with inet_timewait_sock
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700135 * @sk_shutdown: mask of %SEND_SHUTDOWN and/or %RCV_SHUTDOWN
136 * @sk_userlocks: %SO_SNDBUF and %SO_RCVBUF settings
137 * @sk_lock: synchronizer
138 * @sk_rcvbuf: size of receive buffer in bytes
139 * @sk_sleep: sock wait queue
140 * @sk_dst_cache: destination cache
141 * @sk_dst_lock: destination cache lock
142 * @sk_policy: flow policy
143 * @sk_rmem_alloc: receive queue bytes committed
144 * @sk_receive_queue: incoming packets
145 * @sk_wmem_alloc: transmit queue bytes committed
146 * @sk_write_queue: Packet sending queue
Chris Leech97fc2f02006-05-23 17:55:33 -0700147 * @sk_async_wait_queue: DMA copied packets
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700148 * @sk_omem_alloc: "o" is "option" or "other"
149 * @sk_wmem_queued: persistent queue size
150 * @sk_forward_alloc: space allocated forward
151 * @sk_allocation: allocation mode
152 * @sk_sndbuf: size of send buffer in bytes
Wang Chen33c732c2007-11-13 20:30:01 -0800153 * @sk_flags: %SO_LINGER (l_onoff), %SO_BROADCAST, %SO_KEEPALIVE,
154 * %SO_OOBINLINE settings
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700155 * @sk_no_check: %SO_NO_CHECK setting, wether or not checkup packets
156 * @sk_route_caps: route capabilities (e.g. %NETIF_F_TSO)
Herbert Xubcd76112006-06-30 13:36:35 -0700157 * @sk_gso_type: GSO type (e.g. %SKB_GSO_TCPV4)
Peter P Waskiewicz Jr82cc1a72008-03-21 03:43:19 -0700158 * @sk_gso_max_size: Maximum GSO segment size to build
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700159 * @sk_lingertime: %SO_LINGER l_linger setting
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700160 * @sk_backlog: always used with the per-socket spinlock held
161 * @sk_callback_lock: used with the callbacks in the end of this struct
162 * @sk_error_queue: rarely used
Wang Chen33c732c2007-11-13 20:30:01 -0800163 * @sk_prot_creator: sk_prot of original sock creator (see ipv6_setsockopt,
164 * IPV6_ADDRFORM for instance)
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700165 * @sk_err: last error
Wang Chen33c732c2007-11-13 20:30:01 -0800166 * @sk_err_soft: errors that don't cause failure but are the cause of a
167 * persistent failure not just 'timed out'
168 * @sk_drops: raw drops counter
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700169 * @sk_ack_backlog: current listen backlog
170 * @sk_max_ack_backlog: listen backlog set in listen()
171 * @sk_priority: %SO_PRIORITY setting
172 * @sk_type: socket type (%SOCK_STREAM, etc)
173 * @sk_protocol: which protocol this socket belongs in this network family
174 * @sk_peercred: %SO_PEERCRED setting
175 * @sk_rcvlowat: %SO_RCVLOWAT setting
176 * @sk_rcvtimeo: %SO_RCVTIMEO setting
177 * @sk_sndtimeo: %SO_SNDTIMEO setting
178 * @sk_filter: socket filtering instructions
179 * @sk_protinfo: private area, net family specific, when not using slab
180 * @sk_timer: sock cleanup timer
181 * @sk_stamp: time stamp of last packet received
182 * @sk_socket: Identd and reporting IO signals
183 * @sk_user_data: RPC layer private data
184 * @sk_sndmsg_page: cached page for sendmsg
185 * @sk_sndmsg_off: cached offset for sendmsg
186 * @sk_send_head: front of stuff to transmit
Martin Waitz67be2dd2005-05-01 08:59:26 -0700187 * @sk_security: used by security modules
Randy Dunlap31729362008-02-18 20:52:13 -0800188 * @sk_mark: generic packet mark
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700189 * @sk_write_pending: a write to stream socket waits to start
190 * @sk_state_change: callback to indicate change in the state of the sock
191 * @sk_data_ready: callback to indicate there is data to be processed
192 * @sk_write_space: callback to indicate there is bf sending space available
193 * @sk_error_report: callback to indicate errors (e.g. %MSG_ERRQUEUE)
194 * @sk_backlog_rcv: callback to process the backlog
195 * @sk_destruct: called at sock freeing time, i.e. when all refcnt == 0
Linus Torvalds1da177e2005-04-16 15:20:36 -0700196 */
197struct sock {
198 /*
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700199 * Now struct inet_timewait_sock also uses sock_common, so please just
Linus Torvalds1da177e2005-04-16 15:20:36 -0700200 * don't add nothing before this first member (__sk_common) --acme
201 */
202 struct sock_common __sk_common;
203#define sk_family __sk_common.skc_family
204#define sk_state __sk_common.skc_state
205#define sk_reuse __sk_common.skc_reuse
206#define sk_bound_dev_if __sk_common.skc_bound_dev_if
207#define sk_node __sk_common.skc_node
208#define sk_bind_node __sk_common.skc_bind_node
209#define sk_refcnt __sk_common.skc_refcnt
Eric Dumazet81c3d542005-10-03 14:13:38 -0700210#define sk_hash __sk_common.skc_hash
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700211#define sk_prot __sk_common.skc_prot
Eric W. Biederman07feaeb2007-09-12 11:58:02 +0200212#define sk_net __sk_common.skc_net
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213 unsigned char sk_shutdown : 2,
214 sk_no_check : 2,
215 sk_userlocks : 4;
216 unsigned char sk_protocol;
217 unsigned short sk_type;
218 int sk_rcvbuf;
219 socket_lock_t sk_lock;
Eric Dumazetfa438cc2007-03-04 16:05:44 -0800220 /*
221 * The backlog queue is special, it is always used with
222 * the per-socket spinlock held and requires low latency
223 * access. Therefore we special case it's implementation.
224 */
225 struct {
226 struct sk_buff *head;
227 struct sk_buff *tail;
228 } sk_backlog;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700229 wait_queue_head_t *sk_sleep;
230 struct dst_entry *sk_dst_cache;
231 struct xfrm_policy *sk_policy[2];
232 rwlock_t sk_dst_lock;
233 atomic_t sk_rmem_alloc;
234 atomic_t sk_wmem_alloc;
235 atomic_t sk_omem_alloc;
Arnaldo Carvalho de Melo4e07a912007-05-29 13:17:47 -0700236 int sk_sndbuf;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700237 struct sk_buff_head sk_receive_queue;
238 struct sk_buff_head sk_write_queue;
Chris Leech97fc2f02006-05-23 17:55:33 -0700239 struct sk_buff_head sk_async_wait_queue;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700240 int sk_wmem_queued;
241 int sk_forward_alloc;
Al Viro7d877f32005-10-21 03:20:43 -0400242 gfp_t sk_allocation;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700243 int sk_route_caps;
Herbert Xubcd76112006-06-30 13:36:35 -0700244 int sk_gso_type;
Peter P Waskiewicz Jr82cc1a72008-03-21 03:43:19 -0700245 unsigned int sk_gso_max_size;
David S. Miller9932cf92006-03-24 15:12:37 -0800246 int sk_rcvlowat;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247 unsigned long sk_flags;
248 unsigned long sk_lingertime;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249 struct sk_buff_head sk_error_queue;
Arnaldo Carvalho de Melo476e19c2005-05-05 13:35:15 -0700250 struct proto *sk_prot_creator;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700251 rwlock_t sk_callback_lock;
252 int sk_err,
253 sk_err_soft;
Wang Chen33c732c2007-11-13 20:30:01 -0800254 atomic_t sk_drops;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700255 unsigned short sk_ack_backlog;
256 unsigned short sk_max_ack_backlog;
257 __u32 sk_priority;
258 struct ucred sk_peercred;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259 long sk_rcvtimeo;
260 long sk_sndtimeo;
261 struct sk_filter *sk_filter;
262 void *sk_protinfo;
263 struct timer_list sk_timer;
Eric Dumazetb7aa0bf2007-04-19 16:16:32 -0700264 ktime_t sk_stamp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700265 struct socket *sk_socket;
266 void *sk_user_data;
267 struct page *sk_sndmsg_page;
268 struct sk_buff *sk_send_head;
269 __u32 sk_sndmsg_off;
270 int sk_write_pending;
271 void *sk_security;
Laszlo Attila Toth4a19ec52008-01-30 19:08:16 -0800272 __u32 sk_mark;
273 /* XXX 4 bytes hole on 64 bit */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274 void (*sk_state_change)(struct sock *sk);
275 void (*sk_data_ready)(struct sock *sk, int bytes);
276 void (*sk_write_space)(struct sock *sk);
277 void (*sk_error_report)(struct sock *sk);
278 int (*sk_backlog_rcv)(struct sock *sk,
279 struct sk_buff *skb);
280 void (*sk_destruct)(struct sock *sk);
281};
282
283/*
284 * Hashed lists helper routines
285 */
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700286static inline struct sock *__sk_head(const struct hlist_head *head)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700287{
288 return hlist_entry(head->first, struct sock, sk_node);
289}
290
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700291static inline struct sock *sk_head(const struct hlist_head *head)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700292{
293 return hlist_empty(head) ? NULL : __sk_head(head);
294}
295
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700296static inline struct sock *sk_next(const struct sock *sk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700297{
298 return sk->sk_node.next ?
299 hlist_entry(sk->sk_node.next, struct sock, sk_node) : NULL;
300}
301
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700302static inline int sk_unhashed(const struct sock *sk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700303{
304 return hlist_unhashed(&sk->sk_node);
305}
306
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700307static inline int sk_hashed(const struct sock *sk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700308{
Akinobu Mitada753be2006-04-28 15:21:23 -0700309 return !sk_unhashed(sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310}
311
312static __inline__ void sk_node_init(struct hlist_node *node)
313{
314 node->pprev = NULL;
315}
316
317static __inline__ void __sk_del_node(struct sock *sk)
318{
319 __hlist_del(&sk->sk_node);
320}
321
322static __inline__ int __sk_del_node_init(struct sock *sk)
323{
324 if (sk_hashed(sk)) {
325 __sk_del_node(sk);
326 sk_node_init(&sk->sk_node);
327 return 1;
328 }
329 return 0;
330}
331
332/* Grab socket reference count. This operation is valid only
333 when sk is ALREADY grabbed f.e. it is found in hash table
334 or a list and the lookup is made under lock preventing hash table
335 modifications.
336 */
337
338static inline void sock_hold(struct sock *sk)
339{
340 atomic_inc(&sk->sk_refcnt);
341}
342
343/* Ungrab socket in the context, which assumes that socket refcnt
344 cannot hit zero, f.e. it is true in context of any socketcall.
345 */
346static inline void __sock_put(struct sock *sk)
347{
348 atomic_dec(&sk->sk_refcnt);
349}
350
351static __inline__ int sk_del_node_init(struct sock *sk)
352{
353 int rc = __sk_del_node_init(sk);
354
355 if (rc) {
356 /* paranoid for a while -acme */
357 WARN_ON(atomic_read(&sk->sk_refcnt) == 1);
358 __sock_put(sk);
359 }
360 return rc;
361}
362
363static __inline__ void __sk_add_node(struct sock *sk, struct hlist_head *list)
364{
365 hlist_add_head(&sk->sk_node, list);
366}
367
368static __inline__ void sk_add_node(struct sock *sk, struct hlist_head *list)
369{
370 sock_hold(sk);
371 __sk_add_node(sk, list);
372}
373
374static __inline__ void __sk_del_bind_node(struct sock *sk)
375{
376 __hlist_del(&sk->sk_bind_node);
377}
378
379static __inline__ void sk_add_bind_node(struct sock *sk,
380 struct hlist_head *list)
381{
382 hlist_add_head(&sk->sk_bind_node, list);
383}
384
385#define sk_for_each(__sk, node, list) \
386 hlist_for_each_entry(__sk, node, list, sk_node)
387#define sk_for_each_from(__sk, node) \
388 if (__sk && ({ node = &(__sk)->sk_node; 1; })) \
389 hlist_for_each_entry_from(__sk, node, sk_node)
390#define sk_for_each_continue(__sk, node) \
391 if (__sk && ({ node = &(__sk)->sk_node; 1; })) \
392 hlist_for_each_entry_continue(__sk, node, sk_node)
393#define sk_for_each_safe(__sk, node, tmp, list) \
394 hlist_for_each_entry_safe(__sk, node, tmp, list, sk_node)
395#define sk_for_each_bound(__sk, node, list) \
396 hlist_for_each_entry(__sk, node, list, sk_bind_node)
397
398/* Sock flags */
399enum sock_flags {
400 SOCK_DEAD,
401 SOCK_DONE,
402 SOCK_URGINLINE,
403 SOCK_KEEPOPEN,
404 SOCK_LINGER,
405 SOCK_DESTROY,
406 SOCK_BROADCAST,
407 SOCK_TIMESTAMP,
408 SOCK_ZAPPED,
409 SOCK_USE_WRITE_QUEUE, /* whether to call sk->sk_write_space in sock_wfree */
410 SOCK_DBG, /* %SO_DEBUG setting */
411 SOCK_RCVTSTAMP, /* %SO_TIMESTAMP setting */
Eric Dumazet92f37fd2007-03-25 22:14:49 -0700412 SOCK_RCVTSTAMPNS, /* %SO_TIMESTAMPNS setting */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700413 SOCK_LOCALROUTE, /* route locally only, %SO_DONTROUTE setting */
414 SOCK_QUEUE_SHRUNK, /* write queue has been shrunk recently */
415};
416
Ralf Baechle53b924b2005-08-23 10:11:30 -0700417static inline void sock_copy_flags(struct sock *nsk, struct sock *osk)
418{
419 nsk->sk_flags = osk->sk_flags;
420}
421
Linus Torvalds1da177e2005-04-16 15:20:36 -0700422static inline void sock_set_flag(struct sock *sk, enum sock_flags flag)
423{
424 __set_bit(flag, &sk->sk_flags);
425}
426
427static inline void sock_reset_flag(struct sock *sk, enum sock_flags flag)
428{
429 __clear_bit(flag, &sk->sk_flags);
430}
431
432static inline int sock_flag(struct sock *sk, enum sock_flags flag)
433{
434 return test_bit(flag, &sk->sk_flags);
435}
436
437static inline void sk_acceptq_removed(struct sock *sk)
438{
439 sk->sk_ack_backlog--;
440}
441
442static inline void sk_acceptq_added(struct sock *sk)
443{
444 sk->sk_ack_backlog++;
445}
446
447static inline int sk_acceptq_is_full(struct sock *sk)
448{
David S. Miller64a14652007-03-06 11:21:05 -0800449 return sk->sk_ack_backlog > sk->sk_max_ack_backlog;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700450}
451
452/*
453 * Compute minimal free write space needed to queue new packets.
454 */
455static inline int sk_stream_min_wspace(struct sock *sk)
456{
Eric Dumazet8df09ea2007-12-21 03:07:41 -0800457 return sk->sk_wmem_queued >> 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700458}
459
460static inline int sk_stream_wspace(struct sock *sk)
461{
462 return sk->sk_sndbuf - sk->sk_wmem_queued;
463}
464
465extern void sk_stream_write_space(struct sock *sk);
466
467static inline int sk_stream_memory_free(struct sock *sk)
468{
469 return sk->sk_wmem_queued < sk->sk_sndbuf;
470}
471
Linus Torvalds1da177e2005-04-16 15:20:36 -0700472/* The per-socket spinlock must be held here. */
Stephen Hemminger9ee6b532005-11-08 09:39:42 -0800473static inline void sk_add_backlog(struct sock *sk, struct sk_buff *skb)
474{
475 if (!sk->sk_backlog.tail) {
476 sk->sk_backlog.head = sk->sk_backlog.tail = skb;
477 } else {
478 sk->sk_backlog.tail->next = skb;
479 sk->sk_backlog.tail = skb;
480 }
481 skb->next = NULL;
482}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700483
Stephen Hemmingercfcabdc2007-10-09 01:59:42 -0700484#define sk_wait_event(__sk, __timeo, __condition) \
485 ({ int __rc; \
486 release_sock(__sk); \
487 __rc = __condition; \
488 if (!__rc) { \
489 *(__timeo) = schedule_timeout(*(__timeo)); \
490 } \
491 lock_sock(__sk); \
492 __rc = __condition; \
493 __rc; \
494 })
Linus Torvalds1da177e2005-04-16 15:20:36 -0700495
496extern int sk_stream_wait_connect(struct sock *sk, long *timeo_p);
497extern int sk_stream_wait_memory(struct sock *sk, long *timeo_p);
498extern void sk_stream_wait_close(struct sock *sk, long timeo_p);
499extern int sk_stream_error(struct sock *sk, int flags, int err);
500extern void sk_stream_kill_queues(struct sock *sk);
501
502extern int sk_wait_data(struct sock *sk, long *timeo);
503
Arnaldo Carvalho de Melo60236fd2005-06-18 22:47:21 -0700504struct request_sock_ops;
Arnaldo Carvalho de Melo6d6ee432005-12-13 23:25:19 -0800505struct timewait_sock_ops;
Arnaldo Carvalho de Meloab1e0a12008-02-03 04:06:04 -0800506struct inet_hashinfo;
Arnaldo Carvalho de Melo2e6599c2005-06-18 22:46:52 -0700507
Linus Torvalds1da177e2005-04-16 15:20:36 -0700508/* Networking protocol blocks we attach to sockets.
509 * socket layer -> transport layer interface
510 * transport -> network interface is defined by struct inet_proto
511 */
512struct proto {
513 void (*close)(struct sock *sk,
514 long timeout);
515 int (*connect)(struct sock *sk,
516 struct sockaddr *uaddr,
517 int addr_len);
518 int (*disconnect)(struct sock *sk, int flags);
519
520 struct sock * (*accept) (struct sock *sk, int flags, int *err);
521
522 int (*ioctl)(struct sock *sk, int cmd,
523 unsigned long arg);
524 int (*init)(struct sock *sk);
525 int (*destroy)(struct sock *sk);
526 void (*shutdown)(struct sock *sk, int how);
527 int (*setsockopt)(struct sock *sk, int level,
528 int optname, char __user *optval,
529 int optlen);
530 int (*getsockopt)(struct sock *sk, int level,
531 int optname, char __user *optval,
532 int __user *option);
Dmitry Mishin3fdadf72006-03-20 22:45:21 -0800533 int (*compat_setsockopt)(struct sock *sk,
534 int level,
535 int optname, char __user *optval,
536 int optlen);
537 int (*compat_getsockopt)(struct sock *sk,
538 int level,
539 int optname, char __user *optval,
540 int __user *option);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700541 int (*sendmsg)(struct kiocb *iocb, struct sock *sk,
542 struct msghdr *msg, size_t len);
543 int (*recvmsg)(struct kiocb *iocb, struct sock *sk,
544 struct msghdr *msg,
545 size_t len, int noblock, int flags,
546 int *addr_len);
547 int (*sendpage)(struct sock *sk, struct page *page,
548 int offset, size_t size, int flags);
549 int (*bind)(struct sock *sk,
550 struct sockaddr *uaddr, int addr_len);
551
552 int (*backlog_rcv) (struct sock *sk,
553 struct sk_buff *skb);
554
555 /* Keeping track of sk's, looking them up, and port selection methods. */
556 void (*hash)(struct sock *sk);
557 void (*unhash)(struct sock *sk);
558 int (*get_port)(struct sock *sk, unsigned short snum);
559
Eric Dumazet286ab3d2007-11-05 23:38:39 -0800560 /* Keeping track of sockets in use */
Eric Dumazet65f76512008-01-03 20:46:48 -0800561#ifdef CONFIG_PROC_FS
Arnaldo Carvalho de Meloebb53d72007-11-21 22:08:50 +0800562 struct pcounter inuse;
Eric Dumazet65f76512008-01-03 20:46:48 -0800563#endif
Arnaldo Carvalho de Meloebb53d72007-11-21 22:08:50 +0800564
Linus Torvalds1da177e2005-04-16 15:20:36 -0700565 /* Memory pressure */
566 void (*enter_memory_pressure)(void);
567 atomic_t *memory_allocated; /* Current allocated memory. */
568 atomic_t *sockets_allocated; /* Current number of sockets. */
569 /*
570 * Pressure flag: try to collapse.
571 * Technical note: it is used by multiple contexts non atomically.
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800572 * All the __sk_mem_schedule() is of this nature: accounting
Linus Torvalds1da177e2005-04-16 15:20:36 -0700573 * is strict, actions are advisory and have some latency.
574 */
575 int *memory_pressure;
576 int *sysctl_mem;
577 int *sysctl_wmem;
578 int *sysctl_rmem;
579 int max_header;
580
Christoph Lametere18b8902006-12-06 20:33:20 -0800581 struct kmem_cache *slab;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700582 unsigned int obj_size;
583
Arnaldo Carvalho de Melo0a5578c2005-08-09 20:11:41 -0700584 atomic_t *orphan_count;
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700585
Arnaldo Carvalho de Melo60236fd2005-06-18 22:47:21 -0700586 struct request_sock_ops *rsk_prot;
Arnaldo Carvalho de Melo6d6ee432005-12-13 23:25:19 -0800587 struct timewait_sock_ops *twsk_prot;
Arnaldo Carvalho de Melo2e6599c2005-06-18 22:46:52 -0700588
Arnaldo Carvalho de Meloab1e0a12008-02-03 04:06:04 -0800589 struct inet_hashinfo *hashinfo;
590
Linus Torvalds1da177e2005-04-16 15:20:36 -0700591 struct module *owner;
592
593 char name[32];
594
595 struct list_head node;
Arnaldo Carvalho de Meloe6848972005-08-09 19:45:38 -0700596#ifdef SOCK_REFCNT_DEBUG
597 atomic_t socks;
598#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700599};
600
601extern int proto_register(struct proto *prot, int alloc_slab);
602extern void proto_unregister(struct proto *prot);
603
Arnaldo Carvalho de Meloe6848972005-08-09 19:45:38 -0700604#ifdef SOCK_REFCNT_DEBUG
605static inline void sk_refcnt_debug_inc(struct sock *sk)
606{
607 atomic_inc(&sk->sk_prot->socks);
608}
609
610static inline void sk_refcnt_debug_dec(struct sock *sk)
611{
612 atomic_dec(&sk->sk_prot->socks);
613 printk(KERN_DEBUG "%s socket %p released, %d are still alive\n",
614 sk->sk_prot->name, sk, atomic_read(&sk->sk_prot->socks));
615}
616
617static inline void sk_refcnt_debug_release(const struct sock *sk)
618{
619 if (atomic_read(&sk->sk_refcnt) != 1)
620 printk(KERN_DEBUG "Destruction of the %s socket %p delayed, refcnt=%d\n",
621 sk->sk_prot->name, sk, atomic_read(&sk->sk_refcnt));
622}
623#else /* SOCK_REFCNT_DEBUG */
624#define sk_refcnt_debug_inc(sk) do { } while (0)
625#define sk_refcnt_debug_dec(sk) do { } while (0)
626#define sk_refcnt_debug_release(sk) do { } while (0)
627#endif /* SOCK_REFCNT_DEBUG */
628
Eric Dumazet65f76512008-01-03 20:46:48 -0800629
630#ifdef CONFIG_PROC_FS
631# define DEFINE_PROTO_INUSE(NAME) DEFINE_PCOUNTER(NAME)
632# define REF_PROTO_INUSE(NAME) PCOUNTER_MEMBER_INITIALIZER(NAME, .inuse)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700633/* Called with local bh disabled */
Eric Dumazet65f76512008-01-03 20:46:48 -0800634static inline void sock_prot_inuse_add(struct proto *prot, int inc)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700635{
Eric Dumazet65f76512008-01-03 20:46:48 -0800636 pcounter_add(&prot->inuse, inc);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700637}
Eric Dumazet65f76512008-01-03 20:46:48 -0800638static inline int sock_prot_inuse_init(struct proto *proto)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700639{
Eric Dumazet65f76512008-01-03 20:46:48 -0800640 return pcounter_alloc(&proto->inuse);
Eric Dumazet286ab3d2007-11-05 23:38:39 -0800641}
Eric Dumazet65f76512008-01-03 20:46:48 -0800642static inline int sock_prot_inuse_get(struct proto *proto)
Eric Dumazet286ab3d2007-11-05 23:38:39 -0800643{
Arnaldo Carvalho de Meloebb53d72007-11-21 22:08:50 +0800644 return pcounter_getval(&proto->inuse);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700645}
Eric Dumazet65f76512008-01-03 20:46:48 -0800646static inline void sock_prot_inuse_free(struct proto *proto)
647{
648 pcounter_free(&proto->inuse);
649}
650#else
651# define DEFINE_PROTO_INUSE(NAME)
652# define REF_PROTO_INUSE(NAME)
653static void inline sock_prot_inuse_add(struct proto *prot, int inc)
654{
655}
656static int inline sock_prot_inuse_init(struct proto *proto)
657{
658 return 0;
659}
660static void inline sock_prot_inuse_free(struct proto *proto)
661{
662}
663#endif
664
Linus Torvalds1da177e2005-04-16 15:20:36 -0700665
Arnaldo Carvalho de Melo614c6cb2005-08-09 19:47:37 -0700666/* With per-bucket locks this operation is not-atomic, so that
667 * this version is not worse.
668 */
669static inline void __sk_prot_rehash(struct sock *sk)
670{
671 sk->sk_prot->unhash(sk);
672 sk->sk_prot->hash(sk);
673}
674
Linus Torvalds1da177e2005-04-16 15:20:36 -0700675/* About 10 seconds */
676#define SOCK_DESTROY_TIME (10*HZ)
677
678/* Sockets 0-1023 can't be bound to unless you are superuser */
679#define PROT_SOCK 1024
680
681#define SHUTDOWN_MASK 3
682#define RCV_SHUTDOWN 1
683#define SEND_SHUTDOWN 2
684
685#define SOCK_SNDBUF_LOCK 1
686#define SOCK_RCVBUF_LOCK 2
687#define SOCK_BINDADDR_LOCK 4
688#define SOCK_BINDPORT_LOCK 8
689
690/* sock_iocb: used to kick off async processing of socket ios */
691struct sock_iocb {
692 struct list_head list;
693
694 int flags;
695 int size;
696 struct socket *sock;
697 struct sock *sk;
698 struct scm_cookie *scm;
699 struct msghdr *msg, async_msg;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700700 struct kiocb *kiocb;
701};
702
703static inline struct sock_iocb *kiocb_to_siocb(struct kiocb *iocb)
704{
705 return (struct sock_iocb *)iocb->private;
706}
707
708static inline struct kiocb *siocb_to_kiocb(struct sock_iocb *si)
709{
710 return si->kiocb;
711}
712
713struct socket_alloc {
714 struct socket socket;
715 struct inode vfs_inode;
716};
717
718static inline struct socket *SOCKET_I(struct inode *inode)
719{
720 return &container_of(inode, struct socket_alloc, vfs_inode)->socket;
721}
722
723static inline struct inode *SOCK_INODE(struct socket *socket)
724{
725 return &container_of(socket, struct socket_alloc, socket)->vfs_inode;
726}
727
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800728/*
729 * Functions for memory accounting
730 */
731extern int __sk_mem_schedule(struct sock *sk, int size, int kind);
732extern void __sk_mem_reclaim(struct sock *sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700733
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800734#define SK_MEM_QUANTUM ((int)PAGE_SIZE)
735#define SK_MEM_QUANTUM_SHIFT ilog2(SK_MEM_QUANTUM)
736#define SK_MEM_SEND 0
737#define SK_MEM_RECV 1
Linus Torvalds1da177e2005-04-16 15:20:36 -0700738
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800739static inline int sk_mem_pages(int amt)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700740{
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800741 return (amt + SK_MEM_QUANTUM - 1) >> SK_MEM_QUANTUM_SHIFT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700742}
743
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800744static inline int sk_has_account(struct sock *sk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700745{
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800746 /* return true if protocol supports memory accounting */
747 return !!sk->sk_prot->memory_allocated;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700748}
749
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800750static inline int sk_wmem_schedule(struct sock *sk, int size)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700751{
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800752 if (!sk_has_account(sk))
753 return 1;
Herbert Xud80d99d2005-09-01 17:48:23 -0700754 return size <= sk->sk_forward_alloc ||
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800755 __sk_mem_schedule(sk, size, SK_MEM_SEND);
756}
757
758static inline int sk_rmem_schedule(struct sock *sk, int size)
759{
760 if (!sk_has_account(sk))
761 return 1;
762 return size <= sk->sk_forward_alloc ||
763 __sk_mem_schedule(sk, size, SK_MEM_RECV);
764}
765
766static inline void sk_mem_reclaim(struct sock *sk)
767{
768 if (!sk_has_account(sk))
769 return;
770 if (sk->sk_forward_alloc >= SK_MEM_QUANTUM)
771 __sk_mem_reclaim(sk);
772}
773
David S. Miller9993e7d2008-01-10 21:56:38 -0800774static inline void sk_mem_reclaim_partial(struct sock *sk)
775{
776 if (!sk_has_account(sk))
777 return;
778 if (sk->sk_forward_alloc > SK_MEM_QUANTUM)
779 __sk_mem_reclaim(sk);
780}
781
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800782static inline void sk_mem_charge(struct sock *sk, int size)
783{
784 if (!sk_has_account(sk))
785 return;
786 sk->sk_forward_alloc -= size;
787}
788
789static inline void sk_mem_uncharge(struct sock *sk, int size)
790{
791 if (!sk_has_account(sk))
792 return;
793 sk->sk_forward_alloc += size;
794}
795
796static inline void sk_wmem_free_skb(struct sock *sk, struct sk_buff *skb)
797{
798 skb_truesize_check(skb);
799 sock_set_flag(sk, SOCK_QUEUE_SHRUNK);
800 sk->sk_wmem_queued -= skb->truesize;
801 sk_mem_uncharge(sk, skb->truesize);
802 __kfree_skb(skb);
Herbert Xud80d99d2005-09-01 17:48:23 -0700803}
804
Linus Torvalds1da177e2005-04-16 15:20:36 -0700805/* Used by processes to "lock" a socket state, so that
806 * interrupts and bottom half handlers won't change it
807 * from under us. It essentially blocks any incoming
808 * packets, so that we won't get any new data or any
809 * packets that change the state of the socket.
810 *
811 * While locked, BH processing will add new packets to
812 * the backlog queue. This queue is processed by the
813 * owner of the socket lock right before it is released.
814 *
815 * Since ~2.3.5 it is also exclusive sleep lock serializing
816 * accesses from user process context.
817 */
John Heffnerd2e91172007-09-12 10:44:19 +0200818#define sock_owned_by_user(sk) ((sk)->sk_lock.owned)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700819
Peter Zijlstraed075362006-12-06 20:35:24 -0800820/*
821 * Macro so as to not evaluate some arguments when
822 * lockdep is not enabled.
823 *
824 * Mark both the sk_lock and the sk_lock.slock as a
825 * per-address-family lock class.
826 */
827#define sock_lock_init_class_and_name(sk, sname, skey, name, key) \
828do { \
John Heffnerd2e91172007-09-12 10:44:19 +0200829 sk->sk_lock.owned = 0; \
Peter Zijlstraed075362006-12-06 20:35:24 -0800830 init_waitqueue_head(&sk->sk_lock.wq); \
831 spin_lock_init(&(sk)->sk_lock.slock); \
832 debug_check_no_locks_freed((void *)&(sk)->sk_lock, \
833 sizeof((sk)->sk_lock)); \
834 lockdep_set_class_and_name(&(sk)->sk_lock.slock, \
835 (skey), (sname)); \
836 lockdep_init_map(&(sk)->sk_lock.dep_map, (name), (key), 0); \
837} while (0)
838
Harvey Harrison41380932007-12-12 10:46:51 -0800839extern void lock_sock_nested(struct sock *sk, int subclass);
Peter Zijlstrafcc70d52006-11-08 22:44:35 -0800840
841static inline void lock_sock(struct sock *sk)
842{
843 lock_sock_nested(sk, 0);
844}
845
Harvey Harrison41380932007-12-12 10:46:51 -0800846extern void release_sock(struct sock *sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700847
848/* BH context may only use the following locking interface. */
849#define bh_lock_sock(__sk) spin_lock(&((__sk)->sk_lock.slock))
Ingo Molnarc6366182006-07-03 00:25:13 -0700850#define bh_lock_sock_nested(__sk) \
851 spin_lock_nested(&((__sk)->sk_lock.slock), \
852 SINGLE_DEPTH_NESTING)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700853#define bh_unlock_sock(__sk) spin_unlock(&((__sk)->sk_lock.slock))
854
Eric W. Biederman1b8d7ae2007-10-08 23:24:22 -0700855extern struct sock *sk_alloc(struct net *net, int family,
Al Virodd0fc662005-10-07 07:46:04 +0100856 gfp_t priority,
Pavel Emelyanov6257ff22007-11-01 00:39:31 -0700857 struct proto *prot);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700858extern void sk_free(struct sock *sk);
Denis V. Lunevedf02082008-02-29 11:18:32 -0800859extern void sk_release_kernel(struct sock *sk);
Arnaldo Carvalho de Melo87d11ce2005-08-09 20:10:12 -0700860extern struct sock *sk_clone(const struct sock *sk,
Al Virodd0fc662005-10-07 07:46:04 +0100861 const gfp_t priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700862
863extern struct sk_buff *sock_wmalloc(struct sock *sk,
864 unsigned long size, int force,
Al Virodd0fc662005-10-07 07:46:04 +0100865 gfp_t priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700866extern struct sk_buff *sock_rmalloc(struct sock *sk,
867 unsigned long size, int force,
Al Virodd0fc662005-10-07 07:46:04 +0100868 gfp_t priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700869extern void sock_wfree(struct sk_buff *skb);
870extern void sock_rfree(struct sk_buff *skb);
871
872extern int sock_setsockopt(struct socket *sock, int level,
873 int op, char __user *optval,
874 int optlen);
875
876extern int sock_getsockopt(struct socket *sock, int level,
877 int op, char __user *optval,
878 int __user *optlen);
879extern struct sk_buff *sock_alloc_send_skb(struct sock *sk,
880 unsigned long size,
881 int noblock,
882 int *errcode);
Victor Fusco86a76ca2005-07-08 14:57:47 -0700883extern void *sock_kmalloc(struct sock *sk, int size,
Al Virodd0fc662005-10-07 07:46:04 +0100884 gfp_t priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700885extern void sock_kfree_s(struct sock *sk, void *mem, int size);
886extern void sk_send_sigurg(struct sock *sk);
887
888/*
889 * Functions to fill in entries in struct proto_ops when a protocol
890 * does not implement a particular function.
891 */
892extern int sock_no_bind(struct socket *,
893 struct sockaddr *, int);
894extern int sock_no_connect(struct socket *,
895 struct sockaddr *, int, int);
896extern int sock_no_socketpair(struct socket *,
897 struct socket *);
898extern int sock_no_accept(struct socket *,
899 struct socket *, int);
900extern int sock_no_getname(struct socket *,
901 struct sockaddr *, int *, int);
902extern unsigned int sock_no_poll(struct file *, struct socket *,
903 struct poll_table_struct *);
904extern int sock_no_ioctl(struct socket *, unsigned int,
905 unsigned long);
906extern int sock_no_listen(struct socket *, int);
907extern int sock_no_shutdown(struct socket *, int);
908extern int sock_no_getsockopt(struct socket *, int , int,
909 char __user *, int __user *);
910extern int sock_no_setsockopt(struct socket *, int, int,
911 char __user *, int);
912extern int sock_no_sendmsg(struct kiocb *, struct socket *,
913 struct msghdr *, size_t);
914extern int sock_no_recvmsg(struct kiocb *, struct socket *,
915 struct msghdr *, size_t, int);
916extern int sock_no_mmap(struct file *file,
917 struct socket *sock,
918 struct vm_area_struct *vma);
919extern ssize_t sock_no_sendpage(struct socket *sock,
920 struct page *page,
921 int offset, size_t size,
922 int flags);
923
924/*
925 * Functions to fill in entries in struct proto_ops when a protocol
926 * uses the inet style.
927 */
928extern int sock_common_getsockopt(struct socket *sock, int level, int optname,
929 char __user *optval, int __user *optlen);
930extern int sock_common_recvmsg(struct kiocb *iocb, struct socket *sock,
931 struct msghdr *msg, size_t size, int flags);
932extern int sock_common_setsockopt(struct socket *sock, int level, int optname,
933 char __user *optval, int optlen);
Dmitry Mishin3fdadf72006-03-20 22:45:21 -0800934extern int compat_sock_common_getsockopt(struct socket *sock, int level,
935 int optname, char __user *optval, int __user *optlen);
936extern int compat_sock_common_setsockopt(struct socket *sock, int level,
937 int optname, char __user *optval, int optlen);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700938
939extern void sk_common_release(struct sock *sk);
940
941/*
942 * Default socket callbacks and setup code
943 */
944
945/* Initialise core socket variables */
946extern void sock_init_data(struct socket *sock, struct sock *sk);
947
948/**
949 * sk_filter - run a packet through a socket filter
950 * @sk: sock associated with &sk_buff
951 * @skb: buffer to filter
952 * @needlock: set to 1 if the sock is not locked by caller.
953 *
954 * Run the filter code and then cut skb->data to correct size returned by
955 * sk_run_filter. If pkt_len is 0 we toss packet. If skb->len is smaller
956 * than pkt_len we keep whole skb->data. This is the socket level
957 * wrapper to sk_run_filter. It returns 0 if the packet should
958 * be accepted or -EPERM if the packet should be tossed.
959 *
960 */
961
Dmitry Mishinfda9ef52006-08-31 15:28:39 -0700962static inline int sk_filter(struct sock *sk, struct sk_buff *skb)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700963{
964 int err;
Dmitry Mishinfda9ef52006-08-31 15:28:39 -0700965 struct sk_filter *filter;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700966
967 err = security_sock_rcv_skb(sk, skb);
968 if (err)
969 return err;
970
Dmitry Mishinfda9ef52006-08-31 15:28:39 -0700971 rcu_read_lock_bh();
Eric Dumazet9d3e4442008-01-08 23:41:28 -0800972 filter = rcu_dereference(sk->sk_filter);
Dmitry Mishinfda9ef52006-08-31 15:28:39 -0700973 if (filter) {
974 unsigned int pkt_len = sk_run_filter(skb, filter->insns,
975 filter->len);
976 err = pkt_len ? pskb_trim(skb, pkt_len) : -EPERM;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700977 }
Dmitry Mishinfda9ef52006-08-31 15:28:39 -0700978 rcu_read_unlock_bh();
979
Linus Torvalds1da177e2005-04-16 15:20:36 -0700980 return err;
981}
982
983/**
Paul Bonserdc9b3342006-11-23 17:56:13 -0800984 * sk_filter_release: Release a socket filter
985 * @sk: socket
986 * @fp: filter to remove
987 *
988 * Remove a filter from a socket and release its resources.
989 */
990
Pavel Emelyanov309dd5f2007-10-17 21:21:51 -0700991static inline void sk_filter_release(struct sk_filter *fp)
992{
993 if (atomic_dec_and_test(&fp->refcnt))
Pavel Emelyanov47e958e2007-10-17 21:22:42 -0700994 kfree(fp);
Pavel Emelyanov309dd5f2007-10-17 21:21:51 -0700995}
996
997static inline void sk_filter_uncharge(struct sock *sk, struct sk_filter *fp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700998{
999 unsigned int size = sk_filter_len(fp);
1000
1001 atomic_sub(size, &sk->sk_omem_alloc);
Pavel Emelyanov309dd5f2007-10-17 21:21:51 -07001002 sk_filter_release(fp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001003}
1004
1005static inline void sk_filter_charge(struct sock *sk, struct sk_filter *fp)
1006{
1007 atomic_inc(&fp->refcnt);
1008 atomic_add(sk_filter_len(fp), &sk->sk_omem_alloc);
1009}
1010
1011/*
1012 * Socket reference counting postulates.
1013 *
1014 * * Each user of socket SHOULD hold a reference count.
1015 * * Each access point to socket (an hash table bucket, reference from a list,
1016 * running timer, skb in flight MUST hold a reference count.
1017 * * When reference count hits 0, it means it will never increase back.
1018 * * When reference count hits 0, it means that no references from
1019 * outside exist to this socket and current process on current CPU
1020 * is last user and may/should destroy this socket.
1021 * * sk_free is called from any context: process, BH, IRQ. When
1022 * it is called, socket has no references from outside -> sk_free
1023 * may release descendant resources allocated by the socket, but
1024 * to the time when it is called, socket is NOT referenced by any
1025 * hash tables, lists etc.
1026 * * Packets, delivered from outside (from network or from another process)
1027 * and enqueued on receive/error queues SHOULD NOT grab reference count,
1028 * when they sit in queue. Otherwise, packets will leak to hole, when
1029 * socket is looked up by one cpu and unhasing is made by another CPU.
1030 * It is true for udp/raw, netlink (leak to receive and error queues), tcp
1031 * (leak to backlog). Packet socket does all the processing inside
1032 * BR_NETPROTO_LOCK, so that it has not this race condition. UNIX sockets
1033 * use separate SMP lock, so that they are prone too.
1034 */
1035
1036/* Ungrab socket and destroy it, if it was the last reference. */
1037static inline void sock_put(struct sock *sk)
1038{
1039 if (atomic_dec_and_test(&sk->sk_refcnt))
1040 sk_free(sk);
1041}
1042
Arnaldo Carvalho de Melo58a5a7b2006-11-16 14:06:06 -02001043extern int sk_receive_skb(struct sock *sk, struct sk_buff *skb,
1044 const int nested);
Arnaldo Carvalho de Melo25995ff2005-12-27 02:42:22 -02001045
Linus Torvalds1da177e2005-04-16 15:20:36 -07001046/* Detach socket from process context.
1047 * Announce socket dead, detach it from wait queue and inode.
1048 * Note that parent inode held reference count on this struct sock,
1049 * we do not release it in this function, because protocol
1050 * probably wants some additional cleanups or even continuing
1051 * to work with this socket (TCP).
1052 */
1053static inline void sock_orphan(struct sock *sk)
1054{
1055 write_lock_bh(&sk->sk_callback_lock);
1056 sock_set_flag(sk, SOCK_DEAD);
1057 sk->sk_socket = NULL;
1058 sk->sk_sleep = NULL;
1059 write_unlock_bh(&sk->sk_callback_lock);
1060}
1061
1062static inline void sock_graft(struct sock *sk, struct socket *parent)
1063{
1064 write_lock_bh(&sk->sk_callback_lock);
1065 sk->sk_sleep = &parent->wait;
1066 parent->sk = sk;
1067 sk->sk_socket = parent;
Venkat Yekkirala4237c752006-07-24 23:32:50 -07001068 security_sock_graft(sk, parent);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001069 write_unlock_bh(&sk->sk_callback_lock);
1070}
1071
1072extern int sock_i_uid(struct sock *sk);
1073extern unsigned long sock_i_ino(struct sock *sk);
1074
1075static inline struct dst_entry *
1076__sk_dst_get(struct sock *sk)
1077{
1078 return sk->sk_dst_cache;
1079}
1080
1081static inline struct dst_entry *
1082sk_dst_get(struct sock *sk)
1083{
1084 struct dst_entry *dst;
1085
1086 read_lock(&sk->sk_dst_lock);
1087 dst = sk->sk_dst_cache;
1088 if (dst)
1089 dst_hold(dst);
1090 read_unlock(&sk->sk_dst_lock);
1091 return dst;
1092}
1093
1094static inline void
1095__sk_dst_set(struct sock *sk, struct dst_entry *dst)
1096{
1097 struct dst_entry *old_dst;
1098
1099 old_dst = sk->sk_dst_cache;
1100 sk->sk_dst_cache = dst;
1101 dst_release(old_dst);
1102}
1103
1104static inline void
1105sk_dst_set(struct sock *sk, struct dst_entry *dst)
1106{
1107 write_lock(&sk->sk_dst_lock);
1108 __sk_dst_set(sk, dst);
1109 write_unlock(&sk->sk_dst_lock);
1110}
1111
1112static inline void
1113__sk_dst_reset(struct sock *sk)
1114{
1115 struct dst_entry *old_dst;
1116
1117 old_dst = sk->sk_dst_cache;
1118 sk->sk_dst_cache = NULL;
1119 dst_release(old_dst);
1120}
1121
1122static inline void
1123sk_dst_reset(struct sock *sk)
1124{
1125 write_lock(&sk->sk_dst_lock);
1126 __sk_dst_reset(sk);
1127 write_unlock(&sk->sk_dst_lock);
1128}
1129
Denis Vlasenkof0088a52006-03-28 01:08:21 -08001130extern struct dst_entry *__sk_dst_check(struct sock *sk, u32 cookie);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001131
Denis Vlasenkof0088a52006-03-28 01:08:21 -08001132extern struct dst_entry *sk_dst_check(struct sock *sk, u32 cookie);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001133
Herbert Xubcd76112006-06-30 13:36:35 -07001134static inline int sk_can_gso(const struct sock *sk)
1135{
1136 return net_gso_ok(sk->sk_route_caps, sk->sk_gso_type);
1137}
1138
Andi Kleen99580892007-04-20 17:12:43 -07001139extern void sk_setup_caps(struct sock *sk, struct dst_entry *dst);
Arnaldo Carvalho de Melo6cbb0df2005-08-09 19:49:02 -07001140
Linus Torvalds1da177e2005-04-16 15:20:36 -07001141static inline int skb_copy_to_page(struct sock *sk, char __user *from,
1142 struct sk_buff *skb, struct page *page,
1143 int off, int copy)
1144{
1145 if (skb->ip_summed == CHECKSUM_NONE) {
1146 int err = 0;
Al Viro50842052006-11-14 21:36:34 -08001147 __wsum csum = csum_and_copy_from_user(from,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001148 page_address(page) + off,
1149 copy, 0, &err);
1150 if (err)
1151 return err;
1152 skb->csum = csum_block_add(skb->csum, csum, skb->len);
1153 } else if (copy_from_user(page_address(page) + off, from, copy))
1154 return -EFAULT;
1155
1156 skb->len += copy;
1157 skb->data_len += copy;
1158 skb->truesize += copy;
1159 sk->sk_wmem_queued += copy;
Hideo Aoki3ab224b2007-12-31 00:11:19 -08001160 sk_mem_charge(sk, copy);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001161 return 0;
1162}
1163
1164/*
1165 * Queue a received datagram if it will fit. Stream and sequenced
1166 * protocols can't normally use this as they need to fit buffers in
1167 * and play with them.
1168 *
1169 * Inlined as it's very short and called for pretty much every
1170 * packet ever received.
1171 */
1172
1173static inline void skb_set_owner_w(struct sk_buff *skb, struct sock *sk)
1174{
1175 sock_hold(sk);
1176 skb->sk = sk;
1177 skb->destructor = sock_wfree;
1178 atomic_add(skb->truesize, &sk->sk_wmem_alloc);
1179}
1180
1181static inline void skb_set_owner_r(struct sk_buff *skb, struct sock *sk)
1182{
1183 skb->sk = sk;
1184 skb->destructor = sock_rfree;
1185 atomic_add(skb->truesize, &sk->sk_rmem_alloc);
Hideo Aoki3ab224b2007-12-31 00:11:19 -08001186 sk_mem_charge(sk, skb->truesize);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001187}
1188
1189extern void sk_reset_timer(struct sock *sk, struct timer_list* timer,
1190 unsigned long expires);
1191
1192extern void sk_stop_timer(struct sock *sk, struct timer_list* timer);
1193
Denis Vlasenkof0088a52006-03-28 01:08:21 -08001194extern int sock_queue_rcv_skb(struct sock *sk, struct sk_buff *skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001195
1196static inline int sock_queue_err_skb(struct sock *sk, struct sk_buff *skb)
1197{
1198 /* Cast skb->rcvbuf to unsigned... It's pointless, but reduces
1199 number of warnings when compiling with -W --ANK
1200 */
1201 if (atomic_read(&sk->sk_rmem_alloc) + skb->truesize >=
1202 (unsigned)sk->sk_rcvbuf)
1203 return -ENOMEM;
1204 skb_set_owner_r(skb, sk);
1205 skb_queue_tail(&sk->sk_error_queue, skb);
1206 if (!sock_flag(sk, SOCK_DEAD))
1207 sk->sk_data_ready(sk, skb->len);
1208 return 0;
1209}
1210
1211/*
1212 * Recover an error report and clear atomically
1213 */
1214
1215static inline int sock_error(struct sock *sk)
1216{
Benjamin LaHaisec1cbe4b2005-12-13 23:22:19 -08001217 int err;
1218 if (likely(!sk->sk_err))
1219 return 0;
1220 err = xchg(&sk->sk_err, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001221 return -err;
1222}
1223
1224static inline unsigned long sock_wspace(struct sock *sk)
1225{
1226 int amt = 0;
1227
1228 if (!(sk->sk_shutdown & SEND_SHUTDOWN)) {
1229 amt = sk->sk_sndbuf - atomic_read(&sk->sk_wmem_alloc);
1230 if (amt < 0)
1231 amt = 0;
1232 }
1233 return amt;
1234}
1235
1236static inline void sk_wake_async(struct sock *sk, int how, int band)
1237{
1238 if (sk->sk_socket && sk->sk_socket->fasync_list)
1239 sock_wake_async(sk->sk_socket, how, band);
1240}
1241
1242#define SOCK_MIN_SNDBUF 2048
1243#define SOCK_MIN_RCVBUF 256
1244
1245static inline void sk_stream_moderate_sndbuf(struct sock *sk)
1246{
1247 if (!(sk->sk_userlocks & SOCK_SNDBUF_LOCK)) {
Eric Dumazet8df09ea2007-12-21 03:07:41 -08001248 sk->sk_sndbuf = min(sk->sk_sndbuf, sk->sk_wmem_queued >> 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001249 sk->sk_sndbuf = max(sk->sk_sndbuf, SOCK_MIN_SNDBUF);
1250 }
1251}
1252
Pavel Emelyanovdf97c702007-11-29 21:22:33 +11001253struct sk_buff *sk_stream_alloc_skb(struct sock *sk, int size, gfp_t gfp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001254
1255static inline struct page *sk_stream_alloc_page(struct sock *sk)
1256{
1257 struct page *page = NULL;
1258
Herbert Xuef015782005-09-01 17:48:59 -07001259 page = alloc_pages(sk->sk_allocation, 0);
1260 if (!page) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001261 sk->sk_prot->enter_memory_pressure();
1262 sk_stream_moderate_sndbuf(sk);
1263 }
1264 return page;
1265}
1266
Linus Torvalds1da177e2005-04-16 15:20:36 -07001267/*
1268 * Default write policy as shown to user space via poll/select/SIGIO
1269 */
1270static inline int sock_writeable(const struct sock *sk)
1271{
Eric Dumazet8df09ea2007-12-21 03:07:41 -08001272 return atomic_read(&sk->sk_wmem_alloc) < (sk->sk_sndbuf >> 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001273}
1274
Al Virodd0fc662005-10-07 07:46:04 +01001275static inline gfp_t gfp_any(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001276{
Patrick McHardy44981212007-02-27 09:56:42 -08001277 return in_atomic() ? GFP_ATOMIC : GFP_KERNEL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001278}
1279
1280static inline long sock_rcvtimeo(const struct sock *sk, int noblock)
1281{
1282 return noblock ? 0 : sk->sk_rcvtimeo;
1283}
1284
1285static inline long sock_sndtimeo(const struct sock *sk, int noblock)
1286{
1287 return noblock ? 0 : sk->sk_sndtimeo;
1288}
1289
1290static inline int sock_rcvlowat(const struct sock *sk, int waitall, int len)
1291{
1292 return (waitall ? len : min_t(int, sk->sk_rcvlowat, len)) ? : 1;
1293}
1294
1295/* Alas, with timeout socket operations are not restartable.
1296 * Compare this to poll().
1297 */
1298static inline int sock_intr_errno(long timeo)
1299{
1300 return timeo == MAX_SCHEDULE_TIMEOUT ? -ERESTARTSYS : -EINTR;
1301}
1302
Eric Dumazet92f37fd2007-03-25 22:14:49 -07001303extern void __sock_recv_timestamp(struct msghdr *msg, struct sock *sk,
1304 struct sk_buff *skb);
1305
Linus Torvalds1da177e2005-04-16 15:20:36 -07001306static __inline__ void
1307sock_recv_timestamp(struct msghdr *msg, struct sock *sk, struct sk_buff *skb)
1308{
Eric Dumazetb7aa0bf2007-04-19 16:16:32 -07001309 ktime_t kt = skb->tstamp;
Patrick McHardya61bbcf2005-08-14 17:24:31 -07001310
Eric Dumazet92f37fd2007-03-25 22:14:49 -07001311 if (sock_flag(sk, SOCK_RCVTSTAMP))
1312 __sock_recv_timestamp(msg, sk, skb);
1313 else
Eric Dumazetb7aa0bf2007-04-19 16:16:32 -07001314 sk->sk_stamp = kt;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001315}
1316
1317/**
1318 * sk_eat_skb - Release a skb if it is no longer needed
Pavel Pisa4dc3b162005-05-01 08:59:25 -07001319 * @sk: socket to eat this skb from
1320 * @skb: socket buffer to eat
Randy Dunlapf4b8ea72006-06-22 16:00:11 -07001321 * @copied_early: flag indicating whether DMA operations copied this data early
Linus Torvalds1da177e2005-04-16 15:20:36 -07001322 *
1323 * This routine must be called with interrupts disabled or with the socket
1324 * locked so that the sk_buff queue operation is ok.
1325*/
Chris Leech624d1162006-05-23 18:01:28 -07001326#ifdef CONFIG_NET_DMA
1327static inline void sk_eat_skb(struct sock *sk, struct sk_buff *skb, int copied_early)
1328{
1329 __skb_unlink(skb, &sk->sk_receive_queue);
1330 if (!copied_early)
1331 __kfree_skb(skb);
1332 else
1333 __skb_queue_tail(&sk->sk_async_wait_queue, skb);
1334}
1335#else
1336static inline void sk_eat_skb(struct sock *sk, struct sk_buff *skb, int copied_early)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001337{
1338 __skb_unlink(skb, &sk->sk_receive_queue);
1339 __kfree_skb(skb);
1340}
Chris Leech624d1162006-05-23 18:01:28 -07001341#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07001342
Denis V. Lunevedf02082008-02-29 11:18:32 -08001343/*
1344 * Kernel sockets, f.e. rtnl or icmp_socket, are a part of a namespace.
1345 * They should not hold a referrence to a namespace in order to allow
1346 * to stop it.
1347 * Sockets after sk_change_net should be released using sk_release_kernel
1348 */
1349static inline void sk_change_net(struct sock *sk, struct net *net)
1350{
1351 put_net(sk->sk_net);
1352 sk->sk_net = net;
1353}
1354
Linus Torvalds1da177e2005-04-16 15:20:36 -07001355extern void sock_enable_timestamp(struct sock *sk);
1356extern int sock_get_timestamp(struct sock *, struct timeval __user *);
Eric Dumazetae40eb12007-03-18 17:33:16 -07001357extern int sock_get_timestampns(struct sock *, struct timespec __user *);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001358
1359/*
1360 * Enable debug/info messages
1361 */
Stephen Hemmingera2a316f2007-03-08 20:41:08 -08001362extern int net_msg_warn;
1363#define NETDEBUG(fmt, args...) \
1364 do { if (net_msg_warn) printk(fmt,##args); } while (0)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001365
Stephen Hemmingera2a316f2007-03-08 20:41:08 -08001366#define LIMIT_NETDEBUG(fmt, args...) \
1367 do { if (net_msg_warn && net_ratelimit()) printk(fmt,##args); } while(0)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001368
1369/*
1370 * Macros for sleeping on a socket. Use them like this:
1371 *
1372 * SOCK_SLEEP_PRE(sk)
1373 * if (condition)
1374 * schedule();
1375 * SOCK_SLEEP_POST(sk)
1376 *
1377 * N.B. These are now obsolete and were, afaik, only ever used in DECnet
1378 * and when the last use of them in DECnet has gone, I'm intending to
1379 * remove them.
1380 */
1381
1382#define SOCK_SLEEP_PRE(sk) { struct task_struct *tsk = current; \
1383 DECLARE_WAITQUEUE(wait, tsk); \
1384 tsk->state = TASK_INTERRUPTIBLE; \
1385 add_wait_queue((sk)->sk_sleep, &wait); \
1386 release_sock(sk);
1387
1388#define SOCK_SLEEP_POST(sk) tsk->state = TASK_RUNNING; \
1389 remove_wait_queue((sk)->sk_sleep, &wait); \
1390 lock_sock(sk); \
1391 }
1392
Linus Torvalds1da177e2005-04-16 15:20:36 -07001393extern __u32 sysctl_wmem_max;
1394extern __u32 sysctl_rmem_max;
1395
Arnaldo Carvalho de Melo20380732005-08-16 02:18:02 -03001396extern void sk_init(void);
1397
David S. Miller6baf1f42005-09-05 18:14:11 -07001398extern int sysctl_optmem_max;
1399
Arnaldo Carvalho de Melo20380732005-08-16 02:18:02 -03001400extern __u32 sysctl_wmem_default;
1401extern __u32 sysctl_rmem_default;
Arnaldo Carvalho de Melo20380732005-08-16 02:18:02 -03001402
Linus Torvalds1da177e2005-04-16 15:20:36 -07001403#endif /* _SOCK_H */