xref: /openbmc/linux/net/tipc/addr.c (revision f220d3eb)
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  * 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 "addr.h"
38 #include "core.h"
39 
40 bool tipc_in_scope(bool legacy_format, u32 domain, u32 addr)
41 {
42 	if (!domain || (domain == addr))
43 		return true;
44 	if (!legacy_format)
45 		return false;
46 	if (domain == tipc_cluster_mask(addr)) /* domain <Z.C.0> */
47 		return true;
48 	if (domain == (addr & TIPC_ZONE_CLUSTER_MASK)) /* domain <Z.C.0> */
49 		return true;
50 	if (domain == (addr & TIPC_ZONE_MASK)) /* domain <Z.0.0> */
51 		return true;
52 	return false;
53 }
54 
55 void tipc_set_node_id(struct net *net, u8 *id)
56 {
57 	struct tipc_net *tn = tipc_net(net);
58 	u32 *tmp = (u32 *)id;
59 
60 	memcpy(tn->node_id, id, NODE_ID_LEN);
61 	tipc_nodeid2string(tn->node_id_string, id);
62 	tn->trial_addr = tmp[0] ^ tmp[1] ^ tmp[2] ^ tmp[3];
63 	pr_info("Own node identity %s, cluster identity %u\n",
64 		tipc_own_id_string(net), tn->net_id);
65 }
66 
67 void 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 	pr_info("32-bit node address hash set to %x\n", addr);
79 }
80 
81 char *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;
123 }
124