node.c 14.4 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, 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 42
 * POSSIBILITY OF SUCH DAMAGE.
 */

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

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

46 47
/* sorted list of nodes within cluster */
static struct tipc_node *tipc_nodes = NULL;
P
Per Liden 已提交
48

49 50
static DEFINE_SPINLOCK(node_create_lock);

P
Per Liden 已提交
51 52
u32 tipc_own_tag = 0;

53 54 55 56 57 58 59 60 61 62
/**
 * 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.)
 */

63
struct tipc_node *tipc_node_create(u32 addr)
P
Per Liden 已提交
64 65
{
	struct cluster *c_ptr;
66 67
	struct tipc_node *n_ptr;
	struct tipc_node **curr_node;
P
Per Liden 已提交
68

69 70 71 72 73 74 75 76 77 78 79
	spin_lock_bh(&node_create_lock);

	for (n_ptr = tipc_nodes; n_ptr; n_ptr = n_ptr->next) {
		if (addr < n_ptr->addr)
			break;
		if (addr == n_ptr->addr) {
			spin_unlock_bh(&node_create_lock);
			return n_ptr;
		}
	}

80
	n_ptr = kzalloc(sizeof(*n_ptr),GFP_ATOMIC);
81
	if (!n_ptr) {
82
		spin_unlock_bh(&node_create_lock);
83 84 85 86 87 88 89 90 91
		warn("Node creation failed, no memory\n");
		return NULL;
	}

	c_ptr = tipc_cltr_find(addr);
	if (!c_ptr) {
		c_ptr = tipc_cltr_create(addr);
	}
	if (!c_ptr) {
92
		spin_unlock_bh(&node_create_lock);
93 94 95
		kfree(n_ptr);
		return NULL;
	}
96

97
	n_ptr->addr = addr;
98
	spin_lock_init(&n_ptr->lock);
99 100 101 102 103
	INIT_LIST_HEAD(&n_ptr->nsub);
	n_ptr->owner = c_ptr;
	tipc_cltr_attach_node(c_ptr, n_ptr);

	/* Insert node into ordered list */
104
	for (curr_node = &tipc_nodes; *curr_node;
105 106 107 108 109 110 111
	     curr_node = &(*curr_node)->next) {
		if (addr < (*curr_node)->addr) {
			n_ptr->next = *curr_node;
			break;
		}
	}
	(*curr_node) = n_ptr;
112
	spin_unlock_bh(&node_create_lock);
P
Per Liden 已提交
113 114 115
	return n_ptr;
}

116
void tipc_node_delete(struct tipc_node *n_ptr)
P
Per Liden 已提交
117 118 119 120 121 122 123 124 125 126
{
	if (!n_ptr)
		return;

	dbg("node %x deleted\n", n_ptr->addr);
	kfree(n_ptr);
}


/**
127
 * tipc_node_link_up - handle addition of link
128
 *
P
Per Liden 已提交
129 130 131
 * Link becomes active (alone or shared) or standby, depending on its priority.
 */

132
void tipc_node_link_up(struct tipc_node *n_ptr, struct link *l_ptr)
P
Per Liden 已提交
133 134 135
{
	struct link **active = &n_ptr->active_links[0];

136 137
	n_ptr->working_links++;

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

P
Per Liden 已提交
141 142 143 144 145 146
	if (!active[0]) {
		dbg(" link %x into %x/%x\n", l_ptr, &active[0], &active[1]);
		active[0] = active[1] = l_ptr;
		node_established_contact(n_ptr);
		return;
	}
147
	if (l_ptr->priority < active[0]->priority) {
148
		info("New link <%s> becomes standby\n", l_ptr->name);
P
Per Liden 已提交
149 150
		return;
	}
151
	tipc_link_send_duplicate(active[0], l_ptr);
152
	if (l_ptr->priority == active[0]->priority) {
P
Per Liden 已提交
153 154 155
		active[0] = l_ptr;
		return;
	}
156 157 158
	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 已提交
159 160 161 162 163 164 165
	active[0] = active[1] = l_ptr;
}

