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"
47 #define INVALID_NODE_SIG 0x10000
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
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)
61 struct tipc_link_entry
{
62 struct tipc_link
*link
;
63 spinlock_t lock
; /* per link */
65 struct sk_buff_head inputq
;
66 struct tipc_media_addr maddr
;
69 struct 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
;
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
105 struct hlist_node hash
;
107 struct tipc_link_entry links
[MAX_BEARERS
];
108 struct tipc_bclink_entry bc_entry
;
110 struct list_head list
;
118 struct list_head publ_list
;
119 struct list_head conn_sks
;
120 unsigned long keepalive_intv
;
121 struct timer_list timer
;
125 /* Node FSM states and events:
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,
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
149 static void __tipc_node_link_down(struct tipc_node
*n
, int *bearer_id
,
150 struct sk_buff_head
*xmitq
,
151 struct tipc_media_addr
**maddr
);
152 static void tipc_node_link_down(struct tipc_node
*n
, int bearer_id
,
154 static void node_lost_contact(struct tipc_node
*n
, struct sk_buff_head
*inputq
);
155 static void tipc_node_delete(struct tipc_node
*node
);
156 static void tipc_node_timeout(unsigned long data
);
157 static void tipc_node_fsm_evt(struct tipc_node
*n
, int evt
);
158 static struct tipc_node
*tipc_node_find(struct net
*net
, u32 addr
);
159 static void tipc_node_put(struct tipc_node
*node
);
160 static bool tipc_node_is_up(struct tipc_node
*n
);
162 struct tipc_sock_conn
{
166 struct list_head list
;
169 static struct tipc_link
*node_active_link(struct tipc_node
*n
, int sel
)
171 int bearer_id
= n
->active_links
[sel
& 1];
173 if (unlikely(bearer_id
== INVALID_BEARER_ID
))
176 return n
->links
[bearer_id
].link
;
179 int tipc_node_get_mtu(struct net
*net
, u32 addr
, u32 sel
)
183 unsigned int mtu
= MAX_MSG_SIZE
;
185 n
= tipc_node_find(net
, addr
);
189 bearer_id
= n
->active_links
[sel
& 1];
190 if (likely(bearer_id
!= INVALID_BEARER_ID
))
191 mtu
= n
->links
[bearer_id
].mtu
;
196 u16
tipc_node_get_capabilities(struct net
*net
, u32 addr
)
201 n
= tipc_node_find(net
, addr
);
203 return TIPC_NODE_CAPABILITIES
;
204 caps
= n
->capabilities
;
209 static void tipc_node_kref_release(struct kref
*kref
)
211 struct tipc_node
*n
= container_of(kref
, struct tipc_node
, kref
);
213 kfree(n
->bc_entry
.link
);
217 static void tipc_node_put(struct tipc_node
*node
)
219 kref_put(&node
->kref
, tipc_node_kref_release
);
222 static void tipc_node_get(struct tipc_node
*node
)
224 kref_get(&node
->kref
);
228 * tipc_node_find - locate specified node object, if it exists
230 static struct tipc_node
*tipc_node_find(struct net
*net
, u32 addr
)
232 struct tipc_net
*tn
= tipc_net(net
);
233 struct tipc_node
*node
;
234 unsigned int thash
= tipc_hashfn(addr
);
236 if (unlikely(!in_own_cluster_exact(net
, addr
)))
240 hlist_for_each_entry_rcu(node
, &tn
->node_htable
[thash
], hash
) {
241 if (node
->addr
!= addr
)
243 if (!kref_get_unless_zero(&node
->kref
))
251 static void tipc_node_read_lock(struct tipc_node
*n
)
253 read_lock_bh(&n
->lock
);
256 static void tipc_node_read_unlock(struct tipc_node
*n
)
258 read_unlock_bh(&n
->lock
);
261 static void tipc_node_write_lock(struct tipc_node
*n
)
263 write_lock_bh(&n
->lock
);
266 static void tipc_node_write_unlock_fast(struct tipc_node
*n
)
268 write_unlock_bh(&n
->lock
);
271 static void tipc_node_write_unlock(struct tipc_node
*n
)
273 struct net
*net
= n
->net
;
275 u32 flags
= n
->action_flags
;
278 struct list_head
*publ_list
;
280 if (likely(!flags
)) {
281 write_unlock_bh(&n
->lock
);
286 link_id
= n
->link_id
;
287 bearer_id
= link_id
& 0xffff;
288 publ_list
= &n
->publ_list
;
290 n
->action_flags
&= ~(TIPC_NOTIFY_NODE_DOWN
| TIPC_NOTIFY_NODE_UP
|
291 TIPC_NOTIFY_LINK_DOWN
| TIPC_NOTIFY_LINK_UP
);
293 write_unlock_bh(&n
->lock
);
295 if (flags
& TIPC_NOTIFY_NODE_DOWN
)
296 tipc_publ_notify(net
, publ_list
, addr
);
298 if (flags
& TIPC_NOTIFY_NODE_UP
)
299 tipc_named_node_up(net
, addr
);
301 if (flags
& TIPC_NOTIFY_LINK_UP
) {
302 tipc_mon_peer_up(net
, addr
, bearer_id
);
303 tipc_nametbl_publish(net
, TIPC_LINK_STATE
, addr
, addr
,
304 TIPC_NODE_SCOPE
, link_id
, addr
);
306 if (flags
& TIPC_NOTIFY_LINK_DOWN
) {
307 tipc_mon_peer_down(net
, addr
, bearer_id
);
308 tipc_nametbl_withdraw(net
, TIPC_LINK_STATE
, addr
,
313 struct tipc_node
*tipc_node_create(struct net
*net
, u32 addr
, u16 capabilities
)
315 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
316 struct tipc_node
*n
, *temp_node
;
319 spin_lock_bh(&tn
->node_list_lock
);
320 n
= tipc_node_find(net
, addr
);
322 /* Same node may come back with new capabilities */
323 n
->capabilities
= capabilities
;
326 n
= kzalloc(sizeof(*n
), GFP_ATOMIC
);
328 pr_warn("Node creation failed, no memory\n");
333 n
->capabilities
= capabilities
;
335 rwlock_init(&n
->lock
);
336 INIT_HLIST_NODE(&n
->hash
);
337 INIT_LIST_HEAD(&n
->list
);
338 INIT_LIST_HEAD(&n
->publ_list
);
339 INIT_LIST_HEAD(&n
->conn_sks
);
340 skb_queue_head_init(&n
->bc_entry
.namedq
);
341 skb_queue_head_init(&n
->bc_entry
.inputq1
);
342 __skb_queue_head_init(&n
->bc_entry
.arrvq
);
343 skb_queue_head_init(&n
->bc_entry
.inputq2
);
344 for (i
= 0; i
< MAX_BEARERS
; i
++)
345 spin_lock_init(&n
->links
[i
].lock
);
346 n
->state
= SELF_DOWN_PEER_LEAVING
;
347 n
->signature
= INVALID_NODE_SIG
;
348 n
->active_links
[0] = INVALID_BEARER_ID
;
349 n
->active_links
[1] = INVALID_BEARER_ID
;
350 if (!tipc_link_bc_create(net
, tipc_own_addr(net
), n
->addr
,
352 tipc_link_window(tipc_bc_sndlink(net
)),
354 &n
->bc_entry
.inputq1
,
356 tipc_bc_sndlink(net
),
357 &n
->bc_entry
.link
)) {
358 pr_warn("Broadcast rcv link creation failed, no memory\n");
364 setup_timer(&n
->timer
, tipc_node_timeout
, (unsigned long)n
);
365 n
->keepalive_intv
= U32_MAX
;
366 hlist_add_head_rcu(&n
->hash
, &tn
->node_htable
[tipc_hashfn(addr
)]);
367 list_for_each_entry_rcu(temp_node
, &tn
->node_list
, list
) {
368 if (n
->addr
< temp_node
->addr
)
371 list_add_tail_rcu(&n
->list
, &temp_node
->list
);
373 spin_unlock_bh(&tn
->node_list_lock
);
377 static void tipc_node_calculate_timer(struct tipc_node
*n
, struct tipc_link
*l
)
379 unsigned long tol
= tipc_link_tolerance(l
);
380 unsigned long intv
= ((tol
/ 4) > 500) ? 500 : tol
/ 4;
382 /* Link with lowest tolerance determines timer interval */
383 if (intv
< n
->keepalive_intv
)
384 n
->keepalive_intv
= intv
;
386 /* Ensure link's abort limit corresponds to current tolerance */
387 tipc_link_set_abort_limit(l
, tol
/ n
->keepalive_intv
);
390 static void tipc_node_delete(struct tipc_node
*node
)
392 list_del_rcu(&node
->list
);
393 hlist_del_rcu(&node
->hash
);
396 del_timer_sync(&node
->timer
);
400 void tipc_node_stop(struct net
*net
)
402 struct tipc_net
*tn
= tipc_net(net
);
403 struct tipc_node
*node
, *t_node
;
405 spin_lock_bh(&tn
->node_list_lock
);
406 list_for_each_entry_safe(node
, t_node
, &tn
->node_list
, list
)
407 tipc_node_delete(node
);
408 spin_unlock_bh(&tn
->node_list_lock
);
411 void tipc_node_subscribe(struct net
*net
, struct list_head
*subscr
, u32 addr
)
415 if (in_own_node(net
, addr
))
418 n
= tipc_node_find(net
, addr
);
420 pr_warn("Node subscribe rejected, unknown node 0x%x\n", addr
);
423 tipc_node_write_lock(n
);
424 list_add_tail(subscr
, &n
->publ_list
);
425 tipc_node_write_unlock_fast(n
);
429 void tipc_node_unsubscribe(struct net
*net
, struct list_head
*subscr
, u32 addr
)
433 if (in_own_node(net
, addr
))
436 n
= tipc_node_find(net
, addr
);
438 pr_warn("Node unsubscribe rejected, unknown node 0x%x\n", addr
);
441 tipc_node_write_lock(n
);
442 list_del_init(subscr
);
443 tipc_node_write_unlock_fast(n
);
447 int tipc_node_add_conn(struct net
*net
, u32 dnode
, u32 port
, u32 peer_port
)
449 struct tipc_node
*node
;
450 struct tipc_sock_conn
*conn
;
453 if (in_own_node(net
, dnode
))
456 node
= tipc_node_find(net
, dnode
);
458 pr_warn("Connecting sock to node 0x%x failed\n", dnode
);
459 return -EHOSTUNREACH
;
461 conn
= kmalloc(sizeof(*conn
), GFP_ATOMIC
);
466 conn
->peer_node
= dnode
;
468 conn
->peer_port
= peer_port
;
470 tipc_node_write_lock(node
);
471 list_add_tail(&conn
->list
, &node
->conn_sks
);
472 tipc_node_write_unlock(node
);
478 void tipc_node_remove_conn(struct net
*net
, u32 dnode
, u32 port
)
480 struct tipc_node
*node
;
481 struct tipc_sock_conn
*conn
, *safe
;
483 if (in_own_node(net
, dnode
))
486 node
= tipc_node_find(net
, dnode
);
490 tipc_node_write_lock(node
);
491 list_for_each_entry_safe(conn
, safe
, &node
->conn_sks
, list
) {
492 if (port
!= conn
->port
)
494 list_del(&conn
->list
);
497 tipc_node_write_unlock(node
);
501 /* tipc_node_timeout - handle expiration of node timer
503 static void tipc_node_timeout(unsigned long data
)
505 struct tipc_node
*n
= (struct tipc_node
*)data
;
506 struct tipc_link_entry
*le
;
507 struct sk_buff_head xmitq
;
511 __skb_queue_head_init(&xmitq
);
513 for (bearer_id
= 0; bearer_id
< MAX_BEARERS
; bearer_id
++) {
514 tipc_node_read_lock(n
);
515 le
= &n
->links
[bearer_id
];
516 spin_lock_bh(&le
->lock
);
518 /* Link tolerance may change asynchronously: */
519 tipc_node_calculate_timer(n
, le
->link
);
520 rc
= tipc_link_timeout(le
->link
, &xmitq
);
522 spin_unlock_bh(&le
->lock
);
523 tipc_node_read_unlock(n
);
524 tipc_bearer_xmit(n
->net
, bearer_id
, &xmitq
, &le
->maddr
);
525 if (rc
& TIPC_LINK_DOWN_EVT
)
526 tipc_node_link_down(n
, bearer_id
, false);
528 mod_timer(&n
->timer
, jiffies
+ msecs_to_jiffies(n
->keepalive_intv
));
532 * __tipc_node_link_up - handle addition of link
533 * Node lock must be held by caller
534 * Link becomes active (alone or shared) or standby, depending on its priority.
536 static void __tipc_node_link_up(struct tipc_node
*n
, int bearer_id
,
537 struct sk_buff_head
*xmitq
)
539 int *slot0
= &n
->active_links
[0];
540 int *slot1
= &n
->active_links
[1];
541 struct tipc_link
*ol
= node_active_link(n
, 0);
542 struct tipc_link
*nl
= n
->links
[bearer_id
].link
;
544 if (!nl
|| tipc_link_is_up(nl
))
547 tipc_link_fsm_evt(nl
, LINK_ESTABLISH_EVT
);
548 if (!tipc_link_is_up(nl
))
552 n
->action_flags
|= TIPC_NOTIFY_LINK_UP
;
553 n
->link_id
= tipc_link_id(nl
);
555 /* Leave room for tunnel header when returning 'mtu' to users: */
556 n
->links
[bearer_id
].mtu
= tipc_link_mtu(nl
) - INT_H_SIZE
;
558 tipc_bearer_add_dest(n
->net
, bearer_id
, n
->addr
);
559 tipc_bcast_inc_bearer_dst_cnt(n
->net
, bearer_id
);
561 pr_debug("Established link <%s> on network plane %c\n",
562 tipc_link_name(nl
), tipc_link_plane(nl
));
564 /* Ensure that a STATE message goes first */
565 tipc_link_build_state_msg(nl
, xmitq
);
567 /* First link? => give it both slots */
571 tipc_node_fsm_evt(n
, SELF_ESTABL_CONTACT_EVT
);
572 n
->action_flags
|= TIPC_NOTIFY_NODE_UP
;
573 tipc_link_set_active(nl
, true);
574 tipc_bcast_add_peer(n
->net
, nl
, xmitq
);
578 /* Second link => redistribute slots */
579 if (tipc_link_prio(nl
) > tipc_link_prio(ol
)) {
580 pr_debug("Old link <%s> becomes standby\n", tipc_link_name(ol
));
583 tipc_link_set_active(nl
, true);
584 tipc_link_set_active(ol
, false);
585 } else if (tipc_link_prio(nl
) == tipc_link_prio(ol
)) {
586 tipc_link_set_active(nl
, true);
589 pr_debug("New link <%s> is standby\n", tipc_link_name(nl
));
592 /* Prepare synchronization with first link */
593 tipc_link_tnl_prepare(ol
, nl
, SYNCH_MSG
, xmitq
);
597 * tipc_node_link_up - handle addition of link
599 * Link becomes active (alone or shared) or standby, depending on its priority.
601 static void tipc_node_link_up(struct tipc_node
*n
, int bearer_id
,
602 struct sk_buff_head
*xmitq
)
604 struct tipc_media_addr
*maddr
;
606 tipc_node_write_lock(n
);
607 __tipc_node_link_up(n
, bearer_id
, xmitq
);
608 maddr
= &n
->links
[bearer_id
].maddr
;
609 tipc_bearer_xmit(n
->net
, bearer_id
, xmitq
, maddr
);
610 tipc_node_write_unlock(n
);
614 * __tipc_node_link_down - handle loss of link
616 static void __tipc_node_link_down(struct tipc_node
*n
, int *bearer_id
,
617 struct sk_buff_head
*xmitq
,
618 struct tipc_media_addr
**maddr
)
620 struct tipc_link_entry
*le
= &n
->links
[*bearer_id
];
621 int *slot0
= &n
->active_links
[0];
622 int *slot1
= &n
->active_links
[1];
623 int i
, highest
= 0, prio
;
624 struct tipc_link
*l
, *_l
, *tnl
;
626 l
= n
->links
[*bearer_id
].link
;
627 if (!l
|| tipc_link_is_reset(l
))
631 n
->action_flags
|= TIPC_NOTIFY_LINK_DOWN
;
632 n
->link_id
= tipc_link_id(l
);
634 tipc_bearer_remove_dest(n
->net
, *bearer_id
, n
->addr
);
636 pr_debug("Lost link <%s> on network plane %c\n",
637 tipc_link_name(l
), tipc_link_plane(l
));
639 /* Select new active link if any available */
640 *slot0
= INVALID_BEARER_ID
;
641 *slot1
= INVALID_BEARER_ID
;
642 for (i
= 0; i
< MAX_BEARERS
; i
++) {
643 _l
= n
->links
[i
].link
;
644 if (!_l
|| !tipc_link_is_up(_l
))
648 prio
= tipc_link_prio(_l
);
651 if (prio
> highest
) {
660 if (!tipc_node_is_up(n
)) {
661 if (tipc_link_peer_is_down(l
))
662 tipc_node_fsm_evt(n
, PEER_LOST_CONTACT_EVT
);
663 tipc_node_fsm_evt(n
, SELF_LOST_CONTACT_EVT
);
664 tipc_link_fsm_evt(l
, LINK_RESET_EVT
);
666 tipc_link_build_reset_msg(l
, xmitq
);
667 *maddr
= &n
->links
[*bearer_id
].maddr
;
668 node_lost_contact(n
, &le
->inputq
);
669 tipc_bcast_dec_bearer_dst_cnt(n
->net
, *bearer_id
);
672 tipc_bcast_dec_bearer_dst_cnt(n
->net
, *bearer_id
);
674 /* There is still a working link => initiate failover */
675 *bearer_id
= n
->active_links
[0];
676 tnl
= n
->links
[*bearer_id
].link
;
677 tipc_link_fsm_evt(tnl
, LINK_SYNCH_END_EVT
);
678 tipc_node_fsm_evt(n
, NODE_SYNCH_END_EVT
);
679 n
->sync_point
= tipc_link_rcv_nxt(tnl
) + (U16_MAX
/ 2 - 1);
680 tipc_link_tnl_prepare(l
, tnl
, FAILOVER_MSG
, xmitq
);
682 tipc_link_fsm_evt(l
, LINK_RESET_EVT
);
683 tipc_link_fsm_evt(l
, LINK_FAILOVER_BEGIN_EVT
);
684 tipc_node_fsm_evt(n
, NODE_FAILOVER_BEGIN_EVT
);
685 *maddr
= &n
->links
[*bearer_id
].maddr
;
688 static void tipc_node_link_down(struct tipc_node
*n
, int bearer_id
, bool delete)
690 struct tipc_link_entry
*le
= &n
->links
[bearer_id
];
691 struct tipc_link
*l
= le
->link
;
692 struct tipc_media_addr
*maddr
;
693 struct sk_buff_head xmitq
;
694 int old_bearer_id
= bearer_id
;
699 __skb_queue_head_init(&xmitq
);
701 tipc_node_write_lock(n
);
702 if (!tipc_link_is_establishing(l
)) {
703 __tipc_node_link_down(n
, &bearer_id
, &xmitq
, &maddr
);
710 /* Defuse pending tipc_node_link_up() */
711 tipc_link_fsm_evt(l
, LINK_RESET_EVT
);
713 tipc_node_write_unlock(n
);
715 tipc_mon_remove_peer(n
->net
, n
->addr
, old_bearer_id
);
716 tipc_bearer_xmit(n
->net
, bearer_id
, &xmitq
, maddr
);
717 tipc_sk_rcv(n
->net
, &le
->inputq
);
720 static bool tipc_node_is_up(struct tipc_node
*n
)
722 return n
->active_links
[0] != INVALID_BEARER_ID
;
725 void tipc_node_check_dest(struct net
*net
, u32 onode
,
726 struct tipc_bearer
*b
,
727 u16 capabilities
, u32 signature
,
728 struct tipc_media_addr
*maddr
,
729 bool *respond
, bool *dupl_addr
)
733 struct tipc_link_entry
*le
;
734 bool addr_match
= false;
735 bool sign_match
= false;
736 bool link_up
= false;
737 bool accept_addr
= false;
745 n
= tipc_node_create(net
, onode
, capabilities
);
749 tipc_node_write_lock(n
);
751 le
= &n
->links
[b
->identity
];
753 /* Prepare to validate requesting node's signature and media address */
755 link_up
= l
&& tipc_link_is_up(l
);
756 addr_match
= l
&& !memcmp(&le
->maddr
, maddr
, sizeof(*maddr
));
757 sign_match
= (signature
== n
->signature
);
759 /* These three flags give us eight permutations: */
761 if (sign_match
&& addr_match
&& link_up
) {
762 /* All is fine. Do nothing. */
764 } else if (sign_match
&& addr_match
&& !link_up
) {
765 /* Respond. The link will come up in due time */
767 } else if (sign_match
&& !addr_match
&& link_up
) {
768 /* Peer has changed i/f address without rebooting.
769 * If so, the link will reset soon, and the next
770 * discovery will be accepted. So we can ignore it.
771 * It may also be an cloned or malicious peer having
772 * chosen the same node address and signature as an
774 * Ignore requests until the link goes down, if ever.
777 } else if (sign_match
&& !addr_match
&& !link_up
) {
778 /* Peer link has changed i/f address without rebooting.
779 * It may also be a cloned or malicious peer; we can't
780 * distinguish between the two.
781 * The signature is correct, so we must accept.
785 } else if (!sign_match
&& addr_match
&& link_up
) {
786 /* Peer node rebooted. Two possibilities:
787 * - Delayed re-discovery; this link endpoint has already
788 * reset and re-established contact with the peer, before
789 * receiving a discovery message from that node.
790 * (The peer happened to receive one from this node first).
791 * - The peer came back so fast that our side has not
792 * discovered it yet. Probing from this side will soon
793 * reset the link, since there can be no working link
794 * endpoint at the peer end, and the link will re-establish.
795 * Accept the signature, since it comes from a known peer.
797 n
->signature
= signature
;
798 } else if (!sign_match
&& addr_match
&& !link_up
) {
799 /* The peer node has rebooted.
800 * Accept signature, since it is a known peer.
802 n
->signature
= signature
;
804 } else if (!sign_match
&& !addr_match
&& link_up
) {
805 /* Peer rebooted with new address, or a new/duplicate peer.
806 * Ignore until the link goes down, if ever.
809 } else if (!sign_match
&& !addr_match
&& !link_up
) {
810 /* Peer rebooted with new address, or it is a new peer.
811 * Accept signature and address.
813 n
->signature
= signature
;
821 /* Now create new link if not already existing */
823 if (n
->link_cnt
== 2) {
824 pr_warn("Cannot establish 3rd link to %x\n", n
->addr
);
827 if_name
= strchr(b
->name
, ':') + 1;
828 if (!tipc_link_create(net
, if_name
, b
->identity
, b
->tolerance
,
829 b
->net_plane
, b
->mtu
, b
->priority
,
830 b
->window
, mod(tipc_net(net
)->random
),
831 tipc_own_addr(net
), onode
,
833 tipc_bc_sndlink(n
->net
), n
->bc_entry
.link
,
835 &n
->bc_entry
.namedq
, &l
)) {
840 tipc_link_fsm_evt(l
, LINK_RESET_EVT
);
841 if (n
->state
== NODE_FAILINGOVER
)
842 tipc_link_fsm_evt(l
, LINK_FAILOVER_BEGIN_EVT
);
845 tipc_node_calculate_timer(n
, l
);
846 if (n
->link_cnt
== 1) {
847 intv
= jiffies
+ msecs_to_jiffies(n
->keepalive_intv
);
848 if (!mod_timer(&n
->timer
, intv
))
852 memcpy(&le
->maddr
, maddr
, sizeof(*maddr
));
854 tipc_node_write_unlock(n
);
855 if (reset
&& l
&& !tipc_link_is_reset(l
))
856 tipc_node_link_down(n
, b
->identity
, false);
860 void tipc_node_delete_links(struct net
*net
, int bearer_id
)
862 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
866 list_for_each_entry_rcu(n
, &tn
->node_list
, list
) {
867 tipc_node_link_down(n
, bearer_id
, true);
872 static void tipc_node_reset_links(struct tipc_node
*n
)
874 char addr_string
[16];
877 pr_warn("Resetting all links to %s\n",
878 tipc_addr_string_fill(addr_string
, n
->addr
));
880 for (i
= 0; i
< MAX_BEARERS
; i
++) {
881 tipc_node_link_down(n
, i
, false);
885 /* tipc_node_fsm_evt - node finite state machine
886 * Determines when contact is allowed with peer node
888 static void tipc_node_fsm_evt(struct tipc_node
*n
, int evt
)
890 int state
= n
->state
;
893 case SELF_DOWN_PEER_DOWN
:
895 case SELF_ESTABL_CONTACT_EVT
:
896 state
= SELF_UP_PEER_COMING
;
898 case PEER_ESTABL_CONTACT_EVT
:
899 state
= SELF_COMING_PEER_UP
;
901 case SELF_LOST_CONTACT_EVT
:
902 case PEER_LOST_CONTACT_EVT
:
904 case NODE_SYNCH_END_EVT
:
905 case NODE_SYNCH_BEGIN_EVT
:
906 case NODE_FAILOVER_BEGIN_EVT
:
907 case NODE_FAILOVER_END_EVT
:
912 case SELF_UP_PEER_UP
:
914 case SELF_LOST_CONTACT_EVT
:
915 state
= SELF_DOWN_PEER_LEAVING
;
917 case PEER_LOST_CONTACT_EVT
:
918 state
= SELF_LEAVING_PEER_DOWN
;
920 case NODE_SYNCH_BEGIN_EVT
:
921 state
= NODE_SYNCHING
;
923 case NODE_FAILOVER_BEGIN_EVT
:
924 state
= NODE_FAILINGOVER
;
926 case SELF_ESTABL_CONTACT_EVT
:
927 case PEER_ESTABL_CONTACT_EVT
:
928 case NODE_SYNCH_END_EVT
:
929 case NODE_FAILOVER_END_EVT
:
935 case SELF_DOWN_PEER_LEAVING
:
937 case PEER_LOST_CONTACT_EVT
:
938 state
= SELF_DOWN_PEER_DOWN
;
940 case SELF_ESTABL_CONTACT_EVT
:
941 case PEER_ESTABL_CONTACT_EVT
:
942 case SELF_LOST_CONTACT_EVT
:
944 case NODE_SYNCH_END_EVT
:
945 case NODE_SYNCH_BEGIN_EVT
:
946 case NODE_FAILOVER_BEGIN_EVT
:
947 case NODE_FAILOVER_END_EVT
:
952 case SELF_UP_PEER_COMING
:
954 case PEER_ESTABL_CONTACT_EVT
:
955 state
= SELF_UP_PEER_UP
;
957 case SELF_LOST_CONTACT_EVT
:
958 state
= SELF_DOWN_PEER_DOWN
;
960 case SELF_ESTABL_CONTACT_EVT
:
961 case PEER_LOST_CONTACT_EVT
:
962 case NODE_SYNCH_END_EVT
:
963 case NODE_FAILOVER_BEGIN_EVT
:
965 case NODE_SYNCH_BEGIN_EVT
:
966 case NODE_FAILOVER_END_EVT
:
971 case SELF_COMING_PEER_UP
:
973 case SELF_ESTABL_CONTACT_EVT
:
974 state
= SELF_UP_PEER_UP
;
976 case PEER_LOST_CONTACT_EVT
:
977 state
= SELF_DOWN_PEER_DOWN
;
979 case SELF_LOST_CONTACT_EVT
:
980 case PEER_ESTABL_CONTACT_EVT
:
982 case NODE_SYNCH_END_EVT
:
983 case NODE_SYNCH_BEGIN_EVT
:
984 case NODE_FAILOVER_BEGIN_EVT
:
985 case NODE_FAILOVER_END_EVT
:
990 case SELF_LEAVING_PEER_DOWN
:
992 case SELF_LOST_CONTACT_EVT
:
993 state
= SELF_DOWN_PEER_DOWN
;
995 case SELF_ESTABL_CONTACT_EVT
:
996 case PEER_ESTABL_CONTACT_EVT
:
997 case PEER_LOST_CONTACT_EVT
:
999 case NODE_SYNCH_END_EVT
:
1000 case NODE_SYNCH_BEGIN_EVT
:
1001 case NODE_FAILOVER_BEGIN_EVT
:
1002 case NODE_FAILOVER_END_EVT
:
1007 case NODE_FAILINGOVER
:
1009 case SELF_LOST_CONTACT_EVT
:
1010 state
= SELF_DOWN_PEER_LEAVING
;
1012 case PEER_LOST_CONTACT_EVT
:
1013 state
= SELF_LEAVING_PEER_DOWN
;
1015 case NODE_FAILOVER_END_EVT
:
1016 state
= SELF_UP_PEER_UP
;
1018 case NODE_FAILOVER_BEGIN_EVT
:
1019 case SELF_ESTABL_CONTACT_EVT
:
1020 case PEER_ESTABL_CONTACT_EVT
:
1022 case NODE_SYNCH_BEGIN_EVT
:
1023 case NODE_SYNCH_END_EVT
:
1030 case SELF_LOST_CONTACT_EVT
:
1031 state
= SELF_DOWN_PEER_LEAVING
;
1033 case PEER_LOST_CONTACT_EVT
:
1034 state
= SELF_LEAVING_PEER_DOWN
;
1036 case NODE_SYNCH_END_EVT
:
1037 state
= SELF_UP_PEER_UP
;
1039 case NODE_FAILOVER_BEGIN_EVT
:
1040 state
= NODE_FAILINGOVER
;
1042 case NODE_SYNCH_BEGIN_EVT
:
1043 case SELF_ESTABL_CONTACT_EVT
:
1044 case PEER_ESTABL_CONTACT_EVT
:
1046 case NODE_FAILOVER_END_EVT
:
1052 pr_err("Unknown node fsm state %x\n", state
);
1059 pr_err("Illegal node fsm evt %x in state %x\n", evt
, state
);
1062 static void node_lost_contact(struct tipc_node
*n
,
1063 struct sk_buff_head
*inputq
)
1065 char addr_string
[16];
1066 struct tipc_sock_conn
*conn
, *safe
;
1067 struct tipc_link
*l
;
1068 struct list_head
*conns
= &n
->conn_sks
;
1069 struct sk_buff
*skb
;
1072 pr_debug("Lost contact with %s\n",
1073 tipc_addr_string_fill(addr_string
, n
->addr
));
1075 /* Clean up broadcast state */
1076 tipc_bcast_remove_peer(n
->net
, n
->bc_entry
.link
);
1078 /* Abort any ongoing link failover */
1079 for (i
= 0; i
< MAX_BEARERS
; i
++) {
1080 l
= n
->links
[i
].link
;
1082 tipc_link_fsm_evt(l
, LINK_FAILOVER_END_EVT
);
1085 /* Notify publications from this node */
1086 n
->action_flags
|= TIPC_NOTIFY_NODE_DOWN
;
1088 /* Notify sockets connected to node */
1089 list_for_each_entry_safe(conn
, safe
, conns
, list
) {
1090 skb
= tipc_msg_create(TIPC_CRITICAL_IMPORTANCE
, TIPC_CONN_MSG
,
1091 SHORT_H_SIZE
, 0, tipc_own_addr(n
->net
),
1092 conn
->peer_node
, conn
->port
,
1093 conn
->peer_port
, TIPC_ERR_NO_NODE
);
1095 skb_queue_tail(inputq
, skb
);
1096 list_del(&conn
->list
);
1102 * tipc_node_get_linkname - get the name of a link
1104 * @bearer_id: id of the bearer
1105 * @node: peer node address
1106 * @linkname: link name output buffer
1108 * Returns 0 on success
1110 int tipc_node_get_linkname(struct net
*net
, u32 bearer_id
, u32 addr
,
1111 char *linkname
, size_t len
)
1113 struct tipc_link
*link
;
1115 struct tipc_node
*node
= tipc_node_find(net
, addr
);
1120 if (bearer_id
>= MAX_BEARERS
)
1123 tipc_node_read_lock(node
);
1124 link
= node
->links
[bearer_id
].link
;
1126 strncpy(linkname
, tipc_link_name(link
), len
);
1129 tipc_node_read_unlock(node
);
1131 tipc_node_put(node
);
1135 /* Caller should hold node lock for the passed node */
1136 static int __tipc_nl_add_node(struct tipc_nl_msg
*msg
, struct tipc_node
*node
)
1139 struct nlattr
*attrs
;
1141 hdr
= genlmsg_put(msg
->skb
, msg
->portid
, msg
->seq
, &tipc_genl_family
,
1142 NLM_F_MULTI
, TIPC_NL_NODE_GET
);
1146 attrs
= nla_nest_start(msg
->skb
, TIPC_NLA_NODE
);
1150 if (nla_put_u32(msg
->skb
, TIPC_NLA_NODE_ADDR
, node
->addr
))
1152 if (tipc_node_is_up(node
))
1153 if (nla_put_flag(msg
->skb
, TIPC_NLA_NODE_UP
))
1156 nla_nest_end(msg
->skb
, attrs
);
1157 genlmsg_end(msg
->skb
, hdr
);
1162 nla_nest_cancel(msg
->skb
, attrs
);
1164 genlmsg_cancel(msg
->skb
, hdr
);
1170 * tipc_node_xmit() is the general link level function for message sending
1171 * @net: the applicable net namespace
1172 * @list: chain of buffers containing message
1173 * @dnode: address of destination node
1174 * @selector: a number used for deterministic link selection
1175 * Consumes the buffer chain.
1176 * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
1178 int tipc_node_xmit(struct net
*net
, struct sk_buff_head
*list
,
1179 u32 dnode
, int selector
)
1181 struct tipc_link_entry
*le
= NULL
;
1182 struct tipc_node
*n
;
1183 struct sk_buff_head xmitq
;
1187 if (in_own_node(net
, dnode
)) {
1188 tipc_sk_rcv(net
, list
);
1192 n
= tipc_node_find(net
, dnode
);
1194 skb_queue_purge(list
);
1195 return -EHOSTUNREACH
;
1198 tipc_node_read_lock(n
);
1199 bearer_id
= n
->active_links
[selector
& 1];
1200 if (unlikely(bearer_id
== INVALID_BEARER_ID
)) {
1201 tipc_node_read_unlock(n
);
1203 skb_queue_purge(list
);
1204 return -EHOSTUNREACH
;
1207 __skb_queue_head_init(&xmitq
);
1208 le
= &n
->links
[bearer_id
];
1209 spin_lock_bh(&le
->lock
);
1210 rc
= tipc_link_xmit(le
->link
, list
, &xmitq
);
1211 spin_unlock_bh(&le
->lock
);
1212 tipc_node_read_unlock(n
);
1214 if (unlikely(rc
== -ENOBUFS
))
1215 tipc_node_link_down(n
, bearer_id
, false);
1217 tipc_bearer_xmit(net
, bearer_id
, &xmitq
, &le
->maddr
);
1224 /* tipc_node_xmit_skb(): send single buffer to destination
1225 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1226 * messages, which will not be rejected
1227 * The only exception is datagram messages rerouted after secondary
1228 * lookup, which are rare and safe to dispose of anyway.
1230 int tipc_node_xmit_skb(struct net
*net
, struct sk_buff
*skb
, u32 dnode
,
1233 struct sk_buff_head head
;
1235 skb_queue_head_init(&head
);
1236 __skb_queue_tail(&head
, skb
);
1237 tipc_node_xmit(net
, &head
, dnode
, selector
);
1241 void tipc_node_broadcast(struct net
*net
, struct sk_buff
*skb
)
1243 struct sk_buff
*txskb
;
1244 struct tipc_node
*n
;
1248 list_for_each_entry_rcu(n
, tipc_nodes(net
), list
) {
1250 if (in_own_node(net
, dst
))
1252 if (!tipc_node_is_up(n
))
1254 txskb
= pskb_copy(skb
, GFP_ATOMIC
);
1257 msg_set_destnode(buf_msg(txskb
), dst
);
1258 tipc_node_xmit_skb(net
, txskb
, dst
, 0);
1265 static void tipc_node_mcast_rcv(struct tipc_node
*n
)
1267 struct tipc_bclink_entry
*be
= &n
->bc_entry
;
1269 /* 'arrvq' is under inputq2's lock protection */
1270 spin_lock_bh(&be
->inputq2
.lock
);
1271 spin_lock_bh(&be
->inputq1
.lock
);
1272 skb_queue_splice_tail_init(&be
->inputq1
, &be
->arrvq
);
1273 spin_unlock_bh(&be
->inputq1
.lock
);
1274 spin_unlock_bh(&be
->inputq2
.lock
);
1275 tipc_sk_mcast_rcv(n
->net
, &be
->arrvq
, &be
->inputq2
);
1278 static void tipc_node_bc_sync_rcv(struct tipc_node
*n
, struct tipc_msg
*hdr
,
1279 int bearer_id
, struct sk_buff_head
*xmitq
)
1281 struct tipc_link
*ucl
;
1284 rc
= tipc_bcast_sync_rcv(n
->net
, n
->bc_entry
.link
, hdr
);
1286 if (rc
& TIPC_LINK_DOWN_EVT
) {
1287 tipc_node_reset_links(n
);
1291 if (!(rc
& TIPC_LINK_SND_STATE
))
1294 /* If probe message, a STATE response will be sent anyway */
1298 /* Produce a STATE message carrying broadcast NACK */
1299 tipc_node_read_lock(n
);
1300 ucl
= n
->links
[bearer_id
].link
;
1302 tipc_link_build_state_msg(ucl
, xmitq
);
1303 tipc_node_read_unlock(n
);
1307 * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1308 * @net: the applicable net namespace
1310 * @bearer_id: id of bearer message arrived on
1312 * Invoked with no locks held.
1314 static void tipc_node_bc_rcv(struct net
*net
, struct sk_buff
*skb
, int bearer_id
)
1317 struct sk_buff_head xmitq
;
1318 struct tipc_bclink_entry
*be
;
1319 struct tipc_link_entry
*le
;
1320 struct tipc_msg
*hdr
= buf_msg(skb
);
1321 int usr
= msg_user(hdr
);
1322 u32 dnode
= msg_destnode(hdr
);
1323 struct tipc_node
*n
;
1325 __skb_queue_head_init(&xmitq
);
1327 /* If NACK for other node, let rcv link for that node peek into it */
1328 if ((usr
== BCAST_PROTOCOL
) && (dnode
!= tipc_own_addr(net
)))
1329 n
= tipc_node_find(net
, dnode
);
1331 n
= tipc_node_find(net
, msg_prevnode(hdr
));
1337 le
= &n
->links
[bearer_id
];
1339 rc
= tipc_bcast_rcv(net
, be
->link
, skb
);
1341 /* Broadcast ACKs are sent on a unicast link */
1342 if (rc
& TIPC_LINK_SND_STATE
) {
1343 tipc_node_read_lock(n
);
1344 tipc_link_build_state_msg(le
->link
, &xmitq
);
1345 tipc_node_read_unlock(n
);
1348 if (!skb_queue_empty(&xmitq
))
1349 tipc_bearer_xmit(net
, bearer_id
, &xmitq
, &le
->maddr
);
1351 if (!skb_queue_empty(&be
->inputq1
))
1352 tipc_node_mcast_rcv(n
);
1354 /* If reassembly or retransmission failure => reset all links to peer */
1355 if (rc
& TIPC_LINK_DOWN_EVT
)
1356 tipc_node_reset_links(n
);
1362 * tipc_node_check_state - check and if necessary update node state
1364 * @bearer_id: identity of bearer delivering the packet
1365 * Returns true if state is ok, otherwise consumes buffer and returns false
1367 static bool tipc_node_check_state(struct tipc_node
*n
, struct sk_buff
*skb
,
1368 int bearer_id
, struct sk_buff_head
*xmitq
)
1370 struct tipc_msg
*hdr
= buf_msg(skb
);
1371 int usr
= msg_user(hdr
);
1372 int mtyp
= msg_type(hdr
);
1373 u16 oseqno
= msg_seqno(hdr
);
1374 u16 iseqno
= msg_seqno(msg_get_wrapped(hdr
));
1375 u16 exp_pkts
= msg_msgcnt(hdr
);
1376 u16 rcv_nxt
, syncpt
, dlv_nxt
, inputq_len
;
1377 int state
= n
->state
;
1378 struct tipc_link
*l
, *tnl
, *pl
= NULL
;
1379 struct tipc_media_addr
*maddr
;
1382 l
= n
->links
[bearer_id
].link
;
1385 rcv_nxt
= tipc_link_rcv_nxt(l
);
1388 if (likely((state
== SELF_UP_PEER_UP
) && (usr
!= TUNNEL_PROTOCOL
)))
1391 /* Find parallel link, if any */
1392 for (pb_id
= 0; pb_id
< MAX_BEARERS
; pb_id
++) {
1393 if ((pb_id
!= bearer_id
) && n
->links
[pb_id
].link
) {
1394 pl
= n
->links
[pb_id
].link
;
1399 /* Check and update node accesibility if applicable */
1400 if (state
== SELF_UP_PEER_COMING
) {
1401 if (!tipc_link_is_up(l
))
1403 if (!msg_peer_link_is_up(hdr
))
1405 tipc_node_fsm_evt(n
, PEER_ESTABL_CONTACT_EVT
);
1408 if (state
== SELF_DOWN_PEER_LEAVING
) {
1409 if (msg_peer_node_is_up(hdr
))
1411 tipc_node_fsm_evt(n
, PEER_LOST_CONTACT_EVT
);
1415 if (state
== SELF_LEAVING_PEER_DOWN
)
1418 /* Ignore duplicate packets */
1419 if ((usr
!= LINK_PROTOCOL
) && less(oseqno
, rcv_nxt
))
1422 /* Initiate or update failover mode if applicable */
1423 if ((usr
== TUNNEL_PROTOCOL
) && (mtyp
== FAILOVER_MSG
)) {
1424 syncpt
= oseqno
+ exp_pkts
- 1;
1425 if (pl
&& tipc_link_is_up(pl
)) {
1426 __tipc_node_link_down(n
, &pb_id
, xmitq
, &maddr
);
1427 tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl
),
1428 tipc_link_inputq(l
));
1430 /* If pkts arrive out of order, use lowest calculated syncpt */
1431 if (less(syncpt
, n
->sync_point
))
1432 n
->sync_point
= syncpt
;
1435 /* Open parallel link when tunnel link reaches synch point */
1436 if ((n
->state
== NODE_FAILINGOVER
) && tipc_link_is_up(l
)) {
1437 if (!more(rcv_nxt
, n
->sync_point
))
1439 tipc_node_fsm_evt(n
, NODE_FAILOVER_END_EVT
);
1441 tipc_link_fsm_evt(pl
, LINK_FAILOVER_END_EVT
);
1445 /* No synching needed if only one link */
1446 if (!pl
|| !tipc_link_is_up(pl
))
1449 /* Initiate synch mode if applicable */
1450 if ((usr
== TUNNEL_PROTOCOL
) && (mtyp
== SYNCH_MSG
) && (oseqno
== 1)) {
1451 syncpt
= iseqno
+ exp_pkts
- 1;
1452 if (!tipc_link_is_up(l
))
1453 __tipc_node_link_up(n
, bearer_id
, xmitq
);
1454 if (n
->state
== SELF_UP_PEER_UP
) {
1455 n
->sync_point
= syncpt
;
1456 tipc_link_fsm_evt(l
, LINK_SYNCH_BEGIN_EVT
);
1457 tipc_node_fsm_evt(n
, NODE_SYNCH_BEGIN_EVT
);
1461 /* Open tunnel link when parallel link reaches synch point */
1462 if (n
->state
== NODE_SYNCHING
) {
1463 if (tipc_link_is_synching(l
)) {
1469 inputq_len
= skb_queue_len(tipc_link_inputq(pl
));
1470 dlv_nxt
= tipc_link_rcv_nxt(pl
) - inputq_len
;
1471 if (more(dlv_nxt
, n
->sync_point
)) {
1472 tipc_link_fsm_evt(tnl
, LINK_SYNCH_END_EVT
);
1473 tipc_node_fsm_evt(n
, NODE_SYNCH_END_EVT
);
1478 if ((usr
== TUNNEL_PROTOCOL
) && (mtyp
== SYNCH_MSG
))
1480 if (usr
== LINK_PROTOCOL
)
1488 * tipc_rcv - process TIPC packets/messages arriving from off-node
1489 * @net: the applicable net namespace
1491 * @bearer: pointer to bearer message arrived on
1493 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1494 * structure (i.e. cannot be NULL), but bearer can be inactive.
1496 void tipc_rcv(struct net
*net
, struct sk_buff
*skb
, struct tipc_bearer
*b
)
1498 struct sk_buff_head xmitq
;
1499 struct tipc_node
*n
;
1500 struct tipc_msg
*hdr
;
1501 int bearer_id
= b
->identity
;
1502 struct tipc_link_entry
*le
;
1503 u32 self
= tipc_own_addr(net
);
1507 __skb_queue_head_init(&xmitq
);
1509 /* Ensure message is well-formed before touching the header */
1510 if (unlikely(!tipc_msg_validate(skb
)))
1513 usr
= msg_user(hdr
);
1514 bc_ack
= msg_bcast_ack(hdr
);
1516 /* Handle arrival of discovery or broadcast packet */
1517 if (unlikely(msg_non_seq(hdr
))) {
1518 if (unlikely(usr
== LINK_CONFIG
))
1519 return tipc_disc_rcv(net
, skb
, b
);
1521 return tipc_node_bc_rcv(net
, skb
, bearer_id
);
1524 /* Discard unicast link messages destined for another node */
1525 if (unlikely(!msg_short(hdr
) && (msg_destnode(hdr
) != self
)))
1528 /* Locate neighboring node that sent packet */
1529 n
= tipc_node_find(net
, msg_prevnode(hdr
));
1532 le
= &n
->links
[bearer_id
];
1534 /* Ensure broadcast reception is in synch with peer's send state */
1535 if (unlikely(usr
== LINK_PROTOCOL
))
1536 tipc_node_bc_sync_rcv(n
, hdr
, bearer_id
, &xmitq
);
1537 else if (unlikely(tipc_link_acked(n
->bc_entry
.link
) != bc_ack
))
1538 tipc_bcast_ack_rcv(net
, n
->bc_entry
.link
, hdr
);
1540 /* Receive packet directly if conditions permit */
1541 tipc_node_read_lock(n
);
1542 if (likely((n
->state
== SELF_UP_PEER_UP
) && (usr
!= TUNNEL_PROTOCOL
))) {
1543 spin_lock_bh(&le
->lock
);
1545 rc
= tipc_link_rcv(le
->link
, skb
, &xmitq
);
1548 spin_unlock_bh(&le
->lock
);
1550 tipc_node_read_unlock(n
);
1552 /* Check/update node state before receiving */
1553 if (unlikely(skb
)) {
1554 if (unlikely(skb_linearize(skb
)))
1556 tipc_node_write_lock(n
);
1557 if (tipc_node_check_state(n
, skb
, bearer_id
, &xmitq
)) {
1559 rc
= tipc_link_rcv(le
->link
, skb
, &xmitq
);
1563 tipc_node_write_unlock(n
);
1566 if (unlikely(rc
& TIPC_LINK_UP_EVT
))
1567 tipc_node_link_up(n
, bearer_id
, &xmitq
);
1569 if (unlikely(rc
& TIPC_LINK_DOWN_EVT
))
1570 tipc_node_link_down(n
, bearer_id
, false);
1572 if (unlikely(!skb_queue_empty(&n
->bc_entry
.namedq
)))
1573 tipc_named_rcv(net
, &n
->bc_entry
.namedq
);
1575 if (unlikely(!skb_queue_empty(&n
->bc_entry
.inputq1
)))
1576 tipc_node_mcast_rcv(n
);
1578 if (!skb_queue_empty(&le
->inputq
))
1579 tipc_sk_rcv(net
, &le
->inputq
);
1581 if (!skb_queue_empty(&xmitq
))
1582 tipc_bearer_xmit(net
, bearer_id
, &xmitq
, &le
->maddr
);
1589 int tipc_nl_peer_rm(struct sk_buff
*skb
, struct genl_info
*info
)
1591 struct net
*net
= sock_net(skb
->sk
);
1592 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
1593 struct nlattr
*attrs
[TIPC_NLA_NET_MAX
+ 1];
1594 struct tipc_node
*peer
;
1599 /* We identify the peer by its net */
1600 if (!info
->attrs
[TIPC_NLA_NET
])
1603 err
= nla_parse_nested(attrs
, TIPC_NLA_NET_MAX
,
1604 info
->attrs
[TIPC_NLA_NET
], tipc_nl_net_policy
,
1609 if (!attrs
[TIPC_NLA_NET_ADDR
])
1612 addr
= nla_get_u32(attrs
[TIPC_NLA_NET_ADDR
]);
1614 if (in_own_node(net
, addr
))
1617 spin_lock_bh(&tn
->node_list_lock
);
1618 peer
= tipc_node_find(net
, addr
);
1620 spin_unlock_bh(&tn
->node_list_lock
);
1624 tipc_node_write_lock(peer
);
1625 if (peer
->state
!= SELF_DOWN_PEER_DOWN
&&
1626 peer
->state
!= SELF_DOWN_PEER_LEAVING
) {
1627 tipc_node_write_unlock(peer
);
1632 for (i
= 0; i
< MAX_BEARERS
; i
++) {
1633 struct tipc_link_entry
*le
= &peer
->links
[i
];
1641 tipc_node_write_unlock(peer
);
1642 tipc_node_delete(peer
);
1646 tipc_node_put(peer
);
1647 spin_unlock_bh(&tn
->node_list_lock
);
1652 int tipc_nl_node_dump(struct sk_buff
*skb
, struct netlink_callback
*cb
)
1655 struct net
*net
= sock_net(skb
->sk
);
1656 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
1657 int done
= cb
->args
[0];
1658 int last_addr
= cb
->args
[1];
1659 struct tipc_node
*node
;
1660 struct tipc_nl_msg msg
;
1666 msg
.portid
= NETLINK_CB(cb
->skb
).portid
;
1667 msg
.seq
= cb
->nlh
->nlmsg_seq
;
1671 node
= tipc_node_find(net
, last_addr
);
1674 /* We never set seq or call nl_dump_check_consistent()
1675 * this means that setting prev_seq here will cause the
1676 * consistence check to fail in the netlink callback
1677 * handler. Resulting in the NLMSG_DONE message having
1678 * the NLM_F_DUMP_INTR flag set if the node state
1679 * changed while we released the lock.
1684 tipc_node_put(node
);
1687 list_for_each_entry_rcu(node
, &tn
->node_list
, list
) {
1689 if (node
->addr
== last_addr
)
1695 tipc_node_read_lock(node
);
1696 err
= __tipc_nl_add_node(&msg
, node
);
1698 last_addr
= node
->addr
;
1699 tipc_node_read_unlock(node
);
1703 tipc_node_read_unlock(node
);
1708 cb
->args
[1] = last_addr
;
1714 /* tipc_node_find_by_name - locate owner node of link by link's name
1715 * @net: the applicable net namespace
1716 * @name: pointer to link name string
1717 * @bearer_id: pointer to index in 'node->links' array where the link was found.
1719 * Returns pointer to node owning the link, or 0 if no matching link is found.
1721 static struct tipc_node
*tipc_node_find_by_name(struct net
*net
,
1722 const char *link_name
,
1723 unsigned int *bearer_id
)
1725 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
1726 struct tipc_link
*l
;
1727 struct tipc_node
*n
;
1728 struct tipc_node
*found_node
= NULL
;
1733 list_for_each_entry_rcu(n
, &tn
->node_list
, list
) {
1734 tipc_node_read_lock(n
);
1735 for (i
= 0; i
< MAX_BEARERS
; i
++) {
1736 l
= n
->links
[i
].link
;
1737 if (l
&& !strcmp(tipc_link_name(l
), link_name
)) {
1743 tipc_node_read_unlock(n
);
1752 int tipc_nl_node_set_link(struct sk_buff
*skb
, struct genl_info
*info
)
1758 struct tipc_link
*link
;
1759 struct tipc_node
*node
;
1760 struct sk_buff_head xmitq
;
1761 struct nlattr
*attrs
[TIPC_NLA_LINK_MAX
+ 1];
1762 struct net
*net
= sock_net(skb
->sk
);
1764 __skb_queue_head_init(&xmitq
);
1766 if (!info
->attrs
[TIPC_NLA_LINK
])
1769 err
= nla_parse_nested(attrs
, TIPC_NLA_LINK_MAX
,
1770 info
->attrs
[TIPC_NLA_LINK
],
1771 tipc_nl_link_policy
, info
->extack
);
1775 if (!attrs
[TIPC_NLA_LINK_NAME
])
1778 name
= nla_data(attrs
[TIPC_NLA_LINK_NAME
]);
1780 if (strcmp(name
, tipc_bclink_name
) == 0)
1781 return tipc_nl_bc_link_set(net
, attrs
);
1783 node
= tipc_node_find_by_name(net
, name
, &bearer_id
);
1787 tipc_node_read_lock(node
);
1789 link
= node
->links
[bearer_id
].link
;
1795 if (attrs
[TIPC_NLA_LINK_PROP
]) {
1796 struct nlattr
*props
[TIPC_NLA_PROP_MAX
+ 1];
1798 err
= tipc_nl_parse_link_prop(attrs
[TIPC_NLA_LINK_PROP
],
1805 if (props
[TIPC_NLA_PROP_TOL
]) {
1808 tol
= nla_get_u32(props
[TIPC_NLA_PROP_TOL
]);
1809 tipc_link_set_tolerance(link
, tol
, &xmitq
);
1811 if (props
[TIPC_NLA_PROP_PRIO
]) {
1814 prio
= nla_get_u32(props
[TIPC_NLA_PROP_PRIO
]);
1815 tipc_link_set_prio(link
, prio
, &xmitq
);
1817 if (props
[TIPC_NLA_PROP_WIN
]) {
1820 win
= nla_get_u32(props
[TIPC_NLA_PROP_WIN
]);
1821 tipc_link_set_queue_limits(link
, win
);
1826 tipc_node_read_unlock(node
);
1827 tipc_bearer_xmit(net
, bearer_id
, &xmitq
, &node
->links
[bearer_id
].maddr
);
1831 int tipc_nl_node_get_link(struct sk_buff
*skb
, struct genl_info
*info
)
1833 struct net
*net
= genl_info_net(info
);
1834 struct tipc_nl_msg msg
;
1838 msg
.portid
= info
->snd_portid
;
1839 msg
.seq
= info
->snd_seq
;
1841 if (!info
->attrs
[TIPC_NLA_LINK_NAME
])
1843 name
= nla_data(info
->attrs
[TIPC_NLA_LINK_NAME
]);
1845 msg
.skb
= nlmsg_new(NLMSG_GOODSIZE
, GFP_KERNEL
);
1849 if (strcmp(name
, tipc_bclink_name
) == 0) {
1850 err
= tipc_nl_add_bc_link(net
, &msg
);
1852 nlmsg_free(msg
.skb
);
1857 struct tipc_node
*node
;
1858 struct tipc_link
*link
;
1860 node
= tipc_node_find_by_name(net
, name
, &bearer_id
);
1864 tipc_node_read_lock(node
);
1865 link
= node
->links
[bearer_id
].link
;
1867 tipc_node_read_unlock(node
);
1868 nlmsg_free(msg
.skb
);
1872 err
= __tipc_nl_add_link(net
, &msg
, link
, 0);
1873 tipc_node_read_unlock(node
);
1875 nlmsg_free(msg
.skb
);
1880 return genlmsg_reply(msg
.skb
, info
);
1883 int tipc_nl_node_reset_link_stats(struct sk_buff
*skb
, struct genl_info
*info
)
1887 unsigned int bearer_id
;
1888 struct tipc_link
*link
;
1889 struct tipc_node
*node
;
1890 struct nlattr
*attrs
[TIPC_NLA_LINK_MAX
+ 1];
1891 struct net
*net
= sock_net(skb
->sk
);
1892 struct tipc_link_entry
*le
;
1894 if (!info
->attrs
[TIPC_NLA_LINK
])
1897 err
= nla_parse_nested(attrs
, TIPC_NLA_LINK_MAX
,
1898 info
->attrs
[TIPC_NLA_LINK
],
1899 tipc_nl_link_policy
, info
->extack
);
1903 if (!attrs
[TIPC_NLA_LINK_NAME
])
1906 link_name
= nla_data(attrs
[TIPC_NLA_LINK_NAME
]);
1908 if (strcmp(link_name
, tipc_bclink_name
) == 0) {
1909 err
= tipc_bclink_reset_stats(net
);
1915 node
= tipc_node_find_by_name(net
, link_name
, &bearer_id
);
1919 le
= &node
->links
[bearer_id
];
1920 tipc_node_read_lock(node
);
1921 spin_lock_bh(&le
->lock
);
1922 link
= node
->links
[bearer_id
].link
;
1924 spin_unlock_bh(&le
->lock
);
1925 tipc_node_read_unlock(node
);
1928 tipc_link_reset_stats(link
);
1929 spin_unlock_bh(&le
->lock
);
1930 tipc_node_read_unlock(node
);
1934 /* Caller should hold node lock */
1935 static int __tipc_nl_add_node_links(struct net
*net
, struct tipc_nl_msg
*msg
,
1936 struct tipc_node
*node
, u32
*prev_link
)
1941 for (i
= *prev_link
; i
< MAX_BEARERS
; i
++) {
1944 if (!node
->links
[i
].link
)
1947 err
= __tipc_nl_add_link(net
, msg
,
1948 node
->links
[i
].link
, NLM_F_MULTI
);
1957 int tipc_nl_node_dump_link(struct sk_buff
*skb
, struct netlink_callback
*cb
)
1959 struct net
*net
= sock_net(skb
->sk
);
1960 struct tipc_net
*tn
= net_generic(net
, tipc_net_id
);
1961 struct tipc_node
*node
;
1962 struct tipc_nl_msg msg
;
1963 u32 prev_node
= cb
->args
[0];
1964 u32 prev_link
= cb
->args
[1];
1965 int done
= cb
->args
[2];
1972 msg
.portid
= NETLINK_CB(cb
->skb
).portid
;
1973 msg
.seq
= cb
->nlh
->nlmsg_seq
;
1977 node
= tipc_node_find(net
, prev_node
);
1979 /* We never set seq or call nl_dump_check_consistent()
1980 * this means that setting prev_seq here will cause the
1981 * consistence check to fail in the netlink callback
1982 * handler. Resulting in the last NLMSG_DONE message
1983 * having the NLM_F_DUMP_INTR flag set.
1988 tipc_node_put(node
);
1990 list_for_each_entry_continue_rcu(node
, &tn
->node_list
,
1992 tipc_node_read_lock(node
);
1993 err
= __tipc_nl_add_node_links(net
, &msg
, node
,
1995 tipc_node_read_unlock(node
);
1999 prev_node
= node
->addr
;
2002 err
= tipc_nl_add_bc_link(net
, &msg
);
2006 list_for_each_entry_rcu(node
, &tn
->node_list
, list
) {
2007 tipc_node_read_lock(node
);
2008 err
= __tipc_nl_add_node_links(net
, &msg
, node
,
2010 tipc_node_read_unlock(node
);
2014 prev_node
= node
->addr
;
2021 cb
->args
[0] = prev_node
;
2022 cb
->args
[1] = prev_link
;
2028 int tipc_nl_node_set_monitor(struct sk_buff
*skb
, struct genl_info
*info
)
2030 struct nlattr
*attrs
[TIPC_NLA_MON_MAX
+ 1];
2031 struct net
*net
= sock_net(skb
->sk
);
2034 if (!info
->attrs
[TIPC_NLA_MON
])
2037 err
= nla_parse_nested(attrs
, TIPC_NLA_MON_MAX
,
2038 info
->attrs
[TIPC_NLA_MON
],
2039 tipc_nl_monitor_policy
, info
->extack
);
2043 if (attrs
[TIPC_NLA_MON_ACTIVATION_THRESHOLD
]) {
2046 val
= nla_get_u32(attrs
[TIPC_NLA_MON_ACTIVATION_THRESHOLD
]);
2047 err
= tipc_nl_monitor_set_threshold(net
, val
);
2055 static int __tipc_nl_add_monitor_prop(struct net
*net
, struct tipc_nl_msg
*msg
)
2057 struct nlattr
*attrs
;
2061 hdr
= genlmsg_put(msg
->skb
, msg
->portid
, msg
->seq
, &tipc_genl_family
,
2062 0, TIPC_NL_MON_GET
);
2066 attrs
= nla_nest_start(msg
->skb
, TIPC_NLA_MON
);
2070 val
= tipc_nl_monitor_get_threshold(net
);
2072 if (nla_put_u32(msg
->skb
, TIPC_NLA_MON_ACTIVATION_THRESHOLD
, val
))
2075 nla_nest_end(msg
->skb
, attrs
);
2076 genlmsg_end(msg
->skb
, hdr
);
2081 nla_nest_cancel(msg
->skb
, attrs
);
2083 genlmsg_cancel(msg
->skb
, hdr
);
2088 int tipc_nl_node_get_monitor(struct sk_buff
*skb
, struct genl_info
*info
)
2090 struct net
*net
= sock_net(skb
->sk
);
2091 struct tipc_nl_msg msg
;
2094 msg
.skb
= nlmsg_new(NLMSG_GOODSIZE
, GFP_KERNEL
);
2097 msg
.portid
= info
->snd_portid
;
2098 msg
.seq
= info
->snd_seq
;
2100 err
= __tipc_nl_add_monitor_prop(net
, &msg
);
2102 nlmsg_free(msg
.skb
);
2106 return genlmsg_reply(msg
.skb
, info
);
2109 int tipc_nl_node_dump_monitor(struct sk_buff
*skb
, struct netlink_callback
*cb
)
2111 struct net
*net
= sock_net(skb
->sk
);
2112 u32 prev_bearer
= cb
->args
[0];
2113 struct tipc_nl_msg msg
;
2117 if (prev_bearer
== MAX_BEARERS
)
2121 msg
.portid
= NETLINK_CB(cb
->skb
).portid
;
2122 msg
.seq
= cb
->nlh
->nlmsg_seq
;
2125 for (i
= prev_bearer
; i
< MAX_BEARERS
; i
++) {
2127 err
= __tipc_nl_add_monitor(net
, &msg
, prev_bearer
);
2134 cb
->args
[0] = prev_bearer
;
2139 int tipc_nl_node_dump_monitor_peer(struct sk_buff
*skb
,
2140 struct netlink_callback
*cb
)
2142 struct net
*net
= sock_net(skb
->sk
);
2143 u32 prev_node
= cb
->args
[1];
2144 u32 bearer_id
= cb
->args
[2];
2145 int done
= cb
->args
[0];
2146 struct tipc_nl_msg msg
;
2150 struct nlattr
**attrs
;
2151 struct nlattr
*mon
[TIPC_NLA_MON_MAX
+ 1];
2153 err
= tipc_nlmsg_parse(cb
->nlh
, &attrs
);
2157 if (!attrs
[TIPC_NLA_MON
])
2160 err
= nla_parse_nested(mon
, TIPC_NLA_MON_MAX
,
2161 attrs
[TIPC_NLA_MON
],
2162 tipc_nl_monitor_policy
, NULL
);
2166 if (!mon
[TIPC_NLA_MON_REF
])
2169 bearer_id
= nla_get_u32(mon
[TIPC_NLA_MON_REF
]);
2171 if (bearer_id
>= MAX_BEARERS
)
2179 msg
.portid
= NETLINK_CB(cb
->skb
).portid
;
2180 msg
.seq
= cb
->nlh
->nlmsg_seq
;
2183 err
= tipc_nl_add_monitor_peer(net
, &msg
, bearer_id
, &prev_node
);
2189 cb
->args
[1] = prev_node
;
2190 cb
->args
[2] = bearer_id
;