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 | |
a635b46b AS |
42 | #define NODE_HTABLE_SIZE 512 |
43 | ||
6c00055a DM |
44 | static void node_lost_contact(struct tipc_node *n_ptr); |
45 | static void node_established_contact(struct tipc_node *n_ptr); | |
b97bf3fd | 46 | |
2ecb0924 AS |
47 | static DEFINE_SPINLOCK(node_create_lock); |
48 | ||
672d99e1 AS |
49 | static struct hlist_head node_htable[NODE_HTABLE_SIZE]; |
50 | LIST_HEAD(tipc_node_list); | |
51 | static u32 tipc_num_nodes; | |
34e46258 AS |
52 | |
53 | static atomic_t tipc_num_links = ATOMIC_INIT(0); | |
b97bf3fd | 54 | |
a635b46b AS |
55 | /* |
56 | * 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 | */ | |
872f24db | 61 | static unsigned int tipc_hashfn(u32 addr) |
a635b46b AS |
62 | { |
63 | return addr & (NODE_HTABLE_SIZE - 1); | |
64 | } | |
65 | ||
1ec2bb08 | 66 | /* |
672d99e1 AS |
67 | * tipc_node_find - locate specified node object, if it exists |
68 | */ | |
672d99e1 AS |
69 | struct tipc_node *tipc_node_find(u32 addr) |
70 | { | |
71 | struct tipc_node *node; | |
72 | struct hlist_node *pos; | |
73 | ||
336ebf5b | 74 | if (unlikely(!in_own_cluster_exact(addr))) |
672d99e1 AS |
75 | return NULL; |
76 | ||
77 | hlist_for_each_entry(node, pos, &node_htable[tipc_hashfn(addr)], hash) { | |
78 | if (node->addr == addr) | |
79 | return node; | |
80 | } | |
81 | return NULL; | |
82 | } | |
83 | ||
2ecb0924 AS |
84 | /** |
85 | * tipc_node_create - create neighboring node | |
86 | * | |
87 | * Currently, this routine is called by neighbor discovery code, which holds | |
88 | * net_lock for reading only. We must take node_create_lock to ensure a node | |
89 | * isn't created twice if two different bearers discover the node at the same | |
90 | * time. (It would be preferable to switch to holding net_lock in write mode, | |
91 | * but this is a non-trivial change.) | |
92 | */ | |
6c00055a | 93 | struct tipc_node *tipc_node_create(u32 addr) |
b97bf3fd | 94 | { |
672d99e1 | 95 | struct tipc_node *n_ptr, *temp_node; |
b97bf3fd | 96 | |
2ecb0924 AS |
97 | spin_lock_bh(&node_create_lock); |
98 | ||
5af54792 AS |
99 | n_ptr = tipc_node_find(addr); |
100 | if (n_ptr) { | |
101 | spin_unlock_bh(&node_create_lock); | |
102 | return n_ptr; | |
2ecb0924 AS |
103 | } |
104 | ||
5af54792 | 105 | n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC); |
a10bd924 | 106 | if (!n_ptr) { |
2ecb0924 | 107 | spin_unlock_bh(&node_create_lock); |
2cf8aa19 | 108 | pr_warn("Node creation failed, no memory\n"); |
a10bd924 AS |
109 | return NULL; |
110 | } | |
111 | ||
a10bd924 | 112 | n_ptr->addr = addr; |
51a8e4de | 113 | spin_lock_init(&n_ptr->lock); |
672d99e1 AS |
114 | INIT_HLIST_NODE(&n_ptr->hash); |
115 | INIT_LIST_HEAD(&n_ptr->list); | |
a10bd924 | 116 | INIT_LIST_HEAD(&n_ptr->nsub); |
8f92df6a | 117 | |
672d99e1 AS |
118 | hlist_add_head(&n_ptr->hash, &node_htable[tipc_hashfn(addr)]); |
119 | ||
120 | list_for_each_entry(temp_node, &tipc_node_list, list) { | |
121 | if (n_ptr->addr < temp_node->addr) | |
122 | break; | |
123 | } | |
124 | list_add_tail(&n_ptr->list, &temp_node->list); | |
b4b56102 | 125 | n_ptr->block_setup = WAIT_PEER_DOWN; |
fc0eea69 | 126 | n_ptr->signature = INVALID_NODE_SIG; |
672d99e1 AS |
127 | |
128 | tipc_num_nodes++; | |
a10bd924 | 129 | |
2ecb0924 | 130 | spin_unlock_bh(&node_create_lock); |
b97bf3fd PL |
131 | return n_ptr; |
132 | } | |
133 | ||
6c00055a | 134 | void tipc_node_delete(struct tipc_node *n_ptr) |
b97bf3fd | 135 | { |
672d99e1 AS |
136 | list_del(&n_ptr->list); |
137 | hlist_del(&n_ptr->hash); | |
b97bf3fd | 138 | kfree(n_ptr); |
8f92df6a | 139 | |
672d99e1 | 140 | tipc_num_nodes--; |
b97bf3fd PL |
141 | } |
142 | ||
b97bf3fd | 143 | /** |
4323add6 | 144 | * tipc_node_link_up - handle addition of link |
c4307285 | 145 | * |
b97bf3fd PL |
146 | * Link becomes active (alone or shared) or standby, depending on its priority. |
147 | */ | |
a18c4bc3 | 148 | void tipc_node_link_up(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 149 | { |
a18c4bc3 | 150 | struct tipc_link **active = &n_ptr->active_links[0]; |
b97bf3fd | 151 | |
5392d646 AS |
152 | n_ptr->working_links++; |
153 | ||
2cf8aa19 EH |
154 | pr_info("Established link <%s> on network plane %c\n", |
155 | l_ptr->name, l_ptr->b_ptr->net_plane); | |
c4307285 | 156 | |
b97bf3fd | 157 | if (!active[0]) { |
b97bf3fd PL |
158 | active[0] = active[1] = l_ptr; |
159 | node_established_contact(n_ptr); | |
160 | return; | |
161 | } | |
c4307285 | 162 | if (l_ptr->priority < active[0]->priority) { |
2cf8aa19 | 163 | pr_info("New link <%s> becomes standby\n", l_ptr->name); |
b97bf3fd PL |
164 | return; |
165 | } | |
4323add6 | 166 | tipc_link_send_duplicate(active[0], l_ptr); |
c4307285 | 167 | if (l_ptr->priority == active[0]->priority) { |
b97bf3fd PL |
168 | active[0] = l_ptr; |
169 | return; | |
170 | } | |
2cf8aa19 | 171 | pr_info("Old link <%s> becomes standby\n", active[0]->name); |
a10bd924 | 172 | if (active[1] != active[0]) |
2cf8aa19 | 173 | pr_info("Old link <%s> becomes standby\n", active[1]->name); |
b97bf3fd PL |
174 | active[0] = active[1] = l_ptr; |
175 | } | |
176 | ||
177 | /** | |
178 | * node_select_active_links - select active link | |
179 | */ | |
6c00055a | 180 | static void node_select_active_links(struct tipc_node *n_ptr) |
b97bf3fd | 181 | { |
a18c4bc3 | 182 | struct tipc_link **active = &n_ptr->active_links[0]; |
b97bf3fd PL |
183 | u32 i; |
184 | u32 highest_prio = 0; | |
185 | ||
c4307285 | 186 | active[0] = active[1] = NULL; |
b97bf3fd PL |
187 | |
188 | for (i = 0; i < MAX_BEARERS; i++) { | |
a18c4bc3 | 189 | struct tipc_link *l_ptr = n_ptr->links[i]; |
b97bf3fd | 190 | |
4323add6 | 191 | if (!l_ptr || !tipc_link_is_up(l_ptr) || |
b97bf3fd PL |
192 | (l_ptr->priority < highest_prio)) |
193 | continue; | |
194 | ||
195 | if (l_ptr->priority > highest_prio) { | |
c4307285 | 196 | highest_prio = l_ptr->priority; |
b97bf3fd PL |
197 | active[0] = active[1] = l_ptr; |
198 | } else { | |
199 | active[1] = l_ptr; | |
200 | } | |
201 | } | |
202 | } | |
203 | ||
204 | /** | |
4323add6 | 205 | * tipc_node_link_down - handle loss of link |
b97bf3fd | 206 | */ |
a18c4bc3 | 207 | void tipc_node_link_down(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 208 | { |
a18c4bc3 | 209 | struct tipc_link **active; |
b97bf3fd | 210 | |
5392d646 AS |
211 | n_ptr->working_links--; |
212 | ||
4323add6 | 213 | if (!tipc_link_is_active(l_ptr)) { |
2cf8aa19 EH |
214 | pr_info("Lost standby link <%s> on network plane %c\n", |
215 | l_ptr->name, l_ptr->b_ptr->net_plane); | |
b97bf3fd PL |
216 | return; |
217 | } | |
2cf8aa19 | 218 | pr_info("Lost link <%s> on network plane %c\n", |
b97bf3fd PL |
219 | l_ptr->name, l_ptr->b_ptr->net_plane); |
220 | ||
221 | active = &n_ptr->active_links[0]; | |
222 | if (active[0] == l_ptr) | |
223 | active[0] = active[1]; | |
224 | if (active[1] == l_ptr) | |
225 | active[1] = active[0]; | |
226 | if (active[0] == l_ptr) | |
227 | node_select_active_links(n_ptr); | |
c4307285 | 228 | if (tipc_node_is_up(n_ptr)) |
4323add6 | 229 | tipc_link_changeover(l_ptr); |
c4307285 | 230 | else |
b97bf3fd PL |
231 | node_lost_contact(n_ptr); |
232 | } | |
233 | ||
8f19afb2 | 234 | int tipc_node_active_links(struct tipc_node *n_ptr) |
b97bf3fd | 235 | { |
76ae0d71 | 236 | return n_ptr->active_links[0] != NULL; |
b97bf3fd PL |
237 | } |
238 | ||
8f19afb2 | 239 | int tipc_node_redundant_links(struct tipc_node *n_ptr) |
b97bf3fd | 240 | { |
a02cec21 | 241 | return n_ptr->working_links > 1; |
b97bf3fd PL |
242 | } |
243 | ||
6c00055a | 244 | int tipc_node_is_up(struct tipc_node *n_ptr) |
b97bf3fd | 245 | { |
8f19afb2 | 246 | return tipc_node_active_links(n_ptr); |
b97bf3fd PL |
247 | } |
248 | ||
a18c4bc3 | 249 | void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 250 | { |
37b9c08a AS |
251 | n_ptr->links[l_ptr->b_ptr->identity] = l_ptr; |
252 | atomic_inc(&tipc_num_links); | |
253 | n_ptr->link_cnt++; | |
b97bf3fd PL |
254 | } |
255 | ||
a18c4bc3 | 256 | void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 257 | { |
1fc54d8f | 258 | n_ptr->links[l_ptr->b_ptr->identity] = NULL; |
d1bcb115 | 259 | atomic_dec(&tipc_num_links); |
b97bf3fd PL |
260 | n_ptr->link_cnt--; |
261 | } | |
262 | ||
6c00055a | 263 | static void node_established_contact(struct tipc_node *n_ptr) |
b97bf3fd | 264 | { |
51a8e4de | 265 | tipc_k_signal((Handler)tipc_named_node_up, n_ptr->addr); |
b97bf3fd | 266 | |
93499313 | 267 | if (n_ptr->bclink.supportable) { |
75aba9af | 268 | n_ptr->bclink.acked = tipc_bclink_get_last_sent(); |
cd3decdf | 269 | tipc_bclink_add_node(n_ptr->addr); |
93499313 | 270 | n_ptr->bclink.supported = 1; |
b97bf3fd | 271 | } |
b97bf3fd PL |
272 | } |
273 | ||
b4b56102 | 274 | static void node_name_purge_complete(unsigned long node_addr) |
5a68d5ee AS |
275 | { |
276 | struct tipc_node *n_ptr; | |
277 | ||
278 | read_lock_bh(&tipc_net_lock); | |
279 | n_ptr = tipc_node_find(node_addr); | |
280 | if (n_ptr) { | |
281 | tipc_node_lock(n_ptr); | |
b4b56102 | 282 | n_ptr->block_setup &= ~WAIT_NAMES_GONE; |
5a68d5ee AS |
283 | tipc_node_unlock(n_ptr); |
284 | } | |
285 | read_unlock_bh(&tipc_net_lock); | |
286 | } | |
287 | ||
6c00055a | 288 | static void node_lost_contact(struct tipc_node *n_ptr) |
b97bf3fd | 289 | { |
b97bf3fd PL |
290 | char addr_string[16]; |
291 | u32 i; | |
292 | ||
2cf8aa19 EH |
293 | pr_info("Lost contact with %s\n", |
294 | tipc_addr_string_fill(addr_string, n_ptr->addr)); | |
c5bd4d85 AS |
295 | |
296 | /* Flush broadcast link info associated with lost node */ | |
51a8e4de | 297 | if (n_ptr->bclink.supported) { |
c5bd4d85 AS |
298 | while (n_ptr->bclink.deferred_head) { |
299 | struct sk_buff *buf = n_ptr->bclink.deferred_head; | |
300 | n_ptr->bclink.deferred_head = buf->next; | |
5f6d9123 | 301 | kfree_skb(buf); |
c5bd4d85 | 302 | } |
7a54d4a9 | 303 | n_ptr->bclink.deferred_size = 0; |
c5bd4d85 AS |
304 | |
305 | if (n_ptr->bclink.defragm) { | |
5f6d9123 | 306 | kfree_skb(n_ptr->bclink.defragm); |
c5bd4d85 AS |
307 | n_ptr->bclink.defragm = NULL; |
308 | } | |
309 | ||
cd3decdf | 310 | tipc_bclink_remove_node(n_ptr->addr); |
36559591 | 311 | tipc_bclink_acknowledge(n_ptr, INVALID_LINK_SEQ); |
b97bf3fd | 312 | |
c5bd4d85 AS |
313 | n_ptr->bclink.supported = 0; |
314 | } | |
b97bf3fd PL |
315 | |
316 | /* Abort link changeover */ | |
317 | for (i = 0; i < MAX_BEARERS; i++) { | |
a18c4bc3 | 318 | struct tipc_link *l_ptr = n_ptr->links[i]; |
c4307285 | 319 | if (!l_ptr) |
b97bf3fd PL |
320 | continue; |
321 | l_ptr->reset_checkpoint = l_ptr->next_in_no; | |
322 | l_ptr->exp_msg_count = 0; | |
4323add6 | 323 | tipc_link_reset_fragments(l_ptr); |
b97bf3fd PL |
324 | } |
325 | ||
326 | /* Notify subscribers */ | |
f1379173 | 327 | tipc_nodesub_notify(n_ptr); |
5a68d5ee | 328 | |
b4b56102 | 329 | /* Prevent re-contact with node until cleanup is done */ |
b4b56102 AS |
330 | n_ptr->block_setup = WAIT_PEER_DOWN | WAIT_NAMES_GONE; |
331 | tipc_k_signal((Handler)node_name_purge_complete, n_ptr->addr); | |
b97bf3fd PL |
332 | } |
333 | ||
4323add6 | 334 | struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space) |
b97bf3fd PL |
335 | { |
336 | u32 domain; | |
337 | struct sk_buff *buf; | |
6c00055a | 338 | struct tipc_node *n_ptr; |
c4307285 | 339 | struct tipc_node_info node_info; |
ea13847b | 340 | u32 payload_size; |
b97bf3fd PL |
341 | |
342 | if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR)) | |
4323add6 | 343 | return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); |
b97bf3fd | 344 | |
3e6c8cd5 | 345 | domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area)); |
4323add6 PL |
346 | if (!tipc_addr_domain_valid(domain)) |
347 | return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE | |
348 | " (network address)"); | |
b97bf3fd | 349 | |
1aad72d6 | 350 | read_lock_bh(&tipc_net_lock); |
672d99e1 | 351 | if (!tipc_num_nodes) { |
1aad72d6 | 352 | read_unlock_bh(&tipc_net_lock); |
c4307285 | 353 | return tipc_cfg_reply_none(); |
1aad72d6 | 354 | } |
b97bf3fd | 355 | |
08c80e9a | 356 | /* For now, get space for all other nodes */ |
672d99e1 | 357 | payload_size = TLV_SPACE(sizeof(node_info)) * tipc_num_nodes; |
1aad72d6 AS |
358 | if (payload_size > 32768u) { |
359 | read_unlock_bh(&tipc_net_lock); | |
ea13847b AS |
360 | return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED |
361 | " (too many nodes)"); | |
1aad72d6 | 362 | } |
ea13847b | 363 | buf = tipc_cfg_reply_alloc(payload_size); |
1aad72d6 AS |
364 | if (!buf) { |
365 | read_unlock_bh(&tipc_net_lock); | |
b97bf3fd | 366 | return NULL; |
1aad72d6 | 367 | } |
b97bf3fd PL |
368 | |
369 | /* Add TLVs for all nodes in scope */ | |
672d99e1 AS |
370 | list_for_each_entry(n_ptr, &tipc_node_list, list) { |
371 | if (!tipc_in_scope(domain, n_ptr->addr)) | |
b97bf3fd | 372 | continue; |
c4307285 YH |
373 | node_info.addr = htonl(n_ptr->addr); |
374 | node_info.up = htonl(tipc_node_is_up(n_ptr)); | |
375 | tipc_cfg_append_tlv(buf, TIPC_TLV_NODE_INFO, | |
4323add6 | 376 | &node_info, sizeof(node_info)); |
b97bf3fd PL |
377 | } |
378 | ||
1aad72d6 | 379 | read_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
380 | return buf; |
381 | } | |
382 | ||
4323add6 | 383 | struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space) |
b97bf3fd PL |
384 | { |
385 | u32 domain; | |
386 | struct sk_buff *buf; | |
6c00055a | 387 | struct tipc_node *n_ptr; |
c4307285 | 388 | struct tipc_link_info link_info; |
ea13847b | 389 | u32 payload_size; |
b97bf3fd PL |
390 | |
391 | if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR)) | |
4323add6 | 392 | return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); |
b97bf3fd | 393 | |
3e6c8cd5 | 394 | domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area)); |
4323add6 PL |
395 | if (!tipc_addr_domain_valid(domain)) |
396 | return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE | |
397 | " (network address)"); | |
b97bf3fd | 398 | |
b58343f9 | 399 | if (!tipc_own_addr) |
c4307285 YH |
400 | return tipc_cfg_reply_none(); |
401 | ||
1aad72d6 AS |
402 | read_lock_bh(&tipc_net_lock); |
403 | ||
7a54d4a9 | 404 | /* Get space for all unicast links + broadcast link */ |
9df3b7eb | 405 | payload_size = TLV_SPACE(sizeof(link_info)) * |
d1bcb115 | 406 | (atomic_read(&tipc_num_links) + 1); |
1aad72d6 AS |
407 | if (payload_size > 32768u) { |
408 | read_unlock_bh(&tipc_net_lock); | |
ea13847b AS |
409 | return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED |
410 | " (too many links)"); | |
1aad72d6 | 411 | } |
ea13847b | 412 | buf = tipc_cfg_reply_alloc(payload_size); |
1aad72d6 AS |
413 | if (!buf) { |
414 | read_unlock_bh(&tipc_net_lock); | |
b97bf3fd | 415 | return NULL; |
1aad72d6 | 416 | } |
b97bf3fd PL |
417 | |
418 | /* Add TLV for broadcast link */ | |
a3796f89 | 419 | link_info.dest = htonl(tipc_cluster_mask(tipc_own_addr)); |
c4307285 | 420 | link_info.up = htonl(1); |
4b704d59 | 421 | strlcpy(link_info.str, tipc_bclink_name, TIPC_MAX_LINK_NAME); |
4323add6 | 422 | tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, &link_info, sizeof(link_info)); |
b97bf3fd PL |
423 | |
424 | /* Add TLVs for any other links in scope */ | |
672d99e1 | 425 | list_for_each_entry(n_ptr, &tipc_node_list, list) { |
c4307285 | 426 | u32 i; |
b97bf3fd | 427 | |
672d99e1 | 428 | if (!tipc_in_scope(domain, n_ptr->addr)) |
b97bf3fd | 429 | continue; |
1aad72d6 | 430 | tipc_node_lock(n_ptr); |
c4307285 YH |
431 | for (i = 0; i < MAX_BEARERS; i++) { |
432 | if (!n_ptr->links[i]) | |
433 | continue; | |
434 | link_info.dest = htonl(n_ptr->addr); | |
435 | link_info.up = htonl(tipc_link_is_up(n_ptr->links[i])); | |
436 | strcpy(link_info.str, n_ptr->links[i]->name); | |
437 | tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, | |
4323add6 | 438 | &link_info, sizeof(link_info)); |
c4307285 | 439 | } |
1aad72d6 | 440 | tipc_node_unlock(n_ptr); |
b97bf3fd PL |
441 | } |
442 | ||
1aad72d6 | 443 | read_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
444 | return buf; |
445 | } |