/**
 * node_select_active_links - select active link
 */

166
static void node_select_active_links(struct tipc_node *n_ptr)
P
Per Liden 已提交
167 168 169 170 171
{
	struct link **active = &n_ptr->active_links[0];
	u32 i;
	u32 highest_prio = 0;

172
	active[0] = active[1] = NULL;
P
Per Liden 已提交
173 174

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

177
		if (!l_ptr || !tipc_link_is_up(l_ptr) ||
P
Per Liden 已提交
178 179 180 181
		    (l_ptr->priority < highest_prio))
			continue;

		if (l_ptr->priority > highest_prio) {
182
			highest_prio = l_ptr->priority;
P
Per Liden 已提交
183 184 185 186 187 188 189 190
			active[0] = active[1] = l_ptr;
		} else {
			active[1] = l_ptr;
		}
	}
}

/**
191
 * tipc_node_link_down - handle loss of link
P
Per Liden 已提交
192 193
 */

194
void tipc_node_link_down(struct tipc_node *n_ptr, struct link *l_ptr)
P
Per Liden 已提交
195 196 197
{
	struct link **active;

198 199
	n_ptr->working_links--;

200
	if (!tipc_link_is_active(l_ptr)) {
P
Per Liden 已提交
201 202 203 204 205 206 207 208 209 210 211 212 213 214
		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);
215
	if (tipc_node_is_up(n_ptr))
216
		tipc_link_changeover(l_ptr);
217
	else
P
Per Liden 已提交
218 219 220
		node_lost_contact(n_ptr);
}

221
int tipc_node_has_active_links(struct tipc_node *n_ptr)
P
Per Liden 已提交
222
{
223
	return n_ptr->active_links[0] != NULL;
P
Per Liden 已提交
224 225
}

226
int tipc_node_has_redundant_links(struct tipc_node *n_ptr)
P
Per Liden 已提交
227
{
E
Eric Dumazet 已提交
228
	return n_ptr->working_links > 1;
P
Per Liden 已提交
229 230
}

231
int tipc_node_is_up(struct tipc_node *n_ptr)
P
Per Liden 已提交
232
{
233
	return tipc_node_has_active_links(n_ptr);
P
Per Liden 已提交
234 235
}

236
struct tipc_node *tipc_node_attach_link(struct link *l_ptr)
P
Per Liden 已提交
237
{
238
	struct tipc_node *n_ptr = tipc_node_find(l_ptr->addr);
P
Per Liden 已提交
239 240

	if (!n_ptr)
241
		n_ptr = tipc_node_create(l_ptr->addr);
242
	if (n_ptr) {
P
Per Liden 已提交
243 244 245
		u32 bearer_id = l_ptr->b_ptr->identity;
		char addr_string[16];

246 247
		if (n_ptr->link_cnt >= 2) {
			err("Attempt to create third link to %s\n",
248
			    tipc_addr_string_fill(addr_string, n_ptr->addr));
249 250 251 252 253
			return NULL;
		}

		if (!n_ptr->links[bearer_id]) {
			n_ptr->links[bearer_id] = l_ptr;
254
			tipc_net.links++;
255 256 257
			n_ptr->link_cnt++;
			return n_ptr;
		}
258
		err("Attempt to establish second link on <%s> to %s\n",
259
		    l_ptr->b_ptr->publ.name,
260
		    tipc_addr_string_fill(addr_string, l_ptr->addr));
261
	}
262
	return NULL;
P
Per Liden 已提交
263 264
}

265
void tipc_node_detach_link(struct tipc_node *n_ptr, struct link *l_ptr)
P
Per Liden 已提交
266
{
267
	n_ptr->links[l_ptr->b_ptr->identity] = NULL;
268
	tipc_net.links--;
P
Per Liden 已提交
269 270 271 272 273 274 275
	n_ptr->link_cnt--;
}

