blob: 6cb1676e409a865f2fb7c21317e2519e1382e847 [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>
Eric Dumazet88ab1932008-11-16 19:39:21 -080045#include <linux/list_nulls.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070046#include <linux/timer.h>
47#include <linux/cache.h>
48#include <linux/module.h>
Ingo Molnara5b5bb92006-07-03 00:25:35 -070049#include <linux/lockdep.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070050#include <linux/netdevice.h>
51#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>
Eric Dumazet88ab1932008-11-16 19:39:21 -080056#include <linux/rculist_nulls.h>
Jiri Olsaa57de0b2009-07-08 12:09:13 +000057#include <linux/poll.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070058
59#include <asm/atomic.h>
60#include <net/dst.h>
61#include <net/checksum.h>
62
63/*
64 * This structure really needs to be cleaned up.
65 * Most of it is for TCP, and not used by any of
66 * the other protocols.
67 */
68
69/* Define this to get the SOCK_DBG debugging facility. */
70#define SOCK_DEBUGGING
71#ifdef SOCK_DEBUGGING
72#define SOCK_DEBUG(sk, msg...) do { if ((sk) && sock_flag((sk), SOCK_DBG)) \
73 printk(KERN_DEBUG msg); } while (0)
74#else
Stephen Hemminger4cd90292008-03-21 15:54:53 -070075/* Validate arguments and do nothing */
76static void inline int __attribute__ ((format (printf, 2, 3)))
77SOCK_DEBUG(struct sock *sk, const char *msg, ...)
78{
79}
Linus Torvalds1da177e2005-04-16 15:20:36 -070080#endif
81
82/* This is the per-socket lock. The spinlock provides a synchronization
83 * between user contexts and software interrupt processing, whereas the
84 * mini-semaphore synchronizes multiple users amongst themselves.
85 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070086typedef struct {
87 spinlock_t slock;
John Heffnerd2e91172007-09-12 10:44:19 +020088 int owned;
Linus Torvalds1da177e2005-04-16 15:20:36 -070089 wait_queue_head_t wq;
Ingo Molnara5b5bb92006-07-03 00:25:35 -070090 /*
91 * We express the mutex-alike socket_lock semantics
92 * to the lock validator by explicitly managing
93 * the slock as a lock variant (in addition to
94 * the slock itself):
95 */
96#ifdef CONFIG_DEBUG_LOCK_ALLOC
97 struct lockdep_map dep_map;
98#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070099} socket_lock_t;
100
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101struct sock;
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700102struct proto;
Denis V. Lunev0eeb8ff2007-12-04 01:15:45 -0800103struct net;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104
105/**
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700106 * struct sock_common - minimal network layer representation of sockets
Eric Dumazet4dc6dc72009-07-15 23:13:10 +0000107 * @skc_node: main hash linkage for various protocol lookup tables
Eric Dumazet512615b2009-11-08 10:17:58 +0000108 * @skc_nulls_node: main hash linkage for TCP/UDP/UDP-Lite protocol
Eric Dumazet4dc6dc72009-07-15 23:13:10 +0000109 * @skc_refcnt: reference count
Krishna Kumare022f0b2009-10-19 23:46:20 +0000110 * @skc_tx_queue_mapping: tx queue number for this connection
Eric Dumazet4dc6dc72009-07-15 23:13:10 +0000111 * @skc_hash: hash value used with various protocol lookup tables
Eric Dumazetd4cada42009-11-08 10:17:30 +0000112 * @skc_u16hashes: two u16 hash values used by UDP lookup tables
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700113 * @skc_family: network address family
114 * @skc_state: Connection state
115 * @skc_reuse: %SO_REUSEADDR setting
116 * @skc_bound_dev_if: bound device index if != 0
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700117 * @skc_bind_node: bind hash linkage for various protocol lookup tables
Eric Dumazet512615b2009-11-08 10:17:58 +0000118 * @skc_portaddr_node: second hash linkage for UDP/UDP-Lite protocol
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700119 * @skc_prot: protocol handlers inside a network family
Eric W. Biederman07feaeb2007-09-12 11:58:02 +0200120 * @skc_net: reference to the network namespace of this socket
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700121 *
122 * This is the minimal network layer representation of sockets, the header
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700123 * for struct sock and struct inet_timewait_sock.
124 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125struct sock_common {
Eric Dumazet4dc6dc72009-07-15 23:13:10 +0000126 /*
127 * first fields are not copied in sock_copy()
128 */
Eric Dumazet88ab1932008-11-16 19:39:21 -0800129 union {
130 struct hlist_node skc_node;
131 struct hlist_nulls_node skc_nulls_node;
132 };
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133 atomic_t skc_refcnt;
Krishna Kumare022f0b2009-10-19 23:46:20 +0000134 int skc_tx_queue_mapping;
Eric Dumazet4dc6dc72009-07-15 23:13:10 +0000135
Eric Dumazetd4cada42009-11-08 10:17:30 +0000136 union {
137 unsigned int skc_hash;
138 __u16 skc_u16hashes[2];
139 };
Eric Dumazet4dc6dc72009-07-15 23:13:10 +0000140 unsigned short skc_family;
141 volatile unsigned char skc_state;
142 unsigned char skc_reuse;
143 int skc_bound_dev_if;
Eric Dumazet512615b2009-11-08 10:17:58 +0000144 union {
145 struct hlist_node skc_bind_node;
146 struct hlist_nulls_node skc_portaddr_node;
147 };
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700148 struct proto *skc_prot;
YOSHIFUJI Hideaki3b1e0a62008-03-26 02:26:21 +0900149#ifdef CONFIG_NET_NS
Eric W. Biederman07feaeb2007-09-12 11:58:02 +0200150 struct net *skc_net;
YOSHIFUJI Hideaki3b1e0a62008-03-26 02:26:21 +0900151#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152};
153
154/**
155 * struct sock - network layer representation of sockets
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700156 * @__sk_common: shared layout with inet_timewait_sock
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700157 * @sk_shutdown: mask of %SEND_SHUTDOWN and/or %RCV_SHUTDOWN
158 * @sk_userlocks: %SO_SNDBUF and %SO_RCVBUF settings
159 * @sk_lock: synchronizer
160 * @sk_rcvbuf: size of receive buffer in bytes
161 * @sk_sleep: sock wait queue
162 * @sk_dst_cache: destination cache
163 * @sk_dst_lock: destination cache lock
164 * @sk_policy: flow policy
165 * @sk_rmem_alloc: receive queue bytes committed
166 * @sk_receive_queue: incoming packets
167 * @sk_wmem_alloc: transmit queue bytes committed
168 * @sk_write_queue: Packet sending queue
Chris Leech97fc2f02006-05-23 17:55:33 -0700169 * @sk_async_wait_queue: DMA copied packets
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700170 * @sk_omem_alloc: "o" is "option" or "other"
171 * @sk_wmem_queued: persistent queue size
172 * @sk_forward_alloc: space allocated forward
173 * @sk_allocation: allocation mode
174 * @sk_sndbuf: size of send buffer in bytes
Wang Chen33c732c2007-11-13 20:30:01 -0800175 * @sk_flags: %SO_LINGER (l_onoff), %SO_BROADCAST, %SO_KEEPALIVE,
Patrick Ohly20d49472009-02-12 05:03:38 +0000176 * %SO_OOBINLINE settings, %SO_TIMESTAMPING settings
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700177 * @sk_no_check: %SO_NO_CHECK setting, wether or not checkup packets
178 * @sk_route_caps: route capabilities (e.g. %NETIF_F_TSO)
Herbert Xubcd76112006-06-30 13:36:35 -0700179 * @sk_gso_type: GSO type (e.g. %SKB_GSO_TCPV4)
Peter P Waskiewicz Jr82cc1a72008-03-21 03:43:19 -0700180 * @sk_gso_max_size: Maximum GSO segment size to build
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700181 * @sk_lingertime: %SO_LINGER l_linger setting
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700182 * @sk_backlog: always used with the per-socket spinlock held
183 * @sk_callback_lock: used with the callbacks in the end of this struct
184 * @sk_error_queue: rarely used
Wang Chen33c732c2007-11-13 20:30:01 -0800185 * @sk_prot_creator: sk_prot of original sock creator (see ipv6_setsockopt,
186 * IPV6_ADDRFORM for instance)
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700187 * @sk_err: last error
Wang Chen33c732c2007-11-13 20:30:01 -0800188 * @sk_err_soft: errors that don't cause failure but are the cause of a
189 * persistent failure not just 'timed out'
Eric Dumazetcb61cb92008-06-17 21:04:56 -0700190 * @sk_drops: raw/udp drops counter
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700191 * @sk_ack_backlog: current listen backlog
192 * @sk_max_ack_backlog: listen backlog set in listen()
193 * @sk_priority: %SO_PRIORITY setting
194 * @sk_type: socket type (%SOCK_STREAM, etc)
195 * @sk_protocol: which protocol this socket belongs in this network family
196 * @sk_peercred: %SO_PEERCRED setting
197 * @sk_rcvlowat: %SO_RCVLOWAT setting
198 * @sk_rcvtimeo: %SO_RCVTIMEO setting
199 * @sk_sndtimeo: %SO_SNDTIMEO setting
200 * @sk_filter: socket filtering instructions
201 * @sk_protinfo: private area, net family specific, when not using slab
202 * @sk_timer: sock cleanup timer
203 * @sk_stamp: time stamp of last packet received
204 * @sk_socket: Identd and reporting IO signals
205 * @sk_user_data: RPC layer private data
206 * @sk_sndmsg_page: cached page for sendmsg
207 * @sk_sndmsg_off: cached offset for sendmsg
208 * @sk_send_head: front of stuff to transmit
Martin Waitz67be2dd2005-05-01 08:59:26 -0700209 * @sk_security: used by security modules
Randy Dunlap31729362008-02-18 20:52:13 -0800210 * @sk_mark: generic packet mark
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700211 * @sk_write_pending: a write to stream socket waits to start
212 * @sk_state_change: callback to indicate change in the state of the sock
213 * @sk_data_ready: callback to indicate there is data to be processed
214 * @sk_write_space: callback to indicate there is bf sending space available
215 * @sk_error_report: callback to indicate errors (e.g. %MSG_ERRQUEUE)
216 * @sk_backlog_rcv: callback to process the backlog
217 * @sk_destruct: called at sock freeing time, i.e. when all refcnt == 0
Linus Torvalds1da177e2005-04-16 15:20:36 -0700218 */
219struct sock {
220 /*
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700221 * Now struct inet_timewait_sock also uses sock_common, so please just
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222 * don't add nothing before this first member (__sk_common) --acme
223 */
224 struct sock_common __sk_common;
Eric Dumazet4dc6dc72009-07-15 23:13:10 +0000225#define sk_node __sk_common.skc_node
226#define sk_nulls_node __sk_common.skc_nulls_node
227#define sk_refcnt __sk_common.skc_refcnt
Krishna Kumare022f0b2009-10-19 23:46:20 +0000228#define sk_tx_queue_mapping __sk_common.skc_tx_queue_mapping
Eric Dumazet4dc6dc72009-07-15 23:13:10 +0000229
230#define sk_copy_start __sk_common.skc_hash
231#define sk_hash __sk_common.skc_hash
Linus Torvalds1da177e2005-04-16 15:20:36 -0700232#define sk_family __sk_common.skc_family
233#define sk_state __sk_common.skc_state
234#define sk_reuse __sk_common.skc_reuse
235#define sk_bound_dev_if __sk_common.skc_bound_dev_if
Linus Torvalds1da177e2005-04-16 15:20:36 -0700236#define sk_bind_node __sk_common.skc_bind_node
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700237#define sk_prot __sk_common.skc_prot
Eric W. Biederman07feaeb2007-09-12 11:58:02 +0200238#define sk_net __sk_common.skc_net
Vegard Nossuma98b65a2009-02-26 14:46:57 +0100239 kmemcheck_bitfield_begin(flags);
Eric Dumazet5fdb9972009-10-08 22:50:25 +0000240 unsigned int sk_shutdown : 2,
241 sk_no_check : 2,
242 sk_userlocks : 4,
243 sk_protocol : 8,
244 sk_type : 16;
Vegard Nossuma98b65a2009-02-26 14:46:57 +0100245 kmemcheck_bitfield_end(flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246 int sk_rcvbuf;
247 socket_lock_t sk_lock;
Eric Dumazetfa438cc2007-03-04 16:05:44 -0800248 /*
249 * The backlog queue is special, it is always used with
250 * the per-socket spinlock held and requires low latency
251 * access. Therefore we special case it's implementation.
252 */
253 struct {
254 struct sk_buff *head;
255 struct sk_buff *tail;
256 } sk_backlog;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257 wait_queue_head_t *sk_sleep;
258 struct dst_entry *sk_dst_cache;
Alexey Dobriyandef8b4f2008-10-28 13:24:06 -0700259#ifdef CONFIG_XFRM
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260 struct xfrm_policy *sk_policy[2];
Alexey Dobriyandef8b4f2008-10-28 13:24:06 -0700261#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700262 rwlock_t sk_dst_lock;
263 atomic_t sk_rmem_alloc;
264 atomic_t sk_wmem_alloc;
265 atomic_t sk_omem_alloc;
Arnaldo Carvalho de Melo4e07a912007-05-29 13:17:47 -0700266 int sk_sndbuf;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267 struct sk_buff_head sk_receive_queue;
268 struct sk_buff_head sk_write_queue;
Alexey Dobriyan23789822008-11-12 23:25:32 -0800269#ifdef CONFIG_NET_DMA
Chris Leech97fc2f02006-05-23 17:55:33 -0700270 struct sk_buff_head sk_async_wait_queue;
Alexey Dobriyan23789822008-11-12 23:25:32 -0800271#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700272 int sk_wmem_queued;
273 int sk_forward_alloc;
Al Viro7d877f32005-10-21 03:20:43 -0400274 gfp_t sk_allocation;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275 int sk_route_caps;
Herbert Xubcd76112006-06-30 13:36:35 -0700276 int sk_gso_type;
Peter P Waskiewicz Jr82cc1a72008-03-21 03:43:19 -0700277 unsigned int sk_gso_max_size;
David S. Miller9932cf92006-03-24 15:12:37 -0800278 int sk_rcvlowat;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279 unsigned long sk_flags;
280 unsigned long sk_lingertime;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700281 struct sk_buff_head sk_error_queue;
Arnaldo Carvalho de Melo476e19c2005-05-05 13:35:15 -0700282 struct proto *sk_prot_creator;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700283 rwlock_t sk_callback_lock;
284 int sk_err,
285 sk_err_soft;
Wang Chen33c732c2007-11-13 20:30:01 -0800286 atomic_t sk_drops;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700287 unsigned short sk_ack_backlog;
288 unsigned short sk_max_ack_backlog;
289 __u32 sk_priority;
290 struct ucred sk_peercred;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700291 long sk_rcvtimeo;
292 long sk_sndtimeo;
293 struct sk_filter *sk_filter;
294 void *sk_protinfo;
295 struct timer_list sk_timer;
Eric Dumazetb7aa0bf2007-04-19 16:16:32 -0700296 ktime_t sk_stamp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700297 struct socket *sk_socket;
298 void *sk_user_data;
299 struct page *sk_sndmsg_page;
300 struct sk_buff *sk_send_head;
301 __u32 sk_sndmsg_off;
302 int sk_write_pending;
Alexey Dobriyand5f64232008-11-04 14:45:58 -0800303#ifdef CONFIG_SECURITY
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304 void *sk_security;
Alexey Dobriyand5f64232008-11-04 14:45:58 -0800305#endif
Laszlo Attila Toth4a19ec52008-01-30 19:08:16 -0800306 __u32 sk_mark;
307 /* XXX 4 bytes hole on 64 bit */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700308 void (*sk_state_change)(struct sock *sk);
309 void (*sk_data_ready)(struct sock *sk, int bytes);
310 void (*sk_write_space)(struct sock *sk);
311 void (*sk_error_report)(struct sock *sk);
312 int (*sk_backlog_rcv)(struct sock *sk,
313 struct sk_buff *skb);
314 void (*sk_destruct)(struct sock *sk);
315};
316
317/*
318 * Hashed lists helper routines
319 */
Li Zefanc4146642010-02-08 23:18:45 +0000320static inline struct sock *sk_entry(const struct hlist_node *node)
321{
322 return hlist_entry(node, struct sock, sk_node);
323}
324
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700325static inline struct sock *__sk_head(const struct hlist_head *head)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700326{
327 return hlist_entry(head->first, struct sock, sk_node);
328}
329
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700330static inline struct sock *sk_head(const struct hlist_head *head)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700331{
332 return hlist_empty(head) ? NULL : __sk_head(head);
333}
334
Eric Dumazet88ab1932008-11-16 19:39:21 -0800335static inline struct sock *__sk_nulls_head(const struct hlist_nulls_head *head)
336{
337 return hlist_nulls_entry(head->first, struct sock, sk_nulls_node);
338}
339
340static inline struct sock *sk_nulls_head(const struct hlist_nulls_head *head)
341{
342 return hlist_nulls_empty(head) ? NULL : __sk_nulls_head(head);
343}
344
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700345static inline struct sock *sk_next(const struct sock *sk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700346{
347 return sk->sk_node.next ?
348 hlist_entry(sk->sk_node.next, struct sock, sk_node) : NULL;
349}
350
Eric Dumazet88ab1932008-11-16 19:39:21 -0800351static inline struct sock *sk_nulls_next(const struct sock *sk)
352{
353 return (!is_a_nulls(sk->sk_nulls_node.next)) ?
354 hlist_nulls_entry(sk->sk_nulls_node.next,
355 struct sock, sk_nulls_node) :
356 NULL;
357}
358
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700359static inline int sk_unhashed(const struct sock *sk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700360{
361 return hlist_unhashed(&sk->sk_node);
362}
363
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700364static inline int sk_hashed(const struct sock *sk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365{
Akinobu Mitada753be2006-04-28 15:21:23 -0700366 return !sk_unhashed(sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700367}
368
369static __inline__ void sk_node_init(struct hlist_node *node)
370{
371 node->pprev = NULL;
372}
373
Eric Dumazet88ab1932008-11-16 19:39:21 -0800374static __inline__ void sk_nulls_node_init(struct hlist_nulls_node *node)
375{
376 node->pprev = NULL;
377}
378
Linus Torvalds1da177e2005-04-16 15:20:36 -0700379static __inline__ void __sk_del_node(struct sock *sk)
380{
381 __hlist_del(&sk->sk_node);
382}
383
stephen hemminger808f5112010-02-22 07:57:18 +0000384/* NB: equivalent to hlist_del_init_rcu */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700385static __inline__ int __sk_del_node_init(struct sock *sk)
386{
387 if (sk_hashed(sk)) {
388 __sk_del_node(sk);
389 sk_node_init(&sk->sk_node);
390 return 1;
391 }
392 return 0;
393}
394
395/* Grab socket reference count. This operation is valid only
396 when sk is ALREADY grabbed f.e. it is found in hash table
397 or a list and the lookup is made under lock preventing hash table
398 modifications.
399 */
400
401static inline void sock_hold(struct sock *sk)
402{
403 atomic_inc(&sk->sk_refcnt);
404}
405
406/* Ungrab socket in the context, which assumes that socket refcnt
407 cannot hit zero, f.e. it is true in context of any socketcall.
408 */
409static inline void __sock_put(struct sock *sk)
410{
411 atomic_dec(&sk->sk_refcnt);
412}
413
414static __inline__ int sk_del_node_init(struct sock *sk)
415{
416 int rc = __sk_del_node_init(sk);
417
418 if (rc) {
419 /* paranoid for a while -acme */
420 WARN_ON(atomic_read(&sk->sk_refcnt) == 1);
421 __sock_put(sk);
422 }
423 return rc;
424}
stephen hemminger808f5112010-02-22 07:57:18 +0000425#define sk_del_node_init_rcu(sk) sk_del_node_init(sk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700426
Eric Dumazet88ab1932008-11-16 19:39:21 -0800427static __inline__ int __sk_nulls_del_node_init_rcu(struct sock *sk)
Eric Dumazet271b72c2008-10-29 02:11:14 -0700428{
429 if (sk_hashed(sk)) {
Eric Dumazet88ab1932008-11-16 19:39:21 -0800430 hlist_nulls_del_init_rcu(&sk->sk_nulls_node);
Eric Dumazet271b72c2008-10-29 02:11:14 -0700431 return 1;
432 }
433 return 0;
434}
435
Eric Dumazet88ab1932008-11-16 19:39:21 -0800436static __inline__ int sk_nulls_del_node_init_rcu(struct sock *sk)
Eric Dumazet271b72c2008-10-29 02:11:14 -0700437{
Eric Dumazet88ab1932008-11-16 19:39:21 -0800438 int rc = __sk_nulls_del_node_init_rcu(sk);
Eric Dumazet271b72c2008-10-29 02:11:14 -0700439
440 if (rc) {
441 /* paranoid for a while -acme */
442 WARN_ON(atomic_read(&sk->sk_refcnt) == 1);
443 __sock_put(sk);
444 }
445 return rc;
446}
447
Linus Torvalds1da177e2005-04-16 15:20:36 -0700448static __inline__ void __sk_add_node(struct sock *sk, struct hlist_head *list)
449{
450 hlist_add_head(&sk->sk_node, list);
451}
452
453static __inline__ void sk_add_node(struct sock *sk, struct hlist_head *list)
454{
455 sock_hold(sk);
456 __sk_add_node(sk, list);
457}
458
stephen hemminger808f5112010-02-22 07:57:18 +0000459static __inline__ void sk_add_node_rcu(struct sock *sk, struct hlist_head *list)
460{
461 sock_hold(sk);
462 hlist_add_head_rcu(&sk->sk_node, list);
463}
464
Eric Dumazet88ab1932008-11-16 19:39:21 -0800465static __inline__ void __sk_nulls_add_node_rcu(struct sock *sk, struct hlist_nulls_head *list)
Eric Dumazet271b72c2008-10-29 02:11:14 -0700466{
Eric Dumazet88ab1932008-11-16 19:39:21 -0800467 hlist_nulls_add_head_rcu(&sk->sk_nulls_node, list);
Eric Dumazet271b72c2008-10-29 02:11:14 -0700468}
469
Eric Dumazet88ab1932008-11-16 19:39:21 -0800470static __inline__ void sk_nulls_add_node_rcu(struct sock *sk, struct hlist_nulls_head *list)
Eric Dumazet271b72c2008-10-29 02:11:14 -0700471{
472 sock_hold(sk);
Eric Dumazet88ab1932008-11-16 19:39:21 -0800473 __sk_nulls_add_node_rcu(sk, list);
Eric Dumazet271b72c2008-10-29 02:11:14 -0700474}
475
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476static __inline__ void __sk_del_bind_node(struct sock *sk)
477{
478 __hlist_del(&sk->sk_bind_node);
479}
480
481static __inline__ void sk_add_bind_node(struct sock *sk,
482 struct hlist_head *list)
483{
484 hlist_add_head(&sk->sk_bind_node, list);
485}
486
487#define sk_for_each(__sk, node, list) \
488 hlist_for_each_entry(__sk, node, list, sk_node)
stephen hemminger808f5112010-02-22 07:57:18 +0000489#define sk_for_each_rcu(__sk, node, list) \
490 hlist_for_each_entry_rcu(__sk, node, list, sk_node)
Eric Dumazet88ab1932008-11-16 19:39:21 -0800491#define sk_nulls_for_each(__sk, node, list) \
492 hlist_nulls_for_each_entry(__sk, node, list, sk_nulls_node)
493#define sk_nulls_for_each_rcu(__sk, node, list) \
494 hlist_nulls_for_each_entry_rcu(__sk, node, list, sk_nulls_node)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700495#define sk_for_each_from(__sk, node) \
496 if (__sk && ({ node = &(__sk)->sk_node; 1; })) \
497 hlist_for_each_entry_from(__sk, node, sk_node)
Eric Dumazet88ab1932008-11-16 19:39:21 -0800498#define sk_nulls_for_each_from(__sk, node) \
499 if (__sk && ({ node = &(__sk)->sk_nulls_node; 1; })) \
500 hlist_nulls_for_each_entry_from(__sk, node, sk_nulls_node)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700501#define sk_for_each_continue(__sk, node) \
502 if (__sk && ({ node = &(__sk)->sk_node; 1; })) \
503 hlist_for_each_entry_continue(__sk, node, sk_node)
504#define sk_for_each_safe(__sk, node, tmp, list) \
505 hlist_for_each_entry_safe(__sk, node, tmp, list, sk_node)
506#define sk_for_each_bound(__sk, node, list) \
507 hlist_for_each_entry(__sk, node, list, sk_bind_node)
508
509/* Sock flags */
510enum sock_flags {
511 SOCK_DEAD,
512 SOCK_DONE,
513 SOCK_URGINLINE,
514 SOCK_KEEPOPEN,
515 SOCK_LINGER,
516 SOCK_DESTROY,
517 SOCK_BROADCAST,
518 SOCK_TIMESTAMP,
519 SOCK_ZAPPED,
520 SOCK_USE_WRITE_QUEUE, /* whether to call sk->sk_write_space in sock_wfree */
521 SOCK_DBG, /* %SO_DEBUG setting */
522 SOCK_RCVTSTAMP, /* %SO_TIMESTAMP setting */
Eric Dumazet92f37fd2007-03-25 22:14:49 -0700523 SOCK_RCVTSTAMPNS, /* %SO_TIMESTAMPNS setting */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700524 SOCK_LOCALROUTE, /* route locally only, %SO_DONTROUTE setting */
525 SOCK_QUEUE_SHRUNK, /* write queue has been shrunk recently */
Patrick Ohly20d49472009-02-12 05:03:38 +0000526 SOCK_TIMESTAMPING_TX_HARDWARE, /* %SOF_TIMESTAMPING_TX_HARDWARE */
527 SOCK_TIMESTAMPING_TX_SOFTWARE, /* %SOF_TIMESTAMPING_TX_SOFTWARE */
528 SOCK_TIMESTAMPING_RX_HARDWARE, /* %SOF_TIMESTAMPING_RX_HARDWARE */
529 SOCK_TIMESTAMPING_RX_SOFTWARE, /* %SOF_TIMESTAMPING_RX_SOFTWARE */
530 SOCK_TIMESTAMPING_SOFTWARE, /* %SOF_TIMESTAMPING_SOFTWARE */
531 SOCK_TIMESTAMPING_RAW_HARDWARE, /* %SOF_TIMESTAMPING_RAW_HARDWARE */
532 SOCK_TIMESTAMPING_SYS_HARDWARE, /* %SOF_TIMESTAMPING_SYS_HARDWARE */
Eric Dumazetbcdce712009-10-06 17:28:29 -0700533 SOCK_FASYNC, /* fasync() active */
Neil Horman3b885782009-10-12 13:26:31 -0700534 SOCK_RXQ_OVFL,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700535};
536
Ralf Baechle53b924b2005-08-23 10:11:30 -0700537static inline void sock_copy_flags(struct sock *nsk, struct sock *osk)
538{
539 nsk->sk_flags = osk->sk_flags;
540}
541
Linus Torvalds1da177e2005-04-16 15:20:36 -0700542static inline void sock_set_flag(struct sock *sk, enum sock_flags flag)
543{
544 __set_bit(flag, &sk->sk_flags);
545}
546
547static inline void sock_reset_flag(struct sock *sk, enum sock_flags flag)
548{
549 __clear_bit(flag, &sk->sk_flags);
550}
551
552static inline int sock_flag(struct sock *sk, enum sock_flags flag)
553{
554 return test_bit(flag, &sk->sk_flags);
555}
556
557static inline void sk_acceptq_removed(struct sock *sk)
558{
559 sk->sk_ack_backlog--;
560}
561
562static inline void sk_acceptq_added(struct sock *sk)
563{
564 sk->sk_ack_backlog++;
565}
566
567static inline int sk_acceptq_is_full(struct sock *sk)
568{
David S. Miller64a14652007-03-06 11:21:05 -0800569 return sk->sk_ack_backlog > sk->sk_max_ack_backlog;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700570}
571
572/*
573 * Compute minimal free write space needed to queue new packets.
574 */
575static inline int sk_stream_min_wspace(struct sock *sk)
576{
Eric Dumazet8df09ea2007-12-21 03:07:41 -0800577 return sk->sk_wmem_queued >> 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700578}
579
580static inline int sk_stream_wspace(struct sock *sk)
581{
582 return sk->sk_sndbuf - sk->sk_wmem_queued;
583}
584
585extern void sk_stream_write_space(struct sock *sk);
586
587static inline int sk_stream_memory_free(struct sock *sk)
588{
589 return sk->sk_wmem_queued < sk->sk_sndbuf;
590}
591
Linus Torvalds1da177e2005-04-16 15:20:36 -0700592/* The per-socket spinlock must be held here. */
Stephen Hemminger9ee6b532005-11-08 09:39:42 -0800593static inline void sk_add_backlog(struct sock *sk, struct sk_buff *skb)
594{
595 if (!sk->sk_backlog.tail) {
596 sk->sk_backlog.head = sk->sk_backlog.tail = skb;
597 } else {
598 sk->sk_backlog.tail->next = skb;
599 sk->sk_backlog.tail = skb;
600 }
601 skb->next = NULL;
602}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700603
Peter Zijlstrac57943a2008-10-07 14:18:42 -0700604static inline int sk_backlog_rcv(struct sock *sk, struct sk_buff *skb)
605{
606 return sk->sk_backlog_rcv(sk, skb);
607}
608
Stephen Hemmingercfcabdc2007-10-09 01:59:42 -0700609#define sk_wait_event(__sk, __timeo, __condition) \
610 ({ int __rc; \
611 release_sock(__sk); \
612 __rc = __condition; \
613 if (!__rc) { \
614 *(__timeo) = schedule_timeout(*(__timeo)); \
615 } \
616 lock_sock(__sk); \
617 __rc = __condition; \
618 __rc; \
619 })
Linus Torvalds1da177e2005-04-16 15:20:36 -0700620
621extern int sk_stream_wait_connect(struct sock *sk, long *timeo_p);
622extern int sk_stream_wait_memory(struct sock *sk, long *timeo_p);
623extern void sk_stream_wait_close(struct sock *sk, long timeo_p);
624extern int sk_stream_error(struct sock *sk, int flags, int err);
625extern void sk_stream_kill_queues(struct sock *sk);
626
627extern int sk_wait_data(struct sock *sk, long *timeo);
628
Arnaldo Carvalho de Melo60236fd2005-06-18 22:47:21 -0700629struct request_sock_ops;
Arnaldo Carvalho de Melo6d6ee432005-12-13 23:25:19 -0800630struct timewait_sock_ops;
Arnaldo Carvalho de Meloab1e0a12008-02-03 04:06:04 -0800631struct inet_hashinfo;
Pavel Emelyanovfc8717b2008-03-22 16:56:51 -0700632struct raw_hashinfo;
Arnaldo Carvalho de Melo2e6599c2005-06-18 22:46:52 -0700633
Linus Torvalds1da177e2005-04-16 15:20:36 -0700634/* Networking protocol blocks we attach to sockets.
635 * socket layer -> transport layer interface
636 * transport -> network interface is defined by struct inet_proto
637 */
638struct proto {
639 void (*close)(struct sock *sk,
640 long timeout);
641 int (*connect)(struct sock *sk,
642 struct sockaddr *uaddr,
643 int addr_len);
644 int (*disconnect)(struct sock *sk, int flags);
645
646 struct sock * (*accept) (struct sock *sk, int flags, int *err);
647
648 int (*ioctl)(struct sock *sk, int cmd,
649 unsigned long arg);
650 int (*init)(struct sock *sk);
Brian Haley7d06b2e2008-06-14 17:04:49 -0700651 void (*destroy)(struct sock *sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700652 void (*shutdown)(struct sock *sk, int how);
653 int (*setsockopt)(struct sock *sk, int level,
654 int optname, char __user *optval,
David S. Millerb7058842009-09-30 16:12:20 -0700655 unsigned int optlen);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700656 int (*getsockopt)(struct sock *sk, int level,
657 int optname, char __user *optval,
658 int __user *option);
Alexey Dobriyanaf01d532008-08-28 02:53:51 -0700659#ifdef CONFIG_COMPAT
Dmitry Mishin3fdadf72006-03-20 22:45:21 -0800660 int (*compat_setsockopt)(struct sock *sk,
661 int level,
662 int optname, char __user *optval,
David S. Millerb7058842009-09-30 16:12:20 -0700663 unsigned int optlen);
Dmitry Mishin3fdadf72006-03-20 22:45:21 -0800664 int (*compat_getsockopt)(struct sock *sk,
665 int level,
666 int optname, char __user *optval,
667 int __user *option);
Alexey Dobriyanaf01d532008-08-28 02:53:51 -0700668#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700669 int (*sendmsg)(struct kiocb *iocb, struct sock *sk,
670 struct msghdr *msg, size_t len);
671 int (*recvmsg)(struct kiocb *iocb, struct sock *sk,
672 struct msghdr *msg,
673 size_t len, int noblock, int flags,
674 int *addr_len);
675 int (*sendpage)(struct sock *sk, struct page *page,
676 int offset, size_t size, int flags);
677 int (*bind)(struct sock *sk,
678 struct sockaddr *uaddr, int addr_len);
679
680 int (*backlog_rcv) (struct sock *sk,
681 struct sk_buff *skb);
682
683 /* Keeping track of sk's, looking them up, and port selection methods. */
684 void (*hash)(struct sock *sk);
685 void (*unhash)(struct sock *sk);
686 int (*get_port)(struct sock *sk, unsigned short snum);
687
Eric Dumazet286ab3d2007-11-05 23:38:39 -0800688 /* Keeping track of sockets in use */
Eric Dumazet65f76512008-01-03 20:46:48 -0800689#ifdef CONFIG_PROC_FS
Pavel Emelyanov13ff3d62008-03-28 16:38:17 -0700690 unsigned int inuse_idx;
Eric Dumazet65f76512008-01-03 20:46:48 -0800691#endif
Arnaldo Carvalho de Meloebb53d72007-11-21 22:08:50 +0800692
Linus Torvalds1da177e2005-04-16 15:20:36 -0700693 /* Memory pressure */
Pavel Emelyanov5c52ba12008-07-16 20:28:10 -0700694 void (*enter_memory_pressure)(struct sock *sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700695 atomic_t *memory_allocated; /* Current allocated memory. */
Eric Dumazet17483762008-11-25 21:16:35 -0800696 struct percpu_counter *sockets_allocated; /* Current number of sockets. */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700697 /*
698 * Pressure flag: try to collapse.
699 * Technical note: it is used by multiple contexts non atomically.
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800700 * All the __sk_mem_schedule() is of this nature: accounting
Linus Torvalds1da177e2005-04-16 15:20:36 -0700701 * is strict, actions are advisory and have some latency.
702 */
703 int *memory_pressure;
704 int *sysctl_mem;
705 int *sysctl_wmem;
706 int *sysctl_rmem;
707 int max_header;
708
Eric Dumazet271b72c2008-10-29 02:11:14 -0700709 struct kmem_cache *slab;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700710 unsigned int obj_size;
Eric Dumazet271b72c2008-10-29 02:11:14 -0700711 int slab_flags;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700712
Eric Dumazetdd24c002008-11-25 21:17:14 -0800713 struct percpu_counter *orphan_count;
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700714
Arnaldo Carvalho de Melo60236fd2005-06-18 22:47:21 -0700715 struct request_sock_ops *rsk_prot;
Arnaldo Carvalho de Melo6d6ee432005-12-13 23:25:19 -0800716 struct timewait_sock_ops *twsk_prot;
Arnaldo Carvalho de Melo2e6599c2005-06-18 22:46:52 -0700717
Pavel Emelyanov39d8cda2008-03-22 16:50:58 -0700718 union {
719 struct inet_hashinfo *hashinfo;
Eric Dumazet645ca702008-10-29 01:41:45 -0700720 struct udp_table *udp_table;
Pavel Emelyanovfc8717b2008-03-22 16:56:51 -0700721 struct raw_hashinfo *raw_hash;
Pavel Emelyanov39d8cda2008-03-22 16:50:58 -0700722 } h;
Arnaldo Carvalho de Meloab1e0a12008-02-03 04:06:04 -0800723
Linus Torvalds1da177e2005-04-16 15:20:36 -0700724 struct module *owner;
725
726 char name[32];
727
728 struct list_head node;
Arnaldo Carvalho de Meloe6848972005-08-09 19:45:38 -0700729#ifdef SOCK_REFCNT_DEBUG
730 atomic_t socks;
731#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700732};
733
734extern int proto_register(struct proto *prot, int alloc_slab);
735extern void proto_unregister(struct proto *prot);
736
Arnaldo Carvalho de Meloe6848972005-08-09 19:45:38 -0700737#ifdef SOCK_REFCNT_DEBUG
738static inline void sk_refcnt_debug_inc(struct sock *sk)
739{
740 atomic_inc(&sk->sk_prot->socks);
741}
742
743static inline void sk_refcnt_debug_dec(struct sock *sk)
744{
745 atomic_dec(&sk->sk_prot->socks);
746 printk(KERN_DEBUG "%s socket %p released, %d are still alive\n",
747 sk->sk_prot->name, sk, atomic_read(&sk->sk_prot->socks));
748}
749
750static inline void sk_refcnt_debug_release(const struct sock *sk)
751{
752 if (atomic_read(&sk->sk_refcnt) != 1)
753 printk(KERN_DEBUG "Destruction of the %s socket %p delayed, refcnt=%d\n",
754 sk->sk_prot->name, sk, atomic_read(&sk->sk_refcnt));
755}
756#else /* SOCK_REFCNT_DEBUG */
757#define sk_refcnt_debug_inc(sk) do { } while (0)
758#define sk_refcnt_debug_dec(sk) do { } while (0)
759#define sk_refcnt_debug_release(sk) do { } while (0)
760#endif /* SOCK_REFCNT_DEBUG */
761
Eric Dumazet65f76512008-01-03 20:46:48 -0800762
763#ifdef CONFIG_PROC_FS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700764/* Called with local bh disabled */
Pavel Emelyanovc29a0bc2008-03-31 19:41:46 -0700765extern void sock_prot_inuse_add(struct net *net, struct proto *prot, int inc);
766extern int sock_prot_inuse_get(struct net *net, struct proto *proto);
Eric Dumazet65f76512008-01-03 20:46:48 -0800767#else
Pavel Emelyanovc29a0bc2008-03-31 19:41:46 -0700768static void inline sock_prot_inuse_add(struct net *net, struct proto *prot,
769 int inc)
Eric Dumazet65f76512008-01-03 20:46:48 -0800770{
771}
Eric Dumazet65f76512008-01-03 20:46:48 -0800772#endif
773
Linus Torvalds1da177e2005-04-16 15:20:36 -0700774
Arnaldo Carvalho de Melo614c6cb2005-08-09 19:47:37 -0700775/* With per-bucket locks this operation is not-atomic, so that
776 * this version is not worse.
777 */
778static inline void __sk_prot_rehash(struct sock *sk)
779{
780 sk->sk_prot->unhash(sk);
781 sk->sk_prot->hash(sk);
782}
783
Linus Torvalds1da177e2005-04-16 15:20:36 -0700784/* About 10 seconds */
785#define SOCK_DESTROY_TIME (10*HZ)
786
787/* Sockets 0-1023 can't be bound to unless you are superuser */
788#define PROT_SOCK 1024
789
790#define SHUTDOWN_MASK 3
791#define RCV_SHUTDOWN 1
792#define SEND_SHUTDOWN 2
793
794#define SOCK_SNDBUF_LOCK 1
795#define SOCK_RCVBUF_LOCK 2
796#define SOCK_BINDADDR_LOCK 4
797#define SOCK_BINDPORT_LOCK 8
798
799/* sock_iocb: used to kick off async processing of socket ios */
800struct sock_iocb {
801 struct list_head list;
802
803 int flags;
804 int size;
805 struct socket *sock;
806 struct sock *sk;
807 struct scm_cookie *scm;
808 struct msghdr *msg, async_msg;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700809 struct kiocb *kiocb;
810};
811
812static inline struct sock_iocb *kiocb_to_siocb(struct kiocb *iocb)
813{
814 return (struct sock_iocb *)iocb->private;
815}
816
817static inline struct kiocb *siocb_to_kiocb(struct sock_iocb *si)
818{
819 return si->kiocb;
820}
821
822struct socket_alloc {
823 struct socket socket;
824 struct inode vfs_inode;
825};
826
827static inline struct socket *SOCKET_I(struct inode *inode)
828{
829 return &container_of(inode, struct socket_alloc, vfs_inode)->socket;
830}
831
832static inline struct inode *SOCK_INODE(struct socket *socket)
833{
834 return &container_of(socket, struct socket_alloc, socket)->vfs_inode;
835}
836
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800837/*
838 * Functions for memory accounting
839 */
840extern int __sk_mem_schedule(struct sock *sk, int size, int kind);
841extern void __sk_mem_reclaim(struct sock *sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700842
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800843#define SK_MEM_QUANTUM ((int)PAGE_SIZE)
844#define SK_MEM_QUANTUM_SHIFT ilog2(SK_MEM_QUANTUM)
845#define SK_MEM_SEND 0
846#define SK_MEM_RECV 1
Linus Torvalds1da177e2005-04-16 15:20:36 -0700847
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800848static inline int sk_mem_pages(int amt)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700849{
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800850 return (amt + SK_MEM_QUANTUM - 1) >> SK_MEM_QUANTUM_SHIFT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700851}
852
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800853static inline int sk_has_account(struct sock *sk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700854{
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800855 /* return true if protocol supports memory accounting */
856 return !!sk->sk_prot->memory_allocated;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700857}
858
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800859static inline int sk_wmem_schedule(struct sock *sk, int size)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700860{
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800861 if (!sk_has_account(sk))
862 return 1;
Herbert Xud80d99d2005-09-01 17:48:23 -0700863 return size <= sk->sk_forward_alloc ||
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800864 __sk_mem_schedule(sk, size, SK_MEM_SEND);
865}
866
867static inline int sk_rmem_schedule(struct sock *sk, int size)
868{
869 if (!sk_has_account(sk))
870 return 1;
871 return size <= sk->sk_forward_alloc ||
872 __sk_mem_schedule(sk, size, SK_MEM_RECV);
873}
874
875static inline void sk_mem_reclaim(struct sock *sk)
876{
877 if (!sk_has_account(sk))
878 return;
879 if (sk->sk_forward_alloc >= SK_MEM_QUANTUM)
880 __sk_mem_reclaim(sk);
881}
882
David S. Miller9993e7d2008-01-10 21:56:38 -0800883static inline void sk_mem_reclaim_partial(struct sock *sk)
884{
885 if (!sk_has_account(sk))
886 return;
887 if (sk->sk_forward_alloc > SK_MEM_QUANTUM)
888 __sk_mem_reclaim(sk);
889}
890
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800891static inline void sk_mem_charge(struct sock *sk, int size)
892{
893 if (!sk_has_account(sk))
894 return;
895 sk->sk_forward_alloc -= size;
896}
897
898static inline void sk_mem_uncharge(struct sock *sk, int size)
899{
900 if (!sk_has_account(sk))
901 return;
902 sk->sk_forward_alloc += size;
903}
904
905static inline void sk_wmem_free_skb(struct sock *sk, struct sk_buff *skb)
906{
Hideo Aoki3ab224b2007-12-31 00:11:19 -0800907 sock_set_flag(sk, SOCK_QUEUE_SHRUNK);
908 sk->sk_wmem_queued -= skb->truesize;
909 sk_mem_uncharge(sk, skb->truesize);
910 __kfree_skb(skb);
Herbert Xud80d99d2005-09-01 17:48:23 -0700911}
912
Linus Torvalds1da177e2005-04-16 15:20:36 -0700913/* Used by processes to "lock" a socket state, so that
914 * interrupts and bottom half handlers won't change it
915 * from under us. It essentially blocks any incoming
916 * packets, so that we won't get any new data or any
917 * packets that change the state of the socket.
918 *
919 * While locked, BH processing will add new packets to
920 * the backlog queue. This queue is processed by the
921 * owner of the socket lock right before it is released.
922 *
923 * Since ~2.3.5 it is also exclusive sleep lock serializing
924 * accesses from user process context.
925 */
John Heffnerd2e91172007-09-12 10:44:19 +0200926#define sock_owned_by_user(sk) ((sk)->sk_lock.owned)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700927
Peter Zijlstraed075362006-12-06 20:35:24 -0800928/*
929 * Macro so as to not evaluate some arguments when
930 * lockdep is not enabled.
931 *
932 * Mark both the sk_lock and the sk_lock.slock as a
933 * per-address-family lock class.
934 */
935#define sock_lock_init_class_and_name(sk, sname, skey, name, key) \
936do { \
Ingo Molnare8f6fbf2008-11-12 01:38:36 +0000937 sk->sk_lock.owned = 0; \
Peter Zijlstraed075362006-12-06 20:35:24 -0800938 init_waitqueue_head(&sk->sk_lock.wq); \
939 spin_lock_init(&(sk)->sk_lock.slock); \
940 debug_check_no_locks_freed((void *)&(sk)->sk_lock, \
941 sizeof((sk)->sk_lock)); \
942 lockdep_set_class_and_name(&(sk)->sk_lock.slock, \
943 (skey), (sname)); \
944 lockdep_init_map(&(sk)->sk_lock.dep_map, (name), (key), 0); \
945} while (0)
946
Harvey Harrison41380932007-12-12 10:46:51 -0800947extern void lock_sock_nested(struct sock *sk, int subclass);
Peter Zijlstrafcc70d52006-11-08 22:44:35 -0800948
949static inline void lock_sock(struct sock *sk)
950{
951 lock_sock_nested(sk, 0);
952}
953
Harvey Harrison41380932007-12-12 10:46:51 -0800954extern void release_sock(struct sock *sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700955
956/* BH context may only use the following locking interface. */
957#define bh_lock_sock(__sk) spin_lock(&((__sk)->sk_lock.slock))
Ingo Molnarc6366182006-07-03 00:25:13 -0700958#define bh_lock_sock_nested(__sk) \
959 spin_lock_nested(&((__sk)->sk_lock.slock), \
960 SINGLE_DEPTH_NESTING)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700961#define bh_unlock_sock(__sk) spin_unlock(&((__sk)->sk_lock.slock))
962
Eric W. Biederman1b8d7ae2007-10-08 23:24:22 -0700963extern struct sock *sk_alloc(struct net *net, int family,
Al Virodd0fc662005-10-07 07:46:04 +0100964 gfp_t priority,
Pavel Emelyanov6257ff22007-11-01 00:39:31 -0700965 struct proto *prot);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700966extern void sk_free(struct sock *sk);
Denis V. Lunevedf02082008-02-29 11:18:32 -0800967extern void sk_release_kernel(struct sock *sk);
Arnaldo Carvalho de Melo87d11ce2005-08-09 20:10:12 -0700968extern struct sock *sk_clone(const struct sock *sk,
Al Virodd0fc662005-10-07 07:46:04 +0100969 const gfp_t priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700970
971extern struct sk_buff *sock_wmalloc(struct sock *sk,
972 unsigned long size, int force,
Al Virodd0fc662005-10-07 07:46:04 +0100973 gfp_t priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700974extern struct sk_buff *sock_rmalloc(struct sock *sk,
975 unsigned long size, int force,
Al Virodd0fc662005-10-07 07:46:04 +0100976 gfp_t priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700977extern void sock_wfree(struct sk_buff *skb);
978extern void sock_rfree(struct sk_buff *skb);
979
980extern int sock_setsockopt(struct socket *sock, int level,
981 int op, char __user *optval,
David S. Millerb7058842009-09-30 16:12:20 -0700982 unsigned int optlen);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700983
984extern int sock_getsockopt(struct socket *sock, int level,
985 int op, char __user *optval,
986 int __user *optlen);
987extern struct sk_buff *sock_alloc_send_skb(struct sock *sk,
988 unsigned long size,
989 int noblock,
990 int *errcode);
Herbert Xu4cc7f682009-02-04 16:55:54 -0800991extern struct sk_buff *sock_alloc_send_pskb(struct sock *sk,
992 unsigned long header_len,
993 unsigned long data_len,
994 int noblock,
995 int *errcode);
Victor Fusco86a76ca2005-07-08 14:57:47 -0700996extern void *sock_kmalloc(struct sock *sk, int size,
Al Virodd0fc662005-10-07 07:46:04 +0100997 gfp_t priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700998extern void sock_kfree_s(struct sock *sk, void *mem, int size);
999extern void sk_send_sigurg(struct sock *sk);
1000
1001/*
1002 * Functions to fill in entries in struct proto_ops when a protocol
1003 * does not implement a particular function.
1004 */
1005extern int sock_no_bind(struct socket *,
1006 struct sockaddr *, int);
1007extern int sock_no_connect(struct socket *,
1008 struct sockaddr *, int, int);
1009extern int sock_no_socketpair(struct socket *,
1010 struct socket *);
1011extern int sock_no_accept(struct socket *,
1012 struct socket *, int);
1013extern int sock_no_getname(struct socket *,
1014 struct sockaddr *, int *, int);
1015extern unsigned int sock_no_poll(struct file *, struct socket *,
1016 struct poll_table_struct *);
1017extern int sock_no_ioctl(struct socket *, unsigned int,
1018 unsigned long);
1019extern int sock_no_listen(struct socket *, int);
1020extern int sock_no_shutdown(struct socket *, int);
1021extern int sock_no_getsockopt(struct socket *, int , int,
1022 char __user *, int __user *);
1023extern int sock_no_setsockopt(struct socket *, int, int,
David S. Millerb7058842009-09-30 16:12:20 -07001024 char __user *, unsigned int);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001025extern int sock_no_sendmsg(struct kiocb *, struct socket *,
1026 struct msghdr *, size_t);
1027extern int sock_no_recvmsg(struct kiocb *, struct socket *,
1028 struct msghdr *, size_t, int);
1029extern int sock_no_mmap(struct file *file,
1030 struct socket *sock,
1031 struct vm_area_struct *vma);
1032extern ssize_t sock_no_sendpage(struct socket *sock,
1033 struct page *page,
1034 int offset, size_t size,
1035 int flags);
1036
1037/*
1038 * Functions to fill in entries in struct proto_ops when a protocol
1039 * uses the inet style.
1040 */
1041extern int sock_common_getsockopt(struct socket *sock, int level, int optname,
1042 char __user *optval, int __user *optlen);
1043extern int sock_common_recvmsg(struct kiocb *iocb, struct socket *sock,
1044 struct msghdr *msg, size_t size, int flags);
1045extern int sock_common_setsockopt(struct socket *sock, int level, int optname,
David S. Millerb7058842009-09-30 16:12:20 -07001046 char __user *optval, unsigned int optlen);
Dmitry Mishin3fdadf72006-03-20 22:45:21 -08001047extern int compat_sock_common_getsockopt(struct socket *sock, int level,
1048 int optname, char __user *optval, int __user *optlen);
1049extern int compat_sock_common_setsockopt(struct socket *sock, int level,
David S. Millerb7058842009-09-30 16:12:20 -07001050 int optname, char __user *optval, unsigned int optlen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001051
1052extern void sk_common_release(struct sock *sk);
1053
1054/*
1055 * Default socket callbacks and setup code
1056 */
1057
1058/* Initialise core socket variables */
1059extern void sock_init_data(struct socket *sock, struct sock *sk);
1060
1061/**
Ben Hutchings1a5778a2010-02-14 22:35:47 -08001062 * sk_filter_release - release a socket filter
Paul Bonserdc9b3342006-11-23 17:56:13 -08001063 * @fp: filter to remove
1064 *
1065 * Remove a filter from a socket and release its resources.
1066 */
1067
Pavel Emelyanov309dd5f2007-10-17 21:21:51 -07001068static inline void sk_filter_release(struct sk_filter *fp)
1069{
1070 if (atomic_dec_and_test(&fp->refcnt))
Pavel Emelyanov47e958e2007-10-17 21:22:42 -07001071 kfree(fp);
Pavel Emelyanov309dd5f2007-10-17 21:21:51 -07001072}
1073
1074static inline void sk_filter_uncharge(struct sock *sk, struct sk_filter *fp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001075{
1076 unsigned int size = sk_filter_len(fp);
1077
1078 atomic_sub(size, &sk->sk_omem_alloc);
Pavel Emelyanov309dd5f2007-10-17 21:21:51 -07001079 sk_filter_release(fp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001080}
1081
1082static inline void sk_filter_charge(struct sock *sk, struct sk_filter *fp)
1083{
1084 atomic_inc(&fp->refcnt);
1085 atomic_add(sk_filter_len(fp), &sk->sk_omem_alloc);
1086}
1087
1088/*
1089 * Socket reference counting postulates.
1090 *
1091 * * Each user of socket SHOULD hold a reference count.
1092 * * Each access point to socket (an hash table bucket, reference from a list,
1093 * running timer, skb in flight MUST hold a reference count.
1094 * * When reference count hits 0, it means it will never increase back.
1095 * * When reference count hits 0, it means that no references from
1096 * outside exist to this socket and current process on current CPU
1097 * is last user and may/should destroy this socket.
1098 * * sk_free is called from any context: process, BH, IRQ. When
1099 * it is called, socket has no references from outside -> sk_free
1100 * may release descendant resources allocated by the socket, but
1101 * to the time when it is called, socket is NOT referenced by any
1102 * hash tables, lists etc.
1103 * * Packets, delivered from outside (from network or from another process)
1104 * and enqueued on receive/error queues SHOULD NOT grab reference count,
1105 * when they sit in queue. Otherwise, packets will leak to hole, when
1106 * socket is looked up by one cpu and unhasing is made by another CPU.
1107 * It is true for udp/raw, netlink (leak to receive and error queues), tcp
1108 * (leak to backlog). Packet socket does all the processing inside
1109 * BR_NETPROTO_LOCK, so that it has not this race condition. UNIX sockets
1110 * use separate SMP lock, so that they are prone too.
1111 */
1112
1113/* Ungrab socket and destroy it, if it was the last reference. */
1114static inline void sock_put(struct sock *sk)
1115{
1116 if (atomic_dec_and_test(&sk->sk_refcnt))
1117 sk_free(sk);
1118}
1119
Arnaldo Carvalho de Melo58a5a7b2006-11-16 14:06:06 -02001120extern int sk_receive_skb(struct sock *sk, struct sk_buff *skb,
1121 const int nested);
Arnaldo Carvalho de Melo25995ff2005-12-27 02:42:22 -02001122
Krishna Kumare022f0b2009-10-19 23:46:20 +00001123static inline void sk_tx_queue_set(struct sock *sk, int tx_queue)
1124{
1125 sk->sk_tx_queue_mapping = tx_queue;
1126}
1127
1128static inline void sk_tx_queue_clear(struct sock *sk)
1129{
1130 sk->sk_tx_queue_mapping = -1;
1131}
1132
1133static inline int sk_tx_queue_get(const struct sock *sk)
1134{
1135 return sk->sk_tx_queue_mapping;
1136}
1137
1138static inline bool sk_tx_queue_recorded(const struct sock *sk)
1139{
1140 return (sk && sk->sk_tx_queue_mapping >= 0);
1141}
1142
David S. Miller972692e2008-06-17 22:41:38 -07001143static inline void sk_set_socket(struct sock *sk, struct socket *sock)
1144{
Krishna Kumare022f0b2009-10-19 23:46:20 +00001145 sk_tx_queue_clear(sk);
David S. Miller972692e2008-06-17 22:41:38 -07001146 sk->sk_socket = sock;
1147}
1148
Linus Torvalds1da177e2005-04-16 15:20:36 -07001149/* Detach socket from process context.
1150 * Announce socket dead, detach it from wait queue and inode.
1151 * Note that parent inode held reference count on this struct sock,
1152 * we do not release it in this function, because protocol
1153 * probably wants some additional cleanups or even continuing
1154 * to work with this socket (TCP).
1155 */
1156static inline void sock_orphan(struct sock *sk)
1157{
1158 write_lock_bh(&sk->sk_callback_lock);
1159 sock_set_flag(sk, SOCK_DEAD);
David S. Miller972692e2008-06-17 22:41:38 -07001160 sk_set_socket(sk, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001161 sk->sk_sleep = NULL;
1162 write_unlock_bh(&sk->sk_callback_lock);
1163}
1164
1165static inline void sock_graft(struct sock *sk, struct socket *parent)
1166{
1167 write_lock_bh(&sk->sk_callback_lock);
1168 sk->sk_sleep = &parent->wait;
1169 parent->sk = sk;
David S. Miller972692e2008-06-17 22:41:38 -07001170 sk_set_socket(sk, parent);
Venkat Yekkirala4237c752006-07-24 23:32:50 -07001171 security_sock_graft(sk, parent);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001172 write_unlock_bh(&sk->sk_callback_lock);
1173}
1174
1175extern int sock_i_uid(struct sock *sk);
1176extern unsigned long sock_i_ino(struct sock *sk);
1177
1178static inline struct dst_entry *
1179__sk_dst_get(struct sock *sk)
1180{
1181 return sk->sk_dst_cache;
1182}
1183
1184static inline struct dst_entry *
1185sk_dst_get(struct sock *sk)
1186{
1187 struct dst_entry *dst;
1188
1189 read_lock(&sk->sk_dst_lock);
1190 dst = sk->sk_dst_cache;
1191 if (dst)
1192 dst_hold(dst);
1193 read_unlock(&sk->sk_dst_lock);
1194 return dst;
1195}
1196
1197static inline void
1198__sk_dst_set(struct sock *sk, struct dst_entry *dst)
1199{
1200 struct dst_entry *old_dst;
1201
Krishna Kumare022f0b2009-10-19 23:46:20 +00001202 sk_tx_queue_clear(sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001203 old_dst = sk->sk_dst_cache;
1204 sk->sk_dst_cache = dst;
1205 dst_release(old_dst);
1206}
1207
1208static inline void
1209sk_dst_set(struct sock *sk, struct dst_entry *dst)
1210{
1211 write_lock(&sk->sk_dst_lock);
1212 __sk_dst_set(sk, dst);
1213 write_unlock(&sk->sk_dst_lock);
1214}
1215
1216static inline void
1217__sk_dst_reset(struct sock *sk)
1218{
1219 struct dst_entry *old_dst;
1220
Krishna Kumare022f0b2009-10-19 23:46:20 +00001221 sk_tx_queue_clear(sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001222 old_dst = sk->sk_dst_cache;
1223 sk->sk_dst_cache = NULL;
1224 dst_release(old_dst);
1225}
1226
1227static inline void
1228sk_dst_reset(struct sock *sk)
1229{
1230 write_lock(&sk->sk_dst_lock);
1231 __sk_dst_reset(sk);
1232 write_unlock(&sk->sk_dst_lock);
1233}
1234
Denis Vlasenkof0088a52006-03-28 01:08:21 -08001235extern struct dst_entry *__sk_dst_check(struct sock *sk, u32 cookie);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001236
Denis Vlasenkof0088a52006-03-28 01:08:21 -08001237extern struct dst_entry *sk_dst_check(struct sock *sk, u32 cookie);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001238
Herbert Xubcd76112006-06-30 13:36:35 -07001239static inline int sk_can_gso(const struct sock *sk)
1240{
1241 return net_gso_ok(sk->sk_route_caps, sk->sk_gso_type);
1242}
1243
Andi Kleen99580892007-04-20 17:12:43 -07001244extern void sk_setup_caps(struct sock *sk, struct dst_entry *dst);
Arnaldo Carvalho de Melo6cbb0df2005-08-09 19:49:02 -07001245
Linus Torvalds1da177e2005-04-16 15:20:36 -07001246static inline int skb_copy_to_page(struct sock *sk, char __user *from,
1247 struct sk_buff *skb, struct page *page,
1248 int off, int copy)
1249{
1250 if (skb->ip_summed == CHECKSUM_NONE) {
1251 int err = 0;
Al Viro50842052006-11-14 21:36:34 -08001252 __wsum csum = csum_and_copy_from_user(from,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001253 page_address(page) + off,
1254 copy, 0, &err);
1255 if (err)
1256 return err;
1257 skb->csum = csum_block_add(skb->csum, csum, skb->len);
1258 } else if (copy_from_user(page_address(page) + off, from, copy))
1259 return -EFAULT;
1260
1261 skb->len += copy;
1262 skb->data_len += copy;
1263 skb->truesize += copy;
1264 sk->sk_wmem_queued += copy;
Hideo Aoki3ab224b2007-12-31 00:11:19 -08001265 sk_mem_charge(sk, copy);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001266 return 0;
1267}
1268
Eric Dumazetc5640392009-06-16 10:12:03 +00001269/**
1270 * sk_wmem_alloc_get - returns write allocations
1271 * @sk: socket
1272 *
1273 * Returns sk_wmem_alloc minus initial offset of one
1274 */
1275static inline int sk_wmem_alloc_get(const struct sock *sk)
1276{
1277 return atomic_read(&sk->sk_wmem_alloc) - 1;
1278}
1279
1280/**
1281 * sk_rmem_alloc_get - returns read allocations
1282 * @sk: socket
1283 *
1284 * Returns sk_rmem_alloc
1285 */
1286static inline int sk_rmem_alloc_get(const struct sock *sk)
1287{
1288 return atomic_read(&sk->sk_rmem_alloc);
1289}
1290
1291/**
1292 * sk_has_allocations - check if allocations are outstanding
1293 * @sk: socket
1294 *
1295 * Returns true if socket has write or read allocations
1296 */
1297static inline int sk_has_allocations(const struct sock *sk)
1298{
1299 return sk_wmem_alloc_get(sk) || sk_rmem_alloc_get(sk);
1300}
1301
Jiri Olsaa57de0b2009-07-08 12:09:13 +00001302/**
1303 * sk_has_sleeper - check if there are any waiting processes
1304 * @sk: socket
1305 *
1306 * Returns true if socket has waiting processes
1307 *
1308 * The purpose of the sk_has_sleeper and sock_poll_wait is to wrap the memory
1309 * barrier call. They were added due to the race found within the tcp code.
1310 *
1311 * Consider following tcp code paths:
1312 *
1313 * CPU1 CPU2
1314 *
1315 * sys_select receive packet
1316 * ... ...
1317 * __add_wait_queue update tp->rcv_nxt
1318 * ... ...
1319 * tp->rcv_nxt check sock_def_readable
1320 * ... {
1321 * schedule ...
1322 * if (sk->sk_sleep && waitqueue_active(sk->sk_sleep))
1323 * wake_up_interruptible(sk->sk_sleep)
1324 * ...
1325 * }
1326 *
1327 * The race for tcp fires when the __add_wait_queue changes done by CPU1 stay
1328 * in its cache, and so does the tp->rcv_nxt update on CPU2 side. The CPU1
1329 * could then endup calling schedule and sleep forever if there are no more
1330 * data on the socket.
Jiri Olsaad462762009-07-08 12:10:31 +00001331 *
1332 * The sk_has_sleeper is always called right after a call to read_lock, so we
1333 * can use smp_mb__after_lock barrier.
Jiri Olsaa57de0b2009-07-08 12:09:13 +00001334 */
1335static inline int sk_has_sleeper(struct sock *sk)
1336{
1337 /*
1338 * We need to be sure we are in sync with the
1339 * add_wait_queue modifications to the wait queue.
1340 *
1341 * This memory barrier is paired in the sock_poll_wait.
1342 */
Jiri Olsaad462762009-07-08 12:10:31 +00001343 smp_mb__after_lock();
Jiri Olsaa57de0b2009-07-08 12:09:13 +00001344 return sk->sk_sleep && waitqueue_active(sk->sk_sleep);
1345}
1346
1347/**
1348 * sock_poll_wait - place memory barrier behind the poll_wait call.
1349 * @filp: file
1350 * @wait_address: socket wait queue
1351 * @p: poll_table
1352 *
1353 * See the comments in the sk_has_sleeper function.
1354 */
1355static inline void sock_poll_wait(struct file *filp,
1356 wait_queue_head_t *wait_address, poll_table *p)
1357{
1358 if (p && wait_address) {
1359 poll_wait(filp, wait_address, p);
1360 /*
1361 * We need to be sure we are in sync with the
1362 * socket flags modification.
1363 *
1364 * This memory barrier is paired in the sk_has_sleeper.
1365 */
1366 smp_mb();
1367 }
1368}
1369
Linus Torvalds1da177e2005-04-16 15:20:36 -07001370/*
1371 * Queue a received datagram if it will fit. Stream and sequenced
1372 * protocols can't normally use this as they need to fit buffers in
1373 * and play with them.
1374 *
1375 * Inlined as it's very short and called for pretty much every
1376 * packet ever received.
1377 */
1378
1379static inline void skb_set_owner_w(struct sk_buff *skb, struct sock *sk)
1380{
Herbert Xud55d87f2009-06-22 02:25:25 +00001381 skb_orphan(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001382 skb->sk = sk;
1383 skb->destructor = sock_wfree;
Eric Dumazet2b85a342009-06-11 02:55:43 -07001384 /*
1385 * We used to take a refcount on sk, but following operation
1386 * is enough to guarantee sk_free() wont free this sock until
1387 * all in-flight packets are completed
1388 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001389 atomic_add(skb->truesize, &sk->sk_wmem_alloc);
1390}
1391
1392static inline void skb_set_owner_r(struct sk_buff *skb, struct sock *sk)
1393{
Herbert Xud55d87f2009-06-22 02:25:25 +00001394 skb_orphan(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001395 skb->sk = sk;
1396 skb->destructor = sock_rfree;
1397 atomic_add(skb->truesize, &sk->sk_rmem_alloc);
Hideo Aoki3ab224b2007-12-31 00:11:19 -08001398 sk_mem_charge(sk, skb->truesize);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001399}
1400
1401extern void sk_reset_timer(struct sock *sk, struct timer_list* timer,
1402 unsigned long expires);
1403
1404extern void sk_stop_timer(struct sock *sk, struct timer_list* timer);
1405
Denis Vlasenkof0088a52006-03-28 01:08:21 -08001406extern int sock_queue_rcv_skb(struct sock *sk, struct sk_buff *skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001407
1408static inline int sock_queue_err_skb(struct sock *sk, struct sk_buff *skb)
1409{
1410 /* Cast skb->rcvbuf to unsigned... It's pointless, but reduces
1411 number of warnings when compiling with -W --ANK
1412 */
1413 if (atomic_read(&sk->sk_rmem_alloc) + skb->truesize >=
1414 (unsigned)sk->sk_rcvbuf)
1415 return -ENOMEM;
1416 skb_set_owner_r(skb, sk);
1417 skb_queue_tail(&sk->sk_error_queue, skb);
1418 if (!sock_flag(sk, SOCK_DEAD))
1419 sk->sk_data_ready(sk, skb->len);
1420 return 0;
1421}
1422
1423/*
1424 * Recover an error report and clear atomically
1425 */
1426
1427static inline int sock_error(struct sock *sk)
1428{
Benjamin LaHaisec1cbe4b2005-12-13 23:22:19 -08001429 int err;
1430 if (likely(!sk->sk_err))
1431 return 0;
1432 err = xchg(&sk->sk_err, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001433 return -err;
1434}
1435
1436static inline unsigned long sock_wspace(struct sock *sk)
1437{
1438 int amt = 0;
1439
1440 if (!(sk->sk_shutdown & SEND_SHUTDOWN)) {
1441 amt = sk->sk_sndbuf - atomic_read(&sk->sk_wmem_alloc);
1442 if (amt < 0)
1443 amt = 0;
1444 }
1445 return amt;
1446}
1447
1448static inline void sk_wake_async(struct sock *sk, int how, int band)
1449{
Eric Dumazetbcdce712009-10-06 17:28:29 -07001450 if (sock_flag(sk, SOCK_FASYNC))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001451 sock_wake_async(sk->sk_socket, how, band);
1452}
1453
1454#define SOCK_MIN_SNDBUF 2048
1455#define SOCK_MIN_RCVBUF 256
1456
1457static inline void sk_stream_moderate_sndbuf(struct sock *sk)
1458{
1459 if (!(sk->sk_userlocks & SOCK_SNDBUF_LOCK)) {
Eric Dumazet8df09ea2007-12-21 03:07:41 -08001460 sk->sk_sndbuf = min(sk->sk_sndbuf, sk->sk_wmem_queued >> 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001461 sk->sk_sndbuf = max(sk->sk_sndbuf, SOCK_MIN_SNDBUF);
1462 }
1463}
1464
Pavel Emelyanovdf97c702007-11-29 21:22:33 +11001465struct sk_buff *sk_stream_alloc_skb(struct sock *sk, int size, gfp_t gfp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001466
1467static inline struct page *sk_stream_alloc_page(struct sock *sk)
1468{
1469 struct page *page = NULL;
1470
Herbert Xuef015782005-09-01 17:48:59 -07001471 page = alloc_pages(sk->sk_allocation, 0);
1472 if (!page) {
Pavel Emelyanov5c52ba12008-07-16 20:28:10 -07001473 sk->sk_prot->enter_memory_pressure(sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001474 sk_stream_moderate_sndbuf(sk);
1475 }
1476 return page;
1477}
1478
Linus Torvalds1da177e2005-04-16 15:20:36 -07001479/*
1480 * Default write policy as shown to user space via poll/select/SIGIO
1481 */
1482static inline int sock_writeable(const struct sock *sk)
1483{
Eric Dumazet8df09ea2007-12-21 03:07:41 -08001484 return atomic_read(&sk->sk_wmem_alloc) < (sk->sk_sndbuf >> 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001485}
1486
Al Virodd0fc662005-10-07 07:46:04 +01001487static inline gfp_t gfp_any(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001488{
Andrew Morton99709372009-02-12 16:43:17 -08001489 return in_softirq() ? GFP_ATOMIC : GFP_KERNEL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001490}
1491
1492static inline long sock_rcvtimeo(const struct sock *sk, int noblock)
1493{
1494 return noblock ? 0 : sk->sk_rcvtimeo;
1495}
1496
1497static inline long sock_sndtimeo(const struct sock *sk, int noblock)
1498{
1499 return noblock ? 0 : sk->sk_sndtimeo;
1500}
1501
1502static inline int sock_rcvlowat(const struct sock *sk, int waitall, int len)
1503{
1504 return (waitall ? len : min_t(int, sk->sk_rcvlowat, len)) ? : 1;
1505}
1506
1507/* Alas, with timeout socket operations are not restartable.
1508 * Compare this to poll().
1509 */
1510static inline int sock_intr_errno(long timeo)
1511{
1512 return timeo == MAX_SCHEDULE_TIMEOUT ? -ERESTARTSYS : -EINTR;
1513}
1514
Eric Dumazet92f37fd2007-03-25 22:14:49 -07001515extern void __sock_recv_timestamp(struct msghdr *msg, struct sock *sk,
1516 struct sk_buff *skb);
1517
Linus Torvalds1da177e2005-04-16 15:20:36 -07001518static __inline__ void
1519sock_recv_timestamp(struct msghdr *msg, struct sock *sk, struct sk_buff *skb)
1520{
Eric Dumazetb7aa0bf2007-04-19 16:16:32 -07001521 ktime_t kt = skb->tstamp;
Patrick Ohly20d49472009-02-12 05:03:38 +00001522 struct skb_shared_hwtstamps *hwtstamps = skb_hwtstamps(skb);
Patrick McHardya61bbcf2005-08-14 17:24:31 -07001523
Patrick Ohly20d49472009-02-12 05:03:38 +00001524 /*
1525 * generate control messages if
1526 * - receive time stamping in software requested (SOCK_RCVTSTAMP
1527 * or SOCK_TIMESTAMPING_RX_SOFTWARE)
1528 * - software time stamp available and wanted
1529 * (SOCK_TIMESTAMPING_SOFTWARE)
1530 * - hardware time stamps available and wanted
1531 * (SOCK_TIMESTAMPING_SYS_HARDWARE or
1532 * SOCK_TIMESTAMPING_RAW_HARDWARE)
1533 */
1534 if (sock_flag(sk, SOCK_RCVTSTAMP) ||
1535 sock_flag(sk, SOCK_TIMESTAMPING_RX_SOFTWARE) ||
1536 (kt.tv64 && sock_flag(sk, SOCK_TIMESTAMPING_SOFTWARE)) ||
1537 (hwtstamps->hwtstamp.tv64 &&
1538 sock_flag(sk, SOCK_TIMESTAMPING_RAW_HARDWARE)) ||
1539 (hwtstamps->syststamp.tv64 &&
1540 sock_flag(sk, SOCK_TIMESTAMPING_SYS_HARDWARE)))
Eric Dumazet92f37fd2007-03-25 22:14:49 -07001541 __sock_recv_timestamp(msg, sk, skb);
1542 else
Eric Dumazetb7aa0bf2007-04-19 16:16:32 -07001543 sk->sk_stamp = kt;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001544}
1545
Neil Horman3b885782009-10-12 13:26:31 -07001546extern void sock_recv_ts_and_drops(struct msghdr *msg, struct sock *sk, struct sk_buff *skb);
1547
Linus Torvalds1da177e2005-04-16 15:20:36 -07001548/**
Patrick Ohly20d49472009-02-12 05:03:38 +00001549 * sock_tx_timestamp - checks whether the outgoing packet is to be time stamped
1550 * @msg: outgoing packet
1551 * @sk: socket sending this packet
1552 * @shtx: filled with instructions for time stamping
1553 *
1554 * Currently only depends on SOCK_TIMESTAMPING* flags. Returns error code if
1555 * parameters are invalid.
1556 */
1557extern int sock_tx_timestamp(struct msghdr *msg,
1558 struct sock *sk,
1559 union skb_shared_tx *shtx);
1560
1561
1562/**
Linus Torvalds1da177e2005-04-16 15:20:36 -07001563 * sk_eat_skb - Release a skb if it is no longer needed
Pavel Pisa4dc3b162005-05-01 08:59:25 -07001564 * @sk: socket to eat this skb from
1565 * @skb: socket buffer to eat
Randy Dunlapf4b8ea72006-06-22 16:00:11 -07001566 * @copied_early: flag indicating whether DMA operations copied this data early
Linus Torvalds1da177e2005-04-16 15:20:36 -07001567 *
1568 * This routine must be called with interrupts disabled or with the socket
1569 * locked so that the sk_buff queue operation is ok.
1570*/
Chris Leech624d1162006-05-23 18:01:28 -07001571#ifdef CONFIG_NET_DMA
1572static inline void sk_eat_skb(struct sock *sk, struct sk_buff *skb, int copied_early)
1573{
1574 __skb_unlink(skb, &sk->sk_receive_queue);
1575 if (!copied_early)
1576 __kfree_skb(skb);
1577 else
1578 __skb_queue_tail(&sk->sk_async_wait_queue, skb);
1579}
1580#else
1581static inline void sk_eat_skb(struct sock *sk, struct sk_buff *skb, int copied_early)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001582{
1583 __skb_unlink(skb, &sk->sk_receive_queue);
1584 __kfree_skb(skb);
1585}
Chris Leech624d1162006-05-23 18:01:28 -07001586#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07001587
YOSHIFUJI Hideaki3b1e0a62008-03-26 02:26:21 +09001588static inline
1589struct net *sock_net(const struct sock *sk)
1590{
1591#ifdef CONFIG_NET_NS
1592 return sk->sk_net;
1593#else
1594 return &init_net;
1595#endif
1596}
1597
1598static inline
Denis V. Lunevf5aa23f2008-03-26 00:48:17 -07001599void sock_net_set(struct sock *sk, struct net *net)
YOSHIFUJI Hideaki3b1e0a62008-03-26 02:26:21 +09001600{
1601#ifdef CONFIG_NET_NS
1602 sk->sk_net = net;
1603#endif
1604}
1605
Denis V. Lunevedf02082008-02-29 11:18:32 -08001606/*
1607 * Kernel sockets, f.e. rtnl or icmp_socket, are a part of a namespace.
1608 * They should not hold a referrence to a namespace in order to allow
1609 * to stop it.
1610 * Sockets after sk_change_net should be released using sk_release_kernel
1611 */
1612static inline void sk_change_net(struct sock *sk, struct net *net)
1613{
YOSHIFUJI Hideaki3b1e0a62008-03-26 02:26:21 +09001614 put_net(sock_net(sk));
Denis V. Lunev65a18ec2008-04-16 01:59:46 -07001615 sock_net_set(sk, hold_net(net));
Denis V. Lunevedf02082008-02-29 11:18:32 -08001616}
1617
KOVACS Krisztian23542612008-10-07 12:41:01 -07001618static inline struct sock *skb_steal_sock(struct sk_buff *skb)
1619{
1620 if (unlikely(skb->sk)) {
1621 struct sock *sk = skb->sk;
1622
1623 skb->destructor = NULL;
1624 skb->sk = NULL;
1625 return sk;
1626 }
1627 return NULL;
1628}
1629
Patrick Ohly20d49472009-02-12 05:03:38 +00001630extern void sock_enable_timestamp(struct sock *sk, int flag);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001631extern int sock_get_timestamp(struct sock *, struct timeval __user *);
Eric Dumazetae40eb12007-03-18 17:33:16 -07001632extern int sock_get_timestampns(struct sock *, struct timespec __user *);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001633
1634/*
1635 * Enable debug/info messages
1636 */
Stephen Hemmingera2a316f2007-03-08 20:41:08 -08001637extern int net_msg_warn;
1638#define NETDEBUG(fmt, args...) \
1639 do { if (net_msg_warn) printk(fmt,##args); } while (0)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001640
Stephen Hemmingera2a316f2007-03-08 20:41:08 -08001641#define LIMIT_NETDEBUG(fmt, args...) \
1642 do { if (net_msg_warn && net_ratelimit()) printk(fmt,##args); } while(0)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001643
Linus Torvalds1da177e2005-04-16 15:20:36 -07001644extern __u32 sysctl_wmem_max;
1645extern __u32 sysctl_rmem_max;
1646
Arnaldo Carvalho de Melo20380732005-08-16 02:18:02 -03001647extern void sk_init(void);
1648
David S. Miller6baf1f42005-09-05 18:14:11 -07001649extern int sysctl_optmem_max;
1650
Arnaldo Carvalho de Melo20380732005-08-16 02:18:02 -03001651extern __u32 sysctl_wmem_default;
1652extern __u32 sysctl_rmem_default;
Arnaldo Carvalho de Melo20380732005-08-16 02:18:02 -03001653
Linus Torvalds1da177e2005-04-16 15:20:36 -07001654#endif /* _SOCK_H */