]>
Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/addr.c: TIPC address utility routines | |
3 | * | |
4 | * Copyright (c) 2003-2005, Ericsson Research Canada | |
5 | * Copyright (c) 2004-2005, Wind River Systems | |
6 | * Copyright (c) 2005-2006, Ericsson AB | |
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 | * Redistributions of source code must retain the above copyright notice, this | |
13 | * list of conditions and the following disclaimer. | |
14 | * Redistributions in binary form must reproduce the above copyright notice, | |
15 | * this list of conditions and the following disclaimer in the documentation | |
16 | * and/or other materials provided with the distribution. | |
17 | * Neither the names of the copyright holders nor the names of its | |
18 | * contributors may be used to endorse or promote products derived from this | |
19 | * software without specific prior written permission. | |
20 | * | |
21 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | |
22 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | |
25 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | |
26 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | |
27 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | |
28 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | |
29 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | |
30 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
31 | * POSSIBILITY OF SUCH DAMAGE. | |
32 | */ | |
33 | ||
34 | #include "core.h" | |
35 | #include "dbg.h" | |
36 | #include "addr.h" | |
37 | #include "zone.h" | |
38 | #include "cluster.h" | |
39 | #include "net.h" | |
40 | ||
41 | u32 tipc_get_addr(void) | |
42 | { | |
43 | return tipc_own_addr; | |
44 | } | |
45 | ||
46 | /** | |
47 | * addr_domain_valid - validates a network domain address | |
48 | * | |
49 | * Accepts <Z.C.N>, <Z.C.0>, <Z.0.0>, and <0.0.0>, | |
50 | * where Z, C, and N are non-zero and do not exceed the configured limits. | |
51 | * | |
52 | * Returns 1 if domain address is valid, otherwise 0 | |
53 | */ | |
54 | ||
55 | int addr_domain_valid(u32 addr) | |
56 | { | |
57 | u32 n = tipc_node(addr); | |
58 | u32 c = tipc_cluster(addr); | |
59 | u32 z = tipc_zone(addr); | |
60 | u32 max_nodes = tipc_max_nodes; | |
61 | ||
62 | if (is_slave(addr)) | |
63 | max_nodes = LOWEST_SLAVE + tipc_max_slaves; | |
64 | if (n > max_nodes) | |
65 | return 0; | |
66 | if (c > tipc_max_clusters) | |
67 | return 0; | |
68 | if (z > tipc_max_zones) | |
69 | return 0; | |
70 | ||
71 | if (n && (!z || !c)) | |
72 | return 0; | |
73 | if (c && !z) | |
74 | return 0; | |
75 | return 1; | |
76 | } | |
77 | ||
78 | /** | |
79 | * addr_node_valid - validates a proposed network address for this node | |
80 | * | |
81 | * Accepts <Z.C.N>, where Z, C, and N are non-zero and do not exceed | |
82 | * the configured limits. | |
83 | * | |
84 | * Returns 1 if address can be used, otherwise 0 | |
85 | */ | |
86 | ||
87 | int addr_node_valid(u32 addr) | |
88 | { | |
89 | return (addr_domain_valid(addr) && tipc_node(addr)); | |
90 | } | |
91 |