/*
 * Routing table management - five cases to handle:
 *
 * 1: A link towards a zone/cluster external node comes up.
276 277 278
 *    => 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 已提交
279 280 281
 *    (node.establishedContact()=>cluster.multicastNewRoute())
 *
 * 2: A link towards a slave node comes up.
282 283 284
 *    => 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 已提交
285
 *    (node.establishedContact()=>cluster.multicastNewRoute())
286
 *    => Send a  message to the slave node about existence
P
Per Liden 已提交
287 288 289 290 291 292 293 294 295
 *    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())
296
 *    => Send messages to all directly connected slave nodes
P
Per Liden 已提交
297 298
 *    containing information about the existence of the new node
 *    (node.establishedContact()=>cluster.multicastNewRoute())
299
 *
P
Per Liden 已提交
300 301
 * 4: The link towards a zone/cluster external node or slave
 *    node goes down.
302
 *    => Send a multcast message updating routing tables of all
P
Per Liden 已提交
303 304 305 306 307 308 309 310 311
 *    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())
312
 *    => Send messages to all directly connected slave nodes
P
Per Liden 已提交
313 314 315 316 317
 *    containing information about loss of the node
 *    (node.establishedContact()=>cluster.multicastLostRoute())
 *
 */

318
static void node_established_contact(struct tipc_node *n_ptr)
P
Per Liden 已提交
319 320
{
	dbg("node_established_contact:-> %x\n", n_ptr->addr);
321
	tipc_k_signal((Handler)tipc_named_node_up, n_ptr->addr);
P
Per Liden 已提交
322

323 324
	/* Syncronize broadcast acks */
	n_ptr->bclink.acked = tipc_bclink_get_last_sent();
P
Per Liden 已提交
325 326

	if (n_ptr->bclink.supported) {
327
		tipc_nmap_add(&tipc_cltr_bcast_nodes, n_ptr->addr);
P
Per Liden 已提交
328 329 330 331 332
		if (n_ptr->addr < tipc_own_addr)
			tipc_own_tag++;
	}
}

333 334 335 336 337 338 339 340 341 342 343 344 345 346
static void node_cleanup_finished(unsigned long node_addr)
{
	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);
		n_ptr->cleanup_required = 0;
		tipc_node_unlock(n_ptr);
	}
	read_unlock_bh(&tipc_net_lock);
}

347
static void node_lost_contact(struct tipc_node *n_ptr)
P
Per Liden 已提交
348
{
349
	struct tipc_node_subscr *ns, *tns;
P
Per Liden 已提交
350 351 352
	char addr_string[16];
	u32 i;

353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368
	/* Clean up broadcast reception remains */
	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;
	}
	if (in_own_cluster(n_ptr->addr) && n_ptr->bclink.supported) {
		tipc_bclink_acknowledge(n_ptr, mod(n_ptr->bclink.acked + 10000));
	}

	/* Update routing tables */
369 370 371 372
	if (n_ptr->bclink.supported) {
		tipc_nmap_remove(&tipc_cltr_bcast_nodes, n_ptr->addr);
		if (n_ptr->addr < tipc_own_addr)
			tipc_own_tag--;
P
Per Liden 已提交
373 374
	}

375
	info("Lost contact with %s\n",
376
	     tipc_addr_string_fill(addr_string, n_ptr->addr));
P
Per Liden 已提交
377 378 379 380

	/* Abort link changeover */
	for (i = 0; i < MAX_BEARERS; i++) {
		struct link *l_ptr = n_ptr->links[i];
381
		if (!l_ptr)
P
Per Liden 已提交
382 383 384
			continue;
		l_ptr->reset_checkpoint = l_ptr->next_in_no;
		l_ptr->exp_msg_count = 0;
385
		tipc_link_reset_fragments(l_ptr);
P
Per Liden 已提交
386 387 388 389
	}

	/* Notify subscribers */
	list_for_each_entry_safe(ns, tns, &n_ptr->nsub, nodesub_list) {
390
		ns->node = NULL;
P
Per Liden 已提交
391
		list_del_init(&ns->nodesub_list);
392 393
		tipc_k_signal((Handler)ns->handle_node_down,
			      (unsigned long)ns->usr_handle);
P
Per Liden 已提交
394
	}
