2 * net/tipc/node.c: TIPC node management routines
4 * Copyright (c) 2000-2006, 2012-2016, Ericsson AB
5 * Copyright (c) 2005-2006, 2010-2014, Wind River Systems
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
20 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
40 #include "name_distr.h"
48 #define INVALID_NODE_SIG 0x10000
49 #define NODE_CLEANUP_AFTER 300000
51 /* Flags used to take different actions according to flag type
52 * TIPC_NOTIFY_NODE_DOWN: notify node is down
53 * TIPC_NOTIFY_NODE_UP: notify node is up
54 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
57 TIPC_NOTIFY_NODE_DOWN = (1 << 3),
58 TIPC_NOTIFY_NODE_UP = (1 << 4),
59 TIPC_NOTIFY_LINK_UP = (1 << 6),
60 TIPC_NOTIFY_LINK_DOWN = (1 << 7)
63 struct tipc_link_entry {
64 struct tipc_link *link;
65 spinlock_t lock; /* per link */
67 struct sk_buff_head inputq;
68 struct tipc_media_addr maddr;
71 struct tipc_bclink_entry {
72 struct tipc_link *link;
73 struct sk_buff_head inputq1;
74 struct sk_buff_head arrvq;
75 struct sk_buff_head inputq2;
76 struct sk_buff_head namedq;
80 * struct tipc_node - TIPC node structure
81 * @addr: network address of node
82 * @ref: reference counter to node object
83 * @lock: rwlock governing access to structure
84 * @net: the applicable net namespace
85 * @hash: links to adjacent nodes in unsorted hash chain
86 * @inputq: pointer to input queue containing messages for msg event
87 * @namedq: pointer to name table input queue with name table messages
88 * @active_links: bearer ids of active links, used as index into links[] array
89 * @links: array containing references to all links to node
90 * @action_flags: bit mask of different types of node actions
91 * @state: connectivity state vs peer node
92 * @sync_point: sequence number where synch/failover is finished
93 * @list: links to adjacent nodes in sorted list of cluster's nodes
94 * @working_links: number of working links to node (both active and standby)
95 * @link_cnt: number of links to node
96 * @capabilities: bitmap, indicating peer node's functional capabilities
97 * @signature: node instance identifier
98 * @link_id: local and remote bearer ids of changing link, if any
99 * @publ_list: list of publications
100 * @rcu: rcu struct for tipc_node
101 * @delete_at: indicates the time for deleting a down node
108 struct hlist_node hash;
110 struct tipc_link_entry links[MAX_BEARERS];
111 struct tipc_bclink_entry bc_entry;
113 struct list_head list;
123 struct list_head publ_list;
124 struct list_head conn_sks;
125 unsigned long keepalive_intv;
126 struct timer_list timer;
128 unsigned long delete_at;
131 /* Node FSM states and events:
134 SELF_DOWN_PEER_DOWN = 0xdd,
135 SELF_UP_PEER_UP = 0xaa,
136 SELF_DOWN_PEER_LEAVING = 0xd1,
137 SELF_UP_PEER_COMING = 0xac,
138 SELF_COMING_PEER_UP = 0xca,
139 SELF_LEAVING_PEER_DOWN = 0x1d,
140 NODE_FAILINGOVER = 0xf0,
145 SELF_ESTABL_CONTACT_EVT = 0xece,
146 SELF_LOST_CONTACT_EVT = 0x1ce,
147 PEER_ESTABL_CONTACT_EVT = 0x9ece,
148 PEER_LOST_CONTACT_EVT = 0x91ce,
149 NODE_FAILOVER_BEGIN_EVT = 0xfbe,
150 NODE_FAILOVER_END_EVT = 0xfee,
151 NODE_SYNCH_BEGIN_EVT = 0xcbe,
152 NODE_SYNCH_END_EVT = 0xcee
155 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
156 struct sk_buff_head *xmitq,
157 struct tipc_media_addr **maddr);
158 static void tipc_node_link_down(struct tipc_node *n, int bearer_id,
160 static void node_lost_contact(struct tipc_node *n, struct sk_buff_head *inputq);
161 static void tipc_node_delete(struct tipc_node *node);
162 static void tipc_node_timeout(struct timer_list *t);
163 static void tipc_node_fsm_evt(struct tipc_node *n, int evt);
164 static struct tipc_node *tipc_node_find(struct net *net, u32 addr);
165 static struct tipc_node *tipc_node_find_by_id(struct net *net, u8 *id);
166 static void tipc_node_put(struct tipc_node *node);
167 static bool node_is_up(struct tipc_node *n);
168 static void tipc_node_delete_from_list(struct tipc_node *node);
170 struct tipc_sock_conn {
174 struct list_head list;
177 static struct tipc_link *node_active_link(struct tipc_node *n, int sel)
179 int bearer_id = n->active_links[sel & 1];
181 if (unlikely(bearer_id == INVALID_BEARER_ID))
184 return n->links[bearer_id].link;
187 int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel)
191 unsigned int mtu = MAX_MSG_SIZE;
193 n = tipc_node_find(net, addr);
197 bearer_id = n->active_links[sel & 1];
198 if (likely(bearer_id != INVALID_BEARER_ID))
199 mtu = n->links[bearer_id].mtu;
204 bool tipc_node_get_id(struct net *net, u32 addr, u8 *id)
206 u8 *own_id = tipc_own_id(net);
212 if (addr == tipc_own_addr(net)) {
213 memcpy(id, own_id, TIPC_NODEID_LEN);
216 n = tipc_node_find(net, addr);
220 memcpy(id, &n->peer_id, TIPC_NODEID_LEN);
225 u16 tipc_node_get_capabilities(struct net *net, u32 addr)
230 n = tipc_node_find(net, addr);
232 return TIPC_NODE_CAPABILITIES;
233 caps = n->capabilities;
238 static void tipc_node_kref_release(struct kref *kref)
240 struct tipc_node *n = container_of(kref, struct tipc_node, kref);
242 kfree(n->bc_entry.link);
246 static void tipc_node_put(struct tipc_node *node)
248 kref_put(&node->kref, tipc_node_kref_release);
251 static void tipc_node_get(struct tipc_node *node)
253 kref_get(&node->kref);
257 * tipc_node_find - locate specified node object, if it exists
259 static struct tipc_node *tipc_node_find(struct net *net, u32 addr)
261 struct tipc_net *tn = tipc_net(net);
262 struct tipc_node *node;
263 unsigned int thash = tipc_hashfn(addr);
266 hlist_for_each_entry_rcu(node, &tn->node_htable[thash], hash) {
267 if (node->addr != addr)
269 if (!kref_get_unless_zero(&node->kref))
277 /* tipc_node_find_by_id - locate specified node object by its 128-bit id
278 * Note: this function is called only when a discovery request failed
279 * to find the node by its 32-bit id, and is not time critical
281 static struct tipc_node *tipc_node_find_by_id(struct net *net, u8 *id)
283 struct tipc_net *tn = tipc_net(net);
288 list_for_each_entry_rcu(n, &tn->node_list, list) {
289 read_lock_bh(&n->lock);
290 if (!memcmp(id, n->peer_id, 16) &&
291 kref_get_unless_zero(&n->kref))
293 read_unlock_bh(&n->lock);
298 return found ? n : NULL;
301 static void tipc_node_read_lock(struct tipc_node *n)
303 read_lock_bh(&n->lock);
306 static void tipc_node_read_unlock(struct tipc_node *n)
308 read_unlock_bh(&n->lock);
311 static void tipc_node_write_lock(struct tipc_node *n)
313 write_lock_bh(&n->lock);
316 static void tipc_node_write_unlock_fast(struct tipc_node *n)
318 write_unlock_bh(&n->lock);
321 static void tipc_node_write_unlock(struct tipc_node *n)
323 struct net *net = n->net;
325 u32 flags = n->action_flags;
328 struct list_head *publ_list;
330 if (likely(!flags)) {
331 write_unlock_bh(&n->lock);
336 link_id = n->link_id;
337 bearer_id = link_id & 0xffff;
338 publ_list = &n->publ_list;
340 n->action_flags &= ~(TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP |
341 TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP);
343 write_unlock_bh(&n->lock);
345 if (flags & TIPC_NOTIFY_NODE_DOWN)
346 tipc_publ_notify(net, publ_list, addr);
348 if (flags & TIPC_NOTIFY_NODE_UP)
349 tipc_named_node_up(net, addr);
351 if (flags & TIPC_NOTIFY_LINK_UP) {
352 tipc_mon_peer_up(net, addr, bearer_id);
353 tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr,
354 TIPC_NODE_SCOPE, link_id, link_id);
356 if (flags & TIPC_NOTIFY_LINK_DOWN) {
357 tipc_mon_peer_down(net, addr, bearer_id);
358 tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr,
363 static struct tipc_node *tipc_node_create(struct net *net, u32 addr,
364 u8 *peer_id, u16 capabilities)
366 struct tipc_net *tn = net_generic(net, tipc_net_id);
367 struct tipc_node *n, *temp_node;
372 spin_lock_bh(&tn->node_list_lock);
373 n = tipc_node_find(net, addr);
375 if (n->capabilities == capabilities)
377 /* Same node may come back with new capabilities */
378 write_lock_bh(&n->lock);
379 n->capabilities = capabilities;
380 for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) {
381 l = n->links[bearer_id].link;
383 tipc_link_update_caps(l, capabilities);
385 write_unlock_bh(&n->lock);
386 /* Calculate cluster capabilities */
387 tn->capabilities = TIPC_NODE_CAPABILITIES;
388 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
389 tn->capabilities &= temp_node->capabilities;
393 n = kzalloc(sizeof(*n), GFP_ATOMIC);
395 pr_warn("Node creation failed, no memory\n");
399 memcpy(&n->peer_id, peer_id, 16);
401 n->capabilities = capabilities;
403 rwlock_init(&n->lock);
404 INIT_HLIST_NODE(&n->hash);
405 INIT_LIST_HEAD(&n->list);
406 INIT_LIST_HEAD(&n->publ_list);
407 INIT_LIST_HEAD(&n->conn_sks);
408 skb_queue_head_init(&n->bc_entry.namedq);
409 skb_queue_head_init(&n->bc_entry.inputq1);
410 __skb_queue_head_init(&n->bc_entry.arrvq);
411 skb_queue_head_init(&n->bc_entry.inputq2);
412 for (i = 0; i < MAX_BEARERS; i++)
413 spin_lock_init(&n->links[i].lock);
414 n->state = SELF_DOWN_PEER_LEAVING;
415 n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
416 n->signature = INVALID_NODE_SIG;
417 n->active_links[0] = INVALID_BEARER_ID;
418 n->active_links[1] = INVALID_BEARER_ID;
419 if (!tipc_link_bc_create(net, tipc_own_addr(net),
421 tipc_link_window(tipc_bc_sndlink(net)),
423 &n->bc_entry.inputq1,
425 tipc_bc_sndlink(net),
426 &n->bc_entry.link)) {
427 pr_warn("Broadcast rcv link creation failed, no memory\n");
433 timer_setup(&n->timer, tipc_node_timeout, 0);
434 n->keepalive_intv = U32_MAX;
435 hlist_add_head_rcu(&n->hash, &tn->node_htable[tipc_hashfn(addr)]);
436 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
437 if (n->addr < temp_node->addr)
440 list_add_tail_rcu(&n->list, &temp_node->list);
441 /* Calculate cluster capabilities */
442 tn->capabilities = TIPC_NODE_CAPABILITIES;
443 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
444 tn->capabilities &= temp_node->capabilities;
446 trace_tipc_node_create(n, true, " ");
448 spin_unlock_bh(&tn->node_list_lock);
452 static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l)
454 unsigned long tol = tipc_link_tolerance(l);
455 unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4;
457 /* Link with lowest tolerance determines timer interval */
458 if (intv < n->keepalive_intv)
459 n->keepalive_intv = intv;
461 /* Ensure link's abort limit corresponds to current tolerance */
462 tipc_link_set_abort_limit(l, tol / n->keepalive_intv);
465 static void tipc_node_delete_from_list(struct tipc_node *node)
467 list_del_rcu(&node->list);
468 hlist_del_rcu(&node->hash);
472 static void tipc_node_delete(struct tipc_node *node)
474 trace_tipc_node_delete(node, true, " ");
475 tipc_node_delete_from_list(node);
477 del_timer_sync(&node->timer);
481 void tipc_node_stop(struct net *net)
483 struct tipc_net *tn = tipc_net(net);
484 struct tipc_node *node, *t_node;
486 spin_lock_bh(&tn->node_list_lock);
487 list_for_each_entry_safe(node, t_node, &tn->node_list, list)
488 tipc_node_delete(node);
489 spin_unlock_bh(&tn->node_list_lock);
492 void tipc_node_subscribe(struct net *net, struct list_head *subscr, u32 addr)
496 if (in_own_node(net, addr))
499 n = tipc_node_find(net, addr);
501 pr_warn("Node subscribe rejected, unknown node 0x%x\n", addr);
504 tipc_node_write_lock(n);
505 list_add_tail(subscr, &n->publ_list);
506 tipc_node_write_unlock_fast(n);
510 void tipc_node_unsubscribe(struct net *net, struct list_head *subscr, u32 addr)
514 if (in_own_node(net, addr))
517 n = tipc_node_find(net, addr);
519 pr_warn("Node unsubscribe rejected, unknown node 0x%x\n", addr);
522 tipc_node_write_lock(n);
523 list_del_init(subscr);
524 tipc_node_write_unlock_fast(n);
528 int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port)
530 struct tipc_node *node;
531 struct tipc_sock_conn *conn;
534 if (in_own_node(net, dnode))
537 node = tipc_node_find(net, dnode);
539 pr_warn("Connecting sock to node 0x%x failed\n", dnode);
540 return -EHOSTUNREACH;
542 conn = kmalloc(sizeof(*conn), GFP_ATOMIC);
547 conn->peer_node = dnode;
549 conn->peer_port = peer_port;
551 tipc_node_write_lock(node);
552 list_add_tail(&conn->list, &node->conn_sks);
553 tipc_node_write_unlock(node);
559 void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port)
561 struct tipc_node *node;
562 struct tipc_sock_conn *conn, *safe;
564 if (in_own_node(net, dnode))
567 node = tipc_node_find(net, dnode);
571 tipc_node_write_lock(node);
572 list_for_each_entry_safe(conn, safe, &node->conn_sks, list) {
573 if (port != conn->port)
575 list_del(&conn->list);
578 tipc_node_write_unlock(node);
582 static void tipc_node_clear_links(struct tipc_node *node)
586 for (i = 0; i < MAX_BEARERS; i++) {
587 struct tipc_link_entry *le = &node->links[i];
597 /* tipc_node_cleanup - delete nodes that does not
598 * have active links for NODE_CLEANUP_AFTER time
600 static bool tipc_node_cleanup(struct tipc_node *peer)
602 struct tipc_node *temp_node;
603 struct tipc_net *tn = tipc_net(peer->net);
604 bool deleted = false;
606 /* If lock held by tipc_node_stop() the node will be deleted anyway */
607 if (!spin_trylock_bh(&tn->node_list_lock))
610 tipc_node_write_lock(peer);
612 if (!node_is_up(peer) && time_after(jiffies, peer->delete_at)) {
613 tipc_node_clear_links(peer);
614 tipc_node_delete_from_list(peer);
617 tipc_node_write_unlock(peer);
619 /* Calculate cluster capabilities */
620 tn->capabilities = TIPC_NODE_CAPABILITIES;
621 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
622 tn->capabilities &= temp_node->capabilities;
625 spin_unlock_bh(&tn->node_list_lock);
629 /* tipc_node_timeout - handle expiration of node timer
631 static void tipc_node_timeout(struct timer_list *t)
633 struct tipc_node *n = from_timer(n, t, timer);
634 struct tipc_link_entry *le;
635 struct sk_buff_head xmitq;
636 int remains = n->link_cnt;
640 trace_tipc_node_timeout(n, false, " ");
641 if (!node_is_up(n) && tipc_node_cleanup(n)) {
642 /*Removing the reference of Timer*/
647 __skb_queue_head_init(&xmitq);
649 /* Initial node interval to value larger (10 seconds), then it will be
650 * recalculated with link lowest tolerance
652 tipc_node_read_lock(n);
653 n->keepalive_intv = 10000;
654 tipc_node_read_unlock(n);
655 for (bearer_id = 0; remains && (bearer_id < MAX_BEARERS); bearer_id++) {
656 tipc_node_read_lock(n);
657 le = &n->links[bearer_id];
659 spin_lock_bh(&le->lock);
660 /* Link tolerance may change asynchronously: */
661 tipc_node_calculate_timer(n, le->link);
662 rc = tipc_link_timeout(le->link, &xmitq);
663 spin_unlock_bh(&le->lock);
666 tipc_node_read_unlock(n);
667 tipc_bearer_xmit(n->net, bearer_id, &xmitq, &le->maddr);
668 if (rc & TIPC_LINK_DOWN_EVT)
669 tipc_node_link_down(n, bearer_id, false);
671 mod_timer(&n->timer, jiffies + msecs_to_jiffies(n->keepalive_intv));
675 * __tipc_node_link_up - handle addition of link
676 * Node lock must be held by caller
677 * Link becomes active (alone or shared) or standby, depending on its priority.
679 static void __tipc_node_link_up(struct tipc_node *n, int bearer_id,
680 struct sk_buff_head *xmitq)
682 int *slot0 = &n->active_links[0];
683 int *slot1 = &n->active_links[1];
684 struct tipc_link *ol = node_active_link(n, 0);
685 struct tipc_link *nl = n->links[bearer_id].link;
687 if (!nl || tipc_link_is_up(nl))
690 tipc_link_fsm_evt(nl, LINK_ESTABLISH_EVT);
691 if (!tipc_link_is_up(nl))
695 n->action_flags |= TIPC_NOTIFY_LINK_UP;
696 n->link_id = tipc_link_id(nl);
698 /* Leave room for tunnel header when returning 'mtu' to users: */
699 n->links[bearer_id].mtu = tipc_link_mtu(nl) - INT_H_SIZE;
701 tipc_bearer_add_dest(n->net, bearer_id, n->addr);
702 tipc_bcast_inc_bearer_dst_cnt(n->net, bearer_id);
704 pr_debug("Established link <%s> on network plane %c\n",
705 tipc_link_name(nl), tipc_link_plane(nl));
706 trace_tipc_node_link_up(n, true, " ");
708 /* Ensure that a STATE message goes first */
709 tipc_link_build_state_msg(nl, xmitq);
711 /* First link? => give it both slots */
715 tipc_node_fsm_evt(n, SELF_ESTABL_CONTACT_EVT);
716 n->failover_sent = false;
717 n->action_flags |= TIPC_NOTIFY_NODE_UP;
718 tipc_link_set_active(nl, true);
719 tipc_bcast_add_peer(n->net, nl, xmitq);
723 /* Second link => redistribute slots */
724 if (tipc_link_prio(nl) > tipc_link_prio(ol)) {
725 pr_debug("Old link <%s> becomes standby\n", tipc_link_name(ol));
728 tipc_link_set_active(nl, true);
729 tipc_link_set_active(ol, false);
730 } else if (tipc_link_prio(nl) == tipc_link_prio(ol)) {
731 tipc_link_set_active(nl, true);
734 pr_debug("New link <%s> is standby\n", tipc_link_name(nl));
737 /* Prepare synchronization with first link */
738 tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq);
742 * tipc_node_link_up - handle addition of link
744 * Link becomes active (alone or shared) or standby, depending on its priority.
746 static void tipc_node_link_up(struct tipc_node *n, int bearer_id,
747 struct sk_buff_head *xmitq)
749 struct tipc_media_addr *maddr;
751 tipc_node_write_lock(n);
752 __tipc_node_link_up(n, bearer_id, xmitq);
753 maddr = &n->links[bearer_id].maddr;
754 tipc_bearer_xmit(n->net, bearer_id, xmitq, maddr);
755 tipc_node_write_unlock(n);
759 * __tipc_node_link_down - handle loss of link
761 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
762 struct sk_buff_head *xmitq,
763 struct tipc_media_addr **maddr)
765 struct tipc_link_entry *le = &n->links[*bearer_id];
766 int *slot0 = &n->active_links[0];
767 int *slot1 = &n->active_links[1];
768 int i, highest = 0, prio;
769 struct tipc_link *l, *_l, *tnl;
771 l = n->links[*bearer_id].link;
772 if (!l || tipc_link_is_reset(l))
776 n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
777 n->link_id = tipc_link_id(l);
779 tipc_bearer_remove_dest(n->net, *bearer_id, n->addr);
781 pr_debug("Lost link <%s> on network plane %c\n",
782 tipc_link_name(l), tipc_link_plane(l));
784 /* Select new active link if any available */
785 *slot0 = INVALID_BEARER_ID;
786 *slot1 = INVALID_BEARER_ID;
787 for (i = 0; i < MAX_BEARERS; i++) {
788 _l = n->links[i].link;
789 if (!_l || !tipc_link_is_up(_l))
793 prio = tipc_link_prio(_l);
796 if (prio > highest) {
805 if (!node_is_up(n)) {
806 if (tipc_link_peer_is_down(l))
807 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
808 tipc_node_fsm_evt(n, SELF_LOST_CONTACT_EVT);
809 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link down!");
810 tipc_link_fsm_evt(l, LINK_RESET_EVT);
812 tipc_link_build_reset_msg(l, xmitq);
813 *maddr = &n->links[*bearer_id].maddr;
814 node_lost_contact(n, &le->inputq);
815 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
818 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
820 /* There is still a working link => initiate failover */
821 *bearer_id = n->active_links[0];
822 tnl = n->links[*bearer_id].link;
823 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
824 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
825 n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
826 tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, xmitq);
827 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link down -> failover!");
829 tipc_link_fsm_evt(l, LINK_RESET_EVT);
830 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
831 tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
832 *maddr = &n->links[*bearer_id].maddr;
835 static void tipc_node_link_down(struct tipc_node *n, int bearer_id, bool delete)
837 struct tipc_link_entry *le = &n->links[bearer_id];
838 struct tipc_media_addr *maddr = NULL;
839 struct tipc_link *l = le->link;
840 int old_bearer_id = bearer_id;
841 struct sk_buff_head xmitq;
846 __skb_queue_head_init(&xmitq);
848 tipc_node_write_lock(n);
849 if (!tipc_link_is_establishing(l)) {
850 __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr);
852 /* Defuse pending tipc_node_link_up() */
854 tipc_link_fsm_evt(l, LINK_RESET_EVT);
861 trace_tipc_node_link_down(n, true, "node link down or deleted!");
862 tipc_node_write_unlock(n);
864 tipc_mon_remove_peer(n->net, n->addr, old_bearer_id);
865 if (!skb_queue_empty(&xmitq))
866 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr);
867 tipc_sk_rcv(n->net, &le->inputq);
870 static bool node_is_up(struct tipc_node *n)
872 return n->active_links[0] != INVALID_BEARER_ID;
875 bool tipc_node_is_up(struct net *net, u32 addr)
880 if (in_own_node(net, addr))
883 n = tipc_node_find(net, addr);
886 retval = node_is_up(n);
891 static u32 tipc_node_suggest_addr(struct net *net, u32 addr)
895 addr ^= tipc_net(net)->random;
896 while ((n = tipc_node_find(net, addr))) {
903 /* tipc_node_try_addr(): Check if addr can be used by peer, suggest other if not
904 * Returns suggested address if any, otherwise 0
906 u32 tipc_node_try_addr(struct net *net, u8 *id, u32 addr)
908 struct tipc_net *tn = tipc_net(net);
911 /* Suggest new address if some other peer is using this one */
912 n = tipc_node_find(net, addr);
914 if (!memcmp(n->peer_id, id, NODE_ID_LEN))
919 return tipc_node_suggest_addr(net, addr);
922 /* Suggest previously used address if peer is known */
923 n = tipc_node_find_by_id(net, id);
930 /* Even this node may be in conflict */
931 if (tn->trial_addr == addr)
932 return tipc_node_suggest_addr(net, addr);
937 void tipc_node_check_dest(struct net *net, u32 addr,
938 u8 *peer_id, struct tipc_bearer *b,
939 u16 capabilities, u32 signature,
940 struct tipc_media_addr *maddr,
941 bool *respond, bool *dupl_addr)
945 struct tipc_link_entry *le;
946 bool addr_match = false;
947 bool sign_match = false;
948 bool link_up = false;
949 bool accept_addr = false;
958 n = tipc_node_create(net, addr, peer_id, capabilities);
962 tipc_node_write_lock(n);
964 le = &n->links[b->identity];
966 /* Prepare to validate requesting node's signature and media address */
968 link_up = l && tipc_link_is_up(l);
969 addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr));
970 sign_match = (signature == n->signature);
972 /* These three flags give us eight permutations: */
974 if (sign_match && addr_match && link_up) {
975 /* All is fine. Do nothing. */
977 } else if (sign_match && addr_match && !link_up) {
978 /* Respond. The link will come up in due time */
980 } else if (sign_match && !addr_match && link_up) {
981 /* Peer has changed i/f address without rebooting.
982 * If so, the link will reset soon, and the next
983 * discovery will be accepted. So we can ignore it.
984 * It may also be an cloned or malicious peer having
985 * chosen the same node address and signature as an
987 * Ignore requests until the link goes down, if ever.
990 } else if (sign_match && !addr_match && !link_up) {
991 /* Peer link has changed i/f address without rebooting.
992 * It may also be a cloned or malicious peer; we can't
993 * distinguish between the two.
994 * The signature is correct, so we must accept.
998 } else if (!sign_match && addr_match && link_up) {
999 /* Peer node rebooted. Two possibilities:
1000 * - Delayed re-discovery; this link endpoint has already
1001 * reset and re-established contact with the peer, before
1002 * receiving a discovery message from that node.
1003 * (The peer happened to receive one from this node first).
1004 * - The peer came back so fast that our side has not
1005 * discovered it yet. Probing from this side will soon
1006 * reset the link, since there can be no working link
1007 * endpoint at the peer end, and the link will re-establish.
1008 * Accept the signature, since it comes from a known peer.
1010 n->signature = signature;
1011 } else if (!sign_match && addr_match && !link_up) {
1012 /* The peer node has rebooted.
1013 * Accept signature, since it is a known peer.
1015 n->signature = signature;
1017 } else if (!sign_match && !addr_match && link_up) {
1018 /* Peer rebooted with new address, or a new/duplicate peer.
1019 * Ignore until the link goes down, if ever.
1022 } else if (!sign_match && !addr_match && !link_up) {
1023 /* Peer rebooted with new address, or it is a new peer.
1024 * Accept signature and address.
1026 n->signature = signature;
1034 /* Now create new link if not already existing */
1036 if (n->link_cnt == 2)
1039 if_name = strchr(b->name, ':') + 1;
1040 get_random_bytes(&session, sizeof(u16));
1041 if (!tipc_link_create(net, if_name, b->identity, b->tolerance,
1042 b->net_plane, b->mtu, b->priority,
1044 tipc_own_addr(net), addr, peer_id,
1046 tipc_bc_sndlink(n->net), n->bc_entry.link,
1048 &n->bc_entry.namedq, &l)) {
1052 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link created!");
1054 tipc_link_fsm_evt(l, LINK_RESET_EVT);
1055 if (n->state == NODE_FAILINGOVER)
1056 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
1059 tipc_node_calculate_timer(n, l);
1060 if (n->link_cnt == 1) {
1061 intv = jiffies + msecs_to_jiffies(n->keepalive_intv);
1062 if (!mod_timer(&n->timer, intv))
1066 memcpy(&le->maddr, maddr, sizeof(*maddr));
1068 tipc_node_write_unlock(n);
1069 if (reset && l && !tipc_link_is_reset(l))
1070 tipc_node_link_down(n, b->identity, false);
1074 void tipc_node_delete_links(struct net *net, int bearer_id)
1076 struct tipc_net *tn = net_generic(net, tipc_net_id);
1077 struct tipc_node *n;
1080 list_for_each_entry_rcu(n, &tn->node_list, list) {
1081 tipc_node_link_down(n, bearer_id, true);
1086 static void tipc_node_reset_links(struct tipc_node *n)
1090 pr_warn("Resetting all links to %x\n", n->addr);
1092 trace_tipc_node_reset_links(n, true, " ");
1093 for (i = 0; i < MAX_BEARERS; i++) {
1094 tipc_node_link_down(n, i, false);
1098 /* tipc_node_fsm_evt - node finite state machine
1099 * Determines when contact is allowed with peer node
1101 static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
1103 int state = n->state;
1106 case SELF_DOWN_PEER_DOWN:
1108 case SELF_ESTABL_CONTACT_EVT:
1109 state = SELF_UP_PEER_COMING;
1111 case PEER_ESTABL_CONTACT_EVT:
1112 state = SELF_COMING_PEER_UP;
1114 case SELF_LOST_CONTACT_EVT:
1115 case PEER_LOST_CONTACT_EVT:
1117 case NODE_SYNCH_END_EVT:
1118 case NODE_SYNCH_BEGIN_EVT:
1119 case NODE_FAILOVER_BEGIN_EVT:
1120 case NODE_FAILOVER_END_EVT:
1125 case SELF_UP_PEER_UP:
1127 case SELF_LOST_CONTACT_EVT:
1128 state = SELF_DOWN_PEER_LEAVING;
1130 case PEER_LOST_CONTACT_EVT:
1131 state = SELF_LEAVING_PEER_DOWN;
1133 case NODE_SYNCH_BEGIN_EVT:
1134 state = NODE_SYNCHING;
1136 case NODE_FAILOVER_BEGIN_EVT:
1137 state = NODE_FAILINGOVER;
1139 case SELF_ESTABL_CONTACT_EVT:
1140 case PEER_ESTABL_CONTACT_EVT:
1141 case NODE_SYNCH_END_EVT:
1142 case NODE_FAILOVER_END_EVT:
1148 case SELF_DOWN_PEER_LEAVING:
1150 case PEER_LOST_CONTACT_EVT:
1151 state = SELF_DOWN_PEER_DOWN;
1153 case SELF_ESTABL_CONTACT_EVT:
1154 case PEER_ESTABL_CONTACT_EVT:
1155 case SELF_LOST_CONTACT_EVT:
1157 case NODE_SYNCH_END_EVT:
1158 case NODE_SYNCH_BEGIN_EVT:
1159 case NODE_FAILOVER_BEGIN_EVT:
1160 case NODE_FAILOVER_END_EVT:
1165 case SELF_UP_PEER_COMING:
1167 case PEER_ESTABL_CONTACT_EVT:
1168 state = SELF_UP_PEER_UP;
1170 case SELF_LOST_CONTACT_EVT:
1171 state = SELF_DOWN_PEER_DOWN;
1173 case SELF_ESTABL_CONTACT_EVT:
1174 case PEER_LOST_CONTACT_EVT:
1175 case NODE_SYNCH_END_EVT:
1176 case NODE_FAILOVER_BEGIN_EVT:
1178 case NODE_SYNCH_BEGIN_EVT:
1179 case NODE_FAILOVER_END_EVT:
1184 case SELF_COMING_PEER_UP:
1186 case SELF_ESTABL_CONTACT_EVT:
1187 state = SELF_UP_PEER_UP;
1189 case PEER_LOST_CONTACT_EVT:
1190 state = SELF_DOWN_PEER_DOWN;
1192 case SELF_LOST_CONTACT_EVT:
1193 case PEER_ESTABL_CONTACT_EVT:
1195 case NODE_SYNCH_END_EVT:
1196 case NODE_SYNCH_BEGIN_EVT:
1197 case NODE_FAILOVER_BEGIN_EVT:
1198 case NODE_FAILOVER_END_EVT:
1203 case SELF_LEAVING_PEER_DOWN:
1205 case SELF_LOST_CONTACT_EVT:
1206 state = SELF_DOWN_PEER_DOWN;
1208 case SELF_ESTABL_CONTACT_EVT:
1209 case PEER_ESTABL_CONTACT_EVT:
1210 case PEER_LOST_CONTACT_EVT:
1212 case NODE_SYNCH_END_EVT:
1213 case NODE_SYNCH_BEGIN_EVT:
1214 case NODE_FAILOVER_BEGIN_EVT:
1215 case NODE_FAILOVER_END_EVT:
1220 case NODE_FAILINGOVER:
1222 case SELF_LOST_CONTACT_EVT:
1223 state = SELF_DOWN_PEER_LEAVING;
1225 case PEER_LOST_CONTACT_EVT:
1226 state = SELF_LEAVING_PEER_DOWN;
1228 case NODE_FAILOVER_END_EVT:
1229 state = SELF_UP_PEER_UP;
1231 case NODE_FAILOVER_BEGIN_EVT:
1232 case SELF_ESTABL_CONTACT_EVT:
1233 case PEER_ESTABL_CONTACT_EVT:
1235 case NODE_SYNCH_BEGIN_EVT:
1236 case NODE_SYNCH_END_EVT:
1243 case SELF_LOST_CONTACT_EVT:
1244 state = SELF_DOWN_PEER_LEAVING;
1246 case PEER_LOST_CONTACT_EVT:
1247 state = SELF_LEAVING_PEER_DOWN;
1249 case NODE_SYNCH_END_EVT:
1250 state = SELF_UP_PEER_UP;
1252 case NODE_FAILOVER_BEGIN_EVT:
1253 state = NODE_FAILINGOVER;
1255 case NODE_SYNCH_BEGIN_EVT:
1256 case SELF_ESTABL_CONTACT_EVT:
1257 case PEER_ESTABL_CONTACT_EVT:
1259 case NODE_FAILOVER_END_EVT:
1265 pr_err("Unknown node fsm state %x\n", state);
1268 trace_tipc_node_fsm(n->peer_id, n->state, state, evt);
1273 pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
1274 trace_tipc_node_fsm(n->peer_id, n->state, state, evt);
1277 static void node_lost_contact(struct tipc_node *n,
1278 struct sk_buff_head *inputq)
1280 struct tipc_sock_conn *conn, *safe;
1281 struct tipc_link *l;
1282 struct list_head *conns = &n->conn_sks;
1283 struct sk_buff *skb;
1286 pr_debug("Lost contact with %x\n", n->addr);
1287 n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
1288 trace_tipc_node_lost_contact(n, true, " ");
1290 /* Clean up broadcast state */
1291 tipc_bcast_remove_peer(n->net, n->bc_entry.link);
1293 /* Abort any ongoing link failover */
1294 for (i = 0; i < MAX_BEARERS; i++) {
1295 l = n->links[i].link;
1297 tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT);
1300 /* Notify publications from this node */
1301 n->action_flags |= TIPC_NOTIFY_NODE_DOWN;
1303 /* Notify sockets connected to node */
1304 list_for_each_entry_safe(conn, safe, conns, list) {
1305 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
1306 SHORT_H_SIZE, 0, tipc_own_addr(n->net),
1307 conn->peer_node, conn->port,
1308 conn->peer_port, TIPC_ERR_NO_NODE);
1310 skb_queue_tail(inputq, skb);
1311 list_del(&conn->list);
1317 * tipc_node_get_linkname - get the name of a link
1319 * @bearer_id: id of the bearer
1320 * @node: peer node address
1321 * @linkname: link name output buffer
1323 * Returns 0 on success
1325 int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
1326 char *linkname, size_t len)
1328 struct tipc_link *link;
1330 struct tipc_node *node = tipc_node_find(net, addr);
1335 if (bearer_id >= MAX_BEARERS)
1338 tipc_node_read_lock(node);
1339 link = node->links[bearer_id].link;
1341 strncpy(linkname, tipc_link_name(link), len);
1344 tipc_node_read_unlock(node);
1346 tipc_node_put(node);
1350 /* Caller should hold node lock for the passed node */
1351 static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
1354 struct nlattr *attrs;
1356 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
1357 NLM_F_MULTI, TIPC_NL_NODE_GET);
1361 attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE);
1365 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
1367 if (node_is_up(node))
1368 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
1371 nla_nest_end(msg->skb, attrs);
1372 genlmsg_end(msg->skb, hdr);
1377 nla_nest_cancel(msg->skb, attrs);
1379 genlmsg_cancel(msg->skb, hdr);
1385 * tipc_node_xmit() is the general link level function for message sending
1386 * @net: the applicable net namespace
1387 * @list: chain of buffers containing message
1388 * @dnode: address of destination node
1389 * @selector: a number used for deterministic link selection
1390 * Consumes the buffer chain.
1391 * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
1393 int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
1394 u32 dnode, int selector)
1396 struct tipc_link_entry *le = NULL;
1397 struct tipc_node *n;
1398 struct sk_buff_head xmitq;
1402 if (in_own_node(net, dnode)) {
1403 tipc_sk_rcv(net, list);
1407 n = tipc_node_find(net, dnode);
1409 skb_queue_purge(list);
1410 return -EHOSTUNREACH;
1413 tipc_node_read_lock(n);
1414 bearer_id = n->active_links[selector & 1];
1415 if (unlikely(bearer_id == INVALID_BEARER_ID)) {
1416 tipc_node_read_unlock(n);
1418 skb_queue_purge(list);
1419 return -EHOSTUNREACH;
1422 __skb_queue_head_init(&xmitq);
1423 le = &n->links[bearer_id];
1424 spin_lock_bh(&le->lock);
1425 rc = tipc_link_xmit(le->link, list, &xmitq);
1426 spin_unlock_bh(&le->lock);
1427 tipc_node_read_unlock(n);
1429 if (unlikely(rc == -ENOBUFS))
1430 tipc_node_link_down(n, bearer_id, false);
1432 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1439 /* tipc_node_xmit_skb(): send single buffer to destination
1440 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1441 * messages, which will not be rejected
1442 * The only exception is datagram messages rerouted after secondary
1443 * lookup, which are rare and safe to dispose of anyway.
1445 int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
1448 struct sk_buff_head head;
1450 skb_queue_head_init(&head);
1451 __skb_queue_tail(&head, skb);
1452 tipc_node_xmit(net, &head, dnode, selector);
1456 /* tipc_node_distr_xmit(): send single buffer msgs to individual destinations
1457 * Note: this is only for SYSTEM_IMPORTANCE messages, which cannot be rejected
1459 int tipc_node_distr_xmit(struct net *net, struct sk_buff_head *xmitq)
1461 struct sk_buff *skb;
1462 u32 selector, dnode;
1464 while ((skb = __skb_dequeue(xmitq))) {
1465 selector = msg_origport(buf_msg(skb));
1466 dnode = msg_destnode(buf_msg(skb));
1467 tipc_node_xmit_skb(net, skb, dnode, selector);
1472 void tipc_node_broadcast(struct net *net, struct sk_buff *skb)
1474 struct sk_buff *txskb;
1475 struct tipc_node *n;
1479 list_for_each_entry_rcu(n, tipc_nodes(net), list) {
1481 if (in_own_node(net, dst))
1485 txskb = pskb_copy(skb, GFP_ATOMIC);
1488 msg_set_destnode(buf_msg(txskb), dst);
1489 tipc_node_xmit_skb(net, txskb, dst, 0);
1496 static void tipc_node_mcast_rcv(struct tipc_node *n)
1498 struct tipc_bclink_entry *be = &n->bc_entry;
1500 /* 'arrvq' is under inputq2's lock protection */
1501 spin_lock_bh(&be->inputq2.lock);
1502 spin_lock_bh(&be->inputq1.lock);
1503 skb_queue_splice_tail_init(&be->inputq1, &be->arrvq);
1504 spin_unlock_bh(&be->inputq1.lock);
1505 spin_unlock_bh(&be->inputq2.lock);
1506 tipc_sk_mcast_rcv(n->net, &be->arrvq, &be->inputq2);
1509 static void tipc_node_bc_sync_rcv(struct tipc_node *n, struct tipc_msg *hdr,
1510 int bearer_id, struct sk_buff_head *xmitq)
1512 struct tipc_link *ucl;
1515 rc = tipc_bcast_sync_rcv(n->net, n->bc_entry.link, hdr);
1517 if (rc & TIPC_LINK_DOWN_EVT) {
1518 tipc_node_reset_links(n);
1522 if (!(rc & TIPC_LINK_SND_STATE))
1525 /* If probe message, a STATE response will be sent anyway */
1529 /* Produce a STATE message carrying broadcast NACK */
1530 tipc_node_read_lock(n);
1531 ucl = n->links[bearer_id].link;
1533 tipc_link_build_state_msg(ucl, xmitq);
1534 tipc_node_read_unlock(n);
1538 * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1539 * @net: the applicable net namespace
1541 * @bearer_id: id of bearer message arrived on
1543 * Invoked with no locks held.
1545 static void tipc_node_bc_rcv(struct net *net, struct sk_buff *skb, int bearer_id)
1548 struct sk_buff_head xmitq;
1549 struct tipc_bclink_entry *be;
1550 struct tipc_link_entry *le;
1551 struct tipc_msg *hdr = buf_msg(skb);
1552 int usr = msg_user(hdr);
1553 u32 dnode = msg_destnode(hdr);
1554 struct tipc_node *n;
1556 __skb_queue_head_init(&xmitq);
1558 /* If NACK for other node, let rcv link for that node peek into it */
1559 if ((usr == BCAST_PROTOCOL) && (dnode != tipc_own_addr(net)))
1560 n = tipc_node_find(net, dnode);
1562 n = tipc_node_find(net, msg_prevnode(hdr));
1568 le = &n->links[bearer_id];
1570 rc = tipc_bcast_rcv(net, be->link, skb);
1572 /* Broadcast ACKs are sent on a unicast link */
1573 if (rc & TIPC_LINK_SND_STATE) {
1574 tipc_node_read_lock(n);
1575 tipc_link_build_state_msg(le->link, &xmitq);
1576 tipc_node_read_unlock(n);
1579 if (!skb_queue_empty(&xmitq))
1580 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1582 if (!skb_queue_empty(&be->inputq1))
1583 tipc_node_mcast_rcv(n);
1585 /* Handle NAME_DISTRIBUTOR messages sent from 1.7 nodes */
1586 if (!skb_queue_empty(&n->bc_entry.namedq))
1587 tipc_named_rcv(net, &n->bc_entry.namedq);
1589 /* If reassembly or retransmission failure => reset all links to peer */
1590 if (rc & TIPC_LINK_DOWN_EVT)
1591 tipc_node_reset_links(n);
1597 * tipc_node_check_state - check and if necessary update node state
1599 * @bearer_id: identity of bearer delivering the packet
1600 * Returns true if state and msg are ok, otherwise false
1602 static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb,
1603 int bearer_id, struct sk_buff_head *xmitq)
1605 struct tipc_msg *hdr = buf_msg(skb);
1606 int usr = msg_user(hdr);
1607 int mtyp = msg_type(hdr);
1608 u16 oseqno = msg_seqno(hdr);
1609 u16 iseqno = msg_seqno(msg_get_wrapped(hdr));
1610 u16 exp_pkts = msg_msgcnt(hdr);
1611 u16 rcv_nxt, syncpt, dlv_nxt, inputq_len;
1612 int state = n->state;
1613 struct tipc_link *l, *tnl, *pl = NULL;
1614 struct tipc_media_addr *maddr;
1617 if (trace_tipc_node_check_state_enabled()) {
1618 trace_tipc_skb_dump(skb, false, "skb for node state check");
1619 trace_tipc_node_check_state(n, true, " ");
1621 l = n->links[bearer_id].link;
1624 rcv_nxt = tipc_link_rcv_nxt(l);
1627 if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL)))
1630 /* Find parallel link, if any */
1631 for (pb_id = 0; pb_id < MAX_BEARERS; pb_id++) {
1632 if ((pb_id != bearer_id) && n->links[pb_id].link) {
1633 pl = n->links[pb_id].link;
1638 if (!tipc_link_validate_msg(l, hdr)) {
1639 trace_tipc_skb_dump(skb, false, "PROTO invalid (2)!");
1640 trace_tipc_link_dump(l, TIPC_DUMP_NONE, "PROTO invalid (2)!");
1644 /* Check and update node accesibility if applicable */
1645 if (state == SELF_UP_PEER_COMING) {
1646 if (!tipc_link_is_up(l))
1648 if (!msg_peer_link_is_up(hdr))
1650 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
1653 if (state == SELF_DOWN_PEER_LEAVING) {
1654 if (msg_peer_node_is_up(hdr))
1656 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
1660 if (state == SELF_LEAVING_PEER_DOWN)
1663 /* Ignore duplicate packets */
1664 if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt))
1667 /* Initiate or update failover mode if applicable */
1668 if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) {
1669 syncpt = oseqno + exp_pkts - 1;
1670 if (pl && tipc_link_is_up(pl)) {
1671 __tipc_node_link_down(n, &pb_id, xmitq, &maddr);
1672 trace_tipc_node_link_down(n, true,
1673 "node link down <- failover!");
1674 tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl),
1675 tipc_link_inputq(l));
1677 /* If parallel link was already down, and this happened before
1678 * the tunnel link came up, FAILOVER was never sent. Ensure that
1679 * FAILOVER is sent to get peer out of NODE_FAILINGOVER state.
1681 if (n->state != NODE_FAILINGOVER && !n->failover_sent) {
1682 tipc_link_create_dummy_tnl_msg(l, xmitq);
1683 n->failover_sent = true;
1685 /* If pkts arrive out of order, use lowest calculated syncpt */
1686 if (less(syncpt, n->sync_point))
1687 n->sync_point = syncpt;
1690 /* Open parallel link when tunnel link reaches synch point */
1691 if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) {
1692 if (!more(rcv_nxt, n->sync_point))
1694 tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT);
1696 tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT);
1700 /* No synching needed if only one link */
1701 if (!pl || !tipc_link_is_up(pl))
1704 /* Initiate synch mode if applicable */
1705 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG) && (oseqno == 1)) {
1706 syncpt = iseqno + exp_pkts - 1;
1707 if (!tipc_link_is_up(l))
1708 __tipc_node_link_up(n, bearer_id, xmitq);
1709 if (n->state == SELF_UP_PEER_UP) {
1710 n->sync_point = syncpt;
1711 tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT);
1712 tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT);
1716 /* Open tunnel link when parallel link reaches synch point */
1717 if (n->state == NODE_SYNCHING) {
1718 if (tipc_link_is_synching(l)) {
1724 inputq_len = skb_queue_len(tipc_link_inputq(pl));
1725 dlv_nxt = tipc_link_rcv_nxt(pl) - inputq_len;
1726 if (more(dlv_nxt, n->sync_point)) {
1727 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
1728 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
1733 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG))
1735 if (usr == LINK_PROTOCOL)
1743 * tipc_rcv - process TIPC packets/messages arriving from off-node
1744 * @net: the applicable net namespace
1746 * @bearer: pointer to bearer message arrived on
1748 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1749 * structure (i.e. cannot be NULL), but bearer can be inactive.
1751 void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
1753 struct sk_buff_head xmitq;
1754 struct tipc_node *n;
1755 struct tipc_msg *hdr;
1756 int bearer_id = b->identity;
1757 struct tipc_link_entry *le;
1758 u32 self = tipc_own_addr(net);
1762 __skb_queue_head_init(&xmitq);
1764 /* Ensure message is well-formed before touching the header */
1765 if (unlikely(!tipc_msg_validate(&skb)))
1768 usr = msg_user(hdr);
1769 bc_ack = msg_bcast_ack(hdr);
1771 /* Handle arrival of discovery or broadcast packet */
1772 if (unlikely(msg_non_seq(hdr))) {
1773 if (unlikely(usr == LINK_CONFIG))
1774 return tipc_disc_rcv(net, skb, b);
1776 return tipc_node_bc_rcv(net, skb, bearer_id);
1779 /* Discard unicast link messages destined for another node */
1780 if (unlikely(!msg_short(hdr) && (msg_destnode(hdr) != self)))
1783 /* Locate neighboring node that sent packet */
1784 n = tipc_node_find(net, msg_prevnode(hdr));
1787 le = &n->links[bearer_id];
1789 /* Ensure broadcast reception is in synch with peer's send state */
1790 if (unlikely(usr == LINK_PROTOCOL))
1791 tipc_node_bc_sync_rcv(n, hdr, bearer_id, &xmitq);
1792 else if (unlikely(tipc_link_acked(n->bc_entry.link) != bc_ack))
1793 tipc_bcast_ack_rcv(net, n->bc_entry.link, hdr);
1795 /* Receive packet directly if conditions permit */
1796 tipc_node_read_lock(n);
1797 if (likely((n->state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) {
1798 spin_lock_bh(&le->lock);
1800 rc = tipc_link_rcv(le->link, skb, &xmitq);
1803 spin_unlock_bh(&le->lock);
1805 tipc_node_read_unlock(n);
1807 /* Check/update node state before receiving */
1808 if (unlikely(skb)) {
1809 if (unlikely(skb_linearize(skb)))
1811 tipc_node_write_lock(n);
1812 if (tipc_node_check_state(n, skb, bearer_id, &xmitq)) {
1814 rc = tipc_link_rcv(le->link, skb, &xmitq);
1818 tipc_node_write_unlock(n);
1821 if (unlikely(rc & TIPC_LINK_UP_EVT))
1822 tipc_node_link_up(n, bearer_id, &xmitq);
1824 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
1825 tipc_node_link_down(n, bearer_id, false);
1827 if (unlikely(!skb_queue_empty(&n->bc_entry.namedq)))
1828 tipc_named_rcv(net, &n->bc_entry.namedq);
1830 if (unlikely(!skb_queue_empty(&n->bc_entry.inputq1)))
1831 tipc_node_mcast_rcv(n);
1833 if (!skb_queue_empty(&le->inputq))
1834 tipc_sk_rcv(net, &le->inputq);
1836 if (!skb_queue_empty(&xmitq))
1837 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1844 void tipc_node_apply_property(struct net *net, struct tipc_bearer *b,
1847 struct tipc_net *tn = tipc_net(net);
1848 int bearer_id = b->identity;
1849 struct sk_buff_head xmitq;
1850 struct tipc_link_entry *e;
1851 struct tipc_node *n;
1853 __skb_queue_head_init(&xmitq);
1857 list_for_each_entry_rcu(n, &tn->node_list, list) {
1858 tipc_node_write_lock(n);
1859 e = &n->links[bearer_id];
1861 if (prop == TIPC_NLA_PROP_TOL)
1862 tipc_link_set_tolerance(e->link, b->tolerance,
1864 else if (prop == TIPC_NLA_PROP_MTU)
1865 tipc_link_set_mtu(e->link, b->mtu);
1867 tipc_node_write_unlock(n);
1868 tipc_bearer_xmit(net, bearer_id, &xmitq, &e->maddr);
1874 int tipc_nl_peer_rm(struct sk_buff *skb, struct genl_info *info)
1876 struct net *net = sock_net(skb->sk);
1877 struct tipc_net *tn = net_generic(net, tipc_net_id);
1878 struct nlattr *attrs[TIPC_NLA_NET_MAX + 1];
1879 struct tipc_node *peer;
1883 /* We identify the peer by its net */
1884 if (!info->attrs[TIPC_NLA_NET])
1887 err = nla_parse_nested(attrs, TIPC_NLA_NET_MAX,
1888 info->attrs[TIPC_NLA_NET], tipc_nl_net_policy,
1893 if (!attrs[TIPC_NLA_NET_ADDR])
1896 addr = nla_get_u32(attrs[TIPC_NLA_NET_ADDR]);
1898 if (in_own_node(net, addr))
1901 spin_lock_bh(&tn->node_list_lock);
1902 peer = tipc_node_find(net, addr);
1904 spin_unlock_bh(&tn->node_list_lock);
1908 tipc_node_write_lock(peer);
1909 if (peer->state != SELF_DOWN_PEER_DOWN &&
1910 peer->state != SELF_DOWN_PEER_LEAVING) {
1911 tipc_node_write_unlock(peer);
1916 tipc_node_clear_links(peer);
1917 tipc_node_write_unlock(peer);
1918 tipc_node_delete(peer);
1922 tipc_node_put(peer);
1923 spin_unlock_bh(&tn->node_list_lock);
1928 int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
1931 struct net *net = sock_net(skb->sk);
1932 struct tipc_net *tn = net_generic(net, tipc_net_id);
1933 int done = cb->args[0];
1934 int last_addr = cb->args[1];
1935 struct tipc_node *node;
1936 struct tipc_nl_msg msg;
1942 msg.portid = NETLINK_CB(cb->skb).portid;
1943 msg.seq = cb->nlh->nlmsg_seq;
1947 node = tipc_node_find(net, last_addr);
1950 /* We never set seq or call nl_dump_check_consistent()
1951 * this means that setting prev_seq here will cause the
1952 * consistence check to fail in the netlink callback
1953 * handler. Resulting in the NLMSG_DONE message having
1954 * the NLM_F_DUMP_INTR flag set if the node state
1955 * changed while we released the lock.
1960 tipc_node_put(node);
1963 list_for_each_entry_rcu(node, &tn->node_list, list) {
1965 if (node->addr == last_addr)
1971 tipc_node_read_lock(node);
1972 err = __tipc_nl_add_node(&msg, node);
1974 last_addr = node->addr;
1975 tipc_node_read_unlock(node);
1979 tipc_node_read_unlock(node);
1984 cb->args[1] = last_addr;
1990 /* tipc_node_find_by_name - locate owner node of link by link's name
1991 * @net: the applicable net namespace
1992 * @name: pointer to link name string
1993 * @bearer_id: pointer to index in 'node->links' array where the link was found.
1995 * Returns pointer to node owning the link, or 0 if no matching link is found.
1997 static struct tipc_node *tipc_node_find_by_name(struct net *net,
1998 const char *link_name,
1999 unsigned int *bearer_id)
2001 struct tipc_net *tn = net_generic(net, tipc_net_id);
2002 struct tipc_link *l;
2003 struct tipc_node *n;
2004 struct tipc_node *found_node = NULL;
2009 list_for_each_entry_rcu(n, &tn->node_list, list) {
2010 tipc_node_read_lock(n);
2011 for (i = 0; i < MAX_BEARERS; i++) {
2012 l = n->links[i].link;
2013 if (l && !strcmp(tipc_link_name(l), link_name)) {
2019 tipc_node_read_unlock(n);
2028 int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info)
2034 struct tipc_link *link;
2035 struct tipc_node *node;
2036 struct sk_buff_head xmitq;
2037 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2038 struct net *net = sock_net(skb->sk);
2040 __skb_queue_head_init(&xmitq);
2042 if (!info->attrs[TIPC_NLA_LINK])
2045 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
2046 info->attrs[TIPC_NLA_LINK],
2047 tipc_nl_link_policy, info->extack);
2051 if (!attrs[TIPC_NLA_LINK_NAME])
2054 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2056 if (strcmp(name, tipc_bclink_name) == 0)
2057 return tipc_nl_bc_link_set(net, attrs);
2059 node = tipc_node_find_by_name(net, name, &bearer_id);
2063 tipc_node_read_lock(node);
2065 link = node->links[bearer_id].link;
2071 if (attrs[TIPC_NLA_LINK_PROP]) {
2072 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
2074 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
2081 if (props[TIPC_NLA_PROP_TOL]) {
2084 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
2085 tipc_link_set_tolerance(link, tol, &xmitq);
2087 if (props[TIPC_NLA_PROP_PRIO]) {
2090 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
2091 tipc_link_set_prio(link, prio, &xmitq);
2093 if (props[TIPC_NLA_PROP_WIN]) {
2096 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
2097 tipc_link_set_queue_limits(link, win);
2102 tipc_node_read_unlock(node);
2103 tipc_bearer_xmit(net, bearer_id, &xmitq, &node->links[bearer_id].maddr);
2107 int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info)
2109 struct net *net = genl_info_net(info);
2110 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2111 struct tipc_nl_msg msg;
2115 msg.portid = info->snd_portid;
2116 msg.seq = info->snd_seq;
2118 if (!info->attrs[TIPC_NLA_LINK])
2121 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
2122 info->attrs[TIPC_NLA_LINK],
2123 tipc_nl_link_policy, info->extack);
2127 if (!attrs[TIPC_NLA_LINK_NAME])
2130 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2132 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2136 if (strcmp(name, tipc_bclink_name) == 0) {
2137 err = tipc_nl_add_bc_link(net, &msg);
2142 struct tipc_node *node;
2143 struct tipc_link *link;
2145 node = tipc_node_find_by_name(net, name, &bearer_id);
2151 tipc_node_read_lock(node);
2152 link = node->links[bearer_id].link;
2154 tipc_node_read_unlock(node);
2159 err = __tipc_nl_add_link(net, &msg, link, 0);
2160 tipc_node_read_unlock(node);
2165 return genlmsg_reply(msg.skb, info);
2168 nlmsg_free(msg.skb);
2172 int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info)
2176 unsigned int bearer_id;
2177 struct tipc_link *link;
2178 struct tipc_node *node;
2179 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2180 struct net *net = sock_net(skb->sk);
2181 struct tipc_link_entry *le;
2183 if (!info->attrs[TIPC_NLA_LINK])
2186 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
2187 info->attrs[TIPC_NLA_LINK],
2188 tipc_nl_link_policy, info->extack);
2192 if (!attrs[TIPC_NLA_LINK_NAME])
2195 link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2197 if (strcmp(link_name, tipc_bclink_name) == 0) {
2198 err = tipc_bclink_reset_stats(net);
2204 node = tipc_node_find_by_name(net, link_name, &bearer_id);
2208 le = &node->links[bearer_id];
2209 tipc_node_read_lock(node);
2210 spin_lock_bh(&le->lock);
2211 link = node->links[bearer_id].link;
2213 spin_unlock_bh(&le->lock);
2214 tipc_node_read_unlock(node);
2217 tipc_link_reset_stats(link);
2218 spin_unlock_bh(&le->lock);
2219 tipc_node_read_unlock(node);
2223 /* Caller should hold node lock */
2224 static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
2225 struct tipc_node *node, u32 *prev_link)
2230 for (i = *prev_link; i < MAX_BEARERS; i++) {
2233 if (!node->links[i].link)
2236 err = __tipc_nl_add_link(net, msg,
2237 node->links[i].link, NLM_F_MULTI);
2246 int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb)
2248 struct net *net = sock_net(skb->sk);
2249 struct tipc_net *tn = net_generic(net, tipc_net_id);
2250 struct tipc_node *node;
2251 struct tipc_nl_msg msg;
2252 u32 prev_node = cb->args[0];
2253 u32 prev_link = cb->args[1];
2254 int done = cb->args[2];
2261 msg.portid = NETLINK_CB(cb->skb).portid;
2262 msg.seq = cb->nlh->nlmsg_seq;
2266 node = tipc_node_find(net, prev_node);
2268 /* We never set seq or call nl_dump_check_consistent()
2269 * this means that setting prev_seq here will cause the
2270 * consistence check to fail in the netlink callback
2271 * handler. Resulting in the last NLMSG_DONE message
2272 * having the NLM_F_DUMP_INTR flag set.
2277 tipc_node_put(node);
2279 list_for_each_entry_continue_rcu(node, &tn->node_list,
2281 tipc_node_read_lock(node);
2282 err = __tipc_nl_add_node_links(net, &msg, node,
2284 tipc_node_read_unlock(node);
2288 prev_node = node->addr;
2291 err = tipc_nl_add_bc_link(net, &msg);
2295 list_for_each_entry_rcu(node, &tn->node_list, list) {
2296 tipc_node_read_lock(node);
2297 err = __tipc_nl_add_node_links(net, &msg, node,
2299 tipc_node_read_unlock(node);
2303 prev_node = node->addr;
2310 cb->args[0] = prev_node;
2311 cb->args[1] = prev_link;
2317 int tipc_nl_node_set_monitor(struct sk_buff *skb, struct genl_info *info)
2319 struct nlattr *attrs[TIPC_NLA_MON_MAX + 1];
2320 struct net *net = sock_net(skb->sk);
2323 if (!info->attrs[TIPC_NLA_MON])
2326 err = nla_parse_nested(attrs, TIPC_NLA_MON_MAX,
2327 info->attrs[TIPC_NLA_MON],
2328 tipc_nl_monitor_policy, info->extack);
2332 if (attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]) {
2335 val = nla_get_u32(attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]);
2336 err = tipc_nl_monitor_set_threshold(net, val);
2344 static int __tipc_nl_add_monitor_prop(struct net *net, struct tipc_nl_msg *msg)
2346 struct nlattr *attrs;
2350 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
2351 0, TIPC_NL_MON_GET);
2355 attrs = nla_nest_start(msg->skb, TIPC_NLA_MON);
2359 val = tipc_nl_monitor_get_threshold(net);
2361 if (nla_put_u32(msg->skb, TIPC_NLA_MON_ACTIVATION_THRESHOLD, val))
2364 nla_nest_end(msg->skb, attrs);
2365 genlmsg_end(msg->skb, hdr);
2370 nla_nest_cancel(msg->skb, attrs);
2372 genlmsg_cancel(msg->skb, hdr);
2377 int tipc_nl_node_get_monitor(struct sk_buff *skb, struct genl_info *info)
2379 struct net *net = sock_net(skb->sk);
2380 struct tipc_nl_msg msg;
2383 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2386 msg.portid = info->snd_portid;
2387 msg.seq = info->snd_seq;
2389 err = __tipc_nl_add_monitor_prop(net, &msg);
2391 nlmsg_free(msg.skb);
2395 return genlmsg_reply(msg.skb, info);
2398 int tipc_nl_node_dump_monitor(struct sk_buff *skb, struct netlink_callback *cb)
2400 struct net *net = sock_net(skb->sk);
2401 u32 prev_bearer = cb->args[0];
2402 struct tipc_nl_msg msg;
2406 if (prev_bearer == MAX_BEARERS)
2410 msg.portid = NETLINK_CB(cb->skb).portid;
2411 msg.seq = cb->nlh->nlmsg_seq;
2414 for (bearer_id = prev_bearer; bearer_id < MAX_BEARERS; bearer_id++) {
2415 err = __tipc_nl_add_monitor(net, &msg, bearer_id);
2420 cb->args[0] = bearer_id;
2425 int tipc_nl_node_dump_monitor_peer(struct sk_buff *skb,
2426 struct netlink_callback *cb)
2428 struct net *net = sock_net(skb->sk);
2429 u32 prev_node = cb->args[1];
2430 u32 bearer_id = cb->args[2];
2431 int done = cb->args[0];
2432 struct tipc_nl_msg msg;
2436 struct nlattr **attrs;
2437 struct nlattr *mon[TIPC_NLA_MON_MAX + 1];
2439 err = tipc_nlmsg_parse(cb->nlh, &attrs);
2443 if (!attrs[TIPC_NLA_MON])
2446 err = nla_parse_nested(mon, TIPC_NLA_MON_MAX,
2447 attrs[TIPC_NLA_MON],
2448 tipc_nl_monitor_policy, NULL);
2452 if (!mon[TIPC_NLA_MON_REF])
2455 bearer_id = nla_get_u32(mon[TIPC_NLA_MON_REF]);
2457 if (bearer_id >= MAX_BEARERS)
2465 msg.portid = NETLINK_CB(cb->skb).portid;
2466 msg.seq = cb->nlh->nlmsg_seq;
2469 err = tipc_nl_add_monitor_peer(net, &msg, bearer_id, &prev_node);
2475 cb->args[1] = prev_node;
2476 cb->args[2] = bearer_id;
2481 u32 tipc_node_get_addr(struct tipc_node *node)
2483 return (node) ? node->addr : 0;
2487 * tipc_node_dump - dump TIPC node data
2488 * @n: tipc node to be dumped
2490 * - false: dump only tipc node data
2491 * - true: dump node link data as well
2492 * @buf: returned buffer of dump data in format
2494 int tipc_node_dump(struct tipc_node *n, bool more, char *buf)
2497 size_t sz = (more) ? NODE_LMAX : NODE_LMIN;
2500 i += scnprintf(buf, sz, "node data: (null)\n");
2504 i += scnprintf(buf, sz, "node data: %x", n->addr);
2505 i += scnprintf(buf + i, sz - i, " %x", n->state);
2506 i += scnprintf(buf + i, sz - i, " %d", n->active_links[0]);
2507 i += scnprintf(buf + i, sz - i, " %d", n->active_links[1]);
2508 i += scnprintf(buf + i, sz - i, " %x", n->action_flags);
2509 i += scnprintf(buf + i, sz - i, " %u", n->failover_sent);
2510 i += scnprintf(buf + i, sz - i, " %u", n->sync_point);
2511 i += scnprintf(buf + i, sz - i, " %d", n->link_cnt);
2512 i += scnprintf(buf + i, sz - i, " %u", n->working_links);
2513 i += scnprintf(buf + i, sz - i, " %x", n->capabilities);
2514 i += scnprintf(buf + i, sz - i, " %lu\n", n->keepalive_intv);
2519 i += scnprintf(buf + i, sz - i, "link_entry[0]:\n");
2520 i += scnprintf(buf + i, sz - i, " mtu: %u\n", n->links[0].mtu);
2521 i += scnprintf(buf + i, sz - i, " media: ");
2522 i += tipc_media_addr_printf(buf + i, sz - i, &n->links[0].maddr);
2523 i += scnprintf(buf + i, sz - i, "\n");
2524 i += tipc_link_dump(n->links[0].link, TIPC_DUMP_NONE, buf + i);
2525 i += scnprintf(buf + i, sz - i, " inputq: ");
2526 i += tipc_list_dump(&n->links[0].inputq, false, buf + i);
2528 i += scnprintf(buf + i, sz - i, "link_entry[1]:\n");
2529 i += scnprintf(buf + i, sz - i, " mtu: %u\n", n->links[1].mtu);
2530 i += scnprintf(buf + i, sz - i, " media: ");
2531 i += tipc_media_addr_printf(buf + i, sz - i, &n->links[1].maddr);
2532 i += scnprintf(buf + i, sz - i, "\n");
2533 i += tipc_link_dump(n->links[1].link, TIPC_DUMP_NONE, buf + i);
2534 i += scnprintf(buf + i, sz - i, " inputq: ");
2535 i += tipc_list_dump(&n->links[1].inputq, false, buf + i);
2537 i += scnprintf(buf + i, sz - i, "bclink:\n ");
2538 i += tipc_link_dump(n->bc_entry.link, TIPC_DUMP_NONE, buf + i);