node.c 13.8 KB
Newer Older
P
Per Liden 已提交
1 2
/*
 * net/tipc/node.c: TIPC node management routines
3
 *
P
Per Liden 已提交
4
 * Copyright (c) 2000-2006, Ericsson AB
5
 * Copyright (c) 2005-2006, 2010-2011, 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 40 41
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include "core.h"
#include "config.h"
#include "node.h"
#include "name_distr.h"

42 43
static void node_lost_contact(struct tipc_node *n_ptr);
static void node_established_contact(struct tipc_node *n_ptr);
P
Per Liden 已提交
44

45 46
static DEFINE_SPINLOCK(node_create_lock);

47 48 49
static struct hlist_head node_htable[NODE_HTABLE_SIZE];
LIST_HEAD(tipc_node_list);
static u32 tipc_num_nodes;
50 51

static atomic_t tipc_num_links = ATOMIC_INIT(0);
52
u32 tipc_own_tag;
P
Per Liden 已提交
53

54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72
/**
 * tipc_node_find - locate specified node object, if it exists
 */

struct tipc_node *tipc_node_find(u32 addr)
{
	struct tipc_node *node;
	struct hlist_node *pos;

	if (unlikely(!in_own_cluster(addr)))
		return NULL;

	hlist_for_each_entry(node, pos, &node_htable[tipc_hashfn(addr)], hash) {
		if (node->addr == addr)
			return node;
	}
	return NULL;
}

73 74 75 76 77 78 79 80 81 82
/**
 * tipc_node_create - create neighboring node
 *
 * Currently, this routine is called by neighbor discovery code, which holds
 * net_lock for reading only.  We must take node_create_lock to ensure a node
 * isn't created twice if two different bearers discover the node at the same
 * time.  (It would be preferable to switch to holding net_lock in write mode,
 * but this is a non-trivial change.)
 */

83
struct tipc_node *tipc_node_create(u32 addr)
P
Per Liden 已提交
84
{
85
	struct tipc_node *n_ptr, *temp_node;
P
Per Liden 已提交
86

87 88
	spin_lock_bh(&node_create_lock);

89 90 91 92
	n_ptr = tipc_node_find(addr);
	if (n_ptr) {
		spin_unlock_bh(&node_create_lock);
		return n_ptr;
93 94
	}

95
	n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC);
96
	if (!n_ptr) {
97
		spin_unlock_bh(&node_create_lock);
98 99 100 101 102
		warn("Node creation failed, no memory\n");
		return NULL;
	}

	n_ptr->addr = addr;
103
	spin_lock_init(&n_ptr->lock);
104 105
	INIT_HLIST_NODE(&n_ptr->hash);
	INIT_LIST_HEAD(&n_ptr->list);
106
	INIT_LIST_HEAD(&n_ptr->nsub);
107

108 109 110 111 112 113 114
	hlist_add_head(&n_ptr->hash, &node_htable[tipc_hashfn(addr)]);

	list_for_each_entry(temp_node, &tipc_node_list, list) {
		if (n_ptr->addr < temp_node->addr)
			break;
	}
	list_add_tail(&n_ptr->list, &temp_node->list);
115
	n_ptr->block_setup = WAIT_PEER_DOWN;
116 117

	tipc_num_nodes++;
118

119
	spin_unlock_bh(&node_create_lock);
P
Per Liden 已提交
120 121 122
	return n_ptr;
}

123
void tipc_node_delete(struct tipc_node *n_ptr)
P
Per Liden 已提交
124
{
125 126
	list_del(&n_ptr->list);
	hlist_del(&n_ptr->hash);
P
Per Liden 已提交
127
	kfree(n_ptr);
128

129
	tipc_num_nodes--;
P
Per Liden 已提交
130 131 132 133
}


/**
134
 * tipc_node_link_up - handle addition of link
135
 *
P
Per Liden 已提交
136 137 138
 * Link becomes active (alone or shared) or standby, depending on its priority.
 */

139
void tipc_node_link_up(struct tipc_node *n_ptr, struct link *l_ptr)
P
Per Liden 已提交
140 141 142
{
	struct link **active = &n_ptr->active_links[0];

143 144
	n_ptr->working_links++;

P
Per Liden 已提交
145 146
	info("Established link <%s> on network plane %c\n",
	     l_ptr->name, l_ptr->b_ptr->net_plane);
147

P
Per Liden 已提交
148 149 150 151 152
	if (!active[0]) {
		active[0] = active[1] = l_ptr;
		node_established_contact(n_ptr);
		return;
	}
153
	if (l_ptr->priority < active[0]->priority) {
154
		info("New link <%s> becomes standby\n", l_ptr->name);
P
Per Liden 已提交
155 156
		return;
	}
157
	tipc_link_send_duplicate(active[0], l_ptr);
158
	if (l_ptr->priority == active[0]->priority) {
P
Per Liden 已提交
159 160 161
		active[0] = l_ptr;
		return;
	}
162 163 164
	info("Old link <%s> becomes standby\n", active[0]->name);
	if (active[1] != active[0])
		info("Old link <%s> becomes standby\n", active[1]->name);
P
Per Liden 已提交
165 166 167 168 169 170 171
	active[0] = active[1] = l_ptr;
}

