2 * net/tipc/node.c: TIPC node management routines
4 * Copyright (c) 2000-2006, 2012-2016, Ericsson AB
5 * Copyright (c) 2005-2006, 2010-2014, Wind River Systems
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
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.
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.
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
34 * POSSIBILITY OF SUCH DAMAGE.
40 #include "name_distr.h"
49 #define INVALID_NODE_SIG 0x10000
50 #define NODE_CLEANUP_AFTER 300000
52 /* Flags used to take different actions according to flag type
53 * TIPC_NOTIFY_NODE_DOWN: notify node is down
54 * TIPC_NOTIFY_NODE_UP: notify node is up
55 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
58 TIPC_NOTIFY_NODE_DOWN
= (1 << 3),
59 TIPC_NOTIFY_NODE_UP
= (1 << 4),
60 TIPC_NOTIFY_LINK_UP
= (1 << 6),
61 TIPC_NOTIFY_LINK_DOWN
= (1 << 7)
64 struct tipc_link_entry
{
65 struct tipc_link
*link
;
66 spinlock_t lock
; /* per link */
68 struct sk_buff_head inputq
;
69 struct tipc_media_addr maddr
;
72 struct tipc_bclink_entry
{
73 struct tipc_link
*link
;
74 struct sk_buff_head inputq1
;
75 struct sk_buff_head arrvq
;
76 struct sk_buff_head inputq2
;
77 struct sk_buff_head namedq
;
81 * struct tipc_node - TIPC node structure
82 * @addr: network address of node
83 * @ref: reference counter to node object
84 * @lock: rwlock governing access to structure
85 * @net: the applicable net namespace
86 * @hash: links to adjacent nodes in unsorted hash chain
87 * @inputq: pointer to input queue containing messages for msg event
88 * @namedq: pointer to name table input queue with name table messages
89 * @active_links: bearer ids of active links, used as index into links[] array
90 * @links: array containing references to all links to node
91 * @action_flags: bit mask of different types of node actions
92 * @state: connectivity state vs peer node
93 * @preliminary: a preliminary node or not
94 * @sync_point: sequence number where synch/failover is finished
95 * @list: links to adjacent nodes in sorted list of cluster's nodes
96 * @working_links: number of working links to node (both active and standby)
97 * @link_cnt: number of links to node
98 * @capabilities: bitmap, indicating peer node's functional capabilities
99 * @signature: node instance identifier
100 * @link_id: local and remote bearer ids of changing link, if any
101 * @publ_list: list of publications
102 * @rcu: rcu struct for tipc_node
103 * @delete_at: indicates the time for deleting a down node
104 * @crypto_rx: RX crypto handler
111 struct hlist_node hash
;
113 struct tipc_link_entry links
[MAX_BEARERS
];
114 struct tipc_bclink_entry bc_entry
;
116 struct list_head list
;
127 char peer_id_string
[NODE_ID_STR_LEN
];
128 struct list_head publ_list
;
129 struct list_head conn_sks
;
130 unsigned long keepalive_intv
;
131 struct timer_list timer
;
133 unsigned long delete_at
;
134 struct net
*peer_net
;
136 #ifdef CONFIG_TIPC_CRYPTO
137 struct tipc_crypto
*crypto_rx
;
141 /* Node FSM states and events:
144 SELF_DOWN_PEER_DOWN
= 0xdd,
145 SELF_UP_PEER_UP
= 0xaa,
146 SELF_DOWN_PEER_LEAVING
= 0xd1,
147 SELF_UP_PEER_COMING
= 0xac,
148 SELF_COMING_PEER_UP
= 0xca,
149 SELF_LEAVING_PEER_DOWN
= 0x1d,
150 NODE_FAILINGOVER
= 0xf0,
155 SELF_ESTABL_CONTACT_EVT
= 0xece,
156 SELF_LOST_CONTACT_EVT
= 0x1ce,
157 PEER_ESTABL_CONTACT_EVT
= 0x9ece,
158 PEER_LOST_CONTACT_EVT
= 0x91ce,
159 NODE_FAILOVER_BEGIN_EVT
= 0xfbe,
160 NODE_FAILOVER_END_EVT
= 0xfee,
161 NODE_SYNCH_BEGIN_EVT
= 0xcbe,
162 NODE_SYNCH_END_EVT
= 0xcee
165 static void __tipc_node_link_down(struct tipc_node
*n
, int *bearer_id
,
166 struct sk_buff_head
*xmitq
,
167 struct tipc_media_addr
**maddr
);
168 static void tipc_node_link_down(struct tipc_node
*n
, int bearer_id
,
170 static void node_lost_contact(struct tipc_node
*n
, struct sk_buff_head
*inputq
);
171 static void tipc_node_delete(struct tipc_node
*node
);
172 static void tipc_node_timeout(struct timer_list
*t
);
173 static void tipc_node_fsm_evt(struct tipc_node
*n
, int evt
);
174 static struct tipc_node
*tipc_node_find(struct net
*net
, u32 addr
);
175 static struct tipc_node
*tipc_node_find_by_id(struct net
*net
, u8
*id
);
176 static bool node_is_up(struct tipc_node
*n
);
177 static void tipc_node_delete_from_list(struct tipc_node
*node
);
179 struct tipc_sock_conn
{
183 struct list_head list
;
186 static struct tipc_link
*node_active_link(struct tipc_node
*n
, int sel
)
188 int bearer_id
= n
->active_links
[sel
& 1];
190 if (unlikely(bearer_id
== INVALID_BEARER_ID
))
193 return n
->links
[bearer_id
].link
;
196 int tipc_node_get_mtu(struct net
*net
, u32 addr
, u32 sel
, bool connected
)
200 unsigned int mtu
= MAX_MSG_SIZE
;
202 n
= tipc_node_find(net
, addr
);
206 /* Allow MAX_MSG_SIZE when building connection oriented message
207 * if they are in the same core network
209 if (n
->peer_net
&& connected
) {
214 bearer_id
= n
->active_links
[sel
& 1];
215 if (likely(bearer_id
!= INVALID_BEARER_ID
))
216 mtu
= n
->links
[bearer_id
].mtu
;
221 bool tipc_node_get_id(struct net
*net
, u32 addr
, u8
*id
)
223 u8
*own_id
= tipc_own_id(net
);
229 if (addr
== tipc_own_addr(net
)) {
230 memcpy(id
, own_id
, TIPC_NODEID_LEN
);
233 n
= tipc_node_find(net
, addr
);
237 memcpy(id
, &n
->peer_id
, TIPC_NODEID_LEN
);
242 u16
tipc_node_get_capabilities(struct net
*net
, u32 addr
)
247 n
= tipc_node_find(net
, addr
);
249 return TIPC_NODE_CAPABILITIES
;
250 caps
= n
->capabilities
;
255 u32
tipc_node_get_addr(struct tipc_node
*node
)
257 return (node
) ? node
->addr
: 0;
260 char *tipc_node_get_id_str(struct tipc_node
*node
)
262 return node
->peer_id_string
;
265 #ifdef CONFIG_TIPC_CRYPTO
267 * tipc_node_crypto_rx - Retrieve crypto RX handle from node
268 * Note: node ref counter must be held first!
270 struct tipc_crypto
*tipc_node_crypto_rx(struct tipc_node
*__n
)
272 return (__n
) ? __n
->crypto_rx
: NULL
;
275 struct tipc_crypto
*tipc_node_crypto_rx_by_list(struct list_head
*pos
)
277 return container_of(pos
, struct tipc_node
, list
)->crypto_rx
;
281 void tipc_node_free(struct rcu_head
*rp
)
283 struct tipc_node
*n
= container_of(rp
, struct tipc_node
, rcu
);
285 #ifdef CONFIG_TIPC_CRYPTO
286 tipc_crypto_stop(&n
->crypto_rx
);
291 static void tipc_node_kref_release(struct kref
*kref
)
293 struct tipc_node
*n
= container_of(kref
, struct tipc_node
, kref
);
295 kfree(n
->bc_entry
.link
);
296 call_rcu(&n
->rcu
, tipc_node_free
);
299 void tipc_node_put(struct tipc_node
*node
)
301 kref_put(&node
->kref
, tipc_node_kref_release
);
304 static void tipc_node_get(struct tipc_node
*node
)
306 kref_get(&node
->kref
);
310 * tipc_node_find - locate specified node object, if it exists
312 static struct tipc_node
*tipc_node_find(struct net
*net
, u32 addr
)
314 struct tipc_net
*tn
= tipc_net(net
);
315 struct tipc_node
*node
;
316 unsigned int thash
= tipc_hashfn(addr
);
319 hlist_for_each_entry_rcu(node
, &tn
->node_htable
[thash
], hash
) {
320 if (node
->addr
!= addr
|| node
->preliminary
)
322 if (!kref_get_unless_zero(&node
->kref
))
330 /* tipc_node_find_by_id - locate specified node object by its 128-bit id
331 * Note: this function is called only when a discovery request failed
332 * to find the node by its 32-bit id, and is not time critical
334 static struct tipc_node
*tipc_node_find_by_id(struct net
*net
, u8
*id
)
336 struct tipc_net
*tn
= tipc_net(net
);
341 list_for_each_entry_rcu(n
, &tn
->node_list
, list
) {
342 read_lock_bh(&n
->lock
);
343 if (!memcmp(id
, n
->peer_id
, 16) &&
344 kref_get_unless_zero(&n
->kref
))
346 read_unlock_bh(&n
->lock
);
351 return found
? n
: NULL
;
354 static void tipc_node_read_lock(struct tipc_node
*n
)
356 read_lock_bh(&n
->lock
);
359 static void tipc_node_read_unlock(struct tipc_node
*n
)
361 read_unlock_bh(&n
->lock
);
364 static void tipc_node_write_lock(struct tipc_node
*n
)
366 write_lock_bh(&n
->lock
);
369 static void tipc_node_write_unlock_fast(struct tipc_node
*n
)
371 write_unlock_bh(&n
->lock
);
374 static void tipc_node_write_unlock(struct tipc_node
*n
)
376 struct net
*net
= n
->net
;
378 u32 flags
= n
->action_flags
;
381 struct list_head
*publ_list
;
383 if (likely(!flags
)) {
384 write_unlock_bh(&n
->lock
);
389 link_id
= n
->link_id
;
390 bearer_id
= link_id
& 0xffff;
391 publ_list
= &n
->publ_list
;
393 n
->action_flags
&= ~(TIPC_NOTIFY_NODE_DOWN
| TIPC_NOTIFY_NODE_UP
|
394 TIPC_NOTIFY_LINK_DOWN
| TIPC_NOTIFY_LINK_UP
);
396 write_unlock_bh(&n
->lock
);
398 if (flags
& TIPC_NOTIFY_NODE_DOWN
)
399 tipc_publ_notify(net
, publ_list
, addr
);
401 if (flags
& TIPC_NOTIFY_NODE_UP
)
402 tipc_named_node_up(net
, addr
);
404 if (flags
& TIPC_NOTIFY_LINK_UP
) {
405 tipc_mon_peer_up(net
, addr
, bearer_id
);
406 tipc_nametbl_publish(net
, TIPC_LINK_STATE
, addr
, addr
,
407 TIPC_NODE_SCOPE
, link_id
, link_id
);
409 if (flags
& TIPC_NOTIFY_LINK_DOWN
) {
410 tipc_mon_peer_down(net
, addr
, bearer_id
);
411 tipc_nametbl_withdraw(net
, TIPC_LINK_STATE
, addr
,
416 static void tipc_node_assign_peer_net(struct tipc_node
*n
, u32 hash_mixes
)
418 int net_id
= tipc_netid(n
->net
);
419 struct tipc_net
*tn_peer
;
426 for_each_net_rcu(tmp
) {
427 tn_peer
= tipc_net(tmp
);
430 /* Integrity checking whether node exists in namespace or not */
431 if (tn_peer
->net_id
!= net_id
)
433 if (memcmp(n
->peer_id
, tn_peer
->node_id
, NODE_ID_LEN
))
435 hash_chk
= tipc_net_hash_mixes(tmp
, tn_peer
->random
);
436 if (hash_mixes
^ hash_chk
)
439 n
->peer_hash_mix
= hash_mixes
;
444 struct tipc_node
*tipc_node_create(struct net
*net
, u32 addr
, u8
*peer_id
,
445 u16 capabilities
, u32 hash_mixes
,
448 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
449 struct tipc_node
*n
, *temp_node
;
455 spin_lock_bh(&tn
->node_list_lock
);
456 n
= tipc_node_find(net
, addr
) ?:
457 tipc_node_find_by_id(net
, peer_id
);
463 /* A preliminary node becomes "real" now, refresh its data */
464 tipc_node_write_lock(n
);
465 n
->preliminary
= false;
467 hlist_del_rcu(&n
->hash
);
468 hlist_add_head_rcu(&n
->hash
,
469 &tn
->node_htable
[tipc_hashfn(addr
)]);
470 list_del_rcu(&n
->list
);
471 list_for_each_entry_rcu(temp_node
, &tn
->node_list
, list
) {
472 if (n
->addr
< temp_node
->addr
)
475 list_add_tail_rcu(&n
->list
, &temp_node
->list
);
476 tipc_node_write_unlock_fast(n
);
479 if (n
->peer_hash_mix
^ hash_mixes
)
480 tipc_node_assign_peer_net(n
, hash_mixes
);
481 if (n
->capabilities
== capabilities
)
483 /* Same node may come back with new capabilities */
484 tipc_node_write_lock(n
);
485 n
->capabilities
= capabilities
;
486 for (bearer_id
= 0; bearer_id
< MAX_BEARERS
; bearer_id
++) {
487 l
= n
->links
[bearer_id
].link
;
489 tipc_link_update_caps(l
, capabilities
);
491 tipc_node_write_unlock_fast(n
);
493 /* Calculate cluster capabilities */
494 tn
->capabilities
= TIPC_NODE_CAPABILITIES
;
495 list_for_each_entry_rcu(temp_node
, &tn
->node_list
, list
) {
496 tn
->capabilities
&= temp_node
->capabilities
;
499 tipc_bcast_toggle_rcast(net
,
500 (tn
->capabilities
& TIPC_BCAST_RCAST
));
504 n
= kzalloc(sizeof(*n
), GFP_ATOMIC
);
506 pr_warn("Node creation failed, no memory\n");
509 tipc_nodeid2string(n
->peer_id_string
, peer_id
);
510 #ifdef CONFIG_TIPC_CRYPTO
511 if (unlikely(tipc_crypto_start(&n
->crypto_rx
, net
, n
))) {
512 pr_warn("Failed to start crypto RX(%s)!\n", n
->peer_id_string
);
519 n
->preliminary
= preliminary
;
520 memcpy(&n
->peer_id
, peer_id
, 16);
523 n
->peer_hash_mix
= 0;
524 /* Assign kernel local namespace if exists */
525 tipc_node_assign_peer_net(n
, hash_mixes
);
526 n
->capabilities
= capabilities
;
528 rwlock_init(&n
->lock
);
529 INIT_HLIST_NODE(&n
->hash
);
530 INIT_LIST_HEAD(&n
->list
);
531 INIT_LIST_HEAD(&n
->publ_list
);
532 INIT_LIST_HEAD(&n
->conn_sks
);
533 skb_queue_head_init(&n
->bc_entry
.namedq
);
534 skb_queue_head_init(&n
->bc_entry
.inputq1
);
535 __skb_queue_head_init(&n
->bc_entry
.arrvq
);
536 skb_queue_head_init(&n
->bc_entry
.inputq2
);
537 for (i
= 0; i
< MAX_BEARERS
; i
++)
538 spin_lock_init(&n
->links
[i
].lock
);
539 n
->state
= SELF_DOWN_PEER_LEAVING
;
540 n
->delete_at
= jiffies
+ msecs_to_jiffies(NODE_CLEANUP_AFTER
);
541 n
->signature
= INVALID_NODE_SIG
;
542 n
->active_links
[0] = INVALID_BEARER_ID
;
543 n
->active_links
[1] = INVALID_BEARER_ID
;
544 n
->bc_entry
.link
= NULL
;
546 timer_setup(&n
->timer
, tipc_node_timeout
, 0);
547 /* Start a slow timer anyway, crypto needs it */
548 n
->keepalive_intv
= 10000;
549 intv
= jiffies
+ msecs_to_jiffies(n
->keepalive_intv
);
550 if (!mod_timer(&n
->timer
, intv
))
552 hlist_add_head_rcu(&n
->hash
, &tn
->node_htable
[tipc_hashfn(addr
)]);
553 list_for_each_entry_rcu(temp_node
, &tn
->node_list
, list
) {
554 if (n
->addr
< temp_node
->addr
)
557 list_add_tail_rcu(&n
->list
, &temp_node
->list
);
558 /* Calculate cluster capabilities */
559 tn
->capabilities
= TIPC_NODE_CAPABILITIES
;
560 list_for_each_entry_rcu(temp_node
, &tn
->node_list
, list
) {
561 tn
->capabilities
&= temp_node
->capabilities
;
563 tipc_bcast_toggle_rcast(net
, (tn
->capabilities
& TIPC_BCAST_RCAST
));
564 trace_tipc_node_create(n
, true, " ");
566 spin_unlock_bh(&tn
->node_list_lock
);
570 static void tipc_node_calculate_timer(struct tipc_node
*n
, struct tipc_link
*l
)
572 unsigned long tol
= tipc_link_tolerance(l
);
573 unsigned long intv
= ((tol
/ 4) > 500) ? 500 : tol
/ 4;
575 /* Link with lowest tolerance determines timer interval */
576 if (intv
< n
->keepalive_intv
)
577 n
->keepalive_intv
= intv
;
579 /* Ensure link's abort limit corresponds to current tolerance */
580 tipc_link_set_abort_limit(l
, tol
/ n
->keepalive_intv
);
583 static void tipc_node_delete_from_list(struct tipc_node
*node
)
585 list_del_rcu(&node
->list
);
586 hlist_del_rcu(&node
->hash
);
590 static void tipc_node_delete(struct tipc_node
*node
)
592 trace_tipc_node_delete(node
, true, " ");
593 tipc_node_delete_from_list(node
);
595 del_timer_sync(&node
->timer
);
599 void tipc_node_stop(struct net
*net
)
601 struct tipc_net
*tn
= tipc_net(net
);
602 struct tipc_node
*node
, *t_node
;
604 spin_lock_bh(&tn
->node_list_lock
);
605 list_for_each_entry_safe(node
, t_node
, &tn
->node_list
, list
)
606 tipc_node_delete(node
);
607 spin_unlock_bh(&tn
->node_list_lock
);
610 void tipc_node_subscribe(struct net
*net
, struct list_head
*subscr
, u32 addr
)
614 if (in_own_node(net
, addr
))
617 n
= tipc_node_find(net
, addr
);
619 pr_warn("Node subscribe rejected, unknown node 0x%x\n", addr
);
622 tipc_node_write_lock(n
);
623 list_add_tail(subscr
, &n
->publ_list
);
624 tipc_node_write_unlock_fast(n
);
628 void tipc_node_unsubscribe(struct net
*net
, struct list_head
*subscr
, u32 addr
)
632 if (in_own_node(net
, addr
))
635 n
= tipc_node_find(net
, addr
);
637 pr_warn("Node unsubscribe rejected, unknown node 0x%x\n", addr
);
640 tipc_node_write_lock(n
);
641 list_del_init(subscr
);
642 tipc_node_write_unlock_fast(n
);
646 int tipc_node_add_conn(struct net
*net
, u32 dnode
, u32 port
, u32 peer_port
)
648 struct tipc_node
*node
;
649 struct tipc_sock_conn
*conn
;
652 if (in_own_node(net
, dnode
))
655 node
= tipc_node_find(net
, dnode
);
657 pr_warn("Connecting sock to node 0x%x failed\n", dnode
);
658 return -EHOSTUNREACH
;
660 conn
= kmalloc(sizeof(*conn
), GFP_ATOMIC
);
665 conn
->peer_node
= dnode
;
667 conn
->peer_port
= peer_port
;
669 tipc_node_write_lock(node
);
670 list_add_tail(&conn
->list
, &node
->conn_sks
);
671 tipc_node_write_unlock(node
);
677 void tipc_node_remove_conn(struct net
*net
, u32 dnode
, u32 port
)
679 struct tipc_node
*node
;
680 struct tipc_sock_conn
*conn
, *safe
;
682 if (in_own_node(net
, dnode
))
685 node
= tipc_node_find(net
, dnode
);
689 tipc_node_write_lock(node
);
690 list_for_each_entry_safe(conn
, safe
, &node
->conn_sks
, list
) {
691 if (port
!= conn
->port
)
693 list_del(&conn
->list
);
696 tipc_node_write_unlock(node
);
700 static void tipc_node_clear_links(struct tipc_node
*node
)
704 for (i
= 0; i
< MAX_BEARERS
; i
++) {
705 struct tipc_link_entry
*le
= &node
->links
[i
];
715 /* tipc_node_cleanup - delete nodes that does not
716 * have active links for NODE_CLEANUP_AFTER time
718 static bool tipc_node_cleanup(struct tipc_node
*peer
)
720 struct tipc_node
*temp_node
;
721 struct tipc_net
*tn
= tipc_net(peer
->net
);
722 bool deleted
= false;
724 /* If lock held by tipc_node_stop() the node will be deleted anyway */
725 if (!spin_trylock_bh(&tn
->node_list_lock
))
728 tipc_node_write_lock(peer
);
730 if (!node_is_up(peer
) && time_after(jiffies
, peer
->delete_at
)) {
731 tipc_node_clear_links(peer
);
732 tipc_node_delete_from_list(peer
);
735 tipc_node_write_unlock(peer
);
738 spin_unlock_bh(&tn
->node_list_lock
);
742 /* Calculate cluster capabilities */
743 tn
->capabilities
= TIPC_NODE_CAPABILITIES
;
744 list_for_each_entry_rcu(temp_node
, &tn
->node_list
, list
) {
745 tn
->capabilities
&= temp_node
->capabilities
;
747 tipc_bcast_toggle_rcast(peer
->net
,
748 (tn
->capabilities
& TIPC_BCAST_RCAST
));
749 spin_unlock_bh(&tn
->node_list_lock
);
753 /* tipc_node_timeout - handle expiration of node timer
755 static void tipc_node_timeout(struct timer_list
*t
)
757 struct tipc_node
*n
= from_timer(n
, t
, timer
);
758 struct tipc_link_entry
*le
;
759 struct sk_buff_head xmitq
;
760 int remains
= n
->link_cnt
;
764 trace_tipc_node_timeout(n
, false, " ");
765 if (!node_is_up(n
) && tipc_node_cleanup(n
)) {
766 /*Removing the reference of Timer*/
771 #ifdef CONFIG_TIPC_CRYPTO
772 /* Take any crypto key related actions first */
773 tipc_crypto_timeout(n
->crypto_rx
);
775 __skb_queue_head_init(&xmitq
);
777 /* Initial node interval to value larger (10 seconds), then it will be
778 * recalculated with link lowest tolerance
780 tipc_node_read_lock(n
);
781 n
->keepalive_intv
= 10000;
782 tipc_node_read_unlock(n
);
783 for (bearer_id
= 0; remains
&& (bearer_id
< MAX_BEARERS
); bearer_id
++) {
784 tipc_node_read_lock(n
);
785 le
= &n
->links
[bearer_id
];
787 spin_lock_bh(&le
->lock
);
788 /* Link tolerance may change asynchronously: */
789 tipc_node_calculate_timer(n
, le
->link
);
790 rc
= tipc_link_timeout(le
->link
, &xmitq
);
791 spin_unlock_bh(&le
->lock
);
794 tipc_node_read_unlock(n
);
795 tipc_bearer_xmit(n
->net
, bearer_id
, &xmitq
, &le
->maddr
, n
);
796 if (rc
& TIPC_LINK_DOWN_EVT
)
797 tipc_node_link_down(n
, bearer_id
, false);
799 mod_timer(&n
->timer
, jiffies
+ msecs_to_jiffies(n
->keepalive_intv
));
803 * __tipc_node_link_up - handle addition of link
804 * Node lock must be held by caller
805 * Link becomes active (alone or shared) or standby, depending on its priority.
807 static void __tipc_node_link_up(struct tipc_node
*n
, int bearer_id
,
808 struct sk_buff_head
*xmitq
)
810 int *slot0
= &n
->active_links
[0];
811 int *slot1
= &n
->active_links
[1];
812 struct tipc_link
*ol
= node_active_link(n
, 0);
813 struct tipc_link
*nl
= n
->links
[bearer_id
].link
;
815 if (!nl
|| tipc_link_is_up(nl
))
818 tipc_link_fsm_evt(nl
, LINK_ESTABLISH_EVT
);
819 if (!tipc_link_is_up(nl
))
823 n
->action_flags
|= TIPC_NOTIFY_LINK_UP
;
824 n
->link_id
= tipc_link_id(nl
);
826 /* Leave room for tunnel header when returning 'mtu' to users: */
827 n
->links
[bearer_id
].mtu
= tipc_link_mss(nl
);
829 tipc_bearer_add_dest(n
->net
, bearer_id
, n
->addr
);
830 tipc_bcast_inc_bearer_dst_cnt(n
->net
, bearer_id
);
832 pr_debug("Established link <%s> on network plane %c\n",
833 tipc_link_name(nl
), tipc_link_plane(nl
));
834 trace_tipc_node_link_up(n
, true, " ");
836 /* Ensure that a STATE message goes first */
837 tipc_link_build_state_msg(nl
, xmitq
);
839 /* First link? => give it both slots */
843 tipc_node_fsm_evt(n
, SELF_ESTABL_CONTACT_EVT
);
844 n
->action_flags
|= TIPC_NOTIFY_NODE_UP
;
845 tipc_link_set_active(nl
, true);
846 tipc_bcast_add_peer(n
->net
, nl
, xmitq
);
850 /* Second link => redistribute slots */
851 if (tipc_link_prio(nl
) > tipc_link_prio(ol
)) {
852 pr_debug("Old link <%s> becomes standby\n", tipc_link_name(ol
));
855 tipc_link_set_active(nl
, true);
856 tipc_link_set_active(ol
, false);
857 } else if (tipc_link_prio(nl
) == tipc_link_prio(ol
)) {
858 tipc_link_set_active(nl
, true);
861 pr_debug("New link <%s> is standby\n", tipc_link_name(nl
));
864 /* Prepare synchronization with first link */
865 tipc_link_tnl_prepare(ol
, nl
, SYNCH_MSG
, xmitq
);
869 * tipc_node_link_up - handle addition of link
871 * Link becomes active (alone or shared) or standby, depending on its priority.
873 static void tipc_node_link_up(struct tipc_node
*n
, int bearer_id
,
874 struct sk_buff_head
*xmitq
)
876 struct tipc_media_addr
*maddr
;
878 tipc_node_write_lock(n
);
879 __tipc_node_link_up(n
, bearer_id
, xmitq
);
880 maddr
= &n
->links
[bearer_id
].maddr
;
881 tipc_bearer_xmit(n
->net
, bearer_id
, xmitq
, maddr
, n
);
882 tipc_node_write_unlock(n
);
886 * tipc_node_link_failover() - start failover in case "half-failover"
888 * This function is only called in a very special situation where link
889 * failover can be already started on peer node but not on this node.
890 * This can happen when e.g.
891 * 1. Both links <1A-2A>, <1B-2B> down
892 * 2. Link endpoint 2A up, but 1A still down (e.g. due to network
893 * disturbance, wrong session, etc.)
895 * 4. Link endpoint 2A down (e.g. due to link tolerance timeout)
896 * 5. Node 2 starts failover onto link <1B-2B>
898 * ==> Node 1 does never start link/node failover!
900 * @n: tipc node structure
901 * @l: link peer endpoint failingover (- can be NULL)
903 * @xmitq: queue for messages to be xmited on tnl link later
905 static void tipc_node_link_failover(struct tipc_node
*n
, struct tipc_link
*l
,
906 struct tipc_link
*tnl
,
907 struct sk_buff_head
*xmitq
)
909 /* Avoid to be "self-failover" that can never end */
910 if (!tipc_link_is_up(tnl
))
913 /* Don't rush, failure link may be in the process of resetting */
914 if (l
&& !tipc_link_is_reset(l
))
917 tipc_link_fsm_evt(tnl
, LINK_SYNCH_END_EVT
);
918 tipc_node_fsm_evt(n
, NODE_SYNCH_END_EVT
);
920 n
->sync_point
= tipc_link_rcv_nxt(tnl
) + (U16_MAX
/ 2 - 1);
921 tipc_link_failover_prepare(l
, tnl
, xmitq
);
924 tipc_link_fsm_evt(l
, LINK_FAILOVER_BEGIN_EVT
);
925 tipc_node_fsm_evt(n
, NODE_FAILOVER_BEGIN_EVT
);
929 * __tipc_node_link_down - handle loss of link
931 static void __tipc_node_link_down(struct tipc_node
*n
, int *bearer_id
,
932 struct sk_buff_head
*xmitq
,
933 struct tipc_media_addr
**maddr
)
935 struct tipc_link_entry
*le
= &n
->links
[*bearer_id
];
936 int *slot0
= &n
->active_links
[0];
937 int *slot1
= &n
->active_links
[1];
938 int i
, highest
= 0, prio
;
939 struct tipc_link
*l
, *_l
, *tnl
;
941 l
= n
->links
[*bearer_id
].link
;
942 if (!l
|| tipc_link_is_reset(l
))
946 n
->action_flags
|= TIPC_NOTIFY_LINK_DOWN
;
947 n
->link_id
= tipc_link_id(l
);
949 tipc_bearer_remove_dest(n
->net
, *bearer_id
, n
->addr
);
951 pr_debug("Lost link <%s> on network plane %c\n",
952 tipc_link_name(l
), tipc_link_plane(l
));
954 /* Select new active link if any available */
955 *slot0
= INVALID_BEARER_ID
;
956 *slot1
= INVALID_BEARER_ID
;
957 for (i
= 0; i
< MAX_BEARERS
; i
++) {
958 _l
= n
->links
[i
].link
;
959 if (!_l
|| !tipc_link_is_up(_l
))
963 prio
= tipc_link_prio(_l
);
966 if (prio
> highest
) {
975 if (!node_is_up(n
)) {
976 if (tipc_link_peer_is_down(l
))
977 tipc_node_fsm_evt(n
, PEER_LOST_CONTACT_EVT
);
978 tipc_node_fsm_evt(n
, SELF_LOST_CONTACT_EVT
);
979 trace_tipc_link_reset(l
, TIPC_DUMP_ALL
, "link down!");
980 tipc_link_fsm_evt(l
, LINK_RESET_EVT
);
982 tipc_link_build_reset_msg(l
, xmitq
);
983 *maddr
= &n
->links
[*bearer_id
].maddr
;
984 node_lost_contact(n
, &le
->inputq
);
985 tipc_bcast_dec_bearer_dst_cnt(n
->net
, *bearer_id
);
988 tipc_bcast_dec_bearer_dst_cnt(n
->net
, *bearer_id
);
990 /* There is still a working link => initiate failover */
991 *bearer_id
= n
->active_links
[0];
992 tnl
= n
->links
[*bearer_id
].link
;
993 tipc_link_fsm_evt(tnl
, LINK_SYNCH_END_EVT
);
994 tipc_node_fsm_evt(n
, NODE_SYNCH_END_EVT
);
995 n
->sync_point
= tipc_link_rcv_nxt(tnl
) + (U16_MAX
/ 2 - 1);
996 tipc_link_tnl_prepare(l
, tnl
, FAILOVER_MSG
, xmitq
);
997 trace_tipc_link_reset(l
, TIPC_DUMP_ALL
, "link down -> failover!");
999 tipc_link_fsm_evt(l
, LINK_RESET_EVT
);
1000 tipc_link_fsm_evt(l
, LINK_FAILOVER_BEGIN_EVT
);
1001 tipc_node_fsm_evt(n
, NODE_FAILOVER_BEGIN_EVT
);
1002 *maddr
= &n
->links
[*bearer_id
].maddr
;
1005 static void tipc_node_link_down(struct tipc_node
*n
, int bearer_id
, bool delete)
1007 struct tipc_link_entry
*le
= &n
->links
[bearer_id
];
1008 struct tipc_media_addr
*maddr
= NULL
;
1009 struct tipc_link
*l
= le
->link
;
1010 int old_bearer_id
= bearer_id
;
1011 struct sk_buff_head xmitq
;
1016 __skb_queue_head_init(&xmitq
);
1018 tipc_node_write_lock(n
);
1019 if (!tipc_link_is_establishing(l
)) {
1020 __tipc_node_link_down(n
, &bearer_id
, &xmitq
, &maddr
);
1022 /* Defuse pending tipc_node_link_up() */
1024 tipc_link_fsm_evt(l
, LINK_RESET_EVT
);
1031 trace_tipc_node_link_down(n
, true, "node link down or deleted!");
1032 tipc_node_write_unlock(n
);
1034 tipc_mon_remove_peer(n
->net
, n
->addr
, old_bearer_id
);
1035 if (!skb_queue_empty(&xmitq
))
1036 tipc_bearer_xmit(n
->net
, bearer_id
, &xmitq
, maddr
, n
);
1037 tipc_sk_rcv(n
->net
, &le
->inputq
);
1040 static bool node_is_up(struct tipc_node
*n
)
1042 return n
->active_links
[0] != INVALID_BEARER_ID
;
1045 bool tipc_node_is_up(struct net
*net
, u32 addr
)
1047 struct tipc_node
*n
;
1048 bool retval
= false;
1050 if (in_own_node(net
, addr
))
1053 n
= tipc_node_find(net
, addr
);
1056 retval
= node_is_up(n
);
1061 static u32
tipc_node_suggest_addr(struct net
*net
, u32 addr
)
1063 struct tipc_node
*n
;
1065 addr
^= tipc_net(net
)->random
;
1066 while ((n
= tipc_node_find(net
, addr
))) {
1073 /* tipc_node_try_addr(): Check if addr can be used by peer, suggest other if not
1074 * Returns suggested address if any, otherwise 0
1076 u32
tipc_node_try_addr(struct net
*net
, u8
*id
, u32 addr
)
1078 struct tipc_net
*tn
= tipc_net(net
);
1079 struct tipc_node
*n
;
1083 /* Suggest new address if some other peer is using this one */
1084 n
= tipc_node_find(net
, addr
);
1086 if (!memcmp(n
->peer_id
, id
, NODE_ID_LEN
))
1091 return tipc_node_suggest_addr(net
, addr
);
1094 /* Suggest previously used address if peer is known */
1095 n
= tipc_node_find_by_id(net
, id
);
1097 sugg_addr
= n
->addr
;
1098 preliminary
= n
->preliminary
;
1104 /* Even this node may be in conflict */
1105 if (tn
->trial_addr
== addr
)
1106 return tipc_node_suggest_addr(net
, addr
);
1111 void tipc_node_check_dest(struct net
*net
, u32 addr
,
1112 u8
*peer_id
, struct tipc_bearer
*b
,
1113 u16 capabilities
, u32 signature
, u32 hash_mixes
,
1114 struct tipc_media_addr
*maddr
,
1115 bool *respond
, bool *dupl_addr
)
1117 struct tipc_node
*n
;
1118 struct tipc_link
*l
, *snd_l
;
1119 struct tipc_link_entry
*le
;
1120 bool addr_match
= false;
1121 bool sign_match
= false;
1122 bool link_up
= false;
1123 bool accept_addr
= false;
1132 n
= tipc_node_create(net
, addr
, peer_id
, capabilities
, hash_mixes
,
1137 tipc_node_write_lock(n
);
1138 if (unlikely(!n
->bc_entry
.link
)) {
1139 snd_l
= tipc_bc_sndlink(net
);
1140 if (!tipc_link_bc_create(net
, tipc_own_addr(net
),
1142 tipc_link_window(snd_l
),
1144 &n
->bc_entry
.inputq1
,
1145 &n
->bc_entry
.namedq
, snd_l
,
1146 &n
->bc_entry
.link
)) {
1147 pr_warn("Broadcast rcv link creation failed, no mem\n");
1148 tipc_node_write_unlock_fast(n
);
1154 le
= &n
->links
[b
->identity
];
1156 /* Prepare to validate requesting node's signature and media address */
1158 link_up
= l
&& tipc_link_is_up(l
);
1159 addr_match
= l
&& !memcmp(&le
->maddr
, maddr
, sizeof(*maddr
));
1160 sign_match
= (signature
== n
->signature
);
1162 /* These three flags give us eight permutations: */
1164 if (sign_match
&& addr_match
&& link_up
) {
1165 /* All is fine. Do nothing. */
1167 /* Peer node is not a container/local namespace */
1168 if (!n
->peer_hash_mix
)
1169 n
->peer_hash_mix
= hash_mixes
;
1170 } else if (sign_match
&& addr_match
&& !link_up
) {
1171 /* Respond. The link will come up in due time */
1173 } else if (sign_match
&& !addr_match
&& link_up
) {
1174 /* Peer has changed i/f address without rebooting.
1175 * If so, the link will reset soon, and the next
1176 * discovery will be accepted. So we can ignore it.
1177 * It may also be an cloned or malicious peer having
1178 * chosen the same node address and signature as an
1180 * Ignore requests until the link goes down, if ever.
1183 } else if (sign_match
&& !addr_match
&& !link_up
) {
1184 /* Peer link has changed i/f address without rebooting.
1185 * It may also be a cloned or malicious peer; we can't
1186 * distinguish between the two.
1187 * The signature is correct, so we must accept.
1191 } else if (!sign_match
&& addr_match
&& link_up
) {
1192 /* Peer node rebooted. Two possibilities:
1193 * - Delayed re-discovery; this link endpoint has already
1194 * reset and re-established contact with the peer, before
1195 * receiving a discovery message from that node.
1196 * (The peer happened to receive one from this node first).
1197 * - The peer came back so fast that our side has not
1198 * discovered it yet. Probing from this side will soon
1199 * reset the link, since there can be no working link
1200 * endpoint at the peer end, and the link will re-establish.
1201 * Accept the signature, since it comes from a known peer.
1203 n
->signature
= signature
;
1204 } else if (!sign_match
&& addr_match
&& !link_up
) {
1205 /* The peer node has rebooted.
1206 * Accept signature, since it is a known peer.
1208 n
->signature
= signature
;
1210 } else if (!sign_match
&& !addr_match
&& link_up
) {
1211 /* Peer rebooted with new address, or a new/duplicate peer.
1212 * Ignore until the link goes down, if ever.
1215 } else if (!sign_match
&& !addr_match
&& !link_up
) {
1216 /* Peer rebooted with new address, or it is a new peer.
1217 * Accept signature and address.
1219 n
->signature
= signature
;
1227 /* Now create new link if not already existing */
1229 if (n
->link_cnt
== 2)
1232 if_name
= strchr(b
->name
, ':') + 1;
1233 get_random_bytes(&session
, sizeof(u16
));
1234 if (!tipc_link_create(net
, if_name
, b
->identity
, b
->tolerance
,
1235 b
->net_plane
, b
->mtu
, b
->priority
,
1237 tipc_own_addr(net
), addr
, peer_id
,
1239 tipc_bc_sndlink(n
->net
), n
->bc_entry
.link
,
1241 &n
->bc_entry
.namedq
, &l
)) {
1245 trace_tipc_link_reset(l
, TIPC_DUMP_ALL
, "link created!");
1247 tipc_link_fsm_evt(l
, LINK_RESET_EVT
);
1248 if (n
->state
== NODE_FAILINGOVER
)
1249 tipc_link_fsm_evt(l
, LINK_FAILOVER_BEGIN_EVT
);
1252 tipc_node_calculate_timer(n
, l
);
1253 if (n
->link_cnt
== 1) {
1254 intv
= jiffies
+ msecs_to_jiffies(n
->keepalive_intv
);
1255 if (!mod_timer(&n
->timer
, intv
))
1259 memcpy(&le
->maddr
, maddr
, sizeof(*maddr
));
1261 tipc_node_write_unlock(n
);
1262 if (reset
&& l
&& !tipc_link_is_reset(l
))
1263 tipc_node_link_down(n
, b
->identity
, false);
1267 void tipc_node_delete_links(struct net
*net
, int bearer_id
)
1269 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
1270 struct tipc_node
*n
;
1273 list_for_each_entry_rcu(n
, &tn
->node_list
, list
) {
1274 tipc_node_link_down(n
, bearer_id
, true);
1279 static void tipc_node_reset_links(struct tipc_node
*n
)
1283 pr_warn("Resetting all links to %x\n", n
->addr
);
1285 trace_tipc_node_reset_links(n
, true, " ");
1286 for (i
= 0; i
< MAX_BEARERS
; i
++) {
1287 tipc_node_link_down(n
, i
, false);
1291 /* tipc_node_fsm_evt - node finite state machine
1292 * Determines when contact is allowed with peer node
1294 static void tipc_node_fsm_evt(struct tipc_node
*n
, int evt
)
1296 int state
= n
->state
;
1299 case SELF_DOWN_PEER_DOWN
:
1301 case SELF_ESTABL_CONTACT_EVT
:
1302 state
= SELF_UP_PEER_COMING
;
1304 case PEER_ESTABL_CONTACT_EVT
:
1305 state
= SELF_COMING_PEER_UP
;
1307 case SELF_LOST_CONTACT_EVT
:
1308 case PEER_LOST_CONTACT_EVT
:
1310 case NODE_SYNCH_END_EVT
:
1311 case NODE_SYNCH_BEGIN_EVT
:
1312 case NODE_FAILOVER_BEGIN_EVT
:
1313 case NODE_FAILOVER_END_EVT
:
1318 case SELF_UP_PEER_UP
:
1320 case SELF_LOST_CONTACT_EVT
:
1321 state
= SELF_DOWN_PEER_LEAVING
;
1323 case PEER_LOST_CONTACT_EVT
:
1324 state
= SELF_LEAVING_PEER_DOWN
;
1326 case NODE_SYNCH_BEGIN_EVT
:
1327 state
= NODE_SYNCHING
;
1329 case NODE_FAILOVER_BEGIN_EVT
:
1330 state
= NODE_FAILINGOVER
;
1332 case SELF_ESTABL_CONTACT_EVT
:
1333 case PEER_ESTABL_CONTACT_EVT
:
1334 case NODE_SYNCH_END_EVT
:
1335 case NODE_FAILOVER_END_EVT
:
1341 case SELF_DOWN_PEER_LEAVING
:
1343 case PEER_LOST_CONTACT_EVT
:
1344 state
= SELF_DOWN_PEER_DOWN
;
1346 case SELF_ESTABL_CONTACT_EVT
:
1347 case PEER_ESTABL_CONTACT_EVT
:
1348 case SELF_LOST_CONTACT_EVT
:
1350 case NODE_SYNCH_END_EVT
:
1351 case NODE_SYNCH_BEGIN_EVT
:
1352 case NODE_FAILOVER_BEGIN_EVT
:
1353 case NODE_FAILOVER_END_EVT
:
1358 case SELF_UP_PEER_COMING
:
1360 case PEER_ESTABL_CONTACT_EVT
:
1361 state
= SELF_UP_PEER_UP
;
1363 case SELF_LOST_CONTACT_EVT
:
1364 state
= SELF_DOWN_PEER_DOWN
;
1366 case SELF_ESTABL_CONTACT_EVT
:
1367 case PEER_LOST_CONTACT_EVT
:
1368 case NODE_SYNCH_END_EVT
:
1369 case NODE_FAILOVER_BEGIN_EVT
:
1371 case NODE_SYNCH_BEGIN_EVT
:
1372 case NODE_FAILOVER_END_EVT
:
1377 case SELF_COMING_PEER_UP
:
1379 case SELF_ESTABL_CONTACT_EVT
:
1380 state
= SELF_UP_PEER_UP
;
1382 case PEER_LOST_CONTACT_EVT
:
1383 state
= SELF_DOWN_PEER_DOWN
;
1385 case SELF_LOST_CONTACT_EVT
:
1386 case PEER_ESTABL_CONTACT_EVT
:
1388 case NODE_SYNCH_END_EVT
:
1389 case NODE_SYNCH_BEGIN_EVT
:
1390 case NODE_FAILOVER_BEGIN_EVT
:
1391 case NODE_FAILOVER_END_EVT
:
1396 case SELF_LEAVING_PEER_DOWN
:
1398 case SELF_LOST_CONTACT_EVT
:
1399 state
= SELF_DOWN_PEER_DOWN
;
1401 case SELF_ESTABL_CONTACT_EVT
:
1402 case PEER_ESTABL_CONTACT_EVT
:
1403 case PEER_LOST_CONTACT_EVT
:
1405 case NODE_SYNCH_END_EVT
:
1406 case NODE_SYNCH_BEGIN_EVT
:
1407 case NODE_FAILOVER_BEGIN_EVT
:
1408 case NODE_FAILOVER_END_EVT
:
1413 case NODE_FAILINGOVER
:
1415 case SELF_LOST_CONTACT_EVT
:
1416 state
= SELF_DOWN_PEER_LEAVING
;
1418 case PEER_LOST_CONTACT_EVT
:
1419 state
= SELF_LEAVING_PEER_DOWN
;
1421 case NODE_FAILOVER_END_EVT
:
1422 state
= SELF_UP_PEER_UP
;
1424 case NODE_FAILOVER_BEGIN_EVT
:
1425 case SELF_ESTABL_CONTACT_EVT
:
1426 case PEER_ESTABL_CONTACT_EVT
:
1428 case NODE_SYNCH_BEGIN_EVT
:
1429 case NODE_SYNCH_END_EVT
:
1436 case SELF_LOST_CONTACT_EVT
:
1437 state
= SELF_DOWN_PEER_LEAVING
;
1439 case PEER_LOST_CONTACT_EVT
:
1440 state
= SELF_LEAVING_PEER_DOWN
;
1442 case NODE_SYNCH_END_EVT
:
1443 state
= SELF_UP_PEER_UP
;
1445 case NODE_FAILOVER_BEGIN_EVT
:
1446 state
= NODE_FAILINGOVER
;
1448 case NODE_SYNCH_BEGIN_EVT
:
1449 case SELF_ESTABL_CONTACT_EVT
:
1450 case PEER_ESTABL_CONTACT_EVT
:
1452 case NODE_FAILOVER_END_EVT
:
1458 pr_err("Unknown node fsm state %x\n", state
);
1461 trace_tipc_node_fsm(n
->peer_id
, n
->state
, state
, evt
);
1466 pr_err("Illegal node fsm evt %x in state %x\n", evt
, state
);
1467 trace_tipc_node_fsm(n
->peer_id
, n
->state
, state
, evt
);
1470 static void node_lost_contact(struct tipc_node
*n
,
1471 struct sk_buff_head
*inputq
)
1473 struct tipc_sock_conn
*conn
, *safe
;
1474 struct tipc_link
*l
;
1475 struct list_head
*conns
= &n
->conn_sks
;
1476 struct sk_buff
*skb
;
1479 pr_debug("Lost contact with %x\n", n
->addr
);
1480 n
->delete_at
= jiffies
+ msecs_to_jiffies(NODE_CLEANUP_AFTER
);
1481 trace_tipc_node_lost_contact(n
, true, " ");
1483 /* Clean up broadcast state */
1484 tipc_bcast_remove_peer(n
->net
, n
->bc_entry
.link
);
1486 /* Abort any ongoing link failover */
1487 for (i
= 0; i
< MAX_BEARERS
; i
++) {
1488 l
= n
->links
[i
].link
;
1490 tipc_link_fsm_evt(l
, LINK_FAILOVER_END_EVT
);
1493 /* Notify publications from this node */
1494 n
->action_flags
|= TIPC_NOTIFY_NODE_DOWN
;
1496 n
->peer_hash_mix
= 0;
1497 /* Notify sockets connected to node */
1498 list_for_each_entry_safe(conn
, safe
, conns
, list
) {
1499 skb
= tipc_msg_create(TIPC_CRITICAL_IMPORTANCE
, TIPC_CONN_MSG
,
1500 SHORT_H_SIZE
, 0, tipc_own_addr(n
->net
),
1501 conn
->peer_node
, conn
->port
,
1502 conn
->peer_port
, TIPC_ERR_NO_NODE
);
1504 skb_queue_tail(inputq
, skb
);
1505 list_del(&conn
->list
);
1511 * tipc_node_get_linkname - get the name of a link
1513 * @bearer_id: id of the bearer
1514 * @node: peer node address
1515 * @linkname: link name output buffer
1517 * Returns 0 on success
1519 int tipc_node_get_linkname(struct net
*net
, u32 bearer_id
, u32 addr
,
1520 char *linkname
, size_t len
)
1522 struct tipc_link
*link
;
1524 struct tipc_node
*node
= tipc_node_find(net
, addr
);
1529 if (bearer_id
>= MAX_BEARERS
)
1532 tipc_node_read_lock(node
);
1533 link
= node
->links
[bearer_id
].link
;
1535 strncpy(linkname
, tipc_link_name(link
), len
);
1538 tipc_node_read_unlock(node
);
1540 tipc_node_put(node
);
1544 /* Caller should hold node lock for the passed node */
1545 static int __tipc_nl_add_node(struct tipc_nl_msg
*msg
, struct tipc_node
*node
)
1548 struct nlattr
*attrs
;
1550 hdr
= genlmsg_put(msg
->skb
, msg
->portid
, msg
->seq
, &tipc_genl_family
,
1551 NLM_F_MULTI
, TIPC_NL_NODE_GET
);
1555 attrs
= nla_nest_start_noflag(msg
->skb
, TIPC_NLA_NODE
);
1559 if (nla_put_u32(msg
->skb
, TIPC_NLA_NODE_ADDR
, node
->addr
))
1561 if (node_is_up(node
))
1562 if (nla_put_flag(msg
->skb
, TIPC_NLA_NODE_UP
))
1565 nla_nest_end(msg
->skb
, attrs
);
1566 genlmsg_end(msg
->skb
, hdr
);
1571 nla_nest_cancel(msg
->skb
, attrs
);
1573 genlmsg_cancel(msg
->skb
, hdr
);
1578 static void tipc_lxc_xmit(struct net
*peer_net
, struct sk_buff_head
*list
)
1580 struct tipc_msg
*hdr
= buf_msg(skb_peek(list
));
1581 struct sk_buff_head inputq
;
1583 switch (msg_user(hdr
)) {
1584 case TIPC_LOW_IMPORTANCE
:
1585 case TIPC_MEDIUM_IMPORTANCE
:
1586 case TIPC_HIGH_IMPORTANCE
:
1587 case TIPC_CRITICAL_IMPORTANCE
:
1588 if (msg_connected(hdr
) || msg_named(hdr
)) {
1589 tipc_loopback_trace(peer_net
, list
);
1590 spin_lock_init(&list
->lock
);
1591 tipc_sk_rcv(peer_net
, list
);
1594 if (msg_mcast(hdr
)) {
1595 tipc_loopback_trace(peer_net
, list
);
1596 skb_queue_head_init(&inputq
);
1597 tipc_sk_mcast_rcv(peer_net
, list
, &inputq
);
1598 __skb_queue_purge(list
);
1599 skb_queue_purge(&inputq
);
1603 case MSG_FRAGMENTER
:
1604 if (tipc_msg_assemble(list
)) {
1605 tipc_loopback_trace(peer_net
, list
);
1606 skb_queue_head_init(&inputq
);
1607 tipc_sk_mcast_rcv(peer_net
, list
, &inputq
);
1608 __skb_queue_purge(list
);
1609 skb_queue_purge(&inputq
);
1612 case GROUP_PROTOCOL
:
1614 tipc_loopback_trace(peer_net
, list
);
1615 spin_lock_init(&list
->lock
);
1616 tipc_sk_rcv(peer_net
, list
);
1619 case NAME_DISTRIBUTOR
:
1620 case TUNNEL_PROTOCOL
:
1621 case BCAST_PROTOCOL
:
1629 * tipc_node_xmit() is the general link level function for message sending
1630 * @net: the applicable net namespace
1631 * @list: chain of buffers containing message
1632 * @dnode: address of destination node
1633 * @selector: a number used for deterministic link selection
1634 * Consumes the buffer chain.
1635 * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
1637 int tipc_node_xmit(struct net
*net
, struct sk_buff_head
*list
,
1638 u32 dnode
, int selector
)
1640 struct tipc_link_entry
*le
= NULL
;
1641 struct tipc_node
*n
;
1642 struct sk_buff_head xmitq
;
1643 bool node_up
= false;
1647 if (in_own_node(net
, dnode
)) {
1648 tipc_loopback_trace(net
, list
);
1649 spin_lock_init(&list
->lock
);
1650 tipc_sk_rcv(net
, list
);
1654 n
= tipc_node_find(net
, dnode
);
1656 __skb_queue_purge(list
);
1657 return -EHOSTUNREACH
;
1660 tipc_node_read_lock(n
);
1661 node_up
= node_is_up(n
);
1662 if (node_up
&& n
->peer_net
&& check_net(n
->peer_net
)) {
1663 /* xmit inner linux container */
1664 tipc_lxc_xmit(n
->peer_net
, list
);
1665 if (likely(skb_queue_empty(list
))) {
1666 tipc_node_read_unlock(n
);
1672 bearer_id
= n
->active_links
[selector
& 1];
1673 if (unlikely(bearer_id
== INVALID_BEARER_ID
)) {
1674 tipc_node_read_unlock(n
);
1676 __skb_queue_purge(list
);
1677 return -EHOSTUNREACH
;
1680 __skb_queue_head_init(&xmitq
);
1681 le
= &n
->links
[bearer_id
];
1682 spin_lock_bh(&le
->lock
);
1683 rc
= tipc_link_xmit(le
->link
, list
, &xmitq
);
1684 spin_unlock_bh(&le
->lock
);
1685 tipc_node_read_unlock(n
);
1687 if (unlikely(rc
== -ENOBUFS
))
1688 tipc_node_link_down(n
, bearer_id
, false);
1690 tipc_bearer_xmit(net
, bearer_id
, &xmitq
, &le
->maddr
, n
);
1697 /* tipc_node_xmit_skb(): send single buffer to destination
1698 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1699 * messages, which will not be rejected
1700 * The only exception is datagram messages rerouted after secondary
1701 * lookup, which are rare and safe to dispose of anyway.
1703 int tipc_node_xmit_skb(struct net
*net
, struct sk_buff
*skb
, u32 dnode
,
1706 struct sk_buff_head head
;
1708 __skb_queue_head_init(&head
);
1709 __skb_queue_tail(&head
, skb
);
1710 tipc_node_xmit(net
, &head
, dnode
, selector
);
1714 /* tipc_node_distr_xmit(): send single buffer msgs to individual destinations
1715 * Note: this is only for SYSTEM_IMPORTANCE messages, which cannot be rejected
1717 int tipc_node_distr_xmit(struct net
*net
, struct sk_buff_head
*xmitq
)
1719 struct sk_buff
*skb
;
1720 u32 selector
, dnode
;
1722 while ((skb
= __skb_dequeue(xmitq
))) {
1723 selector
= msg_origport(buf_msg(skb
));
1724 dnode
= msg_destnode(buf_msg(skb
));
1725 tipc_node_xmit_skb(net
, skb
, dnode
, selector
);
1730 void tipc_node_broadcast(struct net
*net
, struct sk_buff
*skb
)
1732 struct sk_buff
*txskb
;
1733 struct tipc_node
*n
;
1737 list_for_each_entry_rcu(n
, tipc_nodes(net
), list
) {
1739 if (in_own_node(net
, dst
))
1743 txskb
= pskb_copy(skb
, GFP_ATOMIC
);
1746 msg_set_destnode(buf_msg(txskb
), dst
);
1747 tipc_node_xmit_skb(net
, txskb
, dst
, 0);
1754 static void tipc_node_mcast_rcv(struct tipc_node
*n
)
1756 struct tipc_bclink_entry
*be
= &n
->bc_entry
;
1758 /* 'arrvq' is under inputq2's lock protection */
1759 spin_lock_bh(&be
->inputq2
.lock
);
1760 spin_lock_bh(&be
->inputq1
.lock
);
1761 skb_queue_splice_tail_init(&be
->inputq1
, &be
->arrvq
);
1762 spin_unlock_bh(&be
->inputq1
.lock
);
1763 spin_unlock_bh(&be
->inputq2
.lock
);
1764 tipc_sk_mcast_rcv(n
->net
, &be
->arrvq
, &be
->inputq2
);
1767 static void tipc_node_bc_sync_rcv(struct tipc_node
*n
, struct tipc_msg
*hdr
,
1768 int bearer_id
, struct sk_buff_head
*xmitq
)
1770 struct tipc_link
*ucl
;
1773 rc
= tipc_bcast_sync_rcv(n
->net
, n
->bc_entry
.link
, hdr
);
1775 if (rc
& TIPC_LINK_DOWN_EVT
) {
1776 tipc_node_reset_links(n
);
1780 if (!(rc
& TIPC_LINK_SND_STATE
))
1783 /* If probe message, a STATE response will be sent anyway */
1787 /* Produce a STATE message carrying broadcast NACK */
1788 tipc_node_read_lock(n
);
1789 ucl
= n
->links
[bearer_id
].link
;
1791 tipc_link_build_state_msg(ucl
, xmitq
);
1792 tipc_node_read_unlock(n
);
1796 * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1797 * @net: the applicable net namespace
1799 * @bearer_id: id of bearer message arrived on
1801 * Invoked with no locks held.
1803 static void tipc_node_bc_rcv(struct net
*net
, struct sk_buff
*skb
, int bearer_id
)
1806 struct sk_buff_head xmitq
;
1807 struct tipc_bclink_entry
*be
;
1808 struct tipc_link_entry
*le
;
1809 struct tipc_msg
*hdr
= buf_msg(skb
);
1810 int usr
= msg_user(hdr
);
1811 u32 dnode
= msg_destnode(hdr
);
1812 struct tipc_node
*n
;
1814 __skb_queue_head_init(&xmitq
);
1816 /* If NACK for other node, let rcv link for that node peek into it */
1817 if ((usr
== BCAST_PROTOCOL
) && (dnode
!= tipc_own_addr(net
)))
1818 n
= tipc_node_find(net
, dnode
);
1820 n
= tipc_node_find(net
, msg_prevnode(hdr
));
1826 le
= &n
->links
[bearer_id
];
1828 rc
= tipc_bcast_rcv(net
, be
->link
, skb
);
1830 /* Broadcast ACKs are sent on a unicast link */
1831 if (rc
& TIPC_LINK_SND_STATE
) {
1832 tipc_node_read_lock(n
);
1833 tipc_link_build_state_msg(le
->link
, &xmitq
);
1834 tipc_node_read_unlock(n
);
1837 if (!skb_queue_empty(&xmitq
))
1838 tipc_bearer_xmit(net
, bearer_id
, &xmitq
, &le
->maddr
, n
);
1840 if (!skb_queue_empty(&be
->inputq1
))
1841 tipc_node_mcast_rcv(n
);
1843 /* Handle NAME_DISTRIBUTOR messages sent from 1.7 nodes */
1844 if (!skb_queue_empty(&n
->bc_entry
.namedq
))
1845 tipc_named_rcv(net
, &n
->bc_entry
.namedq
);
1847 /* If reassembly or retransmission failure => reset all links to peer */
1848 if (rc
& TIPC_LINK_DOWN_EVT
)
1849 tipc_node_reset_links(n
);
1855 * tipc_node_check_state - check and if necessary update node state
1857 * @bearer_id: identity of bearer delivering the packet
1858 * Returns true if state and msg are ok, otherwise false
1860 static bool tipc_node_check_state(struct tipc_node
*n
, struct sk_buff
*skb
,
1861 int bearer_id
, struct sk_buff_head
*xmitq
)
1863 struct tipc_msg
*hdr
= buf_msg(skb
);
1864 int usr
= msg_user(hdr
);
1865 int mtyp
= msg_type(hdr
);
1866 u16 oseqno
= msg_seqno(hdr
);
1867 u16 exp_pkts
= msg_msgcnt(hdr
);
1868 u16 rcv_nxt
, syncpt
, dlv_nxt
, inputq_len
;
1869 int state
= n
->state
;
1870 struct tipc_link
*l
, *tnl
, *pl
= NULL
;
1871 struct tipc_media_addr
*maddr
;
1874 if (trace_tipc_node_check_state_enabled()) {
1875 trace_tipc_skb_dump(skb
, false, "skb for node state check");
1876 trace_tipc_node_check_state(n
, true, " ");
1878 l
= n
->links
[bearer_id
].link
;
1881 rcv_nxt
= tipc_link_rcv_nxt(l
);
1884 if (likely((state
== SELF_UP_PEER_UP
) && (usr
!= TUNNEL_PROTOCOL
)))
1887 /* Find parallel link, if any */
1888 for (pb_id
= 0; pb_id
< MAX_BEARERS
; pb_id
++) {
1889 if ((pb_id
!= bearer_id
) && n
->links
[pb_id
].link
) {
1890 pl
= n
->links
[pb_id
].link
;
1895 if (!tipc_link_validate_msg(l
, hdr
)) {
1896 trace_tipc_skb_dump(skb
, false, "PROTO invalid (2)!");
1897 trace_tipc_link_dump(l
, TIPC_DUMP_NONE
, "PROTO invalid (2)!");
1901 /* Check and update node accesibility if applicable */
1902 if (state
== SELF_UP_PEER_COMING
) {
1903 if (!tipc_link_is_up(l
))
1905 if (!msg_peer_link_is_up(hdr
))
1907 tipc_node_fsm_evt(n
, PEER_ESTABL_CONTACT_EVT
);
1910 if (state
== SELF_DOWN_PEER_LEAVING
) {
1911 if (msg_peer_node_is_up(hdr
))
1913 tipc_node_fsm_evt(n
, PEER_LOST_CONTACT_EVT
);
1917 if (state
== SELF_LEAVING_PEER_DOWN
)
1920 /* Ignore duplicate packets */
1921 if ((usr
!= LINK_PROTOCOL
) && less(oseqno
, rcv_nxt
))
1924 /* Initiate or update failover mode if applicable */
1925 if ((usr
== TUNNEL_PROTOCOL
) && (mtyp
== FAILOVER_MSG
)) {
1926 syncpt
= oseqno
+ exp_pkts
- 1;
1927 if (pl
&& !tipc_link_is_reset(pl
)) {
1928 __tipc_node_link_down(n
, &pb_id
, xmitq
, &maddr
);
1929 trace_tipc_node_link_down(n
, true,
1930 "node link down <- failover!");
1931 tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl
),
1932 tipc_link_inputq(l
));
1935 /* If parallel link was already down, and this happened before
1936 * the tunnel link came up, node failover was never started.
1937 * Ensure that a FAILOVER_MSG is sent to get peer out of
1938 * NODE_FAILINGOVER state, also this node must accept
1939 * TUNNEL_MSGs from peer.
1941 if (n
->state
!= NODE_FAILINGOVER
)
1942 tipc_node_link_failover(n
, pl
, l
, xmitq
);
1944 /* If pkts arrive out of order, use lowest calculated syncpt */
1945 if (less(syncpt
, n
->sync_point
))
1946 n
->sync_point
= syncpt
;
1949 /* Open parallel link when tunnel link reaches synch point */
1950 if ((n
->state
== NODE_FAILINGOVER
) && tipc_link_is_up(l
)) {
1951 if (!more(rcv_nxt
, n
->sync_point
))
1953 tipc_node_fsm_evt(n
, NODE_FAILOVER_END_EVT
);
1955 tipc_link_fsm_evt(pl
, LINK_FAILOVER_END_EVT
);
1959 /* No synching needed if only one link */
1960 if (!pl
|| !tipc_link_is_up(pl
))
1963 /* Initiate synch mode if applicable */
1964 if ((usr
== TUNNEL_PROTOCOL
) && (mtyp
== SYNCH_MSG
) && (oseqno
== 1)) {
1965 if (n
->capabilities
& TIPC_TUNNEL_ENHANCED
)
1966 syncpt
= msg_syncpt(hdr
);
1968 syncpt
= msg_seqno(msg_inner_hdr(hdr
)) + exp_pkts
- 1;
1969 if (!tipc_link_is_up(l
))
1970 __tipc_node_link_up(n
, bearer_id
, xmitq
);
1971 if (n
->state
== SELF_UP_PEER_UP
) {
1972 n
->sync_point
= syncpt
;
1973 tipc_link_fsm_evt(l
, LINK_SYNCH_BEGIN_EVT
);
1974 tipc_node_fsm_evt(n
, NODE_SYNCH_BEGIN_EVT
);
1978 /* Open tunnel link when parallel link reaches synch point */
1979 if (n
->state
== NODE_SYNCHING
) {
1980 if (tipc_link_is_synching(l
)) {
1986 inputq_len
= skb_queue_len(tipc_link_inputq(pl
));
1987 dlv_nxt
= tipc_link_rcv_nxt(pl
) - inputq_len
;
1988 if (more(dlv_nxt
, n
->sync_point
)) {
1989 tipc_link_fsm_evt(tnl
, LINK_SYNCH_END_EVT
);
1990 tipc_node_fsm_evt(n
, NODE_SYNCH_END_EVT
);
1995 if ((usr
== TUNNEL_PROTOCOL
) && (mtyp
== SYNCH_MSG
))
1997 if (usr
== LINK_PROTOCOL
)
2005 * tipc_rcv - process TIPC packets/messages arriving from off-node
2006 * @net: the applicable net namespace
2008 * @bearer: pointer to bearer message arrived on
2010 * Invoked with no locks held. Bearer pointer must point to a valid bearer
2011 * structure (i.e. cannot be NULL), but bearer can be inactive.
2013 void tipc_rcv(struct net
*net
, struct sk_buff
*skb
, struct tipc_bearer
*b
)
2015 struct sk_buff_head xmitq
;
2016 struct tipc_link_entry
*le
;
2017 struct tipc_msg
*hdr
;
2018 struct tipc_node
*n
;
2019 int bearer_id
= b
->identity
;
2020 u32 self
= tipc_own_addr(net
);
2023 #ifdef CONFIG_TIPC_CRYPTO
2024 struct tipc_ehdr
*ehdr
;
2026 /* Check if message must be decrypted first */
2027 if (TIPC_SKB_CB(skb
)->decrypted
|| !tipc_ehdr_validate(skb
))
2030 ehdr
= (struct tipc_ehdr
*)skb
->data
;
2031 if (likely(ehdr
->user
!= LINK_CONFIG
)) {
2032 n
= tipc_node_find(net
, ntohl(ehdr
->addr
));
2036 n
= tipc_node_find_by_id(net
, ehdr
->id
);
2038 tipc_crypto_rcv(net
, (n
) ? n
->crypto_rx
: NULL
, &skb
, b
);
2044 /* Ensure message is well-formed before touching the header */
2045 if (unlikely(!tipc_msg_validate(&skb
)))
2047 __skb_queue_head_init(&xmitq
);
2049 usr
= msg_user(hdr
);
2050 bc_ack
= msg_bcast_ack(hdr
);
2052 /* Handle arrival of discovery or broadcast packet */
2053 if (unlikely(msg_non_seq(hdr
))) {
2054 if (unlikely(usr
== LINK_CONFIG
))
2055 return tipc_disc_rcv(net
, skb
, b
);
2057 return tipc_node_bc_rcv(net
, skb
, bearer_id
);
2060 /* Discard unicast link messages destined for another node */
2061 if (unlikely(!msg_short(hdr
) && (msg_destnode(hdr
) != self
)))
2064 /* Locate neighboring node that sent packet */
2065 n
= tipc_node_find(net
, msg_prevnode(hdr
));
2068 le
= &n
->links
[bearer_id
];
2070 /* Ensure broadcast reception is in synch with peer's send state */
2071 if (unlikely(usr
== LINK_PROTOCOL
))
2072 tipc_node_bc_sync_rcv(n
, hdr
, bearer_id
, &xmitq
);
2073 else if (unlikely(tipc_link_acked(n
->bc_entry
.link
) != bc_ack
))
2074 tipc_bcast_ack_rcv(net
, n
->bc_entry
.link
, hdr
);
2076 /* Receive packet directly if conditions permit */
2077 tipc_node_read_lock(n
);
2078 if (likely((n
->state
== SELF_UP_PEER_UP
) && (usr
!= TUNNEL_PROTOCOL
))) {
2079 spin_lock_bh(&le
->lock
);
2081 rc
= tipc_link_rcv(le
->link
, skb
, &xmitq
);
2084 spin_unlock_bh(&le
->lock
);
2086 tipc_node_read_unlock(n
);
2088 /* Check/update node state before receiving */
2089 if (unlikely(skb
)) {
2090 if (unlikely(skb_linearize(skb
)))
2092 tipc_node_write_lock(n
);
2093 if (tipc_node_check_state(n
, skb
, bearer_id
, &xmitq
)) {
2095 rc
= tipc_link_rcv(le
->link
, skb
, &xmitq
);
2099 tipc_node_write_unlock(n
);
2102 if (unlikely(rc
& TIPC_LINK_UP_EVT
))
2103 tipc_node_link_up(n
, bearer_id
, &xmitq
);
2105 if (unlikely(rc
& TIPC_LINK_DOWN_EVT
))
2106 tipc_node_link_down(n
, bearer_id
, false);
2108 if (unlikely(!skb_queue_empty(&n
->bc_entry
.namedq
)))
2109 tipc_named_rcv(net
, &n
->bc_entry
.namedq
);
2111 if (unlikely(!skb_queue_empty(&n
->bc_entry
.inputq1
)))
2112 tipc_node_mcast_rcv(n
);
2114 if (!skb_queue_empty(&le
->inputq
))
2115 tipc_sk_rcv(net
, &le
->inputq
);
2117 if (!skb_queue_empty(&xmitq
))
2118 tipc_bearer_xmit(net
, bearer_id
, &xmitq
, &le
->maddr
, n
);
2125 void tipc_node_apply_property(struct net
*net
, struct tipc_bearer
*b
,
2128 struct tipc_net
*tn
= tipc_net(net
);
2129 int bearer_id
= b
->identity
;
2130 struct sk_buff_head xmitq
;
2131 struct tipc_link_entry
*e
;
2132 struct tipc_node
*n
;
2134 __skb_queue_head_init(&xmitq
);
2138 list_for_each_entry_rcu(n
, &tn
->node_list
, list
) {
2139 tipc_node_write_lock(n
);
2140 e
= &n
->links
[bearer_id
];
2142 if (prop
== TIPC_NLA_PROP_TOL
)
2143 tipc_link_set_tolerance(e
->link
, b
->tolerance
,
2145 else if (prop
== TIPC_NLA_PROP_MTU
)
2146 tipc_link_set_mtu(e
->link
, b
->mtu
);
2148 tipc_node_write_unlock(n
);
2149 tipc_bearer_xmit(net
, bearer_id
, &xmitq
, &e
->maddr
, NULL
);
2155 int tipc_nl_peer_rm(struct sk_buff
*skb
, struct genl_info
*info
)
2157 struct net
*net
= sock_net(skb
->sk
);
2158 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
2159 struct nlattr
*attrs
[TIPC_NLA_NET_MAX
+ 1];
2160 struct tipc_node
*peer
, *temp_node
;
2164 /* We identify the peer by its net */
2165 if (!info
->attrs
[TIPC_NLA_NET
])
2168 err
= nla_parse_nested_deprecated(attrs
, TIPC_NLA_NET_MAX
,
2169 info
->attrs
[TIPC_NLA_NET
],
2170 tipc_nl_net_policy
, info
->extack
);
2174 if (!attrs
[TIPC_NLA_NET_ADDR
])
2177 addr
= nla_get_u32(attrs
[TIPC_NLA_NET_ADDR
]);
2179 if (in_own_node(net
, addr
))
2182 spin_lock_bh(&tn
->node_list_lock
);
2183 peer
= tipc_node_find(net
, addr
);
2185 spin_unlock_bh(&tn
->node_list_lock
);
2189 tipc_node_write_lock(peer
);
2190 if (peer
->state
!= SELF_DOWN_PEER_DOWN
&&
2191 peer
->state
!= SELF_DOWN_PEER_LEAVING
) {
2192 tipc_node_write_unlock(peer
);
2197 tipc_node_clear_links(peer
);
2198 tipc_node_write_unlock(peer
);
2199 tipc_node_delete(peer
);
2201 /* Calculate cluster capabilities */
2202 tn
->capabilities
= TIPC_NODE_CAPABILITIES
;
2203 list_for_each_entry_rcu(temp_node
, &tn
->node_list
, list
) {
2204 tn
->capabilities
&= temp_node
->capabilities
;
2206 tipc_bcast_toggle_rcast(net
, (tn
->capabilities
& TIPC_BCAST_RCAST
));
2209 tipc_node_put(peer
);
2210 spin_unlock_bh(&tn
->node_list_lock
);
2215 int tipc_nl_node_dump(struct sk_buff
*skb
, struct netlink_callback
*cb
)
2218 struct net
*net
= sock_net(skb
->sk
);
2219 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
2220 int done
= cb
->args
[0];
2221 int last_addr
= cb
->args
[1];
2222 struct tipc_node
*node
;
2223 struct tipc_nl_msg msg
;
2229 msg
.portid
= NETLINK_CB(cb
->skb
).portid
;
2230 msg
.seq
= cb
->nlh
->nlmsg_seq
;
2234 node
= tipc_node_find(net
, last_addr
);
2237 /* We never set seq or call nl_dump_check_consistent()
2238 * this means that setting prev_seq here will cause the
2239 * consistence check to fail in the netlink callback
2240 * handler. Resulting in the NLMSG_DONE message having
2241 * the NLM_F_DUMP_INTR flag set if the node state
2242 * changed while we released the lock.
2247 tipc_node_put(node
);
2250 list_for_each_entry_rcu(node
, &tn
->node_list
, list
) {
2251 if (node
->preliminary
)
2254 if (node
->addr
== last_addr
)
2260 tipc_node_read_lock(node
);
2261 err
= __tipc_nl_add_node(&msg
, node
);
2263 last_addr
= node
->addr
;
2264 tipc_node_read_unlock(node
);
2268 tipc_node_read_unlock(node
);
2273 cb
->args
[1] = last_addr
;
2279 /* tipc_node_find_by_name - locate owner node of link by link's name
2280 * @net: the applicable net namespace
2281 * @name: pointer to link name string
2282 * @bearer_id: pointer to index in 'node->links' array where the link was found.
2284 * Returns pointer to node owning the link, or 0 if no matching link is found.
2286 static struct tipc_node
*tipc_node_find_by_name(struct net
*net
,
2287 const char *link_name
,
2288 unsigned int *bearer_id
)
2290 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
2291 struct tipc_link
*l
;
2292 struct tipc_node
*n
;
2293 struct tipc_node
*found_node
= NULL
;
2298 list_for_each_entry_rcu(n
, &tn
->node_list
, list
) {
2299 tipc_node_read_lock(n
);
2300 for (i
= 0; i
< MAX_BEARERS
; i
++) {
2301 l
= n
->links
[i
].link
;
2302 if (l
&& !strcmp(tipc_link_name(l
), link_name
)) {
2308 tipc_node_read_unlock(n
);
2317 int tipc_nl_node_set_link(struct sk_buff
*skb
, struct genl_info
*info
)
2323 struct tipc_link
*link
;
2324 struct tipc_node
*node
;
2325 struct sk_buff_head xmitq
;
2326 struct nlattr
*attrs
[TIPC_NLA_LINK_MAX
+ 1];
2327 struct net
*net
= sock_net(skb
->sk
);
2329 __skb_queue_head_init(&xmitq
);
2331 if (!info
->attrs
[TIPC_NLA_LINK
])
2334 err
= nla_parse_nested_deprecated(attrs
, TIPC_NLA_LINK_MAX
,
2335 info
->attrs
[TIPC_NLA_LINK
],
2336 tipc_nl_link_policy
, info
->extack
);
2340 if (!attrs
[TIPC_NLA_LINK_NAME
])
2343 name
= nla_data(attrs
[TIPC_NLA_LINK_NAME
]);
2345 if (strcmp(name
, tipc_bclink_name
) == 0)
2346 return tipc_nl_bc_link_set(net
, attrs
);
2348 node
= tipc_node_find_by_name(net
, name
, &bearer_id
);
2352 tipc_node_read_lock(node
);
2354 link
= node
->links
[bearer_id
].link
;
2360 if (attrs
[TIPC_NLA_LINK_PROP
]) {
2361 struct nlattr
*props
[TIPC_NLA_PROP_MAX
+ 1];
2363 err
= tipc_nl_parse_link_prop(attrs
[TIPC_NLA_LINK_PROP
],
2370 if (props
[TIPC_NLA_PROP_TOL
]) {
2373 tol
= nla_get_u32(props
[TIPC_NLA_PROP_TOL
]);
2374 tipc_link_set_tolerance(link
, tol
, &xmitq
);
2376 if (props
[TIPC_NLA_PROP_PRIO
]) {
2379 prio
= nla_get_u32(props
[TIPC_NLA_PROP_PRIO
]);
2380 tipc_link_set_prio(link
, prio
, &xmitq
);
2382 if (props
[TIPC_NLA_PROP_WIN
]) {
2385 win
= nla_get_u32(props
[TIPC_NLA_PROP_WIN
]);
2386 tipc_link_set_queue_limits(link
, win
);
2391 tipc_node_read_unlock(node
);
2392 tipc_bearer_xmit(net
, bearer_id
, &xmitq
, &node
->links
[bearer_id
].maddr
,
2397 int tipc_nl_node_get_link(struct sk_buff
*skb
, struct genl_info
*info
)
2399 struct net
*net
= genl_info_net(info
);
2400 struct nlattr
*attrs
[TIPC_NLA_LINK_MAX
+ 1];
2401 struct tipc_nl_msg msg
;
2405 msg
.portid
= info
->snd_portid
;
2406 msg
.seq
= info
->snd_seq
;
2408 if (!info
->attrs
[TIPC_NLA_LINK
])
2411 err
= nla_parse_nested_deprecated(attrs
, TIPC_NLA_LINK_MAX
,
2412 info
->attrs
[TIPC_NLA_LINK
],
2413 tipc_nl_link_policy
, info
->extack
);
2417 if (!attrs
[TIPC_NLA_LINK_NAME
])
2420 name
= nla_data(attrs
[TIPC_NLA_LINK_NAME
]);
2422 msg
.skb
= nlmsg_new(NLMSG_GOODSIZE
, GFP_KERNEL
);
2426 if (strcmp(name
, tipc_bclink_name
) == 0) {
2427 err
= tipc_nl_add_bc_link(net
, &msg
);
2432 struct tipc_node
*node
;
2433 struct tipc_link
*link
;
2435 node
= tipc_node_find_by_name(net
, name
, &bearer_id
);
2441 tipc_node_read_lock(node
);
2442 link
= node
->links
[bearer_id
].link
;
2444 tipc_node_read_unlock(node
);
2449 err
= __tipc_nl_add_link(net
, &msg
, link
, 0);
2450 tipc_node_read_unlock(node
);
2455 return genlmsg_reply(msg
.skb
, info
);
2458 nlmsg_free(msg
.skb
);
2462 int tipc_nl_node_reset_link_stats(struct sk_buff
*skb
, struct genl_info
*info
)
2466 unsigned int bearer_id
;
2467 struct tipc_link
*link
;
2468 struct tipc_node
*node
;
2469 struct nlattr
*attrs
[TIPC_NLA_LINK_MAX
+ 1];
2470 struct net
*net
= sock_net(skb
->sk
);
2471 struct tipc_link_entry
*le
;
2473 if (!info
->attrs
[TIPC_NLA_LINK
])
2476 err
= nla_parse_nested_deprecated(attrs
, TIPC_NLA_LINK_MAX
,
2477 info
->attrs
[TIPC_NLA_LINK
],
2478 tipc_nl_link_policy
, info
->extack
);
2482 if (!attrs
[TIPC_NLA_LINK_NAME
])
2485 link_name
= nla_data(attrs
[TIPC_NLA_LINK_NAME
]);
2487 if (strcmp(link_name
, tipc_bclink_name
) == 0) {
2488 err
= tipc_bclink_reset_stats(net
);
2494 node
= tipc_node_find_by_name(net
, link_name
, &bearer_id
);
2498 le
= &node
->links
[bearer_id
];
2499 tipc_node_read_lock(node
);
2500 spin_lock_bh(&le
->lock
);
2501 link
= node
->links
[bearer_id
].link
;
2503 spin_unlock_bh(&le
->lock
);
2504 tipc_node_read_unlock(node
);
2507 tipc_link_reset_stats(link
);
2508 spin_unlock_bh(&le
->lock
);
2509 tipc_node_read_unlock(node
);
2513 /* Caller should hold node lock */
2514 static int __tipc_nl_add_node_links(struct net
*net
, struct tipc_nl_msg
*msg
,
2515 struct tipc_node
*node
, u32
*prev_link
)
2520 for (i
= *prev_link
; i
< MAX_BEARERS
; i
++) {
2523 if (!node
->links
[i
].link
)
2526 err
= __tipc_nl_add_link(net
, msg
,
2527 node
->links
[i
].link
, NLM_F_MULTI
);
2536 int tipc_nl_node_dump_link(struct sk_buff
*skb
, struct netlink_callback
*cb
)
2538 struct net
*net
= sock_net(skb
->sk
);
2539 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
2540 struct tipc_node
*node
;
2541 struct tipc_nl_msg msg
;
2542 u32 prev_node
= cb
->args
[0];
2543 u32 prev_link
= cb
->args
[1];
2544 int done
= cb
->args
[2];
2551 msg
.portid
= NETLINK_CB(cb
->skb
).portid
;
2552 msg
.seq
= cb
->nlh
->nlmsg_seq
;
2556 node
= tipc_node_find(net
, prev_node
);
2558 /* We never set seq or call nl_dump_check_consistent()
2559 * this means that setting prev_seq here will cause the
2560 * consistence check to fail in the netlink callback
2561 * handler. Resulting in the last NLMSG_DONE message
2562 * having the NLM_F_DUMP_INTR flag set.
2567 tipc_node_put(node
);
2569 list_for_each_entry_continue_rcu(node
, &tn
->node_list
,
2571 tipc_node_read_lock(node
);
2572 err
= __tipc_nl_add_node_links(net
, &msg
, node
,
2574 tipc_node_read_unlock(node
);
2578 prev_node
= node
->addr
;
2581 err
= tipc_nl_add_bc_link(net
, &msg
);
2585 list_for_each_entry_rcu(node
, &tn
->node_list
, list
) {
2586 tipc_node_read_lock(node
);
2587 err
= __tipc_nl_add_node_links(net
, &msg
, node
,
2589 tipc_node_read_unlock(node
);
2593 prev_node
= node
->addr
;
2600 cb
->args
[0] = prev_node
;
2601 cb
->args
[1] = prev_link
;
2607 int tipc_nl_node_set_monitor(struct sk_buff
*skb
, struct genl_info
*info
)
2609 struct nlattr
*attrs
[TIPC_NLA_MON_MAX
+ 1];
2610 struct net
*net
= sock_net(skb
->sk
);
2613 if (!info
->attrs
[TIPC_NLA_MON
])
2616 err
= nla_parse_nested_deprecated(attrs
, TIPC_NLA_MON_MAX
,
2617 info
->attrs
[TIPC_NLA_MON
],
2618 tipc_nl_monitor_policy
,
2623 if (attrs
[TIPC_NLA_MON_ACTIVATION_THRESHOLD
]) {
2626 val
= nla_get_u32(attrs
[TIPC_NLA_MON_ACTIVATION_THRESHOLD
]);
2627 err
= tipc_nl_monitor_set_threshold(net
, val
);
2635 static int __tipc_nl_add_monitor_prop(struct net
*net
, struct tipc_nl_msg
*msg
)
2637 struct nlattr
*attrs
;
2641 hdr
= genlmsg_put(msg
->skb
, msg
->portid
, msg
->seq
, &tipc_genl_family
,
2642 0, TIPC_NL_MON_GET
);
2646 attrs
= nla_nest_start_noflag(msg
->skb
, TIPC_NLA_MON
);
2650 val
= tipc_nl_monitor_get_threshold(net
);
2652 if (nla_put_u32(msg
->skb
, TIPC_NLA_MON_ACTIVATION_THRESHOLD
, val
))
2655 nla_nest_end(msg
->skb
, attrs
);
2656 genlmsg_end(msg
->skb
, hdr
);
2661 nla_nest_cancel(msg
->skb
, attrs
);
2663 genlmsg_cancel(msg
->skb
, hdr
);
2668 int tipc_nl_node_get_monitor(struct sk_buff
*skb
, struct genl_info
*info
)
2670 struct net
*net
= sock_net(skb
->sk
);
2671 struct tipc_nl_msg msg
;
2674 msg
.skb
= nlmsg_new(NLMSG_GOODSIZE
, GFP_KERNEL
);
2677 msg
.portid
= info
->snd_portid
;
2678 msg
.seq
= info
->snd_seq
;
2680 err
= __tipc_nl_add_monitor_prop(net
, &msg
);
2682 nlmsg_free(msg
.skb
);
2686 return genlmsg_reply(msg
.skb
, info
);
2689 int tipc_nl_node_dump_monitor(struct sk_buff
*skb
, struct netlink_callback
*cb
)
2691 struct net
*net
= sock_net(skb
->sk
);
2692 u32 prev_bearer
= cb
->args
[0];
2693 struct tipc_nl_msg msg
;
2697 if (prev_bearer
== MAX_BEARERS
)
2701 msg
.portid
= NETLINK_CB(cb
->skb
).portid
;
2702 msg
.seq
= cb
->nlh
->nlmsg_seq
;
2705 for (bearer_id
= prev_bearer
; bearer_id
< MAX_BEARERS
; bearer_id
++) {
2706 err
= __tipc_nl_add_monitor(net
, &msg
, bearer_id
);
2711 cb
->args
[0] = bearer_id
;
2716 int tipc_nl_node_dump_monitor_peer(struct sk_buff
*skb
,
2717 struct netlink_callback
*cb
)
2719 struct net
*net
= sock_net(skb
->sk
);
2720 u32 prev_node
= cb
->args
[1];
2721 u32 bearer_id
= cb
->args
[2];
2722 int done
= cb
->args
[0];
2723 struct tipc_nl_msg msg
;
2727 struct nlattr
**attrs
= genl_dumpit_info(cb
)->attrs
;
2728 struct nlattr
*mon
[TIPC_NLA_MON_MAX
+ 1];
2730 if (!attrs
[TIPC_NLA_MON
])
2733 err
= nla_parse_nested_deprecated(mon
, TIPC_NLA_MON_MAX
,
2734 attrs
[TIPC_NLA_MON
],
2735 tipc_nl_monitor_policy
,
2740 if (!mon
[TIPC_NLA_MON_REF
])
2743 bearer_id
= nla_get_u32(mon
[TIPC_NLA_MON_REF
]);
2745 if (bearer_id
>= MAX_BEARERS
)
2753 msg
.portid
= NETLINK_CB(cb
->skb
).portid
;
2754 msg
.seq
= cb
->nlh
->nlmsg_seq
;
2757 err
= tipc_nl_add_monitor_peer(net
, &msg
, bearer_id
, &prev_node
);
2763 cb
->args
[1] = prev_node
;
2764 cb
->args
[2] = bearer_id
;
2769 #ifdef CONFIG_TIPC_CRYPTO
2770 static int tipc_nl_retrieve_key(struct nlattr
**attrs
,
2771 struct tipc_aead_key
**key
)
2773 struct nlattr
*attr
= attrs
[TIPC_NLA_NODE_KEY
];
2778 *key
= (struct tipc_aead_key
*)nla_data(attr
);
2779 if (nla_len(attr
) < tipc_aead_key_size(*key
))
2785 static int tipc_nl_retrieve_nodeid(struct nlattr
**attrs
, u8
**node_id
)
2787 struct nlattr
*attr
= attrs
[TIPC_NLA_NODE_ID
];
2792 if (nla_len(attr
) < TIPC_NODEID_LEN
)
2795 *node_id
= (u8
*)nla_data(attr
);
2799 int __tipc_nl_node_set_key(struct sk_buff
*skb
, struct genl_info
*info
)
2801 struct nlattr
*attrs
[TIPC_NLA_NODE_MAX
+ 1];
2802 struct net
*net
= sock_net(skb
->sk
);
2803 struct tipc_net
*tn
= tipc_net(net
);
2804 struct tipc_node
*n
= NULL
;
2805 struct tipc_aead_key
*ukey
;
2806 struct tipc_crypto
*c
;
2810 if (!info
->attrs
[TIPC_NLA_NODE
])
2813 rc
= nla_parse_nested(attrs
, TIPC_NLA_NODE_MAX
,
2814 info
->attrs
[TIPC_NLA_NODE
],
2815 tipc_nl_node_policy
, info
->extack
);
2819 own_id
= tipc_own_id(net
);
2825 rc
= tipc_nl_retrieve_key(attrs
, &ukey
);
2829 rc
= tipc_aead_key_validate(ukey
);
2833 rc
= tipc_nl_retrieve_nodeid(attrs
, &id
);
2836 /* Cluster key mode */
2837 rc
= tipc_crypto_key_init(tn
->crypto_tx
, ukey
, CLUSTER_KEY
);
2840 /* Per-node key mode */
2841 if (!memcmp(id
, own_id
, NODE_ID_LEN
)) {
2844 n
= tipc_node_find_by_id(net
, id
) ?:
2845 tipc_node_create(net
, 0, id
, 0xffffu
, 0, true);
2853 rc
= tipc_crypto_key_init(c
, ukey
, PER_NODE_KEY
);
2862 return (rc
< 0) ? rc
: 0;
2865 int tipc_nl_node_set_key(struct sk_buff
*skb
, struct genl_info
*info
)
2870 err
= __tipc_nl_node_set_key(skb
, info
);
2876 int __tipc_nl_node_flush_key(struct sk_buff
*skb
, struct genl_info
*info
)
2878 struct net
*net
= sock_net(skb
->sk
);
2879 struct tipc_net
*tn
= tipc_net(net
);
2880 struct tipc_node
*n
;
2882 tipc_crypto_key_flush(tn
->crypto_tx
);
2884 list_for_each_entry_rcu(n
, &tn
->node_list
, list
)
2885 tipc_crypto_key_flush(n
->crypto_rx
);
2888 pr_info("All keys are flushed!\n");
2892 int tipc_nl_node_flush_key(struct sk_buff
*skb
, struct genl_info
*info
)
2897 err
= __tipc_nl_node_flush_key(skb
, info
);
2905 * tipc_node_dump - dump TIPC node data
2906 * @n: tipc node to be dumped
2908 * - false: dump only tipc node data
2909 * - true: dump node link data as well
2910 * @buf: returned buffer of dump data in format
2912 int tipc_node_dump(struct tipc_node
*n
, bool more
, char *buf
)
2915 size_t sz
= (more
) ? NODE_LMAX
: NODE_LMIN
;
2918 i
+= scnprintf(buf
, sz
, "node data: (null)\n");
2922 i
+= scnprintf(buf
, sz
, "node data: %x", n
->addr
);
2923 i
+= scnprintf(buf
+ i
, sz
- i
, " %x", n
->state
);
2924 i
+= scnprintf(buf
+ i
, sz
- i
, " %d", n
->active_links
[0]);
2925 i
+= scnprintf(buf
+ i
, sz
- i
, " %d", n
->active_links
[1]);
2926 i
+= scnprintf(buf
+ i
, sz
- i
, " %x", n
->action_flags
);
2927 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", n
->failover_sent
);
2928 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", n
->sync_point
);
2929 i
+= scnprintf(buf
+ i
, sz
- i
, " %d", n
->link_cnt
);
2930 i
+= scnprintf(buf
+ i
, sz
- i
, " %u", n
->working_links
);
2931 i
+= scnprintf(buf
+ i
, sz
- i
, " %x", n
->capabilities
);
2932 i
+= scnprintf(buf
+ i
, sz
- i
, " %lu\n", n
->keepalive_intv
);
2937 i
+= scnprintf(buf
+ i
, sz
- i
, "link_entry[0]:\n");
2938 i
+= scnprintf(buf
+ i
, sz
- i
, " mtu: %u\n", n
->links
[0].mtu
);
2939 i
+= scnprintf(buf
+ i
, sz
- i
, " media: ");
2940 i
+= tipc_media_addr_printf(buf
+ i
, sz
- i
, &n
->links
[0].maddr
);
2941 i
+= scnprintf(buf
+ i
, sz
- i
, "\n");
2942 i
+= tipc_link_dump(n
->links
[0].link
, TIPC_DUMP_NONE
, buf
+ i
);
2943 i
+= scnprintf(buf
+ i
, sz
- i
, " inputq: ");
2944 i
+= tipc_list_dump(&n
->links
[0].inputq
, false, buf
+ i
);
2946 i
+= scnprintf(buf
+ i
, sz
- i
, "link_entry[1]:\n");
2947 i
+= scnprintf(buf
+ i
, sz
- i
, " mtu: %u\n", n
->links
[1].mtu
);
2948 i
+= scnprintf(buf
+ i
, sz
- i
, " media: ");
2949 i
+= tipc_media_addr_printf(buf
+ i
, sz
- i
, &n
->links
[1].maddr
);
2950 i
+= scnprintf(buf
+ i
, sz
- i
, "\n");
2951 i
+= tipc_link_dump(n
->links
[1].link
, TIPC_DUMP_NONE
, buf
+ i
);
2952 i
+= scnprintf(buf
+ i
, sz
- i
, " inputq: ");
2953 i
+= tipc_list_dump(&n
->links
[1].inputq
, false, buf
+ i
);
2955 i
+= scnprintf(buf
+ i
, sz
- i
, "bclink:\n ");
2956 i
+= tipc_link_dump(n
->bc_entry
.link
, TIPC_DUMP_NONE
, buf
+ i
);
2961 void tipc_node_pre_cleanup_net(struct net
*exit_net
)
2963 struct tipc_node
*n
;
2964 struct tipc_net
*tn
;
2968 for_each_net_rcu(tmp
) {
2969 if (tmp
== exit_net
)
2974 spin_lock_bh(&tn
->node_list_lock
);
2975 list_for_each_entry_rcu(n
, &tn
->node_list
, list
) {
2978 if (n
->peer_net
!= exit_net
)
2980 tipc_node_write_lock(n
);
2982 n
->peer_hash_mix
= 0;
2983 tipc_node_write_unlock_fast(n
);
2986 spin_unlock_bh(&tn
->node_list_lock
);