]>
Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/node.c: TIPC node management routines | |
c4307285 | 3 | * |
593a5f22 | 4 | * Copyright (c) 2000-2006, Ericsson AB |
2d627b92 | 5 | * Copyright (c) 2005-2006, 2010-2011, Wind River Systems |
b97bf3fd PL |
6 | * All rights reserved. |
7 | * | |
9ea1fd3c | 8 | * Redistribution and use in source and binary forms, with or without |
b97bf3fd PL |
9 | * modification, are permitted provided that the following conditions are met: |
10 | * | |
9ea1fd3c PL |
11 | * 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. | |
b97bf3fd | 19 | * |
9ea1fd3c PL |
20 | * 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 | |
b97bf3fd PL |
34 | * POSSIBILITY OF SUCH DAMAGE. |
35 | */ | |
36 | ||
37 | #include "core.h" | |
38 | #include "config.h" | |
39 | #include "node.h" | |
b97bf3fd | 40 | #include "name_distr.h" |
b97bf3fd | 41 | |
6c00055a DM |
42 | static void node_lost_contact(struct tipc_node *n_ptr); |
43 | static void node_established_contact(struct tipc_node *n_ptr); | |
b97bf3fd | 44 | |
2ecb0924 AS |
45 | static DEFINE_SPINLOCK(node_create_lock); |
46 | ||
672d99e1 AS |
47 | static struct hlist_head node_htable[NODE_HTABLE_SIZE]; |
48 | LIST_HEAD(tipc_node_list); | |
49 | static u32 tipc_num_nodes; | |
34e46258 AS |
50 | |
51 | static atomic_t tipc_num_links = ATOMIC_INIT(0); | |
e3ec9c7d | 52 | u32 tipc_own_tag; |
b97bf3fd | 53 | |
672d99e1 AS |
54 | /** |
55 | * tipc_node_find - locate specified node object, if it exists | |
56 | */ | |
57 | ||
58 | struct 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 | ||
2ecb0924 AS |
73 | /** |
74 | * 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 | ||
6c00055a | 83 | struct tipc_node *tipc_node_create(u32 addr) |
b97bf3fd | 84 | { |
672d99e1 | 85 | struct tipc_node *n_ptr, *temp_node; |
b97bf3fd | 86 | |
2ecb0924 AS |
87 | spin_lock_bh(&node_create_lock); |
88 | ||
5af54792 AS |
89 | n_ptr = tipc_node_find(addr); |
90 | if (n_ptr) { | |
91 | spin_unlock_bh(&node_create_lock); | |
92 | return n_ptr; | |
2ecb0924 AS |
93 | } |
94 | ||
5af54792 | 95 | n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC); |
a10bd924 | 96 | if (!n_ptr) { |
2ecb0924 | 97 | spin_unlock_bh(&node_create_lock); |
a10bd924 AS |
98 | warn("Node creation failed, no memory\n"); |
99 | return NULL; | |
100 | } | |
101 | ||
a10bd924 | 102 | n_ptr->addr = addr; |
51a8e4de | 103 | spin_lock_init(&n_ptr->lock); |
672d99e1 AS |
104 | INIT_HLIST_NODE(&n_ptr->hash); |
105 | INIT_LIST_HEAD(&n_ptr->list); | |
a10bd924 | 106 | INIT_LIST_HEAD(&n_ptr->nsub); |
8f92df6a | 107 | |
672d99e1 AS |
108 | 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); | |
b4b56102 | 115 | n_ptr->block_setup = WAIT_PEER_DOWN; |
672d99e1 AS |
116 | |
117 | tipc_num_nodes++; | |
a10bd924 | 118 | |
2ecb0924 | 119 | spin_unlock_bh(&node_create_lock); |
b97bf3fd PL |
120 | return n_ptr; |
121 | } | |
122 | ||
6c00055a | 123 | void tipc_node_delete(struct tipc_node *n_ptr) |
b97bf3fd | 124 | { |
672d99e1 AS |
125 | list_del(&n_ptr->list); |
126 | hlist_del(&n_ptr->hash); | |
b97bf3fd | 127 | kfree(n_ptr); |
8f92df6a | 128 | |
672d99e1 | 129 | tipc_num_nodes--; |
b97bf3fd PL |
130 | } |
131 | ||
132 | ||
133 | /** | |
4323add6 | 134 | * tipc_node_link_up - handle addition of link |
c4307285 | 135 | * |
b97bf3fd PL |
136 | * Link becomes active (alone or shared) or standby, depending on its priority. |
137 | */ | |
138 | ||
6c00055a | 139 | void tipc_node_link_up(struct tipc_node *n_ptr, struct link *l_ptr) |
b97bf3fd PL |
140 | { |
141 | struct link **active = &n_ptr->active_links[0]; | |
142 | ||
5392d646 AS |
143 | n_ptr->working_links++; |
144 | ||
b97bf3fd PL |
145 | info("Established link <%s> on network plane %c\n", |
146 | l_ptr->name, l_ptr->b_ptr->net_plane); | |
c4307285 | 147 | |
b97bf3fd | 148 | if (!active[0]) { |
b97bf3fd PL |
149 | active[0] = active[1] = l_ptr; |
150 | node_established_contact(n_ptr); | |
151 | return; | |
152 | } | |
c4307285 | 153 | if (l_ptr->priority < active[0]->priority) { |
a10bd924 | 154 | info("New link <%s> becomes standby\n", l_ptr->name); |
b97bf3fd PL |
155 | return; |
156 | } | |
4323add6 | 157 | tipc_link_send_duplicate(active[0], l_ptr); |
c4307285 | 158 | if (l_ptr->priority == active[0]->priority) { |
b97bf3fd PL |
159 | active[0] = l_ptr; |
160 | return; | |
161 | } | |
a10bd924 AS |
162 | info("Old link <%s> becomes standby\n", active[0]->name); |
163 | if (active[1] != active[0]) | |
164 | info("Old link <%s> becomes standby\n", active[1]->name); | |
b97bf3fd PL |
165 | active[0] = active[1] = l_ptr; |
166 | } | |
167 | ||
168 | /** | |
169 | * node_select_active_links - select active link | |
170 | */ | |
171 | ||
6c00055a | 172 | static void node_select_active_links(struct tipc_node *n_ptr) |
b97bf3fd PL |
173 | { |
174 | struct link **active = &n_ptr->active_links[0]; | |
175 | u32 i; | |
176 | u32 highest_prio = 0; | |
177 | ||
c4307285 | 178 | active[0] = active[1] = NULL; |
b97bf3fd PL |
179 | |
180 | for (i = 0; i < MAX_BEARERS; i++) { | |
c4307285 | 181 | struct link *l_ptr = n_ptr->links[i]; |
b97bf3fd | 182 | |
4323add6 | 183 | if (!l_ptr || !tipc_link_is_up(l_ptr) || |
b97bf3fd PL |
184 | (l_ptr->priority < highest_prio)) |
185 | continue; | |
186 | ||
187 | if (l_ptr->priority > highest_prio) { | |
c4307285 | 188 | highest_prio = l_ptr->priority; |
b97bf3fd PL |
189 | active[0] = active[1] = l_ptr; |
190 | } else { | |
191 | active[1] = l_ptr; | |
192 | } | |
193 | } | |
194 | } | |
195 | ||
196 | /** | |
4323add6 | 197 | * tipc_node_link_down - handle loss of link |
b97bf3fd PL |
198 | */ |
199 | ||
6c00055a | 200 | void tipc_node_link_down(struct tipc_node *n_ptr, struct link *l_ptr) |
b97bf3fd PL |
201 | { |
202 | struct link **active; | |
203 | ||
5392d646 AS |
204 | n_ptr->working_links--; |
205 | ||
4323add6 | 206 | if (!tipc_link_is_active(l_ptr)) { |
b97bf3fd PL |
207 | info("Lost standby link <%s> on network plane %c\n", |
208 | l_ptr->name, l_ptr->b_ptr->net_plane); | |
209 | return; | |
210 | } | |
211 | info("Lost link <%s> on network plane %c\n", | |
212 | l_ptr->name, l_ptr->b_ptr->net_plane); | |
213 | ||
214 | active = &n_ptr->active_links[0]; | |
215 | if (active[0] == l_ptr) | |
216 | active[0] = active[1]; | |
217 | if (active[1] == l_ptr) | |
218 | active[1] = active[0]; | |
219 | if (active[0] == l_ptr) | |
220 | node_select_active_links(n_ptr); | |
c4307285 | 221 | if (tipc_node_is_up(n_ptr)) |
4323add6 | 222 | tipc_link_changeover(l_ptr); |
c4307285 | 223 | else |
b97bf3fd PL |
224 | node_lost_contact(n_ptr); |
225 | } | |
226 | ||
8f19afb2 | 227 | int tipc_node_active_links(struct tipc_node *n_ptr) |
b97bf3fd | 228 | { |
76ae0d71 | 229 | return n_ptr->active_links[0] != NULL; |
b97bf3fd PL |
230 | } |
231 | ||
8f19afb2 | 232 | int tipc_node_redundant_links(struct tipc_node *n_ptr) |
b97bf3fd | 233 | { |
a02cec21 | 234 | return n_ptr->working_links > 1; |
b97bf3fd PL |
235 | } |
236 | ||
6c00055a | 237 | int tipc_node_is_up(struct tipc_node *n_ptr) |
b97bf3fd | 238 | { |
8f19afb2 | 239 | return tipc_node_active_links(n_ptr); |
b97bf3fd PL |
240 | } |
241 | ||
37b9c08a | 242 | void tipc_node_attach_link(struct tipc_node *n_ptr, struct link *l_ptr) |
b97bf3fd | 243 | { |
37b9c08a AS |
244 | n_ptr->links[l_ptr->b_ptr->identity] = l_ptr; |
245 | atomic_inc(&tipc_num_links); | |
246 | n_ptr->link_cnt++; | |
b97bf3fd PL |
247 | } |
248 | ||
6c00055a | 249 | void tipc_node_detach_link(struct tipc_node *n_ptr, struct link *l_ptr) |
b97bf3fd | 250 | { |
1fc54d8f | 251 | n_ptr->links[l_ptr->b_ptr->identity] = NULL; |
d1bcb115 | 252 | atomic_dec(&tipc_num_links); |
b97bf3fd PL |
253 | n_ptr->link_cnt--; |
254 | } | |
255 | ||
256 | /* | |
257 | * Routing table management - five cases to handle: | |
258 | * | |
259 | * 1: A link towards a zone/cluster external node comes up. | |
c4307285 YH |
260 | * => Send a multicast message updating routing tables of all |
261 | * system nodes within own cluster that the new destination | |
262 | * can be reached via this node. | |
b97bf3fd PL |
263 | * (node.establishedContact()=>cluster.multicastNewRoute()) |
264 | * | |
265 | * 2: A link towards a slave node comes up. | |
c4307285 YH |
266 | * => Send a multicast message updating routing tables of all |
267 | * system nodes within own cluster that the new destination | |
268 | * can be reached via this node. | |
b97bf3fd | 269 | * (node.establishedContact()=>cluster.multicastNewRoute()) |
c4307285 | 270 | * => Send a message to the slave node about existence |
b97bf3fd PL |
271 | * of all system nodes within cluster: |
272 | * (node.establishedContact()=>cluster.sendLocalRoutes()) | |
273 | * | |
274 | * 3: A new cluster local system node becomes available. | |
275 | * => Send message(s) to this particular node containing | |
276 | * information about all cluster external and slave | |
277 | * nodes which can be reached via this node. | |
278 | * (node.establishedContact()==>network.sendExternalRoutes()) | |
279 | * (node.establishedContact()==>network.sendSlaveRoutes()) | |
c4307285 | 280 | * => Send messages to all directly connected slave nodes |
b97bf3fd PL |
281 | * containing information about the existence of the new node |
282 | * (node.establishedContact()=>cluster.multicastNewRoute()) | |
c4307285 | 283 | * |
b97bf3fd PL |
284 | * 4: The link towards a zone/cluster external node or slave |
285 | * node goes down. | |
c4307285 | 286 | * => Send a multcast message updating routing tables of all |
b97bf3fd PL |
287 | * nodes within cluster that the new destination can not any |
288 | * longer be reached via this node. | |
289 | * (node.lostAllLinks()=>cluster.bcastLostRoute()) | |
290 | * | |
291 | * 5: A cluster local system node becomes unavailable. | |
292 | * => Remove all references to this node from the local | |
293 | * routing tables. Note: This is a completely node | |
294 | * local operation. | |
295 | * (node.lostAllLinks()=>network.removeAsRouter()) | |
c4307285 | 296 | * => Send messages to all directly connected slave nodes |
b97bf3fd PL |
297 | * containing information about loss of the node |
298 | * (node.establishedContact()=>cluster.multicastLostRoute()) | |
299 | * | |
300 | */ | |
301 | ||
6c00055a | 302 | static void node_established_contact(struct tipc_node *n_ptr) |
b97bf3fd | 303 | { |
51a8e4de | 304 | tipc_k_signal((Handler)tipc_named_node_up, n_ptr->addr); |
b97bf3fd | 305 | |
c4307285 YH |
306 | /* Syncronize broadcast acks */ |
307 | n_ptr->bclink.acked = tipc_bclink_get_last_sent(); | |
b97bf3fd | 308 | |
b97bf3fd | 309 | if (n_ptr->bclink.supported) { |
8f92df6a | 310 | tipc_nmap_add(&tipc_bcast_nmap, n_ptr->addr); |
b97bf3fd PL |
311 | if (n_ptr->addr < tipc_own_addr) |
312 | tipc_own_tag++; | |
313 | } | |
b97bf3fd PL |
314 | } |
315 | ||
b4b56102 | 316 | static void node_name_purge_complete(unsigned long node_addr) |
5a68d5ee AS |
317 | { |
318 | struct tipc_node *n_ptr; | |
319 | ||
320 | read_lock_bh(&tipc_net_lock); | |
321 | n_ptr = tipc_node_find(node_addr); | |
322 | if (n_ptr) { | |
323 | tipc_node_lock(n_ptr); | |
b4b56102 | 324 | n_ptr->block_setup &= ~WAIT_NAMES_GONE; |
5a68d5ee AS |
325 | tipc_node_unlock(n_ptr); |
326 | } | |
327 | read_unlock_bh(&tipc_net_lock); | |
328 | } | |
329 | ||
6c00055a | 330 | static void node_lost_contact(struct tipc_node *n_ptr) |
b97bf3fd | 331 | { |
b97bf3fd PL |
332 | char addr_string[16]; |
333 | u32 i; | |
334 | ||
c5bd4d85 AS |
335 | info("Lost contact with %s\n", |
336 | tipc_addr_string_fill(addr_string, n_ptr->addr)); | |
337 | ||
338 | /* Flush broadcast link info associated with lost node */ | |
c4307285 | 339 | |
51a8e4de | 340 | if (n_ptr->bclink.supported) { |
c5bd4d85 AS |
341 | n_ptr->bclink.gap_after = n_ptr->bclink.gap_to = 0; |
342 | while (n_ptr->bclink.deferred_head) { | |
343 | struct sk_buff *buf = n_ptr->bclink.deferred_head; | |
344 | n_ptr->bclink.deferred_head = buf->next; | |
345 | buf_discard(buf); | |
346 | } | |
347 | ||
348 | if (n_ptr->bclink.defragm) { | |
349 | buf_discard(n_ptr->bclink.defragm); | |
350 | n_ptr->bclink.defragm = NULL; | |
351 | } | |
352 | ||
169073db | 353 | tipc_nmap_remove(&tipc_bcast_nmap, n_ptr->addr); |
8f92df6a AS |
354 | tipc_bclink_acknowledge(n_ptr, |
355 | mod(n_ptr->bclink.acked + 10000)); | |
51a8e4de AS |
356 | if (n_ptr->addr < tipc_own_addr) |
357 | tipc_own_tag--; | |
b97bf3fd | 358 | |
c5bd4d85 AS |
359 | n_ptr->bclink.supported = 0; |
360 | } | |
b97bf3fd PL |
361 | |
362 | /* Abort link changeover */ | |
363 | for (i = 0; i < MAX_BEARERS; i++) { | |
364 | struct link *l_ptr = n_ptr->links[i]; | |
c4307285 | 365 | if (!l_ptr) |
b97bf3fd PL |
366 | continue; |
367 | l_ptr->reset_checkpoint = l_ptr->next_in_no; | |
368 | l_ptr->exp_msg_count = 0; | |
4323add6 | 369 | tipc_link_reset_fragments(l_ptr); |
b97bf3fd PL |
370 | } |
371 | ||
372 | /* Notify subscribers */ | |
f1379173 | 373 | tipc_nodesub_notify(n_ptr); |
5a68d5ee | 374 | |
b4b56102 | 375 | /* Prevent re-contact with node until cleanup is done */ |
5a68d5ee | 376 | |
b4b56102 AS |
377 | n_ptr->block_setup = WAIT_PEER_DOWN | WAIT_NAMES_GONE; |
378 | tipc_k_signal((Handler)node_name_purge_complete, n_ptr->addr); | |
b97bf3fd PL |
379 | } |
380 | ||
4323add6 | 381 | struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space) |
b97bf3fd PL |
382 | { |
383 | u32 domain; | |
384 | struct sk_buff *buf; | |
6c00055a | 385 | struct tipc_node *n_ptr; |
c4307285 | 386 | struct tipc_node_info node_info; |
ea13847b | 387 | u32 payload_size; |
b97bf3fd PL |
388 | |
389 | if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR)) | |
4323add6 | 390 | return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); |
b97bf3fd | 391 | |
3e6c8cd5 | 392 | domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area)); |
4323add6 PL |
393 | if (!tipc_addr_domain_valid(domain)) |
394 | return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE | |
395 | " (network address)"); | |
b97bf3fd | 396 | |
1aad72d6 | 397 | read_lock_bh(&tipc_net_lock); |
672d99e1 | 398 | if (!tipc_num_nodes) { |
1aad72d6 | 399 | read_unlock_bh(&tipc_net_lock); |
c4307285 | 400 | return tipc_cfg_reply_none(); |
1aad72d6 | 401 | } |
b97bf3fd | 402 | |
08c80e9a | 403 | /* For now, get space for all other nodes */ |
b97bf3fd | 404 | |
672d99e1 | 405 | payload_size = TLV_SPACE(sizeof(node_info)) * tipc_num_nodes; |
1aad72d6 AS |
406 | if (payload_size > 32768u) { |
407 | read_unlock_bh(&tipc_net_lock); | |
ea13847b AS |
408 | return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED |
409 | " (too many nodes)"); | |
1aad72d6 | 410 | } |
ea13847b | 411 | buf = tipc_cfg_reply_alloc(payload_size); |
1aad72d6 AS |
412 | if (!buf) { |
413 | read_unlock_bh(&tipc_net_lock); | |
b97bf3fd | 414 | return NULL; |
1aad72d6 | 415 | } |
b97bf3fd PL |
416 | |
417 | /* Add TLVs for all nodes in scope */ | |
418 | ||
672d99e1 AS |
419 | list_for_each_entry(n_ptr, &tipc_node_list, list) { |
420 | if (!tipc_in_scope(domain, n_ptr->addr)) | |
b97bf3fd | 421 | continue; |
c4307285 YH |
422 | node_info.addr = htonl(n_ptr->addr); |
423 | node_info.up = htonl(tipc_node_is_up(n_ptr)); | |
424 | tipc_cfg_append_tlv(buf, TIPC_TLV_NODE_INFO, | |
4323add6 | 425 | &node_info, sizeof(node_info)); |
b97bf3fd PL |
426 | } |
427 | ||
1aad72d6 | 428 | read_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
429 | return buf; |
430 | } | |
431 | ||
4323add6 | 432 | struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space) |
b97bf3fd PL |
433 | { |
434 | u32 domain; | |
435 | struct sk_buff *buf; | |
6c00055a | 436 | struct tipc_node *n_ptr; |
c4307285 | 437 | struct tipc_link_info link_info; |
ea13847b | 438 | u32 payload_size; |
b97bf3fd PL |
439 | |
440 | if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR)) | |
4323add6 | 441 | return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); |
b97bf3fd | 442 | |
3e6c8cd5 | 443 | domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area)); |
4323add6 PL |
444 | if (!tipc_addr_domain_valid(domain)) |
445 | return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE | |
446 | " (network address)"); | |
b97bf3fd | 447 | |
c4307285 YH |
448 | if (tipc_mode != TIPC_NET_MODE) |
449 | return tipc_cfg_reply_none(); | |
450 | ||
1aad72d6 AS |
451 | read_lock_bh(&tipc_net_lock); |
452 | ||
ea13847b AS |
453 | /* Get space for all unicast links + multicast link */ |
454 | ||
9df3b7eb | 455 | payload_size = TLV_SPACE(sizeof(link_info)) * |
d1bcb115 | 456 | (atomic_read(&tipc_num_links) + 1); |
1aad72d6 AS |
457 | if (payload_size > 32768u) { |
458 | read_unlock_bh(&tipc_net_lock); | |
ea13847b AS |
459 | return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED |
460 | " (too many links)"); | |
1aad72d6 | 461 | } |
ea13847b | 462 | buf = tipc_cfg_reply_alloc(payload_size); |
1aad72d6 AS |
463 | if (!buf) { |
464 | read_unlock_bh(&tipc_net_lock); | |
b97bf3fd | 465 | return NULL; |
1aad72d6 | 466 | } |
b97bf3fd PL |
467 | |
468 | /* Add TLV for broadcast link */ | |
469 | ||
a3796f89 | 470 | link_info.dest = htonl(tipc_cluster_mask(tipc_own_addr)); |
c4307285 | 471 | link_info.up = htonl(1); |
4b704d59 | 472 | strlcpy(link_info.str, tipc_bclink_name, TIPC_MAX_LINK_NAME); |
4323add6 | 473 | tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, &link_info, sizeof(link_info)); |
b97bf3fd PL |
474 | |
475 | /* Add TLVs for any other links in scope */ | |
476 | ||
672d99e1 | 477 | list_for_each_entry(n_ptr, &tipc_node_list, list) { |
c4307285 | 478 | u32 i; |
b97bf3fd | 479 | |
672d99e1 | 480 | if (!tipc_in_scope(domain, n_ptr->addr)) |
b97bf3fd | 481 | continue; |
1aad72d6 | 482 | tipc_node_lock(n_ptr); |
c4307285 YH |
483 | for (i = 0; i < MAX_BEARERS; i++) { |
484 | if (!n_ptr->links[i]) | |
485 | continue; | |
486 | link_info.dest = htonl(n_ptr->addr); | |
487 | link_info.up = htonl(tipc_link_is_up(n_ptr->links[i])); | |
488 | strcpy(link_info.str, n_ptr->links[i]->name); | |
489 | tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, | |
4323add6 | 490 | &link_info, sizeof(link_info)); |
c4307285 | 491 | } |
1aad72d6 | 492 | tipc_node_unlock(n_ptr); |
b97bf3fd PL |
493 | } |
494 | ||
1aad72d6 | 495 | read_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
496 | return buf; |
497 | } |