blob: ee952ad602183b28446055d1bae1e0643b182358 [file] [log] [blame]
Per Lidenb97bf3f2006-01-02 19:04:38 +01001/*
2 * net/tipc/node.c: TIPC node management routines
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +09003 *
Per Liden593a5f22006-01-11 19:14:19 +01004 * Copyright (c) 2000-2006, Ericsson AB
Allan Stephensea138472006-06-29 12:33:20 -07005 * Copyright (c) 2005-2006, Wind River Systems
Per Lidenb97bf3f2006-01-02 19:04:38 +01006 * All rights reserved.
7 *
Per Liden9ea1fd32006-01-11 13:30:43 +01008 * Redistribution and use in source and binary forms, with or without
Per Lidenb97bf3f2006-01-02 19:04:38 +01009 * modification, are permitted provided that the following conditions are met:
10 *
Per Liden9ea1fd32006-01-11 13:30:43 +010011 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
Per Lidenb97bf3f2006-01-02 19:04:38 +010019 *
Per Liden9ea1fd32006-01-11 13:30:43 +010020 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
Per Lidenb97bf3f2006-01-02 19:04:38 +010034 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#include "core.h"
38#include "config.h"
39#include "node.h"
40#include "cluster.h"
41#include "net.h"
42#include "addr.h"
43#include "node_subscr.h"
44#include "link.h"
45#include "port.h"
46#include "bearer.h"
47#include "name_distr.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010048
49void node_print(struct print_buf *buf, struct node *n_ptr, char *str);
50static void node_lost_contact(struct node *n_ptr);
51static void node_established_contact(struct node *n_ptr);
52
Per Liden4323add2006-01-18 00:38:21 +010053struct node *tipc_nodes = NULL; /* sorted list of nodes within cluster */
Per Lidenb97bf3f2006-01-02 19:04:38 +010054
Allan Stephens2ecb0922008-05-21 14:53:00 -070055static DEFINE_SPINLOCK(node_create_lock);
56
Per Lidenb97bf3f2006-01-02 19:04:38 +010057u32 tipc_own_tag = 0;
58
Allan Stephens2ecb0922008-05-21 14:53:00 -070059/**
60 * tipc_node_create - create neighboring node
61 *
62 * Currently, this routine is called by neighbor discovery code, which holds
63 * net_lock for reading only. We must take node_create_lock to ensure a node
64 * isn't created twice if two different bearers discover the node at the same
65 * time. (It would be preferable to switch to holding net_lock in write mode,
66 * but this is a non-trivial change.)
67 */
68
Per Liden4323add2006-01-18 00:38:21 +010069struct node *tipc_node_create(u32 addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +010070{
71 struct cluster *c_ptr;
72 struct node *n_ptr;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090073 struct node **curr_node;
Per Lidenb97bf3f2006-01-02 19:04:38 +010074
Allan Stephens2ecb0922008-05-21 14:53:00 -070075 spin_lock_bh(&node_create_lock);
76
77 for (n_ptr = tipc_nodes; n_ptr; n_ptr = n_ptr->next) {
78 if (addr < n_ptr->addr)
79 break;
80 if (addr == n_ptr->addr) {
81 spin_unlock_bh(&node_create_lock);
82 return n_ptr;
83 }
84 }
85
Arnaldo Carvalho de Melo2710b572006-11-21 01:22:12 -020086 n_ptr = kzalloc(sizeof(*n_ptr),GFP_ATOMIC);
Allan Stephensa10bd922006-06-25 23:52:17 -070087 if (!n_ptr) {
Allan Stephens2ecb0922008-05-21 14:53:00 -070088 spin_unlock_bh(&node_create_lock);
Allan Stephensa10bd922006-06-25 23:52:17 -070089 warn("Node creation failed, no memory\n");
90 return NULL;
91 }
Per Lidenb97bf3f2006-01-02 19:04:38 +010092
Allan Stephensa10bd922006-06-25 23:52:17 -070093 c_ptr = tipc_cltr_find(addr);
94 if (!c_ptr) {
95 c_ptr = tipc_cltr_create(addr);
96 }
97 if (!c_ptr) {
Allan Stephens2ecb0922008-05-21 14:53:00 -070098 spin_unlock_bh(&node_create_lock);
Allan Stephensa10bd922006-06-25 23:52:17 -070099 kfree(n_ptr);
100 return NULL;
101 }
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900102
Allan Stephensa10bd922006-06-25 23:52:17 -0700103 n_ptr->addr = addr;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900104 spin_lock_init(&n_ptr->lock);
Allan Stephensa10bd922006-06-25 23:52:17 -0700105 INIT_LIST_HEAD(&n_ptr->nsub);
106 n_ptr->owner = c_ptr;
107 tipc_cltr_attach_node(c_ptr, n_ptr);
108 n_ptr->last_router = -1;
109
110 /* Insert node into ordered list */
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900111 for (curr_node = &tipc_nodes; *curr_node;
Allan Stephensa10bd922006-06-25 23:52:17 -0700112 curr_node = &(*curr_node)->next) {
113 if (addr < (*curr_node)->addr) {
114 n_ptr->next = *curr_node;
115 break;
116 }
117 }
118 (*curr_node) = n_ptr;
Allan Stephens2ecb0922008-05-21 14:53:00 -0700119 spin_unlock_bh(&node_create_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100120 return n_ptr;
121}
122
Per Liden4323add2006-01-18 00:38:21 +0100123void tipc_node_delete(struct node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100124{
125 if (!n_ptr)
126 return;
127
128#if 0
Per Liden4323add2006-01-18 00:38:21 +0100129 /* Not needed because links are already deleted via tipc_bearer_stop() */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100130
131 u32 l_num;
132
133 for (l_num = 0; l_num < MAX_BEARERS; l_num++) {
134 link_delete(n_ptr->links[l_num]);
135 }
136#endif
137
138 dbg("node %x deleted\n", n_ptr->addr);
139 kfree(n_ptr);
140}
141
142
143/**
Per Liden4323add2006-01-18 00:38:21 +0100144 * tipc_node_link_up - handle addition of link
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900145 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100146 * Link becomes active (alone or shared) or standby, depending on its priority.
147 */
148
Per Liden4323add2006-01-18 00:38:21 +0100149void tipc_node_link_up(struct node *n_ptr, struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100150{
151 struct link **active = &n_ptr->active_links[0];
152
Allan Stephens5392d642006-06-25 23:52:50 -0700153 n_ptr->working_links++;
154
Per Lidenb97bf3f2006-01-02 19:04:38 +0100155 info("Established link <%s> on network plane %c\n",
156 l_ptr->name, l_ptr->b_ptr->net_plane);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900157
Per Lidenb97bf3f2006-01-02 19:04:38 +0100158 if (!active[0]) {
159 dbg(" link %x into %x/%x\n", l_ptr, &active[0], &active[1]);
160 active[0] = active[1] = l_ptr;
161 node_established_contact(n_ptr);
162 return;
163 }
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900164 if (l_ptr->priority < active[0]->priority) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700165 info("New link <%s> becomes standby\n", l_ptr->name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100166 return;
167 }
Per Liden4323add2006-01-18 00:38:21 +0100168 tipc_link_send_duplicate(active[0], l_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900169 if (l_ptr->priority == active[0]->priority) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100170 active[0] = l_ptr;
171 return;
172 }
Allan Stephensa10bd922006-06-25 23:52:17 -0700173 info("Old link <%s> becomes standby\n", active[0]->name);
174 if (active[1] != active[0])
175 info("Old link <%s> becomes standby\n", active[1]->name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100176 active[0] = active[1] = l_ptr;
177}
178
179/**
180 * node_select_active_links - select active link
181 */
182
183static void node_select_active_links(struct node *n_ptr)
184{
185 struct link **active = &n_ptr->active_links[0];
186 u32 i;
187 u32 highest_prio = 0;
188
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900189 active[0] = active[1] = NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100190
191 for (i = 0; i < MAX_BEARERS; i++) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900192 struct link *l_ptr = n_ptr->links[i];
Per Lidenb97bf3f2006-01-02 19:04:38 +0100193
Per Liden4323add2006-01-18 00:38:21 +0100194 if (!l_ptr || !tipc_link_is_up(l_ptr) ||
Per Lidenb97bf3f2006-01-02 19:04:38 +0100195 (l_ptr->priority < highest_prio))
196 continue;
197
198 if (l_ptr->priority > highest_prio) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900199 highest_prio = l_ptr->priority;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100200 active[0] = active[1] = l_ptr;
201 } else {
202 active[1] = l_ptr;
203 }
204 }
205}
206
207/**
Per Liden4323add2006-01-18 00:38:21 +0100208 * tipc_node_link_down - handle loss of link
Per Lidenb97bf3f2006-01-02 19:04:38 +0100209 */
210
Per Liden4323add2006-01-18 00:38:21 +0100211void tipc_node_link_down(struct node *n_ptr, struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100212{
213 struct link **active;
214
Allan Stephens5392d642006-06-25 23:52:50 -0700215 n_ptr->working_links--;
216
Per Liden4323add2006-01-18 00:38:21 +0100217 if (!tipc_link_is_active(l_ptr)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100218 info("Lost standby link <%s> on network plane %c\n",
219 l_ptr->name, l_ptr->b_ptr->net_plane);
220 return;
221 }
222 info("Lost link <%s> on network plane %c\n",
223 l_ptr->name, l_ptr->b_ptr->net_plane);
224
225 active = &n_ptr->active_links[0];
226 if (active[0] == l_ptr)
227 active[0] = active[1];
228 if (active[1] == l_ptr)
229 active[1] = active[0];
230 if (active[0] == l_ptr)
231 node_select_active_links(n_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900232 if (tipc_node_is_up(n_ptr))
Per Liden4323add2006-01-18 00:38:21 +0100233 tipc_link_changeover(l_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900234 else
Per Lidenb97bf3f2006-01-02 19:04:38 +0100235 node_lost_contact(n_ptr);
236}
237
Per Liden4323add2006-01-18 00:38:21 +0100238int tipc_node_has_active_links(struct node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100239{
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900240 return (n_ptr &&
Per Lidenb97bf3f2006-01-02 19:04:38 +0100241 ((n_ptr->active_links[0]) || (n_ptr->active_links[1])));
242}
243
Per Liden4323add2006-01-18 00:38:21 +0100244int tipc_node_has_redundant_links(struct node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100245{
Allan Stephens5392d642006-06-25 23:52:50 -0700246 return (n_ptr->working_links > 1);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100247}
248
Adrian Bunk988f0882006-03-20 22:37:52 -0800249static int tipc_node_has_active_routes(struct node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100250{
251 return (n_ptr && (n_ptr->last_router >= 0));
252}
253
Per Liden4323add2006-01-18 00:38:21 +0100254int tipc_node_is_up(struct node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100255{
Per Liden4323add2006-01-18 00:38:21 +0100256 return (tipc_node_has_active_links(n_ptr) || tipc_node_has_active_routes(n_ptr));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100257}
258
Per Liden4323add2006-01-18 00:38:21 +0100259struct node *tipc_node_attach_link(struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100260{
Per Liden4323add2006-01-18 00:38:21 +0100261 struct node *n_ptr = tipc_node_find(l_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100262
263 if (!n_ptr)
Per Liden4323add2006-01-18 00:38:21 +0100264 n_ptr = tipc_node_create(l_ptr->addr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900265 if (n_ptr) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100266 u32 bearer_id = l_ptr->b_ptr->identity;
267 char addr_string[16];
268
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900269 if (n_ptr->link_cnt >= 2) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900270 err("Attempt to create third link to %s\n",
Per Lidenb97bf3f2006-01-02 19:04:38 +0100271 addr_string_fill(addr_string, n_ptr->addr));
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900272 return NULL;
273 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100274
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900275 if (!n_ptr->links[bearer_id]) {
276 n_ptr->links[bearer_id] = l_ptr;
277 tipc_net.zones[tipc_zone(l_ptr->addr)]->links++;
278 n_ptr->link_cnt++;
279 return n_ptr;
280 }
281 err("Attempt to establish second link on <%s> to %s \n",
282 l_ptr->b_ptr->publ.name,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100283 addr_string_fill(addr_string, l_ptr->addr));
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900284 }
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800285 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100286}
287
Per Liden4323add2006-01-18 00:38:21 +0100288void tipc_node_detach_link(struct node *n_ptr, struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100289{
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800290 n_ptr->links[l_ptr->b_ptr->identity] = NULL;
Per Liden4323add2006-01-18 00:38:21 +0100291 tipc_net.zones[tipc_zone(l_ptr->addr)]->links--;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100292 n_ptr->link_cnt--;
293}
294
295/*
296 * Routing table management - five cases to handle:
297 *
298 * 1: A link towards a zone/cluster external node comes up.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900299 * => Send a multicast message updating routing tables of all
300 * system nodes within own cluster that the new destination
301 * can be reached via this node.
Per Lidenb97bf3f2006-01-02 19:04:38 +0100302 * (node.establishedContact()=>cluster.multicastNewRoute())
303 *
304 * 2: A link towards a slave node comes up.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900305 * => Send a multicast message updating routing tables of all
306 * system nodes within own cluster that the new destination
307 * can be reached via this node.
Per Lidenb97bf3f2006-01-02 19:04:38 +0100308 * (node.establishedContact()=>cluster.multicastNewRoute())
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900309 * => Send a message to the slave node about existence
Per Lidenb97bf3f2006-01-02 19:04:38 +0100310 * of all system nodes within cluster:
311 * (node.establishedContact()=>cluster.sendLocalRoutes())
312 *
313 * 3: A new cluster local system node becomes available.
314 * => Send message(s) to this particular node containing
315 * information about all cluster external and slave
316 * nodes which can be reached via this node.
317 * (node.establishedContact()==>network.sendExternalRoutes())
318 * (node.establishedContact()==>network.sendSlaveRoutes())
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900319 * => Send messages to all directly connected slave nodes
Per Lidenb97bf3f2006-01-02 19:04:38 +0100320 * containing information about the existence of the new node
321 * (node.establishedContact()=>cluster.multicastNewRoute())
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900322 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100323 * 4: The link towards a zone/cluster external node or slave
324 * node goes down.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900325 * => Send a multcast message updating routing tables of all
Per Lidenb97bf3f2006-01-02 19:04:38 +0100326 * nodes within cluster that the new destination can not any
327 * longer be reached via this node.
328 * (node.lostAllLinks()=>cluster.bcastLostRoute())
329 *
330 * 5: A cluster local system node becomes unavailable.
331 * => Remove all references to this node from the local
332 * routing tables. Note: This is a completely node
333 * local operation.
334 * (node.lostAllLinks()=>network.removeAsRouter())
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900335 * => Send messages to all directly connected slave nodes
Per Lidenb97bf3f2006-01-02 19:04:38 +0100336 * containing information about loss of the node
337 * (node.establishedContact()=>cluster.multicastLostRoute())
338 *
339 */
340
341static void node_established_contact(struct node *n_ptr)
342{
343 struct cluster *c_ptr;
344
345 dbg("node_established_contact:-> %x\n", n_ptr->addr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900346 if (!tipc_node_has_active_routes(n_ptr) && in_own_cluster(n_ptr->addr)) {
Per Liden4323add2006-01-18 00:38:21 +0100347 tipc_k_signal((Handler)tipc_named_node_up, n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100348 }
349
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900350 /* Syncronize broadcast acks */
351 n_ptr->bclink.acked = tipc_bclink_get_last_sent();
Per Lidenb97bf3f2006-01-02 19:04:38 +0100352
353 if (is_slave(tipc_own_addr))
354 return;
355 if (!in_own_cluster(n_ptr->addr)) {
356 /* Usage case 1 (see above) */
Per Liden4323add2006-01-18 00:38:21 +0100357 c_ptr = tipc_cltr_find(tipc_own_addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100358 if (!c_ptr)
Per Liden4323add2006-01-18 00:38:21 +0100359 c_ptr = tipc_cltr_create(tipc_own_addr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900360 if (c_ptr)
361 tipc_cltr_bcast_new_route(c_ptr, n_ptr->addr, 1,
Per Liden4323add2006-01-18 00:38:21 +0100362 tipc_max_nodes);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100363 return;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900364 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100365
366 c_ptr = n_ptr->owner;
367 if (is_slave(n_ptr->addr)) {
368 /* Usage case 2 (see above) */
Per Liden4323add2006-01-18 00:38:21 +0100369 tipc_cltr_bcast_new_route(c_ptr, n_ptr->addr, 1, tipc_max_nodes);
370 tipc_cltr_send_local_routes(c_ptr, n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100371 return;
372 }
373
374 if (n_ptr->bclink.supported) {
Per Liden4323add2006-01-18 00:38:21 +0100375 tipc_nmap_add(&tipc_cltr_bcast_nodes, n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100376 if (n_ptr->addr < tipc_own_addr)
377 tipc_own_tag++;
378 }
379
380 /* Case 3 (see above) */
Per Liden4323add2006-01-18 00:38:21 +0100381 tipc_net_send_external_routes(n_ptr->addr);
382 tipc_cltr_send_slave_routes(c_ptr, n_ptr->addr);
383 tipc_cltr_bcast_new_route(c_ptr, n_ptr->addr, LOWEST_SLAVE,
384 tipc_highest_allowed_slave);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100385}
386
387static void node_lost_contact(struct node *n_ptr)
388{
389 struct cluster *c_ptr;
390 struct node_subscr *ns, *tns;
391 char addr_string[16];
392 u32 i;
393
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900394 /* Clean up broadcast reception remains */
395 n_ptr->bclink.gap_after = n_ptr->bclink.gap_to = 0;
396 while (n_ptr->bclink.deferred_head) {
397 struct sk_buff* buf = n_ptr->bclink.deferred_head;
398 n_ptr->bclink.deferred_head = buf->next;
399 buf_discard(buf);
400 }
401 if (n_ptr->bclink.defragm) {
402 buf_discard(n_ptr->bclink.defragm);
403 n_ptr->bclink.defragm = NULL;
404 }
405 if (in_own_cluster(n_ptr->addr) && n_ptr->bclink.supported) {
406 tipc_bclink_acknowledge(n_ptr, mod(n_ptr->bclink.acked + 10000));
407 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100408
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900409 /* Update routing tables */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100410 if (is_slave(tipc_own_addr)) {
Per Liden4323add2006-01-18 00:38:21 +0100411 tipc_net_remove_as_router(n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100412 } else {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900413 if (!in_own_cluster(n_ptr->addr)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100414 /* Case 4 (see above) */
Per Liden4323add2006-01-18 00:38:21 +0100415 c_ptr = tipc_cltr_find(tipc_own_addr);
416 tipc_cltr_bcast_lost_route(c_ptr, n_ptr->addr, 1,
417 tipc_max_nodes);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100418 } else {
419 /* Case 5 (see above) */
Per Liden4323add2006-01-18 00:38:21 +0100420 c_ptr = tipc_cltr_find(n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100421 if (is_slave(n_ptr->addr)) {
Per Liden4323add2006-01-18 00:38:21 +0100422 tipc_cltr_bcast_lost_route(c_ptr, n_ptr->addr, 1,
423 tipc_max_nodes);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100424 } else {
425 if (n_ptr->bclink.supported) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900426 tipc_nmap_remove(&tipc_cltr_bcast_nodes,
Per Liden4323add2006-01-18 00:38:21 +0100427 n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100428 if (n_ptr->addr < tipc_own_addr)
429 tipc_own_tag--;
430 }
Per Liden4323add2006-01-18 00:38:21 +0100431 tipc_net_remove_as_router(n_ptr->addr);
432 tipc_cltr_bcast_lost_route(c_ptr, n_ptr->addr,
433 LOWEST_SLAVE,
434 tipc_highest_allowed_slave);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100435 }
436 }
437 }
Per Liden4323add2006-01-18 00:38:21 +0100438 if (tipc_node_has_active_routes(n_ptr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100439 return;
440
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900441 info("Lost contact with %s\n",
Per Lidenb97bf3f2006-01-02 19:04:38 +0100442 addr_string_fill(addr_string, n_ptr->addr));
443
444 /* Abort link changeover */
445 for (i = 0; i < MAX_BEARERS; i++) {
446 struct link *l_ptr = n_ptr->links[i];
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900447 if (!l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100448 continue;
449 l_ptr->reset_checkpoint = l_ptr->next_in_no;
450 l_ptr->exp_msg_count = 0;
Per Liden4323add2006-01-18 00:38:21 +0100451 tipc_link_reset_fragments(l_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100452 }
453
454 /* Notify subscribers */
455 list_for_each_entry_safe(ns, tns, &n_ptr->nsub, nodesub_list) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900456 ns->node = NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100457 list_del_init(&ns->nodesub_list);
Per Liden4323add2006-01-18 00:38:21 +0100458 tipc_k_signal((Handler)ns->handle_node_down,
459 (unsigned long)ns->usr_handle);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100460 }
461}
462
463/**
Per Liden4323add2006-01-18 00:38:21 +0100464 * tipc_node_select_next_hop - find the next-hop node for a message
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900465 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100466 * Called by when cluster local lookup has failed.
467 */
468
Per Liden4323add2006-01-18 00:38:21 +0100469struct node *tipc_node_select_next_hop(u32 addr, u32 selector)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100470{
471 struct node *n_ptr;
472 u32 router_addr;
473
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900474 if (!tipc_addr_domain_valid(addr))
475 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100476
477 /* Look for direct link to destination processsor */
Per Liden4323add2006-01-18 00:38:21 +0100478 n_ptr = tipc_node_find(addr);
479 if (n_ptr && tipc_node_has_active_links(n_ptr))
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900480 return n_ptr;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100481
482 /* Cluster local system nodes *must* have direct links */
483 if (!is_slave(addr) && in_own_cluster(addr))
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800484 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100485
486 /* Look for cluster local router with direct link to node */
Per Liden4323add2006-01-18 00:38:21 +0100487 router_addr = tipc_node_select_router(n_ptr, selector);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900488 if (router_addr)
489 return tipc_node_select(router_addr, selector);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100490
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900491 /* Slave nodes can only be accessed within own cluster via a
Per Lidenb97bf3f2006-01-02 19:04:38 +0100492 known router with direct link -- if no router was found,give up */
493 if (is_slave(addr))
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800494 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100495
496 /* Inter zone/cluster -- find any direct link to remote cluster */
497 addr = tipc_addr(tipc_zone(addr), tipc_cluster(addr), 0);
Per Liden4323add2006-01-18 00:38:21 +0100498 n_ptr = tipc_net_select_remote_node(addr, selector);
499 if (n_ptr && tipc_node_has_active_links(n_ptr))
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900500 return n_ptr;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100501
502 /* Last resort -- look for any router to anywhere in remote zone */
Per Liden4323add2006-01-18 00:38:21 +0100503 router_addr = tipc_net_select_router(addr, selector);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900504 if (router_addr)
505 return tipc_node_select(router_addr, selector);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100506
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900507 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100508}
509
510/**
Per Liden4323add2006-01-18 00:38:21 +0100511 * tipc_node_select_router - select router to reach specified node
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900512 *
513 * Uses a deterministic and fair algorithm for selecting router node.
Per Lidenb97bf3f2006-01-02 19:04:38 +0100514 */
515
Per Liden4323add2006-01-18 00:38:21 +0100516u32 tipc_node_select_router(struct node *n_ptr, u32 ref)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100517{
518 u32 ulim;
519 u32 mask;
520 u32 start;
521 u32 r;
522
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900523 if (!n_ptr)
524 return 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100525
526 if (n_ptr->last_router < 0)
527 return 0;
528 ulim = ((n_ptr->last_router + 1) * 32) - 1;
529
530 /* Start entry must be random */
531 mask = tipc_max_nodes;
532 while (mask > ulim)
533 mask >>= 1;
534 start = ref & mask;
535 r = start;
536
537 /* Lookup upwards with wrap-around */
538 do {
539 if (((n_ptr->routers[r / 32]) >> (r % 32)) & 1)
540 break;
541 } while (++r <= ulim);
542 if (r > ulim) {
543 r = 1;
544 do {
545 if (((n_ptr->routers[r / 32]) >> (r % 32)) & 1)
546 break;
547 } while (++r < start);
548 assert(r != start);
549 }
550 assert(r && (r <= ulim));
551 return tipc_addr(own_zone(), own_cluster(), r);
552}
553
Per Liden4323add2006-01-18 00:38:21 +0100554void tipc_node_add_router(struct node *n_ptr, u32 router)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100555{
556 u32 r_num = tipc_node(router);
557
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900558 n_ptr->routers[r_num / 32] =
Per Lidenb97bf3f2006-01-02 19:04:38 +0100559 ((1 << (r_num % 32)) | n_ptr->routers[r_num / 32]);
560 n_ptr->last_router = tipc_max_nodes / 32;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900561 while ((--n_ptr->last_router >= 0) &&
Per Lidenb97bf3f2006-01-02 19:04:38 +0100562 !n_ptr->routers[n_ptr->last_router]);
563}
564
Per Liden4323add2006-01-18 00:38:21 +0100565void tipc_node_remove_router(struct node *n_ptr, u32 router)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100566{
567 u32 r_num = tipc_node(router);
568
569 if (n_ptr->last_router < 0)
570 return; /* No routes */
571
572 n_ptr->routers[r_num / 32] =
573 ((~(1 << (r_num % 32))) & (n_ptr->routers[r_num / 32]));
574 n_ptr->last_router = tipc_max_nodes / 32;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900575 while ((--n_ptr->last_router >= 0) &&
Per Lidenb97bf3f2006-01-02 19:04:38 +0100576 !n_ptr->routers[n_ptr->last_router]);
577
Per Liden4323add2006-01-18 00:38:21 +0100578 if (!tipc_node_is_up(n_ptr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100579 node_lost_contact(n_ptr);
580}
581
582#if 0
583void node_print(struct print_buf *buf, struct node *n_ptr, char *str)
584{
585 u32 i;
586
587 tipc_printf(buf, "\n\n%s", str);
588 for (i = 0; i < MAX_BEARERS; i++) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900589 if (!n_ptr->links[i])
Per Lidenb97bf3f2006-01-02 19:04:38 +0100590 continue;
591 tipc_printf(buf, "Links[%u]: %x, ", i, n_ptr->links[i]);
592 }
593 tipc_printf(buf, "Active links: [%x,%x]\n",
594 n_ptr->active_links[0], n_ptr->active_links[1]);
595}
596#endif
597
598u32 tipc_available_nodes(const u32 domain)
599{
600 struct node *n_ptr;
601 u32 cnt = 0;
602
Allan Stephens1aad72d2008-07-14 22:44:58 -0700603 read_lock_bh(&tipc_net_lock);
Per Liden4323add2006-01-18 00:38:21 +0100604 for (n_ptr = tipc_nodes; n_ptr; n_ptr = n_ptr->next) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100605 if (!in_scope(domain, n_ptr->addr))
606 continue;
Per Liden4323add2006-01-18 00:38:21 +0100607 if (tipc_node_is_up(n_ptr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100608 cnt++;
609 }
Allan Stephens1aad72d2008-07-14 22:44:58 -0700610 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100611 return cnt;
612}
613
Per Liden4323add2006-01-18 00:38:21 +0100614struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100615{
616 u32 domain;
617 struct sk_buff *buf;
618 struct node *n_ptr;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900619 struct tipc_node_info node_info;
Allan Stephensea138472006-06-29 12:33:20 -0700620 u32 payload_size;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100621
622 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR))
Per Liden4323add2006-01-18 00:38:21 +0100623 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100624
Al Viro3e6c8cd2006-11-08 00:19:09 -0800625 domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
Per Liden4323add2006-01-18 00:38:21 +0100626 if (!tipc_addr_domain_valid(domain))
627 return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
628 " (network address)");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100629
Allan Stephens1aad72d2008-07-14 22:44:58 -0700630 read_lock_bh(&tipc_net_lock);
631 if (!tipc_nodes) {
632 read_unlock_bh(&tipc_net_lock);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900633 return tipc_cfg_reply_none();
Allan Stephens1aad72d2008-07-14 22:44:58 -0700634 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100635
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900636 /* For now, get space for all other nodes
Per Lidenb97bf3f2006-01-02 19:04:38 +0100637 (will need to modify this when slave nodes are supported */
638
Allan Stephensea138472006-06-29 12:33:20 -0700639 payload_size = TLV_SPACE(sizeof(node_info)) * (tipc_max_nodes - 1);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700640 if (payload_size > 32768u) {
641 read_unlock_bh(&tipc_net_lock);
Allan Stephensea138472006-06-29 12:33:20 -0700642 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
643 " (too many nodes)");
Allan Stephens1aad72d2008-07-14 22:44:58 -0700644 }
Allan Stephensea138472006-06-29 12:33:20 -0700645 buf = tipc_cfg_reply_alloc(payload_size);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700646 if (!buf) {
647 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100648 return NULL;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700649 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100650
651 /* Add TLVs for all nodes in scope */
652
Per Liden4323add2006-01-18 00:38:21 +0100653 for (n_ptr = tipc_nodes; n_ptr; n_ptr = n_ptr->next) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100654 if (!in_scope(domain, n_ptr->addr))
655 continue;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900656 node_info.addr = htonl(n_ptr->addr);
657 node_info.up = htonl(tipc_node_is_up(n_ptr));
658 tipc_cfg_append_tlv(buf, TIPC_TLV_NODE_INFO,
Per Liden4323add2006-01-18 00:38:21 +0100659 &node_info, sizeof(node_info));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100660 }
661
Allan Stephens1aad72d2008-07-14 22:44:58 -0700662 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100663 return buf;
664}
665
Per Liden4323add2006-01-18 00:38:21 +0100666struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100667{
668 u32 domain;
669 struct sk_buff *buf;
670 struct node *n_ptr;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900671 struct tipc_link_info link_info;
Allan Stephensea138472006-06-29 12:33:20 -0700672 u32 payload_size;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100673
674 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR))
Per Liden4323add2006-01-18 00:38:21 +0100675 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100676
Al Viro3e6c8cd2006-11-08 00:19:09 -0800677 domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
Per Liden4323add2006-01-18 00:38:21 +0100678 if (!tipc_addr_domain_valid(domain))
679 return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
680 " (network address)");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100681
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900682 if (tipc_mode != TIPC_NET_MODE)
683 return tipc_cfg_reply_none();
684
Allan Stephens1aad72d2008-07-14 22:44:58 -0700685 read_lock_bh(&tipc_net_lock);
686
Allan Stephensea138472006-06-29 12:33:20 -0700687 /* Get space for all unicast links + multicast link */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100688
Allan Stephensea138472006-06-29 12:33:20 -0700689 payload_size = TLV_SPACE(sizeof(link_info)) *
690 (tipc_net.zones[tipc_zone(tipc_own_addr)]->links + 1);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700691 if (payload_size > 32768u) {
692 read_unlock_bh(&tipc_net_lock);
Allan Stephensea138472006-06-29 12:33:20 -0700693 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
694 " (too many links)");
Allan Stephens1aad72d2008-07-14 22:44:58 -0700695 }
Allan Stephensea138472006-06-29 12:33:20 -0700696 buf = tipc_cfg_reply_alloc(payload_size);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700697 if (!buf) {
698 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100699 return NULL;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700700 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100701
702 /* Add TLV for broadcast link */
703
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900704 link_info.dest = htonl(tipc_own_addr & 0xfffff00);
705 link_info.up = htonl(1);
706 sprintf(link_info.str, tipc_bclink_name);
Per Liden4323add2006-01-18 00:38:21 +0100707 tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, &link_info, sizeof(link_info));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100708
709 /* Add TLVs for any other links in scope */
710
Per Liden4323add2006-01-18 00:38:21 +0100711 for (n_ptr = tipc_nodes; n_ptr; n_ptr = n_ptr->next) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900712 u32 i;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100713
714 if (!in_scope(domain, n_ptr->addr))
715 continue;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700716 tipc_node_lock(n_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900717 for (i = 0; i < MAX_BEARERS; i++) {
718 if (!n_ptr->links[i])
719 continue;
720 link_info.dest = htonl(n_ptr->addr);
721 link_info.up = htonl(tipc_link_is_up(n_ptr->links[i]));
722 strcpy(link_info.str, n_ptr->links[i]->name);
723 tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO,
Per Liden4323add2006-01-18 00:38:21 +0100724 &link_info, sizeof(link_info));
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900725 }
Allan Stephens1aad72d2008-07-14 22:44:58 -0700726 tipc_node_unlock(n_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100727 }
728
Allan Stephens1aad72d2008-07-14 22:44:58 -0700729 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100730 return buf;
731}