blob: 14f98c81d313b3370dead7fa51d034985ed207de [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 Stephens2d627b92011-01-07 13:00:11 -05005 * Copyright (c) 2005-2006, 2010-2011, 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"
Per Lidenb97bf3f2006-01-02 19:04:38 +010040#include "name_distr.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010041
David S. Miller6c000552008-09-02 23:38:32 -070042static void node_lost_contact(struct tipc_node *n_ptr);
43static void node_established_contact(struct tipc_node *n_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +010044
Allan Stephens2ecb0922008-05-21 14:53:00 -070045static DEFINE_SPINLOCK(node_create_lock);
46
Allan Stephense3ec9c72010-12-31 18:59:34 +000047u32 tipc_own_tag;
Per Lidenb97bf3f2006-01-02 19:04:38 +010048
Allan Stephens2ecb0922008-05-21 14:53:00 -070049/**
50 * tipc_node_create - create neighboring node
51 *
52 * Currently, this routine is called by neighbor discovery code, which holds
53 * net_lock for reading only. We must take node_create_lock to ensure a node
54 * isn't created twice if two different bearers discover the node at the same
55 * time. (It would be preferable to switch to holding net_lock in write mode,
56 * but this is a non-trivial change.)
57 */
58
David S. Miller6c000552008-09-02 23:38:32 -070059struct tipc_node *tipc_node_create(u32 addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +010060{
David S. Miller6c000552008-09-02 23:38:32 -070061 struct tipc_node *n_ptr;
Allan Stephens8f92df62010-12-31 18:59:19 +000062 u32 n_num;
Per Lidenb97bf3f2006-01-02 19:04:38 +010063
Allan Stephens2ecb0922008-05-21 14:53:00 -070064 spin_lock_bh(&node_create_lock);
65
Allan Stephens5af54792010-12-31 18:59:23 +000066 n_ptr = tipc_node_find(addr);
67 if (n_ptr) {
68 spin_unlock_bh(&node_create_lock);
69 return n_ptr;
Allan Stephens2ecb0922008-05-21 14:53:00 -070070 }
71
Allan Stephens5af54792010-12-31 18:59:23 +000072 n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC);
Allan Stephensa10bd922006-06-25 23:52:17 -070073 if (!n_ptr) {
Allan Stephens2ecb0922008-05-21 14:53:00 -070074 spin_unlock_bh(&node_create_lock);
Allan Stephensa10bd922006-06-25 23:52:17 -070075 warn("Node creation failed, no memory\n");
76 return NULL;
77 }
Per Lidenb97bf3f2006-01-02 19:04:38 +010078
Allan Stephensa10bd922006-06-25 23:52:17 -070079 n_ptr->addr = addr;
Allan Stephens51a8e4d2010-12-31 18:59:18 +000080 spin_lock_init(&n_ptr->lock);
Allan Stephensa10bd922006-06-25 23:52:17 -070081 INIT_LIST_HEAD(&n_ptr->nsub);
Allan Stephens8f92df62010-12-31 18:59:19 +000082
83 n_num = tipc_node(addr);
84 tipc_net.nodes[n_num] = n_ptr;
85 if (n_num > tipc_net.highest_node)
86 tipc_net.highest_node = n_num;
Allan Stephensa10bd922006-06-25 23:52:17 -070087
Allan Stephens2ecb0922008-05-21 14:53:00 -070088 spin_unlock_bh(&node_create_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +010089 return n_ptr;
90}
91
David S. Miller6c000552008-09-02 23:38:32 -070092void tipc_node_delete(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +010093{
Allan Stephens8f92df62010-12-31 18:59:19 +000094 u32 n_num;
95
Per Lidenb97bf3f2006-01-02 19:04:38 +010096 if (!n_ptr)
97 return;
98
Allan Stephens8f92df62010-12-31 18:59:19 +000099 n_num = tipc_node(n_ptr->addr);
100 tipc_net.nodes[n_num] = NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100101 kfree(n_ptr);
Allan Stephens8f92df62010-12-31 18:59:19 +0000102
103 while (!tipc_net.nodes[tipc_net.highest_node])
104 if (--tipc_net.highest_node == 0)
105 break;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100106}
107
108
109/**
Per Liden4323add2006-01-18 00:38:21 +0100110 * tipc_node_link_up - handle addition of link
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900111 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100112 * Link becomes active (alone or shared) or standby, depending on its priority.
113 */
114
David S. Miller6c000552008-09-02 23:38:32 -0700115void tipc_node_link_up(struct tipc_node *n_ptr, struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100116{
117 struct link **active = &n_ptr->active_links[0];
118
Allan Stephens5392d642006-06-25 23:52:50 -0700119 n_ptr->working_links++;
120
Per Lidenb97bf3f2006-01-02 19:04:38 +0100121 info("Established link <%s> on network plane %c\n",
122 l_ptr->name, l_ptr->b_ptr->net_plane);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900123
Per Lidenb97bf3f2006-01-02 19:04:38 +0100124 if (!active[0]) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100125 active[0] = active[1] = l_ptr;
126 node_established_contact(n_ptr);
127 return;
128 }
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900129 if (l_ptr->priority < active[0]->priority) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700130 info("New link <%s> becomes standby\n", l_ptr->name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100131 return;
132 }
Per Liden4323add2006-01-18 00:38:21 +0100133 tipc_link_send_duplicate(active[0], l_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900134 if (l_ptr->priority == active[0]->priority) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100135 active[0] = l_ptr;
136 return;
137 }
Allan Stephensa10bd922006-06-25 23:52:17 -0700138 info("Old link <%s> becomes standby\n", active[0]->name);
139 if (active[1] != active[0])
140 info("Old link <%s> becomes standby\n", active[1]->name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100141 active[0] = active[1] = l_ptr;
142}
143
144/**
145 * node_select_active_links - select active link
146 */
147
David S. Miller6c000552008-09-02 23:38:32 -0700148static void node_select_active_links(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100149{
150 struct link **active = &n_ptr->active_links[0];
151 u32 i;
152 u32 highest_prio = 0;
153
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900154 active[0] = active[1] = NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100155
156 for (i = 0; i < MAX_BEARERS; i++) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900157 struct link *l_ptr = n_ptr->links[i];
Per Lidenb97bf3f2006-01-02 19:04:38 +0100158
Per Liden4323add2006-01-18 00:38:21 +0100159 if (!l_ptr || !tipc_link_is_up(l_ptr) ||
Per Lidenb97bf3f2006-01-02 19:04:38 +0100160 (l_ptr->priority < highest_prio))
161 continue;
162
163 if (l_ptr->priority > highest_prio) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900164 highest_prio = l_ptr->priority;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100165 active[0] = active[1] = l_ptr;
166 } else {
167 active[1] = l_ptr;
168 }
169 }
170}
171
172/**
Per Liden4323add2006-01-18 00:38:21 +0100173 * tipc_node_link_down - handle loss of link
Per Lidenb97bf3f2006-01-02 19:04:38 +0100174 */
175
David S. Miller6c000552008-09-02 23:38:32 -0700176void tipc_node_link_down(struct tipc_node *n_ptr, struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100177{
178 struct link **active;
179
Allan Stephens5392d642006-06-25 23:52:50 -0700180 n_ptr->working_links--;
181
Per Liden4323add2006-01-18 00:38:21 +0100182 if (!tipc_link_is_active(l_ptr)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100183 info("Lost standby link <%s> on network plane %c\n",
184 l_ptr->name, l_ptr->b_ptr->net_plane);
185 return;
186 }
187 info("Lost link <%s> on network plane %c\n",
188 l_ptr->name, l_ptr->b_ptr->net_plane);
189
190 active = &n_ptr->active_links[0];
191 if (active[0] == l_ptr)
192 active[0] = active[1];
193 if (active[1] == l_ptr)
194 active[1] = active[0];
195 if (active[0] == l_ptr)
196 node_select_active_links(n_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900197 if (tipc_node_is_up(n_ptr))
Per Liden4323add2006-01-18 00:38:21 +0100198 tipc_link_changeover(l_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900199 else
Per Lidenb97bf3f2006-01-02 19:04:38 +0100200 node_lost_contact(n_ptr);
201}
202
David S. Miller6c000552008-09-02 23:38:32 -0700203int tipc_node_has_active_links(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100204{
Allan Stephens76ae0d72010-08-17 11:00:12 +0000205 return n_ptr->active_links[0] != NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100206}
207
David S. Miller6c000552008-09-02 23:38:32 -0700208int tipc_node_has_redundant_links(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100209{
Eric Dumazeta02cec22010-09-22 20:43:57 +0000210 return n_ptr->working_links > 1;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100211}
212
David S. Miller6c000552008-09-02 23:38:32 -0700213int tipc_node_is_up(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100214{
Allan Stephens51a8e4d2010-12-31 18:59:18 +0000215 return tipc_node_has_active_links(n_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100216}
217
David S. Miller6c000552008-09-02 23:38:32 -0700218struct tipc_node *tipc_node_attach_link(struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100219{
David S. Miller6c000552008-09-02 23:38:32 -0700220 struct tipc_node *n_ptr = tipc_node_find(l_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100221
222 if (!n_ptr)
Per Liden4323add2006-01-18 00:38:21 +0100223 n_ptr = tipc_node_create(l_ptr->addr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900224 if (n_ptr) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100225 u32 bearer_id = l_ptr->b_ptr->identity;
226 char addr_string[16];
227
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900228 if (n_ptr->link_cnt >= 2) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900229 err("Attempt to create third link to %s\n",
Allan Stephensc68ca7b2010-05-11 14:30:12 +0000230 tipc_addr_string_fill(addr_string, n_ptr->addr));
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900231 return NULL;
232 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100233
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900234 if (!n_ptr->links[bearer_id]) {
235 n_ptr->links[bearer_id] = l_ptr;
Allan Stephens51f98a82010-12-31 18:59:16 +0000236 tipc_net.links++;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900237 n_ptr->link_cnt++;
238 return n_ptr;
239 }
Frans Popa570f092010-03-24 07:57:29 +0000240 err("Attempt to establish second link on <%s> to %s\n",
Allan Stephens2d627b92011-01-07 13:00:11 -0500241 l_ptr->b_ptr->name,
Allan Stephensc68ca7b2010-05-11 14:30:12 +0000242 tipc_addr_string_fill(addr_string, l_ptr->addr));
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900243 }
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800244 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100245}
246
David S. Miller6c000552008-09-02 23:38:32 -0700247void tipc_node_detach_link(struct tipc_node *n_ptr, struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100248{
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800249 n_ptr->links[l_ptr->b_ptr->identity] = NULL;
Allan Stephens51f98a82010-12-31 18:59:16 +0000250 tipc_net.links--;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100251 n_ptr->link_cnt--;
252}
253
254/*
255 * Routing table management - five cases to handle:
256 *
257 * 1: A link towards a zone/cluster external node comes up.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900258 * => Send a multicast message updating routing tables of all
259 * system nodes within own cluster that the new destination
260 * can be reached via this node.
Per Lidenb97bf3f2006-01-02 19:04:38 +0100261 * (node.establishedContact()=>cluster.multicastNewRoute())
262 *
263 * 2: A link towards a slave node comes up.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900264 * => Send a multicast message updating routing tables of all
265 * system nodes within own cluster that the new destination
266 * can be reached via this node.
Per Lidenb97bf3f2006-01-02 19:04:38 +0100267 * (node.establishedContact()=>cluster.multicastNewRoute())
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900268 * => Send a message to the slave node about existence
Per Lidenb97bf3f2006-01-02 19:04:38 +0100269 * of all system nodes within cluster:
270 * (node.establishedContact()=>cluster.sendLocalRoutes())
271 *
272 * 3: A new cluster local system node becomes available.
273 * => Send message(s) to this particular node containing
274 * information about all cluster external and slave
275 * nodes which can be reached via this node.
276 * (node.establishedContact()==>network.sendExternalRoutes())
277 * (node.establishedContact()==>network.sendSlaveRoutes())
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900278 * => Send messages to all directly connected slave nodes
Per Lidenb97bf3f2006-01-02 19:04:38 +0100279 * containing information about the existence of the new node
280 * (node.establishedContact()=>cluster.multicastNewRoute())
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900281 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100282 * 4: The link towards a zone/cluster external node or slave
283 * node goes down.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900284 * => Send a multcast message updating routing tables of all
Per Lidenb97bf3f2006-01-02 19:04:38 +0100285 * nodes within cluster that the new destination can not any
286 * longer be reached via this node.
287 * (node.lostAllLinks()=>cluster.bcastLostRoute())
288 *
289 * 5: A cluster local system node becomes unavailable.
290 * => Remove all references to this node from the local
291 * routing tables. Note: This is a completely node
292 * local operation.
293 * (node.lostAllLinks()=>network.removeAsRouter())
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900294 * => Send messages to all directly connected slave nodes
Per Lidenb97bf3f2006-01-02 19:04:38 +0100295 * containing information about loss of the node
296 * (node.establishedContact()=>cluster.multicastLostRoute())
297 *
298 */
299
David S. Miller6c000552008-09-02 23:38:32 -0700300static void node_established_contact(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100301{
Allan Stephens51a8e4d2010-12-31 18:59:18 +0000302 tipc_k_signal((Handler)tipc_named_node_up, n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100303
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900304 /* Syncronize broadcast acks */
305 n_ptr->bclink.acked = tipc_bclink_get_last_sent();
Per Lidenb97bf3f2006-01-02 19:04:38 +0100306
Per Lidenb97bf3f2006-01-02 19:04:38 +0100307 if (n_ptr->bclink.supported) {
Allan Stephens8f92df62010-12-31 18:59:19 +0000308 tipc_nmap_add(&tipc_bcast_nmap, n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100309 if (n_ptr->addr < tipc_own_addr)
310 tipc_own_tag++;
311 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100312}
313
Allan Stephens5a68d5e2010-08-17 11:00:16 +0000314static void node_cleanup_finished(unsigned long node_addr)
315{
316 struct tipc_node *n_ptr;
317
318 read_lock_bh(&tipc_net_lock);
319 n_ptr = tipc_node_find(node_addr);
320 if (n_ptr) {
321 tipc_node_lock(n_ptr);
322 n_ptr->cleanup_required = 0;
323 tipc_node_unlock(n_ptr);
324 }
325 read_unlock_bh(&tipc_net_lock);
326}
327
David S. Miller6c000552008-09-02 23:38:32 -0700328static void node_lost_contact(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100329{
David S. Miller6c000552008-09-02 23:38:32 -0700330 struct tipc_node_subscr *ns, *tns;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100331 char addr_string[16];
332 u32 i;
333
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900334 /* Clean up broadcast reception remains */
335 n_ptr->bclink.gap_after = n_ptr->bclink.gap_to = 0;
336 while (n_ptr->bclink.deferred_head) {
Allan Stephens0e659672010-12-31 18:59:32 +0000337 struct sk_buff *buf = n_ptr->bclink.deferred_head;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900338 n_ptr->bclink.deferred_head = buf->next;
339 buf_discard(buf);
340 }
341 if (n_ptr->bclink.defragm) {
342 buf_discard(n_ptr->bclink.defragm);
343 n_ptr->bclink.defragm = NULL;
344 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100345
Allan Stephens51a8e4d2010-12-31 18:59:18 +0000346 if (n_ptr->bclink.supported) {
Allan Stephens8f92df62010-12-31 18:59:19 +0000347 tipc_bclink_acknowledge(n_ptr,
348 mod(n_ptr->bclink.acked + 10000));
349 tipc_nmap_remove(&tipc_bcast_nmap, n_ptr->addr);
Allan Stephens51a8e4d2010-12-31 18:59:18 +0000350 if (n_ptr->addr < tipc_own_addr)
351 tipc_own_tag--;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100352 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100353
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900354 info("Lost contact with %s\n",
Allan Stephensc68ca7b2010-05-11 14:30:12 +0000355 tipc_addr_string_fill(addr_string, n_ptr->addr));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100356
357 /* Abort link changeover */
358 for (i = 0; i < MAX_BEARERS; i++) {
359 struct link *l_ptr = n_ptr->links[i];
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900360 if (!l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100361 continue;
362 l_ptr->reset_checkpoint = l_ptr->next_in_no;
363 l_ptr->exp_msg_count = 0;
Per Liden4323add2006-01-18 00:38:21 +0100364 tipc_link_reset_fragments(l_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100365 }
366
367 /* Notify subscribers */
368 list_for_each_entry_safe(ns, tns, &n_ptr->nsub, nodesub_list) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900369 ns->node = NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100370 list_del_init(&ns->nodesub_list);
Per Liden4323add2006-01-18 00:38:21 +0100371 tipc_k_signal((Handler)ns->handle_node_down,
372 (unsigned long)ns->usr_handle);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100373 }
Allan Stephens5a68d5e2010-08-17 11:00:16 +0000374
375 /* Prevent re-contact with node until all cleanup is done */
376
377 n_ptr->cleanup_required = 1;
378 tipc_k_signal((Handler)node_cleanup_finished, n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100379}
380
Per Liden4323add2006-01-18 00:38:21 +0100381struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100382{
383 u32 domain;
384 struct sk_buff *buf;
David S. Miller6c000552008-09-02 23:38:32 -0700385 struct tipc_node *n_ptr;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900386 struct tipc_node_info node_info;
Allan Stephensea138472006-06-29 12:33:20 -0700387 u32 payload_size;
Allan Stephens5af54792010-12-31 18:59:23 +0000388 u32 n_num;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100389
390 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR))
Per Liden4323add2006-01-18 00:38:21 +0100391 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100392
Al Viro3e6c8cd2006-11-08 00:19:09 -0800393 domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
Per Liden4323add2006-01-18 00:38:21 +0100394 if (!tipc_addr_domain_valid(domain))
395 return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
396 " (network address)");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100397
Allan Stephens1aad72d2008-07-14 22:44:58 -0700398 read_lock_bh(&tipc_net_lock);
Allan Stephens5af54792010-12-31 18:59:23 +0000399 if (!tipc_net.nodes) {
Allan Stephens1aad72d2008-07-14 22:44:58 -0700400 read_unlock_bh(&tipc_net_lock);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900401 return tipc_cfg_reply_none();
Allan Stephens1aad72d2008-07-14 22:44:58 -0700402 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100403
Allan Stephens08c80e92010-12-31 18:59:17 +0000404 /* For now, get space for all other nodes */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100405
Allan Stephens5af54792010-12-31 18:59:23 +0000406 payload_size = TLV_SPACE(sizeof(node_info)) *
407 (tipc_net.highest_node - 1);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700408 if (payload_size > 32768u) {
409 read_unlock_bh(&tipc_net_lock);
Allan Stephensea138472006-06-29 12:33:20 -0700410 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
411 " (too many nodes)");
Allan Stephens1aad72d2008-07-14 22:44:58 -0700412 }
Allan Stephensea138472006-06-29 12:33:20 -0700413 buf = tipc_cfg_reply_alloc(payload_size);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700414 if (!buf) {
415 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100416 return NULL;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700417 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100418
419 /* Add TLVs for all nodes in scope */
420
Allan Stephens5af54792010-12-31 18:59:23 +0000421 for (n_num = 1; n_num <= tipc_net.highest_node; n_num++) {
422 n_ptr = tipc_net.nodes[n_num];
423 if (!n_ptr || !tipc_in_scope(domain, n_ptr->addr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100424 continue;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900425 node_info.addr = htonl(n_ptr->addr);
426 node_info.up = htonl(tipc_node_is_up(n_ptr));
427 tipc_cfg_append_tlv(buf, TIPC_TLV_NODE_INFO,
Per Liden4323add2006-01-18 00:38:21 +0100428 &node_info, sizeof(node_info));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100429 }
430
Allan Stephens1aad72d2008-07-14 22:44:58 -0700431 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100432 return buf;
433}
434
Per Liden4323add2006-01-18 00:38:21 +0100435struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100436{
437 u32 domain;
438 struct sk_buff *buf;
David S. Miller6c000552008-09-02 23:38:32 -0700439 struct tipc_node *n_ptr;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900440 struct tipc_link_info link_info;
Allan Stephensea138472006-06-29 12:33:20 -0700441 u32 payload_size;
Allan Stephens5af54792010-12-31 18:59:23 +0000442 u32 n_num;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100443
444 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR))
Per Liden4323add2006-01-18 00:38:21 +0100445 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100446
Al Viro3e6c8cd2006-11-08 00:19:09 -0800447 domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
Per Liden4323add2006-01-18 00:38:21 +0100448 if (!tipc_addr_domain_valid(domain))
449 return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
450 " (network address)");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100451
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900452 if (tipc_mode != TIPC_NET_MODE)
453 return tipc_cfg_reply_none();
454
Allan Stephens1aad72d2008-07-14 22:44:58 -0700455 read_lock_bh(&tipc_net_lock);
456
Allan Stephensea138472006-06-29 12:33:20 -0700457 /* Get space for all unicast links + multicast link */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100458
Allan Stephens51f98a82010-12-31 18:59:16 +0000459 payload_size = TLV_SPACE(sizeof(link_info)) * (tipc_net.links + 1);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700460 if (payload_size > 32768u) {
461 read_unlock_bh(&tipc_net_lock);
Allan Stephensea138472006-06-29 12:33:20 -0700462 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
463 " (too many links)");
Allan Stephens1aad72d2008-07-14 22:44:58 -0700464 }
Allan Stephensea138472006-06-29 12:33:20 -0700465 buf = tipc_cfg_reply_alloc(payload_size);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700466 if (!buf) {
467 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100468 return NULL;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700469 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100470
471 /* Add TLV for broadcast link */
472
Allan Stephensa3796f82011-02-23 11:44:49 -0500473 link_info.dest = htonl(tipc_cluster_mask(tipc_own_addr));
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900474 link_info.up = htonl(1);
Stephen Hemminger4b704d52009-03-18 19:11:29 -0700475 strlcpy(link_info.str, tipc_bclink_name, TIPC_MAX_LINK_NAME);
Per Liden4323add2006-01-18 00:38:21 +0100476 tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, &link_info, sizeof(link_info));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100477
478 /* Add TLVs for any other links in scope */
479
Allan Stephens5af54792010-12-31 18:59:23 +0000480 for (n_num = 1; n_num <= tipc_net.highest_node; n_num++) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900481 u32 i;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100482
Allan Stephens5af54792010-12-31 18:59:23 +0000483 n_ptr = tipc_net.nodes[n_num];
484 if (!n_ptr || !tipc_in_scope(domain, n_ptr->addr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100485 continue;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700486 tipc_node_lock(n_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900487 for (i = 0; i < MAX_BEARERS; i++) {
488 if (!n_ptr->links[i])
489 continue;
490 link_info.dest = htonl(n_ptr->addr);
491 link_info.up = htonl(tipc_link_is_up(n_ptr->links[i]));
492 strcpy(link_info.str, n_ptr->links[i]->name);
493 tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO,
Per Liden4323add2006-01-18 00:38:21 +0100494 &link_info, sizeof(link_info));
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900495 }
Allan Stephens1aad72d2008-07-14 22:44:58 -0700496 tipc_node_unlock(n_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100497 }
498
Allan Stephens1aad72d2008-07-14 22:44:58 -0700499 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100500 return buf;
501}