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); |
d39bbd44 | 135 | skb_queue_head_init(&n_ptr->bclink.namedq); |
05dcc5aa | 136 | __skb_queue_head_init(&n_ptr->bclink.deferdq); |
f2f9800d | 137 | hlist_add_head_rcu(&n_ptr->hash, &tn->node_htable[tipc_hashfn(addr)]); |
f2f9800d | 138 | list_for_each_entry_rcu(temp_node, &tn->node_list, list) { |
672d99e1 AS |
139 | if (n_ptr->addr < temp_node->addr) |
140 | break; | |
141 | } | |
6c7a762e | 142 | list_add_tail_rcu(&n_ptr->list, &temp_node->list); |
aecb9bb8 | 143 | n_ptr->action_flags = TIPC_WAIT_PEER_LINKS_DOWN; |
fc0eea69 | 144 | n_ptr->signature = INVALID_NODE_SIG; |
36e78a46 JPM |
145 | n_ptr->active_links[0] = INVALID_BEARER_ID; |
146 | n_ptr->active_links[1] = INVALID_BEARER_ID; | |
8a0f6ebe | 147 | tipc_node_get(n_ptr); |
b45db71b | 148 | exit: |
f2f9800d | 149 | spin_unlock_bh(&tn->node_list_lock); |
b97bf3fd PL |
150 | return n_ptr; |
151 | } | |
152 | ||
8a0f6ebe | 153 | static void tipc_node_delete(struct tipc_node *node) |
b97bf3fd | 154 | { |
8a0f6ebe YX |
155 | list_del_rcu(&node->list); |
156 | hlist_del_rcu(&node->hash); | |
157 | kfree_rcu(node, rcu); | |
b97bf3fd PL |
158 | } |
159 | ||
f2f9800d | 160 | void tipc_node_stop(struct net *net) |
46651c59 | 161 | { |
f2f9800d | 162 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
46651c59 YX |
163 | struct tipc_node *node, *t_node; |
164 | ||
f2f9800d YX |
165 | spin_lock_bh(&tn->node_list_lock); |
166 | list_for_each_entry_safe(node, t_node, &tn->node_list, list) | |
8a0f6ebe | 167 | tipc_node_put(node); |
f2f9800d | 168 | spin_unlock_bh(&tn->node_list_lock); |
46651c59 YX |
169 | } |
170 | ||
f2f9800d | 171 | int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port) |
02be61a9 JPM |
172 | { |
173 | struct tipc_node *node; | |
174 | struct tipc_sock_conn *conn; | |
8a0f6ebe | 175 | int err = 0; |
02be61a9 | 176 | |
34747539 | 177 | if (in_own_node(net, dnode)) |
02be61a9 JPM |
178 | return 0; |
179 | ||
f2f9800d | 180 | node = tipc_node_find(net, dnode); |
02be61a9 JPM |
181 | if (!node) { |
182 | pr_warn("Connecting sock to node 0x%x failed\n", dnode); | |
183 | return -EHOSTUNREACH; | |
184 | } | |
185 | conn = kmalloc(sizeof(*conn), GFP_ATOMIC); | |
8a0f6ebe YX |
186 | if (!conn) { |
187 | err = -EHOSTUNREACH; | |
188 | goto exit; | |
189 | } | |
02be61a9 JPM |
190 | conn->peer_node = dnode; |
191 | conn->port = port; | |
192 | conn->peer_port = peer_port; | |
193 | ||
194 | tipc_node_lock(node); | |
195 | list_add_tail(&conn->list, &node->conn_sks); | |
196 | tipc_node_unlock(node); | |
8a0f6ebe YX |
197 | exit: |
198 | tipc_node_put(node); | |
199 | return err; | |
02be61a9 JPM |
200 | } |
201 | ||
f2f9800d | 202 | void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port) |
02be61a9 JPM |
203 | { |
204 | struct tipc_node *node; | |
205 | struct tipc_sock_conn *conn, *safe; | |
206 | ||
34747539 | 207 | if (in_own_node(net, dnode)) |
02be61a9 JPM |
208 | return; |
209 | ||
f2f9800d | 210 | node = tipc_node_find(net, dnode); |
02be61a9 JPM |
211 | if (!node) |
212 | return; | |
213 | ||
214 | tipc_node_lock(node); | |
215 | list_for_each_entry_safe(conn, safe, &node->conn_sks, list) { | |
216 | if (port != conn->port) | |
217 | continue; | |
218 | list_del(&conn->list); | |
219 | kfree(conn); | |
220 | } | |
221 | tipc_node_unlock(node); | |
8a0f6ebe | 222 | tipc_node_put(node); |
02be61a9 JPM |
223 | } |
224 | ||
b97bf3fd | 225 | /** |
4323add6 | 226 | * tipc_node_link_up - handle addition of link |
c4307285 | 227 | * |
b97bf3fd PL |
228 | * Link becomes active (alone or shared) or standby, depending on its priority. |
229 | */ | |
9d13ec65 | 230 | void tipc_node_link_up(struct tipc_node *n, int bearer_id) |
b97bf3fd | 231 | { |
36e78a46 JPM |
232 | int *slot0 = &n->active_links[0]; |
233 | int *slot1 = &n->active_links[1]; | |
234 | struct tipc_link_entry *links = n->links; | |
235 | struct tipc_link *l = n->links[bearer_id].link; | |
b97bf3fd | 236 | |
9d13ec65 | 237 | /* Leave room for tunnel header when returning 'mtu' to users: */ |
36e78a46 | 238 | links[bearer_id].mtu = l->mtu - INT_H_SIZE; |
9d13ec65 JPM |
239 | |
240 | n->working_links++; | |
241 | n->action_flags |= TIPC_NOTIFY_LINK_UP; | |
242 | n->link_id = l->peer_bearer_id << 16 | l->bearer_id; | |
7b8613e0 | 243 | |
3fa9cacd | 244 | pr_debug("Established link <%s> on network plane %c\n", |
9d13ec65 | 245 | l->name, l->net_plane); |
c4307285 | 246 | |
9d13ec65 | 247 | /* No active links ? => take both active slots */ |
36e78a46 JPM |
248 | if (*slot0 < 0) { |
249 | *slot0 = bearer_id; | |
250 | *slot1 = bearer_id; | |
9d13ec65 JPM |
251 | node_established_contact(n); |
252 | return; | |
b97bf3fd | 253 | } |
36e78a46 JPM |
254 | |
255 | /* Lower prio than current active ? => no slot */ | |
256 | if (l->priority < links[*slot0].link->priority) { | |
9d13ec65 JPM |
257 | pr_debug("New link <%s> becomes standby\n", l->name); |
258 | return; | |
b97bf3fd | 259 | } |
36e78a46 | 260 | tipc_link_dup_queue_xmit(links[*slot0].link, l); |
9d13ec65 | 261 | |
36e78a46 JPM |
262 | /* Same prio as current active ? => take one slot */ |
263 | if (l->priority == links[*slot0].link->priority) { | |
264 | *slot0 = bearer_id; | |
9d13ec65 | 265 | return; |
b97bf3fd | 266 | } |
b97bf3fd | 267 | |
36e78a46 JPM |
268 | /* Higher prio than current active => take both active slots */ |
269 | pr_debug("Old link <%s> now standby\n", links[*slot0].link->name); | |
270 | *slot0 = bearer_id; | |
271 | *slot1 = bearer_id; | |
b97bf3fd PL |
272 | } |
273 | ||
274 | /** | |
4323add6 | 275 | * tipc_node_link_down - handle loss of link |
b97bf3fd | 276 | */ |
9d13ec65 | 277 | void tipc_node_link_down(struct tipc_node *n, int bearer_id) |
b97bf3fd | 278 | { |
36e78a46 JPM |
279 | int *slot0 = &n->active_links[0]; |
280 | int *slot1 = &n->active_links[1]; | |
281 | int i, highest = 0; | |
282 | struct tipc_link *l, *_l; | |
b97bf3fd | 283 | |
36e78a46 | 284 | l = n->links[bearer_id].link; |
9d13ec65 JPM |
285 | n->working_links--; |
286 | n->action_flags |= TIPC_NOTIFY_LINK_DOWN; | |
287 | n->link_id = l->peer_bearer_id << 16 | l->bearer_id; | |
5392d646 | 288 | |
3fa9cacd | 289 | pr_debug("Lost link <%s> on network plane %c\n", |
9d13ec65 | 290 | l->name, l->net_plane); |
16e166b8 | 291 | |
36e78a46 JPM |
292 | /* Select new active link if any available */ |
293 | *slot0 = INVALID_BEARER_ID; | |
294 | *slot1 = INVALID_BEARER_ID; | |
295 | for (i = 0; i < MAX_BEARERS; i++) { | |
296 | _l = n->links[i].link; | |
297 | if (!_l || !tipc_link_is_up(_l)) | |
298 | continue; | |
299 | if (_l->priority < highest) | |
300 | continue; | |
301 | if (_l->priority > highest) { | |
302 | highest = _l->priority; | |
303 | *slot0 = i; | |
304 | *slot1 = i; | |
305 | continue; | |
306 | } | |
307 | *slot1 = i; | |
308 | } | |
9d13ec65 JPM |
309 | if (tipc_node_is_up(n)) |
310 | tipc_link_failover_send_queue(l); | |
311 | else | |
312 | node_lost_contact(n); | |
b97bf3fd PL |
313 | } |
314 | ||
9d13ec65 | 315 | bool tipc_node_is_up(struct tipc_node *n) |
b97bf3fd | 316 | { |
36e78a46 | 317 | return n->active_links[0] != INVALID_BEARER_ID; |
b97bf3fd PL |
318 | } |
319 | ||
d3a43b90 JPM |
320 | void tipc_node_check_dest(struct tipc_node *n, struct tipc_bearer *b, |
321 | bool *link_up, bool *addr_match, | |
322 | struct tipc_media_addr *maddr) | |
323 | { | |
324 | struct tipc_link *l = n->links[b->identity].link; | |
325 | struct tipc_media_addr *curr = &n->links[b->identity].maddr; | |
326 | ||
327 | *link_up = l && tipc_link_is_up(l); | |
328 | *addr_match = l && !memcmp(curr, maddr, sizeof(*maddr)); | |
329 | } | |
330 | ||
331 | bool tipc_node_update_dest(struct tipc_node *n, struct tipc_bearer *b, | |
332 | struct tipc_media_addr *maddr) | |
333 | { | |
334 | struct tipc_link *l = n->links[b->identity].link; | |
335 | struct tipc_media_addr *curr = &n->links[b->identity].maddr; | |
d39bbd44 | 336 | struct sk_buff_head *inputq = &n->links[b->identity].inputq; |
d3a43b90 JPM |
337 | |
338 | if (!l) | |
d39bbd44 | 339 | l = tipc_link_create(n, b, maddr, inputq, &n->bclink.namedq); |
d3a43b90 JPM |
340 | if (!l) |
341 | return false; | |
342 | memcpy(&l->media_addr, maddr, sizeof(*maddr)); | |
343 | memcpy(curr, maddr, sizeof(*maddr)); | |
344 | tipc_link_reset(l); | |
345 | return true; | |
346 | } | |
347 | ||
a18c4bc3 | 348 | void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 349 | { |
9d13ec65 | 350 | n_ptr->links[l_ptr->bearer_id].link = l_ptr; |
37b9c08a | 351 | n_ptr->link_cnt++; |
b97bf3fd PL |
352 | } |
353 | ||
a18c4bc3 | 354 | void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr) |
b97bf3fd | 355 | { |
7d33939f JPM |
356 | int i; |
357 | ||
358 | for (i = 0; i < MAX_BEARERS; i++) { | |
9d13ec65 | 359 | if (l_ptr != n_ptr->links[i].link) |
074bb43e | 360 | continue; |
9d13ec65 | 361 | n_ptr->links[i].link = NULL; |
074bb43e | 362 | n_ptr->link_cnt--; |
7d33939f | 363 | } |
b97bf3fd PL |
364 | } |
365 | ||
6c00055a | 366 | static void node_established_contact(struct tipc_node *n_ptr) |
b97bf3fd | 367 | { |
aecb9bb8 | 368 | n_ptr->action_flags |= TIPC_NOTIFY_NODE_UP; |
c64f7a6a | 369 | n_ptr->bclink.oos_state = 0; |
1da46568 YX |
370 | n_ptr->bclink.acked = tipc_bclink_get_last_sent(n_ptr->net); |
371 | tipc_bclink_add_node(n_ptr->net, n_ptr->addr); | |
b97bf3fd PL |
372 | } |
373 | ||
6c00055a | 374 | static void node_lost_contact(struct tipc_node *n_ptr) |
b97bf3fd | 375 | { |
b97bf3fd | 376 | char addr_string[16]; |
708ac32c JPM |
377 | struct tipc_sock_conn *conn, *safe; |
378 | struct list_head *conns = &n_ptr->conn_sks; | |
379 | struct sk_buff *skb; | |
380 | struct tipc_net *tn = net_generic(n_ptr->net, tipc_net_id); | |
381 | uint i; | |
b97bf3fd | 382 | |
3fa9cacd EH |
383 | pr_debug("Lost contact with %s\n", |
384 | tipc_addr_string_fill(addr_string, n_ptr->addr)); | |
c5bd4d85 AS |
385 | |
386 | /* Flush broadcast link info associated with lost node */ | |
389dd9bc | 387 | if (n_ptr->bclink.recv_permitted) { |
05dcc5aa | 388 | __skb_queue_purge(&n_ptr->bclink.deferdq); |
c5bd4d85 | 389 | |
37e22164 JPM |
390 | if (n_ptr->bclink.reasm_buf) { |
391 | kfree_skb(n_ptr->bclink.reasm_buf); | |
392 | n_ptr->bclink.reasm_buf = NULL; | |
c5bd4d85 AS |
393 | } |
394 | ||
1da46568 | 395 | tipc_bclink_remove_node(n_ptr->net, n_ptr->addr); |
36559591 | 396 | tipc_bclink_acknowledge(n_ptr, INVALID_LINK_SEQ); |
b97bf3fd | 397 | |
389dd9bc | 398 | n_ptr->bclink.recv_permitted = false; |
c5bd4d85 | 399 | } |
b97bf3fd | 400 | |
dff29b1a | 401 | /* Abort any ongoing link failover */ |
b97bf3fd | 402 | for (i = 0; i < MAX_BEARERS; i++) { |
9d13ec65 | 403 | struct tipc_link *l_ptr = n_ptr->links[i].link; |
c4307285 | 404 | if (!l_ptr) |
b97bf3fd | 405 | continue; |
d3504c34 | 406 | l_ptr->exec_mode = TIPC_LINK_OPEN; |
dff29b1a JPM |
407 | l_ptr->failover_checkpt = 0; |
408 | l_ptr->failover_pkts = 0; | |
409 | kfree_skb(l_ptr->failover_skb); | |
410 | l_ptr->failover_skb = NULL; | |
4323add6 | 411 | tipc_link_reset_fragments(l_ptr); |
b97bf3fd PL |
412 | } |
413 | ||
ca9cf06a YX |
414 | n_ptr->action_flags &= ~TIPC_WAIT_OWN_LINKS_DOWN; |
415 | ||
708ac32c JPM |
416 | /* Prevent re-contact with node until cleanup is done */ |
417 | n_ptr->action_flags |= TIPC_WAIT_PEER_LINKS_DOWN; | |
418 | ||
419 | /* Notify publications from this node */ | |
420 | n_ptr->action_flags |= TIPC_NOTIFY_NODE_DOWN; | |
421 | ||
422 | /* Notify sockets connected to node */ | |
423 | list_for_each_entry_safe(conn, safe, conns, list) { | |
424 | skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG, | |
425 | SHORT_H_SIZE, 0, tn->own_addr, | |
426 | conn->peer_node, conn->port, | |
427 | conn->peer_port, TIPC_ERR_NO_NODE); | |
428 | if (likely(skb)) { | |
429 | skb_queue_tail(n_ptr->inputq, skb); | |
430 | n_ptr->action_flags |= TIPC_MSG_EVT; | |
431 | } | |
432 | list_del(&conn->list); | |
433 | kfree(conn); | |
434 | } | |
b97bf3fd PL |
435 | } |
436 | ||
78acb1f9 EH |
437 | /** |
438 | * tipc_node_get_linkname - get the name of a link | |
439 | * | |
440 | * @bearer_id: id of the bearer | |
441 | * @node: peer node address | |
442 | * @linkname: link name output buffer | |
443 | * | |
444 | * Returns 0 on success | |
445 | */ | |
f2f9800d YX |
446 | int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr, |
447 | char *linkname, size_t len) | |
78acb1f9 EH |
448 | { |
449 | struct tipc_link *link; | |
8a0f6ebe | 450 | int err = -EINVAL; |
f2f9800d | 451 | struct tipc_node *node = tipc_node_find(net, addr); |
78acb1f9 | 452 | |
8a0f6ebe YX |
453 | if (!node) |
454 | return err; | |
455 | ||
456 | if (bearer_id >= MAX_BEARERS) | |
457 | goto exit; | |
458 | ||
78acb1f9 | 459 | tipc_node_lock(node); |
9d13ec65 | 460 | link = node->links[bearer_id].link; |
78acb1f9 EH |
461 | if (link) { |
462 | strncpy(linkname, link->name, len); | |
8a0f6ebe | 463 | err = 0; |
78acb1f9 | 464 | } |
8a0f6ebe | 465 | exit: |
78acb1f9 | 466 | tipc_node_unlock(node); |
8a0f6ebe YX |
467 | tipc_node_put(node); |
468 | return err; | |
78acb1f9 | 469 | } |
9db9fdd1 YX |
470 | |
471 | void tipc_node_unlock(struct tipc_node *node) | |
472 | { | |
f2f9800d | 473 | struct net *net = node->net; |
ca0c4273 | 474 | u32 addr = 0; |
c637c103 | 475 | u32 flags = node->action_flags; |
7b8613e0 | 476 | u32 link_id = 0; |
708ac32c | 477 | struct list_head *publ_list; |
c637c103 | 478 | struct sk_buff_head *inputq = node->inputq; |
708ac32c | 479 | struct sk_buff_head *namedq; |
9db9fdd1 | 480 | |
c637c103 JPM |
481 | if (likely(!flags || (flags == TIPC_MSG_EVT))) { |
482 | node->action_flags = 0; | |
9db9fdd1 | 483 | spin_unlock_bh(&node->lock); |
c637c103 JPM |
484 | if (flags == TIPC_MSG_EVT) |
485 | tipc_sk_rcv(net, inputq); | |
9db9fdd1 YX |
486 | return; |
487 | } | |
488 | ||
7b8613e0 YX |
489 | addr = node->addr; |
490 | link_id = node->link_id; | |
c637c103 | 491 | namedq = node->namedq; |
708ac32c | 492 | publ_list = &node->publ_list; |
7b8613e0 | 493 | |
cb1b7280 JPM |
494 | node->action_flags &= ~(TIPC_MSG_EVT | |
495 | TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP | | |
496 | TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP | | |
497 | TIPC_WAKEUP_BCAST_USERS | TIPC_BCAST_MSG_EVT | | |
b952b2be | 498 | TIPC_NAMED_MSG_EVT | TIPC_BCAST_RESET); |
7b8613e0 | 499 | |
9db9fdd1 YX |
500 | spin_unlock_bh(&node->lock); |
501 | ||
708ac32c JPM |
502 | if (flags & TIPC_NOTIFY_NODE_DOWN) |
503 | tipc_publ_notify(net, publ_list, addr); | |
50100a5e | 504 | |
908344cd | 505 | if (flags & TIPC_WAKEUP_BCAST_USERS) |
f2f9800d | 506 | tipc_bclink_wakeup_users(net); |
908344cd | 507 | |
7b8613e0 | 508 | if (flags & TIPC_NOTIFY_NODE_UP) |
f2f9800d | 509 | tipc_named_node_up(net, addr); |
7b8613e0 YX |
510 | |
511 | if (flags & TIPC_NOTIFY_LINK_UP) | |
f2f9800d | 512 | tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr, |
7b8613e0 YX |
513 | TIPC_NODE_SCOPE, link_id, addr); |
514 | ||
515 | if (flags & TIPC_NOTIFY_LINK_DOWN) | |
f2f9800d | 516 | tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr, |
7b8613e0 | 517 | link_id, addr); |
c637c103 JPM |
518 | |
519 | if (flags & TIPC_MSG_EVT) | |
520 | tipc_sk_rcv(net, inputq); | |
521 | ||
522 | if (flags & TIPC_NAMED_MSG_EVT) | |
523 | tipc_named_rcv(net, namedq); | |
cb1b7280 JPM |
524 | |
525 | if (flags & TIPC_BCAST_MSG_EVT) | |
526 | tipc_bclink_input(net); | |
b952b2be YX |
527 | |
528 | if (flags & TIPC_BCAST_RESET) | |
529 | tipc_link_reset_all(node); | |
9db9fdd1 | 530 | } |
3e4b6ab5 RA |
531 | |
532 | /* Caller should hold node lock for the passed node */ | |
d8182804 | 533 | static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node) |
3e4b6ab5 RA |
534 | { |
535 | void *hdr; | |
536 | struct nlattr *attrs; | |
537 | ||
bfb3e5dd | 538 | hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family, |
3e4b6ab5 RA |
539 | NLM_F_MULTI, TIPC_NL_NODE_GET); |
540 | if (!hdr) | |
541 | return -EMSGSIZE; | |
542 | ||
543 | attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE); | |
544 | if (!attrs) | |
545 | goto msg_full; | |
546 | ||
547 | if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr)) | |
548 | goto attr_msg_full; | |
549 | if (tipc_node_is_up(node)) | |
550 | if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP)) | |
551 | goto attr_msg_full; | |
552 | ||
553 | nla_nest_end(msg->skb, attrs); | |
554 | genlmsg_end(msg->skb, hdr); | |
555 | ||
556 | return 0; | |
557 | ||
558 | attr_msg_full: | |
559 | nla_nest_cancel(msg->skb, attrs); | |
560 | msg_full: | |
561 | genlmsg_cancel(msg->skb, hdr); | |
562 | ||
563 | return -EMSGSIZE; | |
564 | } | |
565 | ||
af9b028e JPM |
566 | static struct tipc_link *tipc_node_select_link(struct tipc_node *n, int sel, |
567 | int *bearer_id, | |
568 | struct tipc_media_addr **maddr) | |
569 | { | |
570 | int id = n->active_links[sel & 1]; | |
571 | ||
572 | if (unlikely(id < 0)) | |
573 | return NULL; | |
574 | ||
575 | *bearer_id = id; | |
576 | *maddr = &n->links[id].maddr; | |
577 | return n->links[id].link; | |
578 | } | |
579 | ||
580 | /** | |
581 | * tipc_node_xmit() is the general link level function for message sending | |
582 | * @net: the applicable net namespace | |
583 | * @list: chain of buffers containing message | |
584 | * @dnode: address of destination node | |
585 | * @selector: a number used for deterministic link selection | |
586 | * Consumes the buffer chain, except when returning -ELINKCONG | |
587 | * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE | |
588 | */ | |
589 | int tipc_node_xmit(struct net *net, struct sk_buff_head *list, | |
590 | u32 dnode, int selector) | |
591 | { | |
592 | struct tipc_link *l = NULL; | |
593 | struct tipc_node *n; | |
594 | struct sk_buff_head xmitq; | |
595 | struct tipc_media_addr *maddr; | |
596 | int bearer_id; | |
597 | int rc = -EHOSTUNREACH; | |
598 | ||
599 | __skb_queue_head_init(&xmitq); | |
600 | n = tipc_node_find(net, dnode); | |
601 | if (likely(n)) { | |
602 | tipc_node_lock(n); | |
603 | l = tipc_node_select_link(n, selector, &bearer_id, &maddr); | |
604 | if (likely(l)) | |
605 | rc = tipc_link_xmit(l, list, &xmitq); | |
606 | if (unlikely(rc == -ENOBUFS)) | |
607 | tipc_link_reset(l); | |
608 | tipc_node_unlock(n); | |
609 | tipc_node_put(n); | |
610 | } | |
611 | if (likely(!rc)) { | |
612 | tipc_bearer_xmit(net, bearer_id, &xmitq, maddr); | |
613 | return 0; | |
614 | } | |
615 | if (likely(in_own_node(net, dnode))) { | |
616 | tipc_sk_rcv(net, list); | |
617 | return 0; | |
618 | } | |
619 | return rc; | |
620 | } | |
621 | ||
622 | /* tipc_node_xmit_skb(): send single buffer to destination | |
623 | * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE | |
624 | * messages, which will not be rejected | |
625 | * The only exception is datagram messages rerouted after secondary | |
626 | * lookup, which are rare and safe to dispose of anyway. | |
627 | * TODO: Return real return value, and let callers use | |
628 | * tipc_wait_for_sendpkt() where applicable | |
629 | */ | |
630 | int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode, | |
631 | u32 selector) | |
632 | { | |
633 | struct sk_buff_head head; | |
634 | int rc; | |
635 | ||
636 | skb_queue_head_init(&head); | |
637 | __skb_queue_tail(&head, skb); | |
638 | rc = tipc_node_xmit(net, &head, dnode, selector); | |
639 | if (rc == -ELINKCONG) | |
640 | kfree_skb(skb); | |
641 | return 0; | |
642 | } | |
643 | ||
3e4b6ab5 RA |
644 | int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb) |
645 | { | |
646 | int err; | |
f2f9800d YX |
647 | struct net *net = sock_net(skb->sk); |
648 | struct tipc_net *tn = net_generic(net, tipc_net_id); | |
3e4b6ab5 RA |
649 | int done = cb->args[0]; |
650 | int last_addr = cb->args[1]; | |
651 | struct tipc_node *node; | |
652 | struct tipc_nl_msg msg; | |
653 | ||
654 | if (done) | |
655 | return 0; | |
656 | ||
657 | msg.skb = skb; | |
658 | msg.portid = NETLINK_CB(cb->skb).portid; | |
659 | msg.seq = cb->nlh->nlmsg_seq; | |
660 | ||
661 | rcu_read_lock(); | |
8a0f6ebe YX |
662 | if (last_addr) { |
663 | node = tipc_node_find(net, last_addr); | |
664 | if (!node) { | |
665 | rcu_read_unlock(); | |
666 | /* We never set seq or call nl_dump_check_consistent() | |
667 | * this means that setting prev_seq here will cause the | |
668 | * consistence check to fail in the netlink callback | |
669 | * handler. Resulting in the NLMSG_DONE message having | |
670 | * the NLM_F_DUMP_INTR flag set if the node state | |
671 | * changed while we released the lock. | |
672 | */ | |
673 | cb->prev_seq = 1; | |
674 | return -EPIPE; | |
675 | } | |
676 | tipc_node_put(node); | |
3e4b6ab5 RA |
677 | } |
678 | ||
f2f9800d | 679 | list_for_each_entry_rcu(node, &tn->node_list, list) { |
3e4b6ab5 RA |
680 | if (last_addr) { |
681 | if (node->addr == last_addr) | |
682 | last_addr = 0; | |
683 | else | |
684 | continue; | |
685 | } | |
686 | ||
687 | tipc_node_lock(node); | |
688 | err = __tipc_nl_add_node(&msg, node); | |
689 | if (err) { | |
690 | last_addr = node->addr; | |
691 | tipc_node_unlock(node); | |
692 | goto out; | |
693 | } | |
694 | ||
695 | tipc_node_unlock(node); | |
696 | } | |
697 | done = 1; | |
698 | out: | |
699 | cb->args[0] = done; | |
700 | cb->args[1] = last_addr; | |
701 | rcu_read_unlock(); | |
702 | ||
703 | return skb->len; | |
704 | } |