node.h 7.75 KB
Newer Older
Per Liden's avatar
Per Liden committed
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
Per Liden's avatar
Per Liden committed
6
7
 * All rights reserved.
 *
Per Liden's avatar
Per Liden committed
8
 * Redistribution and use in source and binary forms, with or without
Per Liden's avatar
Per Liden committed
9
10
 * modification, are permitted provided that the following conditions are met:
 *
Per Liden's avatar
Per Liden committed
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.
Per Liden's avatar
Per Liden committed
19
 *
Per Liden's avatar
Per Liden committed
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
Per Liden's avatar
Per Liden committed
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"
Per Liden's avatar
Per Liden committed
42
#include "bearer.h"
43
#include "msg.h"
Per Liden's avatar
Per Liden committed
44

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

48
49
#define INVALID_BEARER_ID -1

50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/* Node FSM states and events:
 */
enum {
	SELF_DOWN_PEER_DOWN    = 0xdd,
	SELF_UP_PEER_UP        = 0xaa,
	SELF_DOWN_PEER_LEAVING = 0xd1,
	SELF_UP_PEER_COMING    = 0xac,
	SELF_COMING_PEER_UP    = 0xca,
	SELF_LEAVING_PEER_DOWN = 0x1d,
};

enum {
	SELF_ESTABL_CONTACT_EVT = 0xec,
	SELF_LOST_CONTACT_EVT   = 0x1c,
	PEER_ESTABL_CONTACT_EVT = 0xfec,
	PEER_LOST_CONTACT_EVT   = 0xf1c
};

68
69
70
71
72
/* 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
Ying Xue's avatar
Ying Xue committed
73
 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
74
75
 */
enum {
76
	TIPC_MSG_EVT                    = 1,
77
	TIPC_NOTIFY_NODE_DOWN		= (1 << 3),
78
	TIPC_NOTIFY_NODE_UP		= (1 << 4),
79
80
81
	TIPC_WAKEUP_BCAST_USERS		= (1 << 5),
	TIPC_NOTIFY_LINK_UP		= (1 << 6),
	TIPC_NOTIFY_LINK_DOWN		= (1 << 7),
82
	TIPC_NAMED_MSG_EVT		= (1 << 8),
83
84
	TIPC_BCAST_MSG_EVT		= (1 << 9),
	TIPC_BCAST_RESET		= (1 << 10)
85
};
86

87
88
89
90
91
92
/**
 * 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
93
 * @deferred_queue: deferred queue saved OOS b'cast message received from node
94
 * @reasm_buf: broadcast reassembly queue head from node
95
 * @inputq_map: bitmap indicating which inqueues should be kicked
96
97
98
99
100
101
102
103
 * @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;
Jon Paul Maloy's avatar
Jon Paul Maloy committed
104
	struct sk_buff_head deferdq;
105
	struct sk_buff *reasm_buf;
106
	struct sk_buff_head namedq;
107
108
109
	bool recv_permitted;
};

110
111
112
struct tipc_link_entry {
	struct tipc_link *link;
	u32 mtu;
113
	struct sk_buff_head inputq;
114
	struct tipc_media_addr maddr;
115
116
};

Per Liden's avatar
Per Liden committed
117
/**
118
 * struct tipc_node - TIPC node structure
Per Liden's avatar
Per Liden committed
119
 * @addr: network address of node
120
 * @ref: reference counter to node object
Per Liden's avatar
Per Liden committed
121
 * @lock: spinlock governing access to structure
122
 * @net: the applicable net namespace
123
 * @hash: links to adjacent nodes in unsorted hash chain
124
125
 * @inputq: pointer to input queue containing messages for msg event
 * @namedq: pointer to name table input queue with name table messages
126
 * @active_links: bearer ids of active links, used as index into links[] array
127
 * @links: array containing references to all links to node
128
 * @action_flags: bit mask of different types of node actions
129
130
131
 * @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)
Per Liden's avatar
Per Liden committed
132
 * @link_cnt: number of links to node
133
 * @capabilities: bitmap, indicating peer node's functional capabilities
134
 * @signature: node instance identifier
Ying Xue's avatar
Ying Xue committed
135
 * @link_id: local and remote bearer ids of changing link, if any
136
 * @publ_list: list of publications
137
 * @rcu: rcu struct for tipc_node
Per Liden's avatar
Per Liden committed
138
 */
