]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blame - net/tipc/node.c
tipc: introduce constants for tipc address validation
[mirror_ubuntu-bionic-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"
c8199300 46
5be9c086
JPM
47#define INVALID_NODE_SIG 0x10000
48
5be9c086
JPM
49/* Flags used to take different actions according to flag type
50 * TIPC_NOTIFY_NODE_DOWN: notify node is down
51 * TIPC_NOTIFY_NODE_UP: notify node is up
52 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
53 */
54enum {
55 TIPC_NOTIFY_NODE_DOWN = (1 << 3),
56 TIPC_NOTIFY_NODE_UP = (1 << 4),
57 TIPC_NOTIFY_LINK_UP = (1 << 6),
58 TIPC_NOTIFY_LINK_DOWN = (1 << 7)
59};
60
61struct tipc_link_entry {
62 struct tipc_link *link;
63 spinlock_t lock; /* per link */
64 u32 mtu;
65 struct sk_buff_head inputq;
66 struct tipc_media_addr maddr;
67};
68
69struct tipc_bclink_entry {
70 struct tipc_link *link;
71 struct sk_buff_head inputq1;
72 struct sk_buff_head arrvq;
73 struct sk_buff_head inputq2;
74 struct sk_buff_head namedq;
75};
76
77/**
78 * struct tipc_node - TIPC node structure
79 * @addr: network address of node
80 * @ref: reference counter to node object
81 * @lock: rwlock governing access to structure
82 * @net: the applicable net namespace
83 * @hash: links to adjacent nodes in unsorted hash chain
84 * @inputq: pointer to input queue containing messages for msg event
85 * @namedq: pointer to name table input queue with name table messages
86 * @active_links: bearer ids of active links, used as index into links[] array
87 * @links: array containing references to all links to node
88 * @action_flags: bit mask of different types of node actions
89 * @state: connectivity state vs peer node
90 * @sync_point: sequence number where synch/failover is finished
91 * @list: links to adjacent nodes in sorted list of cluster's nodes
92 * @working_links: number of working links to node (both active and standby)
93 * @link_cnt: number of links to node
94 * @capabilities: bitmap, indicating peer node's functional capabilities
95 * @signature: node instance identifier
96 * @link_id: local and remote bearer ids of changing link, if any
97 * @publ_list: list of publications
98 * @rcu: rcu struct for tipc_node
99 */
100struct tipc_node {
101 u32 addr;
102 struct kref kref;
103 rwlock_t lock;
104 struct net *net;
105 struct hlist_node hash;
106 int active_links[2];
107 struct tipc_link_entry links[MAX_BEARERS];
108 struct tipc_bclink_entry bc_entry;
109 int action_flags;
110 struct list_head list;
111 int state;
112 u16 sync_point;
113 int link_cnt;
114 u16 working_links;
115 u16 capabilities;
116 u32 signature;
117 u32 link_id;
118 struct list_head publ_list;
119 struct list_head conn_sks;
120 unsigned long keepalive_intv;
121 struct timer_list timer;
122 struct rcu_head rcu;
123};
124
6e498158
JPM
125/* Node FSM states and events:
126 */
127enum {
128 SELF_DOWN_PEER_DOWN = 0xdd,
129 SELF_UP_PEER_UP = 0xaa,
130 SELF_DOWN_PEER_LEAVING = 0xd1,
131 SELF_UP_PEER_COMING = 0xac,
132 SELF_COMING_PEER_UP = 0xca,
133 SELF_LEAVING_PEER_DOWN = 0x1d,
134 NODE_FAILINGOVER = 0xf0,
135 NODE_SYNCHING = 0xcc
136};
137
138enum {
139 SELF_ESTABL_CONTACT_EVT = 0xece,
140 SELF_LOST_CONTACT_EVT = 0x1ce,
141 PEER_ESTABL_CONTACT_EVT = 0x9ece,
142 PEER_LOST_CONTACT_EVT = 0x91ce,
143 NODE_FAILOVER_BEGIN_EVT = 0xfbe,
144 NODE_FAILOVER_END_EVT = 0xfee,
145 NODE_SYNCH_BEGIN_EVT = 0xcbe,
146 NODE_SYNCH_END_EVT = 0xcee
147};
148
598411d7
JPM
149static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
150 struct sk_buff_head *xmitq,
151 struct tipc_media_addr **maddr);
152static void tipc_node_link_down(struct tipc_node *n, int bearer_id,
153 bool delete);
154static void node_lost_contact(struct tipc_node *n, struct sk_buff_head *inputq);
8a0f6ebe 155static void tipc_node_delete(struct tipc_node *node);
8a1577c9 156static void tipc_node_timeout(unsigned long data);
d999297c 157static void tipc_node_fsm_evt(struct tipc_node *n, int evt);
5be9c086
JPM
158static struct tipc_node *tipc_node_find(struct net *net, u32 addr);
159static void tipc_node_put(struct tipc_node *node);
160static bool tipc_node_is_up(struct tipc_node *n);
b97bf3fd 161
02be61a9
JPM
162struct tipc_sock_conn {
163 u32 port;
164 u32 peer_port;
165 u32 peer_node;
166 struct list_head list;
167};
168
5be9c086
JPM
169static struct tipc_link *node_active_link(struct tipc_node *n, int sel)
170{
171 int bearer_id = n->active_links[sel & 1];
172
173 if (unlikely(bearer_id == INVALID_BEARER_ID))
174 return NULL;
175
176 return n->links[bearer_id].link;
177}
178
179int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel)
180{
181 struct tipc_node *n;
182 int bearer_id;
183 unsigned int mtu = MAX_MSG_SIZE;
184
185 n = tipc_node_find(net, addr);
186 if (unlikely(!n))
187 return mtu;
188
189 bearer_id = n->active_links[sel & 1];
190 if (likely(bearer_id != INVALID_BEARER_ID))
191 mtu = n->links[bearer_id].mtu;
192 tipc_node_put(n);
193 return mtu;
194}
60020e18
JPM
195
196u16 tipc_node_get_capabilities(struct net *net, u32 addr)
197{
198 struct tipc_node *n;
199 u16 caps;
200
201 n = tipc_node_find(net, addr);
202 if (unlikely(!n))
203 return TIPC_NODE_CAPABILITIES;
204 caps = n->capabilities;
205 tipc_node_put(n);
206 return caps;
207}
208
8a0f6ebe
YX
209static void tipc_node_kref_release(struct kref *kref)
210{
d25a0125 211 struct tipc_node *n = container_of(kref, struct tipc_node, kref);
8a0f6ebe 212
d25a0125
JPM
213 kfree(n->bc_entry.link);
214 kfree_rcu(n, rcu);
8a0f6ebe
YX
215}
216
5be9c086 217static void tipc_node_put(struct tipc_node *node)
8a0f6ebe
YX
218{
219 kref_put(&node->kref, tipc_node_kref_release);
220}
221
222static void tipc_node_get(struct tipc_node *node)
223{
224 kref_get(&node->kref);
225}
226
1ec2bb08 227/*
672d99e1
AS
228 * tipc_node_find - locate specified node object, if it exists
229 */
5be9c086 230static struct tipc_node *tipc_node_find(struct net *net, u32 addr)
672d99e1 231{
b170997a 232 struct tipc_net *tn = tipc_net(net);
672d99e1 233 struct tipc_node *node;
b170997a 234 unsigned int thash = tipc_hashfn(addr);
672d99e1 235
34747539 236 if (unlikely(!in_own_cluster_exact(net, addr)))
672d99e1
AS
237 return NULL;
238
6c7a762e 239 rcu_read_lock();
b170997a
JPM
240 hlist_for_each_entry_rcu(node, &tn->node_htable[thash], hash) {
241 if (node->addr != addr)
242 continue;
243 if (!kref_get_unless_zero(&node->kref))
244 node = NULL;
245 break;
672d99e1 246 }
6c7a762e 247 rcu_read_unlock();
b170997a 248 return node;
672d99e1
AS
249}
250
5be9c086 251static void tipc_node_read_lock(struct tipc_node *n)
5405ff6e
JPM
252{
253 read_lock_bh(&n->lock);
254}
255
5be9c086 256static void tipc_node_read_unlock(struct tipc_node *n)
5405ff6e
JPM
257{
258 read_unlock_bh(&n->lock);
259}
260
261static void tipc_node_write_lock(struct tipc_node *n)
262{
263 write_lock_bh(&n->lock);
264}
265
266static void tipc_node_write_unlock(struct tipc_node *n)
267{
268 struct net *net = n->net;
269 u32 addr = 0;
270 u32 flags = n->action_flags;
271 u32 link_id = 0;
35c55c98 272 u32 bearer_id;
5405ff6e
JPM
273 struct list_head *publ_list;
274
275 if (likely(!flags)) {
276 write_unlock_bh(&n->lock);
277 return;
278 }
279
280 addr = n->addr;
281 link_id = n->link_id;
35c55c98 282 bearer_id = link_id & 0xffff;
5405ff6e
JPM
283 publ_list = &n->publ_list;
284
285 n->action_flags &= ~(TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP |
286 TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP);
287
288 write_unlock_bh(&n->lock);
289
290 if (flags & TIPC_NOTIFY_NODE_DOWN)
291 tipc_publ_notify(net, publ_list, addr);
292
293 if (flags & TIPC_NOTIFY_NODE_UP)
294 tipc_named_node_up(net, addr);
295
35c55c98
JPM
296 if (flags & TIPC_NOTIFY_LINK_UP) {
297 tipc_mon_peer_up(net, addr, bearer_id);
5405ff6e
JPM
298 tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr,
299 TIPC_NODE_SCOPE, link_id, addr);
35c55c98
JPM
300 }
301 if (flags & TIPC_NOTIFY_LINK_DOWN) {
302 tipc_mon_peer_down(net, addr, bearer_id);
5405ff6e
JPM
303 tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr,
304 link_id, addr);
35c55c98 305 }
5405ff6e
JPM
306}
307
cf148816 308struct tipc_node *tipc_node_create(struct net *net, u32 addr, u16 capabilities)
b97bf3fd 309{
f2f9800d 310 struct tipc_net *tn = net_generic(net, tipc_net_id);
1a90632d 311 struct tipc_node *n, *temp_node;
5405ff6e 312 int i;
b97bf3fd 313
f2f9800d 314 spin_lock_bh(&tn->node_list_lock);
1a90632d 315 n = tipc_node_find(net, addr);
60020e18
JPM
316 if (n) {
317 /* Same node may come back with new capabilities */
318 n->capabilities = capabilities;
b45db71b 319 goto exit;
60020e18 320 }
1a90632d
JPM
321 n = kzalloc(sizeof(*n), GFP_ATOMIC);
322 if (!n) {
2cf8aa19 323 pr_warn("Node creation failed, no memory\n");
b45db71b 324 goto exit;
a10bd924 325 }
1a90632d
JPM
326 n->addr = addr;
327 n->net = net;
328 n->capabilities = capabilities;
329 kref_init(&n->kref);
330 rwlock_init(&n->lock);
331 INIT_HLIST_NODE(&n->hash);
332 INIT_LIST_HEAD(&n->list);
333 INIT_LIST_HEAD(&n->publ_list);
334 INIT_LIST_HEAD(&n->conn_sks);
335 skb_queue_head_init(&n->bc_entry.namedq);
336 skb_queue_head_init(&n->bc_entry.inputq1);
337 __skb_queue_head_init(&n->bc_entry.arrvq);
338 skb_queue_head_init(&n->bc_entry.inputq2);
5405ff6e 339 for (i = 0; i < MAX_BEARERS; i++)
1a90632d 340 spin_lock_init(&n->links[i].lock);
1a90632d
JPM
341 n->state = SELF_DOWN_PEER_LEAVING;
342 n->signature = INVALID_NODE_SIG;
343 n->active_links[0] = INVALID_BEARER_ID;
344 n->active_links[1] = INVALID_BEARER_ID;
345 if (!tipc_link_bc_create(net, tipc_own_addr(net), n->addr,
38206d59
JPM
346 U16_MAX,
347 tipc_link_window(tipc_bc_sndlink(net)),
1a90632d
JPM
348 n->capabilities,
349 &n->bc_entry.inputq1,
350 &n->bc_entry.namedq,
52666986 351 tipc_bc_sndlink(net),
1a90632d 352 &n->bc_entry.link)) {
52666986 353 pr_warn("Broadcast rcv link creation failed, no memory\n");
1a90632d
JPM
354 kfree(n);
355 n = NULL;
52666986
JPM
356 goto exit;
357 }
1a90632d
JPM
358 tipc_node_get(n);
359 setup_timer(&n->timer, tipc_node_timeout, (unsigned long)n);
360 n->keepalive_intv = U32_MAX;
d5c91fb7
JPM
361 hlist_add_head_rcu(&n->hash, &tn->node_htable[tipc_hashfn(addr)]);
362 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
363 if (n->addr < temp_node->addr)
364 break;
365 }
366 list_add_tail_rcu(&n->list, &temp_node->list);
b45db71b 367exit:
f2f9800d 368 spin_unlock_bh(&tn->node_list_lock);
1a90632d 369 return n;
b97bf3fd
PL
370}
371
8a1577c9
JPM
372static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l)
373{
38206d59 374 unsigned long tol = tipc_link_tolerance(l);
8a1577c9 375 unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4;
8a1577c9
JPM
376
377 /* Link with lowest tolerance determines timer interval */
5ca509fc
JPM
378 if (intv < n->keepalive_intv)
379 n->keepalive_intv = intv;
8a1577c9 380
5ca509fc
JPM
381 /* Ensure link's abort limit corresponds to current tolerance */
382 tipc_link_set_abort_limit(l, tol / n->keepalive_intv);
8a1577c9
JPM
383}
384
8a0f6ebe 385static void tipc_node_delete(struct tipc_node *node)
b97bf3fd 386{
8a0f6ebe
YX
387 list_del_rcu(&node->list);
388 hlist_del_rcu(&node->hash);
d25a0125
JPM
389 tipc_node_put(node);
390
391 del_timer_sync(&node->timer);
392 tipc_node_put(node);
b97bf3fd
PL
393}
394
f2f9800d 395void tipc_node_stop(struct net *net)
46651c59 396{
d25a0125 397 struct tipc_net *tn = tipc_net(net);
46651c59
YX
398 struct tipc_node *node, *t_node;
399
f2f9800d 400 spin_lock_bh(&tn->node_list_lock);
d25a0125
JPM
401 list_for_each_entry_safe(node, t_node, &tn->node_list, list)
402 tipc_node_delete(node);
f2f9800d 403 spin_unlock_bh(&tn->node_list_lock);
46651c59
YX
404}
405
1d7e1c25
JPM
406void tipc_node_subscribe(struct net *net, struct list_head *subscr, u32 addr)
407{
408 struct tipc_node *n;
409
410 if (in_own_node(net, addr))
411 return;
412
413 n = tipc_node_find(net, addr);
414 if (!n) {
415 pr_warn("Node subscribe rejected, unknown node 0x%x\n", addr);
416 return;
417 }
5405ff6e 418 tipc_node_write_lock(n);
1d7e1c25 419 list_add_tail(subscr, &n->publ_list);
5405ff6e 420 tipc_node_write_unlock(n);
1d7e1c25
JPM
421 tipc_node_put(n);
422}
423
424void tipc_node_unsubscribe(struct net *net, struct list_head *subscr, u32 addr)
425{
426 struct tipc_node *n;
427
428 if (in_own_node(net, addr))
429 return;
430
431 n = tipc_node_find(net, addr);
432 if (!n) {
433 pr_warn("Node unsubscribe rejected, unknown node 0x%x\n", addr);
434 return;
435 }
5405ff6e 436 tipc_node_write_lock(n);
1d7e1c25 437 list_del_init(subscr);
5405ff6e 438 tipc_node_write_unlock(n);
1d7e1c25
JPM
439 tipc_node_put(n);
440}
441
f2f9800d 442int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port)
02be61a9
JPM
443{
444 struct tipc_node *node;
445 struct tipc_sock_conn *conn;
8a0f6ebe 446 int err = 0;
02be61a9 447
34747539 448 if (in_own_node(net, dnode))
02be61a9
JPM
449 return 0;
450
f2f9800d 451 node = tipc_node_find(net, dnode);
02be61a9
JPM
452 if (!node) {
453 pr_warn("Connecting sock to node 0x%x failed\n", dnode);
454 return -EHOSTUNREACH;
455 }
456 conn = kmalloc(sizeof(*conn), GFP_ATOMIC);
8a0f6ebe
YX
457 if (!conn) {
458 err = -EHOSTUNREACH;
459 goto exit;
460 }
02be61a9
JPM
461 conn->peer_node = dnode;
462 conn->port = port;
463 conn->peer_port = peer_port;
464
5405ff6e 465 tipc_node_write_lock(node);
02be61a9 466 list_add_tail(&conn->list, &node->conn_sks);
5405ff6e 467 tipc_node_write_unlock(node);
8a0f6ebe
YX
468exit:
469 tipc_node_put(node);
470 return err;
02be61a9
JPM
471}
472
f2f9800d 473void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port)
02be61a9
JPM
474{
475 struct tipc_node *node;
476 struct tipc_sock_conn *conn, *safe;
477
34747539 478 if (in_own_node(net, dnode))
02be61a9
JPM
479 return;
480
f2f9800d 481 node = tipc_node_find(net, dnode);
02be61a9
JPM
482 if (!node)
483 return;
484
5405ff6e 485 tipc_node_write_lock(node);
02be61a9
JPM
486 list_for_each_entry_safe(conn, safe, &node->conn_sks, list) {
487 if (port != conn->port)
488 continue;
489 list_del(&conn->list);
490 kfree(conn);
491 }
5405ff6e 492 tipc_node_write_unlock(node);
8a0f6ebe 493 tipc_node_put(node);
02be61a9
JPM
494}
495
8a1577c9
JPM
496/* tipc_node_timeout - handle expiration of node timer
497 */
498static void tipc_node_timeout(unsigned long data)
499{
500 struct tipc_node *n = (struct tipc_node *)data;
598411d7 501 struct tipc_link_entry *le;
8a1577c9 502 struct sk_buff_head xmitq;
8a1577c9
JPM
503 int bearer_id;
504 int rc = 0;
505
506 __skb_queue_head_init(&xmitq);
507
508 for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) {
5405ff6e 509 tipc_node_read_lock(n);
598411d7 510 le = &n->links[bearer_id];
2312bf61 511 spin_lock_bh(&le->lock);
598411d7 512 if (le->link) {
8a1577c9 513 /* Link tolerance may change asynchronously: */
598411d7
JPM
514 tipc_node_calculate_timer(n, le->link);
515 rc = tipc_link_timeout(le->link, &xmitq);
8a1577c9 516 }
2312bf61 517 spin_unlock_bh(&le->lock);
5405ff6e 518 tipc_node_read_unlock(n);
598411d7
JPM
519 tipc_bearer_xmit(n->net, bearer_id, &xmitq, &le->maddr);
520 if (rc & TIPC_LINK_DOWN_EVT)
521 tipc_node_link_down(n, bearer_id, false);
8a1577c9 522 }
5ca509fc 523 mod_timer(&n->timer, jiffies + msecs_to_jiffies(n->keepalive_intv));
8a1577c9
JPM
524}
525
b97bf3fd 526/**
598411d7
JPM
527 * __tipc_node_link_up - handle addition of link
528 * Node lock must be held by caller
b97bf3fd
PL
529 * Link becomes active (alone or shared) or standby, depending on its priority.
530 */
598411d7
JPM
531static void __tipc_node_link_up(struct tipc_node *n, int bearer_id,
532 struct sk_buff_head *xmitq)
b97bf3fd 533{
36e78a46
JPM
534 int *slot0 = &n->active_links[0];
535 int *slot1 = &n->active_links[1];
6e498158
JPM
536 struct tipc_link *ol = node_active_link(n, 0);
537 struct tipc_link *nl = n->links[bearer_id].link;
9d13ec65 538
e7142c34 539 if (!nl || tipc_link_is_up(nl))
73f646ce
JPM
540 return;
541
542 tipc_link_fsm_evt(nl, LINK_ESTABLISH_EVT);
543 if (!tipc_link_is_up(nl))
598411d7
JPM
544 return;
545
9d13ec65
JPM
546 n->working_links++;
547 n->action_flags |= TIPC_NOTIFY_LINK_UP;
38206d59 548 n->link_id = tipc_link_id(nl);
6e498158
JPM
549
550 /* Leave room for tunnel header when returning 'mtu' to users: */
38206d59 551 n->links[bearer_id].mtu = tipc_link_mtu(nl) - INT_H_SIZE;
7b8613e0 552
cbeb83ca 553 tipc_bearer_add_dest(n->net, bearer_id, n->addr);
b06b281e 554 tipc_bcast_inc_bearer_dst_cnt(n->net, bearer_id);
cbeb83ca 555
3fa9cacd 556 pr_debug("Established link <%s> on network plane %c\n",
38206d59 557 tipc_link_name(nl), tipc_link_plane(nl));
c4307285 558
34b9cd64
JPM
559 /* Ensure that a STATE message goes first */
560 tipc_link_build_state_msg(nl, xmitq);
561
6e498158
JPM
562 /* First link? => give it both slots */
563 if (!ol) {
36e78a46
JPM
564 *slot0 = bearer_id;
565 *slot1 = bearer_id;
52666986
JPM
566 tipc_node_fsm_evt(n, SELF_ESTABL_CONTACT_EVT);
567 n->action_flags |= TIPC_NOTIFY_NODE_UP;
def22c47 568 tipc_link_set_active(nl, true);
b06b281e 569 tipc_bcast_add_peer(n->net, nl, xmitq);
9d13ec65 570 return;
b97bf3fd 571 }
36e78a46 572
6e498158 573 /* Second link => redistribute slots */
38206d59
JPM
574 if (tipc_link_prio(nl) > tipc_link_prio(ol)) {
575 pr_debug("Old link <%s> becomes standby\n", tipc_link_name(ol));
36e78a46 576 *slot0 = bearer_id;
6e498158 577 *slot1 = bearer_id;
c72fa872
JPM
578 tipc_link_set_active(nl, true);
579 tipc_link_set_active(ol, false);
38206d59 580 } else if (tipc_link_prio(nl) == tipc_link_prio(ol)) {
c72fa872 581 tipc_link_set_active(nl, true);
c49a0a84 582 *slot1 = bearer_id;
6e498158 583 } else {
38206d59 584 pr_debug("New link <%s> is standby\n", tipc_link_name(nl));
b97bf3fd 585 }
b97bf3fd 586
6e498158
JPM
587 /* Prepare synchronization with first link */
588 tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq);
b97bf3fd
PL
589}
590
591/**
598411d7
JPM
592 * tipc_node_link_up - handle addition of link
593 *
594 * Link becomes active (alone or shared) or standby, depending on its priority.
b97bf3fd 595 */
598411d7
JPM
596static void tipc_node_link_up(struct tipc_node *n, int bearer_id,
597 struct sk_buff_head *xmitq)
b97bf3fd 598{
de7e07f9
JPM
599 struct tipc_media_addr *maddr;
600
5405ff6e 601 tipc_node_write_lock(n);
598411d7 602 __tipc_node_link_up(n, bearer_id, xmitq);
de7e07f9
JPM
603 maddr = &n->links[bearer_id].maddr;
604 tipc_bearer_xmit(n->net, bearer_id, xmitq, maddr);
5405ff6e 605 tipc_node_write_unlock(n);
598411d7
JPM
606}
607
608/**
609 * __tipc_node_link_down - handle loss of link
610 */
611static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
612 struct sk_buff_head *xmitq,
613 struct tipc_media_addr **maddr)
614{
615 struct tipc_link_entry *le = &n->links[*bearer_id];
36e78a46
JPM
616 int *slot0 = &n->active_links[0];
617 int *slot1 = &n->active_links[1];
38206d59 618 int i, highest = 0, prio;
6e498158 619 struct tipc_link *l, *_l, *tnl;
b97bf3fd 620
598411d7 621 l = n->links[*bearer_id].link;
662921cd 622 if (!l || tipc_link_is_reset(l))
655fb243
JPM
623 return;
624
9d13ec65
JPM
625 n->working_links--;
626 n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
38206d59 627 n->link_id = tipc_link_id(l);
5392d646 628
598411d7 629 tipc_bearer_remove_dest(n->net, *bearer_id, n->addr);
655fb243 630
3fa9cacd 631 pr_debug("Lost link <%s> on network plane %c\n",
38206d59 632 tipc_link_name(l), tipc_link_plane(l));
16e166b8 633
36e78a46
JPM
634 /* Select new active link if any available */
635 *slot0 = INVALID_BEARER_ID;
636 *slot1 = INVALID_BEARER_ID;
637 for (i = 0; i < MAX_BEARERS; i++) {
638 _l = n->links[i].link;
639 if (!_l || !tipc_link_is_up(_l))
640 continue;
655fb243
JPM
641 if (_l == l)
642 continue;
38206d59
JPM
643 prio = tipc_link_prio(_l);
644 if (prio < highest)
36e78a46 645 continue;
38206d59
JPM
646 if (prio > highest) {
647 highest = prio;
36e78a46
JPM
648 *slot0 = i;
649 *slot1 = i;
650 continue;
651 }
652 *slot1 = i;
653 }
655fb243 654
6e498158 655 if (!tipc_node_is_up(n)) {
c8199300
JPM
656 if (tipc_link_peer_is_down(l))
657 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
658 tipc_node_fsm_evt(n, SELF_LOST_CONTACT_EVT);
659 tipc_link_fsm_evt(l, LINK_RESET_EVT);
6e498158 660 tipc_link_reset(l);
282b3a05
JPM
661 tipc_link_build_reset_msg(l, xmitq);
662 *maddr = &n->links[*bearer_id].maddr;
598411d7 663 node_lost_contact(n, &le->inputq);
b06b281e 664 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
6e498158
JPM
665 return;
666 }
b06b281e 667 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
655fb243 668
6e498158 669 /* There is still a working link => initiate failover */
38206d59
JPM
670 *bearer_id = n->active_links[0];
671 tnl = n->links[*bearer_id].link;
5ae2f8e6
JPM
672 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
673 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
38206d59 674 n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
598411d7 675 tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, xmitq);
655fb243 676 tipc_link_reset(l);
c8199300 677 tipc_link_fsm_evt(l, LINK_RESET_EVT);
662921cd 678 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
598411d7 679 tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
38206d59 680 *maddr = &n->links[*bearer_id].maddr;
598411d7
JPM
681}
682
683static void tipc_node_link_down(struct tipc_node *n, int bearer_id, bool delete)
684{
685 struct tipc_link_entry *le = &n->links[bearer_id];
73f646ce 686 struct tipc_link *l = le->link;
598411d7
JPM
687 struct tipc_media_addr *maddr;
688 struct sk_buff_head xmitq;
35c55c98 689 int old_bearer_id = bearer_id;
598411d7 690
73f646ce
JPM
691 if (!l)
692 return;
693
598411d7
JPM
694 __skb_queue_head_init(&xmitq);
695
5405ff6e 696 tipc_node_write_lock(n);
73f646ce
JPM
697 if (!tipc_link_is_establishing(l)) {
698 __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr);
699 if (delete) {
700 kfree(l);
701 le->link = NULL;
702 n->link_cnt--;
703 }
704 } else {
705 /* Defuse pending tipc_node_link_up() */
706 tipc_link_fsm_evt(l, LINK_RESET_EVT);
598411d7 707 }
5405ff6e 708 tipc_node_write_unlock(n);
35c55c98
JPM
709 if (delete)
710 tipc_mon_remove_peer(n->net, n->addr, old_bearer_id);
598411d7
JPM
711 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr);
712 tipc_sk_rcv(n->net, &le->inputq);
b97bf3fd
PL
713}
714
5be9c086 715static bool tipc_node_is_up(struct tipc_node *n)
b97bf3fd 716{
36e78a46 717 return n->active_links[0] != INVALID_BEARER_ID;
b97bf3fd
PL
718}
719
cf148816
JPM
720void tipc_node_check_dest(struct net *net, u32 onode,
721 struct tipc_bearer *b,
722 u16 capabilities, u32 signature,
723 struct tipc_media_addr *maddr,
724 bool *respond, bool *dupl_addr)
d3a43b90 725{
cf148816
JPM
726 struct tipc_node *n;
727 struct tipc_link *l;
440d8963 728 struct tipc_link_entry *le;
cf148816
JPM
729 bool addr_match = false;
730 bool sign_match = false;
731 bool link_up = false;
732 bool accept_addr = false;
598411d7 733 bool reset = true;
0e05498e 734 char *if_name;
5ca509fc 735 unsigned long intv;
440d8963 736
cf148816
JPM
737 *dupl_addr = false;
738 *respond = false;
739
740 n = tipc_node_create(net, onode, capabilities);
741 if (!n)
742 return;
d3a43b90 743
5405ff6e 744 tipc_node_write_lock(n);
cf148816 745
440d8963 746 le = &n->links[b->identity];
cf148816
JPM
747
748 /* Prepare to validate requesting node's signature and media address */
440d8963 749 l = le->link;
cf148816 750 link_up = l && tipc_link_is_up(l);
440d8963 751 addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr));
cf148816
JPM
752 sign_match = (signature == n->signature);
753
754 /* These three flags give us eight permutations: */
755
756 if (sign_match && addr_match && link_up) {
757 /* All is fine. Do nothing. */
598411d7 758 reset = false;
cf148816
JPM
759 } else if (sign_match && addr_match && !link_up) {
760 /* Respond. The link will come up in due time */
761 *respond = true;
762 } else if (sign_match && !addr_match && link_up) {
763 /* Peer has changed i/f address without rebooting.
764 * If so, the link will reset soon, and the next
765 * discovery will be accepted. So we can ignore it.
766 * It may also be an cloned or malicious peer having
767 * chosen the same node address and signature as an
768 * existing one.
769 * Ignore requests until the link goes down, if ever.
770 */
771 *dupl_addr = true;
772 } else if (sign_match && !addr_match && !link_up) {
773 /* Peer link has changed i/f address without rebooting.
774 * It may also be a cloned or malicious peer; we can't
775 * distinguish between the two.
776 * The signature is correct, so we must accept.
777 */
778 accept_addr = true;
779 *respond = true;
780 } else if (!sign_match && addr_match && link_up) {
781 /* Peer node rebooted. Two possibilities:
782 * - Delayed re-discovery; this link endpoint has already
783 * reset and re-established contact with the peer, before
784 * receiving a discovery message from that node.
785 * (The peer happened to receive one from this node first).
786 * - The peer came back so fast that our side has not
787 * discovered it yet. Probing from this side will soon
788 * reset the link, since there can be no working link
789 * endpoint at the peer end, and the link will re-establish.
790 * Accept the signature, since it comes from a known peer.
791 */
792 n->signature = signature;
793 } else if (!sign_match && addr_match && !link_up) {
794 /* The peer node has rebooted.
795 * Accept signature, since it is a known peer.
796 */
797 n->signature = signature;
798 *respond = true;
799 } else if (!sign_match && !addr_match && link_up) {
800 /* Peer rebooted with new address, or a new/duplicate peer.
801 * Ignore until the link goes down, if ever.
802 */
803 *dupl_addr = true;
804 } else if (!sign_match && !addr_match && !link_up) {
805 /* Peer rebooted with new address, or it is a new peer.
806 * Accept signature and address.
807 */
808 n->signature = signature;
809 accept_addr = true;
810 *respond = true;
811 }
d3a43b90 812
cf148816
JPM
813 if (!accept_addr)
814 goto exit;
d3a43b90 815
cf148816 816 /* Now create new link if not already existing */
8a1577c9 817 if (!l) {
440d8963
JPM
818 if (n->link_cnt == 2) {
819 pr_warn("Cannot establish 3rd link to %x\n", n->addr);
820 goto exit;
821 }
0e05498e 822 if_name = strchr(b->name, ':') + 1;
c72fa872 823 if (!tipc_link_create(net, if_name, b->identity, b->tolerance,
0e05498e
JPM
824 b->net_plane, b->mtu, b->priority,
825 b->window, mod(tipc_net(net)->random),
fd556f20 826 tipc_own_addr(net), onode,
2af5ae37 827 n->capabilities,
52666986
JPM
828 tipc_bc_sndlink(n->net), n->bc_entry.link,
829 &le->inputq,
830 &n->bc_entry.namedq, &l)) {
cf148816
JPM
831 *respond = false;
832 goto exit;
833 }
440d8963 834 tipc_link_reset(l);
c8199300 835 tipc_link_fsm_evt(l, LINK_RESET_EVT);
17b20630
JPM
836 if (n->state == NODE_FAILINGOVER)
837 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
440d8963
JPM
838 le->link = l;
839 n->link_cnt++;
8a1577c9 840 tipc_node_calculate_timer(n, l);
5ca509fc
JPM
841 if (n->link_cnt == 1) {
842 intv = jiffies + msecs_to_jiffies(n->keepalive_intv);
843 if (!mod_timer(&n->timer, intv))
8a1577c9 844 tipc_node_get(n);
5ca509fc 845 }
8a1577c9 846 }
440d8963 847 memcpy(&le->maddr, maddr, sizeof(*maddr));
cf148816 848exit:
5405ff6e 849 tipc_node_write_unlock(n);
2837f39c 850 if (reset && l && !tipc_link_is_reset(l))
598411d7 851 tipc_node_link_down(n, b->identity, false);
cf148816 852 tipc_node_put(n);
d3a43b90
JPM
853}
854
6144a996
JPM
855void tipc_node_delete_links(struct net *net, int bearer_id)
856{
857 struct tipc_net *tn = net_generic(net, tipc_net_id);
6144a996
JPM
858 struct tipc_node *n;
859
860 rcu_read_lock();
861 list_for_each_entry_rcu(n, &tn->node_list, list) {
598411d7 862 tipc_node_link_down(n, bearer_id, true);
6144a996
JPM
863 }
864 rcu_read_unlock();
865}
866
867static void tipc_node_reset_links(struct tipc_node *n)
868{
869 char addr_string[16];
598411d7 870 int i;
6144a996
JPM
871
872 pr_warn("Resetting all links to %s\n",
873 tipc_addr_string_fill(addr_string, n->addr));
874
875 for (i = 0; i < MAX_BEARERS; i++) {
598411d7 876 tipc_node_link_down(n, i, false);
6144a996 877 }
6144a996
JPM
878}
879
1a20cc25
JPM
880/* tipc_node_fsm_evt - node finite state machine
881 * Determines when contact is allowed with peer node
882 */
d999297c 883static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
1a20cc25
JPM
884{
885 int state = n->state;
886
887 switch (state) {
888 case SELF_DOWN_PEER_DOWN:
889 switch (evt) {
890 case SELF_ESTABL_CONTACT_EVT:
891 state = SELF_UP_PEER_COMING;
892 break;
893 case PEER_ESTABL_CONTACT_EVT:
894 state = SELF_COMING_PEER_UP;
895 break;
896 case SELF_LOST_CONTACT_EVT:
897 case PEER_LOST_CONTACT_EVT:
898 break;
66996b6c
JPM
899 case NODE_SYNCH_END_EVT:
900 case NODE_SYNCH_BEGIN_EVT:
901 case NODE_FAILOVER_BEGIN_EVT:
902 case NODE_FAILOVER_END_EVT:
1a20cc25 903 default:
66996b6c 904 goto illegal_evt;
1a20cc25
JPM
905 }
906 break;
907 case SELF_UP_PEER_UP:
908 switch (evt) {
909 case SELF_LOST_CONTACT_EVT:
910 state = SELF_DOWN_PEER_LEAVING;
911 break;
912 case PEER_LOST_CONTACT_EVT:
913 state = SELF_LEAVING_PEER_DOWN;
914 break;
66996b6c
JPM
915 case NODE_SYNCH_BEGIN_EVT:
916 state = NODE_SYNCHING;
917 break;
918 case NODE_FAILOVER_BEGIN_EVT:
919 state = NODE_FAILINGOVER;
920 break;
1a20cc25
JPM
921 case SELF_ESTABL_CONTACT_EVT:
922 case PEER_ESTABL_CONTACT_EVT:
66996b6c
JPM
923 case NODE_SYNCH_END_EVT:
924 case NODE_FAILOVER_END_EVT:
1a20cc25
JPM
925 break;
926 default:
66996b6c 927 goto illegal_evt;
1a20cc25
JPM
928 }
929 break;
930 case SELF_DOWN_PEER_LEAVING:
931 switch (evt) {
932 case PEER_LOST_CONTACT_EVT:
933 state = SELF_DOWN_PEER_DOWN;
934 break;
935 case SELF_ESTABL_CONTACT_EVT:
936 case PEER_ESTABL_CONTACT_EVT:
937 case SELF_LOST_CONTACT_EVT:
938 break;
66996b6c
JPM
939 case NODE_SYNCH_END_EVT:
940 case NODE_SYNCH_BEGIN_EVT:
941 case NODE_FAILOVER_BEGIN_EVT:
942 case NODE_FAILOVER_END_EVT:
1a20cc25 943 default:
66996b6c 944 goto illegal_evt;
1a20cc25
JPM
945 }
946 break;
947 case SELF_UP_PEER_COMING:
948 switch (evt) {
949 case PEER_ESTABL_CONTACT_EVT:
950 state = SELF_UP_PEER_UP;
951 break;
952 case SELF_LOST_CONTACT_EVT:
c4282ca7 953 state = SELF_DOWN_PEER_DOWN;
1a20cc25
JPM
954 break;
955 case SELF_ESTABL_CONTACT_EVT:
956 case PEER_LOST_CONTACT_EVT:
66996b6c 957 case NODE_SYNCH_END_EVT:
66996b6c 958 case NODE_FAILOVER_BEGIN_EVT:
73f646ce
JPM
959 break;
960 case NODE_SYNCH_BEGIN_EVT:
66996b6c 961 case NODE_FAILOVER_END_EVT:
1a20cc25 962 default:
66996b6c 963 goto illegal_evt;
1a20cc25
JPM
964 }
965 break;
966 case SELF_COMING_PEER_UP:
967 switch (evt) {
968 case SELF_ESTABL_CONTACT_EVT:
969 state = SELF_UP_PEER_UP;
970 break;
971 case PEER_LOST_CONTACT_EVT:
c4282ca7 972 state = SELF_DOWN_PEER_DOWN;
1a20cc25
JPM
973 break;
974 case SELF_LOST_CONTACT_EVT:
975 case PEER_ESTABL_CONTACT_EVT:
976 break;
66996b6c
JPM
977 case NODE_SYNCH_END_EVT:
978 case NODE_SYNCH_BEGIN_EVT:
979 case NODE_FAILOVER_BEGIN_EVT:
980 case NODE_FAILOVER_END_EVT:
1a20cc25 981 default:
66996b6c 982 goto illegal_evt;
1a20cc25
JPM
983 }
984 break;
985 case SELF_LEAVING_PEER_DOWN:
986 switch (evt) {
987 case SELF_LOST_CONTACT_EVT:
988 state = SELF_DOWN_PEER_DOWN;
989 break;
990 case SELF_ESTABL_CONTACT_EVT:
991 case PEER_ESTABL_CONTACT_EVT:
992 case PEER_LOST_CONTACT_EVT:
993 break;
66996b6c
JPM
994 case NODE_SYNCH_END_EVT:
995 case NODE_SYNCH_BEGIN_EVT:
996 case NODE_FAILOVER_BEGIN_EVT:
997 case NODE_FAILOVER_END_EVT:
998 default:
999 goto illegal_evt;
1000 }
1001 break;
1002 case NODE_FAILINGOVER:
1003 switch (evt) {
1004 case SELF_LOST_CONTACT_EVT:
1005 state = SELF_DOWN_PEER_LEAVING;
1006 break;
1007 case PEER_LOST_CONTACT_EVT:
1008 state = SELF_LEAVING_PEER_DOWN;
1009 break;
1010 case NODE_FAILOVER_END_EVT:
1011 state = SELF_UP_PEER_UP;
1012 break;
1013 case NODE_FAILOVER_BEGIN_EVT:
1014 case SELF_ESTABL_CONTACT_EVT:
1015 case PEER_ESTABL_CONTACT_EVT:
1016 break;
1017 case NODE_SYNCH_BEGIN_EVT:
1018 case NODE_SYNCH_END_EVT:
1a20cc25 1019 default:
66996b6c
JPM
1020 goto illegal_evt;
1021 }
1022 break;
1023 case NODE_SYNCHING:
1024 switch (evt) {
1025 case SELF_LOST_CONTACT_EVT:
1026 state = SELF_DOWN_PEER_LEAVING;
1027 break;
1028 case PEER_LOST_CONTACT_EVT:
1029 state = SELF_LEAVING_PEER_DOWN;
1030 break;
1031 case NODE_SYNCH_END_EVT:
1032 state = SELF_UP_PEER_UP;
1033 break;
1034 case NODE_FAILOVER_BEGIN_EVT:
1035 state = NODE_FAILINGOVER;
1036 break;
1037 case NODE_SYNCH_BEGIN_EVT:
1038 case SELF_ESTABL_CONTACT_EVT:
1039 case PEER_ESTABL_CONTACT_EVT:
1040 break;
1041 case NODE_FAILOVER_END_EVT:
1042 default:
1043 goto illegal_evt;
1a20cc25
JPM
1044 }
1045 break;
1046 default:
1047 pr_err("Unknown node fsm state %x\n", state);
1048 break;
1049 }
1a20cc25 1050 n->state = state;
66996b6c
JPM
1051 return;
1052
1053illegal_evt:
1054 pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
1a20cc25
JPM
1055}
1056
52666986 1057static void node_lost_contact(struct tipc_node *n,
598411d7 1058 struct sk_buff_head *inputq)
b97bf3fd 1059{
b97bf3fd 1060 char addr_string[16];
708ac32c 1061 struct tipc_sock_conn *conn, *safe;
598411d7 1062 struct tipc_link *l;
52666986 1063 struct list_head *conns = &n->conn_sks;
708ac32c 1064 struct sk_buff *skb;
708ac32c 1065 uint i;
b97bf3fd 1066
3fa9cacd 1067 pr_debug("Lost contact with %s\n",
52666986 1068 tipc_addr_string_fill(addr_string, n->addr));
c5bd4d85 1069
52666986 1070 /* Clean up broadcast state */
b06b281e 1071 tipc_bcast_remove_peer(n->net, n->bc_entry.link);
b97bf3fd 1072
dff29b1a 1073 /* Abort any ongoing link failover */
b97bf3fd 1074 for (i = 0; i < MAX_BEARERS; i++) {
52666986 1075 l = n->links[i].link;
598411d7
JPM
1076 if (l)
1077 tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT);
b97bf3fd 1078 }
598411d7 1079
708ac32c 1080 /* Notify publications from this node */
52666986 1081 n->action_flags |= TIPC_NOTIFY_NODE_DOWN;
708ac32c
JPM
1082
1083 /* Notify sockets connected to node */
1084 list_for_each_entry_safe(conn, safe, conns, list) {
1085 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
52666986 1086 SHORT_H_SIZE, 0, tipc_own_addr(n->net),
708ac32c
JPM
1087 conn->peer_node, conn->port,
1088 conn->peer_port, TIPC_ERR_NO_NODE);
23d8335d 1089 if (likely(skb))
598411d7 1090 skb_queue_tail(inputq, skb);
708ac32c
JPM
1091 list_del(&conn->list);
1092 kfree(conn);
1093 }
b97bf3fd
PL
1094}
1095
78acb1f9
EH
1096/**
1097 * tipc_node_get_linkname - get the name of a link
1098 *
1099 * @bearer_id: id of the bearer
1100 * @node: peer node address
1101 * @linkname: link name output buffer
1102 *
1103 * Returns 0 on success
1104 */
f2f9800d
YX
1105int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
1106 char *linkname, size_t len)
78acb1f9
EH
1107{
1108 struct tipc_link *link;
8a0f6ebe 1109 int err = -EINVAL;
f2f9800d 1110 struct tipc_node *node = tipc_node_find(net, addr);
78acb1f9 1111
8a0f6ebe
YX
1112 if (!node)
1113 return err;
1114
1115 if (bearer_id >= MAX_BEARERS)
1116 goto exit;
1117
5405ff6e 1118 tipc_node_read_lock(node);
9d13ec65 1119 link = node->links[bearer_id].link;
78acb1f9 1120 if (link) {
38206d59 1121 strncpy(linkname, tipc_link_name(link), len);
8a0f6ebe 1122 err = 0;
78acb1f9 1123 }
8a0f6ebe 1124exit:
5405ff6e 1125 tipc_node_read_unlock(node);
8a0f6ebe
YX
1126 tipc_node_put(node);
1127 return err;
78acb1f9 1128}
9db9fdd1 1129
3e4b6ab5 1130/* Caller should hold node lock for the passed node */
d8182804 1131static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
3e4b6ab5
RA
1132{
1133 void *hdr;
1134 struct nlattr *attrs;
1135
bfb3e5dd 1136 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
3e4b6ab5
RA
1137 NLM_F_MULTI, TIPC_NL_NODE_GET);
1138 if (!hdr)
1139 return -EMSGSIZE;
1140
1141 attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE);
1142 if (!attrs)
1143 goto msg_full;
1144
1145 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
1146 goto attr_msg_full;
1147 if (tipc_node_is_up(node))
1148 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
1149 goto attr_msg_full;
1150
1151 nla_nest_end(msg->skb, attrs);
1152 genlmsg_end(msg->skb, hdr);
1153
1154 return 0;
1155
1156attr_msg_full:
1157 nla_nest_cancel(msg->skb, attrs);
1158msg_full:
1159 genlmsg_cancel(msg->skb, hdr);
1160
1161 return -EMSGSIZE;
1162}
1163
af9b028e
JPM
1164/**
1165 * tipc_node_xmit() is the general link level function for message sending
1166 * @net: the applicable net namespace
1167 * @list: chain of buffers containing message
1168 * @dnode: address of destination node
1169 * @selector: a number used for deterministic link selection
1170 * Consumes the buffer chain, except when returning -ELINKCONG
4952cd3e 1171 * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
af9b028e
JPM
1172 */
1173int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
1174 u32 dnode, int selector)
1175{
5405ff6e 1176 struct tipc_link_entry *le = NULL;
af9b028e
JPM
1177 struct tipc_node *n;
1178 struct sk_buff_head xmitq;
4952cd3e
RA
1179 int bearer_id;
1180 int rc;
1181
1182 if (in_own_node(net, dnode)) {
1183 tipc_sk_rcv(net, list);
1184 return 0;
1185 }
af9b028e 1186
af9b028e 1187 n = tipc_node_find(net, dnode);
4952cd3e
RA
1188 if (unlikely(!n)) {
1189 skb_queue_purge(list);
1190 return -EHOSTUNREACH;
1191 }
1192
1193 tipc_node_read_lock(n);
1194 bearer_id = n->active_links[selector & 1];
1195 if (unlikely(bearer_id == INVALID_BEARER_ID)) {
5405ff6e 1196 tipc_node_read_unlock(n);
af9b028e 1197 tipc_node_put(n);
4952cd3e
RA
1198 skb_queue_purge(list);
1199 return -EHOSTUNREACH;
af9b028e 1200 }
5405ff6e 1201
4952cd3e
RA
1202 __skb_queue_head_init(&xmitq);
1203 le = &n->links[bearer_id];
1204 spin_lock_bh(&le->lock);
1205 rc = tipc_link_xmit(le->link, list, &xmitq);
1206 spin_unlock_bh(&le->lock);
1207 tipc_node_read_unlock(n);
1208
1209 if (likely(rc == 0))
1210 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1211 else if (rc == -ENOBUFS)
1212 tipc_node_link_down(n, bearer_id, false);
1213
1214 tipc_node_put(n);
1215
dc8d1eb3 1216 return rc;
af9b028e
JPM
1217}
1218
1219/* tipc_node_xmit_skb(): send single buffer to destination
1220 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1221 * messages, which will not be rejected
1222 * The only exception is datagram messages rerouted after secondary
1223 * lookup, which are rare and safe to dispose of anyway.
1224 * TODO: Return real return value, and let callers use
1225 * tipc_wait_for_sendpkt() where applicable
1226 */
1227int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
1228 u32 selector)
1229{
1230 struct sk_buff_head head;
1231 int rc;
1232
1233 skb_queue_head_init(&head);
1234 __skb_queue_tail(&head, skb);
1235 rc = tipc_node_xmit(net, &head, dnode, selector);
1236 if (rc == -ELINKCONG)
1237 kfree_skb(skb);
1238 return 0;
1239}
1240
1d7e1c25
JPM
1241void tipc_node_broadcast(struct net *net, struct sk_buff *skb)
1242{
1243 struct sk_buff *txskb;
1244 struct tipc_node *n;
1245 u32 dst;
1246
1247 rcu_read_lock();
1248 list_for_each_entry_rcu(n, tipc_nodes(net), list) {
1249 dst = n->addr;
1250 if (in_own_node(net, dst))
1251 continue;
1252 if (!tipc_node_is_up(n))
1253 continue;
1254 txskb = pskb_copy(skb, GFP_ATOMIC);
1255 if (!txskb)
1256 break;
1257 msg_set_destnode(buf_msg(txskb), dst);
1258 tipc_node_xmit_skb(net, txskb, dst, 0);
1259 }
1260 rcu_read_unlock();
1261
1262 kfree_skb(skb);
1263}
1264
52666986
JPM
1265/**
1266 * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1267 * @net: the applicable net namespace
1268 * @skb: TIPC packet
1269 * @bearer_id: id of bearer message arrived on
1270 *
1271 * Invoked with no locks held.
1272 */
742e0383 1273static void tipc_node_bc_rcv(struct net *net, struct sk_buff *skb, int bearer_id)
52666986
JPM
1274{
1275 int rc;
1276 struct sk_buff_head xmitq;
1277 struct tipc_bclink_entry *be;
1278 struct tipc_link_entry *le;
1279 struct tipc_msg *hdr = buf_msg(skb);
1280 int usr = msg_user(hdr);
1281 u32 dnode = msg_destnode(hdr);
1282 struct tipc_node *n;
1283
1284 __skb_queue_head_init(&xmitq);
1285
1286 /* If NACK for other node, let rcv link for that node peek into it */
1287 if ((usr == BCAST_PROTOCOL) && (dnode != tipc_own_addr(net)))
1288 n = tipc_node_find(net, dnode);
1289 else
1290 n = tipc_node_find(net, msg_prevnode(hdr));
1291 if (!n) {
1292 kfree_skb(skb);
1293 return;
1294 }
1295 be = &n->bc_entry;
1296 le = &n->links[bearer_id];
1297
1298 rc = tipc_bcast_rcv(net, be->link, skb);
1299
52666986
JPM
1300 /* Broadcast ACKs are sent on a unicast link */
1301 if (rc & TIPC_LINK_SND_BC_ACK) {
5405ff6e 1302 tipc_node_read_lock(n);
34b9cd64 1303 tipc_link_build_state_msg(le->link, &xmitq);
5405ff6e 1304 tipc_node_read_unlock(n);
52666986
JPM
1305 }
1306
1307 if (!skb_queue_empty(&xmitq))
1308 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1309
1310 /* Deliver. 'arrvq' is under inputq2's lock protection */
1311 if (!skb_queue_empty(&be->inputq1)) {
1312 spin_lock_bh(&be->inputq2.lock);
1313 spin_lock_bh(&be->inputq1.lock);
1314 skb_queue_splice_tail_init(&be->inputq1, &be->arrvq);
1315 spin_unlock_bh(&be->inputq1.lock);
1316 spin_unlock_bh(&be->inputq2.lock);
1317 tipc_sk_mcast_rcv(net, &be->arrvq, &be->inputq2);
1318 }
1fc07f3e
JPM
1319
1320 if (rc & TIPC_LINK_DOWN_EVT) {
1321 /* Reception reassembly failure => reset all links to peer */
1322 if (!tipc_link_is_up(be->link))
1323 tipc_node_reset_links(n);
1324
1325 /* Retransmission failure => reset all links to all peers */
1326 if (!tipc_link_is_up(tipc_bc_sndlink(net)))
1327 tipc_bearer_reset_all(net);
1328 }
1329
52666986
JPM
1330 tipc_node_put(n);
1331}
1332
6e498158
JPM
1333/**
1334 * tipc_node_check_state - check and if necessary update node state
1335 * @skb: TIPC packet
1336 * @bearer_id: identity of bearer delivering the packet
1337 * Returns true if state is ok, otherwise consumes buffer and returns false
6144a996 1338 */
6e498158 1339static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb,
662921cd 1340 int bearer_id, struct sk_buff_head *xmitq)
6144a996 1341{
6144a996 1342 struct tipc_msg *hdr = buf_msg(skb);
6e498158
JPM
1343 int usr = msg_user(hdr);
1344 int mtyp = msg_type(hdr);
6144a996 1345 u16 oseqno = msg_seqno(hdr);
6e498158
JPM
1346 u16 iseqno = msg_seqno(msg_get_wrapped(hdr));
1347 u16 exp_pkts = msg_msgcnt(hdr);
38206d59 1348 u16 rcv_nxt, syncpt, dlv_nxt, inputq_len;
6e498158 1349 int state = n->state;
2be80c2d 1350 struct tipc_link *l, *tnl, *pl = NULL;
598411d7 1351 struct tipc_media_addr *maddr;
38206d59 1352 int pb_id;
6144a996 1353
6e498158
JPM
1354 l = n->links[bearer_id].link;
1355 if (!l)
1356 return false;
38206d59 1357 rcv_nxt = tipc_link_rcv_nxt(l);
6144a996 1358
6144a996 1359
6e498158
JPM
1360 if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL)))
1361 return true;
6144a996 1362
6e498158 1363 /* Find parallel link, if any */
38206d59
JPM
1364 for (pb_id = 0; pb_id < MAX_BEARERS; pb_id++) {
1365 if ((pb_id != bearer_id) && n->links[pb_id].link) {
1366 pl = n->links[pb_id].link;
6e498158
JPM
1367 break;
1368 }
1369 }
6144a996 1370
5405ff6e 1371 /* Check and update node accesibility if applicable */
6e498158
JPM
1372 if (state == SELF_UP_PEER_COMING) {
1373 if (!tipc_link_is_up(l))
1374 return true;
1375 if (!msg_peer_link_is_up(hdr))
1376 return true;
1377 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
1378 }
1379
1380 if (state == SELF_DOWN_PEER_LEAVING) {
1381 if (msg_peer_node_is_up(hdr))
1382 return false;
1383 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
5c10e979 1384 return true;
6e498158
JPM
1385 }
1386
5405ff6e
JPM
1387 if (state == SELF_LEAVING_PEER_DOWN)
1388 return false;
1389
6e498158 1390 /* Ignore duplicate packets */
0f8b8e28 1391 if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt))
6e498158
JPM
1392 return true;
1393
1394 /* Initiate or update failover mode if applicable */
1395 if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) {
1396 syncpt = oseqno + exp_pkts - 1;
598411d7 1397 if (pl && tipc_link_is_up(pl)) {
598411d7 1398 __tipc_node_link_down(n, &pb_id, xmitq, &maddr);
38206d59
JPM
1399 tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl),
1400 tipc_link_inputq(l));
598411d7 1401 }
6e498158
JPM
1402 /* If pkts arrive out of order, use lowest calculated syncpt */
1403 if (less(syncpt, n->sync_point))
1404 n->sync_point = syncpt;
1405 }
1406
1407 /* Open parallel link when tunnel link reaches synch point */
17b20630 1408 if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) {
662921cd
JPM
1409 if (!more(rcv_nxt, n->sync_point))
1410 return true;
6e498158
JPM
1411 tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT);
1412 if (pl)
662921cd 1413 tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT);
6e498158
JPM
1414 return true;
1415 }
1416
5ae2f8e6
JPM
1417 /* No synching needed if only one link */
1418 if (!pl || !tipc_link_is_up(pl))
1419 return true;
1420
0f8b8e28
JPM
1421 /* Initiate synch mode if applicable */
1422 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG) && (oseqno == 1)) {
6e498158 1423 syncpt = iseqno + exp_pkts - 1;
662921cd
JPM
1424 if (!tipc_link_is_up(l)) {
1425 tipc_link_fsm_evt(l, LINK_ESTABLISH_EVT);
598411d7 1426 __tipc_node_link_up(n, bearer_id, xmitq);
662921cd 1427 }
6e498158
JPM
1428 if (n->state == SELF_UP_PEER_UP) {
1429 n->sync_point = syncpt;
662921cd 1430 tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT);
6e498158
JPM
1431 tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT);
1432 }
6144a996 1433 }
6e498158
JPM
1434
1435 /* Open tunnel link when parallel link reaches synch point */
5c10e979 1436 if (n->state == NODE_SYNCHING) {
2be80c2d
JPM
1437 if (tipc_link_is_synching(l)) {
1438 tnl = l;
1439 } else {
1440 tnl = pl;
1441 pl = l;
1442 }
38206d59
JPM
1443 inputq_len = skb_queue_len(tipc_link_inputq(pl));
1444 dlv_nxt = tipc_link_rcv_nxt(pl) - inputq_len;
5ae2f8e6 1445 if (more(dlv_nxt, n->sync_point)) {
2be80c2d 1446 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
6e498158 1447 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
6e498158
JPM
1448 return true;
1449 }
2be80c2d
JPM
1450 if (l == pl)
1451 return true;
6e498158
JPM
1452 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG))
1453 return true;
1454 if (usr == LINK_PROTOCOL)
1455 return true;
1456 return false;
1457 }
1458 return true;
6144a996
JPM
1459}
1460
d999297c
JPM
1461/**
1462 * tipc_rcv - process TIPC packets/messages arriving from off-node
1463 * @net: the applicable net namespace
1464 * @skb: TIPC packet
1465 * @bearer: pointer to bearer message arrived on
1466 *
1467 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1468 * structure (i.e. cannot be NULL), but bearer can be inactive.
1469 */
1470void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
1471{
1472 struct sk_buff_head xmitq;
1473 struct tipc_node *n;
6e498158
JPM
1474 struct tipc_msg *hdr = buf_msg(skb);
1475 int usr = msg_user(hdr);
d999297c 1476 int bearer_id = b->identity;
6e498158 1477 struct tipc_link_entry *le;
52666986 1478 u16 bc_ack = msg_bcast_ack(hdr);
efe79050 1479 u32 self = tipc_own_addr(net);
d999297c
JPM
1480 int rc = 0;
1481
1482 __skb_queue_head_init(&xmitq);
1483
1484 /* Ensure message is well-formed */
1485 if (unlikely(!tipc_msg_validate(skb)))
1486 goto discard;
1487
52666986 1488 /* Handle arrival of discovery or broadcast packet */
d999297c 1489 if (unlikely(msg_non_seq(hdr))) {
52666986
JPM
1490 if (unlikely(usr == LINK_CONFIG))
1491 return tipc_disc_rcv(net, skb, b);
d999297c 1492 else
52666986 1493 return tipc_node_bc_rcv(net, skb, bearer_id);
d999297c
JPM
1494 }
1495
efe79050
HM
1496 /* Discard unicast link messages destined for another node */
1497 if (unlikely(!msg_short(hdr) && (msg_destnode(hdr) != self)))
1498 goto discard;
1499
d999297c
JPM
1500 /* Locate neighboring node that sent packet */
1501 n = tipc_node_find(net, msg_prevnode(hdr));
1502 if (unlikely(!n))
1503 goto discard;
6e498158 1504 le = &n->links[bearer_id];
d999297c 1505
52666986
JPM
1506 /* Ensure broadcast reception is in synch with peer's send state */
1507 if (unlikely(usr == LINK_PROTOCOL))
1508 tipc_bcast_sync_rcv(net, n->bc_entry.link, hdr);
38206d59 1509 else if (unlikely(tipc_link_acked(n->bc_entry.link) != bc_ack))
52666986
JPM
1510 tipc_bcast_ack_rcv(net, n->bc_entry.link, bc_ack);
1511
5405ff6e
JPM
1512 /* Receive packet directly if conditions permit */
1513 tipc_node_read_lock(n);
1514 if (likely((n->state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) {
2312bf61 1515 spin_lock_bh(&le->lock);
5405ff6e
JPM
1516 if (le->link) {
1517 rc = tipc_link_rcv(le->link, skb, &xmitq);
1518 skb = NULL;
1519 }
2312bf61 1520 spin_unlock_bh(&le->lock);
6e498158 1521 }
5405ff6e
JPM
1522 tipc_node_read_unlock(n);
1523
1524 /* Check/update node state before receiving */
1525 if (unlikely(skb)) {
1526 tipc_node_write_lock(n);
1527 if (tipc_node_check_state(n, skb, bearer_id, &xmitq)) {
1528 if (le->link) {
1529 rc = tipc_link_rcv(le->link, skb, &xmitq);
1530 skb = NULL;
1531 }
1532 }
1533 tipc_node_write_unlock(n);
1534 }
d999297c
JPM
1535
1536 if (unlikely(rc & TIPC_LINK_UP_EVT))
6e498158
JPM
1537 tipc_node_link_up(n, bearer_id, &xmitq);
1538
d999297c 1539 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
598411d7 1540 tipc_node_link_down(n, bearer_id, false);
6e498158 1541
52666986
JPM
1542 if (unlikely(!skb_queue_empty(&n->bc_entry.namedq)))
1543 tipc_named_rcv(net, &n->bc_entry.namedq);
23d8335d 1544
6e498158
JPM
1545 if (!skb_queue_empty(&le->inputq))
1546 tipc_sk_rcv(net, &le->inputq);
1547
1548 if (!skb_queue_empty(&xmitq))
1549 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1550
d999297c
JPM
1551 tipc_node_put(n);
1552discard:
1553 kfree_skb(skb);
1554}
1555
3e4b6ab5
RA
1556int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
1557{
1558 int err;
f2f9800d
YX
1559 struct net *net = sock_net(skb->sk);
1560 struct tipc_net *tn = net_generic(net, tipc_net_id);
3e4b6ab5
RA
1561 int done = cb->args[0];
1562 int last_addr = cb->args[1];
1563 struct tipc_node *node;
1564 struct tipc_nl_msg msg;
1565
1566 if (done)
1567 return 0;
1568
1569 msg.skb = skb;
1570 msg.portid = NETLINK_CB(cb->skb).portid;
1571 msg.seq = cb->nlh->nlmsg_seq;
1572
1573 rcu_read_lock();
8a0f6ebe
YX
1574 if (last_addr) {
1575 node = tipc_node_find(net, last_addr);
1576 if (!node) {
1577 rcu_read_unlock();
1578 /* We never set seq or call nl_dump_check_consistent()
1579 * this means that setting prev_seq here will cause the
1580 * consistence check to fail in the netlink callback
1581 * handler. Resulting in the NLMSG_DONE message having
1582 * the NLM_F_DUMP_INTR flag set if the node state
1583 * changed while we released the lock.
1584 */
1585 cb->prev_seq = 1;
1586 return -EPIPE;
1587 }
1588 tipc_node_put(node);
3e4b6ab5
RA
1589 }
1590
f2f9800d 1591 list_for_each_entry_rcu(node, &tn->node_list, list) {
3e4b6ab5
RA
1592 if (last_addr) {
1593 if (node->addr == last_addr)
1594 last_addr = 0;
1595 else
1596 continue;
1597 }
1598
5405ff6e 1599 tipc_node_read_lock(node);
3e4b6ab5
RA
1600 err = __tipc_nl_add_node(&msg, node);
1601 if (err) {
1602 last_addr = node->addr;
5405ff6e 1603 tipc_node_read_unlock(node);
3e4b6ab5
RA
1604 goto out;
1605 }
1606
5405ff6e 1607 tipc_node_read_unlock(node);
3e4b6ab5
RA
1608 }
1609 done = 1;
1610out:
1611 cb->args[0] = done;
1612 cb->args[1] = last_addr;
1613 rcu_read_unlock();
1614
1615 return skb->len;
1616}
5be9c086 1617
38206d59 1618/* tipc_node_find_by_name - locate owner node of link by link's name
5be9c086
JPM
1619 * @net: the applicable net namespace
1620 * @name: pointer to link name string
1621 * @bearer_id: pointer to index in 'node->links' array where the link was found.
1622 *
1623 * Returns pointer to node owning the link, or 0 if no matching link is found.
1624 */
38206d59
JPM
1625static struct tipc_node *tipc_node_find_by_name(struct net *net,
1626 const char *link_name,
1627 unsigned int *bearer_id)
5be9c086
JPM
1628{
1629 struct tipc_net *tn = net_generic(net, tipc_net_id);
38206d59
JPM
1630 struct tipc_link *l;
1631 struct tipc_node *n;
5be9c086
JPM
1632 struct tipc_node *found_node = NULL;
1633 int i;
1634
1635 *bearer_id = 0;
1636 rcu_read_lock();
38206d59
JPM
1637 list_for_each_entry_rcu(n, &tn->node_list, list) {
1638 tipc_node_read_lock(n);
5be9c086 1639 for (i = 0; i < MAX_BEARERS; i++) {
38206d59
JPM
1640 l = n->links[i].link;
1641 if (l && !strcmp(tipc_link_name(l), link_name)) {
5be9c086 1642 *bearer_id = i;
38206d59 1643 found_node = n;
5be9c086
JPM
1644 break;
1645 }
1646 }
38206d59 1647 tipc_node_read_unlock(n);
5be9c086
JPM
1648 if (found_node)
1649 break;
1650 }
1651 rcu_read_unlock();
1652
1653 return found_node;
1654}
1655
1656int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info)
1657{
1658 int err;
1659 int res = 0;
1660 int bearer_id;
1661 char *name;
1662 struct tipc_link *link;
1663 struct tipc_node *node;
d01332f1 1664 struct sk_buff_head xmitq;
5be9c086
JPM
1665 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1666 struct net *net = sock_net(skb->sk);
1667
d01332f1
RA
1668 __skb_queue_head_init(&xmitq);
1669
5be9c086
JPM
1670 if (!info->attrs[TIPC_NLA_LINK])
1671 return -EINVAL;
1672
1673 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1674 info->attrs[TIPC_NLA_LINK],
1675 tipc_nl_link_policy);
1676 if (err)
1677 return err;
1678
1679 if (!attrs[TIPC_NLA_LINK_NAME])
1680 return -EINVAL;
1681
1682 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
1683
1684 if (strcmp(name, tipc_bclink_name) == 0)
1685 return tipc_nl_bc_link_set(net, attrs);
1686
38206d59 1687 node = tipc_node_find_by_name(net, name, &bearer_id);
5be9c086
JPM
1688 if (!node)
1689 return -EINVAL;
1690
1691 tipc_node_read_lock(node);
1692
1693 link = node->links[bearer_id].link;
1694 if (!link) {
1695 res = -EINVAL;
1696 goto out;
1697 }
1698
1699 if (attrs[TIPC_NLA_LINK_PROP]) {
1700 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
1701
1702 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
1703 props);
1704 if (err) {
1705 res = err;
1706 goto out;
1707 }
1708
1709 if (props[TIPC_NLA_PROP_TOL]) {
1710 u32 tol;
1711
1712 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
d01332f1 1713 tipc_link_set_tolerance(link, tol, &xmitq);
5be9c086
JPM
1714 }
1715 if (props[TIPC_NLA_PROP_PRIO]) {
1716 u32 prio;
1717
1718 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
d01332f1 1719 tipc_link_set_prio(link, prio, &xmitq);
5be9c086
JPM
1720 }
1721 if (props[TIPC_NLA_PROP_WIN]) {
1722 u32 win;
1723
1724 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
1725 tipc_link_set_queue_limits(link, win);
1726 }
1727 }
1728
1729out:
1730 tipc_node_read_unlock(node);
d01332f1 1731 tipc_bearer_xmit(net, bearer_id, &xmitq, &node->links[bearer_id].maddr);
5be9c086
JPM
1732 return res;
1733}
1734
1735int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info)
1736{
1737 struct net *net = genl_info_net(info);
1738 struct tipc_nl_msg msg;
1739 char *name;
1740 int err;
1741
1742 msg.portid = info->snd_portid;
1743 msg.seq = info->snd_seq;
1744
1745 if (!info->attrs[TIPC_NLA_LINK_NAME])
1746 return -EINVAL;
1747 name = nla_data(info->attrs[TIPC_NLA_LINK_NAME]);
1748
1749 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
1750 if (!msg.skb)
1751 return -ENOMEM;
1752
1753 if (strcmp(name, tipc_bclink_name) == 0) {
1754 err = tipc_nl_add_bc_link(net, &msg);
1755 if (err) {
1756 nlmsg_free(msg.skb);
1757 return err;
1758 }
1759 } else {
1760 int bearer_id;
1761 struct tipc_node *node;
1762 struct tipc_link *link;
1763
38206d59 1764 node = tipc_node_find_by_name(net, name, &bearer_id);
5be9c086
JPM
1765 if (!node)
1766 return -EINVAL;
1767
1768 tipc_node_read_lock(node);
1769 link = node->links[bearer_id].link;
1770 if (!link) {
1771 tipc_node_read_unlock(node);
1772 nlmsg_free(msg.skb);
1773 return -EINVAL;
1774 }
1775
1776 err = __tipc_nl_add_link(net, &msg, link, 0);
1777 tipc_node_read_unlock(node);
1778 if (err) {
1779 nlmsg_free(msg.skb);
1780 return err;
1781 }
1782 }
1783
1784 return genlmsg_reply(msg.skb, info);
1785}
1786
1787int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info)
1788{
1789 int err;
1790 char *link_name;
1791 unsigned int bearer_id;
1792 struct tipc_link *link;
1793 struct tipc_node *node;
1794 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1795 struct net *net = sock_net(skb->sk);
1796 struct tipc_link_entry *le;
1797
1798 if (!info->attrs[TIPC_NLA_LINK])
1799 return -EINVAL;
1800
1801 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1802 info->attrs[TIPC_NLA_LINK],
1803 tipc_nl_link_policy);
1804 if (err)
1805 return err;
1806
1807 if (!attrs[TIPC_NLA_LINK_NAME])
1808 return -EINVAL;
1809
1810 link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
1811
1812 if (strcmp(link_name, tipc_bclink_name) == 0) {
1813 err = tipc_bclink_reset_stats(net);
1814 if (err)
1815 return err;
1816 return 0;
1817 }
1818
38206d59 1819 node = tipc_node_find_by_name(net, link_name, &bearer_id);
5be9c086
JPM
1820 if (!node)
1821 return -EINVAL;
1822
1823 le = &node->links[bearer_id];
1824 tipc_node_read_lock(node);
1825 spin_lock_bh(&le->lock);
1826 link = node->links[bearer_id].link;
1827 if (!link) {
1828 spin_unlock_bh(&le->lock);
1829 tipc_node_read_unlock(node);
1830 return -EINVAL;
1831 }
38206d59 1832 tipc_link_reset_stats(link);
5be9c086
JPM
1833 spin_unlock_bh(&le->lock);
1834 tipc_node_read_unlock(node);
1835 return 0;
1836}
1837
1838/* Caller should hold node lock */
1839static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
1840 struct tipc_node *node, u32 *prev_link)
1841{
1842 u32 i;
1843 int err;
1844
1845 for (i = *prev_link; i < MAX_BEARERS; i++) {
1846 *prev_link = i;
1847
1848 if (!node->links[i].link)
1849 continue;
1850
1851 err = __tipc_nl_add_link(net, msg,
1852 node->links[i].link, NLM_F_MULTI);
1853 if (err)
1854 return err;
1855 }
1856 *prev_link = 0;
1857
1858 return 0;
1859}
1860
38206d59 1861int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb)
5be9c086
JPM
1862{
1863 struct net *net = sock_net(skb->sk);
1864 struct tipc_net *tn = net_generic(net, tipc_net_id);
1865 struct tipc_node *node;
1866 struct tipc_nl_msg msg;
1867 u32 prev_node = cb->args[0];
1868 u32 prev_link = cb->args[1];
1869 int done = cb->args[2];
1870 int err;
1871
1872 if (done)
1873 return 0;
1874
1875 msg.skb = skb;
1876 msg.portid = NETLINK_CB(cb->skb).portid;
1877 msg.seq = cb->nlh->nlmsg_seq;
1878
1879 rcu_read_lock();
1880 if (prev_node) {
1881 node = tipc_node_find(net, prev_node);
1882 if (!node) {
1883 /* We never set seq or call nl_dump_check_consistent()
1884 * this means that setting prev_seq here will cause the
1885 * consistence check to fail in the netlink callback
1886 * handler. Resulting in the last NLMSG_DONE message
1887 * having the NLM_F_DUMP_INTR flag set.
1888 */
1889 cb->prev_seq = 1;
1890 goto out;
1891 }
1892 tipc_node_put(node);
1893
1894 list_for_each_entry_continue_rcu(node, &tn->node_list,
1895 list) {
1896 tipc_node_read_lock(node);
1897 err = __tipc_nl_add_node_links(net, &msg, node,
1898 &prev_link);
1899 tipc_node_read_unlock(node);
1900 if (err)
1901 goto out;
1902
1903 prev_node = node->addr;
1904 }
1905 } else {
1906 err = tipc_nl_add_bc_link(net, &msg);
1907 if (err)
1908 goto out;
1909
1910 list_for_each_entry_rcu(node, &tn->node_list, list) {
1911 tipc_node_read_lock(node);
1912 err = __tipc_nl_add_node_links(net, &msg, node,
1913 &prev_link);
1914 tipc_node_read_unlock(node);
1915 if (err)
1916 goto out;
1917
1918 prev_node = node->addr;
1919 }
1920 }
1921 done = 1;
1922out:
1923 rcu_read_unlock();
1924
1925 cb->args[0] = prev_node;
1926 cb->args[1] = prev_link;
1927 cb->args[2] = done;
1928
1929 return skb->len;
1930}