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"
48 #define INVALID_NODE_SIG 0x10000
49 #define NODE_CLEANUP_AFTER 300000
51 /* Flags used to take different actions according to flag type
52 * TIPC_NOTIFY_NODE_DOWN: notify node is down
53 * TIPC_NOTIFY_NODE_UP: notify node is up
54 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
57 TIPC_NOTIFY_NODE_DOWN = (1 << 3),
58 TIPC_NOTIFY_NODE_UP = (1 << 4),
59 TIPC_NOTIFY_LINK_UP = (1 << 6),
60 TIPC_NOTIFY_LINK_DOWN = (1 << 7)
63 struct tipc_link_entry {
64 struct tipc_link *link;
65 spinlock_t lock; /* per link */
67 struct sk_buff_head inputq;
68 struct tipc_media_addr maddr;
71 struct tipc_bclink_entry {
72 struct tipc_link *link;
73 struct sk_buff_head inputq1;
74 struct sk_buff_head arrvq;
75 struct sk_buff_head inputq2;
76 struct sk_buff_head namedq;
80 * struct tipc_node - TIPC node structure
81 * @addr: network address of node
82 * @ref: reference counter to node object
83 * @lock: rwlock governing access to structure
84 * @net: the applicable net namespace
85 * @hash: links to adjacent nodes in unsorted hash chain
86 * @inputq: pointer to input queue containing messages for msg event
87 * @namedq: pointer to name table input queue with name table messages
88 * @active_links: bearer ids of active links, used as index into links[] array
89 * @links: array containing references to all links to node
90 * @action_flags: bit mask of different types of node actions
91 * @state: connectivity state vs peer node
92 * @sync_point: sequence number where synch/failover is finished
93 * @list: links to adjacent nodes in sorted list of cluster's nodes
94 * @working_links: number of working links to node (both active and standby)
95 * @link_cnt: number of links to node
96 * @capabilities: bitmap, indicating peer node's functional capabilities
97 * @signature: node instance identifier
98 * @link_id: local and remote bearer ids of changing link, if any
99 * @publ_list: list of publications
100 * @rcu: rcu struct for tipc_node
101 * @delete_at: indicates the time for deleting a down node
108 struct hlist_node hash;
110 struct tipc_link_entry links[MAX_BEARERS];
111 struct tipc_bclink_entry bc_entry;
113 struct list_head list;
123 struct list_head publ_list;
124 struct list_head conn_sks;
125 unsigned long keepalive_intv;
126 struct timer_list timer;
128 unsigned long delete_at;
131 /* Node FSM states and events:
134 SELF_DOWN_PEER_DOWN = 0xdd,
135 SELF_UP_PEER_UP = 0xaa,
136 SELF_DOWN_PEER_LEAVING = 0xd1,
137 SELF_UP_PEER_COMING = 0xac,
138 SELF_COMING_PEER_UP = 0xca,
139 SELF_LEAVING_PEER_DOWN = 0x1d,
140 NODE_FAILINGOVER = 0xf0,
145 SELF_ESTABL_CONTACT_EVT = 0xece,
146 SELF_LOST_CONTACT_EVT = 0x1ce,
147 PEER_ESTABL_CONTACT_EVT = 0x9ece,
148 PEER_LOST_CONTACT_EVT = 0x91ce,
149 NODE_FAILOVER_BEGIN_EVT = 0xfbe,
150 NODE_FAILOVER_END_EVT = 0xfee,
151 NODE_SYNCH_BEGIN_EVT = 0xcbe,
152 NODE_SYNCH_END_EVT = 0xcee
155 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
156 struct sk_buff_head *xmitq,
157 struct tipc_media_addr **maddr);
158 static void tipc_node_link_down(struct tipc_node *n, int bearer_id,
160 static void node_lost_contact(struct tipc_node *n, struct sk_buff_head *inputq);
161 static void tipc_node_delete(struct tipc_node *node);
162 static void tipc_node_timeout(struct timer_list *t);
163 static void tipc_node_fsm_evt(struct tipc_node *n, int evt);
164 static struct tipc_node *tipc_node_find(struct net *net, u32 addr);
165 static struct tipc_node *tipc_node_find_by_id(struct net *net, u8 *id);
166 static void tipc_node_put(struct tipc_node *node);
167 static bool node_is_up(struct tipc_node *n);
168 static void tipc_node_delete_from_list(struct tipc_node *node);
170 struct tipc_sock_conn {
174 struct list_head list;
177 static struct tipc_link *node_active_link(struct tipc_node *n, int sel)
179 int bearer_id = n->active_links[sel & 1];
181 if (unlikely(bearer_id == INVALID_BEARER_ID))
184 return n->links[bearer_id].link;
187 int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel)
191 unsigned int mtu = MAX_MSG_SIZE;
193 n = tipc_node_find(net, addr);
197 bearer_id = n->active_links[sel & 1];
198 if (likely(bearer_id != INVALID_BEARER_ID))
199 mtu = n->links[bearer_id].mtu;
204 bool tipc_node_get_id(struct net *net, u32 addr, u8 *id)
206 u8 *own_id = tipc_own_id(net);
212 if (addr == tipc_own_addr(net)) {
213 memcpy(id, own_id, TIPC_NODEID_LEN);
216 n = tipc_node_find(net, addr);
220 memcpy(id, &n->peer_id, TIPC_NODEID_LEN);
225 u16 tipc_node_get_capabilities(struct net *net, u32 addr)
230 n = tipc_node_find(net, addr);
232 return TIPC_NODE_CAPABILITIES;
233 caps = n->capabilities;
238 static void tipc_node_kref_release(struct kref *kref)
240 struct tipc_node *n = container_of(kref, struct tipc_node, kref);
242 kfree(n->bc_entry.link);
246 static void tipc_node_put(struct tipc_node *node)
248 kref_put(&node->kref, tipc_node_kref_release);
251 static void tipc_node_get(struct tipc_node *node)
253 kref_get(&node->kref);
257 * tipc_node_find - locate specified node object, if it exists
259 static struct tipc_node *tipc_node_find(struct net *net, u32 addr)
261 struct tipc_net *tn = tipc_net(net);
262 struct tipc_node *node;
263 unsigned int thash = tipc_hashfn(addr);
266 hlist_for_each_entry_rcu(node, &tn->node_htable[thash], hash) {
267 if (node->addr != addr)
269 if (!kref_get_unless_zero(&node->kref))
277 /* tipc_node_find_by_id - locate specified node object by its 128-bit id
278 * Note: this function is called only when a discovery request failed
279 * to find the node by its 32-bit id, and is not time critical
281 static struct tipc_node *tipc_node_find_by_id(struct net *net, u8 *id)
283 struct tipc_net *tn = tipc_net(net);
288 list_for_each_entry_rcu(n, &tn->node_list, list) {
289 read_lock_bh(&n->lock);
290 if (!memcmp(id, n->peer_id, 16) &&
291 kref_get_unless_zero(&n->kref))
293 read_unlock_bh(&n->lock);
298 return found ? n : NULL;
301 static void tipc_node_read_lock(struct tipc_node *n)
303 read_lock_bh(&n->lock);
306 static void tipc_node_read_unlock(struct tipc_node *n)
308 read_unlock_bh(&n->lock);
311 static void tipc_node_write_lock(struct tipc_node *n)
313 write_lock_bh(&n->lock);
316 static void tipc_node_write_unlock_fast(struct tipc_node *n)
318 write_unlock_bh(&n->lock);
321 static void tipc_node_write_unlock(struct tipc_node *n)
323 struct net *net = n->net;
325 u32 flags = n->action_flags;
328 struct list_head *publ_list;
330 if (likely(!flags)) {
331 write_unlock_bh(&n->lock);
336 link_id = n->link_id;
337 bearer_id = link_id & 0xffff;
338 publ_list = &n->publ_list;
340 n->action_flags &= ~(TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP |
341 TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP);
343 write_unlock_bh(&n->lock);
345 if (flags & TIPC_NOTIFY_NODE_DOWN)
346 tipc_publ_notify(net, publ_list, addr);
348 if (flags & TIPC_NOTIFY_NODE_UP)
349 tipc_named_node_up(net, addr);
351 if (flags & TIPC_NOTIFY_LINK_UP) {
352 tipc_mon_peer_up(net, addr, bearer_id);
353 tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr,
354 TIPC_NODE_SCOPE, link_id, link_id);
356 if (flags & TIPC_NOTIFY_LINK_DOWN) {
357 tipc_mon_peer_down(net, addr, bearer_id);
358 tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr,
363 static struct tipc_node *tipc_node_create(struct net *net, u32 addr,
364 u8 *peer_id, u16 capabilities)
366 struct tipc_net *tn = net_generic(net, tipc_net_id);
367 struct tipc_node *n, *temp_node;
372 spin_lock_bh(&tn->node_list_lock);
373 n = tipc_node_find(net, addr);
375 if (n->capabilities == capabilities)
377 /* Same node may come back with new capabilities */
378 write_lock_bh(&n->lock);
379 n->capabilities = capabilities;
380 for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) {
381 l = n->links[bearer_id].link;
383 tipc_link_update_caps(l, capabilities);
385 write_unlock_bh(&n->lock);
388 n = kzalloc(sizeof(*n), GFP_ATOMIC);
390 pr_warn("Node creation failed, no memory\n");
394 memcpy(&n->peer_id, peer_id, 16);
396 n->capabilities = capabilities;
398 rwlock_init(&n->lock);
399 INIT_HLIST_NODE(&n->hash);
400 INIT_LIST_HEAD(&n->list);
401 INIT_LIST_HEAD(&n->publ_list);
402 INIT_LIST_HEAD(&n->conn_sks);
403 skb_queue_head_init(&n->bc_entry.namedq);
404 skb_queue_head_init(&n->bc_entry.inputq1);
405 __skb_queue_head_init(&n->bc_entry.arrvq);
406 skb_queue_head_init(&n->bc_entry.inputq2);
407 for (i = 0; i < MAX_BEARERS; i++)
408 spin_lock_init(&n->links[i].lock);
409 n->state = SELF_DOWN_PEER_LEAVING;
410 n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
411 n->signature = INVALID_NODE_SIG;
412 n->active_links[0] = INVALID_BEARER_ID;
413 n->active_links[1] = INVALID_BEARER_ID;
414 if (!tipc_link_bc_create(net, tipc_own_addr(net),
416 tipc_link_window(tipc_bc_sndlink(net)),
418 &n->bc_entry.inputq1,
420 tipc_bc_sndlink(net),
421 &n->bc_entry.link)) {
422 pr_warn("Broadcast rcv link creation failed, no memory\n");
428 timer_setup(&n->timer, tipc_node_timeout, 0);
429 n->keepalive_intv = U32_MAX;
430 hlist_add_head_rcu(&n->hash, &tn->node_htable[tipc_hashfn(addr)]);
431 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
432 if (n->addr < temp_node->addr)
435 list_add_tail_rcu(&n->list, &temp_node->list);
437 spin_unlock_bh(&tn->node_list_lock);
441 static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l)
443 unsigned long tol = tipc_link_tolerance(l);
444 unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4;
446 /* Link with lowest tolerance determines timer interval */
447 if (intv < n->keepalive_intv)
448 n->keepalive_intv = intv;
450 /* Ensure link's abort limit corresponds to current tolerance */
451 tipc_link_set_abort_limit(l, tol / n->keepalive_intv);
454 static void tipc_node_delete_from_list(struct tipc_node *node)
456 list_del_rcu(&node->list);
457 hlist_del_rcu(&node->hash);
461 static void tipc_node_delete(struct tipc_node *node)
463 tipc_node_delete_from_list(node);
465 del_timer_sync(&node->timer);
469 void tipc_node_stop(struct net *net)
471 struct tipc_net *tn = tipc_net(net);
472 struct tipc_node *node, *t_node;
474 spin_lock_bh(&tn->node_list_lock);
475 list_for_each_entry_safe(node, t_node, &tn->node_list, list)
476 tipc_node_delete(node);
477 spin_unlock_bh(&tn->node_list_lock);
480 void tipc_node_subscribe(struct net *net, struct list_head *subscr, u32 addr)
484 if (in_own_node(net, addr))
487 n = tipc_node_find(net, addr);
489 pr_warn("Node subscribe rejected, unknown node 0x%x\n", addr);
492 tipc_node_write_lock(n);
493 list_add_tail(subscr, &n->publ_list);
494 tipc_node_write_unlock_fast(n);
498 void tipc_node_unsubscribe(struct net *net, struct list_head *subscr, u32 addr)
502 if (in_own_node(net, addr))
505 n = tipc_node_find(net, addr);
507 pr_warn("Node unsubscribe rejected, unknown node 0x%x\n", addr);
510 tipc_node_write_lock(n);
511 list_del_init(subscr);
512 tipc_node_write_unlock_fast(n);
516 int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port)
518 struct tipc_node *node;
519 struct tipc_sock_conn *conn;
522 if (in_own_node(net, dnode))
525 node = tipc_node_find(net, dnode);
527 pr_warn("Connecting sock to node 0x%x failed\n", dnode);
528 return -EHOSTUNREACH;
530 conn = kmalloc(sizeof(*conn), GFP_ATOMIC);
535 conn->peer_node = dnode;
537 conn->peer_port = peer_port;
539 tipc_node_write_lock(node);
540 list_add_tail(&conn->list, &node->conn_sks);
541 tipc_node_write_unlock(node);
547 void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port)
549 struct tipc_node *node;
550 struct tipc_sock_conn *conn, *safe;
552 if (in_own_node(net, dnode))
555 node = tipc_node_find(net, dnode);
559 tipc_node_write_lock(node);
560 list_for_each_entry_safe(conn, safe, &node->conn_sks, list) {
561 if (port != conn->port)
563 list_del(&conn->list);
566 tipc_node_write_unlock(node);
570 static void tipc_node_clear_links(struct tipc_node *node)
574 for (i = 0; i < MAX_BEARERS; i++) {
575 struct tipc_link_entry *le = &node->links[i];
585 /* tipc_node_cleanup - delete nodes that does not
586 * have active links for NODE_CLEANUP_AFTER time
588 static bool tipc_node_cleanup(struct tipc_node *peer)
590 struct tipc_net *tn = tipc_net(peer->net);
591 bool deleted = false;
593 /* If lock held by tipc_node_stop() the node will be deleted anyway */
594 if (!spin_trylock_bh(&tn->node_list_lock))
597 tipc_node_write_lock(peer);
599 if (!node_is_up(peer) && time_after(jiffies, peer->delete_at)) {
600 tipc_node_clear_links(peer);
601 tipc_node_delete_from_list(peer);
604 tipc_node_write_unlock(peer);
605 spin_unlock_bh(&tn->node_list_lock);
609 /* tipc_node_timeout - handle expiration of node timer
611 static void tipc_node_timeout(struct timer_list *t)
613 struct tipc_node *n = from_timer(n, t, timer);
614 struct tipc_link_entry *le;
615 struct sk_buff_head xmitq;
616 int remains = n->link_cnt;
620 if (!node_is_up(n) && tipc_node_cleanup(n)) {
621 /*Removing the reference of Timer*/
626 __skb_queue_head_init(&xmitq);
628 /* Initial node interval to value larger (10 seconds), then it will be
629 * recalculated with link lowest tolerance
631 tipc_node_read_lock(n);
632 n->keepalive_intv = 10000;
633 tipc_node_read_unlock(n);
634 for (bearer_id = 0; remains && (bearer_id < MAX_BEARERS); bearer_id++) {
635 tipc_node_read_lock(n);
636 le = &n->links[bearer_id];
638 spin_lock_bh(&le->lock);
639 /* Link tolerance may change asynchronously: */
640 tipc_node_calculate_timer(n, le->link);
641 rc = tipc_link_timeout(le->link, &xmitq);
642 spin_unlock_bh(&le->lock);
645 tipc_node_read_unlock(n);
646 tipc_bearer_xmit(n->net, bearer_id, &xmitq, &le->maddr);
647 if (rc & TIPC_LINK_DOWN_EVT)
648 tipc_node_link_down(n, bearer_id, false);
650 mod_timer(&n->timer, jiffies + msecs_to_jiffies(n->keepalive_intv));
654 * __tipc_node_link_up - handle addition of link
655 * Node lock must be held by caller
656 * Link becomes active (alone or shared) or standby, depending on its priority.
658 static void __tipc_node_link_up(struct tipc_node *n, int bearer_id,
659 struct sk_buff_head *xmitq)
661 int *slot0 = &n->active_links[0];
662 int *slot1 = &n->active_links[1];
663 struct tipc_link *ol = node_active_link(n, 0);
664 struct tipc_link *nl = n->links[bearer_id].link;
666 if (!nl || tipc_link_is_up(nl))
669 tipc_link_fsm_evt(nl, LINK_ESTABLISH_EVT);
670 if (!tipc_link_is_up(nl))
674 n->action_flags |= TIPC_NOTIFY_LINK_UP;
675 n->link_id = tipc_link_id(nl);
677 /* Leave room for tunnel header when returning 'mtu' to users: */
678 n->links[bearer_id].mtu = tipc_link_mtu(nl) - INT_H_SIZE;
680 tipc_bearer_add_dest(n->net, bearer_id, n->addr);
681 tipc_bcast_inc_bearer_dst_cnt(n->net, bearer_id);
683 pr_debug("Established link <%s> on network plane %c\n",
684 tipc_link_name(nl), tipc_link_plane(nl));
686 /* Ensure that a STATE message goes first */
687 tipc_link_build_state_msg(nl, xmitq);
689 /* First link? => give it both slots */
693 tipc_node_fsm_evt(n, SELF_ESTABL_CONTACT_EVT);
694 n->failover_sent = false;
695 n->action_flags |= TIPC_NOTIFY_NODE_UP;
696 tipc_link_set_active(nl, true);
697 tipc_bcast_add_peer(n->net, nl, xmitq);
701 /* Second link => redistribute slots */
702 if (tipc_link_prio(nl) > tipc_link_prio(ol)) {
703 pr_debug("Old link <%s> becomes standby\n", tipc_link_name(ol));
706 tipc_link_set_active(nl, true);
707 tipc_link_set_active(ol, false);
708 } else if (tipc_link_prio(nl) == tipc_link_prio(ol)) {
709 tipc_link_set_active(nl, true);
712 pr_debug("New link <%s> is standby\n", tipc_link_name(nl));
715 /* Prepare synchronization with first link */
716 tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq);
720 * tipc_node_link_up - handle addition of link
722 * Link becomes active (alone or shared) or standby, depending on its priority.
724 static void tipc_node_link_up(struct tipc_node *n, int bearer_id,
725 struct sk_buff_head *xmitq)
727 struct tipc_media_addr *maddr;
729 tipc_node_write_lock(n);
730 __tipc_node_link_up(n, bearer_id, xmitq);
731 maddr = &n->links[bearer_id].maddr;
732 tipc_bearer_xmit(n->net, bearer_id, xmitq, maddr);
733 tipc_node_write_unlock(n);
737 * __tipc_node_link_down - handle loss of link
739 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
740 struct sk_buff_head *xmitq,
741 struct tipc_media_addr **maddr)
743 struct tipc_link_entry *le = &n->links[*bearer_id];
744 int *slot0 = &n->active_links[0];
745 int *slot1 = &n->active_links[1];
746 int i, highest = 0, prio;
747 struct tipc_link *l, *_l, *tnl;
749 l = n->links[*bearer_id].link;
750 if (!l || tipc_link_is_reset(l))
754 n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
755 n->link_id = tipc_link_id(l);
757 tipc_bearer_remove_dest(n->net, *bearer_id, n->addr);
759 pr_debug("Lost link <%s> on network plane %c\n",
760 tipc_link_name(l), tipc_link_plane(l));
762 /* Select new active link if any available */
763 *slot0 = INVALID_BEARER_ID;
764 *slot1 = INVALID_BEARER_ID;
765 for (i = 0; i < MAX_BEARERS; i++) {
766 _l = n->links[i].link;
767 if (!_l || !tipc_link_is_up(_l))
771 prio = tipc_link_prio(_l);
774 if (prio > highest) {
783 if (!node_is_up(n)) {
784 if (tipc_link_peer_is_down(l))
785 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
786 tipc_node_fsm_evt(n, SELF_LOST_CONTACT_EVT);
787 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link down!");
788 tipc_link_fsm_evt(l, LINK_RESET_EVT);
790 tipc_link_build_reset_msg(l, xmitq);
791 *maddr = &n->links[*bearer_id].maddr;
792 node_lost_contact(n, &le->inputq);
793 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
796 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
798 /* There is still a working link => initiate failover */
799 *bearer_id = n->active_links[0];
800 tnl = n->links[*bearer_id].link;
801 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
802 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
803 n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
804 tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, xmitq);
805 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link down -> failover!");
807 tipc_link_fsm_evt(l, LINK_RESET_EVT);
808 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
809 tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
810 *maddr = &n->links[*bearer_id].maddr;
813 static void tipc_node_link_down(struct tipc_node *n, int bearer_id, bool delete)
815 struct tipc_link_entry *le = &n->links[bearer_id];
816 struct tipc_link *l = le->link;
817 struct tipc_media_addr *maddr;
818 struct sk_buff_head xmitq;
819 int old_bearer_id = bearer_id;
824 __skb_queue_head_init(&xmitq);
826 tipc_node_write_lock(n);
827 if (!tipc_link_is_establishing(l)) {
828 __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr);
835 /* Defuse pending tipc_node_link_up() */
836 tipc_link_fsm_evt(l, LINK_RESET_EVT);
838 tipc_node_write_unlock(n);
840 tipc_mon_remove_peer(n->net, n->addr, old_bearer_id);
841 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr);
842 tipc_sk_rcv(n->net, &le->inputq);
845 static bool node_is_up(struct tipc_node *n)
847 return n->active_links[0] != INVALID_BEARER_ID;
850 bool tipc_node_is_up(struct net *net, u32 addr)
855 if (in_own_node(net, addr))
858 n = tipc_node_find(net, addr);
861 retval = node_is_up(n);
866 static u32 tipc_node_suggest_addr(struct net *net, u32 addr)
870 addr ^= tipc_net(net)->random;
871 while ((n = tipc_node_find(net, addr))) {
878 /* tipc_node_try_addr(): Check if addr can be used by peer, suggest other if not
879 * Returns suggested address if any, otherwise 0
881 u32 tipc_node_try_addr(struct net *net, u8 *id, u32 addr)
883 struct tipc_net *tn = tipc_net(net);
886 /* Suggest new address if some other peer is using this one */
887 n = tipc_node_find(net, addr);
889 if (!memcmp(n->peer_id, id, NODE_ID_LEN))
894 return tipc_node_suggest_addr(net, addr);
897 /* Suggest previously used address if peer is known */
898 n = tipc_node_find_by_id(net, id);
905 /* Even this node may be in conflict */
906 if (tn->trial_addr == addr)
907 return tipc_node_suggest_addr(net, addr);
912 void tipc_node_check_dest(struct net *net, u32 addr,
913 u8 *peer_id, struct tipc_bearer *b,
914 u16 capabilities, u32 signature,
915 struct tipc_media_addr *maddr,
916 bool *respond, bool *dupl_addr)
920 struct tipc_link_entry *le;
921 bool addr_match = false;
922 bool sign_match = false;
923 bool link_up = false;
924 bool accept_addr = false;
933 n = tipc_node_create(net, addr, peer_id, capabilities);
937 tipc_node_write_lock(n);
939 le = &n->links[b->identity];
941 /* Prepare to validate requesting node's signature and media address */
943 link_up = l && tipc_link_is_up(l);
944 addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr));
945 sign_match = (signature == n->signature);
947 /* These three flags give us eight permutations: */
949 if (sign_match && addr_match && link_up) {
950 /* All is fine. Do nothing. */
952 } else if (sign_match && addr_match && !link_up) {
953 /* Respond. The link will come up in due time */
955 } else if (sign_match && !addr_match && link_up) {
956 /* Peer has changed i/f address without rebooting.
957 * If so, the link will reset soon, and the next
958 * discovery will be accepted. So we can ignore it.
959 * It may also be an cloned or malicious peer having
960 * chosen the same node address and signature as an
962 * Ignore requests until the link goes down, if ever.
965 } else if (sign_match && !addr_match && !link_up) {
966 /* Peer link has changed i/f address without rebooting.
967 * It may also be a cloned or malicious peer; we can't
968 * distinguish between the two.
969 * The signature is correct, so we must accept.
973 } else if (!sign_match && addr_match && link_up) {
974 /* Peer node rebooted. Two possibilities:
975 * - Delayed re-discovery; this link endpoint has already
976 * reset and re-established contact with the peer, before
977 * receiving a discovery message from that node.
978 * (The peer happened to receive one from this node first).
979 * - The peer came back so fast that our side has not
980 * discovered it yet. Probing from this side will soon
981 * reset the link, since there can be no working link
982 * endpoint at the peer end, and the link will re-establish.
983 * Accept the signature, since it comes from a known peer.
985 n->signature = signature;
986 } else if (!sign_match && addr_match && !link_up) {
987 /* The peer node has rebooted.
988 * Accept signature, since it is a known peer.
990 n->signature = signature;
992 } else if (!sign_match && !addr_match && link_up) {
993 /* Peer rebooted with new address, or a new/duplicate peer.
994 * Ignore until the link goes down, if ever.
997 } else if (!sign_match && !addr_match && !link_up) {
998 /* Peer rebooted with new address, or it is a new peer.
999 * Accept signature and address.
1001 n->signature = signature;
1009 /* Now create new link if not already existing */
1011 if (n->link_cnt == 2)
1014 if_name = strchr(b->name, ':') + 1;
1015 get_random_bytes(&session, sizeof(u16));
1016 if (!tipc_link_create(net, if_name, b->identity, b->tolerance,
1017 b->net_plane, b->mtu, b->priority,
1019 tipc_own_addr(net), addr, peer_id,
1021 tipc_bc_sndlink(n->net), n->bc_entry.link,
1023 &n->bc_entry.namedq, &l)) {
1027 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link created!");
1029 tipc_link_fsm_evt(l, LINK_RESET_EVT);
1030 if (n->state == NODE_FAILINGOVER)
1031 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
1034 tipc_node_calculate_timer(n, l);
1035 if (n->link_cnt == 1) {
1036 intv = jiffies + msecs_to_jiffies(n->keepalive_intv);
1037 if (!mod_timer(&n->timer, intv))
1041 memcpy(&le->maddr, maddr, sizeof(*maddr));
1043 tipc_node_write_unlock(n);
1044 if (reset && l && !tipc_link_is_reset(l))
1045 tipc_node_link_down(n, b->identity, false);
1049 void tipc_node_delete_links(struct net *net, int bearer_id)
1051 struct tipc_net *tn = net_generic(net, tipc_net_id);
1052 struct tipc_node *n;
1055 list_for_each_entry_rcu(n, &tn->node_list, list) {
1056 tipc_node_link_down(n, bearer_id, true);
1061 static void tipc_node_reset_links(struct tipc_node *n)
1065 pr_warn("Resetting all links to %x\n", n->addr);
1067 for (i = 0; i < MAX_BEARERS; i++) {
1068 tipc_node_link_down(n, i, false);
1072 /* tipc_node_fsm_evt - node finite state machine
1073 * Determines when contact is allowed with peer node
1075 static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
1077 int state = n->state;
1080 case SELF_DOWN_PEER_DOWN:
1082 case SELF_ESTABL_CONTACT_EVT:
1083 state = SELF_UP_PEER_COMING;
1085 case PEER_ESTABL_CONTACT_EVT:
1086 state = SELF_COMING_PEER_UP;
1088 case SELF_LOST_CONTACT_EVT:
1089 case PEER_LOST_CONTACT_EVT:
1091 case NODE_SYNCH_END_EVT:
1092 case NODE_SYNCH_BEGIN_EVT:
1093 case NODE_FAILOVER_BEGIN_EVT:
1094 case NODE_FAILOVER_END_EVT:
1099 case SELF_UP_PEER_UP:
1101 case SELF_LOST_CONTACT_EVT:
1102 state = SELF_DOWN_PEER_LEAVING;
1104 case PEER_LOST_CONTACT_EVT:
1105 state = SELF_LEAVING_PEER_DOWN;
1107 case NODE_SYNCH_BEGIN_EVT:
1108 state = NODE_SYNCHING;
1110 case NODE_FAILOVER_BEGIN_EVT:
1111 state = NODE_FAILINGOVER;
1113 case SELF_ESTABL_CONTACT_EVT:
1114 case PEER_ESTABL_CONTACT_EVT:
1115 case NODE_SYNCH_END_EVT:
1116 case NODE_FAILOVER_END_EVT:
1122 case SELF_DOWN_PEER_LEAVING:
1124 case PEER_LOST_CONTACT_EVT:
1125 state = SELF_DOWN_PEER_DOWN;
1127 case SELF_ESTABL_CONTACT_EVT:
1128 case PEER_ESTABL_CONTACT_EVT:
1129 case SELF_LOST_CONTACT_EVT:
1131 case NODE_SYNCH_END_EVT:
1132 case NODE_SYNCH_BEGIN_EVT:
1133 case NODE_FAILOVER_BEGIN_EVT:
1134 case NODE_FAILOVER_END_EVT:
1139 case SELF_UP_PEER_COMING:
1141 case PEER_ESTABL_CONTACT_EVT:
1142 state = SELF_UP_PEER_UP;
1144 case SELF_LOST_CONTACT_EVT:
1145 state = SELF_DOWN_PEER_DOWN;
1147 case SELF_ESTABL_CONTACT_EVT:
1148 case PEER_LOST_CONTACT_EVT:
1149 case NODE_SYNCH_END_EVT:
1150 case NODE_FAILOVER_BEGIN_EVT:
1152 case NODE_SYNCH_BEGIN_EVT:
1153 case NODE_FAILOVER_END_EVT:
1158 case SELF_COMING_PEER_UP:
1160 case SELF_ESTABL_CONTACT_EVT:
1161 state = SELF_UP_PEER_UP;
1163 case PEER_LOST_CONTACT_EVT:
1164 state = SELF_DOWN_PEER_DOWN;
1166 case SELF_LOST_CONTACT_EVT:
1167 case PEER_ESTABL_CONTACT_EVT:
1169 case NODE_SYNCH_END_EVT:
1170 case NODE_SYNCH_BEGIN_EVT:
1171 case NODE_FAILOVER_BEGIN_EVT:
1172 case NODE_FAILOVER_END_EVT:
1177 case SELF_LEAVING_PEER_DOWN:
1179 case SELF_LOST_CONTACT_EVT:
1180 state = SELF_DOWN_PEER_DOWN;
1182 case SELF_ESTABL_CONTACT_EVT:
1183 case PEER_ESTABL_CONTACT_EVT:
1184 case PEER_LOST_CONTACT_EVT:
1186 case NODE_SYNCH_END_EVT:
1187 case NODE_SYNCH_BEGIN_EVT:
1188 case NODE_FAILOVER_BEGIN_EVT:
1189 case NODE_FAILOVER_END_EVT:
1194 case NODE_FAILINGOVER:
1196 case SELF_LOST_CONTACT_EVT:
1197 state = SELF_DOWN_PEER_LEAVING;
1199 case PEER_LOST_CONTACT_EVT:
1200 state = SELF_LEAVING_PEER_DOWN;
1202 case NODE_FAILOVER_END_EVT:
1203 state = SELF_UP_PEER_UP;
1205 case NODE_FAILOVER_BEGIN_EVT:
1206 case SELF_ESTABL_CONTACT_EVT:
1207 case PEER_ESTABL_CONTACT_EVT:
1209 case NODE_SYNCH_BEGIN_EVT:
1210 case NODE_SYNCH_END_EVT:
1217 case SELF_LOST_CONTACT_EVT:
1218 state = SELF_DOWN_PEER_LEAVING;
1220 case PEER_LOST_CONTACT_EVT:
1221 state = SELF_LEAVING_PEER_DOWN;
1223 case NODE_SYNCH_END_EVT:
1224 state = SELF_UP_PEER_UP;
1226 case NODE_FAILOVER_BEGIN_EVT:
1227 state = NODE_FAILINGOVER;
1229 case NODE_SYNCH_BEGIN_EVT:
1230 case SELF_ESTABL_CONTACT_EVT:
1231 case PEER_ESTABL_CONTACT_EVT:
1233 case NODE_FAILOVER_END_EVT:
1239 pr_err("Unknown node fsm state %x\n", state);
1246 pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
1249 static void node_lost_contact(struct tipc_node *n,
1250 struct sk_buff_head *inputq)
1252 struct tipc_sock_conn *conn, *safe;
1253 struct tipc_link *l;
1254 struct list_head *conns = &n->conn_sks;
1255 struct sk_buff *skb;
1258 pr_debug("Lost contact with %x\n", n->addr);
1259 n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
1261 /* Clean up broadcast state */
1262 tipc_bcast_remove_peer(n->net, n->bc_entry.link);
1264 /* Abort any ongoing link failover */
1265 for (i = 0; i < MAX_BEARERS; i++) {
1266 l = n->links[i].link;
1268 tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT);
1271 /* Notify publications from this node */
1272 n->action_flags |= TIPC_NOTIFY_NODE_DOWN;
1274 /* Notify sockets connected to node */
1275 list_for_each_entry_safe(conn, safe, conns, list) {
1276 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
1277 SHORT_H_SIZE, 0, tipc_own_addr(n->net),
1278 conn->peer_node, conn->port,
1279 conn->peer_port, TIPC_ERR_NO_NODE);
1281 skb_queue_tail(inputq, skb);
1282 list_del(&conn->list);
1288 * tipc_node_get_linkname - get the name of a link
1290 * @bearer_id: id of the bearer
1291 * @node: peer node address
1292 * @linkname: link name output buffer
1294 * Returns 0 on success
1296 int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
1297 char *linkname, size_t len)
1299 struct tipc_link *link;
1301 struct tipc_node *node = tipc_node_find(net, addr);
1306 if (bearer_id >= MAX_BEARERS)
1309 tipc_node_read_lock(node);
1310 link = node->links[bearer_id].link;
1312 strncpy(linkname, tipc_link_name(link), len);
1315 tipc_node_read_unlock(node);
1317 tipc_node_put(node);
1321 /* Caller should hold node lock for the passed node */
1322 static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
1325 struct nlattr *attrs;
1327 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
1328 NLM_F_MULTI, TIPC_NL_NODE_GET);
1332 attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE);
1336 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
1338 if (node_is_up(node))
1339 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
1342 nla_nest_end(msg->skb, attrs);
1343 genlmsg_end(msg->skb, hdr);
1348 nla_nest_cancel(msg->skb, attrs);
1350 genlmsg_cancel(msg->skb, hdr);
1356 * tipc_node_xmit() is the general link level function for message sending
1357 * @net: the applicable net namespace
1358 * @list: chain of buffers containing message
1359 * @dnode: address of destination node
1360 * @selector: a number used for deterministic link selection
1361 * Consumes the buffer chain.
1362 * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
1364 int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
1365 u32 dnode, int selector)
1367 struct tipc_link_entry *le = NULL;
1368 struct tipc_node *n;
1369 struct sk_buff_head xmitq;
1373 if (in_own_node(net, dnode)) {
1374 tipc_sk_rcv(net, list);
1378 n = tipc_node_find(net, dnode);
1380 skb_queue_purge(list);
1381 return -EHOSTUNREACH;
1384 tipc_node_read_lock(n);
1385 bearer_id = n->active_links[selector & 1];
1386 if (unlikely(bearer_id == INVALID_BEARER_ID)) {
1387 tipc_node_read_unlock(n);
1389 skb_queue_purge(list);
1390 return -EHOSTUNREACH;
1393 __skb_queue_head_init(&xmitq);
1394 le = &n->links[bearer_id];
1395 spin_lock_bh(&le->lock);
1396 rc = tipc_link_xmit(le->link, list, &xmitq);
1397 spin_unlock_bh(&le->lock);
1398 tipc_node_read_unlock(n);
1400 if (unlikely(rc == -ENOBUFS))
1401 tipc_node_link_down(n, bearer_id, false);
1403 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1410 /* tipc_node_xmit_skb(): send single buffer to destination
1411 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1412 * messages, which will not be rejected
1413 * The only exception is datagram messages rerouted after secondary
1414 * lookup, which are rare and safe to dispose of anyway.
1416 int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
1419 struct sk_buff_head head;
1421 skb_queue_head_init(&head);
1422 __skb_queue_tail(&head, skb);
1423 tipc_node_xmit(net, &head, dnode, selector);
1427 /* tipc_node_distr_xmit(): send single buffer msgs to individual destinations
1428 * Note: this is only for SYSTEM_IMPORTANCE messages, which cannot be rejected
1430 int tipc_node_distr_xmit(struct net *net, struct sk_buff_head *xmitq)
1432 struct sk_buff *skb;
1433 u32 selector, dnode;
1435 while ((skb = __skb_dequeue(xmitq))) {
1436 selector = msg_origport(buf_msg(skb));
1437 dnode = msg_destnode(buf_msg(skb));
1438 tipc_node_xmit_skb(net, skb, dnode, selector);
1443 void tipc_node_broadcast(struct net *net, struct sk_buff *skb)
1445 struct sk_buff *txskb;
1446 struct tipc_node *n;
1450 list_for_each_entry_rcu(n, tipc_nodes(net), list) {
1452 if (in_own_node(net, dst))
1456 txskb = pskb_copy(skb, GFP_ATOMIC);
1459 msg_set_destnode(buf_msg(txskb), dst);
1460 tipc_node_xmit_skb(net, txskb, dst, 0);
1467 static void tipc_node_mcast_rcv(struct tipc_node *n)
1469 struct tipc_bclink_entry *be = &n->bc_entry;
1471 /* 'arrvq' is under inputq2's lock protection */
1472 spin_lock_bh(&be->inputq2.lock);
1473 spin_lock_bh(&be->inputq1.lock);
1474 skb_queue_splice_tail_init(&be->inputq1, &be->arrvq);
1475 spin_unlock_bh(&be->inputq1.lock);
1476 spin_unlock_bh(&be->inputq2.lock);
1477 tipc_sk_mcast_rcv(n->net, &be->arrvq, &be->inputq2);
1480 static void tipc_node_bc_sync_rcv(struct tipc_node *n, struct tipc_msg *hdr,
1481 int bearer_id, struct sk_buff_head *xmitq)
1483 struct tipc_link *ucl;
1486 rc = tipc_bcast_sync_rcv(n->net, n->bc_entry.link, hdr);
1488 if (rc & TIPC_LINK_DOWN_EVT) {
1489 tipc_node_reset_links(n);
1493 if (!(rc & TIPC_LINK_SND_STATE))
1496 /* If probe message, a STATE response will be sent anyway */
1500 /* Produce a STATE message carrying broadcast NACK */
1501 tipc_node_read_lock(n);
1502 ucl = n->links[bearer_id].link;
1504 tipc_link_build_state_msg(ucl, xmitq);
1505 tipc_node_read_unlock(n);
1509 * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1510 * @net: the applicable net namespace
1512 * @bearer_id: id of bearer message arrived on
1514 * Invoked with no locks held.
1516 static void tipc_node_bc_rcv(struct net *net, struct sk_buff *skb, int bearer_id)
1519 struct sk_buff_head xmitq;
1520 struct tipc_bclink_entry *be;
1521 struct tipc_link_entry *le;
1522 struct tipc_msg *hdr = buf_msg(skb);
1523 int usr = msg_user(hdr);
1524 u32 dnode = msg_destnode(hdr);
1525 struct tipc_node *n;
1527 __skb_queue_head_init(&xmitq);
1529 /* If NACK for other node, let rcv link for that node peek into it */
1530 if ((usr == BCAST_PROTOCOL) && (dnode != tipc_own_addr(net)))
1531 n = tipc_node_find(net, dnode);
1533 n = tipc_node_find(net, msg_prevnode(hdr));
1539 le = &n->links[bearer_id];
1541 rc = tipc_bcast_rcv(net, be->link, skb);
1543 /* Broadcast ACKs are sent on a unicast link */
1544 if (rc & TIPC_LINK_SND_STATE) {
1545 tipc_node_read_lock(n);
1546 tipc_link_build_state_msg(le->link, &xmitq);
1547 tipc_node_read_unlock(n);
1550 if (!skb_queue_empty(&xmitq))
1551 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1553 if (!skb_queue_empty(&be->inputq1))
1554 tipc_node_mcast_rcv(n);
1556 /* Handle NAME_DISTRIBUTOR messages sent from 1.7 nodes */
1557 if (!skb_queue_empty(&n->bc_entry.namedq))
1558 tipc_named_rcv(net, &n->bc_entry.namedq);
1560 /* If reassembly or retransmission failure => reset all links to peer */
1561 if (rc & TIPC_LINK_DOWN_EVT)
1562 tipc_node_reset_links(n);
1568 * tipc_node_check_state - check and if necessary update node state
1570 * @bearer_id: identity of bearer delivering the packet
1571 * Returns true if state and msg are ok, otherwise false
1573 static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb,
1574 int bearer_id, struct sk_buff_head *xmitq)
1576 struct tipc_msg *hdr = buf_msg(skb);
1577 int usr = msg_user(hdr);
1578 int mtyp = msg_type(hdr);
1579 u16 oseqno = msg_seqno(hdr);
1580 u16 iseqno = msg_seqno(msg_get_wrapped(hdr));
1581 u16 exp_pkts = msg_msgcnt(hdr);
1582 u16 rcv_nxt, syncpt, dlv_nxt, inputq_len;
1583 int state = n->state;
1584 struct tipc_link *l, *tnl, *pl = NULL;
1585 struct tipc_media_addr *maddr;
1588 l = n->links[bearer_id].link;
1591 rcv_nxt = tipc_link_rcv_nxt(l);
1594 if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL)))
1597 /* Find parallel link, if any */
1598 for (pb_id = 0; pb_id < MAX_BEARERS; pb_id++) {
1599 if ((pb_id != bearer_id) && n->links[pb_id].link) {
1600 pl = n->links[pb_id].link;
1605 if (!tipc_link_validate_msg(l, hdr)) {
1606 trace_tipc_skb_dump(skb, false, "PROTO invalid (2)!");
1607 trace_tipc_link_dump(l, TIPC_DUMP_NONE, "PROTO invalid (2)!");
1611 /* Check and update node accesibility if applicable */
1612 if (state == SELF_UP_PEER_COMING) {
1613 if (!tipc_link_is_up(l))
1615 if (!msg_peer_link_is_up(hdr))
1617 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
1620 if (state == SELF_DOWN_PEER_LEAVING) {
1621 if (msg_peer_node_is_up(hdr))
1623 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
1627 if (state == SELF_LEAVING_PEER_DOWN)
1630 /* Ignore duplicate packets */
1631 if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt))
1634 /* Initiate or update failover mode if applicable */
1635 if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) {
1636 syncpt = oseqno + exp_pkts - 1;
1637 if (pl && tipc_link_is_up(pl)) {
1638 __tipc_node_link_down(n, &pb_id, xmitq, &maddr);
1639 tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl),
1640 tipc_link_inputq(l));
1642 /* If parallel link was already down, and this happened before
1643 * the tunnel link came up, FAILOVER was never sent. Ensure that
1644 * FAILOVER is sent to get peer out of NODE_FAILINGOVER state.
1646 if (n->state != NODE_FAILINGOVER && !n->failover_sent) {
1647 tipc_link_create_dummy_tnl_msg(l, xmitq);
1648 n->failover_sent = true;
1650 /* If pkts arrive out of order, use lowest calculated syncpt */
1651 if (less(syncpt, n->sync_point))
1652 n->sync_point = syncpt;
1655 /* Open parallel link when tunnel link reaches synch point */
1656 if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) {
1657 if (!more(rcv_nxt, n->sync_point))
1659 tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT);
1661 tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT);
1665 /* No synching needed if only one link */
1666 if (!pl || !tipc_link_is_up(pl))
1669 /* Initiate synch mode if applicable */
1670 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG) && (oseqno == 1)) {
1671 syncpt = iseqno + exp_pkts - 1;
1672 if (!tipc_link_is_up(l))
1673 __tipc_node_link_up(n, bearer_id, xmitq);
1674 if (n->state == SELF_UP_PEER_UP) {
1675 n->sync_point = syncpt;
1676 tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT);
1677 tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT);
1681 /* Open tunnel link when parallel link reaches synch point */
1682 if (n->state == NODE_SYNCHING) {
1683 if (tipc_link_is_synching(l)) {
1689 inputq_len = skb_queue_len(tipc_link_inputq(pl));
1690 dlv_nxt = tipc_link_rcv_nxt(pl) - inputq_len;
1691 if (more(dlv_nxt, n->sync_point)) {
1692 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
1693 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
1698 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG))
1700 if (usr == LINK_PROTOCOL)
1708 * tipc_rcv - process TIPC packets/messages arriving from off-node
1709 * @net: the applicable net namespace
1711 * @bearer: pointer to bearer message arrived on
1713 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1714 * structure (i.e. cannot be NULL), but bearer can be inactive.
1716 void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
1718 struct sk_buff_head xmitq;
1719 struct tipc_node *n;
1720 struct tipc_msg *hdr;
1721 int bearer_id = b->identity;
1722 struct tipc_link_entry *le;
1723 u32 self = tipc_own_addr(net);
1727 __skb_queue_head_init(&xmitq);
1729 /* Ensure message is well-formed before touching the header */
1730 if (unlikely(!tipc_msg_validate(&skb)))
1733 usr = msg_user(hdr);
1734 bc_ack = msg_bcast_ack(hdr);
1736 /* Handle arrival of discovery or broadcast packet */
1737 if (unlikely(msg_non_seq(hdr))) {
1738 if (unlikely(usr == LINK_CONFIG))
1739 return tipc_disc_rcv(net, skb, b);
1741 return tipc_node_bc_rcv(net, skb, bearer_id);
1744 /* Discard unicast link messages destined for another node */
1745 if (unlikely(!msg_short(hdr) && (msg_destnode(hdr) != self)))
1748 /* Locate neighboring node that sent packet */
1749 n = tipc_node_find(net, msg_prevnode(hdr));
1752 le = &n->links[bearer_id];
1754 /* Ensure broadcast reception is in synch with peer's send state */
1755 if (unlikely(usr == LINK_PROTOCOL))
1756 tipc_node_bc_sync_rcv(n, hdr, bearer_id, &xmitq);
1757 else if (unlikely(tipc_link_acked(n->bc_entry.link) != bc_ack))
1758 tipc_bcast_ack_rcv(net, n->bc_entry.link, hdr);
1760 /* Receive packet directly if conditions permit */
1761 tipc_node_read_lock(n);
1762 if (likely((n->state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) {
1763 spin_lock_bh(&le->lock);
1765 rc = tipc_link_rcv(le->link, skb, &xmitq);
1768 spin_unlock_bh(&le->lock);
1770 tipc_node_read_unlock(n);
1772 /* Check/update node state before receiving */
1773 if (unlikely(skb)) {
1774 if (unlikely(skb_linearize(skb)))
1776 tipc_node_write_lock(n);
1777 if (tipc_node_check_state(n, skb, bearer_id, &xmitq)) {
1779 rc = tipc_link_rcv(le->link, skb, &xmitq);
1783 tipc_node_write_unlock(n);
1786 if (unlikely(rc & TIPC_LINK_UP_EVT))
1787 tipc_node_link_up(n, bearer_id, &xmitq);
1789 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
1790 tipc_node_link_down(n, bearer_id, false);
1792 if (unlikely(!skb_queue_empty(&n->bc_entry.namedq)))
1793 tipc_named_rcv(net, &n->bc_entry.namedq);
1795 if (unlikely(!skb_queue_empty(&n->bc_entry.inputq1)))
1796 tipc_node_mcast_rcv(n);
1798 if (!skb_queue_empty(&le->inputq))
1799 tipc_sk_rcv(net, &le->inputq);
1801 if (!skb_queue_empty(&xmitq))
1802 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1809 void tipc_node_apply_property(struct net *net, struct tipc_bearer *b,
1812 struct tipc_net *tn = tipc_net(net);
1813 int bearer_id = b->identity;
1814 struct sk_buff_head xmitq;
1815 struct tipc_link_entry *e;
1816 struct tipc_node *n;
1818 __skb_queue_head_init(&xmitq);
1822 list_for_each_entry_rcu(n, &tn->node_list, list) {
1823 tipc_node_write_lock(n);
1824 e = &n->links[bearer_id];
1826 if (prop == TIPC_NLA_PROP_TOL)
1827 tipc_link_set_tolerance(e->link, b->tolerance,
1829 else if (prop == TIPC_NLA_PROP_MTU)
1830 tipc_link_set_mtu(e->link, b->mtu);
1832 tipc_node_write_unlock(n);
1833 tipc_bearer_xmit(net, bearer_id, &xmitq, &e->maddr);
1839 int tipc_nl_peer_rm(struct sk_buff *skb, struct genl_info *info)
1841 struct net *net = sock_net(skb->sk);
1842 struct tipc_net *tn = net_generic(net, tipc_net_id);
1843 struct nlattr *attrs[TIPC_NLA_NET_MAX + 1];
1844 struct tipc_node *peer;
1848 /* We identify the peer by its net */
1849 if (!info->attrs[TIPC_NLA_NET])
1852 err = nla_parse_nested(attrs, TIPC_NLA_NET_MAX,
1853 info->attrs[TIPC_NLA_NET], tipc_nl_net_policy,
1858 if (!attrs[TIPC_NLA_NET_ADDR])
1861 addr = nla_get_u32(attrs[TIPC_NLA_NET_ADDR]);
1863 if (in_own_node(net, addr))
1866 spin_lock_bh(&tn->node_list_lock);
1867 peer = tipc_node_find(net, addr);
1869 spin_unlock_bh(&tn->node_list_lock);
1873 tipc_node_write_lock(peer);
1874 if (peer->state != SELF_DOWN_PEER_DOWN &&
1875 peer->state != SELF_DOWN_PEER_LEAVING) {
1876 tipc_node_write_unlock(peer);
1881 tipc_node_clear_links(peer);
1882 tipc_node_write_unlock(peer);
1883 tipc_node_delete(peer);
1887 tipc_node_put(peer);
1888 spin_unlock_bh(&tn->node_list_lock);
1893 int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
1896 struct net *net = sock_net(skb->sk);
1897 struct tipc_net *tn = net_generic(net, tipc_net_id);
1898 int done = cb->args[0];
1899 int last_addr = cb->args[1];
1900 struct tipc_node *node;
1901 struct tipc_nl_msg msg;
1907 msg.portid = NETLINK_CB(cb->skb).portid;
1908 msg.seq = cb->nlh->nlmsg_seq;
1912 node = tipc_node_find(net, last_addr);
1915 /* We never set seq or call nl_dump_check_consistent()
1916 * this means that setting prev_seq here will cause the
1917 * consistence check to fail in the netlink callback
1918 * handler. Resulting in the NLMSG_DONE message having
1919 * the NLM_F_DUMP_INTR flag set if the node state
1920 * changed while we released the lock.
1925 tipc_node_put(node);
1928 list_for_each_entry_rcu(node, &tn->node_list, list) {
1930 if (node->addr == last_addr)
1936 tipc_node_read_lock(node);
1937 err = __tipc_nl_add_node(&msg, node);
1939 last_addr = node->addr;
1940 tipc_node_read_unlock(node);
1944 tipc_node_read_unlock(node);
1949 cb->args[1] = last_addr;
1955 /* tipc_node_find_by_name - locate owner node of link by link's name
1956 * @net: the applicable net namespace
1957 * @name: pointer to link name string
1958 * @bearer_id: pointer to index in 'node->links' array where the link was found.
1960 * Returns pointer to node owning the link, or 0 if no matching link is found.
1962 static struct tipc_node *tipc_node_find_by_name(struct net *net,
1963 const char *link_name,
1964 unsigned int *bearer_id)
1966 struct tipc_net *tn = net_generic(net, tipc_net_id);
1967 struct tipc_link *l;
1968 struct tipc_node *n;
1969 struct tipc_node *found_node = NULL;
1974 list_for_each_entry_rcu(n, &tn->node_list, list) {
1975 tipc_node_read_lock(n);
1976 for (i = 0; i < MAX_BEARERS; i++) {
1977 l = n->links[i].link;
1978 if (l && !strcmp(tipc_link_name(l), link_name)) {
1984 tipc_node_read_unlock(n);
1993 int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info)
1999 struct tipc_link *link;
2000 struct tipc_node *node;
2001 struct sk_buff_head xmitq;
2002 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2003 struct net *net = sock_net(skb->sk);
2005 __skb_queue_head_init(&xmitq);
2007 if (!info->attrs[TIPC_NLA_LINK])
2010 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
2011 info->attrs[TIPC_NLA_LINK],
2012 tipc_nl_link_policy, info->extack);
2016 if (!attrs[TIPC_NLA_LINK_NAME])
2019 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2021 if (strcmp(name, tipc_bclink_name) == 0)
2022 return tipc_nl_bc_link_set(net, attrs);
2024 node = tipc_node_find_by_name(net, name, &bearer_id);
2028 tipc_node_read_lock(node);
2030 link = node->links[bearer_id].link;
2036 if (attrs[TIPC_NLA_LINK_PROP]) {
2037 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
2039 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
2046 if (props[TIPC_NLA_PROP_TOL]) {
2049 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
2050 tipc_link_set_tolerance(link, tol, &xmitq);
2052 if (props[TIPC_NLA_PROP_PRIO]) {
2055 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
2056 tipc_link_set_prio(link, prio, &xmitq);
2058 if (props[TIPC_NLA_PROP_WIN]) {
2061 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
2062 tipc_link_set_queue_limits(link, win);
2067 tipc_node_read_unlock(node);
2068 tipc_bearer_xmit(net, bearer_id, &xmitq, &node->links[bearer_id].maddr);
2072 int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info)
2074 struct net *net = genl_info_net(info);
2075 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2076 struct tipc_nl_msg msg;
2080 msg.portid = info->snd_portid;
2081 msg.seq = info->snd_seq;
2083 if (!info->attrs[TIPC_NLA_LINK])
2086 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
2087 info->attrs[TIPC_NLA_LINK],
2088 tipc_nl_link_policy, info->extack);
2092 if (!attrs[TIPC_NLA_LINK_NAME])
2095 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2097 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2101 if (strcmp(name, tipc_bclink_name) == 0) {
2102 err = tipc_nl_add_bc_link(net, &msg);
2107 struct tipc_node *node;
2108 struct tipc_link *link;
2110 node = tipc_node_find_by_name(net, name, &bearer_id);
2116 tipc_node_read_lock(node);
2117 link = node->links[bearer_id].link;
2119 tipc_node_read_unlock(node);
2124 err = __tipc_nl_add_link(net, &msg, link, 0);
2125 tipc_node_read_unlock(node);
2130 return genlmsg_reply(msg.skb, info);
2133 nlmsg_free(msg.skb);
2137 int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info)
2141 unsigned int bearer_id;
2142 struct tipc_link *link;
2143 struct tipc_node *node;
2144 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2145 struct net *net = sock_net(skb->sk);
2146 struct tipc_link_entry *le;
2148 if (!info->attrs[TIPC_NLA_LINK])
2151 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
2152 info->attrs[TIPC_NLA_LINK],
2153 tipc_nl_link_policy, info->extack);
2157 if (!attrs[TIPC_NLA_LINK_NAME])
2160 link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2162 if (strcmp(link_name, tipc_bclink_name) == 0) {
2163 err = tipc_bclink_reset_stats(net);
2169 node = tipc_node_find_by_name(net, link_name, &bearer_id);
2173 le = &node->links[bearer_id];
2174 tipc_node_read_lock(node);
2175 spin_lock_bh(&le->lock);
2176 link = node->links[bearer_id].link;
2178 spin_unlock_bh(&le->lock);
2179 tipc_node_read_unlock(node);
2182 tipc_link_reset_stats(link);
2183 spin_unlock_bh(&le->lock);
2184 tipc_node_read_unlock(node);
2188 /* Caller should hold node lock */
2189 static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
2190 struct tipc_node *node, u32 *prev_link)
2195 for (i = *prev_link; i < MAX_BEARERS; i++) {
2198 if (!node->links[i].link)
2201 err = __tipc_nl_add_link(net, msg,
2202 node->links[i].link, NLM_F_MULTI);
2211 int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb)
2213 struct net *net = sock_net(skb->sk);
2214 struct tipc_net *tn = net_generic(net, tipc_net_id);
2215 struct tipc_node *node;
2216 struct tipc_nl_msg msg;
2217 u32 prev_node = cb->args[0];
2218 u32 prev_link = cb->args[1];
2219 int done = cb->args[2];
2226 msg.portid = NETLINK_CB(cb->skb).portid;
2227 msg.seq = cb->nlh->nlmsg_seq;
2231 node = tipc_node_find(net, prev_node);
2233 /* We never set seq or call nl_dump_check_consistent()
2234 * this means that setting prev_seq here will cause the
2235 * consistence check to fail in the netlink callback
2236 * handler. Resulting in the last NLMSG_DONE message
2237 * having the NLM_F_DUMP_INTR flag set.
2242 tipc_node_put(node);
2244 list_for_each_entry_continue_rcu(node, &tn->node_list,
2246 tipc_node_read_lock(node);
2247 err = __tipc_nl_add_node_links(net, &msg, node,
2249 tipc_node_read_unlock(node);
2253 prev_node = node->addr;
2256 err = tipc_nl_add_bc_link(net, &msg);
2260 list_for_each_entry_rcu(node, &tn->node_list, list) {
2261 tipc_node_read_lock(node);
2262 err = __tipc_nl_add_node_links(net, &msg, node,
2264 tipc_node_read_unlock(node);
2268 prev_node = node->addr;
2275 cb->args[0] = prev_node;
2276 cb->args[1] = prev_link;
2282 int tipc_nl_node_set_monitor(struct sk_buff *skb, struct genl_info *info)
2284 struct nlattr *attrs[TIPC_NLA_MON_MAX + 1];
2285 struct net *net = sock_net(skb->sk);
2288 if (!info->attrs[TIPC_NLA_MON])
2291 err = nla_parse_nested(attrs, TIPC_NLA_MON_MAX,
2292 info->attrs[TIPC_NLA_MON],
2293 tipc_nl_monitor_policy, info->extack);
2297 if (attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]) {
2300 val = nla_get_u32(attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]);
2301 err = tipc_nl_monitor_set_threshold(net, val);
2309 static int __tipc_nl_add_monitor_prop(struct net *net, struct tipc_nl_msg *msg)
2311 struct nlattr *attrs;
2315 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
2316 0, TIPC_NL_MON_GET);
2320 attrs = nla_nest_start(msg->skb, TIPC_NLA_MON);
2324 val = tipc_nl_monitor_get_threshold(net);
2326 if (nla_put_u32(msg->skb, TIPC_NLA_MON_ACTIVATION_THRESHOLD, val))
2329 nla_nest_end(msg->skb, attrs);
2330 genlmsg_end(msg->skb, hdr);
2335 nla_nest_cancel(msg->skb, attrs);
2337 genlmsg_cancel(msg->skb, hdr);
2342 int tipc_nl_node_get_monitor(struct sk_buff *skb, struct genl_info *info)
2344 struct net *net = sock_net(skb->sk);
2345 struct tipc_nl_msg msg;
2348 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2351 msg.portid = info->snd_portid;
2352 msg.seq = info->snd_seq;
2354 err = __tipc_nl_add_monitor_prop(net, &msg);
2356 nlmsg_free(msg.skb);
2360 return genlmsg_reply(msg.skb, info);
2363 int tipc_nl_node_dump_monitor(struct sk_buff *skb, struct netlink_callback *cb)
2365 struct net *net = sock_net(skb->sk);
2366 u32 prev_bearer = cb->args[0];
2367 struct tipc_nl_msg msg;
2371 if (prev_bearer == MAX_BEARERS)
2375 msg.portid = NETLINK_CB(cb->skb).portid;
2376 msg.seq = cb->nlh->nlmsg_seq;
2379 for (bearer_id = prev_bearer; bearer_id < MAX_BEARERS; bearer_id++) {
2380 err = __tipc_nl_add_monitor(net, &msg, bearer_id);
2385 cb->args[0] = bearer_id;
2390 int tipc_nl_node_dump_monitor_peer(struct sk_buff *skb,
2391 struct netlink_callback *cb)
2393 struct net *net = sock_net(skb->sk);
2394 u32 prev_node = cb->args[1];
2395 u32 bearer_id = cb->args[2];
2396 int done = cb->args[0];
2397 struct tipc_nl_msg msg;
2401 struct nlattr **attrs;
2402 struct nlattr *mon[TIPC_NLA_MON_MAX + 1];
2404 err = tipc_nlmsg_parse(cb->nlh, &attrs);
2408 if (!attrs[TIPC_NLA_MON])
2411 err = nla_parse_nested(mon, TIPC_NLA_MON_MAX,
2412 attrs[TIPC_NLA_MON],
2413 tipc_nl_monitor_policy, NULL);
2417 if (!mon[TIPC_NLA_MON_REF])
2420 bearer_id = nla_get_u32(mon[TIPC_NLA_MON_REF]);
2422 if (bearer_id >= MAX_BEARERS)
2430 msg.portid = NETLINK_CB(cb->skb).portid;
2431 msg.seq = cb->nlh->nlmsg_seq;
2434 err = tipc_nl_add_monitor_peer(net, &msg, bearer_id, &prev_node);
2440 cb->args[1] = prev_node;
2441 cb->args[2] = bearer_id;
2446 u32 tipc_node_get_addr(struct tipc_node *node)
2448 return (node) ? node->addr : 0;
2452 * tipc_node_dump - dump TIPC node data
2453 * @n: tipc node to be dumped
2455 * - false: dump only tipc node data
2456 * - true: dump node link data as well
2457 * @buf: returned buffer of dump data in format
2459 int tipc_node_dump(struct tipc_node *n, bool more, char *buf)
2462 size_t sz = (more) ? NODE_LMAX : NODE_LMIN;
2465 i += scnprintf(buf, sz, "node data: (null)\n");
2469 i += scnprintf(buf, sz, "node data: %x", n->addr);
2470 i += scnprintf(buf + i, sz - i, " %x", n->state);
2471 i += scnprintf(buf + i, sz - i, " %d", n->active_links[0]);
2472 i += scnprintf(buf + i, sz - i, " %d", n->active_links[1]);
2473 i += scnprintf(buf + i, sz - i, " %x", n->action_flags);
2474 i += scnprintf(buf + i, sz - i, " %u", n->failover_sent);
2475 i += scnprintf(buf + i, sz - i, " %u", n->sync_point);
2476 i += scnprintf(buf + i, sz - i, " %d", n->link_cnt);
2477 i += scnprintf(buf + i, sz - i, " %u", n->working_links);
2478 i += scnprintf(buf + i, sz - i, " %x", n->capabilities);
2479 i += scnprintf(buf + i, sz - i, " %lu\n", n->keepalive_intv);
2484 i += scnprintf(buf + i, sz - i, "link_entry[0]:\n");
2485 i += scnprintf(buf + i, sz - i, " mtu: %u\n", n->links[0].mtu);
2486 i += scnprintf(buf + i, sz - i, " media: ");
2487 i += tipc_media_addr_printf(buf + i, sz - i, &n->links[0].maddr);
2488 i += scnprintf(buf + i, sz - i, "\n");
2489 i += tipc_link_dump(n->links[0].link, TIPC_DUMP_NONE, buf + i);
2490 i += scnprintf(buf + i, sz - i, " inputq: ");
2491 i += tipc_list_dump(&n->links[0].inputq, false, buf + i);
2493 i += scnprintf(buf + i, sz - i, "link_entry[1]:\n");
2494 i += scnprintf(buf + i, sz - i, " mtu: %u\n", n->links[1].mtu);
2495 i += scnprintf(buf + i, sz - i, " media: ");
2496 i += tipc_media_addr_printf(buf + i, sz - i, &n->links[1].maddr);
2497 i += scnprintf(buf + i, sz - i, "\n");
2498 i += tipc_link_dump(n->links[1].link, TIPC_DUMP_NONE, buf + i);
2499 i += scnprintf(buf + i, sz - i, " inputq: ");
2500 i += tipc_list_dump(&n->links[1].inputq, false, buf + i);
2502 i += scnprintf(buf + i, sz - i, "bclink:\n ");
2503 i += tipc_link_dump(n->bc_entry.link, TIPC_DUMP_NONE, buf + i);