139
struct tipc_node {
Per Liden's avatar
Per Liden committed
140
	u32 addr;
141
	struct kref kref;
Per Liden's avatar
Per Liden committed
142
	spinlock_t lock;
143
	struct net *net;
144
	struct hlist_node hash;
145
146
	struct sk_buff_head *inputq;
	struct sk_buff_head *namedq;
147
	int active_links[2];
148
	struct tipc_link_entry links[MAX_BEARERS];
149
	int action_flags;
150
151
	struct tipc_node_bclink bclink;
	struct list_head list;
152
	int state;
Per Liden's avatar
Per Liden committed
153
	int link_cnt;
154
155
	u16 working_links;
	u16 capabilities;
156
	u32 signature;
Ying Xue's avatar
Ying Xue committed
157
	u32 link_id;
158
	struct list_head publ_list;
159
	struct list_head conn_sks;
160
161
	unsigned long keepalive_intv;
	struct timer_list timer;
162
	struct rcu_head rcu;
Per Liden's avatar
Per Liden committed
163
164
};

165
struct tipc_node *tipc_node_find(struct net *net, u32 addr);
166
void tipc_node_put(struct tipc_node *node);
167
168
struct tipc_node *tipc_node_create(struct net *net, u32 addr);
void tipc_node_stop(struct net *net);
169
170
171
172
173
void tipc_node_check_dest(struct tipc_node *n, struct tipc_bearer *bearer,
			  bool *link_up, bool *addr_match,
			  struct tipc_media_addr *maddr);
bool tipc_node_update_dest(struct tipc_node *n, struct tipc_bearer *bearer,
			   struct tipc_media_addr *maddr);
174
175
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);
176
177
178
void tipc_node_link_down(struct tipc_node *n_ptr, int bearer_id);
void tipc_node_link_up(struct tipc_node *n_ptr, int bearer_id);
bool tipc_node_is_up(struct tipc_node *n);
179
180
int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 node,
			   char *linkname, size_t len);
181
void tipc_node_unlock(struct tipc_node *node);
182
183
184
185
int tipc_node_xmit(struct net *net, struct sk_buff_head *list, u32 dnode,
		   int selector);
int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dest,
		       u32 selector);
186
187
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);
Per Liden's avatar
Per Liden committed
188

189
190
int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb);

191
static inline void tipc_node_lock(struct tipc_node *node)
Per Liden's avatar
Per Liden committed
192
{
193
	spin_lock_bh(&node->lock);
Per Liden's avatar
Per Liden committed
194
195
}

196
197
void tipc_node_fsm_evt(struct tipc_node *n, int evt);
bool tipc_node_filter_skb(struct tipc_node *n, struct tipc_msg *hdr);
198

199
static inline struct tipc_link *node_active_link(struct tipc_node *n, int sel)
200
{
201
202
203
204
	int bearer_id = n->active_links[sel & 1];

	if (unlikely(bearer_id == INVALID_BEARER_ID))
		return NULL;
205

206
	return n->links[bearer_id].link;
207
}
208

209
static inline unsigned int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel)
210
211
{
	struct tipc_node *n;
212
	int bearer_id;
213
	unsigned int mtu = MAX_MSG_SIZE;
214

215
216
217
	n = tipc_node_find(net, addr);
	if (unlikely(!n))
		return mtu;
218
219
220
221

	bearer_id = n->active_links[sel & 1];
	if (likely(bearer_id != INVALID_BEARER_ID))
		mtu = n->links[bearer_id].mtu;
222
	tipc_node_put(n);
223
224
225
	return mtu;
}

Per Liden's avatar
Per Liden committed
226
#endif