/**
 * node_select_active_links - select active link
 */

172
static void node_select_active_links(struct tipc_node *n_ptr)
P
Per Liden 已提交
173 174 175 176 177
{
	struct link **active = &n_ptr->active_links[0];
	u32 i;
	u32 highest_prio = 0;

178
	active[0] = active[1] = NULL;
P
Per Liden 已提交
179 180

	for (i = 0; i < MAX_BEARERS; i++) {
181
		struct link *l_ptr = n_ptr->links[i];
P
Per Liden 已提交
182

183
		if (!l_ptr || !tipc_link_is_up(l_ptr) ||
P
Per Liden 已提交
184 185 186 187
		    (l_ptr->priority < highest_prio))
			continue;

		if (l_ptr->priority > highest_prio) {
188
			highest_prio = l_ptr->priority;
P
Per Liden 已提交
189 190 191 192 193 194 195 196
			active[0] = active[1] = l_ptr;
		} else {
			active[1] = l_ptr;
		}
	}
}

/**
197
 * tipc_node_link_down - handle loss of link
P
Per Liden 已提交
198 199
 */

200
void tipc_node_link_down(struct tipc_node *n_ptr, struct link *l_ptr)
P
Per Liden 已提交
201 202 203
{
	struct link **active;

204 205
	n_ptr->working_links--;

206
	if (!tipc_link_is_active(l_ptr)) {
P
Per Liden 已提交
207 208 209 210 211 212 213 214 215 216 217 218 219 220
		info("Lost standby link <%s> on network plane %c\n",
		     l_ptr->name, l_ptr->b_ptr->net_plane);
		return;
	}
	info("Lost link <%s> on network plane %c\n",
		l_ptr->name, l_ptr->b_ptr->net_plane);

	active = &n_ptr->active_links[0];
	if (active[0] == l_ptr)
		active[0] = active[1];
	if (active[1] == l_ptr)
		active[1] = active[0];
	if (active[0] == l_ptr)
		node_select_active_links(n_ptr);
221
	if (tipc_node_is_up(n_ptr))
222
		tipc_link_changeover(l_ptr);
223
	else
P
Per Liden 已提交
224 225 226
		node_lost_contact(n_ptr);
}

227
int tipc_node_active_links(struct tipc_node *n_ptr)
P
Per Liden 已提交
228
{
229
	return n_ptr->active_links[0] != NULL;
P
Per Liden 已提交
230 231
}

232
int tipc_node_redundant_links(struct tipc_node *n_ptr)
P
Per Liden 已提交
233
{
E
Eric Dumazet 已提交
234
	return n_ptr->working_links > 1;
P
Per Liden 已提交
235 236
}

237
int tipc_node_is_up(struct tipc_node *n_ptr)
P
Per Liden 已提交
238
{
239
	return tipc_node_active_links(n_ptr);
P
Per Liden 已提交
240 241
}

242
void tipc_node_attach_link(struct tipc_node *n_ptr, struct link *l_ptr)
P
Per Liden 已提交
243
{
244 245 246
	n_ptr->links[l_ptr->b_ptr->identity] = l_ptr;
	atomic_inc(&tipc_num_links);
	n_ptr->link_cnt++;
P
Per Liden 已提交
247 248
}

249
void tipc_node_detach_link(struct tipc_node *n_ptr, struct link *l_ptr)
P
Per Liden 已提交
250
{
251
	n_ptr->links[l_ptr->b_ptr->identity] = NULL;
252
	atomic_dec(&tipc_num_links);
P
Per Liden 已提交
253 254 255 256 257 258 259
	n_ptr->link_cnt--;
}

