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