]>
Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/name_distr.c: TIPC name distribution code | |
c4307285 | 3 | * |
a5325ae5 | 4 | * Copyright (c) 2000-2006, 2014, 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 | 41 | /** |
3f8375fe AS |
42 | * struct publ_list - list of publications made by this node |
43 | * @list: circular list of publications | |
44 | * @list_size: number of entries in list | |
b97bf3fd | 45 | */ |
3f8375fe AS |
46 | struct publ_list { |
47 | struct list_head list; | |
48 | u32 size; | |
49 | }; | |
b97bf3fd | 50 | |
a909804f AS |
51 | static struct publ_list publ_zone = { |
52 | .list = LIST_HEAD_INIT(publ_zone.list), | |
53 | .size = 0, | |
54 | }; | |
55 | ||
3f8375fe AS |
56 | static struct publ_list publ_cluster = { |
57 | .list = LIST_HEAD_INIT(publ_cluster.list), | |
58 | .size = 0, | |
59 | }; | |
b97bf3fd | 60 | |
a909804f AS |
61 | static struct publ_list publ_node = { |
62 | .list = LIST_HEAD_INIT(publ_node.list), | |
63 | .size = 0, | |
64 | }; | |
65 | ||
66 | static struct publ_list *publ_lists[] = { | |
67 | NULL, | |
68 | &publ_zone, /* publ_lists[TIPC_ZONE_SCOPE] */ | |
69 | &publ_cluster, /* publ_lists[TIPC_CLUSTER_SCOPE] */ | |
70 | &publ_node /* publ_lists[TIPC_NODE_SCOPE] */ | |
71 | }; | |
72 | ||
73 | ||
a5325ae5 EH |
74 | int sysctl_tipc_named_timeout __read_mostly = 2000; |
75 | ||
76 | /** | |
77 | * struct tipc_dist_queue - queue holding deferred name table updates | |
78 | */ | |
79 | static struct list_head tipc_dist_queue = LIST_HEAD_INIT(tipc_dist_queue); | |
80 | ||
81 | struct distr_queue_item { | |
82 | struct distr_item i; | |
83 | u32 dtype; | |
84 | u32 node; | |
85 | unsigned long expires; | |
86 | struct list_head next; | |
87 | }; | |
88 | ||
b97bf3fd PL |
89 | /** |
90 | * publ_to_item - add publication info to a publication message | |
91 | */ | |
b97bf3fd PL |
92 | static void publ_to_item(struct distr_item *i, struct publication *p) |
93 | { | |
94 | i->type = htonl(p->type); | |
95 | i->lower = htonl(p->lower); | |
96 | i->upper = htonl(p->upper); | |
97 | i->ref = htonl(p->ref); | |
98 | i->key = htonl(p->key); | |
b97bf3fd PL |
99 | } |
100 | ||
101 | /** | |
102 | * named_prepare_buf - allocate & initialize a publication message | |
103 | */ | |
b97bf3fd PL |
104 | static struct sk_buff *named_prepare_buf(u32 type, u32 size, u32 dest) |
105 | { | |
741d9eb7 | 106 | struct sk_buff *buf = tipc_buf_acquire(INT_H_SIZE + size); |
b97bf3fd PL |
107 | struct tipc_msg *msg; |
108 | ||
109 | if (buf != NULL) { | |
110 | msg = buf_msg(buf); | |
741d9eb7 AS |
111 | tipc_msg_init(msg, NAME_DISTRIBUTOR, type, INT_H_SIZE, dest); |
112 | msg_set_size(msg, INT_H_SIZE + size); | |
b97bf3fd PL |
113 | } |
114 | return buf; | |
115 | } | |
116 | ||
eab8c045 | 117 | void named_cluster_distribute(struct sk_buff *buf) |
8f92df6a | 118 | { |
dbdf6d24 JPM |
119 | struct sk_buff *obuf; |
120 | struct tipc_node *node; | |
121 | u32 dnode; | |
8f92df6a | 122 | |
6c7a762e | 123 | rcu_read_lock(); |
dbdf6d24 JPM |
124 | list_for_each_entry_rcu(node, &tipc_node_list, list) { |
125 | dnode = node->addr; | |
126 | if (in_own_node(dnode)) | |
127 | continue; | |
128 | if (!tipc_node_active_links(node)) | |
129 | continue; | |
130 | obuf = skb_copy(buf, GFP_ATOMIC); | |
131 | if (!obuf) | |
132 | break; | |
133 | msg_set_destnode(buf_msg(obuf), dnode); | |
9fbfb8b1 | 134 | tipc_link_xmit(obuf, dnode, dnode); |
8f92df6a | 135 | } |
6c7a762e | 136 | rcu_read_unlock(); |
8f92df6a | 137 | |
5f6d9123 | 138 | kfree_skb(buf); |
8f92df6a AS |
139 | } |
140 | ||
b97bf3fd | 141 | /** |
4323add6 | 142 | * tipc_named_publish - tell other nodes about a new publication by this node |
b97bf3fd | 143 | */ |
eab8c045 | 144 | struct sk_buff *tipc_named_publish(struct publication *publ) |
b97bf3fd PL |
145 | { |
146 | struct sk_buff *buf; | |
147 | struct distr_item *item; | |
148 | ||
a909804f AS |
149 | list_add_tail(&publ->local_list, &publ_lists[publ->scope]->list); |
150 | publ_lists[publ->scope]->size++; | |
b97bf3fd | 151 | |
1110b8d3 | 152 | if (publ->scope == TIPC_NODE_SCOPE) |
eab8c045 | 153 | return NULL; |
1110b8d3 | 154 | |
b97bf3fd PL |
155 | buf = named_prepare_buf(PUBLICATION, ITEM_SIZE, 0); |
156 | if (!buf) { | |
2cf8aa19 | 157 | pr_warn("Publication distribution failure\n"); |
eab8c045 | 158 | return NULL; |
b97bf3fd PL |
159 | } |
160 | ||
161 | item = (struct distr_item *)msg_data(buf_msg(buf)); | |
162 | publ_to_item(item, publ); | |
eab8c045 | 163 | return buf; |
b97bf3fd PL |
164 | } |
165 | ||
166 | /** | |
4323add6 | 167 | * tipc_named_withdraw - tell other nodes about a withdrawn publication by this node |
b97bf3fd | 168 | */ |
eab8c045 | 169 | struct sk_buff *tipc_named_withdraw(struct publication *publ) |
b97bf3fd PL |
170 | { |
171 | struct sk_buff *buf; | |
172 | struct distr_item *item; | |
173 | ||
174 | list_del(&publ->local_list); | |
a909804f | 175 | publ_lists[publ->scope]->size--; |
b97bf3fd | 176 | |
1110b8d3 | 177 | if (publ->scope == TIPC_NODE_SCOPE) |
eab8c045 | 178 | return NULL; |
1110b8d3 | 179 | |
b97bf3fd PL |
180 | buf = named_prepare_buf(WITHDRAWAL, ITEM_SIZE, 0); |
181 | if (!buf) { | |
2cf8aa19 | 182 | pr_warn("Withdrawal distribution failure\n"); |
eab8c045 | 183 | return NULL; |
b97bf3fd PL |
184 | } |
185 | ||
186 | item = (struct distr_item *)msg_data(buf_msg(buf)); | |
187 | publ_to_item(item, publ); | |
eab8c045 | 188 | return buf; |
b97bf3fd PL |
189 | } |
190 | ||
dbdf6d24 | 191 | /** |
e11aa059 | 192 | * named_distribute - prepare name info for bulk distribution to another node |
dbdf6d24 JPM |
193 | * @msg_list: list of messages (buffers) to be returned from this function |
194 | * @dnode: node to be updated | |
195 | * @pls: linked list of publication items to be packed into buffer chain | |
e11aa059 | 196 | */ |
dbdf6d24 JPM |
197 | static void named_distribute(struct list_head *msg_list, u32 dnode, |
198 | struct publ_list *pls) | |
e11aa059 AS |
199 | { |
200 | struct publication *publ; | |
201 | struct sk_buff *buf = NULL; | |
202 | struct distr_item *item = NULL; | |
dbdf6d24 JPM |
203 | uint dsz = pls->size * ITEM_SIZE; |
204 | uint msg_dsz = (tipc_node_get_mtu(dnode, 0) / ITEM_SIZE) * ITEM_SIZE; | |
205 | uint rem = dsz; | |
206 | uint msg_rem = 0; | |
e11aa059 AS |
207 | |
208 | list_for_each_entry(publ, &pls->list, local_list) { | |
dbdf6d24 | 209 | /* Prepare next buffer: */ |
e11aa059 | 210 | if (!buf) { |
dbdf6d24 JPM |
211 | msg_rem = min_t(uint, rem, msg_dsz); |
212 | rem -= msg_rem; | |
213 | buf = named_prepare_buf(PUBLICATION, msg_rem, dnode); | |
e11aa059 | 214 | if (!buf) { |
2cf8aa19 | 215 | pr_warn("Bulk publication failure\n"); |
e11aa059 AS |
216 | return; |
217 | } | |
218 | item = (struct distr_item *)msg_data(buf_msg(buf)); | |
219 | } | |
dbdf6d24 JPM |
220 | |
221 | /* Pack publication into message: */ | |
e11aa059 AS |
222 | publ_to_item(item, publ); |
223 | item++; | |
dbdf6d24 JPM |
224 | msg_rem -= ITEM_SIZE; |
225 | ||
226 | /* Append full buffer to list: */ | |
227 | if (!msg_rem) { | |
228 | list_add_tail((struct list_head *)buf, msg_list); | |
e11aa059 AS |
229 | buf = NULL; |
230 | } | |
231 | } | |
232 | } | |
233 | ||
b97bf3fd | 234 | /** |
4323add6 | 235 | * tipc_named_node_up - tell specified node about all publications by this node |
b97bf3fd | 236 | */ |
dbdf6d24 | 237 | void tipc_named_node_up(u32 dnode) |
b97bf3fd | 238 | { |
dbdf6d24 JPM |
239 | LIST_HEAD(msg_list); |
240 | struct sk_buff *buf_chain; | |
9aa88c2a | 241 | |
c4307285 | 242 | read_lock_bh(&tipc_nametbl_lock); |
dbdf6d24 JPM |
243 | named_distribute(&msg_list, dnode, &publ_cluster); |
244 | named_distribute(&msg_list, dnode, &publ_zone); | |
c4307285 | 245 | read_unlock_bh(&tipc_nametbl_lock); |
9aa88c2a | 246 | |
dbdf6d24 JPM |
247 | /* Convert circular list to linear list and send: */ |
248 | buf_chain = (struct sk_buff *)msg_list.next; | |
249 | ((struct sk_buff *)msg_list.prev)->next = NULL; | |
9fbfb8b1 | 250 | tipc_link_xmit(buf_chain, dnode, dnode); |
b97bf3fd PL |
251 | } |
252 | ||
a8f48af5 YX |
253 | static void tipc_publ_subscribe(struct publication *publ, u32 addr) |
254 | { | |
255 | struct tipc_node *node; | |
256 | ||
257 | if (in_own_node(addr)) | |
258 | return; | |
259 | ||
260 | node = tipc_node_find(addr); | |
261 | if (!node) { | |
262 | pr_warn("Node subscription rejected, unknown node 0x%x\n", | |
263 | addr); | |
264 | return; | |
265 | } | |
266 | ||
267 | tipc_node_lock(node); | |
268 | list_add_tail(&publ->nodesub_list, &node->publ_list); | |
269 | tipc_node_unlock(node); | |
270 | } | |
271 | ||
272 | static void tipc_publ_unsubscribe(struct publication *publ, u32 addr) | |
273 | { | |
274 | struct tipc_node *node; | |
275 | ||
276 | node = tipc_node_find(addr); | |
277 | if (!node) | |
278 | return; | |
279 | ||
280 | tipc_node_lock(node); | |
281 | list_del_init(&publ->nodesub_list); | |
282 | tipc_node_unlock(node); | |
283 | } | |
284 | ||
b97bf3fd | 285 | /** |
a8f48af5 | 286 | * tipc_publ_purge - remove publication associated with a failed node |
c4307285 YH |
287 | * |
288 | * Invoked for each publication issued by a newly failed node. | |
b97bf3fd | 289 | * Removes publication structure from name table & deletes it. |
b97bf3fd | 290 | */ |
a8f48af5 | 291 | static void tipc_publ_purge(struct publication *publ, u32 addr) |
b97bf3fd PL |
292 | { |
293 | struct publication *p; | |
f131072c | 294 | |
c4307285 | 295 | write_lock_bh(&tipc_nametbl_lock); |
c4307285 | 296 | p = tipc_nametbl_remove_publ(publ->type, publ->lower, |
4323add6 | 297 | publ->node, publ->ref, publ->key); |
431697eb | 298 | if (p) |
a8f48af5 | 299 | tipc_publ_unsubscribe(p, addr); |
4323add6 | 300 | write_unlock_bh(&tipc_nametbl_lock); |
f131072c | 301 | |
c4307285 | 302 | if (p != publ) { |
2cf8aa19 EH |
303 | pr_err("Unable to remove publication from failed node\n" |
304 | " (type=%u, lower=%u, node=0x%x, ref=%u, key=%u)\n", | |
305 | publ->type, publ->lower, publ->node, publ->ref, | |
306 | publ->key); | |
f131072c AS |
307 | } |
308 | ||
e83504f7 | 309 | kfree(p); |
b97bf3fd PL |
310 | } |
311 | ||
a8f48af5 YX |
312 | void tipc_publ_notify(struct list_head *nsub_list, u32 addr) |
313 | { | |
314 | struct publication *publ, *tmp; | |
315 | ||
316 | list_for_each_entry_safe(publ, tmp, nsub_list, nodesub_list) | |
317 | tipc_publ_purge(publ, addr); | |
318 | } | |
319 | ||
f4ad8a4b EH |
320 | /** |
321 | * tipc_update_nametbl - try to process a nametable update and notify | |
322 | * subscribers | |
323 | * | |
324 | * tipc_nametbl_lock must be held. | |
325 | * Returns the publication item if successful, otherwise NULL. | |
326 | */ | |
0fc4dffa | 327 | static bool tipc_update_nametbl(struct distr_item *i, u32 node, u32 dtype) |
f4ad8a4b EH |
328 | { |
329 | struct publication *publ = NULL; | |
330 | ||
331 | if (dtype == PUBLICATION) { | |
332 | publ = tipc_nametbl_insert_publ(ntohl(i->type), ntohl(i->lower), | |
333 | ntohl(i->upper), | |
334 | TIPC_CLUSTER_SCOPE, node, | |
335 | ntohl(i->ref), ntohl(i->key)); | |
336 | if (publ) { | |
a8f48af5 | 337 | tipc_publ_subscribe(publ, node); |
0fc4dffa | 338 | return true; |
f4ad8a4b EH |
339 | } |
340 | } else if (dtype == WITHDRAWAL) { | |
341 | publ = tipc_nametbl_remove_publ(ntohl(i->type), ntohl(i->lower), | |
342 | node, ntohl(i->ref), | |
343 | ntohl(i->key)); | |
344 | if (publ) { | |
a8f48af5 | 345 | tipc_publ_unsubscribe(publ, node); |
f4ad8a4b | 346 | kfree(publ); |
0fc4dffa | 347 | return true; |
f4ad8a4b EH |
348 | } |
349 | } else { | |
350 | pr_warn("Unrecognized name table message received\n"); | |
351 | } | |
0fc4dffa | 352 | return false; |
f4ad8a4b EH |
353 | } |
354 | ||
a5325ae5 EH |
355 | /** |
356 | * tipc_named_add_backlog - add a failed name table update to the backlog | |
357 | * | |
358 | */ | |
359 | static void tipc_named_add_backlog(struct distr_item *i, u32 type, u32 node) | |
360 | { | |
361 | struct distr_queue_item *e; | |
362 | unsigned long now = get_jiffies_64(); | |
363 | ||
364 | e = kzalloc(sizeof(*e), GFP_ATOMIC); | |
365 | if (!e) | |
366 | return; | |
367 | e->dtype = type; | |
368 | e->node = node; | |
369 | e->expires = now + msecs_to_jiffies(sysctl_tipc_named_timeout); | |
370 | memcpy(e, i, sizeof(*i)); | |
371 | list_add_tail(&e->next, &tipc_dist_queue); | |
372 | } | |
373 | ||
374 | /** | |
375 | * tipc_named_process_backlog - try to process any pending name table updates | |
376 | * from the network. | |
377 | */ | |
378 | void tipc_named_process_backlog(void) | |
379 | { | |
380 | struct distr_queue_item *e, *tmp; | |
381 | char addr[16]; | |
382 | unsigned long now = get_jiffies_64(); | |
383 | ||
384 | list_for_each_entry_safe(e, tmp, &tipc_dist_queue, next) { | |
385 | if (time_after(e->expires, now)) { | |
386 | if (!tipc_update_nametbl(&e->i, e->node, e->dtype)) | |
387 | continue; | |
388 | } else { | |
389 | tipc_addr_string_fill(addr, e->node); | |
390 | pr_warn_ratelimited("Dropping name table update (%d) of {%u, %u, %u} from %s key=%u\n", | |
391 | e->dtype, ntohl(e->i.type), | |
392 | ntohl(e->i.lower), | |
393 | ntohl(e->i.upper), | |
394 | addr, ntohl(e->i.key)); | |
395 | } | |
396 | list_del(&e->next); | |
397 | kfree(e); | |
398 | } | |
399 | } | |
400 | ||
b97bf3fd | 401 | /** |
247f0f3c | 402 | * tipc_named_rcv - process name table update message sent by another node |
b97bf3fd | 403 | */ |
247f0f3c | 404 | void tipc_named_rcv(struct sk_buff *buf) |
b97bf3fd | 405 | { |
b97bf3fd PL |
406 | struct tipc_msg *msg = buf_msg(buf); |
407 | struct distr_item *item = (struct distr_item *)msg_data(msg); | |
408 | u32 count = msg_data_sz(msg) / ITEM_SIZE; | |
a5325ae5 | 409 | u32 node = msg_orignode(msg); |
b97bf3fd | 410 | |
c4307285 | 411 | write_lock_bh(&tipc_nametbl_lock); |
b97bf3fd | 412 | while (count--) { |
a5325ae5 EH |
413 | if (!tipc_update_nametbl(item, node, msg_type(msg))) |
414 | tipc_named_add_backlog(item, msg_type(msg), node); | |
b97bf3fd PL |
415 | item++; |
416 | } | |
a5325ae5 | 417 | tipc_named_process_backlog(); |
c4307285 | 418 | write_unlock_bh(&tipc_nametbl_lock); |
5f6d9123 | 419 | kfree_skb(buf); |
b97bf3fd PL |
420 | } |
421 | ||
422 | /** | |
1110b8d3 | 423 | * tipc_named_reinit - re-initialize local publications |
c4307285 | 424 | * |
945af1c3 | 425 | * This routine is called whenever TIPC networking is enabled. |
1110b8d3 AS |
426 | * All name table entries published by this node are updated to reflect |
427 | * the node's new network address. | |
b97bf3fd | 428 | */ |
4323add6 | 429 | void tipc_named_reinit(void) |
b97bf3fd PL |
430 | { |
431 | struct publication *publ; | |
a909804f | 432 | int scope; |
b97bf3fd | 433 | |
c4307285 | 434 | write_lock_bh(&tipc_nametbl_lock); |
945af1c3 | 435 | |
1110b8d3 | 436 | for (scope = TIPC_ZONE_SCOPE; scope <= TIPC_NODE_SCOPE; scope++) |
a909804f AS |
437 | list_for_each_entry(publ, &publ_lists[scope]->list, local_list) |
438 | publ->node = tipc_own_addr; | |
945af1c3 | 439 | |
c4307285 | 440 | write_unlock_bh(&tipc_nametbl_lock); |
b97bf3fd | 441 | } |