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"
46 #define INVALID_NODE_SIG 0x10000
48 /* Flags used to take different actions according to flag type
49 * TIPC_NOTIFY_NODE_DOWN: notify node is down
50 * TIPC_NOTIFY_NODE_UP: notify node is up
51 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
54 TIPC_NOTIFY_NODE_DOWN = (1 << 3),
55 TIPC_NOTIFY_NODE_UP = (1 << 4),
56 TIPC_NOTIFY_LINK_UP = (1 << 6),
57 TIPC_NOTIFY_LINK_DOWN = (1 << 7)
60 struct tipc_link_entry {
61 struct tipc_link *link;
62 spinlock_t lock; /* per link */
64 struct sk_buff_head inputq;
65 struct tipc_media_addr maddr;
68 struct tipc_bclink_entry {
69 struct tipc_link *link;
70 struct sk_buff_head inputq1;
71 struct sk_buff_head arrvq;
72 struct sk_buff_head inputq2;
73 struct sk_buff_head namedq;
77 * struct tipc_node - TIPC node structure
78 * @addr: network address of node
79 * @ref: reference counter to node object
80 * @lock: rwlock governing access to structure
81 * @net: the applicable net namespace
82 * @hash: links to adjacent nodes in unsorted hash chain
83 * @inputq: pointer to input queue containing messages for msg event
84 * @namedq: pointer to name table input queue with name table messages
85 * @active_links: bearer ids of active links, used as index into links[] array
86 * @links: array containing references to all links to node
87 * @action_flags: bit mask of different types of node actions
88 * @state: connectivity state vs peer node
89 * @sync_point: sequence number where synch/failover is finished
90 * @list: links to adjacent nodes in sorted list of cluster's nodes
91 * @working_links: number of working links to node (both active and standby)
92 * @link_cnt: number of links to node
93 * @capabilities: bitmap, indicating peer node's functional capabilities
94 * @signature: node instance identifier
95 * @link_id: local and remote bearer ids of changing link, if any
96 * @publ_list: list of publications
97 * @rcu: rcu struct for tipc_node
104 struct hlist_node hash;
106 struct tipc_link_entry links[MAX_BEARERS];
107 struct tipc_bclink_entry bc_entry;
109 struct list_head list;
117 struct list_head publ_list;
118 struct list_head conn_sks;
119 unsigned long keepalive_intv;
120 struct timer_list timer;
124 /* Node FSM states and events:
127 SELF_DOWN_PEER_DOWN = 0xdd,
128 SELF_UP_PEER_UP = 0xaa,
129 SELF_DOWN_PEER_LEAVING = 0xd1,
130 SELF_UP_PEER_COMING = 0xac,
131 SELF_COMING_PEER_UP = 0xca,
132 SELF_LEAVING_PEER_DOWN = 0x1d,
133 NODE_FAILINGOVER = 0xf0,
138 SELF_ESTABL_CONTACT_EVT = 0xece,
139 SELF_LOST_CONTACT_EVT = 0x1ce,
140 PEER_ESTABL_CONTACT_EVT = 0x9ece,
141 PEER_LOST_CONTACT_EVT = 0x91ce,
142 NODE_FAILOVER_BEGIN_EVT = 0xfbe,
143 NODE_FAILOVER_END_EVT = 0xfee,
144 NODE_SYNCH_BEGIN_EVT = 0xcbe,
145 NODE_SYNCH_END_EVT = 0xcee
148 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
149 struct sk_buff_head *xmitq,
150 struct tipc_media_addr **maddr);
151 static void tipc_node_link_down(struct tipc_node *n, int bearer_id,
153 static void node_lost_contact(struct tipc_node *n, struct sk_buff_head *inputq);
154 static void tipc_node_delete(struct tipc_node *node);
155 static void tipc_node_timeout(unsigned long data);
156 static void tipc_node_fsm_evt(struct tipc_node *n, int evt);
157 static struct tipc_node *tipc_node_find(struct net *net, u32 addr);
158 static void tipc_node_put(struct tipc_node *node);
159 static bool tipc_node_is_up(struct tipc_node *n);
161 struct tipc_sock_conn {
165 struct list_head list;
168 static struct tipc_link *node_active_link(struct tipc_node *n, int sel)
170 int bearer_id = n->active_links[sel & 1];
172 if (unlikely(bearer_id == INVALID_BEARER_ID))
175 return n->links[bearer_id].link;
178 int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel)
182 unsigned int mtu = MAX_MSG_SIZE;
184 n = tipc_node_find(net, addr);
188 bearer_id = n->active_links[sel & 1];
189 if (likely(bearer_id != INVALID_BEARER_ID))
190 mtu = n->links[bearer_id].mtu;
195 * A trivial power-of-two bitmask technique is used for speed, since this
196 * operation is done for every incoming TIPC packet. The number of hash table
197 * entries has been chosen so that no hash chain exceeds 8 nodes and will
198 * usually be much smaller (typically only a single node).
200 static unsigned int tipc_hashfn(u32 addr)
202 return addr & (NODE_HTABLE_SIZE - 1);
205 static void tipc_node_kref_release(struct kref *kref)
207 struct tipc_node *n = container_of(kref, struct tipc_node, kref);
209 kfree(n->bc_entry.link);
213 static void tipc_node_put(struct tipc_node *node)
215 kref_put(&node->kref, tipc_node_kref_release);
218 static void tipc_node_get(struct tipc_node *node)
220 kref_get(&node->kref);
224 * tipc_node_find - locate specified node object, if it exists
226 static struct tipc_node *tipc_node_find(struct net *net, u32 addr)
228 struct tipc_net *tn = tipc_net(net);
229 struct tipc_node *node;
230 unsigned int thash = tipc_hashfn(addr);
232 if (unlikely(!in_own_cluster_exact(net, addr)))
236 hlist_for_each_entry_rcu(node, &tn->node_htable[thash], hash) {
237 if (node->addr != addr)
239 if (!kref_get_unless_zero(&node->kref))
247 static void tipc_node_read_lock(struct tipc_node *n)
249 read_lock_bh(&n->lock);
252 static void tipc_node_read_unlock(struct tipc_node *n)
254 read_unlock_bh(&n->lock);
257 static void tipc_node_write_lock(struct tipc_node *n)
259 write_lock_bh(&n->lock);
262 static void tipc_node_write_unlock(struct tipc_node *n)
264 struct net *net = n->net;
266 u32 flags = n->action_flags;
268 struct list_head *publ_list;
270 if (likely(!flags)) {
271 write_unlock_bh(&n->lock);
276 link_id = n->link_id;
277 publ_list = &n->publ_list;
279 n->action_flags &= ~(TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP |
280 TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP);
282 write_unlock_bh(&n->lock);
284 if (flags & TIPC_NOTIFY_NODE_DOWN)
285 tipc_publ_notify(net, publ_list, addr);
287 if (flags & TIPC_NOTIFY_NODE_UP)
288 tipc_named_node_up(net, addr);
290 if (flags & TIPC_NOTIFY_LINK_UP)
291 tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr,
292 TIPC_NODE_SCOPE, link_id, addr);
294 if (flags & TIPC_NOTIFY_LINK_DOWN)
295 tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr,
299 struct tipc_node *tipc_node_create(struct net *net, u32 addr, u16 capabilities)
301 struct tipc_net *tn = net_generic(net, tipc_net_id);
302 struct tipc_node *n, *temp_node;
305 spin_lock_bh(&tn->node_list_lock);
306 n = tipc_node_find(net, addr);
309 n = kzalloc(sizeof(*n), GFP_ATOMIC);
311 pr_warn("Node creation failed, no memory\n");
316 n->capabilities = capabilities;
318 rwlock_init(&n->lock);
319 INIT_HLIST_NODE(&n->hash);
320 INIT_LIST_HEAD(&n->list);
321 INIT_LIST_HEAD(&n->publ_list);
322 INIT_LIST_HEAD(&n->conn_sks);
323 skb_queue_head_init(&n->bc_entry.namedq);
324 skb_queue_head_init(&n->bc_entry.inputq1);
325 __skb_queue_head_init(&n->bc_entry.arrvq);
326 skb_queue_head_init(&n->bc_entry.inputq2);
327 for (i = 0; i < MAX_BEARERS; i++)
328 spin_lock_init(&n->links[i].lock);
329 n->state = SELF_DOWN_PEER_LEAVING;
330 n->signature = INVALID_NODE_SIG;
331 n->active_links[0] = INVALID_BEARER_ID;
332 n->active_links[1] = INVALID_BEARER_ID;
333 if (!tipc_link_bc_create(net, tipc_own_addr(net), n->addr,
335 tipc_link_window(tipc_bc_sndlink(net)),
337 &n->bc_entry.inputq1,
339 tipc_bc_sndlink(net),
340 &n->bc_entry.link)) {
341 pr_warn("Broadcast rcv link creation failed, no memory\n");
347 setup_timer(&n->timer, tipc_node_timeout, (unsigned long)n);
348 n->keepalive_intv = U32_MAX;
349 hlist_add_head_rcu(&n->hash, &tn->node_htable[tipc_hashfn(addr)]);
350 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
351 if (n->addr < temp_node->addr)
354 list_add_tail_rcu(&n->list, &temp_node->list);
356 spin_unlock_bh(&tn->node_list_lock);
360 static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l)
362 unsigned long tol = tipc_link_tolerance(l);
363 unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4;
364 unsigned long keepalive_intv = msecs_to_jiffies(intv);
366 /* Link with lowest tolerance determines timer interval */
367 if (keepalive_intv < n->keepalive_intv)
368 n->keepalive_intv = keepalive_intv;
370 /* Ensure link's abort limit corresponds to current interval */
371 tipc_link_set_abort_limit(l, tol / jiffies_to_msecs(n->keepalive_intv));
374 static void tipc_node_delete(struct tipc_node *node)
376 list_del_rcu(&node->list);
377 hlist_del_rcu(&node->hash);
380 del_timer_sync(&node->timer);
384 void tipc_node_stop(struct net *net)
386 struct tipc_net *tn = tipc_net(net);
387 struct tipc_node *node, *t_node;
389 spin_lock_bh(&tn->node_list_lock);
390 list_for_each_entry_safe(node, t_node, &tn->node_list, list)
391 tipc_node_delete(node);
392 spin_unlock_bh(&tn->node_list_lock);
395 void tipc_node_subscribe(struct net *net, struct list_head *subscr, u32 addr)
399 if (in_own_node(net, addr))
402 n = tipc_node_find(net, addr);
404 pr_warn("Node subscribe rejected, unknown node 0x%x\n", addr);
407 tipc_node_write_lock(n);
408 list_add_tail(subscr, &n->publ_list);
409 tipc_node_write_unlock(n);
413 void tipc_node_unsubscribe(struct net *net, struct list_head *subscr, u32 addr)
417 if (in_own_node(net, addr))
420 n = tipc_node_find(net, addr);
422 pr_warn("Node unsubscribe rejected, unknown node 0x%x\n", addr);
425 tipc_node_write_lock(n);
426 list_del_init(subscr);
427 tipc_node_write_unlock(n);
431 int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port)
433 struct tipc_node *node;
434 struct tipc_sock_conn *conn;
437 if (in_own_node(net, dnode))
440 node = tipc_node_find(net, dnode);
442 pr_warn("Connecting sock to node 0x%x failed\n", dnode);
443 return -EHOSTUNREACH;
445 conn = kmalloc(sizeof(*conn), GFP_ATOMIC);
450 conn->peer_node = dnode;
452 conn->peer_port = peer_port;
454 tipc_node_write_lock(node);
455 list_add_tail(&conn->list, &node->conn_sks);
456 tipc_node_write_unlock(node);
462 void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port)
464 struct tipc_node *node;
465 struct tipc_sock_conn *conn, *safe;
467 if (in_own_node(net, dnode))
470 node = tipc_node_find(net, dnode);
474 tipc_node_write_lock(node);
475 list_for_each_entry_safe(conn, safe, &node->conn_sks, list) {
476 if (port != conn->port)
478 list_del(&conn->list);
481 tipc_node_write_unlock(node);
485 /* tipc_node_timeout - handle expiration of node timer
487 static void tipc_node_timeout(unsigned long data)
489 struct tipc_node *n = (struct tipc_node *)data;
490 struct tipc_link_entry *le;
491 struct sk_buff_head xmitq;
495 __skb_queue_head_init(&xmitq);
497 for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) {
498 tipc_node_read_lock(n);
499 le = &n->links[bearer_id];
500 spin_lock_bh(&le->lock);
502 /* Link tolerance may change asynchronously: */
503 tipc_node_calculate_timer(n, le->link);
504 rc = tipc_link_timeout(le->link, &xmitq);
506 spin_unlock_bh(&le->lock);
507 tipc_node_read_unlock(n);
508 tipc_bearer_xmit(n->net, bearer_id, &xmitq, &le->maddr);
509 if (rc & TIPC_LINK_DOWN_EVT)
510 tipc_node_link_down(n, bearer_id, false);
512 mod_timer(&n->timer, jiffies + n->keepalive_intv);
516 * __tipc_node_link_up - handle addition of link
517 * Node lock must be held by caller
518 * Link becomes active (alone or shared) or standby, depending on its priority.
520 static void __tipc_node_link_up(struct tipc_node *n, int bearer_id,
521 struct sk_buff_head *xmitq)
523 int *slot0 = &n->active_links[0];
524 int *slot1 = &n->active_links[1];
525 struct tipc_link *ol = node_active_link(n, 0);
526 struct tipc_link *nl = n->links[bearer_id].link;
531 tipc_link_fsm_evt(nl, LINK_ESTABLISH_EVT);
532 if (!tipc_link_is_up(nl))
536 n->action_flags |= TIPC_NOTIFY_LINK_UP;
537 n->link_id = tipc_link_id(nl);
539 /* Leave room for tunnel header when returning 'mtu' to users: */
540 n->links[bearer_id].mtu = tipc_link_mtu(nl) - INT_H_SIZE;
542 tipc_bearer_add_dest(n->net, bearer_id, n->addr);
543 tipc_bcast_inc_bearer_dst_cnt(n->net, bearer_id);
545 pr_debug("Established link <%s> on network plane %c\n",
546 tipc_link_name(nl), tipc_link_plane(nl));
548 /* Ensure that a STATE message goes first */
549 tipc_link_build_state_msg(nl, xmitq);
551 /* First link? => give it both slots */
555 tipc_node_fsm_evt(n, SELF_ESTABL_CONTACT_EVT);
556 n->action_flags |= TIPC_NOTIFY_NODE_UP;
557 tipc_link_set_active(nl, true);
558 tipc_bcast_add_peer(n->net, nl, xmitq);
562 /* Second link => redistribute slots */
563 if (tipc_link_prio(nl) > tipc_link_prio(ol)) {
564 pr_debug("Old link <%s> becomes standby\n", tipc_link_name(ol));
567 tipc_link_set_active(nl, true);
568 tipc_link_set_active(ol, false);
569 } else if (tipc_link_prio(nl) == tipc_link_prio(ol)) {
570 tipc_link_set_active(nl, true);
573 pr_debug("New link <%s> is standby\n", tipc_link_name(nl));
576 /* Prepare synchronization with first link */
577 tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq);
581 * tipc_node_link_up - handle addition of link
583 * Link becomes active (alone or shared) or standby, depending on its priority.
585 static void tipc_node_link_up(struct tipc_node *n, int bearer_id,
586 struct sk_buff_head *xmitq)
588 struct tipc_media_addr *maddr;
590 tipc_node_write_lock(n);
591 __tipc_node_link_up(n, bearer_id, xmitq);
592 maddr = &n->links[bearer_id].maddr;
593 tipc_bearer_xmit(n->net, bearer_id, xmitq, maddr);
594 tipc_node_write_unlock(n);
598 * __tipc_node_link_down - handle loss of link
600 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
601 struct sk_buff_head *xmitq,
602 struct tipc_media_addr **maddr)
604 struct tipc_link_entry *le = &n->links[*bearer_id];
605 int *slot0 = &n->active_links[0];
606 int *slot1 = &n->active_links[1];
607 int i, highest = 0, prio;
608 struct tipc_link *l, *_l, *tnl;
610 l = n->links[*bearer_id].link;
611 if (!l || tipc_link_is_reset(l))
615 n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
616 n->link_id = tipc_link_id(l);
618 tipc_bearer_remove_dest(n->net, *bearer_id, n->addr);
620 pr_debug("Lost link <%s> on network plane %c\n",
621 tipc_link_name(l), tipc_link_plane(l));
623 /* Select new active link if any available */
624 *slot0 = INVALID_BEARER_ID;
625 *slot1 = INVALID_BEARER_ID;
626 for (i = 0; i < MAX_BEARERS; i++) {
627 _l = n->links[i].link;
628 if (!_l || !tipc_link_is_up(_l))
632 prio = tipc_link_prio(_l);
635 if (prio > highest) {
644 if (!tipc_node_is_up(n)) {
645 if (tipc_link_peer_is_down(l))
646 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
647 tipc_node_fsm_evt(n, SELF_LOST_CONTACT_EVT);
648 tipc_link_fsm_evt(l, LINK_RESET_EVT);
650 tipc_link_build_reset_msg(l, xmitq);
651 *maddr = &n->links[*bearer_id].maddr;
652 node_lost_contact(n, &le->inputq);
653 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
656 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
658 /* There is still a working link => initiate failover */
659 *bearer_id = n->active_links[0];
660 tnl = n->links[*bearer_id].link;
661 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
662 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
663 n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
664 tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, xmitq);
666 tipc_link_fsm_evt(l, LINK_RESET_EVT);
667 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
668 tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
669 *maddr = &n->links[*bearer_id].maddr;
672 static void tipc_node_link_down(struct tipc_node *n, int bearer_id, bool delete)
674 struct tipc_link_entry *le = &n->links[bearer_id];
675 struct tipc_link *l = le->link;
676 struct tipc_media_addr *maddr;
677 struct sk_buff_head xmitq;
682 __skb_queue_head_init(&xmitq);
684 tipc_node_write_lock(n);
685 if (!tipc_link_is_establishing(l)) {
686 __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr);
693 /* Defuse pending tipc_node_link_up() */
694 tipc_link_fsm_evt(l, LINK_RESET_EVT);
696 tipc_node_write_unlock(n);
697 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr);
698 tipc_sk_rcv(n->net, &le->inputq);
701 static bool tipc_node_is_up(struct tipc_node *n)
703 return n->active_links[0] != INVALID_BEARER_ID;
706 void tipc_node_check_dest(struct net *net, u32 onode,
707 struct tipc_bearer *b,
708 u16 capabilities, u32 signature,
709 struct tipc_media_addr *maddr,
710 bool *respond, bool *dupl_addr)
714 struct tipc_link_entry *le;
715 bool addr_match = false;
716 bool sign_match = false;
717 bool link_up = false;
718 bool accept_addr = false;
725 n = tipc_node_create(net, onode, capabilities);
729 tipc_node_write_lock(n);
731 le = &n->links[b->identity];
733 /* Prepare to validate requesting node's signature and media address */
735 link_up = l && tipc_link_is_up(l);
736 addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr));
737 sign_match = (signature == n->signature);
739 /* These three flags give us eight permutations: */
741 if (sign_match && addr_match && link_up) {
742 /* All is fine. Do nothing. */
744 } else if (sign_match && addr_match && !link_up) {
745 /* Respond. The link will come up in due time */
747 } else if (sign_match && !addr_match && link_up) {
748 /* Peer has changed i/f address without rebooting.
749 * If so, the link will reset soon, and the next
750 * discovery will be accepted. So we can ignore it.
751 * It may also be an cloned or malicious peer having
752 * chosen the same node address and signature as an
754 * Ignore requests until the link goes down, if ever.
757 } else if (sign_match && !addr_match && !link_up) {
758 /* Peer link has changed i/f address without rebooting.
759 * It may also be a cloned or malicious peer; we can't
760 * distinguish between the two.
761 * The signature is correct, so we must accept.
765 } else if (!sign_match && addr_match && link_up) {
766 /* Peer node rebooted. Two possibilities:
767 * - Delayed re-discovery; this link endpoint has already
768 * reset and re-established contact with the peer, before
769 * receiving a discovery message from that node.
770 * (The peer happened to receive one from this node first).
771 * - The peer came back so fast that our side has not
772 * discovered it yet. Probing from this side will soon
773 * reset the link, since there can be no working link
774 * endpoint at the peer end, and the link will re-establish.
775 * Accept the signature, since it comes from a known peer.
777 n->signature = signature;
778 } else if (!sign_match && addr_match && !link_up) {
779 /* The peer node has rebooted.
780 * Accept signature, since it is a known peer.
782 n->signature = signature;
784 } else if (!sign_match && !addr_match && link_up) {
785 /* Peer rebooted with new address, or a new/duplicate peer.
786 * Ignore until the link goes down, if ever.
789 } else if (!sign_match && !addr_match && !link_up) {
790 /* Peer rebooted with new address, or it is a new peer.
791 * Accept signature and address.
793 n->signature = signature;
801 /* Now create new link if not already existing */
803 if (n->link_cnt == 2) {
804 pr_warn("Cannot establish 3rd link to %x\n", n->addr);
807 if_name = strchr(b->name, ':') + 1;
808 if (!tipc_link_create(net, if_name, b->identity, b->tolerance,
809 b->net_plane, b->mtu, b->priority,
810 b->window, mod(tipc_net(net)->random),
811 tipc_own_addr(net), onode,
813 tipc_bc_sndlink(n->net), n->bc_entry.link,
815 &n->bc_entry.namedq, &l)) {
820 tipc_link_fsm_evt(l, LINK_RESET_EVT);
821 if (n->state == NODE_FAILINGOVER)
822 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
825 tipc_node_calculate_timer(n, l);
826 if (n->link_cnt == 1)
827 if (!mod_timer(&n->timer, jiffies + n->keepalive_intv))
830 memcpy(&le->maddr, maddr, sizeof(*maddr));
832 tipc_node_write_unlock(n);
833 if (reset && l && !tipc_link_is_reset(l))
834 tipc_node_link_down(n, b->identity, false);
838 void tipc_node_delete_links(struct net *net, int bearer_id)
840 struct tipc_net *tn = net_generic(net, tipc_net_id);
844 list_for_each_entry_rcu(n, &tn->node_list, list) {
845 tipc_node_link_down(n, bearer_id, true);
850 static void tipc_node_reset_links(struct tipc_node *n)
852 char addr_string[16];
855 pr_warn("Resetting all links to %s\n",
856 tipc_addr_string_fill(addr_string, n->addr));
858 for (i = 0; i < MAX_BEARERS; i++) {
859 tipc_node_link_down(n, i, false);
863 /* tipc_node_fsm_evt - node finite state machine
864 * Determines when contact is allowed with peer node
866 static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
868 int state = n->state;
871 case SELF_DOWN_PEER_DOWN:
873 case SELF_ESTABL_CONTACT_EVT:
874 state = SELF_UP_PEER_COMING;
876 case PEER_ESTABL_CONTACT_EVT:
877 state = SELF_COMING_PEER_UP;
879 case SELF_LOST_CONTACT_EVT:
880 case PEER_LOST_CONTACT_EVT:
882 case NODE_SYNCH_END_EVT:
883 case NODE_SYNCH_BEGIN_EVT:
884 case NODE_FAILOVER_BEGIN_EVT:
885 case NODE_FAILOVER_END_EVT:
890 case SELF_UP_PEER_UP:
892 case SELF_LOST_CONTACT_EVT:
893 state = SELF_DOWN_PEER_LEAVING;
895 case PEER_LOST_CONTACT_EVT:
896 state = SELF_LEAVING_PEER_DOWN;
898 case NODE_SYNCH_BEGIN_EVT:
899 state = NODE_SYNCHING;
901 case NODE_FAILOVER_BEGIN_EVT:
902 state = NODE_FAILINGOVER;
904 case SELF_ESTABL_CONTACT_EVT:
905 case PEER_ESTABL_CONTACT_EVT:
906 case NODE_SYNCH_END_EVT:
907 case NODE_FAILOVER_END_EVT:
913 case SELF_DOWN_PEER_LEAVING:
915 case PEER_LOST_CONTACT_EVT:
916 state = SELF_DOWN_PEER_DOWN;
918 case SELF_ESTABL_CONTACT_EVT:
919 case PEER_ESTABL_CONTACT_EVT:
920 case SELF_LOST_CONTACT_EVT:
922 case NODE_SYNCH_END_EVT:
923 case NODE_SYNCH_BEGIN_EVT:
924 case NODE_FAILOVER_BEGIN_EVT:
925 case NODE_FAILOVER_END_EVT:
930 case SELF_UP_PEER_COMING:
932 case PEER_ESTABL_CONTACT_EVT:
933 state = SELF_UP_PEER_UP;
935 case SELF_LOST_CONTACT_EVT:
936 state = SELF_DOWN_PEER_LEAVING;
938 case SELF_ESTABL_CONTACT_EVT:
939 case PEER_LOST_CONTACT_EVT:
940 case NODE_SYNCH_END_EVT:
941 case NODE_FAILOVER_BEGIN_EVT:
943 case NODE_SYNCH_BEGIN_EVT:
944 case NODE_FAILOVER_END_EVT:
949 case SELF_COMING_PEER_UP:
951 case SELF_ESTABL_CONTACT_EVT:
952 state = SELF_UP_PEER_UP;
954 case PEER_LOST_CONTACT_EVT:
955 state = SELF_LEAVING_PEER_DOWN;
957 case SELF_LOST_CONTACT_EVT:
958 case PEER_ESTABL_CONTACT_EVT:
960 case NODE_SYNCH_END_EVT:
961 case NODE_SYNCH_BEGIN_EVT:
962 case NODE_FAILOVER_BEGIN_EVT:
963 case NODE_FAILOVER_END_EVT:
968 case SELF_LEAVING_PEER_DOWN:
970 case SELF_LOST_CONTACT_EVT:
971 state = SELF_DOWN_PEER_DOWN;
973 case SELF_ESTABL_CONTACT_EVT:
974 case PEER_ESTABL_CONTACT_EVT:
975 case PEER_LOST_CONTACT_EVT:
977 case NODE_SYNCH_END_EVT:
978 case NODE_SYNCH_BEGIN_EVT:
979 case NODE_FAILOVER_BEGIN_EVT:
980 case NODE_FAILOVER_END_EVT:
985 case NODE_FAILINGOVER:
987 case SELF_LOST_CONTACT_EVT:
988 state = SELF_DOWN_PEER_LEAVING;
990 case PEER_LOST_CONTACT_EVT:
991 state = SELF_LEAVING_PEER_DOWN;
993 case NODE_FAILOVER_END_EVT:
994 state = SELF_UP_PEER_UP;
996 case NODE_FAILOVER_BEGIN_EVT:
997 case SELF_ESTABL_CONTACT_EVT:
998 case PEER_ESTABL_CONTACT_EVT:
1000 case NODE_SYNCH_BEGIN_EVT:
1001 case NODE_SYNCH_END_EVT:
1008 case SELF_LOST_CONTACT_EVT:
1009 state = SELF_DOWN_PEER_LEAVING;
1011 case PEER_LOST_CONTACT_EVT:
1012 state = SELF_LEAVING_PEER_DOWN;
1014 case NODE_SYNCH_END_EVT:
1015 state = SELF_UP_PEER_UP;
1017 case NODE_FAILOVER_BEGIN_EVT:
1018 state = NODE_FAILINGOVER;
1020 case NODE_SYNCH_BEGIN_EVT:
1021 case SELF_ESTABL_CONTACT_EVT:
1022 case PEER_ESTABL_CONTACT_EVT:
1024 case NODE_FAILOVER_END_EVT:
1030 pr_err("Unknown node fsm state %x\n", state);
1037 pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
1040 static void node_lost_contact(struct tipc_node *n,
1041 struct sk_buff_head *inputq)
1043 char addr_string[16];
1044 struct tipc_sock_conn *conn, *safe;
1045 struct tipc_link *l;
1046 struct list_head *conns = &n->conn_sks;
1047 struct sk_buff *skb;
1050 pr_debug("Lost contact with %s\n",
1051 tipc_addr_string_fill(addr_string, n->addr));
1053 /* Clean up broadcast state */
1054 tipc_bcast_remove_peer(n->net, n->bc_entry.link);
1056 /* Abort any ongoing link failover */
1057 for (i = 0; i < MAX_BEARERS; i++) {
1058 l = n->links[i].link;
1060 tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT);
1063 /* Notify publications from this node */
1064 n->action_flags |= TIPC_NOTIFY_NODE_DOWN;
1066 /* Notify sockets connected to node */
1067 list_for_each_entry_safe(conn, safe, conns, list) {
1068 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
1069 SHORT_H_SIZE, 0, tipc_own_addr(n->net),
1070 conn->peer_node, conn->port,
1071 conn->peer_port, TIPC_ERR_NO_NODE);
1073 skb_queue_tail(inputq, skb);
1074 list_del(&conn->list);
1080 * tipc_node_get_linkname - get the name of a link
1082 * @bearer_id: id of the bearer
1083 * @node: peer node address
1084 * @linkname: link name output buffer
1086 * Returns 0 on success
1088 int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
1089 char *linkname, size_t len)
1091 struct tipc_link *link;
1093 struct tipc_node *node = tipc_node_find(net, addr);
1098 if (bearer_id >= MAX_BEARERS)
1101 tipc_node_read_lock(node);
1102 link = node->links[bearer_id].link;
1104 strncpy(linkname, tipc_link_name(link), len);
1108 tipc_node_read_unlock(node);
1109 tipc_node_put(node);
1113 /* Caller should hold node lock for the passed node */
1114 static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
1117 struct nlattr *attrs;
1119 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
1120 NLM_F_MULTI, TIPC_NL_NODE_GET);
1124 attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE);
1128 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
1130 if (tipc_node_is_up(node))
1131 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
1134 nla_nest_end(msg->skb, attrs);
1135 genlmsg_end(msg->skb, hdr);
1140 nla_nest_cancel(msg->skb, attrs);
1142 genlmsg_cancel(msg->skb, hdr);
1148 * tipc_node_xmit() is the general link level function for message sending
1149 * @net: the applicable net namespace
1150 * @list: chain of buffers containing message
1151 * @dnode: address of destination node
1152 * @selector: a number used for deterministic link selection
1153 * Consumes the buffer chain, except when returning -ELINKCONG
1154 * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
1156 int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
1157 u32 dnode, int selector)
1159 struct tipc_link_entry *le = NULL;
1160 struct tipc_node *n;
1161 struct sk_buff_head xmitq;
1165 if (in_own_node(net, dnode)) {
1166 tipc_sk_rcv(net, list);
1170 n = tipc_node_find(net, dnode);
1172 skb_queue_purge(list);
1173 return -EHOSTUNREACH;
1176 tipc_node_read_lock(n);
1177 bearer_id = n->active_links[selector & 1];
1178 if (unlikely(bearer_id == INVALID_BEARER_ID)) {
1179 tipc_node_read_unlock(n);
1181 skb_queue_purge(list);
1182 return -EHOSTUNREACH;
1185 __skb_queue_head_init(&xmitq);
1186 le = &n->links[bearer_id];
1187 spin_lock_bh(&le->lock);
1188 rc = tipc_link_xmit(le->link, list, &xmitq);
1189 spin_unlock_bh(&le->lock);
1190 tipc_node_read_unlock(n);
1192 if (likely(rc == 0))
1193 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1194 else if (rc == -ENOBUFS)
1195 tipc_node_link_down(n, bearer_id, false);
1202 /* tipc_node_xmit_skb(): send single buffer to destination
1203 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1204 * messages, which will not be rejected
1205 * The only exception is datagram messages rerouted after secondary
1206 * lookup, which are rare and safe to dispose of anyway.
1207 * TODO: Return real return value, and let callers use
1208 * tipc_wait_for_sendpkt() where applicable
1210 int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
1213 struct sk_buff_head head;
1216 skb_queue_head_init(&head);
1217 __skb_queue_tail(&head, skb);
1218 rc = tipc_node_xmit(net, &head, dnode, selector);
1219 if (rc == -ELINKCONG)
1224 void tipc_node_broadcast(struct net *net, struct sk_buff *skb)
1226 struct sk_buff *txskb;
1227 struct tipc_node *n;
1231 list_for_each_entry_rcu(n, tipc_nodes(net), list) {
1233 if (in_own_node(net, dst))
1235 if (!tipc_node_is_up(n))
1237 txskb = pskb_copy(skb, GFP_ATOMIC);
1240 msg_set_destnode(buf_msg(txskb), dst);
1241 tipc_node_xmit_skb(net, txskb, dst, 0);
1249 * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1250 * @net: the applicable net namespace
1252 * @bearer_id: id of bearer message arrived on
1254 * Invoked with no locks held.
1256 static void tipc_node_bc_rcv(struct net *net, struct sk_buff *skb, int bearer_id)
1259 struct sk_buff_head xmitq;
1260 struct tipc_bclink_entry *be;
1261 struct tipc_link_entry *le;
1262 struct tipc_msg *hdr = buf_msg(skb);
1263 int usr = msg_user(hdr);
1264 u32 dnode = msg_destnode(hdr);
1265 struct tipc_node *n;
1267 __skb_queue_head_init(&xmitq);
1269 /* If NACK for other node, let rcv link for that node peek into it */
1270 if ((usr == BCAST_PROTOCOL) && (dnode != tipc_own_addr(net)))
1271 n = tipc_node_find(net, dnode);
1273 n = tipc_node_find(net, msg_prevnode(hdr));
1279 le = &n->links[bearer_id];
1281 rc = tipc_bcast_rcv(net, be->link, skb);
1283 /* Broadcast link reset may happen at reassembly failure */
1284 if (rc & TIPC_LINK_DOWN_EVT)
1285 tipc_node_reset_links(n);
1287 /* Broadcast ACKs are sent on a unicast link */
1288 if (rc & TIPC_LINK_SND_BC_ACK) {
1289 tipc_node_read_lock(n);
1290 tipc_link_build_state_msg(le->link, &xmitq);
1291 tipc_node_read_unlock(n);
1294 if (!skb_queue_empty(&xmitq))
1295 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1297 /* Deliver. 'arrvq' is under inputq2's lock protection */
1298 if (!skb_queue_empty(&be->inputq1)) {
1299 spin_lock_bh(&be->inputq2.lock);
1300 spin_lock_bh(&be->inputq1.lock);
1301 skb_queue_splice_tail_init(&be->inputq1, &be->arrvq);
1302 spin_unlock_bh(&be->inputq1.lock);
1303 spin_unlock_bh(&be->inputq2.lock);
1304 tipc_sk_mcast_rcv(net, &be->arrvq, &be->inputq2);
1310 * tipc_node_check_state - check and if necessary update node state
1312 * @bearer_id: identity of bearer delivering the packet
1313 * Returns true if state is ok, otherwise consumes buffer and returns false
1315 static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb,
1316 int bearer_id, struct sk_buff_head *xmitq)
1318 struct tipc_msg *hdr = buf_msg(skb);
1319 int usr = msg_user(hdr);
1320 int mtyp = msg_type(hdr);
1321 u16 oseqno = msg_seqno(hdr);
1322 u16 iseqno = msg_seqno(msg_get_wrapped(hdr));
1323 u16 exp_pkts = msg_msgcnt(hdr);
1324 u16 rcv_nxt, syncpt, dlv_nxt, inputq_len;
1325 int state = n->state;
1326 struct tipc_link *l, *tnl, *pl = NULL;
1327 struct tipc_media_addr *maddr;
1330 l = n->links[bearer_id].link;
1333 rcv_nxt = tipc_link_rcv_nxt(l);
1336 if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL)))
1339 /* Find parallel link, if any */
1340 for (pb_id = 0; pb_id < MAX_BEARERS; pb_id++) {
1341 if ((pb_id != bearer_id) && n->links[pb_id].link) {
1342 pl = n->links[pb_id].link;
1347 /* Check and update node accesibility if applicable */
1348 if (state == SELF_UP_PEER_COMING) {
1349 if (!tipc_link_is_up(l))
1351 if (!msg_peer_link_is_up(hdr))
1353 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
1356 if (state == SELF_DOWN_PEER_LEAVING) {
1357 if (msg_peer_node_is_up(hdr))
1359 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
1363 if (state == SELF_LEAVING_PEER_DOWN)
1366 /* Ignore duplicate packets */
1367 if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt))
1370 /* Initiate or update failover mode if applicable */
1371 if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) {
1372 syncpt = oseqno + exp_pkts - 1;
1373 if (pl && tipc_link_is_up(pl)) {
1374 __tipc_node_link_down(n, &pb_id, xmitq, &maddr);
1375 tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl),
1376 tipc_link_inputq(l));
1378 /* If pkts arrive out of order, use lowest calculated syncpt */
1379 if (less(syncpt, n->sync_point))
1380 n->sync_point = syncpt;
1383 /* Open parallel link when tunnel link reaches synch point */
1384 if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) {
1385 if (!more(rcv_nxt, n->sync_point))
1387 tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT);
1389 tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT);
1393 /* No synching needed if only one link */
1394 if (!pl || !tipc_link_is_up(pl))
1397 /* Initiate synch mode if applicable */
1398 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG) && (oseqno == 1)) {
1399 syncpt = iseqno + exp_pkts - 1;
1400 if (!tipc_link_is_up(l)) {
1401 tipc_link_fsm_evt(l, LINK_ESTABLISH_EVT);
1402 __tipc_node_link_up(n, bearer_id, xmitq);
1404 if (n->state == SELF_UP_PEER_UP) {
1405 n->sync_point = syncpt;
1406 tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT);
1407 tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT);
1411 /* Open tunnel link when parallel link reaches synch point */
1412 if (n->state == NODE_SYNCHING) {
1413 if (tipc_link_is_synching(l)) {
1419 inputq_len = skb_queue_len(tipc_link_inputq(pl));
1420 dlv_nxt = tipc_link_rcv_nxt(pl) - inputq_len;
1421 if (more(dlv_nxt, n->sync_point)) {
1422 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
1423 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
1428 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG))
1430 if (usr == LINK_PROTOCOL)
1438 * tipc_rcv - process TIPC packets/messages arriving from off-node
1439 * @net: the applicable net namespace
1441 * @bearer: pointer to bearer message arrived on
1443 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1444 * structure (i.e. cannot be NULL), but bearer can be inactive.
1446 void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
1448 struct sk_buff_head xmitq;
1449 struct tipc_node *n;
1450 struct tipc_msg *hdr = buf_msg(skb);
1451 int usr = msg_user(hdr);
1452 int bearer_id = b->identity;
1453 struct tipc_link_entry *le;
1454 u16 bc_ack = msg_bcast_ack(hdr);
1457 __skb_queue_head_init(&xmitq);
1459 /* Ensure message is well-formed */
1460 if (unlikely(!tipc_msg_validate(skb)))
1463 /* Handle arrival of discovery or broadcast packet */
1464 if (unlikely(msg_non_seq(hdr))) {
1465 if (unlikely(usr == LINK_CONFIG))
1466 return tipc_disc_rcv(net, skb, b);
1468 return tipc_node_bc_rcv(net, skb, bearer_id);
1471 /* Locate neighboring node that sent packet */
1472 n = tipc_node_find(net, msg_prevnode(hdr));
1475 le = &n->links[bearer_id];
1477 /* Ensure broadcast reception is in synch with peer's send state */
1478 if (unlikely(usr == LINK_PROTOCOL))
1479 tipc_bcast_sync_rcv(net, n->bc_entry.link, hdr);
1480 else if (unlikely(tipc_link_acked(n->bc_entry.link) != bc_ack))
1481 tipc_bcast_ack_rcv(net, n->bc_entry.link, bc_ack);
1483 /* Receive packet directly if conditions permit */
1484 tipc_node_read_lock(n);
1485 if (likely((n->state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) {
1486 spin_lock_bh(&le->lock);
1488 rc = tipc_link_rcv(le->link, skb, &xmitq);
1491 spin_unlock_bh(&le->lock);
1493 tipc_node_read_unlock(n);
1495 /* Check/update node state before receiving */
1496 if (unlikely(skb)) {
1497 tipc_node_write_lock(n);
1498 if (tipc_node_check_state(n, skb, bearer_id, &xmitq)) {
1500 rc = tipc_link_rcv(le->link, skb, &xmitq);
1504 tipc_node_write_unlock(n);
1507 if (unlikely(rc & TIPC_LINK_UP_EVT))
1508 tipc_node_link_up(n, bearer_id, &xmitq);
1510 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
1511 tipc_node_link_down(n, bearer_id, false);
1513 if (unlikely(!skb_queue_empty(&n->bc_entry.namedq)))
1514 tipc_named_rcv(net, &n->bc_entry.namedq);
1516 if (!skb_queue_empty(&le->inputq))
1517 tipc_sk_rcv(net, &le->inputq);
1519 if (!skb_queue_empty(&xmitq))
1520 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1527 int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
1530 struct net *net = sock_net(skb->sk);
1531 struct tipc_net *tn = net_generic(net, tipc_net_id);
1532 int done = cb->args[0];
1533 int last_addr = cb->args[1];
1534 struct tipc_node *node;
1535 struct tipc_nl_msg msg;
1541 msg.portid = NETLINK_CB(cb->skb).portid;
1542 msg.seq = cb->nlh->nlmsg_seq;
1546 node = tipc_node_find(net, last_addr);
1549 /* We never set seq or call nl_dump_check_consistent()
1550 * this means that setting prev_seq here will cause the
1551 * consistence check to fail in the netlink callback
1552 * handler. Resulting in the NLMSG_DONE message having
1553 * the NLM_F_DUMP_INTR flag set if the node state
1554 * changed while we released the lock.
1559 tipc_node_put(node);
1562 list_for_each_entry_rcu(node, &tn->node_list, list) {
1564 if (node->addr == last_addr)
1570 tipc_node_read_lock(node);
1571 err = __tipc_nl_add_node(&msg, node);
1573 last_addr = node->addr;
1574 tipc_node_read_unlock(node);
1578 tipc_node_read_unlock(node);
1583 cb->args[1] = last_addr;
1589 /* tipc_node_find_by_name - locate owner node of link by link's name
1590 * @net: the applicable net namespace
1591 * @name: pointer to link name string
1592 * @bearer_id: pointer to index in 'node->links' array where the link was found.
1594 * Returns pointer to node owning the link, or 0 if no matching link is found.
1596 static struct tipc_node *tipc_node_find_by_name(struct net *net,
1597 const char *link_name,
1598 unsigned int *bearer_id)
1600 struct tipc_net *tn = net_generic(net, tipc_net_id);
1601 struct tipc_link *l;
1602 struct tipc_node *n;
1603 struct tipc_node *found_node = NULL;
1608 list_for_each_entry_rcu(n, &tn->node_list, list) {
1609 tipc_node_read_lock(n);
1610 for (i = 0; i < MAX_BEARERS; i++) {
1611 l = n->links[i].link;
1612 if (l && !strcmp(tipc_link_name(l), link_name)) {
1618 tipc_node_read_unlock(n);
1627 int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info)
1633 struct tipc_link *link;
1634 struct tipc_node *node;
1635 struct sk_buff_head xmitq;
1636 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1637 struct net *net = sock_net(skb->sk);
1639 __skb_queue_head_init(&xmitq);
1641 if (!info->attrs[TIPC_NLA_LINK])
1644 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1645 info->attrs[TIPC_NLA_LINK],
1646 tipc_nl_link_policy);
1650 if (!attrs[TIPC_NLA_LINK_NAME])
1653 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
1655 if (strcmp(name, tipc_bclink_name) == 0)
1656 return tipc_nl_bc_link_set(net, attrs);
1658 node = tipc_node_find_by_name(net, name, &bearer_id);
1662 tipc_node_read_lock(node);
1664 link = node->links[bearer_id].link;
1670 if (attrs[TIPC_NLA_LINK_PROP]) {
1671 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
1673 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
1680 if (props[TIPC_NLA_PROP_TOL]) {
1683 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
1684 tipc_link_set_tolerance(link, tol, &xmitq);
1686 if (props[TIPC_NLA_PROP_PRIO]) {
1689 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
1690 tipc_link_set_prio(link, prio, &xmitq);
1692 if (props[TIPC_NLA_PROP_WIN]) {
1695 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
1696 tipc_link_set_queue_limits(link, win);
1701 tipc_node_read_unlock(node);
1702 tipc_bearer_xmit(net, bearer_id, &xmitq, &node->links[bearer_id].maddr);
1706 int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info)
1708 struct net *net = genl_info_net(info);
1709 struct tipc_nl_msg msg;
1713 msg.portid = info->snd_portid;
1714 msg.seq = info->snd_seq;
1716 if (!info->attrs[TIPC_NLA_LINK_NAME])
1718 name = nla_data(info->attrs[TIPC_NLA_LINK_NAME]);
1720 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
1724 if (strcmp(name, tipc_bclink_name) == 0) {
1725 err = tipc_nl_add_bc_link(net, &msg);
1727 nlmsg_free(msg.skb);
1732 struct tipc_node *node;
1733 struct tipc_link *link;
1735 node = tipc_node_find_by_name(net, name, &bearer_id);
1739 tipc_node_read_lock(node);
1740 link = node->links[bearer_id].link;
1742 tipc_node_read_unlock(node);
1743 nlmsg_free(msg.skb);
1747 err = __tipc_nl_add_link(net, &msg, link, 0);
1748 tipc_node_read_unlock(node);
1750 nlmsg_free(msg.skb);
1755 return genlmsg_reply(msg.skb, info);
1758 int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info)
1762 unsigned int bearer_id;
1763 struct tipc_link *link;
1764 struct tipc_node *node;
1765 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1766 struct net *net = sock_net(skb->sk);
1767 struct tipc_link_entry *le;
1769 if (!info->attrs[TIPC_NLA_LINK])
1772 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1773 info->attrs[TIPC_NLA_LINK],
1774 tipc_nl_link_policy);
1778 if (!attrs[TIPC_NLA_LINK_NAME])
1781 link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
1783 if (strcmp(link_name, tipc_bclink_name) == 0) {
1784 err = tipc_bclink_reset_stats(net);
1790 node = tipc_node_find_by_name(net, link_name, &bearer_id);
1794 le = &node->links[bearer_id];
1795 tipc_node_read_lock(node);
1796 spin_lock_bh(&le->lock);
1797 link = node->links[bearer_id].link;
1799 spin_unlock_bh(&le->lock);
1800 tipc_node_read_unlock(node);
1803 tipc_link_reset_stats(link);
1804 spin_unlock_bh(&le->lock);
1805 tipc_node_read_unlock(node);
1809 /* Caller should hold node lock */
1810 static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
1811 struct tipc_node *node, u32 *prev_link)
1816 for (i = *prev_link; i < MAX_BEARERS; i++) {
1819 if (!node->links[i].link)
1822 err = __tipc_nl_add_link(net, msg,
1823 node->links[i].link, NLM_F_MULTI);
1832 int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb)
1834 struct net *net = sock_net(skb->sk);
1835 struct tipc_net *tn = net_generic(net, tipc_net_id);
1836 struct tipc_node *node;
1837 struct tipc_nl_msg msg;
1838 u32 prev_node = cb->args[0];
1839 u32 prev_link = cb->args[1];
1840 int done = cb->args[2];
1847 msg.portid = NETLINK_CB(cb->skb).portid;
1848 msg.seq = cb->nlh->nlmsg_seq;
1852 node = tipc_node_find(net, prev_node);
1854 /* We never set seq or call nl_dump_check_consistent()
1855 * this means that setting prev_seq here will cause the
1856 * consistence check to fail in the netlink callback
1857 * handler. Resulting in the last NLMSG_DONE message
1858 * having the NLM_F_DUMP_INTR flag set.
1863 tipc_node_put(node);
1865 list_for_each_entry_continue_rcu(node, &tn->node_list,
1867 tipc_node_read_lock(node);
1868 err = __tipc_nl_add_node_links(net, &msg, node,
1870 tipc_node_read_unlock(node);
1874 prev_node = node->addr;
1877 err = tipc_nl_add_bc_link(net, &msg);
1881 list_for_each_entry_rcu(node, &tn->node_list, list) {
1882 tipc_node_read_lock(node);
1883 err = __tipc_nl_add_node_links(net, &msg, node,
1885 tipc_node_read_unlock(node);
1889 prev_node = node->addr;
1896 cb->args[0] = prev_node;
1897 cb->args[1] = prev_link;