/*
 * Routing table management - five cases to handle:
 *
 * 1: A link towards a zone/cluster external node comes up.
260 261 262
 *    => Send a multicast message updating routing tables of all
 *    system nodes within own cluster that the new destination
 *    can be reached via this node.
P
Per Liden 已提交
263 264 265
 *    (node.establishedContact()=>cluster.multicastNewRoute())
 *
 * 2: A link towards a slave node comes up.
266 267 268
 *    => Send a multicast message updating routing tables of all
 *    system nodes within own cluster that the new destination
 *    can be reached via this node.
P
Per Liden 已提交
269
 *    (node.establishedContact()=>cluster.multicastNewRoute())
270
 *    => Send a  message to the slave node about existence
P
Per Liden 已提交
271 272 273 274 275 276 277 278 279
 *    of all system nodes within cluster:
 *    (node.establishedContact()=>cluster.sendLocalRoutes())
 *
 * 3: A new cluster local system node becomes available.
 *    => Send message(s) to this particular node containing
 *    information about all cluster external and slave
 *     nodes which can be reached via this node.
 *    (node.establishedContact()==>network.sendExternalRoutes())
 *    (node.establishedContact()==>network.sendSlaveRoutes())
280
 *    => Send messages to all directly connected slave nodes
P
Per Liden 已提交
281 282
 *    containing information about the existence of the new node
 *    (node.establishedContact()=>cluster.multicastNewRoute())
283
 *
P
Per Liden 已提交
284 285
 * 4: The link towards a zone/cluster external node or slave
 *    node goes down.
286
 *    => Send a multcast message updating routing tables of all
P
Per Liden 已提交
287 288 289 290 291 292 293 294 295
 *    nodes within cluster that the new destination can not any
 *    longer be reached via this node.
 *    (node.lostAllLinks()=>cluster.bcastLostRoute())
 *
 * 5: A cluster local system node becomes unavailable.
 *    => Remove all references to this node from the local
 *    routing tables. Note: This is a completely node
 *    local operation.
 *    (node.lostAllLinks()=>network.removeAsRouter())
296
 *    => Send messages to all directly connected slave nodes
P
Per Liden 已提交
297 298 299 300 301
 *    containing information about loss of the node
 *    (node.establishedContact()=>cluster.multicastLostRoute())
 *
 */

302
static void node_established_contact(struct tipc_node *n_ptr)
P
Per Liden 已提交
303
{
304
	tipc_k_signal((Handler)tipc_named_node_up, n_ptr->addr);
P
Per Liden 已提交
305

306 307
	/* Syncronize broadcast acks */
	n_ptr->bclink.acked = tipc_bclink_get_last_sent();
P
Per Liden 已提交
308 309

	if (n_ptr->bclink.supported) {
310
		tipc_nmap_add(&tipc_bcast_nmap, n_ptr->addr);
P
Per Liden 已提交
311 312 313 314 315
		if (n_ptr->addr < tipc_own_addr)
			tipc_own_tag++;
	}
}

316
static void node_name_purge_complete(unsigned long node_addr)
317 318 319 320 321 322 323
{
	struct tipc_node *n_ptr;

	read_lock_bh(&tipc_net_lock);
	n_ptr = tipc_node_find(node_addr);
	if (n_ptr) {
		tipc_node_lock(n_ptr);
324
		n_ptr->block_setup &= ~WAIT_NAMES_GONE;
325 326 327 328 329
		tipc_node_unlock(n_ptr);
	}
	read_unlock_bh(&tipc_net_lock);
}

330
static void node_lost_contact(struct tipc_node *n_ptr)
P
Per Liden 已提交
331 332 333 334
{
	char addr_string[16];
	u32 i;

335 336 337 338
	info("Lost contact with %s\n",
	     tipc_addr_string_fill(addr_string, n_ptr->addr));

	/* Flush broadcast link info associated with lost node */
339

340
	if (n_ptr->bclink.supported) {
341 342 343 344 345 346 347 348 349 350 351 352
		n_ptr->bclink.gap_after = n_ptr->bclink.gap_to = 0;
		while (n_ptr->bclink.deferred_head) {
			struct sk_buff *buf = n_ptr->bclink.deferred_head;
			n_ptr->bclink.deferred_head = buf->next;
			buf_discard(buf);
		}

		if (n_ptr->bclink.defragm) {
			buf_discard(n_ptr->bclink.defragm);
			n_ptr->bclink.defragm = NULL;
		}

353
		tipc_nmap_remove(&tipc_bcast_nmap, n_ptr->addr);
354 355
		tipc_bclink_acknowledge(n_ptr,
					mod(n_ptr->bclink.acked + 10000));
356 357
		if (n_ptr->addr < tipc_own_addr)
			tipc_own_tag--;
P
Per Liden 已提交
358

359 360
		n_ptr->bclink.supported = 0;
	}
P
Per Liden 已提交
361 362 363 364

	/* Abort link changeover */
	for (i = 0; i < MAX_BEARERS; i++) {
		struct link *l_ptr = n_ptr->links[i];
365
		if (!l_ptr)
P
Per Liden 已提交
366 367 368
			continue;
		l_ptr->reset_checkpoint = l_ptr->next_in_no;
		l_ptr->exp_msg_count = 0;
369
		tipc_link_reset_fragments(l_ptr);
P
Per Liden 已提交
370 371 372
	}

	/* Notify subscribers */
373
	tipc_nodesub_notify(n_ptr);
374

375
	/* Prevent re-contact with node until cleanup is done */
376

377 378
	n_ptr->block_setup = WAIT_PEER_DOWN | WAIT_NAMES_GONE;
	tipc_k_signal((Handler)node_name_purge_complete, n_ptr->addr);
P
Per Liden 已提交
379 380
}

