blob: 087e399518c1f52a81b4f20a2e26acd4210a3214 [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 *
Per Liden593a5f22006-01-11 19:14:19 +01004 * Copyright (c) 2000-2006, Ericsson AB
Per Lidenb97bf3f2006-01-02 19:04:38 +01005 * Copyright (c) 2004-2005, 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
37#include "core.h"
Allan Stephens8f92df62010-12-31 18:59:19 +000038#include "addr.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010039
Per Lidenb97bf3f2006-01-02 19:04:38 +010040/**
Per Liden4323add2006-01-18 00:38:21 +010041 * tipc_addr_domain_valid - validates a network domain address
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090042 *
43 * Accepts <Z.C.N>, <Z.C.0>, <Z.0.0>, and <0.0.0>,
Per Lidenb97bf3f2006-01-02 19:04:38 +010044 * where Z, C, and N are non-zero and do not exceed the configured limits.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090045 *
Per Lidenb97bf3f2006-01-02 19:04:38 +010046 * Returns 1 if domain address is valid, otherwise 0
47 */
48
Per Liden4323add2006-01-18 00:38:21 +010049int tipc_addr_domain_valid(u32 addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +010050{
51 u32 n = tipc_node(addr);
52 u32 c = tipc_cluster(addr);
53 u32 z = tipc_zone(addr);
54 u32 max_nodes = tipc_max_nodes;
55
Per Lidenb97bf3f2006-01-02 19:04:38 +010056 if (n > max_nodes)
57 return 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +010058
59 if (n && (!z || !c))
60 return 0;
61 if (c && !z)
62 return 0;
63 return 1;
64}
65
66/**
Per Liden4323add2006-01-18 00:38:21 +010067 * tipc_addr_node_valid - validates a proposed network address for this node
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090068 *
69 * Accepts <Z.C.N>, where Z, C, and N are non-zero and do not exceed
Per Lidenb97bf3f2006-01-02 19:04:38 +010070 * the configured limits.
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090071 *
Per Lidenb97bf3f2006-01-02 19:04:38 +010072 * Returns 1 if address can be used, otherwise 0
73 */
74
Per Liden4323add2006-01-18 00:38:21 +010075int tipc_addr_node_valid(u32 addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +010076{
Eric Dumazeta02cec22010-09-22 20:43:57 +000077 return tipc_addr_domain_valid(addr) && tipc_node(addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +010078}
79
Allan Stephens80e0c332010-05-11 14:30:13 +000080int tipc_in_scope(u32 domain, u32 addr)
81{
82 if (!domain || (domain == addr))
83 return 1;
Allan Stephensa3796f82011-02-23 11:44:49 -050084 if (domain == tipc_cluster_mask(addr)) /* domain <Z.C.0> */
Allan Stephens80e0c332010-05-11 14:30:13 +000085 return 1;
Allan Stephensa3796f82011-02-23 11:44:49 -050086 if (domain == tipc_zone_mask(addr)) /* domain <Z.0.0> */
Allan Stephens80e0c332010-05-11 14:30:13 +000087 return 1;
88 return 0;
89}
90
91/**
92 * tipc_addr_scope - convert message lookup domain to a 2-bit scope value
93 */
94
95int tipc_addr_scope(u32 domain)
96{
97 if (likely(!domain))
98 return TIPC_ZONE_SCOPE;
99 if (tipc_node(domain))
100 return TIPC_NODE_SCOPE;
101 if (tipc_cluster(domain))
102 return TIPC_CLUSTER_SCOPE;
103 return TIPC_ZONE_SCOPE;
104}
105
106char *tipc_addr_string_fill(char *string, u32 addr)
107{
108 snprintf(string, 16, "<%u.%u.%u>",
109 tipc_zone(addr), tipc_cluster(addr), tipc_node(addr));
110 return string;
111}