2 * net/tipc/node.c: TIPC node management routines
4 * Copyright (c) 2000-2006, 2012-2016, Ericsson AB
5 * Copyright (c) 2005-2006, 2010-2014, Wind River Systems
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
20 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
40 #include "name_distr.h"
47 #define INVALID_NODE_SIG 0x10000
49 /* Flags used to take different actions according to flag type
50 * TIPC_NOTIFY_NODE_DOWN: notify node is down
51 * TIPC_NOTIFY_NODE_UP: notify node is up
52 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
55 TIPC_NOTIFY_NODE_DOWN = (1 << 3),
56 TIPC_NOTIFY_NODE_UP = (1 << 4),
57 TIPC_NOTIFY_LINK_UP = (1 << 6),
58 TIPC_NOTIFY_LINK_DOWN = (1 << 7)
61 struct tipc_link_entry {
62 struct tipc_link *link;
63 spinlock_t lock; /* per link */
65 struct sk_buff_head inputq;
66 struct tipc_media_addr maddr;
69 struct tipc_bclink_entry {
70 struct tipc_link *link;
71 struct sk_buff_head inputq1;
72 struct sk_buff_head arrvq;
73 struct sk_buff_head inputq2;
74 struct sk_buff_head namedq;
78 * struct tipc_node - TIPC node structure
79 * @addr: network address of node
80 * @ref: reference counter to node object
81 * @lock: rwlock governing access to structure
82 * @net: the applicable net namespace
83 * @hash: links to adjacent nodes in unsorted hash chain
84 * @inputq: pointer to input queue containing messages for msg event
85 * @namedq: pointer to name table input queue with name table messages
86 * @active_links: bearer ids of active links, used as index into links[] array
87 * @links: array containing references to all links to node
88 * @action_flags: bit mask of different types of node actions
89 * @state: connectivity state vs peer node
90 * @sync_point: sequence number where synch/failover is finished
91 * @list: links to adjacent nodes in sorted list of cluster's nodes
92 * @working_links: number of working links to node (both active and standby)
93 * @link_cnt: number of links to node
94 * @capabilities: bitmap, indicating peer node's functional capabilities
95 * @signature: node instance identifier
96 * @link_id: local and remote bearer ids of changing link, if any
97 * @publ_list: list of publications
98 * @rcu: rcu struct for tipc_node
105 struct hlist_node hash;
107 struct tipc_link_entry links[MAX_BEARERS];
108 struct tipc_bclink_entry bc_entry;
110 struct list_head list;
118 struct list_head publ_list;
119 struct list_head conn_sks;
120 unsigned long keepalive_intv;
121 struct timer_list timer;
125 /* Node FSM states and events:
128 SELF_DOWN_PEER_DOWN = 0xdd,
129 SELF_UP_PEER_UP = 0xaa,
130 SELF_DOWN_PEER_LEAVING = 0xd1,
131 SELF_UP_PEER_COMING = 0xac,
132 SELF_COMING_PEER_UP = 0xca,
133 SELF_LEAVING_PEER_DOWN = 0x1d,
134 NODE_FAILINGOVER = 0xf0,
139 SELF_ESTABL_CONTACT_EVT = 0xece,
140 SELF_LOST_CONTACT_EVT = 0x1ce,
141 PEER_ESTABL_CONTACT_EVT = 0x9ece,
142 PEER_LOST_CONTACT_EVT = 0x91ce,
143 NODE_FAILOVER_BEGIN_EVT = 0xfbe,
144 NODE_FAILOVER_END_EVT = 0xfee,
145 NODE_SYNCH_BEGIN_EVT = 0xcbe,
146 NODE_SYNCH_END_EVT = 0xcee
149 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
150 struct sk_buff_head *xmitq,
151 struct tipc_media_addr **maddr);
152 static void tipc_node_link_down(struct tipc_node *n, int bearer_id,
154 static void node_lost_contact(struct tipc_node *n, struct sk_buff_head *inputq);
155 static void tipc_node_delete(struct tipc_node *node);
156 static void tipc_node_timeout(unsigned long data);
157 static void tipc_node_fsm_evt(struct tipc_node *n, int evt);
158 static struct tipc_node *tipc_node_find(struct net *net, u32 addr);
159 static void tipc_node_put(struct tipc_node *node);
160 static bool tipc_node_is_up(struct tipc_node *n);
162 struct tipc_sock_conn {
166 struct list_head list;
169 static struct tipc_link *node_active_link(struct tipc_node *n, int sel)
171 int bearer_id = n->active_links[sel & 1];
173 if (unlikely(bearer_id == INVALID_BEARER_ID))
176 return n->links[bearer_id].link;
179 int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel)
183 unsigned int mtu = MAX_MSG_SIZE;
185 n = tipc_node_find(net, addr);
189 bearer_id = n->active_links[sel & 1];
190 if (likely(bearer_id != INVALID_BEARER_ID))
191 mtu = n->links[bearer_id].mtu;
196 u16 tipc_node_get_capabilities(struct net *net, u32 addr)
201 n = tipc_node_find(net, addr);
203 return TIPC_NODE_CAPABILITIES;
204 caps = n->capabilities;
209 static void tipc_node_kref_release(struct kref *kref)
211 struct tipc_node *n = container_of(kref, struct tipc_node, kref);
213 kfree(n->bc_entry.link);
217 static void tipc_node_put(struct tipc_node *node)
219 kref_put(&node->kref, tipc_node_kref_release);
222 static void tipc_node_get(struct tipc_node *node)
224 kref_get(&node->kref);
228 * tipc_node_find - locate specified node object, if it exists
230 static struct tipc_node *tipc_node_find(struct net *net, u32 addr)
232 struct tipc_net *tn = tipc_net(net);
233 struct tipc_node *node;
234 unsigned int thash = tipc_hashfn(addr);
236 if (unlikely(!in_own_cluster_exact(net, addr)))
240 hlist_for_each_entry_rcu(node, &tn->node_htable[thash], hash) {
241 if (node->addr != addr)
243 if (!kref_get_unless_zero(&node->kref))
251 static void tipc_node_read_lock(struct tipc_node *n)
253 read_lock_bh(&n->lock);
256 static void tipc_node_read_unlock(struct tipc_node *n)
258 read_unlock_bh(&n->lock);
261 static void tipc_node_write_lock(struct tipc_node *n)
263 write_lock_bh(&n->lock);
266 static void tipc_node_write_unlock_fast(struct tipc_node *n)
268 write_unlock_bh(&n->lock);
271 static void tipc_node_write_unlock(struct tipc_node *n)
273 struct net *net = n->net;
275 u32 flags = n->action_flags;
278 struct list_head *publ_list;
280 if (likely(!flags)) {
281 write_unlock_bh(&n->lock);
286 link_id = n->link_id;
287 bearer_id = link_id & 0xffff;
288 publ_list = &n->publ_list;
290 n->action_flags &= ~(TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP |
291 TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP);
293 write_unlock_bh(&n->lock);
295 if (flags & TIPC_NOTIFY_NODE_DOWN)
296 tipc_publ_notify(net, publ_list, addr);
298 if (flags & TIPC_NOTIFY_NODE_UP)
299 tipc_named_node_up(net, addr);
301 if (flags & TIPC_NOTIFY_LINK_UP) {
302 tipc_mon_peer_up(net, addr, bearer_id);
303 tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr,
304 TIPC_NODE_SCOPE, link_id, addr);
306 if (flags & TIPC_NOTIFY_LINK_DOWN) {
307 tipc_mon_peer_down(net, addr, bearer_id);
308 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_fast(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_fast(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_media_addr *maddr = NULL;
692 struct tipc_link *l = le->link;
693 int old_bearer_id = bearer_id;
694 struct sk_buff_head xmitq;
699 __skb_queue_head_init(&xmitq);
701 tipc_node_write_lock(n);
702 if (!tipc_link_is_establishing(l)) {
703 __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr);
710 /* Defuse pending tipc_node_link_up() */
711 tipc_link_fsm_evt(l, LINK_RESET_EVT);
713 tipc_node_write_unlock(n);
715 tipc_mon_remove_peer(n->net, n->addr, old_bearer_id);
716 if (!skb_queue_empty(&xmitq))
717 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr);
718 tipc_sk_rcv(n->net, &le->inputq);
721 static bool tipc_node_is_up(struct tipc_node *n)
723 return n->active_links[0] != INVALID_BEARER_ID;
726 void tipc_node_check_dest(struct net *net, u32 onode,
727 struct tipc_bearer *b,
728 u16 capabilities, u32 signature,
729 struct tipc_media_addr *maddr,
730 bool *respond, bool *dupl_addr)
734 struct tipc_link_entry *le;
735 bool addr_match = false;
736 bool sign_match = false;
737 bool link_up = false;
738 bool accept_addr = false;
746 n = tipc_node_create(net, onode, capabilities);
750 tipc_node_write_lock(n);
752 le = &n->links[b->identity];
754 /* Prepare to validate requesting node's signature and media address */
756 link_up = l && tipc_link_is_up(l);
757 addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr));
758 sign_match = (signature == n->signature);
760 /* These three flags give us eight permutations: */
762 if (sign_match && addr_match && link_up) {
763 /* All is fine. Do nothing. */
765 } else if (sign_match && addr_match && !link_up) {
766 /* Respond. The link will come up in due time */
768 } else if (sign_match && !addr_match && link_up) {
769 /* Peer has changed i/f address without rebooting.
770 * If so, the link will reset soon, and the next
771 * discovery will be accepted. So we can ignore it.
772 * It may also be an cloned or malicious peer having
773 * chosen the same node address and signature as an
775 * Ignore requests until the link goes down, if ever.
778 } else if (sign_match && !addr_match && !link_up) {
779 /* Peer link has changed i/f address without rebooting.
780 * It may also be a cloned or malicious peer; we can't
781 * distinguish between the two.
782 * The signature is correct, so we must accept.
786 } else if (!sign_match && addr_match && link_up) {
787 /* Peer node rebooted. Two possibilities:
788 * - Delayed re-discovery; this link endpoint has already
789 * reset and re-established contact with the peer, before
790 * receiving a discovery message from that node.
791 * (The peer happened to receive one from this node first).
792 * - The peer came back so fast that our side has not
793 * discovered it yet. Probing from this side will soon
794 * reset the link, since there can be no working link
795 * endpoint at the peer end, and the link will re-establish.
796 * Accept the signature, since it comes from a known peer.
798 n->signature = signature;
799 } else if (!sign_match && addr_match && !link_up) {
800 /* The peer node has rebooted.
801 * Accept signature, since it is a known peer.
803 n->signature = signature;
805 } else if (!sign_match && !addr_match && link_up) {
806 /* Peer rebooted with new address, or a new/duplicate peer.
807 * Ignore until the link goes down, if ever.
810 } else if (!sign_match && !addr_match && !link_up) {
811 /* Peer rebooted with new address, or it is a new peer.
812 * Accept signature and address.
814 n->signature = signature;
822 /* Now create new link if not already existing */
824 if (n->link_cnt == 2) {
825 pr_warn("Cannot establish 3rd link to %x\n", n->addr);
828 if_name = strchr(b->name, ':') + 1;
829 if (!tipc_link_create(net, if_name, b->identity, b->tolerance,
830 b->net_plane, b->mtu, b->priority,
831 b->window, mod(tipc_net(net)->random),
832 tipc_own_addr(net), onode,
834 tipc_bc_sndlink(n->net), n->bc_entry.link,
836 &n->bc_entry.namedq, &l)) {
841 tipc_link_fsm_evt(l, LINK_RESET_EVT);
842 if (n->state == NODE_FAILINGOVER)
843 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
846 tipc_node_calculate_timer(n, l);
847 if (n->link_cnt == 1) {
848 intv = jiffies + msecs_to_jiffies(n->keepalive_intv);
849 if (!mod_timer(&n->timer, intv))
853 memcpy(&le->maddr, maddr, sizeof(*maddr));
855 tipc_node_write_unlock(n);
856 if (reset && l && !tipc_link_is_reset(l))
857 tipc_node_link_down(n, b->identity, false);
861 void tipc_node_delete_links(struct net *net, int bearer_id)
863 struct tipc_net *tn = net_generic(net, tipc_net_id);
867 list_for_each_entry_rcu(n, &tn->node_list, list) {
868 tipc_node_link_down(n, bearer_id, true);
873 static void tipc_node_reset_links(struct tipc_node *n)
875 char addr_string[16];
878 pr_warn("Resetting all links to %s\n",
879 tipc_addr_string_fill(addr_string, n->addr));
881 for (i = 0; i < MAX_BEARERS; i++) {
882 tipc_node_link_down(n, i, false);
886 /* tipc_node_fsm_evt - node finite state machine
887 * Determines when contact is allowed with peer node
889 static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
891 int state = n->state;
894 case SELF_DOWN_PEER_DOWN:
896 case SELF_ESTABL_CONTACT_EVT:
897 state = SELF_UP_PEER_COMING;
899 case PEER_ESTABL_CONTACT_EVT:
900 state = SELF_COMING_PEER_UP;
902 case SELF_LOST_CONTACT_EVT:
903 case PEER_LOST_CONTACT_EVT:
905 case NODE_SYNCH_END_EVT:
906 case NODE_SYNCH_BEGIN_EVT:
907 case NODE_FAILOVER_BEGIN_EVT:
908 case NODE_FAILOVER_END_EVT:
913 case SELF_UP_PEER_UP:
915 case SELF_LOST_CONTACT_EVT:
916 state = SELF_DOWN_PEER_LEAVING;
918 case PEER_LOST_CONTACT_EVT:
919 state = SELF_LEAVING_PEER_DOWN;
921 case NODE_SYNCH_BEGIN_EVT:
922 state = NODE_SYNCHING;
924 case NODE_FAILOVER_BEGIN_EVT:
925 state = NODE_FAILINGOVER;
927 case SELF_ESTABL_CONTACT_EVT:
928 case PEER_ESTABL_CONTACT_EVT:
929 case NODE_SYNCH_END_EVT:
930 case NODE_FAILOVER_END_EVT:
936 case SELF_DOWN_PEER_LEAVING:
938 case PEER_LOST_CONTACT_EVT:
939 state = SELF_DOWN_PEER_DOWN;
941 case SELF_ESTABL_CONTACT_EVT:
942 case PEER_ESTABL_CONTACT_EVT:
943 case SELF_LOST_CONTACT_EVT:
945 case NODE_SYNCH_END_EVT:
946 case NODE_SYNCH_BEGIN_EVT:
947 case NODE_FAILOVER_BEGIN_EVT:
948 case NODE_FAILOVER_END_EVT:
953 case SELF_UP_PEER_COMING:
955 case PEER_ESTABL_CONTACT_EVT:
956 state = SELF_UP_PEER_UP;
958 case SELF_LOST_CONTACT_EVT:
959 state = SELF_DOWN_PEER_DOWN;
961 case SELF_ESTABL_CONTACT_EVT:
962 case PEER_LOST_CONTACT_EVT:
963 case NODE_SYNCH_END_EVT:
964 case NODE_FAILOVER_BEGIN_EVT:
966 case NODE_SYNCH_BEGIN_EVT:
967 case NODE_FAILOVER_END_EVT:
972 case SELF_COMING_PEER_UP:
974 case SELF_ESTABL_CONTACT_EVT:
975 state = SELF_UP_PEER_UP;
977 case PEER_LOST_CONTACT_EVT:
978 state = SELF_DOWN_PEER_DOWN;
980 case SELF_LOST_CONTACT_EVT:
981 case PEER_ESTABL_CONTACT_EVT:
983 case NODE_SYNCH_END_EVT:
984 case NODE_SYNCH_BEGIN_EVT:
985 case NODE_FAILOVER_BEGIN_EVT:
986 case NODE_FAILOVER_END_EVT:
991 case SELF_LEAVING_PEER_DOWN:
993 case SELF_LOST_CONTACT_EVT:
994 state = SELF_DOWN_PEER_DOWN;
996 case SELF_ESTABL_CONTACT_EVT:
997 case PEER_ESTABL_CONTACT_EVT:
998 case PEER_LOST_CONTACT_EVT:
1000 case NODE_SYNCH_END_EVT:
1001 case NODE_SYNCH_BEGIN_EVT:
1002 case NODE_FAILOVER_BEGIN_EVT:
1003 case NODE_FAILOVER_END_EVT:
1008 case NODE_FAILINGOVER:
1010 case SELF_LOST_CONTACT_EVT:
1011 state = SELF_DOWN_PEER_LEAVING;
1013 case PEER_LOST_CONTACT_EVT:
1014 state = SELF_LEAVING_PEER_DOWN;
1016 case NODE_FAILOVER_END_EVT:
1017 state = SELF_UP_PEER_UP;
1019 case NODE_FAILOVER_BEGIN_EVT:
1020 case SELF_ESTABL_CONTACT_EVT:
1021 case PEER_ESTABL_CONTACT_EVT:
1023 case NODE_SYNCH_BEGIN_EVT:
1024 case NODE_SYNCH_END_EVT:
1031 case SELF_LOST_CONTACT_EVT:
1032 state = SELF_DOWN_PEER_LEAVING;
1034 case PEER_LOST_CONTACT_EVT:
1035 state = SELF_LEAVING_PEER_DOWN;
1037 case NODE_SYNCH_END_EVT:
1038 state = SELF_UP_PEER_UP;
1040 case NODE_FAILOVER_BEGIN_EVT:
1041 state = NODE_FAILINGOVER;
1043 case NODE_SYNCH_BEGIN_EVT:
1044 case SELF_ESTABL_CONTACT_EVT:
1045 case PEER_ESTABL_CONTACT_EVT:
1047 case NODE_FAILOVER_END_EVT:
1053 pr_err("Unknown node fsm state %x\n", state);
1060 pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
1063 static void node_lost_contact(struct tipc_node *n,
1064 struct sk_buff_head *inputq)
1066 char addr_string[16];
1067 struct tipc_sock_conn *conn, *safe;
1068 struct tipc_link *l;
1069 struct list_head *conns = &n->conn_sks;
1070 struct sk_buff *skb;
1073 pr_debug("Lost contact with %s\n",
1074 tipc_addr_string_fill(addr_string, n->addr));
1076 /* Clean up broadcast state */
1077 tipc_bcast_remove_peer(n->net, n->bc_entry.link);
1079 /* Abort any ongoing link failover */
1080 for (i = 0; i < MAX_BEARERS; i++) {
1081 l = n->links[i].link;
1083 tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT);
1086 /* Notify publications from this node */
1087 n->action_flags |= TIPC_NOTIFY_NODE_DOWN;
1089 /* Notify sockets connected to node */
1090 list_for_each_entry_safe(conn, safe, conns, list) {
1091 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
1092 SHORT_H_SIZE, 0, tipc_own_addr(n->net),
1093 conn->peer_node, conn->port,
1094 conn->peer_port, TIPC_ERR_NO_NODE);
1096 skb_queue_tail(inputq, skb);
1097 list_del(&conn->list);
1103 * tipc_node_get_linkname - get the name of a link
1105 * @bearer_id: id of the bearer
1106 * @node: peer node address
1107 * @linkname: link name output buffer
1109 * Returns 0 on success
1111 int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
1112 char *linkname, size_t len)
1114 struct tipc_link *link;
1116 struct tipc_node *node = tipc_node_find(net, addr);
1121 if (bearer_id >= MAX_BEARERS)
1124 tipc_node_read_lock(node);
1125 link = node->links[bearer_id].link;
1127 strncpy(linkname, tipc_link_name(link), len);
1131 tipc_node_read_unlock(node);
1132 tipc_node_put(node);
1136 /* Caller should hold node lock for the passed node */
1137 static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
1140 struct nlattr *attrs;
1142 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
1143 NLM_F_MULTI, TIPC_NL_NODE_GET);
1147 attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE);
1151 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
1153 if (tipc_node_is_up(node))
1154 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
1157 nla_nest_end(msg->skb, attrs);
1158 genlmsg_end(msg->skb, hdr);
1163 nla_nest_cancel(msg->skb, attrs);
1165 genlmsg_cancel(msg->skb, hdr);
1171 * tipc_node_xmit() is the general link level function for message sending
1172 * @net: the applicable net namespace
1173 * @list: chain of buffers containing message
1174 * @dnode: address of destination node
1175 * @selector: a number used for deterministic link selection
1176 * Consumes the buffer chain, except when returning -ELINKCONG
1177 * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
1179 int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
1180 u32 dnode, int selector)
1182 struct tipc_link_entry *le = NULL;
1183 struct tipc_node *n;
1184 struct sk_buff_head xmitq;
1188 if (in_own_node(net, dnode)) {
1189 tipc_sk_rcv(net, list);
1193 n = tipc_node_find(net, dnode);
1195 skb_queue_purge(list);
1196 return -EHOSTUNREACH;
1199 tipc_node_read_lock(n);
1200 bearer_id = n->active_links[selector & 1];
1201 if (unlikely(bearer_id == INVALID_BEARER_ID)) {
1202 tipc_node_read_unlock(n);
1204 skb_queue_purge(list);
1205 return -EHOSTUNREACH;
1208 __skb_queue_head_init(&xmitq);
1209 le = &n->links[bearer_id];
1210 spin_lock_bh(&le->lock);
1211 rc = tipc_link_xmit(le->link, list, &xmitq);
1212 spin_unlock_bh(&le->lock);
1213 tipc_node_read_unlock(n);
1215 if (likely(rc == 0))
1216 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1217 else if (rc == -ENOBUFS)
1218 tipc_node_link_down(n, bearer_id, false);
1225 /* tipc_node_xmit_skb(): send single buffer to destination
1226 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1227 * messages, which will not be rejected
1228 * The only exception is datagram messages rerouted after secondary
1229 * lookup, which are rare and safe to dispose of anyway.
1230 * TODO: Return real return value, and let callers use
1231 * tipc_wait_for_sendpkt() where applicable
1233 int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
1236 struct sk_buff_head head;
1239 skb_queue_head_init(&head);
1240 __skb_queue_tail(&head, skb);
1241 rc = tipc_node_xmit(net, &head, dnode, selector);
1242 if (rc == -ELINKCONG)
1247 void tipc_node_broadcast(struct net *net, struct sk_buff *skb)
1249 struct sk_buff *txskb;
1250 struct tipc_node *n;
1254 list_for_each_entry_rcu(n, tipc_nodes(net), list) {
1256 if (in_own_node(net, dst))
1258 if (!tipc_node_is_up(n))
1260 txskb = pskb_copy(skb, GFP_ATOMIC);
1263 msg_set_destnode(buf_msg(txskb), dst);
1264 tipc_node_xmit_skb(net, txskb, dst, 0);
1271 static void tipc_node_bc_sync_rcv(struct tipc_node *n, struct tipc_msg *hdr,
1272 int bearer_id, struct sk_buff_head *xmitq)
1274 struct tipc_link *ucl;
1277 rc = tipc_bcast_sync_rcv(n->net, n->bc_entry.link, hdr);
1279 if (rc & TIPC_LINK_DOWN_EVT) {
1280 tipc_bearer_reset_all(n->net);
1284 if (!(rc & TIPC_LINK_SND_STATE))
1287 /* If probe message, a STATE response will be sent anyway */
1291 /* Produce a STATE message carrying broadcast NACK */
1292 tipc_node_read_lock(n);
1293 ucl = n->links[bearer_id].link;
1295 tipc_link_build_state_msg(ucl, xmitq);
1296 tipc_node_read_unlock(n);
1300 * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1301 * @net: the applicable net namespace
1303 * @bearer_id: id of bearer message arrived on
1305 * Invoked with no locks held.
1307 static void tipc_node_bc_rcv(struct net *net, struct sk_buff *skb, int bearer_id)
1310 struct sk_buff_head xmitq;
1311 struct tipc_bclink_entry *be;
1312 struct tipc_link_entry *le;
1313 struct tipc_msg *hdr = buf_msg(skb);
1314 int usr = msg_user(hdr);
1315 u32 dnode = msg_destnode(hdr);
1316 struct tipc_node *n;
1318 __skb_queue_head_init(&xmitq);
1320 /* If NACK for other node, let rcv link for that node peek into it */
1321 if ((usr == BCAST_PROTOCOL) && (dnode != tipc_own_addr(net)))
1322 n = tipc_node_find(net, dnode);
1324 n = tipc_node_find(net, msg_prevnode(hdr));
1330 le = &n->links[bearer_id];
1332 rc = tipc_bcast_rcv(net, be->link, skb);
1334 /* Broadcast ACKs are sent on a unicast link */
1335 if (rc & TIPC_LINK_SND_STATE) {
1336 tipc_node_read_lock(n);
1337 tipc_link_build_state_msg(le->link, &xmitq);
1338 tipc_node_read_unlock(n);
1341 if (!skb_queue_empty(&xmitq))
1342 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1344 /* Deliver. 'arrvq' is under inputq2's lock protection */
1345 if (!skb_queue_empty(&be->inputq1)) {
1346 spin_lock_bh(&be->inputq2.lock);
1347 spin_lock_bh(&be->inputq1.lock);
1348 skb_queue_splice_tail_init(&be->inputq1, &be->arrvq);
1349 spin_unlock_bh(&be->inputq1.lock);
1350 spin_unlock_bh(&be->inputq2.lock);
1351 tipc_sk_mcast_rcv(net, &be->arrvq, &be->inputq2);
1354 if (rc & TIPC_LINK_DOWN_EVT) {
1355 /* Reception reassembly failure => reset all links to peer */
1356 if (!tipc_link_is_up(be->link))
1357 tipc_node_reset_links(n);
1359 /* Retransmission failure => reset all links to all peers */
1360 if (!tipc_link_is_up(tipc_bc_sndlink(net)))
1361 tipc_bearer_reset_all(net);
1368 * tipc_node_check_state - check and if necessary update node state
1370 * @bearer_id: identity of bearer delivering the packet
1371 * Returns true if state is ok, otherwise consumes buffer and returns false
1373 static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb,
1374 int bearer_id, struct sk_buff_head *xmitq)
1376 struct tipc_msg *hdr = buf_msg(skb);
1377 int usr = msg_user(hdr);
1378 int mtyp = msg_type(hdr);
1379 u16 oseqno = msg_seqno(hdr);
1380 u16 iseqno = msg_seqno(msg_get_wrapped(hdr));
1381 u16 exp_pkts = msg_msgcnt(hdr);
1382 u16 rcv_nxt, syncpt, dlv_nxt, inputq_len;
1383 int state = n->state;
1384 struct tipc_link *l, *tnl, *pl = NULL;
1385 struct tipc_media_addr *maddr;
1388 l = n->links[bearer_id].link;
1391 rcv_nxt = tipc_link_rcv_nxt(l);
1394 if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL)))
1397 /* Find parallel link, if any */
1398 for (pb_id = 0; pb_id < MAX_BEARERS; pb_id++) {
1399 if ((pb_id != bearer_id) && n->links[pb_id].link) {
1400 pl = n->links[pb_id].link;
1405 /* Check and update node accesibility if applicable */
1406 if (state == SELF_UP_PEER_COMING) {
1407 if (!tipc_link_is_up(l))
1409 if (!msg_peer_link_is_up(hdr))
1411 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
1414 if (state == SELF_DOWN_PEER_LEAVING) {
1415 if (msg_peer_node_is_up(hdr))
1417 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
1421 if (state == SELF_LEAVING_PEER_DOWN)
1424 /* Ignore duplicate packets */
1425 if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt))
1428 /* Initiate or update failover mode if applicable */
1429 if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) {
1430 syncpt = oseqno + exp_pkts - 1;
1431 if (pl && tipc_link_is_up(pl)) {
1432 __tipc_node_link_down(n, &pb_id, xmitq, &maddr);
1433 tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl),
1434 tipc_link_inputq(l));
1436 /* If pkts arrive out of order, use lowest calculated syncpt */
1437 if (less(syncpt, n->sync_point))
1438 n->sync_point = syncpt;
1441 /* Open parallel link when tunnel link reaches synch point */
1442 if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) {
1443 if (!more(rcv_nxt, n->sync_point))
1445 tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT);
1447 tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT);
1451 /* No synching needed if only one link */
1452 if (!pl || !tipc_link_is_up(pl))
1455 /* Initiate synch mode if applicable */
1456 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG) && (oseqno == 1)) {
1457 syncpt = iseqno + exp_pkts - 1;
1458 if (!tipc_link_is_up(l)) {
1459 tipc_link_fsm_evt(l, LINK_ESTABLISH_EVT);
1460 __tipc_node_link_up(n, bearer_id, xmitq);
1462 if (n->state == SELF_UP_PEER_UP) {
1463 n->sync_point = syncpt;
1464 tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT);
1465 tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT);
1469 /* Open tunnel link when parallel link reaches synch point */
1470 if (n->state == NODE_SYNCHING) {
1471 if (tipc_link_is_synching(l)) {
1477 inputq_len = skb_queue_len(tipc_link_inputq(pl));
1478 dlv_nxt = tipc_link_rcv_nxt(pl) - inputq_len;
1479 if (more(dlv_nxt, n->sync_point)) {
1480 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
1481 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
1486 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG))
1488 if (usr == LINK_PROTOCOL)
1496 * tipc_rcv - process TIPC packets/messages arriving from off-node
1497 * @net: the applicable net namespace
1499 * @bearer: pointer to bearer message arrived on
1501 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1502 * structure (i.e. cannot be NULL), but bearer can be inactive.
1504 void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
1506 struct sk_buff_head xmitq;
1507 struct tipc_node *n;
1508 struct tipc_msg *hdr = buf_msg(skb);
1509 int usr = msg_user(hdr);
1510 int bearer_id = b->identity;
1511 struct tipc_link_entry *le;
1512 u16 bc_ack = msg_bcast_ack(hdr);
1513 u32 self = tipc_own_addr(net);
1516 __skb_queue_head_init(&xmitq);
1518 /* Ensure message is well-formed */
1519 if (unlikely(!tipc_msg_validate(skb)))
1522 /* Handle arrival of discovery or broadcast packet */
1523 if (unlikely(msg_non_seq(hdr))) {
1524 if (unlikely(usr == LINK_CONFIG))
1525 return tipc_disc_rcv(net, skb, b);
1527 return tipc_node_bc_rcv(net, skb, bearer_id);
1530 /* Discard unicast link messages destined for another node */
1531 if (unlikely(!msg_short(hdr) && (msg_destnode(hdr) != self)))
1534 /* Locate neighboring node that sent packet */
1535 n = tipc_node_find(net, msg_prevnode(hdr));
1538 le = &n->links[bearer_id];
1540 /* Ensure broadcast reception is in synch with peer's send state */
1541 if (unlikely(usr == LINK_PROTOCOL))
1542 tipc_node_bc_sync_rcv(n, hdr, bearer_id, &xmitq);
1543 else if (unlikely(tipc_link_acked(n->bc_entry.link) != bc_ack))
1544 tipc_bcast_ack_rcv(net, n->bc_entry.link, hdr);
1546 /* Receive packet directly if conditions permit */
1547 tipc_node_read_lock(n);
1548 if (likely((n->state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) {
1549 spin_lock_bh(&le->lock);
1551 rc = tipc_link_rcv(le->link, skb, &xmitq);
1554 spin_unlock_bh(&le->lock);
1556 tipc_node_read_unlock(n);
1558 /* Check/update node state before receiving */
1559 if (unlikely(skb)) {
1560 tipc_node_write_lock(n);
1561 if (tipc_node_check_state(n, skb, bearer_id, &xmitq)) {
1563 rc = tipc_link_rcv(le->link, skb, &xmitq);
1567 tipc_node_write_unlock(n);
1570 if (unlikely(rc & TIPC_LINK_UP_EVT))
1571 tipc_node_link_up(n, bearer_id, &xmitq);
1573 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
1574 tipc_node_link_down(n, bearer_id, false);
1576 if (unlikely(!skb_queue_empty(&n->bc_entry.namedq)))
1577 tipc_named_rcv(net, &n->bc_entry.namedq);
1579 if (!skb_queue_empty(&le->inputq))
1580 tipc_sk_rcv(net, &le->inputq);
1582 if (!skb_queue_empty(&xmitq))
1583 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1590 int tipc_nl_peer_rm(struct sk_buff *skb, struct genl_info *info)
1592 struct net *net = sock_net(skb->sk);
1593 struct tipc_net *tn = net_generic(net, tipc_net_id);
1594 struct nlattr *attrs[TIPC_NLA_NET_MAX + 1];
1595 struct tipc_node *peer;
1600 /* We identify the peer by its net */
1601 if (!info->attrs[TIPC_NLA_NET])
1604 err = nla_parse_nested(attrs, TIPC_NLA_NET_MAX,
1605 info->attrs[TIPC_NLA_NET],
1606 tipc_nl_net_policy);
1610 if (!attrs[TIPC_NLA_NET_ADDR])
1613 addr = nla_get_u32(attrs[TIPC_NLA_NET_ADDR]);
1615 if (in_own_node(net, addr))
1618 spin_lock_bh(&tn->node_list_lock);
1619 peer = tipc_node_find(net, addr);
1621 spin_unlock_bh(&tn->node_list_lock);
1625 tipc_node_write_lock(peer);
1626 if (peer->state != SELF_DOWN_PEER_DOWN &&
1627 peer->state != SELF_DOWN_PEER_LEAVING) {
1628 tipc_node_write_unlock(peer);
1633 for (i = 0; i < MAX_BEARERS; i++) {
1634 struct tipc_link_entry *le = &peer->links[i];
1642 tipc_node_write_unlock(peer);
1643 tipc_node_delete(peer);
1647 tipc_node_put(peer);
1648 spin_unlock_bh(&tn->node_list_lock);
1653 int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
1656 struct net *net = sock_net(skb->sk);
1657 struct tipc_net *tn = net_generic(net, tipc_net_id);
1658 int done = cb->args[0];
1659 int last_addr = cb->args[1];
1660 struct tipc_node *node;
1661 struct tipc_nl_msg msg;
1667 msg.portid = NETLINK_CB(cb->skb).portid;
1668 msg.seq = cb->nlh->nlmsg_seq;
1672 node = tipc_node_find(net, last_addr);
1675 /* We never set seq or call nl_dump_check_consistent()
1676 * this means that setting prev_seq here will cause the
1677 * consistence check to fail in the netlink callback
1678 * handler. Resulting in the NLMSG_DONE message having
1679 * the NLM_F_DUMP_INTR flag set if the node state
1680 * changed while we released the lock.
1685 tipc_node_put(node);
1688 list_for_each_entry_rcu(node, &tn->node_list, list) {
1690 if (node->addr == last_addr)
1696 tipc_node_read_lock(node);
1697 err = __tipc_nl_add_node(&msg, node);
1699 last_addr = node->addr;
1700 tipc_node_read_unlock(node);
1704 tipc_node_read_unlock(node);
1709 cb->args[1] = last_addr;
1715 /* tipc_node_find_by_name - locate owner node of link by link's name
1716 * @net: the applicable net namespace
1717 * @name: pointer to link name string
1718 * @bearer_id: pointer to index in 'node->links' array where the link was found.
1720 * Returns pointer to node owning the link, or 0 if no matching link is found.
1722 static struct tipc_node *tipc_node_find_by_name(struct net *net,
1723 const char *link_name,
1724 unsigned int *bearer_id)
1726 struct tipc_net *tn = net_generic(net, tipc_net_id);
1727 struct tipc_link *l;
1728 struct tipc_node *n;
1729 struct tipc_node *found_node = NULL;
1734 list_for_each_entry_rcu(n, &tn->node_list, list) {
1735 tipc_node_read_lock(n);
1736 for (i = 0; i < MAX_BEARERS; i++) {
1737 l = n->links[i].link;
1738 if (l && !strcmp(tipc_link_name(l), link_name)) {
1744 tipc_node_read_unlock(n);
1753 int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info)
1759 struct tipc_link *link;
1760 struct tipc_node *node;
1761 struct sk_buff_head xmitq;
1762 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1763 struct net *net = sock_net(skb->sk);
1765 __skb_queue_head_init(&xmitq);
1767 if (!info->attrs[TIPC_NLA_LINK])
1770 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1771 info->attrs[TIPC_NLA_LINK],
1772 tipc_nl_link_policy);
1776 if (!attrs[TIPC_NLA_LINK_NAME])
1779 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
1781 if (strcmp(name, tipc_bclink_name) == 0)
1782 return tipc_nl_bc_link_set(net, attrs);
1784 node = tipc_node_find_by_name(net, name, &bearer_id);
1788 tipc_node_read_lock(node);
1790 link = node->links[bearer_id].link;
1796 if (attrs[TIPC_NLA_LINK_PROP]) {
1797 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
1799 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
1806 if (props[TIPC_NLA_PROP_TOL]) {
1809 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
1810 tipc_link_set_tolerance(link, tol, &xmitq);
1812 if (props[TIPC_NLA_PROP_PRIO]) {
1815 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
1816 tipc_link_set_prio(link, prio, &xmitq);
1818 if (props[TIPC_NLA_PROP_WIN]) {
1821 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
1822 tipc_link_set_queue_limits(link, win);
1827 tipc_node_read_unlock(node);
1828 tipc_bearer_xmit(net, bearer_id, &xmitq, &node->links[bearer_id].maddr);
1832 int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info)
1834 struct net *net = genl_info_net(info);
1835 struct tipc_nl_msg msg;
1839 msg.portid = info->snd_portid;
1840 msg.seq = info->snd_seq;
1842 if (!info->attrs[TIPC_NLA_LINK_NAME])
1844 name = nla_data(info->attrs[TIPC_NLA_LINK_NAME]);
1846 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
1850 if (strcmp(name, tipc_bclink_name) == 0) {
1851 err = tipc_nl_add_bc_link(net, &msg);
1856 struct tipc_node *node;
1857 struct tipc_link *link;
1859 node = tipc_node_find_by_name(net, name, &bearer_id);
1865 tipc_node_read_lock(node);
1866 link = node->links[bearer_id].link;
1868 tipc_node_read_unlock(node);
1873 err = __tipc_nl_add_link(net, &msg, link, 0);
1874 tipc_node_read_unlock(node);
1879 return genlmsg_reply(msg.skb, info);
1882 nlmsg_free(msg.skb);
1886 int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info)
1890 unsigned int bearer_id;
1891 struct tipc_link *link;
1892 struct tipc_node *node;
1893 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1894 struct net *net = sock_net(skb->sk);
1895 struct tipc_link_entry *le;
1897 if (!info->attrs[TIPC_NLA_LINK])
1900 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1901 info->attrs[TIPC_NLA_LINK],
1902 tipc_nl_link_policy);
1906 if (!attrs[TIPC_NLA_LINK_NAME])
1909 link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
1911 if (strcmp(link_name, tipc_bclink_name) == 0) {
1912 err = tipc_bclink_reset_stats(net);
1918 node = tipc_node_find_by_name(net, link_name, &bearer_id);
1922 le = &node->links[bearer_id];
1923 tipc_node_read_lock(node);
1924 spin_lock_bh(&le->lock);
1925 link = node->links[bearer_id].link;
1927 spin_unlock_bh(&le->lock);
1928 tipc_node_read_unlock(node);
1931 tipc_link_reset_stats(link);
1932 spin_unlock_bh(&le->lock);
1933 tipc_node_read_unlock(node);
1937 /* Caller should hold node lock */
1938 static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
1939 struct tipc_node *node, u32 *prev_link)
1944 for (i = *prev_link; i < MAX_BEARERS; i++) {
1947 if (!node->links[i].link)
1950 err = __tipc_nl_add_link(net, msg,
1951 node->links[i].link, NLM_F_MULTI);
1960 int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb)
1962 struct net *net = sock_net(skb->sk);
1963 struct tipc_net *tn = net_generic(net, tipc_net_id);
1964 struct tipc_node *node;
1965 struct tipc_nl_msg msg;
1966 u32 prev_node = cb->args[0];
1967 u32 prev_link = cb->args[1];
1968 int done = cb->args[2];
1975 msg.portid = NETLINK_CB(cb->skb).portid;
1976 msg.seq = cb->nlh->nlmsg_seq;
1980 node = tipc_node_find(net, prev_node);
1982 /* We never set seq or call nl_dump_check_consistent()
1983 * this means that setting prev_seq here will cause the
1984 * consistence check to fail in the netlink callback
1985 * handler. Resulting in the last NLMSG_DONE message
1986 * having the NLM_F_DUMP_INTR flag set.
1991 tipc_node_put(node);
1993 list_for_each_entry_continue_rcu(node, &tn->node_list,
1995 tipc_node_read_lock(node);
1996 err = __tipc_nl_add_node_links(net, &msg, node,
1998 tipc_node_read_unlock(node);
2002 prev_node = node->addr;
2005 err = tipc_nl_add_bc_link(net, &msg);
2009 list_for_each_entry_rcu(node, &tn->node_list, list) {
2010 tipc_node_read_lock(node);
2011 err = __tipc_nl_add_node_links(net, &msg, node,
2013 tipc_node_read_unlock(node);
2017 prev_node = node->addr;
2024 cb->args[0] = prev_node;
2025 cb->args[1] = prev_link;
2031 int tipc_nl_node_set_monitor(struct sk_buff *skb, struct genl_info *info)
2033 struct nlattr *attrs[TIPC_NLA_MON_MAX + 1];
2034 struct net *net = sock_net(skb->sk);
2037 if (!info->attrs[TIPC_NLA_MON])
2040 err = nla_parse_nested(attrs, TIPC_NLA_MON_MAX,
2041 info->attrs[TIPC_NLA_MON],
2042 tipc_nl_monitor_policy);
2046 if (attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]) {
2049 val = nla_get_u32(attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]);
2050 err = tipc_nl_monitor_set_threshold(net, val);
2058 static int __tipc_nl_add_monitor_prop(struct net *net, struct tipc_nl_msg *msg)
2060 struct nlattr *attrs;
2064 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
2065 0, TIPC_NL_MON_GET);
2069 attrs = nla_nest_start(msg->skb, TIPC_NLA_MON);
2073 val = tipc_nl_monitor_get_threshold(net);
2075 if (nla_put_u32(msg->skb, TIPC_NLA_MON_ACTIVATION_THRESHOLD, val))
2078 nla_nest_end(msg->skb, attrs);
2079 genlmsg_end(msg->skb, hdr);
2084 nla_nest_cancel(msg->skb, attrs);
2086 genlmsg_cancel(msg->skb, hdr);
2091 int tipc_nl_node_get_monitor(struct sk_buff *skb, struct genl_info *info)
2093 struct net *net = sock_net(skb->sk);
2094 struct tipc_nl_msg msg;
2097 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2100 msg.portid = info->snd_portid;
2101 msg.seq = info->snd_seq;
2103 err = __tipc_nl_add_monitor_prop(net, &msg);
2105 nlmsg_free(msg.skb);
2109 return genlmsg_reply(msg.skb, info);
2112 int tipc_nl_node_dump_monitor(struct sk_buff *skb, struct netlink_callback *cb)
2114 struct net *net = sock_net(skb->sk);
2115 u32 prev_bearer = cb->args[0];
2116 struct tipc_nl_msg msg;
2120 if (prev_bearer == MAX_BEARERS)
2124 msg.portid = NETLINK_CB(cb->skb).portid;
2125 msg.seq = cb->nlh->nlmsg_seq;
2128 for (i = prev_bearer; i < MAX_BEARERS; i++) {
2130 err = __tipc_nl_add_monitor(net, &msg, prev_bearer);
2137 cb->args[0] = prev_bearer;
2142 int tipc_nl_node_dump_monitor_peer(struct sk_buff *skb,
2143 struct netlink_callback *cb)
2145 struct net *net = sock_net(skb->sk);
2146 u32 prev_node = cb->args[1];
2147 u32 bearer_id = cb->args[2];
2148 int done = cb->args[0];
2149 struct tipc_nl_msg msg;
2153 struct nlattr **attrs;
2154 struct nlattr *mon[TIPC_NLA_MON_MAX + 1];
2156 err = tipc_nlmsg_parse(cb->nlh, &attrs);
2160 if (!attrs[TIPC_NLA_MON])
2163 err = nla_parse_nested(mon, TIPC_NLA_MON_MAX,
2164 attrs[TIPC_NLA_MON],
2165 tipc_nl_monitor_policy);
2169 if (!mon[TIPC_NLA_MON_REF])
2172 bearer_id = nla_get_u32(mon[TIPC_NLA_MON_REF]);
2174 if (bearer_id >= MAX_BEARERS)
2182 msg.portid = NETLINK_CB(cb->skb).portid;
2183 msg.seq = cb->nlh->nlmsg_seq;
2186 err = tipc_nl_add_monitor_peer(net, &msg, bearer_id, &prev_node);
2192 cb->args[1] = prev_node;
2193 cb->args[2] = bearer_id;