2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
* INET An implementation of the TCP/IP protocol suite for the LINUX
|
|
|
|
* operating system. INET is implemented using the BSD Socket
|
|
|
|
* interface as the means of communication with the user level.
|
|
|
|
*
|
|
|
|
* Definitions for the AF_INET socket handler.
|
|
|
|
*
|
|
|
|
* Version: @(#)sock.h 1.0.4 05/13/93
|
|
|
|
*
|
2005-05-06 07:16:16 +08:00
|
|
|
* Authors: Ross Biro
|
2005-04-17 06:20:36 +08:00
|
|
|
* Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
|
|
|
|
* Corey Minyard <wf-rch!minyard@relay.EU.net>
|
|
|
|
* Florian La Roche <flla@stud.uni-sb.de>
|
|
|
|
*
|
|
|
|
* Fixes:
|
|
|
|
* Alan Cox : Volatiles in skbuff pointers. See
|
|
|
|
* skbuff comments. May be overdone,
|
|
|
|
* better to prove they can be removed
|
|
|
|
* than the reverse.
|
|
|
|
* Alan Cox : Added a zapped field for tcp to note
|
|
|
|
* a socket is reset and must stay shut up
|
|
|
|
* Alan Cox : New fields for options
|
|
|
|
* Pauline Middelink : identd support
|
|
|
|
* Alan Cox : Eliminate low level recv/recvfrom
|
|
|
|
* David S. Miller : New socket lookup architecture.
|
|
|
|
* Steve Whitehouse: Default routines for sock_ops
|
|
|
|
* Arnaldo C. Melo : removed net_pinfo, tp_pinfo and made
|
|
|
|
* protinfo be just a void pointer, as the
|
|
|
|
* protocol specific parts were moved to
|
|
|
|
* respective headers and ipv4/v6, etc now
|
|
|
|
* use private slabcaches for its socks
|
|
|
|
* Pedro Hortas : New flags field for socket options
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*/
|
|
|
|
#ifndef _SOCK_H
|
|
|
|
#define _SOCK_H
|
|
|
|
|
2007-08-29 06:50:33 +08:00
|
|
|
#include <linux/kernel.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/list.h>
|
2008-11-17 11:39:21 +08:00
|
|
|
#include <linux/list_nulls.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/timer.h>
|
|
|
|
#include <linux/cache.h>
|
|
|
|
#include <linux/module.h>
|
2006-07-03 15:25:35 +08:00
|
|
|
#include <linux/lockdep.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/netdevice.h>
|
|
|
|
#include <linux/skbuff.h> /* struct sk_buff */
|
2006-12-04 12:15:30 +08:00
|
|
|
#include <linux/mm.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/security.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 16:04:11 +08:00
|
|
|
#include <linux/slab.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
#include <linux/filter.h>
|
2008-11-17 11:39:21 +08:00
|
|
|
#include <linux/rculist_nulls.h>
|
2009-07-08 20:09:13 +08:00
|
|
|
#include <linux/poll.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
#include <asm/atomic.h>
|
|
|
|
#include <net/dst.h>
|
|
|
|
#include <net/checksum.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This structure really needs to be cleaned up.
|
|
|
|
* Most of it is for TCP, and not used by any of
|
|
|
|
* the other protocols.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Define this to get the SOCK_DBG debugging facility. */
|
|
|
|
#define SOCK_DEBUGGING
|
|
|
|
#ifdef SOCK_DEBUGGING
|
|
|
|
#define SOCK_DEBUG(sk, msg...) do { if ((sk) && sock_flag((sk), SOCK_DBG)) \
|
|
|
|
printk(KERN_DEBUG msg); } while (0)
|
|
|
|
#else
|
2008-03-22 06:54:53 +08:00
|
|
|
/* Validate arguments and do nothing */
|
|
|
|
static void inline int __attribute__ ((format (printf, 2, 3)))
|
|
|
|
SOCK_DEBUG(struct sock *sk, const char *msg, ...)
|
|
|
|
{
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
/* This is the per-socket lock. The spinlock provides a synchronization
|
|
|
|
* between user contexts and software interrupt processing, whereas the
|
|
|
|
* mini-semaphore synchronizes multiple users amongst themselves.
|
|
|
|
*/
|
|
|
|
typedef struct {
|
|
|
|
spinlock_t slock;
|
2007-09-12 16:44:19 +08:00
|
|
|
int owned;
|
2005-04-17 06:20:36 +08:00
|
|
|
wait_queue_head_t wq;
|
2006-07-03 15:25:35 +08:00
|
|
|
/*
|
|
|
|
* We express the mutex-alike socket_lock semantics
|
|
|
|
* to the lock validator by explicitly managing
|
|
|
|
* the slock as a lock variant (in addition to
|
|
|
|
* the slock itself):
|
|
|
|
*/
|
|
|
|
#ifdef CONFIG_DEBUG_LOCK_ALLOC
|
|
|
|
struct lockdep_map dep_map;
|
|
|
|
#endif
|
2005-04-17 06:20:36 +08:00
|
|
|
} socket_lock_t;
|
|
|
|
|
|
|
|
struct sock;
|
2005-08-10 11:09:30 +08:00
|
|
|
struct proto;
|
2007-12-04 17:15:45 +08:00
|
|
|
struct net;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/**
|
2005-05-01 23:59:25 +08:00
|
|
|
* struct sock_common - minimal network layer representation of sockets
|
2009-07-16 07:13:10 +08:00
|
|
|
* @skc_node: main hash linkage for various protocol lookup tables
|
2009-11-08 18:17:58 +08:00
|
|
|
* @skc_nulls_node: main hash linkage for TCP/UDP/UDP-Lite protocol
|
2009-07-16 07:13:10 +08:00
|
|
|
* @skc_refcnt: reference count
|
2009-10-20 07:46:20 +08:00
|
|
|
* @skc_tx_queue_mapping: tx queue number for this connection
|
2009-07-16 07:13:10 +08:00
|
|
|
* @skc_hash: hash value used with various protocol lookup tables
|
2009-11-08 18:17:30 +08:00
|
|
|
* @skc_u16hashes: two u16 hash values used by UDP lookup tables
|
2005-05-01 23:59:25 +08:00
|
|
|
* @skc_family: network address family
|
|
|
|
* @skc_state: Connection state
|
|
|
|
* @skc_reuse: %SO_REUSEADDR setting
|
|
|
|
* @skc_bound_dev_if: bound device index if != 0
|
|
|
|
* @skc_bind_node: bind hash linkage for various protocol lookup tables
|
2009-11-08 18:17:58 +08:00
|
|
|
* @skc_portaddr_node: second hash linkage for UDP/UDP-Lite protocol
|
2005-08-10 11:09:30 +08:00
|
|
|
* @skc_prot: protocol handlers inside a network family
|
2007-09-12 17:58:02 +08:00
|
|
|
* @skc_net: reference to the network namespace of this socket
|
2005-05-01 23:59:25 +08:00
|
|
|
*
|
|
|
|
* This is the minimal network layer representation of sockets, the header
|
2005-08-10 11:09:30 +08:00
|
|
|
* for struct sock and struct inet_timewait_sock.
|
|
|
|
*/
|
2005-04-17 06:20:36 +08:00
|
|
|
struct sock_common {
|
2009-07-16 07:13:10 +08:00
|
|
|
/*
|
|
|
|
* first fields are not copied in sock_copy()
|
|
|
|
*/
|
2008-11-17 11:39:21 +08:00
|
|
|
union {
|
|
|
|
struct hlist_node skc_node;
|
|
|
|
struct hlist_nulls_node skc_nulls_node;
|
|
|
|
};
|
2005-04-17 06:20:36 +08:00
|
|
|
atomic_t skc_refcnt;
|
2009-10-20 07:46:20 +08:00
|
|
|
int skc_tx_queue_mapping;
|
2009-07-16 07:13:10 +08:00
|
|
|
|
2009-11-08 18:17:30 +08:00
|
|
|
union {
|
|
|
|
unsigned int skc_hash;
|
|
|
|
__u16 skc_u16hashes[2];
|
|
|
|
};
|
2009-07-16 07:13:10 +08:00
|
|
|
unsigned short skc_family;
|
|
|
|
volatile unsigned char skc_state;
|
|
|
|
unsigned char skc_reuse;
|
|
|
|
int skc_bound_dev_if;
|
2009-11-08 18:17:58 +08:00
|
|
|
union {
|
|
|
|
struct hlist_node skc_bind_node;
|
|
|
|
struct hlist_nulls_node skc_portaddr_node;
|
|
|
|
};
|
2005-08-10 11:09:30 +08:00
|
|
|
struct proto *skc_prot;
|
2008-03-26 01:26:21 +08:00
|
|
|
#ifdef CONFIG_NET_NS
|
2007-09-12 17:58:02 +08:00
|
|
|
struct net *skc_net;
|
2008-03-26 01:26:21 +08:00
|
|
|
#endif
|
2005-04-17 06:20:36 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
|
|
|
* struct sock - network layer representation of sockets
|
2005-08-10 11:09:30 +08:00
|
|
|
* @__sk_common: shared layout with inet_timewait_sock
|
2005-05-01 23:59:25 +08:00
|
|
|
* @sk_shutdown: mask of %SEND_SHUTDOWN and/or %RCV_SHUTDOWN
|
|
|
|
* @sk_userlocks: %SO_SNDBUF and %SO_RCVBUF settings
|
|
|
|
* @sk_lock: synchronizer
|
|
|
|
* @sk_rcvbuf: size of receive buffer in bytes
|
|
|
|
* @sk_sleep: sock wait queue
|
|
|
|
* @sk_dst_cache: destination cache
|
|
|
|
* @sk_dst_lock: destination cache lock
|
|
|
|
* @sk_policy: flow policy
|
|
|
|
* @sk_rmem_alloc: receive queue bytes committed
|
|
|
|
* @sk_receive_queue: incoming packets
|
|
|
|
* @sk_wmem_alloc: transmit queue bytes committed
|
|
|
|
* @sk_write_queue: Packet sending queue
|
2006-05-24 08:55:33 +08:00
|
|
|
* @sk_async_wait_queue: DMA copied packets
|
2005-05-01 23:59:25 +08:00
|
|
|
* @sk_omem_alloc: "o" is "option" or "other"
|
|
|
|
* @sk_wmem_queued: persistent queue size
|
|
|
|
* @sk_forward_alloc: space allocated forward
|
|
|
|
* @sk_allocation: allocation mode
|
|
|
|
* @sk_sndbuf: size of send buffer in bytes
|
2007-11-14 12:30:01 +08:00
|
|
|
* @sk_flags: %SO_LINGER (l_onoff), %SO_BROADCAST, %SO_KEEPALIVE,
|
2009-02-12 13:03:38 +08:00
|
|
|
* %SO_OOBINLINE settings, %SO_TIMESTAMPING settings
|
2005-05-01 23:59:25 +08:00
|
|
|
* @sk_no_check: %SO_NO_CHECK setting, wether or not checkup packets
|
|
|
|
* @sk_route_caps: route capabilities (e.g. %NETIF_F_TSO)
|
2006-07-01 04:36:35 +08:00
|
|
|
* @sk_gso_type: GSO type (e.g. %SKB_GSO_TCPV4)
|
[NET]: Add per-connection option to set max TSO frame size
Update: My mailer ate one of Jarek's feedback mails... Fixed the
parameter in netif_set_gso_max_size() to be u32, not u16. Fixed the
whitespace issue due to a patch import botch. Changed the types from
u32 to unsigned int to be more consistent with other variables in the
area. Also brought the patch up to the latest net-2.6.26 tree.
Update: Made gso_max_size container 32 bits, not 16. Moved the
location of gso_max_size within netdev to be less hotpath. Made more
consistent names between the sock and netdev layers, and added a
define for the max GSO size.
Update: Respun for net-2.6.26 tree.
Update: changed max_gso_frame_size and sk_gso_max_size from signed to
unsigned - thanks Stephen!
This patch adds the ability for device drivers to control the size of
the TSO frames being sent to them, per TCP connection. By setting the
netdevice's gso_max_size value, the socket layer will set the GSO
frame size based on that value. This will propogate into the TCP
layer, and send TSO's of that size to the hardware.
This can be desirable to help tune the bursty nature of TSO on a
per-adapter basis, where one may have 1 GbE and 10 GbE devices
coexisting in a system, one running multiqueue and the other not, etc.
This can also be desirable for devices that cannot support full 64 KB
TSO's, but still want to benefit from some level of segmentation
offloading.
Signed-off-by: Peter P Waskiewicz Jr <peter.p.waskiewicz.jr@intel.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-03-21 18:43:19 +08:00
|
|
|
* @sk_gso_max_size: Maximum GSO segment size to build
|
2005-05-01 23:59:25 +08:00
|
|
|
* @sk_lingertime: %SO_LINGER l_linger setting
|
|
|
|
* @sk_backlog: always used with the per-socket spinlock held
|
|
|
|
* @sk_callback_lock: used with the callbacks in the end of this struct
|
|
|
|
* @sk_error_queue: rarely used
|
2007-11-14 12:30:01 +08:00
|
|
|
* @sk_prot_creator: sk_prot of original sock creator (see ipv6_setsockopt,
|
|
|
|
* IPV6_ADDRFORM for instance)
|
2005-05-01 23:59:25 +08:00
|
|
|
* @sk_err: last error
|
2007-11-14 12:30:01 +08:00
|
|
|
* @sk_err_soft: errors that don't cause failure but are the cause of a
|
|
|
|
* persistent failure not just 'timed out'
|
2008-06-18 12:04:56 +08:00
|
|
|
* @sk_drops: raw/udp drops counter
|
2005-05-01 23:59:25 +08:00
|
|
|
* @sk_ack_backlog: current listen backlog
|
|
|
|
* @sk_max_ack_backlog: listen backlog set in listen()
|
|
|
|
* @sk_priority: %SO_PRIORITY setting
|
|
|
|
* @sk_type: socket type (%SOCK_STREAM, etc)
|
|
|
|
* @sk_protocol: which protocol this socket belongs in this network family
|
|
|
|
* @sk_peercred: %SO_PEERCRED setting
|
|
|
|
* @sk_rcvlowat: %SO_RCVLOWAT setting
|
|
|
|
* @sk_rcvtimeo: %SO_RCVTIMEO setting
|
|
|
|
* @sk_sndtimeo: %SO_SNDTIMEO setting
|
2010-04-28 06:05:31 +08:00
|
|
|
* @sk_rxhash: flow hash received from netif layer
|
2005-05-01 23:59:25 +08:00
|
|
|
* @sk_filter: socket filtering instructions
|
|
|
|
* @sk_protinfo: private area, net family specific, when not using slab
|
|
|
|
* @sk_timer: sock cleanup timer
|
|
|
|
* @sk_stamp: time stamp of last packet received
|
|
|
|
* @sk_socket: Identd and reporting IO signals
|
|
|
|
* @sk_user_data: RPC layer private data
|
|
|
|
* @sk_sndmsg_page: cached page for sendmsg
|
|
|
|
* @sk_sndmsg_off: cached offset for sendmsg
|
|
|
|
* @sk_send_head: front of stuff to transmit
|
2005-05-01 23:59:26 +08:00
|
|
|
* @sk_security: used by security modules
|
2008-02-19 12:52:13 +08:00
|
|
|
* @sk_mark: generic packet mark
|
2005-05-01 23:59:25 +08:00
|
|
|
* @sk_write_pending: a write to stream socket waits to start
|
|
|
|
* @sk_state_change: callback to indicate change in the state of the sock
|
|
|
|
* @sk_data_ready: callback to indicate there is data to be processed
|
|
|
|
* @sk_write_space: callback to indicate there is bf sending space available
|
|
|
|
* @sk_error_report: callback to indicate errors (e.g. %MSG_ERRQUEUE)
|
|
|
|
* @sk_backlog_rcv: callback to process the backlog
|
|
|
|
* @sk_destruct: called at sock freeing time, i.e. when all refcnt == 0
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
|
|
|
struct sock {
|
|
|
|
/*
|
2005-08-10 11:09:30 +08:00
|
|
|
* Now struct inet_timewait_sock also uses sock_common, so please just
|
2005-04-17 06:20:36 +08:00
|
|
|
* don't add nothing before this first member (__sk_common) --acme
|
|
|
|
*/
|
|
|
|
struct sock_common __sk_common;
|
2009-07-16 07:13:10 +08:00
|
|
|
#define sk_node __sk_common.skc_node
|
|
|
|
#define sk_nulls_node __sk_common.skc_nulls_node
|
|
|
|
#define sk_refcnt __sk_common.skc_refcnt
|
2009-10-20 07:46:20 +08:00
|
|
|
#define sk_tx_queue_mapping __sk_common.skc_tx_queue_mapping
|
2009-07-16 07:13:10 +08:00
|
|
|
|
|
|
|
#define sk_copy_start __sk_common.skc_hash
|
|
|
|
#define sk_hash __sk_common.skc_hash
|
2005-04-17 06:20:36 +08:00
|
|
|
#define sk_family __sk_common.skc_family
|
|
|
|
#define sk_state __sk_common.skc_state
|
|
|
|
#define sk_reuse __sk_common.skc_reuse
|
|
|
|
#define sk_bound_dev_if __sk_common.skc_bound_dev_if
|
|
|
|
#define sk_bind_node __sk_common.skc_bind_node
|
2005-08-10 11:09:30 +08:00
|
|
|
#define sk_prot __sk_common.skc_prot
|
2007-09-12 17:58:02 +08:00
|
|
|
#define sk_net __sk_common.skc_net
|
2009-02-26 21:46:57 +08:00
|
|
|
kmemcheck_bitfield_begin(flags);
|
2009-10-09 06:50:25 +08:00
|
|
|
unsigned int sk_shutdown : 2,
|
|
|
|
sk_no_check : 2,
|
|
|
|
sk_userlocks : 4,
|
|
|
|
sk_protocol : 8,
|
|
|
|
sk_type : 16;
|
2009-02-26 21:46:57 +08:00
|
|
|
kmemcheck_bitfield_end(flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
int sk_rcvbuf;
|
|
|
|
socket_lock_t sk_lock;
|
2007-03-05 08:05:44 +08:00
|
|
|
/*
|
|
|
|
* The backlog queue is special, it is always used with
|
|
|
|
* the per-socket spinlock held and requires low latency
|
|
|
|
* access. Therefore we special case it's implementation.
|
|
|
|
*/
|
|
|
|
struct {
|
|
|
|
struct sk_buff *head;
|
|
|
|
struct sk_buff *tail;
|
2010-03-05 02:01:40 +08:00
|
|
|
int len;
|
2007-03-05 08:05:44 +08:00
|
|
|
} sk_backlog;
|
2005-04-17 06:20:36 +08:00
|
|
|
wait_queue_head_t *sk_sleep;
|
|
|
|
struct dst_entry *sk_dst_cache;
|
2008-10-29 04:24:06 +08:00
|
|
|
#ifdef CONFIG_XFRM
|
2005-04-17 06:20:36 +08:00
|
|
|
struct xfrm_policy *sk_policy[2];
|
2008-10-29 04:24:06 +08:00
|
|
|
#endif
|
2010-04-09 07:03:29 +08:00
|
|
|
spinlock_t sk_dst_lock;
|
2005-04-17 06:20:36 +08:00
|
|
|
atomic_t sk_rmem_alloc;
|
|
|
|
atomic_t sk_wmem_alloc;
|
|
|
|
atomic_t sk_omem_alloc;
|
2007-05-30 04:17:47 +08:00
|
|
|
int sk_sndbuf;
|
2005-04-17 06:20:36 +08:00
|
|
|
struct sk_buff_head sk_receive_queue;
|
|
|
|
struct sk_buff_head sk_write_queue;
|
2008-11-13 15:25:32 +08:00
|
|
|
#ifdef CONFIG_NET_DMA
|
2006-05-24 08:55:33 +08:00
|
|
|
struct sk_buff_head sk_async_wait_queue;
|
2008-11-13 15:25:32 +08:00
|
|
|
#endif
|
2005-04-17 06:20:36 +08:00
|
|
|
int sk_wmem_queued;
|
|
|
|
int sk_forward_alloc;
|
2005-10-21 15:20:43 +08:00
|
|
|
gfp_t sk_allocation;
|
2005-04-17 06:20:36 +08:00
|
|
|
int sk_route_caps;
|
2006-07-01 04:36:35 +08:00
|
|
|
int sk_gso_type;
|
[NET]: Add per-connection option to set max TSO frame size
Update: My mailer ate one of Jarek's feedback mails... Fixed the
parameter in netif_set_gso_max_size() to be u32, not u16. Fixed the
whitespace issue due to a patch import botch. Changed the types from
u32 to unsigned int to be more consistent with other variables in the
area. Also brought the patch up to the latest net-2.6.26 tree.
Update: Made gso_max_size container 32 bits, not 16. Moved the
location of gso_max_size within netdev to be less hotpath. Made more
consistent names between the sock and netdev layers, and added a
define for the max GSO size.
Update: Respun for net-2.6.26 tree.
Update: changed max_gso_frame_size and sk_gso_max_size from signed to
unsigned - thanks Stephen!
This patch adds the ability for device drivers to control the size of
the TSO frames being sent to them, per TCP connection. By setting the
netdevice's gso_max_size value, the socket layer will set the GSO
frame size based on that value. This will propogate into the TCP
layer, and send TSO's of that size to the hardware.
This can be desirable to help tune the bursty nature of TSO on a
per-adapter basis, where one may have 1 GbE and 10 GbE devices
coexisting in a system, one running multiqueue and the other not, etc.
This can also be desirable for devices that cannot support full 64 KB
TSO's, but still want to benefit from some level of segmentation
offloading.
Signed-off-by: Peter P Waskiewicz Jr <peter.p.waskiewicz.jr@intel.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-03-21 18:43:19 +08:00
|
|
|
unsigned int sk_gso_max_size;
|
2006-03-25 07:12:37 +08:00
|
|
|
int sk_rcvlowat;
|
2010-04-28 06:05:31 +08:00
|
|
|
#ifdef CONFIG_RPS
|
|
|
|
__u32 sk_rxhash;
|
|
|
|
#endif
|
2005-04-17 06:20:36 +08:00
|
|
|
unsigned long sk_flags;
|
|
|
|
unsigned long sk_lingertime;
|
|
|
|
struct sk_buff_head sk_error_queue;
|
2005-05-06 04:35:15 +08:00
|
|
|
struct proto *sk_prot_creator;
|
2005-04-17 06:20:36 +08:00
|
|
|
rwlock_t sk_callback_lock;
|
|
|
|
int sk_err,
|
|
|
|
sk_err_soft;
|
2007-11-14 12:30:01 +08:00
|
|
|
atomic_t sk_drops;
|
2005-04-17 06:20:36 +08:00
|
|
|
unsigned short sk_ack_backlog;
|
|
|
|
unsigned short sk_max_ack_backlog;
|
|
|
|
__u32 sk_priority;
|
|
|
|
struct ucred sk_peercred;
|
|
|
|
long sk_rcvtimeo;
|
|
|
|
long sk_sndtimeo;
|
|
|
|
struct sk_filter *sk_filter;
|
|
|
|
void *sk_protinfo;
|
|
|
|
struct timer_list sk_timer;
|
2007-04-20 07:16:32 +08:00
|
|
|
ktime_t sk_stamp;
|
2005-04-17 06:20:36 +08:00
|
|
|
struct socket *sk_socket;
|
|
|
|
void *sk_user_data;
|
|
|
|
struct page *sk_sndmsg_page;
|
|
|
|
struct sk_buff *sk_send_head;
|
|
|
|
__u32 sk_sndmsg_off;
|
|
|
|
int sk_write_pending;
|
2008-11-05 06:45:58 +08:00
|
|
|
#ifdef CONFIG_SECURITY
|
2005-04-17 06:20:36 +08:00
|
|
|
void *sk_security;
|
2008-11-05 06:45:58 +08:00
|
|
|
#endif
|
2008-01-31 11:08:16 +08:00
|
|
|
__u32 sk_mark;
|
|
|
|
/* XXX 4 bytes hole on 64 bit */
|
2005-04-17 06:20:36 +08:00
|
|
|
void (*sk_state_change)(struct sock *sk);
|
|
|
|
void (*sk_data_ready)(struct sock *sk, int bytes);
|
|
|
|
void (*sk_write_space)(struct sock *sk);
|
|
|
|
void (*sk_error_report)(struct sock *sk);
|
|
|
|
int (*sk_backlog_rcv)(struct sock *sk,
|
|
|
|
struct sk_buff *skb);
|
|
|
|
void (*sk_destruct)(struct sock *sk);
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Hashed lists helper routines
|
|
|
|
*/
|
2010-02-09 07:18:45 +08:00
|
|
|
static inline struct sock *sk_entry(const struct hlist_node *node)
|
|
|
|
{
|
|
|
|
return hlist_entry(node, struct sock, sk_node);
|
|
|
|
}
|
|
|
|
|
2005-08-10 11:09:46 +08:00
|
|
|
static inline struct sock *__sk_head(const struct hlist_head *head)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
return hlist_entry(head->first, struct sock, sk_node);
|
|
|
|
}
|
|
|
|
|
2005-08-10 11:09:46 +08:00
|
|
|
static inline struct sock *sk_head(const struct hlist_head *head)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
return hlist_empty(head) ? NULL : __sk_head(head);
|
|
|
|
}
|
|
|
|
|
2008-11-17 11:39:21 +08:00
|
|
|
static inline struct sock *__sk_nulls_head(const struct hlist_nulls_head *head)
|
|
|
|
{
|
|
|
|
return hlist_nulls_entry(head->first, struct sock, sk_nulls_node);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline struct sock *sk_nulls_head(const struct hlist_nulls_head *head)
|
|
|
|
{
|
|
|
|
return hlist_nulls_empty(head) ? NULL : __sk_nulls_head(head);
|
|
|
|
}
|
|
|
|
|
2005-08-10 11:09:46 +08:00
|
|
|
static inline struct sock *sk_next(const struct sock *sk)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
return sk->sk_node.next ?
|
|
|
|
hlist_entry(sk->sk_node.next, struct sock, sk_node) : NULL;
|
|
|
|
}
|
|
|
|
|
2008-11-17 11:39:21 +08:00
|
|
|
static inline struct sock *sk_nulls_next(const struct sock *sk)
|
|
|
|
{
|
|
|
|
return (!is_a_nulls(sk->sk_nulls_node.next)) ?
|
|
|
|
hlist_nulls_entry(sk->sk_nulls_node.next,
|
|
|
|
struct sock, sk_nulls_node) :
|
|
|
|
NULL;
|
|
|
|
}
|
|
|
|
|
2005-08-10 11:09:46 +08:00
|
|
|
static inline int sk_unhashed(const struct sock *sk)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
return hlist_unhashed(&sk->sk_node);
|
|
|
|
}
|
|
|
|
|
2005-08-10 11:09:46 +08:00
|
|
|
static inline int sk_hashed(const struct sock *sk)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2006-04-29 06:21:23 +08:00
|
|
|
return !sk_unhashed(sk);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static __inline__ void sk_node_init(struct hlist_node *node)
|
|
|
|
{
|
|
|
|
node->pprev = NULL;
|
|
|
|
}
|
|
|
|
|
2008-11-17 11:39:21 +08:00
|
|
|
static __inline__ void sk_nulls_node_init(struct hlist_nulls_node *node)
|
|
|
|
{
|
|
|
|
node->pprev = NULL;
|
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
static __inline__ void __sk_del_node(struct sock *sk)
|
|
|
|
{
|
|
|
|
__hlist_del(&sk->sk_node);
|
|
|
|
}
|
|
|
|
|
2010-02-22 15:57:18 +08:00
|
|
|
/* NB: equivalent to hlist_del_init_rcu */
|
2005-04-17 06:20:36 +08:00
|
|
|
static __inline__ int __sk_del_node_init(struct sock *sk)
|
|
|
|
{
|
|
|
|
if (sk_hashed(sk)) {
|
|
|
|
__sk_del_node(sk);
|
|
|
|
sk_node_init(&sk->sk_node);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Grab socket reference count. This operation is valid only
|
|
|
|
when sk is ALREADY grabbed f.e. it is found in hash table
|
|
|
|
or a list and the lookup is made under lock preventing hash table
|
|
|
|
modifications.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static inline void sock_hold(struct sock *sk)
|
|
|
|
{
|
|
|
|
atomic_inc(&sk->sk_refcnt);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Ungrab socket in the context, which assumes that socket refcnt
|
|
|
|
cannot hit zero, f.e. it is true in context of any socketcall.
|
|
|
|
*/
|
|
|
|
static inline void __sock_put(struct sock *sk)
|
|
|
|
{
|
|
|
|
atomic_dec(&sk->sk_refcnt);
|
|
|
|
}
|
|
|
|
|
|
|
|
static __inline__ int sk_del_node_init(struct sock *sk)
|
|
|
|
{
|
|
|
|
int rc = __sk_del_node_init(sk);
|
|
|
|
|
|
|
|
if (rc) {
|
|
|
|
/* paranoid for a while -acme */
|
|
|
|
WARN_ON(atomic_read(&sk->sk_refcnt) == 1);
|
|
|
|
__sock_put(sk);
|
|
|
|
}
|
|
|
|
return rc;
|
|
|
|
}
|
2010-02-22 15:57:18 +08:00
|
|
|
#define sk_del_node_init_rcu(sk) sk_del_node_init(sk)
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2008-11-17 11:39:21 +08:00
|
|
|
static __inline__ int __sk_nulls_del_node_init_rcu(struct sock *sk)
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 17:11:14 +08:00
|
|
|
{
|
|
|
|
if (sk_hashed(sk)) {
|
2008-11-17 11:39:21 +08:00
|
|
|
hlist_nulls_del_init_rcu(&sk->sk_nulls_node);
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 17:11:14 +08:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-11-17 11:39:21 +08:00
|
|
|
static __inline__ int sk_nulls_del_node_init_rcu(struct sock *sk)
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 17:11:14 +08:00
|
|
|
{
|
2008-11-17 11:39:21 +08:00
|
|
|
int rc = __sk_nulls_del_node_init_rcu(sk);
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 17:11:14 +08:00
|
|
|
|
|
|
|
if (rc) {
|
|
|
|
/* paranoid for a while -acme */
|
|
|
|
WARN_ON(atomic_read(&sk->sk_refcnt) == 1);
|
|
|
|
__sock_put(sk);
|
|
|
|
}
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
static __inline__ void __sk_add_node(struct sock *sk, struct hlist_head *list)
|
|
|
|
{
|
|
|
|
hlist_add_head(&sk->sk_node, list);
|
|
|
|
}
|
|
|
|
|
|
|
|
static __inline__ void sk_add_node(struct sock *sk, struct hlist_head *list)
|
|
|
|
{
|
|
|
|
sock_hold(sk);
|
|
|
|
__sk_add_node(sk, list);
|
|
|
|
}
|
|
|
|
|
2010-02-22 15:57:18 +08:00
|
|
|
static __inline__ void sk_add_node_rcu(struct sock *sk, struct hlist_head *list)
|
|
|
|
{
|
|
|
|
sock_hold(sk);
|
|
|
|
hlist_add_head_rcu(&sk->sk_node, list);
|
|
|
|
}
|
|
|
|
|
2008-11-17 11:39:21 +08:00
|
|
|
static __inline__ void __sk_nulls_add_node_rcu(struct sock *sk, struct hlist_nulls_head *list)
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 17:11:14 +08:00
|
|
|
{
|
2008-11-17 11:39:21 +08:00
|
|
|
hlist_nulls_add_head_rcu(&sk->sk_nulls_node, list);
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 17:11:14 +08:00
|
|
|
}
|
|
|
|
|
2008-11-17 11:39:21 +08:00
|
|
|
static __inline__ void sk_nulls_add_node_rcu(struct sock *sk, struct hlist_nulls_head *list)
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 17:11:14 +08:00
|
|
|
{
|
|
|
|
sock_hold(sk);
|
2008-11-17 11:39:21 +08:00
|
|
|
__sk_nulls_add_node_rcu(sk, list);
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 17:11:14 +08:00
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
static __inline__ void __sk_del_bind_node(struct sock *sk)
|
|
|
|
{
|
|
|
|
__hlist_del(&sk->sk_bind_node);
|
|
|
|
}
|
|
|
|
|
|
|
|
static __inline__ void sk_add_bind_node(struct sock *sk,
|
|
|
|
struct hlist_head *list)
|
|
|
|
{
|
|
|
|
hlist_add_head(&sk->sk_bind_node, list);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define sk_for_each(__sk, node, list) \
|
|
|
|
hlist_for_each_entry(__sk, node, list, sk_node)
|
2010-02-22 15:57:18 +08:00
|
|
|
#define sk_for_each_rcu(__sk, node, list) \
|
|
|
|
hlist_for_each_entry_rcu(__sk, node, list, sk_node)
|
2008-11-17 11:39:21 +08:00
|
|
|
#define sk_nulls_for_each(__sk, node, list) \
|
|
|
|
hlist_nulls_for_each_entry(__sk, node, list, sk_nulls_node)
|
|
|
|
#define sk_nulls_for_each_rcu(__sk, node, list) \
|
|
|
|
hlist_nulls_for_each_entry_rcu(__sk, node, list, sk_nulls_node)
|
2005-04-17 06:20:36 +08:00
|
|
|
#define sk_for_each_from(__sk, node) \
|
|
|
|
if (__sk && ({ node = &(__sk)->sk_node; 1; })) \
|
|
|
|
hlist_for_each_entry_from(__sk, node, sk_node)
|
2008-11-17 11:39:21 +08:00
|
|
|
#define sk_nulls_for_each_from(__sk, node) \
|
|
|
|
if (__sk && ({ node = &(__sk)->sk_nulls_node; 1; })) \
|
|
|
|
hlist_nulls_for_each_entry_from(__sk, node, sk_nulls_node)
|
2005-04-17 06:20:36 +08:00
|
|
|
#define sk_for_each_continue(__sk, node) \
|
|
|
|
if (__sk && ({ node = &(__sk)->sk_node; 1; })) \
|
|
|
|
hlist_for_each_entry_continue(__sk, node, sk_node)
|
|
|
|
#define sk_for_each_safe(__sk, node, tmp, list) \
|
|
|
|
hlist_for_each_entry_safe(__sk, node, tmp, list, sk_node)
|
|
|
|
#define sk_for_each_bound(__sk, node, list) \
|
|
|
|
hlist_for_each_entry(__sk, node, list, sk_bind_node)
|
|
|
|
|
|
|
|
/* Sock flags */
|
|
|
|
enum sock_flags {
|
|
|
|
SOCK_DEAD,
|
|
|
|
SOCK_DONE,
|
|
|
|
SOCK_URGINLINE,
|
|
|
|
SOCK_KEEPOPEN,
|
|
|
|
SOCK_LINGER,
|
|
|
|
SOCK_DESTROY,
|
|
|
|
SOCK_BROADCAST,
|
|
|
|
SOCK_TIMESTAMP,
|
|
|
|
SOCK_ZAPPED,
|
|
|
|
SOCK_USE_WRITE_QUEUE, /* whether to call sk->sk_write_space in sock_wfree */
|
|
|
|
SOCK_DBG, /* %SO_DEBUG setting */
|
|
|
|
SOCK_RCVTSTAMP, /* %SO_TIMESTAMP setting */
|
2007-03-26 13:14:49 +08:00
|
|
|
SOCK_RCVTSTAMPNS, /* %SO_TIMESTAMPNS setting */
|
2005-04-17 06:20:36 +08:00
|
|
|
SOCK_LOCALROUTE, /* route locally only, %SO_DONTROUTE setting */
|
|
|
|
SOCK_QUEUE_SHRUNK, /* write queue has been shrunk recently */
|
2009-02-12 13:03:38 +08:00
|
|
|
SOCK_TIMESTAMPING_TX_HARDWARE, /* %SOF_TIMESTAMPING_TX_HARDWARE */
|
|
|
|
SOCK_TIMESTAMPING_TX_SOFTWARE, /* %SOF_TIMESTAMPING_TX_SOFTWARE */
|
|
|
|
SOCK_TIMESTAMPING_RX_HARDWARE, /* %SOF_TIMESTAMPING_RX_HARDWARE */
|
|
|
|
SOCK_TIMESTAMPING_RX_SOFTWARE, /* %SOF_TIMESTAMPING_RX_SOFTWARE */
|
|
|
|
SOCK_TIMESTAMPING_SOFTWARE, /* %SOF_TIMESTAMPING_SOFTWARE */
|
|
|
|
SOCK_TIMESTAMPING_RAW_HARDWARE, /* %SOF_TIMESTAMPING_RAW_HARDWARE */
|
|
|
|
SOCK_TIMESTAMPING_SYS_HARDWARE, /* %SOF_TIMESTAMPING_SYS_HARDWARE */
|
net: speedup sk_wake_async()
An incoming datagram must bring into cpu cache *lot* of cache lines,
in particular : (other parts omitted (hash chains, ip route cache...))
On 32bit arches :
offsetof(struct sock, sk_rcvbuf) =0x30 (read)
offsetof(struct sock, sk_lock) =0x34 (rw)
offsetof(struct sock, sk_sleep) =0x50 (read)
offsetof(struct sock, sk_rmem_alloc) =0x64 (rw)
offsetof(struct sock, sk_receive_queue)=0x74 (rw)
offsetof(struct sock, sk_forward_alloc)=0x98 (rw)
offsetof(struct sock, sk_callback_lock)=0xcc (rw)
offsetof(struct sock, sk_drops) =0xd8 (read if we add dropcount support, rw if frame dropped)
offsetof(struct sock, sk_filter) =0xf8 (read)
offsetof(struct sock, sk_socket) =0x138 (read)
offsetof(struct sock, sk_data_ready) =0x15c (read)
We can avoid sk->sk_socket and socket->fasync_list referencing on sockets
with no fasync() structures. (socket->fasync_list ptr is probably already in cache
because it shares a cache line with socket->wait, ie location pointed by sk->sk_sleep)
This avoids one cache line load per incoming packet for common cases (no fasync())
We can leave (or even move in a future patch) sk->sk_socket in a cold location
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-10-07 08:28:29 +08:00
|
|
|
SOCK_FASYNC, /* fasync() active */
|
net: Generalize socket rx gap / receive queue overflow cmsg
Create a new socket level option to report number of queue overflows
Recently I augmented the AF_PACKET protocol to report the number of frames lost
on the socket receive queue between any two enqueued frames. This value was
exported via a SOL_PACKET level cmsg. AFter I completed that work it was
requested that this feature be generalized so that any datagram oriented socket
could make use of this option. As such I've created this patch, It creates a
new SOL_SOCKET level option called SO_RXQ_OVFL, which when enabled exports a
SOL_SOCKET level cmsg that reports the nubmer of times the sk_receive_queue
overflowed between any two given frames. It also augments the AF_PACKET
protocol to take advantage of this new feature (as it previously did not touch
sk->sk_drops, which this patch uses to record the overflow count). Tested
successfully by me.
Notes:
1) Unlike my previous patch, this patch simply records the sk_drops value, which
is not a number of drops between packets, but rather a total number of drops.
Deltas must be computed in user space.
2) While this patch currently works with datagram oriented protocols, it will
also be accepted by non-datagram oriented protocols. I'm not sure if thats
agreeable to everyone, but my argument in favor of doing so is that, for those
protocols which aren't applicable to this option, sk_drops will always be zero,
and reporting no drops on a receive queue that isn't used for those
non-participating protocols seems reasonable to me. This also saves us having
to code in a per-protocol opt in mechanism.
3) This applies cleanly to net-next assuming that commit
977750076d98c7ff6cbda51858bb5a5894a9d9ab (my af packet cmsg patch) is reverted
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-10-13 04:26:31 +08:00
|
|
|
SOCK_RXQ_OVFL,
|
2005-04-17 06:20:36 +08:00
|
|
|
};
|
|
|
|
|
2005-08-24 01:11:30 +08:00
|
|
|
static inline void sock_copy_flags(struct sock *nsk, struct sock *osk)
|
|
|
|
{
|
|
|
|
nsk->sk_flags = osk->sk_flags;
|
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
static inline void sock_set_flag(struct sock *sk, enum sock_flags flag)
|
|
|
|
{
|
|
|
|
__set_bit(flag, &sk->sk_flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sock_reset_flag(struct sock *sk, enum sock_flags flag)
|
|
|
|
{
|
|
|
|
__clear_bit(flag, &sk->sk_flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int sock_flag(struct sock *sk, enum sock_flags flag)
|
|
|
|
{
|
|
|
|
return test_bit(flag, &sk->sk_flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sk_acceptq_removed(struct sock *sk)
|
|
|
|
{
|
|
|
|
sk->sk_ack_backlog--;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sk_acceptq_added(struct sock *sk)
|
|
|
|
{
|
|
|
|
sk->sk_ack_backlog++;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int sk_acceptq_is_full(struct sock *sk)
|
|
|
|
{
|
2007-03-07 03:21:05 +08:00
|
|
|
return sk->sk_ack_backlog > sk->sk_max_ack_backlog;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Compute minimal free write space needed to queue new packets.
|
|
|
|
*/
|
|
|
|
static inline int sk_stream_min_wspace(struct sock *sk)
|
|
|
|
{
|
2007-12-21 19:07:41 +08:00
|
|
|
return sk->sk_wmem_queued >> 1;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline int sk_stream_wspace(struct sock *sk)
|
|
|
|
{
|
|
|
|
return sk->sk_sndbuf - sk->sk_wmem_queued;
|
|
|
|
}
|
|
|
|
|
|
|
|
extern void sk_stream_write_space(struct sock *sk);
|
|
|
|
|
|
|
|
static inline int sk_stream_memory_free(struct sock *sk)
|
|
|
|
{
|
|
|
|
return sk->sk_wmem_queued < sk->sk_sndbuf;
|
|
|
|
}
|
|
|
|
|
2010-03-05 02:01:40 +08:00
|
|
|
/* OOB backlog add */
|
2010-03-05 02:01:47 +08:00
|
|
|
static inline void __sk_add_backlog(struct sock *sk, struct sk_buff *skb)
|
2005-11-09 01:39:42 +08:00
|
|
|
{
|
|
|
|
if (!sk->sk_backlog.tail) {
|
|
|
|
sk->sk_backlog.head = sk->sk_backlog.tail = skb;
|
|
|
|
} else {
|
|
|
|
sk->sk_backlog.tail->next = skb;
|
|
|
|
sk->sk_backlog.tail = skb;
|
|
|
|
}
|
|
|
|
skb->next = NULL;
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2010-04-28 06:13:20 +08:00
|
|
|
/*
|
|
|
|
* Take into account size of receive queue and backlog queue
|
|
|
|
*/
|
|
|
|
static inline bool sk_rcvqueues_full(const struct sock *sk, const struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
unsigned int qsize = sk->sk_backlog.len + atomic_read(&sk->sk_rmem_alloc);
|
|
|
|
|
|
|
|
return qsize + skb->truesize > sk->sk_rcvbuf;
|
|
|
|
}
|
|
|
|
|
2010-03-05 02:01:40 +08:00
|
|
|
/* The per-socket spinlock must be held here. */
|
2010-03-08 00:21:39 +08:00
|
|
|
static inline __must_check int sk_add_backlog(struct sock *sk, struct sk_buff *skb)
|
2010-03-05 02:01:40 +08:00
|
|
|
{
|
2010-04-28 06:13:20 +08:00
|
|
|
if (sk_rcvqueues_full(sk, skb))
|
2010-03-05 02:01:40 +08:00
|
|
|
return -ENOBUFS;
|
|
|
|
|
2010-03-05 02:01:47 +08:00
|
|
|
__sk_add_backlog(sk, skb);
|
2010-03-05 02:01:40 +08:00
|
|
|
sk->sk_backlog.len += skb->truesize;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-10-08 05:18:42 +08:00
|
|
|
static inline int sk_backlog_rcv(struct sock *sk, struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
return sk->sk_backlog_rcv(sk, skb);
|
|
|
|
}
|
|
|
|
|
2010-04-28 06:05:31 +08:00
|
|
|
static inline void sock_rps_record_flow(const struct sock *sk)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_RPS
|
|
|
|
struct rps_sock_flow_table *sock_flow_table;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
sock_flow_table = rcu_dereference(rps_sock_flow_table);
|
|
|
|
rps_record_sock_flow(sock_flow_table, sk->sk_rxhash);
|
|
|
|
rcu_read_unlock();
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sock_rps_reset_flow(const struct sock *sk)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_RPS
|
|
|
|
struct rps_sock_flow_table *sock_flow_table;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
sock_flow_table = rcu_dereference(rps_sock_flow_table);
|
|
|
|
rps_reset_sock_flow(sock_flow_table, sk->sk_rxhash);
|
|
|
|
rcu_read_unlock();
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sock_rps_save_rxhash(struct sock *sk, u32 rxhash)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_RPS
|
|
|
|
if (unlikely(sk->sk_rxhash != rxhash)) {
|
|
|
|
sock_rps_reset_flow(sk);
|
|
|
|
sk->sk_rxhash = rxhash;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2007-10-09 16:59:42 +08:00
|
|
|
#define sk_wait_event(__sk, __timeo, __condition) \
|
|
|
|
({ int __rc; \
|
|
|
|
release_sock(__sk); \
|
|
|
|
__rc = __condition; \
|
|
|
|
if (!__rc) { \
|
|
|
|
*(__timeo) = schedule_timeout(*(__timeo)); \
|
|
|
|
} \
|
|
|
|
lock_sock(__sk); \
|
|
|
|
__rc = __condition; \
|
|
|
|
__rc; \
|
|
|
|
})
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
extern int sk_stream_wait_connect(struct sock *sk, long *timeo_p);
|
|
|
|
extern int sk_stream_wait_memory(struct sock *sk, long *timeo_p);
|
|
|
|
extern void sk_stream_wait_close(struct sock *sk, long timeo_p);
|
|
|
|
extern int sk_stream_error(struct sock *sk, int flags, int err);
|
|
|
|
extern void sk_stream_kill_queues(struct sock *sk);
|
|
|
|
|
|
|
|
extern int sk_wait_data(struct sock *sk, long *timeo);
|
|
|
|
|
2005-06-19 13:47:21 +08:00
|
|
|
struct request_sock_ops;
|
2005-12-14 15:25:19 +08:00
|
|
|
struct timewait_sock_ops;
|
[SOCK] proto: Add hashinfo member to struct proto
This way we can remove TCP and DCCP specific versions of
sk->sk_prot->get_port: both v4 and v6 use inet_csk_get_port
sk->sk_prot->hash: inet_hash is directly used, only v6 need
a specific version to deal with mapped sockets
sk->sk_prot->unhash: both v4 and v6 use inet_hash directly
struct inet_connection_sock_af_ops also gets a new member, bind_conflict, so
that inet_csk_get_port can find the per family routine.
Now only the lookup routines receive as a parameter a struct inet_hashtable.
With this we further reuse code, reducing the difference among INET transport
protocols.
Eventually work has to be done on UDP and SCTP to make them share this
infrastructure and get as a bonus inet_diag interfaces so that iproute can be
used with these protocols.
net-2.6/net/ipv4/inet_hashtables.c:
struct proto | +8
struct inet_connection_sock_af_ops | +8
2 structs changed
__inet_hash_nolisten | +18
__inet_hash | -210
inet_put_port | +8
inet_bind_bucket_create | +1
__inet_hash_connect | -8
5 functions changed, 27 bytes added, 218 bytes removed, diff: -191
net-2.6/net/core/sock.c:
proto_seq_show | +3
1 function changed, 3 bytes added, diff: +3
net-2.6/net/ipv4/inet_connection_sock.c:
inet_csk_get_port | +15
1 function changed, 15 bytes added, diff: +15
net-2.6/net/ipv4/tcp.c:
tcp_set_state | -7
1 function changed, 7 bytes removed, diff: -7
net-2.6/net/ipv4/tcp_ipv4.c:
tcp_v4_get_port | -31
tcp_v4_hash | -48
tcp_v4_destroy_sock | -7
tcp_v4_syn_recv_sock | -2
tcp_unhash | -179
5 functions changed, 267 bytes removed, diff: -267
net-2.6/net/ipv6/inet6_hashtables.c:
__inet6_hash | +8
1 function changed, 8 bytes added, diff: +8
net-2.6/net/ipv4/inet_hashtables.c:
inet_unhash | +190
inet_hash | +242
2 functions changed, 432 bytes added, diff: +432
vmlinux:
16 functions changed, 485 bytes added, 492 bytes removed, diff: -7
/home/acme/git/net-2.6/net/ipv6/tcp_ipv6.c:
tcp_v6_get_port | -31
tcp_v6_hash | -7
tcp_v6_syn_recv_sock | -9
3 functions changed, 47 bytes removed, diff: -47
/home/acme/git/net-2.6/net/dccp/proto.c:
dccp_destroy_sock | -7
dccp_unhash | -179
dccp_hash | -49
dccp_set_state | -7
dccp_done | +1
5 functions changed, 1 bytes added, 242 bytes removed, diff: -241
/home/acme/git/net-2.6/net/dccp/ipv4.c:
dccp_v4_get_port | -31
dccp_v4_request_recv_sock | -2
2 functions changed, 33 bytes removed, diff: -33
/home/acme/git/net-2.6/net/dccp/ipv6.c:
dccp_v6_get_port | -31
dccp_v6_hash | -7
dccp_v6_request_recv_sock | +5
3 functions changed, 5 bytes added, 38 bytes removed, diff: -33
Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-02-03 20:06:04 +08:00
|
|
|
struct inet_hashinfo;
|
2008-03-23 07:56:51 +08:00
|
|
|
struct raw_hashinfo;
|
[NET] Generalise TCP's struct open_request minisock infrastructure
Kept this first changeset minimal, without changing existing names to
ease peer review.
Basicaly tcp_openreq_alloc now receives the or_calltable, that in turn
has two new members:
->slab, that replaces tcp_openreq_cachep
->obj_size, to inform the size of the openreq descendant for
a specific protocol
The protocol specific fields in struct open_request were moved to a
class hierarchy, with the things that are common to all connection
oriented PF_INET protocols in struct inet_request_sock, the TCP ones
in tcp_request_sock, that is an inet_request_sock, that is an
open_request.
I.e. this uses the same approach used for the struct sock class
hierarchy, with sk_prot indicating if the protocol wants to use the
open_request infrastructure by filling in sk_prot->rsk_prot with an
or_calltable.
Results? Performance is improved and TCP v4 now uses only 64 bytes per
open request minisock, down from 96 without this patch :-)
Next changeset will rename some of the structs, fields and functions
mentioned above, struct or_calltable is way unclear, better name it
struct request_sock_ops, s/struct open_request/struct request_sock/g,
etc.
Signed-off-by: Arnaldo Carvalho de Melo <acme@ghostprotocols.net>
Signed-off-by: David S. Miller <davem@davemloft.net>
2005-06-19 13:46:52 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/* Networking protocol blocks we attach to sockets.
|
|
|
|
* socket layer -> transport layer interface
|
|
|
|
* transport -> network interface is defined by struct inet_proto
|
|
|
|
*/
|
|
|
|
struct proto {
|
|
|
|
void (*close)(struct sock *sk,
|
|
|
|
long timeout);
|
|
|
|
int (*connect)(struct sock *sk,
|
|
|
|
struct sockaddr *uaddr,
|
|
|
|
int addr_len);
|
|
|
|
int (*disconnect)(struct sock *sk, int flags);
|
|
|
|
|
|
|
|
struct sock * (*accept) (struct sock *sk, int flags, int *err);
|
|
|
|
|
|
|
|
int (*ioctl)(struct sock *sk, int cmd,
|
|
|
|
unsigned long arg);
|
|
|
|
int (*init)(struct sock *sk);
|
2008-06-15 08:04:49 +08:00
|
|
|
void (*destroy)(struct sock *sk);
|
2005-04-17 06:20:36 +08:00
|
|
|
void (*shutdown)(struct sock *sk, int how);
|
|
|
|
int (*setsockopt)(struct sock *sk, int level,
|
|
|
|
int optname, char __user *optval,
|
2009-10-01 07:12:20 +08:00
|
|
|
unsigned int optlen);
|
2005-04-17 06:20:36 +08:00
|
|
|
int (*getsockopt)(struct sock *sk, int level,
|
|
|
|
int optname, char __user *optval,
|
|
|
|
int __user *option);
|
2008-08-28 17:53:51 +08:00
|
|
|
#ifdef CONFIG_COMPAT
|
2006-03-21 14:45:21 +08:00
|
|
|
int (*compat_setsockopt)(struct sock *sk,
|
|
|
|
int level,
|
|
|
|
int optname, char __user *optval,
|
2009-10-01 07:12:20 +08:00
|
|
|
unsigned int optlen);
|
2006-03-21 14:45:21 +08:00
|
|
|
int (*compat_getsockopt)(struct sock *sk,
|
|
|
|
int level,
|
|
|
|
int optname, char __user *optval,
|
|
|
|
int __user *option);
|
2008-08-28 17:53:51 +08:00
|
|
|
#endif
|
2005-04-17 06:20:36 +08:00
|
|
|
int (*sendmsg)(struct kiocb *iocb, struct sock *sk,
|
|
|
|
struct msghdr *msg, size_t len);
|
|
|
|
int (*recvmsg)(struct kiocb *iocb, struct sock *sk,
|
|
|
|
struct msghdr *msg,
|
|
|
|
size_t len, int noblock, int flags,
|
|
|
|
int *addr_len);
|
|
|
|
int (*sendpage)(struct sock *sk, struct page *page,
|
|
|
|
int offset, size_t size, int flags);
|
|
|
|
int (*bind)(struct sock *sk,
|
|
|
|
struct sockaddr *uaddr, int addr_len);
|
|
|
|
|
|
|
|
int (*backlog_rcv) (struct sock *sk,
|
|
|
|
struct sk_buff *skb);
|
|
|
|
|
|
|
|
/* Keeping track of sk's, looking them up, and port selection methods. */
|
|
|
|
void (*hash)(struct sock *sk);
|
|
|
|
void (*unhash)(struct sock *sk);
|
|
|
|
int (*get_port)(struct sock *sk, unsigned short snum);
|
|
|
|
|
[NET]: Define infrastructure to keep 'inuse' changes in an efficent SMP/NUMA way.
"struct proto" currently uses an array stats[NR_CPUS] to track change on
'inuse' sockets per protocol.
If NR_CPUS is big, this means we use a big memory area for this.
Moreover, all this memory area is located on a single node on NUMA
machines, increasing memory pressure on the boot node.
In this patch, I tried to :
- Keep a fast !CONFIG_SMP implementation
- Keep a fast CONFIG_SMP implementation for often used protocols
(tcp,udp,raw,...)
- Introduce a NUMA efficient implementation
Some helper macros are defined in include/net/sock.h
These macros take into account CONFIG_SMP
If a "struct proto" is declared without using DEFINE_PROTO_INUSE /
REF_PROTO_INUSE
macros, it will automatically use a default implementation, using a
dynamically allocated percpu zone.
This default implementation will be NUMA efficient, but might use 32/64
bytes per possible cpu
because of current alloc_percpu() implementation.
However it still should be better than previous implementation based on
stats[NR_CPUS] field.
When a "struct proto" is changed to use the new macros, we use a single
static "int" percpu variable,
lowering the memory and cpu costs, still preserving NUMA efficiency.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2007-11-06 15:38:39 +08:00
|
|
|
/* Keeping track of sockets in use */
|
2008-01-04 12:46:48 +08:00
|
|
|
#ifdef CONFIG_PROC_FS
|
2008-03-29 07:38:17 +08:00
|
|
|
unsigned int inuse_idx;
|
2008-01-04 12:46:48 +08:00
|
|
|
#endif
|
2007-11-21 22:08:50 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/* Memory pressure */
|
2008-07-17 11:28:10 +08:00
|
|
|
void (*enter_memory_pressure)(struct sock *sk);
|
2005-04-17 06:20:36 +08:00
|
|
|
atomic_t *memory_allocated; /* Current allocated memory. */
|
2008-11-26 13:16:35 +08:00
|
|
|
struct percpu_counter *sockets_allocated; /* Current number of sockets. */
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
* Pressure flag: try to collapse.
|
|
|
|
* Technical note: it is used by multiple contexts non atomically.
|
2007-12-31 16:11:19 +08:00
|
|
|
* All the __sk_mem_schedule() is of this nature: accounting
|
2005-04-17 06:20:36 +08:00
|
|
|
* is strict, actions are advisory and have some latency.
|
|
|
|
*/
|
|
|
|
int *memory_pressure;
|
|
|
|
int *sysctl_mem;
|
|
|
|
int *sysctl_wmem;
|
|
|
|
int *sysctl_rmem;
|
|
|
|
int max_header;
|
|
|
|
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 17:11:14 +08:00
|
|
|
struct kmem_cache *slab;
|
2005-04-17 06:20:36 +08:00
|
|
|
unsigned int obj_size;
|
udp: RCU handling for Unicast packets.
Goals are :
1) Optimizing handling of incoming Unicast UDP frames, so that no memory
writes should happen in the fast path.
Note: Multicasts and broadcasts still will need to take a lock,
because doing a full lockless lookup in this case is difficult.
2) No expensive operations in the socket bind/unhash phases :
- No expensive synchronize_rcu() calls.
- No added rcu_head in socket structure, increasing memory needs,
but more important, forcing us to use call_rcu() calls,
that have the bad property of making sockets structure cold.
(rcu grace period between socket freeing and its potential reuse
make this socket being cold in CPU cache).
David did a previous patch using call_rcu() and noticed a 20%
impact on TCP connection rates.
Quoting Cristopher Lameter :
"Right. That results in cacheline cooldown. You'd want to recycle
the object as they are cache hot on a per cpu basis. That is screwed
up by the delayed regular rcu processing. We have seen multiple
regressions due to cacheline cooldown.
The only choice in cacheline hot sensitive areas is to deal with the
complexity that comes with SLAB_DESTROY_BY_RCU or give up on RCU."
- Because udp sockets are allocated from dedicated kmem_cache,
use of SLAB_DESTROY_BY_RCU can help here.
Theory of operation :
---------------------
As the lookup is lockfree (using rcu_read_lock()/rcu_read_unlock()),
special attention must be taken by readers and writers.
Use of SLAB_DESTROY_BY_RCU is tricky too, because a socket can be freed,
reused, inserted in a different chain or in worst case in the same chain
while readers could do lookups in the same time.
In order to avoid loops, a reader must check each socket found in a chain
really belongs to the chain the reader was traversing. If it finds a
mismatch, lookup must start again at the begining. This *restart* loop
is the reason we had to use rdlock for the multicast case, because
we dont want to send same message several times to the same socket.
We use RCU only for fast path.
Thus, /proc/net/udp still takes spinlocks.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-10-29 17:11:14 +08:00
|
|
|
int slab_flags;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2008-11-26 13:17:14 +08:00
|
|
|
struct percpu_counter *orphan_count;
|
2005-08-10 11:09:30 +08:00
|
|
|
|
2005-06-19 13:47:21 +08:00
|
|
|
struct request_sock_ops *rsk_prot;
|
2005-12-14 15:25:19 +08:00
|
|
|
struct timewait_sock_ops *twsk_prot;
|
[NET] Generalise TCP's struct open_request minisock infrastructure
Kept this first changeset minimal, without changing existing names to
ease peer review.
Basicaly tcp_openreq_alloc now receives the or_calltable, that in turn
has two new members:
->slab, that replaces tcp_openreq_cachep
->obj_size, to inform the size of the openreq descendant for
a specific protocol
The protocol specific fields in struct open_request were moved to a
class hierarchy, with the things that are common to all connection
oriented PF_INET protocols in struct inet_request_sock, the TCP ones
in tcp_request_sock, that is an inet_request_sock, that is an
open_request.
I.e. this uses the same approach used for the struct sock class
hierarchy, with sk_prot indicating if the protocol wants to use the
open_request infrastructure by filling in sk_prot->rsk_prot with an
or_calltable.
Results? Performance is improved and TCP v4 now uses only 64 bytes per
open request minisock, down from 96 without this patch :-)
Next changeset will rename some of the structs, fields and functions
mentioned above, struct or_calltable is way unclear, better name it
struct request_sock_ops, s/struct open_request/struct request_sock/g,
etc.
Signed-off-by: Arnaldo Carvalho de Melo <acme@ghostprotocols.net>
Signed-off-by: David S. Miller <davem@davemloft.net>
2005-06-19 13:46:52 +08:00
|
|
|
|
2008-03-23 07:50:58 +08:00
|
|
|
union {
|
|
|
|
struct inet_hashinfo *hashinfo;
|
2008-10-29 16:41:45 +08:00
|
|
|
struct udp_table *udp_table;
|
2008-03-23 07:56:51 +08:00
|
|
|
struct raw_hashinfo *raw_hash;
|
2008-03-23 07:50:58 +08:00
|
|
|
} h;
|
[SOCK] proto: Add hashinfo member to struct proto
This way we can remove TCP and DCCP specific versions of
sk->sk_prot->get_port: both v4 and v6 use inet_csk_get_port
sk->sk_prot->hash: inet_hash is directly used, only v6 need
a specific version to deal with mapped sockets
sk->sk_prot->unhash: both v4 and v6 use inet_hash directly
struct inet_connection_sock_af_ops also gets a new member, bind_conflict, so
that inet_csk_get_port can find the per family routine.
Now only the lookup routines receive as a parameter a struct inet_hashtable.
With this we further reuse code, reducing the difference among INET transport
protocols.
Eventually work has to be done on UDP and SCTP to make them share this
infrastructure and get as a bonus inet_diag interfaces so that iproute can be
used with these protocols.
net-2.6/net/ipv4/inet_hashtables.c:
struct proto | +8
struct inet_connection_sock_af_ops | +8
2 structs changed
__inet_hash_nolisten | +18
__inet_hash | -210
inet_put_port | +8
inet_bind_bucket_create | +1
__inet_hash_connect | -8
5 functions changed, 27 bytes added, 218 bytes removed, diff: -191
net-2.6/net/core/sock.c:
proto_seq_show | +3
1 function changed, 3 bytes added, diff: +3
net-2.6/net/ipv4/inet_connection_sock.c:
inet_csk_get_port | +15
1 function changed, 15 bytes added, diff: +15
net-2.6/net/ipv4/tcp.c:
tcp_set_state | -7
1 function changed, 7 bytes removed, diff: -7
net-2.6/net/ipv4/tcp_ipv4.c:
tcp_v4_get_port | -31
tcp_v4_hash | -48
tcp_v4_destroy_sock | -7
tcp_v4_syn_recv_sock | -2
tcp_unhash | -179
5 functions changed, 267 bytes removed, diff: -267
net-2.6/net/ipv6/inet6_hashtables.c:
__inet6_hash | +8
1 function changed, 8 bytes added, diff: +8
net-2.6/net/ipv4/inet_hashtables.c:
inet_unhash | +190
inet_hash | +242
2 functions changed, 432 bytes added, diff: +432
vmlinux:
16 functions changed, 485 bytes added, 492 bytes removed, diff: -7
/home/acme/git/net-2.6/net/ipv6/tcp_ipv6.c:
tcp_v6_get_port | -31
tcp_v6_hash | -7
tcp_v6_syn_recv_sock | -9
3 functions changed, 47 bytes removed, diff: -47
/home/acme/git/net-2.6/net/dccp/proto.c:
dccp_destroy_sock | -7
dccp_unhash | -179
dccp_hash | -49
dccp_set_state | -7
dccp_done | +1
5 functions changed, 1 bytes added, 242 bytes removed, diff: -241
/home/acme/git/net-2.6/net/dccp/ipv4.c:
dccp_v4_get_port | -31
dccp_v4_request_recv_sock | -2
2 functions changed, 33 bytes removed, diff: -33
/home/acme/git/net-2.6/net/dccp/ipv6.c:
dccp_v6_get_port | -31
dccp_v6_hash | -7
dccp_v6_request_recv_sock | +5
3 functions changed, 5 bytes added, 38 bytes removed, diff: -33
Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-02-03 20:06:04 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
struct module *owner;
|
|
|
|
|
|
|
|
char name[32];
|
|
|
|
|
|
|
|
struct list_head node;
|
2005-08-10 10:45:38 +08:00
|
|
|
#ifdef SOCK_REFCNT_DEBUG
|
|
|
|
atomic_t socks;
|
|
|
|
#endif
|
2005-04-17 06:20:36 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
extern int proto_register(struct proto *prot, int alloc_slab);
|
|
|
|
extern void proto_unregister(struct proto *prot);
|
|
|
|
|
2005-08-10 10:45:38 +08:00
|
|
|
#ifdef SOCK_REFCNT_DEBUG
|
|
|
|
static inline void sk_refcnt_debug_inc(struct sock *sk)
|
|
|
|
{
|
|
|
|
atomic_inc(&sk->sk_prot->socks);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sk_refcnt_debug_dec(struct sock *sk)
|
|
|
|
{
|
|
|
|
atomic_dec(&sk->sk_prot->socks);
|
|
|
|
printk(KERN_DEBUG "%s socket %p released, %d are still alive\n",
|
|
|
|
sk->sk_prot->name, sk, atomic_read(&sk->sk_prot->socks));
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sk_refcnt_debug_release(const struct sock *sk)
|
|
|
|
{
|
|
|
|
if (atomic_read(&sk->sk_refcnt) != 1)
|
|
|
|
printk(KERN_DEBUG "Destruction of the %s socket %p delayed, refcnt=%d\n",
|
|
|
|
sk->sk_prot->name, sk, atomic_read(&sk->sk_refcnt));
|
|
|
|
}
|
|
|
|
#else /* SOCK_REFCNT_DEBUG */
|
|
|
|
#define sk_refcnt_debug_inc(sk) do { } while (0)
|
|
|
|
#define sk_refcnt_debug_dec(sk) do { } while (0)
|
|
|
|
#define sk_refcnt_debug_release(sk) do { } while (0)
|
|
|
|
#endif /* SOCK_REFCNT_DEBUG */
|
|
|
|
|
2008-01-04 12:46:48 +08:00
|
|
|
|
|
|
|
#ifdef CONFIG_PROC_FS
|
2005-04-17 06:20:36 +08:00
|
|
|
/* Called with local bh disabled */
|
2008-04-01 10:41:46 +08:00
|
|
|
extern void sock_prot_inuse_add(struct net *net, struct proto *prot, int inc);
|
|
|
|
extern int sock_prot_inuse_get(struct net *net, struct proto *proto);
|
2008-01-04 12:46:48 +08:00
|
|
|
#else
|
2008-04-01 10:41:46 +08:00
|
|
|
static void inline sock_prot_inuse_add(struct net *net, struct proto *prot,
|
|
|
|
int inc)
|
2008-01-04 12:46:48 +08:00
|
|
|
{
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2005-08-10 10:47:37 +08:00
|
|
|
/* With per-bucket locks this operation is not-atomic, so that
|
|
|
|
* this version is not worse.
|
|
|
|
*/
|
|
|
|
static inline void __sk_prot_rehash(struct sock *sk)
|
|
|
|
{
|
|
|
|
sk->sk_prot->unhash(sk);
|
|
|
|
sk->sk_prot->hash(sk);
|
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/* About 10 seconds */
|
|
|
|
#define SOCK_DESTROY_TIME (10*HZ)
|
|
|
|
|
|
|
|
/* Sockets 0-1023 can't be bound to unless you are superuser */
|
|
|
|
#define PROT_SOCK 1024
|
|
|
|
|
|
|
|
#define SHUTDOWN_MASK 3
|
|
|
|
#define RCV_SHUTDOWN 1
|
|
|
|
#define SEND_SHUTDOWN 2
|
|
|
|
|
|
|
|
#define SOCK_SNDBUF_LOCK 1
|
|
|
|
#define SOCK_RCVBUF_LOCK 2
|
|
|
|
#define SOCK_BINDADDR_LOCK 4
|
|
|
|
#define SOCK_BINDPORT_LOCK 8
|
|
|
|
|
|
|
|
/* sock_iocb: used to kick off async processing of socket ios */
|
|
|
|
struct sock_iocb {
|
|
|
|
struct list_head list;
|
|
|
|
|
|
|
|
int flags;
|
|
|
|
int size;
|
|
|
|
struct socket *sock;
|
|
|
|
struct sock *sk;
|
|
|
|
struct scm_cookie *scm;
|
|
|
|
struct msghdr *msg, async_msg;
|
|
|
|
struct kiocb *kiocb;
|
|
|
|
};
|
|
|
|
|
|
|
|
static inline struct sock_iocb *kiocb_to_siocb(struct kiocb *iocb)
|
|
|
|
{
|
|
|
|
return (struct sock_iocb *)iocb->private;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline struct kiocb *siocb_to_kiocb(struct sock_iocb *si)
|
|
|
|
{
|
|
|
|
return si->kiocb;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct socket_alloc {
|
|
|
|
struct socket socket;
|
|
|
|
struct inode vfs_inode;
|
|
|
|
};
|
|
|
|
|
|
|
|
static inline struct socket *SOCKET_I(struct inode *inode)
|
|
|
|
{
|
|
|
|
return &container_of(inode, struct socket_alloc, vfs_inode)->socket;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline struct inode *SOCK_INODE(struct socket *socket)
|
|
|
|
{
|
|
|
|
return &container_of(socket, struct socket_alloc, socket)->vfs_inode;
|
|
|
|
}
|
|
|
|
|
2007-12-31 16:11:19 +08:00
|
|
|
/*
|
|
|
|
* Functions for memory accounting
|
|
|
|
*/
|
|
|
|
extern int __sk_mem_schedule(struct sock *sk, int size, int kind);
|
|
|
|
extern void __sk_mem_reclaim(struct sock *sk);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2007-12-31 16:11:19 +08:00
|
|
|
#define SK_MEM_QUANTUM ((int)PAGE_SIZE)
|
|
|
|
#define SK_MEM_QUANTUM_SHIFT ilog2(SK_MEM_QUANTUM)
|
|
|
|
#define SK_MEM_SEND 0
|
|
|
|
#define SK_MEM_RECV 1
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2007-12-31 16:11:19 +08:00
|
|
|
static inline int sk_mem_pages(int amt)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2007-12-31 16:11:19 +08:00
|
|
|
return (amt + SK_MEM_QUANTUM - 1) >> SK_MEM_QUANTUM_SHIFT;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
2007-12-31 16:11:19 +08:00
|
|
|
static inline int sk_has_account(struct sock *sk)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2007-12-31 16:11:19 +08:00
|
|
|
/* return true if protocol supports memory accounting */
|
|
|
|
return !!sk->sk_prot->memory_allocated;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
2007-12-31 16:11:19 +08:00
|
|
|
static inline int sk_wmem_schedule(struct sock *sk, int size)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2007-12-31 16:11:19 +08:00
|
|
|
if (!sk_has_account(sk))
|
|
|
|
return 1;
|
|
|
|
return size <= sk->sk_forward_alloc ||
|
|
|
|
__sk_mem_schedule(sk, size, SK_MEM_SEND);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
2007-12-31 16:11:19 +08:00
|
|
|
static inline int sk_rmem_schedule(struct sock *sk, int size)
|
2005-09-02 08:48:23 +08:00
|
|
|
{
|
2007-12-31 16:11:19 +08:00
|
|
|
if (!sk_has_account(sk))
|
|
|
|
return 1;
|
2005-09-02 08:48:23 +08:00
|
|
|
return size <= sk->sk_forward_alloc ||
|
2007-12-31 16:11:19 +08:00
|
|
|
__sk_mem_schedule(sk, size, SK_MEM_RECV);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sk_mem_reclaim(struct sock *sk)
|
|
|
|
{
|
|
|
|
if (!sk_has_account(sk))
|
|
|
|
return;
|
|
|
|
if (sk->sk_forward_alloc >= SK_MEM_QUANTUM)
|
|
|
|
__sk_mem_reclaim(sk);
|
|
|
|
}
|
|
|
|
|
2008-01-11 13:56:38 +08:00
|
|
|
static inline void sk_mem_reclaim_partial(struct sock *sk)
|
|
|
|
{
|
|
|
|
if (!sk_has_account(sk))
|
|
|
|
return;
|
|
|
|
if (sk->sk_forward_alloc > SK_MEM_QUANTUM)
|
|
|
|
__sk_mem_reclaim(sk);
|
|
|
|
}
|
|
|
|
|
2007-12-31 16:11:19 +08:00
|
|
|
static inline void sk_mem_charge(struct sock *sk, int size)
|
|
|
|
{
|
|
|
|
if (!sk_has_account(sk))
|
|
|
|
return;
|
|
|
|
sk->sk_forward_alloc -= size;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sk_mem_uncharge(struct sock *sk, int size)
|
|
|
|
{
|
|
|
|
if (!sk_has_account(sk))
|
|
|
|
return;
|
|
|
|
sk->sk_forward_alloc += size;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sk_wmem_free_skb(struct sock *sk, struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
sock_set_flag(sk, SOCK_QUEUE_SHRUNK);
|
|
|
|
sk->sk_wmem_queued -= skb->truesize;
|
|
|
|
sk_mem_uncharge(sk, skb->truesize);
|
|
|
|
__kfree_skb(skb);
|
2005-09-02 08:48:23 +08:00
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/* Used by processes to "lock" a socket state, so that
|
|
|
|
* interrupts and bottom half handlers won't change it
|
|
|
|
* from under us. It essentially blocks any incoming
|
|
|
|
* packets, so that we won't get any new data or any
|
|
|
|
* packets that change the state of the socket.
|
|
|
|
*
|
|
|
|
* While locked, BH processing will add new packets to
|
|
|
|
* the backlog queue. This queue is processed by the
|
|
|
|
* owner of the socket lock right before it is released.
|
|
|
|
*
|
|
|
|
* Since ~2.3.5 it is also exclusive sleep lock serializing
|
|
|
|
* accesses from user process context.
|
|
|
|
*/
|
2007-09-12 16:44:19 +08:00
|
|
|
#define sock_owned_by_user(sk) ((sk)->sk_lock.owned)
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-12-07 12:35:24 +08:00
|
|
|
/*
|
|
|
|
* Macro so as to not evaluate some arguments when
|
|
|
|
* lockdep is not enabled.
|
|
|
|
*
|
|
|
|
* Mark both the sk_lock and the sk_lock.slock as a
|
|
|
|
* per-address-family lock class.
|
|
|
|
*/
|
|
|
|
#define sock_lock_init_class_and_name(sk, sname, skey, name, key) \
|
|
|
|
do { \
|
2008-11-12 09:38:36 +08:00
|
|
|
sk->sk_lock.owned = 0; \
|
2006-12-07 12:35:24 +08:00
|
|
|
init_waitqueue_head(&sk->sk_lock.wq); \
|
|
|
|
spin_lock_init(&(sk)->sk_lock.slock); \
|
|
|
|
debug_check_no_locks_freed((void *)&(sk)->sk_lock, \
|
|
|
|
sizeof((sk)->sk_lock)); \
|
|
|
|
lockdep_set_class_and_name(&(sk)->sk_lock.slock, \
|
|
|
|
(skey), (sname)); \
|
|
|
|
lockdep_init_map(&(sk)->sk_lock.dep_map, (name), (key), 0); \
|
|
|
|
} while (0)
|
|
|
|
|
2007-12-13 02:46:51 +08:00
|
|
|
extern void lock_sock_nested(struct sock *sk, int subclass);
|
2006-11-09 14:44:35 +08:00
|
|
|
|
|
|
|
static inline void lock_sock(struct sock *sk)
|
|
|
|
{
|
|
|
|
lock_sock_nested(sk, 0);
|
|
|
|
}
|
|
|
|
|
2007-12-13 02:46:51 +08:00
|
|
|
extern void release_sock(struct sock *sk);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/* BH context may only use the following locking interface. */
|
|
|
|
#define bh_lock_sock(__sk) spin_lock(&((__sk)->sk_lock.slock))
|
2006-07-03 15:25:13 +08:00
|
|
|
#define bh_lock_sock_nested(__sk) \
|
|
|
|
spin_lock_nested(&((__sk)->sk_lock.slock), \
|
|
|
|
SINGLE_DEPTH_NESTING)
|
2005-04-17 06:20:36 +08:00
|
|
|
#define bh_unlock_sock(__sk) spin_unlock(&((__sk)->sk_lock.slock))
|
|
|
|
|
2010-04-29 05:35:48 +08:00
|
|
|
static inline void lock_sock_bh(struct sock *sk)
|
|
|
|
{
|
|
|
|
spin_lock_bh(&sk->sk_lock.slock);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void unlock_sock_bh(struct sock *sk)
|
|
|
|
{
|
|
|
|
spin_unlock_bh(&sk->sk_lock.slock);
|
|
|
|
}
|
|
|
|
|
2007-10-09 14:24:22 +08:00
|
|
|
extern struct sock *sk_alloc(struct net *net, int family,
|
2005-10-07 14:46:04 +08:00
|
|
|
gfp_t priority,
|
2007-11-01 15:39:31 +08:00
|
|
|
struct proto *prot);
|
2005-04-17 06:20:36 +08:00
|
|
|
extern void sk_free(struct sock *sk);
|
2008-03-01 03:18:32 +08:00
|
|
|
extern void sk_release_kernel(struct sock *sk);
|
2005-08-10 11:10:12 +08:00
|
|
|
extern struct sock *sk_clone(const struct sock *sk,
|
2005-10-07 14:46:04 +08:00
|
|
|
const gfp_t priority);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
extern struct sk_buff *sock_wmalloc(struct sock *sk,
|
|
|
|
unsigned long size, int force,
|
2005-10-07 14:46:04 +08:00
|
|
|
gfp_t priority);
|
2005-04-17 06:20:36 +08:00
|
|
|
extern struct sk_buff *sock_rmalloc(struct sock *sk,
|
|
|
|
unsigned long size, int force,
|
2005-10-07 14:46:04 +08:00
|
|
|
gfp_t priority);
|
2005-04-17 06:20:36 +08:00
|
|
|
extern void sock_wfree(struct sk_buff *skb);
|
|
|
|
extern void sock_rfree(struct sk_buff *skb);
|
|
|
|
|
|
|
|
extern int sock_setsockopt(struct socket *sock, int level,
|
|
|
|
int op, char __user *optval,
|
2009-10-01 07:12:20 +08:00
|
|
|
unsigned int optlen);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
extern int sock_getsockopt(struct socket *sock, int level,
|
|
|
|
int op, char __user *optval,
|
|
|
|
int __user *optlen);
|
|
|
|
extern struct sk_buff *sock_alloc_send_skb(struct sock *sk,
|
|
|
|
unsigned long size,
|
|
|
|
int noblock,
|
|
|
|
int *errcode);
|
2009-02-05 08:55:54 +08:00
|
|
|
extern struct sk_buff *sock_alloc_send_pskb(struct sock *sk,
|
|
|
|
unsigned long header_len,
|
|
|
|
unsigned long data_len,
|
|
|
|
int noblock,
|
|
|
|
int *errcode);
|
2005-07-09 05:57:47 +08:00
|
|
|
extern void *sock_kmalloc(struct sock *sk, int size,
|
2005-10-07 14:46:04 +08:00
|
|
|
gfp_t priority);
|
2005-04-17 06:20:36 +08:00
|
|
|
extern void sock_kfree_s(struct sock *sk, void *mem, int size);
|
|
|
|
extern void sk_send_sigurg(struct sock *sk);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Functions to fill in entries in struct proto_ops when a protocol
|
|
|
|
* does not implement a particular function.
|
|
|
|
*/
|
|
|
|
extern int sock_no_bind(struct socket *,
|
|
|
|
struct sockaddr *, int);
|
|
|
|
extern int sock_no_connect(struct socket *,
|
|
|
|
struct sockaddr *, int, int);
|
|
|
|
extern int sock_no_socketpair(struct socket *,
|
|
|
|
struct socket *);
|
|
|
|
extern int sock_no_accept(struct socket *,
|
|
|
|
struct socket *, int);
|
|
|
|
extern int sock_no_getname(struct socket *,
|
|
|
|
struct sockaddr *, int *, int);
|
|
|
|
extern unsigned int sock_no_poll(struct file *, struct socket *,
|
|
|
|
struct poll_table_struct *);
|
|
|
|
extern int sock_no_ioctl(struct socket *, unsigned int,
|
|
|
|
unsigned long);
|
|
|
|
extern int sock_no_listen(struct socket *, int);
|
|
|
|
extern int sock_no_shutdown(struct socket *, int);
|
|
|
|
extern int sock_no_getsockopt(struct socket *, int , int,
|
|
|
|
char __user *, int __user *);
|
|
|
|
extern int sock_no_setsockopt(struct socket *, int, int,
|
2009-10-01 07:12:20 +08:00
|
|
|
char __user *, unsigned int);
|
2005-04-17 06:20:36 +08:00
|
|
|
extern int sock_no_sendmsg(struct kiocb *, struct socket *,
|
|
|
|
struct msghdr *, size_t);
|
|
|
|
extern int sock_no_recvmsg(struct kiocb *, struct socket *,
|
|
|
|
struct msghdr *, size_t, int);
|
|
|
|
extern int sock_no_mmap(struct file *file,
|
|
|
|
struct socket *sock,
|
|
|
|
struct vm_area_struct *vma);
|
|
|
|
extern ssize_t sock_no_sendpage(struct socket *sock,
|
|
|
|
struct page *page,
|
|
|
|
int offset, size_t size,
|
|
|
|
int flags);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Functions to fill in entries in struct proto_ops when a protocol
|
|
|
|
* uses the inet style.
|
|
|
|
*/
|
|
|
|
extern int sock_common_getsockopt(struct socket *sock, int level, int optname,
|
|
|
|
char __user *optval, int __user *optlen);
|
|
|
|
extern int sock_common_recvmsg(struct kiocb *iocb, struct socket *sock,
|
|
|
|
struct msghdr *msg, size_t size, int flags);
|
|
|
|
extern int sock_common_setsockopt(struct socket *sock, int level, int optname,
|
2009-10-01 07:12:20 +08:00
|
|
|
char __user *optval, unsigned int optlen);
|
2006-03-21 14:45:21 +08:00
|
|
|
extern int compat_sock_common_getsockopt(struct socket *sock, int level,
|
|
|
|
int optname, char __user *optval, int __user *optlen);
|
|
|
|
extern int compat_sock_common_setsockopt(struct socket *sock, int level,
|
2009-10-01 07:12:20 +08:00
|
|
|
int optname, char __user *optval, unsigned int optlen);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
extern void sk_common_release(struct sock *sk);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Default socket callbacks and setup code
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Initialise core socket variables */
|
|
|
|
extern void sock_init_data(struct socket *sock, struct sock *sk);
|
|
|
|
|
2006-11-24 09:56:13 +08:00
|
|
|
/**
|
2010-02-15 14:35:47 +08:00
|
|
|
* sk_filter_release - release a socket filter
|
2006-11-24 09:56:13 +08:00
|
|
|
* @fp: filter to remove
|
|
|
|
*
|
|
|
|
* Remove a filter from a socket and release its resources.
|
|
|
|
*/
|
|
|
|
|
2007-10-18 12:21:51 +08:00
|
|
|
static inline void sk_filter_release(struct sk_filter *fp)
|
|
|
|
{
|
|
|
|
if (atomic_dec_and_test(&fp->refcnt))
|
2007-10-18 12:22:42 +08:00
|
|
|
kfree(fp);
|
2007-10-18 12:21:51 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sk_filter_uncharge(struct sock *sk, struct sk_filter *fp)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
unsigned int size = sk_filter_len(fp);
|
|
|
|
|
|
|
|
atomic_sub(size, &sk->sk_omem_alloc);
|
2007-10-18 12:21:51 +08:00
|
|
|
sk_filter_release(fp);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sk_filter_charge(struct sock *sk, struct sk_filter *fp)
|
|
|
|
{
|
|
|
|
atomic_inc(&fp->refcnt);
|
|
|
|
atomic_add(sk_filter_len(fp), &sk->sk_omem_alloc);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Socket reference counting postulates.
|
|
|
|
*
|
|
|
|
* * Each user of socket SHOULD hold a reference count.
|
|
|
|
* * Each access point to socket (an hash table bucket, reference from a list,
|
|
|
|
* running timer, skb in flight MUST hold a reference count.
|
|
|
|
* * When reference count hits 0, it means it will never increase back.
|
|
|
|
* * When reference count hits 0, it means that no references from
|
|
|
|
* outside exist to this socket and current process on current CPU
|
|
|
|
* is last user and may/should destroy this socket.
|
|
|
|
* * sk_free is called from any context: process, BH, IRQ. When
|
|
|
|
* it is called, socket has no references from outside -> sk_free
|
|
|
|
* may release descendant resources allocated by the socket, but
|
|
|
|
* to the time when it is called, socket is NOT referenced by any
|
|
|
|
* hash tables, lists etc.
|
|
|
|
* * Packets, delivered from outside (from network or from another process)
|
|
|
|
* and enqueued on receive/error queues SHOULD NOT grab reference count,
|
|
|
|
* when they sit in queue. Otherwise, packets will leak to hole, when
|
|
|
|
* socket is looked up by one cpu and unhasing is made by another CPU.
|
|
|
|
* It is true for udp/raw, netlink (leak to receive and error queues), tcp
|
|
|
|
* (leak to backlog). Packet socket does all the processing inside
|
|
|
|
* BR_NETPROTO_LOCK, so that it has not this race condition. UNIX sockets
|
|
|
|
* use separate SMP lock, so that they are prone too.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Ungrab socket and destroy it, if it was the last reference. */
|
|
|
|
static inline void sock_put(struct sock *sk)
|
|
|
|
{
|
|
|
|
if (atomic_dec_and_test(&sk->sk_refcnt))
|
|
|
|
sk_free(sk);
|
|
|
|
}
|
|
|
|
|
2006-11-17 00:06:06 +08:00
|
|
|
extern int sk_receive_skb(struct sock *sk, struct sk_buff *skb,
|
|
|
|
const int nested);
|
2005-12-27 12:42:22 +08:00
|
|
|
|
2009-10-20 07:46:20 +08:00
|
|
|
static inline void sk_tx_queue_set(struct sock *sk, int tx_queue)
|
|
|
|
{
|
|
|
|
sk->sk_tx_queue_mapping = tx_queue;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sk_tx_queue_clear(struct sock *sk)
|
|
|
|
{
|
|
|
|
sk->sk_tx_queue_mapping = -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int sk_tx_queue_get(const struct sock *sk)
|
|
|
|
{
|
|
|
|
return sk->sk_tx_queue_mapping;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline bool sk_tx_queue_recorded(const struct sock *sk)
|
|
|
|
{
|
|
|
|
return (sk && sk->sk_tx_queue_mapping >= 0);
|
|
|
|
}
|
|
|
|
|
2008-06-18 13:41:38 +08:00
|
|
|
static inline void sk_set_socket(struct sock *sk, struct socket *sock)
|
|
|
|
{
|
2009-10-20 07:46:20 +08:00
|
|
|
sk_tx_queue_clear(sk);
|
2008-06-18 13:41:38 +08:00
|
|
|
sk->sk_socket = sock;
|
|
|
|
}
|
|
|
|
|
2010-04-20 21:03:51 +08:00
|
|
|
static inline wait_queue_head_t *sk_sleep(struct sock *sk)
|
|
|
|
{
|
|
|
|
return sk->sk_sleep;
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
/* Detach socket from process context.
|
|
|
|
* Announce socket dead, detach it from wait queue and inode.
|
|
|
|
* Note that parent inode held reference count on this struct sock,
|
|
|
|
* we do not release it in this function, because protocol
|
|
|
|
* probably wants some additional cleanups or even continuing
|
|
|
|
* to work with this socket (TCP).
|
|
|
|
*/
|
|
|
|
static inline void sock_orphan(struct sock *sk)
|
|
|
|
{
|
|
|
|
write_lock_bh(&sk->sk_callback_lock);
|
|
|
|
sock_set_flag(sk, SOCK_DEAD);
|
2008-06-18 13:41:38 +08:00
|
|
|
sk_set_socket(sk, NULL);
|
2005-04-17 06:20:36 +08:00
|
|
|
sk->sk_sleep = NULL;
|
|
|
|
write_unlock_bh(&sk->sk_callback_lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sock_graft(struct sock *sk, struct socket *parent)
|
|
|
|
{
|
|
|
|
write_lock_bh(&sk->sk_callback_lock);
|
|
|
|
sk->sk_sleep = &parent->wait;
|
|
|
|
parent->sk = sk;
|
2008-06-18 13:41:38 +08:00
|
|
|
sk_set_socket(sk, parent);
|
2006-07-25 14:32:50 +08:00
|
|
|
security_sock_graft(sk, parent);
|
2005-04-17 06:20:36 +08:00
|
|
|
write_unlock_bh(&sk->sk_callback_lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
extern int sock_i_uid(struct sock *sk);
|
|
|
|
extern unsigned long sock_i_ino(struct sock *sk);
|
|
|
|
|
|
|
|
static inline struct dst_entry *
|
|
|
|
__sk_dst_get(struct sock *sk)
|
|
|
|
{
|
2010-04-09 07:03:29 +08:00
|
|
|
return rcu_dereference_check(sk->sk_dst_cache, rcu_read_lock_held() ||
|
2010-04-23 07:06:59 +08:00
|
|
|
sock_owned_by_user(sk) ||
|
|
|
|
lockdep_is_held(&sk->sk_lock.slock));
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline struct dst_entry *
|
|
|
|
sk_dst_get(struct sock *sk)
|
|
|
|
{
|
|
|
|
struct dst_entry *dst;
|
|
|
|
|
2010-04-09 07:03:29 +08:00
|
|
|
rcu_read_lock();
|
|
|
|
dst = rcu_dereference(sk->sk_dst_cache);
|
2005-04-17 06:20:36 +08:00
|
|
|
if (dst)
|
|
|
|
dst_hold(dst);
|
2010-04-09 07:03:29 +08:00
|
|
|
rcu_read_unlock();
|
2005-04-17 06:20:36 +08:00
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
2010-04-09 07:03:29 +08:00
|
|
|
extern void sk_reset_txq(struct sock *sk);
|
|
|
|
|
|
|
|
static inline void dst_negative_advice(struct sock *sk)
|
|
|
|
{
|
|
|
|
struct dst_entry *ndst, *dst = __sk_dst_get(sk);
|
|
|
|
|
|
|
|
if (dst && dst->ops->negative_advice) {
|
|
|
|
ndst = dst->ops->negative_advice(dst);
|
|
|
|
|
|
|
|
if (ndst != dst) {
|
|
|
|
rcu_assign_pointer(sk->sk_dst_cache, ndst);
|
|
|
|
sk_reset_txq(sk);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
static inline void
|
|
|
|
__sk_dst_set(struct sock *sk, struct dst_entry *dst)
|
|
|
|
{
|
|
|
|
struct dst_entry *old_dst;
|
|
|
|
|
2009-10-20 07:46:20 +08:00
|
|
|
sk_tx_queue_clear(sk);
|
2010-04-27 04:40:43 +08:00
|
|
|
/*
|
|
|
|
* This can be called while sk is owned by the caller only,
|
|
|
|
* with no state that can be checked in a rcu_dereference_check() cond
|
|
|
|
*/
|
|
|
|
old_dst = rcu_dereference_raw(sk->sk_dst_cache);
|
2010-04-09 07:03:29 +08:00
|
|
|
rcu_assign_pointer(sk->sk_dst_cache, dst);
|
2005-04-17 06:20:36 +08:00
|
|
|
dst_release(old_dst);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void
|
|
|
|
sk_dst_set(struct sock *sk, struct dst_entry *dst)
|
|
|
|
{
|
2010-04-09 07:03:29 +08:00
|
|
|
spin_lock(&sk->sk_dst_lock);
|
2005-04-17 06:20:36 +08:00
|
|
|
__sk_dst_set(sk, dst);
|
2010-04-09 07:03:29 +08:00
|
|
|
spin_unlock(&sk->sk_dst_lock);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline void
|
|
|
|
__sk_dst_reset(struct sock *sk)
|
|
|
|
{
|
2010-04-09 07:03:29 +08:00
|
|
|
__sk_dst_set(sk, NULL);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline void
|
|
|
|
sk_dst_reset(struct sock *sk)
|
|
|
|
{
|
2010-04-09 07:03:29 +08:00
|
|
|
spin_lock(&sk->sk_dst_lock);
|
2005-04-17 06:20:36 +08:00
|
|
|
__sk_dst_reset(sk);
|
2010-04-09 07:03:29 +08:00
|
|
|
spin_unlock(&sk->sk_dst_lock);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
2006-03-28 17:08:21 +08:00
|
|
|
extern struct dst_entry *__sk_dst_check(struct sock *sk, u32 cookie);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-03-28 17:08:21 +08:00
|
|
|
extern struct dst_entry *sk_dst_check(struct sock *sk, u32 cookie);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2006-07-01 04:36:35 +08:00
|
|
|
static inline int sk_can_gso(const struct sock *sk)
|
|
|
|
{
|
|
|
|
return net_gso_ok(sk->sk_route_caps, sk->sk_gso_type);
|
|
|
|
}
|
|
|
|
|
2007-04-21 08:12:43 +08:00
|
|
|
extern void sk_setup_caps(struct sock *sk, struct dst_entry *dst);
|
2005-08-10 10:49:02 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
static inline int skb_copy_to_page(struct sock *sk, char __user *from,
|
|
|
|
struct sk_buff *skb, struct page *page,
|
|
|
|
int off, int copy)
|
|
|
|
{
|
|
|
|
if (skb->ip_summed == CHECKSUM_NONE) {
|
|
|
|
int err = 0;
|
2006-11-15 13:36:34 +08:00
|
|
|
__wsum csum = csum_and_copy_from_user(from,
|
2005-04-17 06:20:36 +08:00
|
|
|
page_address(page) + off,
|
|
|
|
copy, 0, &err);
|
|
|
|
if (err)
|
|
|
|
return err;
|
|
|
|
skb->csum = csum_block_add(skb->csum, csum, skb->len);
|
|
|
|
} else if (copy_from_user(page_address(page) + off, from, copy))
|
|
|
|
return -EFAULT;
|
|
|
|
|
|
|
|
skb->len += copy;
|
|
|
|
skb->data_len += copy;
|
|
|
|
skb->truesize += copy;
|
|
|
|
sk->sk_wmem_queued += copy;
|
2007-12-31 16:11:19 +08:00
|
|
|
sk_mem_charge(sk, copy);
|
2005-04-17 06:20:36 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-06-16 18:12:03 +08:00
|
|
|
/**
|
|
|
|
* sk_wmem_alloc_get - returns write allocations
|
|
|
|
* @sk: socket
|
|
|
|
*
|
|
|
|
* Returns sk_wmem_alloc minus initial offset of one
|
|
|
|
*/
|
|
|
|
static inline int sk_wmem_alloc_get(const struct sock *sk)
|
|
|
|
{
|
|
|
|
return atomic_read(&sk->sk_wmem_alloc) - 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sk_rmem_alloc_get - returns read allocations
|
|
|
|
* @sk: socket
|
|
|
|
*
|
|
|
|
* Returns sk_rmem_alloc
|
|
|
|
*/
|
|
|
|
static inline int sk_rmem_alloc_get(const struct sock *sk)
|
|
|
|
{
|
|
|
|
return atomic_read(&sk->sk_rmem_alloc);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sk_has_allocations - check if allocations are outstanding
|
|
|
|
* @sk: socket
|
|
|
|
*
|
|
|
|
* Returns true if socket has write or read allocations
|
|
|
|
*/
|
|
|
|
static inline int sk_has_allocations(const struct sock *sk)
|
|
|
|
{
|
|
|
|
return sk_wmem_alloc_get(sk) || sk_rmem_alloc_get(sk);
|
|
|
|
}
|
|
|
|
|
2009-07-08 20:09:13 +08:00
|
|
|
/**
|
|
|
|
* sk_has_sleeper - check if there are any waiting processes
|
|
|
|
* @sk: socket
|
|
|
|
*
|
|
|
|
* Returns true if socket has waiting processes
|
|
|
|
*
|
|
|
|
* The purpose of the sk_has_sleeper and sock_poll_wait is to wrap the memory
|
|
|
|
* barrier call. They were added due to the race found within the tcp code.
|
|
|
|
*
|
|
|
|
* Consider following tcp code paths:
|
|
|
|
*
|
|
|
|
* CPU1 CPU2
|
|
|
|
*
|
|
|
|
* sys_select receive packet
|
|
|
|
* ... ...
|
|
|
|
* __add_wait_queue update tp->rcv_nxt
|
|
|
|
* ... ...
|
|
|
|
* tp->rcv_nxt check sock_def_readable
|
|
|
|
* ... {
|
|
|
|
* schedule ...
|
2010-04-20 21:03:51 +08:00
|
|
|
* if (sk_sleep(sk) && waitqueue_active(sk_sleep(sk)))
|
|
|
|
* wake_up_interruptible(sk_sleep(sk))
|
2009-07-08 20:09:13 +08:00
|
|
|
* ...
|
|
|
|
* }
|
|
|
|
*
|
|
|
|
* The race for tcp fires when the __add_wait_queue changes done by CPU1 stay
|
|
|
|
* in its cache, and so does the tp->rcv_nxt update on CPU2 side. The CPU1
|
|
|
|
* could then endup calling schedule and sleep forever if there are no more
|
|
|
|
* data on the socket.
|
2009-07-08 20:10:31 +08:00
|
|
|
*
|
|
|
|
* The sk_has_sleeper is always called right after a call to read_lock, so we
|
|
|
|
* can use smp_mb__after_lock barrier.
|
2009-07-08 20:09:13 +08:00
|
|
|
*/
|
|
|
|
static inline int sk_has_sleeper(struct sock *sk)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* We need to be sure we are in sync with the
|
|
|
|
* add_wait_queue modifications to the wait queue.
|
|
|
|
*
|
|
|
|
* This memory barrier is paired in the sock_poll_wait.
|
|
|
|
*/
|
2009-07-08 20:10:31 +08:00
|
|
|
smp_mb__after_lock();
|
2010-04-20 21:03:51 +08:00
|
|
|
return sk_sleep(sk) && waitqueue_active(sk_sleep(sk));
|
2009-07-08 20:09:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sock_poll_wait - place memory barrier behind the poll_wait call.
|
|
|
|
* @filp: file
|
|
|
|
* @wait_address: socket wait queue
|
|
|
|
* @p: poll_table
|
|
|
|
*
|
|
|
|
* See the comments in the sk_has_sleeper function.
|
|
|
|
*/
|
|
|
|
static inline void sock_poll_wait(struct file *filp,
|
|
|
|
wait_queue_head_t *wait_address, poll_table *p)
|
|
|
|
{
|
|
|
|
if (p && wait_address) {
|
|
|
|
poll_wait(filp, wait_address, p);
|
|
|
|
/*
|
|
|
|
* We need to be sure we are in sync with the
|
|
|
|
* socket flags modification.
|
|
|
|
*
|
|
|
|
* This memory barrier is paired in the sk_has_sleeper.
|
|
|
|
*/
|
|
|
|
smp_mb();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
* Queue a received datagram if it will fit. Stream and sequenced
|
|
|
|
* protocols can't normally use this as they need to fit buffers in
|
|
|
|
* and play with them.
|
|
|
|
*
|
|
|
|
* Inlined as it's very short and called for pretty much every
|
|
|
|
* packet ever received.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static inline void skb_set_owner_w(struct sk_buff *skb, struct sock *sk)
|
|
|
|
{
|
2009-06-22 10:25:25 +08:00
|
|
|
skb_orphan(skb);
|
2005-04-17 06:20:36 +08:00
|
|
|
skb->sk = sk;
|
|
|
|
skb->destructor = sock_wfree;
|
net: No more expensive sock_hold()/sock_put() on each tx
One of the problem with sock memory accounting is it uses
a pair of sock_hold()/sock_put() for each transmitted packet.
This slows down bidirectional flows because the receive path
also needs to take a refcount on socket and might use a different
cpu than transmit path or transmit completion path. So these
two atomic operations also trigger cache line bounces.
We can see this in tx or tx/rx workloads (media gateways for example),
where sock_wfree() can be in top five functions in profiles.
We use this sock_hold()/sock_put() so that sock freeing
is delayed until all tx packets are completed.
As we also update sk_wmem_alloc, we could offset sk_wmem_alloc
by one unit at init time, until sk_free() is called.
Once sk_free() is called, we atomic_dec_and_test(sk_wmem_alloc)
to decrement initial offset and atomicaly check if any packets
are in flight.
skb_set_owner_w() doesnt call sock_hold() anymore
sock_wfree() doesnt call sock_put() anymore, but check if sk_wmem_alloc
reached 0 to perform the final freeing.
Drawback is that a skb->truesize error could lead to unfreeable sockets, or
even worse, prematurely calling __sk_free() on a live socket.
Nice speedups on SMP. tbench for example, going from 2691 MB/s to 2711 MB/s
on my 8 cpu dev machine, even if tbench was not really hitting sk_refcnt
contention point. 5 % speedup on a UDP transmit workload (depends
on number of flows), lowering TX completion cpu usage.
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-06-11 17:55:43 +08:00
|
|
|
/*
|
|
|
|
* We used to take a refcount on sk, but following operation
|
|
|
|
* is enough to guarantee sk_free() wont free this sock until
|
|
|
|
* all in-flight packets are completed
|
|
|
|
*/
|
2005-04-17 06:20:36 +08:00
|
|
|
atomic_add(skb->truesize, &sk->sk_wmem_alloc);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void skb_set_owner_r(struct sk_buff *skb, struct sock *sk)
|
|
|
|
{
|
2009-06-22 10:25:25 +08:00
|
|
|
skb_orphan(skb);
|
2005-04-17 06:20:36 +08:00
|
|
|
skb->sk = sk;
|
|
|
|
skb->destructor = sock_rfree;
|
|
|
|
atomic_add(skb->truesize, &sk->sk_rmem_alloc);
|
2007-12-31 16:11:19 +08:00
|
|
|
sk_mem_charge(sk, skb->truesize);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
extern void sk_reset_timer(struct sock *sk, struct timer_list* timer,
|
|
|
|
unsigned long expires);
|
|
|
|
|
|
|
|
extern void sk_stop_timer(struct sock *sk, struct timer_list* timer);
|
|
|
|
|
2006-03-28 17:08:21 +08:00
|
|
|
extern int sock_queue_rcv_skb(struct sock *sk, struct sk_buff *skb);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
static inline int sock_queue_err_skb(struct sock *sk, struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
/* Cast skb->rcvbuf to unsigned... It's pointless, but reduces
|
|
|
|
number of warnings when compiling with -W --ANK
|
|
|
|
*/
|
|
|
|
if (atomic_read(&sk->sk_rmem_alloc) + skb->truesize >=
|
|
|
|
(unsigned)sk->sk_rcvbuf)
|
|
|
|
return -ENOMEM;
|
|
|
|
skb_set_owner_r(skb, sk);
|
|
|
|
skb_queue_tail(&sk->sk_error_queue, skb);
|
|
|
|
if (!sock_flag(sk, SOCK_DEAD))
|
|
|
|
sk->sk_data_ready(sk, skb->len);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Recover an error report and clear atomically
|
|
|
|
*/
|
|
|
|
|
|
|
|
static inline int sock_error(struct sock *sk)
|
|
|
|
{
|
2005-12-14 15:22:19 +08:00
|
|
|
int err;
|
|
|
|
if (likely(!sk->sk_err))
|
|
|
|
return 0;
|
|
|
|
err = xchg(&sk->sk_err, 0);
|
2005-04-17 06:20:36 +08:00
|
|
|
return -err;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline unsigned long sock_wspace(struct sock *sk)
|
|
|
|
{
|
|
|
|
int amt = 0;
|
|
|
|
|
|
|
|
if (!(sk->sk_shutdown & SEND_SHUTDOWN)) {
|
|
|
|
amt = sk->sk_sndbuf - atomic_read(&sk->sk_wmem_alloc);
|
|
|
|
if (amt < 0)
|
|
|
|
amt = 0;
|
|
|
|
}
|
|
|
|
return amt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void sk_wake_async(struct sock *sk, int how, int band)
|
|
|
|
{
|
net: speedup sk_wake_async()
An incoming datagram must bring into cpu cache *lot* of cache lines,
in particular : (other parts omitted (hash chains, ip route cache...))
On 32bit arches :
offsetof(struct sock, sk_rcvbuf) =0x30 (read)
offsetof(struct sock, sk_lock) =0x34 (rw)
offsetof(struct sock, sk_sleep) =0x50 (read)
offsetof(struct sock, sk_rmem_alloc) =0x64 (rw)
offsetof(struct sock, sk_receive_queue)=0x74 (rw)
offsetof(struct sock, sk_forward_alloc)=0x98 (rw)
offsetof(struct sock, sk_callback_lock)=0xcc (rw)
offsetof(struct sock, sk_drops) =0xd8 (read if we add dropcount support, rw if frame dropped)
offsetof(struct sock, sk_filter) =0xf8 (read)
offsetof(struct sock, sk_socket) =0x138 (read)
offsetof(struct sock, sk_data_ready) =0x15c (read)
We can avoid sk->sk_socket and socket->fasync_list referencing on sockets
with no fasync() structures. (socket->fasync_list ptr is probably already in cache
because it shares a cache line with socket->wait, ie location pointed by sk->sk_sleep)
This avoids one cache line load per incoming packet for common cases (no fasync())
We can leave (or even move in a future patch) sk->sk_socket in a cold location
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-10-07 08:28:29 +08:00
|
|
|
if (sock_flag(sk, SOCK_FASYNC))
|
2005-04-17 06:20:36 +08:00
|
|
|
sock_wake_async(sk->sk_socket, how, band);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define SOCK_MIN_SNDBUF 2048
|
|
|
|
#define SOCK_MIN_RCVBUF 256
|
|
|
|
|
|
|
|
static inline void sk_stream_moderate_sndbuf(struct sock *sk)
|
|
|
|
{
|
|
|
|
if (!(sk->sk_userlocks & SOCK_SNDBUF_LOCK)) {
|
2007-12-21 19:07:41 +08:00
|
|
|
sk->sk_sndbuf = min(sk->sk_sndbuf, sk->sk_wmem_queued >> 1);
|
2005-04-17 06:20:36 +08:00
|
|
|
sk->sk_sndbuf = max(sk->sk_sndbuf, SOCK_MIN_SNDBUF);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-11-29 18:22:33 +08:00
|
|
|
struct sk_buff *sk_stream_alloc_skb(struct sock *sk, int size, gfp_t gfp);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
static inline struct page *sk_stream_alloc_page(struct sock *sk)
|
|
|
|
{
|
|
|
|
struct page *page = NULL;
|
|
|
|
|
2005-09-02 08:48:59 +08:00
|
|
|
page = alloc_pages(sk->sk_allocation, 0);
|
|
|
|
if (!page) {
|
2008-07-17 11:28:10 +08:00
|
|
|
sk->sk_prot->enter_memory_pressure(sk);
|
2005-04-17 06:20:36 +08:00
|
|
|
sk_stream_moderate_sndbuf(sk);
|
|
|
|
}
|
|
|
|
return page;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Default write policy as shown to user space via poll/select/SIGIO
|
|
|
|
*/
|
|
|
|
static inline int sock_writeable(const struct sock *sk)
|
|
|
|
{
|
2007-12-21 19:07:41 +08:00
|
|
|
return atomic_read(&sk->sk_wmem_alloc) < (sk->sk_sndbuf >> 1);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
2005-10-07 14:46:04 +08:00
|
|
|
static inline gfp_t gfp_any(void)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2009-02-13 08:43:17 +08:00
|
|
|
return in_softirq() ? GFP_ATOMIC : GFP_KERNEL;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline long sock_rcvtimeo(const struct sock *sk, int noblock)
|
|
|
|
{
|
|
|
|
return noblock ? 0 : sk->sk_rcvtimeo;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline long sock_sndtimeo(const struct sock *sk, int noblock)
|
|
|
|
{
|
|
|
|
return noblock ? 0 : sk->sk_sndtimeo;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int sock_rcvlowat(const struct sock *sk, int waitall, int len)
|
|
|
|
{
|
|
|
|
return (waitall ? len : min_t(int, sk->sk_rcvlowat, len)) ? : 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Alas, with timeout socket operations are not restartable.
|
|
|
|
* Compare this to poll().
|
|
|
|
*/
|
|
|
|
static inline int sock_intr_errno(long timeo)
|
|
|
|
{
|
|
|
|
return timeo == MAX_SCHEDULE_TIMEOUT ? -ERESTARTSYS : -EINTR;
|
|
|
|
}
|
|
|
|
|
2007-03-26 13:14:49 +08:00
|
|
|
extern void __sock_recv_timestamp(struct msghdr *msg, struct sock *sk,
|
|
|
|
struct sk_buff *skb);
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
static __inline__ void
|
|
|
|
sock_recv_timestamp(struct msghdr *msg, struct sock *sk, struct sk_buff *skb)
|
|
|
|
{
|
2007-04-20 07:16:32 +08:00
|
|
|
ktime_t kt = skb->tstamp;
|
2009-02-12 13:03:38 +08:00
|
|
|
struct skb_shared_hwtstamps *hwtstamps = skb_hwtstamps(skb);
|
2005-08-15 08:24:31 +08:00
|
|
|
|
2009-02-12 13:03:38 +08:00
|
|
|
/*
|
|
|
|
* generate control messages if
|
|
|
|
* - receive time stamping in software requested (SOCK_RCVTSTAMP
|
|
|
|
* or SOCK_TIMESTAMPING_RX_SOFTWARE)
|
|
|
|
* - software time stamp available and wanted
|
|
|
|
* (SOCK_TIMESTAMPING_SOFTWARE)
|
|
|
|
* - hardware time stamps available and wanted
|
|
|
|
* (SOCK_TIMESTAMPING_SYS_HARDWARE or
|
|
|
|
* SOCK_TIMESTAMPING_RAW_HARDWARE)
|
|
|
|
*/
|
|
|
|
if (sock_flag(sk, SOCK_RCVTSTAMP) ||
|
|
|
|
sock_flag(sk, SOCK_TIMESTAMPING_RX_SOFTWARE) ||
|
|
|
|
(kt.tv64 && sock_flag(sk, SOCK_TIMESTAMPING_SOFTWARE)) ||
|
|
|
|
(hwtstamps->hwtstamp.tv64 &&
|
|
|
|
sock_flag(sk, SOCK_TIMESTAMPING_RAW_HARDWARE)) ||
|
|
|
|
(hwtstamps->syststamp.tv64 &&
|
|
|
|
sock_flag(sk, SOCK_TIMESTAMPING_SYS_HARDWARE)))
|
2007-03-26 13:14:49 +08:00
|
|
|
__sock_recv_timestamp(msg, sk, skb);
|
|
|
|
else
|
2007-04-20 07:16:32 +08:00
|
|
|
sk->sk_stamp = kt;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
net: Generalize socket rx gap / receive queue overflow cmsg
Create a new socket level option to report number of queue overflows
Recently I augmented the AF_PACKET protocol to report the number of frames lost
on the socket receive queue between any two enqueued frames. This value was
exported via a SOL_PACKET level cmsg. AFter I completed that work it was
requested that this feature be generalized so that any datagram oriented socket
could make use of this option. As such I've created this patch, It creates a
new SOL_SOCKET level option called SO_RXQ_OVFL, which when enabled exports a
SOL_SOCKET level cmsg that reports the nubmer of times the sk_receive_queue
overflowed between any two given frames. It also augments the AF_PACKET
protocol to take advantage of this new feature (as it previously did not touch
sk->sk_drops, which this patch uses to record the overflow count). Tested
successfully by me.
Notes:
1) Unlike my previous patch, this patch simply records the sk_drops value, which
is not a number of drops between packets, but rather a total number of drops.
Deltas must be computed in user space.
2) While this patch currently works with datagram oriented protocols, it will
also be accepted by non-datagram oriented protocols. I'm not sure if thats
agreeable to everyone, but my argument in favor of doing so is that, for those
protocols which aren't applicable to this option, sk_drops will always be zero,
and reporting no drops on a receive queue that isn't used for those
non-participating protocols seems reasonable to me. This also saves us having
to code in a per-protocol opt in mechanism.
3) This applies cleanly to net-next assuming that commit
977750076d98c7ff6cbda51858bb5a5894a9d9ab (my af packet cmsg patch) is reverted
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-10-13 04:26:31 +08:00
|
|
|
extern void sock_recv_ts_and_drops(struct msghdr *msg, struct sock *sk, struct sk_buff *skb);
|
|
|
|
|
2009-02-12 13:03:38 +08:00
|
|
|
/**
|
|
|
|
* sock_tx_timestamp - checks whether the outgoing packet is to be time stamped
|
|
|
|
* @msg: outgoing packet
|
|
|
|
* @sk: socket sending this packet
|
|
|
|
* @shtx: filled with instructions for time stamping
|
|
|
|
*
|
|
|
|
* Currently only depends on SOCK_TIMESTAMPING* flags. Returns error code if
|
|
|
|
* parameters are invalid.
|
|
|
|
*/
|
|
|
|
extern int sock_tx_timestamp(struct msghdr *msg,
|
|
|
|
struct sock *sk,
|
|
|
|
union skb_shared_tx *shtx);
|
|
|
|
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/**
|
|
|
|
* sk_eat_skb - Release a skb if it is no longer needed
|
2005-05-01 23:59:25 +08:00
|
|
|
* @sk: socket to eat this skb from
|
|
|
|
* @skb: socket buffer to eat
|
2006-06-23 07:00:11 +08:00
|
|
|
* @copied_early: flag indicating whether DMA operations copied this data early
|
2005-04-17 06:20:36 +08:00
|
|
|
*
|
|
|
|
* This routine must be called with interrupts disabled or with the socket
|
|
|
|
* locked so that the sk_buff queue operation is ok.
|
|
|
|
*/
|
2006-05-24 09:01:28 +08:00
|
|
|
#ifdef CONFIG_NET_DMA
|
|
|
|
static inline void sk_eat_skb(struct sock *sk, struct sk_buff *skb, int copied_early)
|
|
|
|
{
|
|
|
|
__skb_unlink(skb, &sk->sk_receive_queue);
|
|
|
|
if (!copied_early)
|
|
|
|
__kfree_skb(skb);
|
|
|
|
else
|
|
|
|
__skb_queue_tail(&sk->sk_async_wait_queue, skb);
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
static inline void sk_eat_skb(struct sock *sk, struct sk_buff *skb, int copied_early)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
__skb_unlink(skb, &sk->sk_receive_queue);
|
|
|
|
__kfree_skb(skb);
|
|
|
|
}
|
2006-05-24 09:01:28 +08:00
|
|
|
#endif
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2008-03-26 01:26:21 +08:00
|
|
|
static inline
|
|
|
|
struct net *sock_net(const struct sock *sk)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_NET_NS
|
|
|
|
return sk->sk_net;
|
|
|
|
#else
|
|
|
|
return &init_net;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline
|
2008-03-26 15:48:17 +08:00
|
|
|
void sock_net_set(struct sock *sk, struct net *net)
|
2008-03-26 01:26:21 +08:00
|
|
|
{
|
|
|
|
#ifdef CONFIG_NET_NS
|
|
|
|
sk->sk_net = net;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2008-03-01 03:18:32 +08:00
|
|
|
/*
|
|
|
|
* Kernel sockets, f.e. rtnl or icmp_socket, are a part of a namespace.
|
|
|
|
* They should not hold a referrence to a namespace in order to allow
|
|
|
|
* to stop it.
|
|
|
|
* Sockets after sk_change_net should be released using sk_release_kernel
|
|
|
|
*/
|
|
|
|
static inline void sk_change_net(struct sock *sk, struct net *net)
|
|
|
|
{
|
2008-03-26 01:26:21 +08:00
|
|
|
put_net(sock_net(sk));
|
2008-04-16 16:59:46 +08:00
|
|
|
sock_net_set(sk, hold_net(net));
|
2008-03-01 03:18:32 +08:00
|
|
|
}
|
|
|
|
|
2008-10-08 03:41:01 +08:00
|
|
|
static inline struct sock *skb_steal_sock(struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
if (unlikely(skb->sk)) {
|
|
|
|
struct sock *sk = skb->sk;
|
|
|
|
|
|
|
|
skb->destructor = NULL;
|
|
|
|
skb->sk = NULL;
|
|
|
|
return sk;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2009-02-12 13:03:38 +08:00
|
|
|
extern void sock_enable_timestamp(struct sock *sk, int flag);
|
2005-04-17 06:20:36 +08:00
|
|
|
extern int sock_get_timestamp(struct sock *, struct timeval __user *);
|
2007-03-19 08:33:16 +08:00
|
|
|
extern int sock_get_timestampns(struct sock *, struct timespec __user *);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Enable debug/info messages
|
|
|
|
*/
|
2007-03-09 12:41:08 +08:00
|
|
|
extern int net_msg_warn;
|
|
|
|
#define NETDEBUG(fmt, args...) \
|
|
|
|
do { if (net_msg_warn) printk(fmt,##args); } while (0)
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2007-03-09 12:41:08 +08:00
|
|
|
#define LIMIT_NETDEBUG(fmt, args...) \
|
|
|
|
do { if (net_msg_warn && net_ratelimit()) printk(fmt,##args); } while(0)
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
extern __u32 sysctl_wmem_max;
|
|
|
|
extern __u32 sysctl_rmem_max;
|
|
|
|
|
2005-08-16 13:18:02 +08:00
|
|
|
extern void sk_init(void);
|
|
|
|
|
2005-09-06 09:14:11 +08:00
|
|
|
extern int sysctl_optmem_max;
|
|
|
|
|
2005-08-16 13:18:02 +08:00
|
|
|
extern __u32 sysctl_wmem_default;
|
|
|
|
extern __u32 sysctl_rmem_default;
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
#endif /* _SOCK_H */
|