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"
46 #define INVALID_NODE_SIG 0x10000
48 /* Flags used to take different actions according to flag type
49 * TIPC_NOTIFY_NODE_DOWN: notify node is down
50 * TIPC_NOTIFY_NODE_UP: notify node is up
51 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
54 TIPC_NOTIFY_NODE_DOWN = (1 << 3),
55 TIPC_NOTIFY_NODE_UP = (1 << 4),
56 TIPC_NOTIFY_LINK_UP = (1 << 6),
57 TIPC_NOTIFY_LINK_DOWN = (1 << 7)
60 struct tipc_link_entry {
61 struct tipc_link *link;
62 spinlock_t lock; /* per link */
64 struct sk_buff_head inputq;
65 struct tipc_media_addr maddr;
68 struct tipc_bclink_entry {
69 struct tipc_link *link;
70 struct sk_buff_head inputq1;
71 struct sk_buff_head arrvq;
72 struct sk_buff_head inputq2;
73 struct sk_buff_head namedq;
77 * struct tipc_node - TIPC node structure
78 * @addr: network address of node
79 * @ref: reference counter to node object
80 * @lock: rwlock governing access to structure
81 * @net: the applicable net namespace
82 * @hash: links to adjacent nodes in unsorted hash chain
83 * @inputq: pointer to input queue containing messages for msg event
84 * @namedq: pointer to name table input queue with name table messages
85 * @active_links: bearer ids of active links, used as index into links[] array
86 * @links: array containing references to all links to node
87 * @action_flags: bit mask of different types of node actions
88 * @state: connectivity state vs peer node
89 * @sync_point: sequence number where synch/failover is finished
90 * @list: links to adjacent nodes in sorted list of cluster's nodes
91 * @working_links: number of working links to node (both active and standby)
92 * @link_cnt: number of links to node
93 * @capabilities: bitmap, indicating peer node's functional capabilities
94 * @signature: node instance identifier
95 * @link_id: local and remote bearer ids of changing link, if any
96 * @publ_list: list of publications
97 * @rcu: rcu struct for tipc_node
104 struct hlist_node hash;
106 struct tipc_link_entry links[MAX_BEARERS];
107 struct tipc_bclink_entry bc_entry;
109 struct list_head list;
117 struct list_head publ_list;
118 struct list_head conn_sks;
119 unsigned long keepalive_intv;
120 struct timer_list timer;
124 /* Node FSM states and events:
127 SELF_DOWN_PEER_DOWN = 0xdd,
128 SELF_UP_PEER_UP = 0xaa,
129 SELF_DOWN_PEER_LEAVING = 0xd1,
130 SELF_UP_PEER_COMING = 0xac,
131 SELF_COMING_PEER_UP = 0xca,
132 SELF_LEAVING_PEER_DOWN = 0x1d,
133 NODE_FAILINGOVER = 0xf0,
138 SELF_ESTABL_CONTACT_EVT = 0xece,
139 SELF_LOST_CONTACT_EVT = 0x1ce,
140 PEER_ESTABL_CONTACT_EVT = 0x9ece,
141 PEER_LOST_CONTACT_EVT = 0x91ce,
142 NODE_FAILOVER_BEGIN_EVT = 0xfbe,
143 NODE_FAILOVER_END_EVT = 0xfee,
144 NODE_SYNCH_BEGIN_EVT = 0xcbe,
145 NODE_SYNCH_END_EVT = 0xcee
148 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
149 struct sk_buff_head *xmitq,
150 struct tipc_media_addr **maddr);
151 static void tipc_node_link_down(struct tipc_node *n, int bearer_id,
153 static void node_lost_contact(struct tipc_node *n, struct sk_buff_head *inputq);
154 static void tipc_node_delete(struct tipc_node *node);
155 static void tipc_node_timeout(unsigned long data);
156 static void tipc_node_fsm_evt(struct tipc_node *n, int evt);
157 static struct tipc_node *tipc_node_find(struct net *net, u32 addr);
158 static void tipc_node_put(struct tipc_node *node);
159 static bool tipc_node_is_up(struct tipc_node *n);
161 struct tipc_sock_conn {
165 struct list_head list;
168 static struct tipc_link *node_active_link(struct tipc_node *n, int sel)
170 int bearer_id = n->active_links[sel & 1];
172 if (unlikely(bearer_id == INVALID_BEARER_ID))
175 return n->links[bearer_id].link;
178 int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel)
182 unsigned int mtu = MAX_MSG_SIZE;
184 n = tipc_node_find(net, addr);
188 bearer_id = n->active_links[sel & 1];
189 if (likely(bearer_id != INVALID_BEARER_ID))
190 mtu = n->links[bearer_id].mtu;
195 u16 tipc_node_get_capabilities(struct net *net, u32 addr)
200 n = tipc_node_find(net, addr);
202 return TIPC_NODE_CAPABILITIES;
203 caps = n->capabilities;
209 * A trivial power-of-two bitmask technique is used for speed, since this
210 * operation is done for every incoming TIPC packet. The number of hash table
211 * entries has been chosen so that no hash chain exceeds 8 nodes and will
212 * usually be much smaller (typically only a single node).
214 static unsigned int tipc_hashfn(u32 addr)
216 return addr & (NODE_HTABLE_SIZE - 1);
219 static void tipc_node_kref_release(struct kref *kref)
221 struct tipc_node *n = container_of(kref, struct tipc_node, kref);
223 kfree(n->bc_entry.link);
227 static void tipc_node_put(struct tipc_node *node)
229 kref_put(&node->kref, tipc_node_kref_release);
232 static void tipc_node_get(struct tipc_node *node)
234 kref_get(&node->kref);
238 * tipc_node_find - locate specified node object, if it exists
240 static struct tipc_node *tipc_node_find(struct net *net, u32 addr)
242 struct tipc_net *tn = tipc_net(net);
243 struct tipc_node *node;
244 unsigned int thash = tipc_hashfn(addr);
246 if (unlikely(!in_own_cluster_exact(net, addr)))
250 hlist_for_each_entry_rcu(node, &tn->node_htable[thash], hash) {
251 if (node->addr != addr)
253 if (!kref_get_unless_zero(&node->kref))
261 static void tipc_node_read_lock(struct tipc_node *n)
263 read_lock_bh(&n->lock);
266 static void tipc_node_read_unlock(struct tipc_node *n)
268 read_unlock_bh(&n->lock);
271 static void tipc_node_write_lock(struct tipc_node *n)
273 write_lock_bh(&n->lock);
276 static void tipc_node_write_unlock(struct tipc_node *n)
278 struct net *net = n->net;
280 u32 flags = n->action_flags;
282 struct list_head *publ_list;
284 if (likely(!flags)) {
285 write_unlock_bh(&n->lock);
290 link_id = n->link_id;
291 publ_list = &n->publ_list;
293 n->action_flags &= ~(TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP |
294 TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP);
296 write_unlock_bh(&n->lock);
298 if (flags & TIPC_NOTIFY_NODE_DOWN)
299 tipc_publ_notify(net, publ_list, addr);
301 if (flags & TIPC_NOTIFY_NODE_UP)
302 tipc_named_node_up(net, addr);
304 if (flags & TIPC_NOTIFY_LINK_UP)
305 tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr,
306 TIPC_NODE_SCOPE, link_id, addr);
308 if (flags & TIPC_NOTIFY_LINK_DOWN)
309 tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr,
313 struct tipc_node *tipc_node_create(struct net *net, u32 addr, u16 capabilities)
315 struct tipc_net *tn = net_generic(net, tipc_net_id);
316 struct tipc_node *n, *temp_node;
319 spin_lock_bh(&tn->node_list_lock);
320 n = tipc_node_find(net, addr);
322 /* Same node may come back with new capabilities */
323 n->capabilities = capabilities;
326 n = kzalloc(sizeof(*n), GFP_ATOMIC);
328 pr_warn("Node creation failed, no memory\n");
333 n->capabilities = capabilities;
335 rwlock_init(&n->lock);
336 INIT_HLIST_NODE(&n->hash);
337 INIT_LIST_HEAD(&n->list);
338 INIT_LIST_HEAD(&n->publ_list);
339 INIT_LIST_HEAD(&n->conn_sks);
340 skb_queue_head_init(&n->bc_entry.namedq);
341 skb_queue_head_init(&n->bc_entry.inputq1);
342 __skb_queue_head_init(&n->bc_entry.arrvq);
343 skb_queue_head_init(&n->bc_entry.inputq2);
344 for (i = 0; i < MAX_BEARERS; i++)
345 spin_lock_init(&n->links[i].lock);
346 n->state = SELF_DOWN_PEER_LEAVING;
347 n->signature = INVALID_NODE_SIG;
348 n->active_links[0] = INVALID_BEARER_ID;
349 n->active_links[1] = INVALID_BEARER_ID;
350 if (!tipc_link_bc_create(net, tipc_own_addr(net), n->addr,
352 tipc_link_window(tipc_bc_sndlink(net)),
354 &n->bc_entry.inputq1,
356 tipc_bc_sndlink(net),
357 &n->bc_entry.link)) {
358 pr_warn("Broadcast rcv link creation failed, no memory\n");
364 setup_timer(&n->timer, tipc_node_timeout, (unsigned long)n);
365 n->keepalive_intv = U32_MAX;
366 hlist_add_head_rcu(&n->hash, &tn->node_htable[tipc_hashfn(addr)]);
367 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
368 if (n->addr < temp_node->addr)
371 list_add_tail_rcu(&n->list, &temp_node->list);
373 spin_unlock_bh(&tn->node_list_lock);
377 static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l)
379 unsigned long tol = tipc_link_tolerance(l);
380 unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4;
382 /* Link with lowest tolerance determines timer interval */
383 if (intv < n->keepalive_intv)
384 n->keepalive_intv = intv;
386 /* Ensure link's abort limit corresponds to current tolerance */
387 tipc_link_set_abort_limit(l, tol / n->keepalive_intv);
390 static void tipc_node_delete(struct tipc_node *node)
392 list_del_rcu(&node->list);
393 hlist_del_rcu(&node->hash);
396 del_timer_sync(&node->timer);
400 void tipc_node_stop(struct net *net)
402 struct tipc_net *tn = tipc_net(net);
403 struct tipc_node *node, *t_node;
405 spin_lock_bh(&tn->node_list_lock);
406 list_for_each_entry_safe(node, t_node, &tn->node_list, list)
407 tipc_node_delete(node);
408 spin_unlock_bh(&tn->node_list_lock);
411 void tipc_node_subscribe(struct net *net, struct list_head *subscr, u32 addr)
415 if (in_own_node(net, addr))
418 n = tipc_node_find(net, addr);
420 pr_warn("Node subscribe rejected, unknown node 0x%x\n", addr);
423 tipc_node_write_lock(n);
424 list_add_tail(subscr, &n->publ_list);
425 tipc_node_write_unlock(n);
429 void tipc_node_unsubscribe(struct net *net, struct list_head *subscr, u32 addr)
433 if (in_own_node(net, addr))
436 n = tipc_node_find(net, addr);
438 pr_warn("Node unsubscribe rejected, unknown node 0x%x\n", addr);
441 tipc_node_write_lock(n);
442 list_del_init(subscr);
443 tipc_node_write_unlock(n);
447 int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port)
449 struct tipc_node *node;
450 struct tipc_sock_conn *conn;
453 if (in_own_node(net, dnode))
456 node = tipc_node_find(net, dnode);
458 pr_warn("Connecting sock to node 0x%x failed\n", dnode);
459 return -EHOSTUNREACH;
461 conn = kmalloc(sizeof(*conn), GFP_ATOMIC);
466 conn->peer_node = dnode;
468 conn->peer_port = peer_port;
470 tipc_node_write_lock(node);
471 list_add_tail(&conn->list, &node->conn_sks);
472 tipc_node_write_unlock(node);
478 void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port)
480 struct tipc_node *node;
481 struct tipc_sock_conn *conn, *safe;
483 if (in_own_node(net, dnode))
486 node = tipc_node_find(net, dnode);
490 tipc_node_write_lock(node);
491 list_for_each_entry_safe(conn, safe, &node->conn_sks, list) {
492 if (port != conn->port)
494 list_del(&conn->list);
497 tipc_node_write_unlock(node);
501 /* tipc_node_timeout - handle expiration of node timer
503 static void tipc_node_timeout(unsigned long data)
505 struct tipc_node *n = (struct tipc_node *)data;
506 struct tipc_link_entry *le;
507 struct sk_buff_head xmitq;
511 __skb_queue_head_init(&xmitq);
513 for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) {
514 tipc_node_read_lock(n);
515 le = &n->links[bearer_id];
516 spin_lock_bh(&le->lock);
518 /* Link tolerance may change asynchronously: */
519 tipc_node_calculate_timer(n, le->link);
520 rc = tipc_link_timeout(le->link, &xmitq);
522 spin_unlock_bh(&le->lock);
523 tipc_node_read_unlock(n);
524 tipc_bearer_xmit(n->net, bearer_id, &xmitq, &le->maddr);
525 if (rc & TIPC_LINK_DOWN_EVT)
526 tipc_node_link_down(n, bearer_id, false);
528 mod_timer(&n->timer, jiffies + msecs_to_jiffies(n->keepalive_intv));
532 * __tipc_node_link_up - handle addition of link
533 * Node lock must be held by caller
534 * Link becomes active (alone or shared) or standby, depending on its priority.
536 static void __tipc_node_link_up(struct tipc_node *n, int bearer_id,
537 struct sk_buff_head *xmitq)
539 int *slot0 = &n->active_links[0];
540 int *slot1 = &n->active_links[1];
541 struct tipc_link *ol = node_active_link(n, 0);
542 struct tipc_link *nl = n->links[bearer_id].link;
544 if (!nl || tipc_link_is_up(nl))
547 tipc_link_fsm_evt(nl, LINK_ESTABLISH_EVT);
548 if (!tipc_link_is_up(nl))
552 n->action_flags |= TIPC_NOTIFY_LINK_UP;
553 n->link_id = tipc_link_id(nl);
555 /* Leave room for tunnel header when returning 'mtu' to users: */
556 n->links[bearer_id].mtu = tipc_link_mtu(nl) - INT_H_SIZE;
558 tipc_bearer_add_dest(n->net, bearer_id, n->addr);
559 tipc_bcast_inc_bearer_dst_cnt(n->net, bearer_id);
561 pr_debug("Established link <%s> on network plane %c\n",
562 tipc_link_name(nl), tipc_link_plane(nl));
564 /* Ensure that a STATE message goes first */
565 tipc_link_build_state_msg(nl, xmitq);
567 /* First link? => give it both slots */
571 tipc_node_fsm_evt(n, SELF_ESTABL_CONTACT_EVT);
572 n->action_flags |= TIPC_NOTIFY_NODE_UP;
573 tipc_link_set_active(nl, true);
574 tipc_bcast_add_peer(n->net, nl, xmitq);
578 /* Second link => redistribute slots */
579 if (tipc_link_prio(nl) > tipc_link_prio(ol)) {
580 pr_debug("Old link <%s> becomes standby\n", tipc_link_name(ol));
583 tipc_link_set_active(nl, true);
584 tipc_link_set_active(ol, false);
585 } else if (tipc_link_prio(nl) == tipc_link_prio(ol)) {
586 tipc_link_set_active(nl, true);
589 pr_debug("New link <%s> is standby\n", tipc_link_name(nl));
592 /* Prepare synchronization with first link */
593 tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq);
597 * tipc_node_link_up - handle addition of link
599 * Link becomes active (alone or shared) or standby, depending on its priority.
601 static void tipc_node_link_up(struct tipc_node *n, int bearer_id,
602 struct sk_buff_head *xmitq)
604 struct tipc_media_addr *maddr;
606 tipc_node_write_lock(n);
607 __tipc_node_link_up(n, bearer_id, xmitq);
608 maddr = &n->links[bearer_id].maddr;
609 tipc_bearer_xmit(n->net, bearer_id, xmitq, maddr);
610 tipc_node_write_unlock(n);
614 * __tipc_node_link_down - handle loss of link
616 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
617 struct sk_buff_head *xmitq,
618 struct tipc_media_addr **maddr)
620 struct tipc_link_entry *le = &n->links[*bearer_id];
621 int *slot0 = &n->active_links[0];
622 int *slot1 = &n->active_links[1];
623 int i, highest = 0, prio;
624 struct tipc_link *l, *_l, *tnl;
626 l = n->links[*bearer_id].link;
627 if (!l || tipc_link_is_reset(l))
631 n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
632 n->link_id = tipc_link_id(l);
634 tipc_bearer_remove_dest(n->net, *bearer_id, n->addr);
636 pr_debug("Lost link <%s> on network plane %c\n",
637 tipc_link_name(l), tipc_link_plane(l));
639 /* Select new active link if any available */
640 *slot0 = INVALID_BEARER_ID;
641 *slot1 = INVALID_BEARER_ID;
642 for (i = 0; i < MAX_BEARERS; i++) {
643 _l = n->links[i].link;
644 if (!_l || !tipc_link_is_up(_l))
648 prio = tipc_link_prio(_l);
651 if (prio > highest) {
660 if (!tipc_node_is_up(n)) {
661 if (tipc_link_peer_is_down(l))
662 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
663 tipc_node_fsm_evt(n, SELF_LOST_CONTACT_EVT);
664 tipc_link_fsm_evt(l, LINK_RESET_EVT);
666 tipc_link_build_reset_msg(l, xmitq);
667 *maddr = &n->links[*bearer_id].maddr;
668 node_lost_contact(n, &le->inputq);
669 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
672 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
674 /* There is still a working link => initiate failover */
675 *bearer_id = n->active_links[0];
676 tnl = n->links[*bearer_id].link;
677 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
678 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
679 n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
680 tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, xmitq);
682 tipc_link_fsm_evt(l, LINK_RESET_EVT);
683 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
684 tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
685 *maddr = &n->links[*bearer_id].maddr;
688 static void tipc_node_link_down(struct tipc_node *n, int bearer_id, bool delete)
690 struct tipc_link_entry *le = &n->links[bearer_id];
691 struct tipc_link *l = le->link;
692 struct tipc_media_addr *maddr;
693 struct sk_buff_head xmitq;
698 __skb_queue_head_init(&xmitq);
700 tipc_node_write_lock(n);
701 if (!tipc_link_is_establishing(l)) {
702 __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr);
709 /* Defuse pending tipc_node_link_up() */
710 tipc_link_fsm_evt(l, LINK_RESET_EVT);
712 tipc_node_write_unlock(n);
713 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr);
714 tipc_sk_rcv(n->net, &le->inputq);
717 static bool tipc_node_is_up(struct tipc_node *n)
719 return n->active_links[0] != INVALID_BEARER_ID;
722 void tipc_node_check_dest(struct net *net, u32 onode,
723 struct tipc_bearer *b,
724 u16 capabilities, u32 signature,
725 struct tipc_media_addr *maddr,
726 bool *respond, bool *dupl_addr)
730 struct tipc_link_entry *le;
731 bool addr_match = false;
732 bool sign_match = false;
733 bool link_up = false;
734 bool accept_addr = false;
742 n = tipc_node_create(net, onode, capabilities);
746 tipc_node_write_lock(n);
748 le = &n->links[b->identity];
750 /* Prepare to validate requesting node's signature and media address */
752 link_up = l && tipc_link_is_up(l);
753 addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr));
754 sign_match = (signature == n->signature);
756 /* These three flags give us eight permutations: */
758 if (sign_match && addr_match && link_up) {
759 /* All is fine. Do nothing. */
761 } else if (sign_match && addr_match && !link_up) {
762 /* Respond. The link will come up in due time */
764 } else if (sign_match && !addr_match && link_up) {
765 /* Peer has changed i/f address without rebooting.
766 * If so, the link will reset soon, and the next
767 * discovery will be accepted. So we can ignore it.
768 * It may also be an cloned or malicious peer having
769 * chosen the same node address and signature as an
771 * Ignore requests until the link goes down, if ever.
774 } else if (sign_match && !addr_match && !link_up) {
775 /* Peer link has changed i/f address without rebooting.
776 * It may also be a cloned or malicious peer; we can't
777 * distinguish between the two.
778 * The signature is correct, so we must accept.
782 } else if (!sign_match && addr_match && link_up) {
783 /* Peer node rebooted. Two possibilities:
784 * - Delayed re-discovery; this link endpoint has already
785 * reset and re-established contact with the peer, before
786 * receiving a discovery message from that node.
787 * (The peer happened to receive one from this node first).
788 * - The peer came back so fast that our side has not
789 * discovered it yet. Probing from this side will soon
790 * reset the link, since there can be no working link
791 * endpoint at the peer end, and the link will re-establish.
792 * Accept the signature, since it comes from a known peer.
794 n->signature = signature;
795 } else if (!sign_match && addr_match && !link_up) {
796 /* The peer node has rebooted.
797 * Accept signature, since it is a known peer.
799 n->signature = signature;
801 } else if (!sign_match && !addr_match && link_up) {
802 /* Peer rebooted with new address, or a new/duplicate peer.
803 * Ignore until the link goes down, if ever.
806 } else if (!sign_match && !addr_match && !link_up) {
807 /* Peer rebooted with new address, or it is a new peer.
808 * Accept signature and address.
810 n->signature = signature;
818 /* Now create new link if not already existing */
820 if (n->link_cnt == 2) {
821 pr_warn("Cannot establish 3rd link to %x\n", n->addr);
824 if_name = strchr(b->name, ':') + 1;
825 if (!tipc_link_create(net, if_name, b->identity, b->tolerance,
826 b->net_plane, b->mtu, b->priority,
827 b->window, mod(tipc_net(net)->random),
828 tipc_own_addr(net), onode,
830 tipc_bc_sndlink(n->net), n->bc_entry.link,
832 &n->bc_entry.namedq, &l)) {
837 tipc_link_fsm_evt(l, LINK_RESET_EVT);
838 if (n->state == NODE_FAILINGOVER)
839 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
842 tipc_node_calculate_timer(n, l);
843 if (n->link_cnt == 1) {
844 intv = jiffies + msecs_to_jiffies(n->keepalive_intv);
845 if (!mod_timer(&n->timer, intv))
849 memcpy(&le->maddr, maddr, sizeof(*maddr));
851 tipc_node_write_unlock(n);
852 if (reset && l && !tipc_link_is_reset(l))
853 tipc_node_link_down(n, b->identity, false);
857 void tipc_node_delete_links(struct net *net, int bearer_id)
859 struct tipc_net *tn = net_generic(net, tipc_net_id);
863 list_for_each_entry_rcu(n, &tn->node_list, list) {
864 tipc_node_link_down(n, bearer_id, true);
869 static void tipc_node_reset_links(struct tipc_node *n)
871 char addr_string[16];
874 pr_warn("Resetting all links to %s\n",
875 tipc_addr_string_fill(addr_string, n->addr));
877 for (i = 0; i < MAX_BEARERS; i++) {
878 tipc_node_link_down(n, i, false);
882 /* tipc_node_fsm_evt - node finite state machine
883 * Determines when contact is allowed with peer node
885 static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
887 int state = n->state;
890 case SELF_DOWN_PEER_DOWN:
892 case SELF_ESTABL_CONTACT_EVT:
893 state = SELF_UP_PEER_COMING;
895 case PEER_ESTABL_CONTACT_EVT:
896 state = SELF_COMING_PEER_UP;
898 case SELF_LOST_CONTACT_EVT:
899 case PEER_LOST_CONTACT_EVT:
901 case NODE_SYNCH_END_EVT:
902 case NODE_SYNCH_BEGIN_EVT:
903 case NODE_FAILOVER_BEGIN_EVT:
904 case NODE_FAILOVER_END_EVT:
909 case SELF_UP_PEER_UP:
911 case SELF_LOST_CONTACT_EVT:
912 state = SELF_DOWN_PEER_LEAVING;
914 case PEER_LOST_CONTACT_EVT:
915 state = SELF_LEAVING_PEER_DOWN;
917 case NODE_SYNCH_BEGIN_EVT:
918 state = NODE_SYNCHING;
920 case NODE_FAILOVER_BEGIN_EVT:
921 state = NODE_FAILINGOVER;
923 case SELF_ESTABL_CONTACT_EVT:
924 case PEER_ESTABL_CONTACT_EVT:
925 case NODE_SYNCH_END_EVT:
926 case NODE_FAILOVER_END_EVT:
932 case SELF_DOWN_PEER_LEAVING:
934 case PEER_LOST_CONTACT_EVT:
935 state = SELF_DOWN_PEER_DOWN;
937 case SELF_ESTABL_CONTACT_EVT:
938 case PEER_ESTABL_CONTACT_EVT:
939 case SELF_LOST_CONTACT_EVT:
941 case NODE_SYNCH_END_EVT:
942 case NODE_SYNCH_BEGIN_EVT:
943 case NODE_FAILOVER_BEGIN_EVT:
944 case NODE_FAILOVER_END_EVT:
949 case SELF_UP_PEER_COMING:
951 case PEER_ESTABL_CONTACT_EVT:
952 state = SELF_UP_PEER_UP;
954 case SELF_LOST_CONTACT_EVT:
955 state = SELF_DOWN_PEER_DOWN;
957 case SELF_ESTABL_CONTACT_EVT:
958 case PEER_LOST_CONTACT_EVT:
959 case NODE_SYNCH_END_EVT:
960 case NODE_FAILOVER_BEGIN_EVT:
962 case NODE_SYNCH_BEGIN_EVT:
963 case NODE_FAILOVER_END_EVT:
968 case SELF_COMING_PEER_UP:
970 case SELF_ESTABL_CONTACT_EVT:
971 state = SELF_UP_PEER_UP;
973 case PEER_LOST_CONTACT_EVT:
974 state = SELF_DOWN_PEER_DOWN;
976 case SELF_LOST_CONTACT_EVT:
977 case PEER_ESTABL_CONTACT_EVT:
979 case NODE_SYNCH_END_EVT:
980 case NODE_SYNCH_BEGIN_EVT:
981 case NODE_FAILOVER_BEGIN_EVT:
982 case NODE_FAILOVER_END_EVT:
987 case SELF_LEAVING_PEER_DOWN:
989 case SELF_LOST_CONTACT_EVT:
990 state = SELF_DOWN_PEER_DOWN;
992 case SELF_ESTABL_CONTACT_EVT:
993 case PEER_ESTABL_CONTACT_EVT:
994 case PEER_LOST_CONTACT_EVT:
996 case NODE_SYNCH_END_EVT:
997 case NODE_SYNCH_BEGIN_EVT:
998 case NODE_FAILOVER_BEGIN_EVT:
999 case NODE_FAILOVER_END_EVT:
1004 case NODE_FAILINGOVER:
1006 case SELF_LOST_CONTACT_EVT:
1007 state = SELF_DOWN_PEER_LEAVING;
1009 case PEER_LOST_CONTACT_EVT:
1010 state = SELF_LEAVING_PEER_DOWN;
1012 case NODE_FAILOVER_END_EVT:
1013 state = SELF_UP_PEER_UP;
1015 case NODE_FAILOVER_BEGIN_EVT:
1016 case SELF_ESTABL_CONTACT_EVT:
1017 case PEER_ESTABL_CONTACT_EVT:
1019 case NODE_SYNCH_BEGIN_EVT:
1020 case NODE_SYNCH_END_EVT:
1027 case SELF_LOST_CONTACT_EVT:
1028 state = SELF_DOWN_PEER_LEAVING;
1030 case PEER_LOST_CONTACT_EVT:
1031 state = SELF_LEAVING_PEER_DOWN;
1033 case NODE_SYNCH_END_EVT:
1034 state = SELF_UP_PEER_UP;
1036 case NODE_FAILOVER_BEGIN_EVT:
1037 state = NODE_FAILINGOVER;
1039 case NODE_SYNCH_BEGIN_EVT:
1040 case SELF_ESTABL_CONTACT_EVT:
1041 case PEER_ESTABL_CONTACT_EVT:
1043 case NODE_FAILOVER_END_EVT:
1049 pr_err("Unknown node fsm state %x\n", state);
1056 pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
1059 static void node_lost_contact(struct tipc_node *n,
1060 struct sk_buff_head *inputq)
1062 char addr_string[16];
1063 struct tipc_sock_conn *conn, *safe;
1064 struct tipc_link *l;
1065 struct list_head *conns = &n->conn_sks;
1066 struct sk_buff *skb;
1069 pr_debug("Lost contact with %s\n",
1070 tipc_addr_string_fill(addr_string, n->addr));
1072 /* Clean up broadcast state */
1073 tipc_bcast_remove_peer(n->net, n->bc_entry.link);
1075 /* Abort any ongoing link failover */
1076 for (i = 0; i < MAX_BEARERS; i++) {
1077 l = n->links[i].link;
1079 tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT);
1082 /* Notify publications from this node */
1083 n->action_flags |= TIPC_NOTIFY_NODE_DOWN;
1085 /* Notify sockets connected to node */
1086 list_for_each_entry_safe(conn, safe, conns, list) {
1087 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
1088 SHORT_H_SIZE, 0, tipc_own_addr(n->net),
1089 conn->peer_node, conn->port,
1090 conn->peer_port, TIPC_ERR_NO_NODE);
1092 skb_queue_tail(inputq, skb);
1093 list_del(&conn->list);
1099 * tipc_node_get_linkname - get the name of a link
1101 * @bearer_id: id of the bearer
1102 * @node: peer node address
1103 * @linkname: link name output buffer
1105 * Returns 0 on success
1107 int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
1108 char *linkname, size_t len)
1110 struct tipc_link *link;
1112 struct tipc_node *node = tipc_node_find(net, addr);
1117 if (bearer_id >= MAX_BEARERS)
1120 tipc_node_read_lock(node);
1121 link = node->links[bearer_id].link;
1123 strncpy(linkname, tipc_link_name(link), len);
1127 tipc_node_read_unlock(node);
1128 tipc_node_put(node);
1132 /* Caller should hold node lock for the passed node */
1133 static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
1136 struct nlattr *attrs;
1138 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
1139 NLM_F_MULTI, TIPC_NL_NODE_GET);
1143 attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE);
1147 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
1149 if (tipc_node_is_up(node))
1150 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
1153 nla_nest_end(msg->skb, attrs);
1154 genlmsg_end(msg->skb, hdr);
1159 nla_nest_cancel(msg->skb, attrs);
1161 genlmsg_cancel(msg->skb, hdr);
1167 * tipc_node_xmit() is the general link level function for message sending
1168 * @net: the applicable net namespace
1169 * @list: chain of buffers containing message
1170 * @dnode: address of destination node
1171 * @selector: a number used for deterministic link selection
1172 * Consumes the buffer chain, except when returning -ELINKCONG
1173 * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
1175 int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
1176 u32 dnode, int selector)
1178 struct tipc_link_entry *le = NULL;
1179 struct tipc_node *n;
1180 struct sk_buff_head xmitq;
1184 if (in_own_node(net, dnode)) {
1185 tipc_sk_rcv(net, list);
1189 n = tipc_node_find(net, dnode);
1191 skb_queue_purge(list);
1192 return -EHOSTUNREACH;
1195 tipc_node_read_lock(n);
1196 bearer_id = n->active_links[selector & 1];
1197 if (unlikely(bearer_id == INVALID_BEARER_ID)) {
1198 tipc_node_read_unlock(n);
1200 skb_queue_purge(list);
1201 return -EHOSTUNREACH;
1204 __skb_queue_head_init(&xmitq);
1205 le = &n->links[bearer_id];
1206 spin_lock_bh(&le->lock);
1207 rc = tipc_link_xmit(le->link, list, &xmitq);
1208 spin_unlock_bh(&le->lock);
1209 tipc_node_read_unlock(n);
1211 if (likely(rc == 0))
1212 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1213 else if (rc == -ENOBUFS)
1214 tipc_node_link_down(n, bearer_id, false);
1221 /* tipc_node_xmit_skb(): send single buffer to destination
1222 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1223 * messages, which will not be rejected
1224 * The only exception is datagram messages rerouted after secondary
1225 * lookup, which are rare and safe to dispose of anyway.
1226 * TODO: Return real return value, and let callers use
1227 * tipc_wait_for_sendpkt() where applicable
1229 int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
1232 struct sk_buff_head head;
1235 skb_queue_head_init(&head);
1236 __skb_queue_tail(&head, skb);
1237 rc = tipc_node_xmit(net, &head, dnode, selector);
1238 if (rc == -ELINKCONG)
1243 void tipc_node_broadcast(struct net *net, struct sk_buff *skb)
1245 struct sk_buff *txskb;
1246 struct tipc_node *n;
1250 list_for_each_entry_rcu(n, tipc_nodes(net), list) {
1252 if (in_own_node(net, dst))
1254 if (!tipc_node_is_up(n))
1256 txskb = pskb_copy(skb, GFP_ATOMIC);
1259 msg_set_destnode(buf_msg(txskb), dst);
1260 tipc_node_xmit_skb(net, txskb, dst, 0);
1268 * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1269 * @net: the applicable net namespace
1271 * @bearer_id: id of bearer message arrived on
1273 * Invoked with no locks held.
1275 static void tipc_node_bc_rcv(struct net *net, struct sk_buff *skb, int bearer_id)
1278 struct sk_buff_head xmitq;
1279 struct tipc_bclink_entry *be;
1280 struct tipc_link_entry *le;
1281 struct tipc_msg *hdr = buf_msg(skb);
1282 int usr = msg_user(hdr);
1283 u32 dnode = msg_destnode(hdr);
1284 struct tipc_node *n;
1286 __skb_queue_head_init(&xmitq);
1288 /* If NACK for other node, let rcv link for that node peek into it */
1289 if ((usr == BCAST_PROTOCOL) && (dnode != tipc_own_addr(net)))
1290 n = tipc_node_find(net, dnode);
1292 n = tipc_node_find(net, msg_prevnode(hdr));
1298 le = &n->links[bearer_id];
1300 rc = tipc_bcast_rcv(net, be->link, skb);
1302 /* Broadcast link reset may happen at reassembly failure */
1303 if (rc & TIPC_LINK_DOWN_EVT)
1304 tipc_node_reset_links(n);
1306 /* Broadcast ACKs are sent on a unicast link */
1307 if (rc & TIPC_LINK_SND_BC_ACK) {
1308 tipc_node_read_lock(n);
1309 tipc_link_build_state_msg(le->link, &xmitq);
1310 tipc_node_read_unlock(n);
1313 if (!skb_queue_empty(&xmitq))
1314 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1316 /* Deliver. 'arrvq' is under inputq2's lock protection */
1317 if (!skb_queue_empty(&be->inputq1)) {
1318 spin_lock_bh(&be->inputq2.lock);
1319 spin_lock_bh(&be->inputq1.lock);
1320 skb_queue_splice_tail_init(&be->inputq1, &be->arrvq);
1321 spin_unlock_bh(&be->inputq1.lock);
1322 spin_unlock_bh(&be->inputq2.lock);
1323 tipc_sk_mcast_rcv(net, &be->arrvq, &be->inputq2);
1329 * tipc_node_check_state - check and if necessary update node state
1331 * @bearer_id: identity of bearer delivering the packet
1332 * Returns true if state is ok, otherwise consumes buffer and returns false
1334 static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb,
1335 int bearer_id, struct sk_buff_head *xmitq)
1337 struct tipc_msg *hdr = buf_msg(skb);
1338 int usr = msg_user(hdr);
1339 int mtyp = msg_type(hdr);
1340 u16 oseqno = msg_seqno(hdr);
1341 u16 iseqno = msg_seqno(msg_get_wrapped(hdr));
1342 u16 exp_pkts = msg_msgcnt(hdr);
1343 u16 rcv_nxt, syncpt, dlv_nxt, inputq_len;
1344 int state = n->state;
1345 struct tipc_link *l, *tnl, *pl = NULL;
1346 struct tipc_media_addr *maddr;
1349 l = n->links[bearer_id].link;
1352 rcv_nxt = tipc_link_rcv_nxt(l);
1355 if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL)))
1358 /* Find parallel link, if any */
1359 for (pb_id = 0; pb_id < MAX_BEARERS; pb_id++) {
1360 if ((pb_id != bearer_id) && n->links[pb_id].link) {
1361 pl = n->links[pb_id].link;
1366 /* Check and update node accesibility if applicable */
1367 if (state == SELF_UP_PEER_COMING) {
1368 if (!tipc_link_is_up(l))
1370 if (!msg_peer_link_is_up(hdr))
1372 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
1375 if (state == SELF_DOWN_PEER_LEAVING) {
1376 if (msg_peer_node_is_up(hdr))
1378 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
1382 if (state == SELF_LEAVING_PEER_DOWN)
1385 /* Ignore duplicate packets */
1386 if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt))
1389 /* Initiate or update failover mode if applicable */
1390 if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) {
1391 syncpt = oseqno + exp_pkts - 1;
1392 if (pl && tipc_link_is_up(pl)) {
1393 __tipc_node_link_down(n, &pb_id, xmitq, &maddr);
1394 tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl),
1395 tipc_link_inputq(l));
1397 /* If pkts arrive out of order, use lowest calculated syncpt */
1398 if (less(syncpt, n->sync_point))
1399 n->sync_point = syncpt;
1402 /* Open parallel link when tunnel link reaches synch point */
1403 if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) {
1404 if (!more(rcv_nxt, n->sync_point))
1406 tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT);
1408 tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT);
1412 /* No synching needed if only one link */
1413 if (!pl || !tipc_link_is_up(pl))
1416 /* Initiate synch mode if applicable */
1417 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG) && (oseqno == 1)) {
1418 syncpt = iseqno + exp_pkts - 1;
1419 if (!tipc_link_is_up(l)) {
1420 tipc_link_fsm_evt(l, LINK_ESTABLISH_EVT);
1421 __tipc_node_link_up(n, bearer_id, xmitq);
1423 if (n->state == SELF_UP_PEER_UP) {
1424 n->sync_point = syncpt;
1425 tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT);
1426 tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT);
1430 /* Open tunnel link when parallel link reaches synch point */
1431 if (n->state == NODE_SYNCHING) {
1432 if (tipc_link_is_synching(l)) {
1438 inputq_len = skb_queue_len(tipc_link_inputq(pl));
1439 dlv_nxt = tipc_link_rcv_nxt(pl) - inputq_len;
1440 if (more(dlv_nxt, n->sync_point)) {
1441 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
1442 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
1447 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG))
1449 if (usr == LINK_PROTOCOL)
1457 * tipc_rcv - process TIPC packets/messages arriving from off-node
1458 * @net: the applicable net namespace
1460 * @bearer: pointer to bearer message arrived on
1462 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1463 * structure (i.e. cannot be NULL), but bearer can be inactive.
1465 void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
1467 struct sk_buff_head xmitq;
1468 struct tipc_node *n;
1469 struct tipc_msg *hdr = buf_msg(skb);
1470 int usr = msg_user(hdr);
1471 int bearer_id = b->identity;
1472 struct tipc_link_entry *le;
1473 u16 bc_ack = msg_bcast_ack(hdr);
1474 u32 self = tipc_own_addr(net);
1477 __skb_queue_head_init(&xmitq);
1479 /* Ensure message is well-formed */
1480 if (unlikely(!tipc_msg_validate(skb)))
1483 /* Handle arrival of discovery or broadcast packet */
1484 if (unlikely(msg_non_seq(hdr))) {
1485 if (unlikely(usr == LINK_CONFIG))
1486 return tipc_disc_rcv(net, skb, b);
1488 return tipc_node_bc_rcv(net, skb, bearer_id);
1491 /* Discard unicast link messages destined for another node */
1492 if (unlikely(!msg_short(hdr) && (msg_destnode(hdr) != self)))
1495 /* Locate neighboring node that sent packet */
1496 n = tipc_node_find(net, msg_prevnode(hdr));
1499 le = &n->links[bearer_id];
1501 /* Ensure broadcast reception is in synch with peer's send state */
1502 if (unlikely(usr == LINK_PROTOCOL))
1503 tipc_bcast_sync_rcv(net, n->bc_entry.link, hdr);
1504 else if (unlikely(tipc_link_acked(n->bc_entry.link) != bc_ack))
1505 tipc_bcast_ack_rcv(net, n->bc_entry.link, bc_ack);
1507 /* Receive packet directly if conditions permit */
1508 tipc_node_read_lock(n);
1509 if (likely((n->state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) {
1510 spin_lock_bh(&le->lock);
1512 rc = tipc_link_rcv(le->link, skb, &xmitq);
1515 spin_unlock_bh(&le->lock);
1517 tipc_node_read_unlock(n);
1519 /* Check/update node state before receiving */
1520 if (unlikely(skb)) {
1521 tipc_node_write_lock(n);
1522 if (tipc_node_check_state(n, skb, bearer_id, &xmitq)) {
1524 rc = tipc_link_rcv(le->link, skb, &xmitq);
1528 tipc_node_write_unlock(n);
1531 if (unlikely(rc & TIPC_LINK_UP_EVT))
1532 tipc_node_link_up(n, bearer_id, &xmitq);
1534 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
1535 tipc_node_link_down(n, bearer_id, false);
1537 if (unlikely(!skb_queue_empty(&n->bc_entry.namedq)))
1538 tipc_named_rcv(net, &n->bc_entry.namedq);
1540 if (!skb_queue_empty(&le->inputq))
1541 tipc_sk_rcv(net, &le->inputq);
1543 if (!skb_queue_empty(&xmitq))
1544 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1551 int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
1554 struct net *net = sock_net(skb->sk);
1555 struct tipc_net *tn = net_generic(net, tipc_net_id);
1556 int done = cb->args[0];
1557 int last_addr = cb->args[1];
1558 struct tipc_node *node;
1559 struct tipc_nl_msg msg;
1565 msg.portid = NETLINK_CB(cb->skb).portid;
1566 msg.seq = cb->nlh->nlmsg_seq;
1570 node = tipc_node_find(net, last_addr);
1573 /* We never set seq or call nl_dump_check_consistent()
1574 * this means that setting prev_seq here will cause the
1575 * consistence check to fail in the netlink callback
1576 * handler. Resulting in the NLMSG_DONE message having
1577 * the NLM_F_DUMP_INTR flag set if the node state
1578 * changed while we released the lock.
1583 tipc_node_put(node);
1586 list_for_each_entry_rcu(node, &tn->node_list, list) {
1588 if (node->addr == last_addr)
1594 tipc_node_read_lock(node);
1595 err = __tipc_nl_add_node(&msg, node);
1597 last_addr = node->addr;
1598 tipc_node_read_unlock(node);
1602 tipc_node_read_unlock(node);
1607 cb->args[1] = last_addr;
1613 /* tipc_node_find_by_name - locate owner node of link by link's name
1614 * @net: the applicable net namespace
1615 * @name: pointer to link name string
1616 * @bearer_id: pointer to index in 'node->links' array where the link was found.
1618 * Returns pointer to node owning the link, or 0 if no matching link is found.
1620 static struct tipc_node *tipc_node_find_by_name(struct net *net,
1621 const char *link_name,
1622 unsigned int *bearer_id)
1624 struct tipc_net *tn = net_generic(net, tipc_net_id);
1625 struct tipc_link *l;
1626 struct tipc_node *n;
1627 struct tipc_node *found_node = NULL;
1632 list_for_each_entry_rcu(n, &tn->node_list, list) {
1633 tipc_node_read_lock(n);
1634 for (i = 0; i < MAX_BEARERS; i++) {
1635 l = n->links[i].link;
1636 if (l && !strcmp(tipc_link_name(l), link_name)) {
1642 tipc_node_read_unlock(n);
1651 int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info)
1657 struct tipc_link *link;
1658 struct tipc_node *node;
1659 struct sk_buff_head xmitq;
1660 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1661 struct net *net = sock_net(skb->sk);
1663 __skb_queue_head_init(&xmitq);
1665 if (!info->attrs[TIPC_NLA_LINK])
1668 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1669 info->attrs[TIPC_NLA_LINK],
1670 tipc_nl_link_policy);
1674 if (!attrs[TIPC_NLA_LINK_NAME])
1677 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
1679 if (strcmp(name, tipc_bclink_name) == 0)
1680 return tipc_nl_bc_link_set(net, attrs);
1682 node = tipc_node_find_by_name(net, name, &bearer_id);
1686 tipc_node_read_lock(node);
1688 link = node->links[bearer_id].link;
1694 if (attrs[TIPC_NLA_LINK_PROP]) {
1695 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
1697 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
1704 if (props[TIPC_NLA_PROP_TOL]) {
1707 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
1708 tipc_link_set_tolerance(link, tol, &xmitq);
1710 if (props[TIPC_NLA_PROP_PRIO]) {
1713 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
1714 tipc_link_set_prio(link, prio, &xmitq);
1716 if (props[TIPC_NLA_PROP_WIN]) {
1719 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
1720 tipc_link_set_queue_limits(link, win);
1725 tipc_node_read_unlock(node);
1726 tipc_bearer_xmit(net, bearer_id, &xmitq, &node->links[bearer_id].maddr);
1730 int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info)
1732 struct net *net = genl_info_net(info);
1733 struct tipc_nl_msg msg;
1737 msg.portid = info->snd_portid;
1738 msg.seq = info->snd_seq;
1740 if (!info->attrs[TIPC_NLA_LINK_NAME])
1742 name = nla_data(info->attrs[TIPC_NLA_LINK_NAME]);
1744 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
1748 if (strcmp(name, tipc_bclink_name) == 0) {
1749 err = tipc_nl_add_bc_link(net, &msg);
1751 nlmsg_free(msg.skb);
1756 struct tipc_node *node;
1757 struct tipc_link *link;
1759 node = tipc_node_find_by_name(net, name, &bearer_id);
1763 tipc_node_read_lock(node);
1764 link = node->links[bearer_id].link;
1766 tipc_node_read_unlock(node);
1767 nlmsg_free(msg.skb);
1771 err = __tipc_nl_add_link(net, &msg, link, 0);
1772 tipc_node_read_unlock(node);
1774 nlmsg_free(msg.skb);
1779 return genlmsg_reply(msg.skb, info);
1782 int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info)
1786 unsigned int bearer_id;
1787 struct tipc_link *link;
1788 struct tipc_node *node;
1789 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1790 struct net *net = sock_net(skb->sk);
1791 struct tipc_link_entry *le;
1793 if (!info->attrs[TIPC_NLA_LINK])
1796 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1797 info->attrs[TIPC_NLA_LINK],
1798 tipc_nl_link_policy);
1802 if (!attrs[TIPC_NLA_LINK_NAME])
1805 link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
1807 if (strcmp(link_name, tipc_bclink_name) == 0) {
1808 err = tipc_bclink_reset_stats(net);
1814 node = tipc_node_find_by_name(net, link_name, &bearer_id);
1818 le = &node->links[bearer_id];
1819 tipc_node_read_lock(node);
1820 spin_lock_bh(&le->lock);
1821 link = node->links[bearer_id].link;
1823 spin_unlock_bh(&le->lock);
1824 tipc_node_read_unlock(node);
1827 tipc_link_reset_stats(link);
1828 spin_unlock_bh(&le->lock);
1829 tipc_node_read_unlock(node);
1833 /* Caller should hold node lock */
1834 static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
1835 struct tipc_node *node, u32 *prev_link)
1840 for (i = *prev_link; i < MAX_BEARERS; i++) {
1843 if (!node->links[i].link)
1846 err = __tipc_nl_add_link(net, msg,
1847 node->links[i].link, NLM_F_MULTI);
1856 int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb)
1858 struct net *net = sock_net(skb->sk);
1859 struct tipc_net *tn = net_generic(net, tipc_net_id);
1860 struct tipc_node *node;
1861 struct tipc_nl_msg msg;
1862 u32 prev_node = cb->args[0];
1863 u32 prev_link = cb->args[1];
1864 int done = cb->args[2];
1871 msg.portid = NETLINK_CB(cb->skb).portid;
1872 msg.seq = cb->nlh->nlmsg_seq;
1876 node = tipc_node_find(net, prev_node);
1878 /* We never set seq or call nl_dump_check_consistent()
1879 * this means that setting prev_seq here will cause the
1880 * consistence check to fail in the netlink callback
1881 * handler. Resulting in the last NLMSG_DONE message
1882 * having the NLM_F_DUMP_INTR flag set.
1887 tipc_node_put(node);
1889 list_for_each_entry_continue_rcu(node, &tn->node_list,
1891 tipc_node_read_lock(node);
1892 err = __tipc_nl_add_node_links(net, &msg, node,
1894 tipc_node_read_unlock(node);
1898 prev_node = node->addr;
1901 err = tipc_nl_add_bc_link(net, &msg);
1905 list_for_each_entry_rcu(node, &tn->node_list, list) {
1906 tipc_node_read_lock(node);
1907 err = __tipc_nl_add_node_links(net, &msg, node,
1909 tipc_node_read_unlock(node);
1913 prev_node = node->addr;
1920 cb->args[0] = prev_node;
1921 cb->args[1] = prev_link;