tjh.dev
Linux kernel mirror (for testing)
git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
kernel
os
linux
1/*
2 * net/tipc/zone.c: TIPC zone management routines
3 *
4 * Copyright (c) 2000-2006, Ericsson AB
5 * Copyright (c) 2005, Wind River Systems
6 * 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 *
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.
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.
23 *
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
45struct _zone *tipc_zone_create(u32 addr)
46{
47 struct _zone *z_ptr;
48 u32 z_num;
49
50 if (!tipc_addr_domain_valid(addr)) {
51 err("Zone creation failed, invalid domain 0x%x\n", addr);
52 return NULL;
53 }
54
55 z_ptr = (struct _zone *)kmalloc(sizeof(*z_ptr), GFP_ATOMIC);
56 if (!z_ptr) {
57 warn("Zone creation failed, insufficient memory\n");
58 return NULL;
59 }
60
61 memset(z_ptr, 0, sizeof(*z_ptr));
62 z_num = tipc_zone(addr);
63 z_ptr->addr = tipc_addr(z_num, 0, 0);
64 tipc_net.zones[z_num] = z_ptr;
65 return z_ptr;
66}
67
68void tipc_zone_delete(struct _zone *z_ptr)
69{
70 u32 c_num;
71
72 if (!z_ptr)
73 return;
74 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
75 tipc_cltr_delete(z_ptr->clusters[c_num]);
76 }
77 kfree(z_ptr);
78}
79
80void tipc_zone_attach_cluster(struct _zone *z_ptr, struct cluster *c_ptr)
81{
82 u32 c_num = tipc_cluster(c_ptr->addr);
83
84 assert(c_ptr->addr);
85 assert(c_num <= tipc_max_clusters);
86 assert(z_ptr->clusters[c_num] == 0);
87 z_ptr->clusters[c_num] = c_ptr;
88}
89
90void tipc_zone_remove_as_router(struct _zone *z_ptr, u32 router)
91{
92 u32 c_num;
93
94 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
95 if (z_ptr->clusters[c_num]) {
96 tipc_cltr_remove_as_router(z_ptr->clusters[c_num],
97 router);
98 }
99 }
100}
101
102void tipc_zone_send_external_routes(struct _zone *z_ptr, u32 dest)
103{
104 u32 c_num;
105
106 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
107 if (z_ptr->clusters[c_num]) {
108 if (in_own_cluster(z_ptr->addr))
109 continue;
110 tipc_cltr_send_ext_routes(z_ptr->clusters[c_num], dest);
111 }
112 }
113}
114
115struct node *tipc_zone_select_remote_node(struct _zone *z_ptr, u32 addr, u32 ref)
116{
117 struct cluster *c_ptr;
118 struct node *n_ptr;
119 u32 c_num;
120
121 if (!z_ptr)
122 return NULL;
123 c_ptr = z_ptr->clusters[tipc_cluster(addr)];
124 if (!c_ptr)
125 return NULL;
126 n_ptr = tipc_cltr_select_node(c_ptr, ref);
127 if (n_ptr)
128 return n_ptr;
129
130 /* Links to any other clusters within this zone ? */
131 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
132 c_ptr = z_ptr->clusters[c_num];
133 if (!c_ptr)
134 return NULL;
135 n_ptr = tipc_cltr_select_node(c_ptr, ref);
136 if (n_ptr)
137 return n_ptr;
138 }
139 return NULL;
140}
141
142u32 tipc_zone_select_router(struct _zone *z_ptr, u32 addr, u32 ref)
143{
144 struct cluster *c_ptr;
145 u32 c_num;
146 u32 router;
147
148 if (!z_ptr)
149 return 0;
150 c_ptr = z_ptr->clusters[tipc_cluster(addr)];
151 router = c_ptr ? tipc_cltr_select_router(c_ptr, ref) : 0;
152 if (router)
153 return router;
154
155 /* Links to any other clusters within the zone? */
156 for (c_num = 1; c_num <= tipc_max_clusters; c_num++) {
157 c_ptr = z_ptr->clusters[c_num];
158 router = c_ptr ? tipc_cltr_select_router(c_ptr, ref) : 0;
159 if (router)
160 return router;
161 }
162 return 0;
163}
164
165
166u32 tipc_zone_next_node(u32 addr)
167{
168 struct cluster *c_ptr = tipc_cltr_find(addr);
169
170 if (c_ptr)
171 return tipc_cltr_next_node(c_ptr, addr);
172 return 0;
173}
174