]> git.proxmox.com Git - mirror_ubuntu-jammy-kernel.git/blame - net/tipc/node.c
projects / mirror_ubuntu-jammy-kernel.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
net: phy: improve resuming from hibernation
[mirror_ubuntu-jammy-kernel.git] / net / tipc / node.c
CommitLineData
b97bf3fd
PL		 1/*
2 * net/tipc/node.c: TIPC node management routines
c4307285 3 *
60020e18 4 * Copyright (c) 2000-2006, 2012-2016, 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"
35c55c98 43#include "monitor.h"
d999297c 44#include "discover.h"
49cc66ea 45#include "netlink.h"
b4b9771b 46#include "trace.h"
c8199300 47
5be9c086 48#define INVALID_NODE_SIG 0x10000
6a939f36 49#define NODE_CLEANUP_AFTER 300000
5be9c086 50
5be9c086
JPM		 51/* Flags used to take different actions according to flag type
52 * TIPC_NOTIFY_NODE_DOWN: notify node is down
53 * TIPC_NOTIFY_NODE_UP: notify node is up
54 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
55 */
56enum {
57 TIPC_NOTIFY_NODE_DOWN = (1 << 3),
58 TIPC_NOTIFY_NODE_UP = (1 << 4),
59 TIPC_NOTIFY_LINK_UP = (1 << 6),
60 TIPC_NOTIFY_LINK_DOWN = (1 << 7)
61};
62
63struct tipc_link_entry {
64 struct tipc_link *link;
65 spinlock_t lock; /* per link */
66 u32 mtu;
67 struct sk_buff_head inputq;
68 struct tipc_media_addr maddr;
69};
70
71struct tipc_bclink_entry {
72 struct tipc_link *link;
73 struct sk_buff_head inputq1;
74 struct sk_buff_head arrvq;
75 struct sk_buff_head inputq2;
76 struct sk_buff_head namedq;
77};
78
79/**
80 * struct tipc_node - TIPC node structure
81 * @addr: network address of node
82 * @ref: reference counter to node object
83 * @lock: rwlock governing access to structure
84 * @net: the applicable net namespace
85 * @hash: links to adjacent nodes in unsorted hash chain
86 * @inputq: pointer to input queue containing messages for msg event
87 * @namedq: pointer to name table input queue with name table messages
88 * @active_links: bearer ids of active links, used as index into links[] array
89 * @links: array containing references to all links to node
90 * @action_flags: bit mask of different types of node actions
91 * @state: connectivity state vs peer node
92 * @sync_point: sequence number where synch/failover is finished
93 * @list: links to adjacent nodes in sorted list of cluster's nodes
94 * @working_links: number of working links to node (both active and standby)
95 * @link_cnt: number of links to node
96 * @capabilities: bitmap, indicating peer node's functional capabilities
97 * @signature: node instance identifier
98 * @link_id: local and remote bearer ids of changing link, if any
99 * @publ_list: list of publications
100 * @rcu: rcu struct for tipc_node
6a939f36 101 * @delete_at: indicates the time for deleting a down node
5be9c086
JPM		 102 */
103struct tipc_node {
104 u32 addr;
105 struct kref kref;
106 rwlock_t lock;
107 struct net *net;
108 struct hlist_node hash;
109 int active_links[2];
110 struct tipc_link_entry links[MAX_BEARERS];
111 struct tipc_bclink_entry bc_entry;
112 int action_flags;
113 struct list_head list;
114 int state;
c140eb16 115 bool failover_sent;
5be9c086
JPM		 116 u16 sync_point;
117 int link_cnt;
118 u16 working_links;
119 u16 capabilities;
120 u32 signature;
121 u32 link_id;
25b0b9c4 122 u8 peer_id[16];
5be9c086
JPM		 123 struct list_head publ_list;
124 struct list_head conn_sks;
125 unsigned long keepalive_intv;
126 struct timer_list timer;
127 struct rcu_head rcu;
6a939f36 128 unsigned long delete_at;
5be9c086
JPM		 129};
130
6e498158
JPM		 131/* Node FSM states and events:
132 */
133enum {
134 SELF_DOWN_PEER_DOWN = 0xdd,
135 SELF_UP_PEER_UP = 0xaa,
136 SELF_DOWN_PEER_LEAVING = 0xd1,
137 SELF_UP_PEER_COMING = 0xac,
138 SELF_COMING_PEER_UP = 0xca,
139 SELF_LEAVING_PEER_DOWN = 0x1d,
140 NODE_FAILINGOVER = 0xf0,
141 NODE_SYNCHING = 0xcc
142};
143
144enum {
145 SELF_ESTABL_CONTACT_EVT = 0xece,
146 SELF_LOST_CONTACT_EVT = 0x1ce,
147 PEER_ESTABL_CONTACT_EVT = 0x9ece,
148 PEER_LOST_CONTACT_EVT = 0x91ce,
149 NODE_FAILOVER_BEGIN_EVT = 0xfbe,
150 NODE_FAILOVER_END_EVT = 0xfee,
151 NODE_SYNCH_BEGIN_EVT = 0xcbe,
152 NODE_SYNCH_END_EVT = 0xcee
153};
154
598411d7
JPM		 155static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
156 struct sk_buff_head *xmitq,
157 struct tipc_media_addr **maddr);
158static void tipc_node_link_down(struct tipc_node *n, int bearer_id,
159 bool delete);
160static void node_lost_contact(struct tipc_node *n, struct sk_buff_head *inputq);
8a0f6ebe 161static void tipc_node_delete(struct tipc_node *node);
31b102bb 162static void tipc_node_timeout(struct timer_list *t);
d999297c 163static void tipc_node_fsm_evt(struct tipc_node *n, int evt);
5be9c086 164static struct tipc_node *tipc_node_find(struct net *net, u32 addr);
25b0b9c4 165static struct tipc_node *tipc_node_find_by_id(struct net *net, u8 *id);
5be9c086 166static void tipc_node_put(struct tipc_node *node);
38077b8e 167static bool node_is_up(struct tipc_node *n);
6a939f36 168static void tipc_node_delete_from_list(struct tipc_node *node);
b97bf3fd 169
02be61a9
JPM		 170struct tipc_sock_conn {
171 u32 port;
172 u32 peer_port;
173 u32 peer_node;
174 struct list_head list;
175};
176
5be9c086
JPM		 177static struct tipc_link *node_active_link(struct tipc_node *n, int sel)
178{
179 int bearer_id = n->active_links[sel & 1];
180
181 if (unlikely(bearer_id == INVALID_BEARER_ID))
182 return NULL;
183
184 return n->links[bearer_id].link;
185}
186
187int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel)
188{
189 struct tipc_node *n;
190 int bearer_id;
191 unsigned int mtu = MAX_MSG_SIZE;
192
193 n = tipc_node_find(net, addr);
194 if (unlikely(!n))
195 return mtu;
196
197 bearer_id = n->active_links[sel & 1];
198 if (likely(bearer_id != INVALID_BEARER_ID))
199 mtu = n->links[bearer_id].mtu;
200 tipc_node_put(n);
201 return mtu;
202}
60020e18 203
3e5cf362
JM		 204bool tipc_node_get_id(struct net *net, u32 addr, u8 *id)
205{
206 u8 *own_id = tipc_own_id(net);
207 struct tipc_node *n;
208
209 if (!own_id)
210 return true;
211
212 if (addr == tipc_own_addr(net)) {
213 memcpy(id, own_id, TIPC_NODEID_LEN);
214 return true;
215 }
216 n = tipc_node_find(net, addr);
217 if (!n)
218 return false;
219
220 memcpy(id, &n->peer_id, TIPC_NODEID_LEN);
221 tipc_node_put(n);
222 return true;
223}
224
60020e18
JPM		 225u16 tipc_node_get_capabilities(struct net *net, u32 addr)
226{
227 struct tipc_node *n;
228 u16 caps;
229
230 n = tipc_node_find(net, addr);
231 if (unlikely(!n))
232 return TIPC_NODE_CAPABILITIES;
233 caps = n->capabilities;
234 tipc_node_put(n);
235 return caps;
236}
237
8a0f6ebe
YX		 238static void tipc_node_kref_release(struct kref *kref)
239{
d25a0125 240 struct tipc_node *n = container_of(kref, struct tipc_node, kref);
8a0f6ebe 241
d25a0125
JPM		 242 kfree(n->bc_entry.link);
243 kfree_rcu(n, rcu);
8a0f6ebe
YX		 244}
245
5be9c086 246static void tipc_node_put(struct tipc_node *node)
8a0f6ebe
YX		 247{
248 kref_put(&node->kref, tipc_node_kref_release);
249}
250
251static void tipc_node_get(struct tipc_node *node)
252{
253 kref_get(&node->kref);
254}
255
1ec2bb08 256/*
672d99e1
AS		 257 * tipc_node_find - locate specified node object, if it exists
258 */
5be9c086 259static struct tipc_node *tipc_node_find(struct net *net, u32 addr)
672d99e1 260{
b170997a 261 struct tipc_net *tn = tipc_net(net);
672d99e1 262 struct tipc_node *node;
b170997a 263 unsigned int thash = tipc_hashfn(addr);
672d99e1 264
6c7a762e 265 rcu_read_lock();
b170997a
JPM		 266 hlist_for_each_entry_rcu(node, &tn->node_htable[thash], hash) {
267 if (node->addr != addr)
268 continue;
269 if (!kref_get_unless_zero(&node->kref))
270 node = NULL;
271 break;
672d99e1 272 }
6c7a762e 273 rcu_read_unlock();
b170997a 274 return node;
672d99e1
AS		 275}
276
25b0b9c4
JM		 277/* tipc_node_find_by_id - locate specified node object by its 128-bit id
278 * Note: this function is called only when a discovery request failed
279 * to find the node by its 32-bit id, and is not time critical
280 */
281static struct tipc_node *tipc_node_find_by_id(struct net *net, u8 *id)
282{
283 struct tipc_net *tn = tipc_net(net);
284 struct tipc_node *n;
285 bool found = false;
286
287 rcu_read_lock();
288 list_for_each_entry_rcu(n, &tn->node_list, list) {
289 read_lock_bh(&n->lock);
290 if (!memcmp(id, n->peer_id, 16) &&
291 kref_get_unless_zero(&n->kref))
292 found = true;
293 read_unlock_bh(&n->lock);
294 if (found)
295 break;
296 }
297 rcu_read_unlock();
298 return found ? n : NULL;
299}
300
5be9c086 301static void tipc_node_read_lock(struct tipc_node *n)
5405ff6e
JPM		 302{
303 read_lock_bh(&n->lock);
304}
305
5be9c086 306static void tipc_node_read_unlock(struct tipc_node *n)
5405ff6e
JPM		 307{
308 read_unlock_bh(&n->lock);
309}
310
311static void tipc_node_write_lock(struct tipc_node *n)
312{
313 write_lock_bh(&n->lock);
314}
315
93f955aa
PB		 316static void tipc_node_write_unlock_fast(struct tipc_node *n)
317{
318 write_unlock_bh(&n->lock);
319}
320
5405ff6e
JPM		 321static void tipc_node_write_unlock(struct tipc_node *n)
322{
323 struct net *net = n->net;
324 u32 addr = 0;
325 u32 flags = n->action_flags;
326 u32 link_id = 0;
35c55c98 327 u32 bearer_id;
5405ff6e
JPM		 328 struct list_head *publ_list;
329
330 if (likely(!flags)) {
331 write_unlock_bh(&n->lock);
332 return;
333 }
334
335 addr = n->addr;
336 link_id = n->link_id;
35c55c98 337 bearer_id = link_id & 0xffff;
5405ff6e
JPM		 338 publ_list = &n->publ_list;
339
340 n->action_flags &= ~(TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP |
341 TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP);
342
343 write_unlock_bh(&n->lock);
344
345 if (flags & TIPC_NOTIFY_NODE_DOWN)
346 tipc_publ_notify(net, publ_list, addr);
347
348 if (flags & TIPC_NOTIFY_NODE_UP)
349 tipc_named_node_up(net, addr);
350
35c55c98
JPM		 351 if (flags & TIPC_NOTIFY_LINK_UP) {
352 tipc_mon_peer_up(net, addr, bearer_id);
5405ff6e 353 tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr,
218527fe 354 TIPC_NODE_SCOPE, link_id, link_id);
35c55c98
JPM		 355 }
356 if (flags & TIPC_NOTIFY_LINK_DOWN) {
357 tipc_mon_peer_down(net, addr, bearer_id);
5405ff6e 358 tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr,
37922ea4 359 addr, link_id);
35c55c98 360 }
5405ff6e
JPM		 361}
362
e1a22d13
WY		 363static struct tipc_node *tipc_node_create(struct net *net, u32 addr,
364 u8 *peer_id, u16 capabilities)
b97bf3fd 365{
f2f9800d 366 struct tipc_net *tn = net_generic(net, tipc_net_id);
1a90632d 367 struct tipc_node *n, *temp_node;
9012de50
JM		 368 struct tipc_link *l;
369 int bearer_id;
5405ff6e 370 int i;
b97bf3fd 371
f2f9800d 372 spin_lock_bh(&tn->node_list_lock);
1a90632d 373 n = tipc_node_find(net, addr);
60020e18 374 if (n) {
40999f11
JM		 375 if (n->capabilities == capabilities)
376 goto exit;
60020e18 377 /* Same node may come back with new capabilities */
909620ff 378 tipc_node_write_lock(n);
60020e18 379 n->capabilities = capabilities;
9012de50
JM		 380 for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) {
381 l = n->links[bearer_id].link;
382 if (l)
383 tipc_link_update_caps(l, capabilities);
384 }
909620ff
JM		 385 tipc_node_write_unlock_fast(n);
386
ff2ebbfb
HL		 387 /* Calculate cluster capabilities */
388 tn->capabilities = TIPC_NODE_CAPABILITIES;
389 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
390 tn->capabilities &= temp_node->capabilities;
391 }
b45db71b 392 goto exit;
60020e18 393 }
1a90632d
JPM		 394 n = kzalloc(sizeof(*n), GFP_ATOMIC);
395 if (!n) {
2cf8aa19 396 pr_warn("Node creation failed, no memory\n");
b45db71b 397 goto exit;
a10bd924 398 }
1a90632d 399 n->addr = addr;
25b0b9c4 400 memcpy(&n->peer_id, peer_id, 16);
1a90632d
JPM		 401 n->net = net;
402 n->capabilities = capabilities;
403 kref_init(&n->kref);
404 rwlock_init(&n->lock);
405 INIT_HLIST_NODE(&n->hash);
406 INIT_LIST_HEAD(&n->list);
407 INIT_LIST_HEAD(&n->publ_list);
408 INIT_LIST_HEAD(&n->conn_sks);
409 skb_queue_head_init(&n->bc_entry.namedq);
410 skb_queue_head_init(&n->bc_entry.inputq1);
411 __skb_queue_head_init(&n->bc_entry.arrvq);
412 skb_queue_head_init(&n->bc_entry.inputq2);
5405ff6e 413 for (i = 0; i < MAX_BEARERS; i++)
1a90632d 414 spin_lock_init(&n->links[i].lock);
1a90632d 415 n->state = SELF_DOWN_PEER_LEAVING;
6a939f36 416 n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
1a90632d
JPM		 417 n->signature = INVALID_NODE_SIG;
418 n->active_links[0] = INVALID_BEARER_ID;
419 n->active_links[1] = INVALID_BEARER_ID;
25b0b9c4
JM		 420 if (!tipc_link_bc_create(net, tipc_own_addr(net),
421 addr, U16_MAX,
38206d59 422 tipc_link_window(tipc_bc_sndlink(net)),
1a90632d
JPM		 423 n->capabilities,
424 &n->bc_entry.inputq1,
425 &n->bc_entry.namedq,
52666986 426 tipc_bc_sndlink(net),
1a90632d 427 &n->bc_entry.link)) {
52666986 428 pr_warn("Broadcast rcv link creation failed, no memory\n");
1a90632d
JPM		 429 kfree(n);
430 n = NULL;
52666986
JPM		 431 goto exit;
432 }
1a90632d 433 tipc_node_get(n);
31b102bb 434 timer_setup(&n->timer, tipc_node_timeout, 0);
1a90632d 435 n->keepalive_intv = U32_MAX;
d5c91fb7
JPM		 436 hlist_add_head_rcu(&n->hash, &tn->node_htable[tipc_hashfn(addr)]);
437 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
438 if (n->addr < temp_node->addr)
439 break;
440 }
441 list_add_tail_rcu(&n->list, &temp_node->list);
ff2ebbfb
HL		 442 /* Calculate cluster capabilities */
443 tn->capabilities = TIPC_NODE_CAPABILITIES;
444 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
445 tn->capabilities &= temp_node->capabilities;
446 }
eb18a510 447 trace_tipc_node_create(n, true, " ");
b45db71b 448exit:
f2f9800d 449 spin_unlock_bh(&tn->node_list_lock);
1a90632d 450 return n;
b97bf3fd
PL		 451}
452
8a1577c9
JPM		 453static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l)
454{
38206d59 455 unsigned long tol = tipc_link_tolerance(l);
8a1577c9 456 unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4;
8a1577c9
JPM		 457
458 /* Link with lowest tolerance determines timer interval */
5ca509fc
JPM		 459 if (intv < n->keepalive_intv)
460 n->keepalive_intv = intv;
8a1577c9 461
5ca509fc
JPM		 462 /* Ensure link's abort limit corresponds to current tolerance */
463 tipc_link_set_abort_limit(l, tol / n->keepalive_intv);
8a1577c9
JPM		 464}
465
6a939f36 466static void tipc_node_delete_from_list(struct tipc_node *node)
b97bf3fd 467{
8a0f6ebe
YX		 468 list_del_rcu(&node->list);
469 hlist_del_rcu(&node->hash);
d25a0125 470 tipc_node_put(node);
6a939f36
GM		 471}
472
473static void tipc_node_delete(struct tipc_node *node)
474{
eb18a510 475 trace_tipc_node_delete(node, true, " ");
6a939f36 476 tipc_node_delete_from_list(node);
d25a0125
JPM		 477
478 del_timer_sync(&node->timer);
479 tipc_node_put(node);
b97bf3fd
PL		 480}
481
f2f9800d 482void tipc_node_stop(struct net *net)
46651c59 483{
d25a0125 484 struct tipc_net *tn = tipc_net(net);
46651c59
YX		 485 struct tipc_node *node, *t_node;
486
f2f9800d 487 spin_lock_bh(&tn->node_list_lock);
d25a0125
JPM		 488 list_for_each_entry_safe(node, t_node, &tn->node_list, list)
489 tipc_node_delete(node);
f2f9800d 490 spin_unlock_bh(&tn->node_list_lock);
46651c59
YX		 491}
492
1d7e1c25
JPM		 493void tipc_node_subscribe(struct net *net, struct list_head *subscr, u32 addr)
494{
495 struct tipc_node *n;
496
497 if (in_own_node(net, addr))
498 return;
499
500 n = tipc_node_find(net, addr);
501 if (!n) {
502 pr_warn("Node subscribe rejected, unknown node 0x%x\n", addr);
503 return;
504 }
5405ff6e 505 tipc_node_write_lock(n);
1d7e1c25 506 list_add_tail(subscr, &n->publ_list);
93f955aa 507 tipc_node_write_unlock_fast(n);
1d7e1c25
JPM		 508 tipc_node_put(n);
509}
510
511void tipc_node_unsubscribe(struct net *net, struct list_head *subscr, u32 addr)
512{
513 struct tipc_node *n;
514
515 if (in_own_node(net, addr))
516 return;
517
518 n = tipc_node_find(net, addr);
519 if (!n) {
520 pr_warn("Node unsubscribe rejected, unknown node 0x%x\n", addr);
521 return;
522 }
5405ff6e 523 tipc_node_write_lock(n);
1d7e1c25 524 list_del_init(subscr);
93f955aa 525 tipc_node_write_unlock_fast(n);
1d7e1c25
JPM		 526 tipc_node_put(n);
527}
528
f2f9800d 529int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port)
02be61a9
JPM		 530{
531 struct tipc_node *node;
532 struct tipc_sock_conn *conn;
8a0f6ebe 533 int err = 0;
02be61a9 534
34747539 535 if (in_own_node(net, dnode))
02be61a9
JPM		 536 return 0;
537
f2f9800d 538 node = tipc_node_find(net, dnode);
02be61a9
JPM		 539 if (!node) {
540 pr_warn("Connecting sock to node 0x%x failed\n", dnode);
541 return -EHOSTUNREACH;
542 }
543 conn = kmalloc(sizeof(*conn), GFP_ATOMIC);
8a0f6ebe
YX		 544 if (!conn) {
545 err = -EHOSTUNREACH;
546 goto exit;
547 }
02be61a9
JPM		 548 conn->peer_node = dnode;
549 conn->port = port;
550 conn->peer_port = peer_port;
551
5405ff6e 552 tipc_node_write_lock(node);
02be61a9 553 list_add_tail(&conn->list, &node->conn_sks);
5405ff6e 554 tipc_node_write_unlock(node);
8a0f6ebe
YX		 555exit:
556 tipc_node_put(node);
557 return err;
02be61a9
JPM		 558}
559
f2f9800d 560void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port)
02be61a9
JPM		 561{
562 struct tipc_node *node;
563 struct tipc_sock_conn *conn, *safe;
564
34747539 565 if (in_own_node(net, dnode))
02be61a9
JPM		 566 return;
567
f2f9800d 568 node = tipc_node_find(net, dnode);
02be61a9
JPM		 569 if (!node)
570 return;
571
5405ff6e 572 tipc_node_write_lock(node);
02be61a9
JPM		 573 list_for_each_entry_safe(conn, safe, &node->conn_sks, list) {
574 if (port != conn->port)
575 continue;
576 list_del(&conn->list);
577 kfree(conn);
578 }
5405ff6e 579 tipc_node_write_unlock(node);
8a0f6ebe 580 tipc_node_put(node);
02be61a9
JPM		 581}
582
6a939f36
GM		 583static void tipc_node_clear_links(struct tipc_node *node)
584{
585 int i;
586
587 for (i = 0; i < MAX_BEARERS; i++) {
588 struct tipc_link_entry *le = &node->links[i];
589
590 if (le->link) {
591 kfree(le->link);
592 le->link = NULL;
593 node->link_cnt--;
594 }
595 }
596}
597
598/* tipc_node_cleanup - delete nodes that does not
599 * have active links for NODE_CLEANUP_AFTER time
600 */
ec835f89 601static bool tipc_node_cleanup(struct tipc_node *peer)
6a939f36 602{
ff2ebbfb 603 struct tipc_node *temp_node;
6a939f36
GM		 604 struct tipc_net *tn = tipc_net(peer->net);
605 bool deleted = false;
606
ec835f89
JM		 607 /* If lock held by tipc_node_stop() the node will be deleted anyway */
608 if (!spin_trylock_bh(&tn->node_list_lock))
609 return false;
610
6a939f36
GM		 611 tipc_node_write_lock(peer);
612
613 if (!node_is_up(peer) && time_after(jiffies, peer->delete_at)) {
614 tipc_node_clear_links(peer);
615 tipc_node_delete_from_list(peer);
616 deleted = true;
617 }
618 tipc_node_write_unlock(peer);
ff2ebbfb
HL		 619
620 /* Calculate cluster capabilities */
621 tn->capabilities = TIPC_NODE_CAPABILITIES;
622 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
623 tn->capabilities &= temp_node->capabilities;
624 }
625
6a939f36
GM		 626 spin_unlock_bh(&tn->node_list_lock);
627 return deleted;
628}
629
8a1577c9
JPM		 630/* tipc_node_timeout - handle expiration of node timer
631 */
31b102bb 632static void tipc_node_timeout(struct timer_list *t)
8a1577c9 633{
31b102bb 634 struct tipc_node *n = from_timer(n, t, timer);
598411d7 635 struct tipc_link_entry *le;
8a1577c9 636 struct sk_buff_head xmitq;
759f29b6 637 int remains = n->link_cnt;
8a1577c9
JPM		 638 int bearer_id;
639 int rc = 0;
640
eb18a510 641 trace_tipc_node_timeout(n, false, " ");
6a939f36
GM		 642 if (!node_is_up(n) && tipc_node_cleanup(n)) {
643 /*Removing the reference of Timer*/
644 tipc_node_put(n);
645 return;
646 }
647
8a1577c9
JPM		 648 __skb_queue_head_init(&xmitq);
649
f5d6c3e5
HL		 650 /* Initial node interval to value larger (10 seconds), then it will be
651 * recalculated with link lowest tolerance
652 */
653 tipc_node_read_lock(n);
654 n->keepalive_intv = 10000;
655 tipc_node_read_unlock(n);
759f29b6 656 for (bearer_id = 0; remains && (bearer_id < MAX_BEARERS); bearer_id++) {
5405ff6e 657 tipc_node_read_lock(n);
598411d7
JPM		 658 le = &n->links[bearer_id];
659 if (le->link) {
759f29b6 660 spin_lock_bh(&le->lock);
8a1577c9 661 /* Link tolerance may change asynchronously: */
598411d7
JPM		 662 tipc_node_calculate_timer(n, le->link);
663 rc = tipc_link_timeout(le->link, &xmitq);
759f29b6
TN		 664 spin_unlock_bh(&le->lock);
665 remains--;
8a1577c9 666 }
5405ff6e 667 tipc_node_read_unlock(n);
598411d7
JPM		 668 tipc_bearer_xmit(n->net, bearer_id, &xmitq, &le->maddr);
669 if (rc & TIPC_LINK_DOWN_EVT)
670 tipc_node_link_down(n, bearer_id, false);
8a1577c9 671 }
5ca509fc 672 mod_timer(&n->timer, jiffies + msecs_to_jiffies(n->keepalive_intv));
8a1577c9
JPM		 673}
674
b97bf3fd 675/**
598411d7
JPM		 676 * __tipc_node_link_up - handle addition of link
677 * Node lock must be held by caller
b97bf3fd
PL		 678 * Link becomes active (alone or shared) or standby, depending on its priority.
679 */
598411d7
JPM		 680static void __tipc_node_link_up(struct tipc_node *n, int bearer_id,
681 struct sk_buff_head *xmitq)
b97bf3fd 682{
36e78a46
JPM		 683 int *slot0 = &n->active_links[0];
684 int *slot1 = &n->active_links[1];
6e498158
JPM		 685 struct tipc_link *ol = node_active_link(n, 0);
686 struct tipc_link *nl = n->links[bearer_id].link;
9d13ec65 687
e7142c34 688 if (!nl || tipc_link_is_up(nl))
73f646ce
JPM		 689 return;
690
691 tipc_link_fsm_evt(nl, LINK_ESTABLISH_EVT);
692 if (!tipc_link_is_up(nl))
598411d7
JPM		 693 return;
694
9d13ec65
JPM		 695 n->working_links++;
696 n->action_flags |= TIPC_NOTIFY_LINK_UP;
38206d59 697 n->link_id = tipc_link_id(nl);
6e498158
JPM		 698
699 /* Leave room for tunnel header when returning 'mtu' to users: */
38206d59 700 n->links[bearer_id].mtu = tipc_link_mtu(nl) - INT_H_SIZE;
7b8613e0 701
cbeb83ca 702 tipc_bearer_add_dest(n->net, bearer_id, n->addr);
b06b281e 703 tipc_bcast_inc_bearer_dst_cnt(n->net, bearer_id);
cbeb83ca 704
3fa9cacd 705 pr_debug("Established link <%s> on network plane %c\n",
38206d59 706 tipc_link_name(nl), tipc_link_plane(nl));
eb18a510 707 trace_tipc_node_link_up(n, true, " ");
c4307285 708
34b9cd64
JPM		 709 /* Ensure that a STATE message goes first */
710 tipc_link_build_state_msg(nl, xmitq);
711
6e498158
JPM		 712 /* First link? => give it both slots */
713 if (!ol) {
36e78a46
JPM		 714 *slot0 = bearer_id;
715 *slot1 = bearer_id;
52666986 716 tipc_node_fsm_evt(n, SELF_ESTABL_CONTACT_EVT);
c140eb16 717 n->failover_sent = false;
52666986 718 n->action_flags |= TIPC_NOTIFY_NODE_UP;
def22c47 719 tipc_link_set_active(nl, true);
b06b281e 720 tipc_bcast_add_peer(n->net, nl, xmitq);
9d13ec65 721 return;
b97bf3fd 722 }
36e78a46 723
6e498158 724 /* Second link => redistribute slots */
38206d59
JPM		 725 if (tipc_link_prio(nl) > tipc_link_prio(ol)) {
726 pr_debug("Old link <%s> becomes standby\n", tipc_link_name(ol));
36e78a46 727 *slot0 = bearer_id;
6e498158 728 *slot1 = bearer_id;
c72fa872
JPM		 729 tipc_link_set_active(nl, true);
730 tipc_link_set_active(ol, false);
38206d59 731 } else if (tipc_link_prio(nl) == tipc_link_prio(ol)) {
c72fa872 732 tipc_link_set_active(nl, true);
c49a0a84 733 *slot1 = bearer_id;
6e498158 734 } else {
38206d59 735 pr_debug("New link <%s> is standby\n", tipc_link_name(nl));
b97bf3fd 736 }
b97bf3fd 737
6e498158
JPM		 738 /* Prepare synchronization with first link */
739 tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq);
b97bf3fd
PL		 740}
741
742/**
598411d7
JPM		 743 * tipc_node_link_up - handle addition of link
744 *
745 * Link becomes active (alone or shared) or standby, depending on its priority.
b97bf3fd 746 */
598411d7
JPM		 747static void tipc_node_link_up(struct tipc_node *n, int bearer_id,
748 struct sk_buff_head *xmitq)
b97bf3fd 749{
de7e07f9
JPM		 750 struct tipc_media_addr *maddr;
751
5405ff6e 752 tipc_node_write_lock(n);
598411d7 753 __tipc_node_link_up(n, bearer_id, xmitq);
de7e07f9
JPM		 754 maddr = &n->links[bearer_id].maddr;
755 tipc_bearer_xmit(n->net, bearer_id, xmitq, maddr);
5405ff6e 756 tipc_node_write_unlock(n);
598411d7
JPM		 757}
758
759/**
760 * __tipc_node_link_down - handle loss of link
761 */
762static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
763 struct sk_buff_head *xmitq,
764 struct tipc_media_addr **maddr)
765{
766 struct tipc_link_entry *le = &n->links[*bearer_id];
36e78a46
JPM		 767 int *slot0 = &n->active_links[0];
768 int *slot1 = &n->active_links[1];
38206d59 769 int i, highest = 0, prio;
6e498158 770 struct tipc_link *l, *_l, *tnl;
b97bf3fd 771
598411d7 772 l = n->links[*bearer_id].link;
662921cd 773 if (!l || tipc_link_is_reset(l))
655fb243
JPM		 774 return;
775
9d13ec65
JPM		 776 n->working_links--;
777 n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
38206d59 778 n->link_id = tipc_link_id(l);
5392d646 779
598411d7 780 tipc_bearer_remove_dest(n->net, *bearer_id, n->addr);
655fb243 781
3fa9cacd 782 pr_debug("Lost link <%s> on network plane %c\n",
38206d59 783 tipc_link_name(l), tipc_link_plane(l));
16e166b8 784
36e78a46
JPM		 785 /* Select new active link if any available */
786 *slot0 = INVALID_BEARER_ID;
787 *slot1 = INVALID_BEARER_ID;
788 for (i = 0; i < MAX_BEARERS; i++) {
789 _l = n->links[i].link;
790 if (!_l || !tipc_link_is_up(_l))
791 continue;
655fb243
JPM		 792 if (_l == l)
793 continue;
38206d59
JPM		 794 prio = tipc_link_prio(_l);
795 if (prio < highest)
36e78a46 796 continue;
38206d59
JPM		 797 if (prio > highest) {
798 highest = prio;
36e78a46
JPM		 799 *slot0 = i;
800 *slot1 = i;
801 continue;
802 }
803 *slot1 = i;
804 }
655fb243 805
38077b8e 806 if (!node_is_up(n)) {
c8199300
JPM		 807 if (tipc_link_peer_is_down(l))
808 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
809 tipc_node_fsm_evt(n, SELF_LOST_CONTACT_EVT);
26574db0 810 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link down!");
c8199300 811 tipc_link_fsm_evt(l, LINK_RESET_EVT);
6e498158 812 tipc_link_reset(l);
282b3a05
JPM		 813 tipc_link_build_reset_msg(l, xmitq);
814 *maddr = &n->links[*bearer_id].maddr;
598411d7 815 node_lost_contact(n, &le->inputq);
b06b281e 816 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
6e498158
JPM		 817 return;
818 }
b06b281e 819 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
655fb243 820
6e498158 821 /* There is still a working link => initiate failover */
38206d59
JPM		 822 *bearer_id = n->active_links[0];
823 tnl = n->links[*bearer_id].link;
5ae2f8e6
JPM		 824 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
825 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
38206d59 826 n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
598411d7 827 tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, xmitq);
26574db0 828 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link down -> failover!");
655fb243 829 tipc_link_reset(l);
c8199300 830 tipc_link_fsm_evt(l, LINK_RESET_EVT);
662921cd 831 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
598411d7 832 tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
38206d59 833 *maddr = &n->links[*bearer_id].maddr;
598411d7
JPM		 834}
835
836static void tipc_node_link_down(struct tipc_node *n, int bearer_id, bool delete)
837{
838 struct tipc_link_entry *le = &n->links[bearer_id];
737889ef 839 struct tipc_media_addr *maddr = NULL;
73f646ce 840 struct tipc_link *l = le->link;
35c55c98 841 int old_bearer_id = bearer_id;
737889ef 842 struct sk_buff_head xmitq;
598411d7 843
73f646ce
JPM		 844 if (!l)
845 return;
846
598411d7
JPM		 847 __skb_queue_head_init(&xmitq);
848
5405ff6e 849 tipc_node_write_lock(n);
73f646ce
JPM		 850 if (!tipc_link_is_establishing(l)) {
851 __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr);
73f646ce
JPM		 852 } else {
853 /* Defuse pending tipc_node_link_up() */
91986ee1 854 tipc_link_reset(l);
73f646ce 855 tipc_link_fsm_evt(l, LINK_RESET_EVT);
598411d7 856 }
91986ee1
TL		 857 if (delete) {
858 kfree(l);
859 le->link = NULL;
860 n->link_cnt--;
861 }
eb18a510 862 trace_tipc_node_link_down(n, true, "node link down or deleted!");
5405ff6e 863 tipc_node_write_unlock(n);
35c55c98
JPM		 864 if (delete)
865 tipc_mon_remove_peer(n->net, n->addr, old_bearer_id);
737889ef
JM		 866 if (!skb_queue_empty(&xmitq))
867 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr);
598411d7 868 tipc_sk_rcv(n->net, &le->inputq);
b97bf3fd
PL		 869}
870
38077b8e 871static bool node_is_up(struct tipc_node *n)
b97bf3fd 872{
36e78a46 873 return n->active_links[0] != INVALID_BEARER_ID;
b97bf3fd
PL		 874}
875
38077b8e
JM		 876bool tipc_node_is_up(struct net *net, u32 addr)
877{
878 struct tipc_node *n;
879 bool retval = false;
880
881 if (in_own_node(net, addr))
882 return true;
883
884 n = tipc_node_find(net, addr);
885 if (!n)
886 return false;
887 retval = node_is_up(n);
888 tipc_node_put(n);
889 return retval;
890}
891
25b0b9c4
JM		 892static u32 tipc_node_suggest_addr(struct net *net, u32 addr)
893{
894 struct tipc_node *n;
895
896 addr ^= tipc_net(net)->random;
897 while ((n = tipc_node_find(net, addr))) {
898 tipc_node_put(n);
899 addr++;
900 }
901 return addr;
902}
903
904/* tipc_node_try_addr(): Check if addr can be used by peer, suggest other if not
2a57f182 905 * Returns suggested address if any, otherwise 0
25b0b9c4
JM		 906 */
907u32 tipc_node_try_addr(struct net *net, u8 *id, u32 addr)
908{
909 struct tipc_net *tn = tipc_net(net);
910 struct tipc_node *n;
911
912 /* Suggest new address if some other peer is using this one */
913 n = tipc_node_find(net, addr);
914 if (n) {
915 if (!memcmp(n->peer_id, id, NODE_ID_LEN))
916 addr = 0;
917 tipc_node_put(n);
918 if (!addr)
919 return 0;
920 return tipc_node_suggest_addr(net, addr);
921 }
922
923 /* Suggest previously used address if peer is known */
924 n = tipc_node_find_by_id(net, id);
925 if (n) {
926 addr = n->addr;
927 tipc_node_put(n);
2a57f182 928 return addr;
25b0b9c4 929 }
2a57f182
JM		 930
931 /* Even this node may be in conflict */
25b0b9c4
JM		 932 if (tn->trial_addr == addr)
933 return tipc_node_suggest_addr(net, addr);
934
2a57f182 935 return 0;
25b0b9c4
JM		 936}
937
938void tipc_node_check_dest(struct net *net, u32 addr,
939 u8 *peer_id, struct tipc_bearer *b,
cf148816
JPM		 940 u16 capabilities, u32 signature,
941 struct tipc_media_addr *maddr,
942 bool *respond, bool *dupl_addr)
d3a43b90 943{
cf148816
JPM		 944 struct tipc_node *n;
945 struct tipc_link *l;
440d8963 946 struct tipc_link_entry *le;
cf148816
JPM		 947 bool addr_match = false;
948 bool sign_match = false;
949 bool link_up = false;
950 bool accept_addr = false;
598411d7 951 bool reset = true;
0e05498e 952 char *if_name;
5ca509fc 953 unsigned long intv;
d949cfed 954 u16 session;
440d8963 955
cf148816
JPM		 956 *dupl_addr = false;
957 *respond = false;
958
25b0b9c4 959 n = tipc_node_create(net, addr, peer_id, capabilities);
cf148816
JPM		 960 if (!n)
961 return;
d3a43b90 962
5405ff6e 963 tipc_node_write_lock(n);
cf148816 964
440d8963 965 le = &n->links[b->identity];
cf148816
JPM		 966
967 /* Prepare to validate requesting node's signature and media address */
440d8963 968 l = le->link;
cf148816 969 link_up = l && tipc_link_is_up(l);
440d8963 970 addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr));
cf148816
JPM		 971 sign_match = (signature == n->signature);
972
973 /* These three flags give us eight permutations: */
974
975 if (sign_match && addr_match && link_up) {
976 /* All is fine. Do nothing. */
598411d7 977 reset = false;
cf148816
JPM		 978 } else if (sign_match && addr_match && !link_up) {
979 /* Respond. The link will come up in due time */
980 *respond = true;
981 } else if (sign_match && !addr_match && link_up) {
982 /* Peer has changed i/f address without rebooting.
983 * If so, the link will reset soon, and the next
984 * discovery will be accepted. So we can ignore it.
985 * It may also be an cloned or malicious peer having
986 * chosen the same node address and signature as an
987 * existing one.
988 * Ignore requests until the link goes down, if ever.
989 */
990 *dupl_addr = true;
991 } else if (sign_match && !addr_match && !link_up) {
992 /* Peer link has changed i/f address without rebooting.
993 * It may also be a cloned or malicious peer; we can't
994 * distinguish between the two.
995 * The signature is correct, so we must accept.
996 */
997 accept_addr = true;
998 *respond = true;
999 } else if (!sign_match && addr_match && link_up) {
1000 /* Peer node rebooted. Two possibilities:
1001 * - Delayed re-discovery; this link endpoint has already
1002 * reset and re-established contact with the peer, before
1003 * receiving a discovery message from that node.
1004 * (The peer happened to receive one from this node first).
1005 * - The peer came back so fast that our side has not
1006 * discovered it yet. Probing from this side will soon
1007 * reset the link, since there can be no working link
1008 * endpoint at the peer end, and the link will re-establish.
1009 * Accept the signature, since it comes from a known peer.
1010 */
1011 n->signature = signature;
1012 } else if (!sign_match && addr_match && !link_up) {
1013 /* The peer node has rebooted.
1014 * Accept signature, since it is a known peer.
1015 */
1016 n->signature = signature;
1017 *respond = true;
1018 } else if (!sign_match && !addr_match && link_up) {
1019 /* Peer rebooted with new address, or a new/duplicate peer.
1020 * Ignore until the link goes down, if ever.
1021 */
1022 *dupl_addr = true;
1023 } else if (!sign_match && !addr_match && !link_up) {
1024 /* Peer rebooted with new address, or it is a new peer.
1025 * Accept signature and address.
1026 */
1027 n->signature = signature;
1028 accept_addr = true;
1029 *respond = true;
1030 }
d3a43b90 1031
cf148816
JPM		 1032 if (!accept_addr)
1033 goto exit;
d3a43b90 1034
cf148816 1035 /* Now create new link if not already existing */
8a1577c9 1036 if (!l) {
20263641 1037 if (n->link_cnt == 2)
440d8963 1038 goto exit;
20263641 1039
0e05498e 1040 if_name = strchr(b->name, ':') + 1;
d949cfed 1041 get_random_bytes(&session, sizeof(u16));
c72fa872 1042 if (!tipc_link_create(net, if_name, b->identity, b->tolerance,
0e05498e 1043 b->net_plane, b->mtu, b->priority,
d949cfed 1044 b->window, session,
25b0b9c4 1045 tipc_own_addr(net), addr, peer_id,
2af5ae37 1046 n->capabilities,
52666986
JPM		 1047 tipc_bc_sndlink(n->net), n->bc_entry.link,
1048 &le->inputq,
1049 &n->bc_entry.namedq, &l)) {
cf148816
JPM		 1050 *respond = false;
1051 goto exit;
1052 }
26574db0 1053 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link created!");
440d8963 1054 tipc_link_reset(l);
c8199300 1055 tipc_link_fsm_evt(l, LINK_RESET_EVT);
17b20630
JPM		 1056 if (n->state == NODE_FAILINGOVER)
1057 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
440d8963
JPM		 1058 le->link = l;
1059 n->link_cnt++;
8a1577c9 1060 tipc_node_calculate_timer(n, l);
5ca509fc
JPM		 1061 if (n->link_cnt == 1) {
1062 intv = jiffies + msecs_to_jiffies(n->keepalive_intv);
1063 if (!mod_timer(&n->timer, intv))
8a1577c9 1064 tipc_node_get(n);
5ca509fc 1065 }
8a1577c9 1066 }
440d8963 1067 memcpy(&le->maddr, maddr, sizeof(*maddr));
cf148816 1068exit:
5405ff6e 1069 tipc_node_write_unlock(n);
2837f39c 1070 if (reset && l && !tipc_link_is_reset(l))
598411d7 1071 tipc_node_link_down(n, b->identity, false);
cf148816 1072 tipc_node_put(n);
d3a43b90
JPM		 1073}
1074
6144a996
JPM		 1075void tipc_node_delete_links(struct net *net, int bearer_id)
1076{
1077 struct tipc_net *tn = net_generic(net, tipc_net_id);
6144a996
JPM		 1078 struct tipc_node *n;
1079
1080 rcu_read_lock();
1081 list_for_each_entry_rcu(n, &tn->node_list, list) {
598411d7 1082 tipc_node_link_down(n, bearer_id, true);
6144a996
JPM		 1083 }
1084 rcu_read_unlock();
1085}
1086
1087static void tipc_node_reset_links(struct tipc_node *n)
1088{
598411d7 1089 int i;
6144a996 1090
d50ccc2d 1091 pr_warn("Resetting all links to %x\n", n->addr);
6144a996 1092
eb18a510 1093 trace_tipc_node_reset_links(n, true, " ");
6144a996 1094 for (i = 0; i < MAX_BEARERS; i++) {
598411d7 1095 tipc_node_link_down(n, i, false);
6144a996 1096 }
6144a996
JPM		 1097}
1098
1a20cc25
JPM		 1099/* tipc_node_fsm_evt - node finite state machine
1100 * Determines when contact is allowed with peer node
1101 */
d999297c 1102static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
1a20cc25
JPM		 1103{
1104 int state = n->state;
1105
1106 switch (state) {
1107 case SELF_DOWN_PEER_DOWN:
1108 switch (evt) {
1109 case SELF_ESTABL_CONTACT_EVT:
1110 state = SELF_UP_PEER_COMING;
1111 break;
1112 case PEER_ESTABL_CONTACT_EVT:
1113 state = SELF_COMING_PEER_UP;
1114 break;
1115 case SELF_LOST_CONTACT_EVT:
1116 case PEER_LOST_CONTACT_EVT:
1117 break;
66996b6c
JPM		 1118 case NODE_SYNCH_END_EVT:
1119 case NODE_SYNCH_BEGIN_EVT:
1120 case NODE_FAILOVER_BEGIN_EVT:
1121 case NODE_FAILOVER_END_EVT:
1a20cc25 1122 default:
66996b6c 1123 goto illegal_evt;
1a20cc25
JPM		 1124 }
1125 break;
1126 case SELF_UP_PEER_UP:
1127 switch (evt) {
1128 case SELF_LOST_CONTACT_EVT:
1129 state = SELF_DOWN_PEER_LEAVING;
1130 break;
1131 case PEER_LOST_CONTACT_EVT:
1132 state = SELF_LEAVING_PEER_DOWN;
1133 break;
66996b6c
JPM		 1134 case NODE_SYNCH_BEGIN_EVT:
1135 state = NODE_SYNCHING;
1136 break;
1137 case NODE_FAILOVER_BEGIN_EVT:
1138 state = NODE_FAILINGOVER;
1139 break;
1a20cc25
JPM		 1140 case SELF_ESTABL_CONTACT_EVT:
1141 case PEER_ESTABL_CONTACT_EVT:
66996b6c
JPM		 1142 case NODE_SYNCH_END_EVT:
1143 case NODE_FAILOVER_END_EVT:
1a20cc25
JPM		 1144 break;
1145 default:
66996b6c 1146 goto illegal_evt;
1a20cc25
JPM		 1147 }
1148 break;
1149 case SELF_DOWN_PEER_LEAVING:
1150 switch (evt) {
1151 case PEER_LOST_CONTACT_EVT:
1152 state = SELF_DOWN_PEER_DOWN;
1153 break;
1154 case SELF_ESTABL_CONTACT_EVT:
1155 case PEER_ESTABL_CONTACT_EVT:
1156 case SELF_LOST_CONTACT_EVT:
1157 break;
66996b6c
JPM		 1158 case NODE_SYNCH_END_EVT:
1159 case NODE_SYNCH_BEGIN_EVT:
1160 case NODE_FAILOVER_BEGIN_EVT:
1161 case NODE_FAILOVER_END_EVT:
1a20cc25 1162 default:
66996b6c 1163 goto illegal_evt;
1a20cc25
JPM		 1164 }
1165 break;
1166 case SELF_UP_PEER_COMING:
1167 switch (evt) {
1168 case PEER_ESTABL_CONTACT_EVT:
1169 state = SELF_UP_PEER_UP;
1170 break;
1171 case SELF_LOST_CONTACT_EVT:
c4282ca7 1172 state = SELF_DOWN_PEER_DOWN;
1a20cc25
JPM		 1173 break;
1174 case SELF_ESTABL_CONTACT_EVT:
1175 case PEER_LOST_CONTACT_EVT:
66996b6c 1176 case NODE_SYNCH_END_EVT:
66996b6c 1177 case NODE_FAILOVER_BEGIN_EVT:
73f646ce
JPM		 1178 break;
1179 case NODE_SYNCH_BEGIN_EVT:
66996b6c 1180 case NODE_FAILOVER_END_EVT:
1a20cc25 1181 default:
66996b6c 1182 goto illegal_evt;
1a20cc25
JPM		 1183 }
1184 break;
1185 case SELF_COMING_PEER_UP:
1186 switch (evt) {
1187 case SELF_ESTABL_CONTACT_EVT:
1188 state = SELF_UP_PEER_UP;
1189 break;
1190 case PEER_LOST_CONTACT_EVT:
c4282ca7 1191 state = SELF_DOWN_PEER_DOWN;
1a20cc25
JPM		 1192 break;
1193 case SELF_LOST_CONTACT_EVT:
1194 case PEER_ESTABL_CONTACT_EVT:
1195 break;
66996b6c
JPM		 1196 case NODE_SYNCH_END_EVT:
1197 case NODE_SYNCH_BEGIN_EVT:
1198 case NODE_FAILOVER_BEGIN_EVT:
1199 case NODE_FAILOVER_END_EVT:
1a20cc25 1200 default:
66996b6c 1201 goto illegal_evt;
1a20cc25
JPM		 1202 }
1203 break;
1204 case SELF_LEAVING_PEER_DOWN:
1205 switch (evt) {
1206 case SELF_LOST_CONTACT_EVT:
1207 state = SELF_DOWN_PEER_DOWN;
1208 break;
1209 case SELF_ESTABL_CONTACT_EVT:
1210 case PEER_ESTABL_CONTACT_EVT:
1211 case PEER_LOST_CONTACT_EVT:
1212 break;
66996b6c
JPM		 1213 case NODE_SYNCH_END_EVT:
1214 case NODE_SYNCH_BEGIN_EVT:
1215 case NODE_FAILOVER_BEGIN_EVT:
1216 case NODE_FAILOVER_END_EVT:
1217 default:
1218 goto illegal_evt;
1219 }
1220 break;
1221 case NODE_FAILINGOVER:
1222 switch (evt) {
1223 case SELF_LOST_CONTACT_EVT:
1224 state = SELF_DOWN_PEER_LEAVING;
1225 break;
1226 case PEER_LOST_CONTACT_EVT:
1227 state = SELF_LEAVING_PEER_DOWN;
1228 break;
1229 case NODE_FAILOVER_END_EVT:
1230 state = SELF_UP_PEER_UP;
1231 break;
1232 case NODE_FAILOVER_BEGIN_EVT:
1233 case SELF_ESTABL_CONTACT_EVT:
1234 case PEER_ESTABL_CONTACT_EVT:
1235 break;
1236 case NODE_SYNCH_BEGIN_EVT:
1237 case NODE_SYNCH_END_EVT:
1a20cc25 1238 default:
66996b6c
JPM		 1239 goto illegal_evt;
1240 }
1241 break;
1242 case NODE_SYNCHING:
1243 switch (evt) {
1244 case SELF_LOST_CONTACT_EVT:
1245 state = SELF_DOWN_PEER_LEAVING;
1246 break;
1247 case PEER_LOST_CONTACT_EVT:
1248 state = SELF_LEAVING_PEER_DOWN;
1249 break;
1250 case NODE_SYNCH_END_EVT:
1251 state = SELF_UP_PEER_UP;
1252 break;
1253 case NODE_FAILOVER_BEGIN_EVT:
1254 state = NODE_FAILINGOVER;
1255 break;
1256 case NODE_SYNCH_BEGIN_EVT:
1257 case SELF_ESTABL_CONTACT_EVT:
1258 case PEER_ESTABL_CONTACT_EVT:
1259 break;
1260 case NODE_FAILOVER_END_EVT:
1261 default:
1262 goto illegal_evt;
1a20cc25
JPM		 1263 }
1264 break;
1265 default:
1266 pr_err("Unknown node fsm state %x\n", state);
1267 break;
1268 }
eb18a510 1269 trace_tipc_node_fsm(n->peer_id, n->state, state, evt);
1a20cc25 1270 n->state = state;
66996b6c
JPM		 1271 return;
1272
1273illegal_evt:
1274 pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
eb18a510 1275 trace_tipc_node_fsm(n->peer_id, n->state, state, evt);
1a20cc25
JPM		 1276}
1277
52666986 1278static void node_lost_contact(struct tipc_node *n,
598411d7 1279 struct sk_buff_head *inputq)
b97bf3fd 1280{
708ac32c 1281 struct tipc_sock_conn *conn, *safe;
598411d7 1282 struct tipc_link *l;
52666986 1283 struct list_head *conns = &n->conn_sks;
708ac32c 1284 struct sk_buff *skb;
708ac32c 1285 uint i;
b97bf3fd 1286
d50ccc2d 1287 pr_debug("Lost contact with %x\n", n->addr);
6a939f36 1288 n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
eb18a510 1289 trace_tipc_node_lost_contact(n, true, " ");
c5bd4d85 1290
52666986 1291 /* Clean up broadcast state */
b06b281e 1292 tipc_bcast_remove_peer(n->net, n->bc_entry.link);
b97bf3fd 1293
dff29b1a 1294 /* Abort any ongoing link failover */
b97bf3fd 1295 for (i = 0; i < MAX_BEARERS; i++) {
52666986 1296 l = n->links[i].link;
598411d7
JPM		 1297 if (l)
1298 tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT);
b97bf3fd 1299 }
598411d7 1300
708ac32c 1301 /* Notify publications from this node */
52666986 1302 n->action_flags |= TIPC_NOTIFY_NODE_DOWN;
708ac32c
JPM		 1303
1304 /* Notify sockets connected to node */
1305 list_for_each_entry_safe(conn, safe, conns, list) {
1306 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
52666986 1307 SHORT_H_SIZE, 0, tipc_own_addr(n->net),
708ac32c
JPM		 1308 conn->peer_node, conn->port,
1309 conn->peer_port, TIPC_ERR_NO_NODE);
23d8335d 1310 if (likely(skb))
598411d7 1311 skb_queue_tail(inputq, skb);
708ac32c
JPM		 1312 list_del(&conn->list);
1313 kfree(conn);
1314 }
b97bf3fd
PL		 1315}
1316
78acb1f9
EH		 1317/**
1318 * tipc_node_get_linkname - get the name of a link
1319 *
1320 * @bearer_id: id of the bearer
1321 * @node: peer node address
1322 * @linkname: link name output buffer
1323 *
1324 * Returns 0 on success
1325 */
f2f9800d
YX		 1326int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
1327 char *linkname, size_t len)
78acb1f9
EH		 1328{
1329 struct tipc_link *link;
8a0f6ebe 1330 int err = -EINVAL;
f2f9800d 1331 struct tipc_node *node = tipc_node_find(net, addr);
78acb1f9 1332
8a0f6ebe
YX		 1333 if (!node)
1334 return err;
1335
1336 if (bearer_id >= MAX_BEARERS)
1337 goto exit;
1338
5405ff6e 1339 tipc_node_read_lock(node);
9d13ec65 1340 link = node->links[bearer_id].link;
78acb1f9 1341 if (link) {
38206d59 1342 strncpy(linkname, tipc_link_name(link), len);
8a0f6ebe 1343 err = 0;
78acb1f9 1344 }
5405ff6e 1345 tipc_node_read_unlock(node);
991ca84d 1346exit:
8a0f6ebe
YX		 1347 tipc_node_put(node);
1348 return err;
78acb1f9 1349}
9db9fdd1 1350
3e4b6ab5 1351/* Caller should hold node lock for the passed node */
d8182804 1352static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
3e4b6ab5
RA		 1353{
1354 void *hdr;
1355 struct nlattr *attrs;
1356
bfb3e5dd 1357 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
3e4b6ab5
RA		 1358 NLM_F_MULTI, TIPC_NL_NODE_GET);
1359 if (!hdr)
1360 return -EMSGSIZE;
1361
ae0be8de 1362 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_NODE);
3e4b6ab5
RA		 1363 if (!attrs)
1364 goto msg_full;
1365
1366 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
1367 goto attr_msg_full;
38077b8e 1368 if (node_is_up(node))
3e4b6ab5
RA		 1369 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
1370 goto attr_msg_full;
1371
1372 nla_nest_end(msg->skb, attrs);
1373 genlmsg_end(msg->skb, hdr);
1374
1375 return 0;
1376
1377attr_msg_full:
1378 nla_nest_cancel(msg->skb, attrs);
1379msg_full:
1380 genlmsg_cancel(msg->skb, hdr);
1381
1382 return -EMSGSIZE;
1383}
1384
af9b028e
JPM		 1385/**
1386 * tipc_node_xmit() is the general link level function for message sending
1387 * @net: the applicable net namespace
1388 * @list: chain of buffers containing message
1389 * @dnode: address of destination node
1390 * @selector: a number used for deterministic link selection
365ad353 1391 * Consumes the buffer chain.
4952cd3e 1392 * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
af9b028e
JPM		 1393 */
1394int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
1395 u32 dnode, int selector)
1396{
5405ff6e 1397 struct tipc_link_entry *le = NULL;
af9b028e
JPM		 1398 struct tipc_node *n;
1399 struct sk_buff_head xmitq;
4952cd3e
RA		 1400 int bearer_id;
1401 int rc;
1402
1403 if (in_own_node(net, dnode)) {
1404 tipc_sk_rcv(net, list);
1405 return 0;
1406 }
af9b028e 1407
af9b028e 1408 n = tipc_node_find(net, dnode);
4952cd3e
RA		 1409 if (unlikely(!n)) {
1410 skb_queue_purge(list);
1411 return -EHOSTUNREACH;
1412 }
1413
1414 tipc_node_read_lock(n);
1415 bearer_id = n->active_links[selector & 1];
1416 if (unlikely(bearer_id == INVALID_BEARER_ID)) {
5405ff6e 1417 tipc_node_read_unlock(n);
af9b028e 1418 tipc_node_put(n);
4952cd3e
RA		 1419 skb_queue_purge(list);
1420 return -EHOSTUNREACH;
af9b028e 1421 }
5405ff6e 1422
4952cd3e
RA		 1423 __skb_queue_head_init(&xmitq);
1424 le = &n->links[bearer_id];
1425 spin_lock_bh(&le->lock);
1426 rc = tipc_link_xmit(le->link, list, &xmitq);
1427 spin_unlock_bh(&le->lock);
1428 tipc_node_read_unlock(n);
1429
365ad353 1430 if (unlikely(rc == -ENOBUFS))
4952cd3e 1431 tipc_node_link_down(n, bearer_id, false);
365ad353
JPM		 1432 else
1433 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
4952cd3e
RA		 1434
1435 tipc_node_put(n);
1436
dc8d1eb3 1437 return rc;
af9b028e
JPM		 1438}
1439
1440/* tipc_node_xmit_skb(): send single buffer to destination
1441 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1442 * messages, which will not be rejected
1443 * The only exception is datagram messages rerouted after secondary
1444 * lookup, which are rare and safe to dispose of anyway.
af9b028e
JPM		 1445 */
1446int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
1447 u32 selector)
1448{
1449 struct sk_buff_head head;
af9b028e
JPM		 1450
1451 skb_queue_head_init(&head);
1452 __skb_queue_tail(&head, skb);
365ad353 1453 tipc_node_xmit(net, &head, dnode, selector);
af9b028e
JPM		 1454 return 0;
1455}
1456
f70d37b7
JM		 1457/* tipc_node_distr_xmit(): send single buffer msgs to individual destinations
1458 * Note: this is only for SYSTEM_IMPORTANCE messages, which cannot be rejected
1459 */
1460int tipc_node_distr_xmit(struct net *net, struct sk_buff_head *xmitq)
1461{
1462 struct sk_buff *skb;
1463 u32 selector, dnode;
1464
1465 while ((skb = __skb_dequeue(xmitq))) {
1466 selector = msg_origport(buf_msg(skb));
1467 dnode = msg_destnode(buf_msg(skb));
1468 tipc_node_xmit_skb(net, skb, dnode, selector);
1469 }
1470 return 0;
1471}
1472
1d7e1c25
JPM		 1473void tipc_node_broadcast(struct net *net, struct sk_buff *skb)
1474{
1475 struct sk_buff *txskb;
1476 struct tipc_node *n;
1477 u32 dst;
1478
1479 rcu_read_lock();
1480 list_for_each_entry_rcu(n, tipc_nodes(net), list) {
1481 dst = n->addr;
1482 if (in_own_node(net, dst))
1483 continue;
38077b8e 1484 if (!node_is_up(n))
1d7e1c25
JPM		 1485 continue;
1486 txskb = pskb_copy(skb, GFP_ATOMIC);
1487 if (!txskb)
1488 break;
1489 msg_set_destnode(buf_msg(txskb), dst);
1490 tipc_node_xmit_skb(net, txskb, dst, 0);
1491 }
1492 rcu_read_unlock();
1493
1494 kfree_skb(skb);
1495}
1496
a853e4c6
JPM		 1497static void tipc_node_mcast_rcv(struct tipc_node *n)
1498{
1499 struct tipc_bclink_entry *be = &n->bc_entry;
1500
1501 /* 'arrvq' is under inputq2's lock protection */
1502 spin_lock_bh(&be->inputq2.lock);
1503 spin_lock_bh(&be->inputq1.lock);
1504 skb_queue_splice_tail_init(&be->inputq1, &be->arrvq);
1505 spin_unlock_bh(&be->inputq1.lock);
1506 spin_unlock_bh(&be->inputq2.lock);
1507 tipc_sk_mcast_rcv(n->net, &be->arrvq, &be->inputq2);
1508}
1509
02d11ca2
JPM		 1510static void tipc_node_bc_sync_rcv(struct tipc_node *n, struct tipc_msg *hdr,
1511 int bearer_id, struct sk_buff_head *xmitq)
1512{
1513 struct tipc_link *ucl;
1514 int rc;
1515
1516 rc = tipc_bcast_sync_rcv(n->net, n->bc_entry.link, hdr);
1517
1518 if (rc & TIPC_LINK_DOWN_EVT) {
40501f90 1519 tipc_node_reset_links(n);
02d11ca2
JPM		 1520 return;
1521 }
1522
1523 if (!(rc & TIPC_LINK_SND_STATE))
1524 return;
1525
1526 /* If probe message, a STATE response will be sent anyway */
1527 if (msg_probe(hdr))
1528 return;
1529
1530 /* Produce a STATE message carrying broadcast NACK */
1531 tipc_node_read_lock(n);
1532 ucl = n->links[bearer_id].link;
1533 if (ucl)
1534 tipc_link_build_state_msg(ucl, xmitq);
1535 tipc_node_read_unlock(n);
1536}
1537
52666986
JPM		 1538/**
1539 * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1540 * @net: the applicable net namespace
1541 * @skb: TIPC packet
1542 * @bearer_id: id of bearer message arrived on
1543 *
1544 * Invoked with no locks held.
1545 */
742e0383 1546static void tipc_node_bc_rcv(struct net *net, struct sk_buff *skb, int bearer_id)
52666986
JPM		 1547{
1548 int rc;
1549 struct sk_buff_head xmitq;
1550 struct tipc_bclink_entry *be;
1551 struct tipc_link_entry *le;
1552 struct tipc_msg *hdr = buf_msg(skb);
1553 int usr = msg_user(hdr);
1554 u32 dnode = msg_destnode(hdr);
1555 struct tipc_node *n;
1556
1557 __skb_queue_head_init(&xmitq);
1558
1559 /* If NACK for other node, let rcv link for that node peek into it */
1560 if ((usr == BCAST_PROTOCOL) && (dnode != tipc_own_addr(net)))
1561 n = tipc_node_find(net, dnode);
1562 else
1563 n = tipc_node_find(net, msg_prevnode(hdr));
1564 if (!n) {
1565 kfree_skb(skb);
1566 return;
1567 }
1568 be = &n->bc_entry;
1569 le = &n->links[bearer_id];
1570
1571 rc = tipc_bcast_rcv(net, be->link, skb);
1572
52666986 1573 /* Broadcast ACKs are sent on a unicast link */
02d11ca2 1574 if (rc & TIPC_LINK_SND_STATE) {
5405ff6e 1575 tipc_node_read_lock(n);
34b9cd64 1576 tipc_link_build_state_msg(le->link, &xmitq);
5405ff6e 1577 tipc_node_read_unlock(n);
52666986
JPM		 1578 }
1579
1580 if (!skb_queue_empty(&xmitq))
1581 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1582
a853e4c6
JPM		 1583 if (!skb_queue_empty(&be->inputq1))
1584 tipc_node_mcast_rcv(n);
1fc07f3e 1585
5679ee78
ZG		 1586 /* Handle NAME_DISTRIBUTOR messages sent from 1.7 nodes */
1587 if (!skb_queue_empty(&n->bc_entry.namedq))
1588 tipc_named_rcv(net, &n->bc_entry.namedq);
1589
40501f90
JPM		 1590 /* If reassembly or retransmission failure => reset all links to peer */
1591 if (rc & TIPC_LINK_DOWN_EVT)
1592 tipc_node_reset_links(n);
1fc07f3e 1593
52666986
JPM		 1594 tipc_node_put(n);
1595}
1596
6e498158
JPM		 1597/**
1598 * tipc_node_check_state - check and if necessary update node state
1599 * @skb: TIPC packet
1600 * @bearer_id: identity of bearer delivering the packet
7ea817f4 1601 * Returns true if state and msg are ok, otherwise false
6144a996 1602 */
6e498158 1603static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb,
662921cd 1604 int bearer_id, struct sk_buff_head *xmitq)
6144a996 1605{
6144a996 1606 struct tipc_msg *hdr = buf_msg(skb);
6e498158
JPM		 1607 int usr = msg_user(hdr);
1608 int mtyp = msg_type(hdr);
6144a996 1609 u16 oseqno = msg_seqno(hdr);
6e498158
JPM		 1610 u16 iseqno = msg_seqno(msg_get_wrapped(hdr));
1611 u16 exp_pkts = msg_msgcnt(hdr);
38206d59 1612 u16 rcv_nxt, syncpt, dlv_nxt, inputq_len;
6e498158 1613 int state = n->state;
2be80c2d 1614 struct tipc_link *l, *tnl, *pl = NULL;
598411d7 1615 struct tipc_media_addr *maddr;
38206d59 1616 int pb_id;
6144a996 1617
eb18a510
TL		 1618 if (trace_tipc_node_check_state_enabled()) {
1619 trace_tipc_skb_dump(skb, false, "skb for node state check");
1620 trace_tipc_node_check_state(n, true, " ");
1621 }
6e498158
JPM		 1622 l = n->links[bearer_id].link;
1623 if (!l)
1624 return false;
38206d59 1625 rcv_nxt = tipc_link_rcv_nxt(l);
6144a996 1626
6144a996 1627
6e498158
JPM		 1628 if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL)))
1629 return true;
6144a996 1630
6e498158 1631 /* Find parallel link, if any */
38206d59
JPM		 1632 for (pb_id = 0; pb_id < MAX_BEARERS; pb_id++) {
1633 if ((pb_id != bearer_id) && n->links[pb_id].link) {
1634 pl = n->links[pb_id].link;
6e498158
JPM		 1635 break;
1636 }
1637 }
6144a996 1638
26574db0
TL		 1639 if (!tipc_link_validate_msg(l, hdr)) {
1640 trace_tipc_skb_dump(skb, false, "PROTO invalid (2)!");
1641 trace_tipc_link_dump(l, TIPC_DUMP_NONE, "PROTO invalid (2)!");
7ea817f4 1642 return false;
26574db0 1643 }
7ea817f4 1644
5405ff6e 1645 /* Check and update node accesibility if applicable */
6e498158
JPM		 1646 if (state == SELF_UP_PEER_COMING) {
1647 if (!tipc_link_is_up(l))
1648 return true;
1649 if (!msg_peer_link_is_up(hdr))
1650 return true;
1651 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
1652 }
1653
1654 if (state == SELF_DOWN_PEER_LEAVING) {
1655 if (msg_peer_node_is_up(hdr))
1656 return false;
1657 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
5c10e979 1658 return true;
6e498158
JPM		 1659 }
1660
5405ff6e
JPM		 1661 if (state == SELF_LEAVING_PEER_DOWN)
1662 return false;
1663
6e498158 1664 /* Ignore duplicate packets */
0f8b8e28 1665 if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt))
6e498158
JPM		 1666 return true;
1667
1668 /* Initiate or update failover mode if applicable */
1669 if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) {
1670 syncpt = oseqno + exp_pkts - 1;
598411d7 1671 if (pl && tipc_link_is_up(pl)) {
598411d7 1672 __tipc_node_link_down(n, &pb_id, xmitq, &maddr);
eb18a510
TL		 1673 trace_tipc_node_link_down(n, true,
1674 "node link down <- failover!");
38206d59
JPM		 1675 tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl),
1676 tipc_link_inputq(l));
598411d7 1677 }
c140eb16
LDC		 1678 /* If parallel link was already down, and this happened before
1679 * the tunnel link came up, FAILOVER was never sent. Ensure that
1680 * FAILOVER is sent to get peer out of NODE_FAILINGOVER state.
1681 */
1682 if (n->state != NODE_FAILINGOVER && !n->failover_sent) {
1683 tipc_link_create_dummy_tnl_msg(l, xmitq);
1684 n->failover_sent = true;
1685 }
6e498158
JPM		 1686 /* If pkts arrive out of order, use lowest calculated syncpt */
1687 if (less(syncpt, n->sync_point))
1688 n->sync_point = syncpt;
1689 }
1690
1691 /* Open parallel link when tunnel link reaches synch point */
17b20630 1692 if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) {
662921cd
JPM		 1693 if (!more(rcv_nxt, n->sync_point))
1694 return true;
6e498158
JPM		 1695 tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT);
1696 if (pl)
662921cd 1697 tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT);
6e498158
JPM		 1698 return true;
1699 }
1700
5ae2f8e6
JPM		 1701 /* No synching needed if only one link */
1702 if (!pl || !tipc_link_is_up(pl))
1703 return true;
1704
0f8b8e28
JPM		 1705 /* Initiate synch mode if applicable */
1706 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG) && (oseqno == 1)) {
6e498158 1707 syncpt = iseqno + exp_pkts - 1;
ed43594a 1708 if (!tipc_link_is_up(l))
598411d7 1709 __tipc_node_link_up(n, bearer_id, xmitq);
6e498158
JPM		 1710 if (n->state == SELF_UP_PEER_UP) {
1711 n->sync_point = syncpt;
662921cd 1712 tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT);
6e498158
JPM		 1713 tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT);
1714 }
6144a996 1715 }
6e498158
JPM		 1716
1717 /* Open tunnel link when parallel link reaches synch point */
5c10e979 1718 if (n->state == NODE_SYNCHING) {
2be80c2d
JPM		 1719 if (tipc_link_is_synching(l)) {
1720 tnl = l;
1721 } else {
1722 tnl = pl;
1723 pl = l;
1724 }
38206d59
JPM		 1725 inputq_len = skb_queue_len(tipc_link_inputq(pl));
1726 dlv_nxt = tipc_link_rcv_nxt(pl) - inputq_len;
5ae2f8e6 1727 if (more(dlv_nxt, n->sync_point)) {
2be80c2d 1728 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
6e498158 1729 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
6e498158
JPM		 1730 return true;
1731 }
2be80c2d
JPM		 1732 if (l == pl)
1733 return true;
6e498158
JPM		 1734 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG))
1735 return true;
1736 if (usr == LINK_PROTOCOL)
1737 return true;
1738 return false;
1739 }
1740 return true;
6144a996
JPM		 1741}
1742
d999297c
JPM		 1743/**
1744 * tipc_rcv - process TIPC packets/messages arriving from off-node
1745 * @net: the applicable net namespace
1746 * @skb: TIPC packet
1747 * @bearer: pointer to bearer message arrived on
1748 *
1749 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1750 * structure (i.e. cannot be NULL), but bearer can be inactive.
1751 */
1752void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
1753{
1754 struct sk_buff_head xmitq;
1755 struct tipc_node *n;
681a55d7 1756 struct tipc_msg *hdr;
d999297c 1757 int bearer_id = b->identity;
6e498158 1758 struct tipc_link_entry *le;
efe79050 1759 u32 self = tipc_own_addr(net);
681a55d7
JPM		 1760 int usr, rc = 0;
1761 u16 bc_ack;
d999297c
JPM		 1762
1763 __skb_queue_head_init(&xmitq);
1764
681a55d7 1765 /* Ensure message is well-formed before touching the header */
d618d09a 1766 if (unlikely(!tipc_msg_validate(&skb)))
d999297c 1767 goto discard;
681a55d7
JPM		 1768 hdr = buf_msg(skb);
1769 usr = msg_user(hdr);
1770 bc_ack = msg_bcast_ack(hdr);
d999297c 1771
52666986 1772 /* Handle arrival of discovery or broadcast packet */
d999297c 1773 if (unlikely(msg_non_seq(hdr))) {
52666986
JPM		 1774 if (unlikely(usr == LINK_CONFIG))
1775 return tipc_disc_rcv(net, skb, b);
d999297c 1776 else
52666986 1777 return tipc_node_bc_rcv(net, skb, bearer_id);
d999297c
JPM		 1778 }
1779
efe79050
HM		 1780 /* Discard unicast link messages destined for another node */
1781 if (unlikely(!msg_short(hdr) && (msg_destnode(hdr) != self)))
1782 goto discard;
1783
d999297c
JPM		 1784 /* Locate neighboring node that sent packet */
1785 n = tipc_node_find(net, msg_prevnode(hdr));
1786 if (unlikely(!n))
1787 goto discard;
6e498158 1788 le = &n->links[bearer_id];
d999297c 1789
52666986
JPM		 1790 /* Ensure broadcast reception is in synch with peer's send state */
1791 if (unlikely(usr == LINK_PROTOCOL))
02d11ca2 1792 tipc_node_bc_sync_rcv(n, hdr, bearer_id, &xmitq);
38206d59 1793 else if (unlikely(tipc_link_acked(n->bc_entry.link) != bc_ack))
06bd2b1e 1794 tipc_bcast_ack_rcv(net, n->bc_entry.link, hdr);
52666986 1795
5405ff6e
JPM		 1796 /* Receive packet directly if conditions permit */
1797 tipc_node_read_lock(n);
1798 if (likely((n->state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) {
2312bf61 1799 spin_lock_bh(&le->lock);
5405ff6e
JPM		 1800 if (le->link) {
1801 rc = tipc_link_rcv(le->link, skb, &xmitq);
1802 skb = NULL;
1803 }
2312bf61 1804 spin_unlock_bh(&le->lock);
6e498158 1805 }
5405ff6e
JPM		 1806 tipc_node_read_unlock(n);
1807
1808 /* Check/update node state before receiving */
1809 if (unlikely(skb)) {
27163138
PB		 1810 if (unlikely(skb_linearize(skb)))
1811 goto discard;
5405ff6e
JPM		 1812 tipc_node_write_lock(n);
1813 if (tipc_node_check_state(n, skb, bearer_id, &xmitq)) {
1814 if (le->link) {
1815 rc = tipc_link_rcv(le->link, skb, &xmitq);
1816 skb = NULL;
1817 }
1818 }
1819 tipc_node_write_unlock(n);
1820 }
d999297c
JPM		 1821
1822 if (unlikely(rc & TIPC_LINK_UP_EVT))
6e498158
JPM		 1823 tipc_node_link_up(n, bearer_id, &xmitq);
1824
d999297c 1825 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
598411d7 1826 tipc_node_link_down(n, bearer_id, false);
6e498158 1827
52666986
JPM		 1828 if (unlikely(!skb_queue_empty(&n->bc_entry.namedq)))
1829 tipc_named_rcv(net, &n->bc_entry.namedq);
23d8335d 1830
a853e4c6
JPM		 1831 if (unlikely(!skb_queue_empty(&n->bc_entry.inputq1)))
1832 tipc_node_mcast_rcv(n);
1833
6e498158
JPM		 1834 if (!skb_queue_empty(&le->inputq))
1835 tipc_sk_rcv(net, &le->inputq);
1836
1837 if (!skb_queue_empty(&xmitq))
1838 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1839
d999297c
JPM		 1840 tipc_node_put(n);
1841discard:
1842 kfree_skb(skb);
1843}
1844
682cd3cf
GM		 1845void tipc_node_apply_property(struct net *net, struct tipc_bearer *b,
1846 int prop)
37c64cf6
JM		 1847{
1848 struct tipc_net *tn = tipc_net(net);
1849 int bearer_id = b->identity;
1850 struct sk_buff_head xmitq;
1851 struct tipc_link_entry *e;
1852 struct tipc_node *n;
1853
1854 __skb_queue_head_init(&xmitq);
1855
1856 rcu_read_lock();
1857
1858 list_for_each_entry_rcu(n, &tn->node_list, list) {
1859 tipc_node_write_lock(n);
1860 e = &n->links[bearer_id];
682cd3cf
GM		 1861 if (e->link) {
1862 if (prop == TIPC_NLA_PROP_TOL)
1863 tipc_link_set_tolerance(e->link, b->tolerance,
1864 &xmitq);
1865 else if (prop == TIPC_NLA_PROP_MTU)
1866 tipc_link_set_mtu(e->link, b->mtu);
1867 }
37c64cf6
JM		 1868 tipc_node_write_unlock(n);
1869 tipc_bearer_xmit(net, bearer_id, &xmitq, &e->maddr);
1870 }
1871
1872 rcu_read_unlock();
1873}
1874
b3404022
RA		 1875int tipc_nl_peer_rm(struct sk_buff *skb, struct genl_info *info)
1876{
1877 struct net *net = sock_net(skb->sk);
1878 struct tipc_net *tn = net_generic(net, tipc_net_id);
1879 struct nlattr *attrs[TIPC_NLA_NET_MAX + 1];
1880 struct tipc_node *peer;
1881 u32 addr;
1882 int err;
b3404022
RA		 1883
1884 /* We identify the peer by its net */
1885 if (!info->attrs[TIPC_NLA_NET])
1886 return -EINVAL;
1887
8cb08174
JB		 1888 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_NET_MAX,
1889 info->attrs[TIPC_NLA_NET],
1890 tipc_nl_net_policy, info->extack);
b3404022
RA		 1891 if (err)
1892 return err;
1893
1894 if (!attrs[TIPC_NLA_NET_ADDR])
1895 return -EINVAL;
1896
1897 addr = nla_get_u32(attrs[TIPC_NLA_NET_ADDR]);
1898
1899 if (in_own_node(net, addr))
1900 return -ENOTSUPP;
1901
1902 spin_lock_bh(&tn->node_list_lock);
1903 peer = tipc_node_find(net, addr);
1904 if (!peer) {
1905 spin_unlock_bh(&tn->node_list_lock);
1906 return -ENXIO;
1907 }
1908
1909 tipc_node_write_lock(peer);
1910 if (peer->state != SELF_DOWN_PEER_DOWN &&
1911 peer->state != SELF_DOWN_PEER_LEAVING) {
1912 tipc_node_write_unlock(peer);
1913 err = -EBUSY;
1914 goto err_out;
1915 }
1916
6a939f36 1917 tipc_node_clear_links(peer);
b3404022
RA		 1918 tipc_node_write_unlock(peer);
1919 tipc_node_delete(peer);
1920
1921 err = 0;
1922err_out:
1923 tipc_node_put(peer);
1924 spin_unlock_bh(&tn->node_list_lock);
1925
1926 return err;
1927}
1928
3e4b6ab5
RA		 1929int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
1930{
1931 int err;
f2f9800d
YX		 1932 struct net *net = sock_net(skb->sk);
1933 struct tipc_net *tn = net_generic(net, tipc_net_id);
3e4b6ab5
RA		 1934 int done = cb->args[0];
1935 int last_addr = cb->args[1];
1936 struct tipc_node *node;
1937 struct tipc_nl_msg msg;
1938
1939 if (done)
1940 return 0;
1941
1942 msg.skb = skb;
1943 msg.portid = NETLINK_CB(cb->skb).portid;
1944 msg.seq = cb->nlh->nlmsg_seq;
1945
1946 rcu_read_lock();
8a0f6ebe
YX		 1947 if (last_addr) {
1948 node = tipc_node_find(net, last_addr);
1949 if (!node) {
1950 rcu_read_unlock();
1951 /* We never set seq or call nl_dump_check_consistent()
1952 * this means that setting prev_seq here will cause the
1953 * consistence check to fail in the netlink callback
1954 * handler. Resulting in the NLMSG_DONE message having
1955 * the NLM_F_DUMP_INTR flag set if the node state
1956 * changed while we released the lock.
1957 */
1958 cb->prev_seq = 1;
1959 return -EPIPE;
1960 }
1961 tipc_node_put(node);
3e4b6ab5
RA		 1962 }
1963
f2f9800d 1964 list_for_each_entry_rcu(node, &tn->node_list, list) {
3e4b6ab5
RA		 1965 if (last_addr) {
1966 if (node->addr == last_addr)
1967 last_addr = 0;
1968 else
1969 continue;
1970 }
1971
5405ff6e 1972 tipc_node_read_lock(node);
3e4b6ab5
RA		 1973 err = __tipc_nl_add_node(&msg, node);
1974 if (err) {
1975 last_addr = node->addr;
5405ff6e 1976 tipc_node_read_unlock(node);
3e4b6ab5
RA		 1977 goto out;
1978 }
1979
5405ff6e 1980 tipc_node_read_unlock(node);
3e4b6ab5
RA		 1981 }
1982 done = 1;
1983out:
1984 cb->args[0] = done;
1985 cb->args[1] = last_addr;
1986 rcu_read_unlock();
1987
1988 return skb->len;
1989}
5be9c086 1990
38206d59 1991/* tipc_node_find_by_name - locate owner node of link by link's name
5be9c086
JPM		 1992 * @net: the applicable net namespace
1993 * @name: pointer to link name string
1994 * @bearer_id: pointer to index in 'node->links' array where the link was found.
1995 *
1996 * Returns pointer to node owning the link, or 0 if no matching link is found.
1997 */
38206d59
JPM		 1998static struct tipc_node *tipc_node_find_by_name(struct net *net,
1999 const char *link_name,
2000 unsigned int *bearer_id)
5be9c086
JPM		 2001{
2002 struct tipc_net *tn = net_generic(net, tipc_net_id);
38206d59
JPM		 2003 struct tipc_link *l;
2004 struct tipc_node *n;
5be9c086
JPM		 2005 struct tipc_node *found_node = NULL;
2006 int i;
2007
2008 *bearer_id = 0;
2009 rcu_read_lock();
38206d59
JPM		 2010 list_for_each_entry_rcu(n, &tn->node_list, list) {
2011 tipc_node_read_lock(n);
5be9c086 2012 for (i = 0; i < MAX_BEARERS; i++) {
38206d59
JPM		 2013 l = n->links[i].link;
2014 if (l && !strcmp(tipc_link_name(l), link_name)) {
5be9c086 2015 *bearer_id = i;
38206d59 2016 found_node = n;
5be9c086
JPM		 2017 break;
2018 }
2019 }
38206d59 2020 tipc_node_read_unlock(n);
5be9c086
JPM		 2021 if (found_node)
2022 break;
2023 }
2024 rcu_read_unlock();
2025
2026 return found_node;
2027}
2028
2029int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info)
2030{
2031 int err;
2032 int res = 0;
2033 int bearer_id;
2034 char *name;
2035 struct tipc_link *link;
2036 struct tipc_node *node;
d01332f1 2037 struct sk_buff_head xmitq;
5be9c086
JPM		 2038 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2039 struct net *net = sock_net(skb->sk);
2040
d01332f1
RA		 2041 __skb_queue_head_init(&xmitq);
2042
5be9c086
JPM		 2043 if (!info->attrs[TIPC_NLA_LINK])
2044 return -EINVAL;
2045
8cb08174
JB		 2046 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_LINK_MAX,
2047 info->attrs[TIPC_NLA_LINK],
2048 tipc_nl_link_policy, info->extack);
5be9c086
JPM		 2049 if (err)
2050 return err;
2051
2052 if (!attrs[TIPC_NLA_LINK_NAME])
2053 return -EINVAL;
2054
2055 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2056
2057 if (strcmp(name, tipc_bclink_name) == 0)
2058 return tipc_nl_bc_link_set(net, attrs);
2059
38206d59 2060 node = tipc_node_find_by_name(net, name, &bearer_id);
5be9c086
JPM		 2061 if (!node)
2062 return -EINVAL;
2063
2064 tipc_node_read_lock(node);
2065
2066 link = node->links[bearer_id].link;
2067 if (!link) {
2068 res = -EINVAL;
2069 goto out;
2070 }
2071
2072 if (attrs[TIPC_NLA_LINK_PROP]) {
2073 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
2074
2075 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
2076 props);
2077 if (err) {
2078 res = err;
2079 goto out;
2080 }
2081
2082 if (props[TIPC_NLA_PROP_TOL]) {
2083 u32 tol;
2084
2085 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
d01332f1 2086 tipc_link_set_tolerance(link, tol, &xmitq);
5be9c086
JPM		 2087 }
2088 if (props[TIPC_NLA_PROP_PRIO]) {
2089 u32 prio;
2090
2091 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
d01332f1 2092 tipc_link_set_prio(link, prio, &xmitq);
5be9c086
JPM		 2093 }
2094 if (props[TIPC_NLA_PROP_WIN]) {
2095 u32 win;
2096
2097 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
2098 tipc_link_set_queue_limits(link, win);
2099 }
2100 }
2101
2102out:
2103 tipc_node_read_unlock(node);
d01332f1 2104 tipc_bearer_xmit(net, bearer_id, &xmitq, &node->links[bearer_id].maddr);
5be9c086
JPM		 2105 return res;
2106}
2107
2108int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info)
2109{
2110 struct net *net = genl_info_net(info);
94f6a80c 2111 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
5be9c086
JPM		 2112 struct tipc_nl_msg msg;
2113 char *name;
2114 int err;
2115
2116 msg.portid = info->snd_portid;
2117 msg.seq = info->snd_seq;
2118
94f6a80c 2119 if (!info->attrs[TIPC_NLA_LINK])
5be9c086 2120 return -EINVAL;
94f6a80c 2121
8cb08174
JB		 2122 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_LINK_MAX,
2123 info->attrs[TIPC_NLA_LINK],
2124 tipc_nl_link_policy, info->extack);
94f6a80c
YX		 2125 if (err)
2126 return err;
2127
2128 if (!attrs[TIPC_NLA_LINK_NAME])
2129 return -EINVAL;
2130
2131 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
5be9c086
JPM		 2132
2133 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2134 if (!msg.skb)
2135 return -ENOMEM;
2136
2137 if (strcmp(name, tipc_bclink_name) == 0) {
2138 err = tipc_nl_add_bc_link(net, &msg);
59b36613
CW		 2139 if (err)
2140 goto err_free;
5be9c086
JPM		 2141 } else {
2142 int bearer_id;
2143 struct tipc_node *node;
2144 struct tipc_link *link;
2145
38206d59 2146 node = tipc_node_find_by_name(net, name, &bearer_id);
59b36613
CW		 2147 if (!node) {
2148 err = -EINVAL;
2149 goto err_free;
2150 }
5be9c086
JPM		 2151
2152 tipc_node_read_lock(node);
2153 link = node->links[bearer_id].link;
2154 if (!link) {
2155 tipc_node_read_unlock(node);
59b36613
CW		 2156 err = -EINVAL;
2157 goto err_free;
5be9c086
JPM		 2158 }
2159
2160 err = __tipc_nl_add_link(net, &msg, link, 0);
2161 tipc_node_read_unlock(node);
59b36613
CW		 2162 if (err)
2163 goto err_free;
5be9c086
JPM		 2164 }
2165
2166 return genlmsg_reply(msg.skb, info);
59b36613
CW		 2167
2168err_free:
2169 nlmsg_free(msg.skb);
2170 return err;
5be9c086
JPM		 2171}
2172
2173int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info)
2174{
2175 int err;
2176 char *link_name;
2177 unsigned int bearer_id;
2178 struct tipc_link *link;
2179 struct tipc_node *node;
2180 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2181 struct net *net = sock_net(skb->sk);
2182 struct tipc_link_entry *le;
2183
2184 if (!info->attrs[TIPC_NLA_LINK])
2185 return -EINVAL;
2186
8cb08174
JB		 2187 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_LINK_MAX,
2188 info->attrs[TIPC_NLA_LINK],
2189 tipc_nl_link_policy, info->extack);
5be9c086
JPM		 2190 if (err)
2191 return err;
2192
2193 if (!attrs[TIPC_NLA_LINK_NAME])
2194 return -EINVAL;
2195
2196 link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2197
2198 if (strcmp(link_name, tipc_bclink_name) == 0) {
2199 err = tipc_bclink_reset_stats(net);
2200 if (err)
2201 return err;
2202 return 0;
2203 }
2204
38206d59 2205 node = tipc_node_find_by_name(net, link_name, &bearer_id);
5be9c086
JPM		 2206 if (!node)
2207 return -EINVAL;
2208
2209 le = &node->links[bearer_id];
2210 tipc_node_read_lock(node);
2211 spin_lock_bh(&le->lock);
2212 link = node->links[bearer_id].link;
2213 if (!link) {
2214 spin_unlock_bh(&le->lock);
2215 tipc_node_read_unlock(node);
2216 return -EINVAL;
2217 }
38206d59 2218 tipc_link_reset_stats(link);
5be9c086
JPM		 2219 spin_unlock_bh(&le->lock);
2220 tipc_node_read_unlock(node);
2221 return 0;
2222}
2223
2224/* Caller should hold node lock */
2225static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
2226 struct tipc_node *node, u32 *prev_link)
2227{
2228 u32 i;
2229 int err;
2230
2231 for (i = *prev_link; i < MAX_BEARERS; i++) {
2232 *prev_link = i;
2233
2234 if (!node->links[i].link)
2235 continue;
2236
2237 err = __tipc_nl_add_link(net, msg,
2238 node->links[i].link, NLM_F_MULTI);
2239 if (err)
2240 return err;
2241 }
2242 *prev_link = 0;
2243
2244 return 0;
2245}
2246
38206d59 2247int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb)
5be9c086
JPM		 2248{
2249 struct net *net = sock_net(skb->sk);
2250 struct tipc_net *tn = net_generic(net, tipc_net_id);
2251 struct tipc_node *node;
2252 struct tipc_nl_msg msg;
2253 u32 prev_node = cb->args[0];
2254 u32 prev_link = cb->args[1];
2255 int done = cb->args[2];
2256 int err;
2257
2258 if (done)
2259 return 0;
2260
2261 msg.skb = skb;
2262 msg.portid = NETLINK_CB(cb->skb).portid;
2263 msg.seq = cb->nlh->nlmsg_seq;
2264
2265 rcu_read_lock();
2266 if (prev_node) {
2267 node = tipc_node_find(net, prev_node);
2268 if (!node) {
2269 /* We never set seq or call nl_dump_check_consistent()
2270 * this means that setting prev_seq here will cause the
2271 * consistence check to fail in the netlink callback
2272 * handler. Resulting in the last NLMSG_DONE message
2273 * having the NLM_F_DUMP_INTR flag set.
2274 */
2275 cb->prev_seq = 1;
2276 goto out;
2277 }
2278 tipc_node_put(node);
2279
2280 list_for_each_entry_continue_rcu(node, &tn->node_list,
2281 list) {
2282 tipc_node_read_lock(node);
2283 err = __tipc_nl_add_node_links(net, &msg, node,
2284 &prev_link);
2285 tipc_node_read_unlock(node);
2286 if (err)
2287 goto out;
2288
2289 prev_node = node->addr;
2290 }
2291 } else {
2292 err = tipc_nl_add_bc_link(net, &msg);
2293 if (err)
2294 goto out;
2295
2296 list_for_each_entry_rcu(node, &tn->node_list, list) {
2297 tipc_node_read_lock(node);
2298 err = __tipc_nl_add_node_links(net, &msg, node,
2299 &prev_link);
2300 tipc_node_read_unlock(node);
2301 if (err)
2302 goto out;
2303
2304 prev_node = node->addr;
2305 }
2306 }
2307 done = 1;
2308out:
2309 rcu_read_unlock();
2310
2311 cb->args[0] = prev_node;
2312 cb->args[1] = prev_link;
2313 cb->args[2] = done;
2314
2315 return skb->len;
2316}
7b3f5229
PB		 2317
2318int tipc_nl_node_set_monitor(struct sk_buff *skb, struct genl_info *info)
2319{
2320 struct nlattr *attrs[TIPC_NLA_MON_MAX + 1];
2321 struct net *net = sock_net(skb->sk);
2322 int err;
2323
2324 if (!info->attrs[TIPC_NLA_MON])
2325 return -EINVAL;
2326
8cb08174
JB		 2327 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_MON_MAX,
2328 info->attrs[TIPC_NLA_MON],
2329 tipc_nl_monitor_policy,
2330 info->extack);
7b3f5229
PB		 2331 if (err)
2332 return err;
2333
2334 if (attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]) {
2335 u32 val;
2336
2337 val = nla_get_u32(attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]);
2338 err = tipc_nl_monitor_set_threshold(net, val);
2339 if (err)
2340 return err;
2341 }
2342
2343 return 0;
2344}
bf1035b2
PB		 2345
2346static int __tipc_nl_add_monitor_prop(struct net *net, struct tipc_nl_msg *msg)
2347{
2348 struct nlattr *attrs;
2349 void *hdr;
2350 u32 val;
2351
2352 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
2353 0, TIPC_NL_MON_GET);
2354 if (!hdr)
2355 return -EMSGSIZE;
2356
ae0be8de 2357 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_MON);
bf1035b2
PB		 2358 if (!attrs)
2359 goto msg_full;
2360
2361 val = tipc_nl_monitor_get_threshold(net);
2362
2363 if (nla_put_u32(msg->skb, TIPC_NLA_MON_ACTIVATION_THRESHOLD, val))
2364 goto attr_msg_full;
2365
2366 nla_nest_end(msg->skb, attrs);
2367 genlmsg_end(msg->skb, hdr);
2368
2369 return 0;
2370
2371attr_msg_full:
2372 nla_nest_cancel(msg->skb, attrs);
2373msg_full:
2374 genlmsg_cancel(msg->skb, hdr);
2375
2376 return -EMSGSIZE;
2377}
2378
2379int tipc_nl_node_get_monitor(struct sk_buff *skb, struct genl_info *info)
2380{
2381 struct net *net = sock_net(skb->sk);
2382 struct tipc_nl_msg msg;
2383 int err;
2384
2385 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
78302fd4
PB		 2386 if (!msg.skb)
2387 return -ENOMEM;
bf1035b2
PB		 2388 msg.portid = info->snd_portid;
2389 msg.seq = info->snd_seq;
2390
2391 err = __tipc_nl_add_monitor_prop(net, &msg);
2392 if (err) {
2393 nlmsg_free(msg.skb);
2394 return err;
2395 }
2396
2397 return genlmsg_reply(msg.skb, info);
2398}
cf6f7e1d
PB		 2399
2400int tipc_nl_node_dump_monitor(struct sk_buff *skb, struct netlink_callback *cb)
2401{
2402 struct net *net = sock_net(skb->sk);
2403 u32 prev_bearer = cb->args[0];
2404 struct tipc_nl_msg msg;
36a50a98 2405 int bearer_id;
cf6f7e1d 2406 int err;
cf6f7e1d
PB		 2407
2408 if (prev_bearer == MAX_BEARERS)
2409 return 0;
2410
2411 msg.skb = skb;
2412 msg.portid = NETLINK_CB(cb->skb).portid;
2413 msg.seq = cb->nlh->nlmsg_seq;
2414
2415 rtnl_lock();
36a50a98 2416 for (bearer_id = prev_bearer; bearer_id < MAX_BEARERS; bearer_id++) {
7dbc73e6 2417 err = __tipc_nl_add_monitor(net, &msg, bearer_id);
cf6f7e1d 2418 if (err)
36a50a98 2419 break;
cf6f7e1d 2420 }
cf6f7e1d 2421 rtnl_unlock();
36a50a98 2422 cb->args[0] = bearer_id;
cf6f7e1d
PB		 2423
2424 return skb->len;
2425}
2426
2427int tipc_nl_node_dump_monitor_peer(struct sk_buff *skb,
2428 struct netlink_callback *cb)
2429{
2430 struct net *net = sock_net(skb->sk);
2431 u32 prev_node = cb->args[1];
2432 u32 bearer_id = cb->args[2];
2433 int done = cb->args[0];
2434 struct tipc_nl_msg msg;
2435 int err;
2436
2437 if (!prev_node) {
2438 struct nlattr **attrs;
2439 struct nlattr *mon[TIPC_NLA_MON_MAX + 1];
2440
2441 err = tipc_nlmsg_parse(cb->nlh, &attrs);
2442 if (err)
2443 return err;
2444
2445 if (!attrs[TIPC_NLA_MON])
2446 return -EINVAL;
2447
8cb08174
JB		 2448 err = nla_parse_nested_deprecated(mon, TIPC_NLA_MON_MAX,
2449 attrs[TIPC_NLA_MON],
2450 tipc_nl_monitor_policy,
2451 NULL);
cf6f7e1d
PB		 2452 if (err)
2453 return err;
2454
2455 if (!mon[TIPC_NLA_MON_REF])
2456 return -EINVAL;
2457
2458 bearer_id = nla_get_u32(mon[TIPC_NLA_MON_REF]);
2459
2460 if (bearer_id >= MAX_BEARERS)
2461 return -EINVAL;
2462 }
2463
2464 if (done)
2465 return 0;
2466
2467 msg.skb = skb;
2468 msg.portid = NETLINK_CB(cb->skb).portid;
2469 msg.seq = cb->nlh->nlmsg_seq;
2470
2471 rtnl_lock();
2472 err = tipc_nl_add_monitor_peer(net, &msg, bearer_id, &prev_node);
2473 if (!err)
2474 done = 1;
2475
2476 rtnl_unlock();
2477 cb->args[0] = done;
2478 cb->args[1] = prev_node;
2479 cb->args[2] = bearer_id;
2480
2481 return skb->len;
2482}
b4b9771b
TL		 2483
2484u32 tipc_node_get_addr(struct tipc_node *node)
2485{
2486 return (node) ? node->addr : 0;
2487}
2488
2489/**
2490 * tipc_node_dump - dump TIPC node data
2491 * @n: tipc node to be dumped
2492 * @more: dump more?
2493 * - false: dump only tipc node data
2494 * - true: dump node link data as well
2495 * @buf: returned buffer of dump data in format
2496 */
2497int tipc_node_dump(struct tipc_node *n, bool more, char *buf)
2498{
2499 int i = 0;
2500 size_t sz = (more) ? NODE_LMAX : NODE_LMIN;
2501
2502 if (!n) {
2503 i += scnprintf(buf, sz, "node data: (null)\n");
2504 return i;
2505 }
2506
2507 i += scnprintf(buf, sz, "node data: %x", n->addr);
2508 i += scnprintf(buf + i, sz - i, " %x", n->state);
2509 i += scnprintf(buf + i, sz - i, " %d", n->active_links[0]);
2510 i += scnprintf(buf + i, sz - i, " %d", n->active_links[1]);
2511 i += scnprintf(buf + i, sz - i, " %x", n->action_flags);
2512 i += scnprintf(buf + i, sz - i, " %u", n->failover_sent);
2513 i += scnprintf(buf + i, sz - i, " %u", n->sync_point);
2514 i += scnprintf(buf + i, sz - i, " %d", n->link_cnt);
2515 i += scnprintf(buf + i, sz - i, " %u", n->working_links);
2516 i += scnprintf(buf + i, sz - i, " %x", n->capabilities);
2517 i += scnprintf(buf + i, sz - i, " %lu\n", n->keepalive_intv);
2518
2519 if (!more)
2520 return i;
2521
2522 i += scnprintf(buf + i, sz - i, "link_entry[0]:\n");
2523 i += scnprintf(buf + i, sz - i, " mtu: %u\n", n->links[0].mtu);
2524 i += scnprintf(buf + i, sz - i, " media: ");
2525 i += tipc_media_addr_printf(buf + i, sz - i, &n->links[0].maddr);
2526 i += scnprintf(buf + i, sz - i, "\n");
2527 i += tipc_link_dump(n->links[0].link, TIPC_DUMP_NONE, buf + i);
2528 i += scnprintf(buf + i, sz - i, " inputq: ");
2529 i += tipc_list_dump(&n->links[0].inputq, false, buf + i);
2530
2531 i += scnprintf(buf + i, sz - i, "link_entry[1]:\n");
2532 i += scnprintf(buf + i, sz - i, " mtu: %u\n", n->links[1].mtu);
2533 i += scnprintf(buf + i, sz - i, " media: ");
2534 i += tipc_media_addr_printf(buf + i, sz - i, &n->links[1].maddr);
2535 i += scnprintf(buf + i, sz - i, "\n");
2536 i += tipc_link_dump(n->links[1].link, TIPC_DUMP_NONE, buf + i);
2537 i += scnprintf(buf + i, sz - i, " inputq: ");
2538 i += tipc_list_dump(&n->links[1].inputq, false, buf + i);
2539
2540 i += scnprintf(buf + i, sz - i, "bclink:\n ");
2541 i += tipc_link_dump(n->bc_entry.link, TIPC_DUMP_NONE, buf + i);
2542
2543 return i;
2544}
Ubuntu Jammy Linux kernel mirror