2 * net/tipc/zone.c: TIPC zone management routines
4 * Copyright (c) 2000-2006, Ericsson AB
5 * Copyright (c) 2005, Wind River Systems
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
11 * 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.
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.
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.
41 #include "node_subscr.h"
45 struct _zone *tipc_zone_create(u32 addr)
47 struct _zone *z_ptr = 0;
50 if (!tipc_addr_domain_valid(addr))
53 z_ptr = (struct _zone *)kmalloc(sizeof(*z_ptr), GFP_ATOMIC);
55 memset(z_ptr, 0, sizeof(*z_ptr));
56 z_num = tipc_zone(addr);
57 z_ptr->addr = tipc_addr(z_num, 0, 0);
58 tipc_net.zones[z_num] = z_ptr;
63 void tipc_zone_delete(struct _zone *z_ptr)
69 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
70 tipc_cltr_delete(z_ptr->clusters[c_num]);
75 void tipc_zone_attach_cluster(struct _zone *z_ptr, struct cluster *c_ptr)
77 u32 c_num = tipc_cluster(c_ptr->addr);
80 assert(c_num <= tipc_max_clusters);
81 assert(z_ptr->clusters[c_num] == 0);
82 z_ptr->clusters[c_num] = c_ptr;
85 void tipc_zone_remove_as_router(struct _zone *z_ptr, u32 router)
89 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
90 if (z_ptr->clusters[c_num]) {
91 tipc_cltr_remove_as_router(z_ptr->clusters[c_num],
97 void tipc_zone_send_external_routes(struct _zone *z_ptr, u32 dest)
101 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
102 if (z_ptr->clusters[c_num]) {
103 if (in_own_cluster(z_ptr->addr))
105 tipc_cltr_send_ext_routes(z_ptr->clusters[c_num], dest);
110 struct node *tipc_zone_select_remote_node(struct _zone *z_ptr, u32 addr, u32 ref)
112 struct cluster *c_ptr;
118 c_ptr = z_ptr->clusters[tipc_cluster(addr)];
121 n_ptr = tipc_cltr_select_node(c_ptr, ref);
125 /* Links to any other clusters within this zone ? */
126 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
127 c_ptr = z_ptr->clusters[c_num];
130 n_ptr = tipc_cltr_select_node(c_ptr, ref);
137 u32 tipc_zone_select_router(struct _zone *z_ptr, u32 addr, u32 ref)
139 struct cluster *c_ptr;
145 c_ptr = z_ptr->clusters[tipc_cluster(addr)];
146 router = c_ptr ? tipc_cltr_select_router(c_ptr, ref) : 0;
150 /* Links to any other clusters within the zone? */
151 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
152 c_ptr = z_ptr->clusters[c_num];
153 router = c_ptr ? tipc_cltr_select_router(c_ptr, ref) : 0;
161 u32 tipc_zone_next_node(u32 addr)
163 struct cluster *c_ptr = tipc_cltr_find(addr);
166 return tipc_cltr_next_node(c_ptr, addr);