2 * net/tipc/node.c: TIPC node management routines
4 * Copyright (c) 2000-2006, 2012-2016, Ericsson AB
5 * Copyright (c) 2005-2006, 2010-2014, Wind River Systems
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
20 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
40 #include "name_distr.h"
49 #define INVALID_NODE_SIG 0x10000
50 #define NODE_CLEANUP_AFTER 300000
52 /* Flags used to take different actions according to flag type
53 * TIPC_NOTIFY_NODE_DOWN: notify node is down
54 * TIPC_NOTIFY_NODE_UP: notify node is up
55 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
58 TIPC_NOTIFY_NODE_DOWN = (1 << 3),
59 TIPC_NOTIFY_NODE_UP = (1 << 4),
60 TIPC_NOTIFY_LINK_UP = (1 << 6),
61 TIPC_NOTIFY_LINK_DOWN = (1 << 7)
64 struct tipc_link_entry {
65 struct tipc_link *link;
66 spinlock_t lock; /* per link */
68 struct sk_buff_head inputq;
69 struct tipc_media_addr maddr;
72 struct tipc_bclink_entry {
73 struct tipc_link *link;
74 struct sk_buff_head inputq1;
75 struct sk_buff_head arrvq;
76 struct sk_buff_head inputq2;
77 struct sk_buff_head namedq;
83 * struct tipc_node - TIPC node structure
84 * @addr: network address of node
85 * @ref: reference counter to node object
86 * @lock: rwlock governing access to structure
87 * @net: the applicable net namespace
88 * @hash: links to adjacent nodes in unsorted hash chain
89 * @inputq: pointer to input queue containing messages for msg event
90 * @namedq: pointer to name table input queue with name table messages
91 * @active_links: bearer ids of active links, used as index into links[] array
92 * @links: array containing references to all links to node
93 * @action_flags: bit mask of different types of node actions
94 * @state: connectivity state vs peer node
95 * @preliminary: a preliminary node or not
96 * @sync_point: sequence number where synch/failover is finished
97 * @list: links to adjacent nodes in sorted list of cluster's nodes
98 * @working_links: number of working links to node (both active and standby)
99 * @link_cnt: number of links to node
100 * @capabilities: bitmap, indicating peer node's functional capabilities
101 * @signature: node instance identifier
102 * @link_id: local and remote bearer ids of changing link, if any
103 * @publ_list: list of publications
104 * @rcu: rcu struct for tipc_node
105 * @delete_at: indicates the time for deleting a down node
106 * @crypto_rx: RX crypto handler
113 struct hlist_node hash;
115 struct tipc_link_entry links[MAX_BEARERS];
116 struct tipc_bclink_entry bc_entry;
118 struct list_head list;
129 char peer_id_string[NODE_ID_STR_LEN];
130 struct list_head publ_list;
131 struct list_head conn_sks;
132 unsigned long keepalive_intv;
133 struct timer_list timer;
135 unsigned long delete_at;
136 struct net *peer_net;
138 #ifdef CONFIG_TIPC_CRYPTO
139 struct tipc_crypto *crypto_rx;
143 /* Node FSM states and events:
146 SELF_DOWN_PEER_DOWN = 0xdd,
147 SELF_UP_PEER_UP = 0xaa,
148 SELF_DOWN_PEER_LEAVING = 0xd1,
149 SELF_UP_PEER_COMING = 0xac,
150 SELF_COMING_PEER_UP = 0xca,
151 SELF_LEAVING_PEER_DOWN = 0x1d,
152 NODE_FAILINGOVER = 0xf0,
157 SELF_ESTABL_CONTACT_EVT = 0xece,
158 SELF_LOST_CONTACT_EVT = 0x1ce,
159 PEER_ESTABL_CONTACT_EVT = 0x9ece,
160 PEER_LOST_CONTACT_EVT = 0x91ce,
161 NODE_FAILOVER_BEGIN_EVT = 0xfbe,
162 NODE_FAILOVER_END_EVT = 0xfee,
163 NODE_SYNCH_BEGIN_EVT = 0xcbe,
164 NODE_SYNCH_END_EVT = 0xcee
167 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
168 struct sk_buff_head *xmitq,
169 struct tipc_media_addr **maddr);
170 static void tipc_node_link_down(struct tipc_node *n, int bearer_id,
172 static void node_lost_contact(struct tipc_node *n, struct sk_buff_head *inputq);
173 static void tipc_node_delete(struct tipc_node *node);
174 static void tipc_node_timeout(struct timer_list *t);
175 static void tipc_node_fsm_evt(struct tipc_node *n, int evt);
176 static struct tipc_node *tipc_node_find(struct net *net, u32 addr);
177 static struct tipc_node *tipc_node_find_by_id(struct net *net, u8 *id);
178 static bool node_is_up(struct tipc_node *n);
179 static void tipc_node_delete_from_list(struct tipc_node *node);
181 struct tipc_sock_conn {
185 struct list_head list;
188 static struct tipc_link *node_active_link(struct tipc_node *n, int sel)
190 int bearer_id = n->active_links[sel & 1];
192 if (unlikely(bearer_id == INVALID_BEARER_ID))
195 return n->links[bearer_id].link;
198 int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel, bool connected)
202 unsigned int mtu = MAX_MSG_SIZE;
204 n = tipc_node_find(net, addr);
208 /* Allow MAX_MSG_SIZE when building connection oriented message
209 * if they are in the same core network
211 if (n->peer_net && connected) {
216 bearer_id = n->active_links[sel & 1];
217 if (likely(bearer_id != INVALID_BEARER_ID))
218 mtu = n->links[bearer_id].mtu;
223 bool tipc_node_get_id(struct net *net, u32 addr, u8 *id)
225 u8 *own_id = tipc_own_id(net);
231 if (addr == tipc_own_addr(net)) {
232 memcpy(id, own_id, TIPC_NODEID_LEN);
235 n = tipc_node_find(net, addr);
239 memcpy(id, &n->peer_id, TIPC_NODEID_LEN);
244 u16 tipc_node_get_capabilities(struct net *net, u32 addr)
249 n = tipc_node_find(net, addr);
251 return TIPC_NODE_CAPABILITIES;
252 caps = n->capabilities;
257 u32 tipc_node_get_addr(struct tipc_node *node)
259 return (node) ? node->addr : 0;
262 char *tipc_node_get_id_str(struct tipc_node *node)
264 return node->peer_id_string;
267 #ifdef CONFIG_TIPC_CRYPTO
269 * tipc_node_crypto_rx - Retrieve crypto RX handle from node
270 * Note: node ref counter must be held first!
272 struct tipc_crypto *tipc_node_crypto_rx(struct tipc_node *__n)
274 return (__n) ? __n->crypto_rx : NULL;
277 struct tipc_crypto *tipc_node_crypto_rx_by_list(struct list_head *pos)
279 return container_of(pos, struct tipc_node, list)->crypto_rx;
282 struct tipc_crypto *tipc_node_crypto_rx_by_addr(struct net *net, u32 addr)
286 n = tipc_node_find(net, addr);
287 return (n) ? n->crypto_rx : NULL;
291 static void tipc_node_free(struct rcu_head *rp)
293 struct tipc_node *n = container_of(rp, struct tipc_node, rcu);
295 #ifdef CONFIG_TIPC_CRYPTO
296 tipc_crypto_stop(&n->crypto_rx);
301 static void tipc_node_kref_release(struct kref *kref)
303 struct tipc_node *n = container_of(kref, struct tipc_node, kref);
305 kfree(n->bc_entry.link);
306 call_rcu(&n->rcu, tipc_node_free);
309 void tipc_node_put(struct tipc_node *node)
311 kref_put(&node->kref, tipc_node_kref_release);
314 void tipc_node_get(struct tipc_node *node)
316 kref_get(&node->kref);
320 * tipc_node_find - locate specified node object, if it exists
322 static struct tipc_node *tipc_node_find(struct net *net, u32 addr)
324 struct tipc_net *tn = tipc_net(net);
325 struct tipc_node *node;
326 unsigned int thash = tipc_hashfn(addr);
329 hlist_for_each_entry_rcu(node, &tn->node_htable[thash], hash) {
330 if (node->addr != addr || node->preliminary)
332 if (!kref_get_unless_zero(&node->kref))
340 /* tipc_node_find_by_id - locate specified node object by its 128-bit id
341 * Note: this function is called only when a discovery request failed
342 * to find the node by its 32-bit id, and is not time critical
344 static struct tipc_node *tipc_node_find_by_id(struct net *net, u8 *id)
346 struct tipc_net *tn = tipc_net(net);
351 list_for_each_entry_rcu(n, &tn->node_list, list) {
352 read_lock_bh(&n->lock);
353 if (!memcmp(id, n->peer_id, 16) &&
354 kref_get_unless_zero(&n->kref))
356 read_unlock_bh(&n->lock);
361 return found ? n : NULL;
364 static void tipc_node_read_lock(struct tipc_node *n)
366 read_lock_bh(&n->lock);
369 static void tipc_node_read_unlock(struct tipc_node *n)
371 read_unlock_bh(&n->lock);
374 static void tipc_node_write_lock(struct tipc_node *n)
376 write_lock_bh(&n->lock);
379 static void tipc_node_write_unlock_fast(struct tipc_node *n)
381 write_unlock_bh(&n->lock);
384 static void tipc_node_write_unlock(struct tipc_node *n)
386 struct net *net = n->net;
388 u32 flags = n->action_flags;
391 struct list_head *publ_list;
393 if (likely(!flags)) {
394 write_unlock_bh(&n->lock);
399 link_id = n->link_id;
400 bearer_id = link_id & 0xffff;
401 publ_list = &n->publ_list;
403 n->action_flags &= ~(TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP |
404 TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP);
406 write_unlock_bh(&n->lock);
408 if (flags & TIPC_NOTIFY_NODE_DOWN)
409 tipc_publ_notify(net, publ_list, addr, n->capabilities);
411 if (flags & TIPC_NOTIFY_NODE_UP)
412 tipc_named_node_up(net, addr, n->capabilities);
414 if (flags & TIPC_NOTIFY_LINK_UP) {
415 tipc_mon_peer_up(net, addr, bearer_id);
416 tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr,
417 TIPC_NODE_SCOPE, link_id, link_id);
419 if (flags & TIPC_NOTIFY_LINK_DOWN) {
420 tipc_mon_peer_down(net, addr, bearer_id);
421 tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr,
426 static void tipc_node_assign_peer_net(struct tipc_node *n, u32 hash_mixes)
428 int net_id = tipc_netid(n->net);
429 struct tipc_net *tn_peer;
436 for_each_net_rcu(tmp) {
437 tn_peer = tipc_net(tmp);
440 /* Integrity checking whether node exists in namespace or not */
441 if (tn_peer->net_id != net_id)
443 if (memcmp(n->peer_id, tn_peer->node_id, NODE_ID_LEN))
445 hash_chk = tipc_net_hash_mixes(tmp, tn_peer->random);
446 if (hash_mixes ^ hash_chk)
449 n->peer_hash_mix = hash_mixes;
454 struct tipc_node *tipc_node_create(struct net *net, u32 addr, u8 *peer_id,
455 u16 capabilities, u32 hash_mixes,
458 struct tipc_net *tn = net_generic(net, tipc_net_id);
459 struct tipc_link *l, *snd_l = tipc_bc_sndlink(net);
460 struct tipc_node *n, *temp_node;
465 spin_lock_bh(&tn->node_list_lock);
466 n = tipc_node_find(net, addr) ?:
467 tipc_node_find_by_id(net, peer_id);
473 /* A preliminary node becomes "real" now, refresh its data */
474 tipc_node_write_lock(n);
475 if (!tipc_link_bc_create(net, tipc_own_addr(net), addr, peer_id, U16_MAX,
476 tipc_link_min_win(snd_l), tipc_link_max_win(snd_l),
477 n->capabilities, &n->bc_entry.inputq1,
478 &n->bc_entry.namedq, snd_l, &n->bc_entry.link)) {
479 pr_warn("Broadcast rcv link refresh failed, no memory\n");
480 tipc_node_write_unlock_fast(n);
485 n->preliminary = false;
487 hlist_del_rcu(&n->hash);
488 hlist_add_head_rcu(&n->hash,
489 &tn->node_htable[tipc_hashfn(addr)]);
490 list_del_rcu(&n->list);
491 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
492 if (n->addr < temp_node->addr)
495 list_add_tail_rcu(&n->list, &temp_node->list);
496 tipc_node_write_unlock_fast(n);
499 if (n->peer_hash_mix ^ hash_mixes)
500 tipc_node_assign_peer_net(n, hash_mixes);
501 if (n->capabilities == capabilities)
503 /* Same node may come back with new capabilities */
504 tipc_node_write_lock(n);
505 n->capabilities = capabilities;
506 for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) {
507 l = n->links[bearer_id].link;
509 tipc_link_update_caps(l, capabilities);
511 tipc_node_write_unlock_fast(n);
513 /* Calculate cluster capabilities */
514 tn->capabilities = TIPC_NODE_CAPABILITIES;
515 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
516 tn->capabilities &= temp_node->capabilities;
519 tipc_bcast_toggle_rcast(net,
520 (tn->capabilities & TIPC_BCAST_RCAST));
524 n = kzalloc(sizeof(*n), GFP_ATOMIC);
526 pr_warn("Node creation failed, no memory\n");
529 tipc_nodeid2string(n->peer_id_string, peer_id);
530 #ifdef CONFIG_TIPC_CRYPTO
531 if (unlikely(tipc_crypto_start(&n->crypto_rx, net, n))) {
532 pr_warn("Failed to start crypto RX(%s)!\n", n->peer_id_string);
539 n->preliminary = preliminary;
540 memcpy(&n->peer_id, peer_id, 16);
543 n->peer_hash_mix = 0;
544 /* Assign kernel local namespace if exists */
545 tipc_node_assign_peer_net(n, hash_mixes);
546 n->capabilities = capabilities;
548 rwlock_init(&n->lock);
549 INIT_HLIST_NODE(&n->hash);
550 INIT_LIST_HEAD(&n->list);
551 INIT_LIST_HEAD(&n->publ_list);
552 INIT_LIST_HEAD(&n->conn_sks);
553 skb_queue_head_init(&n->bc_entry.namedq);
554 skb_queue_head_init(&n->bc_entry.inputq1);
555 __skb_queue_head_init(&n->bc_entry.arrvq);
556 skb_queue_head_init(&n->bc_entry.inputq2);
557 for (i = 0; i < MAX_BEARERS; i++)
558 spin_lock_init(&n->links[i].lock);
559 n->state = SELF_DOWN_PEER_LEAVING;
560 n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
561 n->signature = INVALID_NODE_SIG;
562 n->active_links[0] = INVALID_BEARER_ID;
563 n->active_links[1] = INVALID_BEARER_ID;
565 !tipc_link_bc_create(net, tipc_own_addr(net), addr, peer_id, U16_MAX,
566 tipc_link_min_win(snd_l), tipc_link_max_win(snd_l),
567 n->capabilities, &n->bc_entry.inputq1,
568 &n->bc_entry.namedq, snd_l, &n->bc_entry.link)) {
569 pr_warn("Broadcast rcv link creation failed, no memory\n");
575 timer_setup(&n->timer, tipc_node_timeout, 0);
576 /* Start a slow timer anyway, crypto needs it */
577 n->keepalive_intv = 10000;
578 intv = jiffies + msecs_to_jiffies(n->keepalive_intv);
579 if (!mod_timer(&n->timer, intv))
581 hlist_add_head_rcu(&n->hash, &tn->node_htable[tipc_hashfn(addr)]);
582 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
583 if (n->addr < temp_node->addr)
586 list_add_tail_rcu(&n->list, &temp_node->list);
587 /* Calculate cluster capabilities */
588 tn->capabilities = TIPC_NODE_CAPABILITIES;
589 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
590 tn->capabilities &= temp_node->capabilities;
592 tipc_bcast_toggle_rcast(net, (tn->capabilities & TIPC_BCAST_RCAST));
593 trace_tipc_node_create(n, true, " ");
595 spin_unlock_bh(&tn->node_list_lock);
599 static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l)
601 unsigned long tol = tipc_link_tolerance(l);
602 unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4;
604 /* Link with lowest tolerance determines timer interval */
605 if (intv < n->keepalive_intv)
606 n->keepalive_intv = intv;
608 /* Ensure link's abort limit corresponds to current tolerance */
609 tipc_link_set_abort_limit(l, tol / n->keepalive_intv);
612 static void tipc_node_delete_from_list(struct tipc_node *node)
614 #ifdef CONFIG_TIPC_CRYPTO
615 tipc_crypto_key_flush(node->crypto_rx);
617 list_del_rcu(&node->list);
618 hlist_del_rcu(&node->hash);
622 static void tipc_node_delete(struct tipc_node *node)
624 trace_tipc_node_delete(node, true, " ");
625 tipc_node_delete_from_list(node);
627 del_timer_sync(&node->timer);
631 void tipc_node_stop(struct net *net)
633 struct tipc_net *tn = tipc_net(net);
634 struct tipc_node *node, *t_node;
636 spin_lock_bh(&tn->node_list_lock);
637 list_for_each_entry_safe(node, t_node, &tn->node_list, list)
638 tipc_node_delete(node);
639 spin_unlock_bh(&tn->node_list_lock);
642 void tipc_node_subscribe(struct net *net, struct list_head *subscr, u32 addr)
646 if (in_own_node(net, addr))
649 n = tipc_node_find(net, addr);
651 pr_warn("Node subscribe rejected, unknown node 0x%x\n", addr);
654 tipc_node_write_lock(n);
655 list_add_tail(subscr, &n->publ_list);
656 tipc_node_write_unlock_fast(n);
660 void tipc_node_unsubscribe(struct net *net, struct list_head *subscr, u32 addr)
664 if (in_own_node(net, addr))
667 n = tipc_node_find(net, addr);
669 pr_warn("Node unsubscribe rejected, unknown node 0x%x\n", addr);
672 tipc_node_write_lock(n);
673 list_del_init(subscr);
674 tipc_node_write_unlock_fast(n);
678 int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port)
680 struct tipc_node *node;
681 struct tipc_sock_conn *conn;
684 if (in_own_node(net, dnode))
687 node = tipc_node_find(net, dnode);
689 pr_warn("Connecting sock to node 0x%x failed\n", dnode);
690 return -EHOSTUNREACH;
692 conn = kmalloc(sizeof(*conn), GFP_ATOMIC);
697 conn->peer_node = dnode;
699 conn->peer_port = peer_port;
701 tipc_node_write_lock(node);
702 list_add_tail(&conn->list, &node->conn_sks);
703 tipc_node_write_unlock(node);
709 void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port)
711 struct tipc_node *node;
712 struct tipc_sock_conn *conn, *safe;
714 if (in_own_node(net, dnode))
717 node = tipc_node_find(net, dnode);
721 tipc_node_write_lock(node);
722 list_for_each_entry_safe(conn, safe, &node->conn_sks, list) {
723 if (port != conn->port)
725 list_del(&conn->list);
728 tipc_node_write_unlock(node);
732 static void tipc_node_clear_links(struct tipc_node *node)
736 for (i = 0; i < MAX_BEARERS; i++) {
737 struct tipc_link_entry *le = &node->links[i];
747 /* tipc_node_cleanup - delete nodes that does not
748 * have active links for NODE_CLEANUP_AFTER time
750 static bool tipc_node_cleanup(struct tipc_node *peer)
752 struct tipc_node *temp_node;
753 struct tipc_net *tn = tipc_net(peer->net);
754 bool deleted = false;
756 /* If lock held by tipc_node_stop() the node will be deleted anyway */
757 if (!spin_trylock_bh(&tn->node_list_lock))
760 tipc_node_write_lock(peer);
762 if (!node_is_up(peer) && time_after(jiffies, peer->delete_at)) {
763 tipc_node_clear_links(peer);
764 tipc_node_delete_from_list(peer);
767 tipc_node_write_unlock(peer);
770 spin_unlock_bh(&tn->node_list_lock);
774 /* Calculate cluster capabilities */
775 tn->capabilities = TIPC_NODE_CAPABILITIES;
776 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
777 tn->capabilities &= temp_node->capabilities;
779 tipc_bcast_toggle_rcast(peer->net,
780 (tn->capabilities & TIPC_BCAST_RCAST));
781 spin_unlock_bh(&tn->node_list_lock);
785 /* tipc_node_timeout - handle expiration of node timer
787 static void tipc_node_timeout(struct timer_list *t)
789 struct tipc_node *n = from_timer(n, t, timer);
790 struct tipc_link_entry *le;
791 struct sk_buff_head xmitq;
792 int remains = n->link_cnt;
796 trace_tipc_node_timeout(n, false, " ");
797 if (!node_is_up(n) && tipc_node_cleanup(n)) {
798 /*Removing the reference of Timer*/
803 #ifdef CONFIG_TIPC_CRYPTO
804 /* Take any crypto key related actions first */
805 tipc_crypto_timeout(n->crypto_rx);
807 __skb_queue_head_init(&xmitq);
809 /* Initial node interval to value larger (10 seconds), then it will be
810 * recalculated with link lowest tolerance
812 tipc_node_read_lock(n);
813 n->keepalive_intv = 10000;
814 tipc_node_read_unlock(n);
815 for (bearer_id = 0; remains && (bearer_id < MAX_BEARERS); bearer_id++) {
816 tipc_node_read_lock(n);
817 le = &n->links[bearer_id];
819 spin_lock_bh(&le->lock);
820 /* Link tolerance may change asynchronously: */
821 tipc_node_calculate_timer(n, le->link);
822 rc = tipc_link_timeout(le->link, &xmitq);
823 spin_unlock_bh(&le->lock);
826 tipc_node_read_unlock(n);
827 tipc_bearer_xmit(n->net, bearer_id, &xmitq, &le->maddr, n);
828 if (rc & TIPC_LINK_DOWN_EVT)
829 tipc_node_link_down(n, bearer_id, false);
831 mod_timer(&n->timer, jiffies + msecs_to_jiffies(n->keepalive_intv));
835 * __tipc_node_link_up - handle addition of link
836 * Node lock must be held by caller
837 * Link becomes active (alone or shared) or standby, depending on its priority.
839 static void __tipc_node_link_up(struct tipc_node *n, int bearer_id,
840 struct sk_buff_head *xmitq)
842 int *slot0 = &n->active_links[0];
843 int *slot1 = &n->active_links[1];
844 struct tipc_link *ol = node_active_link(n, 0);
845 struct tipc_link *nl = n->links[bearer_id].link;
847 if (!nl || tipc_link_is_up(nl))
850 tipc_link_fsm_evt(nl, LINK_ESTABLISH_EVT);
851 if (!tipc_link_is_up(nl))
855 n->action_flags |= TIPC_NOTIFY_LINK_UP;
856 n->link_id = tipc_link_id(nl);
858 /* Leave room for tunnel header when returning 'mtu' to users: */
859 n->links[bearer_id].mtu = tipc_link_mss(nl);
861 tipc_bearer_add_dest(n->net, bearer_id, n->addr);
862 tipc_bcast_inc_bearer_dst_cnt(n->net, bearer_id);
864 pr_debug("Established link <%s> on network plane %c\n",
865 tipc_link_name(nl), tipc_link_plane(nl));
866 trace_tipc_node_link_up(n, true, " ");
868 /* Ensure that a STATE message goes first */
869 tipc_link_build_state_msg(nl, xmitq);
871 /* First link? => give it both slots */
875 tipc_node_fsm_evt(n, SELF_ESTABL_CONTACT_EVT);
876 n->action_flags |= TIPC_NOTIFY_NODE_UP;
877 tipc_link_set_active(nl, true);
878 tipc_bcast_add_peer(n->net, nl, xmitq);
882 /* Second link => redistribute slots */
883 if (tipc_link_prio(nl) > tipc_link_prio(ol)) {
884 pr_debug("Old link <%s> becomes standby\n", tipc_link_name(ol));
887 tipc_link_set_active(nl, true);
888 tipc_link_set_active(ol, false);
889 } else if (tipc_link_prio(nl) == tipc_link_prio(ol)) {
890 tipc_link_set_active(nl, true);
893 pr_debug("New link <%s> is standby\n", tipc_link_name(nl));
896 /* Prepare synchronization with first link */
897 tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq);
901 * tipc_node_link_up - handle addition of link
903 * Link becomes active (alone or shared) or standby, depending on its priority.
905 static void tipc_node_link_up(struct tipc_node *n, int bearer_id,
906 struct sk_buff_head *xmitq)
908 struct tipc_media_addr *maddr;
910 tipc_node_write_lock(n);
911 __tipc_node_link_up(n, bearer_id, xmitq);
912 maddr = &n->links[bearer_id].maddr;
913 tipc_bearer_xmit(n->net, bearer_id, xmitq, maddr, n);
914 tipc_node_write_unlock(n);
918 * tipc_node_link_failover() - start failover in case "half-failover"
920 * This function is only called in a very special situation where link
921 * failover can be already started on peer node but not on this node.
922 * This can happen when e.g.
923 * 1. Both links <1A-2A>, <1B-2B> down
924 * 2. Link endpoint 2A up, but 1A still down (e.g. due to network
925 * disturbance, wrong session, etc.)
927 * 4. Link endpoint 2A down (e.g. due to link tolerance timeout)
928 * 5. Node 2 starts failover onto link <1B-2B>
930 * ==> Node 1 does never start link/node failover!
932 * @n: tipc node structure
933 * @l: link peer endpoint failingover (- can be NULL)
935 * @xmitq: queue for messages to be xmited on tnl link later
937 static void tipc_node_link_failover(struct tipc_node *n, struct tipc_link *l,
938 struct tipc_link *tnl,
939 struct sk_buff_head *xmitq)
941 /* Avoid to be "self-failover" that can never end */
942 if (!tipc_link_is_up(tnl))
945 /* Don't rush, failure link may be in the process of resetting */
946 if (l && !tipc_link_is_reset(l))
949 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
950 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
952 n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
953 tipc_link_failover_prepare(l, tnl, xmitq);
956 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
957 tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
961 * __tipc_node_link_down - handle loss of link
963 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
964 struct sk_buff_head *xmitq,
965 struct tipc_media_addr **maddr)
967 struct tipc_link_entry *le = &n->links[*bearer_id];
968 int *slot0 = &n->active_links[0];
969 int *slot1 = &n->active_links[1];
970 int i, highest = 0, prio;
971 struct tipc_link *l, *_l, *tnl;
973 l = n->links[*bearer_id].link;
974 if (!l || tipc_link_is_reset(l))
978 n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
979 n->link_id = tipc_link_id(l);
981 tipc_bearer_remove_dest(n->net, *bearer_id, n->addr);
983 pr_debug("Lost link <%s> on network plane %c\n",
984 tipc_link_name(l), tipc_link_plane(l));
986 /* Select new active link if any available */
987 *slot0 = INVALID_BEARER_ID;
988 *slot1 = INVALID_BEARER_ID;
989 for (i = 0; i < MAX_BEARERS; i++) {
990 _l = n->links[i].link;
991 if (!_l || !tipc_link_is_up(_l))
995 prio = tipc_link_prio(_l);
998 if (prio > highest) {
1007 if (!node_is_up(n)) {
1008 if (tipc_link_peer_is_down(l))
1009 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
1010 tipc_node_fsm_evt(n, SELF_LOST_CONTACT_EVT);
1011 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link down!");
1012 tipc_link_fsm_evt(l, LINK_RESET_EVT);
1014 tipc_link_build_reset_msg(l, xmitq);
1015 *maddr = &n->links[*bearer_id].maddr;
1016 node_lost_contact(n, &le->inputq);
1017 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
1020 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
1022 /* There is still a working link => initiate failover */
1023 *bearer_id = n->active_links[0];
1024 tnl = n->links[*bearer_id].link;
1025 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
1026 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
1027 n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
1028 tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, xmitq);
1029 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link down -> failover!");
1031 tipc_link_fsm_evt(l, LINK_RESET_EVT);
1032 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
1033 tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
1034 *maddr = &n->links[*bearer_id].maddr;
1037 static void tipc_node_link_down(struct tipc_node *n, int bearer_id, bool delete)
1039 struct tipc_link_entry *le = &n->links[bearer_id];
1040 struct tipc_media_addr *maddr = NULL;
1041 struct tipc_link *l = le->link;
1042 int old_bearer_id = bearer_id;
1043 struct sk_buff_head xmitq;
1048 __skb_queue_head_init(&xmitq);
1050 tipc_node_write_lock(n);
1051 if (!tipc_link_is_establishing(l)) {
1052 __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr);
1054 /* Defuse pending tipc_node_link_up() */
1056 tipc_link_fsm_evt(l, LINK_RESET_EVT);
1063 trace_tipc_node_link_down(n, true, "node link down or deleted!");
1064 tipc_node_write_unlock(n);
1066 tipc_mon_remove_peer(n->net, n->addr, old_bearer_id);
1067 if (!skb_queue_empty(&xmitq))
1068 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr, n);
1069 tipc_sk_rcv(n->net, &le->inputq);
1072 static bool node_is_up(struct tipc_node *n)
1074 return n->active_links[0] != INVALID_BEARER_ID;
1077 bool tipc_node_is_up(struct net *net, u32 addr)
1079 struct tipc_node *n;
1080 bool retval = false;
1082 if (in_own_node(net, addr))
1085 n = tipc_node_find(net, addr);
1088 retval = node_is_up(n);
1093 static u32 tipc_node_suggest_addr(struct net *net, u32 addr)
1095 struct tipc_node *n;
1097 addr ^= tipc_net(net)->random;
1098 while ((n = tipc_node_find(net, addr))) {
1105 /* tipc_node_try_addr(): Check if addr can be used by peer, suggest other if not
1106 * Returns suggested address if any, otherwise 0
1108 u32 tipc_node_try_addr(struct net *net, u8 *id, u32 addr)
1110 struct tipc_net *tn = tipc_net(net);
1111 struct tipc_node *n;
1115 /* Suggest new address if some other peer is using this one */
1116 n = tipc_node_find(net, addr);
1118 if (!memcmp(n->peer_id, id, NODE_ID_LEN))
1123 return tipc_node_suggest_addr(net, addr);
1126 /* Suggest previously used address if peer is known */
1127 n = tipc_node_find_by_id(net, id);
1129 sugg_addr = n->addr;
1130 preliminary = n->preliminary;
1136 /* Even this node may be in conflict */
1137 if (tn->trial_addr == addr)
1138 return tipc_node_suggest_addr(net, addr);
1143 void tipc_node_check_dest(struct net *net, u32 addr,
1144 u8 *peer_id, struct tipc_bearer *b,
1145 u16 capabilities, u32 signature, u32 hash_mixes,
1146 struct tipc_media_addr *maddr,
1147 bool *respond, bool *dupl_addr)
1149 struct tipc_node *n;
1150 struct tipc_link *l;
1151 struct tipc_link_entry *le;
1152 bool addr_match = false;
1153 bool sign_match = false;
1154 bool link_up = false;
1155 bool link_is_reset = false;
1156 bool accept_addr = false;
1165 n = tipc_node_create(net, addr, peer_id, capabilities, hash_mixes,
1170 tipc_node_write_lock(n);
1172 le = &n->links[b->identity];
1174 /* Prepare to validate requesting node's signature and media address */
1176 link_up = l && tipc_link_is_up(l);
1177 link_is_reset = l && tipc_link_is_reset(l);
1178 addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr));
1179 sign_match = (signature == n->signature);
1181 /* These three flags give us eight permutations: */
1183 if (sign_match && addr_match && link_up) {
1184 /* All is fine. Ignore requests. */
1185 /* Peer node is not a container/local namespace */
1186 if (!n->peer_hash_mix)
1187 n->peer_hash_mix = hash_mixes;
1188 } else if (sign_match && addr_match && !link_up) {
1189 /* Respond. The link will come up in due time */
1191 } else if (sign_match && !addr_match && link_up) {
1192 /* Peer has changed i/f address without rebooting.
1193 * If so, the link will reset soon, and the next
1194 * discovery will be accepted. So we can ignore it.
1195 * It may also be an cloned or malicious peer having
1196 * chosen the same node address and signature as an
1198 * Ignore requests until the link goes down, if ever.
1201 } else if (sign_match && !addr_match && !link_up) {
1202 /* Peer link has changed i/f address without rebooting.
1203 * It may also be a cloned or malicious peer; we can't
1204 * distinguish between the two.
1205 * The signature is correct, so we must accept.
1210 } else if (!sign_match && addr_match && link_up) {
1211 /* Peer node rebooted. Two possibilities:
1212 * - Delayed re-discovery; this link endpoint has already
1213 * reset and re-established contact with the peer, before
1214 * receiving a discovery message from that node.
1215 * (The peer happened to receive one from this node first).
1216 * - The peer came back so fast that our side has not
1217 * discovered it yet. Probing from this side will soon
1218 * reset the link, since there can be no working link
1219 * endpoint at the peer end, and the link will re-establish.
1220 * Accept the signature, since it comes from a known peer.
1222 n->signature = signature;
1223 } else if (!sign_match && addr_match && !link_up) {
1224 /* The peer node has rebooted.
1225 * Accept signature, since it is a known peer.
1227 n->signature = signature;
1229 } else if (!sign_match && !addr_match && link_up) {
1230 /* Peer rebooted with new address, or a new/duplicate peer.
1231 * Ignore until the link goes down, if ever.
1234 } else if (!sign_match && !addr_match && !link_up) {
1235 /* Peer rebooted with new address, or it is a new peer.
1236 * Accept signature and address.
1238 n->signature = signature;
1247 /* Now create new link if not already existing */
1249 if (n->link_cnt == 2)
1252 if_name = strchr(b->name, ':') + 1;
1253 get_random_bytes(&session, sizeof(u16));
1254 if (!tipc_link_create(net, if_name, b->identity, b->tolerance,
1255 b->net_plane, b->mtu, b->priority,
1256 b->min_win, b->max_win, session,
1257 tipc_own_addr(net), addr, peer_id,
1259 tipc_bc_sndlink(n->net), n->bc_entry.link,
1261 &n->bc_entry.namedq, &l)) {
1265 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link created!");
1267 tipc_link_fsm_evt(l, LINK_RESET_EVT);
1268 if (n->state == NODE_FAILINGOVER)
1269 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
1270 link_is_reset = tipc_link_is_reset(l);
1273 tipc_node_calculate_timer(n, l);
1274 if (n->link_cnt == 1) {
1275 intv = jiffies + msecs_to_jiffies(n->keepalive_intv);
1276 if (!mod_timer(&n->timer, intv))
1280 memcpy(&le->maddr, maddr, sizeof(*maddr));
1282 tipc_node_write_unlock(n);
1283 if (reset && !link_is_reset)
1284 tipc_node_link_down(n, b->identity, false);
1288 void tipc_node_delete_links(struct net *net, int bearer_id)
1290 struct tipc_net *tn = net_generic(net, tipc_net_id);
1291 struct tipc_node *n;
1294 list_for_each_entry_rcu(n, &tn->node_list, list) {
1295 tipc_node_link_down(n, bearer_id, true);
1300 static void tipc_node_reset_links(struct tipc_node *n)
1304 pr_warn("Resetting all links to %x\n", n->addr);
1306 trace_tipc_node_reset_links(n, true, " ");
1307 for (i = 0; i < MAX_BEARERS; i++) {
1308 tipc_node_link_down(n, i, false);
1312 /* tipc_node_fsm_evt - node finite state machine
1313 * Determines when contact is allowed with peer node
1315 static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
1317 int state = n->state;
1320 case SELF_DOWN_PEER_DOWN:
1322 case SELF_ESTABL_CONTACT_EVT:
1323 state = SELF_UP_PEER_COMING;
1325 case PEER_ESTABL_CONTACT_EVT:
1326 state = SELF_COMING_PEER_UP;
1328 case SELF_LOST_CONTACT_EVT:
1329 case PEER_LOST_CONTACT_EVT:
1331 case NODE_SYNCH_END_EVT:
1332 case NODE_SYNCH_BEGIN_EVT:
1333 case NODE_FAILOVER_BEGIN_EVT:
1334 case NODE_FAILOVER_END_EVT:
1339 case SELF_UP_PEER_UP:
1341 case SELF_LOST_CONTACT_EVT:
1342 state = SELF_DOWN_PEER_LEAVING;
1344 case PEER_LOST_CONTACT_EVT:
1345 state = SELF_LEAVING_PEER_DOWN;
1347 case NODE_SYNCH_BEGIN_EVT:
1348 state = NODE_SYNCHING;
1350 case NODE_FAILOVER_BEGIN_EVT:
1351 state = NODE_FAILINGOVER;
1353 case SELF_ESTABL_CONTACT_EVT:
1354 case PEER_ESTABL_CONTACT_EVT:
1355 case NODE_SYNCH_END_EVT:
1356 case NODE_FAILOVER_END_EVT:
1362 case SELF_DOWN_PEER_LEAVING:
1364 case PEER_LOST_CONTACT_EVT:
1365 state = SELF_DOWN_PEER_DOWN;
1367 case SELF_ESTABL_CONTACT_EVT:
1368 case PEER_ESTABL_CONTACT_EVT:
1369 case SELF_LOST_CONTACT_EVT:
1371 case NODE_SYNCH_END_EVT:
1372 case NODE_SYNCH_BEGIN_EVT:
1373 case NODE_FAILOVER_BEGIN_EVT:
1374 case NODE_FAILOVER_END_EVT:
1379 case SELF_UP_PEER_COMING:
1381 case PEER_ESTABL_CONTACT_EVT:
1382 state = SELF_UP_PEER_UP;
1384 case SELF_LOST_CONTACT_EVT:
1385 state = SELF_DOWN_PEER_DOWN;
1387 case SELF_ESTABL_CONTACT_EVT:
1388 case PEER_LOST_CONTACT_EVT:
1389 case NODE_SYNCH_END_EVT:
1390 case NODE_FAILOVER_BEGIN_EVT:
1392 case NODE_SYNCH_BEGIN_EVT:
1393 case NODE_FAILOVER_END_EVT:
1398 case SELF_COMING_PEER_UP:
1400 case SELF_ESTABL_CONTACT_EVT:
1401 state = SELF_UP_PEER_UP;
1403 case PEER_LOST_CONTACT_EVT:
1404 state = SELF_DOWN_PEER_DOWN;
1406 case SELF_LOST_CONTACT_EVT:
1407 case PEER_ESTABL_CONTACT_EVT:
1409 case NODE_SYNCH_END_EVT:
1410 case NODE_SYNCH_BEGIN_EVT:
1411 case NODE_FAILOVER_BEGIN_EVT:
1412 case NODE_FAILOVER_END_EVT:
1417 case SELF_LEAVING_PEER_DOWN:
1419 case SELF_LOST_CONTACT_EVT:
1420 state = SELF_DOWN_PEER_DOWN;
1422 case SELF_ESTABL_CONTACT_EVT:
1423 case PEER_ESTABL_CONTACT_EVT:
1424 case PEER_LOST_CONTACT_EVT:
1426 case NODE_SYNCH_END_EVT:
1427 case NODE_SYNCH_BEGIN_EVT:
1428 case NODE_FAILOVER_BEGIN_EVT:
1429 case NODE_FAILOVER_END_EVT:
1434 case NODE_FAILINGOVER:
1436 case SELF_LOST_CONTACT_EVT:
1437 state = SELF_DOWN_PEER_LEAVING;
1439 case PEER_LOST_CONTACT_EVT:
1440 state = SELF_LEAVING_PEER_DOWN;
1442 case NODE_FAILOVER_END_EVT:
1443 state = SELF_UP_PEER_UP;
1445 case NODE_FAILOVER_BEGIN_EVT:
1446 case SELF_ESTABL_CONTACT_EVT:
1447 case PEER_ESTABL_CONTACT_EVT:
1449 case NODE_SYNCH_BEGIN_EVT:
1450 case NODE_SYNCH_END_EVT:
1457 case SELF_LOST_CONTACT_EVT:
1458 state = SELF_DOWN_PEER_LEAVING;
1460 case PEER_LOST_CONTACT_EVT:
1461 state = SELF_LEAVING_PEER_DOWN;
1463 case NODE_SYNCH_END_EVT:
1464 state = SELF_UP_PEER_UP;
1466 case NODE_FAILOVER_BEGIN_EVT:
1467 state = NODE_FAILINGOVER;
1469 case NODE_SYNCH_BEGIN_EVT:
1470 case SELF_ESTABL_CONTACT_EVT:
1471 case PEER_ESTABL_CONTACT_EVT:
1473 case NODE_FAILOVER_END_EVT:
1479 pr_err("Unknown node fsm state %x\n", state);
1482 trace_tipc_node_fsm(n->peer_id, n->state, state, evt);
1487 pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
1488 trace_tipc_node_fsm(n->peer_id, n->state, state, evt);
1491 static void node_lost_contact(struct tipc_node *n,
1492 struct sk_buff_head *inputq)
1494 struct tipc_sock_conn *conn, *safe;
1495 struct tipc_link *l;
1496 struct list_head *conns = &n->conn_sks;
1497 struct sk_buff *skb;
1500 pr_debug("Lost contact with %x\n", n->addr);
1501 n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
1502 trace_tipc_node_lost_contact(n, true, " ");
1504 /* Clean up broadcast state */
1505 tipc_bcast_remove_peer(n->net, n->bc_entry.link);
1506 skb_queue_purge(&n->bc_entry.namedq);
1508 /* Abort any ongoing link failover */
1509 for (i = 0; i < MAX_BEARERS; i++) {
1510 l = n->links[i].link;
1512 tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT);
1515 /* Notify publications from this node */
1516 n->action_flags |= TIPC_NOTIFY_NODE_DOWN;
1518 n->peer_hash_mix = 0;
1519 /* Notify sockets connected to node */
1520 list_for_each_entry_safe(conn, safe, conns, list) {
1521 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
1522 SHORT_H_SIZE, 0, tipc_own_addr(n->net),
1523 conn->peer_node, conn->port,
1524 conn->peer_port, TIPC_ERR_NO_NODE);
1526 skb_queue_tail(inputq, skb);
1527 list_del(&conn->list);
1533 * tipc_node_get_linkname - get the name of a link
1535 * @bearer_id: id of the bearer
1536 * @addr: peer node address
1537 * @linkname: link name output buffer
1539 * Returns 0 on success
1541 int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
1542 char *linkname, size_t len)
1544 struct tipc_link *link;
1546 struct tipc_node *node = tipc_node_find(net, addr);
1551 if (bearer_id >= MAX_BEARERS)
1554 tipc_node_read_lock(node);
1555 link = node->links[bearer_id].link;
1557 strncpy(linkname, tipc_link_name(link), len);
1560 tipc_node_read_unlock(node);
1562 tipc_node_put(node);
1566 /* Caller should hold node lock for the passed node */
1567 static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
1570 struct nlattr *attrs;
1572 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
1573 NLM_F_MULTI, TIPC_NL_NODE_GET);
1577 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_NODE);
1581 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
1583 if (node_is_up(node))
1584 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
1587 nla_nest_end(msg->skb, attrs);
1588 genlmsg_end(msg->skb, hdr);
1593 nla_nest_cancel(msg->skb, attrs);
1595 genlmsg_cancel(msg->skb, hdr);
1600 static void tipc_lxc_xmit(struct net *peer_net, struct sk_buff_head *list)
1602 struct tipc_msg *hdr = buf_msg(skb_peek(list));
1603 struct sk_buff_head inputq;
1605 switch (msg_user(hdr)) {
1606 case TIPC_LOW_IMPORTANCE:
1607 case TIPC_MEDIUM_IMPORTANCE:
1608 case TIPC_HIGH_IMPORTANCE:
1609 case TIPC_CRITICAL_IMPORTANCE:
1610 if (msg_connected(hdr) || msg_named(hdr) ||
1612 tipc_loopback_trace(peer_net, list);
1613 spin_lock_init(&list->lock);
1614 tipc_sk_rcv(peer_net, list);
1617 if (msg_mcast(hdr)) {
1618 tipc_loopback_trace(peer_net, list);
1619 skb_queue_head_init(&inputq);
1620 tipc_sk_mcast_rcv(peer_net, list, &inputq);
1621 __skb_queue_purge(list);
1622 skb_queue_purge(&inputq);
1626 case MSG_FRAGMENTER:
1627 if (tipc_msg_assemble(list)) {
1628 tipc_loopback_trace(peer_net, list);
1629 skb_queue_head_init(&inputq);
1630 tipc_sk_mcast_rcv(peer_net, list, &inputq);
1631 __skb_queue_purge(list);
1632 skb_queue_purge(&inputq);
1635 case GROUP_PROTOCOL:
1637 tipc_loopback_trace(peer_net, list);
1638 spin_lock_init(&list->lock);
1639 tipc_sk_rcv(peer_net, list);
1642 case NAME_DISTRIBUTOR:
1643 case TUNNEL_PROTOCOL:
1644 case BCAST_PROTOCOL:
1652 * tipc_node_xmit() is the general link level function for message sending
1653 * @net: the applicable net namespace
1654 * @list: chain of buffers containing message
1655 * @dnode: address of destination node
1656 * @selector: a number used for deterministic link selection
1657 * Consumes the buffer chain.
1658 * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
1660 int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
1661 u32 dnode, int selector)
1663 struct tipc_link_entry *le = NULL;
1664 struct tipc_node *n;
1665 struct sk_buff_head xmitq;
1666 bool node_up = false;
1667 struct net *peer_net;
1671 if (in_own_node(net, dnode)) {
1672 tipc_loopback_trace(net, list);
1673 spin_lock_init(&list->lock);
1674 tipc_sk_rcv(net, list);
1678 n = tipc_node_find(net, dnode);
1680 __skb_queue_purge(list);
1681 return -EHOSTUNREACH;
1685 tipc_node_read_lock(n);
1686 node_up = node_is_up(n);
1687 peer_net = n->peer_net;
1688 tipc_node_read_unlock(n);
1689 if (node_up && peer_net && check_net(peer_net)) {
1690 /* xmit inner linux container */
1691 tipc_lxc_xmit(peer_net, list);
1692 if (likely(skb_queue_empty(list))) {
1700 tipc_node_read_lock(n);
1701 bearer_id = n->active_links[selector & 1];
1702 if (unlikely(bearer_id == INVALID_BEARER_ID)) {
1703 tipc_node_read_unlock(n);
1705 __skb_queue_purge(list);
1706 return -EHOSTUNREACH;
1709 __skb_queue_head_init(&xmitq);
1710 le = &n->links[bearer_id];
1711 spin_lock_bh(&le->lock);
1712 rc = tipc_link_xmit(le->link, list, &xmitq);
1713 spin_unlock_bh(&le->lock);
1714 tipc_node_read_unlock(n);
1716 if (unlikely(rc == -ENOBUFS))
1717 tipc_node_link_down(n, bearer_id, false);
1719 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr, n);
1726 /* tipc_node_xmit_skb(): send single buffer to destination
1727 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1728 * messages, which will not be rejected
1729 * The only exception is datagram messages rerouted after secondary
1730 * lookup, which are rare and safe to dispose of anyway.
1732 int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
1735 struct sk_buff_head head;
1737 __skb_queue_head_init(&head);
1738 __skb_queue_tail(&head, skb);
1739 tipc_node_xmit(net, &head, dnode, selector);
1743 /* tipc_node_distr_xmit(): send single buffer msgs to individual destinations
1744 * Note: this is only for SYSTEM_IMPORTANCE messages, which cannot be rejected
1746 int tipc_node_distr_xmit(struct net *net, struct sk_buff_head *xmitq)
1748 struct sk_buff *skb;
1749 u32 selector, dnode;
1751 while ((skb = __skb_dequeue(xmitq))) {
1752 selector = msg_origport(buf_msg(skb));
1753 dnode = msg_destnode(buf_msg(skb));
1754 tipc_node_xmit_skb(net, skb, dnode, selector);
1759 void tipc_node_broadcast(struct net *net, struct sk_buff *skb, int rc_dests)
1761 struct sk_buff_head xmitq;
1762 struct sk_buff *txskb;
1763 struct tipc_node *n;
1767 /* Use broadcast if all nodes support it */
1768 if (!rc_dests && tipc_bcast_get_mode(net) != BCLINK_MODE_RCAST) {
1769 __skb_queue_head_init(&xmitq);
1770 __skb_queue_tail(&xmitq, skb);
1771 tipc_bcast_xmit(net, &xmitq, &dummy);
1775 /* Otherwise use legacy replicast method */
1777 list_for_each_entry_rcu(n, tipc_nodes(net), list) {
1779 if (in_own_node(net, dst))
1783 txskb = pskb_copy(skb, GFP_ATOMIC);
1786 msg_set_destnode(buf_msg(txskb), dst);
1787 tipc_node_xmit_skb(net, txskb, dst, 0);
1793 static void tipc_node_mcast_rcv(struct tipc_node *n)
1795 struct tipc_bclink_entry *be = &n->bc_entry;
1797 /* 'arrvq' is under inputq2's lock protection */
1798 spin_lock_bh(&be->inputq2.lock);
1799 spin_lock_bh(&be->inputq1.lock);
1800 skb_queue_splice_tail_init(&be->inputq1, &be->arrvq);
1801 spin_unlock_bh(&be->inputq1.lock);
1802 spin_unlock_bh(&be->inputq2.lock);
1803 tipc_sk_mcast_rcv(n->net, &be->arrvq, &be->inputq2);
1806 static void tipc_node_bc_sync_rcv(struct tipc_node *n, struct tipc_msg *hdr,
1807 int bearer_id, struct sk_buff_head *xmitq)
1809 struct tipc_link *ucl;
1812 rc = tipc_bcast_sync_rcv(n->net, n->bc_entry.link, hdr, xmitq);
1814 if (rc & TIPC_LINK_DOWN_EVT) {
1815 tipc_node_reset_links(n);
1819 if (!(rc & TIPC_LINK_SND_STATE))
1822 /* If probe message, a STATE response will be sent anyway */
1826 /* Produce a STATE message carrying broadcast NACK */
1827 tipc_node_read_lock(n);
1828 ucl = n->links[bearer_id].link;
1830 tipc_link_build_state_msg(ucl, xmitq);
1831 tipc_node_read_unlock(n);
1835 * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1836 * @net: the applicable net namespace
1838 * @bearer_id: id of bearer message arrived on
1840 * Invoked with no locks held.
1842 static void tipc_node_bc_rcv(struct net *net, struct sk_buff *skb, int bearer_id)
1845 struct sk_buff_head xmitq;
1846 struct tipc_bclink_entry *be;
1847 struct tipc_link_entry *le;
1848 struct tipc_msg *hdr = buf_msg(skb);
1849 int usr = msg_user(hdr);
1850 u32 dnode = msg_destnode(hdr);
1851 struct tipc_node *n;
1853 __skb_queue_head_init(&xmitq);
1855 /* If NACK for other node, let rcv link for that node peek into it */
1856 if ((usr == BCAST_PROTOCOL) && (dnode != tipc_own_addr(net)))
1857 n = tipc_node_find(net, dnode);
1859 n = tipc_node_find(net, msg_prevnode(hdr));
1865 le = &n->links[bearer_id];
1867 rc = tipc_bcast_rcv(net, be->link, skb);
1869 /* Broadcast ACKs are sent on a unicast link */
1870 if (rc & TIPC_LINK_SND_STATE) {
1871 tipc_node_read_lock(n);
1872 tipc_link_build_state_msg(le->link, &xmitq);
1873 tipc_node_read_unlock(n);
1876 if (!skb_queue_empty(&xmitq))
1877 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr, n);
1879 if (!skb_queue_empty(&be->inputq1))
1880 tipc_node_mcast_rcv(n);
1882 /* Handle NAME_DISTRIBUTOR messages sent from 1.7 nodes */
1883 if (!skb_queue_empty(&n->bc_entry.namedq))
1884 tipc_named_rcv(net, &n->bc_entry.namedq,
1885 &n->bc_entry.named_rcv_nxt,
1886 &n->bc_entry.named_open);
1888 /* If reassembly or retransmission failure => reset all links to peer */
1889 if (rc & TIPC_LINK_DOWN_EVT)
1890 tipc_node_reset_links(n);
1896 * tipc_node_check_state - check and if necessary update node state
1898 * @bearer_id: identity of bearer delivering the packet
1899 * Returns true if state and msg are ok, otherwise false
1901 static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb,
1902 int bearer_id, struct sk_buff_head *xmitq)
1904 struct tipc_msg *hdr = buf_msg(skb);
1905 int usr = msg_user(hdr);
1906 int mtyp = msg_type(hdr);
1907 u16 oseqno = msg_seqno(hdr);
1908 u16 exp_pkts = msg_msgcnt(hdr);
1909 u16 rcv_nxt, syncpt, dlv_nxt, inputq_len;
1910 int state = n->state;
1911 struct tipc_link *l, *tnl, *pl = NULL;
1912 struct tipc_media_addr *maddr;
1915 if (trace_tipc_node_check_state_enabled()) {
1916 trace_tipc_skb_dump(skb, false, "skb for node state check");
1917 trace_tipc_node_check_state(n, true, " ");
1919 l = n->links[bearer_id].link;
1922 rcv_nxt = tipc_link_rcv_nxt(l);
1925 if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL)))
1928 /* Find parallel link, if any */
1929 for (pb_id = 0; pb_id < MAX_BEARERS; pb_id++) {
1930 if ((pb_id != bearer_id) && n->links[pb_id].link) {
1931 pl = n->links[pb_id].link;
1936 if (!tipc_link_validate_msg(l, hdr)) {
1937 trace_tipc_skb_dump(skb, false, "PROTO invalid (2)!");
1938 trace_tipc_link_dump(l, TIPC_DUMP_NONE, "PROTO invalid (2)!");
1942 /* Check and update node accesibility if applicable */
1943 if (state == SELF_UP_PEER_COMING) {
1944 if (!tipc_link_is_up(l))
1946 if (!msg_peer_link_is_up(hdr))
1948 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
1951 if (state == SELF_DOWN_PEER_LEAVING) {
1952 if (msg_peer_node_is_up(hdr))
1954 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
1958 if (state == SELF_LEAVING_PEER_DOWN)
1961 /* Ignore duplicate packets */
1962 if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt))
1965 /* Initiate or update failover mode if applicable */
1966 if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) {
1967 syncpt = oseqno + exp_pkts - 1;
1968 if (pl && !tipc_link_is_reset(pl)) {
1969 __tipc_node_link_down(n, &pb_id, xmitq, &maddr);
1970 trace_tipc_node_link_down(n, true,
1971 "node link down <- failover!");
1972 tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl),
1973 tipc_link_inputq(l));
1976 /* If parallel link was already down, and this happened before
1977 * the tunnel link came up, node failover was never started.
1978 * Ensure that a FAILOVER_MSG is sent to get peer out of
1979 * NODE_FAILINGOVER state, also this node must accept
1980 * TUNNEL_MSGs from peer.
1982 if (n->state != NODE_FAILINGOVER)
1983 tipc_node_link_failover(n, pl, l, xmitq);
1985 /* If pkts arrive out of order, use lowest calculated syncpt */
1986 if (less(syncpt, n->sync_point))
1987 n->sync_point = syncpt;
1990 /* Open parallel link when tunnel link reaches synch point */
1991 if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) {
1992 if (!more(rcv_nxt, n->sync_point))
1994 tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT);
1996 tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT);
2000 /* No synching needed if only one link */
2001 if (!pl || !tipc_link_is_up(pl))
2004 /* Initiate synch mode if applicable */
2005 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG) && (oseqno == 1)) {
2006 if (n->capabilities & TIPC_TUNNEL_ENHANCED)
2007 syncpt = msg_syncpt(hdr);
2009 syncpt = msg_seqno(msg_inner_hdr(hdr)) + exp_pkts - 1;
2010 if (!tipc_link_is_up(l))
2011 __tipc_node_link_up(n, bearer_id, xmitq);
2012 if (n->state == SELF_UP_PEER_UP) {
2013 n->sync_point = syncpt;
2014 tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT);
2015 tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT);
2019 /* Open tunnel link when parallel link reaches synch point */
2020 if (n->state == NODE_SYNCHING) {
2021 if (tipc_link_is_synching(l)) {
2027 inputq_len = skb_queue_len(tipc_link_inputq(pl));
2028 dlv_nxt = tipc_link_rcv_nxt(pl) - inputq_len;
2029 if (more(dlv_nxt, n->sync_point)) {
2030 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
2031 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
2036 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG))
2038 if (usr == LINK_PROTOCOL)
2046 * tipc_rcv - process TIPC packets/messages arriving from off-node
2047 * @net: the applicable net namespace
2049 * @b: pointer to bearer message arrived on
2051 * Invoked with no locks held. Bearer pointer must point to a valid bearer
2052 * structure (i.e. cannot be NULL), but bearer can be inactive.
2054 void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
2056 struct sk_buff_head xmitq;
2057 struct tipc_link_entry *le;
2058 struct tipc_msg *hdr;
2059 struct tipc_node *n;
2060 int bearer_id = b->identity;
2061 u32 self = tipc_own_addr(net);
2064 #ifdef CONFIG_TIPC_CRYPTO
2065 struct tipc_ehdr *ehdr;
2067 /* Check if message must be decrypted first */
2068 if (TIPC_SKB_CB(skb)->decrypted || !tipc_ehdr_validate(skb))
2071 ehdr = (struct tipc_ehdr *)skb->data;
2072 if (likely(ehdr->user != LINK_CONFIG)) {
2073 n = tipc_node_find(net, ntohl(ehdr->addr));
2077 n = tipc_node_find_by_id(net, ehdr->id);
2079 tipc_crypto_rcv(net, (n) ? n->crypto_rx : NULL, &skb, b);
2085 /* Ensure message is well-formed before touching the header */
2086 if (unlikely(!tipc_msg_validate(&skb)))
2088 __skb_queue_head_init(&xmitq);
2090 usr = msg_user(hdr);
2091 bc_ack = msg_bcast_ack(hdr);
2093 /* Handle arrival of discovery or broadcast packet */
2094 if (unlikely(msg_non_seq(hdr))) {
2095 if (unlikely(usr == LINK_CONFIG))
2096 return tipc_disc_rcv(net, skb, b);
2098 return tipc_node_bc_rcv(net, skb, bearer_id);
2101 /* Discard unicast link messages destined for another node */
2102 if (unlikely(!msg_short(hdr) && (msg_destnode(hdr) != self)))
2105 /* Locate neighboring node that sent packet */
2106 n = tipc_node_find(net, msg_prevnode(hdr));
2109 le = &n->links[bearer_id];
2111 /* Ensure broadcast reception is in synch with peer's send state */
2112 if (unlikely(usr == LINK_PROTOCOL)) {
2113 if (unlikely(skb_linearize(skb))) {
2118 tipc_node_bc_sync_rcv(n, hdr, bearer_id, &xmitq);
2119 } else if (unlikely(tipc_link_acked(n->bc_entry.link) != bc_ack)) {
2120 tipc_bcast_ack_rcv(net, n->bc_entry.link, hdr);
2123 /* Receive packet directly if conditions permit */
2124 tipc_node_read_lock(n);
2125 if (likely((n->state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) {
2126 spin_lock_bh(&le->lock);
2128 rc = tipc_link_rcv(le->link, skb, &xmitq);
2131 spin_unlock_bh(&le->lock);
2133 tipc_node_read_unlock(n);
2135 /* Check/update node state before receiving */
2136 if (unlikely(skb)) {
2137 if (unlikely(skb_linearize(skb)))
2139 tipc_node_write_lock(n);
2140 if (tipc_node_check_state(n, skb, bearer_id, &xmitq)) {
2142 rc = tipc_link_rcv(le->link, skb, &xmitq);
2146 tipc_node_write_unlock(n);
2149 if (unlikely(rc & TIPC_LINK_UP_EVT))
2150 tipc_node_link_up(n, bearer_id, &xmitq);
2152 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
2153 tipc_node_link_down(n, bearer_id, false);
2155 if (unlikely(!skb_queue_empty(&n->bc_entry.namedq)))
2156 tipc_named_rcv(net, &n->bc_entry.namedq,
2157 &n->bc_entry.named_rcv_nxt,
2158 &n->bc_entry.named_open);
2160 if (unlikely(!skb_queue_empty(&n->bc_entry.inputq1)))
2161 tipc_node_mcast_rcv(n);
2163 if (!skb_queue_empty(&le->inputq))
2164 tipc_sk_rcv(net, &le->inputq);
2166 if (!skb_queue_empty(&xmitq))
2167 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr, n);
2175 void tipc_node_apply_property(struct net *net, struct tipc_bearer *b,
2178 struct tipc_net *tn = tipc_net(net);
2179 int bearer_id = b->identity;
2180 struct sk_buff_head xmitq;
2181 struct tipc_link_entry *e;
2182 struct tipc_node *n;
2184 __skb_queue_head_init(&xmitq);
2188 list_for_each_entry_rcu(n, &tn->node_list, list) {
2189 tipc_node_write_lock(n);
2190 e = &n->links[bearer_id];
2192 if (prop == TIPC_NLA_PROP_TOL)
2193 tipc_link_set_tolerance(e->link, b->tolerance,
2195 else if (prop == TIPC_NLA_PROP_MTU)
2196 tipc_link_set_mtu(e->link, b->mtu);
2198 /* Update MTU for node link entry */
2199 e->mtu = tipc_link_mss(e->link);
2202 tipc_node_write_unlock(n);
2203 tipc_bearer_xmit(net, bearer_id, &xmitq, &e->maddr, NULL);
2209 int tipc_nl_peer_rm(struct sk_buff *skb, struct genl_info *info)
2211 struct net *net = sock_net(skb->sk);
2212 struct tipc_net *tn = net_generic(net, tipc_net_id);
2213 struct nlattr *attrs[TIPC_NLA_NET_MAX + 1];
2214 struct tipc_node *peer, *temp_node;
2218 /* We identify the peer by its net */
2219 if (!info->attrs[TIPC_NLA_NET])
2222 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_NET_MAX,
2223 info->attrs[TIPC_NLA_NET],
2224 tipc_nl_net_policy, info->extack);
2228 if (!attrs[TIPC_NLA_NET_ADDR])
2231 addr = nla_get_u32(attrs[TIPC_NLA_NET_ADDR]);
2233 if (in_own_node(net, addr))
2236 spin_lock_bh(&tn->node_list_lock);
2237 peer = tipc_node_find(net, addr);
2239 spin_unlock_bh(&tn->node_list_lock);
2243 tipc_node_write_lock(peer);
2244 if (peer->state != SELF_DOWN_PEER_DOWN &&
2245 peer->state != SELF_DOWN_PEER_LEAVING) {
2246 tipc_node_write_unlock(peer);
2251 tipc_node_clear_links(peer);
2252 tipc_node_write_unlock(peer);
2253 tipc_node_delete(peer);
2255 /* Calculate cluster capabilities */
2256 tn->capabilities = TIPC_NODE_CAPABILITIES;
2257 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
2258 tn->capabilities &= temp_node->capabilities;
2260 tipc_bcast_toggle_rcast(net, (tn->capabilities & TIPC_BCAST_RCAST));
2263 tipc_node_put(peer);
2264 spin_unlock_bh(&tn->node_list_lock);
2269 int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
2272 struct net *net = sock_net(skb->sk);
2273 struct tipc_net *tn = net_generic(net, tipc_net_id);
2274 int done = cb->args[0];
2275 int last_addr = cb->args[1];
2276 struct tipc_node *node;
2277 struct tipc_nl_msg msg;
2283 msg.portid = NETLINK_CB(cb->skb).portid;
2284 msg.seq = cb->nlh->nlmsg_seq;
2288 node = tipc_node_find(net, last_addr);
2291 /* We never set seq or call nl_dump_check_consistent()
2292 * this means that setting prev_seq here will cause the
2293 * consistence check to fail in the netlink callback
2294 * handler. Resulting in the NLMSG_DONE message having
2295 * the NLM_F_DUMP_INTR flag set if the node state
2296 * changed while we released the lock.
2301 tipc_node_put(node);
2304 list_for_each_entry_rcu(node, &tn->node_list, list) {
2305 if (node->preliminary)
2308 if (node->addr == last_addr)
2314 tipc_node_read_lock(node);
2315 err = __tipc_nl_add_node(&msg, node);
2317 last_addr = node->addr;
2318 tipc_node_read_unlock(node);
2322 tipc_node_read_unlock(node);
2327 cb->args[1] = last_addr;
2333 /* tipc_node_find_by_name - locate owner node of link by link's name
2334 * @net: the applicable net namespace
2335 * @name: pointer to link name string
2336 * @bearer_id: pointer to index in 'node->links' array where the link was found.
2338 * Returns pointer to node owning the link, or 0 if no matching link is found.
2340 static struct tipc_node *tipc_node_find_by_name(struct net *net,
2341 const char *link_name,
2342 unsigned int *bearer_id)
2344 struct tipc_net *tn = net_generic(net, tipc_net_id);
2345 struct tipc_link *l;
2346 struct tipc_node *n;
2347 struct tipc_node *found_node = NULL;
2352 list_for_each_entry_rcu(n, &tn->node_list, list) {
2353 tipc_node_read_lock(n);
2354 for (i = 0; i < MAX_BEARERS; i++) {
2355 l = n->links[i].link;
2356 if (l && !strcmp(tipc_link_name(l), link_name)) {
2362 tipc_node_read_unlock(n);
2371 int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info)
2377 struct tipc_link *link;
2378 struct tipc_node *node;
2379 struct sk_buff_head xmitq;
2380 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2381 struct net *net = sock_net(skb->sk);
2383 __skb_queue_head_init(&xmitq);
2385 if (!info->attrs[TIPC_NLA_LINK])
2388 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_LINK_MAX,
2389 info->attrs[TIPC_NLA_LINK],
2390 tipc_nl_link_policy, info->extack);
2394 if (!attrs[TIPC_NLA_LINK_NAME])
2397 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2399 if (strcmp(name, tipc_bclink_name) == 0)
2400 return tipc_nl_bc_link_set(net, attrs);
2402 node = tipc_node_find_by_name(net, name, &bearer_id);
2406 tipc_node_read_lock(node);
2408 link = node->links[bearer_id].link;
2414 if (attrs[TIPC_NLA_LINK_PROP]) {
2415 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
2417 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP], props);
2423 if (props[TIPC_NLA_PROP_TOL]) {
2426 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
2427 tipc_link_set_tolerance(link, tol, &xmitq);
2429 if (props[TIPC_NLA_PROP_PRIO]) {
2432 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
2433 tipc_link_set_prio(link, prio, &xmitq);
2435 if (props[TIPC_NLA_PROP_WIN]) {
2438 max_win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
2439 tipc_link_set_queue_limits(link,
2440 tipc_link_min_win(link),
2446 tipc_node_read_unlock(node);
2447 tipc_bearer_xmit(net, bearer_id, &xmitq, &node->links[bearer_id].maddr,
2452 int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info)
2454 struct net *net = genl_info_net(info);
2455 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2456 struct tipc_nl_msg msg;
2460 msg.portid = info->snd_portid;
2461 msg.seq = info->snd_seq;
2463 if (!info->attrs[TIPC_NLA_LINK])
2466 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_LINK_MAX,
2467 info->attrs[TIPC_NLA_LINK],
2468 tipc_nl_link_policy, info->extack);
2472 if (!attrs[TIPC_NLA_LINK_NAME])
2475 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2477 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2481 if (strcmp(name, tipc_bclink_name) == 0) {
2482 err = tipc_nl_add_bc_link(net, &msg, tipc_net(net)->bcl);
2487 struct tipc_node *node;
2488 struct tipc_link *link;
2490 node = tipc_node_find_by_name(net, name, &bearer_id);
2496 tipc_node_read_lock(node);
2497 link = node->links[bearer_id].link;
2499 tipc_node_read_unlock(node);
2504 err = __tipc_nl_add_link(net, &msg, link, 0);
2505 tipc_node_read_unlock(node);
2510 return genlmsg_reply(msg.skb, info);
2513 nlmsg_free(msg.skb);
2517 int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info)
2521 unsigned int bearer_id;
2522 struct tipc_link *link;
2523 struct tipc_node *node;
2524 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2525 struct net *net = sock_net(skb->sk);
2526 struct tipc_net *tn = tipc_net(net);
2527 struct tipc_link_entry *le;
2529 if (!info->attrs[TIPC_NLA_LINK])
2532 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_LINK_MAX,
2533 info->attrs[TIPC_NLA_LINK],
2534 tipc_nl_link_policy, info->extack);
2538 if (!attrs[TIPC_NLA_LINK_NAME])
2541 link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2544 if (!strcmp(link_name, tipc_bclink_name)) {
2545 err = tipc_bclink_reset_stats(net, tipc_bc_sndlink(net));
2549 } else if (strstr(link_name, tipc_bclink_name)) {
2551 list_for_each_entry_rcu(node, &tn->node_list, list) {
2552 tipc_node_read_lock(node);
2553 link = node->bc_entry.link;
2554 if (link && !strcmp(link_name, tipc_link_name(link))) {
2555 err = tipc_bclink_reset_stats(net, link);
2556 tipc_node_read_unlock(node);
2559 tipc_node_read_unlock(node);
2565 node = tipc_node_find_by_name(net, link_name, &bearer_id);
2569 le = &node->links[bearer_id];
2570 tipc_node_read_lock(node);
2571 spin_lock_bh(&le->lock);
2572 link = node->links[bearer_id].link;
2574 spin_unlock_bh(&le->lock);
2575 tipc_node_read_unlock(node);
2578 tipc_link_reset_stats(link);
2579 spin_unlock_bh(&le->lock);
2580 tipc_node_read_unlock(node);
2584 /* Caller should hold node lock */
2585 static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
2586 struct tipc_node *node, u32 *prev_link,
2592 for (i = *prev_link; i < MAX_BEARERS; i++) {
2595 if (!node->links[i].link)
2598 err = __tipc_nl_add_link(net, msg,
2599 node->links[i].link, NLM_F_MULTI);
2606 err = tipc_nl_add_bc_link(net, msg, node->bc_entry.link);
2616 int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb)
2618 struct net *net = sock_net(skb->sk);
2619 struct nlattr **attrs = genl_dumpit_info(cb)->attrs;
2620 struct nlattr *link[TIPC_NLA_LINK_MAX + 1];
2621 struct tipc_net *tn = net_generic(net, tipc_net_id);
2622 struct tipc_node *node;
2623 struct tipc_nl_msg msg;
2624 u32 prev_node = cb->args[0];
2625 u32 prev_link = cb->args[1];
2626 int done = cb->args[2];
2627 bool bc_link = cb->args[3];
2634 /* Check if broadcast-receiver links dumping is needed */
2635 if (attrs && attrs[TIPC_NLA_LINK]) {
2636 err = nla_parse_nested_deprecated(link,
2638 attrs[TIPC_NLA_LINK],
2639 tipc_nl_link_policy,
2643 if (unlikely(!link[TIPC_NLA_LINK_BROADCAST]))
2650 msg.portid = NETLINK_CB(cb->skb).portid;
2651 msg.seq = cb->nlh->nlmsg_seq;
2655 node = tipc_node_find(net, prev_node);
2657 /* We never set seq or call nl_dump_check_consistent()
2658 * this means that setting prev_seq here will cause the
2659 * consistence check to fail in the netlink callback
2660 * handler. Resulting in the last NLMSG_DONE message
2661 * having the NLM_F_DUMP_INTR flag set.
2666 tipc_node_put(node);
2668 list_for_each_entry_continue_rcu(node, &tn->node_list,
2670 tipc_node_read_lock(node);
2671 err = __tipc_nl_add_node_links(net, &msg, node,
2672 &prev_link, bc_link);
2673 tipc_node_read_unlock(node);
2677 prev_node = node->addr;
2680 err = tipc_nl_add_bc_link(net, &msg, tn->bcl);
2684 list_for_each_entry_rcu(node, &tn->node_list, list) {
2685 tipc_node_read_lock(node);
2686 err = __tipc_nl_add_node_links(net, &msg, node,
2687 &prev_link, bc_link);
2688 tipc_node_read_unlock(node);
2692 prev_node = node->addr;
2699 cb->args[0] = prev_node;
2700 cb->args[1] = prev_link;
2702 cb->args[3] = bc_link;
2707 int tipc_nl_node_set_monitor(struct sk_buff *skb, struct genl_info *info)
2709 struct nlattr *attrs[TIPC_NLA_MON_MAX + 1];
2710 struct net *net = sock_net(skb->sk);
2713 if (!info->attrs[TIPC_NLA_MON])
2716 err = nla_parse_nested_deprecated(attrs, TIPC_NLA_MON_MAX,
2717 info->attrs[TIPC_NLA_MON],
2718 tipc_nl_monitor_policy,
2723 if (attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]) {
2726 val = nla_get_u32(attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]);
2727 err = tipc_nl_monitor_set_threshold(net, val);
2735 static int __tipc_nl_add_monitor_prop(struct net *net, struct tipc_nl_msg *msg)
2737 struct nlattr *attrs;
2741 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
2742 0, TIPC_NL_MON_GET);
2746 attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_MON);
2750 val = tipc_nl_monitor_get_threshold(net);
2752 if (nla_put_u32(msg->skb, TIPC_NLA_MON_ACTIVATION_THRESHOLD, val))
2755 nla_nest_end(msg->skb, attrs);
2756 genlmsg_end(msg->skb, hdr);
2761 nla_nest_cancel(msg->skb, attrs);
2763 genlmsg_cancel(msg->skb, hdr);
2768 int tipc_nl_node_get_monitor(struct sk_buff *skb, struct genl_info *info)
2770 struct net *net = sock_net(skb->sk);
2771 struct tipc_nl_msg msg;
2774 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2777 msg.portid = info->snd_portid;
2778 msg.seq = info->snd_seq;
2780 err = __tipc_nl_add_monitor_prop(net, &msg);
2782 nlmsg_free(msg.skb);
2786 return genlmsg_reply(msg.skb, info);
2789 int tipc_nl_node_dump_monitor(struct sk_buff *skb, struct netlink_callback *cb)
2791 struct net *net = sock_net(skb->sk);
2792 u32 prev_bearer = cb->args[0];
2793 struct tipc_nl_msg msg;
2797 if (prev_bearer == MAX_BEARERS)
2801 msg.portid = NETLINK_CB(cb->skb).portid;
2802 msg.seq = cb->nlh->nlmsg_seq;
2805 for (bearer_id = prev_bearer; bearer_id < MAX_BEARERS; bearer_id++) {
2806 err = __tipc_nl_add_monitor(net, &msg, bearer_id);
2811 cb->args[0] = bearer_id;
2816 int tipc_nl_node_dump_monitor_peer(struct sk_buff *skb,
2817 struct netlink_callback *cb)
2819 struct net *net = sock_net(skb->sk);
2820 u32 prev_node = cb->args[1];
2821 u32 bearer_id = cb->args[2];
2822 int done = cb->args[0];
2823 struct tipc_nl_msg msg;
2827 struct nlattr **attrs = genl_dumpit_info(cb)->attrs;
2828 struct nlattr *mon[TIPC_NLA_MON_MAX + 1];
2830 if (!attrs[TIPC_NLA_MON])
2833 err = nla_parse_nested_deprecated(mon, TIPC_NLA_MON_MAX,
2834 attrs[TIPC_NLA_MON],
2835 tipc_nl_monitor_policy,
2840 if (!mon[TIPC_NLA_MON_REF])
2843 bearer_id = nla_get_u32(mon[TIPC_NLA_MON_REF]);
2845 if (bearer_id >= MAX_BEARERS)
2853 msg.portid = NETLINK_CB(cb->skb).portid;
2854 msg.seq = cb->nlh->nlmsg_seq;
2857 err = tipc_nl_add_monitor_peer(net, &msg, bearer_id, &prev_node);
2863 cb->args[1] = prev_node;
2864 cb->args[2] = bearer_id;
2869 #ifdef CONFIG_TIPC_CRYPTO
2870 static int tipc_nl_retrieve_key(struct nlattr **attrs,
2871 struct tipc_aead_key **pkey)
2873 struct nlattr *attr = attrs[TIPC_NLA_NODE_KEY];
2874 struct tipc_aead_key *key;
2879 if (nla_len(attr) < sizeof(*key))
2881 key = (struct tipc_aead_key *)nla_data(attr);
2882 if (key->keylen > TIPC_AEAD_KEYLEN_MAX ||
2883 nla_len(attr) < tipc_aead_key_size(key))
2890 static int tipc_nl_retrieve_nodeid(struct nlattr **attrs, u8 **node_id)
2892 struct nlattr *attr = attrs[TIPC_NLA_NODE_ID];
2897 if (nla_len(attr) < TIPC_NODEID_LEN)
2900 *node_id = (u8 *)nla_data(attr);
2904 static int tipc_nl_retrieve_rekeying(struct nlattr **attrs, u32 *intv)
2906 struct nlattr *attr = attrs[TIPC_NLA_NODE_REKEYING];
2911 *intv = nla_get_u32(attr);
2915 static int __tipc_nl_node_set_key(struct sk_buff *skb, struct genl_info *info)
2917 struct nlattr *attrs[TIPC_NLA_NODE_MAX + 1];
2918 struct net *net = sock_net(skb->sk);
2919 struct tipc_crypto *tx = tipc_net(net)->crypto_tx, *c = tx;
2920 struct tipc_node *n = NULL;
2921 struct tipc_aead_key *ukey;
2922 bool rekeying = true, master_key = false;
2923 u8 *id, *own_id, mode;
2927 if (!info->attrs[TIPC_NLA_NODE])
2930 rc = nla_parse_nested(attrs, TIPC_NLA_NODE_MAX,
2931 info->attrs[TIPC_NLA_NODE],
2932 tipc_nl_node_policy, info->extack);
2936 own_id = tipc_own_id(net);
2938 GENL_SET_ERR_MSG(info, "not found own node identity (set id?)");
2942 rc = tipc_nl_retrieve_rekeying(attrs, &intv);
2946 rc = tipc_nl_retrieve_key(attrs, &ukey);
2947 if (rc == -ENODATA && rekeying)
2952 rc = tipc_aead_key_validate(ukey, info);
2956 rc = tipc_nl_retrieve_nodeid(attrs, &id);
2960 master_key = !!(attrs[TIPC_NLA_NODE_KEY_MASTER]);
2963 mode = PER_NODE_KEY;
2964 if (memcmp(id, own_id, NODE_ID_LEN)) {
2965 n = tipc_node_find_by_id(net, id) ?:
2966 tipc_node_create(net, 0, id, 0xffffu, 0, true);
2976 /* Initiate the TX/RX key */
2977 rc = tipc_crypto_key_init(c, ukey, mode, master_key);
2981 if (unlikely(rc < 0)) {
2982 GENL_SET_ERR_MSG(info, "unable to initiate or attach new key");
2984 } else if (c == tx) {
2985 /* Distribute TX key but not master one */
2986 if (!master_key && tipc_crypto_key_distr(tx, rc, NULL))
2987 GENL_SET_ERR_MSG(info, "failed to replicate new key");
2989 /* Schedule TX rekeying if needed */
2990 tipc_crypto_rekeying_sched(tx, rekeying, intv);
2996 int tipc_nl_node_set_key(struct sk_buff *skb, struct genl_info *info)
3001 err = __tipc_nl_node_set_key(skb, info);
3007 static int __tipc_nl_node_flush_key(struct sk_buff *skb,
3008 struct genl_info *info)
3010 struct net *net = sock_net(skb->sk);
3011 struct tipc_net *tn = tipc_net(net);
3012 struct tipc_node *n;
3014 tipc_crypto_key_flush(tn->crypto_tx);
3016 list_for_each_entry_rcu(n, &tn->node_list, list)
3017 tipc_crypto_key_flush(n->crypto_rx);
3023 int tipc_nl_node_flush_key(struct sk_buff *skb, struct genl_info *info)
3028 err = __tipc_nl_node_flush_key(skb, info);
3036 * tipc_node_dump - dump TIPC node data
3037 * @n: tipc node to be dumped
3039 * - false: dump only tipc node data
3040 * - true: dump node link data as well
3041 * @buf: returned buffer of dump data in format
3043 int tipc_node_dump(struct tipc_node *n, bool more, char *buf)
3046 size_t sz = (more) ? NODE_LMAX : NODE_LMIN;
3049 i += scnprintf(buf, sz, "node data: (null)\n");
3053 i += scnprintf(buf, sz, "node data: %x", n->addr);
3054 i += scnprintf(buf + i, sz - i, " %x", n->state);
3055 i += scnprintf(buf + i, sz - i, " %d", n->active_links[0]);
3056 i += scnprintf(buf + i, sz - i, " %d", n->active_links[1]);
3057 i += scnprintf(buf + i, sz - i, " %x", n->action_flags);
3058 i += scnprintf(buf + i, sz - i, " %u", n->failover_sent);
3059 i += scnprintf(buf + i, sz - i, " %u", n->sync_point);
3060 i += scnprintf(buf + i, sz - i, " %d", n->link_cnt);
3061 i += scnprintf(buf + i, sz - i, " %u", n->working_links);
3062 i += scnprintf(buf + i, sz - i, " %x", n->capabilities);
3063 i += scnprintf(buf + i, sz - i, " %lu\n", n->keepalive_intv);
3068 i += scnprintf(buf + i, sz - i, "link_entry[0]:\n");
3069 i += scnprintf(buf + i, sz - i, " mtu: %u\n", n->links[0].mtu);
3070 i += scnprintf(buf + i, sz - i, " media: ");
3071 i += tipc_media_addr_printf(buf + i, sz - i, &n->links[0].maddr);
3072 i += scnprintf(buf + i, sz - i, "\n");
3073 i += tipc_link_dump(n->links[0].link, TIPC_DUMP_NONE, buf + i);
3074 i += scnprintf(buf + i, sz - i, " inputq: ");
3075 i += tipc_list_dump(&n->links[0].inputq, false, buf + i);
3077 i += scnprintf(buf + i, sz - i, "link_entry[1]:\n");
3078 i += scnprintf(buf + i, sz - i, " mtu: %u\n", n->links[1].mtu);
3079 i += scnprintf(buf + i, sz - i, " media: ");
3080 i += tipc_media_addr_printf(buf + i, sz - i, &n->links[1].maddr);
3081 i += scnprintf(buf + i, sz - i, "\n");
3082 i += tipc_link_dump(n->links[1].link, TIPC_DUMP_NONE, buf + i);
3083 i += scnprintf(buf + i, sz - i, " inputq: ");
3084 i += tipc_list_dump(&n->links[1].inputq, false, buf + i);
3086 i += scnprintf(buf + i, sz - i, "bclink:\n ");
3087 i += tipc_link_dump(n->bc_entry.link, TIPC_DUMP_NONE, buf + i);
3092 void tipc_node_pre_cleanup_net(struct net *exit_net)
3094 struct tipc_node *n;
3095 struct tipc_net *tn;
3099 for_each_net_rcu(tmp) {
3100 if (tmp == exit_net)
3105 spin_lock_bh(&tn->node_list_lock);
3106 list_for_each_entry_rcu(n, &tn->node_list, list) {
3109 if (n->peer_net != exit_net)
3111 tipc_node_write_lock(n);
3113 n->peer_hash_mix = 0;
3114 tipc_node_write_unlock_fast(n);
3117 spin_unlock_bh(&tn->node_list_lock);