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 /* Node FSM states and events:
48 SELF_DOWN_PEER_DOWN = 0xdd,
49 SELF_UP_PEER_UP = 0xaa,
50 SELF_DOWN_PEER_LEAVING = 0xd1,
51 SELF_UP_PEER_COMING = 0xac,
52 SELF_COMING_PEER_UP = 0xca,
53 SELF_LEAVING_PEER_DOWN = 0x1d,
54 NODE_FAILINGOVER = 0xf0,
59 SELF_ESTABL_CONTACT_EVT = 0xece,
60 SELF_LOST_CONTACT_EVT = 0x1ce,
61 PEER_ESTABL_CONTACT_EVT = 0x9ece,
62 PEER_LOST_CONTACT_EVT = 0x91ce,
63 NODE_FAILOVER_BEGIN_EVT = 0xfbe,
64 NODE_FAILOVER_END_EVT = 0xfee,
65 NODE_SYNCH_BEGIN_EVT = 0xcbe,
66 NODE_SYNCH_END_EVT = 0xcee
69 static void tipc_node_link_down(struct tipc_node *n, int bearer_id);
70 static void node_lost_contact(struct tipc_node *n_ptr);
71 static void node_established_contact(struct tipc_node *n_ptr);
72 static void tipc_node_delete(struct tipc_node *node);
73 static void tipc_node_timeout(unsigned long data);
74 static void tipc_node_fsm_evt(struct tipc_node *n, int evt);
76 struct tipc_sock_conn {
80 struct list_head list;
83 static const struct nla_policy tipc_nl_node_policy[TIPC_NLA_NODE_MAX + 1] = {
84 [TIPC_NLA_NODE_UNSPEC] = { .type = NLA_UNSPEC },
85 [TIPC_NLA_NODE_ADDR] = { .type = NLA_U32 },
86 [TIPC_NLA_NODE_UP] = { .type = NLA_FLAG }
90 * A trivial power-of-two bitmask technique is used for speed, since this
91 * operation is done for every incoming TIPC packet. The number of hash table
92 * entries has been chosen so that no hash chain exceeds 8 nodes and will
93 * usually be much smaller (typically only a single node).
95 static unsigned int tipc_hashfn(u32 addr)
97 return addr & (NODE_HTABLE_SIZE - 1);
100 static void tipc_node_kref_release(struct kref *kref)
102 struct tipc_node *node = container_of(kref, struct tipc_node, kref);
104 tipc_node_delete(node);
107 void tipc_node_put(struct tipc_node *node)
109 kref_put(&node->kref, tipc_node_kref_release);
112 static void tipc_node_get(struct tipc_node *node)
114 kref_get(&node->kref);
118 * tipc_node_find - locate specified node object, if it exists
120 struct tipc_node *tipc_node_find(struct net *net, u32 addr)
122 struct tipc_net *tn = net_generic(net, tipc_net_id);
123 struct tipc_node *node;
125 if (unlikely(!in_own_cluster_exact(net, addr)))
129 hlist_for_each_entry_rcu(node, &tn->node_htable[tipc_hashfn(addr)],
131 if (node->addr == addr) {
141 struct tipc_node *tipc_node_create(struct net *net, u32 addr)
143 struct tipc_net *tn = net_generic(net, tipc_net_id);
144 struct tipc_node *n_ptr, *temp_node;
146 spin_lock_bh(&tn->node_list_lock);
147 n_ptr = tipc_node_find(net, addr);
150 n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC);
152 pr_warn("Node creation failed, no memory\n");
157 kref_init(&n_ptr->kref);
158 spin_lock_init(&n_ptr->lock);
159 INIT_HLIST_NODE(&n_ptr->hash);
160 INIT_LIST_HEAD(&n_ptr->list);
161 INIT_LIST_HEAD(&n_ptr->publ_list);
162 INIT_LIST_HEAD(&n_ptr->conn_sks);
163 skb_queue_head_init(&n_ptr->bclink.namedq);
164 __skb_queue_head_init(&n_ptr->bclink.deferdq);
165 hlist_add_head_rcu(&n_ptr->hash, &tn->node_htable[tipc_hashfn(addr)]);
166 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
167 if (n_ptr->addr < temp_node->addr)
170 list_add_tail_rcu(&n_ptr->list, &temp_node->list);
171 n_ptr->state = SELF_DOWN_PEER_LEAVING;
172 n_ptr->signature = INVALID_NODE_SIG;
173 n_ptr->active_links[0] = INVALID_BEARER_ID;
174 n_ptr->active_links[1] = INVALID_BEARER_ID;
175 tipc_node_get(n_ptr);
176 setup_timer(&n_ptr->timer, tipc_node_timeout, (unsigned long)n_ptr);
177 n_ptr->keepalive_intv = U32_MAX;
179 spin_unlock_bh(&tn->node_list_lock);
183 static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l)
185 unsigned long tol = l->tolerance;
186 unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4;
187 unsigned long keepalive_intv = msecs_to_jiffies(intv);
189 /* Link with lowest tolerance determines timer interval */
190 if (keepalive_intv < n->keepalive_intv)
191 n->keepalive_intv = keepalive_intv;
193 /* Ensure link's abort limit corresponds to current interval */
194 l->abort_limit = l->tolerance / jiffies_to_msecs(n->keepalive_intv);
197 static void tipc_node_delete(struct tipc_node *node)
199 list_del_rcu(&node->list);
200 hlist_del_rcu(&node->hash);
201 kfree_rcu(node, rcu);
204 void tipc_node_stop(struct net *net)
206 struct tipc_net *tn = net_generic(net, tipc_net_id);
207 struct tipc_node *node, *t_node;
209 spin_lock_bh(&tn->node_list_lock);
210 list_for_each_entry_safe(node, t_node, &tn->node_list, list) {
211 if (del_timer(&node->timer))
215 spin_unlock_bh(&tn->node_list_lock);
218 int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port)
220 struct tipc_node *node;
221 struct tipc_sock_conn *conn;
224 if (in_own_node(net, dnode))
227 node = tipc_node_find(net, dnode);
229 pr_warn("Connecting sock to node 0x%x failed\n", dnode);
230 return -EHOSTUNREACH;
232 conn = kmalloc(sizeof(*conn), GFP_ATOMIC);
237 conn->peer_node = dnode;
239 conn->peer_port = peer_port;
241 tipc_node_lock(node);
242 list_add_tail(&conn->list, &node->conn_sks);
243 tipc_node_unlock(node);
249 void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port)
251 struct tipc_node *node;
252 struct tipc_sock_conn *conn, *safe;
254 if (in_own_node(net, dnode))
257 node = tipc_node_find(net, dnode);
261 tipc_node_lock(node);
262 list_for_each_entry_safe(conn, safe, &node->conn_sks, list) {
263 if (port != conn->port)
265 list_del(&conn->list);
268 tipc_node_unlock(node);
272 /* tipc_node_timeout - handle expiration of node timer
274 static void tipc_node_timeout(unsigned long data)
276 struct tipc_node *n = (struct tipc_node *)data;
277 struct sk_buff_head xmitq;
279 struct tipc_media_addr *maddr;
283 __skb_queue_head_init(&xmitq);
285 for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) {
287 l = n->links[bearer_id].link;
289 /* Link tolerance may change asynchronously: */
290 tipc_node_calculate_timer(n, l);
291 rc = tipc_link_timeout(l, &xmitq);
292 if (rc & TIPC_LINK_DOWN_EVT)
293 tipc_node_link_down(n, bearer_id);
296 maddr = &n->links[bearer_id].maddr;
297 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr);
299 if (!mod_timer(&n->timer, jiffies + n->keepalive_intv))
305 * tipc_node_link_up - handle addition of link
307 * Link becomes active (alone or shared) or standby, depending on its priority.
309 static void tipc_node_link_up(struct tipc_node *n, int bearer_id,
310 struct sk_buff_head *xmitq)
312 int *slot0 = &n->active_links[0];
313 int *slot1 = &n->active_links[1];
314 struct tipc_link *ol = node_active_link(n, 0);
315 struct tipc_link *nl = n->links[bearer_id].link;
317 if (n->working_links > 1) {
318 pr_warn("Attempt to establish 3rd link to %x\n", n->addr);
322 n->action_flags |= TIPC_NOTIFY_LINK_UP;
323 n->link_id = nl->peer_bearer_id << 16 | bearer_id;
325 /* Leave room for tunnel header when returning 'mtu' to users: */
326 n->links[bearer_id].mtu = nl->mtu - INT_H_SIZE;
328 tipc_bearer_add_dest(n->net, bearer_id, n->addr);
330 pr_debug("Established link <%s> on network plane %c\n",
331 nl->name, nl->net_plane);
333 /* First link? => give it both slots */
337 nl->exec_mode = TIPC_LINK_OPEN;
338 tipc_link_build_bcast_sync_msg(nl, xmitq);
339 node_established_contact(n);
343 /* Second link => redistribute slots */
344 if (nl->priority > ol->priority) {
345 pr_debug("Old link <%s> becomes standby\n", ol->name);
348 } else if (nl->priority == ol->priority) {
351 pr_debug("New link <%s> is standby\n", nl->name);
354 /* Prepare synchronization with first link */
355 tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq);
359 * tipc_node_link_down - handle loss of link
361 static void tipc_node_link_down(struct tipc_node *n, int bearer_id)
363 int *slot0 = &n->active_links[0];
364 int *slot1 = &n->active_links[1];
365 struct tipc_media_addr *maddr = &n->links[bearer_id].maddr;
367 struct tipc_link *l, *_l, *tnl;
368 struct sk_buff_head xmitq;
370 l = n->links[bearer_id].link;
371 if (!l || !tipc_link_is_up(l))
374 __skb_queue_head_init(&xmitq);
377 n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
378 n->link_id = l->peer_bearer_id << 16 | bearer_id;
380 tipc_bearer_remove_dest(n->net, l->bearer_id, n->addr);
382 pr_debug("Lost link <%s> on network plane %c\n",
383 l->name, l->net_plane);
385 /* Select new active link if any available */
386 *slot0 = INVALID_BEARER_ID;
387 *slot1 = INVALID_BEARER_ID;
388 for (i = 0; i < MAX_BEARERS; i++) {
389 _l = n->links[i].link;
390 if (!_l || !tipc_link_is_up(_l))
394 if (_l->priority < highest)
396 if (_l->priority > highest) {
397 highest = _l->priority;
405 if (!tipc_node_is_up(n)) {
407 node_lost_contact(n);
411 /* There is still a working link => initiate failover */
412 tnl = node_active_link(n, 0);
413 tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
414 n->sync_point = tnl->rcv_nxt + (U16_MAX / 2 - 1);
415 tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, &xmitq);
417 tipc_bearer_xmit(n->net, tnl->bearer_id, &xmitq, maddr);
420 bool tipc_node_is_up(struct tipc_node *n)
422 return n->active_links[0] != INVALID_BEARER_ID;
425 void tipc_node_check_dest(struct tipc_node *n, struct tipc_bearer *b,
426 bool *link_up, bool *addr_match,
427 struct tipc_media_addr *maddr)
429 struct tipc_link *l = n->links[b->identity].link;
430 struct tipc_media_addr *curr = &n->links[b->identity].maddr;
432 *link_up = l && tipc_link_is_up(l);
433 *addr_match = l && !memcmp(curr, maddr, sizeof(*maddr));
436 bool tipc_node_update_dest(struct tipc_node *n, struct tipc_bearer *b,
437 struct tipc_media_addr *maddr)
439 struct tipc_link *l = n->links[b->identity].link;
440 struct tipc_media_addr *curr = &n->links[b->identity].maddr;
441 struct sk_buff_head *inputq = &n->links[b->identity].inputq;
444 l = tipc_link_create(n, b, maddr, inputq, &n->bclink.namedq);
447 tipc_node_calculate_timer(n, l);
448 if (n->link_cnt == 1) {
449 if (!mod_timer(&n->timer, jiffies + n->keepalive_intv))
453 memcpy(&l->media_addr, maddr, sizeof(*maddr));
454 memcpy(curr, maddr, sizeof(*maddr));
455 tipc_node_link_down(n, b->identity);
459 void tipc_node_delete_links(struct net *net, int bearer_id)
461 struct tipc_net *tn = net_generic(net, tipc_net_id);
466 list_for_each_entry_rcu(n, &tn->node_list, list) {
468 l = n->links[bearer_id].link;
470 tipc_node_link_down(n, bearer_id);
471 n->links[bearer_id].link = NULL;
480 static void tipc_node_reset_links(struct tipc_node *n)
482 char addr_string[16];
487 pr_warn("Resetting all links to %s\n",
488 tipc_addr_string_fill(addr_string, n->addr));
490 for (i = 0; i < MAX_BEARERS; i++) {
491 if (!n->links[i].link)
493 tipc_node_link_down(n, i);
498 void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
500 n_ptr->links[l_ptr->bearer_id].link = l_ptr;
504 void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
508 for (i = 0; i < MAX_BEARERS; i++) {
509 if (l_ptr != n_ptr->links[i].link)
511 n_ptr->links[i].link = NULL;
516 /* tipc_node_fsm_evt - node finite state machine
517 * Determines when contact is allowed with peer node
519 static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
521 int state = n->state;
524 case SELF_DOWN_PEER_DOWN:
526 case SELF_ESTABL_CONTACT_EVT:
527 state = SELF_UP_PEER_COMING;
529 case PEER_ESTABL_CONTACT_EVT:
530 state = SELF_COMING_PEER_UP;
532 case SELF_LOST_CONTACT_EVT:
533 case PEER_LOST_CONTACT_EVT:
535 case NODE_SYNCH_END_EVT:
536 case NODE_SYNCH_BEGIN_EVT:
537 case NODE_FAILOVER_BEGIN_EVT:
538 case NODE_FAILOVER_END_EVT:
543 case SELF_UP_PEER_UP:
545 case SELF_LOST_CONTACT_EVT:
546 state = SELF_DOWN_PEER_LEAVING;
548 case PEER_LOST_CONTACT_EVT:
549 state = SELF_LEAVING_PEER_DOWN;
551 case NODE_SYNCH_BEGIN_EVT:
552 state = NODE_SYNCHING;
554 case NODE_FAILOVER_BEGIN_EVT:
555 state = NODE_FAILINGOVER;
557 case SELF_ESTABL_CONTACT_EVT:
558 case PEER_ESTABL_CONTACT_EVT:
559 case NODE_SYNCH_END_EVT:
560 case NODE_FAILOVER_END_EVT:
566 case SELF_DOWN_PEER_LEAVING:
568 case PEER_LOST_CONTACT_EVT:
569 state = SELF_DOWN_PEER_DOWN;
571 case SELF_ESTABL_CONTACT_EVT:
572 case PEER_ESTABL_CONTACT_EVT:
573 case SELF_LOST_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_UP_PEER_COMING:
585 case PEER_ESTABL_CONTACT_EVT:
586 state = SELF_UP_PEER_UP;
588 case SELF_LOST_CONTACT_EVT:
589 state = SELF_DOWN_PEER_LEAVING;
591 case SELF_ESTABL_CONTACT_EVT:
592 case PEER_LOST_CONTACT_EVT:
594 case NODE_SYNCH_END_EVT:
595 case NODE_SYNCH_BEGIN_EVT:
596 case NODE_FAILOVER_BEGIN_EVT:
597 case NODE_FAILOVER_END_EVT:
602 case SELF_COMING_PEER_UP:
604 case SELF_ESTABL_CONTACT_EVT:
605 state = SELF_UP_PEER_UP;
607 case PEER_LOST_CONTACT_EVT:
608 state = SELF_LEAVING_PEER_DOWN;
610 case SELF_LOST_CONTACT_EVT:
611 case PEER_ESTABL_CONTACT_EVT:
613 case NODE_SYNCH_END_EVT:
614 case NODE_SYNCH_BEGIN_EVT:
615 case NODE_FAILOVER_BEGIN_EVT:
616 case NODE_FAILOVER_END_EVT:
621 case SELF_LEAVING_PEER_DOWN:
623 case SELF_LOST_CONTACT_EVT:
624 state = SELF_DOWN_PEER_DOWN;
626 case SELF_ESTABL_CONTACT_EVT:
627 case PEER_ESTABL_CONTACT_EVT:
628 case PEER_LOST_CONTACT_EVT:
630 case NODE_SYNCH_END_EVT:
631 case NODE_SYNCH_BEGIN_EVT:
632 case NODE_FAILOVER_BEGIN_EVT:
633 case NODE_FAILOVER_END_EVT:
638 case NODE_FAILINGOVER:
640 case SELF_LOST_CONTACT_EVT:
641 state = SELF_DOWN_PEER_LEAVING;
643 case PEER_LOST_CONTACT_EVT:
644 state = SELF_LEAVING_PEER_DOWN;
646 case NODE_FAILOVER_END_EVT:
647 state = SELF_UP_PEER_UP;
649 case NODE_FAILOVER_BEGIN_EVT:
650 case SELF_ESTABL_CONTACT_EVT:
651 case PEER_ESTABL_CONTACT_EVT:
653 case NODE_SYNCH_BEGIN_EVT:
654 case NODE_SYNCH_END_EVT:
661 case SELF_LOST_CONTACT_EVT:
662 state = SELF_DOWN_PEER_LEAVING;
664 case PEER_LOST_CONTACT_EVT:
665 state = SELF_LEAVING_PEER_DOWN;
667 case NODE_SYNCH_END_EVT:
668 state = SELF_UP_PEER_UP;
670 case NODE_FAILOVER_BEGIN_EVT:
671 state = NODE_FAILINGOVER;
673 case NODE_SYNCH_BEGIN_EVT:
674 case SELF_ESTABL_CONTACT_EVT:
675 case PEER_ESTABL_CONTACT_EVT:
677 case NODE_FAILOVER_END_EVT:
683 pr_err("Unknown node fsm state %x\n", state);
690 pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
693 bool tipc_node_filter_pkt(struct tipc_node *n, struct tipc_msg *hdr)
695 int state = n->state;
697 if (likely(state == SELF_UP_PEER_UP))
700 if (state == SELF_LEAVING_PEER_DOWN)
703 if (state == SELF_DOWN_PEER_LEAVING) {
704 if (msg_peer_node_is_up(hdr))
711 static void node_established_contact(struct tipc_node *n_ptr)
713 tipc_node_fsm_evt(n_ptr, SELF_ESTABL_CONTACT_EVT);
714 n_ptr->action_flags |= TIPC_NOTIFY_NODE_UP;
715 n_ptr->bclink.oos_state = 0;
716 n_ptr->bclink.acked = tipc_bclink_get_last_sent(n_ptr->net);
717 tipc_bclink_add_node(n_ptr->net, n_ptr->addr);
720 static void node_lost_contact(struct tipc_node *n_ptr)
722 char addr_string[16];
723 struct tipc_sock_conn *conn, *safe;
724 struct list_head *conns = &n_ptr->conn_sks;
726 struct tipc_net *tn = net_generic(n_ptr->net, tipc_net_id);
729 pr_debug("Lost contact with %s\n",
730 tipc_addr_string_fill(addr_string, n_ptr->addr));
732 /* Flush broadcast link info associated with lost node */
733 if (n_ptr->bclink.recv_permitted) {
734 __skb_queue_purge(&n_ptr->bclink.deferdq);
736 if (n_ptr->bclink.reasm_buf) {
737 kfree_skb(n_ptr->bclink.reasm_buf);
738 n_ptr->bclink.reasm_buf = NULL;
741 tipc_bclink_remove_node(n_ptr->net, n_ptr->addr);
742 tipc_bclink_acknowledge(n_ptr, INVALID_LINK_SEQ);
744 n_ptr->bclink.recv_permitted = false;
747 /* Abort any ongoing link failover */
748 for (i = 0; i < MAX_BEARERS; i++) {
749 struct tipc_link *l_ptr = n_ptr->links[i].link;
752 l_ptr->exec_mode = TIPC_LINK_OPEN;
753 kfree_skb(l_ptr->failover_reasm_skb);
754 l_ptr->failover_reasm_skb = NULL;
755 tipc_link_reset_fragments(l_ptr);
757 /* Prevent re-contact with node until cleanup is done */
758 tipc_node_fsm_evt(n_ptr, SELF_LOST_CONTACT_EVT);
760 /* Notify publications from this node */
761 n_ptr->action_flags |= TIPC_NOTIFY_NODE_DOWN;
763 /* Notify sockets connected to node */
764 list_for_each_entry_safe(conn, safe, conns, list) {
765 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
766 SHORT_H_SIZE, 0, tn->own_addr,
767 conn->peer_node, conn->port,
768 conn->peer_port, TIPC_ERR_NO_NODE);
770 skb_queue_tail(n_ptr->inputq, skb);
771 n_ptr->action_flags |= TIPC_MSG_EVT;
773 list_del(&conn->list);
779 * tipc_node_get_linkname - get the name of a link
781 * @bearer_id: id of the bearer
782 * @node: peer node address
783 * @linkname: link name output buffer
785 * Returns 0 on success
787 int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
788 char *linkname, size_t len)
790 struct tipc_link *link;
792 struct tipc_node *node = tipc_node_find(net, addr);
797 if (bearer_id >= MAX_BEARERS)
800 tipc_node_lock(node);
801 link = node->links[bearer_id].link;
803 strncpy(linkname, link->name, len);
807 tipc_node_unlock(node);
812 void tipc_node_unlock(struct tipc_node *node)
814 struct net *net = node->net;
816 u32 flags = node->action_flags;
818 struct list_head *publ_list;
819 struct sk_buff_head *inputq = node->inputq;
820 struct sk_buff_head *namedq;
822 if (likely(!flags || (flags == TIPC_MSG_EVT))) {
823 node->action_flags = 0;
824 spin_unlock_bh(&node->lock);
825 if (flags == TIPC_MSG_EVT)
826 tipc_sk_rcv(net, inputq);
831 link_id = node->link_id;
832 namedq = node->namedq;
833 publ_list = &node->publ_list;
835 node->action_flags &= ~(TIPC_MSG_EVT |
836 TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP |
837 TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP |
838 TIPC_WAKEUP_BCAST_USERS | TIPC_BCAST_MSG_EVT |
839 TIPC_NAMED_MSG_EVT | TIPC_BCAST_RESET);
841 spin_unlock_bh(&node->lock);
843 if (flags & TIPC_NOTIFY_NODE_DOWN)
844 tipc_publ_notify(net, publ_list, addr);
846 if (flags & TIPC_WAKEUP_BCAST_USERS)
847 tipc_bclink_wakeup_users(net);
849 if (flags & TIPC_NOTIFY_NODE_UP)
850 tipc_named_node_up(net, addr);
852 if (flags & TIPC_NOTIFY_LINK_UP)
853 tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr,
854 TIPC_NODE_SCOPE, link_id, addr);
856 if (flags & TIPC_NOTIFY_LINK_DOWN)
857 tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr,
860 if (flags & TIPC_MSG_EVT)
861 tipc_sk_rcv(net, inputq);
863 if (flags & TIPC_NAMED_MSG_EVT)
864 tipc_named_rcv(net, namedq);
866 if (flags & TIPC_BCAST_MSG_EVT)
867 tipc_bclink_input(net);
869 if (flags & TIPC_BCAST_RESET)
870 tipc_node_reset_links(node);
873 /* Caller should hold node lock for the passed node */
874 static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
877 struct nlattr *attrs;
879 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
880 NLM_F_MULTI, TIPC_NL_NODE_GET);
884 attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE);
888 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
890 if (tipc_node_is_up(node))
891 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
894 nla_nest_end(msg->skb, attrs);
895 genlmsg_end(msg->skb, hdr);
900 nla_nest_cancel(msg->skb, attrs);
902 genlmsg_cancel(msg->skb, hdr);
907 static struct tipc_link *tipc_node_select_link(struct tipc_node *n, int sel,
909 struct tipc_media_addr **maddr)
911 int id = n->active_links[sel & 1];
913 if (unlikely(id < 0))
917 *maddr = &n->links[id].maddr;
918 return n->links[id].link;
922 * tipc_node_xmit() is the general link level function for message sending
923 * @net: the applicable net namespace
924 * @list: chain of buffers containing message
925 * @dnode: address of destination node
926 * @selector: a number used for deterministic link selection
927 * Consumes the buffer chain, except when returning -ELINKCONG
928 * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE
930 int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
931 u32 dnode, int selector)
933 struct tipc_link *l = NULL;
935 struct sk_buff_head xmitq;
936 struct tipc_media_addr *maddr;
938 int rc = -EHOSTUNREACH;
940 __skb_queue_head_init(&xmitq);
941 n = tipc_node_find(net, dnode);
944 l = tipc_node_select_link(n, selector, &bearer_id, &maddr);
946 rc = tipc_link_xmit(l, list, &xmitq);
947 if (unlikely(rc == -ENOBUFS))
948 tipc_node_link_down(n, bearer_id);
953 tipc_bearer_xmit(net, bearer_id, &xmitq, maddr);
956 if (likely(in_own_node(net, dnode))) {
957 tipc_sk_rcv(net, list);
963 /* tipc_node_xmit_skb(): send single buffer to destination
964 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
965 * messages, which will not be rejected
966 * The only exception is datagram messages rerouted after secondary
967 * lookup, which are rare and safe to dispose of anyway.
968 * TODO: Return real return value, and let callers use
969 * tipc_wait_for_sendpkt() where applicable
971 int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
974 struct sk_buff_head head;
977 skb_queue_head_init(&head);
978 __skb_queue_tail(&head, skb);
979 rc = tipc_node_xmit(net, &head, dnode, selector);
980 if (rc == -ELINKCONG)
986 * tipc_node_check_state - check and if necessary update node state
988 * @bearer_id: identity of bearer delivering the packet
989 * Returns true if state is ok, otherwise consumes buffer and returns false
991 static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb,
994 struct tipc_msg *hdr = buf_msg(skb);
995 int usr = msg_user(hdr);
996 int mtyp = msg_type(hdr);
997 u16 oseqno = msg_seqno(hdr);
998 u16 iseqno = msg_seqno(msg_get_wrapped(hdr));
999 u16 exp_pkts = msg_msgcnt(hdr);
1000 u16 rcv_nxt, syncpt, dlv_nxt;
1001 int state = n->state;
1002 struct tipc_link *l, *pl = NULL;
1003 struct sk_buff_head;
1006 l = n->links[bearer_id].link;
1009 rcv_nxt = l->rcv_nxt;
1012 if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL)))
1015 /* Find parallel link, if any */
1016 for (i = 0; i < MAX_BEARERS; i++) {
1017 if ((i != bearer_id) && n->links[i].link) {
1018 pl = n->links[i].link;
1023 /* Update node accesibility if applicable */
1024 if (state == SELF_UP_PEER_COMING) {
1025 if (!tipc_link_is_up(l))
1027 if (!msg_peer_link_is_up(hdr))
1029 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
1032 if (state == SELF_DOWN_PEER_LEAVING) {
1033 if (msg_peer_node_is_up(hdr))
1035 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
1038 /* Ignore duplicate packets */
1039 if (less(oseqno, rcv_nxt))
1042 /* Initiate or update failover mode if applicable */
1043 if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) {
1044 syncpt = oseqno + exp_pkts - 1;
1045 if (pl && tipc_link_is_up(pl)) {
1046 tipc_node_link_down(n, pl->bearer_id);
1047 pl->exec_mode = TIPC_LINK_BLOCKED;
1049 /* If pkts arrive out of order, use lowest calculated syncpt */
1050 if (less(syncpt, n->sync_point))
1051 n->sync_point = syncpt;
1054 /* Open parallel link when tunnel link reaches synch point */
1055 if ((n->state == NODE_FAILINGOVER) && (more(rcv_nxt, n->sync_point))) {
1056 tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT);
1058 pl->exec_mode = TIPC_LINK_OPEN;
1062 /* Initiate or update synch mode if applicable */
1063 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG)) {
1064 syncpt = iseqno + exp_pkts - 1;
1065 if (n->state == SELF_UP_PEER_UP) {
1066 n->sync_point = syncpt;
1067 tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT);
1069 l->exec_mode = TIPC_LINK_TUNNEL;
1070 if (less(syncpt, n->sync_point))
1071 n->sync_point = syncpt;
1074 /* Open tunnel link when parallel link reaches synch point */
1075 if ((n->state == NODE_SYNCHING) && (l->exec_mode == TIPC_LINK_TUNNEL)) {
1077 dlv_nxt = mod(pl->rcv_nxt - skb_queue_len(pl->inputq));
1078 if (!pl || more(dlv_nxt, n->sync_point)) {
1079 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
1080 l->exec_mode = TIPC_LINK_OPEN;
1083 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG))
1085 if (usr == LINK_PROTOCOL)
1093 * tipc_rcv - process TIPC packets/messages arriving from off-node
1094 * @net: the applicable net namespace
1096 * @bearer: pointer to bearer message arrived on
1098 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1099 * structure (i.e. cannot be NULL), but bearer can be inactive.
1101 void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
1103 struct sk_buff_head xmitq;
1104 struct tipc_node *n;
1105 struct tipc_msg *hdr = buf_msg(skb);
1106 int usr = msg_user(hdr);
1107 int bearer_id = b->identity;
1108 struct tipc_link_entry *le;
1111 __skb_queue_head_init(&xmitq);
1113 /* Ensure message is well-formed */
1114 if (unlikely(!tipc_msg_validate(skb)))
1117 /* Handle arrival of a non-unicast link packet */
1118 if (unlikely(msg_non_seq(hdr))) {
1119 if (usr == LINK_CONFIG)
1120 tipc_disc_rcv(net, skb, b);
1122 tipc_bclink_rcv(net, skb);
1126 /* Locate neighboring node that sent packet */
1127 n = tipc_node_find(net, msg_prevnode(hdr));
1130 le = &n->links[bearer_id];
1134 /* Is reception permitted at the moment ? */
1135 if (!tipc_node_filter_pkt(n, hdr))
1138 if (unlikely(msg_user(hdr) == LINK_PROTOCOL))
1139 tipc_bclink_sync_state(n, hdr);
1141 /* Release acked broadcast messages */
1142 if (unlikely(n->bclink.acked != msg_bcast_ack(hdr)))
1143 tipc_bclink_acknowledge(n, msg_bcast_ack(hdr));
1145 /* Check and if necessary update node state */
1146 if (likely(tipc_node_check_state(n, skb, bearer_id))) {
1147 rc = tipc_link_rcv(le->link, skb, &xmitq);
1151 if (unlikely(rc & TIPC_LINK_UP_EVT))
1152 tipc_node_link_up(n, bearer_id, &xmitq);
1154 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
1155 tipc_node_link_down(n, bearer_id);
1157 tipc_node_unlock(n);
1159 if (!skb_queue_empty(&le->inputq))
1160 tipc_sk_rcv(net, &le->inputq);
1162 if (!skb_queue_empty(&xmitq))
1163 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1170 int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
1173 struct net *net = sock_net(skb->sk);
1174 struct tipc_net *tn = net_generic(net, tipc_net_id);
1175 int done = cb->args[0];
1176 int last_addr = cb->args[1];
1177 struct tipc_node *node;
1178 struct tipc_nl_msg msg;
1184 msg.portid = NETLINK_CB(cb->skb).portid;
1185 msg.seq = cb->nlh->nlmsg_seq;
1189 node = tipc_node_find(net, last_addr);
1192 /* We never set seq or call nl_dump_check_consistent()
1193 * this means that setting prev_seq here will cause the
1194 * consistence check to fail in the netlink callback
1195 * handler. Resulting in the NLMSG_DONE message having
1196 * the NLM_F_DUMP_INTR flag set if the node state
1197 * changed while we released the lock.
1202 tipc_node_put(node);
1205 list_for_each_entry_rcu(node, &tn->node_list, list) {
1207 if (node->addr == last_addr)
1213 tipc_node_lock(node);
1214 err = __tipc_nl_add_node(&msg, node);
1216 last_addr = node->addr;
1217 tipc_node_unlock(node);
1221 tipc_node_unlock(node);
1226 cb->args[1] = last_addr;