381
struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space)
P
Per Liden 已提交
382 383 384
{
	u32 domain;
	struct sk_buff *buf;
385
	struct tipc_node *n_ptr;
386
	struct tipc_node_info node_info;
387
	u32 payload_size;
P
Per Liden 已提交
388 389

	if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR))
390
		return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
P
Per Liden 已提交
391

A
Al Viro 已提交
392
	domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
393 394 395
	if (!tipc_addr_domain_valid(domain))
		return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
						   " (network address)");
P
Per Liden 已提交
396

397
	read_lock_bh(&tipc_net_lock);
398
	if (!tipc_num_nodes) {
399
		read_unlock_bh(&tipc_net_lock);
400
		return tipc_cfg_reply_none();
401
	}
P
Per Liden 已提交
402

403
	/* For now, get space for all other nodes */
P
Per Liden 已提交
404

405
	payload_size = TLV_SPACE(sizeof(node_info)) * tipc_num_nodes;
406 407
	if (payload_size > 32768u) {
		read_unlock_bh(&tipc_net_lock);
408 409
		return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
						   " (too many nodes)");
410
	}
411
	buf = tipc_cfg_reply_alloc(payload_size);
412 413
	if (!buf) {
		read_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
414
		return NULL;
415
	}
P
Per Liden 已提交
416 417 418

	/* Add TLVs for all nodes in scope */

419 420
	list_for_each_entry(n_ptr, &tipc_node_list, list) {
		if (!tipc_in_scope(domain, n_ptr->addr))
P
Per Liden 已提交
421
			continue;
422 423 424
		node_info.addr = htonl(n_ptr->addr);
		node_info.up = htonl(tipc_node_is_up(n_ptr));
		tipc_cfg_append_tlv(buf, TIPC_TLV_NODE_INFO,
425
				    &node_info, sizeof(node_info));
P
Per Liden 已提交
426 427
	}

428
	read_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
429 430 431
	return buf;
}

432
struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space)
P
Per Liden 已提交
433 434 435
{
	u32 domain;
	struct sk_buff *buf;
436
	struct tipc_node *n_ptr;
437
	struct tipc_link_info link_info;
438
	u32 payload_size;
P
Per Liden 已提交
439 440

	if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR))
441
		return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
P
Per Liden 已提交
442

A
Al Viro 已提交
443
	domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
444 445 446
	if (!tipc_addr_domain_valid(domain))
		return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
						   " (network address)");
P
Per Liden 已提交
447

448 449 450
	if (tipc_mode != TIPC_NET_MODE)
		return tipc_cfg_reply_none();

451 452
	read_lock_bh(&tipc_net_lock);

453 454
	/* Get space for all unicast links + multicast link */

455
	payload_size = TLV_SPACE(sizeof(link_info)) *
456
		(atomic_read(&tipc_num_links) + 1);
457 458
	if (payload_size > 32768u) {
		read_unlock_bh(&tipc_net_lock);
459 460
		return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
						   " (too many links)");
461
	}
462
	buf = tipc_cfg_reply_alloc(payload_size);
463 464
	if (!buf) {
		read_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
465
		return NULL;
466
	}
P
Per Liden 已提交
467 468 469

	/* Add TLV for broadcast link */

470
	link_info.dest = htonl(tipc_cluster_mask(tipc_own_addr));
471
	link_info.up = htonl(1);
472
	strlcpy(link_info.str, tipc_bclink_name, TIPC_MAX_LINK_NAME);
473
	tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, &link_info, sizeof(link_info));
P
Per Liden 已提交
474 475 476

	/* Add TLVs for any other links in scope */

477
	list_for_each_entry(n_ptr, &tipc_node_list, list) {
478
		u32 i;
P
Per Liden 已提交
479

480
		if (!tipc_in_scope(domain, n_ptr->addr))
P
Per Liden 已提交
481
			continue;
482
		tipc_node_lock(n_ptr);
483 484 485 486 487 488 489
		for (i = 0; i < MAX_BEARERS; i++) {
			if (!n_ptr->links[i])
				continue;
			link_info.dest = htonl(n_ptr->addr);
			link_info.up = htonl(tipc_link_is_up(n_ptr->links[i]));
			strcpy(link_info.str, n_ptr->links[i]->name);
			tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO,
490
					    &link_info, sizeof(link_info));
491
		}
492
		tipc_node_unlock(n_ptr);
P
Per Liden 已提交
493 494
	}

495
	read_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
496 497
	return buf;
}