]> git.proxmox.com Git - mirror_ubuntu-hirsute-kernel.git/blame - net/tipc/node.c
projects / mirror_ubuntu-hirsute-kernel.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
ptp: ptp_dte: remove redundant dev_err message
[mirror_ubuntu-hirsute-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
JPM		 716 tipc_node_fsm_evt(n, SELF_ESTABL_CONTACT_EVT);
717 n->action_flags |= TIPC_NOTIFY_NODE_UP;
def22c47 718 tipc_link_set_active(nl, true);
b06b281e 719 tipc_bcast_add_peer(n->net, nl, xmitq);
9d13ec65 720 return;
b97bf3fd 721 }
36e78a46 722
6e498158 723 /* Second link => redistribute slots */
38206d59
JPM		 724 if (tipc_link_prio(nl) > tipc_link_prio(ol)) {
725 pr_debug("Old link <%s> becomes standby\n", tipc_link_name(ol));
36e78a46 726 *slot0 = bearer_id;
6e498158 727 *slot1 = bearer_id;
c72fa872
JPM		 728 tipc_link_set_active(nl, true);
729 tipc_link_set_active(ol, false);
38206d59 730 } else if (tipc_link_prio(nl) == tipc_link_prio(ol)) {
c72fa872 731 tipc_link_set_active(nl, true);
c49a0a84 732 *slot1 = bearer_id;
6e498158 733 } else {
38206d59 734 pr_debug("New link <%s> is standby\n", tipc_link_name(nl));
b97bf3fd 735 }
b97bf3fd 736
6e498158
JPM		 737 /* Prepare synchronization with first link */
738 tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq);
b97bf3fd
PL		 739}
740
741/**
598411d7
JPM		 742 * tipc_node_link_up - handle addition of link
743 *
744 * Link becomes active (alone or shared) or standby, depending on its priority.
b97bf3fd 745 */
598411d7
JPM		 746static void tipc_node_link_up(struct tipc_node *n, int bearer_id,
747 struct sk_buff_head *xmitq)
b97bf3fd 748{
de7e07f9
JPM		 749 struct tipc_media_addr *maddr;
750
5405ff6e 751 tipc_node_write_lock(n);
598411d7 752 __tipc_node_link_up(n, bearer_id, xmitq);
de7e07f9
JPM		 753 maddr = &n->links[bearer_id].maddr;
754 tipc_bearer_xmit(n->net, bearer_id, xmitq, maddr);
5405ff6e 755 tipc_node_write_unlock(n);
598411d7
JPM		 756}
757
c0b14a08
TL		 758/**
759 * tipc_node_link_failover() - start failover in case "half-failover"
760 *
761 * This function is only called in a very special situation where link
762 * failover can be already started on peer node but not on this node.
763 * This can happen when e.g.
764 * 1. Both links <1A-2A>, <1B-2B> down
765 * 2. Link endpoint 2A up, but 1A still down (e.g. due to network
766 * disturbance, wrong session, etc.)
767 * 3. Link <1B-2B> up
768 * 4. Link endpoint 2A down (e.g. due to link tolerance timeout)
d0f84d08 769 * 5. Node 2 starts failover onto link <1B-2B>
c0b14a08 770 *
d0f84d08 771 * ==> Node 1 does never start link/node failover!
c0b14a08
TL		 772 *
773 * @n: tipc node structure
774 * @l: link peer endpoint failingover (- can be NULL)
775 * @tnl: tunnel link
776 * @xmitq: queue for messages to be xmited on tnl link later
777 */
778static void tipc_node_link_failover(struct tipc_node *n, struct tipc_link *l,
779 struct tipc_link *tnl,
780 struct sk_buff_head *xmitq)
781{
782 /* Avoid to be "self-failover" that can never end */
783 if (!tipc_link_is_up(tnl))
784 return;
785
d0f84d08
TL		 786 /* Don't rush, failure link may be in the process of resetting */
787 if (l && !tipc_link_is_reset(l))
788 return;
789
c0b14a08
TL		 790 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
791 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
792
793 n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
794 tipc_link_failover_prepare(l, tnl, xmitq);
795
796 if (l)
797 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
798 tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
799}
800
598411d7
JPM		 801/**
802 * __tipc_node_link_down - handle loss of link
803 */
804static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
805 struct sk_buff_head *xmitq,
806 struct tipc_media_addr **maddr)
807{
808 struct tipc_link_entry *le = &n->links[*bearer_id];
36e78a46
JPM		 809 int *slot0 = &n->active_links[0];
810 int *slot1 = &n->active_links[1];
38206d59 811 int i, highest = 0, prio;
6e498158 812 struct tipc_link *l, *_l, *tnl;
b97bf3fd 813
598411d7 814 l = n->links[*bearer_id].link;
662921cd 815 if (!l || tipc_link_is_reset(l))
655fb243
JPM		 816 return;
817
9d13ec65
JPM		 818 n->working_links--;
819 n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
38206d59 820 n->link_id = tipc_link_id(l);
5392d646 821
598411d7 822 tipc_bearer_remove_dest(n->net, *bearer_id, n->addr);
655fb243 823
3fa9cacd 824 pr_debug("Lost link <%s> on network plane %c\n",
38206d59 825 tipc_link_name(l), tipc_link_plane(l));
16e166b8 826
36e78a46
JPM		 827 /* Select new active link if any available */
828 *slot0 = INVALID_BEARER_ID;
829 *slot1 = INVALID_BEARER_ID;
830 for (i = 0; i < MAX_BEARERS; i++) {
831 _l = n->links[i].link;
832 if (!_l || !tipc_link_is_up(_l))
833 continue;
655fb243
JPM		 834 if (_l == l)
835 continue;
38206d59
JPM		 836 prio = tipc_link_prio(_l);
837 if (prio < highest)
36e78a46 838 continue;
38206d59
JPM		 839 if (prio > highest) {
840 highest = prio;
36e78a46
JPM		 841 *slot0 = i;
842 *slot1 = i;
843 continue;
844 }
845 *slot1 = i;
846 }
655fb243 847
38077b8e 848 if (!node_is_up(n)) {
c8199300
JPM		 849 if (tipc_link_peer_is_down(l))
850 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
851 tipc_node_fsm_evt(n, SELF_LOST_CONTACT_EVT);
26574db0 852 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link down!");
c8199300 853 tipc_link_fsm_evt(l, LINK_RESET_EVT);
6e498158 854 tipc_link_reset(l);
282b3a05
JPM		 855 tipc_link_build_reset_msg(l, xmitq);
856 *maddr = &n->links[*bearer_id].maddr;
598411d7 857 node_lost_contact(n, &le->inputq);
b06b281e 858 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
6e498158
JPM		 859 return;
860 }
b06b281e 861 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
655fb243 862
6e498158 863 /* There is still a working link => initiate failover */
38206d59
JPM		 864 *bearer_id = n->active_links[0];
865 tnl = n->links[*bearer_id].link;
5ae2f8e6
JPM		 866 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
867 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
38206d59 868 n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
598411d7 869 tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, xmitq);
26574db0 870 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link down -> failover!");
655fb243 871 tipc_link_reset(l);
c8199300 872 tipc_link_fsm_evt(l, LINK_RESET_EVT);
662921cd 873 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
598411d7 874 tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
38206d59 875 *maddr = &n->links[*bearer_id].maddr;
598411d7
JPM		 876}
877
878static void tipc_node_link_down(struct tipc_node *n, int bearer_id, bool delete)
879{
880 struct tipc_link_entry *le = &n->links[bearer_id];
737889ef 881 struct tipc_media_addr *maddr = NULL;
73f646ce 882 struct tipc_link *l = le->link;
35c55c98 883 int old_bearer_id = bearer_id;
737889ef 884 struct sk_buff_head xmitq;
598411d7 885
73f646ce
JPM		 886 if (!l)
887 return;
888
598411d7
JPM		 889 __skb_queue_head_init(&xmitq);
890
5405ff6e 891 tipc_node_write_lock(n);
73f646ce
JPM		 892 if (!tipc_link_is_establishing(l)) {
893 __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr);
73f646ce
JPM		 894 } else {
895 /* Defuse pending tipc_node_link_up() */
91986ee1 896 tipc_link_reset(l);
73f646ce 897 tipc_link_fsm_evt(l, LINK_RESET_EVT);
598411d7 898 }
91986ee1
TL		 899 if (delete) {
900 kfree(l);
901 le->link = NULL;
902 n->link_cnt--;
903 }
eb18a510 904 trace_tipc_node_link_down(n, true, "node link down or deleted!");
5405ff6e 905 tipc_node_write_unlock(n);
35c55c98
JPM		 906 if (delete)
907 tipc_mon_remove_peer(n->net, n->addr, old_bearer_id);
737889ef
JM		 908 if (!skb_queue_empty(&xmitq))
909 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr);
598411d7 910 tipc_sk_rcv(n->net, &le->inputq);
b97bf3fd
PL		 911}
912
38077b8e 913static bool node_is_up(struct tipc_node *n)
b97bf3fd 914{
36e78a46 915 return n->active_links[0] != INVALID_BEARER_ID;
b97bf3fd
PL		 916}
917
38077b8e
JM		 918bool tipc_node_is_up(struct net *net, u32 addr)
919{
920 struct tipc_node *n;
921 bool retval = false;
922
923 if (in_own_node(net, addr))
924 return true;
925
926 n = tipc_node_find(net, addr);
927 if (!n)
928 return false;
929 retval = node_is_up(n);
930 tipc_node_put(n);
931 return retval;
932}
933
25b0b9c4
JM		 934static u32 tipc_node_suggest_addr(struct net *net, u32 addr)
935{
936 struct tipc_node *n;
937
938 addr ^= tipc_net(net)->random;
939 while ((n = tipc_node_find(net, addr))) {
940 tipc_node_put(n);
941 addr++;
942 }
943 return addr;
944}
945
946/* tipc_node_try_addr(): Check if addr can be used by peer, suggest other if not
2a57f182 947 * Returns suggested address if any, otherwise 0
25b0b9c4
JM		 948 */
949u32 tipc_node_try_addr(struct net *net, u8 *id, u32 addr)
950{
951 struct tipc_net *tn = tipc_net(net);
952 struct tipc_node *n;
953
954 /* Suggest new address if some other peer is using this one */
955 n = tipc_node_find(net, addr);
956 if (n) {
957 if (!memcmp(n->peer_id, id, NODE_ID_LEN))
958 addr = 0;
959 tipc_node_put(n);
960 if (!addr)
961 return 0;
962 return tipc_node_suggest_addr(net, addr);
963 }
964
965 /* Suggest previously used address if peer is known */
966 n = tipc_node_find_by_id(net, id);
967 if (n) {
968 addr = n->addr;
969 tipc_node_put(n);
2a57f182 970 return addr;
25b0b9c4 971 }
2a57f182
JM		 972
973 /* Even this node may be in conflict */
25b0b9c4
JM		 974 if (tn->trial_addr == addr)
975 return tipc_node_suggest_addr(net, addr);
976
2a57f182 977 return 0;
25b0b9c4
JM		 978}
979
980void tipc_node_check_dest(struct net *net, u32 addr,
981 u8 *peer_id, struct tipc_bearer *b,
cf148816
JPM		 982 u16 capabilities, u32 signature,
983 struct tipc_media_addr *maddr,
984 bool *respond, bool *dupl_addr)
d3a43b90 985{
cf148816
JPM		 986 struct tipc_node *n;
987 struct tipc_link *l;
440d8963 988 struct tipc_link_entry *le;
cf148816
JPM		 989 bool addr_match = false;
990 bool sign_match = false;
991 bool link_up = false;
992 bool accept_addr = false;
598411d7 993 bool reset = true;
0e05498e 994 char *if_name;
5ca509fc 995 unsigned long intv;
d949cfed 996 u16 session;
440d8963 997
cf148816
JPM		 998 *dupl_addr = false;
999 *respond = false;
1000
25b0b9c4 1001 n = tipc_node_create(net, addr, peer_id, capabilities);
cf148816
JPM		 1002 if (!n)
1003 return;
d3a43b90 1004
5405ff6e 1005 tipc_node_write_lock(n);
cf148816 1006
440d8963 1007 le = &n->links[b->identity];
cf148816
JPM		 1008
1009 /* Prepare to validate requesting node's signature and media address */
440d8963 1010 l = le->link;
cf148816 1011 link_up = l && tipc_link_is_up(l);
440d8963 1012 addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr));
cf148816
JPM		 1013 sign_match = (signature == n->signature);
1014
1015 /* These three flags give us eight permutations: */
1016
1017 if (sign_match && addr_match && link_up) {
1018 /* All is fine. Do nothing. */
598411d7 1019 reset = false;
cf148816
JPM		 1020 } else if (sign_match && addr_match && !link_up) {
1021 /* Respond. The link will come up in due time */
1022 *respond = true;
1023 } else if (sign_match && !addr_match && link_up) {
1024 /* Peer has changed i/f address without rebooting.
1025 * If so, the link will reset soon, and the next
1026 * discovery will be accepted. So we can ignore it.
1027 * It may also be an cloned or malicious peer having
1028 * chosen the same node address and signature as an
1029 * existing one.
1030 * Ignore requests until the link goes down, if ever.
1031 */
1032 *dupl_addr = true;
1033 } else if (sign_match && !addr_match && !link_up) {
1034 /* Peer link has changed i/f address without rebooting.
1035 * It may also be a cloned or malicious peer; we can't
1036 * distinguish between the two.
1037 * The signature is correct, so we must accept.
1038 */
1039 accept_addr = true;
1040 *respond = true;
1041 } else if (!sign_match && addr_match && link_up) {
1042 /* Peer node rebooted. Two possibilities:
1043 * - Delayed re-discovery; this link endpoint has already
1044 * reset and re-established contact with the peer, before
1045 * receiving a discovery message from that node.
1046 * (The peer happened to receive one from this node first).
1047 * - The peer came back so fast that our side has not
1048 * discovered it yet. Probing from this side will soon
1049 * reset the link, since there can be no working link
1050 * endpoint at the peer end, and the link will re-establish.
1051 * Accept the signature, since it comes from a known peer.
1052 */
1053 n->signature = signature;
1054 } else if (!sign_match && addr_match && !link_up) {
1055 /* The peer node has rebooted.
1056 * Accept signature, since it is a known peer.
1057 */
1058 n->signature = signature;
1059 *respond = true;
1060 } else if (!sign_match && !addr_match && link_up) {
1061 /* Peer rebooted with new address, or a new/duplicate peer.
1062 * Ignore until the link goes down, if ever.
1063 */
1064 *dupl_addr = true;
1065 } else if (!sign_match && !addr_match && !link_up) {
1066 /* Peer rebooted with new address, or it is a new peer.
1067 * Accept signature and address.
1068 */
1069 n->signature = signature;
1070 accept_addr = true;
1071 *respond = true;
1072 }
d3a43b90 1073
cf148816
JPM		 1074 if (!accept_addr)
1075 goto exit;
d3a43b90 1076
cf148816 1077 /* Now create new link if not already existing */
8a1577c9 1078 if (!l) {
20263641 1079 if (n->link_cnt == 2)
440d8963 1080 goto exit;
20263641 1081
0e05498e 1082 if_name = strchr(b->name, ':') + 1;
d949cfed 1083 get_random_bytes(&session, sizeof(u16));
c72fa872 1084 if (!tipc_link_create(net, if_name, b->identity, b->tolerance,
0e05498e 1085 b->net_plane, b->mtu, b->priority,
d949cfed 1086 b->window, session,
25b0b9c4 1087 tipc_own_addr(net), addr, peer_id,
2af5ae37 1088 n->capabilities,
52666986
JPM		 1089 tipc_bc_sndlink(n->net), n->bc_entry.link,
1090 &le->inputq,
1091 &n->bc_entry.namedq, &l)) {
cf148816
JPM		 1092 *respond = false;
1093 goto exit;
1094 }
26574db0 1095 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link created!");
440d8963 1096 tipc_link_reset(l);
c8199300 1097 tipc_link_fsm_evt(l, LINK_RESET_EVT);
17b20630
JPM		 1098 if (n->state == NODE_FAILINGOVER)
1099 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
440d8963
JPM		 1100 le->link = l;
1101 n->link_cnt++;
8a1577c9 1102 tipc_node_calculate_timer(n, l);
5ca509fc
JPM		 1103 if (n->link_cnt == 1) {
1104 intv = jiffies + msecs_to_jiffies(n->keepalive_intv);
1105 if (!mod_timer(&n->timer, intv))
8a1577c9 1106 tipc_node_get(n);
5ca509fc 1107 }
8a1577c9 1108 }
440d8963 1109 memcpy(&le->maddr, maddr, sizeof(*maddr));
cf148816 1110exit:
5405ff6e 1111 tipc_node_write_unlock(n);
2837f39c 1112 if (reset && l && !tipc_link_is_reset(l))
598411d7 1113 tipc_node_link_down(n, b->identity, false);
cf148816 1114 tipc_node_put(n);
d3a43b90
JPM		 1115}
1116
6144a996
JPM		 1117void tipc_node_delete_links(struct net *net, int bearer_id)
1118{
1119 struct tipc_net *tn = net_generic(net, tipc_net_id);
6144a996
JPM		 1120 struct tipc_node *n;
1121
1122 rcu_read_lock();
1123 list_for_each_entry_rcu(n, &tn->node_list, list) {
598411d7 1124 tipc_node_link_down(n, bearer_id, true);
6144a996
JPM		 1125 }
1126 rcu_read_unlock();
1127}
1128
1129static void tipc_node_reset_links(struct tipc_node *n)
1130{
598411d7 1131 int i;
6144a996 1132
d50ccc2d 1133 pr_warn("Resetting all links to %x\n", n->addr);
6144a996 1134
eb18a510 1135 trace_tipc_node_reset_links(n, true, " ");
6144a996 1136 for (i = 0; i < MAX_BEARERS; i++) {
598411d7 1137 tipc_node_link_down(n, i, false);
6144a996 1138 }
6144a996
JPM		 1139}
1140
1a20cc25
JPM		 1141/* tipc_node_fsm_evt - node finite state machine
1142 * Determines when contact is allowed with peer node
1143 */
d999297c 1144static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
1a20cc25
JPM		 1145{
1146 int state = n->state;
1147
1148 switch (state) {
1149 case SELF_DOWN_PEER_DOWN:
1150 switch (evt) {
1151 case SELF_ESTABL_CONTACT_EVT:
1152 state = SELF_UP_PEER_COMING;
1153 break;
1154 case PEER_ESTABL_CONTACT_EVT:
1155 state = SELF_COMING_PEER_UP;
1156 break;
1157 case SELF_LOST_CONTACT_EVT:
1158 case PEER_LOST_CONTACT_EVT:
1159 break;
66996b6c
JPM		 1160 case NODE_SYNCH_END_EVT:
1161 case NODE_SYNCH_BEGIN_EVT:
1162 case NODE_FAILOVER_BEGIN_EVT:
1163 case NODE_FAILOVER_END_EVT:
1a20cc25 1164 default:
66996b6c 1165 goto illegal_evt;
1a20cc25
JPM		 1166 }
1167 break;
1168 case SELF_UP_PEER_UP:
1169 switch (evt) {
1170 case SELF_LOST_CONTACT_EVT:
1171 state = SELF_DOWN_PEER_LEAVING;
1172 break;
1173 case PEER_LOST_CONTACT_EVT:
1174 state = SELF_LEAVING_PEER_DOWN;
1175 break;
66996b6c
JPM		 1176 case NODE_SYNCH_BEGIN_EVT:
1177 state = NODE_SYNCHING;
1178 break;
1179 case NODE_FAILOVER_BEGIN_EVT:
1180 state = NODE_FAILINGOVER;
1181 break;
1a20cc25
JPM		 1182 case SELF_ESTABL_CONTACT_EVT:
1183 case PEER_ESTABL_CONTACT_EVT:
66996b6c
JPM		 1184 case NODE_SYNCH_END_EVT:
1185 case NODE_FAILOVER_END_EVT:
1a20cc25
JPM		 1186 break;
1187 default:
66996b6c 1188 goto illegal_evt;
1a20cc25
JPM		 1189 }
1190 break;
1191 case SELF_DOWN_PEER_LEAVING:
1192 switch (evt) {
1193 case PEER_LOST_CONTACT_EVT:
1194 state = SELF_DOWN_PEER_DOWN;
1195 break;
1196 case SELF_ESTABL_CONTACT_EVT:
1197 case PEER_ESTABL_CONTACT_EVT:
1198 case SELF_LOST_CONTACT_EVT:
1199 break;
66996b6c
JPM		 1200 case NODE_SYNCH_END_EVT:
1201 case NODE_SYNCH_BEGIN_EVT:
1202 case NODE_FAILOVER_BEGIN_EVT:
1203 case NODE_FAILOVER_END_EVT:
1a20cc25 1204 default:
66996b6c 1205 goto illegal_evt;
1a20cc25
JPM		 1206 }
1207 break;
1208 case SELF_UP_PEER_COMING:
1209 switch (evt) {
1210 case PEER_ESTABL_CONTACT_EVT:
1211 state = SELF_UP_PEER_UP;
1212 break;
1213 case SELF_LOST_CONTACT_EVT:
c4282ca7 1214 state = SELF_DOWN_PEER_DOWN;
1a20cc25
JPM		 1215 break;
1216 case SELF_ESTABL_CONTACT_EVT:
1217 case PEER_LOST_CONTACT_EVT:
66996b6c 1218 case NODE_SYNCH_END_EVT:
66996b6c 1219 case NODE_FAILOVER_BEGIN_EVT:
73f646ce
JPM		 1220 break;
1221 case NODE_SYNCH_BEGIN_EVT:
66996b6c 1222 case NODE_FAILOVER_END_EVT:
1a20cc25 1223 default:
66996b6c 1224 goto illegal_evt;
1a20cc25
JPM		 1225 }
1226 break;
1227 case SELF_COMING_PEER_UP:
1228 switch (evt) {
1229 case SELF_ESTABL_CONTACT_EVT:
1230 state = SELF_UP_PEER_UP;
1231 break;
1232 case PEER_LOST_CONTACT_EVT:
c4282ca7 1233 state = SELF_DOWN_PEER_DOWN;
1a20cc25
JPM		 1234 break;
1235 case SELF_LOST_CONTACT_EVT:
1236 case PEER_ESTABL_CONTACT_EVT:
1237 break;
66996b6c
JPM		 1238 case NODE_SYNCH_END_EVT:
1239 case NODE_SYNCH_BEGIN_EVT:
1240 case NODE_FAILOVER_BEGIN_EVT:
1241 case NODE_FAILOVER_END_EVT:
1a20cc25 1242 default:
66996b6c 1243 goto illegal_evt;
1a20cc25
JPM		 1244 }
1245 break;
1246 case SELF_LEAVING_PEER_DOWN:
1247 switch (evt) {
1248 case SELF_LOST_CONTACT_EVT:
1249 state = SELF_DOWN_PEER_DOWN;
1250 break;
1251 case SELF_ESTABL_CONTACT_EVT:
1252 case PEER_ESTABL_CONTACT_EVT:
1253 case PEER_LOST_CONTACT_EVT:
1254 break;
66996b6c
JPM		 1255 case NODE_SYNCH_END_EVT:
1256 case NODE_SYNCH_BEGIN_EVT:
1257 case NODE_FAILOVER_BEGIN_EVT:
1258 case NODE_FAILOVER_END_EVT:
1259 default:
1260 goto illegal_evt;
1261 }
1262 break;
1263 case NODE_FAILINGOVER:
1264 switch (evt) {
1265 case SELF_LOST_CONTACT_EVT:
1266 state = SELF_DOWN_PEER_LEAVING;
1267 break;
1268 case PEER_LOST_CONTACT_EVT:
1269 state = SELF_LEAVING_PEER_DOWN;
1270 break;
1271 case NODE_FAILOVER_END_EVT:
1272 state = SELF_UP_PEER_UP;
1273 break;
1274 case NODE_FAILOVER_BEGIN_EVT:
1275 case SELF_ESTABL_CONTACT_EVT:
1276 case PEER_ESTABL_CONTACT_EVT:
1277 break;
1278 case NODE_SYNCH_BEGIN_EVT:
1279 case NODE_SYNCH_END_EVT:
1a20cc25 1280 default:
66996b6c
JPM		 1281 goto illegal_evt;
1282 }
1283 break;
1284 case NODE_SYNCHING:
1285 switch (evt) {
1286 case SELF_LOST_CONTACT_EVT:
1287 state = SELF_DOWN_PEER_LEAVING;
1288 break;
1289 case PEER_LOST_CONTACT_EVT:
1290 state = SELF_LEAVING_PEER_DOWN;
1291 break;
1292 case NODE_SYNCH_END_EVT:
1293 state = SELF_UP_PEER_UP;
1294 break;
1295 case NODE_FAILOVER_BEGIN_EVT:
1296 state = NODE_FAILINGOVER;
1297 break;
1298 case NODE_SYNCH_BEGIN_EVT:
1299 case SELF_ESTABL_CONTACT_EVT:
1300 case PEER_ESTABL_CONTACT_EVT:
1301 break;
1302 case NODE_FAILOVER_END_EVT:
1303 default:
1304 goto illegal_evt;
1a20cc25
JPM		 1305 }
1306 break;
1307 default:
1308 pr_err("Unknown node fsm state %x\n", state);
1309 break;
1310 }
eb18a510 1311 trace_tipc_node_fsm(n->peer_id, n->state, state, evt);
1a20cc25 1312 n->state = state;
66996b6c
JPM		 1313 return;
1314
1315illegal_evt:
1316 pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
eb18a510 1317 trace_tipc_node_fsm(n->peer_id, n->state, state, evt);
1a20cc25
JPM		 1318}
1319
52666986 1320static void node_lost_contact(struct tipc_node *n,
598411d7 1321 struct sk_buff_head *inputq)
b97bf3fd 1322{
708ac32c 1323 struct tipc_sock_conn *conn, *safe;
598411d7 1324 struct tipc_link *l;
52666986 1325 struct list_head *conns = &n->conn_sks;
708ac32c 1326 struct sk_buff *skb;
708ac32c 1327 uint i;
b97bf3fd 1328
d50ccc2d 1329 pr_debug("Lost contact with %x\n", n->addr);
6a939f36 1330 n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
eb18a510 1331 trace_tipc_node_lost_contact(n, true, " ");
c5bd4d85 1332
52666986 1333 /* Clean up broadcast state */
b06b281e 1334 tipc_bcast_remove_peer(n->net, n->bc_entry.link);
b97bf3fd 1335
dff29b1a 1336 /* Abort any ongoing link failover */
b97bf3fd 1337 for (i = 0; i < MAX_BEARERS; i++) {
52666986 1338 l = n->links[i].link;
598411d7
JPM		 1339 if (l)
1340 tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT);
b97bf3fd 1341 }
598411d7 1342
708ac32c 1343 /* Notify publications from this node */
52666986 1344 n->action_flags |= TIPC_NOTIFY_NODE_DOWN;
708ac32c
JPM		 1345
1346 /* Notify sockets connected to node */
1347 list_for_each_entry_safe(conn, safe, conns, list) {
1348 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
52666986 1349 SHORT_H_SIZE, 0, tipc_own_addr(n->net),
708ac32c
JPM		 1350 conn->peer_node, conn->port,
1351 conn->peer_port, TIPC_ERR_NO_NODE);
23d8335d 1352 if (likely(skb))
598411d7 1353 skb_queue_tail(inputq, skb);
708ac32c
JPM		 1354 list_del(&conn->list);
1355 kfree(conn);
1356 }
b97bf3fd
PL		 1357}
1358
78acb1f9
EH		 1359/**
1360 * tipc_node_get_linkname - get the name of a link
1361 *
1362 * @bearer_id: id of the bearer
1363 * @node: peer node address
1364 * @linkname: link name output buffer
1365 *
1366 * Returns 0 on success
1367 */
f2f9800d
YX		 1368int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
1369 char *linkname, size_t len)
78acb1f9
EH		 1370{
1371 struct tipc_link *link;
8a0f6ebe 1372 int err = -EINVAL;
f2f9800d 1373 struct tipc_node *node = tipc_node_find(net, addr);
78acb1f9 1374
8a0f6ebe
YX		 1375 if (!node)
1376 return err;
1377
1378 if (bearer_id >= MAX_BEARERS)
1379 goto exit;
1380
5405ff6e 1381 tipc_node_read_lock(node);
9d13ec65 1382 link = node->links[bearer_id].link;
78acb1f9 1383 if (link) {
38206d59 1384 strncpy(linkname, tipc_link_name(link), len);
8a0f6ebe 1385 err = 0;
78acb1f9 1386 }
5405ff6e 1387 tipc_node_read_unlock(node);
991ca84d 1388exit:
8a0f6ebe
YX		 1389 tipc_node_put(node);
1390 return err;
78acb1f9 1391}
9db9fdd1 1392
3e4b6ab5 1393/* Caller should hold node lock for the passed node */
d8182804 1394static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
3e4b6ab5
RA		 1395{
1396 void *hdr;
1397 struct nlattr *attrs;
1398
bfb3e5dd 1399 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
3e4b6ab5
RA		 1400 NLM_F_MULTI, TIPC_NL_NODE_GET);
1401 if (!hdr)
1402 return -EMSGSIZE;
1403
ae0be8de 1404 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_NODE);
3e4b6ab5
RA		 1405 if (!attrs)
1406 goto msg_full;
1407
1408 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
1409 goto attr_msg_full;
38077b8e 1410 if (node_is_up(node))
3e4b6ab5
RA		 1411 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
1412 goto attr_msg_full;
1413
1414 nla_nest_end(msg->skb, attrs);
1415 genlmsg_end(msg->skb, hdr);
1416
1417 return 0;
1418
1419attr_msg_full:
1420 nla_nest_cancel(msg->skb, attrs);
1421msg_full:
1422 genlmsg_cancel(msg->skb, hdr);
1423
1424 return -EMSGSIZE;
1425}
1426
af9b028e
JPM		 1427/**
1428 * tipc_node_xmit() is the general link level function for message sending
1429 * @net: the applicable net namespace
1430 * @list: chain of buffers containing message
1431 * @dnode: address of destination node
1432 * @selector: a number used for deterministic link selection
365ad353 1433 * Consumes the buffer chain.
4952cd3e 1434 * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
af9b028e
JPM		 1435 */
1436int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
1437 u32 dnode, int selector)
1438{
5405ff6e 1439 struct tipc_link_entry *le = NULL;
af9b028e
JPM		 1440 struct tipc_node *n;
1441 struct sk_buff_head xmitq;
4952cd3e
RA		 1442 int bearer_id;
1443 int rc;
1444
1445 if (in_own_node(net, dnode)) {
1446 tipc_sk_rcv(net, list);
1447 return 0;
1448 }
af9b028e 1449
af9b028e 1450 n = tipc_node_find(net, dnode);
4952cd3e
RA		 1451 if (unlikely(!n)) {
1452 skb_queue_purge(list);
1453 return -EHOSTUNREACH;
1454 }
1455
1456 tipc_node_read_lock(n);
1457 bearer_id = n->active_links[selector & 1];
1458 if (unlikely(bearer_id == INVALID_BEARER_ID)) {
5405ff6e 1459 tipc_node_read_unlock(n);
af9b028e 1460 tipc_node_put(n);
4952cd3e
RA		 1461 skb_queue_purge(list);
1462 return -EHOSTUNREACH;
af9b028e 1463 }
5405ff6e 1464
4952cd3e
RA		 1465 __skb_queue_head_init(&xmitq);
1466 le = &n->links[bearer_id];
1467 spin_lock_bh(&le->lock);
1468 rc = tipc_link_xmit(le->link, list, &xmitq);
1469 spin_unlock_bh(&le->lock);
1470 tipc_node_read_unlock(n);
1471
365ad353 1472 if (unlikely(rc == -ENOBUFS))
4952cd3e 1473 tipc_node_link_down(n, bearer_id, false);
365ad353
JPM		 1474 else
1475 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
4952cd3e
RA		 1476
1477 tipc_node_put(n);
1478
dc8d1eb3 1479 return rc;
af9b028e
JPM		 1480}
1481
1482/* tipc_node_xmit_skb(): send single buffer to destination
1483 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1484 * messages, which will not be rejected
1485 * The only exception is datagram messages rerouted after secondary
1486 * lookup, which are rare and safe to dispose of anyway.
af9b028e
JPM		 1487 */
1488int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
1489 u32 selector)
1490{
1491 struct sk_buff_head head;
af9b028e
JPM		 1492
1493 skb_queue_head_init(&head);
1494 __skb_queue_tail(&head, skb);
365ad353 1495 tipc_node_xmit(net, &head, dnode, selector);
af9b028e
JPM		 1496 return 0;
1497}
1498
f70d37b7
JM		 1499/* tipc_node_distr_xmit(): send single buffer msgs to individual destinations
1500 * Note: this is only for SYSTEM_IMPORTANCE messages, which cannot be rejected
1501 */
1502int tipc_node_distr_xmit(struct net *net, struct sk_buff_head *xmitq)
1503{
1504 struct sk_buff *skb;
1505 u32 selector, dnode;
1506
1507 while ((skb = __skb_dequeue(xmitq))) {
1508 selector = msg_origport(buf_msg(skb));
1509 dnode = msg_destnode(buf_msg(skb));
1510 tipc_node_xmit_skb(net, skb, dnode, selector);
1511 }
1512 return 0;
1513}
1514
1d7e1c25
JPM		 1515void tipc_node_broadcast(struct net *net, struct sk_buff *skb)
1516{
1517 struct sk_buff *txskb;
1518 struct tipc_node *n;
1519 u32 dst;
1520
1521 rcu_read_lock();
1522 list_for_each_entry_rcu(n, tipc_nodes(net), list) {
1523 dst = n->addr;
1524 if (in_own_node(net, dst))
1525 continue;
38077b8e 1526 if (!node_is_up(n))
1d7e1c25
JPM		 1527 continue;
1528 txskb = pskb_copy(skb, GFP_ATOMIC);
1529 if (!txskb)
1530 break;
1531 msg_set_destnode(buf_msg(txskb), dst);
1532 tipc_node_xmit_skb(net, txskb, dst, 0);
1533 }
1534 rcu_read_unlock();
1535
1536 kfree_skb(skb);
1537}
1538
a853e4c6
JPM		 1539static void tipc_node_mcast_rcv(struct tipc_node *n)
1540{
1541 struct tipc_bclink_entry *be = &n->bc_entry;
1542
1543 /* 'arrvq' is under inputq2's lock protection */
1544 spin_lock_bh(&be->inputq2.lock);
1545 spin_lock_bh(&be->inputq1.lock);
1546 skb_queue_splice_tail_init(&be->inputq1, &be->arrvq);
1547 spin_unlock_bh(&be->inputq1.lock);
1548 spin_unlock_bh(&be->inputq2.lock);
1549 tipc_sk_mcast_rcv(n->net, &be->arrvq, &be->inputq2);
1550}
1551
02d11ca2
JPM		 1552static void tipc_node_bc_sync_rcv(struct tipc_node *n, struct tipc_msg *hdr,
1553 int bearer_id, struct sk_buff_head *xmitq)
1554{
1555 struct tipc_link *ucl;
1556 int rc;
1557
1558 rc = tipc_bcast_sync_rcv(n->net, n->bc_entry.link, hdr);
1559
1560 if (rc & TIPC_LINK_DOWN_EVT) {
40501f90 1561 tipc_node_reset_links(n);
02d11ca2
JPM		 1562 return;
1563 }
1564
1565 if (!(rc & TIPC_LINK_SND_STATE))
1566 return;
1567
1568 /* If probe message, a STATE response will be sent anyway */
1569 if (msg_probe(hdr))
1570 return;
1571
1572 /* Produce a STATE message carrying broadcast NACK */
1573 tipc_node_read_lock(n);
1574 ucl = n->links[bearer_id].link;
1575 if (ucl)
1576 tipc_link_build_state_msg(ucl, xmitq);
1577 tipc_node_read_unlock(n);
1578}
1579
52666986
JPM		 1580/**
1581 * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1582 * @net: the applicable net namespace
1583 * @skb: TIPC packet
1584 * @bearer_id: id of bearer message arrived on
1585 *
1586 * Invoked with no locks held.
1587 */
742e0383 1588static void tipc_node_bc_rcv(struct net *net, struct sk_buff *skb, int bearer_id)
52666986
JPM		 1589{
1590 int rc;
1591 struct sk_buff_head xmitq;
1592 struct tipc_bclink_entry *be;
1593 struct tipc_link_entry *le;
1594 struct tipc_msg *hdr = buf_msg(skb);
1595 int usr = msg_user(hdr);
1596 u32 dnode = msg_destnode(hdr);
1597 struct tipc_node *n;
1598
1599 __skb_queue_head_init(&xmitq);
1600
1601 /* If NACK for other node, let rcv link for that node peek into it */
1602 if ((usr == BCAST_PROTOCOL) && (dnode != tipc_own_addr(net)))
1603 n = tipc_node_find(net, dnode);
1604 else
1605 n = tipc_node_find(net, msg_prevnode(hdr));
1606 if (!n) {
1607 kfree_skb(skb);
1608 return;
1609 }
1610 be = &n->bc_entry;
1611 le = &n->links[bearer_id];
1612
1613 rc = tipc_bcast_rcv(net, be->link, skb);
1614
52666986 1615 /* Broadcast ACKs are sent on a unicast link */
02d11ca2 1616 if (rc & TIPC_LINK_SND_STATE) {
5405ff6e 1617 tipc_node_read_lock(n);
34b9cd64 1618 tipc_link_build_state_msg(le->link, &xmitq);
5405ff6e 1619 tipc_node_read_unlock(n);
52666986
JPM		 1620 }
1621
1622 if (!skb_queue_empty(&xmitq))
1623 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1624
a853e4c6
JPM		 1625 if (!skb_queue_empty(&be->inputq1))
1626 tipc_node_mcast_rcv(n);
1fc07f3e 1627
5679ee78
ZG		 1628 /* Handle NAME_DISTRIBUTOR messages sent from 1.7 nodes */
1629 if (!skb_queue_empty(&n->bc_entry.namedq))
1630 tipc_named_rcv(net, &n->bc_entry.namedq);
1631
40501f90
JPM		 1632 /* If reassembly or retransmission failure => reset all links to peer */
1633 if (rc & TIPC_LINK_DOWN_EVT)
1634 tipc_node_reset_links(n);
1fc07f3e 1635
52666986
JPM		 1636 tipc_node_put(n);
1637}
1638
6e498158
JPM		 1639/**
1640 * tipc_node_check_state - check and if necessary update node state
1641 * @skb: TIPC packet
1642 * @bearer_id: identity of bearer delivering the packet
7ea817f4 1643 * Returns true if state and msg are ok, otherwise false
6144a996 1644 */
6e498158 1645static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb,
662921cd 1646 int bearer_id, struct sk_buff_head *xmitq)
6144a996 1647{
6144a996 1648 struct tipc_msg *hdr = buf_msg(skb);
6e498158
JPM		 1649 int usr = msg_user(hdr);
1650 int mtyp = msg_type(hdr);
6144a996 1651 u16 oseqno = msg_seqno(hdr);
a7dc51ad 1652 u16 iseqno = msg_seqno(msg_inner_hdr(hdr));
6e498158 1653 u16 exp_pkts = msg_msgcnt(hdr);
38206d59 1654 u16 rcv_nxt, syncpt, dlv_nxt, inputq_len;
6e498158 1655 int state = n->state;
2be80c2d 1656 struct tipc_link *l, *tnl, *pl = NULL;
598411d7 1657 struct tipc_media_addr *maddr;
38206d59 1658 int pb_id;
6144a996 1659
eb18a510
TL		 1660 if (trace_tipc_node_check_state_enabled()) {
1661 trace_tipc_skb_dump(skb, false, "skb for node state check");
1662 trace_tipc_node_check_state(n, true, " ");
1663 }
6e498158
JPM		 1664 l = n->links[bearer_id].link;
1665 if (!l)
1666 return false;
38206d59 1667 rcv_nxt = tipc_link_rcv_nxt(l);
6144a996 1668
6144a996 1669
6e498158
JPM		 1670 if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL)))
1671 return true;
6144a996 1672
6e498158 1673 /* Find parallel link, if any */
38206d59
JPM		 1674 for (pb_id = 0; pb_id < MAX_BEARERS; pb_id++) {
1675 if ((pb_id != bearer_id) && n->links[pb_id].link) {
1676 pl = n->links[pb_id].link;
6e498158
JPM		 1677 break;
1678 }
1679 }
6144a996 1680
26574db0
TL		 1681 if (!tipc_link_validate_msg(l, hdr)) {
1682 trace_tipc_skb_dump(skb, false, "PROTO invalid (2)!");
1683 trace_tipc_link_dump(l, TIPC_DUMP_NONE, "PROTO invalid (2)!");
7ea817f4 1684 return false;
26574db0 1685 }
7ea817f4 1686
5405ff6e 1687 /* Check and update node accesibility if applicable */
6e498158
JPM		 1688 if (state == SELF_UP_PEER_COMING) {
1689 if (!tipc_link_is_up(l))
1690 return true;
1691 if (!msg_peer_link_is_up(hdr))
1692 return true;
1693 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
1694 }
1695
1696 if (state == SELF_DOWN_PEER_LEAVING) {
1697 if (msg_peer_node_is_up(hdr))
1698 return false;
1699 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
5c10e979 1700 return true;
6e498158
JPM		 1701 }
1702
5405ff6e
JPM		 1703 if (state == SELF_LEAVING_PEER_DOWN)
1704 return false;
1705
6e498158 1706 /* Ignore duplicate packets */
0f8b8e28 1707 if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt))
6e498158
JPM		 1708 return true;
1709
1710 /* Initiate or update failover mode if applicable */
1711 if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) {
1712 syncpt = oseqno + exp_pkts - 1;
d0f84d08 1713 if (pl && !tipc_link_is_reset(pl)) {
598411d7 1714 __tipc_node_link_down(n, &pb_id, xmitq, &maddr);
eb18a510
TL		 1715 trace_tipc_node_link_down(n, true,
1716 "node link down <- failover!");
38206d59
JPM		 1717 tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl),
1718 tipc_link_inputq(l));
598411d7 1719 }
c0b14a08 1720
c140eb16 1721 /* If parallel link was already down, and this happened before
c0b14a08
TL		 1722 * the tunnel link came up, node failover was never started.
1723 * Ensure that a FAILOVER_MSG is sent to get peer out of
1724 * NODE_FAILINGOVER state, also this node must accept
1725 * TUNNEL_MSGs from peer.
c140eb16 1726 */
c0b14a08
TL		 1727 if (n->state != NODE_FAILINGOVER)
1728 tipc_node_link_failover(n, pl, l, xmitq);
1729
6e498158
JPM		 1730 /* If pkts arrive out of order, use lowest calculated syncpt */
1731 if (less(syncpt, n->sync_point))
1732 n->sync_point = syncpt;
1733 }
1734
1735 /* Open parallel link when tunnel link reaches synch point */
17b20630 1736 if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) {
662921cd
JPM		 1737 if (!more(rcv_nxt, n->sync_point))
1738 return true;
6e498158
JPM		 1739 tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT);
1740 if (pl)
662921cd 1741 tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT);
6e498158
JPM		 1742 return true;
1743 }
1744
5ae2f8e6
JPM		 1745 /* No synching needed if only one link */
1746 if (!pl || !tipc_link_is_up(pl))
1747 return true;
1748
0f8b8e28
JPM		 1749 /* Initiate synch mode if applicable */
1750 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG) && (oseqno == 1)) {
6e498158 1751 syncpt = iseqno + exp_pkts - 1;
ed43594a 1752 if (!tipc_link_is_up(l))
598411d7 1753 __tipc_node_link_up(n, bearer_id, xmitq);
6e498158
JPM		 1754 if (n->state == SELF_UP_PEER_UP) {
1755 n->sync_point = syncpt;
662921cd 1756 tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT);
6e498158
JPM		 1757 tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT);
1758 }
6144a996 1759 }
6e498158
JPM		 1760
1761 /* Open tunnel link when parallel link reaches synch point */
5c10e979 1762 if (n->state == NODE_SYNCHING) {
2be80c2d
JPM		 1763 if (tipc_link_is_synching(l)) {
1764 tnl = l;
1765 } else {
1766 tnl = pl;
1767 pl = l;
1768 }
38206d59
JPM		 1769 inputq_len = skb_queue_len(tipc_link_inputq(pl));
1770 dlv_nxt = tipc_link_rcv_nxt(pl) - inputq_len;
5ae2f8e6 1771 if (more(dlv_nxt, n->sync_point)) {
2be80c2d 1772 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
6e498158 1773 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
6e498158
JPM		 1774 return true;
1775 }
2be80c2d
JPM		 1776 if (l == pl)
1777 return true;
6e498158
JPM		 1778 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG))
1779 return true;
1780 if (usr == LINK_PROTOCOL)
1781 return true;
1782 return false;
1783 }
1784 return true;
6144a996
JPM		 1785}
1786
d999297c
JPM		 1787/**
1788 * tipc_rcv - process TIPC packets/messages arriving from off-node
1789 * @net: the applicable net namespace
1790 * @skb: TIPC packet
1791 * @bearer: pointer to bearer message arrived on
1792 *
1793 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1794 * structure (i.e. cannot be NULL), but bearer can be inactive.
1795 */
1796void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
1797{
1798 struct sk_buff_head xmitq;
1799 struct tipc_node *n;
681a55d7 1800 struct tipc_msg *hdr;
d999297c 1801 int bearer_id = b->identity;
6e498158 1802 struct tipc_link_entry *le;
efe79050 1803 u32 self = tipc_own_addr(net);
681a55d7
JPM		 1804 int usr, rc = 0;
1805 u16 bc_ack;
d999297c
JPM		 1806
1807 __skb_queue_head_init(&xmitq);
1808
681a55d7 1809 /* Ensure message is well-formed before touching the header */
866e5fd8 1810 TIPC_SKB_CB(skb)->validated = false;
d618d09a 1811 if (unlikely(!tipc_msg_validate(&skb)))
d999297c 1812 goto discard;
681a55d7
JPM		 1813 hdr = buf_msg(skb);
1814 usr = msg_user(hdr);
1815 bc_ack = msg_bcast_ack(hdr);
d999297c 1816
52666986 1817 /* Handle arrival of discovery or broadcast packet */
d999297c 1818 if (unlikely(msg_non_seq(hdr))) {
52666986
JPM		 1819 if (unlikely(usr == LINK_CONFIG))
1820 return tipc_disc_rcv(net, skb, b);
d999297c 1821 else
52666986 1822 return tipc_node_bc_rcv(net, skb, bearer_id);
d999297c
JPM		 1823 }
1824
efe79050
HM		 1825 /* Discard unicast link messages destined for another node */
1826 if (unlikely(!msg_short(hdr) && (msg_destnode(hdr) != self)))
1827 goto discard;
1828
d999297c
JPM		 1829 /* Locate neighboring node that sent packet */
1830 n = tipc_node_find(net, msg_prevnode(hdr));
1831 if (unlikely(!n))
1832 goto discard;
6e498158 1833 le = &n->links[bearer_id];
d999297c 1834
52666986
JPM		 1835 /* Ensure broadcast reception is in synch with peer's send state */
1836 if (unlikely(usr == LINK_PROTOCOL))
02d11ca2 1837 tipc_node_bc_sync_rcv(n, hdr, bearer_id, &xmitq);
38206d59 1838 else if (unlikely(tipc_link_acked(n->bc_entry.link) != bc_ack))
06bd2b1e 1839 tipc_bcast_ack_rcv(net, n->bc_entry.link, hdr);
52666986 1840
5405ff6e
JPM		 1841 /* Receive packet directly if conditions permit */
1842 tipc_node_read_lock(n);
1843 if (likely((n->state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) {
2312bf61 1844 spin_lock_bh(&le->lock);
5405ff6e
JPM		 1845 if (le->link) {
1846 rc = tipc_link_rcv(le->link, skb, &xmitq);
1847 skb = NULL;
1848 }
2312bf61 1849 spin_unlock_bh(&le->lock);
6e498158 1850 }
5405ff6e
JPM		 1851 tipc_node_read_unlock(n);
1852
1853 /* Check/update node state before receiving */
1854 if (unlikely(skb)) {
27163138
PB		 1855 if (unlikely(skb_linearize(skb)))
1856 goto discard;
5405ff6e
JPM		 1857 tipc_node_write_lock(n);
1858 if (tipc_node_check_state(n, skb, bearer_id, &xmitq)) {
1859 if (le->link) {
1860 rc = tipc_link_rcv(le->link, skb, &xmitq);
1861 skb = NULL;
1862 }
1863 }
1864 tipc_node_write_unlock(n);
1865 }
d999297c
JPM		 1866
1867 if (unlikely(rc & TIPC_LINK_UP_EVT))
6e498158
JPM		 1868 tipc_node_link_up(n, bearer_id, &xmitq);
1869
d999297c 1870 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
598411d7 1871 tipc_node_link_down(n, bearer_id, false);
6e498158 1872
52666986
JPM		 1873 if (unlikely(!skb_queue_empty(&n->bc_entry.namedq)))
1874 tipc_named_rcv(net, &n->bc_entry.namedq);
23d8335d 1875
a853e4c6
JPM		 1876 if (unlikely(!skb_queue_empty(&n->bc_entry.inputq1)))
1877 tipc_node_mcast_rcv(n);
1878
6e498158
JPM		 1879 if (!skb_queue_empty(&le->inputq))
1880 tipc_sk_rcv(net, &le->inputq);
1881
1882 if (!skb_queue_empty(&xmitq))
1883 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1884
d999297c
JPM		 1885 tipc_node_put(n);
1886discard:
1887 kfree_skb(skb);
1888}
1889
682cd3cf
GM		 1890void tipc_node_apply_property(struct net *net, struct tipc_bearer *b,
1891 int prop)
37c64cf6
JM		 1892{
1893 struct tipc_net *tn = tipc_net(net);
1894 int bearer_id = b->identity;
1895 struct sk_buff_head xmitq;
1896 struct tipc_link_entry *e;
1897 struct tipc_node *n;
1898
1899 __skb_queue_head_init(&xmitq);
1900
1901 rcu_read_lock();
1902
1903 list_for_each_entry_rcu(n, &tn->node_list, list) {
1904 tipc_node_write_lock(n);
1905 e = &n->links[bearer_id];
682cd3cf
GM		 1906 if (e->link) {
1907 if (prop == TIPC_NLA_PROP_TOL)
1908 tipc_link_set_tolerance(e->link, b->tolerance,
1909 &xmitq);
1910 else if (prop == TIPC_NLA_PROP_MTU)
1911 tipc_link_set_mtu(e->link, b->mtu);
1912 }
37c64cf6
JM		 1913 tipc_node_write_unlock(n);
1914 tipc_bearer_xmit(net, bearer_id, &xmitq, &e->maddr);
1915 }
1916
1917 rcu_read_unlock();
1918}
1919
b3404022
RA		 1920int tipc_nl_peer_rm(struct sk_buff *skb, struct genl_info *info)
1921{
1922 struct net *net = sock_net(skb->sk);
1923 struct tipc_net *tn = net_generic(net, tipc_net_id);
1924 struct nlattr *attrs[TIPC_NLA_NET_MAX + 1];
1925 struct tipc_node *peer;
1926 u32 addr;
1927 int err;
b3404022
RA		 1928
1929 /* We identify the peer by its net */
1930 if (!info->attrs[TIPC_NLA_NET])
1931 return -EINVAL;
1932
8cb08174
JB		 1933 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_NET_MAX,
1934 info->attrs[TIPC_NLA_NET],
1935 tipc_nl_net_policy, info->extack);
b3404022
RA		 1936 if (err)
1937 return err;
1938
1939 if (!attrs[TIPC_NLA_NET_ADDR])
1940 return -EINVAL;
1941
1942 addr = nla_get_u32(attrs[TIPC_NLA_NET_ADDR]);
1943
1944 if (in_own_node(net, addr))
1945 return -ENOTSUPP;
1946
1947 spin_lock_bh(&tn->node_list_lock);
1948 peer = tipc_node_find(net, addr);
1949 if (!peer) {
1950 spin_unlock_bh(&tn->node_list_lock);
1951 return -ENXIO;
1952 }
1953
1954 tipc_node_write_lock(peer);
1955 if (peer->state != SELF_DOWN_PEER_DOWN &&
1956 peer->state != SELF_DOWN_PEER_LEAVING) {
1957 tipc_node_write_unlock(peer);
1958 err = -EBUSY;
1959 goto err_out;
1960 }
1961
6a939f36 1962 tipc_node_clear_links(peer);
b3404022
RA		 1963 tipc_node_write_unlock(peer);
1964 tipc_node_delete(peer);
1965
1966 err = 0;
1967err_out:
1968 tipc_node_put(peer);
1969 spin_unlock_bh(&tn->node_list_lock);
1970
1971 return err;
1972}
1973
3e4b6ab5
RA		 1974int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
1975{
1976 int err;
f2f9800d
YX		 1977 struct net *net = sock_net(skb->sk);
1978 struct tipc_net *tn = net_generic(net, tipc_net_id);
3e4b6ab5
RA		 1979 int done = cb->args[0];
1980 int last_addr = cb->args[1];
1981 struct tipc_node *node;
1982 struct tipc_nl_msg msg;
1983
1984 if (done)
1985 return 0;
1986
1987 msg.skb = skb;
1988 msg.portid = NETLINK_CB(cb->skb).portid;
1989 msg.seq = cb->nlh->nlmsg_seq;
1990
1991 rcu_read_lock();
8a0f6ebe
YX		 1992 if (last_addr) {
1993 node = tipc_node_find(net, last_addr);
1994 if (!node) {
1995 rcu_read_unlock();
1996 /* We never set seq or call nl_dump_check_consistent()
1997 * this means that setting prev_seq here will cause the
1998 * consistence check to fail in the netlink callback
1999 * handler. Resulting in the NLMSG_DONE message having
2000 * the NLM_F_DUMP_INTR flag set if the node state
2001 * changed while we released the lock.
2002 */
2003 cb->prev_seq = 1;
2004 return -EPIPE;
2005 }
2006 tipc_node_put(node);
3e4b6ab5
RA		 2007 }
2008
f2f9800d 2009 list_for_each_entry_rcu(node, &tn->node_list, list) {
3e4b6ab5
RA		 2010 if (last_addr) {
2011 if (node->addr == last_addr)
2012 last_addr = 0;
2013 else
2014 continue;
2015 }
2016
5405ff6e 2017 tipc_node_read_lock(node);
3e4b6ab5
RA		 2018 err = __tipc_nl_add_node(&msg, node);
2019 if (err) {
2020 last_addr = node->addr;
5405ff6e 2021 tipc_node_read_unlock(node);
3e4b6ab5
RA		 2022 goto out;
2023 }
2024
5405ff6e 2025 tipc_node_read_unlock(node);
3e4b6ab5
RA		 2026 }
2027 done = 1;
2028out:
2029 cb->args[0] = done;
2030 cb->args[1] = last_addr;
2031 rcu_read_unlock();
2032
2033 return skb->len;
2034}
5be9c086 2035
38206d59 2036/* tipc_node_find_by_name - locate owner node of link by link's name
5be9c086
JPM		 2037 * @net: the applicable net namespace
2038 * @name: pointer to link name string
2039 * @bearer_id: pointer to index in 'node->links' array where the link was found.
2040 *
2041 * Returns pointer to node owning the link, or 0 if no matching link is found.
2042 */
38206d59
JPM		 2043static struct tipc_node *tipc_node_find_by_name(struct net *net,
2044 const char *link_name,
2045 unsigned int *bearer_id)
5be9c086
JPM		 2046{
2047 struct tipc_net *tn = net_generic(net, tipc_net_id);
38206d59
JPM		 2048 struct tipc_link *l;
2049 struct tipc_node *n;
5be9c086
JPM		 2050 struct tipc_node *found_node = NULL;
2051 int i;
2052
2053 *bearer_id = 0;
2054 rcu_read_lock();
38206d59
JPM		 2055 list_for_each_entry_rcu(n, &tn->node_list, list) {
2056 tipc_node_read_lock(n);
5be9c086 2057 for (i = 0; i < MAX_BEARERS; i++) {
38206d59
JPM		 2058 l = n->links[i].link;
2059 if (l && !strcmp(tipc_link_name(l), link_name)) {
5be9c086 2060 *bearer_id = i;
38206d59 2061 found_node = n;
5be9c086
JPM		 2062 break;
2063 }
2064 }
38206d59 2065 tipc_node_read_unlock(n);
5be9c086
JPM		 2066 if (found_node)
2067 break;
2068 }
2069 rcu_read_unlock();
2070
2071 return found_node;
2072}
2073
2074int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info)
2075{
2076 int err;
2077 int res = 0;
2078 int bearer_id;
2079 char *name;
2080 struct tipc_link *link;
2081 struct tipc_node *node;
d01332f1 2082 struct sk_buff_head xmitq;
5be9c086
JPM		 2083 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2084 struct net *net = sock_net(skb->sk);
2085
d01332f1
RA		 2086 __skb_queue_head_init(&xmitq);
2087
5be9c086
JPM		 2088 if (!info->attrs[TIPC_NLA_LINK])
2089 return -EINVAL;
2090
8cb08174
JB		 2091 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_LINK_MAX,
2092 info->attrs[TIPC_NLA_LINK],
2093 tipc_nl_link_policy, info->extack);
5be9c086
JPM		 2094 if (err)
2095 return err;
2096
2097 if (!attrs[TIPC_NLA_LINK_NAME])
2098 return -EINVAL;
2099
2100 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2101
2102 if (strcmp(name, tipc_bclink_name) == 0)
2103 return tipc_nl_bc_link_set(net, attrs);
2104
38206d59 2105 node = tipc_node_find_by_name(net, name, &bearer_id);
5be9c086
JPM		 2106 if (!node)
2107 return -EINVAL;
2108
2109 tipc_node_read_lock(node);
2110
2111 link = node->links[bearer_id].link;
2112 if (!link) {
2113 res = -EINVAL;
2114 goto out;
2115 }
2116
2117 if (attrs[TIPC_NLA_LINK_PROP]) {
2118 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
2119
2120 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
2121 props);
2122 if (err) {
2123 res = err;
2124 goto out;
2125 }
2126
2127 if (props[TIPC_NLA_PROP_TOL]) {
2128 u32 tol;
2129
2130 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
d01332f1 2131 tipc_link_set_tolerance(link, tol, &xmitq);
5be9c086
JPM		 2132 }
2133 if (props[TIPC_NLA_PROP_PRIO]) {
2134 u32 prio;
2135
2136 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
d01332f1 2137 tipc_link_set_prio(link, prio, &xmitq);
5be9c086
JPM		 2138 }
2139 if (props[TIPC_NLA_PROP_WIN]) {
2140 u32 win;
2141
2142 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
2143 tipc_link_set_queue_limits(link, win);
2144 }
2145 }
2146
2147out:
2148 tipc_node_read_unlock(node);
d01332f1 2149 tipc_bearer_xmit(net, bearer_id, &xmitq, &node->links[bearer_id].maddr);
5be9c086
JPM		 2150 return res;
2151}
2152
2153int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info)
2154{
2155 struct net *net = genl_info_net(info);
94f6a80c 2156 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
5be9c086
JPM		 2157 struct tipc_nl_msg msg;
2158 char *name;
2159 int err;
2160
2161 msg.portid = info->snd_portid;
2162 msg.seq = info->snd_seq;
2163
94f6a80c 2164 if (!info->attrs[TIPC_NLA_LINK])
5be9c086 2165 return -EINVAL;
94f6a80c 2166
8cb08174
JB		 2167 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_LINK_MAX,
2168 info->attrs[TIPC_NLA_LINK],
2169 tipc_nl_link_policy, info->extack);
94f6a80c
YX		 2170 if (err)
2171 return err;
2172
2173 if (!attrs[TIPC_NLA_LINK_NAME])
2174 return -EINVAL;
2175
2176 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
5be9c086
JPM		 2177
2178 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2179 if (!msg.skb)
2180 return -ENOMEM;
2181
2182 if (strcmp(name, tipc_bclink_name) == 0) {
2183 err = tipc_nl_add_bc_link(net, &msg);
59b36613
CW		 2184 if (err)
2185 goto err_free;
5be9c086
JPM		 2186 } else {
2187 int bearer_id;
2188 struct tipc_node *node;
2189 struct tipc_link *link;
2190
38206d59 2191 node = tipc_node_find_by_name(net, name, &bearer_id);
59b36613
CW		 2192 if (!node) {
2193 err = -EINVAL;
2194 goto err_free;
2195 }
5be9c086
JPM		 2196
2197 tipc_node_read_lock(node);
2198 link = node->links[bearer_id].link;
2199 if (!link) {
2200 tipc_node_read_unlock(node);
59b36613
CW		 2201 err = -EINVAL;
2202 goto err_free;
5be9c086
JPM		 2203 }
2204
2205 err = __tipc_nl_add_link(net, &msg, link, 0);
2206 tipc_node_read_unlock(node);
59b36613
CW		 2207 if (err)
2208 goto err_free;
5be9c086
JPM		 2209 }
2210
2211 return genlmsg_reply(msg.skb, info);
59b36613
CW		 2212
2213err_free:
2214 nlmsg_free(msg.skb);
2215 return err;
5be9c086
JPM		 2216}
2217
2218int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info)
2219{
2220 int err;
2221 char *link_name;
2222 unsigned int bearer_id;
2223 struct tipc_link *link;
2224 struct tipc_node *node;
2225 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2226 struct net *net = sock_net(skb->sk);
2227 struct tipc_link_entry *le;
2228
2229 if (!info->attrs[TIPC_NLA_LINK])
2230 return -EINVAL;
2231
8cb08174
JB		 2232 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_LINK_MAX,
2233 info->attrs[TIPC_NLA_LINK],
2234 tipc_nl_link_policy, info->extack);
5be9c086
JPM		 2235 if (err)
2236 return err;
2237
2238 if (!attrs[TIPC_NLA_LINK_NAME])
2239 return -EINVAL;
2240
2241 link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2242
2243 if (strcmp(link_name, tipc_bclink_name) == 0) {
2244 err = tipc_bclink_reset_stats(net);
2245 if (err)
2246 return err;
2247 return 0;
2248 }
2249
38206d59 2250 node = tipc_node_find_by_name(net, link_name, &bearer_id);
5be9c086
JPM		 2251 if (!node)
2252 return -EINVAL;
2253
2254 le = &node->links[bearer_id];
2255 tipc_node_read_lock(node);
2256 spin_lock_bh(&le->lock);
2257 link = node->links[bearer_id].link;
2258 if (!link) {
2259 spin_unlock_bh(&le->lock);
2260 tipc_node_read_unlock(node);
2261 return -EINVAL;
2262 }
38206d59 2263 tipc_link_reset_stats(link);
5be9c086
JPM		 2264 spin_unlock_bh(&le->lock);
2265 tipc_node_read_unlock(node);
2266 return 0;
2267}
2268
2269/* Caller should hold node lock */
2270static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
2271 struct tipc_node *node, u32 *prev_link)
2272{
2273 u32 i;
2274 int err;
2275
2276 for (i = *prev_link; i < MAX_BEARERS; i++) {
2277 *prev_link = i;
2278
2279 if (!node->links[i].link)
2280 continue;
2281
2282 err = __tipc_nl_add_link(net, msg,
2283 node->links[i].link, NLM_F_MULTI);
2284 if (err)
2285 return err;
2286 }
2287 *prev_link = 0;
2288
2289 return 0;
2290}
2291
38206d59 2292int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb)
5be9c086
JPM		 2293{
2294 struct net *net = sock_net(skb->sk);
2295 struct tipc_net *tn = net_generic(net, tipc_net_id);
2296 struct tipc_node *node;
2297 struct tipc_nl_msg msg;
2298 u32 prev_node = cb->args[0];
2299 u32 prev_link = cb->args[1];
2300 int done = cb->args[2];
2301 int err;
2302
2303 if (done)
2304 return 0;
2305
2306 msg.skb = skb;
2307 msg.portid = NETLINK_CB(cb->skb).portid;
2308 msg.seq = cb->nlh->nlmsg_seq;
2309
2310 rcu_read_lock();
2311 if (prev_node) {
2312 node = tipc_node_find(net, prev_node);
2313 if (!node) {
2314 /* We never set seq or call nl_dump_check_consistent()
2315 * this means that setting prev_seq here will cause the
2316 * consistence check to fail in the netlink callback
2317 * handler. Resulting in the last NLMSG_DONE message
2318 * having the NLM_F_DUMP_INTR flag set.
2319 */
2320 cb->prev_seq = 1;
2321 goto out;
2322 }
2323 tipc_node_put(node);
2324
2325 list_for_each_entry_continue_rcu(node, &tn->node_list,
2326 list) {
2327 tipc_node_read_lock(node);
2328 err = __tipc_nl_add_node_links(net, &msg, node,
2329 &prev_link);
2330 tipc_node_read_unlock(node);
2331 if (err)
2332 goto out;
2333
2334 prev_node = node->addr;
2335 }
2336 } else {
2337 err = tipc_nl_add_bc_link(net, &msg);
2338 if (err)
2339 goto out;
2340
2341 list_for_each_entry_rcu(node, &tn->node_list, list) {
2342 tipc_node_read_lock(node);
2343 err = __tipc_nl_add_node_links(net, &msg, node,
2344 &prev_link);
2345 tipc_node_read_unlock(node);
2346 if (err)
2347 goto out;
2348
2349 prev_node = node->addr;
2350 }
2351 }
2352 done = 1;
2353out:
2354 rcu_read_unlock();
2355
2356 cb->args[0] = prev_node;
2357 cb->args[1] = prev_link;
2358 cb->args[2] = done;
2359
2360 return skb->len;
2361}
7b3f5229
PB		 2362
2363int tipc_nl_node_set_monitor(struct sk_buff *skb, struct genl_info *info)
2364{
2365 struct nlattr *attrs[TIPC_NLA_MON_MAX + 1];
2366 struct net *net = sock_net(skb->sk);
2367 int err;
2368
2369 if (!info->attrs[TIPC_NLA_MON])
2370 return -EINVAL;
2371
8cb08174
JB		 2372 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_MON_MAX,
2373 info->attrs[TIPC_NLA_MON],
2374 tipc_nl_monitor_policy,
2375 info->extack);
7b3f5229
PB		 2376 if (err)
2377 return err;
2378
2379 if (attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]) {
2380 u32 val;
2381
2382 val = nla_get_u32(attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]);
2383 err = tipc_nl_monitor_set_threshold(net, val);
2384 if (err)
2385 return err;
2386 }
2387
2388 return 0;
2389}
bf1035b2
PB		 2390
2391static int __tipc_nl_add_monitor_prop(struct net *net, struct tipc_nl_msg *msg)
2392{
2393 struct nlattr *attrs;
2394 void *hdr;
2395 u32 val;
2396
2397 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
2398 0, TIPC_NL_MON_GET);
2399 if (!hdr)
2400 return -EMSGSIZE;
2401
ae0be8de 2402 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_MON);
bf1035b2
PB		 2403 if (!attrs)
2404 goto msg_full;
2405
2406 val = tipc_nl_monitor_get_threshold(net);
2407
2408 if (nla_put_u32(msg->skb, TIPC_NLA_MON_ACTIVATION_THRESHOLD, val))
2409 goto attr_msg_full;
2410
2411 nla_nest_end(msg->skb, attrs);
2412 genlmsg_end(msg->skb, hdr);
2413
2414 return 0;
2415
2416attr_msg_full:
2417 nla_nest_cancel(msg->skb, attrs);
2418msg_full:
2419 genlmsg_cancel(msg->skb, hdr);
2420
2421 return -EMSGSIZE;
2422}
2423
2424int tipc_nl_node_get_monitor(struct sk_buff *skb, struct genl_info *info)
2425{
2426 struct net *net = sock_net(skb->sk);
2427 struct tipc_nl_msg msg;
2428 int err;
2429
2430 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
78302fd4
PB		 2431 if (!msg.skb)
2432 return -ENOMEM;
bf1035b2
PB		 2433 msg.portid = info->snd_portid;
2434 msg.seq = info->snd_seq;
2435
2436 err = __tipc_nl_add_monitor_prop(net, &msg);
2437 if (err) {
2438 nlmsg_free(msg.skb);
2439 return err;
2440 }
2441
2442 return genlmsg_reply(msg.skb, info);
2443}
cf6f7e1d
PB		 2444
2445int tipc_nl_node_dump_monitor(struct sk_buff *skb, struct netlink_callback *cb)
2446{
2447 struct net *net = sock_net(skb->sk);
2448 u32 prev_bearer = cb->args[0];
2449 struct tipc_nl_msg msg;
36a50a98 2450 int bearer_id;
cf6f7e1d 2451 int err;
cf6f7e1d
PB		 2452
2453 if (prev_bearer == MAX_BEARERS)
2454 return 0;
2455
2456 msg.skb = skb;
2457 msg.portid = NETLINK_CB(cb->skb).portid;
2458 msg.seq = cb->nlh->nlmsg_seq;
2459
2460 rtnl_lock();
36a50a98 2461 for (bearer_id = prev_bearer; bearer_id < MAX_BEARERS; bearer_id++) {
7dbc73e6 2462 err = __tipc_nl_add_monitor(net, &msg, bearer_id);
cf6f7e1d 2463 if (err)
36a50a98 2464 break;
cf6f7e1d 2465 }
cf6f7e1d 2466 rtnl_unlock();
36a50a98 2467 cb->args[0] = bearer_id;
cf6f7e1d
PB		 2468
2469 return skb->len;
2470}
2471
2472int tipc_nl_node_dump_monitor_peer(struct sk_buff *skb,
2473 struct netlink_callback *cb)
2474{
2475 struct net *net = sock_net(skb->sk);
2476 u32 prev_node = cb->args[1];
2477 u32 bearer_id = cb->args[2];
2478 int done = cb->args[0];
2479 struct tipc_nl_msg msg;
2480 int err;
2481
2482 if (!prev_node) {
2483 struct nlattr **attrs;
2484 struct nlattr *mon[TIPC_NLA_MON_MAX + 1];
2485
2486 err = tipc_nlmsg_parse(cb->nlh, &attrs);
2487 if (err)
2488 return err;
2489
2490 if (!attrs[TIPC_NLA_MON])
2491 return -EINVAL;
2492
8cb08174
JB		 2493 err = nla_parse_nested_deprecated(mon, TIPC_NLA_MON_MAX,
2494 attrs[TIPC_NLA_MON],
2495 tipc_nl_monitor_policy,
2496 NULL);
cf6f7e1d
PB		 2497 if (err)
2498 return err;
2499
2500 if (!mon[TIPC_NLA_MON_REF])
2501 return -EINVAL;
2502
2503 bearer_id = nla_get_u32(mon[TIPC_NLA_MON_REF]);
2504
2505 if (bearer_id >= MAX_BEARERS)
2506 return -EINVAL;
2507 }
2508
2509 if (done)
2510 return 0;
2511
2512 msg.skb = skb;
2513 msg.portid = NETLINK_CB(cb->skb).portid;
2514 msg.seq = cb->nlh->nlmsg_seq;
2515
2516 rtnl_lock();
2517 err = tipc_nl_add_monitor_peer(net, &msg, bearer_id, &prev_node);
2518 if (!err)
2519 done = 1;
2520
2521 rtnl_unlock();
2522 cb->args[0] = done;
2523 cb->args[1] = prev_node;
2524 cb->args[2] = bearer_id;
2525
2526 return skb->len;
2527}
b4b9771b
TL		 2528
2529u32 tipc_node_get_addr(struct tipc_node *node)
2530{
2531 return (node) ? node->addr : 0;
2532}
2533
2534/**
2535 * tipc_node_dump - dump TIPC node data
2536 * @n: tipc node to be dumped
2537 * @more: dump more?
2538 * - false: dump only tipc node data
2539 * - true: dump node link data as well
2540 * @buf: returned buffer of dump data in format
2541 */
2542int tipc_node_dump(struct tipc_node *n, bool more, char *buf)
2543{
2544 int i = 0;
2545 size_t sz = (more) ? NODE_LMAX : NODE_LMIN;
2546
2547 if (!n) {
2548 i += scnprintf(buf, sz, "node data: (null)\n");
2549 return i;
2550 }
2551
2552 i += scnprintf(buf, sz, "node data: %x", n->addr);
2553 i += scnprintf(buf + i, sz - i, " %x", n->state);
2554 i += scnprintf(buf + i, sz - i, " %d", n->active_links[0]);
2555 i += scnprintf(buf + i, sz - i, " %d", n->active_links[1]);
2556 i += scnprintf(buf + i, sz - i, " %x", n->action_flags);
2557 i += scnprintf(buf + i, sz - i, " %u", n->failover_sent);
2558 i += scnprintf(buf + i, sz - i, " %u", n->sync_point);
2559 i += scnprintf(buf + i, sz - i, " %d", n->link_cnt);
2560 i += scnprintf(buf + i, sz - i, " %u", n->working_links);
2561 i += scnprintf(buf + i, sz - i, " %x", n->capabilities);
2562 i += scnprintf(buf + i, sz - i, " %lu\n", n->keepalive_intv);
2563
2564 if (!more)
2565 return i;
2566
2567 i += scnprintf(buf + i, sz - i, "link_entry[0]:\n");
2568 i += scnprintf(buf + i, sz - i, " mtu: %u\n", n->links[0].mtu);
2569 i += scnprintf(buf + i, sz - i, " media: ");
2570 i += tipc_media_addr_printf(buf + i, sz - i, &n->links[0].maddr);
2571 i += scnprintf(buf + i, sz - i, "\n");
2572 i += tipc_link_dump(n->links[0].link, TIPC_DUMP_NONE, buf + i);
2573 i += scnprintf(buf + i, sz - i, " inputq: ");
2574 i += tipc_list_dump(&n->links[0].inputq, false, buf + i);
2575
2576 i += scnprintf(buf + i, sz - i, "link_entry[1]:\n");
2577 i += scnprintf(buf + i, sz - i, " mtu: %u\n", n->links[1].mtu);
2578 i += scnprintf(buf + i, sz - i, " media: ");
2579 i += tipc_media_addr_printf(buf + i, sz - i, &n->links[1].maddr);
2580 i += scnprintf(buf + i, sz - i, "\n");
2581 i += tipc_link_dump(n->links[1].link, TIPC_DUMP_NONE, buf + i);
2582 i += scnprintf(buf + i, sz - i, " inputq: ");
2583 i += tipc_list_dump(&n->links[1].inputq, false, buf + i);
2584
2585 i += scnprintf(buf + i, sz - i, "bclink:\n ");
2586 i += tipc_link_dump(n->bc_entry.link, TIPC_DUMP_NONE, buf + i);
2587
2588 return i;
2589}
Ubuntu Hirsute Linux kernel mirror