diff options
Diffstat (limited to 'net/tipc/zone.c')
-rw-r--r-- | net/tipc/zone.c | 166 |
1 files changed, 166 insertions, 0 deletions
diff --git a/net/tipc/zone.c b/net/tipc/zone.c new file mode 100644 index 000000000000..336eebb7bf54 --- /dev/null +++ b/net/tipc/zone.c | |||
@@ -0,0 +1,166 @@ | |||
1 | /* | ||
2 | * net/tipc/zone.c: TIPC zone management routines | ||
3 | * | ||
4 | * Copyright (c) 2003-2005, Ericsson Research Canada | ||
5 | * Copyright (c) 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 "zone.h" | ||
36 | #include "net.h" | ||
37 | #include "addr.h" | ||
38 | #include "node_subscr.h" | ||
39 | #include "cluster.h" | ||
40 | #include "node.h" | ||
41 | |||
42 | struct _zone *zone_create(u32 addr) | ||
43 | { | ||
44 | struct _zone *z_ptr = 0; | ||
45 | u32 z_num; | ||
46 | |||
47 | if (!addr_domain_valid(addr)) | ||
48 | return 0; | ||
49 | |||
50 | z_ptr = (struct _zone *)kmalloc(sizeof(*z_ptr), GFP_ATOMIC); | ||
51 | if (z_ptr != NULL) { | ||
52 | memset(z_ptr, 0, sizeof(*z_ptr)); | ||
53 | z_num = tipc_zone(addr); | ||
54 | z_ptr->addr = tipc_addr(z_num, 0, 0); | ||
55 | net.zones[z_num] = z_ptr; | ||
56 | } | ||
57 | return z_ptr; | ||
58 | } | ||
59 | |||
60 | void zone_delete(struct _zone *z_ptr) | ||
61 | { | ||
62 | u32 c_num; | ||
63 | |||
64 | if (!z_ptr) | ||
65 | return; | ||
66 | for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { | ||
67 | cluster_delete(z_ptr->clusters[c_num]); | ||
68 | } | ||
69 | kfree(z_ptr); | ||
70 | } | ||
71 | |||
72 | void zone_attach_cluster(struct _zone *z_ptr, struct cluster *c_ptr) | ||
73 | { | ||
74 | u32 c_num = tipc_cluster(c_ptr->addr); | ||
75 | |||
76 | assert(c_ptr->addr); | ||
77 | assert(c_num <= tipc_max_clusters); | ||
78 | assert(z_ptr->clusters[c_num] == 0); | ||
79 | z_ptr->clusters[c_num] = c_ptr; | ||
80 | } | ||
81 | |||
82 | void zone_remove_as_router(struct _zone *z_ptr, u32 router) | ||
83 | { | ||
84 | u32 c_num; | ||
85 | |||
86 | for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { | ||
87 | if (z_ptr->clusters[c_num]) { | ||
88 | cluster_remove_as_router(z_ptr->clusters[c_num], | ||
89 | router); | ||
90 | } | ||
91 | } | ||
92 | } | ||
93 | |||
94 | void zone_send_external_routes(struct _zone *z_ptr, u32 dest) | ||
95 | { | ||
96 | u32 c_num; | ||
97 | |||
98 | for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { | ||
99 | if (z_ptr->clusters[c_num]) { | ||
100 | if (in_own_cluster(z_ptr->addr)) | ||
101 | continue; | ||
102 | cluster_send_ext_routes(z_ptr->clusters[c_num], dest); | ||
103 | } | ||
104 | } | ||
105 | } | ||
106 | |||
107 | struct node *zone_select_remote_node(struct _zone *z_ptr, u32 addr, u32 ref) | ||
108 | { | ||
109 | struct cluster *c_ptr; | ||
110 | struct node *n_ptr; | ||
111 | u32 c_num; | ||
112 | |||
113 | if (!z_ptr) | ||
114 | return 0; | ||
115 | c_ptr = z_ptr->clusters[tipc_cluster(addr)]; | ||
116 | if (!c_ptr) | ||
117 | return 0; | ||
118 | n_ptr = cluster_select_node(c_ptr, ref); | ||
119 | if (n_ptr) | ||
120 | return n_ptr; | ||
121 | |||
122 | /* Links to any other clusters within this zone ? */ | ||
123 | for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { | ||
124 | c_ptr = z_ptr->clusters[c_num]; | ||
125 | if (!c_ptr) | ||
126 | return 0; | ||
127 | n_ptr = cluster_select_node(c_ptr, ref); | ||
128 | if (n_ptr) | ||
129 | return n_ptr; | ||
130 | } | ||
131 | return 0; | ||
132 | } | ||
133 | |||
134 | u32 zone_select_router(struct _zone *z_ptr, u32 addr, u32 ref) | ||
135 | { | ||
136 | struct cluster *c_ptr; | ||
137 | u32 c_num; | ||
138 | u32 router; | ||
139 | |||
140 | if (!z_ptr) | ||
141 | return 0; | ||
142 | c_ptr = z_ptr->clusters[tipc_cluster(addr)]; | ||
143 | router = c_ptr ? cluster_select_router(c_ptr, ref) : 0; | ||
144 | if (router) | ||
145 | return router; | ||
146 | |||
147 | /* Links to any other clusters within the zone? */ | ||
148 | for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { | ||
149 | c_ptr = z_ptr->clusters[c_num]; | ||
150 | router = c_ptr ? cluster_select_router(c_ptr, ref) : 0; | ||
151 | if (router) | ||
152 | return router; | ||
153 | } | ||
154 | return 0; | ||
155 | } | ||
156 | |||
157 | |||
158 | u32 zone_next_node(u32 addr) | ||
159 | { | ||
160 | struct cluster *c_ptr = cluster_find(addr); | ||
161 | |||
162 | if (c_ptr) | ||
163 | return cluster_next_node(c_ptr, addr); | ||
164 | return 0; | ||
165 | } | ||
166 | |||