linux/net/tipc/addr.c
<<
>>
Prefs
   1/*
   2 * net/tipc/addr.c: TIPC address utility routines
   3 *
   4 * Copyright (c) 2000-2006, 2018, Ericsson AB
   5 * Copyright (c) 2004-2005, 2010-2011, Wind River Systems
   6 * Copyright (c) 2020-2021, Red Hat Inc
   7 * All rights reserved.
   8 *
   9 * Redistribution and use in source and binary forms, with or without
  10 * modification, are permitted provided that the following conditions are met:
  11 *
  12 * 1. Redistributions of source code must retain the above copyright
  13 *    notice, this list of conditions and the following disclaimer.
  14 * 2. Redistributions in binary form must reproduce the above copyright
  15 *    notice, this list of conditions and the following disclaimer in the
  16 *    documentation and/or other materials provided with the distribution.
  17 * 3. Neither the names of the copyright holders nor the names of its
  18 *    contributors may be used to endorse or promote products derived from
  19 *    this software without specific prior written permission.
  20 *
  21 * Alternatively, this software may be distributed under the terms of the
  22 * GNU General Public License ("GPL") version 2 as published by the Free
  23 * Software Foundation.
  24 *
  25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  26 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  28 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  29 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  35 * POSSIBILITY OF SUCH DAMAGE.
  36 */
  37
  38#include "addr.h"
  39#include "core.h"
  40
  41bool tipc_in_scope(bool legacy_format, u32 domain, u32 addr)
  42{
  43        if (!domain || (domain == addr))
  44                return true;
  45        if (!legacy_format)
  46                return false;
  47        if (domain == tipc_cluster_mask(addr)) /* domain <Z.C.0> */
  48                return true;
  49        if (domain == (addr & TIPC_ZONE_CLUSTER_MASK)) /* domain <Z.C.0> */
  50                return true;
  51        if (domain == (addr & TIPC_ZONE_MASK)) /* domain <Z.0.0> */
  52                return true;
  53        return false;
  54}
  55
  56void tipc_set_node_id(struct net *net, u8 *id)
  57{
  58        struct tipc_net *tn = tipc_net(net);
  59
  60        memcpy(tn->node_id, id, NODE_ID_LEN);
  61        tipc_nodeid2string(tn->node_id_string, id);
  62        tn->trial_addr = hash128to32(id);
  63        pr_info("Node identity %s, cluster identity %u\n",
  64                tipc_own_id_string(net), tn->net_id);
  65}
  66
  67void tipc_set_node_addr(struct net *net, u32 addr)
  68{
  69        struct tipc_net *tn = tipc_net(net);
  70        u8 node_id[NODE_ID_LEN] = {0,};
  71
  72        tn->node_addr = addr;
  73        if (!tipc_own_id(net)) {
  74                sprintf(node_id, "%x", addr);
  75                tipc_set_node_id(net, node_id);
  76        }
  77        tn->trial_addr = addr;
  78        tn->addr_trial_end = jiffies;
  79        pr_info("Node number set to %u\n", addr);
  80}
  81
  82char *tipc_nodeid2string(char *str, u8 *id)
  83{
  84        int i;
  85        u8 c;
  86
  87        /* Already a string ? */
  88        for (i = 0; i < NODE_ID_LEN; i++) {
  89                c = id[i];
  90                if (c >= '0' && c <= '9')
  91                        continue;
  92                if (c >= 'A' && c <= 'Z')
  93                        continue;
  94                if (c >= 'a' && c <= 'z')
  95                        continue;
  96                if (c == '.')
  97                        continue;
  98                if (c == ':')
  99                        continue;
 100                if (c == '_')
 101                        continue;
 102                if (c == '-')
 103                        continue;
 104                if (c == '@')
 105                        continue;
 106                if (c != 0)
 107                        break;
 108        }
 109        if (i == NODE_ID_LEN) {
 110                memcpy(str, id, NODE_ID_LEN);
 111                str[NODE_ID_LEN] = 0;
 112                return str;
 113        }
 114
 115        /* Translate to hex string */
 116        for (i = 0; i < NODE_ID_LEN; i++)
 117                sprintf(&str[2 * i], "%02x", id[i]);
 118
 119        /* Strip off trailing zeroes */
 120        for (i = NODE_ID_STR_LEN - 2; str[i] == '0'; i--)
 121                str[i] = 0;
 122
 123        return str;
 124}
 125