blob: a34cabc2c43a48d3ef2250f57bda634a0fc4db9c [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
Allan Stephensa635b462011-11-04 11:54:43 -040042#define NODE_HTABLE_SIZE 512
43
David S. Miller6c000552008-09-02 23:38:32 -070044static void node_lost_contact(struct tipc_node *n_ptr);
45static void node_established_contact(struct tipc_node *n_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +010046
Allan Stephens2ecb0922008-05-21 14:53:00 -070047static DEFINE_SPINLOCK(node_create_lock);
48
Allan Stephens672d99e2011-02-25 18:42:52 -050049static struct hlist_head node_htable[NODE_HTABLE_SIZE];
50LIST_HEAD(tipc_node_list);
51static u32 tipc_num_nodes;
Allan Stephens34e46252011-02-25 19:11:25 -050052
53static atomic_t tipc_num_links = ATOMIC_INIT(0);
Per Lidenb97bf3f2006-01-02 19:04:38 +010054
Allan Stephens1ec2bb02011-10-27 15:03:24 -040055/*
Allan Stephensa635b462011-11-04 11:54:43 -040056 * A trivial power-of-two bitmask technique is used for speed, since this
57 * operation is done for every incoming TIPC packet. The number of hash table
58 * entries has been chosen so that no hash chain exceeds 8 nodes and will
59 * usually be much smaller (typically only a single node).
60 */
61static inline unsigned int tipc_hashfn(u32 addr)
62{
63 return addr & (NODE_HTABLE_SIZE - 1);
64}
65
66/*
Allan Stephens672d99e2011-02-25 18:42:52 -050067 * tipc_node_find - locate specified node object, if it exists
68 */
69
70struct tipc_node *tipc_node_find(u32 addr)
71{
72 struct tipc_node *node;
73 struct hlist_node *pos;
74
75 if (unlikely(!in_own_cluster(addr)))
76 return NULL;
77
78 hlist_for_each_entry(node, pos, &node_htable[tipc_hashfn(addr)], hash) {
79 if (node->addr == addr)
80 return node;
81 }
82 return NULL;
83}
84
85/**
Allan Stephens2ecb0922008-05-21 14:53:00 -070086 * tipc_node_create - create neighboring node
87 *
88 * Currently, this routine is called by neighbor discovery code, which holds
89 * net_lock for reading only. We must take node_create_lock to ensure a node
90 * isn't created twice if two different bearers discover the node at the same
91 * time. (It would be preferable to switch to holding net_lock in write mode,
92 * but this is a non-trivial change.)
93 */
94
David S. Miller6c000552008-09-02 23:38:32 -070095struct tipc_node *tipc_node_create(u32 addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +010096{
Allan Stephens672d99e2011-02-25 18:42:52 -050097 struct tipc_node *n_ptr, *temp_node;
Per Lidenb97bf3f2006-01-02 19:04:38 +010098
Allan Stephens2ecb0922008-05-21 14:53:00 -070099 spin_lock_bh(&node_create_lock);
100
Allan Stephens5af54792010-12-31 18:59:23 +0000101 n_ptr = tipc_node_find(addr);
102 if (n_ptr) {
103 spin_unlock_bh(&node_create_lock);
104 return n_ptr;
Allan Stephens2ecb0922008-05-21 14:53:00 -0700105 }
106
Allan Stephens5af54792010-12-31 18:59:23 +0000107 n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC);
Allan Stephensa10bd922006-06-25 23:52:17 -0700108 if (!n_ptr) {
Allan Stephens2ecb0922008-05-21 14:53:00 -0700109 spin_unlock_bh(&node_create_lock);
Allan Stephensa10bd922006-06-25 23:52:17 -0700110 warn("Node creation failed, no memory\n");
111 return NULL;
112 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100113
Allan Stephensa10bd922006-06-25 23:52:17 -0700114 n_ptr->addr = addr;
Allan Stephens51a8e4d2010-12-31 18:59:18 +0000115 spin_lock_init(&n_ptr->lock);
Allan Stephens672d99e2011-02-25 18:42:52 -0500116 INIT_HLIST_NODE(&n_ptr->hash);
117 INIT_LIST_HEAD(&n_ptr->list);
Allan Stephensa10bd922006-06-25 23:52:17 -0700118 INIT_LIST_HEAD(&n_ptr->nsub);
Allan Stephens8f92df62010-12-31 18:59:19 +0000119
Allan Stephens672d99e2011-02-25 18:42:52 -0500120 hlist_add_head(&n_ptr->hash, &node_htable[tipc_hashfn(addr)]);
121
122 list_for_each_entry(temp_node, &tipc_node_list, list) {
123 if (n_ptr->addr < temp_node->addr)
124 break;
125 }
126 list_add_tail(&n_ptr->list, &temp_node->list);
Allan Stephensb4b56102011-05-27 11:00:51 -0400127 n_ptr->block_setup = WAIT_PEER_DOWN;
Allan Stephensfc0eea62011-10-28 16:26:41 -0400128 n_ptr->signature = INVALID_NODE_SIG;
Allan Stephens672d99e2011-02-25 18:42:52 -0500129
130 tipc_num_nodes++;
Allan Stephensa10bd922006-06-25 23:52:17 -0700131
Allan Stephens2ecb0922008-05-21 14:53:00 -0700132 spin_unlock_bh(&node_create_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100133 return n_ptr;
134}
135
David S. Miller6c000552008-09-02 23:38:32 -0700136void tipc_node_delete(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100137{
Allan Stephens672d99e2011-02-25 18:42:52 -0500138 list_del(&n_ptr->list);
139 hlist_del(&n_ptr->hash);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100140 kfree(n_ptr);
Allan Stephens8f92df62010-12-31 18:59:19 +0000141
Allan Stephens672d99e2011-02-25 18:42:52 -0500142 tipc_num_nodes--;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100143}
144
145
146/**
Per Liden4323add2006-01-18 00:38:21 +0100147 * tipc_node_link_up - handle addition of link
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900148 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100149 * Link becomes active (alone or shared) or standby, depending on its priority.
150 */
151
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500152void tipc_node_link_up(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100153{
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500154 struct tipc_link **active = &n_ptr->active_links[0];
Per Lidenb97bf3f2006-01-02 19:04:38 +0100155
Allan Stephens5392d642006-06-25 23:52:50 -0700156 n_ptr->working_links++;
157
Per Lidenb97bf3f2006-01-02 19:04:38 +0100158 info("Established link <%s> on network plane %c\n",
159 l_ptr->name, l_ptr->b_ptr->net_plane);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900160
Per Lidenb97bf3f2006-01-02 19:04:38 +0100161 if (!active[0]) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100162 active[0] = active[1] = l_ptr;
163 node_established_contact(n_ptr);
164 return;
165 }
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900166 if (l_ptr->priority < active[0]->priority) {
Allan Stephensa10bd922006-06-25 23:52:17 -0700167 info("New link <%s> becomes standby\n", l_ptr->name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100168 return;
169 }
Per Liden4323add2006-01-18 00:38:21 +0100170 tipc_link_send_duplicate(active[0], l_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900171 if (l_ptr->priority == active[0]->priority) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100172 active[0] = l_ptr;
173 return;
174 }
Allan Stephensa10bd922006-06-25 23:52:17 -0700175 info("Old link <%s> becomes standby\n", active[0]->name);
176 if (active[1] != active[0])
177 info("Old link <%s> becomes standby\n", active[1]->name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100178 active[0] = active[1] = l_ptr;
179}
180
181/**
182 * node_select_active_links - select active link
183 */
184
David S. Miller6c000552008-09-02 23:38:32 -0700185static void node_select_active_links(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100186{
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500187 struct tipc_link **active = &n_ptr->active_links[0];
Per Lidenb97bf3f2006-01-02 19:04:38 +0100188 u32 i;
189 u32 highest_prio = 0;
190
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900191 active[0] = active[1] = NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100192
193 for (i = 0; i < MAX_BEARERS; i++) {
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500194 struct tipc_link *l_ptr = n_ptr->links[i];
Per Lidenb97bf3f2006-01-02 19:04:38 +0100195
Per Liden4323add2006-01-18 00:38:21 +0100196 if (!l_ptr || !tipc_link_is_up(l_ptr) ||
Per Lidenb97bf3f2006-01-02 19:04:38 +0100197 (l_ptr->priority < highest_prio))
198 continue;
199
200 if (l_ptr->priority > highest_prio) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900201 highest_prio = l_ptr->priority;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100202 active[0] = active[1] = l_ptr;
203 } else {
204 active[1] = l_ptr;
205 }
206 }
207}
208
209/**
Per Liden4323add2006-01-18 00:38:21 +0100210 * tipc_node_link_down - handle loss of link
Per Lidenb97bf3f2006-01-02 19:04:38 +0100211 */
212
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500213void tipc_node_link_down(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100214{
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500215 struct tipc_link **active;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100216
Allan Stephens5392d642006-06-25 23:52:50 -0700217 n_ptr->working_links--;
218
Per Liden4323add2006-01-18 00:38:21 +0100219 if (!tipc_link_is_active(l_ptr)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100220 info("Lost standby link <%s> on network plane %c\n",
221 l_ptr->name, l_ptr->b_ptr->net_plane);
222 return;
223 }
224 info("Lost link <%s> on network plane %c\n",
225 l_ptr->name, l_ptr->b_ptr->net_plane);
226
227 active = &n_ptr->active_links[0];
228 if (active[0] == l_ptr)
229 active[0] = active[1];
230 if (active[1] == l_ptr)
231 active[1] = active[0];
232 if (active[0] == l_ptr)
233 node_select_active_links(n_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900234 if (tipc_node_is_up(n_ptr))
Per Liden4323add2006-01-18 00:38:21 +0100235 tipc_link_changeover(l_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900236 else
Per Lidenb97bf3f2006-01-02 19:04:38 +0100237 node_lost_contact(n_ptr);
238}
239
Paul Gortmaker8f19afb2011-02-28 11:36:21 -0400240int tipc_node_active_links(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100241{
Allan Stephens76ae0d72010-08-17 11:00:12 +0000242 return n_ptr->active_links[0] != NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100243}
244
Paul Gortmaker8f19afb2011-02-28 11:36:21 -0400245int tipc_node_redundant_links(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100246{
Eric Dumazeta02cec22010-09-22 20:43:57 +0000247 return n_ptr->working_links > 1;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100248}
249
David S. Miller6c000552008-09-02 23:38:32 -0700250int tipc_node_is_up(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100251{
Paul Gortmaker8f19afb2011-02-28 11:36:21 -0400252 return tipc_node_active_links(n_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100253}
254
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500255void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100256{
Allan Stephens37b9c082011-02-28 11:32:27 -0500257 n_ptr->links[l_ptr->b_ptr->identity] = l_ptr;
258 atomic_inc(&tipc_num_links);
259 n_ptr->link_cnt++;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100260}
261
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500262void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100263{
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800264 n_ptr->links[l_ptr->b_ptr->identity] = NULL;
Allan Stephensd1bcb112011-02-25 10:01:58 -0500265 atomic_dec(&tipc_num_links);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100266 n_ptr->link_cnt--;
267}
268
David S. Miller6c000552008-09-02 23:38:32 -0700269static void node_established_contact(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100270{
Allan Stephens51a8e4d2010-12-31 18:59:18 +0000271 tipc_k_signal((Handler)tipc_named_node_up, n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100272
Allan Stephens93499312011-10-25 15:14:46 -0400273 if (n_ptr->bclink.supportable) {
Allan Stephens75aba9a2011-11-04 15:00:02 -0400274 n_ptr->bclink.acked = tipc_bclink_get_last_sent();
Allan Stephenscd3decd2011-10-24 11:18:12 -0400275 tipc_bclink_add_node(n_ptr->addr);
Allan Stephens93499312011-10-25 15:14:46 -0400276 n_ptr->bclink.supported = 1;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100277 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100278}
279
Allan Stephensb4b56102011-05-27 11:00:51 -0400280static void node_name_purge_complete(unsigned long node_addr)
Allan Stephens5a68d5ee2010-08-17 11:00:16 +0000281{
282 struct tipc_node *n_ptr;
283
284 read_lock_bh(&tipc_net_lock);
285 n_ptr = tipc_node_find(node_addr);
286 if (n_ptr) {
287 tipc_node_lock(n_ptr);
Allan Stephensb4b56102011-05-27 11:00:51 -0400288 n_ptr->block_setup &= ~WAIT_NAMES_GONE;
Allan Stephens5a68d5ee2010-08-17 11:00:16 +0000289 tipc_node_unlock(n_ptr);
290 }
291 read_unlock_bh(&tipc_net_lock);
292}
293
David S. Miller6c000552008-09-02 23:38:32 -0700294static void node_lost_contact(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100295{
Per Lidenb97bf3f2006-01-02 19:04:38 +0100296 char addr_string[16];
297 u32 i;
298
Allan Stephensc5bd4d82011-04-07 11:58:08 -0400299 info("Lost contact with %s\n",
300 tipc_addr_string_fill(addr_string, n_ptr->addr));
301
302 /* Flush broadcast link info associated with lost node */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100303
Allan Stephens51a8e4d2010-12-31 18:59:18 +0000304 if (n_ptr->bclink.supported) {
Allan Stephensc5bd4d82011-04-07 11:58:08 -0400305 while (n_ptr->bclink.deferred_head) {
306 struct sk_buff *buf = n_ptr->bclink.deferred_head;
307 n_ptr->bclink.deferred_head = buf->next;
Allan Stephens5f6d9122011-11-04 13:24:29 -0400308 kfree_skb(buf);
Allan Stephensc5bd4d82011-04-07 11:58:08 -0400309 }
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400310 n_ptr->bclink.deferred_size = 0;
Allan Stephensc5bd4d82011-04-07 11:58:08 -0400311
312 if (n_ptr->bclink.defragm) {
Allan Stephens5f6d9122011-11-04 13:24:29 -0400313 kfree_skb(n_ptr->bclink.defragm);
Allan Stephensc5bd4d82011-04-07 11:58:08 -0400314 n_ptr->bclink.defragm = NULL;
315 }
316
Allan Stephenscd3decd2011-10-24 11:18:12 -0400317 tipc_bclink_remove_node(n_ptr->addr);
Allan Stephens365595912011-10-24 15:26:24 -0400318 tipc_bclink_acknowledge(n_ptr, INVALID_LINK_SEQ);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100319
Allan Stephensc5bd4d82011-04-07 11:58:08 -0400320 n_ptr->bclink.supported = 0;
321 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100322
323 /* Abort link changeover */
324 for (i = 0; i < MAX_BEARERS; i++) {
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500325 struct tipc_link *l_ptr = n_ptr->links[i];
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900326 if (!l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100327 continue;
328 l_ptr->reset_checkpoint = l_ptr->next_in_no;
329 l_ptr->exp_msg_count = 0;
Per Liden4323add2006-01-18 00:38:21 +0100330 tipc_link_reset_fragments(l_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100331 }
332
333 /* Notify subscribers */
Allan Stephensf1379172011-02-23 14:13:41 -0500334 tipc_nodesub_notify(n_ptr);
Allan Stephens5a68d5ee2010-08-17 11:00:16 +0000335
Allan Stephensb4b56102011-05-27 11:00:51 -0400336 /* Prevent re-contact with node until cleanup is done */
Allan Stephens5a68d5ee2010-08-17 11:00:16 +0000337
Allan Stephensb4b56102011-05-27 11:00:51 -0400338 n_ptr->block_setup = WAIT_PEER_DOWN | WAIT_NAMES_GONE;
339 tipc_k_signal((Handler)node_name_purge_complete, n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100340}
341
Per Liden4323add2006-01-18 00:38:21 +0100342struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100343{
344 u32 domain;
345 struct sk_buff *buf;
David S. Miller6c000552008-09-02 23:38:32 -0700346 struct tipc_node *n_ptr;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900347 struct tipc_node_info node_info;
Allan Stephensea138472006-06-29 12:33:20 -0700348 u32 payload_size;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100349
350 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR))
Per Liden4323add2006-01-18 00:38:21 +0100351 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100352
Al Viro3e6c8cd2006-11-08 00:19:09 -0800353 domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
Per Liden4323add2006-01-18 00:38:21 +0100354 if (!tipc_addr_domain_valid(domain))
355 return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
356 " (network address)");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100357
Allan Stephens1aad72d2008-07-14 22:44:58 -0700358 read_lock_bh(&tipc_net_lock);
Allan Stephens672d99e2011-02-25 18:42:52 -0500359 if (!tipc_num_nodes) {
Allan Stephens1aad72d2008-07-14 22:44:58 -0700360 read_unlock_bh(&tipc_net_lock);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900361 return tipc_cfg_reply_none();
Allan Stephens1aad72d2008-07-14 22:44:58 -0700362 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100363
Allan Stephens08c80e92010-12-31 18:59:17 +0000364 /* For now, get space for all other nodes */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100365
Allan Stephens672d99e2011-02-25 18:42:52 -0500366 payload_size = TLV_SPACE(sizeof(node_info)) * tipc_num_nodes;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700367 if (payload_size > 32768u) {
368 read_unlock_bh(&tipc_net_lock);
Allan Stephensea138472006-06-29 12:33:20 -0700369 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
370 " (too many nodes)");
Allan Stephens1aad72d2008-07-14 22:44:58 -0700371 }
Allan Stephensea138472006-06-29 12:33:20 -0700372 buf = tipc_cfg_reply_alloc(payload_size);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700373 if (!buf) {
374 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100375 return NULL;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700376 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100377
378 /* Add TLVs for all nodes in scope */
379
Allan Stephens672d99e2011-02-25 18:42:52 -0500380 list_for_each_entry(n_ptr, &tipc_node_list, list) {
381 if (!tipc_in_scope(domain, n_ptr->addr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100382 continue;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900383 node_info.addr = htonl(n_ptr->addr);
384 node_info.up = htonl(tipc_node_is_up(n_ptr));
385 tipc_cfg_append_tlv(buf, TIPC_TLV_NODE_INFO,
Per Liden4323add2006-01-18 00:38:21 +0100386 &node_info, sizeof(node_info));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100387 }
388
Allan Stephens1aad72d2008-07-14 22:44:58 -0700389 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100390 return buf;
391}
392
Per Liden4323add2006-01-18 00:38:21 +0100393struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100394{
395 u32 domain;
396 struct sk_buff *buf;
David S. Miller6c000552008-09-02 23:38:32 -0700397 struct tipc_node *n_ptr;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900398 struct tipc_link_info link_info;
Allan Stephensea138472006-06-29 12:33:20 -0700399 u32 payload_size;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100400
401 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR))
Per Liden4323add2006-01-18 00:38:21 +0100402 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100403
Al Viro3e6c8cd2006-11-08 00:19:09 -0800404 domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
Per Liden4323add2006-01-18 00:38:21 +0100405 if (!tipc_addr_domain_valid(domain))
406 return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
407 " (network address)");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100408
Allan Stephensb58343f2011-11-08 13:48:28 -0500409 if (!tipc_own_addr)
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900410 return tipc_cfg_reply_none();
411
Allan Stephens1aad72d2008-07-14 22:44:58 -0700412 read_lock_bh(&tipc_net_lock);
413
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400414 /* Get space for all unicast links + broadcast link */
Per Lidenb97bf3f2006-01-02 19:04:38 +0100415
Allan Stephens9df3b7e2011-02-24 13:20:20 -0500416 payload_size = TLV_SPACE(sizeof(link_info)) *
Allan Stephensd1bcb112011-02-25 10:01:58 -0500417 (atomic_read(&tipc_num_links) + 1);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700418 if (payload_size > 32768u) {
419 read_unlock_bh(&tipc_net_lock);
Allan Stephensea138472006-06-29 12:33:20 -0700420 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
421 " (too many links)");
Allan Stephens1aad72d2008-07-14 22:44:58 -0700422 }
Allan Stephensea138472006-06-29 12:33:20 -0700423 buf = tipc_cfg_reply_alloc(payload_size);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700424 if (!buf) {
425 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100426 return NULL;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700427 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100428
429 /* Add TLV for broadcast link */
430
Allan Stephensa3796f82011-02-23 11:44:49 -0500431 link_info.dest = htonl(tipc_cluster_mask(tipc_own_addr));
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900432 link_info.up = htonl(1);
Stephen Hemminger4b704d52009-03-18 19:11:29 -0700433 strlcpy(link_info.str, tipc_bclink_name, TIPC_MAX_LINK_NAME);
Per Liden4323add2006-01-18 00:38:21 +0100434 tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, &link_info, sizeof(link_info));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100435
436 /* Add TLVs for any other links in scope */
437
Allan Stephens672d99e2011-02-25 18:42:52 -0500438 list_for_each_entry(n_ptr, &tipc_node_list, list) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900439 u32 i;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100440
Allan Stephens672d99e2011-02-25 18:42:52 -0500441 if (!tipc_in_scope(domain, n_ptr->addr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100442 continue;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700443 tipc_node_lock(n_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900444 for (i = 0; i < MAX_BEARERS; i++) {
445 if (!n_ptr->links[i])
446 continue;
447 link_info.dest = htonl(n_ptr->addr);
448 link_info.up = htonl(tipc_link_is_up(n_ptr->links[i]));
449 strcpy(link_info.str, n_ptr->links[i]->name);
450 tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO,
Per Liden4323add2006-01-18 00:38:21 +0100451 &link_info, sizeof(link_info));
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900452 }
Allan Stephens1aad72d2008-07-14 22:44:58 -0700453 tipc_node_unlock(n_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100454 }
455
Allan Stephens1aad72d2008-07-14 22:44:58 -0700456 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100457 return buf;
458}