]>
Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/node.c: TIPC node management routines | |
c4307285 | 3 | * |
c64f7a6a | 4 | * Copyright (c) 2000-2006, 2012 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; | |
672d99e1 | 72 | |
336ebf5b | 73 | if (unlikely(!in_own_cluster_exact(addr))) |
672d99e1 AS |
74 | return NULL; |
75 | ||
b67bfe0d | 76 | hlist_for_each_entry(node, &node_htable[tipc_hashfn(addr)], hash) { |
672d99e1 AS |
77 | if (node->addr == addr) |
78 | return node; | |
79 | } | |
80 | return NULL; | |
81 | } | |
82 | ||
2ecb0924 AS |
83 | /** |
84 | * 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 | */ | |
6c00055a | 92 | struct tipc_node *tipc_node_create(u32 addr) |
b97bf3fd | 93 | { |
672d99e1 | 94 | struct tipc_node *n_ptr, *temp_node; |
b97bf3fd | 95 | |
2ecb0924 AS |
96 | spin_lock_bh(&node_create_lock); |
97 | ||
5af54792 | 98 | n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC); |
a10bd924 | 99 | if (!n_ptr) { |
2ecb0924 | 100 | spin_unlock_bh(&node_create_lock); |
2cf8aa19 | 101 | pr_warn("Node creation failed, no memory\n"); |
a10bd924 AS |
102 | return NULL; |
103 | } | |
104 | ||
a10bd924 | 105 | n_ptr->addr = addr; |
51a8e4de | 106 | spin_lock_init(&n_ptr->lock); |
672d99e1 AS |
107 | INIT_HLIST_NODE(&n_ptr->hash); |
108 | INIT_LIST_HEAD(&n_ptr->list); | |
a10bd924 | 109 | INIT_LIST_HEAD(&n_ptr->nsub); |
8f92df6a | 110 | |
672d99e1 AS |
111 | hlist_add_head(&n_ptr->hash, &node_htable[tipc_hashfn(addr)]); |
112 | ||
113 | list_for_each_entry(temp_node, &tipc_node_list, list) { | |
114 | if (n_ptr->addr < temp_node->addr) | |
115 | break; | |
116 | } | |
117 | list_add_tail(&n_ptr->list, &temp_node->list); | |
b4b56102 | 118 | n_ptr->block_setup = WAIT_PEER_DOWN; |
fc0eea69 | 119 | n_ptr->signature = INVALID_NODE_SIG; |
672d99e1 AS |
120 | |
121 | tipc_num_nodes++; | |
a10bd924 | 122 | |
2ecb0924 | 123 | spin_unlock_bh(&node_create_lock); |
b97bf3fd PL |
124 | return n_ptr; |
125 | } | |
126 | ||
6c00055a | 127 | void tipc_node_delete(struct tipc_node *n_ptr) |
b97bf3fd | 128 | { |
672d99e1 AS |
129 | list_del(&n_ptr->list); |
130 | hlist_del(&n_ptr->hash); | |
b97bf3fd | 131 | kfree(n_ptr); |
8f92df6a | 132 | |
672d99e1 | 133 | tipc_num_nodes--; |
b97bf3fd PL |
134 | } |
135 | ||
b97bf3fd | 136 | /** |
4323add6 | 137 | * tipc_node_link_up - handle addition of link |
c4307285 | 138 | * |
b97bf3fd PL |
139 | * Link becomes active (alone or shared) or standby, depending on its priority. |
140 | */ | |
a18c4bc3 | 141 | void tipc_node_link_up(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 142 | { |
a18c4bc3 | 143 | struct tipc_link **active = &n_ptr->active_links[0]; |
b97bf3fd | 144 | |
5392d646 AS |
145 | n_ptr->working_links++; |
146 | ||
2cf8aa19 EH |
147 | pr_info("Established link <%s> on network plane %c\n", |
148 | l_ptr->name, l_ptr->b_ptr->net_plane); | |
c4307285 | 149 | |
b97bf3fd | 150 | if (!active[0]) { |
b97bf3fd PL |
151 | active[0] = active[1] = l_ptr; |
152 | node_established_contact(n_ptr); | |
153 | return; | |
154 | } | |
c4307285 | 155 | if (l_ptr->priority < active[0]->priority) { |
2cf8aa19 | 156 | pr_info("New link <%s> becomes standby\n", l_ptr->name); |
b97bf3fd PL |
157 | return; |
158 | } | |
247f0f3c | 159 | tipc_link_dup_queue_xmit(active[0], l_ptr); |
c4307285 | 160 | if (l_ptr->priority == active[0]->priority) { |
b97bf3fd PL |
161 | active[0] = l_ptr; |
162 | return; | |
163 | } | |
2cf8aa19 | 164 | pr_info("Old link <%s> becomes standby\n", active[0]->name); |
a10bd924 | 165 | if (active[1] != active[0]) |
2cf8aa19 | 166 | pr_info("Old link <%s> becomes standby\n", active[1]->name); |
b97bf3fd PL |
167 | active[0] = active[1] = l_ptr; |
168 | } | |
169 | ||
170 | /** | |
171 | * node_select_active_links - select active link | |
172 | */ | |
6c00055a | 173 | static void node_select_active_links(struct tipc_node *n_ptr) |
b97bf3fd | 174 | { |
a18c4bc3 | 175 | struct tipc_link **active = &n_ptr->active_links[0]; |
b97bf3fd PL |
176 | u32 i; |
177 | u32 highest_prio = 0; | |
178 | ||
c4307285 | 179 | active[0] = active[1] = NULL; |
b97bf3fd PL |
180 | |
181 | for (i = 0; i < MAX_BEARERS; i++) { | |
a18c4bc3 | 182 | struct tipc_link *l_ptr = n_ptr->links[i]; |
b97bf3fd | 183 | |
4323add6 | 184 | if (!l_ptr || !tipc_link_is_up(l_ptr) || |
b97bf3fd PL |
185 | (l_ptr->priority < highest_prio)) |
186 | continue; | |
187 | ||
188 | if (l_ptr->priority > highest_prio) { | |
c4307285 | 189 | highest_prio = l_ptr->priority; |
b97bf3fd PL |
190 | active[0] = active[1] = l_ptr; |
191 | } else { | |
192 | active[1] = l_ptr; | |
193 | } | |
194 | } | |
195 | } | |
196 | ||
197 | /** | |
4323add6 | 198 | * tipc_node_link_down - handle loss of link |
b97bf3fd | 199 | */ |
a18c4bc3 | 200 | void tipc_node_link_down(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 201 | { |
a18c4bc3 | 202 | struct tipc_link **active; |
b97bf3fd | 203 | |
5392d646 AS |
204 | n_ptr->working_links--; |
205 | ||
4323add6 | 206 | if (!tipc_link_is_active(l_ptr)) { |
2cf8aa19 EH |
207 | pr_info("Lost standby link <%s> on network plane %c\n", |
208 | l_ptr->name, l_ptr->b_ptr->net_plane); | |
b97bf3fd PL |
209 | return; |
210 | } | |
2cf8aa19 | 211 | pr_info("Lost link <%s> on network plane %c\n", |
b97bf3fd PL |
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)) |
170b3927 | 222 | tipc_link_failover_send_queue(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 | ||
6c00055a | 232 | int tipc_node_is_up(struct tipc_node *n_ptr) |
b97bf3fd | 233 | { |
8f19afb2 | 234 | return tipc_node_active_links(n_ptr); |
b97bf3fd PL |
235 | } |
236 | ||
a18c4bc3 | 237 | void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 238 | { |
37b9c08a AS |
239 | n_ptr->links[l_ptr->b_ptr->identity] = l_ptr; |
240 | atomic_inc(&tipc_num_links); | |
241 | n_ptr->link_cnt++; | |
b97bf3fd PL |
242 | } |
243 | ||
a18c4bc3 | 244 | void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 245 | { |
7d33939f JPM |
246 | int i; |
247 | ||
248 | for (i = 0; i < MAX_BEARERS; i++) { | |
074bb43e JPM |
249 | if (l_ptr != n_ptr->links[i]) |
250 | continue; | |
251 | n_ptr->links[i] = NULL; | |
252 | atomic_dec(&tipc_num_links); | |
253 | n_ptr->link_cnt--; | |
7d33939f | 254 | } |
b97bf3fd PL |
255 | } |
256 | ||
6c00055a | 257 | static void node_established_contact(struct tipc_node *n_ptr) |
b97bf3fd | 258 | { |
51a8e4de | 259 | tipc_k_signal((Handler)tipc_named_node_up, n_ptr->addr); |
c64f7a6a | 260 | n_ptr->bclink.oos_state = 0; |
818f4da5 YX |
261 | n_ptr->bclink.acked = tipc_bclink_get_last_sent(); |
262 | tipc_bclink_add_node(n_ptr->addr); | |
b97bf3fd PL |
263 | } |
264 | ||
b4b56102 | 265 | static void node_name_purge_complete(unsigned long node_addr) |
5a68d5ee AS |
266 | { |
267 | struct tipc_node *n_ptr; | |
268 | ||
269 | read_lock_bh(&tipc_net_lock); | |
270 | n_ptr = tipc_node_find(node_addr); | |
271 | if (n_ptr) { | |
272 | tipc_node_lock(n_ptr); | |
b4b56102 | 273 | n_ptr->block_setup &= ~WAIT_NAMES_GONE; |
5a68d5ee AS |
274 | tipc_node_unlock(n_ptr); |
275 | } | |
276 | read_unlock_bh(&tipc_net_lock); | |
277 | } | |
278 | ||
6c00055a | 279 | static void node_lost_contact(struct tipc_node *n_ptr) |
b97bf3fd | 280 | { |
b97bf3fd PL |
281 | char addr_string[16]; |
282 | u32 i; | |
283 | ||
2cf8aa19 EH |
284 | pr_info("Lost contact with %s\n", |
285 | tipc_addr_string_fill(addr_string, n_ptr->addr)); | |
c5bd4d85 AS |
286 | |
287 | /* Flush broadcast link info associated with lost node */ | |
389dd9bc | 288 | if (n_ptr->bclink.recv_permitted) { |
d77b3831 | 289 | kfree_skb_list(n_ptr->bclink.deferred_head); |
7a54d4a9 | 290 | n_ptr->bclink.deferred_size = 0; |
c5bd4d85 | 291 | |
40ba3cdf EH |
292 | if (n_ptr->bclink.reasm_head) { |
293 | kfree_skb(n_ptr->bclink.reasm_head); | |
294 | n_ptr->bclink.reasm_head = NULL; | |
295 | n_ptr->bclink.reasm_tail = NULL; | |
c5bd4d85 AS |
296 | } |
297 | ||
cd3decdf | 298 | tipc_bclink_remove_node(n_ptr->addr); |
36559591 | 299 | tipc_bclink_acknowledge(n_ptr, INVALID_LINK_SEQ); |
b97bf3fd | 300 | |
389dd9bc | 301 | n_ptr->bclink.recv_permitted = false; |
c5bd4d85 | 302 | } |
b97bf3fd PL |
303 | |
304 | /* Abort link changeover */ | |
305 | for (i = 0; i < MAX_BEARERS; i++) { | |
a18c4bc3 | 306 | struct tipc_link *l_ptr = n_ptr->links[i]; |
c4307285 | 307 | if (!l_ptr) |
b97bf3fd PL |
308 | continue; |
309 | l_ptr->reset_checkpoint = l_ptr->next_in_no; | |
310 | l_ptr->exp_msg_count = 0; | |
4323add6 | 311 | tipc_link_reset_fragments(l_ptr); |
b97bf3fd PL |
312 | } |
313 | ||
314 | /* Notify subscribers */ | |
f1379173 | 315 | tipc_nodesub_notify(n_ptr); |
5a68d5ee | 316 | |
b4b56102 | 317 | /* Prevent re-contact with node until cleanup is done */ |
b4b56102 AS |
318 | n_ptr->block_setup = WAIT_PEER_DOWN | WAIT_NAMES_GONE; |
319 | tipc_k_signal((Handler)node_name_purge_complete, n_ptr->addr); | |
b97bf3fd PL |
320 | } |
321 | ||
4323add6 | 322 | struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space) |
b97bf3fd PL |
323 | { |
324 | u32 domain; | |
325 | struct sk_buff *buf; | |
6c00055a | 326 | struct tipc_node *n_ptr; |
c4307285 | 327 | struct tipc_node_info node_info; |
ea13847b | 328 | u32 payload_size; |
b97bf3fd PL |
329 | |
330 | if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR)) | |
4323add6 | 331 | return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); |
b97bf3fd | 332 | |
3e6c8cd5 | 333 | domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area)); |
4323add6 PL |
334 | if (!tipc_addr_domain_valid(domain)) |
335 | return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE | |
336 | " (network address)"); | |
b97bf3fd | 337 | |
1aad72d6 | 338 | read_lock_bh(&tipc_net_lock); |
672d99e1 | 339 | if (!tipc_num_nodes) { |
1aad72d6 | 340 | read_unlock_bh(&tipc_net_lock); |
c4307285 | 341 | return tipc_cfg_reply_none(); |
1aad72d6 | 342 | } |
b97bf3fd | 343 | |
08c80e9a | 344 | /* For now, get space for all other nodes */ |
672d99e1 | 345 | payload_size = TLV_SPACE(sizeof(node_info)) * tipc_num_nodes; |
1aad72d6 AS |
346 | if (payload_size > 32768u) { |
347 | read_unlock_bh(&tipc_net_lock); | |
ea13847b AS |
348 | return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED |
349 | " (too many nodes)"); | |
1aad72d6 | 350 | } |
ea13847b | 351 | buf = tipc_cfg_reply_alloc(payload_size); |
1aad72d6 AS |
352 | if (!buf) { |
353 | read_unlock_bh(&tipc_net_lock); | |
b97bf3fd | 354 | return NULL; |
1aad72d6 | 355 | } |
b97bf3fd PL |
356 | |
357 | /* Add TLVs for all nodes in scope */ | |
672d99e1 AS |
358 | list_for_each_entry(n_ptr, &tipc_node_list, list) { |
359 | if (!tipc_in_scope(domain, n_ptr->addr)) | |
b97bf3fd | 360 | continue; |
c4307285 YH |
361 | node_info.addr = htonl(n_ptr->addr); |
362 | node_info.up = htonl(tipc_node_is_up(n_ptr)); | |
363 | tipc_cfg_append_tlv(buf, TIPC_TLV_NODE_INFO, | |
4323add6 | 364 | &node_info, sizeof(node_info)); |
b97bf3fd PL |
365 | } |
366 | ||
1aad72d6 | 367 | read_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
368 | return buf; |
369 | } | |
370 | ||
4323add6 | 371 | struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space) |
b97bf3fd PL |
372 | { |
373 | u32 domain; | |
374 | struct sk_buff *buf; | |
6c00055a | 375 | struct tipc_node *n_ptr; |
c4307285 | 376 | struct tipc_link_info link_info; |
ea13847b | 377 | u32 payload_size; |
b97bf3fd PL |
378 | |
379 | if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR)) | |
4323add6 | 380 | return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); |
b97bf3fd | 381 | |
3e6c8cd5 | 382 | domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area)); |
4323add6 PL |
383 | if (!tipc_addr_domain_valid(domain)) |
384 | return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE | |
385 | " (network address)"); | |
b97bf3fd | 386 | |
b58343f9 | 387 | if (!tipc_own_addr) |
c4307285 YH |
388 | return tipc_cfg_reply_none(); |
389 | ||
1aad72d6 AS |
390 | read_lock_bh(&tipc_net_lock); |
391 | ||
7a54d4a9 | 392 | /* Get space for all unicast links + broadcast link */ |
9df3b7eb | 393 | payload_size = TLV_SPACE(sizeof(link_info)) * |
d1bcb115 | 394 | (atomic_read(&tipc_num_links) + 1); |
1aad72d6 AS |
395 | if (payload_size > 32768u) { |
396 | read_unlock_bh(&tipc_net_lock); | |
ea13847b AS |
397 | return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED |
398 | " (too many links)"); | |
1aad72d6 | 399 | } |
ea13847b | 400 | buf = tipc_cfg_reply_alloc(payload_size); |
1aad72d6 AS |
401 | if (!buf) { |
402 | read_unlock_bh(&tipc_net_lock); | |
b97bf3fd | 403 | return NULL; |
1aad72d6 | 404 | } |
b97bf3fd PL |
405 | |
406 | /* Add TLV for broadcast link */ | |
a3796f89 | 407 | link_info.dest = htonl(tipc_cluster_mask(tipc_own_addr)); |
c4307285 | 408 | link_info.up = htonl(1); |
4b704d59 | 409 | strlcpy(link_info.str, tipc_bclink_name, TIPC_MAX_LINK_NAME); |
4323add6 | 410 | tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, &link_info, sizeof(link_info)); |
b97bf3fd PL |
411 | |
412 | /* Add TLVs for any other links in scope */ | |
672d99e1 | 413 | list_for_each_entry(n_ptr, &tipc_node_list, list) { |
c4307285 | 414 | u32 i; |
b97bf3fd | 415 | |
672d99e1 | 416 | if (!tipc_in_scope(domain, n_ptr->addr)) |
b97bf3fd | 417 | continue; |
1aad72d6 | 418 | tipc_node_lock(n_ptr); |
c4307285 YH |
419 | for (i = 0; i < MAX_BEARERS; i++) { |
420 | if (!n_ptr->links[i]) | |
421 | continue; | |
422 | link_info.dest = htonl(n_ptr->addr); | |
423 | link_info.up = htonl(tipc_link_is_up(n_ptr->links[i])); | |
424 | strcpy(link_info.str, n_ptr->links[i]->name); | |
425 | tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, | |
4323add6 | 426 | &link_info, sizeof(link_info)); |
c4307285 | 427 | } |
1aad72d6 | 428 | tipc_node_unlock(n_ptr); |
b97bf3fd PL |
429 | } |
430 | ||
1aad72d6 | 431 | read_unlock_bh(&tipc_net_lock); |
b97bf3fd PL |
432 | return buf; |
433 | } |