blob: 83f8b5e91fc8e45e7f0181dc36f1d5a623e0ae4b [file] [log] [blame]
Per Lidenb97bf3f2006-01-02 19:04:38 +01001/*
2 * net/tipc/zone.c: TIPC zone management 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) 2005, Wind River Systems
Per Lidenb97bf3f2006-01-02 19:04:38 +01006 * 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 *
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.
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.
Per Lidenb97bf3f2006-01-02 19:04:38 +010023 *
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 "core.h"
38#include "zone.h"
39#include "net.h"
40#include "addr.h"
41#include "node_subscr.h"
42#include "cluster.h"
43#include "node.h"
44
Per Liden4323add2006-01-18 00:38:21 +010045struct _zone *tipc_zone_create(u32 addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +010046{
Allan Stephensa10bd922006-06-25 23:52:17 -070047 struct _zone *z_ptr;
Per Lidenb97bf3f2006-01-02 19:04:38 +010048 u32 z_num;
49
Allan Stephensa10bd922006-06-25 23:52:17 -070050 if (!tipc_addr_domain_valid(addr)) {
51 err("Zone creation failed, invalid domain 0x%x\n", addr);
Sam Ravnborg1fc54d82006-03-20 22:36:47 -080052 return NULL;
Allan Stephensa10bd922006-06-25 23:52:17 -070053 }
Per Lidenb97bf3f2006-01-02 19:04:38 +010054
Panagiotis Issaris0da974f2006-07-21 14:51:30 -070055 z_ptr = kzalloc(sizeof(*z_ptr), GFP_ATOMIC);
Allan Stephensa10bd922006-06-25 23:52:17 -070056 if (!z_ptr) {
57 warn("Zone creation failed, insufficient memory\n");
58 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +010059 }
Allan Stephensa10bd922006-06-25 23:52:17 -070060
Allan Stephensa10bd922006-06-25 23:52:17 -070061 z_num = tipc_zone(addr);
62 z_ptr->addr = tipc_addr(z_num, 0, 0);
63 tipc_net.zones[z_num] = z_ptr;
Per Lidenb97bf3f2006-01-02 19:04:38 +010064 return z_ptr;
65}
66
Per Liden4323add2006-01-18 00:38:21 +010067void tipc_zone_delete(struct _zone *z_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +010068{
69 u32 c_num;
70
71 if (!z_ptr)
72 return;
73 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
Per Liden4323add2006-01-18 00:38:21 +010074 tipc_cltr_delete(z_ptr->clusters[c_num]);
Per Lidenb97bf3f2006-01-02 19:04:38 +010075 }
76 kfree(z_ptr);
77}
78
Per Liden4323add2006-01-18 00:38:21 +010079void tipc_zone_attach_cluster(struct _zone *z_ptr, struct cluster *c_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +010080{
81 u32 c_num = tipc_cluster(c_ptr->addr);
82
83 assert(c_ptr->addr);
84 assert(c_num <= tipc_max_clusters);
Harvey Harrison5f2f40a2008-02-24 18:38:31 -080085 assert(z_ptr->clusters[c_num] == NULL);
Per Lidenb97bf3f2006-01-02 19:04:38 +010086 z_ptr->clusters[c_num] = c_ptr;
87}
88
Per Liden4323add2006-01-18 00:38:21 +010089void tipc_zone_remove_as_router(struct _zone *z_ptr, u32 router)
Per Lidenb97bf3f2006-01-02 19:04:38 +010090{
91 u32 c_num;
92
93 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
94 if (z_ptr->clusters[c_num]) {
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +090095 tipc_cltr_remove_as_router(z_ptr->clusters[c_num],
Per Liden4323add2006-01-18 00:38:21 +010096 router);
Per Lidenb97bf3f2006-01-02 19:04:38 +010097 }
98 }
99}
100
Per Liden4323add2006-01-18 00:38:21 +0100101void tipc_zone_send_external_routes(struct _zone *z_ptr, u32 dest)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100102{
103 u32 c_num;
104
105 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
106 if (z_ptr->clusters[c_num]) {
107 if (in_own_cluster(z_ptr->addr))
108 continue;
Per Liden4323add2006-01-18 00:38:21 +0100109 tipc_cltr_send_ext_routes(z_ptr->clusters[c_num], dest);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100110 }
111 }
112}
113
David S. Miller6c000552008-09-02 23:38:32 -0700114struct tipc_node *tipc_zone_select_remote_node(struct _zone *z_ptr, u32 addr, u32 ref)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100115{
116 struct cluster *c_ptr;
David S. Miller6c000552008-09-02 23:38:32 -0700117 struct tipc_node *n_ptr;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100118 u32 c_num;
119
120 if (!z_ptr)
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800121 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100122 c_ptr = z_ptr->clusters[tipc_cluster(addr)];
123 if (!c_ptr)
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800124 return NULL;
Per Liden4323add2006-01-18 00:38:21 +0100125 n_ptr = tipc_cltr_select_node(c_ptr, ref);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100126 if (n_ptr)
127 return n_ptr;
128
129 /* Links to any other clusters within this zone ? */
130 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
131 c_ptr = z_ptr->clusters[c_num];
132 if (!c_ptr)
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800133 return NULL;
Per Liden4323add2006-01-18 00:38:21 +0100134 n_ptr = tipc_cltr_select_node(c_ptr, ref);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100135 if (n_ptr)
136 return n_ptr;
137 }
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800138 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100139}
140
Per Liden4323add2006-01-18 00:38:21 +0100141u32 tipc_zone_select_router(struct _zone *z_ptr, u32 addr, u32 ref)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100142{
143 struct cluster *c_ptr;
144 u32 c_num;
145 u32 router;
146
147 if (!z_ptr)
148 return 0;
149 c_ptr = z_ptr->clusters[tipc_cluster(addr)];
Per Liden4323add2006-01-18 00:38:21 +0100150 router = c_ptr ? tipc_cltr_select_router(c_ptr, ref) : 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100151 if (router)
152 return router;
153
154 /* Links to any other clusters within the zone? */
155 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
156 c_ptr = z_ptr->clusters[c_num];
Per Liden4323add2006-01-18 00:38:21 +0100157 router = c_ptr ? tipc_cltr_select_router(c_ptr, ref) : 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100158 if (router)
159 return router;
160 }
161 return 0;
162}