]>
Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/name_distr.c: TIPC name distribution code | |
c4307285 | 3 | * |
593a5f22 | 4 | * Copyright (c) 2000-2006, Ericsson AB |
431697eb | 5 | * Copyright (c) 2005, 2010-2011, Wind River Systems |
b97bf3fd PL |
6 | * All rights reserved. |
7 | * | |
9ea1fd3c | 8 | * Redistribution and use in source and binary forms, with or without |
b97bf3fd PL |
9 | * modification, are permitted provided that the following conditions are met: |
10 | * | |
9ea1fd3c PL |
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. | |
b97bf3fd | 19 | * |
9ea1fd3c PL |
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 | |
b97bf3fd PL |
34 | * POSSIBILITY OF SUCH DAMAGE. |
35 | */ | |
36 | ||
37 | #include "core.h" | |
b97bf3fd | 38 | #include "link.h" |
b97bf3fd PL |
39 | #include "name_distr.h" |
40 | ||
b97bf3fd PL |
41 | #define ITEM_SIZE sizeof(struct distr_item) |
42 | ||
43 | /** | |
44 | * struct distr_item - publication info distributed to other nodes | |
45 | * @type: name sequence type | |
46 | * @lower: name sequence lower bound | |
47 | * @upper: name sequence upper bound | |
48 | * @ref: publishing port reference | |
49 | * @key: publication key | |
c4307285 | 50 | * |
b97bf3fd | 51 | * ===> All fields are stored in network byte order. <=== |
c4307285 | 52 | * |
b97bf3fd PL |
53 | * First 3 fields identify (name or) name sequence being published. |
54 | * Reference field uniquely identifies port that published name sequence. | |
55 | * Key field uniquely identifies publication, in the event a port has | |
56 | * multiple publications of the same name sequence. | |
c4307285 YH |
57 | * |
58 | * Note: There is no field that identifies the publishing node because it is | |
b97bf3fd PL |
59 | * the same for all items contained within a publication message. |
60 | */ | |
61 | ||
62 | struct distr_item { | |
3e6c8cd5 AV |
63 | __be32 type; |
64 | __be32 lower; | |
65 | __be32 upper; | |
66 | __be32 ref; | |
67 | __be32 key; | |
b97bf3fd PL |
68 | }; |
69 | ||
70 | /** | |
c4307285 | 71 | * List of externally visible publications by this node -- |
b97bf3fd PL |
72 | * that is, all publications having scope > TIPC_NODE_SCOPE. |
73 | */ | |
74 | ||
75 | static LIST_HEAD(publ_root); | |
e3ec9c7d | 76 | static u32 publ_cnt; |
b97bf3fd PL |
77 | |
78 | /** | |
79 | * publ_to_item - add publication info to a publication message | |
80 | */ | |
81 | ||
82 | static void publ_to_item(struct distr_item *i, struct publication *p) | |
83 | { | |
84 | i->type = htonl(p->type); | |
85 | i->lower = htonl(p->lower); | |
86 | i->upper = htonl(p->upper); | |
87 | i->ref = htonl(p->ref); | |
88 | i->key = htonl(p->key); | |
b97bf3fd PL |
89 | } |
90 | ||
91 | /** | |
92 | * named_prepare_buf - allocate & initialize a publication message | |
93 | */ | |
94 | ||
95 | static struct sk_buff *named_prepare_buf(u32 type, u32 size, u32 dest) | |
96 | { | |
31e3c3f6 | 97 | struct sk_buff *buf = tipc_buf_acquire(LONG_H_SIZE + size); |
b97bf3fd PL |
98 | struct tipc_msg *msg; |
99 | ||
100 | if (buf != NULL) { | |
101 | msg = buf_msg(buf); | |
c68ca7b7 | 102 | tipc_msg_init(msg, NAME_DISTRIBUTOR, type, LONG_H_SIZE, dest); |
b97bf3fd PL |
103 | msg_set_size(msg, LONG_H_SIZE + size); |
104 | } | |
105 | return buf; | |
106 | } | |
107 | ||
8f92df6a AS |
108 | static void named_cluster_distribute(struct sk_buff *buf) |
109 | { | |
110 | struct sk_buff *buf_copy; | |
111 | struct tipc_node *n_ptr; | |
112 | u32 n_num; | |
113 | ||
114 | for (n_num = 1; n_num <= tipc_net.highest_node; n_num++) { | |
115 | n_ptr = tipc_net.nodes[n_num]; | |
116 | if (n_ptr && tipc_node_has_active_links(n_ptr)) { | |
117 | buf_copy = skb_copy(buf, GFP_ATOMIC); | |
118 | if (!buf_copy) | |
119 | break; | |
120 | msg_set_destnode(buf_msg(buf_copy), n_ptr->addr); | |
121 | tipc_link_send(buf_copy, n_ptr->addr, n_ptr->addr); | |
122 | } | |
123 | } | |
124 | ||
125 | buf_discard(buf); | |
126 | } | |
127 | ||
b97bf3fd | 128 | /** |
4323add6 | 129 | * tipc_named_publish - tell other nodes about a new publication by this node |
b97bf3fd PL |
130 | */ |
131 | ||
4323add6 | 132 | void tipc_named_publish(struct publication *publ) |
b97bf3fd PL |
133 | { |
134 | struct sk_buff *buf; | |
135 | struct distr_item *item; | |
136 | ||
08c31f71 | 137 | list_add_tail(&publ->local_list, &publ_root); |
b97bf3fd PL |
138 | publ_cnt++; |
139 | ||
140 | buf = named_prepare_buf(PUBLICATION, ITEM_SIZE, 0); | |
141 | if (!buf) { | |
a10bd924 | 142 | warn("Publication distribution failure\n"); |
b97bf3fd PL |
143 | return; |
144 | } | |
145 | ||
146 | item = (struct distr_item *)msg_data(buf_msg(buf)); | |
147 | publ_to_item(item, publ); | |
8f92df6a | 148 | named_cluster_distribute(buf); |
b97bf3fd PL |
149 | } |
150 | ||
151 | /** | |
4323add6 | 152 | * tipc_named_withdraw - tell other nodes about a withdrawn publication by this node |
b97bf3fd PL |
153 | */ |
154 | ||
4323add6 | 155 | void tipc_named_withdraw(struct publication *publ) |
b97bf3fd PL |
156 | { |
157 | struct sk_buff *buf; | |
158 | struct distr_item *item; | |
159 | ||
160 | list_del(&publ->local_list); | |
161 | publ_cnt--; | |
162 | ||
163 | buf = named_prepare_buf(WITHDRAWAL, ITEM_SIZE, 0); | |
164 | if (!buf) { | |
a10bd924 | 165 | warn("Withdrawl distribution failure\n"); |
b97bf3fd PL |
166 | return; |
167 | } | |
168 | ||
169 | item = (struct distr_item *)msg_data(buf_msg(buf)); | |
170 | publ_to_item(item, publ); | |
8f92df6a | 171 | named_cluster_distribute(buf); |
b97bf3fd PL |
172 | } |
173 | ||
174 | /** | |
4323add6 | 175 | * tipc_named_node_up - tell specified node about all publications by this node |
b97bf3fd PL |
176 | */ |
177 | ||
4323add6 | 178 | void tipc_named_node_up(unsigned long node) |
b97bf3fd PL |
179 | { |
180 | struct publication *publ; | |
1fc54d8f SR |
181 | struct distr_item *item = NULL; |
182 | struct sk_buff *buf = NULL; | |
b97bf3fd PL |
183 | u32 left = 0; |
184 | u32 rest; | |
185 | u32 max_item_buf; | |
186 | ||
c4307285 | 187 | read_lock_bh(&tipc_nametbl_lock); |
b97bf3fd PL |
188 | max_item_buf = TIPC_MAX_USER_MSG_SIZE / ITEM_SIZE; |
189 | max_item_buf *= ITEM_SIZE; | |
190 | rest = publ_cnt * ITEM_SIZE; | |
191 | ||
192 | list_for_each_entry(publ, &publ_root, local_list) { | |
193 | if (!buf) { | |
194 | left = (rest <= max_item_buf) ? rest : max_item_buf; | |
195 | rest -= left; | |
c4307285 | 196 | buf = named_prepare_buf(PUBLICATION, left, node); |
a10bd924 AS |
197 | if (!buf) { |
198 | warn("Bulk publication distribution failure\n"); | |
b97bf3fd PL |
199 | goto exit; |
200 | } | |
201 | item = (struct distr_item *)msg_data(buf_msg(buf)); | |
202 | } | |
203 | publ_to_item(item, publ); | |
204 | item++; | |
205 | left -= ITEM_SIZE; | |
206 | if (!left) { | |
207 | msg_set_link_selector(buf_msg(buf), node); | |
4323add6 | 208 | tipc_link_send(buf, node, node); |
1fc54d8f | 209 | buf = NULL; |
b97bf3fd PL |
210 | } |
211 | } | |
212 | exit: | |
c4307285 | 213 | read_unlock_bh(&tipc_nametbl_lock); |
b97bf3fd PL |
214 | } |
215 | ||
216 | /** | |
217 | * node_is_down - remove publication associated with a failed node | |
c4307285 YH |
218 | * |
219 | * Invoked for each publication issued by a newly failed node. | |
b97bf3fd PL |
220 | * Removes publication structure from name table & deletes it. |
221 | * In rare cases the link may have come back up again when this | |
222 | * function is called, and we have two items representing the same | |
223 | * publication. Nudge this item's key to distinguish it from the other. | |
b97bf3fd PL |
224 | */ |
225 | ||
226 | static void node_is_down(struct publication *publ) | |
227 | { | |
228 | struct publication *p; | |
f131072c | 229 | |
c4307285 | 230 | write_lock_bh(&tipc_nametbl_lock); |
c4307285 YH |
231 | publ->key += 1222345; |
232 | p = tipc_nametbl_remove_publ(publ->type, publ->lower, | |
4323add6 | 233 | publ->node, publ->ref, publ->key); |
431697eb AS |
234 | if (p) |
235 | tipc_nodesub_unsubscribe(&p->subscr); | |
4323add6 | 236 | write_unlock_bh(&tipc_nametbl_lock); |
f131072c | 237 | |
c4307285 | 238 | if (p != publ) { |
f131072c AS |
239 | err("Unable to remove publication from failed node\n" |
240 | "(type=%u, lower=%u, node=0x%x, ref=%u, key=%u)\n", | |
241 | publ->type, publ->lower, publ->node, publ->ref, publ->key); | |
242 | } | |
243 | ||
e83504f7 | 244 | kfree(p); |
b97bf3fd PL |
245 | } |
246 | ||
247 | /** | |
4323add6 | 248 | * tipc_named_recv - process name table update message sent by another node |
b97bf3fd PL |
249 | */ |
250 | ||
4323add6 | 251 | void tipc_named_recv(struct sk_buff *buf) |
b97bf3fd PL |
252 | { |
253 | struct publication *publ; | |
254 | struct tipc_msg *msg = buf_msg(buf); | |
255 | struct distr_item *item = (struct distr_item *)msg_data(msg); | |
256 | u32 count = msg_data_sz(msg) / ITEM_SIZE; | |
257 | ||
c4307285 | 258 | write_lock_bh(&tipc_nametbl_lock); |
b97bf3fd PL |
259 | while (count--) { |
260 | if (msg_type(msg) == PUBLICATION) { | |
c4307285 | 261 | publ = tipc_nametbl_insert_publ(ntohl(item->type), |
4323add6 PL |
262 | ntohl(item->lower), |
263 | ntohl(item->upper), | |
264 | TIPC_CLUSTER_SCOPE, | |
c4307285 | 265 | msg_orignode(msg), |
4323add6 PL |
266 | ntohl(item->ref), |
267 | ntohl(item->key)); | |
b97bf3fd | 268 | if (publ) { |
c4307285 YH |
269 | tipc_nodesub_subscribe(&publ->subscr, |
270 | msg_orignode(msg), | |
4323add6 PL |
271 | publ, |
272 | (net_ev_handler)node_is_down); | |
b97bf3fd PL |
273 | } |
274 | } else if (msg_type(msg) == WITHDRAWAL) { | |
4323add6 PL |
275 | publ = tipc_nametbl_remove_publ(ntohl(item->type), |
276 | ntohl(item->lower), | |
277 | msg_orignode(msg), | |
278 | ntohl(item->ref), | |
279 | ntohl(item->key)); | |
b97bf3fd PL |
280 | |
281 | if (publ) { | |
4323add6 | 282 | tipc_nodesub_unsubscribe(&publ->subscr); |
c4307285 | 283 | kfree(publ); |
f131072c AS |
284 | } else { |
285 | err("Unable to remove publication by node 0x%x\n" | |
286 | "(type=%u, lower=%u, ref=%u, key=%u)\n", | |
287 | msg_orignode(msg), | |
288 | ntohl(item->type), ntohl(item->lower), | |
289 | ntohl(item->ref), ntohl(item->key)); | |
b97bf3fd PL |
290 | } |
291 | } else { | |
a10bd924 | 292 | warn("Unrecognized name table message received\n"); |
b97bf3fd PL |
293 | } |
294 | item++; | |
295 | } | |
c4307285 | 296 | write_unlock_bh(&tipc_nametbl_lock); |
b97bf3fd PL |
297 | buf_discard(buf); |
298 | } | |
299 | ||
300 | /** | |
4323add6 | 301 | * tipc_named_reinit - re-initialize local publication list |
c4307285 | 302 | * |
b97bf3fd PL |
303 | * This routine is called whenever TIPC networking is (re)enabled. |
304 | * All existing publications by this node that have "cluster" or "zone" scope | |
305 | * are updated to reflect the node's current network address. | |
306 | * (If the node's address is unchanged, the update loop terminates immediately.) | |
307 | */ | |
308 | ||
4323add6 | 309 | void tipc_named_reinit(void) |
b97bf3fd PL |
310 | { |
311 | struct publication *publ; | |
312 | ||
c4307285 | 313 | write_lock_bh(&tipc_nametbl_lock); |
b97bf3fd PL |
314 | list_for_each_entry(publ, &publ_root, local_list) { |
315 | if (publ->node == tipc_own_addr) | |
316 | break; | |
317 | publ->node = tipc_own_addr; | |
318 | } | |
c4307285 | 319 | write_unlock_bh(&tipc_nametbl_lock); |
b97bf3fd | 320 | } |