net/tipc/node.c

/* [<][>][^][v][top][bottom][index][help] */
This source file includes following definitions.
node_active_link
tipc_node_get_mtu
tipc_node_get_id
tipc_node_get_capabilities
tipc_node_kref_release
tipc_node_put
tipc_node_get
tipc_node_find
tipc_node_find_by_id
tipc_node_read_lock
tipc_node_read_unlock
tipc_node_write_lock
tipc_node_write_unlock_fast
tipc_node_write_unlock
tipc_node_create
tipc_node_calculate_timer
tipc_node_delete_from_list
tipc_node_delete
tipc_node_stop
tipc_node_subscribe
tipc_node_unsubscribe
tipc_node_add_conn
tipc_node_remove_conn
tipc_node_clear_links
tipc_node_cleanup
tipc_node_timeout
__tipc_node_link_up
tipc_node_link_up
tipc_node_link_failover
__tipc_node_link_down
tipc_node_link_down
node_is_up
tipc_node_is_up
tipc_node_suggest_addr
tipc_node_try_addr
tipc_node_check_dest
tipc_node_delete_links
tipc_node_reset_links
tipc_node_fsm_evt
node_lost_contact
tipc_node_get_linkname
__tipc_nl_add_node
tipc_node_xmit
tipc_node_xmit_skb
tipc_node_distr_xmit
tipc_node_broadcast
tipc_node_mcast_rcv
tipc_node_bc_sync_rcv
tipc_node_bc_rcv
tipc_node_check_state
tipc_rcv
tipc_node_apply_property
tipc_nl_peer_rm
tipc_nl_node_dump
tipc_node_find_by_name
tipc_nl_node_set_link
tipc_nl_node_get_link
tipc_nl_node_reset_link_stats
__tipc_nl_add_node_links
tipc_nl_node_dump_link
tipc_nl_node_set_monitor
__tipc_nl_add_monitor_prop
tipc_nl_node_get_monitor
tipc_nl_node_dump_monitor
tipc_nl_node_dump_monitor_peer
tipc_node_get_addr
tipc_node_dump
   1 /*
   2  * net/tipc/node.c: TIPC node management routines
   3  *
   4  * Copyright (c) 2000-2006, 2012-2016, Ericsson AB
   5  * Copyright (c) 2005-2006, 2010-2014, Wind River Systems
   6  * All rights reserved.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions are met:
  10  *
  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.
  19  *
  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.
  23  *
  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.
  35  */
  36 
  37 #include "core.h"
  38 #include "link.h"
  39 #include "node.h"
  40 #include "name_distr.h"
  41 #include "socket.h"
  42 #include "bcast.h"
  43 #include "monitor.h"
  44 #include "discover.h"
  45 #include "netlink.h"
  46 #include "trace.h"
  47 
  48 #define INVALID_NODE_SIG        0x10000
  49 #define NODE_CLEANUP_AFTER      300000
  50 
  51 /* Flags used to take different actions according to flag type
  52  * TIPC_NOTIFY_NODE_DOWN: notify node is down
  53  * TIPC_NOTIFY_NODE_UP: notify node is up
  54  * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
  55  */
  56 enum {
  57         TIPC_NOTIFY_NODE_DOWN           = (1 << 3),
  58         TIPC_NOTIFY_NODE_UP             = (1 << 4),
  59         TIPC_NOTIFY_LINK_UP             = (1 << 6),
  60         TIPC_NOTIFY_LINK_DOWN           = (1 << 7)
  61 };
  62 
  63 struct tipc_link_entry {
  64         struct tipc_link *link;
  65         spinlock_t lock; /* per link */
  66         u32 mtu;
  67         struct sk_buff_head inputq;
  68         struct tipc_media_addr maddr;
  69 };
  70 
  71 struct tipc_bclink_entry {
  72         struct tipc_link *link;
  73         struct sk_buff_head inputq1;
  74         struct sk_buff_head arrvq;
  75         struct sk_buff_head inputq2;
  76         struct sk_buff_head namedq;
  77 };
  78 
  79 /**
  80  * struct tipc_node - TIPC node structure
  81  * @addr: network address of node
  82  * @ref: reference counter to node object
  83  * @lock: rwlock governing access to structure
  84  * @net: the applicable net namespace
  85  * @hash: links to adjacent nodes in unsorted hash chain
  86  * @inputq: pointer to input queue containing messages for msg event
  87  * @namedq: pointer to name table input queue with name table messages
  88  * @active_links: bearer ids of active links, used as index into links[] array
  89  * @links: array containing references to all links to node
  90  * @action_flags: bit mask of different types of node actions
  91  * @state: connectivity state vs peer node
  92  * @sync_point: sequence number where synch/failover is finished
  93  * @list: links to adjacent nodes in sorted list of cluster's nodes
  94  * @working_links: number of working links to node (both active and standby)
  95  * @link_cnt: number of links to node
  96  * @capabilities: bitmap, indicating peer node's functional capabilities
  97  * @signature: node instance identifier
  98  * @link_id: local and remote bearer ids of changing link, if any
  99  * @publ_list: list of publications
 100  * @rcu: rcu struct for tipc_node
 101  * @delete_at: indicates the time for deleting a down node
 102  */
 103 struct tipc_node {
 104         u32 addr;
 105         struct kref kref;
 106         rwlock_t lock;
 107         struct net *net;
 108         struct hlist_node hash;
 109         int active_links[2];
 110         struct tipc_link_entry links[MAX_BEARERS];
 111         struct tipc_bclink_entry bc_entry;
 112         int action_flags;
 113         struct list_head list;
 114         int state;
 115         bool failover_sent;
 116         u16 sync_point;
 117         int link_cnt;
 118         u16 working_links;
 119         u16 capabilities;
 120         u32 signature;
 121         u32 link_id;
 122         u8 peer_id[16];
 123         struct list_head publ_list;
 124         struct list_head conn_sks;
 125         unsigned long keepalive_intv;
 126         struct timer_list timer;
 127         struct rcu_head rcu;
 128         unsigned long delete_at;
 129 };
 130 
 131 /* Node FSM states and events:
 132  */
 133 enum {
 134         SELF_DOWN_PEER_DOWN    = 0xdd,
 135         SELF_UP_PEER_UP        = 0xaa,
 136         SELF_DOWN_PEER_LEAVING = 0xd1,
 137         SELF_UP_PEER_COMING    = 0xac,
 138         SELF_COMING_PEER_UP    = 0xca,
 139         SELF_LEAVING_PEER_DOWN = 0x1d,
 140         NODE_FAILINGOVER       = 0xf0,
 141         NODE_SYNCHING          = 0xcc
 142 };
 143 
 144 enum {
 145         SELF_ESTABL_CONTACT_EVT = 0xece,
 146         SELF_LOST_CONTACT_EVT   = 0x1ce,
 147         PEER_ESTABL_CONTACT_EVT = 0x9ece,
 148         PEER_LOST_CONTACT_EVT   = 0x91ce,
 149         NODE_FAILOVER_BEGIN_EVT = 0xfbe,
 150         NODE_FAILOVER_END_EVT   = 0xfee,
 151         NODE_SYNCH_BEGIN_EVT    = 0xcbe,
 152         NODE_SYNCH_END_EVT      = 0xcee
 153 };
 154 
 155 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
 156                                   struct sk_buff_head *xmitq,
 157                                   struct tipc_media_addr **maddr);
 158 static void tipc_node_link_down(struct tipc_node *n, int bearer_id,
 159                                 bool delete);
 160 static void node_lost_contact(struct tipc_node *n, struct sk_buff_head *inputq);
 161 static void tipc_node_delete(struct tipc_node *node);
 162 static void tipc_node_timeout(struct timer_list *t);
 163 static void tipc_node_fsm_evt(struct tipc_node *n, int evt);
 164 static struct tipc_node *tipc_node_find(struct net *net, u32 addr);
 165 static struct tipc_node *tipc_node_find_by_id(struct net *net, u8 *id);
 166 static void tipc_node_put(struct tipc_node *node);
 167 static bool node_is_up(struct tipc_node *n);
 168 static void tipc_node_delete_from_list(struct tipc_node *node);
 169 
 170 struct tipc_sock_conn {
 171         u32 port;
 172         u32 peer_port;
 173         u32 peer_node;
 174         struct list_head list;
 175 };
 176 
 177 static struct tipc_link *node_active_link(struct tipc_node *n, int sel)
 178 {
 179         int bearer_id = n->active_links[sel & 1];
 180 
 181         if (unlikely(bearer_id == INVALID_BEARER_ID))
 182                 return NULL;
 183 
 184         return n->links[bearer_id].link;
 185 }
 186 
 187 int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel)
 188 {
 189         struct tipc_node *n;
 190         int bearer_id;
 191         unsigned int mtu = MAX_MSG_SIZE;
 192 
 193         n = tipc_node_find(net, addr);
 194         if (unlikely(!n))
 195                 return mtu;
 196 
 197         bearer_id = n->active_links[sel & 1];
 198         if (likely(bearer_id != INVALID_BEARER_ID))
 199                 mtu = n->links[bearer_id].mtu;
 200         tipc_node_put(n);
 201         return mtu;
 202 }
 203 
 204 bool tipc_node_get_id(struct net *net, u32 addr, u8 *id)
 205 {
 206         u8 *own_id = tipc_own_id(net);
 207         struct tipc_node *n;
 208 
 209         if (!own_id)
 210                 return true;
 211 
 212         if (addr == tipc_own_addr(net)) {
 213                 memcpy(id, own_id, TIPC_NODEID_LEN);
 214                 return true;
 215         }
 216         n = tipc_node_find(net, addr);
 217         if (!n)
 218                 return false;
 219 
 220         memcpy(id, &n->peer_id, TIPC_NODEID_LEN);
 221         tipc_node_put(n);
 222         return true;
 223 }
 224 
 225 u16 tipc_node_get_capabilities(struct net *net, u32 addr)
 226 {
 227         struct tipc_node *n;
 228         u16 caps;
 229 
 230         n = tipc_node_find(net, addr);
 231         if (unlikely(!n))
 232                 return TIPC_NODE_CAPABILITIES;
 233         caps = n->capabilities;
 234         tipc_node_put(n);
 235         return caps;
 236 }
 237 
 238 static void tipc_node_kref_release(struct kref *kref)
 239 {
 240         struct tipc_node *n = container_of(kref, struct tipc_node, kref);
 241 
 242         kfree(n->bc_entry.link);
 243         kfree_rcu(n, rcu);
 244 }
 245 
 246 static void tipc_node_put(struct tipc_node *node)
 247 {
 248         kref_put(&node->kref, tipc_node_kref_release);
 249 }
 250 
 251 static void tipc_node_get(struct tipc_node *node)
 252 {
 253         kref_get(&node->kref);
 254 }
 255 
 256 /*
 257  * tipc_node_find - locate specified node object, if it exists
 258  */
 259 static struct tipc_node *tipc_node_find(struct net *net, u32 addr)
 260 {
 261         struct tipc_net *tn = tipc_net(net);
 262         struct tipc_node *node;
 263         unsigned int thash = tipc_hashfn(addr);
 264 
 265         rcu_read_lock();
 266         hlist_for_each_entry_rcu(node, &tn->node_htable[thash], hash) {
 267                 if (node->addr != addr)
 268                         continue;
 269                 if (!kref_get_unless_zero(&node->kref))
 270                         node = NULL;
 271                 break;
 272         }
 273         rcu_read_unlock();
 274         return node;
 275 }
 276 
 277 /* tipc_node_find_by_id - locate specified node object by its 128-bit id
 278  * Note: this function is called only when a discovery request failed
 279  * to find the node by its 32-bit id, and is not time critical
 280  */
 281 static struct tipc_node *tipc_node_find_by_id(struct net *net, u8 *id)
 282 {
 283         struct tipc_net *tn = tipc_net(net);
 284         struct tipc_node *n;
 285         bool found = false;
 286 
 287         rcu_read_lock();
 288         list_for_each_entry_rcu(n, &tn->node_list, list) {
 289                 read_lock_bh(&n->lock);
 290                 if (!memcmp(id, n->peer_id, 16) &&
 291                     kref_get_unless_zero(&n->kref))
 292                         found = true;
 293                 read_unlock_bh(&n->lock);
 294                 if (found)
 295                         break;
 296         }
 297         rcu_read_unlock();
 298         return found ? n : NULL;
 299 }
 300 
 301 static void tipc_node_read_lock(struct tipc_node *n)
 302 {
 303         read_lock_bh(&n->lock);
 304 }
 305 
 306 static void tipc_node_read_unlock(struct tipc_node *n)
 307 {
 308         read_unlock_bh(&n->lock);
 309 }
 310 
 311 static void tipc_node_write_lock(struct tipc_node *n)
 312 {
 313         write_lock_bh(&n->lock);
 314 }
 315 
 316 static void tipc_node_write_unlock_fast(struct tipc_node *n)
 317 {
 318         write_unlock_bh(&n->lock);
 319 }
 320 
 321 static void tipc_node_write_unlock(struct tipc_node *n)
 322 {
 323         struct net *net = n->net;
 324         u32 addr = 0;
 325         u32 flags = n->action_flags;
 326         u32 link_id = 0;
 327         u32 bearer_id;
 328         struct list_head *publ_list;
 329 
 330         if (likely(!flags)) {
 331                 write_unlock_bh(&n->lock);
 332                 return;
 333         }
 334 
 335         addr = n->addr;
 336         link_id = n->link_id;
 337         bearer_id = link_id & 0xffff;
 338         publ_list = &n->publ_list;
 339 
 340         n->action_flags &= ~(TIPC_NOTIFY_NODE_DOWN | TIPC_NOTIFY_NODE_UP |
 341                              TIPC_NOTIFY_LINK_DOWN | TIPC_NOTIFY_LINK_UP);
 342 
 343         write_unlock_bh(&n->lock);
 344 
 345         if (flags & TIPC_NOTIFY_NODE_DOWN)
 346                 tipc_publ_notify(net, publ_list, addr);
 347 
 348         if (flags & TIPC_NOTIFY_NODE_UP)
 349                 tipc_named_node_up(net, addr);
 350 
 351         if (flags & TIPC_NOTIFY_LINK_UP) {
 352                 tipc_mon_peer_up(net, addr, bearer_id);
 353                 tipc_nametbl_publish(net, TIPC_LINK_STATE, addr, addr,
 354                                      TIPC_NODE_SCOPE, link_id, link_id);
 355         }
 356         if (flags & TIPC_NOTIFY_LINK_DOWN) {
 357                 tipc_mon_peer_down(net, addr, bearer_id);
 358                 tipc_nametbl_withdraw(net, TIPC_LINK_STATE, addr,
 359                                       addr, link_id);
 360         }
 361 }
 362 
 363 static struct tipc_node *tipc_node_create(struct net *net, u32 addr,
 364                                           u8 *peer_id, u16 capabilities)
 365 {
 366         struct tipc_net *tn = net_generic(net, tipc_net_id);
 367         struct tipc_node *n, *temp_node;
 368         struct tipc_link *l;
 369         int bearer_id;
 370         int i;
 371 
 372         spin_lock_bh(&tn->node_list_lock);
 373         n = tipc_node_find(net, addr);
 374         if (n) {
 375                 if (n->capabilities == capabilities)
 376                         goto exit;
 377                 /* Same node may come back with new capabilities */
 378                 tipc_node_write_lock(n);
 379                 n->capabilities = capabilities;
 380                 for (bearer_id = 0; bearer_id < MAX_BEARERS; bearer_id++) {
 381                         l = n->links[bearer_id].link;
 382                         if (l)
 383                                 tipc_link_update_caps(l, capabilities);
 384                 }
 385                 tipc_node_write_unlock_fast(n);
 386 
 387                 /* Calculate cluster capabilities */
 388                 tn->capabilities = TIPC_NODE_CAPABILITIES;
 389                 list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
 390                         tn->capabilities &= temp_node->capabilities;
 391                 }
 392                 goto exit;
 393         }
 394         n = kzalloc(sizeof(*n), GFP_ATOMIC);
 395         if (!n) {
 396                 pr_warn("Node creation failed, no memory\n");
 397                 goto exit;
 398         }
 399         n->addr = addr;
 400         memcpy(&n->peer_id, peer_id, 16);
 401         n->net = net;
 402         n->capabilities = capabilities;
 403         kref_init(&n->kref);
 404         rwlock_init(&n->lock);
 405         INIT_HLIST_NODE(&n->hash);
 406         INIT_LIST_HEAD(&n->list);
 407         INIT_LIST_HEAD(&n->publ_list);
 408         INIT_LIST_HEAD(&n->conn_sks);
 409         skb_queue_head_init(&n->bc_entry.namedq);
 410         skb_queue_head_init(&n->bc_entry.inputq1);
 411         __skb_queue_head_init(&n->bc_entry.arrvq);
 412         skb_queue_head_init(&n->bc_entry.inputq2);
 413         for (i = 0; i < MAX_BEARERS; i++)
 414                 spin_lock_init(&n->links[i].lock);
 415         n->state = SELF_DOWN_PEER_LEAVING;
 416         n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
 417         n->signature = INVALID_NODE_SIG;
 418         n->active_links[0] = INVALID_BEARER_ID;
 419         n->active_links[1] = INVALID_BEARER_ID;
 420         if (!tipc_link_bc_create(net, tipc_own_addr(net),
 421                                  addr, U16_MAX,
 422                                  tipc_link_window(tipc_bc_sndlink(net)),
 423                                  n->capabilities,
 424                                  &n->bc_entry.inputq1,
 425                                  &n->bc_entry.namedq,
 426                                  tipc_bc_sndlink(net),
 427                                  &n->bc_entry.link)) {
 428                 pr_warn("Broadcast rcv link creation failed, no memory\n");
 429                 kfree(n);
 430                 n = NULL;
 431                 goto exit;
 432         }
 433         tipc_node_get(n);
 434         timer_setup(&n->timer, tipc_node_timeout, 0);
 435         n->keepalive_intv = U32_MAX;
 436         hlist_add_head_rcu(&n->hash, &tn->node_htable[tipc_hashfn(addr)]);
 437         list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
 438                 if (n->addr < temp_node->addr)
 439                         break;
 440         }
 441         list_add_tail_rcu(&n->list, &temp_node->list);
 442         /* Calculate cluster capabilities */
 443         tn->capabilities = TIPC_NODE_CAPABILITIES;
 444         list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
 445                 tn->capabilities &= temp_node->capabilities;
 446         }
 447         trace_tipc_node_create(n, true, " ");
 448 exit:
 449         spin_unlock_bh(&tn->node_list_lock);
 450         return n;
 451 }
 452 
 453 static void tipc_node_calculate_timer(struct tipc_node *n, struct tipc_link *l)
 454 {
 455         unsigned long tol = tipc_link_tolerance(l);
 456         unsigned long intv = ((tol / 4) > 500) ? 500 : tol / 4;
 457 
 458         /* Link with lowest tolerance determines timer interval */
 459         if (intv < n->keepalive_intv)
 460                 n->keepalive_intv = intv;
 461 
 462         /* Ensure link's abort limit corresponds to current tolerance */
 463         tipc_link_set_abort_limit(l, tol / n->keepalive_intv);
 464 }
 465 
 466 static void tipc_node_delete_from_list(struct tipc_node *node)
 467 {
 468         list_del_rcu(&node->list);
 469         hlist_del_rcu(&node->hash);
 470         tipc_node_put(node);
 471 }
 472 
 473 static void tipc_node_delete(struct tipc_node *node)
 474 {
 475         trace_tipc_node_delete(node, true, " ");
 476         tipc_node_delete_from_list(node);
 477 
 478         del_timer_sync(&node->timer);
 479         tipc_node_put(node);
 480 }
 481 
 482 void tipc_node_stop(struct net *net)
 483 {
 484         struct tipc_net *tn = tipc_net(net);
 485         struct tipc_node *node, *t_node;
 486 
 487         spin_lock_bh(&tn->node_list_lock);
 488         list_for_each_entry_safe(node, t_node, &tn->node_list, list)
 489                 tipc_node_delete(node);
 490         spin_unlock_bh(&tn->node_list_lock);
 491 }
 492 
 493 void tipc_node_subscribe(struct net *net, struct list_head *subscr, u32 addr)
 494 {
 495         struct tipc_node *n;
 496 
 497         if (in_own_node(net, addr))
 498                 return;
 499 
 500         n = tipc_node_find(net, addr);
 501         if (!n) {
 502                 pr_warn("Node subscribe rejected, unknown node 0x%x\n", addr);
 503                 return;
 504         }
 505         tipc_node_write_lock(n);
 506         list_add_tail(subscr, &n->publ_list);
 507         tipc_node_write_unlock_fast(n);
 508         tipc_node_put(n);
 509 }
 510 
 511 void tipc_node_unsubscribe(struct net *net, struct list_head *subscr, u32 addr)
 512 {
 513         struct tipc_node *n;
 514 
 515         if (in_own_node(net, addr))
 516                 return;
 517 
 518         n = tipc_node_find(net, addr);
 519         if (!n) {
 520                 pr_warn("Node unsubscribe rejected, unknown node 0x%x\n", addr);
 521                 return;
 522         }
 523         tipc_node_write_lock(n);
 524         list_del_init(subscr);
 525         tipc_node_write_unlock_fast(n);
 526         tipc_node_put(n);
 527 }
 528 
 529 int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port)
 530 {
 531         struct tipc_node *node;
 532         struct tipc_sock_conn *conn;
 533         int err = 0;
 534 
 535         if (in_own_node(net, dnode))
 536                 return 0;
 537 
 538         node = tipc_node_find(net, dnode);
 539         if (!node) {
 540                 pr_warn("Connecting sock to node 0x%x failed\n", dnode);
 541                 return -EHOSTUNREACH;
 542         }
 543         conn = kmalloc(sizeof(*conn), GFP_ATOMIC);
 544         if (!conn) {
 545                 err = -EHOSTUNREACH;
 546                 goto exit;
 547         }
 548         conn->peer_node = dnode;
 549         conn->port = port;
 550         conn->peer_port = peer_port;
 551 
 552         tipc_node_write_lock(node);
 553         list_add_tail(&conn->list, &node->conn_sks);
 554         tipc_node_write_unlock(node);
 555 exit:
 556         tipc_node_put(node);
 557         return err;
 558 }
 559 
 560 void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port)
 561 {
 562         struct tipc_node *node;
 563         struct tipc_sock_conn *conn, *safe;
 564 
 565         if (in_own_node(net, dnode))
 566                 return;
 567 
 568         node = tipc_node_find(net, dnode);
 569         if (!node)
 570                 return;
 571 
 572         tipc_node_write_lock(node);
 573         list_for_each_entry_safe(conn, safe, &node->conn_sks, list) {
 574                 if (port != conn->port)
 575                         continue;
 576                 list_del(&conn->list);
 577                 kfree(conn);
 578         }
 579         tipc_node_write_unlock(node);
 580         tipc_node_put(node);
 581 }
 582 
 583 static void  tipc_node_clear_links(struct tipc_node *node)
 584 {
 585         int i;
 586 
 587         for (i = 0; i < MAX_BEARERS; i++) {
 588                 struct tipc_link_entry *le = &node->links[i];
 589 
 590                 if (le->link) {
 591                         kfree(le->link);
 592                         le->link = NULL;
 593                         node->link_cnt--;
 594                 }
 595         }
 596 }
 597 
 598 /* tipc_node_cleanup - delete nodes that does not
 599  * have active links for NODE_CLEANUP_AFTER time
 600  */
 601 static bool tipc_node_cleanup(struct tipc_node *peer)
 602 {
 603         struct tipc_node *temp_node;
 604         struct tipc_net *tn = tipc_net(peer->net);
 605         bool deleted = false;
 606 
 607         /* If lock held by tipc_node_stop() the node will be deleted anyway */
 608         if (!spin_trylock_bh(&tn->node_list_lock))
 609                 return false;
 610 
 611         tipc_node_write_lock(peer);
 612 
 613         if (!node_is_up(peer) && time_after(jiffies, peer->delete_at)) {
 614                 tipc_node_clear_links(peer);
 615                 tipc_node_delete_from_list(peer);
 616                 deleted = true;
 617         }
 618         tipc_node_write_unlock(peer);
 619 
 620         /* Calculate cluster capabilities */
 621         tn->capabilities = TIPC_NODE_CAPABILITIES;
 622         list_for_each_entry_rcu(temp_node, &tn->node_list, list) {
 623                 tn->capabilities &= temp_node->capabilities;
 624         }
 625 
 626         spin_unlock_bh(&tn->node_list_lock);
 627         return deleted;
 628 }
 629 
 630 /* tipc_node_timeout - handle expiration of node timer
 631  */
 632 static void tipc_node_timeout(struct timer_list *t)
 633 {
 634         struct tipc_node *n = from_timer(n, t, timer);
 635         struct tipc_link_entry *le;
 636         struct sk_buff_head xmitq;
 637         int remains = n->link_cnt;
 638         int bearer_id;
 639         int rc = 0;
 640 
 641         trace_tipc_node_timeout(n, false, " ");
 642         if (!node_is_up(n) && tipc_node_cleanup(n)) {
 643                 /*Removing the reference of Timer*/
 644                 tipc_node_put(n);
 645                 return;
 646         }
 647 
 648         __skb_queue_head_init(&xmitq);
 649 
 650         /* Initial node interval to value larger (10 seconds), then it will be
 651          * recalculated with link lowest tolerance
 652          */
 653         tipc_node_read_lock(n);
 654         n->keepalive_intv = 10000;
 655         tipc_node_read_unlock(n);
 656         for (bearer_id = 0; remains && (bearer_id < MAX_BEARERS); bearer_id++) {
 657                 tipc_node_read_lock(n);
 658                 le = &n->links[bearer_id];
 659                 if (le->link) {
 660                         spin_lock_bh(&le->lock);
 661                         /* Link tolerance may change asynchronously: */
 662                         tipc_node_calculate_timer(n, le->link);
 663                         rc = tipc_link_timeout(le->link, &xmitq);
 664                         spin_unlock_bh(&le->lock);
 665                         remains--;
 666                 }
 667                 tipc_node_read_unlock(n);
 668                 tipc_bearer_xmit(n->net, bearer_id, &xmitq, &le->maddr);
 669                 if (rc & TIPC_LINK_DOWN_EVT)
 670                         tipc_node_link_down(n, bearer_id, false);
 671         }
 672         mod_timer(&n->timer, jiffies + msecs_to_jiffies(n->keepalive_intv));
 673 }
 674 
 675 /**
 676  * __tipc_node_link_up - handle addition of link
 677  * Node lock must be held by caller
 678  * Link becomes active (alone or shared) or standby, depending on its priority.
 679  */
 680 static void __tipc_node_link_up(struct tipc_node *n, int bearer_id,
 681                                 struct sk_buff_head *xmitq)
 682 {
 683         int *slot0 = &n->active_links[0];
 684         int *slot1 = &n->active_links[1];
 685         struct tipc_link *ol = node_active_link(n, 0);
 686         struct tipc_link *nl = n->links[bearer_id].link;
 687 
 688         if (!nl || tipc_link_is_up(nl))
 689                 return;
 690 
 691         tipc_link_fsm_evt(nl, LINK_ESTABLISH_EVT);
 692         if (!tipc_link_is_up(nl))
 693                 return;
 694 
 695         n->working_links++;
 696         n->action_flags |= TIPC_NOTIFY_LINK_UP;
 697         n->link_id = tipc_link_id(nl);
 698 
 699         /* Leave room for tunnel header when returning 'mtu' to users: */
 700         n->links[bearer_id].mtu = tipc_link_mtu(nl) - INT_H_SIZE;
 701 
 702         tipc_bearer_add_dest(n->net, bearer_id, n->addr);
 703         tipc_bcast_inc_bearer_dst_cnt(n->net, bearer_id);
 704 
 705         pr_debug("Established link <%s> on network plane %c\n",
 706                  tipc_link_name(nl), tipc_link_plane(nl));
 707         trace_tipc_node_link_up(n, true, " ");
 708 
 709         /* Ensure that a STATE message goes first */
 710         tipc_link_build_state_msg(nl, xmitq);
 711 
 712         /* First link? => give it both slots */
 713         if (!ol) {
 714                 *slot0 = bearer_id;
 715                 *slot1 = bearer_id;
 716                 tipc_node_fsm_evt(n, SELF_ESTABL_CONTACT_EVT);
 717                 n->action_flags |= TIPC_NOTIFY_NODE_UP;
 718                 tipc_link_set_active(nl, true);
 719                 tipc_bcast_add_peer(n->net, nl, xmitq);
 720                 return;
 721         }
 722 
 723         /* Second link => redistribute slots */
 724         if (tipc_link_prio(nl) > tipc_link_prio(ol)) {
 725                 pr_debug("Old link <%s> becomes standby\n", tipc_link_name(ol));
 726                 *slot0 = bearer_id;
 727                 *slot1 = bearer_id;
 728                 tipc_link_set_active(nl, true);
 729                 tipc_link_set_active(ol, false);
 730         } else if (tipc_link_prio(nl) == tipc_link_prio(ol)) {
 731                 tipc_link_set_active(nl, true);
 732                 *slot1 = bearer_id;
 733         } else {
 734                 pr_debug("New link <%s> is standby\n", tipc_link_name(nl));
 735         }
 736 
 737         /* Prepare synchronization with first link */
 738         tipc_link_tnl_prepare(ol, nl, SYNCH_MSG, xmitq);
 739 }
 740 
 741 /**
 742  * tipc_node_link_up - handle addition of link
 743  *
 744  * Link becomes active (alone or shared) or standby, depending on its priority.
 745  */
 746 static void tipc_node_link_up(struct tipc_node *n, int bearer_id,
 747                               struct sk_buff_head *xmitq)
 748 {
 749         struct tipc_media_addr *maddr;
 750 
 751         tipc_node_write_lock(n);
 752         __tipc_node_link_up(n, bearer_id, xmitq);
 753         maddr = &n->links[bearer_id].maddr;
 754         tipc_bearer_xmit(n->net, bearer_id, xmitq, maddr);
 755         tipc_node_write_unlock(n);
 756 }
 757 
 758 /**
 759  * tipc_node_link_failover() - start failover in case "half-failover"
 760  *
 761  * This function is only called in a very special situation where link
 762  * failover can be already started on peer node but not on this node.
 763  * This can happen when e.g.
 764  *      1. Both links <1A-2A>, <1B-2B> down
 765  *      2. Link endpoint 2A up, but 1A still down (e.g. due to network
 766  *         disturbance, wrong session, etc.)
 767  *      3. Link <1B-2B> up
 768  *      4. Link endpoint 2A down (e.g. due to link tolerance timeout)
 769  *      5. Node 2 starts failover onto link <1B-2B>
 770  *
 771  *      ==> Node 1 does never start link/node failover!
 772  *
 773  * @n: tipc node structure
 774  * @l: link peer endpoint failingover (- can be NULL)
 775  * @tnl: tunnel link
 776  * @xmitq: queue for messages to be xmited on tnl link later
 777  */
 778 static void tipc_node_link_failover(struct tipc_node *n, struct tipc_link *l,
 779                                     struct tipc_link *tnl,
 780                                     struct sk_buff_head *xmitq)
 781 {
 782         /* Avoid to be "self-failover" that can never end */
 783         if (!tipc_link_is_up(tnl))
 784                 return;
 785 
 786         /* Don't rush, failure link may be in the process of resetting */
 787         if (l && !tipc_link_is_reset(l))
 788                 return;
 789 
 790         tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
 791         tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
 792 
 793         n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
 794         tipc_link_failover_prepare(l, tnl, xmitq);
 795 
 796         if (l)
 797                 tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
 798         tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
 799 }
 800 
 801 /**
 802  * __tipc_node_link_down - handle loss of link
 803  */
 804 static void __tipc_node_link_down(struct tipc_node *n, int *bearer_id,
 805                                   struct sk_buff_head *xmitq,
 806                                   struct tipc_media_addr **maddr)
 807 {
 808         struct tipc_link_entry *le = &n->links[*bearer_id];
 809         int *slot0 = &n->active_links[0];
 810         int *slot1 = &n->active_links[1];
 811         int i, highest = 0, prio;
 812         struct tipc_link *l, *_l, *tnl;
 813 
 814         l = n->links[*bearer_id].link;
 815         if (!l || tipc_link_is_reset(l))
 816                 return;
 817 
 818         n->working_links--;
 819         n->action_flags |= TIPC_NOTIFY_LINK_DOWN;
 820         n->link_id = tipc_link_id(l);
 821 
 822         tipc_bearer_remove_dest(n->net, *bearer_id, n->addr);
 823 
 824         pr_debug("Lost link <%s> on network plane %c\n",
 825                  tipc_link_name(l), tipc_link_plane(l));
 826 
 827         /* Select new active link if any available */
 828         *slot0 = INVALID_BEARER_ID;
 829         *slot1 = INVALID_BEARER_ID;
 830         for (i = 0; i < MAX_BEARERS; i++) {
 831                 _l = n->links[i].link;
 832                 if (!_l || !tipc_link_is_up(_l))
 833                         continue;
 834                 if (_l == l)
 835                         continue;
 836                 prio = tipc_link_prio(_l);
 837                 if (prio < highest)
 838                         continue;
 839                 if (prio > highest) {
 840                         highest = prio;
 841                         *slot0 = i;
 842                         *slot1 = i;
 843                         continue;
 844                 }
 845                 *slot1 = i;
 846         }
 847 
 848         if (!node_is_up(n)) {
 849                 if (tipc_link_peer_is_down(l))
 850                         tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
 851                 tipc_node_fsm_evt(n, SELF_LOST_CONTACT_EVT);
 852                 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link down!");
 853                 tipc_link_fsm_evt(l, LINK_RESET_EVT);
 854                 tipc_link_reset(l);
 855                 tipc_link_build_reset_msg(l, xmitq);
 856                 *maddr = &n->links[*bearer_id].maddr;
 857                 node_lost_contact(n, &le->inputq);
 858                 tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
 859                 return;
 860         }
 861         tipc_bcast_dec_bearer_dst_cnt(n->net, *bearer_id);
 862 
 863         /* There is still a working link => initiate failover */
 864         *bearer_id = n->active_links[0];
 865         tnl = n->links[*bearer_id].link;
 866         tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
 867         tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
 868         n->sync_point = tipc_link_rcv_nxt(tnl) + (U16_MAX / 2 - 1);
 869         tipc_link_tnl_prepare(l, tnl, FAILOVER_MSG, xmitq);
 870         trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link down -> failover!");
 871         tipc_link_reset(l);
 872         tipc_link_fsm_evt(l, LINK_RESET_EVT);
 873         tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
 874         tipc_node_fsm_evt(n, NODE_FAILOVER_BEGIN_EVT);
 875         *maddr = &n->links[*bearer_id].maddr;
 876 }
 877 
 878 static void tipc_node_link_down(struct tipc_node *n, int bearer_id, bool delete)
 879 {
 880         struct tipc_link_entry *le = &n->links[bearer_id];
 881         struct tipc_media_addr *maddr = NULL;
 882         struct tipc_link *l = le->link;
 883         int old_bearer_id = bearer_id;
 884         struct sk_buff_head xmitq;
 885 
 886         if (!l)
 887                 return;
 888 
 889         __skb_queue_head_init(&xmitq);
 890 
 891         tipc_node_write_lock(n);
 892         if (!tipc_link_is_establishing(l)) {
 893                 __tipc_node_link_down(n, &bearer_id, &xmitq, &maddr);
 894         } else {
 895                 /* Defuse pending tipc_node_link_up() */
 896                 tipc_link_reset(l);
 897                 tipc_link_fsm_evt(l, LINK_RESET_EVT);
 898         }
 899         if (delete) {
 900                 kfree(l);
 901                 le->link = NULL;
 902                 n->link_cnt--;
 903         }
 904         trace_tipc_node_link_down(n, true, "node link down or deleted!");
 905         tipc_node_write_unlock(n);
 906         if (delete)
 907                 tipc_mon_remove_peer(n->net, n->addr, old_bearer_id);
 908         if (!skb_queue_empty(&xmitq))
 909                 tipc_bearer_xmit(n->net, bearer_id, &xmitq, maddr);
 910         tipc_sk_rcv(n->net, &le->inputq);
 911 }
 912 
 913 static bool node_is_up(struct tipc_node *n)
 914 {
 915         return n->active_links[0] != INVALID_BEARER_ID;
 916 }
 917 
 918 bool tipc_node_is_up(struct net *net, u32 addr)
 919 {
 920         struct tipc_node *n;
 921         bool retval = false;
 922 
 923         if (in_own_node(net, addr))
 924                 return true;
 925 
 926         n = tipc_node_find(net, addr);
 927         if (!n)
 928                 return false;
 929         retval = node_is_up(n);
 930         tipc_node_put(n);
 931         return retval;
 932 }
 933 
 934 static u32 tipc_node_suggest_addr(struct net *net, u32 addr)
 935 {
 936         struct tipc_node *n;
 937 
 938         addr ^= tipc_net(net)->random;
 939         while ((n = tipc_node_find(net, addr))) {
 940                 tipc_node_put(n);
 941                 addr++;
 942         }
 943         return addr;
 944 }
 945 
 946 /* tipc_node_try_addr(): Check if addr can be used by peer, suggest other if not
 947  * Returns suggested address if any, otherwise 0
 948  */
 949 u32 tipc_node_try_addr(struct net *net, u8 *id, u32 addr)
 950 {
 951         struct tipc_net *tn = tipc_net(net);
 952         struct tipc_node *n;
 953 
 954         /* Suggest new address if some other peer is using this one */
 955         n = tipc_node_find(net, addr);
 956         if (n) {
 957                 if (!memcmp(n->peer_id, id, NODE_ID_LEN))
 958                         addr = 0;
 959                 tipc_node_put(n);
 960                 if (!addr)
 961                         return 0;
 962                 return tipc_node_suggest_addr(net, addr);
 963         }
 964 
 965         /* Suggest previously used address if peer is known */
 966         n = tipc_node_find_by_id(net, id);
 967         if (n) {
 968                 addr = n->addr;
 969                 tipc_node_put(n);
 970                 return addr;
 971         }
 972 
 973         /* Even this node may be in conflict */
 974         if (tn->trial_addr == addr)
 975                 return tipc_node_suggest_addr(net, addr);
 976 
 977         return 0;
 978 }
 979 
 980 void tipc_node_check_dest(struct net *net, u32 addr,
 981                           u8 *peer_id, struct tipc_bearer *b,
 982                           u16 capabilities, u32 signature,
 983                           struct tipc_media_addr *maddr,
 984                           bool *respond, bool *dupl_addr)
 985 {
 986         struct tipc_node *n;
 987         struct tipc_link *l;
 988         struct tipc_link_entry *le;
 989         bool addr_match = false;
 990         bool sign_match = false;
 991         bool link_up = false;
 992         bool accept_addr = false;
 993         bool reset = true;
 994         char *if_name;
 995         unsigned long intv;
 996         u16 session;
 997 
 998         *dupl_addr = false;
 999         *respond = false;
1000 
1001         n = tipc_node_create(net, addr, peer_id, capabilities);
1002         if (!n)
1003                 return;
1004 
1005         tipc_node_write_lock(n);
1006 
1007         le = &n->links[b->identity];
1008 
1009         /* Prepare to validate requesting node's signature and media address */
1010         l = le->link;
1011         link_up = l && tipc_link_is_up(l);
1012         addr_match = l && !memcmp(&le->maddr, maddr, sizeof(*maddr));
1013         sign_match = (signature == n->signature);
1014 
1015         /* These three flags give us eight permutations: */
1016 
1017         if (sign_match && addr_match && link_up) {
1018                 /* All is fine. Do nothing. */
1019                 reset = false;
1020         } else if (sign_match && addr_match && !link_up) {
1021                 /* Respond. The link will come up in due time */
1022                 *respond = true;
1023         } else if (sign_match && !addr_match && link_up) {
1024                 /* Peer has changed i/f address without rebooting.
1025                  * If so, the link will reset soon, and the next
1026                  * discovery will be accepted. So we can ignore it.
1027                  * It may also be an cloned or malicious peer having
1028                  * chosen the same node address and signature as an
1029                  * existing one.
1030                  * Ignore requests until the link goes down, if ever.
1031                  */
1032                 *dupl_addr = true;
1033         } else if (sign_match && !addr_match && !link_up) {
1034                 /* Peer link has changed i/f address without rebooting.
1035                  * It may also be a cloned or malicious peer; we can't
1036                  * distinguish between the two.
1037                  * The signature is correct, so we must accept.
1038                  */
1039                 accept_addr = true;
1040                 *respond = true;
1041         } else if (!sign_match && addr_match && link_up) {
1042                 /* Peer node rebooted. Two possibilities:
1043                  *  - Delayed re-discovery; this link endpoint has already
1044                  *    reset and re-established contact with the peer, before
1045                  *    receiving a discovery message from that node.
1046                  *    (The peer happened to receive one from this node first).
1047                  *  - The peer came back so fast that our side has not
1048                  *    discovered it yet. Probing from this side will soon
1049                  *    reset the link, since there can be no working link
1050                  *    endpoint at the peer end, and the link will re-establish.
1051                  *  Accept the signature, since it comes from a known peer.
1052                  */
1053                 n->signature = signature;
1054         } else if (!sign_match && addr_match && !link_up) {
1055                 /*  The peer node has rebooted.
1056                  *  Accept signature, since it is a known peer.
1057                  */
1058                 n->signature = signature;
1059                 *respond = true;
1060         } else if (!sign_match && !addr_match && link_up) {
1061                 /* Peer rebooted with new address, or a new/duplicate peer.
1062                  * Ignore until the link goes down, if ever.
1063                  */
1064                 *dupl_addr = true;
1065         } else if (!sign_match && !addr_match && !link_up) {
1066                 /* Peer rebooted with new address, or it is a new peer.
1067                  * Accept signature and address.
1068                  */
1069                 n->signature = signature;
1070                 accept_addr = true;
1071                 *respond = true;
1072         }
1073 
1074         if (!accept_addr)
1075                 goto exit;
1076 
1077         /* Now create new link if not already existing */
1078         if (!l) {
1079                 if (n->link_cnt == 2)
1080                         goto exit;
1081 
1082                 if_name = strchr(b->name, ':') + 1;
1083                 get_random_bytes(&session, sizeof(u16));
1084                 if (!tipc_link_create(net, if_name, b->identity, b->tolerance,
1085                                       b->net_plane, b->mtu, b->priority,
1086                                       b->window, session,
1087                                       tipc_own_addr(net), addr, peer_id,
1088                                       n->capabilities,
1089                                       tipc_bc_sndlink(n->net), n->bc_entry.link,
1090                                       &le->inputq,
1091                                       &n->bc_entry.namedq, &l)) {
1092                         *respond = false;
1093                         goto exit;
1094                 }
1095                 trace_tipc_link_reset(l, TIPC_DUMP_ALL, "link created!");
1096                 tipc_link_reset(l);
1097                 tipc_link_fsm_evt(l, LINK_RESET_EVT);
1098                 if (n->state == NODE_FAILINGOVER)
1099                         tipc_link_fsm_evt(l, LINK_FAILOVER_BEGIN_EVT);
1100                 le->link = l;
1101                 n->link_cnt++;
1102                 tipc_node_calculate_timer(n, l);
1103                 if (n->link_cnt == 1) {
1104                         intv = jiffies + msecs_to_jiffies(n->keepalive_intv);
1105                         if (!mod_timer(&n->timer, intv))
1106                                 tipc_node_get(n);
1107                 }
1108         }
1109         memcpy(&le->maddr, maddr, sizeof(*maddr));
1110 exit:
1111         tipc_node_write_unlock(n);
1112         if (reset && l && !tipc_link_is_reset(l))
1113                 tipc_node_link_down(n, b->identity, false);
1114         tipc_node_put(n);
1115 }
1116 
1117 void tipc_node_delete_links(struct net *net, int bearer_id)
1118 {
1119         struct tipc_net *tn = net_generic(net, tipc_net_id);
1120         struct tipc_node *n;
1121 
1122         rcu_read_lock();
1123         list_for_each_entry_rcu(n, &tn->node_list, list) {
1124                 tipc_node_link_down(n, bearer_id, true);
1125         }
1126         rcu_read_unlock();
1127 }
1128 
1129 static void tipc_node_reset_links(struct tipc_node *n)
1130 {
1131         int i;
1132 
1133         pr_warn("Resetting all links to %x\n", n->addr);
1134 
1135         trace_tipc_node_reset_links(n, true, " ");
1136         for (i = 0; i < MAX_BEARERS; i++) {
1137                 tipc_node_link_down(n, i, false);
1138         }
1139 }
1140 
1141 /* tipc_node_fsm_evt - node finite state machine
1142  * Determines when contact is allowed with peer node
1143  */
1144 static void tipc_node_fsm_evt(struct tipc_node *n, int evt)
1145 {
1146         int state = n->state;
1147 
1148         switch (state) {
1149         case SELF_DOWN_PEER_DOWN:
1150                 switch (evt) {
1151                 case SELF_ESTABL_CONTACT_EVT:
1152                         state = SELF_UP_PEER_COMING;
1153                         break;
1154                 case PEER_ESTABL_CONTACT_EVT:
1155                         state = SELF_COMING_PEER_UP;
1156                         break;
1157                 case SELF_LOST_CONTACT_EVT:
1158                 case PEER_LOST_CONTACT_EVT:
1159                         break;
1160                 case NODE_SYNCH_END_EVT:
1161                 case NODE_SYNCH_BEGIN_EVT:
1162                 case NODE_FAILOVER_BEGIN_EVT:
1163                 case NODE_FAILOVER_END_EVT:
1164                 default:
1165                         goto illegal_evt;
1166                 }
1167                 break;
1168         case SELF_UP_PEER_UP:
1169                 switch (evt) {
1170                 case SELF_LOST_CONTACT_EVT:
1171                         state = SELF_DOWN_PEER_LEAVING;
1172                         break;
1173                 case PEER_LOST_CONTACT_EVT:
1174                         state = SELF_LEAVING_PEER_DOWN;
1175                         break;
1176                 case NODE_SYNCH_BEGIN_EVT:
1177                         state = NODE_SYNCHING;
1178                         break;
1179                 case NODE_FAILOVER_BEGIN_EVT:
1180                         state = NODE_FAILINGOVER;
1181                         break;
1182                 case SELF_ESTABL_CONTACT_EVT:
1183                 case PEER_ESTABL_CONTACT_EVT:
1184                 case NODE_SYNCH_END_EVT:
1185                 case NODE_FAILOVER_END_EVT:
1186                         break;
1187                 default:
1188                         goto illegal_evt;
1189                 }
1190                 break;
1191         case SELF_DOWN_PEER_LEAVING:
1192                 switch (evt) {
1193                 case PEER_LOST_CONTACT_EVT:
1194                         state = SELF_DOWN_PEER_DOWN;
1195                         break;
1196                 case SELF_ESTABL_CONTACT_EVT:
1197                 case PEER_ESTABL_CONTACT_EVT:
1198                 case SELF_LOST_CONTACT_EVT:
1199                         break;
1200                 case NODE_SYNCH_END_EVT:
1201                 case NODE_SYNCH_BEGIN_EVT:
1202                 case NODE_FAILOVER_BEGIN_EVT:
1203                 case NODE_FAILOVER_END_EVT:
1204                 default:
1205                         goto illegal_evt;
1206                 }
1207                 break;
1208         case SELF_UP_PEER_COMING:
1209                 switch (evt) {
1210                 case PEER_ESTABL_CONTACT_EVT:
1211                         state = SELF_UP_PEER_UP;
1212                         break;
1213                 case SELF_LOST_CONTACT_EVT:
1214                         state = SELF_DOWN_PEER_DOWN;
1215                         break;
1216                 case SELF_ESTABL_CONTACT_EVT:
1217                 case PEER_LOST_CONTACT_EVT:
1218                 case NODE_SYNCH_END_EVT:
1219                 case NODE_FAILOVER_BEGIN_EVT:
1220                         break;
1221                 case NODE_SYNCH_BEGIN_EVT:
1222                 case NODE_FAILOVER_END_EVT:
1223                 default:
1224                         goto illegal_evt;
1225                 }
1226                 break;
1227         case SELF_COMING_PEER_UP:
1228                 switch (evt) {
1229                 case SELF_ESTABL_CONTACT_EVT:
1230                         state = SELF_UP_PEER_UP;
1231                         break;
1232                 case PEER_LOST_CONTACT_EVT:
1233                         state = SELF_DOWN_PEER_DOWN;
1234                         break;
1235                 case SELF_LOST_CONTACT_EVT:
1236                 case PEER_ESTABL_CONTACT_EVT:
1237                         break;
1238                 case NODE_SYNCH_END_EVT:
1239                 case NODE_SYNCH_BEGIN_EVT:
1240                 case NODE_FAILOVER_BEGIN_EVT:
1241                 case NODE_FAILOVER_END_EVT:
1242                 default:
1243                         goto illegal_evt;
1244                 }
1245                 break;
1246         case SELF_LEAVING_PEER_DOWN:
1247                 switch (evt) {
1248                 case SELF_LOST_CONTACT_EVT:
1249                         state = SELF_DOWN_PEER_DOWN;
1250                         break;
1251                 case SELF_ESTABL_CONTACT_EVT:
1252                 case PEER_ESTABL_CONTACT_EVT:
1253                 case PEER_LOST_CONTACT_EVT:
1254                         break;
1255                 case NODE_SYNCH_END_EVT:
1256                 case NODE_SYNCH_BEGIN_EVT:
1257                 case NODE_FAILOVER_BEGIN_EVT:
1258                 case NODE_FAILOVER_END_EVT:
1259                 default:
1260                         goto illegal_evt;
1261                 }
1262                 break;
1263         case NODE_FAILINGOVER:
1264                 switch (evt) {
1265                 case SELF_LOST_CONTACT_EVT:
1266                         state = SELF_DOWN_PEER_LEAVING;
1267                         break;
1268                 case PEER_LOST_CONTACT_EVT:
1269                         state = SELF_LEAVING_PEER_DOWN;
1270                         break;
1271                 case NODE_FAILOVER_END_EVT:
1272                         state = SELF_UP_PEER_UP;
1273                         break;
1274                 case NODE_FAILOVER_BEGIN_EVT:
1275                 case SELF_ESTABL_CONTACT_EVT:
1276                 case PEER_ESTABL_CONTACT_EVT:
1277                         break;
1278                 case NODE_SYNCH_BEGIN_EVT:
1279                 case NODE_SYNCH_END_EVT:
1280                 default:
1281                         goto illegal_evt;
1282                 }
1283                 break;
1284         case NODE_SYNCHING:
1285                 switch (evt) {
1286                 case SELF_LOST_CONTACT_EVT:
1287                         state = SELF_DOWN_PEER_LEAVING;
1288                         break;
1289                 case PEER_LOST_CONTACT_EVT:
1290                         state = SELF_LEAVING_PEER_DOWN;
1291                         break;
1292                 case NODE_SYNCH_END_EVT:
1293                         state = SELF_UP_PEER_UP;
1294                         break;
1295                 case NODE_FAILOVER_BEGIN_EVT:
1296                         state = NODE_FAILINGOVER;
1297                         break;
1298                 case NODE_SYNCH_BEGIN_EVT:
1299                 case SELF_ESTABL_CONTACT_EVT:
1300                 case PEER_ESTABL_CONTACT_EVT:
1301                         break;
1302                 case NODE_FAILOVER_END_EVT:
1303                 default:
1304                         goto illegal_evt;
1305                 }
1306                 break;
1307         default:
1308                 pr_err("Unknown node fsm state %x\n", state);
1309                 break;
1310         }
1311         trace_tipc_node_fsm(n->peer_id, n->state, state, evt);
1312         n->state = state;
1313         return;
1314 
1315 illegal_evt:
1316         pr_err("Illegal node fsm evt %x in state %x\n", evt, state);
1317         trace_tipc_node_fsm(n->peer_id, n->state, state, evt);
1318 }
1319 
1320 static void node_lost_contact(struct tipc_node *n,
1321                               struct sk_buff_head *inputq)
1322 {
1323         struct tipc_sock_conn *conn, *safe;
1324         struct tipc_link *l;
1325         struct list_head *conns = &n->conn_sks;
1326         struct sk_buff *skb;
1327         uint i;
1328 
1329         pr_debug("Lost contact with %x\n", n->addr);
1330         n->delete_at = jiffies + msecs_to_jiffies(NODE_CLEANUP_AFTER);
1331         trace_tipc_node_lost_contact(n, true, " ");
1332 
1333         /* Clean up broadcast state */
1334         tipc_bcast_remove_peer(n->net, n->bc_entry.link);
1335 
1336         /* Abort any ongoing link failover */
1337         for (i = 0; i < MAX_BEARERS; i++) {
1338                 l = n->links[i].link;
1339                 if (l)
1340                         tipc_link_fsm_evt(l, LINK_FAILOVER_END_EVT);
1341         }
1342 
1343         /* Notify publications from this node */
1344         n->action_flags |= TIPC_NOTIFY_NODE_DOWN;
1345 
1346         /* Notify sockets connected to node */
1347         list_for_each_entry_safe(conn, safe, conns, list) {
1348                 skb = tipc_msg_create(TIPC_CRITICAL_IMPORTANCE, TIPC_CONN_MSG,
1349                                       SHORT_H_SIZE, 0, tipc_own_addr(n->net),
1350                                       conn->peer_node, conn->port,
1351                                       conn->peer_port, TIPC_ERR_NO_NODE);
1352                 if (likely(skb))
1353                         skb_queue_tail(inputq, skb);
1354                 list_del(&conn->list);
1355                 kfree(conn);
1356         }
1357 }
1358 
1359 /**
1360  * tipc_node_get_linkname - get the name of a link
1361  *
1362  * @bearer_id: id of the bearer
1363  * @node: peer node address
1364  * @linkname: link name output buffer
1365  *
1366  * Returns 0 on success
1367  */
1368 int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 addr,
1369                            char *linkname, size_t len)
1370 {
1371         struct tipc_link *link;
1372         int err = -EINVAL;
1373         struct tipc_node *node = tipc_node_find(net, addr);
1374 
1375         if (!node)
1376                 return err;
1377 
1378         if (bearer_id >= MAX_BEARERS)
1379                 goto exit;
1380 
1381         tipc_node_read_lock(node);
1382         link = node->links[bearer_id].link;
1383         if (link) {
1384                 strncpy(linkname, tipc_link_name(link), len);
1385                 err = 0;
1386         }
1387         tipc_node_read_unlock(node);
1388 exit:
1389         tipc_node_put(node);
1390         return err;
1391 }
1392 
1393 /* Caller should hold node lock for the passed node */
1394 static int __tipc_nl_add_node(struct tipc_nl_msg *msg, struct tipc_node *node)
1395 {
1396         void *hdr;
1397         struct nlattr *attrs;
1398 
1399         hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
1400                           NLM_F_MULTI, TIPC_NL_NODE_GET);
1401         if (!hdr)
1402                 return -EMSGSIZE;
1403 
1404         attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_NODE);
1405         if (!attrs)
1406                 goto msg_full;
1407 
1408         if (nla_put_u32(msg->skb, TIPC_NLA_NODE_ADDR, node->addr))
1409                 goto attr_msg_full;
1410         if (node_is_up(node))
1411                 if (nla_put_flag(msg->skb, TIPC_NLA_NODE_UP))
1412                         goto attr_msg_full;
1413 
1414         nla_nest_end(msg->skb, attrs);
1415         genlmsg_end(msg->skb, hdr);
1416 
1417         return 0;
1418 
1419 attr_msg_full:
1420         nla_nest_cancel(msg->skb, attrs);
1421 msg_full:
1422         genlmsg_cancel(msg->skb, hdr);
1423 
1424         return -EMSGSIZE;
1425 }
1426 
1427 /**
1428  * tipc_node_xmit() is the general link level function for message sending
1429  * @net: the applicable net namespace
1430  * @list: chain of buffers containing message
1431  * @dnode: address of destination node
1432  * @selector: a number used for deterministic link selection
1433  * Consumes the buffer chain.
1434  * Returns 0 if success, otherwise: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE,-ENOBUF
1435  */
1436 int tipc_node_xmit(struct net *net, struct sk_buff_head *list,
1437                    u32 dnode, int selector)
1438 {
1439         struct tipc_link_entry *le = NULL;
1440         struct tipc_node *n;
1441         struct sk_buff_head xmitq;
1442         int bearer_id;
1443         int rc;
1444 
1445         if (in_own_node(net, dnode)) {
1446                 tipc_loopback_trace(net, list);
1447                 spin_lock_init(&list->lock);
1448                 tipc_sk_rcv(net, list);
1449                 return 0;
1450         }
1451 
1452         n = tipc_node_find(net, dnode);
1453         if (unlikely(!n)) {
1454                 __skb_queue_purge(list);
1455                 return -EHOSTUNREACH;
1456         }
1457 
1458         tipc_node_read_lock(n);
1459         bearer_id = n->active_links[selector & 1];
1460         if (unlikely(bearer_id == INVALID_BEARER_ID)) {
1461                 tipc_node_read_unlock(n);
1462                 tipc_node_put(n);
1463                 __skb_queue_purge(list);
1464                 return -EHOSTUNREACH;
1465         }
1466 
1467         __skb_queue_head_init(&xmitq);
1468         le = &n->links[bearer_id];
1469         spin_lock_bh(&le->lock);
1470         rc = tipc_link_xmit(le->link, list, &xmitq);
1471         spin_unlock_bh(&le->lock);
1472         tipc_node_read_unlock(n);
1473 
1474         if (unlikely(rc == -ENOBUFS))
1475                 tipc_node_link_down(n, bearer_id, false);
1476         else
1477                 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1478 
1479         tipc_node_put(n);
1480 
1481         return rc;
1482 }
1483 
1484 /* tipc_node_xmit_skb(): send single buffer to destination
1485  * Buffers sent via this functon are generally TIPC_SYSTEM_IMPORTANCE
1486  * messages, which will not be rejected
1487  * The only exception is datagram messages rerouted after secondary
1488  * lookup, which are rare and safe to dispose of anyway.
1489  */
1490 int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dnode,
1491                        u32 selector)
1492 {
1493         struct sk_buff_head head;
1494 
1495         __skb_queue_head_init(&head);
1496         __skb_queue_tail(&head, skb);
1497         tipc_node_xmit(net, &head, dnode, selector);
1498         return 0;
1499 }
1500 
1501 /* tipc_node_distr_xmit(): send single buffer msgs to individual destinations
1502  * Note: this is only for SYSTEM_IMPORTANCE messages, which cannot be rejected
1503  */
1504 int tipc_node_distr_xmit(struct net *net, struct sk_buff_head *xmitq)
1505 {
1506         struct sk_buff *skb;
1507         u32 selector, dnode;
1508 
1509         while ((skb = __skb_dequeue(xmitq))) {
1510                 selector = msg_origport(buf_msg(skb));
1511                 dnode = msg_destnode(buf_msg(skb));
1512                 tipc_node_xmit_skb(net, skb, dnode, selector);
1513         }
1514         return 0;
1515 }
1516 
1517 void tipc_node_broadcast(struct net *net, struct sk_buff *skb)
1518 {
1519         struct sk_buff *txskb;
1520         struct tipc_node *n;
1521         u32 dst;
1522 
1523         rcu_read_lock();
1524         list_for_each_entry_rcu(n, tipc_nodes(net), list) {
1525                 dst = n->addr;
1526                 if (in_own_node(net, dst))
1527                         continue;
1528                 if (!node_is_up(n))
1529                         continue;
1530                 txskb = pskb_copy(skb, GFP_ATOMIC);
1531                 if (!txskb)
1532                         break;
1533                 msg_set_destnode(buf_msg(txskb), dst);
1534                 tipc_node_xmit_skb(net, txskb, dst, 0);
1535         }
1536         rcu_read_unlock();
1537 
1538         kfree_skb(skb);
1539 }
1540 
1541 static void tipc_node_mcast_rcv(struct tipc_node *n)
1542 {
1543         struct tipc_bclink_entry *be = &n->bc_entry;
1544 
1545         /* 'arrvq' is under inputq2's lock protection */
1546         spin_lock_bh(&be->inputq2.lock);
1547         spin_lock_bh(&be->inputq1.lock);
1548         skb_queue_splice_tail_init(&be->inputq1, &be->arrvq);
1549         spin_unlock_bh(&be->inputq1.lock);
1550         spin_unlock_bh(&be->inputq2.lock);
1551         tipc_sk_mcast_rcv(n->net, &be->arrvq, &be->inputq2);
1552 }
1553 
1554 static void tipc_node_bc_sync_rcv(struct tipc_node *n, struct tipc_msg *hdr,
1555                                   int bearer_id, struct sk_buff_head *xmitq)
1556 {
1557         struct tipc_link *ucl;
1558         int rc;
1559 
1560         rc = tipc_bcast_sync_rcv(n->net, n->bc_entry.link, hdr);
1561 
1562         if (rc & TIPC_LINK_DOWN_EVT) {
1563                 tipc_node_reset_links(n);
1564                 return;
1565         }
1566 
1567         if (!(rc & TIPC_LINK_SND_STATE))
1568                 return;
1569 
1570         /* If probe message, a STATE response will be sent anyway */
1571         if (msg_probe(hdr))
1572                 return;
1573 
1574         /* Produce a STATE message carrying broadcast NACK */
1575         tipc_node_read_lock(n);
1576         ucl = n->links[bearer_id].link;
1577         if (ucl)
1578                 tipc_link_build_state_msg(ucl, xmitq);
1579         tipc_node_read_unlock(n);
1580 }
1581 
1582 /**
1583  * tipc_node_bc_rcv - process TIPC broadcast packet arriving from off-node
1584  * @net: the applicable net namespace
1585  * @skb: TIPC packet
1586  * @bearer_id: id of bearer message arrived on
1587  *
1588  * Invoked with no locks held.
1589  */
1590 static void tipc_node_bc_rcv(struct net *net, struct sk_buff *skb, int bearer_id)
1591 {
1592         int rc;
1593         struct sk_buff_head xmitq;
1594         struct tipc_bclink_entry *be;
1595         struct tipc_link_entry *le;
1596         struct tipc_msg *hdr = buf_msg(skb);
1597         int usr = msg_user(hdr);
1598         u32 dnode = msg_destnode(hdr);
1599         struct tipc_node *n;
1600 
1601         __skb_queue_head_init(&xmitq);
1602 
1603         /* If NACK for other node, let rcv link for that node peek into it */
1604         if ((usr == BCAST_PROTOCOL) && (dnode != tipc_own_addr(net)))
1605                 n = tipc_node_find(net, dnode);
1606         else
1607                 n = tipc_node_find(net, msg_prevnode(hdr));
1608         if (!n) {
1609                 kfree_skb(skb);
1610                 return;
1611         }
1612         be = &n->bc_entry;
1613         le = &n->links[bearer_id];
1614 
1615         rc = tipc_bcast_rcv(net, be->link, skb);
1616 
1617         /* Broadcast ACKs are sent on a unicast link */
1618         if (rc & TIPC_LINK_SND_STATE) {
1619                 tipc_node_read_lock(n);
1620                 tipc_link_build_state_msg(le->link, &xmitq);
1621                 tipc_node_read_unlock(n);
1622         }
1623 
1624         if (!skb_queue_empty(&xmitq))
1625                 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1626 
1627         if (!skb_queue_empty(&be->inputq1))
1628                 tipc_node_mcast_rcv(n);
1629 
1630         /* Handle NAME_DISTRIBUTOR messages sent from 1.7 nodes */
1631         if (!skb_queue_empty(&n->bc_entry.namedq))
1632                 tipc_named_rcv(net, &n->bc_entry.namedq);
1633 
1634         /* If reassembly or retransmission failure => reset all links to peer */
1635         if (rc & TIPC_LINK_DOWN_EVT)
1636                 tipc_node_reset_links(n);
1637 
1638         tipc_node_put(n);
1639 }
1640 
1641 /**
1642  * tipc_node_check_state - check and if necessary update node state
1643  * @skb: TIPC packet
1644  * @bearer_id: identity of bearer delivering the packet
1645  * Returns true if state and msg are ok, otherwise false
1646  */
1647 static bool tipc_node_check_state(struct tipc_node *n, struct sk_buff *skb,
1648                                   int bearer_id, struct sk_buff_head *xmitq)
1649 {
1650         struct tipc_msg *hdr = buf_msg(skb);
1651         int usr = msg_user(hdr);
1652         int mtyp = msg_type(hdr);
1653         u16 oseqno = msg_seqno(hdr);
1654         u16 exp_pkts = msg_msgcnt(hdr);
1655         u16 rcv_nxt, syncpt, dlv_nxt, inputq_len;
1656         int state = n->state;
1657         struct tipc_link *l, *tnl, *pl = NULL;
1658         struct tipc_media_addr *maddr;
1659         int pb_id;
1660 
1661         if (trace_tipc_node_check_state_enabled()) {
1662                 trace_tipc_skb_dump(skb, false, "skb for node state check");
1663                 trace_tipc_node_check_state(n, true, " ");
1664         }
1665         l = n->links[bearer_id].link;
1666         if (!l)
1667                 return false;
1668         rcv_nxt = tipc_link_rcv_nxt(l);
1669 
1670 
1671         if (likely((state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL)))
1672                 return true;
1673 
1674         /* Find parallel link, if any */
1675         for (pb_id = 0; pb_id < MAX_BEARERS; pb_id++) {
1676                 if ((pb_id != bearer_id) && n->links[pb_id].link) {
1677                         pl = n->links[pb_id].link;
1678                         break;
1679                 }
1680         }
1681 
1682         if (!tipc_link_validate_msg(l, hdr)) {
1683                 trace_tipc_skb_dump(skb, false, "PROTO invalid (2)!");
1684                 trace_tipc_link_dump(l, TIPC_DUMP_NONE, "PROTO invalid (2)!");
1685                 return false;
1686         }
1687 
1688         /* Check and update node accesibility if applicable */
1689         if (state == SELF_UP_PEER_COMING) {
1690                 if (!tipc_link_is_up(l))
1691                         return true;
1692                 if (!msg_peer_link_is_up(hdr))
1693                         return true;
1694                 tipc_node_fsm_evt(n, PEER_ESTABL_CONTACT_EVT);
1695         }
1696 
1697         if (state == SELF_DOWN_PEER_LEAVING) {
1698                 if (msg_peer_node_is_up(hdr))
1699                         return false;
1700                 tipc_node_fsm_evt(n, PEER_LOST_CONTACT_EVT);
1701                 return true;
1702         }
1703 
1704         if (state == SELF_LEAVING_PEER_DOWN)
1705                 return false;
1706 
1707         /* Ignore duplicate packets */
1708         if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt))
1709                 return true;
1710 
1711         /* Initiate or update failover mode if applicable */
1712         if ((usr == TUNNEL_PROTOCOL) && (mtyp == FAILOVER_MSG)) {
1713                 syncpt = oseqno + exp_pkts - 1;
1714                 if (pl && !tipc_link_is_reset(pl)) {
1715                         __tipc_node_link_down(n, &pb_id, xmitq, &maddr);
1716                         trace_tipc_node_link_down(n, true,
1717                                                   "node link down <- failover!");
1718                         tipc_skb_queue_splice_tail_init(tipc_link_inputq(pl),
1719                                                         tipc_link_inputq(l));
1720                 }
1721 
1722                 /* If parallel link was already down, and this happened before
1723                  * the tunnel link came up, node failover was never started.
1724                  * Ensure that a FAILOVER_MSG is sent to get peer out of
1725                  * NODE_FAILINGOVER state, also this node must accept
1726                  * TUNNEL_MSGs from peer.
1727                  */
1728                 if (n->state != NODE_FAILINGOVER)
1729                         tipc_node_link_failover(n, pl, l, xmitq);
1730 
1731                 /* If pkts arrive out of order, use lowest calculated syncpt */
1732                 if (less(syncpt, n->sync_point))
1733                         n->sync_point = syncpt;
1734         }
1735 
1736         /* Open parallel link when tunnel link reaches synch point */
1737         if ((n->state == NODE_FAILINGOVER) && tipc_link_is_up(l)) {
1738                 if (!more(rcv_nxt, n->sync_point))
1739                         return true;
1740                 tipc_node_fsm_evt(n, NODE_FAILOVER_END_EVT);
1741                 if (pl)
1742                         tipc_link_fsm_evt(pl, LINK_FAILOVER_END_EVT);
1743                 return true;
1744         }
1745 
1746         /* No synching needed if only one link */
1747         if (!pl || !tipc_link_is_up(pl))
1748                 return true;
1749 
1750         /* Initiate synch mode if applicable */
1751         if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG) && (oseqno == 1)) {
1752                 if (n->capabilities & TIPC_TUNNEL_ENHANCED)
1753                         syncpt = msg_syncpt(hdr);
1754                 else
1755                         syncpt = msg_seqno(msg_inner_hdr(hdr)) + exp_pkts - 1;
1756                 if (!tipc_link_is_up(l))
1757                         __tipc_node_link_up(n, bearer_id, xmitq);
1758                 if (n->state == SELF_UP_PEER_UP) {
1759                         n->sync_point = syncpt;
1760                         tipc_link_fsm_evt(l, LINK_SYNCH_BEGIN_EVT);
1761                         tipc_node_fsm_evt(n, NODE_SYNCH_BEGIN_EVT);
1762                 }
1763         }
1764 
1765         /* Open tunnel link when parallel link reaches synch point */
1766         if (n->state == NODE_SYNCHING) {
1767                 if (tipc_link_is_synching(l)) {
1768                         tnl = l;
1769                 } else {
1770                         tnl = pl;
1771                         pl = l;
1772                 }
1773                 inputq_len = skb_queue_len(tipc_link_inputq(pl));
1774                 dlv_nxt = tipc_link_rcv_nxt(pl) - inputq_len;
1775                 if (more(dlv_nxt, n->sync_point)) {
1776                         tipc_link_fsm_evt(tnl, LINK_SYNCH_END_EVT);
1777                         tipc_node_fsm_evt(n, NODE_SYNCH_END_EVT);
1778                         return true;
1779                 }
1780                 if (l == pl)
1781                         return true;
1782                 if ((usr == TUNNEL_PROTOCOL) && (mtyp == SYNCH_MSG))
1783                         return true;
1784                 if (usr == LINK_PROTOCOL)
1785                         return true;
1786                 return false;
1787         }
1788         return true;
1789 }
1790 
1791 /**
1792  * tipc_rcv - process TIPC packets/messages arriving from off-node
1793  * @net: the applicable net namespace
1794  * @skb: TIPC packet
1795  * @bearer: pointer to bearer message arrived on
1796  *
1797  * Invoked with no locks held. Bearer pointer must point to a valid bearer
1798  * structure (i.e. cannot be NULL), but bearer can be inactive.
1799  */
1800 void tipc_rcv(struct net *net, struct sk_buff *skb, struct tipc_bearer *b)
1801 {
1802         struct sk_buff_head xmitq;
1803         struct tipc_node *n;
1804         struct tipc_msg *hdr;
1805         int bearer_id = b->identity;
1806         struct tipc_link_entry *le;
1807         u32 self = tipc_own_addr(net);
1808         int usr, rc = 0;
1809         u16 bc_ack;
1810 
1811         __skb_queue_head_init(&xmitq);
1812 
1813         /* Ensure message is well-formed before touching the header */
1814         TIPC_SKB_CB(skb)->validated = false;
1815         if (unlikely(!tipc_msg_validate(&skb)))
1816                 goto discard;
1817         hdr = buf_msg(skb);
1818         usr = msg_user(hdr);
1819         bc_ack = msg_bcast_ack(hdr);
1820 
1821         /* Handle arrival of discovery or broadcast packet */
1822         if (unlikely(msg_non_seq(hdr))) {
1823                 if (unlikely(usr == LINK_CONFIG))
1824                         return tipc_disc_rcv(net, skb, b);
1825                 else
1826                         return tipc_node_bc_rcv(net, skb, bearer_id);
1827         }
1828 
1829         /* Discard unicast link messages destined for another node */
1830         if (unlikely(!msg_short(hdr) && (msg_destnode(hdr) != self)))
1831                 goto discard;
1832 
1833         /* Locate neighboring node that sent packet */
1834         n = tipc_node_find(net, msg_prevnode(hdr));
1835         if (unlikely(!n))
1836                 goto discard;
1837         le = &n->links[bearer_id];
1838 
1839         /* Ensure broadcast reception is in synch with peer's send state */
1840         if (unlikely(usr == LINK_PROTOCOL))
1841                 tipc_node_bc_sync_rcv(n, hdr, bearer_id, &xmitq);
1842         else if (unlikely(tipc_link_acked(n->bc_entry.link) != bc_ack))
1843                 tipc_bcast_ack_rcv(net, n->bc_entry.link, hdr);
1844 
1845         /* Receive packet directly if conditions permit */
1846         tipc_node_read_lock(n);
1847         if (likely((n->state == SELF_UP_PEER_UP) && (usr != TUNNEL_PROTOCOL))) {
1848                 spin_lock_bh(&le->lock);
1849                 if (le->link) {
1850                         rc = tipc_link_rcv(le->link, skb, &xmitq);
1851                         skb = NULL;
1852                 }
1853                 spin_unlock_bh(&le->lock);
1854         }
1855         tipc_node_read_unlock(n);
1856 
1857         /* Check/update node state before receiving */
1858         if (unlikely(skb)) {
1859                 if (unlikely(skb_linearize(skb)))
1860                         goto discard;
1861                 tipc_node_write_lock(n);
1862                 if (tipc_node_check_state(n, skb, bearer_id, &xmitq)) {
1863                         if (le->link) {
1864                                 rc = tipc_link_rcv(le->link, skb, &xmitq);
1865                                 skb = NULL;
1866                         }
1867                 }
1868                 tipc_node_write_unlock(n);
1869         }
1870 
1871         if (unlikely(rc & TIPC_LINK_UP_EVT))
1872                 tipc_node_link_up(n, bearer_id, &xmitq);
1873 
1874         if (unlikely(rc & TIPC_LINK_DOWN_EVT))
1875                 tipc_node_link_down(n, bearer_id, false);
1876 
1877         if (unlikely(!skb_queue_empty(&n->bc_entry.namedq)))
1878                 tipc_named_rcv(net, &n->bc_entry.namedq);
1879 
1880         if (unlikely(!skb_queue_empty(&n->bc_entry.inputq1)))
1881                 tipc_node_mcast_rcv(n);
1882 
1883         if (!skb_queue_empty(&le->inputq))
1884                 tipc_sk_rcv(net, &le->inputq);
1885 
1886         if (!skb_queue_empty(&xmitq))
1887                 tipc_bearer_xmit(net, bearer_id, &xmitq, &le->maddr);
1888 
1889         tipc_node_put(n);
1890 discard:
1891         kfree_skb(skb);
1892 }
1893 
1894 void tipc_node_apply_property(struct net *net, struct tipc_bearer *b,
1895                               int prop)
1896 {
1897         struct tipc_net *tn = tipc_net(net);
1898         int bearer_id = b->identity;
1899         struct sk_buff_head xmitq;
1900         struct tipc_link_entry *e;
1901         struct tipc_node *n;
1902 
1903         __skb_queue_head_init(&xmitq);
1904 
1905         rcu_read_lock();
1906 
1907         list_for_each_entry_rcu(n, &tn->node_list, list) {
1908                 tipc_node_write_lock(n);
1909                 e = &n->links[bearer_id];
1910                 if (e->link) {
1911                         if (prop == TIPC_NLA_PROP_TOL)
1912                                 tipc_link_set_tolerance(e->link, b->tolerance,
1913                                                         &xmitq);
1914                         else if (prop == TIPC_NLA_PROP_MTU)
1915                                 tipc_link_set_mtu(e->link, b->mtu);
1916                 }
1917                 tipc_node_write_unlock(n);
1918                 tipc_bearer_xmit(net, bearer_id, &xmitq, &e->maddr);
1919         }
1920 
1921         rcu_read_unlock();
1922 }
1923 
1924 int tipc_nl_peer_rm(struct sk_buff *skb, struct genl_info *info)
1925 {
1926         struct net *net = sock_net(skb->sk);
1927         struct tipc_net *tn = net_generic(net, tipc_net_id);
1928         struct nlattr *attrs[TIPC_NLA_NET_MAX + 1];
1929         struct tipc_node *peer;
1930         u32 addr;
1931         int err;
1932 
1933         /* We identify the peer by its net */
1934         if (!info->attrs[TIPC_NLA_NET])
1935                 return -EINVAL;
1936 
1937         err = nla_parse_nested_deprecated(attrs, TIPC_NLA_NET_MAX,
1938                                           info->attrs[TIPC_NLA_NET],
1939                                           tipc_nl_net_policy, info->extack);
1940         if (err)
1941                 return err;
1942 
1943         if (!attrs[TIPC_NLA_NET_ADDR])
1944                 return -EINVAL;
1945 
1946         addr = nla_get_u32(attrs[TIPC_NLA_NET_ADDR]);
1947 
1948         if (in_own_node(net, addr))
1949                 return -ENOTSUPP;
1950 
1951         spin_lock_bh(&tn->node_list_lock);
1952         peer = tipc_node_find(net, addr);
1953         if (!peer) {
1954                 spin_unlock_bh(&tn->node_list_lock);
1955                 return -ENXIO;
1956         }
1957 
1958         tipc_node_write_lock(peer);
1959         if (peer->state != SELF_DOWN_PEER_DOWN &&
1960             peer->state != SELF_DOWN_PEER_LEAVING) {
1961                 tipc_node_write_unlock(peer);
1962                 err = -EBUSY;
1963                 goto err_out;
1964         }
1965 
1966         tipc_node_clear_links(peer);
1967         tipc_node_write_unlock(peer);
1968         tipc_node_delete(peer);
1969 
1970         err = 0;
1971 err_out:
1972         tipc_node_put(peer);
1973         spin_unlock_bh(&tn->node_list_lock);
1974 
1975         return err;
1976 }
1977 
1978 int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb)
1979 {
1980         int err;
1981         struct net *net = sock_net(skb->sk);
1982         struct tipc_net *tn = net_generic(net, tipc_net_id);
1983         int done = cb->args[0];
1984         int last_addr = cb->args[1];
1985         struct tipc_node *node;
1986         struct tipc_nl_msg msg;
1987 
1988         if (done)
1989                 return 0;
1990 
1991         msg.skb = skb;
1992         msg.portid = NETLINK_CB(cb->skb).portid;
1993         msg.seq = cb->nlh->nlmsg_seq;
1994 
1995         rcu_read_lock();
1996         if (last_addr) {
1997                 node = tipc_node_find(net, last_addr);
1998                 if (!node) {
1999                         rcu_read_unlock();
2000                         /* We never set seq or call nl_dump_check_consistent()
2001                          * this means that setting prev_seq here will cause the
2002                          * consistence check to fail in the netlink callback
2003                          * handler. Resulting in the NLMSG_DONE message having
2004                          * the NLM_F_DUMP_INTR flag set if the node state
2005                          * changed while we released the lock.
2006                          */
2007                         cb->prev_seq = 1;
2008                         return -EPIPE;
2009                 }
2010                 tipc_node_put(node);
2011         }
2012 
2013         list_for_each_entry_rcu(node, &tn->node_list, list) {
2014                 if (last_addr) {
2015                         if (node->addr == last_addr)
2016                                 last_addr = 0;
2017                         else
2018                                 continue;
2019                 }
2020 
2021                 tipc_node_read_lock(node);
2022                 err = __tipc_nl_add_node(&msg, node);
2023                 if (err) {
2024                         last_addr = node->addr;
2025                         tipc_node_read_unlock(node);
2026                         goto out;
2027                 }
2028 
2029                 tipc_node_read_unlock(node);
2030         }
2031         done = 1;
2032 out:
2033         cb->args[0] = done;
2034         cb->args[1] = last_addr;
2035         rcu_read_unlock();
2036 
2037         return skb->len;
2038 }
2039 
2040 /* tipc_node_find_by_name - locate owner node of link by link's name
2041  * @net: the applicable net namespace
2042  * @name: pointer to link name string
2043  * @bearer_id: pointer to index in 'node->links' array where the link was found.
2044  *
2045  * Returns pointer to node owning the link, or 0 if no matching link is found.
2046  */
2047 static struct tipc_node *tipc_node_find_by_name(struct net *net,
2048                                                 const char *link_name,
2049                                                 unsigned int *bearer_id)
2050 {
2051         struct tipc_net *tn = net_generic(net, tipc_net_id);
2052         struct tipc_link *l;
2053         struct tipc_node *n;
2054         struct tipc_node *found_node = NULL;
2055         int i;
2056 
2057         *bearer_id = 0;
2058         rcu_read_lock();
2059         list_for_each_entry_rcu(n, &tn->node_list, list) {
2060                 tipc_node_read_lock(n);
2061                 for (i = 0; i < MAX_BEARERS; i++) {
2062                         l = n->links[i].link;
2063                         if (l && !strcmp(tipc_link_name(l), link_name)) {
2064                                 *bearer_id = i;
2065                                 found_node = n;
2066                                 break;
2067                         }
2068                 }
2069                 tipc_node_read_unlock(n);
2070                 if (found_node)
2071                         break;
2072         }
2073         rcu_read_unlock();
2074 
2075         return found_node;
2076 }
2077 
2078 int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info)
2079 {
2080         int err;
2081         int res = 0;
2082         int bearer_id;
2083         char *name;
2084         struct tipc_link *link;
2085         struct tipc_node *node;
2086         struct sk_buff_head xmitq;
2087         struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2088         struct net *net = sock_net(skb->sk);
2089 
2090         __skb_queue_head_init(&xmitq);
2091 
2092         if (!info->attrs[TIPC_NLA_LINK])
2093                 return -EINVAL;
2094 
2095         err = nla_parse_nested_deprecated(attrs, TIPC_NLA_LINK_MAX,
2096                                           info->attrs[TIPC_NLA_LINK],
2097                                           tipc_nl_link_policy, info->extack);
2098         if (err)
2099                 return err;
2100 
2101         if (!attrs[TIPC_NLA_LINK_NAME])
2102                 return -EINVAL;
2103 
2104         name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2105 
2106         if (strcmp(name, tipc_bclink_name) == 0)
2107                 return tipc_nl_bc_link_set(net, attrs);
2108 
2109         node = tipc_node_find_by_name(net, name, &bearer_id);
2110         if (!node)
2111                 return -EINVAL;
2112 
2113         tipc_node_read_lock(node);
2114 
2115         link = node->links[bearer_id].link;
2116         if (!link) {
2117                 res = -EINVAL;
2118                 goto out;
2119         }
2120 
2121         if (attrs[TIPC_NLA_LINK_PROP]) {
2122                 struct nlattr *props[TIPC_NLA_PROP_MAX + 1];
2123 
2124                 err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP],
2125                                               props);
2126                 if (err) {
2127                         res = err;
2128                         goto out;
2129                 }
2130 
2131                 if (props[TIPC_NLA_PROP_TOL]) {
2132                         u32 tol;
2133 
2134                         tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]);
2135                         tipc_link_set_tolerance(link, tol, &xmitq);
2136                 }
2137                 if (props[TIPC_NLA_PROP_PRIO]) {
2138                         u32 prio;
2139 
2140                         prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]);
2141                         tipc_link_set_prio(link, prio, &xmitq);
2142                 }
2143                 if (props[TIPC_NLA_PROP_WIN]) {
2144                         u32 win;
2145 
2146                         win = nla_get_u32(props[TIPC_NLA_PROP_WIN]);
2147                         tipc_link_set_queue_limits(link, win);
2148                 }
2149         }
2150 
2151 out:
2152         tipc_node_read_unlock(node);
2153         tipc_bearer_xmit(net, bearer_id, &xmitq, &node->links[bearer_id].maddr);
2154         return res;
2155 }
2156 
2157 int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info)
2158 {
2159         struct net *net = genl_info_net(info);
2160         struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2161         struct tipc_nl_msg msg;
2162         char *name;
2163         int err;
2164 
2165         msg.portid = info->snd_portid;
2166         msg.seq = info->snd_seq;
2167 
2168         if (!info->attrs[TIPC_NLA_LINK])
2169                 return -EINVAL;
2170 
2171         err = nla_parse_nested_deprecated(attrs, TIPC_NLA_LINK_MAX,
2172                                           info->attrs[TIPC_NLA_LINK],
2173                                           tipc_nl_link_policy, info->extack);
2174         if (err)
2175                 return err;
2176 
2177         if (!attrs[TIPC_NLA_LINK_NAME])
2178                 return -EINVAL;
2179 
2180         name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2181 
2182         msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2183         if (!msg.skb)
2184                 return -ENOMEM;
2185 
2186         if (strcmp(name, tipc_bclink_name) == 0) {
2187                 err = tipc_nl_add_bc_link(net, &msg);
2188                 if (err)
2189                         goto err_free;
2190         } else {
2191                 int bearer_id;
2192                 struct tipc_node *node;
2193                 struct tipc_link *link;
2194 
2195                 node = tipc_node_find_by_name(net, name, &bearer_id);
2196                 if (!node) {
2197                         err = -EINVAL;
2198                         goto err_free;
2199                 }
2200 
2201                 tipc_node_read_lock(node);
2202                 link = node->links[bearer_id].link;
2203                 if (!link) {
2204                         tipc_node_read_unlock(node);
2205                         err = -EINVAL;
2206                         goto err_free;
2207                 }
2208 
2209                 err = __tipc_nl_add_link(net, &msg, link, 0);
2210                 tipc_node_read_unlock(node);
2211                 if (err)
2212                         goto err_free;
2213         }
2214 
2215         return genlmsg_reply(msg.skb, info);
2216 
2217 err_free:
2218         nlmsg_free(msg.skb);
2219         return err;
2220 }
2221 
2222 int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info)
2223 {
2224         int err;
2225         char *link_name;
2226         unsigned int bearer_id;
2227         struct tipc_link *link;
2228         struct tipc_node *node;
2229         struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1];
2230         struct net *net = sock_net(skb->sk);
2231         struct tipc_link_entry *le;
2232 
2233         if (!info->attrs[TIPC_NLA_LINK])
2234                 return -EINVAL;
2235 
2236         err = nla_parse_nested_deprecated(attrs, TIPC_NLA_LINK_MAX,
2237                                           info->attrs[TIPC_NLA_LINK],
2238                                           tipc_nl_link_policy, info->extack);
2239         if (err)
2240                 return err;
2241 
2242         if (!attrs[TIPC_NLA_LINK_NAME])
2243                 return -EINVAL;
2244 
2245         link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]);
2246 
2247         if (strcmp(link_name, tipc_bclink_name) == 0) {
2248                 err = tipc_bclink_reset_stats(net);
2249                 if (err)
2250                         return err;
2251                 return 0;
2252         }
2253 
2254         node = tipc_node_find_by_name(net, link_name, &bearer_id);
2255         if (!node)
2256                 return -EINVAL;
2257 
2258         le = &node->links[bearer_id];
2259         tipc_node_read_lock(node);
2260         spin_lock_bh(&le->lock);
2261         link = node->links[bearer_id].link;
2262         if (!link) {
2263                 spin_unlock_bh(&le->lock);
2264                 tipc_node_read_unlock(node);
2265                 return -EINVAL;
2266         }
2267         tipc_link_reset_stats(link);
2268         spin_unlock_bh(&le->lock);
2269         tipc_node_read_unlock(node);
2270         return 0;
2271 }
2272 
2273 /* Caller should hold node lock  */
2274 static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg,
2275                                     struct tipc_node *node, u32 *prev_link)
2276 {
2277         u32 i;
2278         int err;
2279 
2280         for (i = *prev_link; i < MAX_BEARERS; i++) {
2281                 *prev_link = i;
2282 
2283                 if (!node->links[i].link)
2284                         continue;
2285 
2286                 err = __tipc_nl_add_link(net, msg,
2287                                          node->links[i].link, NLM_F_MULTI);
2288                 if (err)
2289                         return err;
2290         }
2291         *prev_link = 0;
2292 
2293         return 0;
2294 }
2295 
2296 int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb)
2297 {
2298         struct net *net = sock_net(skb->sk);
2299         struct tipc_net *tn = net_generic(net, tipc_net_id);
2300         struct tipc_node *node;
2301         struct tipc_nl_msg msg;
2302         u32 prev_node = cb->args[0];
2303         u32 prev_link = cb->args[1];
2304         int done = cb->args[2];
2305         int err;
2306 
2307         if (done)
2308                 return 0;
2309 
2310         msg.skb = skb;
2311         msg.portid = NETLINK_CB(cb->skb).portid;
2312         msg.seq = cb->nlh->nlmsg_seq;
2313 
2314         rcu_read_lock();
2315         if (prev_node) {
2316                 node = tipc_node_find(net, prev_node);
2317                 if (!node) {
2318                         /* We never set seq or call nl_dump_check_consistent()
2319                          * this means that setting prev_seq here will cause the
2320                          * consistence check to fail in the netlink callback
2321                          * handler. Resulting in the last NLMSG_DONE message
2322                          * having the NLM_F_DUMP_INTR flag set.
2323                          */
2324                         cb->prev_seq = 1;
2325                         goto out;
2326                 }
2327                 tipc_node_put(node);
2328 
2329                 list_for_each_entry_continue_rcu(node, &tn->node_list,
2330                                                  list) {
2331                         tipc_node_read_lock(node);
2332                         err = __tipc_nl_add_node_links(net, &msg, node,
2333                                                        &prev_link);
2334                         tipc_node_read_unlock(node);
2335                         if (err)
2336                                 goto out;
2337 
2338                         prev_node = node->addr;
2339                 }
2340         } else {
2341                 err = tipc_nl_add_bc_link(net, &msg);
2342                 if (err)
2343                         goto out;
2344 
2345                 list_for_each_entry_rcu(node, &tn->node_list, list) {
2346                         tipc_node_read_lock(node);
2347                         err = __tipc_nl_add_node_links(net, &msg, node,
2348                                                        &prev_link);
2349                         tipc_node_read_unlock(node);
2350                         if (err)
2351                                 goto out;
2352 
2353                         prev_node = node->addr;
2354                 }
2355         }
2356         done = 1;
2357 out:
2358         rcu_read_unlock();
2359 
2360         cb->args[0] = prev_node;
2361         cb->args[1] = prev_link;
2362         cb->args[2] = done;
2363 
2364         return skb->len;
2365 }
2366 
2367 int tipc_nl_node_set_monitor(struct sk_buff *skb, struct genl_info *info)
2368 {
2369         struct nlattr *attrs[TIPC_NLA_MON_MAX + 1];
2370         struct net *net = sock_net(skb->sk);
2371         int err;
2372 
2373         if (!info->attrs[TIPC_NLA_MON])
2374                 return -EINVAL;
2375 
2376         err = nla_parse_nested_deprecated(attrs, TIPC_NLA_MON_MAX,
2377                                           info->attrs[TIPC_NLA_MON],
2378                                           tipc_nl_monitor_policy,
2379                                           info->extack);
2380         if (err)
2381                 return err;
2382 
2383         if (attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]) {
2384                 u32 val;
2385 
2386                 val = nla_get_u32(attrs[TIPC_NLA_MON_ACTIVATION_THRESHOLD]);
2387                 err = tipc_nl_monitor_set_threshold(net, val);
2388                 if (err)
2389                         return err;
2390         }
2391 
2392         return 0;
2393 }
2394 
2395 static int __tipc_nl_add_monitor_prop(struct net *net, struct tipc_nl_msg *msg)
2396 {
2397         struct nlattr *attrs;
2398         void *hdr;
2399         u32 val;
2400 
2401         hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family,
2402                           0, TIPC_NL_MON_GET);
2403         if (!hdr)
2404                 return -EMSGSIZE;
2405 
2406         attrs = nla_nest_start_noflag(msg->skb, TIPC_NLA_MON);
2407         if (!attrs)
2408                 goto msg_full;
2409 
2410         val = tipc_nl_monitor_get_threshold(net);
2411 
2412         if (nla_put_u32(msg->skb, TIPC_NLA_MON_ACTIVATION_THRESHOLD, val))
2413                 goto attr_msg_full;
2414 
2415         nla_nest_end(msg->skb, attrs);
2416         genlmsg_end(msg->skb, hdr);
2417 
2418         return 0;
2419 
2420 attr_msg_full:
2421         nla_nest_cancel(msg->skb, attrs);
2422 msg_full:
2423         genlmsg_cancel(msg->skb, hdr);
2424 
2425         return -EMSGSIZE;
2426 }
2427 
2428 int tipc_nl_node_get_monitor(struct sk_buff *skb, struct genl_info *info)
2429 {
2430         struct net *net = sock_net(skb->sk);
2431         struct tipc_nl_msg msg;
2432         int err;
2433 
2434         msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL);
2435         if (!msg.skb)
2436                 return -ENOMEM;
2437         msg.portid = info->snd_portid;
2438         msg.seq = info->snd_seq;
2439 
2440         err = __tipc_nl_add_monitor_prop(net, &msg);
2441         if (err) {
2442                 nlmsg_free(msg.skb);
2443                 return err;
2444         }
2445 
2446         return genlmsg_reply(msg.skb, info);
2447 }
2448 
2449 int tipc_nl_node_dump_monitor(struct sk_buff *skb, struct netlink_callback *cb)
2450 {
2451         struct net *net = sock_net(skb->sk);
2452         u32 prev_bearer = cb->args[0];
2453         struct tipc_nl_msg msg;
2454         int bearer_id;
2455         int err;
2456 
2457         if (prev_bearer == MAX_BEARERS)
2458                 return 0;
2459 
2460         msg.skb = skb;
2461         msg.portid = NETLINK_CB(cb->skb).portid;
2462         msg.seq = cb->nlh->nlmsg_seq;
2463 
2464         rtnl_lock();
2465         for (bearer_id = prev_bearer; bearer_id < MAX_BEARERS; bearer_id++) {
2466                 err = __tipc_nl_add_monitor(net, &msg, bearer_id);
2467                 if (err)
2468                         break;
2469         }
2470         rtnl_unlock();
2471         cb->args[0] = bearer_id;
2472 
2473         return skb->len;
2474 }
2475 
2476 int tipc_nl_node_dump_monitor_peer(struct sk_buff *skb,
2477                                    struct netlink_callback *cb)
2478 {
2479         struct net *net = sock_net(skb->sk);
2480         u32 prev_node = cb->args[1];
2481         u32 bearer_id = cb->args[2];
2482         int done = cb->args[0];
2483         struct tipc_nl_msg msg;
2484         int err;
2485 
2486         if (!prev_node) {
2487                 struct nlattr **attrs;
2488                 struct nlattr *mon[TIPC_NLA_MON_MAX + 1];
2489 
2490                 err = tipc_nlmsg_parse(cb->nlh, &attrs);
2491                 if (err)
2492                         return err;
2493 
2494                 if (!attrs[TIPC_NLA_MON])
2495                         return -EINVAL;
2496 
2497                 err = nla_parse_nested_deprecated(mon, TIPC_NLA_MON_MAX,
2498                                                   attrs[TIPC_NLA_MON],
2499                                                   tipc_nl_monitor_policy,
2500                                                   NULL);
2501                 if (err)
2502                         return err;
2503 
2504                 if (!mon[TIPC_NLA_MON_REF])
2505                         return -EINVAL;
2506 
2507                 bearer_id = nla_get_u32(mon[TIPC_NLA_MON_REF]);
2508 
2509                 if (bearer_id >= MAX_BEARERS)
2510                         return -EINVAL;
2511         }
2512 
2513         if (done)
2514                 return 0;
2515 
2516         msg.skb = skb;
2517         msg.portid = NETLINK_CB(cb->skb).portid;
2518         msg.seq = cb->nlh->nlmsg_seq;
2519 
2520         rtnl_lock();
2521         err = tipc_nl_add_monitor_peer(net, &msg, bearer_id, &prev_node);
2522         if (!err)
2523                 done = 1;
2524 
2525         rtnl_unlock();
2526         cb->args[0] = done;
2527         cb->args[1] = prev_node;
2528         cb->args[2] = bearer_id;
2529 
2530         return skb->len;
2531 }
2532 
2533 u32 tipc_node_get_addr(struct tipc_node *node)
2534 {
2535         return (node) ? node->addr : 0;
2536 }
2537 
2538 /**
2539  * tipc_node_dump - dump TIPC node data
2540  * @n: tipc node to be dumped
2541  * @more: dump more?
2542  *        - false: dump only tipc node data
2543  *        - true: dump node link data as well
2544  * @buf: returned buffer of dump data in format
2545  */
2546 int tipc_node_dump(struct tipc_node *n, bool more, char *buf)
2547 {
2548         int i = 0;
2549         size_t sz = (more) ? NODE_LMAX : NODE_LMIN;
2550 
2551         if (!n) {
2552                 i += scnprintf(buf, sz, "node data: (null)\n");
2553                 return i;
2554         }
2555 
2556         i += scnprintf(buf, sz, "node data: %x", n->addr);
2557         i += scnprintf(buf + i, sz - i, " %x", n->state);
2558         i += scnprintf(buf + i, sz - i, " %d", n->active_links[0]);
2559         i += scnprintf(buf + i, sz - i, " %d", n->active_links[1]);
2560         i += scnprintf(buf + i, sz - i, " %x", n->action_flags);
2561         i += scnprintf(buf + i, sz - i, " %u", n->failover_sent);
2562         i += scnprintf(buf + i, sz - i, " %u", n->sync_point);
2563         i += scnprintf(buf + i, sz - i, " %d", n->link_cnt);
2564         i += scnprintf(buf + i, sz - i, " %u", n->working_links);
2565         i += scnprintf(buf + i, sz - i, " %x", n->capabilities);
2566         i += scnprintf(buf + i, sz - i, " %lu\n", n->keepalive_intv);
2567 
2568         if (!more)
2569                 return i;
2570 
2571         i += scnprintf(buf + i, sz - i, "link_entry[0]:\n");
2572         i += scnprintf(buf + i, sz - i, " mtu: %u\n", n->links[0].mtu);
2573         i += scnprintf(buf + i, sz - i, " media: ");
2574         i += tipc_media_addr_printf(buf + i, sz - i, &n->links[0].maddr);
2575         i += scnprintf(buf + i, sz - i, "\n");
2576         i += tipc_link_dump(n->links[0].link, TIPC_DUMP_NONE, buf + i);
2577         i += scnprintf(buf + i, sz - i, " inputq: ");
2578         i += tipc_list_dump(&n->links[0].inputq, false, buf + i);
2579 
2580         i += scnprintf(buf + i, sz - i, "link_entry[1]:\n");
2581         i += scnprintf(buf + i, sz - i, " mtu: %u\n", n->links[1].mtu);
2582         i += scnprintf(buf + i, sz - i, " media: ");
2583         i += tipc_media_addr_printf(buf + i, sz - i, &n->links[1].maddr);
2584         i += scnprintf(buf + i, sz - i, "\n");
2585         i += tipc_link_dump(n->links[1].link, TIPC_DUMP_NONE, buf + i);
2586         i += scnprintf(buf + i, sz - i, " inputq: ");
2587         i += tipc_list_dump(&n->links[1].inputq, false, buf + i);
2588 
2589         i += scnprintf(buf + i, sz - i, "bclink:\n ");
2590         i += tipc_link_dump(n->bc_entry.link, TIPC_DUMP_NONE, buf + i);
2591 
2592         return i;
2593 }
/* [<][>][^][v][top][bottom][index][help] */
root/net/tipc/node.c

DEFINITIONS
