blob: abe29d1aa23a868f910b48639065ada2bd74dbaf [file] [log] [blame]
Per Lidenb97bf3f2006-01-02 19:04:38 +01001/*
2 * net/tipc/addr.c: TIPC address utility routines
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +09003 *
Jon Maloyd50ccc22018-03-22 20:42:50 +01004 * Copyright (c) 2000-2006, 2018, Ericsson AB
Allan Stephensf831c962011-02-25 14:22:11 -05005 * Copyright (c) 2004-2005, 2010-2011, Wind River Systems
Per Lidenb97bf3f2006-01-02 19:04:38 +01006 * All rights reserved.
7 *
Per Liden9ea1fd32006-01-11 13:30:43 +01008 * Redistribution and use in source and binary forms, with or without
Per Lidenb97bf3f2006-01-02 19:04:38 +01009 * modification, are permitted provided that the following conditions are met:
10 *
Per Liden9ea1fd32006-01-11 13:30:43 +010011 * 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.
Per Lidenb97bf3f2006-01-02 19:04:38 +010019 *
Per Liden9ea1fd32006-01-11 13:30:43 +010020 * 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
Per Lidenb97bf3f2006-01-02 19:04:38 +010034 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
Allan Stephens8f92df62010-12-31 18:59:19 +000037#include "addr.h"
Ying Xue34747532015-01-09 15:27:10 +080038#include "core.h"
39
Jon Maloyb89afb12018-03-22 20:42:48 +010040bool tipc_in_scope(bool legacy_format, u32 domain, u32 addr)
Allan Stephens80e0c332010-05-11 14:30:13 +000041{
42 if (!domain || (domain == addr))
Jon Maloyb89afb12018-03-22 20:42:48 +010043 return true;
44 if (!legacy_format)
45 return false;
Allan Stephensa3796f82011-02-23 11:44:49 -050046 if (domain == tipc_cluster_mask(addr)) /* domain <Z.C.0> */
Jon Maloyb89afb12018-03-22 20:42:48 +010047 return true;
Jon Maloy23fd3ea2018-03-22 20:42:49 +010048 if (domain == (addr & TIPC_ZONE_CLUSTER_MASK)) /* domain <Z.C.0> */
49 return true;
Jon Maloy20263642018-03-22 20:42:47 +010050 if (domain == (addr & TIPC_ZONE_MASK)) /* domain <Z.0.0> */
Jon Maloyb89afb12018-03-22 20:42:48 +010051 return true;
52 return false;
Allan Stephens80e0c332010-05-11 14:30:13 +000053}
54
Jon Maloyd50ccc22018-03-22 20:42:50 +010055void tipc_set_node_id(struct net *net, u8 *id)
Allan Stephens80e0c332010-05-11 14:30:13 +000056{
Jon Maloyd50ccc22018-03-22 20:42:50 +010057 struct tipc_net *tn = tipc_net(net);
Jon Maloyd50ccc22018-03-22 20:42:50 +010058
59 memcpy(tn->node_id, id, NODE_ID_LEN);
60 tipc_nodeid2string(tn->node_id_string, id);
Jon Maloy5f75e0a2020-11-25 13:29:14 -050061 tn->trial_addr = hash128to32(id);
62 pr_info("Node identity %s, cluster identity %u\n",
Jon Maloyd50ccc22018-03-22 20:42:50 +010063 tipc_own_id_string(net), tn->net_id);
64}
65
66void tipc_set_node_addr(struct net *net, u32 addr)
67{
68 struct tipc_net *tn = tipc_net(net);
69 u8 node_id[NODE_ID_LEN] = {0,};
70
71 tn->node_addr = addr;
72 if (!tipc_own_id(net)) {
73 sprintf(node_id, "%x", addr);
74 tipc_set_node_id(net, node_id);
75 }
Jon Maloy25b0b9c2018-03-22 20:42:51 +010076 tn->trial_addr = addr;
Chris Packham8874eca2019-08-12 08:18:25 +120077 tn->addr_trial_end = jiffies;
Jon Maloy5f75e0a2020-11-25 13:29:14 -050078 pr_info("Node number set to %u\n", addr);
Jon Maloyd50ccc22018-03-22 20:42:50 +010079}
80
81char *tipc_nodeid2string(char *str, u8 *id)
82{
83 int i;
84 u8 c;
85
86 /* Already a string ? */
87 for (i = 0; i < NODE_ID_LEN; i++) {
88 c = id[i];
89 if (c >= '0' && c <= '9')
90 continue;
91 if (c >= 'A' && c <= 'Z')
92 continue;
93 if (c >= 'a' && c <= 'z')
94 continue;
95 if (c == '.')
96 continue;
97 if (c == ':')
98 continue;
99 if (c == '_')
100 continue;
101 if (c == '-')
102 continue;
103 if (c == '@')
104 continue;
105 if (c != 0)
106 break;
107 }
108 if (i == NODE_ID_LEN) {
109 memcpy(str, id, NODE_ID_LEN);
110 str[NODE_ID_LEN] = 0;
111 return str;
112 }
113
114 /* Translate to hex string */
115 for (i = 0; i < NODE_ID_LEN; i++)
116 sprintf(&str[2 * i], "%02x", id[i]);
117
118 /* Strip off trailing zeroes */
119 for (i = NODE_ID_STR_LEN - 2; str[i] == '0'; i--)
120 str[i] = 0;
121
122 return str;
Allan Stephens80e0c332010-05-11 14:30:13 +0000123}