]>
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" |
d999297c | 43 | #include "discover.h" |
b97bf3fd | 44 | |
6e498158 JPM |
45 | /* Node FSM states and events: |
46 | */ | |
47 | enum { | |
48 | SELF_DOWN_PEER_DOWN = 0xdd, | |
49 | SELF_UP_PEER_UP = 0xaa, | |
50 | SELF_DOWN_PEER_LEAVING = 0xd1, | |
51 | SELF_UP_PEER_COMING = 0xac, | |
52 | SELF_COMING_PEER_UP = 0xca, | |
53 | SELF_LEAVING_PEER_DOWN = 0x1d, | |
54 | NODE_FAILINGOVER = 0xf0, | |
55 | NODE_SYNCHING = 0xcc | |
56 | }; | |
57 | ||
58 | enum { | |
59 | SELF_ESTABL_CONTACT_EVT = 0xece, | |
60 | SELF_LOST_CONTACT_EVT = 0x1ce, | |
61 | PEER_ESTABL_CONTACT_EVT = 0x9ece, | |
62 | PEER_LOST_CONTACT_EVT = 0x91ce, | |
63 | NODE_FAILOVER_BEGIN_EVT = 0xfbe, | |
64 | NODE_FAILOVER_END_EVT = 0xfee, | |
65 | NODE_SYNCH_BEGIN_EVT = 0xcbe, | |
66 | NODE_SYNCH_END_EVT = 0xcee | |
67 | }; | |
68 | ||
598411d7 JPM |
69 | static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id, |
70 | struct sk_buff_head *xmitq, | |
71 | struct tipc_media_addr **maddr); | |
72 | static void tipc_node_link_down(struct tipc_node *n, int bearer_id, | |
73 | bool delete); | |
74 | static void node_lost_contact(struct tipc_node *n, struct sk_buff_head *inputq); | |
6c00055a | 75 | static void node_established_contact(struct tipc_node *n_ptr); |
8a0f6ebe | 76 | static void tipc_node_delete(struct tipc_node *node); |
8a1577c9 | 77 | static void tipc_node_timeout(unsigned long data); |
d999297c | 78 | static void tipc_node_fsm_evt(struct tipc_node *n, int evt); |
b97bf3fd | 79 | |
02be61a9 JPM |
80 | struct tipc_sock_conn { |
81 | u32 port; | |
82 | u32 peer_port; | |
83 | u32 peer_node; | |
84 | struct list_head list; | |
85 | }; | |
86 | ||
3e4b6ab5 RA |
87 | static const struct nla_policy tipc_nl_node_policy[TIPC_NLA_NODE_MAX + 1] = { |
88 | [TIPC_NLA_NODE_UNSPEC] = { .type = NLA_UNSPEC }, | |
89 | [TIPC_NLA_NODE_ADDR] = { .type = NLA_U32 }, | |
90 | [TIPC_NLA_NODE_UP] = { .type = NLA_FLAG } | |
91 | }; | |
92 | ||
a635b46b AS |
93 | /* |
94 | * A trivial power-of-two bitmask technique is used for speed, since this | |
95 | * operation is done for every incoming TIPC packet. The number of hash table | |
96 | * entries has been chosen so that no hash chain exceeds 8 nodes and will | |
97 | * usually be much smaller (typically only a single node). | |
98 | */ | |
872f24db | 99 | static unsigned int tipc_hashfn(u32 addr) |
a635b46b AS |
100 | { |
101 | return addr & (NODE_HTABLE_SIZE - 1); | |
102 | } | |
103 | ||
8a0f6ebe YX |
104 | static void tipc_node_kref_release(struct kref *kref) |
105 | { | |
106 | struct tipc_node *node = container_of(kref, struct tipc_node, kref); | |
107 | ||
108 | tipc_node_delete(node); | |
109 | } | |
110 | ||
111 | void tipc_node_put(struct tipc_node *node) | |
112 | { | |
113 | kref_put(&node->kref, tipc_node_kref_release); | |
114 | } | |
115 | ||
116 | static void tipc_node_get(struct tipc_node *node) | |
117 | { | |
118 | kref_get(&node->kref); | |
119 | } | |
120 | ||
1ec2bb08 | 121 | /* |
672d99e1 AS |
122 | * tipc_node_find - locate specified node object, if it exists |
123 | */ | |
f2f9800d | 124 | struct tipc_node *tipc_node_find(struct net *net, u32 addr) |
672d99e1 | 125 | { |
f2f9800d | 126 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
672d99e1 | 127 | struct tipc_node *node; |
672d99e1 | 128 | |
34747539 | 129 | if (unlikely(!in_own_cluster_exact(net, addr))) |
672d99e1 AS |
130 | return NULL; |
131 | ||
6c7a762e | 132 | rcu_read_lock(); |
f2f9800d YX |
133 | hlist_for_each_entry_rcu(node, &tn->node_htable[tipc_hashfn(addr)], |
134 | hash) { | |
46651c59 | 135 | if (node->addr == addr) { |
8a0f6ebe | 136 | tipc_node_get(node); |
6c7a762e | 137 | rcu_read_unlock(); |
672d99e1 | 138 | return node; |
46651c59 | 139 | } |
672d99e1 | 140 | } |
6c7a762e | 141 | rcu_read_unlock(); |
672d99e1 AS |
142 | return NULL; |
143 | } | |
144 | ||
cf148816 | 145 | struct tipc_node *tipc_node_create(struct net *net, u32 addr, u16 capabilities) |
b97bf3fd | 146 | { |
f2f9800d | 147 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
672d99e1 | 148 | struct tipc_node *n_ptr, *temp_node; |
b97bf3fd | 149 | |
f2f9800d | 150 | spin_lock_bh(&tn->node_list_lock); |
b45db71b JPM |
151 | n_ptr = tipc_node_find(net, addr); |
152 | if (n_ptr) | |
153 | goto exit; | |
5af54792 | 154 | n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC); |
a10bd924 | 155 | if (!n_ptr) { |
2cf8aa19 | 156 | pr_warn("Node creation failed, no memory\n"); |
b45db71b | 157 | goto exit; |
a10bd924 | 158 | } |
a10bd924 | 159 | n_ptr->addr = addr; |
f2f9800d | 160 | n_ptr->net = net; |
cf148816 | 161 | n_ptr->capabilities = capabilities; |
8a0f6ebe | 162 | kref_init(&n_ptr->kref); |
51a8e4de | 163 | spin_lock_init(&n_ptr->lock); |
672d99e1 AS |
164 | INIT_HLIST_NODE(&n_ptr->hash); |
165 | INIT_LIST_HEAD(&n_ptr->list); | |
a8f48af5 | 166 | INIT_LIST_HEAD(&n_ptr->publ_list); |
02be61a9 | 167 | INIT_LIST_HEAD(&n_ptr->conn_sks); |
d39bbd44 | 168 | skb_queue_head_init(&n_ptr->bclink.namedq); |
05dcc5aa | 169 | __skb_queue_head_init(&n_ptr->bclink.deferdq); |
f2f9800d | 170 | hlist_add_head_rcu(&n_ptr->hash, &tn->node_htable[tipc_hashfn(addr)]); |
f2f9800d | 171 | list_for_each_entry_rcu(temp_node, &tn->node_list, list) { |
672d99e1 AS |
172 | if (n_ptr->addr < temp_node->addr) |
173 | break; | |
174 | } | |
6c7a762e | 175 | list_add_tail_rcu(&n_ptr->list, &temp_node->list); |
d999297c | 176 | n_ptr->state = SELF_DOWN_PEER_LEAVING; |
fc0eea69 | 177 | n_ptr->signature = INVALID_NODE_SIG; |
36e78a46 JPM |
178 | n_ptr->active_links[0] = INVALID_BEARER_ID; |
179 | n_ptr->active_links[1] = INVALID_BEARER_ID; | |
8a0f6ebe | 180 | tipc_node_get(n_ptr); |
8a1577c9 JPM |
181 | setup_timer(&n_ptr->timer, tipc_node_timeout, (unsigned long)n_ptr); |
182 | n_ptr->keepalive_intv = U32_MAX; | |
b45db71b | 183 | exit: |
f2f9800d | 184 | spin_unlock_bh(&tn->node_list_lock); |
b97bf3fd PL |
185 | return n_ptr; |
186 | } | |
187 | ||
8a1577c9 JPM |
188 | static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l) |
189 | { | |
190 | unsigned long tol = l->tolerance; | |
191 | unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4; | |
192 | unsigned long keepalive_intv = msecs_to_jiffies(intv); | |
193 | ||
194 | /* Link with lowest tolerance determines timer interval */ | |
195 | if (keepalive_intv < n->keepalive_intv) | |
196 | n->keepalive_intv = keepalive_intv; | |
197 | ||
198 | /* Ensure link's abort limit corresponds to current interval */ | |
199 | l->abort_limit = l->tolerance / jiffies_to_msecs(n->keepalive_intv); | |
200 | } | |
201 | ||
8a0f6ebe | 202 | static void tipc_node_delete(struct tipc_node *node) |
b97bf3fd | 203 | { |
8a0f6ebe YX |
204 | list_del_rcu(&node->list); |
205 | hlist_del_rcu(&node->hash); | |
206 | kfree_rcu(node, rcu); | |
b97bf3fd PL |
207 | } |
208 | ||
f2f9800d | 209 | void tipc_node_stop(struct net *net) |
46651c59 | 210 | { |
f2f9800d | 211 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
46651c59 YX |
212 | struct tipc_node *node, *t_node; |
213 | ||
f2f9800d | 214 | spin_lock_bh(&tn->node_list_lock); |
8a1577c9 JPM |
215 | list_for_each_entry_safe(node, t_node, &tn->node_list, list) { |
216 | if (del_timer(&node->timer)) | |
217 | tipc_node_put(node); | |
8a0f6ebe | 218 | tipc_node_put(node); |
8a1577c9 | 219 | } |
f2f9800d | 220 | spin_unlock_bh(&tn->node_list_lock); |
46651c59 YX |
221 | } |
222 | ||
f2f9800d | 223 | int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port) |
02be61a9 JPM |
224 | { |
225 | struct tipc_node *node; | |
226 | struct tipc_sock_conn *conn; | |
8a0f6ebe | 227 | int err = 0; |
02be61a9 | 228 | |
34747539 | 229 | if (in_own_node(net, dnode)) |
02be61a9 JPM |
230 | return 0; |
231 | ||
f2f9800d | 232 | node = tipc_node_find(net, dnode); |
02be61a9 JPM |
233 | if (!node) { |
234 | pr_warn("Connecting sock to node 0x%x failed\n", dnode); | |
235 | return -EHOSTUNREACH; | |
236 | } | |
237 | conn = kmalloc(sizeof(*conn), GFP_ATOMIC); | |
8a0f6ebe YX |
238 | if (!conn) { |
239 | err = -EHOSTUNREACH; | |
240 | goto exit; | |
241 | } | |
02be61a9 JPM |
242 | conn->peer_node = dnode; |
243 | conn->port = port; | |
244 | conn->peer_port = peer_port; | |
245 | ||
246 | tipc_node_lock(node); | |
247 | list_add_tail(&conn->list, &node->conn_sks); | |
248 | tipc_node_unlock(node); | |
8a0f6ebe YX |
249 | exit: |
250 | tipc_node_put(node); | |
251 | return err; | |
02be61a9 JPM |
252 | } |
253 | ||
f2f9800d | 254 | void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port) |
02be61a9 JPM |
255 | { |
256 | struct tipc_node *node; | |
257 | struct tipc_sock_conn *conn, *safe; | |
258 | ||
34747539 | 259 | if (in_own_node(net, dnode)) |
02be61a9 JPM |
260 | return; |
261 | ||
f2f9800d | 262 | node = tipc_node_find(net, dnode); |
02be61a9 JPM |
263 | if (!node) |
264 | return; | |
265 | ||
266 | tipc_node_lock(node); | |
267 | list_for_each_entry_safe(conn, safe, &node->conn_sks, list) { | |
268 | if (port != conn->port) | |
269 | continue; | |
270 | list_del(&conn->list); | |
271 | kfree(conn); | |
272 | } | |
273 | tipc_node_unlock(node); | |
8a0f6ebe | 274 | tipc_node_put(node); |
02be61a9 JPM |
275 | } |
276 | ||
8a1577c9 JPM |
277 | /* tipc_node_timeout - handle expiration of node timer |
278 | */ | |
279 | static void tipc_node_timeout(unsigned long data) | |
280 | { | |
281 | struct tipc_node *n = (struct tipc_node *)data; | |
598411d7 | 282 | struct tipc_link_entry *le; |
8a1577c9 | 283 | struct sk_buff_head xmitq; |
8a1577c9 JPM |
284 | int bearer_id; |
285 | int rc = 0; | |
286 | ||
287 | __skb_queue_head_init(&xmitq); | |
288 | ||
289 | for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) { | |
290 | tipc_node_lock(n); | |
598411d7 JPM |
291 | le = &n->links[bearer_id]; |
292 | if (le->link) { | |
8a1577c9 | 293 | /* Link tolerance may change asynchronously: */ |
598411d7 JPM |
294 | tipc_node_calculate_timer(n, le->link); |
295 | rc = tipc_link_timeout(le->link, &xmitq); | |
8a1577c9 JPM |
296 | } |
297 | tipc_node_unlock(n); | |
598411d7 JPM |
298 | tipc_bearer_xmit(n->net, bearer_id, &xmitq, &le->maddr); |
299 | if (rc & TIPC_LINK_DOWN_EVT) | |
300 | tipc_node_link_down(n, bearer_id, false); | |
8a1577c9 JPM |
301 | } |
302 | if (!mod_timer(&n->timer, jiffies + n->keepalive_intv)) | |
303 | tipc_node_get(n); | |
304 | tipc_node_put(n); | |
305 | } | |
306 | ||
b97bf3fd | 307 | /** |
598411d7 JPM |
308 | * __tipc_node_link_up - handle addition of link |
309 | * Node lock must be held by caller | |
b97bf3fd PL |
310 | * Link becomes active (alone or shared) or standby, depending on its priority. |
311 | */ | |
598411d7 JPM |
312 | static void __tipc_node_link_up(struct tipc_node *n, int bearer_id, |
313 | struct sk_buff_head *xmitq) | |
b97bf3fd | 314 | { |
36e78a46 JPM |
315 | int *slot0 = &n->active_links[0]; |
316 | int *slot1 = &n->active_links[1]; | |
6e498158 JPM |
317 | struct tipc_link *ol = node_active_link(n, 0); |
318 | struct tipc_link *nl = n->links[bearer_id].link; | |
9d13ec65 | 319 | |
598411d7 JPM |
320 | if (!nl || !tipc_link_is_up(nl)) |
321 | return; | |
322 | ||
9d13ec65 JPM |
323 | n->working_links++; |
324 | n->action_flags |= TIPC_NOTIFY_LINK_UP; | |
6e498158 JPM |
325 | n->link_id = nl->peer_bearer_id << 16 | bearer_id; |
326 | ||
327 | /* Leave room for tunnel header when returning 'mtu' to users: */ | |
328 | n->links[bearer_id].mtu = nl->mtu - INT_H_SIZE; | |
7b8613e0 | 329 | |
cbeb83ca JPM |
330 | tipc_bearer_add_dest(n->net, bearer_id, n->addr); |
331 | ||
3fa9cacd | 332 | pr_debug("Established link <%s> on network plane %c\n", |
6e498158 | 333 | nl->name, nl->net_plane); |
c4307285 | 334 | |
6e498158 JPM |
335 | /* First link? => give it both slots */ |
336 | if (!ol) { | |
36e78a46 JPM |
337 | *slot0 = bearer_id; |
338 | *slot1 = bearer_id; | |
5045f7b9 | 339 | tipc_link_build_bcast_sync_msg(nl, xmitq); |
9d13ec65 JPM |
340 | node_established_contact(n); |
341 | return; | |
b97bf3fd | 342 | } |
36e78a46 | 343 | |
6e498158 JPM |
344 | /* Second link => redistribute slots */ |
345 | if (nl->priority > ol->priority) { | |
346 | pr_debug("Old link <%s> becomes standby\n", ol->name); | |
36e78a46 | 347 | *slot0 = bearer_id; |
6e498158 JPM |
348 | *slot1 = bearer_id; |
349 | } else if (nl->priority == ol->priority) { | |
350 | *slot0 = bearer_id; | |
351 | } else { | |
352 | pr_debug("New link <%s> is standby\n", nl->name); | |
b97bf3fd | 353 | } |
b97bf3fd | 354 | |
6e498158 JPM |
355 | /* Prepare synchronization with first link */ |
356 | tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq); | |
b97bf3fd PL |
357 | } |
358 | ||
359 | /** | |
598411d7 JPM |
360 | * tipc_node_link_up - handle addition of link |
361 | * | |
362 | * Link becomes active (alone or shared) or standby, depending on its priority. | |
b97bf3fd | 363 | */ |
598411d7 JPM |
364 | static void tipc_node_link_up(struct tipc_node *n, int bearer_id, |
365 | struct sk_buff_head *xmitq) | |
b97bf3fd | 366 | { |
598411d7 JPM |
367 | tipc_node_lock(n); |
368 | __tipc_node_link_up(n, bearer_id, xmitq); | |
369 | tipc_node_unlock(n); | |
370 | } | |
371 | ||
372 | /** | |
373 | * __tipc_node_link_down - handle loss of link | |
374 | */ | |
375 | static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id, | |
376 | struct sk_buff_head *xmitq, | |
377 | struct tipc_media_addr **maddr) | |
378 | { | |
379 | struct tipc_link_entry *le = &n->links[*bearer_id]; | |
36e78a46 JPM |
380 | int *slot0 = &n->active_links[0]; |
381 | int *slot1 = &n->active_links[1]; | |
382 | int i, highest = 0; | |
6e498158 | 383 | struct tipc_link *l, *_l, *tnl; |
b97bf3fd | 384 | |
598411d7 | 385 | l = n->links[*bearer_id].link; |
662921cd | 386 | if (!l || tipc_link_is_reset(l)) |
655fb243 JPM |
387 | return; |
388 | ||
9d13ec65 JPM |
389 | n->working_links--; |
390 | n->action_flags |= TIPC_NOTIFY_LINK_DOWN; | |
598411d7 | 391 | n->link_id = l->peer_bearer_id << 16 | *bearer_id; |
5392d646 | 392 | |
598411d7 | 393 | tipc_bearer_remove_dest(n->net, *bearer_id, n->addr); |
655fb243 | 394 | |
3fa9cacd | 395 | pr_debug("Lost link <%s> on network plane %c\n", |
9d13ec65 | 396 | l->name, l->net_plane); |
16e166b8 | 397 | |
36e78a46 JPM |
398 | /* Select new active link if any available */ |
399 | *slot0 = INVALID_BEARER_ID; | |
400 | *slot1 = INVALID_BEARER_ID; | |
401 | for (i = 0; i < MAX_BEARERS; i++) { | |
402 | _l = n->links[i].link; | |
403 | if (!_l || !tipc_link_is_up(_l)) | |
404 | continue; | |
655fb243 JPM |
405 | if (_l == l) |
406 | continue; | |
36e78a46 JPM |
407 | if (_l->priority < highest) |
408 | continue; | |
409 | if (_l->priority > highest) { | |
410 | highest = _l->priority; | |
411 | *slot0 = i; | |
412 | *slot1 = i; | |
413 | continue; | |
414 | } | |
415 | *slot1 = i; | |
416 | } | |
655fb243 | 417 | |
6e498158 JPM |
418 | if (!tipc_node_is_up(n)) { |
419 | tipc_link_reset(l); | |
598411d7 | 420 | node_lost_contact(n, &le->inputq); |
6e498158 JPM |
421 | return; |
422 | } | |
655fb243 | 423 | |
6e498158 JPM |
424 | /* There is still a working link => initiate failover */ |
425 | tnl = node_active_link(n, 0); | |
6e498158 | 426 | n->sync_point = tnl->rcv_nxt + (U16_MAX / 2 - 1); |
598411d7 | 427 | tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, xmitq); |
655fb243 | 428 | tipc_link_reset(l); |
662921cd | 429 | tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT); |
598411d7 JPM |
430 | tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT); |
431 | *maddr = &n->links[tnl->bearer_id].maddr; | |
432 | *bearer_id = tnl->bearer_id; | |
433 | } | |
434 | ||
435 | static void tipc_node_link_down(struct tipc_node *n, int bearer_id, bool delete) | |
436 | { | |
437 | struct tipc_link_entry *le = &n->links[bearer_id]; | |
438 | struct tipc_media_addr *maddr; | |
439 | struct sk_buff_head xmitq; | |
440 | ||
441 | __skb_queue_head_init(&xmitq); | |
442 | ||
443 | tipc_node_lock(n); | |
444 | __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr); | |
445 | if (delete && le->link) { | |
446 | kfree(le->link); | |
447 | le->link = NULL; | |
448 | n->link_cnt--; | |
449 | } | |
450 | tipc_node_unlock(n); | |
451 | ||
452 | tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr); | |
453 | tipc_sk_rcv(n->net, &le->inputq); | |
b97bf3fd PL |
454 | } |
455 | ||
9d13ec65 | 456 | bool tipc_node_is_up(struct tipc_node *n) |
b97bf3fd | 457 | { |
36e78a46 | 458 | return n->active_links[0] != INVALID_BEARER_ID; |
b97bf3fd PL |
459 | } |
460 | ||
cf148816 JPM |
461 | void tipc_node_check_dest(struct net *net, u32 onode, |
462 | struct tipc_bearer *b, | |
463 | u16 capabilities, u32 signature, | |
464 | struct tipc_media_addr *maddr, | |
465 | bool *respond, bool *dupl_addr) | |
d3a43b90 | 466 | { |
cf148816 JPM |
467 | struct tipc_node *n; |
468 | struct tipc_link *l; | |
440d8963 | 469 | struct tipc_link_entry *le; |
cf148816 JPM |
470 | bool addr_match = false; |
471 | bool sign_match = false; | |
472 | bool link_up = false; | |
473 | bool accept_addr = false; | |
598411d7 | 474 | bool reset = true; |
440d8963 | 475 | |
cf148816 JPM |
476 | *dupl_addr = false; |
477 | *respond = false; | |
478 | ||
479 | n = tipc_node_create(net, onode, capabilities); | |
480 | if (!n) | |
481 | return; | |
d3a43b90 | 482 | |
cf148816 JPM |
483 | tipc_node_lock(n); |
484 | ||
440d8963 | 485 | le = &n->links[b->identity]; |
cf148816 JPM |
486 | |
487 | /* Prepare to validate requesting node's signature and media address */ | |
440d8963 | 488 | l = le->link; |
cf148816 | 489 | link_up = l && tipc_link_is_up(l); |
440d8963 | 490 | addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr)); |
cf148816 JPM |
491 | sign_match = (signature == n->signature); |
492 | ||
493 | /* These three flags give us eight permutations: */ | |
494 | ||
495 | if (sign_match && addr_match && link_up) { | |
496 | /* All is fine. Do nothing. */ | |
598411d7 | 497 | reset = false; |
cf148816 JPM |
498 | } else if (sign_match && addr_match && !link_up) { |
499 | /* Respond. The link will come up in due time */ | |
500 | *respond = true; | |
501 | } else if (sign_match && !addr_match && link_up) { | |
502 | /* Peer has changed i/f address without rebooting. | |
503 | * If so, the link will reset soon, and the next | |
504 | * discovery will be accepted. So we can ignore it. | |
505 | * It may also be an cloned or malicious peer having | |
506 | * chosen the same node address and signature as an | |
507 | * existing one. | |
508 | * Ignore requests until the link goes down, if ever. | |
509 | */ | |
510 | *dupl_addr = true; | |
511 | } else if (sign_match && !addr_match && !link_up) { | |
512 | /* Peer link has changed i/f address without rebooting. | |
513 | * It may also be a cloned or malicious peer; we can't | |
514 | * distinguish between the two. | |
515 | * The signature is correct, so we must accept. | |
516 | */ | |
517 | accept_addr = true; | |
518 | *respond = true; | |
519 | } else if (!sign_match && addr_match && link_up) { | |
520 | /* Peer node rebooted. Two possibilities: | |
521 | * - Delayed re-discovery; this link endpoint has already | |
522 | * reset and re-established contact with the peer, before | |
523 | * receiving a discovery message from that node. | |
524 | * (The peer happened to receive one from this node first). | |
525 | * - The peer came back so fast that our side has not | |
526 | * discovered it yet. Probing from this side will soon | |
527 | * reset the link, since there can be no working link | |
528 | * endpoint at the peer end, and the link will re-establish. | |
529 | * Accept the signature, since it comes from a known peer. | |
530 | */ | |
531 | n->signature = signature; | |
532 | } else if (!sign_match && addr_match && !link_up) { | |
533 | /* The peer node has rebooted. | |
534 | * Accept signature, since it is a known peer. | |
535 | */ | |
536 | n->signature = signature; | |
537 | *respond = true; | |
538 | } else if (!sign_match && !addr_match && link_up) { | |
539 | /* Peer rebooted with new address, or a new/duplicate peer. | |
540 | * Ignore until the link goes down, if ever. | |
541 | */ | |
542 | *dupl_addr = true; | |
543 | } else if (!sign_match && !addr_match && !link_up) { | |
544 | /* Peer rebooted with new address, or it is a new peer. | |
545 | * Accept signature and address. | |
546 | */ | |
547 | n->signature = signature; | |
548 | accept_addr = true; | |
549 | *respond = true; | |
550 | } | |
d3a43b90 | 551 | |
cf148816 JPM |
552 | if (!accept_addr) |
553 | goto exit; | |
d3a43b90 | 554 | |
cf148816 | 555 | /* Now create new link if not already existing */ |
8a1577c9 | 556 | if (!l) { |
440d8963 JPM |
557 | if (n->link_cnt == 2) { |
558 | pr_warn("Cannot establish 3rd link to %x\n", n->addr); | |
559 | goto exit; | |
560 | } | |
561 | if (!tipc_link_create(n, b, mod(tipc_net(net)->random), | |
562 | tipc_own_addr(net), onode, &le->maddr, | |
563 | &le->inputq, &n->bclink.namedq, &l)) { | |
cf148816 JPM |
564 | *respond = false; |
565 | goto exit; | |
566 | } | |
440d8963 | 567 | tipc_link_reset(l); |
17b20630 JPM |
568 | if (n->state == NODE_FAILINGOVER) |
569 | tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT); | |
440d8963 JPM |
570 | le->link = l; |
571 | n->link_cnt++; | |
8a1577c9 | 572 | tipc_node_calculate_timer(n, l); |
cf148816 | 573 | if (n->link_cnt == 1) |
8a1577c9 JPM |
574 | if (!mod_timer(&n->timer, jiffies + n->keepalive_intv)) |
575 | tipc_node_get(n); | |
8a1577c9 | 576 | } |
440d8963 | 577 | memcpy(&le->maddr, maddr, sizeof(*maddr)); |
cf148816 JPM |
578 | exit: |
579 | tipc_node_unlock(n); | |
598411d7 JPM |
580 | if (reset) |
581 | tipc_node_link_down(n, b->identity, false); | |
cf148816 | 582 | tipc_node_put(n); |
d3a43b90 JPM |
583 | } |
584 | ||
6144a996 JPM |
585 | void tipc_node_delete_links(struct net *net, int bearer_id) |
586 | { | |
587 | struct tipc_net *tn = net_generic(net, tipc_net_id); | |
6144a996 JPM |
588 | struct tipc_node *n; |
589 | ||
590 | rcu_read_lock(); | |
591 | list_for_each_entry_rcu(n, &tn->node_list, list) { | |
598411d7 | 592 | tipc_node_link_down(n, bearer_id, true); |
6144a996 JPM |
593 | } |
594 | rcu_read_unlock(); | |
595 | } | |
596 | ||
597 | static void tipc_node_reset_links(struct tipc_node *n) | |
598 | { | |
599 | char addr_string[16]; | |
598411d7 | 600 | int i; |
6144a996 JPM |
601 | |
602 | pr_warn("Resetting all links to %s\n", | |
603 | tipc_addr_string_fill(addr_string, n->addr)); | |
604 | ||
605 | for (i = 0; i < MAX_BEARERS; i++) { | |
598411d7 | 606 | tipc_node_link_down(n, i, false); |
6144a996 | 607 | } |
6144a996 JPM |
608 | } |
609 | ||
1a20cc25 JPM |
610 | /* tipc_node_fsm_evt - node finite state machine |
611 | * Determines when contact is allowed with peer node | |
612 | */ | |
d999297c | 613 | static void tipc_node_fsm_evt(struct tipc_node *n, int evt) |
1a20cc25 JPM |
614 | { |
615 | int state = n->state; | |
616 | ||
617 | switch (state) { | |
618 | case SELF_DOWN_PEER_DOWN: | |
619 | switch (evt) { | |
620 | case SELF_ESTABL_CONTACT_EVT: | |
621 | state = SELF_UP_PEER_COMING; | |
622 | break; | |
623 | case PEER_ESTABL_CONTACT_EVT: | |
624 | state = SELF_COMING_PEER_UP; | |
625 | break; | |
626 | case SELF_LOST_CONTACT_EVT: | |
627 | case PEER_LOST_CONTACT_EVT: | |
628 | break; | |
66996b6c JPM |
629 | case NODE_SYNCH_END_EVT: |
630 | case NODE_SYNCH_BEGIN_EVT: | |
631 | case NODE_FAILOVER_BEGIN_EVT: | |
632 | case NODE_FAILOVER_END_EVT: | |
1a20cc25 | 633 | default: |
66996b6c | 634 | goto illegal_evt; |
1a20cc25 JPM |
635 | } |
636 | break; | |
637 | case SELF_UP_PEER_UP: | |
638 | switch (evt) { | |
639 | case SELF_LOST_CONTACT_EVT: | |
640 | state = SELF_DOWN_PEER_LEAVING; | |
641 | break; | |
642 | case PEER_LOST_CONTACT_EVT: | |
643 | state = SELF_LEAVING_PEER_DOWN; | |
644 | break; | |
66996b6c JPM |
645 | case NODE_SYNCH_BEGIN_EVT: |
646 | state = NODE_SYNCHING; | |
647 | break; | |
648 | case NODE_FAILOVER_BEGIN_EVT: | |
649 | state = NODE_FAILINGOVER; | |
650 | break; | |
1a20cc25 JPM |
651 | case SELF_ESTABL_CONTACT_EVT: |
652 | case PEER_ESTABL_CONTACT_EVT: | |
66996b6c JPM |
653 | case NODE_SYNCH_END_EVT: |
654 | case NODE_FAILOVER_END_EVT: | |
1a20cc25 JPM |
655 | break; |
656 | default: | |
66996b6c | 657 | goto illegal_evt; |
1a20cc25 JPM |
658 | } |
659 | break; | |
660 | case SELF_DOWN_PEER_LEAVING: | |
661 | switch (evt) { | |
662 | case PEER_LOST_CONTACT_EVT: | |
663 | state = SELF_DOWN_PEER_DOWN; | |
664 | break; | |
665 | case SELF_ESTABL_CONTACT_EVT: | |
666 | case PEER_ESTABL_CONTACT_EVT: | |
667 | case SELF_LOST_CONTACT_EVT: | |
668 | break; | |
66996b6c JPM |
669 | case NODE_SYNCH_END_EVT: |
670 | case NODE_SYNCH_BEGIN_EVT: | |
671 | case NODE_FAILOVER_BEGIN_EVT: | |
672 | case NODE_FAILOVER_END_EVT: | |
1a20cc25 | 673 | default: |
66996b6c | 674 | goto illegal_evt; |
1a20cc25 JPM |
675 | } |
676 | break; | |
677 | case SELF_UP_PEER_COMING: | |
678 | switch (evt) { | |
679 | case PEER_ESTABL_CONTACT_EVT: | |
680 | state = SELF_UP_PEER_UP; | |
681 | break; | |
682 | case SELF_LOST_CONTACT_EVT: | |
683 | state = SELF_DOWN_PEER_LEAVING; | |
684 | break; | |
685 | case SELF_ESTABL_CONTACT_EVT: | |
686 | case PEER_LOST_CONTACT_EVT: | |
687 | break; | |
66996b6c JPM |
688 | case NODE_SYNCH_END_EVT: |
689 | case NODE_SYNCH_BEGIN_EVT: | |
690 | case NODE_FAILOVER_BEGIN_EVT: | |
691 | case NODE_FAILOVER_END_EVT: | |
1a20cc25 | 692 | default: |
66996b6c | 693 | goto illegal_evt; |
1a20cc25 JPM |
694 | } |
695 | break; | |
696 | case SELF_COMING_PEER_UP: | |
697 | switch (evt) { | |
698 | case SELF_ESTABL_CONTACT_EVT: | |
699 | state = SELF_UP_PEER_UP; | |
700 | break; | |
701 | case PEER_LOST_CONTACT_EVT: | |
702 | state = SELF_LEAVING_PEER_DOWN; | |
703 | break; | |
704 | case SELF_LOST_CONTACT_EVT: | |
705 | case PEER_ESTABL_CONTACT_EVT: | |
706 | break; | |
66996b6c JPM |
707 | case NODE_SYNCH_END_EVT: |
708 | case NODE_SYNCH_BEGIN_EVT: | |
709 | case NODE_FAILOVER_BEGIN_EVT: | |
710 | case NODE_FAILOVER_END_EVT: | |
1a20cc25 | 711 | default: |
66996b6c | 712 | goto illegal_evt; |
1a20cc25 JPM |
713 | } |
714 | break; | |
715 | case SELF_LEAVING_PEER_DOWN: | |
716 | switch (evt) { | |
717 | case SELF_LOST_CONTACT_EVT: | |
718 | state = SELF_DOWN_PEER_DOWN; | |
719 | break; | |
720 | case SELF_ESTABL_CONTACT_EVT: | |
721 | case PEER_ESTABL_CONTACT_EVT: | |
722 | case PEER_LOST_CONTACT_EVT: | |
723 | break; | |
66996b6c JPM |
724 | case NODE_SYNCH_END_EVT: |
725 | case NODE_SYNCH_BEGIN_EVT: | |
726 | case NODE_FAILOVER_BEGIN_EVT: | |
727 | case NODE_FAILOVER_END_EVT: | |
728 | default: | |
729 | goto illegal_evt; | |
730 | } | |
731 | break; | |
732 | case NODE_FAILINGOVER: | |
733 | switch (evt) { | |
734 | case SELF_LOST_CONTACT_EVT: | |
735 | state = SELF_DOWN_PEER_LEAVING; | |
736 | break; | |
737 | case PEER_LOST_CONTACT_EVT: | |
738 | state = SELF_LEAVING_PEER_DOWN; | |
739 | break; | |
740 | case NODE_FAILOVER_END_EVT: | |
741 | state = SELF_UP_PEER_UP; | |
742 | break; | |
743 | case NODE_FAILOVER_BEGIN_EVT: | |
744 | case SELF_ESTABL_CONTACT_EVT: | |
745 | case PEER_ESTABL_CONTACT_EVT: | |
746 | break; | |
747 | case NODE_SYNCH_BEGIN_EVT: | |
748 | case NODE_SYNCH_END_EVT: | |
1a20cc25 | 749 | default: |
66996b6c JPM |
750 | goto illegal_evt; |
751 | } | |
752 | break; | |
753 | case NODE_SYNCHING: | |
754 | switch (evt) { | |
755 | case SELF_LOST_CONTACT_EVT: | |
756 | state = SELF_DOWN_PEER_LEAVING; | |
757 | break; | |
758 | case PEER_LOST_CONTACT_EVT: | |
759 | state = SELF_LEAVING_PEER_DOWN; | |
760 | break; | |
761 | case NODE_SYNCH_END_EVT: | |
762 | state = SELF_UP_PEER_UP; | |
763 | break; | |
764 | case NODE_FAILOVER_BEGIN_EVT: | |
765 | state = NODE_FAILINGOVER; | |
766 | break; | |
767 | case NODE_SYNCH_BEGIN_EVT: | |
768 | case SELF_ESTABL_CONTACT_EVT: | |
769 | case PEER_ESTABL_CONTACT_EVT: | |
770 | break; | |
771 | case NODE_FAILOVER_END_EVT: | |
772 | default: | |
773 | goto illegal_evt; | |
1a20cc25 JPM |
774 | } |
775 | break; | |
776 | default: | |
777 | pr_err("Unknown node fsm state %x\n", state); | |
778 | break; | |
779 | } | |
1a20cc25 | 780 | n->state = state; |
66996b6c JPM |
781 | return; |
782 | ||
783 | illegal_evt: | |
784 | pr_err("Illegal node fsm evt %x in state %x\n", evt, state); | |
1a20cc25 JPM |
785 | } |
786 | ||
6e498158 | 787 | bool tipc_node_filter_pkt(struct tipc_node *n, struct tipc_msg *hdr) |
1a20cc25 JPM |
788 | { |
789 | int state = n->state; | |
790 | ||
791 | if (likely(state == SELF_UP_PEER_UP)) | |
792 | return true; | |
d999297c | 793 | |
1a20cc25 JPM |
794 | if (state == SELF_LEAVING_PEER_DOWN) |
795 | return false; | |
d999297c JPM |
796 | |
797 | if (state == SELF_DOWN_PEER_LEAVING) { | |
6e498158 | 798 | if (msg_peer_node_is_up(hdr)) |
d999297c | 799 | return false; |
d999297c | 800 | } |
6e498158 JPM |
801 | |
802 | return true; | |
1a20cc25 JPM |
803 | } |
804 | ||
6c00055a | 805 | static void node_established_contact(struct tipc_node *n_ptr) |
b97bf3fd | 806 | { |
1a20cc25 | 807 | tipc_node_fsm_evt(n_ptr, SELF_ESTABL_CONTACT_EVT); |
aecb9bb8 | 808 | n_ptr->action_flags |= TIPC_NOTIFY_NODE_UP; |
c64f7a6a | 809 | n_ptr->bclink.oos_state = 0; |
1da46568 YX |
810 | n_ptr->bclink.acked = tipc_bclink_get_last_sent(n_ptr->net); |
811 | tipc_bclink_add_node(n_ptr->net, n_ptr->addr); | |
b97bf3fd PL |
812 | } |
813 | ||
598411d7 JPM |
814 | static void node_lost_contact(struct tipc_node *n_ptr, |
815 | struct sk_buff_head *inputq) | |
b97bf3fd | 816 | { |
b97bf3fd | 817 | char addr_string[16]; |
708ac32c | 818 | struct tipc_sock_conn *conn, *safe; |
598411d7 | 819 | struct tipc_link *l; |
708ac32c JPM |
820 | struct list_head *conns = &n_ptr->conn_sks; |
821 | struct sk_buff *skb; | |
822 | struct tipc_net *tn = net_generic(n_ptr->net, tipc_net_id); | |
823 | uint i; | |
b97bf3fd | 824 | |
3fa9cacd EH |
825 | pr_debug("Lost contact with %s\n", |
826 | tipc_addr_string_fill(addr_string, n_ptr->addr)); | |
c5bd4d85 AS |
827 | |
828 | /* Flush broadcast link info associated with lost node */ | |
389dd9bc | 829 | if (n_ptr->bclink.recv_permitted) { |
05dcc5aa | 830 | __skb_queue_purge(&n_ptr->bclink.deferdq); |
c5bd4d85 | 831 | |
37e22164 JPM |
832 | if (n_ptr->bclink.reasm_buf) { |
833 | kfree_skb(n_ptr->bclink.reasm_buf); | |
834 | n_ptr->bclink.reasm_buf = NULL; | |
c5bd4d85 AS |
835 | } |
836 | ||
1da46568 | 837 | tipc_bclink_remove_node(n_ptr->net, n_ptr->addr); |
36559591 | 838 | tipc_bclink_acknowledge(n_ptr, INVALID_LINK_SEQ); |
b97bf3fd | 839 | |
389dd9bc | 840 | n_ptr->bclink.recv_permitted = false; |
c5bd4d85 | 841 | } |
b97bf3fd | 842 | |
dff29b1a | 843 | /* Abort any ongoing link failover */ |
b97bf3fd | 844 | for (i = 0; i < MAX_BEARERS; i++) { |
598411d7 JPM |
845 | l = n_ptr->links[i].link; |
846 | if (l) | |
847 | tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT); | |
b97bf3fd | 848 | } |
598411d7 | 849 | |
708ac32c | 850 | /* Prevent re-contact with node until cleanup is done */ |
1a20cc25 | 851 | tipc_node_fsm_evt(n_ptr, SELF_LOST_CONTACT_EVT); |
708ac32c JPM |
852 | |
853 | /* Notify publications from this node */ | |
854 | n_ptr->action_flags |= TIPC_NOTIFY_NODE_DOWN; | |
855 | ||
856 | /* Notify sockets connected to node */ | |
857 | list_for_each_entry_safe(conn, safe, conns, list) { | |
858 | skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG, | |
859 | SHORT_H_SIZE, 0, tn->own_addr, | |
860 | conn->peer_node, conn->port, | |
861 | conn->peer_port, TIPC_ERR_NO_NODE); | |
23d8335d | 862 | if (likely(skb)) |
598411d7 | 863 | skb_queue_tail(inputq, skb); |
708ac32c JPM |
864 | list_del(&conn->list); |
865 | kfree(conn); | |
866 | } | |
b97bf3fd PL |
867 | } |
868 | ||
78acb1f9 EH |
869 | /** |
870 | * tipc_node_get_linkname - get the name of a link | |
871 | * | |
872 | * @bearer_id: id of the bearer | |
873 | * @node: peer node address | |
874 | * @linkname: link name output buffer | |
875 | * | |
876 | * Returns 0 on success | |
877 | */ | |
f2f9800d YX |
878 | int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr, |
879 | char *linkname, size_t len) | |
78acb1f9 EH |
880 | { |
881 | struct tipc_link *link; | |
8a0f6ebe | 882 | int err = -EINVAL; |
f2f9800d | 883 | struct tipc_node *node = tipc_node_find(net, addr); |
78acb1f9 | 884 | |
8a0f6ebe YX |
885 | if (!node) |
886 | return err; | |
887 | ||
888 | if (bearer_id >= MAX_BEARERS) | |
889 | goto exit; | |
890 | ||
78acb1f9 | 891 | tipc_node_lock(node); |
9d13ec65 | 892 | link = node->links[bearer_id].link; |
78acb1f9 EH |
893 | if (link) { |
894 | strncpy(linkname, link->name, len); | |
8a0f6ebe | 895 | err = 0; |
78acb1f9 | 896 | } |
8a0f6ebe | 897 | exit: |
78acb1f9 | 898 | tipc_node_unlock(node); |
8a0f6ebe YX |
899 | tipc_node_put(node); |
900 | return err; | |
78acb1f9 | 901 | } |
9db9fdd1 YX |
902 | |
903 | void tipc_node_unlock(struct tipc_node *node) | |
904 | { | |
f2f9800d | 905 | struct net *net = node->net; |
ca0c4273 | 906 | u32 addr = 0; |
c637c103 | 907 | u32 flags = node->action_flags; |
7b8613e0 | 908 | u32 link_id = 0; |
708ac32c | 909 | struct list_head *publ_list; |
9db9fdd1 | 910 | |
23d8335d | 911 | if (likely(!flags)) { |
9db9fdd1 YX |
912 | spin_unlock_bh(&node->lock); |
913 | return; | |
914 | } | |
915 | ||
7b8613e0 YX |
916 | addr = node->addr; |
917 | link_id = node->link_id; | |
708ac32c | 918 | publ_list = &node->publ_list; |
7b8613e0 | 919 | |
23d8335d | 920 | node->action_flags &= ~(TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP | |
cb1b7280 JPM |
921 | TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP | |
922 | TIPC_WAKEUP_BCAST_USERS | TIPC_BCAST_MSG_EVT | | |
23d8335d | 923 | TIPC_BCAST_RESET); |
7b8613e0 | 924 | |
9db9fdd1 YX |
925 | spin_unlock_bh(&node->lock); |
926 | ||
708ac32c JPM |
927 | if (flags & TIPC_NOTIFY_NODE_DOWN) |
928 | tipc_publ_notify(net, publ_list, addr); | |
50100a5e | 929 | |
908344cd | 930 | if (flags & TIPC_WAKEUP_BCAST_USERS) |
f2f9800d | 931 | tipc_bclink_wakeup_users(net); |
908344cd | 932 | |
7b8613e0 | 933 | if (flags & TIPC_NOTIFY_NODE_UP) |
f2f9800d | 934 | tipc_named_node_up(net, addr); |
7b8613e0 YX |
935 | |
936 | if (flags & TIPC_NOTIFY_LINK_UP) | |
f2f9800d | 937 | tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr, |
7b8613e0 YX |
938 | TIPC_NODE_SCOPE, link_id, addr); |
939 | ||
940 | if (flags & TIPC_NOTIFY_LINK_DOWN) | |
f2f9800d | 941 | tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr, |
7b8613e0 | 942 | link_id, addr); |
c637c103 | 943 | |
cb1b7280 JPM |
944 | if (flags & TIPC_BCAST_MSG_EVT) |
945 | tipc_bclink_input(net); | |
b952b2be YX |
946 | |
947 | if (flags & TIPC_BCAST_RESET) | |
6144a996 | 948 | tipc_node_reset_links(node); |
9db9fdd1 | 949 | } |
3e4b6ab5 RA |
950 | |
951 | /* Caller should hold node lock for the passed node */ | |
d8182804 | 952 | static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node) |
3e4b6ab5 RA |
953 | { |
954 | void *hdr; | |
955 | struct nlattr *attrs; | |
956 | ||
bfb3e5dd | 957 | hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family, |
3e4b6ab5 RA |
958 | NLM_F_MULTI, TIPC_NL_NODE_GET); |
959 | if (!hdr) | |
960 | return -EMSGSIZE; | |
961 | ||
962 | attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE); | |
963 | if (!attrs) | |
964 | goto msg_full; | |
965 | ||
966 | if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr)) | |
967 | goto attr_msg_full; | |
968 | if (tipc_node_is_up(node)) | |
969 | if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP)) | |
970 | goto attr_msg_full; | |
971 | ||
972 | nla_nest_end(msg->skb, attrs); | |
973 | genlmsg_end(msg->skb, hdr); | |
974 | ||
975 | return 0; | |
976 | ||
977 | attr_msg_full: | |
978 | nla_nest_cancel(msg->skb, attrs); | |
979 | msg_full: | |
980 | genlmsg_cancel(msg->skb, hdr); | |
981 | ||
982 | return -EMSGSIZE; | |
983 | } | |
984 | ||
af9b028e JPM |
985 | static struct tipc_link *tipc_node_select_link(struct tipc_node *n, int sel, |
986 | int *bearer_id, | |
987 | struct tipc_media_addr **maddr) | |
988 | { | |
989 | int id = n->active_links[sel & 1]; | |
990 | ||
991 | if (unlikely(id < 0)) | |
992 | return NULL; | |
993 | ||
994 | *bearer_id = id; | |
995 | *maddr = &n->links[id].maddr; | |
996 | return n->links[id].link; | |
997 | } | |
998 | ||
999 | /** | |
1000 | * tipc_node_xmit() is the general link level function for message sending | |
1001 | * @net: the applicable net namespace | |
1002 | * @list: chain of buffers containing message | |
1003 | * @dnode: address of destination node | |
1004 | * @selector: a number used for deterministic link selection | |
1005 | * Consumes the buffer chain, except when returning -ELINKCONG | |
1006 | * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE | |
1007 | */ | |
1008 | int tipc_node_xmit(struct net *net, struct sk_buff_head *list, | |
1009 | u32 dnode, int selector) | |
1010 | { | |
1011 | struct tipc_link *l = NULL; | |
1012 | struct tipc_node *n; | |
1013 | struct sk_buff_head xmitq; | |
1014 | struct tipc_media_addr *maddr; | |
1015 | int bearer_id; | |
1016 | int rc = -EHOSTUNREACH; | |
1017 | ||
1018 | __skb_queue_head_init(&xmitq); | |
1019 | n = tipc_node_find(net, dnode); | |
1020 | if (likely(n)) { | |
1021 | tipc_node_lock(n); | |
1022 | l = tipc_node_select_link(n, selector, &bearer_id, &maddr); | |
1023 | if (likely(l)) | |
1024 | rc = tipc_link_xmit(l, list, &xmitq); | |
af9b028e | 1025 | tipc_node_unlock(n); |
598411d7 JPM |
1026 | if (unlikely(rc == -ENOBUFS)) |
1027 | tipc_node_link_down(n, bearer_id, false); | |
af9b028e JPM |
1028 | tipc_node_put(n); |
1029 | } | |
1030 | if (likely(!rc)) { | |
1031 | tipc_bearer_xmit(net, bearer_id, &xmitq, maddr); | |
1032 | return 0; | |
1033 | } | |
1034 | if (likely(in_own_node(net, dnode))) { | |
1035 | tipc_sk_rcv(net, list); | |
1036 | return 0; | |
1037 | } | |
1038 | return rc; | |
1039 | } | |
1040 | ||
1041 | /* tipc_node_xmit_skb(): send single buffer to destination | |
1042 | * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE | |
1043 | * messages, which will not be rejected | |
1044 | * The only exception is datagram messages rerouted after secondary | |
1045 | * lookup, which are rare and safe to dispose of anyway. | |
1046 | * TODO: Return real return value, and let callers use | |
1047 | * tipc_wait_for_sendpkt() where applicable | |
1048 | */ | |
1049 | int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode, | |
1050 | u32 selector) | |
1051 | { | |
1052 | struct sk_buff_head head; | |
1053 | int rc; | |
1054 | ||
1055 | skb_queue_head_init(&head); | |
1056 | __skb_queue_tail(&head, skb); | |
1057 | rc = tipc_node_xmit(net, &head, dnode, selector); | |
1058 | if (rc == -ELINKCONG) | |
1059 | kfree_skb(skb); | |
1060 | return 0; | |
1061 | } | |
1062 | ||
6e498158 JPM |
1063 | /** |
1064 | * tipc_node_check_state - check and if necessary update node state | |
1065 | * @skb: TIPC packet | |
1066 | * @bearer_id: identity of bearer delivering the packet | |
1067 | * Returns true if state is ok, otherwise consumes buffer and returns false | |
6144a996 | 1068 | */ |
6e498158 | 1069 | static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb, |
662921cd | 1070 | int bearer_id, struct sk_buff_head *xmitq) |
6144a996 | 1071 | { |
6144a996 | 1072 | struct tipc_msg *hdr = buf_msg(skb); |
6e498158 JPM |
1073 | int usr = msg_user(hdr); |
1074 | int mtyp = msg_type(hdr); | |
6144a996 | 1075 | u16 oseqno = msg_seqno(hdr); |
6e498158 JPM |
1076 | u16 iseqno = msg_seqno(msg_get_wrapped(hdr)); |
1077 | u16 exp_pkts = msg_msgcnt(hdr); | |
1078 | u16 rcv_nxt, syncpt, dlv_nxt; | |
1079 | int state = n->state; | |
1080 | struct tipc_link *l, *pl = NULL; | |
598411d7 JPM |
1081 | struct tipc_media_addr *maddr; |
1082 | int i, pb_id; | |
6144a996 | 1083 | |
6e498158 JPM |
1084 | l = n->links[bearer_id].link; |
1085 | if (!l) | |
1086 | return false; | |
1087 | rcv_nxt = l->rcv_nxt; | |
6144a996 | 1088 | |
6144a996 | 1089 | |
6e498158 JPM |
1090 | if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) |
1091 | return true; | |
6144a996 | 1092 | |
6e498158 JPM |
1093 | /* Find parallel link, if any */ |
1094 | for (i = 0; i < MAX_BEARERS; i++) { | |
1095 | if ((i != bearer_id) && n->links[i].link) { | |
1096 | pl = n->links[i].link; | |
1097 | break; | |
1098 | } | |
1099 | } | |
6144a996 | 1100 | |
6e498158 JPM |
1101 | /* Update node accesibility if applicable */ |
1102 | if (state == SELF_UP_PEER_COMING) { | |
1103 | if (!tipc_link_is_up(l)) | |
1104 | return true; | |
1105 | if (!msg_peer_link_is_up(hdr)) | |
1106 | return true; | |
1107 | tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT); | |
1108 | } | |
1109 | ||
1110 | if (state == SELF_DOWN_PEER_LEAVING) { | |
1111 | if (msg_peer_node_is_up(hdr)) | |
1112 | return false; | |
1113 | tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT); | |
1114 | } | |
1115 | ||
1116 | /* Ignore duplicate packets */ | |
1117 | if (less(oseqno, rcv_nxt)) | |
1118 | return true; | |
1119 | ||
1120 | /* Initiate or update failover mode if applicable */ | |
1121 | if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) { | |
1122 | syncpt = oseqno + exp_pkts - 1; | |
598411d7 JPM |
1123 | if (pl && tipc_link_is_up(pl)) { |
1124 | pb_id = pl->bearer_id; | |
1125 | __tipc_node_link_down(n, &pb_id, xmitq, &maddr); | |
1126 | tipc_skb_queue_splice_tail_init(pl->inputq, l->inputq); | |
1127 | } | |
6e498158 JPM |
1128 | /* If pkts arrive out of order, use lowest calculated syncpt */ |
1129 | if (less(syncpt, n->sync_point)) | |
1130 | n->sync_point = syncpt; | |
1131 | } | |
1132 | ||
1133 | /* Open parallel link when tunnel link reaches synch point */ | |
17b20630 | 1134 | if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) { |
662921cd JPM |
1135 | if (!more(rcv_nxt, n->sync_point)) |
1136 | return true; | |
6e498158 JPM |
1137 | tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT); |
1138 | if (pl) | |
662921cd | 1139 | tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT); |
6e498158 JPM |
1140 | return true; |
1141 | } | |
1142 | ||
1143 | /* Initiate or update synch mode if applicable */ | |
1144 | if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG)) { | |
1145 | syncpt = iseqno + exp_pkts - 1; | |
662921cd JPM |
1146 | if (!tipc_link_is_up(l)) { |
1147 | tipc_link_fsm_evt(l, LINK_ESTABLISH_EVT); | |
598411d7 | 1148 | __tipc_node_link_up(n, bearer_id, xmitq); |
662921cd | 1149 | } |
6e498158 JPM |
1150 | if (n->state == SELF_UP_PEER_UP) { |
1151 | n->sync_point = syncpt; | |
662921cd | 1152 | tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT); |
6e498158 JPM |
1153 | tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT); |
1154 | } | |
6e498158 JPM |
1155 | if (less(syncpt, n->sync_point)) |
1156 | n->sync_point = syncpt; | |
6144a996 | 1157 | } |
6e498158 JPM |
1158 | |
1159 | /* Open tunnel link when parallel link reaches synch point */ | |
662921cd | 1160 | if ((n->state == NODE_SYNCHING) && tipc_link_is_synching(l)) { |
6e498158 JPM |
1161 | if (pl) |
1162 | dlv_nxt = mod(pl->rcv_nxt - skb_queue_len(pl->inputq)); | |
1163 | if (!pl || more(dlv_nxt, n->sync_point)) { | |
662921cd | 1164 | tipc_link_fsm_evt(l, LINK_SYNCH_END_EVT); |
6e498158 | 1165 | tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT); |
6e498158 JPM |
1166 | return true; |
1167 | } | |
1168 | if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG)) | |
1169 | return true; | |
1170 | if (usr == LINK_PROTOCOL) | |
1171 | return true; | |
1172 | return false; | |
1173 | } | |
1174 | return true; | |
6144a996 JPM |
1175 | } |
1176 | ||
d999297c JPM |
1177 | /** |
1178 | * tipc_rcv - process TIPC packets/messages arriving from off-node | |
1179 | * @net: the applicable net namespace | |
1180 | * @skb: TIPC packet | |
1181 | * @bearer: pointer to bearer message arrived on | |
1182 | * | |
1183 | * Invoked with no locks held. Bearer pointer must point to a valid bearer | |
1184 | * structure (i.e. cannot be NULL), but bearer can be inactive. | |
1185 | */ | |
1186 | void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b) | |
1187 | { | |
1188 | struct sk_buff_head xmitq; | |
1189 | struct tipc_node *n; | |
6e498158 JPM |
1190 | struct tipc_msg *hdr = buf_msg(skb); |
1191 | int usr = msg_user(hdr); | |
d999297c | 1192 | int bearer_id = b->identity; |
6e498158 | 1193 | struct tipc_link_entry *le; |
d999297c JPM |
1194 | int rc = 0; |
1195 | ||
1196 | __skb_queue_head_init(&xmitq); | |
1197 | ||
1198 | /* Ensure message is well-formed */ | |
1199 | if (unlikely(!tipc_msg_validate(skb))) | |
1200 | goto discard; | |
1201 | ||
1202 | /* Handle arrival of a non-unicast link packet */ | |
d999297c | 1203 | if (unlikely(msg_non_seq(hdr))) { |
6144a996 | 1204 | if (usr == LINK_CONFIG) |
d999297c JPM |
1205 | tipc_disc_rcv(net, skb, b); |
1206 | else | |
1207 | tipc_bclink_rcv(net, skb); | |
1208 | return; | |
1209 | } | |
1210 | ||
1211 | /* Locate neighboring node that sent packet */ | |
1212 | n = tipc_node_find(net, msg_prevnode(hdr)); | |
1213 | if (unlikely(!n)) | |
1214 | goto discard; | |
6e498158 | 1215 | le = &n->links[bearer_id]; |
d999297c | 1216 | |
6e498158 | 1217 | tipc_node_lock(n); |
6144a996 | 1218 | |
6e498158 JPM |
1219 | /* Is reception permitted at the moment ? */ |
1220 | if (!tipc_node_filter_pkt(n, hdr)) | |
d999297c JPM |
1221 | goto unlock; |
1222 | ||
6e498158 | 1223 | if (unlikely(msg_user(hdr) == LINK_PROTOCOL)) |
d999297c JPM |
1224 | tipc_bclink_sync_state(n, hdr); |
1225 | ||
598411d7 | 1226 | /* Release acked broadcast packets */ |
d999297c JPM |
1227 | if (unlikely(n->bclink.acked != msg_bcast_ack(hdr))) |
1228 | tipc_bclink_acknowledge(n, msg_bcast_ack(hdr)); | |
1229 | ||
6e498158 | 1230 | /* Check and if necessary update node state */ |
662921cd | 1231 | if (likely(tipc_node_check_state(n, skb, bearer_id, &xmitq))) { |
6e498158 JPM |
1232 | rc = tipc_link_rcv(le->link, skb, &xmitq); |
1233 | skb = NULL; | |
1234 | } | |
598411d7 JPM |
1235 | unlock: |
1236 | tipc_node_unlock(n); | |
d999297c JPM |
1237 | |
1238 | if (unlikely(rc & TIPC_LINK_UP_EVT)) | |
6e498158 JPM |
1239 | tipc_node_link_up(n, bearer_id, &xmitq); |
1240 | ||
d999297c | 1241 | if (unlikely(rc & TIPC_LINK_DOWN_EVT)) |
598411d7 | 1242 | tipc_node_link_down(n, bearer_id, false); |
6e498158 | 1243 | |
23d8335d JPM |
1244 | if (unlikely(!skb_queue_empty(&n->bclink.namedq))) |
1245 | tipc_named_rcv(net, &n->bclink.namedq); | |
1246 | ||
6e498158 JPM |
1247 | if (!skb_queue_empty(&le->inputq)) |
1248 | tipc_sk_rcv(net, &le->inputq); | |
1249 | ||
1250 | if (!skb_queue_empty(&xmitq)) | |
1251 | tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr); | |
1252 | ||
d999297c JPM |
1253 | tipc_node_put(n); |
1254 | discard: | |
1255 | kfree_skb(skb); | |
1256 | } | |
1257 | ||
3e4b6ab5 RA |
1258 | int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb) |
1259 | { | |
1260 | int err; | |
f2f9800d YX |
1261 | struct net *net = sock_net(skb->sk); |
1262 | struct tipc_net *tn = net_generic(net, tipc_net_id); | |
3e4b6ab5 RA |
1263 | int done = cb->args[0]; |
1264 | int last_addr = cb->args[1]; | |
1265 | struct tipc_node *node; | |
1266 | struct tipc_nl_msg msg; | |
1267 | ||
1268 | if (done) | |
1269 | return 0; | |
1270 | ||
1271 | msg.skb = skb; | |
1272 | msg.portid = NETLINK_CB(cb->skb).portid; | |
1273 | msg.seq = cb->nlh->nlmsg_seq; | |
1274 | ||
1275 | rcu_read_lock(); | |
8a0f6ebe YX |
1276 | if (last_addr) { |
1277 | node = tipc_node_find(net, last_addr); | |
1278 | if (!node) { | |
1279 | rcu_read_unlock(); | |
1280 | /* We never set seq or call nl_dump_check_consistent() | |
1281 | * this means that setting prev_seq here will cause the | |
1282 | * consistence check to fail in the netlink callback | |
1283 | * handler. Resulting in the NLMSG_DONE message having | |
1284 | * the NLM_F_DUMP_INTR flag set if the node state | |
1285 | * changed while we released the lock. | |
1286 | */ | |
1287 | cb->prev_seq = 1; | |
1288 | return -EPIPE; | |
1289 | } | |
1290 | tipc_node_put(node); | |
3e4b6ab5 RA |
1291 | } |
1292 | ||
f2f9800d | 1293 | list_for_each_entry_rcu(node, &tn->node_list, list) { |
3e4b6ab5 RA |
1294 | if (last_addr) { |
1295 | if (node->addr == last_addr) | |
1296 | last_addr = 0; | |
1297 | else | |
1298 | continue; | |
1299 | } | |
1300 | ||
1301 | tipc_node_lock(node); | |
1302 | err = __tipc_nl_add_node(&msg, node); | |
1303 | if (err) { | |
1304 | last_addr = node->addr; | |
1305 | tipc_node_unlock(node); | |
1306 | goto out; | |
1307 | } | |
1308 | ||
1309 | tipc_node_unlock(node); | |
1310 | } | |
1311 | done = 1; | |
1312 | out: | |
1313 | cb->args[0] = done; | |
1314 | cb->args[1] = last_addr; | |
1315 | rcu_read_unlock(); | |
1316 | ||
1317 | return skb->len; | |
1318 | } |