Blame view
net/tipc/zone.c
4.6 KB
b97bf3fd8
|
1 2 |
/* * net/tipc/zone.c: TIPC zone management routines |
c43072852
|
3 |
* |
593a5f22d
|
4 |
* Copyright (c) 2000-2006, Ericsson AB |
b97bf3fd8
|
5 |
* Copyright (c) 2005, Wind River Systems |
b97bf3fd8
|
6 7 8 9 10 |
* All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * |
9ea1fd3c1
|
11 12 13 14 15 16 17 18 19 20 21 22 |
* 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. Neither the names of the copyright holders nor the names of its * contributors may be used to endorse or promote products derived from * this software without specific prior written permission. * * Alternatively, this software may be distributed under the terms of the * GNU General Public License ("GPL") version 2 as published by the Free * Software Foundation. |
b97bf3fd8
|
23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 |
* * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. */ #include "core.h" #include "zone.h" #include "net.h" #include "addr.h" #include "node_subscr.h" #include "cluster.h" #include "node.h" |
4323add67
|
44 |
struct _zone *tipc_zone_create(u32 addr) |
b97bf3fd8
|
45 |
{ |
a10bd924a
|
46 |
struct _zone *z_ptr; |
b97bf3fd8
|
47 |
u32 z_num; |
a10bd924a
|
48 49 50 |
if (!tipc_addr_domain_valid(addr)) { err("Zone creation failed, invalid domain 0x%x ", addr); |
1fc54d8f4
|
51 |
return NULL; |
a10bd924a
|
52 |
} |
b97bf3fd8
|
53 |
|
0da974f4f
|
54 |
z_ptr = kzalloc(sizeof(*z_ptr), GFP_ATOMIC); |
a10bd924a
|
55 56 57 58 |
if (!z_ptr) { warn("Zone creation failed, insufficient memory "); return NULL; |
b97bf3fd8
|
59 |
} |
a10bd924a
|
60 |
|
a10bd924a
|
61 62 63 |
z_num = tipc_zone(addr); z_ptr->addr = tipc_addr(z_num, 0, 0); tipc_net.zones[z_num] = z_ptr; |
b97bf3fd8
|
64 65 |
return z_ptr; } |
4323add67
|
66 |
void tipc_zone_delete(struct _zone *z_ptr) |
b97bf3fd8
|
67 68 69 70 71 72 |
{ u32 c_num; if (!z_ptr) return; for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { |
4323add67
|
73 |
tipc_cltr_delete(z_ptr->clusters[c_num]); |
b97bf3fd8
|
74 75 76 |
} kfree(z_ptr); } |
4323add67
|
77 |
void tipc_zone_attach_cluster(struct _zone *z_ptr, struct cluster *c_ptr) |
b97bf3fd8
|
78 79 80 81 82 |
{ u32 c_num = tipc_cluster(c_ptr->addr); assert(c_ptr->addr); assert(c_num <= tipc_max_clusters); |
5f2f40a92
|
83 |
assert(z_ptr->clusters[c_num] == NULL); |
b97bf3fd8
|
84 85 |
z_ptr->clusters[c_num] = c_ptr; } |
4323add67
|
86 |
void tipc_zone_remove_as_router(struct _zone *z_ptr, u32 router) |
b97bf3fd8
|
87 88 89 90 91 |
{ u32 c_num; for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { if (z_ptr->clusters[c_num]) { |
c43072852
|
92 |
tipc_cltr_remove_as_router(z_ptr->clusters[c_num], |
4323add67
|
93 |
router); |
b97bf3fd8
|
94 95 96 |
} } } |
4323add67
|
97 |
void tipc_zone_send_external_routes(struct _zone *z_ptr, u32 dest) |
b97bf3fd8
|
98 99 100 101 102 103 104 |
{ u32 c_num; for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { if (z_ptr->clusters[c_num]) { if (in_own_cluster(z_ptr->addr)) continue; |
4323add67
|
105 |
tipc_cltr_send_ext_routes(z_ptr->clusters[c_num], dest); |
b97bf3fd8
|
106 107 108 |
} } } |
6c00055a8
|
109 |
struct tipc_node *tipc_zone_select_remote_node(struct _zone *z_ptr, u32 addr, u32 ref) |
b97bf3fd8
|
110 111 |
{ struct cluster *c_ptr; |
6c00055a8
|
112 |
struct tipc_node *n_ptr; |
b97bf3fd8
|
113 114 115 |
u32 c_num; if (!z_ptr) |
1fc54d8f4
|
116 |
return NULL; |
b97bf3fd8
|
117 118 |
c_ptr = z_ptr->clusters[tipc_cluster(addr)]; if (!c_ptr) |
1fc54d8f4
|
119 |
return NULL; |
4323add67
|
120 |
n_ptr = tipc_cltr_select_node(c_ptr, ref); |
b97bf3fd8
|
121 122 123 124 125 126 127 |
if (n_ptr) return n_ptr; /* Links to any other clusters within this zone ? */ for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { c_ptr = z_ptr->clusters[c_num]; if (!c_ptr) |
1fc54d8f4
|
128 |
return NULL; |
4323add67
|
129 |
n_ptr = tipc_cltr_select_node(c_ptr, ref); |
b97bf3fd8
|
130 131 132 |
if (n_ptr) return n_ptr; } |
1fc54d8f4
|
133 |
return NULL; |
b97bf3fd8
|
134 |
} |
4323add67
|
135 |
u32 tipc_zone_select_router(struct _zone *z_ptr, u32 addr, u32 ref) |
b97bf3fd8
|
136 137 138 139 140 141 142 143 |
{ struct cluster *c_ptr; u32 c_num; u32 router; if (!z_ptr) return 0; c_ptr = z_ptr->clusters[tipc_cluster(addr)]; |
4323add67
|
144 |
router = c_ptr ? tipc_cltr_select_router(c_ptr, ref) : 0; |
b97bf3fd8
|
145 146 147 148 149 150 |
if (router) return router; /* Links to any other clusters within the zone? */ for (c_num = 1; c_num <= tipc_max_clusters; c_num++) { c_ptr = z_ptr->clusters[c_num]; |
4323add67
|
151 |
router = c_ptr ? tipc_cltr_select_router(c_ptr, ref) : 0; |
b97bf3fd8
|
152 153 154 155 156 |
if (router) return router; } return 0; } |
4323add67
|
157 |
u32 tipc_zone_next_node(u32 addr) |
b97bf3fd8
|
158 |
{ |
4323add67
|
159 |
struct cluster *c_ptr = tipc_cltr_find(addr); |
b97bf3fd8
|
160 161 |
if (c_ptr) |
4323add67
|
162 |
return tipc_cltr_next_node(c_ptr, addr); |
b97bf3fd8
|
163 164 |
return 0; } |