node.h 6.5 KB
Newer Older
P
Per Liden 已提交
1 2
/*
 * net/tipc/node.h: Include file for TIPC node management routines
3
 *
4
 * Copyright (c) 2000-2006, 2014-2015, Ericsson AB
5
 * Copyright (c) 2005, 2010-2014, Wind River Systems
P
Per Liden 已提交
6 7
 * All rights reserved.
 *
P
Per Liden 已提交
8
 * Redistribution and use in source and binary forms, with or without
P
Per Liden 已提交
9 10
 * modification, are permitted provided that the following conditions are met:
 *
P
Per Liden 已提交
11 12 13 14 15 16 17 18
 * 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.
P
Per Liden 已提交
19
 *
P
Per Liden 已提交
20 21 22 23 24 25 26 27 28 29 30 31 32 33
 * 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
P
Per Liden 已提交
34 35 36 37 38 39
 * POSSIBILITY OF SUCH DAMAGE.
 */

#ifndef _TIPC_NODE_H
#define _TIPC_NODE_H

40 41
#include "addr.h"
#include "net.h"
P
Per Liden 已提交
42
#include "bearer.h"
43
#include "msg.h"
P
Per Liden 已提交
44

45 46 47 48
/* Out-of-range value for node signature */
#define INVALID_NODE_SIG	0x10000

#define NODE_HTABLE_SIZE	512
49

Y
Ying Xue 已提交
50 51 52 53 54
/* Flags used to take different actions according to flag type
 * TIPC_WAIT_PEER_LINKS_DOWN: wait to see that peer's links are down
 * TIPC_WAIT_OWN_LINKS_DOWN: wait until peer node is declared down
 * TIPC_NOTIFY_NODE_DOWN: notify node is down
 * TIPC_NOTIFY_NODE_UP: notify node is up
Y
Ying Xue 已提交
55
 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
56 57
 */
enum {
58
	TIPC_MSG_EVT                    = 1,
Y
Ying Xue 已提交
59 60 61
	TIPC_WAIT_PEER_LINKS_DOWN	= (1 << 1),
	TIPC_WAIT_OWN_LINKS_DOWN	= (1 << 2),
	TIPC_NOTIFY_NODE_DOWN		= (1 << 3),
62
	TIPC_NOTIFY_NODE_UP		= (1 << 4),
63 64 65
	TIPC_WAKEUP_BCAST_USERS		= (1 << 5),
	TIPC_NOTIFY_LINK_UP		= (1 << 6),
	TIPC_NOTIFY_LINK_DOWN		= (1 << 7),
66
	TIPC_NAMED_MSG_EVT		= (1 << 8),
67 68
	TIPC_BCAST_MSG_EVT		= (1 << 9),
	TIPC_BCAST_RESET		= (1 << 10)
69
};
70

71 72 73 74 75 76
/**
 * struct tipc_node_bclink - TIPC node bclink structure
 * @acked: sequence # of last outbound b'cast message acknowledged by node
 * @last_in: sequence # of last in-sequence b'cast message received from node
 * @last_sent: sequence # of last b'cast message sent by node
 * @oos_state: state tracker for handling OOS b'cast messages
77
 * @deferred_queue: deferred queue saved OOS b'cast message received from node
78
 * @reasm_buf: broadcast reassembly queue head from node
79
 * @inputq_map: bitmap indicating which inqueues should be kicked
80 81 82 83 84 85 86 87
 * @recv_permitted: true if node is allowed to receive b'cast messages
 */
struct tipc_node_bclink {
	u32 acked;
	u32 last_in;
	u32 last_sent;
	u32 oos_state;
	u32 deferred_size;
J
Jon Paul Maloy 已提交
88
	struct sk_buff_head deferdq;
89
	struct sk_buff *reasm_buf;
90
	int inputq_map;
91 92 93
	bool recv_permitted;
};

P
Per Liden 已提交
94
/**
95
 * struct tipc_node - TIPC node structure
P
Per Liden 已提交
96 97
 * @addr: network address of node
 * @lock: spinlock governing access to structure
98
 * @net: the applicable net namespace
99
 * @hash: links to adjacent nodes in unsorted hash chain
100 101 102
 * @inputq: pointer to input queue containing messages for msg event
 * @namedq: pointer to name table input queue with name table messages
 * @curr_link: the link holding the node lock, if any
P
Per Liden 已提交
103 104
 * @active_links: pointers to active links to node
 * @links: pointers to all links to node
Y
Ying Xue 已提交
105
 * @action_flags: bit mask of different types of node actions
106 107 108
 * @bclink: broadcast-related info
 * @list: links to adjacent nodes in sorted list of cluster's nodes
 * @working_links: number of working links to node (both active and standby)
P
Per Liden 已提交
109
 * @link_cnt: number of links to node
110
 * @capabilities: bitmap, indicating peer node's functional capabilities
111
 * @signature: node instance identifier
Y
Ying Xue 已提交
112
 * @link_id: local and remote bearer ids of changing link, if any
113
 * @publ_list: list of publications
114
 * @rcu: rcu struct for tipc_node
P
Per Liden 已提交
115
 */
116
struct tipc_node {
P
Per Liden 已提交
117 118
	u32 addr;
	spinlock_t lock;
119
	struct net *net;
120
	struct hlist_node hash;
121 122
	struct sk_buff_head *inputq;
	struct sk_buff_head *namedq;
123
	struct tipc_link *active_links[2];
124
	u32 act_mtus[2];
125
	struct tipc_link *links[MAX_BEARERS];
126
	int action_flags;
127 128
	struct tipc_node_bclink bclink;
	struct list_head list;
P
Per Liden 已提交
129
	int link_cnt;
130 131
	u16 working_links;
	u16 capabilities;
132
	u32 signature;
Y
Ying Xue 已提交
133
	u32 link_id;
134
	struct list_head publ_list;
135
	struct list_head conn_sks;
136
	struct rcu_head rcu;
P
Per Liden 已提交
137 138
};

139 140 141
struct tipc_node *tipc_node_find(struct net *net, u32 addr);
struct tipc_node *tipc_node_create(struct net *net, u32 addr);
void tipc_node_stop(struct net *net);
142 143 144 145
void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
void tipc_node_link_down(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
void tipc_node_link_up(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
146
int tipc_node_active_links(struct tipc_node *n_ptr);
147
int tipc_node_is_up(struct tipc_node *n_ptr);
148 149
int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 node,
			   char *linkname, size_t len);
150
void tipc_node_unlock(struct tipc_node *node);
151 152
int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port);
void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port);
P
Per Liden 已提交
153

154 155
int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb);

156
static inline void tipc_node_lock(struct tipc_node *node)
P
Per Liden 已提交
157
{
158
	spin_lock_bh(&node->lock);
P
Per Liden 已提交
159 160
}

161 162
static inline bool tipc_node_blocked(struct tipc_node *node)
{
Y
Ying Xue 已提交
163 164
	return (node->action_flags & (TIPC_WAIT_PEER_LINKS_DOWN |
		TIPC_NOTIFY_NODE_DOWN | TIPC_WAIT_OWN_LINKS_DOWN));
165 166
}

167
static inline uint tipc_node_get_mtu(struct net *net, u32 addr, u32 selector)
168 169 170 171
{
	struct tipc_node *node;
	u32 mtu;

172
	node = tipc_node_find(net, addr);
173 174 175 176 177 178 179 180 181

	if (likely(node))
		mtu = node->act_mtus[selector & 1];
	else
		mtu = MAX_MSG_SIZE;

	return mtu;
}

P
Per Liden 已提交
182
#endif