blob: 6e6c434872e82534e0d48f6dceb0c212f1541896 [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 *
Jon Maloyc64f7a62012-11-16 13:51:31 +08004 * Copyright (c) 2000-2006, 2012 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 */
Paul Gortmaker872f24d2012-04-23 04:49:13 +000061static unsigned int tipc_hashfn(u32 addr)
Allan Stephensa635b462011-11-04 11:54:43 -040062{
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 */
Allan Stephens672d99e2011-02-25 18:42:52 -050069struct tipc_node *tipc_node_find(u32 addr)
70{
71 struct tipc_node *node;
Allan Stephens672d99e2011-02-25 18:42:52 -050072
Allan Stephens336ebf52012-04-17 18:02:01 -040073 if (unlikely(!in_own_cluster_exact(addr)))
Allan Stephens672d99e2011-02-25 18:42:52 -050074 return NULL;
75
Sasha Levinb67bfe02013-02-27 17:06:00 -080076 hlist_for_each_entry(node, &node_htable[tipc_hashfn(addr)], hash) {
Allan Stephens672d99e2011-02-25 18:42:52 -050077 if (node->addr == addr)
78 return node;
79 }
80 return NULL;
81}
82
83/**
Allan Stephens2ecb0922008-05-21 14:53:00 -070084 * tipc_node_create - create neighboring node
85 *
86 * Currently, this routine is called by neighbor discovery code, which holds
87 * net_lock for reading only. We must take node_create_lock to ensure a node
88 * isn't created twice if two different bearers discover the node at the same
89 * time. (It would be preferable to switch to holding net_lock in write mode,
90 * but this is a non-trivial change.)
91 */
David S. Miller6c000552008-09-02 23:38:32 -070092struct tipc_node *tipc_node_create(u32 addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +010093{
Allan Stephens672d99e2011-02-25 18:42:52 -050094 struct tipc_node *n_ptr, *temp_node;
Per Lidenb97bf3f2006-01-02 19:04:38 +010095
Allan Stephens2ecb0922008-05-21 14:53:00 -070096 spin_lock_bh(&node_create_lock);
97
Allan Stephens5af54792010-12-31 18:59:23 +000098 n_ptr = tipc_node_find(addr);
99 if (n_ptr) {
100 spin_unlock_bh(&node_create_lock);
101 return n_ptr;
Allan Stephens2ecb0922008-05-21 14:53:00 -0700102 }
103
Allan Stephens5af54792010-12-31 18:59:23 +0000104 n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC);
Allan Stephensa10bd922006-06-25 23:52:17 -0700105 if (!n_ptr) {
Allan Stephens2ecb0922008-05-21 14:53:00 -0700106 spin_unlock_bh(&node_create_lock);
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400107 pr_warn("Node creation failed, no memory\n");
Allan Stephensa10bd922006-06-25 23:52:17 -0700108 return NULL;
109 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100110
Allan Stephensa10bd922006-06-25 23:52:17 -0700111 n_ptr->addr = addr;
Allan Stephens51a8e4d2010-12-31 18:59:18 +0000112 spin_lock_init(&n_ptr->lock);
Allan Stephens672d99e2011-02-25 18:42:52 -0500113 INIT_HLIST_NODE(&n_ptr->hash);
114 INIT_LIST_HEAD(&n_ptr->list);
Allan Stephensa10bd922006-06-25 23:52:17 -0700115 INIT_LIST_HEAD(&n_ptr->nsub);
Allan Stephens8f92df62010-12-31 18:59:19 +0000116
Allan Stephens672d99e2011-02-25 18:42:52 -0500117 hlist_add_head(&n_ptr->hash, &node_htable[tipc_hashfn(addr)]);
118
119 list_for_each_entry(temp_node, &tipc_node_list, list) {
120 if (n_ptr->addr < temp_node->addr)
121 break;
122 }
123 list_add_tail(&n_ptr->list, &temp_node->list);
Allan Stephensb4b56102011-05-27 11:00:51 -0400124 n_ptr->block_setup = WAIT_PEER_DOWN;
Allan Stephensfc0eea62011-10-28 16:26:41 -0400125 n_ptr->signature = INVALID_NODE_SIG;
Allan Stephens672d99e2011-02-25 18:42:52 -0500126
127 tipc_num_nodes++;
Allan Stephensa10bd922006-06-25 23:52:17 -0700128
Allan Stephens2ecb0922008-05-21 14:53:00 -0700129 spin_unlock_bh(&node_create_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100130 return n_ptr;
131}
132
David S. Miller6c000552008-09-02 23:38:32 -0700133void tipc_node_delete(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100134{
Allan Stephens672d99e2011-02-25 18:42:52 -0500135 list_del(&n_ptr->list);
136 hlist_del(&n_ptr->hash);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100137 kfree(n_ptr);
Allan Stephens8f92df62010-12-31 18:59:19 +0000138
Allan Stephens672d99e2011-02-25 18:42:52 -0500139 tipc_num_nodes--;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100140}
141
Per Lidenb97bf3f2006-01-02 19:04:38 +0100142/**
Per Liden4323add2006-01-18 00:38:21 +0100143 * tipc_node_link_up - handle addition of link
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900144 *
Per Lidenb97bf3f2006-01-02 19:04:38 +0100145 * Link becomes active (alone or shared) or standby, depending on its priority.
146 */
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500147void tipc_node_link_up(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100148{
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500149 struct tipc_link **active = &n_ptr->active_links[0];
Per Lidenb97bf3f2006-01-02 19:04:38 +0100150
Allan Stephens5392d642006-06-25 23:52:50 -0700151 n_ptr->working_links++;
152
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400153 pr_info("Established link <%s> on network plane %c\n",
154 l_ptr->name, l_ptr->b_ptr->net_plane);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900155
Per Lidenb97bf3f2006-01-02 19:04:38 +0100156 if (!active[0]) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100157 active[0] = active[1] = l_ptr;
158 node_established_contact(n_ptr);
159 return;
160 }
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900161 if (l_ptr->priority < active[0]->priority) {
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400162 pr_info("New link <%s> becomes standby\n", l_ptr->name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100163 return;
164 }
Per Liden4323add2006-01-18 00:38:21 +0100165 tipc_link_send_duplicate(active[0], l_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900166 if (l_ptr->priority == active[0]->priority) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100167 active[0] = l_ptr;
168 return;
169 }
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400170 pr_info("Old link <%s> becomes standby\n", active[0]->name);
Allan Stephensa10bd922006-06-25 23:52:17 -0700171 if (active[1] != active[0])
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400172 pr_info("Old link <%s> becomes standby\n", active[1]->name);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100173 active[0] = active[1] = l_ptr;
174}
175
176/**
177 * node_select_active_links - select active link
178 */
David S. Miller6c000552008-09-02 23:38:32 -0700179static void node_select_active_links(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100180{
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500181 struct tipc_link **active = &n_ptr->active_links[0];
Per Lidenb97bf3f2006-01-02 19:04:38 +0100182 u32 i;
183 u32 highest_prio = 0;
184
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900185 active[0] = active[1] = NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100186
187 for (i = 0; i < MAX_BEARERS; i++) {
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500188 struct tipc_link *l_ptr = n_ptr->links[i];
Per Lidenb97bf3f2006-01-02 19:04:38 +0100189
Per Liden4323add2006-01-18 00:38:21 +0100190 if (!l_ptr || !tipc_link_is_up(l_ptr) ||
Per Lidenb97bf3f2006-01-02 19:04:38 +0100191 (l_ptr->priority < highest_prio))
192 continue;
193
194 if (l_ptr->priority > highest_prio) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900195 highest_prio = l_ptr->priority;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100196 active[0] = active[1] = l_ptr;
197 } else {
198 active[1] = l_ptr;
199 }
200 }
201}
202
203/**
Per Liden4323add2006-01-18 00:38:21 +0100204 * tipc_node_link_down - handle loss of link
Per Lidenb97bf3f2006-01-02 19:04:38 +0100205 */
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500206void tipc_node_link_down(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100207{
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500208 struct tipc_link **active;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100209
Allan Stephens5392d642006-06-25 23:52:50 -0700210 n_ptr->working_links--;
211
Per Liden4323add2006-01-18 00:38:21 +0100212 if (!tipc_link_is_active(l_ptr)) {
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400213 pr_info("Lost standby link <%s> on network plane %c\n",
214 l_ptr->name, l_ptr->b_ptr->net_plane);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100215 return;
216 }
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400217 pr_info("Lost link <%s> on network plane %c\n",
Per Lidenb97bf3f2006-01-02 19:04:38 +0100218 l_ptr->name, l_ptr->b_ptr->net_plane);
219
220 active = &n_ptr->active_links[0];
221 if (active[0] == l_ptr)
222 active[0] = active[1];
223 if (active[1] == l_ptr)
224 active[1] = active[0];
225 if (active[0] == l_ptr)
226 node_select_active_links(n_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900227 if (tipc_node_is_up(n_ptr))
Per Liden4323add2006-01-18 00:38:21 +0100228 tipc_link_changeover(l_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900229 else
Per Lidenb97bf3f2006-01-02 19:04:38 +0100230 node_lost_contact(n_ptr);
231}
232
Paul Gortmaker8f19afb2011-02-28 11:36:21 -0400233int tipc_node_active_links(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100234{
Allan Stephens76ae0d72010-08-17 11:00:12 +0000235 return n_ptr->active_links[0] != NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100236}
237
Paul Gortmaker8f19afb2011-02-28 11:36:21 -0400238int tipc_node_redundant_links(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100239{
Eric Dumazeta02cec22010-09-22 20:43:57 +0000240 return n_ptr->working_links > 1;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100241}
242
David S. Miller6c000552008-09-02 23:38:32 -0700243int tipc_node_is_up(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100244{
Paul Gortmaker8f19afb2011-02-28 11:36:21 -0400245 return tipc_node_active_links(n_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100246}
247
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500248void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100249{
Allan Stephens37b9c082011-02-28 11:32:27 -0500250 n_ptr->links[l_ptr->b_ptr->identity] = l_ptr;
251 atomic_inc(&tipc_num_links);
252 n_ptr->link_cnt++;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100253}
254
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500255void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100256{
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800257 n_ptr->links[l_ptr->b_ptr->identity] = NULL;
Allan Stephensd1bcb112011-02-25 10:01:58 -0500258 atomic_dec(&tipc_num_links);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100259 n_ptr->link_cnt--;
260}
261
David S. Miller6c000552008-09-02 23:38:32 -0700262static void node_established_contact(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100263{
Allan Stephens51a8e4d2010-12-31 18:59:18 +0000264 tipc_k_signal((Handler)tipc_named_node_up, n_ptr->addr);
Jon Maloyc64f7a62012-11-16 13:51:31 +0800265 n_ptr->bclink.oos_state = 0;
Ying Xue818f4da2012-11-16 13:51:29 +0800266 n_ptr->bclink.acked = tipc_bclink_get_last_sent();
267 tipc_bclink_add_node(n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100268}
269
Allan Stephensb4b56102011-05-27 11:00:51 -0400270static void node_name_purge_complete(unsigned long node_addr)
Allan Stephens5a68d5e2010-08-17 11:00:16 +0000271{
272 struct tipc_node *n_ptr;
273
274 read_lock_bh(&tipc_net_lock);
275 n_ptr = tipc_node_find(node_addr);
276 if (n_ptr) {
277 tipc_node_lock(n_ptr);
Allan Stephensb4b56102011-05-27 11:00:51 -0400278 n_ptr->block_setup &= ~WAIT_NAMES_GONE;
Allan Stephens5a68d5e2010-08-17 11:00:16 +0000279 tipc_node_unlock(n_ptr);
280 }
281 read_unlock_bh(&tipc_net_lock);
282}
283
David S. Miller6c000552008-09-02 23:38:32 -0700284static void node_lost_contact(struct tipc_node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100285{
Per Lidenb97bf3f2006-01-02 19:04:38 +0100286 char addr_string[16];
287 u32 i;
288
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400289 pr_info("Lost contact with %s\n",
290 tipc_addr_string_fill(addr_string, n_ptr->addr));
Allan Stephensc5bd4d82011-04-07 11:58:08 -0400291
292 /* Flush broadcast link info associated with lost node */
Ying Xue389dd9b2012-11-16 13:51:30 +0800293 if (n_ptr->bclink.recv_permitted) {
Allan Stephensc5bd4d82011-04-07 11:58:08 -0400294 while (n_ptr->bclink.deferred_head) {
295 struct sk_buff *buf = n_ptr->bclink.deferred_head;
296 n_ptr->bclink.deferred_head = buf->next;
Allan Stephens5f6d9122011-11-04 13:24:29 -0400297 kfree_skb(buf);
Allan Stephensc5bd4d82011-04-07 11:58:08 -0400298 }
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400299 n_ptr->bclink.deferred_size = 0;
Allan Stephensc5bd4d82011-04-07 11:58:08 -0400300
301 if (n_ptr->bclink.defragm) {
Allan Stephens5f6d9122011-11-04 13:24:29 -0400302 kfree_skb(n_ptr->bclink.defragm);
Allan Stephensc5bd4d82011-04-07 11:58:08 -0400303 n_ptr->bclink.defragm = NULL;
304 }
305
Allan Stephenscd3decd2011-10-24 11:18:12 -0400306 tipc_bclink_remove_node(n_ptr->addr);
Allan Stephens365595912011-10-24 15:26:24 -0400307 tipc_bclink_acknowledge(n_ptr, INVALID_LINK_SEQ);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100308
Ying Xue389dd9b2012-11-16 13:51:30 +0800309 n_ptr->bclink.recv_permitted = false;
Allan Stephensc5bd4d82011-04-07 11:58:08 -0400310 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100311
312 /* Abort link changeover */
313 for (i = 0; i < MAX_BEARERS; i++) {
Paul Gortmakera18c4bc2011-12-29 20:58:42 -0500314 struct tipc_link *l_ptr = n_ptr->links[i];
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900315 if (!l_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100316 continue;
317 l_ptr->reset_checkpoint = l_ptr->next_in_no;
318 l_ptr->exp_msg_count = 0;
Per Liden4323add2006-01-18 00:38:21 +0100319 tipc_link_reset_fragments(l_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100320 }
321
322 /* Notify subscribers */
Allan Stephensf1379172011-02-23 14:13:41 -0500323 tipc_nodesub_notify(n_ptr);
Allan Stephens5a68d5e2010-08-17 11:00:16 +0000324
Allan Stephensb4b56102011-05-27 11:00:51 -0400325 /* Prevent re-contact with node until cleanup is done */
Allan Stephensb4b56102011-05-27 11:00:51 -0400326 n_ptr->block_setup = WAIT_PEER_DOWN | WAIT_NAMES_GONE;
327 tipc_k_signal((Handler)node_name_purge_complete, n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100328}
329
Per Liden4323add2006-01-18 00:38:21 +0100330struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100331{
332 u32 domain;
333 struct sk_buff *buf;
David S. Miller6c000552008-09-02 23:38:32 -0700334 struct tipc_node *n_ptr;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900335 struct tipc_node_info node_info;
Allan Stephensea138472006-06-29 12:33:20 -0700336 u32 payload_size;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100337
338 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR))
Per Liden4323add2006-01-18 00:38:21 +0100339 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100340
Al Viro3e6c8cd2006-11-08 00:19:09 -0800341 domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
Per Liden4323add2006-01-18 00:38:21 +0100342 if (!tipc_addr_domain_valid(domain))
343 return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
344 " (network address)");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100345
Allan Stephens1aad72d2008-07-14 22:44:58 -0700346 read_lock_bh(&tipc_net_lock);
Allan Stephens672d99e2011-02-25 18:42:52 -0500347 if (!tipc_num_nodes) {
Allan Stephens1aad72d2008-07-14 22:44:58 -0700348 read_unlock_bh(&tipc_net_lock);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900349 return tipc_cfg_reply_none();
Allan Stephens1aad72d2008-07-14 22:44:58 -0700350 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100351
Allan Stephens08c80e92010-12-31 18:59:17 +0000352 /* For now, get space for all other nodes */
Allan Stephens672d99e2011-02-25 18:42:52 -0500353 payload_size = TLV_SPACE(sizeof(node_info)) * tipc_num_nodes;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700354 if (payload_size > 32768u) {
355 read_unlock_bh(&tipc_net_lock);
Allan Stephensea138472006-06-29 12:33:20 -0700356 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
357 " (too many nodes)");
Allan Stephens1aad72d2008-07-14 22:44:58 -0700358 }
Allan Stephensea138472006-06-29 12:33:20 -0700359 buf = tipc_cfg_reply_alloc(payload_size);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700360 if (!buf) {
361 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100362 return NULL;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700363 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100364
365 /* Add TLVs for all nodes in scope */
Allan Stephens672d99e2011-02-25 18:42:52 -0500366 list_for_each_entry(n_ptr, &tipc_node_list, list) {
367 if (!tipc_in_scope(domain, n_ptr->addr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100368 continue;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900369 node_info.addr = htonl(n_ptr->addr);
370 node_info.up = htonl(tipc_node_is_up(n_ptr));
371 tipc_cfg_append_tlv(buf, TIPC_TLV_NODE_INFO,
Per Liden4323add2006-01-18 00:38:21 +0100372 &node_info, sizeof(node_info));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100373 }
374
Allan Stephens1aad72d2008-07-14 22:44:58 -0700375 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100376 return buf;
377}
378
Per Liden4323add2006-01-18 00:38:21 +0100379struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100380{
381 u32 domain;
382 struct sk_buff *buf;
David S. Miller6c000552008-09-02 23:38:32 -0700383 struct tipc_node *n_ptr;
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900384 struct tipc_link_info link_info;
Allan Stephensea138472006-06-29 12:33:20 -0700385 u32 payload_size;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100386
387 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR))
Per Liden4323add2006-01-18 00:38:21 +0100388 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100389
Al Viro3e6c8cd2006-11-08 00:19:09 -0800390 domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
Per Liden4323add2006-01-18 00:38:21 +0100391 if (!tipc_addr_domain_valid(domain))
392 return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
393 " (network address)");
Per Lidenb97bf3f2006-01-02 19:04:38 +0100394
Allan Stephensb58343f2011-11-08 13:48:28 -0500395 if (!tipc_own_addr)
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900396 return tipc_cfg_reply_none();
397
Allan Stephens1aad72d2008-07-14 22:44:58 -0700398 read_lock_bh(&tipc_net_lock);
399
Allan Stephens7a54d4a2011-10-27 14:17:53 -0400400 /* Get space for all unicast links + broadcast link */
Allan Stephens9df3b7e2011-02-24 13:20:20 -0500401 payload_size = TLV_SPACE(sizeof(link_info)) *
Allan Stephensd1bcb112011-02-25 10:01:58 -0500402 (atomic_read(&tipc_num_links) + 1);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700403 if (payload_size > 32768u) {
404 read_unlock_bh(&tipc_net_lock);
Allan Stephensea138472006-06-29 12:33:20 -0700405 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
406 " (too many links)");
Allan Stephens1aad72d2008-07-14 22:44:58 -0700407 }
Allan Stephensea138472006-06-29 12:33:20 -0700408 buf = tipc_cfg_reply_alloc(payload_size);
Allan Stephens1aad72d2008-07-14 22:44:58 -0700409 if (!buf) {
410 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100411 return NULL;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700412 }
Per Lidenb97bf3f2006-01-02 19:04:38 +0100413
414 /* Add TLV for broadcast link */
Allan Stephensa3796f82011-02-23 11:44:49 -0500415 link_info.dest = htonl(tipc_cluster_mask(tipc_own_addr));
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900416 link_info.up = htonl(1);
Stephen Hemminger4b704d52009-03-18 19:11:29 -0700417 strlcpy(link_info.str, tipc_bclink_name, TIPC_MAX_LINK_NAME);
Per Liden4323add2006-01-18 00:38:21 +0100418 tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, &link_info, sizeof(link_info));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100419
420 /* Add TLVs for any other links in scope */
Allan Stephens672d99e2011-02-25 18:42:52 -0500421 list_for_each_entry(n_ptr, &tipc_node_list, list) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900422 u32 i;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100423
Allan Stephens672d99e2011-02-25 18:42:52 -0500424 if (!tipc_in_scope(domain, n_ptr->addr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100425 continue;
Allan Stephens1aad72d2008-07-14 22:44:58 -0700426 tipc_node_lock(n_ptr);
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900427 for (i = 0; i < MAX_BEARERS; i++) {
428 if (!n_ptr->links[i])
429 continue;
430 link_info.dest = htonl(n_ptr->addr);
431 link_info.up = htonl(tipc_link_is_up(n_ptr->links[i]));
432 strcpy(link_info.str, n_ptr->links[i]->name);
433 tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO,
Per Liden4323add2006-01-18 00:38:21 +0100434 &link_info, sizeof(link_info));
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +0900435 }
Allan Stephens1aad72d2008-07-14 22:44:58 -0700436 tipc_node_unlock(n_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100437 }
438
Allan Stephens1aad72d2008-07-14 22:44:58 -0700439 read_unlock_bh(&tipc_net_lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100440 return buf;
441}