2014-03-12 23:31:09 +08:00
|
|
|
/* net/tipc/socket.h: Include file for TIPC socket code
|
|
|
|
*
|
|
|
|
* Copyright (c) 2014, Ericsson AB
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. Neither the names of the copyright holders nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
* this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* Alternatively, this software may be distributed under the terms of the
|
|
|
|
* GNU General Public License ("GPL") version 2 as published by the Free
|
|
|
|
* Software Foundation.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _TIPC_SOCK_H
|
|
|
|
#define _TIPC_SOCK_H
|
|
|
|
|
|
|
|
#include <net/sock.h>
|
2014-11-20 17:29:10 +08:00
|
|
|
#include <net/genetlink.h>
|
2014-03-12 23:31:09 +08:00
|
|
|
|
2014-08-23 06:09:18 +08:00
|
|
|
#define TIPC_CONNACK_INTV 256
|
|
|
|
#define TIPC_FLOWCTRL_WIN (TIPC_CONNACK_INTV * 2)
|
|
|
|
#define TIPC_CONN_OVERLOAD_LIMIT ((TIPC_FLOWCTRL_WIN * 2 + 1) * \
|
|
|
|
SKB_TRUESIZE(TIPC_MAX_USER_MSG_SIZE))
|
2015-01-09 15:27:01 +08:00
|
|
|
|
|
|
|
int tipc_socket_init(void);
|
|
|
|
void tipc_socket_stop(void);
|
|
|
|
int tipc_sock_create_local(int type, struct socket **res);
|
|
|
|
void tipc_sock_release_local(struct socket *sock);
|
|
|
|
int tipc_sock_accept_local(struct socket *sock, struct socket **newsock,
|
|
|
|
int flags);
|
2015-01-09 15:27:05 +08:00
|
|
|
int tipc_sk_rcv(struct net *net, struct sk_buff *buf);
|
2014-08-23 06:09:14 +08:00
|
|
|
struct sk_buff *tipc_sk_socks_show(void);
|
2015-01-09 15:27:05 +08:00
|
|
|
void tipc_sk_mcast_rcv(struct net *net, struct sk_buff *buf);
|
2014-08-23 06:09:14 +08:00
|
|
|
void tipc_sk_reinit(void);
|
tipc: convert tipc reference table to use generic rhashtable
As tipc reference table is statically allocated, its memory size
requested on stack initialization stage is quite big even if the
maximum port number is just restricted to 8191 currently, however,
the number already becomes insufficient in practice. But if the
maximum ports is allowed to its theory value - 2^32, its consumed
memory size will reach a ridiculously unacceptable value. Apart from
this, heavy tipc users spend a considerable amount of time in
tipc_sk_get() due to the read-lock on ref_table_lock.
If tipc reference table is converted with generic rhashtable, above
mentioned both disadvantages would be resolved respectively: making
use of the new resizable hash table can avoid locking on the lookup;
smaller memory size is required at initial stage, for example, 256
hash bucket slots are requested at the beginning phase instead of
allocating the entire 8191 slots in old mode. The hash table will
grow if entries exceeds 75% of table size up to a total table size
of 1M, and it will automatically shrink if usage falls below 30%,
but the minimum table size is allowed down to 256.
Also converts ref_table_lock to a separate mutex to protect hash table
mutations on write side. Lastly defers the release of the socket
reference using call_rcu() to allow using an RCU read-side protected
call to rhashtable_lookup().
Signed-off-by: Ying Xue <ying.xue@windriver.com>
Acked-by: Jon Maloy <jon.maloy@ericsson.com>
Acked-by: Erik Hugne <erik.hugne@ericsson.com>
Cc: Thomas Graf <tgraf@suug.ch>
Acked-by: Thomas Graf <tgraf@suug.ch>
Signed-off-by: David S. Miller <davem@davemloft.net>
2015-01-07 13:41:58 +08:00
|
|
|
int tipc_sk_rht_init(void);
|
|
|
|
void tipc_sk_rht_destroy(void);
|
2014-11-20 17:29:10 +08:00
|
|
|
int tipc_nl_sk_dump(struct sk_buff *skb, struct netlink_callback *cb);
|
2014-11-20 17:29:11 +08:00
|
|
|
int tipc_nl_publ_dump(struct sk_buff *skb, struct netlink_callback *cb);
|
2014-07-17 08:41:00 +08:00
|
|
|
|
2014-03-12 23:31:09 +08:00
|
|
|
#endif
|