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_bcast_add_peer(n->net, nl, xmitq);
561 /* Second link => redistribute slots */
562 if (tipc_link_prio(nl) > tipc_link_prio(ol)) {
563 pr_debug("Old link <%s> becomes standby\n", tipc_link_name(ol));
566 tipc_link_set_active(nl, true);
567 tipc_link_set_active(ol, false);
568 } else if (tipc_link_prio(nl) == tipc_link_prio(ol)) {
569 tipc_link_set_active(nl, true);
572 pr_debug("New link <%s> is standby\n", tipc_link_name(nl));
575 /* Prepare synchronization with first link */
576 tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq);
580 * tipc_node_link_up - handle addition of link
582 * Link becomes active (alone or shared) or standby, depending on its priority.
584 static void tipc_node_link_up(struct tipc_node *n, int bearer_id,
585 struct sk_buff_head *xmitq)
587 struct tipc_media_addr *maddr;
589 tipc_node_write_lock(n);
590 __tipc_node_link_up(n, bearer_id, xmitq);
591 maddr = &n->links[bearer_id].maddr;
592 tipc_bearer_xmit(n->net, bearer_id, xmitq, maddr);
593 tipc_node_write_unlock(n);
597 * __tipc_node_link_down - handle loss of link
599 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
600 struct sk_buff_head *xmitq,
601 struct tipc_media_addr **maddr)
603 struct tipc_link_entry *le = &n->links[*bearer_id];
604 int *slot0 = &n->active_links[0];
605 int *slot1 = &n->active_links[1];
606 int i, highest = 0, prio;
607 struct tipc_link *l, *_l, *tnl;
609 l = n->links[*bearer_id].link;
610 if (!l || tipc_link_is_reset(l))
614 n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
615 n->link_id = tipc_link_id(l);
617 tipc_bearer_remove_dest(n->net, *bearer_id, n->addr);
619 pr_debug("Lost link <%s> on network plane %c\n",
620 tipc_link_name(l), tipc_link_plane(l));
622 /* Select new active link if any available */
623 *slot0 = INVALID_BEARER_ID;
624 *slot1 = INVALID_BEARER_ID;
625 for (i = 0; i < MAX_BEARERS; i++) {
626 _l = n->links[i].link;
627 if (!_l || !tipc_link_is_up(_l))
631 prio = tipc_link_prio(_l);
634 if (prio > highest) {
643 if (!tipc_node_is_up(n)) {
644 if (tipc_link_peer_is_down(l))
645 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
646 tipc_node_fsm_evt(n, SELF_LOST_CONTACT_EVT);
647 tipc_link_fsm_evt(l, LINK_RESET_EVT);
649 tipc_link_build_reset_msg(l, xmitq);
650 *maddr = &n->links[*bearer_id].maddr;
651 node_lost_contact(n, &le->inputq);
652 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
655 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
657 /* There is still a working link => initiate failover */
658 *bearer_id = n->active_links[0];
659 tnl = n->links[*bearer_id].link;
660 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
661 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
662 n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
663 tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, xmitq);
665 tipc_link_fsm_evt(l, LINK_RESET_EVT);
666 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
667 tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
668 *maddr = &n->links[*bearer_id].maddr;
671 static void tipc_node_link_down(struct tipc_node *n, int bearer_id, bool delete)
673 struct tipc_link_entry *le = &n->links[bearer_id];
674 struct tipc_link *l = le->link;
675 struct tipc_media_addr *maddr;
676 struct sk_buff_head xmitq;
681 __skb_queue_head_init(&xmitq);
683 tipc_node_write_lock(n);
684 if (!tipc_link_is_establishing(l)) {
685 __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr);
692 /* Defuse pending tipc_node_link_up() */
693 tipc_link_fsm_evt(l, LINK_RESET_EVT);
695 tipc_node_write_unlock(n);
696 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr);
697 tipc_sk_rcv(n->net, &le->inputq);
700 static bool tipc_node_is_up(struct tipc_node *n)
702 return n->active_links[0] != INVALID_BEARER_ID;
705 void tipc_node_check_dest(struct net *net, u32 onode,
706 struct tipc_bearer *b,
707 u16 capabilities, u32 signature,
708 struct tipc_media_addr *maddr,
709 bool *respond, bool *dupl_addr)
713 struct tipc_link_entry *le;
714 bool addr_match = false;
715 bool sign_match = false;
716 bool link_up = false;
717 bool accept_addr = false;
724 n = tipc_node_create(net, onode, capabilities);
728 tipc_node_write_lock(n);
730 le = &n->links[b->identity];
732 /* Prepare to validate requesting node's signature and media address */
734 link_up = l && tipc_link_is_up(l);
735 addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr));
736 sign_match = (signature == n->signature);
738 /* These three flags give us eight permutations: */
740 if (sign_match && addr_match && link_up) {
741 /* All is fine. Do nothing. */
743 } else if (sign_match && addr_match && !link_up) {
744 /* Respond. The link will come up in due time */
746 } else if (sign_match && !addr_match && link_up) {
747 /* Peer has changed i/f address without rebooting.
748 * If so, the link will reset soon, and the next
749 * discovery will be accepted. So we can ignore it.
750 * It may also be an cloned or malicious peer having
751 * chosen the same node address and signature as an
753 * Ignore requests until the link goes down, if ever.
756 } else if (sign_match && !addr_match && !link_up) {
757 /* Peer link has changed i/f address without rebooting.
758 * It may also be a cloned or malicious peer; we can't
759 * distinguish between the two.
760 * The signature is correct, so we must accept.
764 } else if (!sign_match && addr_match && link_up) {
765 /* Peer node rebooted. Two possibilities:
766 * - Delayed re-discovery; this link endpoint has already
767 * reset and re-established contact with the peer, before
768 * receiving a discovery message from that node.
769 * (The peer happened to receive one from this node first).
770 * - The peer came back so fast that our side has not
771 * discovered it yet. Probing from this side will soon
772 * reset the link, since there can be no working link
773 * endpoint at the peer end, and the link will re-establish.
774 * Accept the signature, since it comes from a known peer.
776 n->signature = signature;
777 } else if (!sign_match && addr_match && !link_up) {
778 /* The peer node has rebooted.
779 * Accept signature, since it is a known peer.
781 n->signature = signature;
783 } else if (!sign_match && !addr_match && link_up) {
784 /* Peer rebooted with new address, or a new/duplicate peer.
785 * Ignore until the link goes down, if ever.
788 } else if (!sign_match && !addr_match && !link_up) {
789 /* Peer rebooted with new address, or it is a new peer.
790 * Accept signature and address.
792 n->signature = signature;
800 /* Now create new link if not already existing */
802 if (n->link_cnt == 2) {
803 pr_warn("Cannot establish 3rd link to %x\n", n->addr);
806 if_name = strchr(b->name, ':') + 1;
807 if (!tipc_link_create(net, if_name, b->identity, b->tolerance,
808 b->net_plane, b->mtu, b->priority,
809 b->window, mod(tipc_net(net)->random),
810 tipc_own_addr(net), onode,
812 tipc_bc_sndlink(n->net), n->bc_entry.link,
814 &n->bc_entry.namedq, &l)) {
819 tipc_link_fsm_evt(l, LINK_RESET_EVT);
820 if (n->state == NODE_FAILINGOVER)
821 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
824 tipc_node_calculate_timer(n, l);
825 if (n->link_cnt == 1)
826 if (!mod_timer(&n->timer, jiffies + n->keepalive_intv))
829 memcpy(&le->maddr, maddr, sizeof(*maddr));
831 tipc_node_write_unlock(n);
832 if (reset && l && !tipc_link_is_reset(l))
833 tipc_node_link_down(n, b->identity, false);
837 void tipc_node_delete_links(struct net *net, int bearer_id)
839 struct tipc_net *tn = net_generic(net, tipc_net_id);
843 list_for_each_entry_rcu(n, &tn->node_list, list) {
844 tipc_node_link_down(n, bearer_id, true);
849 static void tipc_node_reset_links(struct tipc_node *n)
851 char addr_string[16];
854 pr_warn("Resetting all links to %s\n",
855 tipc_addr_string_fill(addr_string, n->addr));
857 for (i = 0; i < MAX_BEARERS; i++) {
858 tipc_node_link_down(n, i, false);
862 /* tipc_node_fsm_evt - node finite state machine
863 * Determines when contact is allowed with peer node
865 static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
867 int state = n->state;
870 case SELF_DOWN_PEER_DOWN:
872 case SELF_ESTABL_CONTACT_EVT:
873 state = SELF_UP_PEER_COMING;
875 case PEER_ESTABL_CONTACT_EVT:
876 state = SELF_COMING_PEER_UP;
878 case SELF_LOST_CONTACT_EVT:
879 case PEER_LOST_CONTACT_EVT:
881 case NODE_SYNCH_END_EVT:
882 case NODE_SYNCH_BEGIN_EVT:
883 case NODE_FAILOVER_BEGIN_EVT:
884 case NODE_FAILOVER_END_EVT:
889 case SELF_UP_PEER_UP:
891 case SELF_LOST_CONTACT_EVT:
892 state = SELF_DOWN_PEER_LEAVING;
894 case PEER_LOST_CONTACT_EVT:
895 state = SELF_LEAVING_PEER_DOWN;
897 case NODE_SYNCH_BEGIN_EVT:
898 state = NODE_SYNCHING;
900 case NODE_FAILOVER_BEGIN_EVT:
901 state = NODE_FAILINGOVER;
903 case SELF_ESTABL_CONTACT_EVT:
904 case PEER_ESTABL_CONTACT_EVT:
905 case NODE_SYNCH_END_EVT:
906 case NODE_FAILOVER_END_EVT:
912 case SELF_DOWN_PEER_LEAVING:
914 case PEER_LOST_CONTACT_EVT:
915 state = SELF_DOWN_PEER_DOWN;
917 case SELF_ESTABL_CONTACT_EVT:
918 case PEER_ESTABL_CONTACT_EVT:
919 case SELF_LOST_CONTACT_EVT:
921 case NODE_SYNCH_END_EVT:
922 case NODE_SYNCH_BEGIN_EVT:
923 case NODE_FAILOVER_BEGIN_EVT:
924 case NODE_FAILOVER_END_EVT:
929 case SELF_UP_PEER_COMING:
931 case PEER_ESTABL_CONTACT_EVT:
932 state = SELF_UP_PEER_UP;
934 case SELF_LOST_CONTACT_EVT:
935 state = SELF_DOWN_PEER_LEAVING;
937 case SELF_ESTABL_CONTACT_EVT:
938 case PEER_LOST_CONTACT_EVT:
939 case NODE_SYNCH_END_EVT:
940 case NODE_FAILOVER_BEGIN_EVT:
942 case NODE_SYNCH_BEGIN_EVT:
943 case NODE_FAILOVER_END_EVT:
948 case SELF_COMING_PEER_UP:
950 case SELF_ESTABL_CONTACT_EVT:
951 state = SELF_UP_PEER_UP;
953 case PEER_LOST_CONTACT_EVT:
954 state = SELF_LEAVING_PEER_DOWN;
956 case SELF_LOST_CONTACT_EVT:
957 case PEER_ESTABL_CONTACT_EVT:
959 case NODE_SYNCH_END_EVT:
960 case NODE_SYNCH_BEGIN_EVT:
961 case NODE_FAILOVER_BEGIN_EVT:
962 case NODE_FAILOVER_END_EVT:
967 case SELF_LEAVING_PEER_DOWN:
969 case SELF_LOST_CONTACT_EVT:
970 state = SELF_DOWN_PEER_DOWN;
972 case SELF_ESTABL_CONTACT_EVT:
973 case PEER_ESTABL_CONTACT_EVT:
974 case PEER_LOST_CONTACT_EVT:
976 case NODE_SYNCH_END_EVT:
977 case NODE_SYNCH_BEGIN_EVT:
978 case NODE_FAILOVER_BEGIN_EVT:
979 case NODE_FAILOVER_END_EVT:
984 case NODE_FAILINGOVER:
986 case SELF_LOST_CONTACT_EVT:
987 state = SELF_DOWN_PEER_LEAVING;
989 case PEER_LOST_CONTACT_EVT:
990 state = SELF_LEAVING_PEER_DOWN;
992 case NODE_FAILOVER_END_EVT:
993 state = SELF_UP_PEER_UP;
995 case NODE_FAILOVER_BEGIN_EVT:
996 case SELF_ESTABL_CONTACT_EVT:
997 case PEER_ESTABL_CONTACT_EVT:
999 case NODE_SYNCH_BEGIN_EVT:
1000 case NODE_SYNCH_END_EVT:
1007 case SELF_LOST_CONTACT_EVT:
1008 state = SELF_DOWN_PEER_LEAVING;
1010 case PEER_LOST_CONTACT_EVT:
1011 state = SELF_LEAVING_PEER_DOWN;
1013 case NODE_SYNCH_END_EVT:
1014 state = SELF_UP_PEER_UP;
1016 case NODE_FAILOVER_BEGIN_EVT:
1017 state = NODE_FAILINGOVER;
1019 case NODE_SYNCH_BEGIN_EVT:
1020 case SELF_ESTABL_CONTACT_EVT:
1021 case PEER_ESTABL_CONTACT_EVT:
1023 case NODE_FAILOVER_END_EVT:
1029 pr_err("Unknown node fsm state %x\n", state);
1036 pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
1039 static void node_lost_contact(struct tipc_node *n,
1040 struct sk_buff_head *inputq)
1042 char addr_string[16];
1043 struct tipc_sock_conn *conn, *safe;
1044 struct tipc_link *l;
1045 struct list_head *conns = &n->conn_sks;
1046 struct sk_buff *skb;
1049 pr_debug("Lost contact with %s\n",
1050 tipc_addr_string_fill(addr_string, n->addr));
1052 /* Clean up broadcast state */
1053 tipc_bcast_remove_peer(n->net, n->bc_entry.link);
1055 /* Abort any ongoing link failover */
1056 for (i = 0; i < MAX_BEARERS; i++) {
1057 l = n->links[i].link;
1059 tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT);
1062 /* Notify publications from this node */
1063 n->action_flags |= TIPC_NOTIFY_NODE_DOWN;
1065 /* Notify sockets connected to node */
1066 list_for_each_entry_safe(conn, safe, conns, list) {
1067 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
1068 SHORT_H_SIZE, 0, tipc_own_addr(n->net),
1069 conn->peer_node, conn->port,
1070 conn->peer_port, TIPC_ERR_NO_NODE);
1072 skb_queue_tail(inputq, skb);
1073 list_del(&conn->list);
1079 * tipc_node_get_linkname - get the name of a link
1081 * @bearer_id: id of the bearer
1082 * @node: peer node address
1083 * @linkname: link name output buffer
1085 * Returns 0 on success
1087 int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
1088 char *linkname, size_t len)
1090 struct tipc_link *link;
1092 struct tipc_node *node = tipc_node_find(net, addr);
1097 if (bearer_id >= MAX_BEARERS)
1100 tipc_node_read_lock(node);
1101 link = node->links[bearer_id].link;
1103 strncpy(linkname, tipc_link_name(link), len);
1107 tipc_node_read_unlock(node);
1108 tipc_node_put(node);
1112 /* Caller should hold node lock for the passed node */
1113 static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
1116 struct nlattr *attrs;
1118 hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
1119 NLM_F_MULTI, TIPC_NL_NODE_GET);
1123 attrs = nla_nest_start(msg->skb, TIPC_NLA_NODE);
1127 if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
1129 if (tipc_node_is_up(node))
1130 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
1133 nla_nest_end(msg->skb, attrs);
1134 genlmsg_end(msg->skb, hdr);
1139 nla_nest_cancel(msg->skb, attrs);
1141 genlmsg_cancel(msg->skb, hdr);
1147 * tipc_node_xmit() is the general link level function for message sending
1148 * @net: the applicable net namespace
1149 * @list: chain of buffers containing message
1150 * @dnode: address of destination node
1151 * @selector: a number used for deterministic link selection
1152 * Consumes the buffer chain, except when returning -ELINKCONG
1153 * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
1155 int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
1156 u32 dnode, int selector)
1158 struct tipc_link_entry *le = NULL;
1159 struct tipc_node *n;
1160 struct sk_buff_head xmitq;
1164 if (in_own_node(net, dnode)) {
1165 tipc_sk_rcv(net, list);
1169 n = tipc_node_find(net, dnode);
1171 skb_queue_purge(list);
1172 return -EHOSTUNREACH;
1175 tipc_node_read_lock(n);
1176 bearer_id = n->active_links[selector & 1];
1177 if (unlikely(bearer_id == INVALID_BEARER_ID)) {
1178 tipc_node_read_unlock(n);
1180 skb_queue_purge(list);
1181 return -EHOSTUNREACH;
1184 __skb_queue_head_init(&xmitq);
1185 le = &n->links[bearer_id];
1186 spin_lock_bh(&le->lock);
1187 rc = tipc_link_xmit(le->link, list, &xmitq);
1188 spin_unlock_bh(&le->lock);
1189 tipc_node_read_unlock(n);
1191 if (likely(rc == 0))
1192 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1193 else if (rc == -ENOBUFS)
1194 tipc_node_link_down(n, bearer_id, false);
1201 /* tipc_node_xmit_skb(): send single buffer to destination
1202 * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1203 * messages, which will not be rejected
1204 * The only exception is datagram messages rerouted after secondary
1205 * lookup, which are rare and safe to dispose of anyway.
1206 * TODO: Return real return value, and let callers use
1207 * tipc_wait_for_sendpkt() where applicable
1209 int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
1212 struct sk_buff_head head;
1215 skb_queue_head_init(&head);
1216 __skb_queue_tail(&head, skb);
1217 rc = tipc_node_xmit(net, &head, dnode, selector);
1218 if (rc == -ELINKCONG)
1223 void tipc_node_broadcast(struct net *net, struct sk_buff *skb)
1225 struct sk_buff *txskb;
1226 struct tipc_node *n;
1230 list_for_each_entry_rcu(n, tipc_nodes(net), list) {
1232 if (in_own_node(net, dst))
1234 if (!tipc_node_is_up(n))
1236 txskb = pskb_copy(skb, GFP_ATOMIC);
1239 msg_set_destnode(buf_msg(txskb), dst);
1240 tipc_node_xmit_skb(net, txskb, dst, 0);
1248 * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1249 * @net: the applicable net namespace
1251 * @bearer_id: id of bearer message arrived on
1253 * Invoked with no locks held.
1255 static void tipc_node_bc_rcv(struct net *net, struct sk_buff *skb, int bearer_id)
1258 struct sk_buff_head xmitq;
1259 struct tipc_bclink_entry *be;
1260 struct tipc_link_entry *le;
1261 struct tipc_msg *hdr = buf_msg(skb);
1262 int usr = msg_user(hdr);
1263 u32 dnode = msg_destnode(hdr);
1264 struct tipc_node *n;
1266 __skb_queue_head_init(&xmitq);
1268 /* If NACK for other node, let rcv link for that node peek into it */
1269 if ((usr == BCAST_PROTOCOL) && (dnode != tipc_own_addr(net)))
1270 n = tipc_node_find(net, dnode);
1272 n = tipc_node_find(net, msg_prevnode(hdr));
1278 le = &n->links[bearer_id];
1280 rc = tipc_bcast_rcv(net, be->link, skb);
1282 /* Broadcast link reset may happen at reassembly failure */
1283 if (rc & TIPC_LINK_DOWN_EVT)
1284 tipc_node_reset_links(n);
1286 /* Broadcast ACKs are sent on a unicast link */
1287 if (rc & TIPC_LINK_SND_BC_ACK) {
1288 tipc_node_read_lock(n);
1289 tipc_link_build_state_msg(le->link, &xmitq);
1290 tipc_node_read_unlock(n);
1293 if (!skb_queue_empty(&xmitq))
1294 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1296 /* Deliver. 'arrvq' is under inputq2's lock protection */
1297 if (!skb_queue_empty(&be->inputq1)) {
1298 spin_lock_bh(&be->inputq2.lock);
1299 spin_lock_bh(&be->inputq1.lock);
1300 skb_queue_splice_tail_init(&be->inputq1, &be->arrvq);
1301 spin_unlock_bh(&be->inputq1.lock);
1302 spin_unlock_bh(&be->inputq2.lock);
1303 tipc_sk_mcast_rcv(net, &be->arrvq, &be->inputq2);
1309 * tipc_node_check_state - check and if necessary update node state
1311 * @bearer_id: identity of bearer delivering the packet
1312 * Returns true if state is ok, otherwise consumes buffer and returns false
1314 static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb,
1315 int bearer_id, struct sk_buff_head *xmitq)
1317 struct tipc_msg *hdr = buf_msg(skb);
1318 int usr = msg_user(hdr);
1319 int mtyp = msg_type(hdr);
1320 u16 oseqno = msg_seqno(hdr);
1321 u16 iseqno = msg_seqno(msg_get_wrapped(hdr));
1322 u16 exp_pkts = msg_msgcnt(hdr);
1323 u16 rcv_nxt, syncpt, dlv_nxt, inputq_len;
1324 int state = n->state;
1325 struct tipc_link *l, *tnl, *pl = NULL;
1326 struct tipc_media_addr *maddr;
1329 l = n->links[bearer_id].link;
1332 rcv_nxt = tipc_link_rcv_nxt(l);
1335 if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL)))
1338 /* Find parallel link, if any */
1339 for (pb_id = 0; pb_id < MAX_BEARERS; pb_id++) {
1340 if ((pb_id != bearer_id) && n->links[pb_id].link) {
1341 pl = n->links[pb_id].link;
1346 /* Check and update node accesibility if applicable */
1347 if (state == SELF_UP_PEER_COMING) {
1348 if (!tipc_link_is_up(l))
1350 if (!msg_peer_link_is_up(hdr))
1352 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
1355 if (state == SELF_DOWN_PEER_LEAVING) {
1356 if (msg_peer_node_is_up(hdr))
1358 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
1362 if (state == SELF_LEAVING_PEER_DOWN)
1365 /* Ignore duplicate packets */
1366 if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt))
1369 /* Initiate or update failover mode if applicable */
1370 if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) {
1371 syncpt = oseqno + exp_pkts - 1;
1372 if (pl && tipc_link_is_up(pl)) {
1373 __tipc_node_link_down(n, &pb_id, xmitq, &maddr);
1374 tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl),
1375 tipc_link_inputq(l));
1377 /* If pkts arrive out of order, use lowest calculated syncpt */
1378 if (less(syncpt, n->sync_point))
1379 n->sync_point = syncpt;
1382 /* Open parallel link when tunnel link reaches synch point */
1383 if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) {
1384 if (!more(rcv_nxt, n->sync_point))
1386 tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT);
1388 tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT);
1392 /* No synching needed if only one link */
1393 if (!pl || !tipc_link_is_up(pl))
1396 /* Initiate synch mode if applicable */
1397 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG) && (oseqno == 1)) {
1398 syncpt = iseqno + exp_pkts - 1;
1399 if (!tipc_link_is_up(l)) {
1400 tipc_link_fsm_evt(l, LINK_ESTABLISH_EVT);
1401 __tipc_node_link_up(n, bearer_id, xmitq);
1403 if (n->state == SELF_UP_PEER_UP) {
1404 n->sync_point = syncpt;
1405 tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT);
1406 tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT);
1410 /* Open tunnel link when parallel link reaches synch point */
1411 if (n->state == NODE_SYNCHING) {
1412 if (tipc_link_is_synching(l)) {
1418 inputq_len = skb_queue_len(tipc_link_inputq(pl));
1419 dlv_nxt = tipc_link_rcv_nxt(pl) - inputq_len;
1420 if (more(dlv_nxt, n->sync_point)) {
1421 tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
1422 tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
1427 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG))
1429 if (usr == LINK_PROTOCOL)
1437 * tipc_rcv - process TIPC packets/messages arriving from off-node
1438 * @net: the applicable net namespace
1440 * @bearer: pointer to bearer message arrived on
1442 * Invoked with no locks held. Bearer pointer must point to a valid bearer
1443 * structure (i.e. cannot be NULL), but bearer can be inactive.
1445 void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
1447 struct sk_buff_head xmitq;
1448 struct tipc_node *n;
1449 struct tipc_msg *hdr = buf_msg(skb);
1450 int usr = msg_user(hdr);
1451 int bearer_id = b->identity;
1452 struct tipc_link_entry *le;
1453 u16 bc_ack = msg_bcast_ack(hdr);
1456 __skb_queue_head_init(&xmitq);
1458 /* Ensure message is well-formed */
1459 if (unlikely(!tipc_msg_validate(skb)))
1462 /* Handle arrival of discovery or broadcast packet */
1463 if (unlikely(msg_non_seq(hdr))) {
1464 if (unlikely(usr == LINK_CONFIG))
1465 return tipc_disc_rcv(net, skb, b);
1467 return tipc_node_bc_rcv(net, skb, bearer_id);
1470 /* Locate neighboring node that sent packet */
1471 n = tipc_node_find(net, msg_prevnode(hdr));
1474 le = &n->links[bearer_id];
1476 /* Ensure broadcast reception is in synch with peer's send state */
1477 if (unlikely(usr == LINK_PROTOCOL))
1478 tipc_bcast_sync_rcv(net, n->bc_entry.link, hdr);
1479 else if (unlikely(tipc_link_acked(n->bc_entry.link) != bc_ack))
1480 tipc_bcast_ack_rcv(net, n->bc_entry.link, bc_ack);
1482 /* Receive packet directly if conditions permit */
1483 tipc_node_read_lock(n);
1484 if (likely((n->state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) {
1485 spin_lock_bh(&le->lock);
1487 rc = tipc_link_rcv(le->link, skb, &xmitq);
1490 spin_unlock_bh(&le->lock);
1492 tipc_node_read_unlock(n);
1494 /* Check/update node state before receiving */
1495 if (unlikely(skb)) {
1496 tipc_node_write_lock(n);
1497 if (tipc_node_check_state(n, skb, bearer_id, &xmitq)) {
1499 rc = tipc_link_rcv(le->link, skb, &xmitq);
1503 tipc_node_write_unlock(n);
1506 if (unlikely(rc & TIPC_LINK_UP_EVT))
1507 tipc_node_link_up(n, bearer_id, &xmitq);
1509 if (unlikely(rc & TIPC_LINK_DOWN_EVT))
1510 tipc_node_link_down(n, bearer_id, false);
1512 if (unlikely(!skb_queue_empty(&n->bc_entry.namedq)))
1513 tipc_named_rcv(net, &n->bc_entry.namedq);
1515 if (!skb_queue_empty(&le->inputq))
1516 tipc_sk_rcv(net, &le->inputq);
1518 if (!skb_queue_empty(&xmitq))
1519 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1526 int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
1529 struct net *net = sock_net(skb->sk);
1530 struct tipc_net *tn = net_generic(net, tipc_net_id);
1531 int done = cb->args[0];
1532 int last_addr = cb->args[1];
1533 struct tipc_node *node;
1534 struct tipc_nl_msg msg;
1540 msg.portid = NETLINK_CB(cb->skb).portid;
1541 msg.seq = cb->nlh->nlmsg_seq;
1545 node = tipc_node_find(net, last_addr);
1548 /* We never set seq or call nl_dump_check_consistent()
1549 * this means that setting prev_seq here will cause the
1550 * consistence check to fail in the netlink callback
1551 * handler. Resulting in the NLMSG_DONE message having
1552 * the NLM_F_DUMP_INTR flag set if the node state
1553 * changed while we released the lock.
1558 tipc_node_put(node);
1561 list_for_each_entry_rcu(node, &tn->node_list, list) {
1563 if (node->addr == last_addr)
1569 tipc_node_read_lock(node);
1570 err = __tipc_nl_add_node(&msg, node);
1572 last_addr = node->addr;
1573 tipc_node_read_unlock(node);
1577 tipc_node_read_unlock(node);
1582 cb->args[1] = last_addr;
1588 /* tipc_node_find_by_name - locate owner node of link by link's name
1589 * @net: the applicable net namespace
1590 * @name: pointer to link name string
1591 * @bearer_id: pointer to index in 'node->links' array where the link was found.
1593 * Returns pointer to node owning the link, or 0 if no matching link is found.
1595 static struct tipc_node *tipc_node_find_by_name(struct net *net,
1596 const char *link_name,
1597 unsigned int *bearer_id)
1599 struct tipc_net *tn = net_generic(net, tipc_net_id);
1600 struct tipc_link *l;
1601 struct tipc_node *n;
1602 struct tipc_node *found_node = NULL;
1607 list_for_each_entry_rcu(n, &tn->node_list, list) {
1608 tipc_node_read_lock(n);
1609 for (i = 0; i < MAX_BEARERS; i++) {
1610 l = n->links[i].link;
1611 if (l && !strcmp(tipc_link_name(l), link_name)) {
1617 tipc_node_read_unlock(n);
1626 int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info)
1632 struct tipc_link *link;
1633 struct tipc_node *node;
1634 struct sk_buff_head xmitq;
1635 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1636 struct net *net = sock_net(skb->sk);
1638 __skb_queue_head_init(&xmitq);
1640 if (!info->attrs[TIPC_NLA_LINK])
1643 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1644 info->attrs[TIPC_NLA_LINK],
1645 tipc_nl_link_policy);
1649 if (!attrs[TIPC_NLA_LINK_NAME])
1652 name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
1654 if (strcmp(name, tipc_bclink_name) == 0)
1655 return tipc_nl_bc_link_set(net, attrs);
1657 node = tipc_node_find_by_name(net, name, &bearer_id);
1661 tipc_node_read_lock(node);
1663 link = node->links[bearer_id].link;
1669 if (attrs[TIPC_NLA_LINK_PROP]) {
1670 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
1672 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
1679 if (props[TIPC_NLA_PROP_TOL]) {
1682 tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
1683 tipc_link_set_tolerance(link, tol, &xmitq);
1685 if (props[TIPC_NLA_PROP_PRIO]) {
1688 prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
1689 tipc_link_set_prio(link, prio, &xmitq);
1691 if (props[TIPC_NLA_PROP_WIN]) {
1694 win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
1695 tipc_link_set_queue_limits(link, win);
1700 tipc_node_read_unlock(node);
1701 tipc_bearer_xmit(net, bearer_id, &xmitq, &node->links[bearer_id].maddr);
1705 int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info)
1707 struct net *net = genl_info_net(info);
1708 struct tipc_nl_msg msg;
1712 msg.portid = info->snd_portid;
1713 msg.seq = info->snd_seq;
1715 if (!info->attrs[TIPC_NLA_LINK_NAME])
1717 name = nla_data(info->attrs[TIPC_NLA_LINK_NAME]);
1719 msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
1723 if (strcmp(name, tipc_bclink_name) == 0) {
1724 err = tipc_nl_add_bc_link(net, &msg);
1726 nlmsg_free(msg.skb);
1731 struct tipc_node *node;
1732 struct tipc_link *link;
1734 node = tipc_node_find_by_name(net, name, &bearer_id);
1738 tipc_node_read_lock(node);
1739 link = node->links[bearer_id].link;
1741 tipc_node_read_unlock(node);
1742 nlmsg_free(msg.skb);
1746 err = __tipc_nl_add_link(net, &msg, link, 0);
1747 tipc_node_read_unlock(node);
1749 nlmsg_free(msg.skb);
1754 return genlmsg_reply(msg.skb, info);
1757 int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info)
1761 unsigned int bearer_id;
1762 struct tipc_link *link;
1763 struct tipc_node *node;
1764 struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
1765 struct net *net = sock_net(skb->sk);
1766 struct tipc_link_entry *le;
1768 if (!info->attrs[TIPC_NLA_LINK])
1771 err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX,
1772 info->attrs[TIPC_NLA_LINK],
1773 tipc_nl_link_policy);
1777 if (!attrs[TIPC_NLA_LINK_NAME])
1780 link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
1782 if (strcmp(link_name, tipc_bclink_name) == 0) {
1783 err = tipc_bclink_reset_stats(net);
1789 node = tipc_node_find_by_name(net, link_name, &bearer_id);
1793 le = &node->links[bearer_id];
1794 tipc_node_read_lock(node);
1795 spin_lock_bh(&le->lock);
1796 link = node->links[bearer_id].link;
1798 spin_unlock_bh(&le->lock);
1799 tipc_node_read_unlock(node);
1802 tipc_link_reset_stats(link);
1803 spin_unlock_bh(&le->lock);
1804 tipc_node_read_unlock(node);
1808 /* Caller should hold node lock */
1809 static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
1810 struct tipc_node *node, u32 *prev_link)
1815 for (i = *prev_link; i < MAX_BEARERS; i++) {
1818 if (!node->links[i].link)
1821 err = __tipc_nl_add_link(net, msg,
1822 node->links[i].link, NLM_F_MULTI);
1831 int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb)
1833 struct net *net = sock_net(skb->sk);
1834 struct tipc_net *tn = net_generic(net, tipc_net_id);
1835 struct tipc_node *node;
1836 struct tipc_nl_msg msg;
1837 u32 prev_node = cb->args[0];
1838 u32 prev_link = cb->args[1];
1839 int done = cb->args[2];
1846 msg.portid = NETLINK_CB(cb->skb).portid;
1847 msg.seq = cb->nlh->nlmsg_seq;
1851 node = tipc_node_find(net, prev_node);
1853 /* We never set seq or call nl_dump_check_consistent()
1854 * this means that setting prev_seq here will cause the
1855 * consistence check to fail in the netlink callback
1856 * handler. Resulting in the last NLMSG_DONE message
1857 * having the NLM_F_DUMP_INTR flag set.
1862 tipc_node_put(node);
1864 list_for_each_entry_continue_rcu(node, &tn->node_list,
1866 tipc_node_read_lock(node);
1867 err = __tipc_nl_add_node_links(net, &msg, node,
1869 tipc_node_read_unlock(node);
1873 prev_node = node->addr;
1876 err = tipc_nl_add_bc_link(net, &msg);
1880 list_for_each_entry_rcu(node, &tn->node_list, list) {
1881 tipc_node_read_lock(node);
1882 err = __tipc_nl_add_node_links(net, &msg, node,
1884 tipc_node_read_unlock(node);
1888 prev_node = node->addr;
1895 cb->args[0] = prev_node;
1896 cb->args[1] = prev_link;