blob: 2d106ef4fa4cca43970f0e2dc6bc925ccf12ea95 [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 Stephens672d99e2011-02-25 18:42:52 -050047static struct hlist_head node_htable[NODE_HTABLE_SIZE];
48LIST_HEAD(tipc_node_list);
49static u32 tipc_num_nodes;
Allan Stephens34e46252011-02-25 19:11:25 -050050
51static atomic_t tipc_num_links = ATOMIC_INIT(0);
Allan Stephense3ec9c72010-12-31 18:59:34 +000052u32 tipc_own_tag;
Per Lidenb97bf3f2006-01-02 19:04:38 +010053
Allan Stephens2ecb0922008-05-21 14:53:00 -070054/**
Allan Stephens672d99e2011-02-25 18:42:52 -050055 * tipc_node_find - locate specified node object, if it exists
56 */
57
58struct tipc_node *tipc_node_find(u32 addr)
59{
60 struct tipc_node *node;
61 struct hlist_node *pos;
62
63 if (unlikely(!in_own_cluster(addr)))
64 return NULL;
65
66 hlist_for_each_entry(node, pos, &node_htable[tipc_hashfn(addr)], hash) {
67 if (node->addr == addr)
68 return node;
69 }
70 return NULL;
71}
72
73/**
Allan Stephens2ecb0922008-05-21 14:53:00 -070074 * tipc_node_create - create neighboring node
75 *
76 * Currently, this routine is called by neighbor discovery code, which holds
77 * net_lock for reading only. We must take node_create_lock to ensure a node
78 * isn't created twice if two different bearers discover the node at the same
79 * time. (It would be preferable to switch to holding net_lock in write mode,
80 * but this is a non-trivial change.)
81 */
82
David S. Miller6c000552008-09-02 23:38:32 -070083struct tipc_node *tipc_node_create(u32 addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +010084{
Allan Stephens672d99e2011-02-25 18:42:52 -050085 struct tipc_node *n_ptr, *temp_node;
Per Lidenb97bf3f2006-01-02 19:04:38 +010086
Allan Stephens2ecb0922008-05-21 14:53:00 -070087 spin_lock_bh(&node_create_lock);
88
Allan Stephens5af54792010-12-31 18:59:23 +000089 n_ptr = tipc_node_find(addr);
90 if (n_ptr) {
91 spin_unlock_bh(&node_create_lock);
92 return n_ptr;
Allan Stephens2ecb0922008-05-21 14:53:00 -070093 }
94
Allan Stephens5af54792010-12-31 18:59:23 +000095 n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC);
Allan Stephensa10bd922006-06-25 23:52:17 -070096 if (!n_ptr) {
Allan Stephens2ecb0922008-05-21 14:53:00 -070097 spin_unlock_bh(&node_create_lock);
Allan Stephensa10bd922006-06-25 23:52:17 -070098 warn("Node creation failed, no memory\n");
99 return NULL;
100 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100101
Allan Stephensa10bd922006-06-25 23:52:17 -0700102 n_ptr->addr = addr;
Allan Stephens51a8e4d2010-12-31 18:59:18 +0000103 spin_lock_init(&n_ptr->lock);
Allan Stephens672d99e2011-02-25 18:42:52 -0500104 INIT_HLIST_NODE(&n_ptr->hash);
105 INIT_LIST_HEAD(&n_ptr->list);
Allan Stephensa10bd922006-06-25 23:52:17 -0700106 INIT_LIST_HEAD(&n_ptr->nsub);
Allan Stephens8f92df62010-12-31 18:59:19 +0000107
Allan Stephens672d99e2011-02-25 18:42:52 -0500108 hlist_add_head(&n_ptr->hash, &node_htable[tipc_hashfn(addr)]);
109
110 list_for_each_entry(temp_node, &tipc_node_list, list) {
111 if (n_ptr->addr < temp_node->addr)
112 break;
113 }
114 list_add_tail(&n_ptr->list, &temp_node->list);
115
116 tipc_num_nodes++;
Allan Stephensa10bd922006-06-25 23:52:17 -0700117
Allan Stephens2ecb0922008-05-21 14:53:00 -0700118 spin_unlock_bh(&node_create_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100119 return n_ptr;
120}
121
David S. Miller6c000552008-09-02 23:38:32 -0700122void tipc_node_delete(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100123{
Allan Stephens672d99e2011-02-25 18:42:52 -0500124 list_del(&n_ptr->list);
125 hlist_del(&n_ptr->hash);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100126 kfree(n_ptr);
Allan Stephens8f92df62010-12-31 18:59:19 +0000127
Allan Stephens672d99e2011-02-25 18:42:52 -0500128 tipc_num_nodes--;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100129}
130
131
132/**
Per Liden4323add2006-01-18 00:38:21 +0100133 * tipc_node_link_up - handle addition of link
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900134 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100135 * Link becomes active (alone or shared) or standby, depending on its priority.
136 */
137
David S. Miller6c000552008-09-02 23:38:32 -0700138void tipc_node_link_up(struct tipc_node *n_ptr, struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100139{
140 struct link **active = &n_ptr->active_links[0];
141
Allan Stephens5392d642006-06-25 23:52:50 -0700142 n_ptr->working_links++;
143
Per Lidenb97bf3f2006-01-02 19:04:38 +0100144 info("Established link <%s> on network plane %c\n",
145 l_ptr->name, l_ptr->b_ptr->net_plane);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900146
Per Lidenb97bf3f2006-01-02 19:04:38 +0100147 if (!active[0]) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100148 active[0] = active[1] = l_ptr;
149 node_established_contact(n_ptr);
150 return;
151 }
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900152 if (l_ptr->priority < active[0]->priority) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700153 info("New link <%s> becomes standby\n", l_ptr->name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100154 return;
155 }
Per Liden4323add2006-01-18 00:38:21 +0100156 tipc_link_send_duplicate(active[0], l_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900157 if (l_ptr->priority == active[0]->priority) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100158 active[0] = l_ptr;
159 return;
160 }
Allan Stephensa10bd922006-06-25 23:52:17 -0700161 info("Old link <%s> becomes standby\n", active[0]->name);
162 if (active[1] != active[0])
163 info("Old link <%s> becomes standby\n", active[1]->name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100164 active[0] = active[1] = l_ptr;
165}
166
167/**
168 * node_select_active_links - select active link
169 */
170
David S. Miller6c000552008-09-02 23:38:32 -0700171static void node_select_active_links(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100172{
173 struct link **active = &n_ptr->active_links[0];
174 u32 i;
175 u32 highest_prio = 0;
176
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900177 active[0] = active[1] = NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100178
179 for (i = 0; i < MAX_BEARERS; i++) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900180 struct link *l_ptr = n_ptr->links[i];
Per Lidenb97bf3f2006-01-02 19:04:38 +0100181
Per Liden4323add2006-01-18 00:38:21 +0100182 if (!l_ptr || !tipc_link_is_up(l_ptr) ||
Per Lidenb97bf3f2006-01-02 19:04:38 +0100183 (l_ptr->priority < highest_prio))
184 continue;
185
186 if (l_ptr->priority > highest_prio) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900187 highest_prio = l_ptr->priority;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100188 active[0] = active[1] = l_ptr;
189 } else {
190 active[1] = l_ptr;
191 }
192 }
193}
194
195/**
Per Liden4323add2006-01-18 00:38:21 +0100196 * tipc_node_link_down - handle loss of link
Per Lidenb97bf3f2006-01-02 19:04:38 +0100197 */
198
David S. Miller6c000552008-09-02 23:38:32 -0700199void tipc_node_link_down(struct tipc_node *n_ptr, struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100200{
201 struct link **active;
202
Allan Stephens5392d642006-06-25 23:52:50 -0700203 n_ptr->working_links--;
204
Per Liden4323add2006-01-18 00:38:21 +0100205 if (!tipc_link_is_active(l_ptr)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100206 info("Lost standby link <%s> on network plane %c\n",
207 l_ptr->name, l_ptr->b_ptr->net_plane);
208 return;
209 }
210 info("Lost link <%s> on network plane %c\n",
211 l_ptr->name, l_ptr->b_ptr->net_plane);
212
213 active = &n_ptr->active_links[0];
214 if (active[0] == l_ptr)
215 active[0] = active[1];
216 if (active[1] == l_ptr)
217 active[1] = active[0];
218 if (active[0] == l_ptr)
219 node_select_active_links(n_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900220 if (tipc_node_is_up(n_ptr))
Per Liden4323add2006-01-18 00:38:21 +0100221 tipc_link_changeover(l_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900222 else
Per Lidenb97bf3f2006-01-02 19:04:38 +0100223 node_lost_contact(n_ptr);
224}
225
Paul Gortmaker8f19afb2011-02-28 11:36:21 -0400226int tipc_node_active_links(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100227{
Allan Stephens76ae0d72010-08-17 11:00:12 +0000228 return n_ptr->active_links[0] != NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100229}
230
Paul Gortmaker8f19afb2011-02-28 11:36:21 -0400231int tipc_node_redundant_links(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100232{
Eric Dumazeta02cec22010-09-22 20:43:57 +0000233 return n_ptr->working_links > 1;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100234}
235
David S. Miller6c000552008-09-02 23:38:32 -0700236int tipc_node_is_up(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100237{
Paul Gortmaker8f19afb2011-02-28 11:36:21 -0400238 return tipc_node_active_links(n_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100239}
240
Allan Stephens37b9c082011-02-28 11:32:27 -0500241void tipc_node_attach_link(struct tipc_node *n_ptr, struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100242{
Allan Stephens37b9c082011-02-28 11:32:27 -0500243 n_ptr->links[l_ptr->b_ptr->identity] = l_ptr;
244 atomic_inc(&tipc_num_links);
245 n_ptr->link_cnt++;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100246}
247
David S. Miller6c000552008-09-02 23:38:32 -0700248void tipc_node_detach_link(struct tipc_node *n_ptr, struct link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100249{
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800250 n_ptr->links[l_ptr->b_ptr->identity] = NULL;
Allan Stephensd1bcb112011-02-25 10:01:58 -0500251 atomic_dec(&tipc_num_links);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100252 n_ptr->link_cnt--;
253}
254
255/*
256 * Routing table management - five cases to handle:
257 *
258 * 1: A link towards a zone/cluster external node comes up.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900259 * => Send a multicast message updating routing tables of all
260 * system nodes within own cluster that the new destination
261 * can be reached via this node.
Per Lidenb97bf3f2006-01-02 19:04:38 +0100262 * (node.establishedContact()=>cluster.multicastNewRoute())
263 *
264 * 2: A link towards a slave node comes up.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900265 * => Send a multicast message updating routing tables of all
266 * system nodes within own cluster that the new destination
267 * can be reached via this node.
Per Lidenb97bf3f2006-01-02 19:04:38 +0100268 * (node.establishedContact()=>cluster.multicastNewRoute())
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900269 * => Send a message to the slave node about existence
Per Lidenb97bf3f2006-01-02 19:04:38 +0100270 * of all system nodes within cluster:
271 * (node.establishedContact()=>cluster.sendLocalRoutes())
272 *
273 * 3: A new cluster local system node becomes available.
274 * => Send message(s) to this particular node containing
275 * information about all cluster external and slave
276 * nodes which can be reached via this node.
277 * (node.establishedContact()==>network.sendExternalRoutes())
278 * (node.establishedContact()==>network.sendSlaveRoutes())
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900279 * => Send messages to all directly connected slave nodes
Per Lidenb97bf3f2006-01-02 19:04:38 +0100280 * containing information about the existence of the new node
281 * (node.establishedContact()=>cluster.multicastNewRoute())
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900282 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100283 * 4: The link towards a zone/cluster external node or slave
284 * node goes down.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900285 * => Send a multcast message updating routing tables of all
Per Lidenb97bf3f2006-01-02 19:04:38 +0100286 * nodes within cluster that the new destination can not any
287 * longer be reached via this node.
288 * (node.lostAllLinks()=>cluster.bcastLostRoute())
289 *
290 * 5: A cluster local system node becomes unavailable.
291 * => Remove all references to this node from the local
292 * routing tables. Note: This is a completely node
293 * local operation.
294 * (node.lostAllLinks()=>network.removeAsRouter())
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900295 * => Send messages to all directly connected slave nodes
Per Lidenb97bf3f2006-01-02 19:04:38 +0100296 * containing information about loss of the node
297 * (node.establishedContact()=>cluster.multicastLostRoute())
298 *
299 */
300
David S. Miller6c000552008-09-02 23:38:32 -0700301static void node_established_contact(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100302{
Allan Stephens51a8e4d2010-12-31 18:59:18 +0000303 tipc_k_signal((Handler)tipc_named_node_up, n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100304
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900305 /* Syncronize broadcast acks */
306 n_ptr->bclink.acked = tipc_bclink_get_last_sent();
Per Lidenb97bf3f2006-01-02 19:04:38 +0100307
Per Lidenb97bf3f2006-01-02 19:04:38 +0100308 if (n_ptr->bclink.supported) {
Allan Stephens8f92df62010-12-31 18:59:19 +0000309 tipc_nmap_add(&tipc_bcast_nmap, n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100310 if (n_ptr->addr < tipc_own_addr)
311 tipc_own_tag++;
312 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100313}
314
Allan Stephens5a68d5ee2010-08-17 11:00:16 +0000315static void node_cleanup_finished(unsigned long node_addr)
316{
317 struct tipc_node *n_ptr;
318
319 read_lock_bh(&tipc_net_lock);
320 n_ptr = tipc_node_find(node_addr);
321 if (n_ptr) {
322 tipc_node_lock(n_ptr);
323 n_ptr->cleanup_required = 0;
324 tipc_node_unlock(n_ptr);
325 }
326 read_unlock_bh(&tipc_net_lock);
327}
328
David S. Miller6c000552008-09-02 23:38:32 -0700329static void node_lost_contact(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100330{
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 */
Allan Stephensf1379172011-02-23 14:13:41 -0500368 tipc_nodesub_notify(n_ptr);
Allan Stephens5a68d5ee2010-08-17 11:00:16 +0000369
370 /* Prevent re-contact with node until all cleanup is done */
371
372 n_ptr->cleanup_required = 1;
373 tipc_k_signal((Handler)node_cleanup_finished, n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100374}
375
Per Liden4323add2006-01-18 00:38:21 +0100376struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100377{
378 u32 domain;
379 struct sk_buff *buf;
David S. Miller6c000552008-09-02 23:38:32 -0700380 struct tipc_node *n_ptr;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900381 struct tipc_node_info node_info;
Allan Stephensea138472006-06-29 12:33:20 -0700382 u32 payload_size;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100383
384 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR))
Per Liden4323add2006-01-18 00:38:21 +0100385 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100386
Al Viro3e6c8cd2006-11-08 00:19:09 -0800387 domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
Per Liden4323add2006-01-18 00:38:21 +0100388 if (!tipc_addr_domain_valid(domain))
389 return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
390 " (network address)");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100391
Allan Stephens1aad72d2008-07-14 22:44:58 -0700392 read_lock_bh(&tipc_net_lock);
Allan Stephens672d99e2011-02-25 18:42:52 -0500393 if (!tipc_num_nodes) {
Allan Stephens1aad72d2008-07-14 22:44:58 -0700394 read_unlock_bh(&tipc_net_lock);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900395 return tipc_cfg_reply_none();
Allan Stephens1aad72d2008-07-14 22:44:58 -0700396 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100397
Allan Stephens08c80e92010-12-31 18:59:17 +0000398 /* For now, get space for all other nodes */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100399
Allan Stephens672d99e2011-02-25 18:42:52 -0500400 payload_size = TLV_SPACE(sizeof(node_info)) * tipc_num_nodes;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700401 if (payload_size > 32768u) {
402 read_unlock_bh(&tipc_net_lock);
Allan Stephensea138472006-06-29 12:33:20 -0700403 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
404 " (too many nodes)");
Allan Stephens1aad72d2008-07-14 22:44:58 -0700405 }
Allan Stephensea138472006-06-29 12:33:20 -0700406 buf = tipc_cfg_reply_alloc(payload_size);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700407 if (!buf) {
408 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100409 return NULL;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700410 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100411
412 /* Add TLVs for all nodes in scope */
413
Allan Stephens672d99e2011-02-25 18:42:52 -0500414 list_for_each_entry(n_ptr, &tipc_node_list, list) {
415 if (!tipc_in_scope(domain, n_ptr->addr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100416 continue;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900417 node_info.addr = htonl(n_ptr->addr);
418 node_info.up = htonl(tipc_node_is_up(n_ptr));
419 tipc_cfg_append_tlv(buf, TIPC_TLV_NODE_INFO,
Per Liden4323add2006-01-18 00:38:21 +0100420 &node_info, sizeof(node_info));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100421 }
422
Allan Stephens1aad72d2008-07-14 22:44:58 -0700423 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100424 return buf;
425}
426
Per Liden4323add2006-01-18 00:38:21 +0100427struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100428{
429 u32 domain;
430 struct sk_buff *buf;
David S. Miller6c000552008-09-02 23:38:32 -0700431 struct tipc_node *n_ptr;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900432 struct tipc_link_info link_info;
Allan Stephensea138472006-06-29 12:33:20 -0700433 u32 payload_size;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100434
435 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR))
Per Liden4323add2006-01-18 00:38:21 +0100436 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100437
Al Viro3e6c8cd2006-11-08 00:19:09 -0800438 domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
Per Liden4323add2006-01-18 00:38:21 +0100439 if (!tipc_addr_domain_valid(domain))
440 return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
441 " (network address)");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100442
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900443 if (tipc_mode != TIPC_NET_MODE)
444 return tipc_cfg_reply_none();
445
Allan Stephens1aad72d2008-07-14 22:44:58 -0700446 read_lock_bh(&tipc_net_lock);
447
Allan Stephensea138472006-06-29 12:33:20 -0700448 /* Get space for all unicast links + multicast link */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100449
Allan Stephens9df3b7e2011-02-24 13:20:20 -0500450 payload_size = TLV_SPACE(sizeof(link_info)) *
Allan Stephensd1bcb112011-02-25 10:01:58 -0500451 (atomic_read(&tipc_num_links) + 1);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700452 if (payload_size > 32768u) {
453 read_unlock_bh(&tipc_net_lock);
Allan Stephensea138472006-06-29 12:33:20 -0700454 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
455 " (too many links)");
Allan Stephens1aad72d2008-07-14 22:44:58 -0700456 }
Allan Stephensea138472006-06-29 12:33:20 -0700457 buf = tipc_cfg_reply_alloc(payload_size);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700458 if (!buf) {
459 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100460 return NULL;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700461 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100462
463 /* Add TLV for broadcast link */
464
Allan Stephensa3796f82011-02-23 11:44:49 -0500465 link_info.dest = htonl(tipc_cluster_mask(tipc_own_addr));
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900466 link_info.up = htonl(1);
Stephen Hemminger4b704d52009-03-18 19:11:29 -0700467 strlcpy(link_info.str, tipc_bclink_name, TIPC_MAX_LINK_NAME);
Per Liden4323add2006-01-18 00:38:21 +0100468 tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, &link_info, sizeof(link_info));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100469
470 /* Add TLVs for any other links in scope */
471
Allan Stephens672d99e2011-02-25 18:42:52 -0500472 list_for_each_entry(n_ptr, &tipc_node_list, list) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900473 u32 i;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100474
Allan Stephens672d99e2011-02-25 18:42:52 -0500475 if (!tipc_in_scope(domain, n_ptr->addr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100476 continue;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700477 tipc_node_lock(n_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900478 for (i = 0; i < MAX_BEARERS; i++) {
479 if (!n_ptr->links[i])
480 continue;
481 link_info.dest = htonl(n_ptr->addr);
482 link_info.up = htonl(tipc_link_is_up(n_ptr->links[i]));
483 strcpy(link_info.str, n_ptr->links[i]->name);
484 tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO,
Per Liden4323add2006-01-18 00:38:21 +0100485 &link_info, sizeof(link_info));
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900486 }
Allan Stephens1aad72d2008-07-14 22:44:58 -0700487 tipc_node_unlock(n_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100488 }
489
Allan Stephens1aad72d2008-07-14 22:44:58 -0700490 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100491 return buf;
492}