blob: b46b5188a9fd77d01bebd8ed5c481b5b5e1fcfc9 [file] [log] [blame]
Per Lidenb97bf3f2006-01-02 19:04:38 +01001/*
2 * net/tipc/cluster.c: TIPC cluster management routines
3 *
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 "cluster.h"
39#include "addr.h"
40#include "node_subscr.h"
41#include "link.h"
42#include "node.h"
43#include "net.h"
44#include "msg.h"
45#include "bearer.h"
46
Adrian Bunk988f0882006-03-20 22:37:52 -080047static void tipc_cltr_multicast(struct cluster *c_ptr, struct sk_buff *buf,
48 u32 lower, u32 upper);
Per Liden87546b12006-03-20 22:38:33 -080049static struct sk_buff *tipc_cltr_prepare_routing_msg(u32 data_size, u32 dest);
Per Lidenb97bf3f2006-01-02 19:04:38 +010050
Sam Ravnborg1fc54d82006-03-20 22:36:47 -080051struct node **tipc_local_nodes = NULL;
Per Liden4323add2006-01-18 00:38:21 +010052struct node_map tipc_cltr_bcast_nodes = {0,{0,}};
53u32 tipc_highest_allowed_slave = 0;
Per Lidenb97bf3f2006-01-02 19:04:38 +010054
Per Liden4323add2006-01-18 00:38:21 +010055struct cluster *tipc_cltr_create(u32 addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +010056{
57 struct _zone *z_ptr;
58 struct cluster *c_ptr;
59 int max_nodes;
Per Lidenb97bf3f2006-01-02 19:04:38 +010060
Panagiotis Issaris0da974f2006-07-21 14:51:30 -070061 c_ptr = kzalloc(sizeof(*c_ptr), GFP_ATOMIC);
Allan Stephensa10bd922006-06-25 23:52:17 -070062 if (c_ptr == NULL) {
63 warn("Cluster creation failure, no memory\n");
Sam Ravnborg1fc54d82006-03-20 22:36:47 -080064 return NULL;
Allan Stephensa10bd922006-06-25 23:52:17 -070065 }
Per Lidenb97bf3f2006-01-02 19:04:38 +010066
67 c_ptr->addr = tipc_addr(tipc_zone(addr), tipc_cluster(addr), 0);
68 if (in_own_cluster(addr))
69 max_nodes = LOWEST_SLAVE + tipc_max_slaves;
70 else
71 max_nodes = tipc_max_nodes + 1;
Allan Stephensa10bd922006-06-25 23:52:17 -070072
Panagiotis Issaris0da974f2006-07-21 14:51:30 -070073 c_ptr->nodes = kcalloc(max_nodes + 1, sizeof(void*), GFP_ATOMIC);
Per Lidenb97bf3f2006-01-02 19:04:38 +010074 if (c_ptr->nodes == NULL) {
Allan Stephensa10bd922006-06-25 23:52:17 -070075 warn("Cluster creation failure, no memory for node area\n");
Per Lidenb97bf3f2006-01-02 19:04:38 +010076 kfree(c_ptr);
Sam Ravnborg1fc54d82006-03-20 22:36:47 -080077 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +010078 }
Allan Stephensa10bd922006-06-25 23:52:17 -070079
Per Lidenb97bf3f2006-01-02 19:04:38 +010080 if (in_own_cluster(addr))
Per Liden4323add2006-01-18 00:38:21 +010081 tipc_local_nodes = c_ptr->nodes;
Per Lidenb97bf3f2006-01-02 19:04:38 +010082 c_ptr->highest_slave = LOWEST_SLAVE - 1;
83 c_ptr->highest_node = 0;
84
Per Liden4323add2006-01-18 00:38:21 +010085 z_ptr = tipc_zone_find(tipc_zone(addr));
Allan Stephensa10bd922006-06-25 23:52:17 -070086 if (!z_ptr) {
Per Liden4323add2006-01-18 00:38:21 +010087 z_ptr = tipc_zone_create(addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +010088 }
Allan Stephensa10bd922006-06-25 23:52:17 -070089 if (!z_ptr) {
90 kfree(c_ptr->nodes);
Per Lidenb97bf3f2006-01-02 19:04:38 +010091 kfree(c_ptr);
Allan Stephensa10bd922006-06-25 23:52:17 -070092 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +010093 }
94
Allan Stephensa10bd922006-06-25 23:52:17 -070095 tipc_zone_attach_cluster(z_ptr, c_ptr);
96 c_ptr->owner = z_ptr;
Per Lidenb97bf3f2006-01-02 19:04:38 +010097 return c_ptr;
98}
99
Per Liden4323add2006-01-18 00:38:21 +0100100void tipc_cltr_delete(struct cluster *c_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100101{
102 u32 n_num;
103
104 if (!c_ptr)
105 return;
106 for (n_num = 1; n_num <= c_ptr->highest_node; n_num++) {
Per Liden4323add2006-01-18 00:38:21 +0100107 tipc_node_delete(c_ptr->nodes[n_num]);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100108 }
109 for (n_num = LOWEST_SLAVE; n_num <= c_ptr->highest_slave; n_num++) {
Per Liden4323add2006-01-18 00:38:21 +0100110 tipc_node_delete(c_ptr->nodes[n_num]);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100111 }
112 kfree(c_ptr->nodes);
113 kfree(c_ptr);
114}
115
Per Liden4323add2006-01-18 00:38:21 +0100116u32 tipc_cltr_next_node(struct cluster *c_ptr, u32 addr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100117{
118 struct node *n_ptr;
119 u32 n_num = tipc_node(addr) + 1;
120
121 if (!c_ptr)
122 return addr;
123 for (; n_num <= c_ptr->highest_node; n_num++) {
124 n_ptr = c_ptr->nodes[n_num];
Per Liden4323add2006-01-18 00:38:21 +0100125 if (n_ptr && tipc_node_has_active_links(n_ptr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100126 return n_ptr->addr;
127 }
128 for (n_num = 1; n_num < tipc_node(addr); n_num++) {
129 n_ptr = c_ptr->nodes[n_num];
Per Liden4323add2006-01-18 00:38:21 +0100130 if (n_ptr && tipc_node_has_active_links(n_ptr))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100131 return n_ptr->addr;
132 }
133 return 0;
134}
135
Per Liden4323add2006-01-18 00:38:21 +0100136void tipc_cltr_attach_node(struct cluster *c_ptr, struct node *n_ptr)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100137{
138 u32 n_num = tipc_node(n_ptr->addr);
139 u32 max_n_num = tipc_max_nodes;
140
141 if (in_own_cluster(n_ptr->addr))
Per Liden4323add2006-01-18 00:38:21 +0100142 max_n_num = tipc_highest_allowed_slave;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100143 assert(n_num > 0);
144 assert(n_num <= max_n_num);
145 assert(c_ptr->nodes[n_num] == 0);
146 c_ptr->nodes[n_num] = n_ptr;
147 if (n_num > c_ptr->highest_node)
148 c_ptr->highest_node = n_num;
149}
150
151/**
Per Liden4323add2006-01-18 00:38:21 +0100152 * tipc_cltr_select_router - select router to a cluster
Per Lidenb97bf3f2006-01-02 19:04:38 +0100153 *
154 * Uses deterministic and fair algorithm.
155 */
156
Per Liden4323add2006-01-18 00:38:21 +0100157u32 tipc_cltr_select_router(struct cluster *c_ptr, u32 ref)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100158{
159 u32 n_num;
160 u32 ulim = c_ptr->highest_node;
161 u32 mask;
162 u32 tstart;
163
164 assert(!in_own_cluster(c_ptr->addr));
165 if (!ulim)
166 return 0;
167
168 /* Start entry must be random */
169 mask = tipc_max_nodes;
170 while (mask > ulim)
171 mask >>= 1;
172 tstart = ref & mask;
173 n_num = tstart;
174
175 /* Lookup upwards with wrap-around */
176 do {
Per Liden4323add2006-01-18 00:38:21 +0100177 if (tipc_node_is_up(c_ptr->nodes[n_num]))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100178 break;
179 } while (++n_num <= ulim);
180 if (n_num > ulim) {
181 n_num = 1;
182 do {
Per Liden4323add2006-01-18 00:38:21 +0100183 if (tipc_node_is_up(c_ptr->nodes[n_num]))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100184 break;
185 } while (++n_num < tstart);
186 if (n_num == tstart)
187 return 0;
188 }
189 assert(n_num <= ulim);
Per Liden4323add2006-01-18 00:38:21 +0100190 return tipc_node_select_router(c_ptr->nodes[n_num], ref);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100191}
192
193/**
Per Liden4323add2006-01-18 00:38:21 +0100194 * tipc_cltr_select_node - select destination node within a remote cluster
Per Lidenb97bf3f2006-01-02 19:04:38 +0100195 *
196 * Uses deterministic and fair algorithm.
197 */
198
Per Liden4323add2006-01-18 00:38:21 +0100199struct node *tipc_cltr_select_node(struct cluster *c_ptr, u32 selector)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100200{
201 u32 n_num;
202 u32 mask = tipc_max_nodes;
203 u32 start_entry;
204
205 assert(!in_own_cluster(c_ptr->addr));
206 if (!c_ptr->highest_node)
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800207 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100208
209 /* Start entry must be random */
210 while (mask > c_ptr->highest_node) {
211 mask >>= 1;
212 }
213 start_entry = (selector & mask) ? selector & mask : 1u;
214 assert(start_entry <= c_ptr->highest_node);
215
216 /* Lookup upwards with wrap-around */
217 for (n_num = start_entry; n_num <= c_ptr->highest_node; n_num++) {
Per Liden4323add2006-01-18 00:38:21 +0100218 if (tipc_node_has_active_links(c_ptr->nodes[n_num]))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100219 return c_ptr->nodes[n_num];
220 }
221 for (n_num = 1; n_num < start_entry; n_num++) {
Per Liden4323add2006-01-18 00:38:21 +0100222 if (tipc_node_has_active_links(c_ptr->nodes[n_num]))
Per Lidenb97bf3f2006-01-02 19:04:38 +0100223 return c_ptr->nodes[n_num];
224 }
Sam Ravnborg1fc54d82006-03-20 22:36:47 -0800225 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100226}
227
228/*
229 * Routing table management: See description in node.c
230 */
231
Adrian Bunk988f0882006-03-20 22:37:52 -0800232static struct sk_buff *tipc_cltr_prepare_routing_msg(u32 data_size, u32 dest)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100233{
234 u32 size = INT_H_SIZE + data_size;
235 struct sk_buff *buf = buf_acquire(size);
236 struct tipc_msg *msg;
237
238 if (buf) {
239 msg = buf_msg(buf);
240 memset((char *)msg, 0, size);
241 msg_init(msg, ROUTE_DISTRIBUTOR, 0, TIPC_OK, INT_H_SIZE, dest);
242 }
243 return buf;
244}
245
Per Liden4323add2006-01-18 00:38:21 +0100246void tipc_cltr_bcast_new_route(struct cluster *c_ptr, u32 dest,
Per Lidenb97bf3f2006-01-02 19:04:38 +0100247 u32 lower, u32 upper)
248{
Per Liden4323add2006-01-18 00:38:21 +0100249 struct sk_buff *buf = tipc_cltr_prepare_routing_msg(0, c_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100250 struct tipc_msg *msg;
251
252 if (buf) {
253 msg = buf_msg(buf);
254 msg_set_remote_node(msg, dest);
255 msg_set_type(msg, ROUTE_ADDITION);
Per Liden4323add2006-01-18 00:38:21 +0100256 tipc_cltr_multicast(c_ptr, buf, lower, upper);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100257 } else {
258 warn("Memory squeeze: broadcast of new route failed\n");
259 }
260}
261
Per Liden4323add2006-01-18 00:38:21 +0100262void tipc_cltr_bcast_lost_route(struct cluster *c_ptr, u32 dest,
263 u32 lower, u32 upper)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100264{
Per Liden4323add2006-01-18 00:38:21 +0100265 struct sk_buff *buf = tipc_cltr_prepare_routing_msg(0, c_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100266 struct tipc_msg *msg;
267
268 if (buf) {
269 msg = buf_msg(buf);
270 msg_set_remote_node(msg, dest);
271 msg_set_type(msg, ROUTE_REMOVAL);
Per Liden4323add2006-01-18 00:38:21 +0100272 tipc_cltr_multicast(c_ptr, buf, lower, upper);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100273 } else {
274 warn("Memory squeeze: broadcast of lost route failed\n");
275 }
276}
277
Per Liden4323add2006-01-18 00:38:21 +0100278void tipc_cltr_send_slave_routes(struct cluster *c_ptr, u32 dest)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100279{
280 struct sk_buff *buf;
281 struct tipc_msg *msg;
282 u32 highest = c_ptr->highest_slave;
283 u32 n_num;
284 int send = 0;
285
286 assert(!is_slave(dest));
287 assert(in_own_cluster(dest));
288 assert(in_own_cluster(c_ptr->addr));
289 if (highest <= LOWEST_SLAVE)
290 return;
Per Liden4323add2006-01-18 00:38:21 +0100291 buf = tipc_cltr_prepare_routing_msg(highest - LOWEST_SLAVE + 1,
292 c_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100293 if (buf) {
294 msg = buf_msg(buf);
295 msg_set_remote_node(msg, c_ptr->addr);
296 msg_set_type(msg, SLAVE_ROUTING_TABLE);
297 for (n_num = LOWEST_SLAVE; n_num <= highest; n_num++) {
298 if (c_ptr->nodes[n_num] &&
Per Liden4323add2006-01-18 00:38:21 +0100299 tipc_node_has_active_links(c_ptr->nodes[n_num])) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100300 send = 1;
301 msg_set_dataoctet(msg, n_num);
302 }
303 }
304 if (send)
Per Liden4323add2006-01-18 00:38:21 +0100305 tipc_link_send(buf, dest, dest);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100306 else
307 buf_discard(buf);
308 } else {
309 warn("Memory squeeze: broadcast of lost route failed\n");
310 }
311}
312
Per Liden4323add2006-01-18 00:38:21 +0100313void tipc_cltr_send_ext_routes(struct cluster *c_ptr, u32 dest)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100314{
315 struct sk_buff *buf;
316 struct tipc_msg *msg;
317 u32 highest = c_ptr->highest_node;
318 u32 n_num;
319 int send = 0;
320
321 if (in_own_cluster(c_ptr->addr))
322 return;
323 assert(!is_slave(dest));
324 assert(in_own_cluster(dest));
325 highest = c_ptr->highest_node;
Per Liden4323add2006-01-18 00:38:21 +0100326 buf = tipc_cltr_prepare_routing_msg(highest + 1, c_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100327 if (buf) {
328 msg = buf_msg(buf);
329 msg_set_remote_node(msg, c_ptr->addr);
330 msg_set_type(msg, EXT_ROUTING_TABLE);
331 for (n_num = 1; n_num <= highest; n_num++) {
332 if (c_ptr->nodes[n_num] &&
Per Liden4323add2006-01-18 00:38:21 +0100333 tipc_node_has_active_links(c_ptr->nodes[n_num])) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100334 send = 1;
335 msg_set_dataoctet(msg, n_num);
336 }
337 }
338 if (send)
Per Liden4323add2006-01-18 00:38:21 +0100339 tipc_link_send(buf, dest, dest);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100340 else
341 buf_discard(buf);
342 } else {
343 warn("Memory squeeze: broadcast of external route failed\n");
344 }
345}
346
Per Liden4323add2006-01-18 00:38:21 +0100347void tipc_cltr_send_local_routes(struct cluster *c_ptr, u32 dest)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100348{
349 struct sk_buff *buf;
350 struct tipc_msg *msg;
351 u32 highest = c_ptr->highest_node;
352 u32 n_num;
353 int send = 0;
354
355 assert(is_slave(dest));
356 assert(in_own_cluster(c_ptr->addr));
Per Liden4323add2006-01-18 00:38:21 +0100357 buf = tipc_cltr_prepare_routing_msg(highest, c_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100358 if (buf) {
359 msg = buf_msg(buf);
360 msg_set_remote_node(msg, c_ptr->addr);
361 msg_set_type(msg, LOCAL_ROUTING_TABLE);
362 for (n_num = 1; n_num <= highest; n_num++) {
363 if (c_ptr->nodes[n_num] &&
Per Liden4323add2006-01-18 00:38:21 +0100364 tipc_node_has_active_links(c_ptr->nodes[n_num])) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100365 send = 1;
366 msg_set_dataoctet(msg, n_num);
367 }
368 }
369 if (send)
Per Liden4323add2006-01-18 00:38:21 +0100370 tipc_link_send(buf, dest, dest);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100371 else
372 buf_discard(buf);
373 } else {
374 warn("Memory squeeze: broadcast of local route failed\n");
375 }
376}
377
Per Liden4323add2006-01-18 00:38:21 +0100378void tipc_cltr_recv_routing_table(struct sk_buff *buf)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100379{
380 struct tipc_msg *msg = buf_msg(buf);
381 struct cluster *c_ptr;
382 struct node *n_ptr;
383 unchar *node_table;
384 u32 table_size;
385 u32 router;
386 u32 rem_node = msg_remote_node(msg);
387 u32 z_num;
388 u32 c_num;
389 u32 n_num;
390
Per Liden4323add2006-01-18 00:38:21 +0100391 c_ptr = tipc_cltr_find(rem_node);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100392 if (!c_ptr) {
Per Liden4323add2006-01-18 00:38:21 +0100393 c_ptr = tipc_cltr_create(rem_node);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100394 if (!c_ptr) {
395 buf_discard(buf);
396 return;
397 }
398 }
399
400 node_table = buf->data + msg_hdr_sz(msg);
401 table_size = msg_size(msg) - msg_hdr_sz(msg);
402 router = msg_prevnode(msg);
403 z_num = tipc_zone(rem_node);
404 c_num = tipc_cluster(rem_node);
405
406 switch (msg_type(msg)) {
407 case LOCAL_ROUTING_TABLE:
408 assert(is_slave(tipc_own_addr));
409 case EXT_ROUTING_TABLE:
410 for (n_num = 1; n_num < table_size; n_num++) {
411 if (node_table[n_num]) {
412 u32 addr = tipc_addr(z_num, c_num, n_num);
413 n_ptr = c_ptr->nodes[n_num];
414 if (!n_ptr) {
Per Liden4323add2006-01-18 00:38:21 +0100415 n_ptr = tipc_node_create(addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100416 }
417 if (n_ptr)
Per Liden4323add2006-01-18 00:38:21 +0100418 tipc_node_add_router(n_ptr, router);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100419 }
420 }
421 break;
422 case SLAVE_ROUTING_TABLE:
423 assert(!is_slave(tipc_own_addr));
424 assert(in_own_cluster(c_ptr->addr));
425 for (n_num = 1; n_num < table_size; n_num++) {
426 if (node_table[n_num]) {
427 u32 slave_num = n_num + LOWEST_SLAVE;
428 u32 addr = tipc_addr(z_num, c_num, slave_num);
429 n_ptr = c_ptr->nodes[slave_num];
430 if (!n_ptr) {
Per Liden4323add2006-01-18 00:38:21 +0100431 n_ptr = tipc_node_create(addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100432 }
433 if (n_ptr)
Per Liden4323add2006-01-18 00:38:21 +0100434 tipc_node_add_router(n_ptr, router);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100435 }
436 }
437 break;
438 case ROUTE_ADDITION:
439 if (!is_slave(tipc_own_addr)) {
440 assert(!in_own_cluster(c_ptr->addr)
441 || is_slave(rem_node));
442 } else {
443 assert(in_own_cluster(c_ptr->addr)
444 && !is_slave(rem_node));
445 }
446 n_ptr = c_ptr->nodes[tipc_node(rem_node)];
447 if (!n_ptr)
Per Liden4323add2006-01-18 00:38:21 +0100448 n_ptr = tipc_node_create(rem_node);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100449 if (n_ptr)
Per Liden4323add2006-01-18 00:38:21 +0100450 tipc_node_add_router(n_ptr, router);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100451 break;
452 case ROUTE_REMOVAL:
453 if (!is_slave(tipc_own_addr)) {
454 assert(!in_own_cluster(c_ptr->addr)
455 || is_slave(rem_node));
456 } else {
457 assert(in_own_cluster(c_ptr->addr)
458 && !is_slave(rem_node));
459 }
460 n_ptr = c_ptr->nodes[tipc_node(rem_node)];
461 if (n_ptr)
Per Liden4323add2006-01-18 00:38:21 +0100462 tipc_node_remove_router(n_ptr, router);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100463 break;
464 default:
465 assert(!"Illegal routing manager message received\n");
466 }
467 buf_discard(buf);
468}
469
Per Liden4323add2006-01-18 00:38:21 +0100470void tipc_cltr_remove_as_router(struct cluster *c_ptr, u32 router)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100471{
472 u32 start_entry;
473 u32 tstop;
474 u32 n_num;
475
476 if (is_slave(router))
477 return; /* Slave nodes can not be routers */
478
479 if (in_own_cluster(c_ptr->addr)) {
480 start_entry = LOWEST_SLAVE;
481 tstop = c_ptr->highest_slave;
482 } else {
483 start_entry = 1;
484 tstop = c_ptr->highest_node;
485 }
486
487 for (n_num = start_entry; n_num <= tstop; n_num++) {
488 if (c_ptr->nodes[n_num]) {
Per Liden4323add2006-01-18 00:38:21 +0100489 tipc_node_remove_router(c_ptr->nodes[n_num], router);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100490 }
491 }
492}
493
494/**
Per Liden4323add2006-01-18 00:38:21 +0100495 * tipc_cltr_multicast - multicast message to local nodes
Per Lidenb97bf3f2006-01-02 19:04:38 +0100496 */
497
Adrian Bunk988f0882006-03-20 22:37:52 -0800498static void tipc_cltr_multicast(struct cluster *c_ptr, struct sk_buff *buf,
Per Liden4323add2006-01-18 00:38:21 +0100499 u32 lower, u32 upper)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100500{
501 struct sk_buff *buf_copy;
502 struct node *n_ptr;
503 u32 n_num;
504 u32 tstop;
505
506 assert(lower <= upper);
507 assert(((lower >= 1) && (lower <= tipc_max_nodes)) ||
Per Liden4323add2006-01-18 00:38:21 +0100508 ((lower >= LOWEST_SLAVE) && (lower <= tipc_highest_allowed_slave)));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100509 assert(((upper >= 1) && (upper <= tipc_max_nodes)) ||
Per Liden4323add2006-01-18 00:38:21 +0100510 ((upper >= LOWEST_SLAVE) && (upper <= tipc_highest_allowed_slave)));
Per Lidenb97bf3f2006-01-02 19:04:38 +0100511 assert(in_own_cluster(c_ptr->addr));
512
513 tstop = is_slave(upper) ? c_ptr->highest_slave : c_ptr->highest_node;
514 if (tstop > upper)
515 tstop = upper;
516 for (n_num = lower; n_num <= tstop; n_num++) {
517 n_ptr = c_ptr->nodes[n_num];
Per Liden4323add2006-01-18 00:38:21 +0100518 if (n_ptr && tipc_node_has_active_links(n_ptr)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100519 buf_copy = skb_copy(buf, GFP_ATOMIC);
520 if (buf_copy == NULL)
521 break;
522 msg_set_destnode(buf_msg(buf_copy), n_ptr->addr);
Per Liden4323add2006-01-18 00:38:21 +0100523 tipc_link_send(buf_copy, n_ptr->addr, n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100524 }
525 }
526 buf_discard(buf);
527}
528
529/**
Per Liden4323add2006-01-18 00:38:21 +0100530 * tipc_cltr_broadcast - broadcast message to all nodes within cluster
Per Lidenb97bf3f2006-01-02 19:04:38 +0100531 */
532
Per Liden4323add2006-01-18 00:38:21 +0100533void tipc_cltr_broadcast(struct sk_buff *buf)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100534{
535 struct sk_buff *buf_copy;
536 struct cluster *c_ptr;
537 struct node *n_ptr;
538 u32 n_num;
539 u32 tstart;
540 u32 tstop;
541 u32 node_type;
542
543 if (tipc_mode == TIPC_NET_MODE) {
Per Liden4323add2006-01-18 00:38:21 +0100544 c_ptr = tipc_cltr_find(tipc_own_addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100545 assert(in_own_cluster(c_ptr->addr)); /* For now */
546
547 /* Send to standard nodes, then repeat loop sending to slaves */
548 tstart = 1;
549 tstop = c_ptr->highest_node;
550 for (node_type = 1; node_type <= 2; node_type++) {
551 for (n_num = tstart; n_num <= tstop; n_num++) {
552 n_ptr = c_ptr->nodes[n_num];
Per Liden4323add2006-01-18 00:38:21 +0100553 if (n_ptr && tipc_node_has_active_links(n_ptr)) {
Per Lidenb97bf3f2006-01-02 19:04:38 +0100554 buf_copy = skb_copy(buf, GFP_ATOMIC);
555 if (buf_copy == NULL)
556 goto exit;
557 msg_set_destnode(buf_msg(buf_copy),
558 n_ptr->addr);
Per Liden4323add2006-01-18 00:38:21 +0100559 tipc_link_send(buf_copy, n_ptr->addr,
560 n_ptr->addr);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100561 }
562 }
563 tstart = LOWEST_SLAVE;
564 tstop = c_ptr->highest_slave;
565 }
566 }
567exit:
568 buf_discard(buf);
569}
570
Per Liden4323add2006-01-18 00:38:21 +0100571int tipc_cltr_init(void)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100572{
Per Liden4323add2006-01-18 00:38:21 +0100573 tipc_highest_allowed_slave = LOWEST_SLAVE + tipc_max_slaves;
574 return tipc_cltr_create(tipc_own_addr) ? TIPC_OK : -ENOMEM;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100575}
576