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)
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;
342 n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
343 n->link_id = l->peer_bearer_id << 16 | l->bearer_id;
345 pr_debug("Lost link <%s> on network plane %c\n",
346 l->name, l->net_plane);
348 /* Select new active link if any available */
349 *slot0 = INVALID_BEARER_ID;
350 *slot1 = INVALID_BEARER_ID;
351 for (i = 0; i < MAX_BEARERS; i++) {
352 _l = n->links[i].link;
353 if (!_l || !tipc_link_is_up(_l))
355 if (_l->priority < highest)
357 if (_l->priority > highest) {
358 highest = _l->priority;
365 if (tipc_node_is_up(n))
366 tipc_link_failover_send_queue(l);
368 node_lost_contact(n);
371 bool tipc_node_is_up(struct tipc_node *n)
373 return n->active_links[0] != INVALID_BEARER_ID;
376 void tipc_node_check_dest(struct tipc_node *n, struct tipc_bearer *b,
377 bool *link_up, bool *addr_match,
378 struct tipc_media_addr *maddr)
380 struct tipc_link *l = n->links[b->identity].link;
381 struct tipc_media_addr *curr = &n->links[b->identity].maddr;
383 *link_up = l && tipc_link_is_up(l);
384 *addr_match = l && !memcmp(curr, maddr, sizeof(*maddr));
387 bool tipc_node_update_dest(struct tipc_node *n, struct tipc_bearer *b,
388 struct tipc_media_addr *maddr)
390 struct tipc_link *l = n->links[b->identity].link;
391 struct tipc_media_addr *curr = &n->links[b->identity].maddr;
392 struct sk_buff_head *inputq = &n->links[b->identity].inputq;
395 l = tipc_link_create(n, b, maddr, inputq, &n->bclink.namedq);
398 tipc_node_calculate_timer(n, l);
399 if (n->link_cnt == 1) {
400 if (!mod_timer(&n->timer, jiffies + n->keepalive_intv))
404 memcpy(&l->media_addr, maddr, sizeof(*maddr));
405 memcpy(curr, maddr, sizeof(*maddr));
410 void tipc_node_delete_links(struct net *net, int bearer_id)
412 struct tipc_net *tn = net_generic(net, tipc_net_id);
417 list_for_each_entry_rcu(n, &tn->node_list, list) {
419 l = n->links[bearer_id].link;
422 n->links[bearer_id].link = NULL;
431 static void tipc_node_reset_links(struct tipc_node *n)
433 char addr_string[16];
438 pr_warn("Resetting all links to %s\n",
439 tipc_addr_string_fill(addr_string, n->addr));
441 for (i = 0; i < MAX_BEARERS; i++) {
442 if (n->links[i].link)
443 tipc_link_reset(n->links[i].link);
448 void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
450 n_ptr->links[l_ptr->bearer_id].link = l_ptr;
454 void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
458 for (i = 0; i < MAX_BEARERS; i++) {
459 if (l_ptr != n_ptr->links[i].link)
461 n_ptr->links[i].link = NULL;
466 /* tipc_node_fsm_evt - node finite state machine
467 * Determines when contact is allowed with peer node
469 static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
471 int state = n->state;
474 case SELF_DOWN_PEER_DOWN:
476 case SELF_ESTABL_CONTACT_EVT:
477 state = SELF_UP_PEER_COMING;
479 case PEER_ESTABL_CONTACT_EVT:
480 state = SELF_COMING_PEER_UP;
482 case SELF_LOST_CONTACT_EVT:
483 case PEER_LOST_CONTACT_EVT:
486 pr_err("Unknown node fsm evt %x/%x\n", state, evt);
489 case SELF_UP_PEER_UP:
491 case SELF_LOST_CONTACT_EVT:
492 state = SELF_DOWN_PEER_LEAVING;
494 case PEER_LOST_CONTACT_EVT:
495 state = SELF_LEAVING_PEER_DOWN;
497 case SELF_ESTABL_CONTACT_EVT:
498 case PEER_ESTABL_CONTACT_EVT:
501 pr_err("Unknown node fsm evt %x/%x\n", state, evt);
504 case SELF_DOWN_PEER_LEAVING:
506 case PEER_LOST_CONTACT_EVT:
507 state = SELF_DOWN_PEER_DOWN;
509 case SELF_ESTABL_CONTACT_EVT:
510 case PEER_ESTABL_CONTACT_EVT:
511 case SELF_LOST_CONTACT_EVT:
514 pr_err("Unknown node fsm evt %x/%x\n", state, evt);
517 case SELF_UP_PEER_COMING:
519 case PEER_ESTABL_CONTACT_EVT:
520 state = SELF_UP_PEER_UP;
522 case SELF_LOST_CONTACT_EVT:
523 state = SELF_DOWN_PEER_LEAVING;
525 case SELF_ESTABL_CONTACT_EVT:
526 case PEER_LOST_CONTACT_EVT:
529 pr_err("Unknown node fsm evt %x/%x\n", state, evt);
532 case SELF_COMING_PEER_UP:
534 case SELF_ESTABL_CONTACT_EVT:
535 state = SELF_UP_PEER_UP;
537 case PEER_LOST_CONTACT_EVT:
538 state = SELF_LEAVING_PEER_DOWN;
540 case SELF_LOST_CONTACT_EVT:
541 case PEER_ESTABL_CONTACT_EVT:
544 pr_err("Unknown node fsm evt %x/%x\n", state, evt);
547 case SELF_LEAVING_PEER_DOWN:
549 case SELF_LOST_CONTACT_EVT:
550 state = SELF_DOWN_PEER_DOWN;
552 case SELF_ESTABL_CONTACT_EVT:
553 case PEER_ESTABL_CONTACT_EVT:
554 case PEER_LOST_CONTACT_EVT:
557 pr_err("Unknown node fsm evt %x/%x\n", state, evt);
561 pr_err("Unknown node fsm state %x\n", state);
568 bool tipc_node_filter_skb(struct tipc_node *n, struct tipc_link *l,
569 struct tipc_msg *hdr)
571 int state = n->state;
573 if (likely(state == SELF_UP_PEER_UP))
576 if (state == SELF_DOWN_PEER_DOWN)
579 if (state == SELF_UP_PEER_COMING) {
580 /* If not traffic msg, peer may still be ESTABLISHING */
581 if (tipc_link_is_up(l) && msg_is_traffic(hdr))
582 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
586 if (state == SELF_COMING_PEER_UP)
589 if (state == SELF_LEAVING_PEER_DOWN)
592 if (state == SELF_DOWN_PEER_LEAVING) {
593 if (msg_peer_is_up(hdr))
595 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
601 static void node_established_contact(struct tipc_node *n_ptr)
603 tipc_node_fsm_evt(n_ptr, SELF_ESTABL_CONTACT_EVT);
604 n_ptr->action_flags |= TIPC_NOTIFY_NODE_UP;
605 n_ptr->bclink.oos_state = 0;
606 n_ptr->bclink.acked = tipc_bclink_get_last_sent(n_ptr->net);
607 tipc_bclink_add_node(n_ptr->net, n_ptr->addr);
610 static void node_lost_contact(struct tipc_node *n_ptr)
612 char addr_string[16];
613 struct tipc_sock_conn *conn, *safe;
614 struct list_head *conns = &n_ptr->conn_sks;
616 struct tipc_net *tn = net_generic(n_ptr->net, tipc_net_id);
619 pr_debug("Lost contact with %s\n",
620 tipc_addr_string_fill(addr_string, n_ptr->addr));
622 /* Flush broadcast link info associated with lost node */
623 if (n_ptr->bclink.recv_permitted) {
624 __skb_queue_purge(&n_ptr->bclink.deferdq);
626 if (n_ptr->bclink.reasm_buf) {
627 kfree_skb(n_ptr->bclink.reasm_buf);
628 n_ptr->bclink.reasm_buf = NULL;
631 tipc_bclink_remove_node(n_ptr->net, n_ptr->addr);
632 tipc_bclink_acknowledge(n_ptr, INVALID_LINK_SEQ);
634 n_ptr->bclink.recv_permitted = false;
637 /* Abort any ongoing link failover */
638 for (i = 0; i < MAX_BEARERS; i++) {
639 struct tipc_link *l_ptr = n_ptr->links[i].link;
642 l_ptr->exec_mode = TIPC_LINK_OPEN;
643 l_ptr->failover_checkpt = 0;
644 l_ptr->failover_pkts = 0;
645 kfree_skb(l_ptr->failover_skb);
646 l_ptr->failover_skb = NULL;
647 tipc_link_reset_fragments(l_ptr);
649 /* Prevent re-contact with node until cleanup is done */
650 tipc_node_fsm_evt(n_ptr, SELF_LOST_CONTACT_EVT);
652 /* Notify publications from this node */
653 n_ptr->action_flags |= TIPC_NOTIFY_NODE_DOWN;
655 /* Notify sockets connected to node */
656 list_for_each_entry_safe(conn, safe, conns, list) {
657 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
658 SHORT_H_SIZE, 0, tn->own_addr,
659 conn->peer_node, conn->port,
660 conn->peer_port, TIPC_ERR_NO_NODE);
662 skb_queue_tail(n_ptr->inputq, skb);
663 n_ptr->action_flags |= TIPC_MSG_EVT;
665 list_del(&conn->list);
671 * tipc_node_get_linkname - get the name of a link
673 * @bearer_id: id of the bearer
674 * @node: peer node address
675 * @linkname: link name output buffer
677 * Returns 0 on success
679 int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
680 char *linkname, size_t len)
682 struct tipc_link *link;
684 struct tipc_node *node = tipc_node_find(net, addr);
689 if (bearer_id >= MAX_BEARERS)
692 tipc_node_lock(node);
693 link = node->links[bearer_id].link;
695 strncpy(linkname, link->name, len);
699 tipc_node_unlock(node);
704 void tipc_node_unlock(struct tipc_node *node)
706 struct net *net = node->net;
708 u32 flags = node->action_flags;
710 struct list_head *publ_list;
711 struct sk_buff_head *inputq = node->inputq;
712 struct sk_buff_head *namedq;
714 if (likely(!flags || (flags == TIPC_MSG_EVT))) {
715 node->action_flags = 0;
716 spin_unlock_bh(&node->lock);
717 if (flags == TIPC_MSG_EVT)
718 tipc_sk_rcv(net, inputq);
723 link_id = node->link_id;
724 namedq = node->namedq;
725 publ_list = &node->publ_list;
727 node->action_flags &= ~(TIPC_MSG_EVT |
728 TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP |
729 TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP |
730 TIPC_WAKEUP_BCAST_USERS | TIPC_BCAST_MSG_EVT |
731 TIPC_NAMED_MSG_EVT | TIPC_BCAST_RESET);
733 spin_unlock_bh(&node->lock);
735 if (flags & TIPC_NOTIFY_NODE_DOWN)
736 tipc_publ_notify(net, publ_list, addr);
738 if (flags & TIPC_WAKEUP_BCAST_USERS)
739 tipc_bclink_wakeup_users(net);
741 if (flags & TIPC_NOTIFY_NODE_UP)
742 tipc_named_node_up(net, addr);
744 if (flags & TIPC_NOTIFY_LINK_UP)
745 tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr,
746 TIPC_NODE_SCOPE, link_id, addr);
748 if (flags & TIPC_NOTIFY_LINK_DOWN)
749 tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr,
752 if (flags & TIPC_MSG_EVT)
753 tipc_sk_rcv(net, inputq);
755 if (flags & TIPC_NAMED_MSG_EVT)
756 tipc_named_rcv(net, namedq);
758 if (flags & TIPC_BCAST_MSG_EVT)
759 tipc_bclink_input(net);
761 if (flags & TIPC_BCAST_RESET)
762 tipc_node_reset_links(node);
765 /* Caller should hold node lock for the passed node */
766 static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
769 struct nlattr *attrs;
771 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
772 NLM_F_MULTI, TIPC_NL_NODE_GET);
776 attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE);
780 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
782 if (tipc_node_is_up(node))
783 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
786 nla_nest_end(msg->skb, attrs);
787 genlmsg_end(msg->skb, hdr);
792 nla_nest_cancel(msg->skb, attrs);
794 genlmsg_cancel(msg->skb, hdr);
799 static struct tipc_link *tipc_node_select_link(struct tipc_node *n, int sel,
801 struct tipc_media_addr **maddr)
803 int id = n->active_links[sel & 1];
805 if (unlikely(id < 0))
809 *maddr = &n->links[id].maddr;
810 return n->links[id].link;
814 * tipc_node_xmit() is the general link level function for message sending
815 * @net: the applicable net namespace
816 * @list: chain of buffers containing message
817 * @dnode: address of destination node
818 * @selector: a number used for deterministic link selection
819 * Consumes the buffer chain, except when returning -ELINKCONG
820 * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE
822 int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
823 u32 dnode, int selector)
825 struct tipc_link *l = NULL;
827 struct sk_buff_head xmitq;
828 struct tipc_media_addr *maddr;
830 int rc = -EHOSTUNREACH;
832 __skb_queue_head_init(&xmitq);
833 n = tipc_node_find(net, dnode);
836 l = tipc_node_select_link(n, selector, &bearer_id, &maddr);
838 rc = tipc_link_xmit(l, list, &xmitq);
839 if (unlikely(rc == -ENOBUFS))
845 tipc_bearer_xmit(net, bearer_id, &xmitq, maddr);
848 if (likely(in_own_node(net, dnode))) {
849 tipc_sk_rcv(net, list);
855 /* tipc_node_xmit_skb(): send single buffer to destination
856 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
857 * messages, which will not be rejected
858 * The only exception is datagram messages rerouted after secondary
859 * lookup, which are rare and safe to dispose of anyway.
860 * TODO: Return real return value, and let callers use
861 * tipc_wait_for_sendpkt() where applicable
863 int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
866 struct sk_buff_head head;
869 skb_queue_head_init(&head);
870 __skb_queue_tail(&head, skb);
871 rc = tipc_node_xmit(net, &head, dnode, selector);
872 if (rc == -ELINKCONG)
877 /* tipc_node_tnl_init(): handle a received TUNNEL_PROTOCOL packet,
878 * in order to control parallel link failover or synchronization
880 static void tipc_node_tnl_init(struct tipc_node *n, int bearer_id,
883 struct tipc_link *tnl, *pl;
884 struct tipc_msg *hdr = buf_msg(skb);
885 u16 oseqno = msg_seqno(hdr);
886 int pb_id = msg_bearer_id(hdr);
888 if (pb_id >= MAX_BEARERS)
891 tnl = n->links[bearer_id].link;
895 /* Ignore if duplicate */
896 if (less(oseqno, tnl->rcv_nxt))
899 pl = n->links[pb_id].link;
903 if (msg_type(hdr) == FAILOVER_MSG) {
904 if (tipc_link_is_up(pl)) {
906 pl->exec_mode = TIPC_LINK_BLOCKED;
912 * tipc_rcv - process TIPC packets/messages arriving from off-node
913 * @net: the applicable net namespace
915 * @bearer: pointer to bearer message arrived on
917 * Invoked with no locks held. Bearer pointer must point to a valid bearer
918 * structure (i.e. cannot be NULL), but bearer can be inactive.
920 void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
922 struct sk_buff_head xmitq;
925 struct tipc_msg *hdr;
926 struct tipc_media_addr *maddr;
927 int bearer_id = b->identity;
931 __skb_queue_head_init(&xmitq);
933 /* Ensure message is well-formed */
934 if (unlikely(!tipc_msg_validate(skb)))
937 /* Handle arrival of a non-unicast link packet */
940 if (unlikely(msg_non_seq(hdr))) {
941 if (usr == LINK_CONFIG)
942 tipc_disc_rcv(net, skb, b);
944 tipc_bclink_rcv(net, skb);
948 /* Locate neighboring node that sent packet */
949 n = tipc_node_find(net, msg_prevnode(hdr));
954 /* Prepare links for tunneled reception if applicable */
955 if (unlikely(usr == TUNNEL_PROTOCOL))
956 tipc_node_tnl_init(n, bearer_id, skb);
958 /* Locate link endpoint that should handle packet */
959 l = n->links[bearer_id].link;
963 /* Is reception of this packet permitted at the moment ? */
964 if (unlikely(n->state != SELF_UP_PEER_UP))
965 if (!tipc_node_filter_skb(n, l, hdr))
968 if (unlikely(usr == LINK_PROTOCOL))
969 tipc_bclink_sync_state(n, hdr);
971 /* Release acked broadcast messages */
972 if (unlikely(n->bclink.acked != msg_bcast_ack(hdr)))
973 tipc_bclink_acknowledge(n, msg_bcast_ack(hdr));
975 /* Check protocol and update link state */
976 rc = tipc_link_rcv(l, skb, &xmitq);
978 if (unlikely(rc & TIPC_LINK_UP_EVT))
979 tipc_node_link_up(n, bearer_id);
980 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
985 tipc_sk_rcv(net, &n->links[bearer_id].inputq);
986 maddr = &n->links[bearer_id].maddr;
987 tipc_bearer_xmit(net, bearer_id, &xmitq, maddr);
993 int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
996 struct net *net = sock_net(skb->sk);
997 struct tipc_net *tn = net_generic(net, tipc_net_id);
998 int done = cb->args[0];
999 int last_addr = cb->args[1];
1000 struct tipc_node *node;
1001 struct tipc_nl_msg msg;
1007 msg.portid = NETLINK_CB(cb->skb).portid;
1008 msg.seq = cb->nlh->nlmsg_seq;
1012 node = tipc_node_find(net, last_addr);
1015 /* We never set seq or call nl_dump_check_consistent()
1016 * this means that setting prev_seq here will cause the
1017 * consistence check to fail in the netlink callback
1018 * handler. Resulting in the NLMSG_DONE message having
1019 * the NLM_F_DUMP_INTR flag set if the node state
1020 * changed while we released the lock.
1025 tipc_node_put(node);
1028 list_for_each_entry_rcu(node, &tn->node_list, list) {
1030 if (node->addr == last_addr)
1036 tipc_node_lock(node);
1037 err = __tipc_nl_add_node(&msg, node);
1039 last_addr = node->addr;
1040 tipc_node_unlock(node);
1044 tipc_node_unlock(node);
1049 cb->args[1] = last_addr;