]>
Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/node.c: TIPC node management routines | |
c4307285 | 3 | * |
dd3f9e70 | 4 | * Copyright (c) 2000-2006, 2012-2015, Ericsson AB |
46651c59 | 5 | * Copyright (c) 2005-2006, 2010-2014, 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" | |
22ae7cff | 38 | #include "link.h" |
b97bf3fd | 39 | #include "node.h" |
b97bf3fd | 40 | #include "name_distr.h" |
50100a5e | 41 | #include "socket.h" |
a6bf70f7 | 42 | #include "bcast.h" |
b97bf3fd | 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); | |
8a0f6ebe | 46 | static void tipc_node_delete(struct tipc_node *node); |
b97bf3fd | 47 | |
02be61a9 JPM |
48 | struct tipc_sock_conn { |
49 | u32 port; | |
50 | u32 peer_port; | |
51 | u32 peer_node; | |
52 | struct list_head list; | |
53 | }; | |
54 | ||
3e4b6ab5 RA |
55 | static const struct nla_policy tipc_nl_node_policy[TIPC_NLA_NODE_MAX + 1] = { |
56 | [TIPC_NLA_NODE_UNSPEC] = { .type = NLA_UNSPEC }, | |
57 | [TIPC_NLA_NODE_ADDR] = { .type = NLA_U32 }, | |
58 | [TIPC_NLA_NODE_UP] = { .type = NLA_FLAG } | |
59 | }; | |
60 | ||
a635b46b AS |
61 | /* |
62 | * A trivial power-of-two bitmask technique is used for speed, since this | |
63 | * operation is done for every incoming TIPC packet. The number of hash table | |
64 | * entries has been chosen so that no hash chain exceeds 8 nodes and will | |
65 | * usually be much smaller (typically only a single node). | |
66 | */ | |
872f24db | 67 | static unsigned int tipc_hashfn(u32 addr) |
a635b46b AS |
68 | { |
69 | return addr & (NODE_HTABLE_SIZE - 1); | |
70 | } | |
71 | ||
8a0f6ebe YX |
72 | static void tipc_node_kref_release(struct kref *kref) |
73 | { | |
74 | struct tipc_node *node = container_of(kref, struct tipc_node, kref); | |
75 | ||
76 | tipc_node_delete(node); | |
77 | } | |
78 | ||
79 | void tipc_node_put(struct tipc_node *node) | |
80 | { | |
81 | kref_put(&node->kref, tipc_node_kref_release); | |
82 | } | |
83 | ||
84 | static void tipc_node_get(struct tipc_node *node) | |
85 | { | |
86 | kref_get(&node->kref); | |
87 | } | |
88 | ||
1ec2bb08 | 89 | /* |
672d99e1 AS |
90 | * tipc_node_find - locate specified node object, if it exists |
91 | */ | |
f2f9800d | 92 | struct tipc_node *tipc_node_find(struct net *net, u32 addr) |
672d99e1 | 93 | { |
f2f9800d | 94 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
672d99e1 | 95 | struct tipc_node *node; |
672d99e1 | 96 | |
34747539 | 97 | if (unlikely(!in_own_cluster_exact(net, addr))) |
672d99e1 AS |
98 | return NULL; |
99 | ||
6c7a762e | 100 | rcu_read_lock(); |
f2f9800d YX |
101 | hlist_for_each_entry_rcu(node, &tn->node_htable[tipc_hashfn(addr)], |
102 | hash) { | |
46651c59 | 103 | if (node->addr == addr) { |
8a0f6ebe | 104 | tipc_node_get(node); |
6c7a762e | 105 | rcu_read_unlock(); |
672d99e1 | 106 | return node; |
46651c59 | 107 | } |
672d99e1 | 108 | } |
6c7a762e | 109 | rcu_read_unlock(); |
672d99e1 AS |
110 | return NULL; |
111 | } | |
112 | ||
f2f9800d | 113 | struct tipc_node *tipc_node_create(struct net *net, u32 addr) |
b97bf3fd | 114 | { |
f2f9800d | 115 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
672d99e1 | 116 | struct tipc_node *n_ptr, *temp_node; |
b97bf3fd | 117 | |
f2f9800d | 118 | spin_lock_bh(&tn->node_list_lock); |
b45db71b JPM |
119 | n_ptr = tipc_node_find(net, addr); |
120 | if (n_ptr) | |
121 | goto exit; | |
5af54792 | 122 | n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC); |
a10bd924 | 123 | if (!n_ptr) { |
2cf8aa19 | 124 | pr_warn("Node creation failed, no memory\n"); |
b45db71b | 125 | goto exit; |
a10bd924 | 126 | } |
a10bd924 | 127 | n_ptr->addr = addr; |
f2f9800d | 128 | n_ptr->net = net; |
8a0f6ebe | 129 | kref_init(&n_ptr->kref); |
51a8e4de | 130 | spin_lock_init(&n_ptr->lock); |
672d99e1 AS |
131 | INIT_HLIST_NODE(&n_ptr->hash); |
132 | INIT_LIST_HEAD(&n_ptr->list); | |
a8f48af5 | 133 | INIT_LIST_HEAD(&n_ptr->publ_list); |
02be61a9 | 134 | INIT_LIST_HEAD(&n_ptr->conn_sks); |
05dcc5aa | 135 | __skb_queue_head_init(&n_ptr->bclink.deferdq); |
f2f9800d | 136 | hlist_add_head_rcu(&n_ptr->hash, &tn->node_htable[tipc_hashfn(addr)]); |
f2f9800d | 137 | list_for_each_entry_rcu(temp_node, &tn->node_list, list) { |
672d99e1 AS |
138 | if (n_ptr->addr < temp_node->addr) |
139 | break; | |
140 | } | |
6c7a762e | 141 | list_add_tail_rcu(&n_ptr->list, &temp_node->list); |
aecb9bb8 | 142 | n_ptr->action_flags = TIPC_WAIT_PEER_LINKS_DOWN; |
fc0eea69 | 143 | n_ptr->signature = INVALID_NODE_SIG; |
8a0f6ebe | 144 | tipc_node_get(n_ptr); |
b45db71b | 145 | exit: |
f2f9800d | 146 | spin_unlock_bh(&tn->node_list_lock); |
b97bf3fd PL |
147 | return n_ptr; |
148 | } | |
149 | ||
8a0f6ebe | 150 | static void tipc_node_delete(struct tipc_node *node) |
b97bf3fd | 151 | { |
8a0f6ebe YX |
152 | list_del_rcu(&node->list); |
153 | hlist_del_rcu(&node->hash); | |
154 | kfree_rcu(node, rcu); | |
b97bf3fd PL |
155 | } |
156 | ||
f2f9800d | 157 | void tipc_node_stop(struct net *net) |
46651c59 | 158 | { |
f2f9800d | 159 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
46651c59 YX |
160 | struct tipc_node *node, *t_node; |
161 | ||
f2f9800d YX |
162 | spin_lock_bh(&tn->node_list_lock); |
163 | list_for_each_entry_safe(node, t_node, &tn->node_list, list) | |
8a0f6ebe | 164 | tipc_node_put(node); |
f2f9800d | 165 | spin_unlock_bh(&tn->node_list_lock); |
46651c59 YX |
166 | } |
167 | ||
f2f9800d | 168 | int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port) |
02be61a9 JPM |
169 | { |
170 | struct tipc_node *node; | |
171 | struct tipc_sock_conn *conn; | |
8a0f6ebe | 172 | int err = 0; |
02be61a9 | 173 | |
34747539 | 174 | if (in_own_node(net, dnode)) |
02be61a9 JPM |
175 | return 0; |
176 | ||
f2f9800d | 177 | node = tipc_node_find(net, dnode); |
02be61a9 JPM |
178 | if (!node) { |
179 | pr_warn("Connecting sock to node 0x%x failed\n", dnode); | |
180 | return -EHOSTUNREACH; | |
181 | } | |
182 | conn = kmalloc(sizeof(*conn), GFP_ATOMIC); | |
8a0f6ebe YX |
183 | if (!conn) { |
184 | err = -EHOSTUNREACH; | |
185 | goto exit; | |
186 | } | |
02be61a9 JPM |
187 | conn->peer_node = dnode; |
188 | conn->port = port; | |
189 | conn->peer_port = peer_port; | |
190 | ||
191 | tipc_node_lock(node); | |
192 | list_add_tail(&conn->list, &node->conn_sks); | |
193 | tipc_node_unlock(node); | |
8a0f6ebe YX |
194 | exit: |
195 | tipc_node_put(node); | |
196 | return err; | |
02be61a9 JPM |
197 | } |
198 | ||
f2f9800d | 199 | void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port) |
02be61a9 JPM |
200 | { |
201 | struct tipc_node *node; | |
202 | struct tipc_sock_conn *conn, *safe; | |
203 | ||
34747539 | 204 | if (in_own_node(net, dnode)) |
02be61a9 JPM |
205 | return; |
206 | ||
f2f9800d | 207 | node = tipc_node_find(net, dnode); |
02be61a9 JPM |
208 | if (!node) |
209 | return; | |
210 | ||
211 | tipc_node_lock(node); | |
212 | list_for_each_entry_safe(conn, safe, &node->conn_sks, list) { | |
213 | if (port != conn->port) | |
214 | continue; | |
215 | list_del(&conn->list); | |
216 | kfree(conn); | |
217 | } | |
218 | tipc_node_unlock(node); | |
8a0f6ebe | 219 | tipc_node_put(node); |
02be61a9 JPM |
220 | } |
221 | ||
b97bf3fd | 222 | /** |
4323add6 | 223 | * tipc_node_link_up - handle addition of link |
c4307285 | 224 | * |
b97bf3fd PL |
225 | * Link becomes active (alone or shared) or standby, depending on its priority. |
226 | */ | |
9d13ec65 | 227 | void tipc_node_link_up(struct tipc_node *n, int bearer_id) |
b97bf3fd | 228 | { |
9d13ec65 JPM |
229 | struct tipc_link_entry **actv = &n->active_links[0]; |
230 | struct tipc_link_entry *le = &n->links[bearer_id]; | |
231 | struct tipc_link *l = le->link; | |
b97bf3fd | 232 | |
9d13ec65 JPM |
233 | /* Leave room for tunnel header when returning 'mtu' to users: */ |
234 | n->links[bearer_id].mtu = l->mtu - INT_H_SIZE; | |
235 | ||
236 | n->working_links++; | |
237 | n->action_flags |= TIPC_NOTIFY_LINK_UP; | |
238 | n->link_id = l->peer_bearer_id << 16 | l->bearer_id; | |
7b8613e0 | 239 | |
3fa9cacd | 240 | pr_debug("Established link <%s> on network plane %c\n", |
9d13ec65 | 241 | l->name, l->net_plane); |
c4307285 | 242 | |
9d13ec65 JPM |
243 | /* No active links ? => take both active slots */ |
244 | if (!actv[0]) { | |
245 | actv[0] = le; | |
246 | actv[1] = le; | |
247 | node_established_contact(n); | |
248 | return; | |
b97bf3fd | 249 | } |
9d13ec65 JPM |
250 | if (l->priority < actv[0]->link->priority) { |
251 | pr_debug("New link <%s> becomes standby\n", l->name); | |
252 | return; | |
b97bf3fd | 253 | } |
9d13ec65 JPM |
254 | tipc_link_dup_queue_xmit(actv[0]->link, l); |
255 | ||
256 | /* Take one active slot if applicable */ | |
257 | if (l->priority == actv[0]->link->priority) { | |
258 | actv[0] = le; | |
259 | return; | |
b97bf3fd | 260 | } |
9d13ec65 JPM |
261 | /* Higher prio than current active? => take both active slots */ |
262 | pr_debug("Old l <%s> becomes standby\n", actv[0]->link->name); | |
263 | if (actv[1] != actv[0]) | |
264 | pr_debug("Old link <%s> now standby\n", actv[1]->link->name); | |
265 | actv[0] = le; | |
266 | actv[1] = le; | |
b97bf3fd PL |
267 | } |
268 | ||
269 | /** | |
9d13ec65 | 270 | * node_select_active_links - select which working links should be active |
b97bf3fd | 271 | */ |
9d13ec65 | 272 | static void node_select_active_links(struct tipc_node *n) |
b97bf3fd | 273 | { |
9d13ec65 JPM |
274 | struct tipc_link_entry **actv = &n->active_links[0]; |
275 | struct tipc_link *l; | |
276 | u32 b, highest = 0; | |
b97bf3fd | 277 | |
9d13ec65 JPM |
278 | actv[0] = NULL; |
279 | actv[1] = NULL; | |
b97bf3fd | 280 | |
9d13ec65 JPM |
281 | for (b = 0; b < MAX_BEARERS; b++) { |
282 | l = n->links[b].link; | |
283 | if (!l || !tipc_link_is_up(l) || (l->priority < highest)) | |
284 | continue; | |
285 | if (l->priority > highest) { | |
286 | highest = l->priority; | |
287 | actv[0] = &n->links[b]; | |
288 | actv[1] = &n->links[b]; | |
b97bf3fd | 289 | continue; |
b97bf3fd | 290 | } |
9d13ec65 | 291 | actv[1] = &n->links[b]; |
b97bf3fd PL |
292 | } |
293 | } | |
294 | ||
295 | /** | |
4323add6 | 296 | * tipc_node_link_down - handle loss of link |
b97bf3fd | 297 | */ |
9d13ec65 | 298 | void tipc_node_link_down(struct tipc_node *n, int bearer_id) |
b97bf3fd | 299 | { |
9d13ec65 JPM |
300 | struct tipc_link_entry **actv = &n->active_links[0]; |
301 | struct tipc_link_entry *le = &n->links[bearer_id]; | |
302 | struct tipc_link *l = le->link; | |
b97bf3fd | 303 | |
9d13ec65 JPM |
304 | n->working_links--; |
305 | n->action_flags |= TIPC_NOTIFY_LINK_DOWN; | |
306 | n->link_id = l->peer_bearer_id << 16 | l->bearer_id; | |
5392d646 | 307 | |
9d13ec65 | 308 | if (!tipc_link_is_active(l)) { |
3fa9cacd | 309 | pr_debug("Lost standby link <%s> on network plane %c\n", |
9d13ec65 | 310 | l->name, l->net_plane); |
b97bf3fd PL |
311 | return; |
312 | } | |
3fa9cacd | 313 | pr_debug("Lost link <%s> on network plane %c\n", |
9d13ec65 | 314 | l->name, l->net_plane); |
16e166b8 | 315 | |
9d13ec65 JPM |
316 | /* Resdistribute active slots if applicable */ |
317 | if (actv[0] == le) | |
318 | actv[0] = actv[1]; | |
319 | if (actv[1] == le) | |
320 | actv[1] = actv[0]; | |
b97bf3fd | 321 | |
9d13ec65 JPM |
322 | /* Last link of this priority? => select other ones if available */ |
323 | if (actv[0] == le) | |
324 | node_select_active_links(n); | |
325 | ||
326 | if (tipc_node_is_up(n)) | |
327 | tipc_link_failover_send_queue(l); | |
328 | else | |
329 | node_lost_contact(n); | |
b97bf3fd PL |
330 | } |
331 | ||
9d13ec65 | 332 | bool tipc_node_is_up(struct tipc_node *n) |
b97bf3fd | 333 | { |
9d13ec65 | 334 | return n->active_links[0]; |
b97bf3fd PL |
335 | } |
336 | ||
a18c4bc3 | 337 | void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 338 | { |
9d13ec65 | 339 | n_ptr->links[l_ptr->bearer_id].link = l_ptr; |
37b9c08a | 340 | n_ptr->link_cnt++; |
b97bf3fd PL |
341 | } |
342 | ||
a18c4bc3 | 343 | void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 344 | { |
7d33939f JPM |
345 | int i; |
346 | ||
347 | for (i = 0; i < MAX_BEARERS; i++) { | |
9d13ec65 | 348 | if (l_ptr != n_ptr->links[i].link) |
074bb43e | 349 | continue; |
9d13ec65 | 350 | n_ptr->links[i].link = NULL; |
074bb43e | 351 | n_ptr->link_cnt--; |
7d33939f | 352 | } |
b97bf3fd PL |
353 | } |
354 | ||
6c00055a | 355 | static void node_established_contact(struct tipc_node *n_ptr) |
b97bf3fd | 356 | { |
aecb9bb8 | 357 | n_ptr->action_flags |= TIPC_NOTIFY_NODE_UP; |
c64f7a6a | 358 | n_ptr->bclink.oos_state = 0; |
1da46568 YX |
359 | n_ptr->bclink.acked = tipc_bclink_get_last_sent(n_ptr->net); |
360 | tipc_bclink_add_node(n_ptr->net, n_ptr->addr); | |
b97bf3fd PL |
361 | } |
362 | ||
6c00055a | 363 | static void node_lost_contact(struct tipc_node *n_ptr) |
b97bf3fd | 364 | { |
b97bf3fd | 365 | char addr_string[16]; |
708ac32c JPM |
366 | struct tipc_sock_conn *conn, *safe; |
367 | struct list_head *conns = &n_ptr->conn_sks; | |
368 | struct sk_buff *skb; | |
369 | struct tipc_net *tn = net_generic(n_ptr->net, tipc_net_id); | |
370 | uint i; | |
b97bf3fd | 371 | |
3fa9cacd EH |
372 | pr_debug("Lost contact with %s\n", |
373 | tipc_addr_string_fill(addr_string, n_ptr->addr)); | |
c5bd4d85 AS |
374 | |
375 | /* Flush broadcast link info associated with lost node */ | |
389dd9bc | 376 | if (n_ptr->bclink.recv_permitted) { |
05dcc5aa | 377 | __skb_queue_purge(&n_ptr->bclink.deferdq); |
c5bd4d85 | 378 | |
37e22164 JPM |
379 | if (n_ptr->bclink.reasm_buf) { |
380 | kfree_skb(n_ptr->bclink.reasm_buf); | |
381 | n_ptr->bclink.reasm_buf = NULL; | |
c5bd4d85 AS |
382 | } |
383 | ||
1da46568 | 384 | tipc_bclink_remove_node(n_ptr->net, n_ptr->addr); |
36559591 | 385 | tipc_bclink_acknowledge(n_ptr, INVALID_LINK_SEQ); |
b97bf3fd | 386 | |
389dd9bc | 387 | n_ptr->bclink.recv_permitted = false; |
c5bd4d85 | 388 | } |
b97bf3fd | 389 | |
dff29b1a | 390 | /* Abort any ongoing link failover */ |
b97bf3fd | 391 | for (i = 0; i < MAX_BEARERS; i++) { |
9d13ec65 | 392 | struct tipc_link *l_ptr = n_ptr->links[i].link; |
c4307285 | 393 | if (!l_ptr) |
b97bf3fd | 394 | continue; |
dff29b1a JPM |
395 | l_ptr->flags &= ~LINK_FAILINGOVER; |
396 | l_ptr->failover_checkpt = 0; | |
397 | l_ptr->failover_pkts = 0; | |
398 | kfree_skb(l_ptr->failover_skb); | |
399 | l_ptr->failover_skb = NULL; | |
4323add6 | 400 | tipc_link_reset_fragments(l_ptr); |
b97bf3fd PL |
401 | } |
402 | ||
ca9cf06a YX |
403 | n_ptr->action_flags &= ~TIPC_WAIT_OWN_LINKS_DOWN; |
404 | ||
708ac32c JPM |
405 | /* Prevent re-contact with node until cleanup is done */ |
406 | n_ptr->action_flags |= TIPC_WAIT_PEER_LINKS_DOWN; | |
407 | ||
408 | /* Notify publications from this node */ | |
409 | n_ptr->action_flags |= TIPC_NOTIFY_NODE_DOWN; | |
410 | ||
411 | /* Notify sockets connected to node */ | |
412 | list_for_each_entry_safe(conn, safe, conns, list) { | |
413 | skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG, | |
414 | SHORT_H_SIZE, 0, tn->own_addr, | |
415 | conn->peer_node, conn->port, | |
416 | conn->peer_port, TIPC_ERR_NO_NODE); | |
417 | if (likely(skb)) { | |
418 | skb_queue_tail(n_ptr->inputq, skb); | |
419 | n_ptr->action_flags |= TIPC_MSG_EVT; | |
420 | } | |
421 | list_del(&conn->list); | |
422 | kfree(conn); | |
423 | } | |
b97bf3fd PL |
424 | } |
425 | ||
78acb1f9 EH |
426 | /** |
427 | * tipc_node_get_linkname - get the name of a link | |
428 | * | |
429 | * @bearer_id: id of the bearer | |
430 | * @node: peer node address | |
431 | * @linkname: link name output buffer | |
432 | * | |
433 | * Returns 0 on success | |
434 | */ | |
f2f9800d YX |
435 | int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr, |
436 | char *linkname, size_t len) | |
78acb1f9 EH |
437 | { |
438 | struct tipc_link *link; | |
8a0f6ebe | 439 | int err = -EINVAL; |
f2f9800d | 440 | struct tipc_node *node = tipc_node_find(net, addr); |
78acb1f9 | 441 | |
8a0f6ebe YX |
442 | if (!node) |
443 | return err; | |
444 | ||
445 | if (bearer_id >= MAX_BEARERS) | |
446 | goto exit; | |
447 | ||
78acb1f9 | 448 | tipc_node_lock(node); |
9d13ec65 | 449 | link = node->links[bearer_id].link; |
78acb1f9 EH |
450 | if (link) { |
451 | strncpy(linkname, link->name, len); | |
8a0f6ebe | 452 | err = 0; |
78acb1f9 | 453 | } |
8a0f6ebe | 454 | exit: |
78acb1f9 | 455 | tipc_node_unlock(node); |
8a0f6ebe YX |
456 | tipc_node_put(node); |
457 | return err; | |
78acb1f9 | 458 | } |
9db9fdd1 YX |
459 | |
460 | void tipc_node_unlock(struct tipc_node *node) | |
461 | { | |
f2f9800d | 462 | struct net *net = node->net; |
ca0c4273 | 463 | u32 addr = 0; |
c637c103 | 464 | u32 flags = node->action_flags; |
7b8613e0 | 465 | u32 link_id = 0; |
708ac32c | 466 | struct list_head *publ_list; |
c637c103 | 467 | struct sk_buff_head *inputq = node->inputq; |
708ac32c | 468 | struct sk_buff_head *namedq; |
9db9fdd1 | 469 | |
c637c103 JPM |
470 | if (likely(!flags || (flags == TIPC_MSG_EVT))) { |
471 | node->action_flags = 0; | |
9db9fdd1 | 472 | spin_unlock_bh(&node->lock); |
c637c103 JPM |
473 | if (flags == TIPC_MSG_EVT) |
474 | tipc_sk_rcv(net, inputq); | |
9db9fdd1 YX |
475 | return; |
476 | } | |
477 | ||
7b8613e0 YX |
478 | addr = node->addr; |
479 | link_id = node->link_id; | |
c637c103 | 480 | namedq = node->namedq; |
708ac32c | 481 | publ_list = &node->publ_list; |
7b8613e0 | 482 | |
cb1b7280 JPM |
483 | node->action_flags &= ~(TIPC_MSG_EVT | |
484 | TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP | | |
485 | TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP | | |
486 | TIPC_WAKEUP_BCAST_USERS | TIPC_BCAST_MSG_EVT | | |
b952b2be | 487 | TIPC_NAMED_MSG_EVT | TIPC_BCAST_RESET); |
7b8613e0 | 488 | |
9db9fdd1 YX |
489 | spin_unlock_bh(&node->lock); |
490 | ||
708ac32c JPM |
491 | if (flags & TIPC_NOTIFY_NODE_DOWN) |
492 | tipc_publ_notify(net, publ_list, addr); | |
50100a5e | 493 | |
908344cd | 494 | if (flags & TIPC_WAKEUP_BCAST_USERS) |
f2f9800d | 495 | tipc_bclink_wakeup_users(net); |
908344cd | 496 | |
7b8613e0 | 497 | if (flags & TIPC_NOTIFY_NODE_UP) |
f2f9800d | 498 | tipc_named_node_up(net, addr); |
7b8613e0 YX |
499 | |
500 | if (flags & TIPC_NOTIFY_LINK_UP) | |
f2f9800d | 501 | tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr, |
7b8613e0 YX |
502 | TIPC_NODE_SCOPE, link_id, addr); |
503 | ||
504 | if (flags & TIPC_NOTIFY_LINK_DOWN) | |
f2f9800d | 505 | tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr, |
7b8613e0 | 506 | link_id, addr); |
c637c103 JPM |
507 | |
508 | if (flags & TIPC_MSG_EVT) | |
509 | tipc_sk_rcv(net, inputq); | |
510 | ||
511 | if (flags & TIPC_NAMED_MSG_EVT) | |
512 | tipc_named_rcv(net, namedq); | |
cb1b7280 JPM |
513 | |
514 | if (flags & TIPC_BCAST_MSG_EVT) | |
515 | tipc_bclink_input(net); | |
b952b2be YX |
516 | |
517 | if (flags & TIPC_BCAST_RESET) | |
518 | tipc_link_reset_all(node); | |
9db9fdd1 | 519 | } |
3e4b6ab5 RA |
520 | |
521 | /* Caller should hold node lock for the passed node */ | |
d8182804 | 522 | static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node) |
3e4b6ab5 RA |
523 | { |
524 | void *hdr; | |
525 | struct nlattr *attrs; | |
526 | ||
bfb3e5dd | 527 | hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family, |
3e4b6ab5 RA |
528 | NLM_F_MULTI, TIPC_NL_NODE_GET); |
529 | if (!hdr) | |
530 | return -EMSGSIZE; | |
531 | ||
532 | attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE); | |
533 | if (!attrs) | |
534 | goto msg_full; | |
535 | ||
536 | if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr)) | |
537 | goto attr_msg_full; | |
538 | if (tipc_node_is_up(node)) | |
539 | if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP)) | |
540 | goto attr_msg_full; | |
541 | ||
542 | nla_nest_end(msg->skb, attrs); | |
543 | genlmsg_end(msg->skb, hdr); | |
544 | ||
545 | return 0; | |
546 | ||
547 | attr_msg_full: | |
548 | nla_nest_cancel(msg->skb, attrs); | |
549 | msg_full: | |
550 | genlmsg_cancel(msg->skb, hdr); | |
551 | ||
552 | return -EMSGSIZE; | |
553 | } | |
554 | ||
555 | int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb) | |
556 | { | |
557 | int err; | |
f2f9800d YX |
558 | struct net *net = sock_net(skb->sk); |
559 | struct tipc_net *tn = net_generic(net, tipc_net_id); | |
3e4b6ab5 RA |
560 | int done = cb->args[0]; |
561 | int last_addr = cb->args[1]; | |
562 | struct tipc_node *node; | |
563 | struct tipc_nl_msg msg; | |
564 | ||
565 | if (done) | |
566 | return 0; | |
567 | ||
568 | msg.skb = skb; | |
569 | msg.portid = NETLINK_CB(cb->skb).portid; | |
570 | msg.seq = cb->nlh->nlmsg_seq; | |
571 | ||
572 | rcu_read_lock(); | |
8a0f6ebe YX |
573 | if (last_addr) { |
574 | node = tipc_node_find(net, last_addr); | |
575 | if (!node) { | |
576 | rcu_read_unlock(); | |
577 | /* We never set seq or call nl_dump_check_consistent() | |
578 | * this means that setting prev_seq here will cause the | |
579 | * consistence check to fail in the netlink callback | |
580 | * handler. Resulting in the NLMSG_DONE message having | |
581 | * the NLM_F_DUMP_INTR flag set if the node state | |
582 | * changed while we released the lock. | |
583 | */ | |
584 | cb->prev_seq = 1; | |
585 | return -EPIPE; | |
586 | } | |
587 | tipc_node_put(node); | |
3e4b6ab5 RA |
588 | } |
589 | ||
f2f9800d | 590 | list_for_each_entry_rcu(node, &tn->node_list, list) { |
3e4b6ab5 RA |
591 | if (last_addr) { |
592 | if (node->addr == last_addr) | |
593 | last_addr = 0; | |
594 | else | |
595 | continue; | |
596 | } | |
597 | ||
598 | tipc_node_lock(node); | |
599 | err = __tipc_nl_add_node(&msg, node); | |
600 | if (err) { | |
601 | last_addr = node->addr; | |
602 | tipc_node_unlock(node); | |
603 | goto out; | |
604 | } | |
605 | ||
606 | tipc_node_unlock(node); | |
607 | } | |
608 | done = 1; | |
609 | out: | |
610 | cb->args[0] = done; | |
611 | cb->args[1] = last_addr; | |
612 | rcu_read_unlock(); | |
613 | ||
614 | return skb->len; | |
615 | } |