2 * net/tipc/node.c: TIPC node management routines
4 * Copyright (c) 2000-2006, 2012-2015, 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"
45 static void node_lost_contact(struct tipc_node *n_ptr);
46 static void node_established_contact(struct tipc_node *n_ptr);
47 static void tipc_node_delete(struct tipc_node *node);
48 static void tipc_node_timeout(unsigned long data);
49 static void tipc_node_fsm_evt(struct tipc_node *n, int evt);
51 struct tipc_sock_conn {
55 struct list_head list;
58 static const struct nla_policy tipc_nl_node_policy[TIPC_NLA_NODE_MAX + 1] = {
59 [TIPC_NLA_NODE_UNSPEC] = { .type = NLA_UNSPEC },
60 [TIPC_NLA_NODE_ADDR] = { .type = NLA_U32 },
61 [TIPC_NLA_NODE_UP] = { .type = NLA_FLAG }
65 * A trivial power-of-two bitmask technique is used for speed, since this
66 * operation is done for every incoming TIPC packet. The number of hash table
67 * entries has been chosen so that no hash chain exceeds 8 nodes and will
68 * usually be much smaller (typically only a single node).
70 static unsigned int tipc_hashfn(u32 addr)
72 return addr & (NODE_HTABLE_SIZE - 1);
75 static void tipc_node_kref_release(struct kref *kref)
77 struct tipc_node *node = container_of(kref, struct tipc_node, kref);
79 tipc_node_delete(node);
82 void tipc_node_put(struct tipc_node *node)
84 kref_put(&node->kref, tipc_node_kref_release);
87 static void tipc_node_get(struct tipc_node *node)
89 kref_get(&node->kref);
93 * tipc_node_find - locate specified node object, if it exists
95 struct tipc_node *tipc_node_find(struct net *net, u32 addr)
97 struct tipc_net *tn = net_generic(net, tipc_net_id);
98 struct tipc_node *node;
100 if (unlikely(!in_own_cluster_exact(net, addr)))
104 hlist_for_each_entry_rcu(node, &tn->node_htable[tipc_hashfn(addr)],
106 if (node->addr == addr) {
116 struct tipc_node *tipc_node_create(struct net *net, u32 addr)
118 struct tipc_net *tn = net_generic(net, tipc_net_id);
119 struct tipc_node *n_ptr, *temp_node;
121 spin_lock_bh(&tn->node_list_lock);
122 n_ptr = tipc_node_find(net, addr);
125 n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC);
127 pr_warn("Node creation failed, no memory\n");
132 kref_init(&n_ptr->kref);
133 spin_lock_init(&n_ptr->lock);
134 INIT_HLIST_NODE(&n_ptr->hash);
135 INIT_LIST_HEAD(&n_ptr->list);
136 INIT_LIST_HEAD(&n_ptr->publ_list);
137 INIT_LIST_HEAD(&n_ptr->conn_sks);
138 skb_queue_head_init(&n_ptr->bclink.namedq);
139 __skb_queue_head_init(&n_ptr->bclink.deferdq);
140 hlist_add_head_rcu(&n_ptr->hash, &tn->node_htable[tipc_hashfn(addr)]);
141 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
142 if (n_ptr->addr < temp_node->addr)
145 list_add_tail_rcu(&n_ptr->list, &temp_node->list);
146 n_ptr->state = SELF_DOWN_PEER_LEAVING;
147 n_ptr->signature = INVALID_NODE_SIG;
148 n_ptr->active_links[0] = INVALID_BEARER_ID;
149 n_ptr->active_links[1] = INVALID_BEARER_ID;
150 tipc_node_get(n_ptr);
151 setup_timer(&n_ptr->timer, tipc_node_timeout, (unsigned long)n_ptr);
152 n_ptr->keepalive_intv = U32_MAX;
154 spin_unlock_bh(&tn->node_list_lock);
158 static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l)
160 unsigned long tol = l->tolerance;
161 unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4;
162 unsigned long keepalive_intv = msecs_to_jiffies(intv);
164 /* Link with lowest tolerance determines timer interval */
165 if (keepalive_intv < n->keepalive_intv)
166 n->keepalive_intv = keepalive_intv;
168 /* Ensure link's abort limit corresponds to current interval */
169 l->abort_limit = l->tolerance / jiffies_to_msecs(n->keepalive_intv);
172 static void tipc_node_delete(struct tipc_node *node)
174 list_del_rcu(&node->list);
175 hlist_del_rcu(&node->hash);
176 kfree_rcu(node, rcu);
179 void tipc_node_stop(struct net *net)
181 struct tipc_net *tn = net_generic(net, tipc_net_id);
182 struct tipc_node *node, *t_node;
184 spin_lock_bh(&tn->node_list_lock);
185 list_for_each_entry_safe(node, t_node, &tn->node_list, list) {
186 if (del_timer(&node->timer))
190 spin_unlock_bh(&tn->node_list_lock);
193 int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port)
195 struct tipc_node *node;
196 struct tipc_sock_conn *conn;
199 if (in_own_node(net, dnode))
202 node = tipc_node_find(net, dnode);
204 pr_warn("Connecting sock to node 0x%x failed\n", dnode);
205 return -EHOSTUNREACH;
207 conn = kmalloc(sizeof(*conn), GFP_ATOMIC);
212 conn->peer_node = dnode;
214 conn->peer_port = peer_port;
216 tipc_node_lock(node);
217 list_add_tail(&conn->list, &node->conn_sks);
218 tipc_node_unlock(node);
224 void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port)
226 struct tipc_node *node;
227 struct tipc_sock_conn *conn, *safe;
229 if (in_own_node(net, dnode))
232 node = tipc_node_find(net, dnode);
236 tipc_node_lock(node);
237 list_for_each_entry_safe(conn, safe, &node->conn_sks, list) {
238 if (port != conn->port)
240 list_del(&conn->list);
243 tipc_node_unlock(node);
247 /* tipc_node_timeout - handle expiration of node timer
249 static void tipc_node_timeout(unsigned long data)
251 struct tipc_node *n = (struct tipc_node *)data;
252 struct sk_buff_head xmitq;
254 struct tipc_media_addr *maddr;
258 __skb_queue_head_init(&xmitq);
260 for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) {
262 l = n->links[bearer_id].link;
264 /* Link tolerance may change asynchronously: */
265 tipc_node_calculate_timer(n, l);
266 rc = tipc_link_timeout(l, &xmitq);
267 if (rc & TIPC_LINK_DOWN_EVT)
268 tipc_node_link_down(n, bearer_id);
271 maddr = &n->links[bearer_id].maddr;
272 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr);
274 if (!mod_timer(&n->timer, jiffies + n->keepalive_intv))
280 * tipc_node_link_up - handle addition of link
282 * Link becomes active (alone or shared) or standby, depending on its priority.
284 void tipc_node_link_up(struct tipc_node *n, int bearer_id)
286 int *slot0 = &n->active_links[0];
287 int *slot1 = &n->active_links[1];
288 struct tipc_link_entry *links = n->links;
289 struct tipc_link *l = n->links[bearer_id].link;
291 /* Leave room for tunnel header when returning 'mtu' to users: */
292 links[bearer_id].mtu = l->mtu - INT_H_SIZE;
295 n->action_flags |= TIPC_NOTIFY_LINK_UP;
296 n->link_id = l->peer_bearer_id << 16 | l->bearer_id;
298 tipc_bearer_add_dest(n->net, bearer_id, n->addr);
300 pr_debug("Established link <%s> on network plane %c\n",
301 l->name, l->net_plane);
303 /* No active links ? => take both active slots */
304 if (!tipc_node_is_up(n)) {
307 node_established_contact(n);
311 /* Lower prio than current active ? => no slot */
312 if (l->priority < links[*slot0].link->priority) {
313 pr_debug("New link <%s> becomes standby\n", l->name);
316 tipc_link_dup_queue_xmit(links[*slot0].link, l);
318 /* Same prio as current active ? => take one slot */
319 if (l->priority == links[*slot0].link->priority) {
324 /* Higher prio than current active => take both active slots */
325 pr_debug("Old link <%s> now standby\n", links[*slot0].link->name);
331 * tipc_node_link_down - handle loss of link
333 void tipc_node_link_down(struct tipc_node *n, int bearer_id)
335 int *slot0 = &n->active_links[0];
336 int *slot1 = &n->active_links[1];
338 struct tipc_link *l, *_l;
340 l = n->links[bearer_id].link;
341 if (!l || !tipc_link_is_up(l))
345 n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
346 n->link_id = l->peer_bearer_id << 16 | l->bearer_id;
348 tipc_bearer_remove_dest(n->net, l->bearer_id, n->addr);
350 pr_debug("Lost link <%s> on network plane %c\n",
351 l->name, l->net_plane);
353 /* Select new active link if any available */
354 *slot0 = INVALID_BEARER_ID;
355 *slot1 = INVALID_BEARER_ID;
356 for (i = 0; i < MAX_BEARERS; i++) {
357 _l = n->links[i].link;
358 if (!_l || !tipc_link_is_up(_l))
362 if (_l->priority < highest)
364 if (_l->priority > highest) {
365 highest = _l->priority;
373 if (tipc_node_is_up(n))
374 tipc_link_failover_send_queue(l);
378 if (!tipc_node_is_up(n))
379 node_lost_contact(n);
382 bool tipc_node_is_up(struct tipc_node *n)
384 return n->active_links[0] != INVALID_BEARER_ID;
387 void tipc_node_check_dest(struct tipc_node *n, struct tipc_bearer *b,
388 bool *link_up, bool *addr_match,
389 struct tipc_media_addr *maddr)
391 struct tipc_link *l = n->links[b->identity].link;
392 struct tipc_media_addr *curr = &n->links[b->identity].maddr;
394 *link_up = l && tipc_link_is_up(l);
395 *addr_match = l && !memcmp(curr, maddr, sizeof(*maddr));
398 bool tipc_node_update_dest(struct tipc_node *n, struct tipc_bearer *b,
399 struct tipc_media_addr *maddr)
401 struct tipc_link *l = n->links[b->identity].link;
402 struct tipc_media_addr *curr = &n->links[b->identity].maddr;
403 struct sk_buff_head *inputq = &n->links[b->identity].inputq;
406 l = tipc_link_create(n, b, maddr, inputq, &n->bclink.namedq);
409 tipc_node_calculate_timer(n, l);
410 if (n->link_cnt == 1) {
411 if (!mod_timer(&n->timer, jiffies + n->keepalive_intv))
415 memcpy(&l->media_addr, maddr, sizeof(*maddr));
416 memcpy(curr, maddr, sizeof(*maddr));
417 tipc_node_link_down(n, b->identity);
421 void tipc_node_delete_links(struct net *net, int bearer_id)
423 struct tipc_net *tn = net_generic(net, tipc_net_id);
428 list_for_each_entry_rcu(n, &tn->node_list, list) {
430 l = n->links[bearer_id].link;
432 tipc_node_link_down(n, bearer_id);
433 n->links[bearer_id].link = NULL;
442 static void tipc_node_reset_links(struct tipc_node *n)
444 char addr_string[16];
449 pr_warn("Resetting all links to %s\n",
450 tipc_addr_string_fill(addr_string, n->addr));
452 for (i = 0; i < MAX_BEARERS; i++) {
453 if (!n->links[i].link)
455 tipc_node_link_down(n, i);
460 void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
462 n_ptr->links[l_ptr->bearer_id].link = l_ptr;
466 void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
470 for (i = 0; i < MAX_BEARERS; i++) {
471 if (l_ptr != n_ptr->links[i].link)
473 n_ptr->links[i].link = NULL;
478 /* tipc_node_fsm_evt - node finite state machine
479 * Determines when contact is allowed with peer node
481 static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
483 int state = n->state;
486 case SELF_DOWN_PEER_DOWN:
488 case SELF_ESTABL_CONTACT_EVT:
489 state = SELF_UP_PEER_COMING;
491 case PEER_ESTABL_CONTACT_EVT:
492 state = SELF_COMING_PEER_UP;
494 case SELF_LOST_CONTACT_EVT:
495 case PEER_LOST_CONTACT_EVT:
497 case NODE_SYNCH_END_EVT:
498 case NODE_SYNCH_BEGIN_EVT:
499 case NODE_FAILOVER_BEGIN_EVT:
500 case NODE_FAILOVER_END_EVT:
505 case SELF_UP_PEER_UP:
507 case SELF_LOST_CONTACT_EVT:
508 state = SELF_DOWN_PEER_LEAVING;
510 case PEER_LOST_CONTACT_EVT:
511 state = SELF_LEAVING_PEER_DOWN;
513 case NODE_SYNCH_BEGIN_EVT:
514 state = NODE_SYNCHING;
516 case NODE_FAILOVER_BEGIN_EVT:
517 state = NODE_FAILINGOVER;
519 case SELF_ESTABL_CONTACT_EVT:
520 case PEER_ESTABL_CONTACT_EVT:
521 case NODE_SYNCH_END_EVT:
522 case NODE_FAILOVER_END_EVT:
528 case SELF_DOWN_PEER_LEAVING:
530 case PEER_LOST_CONTACT_EVT:
531 state = SELF_DOWN_PEER_DOWN;
533 case SELF_ESTABL_CONTACT_EVT:
534 case PEER_ESTABL_CONTACT_EVT:
535 case SELF_LOST_CONTACT_EVT:
537 case NODE_SYNCH_END_EVT:
538 case NODE_SYNCH_BEGIN_EVT:
539 case NODE_FAILOVER_BEGIN_EVT:
540 case NODE_FAILOVER_END_EVT:
545 case SELF_UP_PEER_COMING:
547 case PEER_ESTABL_CONTACT_EVT:
548 state = SELF_UP_PEER_UP;
550 case SELF_LOST_CONTACT_EVT:
551 state = SELF_DOWN_PEER_LEAVING;
553 case SELF_ESTABL_CONTACT_EVT:
554 case PEER_LOST_CONTACT_EVT:
556 case NODE_SYNCH_END_EVT:
557 case NODE_SYNCH_BEGIN_EVT:
558 case NODE_FAILOVER_BEGIN_EVT:
559 case NODE_FAILOVER_END_EVT:
564 case SELF_COMING_PEER_UP:
566 case SELF_ESTABL_CONTACT_EVT:
567 state = SELF_UP_PEER_UP;
569 case PEER_LOST_CONTACT_EVT:
570 state = SELF_LEAVING_PEER_DOWN;
572 case SELF_LOST_CONTACT_EVT:
573 case PEER_ESTABL_CONTACT_EVT:
575 case NODE_SYNCH_END_EVT:
576 case NODE_SYNCH_BEGIN_EVT:
577 case NODE_FAILOVER_BEGIN_EVT:
578 case NODE_FAILOVER_END_EVT:
583 case SELF_LEAVING_PEER_DOWN:
585 case SELF_LOST_CONTACT_EVT:
586 state = SELF_DOWN_PEER_DOWN;
588 case SELF_ESTABL_CONTACT_EVT:
589 case PEER_ESTABL_CONTACT_EVT:
590 case PEER_LOST_CONTACT_EVT:
592 case NODE_SYNCH_END_EVT:
593 case NODE_SYNCH_BEGIN_EVT:
594 case NODE_FAILOVER_BEGIN_EVT:
595 case NODE_FAILOVER_END_EVT:
600 case NODE_FAILINGOVER:
602 case SELF_LOST_CONTACT_EVT:
603 state = SELF_DOWN_PEER_LEAVING;
605 case PEER_LOST_CONTACT_EVT:
606 state = SELF_LEAVING_PEER_DOWN;
608 case NODE_FAILOVER_END_EVT:
609 state = SELF_UP_PEER_UP;
611 case NODE_FAILOVER_BEGIN_EVT:
612 case SELF_ESTABL_CONTACT_EVT:
613 case PEER_ESTABL_CONTACT_EVT:
615 case NODE_SYNCH_BEGIN_EVT:
616 case NODE_SYNCH_END_EVT:
623 case SELF_LOST_CONTACT_EVT:
624 state = SELF_DOWN_PEER_LEAVING;
626 case PEER_LOST_CONTACT_EVT:
627 state = SELF_LEAVING_PEER_DOWN;
629 case NODE_SYNCH_END_EVT:
630 state = SELF_UP_PEER_UP;
632 case NODE_FAILOVER_BEGIN_EVT:
633 state = NODE_FAILINGOVER;
635 case NODE_SYNCH_BEGIN_EVT:
636 case SELF_ESTABL_CONTACT_EVT:
637 case PEER_ESTABL_CONTACT_EVT:
639 case NODE_FAILOVER_END_EVT:
645 pr_err("Unknown node fsm state %x\n", state);
652 pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
655 bool tipc_node_filter_skb(struct tipc_node *n, struct tipc_link *l,
656 struct tipc_msg *hdr)
658 int state = n->state;
660 if (likely(state == SELF_UP_PEER_UP))
663 if (state == SELF_DOWN_PEER_DOWN)
666 if (state == SELF_UP_PEER_COMING) {
667 /* If not traffic msg, peer may still be ESTABLISHING */
668 if (tipc_link_is_up(l) && msg_is_traffic(hdr))
669 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
673 if (state == SELF_COMING_PEER_UP)
676 if (state == SELF_LEAVING_PEER_DOWN)
679 if (state == SELF_DOWN_PEER_LEAVING) {
680 if (msg_peer_is_up(hdr))
682 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
688 static void node_established_contact(struct tipc_node *n_ptr)
690 tipc_node_fsm_evt(n_ptr, SELF_ESTABL_CONTACT_EVT);
691 n_ptr->action_flags |= TIPC_NOTIFY_NODE_UP;
692 n_ptr->bclink.oos_state = 0;
693 n_ptr->bclink.acked = tipc_bclink_get_last_sent(n_ptr->net);
694 tipc_bclink_add_node(n_ptr->net, n_ptr->addr);
697 static void node_lost_contact(struct tipc_node *n_ptr)
699 char addr_string[16];
700 struct tipc_sock_conn *conn, *safe;
701 struct list_head *conns = &n_ptr->conn_sks;
703 struct tipc_net *tn = net_generic(n_ptr->net, tipc_net_id);
706 pr_debug("Lost contact with %s\n",
707 tipc_addr_string_fill(addr_string, n_ptr->addr));
709 /* Flush broadcast link info associated with lost node */
710 if (n_ptr->bclink.recv_permitted) {
711 __skb_queue_purge(&n_ptr->bclink.deferdq);
713 if (n_ptr->bclink.reasm_buf) {
714 kfree_skb(n_ptr->bclink.reasm_buf);
715 n_ptr->bclink.reasm_buf = NULL;
718 tipc_bclink_remove_node(n_ptr->net, n_ptr->addr);
719 tipc_bclink_acknowledge(n_ptr, INVALID_LINK_SEQ);
721 n_ptr->bclink.recv_permitted = false;
724 /* Abort any ongoing link failover */
725 for (i = 0; i < MAX_BEARERS; i++) {
726 struct tipc_link *l_ptr = n_ptr->links[i].link;
729 l_ptr->exec_mode = TIPC_LINK_OPEN;
730 l_ptr->failover_checkpt = 0;
731 l_ptr->failover_pkts = 0;
732 kfree_skb(l_ptr->failover_skb);
733 l_ptr->failover_skb = NULL;
734 tipc_link_reset_fragments(l_ptr);
736 /* Prevent re-contact with node until cleanup is done */
737 tipc_node_fsm_evt(n_ptr, SELF_LOST_CONTACT_EVT);
739 /* Notify publications from this node */
740 n_ptr->action_flags |= TIPC_NOTIFY_NODE_DOWN;
742 /* Notify sockets connected to node */
743 list_for_each_entry_safe(conn, safe, conns, list) {
744 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
745 SHORT_H_SIZE, 0, tn->own_addr,
746 conn->peer_node, conn->port,
747 conn->peer_port, TIPC_ERR_NO_NODE);
749 skb_queue_tail(n_ptr->inputq, skb);
750 n_ptr->action_flags |= TIPC_MSG_EVT;
752 list_del(&conn->list);
758 * tipc_node_get_linkname - get the name of a link
760 * @bearer_id: id of the bearer
761 * @node: peer node address
762 * @linkname: link name output buffer
764 * Returns 0 on success
766 int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
767 char *linkname, size_t len)
769 struct tipc_link *link;
771 struct tipc_node *node = tipc_node_find(net, addr);
776 if (bearer_id >= MAX_BEARERS)
779 tipc_node_lock(node);
780 link = node->links[bearer_id].link;
782 strncpy(linkname, link->name, len);
786 tipc_node_unlock(node);
791 void tipc_node_unlock(struct tipc_node *node)
793 struct net *net = node->net;
795 u32 flags = node->action_flags;
797 struct list_head *publ_list;
798 struct sk_buff_head *inputq = node->inputq;
799 struct sk_buff_head *namedq;
801 if (likely(!flags || (flags == TIPC_MSG_EVT))) {
802 node->action_flags = 0;
803 spin_unlock_bh(&node->lock);
804 if (flags == TIPC_MSG_EVT)
805 tipc_sk_rcv(net, inputq);
810 link_id = node->link_id;
811 namedq = node->namedq;
812 publ_list = &node->publ_list;
814 node->action_flags &= ~(TIPC_MSG_EVT |
815 TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP |
816 TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP |
817 TIPC_WAKEUP_BCAST_USERS | TIPC_BCAST_MSG_EVT |
818 TIPC_NAMED_MSG_EVT | TIPC_BCAST_RESET);
820 spin_unlock_bh(&node->lock);
822 if (flags & TIPC_NOTIFY_NODE_DOWN)
823 tipc_publ_notify(net, publ_list, addr);
825 if (flags & TIPC_WAKEUP_BCAST_USERS)
826 tipc_bclink_wakeup_users(net);
828 if (flags & TIPC_NOTIFY_NODE_UP)
829 tipc_named_node_up(net, addr);
831 if (flags & TIPC_NOTIFY_LINK_UP)
832 tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr,
833 TIPC_NODE_SCOPE, link_id, addr);
835 if (flags & TIPC_NOTIFY_LINK_DOWN)
836 tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr,
839 if (flags & TIPC_MSG_EVT)
840 tipc_sk_rcv(net, inputq);
842 if (flags & TIPC_NAMED_MSG_EVT)
843 tipc_named_rcv(net, namedq);
845 if (flags & TIPC_BCAST_MSG_EVT)
846 tipc_bclink_input(net);
848 if (flags & TIPC_BCAST_RESET)
849 tipc_node_reset_links(node);
852 /* Caller should hold node lock for the passed node */
853 static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
856 struct nlattr *attrs;
858 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
859 NLM_F_MULTI, TIPC_NL_NODE_GET);
863 attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE);
867 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
869 if (tipc_node_is_up(node))
870 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
873 nla_nest_end(msg->skb, attrs);
874 genlmsg_end(msg->skb, hdr);
879 nla_nest_cancel(msg->skb, attrs);
881 genlmsg_cancel(msg->skb, hdr);
886 static struct tipc_link *tipc_node_select_link(struct tipc_node *n, int sel,
888 struct tipc_media_addr **maddr)
890 int id = n->active_links[sel & 1];
892 if (unlikely(id < 0))
896 *maddr = &n->links[id].maddr;
897 return n->links[id].link;
901 * tipc_node_xmit() is the general link level function for message sending
902 * @net: the applicable net namespace
903 * @list: chain of buffers containing message
904 * @dnode: address of destination node
905 * @selector: a number used for deterministic link selection
906 * Consumes the buffer chain, except when returning -ELINKCONG
907 * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE
909 int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
910 u32 dnode, int selector)
912 struct tipc_link *l = NULL;
914 struct sk_buff_head xmitq;
915 struct tipc_media_addr *maddr;
917 int rc = -EHOSTUNREACH;
919 __skb_queue_head_init(&xmitq);
920 n = tipc_node_find(net, dnode);
923 l = tipc_node_select_link(n, selector, &bearer_id, &maddr);
925 rc = tipc_link_xmit(l, list, &xmitq);
926 if (unlikely(rc == -ENOBUFS))
927 tipc_node_link_down(n, bearer_id);
932 tipc_bearer_xmit(net, bearer_id, &xmitq, maddr);
935 if (likely(in_own_node(net, dnode))) {
936 tipc_sk_rcv(net, list);
942 /* tipc_node_xmit_skb(): send single buffer to destination
943 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
944 * messages, which will not be rejected
945 * The only exception is datagram messages rerouted after secondary
946 * lookup, which are rare and safe to dispose of anyway.
947 * TODO: Return real return value, and let callers use
948 * tipc_wait_for_sendpkt() where applicable
950 int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
953 struct sk_buff_head head;
956 skb_queue_head_init(&head);
957 __skb_queue_tail(&head, skb);
958 rc = tipc_node_xmit(net, &head, dnode, selector);
959 if (rc == -ELINKCONG)
964 /* tipc_node_tnl_init(): handle a received TUNNEL_PROTOCOL packet,
965 * in order to control parallel link failover or synchronization
967 static void tipc_node_tnl_init(struct tipc_node *n, int bearer_id,
970 struct tipc_link *tnl, *pl;
971 struct tipc_msg *hdr = buf_msg(skb);
972 u16 oseqno = msg_seqno(hdr);
973 int pb_id = msg_bearer_id(hdr);
975 if (pb_id >= MAX_BEARERS)
978 tnl = n->links[bearer_id].link;
982 /* Ignore if duplicate */
983 if (less(oseqno, tnl->rcv_nxt))
986 pl = n->links[pb_id].link;
990 if (msg_type(hdr) == FAILOVER_MSG) {
991 if (tipc_link_is_up(pl)) {
992 tipc_node_link_down(n, pb_id);
993 pl->exec_mode = TIPC_LINK_BLOCKED;
999 * tipc_rcv - process TIPC packets/messages arriving from off-node
1000 * @net: the applicable net namespace
1002 * @bearer: pointer to bearer message arrived on
1004 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1005 * structure (i.e. cannot be NULL), but bearer can be inactive.
1007 void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
1009 struct sk_buff_head xmitq;
1010 struct tipc_node *n;
1011 struct tipc_link *l;
1012 struct tipc_msg *hdr;
1013 struct tipc_media_addr *maddr;
1014 int bearer_id = b->identity;
1018 __skb_queue_head_init(&xmitq);
1020 /* Ensure message is well-formed */
1021 if (unlikely(!tipc_msg_validate(skb)))
1024 /* Handle arrival of a non-unicast link packet */
1026 usr = msg_user(hdr);
1027 if (unlikely(msg_non_seq(hdr))) {
1028 if (usr == LINK_CONFIG)
1029 tipc_disc_rcv(net, skb, b);
1031 tipc_bclink_rcv(net, skb);
1035 /* Locate neighboring node that sent packet */
1036 n = tipc_node_find(net, msg_prevnode(hdr));
1041 /* Prepare links for tunneled reception if applicable */
1042 if (unlikely(usr == TUNNEL_PROTOCOL))
1043 tipc_node_tnl_init(n, bearer_id, skb);
1045 /* Locate link endpoint that should handle packet */
1046 l = n->links[bearer_id].link;
1050 /* Is reception of this packet permitted at the moment ? */
1051 if (unlikely(n->state != SELF_UP_PEER_UP))
1052 if (!tipc_node_filter_skb(n, l, hdr))
1055 if (unlikely(usr == LINK_PROTOCOL))
1056 tipc_bclink_sync_state(n, hdr);
1058 /* Release acked broadcast messages */
1059 if (unlikely(n->bclink.acked != msg_bcast_ack(hdr)))
1060 tipc_bclink_acknowledge(n, msg_bcast_ack(hdr));
1062 /* Check protocol and update link state */
1063 rc = tipc_link_rcv(l, skb, &xmitq);
1065 if (unlikely(rc & TIPC_LINK_UP_EVT))
1066 tipc_node_link_up(n, bearer_id);
1067 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
1068 tipc_node_link_down(n, bearer_id);
1071 tipc_node_unlock(n);
1072 tipc_sk_rcv(net, &n->links[bearer_id].inputq);
1073 maddr = &n->links[bearer_id].maddr;
1074 tipc_bearer_xmit(net, bearer_id, &xmitq, maddr);
1080 int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
1083 struct net *net = sock_net(skb->sk);
1084 struct tipc_net *tn = net_generic(net, tipc_net_id);
1085 int done = cb->args[0];
1086 int last_addr = cb->args[1];
1087 struct tipc_node *node;
1088 struct tipc_nl_msg msg;
1094 msg.portid = NETLINK_CB(cb->skb).portid;
1095 msg.seq = cb->nlh->nlmsg_seq;
1099 node = tipc_node_find(net, last_addr);
1102 /* We never set seq or call nl_dump_check_consistent()
1103 * this means that setting prev_seq here will cause the
1104 * consistence check to fail in the netlink callback
1105 * handler. Resulting in the NLMSG_DONE message having
1106 * the NLM_F_DUMP_INTR flag set if the node state
1107 * changed while we released the lock.
1112 tipc_node_put(node);
1115 list_for_each_entry_rcu(node, &tn->node_list, list) {
1117 if (node->addr == last_addr)
1123 tipc_node_lock(node);
1124 err = __tipc_nl_add_node(&msg, node);
1126 last_addr = node->addr;
1127 tipc_node_unlock(node);
1131 tipc_node_unlock(node);
1136 cb->args[1] = last_addr;