net/tipc/node.c

   1 /*
   2  * net/tipc/node.c: TIPC node management routines
   3  *
   4  * Copyright (c) 2000-2006, 2012 Ericsson AB
   5  * Copyright (c) 2005-2006, 2010-2011, 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 "config.h"
  39 #include "node.h"
  40 #include "name_distr.h"
  41
  42 #define NODE_HTABLE_SIZE 512
  43
  44 static void node_lost_contact(struct tipc_node *n_ptr);
  45 static void node_established_contact(struct tipc_node *n_ptr);
  46
  47 static DEFINE_SPINLOCK(node_create_lock);
  48
  49 static struct hlist_head node_htable[NODE_HTABLE_SIZE];
  50 LIST_HEAD(tipc_node_list);
  51 static u32 tipc_num_nodes;
  52
  53 static atomic_t tipc_num_links = ATOMIC_INIT(0);
  54
  55 /*
  56  * A trivial power-of-two bitmask technique is used for speed, since this
  57  * operation is done for every incoming TIPC packet. The number of hash table
  58  * entries has been chosen so that no hash chain exceeds 8 nodes and will
  59  * usually be much smaller (typically only a single node).
  60  */
  61 static unsigned int tipc_hashfn(u32 addr)
  62 {
  63         return addr & (NODE_HTABLE_SIZE - 1);
  64 }
  65
  66 /*
  67  * tipc_node_find - locate specified node object, if it exists
  68  */
  69 struct tipc_node *tipc_node_find(u32 addr)
  70 {
  71         struct tipc_node *node;
  72
  73         if (unlikely(!in_own_cluster_exact(addr)))
  74                 return NULL;
  75
  76         hlist_for_each_entry(node, &node_htable[tipc_hashfn(addr)], hash) {
  77                 if (node->addr == addr)
  78                         return node;
  79         }
  80         return NULL;
  81 }
  82
  83 /**
  84  * tipc_node_create - create neighboring node
  85  *
  86  * Currently, this routine is called by neighbor discovery code, which holds
  87  * net_lock for reading only.  We must take node_create_lock to ensure a node
  88  * isn't created twice if two different bearers discover the node at the same
  89  * time.  (It would be preferable to switch to holding net_lock in write mode,
  90  * but this is a non-trivial change.)
  91  */
  92 struct tipc_node *tipc_node_create(u32 addr)
  93 {
  94         struct tipc_node *n_ptr, *temp_node;
  95
  96         spin_lock_bh(&node_create_lock);
  97
  98         n_ptr = tipc_node_find(addr);
  99         if (n_ptr) {
 100                 spin_unlock_bh(&node_create_lock);
 101                 return n_ptr;
 102         }
 103
 104         n_ptr = kzalloc(sizeof(*n_ptr), GFP_ATOMIC);
 105         if (!n_ptr) {
 106                 spin_unlock_bh(&node_create_lock);
 107                 pr_warn("Node creation failed, no memory\n");
 108                 return NULL;
 109         }
 110
 111         n_ptr->addr = addr;
 112         spin_lock_init(&n_ptr->lock);
 113         INIT_HLIST_NODE(&n_ptr->hash);
 114         INIT_LIST_HEAD(&n_ptr->list);
 115         INIT_LIST_HEAD(&n_ptr->nsub);
 116
 117         hlist_add_head(&n_ptr->hash, &node_htable[tipc_hashfn(addr)]);
 118
 119         list_for_each_entry(temp_node, &tipc_node_list, list) {
 120                 if (n_ptr->addr < temp_node->addr)
 121                         break;
 122         }
 123         list_add_tail(&n_ptr->list, &temp_node->list);
 124         n_ptr->block_setup = WAIT_PEER_DOWN;
 125         n_ptr->signature = INVALID_NODE_SIG;
 126
 127         tipc_num_nodes++;
 128
 129         spin_unlock_bh(&node_create_lock);
 130         return n_ptr;
 131 }
 132
 133 void tipc_node_delete(struct tipc_node *n_ptr)
 134 {
 135         list_del(&n_ptr->list);
 136         hlist_del(&n_ptr->hash);
 137         kfree(n_ptr);
 138
 139         tipc_num_nodes--;
 140 }
 141
 142 /**
 143  * tipc_node_link_up - handle addition of link
 144  *
 145  * Link becomes active (alone or shared) or standby, depending on its priority.
 146  */
 147 void tipc_node_link_up(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
 148 {
 149         struct tipc_link **active = &n_ptr->active_links[0];
 150
 151         n_ptr->working_links++;
 152
 153         pr_info("Established link <%s> on network plane %c\n",
 154                 l_ptr->name, l_ptr->b_ptr->net_plane);
 155
 156         if (!active[0]) {
 157                 active[0] = active[1] = l_ptr;
 158                 node_established_contact(n_ptr);
 159                 return;
 160         }
 161         if (l_ptr->priority < active[0]->priority) {
 162                 pr_info("New link <%s> becomes standby\n", l_ptr->name);
 163                 return;
 164         }
 165         tipc_link_dup_send_queue(active[0], l_ptr);
 166         if (l_ptr->priority == active[0]->priority) {
 167                 active[0] = l_ptr;
 168                 return;
 169         }
 170         pr_info("Old link <%s> becomes standby\n", active[0]->name);
 171         if (active[1] != active[0])
 172                 pr_info("Old link <%s> becomes standby\n", active[1]->name);
 173         active[0] = active[1] = l_ptr;
 174 }
 175
 176 /**
 177  * node_select_active_links - select active link
 178  */
 179 static void node_select_active_links(struct tipc_node *n_ptr)
 180 {
 181         struct tipc_link **active = &n_ptr->active_links[0];
 182         u32 i;
 183         u32 highest_prio = 0;
 184
 185         active[0] = active[1] = NULL;
 186
 187         for (i = 0; i < MAX_BEARERS; i++) {
 188                 struct tipc_link *l_ptr = n_ptr->links[i];
 189
 190                 if (!l_ptr || !tipc_link_is_up(l_ptr) ||
 191                     (l_ptr->priority < highest_prio))
 192                         continue;
 193
 194                 if (l_ptr->priority > highest_prio) {
 195                         highest_prio = l_ptr->priority;
 196                         active[0] = active[1] = l_ptr;
 197                 } else {
 198                         active[1] = l_ptr;
 199                 }
 200         }
 201 }
 202
 203 /**
 204  * tipc_node_link_down - handle loss of link
 205  */
 206 void tipc_node_link_down(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
 207 {
 208         struct tipc_link **active;
 209
 210         n_ptr->working_links--;
 211
 212         if (!tipc_link_is_active(l_ptr)) {
 213                 pr_info("Lost standby link <%s> on network plane %c\n",
 214                         l_ptr->name, l_ptr->b_ptr->net_plane);
 215                 return;
 216         }
 217         pr_info("Lost link <%s> on network plane %c\n",
 218                 l_ptr->name, l_ptr->b_ptr->net_plane);
 219
 220         active = &n_ptr->active_links[0];
 221         if (active[0] == l_ptr)
 222                 active[0] = active[1];
 223         if (active[1] == l_ptr)
 224                 active[1] = active[0];
 225         if (active[0] == l_ptr)
 226                 node_select_active_links(n_ptr);
 227         if (tipc_node_is_up(n_ptr))
 228                 tipc_link_failover_send_queue(l_ptr);
 229         else
 230                 node_lost_contact(n_ptr);
 231 }
 232
 233 int tipc_node_active_links(struct tipc_node *n_ptr)
 234 {
 235         return n_ptr->active_links[0] != NULL;
 236 }
 237
 238 int tipc_node_is_up(struct tipc_node *n_ptr)
 239 {
 240         return tipc_node_active_links(n_ptr);
 241 }
 242
 243 void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
 244 {
 245         n_ptr->links[l_ptr->b_ptr->identity] = l_ptr;
 246         atomic_inc(&tipc_num_links);
 247         n_ptr->link_cnt++;
 248 }
 249
 250 void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr)
 251 {
 252         int i;
 253
 254         for (i = 0; i < MAX_BEARERS; i++) {
 255                 if (l_ptr != n_ptr->links[i])
 256                         continue;
 257                 n_ptr->links[i] = NULL;
 258                 atomic_dec(&tipc_num_links);
 259                 n_ptr->link_cnt--;
 260         }
 261 }
 262
 263 static void node_established_contact(struct tipc_node *n_ptr)
 264 {
 265         tipc_k_signal((Handler)tipc_named_node_up, n_ptr->addr);
 266         n_ptr->bclink.oos_state = 0;
 267         n_ptr->bclink.acked = tipc_bclink_get_last_sent();
 268         tipc_bclink_add_node(n_ptr->addr);
 269 }
 270
 271 static void node_name_purge_complete(unsigned long node_addr)
 272 {
 273         struct tipc_node *n_ptr;
 274
 275         read_lock_bh(&tipc_net_lock);
 276         n_ptr = tipc_node_find(node_addr);
 277         if (n_ptr) {
 278                 tipc_node_lock(n_ptr);
 279                 n_ptr->block_setup &= ~WAIT_NAMES_GONE;
 280                 tipc_node_unlock(n_ptr);
 281         }
 282         read_unlock_bh(&tipc_net_lock);
 283 }
 284
 285 static void node_lost_contact(struct tipc_node *n_ptr)
 286 {
 287         char addr_string[16];
 288         u32 i;
 289
 290         pr_info("Lost contact with %s\n",
 291                 tipc_addr_string_fill(addr_string, n_ptr->addr));
 292
 293         /* Flush broadcast link info associated with lost node */
 294         if (n_ptr->bclink.recv_permitted) {
 295                 kfree_skb_list(n_ptr->bclink.deferred_head);
 296                 n_ptr->bclink.deferred_size = 0;
 297
 298                 if (n_ptr->bclink.reasm_head) {
 299                         kfree_skb(n_ptr->bclink.reasm_head);
 300                         n_ptr->bclink.reasm_head = NULL;
 301                         n_ptr->bclink.reasm_tail = NULL;
 302                 }
 303
 304                 tipc_bclink_remove_node(n_ptr->addr);
 305                 tipc_bclink_acknowledge(n_ptr, INVALID_LINK_SEQ);
 306
 307                 n_ptr->bclink.recv_permitted = false;
 308         }
 309
 310         /* Abort link changeover */
 311         for (i = 0; i < MAX_BEARERS; i++) {
 312                 struct tipc_link *l_ptr = n_ptr->links[i];
 313                 if (!l_ptr)
 314                         continue;
 315                 l_ptr->reset_checkpoint = l_ptr->next_in_no;
 316                 l_ptr->exp_msg_count = 0;
 317                 tipc_link_reset_fragments(l_ptr);
 318         }
 319
 320         /* Notify subscribers */
 321         tipc_nodesub_notify(n_ptr);
 322
 323         /* Prevent re-contact with node until cleanup is done */
 324         n_ptr->block_setup = WAIT_PEER_DOWN | WAIT_NAMES_GONE;
 325         tipc_k_signal((Handler)node_name_purge_complete, n_ptr->addr);
 326 }
 327
 328 struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space)
 329 {
 330         u32 domain;
 331         struct sk_buff *buf;
 332         struct tipc_node *n_ptr;
 333         struct tipc_node_info node_info;
 334         u32 payload_size;
 335
 336         if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR))
 337                 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
 338
 339         domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
 340         if (!tipc_addr_domain_valid(domain))
 341                 return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
 342                                                    " (network address)");
 343
 344         read_lock_bh(&tipc_net_lock);
 345         if (!tipc_num_nodes) {
 346                 read_unlock_bh(&tipc_net_lock);
 347                 return tipc_cfg_reply_none();
 348         }
 349
 350         /* For now, get space for all other nodes */
 351         payload_size = TLV_SPACE(sizeof(node_info)) * tipc_num_nodes;
 352         if (payload_size > 32768u) {
 353                 read_unlock_bh(&tipc_net_lock);
 354                 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
 355                                                    " (too many nodes)");
 356         }
 357         buf = tipc_cfg_reply_alloc(payload_size);
 358         if (!buf) {
 359                 read_unlock_bh(&tipc_net_lock);
 360                 return NULL;
 361         }
 362
 363         /* Add TLVs for all nodes in scope */
 364         list_for_each_entry(n_ptr, &tipc_node_list, list) {
 365                 if (!tipc_in_scope(domain, n_ptr->addr))
 366                         continue;
 367                 node_info.addr = htonl(n_ptr->addr);
 368                 node_info.up = htonl(tipc_node_is_up(n_ptr));
 369                 tipc_cfg_append_tlv(buf, TIPC_TLV_NODE_INFO,
 370                                     &node_info, sizeof(node_info));
 371         }
 372
 373         read_unlock_bh(&tipc_net_lock);
 374         return buf;
 375 }
 376
 377 struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space)
 378 {
 379         u32 domain;
 380         struct sk_buff *buf;
 381         struct tipc_node *n_ptr;
 382         struct tipc_link_info link_info;
 383         u32 payload_size;
 384
 385         if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_NET_ADDR))
 386                 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
 387
 388         domain = ntohl(*(__be32 *)TLV_DATA(req_tlv_area));
 389         if (!tipc_addr_domain_valid(domain))
 390                 return tipc_cfg_reply_error_string(TIPC_CFG_INVALID_VALUE
 391                                                    " (network address)");
 392
 393         if (!tipc_own_addr)
 394                 return tipc_cfg_reply_none();
 395
 396         read_lock_bh(&tipc_net_lock);
 397
 398         /* Get space for all unicast links + broadcast link */
 399         payload_size = TLV_SPACE(sizeof(link_info)) *
 400                 (atomic_read(&tipc_num_links) + 1);
 401         if (payload_size > 32768u) {
 402                 read_unlock_bh(&tipc_net_lock);
 403                 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
 404                                                    " (too many links)");
 405         }
 406         buf = tipc_cfg_reply_alloc(payload_size);
 407         if (!buf) {
 408                 read_unlock_bh(&tipc_net_lock);
 409                 return NULL;
 410         }
 411
 412         /* Add TLV for broadcast link */
 413         link_info.dest = htonl(tipc_cluster_mask(tipc_own_addr));
 414         link_info.up = htonl(1);
 415         strlcpy(link_info.str, tipc_bclink_name, TIPC_MAX_LINK_NAME);
 416         tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO, &link_info, sizeof(link_info));
 417
 418         /* Add TLVs for any other links in scope */
 419         list_for_each_entry(n_ptr, &tipc_node_list, list) {
 420                 u32 i;
 421
 422                 if (!tipc_in_scope(domain, n_ptr->addr))
 423                         continue;
 424                 tipc_node_lock(n_ptr);
 425                 for (i = 0; i < MAX_BEARERS; i++) {
 426                         if (!n_ptr->links[i])
 427                                 continue;
 428                         link_info.dest = htonl(n_ptr->addr);
 429                         link_info.up = htonl(tipc_link_is_up(n_ptr->links[i]));
 430                         strcpy(link_info.str, n_ptr->links[i]->name);
 431                         tipc_cfg_append_tlv(buf, TIPC_TLV_LINK_INFO,
 432                                             &link_info, sizeof(link_info));
 433                 }
 434                 tipc_node_unlock(n_ptr);
 435         }
 436
 437         read_unlock_bh(&tipc_net_lock);
 438         return buf;
 439 }