395 396 397 398 399

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

	n_ptr->cleanup_required = 1;
	tipc_k_signal((Handler)node_cleanup_finished, n_ptr->addr);
P
Per Liden 已提交
400 401
}

402
struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space)
P
Per Liden 已提交
403 404 405
{
	u32 domain;
	struct sk_buff *buf;
406
	struct tipc_node *n_ptr;
407
	struct tipc_node_info node_info;
408
	u32 payload_size;
P
Per Liden 已提交
409 410

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

A
Al Viro 已提交
413
	domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
414 415 416
	if (!tipc_addr_domain_valid(domain))
		return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
						   " (network address)");
P
Per Liden 已提交
417

418 419 420
	read_lock_bh(&tipc_net_lock);
	if (!tipc_nodes) {
		read_unlock_bh(&tipc_net_lock);
421
		return tipc_cfg_reply_none();
422
	}
P
Per Liden 已提交
423

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

426
	payload_size = TLV_SPACE(sizeof(node_info)) * (tipc_max_nodes - 1);
427 428
	if (payload_size > 32768u) {
		read_unlock_bh(&tipc_net_lock);
429 430
		return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
						   " (too many nodes)");
431
	}
432
	buf = tipc_cfg_reply_alloc(payload_size);
433 434
	if (!buf) {
		read_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
435
		return NULL;
436
	}
P
Per Liden 已提交
437 438 439

	/* Add TLVs for all nodes in scope */

440
	for (n_ptr = tipc_nodes; n_ptr; n_ptr = n_ptr->next) {
441
		if (!tipc_in_scope(domain, n_ptr->addr))
P
Per Liden 已提交
442
			continue;
443 444 445
		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,
446
				    &node_info, sizeof(node_info));
P
Per Liden 已提交
447 448
	}

449
	read_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
450 451 452
	return buf;
}

453
struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space)
P
Per Liden 已提交
454 455 456
{
	u32 domain;
	struct sk_buff *buf;
457
	struct tipc_node *n_ptr;
458
	struct tipc_link_info link_info;
459
	u32 payload_size;
P
Per Liden 已提交
460 461

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

A
Al Viro 已提交
464
	domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
465 466 467
	if (!tipc_addr_domain_valid(domain))
		return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
						   " (network address)");
P
Per Liden 已提交
468

469 470 471
	if (tipc_mode != TIPC_NET_MODE)
		return tipc_cfg_reply_none();

472 473
	read_lock_bh(&tipc_net_lock);

474 475
	/* Get space for all unicast links + multicast link */

476
	payload_size = TLV_SPACE(sizeof(link_info)) * (tipc_net.links + 1);
477 478
	if (payload_size > 32768u) {
		read_unlock_bh(&tipc_net_lock);
479 480
		return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
						   " (too many links)");
481
	}
482
	buf = tipc_cfg_reply_alloc(payload_size);
483 484
	if (!buf) {
		read_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
485
		return NULL;
486
	}
P
Per Liden 已提交
487 488 489

	/* Add TLV for broadcast link */

490 491
	link_info.dest = htonl(tipc_own_addr & 0xfffff00);
	link_info.up = htonl(1);
492
	strlcpy(link_info.str, tipc_bclink_name, TIPC_MAX_LINK_NAME);
493
	tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, &link_info, sizeof(link_info));
P
Per Liden 已提交
494 495 496

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

497
	for (n_ptr = tipc_nodes; n_ptr; n_ptr = n_ptr->next) {
498
		u32 i;
P
Per Liden 已提交
499

500
		if (!tipc_in_scope(domain, n_ptr->addr))
P
Per Liden 已提交
501
			continue;
502
		tipc_node_lock(n_ptr);
503 504 505 506 507 508 509
		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,
510
					    &link_info, sizeof(link_info));
511
		}
512
		tipc_node_unlock(n_ptr);
P
Per Liden 已提交
513 514
	}

515
	read_unlock_bh(&tipc_net_lock);
P
Per Liden 已提交
516 517
	return buf;
}