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
48 #define NODE_CLEANUP_AFTER 300000
50 /* Flags used to take different actions according to flag type
51 * TIPC_NOTIFY_NODE_DOWN: notify node is down
52 * TIPC_NOTIFY_NODE_UP: notify node is up
53 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
56 TIPC_NOTIFY_NODE_DOWN = (1 << 3),
57 TIPC_NOTIFY_NODE_UP = (1 << 4),
58 TIPC_NOTIFY_LINK_UP = (1 << 6),
59 TIPC_NOTIFY_LINK_DOWN = (1 << 7)
62 struct tipc_link_entry {
63 struct tipc_link *link;
64 spinlock_t lock; /* per link */
66 struct sk_buff_head inputq;
67 struct tipc_media_addr maddr;
70 struct tipc_bclink_entry {
71 struct tipc_link *link;
72 struct sk_buff_head inputq1;
73 struct sk_buff_head arrvq;
74 struct sk_buff_head inputq2;
75 struct sk_buff_head namedq;
79 * struct tipc_node - TIPC node structure
80 * @addr: network address of node
81 * @ref: reference counter to node object
82 * @lock: rwlock governing access to structure
83 * @net: the applicable net namespace
84 * @hash: links to adjacent nodes in unsorted hash chain
85 * @inputq: pointer to input queue containing messages for msg event
86 * @namedq: pointer to name table input queue with name table messages
87 * @active_links: bearer ids of active links, used as index into links[] array
88 * @links: array containing references to all links to node
89 * @action_flags: bit mask of different types of node actions
90 * @state: connectivity state vs peer node
91 * @sync_point: sequence number where synch/failover is finished
92 * @list: links to adjacent nodes in sorted list of cluster's nodes
93 * @working_links: number of working links to node (both active and standby)
94 * @link_cnt: number of links to node
95 * @capabilities: bitmap, indicating peer node's functional capabilities
96 * @signature: node instance identifier
97 * @link_id: local and remote bearer ids of changing link, if any
98 * @publ_list: list of publications
99 * @rcu: rcu struct for tipc_node
100 * @delete_at: indicates the time for deleting a down node
107 struct hlist_node hash;
109 struct tipc_link_entry links[MAX_BEARERS];
110 struct tipc_bclink_entry bc_entry;
112 struct list_head list;
122 struct list_head publ_list;
123 struct list_head conn_sks;
124 unsigned long keepalive_intv;
125 struct timer_list timer;
127 unsigned long delete_at;
130 /* Node FSM states and events:
133 SELF_DOWN_PEER_DOWN = 0xdd,
134 SELF_UP_PEER_UP = 0xaa,
135 SELF_DOWN_PEER_LEAVING = 0xd1,
136 SELF_UP_PEER_COMING = 0xac,
137 SELF_COMING_PEER_UP = 0xca,
138 SELF_LEAVING_PEER_DOWN = 0x1d,
139 NODE_FAILINGOVER = 0xf0,
144 SELF_ESTABL_CONTACT_EVT = 0xece,
145 SELF_LOST_CONTACT_EVT = 0x1ce,
146 PEER_ESTABL_CONTACT_EVT = 0x9ece,
147 PEER_LOST_CONTACT_EVT = 0x91ce,
148 NODE_FAILOVER_BEGIN_EVT = 0xfbe,
149 NODE_FAILOVER_END_EVT = 0xfee,
150 NODE_SYNCH_BEGIN_EVT = 0xcbe,
151 NODE_SYNCH_END_EVT = 0xcee
154 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
155 struct sk_buff_head *xmitq,
156 struct tipc_media_addr **maddr);
157 static void tipc_node_link_down(struct tipc_node *n, int bearer_id,
159 static void node_lost_contact(struct tipc_node *n, struct sk_buff_head *inputq);
160 static void tipc_node_delete(struct tipc_node *node);
161 static void tipc_node_timeout(struct timer_list *t);
162 static void tipc_node_fsm_evt(struct tipc_node *n, int evt);
163 static struct tipc_node *tipc_node_find(struct net *net, u32 addr);
164 static struct tipc_node *tipc_node_find_by_id(struct net *net, u8 *id);
165 static void tipc_node_put(struct tipc_node *node);
166 static bool node_is_up(struct tipc_node *n);
167 static void tipc_node_delete_from_list(struct tipc_node *node);
169 struct tipc_sock_conn {
173 struct list_head list;
176 static struct tipc_link *node_active_link(struct tipc_node *n, int sel)
178 int bearer_id = n->active_links[sel & 1];
180 if (unlikely(bearer_id == INVALID_BEARER_ID))
183 return n->links[bearer_id].link;
186 int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel)
190 unsigned int mtu = MAX_MSG_SIZE;
192 n = tipc_node_find(net, addr);
196 bearer_id = n->active_links[sel & 1];
197 if (likely(bearer_id != INVALID_BEARER_ID))
198 mtu = n->links[bearer_id].mtu;
203 bool tipc_node_get_id(struct net *net, u32 addr, u8 *id)
205 u8 *own_id = tipc_own_id(net);
211 if (addr == tipc_own_addr(net)) {
212 memcpy(id, own_id, TIPC_NODEID_LEN);
215 n = tipc_node_find(net, addr);
219 memcpy(id, &n->peer_id, TIPC_NODEID_LEN);
224 u16 tipc_node_get_capabilities(struct net *net, u32 addr)
229 n = tipc_node_find(net, addr);
231 return TIPC_NODE_CAPABILITIES;
232 caps = n->capabilities;
237 static void tipc_node_kref_release(struct kref *kref)
239 struct tipc_node *n = container_of(kref, struct tipc_node, kref);
241 kfree(n->bc_entry.link);
245 static void tipc_node_put(struct tipc_node *node)
247 kref_put(&node->kref, tipc_node_kref_release);
250 static void tipc_node_get(struct tipc_node *node)
252 kref_get(&node->kref);
256 * tipc_node_find - locate specified node object, if it exists
258 static struct tipc_node *tipc_node_find(struct net *net, u32 addr)
260 struct tipc_net *tn = tipc_net(net);
261 struct tipc_node *node;
262 unsigned int thash = tipc_hashfn(addr);
265 hlist_for_each_entry_rcu(node, &tn->node_htable[thash], hash) {
266 if (node->addr != addr)
268 if (!kref_get_unless_zero(&node->kref))
276 /* tipc_node_find_by_id - locate specified node object by its 128-bit id
277 * Note: this function is called only when a discovery request failed
278 * to find the node by its 32-bit id, and is not time critical
280 static struct tipc_node *tipc_node_find_by_id(struct net *net, u8 *id)
282 struct tipc_net *tn = tipc_net(net);
287 list_for_each_entry_rcu(n, &tn->node_list, list) {
288 read_lock_bh(&n->lock);
289 if (!memcmp(id, n->peer_id, 16) &&
290 kref_get_unless_zero(&n->kref))
292 read_unlock_bh(&n->lock);
297 return found ? n : NULL;
300 static void tipc_node_read_lock(struct tipc_node *n)
302 read_lock_bh(&n->lock);
305 static void tipc_node_read_unlock(struct tipc_node *n)
307 read_unlock_bh(&n->lock);
310 static void tipc_node_write_lock(struct tipc_node *n)
312 write_lock_bh(&n->lock);
315 static void tipc_node_write_unlock_fast(struct tipc_node *n)
317 write_unlock_bh(&n->lock);
320 static void tipc_node_write_unlock(struct tipc_node *n)
322 struct net *net = n->net;
324 u32 flags = n->action_flags;
327 struct list_head *publ_list;
329 if (likely(!flags)) {
330 write_unlock_bh(&n->lock);
335 link_id = n->link_id;
336 bearer_id = link_id & 0xffff;
337 publ_list = &n->publ_list;
339 n->action_flags &= ~(TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP |
340 TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP);
342 write_unlock_bh(&n->lock);
344 if (flags & TIPC_NOTIFY_NODE_DOWN)
345 tipc_publ_notify(net, publ_list, addr);
347 if (flags & TIPC_NOTIFY_NODE_UP)
348 tipc_named_node_up(net, addr);
350 if (flags & TIPC_NOTIFY_LINK_UP) {
351 tipc_mon_peer_up(net, addr, bearer_id);
352 tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr,
353 TIPC_NODE_SCOPE, link_id, link_id);
355 if (flags & TIPC_NOTIFY_LINK_DOWN) {
356 tipc_mon_peer_down(net, addr, bearer_id);
357 tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr,
362 static struct tipc_node *tipc_node_create(struct net *net, u32 addr,
363 u8 *peer_id, u16 capabilities)
365 struct tipc_net *tn = net_generic(net, tipc_net_id);
366 struct tipc_node *n, *temp_node;
371 spin_lock_bh(&tn->node_list_lock);
372 n = tipc_node_find(net, addr);
374 if (n->capabilities == capabilities)
376 /* Same node may come back with new capabilities */
377 write_lock_bh(&n->lock);
378 n->capabilities = capabilities;
379 for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) {
380 l = n->links[bearer_id].link;
382 tipc_link_update_caps(l, capabilities);
384 write_unlock_bh(&n->lock);
387 n = kzalloc(sizeof(*n), GFP_ATOMIC);
389 pr_warn("Node creation failed, no memory\n");
393 memcpy(&n->peer_id, peer_id, 16);
395 n->capabilities = capabilities;
397 rwlock_init(&n->lock);
398 INIT_HLIST_NODE(&n->hash);
399 INIT_LIST_HEAD(&n->list);
400 INIT_LIST_HEAD(&n->publ_list);
401 INIT_LIST_HEAD(&n->conn_sks);
402 skb_queue_head_init(&n->bc_entry.namedq);
403 skb_queue_head_init(&n->bc_entry.inputq1);
404 __skb_queue_head_init(&n->bc_entry.arrvq);
405 skb_queue_head_init(&n->bc_entry.inputq2);
406 for (i = 0; i < MAX_BEARERS; i++)
407 spin_lock_init(&n->links[i].lock);
408 n->state = SELF_DOWN_PEER_LEAVING;
409 n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
410 n->signature = INVALID_NODE_SIG;
411 n->active_links[0] = INVALID_BEARER_ID;
412 n->active_links[1] = INVALID_BEARER_ID;
413 if (!tipc_link_bc_create(net, tipc_own_addr(net),
415 tipc_link_window(tipc_bc_sndlink(net)),
417 &n->bc_entry.inputq1,
419 tipc_bc_sndlink(net),
420 &n->bc_entry.link)) {
421 pr_warn("Broadcast rcv link creation failed, no memory\n");
427 timer_setup(&n->timer, tipc_node_timeout, 0);
428 n->keepalive_intv = U32_MAX;
429 hlist_add_head_rcu(&n->hash, &tn->node_htable[tipc_hashfn(addr)]);
430 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
431 if (n->addr < temp_node->addr)
434 list_add_tail_rcu(&n->list, &temp_node->list);
436 spin_unlock_bh(&tn->node_list_lock);
440 static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l)
442 unsigned long tol = tipc_link_tolerance(l);
443 unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4;
445 /* Link with lowest tolerance determines timer interval */
446 if (intv < n->keepalive_intv)
447 n->keepalive_intv = intv;
449 /* Ensure link's abort limit corresponds to current tolerance */
450 tipc_link_set_abort_limit(l, tol / n->keepalive_intv);
453 static void tipc_node_delete_from_list(struct tipc_node *node)
455 list_del_rcu(&node->list);
456 hlist_del_rcu(&node->hash);
460 static void tipc_node_delete(struct tipc_node *node)
462 tipc_node_delete_from_list(node);
464 del_timer_sync(&node->timer);
468 void tipc_node_stop(struct net *net)
470 struct tipc_net *tn = tipc_net(net);
471 struct tipc_node *node, *t_node;
473 spin_lock_bh(&tn->node_list_lock);
474 list_for_each_entry_safe(node, t_node, &tn->node_list, list)
475 tipc_node_delete(node);
476 spin_unlock_bh(&tn->node_list_lock);
479 void tipc_node_subscribe(struct net *net, struct list_head *subscr, u32 addr)
483 if (in_own_node(net, addr))
486 n = tipc_node_find(net, addr);
488 pr_warn("Node subscribe rejected, unknown node 0x%x\n", addr);
491 tipc_node_write_lock(n);
492 list_add_tail(subscr, &n->publ_list);
493 tipc_node_write_unlock_fast(n);
497 void tipc_node_unsubscribe(struct net *net, struct list_head *subscr, u32 addr)
501 if (in_own_node(net, addr))
504 n = tipc_node_find(net, addr);
506 pr_warn("Node unsubscribe rejected, unknown node 0x%x\n", addr);
509 tipc_node_write_lock(n);
510 list_del_init(subscr);
511 tipc_node_write_unlock_fast(n);
515 int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port)
517 struct tipc_node *node;
518 struct tipc_sock_conn *conn;
521 if (in_own_node(net, dnode))
524 node = tipc_node_find(net, dnode);
526 pr_warn("Connecting sock to node 0x%x failed\n", dnode);
527 return -EHOSTUNREACH;
529 conn = kmalloc(sizeof(*conn), GFP_ATOMIC);
534 conn->peer_node = dnode;
536 conn->peer_port = peer_port;
538 tipc_node_write_lock(node);
539 list_add_tail(&conn->list, &node->conn_sks);
540 tipc_node_write_unlock(node);
546 void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port)
548 struct tipc_node *node;
549 struct tipc_sock_conn *conn, *safe;
551 if (in_own_node(net, dnode))
554 node = tipc_node_find(net, dnode);
558 tipc_node_write_lock(node);
559 list_for_each_entry_safe(conn, safe, &node->conn_sks, list) {
560 if (port != conn->port)
562 list_del(&conn->list);
565 tipc_node_write_unlock(node);
569 static void tipc_node_clear_links(struct tipc_node *node)
573 for (i = 0; i < MAX_BEARERS; i++) {
574 struct tipc_link_entry *le = &node->links[i];
584 /* tipc_node_cleanup - delete nodes that does not
585 * have active links for NODE_CLEANUP_AFTER time
587 static int tipc_node_cleanup(struct tipc_node *peer)
589 struct tipc_net *tn = tipc_net(peer->net);
590 bool deleted = false;
592 spin_lock_bh(&tn->node_list_lock);
593 tipc_node_write_lock(peer);
595 if (!node_is_up(peer) && time_after(jiffies, peer->delete_at)) {
596 tipc_node_clear_links(peer);
597 tipc_node_delete_from_list(peer);
600 tipc_node_write_unlock(peer);
601 spin_unlock_bh(&tn->node_list_lock);
605 /* tipc_node_timeout - handle expiration of node timer
607 static void tipc_node_timeout(struct timer_list *t)
609 struct tipc_node *n = from_timer(n, t, timer);
610 struct tipc_link_entry *le;
611 struct sk_buff_head xmitq;
612 int remains = n->link_cnt;
616 if (!node_is_up(n) && tipc_node_cleanup(n)) {
617 /*Removing the reference of Timer*/
622 __skb_queue_head_init(&xmitq);
624 for (bearer_id = 0; remains && (bearer_id < MAX_BEARERS); bearer_id++) {
625 tipc_node_read_lock(n);
626 le = &n->links[bearer_id];
628 spin_lock_bh(&le->lock);
629 /* Link tolerance may change asynchronously: */
630 tipc_node_calculate_timer(n, le->link);
631 rc = tipc_link_timeout(le->link, &xmitq);
632 spin_unlock_bh(&le->lock);
635 tipc_node_read_unlock(n);
636 tipc_bearer_xmit(n->net, bearer_id, &xmitq, &le->maddr);
637 if (rc & TIPC_LINK_DOWN_EVT)
638 tipc_node_link_down(n, bearer_id, false);
640 mod_timer(&n->timer, jiffies + msecs_to_jiffies(n->keepalive_intv));
644 * __tipc_node_link_up - handle addition of link
645 * Node lock must be held by caller
646 * Link becomes active (alone or shared) or standby, depending on its priority.
648 static void __tipc_node_link_up(struct tipc_node *n, int bearer_id,
649 struct sk_buff_head *xmitq)
651 int *slot0 = &n->active_links[0];
652 int *slot1 = &n->active_links[1];
653 struct tipc_link *ol = node_active_link(n, 0);
654 struct tipc_link *nl = n->links[bearer_id].link;
656 if (!nl || tipc_link_is_up(nl))
659 tipc_link_fsm_evt(nl, LINK_ESTABLISH_EVT);
660 if (!tipc_link_is_up(nl))
664 n->action_flags |= TIPC_NOTIFY_LINK_UP;
665 n->link_id = tipc_link_id(nl);
667 /* Leave room for tunnel header when returning 'mtu' to users: */
668 n->links[bearer_id].mtu = tipc_link_mtu(nl) - INT_H_SIZE;
670 tipc_bearer_add_dest(n->net, bearer_id, n->addr);
671 tipc_bcast_inc_bearer_dst_cnt(n->net, bearer_id);
673 pr_debug("Established link <%s> on network plane %c\n",
674 tipc_link_name(nl), tipc_link_plane(nl));
676 /* Ensure that a STATE message goes first */
677 tipc_link_build_state_msg(nl, xmitq);
679 /* First link? => give it both slots */
683 tipc_node_fsm_evt(n, SELF_ESTABL_CONTACT_EVT);
684 n->failover_sent = false;
685 n->action_flags |= TIPC_NOTIFY_NODE_UP;
686 tipc_link_set_active(nl, true);
687 tipc_bcast_add_peer(n->net, nl, xmitq);
691 /* Second link => redistribute slots */
692 if (tipc_link_prio(nl) > tipc_link_prio(ol)) {
693 pr_debug("Old link <%s> becomes standby\n", tipc_link_name(ol));
696 tipc_link_set_active(nl, true);
697 tipc_link_set_active(ol, false);
698 } else if (tipc_link_prio(nl) == tipc_link_prio(ol)) {
699 tipc_link_set_active(nl, true);
702 pr_debug("New link <%s> is standby\n", tipc_link_name(nl));
705 /* Prepare synchronization with first link */
706 tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq);
710 * tipc_node_link_up - handle addition of link
712 * Link becomes active (alone or shared) or standby, depending on its priority.
714 static void tipc_node_link_up(struct tipc_node *n, int bearer_id,
715 struct sk_buff_head *xmitq)
717 struct tipc_media_addr *maddr;
719 tipc_node_write_lock(n);
720 __tipc_node_link_up(n, bearer_id, xmitq);
721 maddr = &n->links[bearer_id].maddr;
722 tipc_bearer_xmit(n->net, bearer_id, xmitq, maddr);
723 tipc_node_write_unlock(n);
727 * __tipc_node_link_down - handle loss of link
729 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
730 struct sk_buff_head *xmitq,
731 struct tipc_media_addr **maddr)
733 struct tipc_link_entry *le = &n->links[*bearer_id];
734 int *slot0 = &n->active_links[0];
735 int *slot1 = &n->active_links[1];
736 int i, highest = 0, prio;
737 struct tipc_link *l, *_l, *tnl;
739 l = n->links[*bearer_id].link;
740 if (!l || tipc_link_is_reset(l))
744 n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
745 n->link_id = tipc_link_id(l);
747 tipc_bearer_remove_dest(n->net, *bearer_id, n->addr);
749 pr_debug("Lost link <%s> on network plane %c\n",
750 tipc_link_name(l), tipc_link_plane(l));
752 /* Select new active link if any available */
753 *slot0 = INVALID_BEARER_ID;
754 *slot1 = INVALID_BEARER_ID;
755 for (i = 0; i < MAX_BEARERS; i++) {
756 _l = n->links[i].link;
757 if (!_l || !tipc_link_is_up(_l))
761 prio = tipc_link_prio(_l);
764 if (prio > highest) {
773 if (!node_is_up(n)) {
774 if (tipc_link_peer_is_down(l))
775 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
776 tipc_node_fsm_evt(n, SELF_LOST_CONTACT_EVT);
777 tipc_link_fsm_evt(l, LINK_RESET_EVT);
779 tipc_link_build_reset_msg(l, xmitq);
780 *maddr = &n->links[*bearer_id].maddr;
781 node_lost_contact(n, &le->inputq);
782 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
785 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
787 /* There is still a working link => initiate failover */
788 *bearer_id = n->active_links[0];
789 tnl = n->links[*bearer_id].link;
790 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
791 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
792 n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
793 tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, xmitq);
795 tipc_link_fsm_evt(l, LINK_RESET_EVT);
796 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
797 tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
798 *maddr = &n->links[*bearer_id].maddr;
801 static void tipc_node_link_down(struct tipc_node *n, int bearer_id, bool delete)
803 struct tipc_link_entry *le = &n->links[bearer_id];
804 struct tipc_link *l = le->link;
805 struct tipc_media_addr *maddr;
806 struct sk_buff_head xmitq;
807 int old_bearer_id = bearer_id;
812 __skb_queue_head_init(&xmitq);
814 tipc_node_write_lock(n);
815 if (!tipc_link_is_establishing(l)) {
816 __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr);
823 /* Defuse pending tipc_node_link_up() */
824 tipc_link_fsm_evt(l, LINK_RESET_EVT);
826 tipc_node_write_unlock(n);
828 tipc_mon_remove_peer(n->net, n->addr, old_bearer_id);
829 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr);
830 tipc_sk_rcv(n->net, &le->inputq);
833 static bool node_is_up(struct tipc_node *n)
835 return n->active_links[0] != INVALID_BEARER_ID;
838 bool tipc_node_is_up(struct net *net, u32 addr)
843 if (in_own_node(net, addr))
846 n = tipc_node_find(net, addr);
849 retval = node_is_up(n);
854 static u32 tipc_node_suggest_addr(struct net *net, u32 addr)
858 addr ^= tipc_net(net)->random;
859 while ((n = tipc_node_find(net, addr))) {
866 /* tipc_node_try_addr(): Check if addr can be used by peer, suggest other if not
867 * Returns suggested address if any, otherwise 0
869 u32 tipc_node_try_addr(struct net *net, u8 *id, u32 addr)
871 struct tipc_net *tn = tipc_net(net);
874 /* Suggest new address if some other peer is using this one */
875 n = tipc_node_find(net, addr);
877 if (!memcmp(n->peer_id, id, NODE_ID_LEN))
882 return tipc_node_suggest_addr(net, addr);
885 /* Suggest previously used address if peer is known */
886 n = tipc_node_find_by_id(net, id);
893 /* Even this node may be in conflict */
894 if (tn->trial_addr == addr)
895 return tipc_node_suggest_addr(net, addr);
900 void tipc_node_check_dest(struct net *net, u32 addr,
901 u8 *peer_id, struct tipc_bearer *b,
902 u16 capabilities, u32 signature,
903 struct tipc_media_addr *maddr,
904 bool *respond, bool *dupl_addr)
908 struct tipc_link_entry *le;
909 bool addr_match = false;
910 bool sign_match = false;
911 bool link_up = false;
912 bool accept_addr = false;
920 n = tipc_node_create(net, addr, peer_id, capabilities);
924 tipc_node_write_lock(n);
926 le = &n->links[b->identity];
928 /* Prepare to validate requesting node's signature and media address */
930 link_up = l && tipc_link_is_up(l);
931 addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr));
932 sign_match = (signature == n->signature);
934 /* These three flags give us eight permutations: */
936 if (sign_match && addr_match && link_up) {
937 /* All is fine. Do nothing. */
939 } else if (sign_match && addr_match && !link_up) {
940 /* Respond. The link will come up in due time */
942 } else if (sign_match && !addr_match && link_up) {
943 /* Peer has changed i/f address without rebooting.
944 * If so, the link will reset soon, and the next
945 * discovery will be accepted. So we can ignore it.
946 * It may also be an cloned or malicious peer having
947 * chosen the same node address and signature as an
949 * Ignore requests until the link goes down, if ever.
952 } else if (sign_match && !addr_match && !link_up) {
953 /* Peer link has changed i/f address without rebooting.
954 * It may also be a cloned or malicious peer; we can't
955 * distinguish between the two.
956 * The signature is correct, so we must accept.
960 } else if (!sign_match && addr_match && link_up) {
961 /* Peer node rebooted. Two possibilities:
962 * - Delayed re-discovery; this link endpoint has already
963 * reset and re-established contact with the peer, before
964 * receiving a discovery message from that node.
965 * (The peer happened to receive one from this node first).
966 * - The peer came back so fast that our side has not
967 * discovered it yet. Probing from this side will soon
968 * reset the link, since there can be no working link
969 * endpoint at the peer end, and the link will re-establish.
970 * Accept the signature, since it comes from a known peer.
972 n->signature = signature;
973 } else if (!sign_match && addr_match && !link_up) {
974 /* The peer node has rebooted.
975 * Accept signature, since it is a known peer.
977 n->signature = signature;
979 } else if (!sign_match && !addr_match && link_up) {
980 /* Peer rebooted with new address, or a new/duplicate peer.
981 * Ignore until the link goes down, if ever.
984 } else if (!sign_match && !addr_match && !link_up) {
985 /* Peer rebooted with new address, or it is a new peer.
986 * Accept signature and address.
988 n->signature = signature;
996 /* Now create new link if not already existing */
998 if (n->link_cnt == 2)
1001 if_name = strchr(b->name, ':') + 1;
1002 if (!tipc_link_create(net, if_name, b->identity, b->tolerance,
1003 b->net_plane, b->mtu, b->priority,
1004 b->window, mod(tipc_net(net)->random),
1005 tipc_own_addr(net), addr, peer_id,
1007 tipc_bc_sndlink(n->net), n->bc_entry.link,
1009 &n->bc_entry.namedq, &l)) {
1014 tipc_link_fsm_evt(l, LINK_RESET_EVT);
1015 if (n->state == NODE_FAILINGOVER)
1016 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
1019 tipc_node_calculate_timer(n, l);
1020 if (n->link_cnt == 1) {
1021 intv = jiffies + msecs_to_jiffies(n->keepalive_intv);
1022 if (!mod_timer(&n->timer, intv))
1026 memcpy(&le->maddr, maddr, sizeof(*maddr));
1028 tipc_node_write_unlock(n);
1029 if (reset && l && !tipc_link_is_reset(l))
1030 tipc_node_link_down(n, b->identity, false);
1034 void tipc_node_delete_links(struct net *net, int bearer_id)
1036 struct tipc_net *tn = net_generic(net, tipc_net_id);
1037 struct tipc_node *n;
1040 list_for_each_entry_rcu(n, &tn->node_list, list) {
1041 tipc_node_link_down(n, bearer_id, true);
1046 static void tipc_node_reset_links(struct tipc_node *n)
1050 pr_warn("Resetting all links to %x\n", n->addr);
1052 for (i = 0; i < MAX_BEARERS; i++) {
1053 tipc_node_link_down(n, i, false);
1057 /* tipc_node_fsm_evt - node finite state machine
1058 * Determines when contact is allowed with peer node
1060 static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
1062 int state = n->state;
1065 case SELF_DOWN_PEER_DOWN:
1067 case SELF_ESTABL_CONTACT_EVT:
1068 state = SELF_UP_PEER_COMING;
1070 case PEER_ESTABL_CONTACT_EVT:
1071 state = SELF_COMING_PEER_UP;
1073 case SELF_LOST_CONTACT_EVT:
1074 case PEER_LOST_CONTACT_EVT:
1076 case NODE_SYNCH_END_EVT:
1077 case NODE_SYNCH_BEGIN_EVT:
1078 case NODE_FAILOVER_BEGIN_EVT:
1079 case NODE_FAILOVER_END_EVT:
1084 case SELF_UP_PEER_UP:
1086 case SELF_LOST_CONTACT_EVT:
1087 state = SELF_DOWN_PEER_LEAVING;
1089 case PEER_LOST_CONTACT_EVT:
1090 state = SELF_LEAVING_PEER_DOWN;
1092 case NODE_SYNCH_BEGIN_EVT:
1093 state = NODE_SYNCHING;
1095 case NODE_FAILOVER_BEGIN_EVT:
1096 state = NODE_FAILINGOVER;
1098 case SELF_ESTABL_CONTACT_EVT:
1099 case PEER_ESTABL_CONTACT_EVT:
1100 case NODE_SYNCH_END_EVT:
1101 case NODE_FAILOVER_END_EVT:
1107 case SELF_DOWN_PEER_LEAVING:
1109 case PEER_LOST_CONTACT_EVT:
1110 state = SELF_DOWN_PEER_DOWN;
1112 case SELF_ESTABL_CONTACT_EVT:
1113 case PEER_ESTABL_CONTACT_EVT:
1114 case SELF_LOST_CONTACT_EVT:
1116 case NODE_SYNCH_END_EVT:
1117 case NODE_SYNCH_BEGIN_EVT:
1118 case NODE_FAILOVER_BEGIN_EVT:
1119 case NODE_FAILOVER_END_EVT:
1124 case SELF_UP_PEER_COMING:
1126 case PEER_ESTABL_CONTACT_EVT:
1127 state = SELF_UP_PEER_UP;
1129 case SELF_LOST_CONTACT_EVT:
1130 state = SELF_DOWN_PEER_DOWN;
1132 case SELF_ESTABL_CONTACT_EVT:
1133 case PEER_LOST_CONTACT_EVT:
1134 case NODE_SYNCH_END_EVT:
1135 case NODE_FAILOVER_BEGIN_EVT:
1137 case NODE_SYNCH_BEGIN_EVT:
1138 case NODE_FAILOVER_END_EVT:
1143 case SELF_COMING_PEER_UP:
1145 case SELF_ESTABL_CONTACT_EVT:
1146 state = SELF_UP_PEER_UP;
1148 case PEER_LOST_CONTACT_EVT:
1149 state = SELF_DOWN_PEER_DOWN;
1151 case SELF_LOST_CONTACT_EVT:
1152 case PEER_ESTABL_CONTACT_EVT:
1154 case NODE_SYNCH_END_EVT:
1155 case NODE_SYNCH_BEGIN_EVT:
1156 case NODE_FAILOVER_BEGIN_EVT:
1157 case NODE_FAILOVER_END_EVT:
1162 case SELF_LEAVING_PEER_DOWN:
1164 case SELF_LOST_CONTACT_EVT:
1165 state = SELF_DOWN_PEER_DOWN;
1167 case SELF_ESTABL_CONTACT_EVT:
1168 case PEER_ESTABL_CONTACT_EVT:
1169 case PEER_LOST_CONTACT_EVT:
1171 case NODE_SYNCH_END_EVT:
1172 case NODE_SYNCH_BEGIN_EVT:
1173 case NODE_FAILOVER_BEGIN_EVT:
1174 case NODE_FAILOVER_END_EVT:
1179 case NODE_FAILINGOVER:
1181 case SELF_LOST_CONTACT_EVT:
1182 state = SELF_DOWN_PEER_LEAVING;
1184 case PEER_LOST_CONTACT_EVT:
1185 state = SELF_LEAVING_PEER_DOWN;
1187 case NODE_FAILOVER_END_EVT:
1188 state = SELF_UP_PEER_UP;
1190 case NODE_FAILOVER_BEGIN_EVT:
1191 case SELF_ESTABL_CONTACT_EVT:
1192 case PEER_ESTABL_CONTACT_EVT:
1194 case NODE_SYNCH_BEGIN_EVT:
1195 case NODE_SYNCH_END_EVT:
1202 case SELF_LOST_CONTACT_EVT:
1203 state = SELF_DOWN_PEER_LEAVING;
1205 case PEER_LOST_CONTACT_EVT:
1206 state = SELF_LEAVING_PEER_DOWN;
1208 case NODE_SYNCH_END_EVT:
1209 state = SELF_UP_PEER_UP;
1211 case NODE_FAILOVER_BEGIN_EVT:
1212 state = NODE_FAILINGOVER;
1214 case NODE_SYNCH_BEGIN_EVT:
1215 case SELF_ESTABL_CONTACT_EVT:
1216 case PEER_ESTABL_CONTACT_EVT:
1218 case NODE_FAILOVER_END_EVT:
1224 pr_err("Unknown node fsm state %x\n", state);
1231 pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
1234 static void node_lost_contact(struct tipc_node *n,
1235 struct sk_buff_head *inputq)
1237 struct tipc_sock_conn *conn, *safe;
1238 struct tipc_link *l;
1239 struct list_head *conns = &n->conn_sks;
1240 struct sk_buff *skb;
1243 pr_debug("Lost contact with %x\n", n->addr);
1244 n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
1246 /* Clean up broadcast state */
1247 tipc_bcast_remove_peer(n->net, n->bc_entry.link);
1249 /* Abort any ongoing link failover */
1250 for (i = 0; i < MAX_BEARERS; i++) {
1251 l = n->links[i].link;
1253 tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT);
1256 /* Notify publications from this node */
1257 n->action_flags |= TIPC_NOTIFY_NODE_DOWN;
1259 /* Notify sockets connected to node */
1260 list_for_each_entry_safe(conn, safe, conns, list) {
1261 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
1262 SHORT_H_SIZE, 0, tipc_own_addr(n->net),
1263 conn->peer_node, conn->port,
1264 conn->peer_port, TIPC_ERR_NO_NODE);
1266 skb_queue_tail(inputq, skb);
1267 list_del(&conn->list);
1273 * tipc_node_get_linkname - get the name of a link
1275 * @bearer_id: id of the bearer
1276 * @node: peer node address
1277 * @linkname: link name output buffer
1279 * Returns 0 on success
1281 int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
1282 char *linkname, size_t len)
1284 struct tipc_link *link;
1286 struct tipc_node *node = tipc_node_find(net, addr);
1291 if (bearer_id >= MAX_BEARERS)
1294 tipc_node_read_lock(node);
1295 link = node->links[bearer_id].link;
1297 strncpy(linkname, tipc_link_name(link), len);
1300 tipc_node_read_unlock(node);
1302 tipc_node_put(node);
1306 /* Caller should hold node lock for the passed node */
1307 static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
1310 struct nlattr *attrs;
1312 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
1313 NLM_F_MULTI, TIPC_NL_NODE_GET);
1317 attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE);
1321 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
1323 if (node_is_up(node))
1324 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
1327 nla_nest_end(msg->skb, attrs);
1328 genlmsg_end(msg->skb, hdr);
1333 nla_nest_cancel(msg->skb, attrs);
1335 genlmsg_cancel(msg->skb, hdr);
1341 * tipc_node_xmit() is the general link level function for message sending
1342 * @net: the applicable net namespace
1343 * @list: chain of buffers containing message
1344 * @dnode: address of destination node
1345 * @selector: a number used for deterministic link selection
1346 * Consumes the buffer chain.
1347 * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
1349 int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
1350 u32 dnode, int selector)
1352 struct tipc_link_entry *le = NULL;
1353 struct tipc_node *n;
1354 struct sk_buff_head xmitq;
1358 if (in_own_node(net, dnode)) {
1359 tipc_sk_rcv(net, list);
1363 n = tipc_node_find(net, dnode);
1365 skb_queue_purge(list);
1366 return -EHOSTUNREACH;
1369 tipc_node_read_lock(n);
1370 bearer_id = n->active_links[selector & 1];
1371 if (unlikely(bearer_id == INVALID_BEARER_ID)) {
1372 tipc_node_read_unlock(n);
1374 skb_queue_purge(list);
1375 return -EHOSTUNREACH;
1378 __skb_queue_head_init(&xmitq);
1379 le = &n->links[bearer_id];
1380 spin_lock_bh(&le->lock);
1381 rc = tipc_link_xmit(le->link, list, &xmitq);
1382 spin_unlock_bh(&le->lock);
1383 tipc_node_read_unlock(n);
1385 if (unlikely(rc == -ENOBUFS))
1386 tipc_node_link_down(n, bearer_id, false);
1388 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1395 /* tipc_node_xmit_skb(): send single buffer to destination
1396 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1397 * messages, which will not be rejected
1398 * The only exception is datagram messages rerouted after secondary
1399 * lookup, which are rare and safe to dispose of anyway.
1401 int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
1404 struct sk_buff_head head;
1406 skb_queue_head_init(&head);
1407 __skb_queue_tail(&head, skb);
1408 tipc_node_xmit(net, &head, dnode, selector);
1412 /* tipc_node_distr_xmit(): send single buffer msgs to individual destinations
1413 * Note: this is only for SYSTEM_IMPORTANCE messages, which cannot be rejected
1415 int tipc_node_distr_xmit(struct net *net, struct sk_buff_head *xmitq)
1417 struct sk_buff *skb;
1418 u32 selector, dnode;
1420 while ((skb = __skb_dequeue(xmitq))) {
1421 selector = msg_origport(buf_msg(skb));
1422 dnode = msg_destnode(buf_msg(skb));
1423 tipc_node_xmit_skb(net, skb, dnode, selector);
1428 void tipc_node_broadcast(struct net *net, struct sk_buff *skb)
1430 struct sk_buff *txskb;
1431 struct tipc_node *n;
1435 list_for_each_entry_rcu(n, tipc_nodes(net), list) {
1437 if (in_own_node(net, dst))
1441 txskb = pskb_copy(skb, GFP_ATOMIC);
1444 msg_set_destnode(buf_msg(txskb), dst);
1445 tipc_node_xmit_skb(net, txskb, dst, 0);
1452 static void tipc_node_mcast_rcv(struct tipc_node *n)
1454 struct tipc_bclink_entry *be = &n->bc_entry;
1456 /* 'arrvq' is under inputq2's lock protection */
1457 spin_lock_bh(&be->inputq2.lock);
1458 spin_lock_bh(&be->inputq1.lock);
1459 skb_queue_splice_tail_init(&be->inputq1, &be->arrvq);
1460 spin_unlock_bh(&be->inputq1.lock);
1461 spin_unlock_bh(&be->inputq2.lock);
1462 tipc_sk_mcast_rcv(n->net, &be->arrvq, &be->inputq2);
1465 static void tipc_node_bc_sync_rcv(struct tipc_node *n, struct tipc_msg *hdr,
1466 int bearer_id, struct sk_buff_head *xmitq)
1468 struct tipc_link *ucl;
1471 rc = tipc_bcast_sync_rcv(n->net, n->bc_entry.link, hdr);
1473 if (rc & TIPC_LINK_DOWN_EVT) {
1474 tipc_node_reset_links(n);
1478 if (!(rc & TIPC_LINK_SND_STATE))
1481 /* If probe message, a STATE response will be sent anyway */
1485 /* Produce a STATE message carrying broadcast NACK */
1486 tipc_node_read_lock(n);
1487 ucl = n->links[bearer_id].link;
1489 tipc_link_build_state_msg(ucl, xmitq);
1490 tipc_node_read_unlock(n);
1494 * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1495 * @net: the applicable net namespace
1497 * @bearer_id: id of bearer message arrived on
1499 * Invoked with no locks held.
1501 static void tipc_node_bc_rcv(struct net *net, struct sk_buff *skb, int bearer_id)
1504 struct sk_buff_head xmitq;
1505 struct tipc_bclink_entry *be;
1506 struct tipc_link_entry *le;
1507 struct tipc_msg *hdr = buf_msg(skb);
1508 int usr = msg_user(hdr);
1509 u32 dnode = msg_destnode(hdr);
1510 struct tipc_node *n;
1512 __skb_queue_head_init(&xmitq);
1514 /* If NACK for other node, let rcv link for that node peek into it */
1515 if ((usr == BCAST_PROTOCOL) && (dnode != tipc_own_addr(net)))
1516 n = tipc_node_find(net, dnode);
1518 n = tipc_node_find(net, msg_prevnode(hdr));
1524 le = &n->links[bearer_id];
1526 rc = tipc_bcast_rcv(net, be->link, skb);
1528 /* Broadcast ACKs are sent on a unicast link */
1529 if (rc & TIPC_LINK_SND_STATE) {
1530 tipc_node_read_lock(n);
1531 tipc_link_build_state_msg(le->link, &xmitq);
1532 tipc_node_read_unlock(n);
1535 if (!skb_queue_empty(&xmitq))
1536 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1538 if (!skb_queue_empty(&be->inputq1))
1539 tipc_node_mcast_rcv(n);
1541 /* If reassembly or retransmission failure => reset all links to peer */
1542 if (rc & TIPC_LINK_DOWN_EVT)
1543 tipc_node_reset_links(n);
1549 * tipc_node_check_state - check and if necessary update node state
1551 * @bearer_id: identity of bearer delivering the packet
1552 * Returns true if state and msg are ok, otherwise false
1554 static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb,
1555 int bearer_id, struct sk_buff_head *xmitq)
1557 struct tipc_msg *hdr = buf_msg(skb);
1558 int usr = msg_user(hdr);
1559 int mtyp = msg_type(hdr);
1560 u16 oseqno = msg_seqno(hdr);
1561 u16 iseqno = msg_seqno(msg_get_wrapped(hdr));
1562 u16 exp_pkts = msg_msgcnt(hdr);
1563 u16 rcv_nxt, syncpt, dlv_nxt, inputq_len;
1564 int state = n->state;
1565 struct tipc_link *l, *tnl, *pl = NULL;
1566 struct tipc_media_addr *maddr;
1569 l = n->links[bearer_id].link;
1572 rcv_nxt = tipc_link_rcv_nxt(l);
1575 if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL)))
1578 /* Find parallel link, if any */
1579 for (pb_id = 0; pb_id < MAX_BEARERS; pb_id++) {
1580 if ((pb_id != bearer_id) && n->links[pb_id].link) {
1581 pl = n->links[pb_id].link;
1586 if (!tipc_link_validate_msg(l, hdr))
1589 /* Check and update node accesibility if applicable */
1590 if (state == SELF_UP_PEER_COMING) {
1591 if (!tipc_link_is_up(l))
1593 if (!msg_peer_link_is_up(hdr))
1595 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
1598 if (state == SELF_DOWN_PEER_LEAVING) {
1599 if (msg_peer_node_is_up(hdr))
1601 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
1605 if (state == SELF_LEAVING_PEER_DOWN)
1608 /* Ignore duplicate packets */
1609 if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt))
1612 /* Initiate or update failover mode if applicable */
1613 if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) {
1614 syncpt = oseqno + exp_pkts - 1;
1615 if (pl && tipc_link_is_up(pl)) {
1616 __tipc_node_link_down(n, &pb_id, xmitq, &maddr);
1617 tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl),
1618 tipc_link_inputq(l));
1620 /* If parallel link was already down, and this happened before
1621 * the tunnel link came up, FAILOVER was never sent. Ensure that
1622 * FAILOVER is sent to get peer out of NODE_FAILINGOVER state.
1624 if (n->state != NODE_FAILINGOVER && !n->failover_sent) {
1625 tipc_link_create_dummy_tnl_msg(l, xmitq);
1626 n->failover_sent = true;
1629 /* If pkts arrive out of order, use lowest calculated syncpt */
1630 if (less(syncpt, n->sync_point))
1631 n->sync_point = syncpt;
1634 /* Open parallel link when tunnel link reaches synch point */
1635 if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) {
1636 if (!more(rcv_nxt, n->sync_point))
1638 tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT);
1640 tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT);
1644 /* No synching needed if only one link */
1645 if (!pl || !tipc_link_is_up(pl))
1648 /* Initiate synch mode if applicable */
1649 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG) && (oseqno == 1)) {
1650 syncpt = iseqno + exp_pkts - 1;
1651 if (!tipc_link_is_up(l))
1652 __tipc_node_link_up(n, bearer_id, xmitq);
1653 if (n->state == SELF_UP_PEER_UP) {
1654 n->sync_point = syncpt;
1655 tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT);
1656 tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT);
1660 /* Open tunnel link when parallel link reaches synch point */
1661 if (n->state == NODE_SYNCHING) {
1662 if (tipc_link_is_synching(l)) {
1668 inputq_len = skb_queue_len(tipc_link_inputq(pl));
1669 dlv_nxt = tipc_link_rcv_nxt(pl) - inputq_len;
1670 if (more(dlv_nxt, n->sync_point)) {
1671 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
1672 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
1677 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG))
1679 if (usr == LINK_PROTOCOL)
1687 * tipc_rcv - process TIPC packets/messages arriving from off-node
1688 * @net: the applicable net namespace
1690 * @bearer: pointer to bearer message arrived on
1692 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1693 * structure (i.e. cannot be NULL), but bearer can be inactive.
1695 void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
1697 struct sk_buff_head xmitq;
1698 struct tipc_node *n;
1699 struct tipc_msg *hdr;
1700 int bearer_id = b->identity;
1701 struct tipc_link_entry *le;
1702 u32 self = tipc_own_addr(net);
1706 __skb_queue_head_init(&xmitq);
1708 /* Ensure message is well-formed before touching the header */
1709 if (unlikely(!tipc_msg_validate(&skb)))
1712 usr = msg_user(hdr);
1713 bc_ack = msg_bcast_ack(hdr);
1715 /* Handle arrival of discovery or broadcast packet */
1716 if (unlikely(msg_non_seq(hdr))) {
1717 if (unlikely(usr == LINK_CONFIG))
1718 return tipc_disc_rcv(net, skb, b);
1720 return tipc_node_bc_rcv(net, skb, bearer_id);
1723 /* Discard unicast link messages destined for another node */
1724 if (unlikely(!msg_short(hdr) && (msg_destnode(hdr) != self)))
1727 /* Locate neighboring node that sent packet */
1728 n = tipc_node_find(net, msg_prevnode(hdr));
1731 le = &n->links[bearer_id];
1733 /* Ensure broadcast reception is in synch with peer's send state */
1734 if (unlikely(usr == LINK_PROTOCOL))
1735 tipc_node_bc_sync_rcv(n, hdr, bearer_id, &xmitq);
1736 else if (unlikely(tipc_link_acked(n->bc_entry.link) != bc_ack))
1737 tipc_bcast_ack_rcv(net, n->bc_entry.link, hdr);
1739 /* Receive packet directly if conditions permit */
1740 tipc_node_read_lock(n);
1741 if (likely((n->state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) {
1742 spin_lock_bh(&le->lock);
1744 rc = tipc_link_rcv(le->link, skb, &xmitq);
1747 spin_unlock_bh(&le->lock);
1749 tipc_node_read_unlock(n);
1751 /* Check/update node state before receiving */
1752 if (unlikely(skb)) {
1753 if (unlikely(skb_linearize(skb)))
1755 tipc_node_write_lock(n);
1756 if (tipc_node_check_state(n, skb, bearer_id, &xmitq)) {
1758 rc = tipc_link_rcv(le->link, skb, &xmitq);
1762 tipc_node_write_unlock(n);
1765 if (unlikely(rc & TIPC_LINK_UP_EVT))
1766 tipc_node_link_up(n, bearer_id, &xmitq);
1768 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
1769 tipc_node_link_down(n, bearer_id, false);
1771 if (unlikely(!skb_queue_empty(&n->bc_entry.namedq)))
1772 tipc_named_rcv(net, &n->bc_entry.namedq);
1774 if (unlikely(!skb_queue_empty(&n->bc_entry.inputq1)))
1775 tipc_node_mcast_rcv(n);
1777 if (!skb_queue_empty(&le->inputq))
1778 tipc_sk_rcv(net, &le->inputq);
1780 if (!skb_queue_empty(&xmitq))
1781 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1788 void tipc_node_apply_property(struct net *net, struct tipc_bearer *b,
1791 struct tipc_net *tn = tipc_net(net);
1792 int bearer_id = b->identity;
1793 struct sk_buff_head xmitq;
1794 struct tipc_link_entry *e;
1795 struct tipc_node *n;
1797 __skb_queue_head_init(&xmitq);
1801 list_for_each_entry_rcu(n, &tn->node_list, list) {
1802 tipc_node_write_lock(n);
1803 e = &n->links[bearer_id];
1805 if (prop == TIPC_NLA_PROP_TOL)
1806 tipc_link_set_tolerance(e->link, b->tolerance,
1808 else if (prop == TIPC_NLA_PROP_MTU)
1809 tipc_link_set_mtu(e->link, b->mtu);
1811 tipc_node_write_unlock(n);
1812 tipc_bearer_xmit(net, bearer_id, &xmitq, &e->maddr);
1818 int tipc_nl_peer_rm(struct sk_buff *skb, struct genl_info *info)
1820 struct net *net = sock_net(skb->sk);
1821 struct tipc_net *tn = net_generic(net, tipc_net_id);
1822 struct nlattr *attrs[TIPC_NLA_NET_MAX + 1];
1823 struct tipc_node *peer;
1827 /* We identify the peer by its net */
1828 if (!info->attrs[TIPC_NLA_NET])
1831 err = nla_parse_nested(attrs, TIPC_NLA_NET_MAX,
1832 info->attrs[TIPC_NLA_NET], tipc_nl_net_policy,
1837 if (!attrs[TIPC_NLA_NET_ADDR])
1840 addr = nla_get_u32(attrs[TIPC_NLA_NET_ADDR]);
1842 if (in_own_node(net, addr))
1845 spin_lock_bh(&tn->node_list_lock);
1846 peer = tipc_node_find(net, addr);
1848 spin_unlock_bh(&tn->node_list_lock);
1852 tipc_node_write_lock(peer);
1853 if (peer->state != SELF_DOWN_PEER_DOWN &&
1854 peer->state != SELF_DOWN_PEER_LEAVING) {
1855 tipc_node_write_unlock(peer);
1860 tipc_node_clear_links(peer);
1861 tipc_node_write_unlock(peer);
1862 tipc_node_delete(peer);
1866 tipc_node_put(peer);
1867 spin_unlock_bh(&tn->node_list_lock);
1872 int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
1875 struct net *net = sock_net(skb->sk);
1876 struct tipc_net *tn = net_generic(net, tipc_net_id);
1877 int done = cb->args[0];
1878 int last_addr = cb->args[1];
1879 struct tipc_node *node;
1880 struct tipc_nl_msg msg;
1886 msg.portid = NETLINK_CB(cb->skb).portid;
1887 msg.seq = cb->nlh->nlmsg_seq;
1891 node = tipc_node_find(net, last_addr);
1894 /* We never set seq or call nl_dump_check_consistent()
1895 * this means that setting prev_seq here will cause the
1896 * consistence check to fail in the netlink callback
1897 * handler. Resulting in the NLMSG_DONE message having
1898 * the NLM_F_DUMP_INTR flag set if the node state
1899 * changed while we released the lock.
1904 tipc_node_put(node);
1907 list_for_each_entry_rcu(node, &tn->node_list, list) {
1909 if (node->addr == last_addr)
1915 tipc_node_read_lock(node);
1916 err = __tipc_nl_add_node(&msg, node);
1918 last_addr = node->addr;
1919 tipc_node_read_unlock(node);
1923 tipc_node_read_unlock(node);
1928 cb->args[1] = last_addr;
1934 /* tipc_node_find_by_name - locate owner node of link by link's name
1935 * @net: the applicable net namespace
1936 * @name: pointer to link name string
1937 * @bearer_id: pointer to index in 'node->links' array where the link was found.
1939 * Returns pointer to node owning the link, or 0 if no matching link is found.
1941 static struct tipc_node *tipc_node_find_by_name(struct net *net,
1942 const char *link_name,
1943 unsigned int *bearer_id)
1945 struct tipc_net *tn = net_generic(net, tipc_net_id);
1946 struct tipc_link *l;
1947 struct tipc_node *n;
1948 struct tipc_node *found_node = NULL;
1953 list_for_each_entry_rcu(n, &tn->node_list, list) {
1954 tipc_node_read_lock(n);
1955 for (i = 0; i < MAX_BEARERS; i++) {
1956 l = n->links[i].link;
1957 if (l && !strcmp(tipc_link_name(l), link_name)) {
1963 tipc_node_read_unlock(n);
1972 int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info)
1978 struct tipc_link *link;
1979 struct tipc_node *node;
1980 struct sk_buff_head xmitq;
1981 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1982 struct net *net = sock_net(skb->sk);
1984 __skb_queue_head_init(&xmitq);
1986 if (!info->attrs[TIPC_NLA_LINK])
1989 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1990 info->attrs[TIPC_NLA_LINK],
1991 tipc_nl_link_policy, info->extack);
1995 if (!attrs[TIPC_NLA_LINK_NAME])
1998 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2000 if (strcmp(name, tipc_bclink_name) == 0)
2001 return tipc_nl_bc_link_set(net, attrs);
2003 node = tipc_node_find_by_name(net, name, &bearer_id);
2007 tipc_node_read_lock(node);
2009 link = node->links[bearer_id].link;
2015 if (attrs[TIPC_NLA_LINK_PROP]) {
2016 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
2018 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
2025 if (props[TIPC_NLA_PROP_TOL]) {
2028 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
2029 tipc_link_set_tolerance(link, tol, &xmitq);
2031 if (props[TIPC_NLA_PROP_PRIO]) {
2034 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
2035 tipc_link_set_prio(link, prio, &xmitq);
2037 if (props[TIPC_NLA_PROP_WIN]) {
2040 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
2041 tipc_link_set_queue_limits(link, win);
2046 tipc_node_read_unlock(node);
2047 tipc_bearer_xmit(net, bearer_id, &xmitq, &node->links[bearer_id].maddr);
2051 int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info)
2053 struct net *net = genl_info_net(info);
2054 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2055 struct tipc_nl_msg msg;
2059 msg.portid = info->snd_portid;
2060 msg.seq = info->snd_seq;
2062 if (!info->attrs[TIPC_NLA_LINK])
2065 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
2066 info->attrs[TIPC_NLA_LINK],
2067 tipc_nl_link_policy, info->extack);
2071 if (!attrs[TIPC_NLA_LINK_NAME])
2074 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2076 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2080 if (strcmp(name, tipc_bclink_name) == 0) {
2081 err = tipc_nl_add_bc_link(net, &msg);
2086 struct tipc_node *node;
2087 struct tipc_link *link;
2089 node = tipc_node_find_by_name(net, name, &bearer_id);
2095 tipc_node_read_lock(node);
2096 link = node->links[bearer_id].link;
2098 tipc_node_read_unlock(node);
2103 err = __tipc_nl_add_link(net, &msg, link, 0);
2104 tipc_node_read_unlock(node);
2109 return genlmsg_reply(msg.skb, info);
2112 nlmsg_free(msg.skb);
2116 int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info)
2120 unsigned int bearer_id;
2121 struct tipc_link *link;
2122 struct tipc_node *node;
2123 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2124 struct net *net = sock_net(skb->sk);
2125 struct tipc_link_entry *le;
2127 if (!info->attrs[TIPC_NLA_LINK])
2130 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
2131 info->attrs[TIPC_NLA_LINK],
2132 tipc_nl_link_policy, info->extack);
2136 if (!attrs[TIPC_NLA_LINK_NAME])
2139 link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2141 if (strcmp(link_name, tipc_bclink_name) == 0) {
2142 err = tipc_bclink_reset_stats(net);
2148 node = tipc_node_find_by_name(net, link_name, &bearer_id);
2152 le = &node->links[bearer_id];
2153 tipc_node_read_lock(node);
2154 spin_lock_bh(&le->lock);
2155 link = node->links[bearer_id].link;
2157 spin_unlock_bh(&le->lock);
2158 tipc_node_read_unlock(node);
2161 tipc_link_reset_stats(link);
2162 spin_unlock_bh(&le->lock);
2163 tipc_node_read_unlock(node);
2167 /* Caller should hold node lock */
2168 static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
2169 struct tipc_node *node, u32 *prev_link)
2174 for (i = *prev_link; i < MAX_BEARERS; i++) {
2177 if (!node->links[i].link)
2180 err = __tipc_nl_add_link(net, msg,
2181 node->links[i].link, NLM_F_MULTI);
2190 int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb)
2192 struct net *net = sock_net(skb->sk);
2193 struct tipc_net *tn = net_generic(net, tipc_net_id);
2194 struct tipc_node *node;
2195 struct tipc_nl_msg msg;
2196 u32 prev_node = cb->args[0];
2197 u32 prev_link = cb->args[1];
2198 int done = cb->args[2];
2205 msg.portid = NETLINK_CB(cb->skb).portid;
2206 msg.seq = cb->nlh->nlmsg_seq;
2210 node = tipc_node_find(net, prev_node);
2212 /* We never set seq or call nl_dump_check_consistent()
2213 * this means that setting prev_seq here will cause the
2214 * consistence check to fail in the netlink callback
2215 * handler. Resulting in the last NLMSG_DONE message
2216 * having the NLM_F_DUMP_INTR flag set.
2221 tipc_node_put(node);
2223 list_for_each_entry_continue_rcu(node, &tn->node_list,
2225 tipc_node_read_lock(node);
2226 err = __tipc_nl_add_node_links(net, &msg, node,
2228 tipc_node_read_unlock(node);
2232 prev_node = node->addr;
2235 err = tipc_nl_add_bc_link(net, &msg);
2239 list_for_each_entry_rcu(node, &tn->node_list, list) {
2240 tipc_node_read_lock(node);
2241 err = __tipc_nl_add_node_links(net, &msg, node,
2243 tipc_node_read_unlock(node);
2247 prev_node = node->addr;
2254 cb->args[0] = prev_node;
2255 cb->args[1] = prev_link;
2261 int tipc_nl_node_set_monitor(struct sk_buff *skb, struct genl_info *info)
2263 struct nlattr *attrs[TIPC_NLA_MON_MAX + 1];
2264 struct net *net = sock_net(skb->sk);
2267 if (!info->attrs[TIPC_NLA_MON])
2270 err = nla_parse_nested(attrs, TIPC_NLA_MON_MAX,
2271 info->attrs[TIPC_NLA_MON],
2272 tipc_nl_monitor_policy, info->extack);
2276 if (attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]) {
2279 val = nla_get_u32(attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]);
2280 err = tipc_nl_monitor_set_threshold(net, val);
2288 static int __tipc_nl_add_monitor_prop(struct net *net, struct tipc_nl_msg *msg)
2290 struct nlattr *attrs;
2294 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
2295 0, TIPC_NL_MON_GET);
2299 attrs = nla_nest_start(msg->skb, TIPC_NLA_MON);
2303 val = tipc_nl_monitor_get_threshold(net);
2305 if (nla_put_u32(msg->skb, TIPC_NLA_MON_ACTIVATION_THRESHOLD, val))
2308 nla_nest_end(msg->skb, attrs);
2309 genlmsg_end(msg->skb, hdr);
2314 nla_nest_cancel(msg->skb, attrs);
2316 genlmsg_cancel(msg->skb, hdr);
2321 int tipc_nl_node_get_monitor(struct sk_buff *skb, struct genl_info *info)
2323 struct net *net = sock_net(skb->sk);
2324 struct tipc_nl_msg msg;
2327 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2330 msg.portid = info->snd_portid;
2331 msg.seq = info->snd_seq;
2333 err = __tipc_nl_add_monitor_prop(net, &msg);
2335 nlmsg_free(msg.skb);
2339 return genlmsg_reply(msg.skb, info);
2342 int tipc_nl_node_dump_monitor(struct sk_buff *skb, struct netlink_callback *cb)
2344 struct net *net = sock_net(skb->sk);
2345 u32 prev_bearer = cb->args[0];
2346 struct tipc_nl_msg msg;
2350 if (prev_bearer == MAX_BEARERS)
2354 msg.portid = NETLINK_CB(cb->skb).portid;
2355 msg.seq = cb->nlh->nlmsg_seq;
2358 for (bearer_id = prev_bearer; bearer_id < MAX_BEARERS; bearer_id++) {
2359 err = __tipc_nl_add_monitor(net, &msg, bearer_id);
2364 cb->args[0] = bearer_id;
2369 int tipc_nl_node_dump_monitor_peer(struct sk_buff *skb,
2370 struct netlink_callback *cb)
2372 struct net *net = sock_net(skb->sk);
2373 u32 prev_node = cb->args[1];
2374 u32 bearer_id = cb->args[2];
2375 int done = cb->args[0];
2376 struct tipc_nl_msg msg;
2380 struct nlattr **attrs;
2381 struct nlattr *mon[TIPC_NLA_MON_MAX + 1];
2383 err = tipc_nlmsg_parse(cb->nlh, &attrs);
2387 if (!attrs[TIPC_NLA_MON])
2390 err = nla_parse_nested(mon, TIPC_NLA_MON_MAX,
2391 attrs[TIPC_NLA_MON],
2392 tipc_nl_monitor_policy, NULL);
2396 if (!mon[TIPC_NLA_MON_REF])
2399 bearer_id = nla_get_u32(mon[TIPC_NLA_MON_REF]);
2401 if (bearer_id >= MAX_BEARERS)
2409 msg.portid = NETLINK_CB(cb->skb).portid;
2410 msg.seq = cb->nlh->nlmsg_seq;
2413 err = tipc_nl_add_monitor_peer(net, &msg, bearer_id, &prev_node);
2419 cb->args[1] = prev_node;
2420 cb->args[2] = bearer_id;