blob: 48cc337a6566bfb93ef4968b3843c24245306d86 [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
43#include <linux/config.h>
44#include <linux/list.h>
45#include <linux/timer.h>
46#include <linux/cache.h>
47#include <linux/module.h>
48#include <linux/netdevice.h>
49#include <linux/skbuff.h> /* struct sk_buff */
50#include <linux/security.h>
51
52#include <linux/filter.h>
53
54#include <asm/atomic.h>
55#include <net/dst.h>
56#include <net/checksum.h>
57
58/*
59 * This structure really needs to be cleaned up.
60 * Most of it is for TCP, and not used by any of
61 * the other protocols.
62 */
63
64/* Define this to get the SOCK_DBG debugging facility. */
65#define SOCK_DEBUGGING
66#ifdef SOCK_DEBUGGING
67#define SOCK_DEBUG(sk, msg...) do { if ((sk) && sock_flag((sk), SOCK_DBG)) \
68 printk(KERN_DEBUG msg); } while (0)
69#else
70#define SOCK_DEBUG(sk, msg...) do { } while (0)
71#endif
72
73/* This is the per-socket lock. The spinlock provides a synchronization
74 * between user contexts and software interrupt processing, whereas the
75 * mini-semaphore synchronizes multiple users amongst themselves.
76 */
77struct sock_iocb;
78typedef struct {
79 spinlock_t slock;
80 struct sock_iocb *owner;
81 wait_queue_head_t wq;
82} socket_lock_t;
83
84#define sock_lock_init(__sk) \
85do { spin_lock_init(&((__sk)->sk_lock.slock)); \
86 (__sk)->sk_lock.owner = NULL; \
87 init_waitqueue_head(&((__sk)->sk_lock.wq)); \
88} while(0)
89
90struct sock;
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -070091struct proto;
Linus Torvalds1da177e2005-04-16 15:20:36 -070092
93/**
Pavel Pisa4dc3b162005-05-01 08:59:25 -070094 * struct sock_common - minimal network layer representation of sockets
95 * @skc_family: network address family
96 * @skc_state: Connection state
97 * @skc_reuse: %SO_REUSEADDR setting
98 * @skc_bound_dev_if: bound device index if != 0
99 * @skc_node: main hash linkage for various protocol lookup tables
100 * @skc_bind_node: bind hash linkage for various protocol lookup tables
101 * @skc_refcnt: reference count
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700102 * @skc_prot: protocol handlers inside a network family
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700103 *
104 * This is the minimal network layer representation of sockets, the header
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700105 * for struct sock and struct inet_timewait_sock.
106 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700107struct sock_common {
108 unsigned short skc_family;
109 volatile unsigned char skc_state;
110 unsigned char skc_reuse;
111 int skc_bound_dev_if;
112 struct hlist_node skc_node;
113 struct hlist_node skc_bind_node;
114 atomic_t skc_refcnt;
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700115 struct proto *skc_prot;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700116};
117
118/**
119 * struct sock - network layer representation of sockets
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700120 * @__sk_common: shared layout with inet_timewait_sock
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700121 * @sk_shutdown: mask of %SEND_SHUTDOWN and/or %RCV_SHUTDOWN
122 * @sk_userlocks: %SO_SNDBUF and %SO_RCVBUF settings
123 * @sk_lock: synchronizer
124 * @sk_rcvbuf: size of receive buffer in bytes
125 * @sk_sleep: sock wait queue
126 * @sk_dst_cache: destination cache
127 * @sk_dst_lock: destination cache lock
128 * @sk_policy: flow policy
129 * @sk_rmem_alloc: receive queue bytes committed
130 * @sk_receive_queue: incoming packets
131 * @sk_wmem_alloc: transmit queue bytes committed
132 * @sk_write_queue: Packet sending queue
133 * @sk_omem_alloc: "o" is "option" or "other"
134 * @sk_wmem_queued: persistent queue size
135 * @sk_forward_alloc: space allocated forward
136 * @sk_allocation: allocation mode
137 * @sk_sndbuf: size of send buffer in bytes
138 * @sk_flags: %SO_LINGER (l_onoff), %SO_BROADCAST, %SO_KEEPALIVE, %SO_OOBINLINE settings
139 * @sk_no_check: %SO_NO_CHECK setting, wether or not checkup packets
140 * @sk_route_caps: route capabilities (e.g. %NETIF_F_TSO)
141 * @sk_lingertime: %SO_LINGER l_linger setting
Arnaldo Carvalho de Melo6e04e022005-08-09 20:07:35 -0700142 * @sk_hashent: hash entry in several tables (e.g. inet_hashinfo.ehash)
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700143 * @sk_backlog: always used with the per-socket spinlock held
144 * @sk_callback_lock: used with the callbacks in the end of this struct
145 * @sk_error_queue: rarely used
Arnaldo Carvalho de Melo476e19c2005-05-05 13:35:15 -0700146 * @sk_prot_creator: sk_prot of original sock creator (see ipv6_setsockopt, IPV6_ADDRFORM for instance)
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700147 * @sk_err: last error
148 * @sk_err_soft: errors that don't cause failure but are the cause of a persistent failure not just 'timed out'
149 * @sk_ack_backlog: current listen backlog
150 * @sk_max_ack_backlog: listen backlog set in listen()
151 * @sk_priority: %SO_PRIORITY setting
152 * @sk_type: socket type (%SOCK_STREAM, etc)
153 * @sk_protocol: which protocol this socket belongs in this network family
154 * @sk_peercred: %SO_PEERCRED setting
155 * @sk_rcvlowat: %SO_RCVLOWAT setting
156 * @sk_rcvtimeo: %SO_RCVTIMEO setting
157 * @sk_sndtimeo: %SO_SNDTIMEO setting
158 * @sk_filter: socket filtering instructions
159 * @sk_protinfo: private area, net family specific, when not using slab
160 * @sk_timer: sock cleanup timer
161 * @sk_stamp: time stamp of last packet received
162 * @sk_socket: Identd and reporting IO signals
163 * @sk_user_data: RPC layer private data
164 * @sk_sndmsg_page: cached page for sendmsg
165 * @sk_sndmsg_off: cached offset for sendmsg
166 * @sk_send_head: front of stuff to transmit
Martin Waitz67be2dd2005-05-01 08:59:26 -0700167 * @sk_security: used by security modules
Pavel Pisa4dc3b162005-05-01 08:59:25 -0700168 * @sk_write_pending: a write to stream socket waits to start
169 * @sk_state_change: callback to indicate change in the state of the sock
170 * @sk_data_ready: callback to indicate there is data to be processed
171 * @sk_write_space: callback to indicate there is bf sending space available
172 * @sk_error_report: callback to indicate errors (e.g. %MSG_ERRQUEUE)
173 * @sk_backlog_rcv: callback to process the backlog
174 * @sk_destruct: called at sock freeing time, i.e. when all refcnt == 0
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175 */
176struct sock {
177 /*
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700178 * Now struct inet_timewait_sock also uses sock_common, so please just
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179 * don't add nothing before this first member (__sk_common) --acme
180 */
181 struct sock_common __sk_common;
182#define sk_family __sk_common.skc_family
183#define sk_state __sk_common.skc_state
184#define sk_reuse __sk_common.skc_reuse
185#define sk_bound_dev_if __sk_common.skc_bound_dev_if
186#define sk_node __sk_common.skc_node
187#define sk_bind_node __sk_common.skc_bind_node
188#define sk_refcnt __sk_common.skc_refcnt
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700189#define sk_prot __sk_common.skc_prot
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190 unsigned char sk_shutdown : 2,
191 sk_no_check : 2,
192 sk_userlocks : 4;
193 unsigned char sk_protocol;
194 unsigned short sk_type;
195 int sk_rcvbuf;
196 socket_lock_t sk_lock;
197 wait_queue_head_t *sk_sleep;
198 struct dst_entry *sk_dst_cache;
199 struct xfrm_policy *sk_policy[2];
200 rwlock_t sk_dst_lock;
201 atomic_t sk_rmem_alloc;
202 atomic_t sk_wmem_alloc;
203 atomic_t sk_omem_alloc;
204 struct sk_buff_head sk_receive_queue;
205 struct sk_buff_head sk_write_queue;
206 int sk_wmem_queued;
207 int sk_forward_alloc;
208 unsigned int sk_allocation;
209 int sk_sndbuf;
210 int sk_route_caps;
211 int sk_hashent;
212 unsigned long sk_flags;
213 unsigned long sk_lingertime;
214 /*
215 * The backlog queue is special, it is always used with
216 * the per-socket spinlock held and requires low latency
217 * access. Therefore we special case it's implementation.
218 */
219 struct {
220 struct sk_buff *head;
221 struct sk_buff *tail;
222 } sk_backlog;
223 struct sk_buff_head sk_error_queue;
Arnaldo Carvalho de Melo476e19c2005-05-05 13:35:15 -0700224 struct proto *sk_prot_creator;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225 rwlock_t sk_callback_lock;
226 int sk_err,
227 sk_err_soft;
228 unsigned short sk_ack_backlog;
229 unsigned short sk_max_ack_backlog;
230 __u32 sk_priority;
231 struct ucred sk_peercred;
232 int sk_rcvlowat;
233 long sk_rcvtimeo;
234 long sk_sndtimeo;
235 struct sk_filter *sk_filter;
236 void *sk_protinfo;
237 struct timer_list sk_timer;
238 struct timeval sk_stamp;
239 struct socket *sk_socket;
240 void *sk_user_data;
241 struct page *sk_sndmsg_page;
242 struct sk_buff *sk_send_head;
243 __u32 sk_sndmsg_off;
244 int sk_write_pending;
245 void *sk_security;
246 void (*sk_state_change)(struct sock *sk);
247 void (*sk_data_ready)(struct sock *sk, int bytes);
248 void (*sk_write_space)(struct sock *sk);
249 void (*sk_error_report)(struct sock *sk);
250 int (*sk_backlog_rcv)(struct sock *sk,
251 struct sk_buff *skb);
252 void (*sk_destruct)(struct sock *sk);
253};
254
255/*
256 * Hashed lists helper routines
257 */
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700258static inline struct sock *__sk_head(const struct hlist_head *head)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259{
260 return hlist_entry(head->first, struct sock, sk_node);
261}
262
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700263static inline struct sock *sk_head(const struct hlist_head *head)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264{
265 return hlist_empty(head) ? NULL : __sk_head(head);
266}
267
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700268static inline struct sock *sk_next(const struct sock *sk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700269{
270 return sk->sk_node.next ?
271 hlist_entry(sk->sk_node.next, struct sock, sk_node) : NULL;
272}
273
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700274static inline int sk_unhashed(const struct sock *sk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275{
276 return hlist_unhashed(&sk->sk_node);
277}
278
Arnaldo Carvalho de Meloe48c4142005-08-09 20:09:46 -0700279static inline int sk_hashed(const struct sock *sk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280{
281 return sk->sk_node.pprev != NULL;
282}
283
284static __inline__ void sk_node_init(struct hlist_node *node)
285{
286 node->pprev = NULL;
287}
288
289static __inline__ void __sk_del_node(struct sock *sk)
290{
291 __hlist_del(&sk->sk_node);
292}
293
294static __inline__ int __sk_del_node_init(struct sock *sk)
295{
296 if (sk_hashed(sk)) {
297 __sk_del_node(sk);
298 sk_node_init(&sk->sk_node);
299 return 1;
300 }
301 return 0;
302}
303
304/* Grab socket reference count. This operation is valid only
305 when sk is ALREADY grabbed f.e. it is found in hash table
306 or a list and the lookup is made under lock preventing hash table
307 modifications.
308 */
309
310static inline void sock_hold(struct sock *sk)
311{
312 atomic_inc(&sk->sk_refcnt);
313}
314
315/* Ungrab socket in the context, which assumes that socket refcnt
316 cannot hit zero, f.e. it is true in context of any socketcall.
317 */
318static inline void __sock_put(struct sock *sk)
319{
320 atomic_dec(&sk->sk_refcnt);
321}
322
323static __inline__ int sk_del_node_init(struct sock *sk)
324{
325 int rc = __sk_del_node_init(sk);
326
327 if (rc) {
328 /* paranoid for a while -acme */
329 WARN_ON(atomic_read(&sk->sk_refcnt) == 1);
330 __sock_put(sk);
331 }
332 return rc;
333}
334
335static __inline__ void __sk_add_node(struct sock *sk, struct hlist_head *list)
336{
337 hlist_add_head(&sk->sk_node, list);
338}
339
340static __inline__ void sk_add_node(struct sock *sk, struct hlist_head *list)
341{
342 sock_hold(sk);
343 __sk_add_node(sk, list);
344}
345
346static __inline__ void __sk_del_bind_node(struct sock *sk)
347{
348 __hlist_del(&sk->sk_bind_node);
349}
350
351static __inline__ void sk_add_bind_node(struct sock *sk,
352 struct hlist_head *list)
353{
354 hlist_add_head(&sk->sk_bind_node, list);
355}
356
357#define sk_for_each(__sk, node, list) \
358 hlist_for_each_entry(__sk, node, list, sk_node)
359#define sk_for_each_from(__sk, node) \
360 if (__sk && ({ node = &(__sk)->sk_node; 1; })) \
361 hlist_for_each_entry_from(__sk, node, sk_node)
362#define sk_for_each_continue(__sk, node) \
363 if (__sk && ({ node = &(__sk)->sk_node; 1; })) \
364 hlist_for_each_entry_continue(__sk, node, sk_node)
365#define sk_for_each_safe(__sk, node, tmp, list) \
366 hlist_for_each_entry_safe(__sk, node, tmp, list, sk_node)
367#define sk_for_each_bound(__sk, node, list) \
368 hlist_for_each_entry(__sk, node, list, sk_bind_node)
369
370/* Sock flags */
371enum sock_flags {
372 SOCK_DEAD,
373 SOCK_DONE,
374 SOCK_URGINLINE,
375 SOCK_KEEPOPEN,
376 SOCK_LINGER,
377 SOCK_DESTROY,
378 SOCK_BROADCAST,
379 SOCK_TIMESTAMP,
380 SOCK_ZAPPED,
381 SOCK_USE_WRITE_QUEUE, /* whether to call sk->sk_write_space in sock_wfree */
382 SOCK_DBG, /* %SO_DEBUG setting */
383 SOCK_RCVTSTAMP, /* %SO_TIMESTAMP setting */
384 SOCK_NO_LARGESEND, /* whether to sent large segments or not */
385 SOCK_LOCALROUTE, /* route locally only, %SO_DONTROUTE setting */
386 SOCK_QUEUE_SHRUNK, /* write queue has been shrunk recently */
387};
388
Ralf Baechle53b924b2005-08-23 10:11:30 -0700389static inline void sock_copy_flags(struct sock *nsk, struct sock *osk)
390{
391 nsk->sk_flags = osk->sk_flags;
392}
393
Linus Torvalds1da177e2005-04-16 15:20:36 -0700394static inline void sock_set_flag(struct sock *sk, enum sock_flags flag)
395{
396 __set_bit(flag, &sk->sk_flags);
397}
398
399static inline void sock_reset_flag(struct sock *sk, enum sock_flags flag)
400{
401 __clear_bit(flag, &sk->sk_flags);
402}
403
404static inline int sock_flag(struct sock *sk, enum sock_flags flag)
405{
406 return test_bit(flag, &sk->sk_flags);
407}
408
409static inline void sk_acceptq_removed(struct sock *sk)
410{
411 sk->sk_ack_backlog--;
412}
413
414static inline void sk_acceptq_added(struct sock *sk)
415{
416 sk->sk_ack_backlog++;
417}
418
419static inline int sk_acceptq_is_full(struct sock *sk)
420{
421 return sk->sk_ack_backlog > sk->sk_max_ack_backlog;
422}
423
424/*
425 * Compute minimal free write space needed to queue new packets.
426 */
427static inline int sk_stream_min_wspace(struct sock *sk)
428{
429 return sk->sk_wmem_queued / 2;
430}
431
432static inline int sk_stream_wspace(struct sock *sk)
433{
434 return sk->sk_sndbuf - sk->sk_wmem_queued;
435}
436
437extern void sk_stream_write_space(struct sock *sk);
438
439static inline int sk_stream_memory_free(struct sock *sk)
440{
441 return sk->sk_wmem_queued < sk->sk_sndbuf;
442}
443
444extern void sk_stream_rfree(struct sk_buff *skb);
445
446static inline void sk_stream_set_owner_r(struct sk_buff *skb, struct sock *sk)
447{
448 skb->sk = sk;
449 skb->destructor = sk_stream_rfree;
450 atomic_add(skb->truesize, &sk->sk_rmem_alloc);
451 sk->sk_forward_alloc -= skb->truesize;
452}
453
454static inline void sk_stream_free_skb(struct sock *sk, struct sk_buff *skb)
455{
456 sock_set_flag(sk, SOCK_QUEUE_SHRUNK);
457 sk->sk_wmem_queued -= skb->truesize;
458 sk->sk_forward_alloc += skb->truesize;
459 __kfree_skb(skb);
460}
461
462/* The per-socket spinlock must be held here. */
463#define sk_add_backlog(__sk, __skb) \
464do { if (!(__sk)->sk_backlog.tail) { \
465 (__sk)->sk_backlog.head = \
466 (__sk)->sk_backlog.tail = (__skb); \
467 } else { \
468 ((__sk)->sk_backlog.tail)->next = (__skb); \
469 (__sk)->sk_backlog.tail = (__skb); \
470 } \
471 (__skb)->next = NULL; \
472} while(0)
473
474#define sk_wait_event(__sk, __timeo, __condition) \
475({ int rc; \
476 release_sock(__sk); \
477 rc = __condition; \
478 if (!rc) { \
479 *(__timeo) = schedule_timeout(*(__timeo)); \
480 rc = __condition; \
481 } \
482 lock_sock(__sk); \
483 rc; \
484})
485
486extern int sk_stream_wait_connect(struct sock *sk, long *timeo_p);
487extern int sk_stream_wait_memory(struct sock *sk, long *timeo_p);
488extern void sk_stream_wait_close(struct sock *sk, long timeo_p);
489extern int sk_stream_error(struct sock *sk, int flags, int err);
490extern void sk_stream_kill_queues(struct sock *sk);
491
492extern int sk_wait_data(struct sock *sk, long *timeo);
493
Arnaldo Carvalho de Melo60236fd2005-06-18 22:47:21 -0700494struct request_sock_ops;
Arnaldo Carvalho de Melo2e6599c2005-06-18 22:46:52 -0700495
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496/* Networking protocol blocks we attach to sockets.
497 * socket layer -> transport layer interface
498 * transport -> network interface is defined by struct inet_proto
499 */
500struct proto {
501 void (*close)(struct sock *sk,
502 long timeout);
503 int (*connect)(struct sock *sk,
504 struct sockaddr *uaddr,
505 int addr_len);
506 int (*disconnect)(struct sock *sk, int flags);
507
508 struct sock * (*accept) (struct sock *sk, int flags, int *err);
509
510 int (*ioctl)(struct sock *sk, int cmd,
511 unsigned long arg);
512 int (*init)(struct sock *sk);
513 int (*destroy)(struct sock *sk);
514 void (*shutdown)(struct sock *sk, int how);
515 int (*setsockopt)(struct sock *sk, int level,
516 int optname, char __user *optval,
517 int optlen);
518 int (*getsockopt)(struct sock *sk, int level,
519 int optname, char __user *optval,
520 int __user *option);
521 int (*sendmsg)(struct kiocb *iocb, struct sock *sk,
522 struct msghdr *msg, size_t len);
523 int (*recvmsg)(struct kiocb *iocb, struct sock *sk,
524 struct msghdr *msg,
525 size_t len, int noblock, int flags,
526 int *addr_len);
527 int (*sendpage)(struct sock *sk, struct page *page,
528 int offset, size_t size, int flags);
529 int (*bind)(struct sock *sk,
530 struct sockaddr *uaddr, int addr_len);
531
532 int (*backlog_rcv) (struct sock *sk,
533 struct sk_buff *skb);
534
535 /* Keeping track of sk's, looking them up, and port selection methods. */
536 void (*hash)(struct sock *sk);
537 void (*unhash)(struct sock *sk);
538 int (*get_port)(struct sock *sk, unsigned short snum);
539
540 /* Memory pressure */
541 void (*enter_memory_pressure)(void);
542 atomic_t *memory_allocated; /* Current allocated memory. */
543 atomic_t *sockets_allocated; /* Current number of sockets. */
544 /*
545 * Pressure flag: try to collapse.
546 * Technical note: it is used by multiple contexts non atomically.
547 * All the sk_stream_mem_schedule() is of this nature: accounting
548 * is strict, actions are advisory and have some latency.
549 */
550 int *memory_pressure;
551 int *sysctl_mem;
552 int *sysctl_wmem;
553 int *sysctl_rmem;
554 int max_header;
555
556 kmem_cache_t *slab;
557 unsigned int obj_size;
558
Arnaldo Carvalho de Melo8feaf0c02005-08-09 20:09:30 -0700559 kmem_cache_t *twsk_slab;
560 unsigned int twsk_obj_size;
561
Arnaldo Carvalho de Melo60236fd2005-06-18 22:47:21 -0700562 struct request_sock_ops *rsk_prot;
Arnaldo Carvalho de Melo2e6599c2005-06-18 22:46:52 -0700563
Linus Torvalds1da177e2005-04-16 15:20:36 -0700564 struct module *owner;
565
566 char name[32];
567
568 struct list_head node;
Arnaldo Carvalho de Meloe6848972005-08-09 19:45:38 -0700569#ifdef SOCK_REFCNT_DEBUG
570 atomic_t socks;
571#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700572 struct {
573 int inuse;
574 u8 __pad[SMP_CACHE_BYTES - sizeof(int)];
575 } stats[NR_CPUS];
576};
577
578extern int proto_register(struct proto *prot, int alloc_slab);
579extern void proto_unregister(struct proto *prot);
580
Arnaldo Carvalho de Meloe6848972005-08-09 19:45:38 -0700581#ifdef SOCK_REFCNT_DEBUG
582static inline void sk_refcnt_debug_inc(struct sock *sk)
583{
584 atomic_inc(&sk->sk_prot->socks);
585}
586
587static inline void sk_refcnt_debug_dec(struct sock *sk)
588{
589 atomic_dec(&sk->sk_prot->socks);
590 printk(KERN_DEBUG "%s socket %p released, %d are still alive\n",
591 sk->sk_prot->name, sk, atomic_read(&sk->sk_prot->socks));
592}
593
594static inline void sk_refcnt_debug_release(const struct sock *sk)
595{
596 if (atomic_read(&sk->sk_refcnt) != 1)
597 printk(KERN_DEBUG "Destruction of the %s socket %p delayed, refcnt=%d\n",
598 sk->sk_prot->name, sk, atomic_read(&sk->sk_refcnt));
599}
600#else /* SOCK_REFCNT_DEBUG */
601#define sk_refcnt_debug_inc(sk) do { } while (0)
602#define sk_refcnt_debug_dec(sk) do { } while (0)
603#define sk_refcnt_debug_release(sk) do { } while (0)
604#endif /* SOCK_REFCNT_DEBUG */
605
Linus Torvalds1da177e2005-04-16 15:20:36 -0700606/* Called with local bh disabled */
607static __inline__ void sock_prot_inc_use(struct proto *prot)
608{
609 prot->stats[smp_processor_id()].inuse++;
610}
611
612static __inline__ void sock_prot_dec_use(struct proto *prot)
613{
614 prot->stats[smp_processor_id()].inuse--;
615}
616
Arnaldo Carvalho de Melo614c6cb2005-08-09 19:47:37 -0700617/* With per-bucket locks this operation is not-atomic, so that
618 * this version is not worse.
619 */
620static inline void __sk_prot_rehash(struct sock *sk)
621{
622 sk->sk_prot->unhash(sk);
623 sk->sk_prot->hash(sk);
624}
625
Linus Torvalds1da177e2005-04-16 15:20:36 -0700626/* About 10 seconds */
627#define SOCK_DESTROY_TIME (10*HZ)
628
629/* Sockets 0-1023 can't be bound to unless you are superuser */
630#define PROT_SOCK 1024
631
632#define SHUTDOWN_MASK 3
633#define RCV_SHUTDOWN 1
634#define SEND_SHUTDOWN 2
635
636#define SOCK_SNDBUF_LOCK 1
637#define SOCK_RCVBUF_LOCK 2
638#define SOCK_BINDADDR_LOCK 4
639#define SOCK_BINDPORT_LOCK 8
640
641/* sock_iocb: used to kick off async processing of socket ios */
642struct sock_iocb {
643 struct list_head list;
644
645 int flags;
646 int size;
647 struct socket *sock;
648 struct sock *sk;
649 struct scm_cookie *scm;
650 struct msghdr *msg, async_msg;
651 struct iovec async_iov;
652 struct kiocb *kiocb;
653};
654
655static inline struct sock_iocb *kiocb_to_siocb(struct kiocb *iocb)
656{
657 return (struct sock_iocb *)iocb->private;
658}
659
660static inline struct kiocb *siocb_to_kiocb(struct sock_iocb *si)
661{
662 return si->kiocb;
663}
664
665struct socket_alloc {
666 struct socket socket;
667 struct inode vfs_inode;
668};
669
670static inline struct socket *SOCKET_I(struct inode *inode)
671{
672 return &container_of(inode, struct socket_alloc, vfs_inode)->socket;
673}
674
675static inline struct inode *SOCK_INODE(struct socket *socket)
676{
677 return &container_of(socket, struct socket_alloc, socket)->vfs_inode;
678}
679
680extern void __sk_stream_mem_reclaim(struct sock *sk);
681extern int sk_stream_mem_schedule(struct sock *sk, int size, int kind);
682
683#define SK_STREAM_MEM_QUANTUM ((int)PAGE_SIZE)
684
685static inline int sk_stream_pages(int amt)
686{
687 return (amt + SK_STREAM_MEM_QUANTUM - 1) / SK_STREAM_MEM_QUANTUM;
688}
689
690static inline void sk_stream_mem_reclaim(struct sock *sk)
691{
692 if (sk->sk_forward_alloc >= SK_STREAM_MEM_QUANTUM)
693 __sk_stream_mem_reclaim(sk);
694}
695
696static inline void sk_stream_writequeue_purge(struct sock *sk)
697{
698 struct sk_buff *skb;
699
700 while ((skb = __skb_dequeue(&sk->sk_write_queue)) != NULL)
701 sk_stream_free_skb(sk, skb);
702 sk_stream_mem_reclaim(sk);
703}
704
705static inline int sk_stream_rmem_schedule(struct sock *sk, struct sk_buff *skb)
706{
707 return (int)skb->truesize <= sk->sk_forward_alloc ||
708 sk_stream_mem_schedule(sk, skb->truesize, 1);
709}
710
711/* Used by processes to "lock" a socket state, so that
712 * interrupts and bottom half handlers won't change it
713 * from under us. It essentially blocks any incoming
714 * packets, so that we won't get any new data or any
715 * packets that change the state of the socket.
716 *
717 * While locked, BH processing will add new packets to
718 * the backlog queue. This queue is processed by the
719 * owner of the socket lock right before it is released.
720 *
721 * Since ~2.3.5 it is also exclusive sleep lock serializing
722 * accesses from user process context.
723 */
724#define sock_owned_by_user(sk) ((sk)->sk_lock.owner)
725
726extern void FASTCALL(lock_sock(struct sock *sk));
727extern void FASTCALL(release_sock(struct sock *sk));
728
729/* BH context may only use the following locking interface. */
730#define bh_lock_sock(__sk) spin_lock(&((__sk)->sk_lock.slock))
731#define bh_unlock_sock(__sk) spin_unlock(&((__sk)->sk_lock.slock))
732
Victor Fusco86a76ca2005-07-08 14:57:47 -0700733extern struct sock *sk_alloc(int family,
734 unsigned int __nocast priority,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700735 struct proto *prot, int zero_it);
736extern void sk_free(struct sock *sk);
Arnaldo Carvalho de Melo87d11ce2005-08-09 20:10:12 -0700737extern struct sock *sk_clone(const struct sock *sk,
738 const unsigned int __nocast priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700739
740extern struct sk_buff *sock_wmalloc(struct sock *sk,
741 unsigned long size, int force,
Victor Fusco86a76ca2005-07-08 14:57:47 -0700742 unsigned int __nocast priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700743extern struct sk_buff *sock_rmalloc(struct sock *sk,
744 unsigned long size, int force,
Victor Fusco86a76ca2005-07-08 14:57:47 -0700745 unsigned int __nocast priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700746extern void sock_wfree(struct sk_buff *skb);
747extern void sock_rfree(struct sk_buff *skb);
748
749extern int sock_setsockopt(struct socket *sock, int level,
750 int op, char __user *optval,
751 int optlen);
752
753extern int sock_getsockopt(struct socket *sock, int level,
754 int op, char __user *optval,
755 int __user *optlen);
756extern struct sk_buff *sock_alloc_send_skb(struct sock *sk,
757 unsigned long size,
758 int noblock,
759 int *errcode);
Victor Fusco86a76ca2005-07-08 14:57:47 -0700760extern void *sock_kmalloc(struct sock *sk, int size,
761 unsigned int __nocast priority);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700762extern void sock_kfree_s(struct sock *sk, void *mem, int size);
763extern void sk_send_sigurg(struct sock *sk);
764
765/*
766 * Functions to fill in entries in struct proto_ops when a protocol
767 * does not implement a particular function.
768 */
769extern int sock_no_bind(struct socket *,
770 struct sockaddr *, int);
771extern int sock_no_connect(struct socket *,
772 struct sockaddr *, int, int);
773extern int sock_no_socketpair(struct socket *,
774 struct socket *);
775extern int sock_no_accept(struct socket *,
776 struct socket *, int);
777extern int sock_no_getname(struct socket *,
778 struct sockaddr *, int *, int);
779extern unsigned int sock_no_poll(struct file *, struct socket *,
780 struct poll_table_struct *);
781extern int sock_no_ioctl(struct socket *, unsigned int,
782 unsigned long);
783extern int sock_no_listen(struct socket *, int);
784extern int sock_no_shutdown(struct socket *, int);
785extern int sock_no_getsockopt(struct socket *, int , int,
786 char __user *, int __user *);
787extern int sock_no_setsockopt(struct socket *, int, int,
788 char __user *, int);
789extern int sock_no_sendmsg(struct kiocb *, struct socket *,
790 struct msghdr *, size_t);
791extern int sock_no_recvmsg(struct kiocb *, struct socket *,
792 struct msghdr *, size_t, int);
793extern int sock_no_mmap(struct file *file,
794 struct socket *sock,
795 struct vm_area_struct *vma);
796extern ssize_t sock_no_sendpage(struct socket *sock,
797 struct page *page,
798 int offset, size_t size,
799 int flags);
800
801/*
802 * Functions to fill in entries in struct proto_ops when a protocol
803 * uses the inet style.
804 */
805extern int sock_common_getsockopt(struct socket *sock, int level, int optname,
806 char __user *optval, int __user *optlen);
807extern int sock_common_recvmsg(struct kiocb *iocb, struct socket *sock,
808 struct msghdr *msg, size_t size, int flags);
809extern int sock_common_setsockopt(struct socket *sock, int level, int optname,
810 char __user *optval, int optlen);
811
812extern void sk_common_release(struct sock *sk);
813
814/*
815 * Default socket callbacks and setup code
816 */
817
818/* Initialise core socket variables */
819extern void sock_init_data(struct socket *sock, struct sock *sk);
820
821/**
822 * sk_filter - run a packet through a socket filter
823 * @sk: sock associated with &sk_buff
824 * @skb: buffer to filter
825 * @needlock: set to 1 if the sock is not locked by caller.
826 *
827 * Run the filter code and then cut skb->data to correct size returned by
828 * sk_run_filter. If pkt_len is 0 we toss packet. If skb->len is smaller
829 * than pkt_len we keep whole skb->data. This is the socket level
830 * wrapper to sk_run_filter. It returns 0 if the packet should
831 * be accepted or -EPERM if the packet should be tossed.
832 *
833 */
834
835static inline int sk_filter(struct sock *sk, struct sk_buff *skb, int needlock)
836{
837 int err;
838
839 err = security_sock_rcv_skb(sk, skb);
840 if (err)
841 return err;
842
843 if (sk->sk_filter) {
844 struct sk_filter *filter;
845
846 if (needlock)
847 bh_lock_sock(sk);
848
849 filter = sk->sk_filter;
850 if (filter) {
851 int pkt_len = sk_run_filter(skb, filter->insns,
852 filter->len);
853 if (!pkt_len)
854 err = -EPERM;
855 else
856 skb_trim(skb, pkt_len);
857 }
858
859 if (needlock)
860 bh_unlock_sock(sk);
861 }
862 return err;
863}
864
865/**
866 * sk_filter_release: Release a socket filter
867 * @sk: socket
868 * @fp: filter to remove
869 *
870 * Remove a filter from a socket and release its resources.
871 */
872
873static inline void sk_filter_release(struct sock *sk, struct sk_filter *fp)
874{
875 unsigned int size = sk_filter_len(fp);
876
877 atomic_sub(size, &sk->sk_omem_alloc);
878
879 if (atomic_dec_and_test(&fp->refcnt))
880 kfree(fp);
881}
882
883static inline void sk_filter_charge(struct sock *sk, struct sk_filter *fp)
884{
885 atomic_inc(&fp->refcnt);
886 atomic_add(sk_filter_len(fp), &sk->sk_omem_alloc);
887}
888
889/*
890 * Socket reference counting postulates.
891 *
892 * * Each user of socket SHOULD hold a reference count.
893 * * Each access point to socket (an hash table bucket, reference from a list,
894 * running timer, skb in flight MUST hold a reference count.
895 * * When reference count hits 0, it means it will never increase back.
896 * * When reference count hits 0, it means that no references from
897 * outside exist to this socket and current process on current CPU
898 * is last user and may/should destroy this socket.
899 * * sk_free is called from any context: process, BH, IRQ. When
900 * it is called, socket has no references from outside -> sk_free
901 * may release descendant resources allocated by the socket, but
902 * to the time when it is called, socket is NOT referenced by any
903 * hash tables, lists etc.
904 * * Packets, delivered from outside (from network or from another process)
905 * and enqueued on receive/error queues SHOULD NOT grab reference count,
906 * when they sit in queue. Otherwise, packets will leak to hole, when
907 * socket is looked up by one cpu and unhasing is made by another CPU.
908 * It is true for udp/raw, netlink (leak to receive and error queues), tcp
909 * (leak to backlog). Packet socket does all the processing inside
910 * BR_NETPROTO_LOCK, so that it has not this race condition. UNIX sockets
911 * use separate SMP lock, so that they are prone too.
912 */
913
914/* Ungrab socket and destroy it, if it was the last reference. */
915static inline void sock_put(struct sock *sk)
916{
917 if (atomic_dec_and_test(&sk->sk_refcnt))
918 sk_free(sk);
919}
920
921/* Detach socket from process context.
922 * Announce socket dead, detach it from wait queue and inode.
923 * Note that parent inode held reference count on this struct sock,
924 * we do not release it in this function, because protocol
925 * probably wants some additional cleanups or even continuing
926 * to work with this socket (TCP).
927 */
928static inline void sock_orphan(struct sock *sk)
929{
930 write_lock_bh(&sk->sk_callback_lock);
931 sock_set_flag(sk, SOCK_DEAD);
932 sk->sk_socket = NULL;
933 sk->sk_sleep = NULL;
934 write_unlock_bh(&sk->sk_callback_lock);
935}
936
937static inline void sock_graft(struct sock *sk, struct socket *parent)
938{
939 write_lock_bh(&sk->sk_callback_lock);
940 sk->sk_sleep = &parent->wait;
941 parent->sk = sk;
942 sk->sk_socket = parent;
943 write_unlock_bh(&sk->sk_callback_lock);
944}
945
946extern int sock_i_uid(struct sock *sk);
947extern unsigned long sock_i_ino(struct sock *sk);
948
949static inline struct dst_entry *
950__sk_dst_get(struct sock *sk)
951{
952 return sk->sk_dst_cache;
953}
954
955static inline struct dst_entry *
956sk_dst_get(struct sock *sk)
957{
958 struct dst_entry *dst;
959
960 read_lock(&sk->sk_dst_lock);
961 dst = sk->sk_dst_cache;
962 if (dst)
963 dst_hold(dst);
964 read_unlock(&sk->sk_dst_lock);
965 return dst;
966}
967
968static inline void
969__sk_dst_set(struct sock *sk, struct dst_entry *dst)
970{
971 struct dst_entry *old_dst;
972
973 old_dst = sk->sk_dst_cache;
974 sk->sk_dst_cache = dst;
975 dst_release(old_dst);
976}
977
978static inline void
979sk_dst_set(struct sock *sk, struct dst_entry *dst)
980{
981 write_lock(&sk->sk_dst_lock);
982 __sk_dst_set(sk, dst);
983 write_unlock(&sk->sk_dst_lock);
984}
985
986static inline void
987__sk_dst_reset(struct sock *sk)
988{
989 struct dst_entry *old_dst;
990
991 old_dst = sk->sk_dst_cache;
992 sk->sk_dst_cache = NULL;
993 dst_release(old_dst);
994}
995
996static inline void
997sk_dst_reset(struct sock *sk)
998{
999 write_lock(&sk->sk_dst_lock);
1000 __sk_dst_reset(sk);
1001 write_unlock(&sk->sk_dst_lock);
1002}
1003
1004static inline struct dst_entry *
1005__sk_dst_check(struct sock *sk, u32 cookie)
1006{
1007 struct dst_entry *dst = sk->sk_dst_cache;
1008
1009 if (dst && dst->obsolete && dst->ops->check(dst, cookie) == NULL) {
1010 sk->sk_dst_cache = NULL;
1011 dst_release(dst);
1012 return NULL;
1013 }
1014
1015 return dst;
1016}
1017
1018static inline struct dst_entry *
1019sk_dst_check(struct sock *sk, u32 cookie)
1020{
1021 struct dst_entry *dst = sk_dst_get(sk);
1022
1023 if (dst && dst->obsolete && dst->ops->check(dst, cookie) == NULL) {
1024 sk_dst_reset(sk);
1025 dst_release(dst);
1026 return NULL;
1027 }
1028
1029 return dst;
1030}
1031
Arnaldo Carvalho de Melo6cbb0df2005-08-09 19:49:02 -07001032static inline void sk_setup_caps(struct sock *sk, struct dst_entry *dst)
1033{
1034 __sk_dst_set(sk, dst);
1035 sk->sk_route_caps = dst->dev->features;
1036 if (sk->sk_route_caps & NETIF_F_TSO) {
1037 if (sock_flag(sk, SOCK_NO_LARGESEND) || dst->header_len)
1038 sk->sk_route_caps &= ~NETIF_F_TSO;
1039 }
1040}
1041
Linus Torvalds1da177e2005-04-16 15:20:36 -07001042static inline void sk_charge_skb(struct sock *sk, struct sk_buff *skb)
1043{
1044 sk->sk_wmem_queued += skb->truesize;
1045 sk->sk_forward_alloc -= skb->truesize;
1046}
1047
1048static inline int skb_copy_to_page(struct sock *sk, char __user *from,
1049 struct sk_buff *skb, struct page *page,
1050 int off, int copy)
1051{
1052 if (skb->ip_summed == CHECKSUM_NONE) {
1053 int err = 0;
1054 unsigned int csum = csum_and_copy_from_user(from,
1055 page_address(page) + off,
1056 copy, 0, &err);
1057 if (err)
1058 return err;
1059 skb->csum = csum_block_add(skb->csum, csum, skb->len);
1060 } else if (copy_from_user(page_address(page) + off, from, copy))
1061 return -EFAULT;
1062
1063 skb->len += copy;
1064 skb->data_len += copy;
1065 skb->truesize += copy;
1066 sk->sk_wmem_queued += copy;
1067 sk->sk_forward_alloc -= copy;
1068 return 0;
1069}
1070
1071/*
1072 * Queue a received datagram if it will fit. Stream and sequenced
1073 * protocols can't normally use this as they need to fit buffers in
1074 * and play with them.
1075 *
1076 * Inlined as it's very short and called for pretty much every
1077 * packet ever received.
1078 */
1079
1080static inline void skb_set_owner_w(struct sk_buff *skb, struct sock *sk)
1081{
1082 sock_hold(sk);
1083 skb->sk = sk;
1084 skb->destructor = sock_wfree;
1085 atomic_add(skb->truesize, &sk->sk_wmem_alloc);
1086}
1087
1088static inline void skb_set_owner_r(struct sk_buff *skb, struct sock *sk)
1089{
1090 skb->sk = sk;
1091 skb->destructor = sock_rfree;
1092 atomic_add(skb->truesize, &sk->sk_rmem_alloc);
1093}
1094
1095extern void sk_reset_timer(struct sock *sk, struct timer_list* timer,
1096 unsigned long expires);
1097
1098extern void sk_stop_timer(struct sock *sk, struct timer_list* timer);
1099
1100static inline int sock_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
1101{
1102 int err = 0;
1103 int skb_len;
1104
1105 /* Cast skb->rcvbuf to unsigned... It's pointless, but reduces
1106 number of warnings when compiling with -W --ANK
1107 */
1108 if (atomic_read(&sk->sk_rmem_alloc) + skb->truesize >=
1109 (unsigned)sk->sk_rcvbuf) {
1110 err = -ENOMEM;
1111 goto out;
1112 }
1113
1114 /* It would be deadlock, if sock_queue_rcv_skb is used
1115 with socket lock! We assume that users of this
1116 function are lock free.
1117 */
1118 err = sk_filter(sk, skb, 1);
1119 if (err)
1120 goto out;
1121
1122 skb->dev = NULL;
1123 skb_set_owner_r(skb, sk);
1124
1125 /* Cache the SKB length before we tack it onto the receive
1126 * queue. Once it is added it no longer belongs to us and
1127 * may be freed by other threads of control pulling packets
1128 * from the queue.
1129 */
1130 skb_len = skb->len;
1131
1132 skb_queue_tail(&sk->sk_receive_queue, skb);
1133
1134 if (!sock_flag(sk, SOCK_DEAD))
1135 sk->sk_data_ready(sk, skb_len);
1136out:
1137 return err;
1138}
1139
1140static inline int sock_queue_err_skb(struct sock *sk, struct sk_buff *skb)
1141{
1142 /* Cast skb->rcvbuf to unsigned... It's pointless, but reduces
1143 number of warnings when compiling with -W --ANK
1144 */
1145 if (atomic_read(&sk->sk_rmem_alloc) + skb->truesize >=
1146 (unsigned)sk->sk_rcvbuf)
1147 return -ENOMEM;
1148 skb_set_owner_r(skb, sk);
1149 skb_queue_tail(&sk->sk_error_queue, skb);
1150 if (!sock_flag(sk, SOCK_DEAD))
1151 sk->sk_data_ready(sk, skb->len);
1152 return 0;
1153}
1154
1155/*
1156 * Recover an error report and clear atomically
1157 */
1158
1159static inline int sock_error(struct sock *sk)
1160{
1161 int err = xchg(&sk->sk_err, 0);
1162 return -err;
1163}
1164
1165static inline unsigned long sock_wspace(struct sock *sk)
1166{
1167 int amt = 0;
1168
1169 if (!(sk->sk_shutdown & SEND_SHUTDOWN)) {
1170 amt = sk->sk_sndbuf - atomic_read(&sk->sk_wmem_alloc);
1171 if (amt < 0)
1172 amt = 0;
1173 }
1174 return amt;
1175}
1176
1177static inline void sk_wake_async(struct sock *sk, int how, int band)
1178{
1179 if (sk->sk_socket && sk->sk_socket->fasync_list)
1180 sock_wake_async(sk->sk_socket, how, band);
1181}
1182
1183#define SOCK_MIN_SNDBUF 2048
1184#define SOCK_MIN_RCVBUF 256
1185
1186static inline void sk_stream_moderate_sndbuf(struct sock *sk)
1187{
1188 if (!(sk->sk_userlocks & SOCK_SNDBUF_LOCK)) {
1189 sk->sk_sndbuf = min(sk->sk_sndbuf, sk->sk_wmem_queued / 2);
1190 sk->sk_sndbuf = max(sk->sk_sndbuf, SOCK_MIN_SNDBUF);
1191 }
1192}
1193
1194static inline struct sk_buff *sk_stream_alloc_pskb(struct sock *sk,
Victor Fusco86a76ca2005-07-08 14:57:47 -07001195 int size, int mem,
1196 unsigned int __nocast gfp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001197{
David S. Millerc65f7f02005-07-05 15:17:25 -07001198 struct sk_buff *skb;
1199 int hdr_len;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001200
David S. Millerc65f7f02005-07-05 15:17:25 -07001201 hdr_len = SKB_DATA_ALIGN(sk->sk_prot->max_header);
1202 skb = alloc_skb(size + hdr_len, gfp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001203 if (skb) {
1204 skb->truesize += mem;
1205 if (sk->sk_forward_alloc >= (int)skb->truesize ||
1206 sk_stream_mem_schedule(sk, skb->truesize, 0)) {
David S. Millerc65f7f02005-07-05 15:17:25 -07001207 skb_reserve(skb, hdr_len);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001208 return skb;
1209 }
1210 __kfree_skb(skb);
1211 } else {
1212 sk->sk_prot->enter_memory_pressure();
1213 sk_stream_moderate_sndbuf(sk);
1214 }
1215 return NULL;
1216}
1217
1218static inline struct sk_buff *sk_stream_alloc_skb(struct sock *sk,
Victor Fusco86a76ca2005-07-08 14:57:47 -07001219 int size,
1220 unsigned int __nocast gfp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001221{
1222 return sk_stream_alloc_pskb(sk, size, 0, gfp);
1223}
1224
1225static inline struct page *sk_stream_alloc_page(struct sock *sk)
1226{
1227 struct page *page = NULL;
1228
1229 if (sk->sk_forward_alloc >= (int)PAGE_SIZE ||
1230 sk_stream_mem_schedule(sk, PAGE_SIZE, 0))
1231 page = alloc_pages(sk->sk_allocation, 0);
1232 else {
1233 sk->sk_prot->enter_memory_pressure();
1234 sk_stream_moderate_sndbuf(sk);
1235 }
1236 return page;
1237}
1238
1239#define sk_stream_for_retrans_queue(skb, sk) \
1240 for (skb = (sk)->sk_write_queue.next; \
1241 (skb != (sk)->sk_send_head) && \
1242 (skb != (struct sk_buff *)&(sk)->sk_write_queue); \
1243 skb = skb->next)
1244
1245/*
1246 * Default write policy as shown to user space via poll/select/SIGIO
1247 */
1248static inline int sock_writeable(const struct sock *sk)
1249{
1250 return atomic_read(&sk->sk_wmem_alloc) < (sk->sk_sndbuf / 2);
1251}
1252
Victor Fusco86a76ca2005-07-08 14:57:47 -07001253static inline unsigned int __nocast gfp_any(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001254{
1255 return in_softirq() ? GFP_ATOMIC : GFP_KERNEL;
1256}
1257
1258static inline long sock_rcvtimeo(const struct sock *sk, int noblock)
1259{
1260 return noblock ? 0 : sk->sk_rcvtimeo;
1261}
1262
1263static inline long sock_sndtimeo(const struct sock *sk, int noblock)
1264{
1265 return noblock ? 0 : sk->sk_sndtimeo;
1266}
1267
1268static inline int sock_rcvlowat(const struct sock *sk, int waitall, int len)
1269{
1270 return (waitall ? len : min_t(int, sk->sk_rcvlowat, len)) ? : 1;
1271}
1272
1273/* Alas, with timeout socket operations are not restartable.
1274 * Compare this to poll().
1275 */
1276static inline int sock_intr_errno(long timeo)
1277{
1278 return timeo == MAX_SCHEDULE_TIMEOUT ? -ERESTARTSYS : -EINTR;
1279}
1280
1281static __inline__ void
1282sock_recv_timestamp(struct msghdr *msg, struct sock *sk, struct sk_buff *skb)
1283{
1284 struct timeval *stamp = &skb->stamp;
1285 if (sock_flag(sk, SOCK_RCVTSTAMP)) {
1286 /* Race occurred between timestamp enabling and packet
1287 receiving. Fill in the current time for now. */
1288 if (stamp->tv_sec == 0)
1289 do_gettimeofday(stamp);
1290 put_cmsg(msg, SOL_SOCKET, SO_TIMESTAMP, sizeof(struct timeval),
1291 stamp);
1292 } else
1293 sk->sk_stamp = *stamp;
1294}
1295
1296/**
1297 * sk_eat_skb - Release a skb if it is no longer needed
Pavel Pisa4dc3b162005-05-01 08:59:25 -07001298 * @sk: socket to eat this skb from
1299 * @skb: socket buffer to eat
Linus Torvalds1da177e2005-04-16 15:20:36 -07001300 *
1301 * This routine must be called with interrupts disabled or with the socket
1302 * locked so that the sk_buff queue operation is ok.
1303*/
1304static inline void sk_eat_skb(struct sock *sk, struct sk_buff *skb)
1305{
1306 __skb_unlink(skb, &sk->sk_receive_queue);
1307 __kfree_skb(skb);
1308}
1309
1310extern void sock_enable_timestamp(struct sock *sk);
1311extern int sock_get_timestamp(struct sock *, struct timeval __user *);
1312
1313/*
1314 * Enable debug/info messages
1315 */
1316
1317#if 0
1318#define NETDEBUG(x) do { } while (0)
1319#define LIMIT_NETDEBUG(x) do {} while(0)
1320#else
1321#define NETDEBUG(x) do { x; } while (0)
1322#define LIMIT_NETDEBUG(x) do { if (net_ratelimit()) { x; } } while(0)
1323#endif
1324
1325/*
1326 * Macros for sleeping on a socket. Use them like this:
1327 *
1328 * SOCK_SLEEP_PRE(sk)
1329 * if (condition)
1330 * schedule();
1331 * SOCK_SLEEP_POST(sk)
1332 *
1333 * N.B. These are now obsolete and were, afaik, only ever used in DECnet
1334 * and when the last use of them in DECnet has gone, I'm intending to
1335 * remove them.
1336 */
1337
1338#define SOCK_SLEEP_PRE(sk) { struct task_struct *tsk = current; \
1339 DECLARE_WAITQUEUE(wait, tsk); \
1340 tsk->state = TASK_INTERRUPTIBLE; \
1341 add_wait_queue((sk)->sk_sleep, &wait); \
1342 release_sock(sk);
1343
1344#define SOCK_SLEEP_POST(sk) tsk->state = TASK_RUNNING; \
1345 remove_wait_queue((sk)->sk_sleep, &wait); \
1346 lock_sock(sk); \
1347 }
1348
1349static inline void sock_valbool_flag(struct sock *sk, int bit, int valbool)
1350{
1351 if (valbool)
1352 sock_set_flag(sk, bit);
1353 else
1354 sock_reset_flag(sk, bit);
1355}
1356
1357extern __u32 sysctl_wmem_max;
1358extern __u32 sysctl_rmem_max;
1359
1360#ifdef CONFIG_NET
1361int siocdevprivate_ioctl(unsigned int fd, unsigned int cmd, unsigned long arg);
1362#else
1363static inline int siocdevprivate_ioctl(unsigned int fd, unsigned int cmd, unsigned long arg)
1364{
1365 return -ENODEV;
1366}
1367#endif
1368
1369#endif /* _SOCK_H */